1 /* Handle parameterized types (templates) for GNU C++.
2 Copyright (C) 1992, 93, 94, 95, 96, 1997 Free Software Foundation, Inc.
3 Written by Ken Raeburn (raeburn@cygnus.com) while at Watchmaker Computing.
4 Rewritten by Jason Merrill (jason@cygnus.com).
6 This file is part of GNU CC.
8 GNU CC is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 2, or (at your option)
13 GNU CC is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GNU CC; see the file COPYING. If not, write to
20 the Free Software Foundation, 59 Temple Place - Suite 330,
21 Boston, MA 02111-1307, USA. */
23 /* Known bugs or deficiencies include:
25 all methods must be provided in header files; can't use a source
26 file that contains only the method templates and "just win". */
43 /* The type of functions taking a tree, and some additional data, and
45 typedef int (*tree_fn_t
) PROTO((tree
, void*));
47 extern struct obstack permanent_obstack
;
50 extern char *input_filename
;
51 struct pending_inline
*pending_template_expansions
;
53 tree current_template_parms
;
54 HOST_WIDE_INT processing_template_decl
;
56 tree pending_templates
;
57 static tree
*template_tail
= &pending_templates
;
60 static tree
*maybe_template_tail
= &maybe_templates
;
62 int minimal_parse_mode
;
64 int processing_specialization
;
65 int processing_explicit_instantiation
;
66 int processing_template_parmlist
;
67 static int template_header_count
;
69 static tree saved_trees
;
71 #define obstack_chunk_alloc xmalloc
72 #define obstack_chunk_free free
74 #define UNIFY_ALLOW_NONE 0
75 #define UNIFY_ALLOW_MORE_CV_QUAL 1
76 #define UNIFY_ALLOW_LESS_CV_QUAL 2
77 #define UNIFY_ALLOW_DERIVED 4
79 static int unify
PROTO((tree
, tree
, tree
, tree
, int, int*));
80 static void add_pending_template
PROTO((tree
));
81 static int push_tinst_level
PROTO((tree
));
82 static tree classtype_mangled_name
PROTO((tree
));
83 static char *mangle_class_name_for_template
PROTO((char *, tree
, tree
));
84 static tree tsubst_expr_values
PROTO((tree
, tree
));
85 static int list_eq
PROTO((tree
, tree
));
86 static tree get_class_bindings
PROTO((tree
, tree
, tree
));
87 static tree coerce_template_parms
PROTO((tree
, tree
, tree
, int, int));
88 static void tsubst_enum
PROTO((tree
, tree
, tree
));
89 static tree add_to_template_args
PROTO((tree
, tree
));
90 static tree add_outermost_template_args
PROTO((tree
, tree
));
91 static void maybe_adjust_types_for_deduction
PROTO((unification_kind_t
, tree
*,
93 static int type_unification_real
PROTO((tree
, tree
, tree
, tree
,
94 int, unification_kind_t
, int, int*));
95 static void note_template_header
PROTO((int));
96 static tree maybe_fold_nontype_arg
PROTO((tree
));
97 static tree convert_nontype_argument
PROTO((tree
, tree
));
98 static tree convert_template_argument
PROTO ((tree
, tree
, tree
, int,
100 static tree get_bindings_overload
PROTO((tree
, tree
, tree
));
101 static int for_each_template_parm
PROTO((tree
, tree_fn_t
, void*));
102 static tree build_template_parm_index
PROTO((int, int, int, tree
, tree
));
103 static int inline_needs_template_parms
PROTO((tree
));
104 static void push_inline_template_parms_recursive
PROTO((tree
, int));
105 static tree retrieve_specialization
PROTO((tree
, tree
));
106 static tree register_specialization
PROTO((tree
, tree
, tree
));
107 static int unregister_specialization
PROTO((tree
, tree
));
108 static void print_candidates
PROTO((tree
));
109 static tree reduce_template_parm_level
PROTO((tree
, tree
, int));
110 static tree build_template_decl
PROTO((tree
, tree
));
111 static int mark_template_parm
PROTO((tree
, void *));
112 static tree tsubst_friend_function
PROTO((tree
, tree
));
113 static tree tsubst_friend_class
PROTO((tree
, tree
));
114 static tree get_bindings_real
PROTO((tree
, tree
, tree
, int));
115 static int template_decl_level
PROTO((tree
));
116 static tree maybe_get_template_decl_from_type_decl
PROTO((tree
));
117 static int check_cv_quals_for_unify
PROTO((int, tree
, tree
));
118 static tree tsubst_template_arg_vector
PROTO((tree
, tree
));
119 static tree tsubst_template_parms
PROTO((tree
, tree
));
120 static void regenerate_decl_from_template
PROTO((tree
, tree
));
121 static int is_member_template_class
PROTO((tree
));
122 static tree most_specialized
PROTO((tree
, tree
, tree
));
123 static tree most_specialized_class
PROTO((tree
, tree
));
124 static tree most_general_template
PROTO((tree
));
125 static void set_mangled_name_for_template_decl
PROTO((tree
));
126 static int template_class_depth_real
PROTO((tree
, int));
127 static tree tsubst_aggr_type
PROTO((tree
, tree
, tree
, int));
128 static tree tsubst_decl
PROTO((tree
, tree
, tree
, tree
));
129 static tree tsubst_arg_types
PROTO((tree
, tree
, tree
));
130 static void check_specialization_scope
PROTO((void));
131 static tree process_partial_specialization
PROTO((tree
));
133 /* We use TREE_VECs to hold template arguments. If there is only one
134 level of template arguments, then the TREE_VEC contains the
135 arguments directly. If there is more than one level of template
136 arguments, then each entry in the TREE_VEC is itself a TREE_VEC,
137 containing the template arguments for a single level. The first
138 entry in the outer TREE_VEC is the outermost level of template
139 parameters; the last is the innermost.
141 It is incorrect to ever form a template argument vector containing
142 only one level of arguments, but which is a TREE_VEC containing as
143 its only entry the TREE_VEC for that level. */
145 /* Non-zero if the template arguments is actually a vector of vectors,
146 rather than just a vector. */
147 #define TMPL_ARGS_HAVE_MULTIPLE_LEVELS(NODE) \
149 && TREE_CODE (NODE) == TREE_VEC \
150 && TREE_VEC_LENGTH (NODE) > 0 \
151 && TREE_VEC_ELT (NODE, 0) != NULL_TREE \
152 && TREE_CODE (TREE_VEC_ELT (NODE, 0)) == TREE_VEC)
154 /* The depth of a template argument vector. When called directly by
155 the parser, we use a TREE_LIST rather than a TREE_VEC to represent
156 template arguments. In fact, we may even see NULL_TREE if there
157 are no template arguments. In both of those cases, there is only
158 one level of template arguments. */
159 #define TMPL_ARGS_DEPTH(NODE) \
160 (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (NODE) ? TREE_VEC_LENGTH (NODE) : 1)
162 /* The LEVELth level of the template ARGS. Note that template
163 parameter levels are indexed from 1, not from 0. */
164 #define TMPL_ARGS_LEVEL(ARGS, LEVEL) \
165 (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (ARGS) \
166 ? TREE_VEC_ELT ((ARGS), (LEVEL) - 1) : ARGS)
168 /* Set the LEVELth level of the template ARGS to VAL. This macro does
169 not work with single-level argument vectors. */
170 #define SET_TMPL_ARGS_LEVEL(ARGS, LEVEL, VAL) \
171 (TREE_VEC_ELT ((ARGS), (LEVEL) - 1) = (VAL))
173 /* Accesses the IDXth parameter in the LEVELth level of the ARGS. */
174 #define TMPL_ARG(ARGS, LEVEL, IDX) \
175 (TREE_VEC_ELT (TMPL_ARGS_LEVEL (ARGS, LEVEL), IDX))
177 /* Set the IDXth element in the LEVELth level of ARGS to VAL. This
178 macro does not work with single-level argument vectors. */
179 #define SET_TMPL_ARG(ARGS, LEVEL, IDX, VAL) \
180 (TREE_VEC_ELT (TREE_VEC_ELT ((ARGS), (LEVEL) - 1), (IDX)) = (VAL))
182 /* Given a single level of template arguments in NODE, return the
183 number of arguments. */
184 #define NUM_TMPL_ARGS(NODE) \
185 ((NODE) == NULL_TREE ? 0 \
186 : (TREE_CODE (NODE) == TREE_VEC \
187 ? TREE_VEC_LENGTH (NODE) : list_length (NODE)))
189 /* The number of levels of template parameters given by NODE. */
190 #define TMPL_PARMS_DEPTH(NODE) \
191 (TREE_INT_CST_HIGH (TREE_PURPOSE (NODE)))
193 /* Do any processing required when DECL (a member template declaration
194 using TEMPLATE_PARAMETERS as its innermost parameter list) is
195 finished. Returns the TEMPLATE_DECL corresponding to DECL, unless
196 it is a specialization, in which case the DECL itself is returned. */
199 finish_member_template_decl (template_parameters
, decl
)
200 tree template_parameters
;
203 finish_template_decl (template_parameters
);
205 if (decl
== NULL_TREE
|| decl
== void_type_node
)
207 else if (decl
== error_mark_node
)
208 /* By returning NULL_TREE, the parser will just ignore this
209 declaration. We have already issued the error. */
211 else if (TREE_CODE (decl
) == TREE_LIST
)
213 /* Assume that the class is the only declspec. */
214 decl
= TREE_VALUE (decl
);
215 if (IS_AGGR_TYPE (decl
) && CLASSTYPE_TEMPLATE_INFO (decl
)
216 && ! CLASSTYPE_TEMPLATE_SPECIALIZATION (decl
))
218 tree tmpl
= CLASSTYPE_TI_TEMPLATE (decl
);
219 check_member_template (tmpl
);
224 else if (DECL_TEMPLATE_INFO (decl
))
226 if (!DECL_TEMPLATE_SPECIALIZATION (decl
))
228 check_member_template (DECL_TI_TEMPLATE (decl
));
229 return DECL_TI_TEMPLATE (decl
);
235 cp_error ("invalid member template declaration `%D'", decl
);
237 return error_mark_node
;
240 /* Returns the template nesting level of the indicated class TYPE.
250 A<T>::B<U> has depth two, while A<T> has depth one.
251 Both A<T>::B<int> and A<int>::B<U> have depth one, if
252 COUNT_SPECIALIZATIONS is 0 or if they are instantiations, not
255 This function is guaranteed to return 0 if passed NULL_TREE so
256 that, for example, `template_class_depth (current_class_type)' is
260 template_class_depth_real (type
, count_specializations
)
262 int count_specializations
;
267 type
&& TREE_CODE (type
) != NAMESPACE_DECL
;
268 type
= (TREE_CODE (type
) == FUNCTION_DECL
)
269 ? DECL_REAL_CONTEXT (type
) : TYPE_CONTEXT (type
))
271 if (TREE_CODE (type
) != FUNCTION_DECL
)
273 if (CLASSTYPE_TEMPLATE_INFO (type
)
274 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (type
))
275 && ((count_specializations
276 && CLASSTYPE_TEMPLATE_SPECIALIZATION (type
))
277 || uses_template_parms (CLASSTYPE_TI_ARGS (type
))))
282 if (DECL_TEMPLATE_INFO (type
)
283 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (type
))
284 && ((count_specializations
285 && DECL_TEMPLATE_SPECIALIZATION (type
))
286 || uses_template_parms (DECL_TI_ARGS (type
))))
294 /* Returns the template nesting level of the indicated class TYPE.
295 Like template_class_depth_real, but instantiations do not count in
299 template_class_depth (type
)
302 return template_class_depth_real (type
, /*count_specializations=*/0);
305 /* Returns 1 if processing DECL as part of do_pending_inlines
306 needs us to push template parms. */
309 inline_needs_template_parms (decl
)
312 if (! DECL_TEMPLATE_INFO (decl
))
315 return (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (most_general_template (decl
)))
316 > (processing_template_decl
+ DECL_TEMPLATE_SPECIALIZATION (decl
)));
319 /* Subroutine of maybe_begin_member_template_processing.
320 Push the template parms in PARMS, starting from LEVELS steps into the
321 chain, and ending at the beginning, since template parms are listed
325 push_inline_template_parms_recursive (parmlist
, levels
)
329 tree parms
= TREE_VALUE (parmlist
);
333 push_inline_template_parms_recursive (TREE_CHAIN (parmlist
), levels
- 1);
335 ++processing_template_decl
;
336 current_template_parms
337 = tree_cons (build_int_2 (0, processing_template_decl
),
338 parms
, current_template_parms
);
339 TEMPLATE_PARMS_FOR_INLINE (current_template_parms
) = 1;
342 for (i
= 0; i
< TREE_VEC_LENGTH (parms
); ++i
)
344 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
345 my_friendly_assert (TREE_CODE_CLASS (TREE_CODE (parm
)) == 'd', 0);
347 switch (TREE_CODE (parm
))
356 /* Make a CONST_DECL as is done in process_template_parm. */
357 tree decl
= build_decl (CONST_DECL
, DECL_NAME (parm
),
359 DECL_INITIAL (decl
) = DECL_INITIAL (parm
);
365 my_friendly_abort (0);
370 /* Restore the template parameter context for a member template or
371 a friend template defined in a class definition. */
374 maybe_begin_member_template_processing (decl
)
380 if (! inline_needs_template_parms (decl
))
383 parms
= DECL_TEMPLATE_PARMS (most_general_template (decl
));
385 levels
= TMPL_PARMS_DEPTH (parms
) - processing_template_decl
;
387 if (DECL_TEMPLATE_SPECIALIZATION (decl
))
390 parms
= TREE_CHAIN (parms
);
393 push_inline_template_parms_recursive (parms
, levels
);
396 /* Undo the effects of begin_member_template_processing. */
399 maybe_end_member_template_processing ()
401 if (! processing_template_decl
)
404 while (current_template_parms
405 && TEMPLATE_PARMS_FOR_INLINE (current_template_parms
))
407 --processing_template_decl
;
408 current_template_parms
= TREE_CHAIN (current_template_parms
);
413 /* Returns non-zero iff T is a member template function. We must be
416 template <class T> class C { void f(); }
418 Here, f is a template function, and a member, but not a member
419 template. This function does not concern itself with the origin of
420 T, only its present state. So if we have
422 template <class T> class C { template <class U> void f(U); }
424 then neither C<int>::f<char> nor C<T>::f<double> is considered
425 to be a member template. */
428 is_member_template (t
)
431 if (TREE_CODE (t
) != FUNCTION_DECL
432 && !DECL_FUNCTION_TEMPLATE_P (t
))
433 /* Anything that isn't a function or a template function is
434 certainly not a member template. */
437 /* A local class can't have member templates. */
438 if (hack_decl_function_context (t
))
441 if ((DECL_FUNCTION_MEMBER_P (t
)
442 && !DECL_TEMPLATE_SPECIALIZATION (t
))
443 || (TREE_CODE (t
) == TEMPLATE_DECL
444 && DECL_FUNCTION_MEMBER_P (DECL_TEMPLATE_RESULT (t
))))
448 if (DECL_FUNCTION_TEMPLATE_P (t
))
450 else if (DECL_TEMPLATE_INFO (t
)
451 && DECL_FUNCTION_TEMPLATE_P (DECL_TI_TEMPLATE (t
)))
452 tmpl
= DECL_TI_TEMPLATE (t
);
457 /* If there are more levels of template parameters than
458 there are template classes surrounding the declaration,
459 then we have a member template. */
460 && (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
)) >
461 template_class_depth (DECL_CLASS_CONTEXT (t
))))
468 /* Returns non-zero iff T is a member template class. See
469 is_member_template for a description of what precisely constitutes
470 a member template. */
473 is_member_template_class (t
)
476 if (!DECL_CLASS_TEMPLATE_P (t
))
477 /* Anything that isn't a class template, is certainly not a member
481 if (!DECL_CLASS_SCOPE_P (t
))
482 /* Anything whose context isn't a class type is surely not a
486 /* If there are more levels of template parameters than there are
487 template classes surrounding the declaration, then we have a
489 return (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (t
)) >
490 template_class_depth (DECL_CONTEXT (t
)));
493 /* Return a new template argument vector which contains all of ARGS,
494 but has as its innermost set of arguments the EXTRA_ARGS. The
495 resulting vector will be built on a temporary obstack, and so must
496 be explicitly copied to the permanent obstack, if required. */
499 add_to_template_args (args
, extra_args
)
508 extra_depth
= TMPL_ARGS_DEPTH (extra_args
);
509 new_args
= make_temp_vec (TMPL_ARGS_DEPTH (args
) + extra_depth
);
511 for (i
= 1; i
<= TMPL_ARGS_DEPTH (args
); ++i
)
512 SET_TMPL_ARGS_LEVEL (new_args
, i
, TMPL_ARGS_LEVEL (args
, i
));
514 for (j
= 1; j
<= extra_depth
; ++j
, ++i
)
515 SET_TMPL_ARGS_LEVEL (new_args
, i
, TMPL_ARGS_LEVEL (extra_args
, j
));
520 /* Like add_to_template_args, but only the outermost ARGS are added to
521 the EXTRA_ARGS. In particular, all but TMPL_ARGS_DEPTH
522 (EXTRA_ARGS) levels are added. This function is used to combine
523 the template arguments from a partial instantiation with the
524 template arguments used to attain the full instantiation from the
525 partial instantiation. */
528 add_outermost_template_args (args
, extra_args
)
534 /* If there are more levels of EXTRA_ARGS than there are ARGS,
535 something very fishy is going on. */
536 my_friendly_assert (TMPL_ARGS_DEPTH (args
) >= TMPL_ARGS_DEPTH (extra_args
),
539 /* If *all* the new arguments will be the EXTRA_ARGS, just return
541 if (TMPL_ARGS_DEPTH (args
) == TMPL_ARGS_DEPTH (extra_args
))
544 /* For the moment, we make ARGS look like it contains fewer levels. */
545 TREE_VEC_LENGTH (args
) -= TMPL_ARGS_DEPTH (extra_args
);
547 new_args
= add_to_template_args (args
, extra_args
);
549 /* Now, we restore ARGS to its full dimensions. */
550 TREE_VEC_LENGTH (args
) += TMPL_ARGS_DEPTH (extra_args
);
555 /* We've got a template header coming up; push to a new level for storing
559 begin_template_parm_list ()
561 /* We use a non-tag-transparent scope here, which causes pushtag to
562 put tags in this scope, rather than in the enclosing class or
563 namespace scope. This is the right thing, since we want
564 TEMPLATE_DECLS, and not TYPE_DECLS for template classes. For a
565 global template class, push_template_decl handles putting the
566 TEMPLATE_DECL into top-level scope. For a nested template class,
569 template <class T> struct S1 {
570 template <class T> struct S2 {};
573 pushtag contains special code to call pushdecl_with_scope on the
574 TEMPLATE_DECL for S2. */
576 declare_pseudo_global_level ();
577 ++processing_template_decl
;
578 ++processing_template_parmlist
;
579 note_template_header (0);
582 /* This routine is called when a specialization is declared. If it is
583 illegal to declare a specialization here, an error is reported. */
586 check_specialization_scope ()
588 tree scope
= current_scope ();
592 An explicit specialization shall be declared in the namespace of
593 which the template is a member, or, for member templates, in the
594 namespace of which the enclosing class or enclosing class
595 template is a member. An explicit specialization of a member
596 function, member class or static data member of a class template
597 shall be declared in the namespace of which the class template
599 if (scope
&& TREE_CODE (scope
) != NAMESPACE_DECL
)
600 cp_error ("explicit specialization in non-namespace scope `%D'",
605 In an explicit specialization declaration for a member of a class
606 template or a member template that appears in namespace scope,
607 the member template and some of its enclosing class templates may
608 remain unspecialized, except that the declaration shall not
609 explicitly specialize a class member template if its enclosing
610 class templates are not explicitly specialized as well. */
611 if (current_template_parms
)
612 cp_error ("enclosing class templates are not explicitly specialized");
615 /* We've just seen template <>. */
618 begin_specialization ()
620 note_template_header (1);
621 check_specialization_scope ();
624 /* Called at then end of processing a declaration preceeded by
628 end_specialization ()
630 reset_specialization ();
633 /* Any template <>'s that we have seen thus far are not referring to a
634 function specialization. */
637 reset_specialization ()
639 processing_specialization
= 0;
640 template_header_count
= 0;
643 /* We've just seen a template header. If SPECIALIZATION is non-zero,
644 it was of the form template <>. */
647 note_template_header (specialization
)
650 processing_specialization
= specialization
;
651 template_header_count
++;
654 /* We're beginning an explicit instantiation. */
657 begin_explicit_instantiation ()
659 ++processing_explicit_instantiation
;
664 end_explicit_instantiation ()
666 my_friendly_assert(processing_explicit_instantiation
> 0, 0);
667 --processing_explicit_instantiation
;
670 /* The TYPE is being declared. If it is a template type, that means it
671 is a partial specialization. Do appropriate error-checking. */
674 maybe_process_partial_specialization (type
)
677 if (IS_AGGR_TYPE (type
) && CLASSTYPE_USE_TEMPLATE (type
))
679 if (CLASSTYPE_IMPLICIT_INSTANTIATION (type
)
680 && TYPE_SIZE (type
) == NULL_TREE
)
682 SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (type
);
683 if (processing_template_decl
)
684 push_template_decl (TYPE_MAIN_DECL (type
));
686 else if (CLASSTYPE_TEMPLATE_INSTANTIATION (type
))
687 cp_error ("specialization of `%T' after instantiation", type
);
691 /* Retrieve the specialization (in the sense of [temp.spec] - a
692 specialization is either an instantiation or an explicit
693 specialization) of TMPL for the given template ARGS. If there is
694 no such specialization, return NULL_TREE. The ARGS are a vector of
695 arguments, or a vector of vectors of arguments, in the case of
696 templates with more than one level of parameters. */
699 retrieve_specialization (tmpl
, args
)
705 my_friendly_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
, 0);
707 /* There should be as many levels of arguments as there are
708 levels of parameters. */
709 my_friendly_assert (TMPL_ARGS_DEPTH (args
)
710 == TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
)),
713 for (s
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
716 if (comp_template_args (TREE_PURPOSE (s
), args
))
717 return TREE_VALUE (s
);
722 /* Returns non-zero iff DECL is a specialization of TMPL. */
725 is_specialization_of (decl
, tmpl
)
731 if (TREE_CODE (decl
) == FUNCTION_DECL
)
735 t
= DECL_TEMPLATE_INFO (t
) ? DECL_TI_TEMPLATE (t
) : NULL_TREE
)
741 my_friendly_assert (TREE_CODE (decl
) == TYPE_DECL
, 0);
743 for (t
= TREE_TYPE (decl
);
745 t
= CLASSTYPE_USE_TEMPLATE (t
)
746 ? TREE_TYPE (CLASSTYPE_TI_TEMPLATE (t
)) : NULL_TREE
)
747 if (comptypes (TYPE_MAIN_VARIANT (t
),
748 TYPE_MAIN_VARIANT (TREE_TYPE (tmpl
)), 1))
755 /* Register the specialization SPEC as a specialization of TMPL with
756 the indicated ARGS. Returns SPEC, or an equivalent prior
757 declaration, if available. */
760 register_specialization (spec
, tmpl
, args
)
767 my_friendly_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
, 0);
769 if (TREE_CODE (spec
) == FUNCTION_DECL
770 && uses_template_parms (DECL_TI_ARGS (spec
)))
771 /* This is the FUNCTION_DECL for a partial instantiation. Don't
772 register it; we want the corresponding TEMPLATE_DECL instead.
773 We use `uses_template_parms (DECL_TI_ARGS (spec))' rather than
774 the more obvious `uses_template_parms (spec)' to avoid problems
775 with default function arguments. In particular, given
778 template <class T> void f(T t1, T t = T())
780 the default argument expression is not substituted for in an
781 instantiation unless and until it is actually needed. */
784 /* There should be as many levels of arguments as there are
785 levels of parameters. */
786 my_friendly_assert (TMPL_ARGS_DEPTH (args
)
787 == TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
)),
790 for (s
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
793 if (comp_template_args (TREE_PURPOSE (s
), args
))
795 tree fn
= TREE_VALUE (s
);
797 if (DECL_TEMPLATE_SPECIALIZATION (spec
))
799 if (DECL_TEMPLATE_INSTANTIATION (fn
))
802 || DECL_EXPLICIT_INSTANTIATION (fn
))
804 cp_error ("specialization of %D after instantiation",
810 /* This situation should occur only if the first
811 specialization is an implicit instantiation,
812 the second is an explicit specialization, and
813 the implicit instantiation has not yet been
814 used. That situation can occur if we have
815 implicitly instantiated a member function and
816 then specialized it later.
818 We can also wind up here if a friend
819 declaration that looked like an instantiation
820 turns out to be a specialization:
822 template <class T> void foo(T);
823 class S { friend void foo<>(int) };
824 template <> void foo(int);
826 We transform the existing DECL in place so that
827 any pointers to it become pointers to the
828 updated declaration. */
829 duplicate_decls (spec
, TREE_VALUE (s
));
830 return TREE_VALUE (s
);
833 else if (DECL_TEMPLATE_SPECIALIZATION (fn
))
835 duplicate_decls (spec
, TREE_VALUE (s
));
836 return TREE_VALUE (s
);
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
;
912 *targs_out
= NULL_TREE
;
914 if (template_id
== error_mark_node
)
915 return error_mark_node
;
917 fns
= TREE_OPERAND (template_id
, 0);
918 targs_in
= TREE_OPERAND (template_id
, 1);
920 if (fns
== error_mark_node
)
921 return error_mark_node
;
923 /* Check for baselinks. */
924 if (TREE_CODE (fns
) == TREE_LIST
)
925 fns
= TREE_VALUE (fns
);
927 for (; fns
; fns
= OVL_NEXT (fns
))
931 fn
= OVL_CURRENT (fns
);
932 if (!need_member_template
933 && TREE_CODE (fn
) == FUNCTION_DECL
934 && DECL_FUNCTION_MEMBER_P (fn
)
935 && DECL_USE_TEMPLATE (fn
)
936 && DECL_TI_TEMPLATE (fn
))
937 /* We can get here when processing something like:
938 template <class T> class X { void f(); }
939 template <> void X<int>::f() {}
940 We're specializing a member function, but not a member
942 tmpl
= DECL_TI_TEMPLATE (fn
);
943 else if (TREE_CODE (fn
) != TEMPLATE_DECL
944 || (need_member_template
&& !is_member_template (fn
)))
949 if (list_length (targs_in
) > DECL_NTPARMS (tmpl
))
952 if (decl
== NULL_TREE
)
954 tree targs
= make_scratch_vec (DECL_NTPARMS (tmpl
));
956 /* We allow incomplete unification here, because we are going to
957 check all the functions. */
958 i
= type_unification (DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
966 /* Unification was successful. */
967 templates
= scratch_tree_cons (targs
, tmpl
, templates
);
970 templates
= scratch_tree_cons (NULL_TREE
, tmpl
, templates
);
973 if (decl
!= NULL_TREE
)
975 tree tmpl
= most_specialized (templates
, decl
, targs_in
);
979 if (tmpl
== error_mark_node
)
981 else if (tmpl
== NULL_TREE
)
984 inner_args
= get_bindings (tmpl
, decl
, targs_in
);
985 tmpl_args
= DECL_TI_ARGS (DECL_RESULT (tmpl
));
986 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (tmpl_args
))
988 *targs_out
= copy_node (tmpl_args
);
989 SET_TMPL_ARGS_LEVEL (*targs_out
,
990 TMPL_ARGS_DEPTH (*targs_out
),
994 *targs_out
= inner_args
;
999 if (templates
== NULL_TREE
)
1004 cp_error_at ("template-id `%D' for `%+D' does not match any template declaration",
1006 return error_mark_node
;
1010 else if (TREE_CHAIN (templates
) != NULL_TREE
)
1015 cp_error_at ("ambiguous template specialization `%D' for `%+D'",
1017 print_candidates (templates
);
1018 return error_mark_node
;
1023 /* We have one, and exactly one, match. */
1024 *targs_out
= TREE_PURPOSE (templates
);
1025 return TREE_VALUE (templates
);
1028 /* Check to see if the function just declared, as indicated in
1029 DECLARATOR, and in DECL, is a specialization of a function
1030 template. We may also discover that the declaration is an explicit
1031 instantiation at this point.
1033 Returns DECL, or an equivalent declaration that should be used
1036 FLAGS is a bitmask consisting of the following flags:
1038 2: The function has a definition.
1039 4: The function is a friend.
1041 The TEMPLATE_COUNT is the number of references to qualifying
1042 template classes that appeared in the name of the function. For
1045 template <class T> struct S { void f(); };
1048 the TEMPLATE_COUNT would be 1. However, explicitly specialized
1049 classes are not counted in the TEMPLATE_COUNT, so that in
1051 template <class T> struct S {};
1052 template <> struct S<int> { void f(); }
1053 template <> void S<int>::f();
1055 the TEMPLATE_COUNT would be 0. (Note that this declaration is
1056 illegal; there should be no template <>.)
1058 If the function is a specialization, it is marked as such via
1059 DECL_TEMPLATE_SPECIALIZATION. Furthermore, its DECL_TEMPLATE_INFO
1060 is set up correctly, and it is added to the list of specializations
1061 for that template. */
1064 check_explicit_specialization (declarator
, decl
, template_count
, flags
)
1070 int have_def
= flags
& 2;
1071 int is_friend
= flags
& 4;
1072 int specialization
= 0;
1073 int explicit_instantiation
= 0;
1074 int member_specialization
= 0;
1076 tree ctype
= DECL_CLASS_CONTEXT (decl
);
1077 tree dname
= DECL_NAME (decl
);
1079 if (processing_specialization
)
1081 /* The last template header was of the form template <>. */
1083 if (template_header_count
> template_count
)
1085 /* There were more template headers than qualifying template
1087 if (template_header_count
- template_count
> 1)
1088 /* There shouldn't be that many template parameter
1089 lists. There can be at most one parameter list for
1090 every qualifying class, plus one for the function
1092 cp_error ("too many template parameter lists in declaration of `%D'", decl
);
1094 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
1096 member_specialization
= 1;
1100 else if (template_header_count
== template_count
)
1102 /* The counts are equal. So, this might be a
1103 specialization, but it is not a specialization of a
1104 member template. It might be something like
1106 template <class T> struct S {
1110 void S<int>::f(int i) {} */
1112 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
1116 /* This cannot be an explicit specialization. There are not
1117 enough headers for all of the qualifying classes. For
1118 example, we might have:
1121 void S<int>::T<char>::f();
1123 But, we're missing another template <>. */
1124 cp_error("too few template parameter lists in declaration of `%D'", decl
);
1128 else if (processing_explicit_instantiation
)
1130 if (template_header_count
)
1131 cp_error ("template parameter list used in explicit instantiation");
1134 cp_error ("definition provided for explicit instantiation");
1136 explicit_instantiation
= 1;
1138 else if (ctype
!= NULL_TREE
1139 && !TYPE_BEING_DEFINED (ctype
)
1140 && CLASSTYPE_TEMPLATE_INSTANTIATION (ctype
)
1143 /* This case catches outdated code that looks like this:
1145 template <class T> struct S { void f(); };
1146 void S<int>::f() {} // Missing template <>
1148 We disable this check when the type is being defined to
1149 avoid complaining about default compiler-generated
1150 constructors, destructors, and assignment operators.
1151 Since the type is an instantiation, not a specialization,
1152 these are the only functions that can be defined before
1153 the class is complete. */
1156 template <class T> void S<int>::f() {}
1158 if (template_header_count
)
1160 cp_error ("template parameters specified in specialization");
1166 ("explicit specialization not preceded by `template <>'");
1168 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
1170 else if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
1173 /* This could be something like:
1175 template <class T> void f(T);
1176 class S { friend void f<>(int); } */
1180 /* This case handles bogus declarations like template <>
1181 template <class T> void f<int>(); */
1183 cp_error ("template-id `%D' in declaration of primary template",
1189 if (specialization
|| member_specialization
)
1191 tree t
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
1192 for (; t
; t
= TREE_CHAIN (t
))
1193 if (TREE_PURPOSE (t
))
1196 ("default argument specified in explicit specialization");
1201 if (specialization
|| member_specialization
|| explicit_instantiation
)
1204 tree tmpl
= NULL_TREE
;
1205 tree targs
= NULL_TREE
;
1207 /* Make sure that the declarator is a TEMPLATE_ID_EXPR. */
1208 if (TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
1212 my_friendly_assert (TREE_CODE (declarator
) == IDENTIFIER_NODE
,
1215 fns
= IDENTIFIER_NAMESPACE_VALUE (dname
);
1220 lookup_template_function (fns
, NULL_TREE
);
1223 if (declarator
== error_mark_node
)
1224 return error_mark_node
;
1226 if (TREE_CODE (TREE_OPERAND (declarator
, 0)) == LOOKUP_EXPR
)
1228 /* A friend declaration. We can't do much, because we don't
1229 know what this resolves to, yet. */
1230 my_friendly_assert (is_friend
!= 0, 0);
1231 my_friendly_assert (!explicit_instantiation
, 0);
1232 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
1236 if (ctype
!= NULL_TREE
&& TYPE_BEING_DEFINED (ctype
))
1238 if (!explicit_instantiation
)
1239 /* A specialization in class scope. This is illegal,
1240 but the error will already have been flagged by
1241 check_specialization_scope. */
1242 return error_mark_node
;
1245 /* It's not legal to write an explicit instantiation in
1248 class C { template void f(); }
1250 This case is caught by the parser. However, on
1253 template class C { void f(); };
1255 (which is illegal) we can get here. The error will be
1262 else if (ctype
!= NULL_TREE
1263 && (TREE_CODE (TREE_OPERAND (declarator
, 0)) ==
1266 /* Find the list of functions in ctype that have the same
1267 name as the declared function. */
1268 tree name
= TREE_OPERAND (declarator
, 0);
1271 if (name
== constructor_name (ctype
)
1272 || name
== constructor_name_full (ctype
))
1274 int is_constructor
= DECL_CONSTRUCTOR_P (decl
);
1276 if (is_constructor
? !TYPE_HAS_CONSTRUCTOR (ctype
)
1277 : !TYPE_HAS_DESTRUCTOR (ctype
))
1279 /* From [temp.expl.spec]:
1281 If such an explicit specialization for the member
1282 of a class template names an implicitly-declared
1283 special member function (clause _special_), the
1284 program is ill-formed.
1286 Similar language is found in [temp.explicit]. */
1287 cp_error ("specialization of implicitly-declared special member function");
1292 name
= is_constructor
? ctor_identifier
: dtor_identifier
;
1295 fns
= lookup_fnfields (TYPE_BINFO (ctype
), name
, 1);
1297 if (fns
== NULL_TREE
)
1299 cp_error ("no member function `%s' declared in `%T'",
1300 IDENTIFIER_POINTER (name
),
1305 TREE_OPERAND (declarator
, 0) = fns
;
1308 /* Figure out what exactly is being specialized at this point.
1309 Note that for an explicit instantiation, even one for a
1310 member function, we cannot tell apriori whether the
1311 instantiation is for a member template, or just a member
1312 function of a template class. Even if a member template is
1313 being instantiated, the member template arguments may be
1314 elided if they can be deduced from the rest of the
1316 tmpl
= determine_specialization (declarator
, decl
,
1318 member_specialization
,
1321 if (tmpl
&& tmpl
!= error_mark_node
)
1323 gen_tmpl
= most_general_template (tmpl
);
1325 if (explicit_instantiation
)
1327 /* We don't set DECL_EXPLICIT_INSTANTIATION here; that
1328 is done by do_decl_instantiation later. */
1329 decl
= instantiate_template (tmpl
, innermost_args (targs
));
1333 /* If we though that the DECL was a member function, but it
1334 turns out to be specializing a static member function,
1335 make DECL a static member function as well. */
1336 if (DECL_STATIC_FUNCTION_P (tmpl
)
1337 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
1339 revert_static_member_fn (&decl
, 0, 0);
1340 last_function_parms
= TREE_CHAIN (last_function_parms
);
1343 /* Set up the DECL_TEMPLATE_INFO for DECL. */
1344 DECL_TEMPLATE_INFO (decl
)
1345 = perm_tree_cons (tmpl
, targs
, NULL_TREE
);
1347 /* Mangle the function name appropriately. Note that we do
1348 not mangle specializations of non-template member
1349 functions of template classes, e.g. with
1351 template <class T> struct S { void f(); }
1353 and given the specialization
1355 template <> void S<int>::f() {}
1357 we do not mangle S<int>::f() here. That's because it's
1358 just an ordinary member function and doesn't need special
1359 treatment. We do this here so that the ordinary,
1360 non-template, name-mangling algorith will not be used
1362 if ((is_member_template (tmpl
) || ctype
== NULL_TREE
)
1363 && name_mangling_version
>= 1)
1364 set_mangled_name_for_template_decl (decl
);
1366 if (is_friend
&& !have_def
)
1367 /* This is not really a declaration of a specialization.
1368 It's just the name of an instantiation. But, it's not
1369 a request for an instantiation, either. */
1370 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
1372 /* Register this specialization so that we can find it
1374 decl
= register_specialization (decl
, gen_tmpl
, targs
);
1383 /* TYPE is being declared. Verify that the use of template headers
1384 and such is reasonable. Issue error messages if not. */
1387 maybe_check_template_type (type
)
1390 if (template_header_count
)
1392 /* We are in the scope of some `template <...>' header. */
1395 = template_class_depth_real (TYPE_CONTEXT (type
),
1396 /*count_specializations=*/1);
1398 if (template_header_count
<= context_depth
)
1399 /* This is OK; the template headers are for the context. We
1400 are actually too lenient here; like
1401 check_explicit_specialization we should consider the number
1402 of template types included in the actual declaration. For
1405 template <class T> struct S {
1406 template <class U> template <class V>
1412 template <class T> struct S {
1413 template <class U> struct I;
1416 template <class T> template <class U.
1421 else if (template_header_count
> context_depth
+ 1)
1422 /* There are two many template parameter lists. */
1423 cp_error ("too many template parameter lists in declaration of `%T'", type
);
1427 /* Returns 1 iff PARMS1 and PARMS2 are identical sets of template
1428 parameters. These are represented in the same format used for
1429 DECL_TEMPLATE_PARMS. */
1431 int comp_template_parms (parms1
, parms2
)
1438 if (parms1
== parms2
)
1441 for (p1
= parms1
, p2
= parms2
;
1442 p1
!= NULL_TREE
&& p2
!= NULL_TREE
;
1443 p1
= TREE_CHAIN (p1
), p2
= TREE_CHAIN (p2
))
1445 tree t1
= TREE_VALUE (p1
);
1446 tree t2
= TREE_VALUE (p2
);
1449 my_friendly_assert (TREE_CODE (t1
) == TREE_VEC
, 0);
1450 my_friendly_assert (TREE_CODE (t2
) == TREE_VEC
, 0);
1452 if (TREE_VEC_LENGTH (t1
) != TREE_VEC_LENGTH (t2
))
1455 for (i
= 0; i
< TREE_VEC_LENGTH (t2
); ++i
)
1457 tree parm1
= TREE_VALUE (TREE_VEC_ELT (t1
, i
));
1458 tree parm2
= TREE_VALUE (TREE_VEC_ELT (t2
, i
));
1460 if (TREE_CODE (parm1
) != TREE_CODE (parm2
))
1463 if (TREE_CODE (parm1
) == TEMPLATE_TYPE_PARM
)
1465 else if (!comptypes (TREE_TYPE (parm1
),
1466 TREE_TYPE (parm2
), 1))
1471 if ((p1
!= NULL_TREE
) != (p2
!= NULL_TREE
))
1472 /* One set of parameters has more parameters lists than the
1480 /* Returns 1 iff old_id is a template parameter. OLD_DECL is the decl
1481 from IDENTIFIER_LOCAL_VALUE (new identifier). */
1483 int decl_template_parm_p (old_decl
)
1486 /* For template template parms. */
1487 if (TREE_CODE (old_decl
) == TEMPLATE_DECL
1488 && TREE_TYPE (old_decl
)
1489 && TREE_CODE (TREE_TYPE (old_decl
)) == TEMPLATE_TEMPLATE_PARM
)
1492 /* For template type parms. */
1493 if (TREE_CODE (old_decl
) == TYPE_DECL
1494 && TREE_TYPE (old_decl
)
1495 && TREE_CODE (TREE_TYPE (old_decl
)) == TEMPLATE_TYPE_PARM
)
1498 /* For template non-type parms. */
1499 if (TREE_CODE (old_decl
) == CONST_DECL
1500 && DECL_INITIAL (old_decl
)
1501 && TREE_CODE (DECL_INITIAL (old_decl
)) == TEMPLATE_PARM_INDEX
)
1508 /* Return a new TEMPLATE_PARM_INDEX with the indicated INDEX, LEVEL,
1509 ORIG_LEVEL, DECL, and TYPE. */
1512 build_template_parm_index (index
, level
, orig_level
, decl
, type
)
1519 tree t
= make_node (TEMPLATE_PARM_INDEX
);
1520 TEMPLATE_PARM_IDX (t
) = index
;
1521 TEMPLATE_PARM_LEVEL (t
) = level
;
1522 TEMPLATE_PARM_ORIG_LEVEL (t
) = orig_level
;
1523 TEMPLATE_PARM_DECL (t
) = decl
;
1524 TREE_TYPE (t
) = type
;
1529 /* Return a TEMPLATE_PARM_INDEX, similar to INDEX, but whose
1530 TEMPLATE_PARM_LEVEL has been decreased by LEVELS. If such a
1531 TEMPLATE_PARM_INDEX already exists, it is returned; otherwise, a
1532 new one is created. */
1535 reduce_template_parm_level (index
, type
, levels
)
1540 if (TEMPLATE_PARM_DESCENDANTS (index
) == NULL_TREE
1541 || (TEMPLATE_PARM_LEVEL (TEMPLATE_PARM_DESCENDANTS (index
))
1542 != TEMPLATE_PARM_LEVEL (index
) - levels
))
1545 = build_decl (TREE_CODE (TEMPLATE_PARM_DECL (index
)),
1546 DECL_NAME (TEMPLATE_PARM_DECL (index
)),
1549 = build_template_parm_index (TEMPLATE_PARM_IDX (index
),
1550 TEMPLATE_PARM_LEVEL (index
) - levels
,
1551 TEMPLATE_PARM_ORIG_LEVEL (index
),
1553 TEMPLATE_PARM_DESCENDANTS (index
) = t
;
1555 /* Template template parameters need this. */
1556 DECL_TEMPLATE_PARMS (decl
)
1557 = DECL_TEMPLATE_PARMS (TEMPLATE_PARM_DECL (index
));
1560 return TEMPLATE_PARM_DESCENDANTS (index
);
1563 /* Process information from new template parameter NEXT and append it to the
1564 LIST being built. */
1567 process_template_parm (list
, next
)
1576 my_friendly_assert (TREE_CODE (parm
) == TREE_LIST
, 259);
1577 defval
= TREE_PURPOSE (parm
);
1578 parm
= TREE_VALUE (parm
);
1579 is_type
= TREE_PURPOSE (parm
) == class_type_node
;
1583 tree p
= TREE_VALUE (tree_last (list
));
1585 if (TREE_CODE (p
) == TYPE_DECL
)
1586 idx
= TEMPLATE_TYPE_IDX (TREE_TYPE (p
));
1587 else if (TREE_CODE (p
) == TEMPLATE_DECL
)
1588 idx
= TEMPLATE_TYPE_IDX (TREE_TYPE (DECL_TEMPLATE_RESULT (p
)));
1590 idx
= TEMPLATE_PARM_IDX (DECL_INITIAL (p
));
1598 my_friendly_assert (TREE_CODE (TREE_PURPOSE (parm
)) == TREE_LIST
, 260);
1599 /* is a const-param */
1600 parm
= grokdeclarator (TREE_VALUE (parm
), TREE_PURPOSE (parm
),
1601 PARM
, 0, NULL_TREE
);
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 CLASSTYPE_GOT_SEMICOLON (t
) = 1;
1652 TYPE_NAME (t
) = decl
;
1653 TYPE_STUB_DECL (t
) = decl
;
1655 TEMPLATE_TYPE_PARM_INDEX (t
)
1656 = build_template_parm_index (idx
, processing_template_decl
,
1657 processing_template_decl
,
1658 decl
, TREE_TYPE (parm
));
1660 SET_DECL_ARTIFICIAL (decl
);
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 int issued_default_arg_message
= 0;
1857 struct template_parm_data tpd
;
1858 struct template_parm_data tpd2
;
1860 /* [temp.class.spec]
1862 The template parameter list of a specialization shall not
1863 contain default template argument values. */
1864 for (i
= 0; i
< ntparms
; ++i
)
1866 if (TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)))
1868 if (!issued_default_arg_message
)
1870 cp_error ("default argument in partial specialization `%T'",
1872 issued_default_arg_message
= 1;
1874 TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)) = NULL_TREE
;
1878 /* We check that each of the template parameters given in the
1879 partial specialization is used in the argument list to the
1880 specialization. For example:
1882 template <class T> struct S;
1883 template <class T> struct S<T*>;
1885 The second declaration is OK because `T*' uses the template
1886 parameter T, whereas
1888 template <class T> struct S<int>;
1890 is no good. Even trickier is:
1901 The S2<T> declaration is actually illegal; it is a
1902 full-specialization. Of course,
1905 struct S2<T (*)(U)>;
1907 or some such would have been OK. */
1908 tpd
.level
= TMPL_PARMS_DEPTH (current_template_parms
);
1909 tpd
.parms
= alloca (sizeof (int) * ntparms
);
1910 bzero (tpd
.parms
, sizeof (int) * ntparms
);
1912 tpd
.arg_uses_template_parms
= alloca (sizeof (int) * nargs
);
1913 bzero (tpd
.arg_uses_template_parms
, sizeof (int) * nargs
);
1914 for (i
= 0; i
< nargs
; ++i
)
1916 tpd
.current_arg
= i
;
1917 for_each_template_parm (TREE_VEC_ELT (inner_args
, i
),
1918 &mark_template_parm
,
1921 for (i
= 0; i
< ntparms
; ++i
)
1922 if (tpd
.parms
[i
] == 0)
1924 /* One of the template parms was not used in the
1926 if (!did_error_intro
)
1928 cp_error ("template parameters not used in partial specialization:");
1929 did_error_intro
= 1;
1933 TREE_VALUE (TREE_VEC_ELT (inner_parms
, i
)));
1936 /* [temp.class.spec]
1938 The argument list of the specialization shall not be identical to
1939 the implicit argument list of the primary template. */
1940 if (comp_template_args (inner_args
,
1941 innermost_args (CLASSTYPE_TI_ARGS (TREE_TYPE
1943 cp_error ("partial specialization `%T' does not specialize any template arguments", type
);
1945 /* [temp.class.spec]
1947 A partially specialized non-type argument expression shall not
1948 involve template parameters of the partial specialization except
1949 when the argument expression is a simple identifier.
1951 The type of a template parameter corresponding to a specialized
1952 non-type argument shall not be dependent on a parameter of the
1954 my_friendly_assert (nargs
== DECL_NTPARMS (maintmpl
), 0);
1956 for (i
= 0; i
< nargs
; ++i
)
1958 tree arg
= TREE_VEC_ELT (inner_args
, i
);
1959 if (/* These first two lines are the `non-type' bit. */
1960 TREE_CODE_CLASS (TREE_CODE (arg
)) != 't'
1961 && TREE_CODE (arg
) != TEMPLATE_DECL
1962 /* This next line is the `argument expression is not just a
1963 simple identifier' condition and also the `specialized
1964 non-type argument' bit. */
1965 && TREE_CODE (arg
) != TEMPLATE_PARM_INDEX
)
1967 if (tpd
.arg_uses_template_parms
[i
])
1968 cp_error ("template argument `%E' involves template parameter(s)", arg
);
1971 /* Look at the corresponding template parameter,
1972 marking which template parameters its type depends
1975 TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (main_inner_parms
,
1980 /* We haven't yet initialized TPD2. Do so now. */
1981 tpd2
.arg_uses_template_parms
1982 = (int*) alloca (sizeof (int) * nargs
);
1983 /* The number of paramters here is the number in the
1984 main template, which, as checked in the assertion
1986 tpd2
.parms
= (int*) alloca (sizeof (int) * nargs
);
1988 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (maintmpl
));
1991 /* Mark the template paramters. But this time, we're
1992 looking for the template parameters of the main
1993 template, not in the specialization. */
1994 tpd2
.current_arg
= i
;
1995 tpd2
.arg_uses_template_parms
[i
] = 0;
1996 bzero (tpd2
.parms
, sizeof (int) * nargs
);
1997 for_each_template_parm (type
,
1998 &mark_template_parm
,
2001 if (tpd2
.arg_uses_template_parms
[i
])
2003 /* The type depended on some template parameters.
2004 If they are fully specialized in the
2005 specialization, that's OK. */
2007 for (j
= 0; j
< nargs
; ++j
)
2008 if (tpd2
.parms
[j
] != 0
2009 && tpd
.arg_uses_template_parms
[j
])
2011 cp_error ("type `%T' of template argument `%E' depends on template paramter(s)",
2021 if (retrieve_specialization (maintmpl
, specargs
))
2022 /* We've already got this specialization. */
2025 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
) = CLASSTYPE_TI_SPEC_INFO (type
)
2026 = perm_tree_cons (inner_args
, inner_parms
,
2027 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
));
2028 TREE_TYPE (DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)) = type
;
2032 /* Creates a TEMPLATE_DECL for the indicated DECL using the template
2033 parameters given by current_template_args, or reuses a
2034 previously existing one, if appropriate. Returns the DECL, or an
2035 equivalent one, if it is replaced via a call to duplicate_decls.
2037 If IS_FRIEND is non-zero, DECL is a friend declaration. */
2040 push_template_decl_real (decl
, is_friend
)
2050 is_friend
|= (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_FRIEND_P (decl
));
2053 /* For a friend, we want the context of the friend function, not
2054 the type of which it is a friend. */
2055 ctx
= DECL_CONTEXT (decl
);
2056 else if (DECL_REAL_CONTEXT (decl
)
2057 && TREE_CODE (DECL_REAL_CONTEXT (decl
)) != NAMESPACE_DECL
)
2058 /* In the case of a virtual function, we want the class in which
2060 ctx
= DECL_REAL_CONTEXT (decl
);
2062 /* Otherwise, if we're currently definining some class, the DECL
2063 is assumed to be a member of the class. */
2064 ctx
= current_class_type
;
2066 if (ctx
&& TREE_CODE (ctx
) == NAMESPACE_DECL
)
2069 if (!DECL_CONTEXT (decl
))
2070 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
2072 /* For determining whether this is a primary template or not, we're really
2073 interested in the lexical context, not the true context. */
2075 info
= current_class_type
;
2079 if (info
&& TREE_CODE (info
) == FUNCTION_DECL
)
2081 /* Note that template_class_depth returns 0 if given NULL_TREE, so
2082 this next line works even when we are at global scope. */
2083 else if (processing_template_decl
> template_class_depth (info
))
2090 if (current_lang_name
== lang_name_c
)
2091 cp_error ("template with C linkage");
2092 if (TREE_CODE (decl
) == TYPE_DECL
&& ANON_AGGRNAME_P (DECL_NAME (decl
)))
2093 cp_error ("template class without a name");
2094 if (TREE_CODE (decl
) == TYPE_DECL
2095 && TREE_CODE (TREE_TYPE (decl
)) == ENUMERAL_TYPE
)
2096 cp_error ("template declaration of `%#T'", TREE_TYPE (decl
));
2099 /* Partial specialization. */
2100 if (TREE_CODE (decl
) == TYPE_DECL
&& DECL_ARTIFICIAL (decl
)
2101 && TREE_CODE (TREE_TYPE (decl
)) != ENUMERAL_TYPE
2102 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl
)))
2103 return process_partial_specialization (decl
);
2105 args
= current_template_args ();
2108 || TREE_CODE (ctx
) == FUNCTION_DECL
2109 || TYPE_BEING_DEFINED (ctx
)
2110 || (is_friend
&& !DECL_TEMPLATE_INFO (decl
)))
2112 if (DECL_LANG_SPECIFIC (decl
)
2113 && DECL_TEMPLATE_INFO (decl
)
2114 && DECL_TI_TEMPLATE (decl
))
2115 tmpl
= DECL_TI_TEMPLATE (decl
);
2118 tmpl
= build_template_decl (decl
, current_template_parms
);
2120 if (DECL_LANG_SPECIFIC (decl
)
2121 && DECL_TEMPLATE_SPECIALIZATION (decl
))
2123 /* A specialization of a member template of a template
2125 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
2126 DECL_TEMPLATE_INFO (tmpl
) = DECL_TEMPLATE_INFO (decl
);
2127 DECL_TEMPLATE_INFO (decl
) = NULL_TREE
;
2136 if (CLASSTYPE_TEMPLATE_INSTANTIATION (ctx
))
2137 cp_error ("must specialize `%#T' before defining member `%#D'",
2139 if (TREE_CODE (decl
) == TYPE_DECL
)
2141 if ((IS_AGGR_TYPE_CODE (TREE_CODE (TREE_TYPE (decl
)))
2142 || TREE_CODE (TREE_TYPE (decl
)) == ENUMERAL_TYPE
)
2143 && TYPE_TEMPLATE_INFO (TREE_TYPE (decl
))
2144 && TYPE_TI_TEMPLATE (TREE_TYPE (decl
)))
2145 tmpl
= TYPE_TI_TEMPLATE (TREE_TYPE (decl
));
2148 cp_error ("`%D' does not declare a template type", decl
);
2152 else if (! DECL_TEMPLATE_INFO (decl
))
2154 cp_error ("template definition of non-template `%#D'", decl
);
2158 tmpl
= DECL_TI_TEMPLATE (decl
);
2160 if (is_member_template (tmpl
) || is_member_template_class (tmpl
))
2162 if (DECL_FUNCTION_TEMPLATE_P (tmpl
)
2163 && DECL_TEMPLATE_INFO (decl
) && DECL_TI_ARGS (decl
)
2164 && DECL_TEMPLATE_SPECIALIZATION (decl
))
2168 /* The declaration is a specialization of a member
2169 template, declared outside the class. Therefore, the
2170 innermost template arguments will be NULL, so we
2171 replace them with the arguments determined by the
2172 earlier call to check_explicit_specialization. */
2173 args
= DECL_TI_ARGS (decl
);
2176 = build_template_decl (decl
, current_template_parms
);
2177 DECL_TEMPLATE_RESULT (new_tmpl
) = decl
;
2178 TREE_TYPE (new_tmpl
) = TREE_TYPE (decl
);
2179 DECL_TI_TEMPLATE (decl
) = new_tmpl
;
2180 SET_DECL_TEMPLATE_SPECIALIZATION (new_tmpl
);
2181 DECL_TEMPLATE_INFO (new_tmpl
) =
2182 perm_tree_cons (tmpl
, args
, NULL_TREE
);
2184 register_specialization (new_tmpl
, tmpl
, args
);
2188 a
= innermost_args (args
);
2189 t
= DECL_INNERMOST_TEMPLATE_PARMS (tmpl
);
2190 if (TREE_VEC_LENGTH (t
) != TREE_VEC_LENGTH (a
))
2192 cp_error ("got %d template parameters for `%#D'",
2193 TREE_VEC_LENGTH (a
), decl
);
2194 cp_error (" but %d required", TREE_VEC_LENGTH (t
));
2196 if (TMPL_ARGS_DEPTH (args
) > 1)
2197 /* Get the template parameters for the enclosing template
2199 a
= TMPL_ARGS_LEVEL (args
, TMPL_ARGS_DEPTH (args
) - 1);
2204 a
= innermost_args (args
);
2208 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (ctx
))
2210 /* When processing an inline member template of a
2211 specialized class, there is no CLASSTYPE_TI_SPEC_INFO. */
2212 if (CLASSTYPE_TI_SPEC_INFO (ctx
))
2213 t
= TREE_VALUE (CLASSTYPE_TI_SPEC_INFO (ctx
));
2215 else if (CLASSTYPE_TEMPLATE_INFO (ctx
))
2216 t
= DECL_INNERMOST_TEMPLATE_PARMS (CLASSTYPE_TI_TEMPLATE (ctx
));
2218 /* There should be template arguments if and only if there is a
2220 my_friendly_assert((a
!= NULL_TREE
) == (t
!= NULL_TREE
), 0);
2223 && TREE_VEC_LENGTH (t
) != TREE_VEC_LENGTH (a
))
2225 cp_error ("got %d template parameters for `%#D'",
2226 TREE_VEC_LENGTH (a
), decl
);
2227 cp_error (" but `%#T' has %d", ctx
, TREE_VEC_LENGTH (t
));
2231 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
2232 TREE_TYPE (tmpl
) = TREE_TYPE (decl
);
2234 /* Push template declarations for global functions and types. Note
2235 that we do not try to push a global template friend declared in a
2236 template class; such a thing may well depend on the template
2237 parameters of the class. */
2239 && !(is_friend
&& template_class_depth (current_class_type
) > 0))
2240 tmpl
= pushdecl_namespace_level (tmpl
);
2243 DECL_PRIMARY_TEMPLATE (tmpl
) = tmpl
;
2245 info
= perm_tree_cons (tmpl
, args
, NULL_TREE
);
2247 if (TREE_CODE (decl
) == TYPE_DECL
&& DECL_ARTIFICIAL (decl
))
2249 SET_TYPE_TEMPLATE_INFO (TREE_TYPE (tmpl
), info
);
2250 if ((!ctx
|| TREE_CODE (ctx
) != FUNCTION_DECL
)
2251 && TREE_CODE (TREE_TYPE (decl
)) != ENUMERAL_TYPE
)
2252 DECL_NAME (decl
) = classtype_mangled_name (TREE_TYPE (decl
));
2254 else if (! DECL_LANG_SPECIFIC (decl
))
2255 cp_error ("template declaration of `%#D'", decl
);
2257 DECL_TEMPLATE_INFO (decl
) = info
;
2259 return DECL_TEMPLATE_RESULT (tmpl
);
2263 push_template_decl (decl
)
2266 return push_template_decl_real (decl
, 0);
2269 /* Called when a class template TYPE is redeclared with the indicated
2270 template PARMS, e.g.:
2272 template <class T> struct S;
2273 template <class T> struct S {}; */
2276 redeclare_class_template (type
, parms
)
2280 tree tmpl
= CLASSTYPE_TI_TEMPLATE (type
);
2284 if (!PRIMARY_TEMPLATE_P (tmpl
))
2285 /* The type is nested in some template class. Nothing to worry
2286 about here; there are no new template parameters for the nested
2290 parms
= INNERMOST_TEMPLATE_PARMS (parms
);
2291 tmpl_parms
= DECL_INNERMOST_TEMPLATE_PARMS (tmpl
);
2293 if (TREE_VEC_LENGTH (parms
) != TREE_VEC_LENGTH (tmpl_parms
))
2295 cp_error_at ("previous declaration `%D'", tmpl
);
2296 cp_error ("used %d template parameter%s instead of %d",
2297 TREE_VEC_LENGTH (tmpl_parms
),
2298 TREE_VEC_LENGTH (tmpl_parms
) == 1 ? "" : "s",
2299 TREE_VEC_LENGTH (parms
));
2303 for (i
= 0; i
< TREE_VEC_LENGTH (tmpl_parms
); ++i
)
2305 tree tmpl_parm
= TREE_VALUE (TREE_VEC_ELT (tmpl_parms
, i
));
2306 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
2307 tree tmpl_default
= TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
));
2308 tree parm_default
= TREE_PURPOSE (TREE_VEC_ELT (parms
, i
));
2310 if (TREE_CODE (tmpl_parm
) != TREE_CODE (parm
))
2312 cp_error_at ("template parameter `%#D'", tmpl_parm
);
2313 cp_error ("redeclared here as `%#D'", parm
);
2317 if (tmpl_default
!= NULL_TREE
&& parm_default
!= NULL_TREE
)
2319 /* We have in [temp.param]:
2321 A template-parameter may not be given default arguments
2322 by two different declarations in the same scope. */
2323 cp_error ("redefinition of default argument for `%#D'", parm
);
2324 cp_error_at (" original definition appeared here", tmpl_parm
);
2328 if (parm_default
!= NULL_TREE
)
2329 /* Update the previous template parameters (which are the ones
2330 that will really count) with the new default value. */
2331 TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
)) = parm_default
;
2335 /* Attempt to convert the non-type template parameter EXPR to the
2336 indicated TYPE. If the conversion is successful, return the
2337 converted value. If the conversion is unsuccesful, return
2338 NULL_TREE if we issued an error message, or error_mark_node if we
2339 did not. We issue error messages for out-and-out bad template
2340 parameters, but not simply because the conversion failed, since we
2341 might be just trying to do argument deduction. By the time this
2342 function is called, neither TYPE nor EXPR may make use of template
2346 convert_nontype_argument (type
, expr
)
2350 tree expr_type
= TREE_TYPE (expr
);
2352 /* A template-argument for a non-type, non-template
2353 template-parameter shall be one of:
2355 --an integral constant-expression of integral or enumeration
2358 --the name of a non-type template-parameter; or
2360 --the name of an object or function with external linkage,
2361 including function templates and function template-ids but
2362 excluding non-static class members, expressed as id-expression;
2365 --the address of an object or function with external linkage,
2366 including function templates and function template-ids but
2367 excluding non-static class members, expressed as & id-expression
2368 where the & is optional if the name refers to a function or
2371 --a pointer to member expressed as described in _expr.unary.op_. */
2373 /* An integral constant-expression can include const variables
2375 if (INTEGRAL_TYPE_P (expr_type
) && TREE_READONLY_DECL_P (expr
))
2376 expr
= decl_constant_value (expr
);
2378 if (is_overloaded_fn (expr
))
2379 /* OK for now. We'll check that it has external linkage later.
2380 Check this first since if expr_type is the unknown_type_node
2381 we would otherwise complain below. */
2383 else if (INTEGRAL_TYPE_P (expr_type
)
2384 || TYPE_PTRMEM_P (expr_type
)
2385 || TYPE_PTRMEMFUNC_P (expr_type
)
2386 /* The next two are g++ extensions. */
2387 || TREE_CODE (expr_type
) == REAL_TYPE
2388 || TREE_CODE (expr_type
) == COMPLEX_TYPE
)
2390 if (! TREE_CONSTANT (expr
))
2393 cp_error ("non-constant `%E' cannot be used as template argument",
2398 else if (TYPE_PTR_P (expr_type
)
2399 /* If expr is the address of an overloaded function, we
2400 will get the unknown_type_node at this point. */
2401 || expr_type
== unknown_type_node
)
2407 if (TREE_CODE (e
) != ADDR_EXPR
)
2410 cp_error ("`%E' is not a valid template argument", expr
);
2411 error ("it must be %s%s with external linkage",
2412 TREE_CODE (TREE_TYPE (expr
)) == POINTER_TYPE
2413 ? "a pointer to " : "",
2414 TREE_CODE (TREE_TYPE (TREE_TYPE (expr
))) == FUNCTION_TYPE
2415 ? "a function" : "an object");
2419 referent
= TREE_OPERAND (e
, 0);
2420 STRIP_NOPS (referent
);
2422 if (TREE_CODE (referent
) == STRING_CST
)
2424 cp_error ("string literal %E is not a valid template argument",
2426 error ("because it is the address of an object with static linkage");
2430 if (is_overloaded_fn (referent
))
2431 /* We'll check that it has external linkage later. */
2433 else if (TREE_CODE (referent
) != VAR_DECL
)
2435 else if (!TREE_PUBLIC (referent
))
2437 cp_error ("address of non-extern `%E' cannot be used as template argument", referent
);
2438 return error_mark_node
;
2441 else if (TREE_CODE (expr
) == VAR_DECL
)
2443 if (!TREE_PUBLIC (expr
))
2448 cp_error ("object `%E' cannot be used as template argument", expr
);
2452 switch (TREE_CODE (type
))
2457 /* For a non-type template-parameter of integral or enumeration
2458 type, integral promotions (_conv.prom_) and integral
2459 conversions (_conv.integral_) are applied. */
2460 if (!INTEGRAL_TYPE_P (expr_type
))
2461 return error_mark_node
;
2463 /* It's safe to call digest_init in this case; we know we're
2464 just converting one integral constant expression to another. */
2465 expr
= digest_init (type
, expr
, (tree
*) 0);
2467 if (TREE_CODE (expr
) != INTEGER_CST
)
2468 /* Curiously, some TREE_CONSTNAT integral expressions do not
2469 simplify to integer constants. For example, `3 % 0',
2470 remains a TRUNC_MOD_EXPR. */
2477 /* These are g++ extensions. */
2478 if (TREE_CODE (expr_type
) != TREE_CODE (type
))
2479 return error_mark_node
;
2481 expr
= digest_init (type
, expr
, (tree
*) 0);
2483 if (TREE_CODE (expr
) != REAL_CST
)
2490 tree type_pointed_to
= TREE_TYPE (type
);
2492 if (TYPE_PTRMEM_P (type
))
2493 /* For a non-type template-parameter of type pointer to data
2494 member, qualification conversions (_conv.qual_) are
2496 return perform_qualification_conversions (type
, expr
);
2497 else if (TREE_CODE (type_pointed_to
) == FUNCTION_TYPE
)
2499 /* For a non-type template-parameter of type pointer to
2500 function, only the function-to-pointer conversion
2501 (_conv.func_) is applied. If the template-argument
2502 represents a set of overloaded functions (or a pointer to
2503 such), the matching function is selected from the set
2508 if (TREE_CODE (expr
) == ADDR_EXPR
)
2509 fns
= TREE_OPERAND (expr
, 0);
2513 fn
= instantiate_type (type_pointed_to
, fns
, 0);
2515 if (fn
== error_mark_node
)
2516 return error_mark_node
;
2518 if (!TREE_PUBLIC (fn
))
2520 if (really_overloaded_fn (fns
))
2521 return error_mark_node
;
2526 expr
= build_unary_op (ADDR_EXPR
, fn
, 0);
2528 my_friendly_assert (comptypes (type
, TREE_TYPE (expr
), 1),
2534 /* For a non-type template-parameter of type pointer to
2535 object, qualification conversions (_conv.qual_) and the
2536 array-to-pointer conversion (_conv.array_) are applied.
2537 [Note: In particular, neither the null pointer conversion
2538 (_conv.ptr_) nor the derived-to-base conversion
2539 (_conv.ptr_) are applied. Although 0 is a valid
2540 template-argument for a non-type template-parameter of
2541 integral type, it is not a valid template-argument for a
2542 non-type template-parameter of pointer type.]
2544 The call to decay_conversion performs the
2545 array-to-pointer conversion, if appropriate. */
2546 expr
= decay_conversion (expr
);
2548 if (expr
== error_mark_node
)
2549 return error_mark_node
;
2551 return perform_qualification_conversions (type
, expr
);
2556 case REFERENCE_TYPE
:
2558 tree type_referred_to
= TREE_TYPE (type
);
2560 if (TREE_CODE (type_referred_to
) == FUNCTION_TYPE
)
2562 /* For a non-type template-parameter of type reference to
2563 function, no conversions apply. If the
2564 template-argument represents a set of overloaded
2565 functions, the matching function is selected from the
2566 set (_over.over_). */
2570 fn
= instantiate_type (type_referred_to
, fns
, 0);
2572 if (!TREE_PUBLIC (fn
))
2574 if (really_overloaded_fn (fns
))
2575 /* Don't issue an error here; we might get a different
2576 function if the overloading had worked out
2578 return error_mark_node
;
2583 if (fn
== error_mark_node
)
2584 return error_mark_node
;
2586 my_friendly_assert (comptypes (type
, TREE_TYPE (fn
), 1),
2593 /* For a non-type template-parameter of type reference to
2594 object, no conversions apply. The type referred to by the
2595 reference may be more cv-qualified than the (otherwise
2596 identical) type of the template-argument. The
2597 template-parameter is bound directly to the
2598 template-argument, which must be an lvalue. */
2599 if (!comptypes (TYPE_MAIN_VARIANT (expr_type
),
2600 TYPE_MAIN_VARIANT (type
), 1)
2601 || (TYPE_READONLY (expr_type
) >
2602 TYPE_READONLY (type_referred_to
))
2603 || (TYPE_VOLATILE (expr_type
) >
2604 TYPE_VOLATILE (type_referred_to
))
2605 || !real_lvalue_p (expr
))
2606 return error_mark_node
;
2618 if (!TYPE_PTRMEMFUNC_P (type
))
2619 /* This handles templates like
2620 template<class T, T t> void f();
2621 when T is substituted with any class. The second template
2622 parameter becomes invalid and the template candidate is
2624 return error_mark_node
;
2626 /* For a non-type template-parameter of type pointer to member
2627 function, no conversions apply. If the template-argument
2628 represents a set of overloaded member functions, the
2629 matching member function is selected from the set
2632 if (!TYPE_PTRMEMFUNC_P (expr_type
) &&
2633 expr_type
!= unknown_type_node
)
2634 return error_mark_node
;
2636 if (TREE_CODE (expr
) == CONSTRUCTOR
)
2638 /* A ptr-to-member constant. */
2639 if (!comptypes (type
, expr_type
, 1))
2640 return error_mark_node
;
2645 if (TREE_CODE (expr
) != ADDR_EXPR
)
2646 return error_mark_node
;
2648 fns
= TREE_OPERAND (expr
, 0);
2650 fn
= instantiate_type (TREE_TYPE (TREE_TYPE (type
)),
2653 if (fn
== error_mark_node
)
2654 return error_mark_node
;
2656 expr
= build_unary_op (ADDR_EXPR
, fn
, 0);
2658 my_friendly_assert (comptypes (type
, TREE_TYPE (expr
), 1),
2665 /* All non-type parameters must have one of these types. */
2666 my_friendly_abort (0);
2670 return error_mark_node
;
2673 /* Return 1 if PARM_PARMS and ARG_PARMS matches using rule for
2674 template template parameters. Both PARM_PARMS and ARG_PARMS are
2675 vectors of TREE_LIST nodes containing TYPE_DECL, TEMPLATE_DECL
2678 ARG_PARMS may contain more parameters than PARM_PARMS. If this is
2679 the case, then extra parameters must have default arguments.
2681 Consider the example:
2682 template <class T, class Allocator = allocator> class vector;
2683 template<template <class U> class TT> class C;
2685 C<vector> is a valid instantiation. PARM_PARMS for the above code
2686 contains a TYPE_DECL (for U), ARG_PARMS contains two TYPE_DECLs (for
2687 T and Allocator) and OUTER_ARGS contains the argument that is used to
2688 substitute the TT parameter. */
2691 coerce_template_template_parms (parm_parms
, arg_parms
, in_decl
, outer_args
)
2692 tree parm_parms
, arg_parms
, in_decl
, outer_args
;
2694 int nparms
, nargs
, i
;
2697 my_friendly_assert (TREE_CODE (parm_parms
) == TREE_VEC
, 0);
2698 my_friendly_assert (TREE_CODE (arg_parms
) == TREE_VEC
, 0);
2700 nparms
= TREE_VEC_LENGTH (parm_parms
);
2701 nargs
= TREE_VEC_LENGTH (arg_parms
);
2703 /* The rule here is opposite of coerce_template_parms. */
2706 && TREE_PURPOSE (TREE_VEC_ELT (arg_parms
, nparms
)) == NULL_TREE
))
2709 for (i
= 0; i
< nparms
; ++i
)
2711 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, i
));
2712 arg
= TREE_VALUE (TREE_VEC_ELT (arg_parms
, i
));
2714 if (arg
== NULL_TREE
|| arg
== error_mark_node
2715 || parm
== NULL_TREE
|| parm
== error_mark_node
)
2718 if (TREE_CODE (arg
) != TREE_CODE (parm
))
2721 switch (TREE_CODE (parm
))
2727 /* We encounter instantiations of templates like
2728 template <template <template <class> class> class TT>
2730 sorry ("nested template template parameter");
2734 /* The tsubst call is used to handle cases such as
2735 template <class T, template <T> class TT> class D;
2736 i.e. the parameter list of TT depends on earlier parameters. */
2737 if (!comptypes (tsubst (TREE_TYPE (parm
), outer_args
, in_decl
),
2738 TREE_TYPE (arg
), 1))
2743 my_friendly_abort (0);
2749 /* Convert the indicated template ARG as necessary to match the
2750 indicated template PARM. Returns the converted ARG, or
2751 error_mark_node if the conversion was unsuccessful. Error messages
2752 are issued if COMPLAIN is non-zero. This conversion is for the Ith
2753 parameter in the parameter list. ARGS is the full set of template
2754 arguments deduced so far. */
2757 convert_template_argument (parm
, arg
, args
, complain
, i
, in_decl
)
2767 int is_type
, requires_type
, is_tmpl_type
, requires_tmpl_type
;
2769 inner_args
= innermost_args (args
);
2771 if (TREE_CODE (arg
) == TREE_LIST
2772 && TREE_TYPE (arg
) != NULL_TREE
2773 && TREE_CODE (TREE_TYPE (arg
)) == OFFSET_TYPE
)
2775 /* The template argument was the name of some
2776 member function. That's usually
2777 illegal, but static members are OK. In any
2778 case, grab the underlying fields/functions
2779 and issue an error later if required. */
2780 arg
= TREE_VALUE (arg
);
2781 TREE_TYPE (arg
) = unknown_type_node
;
2784 requires_tmpl_type
= TREE_CODE (parm
) == TEMPLATE_DECL
;
2785 requires_type
= (TREE_CODE (parm
) == TYPE_DECL
2786 || requires_tmpl_type
);
2788 /* Check if it is a class template. If REQUIRES_TMPL_TYPE is true,
2789 we also accept implicitly created TYPE_DECL as a valid argument.
2790 This is necessary to handle the case where we pass a template name
2791 to a template template parameter in a scope where we've derived from
2792 in instantiation of that template, so the template name refers to that
2793 instantiation. We really ought to handle this better. */
2795 = ((TREE_CODE (arg
) == TEMPLATE_DECL
2796 && TREE_CODE (DECL_TEMPLATE_RESULT (arg
)) == TYPE_DECL
)
2797 || (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
2798 && !CLASSTYPE_TEMPLATE_INFO (arg
))
2799 || (TREE_CODE (arg
) == RECORD_TYPE
2800 && CLASSTYPE_TEMPLATE_INFO (arg
)
2801 && TREE_CODE (TYPE_NAME (arg
)) == TYPE_DECL
2802 && DECL_ARTIFICIAL (TYPE_NAME (arg
))
2803 && requires_tmpl_type
2804 && is_base_of_enclosing_class (arg
, current_class_type
)));
2805 if (is_tmpl_type
&& TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
2806 arg
= TYPE_STUB_DECL (arg
);
2807 else if (is_tmpl_type
&& TREE_CODE (arg
) == RECORD_TYPE
)
2808 arg
= CLASSTYPE_TI_TEMPLATE (arg
);
2810 is_type
= TREE_CODE_CLASS (TREE_CODE (arg
)) == 't' || is_tmpl_type
;
2812 if (requires_type
&& ! is_type
&& TREE_CODE (arg
) == SCOPE_REF
2813 && TREE_CODE (TREE_OPERAND (arg
, 0)) == TEMPLATE_TYPE_PARM
)
2815 cp_pedwarn ("to refer to a type member of a template parameter,");
2816 cp_pedwarn (" use `typename %E'", arg
);
2818 arg
= make_typename_type (TREE_OPERAND (arg
, 0),
2819 TREE_OPERAND (arg
, 1));
2822 if (is_type
!= requires_type
)
2828 cp_error ("type/value mismatch at argument %d in template parameter list for `%D'",
2831 cp_error (" expected a constant of type `%T', got `%T'",
2833 (is_tmpl_type
? DECL_NAME (arg
) : arg
));
2835 cp_error (" expected a type, got `%E'", arg
);
2838 return error_mark_node
;
2840 if (is_tmpl_type
^ requires_tmpl_type
)
2842 if (in_decl
&& complain
)
2844 cp_error ("type/value mismatch at argument %d in template parameter list for `%D'",
2847 cp_error (" expected a type, got `%T'", DECL_NAME (arg
));
2849 cp_error (" expected a class template, got `%T'", arg
);
2851 return error_mark_node
;
2856 if (requires_tmpl_type
)
2858 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
2859 tree argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
2861 if (coerce_template_template_parms (parmparm
, argparm
,
2862 in_decl
, inner_args
))
2866 /* TEMPLATE_TEMPLATE_PARM node is preferred over
2868 if (val
!= error_mark_node
2869 && DECL_TEMPLATE_TEMPLATE_PARM_P (val
))
2870 val
= TREE_TYPE (val
);
2874 if (in_decl
&& complain
)
2876 cp_error ("type/value mismatch at argument %d in template parameter list for `%D'",
2878 cp_error (" expected a template of type `%D', got `%D'", parm
, arg
);
2881 val
= error_mark_node
;
2886 val
= groktypename (arg
);
2887 if (! processing_template_decl
)
2889 /* [basic.link]: A name with no linkage (notably, the
2890 name of a class or enumeration declared in a local
2891 scope) shall not be used to declare an entity with
2892 linkage. This implies that names with no linkage
2893 cannot be used as template arguments. */
2894 tree t
= no_linkage_check (val
);
2897 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
2899 ("template-argument `%T' uses anonymous type", val
);
2902 ("template-argument `%T' uses local type `%T'",
2904 return error_mark_node
;
2911 tree t
= tsubst (TREE_TYPE (parm
), args
, in_decl
);
2913 if (processing_template_decl
)
2914 arg
= maybe_fold_nontype_arg (arg
);
2916 if (!uses_template_parms (arg
) && !uses_template_parms (t
))
2917 /* We used to call digest_init here. However, digest_init
2918 will report errors, which we don't want when complain
2919 is zero. More importantly, digest_init will try too
2920 hard to convert things: for example, `0' should not be
2921 converted to pointer type at this point according to
2922 the standard. Accepting this is not merely an
2923 extension, since deciding whether or not these
2924 conversions can occur is part of determining which
2925 function template to call, or whether a given epxlicit
2926 argument specification is legal. */
2927 val
= convert_nontype_argument (t
, arg
);
2931 if (val
== NULL_TREE
)
2932 val
= error_mark_node
;
2933 else if (val
== error_mark_node
&& complain
)
2934 cp_error ("could not convert template argument `%E' to `%T'",
2941 /* Convert all template arguments to their appropriate types, and
2942 return a vector containing the innermost resulting template
2943 arguments. If any error occurs, return error_mark_node, and, if
2944 COMPLAIN is non-zero, issue an error message. Some error messages
2945 are issued even if COMPLAIN is zero; for instance, if a template
2946 argument is composed from a local class.
2948 If REQUIRE_ALL_ARGUMENTS is non-zero, all arguments must be
2949 provided in ARGLIST, or else trailing parameters must have default
2950 values. If REQUIRE_ALL_ARGUMENTS is zero, we will attempt argument
2951 deduction for any unspecified trailing arguments.
2953 The resulting TREE_VEC is allocated on a temporary obstack, and
2954 must be explicitly copied if it will be permanent. */
2957 coerce_template_parms (parms
, args
, in_decl
,
2959 require_all_arguments
)
2963 int require_all_arguments
;
2965 int nparms
, nargs
, i
, lost
= 0;
2968 tree new_inner_args
;
2970 inner_args
= innermost_args (args
);
2971 nargs
= NUM_TMPL_ARGS (inner_args
);
2972 nparms
= TREE_VEC_LENGTH (parms
);
2976 && require_all_arguments
2977 && TREE_PURPOSE (TREE_VEC_ELT (parms
, nargs
)) == NULL_TREE
))
2981 cp_error ("wrong number of template arguments (%d, should be %d)",
2985 cp_error_at ("provided for `%D'", in_decl
);
2988 return error_mark_node
;
2991 new_inner_args
= make_temp_vec (nparms
);
2992 new_args
= add_outermost_template_args (args
, new_inner_args
);
2993 for (i
= 0; i
< nparms
; i
++)
2998 /* Get the Ith template parameter. */
2999 parm
= TREE_VEC_ELT (parms
, i
);
3001 /* Calculate the Ith argument. */
3002 if (inner_args
&& TREE_CODE (inner_args
) == TREE_LIST
)
3004 arg
= TREE_VALUE (inner_args
);
3005 inner_args
= TREE_CHAIN (inner_args
);
3008 arg
= TREE_VEC_ELT (inner_args
, i
);
3009 /* If no template argument was supplied, look for a default
3011 else if (TREE_PURPOSE (parm
) == NULL_TREE
)
3013 /* There was no default value. */
3014 my_friendly_assert (!require_all_arguments
, 0);
3017 else if (TREE_CODE (TREE_VALUE (parm
)) == TYPE_DECL
)
3018 arg
= tsubst (TREE_PURPOSE (parm
), new_args
, in_decl
);
3020 arg
= tsubst_expr (TREE_PURPOSE (parm
), new_args
, in_decl
);
3022 /* Now, convert the Ith argument, as necessary. */
3023 if (arg
== NULL_TREE
)
3024 /* We're out of arguments. */
3026 my_friendly_assert (!require_all_arguments
, 0);
3029 else if (arg
== error_mark_node
)
3031 cp_error ("template argument %d is invalid", i
+ 1);
3032 arg
= error_mark_node
;
3035 arg
= convert_template_argument (TREE_VALUE (parm
),
3036 arg
, new_args
, complain
, i
,
3039 if (arg
== error_mark_node
)
3041 TREE_VEC_ELT (new_inner_args
, i
) = arg
;
3045 return error_mark_node
;
3047 return new_inner_args
;
3050 /* Renturns 1 iff the OLDARGS and NEWARGS are in fact identical sets
3051 of template arguments. Returns 0 otherwise. */
3054 comp_template_args (oldargs
, newargs
)
3055 tree oldargs
, newargs
;
3059 if (TREE_VEC_LENGTH (oldargs
) != TREE_VEC_LENGTH (newargs
))
3062 for (i
= 0; i
< TREE_VEC_LENGTH (oldargs
); ++i
)
3064 tree nt
= TREE_VEC_ELT (newargs
, i
);
3065 tree ot
= TREE_VEC_ELT (oldargs
, i
);
3069 if (TREE_CODE (nt
) != TREE_CODE (ot
))
3071 if (TREE_CODE (nt
) == TREE_VEC
)
3073 /* For member templates */
3074 if (comp_template_args (ot
, nt
))
3077 else if (TREE_CODE_CLASS (TREE_CODE (ot
)) == 't')
3079 if (comptypes (ot
, nt
, 1))
3082 else if (cp_tree_equal (ot
, nt
) > 0)
3089 /* Given class template name and parameter list, produce a user-friendly name
3090 for the instantiation. */
3093 mangle_class_name_for_template (name
, parms
, arglist
)
3095 tree parms
, arglist
;
3097 static struct obstack scratch_obstack
;
3098 static char *scratch_firstobj
;
3101 if (!scratch_firstobj
)
3102 gcc_obstack_init (&scratch_obstack
);
3104 obstack_free (&scratch_obstack
, scratch_firstobj
);
3105 scratch_firstobj
= obstack_alloc (&scratch_obstack
, 1);
3107 #define ccat(c) obstack_1grow (&scratch_obstack, (c));
3108 #define cat(s) obstack_grow (&scratch_obstack, (s), strlen (s))
3112 nparms
= TREE_VEC_LENGTH (parms
);
3113 arglist
= innermost_args (arglist
);
3114 my_friendly_assert (nparms
== TREE_VEC_LENGTH (arglist
), 268);
3115 for (i
= 0; i
< nparms
; i
++)
3117 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
3118 tree arg
= TREE_VEC_ELT (arglist
, i
);
3123 if (TREE_CODE (parm
) == TYPE_DECL
)
3125 cat (type_as_string_real (arg
, 0, 1));
3128 else if (TREE_CODE (parm
) == TEMPLATE_DECL
)
3130 if (TREE_CODE (arg
) == TEMPLATE_DECL
)
3132 /* Already substituted with real template. Just output
3133 the template name here */
3134 tree context
= DECL_CONTEXT (arg
);
3137 my_friendly_assert (TREE_CODE (context
) == NAMESPACE_DECL
, 980422);
3138 cat(decl_as_string (DECL_CONTEXT (arg
), 0));
3141 cat (IDENTIFIER_POINTER (DECL_NAME (arg
)));
3144 /* Output the parameter declaration */
3145 cat (type_as_string_real (arg
, 0, 1));
3149 my_friendly_assert (TREE_CODE (parm
) == PARM_DECL
, 269);
3151 if (TREE_CODE (arg
) == TREE_LIST
)
3153 /* New list cell was built because old chain link was in
3155 my_friendly_assert (TREE_PURPOSE (arg
) == NULL_TREE
, 270);
3156 arg
= TREE_VALUE (arg
);
3158 /* No need to check arglist against parmlist here; we did that
3159 in coerce_template_parms, called from lookup_template_class. */
3160 cat (expr_as_string (arg
, 0));
3163 char *bufp
= obstack_next_free (&scratch_obstack
);
3165 while (bufp
[offset
- 1] == ' ')
3167 obstack_blank_fast (&scratch_obstack
, offset
);
3169 /* B<C<char> >, not B<C<char>> */
3170 if (bufp
[offset
- 1] == '>')
3175 return (char *) obstack_base (&scratch_obstack
);
3179 classtype_mangled_name (t
)
3182 if (CLASSTYPE_TEMPLATE_INFO (t
)
3183 /* Specializations have already had their names set up in
3184 lookup_template_class. */
3185 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (t
)
3186 /* For non-primary templates, the template parameters are
3187 implicit from their surrounding context. */
3188 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (t
)))
3190 tree name
= DECL_NAME (CLASSTYPE_TI_TEMPLATE (t
));
3191 char *mangled_name
= mangle_class_name_for_template
3192 (IDENTIFIER_POINTER (name
),
3193 DECL_INNERMOST_TEMPLATE_PARMS (CLASSTYPE_TI_TEMPLATE (t
)),
3194 CLASSTYPE_TI_ARGS (t
));
3195 tree id
= get_identifier (mangled_name
);
3196 IDENTIFIER_TEMPLATE (id
) = name
;
3200 return TYPE_IDENTIFIER (t
);
3204 add_pending_template (d
)
3209 if (TREE_CODE_CLASS (TREE_CODE (d
)) == 't')
3210 ti
= CLASSTYPE_TEMPLATE_INFO (d
);
3212 ti
= DECL_TEMPLATE_INFO (d
);
3214 if (TI_PENDING_TEMPLATE_FLAG (ti
))
3217 *template_tail
= perm_tree_cons
3218 (build_srcloc_here (), d
, NULL_TREE
);
3219 template_tail
= &TREE_CHAIN (*template_tail
);
3220 TI_PENDING_TEMPLATE_FLAG (ti
) = 1;
3224 /* Return a TEMPLATE_ID_EXPR corresponding to the indicated FNS (which
3225 may be either a _DECL or an overloaded function or an
3226 IDENTIFIER_NODE), and ARGLIST. */
3229 lookup_template_function (fns
, arglist
)
3234 if (fns
== NULL_TREE
)
3236 cp_error ("non-template used as template");
3237 return error_mark_node
;
3240 type
= TREE_TYPE (fns
);
3241 if (TREE_CODE (fns
) == OVERLOAD
|| !type
)
3242 type
= unknown_type_node
;
3244 if (processing_template_decl
)
3245 return build_min (TEMPLATE_ID_EXPR
, type
, fns
, arglist
);
3247 return build (TEMPLATE_ID_EXPR
, type
, fns
, arglist
);
3250 /* Within the scope of a template class S<T>, the name S gets bound
3251 (in build_self_reference) to a TYPE_DECL for the class, not a
3252 TEMPLATE_DECL. If DECL is a TYPE_DECL for current_class_type,
3253 or one of its enclosing classes, and that type is a template,
3254 return the associated TEMPLATE_DECL. Otherwise, the original
3255 DECL is returned. */
3258 maybe_get_template_decl_from_type_decl (decl
)
3261 return (decl
!= NULL_TREE
3262 && TREE_CODE (decl
) == TYPE_DECL
3263 && DECL_ARTIFICIAL (decl
)
3264 && CLASSTYPE_TEMPLATE_INFO (TREE_TYPE (decl
)))
3265 ? CLASSTYPE_TI_TEMPLATE (TREE_TYPE (decl
)) : decl
;
3268 /* Given an IDENTIFIER_NODE (type TEMPLATE_DECL) and a chain of
3269 parameters, find the desired type.
3271 D1 is the PTYPENAME terminal, and ARGLIST is the list of arguments.
3272 (Actually ARGLIST may be either a TREE_LIST or a TREE_VEC. It will
3273 be a TREE_LIST if called directly from the parser, and a TREE_VEC
3274 otherwise.) Since ARGLIST is build on the decl_obstack, we must
3275 copy it here to keep it from being reclaimed when the decl storage
3278 IN_DECL, if non-NULL, is the template declaration we are trying to
3281 If ENTERING_SCOPE is non-zero, we are about to enter the scope of
3282 the class we are looking up.
3284 If the template class is really a local class in a template
3285 function, then the FUNCTION_CONTEXT is the function in which it is
3286 being instantiated. */
3289 lookup_template_class (d1
, arglist
, in_decl
, context
, entering_scope
)
3295 tree
template = NULL_TREE
, parmlist
;
3298 if (TREE_CODE (d1
) == IDENTIFIER_NODE
)
3300 if (IDENTIFIER_LOCAL_VALUE (d1
)
3301 && DECL_TEMPLATE_TEMPLATE_PARM_P (IDENTIFIER_LOCAL_VALUE (d1
)))
3302 template = IDENTIFIER_LOCAL_VALUE (d1
);
3306 push_decl_namespace (context
);
3307 if (current_class_type
!= NULL_TREE
)
3309 maybe_get_template_decl_from_type_decl
3310 (IDENTIFIER_CLASS_VALUE (d1
));
3311 if (template == NULL_TREE
)
3312 template = lookup_name_nonclass (d1
);
3314 pop_decl_namespace ();
3317 context
= DECL_CONTEXT (template);
3319 else if (TREE_CODE (d1
) == TYPE_DECL
&& IS_AGGR_TYPE (TREE_TYPE (d1
)))
3321 if (CLASSTYPE_TEMPLATE_INFO (TREE_TYPE (d1
)) == NULL_TREE
)
3322 return error_mark_node
;
3323 template = CLASSTYPE_TI_TEMPLATE (TREE_TYPE (d1
));
3324 d1
= DECL_NAME (template);
3326 else if (TREE_CODE (d1
) == ENUMERAL_TYPE
3327 || (TREE_CODE_CLASS (TREE_CODE (d1
)) == 't'
3328 && IS_AGGR_TYPE (d1
)))
3330 template = TYPE_TI_TEMPLATE (d1
);
3331 d1
= DECL_NAME (template);
3333 else if (TREE_CODE (d1
) == TEMPLATE_DECL
3334 && TREE_CODE (DECL_RESULT (d1
)) == TYPE_DECL
)
3337 d1
= DECL_NAME (template);
3338 context
= DECL_CONTEXT (template);
3341 my_friendly_abort (272);
3343 /* With something like `template <class T> class X class X { ... };'
3344 we could end up with D1 having nothing but an IDENTIFIER_LOCAL_VALUE.
3345 We don't want to do that, but we have to deal with the situation, so
3346 let's give them some syntax errors to chew on instead of a crash. */
3348 return error_mark_node
;
3350 if (context
== NULL_TREE
)
3351 context
= global_namespace
;
3353 if (TREE_CODE (template) != TEMPLATE_DECL
)
3355 cp_error ("non-template type `%T' used as a template", d1
);
3357 cp_error_at ("for template declaration `%D'", in_decl
);
3358 return error_mark_node
;
3361 if (DECL_TEMPLATE_TEMPLATE_PARM_P (template))
3363 /* Create a new TEMPLATE_DECL and TEMPLATE_TEMPLATE_PARM node to store
3364 template arguments */
3366 tree parm
= copy_template_template_parm (TREE_TYPE (template));
3367 tree template2
= TYPE_STUB_DECL (parm
);
3370 CLASSTYPE_GOT_SEMICOLON (parm
) = 1;
3371 parmlist
= DECL_INNERMOST_TEMPLATE_PARMS (template);
3373 arglist2
= coerce_template_parms (parmlist
, arglist
, template, 1, 1);
3374 if (arglist2
== error_mark_node
)
3375 return error_mark_node
;
3377 arglist2
= copy_to_permanent (arglist2
);
3378 CLASSTYPE_TEMPLATE_INFO (parm
)
3379 = perm_tree_cons (template2
, arglist2
, NULL_TREE
);
3380 TYPE_SIZE (parm
) = 0;
3385 extern tree current_local_enum
;
3386 tree template_type
= TREE_TYPE (template);
3388 tree found
= NULL_TREE
;
3391 int is_partial_instantiation
;
3392 tree prev_local_enum
= NULL_TREE
;
3394 template = most_general_template (template);
3395 parmlist
= DECL_TEMPLATE_PARMS (template);
3396 parm_depth
= TMPL_PARMS_DEPTH (parmlist
);
3397 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
3399 if (arg_depth
== 1 && parm_depth
> 1)
3401 /* We've been given an incomplete set of template arguments.
3404 template <class T> struct S1 {
3405 template <class U> struct S2 {};
3406 template <class U> struct S2<U*> {};
3409 we will be called with an ARGLIST of `U*', but the
3410 TEMPLATE will be `template <class T> template
3411 <class U> struct S1<T>::S2'. We must fill in the missing
3413 my_friendly_assert (context
!= NULL_TREE
, 0);
3414 while (!IS_AGGR_TYPE_CODE (TREE_CODE (context
))
3415 && context
!= global_namespace
)
3416 context
= DECL_REAL_CONTEXT (context
);
3418 if (context
== global_namespace
)
3419 /* This is bad. We cannot get enough arguments, even from
3420 the surrounding context, to resolve this class. One
3421 case where this might happen is (illegal) code like:
3429 We should catch this error sooner (at the opening curly
3430 for `S', but it is better to be safe than sorry here. */
3432 cp_error ("invalid use of `%D'", template);
3433 return error_mark_node
;
3436 arglist
= add_to_template_args (TYPE_TI_ARGS (context
),
3438 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
3441 my_friendly_assert (parm_depth
== arg_depth
, 0);
3443 /* Calculate the BOUND_ARGS. These will be the args that are
3444 actually tsubst'd into the definition to create the
3448 /* We have multiple levels of arguments to coerce, at once. */
3450 int saved_depth
= TMPL_ARGS_DEPTH (arglist
);
3452 tree bound_args
= make_temp_vec (parm_depth
);
3454 for (i
= saved_depth
,
3455 t
= DECL_TEMPLATE_PARMS (template);
3456 i
> 0 && t
!= NULL_TREE
;
3457 --i
, t
= TREE_CHAIN (t
))
3459 tree a
= coerce_template_parms (TREE_VALUE (t
),
3460 arglist
, template, 1, 1);
3461 SET_TMPL_ARGS_LEVEL (bound_args
, i
, a
);
3463 /* We temporarily reduce the length of the ARGLIST so
3464 that coerce_template_parms will see only the arguments
3465 corresponding to the template parameters it is
3467 TREE_VEC_LENGTH (arglist
)--;
3470 /* Restore the ARGLIST to its full size. */
3471 TREE_VEC_LENGTH (arglist
) = saved_depth
;
3473 arglist
= bound_args
;
3477 = coerce_template_parms (INNERMOST_TEMPLATE_PARMS (parmlist
),
3478 innermost_args (arglist
),
3481 if (arglist
== error_mark_node
)
3482 /* We were unable to bind the arguments. */
3483 return error_mark_node
;
3485 /* In the scope of a template class, explicit references to the
3486 template class refer to the type of the template, not any
3487 instantiation of it. For example, in:
3489 template <class T> class C { void f(C<T>); }
3491 the `C<T>' is just the same as `C'. Outside of the
3492 class, however, such a reference is an instantiation. */
3493 if (comp_template_args (TYPE_TI_ARGS (template_type
),
3496 found
= template_type
;
3498 if (!entering_scope
&& PRIMARY_TEMPLATE_P (template))
3502 /* Note that we use DECL_CONTEXT, rather than
3503 CP_DECL_CONTEXT, so that the termination test is
3504 always just `ctx'. We're not interested in namepace
3506 for (ctx
= current_class_type
;
3508 ctx
= (TREE_CODE_CLASS (TREE_CODE (ctx
)) == 't')
3509 ? TYPE_CONTEXT (ctx
) : DECL_CONTEXT (ctx
))
3510 if (comptypes (ctx
, template_type
, 1))
3514 /* We're not in the scope of the class, so the
3515 TEMPLATE_TYPE is not the type we want after
3523 for (found
= DECL_TEMPLATE_INSTANTIATIONS (template);
3524 found
; found
= TREE_CHAIN (found
))
3525 if (comp_template_args (TREE_PURPOSE (found
), arglist
))
3529 found
= TREE_VALUE (found
);
3534 if (can_free (&permanent_obstack
, arglist
))
3535 obstack_free (&permanent_obstack
, arglist
);
3539 /* Since we didn't find the type, we'll have to create it.
3540 Since we'll be saving this type on the
3541 DECL_TEMPLATE_INSTANTIATIONS list, it must be permanent. */
3542 push_obstacks (&permanent_obstack
, &permanent_obstack
);
3544 /* This type is a "partial instantiation" if any of the template
3545 arguments still inolve template parameters. */
3546 is_partial_instantiation
= uses_template_parms (arglist
);
3548 /* Create the type. */
3549 if (TREE_CODE (template_type
) == ENUMERAL_TYPE
)
3551 if (!is_partial_instantiation
)
3553 prev_local_enum
= current_local_enum
;
3554 t
= start_enum (TYPE_IDENTIFIER (template_type
));
3557 /* We don't want to call start_enum for this type, since
3558 the values for the enumeration constants may involve
3559 template parameters. And, no one should be interested
3560 in the enumeration constants for such a type. */
3561 t
= make_node (ENUMERAL_TYPE
);
3565 t
= make_lang_type (TREE_CODE (template_type
));
3566 CLASSTYPE_DECLARED_CLASS (t
)
3567 = CLASSTYPE_DECLARED_CLASS (template_type
);
3568 CLASSTYPE_GOT_SEMICOLON (t
) = 1;
3569 SET_CLASSTYPE_IMPLICIT_INSTANTIATION (t
);
3570 TYPE_FOR_JAVA (t
) = TYPE_FOR_JAVA (template_type
);
3573 /* If we called tsubst_enum above, this information will already
3577 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
3579 /* Create a stub TYPE_DECL for it. */
3580 type_decl
= build_decl (TYPE_DECL
, DECL_NAME (template), t
);
3581 SET_DECL_ARTIFICIAL (type_decl
);
3582 DECL_CONTEXT (type_decl
) = TYPE_CONTEXT (t
);
3583 DECL_SOURCE_FILE (type_decl
)
3584 = DECL_SOURCE_FILE (TYPE_STUB_DECL (template_type
));
3585 DECL_SOURCE_LINE (type_decl
)
3586 = DECL_SOURCE_LINE (TYPE_STUB_DECL (template_type
));
3587 TYPE_STUB_DECL (t
) = TYPE_NAME (t
) = type_decl
;
3590 type_decl
= TYPE_NAME (t
);
3592 /* Set up the template information. */
3593 arglist
= copy_to_permanent (arglist
);
3594 SET_TYPE_TEMPLATE_INFO (t
,
3595 tree_cons (template, arglist
, NULL_TREE
));
3596 DECL_TEMPLATE_INSTANTIATIONS (template)
3597 = tree_cons (arglist
, t
,
3598 DECL_TEMPLATE_INSTANTIATIONS (template));
3600 if (TREE_CODE (t
) == ENUMERAL_TYPE
3601 && !is_partial_instantiation
)
3603 /* Now that the type has been registered on the
3604 instantiations list, we set up the enumerators. Because
3605 the enumeration constants may involve the enumeration
3606 type itself, we make sure to register the type first, and
3607 then create the constants. That way, doing tsubst_expr
3608 for the enumeration constants won't result in recursive
3609 calls here; we'll find the instantiation and exit above. */
3610 tsubst_enum (template_type
, t
, arglist
);
3611 current_local_enum
= prev_local_enum
;
3614 /* We're done with the permanent obstack, now. */
3617 /* Reset the name of the type, now that CLASSTYPE_TEMPLATE_INFO
3619 if (TREE_CODE (t
) != ENUMERAL_TYPE
)
3620 DECL_NAME (type_decl
) = classtype_mangled_name (t
);
3621 DECL_ASSEMBLER_NAME (type_decl
) = DECL_NAME (type_decl
);
3622 if (!is_partial_instantiation
)
3624 DECL_ASSEMBLER_NAME (type_decl
)
3625 = get_identifier (build_overload_name (t
, 1, 1));
3627 /* For backwards compatibility; code that uses
3628 -fexternal-templates expects looking up a template to
3629 instantiate it. I think DDD still relies on this.
3630 (jason 8/20/1998) */
3631 if (TREE_CODE (t
) != ENUMERAL_TYPE
3632 && flag_external_templates
3633 && CLASSTYPE_INTERFACE_KNOWN (TREE_TYPE (template))
3634 && ! CLASSTYPE_INTERFACE_ONLY (TREE_TYPE (template)))
3635 add_pending_template (t
);
3638 /* If the type makes use of template parameters, the
3639 code that generates debugging information will crash. */
3640 DECL_IGNORED_P (TYPE_STUB_DECL (t
)) = 1;
3646 /* For each TEMPLATE_TYPE_PARM, TEMPLATE_TEMPLATE_PARM, or
3647 TEMPLATE_PARM_INDEX in T, call FN with the parameter and the DATA.
3648 If FN returns non-zero, the iteration is terminated, and
3649 for_each_template_parm returns 1. Otherwise, the iteration
3650 continues. If FN never returns a non-zero value, the value
3651 returned by for_each_template_parm is 0. If FN is NULL, it is
3652 considered to be the function which always returns 1. */
3655 for_each_template_parm (t
, fn
, data
)
3663 if (TREE_CODE_CLASS (TREE_CODE (t
)) == 't'
3664 && for_each_template_parm (TYPE_CONTEXT (t
), fn
, data
))
3667 switch (TREE_CODE (t
))
3671 /* We assume that the object must be instantiated in order to build
3672 the COMPONENT_REF, so we test only whether the type of the
3673 COMPONENT_REF uses template parms. */
3674 return for_each_template_parm (TREE_TYPE (t
), fn
, data
);
3676 case IDENTIFIER_NODE
:
3677 if (!IDENTIFIER_TEMPLATE (t
))
3679 my_friendly_abort (42);
3681 /* aggregates of tree nodes */
3684 int i
= TREE_VEC_LENGTH (t
);
3686 if (for_each_template_parm (TREE_VEC_ELT (t
, i
), fn
, data
))
3691 if (for_each_template_parm (TREE_PURPOSE (t
), fn
, data
)
3692 || for_each_template_parm (TREE_VALUE (t
), fn
, data
))
3694 return for_each_template_parm (TREE_CHAIN (t
), fn
, data
);
3697 if (for_each_template_parm (OVL_FUNCTION (t
), fn
, data
))
3699 return for_each_template_parm (OVL_CHAIN (t
), fn
, data
);
3701 /* constructed type nodes */
3703 case REFERENCE_TYPE
:
3704 return for_each_template_parm (TREE_TYPE (t
), fn
, data
);
3707 if (TYPE_PTRMEMFUNC_FLAG (t
))
3708 return for_each_template_parm (TYPE_PTRMEMFUNC_FN_TYPE (t
),
3714 if (! TYPE_TEMPLATE_INFO (t
))
3716 return for_each_template_parm (TREE_VALUE
3717 (TYPE_TEMPLATE_INFO (t
)),
3720 if (for_each_template_parm (TYPE_ARG_TYPES (t
), fn
, data
))
3722 return for_each_template_parm (TREE_TYPE (t
), fn
, data
);
3724 if (for_each_template_parm (TYPE_DOMAIN (t
), fn
, data
))
3726 return for_each_template_parm (TREE_TYPE (t
), fn
, data
);
3728 if (for_each_template_parm (TYPE_OFFSET_BASETYPE (t
), fn
, data
))
3730 return for_each_template_parm (TREE_TYPE (t
), fn
, data
);
3732 if (for_each_template_parm (TYPE_METHOD_BASETYPE (t
), fn
, data
))
3734 if (for_each_template_parm (TYPE_ARG_TYPES (t
), fn
, data
))
3736 return for_each_template_parm (TREE_TYPE (t
), fn
, data
);
3740 return for_each_template_parm (TREE_TYPE (t
), fn
, data
);
3743 /* A template template parameter is encountered */
3744 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
3745 return for_each_template_parm (TREE_TYPE (t
), fn
, data
);
3746 /* Already substituted template template parameter */
3750 if (for_each_template_parm (DECL_INITIAL (t
), fn
, data
))
3752 goto check_type_and_context
;
3756 /* ??? What about FIELD_DECLs? */
3757 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
)
3758 && for_each_template_parm (DECL_TI_ARGS (t
), fn
, data
))
3762 check_type_and_context
:
3763 if (for_each_template_parm (TREE_TYPE (t
), fn
, data
))
3765 if (DECL_CONTEXT (t
)
3766 && for_each_template_parm (DECL_CONTEXT (t
), fn
, data
))
3771 return for_each_template_parm (TREE_TYPE (t
), fn
, data
);
3773 return for_each_template_parm (TREE_OPERAND (t
, 0), fn
, data
);
3775 /* template parm nodes */
3776 case TEMPLATE_TEMPLATE_PARM
:
3777 /* Record template parameters such as `T' inside `TT<T>'. */
3778 if (CLASSTYPE_TEMPLATE_INFO (t
)
3779 && for_each_template_parm (CLASSTYPE_TI_ARGS (t
), fn
, data
))
3781 case TEMPLATE_TYPE_PARM
:
3782 case TEMPLATE_PARM_INDEX
:
3784 return (*fn
)(t
, data
);
3788 /* simple type nodes */
3790 if (for_each_template_parm (TYPE_MIN_VALUE (t
), fn
, data
))
3792 return for_each_template_parm (TYPE_MAX_VALUE (t
), fn
, data
);
3798 case NAMESPACE_DECL
:
3808 /* Non-error_mark_node ERROR_MARKs are bad things. */
3809 my_friendly_assert (t
== error_mark_node
, 274);
3818 return for_each_template_parm (TREE_OPERAND (t
, 0), fn
, data
);
3821 if (TREE_TYPE (t
) && TYPE_PTRMEMFUNC_P (TREE_TYPE (t
)))
3822 return for_each_template_parm (TYPE_PTRMEMFUNC_FN_TYPE
3823 (TREE_TYPE (t
)), fn
, data
);
3824 return for_each_template_parm (TREE_OPERAND (t
, 1), fn
, data
);
3828 case REINTERPRET_CAST_EXPR
:
3829 case CONST_CAST_EXPR
:
3830 case STATIC_CAST_EXPR
:
3831 case DYNAMIC_CAST_EXPR
:
3839 return for_each_template_parm (TREE_OPERAND (t
, 0), fn
, data
);
3842 switch (TREE_CODE_CLASS (TREE_CODE (t
)))
3850 for (i
= first_rtl_op (TREE_CODE (t
)); --i
>= 0;)
3851 if (for_each_template_parm (TREE_OPERAND (t
, i
), fn
, data
))
3858 sorry ("testing %s for template parms",
3859 tree_code_name
[(int) TREE_CODE (t
)]);
3860 my_friendly_abort (82);
3867 uses_template_parms (t
)
3870 return for_each_template_parm (t
, 0, 0);
3873 static struct tinst_level
*current_tinst_level
;
3874 static struct tinst_level
*free_tinst_level
;
3875 static int tinst_depth
;
3876 extern int max_tinst_depth
;
3877 #ifdef GATHER_STATISTICS
3880 int tinst_level_tick
;
3881 int last_template_error_tick
;
3883 /* Print out all the template instantiations that we are currently
3884 working on. If ERR, we are being called from cp_thing, so do
3885 the right thing for an error message. */
3888 print_template_context (err
)
3891 struct tinst_level
*p
= current_tinst_level
;
3893 char *file
= input_filename
;
3897 if (current_function_decl
!= p
->decl
3898 && current_function_decl
!= NULL_TREE
)
3899 /* We can get here during the processing of some synthesized
3900 method. Then, p->decl will be the function that's causing
3905 if (current_function_decl
== p
->decl
)
3906 /* Avoid redundancy with the the "In function" line. */;
3908 fprintf (stderr
, "%s: In instantiation of `%s':\n",
3909 file
, decl_as_string (p
->decl
, 0));
3917 for (; p
; p
= p
->next
)
3919 fprintf (stderr
, "%s:%d: instantiated from `%s'\n", file
, line
,
3920 decl_as_string (p
->decl
, 0));
3924 fprintf (stderr
, "%s:%d: instantiated from here\n", file
, line
);
3927 /* Called from cp_thing to print the template context for an error. */
3930 maybe_print_template_context ()
3932 if (last_template_error_tick
== tinst_level_tick
3933 || current_tinst_level
== 0)
3936 last_template_error_tick
= tinst_level_tick
;
3937 print_template_context (1);
3941 push_tinst_level (d
)
3944 struct tinst_level
*new;
3946 if (tinst_depth
>= max_tinst_depth
)
3948 /* If the instantiation in question still has unbound template parms,
3949 we don't really care if we can't instantiate it, so just return.
3950 This happens with base instantiation for implicit `typename'. */
3951 if (uses_template_parms (d
))
3954 last_template_error_tick
= tinst_level_tick
;
3955 error ("template instantiation depth exceeds maximum of %d",
3957 error (" (use -ftemplate-depth-NN to increase the maximum)");
3958 cp_error (" instantiating `%D'", d
);
3960 print_template_context (0);
3965 if (free_tinst_level
)
3967 new = free_tinst_level
;
3968 free_tinst_level
= new->next
;
3971 new = (struct tinst_level
*) xmalloc (sizeof (struct tinst_level
));
3975 new->file
= input_filename
;
3976 new->next
= current_tinst_level
;
3977 current_tinst_level
= new;
3980 #ifdef GATHER_STATISTICS
3981 if (tinst_depth
> depth_reached
)
3982 depth_reached
= tinst_depth
;
3992 struct tinst_level
*old
= current_tinst_level
;
3994 /* Restore the filename and line number stashed away when we started
3995 this instantiation. */
3997 input_filename
= old
->file
;
3998 extract_interface_info ();
4000 current_tinst_level
= old
->next
;
4001 old
->next
= free_tinst_level
;
4002 free_tinst_level
= old
;
4007 struct tinst_level
*
4010 struct tinst_level
*p
= current_tinst_level
;
4013 for (; p
->next
; p
= p
->next
)
4018 /* DECL is a friend FUNCTION_DECL or TEMPLATE_DECL. ARGS is the
4019 vector of template arguments, as for tsubst.
4021 Returns an appropriate tsbust'd friend declaration. */
4024 tsubst_friend_function (decl
, args
)
4030 char *file
= input_filename
;
4032 lineno
= DECL_SOURCE_LINE (decl
);
4033 input_filename
= DECL_SOURCE_FILE (decl
);
4035 if (TREE_CODE (decl
) == FUNCTION_DECL
4036 && DECL_TEMPLATE_INSTANTIATION (decl
)
4037 && TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
4038 /* This was a friend declared with an explicit template
4039 argument list, e.g.:
4043 to indicate that f was a template instantiation, not a new
4044 function declaration. Now, we have to figure out what
4045 instantiation of what template. */
4052 = lookup_template_function (tsubst_expr (DECL_TI_TEMPLATE (decl
),
4054 tsubst (DECL_TI_ARGS (decl
),
4056 /* FIXME: The decl we create via the next tsubst could be
4057 created on a temporary obstack. */
4058 new_friend
= tsubst (decl
, args
, NULL_TREE
);
4059 tmpl
= determine_specialization (template_id
, new_friend
,
4061 /*need_member_template=*/0,
4063 new_friend
= instantiate_template (tmpl
, new_args
);
4067 new_friend
= tsubst (decl
, args
, NULL_TREE
);
4069 /* The NEW_FRIEND will look like an instantiation, to the
4070 compiler, but is not an instantiation from the point of view of
4071 the language. For example, we might have had:
4073 template <class T> struct S {
4074 template <class U> friend void f(T, U);
4077 Then, in S<int>, template <class U> void f(int, U) is not an
4078 instantiation of anything. */
4079 DECL_USE_TEMPLATE (new_friend
) = 0;
4080 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
4081 DECL_USE_TEMPLATE (DECL_TEMPLATE_RESULT (new_friend
)) = 0;
4083 /* The mangled name for the NEW_FRIEND is incorrect. The call to
4084 tsubst will have resulted in a call to
4085 set_mangled_name_for_template_decl. But, the function is not a
4086 template instantiation and should not be mangled like one.
4087 Therefore, we remangle the function name. We don't have to do
4088 this if the NEW_FRIEND is a template since
4089 set_mangled_name_for_template_decl doesn't do anything if the
4090 function declaration still uses template arguments. */
4091 if (TREE_CODE (new_friend
) != TEMPLATE_DECL
)
4093 set_mangled_name_for_decl (new_friend
);
4094 DECL_RTL (new_friend
) = 0;
4095 make_decl_rtl (new_friend
, NULL_PTR
, 1);
4098 if (DECL_NAMESPACE_SCOPE_P (new_friend
))
4101 tree new_friend_args
;
4103 if (TREE_CODE (new_friend
) == TEMPLATE_DECL
)
4104 /* This declaration is a `primary' template. */
4105 DECL_PRIMARY_TEMPLATE (new_friend
) = new_friend
;
4107 /* We must save the DECL_TI_ARGS for NEW_FRIEND here because
4108 pushdecl may call duplicate_decls which will free NEW_FRIEND
4110 new_friend_args
= DECL_TI_ARGS (new_friend
);
4111 old_decl
= pushdecl_namespace_level (new_friend
);
4113 if (old_decl
!= new_friend
)
4115 /* This new friend declaration matched an existing
4116 declaration. For example, given:
4118 template <class T> void f(T);
4119 template <class U> class C {
4120 template <class T> friend void f(T) {}
4123 the friend declaration actually provides the definition
4124 of `f', once C has been instantiated for some type. So,
4125 old_decl will be the out-of-class template declaration,
4126 while new_friend is the in-class definition.
4128 But, if `f' was called before this point, the
4129 instantiation of `f' will have DECL_TI_ARGS corresponding
4130 to `T' but not to `U', references to which might appear
4131 in the definition of `f'. Previously, the most general
4132 template for an instantiation of `f' was the out-of-class
4133 version; now it is the in-class version. Therefore, we
4134 run through all specialization of `f', adding to their
4135 DECL_TI_ARGS appropriately. In particular, they need a
4136 new set of outer arguments, corresponding to the
4137 arguments for this class instantiation.
4139 The same situation can arise with something like this:
4142 template <class T> class C {
4146 when `C<int>' is instantiated. Now, `f(int)' is defined
4149 if (TREE_CODE (old_decl
) != TEMPLATE_DECL
)
4150 /* duplicate_decls will take care of this case. */
4156 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (old_decl
);
4160 tree spec
= TREE_VALUE (t
);
4163 = add_outermost_template_args (new_friend_args
,
4164 DECL_TI_ARGS (spec
));
4166 = copy_to_permanent (DECL_TI_ARGS (spec
));
4169 /* Now, since specializations are always supposed to
4170 hang off of the most general template, we must move
4172 t
= most_general_template (old_decl
);
4175 DECL_TEMPLATE_SPECIALIZATIONS (t
)
4176 = chainon (DECL_TEMPLATE_SPECIALIZATIONS (t
),
4177 DECL_TEMPLATE_SPECIALIZATIONS (old_decl
));
4178 DECL_TEMPLATE_SPECIALIZATIONS (old_decl
) = NULL_TREE
;
4182 /* The information from NEW_FRIEND has been merged into OLD_DECL
4183 by duplicate_decls. */
4184 new_friend
= old_decl
;
4187 else if (TYPE_SIZE (DECL_CONTEXT (new_friend
)))
4189 /* Check to see that the declaration is really present, and,
4190 possibly obtain an improved declaration. */
4191 tree fn
= check_classfn (DECL_CONTEXT (new_friend
),
4200 input_filename
= file
;
4204 /* FRIEND_TMPL is a friend TEMPLATE_DECL. ARGS is the vector of
4205 template arguments, as for tsubst.
4207 Returns an appropriate tsbust'd friend type. */
4210 tsubst_friend_class (friend_tmpl
, args
)
4215 tree tmpl
= lookup_name (DECL_NAME (friend_tmpl
), 1);
4217 tmpl
= maybe_get_template_decl_from_type_decl (tmpl
);
4219 if (tmpl
!= NULL_TREE
&& DECL_CLASS_TEMPLATE_P (tmpl
))
4221 /* The friend template has already been declared. Just
4222 check to see that the declarations match, and install any new
4223 default parameters. We must tsubst the default parameters,
4224 of course. We only need the innermost template parameters
4225 because that is all that redeclare_class_template will look
4228 = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_tmpl
),
4230 redeclare_class_template (TREE_TYPE (tmpl
), parms
);
4231 friend_type
= TREE_TYPE (tmpl
);
4235 /* The friend template has not already been declared. In this
4236 case, the instantiation of the template class will cause the
4237 injection of this template into the global scope. */
4238 tmpl
= tsubst (friend_tmpl
, args
, NULL_TREE
);
4240 /* The new TMPL is not an instantiation of anything, so we
4241 forget its origins. We don't reset CLASSTYPE_TI_TEMPLATE for
4242 the new type because that is supposed to be the corresponding
4243 template decl, i.e., TMPL. */
4244 DECL_USE_TEMPLATE (tmpl
) = 0;
4245 DECL_TEMPLATE_INFO (tmpl
) = NULL_TREE
;
4246 CLASSTYPE_USE_TEMPLATE (TREE_TYPE (tmpl
)) = 0;
4248 /* Inject this template into the global scope. */
4249 friend_type
= TREE_TYPE (pushdecl_top_level (tmpl
));
4256 instantiate_class_template (type
)
4259 tree
template, args
, pattern
, t
, *field_chain
;
4262 if (type
== error_mark_node
)
4263 return error_mark_node
;
4265 if (TYPE_BEING_DEFINED (type
) || TYPE_SIZE (type
))
4268 template = most_general_template (CLASSTYPE_TI_TEMPLATE (type
));
4269 args
= CLASSTYPE_TI_ARGS (type
);
4270 my_friendly_assert (TREE_CODE (template) == TEMPLATE_DECL
, 279);
4271 t
= most_specialized_class (template, args
);
4273 if (t
== error_mark_node
)
4275 char *str
= "candidates are:";
4276 cp_error ("ambiguous class template instantiation for `%#T'", type
);
4277 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (template); t
; t
= TREE_CHAIN (t
))
4279 if (get_class_bindings (TREE_VALUE (t
), TREE_PURPOSE (t
),
4282 cp_error_at ("%s %+#T", str
, TREE_TYPE (t
));
4286 TYPE_BEING_DEFINED (type
) = 1;
4287 return error_mark_node
;
4290 pattern
= TREE_TYPE (t
);
4292 pattern
= TREE_TYPE (template);
4294 if (TYPE_SIZE (pattern
) == NULL_TREE
)
4299 /* This TYPE is actually a instantiation of of a partial
4300 specialization. We replace the innermost set of ARGS with
4301 the arguments appropriate for substitution. For example,
4304 template <class T> struct S {};
4305 template <class T> struct S<T*> {};
4307 and supposing that we are instantiating S<int*>, ARGS will
4308 present be {int*} but we need {int}. */
4310 = get_class_bindings (TREE_VALUE (t
), TREE_PURPOSE (t
),
4313 /* If there were multiple levels in ARGS, replacing the
4314 innermost level would alter CLASSTYPE_TI_ARGS, which we don't
4315 want, so we make a copy first. */
4316 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
4318 args
= copy_node (args
);
4319 SET_TMPL_ARGS_LEVEL (args
, TMPL_ARGS_DEPTH (args
), inner_args
);
4325 if (pedantic
&& uses_template_parms (args
))
4326 /* If there are still template parameters amongst the args, then
4327 we can't instantiate the type; there's no telling whether or not one
4328 of the template parameters might eventually be instantiated to some
4329 value that results in a specialization being used. */
4332 TYPE_BEING_DEFINED (type
) = 1;
4334 if (! push_tinst_level (type
))
4337 maybe_push_to_top_level (uses_template_parms (type
));
4338 pushclass (type
, 0);
4340 /* We must copy the arguments to the permanent obstack since
4341 during the tsubst'ing below they may wind up in the
4342 DECL_TI_ARGS of some instantiated member template. */
4343 args
= copy_to_permanent (args
);
4345 if (flag_external_templates
)
4347 if (flag_alt_external_templates
)
4349 CLASSTYPE_INTERFACE_ONLY (type
) = interface_only
;
4350 SET_CLASSTYPE_INTERFACE_UNKNOWN_X (type
, interface_unknown
);
4351 CLASSTYPE_VTABLE_NEEDS_WRITING (type
)
4352 = (! CLASSTYPE_INTERFACE_ONLY (type
)
4353 && CLASSTYPE_INTERFACE_KNOWN (type
));
4357 CLASSTYPE_INTERFACE_ONLY (type
) = CLASSTYPE_INTERFACE_ONLY (pattern
);
4358 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
4359 (type
, CLASSTYPE_INTERFACE_UNKNOWN (pattern
));
4360 CLASSTYPE_VTABLE_NEEDS_WRITING (type
)
4361 = (! CLASSTYPE_INTERFACE_ONLY (type
)
4362 && CLASSTYPE_INTERFACE_KNOWN (type
));
4367 SET_CLASSTYPE_INTERFACE_UNKNOWN (type
);
4368 CLASSTYPE_VTABLE_NEEDS_WRITING (type
) = 1;
4371 TYPE_HAS_CONSTRUCTOR (type
) = TYPE_HAS_CONSTRUCTOR (pattern
);
4372 TYPE_HAS_DESTRUCTOR (type
) = TYPE_HAS_DESTRUCTOR (pattern
);
4373 TYPE_HAS_ASSIGNMENT (type
) = TYPE_HAS_ASSIGNMENT (pattern
);
4374 TYPE_OVERLOADS_CALL_EXPR (type
) = TYPE_OVERLOADS_CALL_EXPR (pattern
);
4375 TYPE_OVERLOADS_ARRAY_REF (type
) = TYPE_OVERLOADS_ARRAY_REF (pattern
);
4376 TYPE_OVERLOADS_ARROW (type
) = TYPE_OVERLOADS_ARROW (pattern
);
4377 TYPE_GETS_NEW (type
) = TYPE_GETS_NEW (pattern
);
4378 TYPE_GETS_DELETE (type
) = TYPE_GETS_DELETE (pattern
);
4379 TYPE_VEC_DELETE_TAKES_SIZE (type
) = TYPE_VEC_DELETE_TAKES_SIZE (pattern
);
4380 TYPE_HAS_ASSIGN_REF (type
) = TYPE_HAS_ASSIGN_REF (pattern
);
4381 TYPE_HAS_CONST_ASSIGN_REF (type
) = TYPE_HAS_CONST_ASSIGN_REF (pattern
);
4382 TYPE_HAS_ABSTRACT_ASSIGN_REF (type
) = TYPE_HAS_ABSTRACT_ASSIGN_REF (pattern
);
4383 TYPE_HAS_INIT_REF (type
) = TYPE_HAS_INIT_REF (pattern
);
4384 TYPE_HAS_CONST_INIT_REF (type
) = TYPE_HAS_CONST_INIT_REF (pattern
);
4385 TYPE_HAS_DEFAULT_CONSTRUCTOR (type
) = TYPE_HAS_DEFAULT_CONSTRUCTOR (pattern
);
4386 TYPE_HAS_CONVERSION (type
) = TYPE_HAS_CONVERSION (pattern
);
4387 TYPE_USES_COMPLEX_INHERITANCE (type
)
4388 = TYPE_USES_COMPLEX_INHERITANCE (pattern
);
4389 TYPE_USES_MULTIPLE_INHERITANCE (type
)
4390 = TYPE_USES_MULTIPLE_INHERITANCE (pattern
);
4391 TYPE_USES_VIRTUAL_BASECLASSES (type
)
4392 = TYPE_USES_VIRTUAL_BASECLASSES (pattern
);
4393 TYPE_PACKED (type
) = TYPE_PACKED (pattern
);
4394 TYPE_ALIGN (type
) = TYPE_ALIGN (pattern
);
4395 TYPE_FOR_JAVA (type
) = TYPE_FOR_JAVA (pattern
); /* For libjava's JArray<T> */
4397 CLASSTYPE_LOCAL_TYPEDECLS (type
) = CLASSTYPE_LOCAL_TYPEDECLS (pattern
);
4399 /* If this is a partial instantiation, don't tsubst anything. We will
4400 only use this type for implicit typename, so the actual contents don't
4401 matter. All that matters is whether a particular name is a type. */
4402 if (uses_template_parms (type
))
4404 TYPE_BINFO_BASETYPES (type
) = TYPE_BINFO_BASETYPES (pattern
);
4405 TYPE_FIELDS (type
) = TYPE_FIELDS (pattern
);
4406 TYPE_METHODS (type
) = TYPE_METHODS (pattern
);
4407 CLASSTYPE_TAGS (type
) = CLASSTYPE_TAGS (pattern
);
4408 TYPE_SIZE (type
) = integer_zero_node
;
4413 tree binfo
= TYPE_BINFO (type
);
4414 tree pbases
= TYPE_BINFO_BASETYPES (pattern
);
4420 int len
= TREE_VEC_LENGTH (pbases
);
4421 bases
= make_tree_vec (len
);
4422 for (i
= 0; i
< len
; ++i
)
4426 TREE_VEC_ELT (bases
, i
) = elt
4427 = tsubst (TREE_VEC_ELT (pbases
, i
), args
, NULL_TREE
);
4428 BINFO_INHERITANCE_CHAIN (elt
) = binfo
;
4430 basetype
= TREE_TYPE (elt
);
4432 if (! IS_AGGR_TYPE (basetype
))
4434 ("base type `%T' of `%T' fails to be a struct or class type",
4436 else if (TYPE_SIZE (complete_type (basetype
)) == NULL_TREE
)
4437 cp_error ("base class `%T' of `%T' has incomplete type",
4440 /* These are set up in xref_basetypes for normal classes, so
4441 we have to handle them here for template bases. */
4443 unshare_base_binfos (elt
);
4445 if (TYPE_USES_VIRTUAL_BASECLASSES (basetype
))
4447 TYPE_USES_VIRTUAL_BASECLASSES (type
) = 1;
4448 TYPE_USES_COMPLEX_INHERITANCE (type
) = 1;
4450 TYPE_GETS_NEW (type
) |= TYPE_GETS_NEW (basetype
);
4451 TYPE_GETS_DELETE (type
) |= TYPE_GETS_DELETE (basetype
);
4452 CLASSTYPE_LOCAL_TYPEDECLS (type
)
4453 |= CLASSTYPE_LOCAL_TYPEDECLS (basetype
);
4455 /* Don't initialize this until the vector is filled out, or
4456 lookups will crash. */
4457 BINFO_BASETYPES (binfo
) = bases
;
4461 field_chain
= &TYPE_FIELDS (type
);
4463 for (t
= CLASSTYPE_TAGS (pattern
); t
; t
= TREE_CHAIN (t
))
4465 tree tag
= TREE_VALUE (t
);
4466 tree name
= TYPE_IDENTIFIER (tag
);
4469 newtag
= tsubst (tag
, args
, NULL_TREE
);
4470 if (TREE_CODE (newtag
) == ENUMERAL_TYPE
)
4472 extern tree current_local_enum
;
4473 tree prev_local_enum
= current_local_enum
;
4475 if (TYPE_VALUES (newtag
))
4479 /* We must set things up so that CURRENT_LOCAL_ENUM is the
4480 CONST_DECL for the last enumeration constant, since the
4481 CONST_DECLs are chained backwards. */
4482 for (v
= TYPE_VALUES (newtag
); TREE_CHAIN (v
);
4487 = IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (v
));
4488 *field_chain
= grok_enum_decls (NULL_TREE
);
4489 current_local_enum
= prev_local_enum
;
4491 while (*field_chain
)
4493 DECL_FIELD_CONTEXT (*field_chain
) = type
;
4494 field_chain
= &TREE_CHAIN (*field_chain
);
4500 /* Now, we call pushtag to put this NEWTAG into the scope of
4501 TYPE. We first set up the IDENTIFIER_TYPE_VALUE to avoid
4502 pushtag calling push_template_decl. We don't have to do
4503 this for enums because it will already have been done in
4506 SET_IDENTIFIER_TYPE_VALUE (name
, newtag
);
4507 pushtag (name
, newtag
, /*globalize=*/0);
4511 /* Don't replace enum constants here. */
4512 for (t
= TYPE_FIELDS (pattern
); t
; t
= TREE_CHAIN (t
))
4513 if (TREE_CODE (t
) != CONST_DECL
)
4517 /* The the file and line for this declaration, to assist in
4518 error message reporting. Since we called push_tinst_level
4519 above, we don't need to restore these. */
4520 lineno
= DECL_SOURCE_LINE (t
);
4521 input_filename
= DECL_SOURCE_FILE (t
);
4523 r
= tsubst (t
, args
, NULL_TREE
);
4524 if (TREE_CODE (r
) == VAR_DECL
)
4526 pending_statics
= perm_tree_cons (NULL_TREE
, r
, pending_statics
);
4527 /* Perhaps we should do more of grokfield here. */
4529 DECL_IN_AGGR_P (r
) = 1;
4530 DECL_EXTERNAL (r
) = 1;
4531 cp_finish_decl (r
, DECL_INITIAL (r
), NULL_TREE
, 0, 0);
4535 field_chain
= &TREE_CHAIN (r
);
4538 TYPE_METHODS (type
) = tsubst_chain (TYPE_METHODS (pattern
), args
);
4540 /* Construct the DECL_FRIENDLIST for the new class type. */
4541 typedecl
= TYPE_MAIN_DECL (type
);
4542 for (t
= DECL_FRIENDLIST (TYPE_MAIN_DECL (pattern
));
4548 DECL_FRIENDLIST (typedecl
)
4549 = tree_cons (TREE_PURPOSE (t
), NULL_TREE
,
4550 DECL_FRIENDLIST (typedecl
));
4552 for (friends
= TREE_VALUE (t
);
4553 friends
!= NULL_TREE
;
4554 friends
= TREE_CHAIN (friends
))
4556 if (TREE_PURPOSE (friends
) == error_mark_node
)
4558 TREE_VALUE (DECL_FRIENDLIST (typedecl
))
4559 = tree_cons (error_mark_node
,
4560 tsubst_friend_function (TREE_VALUE (friends
),
4562 TREE_VALUE (DECL_FRIENDLIST (typedecl
)));
4566 TREE_VALUE (DECL_FRIENDLIST (typedecl
))
4567 = tree_cons (tsubst (TREE_PURPOSE (friends
), args
, NULL_TREE
),
4569 TREE_VALUE (DECL_FRIENDLIST (typedecl
)));
4575 for (t
= CLASSTYPE_FRIEND_CLASSES (pattern
);
4579 tree friend_type
= TREE_VALUE (t
);
4580 tree new_friend_type
;
4582 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
4583 new_friend_type
= tsubst_friend_class (friend_type
, args
);
4584 else if (uses_template_parms (friend_type
))
4585 new_friend_type
= tsubst (friend_type
, args
, NULL_TREE
);
4587 /* The call to xref_tag_from_type does injection for friend
4590 xref_tag_from_type (friend_type
, NULL_TREE
, 1);
4593 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
4594 /* Trick make_friend_class into realizing that the friend
4595 we're adding is a template, not an ordinary class. It's
4596 important that we use make_friend_class since it will
4597 perform some error-checking and output cross-reference
4599 ++processing_template_decl
;
4601 make_friend_class (type
, new_friend_type
);
4603 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
4604 --processing_template_decl
;
4607 /* This does injection for friend functions. */
4608 if (!processing_template_decl
)
4610 t
= tsubst (DECL_TEMPLATE_INJECT (template), args
, NULL_TREE
);
4612 for (; t
; t
= TREE_CHAIN (t
))
4614 tree d
= TREE_VALUE (t
);
4616 if (TREE_CODE (d
) == TYPE_DECL
)
4617 /* Already injected. */;
4623 for (t
= TYPE_FIELDS (type
); t
; t
= TREE_CHAIN (t
))
4624 if (TREE_CODE (t
) == FIELD_DECL
)
4626 TREE_TYPE (t
) = complete_type (TREE_TYPE (t
));
4627 require_complete_type (t
);
4630 type
= finish_struct_1 (type
, 0);
4631 CLASSTYPE_GOT_SEMICOLON (type
) = 1;
4633 repo_template_used (type
);
4634 if (at_eof
&& TYPE_BINFO_VTABLE (type
) != NULL_TREE
)
4635 finish_prevtable_vardecl (NULL
, TYPE_BINFO_VTABLE (type
));
4638 TYPE_BEING_DEFINED (type
) = 0;
4641 pop_from_top_level ();
4651 if (t1
== NULL_TREE
)
4652 return t2
== NULL_TREE
;
4653 if (t2
== NULL_TREE
)
4655 /* Don't care if one declares its arg const and the other doesn't -- the
4656 main variant of the arg type is all that matters. */
4657 if (TYPE_MAIN_VARIANT (TREE_VALUE (t1
))
4658 != TYPE_MAIN_VARIANT (TREE_VALUE (t2
)))
4660 return list_eq (TREE_CHAIN (t1
), TREE_CHAIN (t2
));
4663 /* If arg is a non-type template parameter that does not depend on template
4664 arguments, fold it like we weren't in the body of a template. */
4667 maybe_fold_nontype_arg (arg
)
4670 if (TREE_CODE_CLASS (TREE_CODE (arg
)) != 't'
4671 && !uses_template_parms (arg
))
4673 /* Sometimes, one of the args was an expression involving a
4674 template constant parameter, like N - 1. Now that we've
4675 tsubst'd, we might have something like 2 - 1. This will
4676 confuse lookup_template_class, so we do constant folding
4677 here. We have to unset processing_template_decl, to
4678 fool build_expr_from_tree() into building an actual
4681 int saved_processing_template_decl
= processing_template_decl
;
4682 processing_template_decl
= 0;
4683 arg
= fold (build_expr_from_tree (arg
));
4684 processing_template_decl
= saved_processing_template_decl
;
4689 /* Return the TREE_VEC with the arguments for the innermost template header,
4690 where ARGS is either that or the VEC of VECs for all the
4694 innermost_args (args
)
4697 return TMPL_ARGS_LEVEL (args
, TMPL_ARGS_DEPTH (args
));
4700 /* Substitute ARGS into the vector of template arguments T. */
4703 tsubst_template_arg_vector (t
, args
)
4707 int len
= TREE_VEC_LENGTH (t
), need_new
= 0, i
;
4708 tree
*elts
= (tree
*) alloca (len
* sizeof (tree
));
4710 bzero ((char *) elts
, len
* sizeof (tree
));
4712 for (i
= 0; i
< len
; i
++)
4714 if (TREE_VEC_ELT (t
, i
) != NULL_TREE
4715 && TREE_CODE (TREE_VEC_ELT (t
, i
)) == TREE_VEC
)
4716 elts
[i
] = tsubst_template_arg_vector (TREE_VEC_ELT (t
, i
), args
);
4718 elts
[i
] = maybe_fold_nontype_arg
4719 (tsubst_expr (TREE_VEC_ELT (t
, i
), args
, NULL_TREE
));
4721 if (elts
[i
] != TREE_VEC_ELT (t
, i
))
4728 t
= make_tree_vec (len
);
4729 for (i
= 0; i
< len
; i
++)
4730 TREE_VEC_ELT (t
, i
) = elts
[i
];
4735 /* Return the result of substituting ARGS into the template parameters
4736 given by PARMS. If there are m levels of ARGS and m + n levels of
4737 PARMS, then the result will contain n levels of PARMS. For
4738 example, if PARMS is `template <class T> template <class U>
4739 template <T*, U, class V>' and ARGS is {{int}, {double}} then the
4740 result will be `template <int*, double, class V>'. */
4743 tsubst_template_parms (parms
, args
)
4748 tree
* new_parms
= &r
;
4750 for (new_parms
= &r
;
4751 TMPL_PARMS_DEPTH (parms
) > TMPL_ARGS_DEPTH (args
);
4752 new_parms
= &(TREE_CHAIN (*new_parms
)),
4753 parms
= TREE_CHAIN (parms
))
4756 make_tree_vec (TREE_VEC_LENGTH (TREE_VALUE (parms
)));
4759 for (i
= 0; i
< TREE_VEC_LENGTH (new_vec
); ++i
)
4761 tree default_value
=
4762 TREE_PURPOSE (TREE_VEC_ELT (TREE_VALUE (parms
), i
));
4764 TREE_VALUE (TREE_VEC_ELT (TREE_VALUE (parms
), i
));
4766 TREE_VEC_ELT (new_vec
, i
)
4767 = build_tree_list (tsubst (default_value
, args
, NULL_TREE
),
4768 tsubst (parm_decl
, args
, NULL_TREE
));
4773 tree_cons (build_int_2 (0, (TMPL_PARMS_DEPTH (parms
)
4774 - TMPL_ARGS_DEPTH (args
))),
4775 new_vec
, NULL_TREE
);
4781 /* Substitute the ARGS into the indicated aggregate (or enumeration)
4782 type T. If T is not an aggregate or enumeration type, it is
4783 handled as if by tsubst. IN_DECL is as for tsubst. If
4784 ENTERING_SCOPE is non-zero, T is the context for a template which
4785 we are presently tsubst'ing. Return the subsituted value. */
4788 tsubst_aggr_type (t
, args
, in_decl
, entering_scope
)
4797 switch (TREE_CODE (t
))
4800 if (TYPE_PTRMEMFUNC_P (t
))
4802 tree r
= build_ptrmemfunc_type
4803 (tsubst (TYPE_PTRMEMFUNC_FN_TYPE (t
), args
, in_decl
));
4804 return cp_build_type_variant (r
, TYPE_READONLY (t
),
4808 /* else fall through */
4811 if (uses_template_parms (t
))
4817 /* First, determine the context for the type we are looking
4819 if (TYPE_CONTEXT (t
) != NULL_TREE
)
4820 context
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
,
4821 in_decl
, /*entering_scope=*/1);
4823 context
= NULL_TREE
;
4825 /* Then, figure out what arguments are appropriate for the
4826 type we are trying to find. For example, given:
4828 template <class T> struct S;
4829 template <class T, class U> void f(T, U) { S<U> su; }
4831 and supposing that we are instantiating f<int, double>,
4832 then our ARGS will be {int, double}, but, when looking up
4833 S we only want {double}. */
4834 argvec
= tsubst (TYPE_TI_ARGS (t
), args
, in_decl
);
4836 r
= lookup_template_class (t
, argvec
, in_decl
, context
,
4839 return cp_build_type_variant (r
, TYPE_READONLY (t
),
4843 /* This is not a template type, so there's nothing to do. */
4847 return tsubst (t
, args
, in_decl
);
4851 /* Substitute the ARGS into the T, which is a _DECL. TYPE is the
4852 (already computed) substitution of ARGS into TREE_TYPE (T), if
4853 appropriate. Return the result of the substitution. IN_DECL is as
4857 tsubst_decl (t
, args
, type
, in_decl
)
4864 char* saved_filename
;
4867 /* Set the filename and linenumber to improve error-reporting. */
4868 saved_lineno
= lineno
;
4869 saved_filename
= input_filename
;
4870 lineno
= DECL_SOURCE_LINE (t
);
4871 input_filename
= DECL_SOURCE_FILE (t
);
4873 switch (TREE_CODE (t
))
4877 /* We can get here when processing a member template function
4878 of a template class. */
4879 tree decl
= DECL_TEMPLATE_RESULT (t
);
4881 int is_template_template_parm
= DECL_TEMPLATE_TEMPLATE_PARM_P (t
);
4883 if (!is_template_template_parm
)
4885 /* We might already have an instance of this template.
4886 The ARGS are for the surrounding class type, so the
4887 full args contain the tsubst'd args for the context,
4888 plus the innermost args from the template decl. */
4889 tree tmpl_args
= DECL_CLASS_TEMPLATE_P (t
)
4890 ? CLASSTYPE_TI_ARGS (TREE_TYPE (t
))
4891 : DECL_TI_ARGS (DECL_RESULT (t
));
4892 tree full_args
= tsubst (tmpl_args
, args
, in_decl
);
4894 /* tsubst_template_arg_vector doesn't copy the vector if
4895 nothing changed. But, *something* should have
4897 my_friendly_assert (full_args
!= tmpl_args
, 0);
4899 spec
= retrieve_specialization (t
, full_args
);
4900 if (spec
!= NULL_TREE
)
4907 /* Make a new template decl. It will be similar to the
4908 original, but will record the current template arguments.
4909 We also create a new function declaration, which is just
4910 like the old one, but points to this new template, rather
4911 than the old one. */
4914 my_friendly_assert (DECL_LANG_SPECIFIC (r
) != 0, 0);
4915 TREE_CHAIN (r
) = NULL_TREE
;
4917 if (is_template_template_parm
)
4919 tree new_decl
= tsubst (decl
, args
, in_decl
);
4920 DECL_RESULT (r
) = new_decl
;
4921 TREE_TYPE (r
) = TREE_TYPE (new_decl
);
4926 = tsubst_aggr_type (DECL_CONTEXT (t
), args
, in_decl
,
4927 /*entering_scope=*/1);
4928 DECL_CLASS_CONTEXT (r
)
4929 = tsubst_aggr_type (DECL_CLASS_CONTEXT (t
), args
, in_decl
,
4930 /*entering_scope=*/1);
4931 DECL_TEMPLATE_INFO (r
) = build_tree_list (t
, args
);
4933 if (TREE_CODE (decl
) == TYPE_DECL
)
4935 tree new_type
= tsubst (TREE_TYPE (t
), args
, in_decl
);
4936 TREE_TYPE (r
) = new_type
;
4937 CLASSTYPE_TI_TEMPLATE (new_type
) = r
;
4938 DECL_RESULT (r
) = TYPE_MAIN_DECL (new_type
);
4939 DECL_TI_ARGS (r
) = CLASSTYPE_TI_ARGS (new_type
);
4943 tree new_decl
= tsubst (decl
, args
, in_decl
);
4944 DECL_RESULT (r
) = new_decl
;
4945 DECL_TI_TEMPLATE (new_decl
) = r
;
4946 TREE_TYPE (r
) = TREE_TYPE (new_decl
);
4947 DECL_TI_ARGS (r
) = DECL_TI_ARGS (new_decl
);
4950 SET_DECL_IMPLICIT_INSTANTIATION (r
);
4951 DECL_TEMPLATE_INSTANTIATIONS (r
) = NULL_TREE
;
4952 DECL_TEMPLATE_SPECIALIZATIONS (r
) = NULL_TREE
;
4954 /* The template parameters for this new template are all the
4955 template parameters for the old template, except the
4956 outermost level of parameters. */
4957 DECL_TEMPLATE_PARMS (r
)
4958 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t
), args
);
4960 if (PRIMARY_TEMPLATE_P (t
))
4961 DECL_PRIMARY_TEMPLATE (r
) = r
;
4963 /* We don't partially instantiate partial specializations. */
4964 if (TREE_CODE (decl
) == TYPE_DECL
)
4967 for (spec
= DECL_TEMPLATE_SPECIALIZATIONS (t
);
4969 spec
= TREE_CHAIN (spec
))
4971 /* It helps to consider example here. Consider:
4982 Now, for example, we are instantiating S<int>::f(U u).
4983 We want to make a template:
4988 It will have a specialization, for the case U = int*, of
4992 void S<int>::f<int*>(int*);
4994 This specialization will be an instantiation of
4995 the specialization given in the declaration of S, with
4996 argument list int*. */
4998 tree fn
= TREE_VALUE (spec
);
5002 if (!DECL_TEMPLATE_SPECIALIZATION (fn
))
5003 /* Instantiations are on the same list, but they're of
5004 no concern to us. */
5007 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
5008 /* A full specialization. There's no need to record
5012 spec_args
= tsubst (DECL_TI_ARGS (fn
), args
, in_decl
);
5013 new_fn
= tsubst (DECL_RESULT (most_general_template (fn
)),
5014 spec_args
, in_decl
);
5015 DECL_TI_TEMPLATE (new_fn
) = fn
;
5016 register_specialization (new_fn
, r
,
5017 innermost_args (spec_args
));
5020 /* Record this partial instantiation. */
5021 register_specialization (r
, t
,
5022 DECL_TI_ARGS (DECL_RESULT (r
)));
5030 tree argvec
= NULL_TREE
;
5036 /* Nobody should be tsubst'ing into non-template functions. */
5037 my_friendly_assert (DECL_TEMPLATE_INFO (t
) != NULL_TREE
, 0);
5039 if (TREE_CODE (DECL_TI_TEMPLATE (t
)) == TEMPLATE_DECL
)
5043 /* Calculate the most general template of which R is a
5044 specialization, and the complete set of arguments used to
5046 gen_tmpl
= most_general_template (DECL_TI_TEMPLATE (t
));
5047 argvec
= tsubst (DECL_TI_ARGS (DECL_TEMPLATE_RESULT (gen_tmpl
)),
5050 /* Check to see if we already have this specialization. */
5051 spec
= retrieve_specialization (gen_tmpl
, argvec
);
5058 /* Here, we deal with the peculiar case:
5060 template <class T> struct S {
5061 template <class U> friend void f();
5063 template <class U> friend void f() {}
5065 template void f<double>();
5067 Here, the ARGS for the instantiation of will be {int,
5068 double}. But, we only need as many ARGS as there are
5069 levels of template parameters in CODE_PATTERN. We are
5070 careful not to get fooled into reducing the ARGS in
5073 template <class T> struct S { template <class U> void f(U); }
5074 template <class T> template <> void S<T>::f(int) {}
5076 which we can spot because the pattern will be a
5077 specialization in this case. */
5078 args_depth
= TMPL_ARGS_DEPTH (args
);
5080 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (t
)));
5081 if (args_depth
> parms_depth
5082 && !DECL_TEMPLATE_SPECIALIZATION (t
))
5084 my_friendly_assert (DECL_FRIEND_P (t
), 0);
5086 if (parms_depth
> 1)
5090 args
= make_temp_vec (parms_depth
);
5091 for (i
= 0; i
< parms_depth
; ++i
)
5092 TREE_VEC_ELT (args
, i
) =
5093 TREE_VEC_ELT (args
, i
+ (args_depth
- parms_depth
));
5096 args
= TREE_VEC_ELT (args
, args_depth
- parms_depth
);
5101 /* This special case arises when we have something like this:
5103 template <class T> struct S {
5104 friend void f<int>(int, double);
5107 Here, the DECL_TI_TEMPLATE for the friend declaration
5108 will be a LOOKUP_EXPR or an IDENTIFIER_NODE. We are
5109 being called from tsubst_friend_function, and we want
5110 only to create a new decl (R) with appropriate types so
5111 that we can call determine_specialization. */
5112 my_friendly_assert ((TREE_CODE (DECL_TI_TEMPLATE (t
))
5114 || (TREE_CODE (DECL_TI_TEMPLATE (t
))
5115 == IDENTIFIER_NODE
), 0);
5116 gen_tmpl
= NULL_TREE
;
5119 if (DECL_CLASS_SCOPE_P (t
))
5121 if (DECL_NAME (t
) == constructor_name (DECL_CONTEXT (t
)))
5125 ctx
= tsubst_aggr_type (DECL_CLASS_CONTEXT (t
), args
, t
,
5126 /*entering_scope=*/1);
5133 type
= tsubst (type
, args
, in_decl
);
5135 /* We do NOT check for matching decls pushed separately at this
5136 point, as they may not represent instantiations of this
5137 template, and in any case are considered separate under the
5138 discrete model. Instead, see add_maybe_template. */
5142 DECL_USE_TEMPLATE (r
) = 0;
5143 TREE_TYPE (r
) = type
;
5146 = tsubst_aggr_type (DECL_CONTEXT (t
), args
, t
, /*entering_scope=*/1);
5147 DECL_CLASS_CONTEXT (r
) = ctx
;
5149 if (member
&& !strncmp (OPERATOR_TYPENAME_FORMAT
,
5150 IDENTIFIER_POINTER (DECL_NAME (r
)),
5151 sizeof (OPERATOR_TYPENAME_FORMAT
) - 1))
5153 /* Type-conversion operator. Reconstruct the name, in
5154 case it's the name of one of the template's parameters. */
5155 DECL_NAME (r
) = build_typename_overload (TREE_TYPE (type
));
5158 DECL_ARGUMENTS (r
) = tsubst (DECL_ARGUMENTS (t
), args
, t
);
5159 DECL_MAIN_VARIANT (r
) = r
;
5160 DECL_RESULT (r
) = NULL_TREE
;
5161 DECL_INITIAL (r
) = NULL_TREE
;
5163 TREE_STATIC (r
) = 0;
5164 TREE_PUBLIC (r
) = TREE_PUBLIC (t
);
5165 DECL_EXTERNAL (r
) = 1;
5166 DECL_INTERFACE_KNOWN (r
) = 0;
5167 DECL_DEFER_OUTPUT (r
) = 0;
5168 TREE_CHAIN (r
) = NULL_TREE
;
5169 DECL_PENDING_INLINE_INFO (r
) = 0;
5172 if (DECL_CONSTRUCTOR_P (r
))
5174 maybe_retrofit_in_chrg (r
);
5175 grok_ctor_properties (ctx
, r
);
5177 if (IDENTIFIER_OPNAME_P (DECL_NAME (r
)))
5178 grok_op_properties (r
, DECL_VIRTUAL_P (r
), DECL_FRIEND_P (r
));
5180 /* Set up the DECL_TEMPLATE_INFO for R and compute its mangled
5181 name. There's no need to do this in the special friend
5182 case mentioned above where GEN_TMPL is NULL. */
5185 DECL_TEMPLATE_INFO (r
)
5186 = perm_tree_cons (gen_tmpl
, argvec
, NULL_TREE
);
5187 SET_DECL_IMPLICIT_INSTANTIATION (r
);
5188 register_specialization (r
, gen_tmpl
, argvec
);
5190 /* Set the mangled name for R. */
5191 if (DECL_DESTRUCTOR_P (t
))
5192 DECL_ASSEMBLER_NAME (r
) = build_destructor_name (ctx
);
5195 /* Instantiations of template functions must be mangled
5196 specially, in order to conform to 14.5.5.1
5197 [temp.over.link]. */
5198 tree tmpl
= DECL_TI_TEMPLATE (t
);
5200 /* TMPL will be NULL if this is a specialization of a
5201 member function of a template class. */
5202 if (name_mangling_version
< 1
5203 || tmpl
== NULL_TREE
5204 || (member
&& !is_member_template (tmpl
)
5205 && !DECL_TEMPLATE_INFO (tmpl
)))
5206 set_mangled_name_for_decl (r
);
5208 set_mangled_name_for_template_decl (r
);
5212 make_decl_rtl (r
, NULL_PTR
, 1);
5214 /* Like grokfndecl. If we don't do this, pushdecl will
5215 mess up our TREE_CHAIN because it doesn't find a
5216 previous decl. Sigh. */
5218 && (IDENTIFIER_GLOBAL_VALUE (DECL_ASSEMBLER_NAME (r
))
5220 SET_IDENTIFIER_GLOBAL_VALUE (DECL_ASSEMBLER_NAME (r
), r
);
5228 TREE_TYPE (r
) = type
;
5229 if (TREE_CODE (DECL_INITIAL (r
)) != TEMPLATE_PARM_INDEX
)
5230 DECL_INITIAL (r
) = TREE_TYPE (r
);
5232 DECL_INITIAL (r
) = tsubst (DECL_INITIAL (r
), args
, in_decl
);
5234 DECL_CONTEXT (r
) = NULL_TREE
;
5235 #ifdef PROMOTE_PROTOTYPES
5236 if ((TREE_CODE (type
) == INTEGER_TYPE
5237 || TREE_CODE (type
) == ENUMERAL_TYPE
)
5238 && TYPE_PRECISION (type
) < TYPE_PRECISION (integer_type_node
))
5239 DECL_ARG_TYPE (r
) = integer_type_node
;
5242 TREE_CHAIN (r
) = tsubst (TREE_CHAIN (t
), args
, TREE_CHAIN (t
));
5249 TREE_TYPE (r
) = type
;
5252 DECL_FIELD_CONTEXT (r
) = tsubst (DECL_FIELD_CONTEXT (t
), args
, in_decl
);
5254 DECL_INITIAL (r
) = tsubst_expr (DECL_INITIAL (t
), args
, in_decl
);
5255 TREE_CHAIN (r
) = NULL_TREE
;
5256 if (TREE_CODE (type
) == VOID_TYPE
)
5257 cp_error_at ("instantiation of `%D' as type void", r
);
5265 = tsubst_copy (DECL_INITIAL (t
), args
, in_decl
);
5266 TREE_CHAIN (r
) = NULL_TREE
;
5276 tree ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
, in_decl
,
5277 /*entering_scope=*/1);
5279 /* Nobody should be tsubst'ing into non-template variables. */
5280 my_friendly_assert (DECL_LANG_SPECIFIC (t
)
5281 && DECL_TEMPLATE_INFO (t
) != NULL_TREE
, 0);
5283 /* Check to see if we already have this specialization. */
5284 tmpl
= DECL_TI_TEMPLATE (t
);
5285 gen_tmpl
= most_general_template (tmpl
);
5286 argvec
= tsubst (DECL_TI_ARGS (t
), args
, in_decl
);
5287 spec
= retrieve_specialization (gen_tmpl
, argvec
);
5296 TREE_TYPE (r
) = type
;
5297 DECL_CONTEXT (r
) = ctx
;
5298 if (TREE_STATIC (r
))
5299 DECL_ASSEMBLER_NAME (r
)
5300 = build_static_name (DECL_CONTEXT (r
), DECL_NAME (r
));
5302 /* Don't try to expand the initializer until someone tries to use
5303 this variable; otherwise we run into circular dependencies. */
5304 DECL_INITIAL (r
) = NULL_TREE
;
5308 DECL_CLASS_CONTEXT (r
) = DECL_CONTEXT (r
);
5310 DECL_TEMPLATE_INFO (r
) = perm_tree_cons (tmpl
, argvec
, NULL_TREE
);
5311 SET_DECL_IMPLICIT_INSTANTIATION (r
);
5312 register_specialization (r
, gen_tmpl
, argvec
);
5314 TREE_CHAIN (r
) = NULL_TREE
;
5315 if (TREE_CODE (type
) == VOID_TYPE
)
5316 cp_error_at ("instantiation of `%D' as type void", r
);
5321 if (t
== TYPE_NAME (TREE_TYPE (t
)))
5322 r
= TYPE_NAME (type
);
5326 TREE_TYPE (r
) = type
;
5327 DECL_CONTEXT (r
) = current_class_type
;
5328 TREE_CHAIN (r
) = NULL_TREE
;
5333 my_friendly_abort (0);
5336 /* Restore the file and line information. */
5337 lineno
= saved_lineno
;
5338 input_filename
= saved_filename
;
5343 /* Substitue into the ARG_TYPES of a function type. */
5346 tsubst_arg_types (arg_types
, args
, in_decl
)
5351 tree remaining_arg_types
;
5354 if (!arg_types
|| arg_types
== void_list_node
)
5357 remaining_arg_types
= tsubst_arg_types (TREE_CHAIN (arg_types
),
5360 /* We use TYPE_MAIN_VARIANT is because top-level qualifiers don't
5361 matter on function types. */
5362 type
= TYPE_MAIN_VARIANT (type_decays_to
5363 (tsubst (TREE_VALUE (arg_types
),
5366 /* Note that we do not substitute into default arguments here. The
5367 standard mandates that they be instantiated only when needed,
5368 which is done in build_over_call. */
5369 return hash_tree_cons_simple (TREE_PURPOSE (arg_types
), type
,
5370 remaining_arg_types
);
5374 /* Take the tree structure T and replace template parameters used therein
5375 with the argument vector ARGS. IN_DECL is an associated decl for
5378 tsubst is used for dealing with types, decls and the like; for
5379 expressions, use tsubst_expr or tsubst_copy. */
5382 tsubst (t
, args
, in_decl
)
5388 if (t
== NULL_TREE
|| t
== error_mark_node
5389 || t
== integer_type_node
5390 || t
== void_type_node
5391 || t
== char_type_node
5392 || TREE_CODE (t
) == NAMESPACE_DECL
)
5395 if (TREE_CODE (t
) == IDENTIFIER_NODE
)
5396 type
= IDENTIFIER_TYPE_VALUE (t
);
5398 type
= TREE_TYPE (t
);
5399 if (type
== unknown_type_node
)
5400 my_friendly_abort (42);
5402 if (type
&& TREE_CODE (t
) != FUNCTION_DECL
5403 && TREE_CODE (t
) != TYPENAME_TYPE
5404 && TREE_CODE (t
) != TEMPLATE_DECL
5405 && TREE_CODE (t
) != IDENTIFIER_NODE
)
5406 type
= tsubst (type
, args
, in_decl
);
5408 if (TREE_CODE_CLASS (TREE_CODE (t
)) == 'd')
5409 return tsubst_decl (t
, args
, type
, in_decl
);
5411 switch (TREE_CODE (t
))
5416 return tsubst_aggr_type (t
, args
, in_decl
, /*entering_scope=*/0);
5419 case IDENTIFIER_NODE
:
5431 if (t
== integer_type_node
)
5434 if (TREE_CODE (TYPE_MIN_VALUE (t
)) == INTEGER_CST
5435 && TREE_CODE (TYPE_MAX_VALUE (t
)) == INTEGER_CST
)
5439 tree max
= TREE_OPERAND (TYPE_MAX_VALUE (t
), 0);
5440 max
= tsubst_expr (max
, args
, in_decl
);
5441 if (processing_template_decl
)
5443 tree itype
= make_node (INTEGER_TYPE
);
5444 TYPE_MIN_VALUE (itype
) = size_zero_node
;
5445 TYPE_MAX_VALUE (itype
) = build_min (MINUS_EXPR
, sizetype
, max
,
5450 max
= fold (build_binary_op (MINUS_EXPR
, max
, integer_one_node
, 1));
5451 return build_index_2_type (size_zero_node
, max
);
5454 case TEMPLATE_TYPE_PARM
:
5455 case TEMPLATE_TEMPLATE_PARM
:
5456 case TEMPLATE_PARM_INDEX
:
5463 if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
5464 || TREE_CODE (t
) == TEMPLATE_TEMPLATE_PARM
)
5466 idx
= TEMPLATE_TYPE_IDX (t
);
5467 level
= TEMPLATE_TYPE_LEVEL (t
);
5471 idx
= TEMPLATE_PARM_IDX (t
);
5472 level
= TEMPLATE_PARM_LEVEL (t
);
5475 if (TREE_VEC_LENGTH (args
) > 0)
5477 tree arg
= NULL_TREE
;
5479 levels
= TMPL_ARGS_DEPTH (args
);
5480 if (level
<= levels
)
5481 arg
= TMPL_ARG (args
, level
, idx
);
5483 if (arg
== error_mark_node
)
5484 return error_mark_node
;
5485 else if (arg
!= NULL_TREE
)
5487 if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
5489 my_friendly_assert (TREE_CODE_CLASS (TREE_CODE (arg
))
5491 return cp_build_type_variant
5492 (arg
, TYPE_READONLY (arg
) || TYPE_READONLY (t
),
5493 TYPE_VOLATILE (arg
) || TYPE_VOLATILE (t
));
5495 else if (TREE_CODE (t
) == TEMPLATE_TEMPLATE_PARM
)
5497 if (CLASSTYPE_TEMPLATE_INFO (t
))
5499 /* We are processing a type constructed from
5500 a template template parameter */
5501 tree argvec
= tsubst (CLASSTYPE_TI_ARGS (t
),
5505 /* We can get a TEMPLATE_TEMPLATE_PARM here when
5506 we are resolving nested-types in the signature of
5507 a member function templates.
5508 Otherwise ARG is a TEMPLATE_DECL and is the real
5509 template to be instantiated. */
5510 if (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
5511 arg
= TYPE_NAME (arg
);
5513 r
= lookup_template_class (DECL_NAME (arg
),
5516 /*entering_scope=*/0);
5517 return cp_build_type_variant (r
, TYPE_READONLY (t
),
5521 /* We are processing a template argument list. */
5530 /* This can happen during the attempted tsubst'ing in
5531 unify. This means that we don't yet have any information
5532 about the template parameter in question. */
5535 /* If we get here, we must have been looking at a parm for a
5536 more deeply nested template. Make a new version of this
5537 template parameter, but with a lower level. */
5538 switch (TREE_CODE (t
))
5540 case TEMPLATE_TYPE_PARM
:
5541 case TEMPLATE_TEMPLATE_PARM
:
5543 TEMPLATE_TYPE_PARM_INDEX (r
)
5544 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (t
),
5546 TYPE_STUB_DECL (r
) = TYPE_NAME (r
) = TEMPLATE_TYPE_DECL (r
);
5547 TYPE_MAIN_VARIANT (r
) = r
;
5548 TYPE_POINTER_TO (r
) = NULL_TREE
;
5549 TYPE_REFERENCE_TO (r
) = NULL_TREE
;
5551 if (TREE_CODE (t
) == TEMPLATE_TEMPLATE_PARM
5552 && CLASSTYPE_TEMPLATE_INFO (t
))
5554 tree argvec
= tsubst (CLASSTYPE_TI_ARGS (t
), args
, in_decl
);
5555 CLASSTYPE_TEMPLATE_INFO (r
)
5556 = perm_tree_cons (TYPE_NAME (t
), argvec
, NULL_TREE
);
5560 case TEMPLATE_PARM_INDEX
:
5561 r
= reduce_template_parm_level (t
, type
, levels
);
5565 my_friendly_abort (0);
5573 tree purpose
, value
, chain
, result
;
5574 int via_public
, via_virtual
, via_protected
;
5576 if (t
== void_list_node
)
5579 via_public
= TREE_VIA_PUBLIC (t
);
5580 via_protected
= TREE_VIA_PROTECTED (t
);
5581 via_virtual
= TREE_VIA_VIRTUAL (t
);
5583 purpose
= TREE_PURPOSE (t
);
5585 purpose
= tsubst (purpose
, args
, in_decl
);
5586 value
= TREE_VALUE (t
);
5588 value
= tsubst (value
, args
, in_decl
);
5589 chain
= TREE_CHAIN (t
);
5590 if (chain
&& chain
!= void_type_node
)
5591 chain
= tsubst (chain
, args
, in_decl
);
5592 if (purpose
== TREE_PURPOSE (t
)
5593 && value
== TREE_VALUE (t
)
5594 && chain
== TREE_CHAIN (t
))
5596 result
= hash_tree_cons (via_public
, via_virtual
, via_protected
,
5597 purpose
, value
, chain
);
5598 TREE_PARMLIST (result
) = TREE_PARMLIST (t
);
5602 if (type
!= NULL_TREE
)
5604 /* A binfo node. We always need to make a copy, of the node
5605 itself and of its BINFO_BASETYPES. */
5609 /* Make sure type isn't a typedef copy. */
5610 type
= BINFO_TYPE (TYPE_BINFO (type
));
5612 TREE_TYPE (t
) = complete_type (type
);
5613 if (IS_AGGR_TYPE (type
))
5615 BINFO_VTABLE (t
) = TYPE_BINFO_VTABLE (type
);
5616 BINFO_VIRTUALS (t
) = TYPE_BINFO_VIRTUALS (type
);
5617 if (TYPE_BINFO_BASETYPES (type
) != NULL_TREE
)
5618 BINFO_BASETYPES (t
) = copy_node (TYPE_BINFO_BASETYPES (type
));
5623 /* Otherwise, a vector of template arguments. */
5624 return tsubst_template_arg_vector (t
, args
);
5627 case REFERENCE_TYPE
:
5630 enum tree_code code
;
5632 if (type
== TREE_TYPE (t
))
5635 code
= TREE_CODE (t
);
5636 if (TREE_CODE (type
) == REFERENCE_TYPE
)
5638 static int last_line
= 0;
5639 static char* last_file
= 0;
5641 /* We keep track of the last time we issued this error
5642 message to avoid spewing a ton of messages during a
5643 single bad template instantiation. */
5644 if (last_line
!= lineno
||
5645 last_file
!= input_filename
)
5647 cp_error ("cannot form type %s to reference type %T during template instantiation",
5648 (code
== POINTER_TYPE
) ? "pointer" : "reference",
5651 last_file
= input_filename
;
5654 /* Use the underlying type in an attempt at error
5655 recovery; maybe the user meant vector<int> and wrote
5656 vector<int&>, or some such. */
5657 if (code
== REFERENCE_TYPE
)
5660 r
= build_pointer_type (TREE_TYPE (type
));
5662 else if (code
== POINTER_TYPE
)
5663 r
= build_pointer_type (type
);
5665 r
= build_reference_type (type
);
5666 r
= cp_build_type_variant (r
, TYPE_READONLY (t
), TYPE_VOLATILE (t
));
5668 /* Will this ever be needed for TYPE_..._TO values? */
5673 return build_offset_type
5674 (tsubst (TYPE_OFFSET_BASETYPE (t
), args
, in_decl
), type
);
5682 /* The TYPE_CONTEXT is not used for function/method types. */
5683 my_friendly_assert (TYPE_CONTEXT (t
) == NULL_TREE
, 0);
5685 /* Substitue the argument types. */
5686 arg_types
= tsubst_arg_types (TYPE_ARG_TYPES (t
), args
, in_decl
);
5688 /* Construct a new type node and return it. */
5689 if (TREE_CODE (t
) == FUNCTION_TYPE
)
5690 fntype
= build_function_type (type
, arg_types
);
5693 = build_cplus_method_type (TREE_TYPE (TREE_VALUE (arg_types
)),
5695 TREE_CHAIN (arg_types
));
5697 fntype
= build_type_variant (fntype
,
5701 /* Substitue the exception specification. */
5702 raises
= TYPE_RAISES_EXCEPTIONS (t
);
5705 raises
= tsubst (raises
, args
, in_decl
);
5706 fntype
= build_exception_variant (fntype
, raises
);
5712 tree domain
= tsubst (TYPE_DOMAIN (t
), args
, in_decl
);
5714 if (type
== TREE_TYPE (t
) && domain
== TYPE_DOMAIN (t
))
5716 r
= build_cplus_array_type (type
, domain
);
5722 return fold (build (TREE_CODE (t
), TREE_TYPE (t
),
5723 tsubst (TREE_OPERAND (t
, 0), args
, in_decl
),
5724 tsubst (TREE_OPERAND (t
, 1), args
, in_decl
)));
5728 return fold (build1 (TREE_CODE (t
), TREE_TYPE (t
),
5729 tsubst (TREE_OPERAND (t
, 0), args
, in_decl
)));
5733 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, in_decl
,
5734 /*entering_scope=*/1);
5735 tree f
= tsubst_copy (TYPENAME_TYPE_FULLNAME (t
), args
, in_decl
);
5737 /* Normally, make_typename_type does not require that the CTX
5738 have complete type in order to allow things like:
5740 template <class T> struct S { typename S<T>::X Y; };
5742 But, such constructs have already been resolved by this
5743 point, so here CTX really should have complete type, unless
5744 it's a partial instantiation. */
5745 if (!uses_template_parms (ctx
)
5746 && !complete_type_or_else (ctx
))
5747 return error_mark_node
;
5749 f
= make_typename_type (ctx
, f
);
5750 return cp_build_type_variant
5751 (f
, TYPE_READONLY (f
) || TYPE_READONLY (t
),
5752 TYPE_VOLATILE (f
) || TYPE_VOLATILE (t
));
5756 return make_pointer_declarator
5757 (type
, tsubst (TREE_OPERAND (t
, 0), args
, in_decl
));
5760 return make_reference_declarator
5761 (type
, tsubst (TREE_OPERAND (t
, 0), args
, in_decl
));
5764 return build_parse_node
5765 (ARRAY_REF
, tsubst (TREE_OPERAND (t
, 0), args
, in_decl
),
5766 tsubst_expr (TREE_OPERAND (t
, 1), args
, in_decl
));
5769 return make_call_declarator
5770 (tsubst (TREE_OPERAND (t
, 0), args
, in_decl
),
5771 tsubst (TREE_OPERAND (t
, 1), args
, in_decl
),
5772 TREE_OPERAND (t
, 2),
5773 tsubst (TREE_TYPE (t
), args
, in_decl
));
5776 return build_parse_node
5777 (TREE_CODE (t
), tsubst (TREE_OPERAND (t
, 0), args
, in_decl
),
5778 tsubst (TREE_OPERAND (t
, 1), args
, in_decl
));
5781 sorry ("use of `%s' in template",
5782 tree_code_name
[(int) TREE_CODE (t
)]);
5783 return error_mark_node
;
5790 emit_line_note (input_filename
, lineno
);
5794 expand_start_bindings (0);
5801 int saved_warn_unused
= 0;
5803 if (processing_template_decl
)
5805 saved_warn_unused
= warn_unused
;
5808 expand_end_bindings (getdecls (), kept_level_p (), 0);
5809 if (processing_template_decl
)
5810 warn_unused
= saved_warn_unused
;
5811 t
= poplevel (kept_level_p (), 1, 0);
5816 /* Like tsubst, but deals with expressions. This function just replaces
5817 template parms; to finish processing the resultant expression, use
5821 tsubst_copy (t
, args
, in_decl
)
5825 enum tree_code code
;
5827 if (t
== NULL_TREE
|| t
== error_mark_node
)
5830 code
= TREE_CODE (t
);
5835 return do_identifier (DECL_NAME (t
), 0, NULL_TREE
);
5842 if (!DECL_CONTEXT (t
))
5843 /* This is a global enumeration constant. */
5846 /* Unfortunately, we cannot just call lookup_name here.
5849 template <int I> int f() {
5851 struct S { void g() { E e = a; } };
5854 When we instantiate f<7>::S::g(), say, lookup_name is not
5855 clever enough to find f<7>::a. */
5857 = tsubst_aggr_type (TREE_TYPE (t
), args
, in_decl
,
5858 /*entering_scope=*/0);
5860 for (v
= TYPE_VALUES (enum_type
);
5863 if (TREE_PURPOSE (v
) == DECL_NAME (t
))
5864 return TREE_VALUE (v
);
5866 /* We didn't find the name. That should never happen; if
5867 name-lookup found it during preliminary parsing, we
5868 should find it again here during instantiation. */
5869 my_friendly_abort (0);
5874 if (DECL_CONTEXT (t
))
5878 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
, in_decl
,
5879 /*entering_scope=*/1);
5880 if (ctx
!= DECL_CONTEXT (t
))
5881 return lookup_field (ctx
, DECL_NAME (t
), 0, 0);
5887 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
))
5888 t
= tsubst (t
, args
, in_decl
);
5893 if (is_member_template (t
))
5894 return tsubst (t
, args
, in_decl
);
5900 /* We must tsbust into a LOOKUP_EXPR in case the names to
5901 which it refers is a conversion operator; in that case the
5902 name will change. We avoid making unnecessary copies,
5905 tree id
= tsubst_copy (TREE_OPERAND (t
, 0), args
, in_decl
);
5907 if (id
!= TREE_OPERAND (t
, 0))
5909 tree r
= build_nt (LOOKUP_EXPR
, id
);
5910 LOOKUP_EXPR_GLOBAL (r
) = LOOKUP_EXPR_GLOBAL (t
);
5918 case REINTERPRET_CAST_EXPR
:
5919 case CONST_CAST_EXPR
:
5920 case STATIC_CAST_EXPR
:
5921 case DYNAMIC_CAST_EXPR
:
5923 (code
, tsubst (TREE_TYPE (t
), args
, in_decl
),
5924 tsubst_copy (TREE_OPERAND (t
, 0), args
, in_decl
));
5927 case PREDECREMENT_EXPR
:
5928 case PREINCREMENT_EXPR
:
5929 case POSTDECREMENT_EXPR
:
5930 case POSTINCREMENT_EXPR
:
5932 case TRUTH_NOT_EXPR
:
5935 case CONVERT_EXPR
: /* Unary + */
5943 tsubst_copy (TREE_OPERAND (t
, 0), args
, in_decl
));
5948 case TRUNC_DIV_EXPR
:
5950 case FLOOR_DIV_EXPR
:
5951 case ROUND_DIV_EXPR
:
5952 case EXACT_DIV_EXPR
:
5954 case BIT_ANDTC_EXPR
:
5957 case TRUNC_MOD_EXPR
:
5958 case FLOOR_MOD_EXPR
:
5959 case TRUTH_ANDIF_EXPR
:
5960 case TRUTH_ORIF_EXPR
:
5961 case TRUTH_AND_EXPR
:
5982 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, in_decl
),
5983 tsubst_copy (TREE_OPERAND (t
, 1), args
, in_decl
));
5987 tree fn
= TREE_OPERAND (t
, 0);
5988 if (is_overloaded_fn (fn
))
5989 fn
= tsubst_copy (get_first_fn (fn
), args
, in_decl
);
5991 /* Sometimes FN is a LOOKUP_EXPR. */
5992 fn
= tsubst_copy (fn
, args
, in_decl
);
5994 (code
, fn
, tsubst_copy (TREE_OPERAND (t
, 1), args
, in_decl
),
5998 case METHOD_CALL_EXPR
:
6000 tree name
= TREE_OPERAND (t
, 0);
6001 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
6003 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
, in_decl
);
6004 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
6006 else if (TREE_CODE (name
) == SCOPE_REF
6007 && TREE_CODE (TREE_OPERAND (name
, 1)) == BIT_NOT_EXPR
)
6009 tree base
= tsubst_copy (TREE_OPERAND (name
, 0), args
, in_decl
);
6010 name
= TREE_OPERAND (name
, 1);
6011 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
, in_decl
);
6012 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
6013 name
= build_nt (SCOPE_REF
, base
, name
);
6016 name
= tsubst_copy (TREE_OPERAND (t
, 0), args
, in_decl
);
6018 (code
, name
, tsubst_copy (TREE_OPERAND (t
, 1), args
, in_decl
),
6019 tsubst_copy (TREE_OPERAND (t
, 2), args
, in_decl
),
6028 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, in_decl
),
6029 tsubst_copy (TREE_OPERAND (t
, 1), args
, in_decl
),
6030 tsubst_copy (TREE_OPERAND (t
, 2), args
, in_decl
));
6032 if (code
== BIND_EXPR
&& !processing_template_decl
)
6034 /* This processing should really occur in tsubst_expr,
6035 However, tsubst_expr does not recurse into expressions,
6036 since it assumes that there aren't any statements
6037 inside them. Instead, it simply calls
6038 build_expr_from_tree. So, we need to expand the
6040 tree rtl_expr
= begin_stmt_expr ();
6041 tree block
= tsubst_expr (TREE_OPERAND (r
, 1), args
, in_decl
);
6042 r
= finish_stmt_expr (rtl_expr
, block
);
6051 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, in_decl
),
6052 tsubst_copy (TREE_OPERAND (t
, 1), args
, in_decl
),
6053 tsubst_copy (TREE_OPERAND (t
, 2), args
, in_decl
));
6054 NEW_EXPR_USE_GLOBAL (r
) = NEW_EXPR_USE_GLOBAL (t
);
6061 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, in_decl
),
6062 tsubst_copy (TREE_OPERAND (t
, 1), args
, in_decl
));
6063 DELETE_EXPR_USE_GLOBAL (r
) = DELETE_EXPR_USE_GLOBAL (t
);
6064 DELETE_EXPR_USE_VEC (r
) = DELETE_EXPR_USE_VEC (t
);
6068 case TEMPLATE_ID_EXPR
:
6070 /* Substituted template arguments */
6071 tree targs
= tsubst_copy (TREE_OPERAND (t
, 1), args
, in_decl
);
6073 for (chain
= targs
; chain
; chain
= TREE_CHAIN (chain
))
6074 TREE_VALUE (chain
) = maybe_fold_nontype_arg (TREE_VALUE (chain
));
6076 return lookup_template_function
6077 (tsubst_copy (TREE_OPERAND (t
, 0), args
, in_decl
), targs
);
6082 tree purpose
, value
, chain
;
6084 if (t
== void_list_node
)
6087 purpose
= TREE_PURPOSE (t
);
6089 purpose
= tsubst_copy (purpose
, args
, in_decl
);
6090 value
= TREE_VALUE (t
);
6092 value
= tsubst_copy (value
, args
, in_decl
);
6093 chain
= TREE_CHAIN (t
);
6094 if (chain
&& chain
!= void_type_node
)
6095 chain
= tsubst_copy (chain
, args
, in_decl
);
6096 if (purpose
== TREE_PURPOSE (t
)
6097 && value
== TREE_VALUE (t
)
6098 && chain
== TREE_CHAIN (t
))
6100 return tree_cons (purpose
, value
, chain
);
6107 case TEMPLATE_TYPE_PARM
:
6108 case TEMPLATE_TEMPLATE_PARM
:
6109 case TEMPLATE_PARM_INDEX
:
6111 case REFERENCE_TYPE
:
6118 return tsubst (t
, args
, in_decl
);
6120 case IDENTIFIER_NODE
:
6121 if (IDENTIFIER_TYPENAME_P (t
)
6122 /* Make sure it's not just a variable named `__opr', for instance,
6123 which can occur in some existing code. */
6125 return build_typename_overload
6126 (tsubst (TREE_TYPE (t
), args
, in_decl
));
6132 (CONSTRUCTOR
, tsubst (TREE_TYPE (t
), args
, in_decl
), NULL_TREE
,
6133 tsubst_copy (CONSTRUCTOR_ELTS (t
), args
, in_decl
));
6140 /* Like tsubst_copy, but also does semantic processing and RTL expansion. */
6143 tsubst_expr (t
, args
, in_decl
)
6147 if (t
== NULL_TREE
|| t
== error_mark_node
)
6150 if (processing_template_decl
)
6151 return tsubst_copy (t
, args
, in_decl
);
6153 switch (TREE_CODE (t
))
6156 lineno
= TREE_COMPLEXITY (t
);
6157 finish_return_stmt (tsubst_expr (RETURN_EXPR (t
),
6162 lineno
= TREE_COMPLEXITY (t
);
6163 finish_expr_stmt (tsubst_expr (EXPR_STMT_EXPR (t
),
6169 int i
= suspend_momentary ();
6172 lineno
= TREE_COMPLEXITY (t
);
6173 emit_line_note (input_filename
, lineno
);
6175 (tsubst (TREE_OPERAND (t
, 0), args
, in_decl
),
6176 tsubst (TREE_OPERAND (t
, 1), args
, in_decl
),
6177 TREE_OPERAND (t
, 2) != 0, NULL_TREE
, NULL_TREE
);
6178 init
= tsubst_expr (TREE_OPERAND (t
, 2), args
, in_decl
);
6180 (dcl
, init
, NULL_TREE
, 1, /*init ? LOOKUP_ONLYCONVERTING :*/ 0);
6181 resume_momentary (i
);
6188 lineno
= TREE_COMPLEXITY (t
);
6191 for (tmp
= FOR_INIT_STMT (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
6192 tsubst_expr (tmp
, args
, in_decl
);
6193 finish_for_init_stmt (NULL_TREE
);
6194 finish_for_cond (tsubst_expr (FOR_COND (t
), args
,
6197 tmp
= tsubst_expr (FOR_EXPR (t
), args
, in_decl
);
6198 finish_for_expr (tmp
, NULL_TREE
);
6199 tsubst_expr (FOR_BODY (t
), args
, in_decl
);
6200 finish_for_stmt (tmp
, NULL_TREE
);
6206 lineno
= TREE_COMPLEXITY (t
);
6207 begin_while_stmt ();
6208 finish_while_stmt_cond (tsubst_expr (WHILE_COND (t
),
6211 tsubst_expr (WHILE_BODY (t
), args
, in_decl
);
6212 finish_while_stmt (NULL_TREE
);
6218 lineno
= TREE_COMPLEXITY (t
);
6220 tsubst_expr (DO_BODY (t
), args
, in_decl
);
6221 finish_do_body (NULL_TREE
);
6222 finish_do_stmt (tsubst_expr (DO_COND (t
), args
,
6232 lineno
= TREE_COMPLEXITY (t
);
6234 finish_if_stmt_cond (tsubst_expr (IF_COND (t
),
6238 if (tmp
= THEN_CLAUSE (t
), tmp
)
6240 tsubst_expr (tmp
, args
, in_decl
);
6241 finish_then_clause (NULL_TREE
);
6244 if (tmp
= ELSE_CLAUSE (t
), tmp
)
6246 begin_else_clause ();
6247 tsubst_expr (tmp
, args
, in_decl
);
6248 finish_else_clause (NULL_TREE
);
6259 lineno
= TREE_COMPLEXITY (t
);
6260 begin_compound_stmt (COMPOUND_STMT_NO_SCOPE (t
));
6261 for (substmt
= COMPOUND_BODY (t
);
6262 substmt
!= NULL_TREE
;
6263 substmt
= TREE_CHAIN (substmt
))
6264 tsubst_expr (substmt
, args
, in_decl
);
6265 return finish_compound_stmt (COMPOUND_STMT_NO_SCOPE (t
),
6271 lineno
= TREE_COMPLEXITY (t
);
6272 finish_break_stmt ();
6276 lineno
= TREE_COMPLEXITY (t
);
6277 finish_continue_stmt ();
6284 lineno
= TREE_COMPLEXITY (t
);
6285 begin_switch_stmt ();
6286 val
= tsubst_expr (SWITCH_COND (t
), args
, in_decl
);
6287 finish_switch_cond (val
);
6289 if (tmp
= TREE_OPERAND (t
, 1), tmp
)
6290 tsubst_expr (tmp
, args
, in_decl
);
6292 finish_switch_stmt (val
, NULL_TREE
);
6297 finish_case_label (tsubst_expr (CASE_LOW (t
), args
, in_decl
),
6298 tsubst_expr (CASE_HIGH (t
), args
, in_decl
));
6302 t
= define_label (DECL_SOURCE_FILE (t
), DECL_SOURCE_LINE (t
),
6309 lineno
= TREE_COMPLEXITY (t
);
6310 t
= GOTO_DESTINATION (t
);
6311 if (TREE_CODE (t
) != IDENTIFIER_NODE
)
6312 /* Computed goto's must be tsubst'd into. On the other hand,
6313 non-computed gotos must not be; the identifier in question
6314 will have no binding. */
6315 t
= tsubst_expr (t
, args
, in_decl
);
6316 finish_goto_stmt (t
);
6320 lineno
= TREE_COMPLEXITY (t
);
6321 finish_asm_stmt (tsubst_expr (ASM_CV_QUAL (t
), args
, in_decl
),
6322 tsubst_expr (ASM_STRING (t
), args
, in_decl
),
6323 tsubst_expr (ASM_OUTPUTS (t
), args
, in_decl
),
6324 tsubst_expr (ASM_INPUTS (t
), args
, in_decl
),
6325 tsubst_expr (ASM_CLOBBERS (t
), args
, in_decl
));
6329 lineno
= TREE_COMPLEXITY (t
);
6331 tsubst_expr (TRY_STMTS (t
), args
, in_decl
);
6332 finish_try_block (NULL_TREE
);
6334 tree handler
= TRY_HANDLERS (t
);
6335 for (; handler
; handler
= TREE_CHAIN (handler
))
6336 tsubst_expr (handler
, args
, in_decl
);
6338 finish_handler_sequence (NULL_TREE
);
6342 lineno
= TREE_COMPLEXITY (t
);
6344 if (HANDLER_PARMS (t
))
6346 tree d
= HANDLER_PARMS (t
);
6347 expand_start_catch_block
6348 (tsubst (TREE_OPERAND (d
, 1), args
, in_decl
),
6349 tsubst (TREE_OPERAND (d
, 0), args
, in_decl
));
6352 expand_start_catch_block (NULL_TREE
, NULL_TREE
);
6353 finish_handler_parms (NULL_TREE
);
6354 tsubst_expr (HANDLER_BODY (t
), args
, in_decl
);
6355 finish_handler (NULL_TREE
);
6359 lineno
= TREE_COMPLEXITY (t
);
6361 if (TREE_CODE (t
) == ENUMERAL_TYPE
)
6362 tsubst (t
, args
, NULL_TREE
);
6366 return build_expr_from_tree (tsubst_copy (t
, args
, in_decl
));
6371 /* Instantiate the indicated variable of function template TMPL with
6372 the template arguments in TARG_PTR. */
6375 instantiate_template (tmpl
, targ_ptr
)
6376 tree tmpl
, targ_ptr
;
6382 struct obstack
*old_fmp_obstack
;
6383 extern struct obstack
*function_maybepermanent_obstack
;
6386 if (tmpl
== error_mark_node
)
6387 return error_mark_node
;
6389 my_friendly_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
, 283);
6391 /* Check to see if we already have this specialization. */
6392 spec
= retrieve_specialization (tmpl
, targ_ptr
);
6393 if (spec
!= NULL_TREE
)
6396 if (DECL_TEMPLATE_INFO (tmpl
))
6398 /* The TMPL is a partial instantiation. To get a full set of
6399 arguments we must add the arguments used to perform the
6400 partial instantiation. */
6401 targ_ptr
= add_outermost_template_args (DECL_TI_ARGS (tmpl
),
6403 gen_tmpl
= most_general_template (tmpl
);
6405 /* Check to see if we already have this specialization. */
6406 spec
= retrieve_specialization (gen_tmpl
, targ_ptr
);
6407 if (spec
!= NULL_TREE
)
6413 push_obstacks (&permanent_obstack
, &permanent_obstack
);
6414 old_fmp_obstack
= function_maybepermanent_obstack
;
6415 function_maybepermanent_obstack
= &permanent_obstack
;
6417 len
= DECL_NTPARMS (gen_tmpl
);
6418 inner_args
= innermost_args (targ_ptr
);
6422 tree t
= TREE_VEC_ELT (inner_args
, i
);
6423 if (TREE_CODE_CLASS (TREE_CODE (t
)) == 't')
6425 tree nt
= target_type (t
);
6426 if (IS_AGGR_TYPE (nt
) && decl_function_context (TYPE_MAIN_DECL (nt
)))
6428 cp_error ("type `%T' composed from a local class is not a valid template-argument", t
);
6429 cp_error (" trying to instantiate `%D'", gen_tmpl
);
6430 fndecl
= error_mark_node
;
6435 targ_ptr
= copy_to_permanent (targ_ptr
);
6437 /* substitute template parameters */
6438 fndecl
= tsubst (DECL_RESULT (gen_tmpl
), targ_ptr
, gen_tmpl
);
6439 /* The DECL_TI_TEMPLATE should always be the immediate parent
6440 template, not the most general template. */
6441 DECL_TI_TEMPLATE (fndecl
) = tmpl
;
6443 if (flag_external_templates
)
6444 add_pending_template (fndecl
);
6447 function_maybepermanent_obstack
= old_fmp_obstack
;
6453 /* Push the name of the class template into the scope of the instantiation. */
6456 overload_template_name (type
)
6459 tree id
= DECL_NAME (CLASSTYPE_TI_TEMPLATE (type
));
6462 if (IDENTIFIER_CLASS_VALUE (id
)
6463 && TREE_TYPE (IDENTIFIER_CLASS_VALUE (id
)) == type
)
6466 decl
= build_decl (TYPE_DECL
, id
, type
);
6467 SET_DECL_ARTIFICIAL (decl
);
6468 pushdecl_class_level (decl
);
6471 /* Like type_unification but designed specially to handle conversion
6474 The FN is a TEMPLATE_DECL for a function. The ARGS are the
6475 arguments that are being used when calling it.
6477 If FN is a conversion operator, RETURN_TYPE is the type desired as
6478 the result of the conversion operator.
6480 The EXTRA_FN_ARG, if any, is the type of an additional
6481 parameter to be added to the beginning of FN's parameter list.
6483 The other arguments are as for type_unification. */
6486 fn_type_unification (fn
, explicit_targs
, targs
, args
, return_type
,
6487 strict
, extra_fn_arg
)
6488 tree fn
, explicit_targs
, targs
, args
, return_type
;
6489 unification_kind_t strict
;
6494 my_friendly_assert (TREE_CODE (fn
) == TEMPLATE_DECL
, 0);
6496 parms
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
6498 if (IDENTIFIER_TYPENAME_P (DECL_NAME (fn
)))
6500 /* This is a template conversion operator. Use the return types
6501 as well as the argument types. */
6502 parms
= scratch_tree_cons (NULL_TREE
,
6503 TREE_TYPE (TREE_TYPE (fn
)),
6505 args
= scratch_tree_cons (NULL_TREE
, return_type
, args
);
6508 if (extra_fn_arg
!= NULL_TREE
)
6509 parms
= scratch_tree_cons (NULL_TREE
, extra_fn_arg
, parms
);
6511 /* We allow incomplete unification without an error message here
6512 because the standard doesn't seem to explicitly prohibit it. Our
6513 callers must be ready to deal with unification failures in any
6515 return type_unification (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
6524 /* Type unification.
6526 We have a function template signature with one or more references to
6527 template parameters, and a parameter list we wish to fit to this
6528 template. If possible, produce a list of parameters for the template
6529 which will cause it to fit the supplied parameter list.
6531 Return zero for success, 2 for an incomplete match that doesn't resolve
6532 all the types, and 1 for complete failure. An error message will be
6533 printed only for an incomplete match.
6535 TPARMS[NTPARMS] is an array of template parameter types.
6537 TARGS[NTPARMS] is the array into which the deduced template
6538 parameter values are placed. PARMS is the function template's
6539 signature (using TEMPLATE_PARM_IDX nodes), and ARGS is the argument
6540 list we're trying to match against it.
6542 The EXPLICIT_TARGS are explicit template arguments provided via a
6545 The parameter STRICT is one of:
6548 We are deducing arguments for a function call, as in
6552 We are deducing arguments for a conversion function, as in
6556 We are deducing arguments when calculating the partial
6557 ordering between specializations of function or class
6558 templates, as in [temp.func.order] and [temp.class.order],
6559 when doing an explicit instantiation as in [temp.explicit],
6560 when determining an explicit specialization as in
6561 [temp.expl.spec], or when taking the address of a function
6562 template, as in [temp.deduct.funcaddr]. */
6565 type_unification (tparms
, targs
, parms
, args
, explicit_targs
,
6566 strict
, allow_incomplete
)
6567 tree tparms
, targs
, parms
, args
, explicit_targs
;
6568 unification_kind_t strict
;
6569 int allow_incomplete
;
6574 for (i
= 0; i
< TREE_VEC_LENGTH (tparms
); i
++)
6575 TREE_VEC_ELT (targs
, i
) = NULL_TREE
;
6577 if (explicit_targs
!= NULL_TREE
)
6580 arg_vec
= coerce_template_parms (tparms
, explicit_targs
, NULL_TREE
, 0,
6583 if (arg_vec
== error_mark_node
)
6586 explicit_mask
= alloca (sizeof (int) * TREE_VEC_LENGTH (targs
));
6587 bzero ((char *) explicit_mask
, sizeof(int) * TREE_VEC_LENGTH (targs
));
6590 i
< TREE_VEC_LENGTH (arg_vec
)
6591 && TREE_VEC_ELT (arg_vec
, i
) != NULL_TREE
;
6594 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (arg_vec
, i
);
6595 /* Let unify know that this argument was explicit. */
6596 explicit_mask
[i
] = 1;
6603 type_unification_real (tparms
, targs
, parms
, args
, 0,
6604 strict
, allow_incomplete
, explicit_mask
);
6607 /* Adjust types before performing type deduction, as described in
6608 [temp.deduct.call] and [temp.deduct.conv]. The rules in these two
6609 sections are symmetric. PARM is the type of a function parameter
6610 or the return type of the conversion function. ARG is the type of
6611 the argument passed to the call, or the type of the value
6612 intialized with the result of the conversion function. */
6615 maybe_adjust_types_for_deduction (strict
, parm
, arg
)
6616 unification_kind_t strict
;
6627 /* Swap PARM and ARG throughout the remainder of this
6628 function; the handling is precisely symmetric since PARM
6629 will initialize ARG rather than vice versa. */
6637 /* There is nothing to do in this case. */
6641 my_friendly_abort (0);
6644 if (TREE_CODE (*parm
) != REFERENCE_TYPE
)
6646 /* [temp.deduct.call]
6648 If P is not a reference type:
6650 --If A is an array type, the pointer type produced by the
6651 array-to-pointer standard conversion (_conv.array_) is
6652 used in place of A for type deduction; otherwise,
6654 --If A is a function type, the pointer type produced by
6655 the function-to-pointer standard conversion
6656 (_conv.func_) is used in place of A for type deduction;
6659 --If A is a cv-qualified type, the top level
6660 cv-qualifiers of A's type are ignored for type
6662 if (TREE_CODE (*arg
) == ARRAY_TYPE
)
6663 *arg
= build_pointer_type (TREE_TYPE (*arg
));
6664 else if (TREE_CODE (*arg
) == FUNCTION_TYPE
6665 || TREE_CODE (*arg
) == METHOD_TYPE
)
6666 *arg
= build_pointer_type (*arg
);
6668 *arg
= TYPE_MAIN_VARIANT (*arg
);
6671 /* [temp.deduct.call]
6673 If P is a cv-qualified type, the top level cv-qualifiers
6674 of P's type are ignored for type deduction. If P is a
6675 reference type, the type referred to by P is used for
6677 *parm
= TYPE_MAIN_VARIANT (*parm
);
6678 if (TREE_CODE (*parm
) == REFERENCE_TYPE
)
6679 *parm
= TREE_TYPE (*parm
);
6682 /* Like type_unfication. EXPLICIT_MASK, if non-NULL, is an array of
6683 integers, with ones in positions corresponding to arguments in
6684 targs that were provided explicitly, and zeros elsewhere.
6686 If SUBR is 1, we're being called recursively (to unify the
6687 arguments of a function or method parameter of a function
6691 type_unification_real (tparms
, targs
, parms
, args
, subr
,
6692 strict
, allow_incomplete
, explicit_mask
)
6693 tree tparms
, targs
, parms
, args
;
6695 unification_kind_t strict
;
6696 int allow_incomplete
;
6701 int ntparms
= TREE_VEC_LENGTH (tparms
);
6704 my_friendly_assert (TREE_CODE (tparms
) == TREE_VEC
, 289);
6705 my_friendly_assert (parms
== NULL_TREE
6706 || TREE_CODE (parms
) == TREE_LIST
, 290);
6707 /* ARGS could be NULL (via a call from parse.y to
6708 build_x_function_call). */
6710 my_friendly_assert (TREE_CODE (args
) == TREE_LIST
, 291);
6711 my_friendly_assert (ntparms
> 0, 292);
6716 sub_strict
= UNIFY_ALLOW_MORE_CV_QUAL
| UNIFY_ALLOW_DERIVED
;
6720 sub_strict
= UNIFY_ALLOW_LESS_CV_QUAL
;
6724 sub_strict
= UNIFY_ALLOW_NONE
;
6728 my_friendly_abort (0);
6732 && parms
!= void_list_node
6734 && args
!= void_list_node
)
6736 parm
= TREE_VALUE (parms
);
6737 parms
= TREE_CHAIN (parms
);
6738 arg
= TREE_VALUE (args
);
6739 args
= TREE_CHAIN (args
);
6741 if (arg
== error_mark_node
)
6743 if (arg
== unknown_type_node
)
6746 /* Conversions will be performed on a function argument that
6747 corresponds with a function parameter that contains only
6748 non-deducible template parameters and explicitly specified
6749 template parameters. */
6750 if (! uses_template_parms (parm
))
6754 if (TREE_CODE_CLASS (TREE_CODE (arg
)) != 't')
6755 type
= TREE_TYPE (arg
);
6762 if (strict
== DEDUCE_EXACT
)
6764 if (comptypes (parm
, type
, 1))
6768 /* It might work; we shouldn't check now, because we might
6769 get into infinite recursion. Overload resolution will
6777 if (TREE_CODE (arg
) == VAR_DECL
)
6778 arg
= TREE_TYPE (arg
);
6779 else if (TREE_CODE_CLASS (TREE_CODE (arg
)) == 'e')
6780 arg
= TREE_TYPE (arg
);
6782 if (TREE_CODE_CLASS (TREE_CODE (arg
)) != 't')
6784 my_friendly_assert (TREE_TYPE (arg
) != NULL_TREE
, 293);
6785 if (TREE_CODE (arg
) == OVERLOAD
6786 && TREE_CODE (OVL_FUNCTION (arg
)) == TEMPLATE_DECL
)
6791 /* Have to back unify here */
6792 arg
= OVL_FUNCTION (arg
);
6793 targs
= make_scratch_vec (DECL_NTPARMS (arg
));
6794 arg_type
= TREE_TYPE (arg
);
6795 maybe_adjust_types_for_deduction (strict
, &parm
, &arg_type
);
6796 parm
= expr_tree_cons (NULL_TREE
, parm
, NULL_TREE
);
6797 arg_type
= scratch_tree_cons (NULL_TREE
, arg_type
, NULL_TREE
);
6799 type_unification (DECL_INNERMOST_TEMPLATE_PARMS (arg
),
6800 targs
, arg_type
, parm
, NULL_TREE
,
6801 DEDUCE_EXACT
, allow_incomplete
);
6803 arg
= TREE_TYPE (arg
);
6807 maybe_adjust_types_for_deduction (strict
, &parm
, &arg
);
6809 switch (unify (tparms
, targs
, parm
, arg
, sub_strict
,
6818 /* Fail if we've reached the end of the parm list, and more args
6819 are present, and the parm list isn't variadic. */
6820 if (args
&& args
!= void_list_node
&& parms
== void_list_node
)
6822 /* Fail if parms are left and they don't have default values. */
6824 && parms
!= void_list_node
6825 && TREE_PURPOSE (parms
) == NULL_TREE
)
6828 for (i
= 0; i
< ntparms
; i
++)
6829 if (TREE_VEC_ELT (targs
, i
) == NULL_TREE
)
6831 if (!allow_incomplete
)
6832 error ("incomplete type unification");
6838 /* Returns the level of DECL, which declares a template parameter. */
6841 template_decl_level (decl
)
6844 switch (TREE_CODE (decl
))
6848 return TEMPLATE_TYPE_LEVEL (TREE_TYPE (decl
));
6851 return TEMPLATE_PARM_LEVEL (DECL_INITIAL (decl
));
6854 my_friendly_abort (0);
6859 /* Decide whether ARG can be unified with PARM, considering only the
6860 cv-qualifiers of each type, given STRICT as documented for unify.
6861 Returns non-zero iff the unification is OK on that basis.*/
6864 check_cv_quals_for_unify (strict
, arg
, parm
)
6869 return !((!(strict
& UNIFY_ALLOW_MORE_CV_QUAL
)
6870 && (TYPE_READONLY (arg
) < TYPE_READONLY (parm
)
6871 || TYPE_VOLATILE (arg
) < TYPE_VOLATILE (parm
)))
6872 || (!(strict
& UNIFY_ALLOW_LESS_CV_QUAL
)
6873 && (TYPE_READONLY (arg
) > TYPE_READONLY (parm
)
6874 || TYPE_VOLATILE (arg
) > TYPE_VOLATILE (parm
))));
6877 /* Takes parameters as for type_unification. Returns 0 if the
6878 type deduction suceeds, 1 otherwise. The parameter STRICT is a
6879 bitwise or of the following flags:
6882 Require an exact match between PARM and ARG.
6883 UNIFY_ALLOW_MORE_CV_QUAL:
6884 Allow the deduced ARG to be more cv-qualified than ARG.
6885 UNIFY_ALLOW_LESS_CV_QUAL:
6886 Allow the deduced ARG to be less cv-qualified than ARG.
6887 UNIFY_ALLOW_DERIVED:
6888 Allow the deduced ARG to be a template base class of ARG,
6889 or a pointer to a template base class of the type pointed to by
6893 unify (tparms
, targs
, parm
, arg
, strict
, explicit_mask
)
6894 tree tparms
, targs
, parm
, arg
;
6902 /* I don't think this will do the right thing with respect to types.
6903 But the only case I've seen it in so far has been array bounds, where
6904 signedness is the only information lost, and I think that will be
6906 while (TREE_CODE (parm
) == NOP_EXPR
)
6907 parm
= TREE_OPERAND (parm
, 0);
6909 if (arg
== error_mark_node
)
6911 if (arg
== unknown_type_node
)
6913 /* If PARM uses template parameters, then we can't bail out here,
6914 even in ARG == PARM, since we won't record unifications for the
6915 template parameters. We might need them if we're trying to
6916 figure out which of two things is more specialized. */
6917 if (arg
== parm
&& !uses_template_parms (parm
))
6920 /* Immediately reject some pairs that won't unify because of
6921 cv-qualification mismatches. */
6922 if (TREE_CODE (arg
) == TREE_CODE (parm
)
6923 && TREE_CODE_CLASS (TREE_CODE (arg
)) == 't'
6924 /* We check the cv-qualifiers when unifying with template type
6925 parameters below. We want to allow ARG `const T' to unify with
6926 PARM `T' for example, when computing which of two templates
6927 is more specialized, for example. */
6928 && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
6929 && !check_cv_quals_for_unify (strict
, arg
, parm
))
6932 switch (TREE_CODE (parm
))
6935 /* In a type which contains a nested-name-specifier, template
6936 argument values cannot be deduced for template parameters used
6937 within the nested-name-specifier. */
6940 case TEMPLATE_TYPE_PARM
:
6941 case TEMPLATE_TEMPLATE_PARM
:
6942 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
6944 if (TEMPLATE_TYPE_LEVEL (parm
)
6945 != template_decl_level (tparm
))
6946 /* The PARM is not one we're trying to unify. Just check
6947 to see if it matches ARG. */
6948 return (TREE_CODE (arg
) == TREE_CODE (parm
)
6949 && comptypes (parm
, arg
, 1)) ? 0 : 1;
6950 idx
= TEMPLATE_TYPE_IDX (parm
);
6951 targ
= TREE_VEC_ELT (targs
, idx
);
6952 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, idx
));
6954 /* Check for mixed types and values. */
6955 if ((TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
6956 && TREE_CODE (tparm
) != TYPE_DECL
)
6957 || (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
6958 && TREE_CODE (tparm
) != TEMPLATE_DECL
))
6961 if (!strict
&& targ
!= NULL_TREE
6962 && explicit_mask
&& explicit_mask
[idx
])
6963 /* An explicit template argument. Don't even try to match
6964 here; the overload resolution code will manage check to
6965 see whether the call is legal. */
6968 if (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
)
6970 if (CLASSTYPE_TEMPLATE_INFO (parm
))
6972 /* We arrive here when PARM does not involve template
6975 /* ARG must be constructed from a template class. */
6976 if (TREE_CODE (arg
) != RECORD_TYPE
|| !CLASSTYPE_TEMPLATE_INFO (arg
))
6980 tree parmtmpl
= CLASSTYPE_TI_TEMPLATE (parm
);
6981 tree parmvec
= CLASSTYPE_TI_ARGS (parm
);
6982 tree argvec
= CLASSTYPE_TI_ARGS (arg
);
6984 = DECL_INNERMOST_TEMPLATE_PARMS (CLASSTYPE_TI_TEMPLATE (arg
));
6987 /* The parameter and argument roles have to be switched here
6988 in order to handle default arguments properly. For example,
6989 template<template <class> class TT> void f(TT<int>)
6990 should be able to accept vector<int> which comes from
6991 template <class T, class Allocator = allocator>
6994 if (coerce_template_parms (argtmplvec
, parmvec
, parmtmpl
, 1, 1)
6998 /* Deduce arguments T, i from TT<T> or TT<i>. */
6999 for (i
= 0; i
< TREE_VEC_LENGTH (parmvec
); ++i
)
7001 tree t
= TREE_VEC_ELT (parmvec
, i
);
7002 if (TREE_CODE (t
) != TEMPLATE_TYPE_PARM
7003 && TREE_CODE (t
) != TEMPLATE_TEMPLATE_PARM
7004 && TREE_CODE (t
) != TEMPLATE_PARM_INDEX
)
7007 /* This argument can be deduced. */
7009 if (unify (tparms
, targs
, t
,
7010 TREE_VEC_ELT (argvec
, i
),
7011 UNIFY_ALLOW_NONE
, explicit_mask
))
7015 arg
= CLASSTYPE_TI_TEMPLATE (arg
);
7020 /* If PARM is `const T' and ARG is only `int', we don't have
7021 a match unless we are allowing additional qualification.
7022 If ARG is `const int' and PARM is just `T' that's OK;
7023 that binds `const int' to `T'. */
7024 if (!check_cv_quals_for_unify (strict
| UNIFY_ALLOW_LESS_CV_QUAL
,
7028 /* Consider the case where ARG is `const volatile int' and
7029 PARM is `const T'. Then, T should be `volatile int'. */
7031 cp_build_type_variant (arg
,
7032 TYPE_READONLY (arg
) > TYPE_READONLY (parm
),
7033 TYPE_VOLATILE (arg
) > TYPE_VOLATILE (parm
));
7036 /* Simple cases: Value already set, does match or doesn't. */
7037 if (targ
!= NULL_TREE
7038 && (comptypes (targ
, arg
, 1)
7039 || (explicit_mask
&& explicit_mask
[idx
])))
7043 TREE_VEC_ELT (targs
, idx
) = arg
;
7046 case TEMPLATE_PARM_INDEX
:
7047 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
7049 if (TEMPLATE_PARM_LEVEL (parm
)
7050 != template_decl_level (tparm
))
7051 /* The PARM is not one we're trying to unify. Just check
7052 to see if it matches ARG. */
7053 return (TREE_CODE (arg
) == TREE_CODE (parm
)
7054 && cp_tree_equal (parm
, arg
) > 0) ? 0 : 1;
7056 idx
= TEMPLATE_PARM_IDX (parm
);
7057 targ
= TREE_VEC_ELT (targs
, idx
);
7061 int i
= (cp_tree_equal (targ
, arg
) > 0);
7067 my_friendly_abort (42);
7070 TREE_VEC_ELT (targs
, idx
) = copy_to_permanent (arg
);
7077 if (TREE_CODE (arg
) == RECORD_TYPE
&& TYPE_PTRMEMFUNC_FLAG (arg
))
7078 return (unify (tparms
, targs
, parm
,
7079 TYPE_PTRMEMFUNC_FN_TYPE (arg
), strict
,
7082 if (TREE_CODE (arg
) != POINTER_TYPE
)
7085 /* [temp.deduct.call]
7087 A can be another pointer or pointer to member type that can
7088 be converted to the deduced A via a qualification
7089 conversion (_conv.qual_).
7091 We pass down STRICT here rather than UNIFY_ALLOW_NONE.
7092 This will allow for additional cv-qualification of the
7093 pointed-to types if appropriate. In general, this is a bit
7094 too generous; we are only supposed to allow qualification
7095 conversions and this method will allow an ARG of char** and
7096 a deduced ARG of const char**. However, overload
7097 resolution will subsequently invalidate the candidate, so
7098 this is probably OK. */
7099 sub_strict
= strict
;
7101 if (TREE_CODE (TREE_TYPE (arg
)) != RECORD_TYPE
7102 || TYPE_PTRMEMFUNC_FLAG (TREE_TYPE (arg
)))
7103 /* The derived-to-base conversion only persists through one
7104 level of pointers. */
7105 sub_strict
&= ~UNIFY_ALLOW_DERIVED
;
7107 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE
7108 (arg
), sub_strict
, explicit_mask
);
7111 case REFERENCE_TYPE
:
7112 if (TREE_CODE (arg
) != REFERENCE_TYPE
)
7114 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
7115 UNIFY_ALLOW_NONE
, explicit_mask
);
7118 if (TREE_CODE (arg
) != ARRAY_TYPE
)
7120 if ((TYPE_DOMAIN (parm
) == NULL_TREE
)
7121 != (TYPE_DOMAIN (arg
) == NULL_TREE
))
7123 if (TYPE_DOMAIN (parm
) != NULL_TREE
7124 && unify (tparms
, targs
, TYPE_DOMAIN (parm
),
7125 TYPE_DOMAIN (arg
), UNIFY_ALLOW_NONE
, explicit_mask
) != 0)
7127 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
7128 UNIFY_ALLOW_NONE
, explicit_mask
);
7135 if (TREE_CODE (arg
) != TREE_CODE (parm
))
7138 if (TREE_CODE (parm
) == INTEGER_TYPE
7139 && TREE_CODE (TYPE_MAX_VALUE (parm
)) != INTEGER_CST
)
7141 if (TYPE_MIN_VALUE (parm
) && TYPE_MIN_VALUE (arg
)
7142 && unify (tparms
, targs
, TYPE_MIN_VALUE (parm
),
7143 TYPE_MIN_VALUE (arg
), UNIFY_ALLOW_NONE
, explicit_mask
))
7145 if (TYPE_MAX_VALUE (parm
) && TYPE_MAX_VALUE (arg
)
7146 && unify (tparms
, targs
, TYPE_MAX_VALUE (parm
),
7147 TYPE_MAX_VALUE (arg
), UNIFY_ALLOW_NONE
, explicit_mask
))
7150 /* We use the TYPE_MAIN_VARIANT since we have already
7151 checked cv-qualification at the top of the
7153 else if (!comptypes (TYPE_MAIN_VARIANT (arg
),
7154 TYPE_MAIN_VARIANT (parm
), 1))
7157 /* As far as unification is concerned, this wins. Later checks
7158 will invalidate it if necessary. */
7161 /* Types INTEGER_CST and MINUS_EXPR can come from array bounds. */
7162 /* Type INTEGER_CST can come from ordinary constant template args. */
7164 while (TREE_CODE (arg
) == NOP_EXPR
)
7165 arg
= TREE_OPERAND (arg
, 0);
7167 if (TREE_CODE (arg
) != INTEGER_CST
)
7169 return !tree_int_cst_equal (parm
, arg
);
7174 if (TREE_CODE (arg
) != TREE_VEC
)
7176 if (TREE_VEC_LENGTH (parm
) != TREE_VEC_LENGTH (arg
))
7178 for (i
= TREE_VEC_LENGTH (parm
) - 1; i
>= 0; i
--)
7179 if (unify (tparms
, targs
,
7180 TREE_VEC_ELT (parm
, i
), TREE_VEC_ELT (arg
, i
),
7181 UNIFY_ALLOW_NONE
, explicit_mask
))
7187 if (TYPE_PTRMEMFUNC_FLAG (parm
))
7188 return unify (tparms
, targs
, TYPE_PTRMEMFUNC_FN_TYPE (parm
),
7189 arg
, strict
, explicit_mask
);
7191 if (TREE_CODE (arg
) != RECORD_TYPE
)
7194 if (CLASSTYPE_TEMPLATE_INFO (parm
) && uses_template_parms (parm
))
7197 if (strict
& UNIFY_ALLOW_DERIVED
)
7198 /* [temp.deduct.call]
7200 If P is a class, and P has the form template-id, then A
7201 can be a derived class of the deduced A. Likewise, if
7202 P is a pointer to a class of the form template-id, A
7203 can be a pointer to a derived class pointed to by the
7205 t
= get_template_base (CLASSTYPE_TI_TEMPLATE (parm
), arg
);
7207 (CLASSTYPE_TEMPLATE_INFO (arg
)
7208 && CLASSTYPE_TI_TEMPLATE (parm
) == CLASSTYPE_TI_TEMPLATE (arg
))
7210 if (! t
|| t
== error_mark_node
)
7213 return unify (tparms
, targs
, CLASSTYPE_TI_ARGS (parm
),
7214 CLASSTYPE_TI_ARGS (t
), UNIFY_ALLOW_NONE
,
7217 else if (!comptypes (TYPE_MAIN_VARIANT (parm
),
7218 TYPE_MAIN_VARIANT (arg
), 1))
7224 if (TREE_CODE (arg
) != TREE_CODE (parm
))
7227 if (unify (tparms
, targs
, TREE_TYPE (parm
),
7228 TREE_TYPE (arg
), UNIFY_ALLOW_NONE
, explicit_mask
))
7230 return type_unification_real (tparms
, targs
, TYPE_ARG_TYPES (parm
),
7231 TYPE_ARG_TYPES (arg
), 1,
7232 DEDUCE_EXACT
, 0, explicit_mask
);
7235 if (TREE_CODE (arg
) != OFFSET_TYPE
)
7237 if (unify (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
7238 TYPE_OFFSET_BASETYPE (arg
), UNIFY_ALLOW_NONE
, explicit_mask
))
7240 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
7241 UNIFY_ALLOW_NONE
, explicit_mask
);
7244 if (arg
!= decl_constant_value (parm
))
7249 /* Matched cases are handled by the ARG == PARM test above. */
7253 if (TREE_CODE (TREE_OPERAND (parm
, 1)) == INTEGER_CST
)
7255 /* We handle this case specially, since it comes up with
7256 arrays. In particular, something like:
7258 template <int N> void f(int (&x)[N]);
7260 Here, we are trying to unify the range type, which
7261 looks like [0 ... (N - 1)]. */
7263 t1
= TREE_OPERAND (parm
, 0);
7264 t2
= TREE_OPERAND (parm
, 1);
7266 /* Should this be a regular fold? */
7267 t
= maybe_fold_nontype_arg (build (PLUS_EXPR
,
7271 return unify (tparms
, targs
, t1
, t
, UNIFY_ALLOW_NONE
,
7274 /* else fall through */
7277 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (parm
))))
7279 /* We're looking at an expression. This can happen with
7283 void foo(S<I>, S<I + 2>);
7285 If the call looked like:
7287 foo(S<2>(), S<4>());
7289 we would have already matched `I' with `2'. Now, we'd
7290 like to know if `4' matches `I + 2'. So, we substitute
7291 into that expression, and fold constants, in the hope of
7294 maybe_fold_nontype_arg (tsubst_expr (parm
, targs
, NULL_TREE
));
7295 tree a
= maybe_fold_nontype_arg (arg
);
7297 if (!IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (t
))))
7298 /* Good, we mangaged to simplify the exression. */
7299 return unify (tparms
, targs
, t
, a
, UNIFY_ALLOW_NONE
,
7302 /* Bad, we couldn't simplify this. Assume it doesn't
7307 sorry ("use of `%s' in template type unification",
7308 tree_code_name
[(int) TREE_CODE (parm
)]);
7314 /* Called if RESULT is explicitly instantiated, or is a member of an
7315 explicitly instantiated class, or if using -frepo and the
7316 instantiation of RESULT has been assigned to this file. */
7319 mark_decl_instantiated (result
, extern_p
)
7323 if (TREE_CODE (result
) != FUNCTION_DECL
)
7324 /* The TREE_PUBLIC flag for function declarations will have been
7325 set correctly by tsubst. */
7326 TREE_PUBLIC (result
) = 1;
7330 DECL_INTERFACE_KNOWN (result
) = 1;
7331 DECL_NOT_REALLY_EXTERN (result
) = 1;
7333 /* Always make artificials weak. */
7334 if (DECL_ARTIFICIAL (result
) && flag_weak
)
7335 comdat_linkage (result
);
7336 /* For WIN32 we also want to put explicit instantiations in
7337 linkonce sections. */
7338 else if (TREE_PUBLIC (result
))
7339 maybe_make_one_only (result
);
7341 else if (TREE_CODE (result
) == FUNCTION_DECL
)
7342 mark_inline_for_output (result
);
7345 /* Given two function templates PAT1 and PAT2, and explicit template
7346 arguments EXPLICIT_ARGS return:
7348 1 if PAT1 is more specialized than PAT2 as described in [temp.func.order].
7349 -1 if PAT2 is more specialized than PAT1.
7350 0 if neither is more specialized. */
7353 more_specialized (pat1
, pat2
, explicit_args
)
7354 tree pat1
, pat2
, explicit_args
;
7359 targs
= get_bindings_overload (pat1
, pat2
, explicit_args
);
7363 targs
= get_bindings_overload (pat2
, pat1
, explicit_args
);
7370 /* Given two class template specialization list nodes PAT1 and PAT2, return:
7372 1 if PAT1 is more specialized than PAT2 as described in [temp.class.order].
7373 -1 if PAT2 is more specialized than PAT1.
7374 0 if neither is more specialized. */
7377 more_specialized_class (pat1
, pat2
)
7383 targs
= get_class_bindings (TREE_VALUE (pat1
), TREE_PURPOSE (pat1
),
7384 TREE_PURPOSE (pat2
));
7388 targs
= get_class_bindings (TREE_VALUE (pat2
), TREE_PURPOSE (pat2
),
7389 TREE_PURPOSE (pat1
));
7396 /* Return the template arguments that will produce the function signature
7397 DECL from the function template FN, with the explicit template
7398 arguments EXPLICIT_ARGS. If CHECK_RETTYPE is 1, the return type must
7402 get_bindings_real (fn
, decl
, explicit_args
, check_rettype
)
7403 tree fn
, decl
, explicit_args
;
7406 int ntparms
= DECL_NTPARMS (fn
);
7407 tree targs
= make_scratch_vec (ntparms
);
7408 tree decl_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
7409 tree extra_fn_arg
= NULL_TREE
;
7412 if (DECL_STATIC_FUNCTION_P (fn
)
7413 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
7415 /* Sometimes we are trying to figure out what's being
7416 specialized by a declaration that looks like a method, and it
7417 turns out to be a static member function. */
7418 if (CLASSTYPE_TEMPLATE_INFO (DECL_REAL_CONTEXT (fn
))
7419 && !is_member_template (fn
))
7420 /* The natural thing to do here seems to be to remove the
7421 spurious `this' parameter from the DECL, but that prevents
7422 unification from making use of the class type. So,
7423 instead, we have fn_type_unification add to the parameters
7425 extra_fn_arg
= build_pointer_type (DECL_REAL_CONTEXT (fn
));
7427 /* In this case, though, adding the extra_fn_arg can confuse
7428 things, so we remove from decl_arg_types instead. */
7429 decl_arg_types
= TREE_CHAIN (decl_arg_types
);
7432 i
= fn_type_unification (fn
, explicit_args
, targs
,
7434 TREE_TYPE (TREE_TYPE (decl
)),
7443 /* Check to see that the resulting return type is also OK. */
7444 tree t
= tsubst (TREE_TYPE (TREE_TYPE (fn
)), targs
,
7447 if (!comptypes (t
, TREE_TYPE (TREE_TYPE (decl
)), 1))
7454 /* For most uses, we want to check the return type. */
7457 get_bindings (fn
, decl
, explicit_args
)
7458 tree fn
, decl
, explicit_args
;
7460 return get_bindings_real (fn
, decl
, explicit_args
, 1);
7463 /* But for more_specialized, we only care about the parameter types. */
7466 get_bindings_overload (fn
, decl
, explicit_args
)
7467 tree fn
, decl
, explicit_args
;
7469 return get_bindings_real (fn
, decl
, explicit_args
, 0);
7472 /* Return the innermost template arguments that, when applied to a
7473 template specialization whose innermost template parameters are
7474 TPARMS, and whose specialization arguments are ARGS, yield the
7477 For example, suppose we have:
7479 template <class T, class U> struct S {};
7480 template <class T> struct S<T*, int> {};
7482 Then, suppose we want to get `S<double*, int>'. The TPARMS will be
7483 {T}, the PARMS will be {T*, int} and the ARGS will be {double*,
7484 int}. The resulting vector will be {double}, indicating that `T'
7485 is bound to `double'. */
7488 get_class_bindings (tparms
, parms
, args
)
7489 tree tparms
, parms
, args
;
7491 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
7492 tree vec
= make_temp_vec (ntparms
);
7494 args
= innermost_args (args
);
7496 for (i
= 0; i
< TREE_VEC_LENGTH (parms
); ++i
)
7498 switch (unify (tparms
, vec
,
7499 TREE_VEC_ELT (parms
, i
), TREE_VEC_ELT (args
, i
),
7500 UNIFY_ALLOW_NONE
, 0))
7509 for (i
= 0; i
< ntparms
; ++i
)
7510 if (! TREE_VEC_ELT (vec
, i
))
7516 /* Return the most specialized of the list of templates in FNS that can
7517 produce an instantiation matching DECL, given the explicit template
7518 arguments EXPLICIT_ARGS. */
7521 most_specialized (fns
, decl
, explicit_args
)
7522 tree fns
, decl
, explicit_args
;
7524 tree candidates
= NULL_TREE
;
7525 tree fn
, champ
, args
;
7528 for (fn
= fns
; fn
; fn
= TREE_CHAIN (fn
))
7530 tree candidate
= TREE_VALUE (fn
);
7532 args
= get_bindings (candidate
, decl
, explicit_args
);
7534 candidates
= scratch_tree_cons (NULL_TREE
, candidate
,
7541 champ
= TREE_VALUE (candidates
);
7542 for (fn
= TREE_CHAIN (candidates
); fn
; fn
= TREE_CHAIN (fn
))
7544 fate
= more_specialized (champ
, TREE_VALUE (fn
), explicit_args
);
7551 fn
= TREE_CHAIN (fn
);
7553 return error_mark_node
;
7555 champ
= TREE_VALUE (fn
);
7559 for (fn
= candidates
; fn
&& TREE_VALUE (fn
) != champ
; fn
= TREE_CHAIN (fn
))
7561 fate
= more_specialized (champ
, TREE_VALUE (fn
), explicit_args
);
7563 return error_mark_node
;
7569 /* If DECL is a specialization of some template, return the most
7570 general such template. For example, given:
7572 template <class T> struct S { template <class U> void f(U); };
7574 if TMPL is `template <class U> void S<int>::f(U)' this will return
7575 the full template. This function will not trace past partial
7576 specializations, however. For example, given in addition:
7578 template <class T> struct S<T*> { template <class U> void f(U); };
7580 if TMPL is `template <class U> void S<int*>::f(U)' this will return
7581 `template <class T> template <class U> S<T*>::f(U)'. */
7584 most_general_template (decl
)
7587 while (DECL_TEMPLATE_INFO (decl
))
7588 decl
= DECL_TI_TEMPLATE (decl
);
7593 /* Return the most specialized of the class template specializations
7594 of TMPL which can produce an instantiation matching ARGS, or
7595 error_mark_node if the choice is ambiguous. */
7598 most_specialized_class (tmpl
, args
)
7602 tree list
= NULL_TREE
;
7607 tmpl
= most_general_template (tmpl
);
7608 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
); t
; t
= TREE_CHAIN (t
))
7611 = get_class_bindings (TREE_VALUE (t
), TREE_PURPOSE (t
), args
);
7614 list
= decl_tree_cons (TREE_PURPOSE (t
), TREE_VALUE (t
), list
);
7615 TREE_TYPE (list
) = TREE_TYPE (t
);
7625 for (; t
; t
= TREE_CHAIN (t
))
7627 fate
= more_specialized_class (champ
, t
);
7636 return error_mark_node
;
7642 for (t
= list
; t
&& t
!= champ
; t
= TREE_CHAIN (t
))
7644 fate
= more_specialized_class (champ
, t
);
7646 return error_mark_node
;
7652 /* called from the parser. */
7655 do_decl_instantiation (declspecs
, declarator
, storage
)
7656 tree declspecs
, declarator
, storage
;
7658 tree decl
= grokdeclarator (declarator
, declspecs
, NORMAL
, 0, NULL_TREE
);
7659 tree result
= NULL_TREE
;
7662 if (! DECL_LANG_SPECIFIC (decl
))
7664 cp_error ("explicit instantiation of non-template `%#D'", decl
);
7667 else if (TREE_CODE (decl
) == VAR_DECL
)
7669 /* There is an asymmetry here in the way VAR_DECLs and
7670 FUNCTION_DECLs are handled by grokdeclarator. In the case of
7671 the latter, the DECL we get back will be marked as a
7672 template instantiation, and the appropriate
7673 DECL_TEMPLATE_INFO will be set up. This does not happen for
7674 VAR_DECLs so we do the lookup here. Probably, grokdeclarator
7675 should handle VAR_DECLs as it currently handles
7677 result
= lookup_field (DECL_CONTEXT (decl
), DECL_NAME (decl
), 0, 0);
7678 if (result
&& TREE_CODE (result
) != VAR_DECL
)
7680 cp_error ("no matching template for `%D' found", result
);
7684 else if (TREE_CODE (decl
) != FUNCTION_DECL
)
7686 cp_error ("explicit instantiation of `%#D'", decl
);
7692 /* Check for various error cases. Note that if the explicit
7693 instantiation is legal the RESULT will currently be marked as an
7694 *implicit* instantiation; DECL_EXPLICIT_INSTANTIATION is not set
7695 until we get here. */
7697 if (DECL_TEMPLATE_SPECIALIZATION (result
))
7701 No program shall both explicitly instantiate and explicitly
7702 specialize a template. */
7703 cp_error ("explicit instantiation of `%#D' after", result
);
7704 cp_error_at ("explicit specialization here", result
);
7707 else if (DECL_EXPLICIT_INSTANTIATION (result
))
7711 No program shall explicitly instantiate any template more
7714 We check DECL_INTERFACE_KNOWN so as not to complain when the
7715 first instantiation was `extern' and the second is not, and
7716 EXTERN_P for the opposite case. */
7717 if (DECL_INTERFACE_KNOWN (result
) && !extern_p
)
7718 cp_error ("duplicate explicit instantiation of `%#D'", result
);
7720 /* If we've already instantiated the template, just return now. */
7721 if (DECL_INTERFACE_KNOWN (result
))
7724 else if (!DECL_IMPLICIT_INSTANTIATION (result
))
7726 cp_error ("no matching template for `%D' found", result
);
7729 else if (!DECL_TEMPLATE_INFO (result
))
7731 cp_pedwarn ("explicit instantiation of non-template `%#D'", result
);
7735 if (flag_external_templates
)
7738 if (storage
== NULL_TREE
)
7740 else if (storage
== ridpointers
[(int) RID_EXTERN
])
7743 cp_pedwarn ("ANSI C++ forbids the use of `extern' on explicit instantiations");
7747 cp_error ("storage class `%D' applied to template instantiation",
7750 SET_DECL_EXPLICIT_INSTANTIATION (result
);
7751 mark_decl_instantiated (result
, extern_p
);
7752 repo_template_instantiated (result
, extern_p
);
7754 instantiate_decl (result
);
7758 mark_class_instantiated (t
, extern_p
)
7762 SET_CLASSTYPE_EXPLICIT_INSTANTIATION (t
);
7763 SET_CLASSTYPE_INTERFACE_KNOWN (t
);
7764 CLASSTYPE_INTERFACE_ONLY (t
) = extern_p
;
7765 CLASSTYPE_VTABLE_NEEDS_WRITING (t
) = ! extern_p
;
7766 TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (t
)) = extern_p
;
7769 CLASSTYPE_DEBUG_REQUESTED (t
) = 1;
7770 rest_of_type_compilation (t
, 1);
7775 do_type_instantiation (t
, storage
)
7782 if (TREE_CODE (t
) == TYPE_DECL
)
7785 if (! IS_AGGR_TYPE (t
) || ! CLASSTYPE_TEMPLATE_INFO (t
))
7787 cp_error ("explicit instantiation of non-template type `%T'", t
);
7793 /* With -fexternal-templates, explicit instantiations are treated the same
7794 as implicit ones. */
7795 if (flag_external_templates
)
7798 if (TYPE_SIZE (t
) == NULL_TREE
)
7800 cp_error ("explicit instantiation of `%#T' before definition of template",
7805 if (storage
!= NULL_TREE
)
7808 cp_pedwarn("ANSI C++ forbids the use of `%s' on explicit instantiations",
7809 IDENTIFIER_POINTER (storage
));
7811 if (storage
== ridpointers
[(int) RID_INLINE
])
7813 else if (storage
== ridpointers
[(int) RID_EXTERN
])
7815 else if (storage
== ridpointers
[(int) RID_STATIC
])
7819 cp_error ("storage class `%D' applied to template instantiation",
7825 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
7829 No program shall both explicitly instantiate and explicitly
7830 specialize a template. */
7831 cp_error ("explicit instantiation of `%#T' after", t
);
7832 cp_error_at ("explicit specialization here", t
);
7835 else if (CLASSTYPE_EXPLICIT_INSTANTIATION (t
))
7839 No program shall explicitly instantiate any template more
7842 If CLASSTYPE_INTERFACE_ONLY, then the first explicit
7843 instantiation was `extern', and if EXTERN_P then the second
7844 is. Both cases are OK. */
7845 if (!CLASSTYPE_INTERFACE_ONLY (t
) && !extern_p
)
7846 cp_error ("duplicate explicit instantiation of `%#T'", t
);
7848 /* If we've already instantiated the template, just return now. */
7849 if (!CLASSTYPE_INTERFACE_ONLY (t
))
7853 mark_class_instantiated (t
, extern_p
);
7854 repo_template_instantiated (t
, extern_p
);
7862 /* In contrast to implicit instantiation, where only the
7863 declarations, and not the definitions, of members are
7864 instantiated, we have here:
7868 The explicit instantiation of a class template specialization
7869 implies the instantiation of all of its members not
7870 previously explicitly specialized in the translation unit
7871 containing the explicit instantiation.
7873 Of course, we can't instantiate member template classes, since
7874 we don't have any arguments for them. Note that the standard
7875 is unclear on whether the instatiation of the members are
7876 *explicit* instantiations or not. We choose to be generous,
7877 and not set DECL_EXPLICIT_INSTANTIATION. Therefore, we allow
7878 the explicit instantiation of a class where some of the members
7879 have no definition in the current translation unit. */
7882 for (tmp
= TYPE_METHODS (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
7883 if (TREE_CODE (tmp
) == FUNCTION_DECL
7884 && DECL_TEMPLATE_INSTANTIATION (tmp
))
7886 mark_decl_instantiated (tmp
, extern_p
);
7887 repo_template_instantiated (tmp
, extern_p
);
7889 instantiate_decl (tmp
);
7892 for (tmp
= TYPE_FIELDS (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
7893 if (TREE_CODE (tmp
) == VAR_DECL
&& DECL_TEMPLATE_INSTANTIATION (tmp
))
7895 mark_decl_instantiated (tmp
, extern_p
);
7896 repo_template_instantiated (tmp
, extern_p
);
7898 instantiate_decl (tmp
);
7901 for (tmp
= CLASSTYPE_TAGS (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
7902 if (IS_AGGR_TYPE (TREE_VALUE (tmp
))
7903 && !uses_template_parms (CLASSTYPE_TI_ARGS (TREE_VALUE (tmp
))))
7904 do_type_instantiation (TYPE_MAIN_DECL (TREE_VALUE (tmp
)), storage
);
7908 /* Given a function DECL, which is a specialization of TMPL, modify
7909 DECL to be a re-instantiation of TMPL with the same template
7910 arguments. TMPL should be the template into which tsubst'ing
7911 should occur for DECL, not the most general template.
7913 One reason for doing this is a scenario like this:
7916 void f(const T&, int i);
7918 void g() { f(3, 7); }
7921 void f(const T& t, const int i) { }
7923 Note that when the template is first instantiated, with
7924 instantiate_template, the resulting DECL will have no name for the
7925 first parameter, and the wrong type for the second. So, when we go
7926 to instantiate the DECL, we regenerate it. */
7929 regenerate_decl_from_template (decl
, tmpl
)
7939 args
= DECL_TI_ARGS (decl
);
7940 code_pattern
= DECL_TEMPLATE_RESULT (tmpl
);
7942 /* Unregister the specialization so that when we tsubst we will not
7943 just return DECL. We don't have to unregister DECL from TMPL
7944 because if would only be registered there if it were a partial
7945 instantiation of a specialization, which it isn't: it's a full
7947 gen_tmpl
= most_general_template (tmpl
);
7948 unregistered
= unregister_specialization (decl
, gen_tmpl
);
7950 /* If the DECL was not unregistered then something peculiar is
7951 happening: we created a specialization but did not call
7952 register_specialization for it. */
7953 my_friendly_assert (unregistered
, 0);
7955 /* Do the substitution to get the new declaration. */
7956 new_decl
= tsubst (code_pattern
, args
, NULL_TREE
);
7958 if (TREE_CODE (decl
) == VAR_DECL
)
7960 /* Set up DECL_INITIAL, since tsubst doesn't. */
7961 pushclass (DECL_CONTEXT (decl
), 2);
7962 DECL_INITIAL (new_decl
) =
7963 tsubst_expr (DECL_INITIAL (code_pattern
), args
,
7964 DECL_TI_TEMPLATE (decl
));
7968 if (TREE_CODE (decl
) == FUNCTION_DECL
)
7969 /* Convince duplicate_decls to use the DECL_ARGUMENTS from the
7971 DECL_INITIAL (new_decl
) = error_mark_node
;
7973 /* The immediate parent of the new template is still whatever it was
7974 before, even though tsubst sets DECL_TI_TEMPLATE up as the most
7975 general template. We also reset the DECL_ASSEMBLER_NAME since
7976 tsubst always calculates the name as if the function in question
7977 were really a template instance, and sometimes, with friend
7978 functions, this is not so. See tsubst_friend_function for
7980 DECL_TI_TEMPLATE (new_decl
) = DECL_TI_TEMPLATE (decl
);
7981 DECL_ASSEMBLER_NAME (new_decl
) = DECL_ASSEMBLER_NAME (decl
);
7982 DECL_RTL (new_decl
) = DECL_RTL (decl
);
7984 /* Call duplicate decls to merge the old and new declarations. */
7985 duplicate_decls (new_decl
, decl
);
7987 if (TREE_CODE (decl
) == FUNCTION_DECL
)
7988 DECL_INITIAL (new_decl
) = NULL_TREE
;
7990 /* Now, re-register the specialization. */
7991 register_specialization (decl
, gen_tmpl
, args
);
7994 /* Produce the definition of D, a _DECL generated from a template. */
7997 instantiate_decl (d
)
8000 tree tmpl
= DECL_TI_TEMPLATE (d
);
8001 tree args
= DECL_TI_ARGS (d
);
8006 int nested
= in_function_p ();
8007 int pattern_defined
;
8009 char *file
= input_filename
;
8011 /* This function should only be used to instantiate templates for
8012 functions and static member variables. */
8013 my_friendly_assert (TREE_CODE (d
) == FUNCTION_DECL
8014 || TREE_CODE (d
) == VAR_DECL
, 0);
8016 if ((TREE_CODE (d
) == FUNCTION_DECL
&& DECL_INITIAL (d
))
8017 || (TREE_CODE (d
) == VAR_DECL
&& !DECL_IN_AGGR_P (d
)))
8018 /* D has already been instantiated. It might seem reasonable to
8019 check whether or not D is an explict instantiation, and, if so,
8020 stop here. But when an explicit instantiation is deferred
8021 until the end of the compilation, DECL_EXPLICIT_INSTANTIATION
8022 is set, even though we still need to do the instantiation. */
8025 /* If we already have a specialization of this declaration, then
8026 there's no reason to instantiate it. Note that
8027 retrieve_specialization gives us both instantiations and
8028 specializations, so we must explicitly check
8029 DECL_TEMPLATE_SPECIALIZATION. */
8030 gen_tmpl
= most_general_template (tmpl
);
8031 spec
= retrieve_specialization (gen_tmpl
, args
);
8032 if (spec
!= NULL_TREE
&& DECL_TEMPLATE_SPECIALIZATION (spec
))
8035 /* This needs to happen before any tsubsting. */
8036 if (! push_tinst_level (d
))
8039 /* Set TD to the template whose DECL_TEMPLATE_RESULT is the pattern
8040 for the instantiation. This is not always the most general
8041 template. Consider, for example:
8044 struct S { template <class U> void f();
8045 template <> void f<int>(); };
8047 and an instantiation of S<double>::f<int>. We want TD to be the
8048 specialization S<T>::f<int>, not the more general S<T>::f<U>. */
8051 /* An instantiation cannot have a definition, so we need a
8052 more general template. */
8053 DECL_TEMPLATE_INSTANTIATION (td
)
8054 /* We must also deal with friend templates. Given:
8056 template <class T> struct S {
8057 template <class U> friend void f() {};
8060 S<int>::f<U> say, is not an instantiation of S<T>::f<U>,
8061 so far as the language is concerned, but that's still
8062 where we get the pattern for the instantiation from. On
8063 ther hand, if the definition comes outside the class, say:
8065 template <class T> struct S {
8066 template <class U> friend void f();
8068 template <class U> friend void f() {}
8070 we don't need to look any further. That's what the check for
8071 DECL_INITIAL is for. */
8072 || (TREE_CODE (d
) == FUNCTION_DECL
8073 && DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (td
)
8074 && !DECL_INITIAL (DECL_TEMPLATE_RESULT (td
)));
8077 /* The present template, TD, should not be a definition. If it
8078 were a definition, we should be using it! Note that we
8079 cannot restructure the loop to just keep going until we find
8080 a template with a definition, since that might go too far if
8081 a specialization was declared, but not defined. */
8082 my_friendly_assert (!(TREE_CODE (d
) == FUNCTION_DECL
8083 && DECL_INITIAL (DECL_TEMPLATE_RESULT (td
))),
8085 my_friendly_assert (!(TREE_CODE (d
) == VAR_DECL
8086 && !DECL_IN_AGGR_P (DECL_TEMPLATE_RESULT (td
))),
8089 /* Fetch the more general template. */
8090 td
= DECL_TI_TEMPLATE (td
);
8093 code_pattern
= DECL_TEMPLATE_RESULT (td
);
8095 if (TREE_CODE (d
) == FUNCTION_DECL
)
8096 pattern_defined
= (DECL_INITIAL (code_pattern
) != NULL_TREE
);
8098 pattern_defined
= ! DECL_IN_AGGR_P (code_pattern
);
8100 push_to_top_level ();
8101 lineno
= DECL_SOURCE_LINE (d
);
8102 input_filename
= DECL_SOURCE_FILE (d
);
8104 if (pattern_defined
)
8106 repo_template_used (d
);
8108 if (flag_external_templates
&& ! DECL_INTERFACE_KNOWN (d
))
8110 if (flag_alt_external_templates
)
8112 if (interface_unknown
)
8113 warn_if_unknown_interface (d
);
8115 else if (DECL_INTERFACE_KNOWN (code_pattern
))
8117 DECL_INTERFACE_KNOWN (d
) = 1;
8118 DECL_NOT_REALLY_EXTERN (d
) = ! DECL_EXTERNAL (code_pattern
);
8121 warn_if_unknown_interface (code_pattern
);
8125 import_export_decl (d
);
8128 /* Reject all external templates except inline functions. */
8129 if (DECL_INTERFACE_KNOWN (d
)
8130 && ! DECL_NOT_REALLY_EXTERN (d
)
8131 && ! (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_INLINE (d
)))
8134 if (TREE_CODE (d
) == VAR_DECL
8135 && TREE_READONLY (d
)
8136 && DECL_INITIAL (d
) == NULL_TREE
8137 && DECL_INITIAL (code_pattern
) != NULL_TREE
)
8138 /* We need to set up DECL_INITIAL regardless of pattern_defined if
8139 the variable is a static const initialized in the class body. */;
8140 else if (! pattern_defined
8141 || (! (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_INLINE (d
) && nested
)
8144 /* Defer all templates except inline functions used in another
8145 function. We restore the source position here because it's used
8146 by add_pending_template. */
8148 input_filename
= file
;
8150 if (at_eof
&& !pattern_defined
8151 && DECL_EXPLICIT_INSTANTIATION (d
))
8154 The definition of a non-exported function template, a
8155 non-exported member function template, or a non-exported
8156 member function or static data member of a class template
8157 shall be present in every translation unit in which it is
8158 explicitly instantiated. */
8159 cp_error ("explicit instantiation of `%D' but no definition available",
8162 add_pending_template (d
);
8166 regenerate_decl_from_template (d
, td
);
8168 /* We already set the file and line above. Reset them now in case
8169 they changed as a result of calling regenerate_decl_from_template. */
8170 lineno
= DECL_SOURCE_LINE (d
);
8171 input_filename
= DECL_SOURCE_FILE (d
);
8173 if (TREE_CODE (d
) == VAR_DECL
)
8175 DECL_IN_AGGR_P (d
) = 0;
8176 if (DECL_INTERFACE_KNOWN (d
))
8177 DECL_EXTERNAL (d
) = ! DECL_NOT_REALLY_EXTERN (d
);
8180 DECL_EXTERNAL (d
) = 1;
8181 DECL_NOT_REALLY_EXTERN (d
) = 1;
8183 cp_finish_decl (d
, DECL_INITIAL (d
), NULL_TREE
, 0, 0);
8185 else if (TREE_CODE (d
) == FUNCTION_DECL
)
8187 tree t
= DECL_SAVED_TREE (code_pattern
);
8189 start_function (NULL_TREE
, d
, NULL_TREE
, 1);
8190 store_parm_decls ();
8192 if (t
&& TREE_CODE (t
) == RETURN_INIT
)
8195 (TREE_OPERAND (t
, 0),
8196 tsubst_expr (TREE_OPERAND (t
, 1), args
, tmpl
));
8200 if (t
&& TREE_CODE (t
) == CTOR_INITIALIZER
)
8202 current_member_init_list
8203 = tsubst_expr_values (TREE_OPERAND (t
, 0), args
);
8204 current_base_init_list
8205 = tsubst_expr_values (TREE_OPERAND (t
, 1), args
);
8210 /* Always keep the BLOCK node associated with the outermost
8211 pair of curly braces of a function. These are needed
8212 for correct operation of dwarfout.c. */
8215 my_friendly_assert (TREE_CODE (t
) == COMPOUND_STMT
, 42);
8216 tsubst_expr (t
, args
, tmpl
);
8218 finish_function (lineno
, 0, nested
);
8223 input_filename
= file
;
8225 pop_from_top_level ();
8232 tsubst_chain (t
, argvec
)
8237 tree first
= tsubst (t
, argvec
, NULL_TREE
);
8240 for (t
= TREE_CHAIN (t
); t
; t
= TREE_CHAIN (t
))
8242 tree x
= tsubst (t
, argvec
, NULL_TREE
);
8243 TREE_CHAIN (last
) = x
;
8253 tsubst_expr_values (t
, argvec
)
8256 tree first
= NULL_TREE
;
8259 for (; t
; t
= TREE_CHAIN (t
))
8261 tree pur
= tsubst_copy (TREE_PURPOSE (t
), argvec
, NULL_TREE
);
8262 tree val
= tsubst_expr (TREE_VALUE (t
), argvec
, NULL_TREE
);
8263 *p
= build_tree_list (pur
, val
);
8264 p
= &TREE_CHAIN (*p
);
8275 last_tree
= TREE_CHAIN (last_tree
) = t
;
8282 saved_trees
= tree_cons (NULL_TREE
, last_tree
, saved_trees
);
8283 last_tree
= NULL_TREE
;
8290 my_friendly_assert (saved_trees
!= NULL_TREE
, 0);
8292 last_tree
= TREE_VALUE (saved_trees
);
8293 saved_trees
= TREE_CHAIN (saved_trees
);
8296 /* D is an undefined function declaration in the presence of templates with
8297 the same name, listed in FNS. If one of them can produce D as an
8298 instantiation, remember this so we can instantiate it at EOF if D has
8299 not been defined by that time. */
8302 add_maybe_template (d
, fns
)
8307 if (DECL_MAYBE_TEMPLATE (d
))
8310 t
= most_specialized (fns
, d
, NULL_TREE
);
8313 if (t
== error_mark_node
)
8315 cp_error ("ambiguous template instantiation for `%D'", d
);
8319 *maybe_template_tail
= perm_tree_cons (t
, d
, NULL_TREE
);
8320 maybe_template_tail
= &TREE_CHAIN (*maybe_template_tail
);
8321 DECL_MAYBE_TEMPLATE (d
) = 1;
8324 /* Instantiate an enumerated type. TAG is the template type, NEWTAG
8325 is the instantiation (which should have been created with
8326 start_enum) and ARGS are the template arguments to use. */
8329 tsubst_enum (tag
, newtag
, args
)
8336 for (e
= TYPE_VALUES (tag
); e
; e
= TREE_CHAIN (e
))
8339 = build_enumerator (TREE_PURPOSE (e
),
8340 /* Note that in a template enum, the
8341 TREE_VALUE is the CONST_DECL, not the
8342 corresponding INTEGER_CST. */
8343 tsubst_expr (DECL_INITIAL (TREE_VALUE (e
)),
8348 /* We save the enumerators we have built so far in the
8349 TYPE_VALUES so that if the enumeration constants for
8350 subsequent enumerators involve those for previous ones,
8351 tsubst_copy will be able to find them. */
8352 TREE_CHAIN (elt
) = TYPE_VALUES (newtag
);
8353 TYPE_VALUES (newtag
) = elt
;
8356 finish_enum (newtag
);
8359 /* Set the DECL_ASSEMBLER_NAME for DECL, which is a FUNCTION_DECL that
8360 is either an instantiation or specialization of a template
8364 set_mangled_name_for_template_decl (decl
)
8367 tree saved_namespace
;
8368 tree context
= NULL_TREE
;
8377 my_friendly_assert (TREE_CODE (decl
) == FUNCTION_DECL
, 0);
8378 my_friendly_assert (DECL_TEMPLATE_INFO (decl
) != NULL_TREE
, 0);
8380 /* The names of template functions must be mangled so as to indicate
8381 what template is being specialized with what template arguments.
8382 For example, each of the following three functions must get
8383 different mangled names:
8386 template <> void f<7>(int);
8387 template <> void f<8>(int); */
8389 targs
= DECL_TI_ARGS (decl
);
8390 if (uses_template_parms (targs
))
8391 /* This DECL is for a partial instantiation. There's no need to
8392 mangle the name of such an entity. */
8395 tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
8396 tparms
= DECL_TEMPLATE_PARMS (tmpl
);
8397 parm_depth
= TMPL_PARMS_DEPTH (tparms
);
8399 /* There should be as many levels of arguments as there are levels
8401 my_friendly_assert (parm_depth
== TMPL_ARGS_DEPTH (targs
), 0);
8403 /* We now compute the PARMS and RET_TYPE to give to
8404 build_decl_overload_real. The PARMS and RET_TYPE are the
8405 parameter and return types of the template, after all but the
8406 innermost template arguments have been substituted, not the
8407 parameter and return types of the function DECL. For example,
8410 template <class T> T f(T);
8412 both PARMS and RET_TYPE should be `T' even if DECL is `int f(int)'.
8413 A more subtle example is:
8415 template <class T> struct S { template <class U> void f(T, U); }
8417 Here, if DECL is `void S<int>::f(int, double)', PARMS should be
8418 {int, U}. Thus, the args that we want to subsitute into the
8419 return and parameter type for the function are those in TARGS,
8420 with the innermost level omitted. */
8421 fn_type
= TREE_TYPE (tmpl
);
8422 if (DECL_STATIC_FUNCTION_P (decl
))
8423 context
= DECL_CLASS_CONTEXT (decl
);
8425 if (parm_depth
== 1)
8426 /* No substitution is necessary. */
8433 /* Replace the innermost level of the TARGS with NULL_TREEs to
8434 let tsubst know not to subsitute for those parameters. */
8435 partial_args
= make_temp_vec (TREE_VEC_LENGTH (targs
));
8436 for (i
= 1; i
< TMPL_ARGS_DEPTH (targs
); ++i
)
8437 SET_TMPL_ARGS_LEVEL (partial_args
, i
,
8438 TMPL_ARGS_LEVEL (targs
, i
));
8439 SET_TMPL_ARGS_LEVEL (partial_args
,
8440 TMPL_ARGS_DEPTH (targs
),
8441 make_temp_vec (DECL_NTPARMS (tmpl
)));
8443 /* Now, do the (partial) substitution to figure out the
8444 appropriate function type. */
8445 fn_type
= tsubst (fn_type
, partial_args
, NULL_TREE
);
8446 if (DECL_STATIC_FUNCTION_P (decl
))
8447 context
= tsubst (context
, partial_args
, NULL_TREE
);
8449 /* Substitute into the template parameters to obtain the real
8450 innermost set of parameters. This step is important if the
8451 innermost set of template parameters contains value
8452 parameters whose types depend on outer template parameters. */
8453 TREE_VEC_LENGTH (partial_args
)--;
8454 tparms
= tsubst_template_parms (tparms
, partial_args
);
8457 /* Now, get the innermost parameters and arguments, and figure out
8458 the parameter and return types. */
8459 tparms
= INNERMOST_TEMPLATE_PARMS (tparms
);
8460 targs
= innermost_args (targs
);
8461 ret_type
= TREE_TYPE (fn_type
);
8462 parm_types
= TYPE_ARG_TYPES (fn_type
);
8464 /* For a static member function, we generate a fake `this' pointer,
8465 for the purposes of mangling. This indicates of which class the
8466 function is a member. Because of:
8470 There shall not be a static and a nonstatic member function
8471 with the same name and the same parameter types
8473 we don't have to worry that this will result in a clash with a
8474 non-static member function. */
8475 if (DECL_STATIC_FUNCTION_P (decl
))
8476 parm_types
= hash_tree_chain (build_pointer_type (context
), parm_types
);
8478 /* There should be the same number of template parameters as
8479 template arguments. */
8480 my_friendly_assert (TREE_VEC_LENGTH (tparms
) == TREE_VEC_LENGTH (targs
),
8483 /* If the template is in a namespace, we need to put that into the
8484 mangled name. Unfortunately, build_decl_overload_real does not
8485 get the decl to mangle, so it relies on the current
8486 namespace. Therefore, we set that here temporarily. */
8487 my_friendly_assert (TREE_CODE_CLASS (TREE_CODE (decl
)) == 'd', 980702);
8488 saved_namespace
= current_namespace
;
8489 current_namespace
= CP_DECL_CONTEXT (decl
);
8491 /* Actually set the DCL_ASSEMBLER_NAME. */
8492 DECL_ASSEMBLER_NAME (decl
)
8493 = build_decl_overload_real (DECL_NAME (decl
), parm_types
, ret_type
,
8495 DECL_FUNCTION_MEMBER_P (decl
)
8496 + DECL_CONSTRUCTOR_P (decl
));
8498 /* Restore the previously active namespace. */
8499 current_namespace
= saved_namespace
;