1 /* Handle parameterized types (templates) for GNU C++.
2 Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000
3 Free Software Foundation, Inc.
4 Written by Ken Raeburn (raeburn@cygnus.com) while at Watchmaker Computing.
5 Rewritten by Jason Merrill (jason@cygnus.com).
7 This file is part of GNU CC.
9 GNU CC is free software; you can redistribute it and/or modify
10 it under the terms of the GNU General Public License as published by
11 the Free Software Foundation; either version 2, or (at your option)
14 GNU CC is distributed in the hope that it will be useful,
15 but WITHOUT ANY WARRANTY; without even the implied warranty of
16 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 GNU General Public License for more details.
19 You should have received a copy of the GNU General Public License
20 along with GNU CC; see the file COPYING. If not, write to
21 the Free Software Foundation, 59 Temple Place - Suite 330,
22 Boston, MA 02111-1307, USA. */
24 /* Known bugs or deficiencies include:
26 all methods must be provided in header files; can't use a source
27 file that contains only the method templates and "just win". */
47 /* The type of functions taking a tree, and some additional data, and
49 typedef int (*tree_fn_t
) PARAMS ((tree
, void*));
51 extern struct obstack permanent_obstack
;
54 extern char *input_filename
;
56 /* The PENDING_TEMPLATES is a TREE_LIST of templates whose
57 instantiations have been deferred, either because their definitions
58 were not yet available, or because we were putting off doing the
59 work. The TREE_PURPOSE of each entry is a SRCLOC indicating where
60 the instantiate request occurred; the TREE_VALUE is a either a DECL
61 (for a function or static data member), or a TYPE (for a class)
62 indicating what we are hoping to instantiate. */
63 static tree pending_templates
;
64 static tree
*template_tail
= &pending_templates
;
66 static tree maybe_templates
;
67 static tree
*maybe_template_tail
= &maybe_templates
;
69 int processing_template_parmlist
;
70 static int template_header_count
;
72 static tree saved_trees
;
73 static varray_type inline_parm_levels
;
74 static size_t inline_parm_levels_used
;
76 #define obstack_chunk_alloc xmalloc
77 #define obstack_chunk_free free
79 #define UNIFY_ALLOW_NONE 0
80 #define UNIFY_ALLOW_MORE_CV_QUAL 1
81 #define UNIFY_ALLOW_LESS_CV_QUAL 2
82 #define UNIFY_ALLOW_DERIVED 4
83 #define UNIFY_ALLOW_INTEGER 8
85 #define GTB_VIA_VIRTUAL 1 /* The base class we are examining is
86 virtual, or a base class of a virtual
88 #define GTB_IGNORE_TYPE 2 /* We don't need to try to unify the current
89 type with the desired type. */
91 static int resolve_overloaded_unification
PARAMS ((tree
, tree
, tree
, tree
,
92 unification_kind_t
, int));
93 static int try_one_overload
PARAMS ((tree
, tree
, tree
, tree
, tree
,
94 unification_kind_t
, int));
95 static int unify
PARAMS ((tree
, tree
, tree
, tree
, int));
96 static void add_pending_template
PARAMS ((tree
));
97 static int push_tinst_level
PARAMS ((tree
));
98 static tree classtype_mangled_name
PARAMS ((tree
));
99 static char *mangle_class_name_for_template
PARAMS ((char *, tree
, tree
));
100 static tree tsubst_expr_values
PARAMS ((tree
, tree
));
101 static int list_eq
PARAMS ((tree
, tree
));
102 static tree get_class_bindings
PARAMS ((tree
, tree
, tree
));
103 static tree coerce_template_parms
PARAMS ((tree
, tree
, tree
, int, int));
104 static void tsubst_enum
PARAMS ((tree
, tree
, tree
));
105 static tree add_to_template_args
PARAMS ((tree
, tree
));
106 static tree add_outermost_template_args
PARAMS ((tree
, tree
));
107 static void maybe_adjust_types_for_deduction
PARAMS ((unification_kind_t
, tree
*,
109 static int type_unification_real
PARAMS ((tree
, tree
, tree
, tree
,
110 int, unification_kind_t
, int));
111 static void note_template_header
PARAMS ((int));
112 static tree maybe_fold_nontype_arg
PARAMS ((tree
));
113 static tree convert_nontype_argument
PARAMS ((tree
, tree
));
114 static tree convert_template_argument
PARAMS ((tree
, tree
, tree
, int,
116 static tree get_bindings_overload
PARAMS ((tree
, tree
, tree
));
117 static int for_each_template_parm
PARAMS ((tree
, tree_fn_t
, void*));
118 static tree build_template_parm_index
PARAMS ((int, int, int, tree
, tree
));
119 static int inline_needs_template_parms
PARAMS ((tree
));
120 static void push_inline_template_parms_recursive
PARAMS ((tree
, int));
121 static tree retrieve_specialization
PARAMS ((tree
, tree
));
122 static tree retrieve_local_specialization
PARAMS ((tree
, tree
));
123 static tree register_specialization
PARAMS ((tree
, tree
, tree
));
124 static tree register_local_specialization
PARAMS ((tree
, tree
, tree
));
125 static int unregister_specialization
PARAMS ((tree
, tree
));
126 static tree reduce_template_parm_level
PARAMS ((tree
, tree
, int));
127 static tree build_template_decl
PARAMS ((tree
, tree
));
128 static int mark_template_parm
PARAMS ((tree
, void *));
129 static tree tsubst_friend_function
PARAMS ((tree
, tree
));
130 static tree tsubst_friend_class
PARAMS ((tree
, tree
));
131 static tree get_bindings_real
PARAMS ((tree
, tree
, tree
, int));
132 static int template_decl_level
PARAMS ((tree
));
133 static tree maybe_get_template_decl_from_type_decl
PARAMS ((tree
));
134 static int check_cv_quals_for_unify
PARAMS ((int, tree
, tree
));
135 static tree tsubst_template_arg_vector
PARAMS ((tree
, tree
, int));
136 static tree tsubst_template_parms
PARAMS ((tree
, tree
, int));
137 static void regenerate_decl_from_template
PARAMS ((tree
, tree
));
138 static tree most_specialized
PARAMS ((tree
, tree
, tree
));
139 static tree most_specialized_class
PARAMS ((tree
, tree
));
140 static void set_mangled_name_for_template_decl
PARAMS ((tree
));
141 static int template_class_depth_real
PARAMS ((tree
, int));
142 static tree tsubst_aggr_type
PARAMS ((tree
, tree
, int, tree
, int));
143 static tree tsubst_decl
PARAMS ((tree
, tree
, tree
, tree
));
144 static tree tsubst_arg_types
PARAMS ((tree
, tree
, int, tree
));
145 static tree tsubst_function_type
PARAMS ((tree
, tree
, int, tree
));
146 static void check_specialization_scope
PARAMS ((void));
147 static tree process_partial_specialization
PARAMS ((tree
));
148 static void set_current_access_from_decl
PARAMS ((tree
));
149 static void check_default_tmpl_args
PARAMS ((tree
, tree
, int, int));
150 static tree tsubst_call_declarator_parms
PARAMS ((tree
, tree
, int, tree
));
151 static tree get_template_base_recursive
PARAMS ((tree
, tree
,
152 tree
, tree
, tree
, int));
153 static tree get_template_base
PARAMS ((tree
, tree
, tree
, tree
));
154 static tree try_class_unification
PARAMS ((tree
, tree
, tree
, tree
));
155 static int coerce_template_template_parms
PARAMS ((tree
, tree
, int,
157 static tree determine_specialization
PARAMS ((tree
, tree
, tree
*, int));
158 static int template_args_equal
PARAMS ((tree
, tree
));
159 static void print_template_context
PARAMS ((int));
160 static void tsubst_default_arguments
PARAMS ((tree
));
161 static tree for_each_template_parm_r
PARAMS ((tree
*, int *, void *));
163 /* Called once to initialize pt.c. */
168 ggc_add_tree_root (&pending_templates
, 1);
169 ggc_add_tree_root (&maybe_templates
, 1);
170 ggc_add_tree_root (&saved_trees
, 1);
173 /* Do any processing required when DECL (a member template declaration
174 using TEMPLATE_PARAMETERS as its innermost parameter list) is
175 finished. Returns the TEMPLATE_DECL corresponding to DECL, unless
176 it is a specialization, in which case the DECL itself is returned. */
179 finish_member_template_decl (decl
)
182 if (decl
== NULL_TREE
|| decl
== void_type_node
)
184 else if (decl
== error_mark_node
)
185 /* By returning NULL_TREE, the parser will just ignore this
186 declaration. We have already issued the error. */
188 else if (TREE_CODE (decl
) == TREE_LIST
)
190 /* Assume that the class is the only declspec. */
191 decl
= TREE_VALUE (decl
);
192 if (IS_AGGR_TYPE (decl
) && CLASSTYPE_TEMPLATE_INFO (decl
)
193 && ! CLASSTYPE_TEMPLATE_SPECIALIZATION (decl
))
195 tree tmpl
= CLASSTYPE_TI_TEMPLATE (decl
);
196 check_member_template (tmpl
);
201 else if (TREE_CODE (decl
) == FIELD_DECL
)
202 cp_error ("data member `%D' cannot be a member template", decl
);
203 else if (DECL_TEMPLATE_INFO (decl
))
205 if (!DECL_TEMPLATE_SPECIALIZATION (decl
))
207 check_member_template (DECL_TI_TEMPLATE (decl
));
208 return DECL_TI_TEMPLATE (decl
);
214 cp_error ("invalid member template declaration `%D'", decl
);
216 return error_mark_node
;
219 /* Returns the template nesting level of the indicated class TYPE.
229 A<T>::B<U> has depth two, while A<T> has depth one.
230 Both A<T>::B<int> and A<int>::B<U> have depth one, if
231 COUNT_SPECIALIZATIONS is 0 or if they are instantiations, not
234 This function is guaranteed to return 0 if passed NULL_TREE so
235 that, for example, `template_class_depth (current_class_type)' is
239 template_class_depth_real (type
, count_specializations
)
241 int count_specializations
;
246 type
&& TREE_CODE (type
) != NAMESPACE_DECL
;
247 type
= (TREE_CODE (type
) == FUNCTION_DECL
)
248 ? CP_DECL_CONTEXT (type
) : TYPE_CONTEXT (type
))
250 if (TREE_CODE (type
) != FUNCTION_DECL
)
252 if (CLASSTYPE_TEMPLATE_INFO (type
)
253 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (type
))
254 && ((count_specializations
255 && CLASSTYPE_TEMPLATE_SPECIALIZATION (type
))
256 || uses_template_parms (CLASSTYPE_TI_ARGS (type
))))
261 if (DECL_TEMPLATE_INFO (type
)
262 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (type
))
263 && ((count_specializations
264 && DECL_TEMPLATE_SPECIALIZATION (type
))
265 || uses_template_parms (DECL_TI_ARGS (type
))))
273 /* Returns the template nesting level of the indicated class TYPE.
274 Like template_class_depth_real, but instantiations do not count in
278 template_class_depth (type
)
281 return template_class_depth_real (type
, /*count_specializations=*/0);
284 /* Returns 1 if processing DECL as part of do_pending_inlines
285 needs us to push template parms. */
288 inline_needs_template_parms (decl
)
291 if (! DECL_TEMPLATE_INFO (decl
))
294 return (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (most_general_template (decl
)))
295 > (processing_template_decl
+ DECL_TEMPLATE_SPECIALIZATION (decl
)));
298 /* Subroutine of maybe_begin_member_template_processing.
299 Push the template parms in PARMS, starting from LEVELS steps into the
300 chain, and ending at the beginning, since template parms are listed
304 push_inline_template_parms_recursive (parmlist
, levels
)
308 tree parms
= TREE_VALUE (parmlist
);
312 push_inline_template_parms_recursive (TREE_CHAIN (parmlist
), levels
- 1);
314 ++processing_template_decl
;
315 current_template_parms
316 = tree_cons (build_int_2 (0, processing_template_decl
),
317 parms
, current_template_parms
);
318 TEMPLATE_PARMS_FOR_INLINE (current_template_parms
) = 1;
321 for (i
= 0; i
< TREE_VEC_LENGTH (parms
); ++i
)
323 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
324 my_friendly_assert (TREE_CODE_CLASS (TREE_CODE (parm
)) == 'd', 0);
326 switch (TREE_CODE (parm
))
335 /* Make a CONST_DECL as is done in process_template_parm.
336 It is ugly that we recreate this here; the original
337 version built in process_template_parm is no longer
339 tree decl
= build_decl (CONST_DECL
, DECL_NAME (parm
),
341 SET_DECL_ARTIFICIAL (decl
);
342 DECL_INITIAL (decl
) = DECL_INITIAL (parm
);
343 SET_DECL_TEMPLATE_PARM_P (decl
);
349 my_friendly_abort (0);
354 /* Restore the template parameter context for a member template or
355 a friend template defined in a class definition. */
358 maybe_begin_member_template_processing (decl
)
364 if (inline_needs_template_parms (decl
))
366 parms
= DECL_TEMPLATE_PARMS (most_general_template (decl
));
367 levels
= TMPL_PARMS_DEPTH (parms
) - processing_template_decl
;
369 if (DECL_TEMPLATE_SPECIALIZATION (decl
))
372 parms
= TREE_CHAIN (parms
);
375 push_inline_template_parms_recursive (parms
, levels
);
378 /* Remember how many levels of template parameters we pushed so that
379 we can pop them later. */
380 if (!inline_parm_levels
)
381 VARRAY_INT_INIT (inline_parm_levels
, 4, "inline_parm_levels");
382 if (inline_parm_levels_used
== inline_parm_levels
->num_elements
)
383 VARRAY_GROW (inline_parm_levels
, 2 * inline_parm_levels_used
);
384 VARRAY_INT (inline_parm_levels
, inline_parm_levels_used
) = levels
;
385 ++inline_parm_levels_used
;
388 /* Undo the effects of begin_member_template_processing. */
391 maybe_end_member_template_processing ()
395 if (!inline_parm_levels_used
)
398 --inline_parm_levels_used
;
400 i
< VARRAY_INT (inline_parm_levels
, inline_parm_levels_used
);
403 --processing_template_decl
;
404 current_template_parms
= TREE_CHAIN (current_template_parms
);
409 /* Returns non-zero iff T is a member template function. We must be
412 template <class T> class C { void f(); }
414 Here, f is a template function, and a member, but not a member
415 template. This function does not concern itself with the origin of
416 T, only its present state. So if we have
418 template <class T> class C { template <class U> void f(U); }
420 then neither C<int>::f<char> nor C<T>::f<double> is considered
421 to be a member template. But, `template <class U> void
422 C<int>::f(U)' is considered a member template. */
425 is_member_template (t
)
428 if (!DECL_FUNCTION_TEMPLATE_P (t
))
429 /* Anything that isn't a function or a template function is
430 certainly not a member template. */
433 /* A local class can't have member templates. */
434 if (decl_function_context (t
))
437 return (DECL_FUNCTION_MEMBER_P (DECL_TEMPLATE_RESULT (t
))
438 /* If there are more levels of template parameters than
439 there are template classes surrounding the declaration,
440 then we have a member template. */
441 && (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (t
)) >
442 template_class_depth (DECL_CONTEXT (t
))));
446 /* Returns non-zero iff T is a member template class. See
447 is_member_template for a description of what precisely constitutes
448 a member template. */
451 is_member_template_class (t
)
454 if (!DECL_CLASS_TEMPLATE_P (t
))
455 /* Anything that isn't a class template, is certainly not a member
459 if (!DECL_CLASS_SCOPE_P (t
))
460 /* Anything whose context isn't a class type is surely not a
464 /* If there are more levels of template parameters than there are
465 template classes surrounding the declaration, then we have a
467 return (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (t
)) >
468 template_class_depth (DECL_CONTEXT (t
)));
472 /* Return a new template argument vector which contains all of ARGS,
473 but has as its innermost set of arguments the EXTRA_ARGS. The
474 resulting vector will be built on a temporary obstack, and so must
475 be explicitly copied to the permanent obstack, if required. */
478 add_to_template_args (args
, extra_args
)
487 extra_depth
= TMPL_ARGS_DEPTH (extra_args
);
488 new_args
= make_tree_vec (TMPL_ARGS_DEPTH (args
) + extra_depth
);
490 for (i
= 1; i
<= TMPL_ARGS_DEPTH (args
); ++i
)
491 SET_TMPL_ARGS_LEVEL (new_args
, i
, TMPL_ARGS_LEVEL (args
, i
));
493 for (j
= 1; j
<= extra_depth
; ++j
, ++i
)
494 SET_TMPL_ARGS_LEVEL (new_args
, i
, TMPL_ARGS_LEVEL (extra_args
, j
));
499 /* Like add_to_template_args, but only the outermost ARGS are added to
500 the EXTRA_ARGS. In particular, all but TMPL_ARGS_DEPTH
501 (EXTRA_ARGS) levels are added. This function is used to combine
502 the template arguments from a partial instantiation with the
503 template arguments used to attain the full instantiation from the
504 partial instantiation. */
507 add_outermost_template_args (args
, extra_args
)
513 /* If there are more levels of EXTRA_ARGS than there are ARGS,
514 something very fishy is going on. */
515 my_friendly_assert (TMPL_ARGS_DEPTH (args
) >= TMPL_ARGS_DEPTH (extra_args
),
518 /* If *all* the new arguments will be the EXTRA_ARGS, just return
520 if (TMPL_ARGS_DEPTH (args
) == TMPL_ARGS_DEPTH (extra_args
))
523 /* For the moment, we make ARGS look like it contains fewer levels. */
524 TREE_VEC_LENGTH (args
) -= TMPL_ARGS_DEPTH (extra_args
);
526 new_args
= add_to_template_args (args
, extra_args
);
528 /* Now, we restore ARGS to its full dimensions. */
529 TREE_VEC_LENGTH (args
) += TMPL_ARGS_DEPTH (extra_args
);
534 /* We've got a template header coming up; push to a new level for storing
538 begin_template_parm_list ()
540 /* We use a non-tag-transparent scope here, which causes pushtag to
541 put tags in this scope, rather than in the enclosing class or
542 namespace scope. This is the right thing, since we want
543 TEMPLATE_DECLS, and not TYPE_DECLS for template classes. For a
544 global template class, push_template_decl handles putting the
545 TEMPLATE_DECL into top-level scope. For a nested template class,
548 template <class T> struct S1 {
549 template <class T> struct S2 {};
552 pushtag contains special code to call pushdecl_with_scope on the
553 TEMPLATE_DECL for S2. */
554 begin_scope (sk_template_parms
);
555 ++processing_template_decl
;
556 ++processing_template_parmlist
;
557 note_template_header (0);
560 /* This routine is called when a specialization is declared. If it is
561 illegal to declare a specialization here, an error is reported. */
564 check_specialization_scope ()
566 tree scope
= current_scope ();
570 An explicit specialization shall be declared in the namespace of
571 which the template is a member, or, for member templates, in the
572 namespace of which the enclosing class or enclosing class
573 template is a member. An explicit specialization of a member
574 function, member class or static data member of a class template
575 shall be declared in the namespace of which the class template
577 if (scope
&& TREE_CODE (scope
) != NAMESPACE_DECL
)
578 cp_error ("explicit specialization in non-namespace scope `%D'",
583 In an explicit specialization declaration for a member of a class
584 template or a member template that appears in namespace scope,
585 the member template and some of its enclosing class templates may
586 remain unspecialized, except that the declaration shall not
587 explicitly specialize a class member template if its enclosing
588 class templates are not explicitly specialized as well. */
589 if (current_template_parms
)
590 cp_error ("enclosing class templates are not explicitly specialized");
593 /* We've just seen template <>. */
596 begin_specialization ()
598 begin_scope (sk_template_spec
);
599 note_template_header (1);
600 check_specialization_scope ();
603 /* Called at then end of processing a declaration preceeded by
607 end_specialization ()
610 reset_specialization ();
613 /* Any template <>'s that we have seen thus far are not referring to a
614 function specialization. */
617 reset_specialization ()
619 processing_specialization
= 0;
620 template_header_count
= 0;
623 /* We've just seen a template header. If SPECIALIZATION is non-zero,
624 it was of the form template <>. */
627 note_template_header (specialization
)
630 processing_specialization
= specialization
;
631 template_header_count
++;
634 /* We're beginning an explicit instantiation. */
637 begin_explicit_instantiation ()
639 ++processing_explicit_instantiation
;
644 end_explicit_instantiation ()
646 my_friendly_assert(processing_explicit_instantiation
> 0, 0);
647 --processing_explicit_instantiation
;
650 /* The TYPE is being declared. If it is a template type, that means it
651 is a partial specialization. Do appropriate error-checking. */
654 maybe_process_partial_specialization (type
)
657 if (IS_AGGR_TYPE (type
) && CLASSTYPE_USE_TEMPLATE (type
))
659 if (CLASSTYPE_IMPLICIT_INSTANTIATION (type
)
660 && !COMPLETE_TYPE_P (type
))
662 if (current_namespace
663 != decl_namespace_context (CLASSTYPE_TI_TEMPLATE (type
)))
665 cp_pedwarn ("specializing `%#T' in different namespace", type
);
666 cp_pedwarn_at (" from definition of `%#D'",
667 CLASSTYPE_TI_TEMPLATE (type
));
669 SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (type
);
670 if (processing_template_decl
)
671 push_template_decl (TYPE_MAIN_DECL (type
));
673 else if (CLASSTYPE_TEMPLATE_INSTANTIATION (type
))
674 cp_error ("specialization of `%T' after instantiation", type
);
676 else if (processing_specialization
)
677 cp_error ("explicit specialization of non-template `%T'", type
);
680 /* Retrieve the specialization (in the sense of [temp.spec] - a
681 specialization is either an instantiation or an explicit
682 specialization) of TMPL for the given template ARGS. If there is
683 no such specialization, return NULL_TREE. The ARGS are a vector of
684 arguments, or a vector of vectors of arguments, in the case of
685 templates with more than one level of parameters. */
688 retrieve_specialization (tmpl
, args
)
694 my_friendly_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
, 0);
696 /* There should be as many levels of arguments as there are
697 levels of parameters. */
698 my_friendly_assert (TMPL_ARGS_DEPTH (args
)
699 == TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
)),
702 for (s
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
705 if (comp_template_args (TREE_PURPOSE (s
), args
))
706 return TREE_VALUE (s
);
711 /* Like retrieve_speciailization, but for local declarations. FN is
712 the function in which we are looking for an instantiation. */
715 retrieve_local_specialization (tmpl
, fn
)
719 tree s
= purpose_member (fn
, DECL_TEMPLATE_SPECIALIZATIONS (tmpl
));
720 return s
? TREE_VALUE (s
) : NULL_TREE
;
723 /* Returns non-zero iff DECL is a specialization of TMPL. */
726 is_specialization_of (decl
, tmpl
)
732 if (TREE_CODE (decl
) == FUNCTION_DECL
)
736 t
= DECL_TEMPLATE_INFO (t
) ? DECL_TI_TEMPLATE (t
) : NULL_TREE
)
742 my_friendly_assert (TREE_CODE (decl
) == TYPE_DECL
, 0);
744 for (t
= TREE_TYPE (decl
);
746 t
= CLASSTYPE_USE_TEMPLATE (t
)
747 ? TREE_TYPE (CLASSTYPE_TI_TEMPLATE (t
)) : NULL_TREE
)
748 if (same_type_p (TYPE_MAIN_VARIANT (t
),
749 TYPE_MAIN_VARIANT (TREE_TYPE (tmpl
))))
756 /* Register the specialization SPEC as a specialization of TMPL with
757 the indicated ARGS. Returns SPEC, or an equivalent prior
758 declaration, if available. */
761 register_specialization (spec
, tmpl
, args
)
768 my_friendly_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
, 0);
770 if (TREE_CODE (spec
) == FUNCTION_DECL
771 && uses_template_parms (DECL_TI_ARGS (spec
)))
772 /* This is the FUNCTION_DECL for a partial instantiation. Don't
773 register it; we want the corresponding TEMPLATE_DECL instead.
774 We use `uses_template_parms (DECL_TI_ARGS (spec))' rather than
775 the more obvious `uses_template_parms (spec)' to avoid problems
776 with default function arguments. In particular, given
779 template <class T> void f(T t1, T t = T())
781 the default argument expression is not substituted for in an
782 instantiation unless and until it is actually needed. */
785 /* There should be as many levels of arguments as there are
786 levels of parameters. */
787 my_friendly_assert (TMPL_ARGS_DEPTH (args
)
788 == TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
)),
791 for (s
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
795 tree fn
= TREE_VALUE (s
);
797 /* We can sometimes try to re-register a specialization that we've
798 already got. In particular, regenerate_decl_from_template
799 calls duplicate_decls which will update the specialization
800 list. But, we'll still get called again here anyhow. It's
801 more convenient to simply allow this than to try to prevent it. */
804 else if (comp_template_args (TREE_PURPOSE (s
), args
))
806 if (DECL_TEMPLATE_SPECIALIZATION (spec
))
808 if (DECL_TEMPLATE_INSTANTIATION (fn
))
811 || DECL_EXPLICIT_INSTANTIATION (fn
))
813 cp_error ("specialization of %D after instantiation",
819 /* This situation should occur only if the first
820 specialization is an implicit instantiation,
821 the second is an explicit specialization, and
822 the implicit instantiation has not yet been
823 used. That situation can occur if we have
824 implicitly instantiated a member function and
825 then specialized it later.
827 We can also wind up here if a friend
828 declaration that looked like an instantiation
829 turns out to be a specialization:
831 template <class T> void foo(T);
832 class S { friend void foo<>(int) };
833 template <> void foo(int);
835 We transform the existing DECL in place so that
836 any pointers to it become pointers to the
839 If there was a definition for the template, but
840 not for the specialization, we want this to
841 look as if there is no definition, and vice
843 DECL_INITIAL (fn
) = NULL_TREE
;
844 duplicate_decls (spec
, fn
);
849 else if (DECL_TEMPLATE_SPECIALIZATION (fn
))
851 duplicate_decls (spec
, fn
);
858 DECL_TEMPLATE_SPECIALIZATIONS (tmpl
)
859 = tree_cons (args
, spec
, DECL_TEMPLATE_SPECIALIZATIONS (tmpl
));
864 /* Unregister the specialization SPEC as a specialization of TMPL.
865 Returns nonzero if the SPEC was listed as a specialization of
869 unregister_specialization (spec
, tmpl
)
875 for (s
= &DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
877 s
= &TREE_CHAIN (*s
))
878 if (TREE_VALUE (*s
) == spec
)
880 *s
= TREE_CHAIN (*s
);
887 /* Like register_specialization, but for local declarations. FN is
888 the function in which we are registering SPEC, an instantiation of
892 register_local_specialization (spec
, tmpl
, fn
)
897 DECL_TEMPLATE_SPECIALIZATIONS (tmpl
)
898 = tree_cons (fn
, spec
, DECL_TEMPLATE_SPECIALIZATIONS (tmpl
));
903 /* Print the list of candidate FNS in an error message. */
906 print_candidates (fns
)
911 const char *str
= "candidates are:";
913 for (fn
= fns
; fn
!= NULL_TREE
; fn
= TREE_CHAIN (fn
))
917 for (f
= TREE_VALUE (fn
); f
; f
= OVL_NEXT (f
))
918 cp_error_at ("%s %+#D", str
, OVL_CURRENT (f
));
923 /* Returns the template (one of the functions given by TEMPLATE_ID)
924 which can be specialized to match the indicated DECL with the
925 explicit template args given in TEMPLATE_ID. The DECL may be
926 NULL_TREE if none is available. In that case, the functions in
927 TEMPLATE_ID are non-members.
929 If NEED_MEMBER_TEMPLATE is non-zero the function is known to be a
930 specialization of a member template.
932 The template args (those explicitly specified and those deduced)
933 are output in a newly created vector *TARGS_OUT.
935 If it is impossible to determine the result, an error message is
936 issued. The error_mark_node is returned to indicate failure. */
939 determine_specialization (template_id
, decl
, targs_out
,
940 need_member_template
)
944 int need_member_template
;
949 tree candidates
= NULL_TREE
;
950 tree templates
= NULL_TREE
;
952 *targs_out
= NULL_TREE
;
954 if (template_id
== error_mark_node
)
955 return error_mark_node
;
957 fns
= TREE_OPERAND (template_id
, 0);
958 explicit_targs
= TREE_OPERAND (template_id
, 1);
960 if (fns
== error_mark_node
)
961 return error_mark_node
;
963 /* Check for baselinks. */
964 if (BASELINK_P (fns
))
965 fns
= TREE_VALUE (fns
);
967 if (!is_overloaded_fn (fns
))
969 cp_error ("`%D' is not a function template", fns
);
970 return error_mark_node
;
973 for (; fns
; fns
= OVL_NEXT (fns
))
977 tree fn
= OVL_CURRENT (fns
);
979 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
980 /* DECL might be a specialization of FN. */
982 else if (need_member_template
)
983 /* FN is an ordinary member function, and we need a
984 specialization of a member template. */
986 else if (TREE_CODE (fn
) != FUNCTION_DECL
)
987 /* We can get IDENTIFIER_NODEs here in certain erroneous
990 else if (!DECL_FUNCTION_MEMBER_P (fn
))
991 /* This is just an ordinary non-member function. Nothing can
992 be a specialization of that. */
998 /* This is an ordinary member function. However, since
999 we're here, we can assume it's enclosing class is a
1000 template class. For example,
1002 template <typename T> struct S { void f(); };
1003 template <> void S<int>::f() {}
1005 Here, S<int>::f is a non-template, but S<int> is a
1006 template class. If FN has the same type as DECL, we
1007 might be in business. */
1008 if (!same_type_p (TREE_TYPE (TREE_TYPE (decl
)),
1009 TREE_TYPE (TREE_TYPE (fn
))))
1010 /* The return types differ. */
1013 /* Adjust the type of DECL in case FN is a static member. */
1014 decl_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
1015 if (DECL_STATIC_FUNCTION_P (fn
)
1016 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
1017 decl_arg_types
= TREE_CHAIN (decl_arg_types
);
1019 if (compparms (TYPE_ARG_TYPES (TREE_TYPE (fn
)),
1022 candidates
= tree_cons (NULL_TREE
, fn
, candidates
);
1027 /* See whether this function might be a specialization of this
1029 targs
= get_bindings (tmpl
, decl
, explicit_targs
);
1032 /* We cannot deduce template arguments that when used to
1033 specialize TMPL will produce DECL. */
1036 /* Save this template, and the arguments deduced. */
1037 templates
= tree_cons (targs
, tmpl
, templates
);
1040 if (templates
&& TREE_CHAIN (templates
))
1046 It is possible for a specialization with a given function
1047 signature to be instantiated from more than one function
1048 template. In such cases, explicit specification of the
1049 template arguments must be used to uniquely identify the
1050 function template specialization being specialized.
1052 Note that here, there's no suggestion that we're supposed to
1053 determine which of the candidate templates is most
1054 specialized. However, we, also have:
1058 Partial ordering of overloaded function template
1059 declarations is used in the following contexts to select
1060 the function template to which a function template
1061 specialization refers:
1063 -- when an explicit specialization refers to a function
1066 So, we do use the partial ordering rules, at least for now.
1067 This extension can only serve to make illegal programs legal,
1068 so it's safe. And, there is strong anecdotal evidence that
1069 the committee intended the partial ordering rules to apply;
1070 the EDG front-end has that behavior, and John Spicer claims
1071 that the committee simply forgot to delete the wording in
1072 [temp.expl.spec]. */
1073 tree tmpl
= most_specialized (templates
, decl
, explicit_targs
);
1074 if (tmpl
&& tmpl
!= error_mark_node
)
1076 targs
= get_bindings (tmpl
, decl
, explicit_targs
);
1077 templates
= tree_cons (targs
, tmpl
, NULL_TREE
);
1081 if (templates
== NULL_TREE
&& candidates
== NULL_TREE
)
1083 cp_error_at ("template-id `%D' for `%+D' does not match any template declaration",
1085 return error_mark_node
;
1087 else if ((templates
&& TREE_CHAIN (templates
))
1088 || (candidates
&& TREE_CHAIN (candidates
))
1089 || (templates
&& candidates
))
1091 cp_error_at ("ambiguous template specialization `%D' for `%+D'",
1093 chainon (candidates
, templates
);
1094 print_candidates (candidates
);
1095 return error_mark_node
;
1098 /* We have one, and exactly one, match. */
1101 /* It was a specialization of an ordinary member function in a
1103 *targs_out
= copy_node (DECL_TI_ARGS (TREE_VALUE (candidates
)));
1104 return DECL_TI_TEMPLATE (TREE_VALUE (candidates
));
1107 /* It was a specialization of a template. */
1108 targs
= DECL_TI_ARGS (DECL_RESULT (TREE_VALUE (templates
)));
1109 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (targs
))
1111 *targs_out
= copy_node (targs
);
1112 SET_TMPL_ARGS_LEVEL (*targs_out
,
1113 TMPL_ARGS_DEPTH (*targs_out
),
1114 TREE_PURPOSE (templates
));
1117 *targs_out
= TREE_PURPOSE (templates
);
1118 return TREE_VALUE (templates
);
1121 /* Check to see if the function just declared, as indicated in
1122 DECLARATOR, and in DECL, is a specialization of a function
1123 template. We may also discover that the declaration is an explicit
1124 instantiation at this point.
1126 Returns DECL, or an equivalent declaration that should be used
1127 instead if all goes well. Issues an error message if something is
1128 amiss. Returns error_mark_node if the error is not easily
1131 FLAGS is a bitmask consisting of the following flags:
1133 2: The function has a definition.
1134 4: The function is a friend.
1136 The TEMPLATE_COUNT is the number of references to qualifying
1137 template classes that appeared in the name of the function. For
1140 template <class T> struct S { void f(); };
1143 the TEMPLATE_COUNT would be 1. However, explicitly specialized
1144 classes are not counted in the TEMPLATE_COUNT, so that in
1146 template <class T> struct S {};
1147 template <> struct S<int> { void f(); }
1148 template <> void S<int>::f();
1150 the TEMPLATE_COUNT would be 0. (Note that this declaration is
1151 illegal; there should be no template <>.)
1153 If the function is a specialization, it is marked as such via
1154 DECL_TEMPLATE_SPECIALIZATION. Furthermore, its DECL_TEMPLATE_INFO
1155 is set up correctly, and it is added to the list of specializations
1156 for that template. */
1159 check_explicit_specialization (declarator
, decl
, template_count
, flags
)
1165 int have_def
= flags
& 2;
1166 int is_friend
= flags
& 4;
1167 int specialization
= 0;
1168 int explicit_instantiation
= 0;
1169 int member_specialization
= 0;
1170 tree ctype
= DECL_CLASS_CONTEXT (decl
);
1171 tree dname
= DECL_NAME (decl
);
1174 tsk
= current_tmpl_spec_kind (template_count
);
1179 if (processing_specialization
)
1182 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
1184 else if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
1187 /* This could be something like:
1189 template <class T> void f(T);
1190 class S { friend void f<>(int); } */
1194 /* This case handles bogus declarations like template <>
1195 template <class T> void f<int>(); */
1197 cp_error ("template-id `%D' in declaration of primary template",
1204 case tsk_invalid_member_spec
:
1205 /* The error has already been reported in
1206 check_specialization_scope. */
1207 return error_mark_node
;
1209 case tsk_invalid_expl_inst
:
1210 cp_error ("template parameter list used in explicit instantiation");
1216 cp_error ("definition provided for explicit instantiation");
1218 explicit_instantiation
= 1;
1221 case tsk_excessive_parms
:
1222 cp_error ("too many template parameter lists in declaration of `%D'",
1224 return error_mark_node
;
1228 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
1230 member_specialization
= 1;
1235 case tsk_insufficient_parms
:
1236 if (template_header_count
)
1238 cp_error("too few template parameter lists in declaration of `%D'",
1242 else if (ctype
!= NULL_TREE
1243 && !TYPE_BEING_DEFINED (ctype
)
1244 && CLASSTYPE_TEMPLATE_INSTANTIATION (ctype
)
1247 /* For backwards compatibility, we accept:
1249 template <class T> struct S { void f(); };
1250 void S<int>::f() {} // Missing template <>
1252 That used to be legal C++. */
1255 ("explicit specialization not preceded by `template <>'");
1257 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
1262 if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
1264 /* This case handles bogus declarations like template <>
1265 template <class T> void f<int>(); */
1267 cp_error ("template-id `%D' in declaration of primary template",
1272 if (ctype
&& CLASSTYPE_TEMPLATE_INSTANTIATION (ctype
))
1273 /* This is a specialization of a member template, without
1274 specialization the containing class. Something like:
1276 template <class T> struct S {
1277 template <class U> void f (U);
1279 template <> template <class U> void S<int>::f(U) {}
1281 That's a specialization -- but of the entire template. */
1286 my_friendly_abort (20000309);
1289 if (specialization
|| member_specialization
)
1291 tree t
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
1292 for (; t
; t
= TREE_CHAIN (t
))
1293 if (TREE_PURPOSE (t
))
1296 ("default argument specified in explicit specialization");
1299 if (current_lang_name
== lang_name_c
)
1300 cp_error ("template specialization with C linkage");
1303 if (specialization
|| member_specialization
|| explicit_instantiation
)
1305 tree tmpl
= NULL_TREE
;
1306 tree targs
= NULL_TREE
;
1308 /* Make sure that the declarator is a TEMPLATE_ID_EXPR. */
1309 if (TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
1313 my_friendly_assert (TREE_CODE (declarator
) == IDENTIFIER_NODE
,
1316 fns
= IDENTIFIER_NAMESPACE_VALUE (dname
);
1321 lookup_template_function (fns
, NULL_TREE
);
1324 if (declarator
== error_mark_node
)
1325 return error_mark_node
;
1327 if (ctype
!= NULL_TREE
&& TYPE_BEING_DEFINED (ctype
))
1329 if (!explicit_instantiation
)
1330 /* A specialization in class scope. This is illegal,
1331 but the error will already have been flagged by
1332 check_specialization_scope. */
1333 return error_mark_node
;
1336 /* It's not legal to write an explicit instantiation in
1339 class C { template void f(); }
1341 This case is caught by the parser. However, on
1344 template class C { void f(); };
1346 (which is illegal) we can get here. The error will be
1353 else if (TREE_CODE (TREE_OPERAND (declarator
, 0)) == LOOKUP_EXPR
)
1355 /* A friend declaration. We can't do much, because we don't
1356 know what this resolves to, yet. */
1357 my_friendly_assert (is_friend
!= 0, 0);
1358 my_friendly_assert (!explicit_instantiation
, 0);
1359 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
1362 else if (ctype
!= NULL_TREE
1363 && (TREE_CODE (TREE_OPERAND (declarator
, 0)) ==
1366 /* Find the list of functions in ctype that have the same
1367 name as the declared function. */
1368 tree name
= TREE_OPERAND (declarator
, 0);
1369 tree fns
= NULL_TREE
;
1372 if (name
== constructor_name (ctype
)
1373 || name
== constructor_name_full (ctype
))
1375 int is_constructor
= DECL_CONSTRUCTOR_P (decl
);
1377 if (is_constructor
? !TYPE_HAS_CONSTRUCTOR (ctype
)
1378 : !TYPE_HAS_DESTRUCTOR (ctype
))
1380 /* From [temp.expl.spec]:
1382 If such an explicit specialization for the member
1383 of a class template names an implicitly-declared
1384 special member function (clause _special_), the
1385 program is ill-formed.
1387 Similar language is found in [temp.explicit]. */
1388 cp_error ("specialization of implicitly-declared special member function");
1389 return error_mark_node
;
1392 name
= is_constructor
? ctor_identifier
: dtor_identifier
;
1395 if (!IDENTIFIER_TYPENAME_P (name
))
1397 idx
= lookup_fnfields_1 (ctype
, name
);
1399 fns
= TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (ctype
), idx
);
1405 /* For a type-conversion operator, we cannot do a
1406 name-based lookup. We might be looking for `operator
1407 int' which will be a specialization of `operator T'.
1408 So, we find *all* the conversion operators, and then
1409 select from them. */
1412 methods
= CLASSTYPE_METHOD_VEC (ctype
);
1414 for (idx
= 2; idx
< TREE_VEC_LENGTH (methods
); ++idx
)
1416 tree ovl
= TREE_VEC_ELT (methods
, idx
);
1418 if (!ovl
|| !DECL_CONV_FN_P (OVL_CURRENT (ovl
)))
1419 /* There are no more conversion functions. */
1422 /* Glue all these conversion functions together
1423 with those we already have. */
1424 for (; ovl
; ovl
= OVL_NEXT (ovl
))
1425 fns
= ovl_cons (OVL_CURRENT (ovl
), fns
);
1429 if (fns
== NULL_TREE
)
1431 cp_error ("no member function `%D' declared in `%T'",
1433 return error_mark_node
;
1436 TREE_OPERAND (declarator
, 0) = fns
;
1439 /* Figure out what exactly is being specialized at this point.
1440 Note that for an explicit instantiation, even one for a
1441 member function, we cannot tell apriori whether the
1442 instantiation is for a member template, or just a member
1443 function of a template class. Even if a member template is
1444 being instantiated, the member template arguments may be
1445 elided if they can be deduced from the rest of the
1447 tmpl
= determine_specialization (declarator
, decl
,
1449 member_specialization
);
1451 if (!tmpl
|| tmpl
== error_mark_node
)
1452 /* We couldn't figure out what this declaration was
1454 return error_mark_node
;
1457 tree gen_tmpl
= most_general_template (tmpl
);
1459 if (explicit_instantiation
)
1461 /* We don't set DECL_EXPLICIT_INSTANTIATION here; that
1462 is done by do_decl_instantiation later. */
1464 int arg_depth
= TMPL_ARGS_DEPTH (targs
);
1465 int parm_depth
= TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
));
1467 if (arg_depth
> parm_depth
)
1469 /* If TMPL is not the most general template (for
1470 example, if TMPL is a friend template that is
1471 injected into namespace scope), then there will
1472 be too many levels fo TARGS. Remove some of them
1477 new_targs
= make_tree_vec (parm_depth
);
1478 for (i
= arg_depth
- parm_depth
; i
< arg_depth
; ++i
)
1479 TREE_VEC_ELT (new_targs
, i
- (arg_depth
- parm_depth
))
1480 = TREE_VEC_ELT (targs
, i
);
1484 return instantiate_template (tmpl
, targs
);
1487 /* If this is both a template specialization, then it's a
1488 specialization of a member template of a template class.
1489 In that case we want to return the TEMPLATE_DECL, not the
1490 specialization of it. */
1491 if (tsk
== tsk_template
)
1493 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
1497 /* If we though that the DECL was a member function, but it
1498 turns out to be specializing a static member function,
1499 make DECL a static member function as well. */
1500 if (DECL_STATIC_FUNCTION_P (tmpl
)
1501 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
1503 revert_static_member_fn (decl
);
1504 last_function_parms
= TREE_CHAIN (last_function_parms
);
1507 /* Set up the DECL_TEMPLATE_INFO for DECL. */
1508 DECL_TEMPLATE_INFO (decl
) = tree_cons (tmpl
, targs
, NULL_TREE
);
1510 /* Mangle the function name appropriately. Note that we do
1511 not mangle specializations of non-template member
1512 functions of template classes, e.g. with
1514 template <class T> struct S { void f(); }
1516 and given the specialization
1518 template <> void S<int>::f() {}
1520 we do not mangle S<int>::f() here. That's because it's
1521 just an ordinary member function and doesn't need special
1522 treatment. We do this here so that the ordinary,
1523 non-template, name-mangling algorithm will not be used
1525 if ((is_member_template (tmpl
) || ctype
== NULL_TREE
)
1526 && name_mangling_version
>= 1)
1527 set_mangled_name_for_template_decl (decl
);
1529 if (is_friend
&& !have_def
)
1530 /* This is not really a declaration of a specialization.
1531 It's just the name of an instantiation. But, it's not
1532 a request for an instantiation, either. */
1533 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
1535 /* Register this specialization so that we can find it
1537 decl
= register_specialization (decl
, gen_tmpl
, targs
);
1544 /* TYPE is being declared. Verify that the use of template headers
1545 and such is reasonable. Issue error messages if not. */
1548 maybe_check_template_type (type
)
1551 if (template_header_count
)
1553 /* We are in the scope of some `template <...>' header. */
1556 = template_class_depth_real (TYPE_CONTEXT (type
),
1557 /*count_specializations=*/1);
1559 if (template_header_count
<= context_depth
)
1560 /* This is OK; the template headers are for the context. We
1561 are actually too lenient here; like
1562 check_explicit_specialization we should consider the number
1563 of template types included in the actual declaration. For
1566 template <class T> struct S {
1567 template <class U> template <class V>
1573 template <class T> struct S {
1574 template <class U> struct I;
1577 template <class T> template <class U.
1582 else if (template_header_count
> context_depth
+ 1)
1583 /* There are two many template parameter lists. */
1584 cp_error ("too many template parameter lists in declaration of `%T'", type
);
1588 /* Returns 1 iff PARMS1 and PARMS2 are identical sets of template
1589 parameters. These are represented in the same format used for
1590 DECL_TEMPLATE_PARMS. */
1592 int comp_template_parms (parms1
, parms2
)
1599 if (parms1
== parms2
)
1602 for (p1
= parms1
, p2
= parms2
;
1603 p1
!= NULL_TREE
&& p2
!= NULL_TREE
;
1604 p1
= TREE_CHAIN (p1
), p2
= TREE_CHAIN (p2
))
1606 tree t1
= TREE_VALUE (p1
);
1607 tree t2
= TREE_VALUE (p2
);
1610 my_friendly_assert (TREE_CODE (t1
) == TREE_VEC
, 0);
1611 my_friendly_assert (TREE_CODE (t2
) == TREE_VEC
, 0);
1613 if (TREE_VEC_LENGTH (t1
) != TREE_VEC_LENGTH (t2
))
1616 for (i
= 0; i
< TREE_VEC_LENGTH (t2
); ++i
)
1618 tree parm1
= TREE_VALUE (TREE_VEC_ELT (t1
, i
));
1619 tree parm2
= TREE_VALUE (TREE_VEC_ELT (t2
, i
));
1621 if (TREE_CODE (parm1
) != TREE_CODE (parm2
))
1624 if (TREE_CODE (parm1
) == TEMPLATE_TYPE_PARM
)
1626 else if (!same_type_p (TREE_TYPE (parm1
), TREE_TYPE (parm2
)))
1631 if ((p1
!= NULL_TREE
) != (p2
!= NULL_TREE
))
1632 /* One set of parameters has more parameters lists than the
1639 /* Complain if DECL shadows a template parameter.
1641 [temp.local]: A template-parameter shall not be redeclared within its
1642 scope (including nested scopes). */
1645 check_template_shadow (decl
)
1650 /* If we're not in a template, we can't possibly shadow a template
1652 if (!current_template_parms
)
1655 /* Figure out what we're shadowing. */
1656 if (TREE_CODE (decl
) == OVERLOAD
)
1657 decl
= OVL_CURRENT (decl
);
1658 olddecl
= IDENTIFIER_VALUE (DECL_NAME (decl
));
1660 /* If there's no previous binding for this name, we're not shadowing
1661 anything, let alone a template parameter. */
1665 /* If we're not shadowing a template parameter, we're done. Note
1666 that OLDDECL might be an OVERLOAD (or perhaps even an
1667 ERROR_MARK), so we can't just blithely assume it to be a _DECL
1669 if (TREE_CODE_CLASS (TREE_CODE (olddecl
)) != 'd'
1670 || !DECL_TEMPLATE_PARM_P (olddecl
))
1673 /* We check for decl != olddecl to avoid bogus errors for using a
1674 name inside a class. We check TPFI to avoid duplicate errors for
1675 inline member templates. */
1677 || TEMPLATE_PARMS_FOR_INLINE (current_template_parms
))
1680 cp_error_at ("declaration of `%#D'", decl
);
1681 cp_error_at (" shadows template parm `%#D'", olddecl
);
1684 /* Return a new TEMPLATE_PARM_INDEX with the indicated INDEX, LEVEL,
1685 ORIG_LEVEL, DECL, and TYPE. */
1688 build_template_parm_index (index
, level
, orig_level
, decl
, type
)
1695 tree t
= make_node (TEMPLATE_PARM_INDEX
);
1696 TEMPLATE_PARM_IDX (t
) = index
;
1697 TEMPLATE_PARM_LEVEL (t
) = level
;
1698 TEMPLATE_PARM_ORIG_LEVEL (t
) = orig_level
;
1699 TEMPLATE_PARM_DECL (t
) = decl
;
1700 TREE_TYPE (t
) = type
;
1705 /* Return a TEMPLATE_PARM_INDEX, similar to INDEX, but whose
1706 TEMPLATE_PARM_LEVEL has been decreased by LEVELS. If such a
1707 TEMPLATE_PARM_INDEX already exists, it is returned; otherwise, a
1708 new one is created. */
1711 reduce_template_parm_level (index
, type
, levels
)
1716 if (TEMPLATE_PARM_DESCENDANTS (index
) == NULL_TREE
1717 || (TEMPLATE_PARM_LEVEL (TEMPLATE_PARM_DESCENDANTS (index
))
1718 != TEMPLATE_PARM_LEVEL (index
) - levels
))
1721 = build_decl (TREE_CODE (TEMPLATE_PARM_DECL (index
)),
1722 DECL_NAME (TEMPLATE_PARM_DECL (index
)),
1725 = build_template_parm_index (TEMPLATE_PARM_IDX (index
),
1726 TEMPLATE_PARM_LEVEL (index
) - levels
,
1727 TEMPLATE_PARM_ORIG_LEVEL (index
),
1729 TEMPLATE_PARM_DESCENDANTS (index
) = t
;
1731 /* Template template parameters need this. */
1732 DECL_TEMPLATE_PARMS (decl
)
1733 = DECL_TEMPLATE_PARMS (TEMPLATE_PARM_DECL (index
));
1736 return TEMPLATE_PARM_DESCENDANTS (index
);
1739 /* Process information from new template parameter NEXT and append it to the
1740 LIST being built. */
1743 process_template_parm (list
, next
)
1752 my_friendly_assert (TREE_CODE (parm
) == TREE_LIST
, 259);
1753 defval
= TREE_PURPOSE (parm
);
1754 parm
= TREE_VALUE (parm
);
1755 is_type
= TREE_PURPOSE (parm
) == class_type_node
;
1759 tree p
= TREE_VALUE (tree_last (list
));
1761 if (TREE_CODE (p
) == TYPE_DECL
)
1762 idx
= TEMPLATE_TYPE_IDX (TREE_TYPE (p
));
1763 else if (TREE_CODE (p
) == TEMPLATE_DECL
)
1764 idx
= TEMPLATE_TYPE_IDX (TREE_TYPE (DECL_TEMPLATE_RESULT (p
)));
1766 idx
= TEMPLATE_PARM_IDX (DECL_INITIAL (p
));
1774 my_friendly_assert (TREE_CODE (TREE_PURPOSE (parm
)) == TREE_LIST
, 260);
1775 /* is a const-param */
1776 parm
= grokdeclarator (TREE_VALUE (parm
), TREE_PURPOSE (parm
),
1777 PARM
, 0, NULL_TREE
);
1781 The top-level cv-qualifiers on the template-parameter are
1782 ignored when determining its type. */
1783 TREE_TYPE (parm
) = TYPE_MAIN_VARIANT (TREE_TYPE (parm
));
1785 /* A template parameter is not modifiable. */
1786 TREE_READONLY (parm
) = 1;
1787 if (IS_AGGR_TYPE (TREE_TYPE (parm
))
1788 && TREE_CODE (TREE_TYPE (parm
)) != TEMPLATE_TYPE_PARM
1789 && TREE_CODE (TREE_TYPE (parm
)) != TYPENAME_TYPE
)
1791 cp_error ("`%#T' is not a valid type for a template constant parameter",
1793 if (DECL_NAME (parm
) == NULL_TREE
)
1794 error (" a template type parameter must begin with `class' or `typename'");
1795 TREE_TYPE (parm
) = void_type_node
;
1798 && (TREE_CODE (TREE_TYPE (parm
)) == REAL_TYPE
1799 || TREE_CODE (TREE_TYPE (parm
)) == COMPLEX_TYPE
))
1800 cp_pedwarn ("`%T' is not a valid type for a template constant parameter",
1802 decl
= build_decl (CONST_DECL
, DECL_NAME (parm
), TREE_TYPE (parm
));
1803 DECL_INITIAL (parm
) = DECL_INITIAL (decl
)
1804 = build_template_parm_index (idx
, processing_template_decl
,
1805 processing_template_decl
,
1806 decl
, TREE_TYPE (parm
));
1811 parm
= TREE_VALUE (parm
);
1813 if (parm
&& TREE_CODE (parm
) == TEMPLATE_DECL
)
1815 t
= make_aggr_type (TEMPLATE_TEMPLATE_PARM
);
1816 /* This is for distinguishing between real templates and template
1817 template parameters */
1818 TREE_TYPE (parm
) = t
;
1819 TREE_TYPE (DECL_TEMPLATE_RESULT (parm
)) = t
;
1824 t
= make_aggr_type (TEMPLATE_TYPE_PARM
);
1825 /* parm is either IDENTIFIER_NODE or NULL_TREE */
1826 decl
= build_decl (TYPE_DECL
, parm
, t
);
1829 TYPE_NAME (t
) = decl
;
1830 TYPE_STUB_DECL (t
) = decl
;
1832 TEMPLATE_TYPE_PARM_INDEX (t
)
1833 = build_template_parm_index (idx
, processing_template_decl
,
1834 processing_template_decl
,
1835 decl
, TREE_TYPE (parm
));
1837 SET_DECL_ARTIFICIAL (decl
);
1838 SET_DECL_TEMPLATE_PARM_P (decl
);
1840 parm
= build_tree_list (defval
, parm
);
1841 return chainon (list
, parm
);
1844 /* The end of a template parameter list has been reached. Process the
1845 tree list into a parameter vector, converting each parameter into a more
1846 useful form. Type parameters are saved as IDENTIFIER_NODEs, and others
1850 end_template_parm_list (parms
)
1855 tree saved_parmlist
= make_tree_vec (list_length (parms
));
1857 current_template_parms
1858 = tree_cons (build_int_2 (0, processing_template_decl
),
1859 saved_parmlist
, current_template_parms
);
1861 for (parm
= parms
, nparms
= 0;
1863 parm
= TREE_CHAIN (parm
), nparms
++)
1864 TREE_VEC_ELT (saved_parmlist
, nparms
) = parm
;
1866 --processing_template_parmlist
;
1868 return saved_parmlist
;
1871 /* end_template_decl is called after a template declaration is seen. */
1874 end_template_decl ()
1876 reset_specialization ();
1878 if (! processing_template_decl
)
1881 /* This matches the pushlevel in begin_template_parm_list. */
1884 --processing_template_decl
;
1885 current_template_parms
= TREE_CHAIN (current_template_parms
);
1888 /* Given a template argument vector containing the template PARMS.
1889 The innermost PARMS are given first. */
1892 current_template_args ()
1895 tree args
= NULL_TREE
;
1896 int length
= TMPL_PARMS_DEPTH (current_template_parms
);
1899 /* If there is only one level of template parameters, we do not
1900 create a TREE_VEC of TREE_VECs. Instead, we return a single
1901 TREE_VEC containing the arguments. */
1903 args
= make_tree_vec (length
);
1905 for (header
= current_template_parms
; header
; header
= TREE_CHAIN (header
))
1907 tree a
= copy_node (TREE_VALUE (header
));
1910 TREE_TYPE (a
) = NULL_TREE
;
1911 for (i
= TREE_VEC_LENGTH (a
) - 1; i
>= 0; --i
)
1913 tree t
= TREE_VEC_ELT (a
, i
);
1915 /* T will be a list if we are called from within a
1916 begin/end_template_parm_list pair, but a vector directly
1917 if within a begin/end_member_template_processing pair. */
1918 if (TREE_CODE (t
) == TREE_LIST
)
1922 if (TREE_CODE (t
) == TYPE_DECL
1923 || TREE_CODE (t
) == TEMPLATE_DECL
)
1926 t
= DECL_INITIAL (t
);
1927 TREE_VEC_ELT (a
, i
) = t
;
1932 TREE_VEC_ELT (args
, --l
) = a
;
1940 /* Return a TEMPLATE_DECL corresponding to DECL, using the indicated
1941 template PARMS. Used by push_template_decl below. */
1944 build_template_decl (decl
, parms
)
1948 tree tmpl
= build_lang_decl (TEMPLATE_DECL
, DECL_NAME (decl
), NULL_TREE
);
1949 DECL_TEMPLATE_PARMS (tmpl
) = parms
;
1950 DECL_CONTEXT (tmpl
) = DECL_CONTEXT (decl
);
1951 if (DECL_LANG_SPECIFIC (decl
))
1953 DECL_VIRTUAL_CONTEXT (tmpl
) = DECL_VIRTUAL_CONTEXT (decl
);
1954 DECL_STATIC_FUNCTION_P (tmpl
) = DECL_STATIC_FUNCTION_P (decl
);
1955 DECL_CONSTRUCTOR_P (tmpl
) = DECL_CONSTRUCTOR_P (decl
);
1956 DECL_NONCONVERTING_P (tmpl
) = DECL_NONCONVERTING_P (decl
);
1962 struct template_parm_data
1964 /* The level of the template parameters we are currently
1968 /* The index of the specialization argument we are currently
1972 /* An array whose size is the number of template parameters. The
1973 elements are non-zero if the parameter has been used in any one
1974 of the arguments processed so far. */
1977 /* An array whose size is the number of template arguments. The
1978 elements are non-zero if the argument makes use of template
1979 parameters of this level. */
1980 int* arg_uses_template_parms
;
1983 /* Subroutine of push_template_decl used to see if each template
1984 parameter in a partial specialization is used in the explicit
1985 argument list. If T is of the LEVEL given in DATA (which is
1986 treated as a template_parm_data*), then DATA->PARMS is marked
1990 mark_template_parm (t
, data
)
1996 struct template_parm_data
* tpd
= (struct template_parm_data
*) data
;
1998 if (TREE_CODE (t
) == TEMPLATE_PARM_INDEX
)
2000 level
= TEMPLATE_PARM_LEVEL (t
);
2001 idx
= TEMPLATE_PARM_IDX (t
);
2005 level
= TEMPLATE_TYPE_LEVEL (t
);
2006 idx
= TEMPLATE_TYPE_IDX (t
);
2009 if (level
== tpd
->level
)
2011 tpd
->parms
[idx
] = 1;
2012 tpd
->arg_uses_template_parms
[tpd
->current_arg
] = 1;
2015 /* Return zero so that for_each_template_parm will continue the
2016 traversal of the tree; we want to mark *every* template parm. */
2020 /* Process the partial specialization DECL. */
2023 process_partial_specialization (decl
)
2026 tree type
= TREE_TYPE (decl
);
2027 tree maintmpl
= CLASSTYPE_TI_TEMPLATE (type
);
2028 tree specargs
= CLASSTYPE_TI_ARGS (type
);
2029 tree inner_args
= innermost_args (specargs
);
2030 tree inner_parms
= INNERMOST_TEMPLATE_PARMS (current_template_parms
);
2031 tree main_inner_parms
= DECL_INNERMOST_TEMPLATE_PARMS (maintmpl
);
2032 int nargs
= TREE_VEC_LENGTH (inner_args
);
2033 int ntparms
= TREE_VEC_LENGTH (inner_parms
);
2035 int did_error_intro
= 0;
2036 struct template_parm_data tpd
;
2037 struct template_parm_data tpd2
;
2039 /* We check that each of the template parameters given in the
2040 partial specialization is used in the argument list to the
2041 specialization. For example:
2043 template <class T> struct S;
2044 template <class T> struct S<T*>;
2046 The second declaration is OK because `T*' uses the template
2047 parameter T, whereas
2049 template <class T> struct S<int>;
2051 is no good. Even trickier is:
2062 The S2<T> declaration is actually illegal; it is a
2063 full-specialization. Of course,
2066 struct S2<T (*)(U)>;
2068 or some such would have been OK. */
2069 tpd
.level
= TMPL_PARMS_DEPTH (current_template_parms
);
2070 tpd
.parms
= alloca (sizeof (int) * ntparms
);
2071 bzero ((PTR
) tpd
.parms
, sizeof (int) * ntparms
);
2073 tpd
.arg_uses_template_parms
= alloca (sizeof (int) * nargs
);
2074 bzero ((PTR
) tpd
.arg_uses_template_parms
, sizeof (int) * nargs
);
2075 for (i
= 0; i
< nargs
; ++i
)
2077 tpd
.current_arg
= i
;
2078 for_each_template_parm (TREE_VEC_ELT (inner_args
, i
),
2079 &mark_template_parm
,
2082 for (i
= 0; i
< ntparms
; ++i
)
2083 if (tpd
.parms
[i
] == 0)
2085 /* One of the template parms was not used in the
2087 if (!did_error_intro
)
2089 cp_error ("template parameters not used in partial specialization:");
2090 did_error_intro
= 1;
2094 TREE_VALUE (TREE_VEC_ELT (inner_parms
, i
)));
2097 /* [temp.class.spec]
2099 The argument list of the specialization shall not be identical to
2100 the implicit argument list of the primary template. */
2101 if (comp_template_args (inner_args
,
2102 innermost_args (CLASSTYPE_TI_ARGS (TREE_TYPE
2104 cp_error ("partial specialization `%T' does not specialize any template arguments", type
);
2106 /* [temp.class.spec]
2108 A partially specialized non-type argument expression shall not
2109 involve template parameters of the partial specialization except
2110 when the argument expression is a simple identifier.
2112 The type of a template parameter corresponding to a specialized
2113 non-type argument shall not be dependent on a parameter of the
2115 my_friendly_assert (nargs
== DECL_NTPARMS (maintmpl
), 0);
2117 for (i
= 0; i
< nargs
; ++i
)
2119 tree arg
= TREE_VEC_ELT (inner_args
, i
);
2120 if (/* These first two lines are the `non-type' bit. */
2121 TREE_CODE_CLASS (TREE_CODE (arg
)) != 't'
2122 && TREE_CODE (arg
) != TEMPLATE_DECL
2123 /* This next line is the `argument expression is not just a
2124 simple identifier' condition and also the `specialized
2125 non-type argument' bit. */
2126 && TREE_CODE (arg
) != TEMPLATE_PARM_INDEX
)
2128 if (tpd
.arg_uses_template_parms
[i
])
2129 cp_error ("template argument `%E' involves template parameter(s)", arg
);
2132 /* Look at the corresponding template parameter,
2133 marking which template parameters its type depends
2136 TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (main_inner_parms
,
2141 /* We haven't yet initialized TPD2. Do so now. */
2142 tpd2
.arg_uses_template_parms
2143 = (int*) alloca (sizeof (int) * nargs
);
2144 /* The number of parameters here is the number in the
2145 main template, which, as checked in the assertion
2147 tpd2
.parms
= (int*) alloca (sizeof (int) * nargs
);
2149 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (maintmpl
));
2152 /* Mark the template parameters. But this time, we're
2153 looking for the template parameters of the main
2154 template, not in the specialization. */
2155 tpd2
.current_arg
= i
;
2156 tpd2
.arg_uses_template_parms
[i
] = 0;
2157 bzero ((PTR
) tpd2
.parms
, sizeof (int) * nargs
);
2158 for_each_template_parm (type
,
2159 &mark_template_parm
,
2162 if (tpd2
.arg_uses_template_parms
[i
])
2164 /* The type depended on some template parameters.
2165 If they are fully specialized in the
2166 specialization, that's OK. */
2168 for (j
= 0; j
< nargs
; ++j
)
2169 if (tpd2
.parms
[j
] != 0
2170 && tpd
.arg_uses_template_parms
[j
])
2172 cp_error ("type `%T' of template argument `%E' depends on template parameter(s)",
2182 if (retrieve_specialization (maintmpl
, specargs
))
2183 /* We've already got this specialization. */
2186 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
) = CLASSTYPE_TI_SPEC_INFO (type
)
2187 = tree_cons (inner_args
, inner_parms
,
2188 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
));
2189 TREE_TYPE (DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)) = type
;
2193 /* Check that a template declaration's use of default arguments is not
2194 invalid. Here, PARMS are the template parameters. IS_PRIMARY is
2195 non-zero if DECL is the thing declared by a primary template.
2196 IS_PARTIAL is non-zero if DECL is a partial specialization. */
2199 check_default_tmpl_args (decl
, parms
, is_primary
, is_partial
)
2206 int last_level_to_check
;
2211 A default template-argument shall not be specified in a
2212 function template declaration or a function template definition, nor
2213 in the template-parameter-list of the definition of a member of a
2216 if (TREE_CODE (CP_DECL_CONTEXT (decl
)) == FUNCTION_DECL
)
2217 /* You can't have a function template declaration in a local
2218 scope, nor you can you define a member of a class template in a
2222 if (current_class_type
2223 && !TYPE_BEING_DEFINED (current_class_type
)
2224 && DECL_LANG_SPECIFIC (decl
)
2225 /* If this is either a friend defined in the scope of the class
2226 or a member function. */
2227 && ((DECL_CONTEXT (decl
)
2228 && same_type_p (DECL_CONTEXT (decl
), current_class_type
))
2229 || (DECL_FRIEND_CONTEXT (decl
)
2230 && same_type_p (DECL_FRIEND_CONTEXT (decl
),
2231 current_class_type
)))
2232 /* And, if it was a member function, it really was defined in
2233 the scope of the class. */
2234 && (!DECL_FUNCTION_MEMBER_P (decl
) || DECL_DEFINED_IN_CLASS_P (decl
)))
2235 /* We already checked these parameters when the template was
2236 declared, so there's no need to do it again now. This function
2237 was defined in class scope, but we're processing it's body now
2238 that the class is complete. */
2243 If a template-parameter has a default template-argument, all
2244 subsequent template-parameters shall have a default
2245 template-argument supplied. */
2246 for (parm_level
= parms
; parm_level
; parm_level
= TREE_CHAIN (parm_level
))
2248 tree inner_parms
= TREE_VALUE (parm_level
);
2249 int ntparms
= TREE_VEC_LENGTH (inner_parms
);
2250 int seen_def_arg_p
= 0;
2253 for (i
= 0; i
< ntparms
; ++i
)
2255 tree parm
= TREE_VEC_ELT (inner_parms
, i
);
2256 if (TREE_PURPOSE (parm
))
2258 else if (seen_def_arg_p
)
2260 cp_error ("no default argument for `%D'", TREE_VALUE (parm
));
2261 /* For better subsequent error-recovery, we indicate that
2262 there should have been a default argument. */
2263 TREE_PURPOSE (parm
) = error_mark_node
;
2268 if (TREE_CODE (decl
) != TYPE_DECL
|| is_partial
|| !is_primary
)
2269 /* For an ordinary class template, default template arguments are
2270 allowed at the innermost level, e.g.:
2271 template <class T = int>
2273 but, in a partial specialization, they're not allowed even
2274 there, as we have in [temp.class.spec]:
2276 The template parameter list of a specialization shall not
2277 contain default template argument values.
2279 So, for a partial specialization, or for a function template,
2280 we look at all of them. */
2283 /* But, for a primary class template that is not a partial
2284 specialization we look at all template parameters except the
2286 parms
= TREE_CHAIN (parms
);
2288 /* Figure out what error message to issue. */
2289 if (TREE_CODE (decl
) == FUNCTION_DECL
)
2290 msg
= "default argument for template parameter in function template `%D'";
2291 else if (is_partial
)
2292 msg
= "default argument in partial specialization `%D'";
2294 msg
= "default argument for template parameter for class enclosing `%D'";
2296 if (current_class_type
&& TYPE_BEING_DEFINED (current_class_type
))
2297 /* If we're inside a class definition, there's no need to
2298 examine the parameters to the class itself. On the one
2299 hand, they will be checked when the class is defined, and,
2300 on the other, default arguments are legal in things like:
2301 template <class T = double>
2302 struct S { template <class U> void f(U); };
2303 Here the default argument for `S' has no bearing on the
2304 declaration of `f'. */
2305 last_level_to_check
= template_class_depth (current_class_type
) + 1;
2307 /* Check everything. */
2308 last_level_to_check
= 0;
2310 for (parm_level
= parms
;
2311 parm_level
&& TMPL_PARMS_DEPTH (parm_level
) >= last_level_to_check
;
2312 parm_level
= TREE_CHAIN (parm_level
))
2314 tree inner_parms
= TREE_VALUE (parm_level
);
2318 ntparms
= TREE_VEC_LENGTH (inner_parms
);
2319 for (i
= 0; i
< ntparms
; ++i
)
2320 if (TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)))
2324 cp_error (msg
, decl
);
2328 /* Clear out the default argument so that we are not
2330 TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)) = NULL_TREE
;
2333 /* At this point, if we're still interested in issuing messages,
2334 they must apply to classes surrounding the object declared. */
2336 msg
= "default argument for template parameter for class enclosing `%D'";
2340 /* Creates a TEMPLATE_DECL for the indicated DECL using the template
2341 parameters given by current_template_args, or reuses a
2342 previously existing one, if appropriate. Returns the DECL, or an
2343 equivalent one, if it is replaced via a call to duplicate_decls.
2345 If IS_FRIEND is non-zero, DECL is a friend declaration. */
2348 push_template_decl_real (decl
, is_friend
)
2358 int new_template_p
= 0;
2360 /* See if this is a partial specialization. */
2361 is_partial
= (DECL_IMPLICIT_TYPEDEF_P (decl
)
2362 && TREE_CODE (TREE_TYPE (decl
)) != ENUMERAL_TYPE
2363 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl
)));
2365 is_friend
|= (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_FRIEND_P (decl
));
2368 /* For a friend, we want the context of the friend function, not
2369 the type of which it is a friend. */
2370 ctx
= DECL_CONTEXT (decl
);
2371 else if (CP_DECL_CONTEXT (decl
)
2372 && TREE_CODE (CP_DECL_CONTEXT (decl
)) != NAMESPACE_DECL
)
2373 /* In the case of a virtual function, we want the class in which
2375 ctx
= CP_DECL_CONTEXT (decl
);
2377 /* Otherwise, if we're currently definining some class, the DECL
2378 is assumed to be a member of the class. */
2379 ctx
= current_scope ();
2381 if (ctx
&& TREE_CODE (ctx
) == NAMESPACE_DECL
)
2384 if (!DECL_CONTEXT (decl
))
2385 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
2387 /* See if this is a primary template. */
2388 primary
= template_parm_scope_p ();
2392 if (current_lang_name
== lang_name_c
)
2393 cp_error ("template with C linkage");
2394 else if (TREE_CODE (decl
) == TYPE_DECL
2395 && ANON_AGGRNAME_P (DECL_NAME (decl
)))
2396 cp_error ("template class without a name");
2397 else if ((DECL_IMPLICIT_TYPEDEF_P (decl
)
2398 && CLASS_TYPE_P (TREE_TYPE (decl
)))
2399 || (TREE_CODE (decl
) == VAR_DECL
&& ctx
&& CLASS_TYPE_P (ctx
))
2400 || TREE_CODE (decl
) == FUNCTION_DECL
)
2403 cp_error ("template declaration of `%#D'", decl
);
2406 /* Check to see that the rules regarding the use of default
2407 arguments are not being violated. */
2408 check_default_tmpl_args (decl
, current_template_parms
,
2409 primary
, is_partial
);
2412 return process_partial_specialization (decl
);
2414 args
= current_template_args ();
2417 || TREE_CODE (ctx
) == FUNCTION_DECL
2418 || TYPE_BEING_DEFINED (ctx
)
2419 || (is_friend
&& !DECL_TEMPLATE_INFO (decl
)))
2421 if (DECL_LANG_SPECIFIC (decl
)
2422 && DECL_TEMPLATE_INFO (decl
)
2423 && DECL_TI_TEMPLATE (decl
))
2424 tmpl
= DECL_TI_TEMPLATE (decl
);
2425 /* If DECL is a TYPE_DECL for a class-template, then there won't
2426 be DECL_LANG_SPECIFIC. The information equivalent to
2427 DECL_TEMPLATE_INFO is found in TYPE_TEMPLATE_INFO instead. */
2428 else if (DECL_IMPLICIT_TYPEDEF_P (decl
)
2429 && TYPE_TEMPLATE_INFO (TREE_TYPE (decl
))
2430 && TYPE_TI_TEMPLATE (TREE_TYPE (decl
)))
2432 /* Since a template declaration already existed for this
2433 class-type, we must be redeclaring it here. Make sure
2434 that the redeclaration is legal. */
2435 redeclare_class_template (TREE_TYPE (decl
),
2436 current_template_parms
);
2437 /* We don't need to create a new TEMPLATE_DECL; just use the
2438 one we already had. */
2439 tmpl
= TYPE_TI_TEMPLATE (TREE_TYPE (decl
));
2443 tmpl
= build_template_decl (decl
, current_template_parms
);
2446 if (DECL_LANG_SPECIFIC (decl
)
2447 && DECL_TEMPLATE_SPECIALIZATION (decl
))
2449 /* A specialization of a member template of a template
2451 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
2452 DECL_TEMPLATE_INFO (tmpl
) = DECL_TEMPLATE_INFO (decl
);
2453 DECL_TEMPLATE_INFO (decl
) = NULL_TREE
;
2459 tree a
, t
, current
, parms
;
2462 if (TREE_CODE (decl
) == TYPE_DECL
)
2464 if ((IS_AGGR_TYPE_CODE (TREE_CODE (TREE_TYPE (decl
)))
2465 || TREE_CODE (TREE_TYPE (decl
)) == ENUMERAL_TYPE
)
2466 && TYPE_TEMPLATE_INFO (TREE_TYPE (decl
))
2467 && TYPE_TI_TEMPLATE (TREE_TYPE (decl
)))
2468 tmpl
= TYPE_TI_TEMPLATE (TREE_TYPE (decl
));
2471 cp_error ("`%D' does not declare a template type", decl
);
2475 else if (! DECL_TEMPLATE_INFO (decl
))
2477 cp_error ("template definition of non-template `%#D'", decl
);
2481 tmpl
= DECL_TI_TEMPLATE (decl
);
2483 if (is_member_template (tmpl
)
2484 && DECL_FUNCTION_TEMPLATE_P (tmpl
)
2485 && DECL_TEMPLATE_INFO (decl
) && DECL_TI_ARGS (decl
)
2486 && DECL_TEMPLATE_SPECIALIZATION (decl
))
2490 /* The declaration is a specialization of a member
2491 template, declared outside the class. Therefore, the
2492 innermost template arguments will be NULL, so we
2493 replace them with the arguments determined by the
2494 earlier call to check_explicit_specialization. */
2495 args
= DECL_TI_ARGS (decl
);
2498 = build_template_decl (decl
, current_template_parms
);
2499 DECL_TEMPLATE_RESULT (new_tmpl
) = decl
;
2500 TREE_TYPE (new_tmpl
) = TREE_TYPE (decl
);
2501 DECL_TI_TEMPLATE (decl
) = new_tmpl
;
2502 SET_DECL_TEMPLATE_SPECIALIZATION (new_tmpl
);
2503 DECL_TEMPLATE_INFO (new_tmpl
)
2504 = tree_cons (tmpl
, args
, NULL_TREE
);
2506 register_specialization (new_tmpl
, tmpl
, args
);
2510 /* Make sure the template headers we got make sense. */
2512 parms
= DECL_TEMPLATE_PARMS (tmpl
);
2513 i
= TMPL_PARMS_DEPTH (parms
);
2514 if (TMPL_ARGS_DEPTH (args
) != i
)
2516 cp_error ("expected %d levels of template parms for `%#D', got %d",
2517 i
, decl
, TMPL_ARGS_DEPTH (args
));
2520 for (current
= decl
; i
> 0; --i
, parms
= TREE_CHAIN (parms
))
2522 a
= TMPL_ARGS_LEVEL (args
, i
);
2523 t
= INNERMOST_TEMPLATE_PARMS (parms
);
2525 if (TREE_VEC_LENGTH (t
) != TREE_VEC_LENGTH (a
))
2527 if (current
== decl
)
2528 cp_error ("got %d template parameters for `%#D'",
2529 TREE_VEC_LENGTH (a
), decl
);
2531 cp_error ("got %d template parameters for `%#T'",
2532 TREE_VEC_LENGTH (a
), current
);
2533 cp_error (" but %d required", TREE_VEC_LENGTH (t
));
2536 /* Perhaps we should also check that the parms are used in the
2537 appropriate qualifying scopes in the declarator? */
2539 if (current
== decl
)
2542 current
= TYPE_CONTEXT (current
);
2546 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
2547 TREE_TYPE (tmpl
) = TREE_TYPE (decl
);
2549 /* Push template declarations for global functions and types. Note
2550 that we do not try to push a global template friend declared in a
2551 template class; such a thing may well depend on the template
2552 parameters of the class. */
2553 if (new_template_p
&& !ctx
2554 && !(is_friend
&& template_class_depth (current_class_type
) > 0))
2555 tmpl
= pushdecl_namespace_level (tmpl
);
2558 DECL_PRIMARY_TEMPLATE (tmpl
) = tmpl
;
2560 info
= tree_cons (tmpl
, args
, NULL_TREE
);
2562 if (DECL_IMPLICIT_TYPEDEF_P (decl
))
2564 SET_TYPE_TEMPLATE_INFO (TREE_TYPE (tmpl
), info
);
2565 if ((!ctx
|| TREE_CODE (ctx
) != FUNCTION_DECL
)
2566 && TREE_CODE (TREE_TYPE (decl
)) != ENUMERAL_TYPE
)
2567 DECL_NAME (decl
) = classtype_mangled_name (TREE_TYPE (decl
));
2569 else if (DECL_LANG_SPECIFIC (decl
))
2570 DECL_TEMPLATE_INFO (decl
) = info
;
2572 return DECL_TEMPLATE_RESULT (tmpl
);
2576 push_template_decl (decl
)
2579 return push_template_decl_real (decl
, 0);
2582 /* Called when a class template TYPE is redeclared with the indicated
2583 template PARMS, e.g.:
2585 template <class T> struct S;
2586 template <class T> struct S {}; */
2589 redeclare_class_template (type
, parms
)
2597 if (!TYPE_TEMPLATE_INFO (type
))
2599 cp_error ("`%T' is not a template type", type
);
2603 tmpl
= TYPE_TI_TEMPLATE (type
);
2604 if (!PRIMARY_TEMPLATE_P (tmpl
))
2605 /* The type is nested in some template class. Nothing to worry
2606 about here; there are no new template parameters for the nested
2610 parms
= INNERMOST_TEMPLATE_PARMS (parms
);
2611 tmpl_parms
= DECL_INNERMOST_TEMPLATE_PARMS (tmpl
);
2613 if (TREE_VEC_LENGTH (parms
) != TREE_VEC_LENGTH (tmpl_parms
))
2615 cp_error_at ("previous declaration `%D'", tmpl
);
2616 cp_error ("used %d template parameter%s instead of %d",
2617 TREE_VEC_LENGTH (tmpl_parms
),
2618 TREE_VEC_LENGTH (tmpl_parms
) == 1 ? "" : "s",
2619 TREE_VEC_LENGTH (parms
));
2623 for (i
= 0; i
< TREE_VEC_LENGTH (tmpl_parms
); ++i
)
2625 tree tmpl_parm
= TREE_VALUE (TREE_VEC_ELT (tmpl_parms
, i
));
2626 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
2627 tree tmpl_default
= TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
));
2628 tree parm_default
= TREE_PURPOSE (TREE_VEC_ELT (parms
, i
));
2630 if (TREE_CODE (tmpl_parm
) != TREE_CODE (parm
))
2632 cp_error_at ("template parameter `%#D'", tmpl_parm
);
2633 cp_error ("redeclared here as `%#D'", parm
);
2637 if (tmpl_default
!= NULL_TREE
&& parm_default
!= NULL_TREE
)
2639 /* We have in [temp.param]:
2641 A template-parameter may not be given default arguments
2642 by two different declarations in the same scope. */
2643 cp_error ("redefinition of default argument for `%#D'", parm
);
2644 cp_error_at (" original definition appeared here", tmpl_parm
);
2648 if (parm_default
!= NULL_TREE
)
2649 /* Update the previous template parameters (which are the ones
2650 that will really count) with the new default value. */
2651 TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
)) = parm_default
;
2652 else if (tmpl_default
!= NULL_TREE
)
2653 /* Update the new parameters, too; they'll be used as the
2654 parameters for any members. */
2655 TREE_PURPOSE (TREE_VEC_ELT (parms
, i
)) = tmpl_default
;
2659 /* Attempt to convert the non-type template parameter EXPR to the
2660 indicated TYPE. If the conversion is successful, return the
2661 converted value. If the conversion is unsuccesful, return
2662 NULL_TREE if we issued an error message, or error_mark_node if we
2663 did not. We issue error messages for out-and-out bad template
2664 parameters, but not simply because the conversion failed, since we
2665 might be just trying to do argument deduction. By the time this
2666 function is called, neither TYPE nor EXPR may make use of template
2670 convert_nontype_argument (type
, expr
)
2674 tree expr_type
= TREE_TYPE (expr
);
2676 /* A template-argument for a non-type, non-template
2677 template-parameter shall be one of:
2679 --an integral constant-expression of integral or enumeration
2682 --the name of a non-type template-parameter; or
2684 --the name of an object or function with external linkage,
2685 including function templates and function template-ids but
2686 excluding non-static class members, expressed as id-expression;
2689 --the address of an object or function with external linkage,
2690 including function templates and function template-ids but
2691 excluding non-static class members, expressed as & id-expression
2692 where the & is optional if the name refers to a function or
2695 --a pointer to member expressed as described in _expr.unary.op_. */
2697 /* An integral constant-expression can include const variables or
2698 enumerators. Simplify things by folding them to their values,
2699 unless we're about to bind the declaration to a reference
2701 if (INTEGRAL_TYPE_P (expr_type
) && TREE_READONLY_DECL_P (expr
)
2702 && TREE_CODE (type
) != REFERENCE_TYPE
)
2703 expr
= decl_constant_value (expr
);
2705 if (is_overloaded_fn (expr
))
2706 /* OK for now. We'll check that it has external linkage later.
2707 Check this first since if expr_type is the unknown_type_node
2708 we would otherwise complain below. */
2710 else if (TYPE_PTRMEM_P (expr_type
)
2711 || TYPE_PTRMEMFUNC_P (expr_type
))
2713 if (TREE_CODE (expr
) != PTRMEM_CST
)
2716 else if (TYPE_PTR_P (expr_type
)
2717 || TYPE_PTRMEM_P (expr_type
)
2718 || TREE_CODE (expr_type
) == ARRAY_TYPE
2719 || TREE_CODE (type
) == REFERENCE_TYPE
2720 /* If expr is the address of an overloaded function, we
2721 will get the unknown_type_node at this point. */
2722 || expr_type
== unknown_type_node
)
2728 if (TREE_CODE (type
) == REFERENCE_TYPE
2729 || TREE_CODE (expr_type
) == ARRAY_TYPE
)
2733 if (TREE_CODE (e
) != ADDR_EXPR
)
2736 cp_error ("`%E' is not a valid template argument", expr
);
2737 if (TYPE_PTR_P (expr_type
))
2739 if (TREE_CODE (TREE_TYPE (expr_type
)) == FUNCTION_TYPE
)
2740 cp_error ("it must be the address of a function with external linkage");
2742 cp_error ("it must be the address of an object with external linkage");
2744 else if (TYPE_PTRMEM_P (expr_type
)
2745 || TYPE_PTRMEMFUNC_P (expr_type
))
2746 cp_error ("it must be a pointer-to-member of the form `&X::Y'");
2751 referent
= TREE_OPERAND (e
, 0);
2752 STRIP_NOPS (referent
);
2755 if (TREE_CODE (referent
) == STRING_CST
)
2757 cp_error ("string literal %E is not a valid template argument because it is the address of an object with static linkage",
2762 if (is_overloaded_fn (referent
))
2763 /* We'll check that it has external linkage later. */
2765 else if (TREE_CODE (referent
) != VAR_DECL
)
2767 else if (!TREE_PUBLIC (referent
))
2769 cp_error ("address of non-extern `%E' cannot be used as template argument", referent
);
2770 return error_mark_node
;
2773 else if (INTEGRAL_TYPE_P (expr_type
)
2774 || TYPE_PTRMEM_P (expr_type
)
2775 || TYPE_PTRMEMFUNC_P (expr_type
)
2776 /* The next two are g++ extensions. */
2777 || TREE_CODE (expr_type
) == REAL_TYPE
2778 || TREE_CODE (expr_type
) == COMPLEX_TYPE
)
2780 if (! TREE_CONSTANT (expr
))
2783 cp_error ("non-constant `%E' cannot be used as template argument",
2790 cp_error ("object `%E' cannot be used as template argument", expr
);
2794 switch (TREE_CODE (type
))
2799 /* For a non-type template-parameter of integral or enumeration
2800 type, integral promotions (_conv.prom_) and integral
2801 conversions (_conv.integral_) are applied. */
2802 if (!INTEGRAL_TYPE_P (expr_type
))
2803 return error_mark_node
;
2805 /* It's safe to call digest_init in this case; we know we're
2806 just converting one integral constant expression to another. */
2807 expr
= digest_init (type
, expr
, (tree
*) 0);
2809 if (TREE_CODE (expr
) != INTEGER_CST
)
2810 /* Curiously, some TREE_CONSTANT integral expressions do not
2811 simplify to integer constants. For example, `3 % 0',
2812 remains a TRUNC_MOD_EXPR. */
2819 /* These are g++ extensions. */
2820 if (TREE_CODE (expr_type
) != TREE_CODE (type
))
2821 return error_mark_node
;
2823 expr
= digest_init (type
, expr
, (tree
*) 0);
2825 if (TREE_CODE (expr
) != REAL_CST
)
2832 tree type_pointed_to
= TREE_TYPE (type
);
2834 if (TYPE_PTRMEM_P (type
))
2838 /* For a non-type template-parameter of type pointer to data
2839 member, qualification conversions (_conv.qual_) are
2841 e
= perform_qualification_conversions (type
, expr
);
2842 if (TREE_CODE (e
) == NOP_EXPR
)
2843 /* The call to perform_qualification_conversions will
2844 insert a NOP_EXPR over EXPR to do express conversion,
2845 if necessary. But, that will confuse us if we use
2846 this (converted) template parameter to instantiate
2847 another template; then the thing will not look like a
2848 valid template argument. So, just make a new
2849 constant, of the appropriate type. */
2850 e
= make_ptrmem_cst (type
, PTRMEM_CST_MEMBER (expr
));
2853 else if (TREE_CODE (type_pointed_to
) == FUNCTION_TYPE
)
2855 /* For a non-type template-parameter of type pointer to
2856 function, only the function-to-pointer conversion
2857 (_conv.func_) is applied. If the template-argument
2858 represents a set of overloaded functions (or a pointer to
2859 such), the matching function is selected from the set
2864 if (TREE_CODE (expr
) == ADDR_EXPR
)
2865 fns
= TREE_OPERAND (expr
, 0);
2869 fn
= instantiate_type (type_pointed_to
, fns
, 0);
2871 if (fn
== error_mark_node
)
2872 return error_mark_node
;
2874 if (!TREE_PUBLIC (fn
))
2876 if (really_overloaded_fn (fns
))
2877 return error_mark_node
;
2882 expr
= build_unary_op (ADDR_EXPR
, fn
, 0);
2884 my_friendly_assert (same_type_p (type
, TREE_TYPE (expr
)),
2890 /* For a non-type template-parameter of type pointer to
2891 object, qualification conversions (_conv.qual_) and the
2892 array-to-pointer conversion (_conv.array_) are applied.
2893 [Note: In particular, neither the null pointer conversion
2894 (_conv.ptr_) nor the derived-to-base conversion
2895 (_conv.ptr_) are applied. Although 0 is a valid
2896 template-argument for a non-type template-parameter of
2897 integral type, it is not a valid template-argument for a
2898 non-type template-parameter of pointer type.]
2900 The call to decay_conversion performs the
2901 array-to-pointer conversion, if appropriate. */
2902 expr
= decay_conversion (expr
);
2904 if (expr
== error_mark_node
)
2905 return error_mark_node
;
2907 return perform_qualification_conversions (type
, expr
);
2912 case REFERENCE_TYPE
:
2914 tree type_referred_to
= TREE_TYPE (type
);
2916 if (TREE_CODE (type_referred_to
) == FUNCTION_TYPE
)
2918 /* For a non-type template-parameter of type reference to
2919 function, no conversions apply. If the
2920 template-argument represents a set of overloaded
2921 functions, the matching function is selected from the
2922 set (_over.over_). */
2926 fn
= instantiate_type (type_referred_to
, fns
, 0);
2928 if (fn
== error_mark_node
)
2929 return error_mark_node
;
2931 if (!TREE_PUBLIC (fn
))
2933 if (really_overloaded_fn (fns
))
2934 /* Don't issue an error here; we might get a different
2935 function if the overloading had worked out
2937 return error_mark_node
;
2942 my_friendly_assert (same_type_p (type_referred_to
,
2950 /* For a non-type template-parameter of type reference to
2951 object, no conversions apply. The type referred to by the
2952 reference may be more cv-qualified than the (otherwise
2953 identical) type of the template-argument. The
2954 template-parameter is bound directly to the
2955 template-argument, which must be an lvalue. */
2956 if ((TYPE_MAIN_VARIANT (expr_type
)
2957 != TYPE_MAIN_VARIANT (type_referred_to
))
2958 || !at_least_as_qualified_p (type_referred_to
,
2960 || !real_lvalue_p (expr
))
2961 return error_mark_node
;
2970 if (!TYPE_PTRMEMFUNC_P (type
))
2971 /* This handles templates like
2972 template<class T, T t> void f();
2973 when T is substituted with any class. The second template
2974 parameter becomes invalid and the template candidate is
2976 return error_mark_node
;
2978 /* For a non-type template-parameter of type pointer to member
2979 function, no conversions apply. If the template-argument
2980 represents a set of overloaded member functions, the
2981 matching member function is selected from the set
2984 if (!TYPE_PTRMEMFUNC_P (expr_type
) &&
2985 expr_type
!= unknown_type_node
)
2986 return error_mark_node
;
2988 if (TREE_CODE (expr
) == PTRMEM_CST
)
2990 /* A ptr-to-member constant. */
2991 if (!same_type_p (type
, expr_type
))
2992 return error_mark_node
;
2997 if (TREE_CODE (expr
) != ADDR_EXPR
)
2998 return error_mark_node
;
3000 expr
= instantiate_type (type
, expr
, 0);
3002 if (expr
== error_mark_node
)
3003 return error_mark_node
;
3005 my_friendly_assert (same_type_p (type
, TREE_TYPE (expr
)),
3012 /* All non-type parameters must have one of these types. */
3013 my_friendly_abort (0);
3017 return error_mark_node
;
3020 /* Return 1 if PARM_PARMS and ARG_PARMS matches using rule for
3021 template template parameters. Both PARM_PARMS and ARG_PARMS are
3022 vectors of TREE_LIST nodes containing TYPE_DECL, TEMPLATE_DECL
3025 ARG_PARMS may contain more parameters than PARM_PARMS. If this is
3026 the case, then extra parameters must have default arguments.
3028 Consider the example:
3029 template <class T, class Allocator = allocator> class vector;
3030 template<template <class U> class TT> class C;
3032 C<vector> is a valid instantiation. PARM_PARMS for the above code
3033 contains a TYPE_DECL (for U), ARG_PARMS contains two TYPE_DECLs (for
3034 T and Allocator) and OUTER_ARGS contains the argument that is used to
3035 substitute the TT parameter. */
3038 coerce_template_template_parms (parm_parms
, arg_parms
, complain
,
3039 in_decl
, outer_args
)
3040 tree parm_parms
, arg_parms
;
3042 tree in_decl
, outer_args
;
3044 int nparms
, nargs
, i
;
3047 my_friendly_assert (TREE_CODE (parm_parms
) == TREE_VEC
, 0);
3048 my_friendly_assert (TREE_CODE (arg_parms
) == TREE_VEC
, 0);
3050 nparms
= TREE_VEC_LENGTH (parm_parms
);
3051 nargs
= TREE_VEC_LENGTH (arg_parms
);
3053 /* The rule here is opposite of coerce_template_parms. */
3056 && TREE_PURPOSE (TREE_VEC_ELT (arg_parms
, nparms
)) == NULL_TREE
))
3059 for (i
= 0; i
< nparms
; ++i
)
3061 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, i
));
3062 arg
= TREE_VALUE (TREE_VEC_ELT (arg_parms
, i
));
3064 if (arg
== NULL_TREE
|| arg
== error_mark_node
3065 || parm
== NULL_TREE
|| parm
== error_mark_node
)
3068 if (TREE_CODE (arg
) != TREE_CODE (parm
))
3071 switch (TREE_CODE (parm
))
3077 /* We encounter instantiations of templates like
3078 template <template <template <class> class> class TT>
3081 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
3082 tree argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
3084 if (!coerce_template_template_parms (parmparm
, argparm
,
3092 /* The tsubst call is used to handle cases such as
3093 template <class T, template <T> class TT> class D;
3094 i.e. the parameter list of TT depends on earlier parameters. */
3095 if (!same_type_p (tsubst (TREE_TYPE (parm
), outer_args
,
3102 my_friendly_abort (0);
3108 /* Convert the indicated template ARG as necessary to match the
3109 indicated template PARM. Returns the converted ARG, or
3110 error_mark_node if the conversion was unsuccessful. Error messages
3111 are issued if COMPLAIN is non-zero. This conversion is for the Ith
3112 parameter in the parameter list. ARGS is the full set of template
3113 arguments deduced so far. */
3116 convert_template_argument (parm
, arg
, args
, complain
, i
, in_decl
)
3126 int is_type
, requires_type
, is_tmpl_type
, requires_tmpl_type
;
3128 inner_args
= innermost_args (args
);
3130 if (TREE_CODE (arg
) == TREE_LIST
3131 && TREE_TYPE (arg
) != NULL_TREE
3132 && TREE_CODE (TREE_TYPE (arg
)) == OFFSET_TYPE
)
3134 /* The template argument was the name of some
3135 member function. That's usually
3136 illegal, but static members are OK. In any
3137 case, grab the underlying fields/functions
3138 and issue an error later if required. */
3139 arg
= TREE_VALUE (arg
);
3140 TREE_TYPE (arg
) = unknown_type_node
;
3143 requires_tmpl_type
= TREE_CODE (parm
) == TEMPLATE_DECL
;
3144 requires_type
= (TREE_CODE (parm
) == TYPE_DECL
3145 || requires_tmpl_type
);
3147 /* Check if it is a class template. If REQUIRES_TMPL_TYPE is true,
3148 we also accept implicitly created TYPE_DECL as a valid argument.
3149 This is necessary to handle the case where we pass a template name
3150 to a template template parameter in a scope where we've derived from
3151 in instantiation of that template, so the template name refers to that
3152 instantiation. We really ought to handle this better. */
3154 = ((TREE_CODE (arg
) == TEMPLATE_DECL
3155 && TREE_CODE (DECL_TEMPLATE_RESULT (arg
)) == TYPE_DECL
)
3156 || (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
3157 && !TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (arg
))
3158 || (TREE_CODE (arg
) == RECORD_TYPE
3159 && CLASSTYPE_TEMPLATE_INFO (arg
)
3160 && TREE_CODE (TYPE_NAME (arg
)) == TYPE_DECL
3161 && DECL_ARTIFICIAL (TYPE_NAME (arg
))
3162 && requires_tmpl_type
3163 && is_base_of_enclosing_class (arg
, current_class_type
)));
3164 if (is_tmpl_type
&& TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
3165 arg
= TYPE_STUB_DECL (arg
);
3166 else if (is_tmpl_type
&& TREE_CODE (arg
) == RECORD_TYPE
)
3167 arg
= CLASSTYPE_TI_TEMPLATE (arg
);
3169 is_type
= TREE_CODE_CLASS (TREE_CODE (arg
)) == 't' || is_tmpl_type
;
3171 if (requires_type
&& ! is_type
&& TREE_CODE (arg
) == SCOPE_REF
3172 && TREE_CODE (TREE_OPERAND (arg
, 0)) == TEMPLATE_TYPE_PARM
)
3174 cp_pedwarn ("to refer to a type member of a template parameter, use `typename %E'", arg
);
3176 arg
= make_typename_type (TREE_OPERAND (arg
, 0),
3177 TREE_OPERAND (arg
, 1),
3181 if (is_type
!= requires_type
)
3187 cp_error ("type/value mismatch at argument %d in template parameter list for `%D'",
3190 cp_error (" expected a constant of type `%T', got `%T'",
3192 (is_tmpl_type
? DECL_NAME (arg
) : arg
));
3194 cp_error (" expected a type, got `%E'", arg
);
3197 return error_mark_node
;
3199 if (is_tmpl_type
^ requires_tmpl_type
)
3201 if (in_decl
&& complain
)
3203 cp_error ("type/value mismatch at argument %d in template parameter list for `%D'",
3206 cp_error (" expected a type, got `%T'", DECL_NAME (arg
));
3208 cp_error (" expected a class template, got `%T'", arg
);
3210 return error_mark_node
;
3215 if (requires_tmpl_type
)
3217 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
3218 tree argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
3220 if (coerce_template_template_parms (parmparm
, argparm
, complain
,
3221 in_decl
, inner_args
))
3225 /* TEMPLATE_TEMPLATE_PARM node is preferred over
3227 if (val
!= error_mark_node
3228 && DECL_TEMPLATE_TEMPLATE_PARM_P (val
))
3229 val
= TREE_TYPE (val
);
3233 if (in_decl
&& complain
)
3235 cp_error ("type/value mismatch at argument %d in template parameter list for `%D'",
3237 cp_error (" expected a template of type `%D', got `%D'", parm
, arg
);
3240 val
= error_mark_node
;
3245 val
= groktypename (arg
);
3246 if (! processing_template_decl
)
3248 /* [basic.link]: A name with no linkage (notably, the
3249 name of a class or enumeration declared in a local
3250 scope) shall not be used to declare an entity with
3251 linkage. This implies that names with no linkage
3252 cannot be used as template arguments. */
3253 tree t
= no_linkage_check (val
);
3256 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
3258 ("template-argument `%T' uses anonymous type", val
);
3261 ("template-argument `%T' uses local type `%T'",
3263 return error_mark_node
;
3270 tree t
= tsubst (TREE_TYPE (parm
), args
, complain
, in_decl
);
3272 if (processing_template_decl
)
3273 arg
= maybe_fold_nontype_arg (arg
);
3275 if (!uses_template_parms (arg
) && !uses_template_parms (t
))
3276 /* We used to call digest_init here. However, digest_init
3277 will report errors, which we don't want when complain
3278 is zero. More importantly, digest_init will try too
3279 hard to convert things: for example, `0' should not be
3280 converted to pointer type at this point according to
3281 the standard. Accepting this is not merely an
3282 extension, since deciding whether or not these
3283 conversions can occur is part of determining which
3284 function template to call, or whether a given epxlicit
3285 argument specification is legal. */
3286 val
= convert_nontype_argument (t
, arg
);
3290 if (val
== NULL_TREE
)
3291 val
= error_mark_node
;
3292 else if (val
== error_mark_node
&& complain
)
3293 cp_error ("could not convert template argument `%E' to `%T'",
3300 /* Convert all template arguments to their appropriate types, and
3301 return a vector containing the innermost resulting template
3302 arguments. If any error occurs, return error_mark_node, and, if
3303 COMPLAIN is non-zero, issue an error message. Some error messages
3304 are issued even if COMPLAIN is zero; for instance, if a template
3305 argument is composed from a local class.
3307 If REQUIRE_ALL_ARGUMENTS is non-zero, all arguments must be
3308 provided in ARGLIST, or else trailing parameters must have default
3309 values. If REQUIRE_ALL_ARGUMENTS is zero, we will attempt argument
3310 deduction for any unspecified trailing arguments.
3312 The resulting TREE_VEC is allocated on a temporary obstack, and
3313 must be explicitly copied if it will be permanent. */
3316 coerce_template_parms (parms
, args
, in_decl
,
3318 require_all_arguments
)
3322 int require_all_arguments
;
3324 int nparms
, nargs
, i
, lost
= 0;
3327 tree new_inner_args
;
3329 inner_args
= innermost_args (args
);
3330 nargs
= NUM_TMPL_ARGS (inner_args
);
3331 nparms
= TREE_VEC_LENGTH (parms
);
3335 && require_all_arguments
3336 && TREE_PURPOSE (TREE_VEC_ELT (parms
, nargs
)) == NULL_TREE
))
3340 cp_error ("wrong number of template arguments (%d, should be %d)",
3344 cp_error_at ("provided for `%D'", in_decl
);
3347 return error_mark_node
;
3350 new_inner_args
= make_tree_vec (nparms
);
3351 new_args
= add_outermost_template_args (args
, new_inner_args
);
3352 for (i
= 0; i
< nparms
; i
++)
3357 /* Get the Ith template parameter. */
3358 parm
= TREE_VEC_ELT (parms
, i
);
3360 /* Calculate the Ith argument. */
3361 if (inner_args
&& TREE_CODE (inner_args
) == TREE_LIST
)
3363 arg
= TREE_VALUE (inner_args
);
3364 inner_args
= TREE_CHAIN (inner_args
);
3367 arg
= TREE_VEC_ELT (inner_args
, i
);
3368 /* If no template argument was supplied, look for a default
3370 else if (TREE_PURPOSE (parm
) == NULL_TREE
)
3372 /* There was no default value. */
3373 my_friendly_assert (!require_all_arguments
, 0);
3376 else if (TREE_CODE (TREE_VALUE (parm
)) == TYPE_DECL
)
3377 arg
= tsubst (TREE_PURPOSE (parm
), new_args
, complain
, in_decl
);
3379 arg
= tsubst_expr (TREE_PURPOSE (parm
), new_args
, complain
,
3382 /* Now, convert the Ith argument, as necessary. */
3383 if (arg
== NULL_TREE
)
3384 /* We're out of arguments. */
3386 my_friendly_assert (!require_all_arguments
, 0);
3389 else if (arg
== error_mark_node
)
3391 cp_error ("template argument %d is invalid", i
+ 1);
3392 arg
= error_mark_node
;
3395 arg
= convert_template_argument (TREE_VALUE (parm
),
3396 arg
, new_args
, complain
, i
,
3399 if (arg
== error_mark_node
)
3401 TREE_VEC_ELT (new_inner_args
, i
) = arg
;
3405 return error_mark_node
;
3407 return new_inner_args
;
3410 /* Returns 1 if template args OT and NT are equivalent. */
3413 template_args_equal (ot
, nt
)
3418 if (TREE_CODE (nt
) != TREE_CODE (ot
))
3420 if (TREE_CODE (nt
) == TREE_VEC
)
3421 /* For member templates */
3422 return comp_template_args (ot
, nt
);
3423 else if (TREE_CODE_CLASS (TREE_CODE (ot
)) == 't')
3424 return same_type_p (ot
, nt
);
3426 return (cp_tree_equal (ot
, nt
) > 0);
3429 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets
3430 of template arguments. Returns 0 otherwise. */
3433 comp_template_args (oldargs
, newargs
)
3434 tree oldargs
, newargs
;
3438 if (TREE_VEC_LENGTH (oldargs
) != TREE_VEC_LENGTH (newargs
))
3441 for (i
= 0; i
< TREE_VEC_LENGTH (oldargs
); ++i
)
3443 tree nt
= TREE_VEC_ELT (newargs
, i
);
3444 tree ot
= TREE_VEC_ELT (oldargs
, i
);
3446 if (! template_args_equal (ot
, nt
))
3452 /* Given class template name and parameter list, produce a user-friendly name
3453 for the instantiation. */
3456 mangle_class_name_for_template (name
, parms
, arglist
)
3458 tree parms
, arglist
;
3460 static struct obstack scratch_obstack
;
3461 static char *scratch_firstobj
;
3464 if (!scratch_firstobj
)
3465 gcc_obstack_init (&scratch_obstack
);
3467 obstack_free (&scratch_obstack
, scratch_firstobj
);
3468 scratch_firstobj
= obstack_alloc (&scratch_obstack
, 1);
3470 #define ccat(c) obstack_1grow (&scratch_obstack, (c));
3471 #define cat(s) obstack_grow (&scratch_obstack, (s), strlen (s))
3475 nparms
= TREE_VEC_LENGTH (parms
);
3476 arglist
= innermost_args (arglist
);
3477 my_friendly_assert (nparms
== TREE_VEC_LENGTH (arglist
), 268);
3478 for (i
= 0; i
< nparms
; i
++)
3480 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
3481 tree arg
= TREE_VEC_ELT (arglist
, i
);
3486 if (TREE_CODE (parm
) == TYPE_DECL
)
3488 cat (type_as_string (arg
, TS_CHASE_TYPEDEFS
));
3491 else if (TREE_CODE (parm
) == TEMPLATE_DECL
)
3493 if (TREE_CODE (arg
) == TEMPLATE_DECL
)
3495 /* Already substituted with real template. Just output
3496 the template name here */
3497 tree context
= DECL_CONTEXT (arg
);
3500 /* The template may be defined in a namespace, or
3501 may be a member template. */
3502 my_friendly_assert (TREE_CODE (context
) == NAMESPACE_DECL
3503 || CLASS_TYPE_P (context
),
3505 cat(decl_as_string (DECL_CONTEXT (arg
), 0));
3508 cat (IDENTIFIER_POINTER (DECL_NAME (arg
)));
3511 /* Output the parameter declaration */
3512 cat (type_as_string (arg
, TS_CHASE_TYPEDEFS
));
3516 my_friendly_assert (TREE_CODE (parm
) == PARM_DECL
, 269);
3518 if (TREE_CODE (arg
) == TREE_LIST
)
3520 /* New list cell was built because old chain link was in
3522 my_friendly_assert (TREE_PURPOSE (arg
) == NULL_TREE
, 270);
3523 arg
= TREE_VALUE (arg
);
3525 /* No need to check arglist against parmlist here; we did that
3526 in coerce_template_parms, called from lookup_template_class. */
3527 cat (expr_as_string (arg
, 0));
3530 char *bufp
= obstack_next_free (&scratch_obstack
);
3532 while (bufp
[offset
- 1] == ' ')
3534 obstack_blank_fast (&scratch_obstack
, offset
);
3536 /* B<C<char> >, not B<C<char>> */
3537 if (bufp
[offset
- 1] == '>')
3542 return (char *) obstack_base (&scratch_obstack
);
3546 classtype_mangled_name (t
)
3549 if (CLASSTYPE_TEMPLATE_INFO (t
)
3550 /* Specializations have already had their names set up in
3551 lookup_template_class. */
3552 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
3554 tree tmpl
= most_general_template (CLASSTYPE_TI_TEMPLATE (t
));
3556 /* For non-primary templates, the template parameters are
3557 implicit from their surrounding context. */
3558 if (PRIMARY_TEMPLATE_P (tmpl
))
3560 tree name
= DECL_NAME (tmpl
);
3561 char *mangled_name
= mangle_class_name_for_template
3562 (IDENTIFIER_POINTER (name
),
3563 DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
3564 CLASSTYPE_TI_ARGS (t
));
3565 tree id
= get_identifier (mangled_name
);
3566 IDENTIFIER_TEMPLATE (id
) = name
;
3571 return TYPE_IDENTIFIER (t
);
3575 add_pending_template (d
)
3580 if (TREE_CODE_CLASS (TREE_CODE (d
)) == 't')
3581 ti
= CLASSTYPE_TEMPLATE_INFO (d
);
3583 ti
= DECL_TEMPLATE_INFO (d
);
3585 if (TI_PENDING_TEMPLATE_FLAG (ti
))
3588 *template_tail
= tree_cons (build_srcloc_here (), d
, NULL_TREE
);
3589 template_tail
= &TREE_CHAIN (*template_tail
);
3590 TI_PENDING_TEMPLATE_FLAG (ti
) = 1;
3594 /* Return a TEMPLATE_ID_EXPR corresponding to the indicated FNS (which
3595 may be either a _DECL or an overloaded function or an
3596 IDENTIFIER_NODE), and ARGLIST. */
3599 lookup_template_function (fns
, arglist
)
3604 if (fns
== NULL_TREE
)
3606 cp_error ("non-template used as template");
3607 return error_mark_node
;
3610 type
= TREE_TYPE (fns
);
3611 if (TREE_CODE (fns
) == OVERLOAD
|| !type
)
3612 type
= unknown_type_node
;
3614 if (processing_template_decl
)
3615 return build_min (TEMPLATE_ID_EXPR
, type
, fns
, arglist
);
3617 return build (TEMPLATE_ID_EXPR
, type
, fns
, arglist
);
3620 /* Within the scope of a template class S<T>, the name S gets bound
3621 (in build_self_reference) to a TYPE_DECL for the class, not a
3622 TEMPLATE_DECL. If DECL is a TYPE_DECL for current_class_type,
3623 or one of its enclosing classes, and that type is a template,
3624 return the associated TEMPLATE_DECL. Otherwise, the original
3625 DECL is returned. */
3628 maybe_get_template_decl_from_type_decl (decl
)
3631 return (decl
!= NULL_TREE
3632 && TREE_CODE (decl
) == TYPE_DECL
3633 && DECL_ARTIFICIAL (decl
)
3634 && CLASS_TYPE_P (TREE_TYPE (decl
))
3635 && CLASSTYPE_TEMPLATE_INFO (TREE_TYPE (decl
)))
3636 ? CLASSTYPE_TI_TEMPLATE (TREE_TYPE (decl
)) : decl
;
3639 /* Given an IDENTIFIER_NODE (type TEMPLATE_DECL) and a chain of
3640 parameters, find the desired type.
3642 D1 is the PTYPENAME terminal, and ARGLIST is the list of arguments.
3643 (Actually ARGLIST may be either a TREE_LIST or a TREE_VEC. It will
3644 be a TREE_LIST if called directly from the parser, and a TREE_VEC
3645 otherwise.) Since ARGLIST is build on the temp_decl_obstack, we must
3646 copy it here to keep it from being reclaimed when the decl storage
3649 IN_DECL, if non-NULL, is the template declaration we are trying to
3652 If ENTERING_SCOPE is non-zero, we are about to enter the scope of
3653 the class we are looking up.
3655 If the template class is really a local class in a template
3656 function, then the FUNCTION_CONTEXT is the function in which it is
3657 being instantiated. */
3660 lookup_template_class (d1
, arglist
, in_decl
, context
, entering_scope
)
3666 tree
template = NULL_TREE
, parmlist
;
3669 if (TREE_CODE (d1
) == IDENTIFIER_NODE
)
3671 if (IDENTIFIER_VALUE (d1
)
3672 && DECL_TEMPLATE_TEMPLATE_PARM_P (IDENTIFIER_VALUE (d1
)))
3673 template = IDENTIFIER_VALUE (d1
);
3677 push_decl_namespace (context
);
3678 template = lookup_name (d1
, /*prefer_type=*/0);
3679 template = maybe_get_template_decl_from_type_decl (template);
3681 pop_decl_namespace ();
3684 context
= DECL_CONTEXT (template);
3686 else if (TREE_CODE (d1
) == TYPE_DECL
&& IS_AGGR_TYPE (TREE_TYPE (d1
)))
3688 tree type
= TREE_TYPE (d1
);
3690 /* If we are declaring a constructor, say A<T>::A<T>, we will get
3691 an implicit typename for the second A. Deal with it. */
3692 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
3693 type
= TREE_TYPE (type
);
3695 if (CLASSTYPE_TEMPLATE_INFO (type
))
3697 template = CLASSTYPE_TI_TEMPLATE (type
);
3698 d1
= DECL_NAME (template);
3701 else if (TREE_CODE (d1
) == ENUMERAL_TYPE
3702 || (TREE_CODE_CLASS (TREE_CODE (d1
)) == 't'
3703 && IS_AGGR_TYPE (d1
)))
3705 template = TYPE_TI_TEMPLATE (d1
);
3706 d1
= DECL_NAME (template);
3708 else if (TREE_CODE (d1
) == TEMPLATE_DECL
3709 && TREE_CODE (DECL_RESULT (d1
)) == TYPE_DECL
)
3712 d1
= DECL_NAME (template);
3713 context
= DECL_CONTEXT (template);
3716 my_friendly_abort (272);
3718 /* With something like `template <class T> class X class X { ... };'
3719 we could end up with D1 having nothing but an IDENTIFIER_VALUE.
3720 We don't want to do that, but we have to deal with the situation,
3721 so let's give them some syntax errors to chew on instead of a
3725 cp_error ("`%T' is not a template", d1
);
3726 return error_mark_node
;
3729 if (context
== NULL_TREE
)
3730 context
= global_namespace
;
3732 if (TREE_CODE (template) != TEMPLATE_DECL
)
3734 cp_error ("non-template type `%T' used as a template", d1
);
3736 cp_error_at ("for template declaration `%D'", in_decl
);
3737 return error_mark_node
;
3740 if (DECL_TEMPLATE_TEMPLATE_PARM_P (template))
3742 /* Create a new TEMPLATE_DECL and TEMPLATE_TEMPLATE_PARM node to store
3743 template arguments */
3745 tree parm
= copy_template_template_parm (TREE_TYPE (template));
3746 tree template2
= TYPE_STUB_DECL (parm
);
3749 parmlist
= DECL_INNERMOST_TEMPLATE_PARMS (template);
3751 arglist2
= coerce_template_parms (parmlist
, arglist
, template, 1, 1);
3752 if (arglist2
== error_mark_node
)
3753 return error_mark_node
;
3755 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (parm
)
3756 = tree_cons (template2
, arglist2
, NULL_TREE
);
3757 TYPE_SIZE (parm
) = 0;
3762 tree template_type
= TREE_TYPE (template);
3765 tree found
= NULL_TREE
;
3768 int is_partial_instantiation
;
3770 gen_tmpl
= most_general_template (template);
3771 parmlist
= DECL_TEMPLATE_PARMS (gen_tmpl
);
3772 parm_depth
= TMPL_PARMS_DEPTH (parmlist
);
3773 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
3775 if (arg_depth
== 1 && parm_depth
> 1)
3777 /* We've been given an incomplete set of template arguments.
3780 template <class T> struct S1 {
3781 template <class U> struct S2 {};
3782 template <class U> struct S2<U*> {};
3785 we will be called with an ARGLIST of `U*', but the
3786 TEMPLATE will be `template <class T> template
3787 <class U> struct S1<T>::S2'. We must fill in the missing
3790 = add_outermost_template_args (TYPE_TI_ARGS (TREE_TYPE (template)),
3792 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
3795 /* Now we should enough arguments. */
3796 my_friendly_assert (parm_depth
== arg_depth
, 0);
3798 /* From here on, we're only interested in the most general
3800 template = gen_tmpl
;
3802 /* Calculate the BOUND_ARGS. These will be the args that are
3803 actually tsubst'd into the definition to create the
3807 /* We have multiple levels of arguments to coerce, at once. */
3809 int saved_depth
= TMPL_ARGS_DEPTH (arglist
);
3811 tree bound_args
= make_tree_vec (parm_depth
);
3813 for (i
= saved_depth
,
3814 t
= DECL_TEMPLATE_PARMS (template);
3815 i
> 0 && t
!= NULL_TREE
;
3816 --i
, t
= TREE_CHAIN (t
))
3818 tree a
= coerce_template_parms (TREE_VALUE (t
),
3819 arglist
, template, 1, 1);
3820 SET_TMPL_ARGS_LEVEL (bound_args
, i
, a
);
3822 /* We temporarily reduce the length of the ARGLIST so
3823 that coerce_template_parms will see only the arguments
3824 corresponding to the template parameters it is
3826 TREE_VEC_LENGTH (arglist
)--;
3829 /* Restore the ARGLIST to its full size. */
3830 TREE_VEC_LENGTH (arglist
) = saved_depth
;
3832 arglist
= bound_args
;
3836 = coerce_template_parms (INNERMOST_TEMPLATE_PARMS (parmlist
),
3837 innermost_args (arglist
),
3840 if (arglist
== error_mark_node
)
3841 /* We were unable to bind the arguments. */
3842 return error_mark_node
;
3844 /* In the scope of a template class, explicit references to the
3845 template class refer to the type of the template, not any
3846 instantiation of it. For example, in:
3848 template <class T> class C { void f(C<T>); }
3850 the `C<T>' is just the same as `C'. Outside of the
3851 class, however, such a reference is an instantiation. */
3852 if (comp_template_args (TYPE_TI_ARGS (template_type
),
3855 found
= template_type
;
3857 if (!entering_scope
&& PRIMARY_TEMPLATE_P (template))
3861 /* Note that we use DECL_CONTEXT, rather than
3862 CP_DECL_CONTEXT, so that the termination test is
3863 always just `ctx'. We're not interested in namepace
3865 for (ctx
= current_class_type
;
3867 ctx
= (TREE_CODE_CLASS (TREE_CODE (ctx
)) == 't')
3868 ? TYPE_CONTEXT (ctx
) : DECL_CONTEXT (ctx
))
3869 if (same_type_p (ctx
, template_type
))
3873 /* We're not in the scope of the class, so the
3874 TEMPLATE_TYPE is not the type we want after
3882 for (found
= DECL_TEMPLATE_INSTANTIATIONS (template);
3883 found
; found
= TREE_CHAIN (found
))
3884 if (comp_template_args (TREE_PURPOSE (found
), arglist
))
3888 found
= TREE_VALUE (found
);
3894 /* This type is a "partial instantiation" if any of the template
3895 arguments still inolve template parameters. Note that we set
3896 IS_PARTIAL_INSTANTIATION for partial specializations as
3898 is_partial_instantiation
= uses_template_parms (arglist
);
3900 if (!is_partial_instantiation
3901 && !PRIMARY_TEMPLATE_P (template)
3902 && TREE_CODE (CP_DECL_CONTEXT (template)) == NAMESPACE_DECL
)
3904 found
= xref_tag_from_type (TREE_TYPE (template),
3905 DECL_NAME (template),
3910 /* Create the type. */
3911 if (TREE_CODE (template_type
) == ENUMERAL_TYPE
)
3913 if (!is_partial_instantiation
)
3914 t
= start_enum (TYPE_IDENTIFIER (template_type
));
3916 /* We don't want to call start_enum for this type, since
3917 the values for the enumeration constants may involve
3918 template parameters. And, no one should be interested
3919 in the enumeration constants for such a type. */
3920 t
= make_node (ENUMERAL_TYPE
);
3924 t
= make_aggr_type (TREE_CODE (template_type
));
3925 CLASSTYPE_DECLARED_CLASS (t
)
3926 = CLASSTYPE_DECLARED_CLASS (template_type
);
3927 CLASSTYPE_GOT_SEMICOLON (t
) = 1;
3928 SET_CLASSTYPE_IMPLICIT_INSTANTIATION (t
);
3929 TYPE_FOR_JAVA (t
) = TYPE_FOR_JAVA (template_type
);
3931 /* A local class. Make sure the decl gets registered properly. */
3932 if (context
== current_function_decl
)
3933 pushtag (DECL_NAME (template), t
, 0);
3936 /* If we called start_enum or pushtag above, this information
3937 will already be set up. */
3940 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
3942 type_decl
= create_implicit_typedef (DECL_NAME (template), t
);
3943 DECL_CONTEXT (type_decl
) = TYPE_CONTEXT (t
);
3944 TYPE_STUB_DECL (t
) = type_decl
;
3945 DECL_SOURCE_FILE (type_decl
)
3946 = DECL_SOURCE_FILE (TYPE_STUB_DECL (template_type
));
3947 DECL_SOURCE_LINE (type_decl
)
3948 = DECL_SOURCE_LINE (TYPE_STUB_DECL (template_type
));
3951 type_decl
= TYPE_NAME (t
);
3953 /* Set up the template information. We have to figure out which
3954 template is the immediate parent if this is a full
3956 if (parm_depth
== 1 || is_partial_instantiation
3957 || !PRIMARY_TEMPLATE_P (template))
3958 /* This case is easy; there are no member templates involved. */
3962 /* This is a full instantiation of a member template. There
3963 should be some partial instantiation of which this is an
3966 for (found
= DECL_TEMPLATE_INSTANTIATIONS (template);
3967 found
; found
= TREE_CHAIN (found
))
3970 tree tmpl
= CLASSTYPE_TI_TEMPLATE (TREE_VALUE (found
));
3972 /* We only want partial instantiations, here, not
3973 specializations or full instantiations. */
3974 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_VALUE (found
))
3975 || !uses_template_parms (TREE_VALUE (found
)))
3978 /* Temporarily reduce by one the number of levels in the
3979 ARGLIST and in FOUND so as to avoid comparing the
3980 last set of arguments. */
3981 TREE_VEC_LENGTH (arglist
)--;
3982 TREE_VEC_LENGTH (TREE_PURPOSE (found
)) --;
3984 /* See if the arguments match. If they do, then TMPL is
3985 the partial instantiation we want. */
3986 success
= comp_template_args (TREE_PURPOSE (found
), arglist
);
3988 /* Restore the argument vectors to their full size. */
3989 TREE_VEC_LENGTH (arglist
)++;
3990 TREE_VEC_LENGTH (TREE_PURPOSE (found
))++;
4000 my_friendly_abort (0);
4003 SET_TYPE_TEMPLATE_INFO (t
,
4004 tree_cons (found
, arglist
, NULL_TREE
));
4005 DECL_TEMPLATE_INSTANTIATIONS (template)
4006 = tree_cons (arglist
, t
,
4007 DECL_TEMPLATE_INSTANTIATIONS (template));
4009 if (TREE_CODE (t
) == ENUMERAL_TYPE
4010 && !is_partial_instantiation
)
4011 /* Now that the type has been registered on the instantiations
4012 list, we set up the enumerators. Because the enumeration
4013 constants may involve the enumeration type itself, we make
4014 sure to register the type first, and then create the
4015 constants. That way, doing tsubst_expr for the enumeration
4016 constants won't result in recursive calls here; we'll find
4017 the instantiation and exit above. */
4018 tsubst_enum (template_type
, t
, arglist
);
4020 /* Reset the name of the type, now that CLASSTYPE_TEMPLATE_INFO
4022 if (TREE_CODE (t
) != ENUMERAL_TYPE
)
4023 DECL_NAME (type_decl
) = classtype_mangled_name (t
);
4024 DECL_ASSEMBLER_NAME (type_decl
) = DECL_NAME (type_decl
);
4025 if (!is_partial_instantiation
)
4027 DECL_ASSEMBLER_NAME (type_decl
)
4028 = get_identifier (build_overload_name (t
, 1, 1));
4030 /* For backwards compatibility; code that uses
4031 -fexternal-templates expects looking up a template to
4032 instantiate it. I think DDD still relies on this.
4033 (jason 8/20/1998) */
4034 if (TREE_CODE (t
) != ENUMERAL_TYPE
4035 && flag_external_templates
4036 && CLASSTYPE_INTERFACE_KNOWN (TREE_TYPE (template))
4037 && ! CLASSTYPE_INTERFACE_ONLY (TREE_TYPE (template)))
4038 add_pending_template (t
);
4041 /* If the type makes use of template parameters, the
4042 code that generates debugging information will crash. */
4043 DECL_IGNORED_P (TYPE_STUB_DECL (t
)) = 1;
4055 /* Called from for_each_template_parm via walk_tree. */
4058 for_each_template_parm_r (tp
, walk_subtrees
, d
)
4064 struct pair_fn_data
*pfd
= (struct pair_fn_data
*) d
;
4065 tree_fn_t fn
= pfd
->fn
;
4066 void *data
= pfd
->data
;
4068 if (TREE_CODE_CLASS (TREE_CODE (t
)) == 't'
4069 && for_each_template_parm (TYPE_CONTEXT (t
), fn
, data
))
4070 return error_mark_node
;
4072 switch (TREE_CODE (t
))
4075 if (TYPE_PTRMEMFUNC_FLAG (t
))
4081 if (!TYPE_TEMPLATE_INFO (t
))
4083 else if (for_each_template_parm (TREE_VALUE (TYPE_TEMPLATE_INFO (t
)),
4085 return error_mark_node
;
4089 /* Since we're not going to walk subtrees, we have to do this
4091 if (for_each_template_parm (TYPE_METHOD_BASETYPE (t
), fn
, data
))
4092 return error_mark_node
;
4095 /* Check the return type. */
4096 if (for_each_template_parm (TREE_TYPE (t
), fn
, data
))
4097 return error_mark_node
;
4099 /* Check the parameter types. Since default arguments are not
4100 instantiated until they are needed, the TYPE_ARG_TYPES may
4101 contain expressions that involve template parameters. But,
4102 no-one should be looking at them yet. And, once they're
4103 instantiated, they don't contain template parameters, so
4104 there's no point in looking at them then, either. */
4108 for (parm
= TYPE_ARG_TYPES (t
); parm
; parm
= TREE_CHAIN (parm
))
4109 if (for_each_template_parm (TREE_VALUE (parm
), fn
, data
))
4110 return error_mark_node
;
4112 /* Since we've already handled the TYPE_ARG_TYPES, we don't
4113 want walk_tree walking into them itself. */
4120 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
)
4121 && for_each_template_parm (DECL_TI_ARGS (t
), fn
, data
))
4122 return error_mark_node
;
4127 if (DECL_CONTEXT (t
)
4128 && for_each_template_parm (DECL_CONTEXT (t
), fn
, data
))
4129 return error_mark_node
;
4132 case TEMPLATE_TEMPLATE_PARM
:
4133 /* Record template parameters such as `T' inside `TT<T>'. */
4134 if (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t
)
4135 && for_each_template_parm (TYPE_TI_ARGS (t
), fn
, data
))
4136 return error_mark_node
;
4139 case TEMPLATE_TYPE_PARM
:
4140 case TEMPLATE_PARM_INDEX
:
4141 if (fn
&& (*fn
)(t
, data
))
4142 return error_mark_node
;
4144 return error_mark_node
;
4148 /* A template template parameter is encountered */
4149 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
)
4150 && for_each_template_parm (TREE_TYPE (t
), fn
, data
))
4151 return error_mark_node
;
4153 /* Already substituted template template parameter */
4158 if (!fn
|| for_each_template_parm (TYPENAME_TYPE_FULLNAME (t
), fn
, data
))
4159 return error_mark_node
;
4163 if (TREE_TYPE (t
) && TYPE_PTRMEMFUNC_P (TREE_TYPE (t
))
4164 && for_each_template_parm (TYPE_PTRMEMFUNC_FN_TYPE
4165 (TREE_TYPE (t
)), fn
, data
))
4166 return error_mark_node
;
4171 /* If there's no type, then this thing must be some expression
4172 involving template parameters. */
4173 if (!fn
&& !TREE_TYPE (t
))
4174 return error_mark_node
;
4179 case REINTERPRET_CAST_EXPR
:
4180 case CONST_CAST_EXPR
:
4181 case STATIC_CAST_EXPR
:
4182 case DYNAMIC_CAST_EXPR
:
4187 case PSEUDO_DTOR_EXPR
:
4189 return error_mark_node
;
4196 /* We didn't find any template parameters we liked. */
4200 /* For each TEMPLATE_TYPE_PARM, TEMPLATE_TEMPLATE_PARM, or
4201 TEMPLATE_PARM_INDEX in T, call FN with the parameter and the DATA.
4202 If FN returns non-zero, the iteration is terminated, and
4203 for_each_template_parm returns 1. Otherwise, the iteration
4204 continues. If FN never returns a non-zero value, the value
4205 returned by for_each_template_parm is 0. If FN is NULL, it is
4206 considered to be the function which always returns 1. */
4209 for_each_template_parm (t
, fn
, data
)
4214 struct pair_fn_data pfd
;
4220 /* Walk the tree. */
4221 return walk_tree (&t
, for_each_template_parm_r
, &pfd
) != NULL_TREE
;
4225 uses_template_parms (t
)
4228 return for_each_template_parm (t
, 0, 0);
4231 static struct tinst_level
*current_tinst_level
;
4232 static struct tinst_level
*free_tinst_level
;
4233 static int tinst_depth
;
4234 extern int max_tinst_depth
;
4235 #ifdef GATHER_STATISTICS
4238 static int tinst_level_tick
;
4239 static int last_template_error_tick
;
4241 /* Print out all the template instantiations that we are currently
4242 working on. If ERR, we are being called from cp_thing, so do
4243 the right thing for an error message. */
4246 print_template_context (err
)
4249 struct tinst_level
*p
= current_tinst_level
;
4251 char *file
= input_filename
;
4255 if (current_function_decl
!= p
->decl
4256 && current_function_decl
!= NULL_TREE
)
4257 /* We can get here during the processing of some synthesized
4258 method. Then, p->decl will be the function that's causing
4263 if (current_function_decl
== p
->decl
)
4264 /* Avoid redundancy with the the "In function" line. */;
4266 fprintf (stderr
, "%s: In instantiation of `%s':\n",
4267 file
, decl_as_string (p
->decl
, TS_DECL_TYPE
| TS_FUNC_NORETURN
));
4275 for (; p
; p
= p
->next
)
4277 fprintf (stderr
, "%s:%d: instantiated from `%s'\n", file
, line
,
4278 decl_as_string (p
->decl
, TS_DECL_TYPE
| TS_FUNC_NORETURN
));
4282 fprintf (stderr
, "%s:%d: instantiated from here\n", file
, line
);
4285 /* Called from cp_thing to print the template context for an error. */
4288 maybe_print_template_context ()
4290 if (last_template_error_tick
== tinst_level_tick
4291 || current_tinst_level
== 0)
4294 last_template_error_tick
= tinst_level_tick
;
4295 print_template_context (1);
4299 push_tinst_level (d
)
4302 struct tinst_level
*new;
4304 if (tinst_depth
>= max_tinst_depth
)
4306 /* If the instantiation in question still has unbound template parms,
4307 we don't really care if we can't instantiate it, so just return.
4308 This happens with base instantiation for implicit `typename'. */
4309 if (uses_template_parms (d
))
4312 last_template_error_tick
= tinst_level_tick
;
4313 cp_error ("template instantiation depth exceeds maximum of %d (use -ftemplate-depth-NN to increase the maximum) instantiating `%D'",
4314 max_tinst_depth
, d
);
4316 print_template_context (0);
4321 if (free_tinst_level
)
4323 new = free_tinst_level
;
4324 free_tinst_level
= new->next
;
4327 new = (struct tinst_level
*) xmalloc (sizeof (struct tinst_level
));
4331 new->file
= input_filename
;
4332 new->next
= current_tinst_level
;
4333 current_tinst_level
= new;
4336 #ifdef GATHER_STATISTICS
4337 if (tinst_depth
> depth_reached
)
4338 depth_reached
= tinst_depth
;
4348 struct tinst_level
*old
= current_tinst_level
;
4350 /* Restore the filename and line number stashed away when we started
4351 this instantiation. */
4353 input_filename
= old
->file
;
4354 extract_interface_info ();
4356 current_tinst_level
= old
->next
;
4357 old
->next
= free_tinst_level
;
4358 free_tinst_level
= old
;
4363 struct tinst_level
*
4366 struct tinst_level
*p
= current_tinst_level
;
4369 for (; p
->next
; p
= p
->next
)
4374 /* DECL is a friend FUNCTION_DECL or TEMPLATE_DECL. ARGS is the
4375 vector of template arguments, as for tsubst.
4377 Returns an appropriate tsbust'd friend declaration. */
4380 tsubst_friend_function (decl
, args
)
4386 char *file
= input_filename
;
4388 lineno
= DECL_SOURCE_LINE (decl
);
4389 input_filename
= DECL_SOURCE_FILE (decl
);
4391 if (TREE_CODE (decl
) == FUNCTION_DECL
4392 && DECL_TEMPLATE_INSTANTIATION (decl
)
4393 && TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
4394 /* This was a friend declared with an explicit template
4395 argument list, e.g.:
4399 to indicate that f was a template instantiation, not a new
4400 function declaration. Now, we have to figure out what
4401 instantiation of what template. */
4408 = lookup_template_function (tsubst_expr (DECL_TI_TEMPLATE (decl
),
4409 args
, /*complain=*/1,
4411 tsubst (DECL_TI_ARGS (decl
),
4412 args
, /*complain=*/1,
4414 new_friend
= tsubst (decl
, args
, /*complain=*/1, NULL_TREE
);
4415 tmpl
= determine_specialization (template_id
, new_friend
,
4417 /*need_member_template=*/0);
4418 new_friend
= instantiate_template (tmpl
, new_args
);
4422 new_friend
= tsubst (decl
, args
, /*complain=*/1, NULL_TREE
);
4424 /* The NEW_FRIEND will look like an instantiation, to the
4425 compiler, but is not an instantiation from the point of view of
4426 the language. For example, we might have had:
4428 template <class T> struct S {
4429 template <class U> friend void f(T, U);
4432 Then, in S<int>, template <class U> void f(int, U) is not an
4433 instantiation of anything. */
4434 DECL_USE_TEMPLATE (new_friend
) = 0;
4435 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
4436 DECL_USE_TEMPLATE (DECL_TEMPLATE_RESULT (new_friend
)) = 0;
4438 /* The mangled name for the NEW_FRIEND is incorrect. The call to
4439 tsubst will have resulted in a call to
4440 set_mangled_name_for_template_decl. But, the function is not a
4441 template instantiation and should not be mangled like one.
4442 Therefore, we remangle the function name. We don't have to do
4443 this if the NEW_FRIEND is a template since
4444 set_mangled_name_for_template_decl doesn't do anything if the
4445 function declaration still uses template arguments. */
4446 if (TREE_CODE (new_friend
) != TEMPLATE_DECL
)
4448 set_mangled_name_for_decl (new_friend
);
4449 DECL_RTL (new_friend
) = 0;
4450 make_decl_rtl (new_friend
, NULL_PTR
, 1);
4453 if (DECL_NAMESPACE_SCOPE_P (new_friend
))
4456 tree new_friend_template_info
;
4457 tree new_friend_result_template_info
;
4459 int new_friend_is_defn
;
4461 /* We must save some information from NEW_FRIEND before calling
4462 duplicate decls since that function will free NEW_FRIEND if
4464 new_friend_template_info
= DECL_TEMPLATE_INFO (new_friend
);
4465 if (TREE_CODE (new_friend
) == TEMPLATE_DECL
)
4467 /* This declaration is a `primary' template. */
4468 DECL_PRIMARY_TEMPLATE (new_friend
) = new_friend
;
4471 = DECL_INITIAL (DECL_RESULT (new_friend
)) != NULL_TREE
;
4472 new_friend_result_template_info
4473 = DECL_TEMPLATE_INFO (DECL_RESULT (new_friend
));
4477 new_friend_is_defn
= DECL_INITIAL (new_friend
) != NULL_TREE
;
4478 new_friend_result_template_info
= NULL_TREE
;
4481 /* Inside pushdecl_namespace_level, we will push into the
4482 current namespace. However, the friend function should go
4483 into the namespace of the template. */
4484 ns
= decl_namespace_context (new_friend
);
4485 push_nested_namespace (ns
);
4486 old_decl
= pushdecl_namespace_level (new_friend
);
4487 pop_nested_namespace (ns
);
4489 if (old_decl
!= new_friend
)
4491 /* This new friend declaration matched an existing
4492 declaration. For example, given:
4494 template <class T> void f(T);
4495 template <class U> class C {
4496 template <class T> friend void f(T) {}
4499 the friend declaration actually provides the definition
4500 of `f', once C has been instantiated for some type. So,
4501 old_decl will be the out-of-class template declaration,
4502 while new_friend is the in-class definition.
4504 But, if `f' was called before this point, the
4505 instantiation of `f' will have DECL_TI_ARGS corresponding
4506 to `T' but not to `U', references to which might appear
4507 in the definition of `f'. Previously, the most general
4508 template for an instantiation of `f' was the out-of-class
4509 version; now it is the in-class version. Therefore, we
4510 run through all specialization of `f', adding to their
4511 DECL_TI_ARGS appropriately. In particular, they need a
4512 new set of outer arguments, corresponding to the
4513 arguments for this class instantiation.
4515 The same situation can arise with something like this:
4518 template <class T> class C {
4522 when `C<int>' is instantiated. Now, `f(int)' is defined
4525 if (!new_friend_is_defn
)
4526 /* On the other hand, if the in-class declaration does
4527 *not* provide a definition, then we don't want to alter
4528 existing definitions. We can just leave everything
4533 /* Overwrite whatever template info was there before, if
4534 any, with the new template information pertaining to
4536 DECL_TEMPLATE_INFO (old_decl
) = new_friend_template_info
;
4538 if (TREE_CODE (old_decl
) != TEMPLATE_DECL
)
4539 /* duplicate_decls will take care of this case. */
4544 tree new_friend_args
;
4546 DECL_TEMPLATE_INFO (DECL_RESULT (old_decl
))
4547 = new_friend_result_template_info
;
4549 new_friend_args
= TI_ARGS (new_friend_template_info
);
4550 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (old_decl
);
4554 tree spec
= TREE_VALUE (t
);
4557 = add_outermost_template_args (new_friend_args
,
4558 DECL_TI_ARGS (spec
));
4561 /* Now, since specializations are always supposed to
4562 hang off of the most general template, we must move
4564 t
= most_general_template (old_decl
);
4567 DECL_TEMPLATE_SPECIALIZATIONS (t
)
4568 = chainon (DECL_TEMPLATE_SPECIALIZATIONS (t
),
4569 DECL_TEMPLATE_SPECIALIZATIONS (old_decl
));
4570 DECL_TEMPLATE_SPECIALIZATIONS (old_decl
) = NULL_TREE
;
4575 /* The information from NEW_FRIEND has been merged into OLD_DECL
4576 by duplicate_decls. */
4577 new_friend
= old_decl
;
4580 else if (COMPLETE_TYPE_P (DECL_CONTEXT (new_friend
)))
4582 /* Check to see that the declaration is really present, and,
4583 possibly obtain an improved declaration. */
4584 tree fn
= check_classfn (DECL_CONTEXT (new_friend
),
4593 input_filename
= file
;
4597 /* FRIEND_TMPL is a friend TEMPLATE_DECL. ARGS is the vector of
4598 template arguments, as for tsubst.
4600 Returns an appropriate tsbust'd friend type. */
4603 tsubst_friend_class (friend_tmpl
, args
)
4610 /* First, we look for a class template. */
4611 tmpl
= lookup_name (DECL_NAME (friend_tmpl
), /*prefer_type=*/0);
4613 /* But, if we don't find one, it might be because we're in a
4614 situation like this:
4622 Here, in the scope of (say) S<int>, `S' is bound to a TYPE_DECL
4623 for `S<int>', not the TEMPLATE_DECL. */
4624 if (!tmpl
|| !DECL_CLASS_TEMPLATE_P (tmpl
))
4626 tmpl
= lookup_name (DECL_NAME (friend_tmpl
), /*prefer_type=*/1);
4627 tmpl
= maybe_get_template_decl_from_type_decl (tmpl
);
4630 if (tmpl
&& DECL_CLASS_TEMPLATE_P (tmpl
))
4632 /* The friend template has already been declared. Just
4633 check to see that the declarations match, and install any new
4634 default parameters. We must tsubst the default parameters,
4635 of course. We only need the innermost template parameters
4636 because that is all that redeclare_class_template will look
4639 = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_tmpl
),
4640 args
, /*complain=*/1);
4641 redeclare_class_template (TREE_TYPE (tmpl
), parms
);
4642 friend_type
= TREE_TYPE (tmpl
);
4646 /* The friend template has not already been declared. In this
4647 case, the instantiation of the template class will cause the
4648 injection of this template into the global scope. */
4649 tmpl
= tsubst (friend_tmpl
, args
, /*complain=*/1, NULL_TREE
);
4651 /* The new TMPL is not an instantiation of anything, so we
4652 forget its origins. We don't reset CLASSTYPE_TI_TEMPLATE for
4653 the new type because that is supposed to be the corresponding
4654 template decl, i.e., TMPL. */
4655 DECL_USE_TEMPLATE (tmpl
) = 0;
4656 DECL_TEMPLATE_INFO (tmpl
) = NULL_TREE
;
4657 CLASSTYPE_USE_TEMPLATE (TREE_TYPE (tmpl
)) = 0;
4659 /* Inject this template into the global scope. */
4660 friend_type
= TREE_TYPE (pushdecl_top_level (tmpl
));
4667 instantiate_class_template (type
)
4670 tree
template, args
, pattern
, t
;
4673 if (type
== error_mark_node
)
4674 return error_mark_node
;
4676 if (TYPE_BEING_DEFINED (type
) || COMPLETE_TYPE_P (type
))
4679 /* Figure out which template is being instantiated. */
4680 template = most_general_template (CLASSTYPE_TI_TEMPLATE (type
));
4681 my_friendly_assert (TREE_CODE (template) == TEMPLATE_DECL
, 279);
4683 /* Figure out which arguments are being used to do the
4685 args
= CLASSTYPE_TI_ARGS (type
);
4686 PARTIAL_INSTANTIATION_P (type
) = uses_template_parms (args
);
4688 if (pedantic
&& PARTIAL_INSTANTIATION_P (type
))
4689 /* If this is a partial instantiation, then we can't instantiate
4690 the type; there's no telling whether or not one of the
4691 template parameters might eventually be instantiated to some
4692 value that results in a specialization being used. For
4704 Now, the `S<U>' in `f<int>' is the specialization, not an
4705 instantiation of the original template. */
4708 /* Determine what specialization of the original template to
4710 if (PARTIAL_INSTANTIATION_P (type
))
4711 /* There's no telling which specialization is appropriate at this
4712 point. Since all peeking at the innards of this partial
4713 instantiation are extensions (like the "implicit typename"
4714 extension, which allows users to omit the keyword `typename' on
4715 names that are declared as types in template base classes), we
4716 are free to do what we please.
4718 Trying to figure out which partial instantiation to use can
4719 cause a crash. (Some of the template arguments don't even have
4720 types.) So, we just use the most general version. */
4724 t
= most_specialized_class (template, args
);
4726 if (t
== error_mark_node
)
4728 const char *str
= "candidates are:";
4729 cp_error ("ambiguous class template instantiation for `%#T'", type
);
4730 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (template); t
;
4733 if (get_class_bindings (TREE_VALUE (t
), TREE_PURPOSE (t
),
4736 cp_error_at ("%s %+#T", str
, TREE_TYPE (t
));
4740 TYPE_BEING_DEFINED (type
) = 1;
4741 return error_mark_node
;
4746 pattern
= TREE_TYPE (t
);
4748 pattern
= TREE_TYPE (template);
4750 /* If the template we're instantiating is incomplete, then clearly
4751 there's nothing we can do. */
4752 if (!COMPLETE_TYPE_P (pattern
))
4755 /* If this is a partial instantiation, don't tsubst anything. We will
4756 only use this type for implicit typename, so the actual contents don't
4757 matter. All that matters is whether a particular name is a type. */
4758 if (PARTIAL_INSTANTIATION_P (type
))
4760 /* The fields set here must be kept in sync with those cleared
4761 in begin_class_definition. */
4762 TYPE_BINFO_BASETYPES (type
) = TYPE_BINFO_BASETYPES (pattern
);
4763 TYPE_FIELDS (type
) = TYPE_FIELDS (pattern
);
4764 TYPE_METHODS (type
) = TYPE_METHODS (pattern
);
4765 CLASSTYPE_TAGS (type
) = CLASSTYPE_TAGS (pattern
);
4766 /* Pretend that the type is complete, so that we will look
4767 inside it during name lookup and such. */
4768 TYPE_SIZE (type
) = integer_zero_node
;
4772 /* If we've recursively instantiated too many templates, stop. */
4773 if (! push_tinst_level (type
))
4776 /* Now we're really doing the instantiation. Mark the type as in
4777 the process of being defined. */
4778 TYPE_BEING_DEFINED (type
) = 1;
4780 maybe_push_to_top_level (uses_template_parms (type
));
4784 /* This TYPE is actually a instantiation of of a partial
4785 specialization. We replace the innermost set of ARGS with
4786 the arguments appropriate for substitution. For example,
4789 template <class T> struct S {};
4790 template <class T> struct S<T*> {};
4792 and supposing that we are instantiating S<int*>, ARGS will
4793 present be {int*} but we need {int}. */
4795 = get_class_bindings (TREE_VALUE (t
), TREE_PURPOSE (t
),
4798 /* If there were multiple levels in ARGS, replacing the
4799 innermost level would alter CLASSTYPE_TI_ARGS, which we don't
4800 want, so we make a copy first. */
4801 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
4803 args
= copy_node (args
);
4804 SET_TMPL_ARGS_LEVEL (args
, TMPL_ARGS_DEPTH (args
), inner_args
);
4810 if (flag_external_templates
)
4812 if (flag_alt_external_templates
)
4814 CLASSTYPE_INTERFACE_ONLY (type
) = interface_only
;
4815 SET_CLASSTYPE_INTERFACE_UNKNOWN_X (type
, interface_unknown
);
4816 CLASSTYPE_VTABLE_NEEDS_WRITING (type
)
4817 = (! CLASSTYPE_INTERFACE_ONLY (type
)
4818 && CLASSTYPE_INTERFACE_KNOWN (type
));
4822 CLASSTYPE_INTERFACE_ONLY (type
) = CLASSTYPE_INTERFACE_ONLY (pattern
);
4823 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
4824 (type
, CLASSTYPE_INTERFACE_UNKNOWN (pattern
));
4825 CLASSTYPE_VTABLE_NEEDS_WRITING (type
)
4826 = (! CLASSTYPE_INTERFACE_ONLY (type
)
4827 && CLASSTYPE_INTERFACE_KNOWN (type
));
4832 SET_CLASSTYPE_INTERFACE_UNKNOWN (type
);
4833 CLASSTYPE_VTABLE_NEEDS_WRITING (type
) = 1;
4836 TYPE_HAS_CONSTRUCTOR (type
) = TYPE_HAS_CONSTRUCTOR (pattern
);
4837 TYPE_HAS_DESTRUCTOR (type
) = TYPE_HAS_DESTRUCTOR (pattern
);
4838 TYPE_OVERLOADS_CALL_EXPR (type
) = TYPE_OVERLOADS_CALL_EXPR (pattern
);
4839 TYPE_OVERLOADS_ARRAY_REF (type
) = TYPE_OVERLOADS_ARRAY_REF (pattern
);
4840 TYPE_OVERLOADS_ARROW (type
) = TYPE_OVERLOADS_ARROW (pattern
);
4841 TYPE_HAS_NEW_OPERATOR (type
) = TYPE_HAS_NEW_OPERATOR (pattern
);
4842 TYPE_HAS_ARRAY_NEW_OPERATOR (type
) = TYPE_HAS_ARRAY_NEW_OPERATOR (pattern
);
4843 TYPE_GETS_DELETE (type
) = TYPE_GETS_DELETE (pattern
);
4844 TYPE_VEC_DELETE_TAKES_SIZE (type
) = TYPE_VEC_DELETE_TAKES_SIZE (pattern
);
4845 TYPE_HAS_ASSIGN_REF (type
) = TYPE_HAS_ASSIGN_REF (pattern
);
4846 TYPE_HAS_CONST_ASSIGN_REF (type
) = TYPE_HAS_CONST_ASSIGN_REF (pattern
);
4847 TYPE_HAS_ABSTRACT_ASSIGN_REF (type
) = TYPE_HAS_ABSTRACT_ASSIGN_REF (pattern
);
4848 TYPE_HAS_INIT_REF (type
) = TYPE_HAS_INIT_REF (pattern
);
4849 TYPE_HAS_CONST_INIT_REF (type
) = TYPE_HAS_CONST_INIT_REF (pattern
);
4850 TYPE_HAS_DEFAULT_CONSTRUCTOR (type
) = TYPE_HAS_DEFAULT_CONSTRUCTOR (pattern
);
4851 TYPE_HAS_CONVERSION (type
) = TYPE_HAS_CONVERSION (pattern
);
4852 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (type
)
4853 = TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (pattern
);
4854 TYPE_USES_MULTIPLE_INHERITANCE (type
)
4855 = TYPE_USES_MULTIPLE_INHERITANCE (pattern
);
4856 TYPE_USES_VIRTUAL_BASECLASSES (type
)
4857 = TYPE_USES_VIRTUAL_BASECLASSES (pattern
);
4858 TYPE_PACKED (type
) = TYPE_PACKED (pattern
);
4859 TYPE_ALIGN (type
) = TYPE_ALIGN (pattern
);
4860 TYPE_FOR_JAVA (type
) = TYPE_FOR_JAVA (pattern
); /* For libjava's JArray<T> */
4861 if (ANON_AGGR_TYPE_P (pattern
))
4862 SET_ANON_AGGR_TYPE_P (type
);
4864 if (TYPE_BINFO_BASETYPES (pattern
))
4866 tree base_list
= NULL_TREE
;
4867 tree pbases
= TYPE_BINFO_BASETYPES (pattern
);
4870 /* Substitute into each of the bases to determine the actual
4872 for (i
= 0; i
< TREE_VEC_LENGTH (pbases
); ++i
)
4878 pbase
= TREE_VEC_ELT (pbases
, i
);
4880 /* Substitue to figure out the base class. */
4881 base
= tsubst (BINFO_TYPE (pbase
), args
,
4882 /*complain=*/1, NULL_TREE
);
4883 if (base
== error_mark_node
)
4886 /* Calculate the correct access node. */
4887 if (TREE_VIA_VIRTUAL (pbase
))
4889 if (TREE_VIA_PUBLIC (pbase
))
4890 access
= access_public_virtual_node
;
4891 else if (TREE_VIA_PROTECTED (pbase
))
4892 access
= access_protected_virtual_node
;
4894 access
= access_private_virtual_node
;
4898 if (TREE_VIA_PUBLIC (pbase
))
4899 access
= access_public_node
;
4900 else if (TREE_VIA_PROTECTED (pbase
))
4901 access
= access_protected_node
;
4903 access
= access_private_node
;
4906 base_list
= tree_cons (access
, base
, base_list
);
4909 /* The list is now in reverse order; correct that. */
4910 base_list
= nreverse (base_list
);
4912 /* Now call xref_basetypes to set up all the base-class
4914 xref_basetypes (TREE_CODE (pattern
) == RECORD_TYPE
4915 ? (CLASSTYPE_DECLARED_CLASS (pattern
)
4916 ? class_type_node
: record_type_node
)
4918 DECL_NAME (TYPE_NAME (pattern
)),
4923 /* Now that our base classes are set up, enter the scope of the
4924 class, so that name lookups into base classes, etc. will work
4925 corectly. This is precisely analagous to what we do in
4926 begin_class_definition when defining an ordinary non-template
4928 pushclass (type
, 1);
4930 for (t
= CLASSTYPE_TAGS (pattern
); t
; t
= TREE_CHAIN (t
))
4932 tree tag
= TREE_VALUE (t
);
4933 tree name
= TYPE_IDENTIFIER (tag
);
4936 newtag
= tsubst (tag
, args
, /*complain=*/1, NULL_TREE
);
4937 if (TREE_CODE (newtag
) != ENUMERAL_TYPE
)
4939 if (TYPE_LANG_SPECIFIC (tag
) && CLASSTYPE_IS_TEMPLATE (tag
))
4940 /* Unfortunately, lookup_template_class sets
4941 CLASSTYPE_IMPLICIT_INSTANTIATION for a partial
4942 instantiation (i.e., for the type of a member template
4943 class nested within a template class.) This behavior is
4944 required for maybe_process_partial_specialization to work
4945 correctly, but is not accurate in this case; the TAG is not
4946 an instantiation of anything. (The corresponding
4947 TEMPLATE_DECL is an instantiation, but the TYPE is not.) */
4948 CLASSTYPE_USE_TEMPLATE (newtag
) = 0;
4950 /* Now, we call pushtag to put this NEWTAG into the scope of
4951 TYPE. We first set up the IDENTIFIER_TYPE_VALUE to avoid
4952 pushtag calling push_template_decl. We don't have to do
4953 this for enums because it will already have been done in
4956 SET_IDENTIFIER_TYPE_VALUE (name
, newtag
);
4957 pushtag (name
, newtag
, /*globalize=*/0);
4961 /* Don't replace enum constants here. */
4962 for (t
= TYPE_FIELDS (pattern
); t
; t
= TREE_CHAIN (t
))
4963 if (TREE_CODE (t
) != CONST_DECL
)
4967 /* The the file and line for this declaration, to assist in
4968 error message reporting. Since we called push_tinst_level
4969 above, we don't need to restore these. */
4970 lineno
= DECL_SOURCE_LINE (t
);
4971 input_filename
= DECL_SOURCE_FILE (t
);
4973 r
= tsubst (t
, args
, /*complain=*/1, NULL_TREE
);
4974 if (TREE_CODE (r
) == VAR_DECL
)
4978 if (DECL_DEFINED_IN_CLASS_P (r
))
4979 init
= tsubst_expr (DECL_INITIAL (t
), args
,
4980 /*complain=*/1, NULL_TREE
);
4984 finish_static_data_member_decl (r
, init
,
4985 /*asmspec_tree=*/NULL_TREE
,
4988 if (DECL_DEFINED_IN_CLASS_P (r
))
4989 check_static_variable_definition (r
, TREE_TYPE (r
));
4992 /* R will have a TREE_CHAIN if and only if it has already been
4993 processed by finish_member_declaration. This can happen
4994 if, for example, it is a TYPE_DECL for a class-scoped
4995 ENUMERAL_TYPE; such a thing will already have been added to
4996 the field list by tsubst_enum above. */
4997 if (!TREE_CHAIN (r
))
4999 set_current_access_from_decl (r
);
5000 finish_member_declaration (r
);
5004 /* Set up the list (TYPE_METHODS) and vector (CLASSTYPE_METHOD_VEC)
5005 for this instantiation. */
5006 for (t
= TYPE_METHODS (pattern
); t
; t
= TREE_CHAIN (t
))
5008 tree r
= tsubst (t
, args
, /*complain=*/1, NULL_TREE
);
5009 set_current_access_from_decl (r
);
5010 finish_member_declaration (r
);
5013 /* Construct the DECL_FRIENDLIST for the new class type. */
5014 typedecl
= TYPE_MAIN_DECL (type
);
5015 for (t
= DECL_FRIENDLIST (TYPE_MAIN_DECL (pattern
));
5021 for (friends
= TREE_VALUE (t
);
5022 friends
!= NULL_TREE
;
5023 friends
= TREE_CHAIN (friends
))
5024 if (TREE_PURPOSE (friends
) == error_mark_node
)
5026 tsubst_friend_function (TREE_VALUE (friends
),
5029 my_friendly_abort (20000216);
5032 for (t
= CLASSTYPE_FRIEND_CLASSES (pattern
);
5036 tree friend_type
= TREE_VALUE (t
);
5037 tree new_friend_type
;
5039 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
5040 new_friend_type
= tsubst_friend_class (friend_type
, args
);
5041 else if (uses_template_parms (friend_type
))
5042 new_friend_type
= tsubst (friend_type
, args
, /*complain=*/1,
5046 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (friend_type
));
5048 /* The call to xref_tag_from_type does injection for friend
5050 push_nested_namespace (ns
);
5052 xref_tag_from_type (friend_type
, NULL_TREE
, 1);
5053 pop_nested_namespace (ns
);
5056 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
5057 /* Trick make_friend_class into realizing that the friend
5058 we're adding is a template, not an ordinary class. It's
5059 important that we use make_friend_class since it will
5060 perform some error-checking and output cross-reference
5062 ++processing_template_decl
;
5064 make_friend_class (type
, new_friend_type
);
5066 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
5067 --processing_template_decl
;
5070 for (t
= TYPE_FIELDS (type
); t
; t
= TREE_CHAIN (t
))
5071 if (TREE_CODE (t
) == FIELD_DECL
)
5073 TREE_TYPE (t
) = complete_type (TREE_TYPE (t
));
5074 require_complete_type (t
);
5077 /* Set the file and line number information to whatever is given for
5078 the class itself. This puts error messages involving generated
5079 implicit functions at a predictable point, and the same point
5080 that would be used for non-template classes. */
5081 lineno
= DECL_SOURCE_LINE (typedecl
);
5082 input_filename
= DECL_SOURCE_FILE (typedecl
);
5084 unreverse_member_declarations (type
);
5085 finish_struct_1 (type
);
5086 CLASSTYPE_GOT_SEMICOLON (type
) = 1;
5088 /* Clear this now so repo_template_used is happy. */
5089 TYPE_BEING_DEFINED (type
) = 0;
5090 repo_template_used (type
);
5092 /* Now that the class is complete, instantiate default arguments for
5093 any member functions. We don't do this earlier because the
5094 default arguments may reference members of the class. */
5095 if (!PRIMARY_TEMPLATE_P (template))
5096 for (t
= TYPE_METHODS (type
); t
; t
= TREE_CHAIN (t
))
5097 if (TREE_CODE (t
) == FUNCTION_DECL
5098 /* Implicitly generated member functions will not have tmplate
5099 information; they are not instantiations, but instead are
5100 created "fresh" for each instantiation. */
5101 && DECL_TEMPLATE_INFO (t
))
5102 tsubst_default_arguments (t
);
5105 pop_from_top_level ();
5115 if (t1
== NULL_TREE
)
5116 return t2
== NULL_TREE
;
5117 if (t2
== NULL_TREE
)
5119 /* Don't care if one declares its arg const and the other doesn't -- the
5120 main variant of the arg type is all that matters. */
5121 if (TYPE_MAIN_VARIANT (TREE_VALUE (t1
))
5122 != TYPE_MAIN_VARIANT (TREE_VALUE (t2
)))
5124 return list_eq (TREE_CHAIN (t1
), TREE_CHAIN (t2
));
5127 /* If arg is a non-type template parameter that does not depend on template
5128 arguments, fold it like we weren't in the body of a template. */
5131 maybe_fold_nontype_arg (arg
)
5134 /* If we're not in a template, ARG is already as simple as it's going to
5135 get, and trying to reprocess the trees will break. */
5136 if (! processing_template_decl
)
5139 if (TREE_CODE_CLASS (TREE_CODE (arg
)) != 't'
5140 && !uses_template_parms (arg
))
5142 /* Sometimes, one of the args was an expression involving a
5143 template constant parameter, like N - 1. Now that we've
5144 tsubst'd, we might have something like 2 - 1. This will
5145 confuse lookup_template_class, so we do constant folding
5146 here. We have to unset processing_template_decl, to
5147 fool build_expr_from_tree() into building an actual
5150 int saved_processing_template_decl
= processing_template_decl
;
5151 processing_template_decl
= 0;
5152 arg
= fold (build_expr_from_tree (arg
));
5153 processing_template_decl
= saved_processing_template_decl
;
5158 /* Return the TREE_VEC with the arguments for the innermost template header,
5159 where ARGS is either that or the VEC of VECs for all the
5163 innermost_args (args
)
5166 return TMPL_ARGS_LEVEL (args
, TMPL_ARGS_DEPTH (args
));
5169 /* Substitute ARGS into the vector of template arguments T. */
5172 tsubst_template_arg_vector (t
, args
, complain
)
5177 int len
= TREE_VEC_LENGTH (t
), need_new
= 0, i
;
5178 tree
*elts
= (tree
*) alloca (len
* sizeof (tree
));
5180 bzero ((char *) elts
, len
* sizeof (tree
));
5182 for (i
= 0; i
< len
; i
++)
5184 if (TREE_VEC_ELT (t
, i
) != NULL_TREE
5185 && TREE_CODE (TREE_VEC_ELT (t
, i
)) == TREE_VEC
)
5186 elts
[i
] = tsubst_template_arg_vector (TREE_VEC_ELT (t
, i
),
5189 elts
[i
] = maybe_fold_nontype_arg
5190 (tsubst_expr (TREE_VEC_ELT (t
, i
), args
, complain
,
5193 if (elts
[i
] != TREE_VEC_ELT (t
, i
))
5200 t
= make_tree_vec (len
);
5201 for (i
= 0; i
< len
; i
++)
5202 TREE_VEC_ELT (t
, i
) = elts
[i
];
5207 /* Return the result of substituting ARGS into the template parameters
5208 given by PARMS. If there are m levels of ARGS and m + n levels of
5209 PARMS, then the result will contain n levels of PARMS. For
5210 example, if PARMS is `template <class T> template <class U>
5211 template <T*, U, class V>' and ARGS is {{int}, {double}} then the
5212 result will be `template <int*, double, class V>'. */
5215 tsubst_template_parms (parms
, args
, complain
)
5223 for (new_parms
= &r
;
5224 TMPL_PARMS_DEPTH (parms
) > TMPL_ARGS_DEPTH (args
);
5225 new_parms
= &(TREE_CHAIN (*new_parms
)),
5226 parms
= TREE_CHAIN (parms
))
5229 make_tree_vec (TREE_VEC_LENGTH (TREE_VALUE (parms
)));
5232 for (i
= 0; i
< TREE_VEC_LENGTH (new_vec
); ++i
)
5234 tree default_value
=
5235 TREE_PURPOSE (TREE_VEC_ELT (TREE_VALUE (parms
), i
));
5237 TREE_VALUE (TREE_VEC_ELT (TREE_VALUE (parms
), i
));
5239 TREE_VEC_ELT (new_vec
, i
)
5240 = build_tree_list (tsubst (default_value
, args
, complain
,
5242 tsubst (parm_decl
, args
, complain
,
5247 tree_cons (build_int_2 (0, (TMPL_PARMS_DEPTH (parms
)
5248 - TMPL_ARGS_DEPTH (args
))),
5249 new_vec
, NULL_TREE
);
5255 /* Substitute the ARGS into the indicated aggregate (or enumeration)
5256 type T. If T is not an aggregate or enumeration type, it is
5257 handled as if by tsubst. IN_DECL is as for tsubst. If
5258 ENTERING_SCOPE is non-zero, T is the context for a template which
5259 we are presently tsubst'ing. Return the subsituted value. */
5262 tsubst_aggr_type (t
, args
, complain
, in_decl
, entering_scope
)
5272 switch (TREE_CODE (t
))
5275 if (TYPE_PTRMEMFUNC_P (t
))
5277 tree r
= build_ptrmemfunc_type
5278 (tsubst (TYPE_PTRMEMFUNC_FN_TYPE (t
), args
, complain
, in_decl
));
5279 return cp_build_qualified_type_real (r
, TYPE_QUALS (t
),
5283 /* else fall through */
5286 if (TYPE_TEMPLATE_INFO (t
))
5292 /* First, determine the context for the type we are looking
5294 if (TYPE_CONTEXT (t
) != NULL_TREE
)
5295 context
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
,
5297 in_decl
, /*entering_scope=*/1);
5299 context
= NULL_TREE
;
5301 /* Then, figure out what arguments are appropriate for the
5302 type we are trying to find. For example, given:
5304 template <class T> struct S;
5305 template <class T, class U> void f(T, U) { S<U> su; }
5307 and supposing that we are instantiating f<int, double>,
5308 then our ARGS will be {int, double}, but, when looking up
5309 S we only want {double}. */
5310 argvec
= tsubst_template_arg_vector (TYPE_TI_ARGS (t
), args
,
5313 r
= lookup_template_class (t
, argvec
, in_decl
, context
,
5316 return cp_build_qualified_type_real (r
, TYPE_QUALS (t
),
5320 /* This is not a template type, so there's nothing to do. */
5324 return tsubst (t
, args
, complain
, in_decl
);
5328 /* Substitute into the default argument ARG (a default argument for
5329 FN), which has the indicated TYPE. */
5332 tsubst_default_argument (fn
, type
, arg
)
5337 /* This default argument came from a template. Instantiate the
5338 default argument here, not in tsubst. In the case of
5347 we must be careful to do name lookup in the scope of S<T>,
5348 rather than in the current class. */
5349 if (DECL_CLASS_SCOPE_P (fn
))
5350 pushclass (DECL_CONTEXT (fn
), 2);
5352 arg
= tsubst_expr (arg
, DECL_TI_ARGS (fn
), /*complain=*/1, NULL_TREE
);
5354 if (DECL_CLASS_SCOPE_P (fn
))
5357 /* Make sure the default argument is reasonable. */
5358 arg
= check_default_argument (type
, arg
);
5363 /* Substitute into all the default arguments for FN. */
5366 tsubst_default_arguments (fn
)
5372 tmpl_args
= DECL_TI_ARGS (fn
);
5374 /* If this function is not yet instantiated, we certainly don't need
5375 its default arguments. */
5376 if (uses_template_parms (tmpl_args
))
5379 for (arg
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
5381 arg
= TREE_CHAIN (arg
))
5382 if (TREE_PURPOSE (arg
))
5383 TREE_PURPOSE (arg
) = tsubst_default_argument (fn
,
5385 TREE_PURPOSE (arg
));
5388 /* Substitute the ARGS into the T, which is a _DECL. TYPE is the
5389 (already computed) substitution of ARGS into TREE_TYPE (T), if
5390 appropriate. Return the result of the substitution. IN_DECL is as
5394 tsubst_decl (t
, args
, type
, in_decl
)
5401 char* saved_filename
;
5404 /* Set the filename and linenumber to improve error-reporting. */
5405 saved_lineno
= lineno
;
5406 saved_filename
= input_filename
;
5407 lineno
= DECL_SOURCE_LINE (t
);
5408 input_filename
= DECL_SOURCE_FILE (t
);
5410 switch (TREE_CODE (t
))
5414 /* We can get here when processing a member template function
5415 of a template class. */
5416 tree decl
= DECL_TEMPLATE_RESULT (t
);
5418 int is_template_template_parm
= DECL_TEMPLATE_TEMPLATE_PARM_P (t
);
5420 if (!is_template_template_parm
)
5422 /* We might already have an instance of this template.
5423 The ARGS are for the surrounding class type, so the
5424 full args contain the tsubst'd args for the context,
5425 plus the innermost args from the template decl. */
5426 tree tmpl_args
= DECL_CLASS_TEMPLATE_P (t
)
5427 ? CLASSTYPE_TI_ARGS (TREE_TYPE (t
))
5428 : DECL_TI_ARGS (DECL_RESULT (t
));
5431 full_args
= tsubst_template_arg_vector (tmpl_args
, args
,
5434 /* tsubst_template_arg_vector doesn't copy the vector if
5435 nothing changed. But, *something* should have
5437 my_friendly_assert (full_args
!= tmpl_args
, 0);
5439 spec
= retrieve_specialization (t
, full_args
);
5440 if (spec
!= NULL_TREE
)
5447 /* Make a new template decl. It will be similar to the
5448 original, but will record the current template arguments.
5449 We also create a new function declaration, which is just
5450 like the old one, but points to this new template, rather
5451 than the old one. */
5454 my_friendly_assert (DECL_LANG_SPECIFIC (r
) != 0, 0);
5455 TREE_CHAIN (r
) = NULL_TREE
;
5457 if (is_template_template_parm
)
5459 tree new_decl
= tsubst (decl
, args
, /*complain=*/1, in_decl
);
5460 DECL_RESULT (r
) = new_decl
;
5461 TREE_TYPE (r
) = TREE_TYPE (new_decl
);
5466 = tsubst_aggr_type (DECL_CONTEXT (t
), args
,
5467 /*complain=*/1, in_decl
,
5468 /*entering_scope=*/1);
5469 DECL_VIRTUAL_CONTEXT (r
)
5470 = tsubst_aggr_type (DECL_VIRTUAL_CONTEXT (t
), args
,
5471 /*complain=*/1, in_decl
,
5472 /*entering_scope=*/1);
5473 DECL_TEMPLATE_INFO (r
) = build_tree_list (t
, args
);
5475 if (TREE_CODE (decl
) == TYPE_DECL
)
5477 tree new_type
= tsubst (TREE_TYPE (t
), args
,
5478 /*complain=*/1, in_decl
);
5479 TREE_TYPE (r
) = new_type
;
5480 CLASSTYPE_TI_TEMPLATE (new_type
) = r
;
5481 DECL_RESULT (r
) = TYPE_MAIN_DECL (new_type
);
5482 DECL_TI_ARGS (r
) = CLASSTYPE_TI_ARGS (new_type
);
5486 tree new_decl
= tsubst (decl
, args
, /*complain=*/1, in_decl
);
5487 DECL_RESULT (r
) = new_decl
;
5488 DECL_TI_TEMPLATE (new_decl
) = r
;
5489 TREE_TYPE (r
) = TREE_TYPE (new_decl
);
5490 DECL_TI_ARGS (r
) = DECL_TI_ARGS (new_decl
);
5493 SET_DECL_IMPLICIT_INSTANTIATION (r
);
5494 DECL_TEMPLATE_INSTANTIATIONS (r
) = NULL_TREE
;
5495 DECL_TEMPLATE_SPECIALIZATIONS (r
) = NULL_TREE
;
5497 /* The template parameters for this new template are all the
5498 template parameters for the old template, except the
5499 outermost level of parameters. */
5500 DECL_TEMPLATE_PARMS (r
)
5501 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t
), args
,
5504 if (PRIMARY_TEMPLATE_P (t
))
5505 DECL_PRIMARY_TEMPLATE (r
) = r
;
5507 /* We don't partially instantiate partial specializations. */
5508 if (TREE_CODE (decl
) == TYPE_DECL
)
5511 for (spec
= DECL_TEMPLATE_SPECIALIZATIONS (t
);
5513 spec
= TREE_CHAIN (spec
))
5515 /* It helps to consider example here. Consider:
5526 Now, for example, we are instantiating S<int>::f(U u).
5527 We want to make a template:
5532 It will have a specialization, for the case U = int*, of
5536 void S<int>::f<int*>(int*);
5538 This specialization will be an instantiation of
5539 the specialization given in the declaration of S, with
5540 argument list int*. */
5542 tree fn
= TREE_VALUE (spec
);
5546 if (!DECL_TEMPLATE_SPECIALIZATION (fn
))
5547 /* Instantiations are on the same list, but they're of
5548 no concern to us. */
5551 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
5552 /* A full specialization. There's no need to record
5556 spec_args
= tsubst (DECL_TI_ARGS (fn
), args
,
5557 /*complain=*/1, in_decl
);
5558 new_fn
= tsubst (DECL_RESULT (most_general_template (fn
)),
5559 spec_args
, /*complain=*/1, in_decl
);
5560 DECL_TI_TEMPLATE (new_fn
) = fn
;
5561 register_specialization (new_fn
, r
,
5562 innermost_args (spec_args
));
5565 /* Record this partial instantiation. */
5566 register_specialization (r
, t
,
5567 DECL_TI_ARGS (DECL_RESULT (r
)));
5575 tree argvec
= NULL_TREE
;
5582 /* Nobody should be tsubst'ing into non-template functions. */
5583 my_friendly_assert (DECL_TEMPLATE_INFO (t
) != NULL_TREE
, 0);
5585 if (TREE_CODE (DECL_TI_TEMPLATE (t
)) == TEMPLATE_DECL
)
5589 /* Calculate the most general template of which R is a
5590 specialization, and the complete set of arguments used to
5592 gen_tmpl
= most_general_template (DECL_TI_TEMPLATE (t
));
5594 = tsubst_template_arg_vector (DECL_TI_ARGS
5595 (DECL_TEMPLATE_RESULT (gen_tmpl
)),
5596 args
, /*complain=*/1);
5598 /* Check to see if we already have this specialization. */
5599 spec
= retrieve_specialization (gen_tmpl
, argvec
);
5607 /* Here, we deal with the peculiar case:
5609 template <class T> struct S {
5610 template <class U> friend void f();
5612 template <class U> void f() {}
5614 template void f<double>();
5616 Here, the ARGS for the instantiation of will be {int,
5617 double}. But, we only need as many ARGS as there are
5618 levels of template parameters in CODE_PATTERN. We are
5619 careful not to get fooled into reducing the ARGS in
5622 template <class T> struct S { template <class U> void f(U); }
5623 template <class T> template <> void S<T>::f(int) {}
5625 which we can spot because the pattern will be a
5626 specialization in this case. */
5627 args_depth
= TMPL_ARGS_DEPTH (args
);
5629 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (t
)));
5630 if (args_depth
> parms_depth
5631 && !DECL_TEMPLATE_SPECIALIZATION (t
))
5633 my_friendly_assert (DECL_FRIEND_P (t
), 0);
5635 if (parms_depth
> 1)
5639 args
= make_tree_vec (parms_depth
);
5640 for (i
= 0; i
< parms_depth
; ++i
)
5641 TREE_VEC_ELT (args
, i
) =
5642 TREE_VEC_ELT (args
, i
+ (args_depth
- parms_depth
));
5645 args
= TREE_VEC_ELT (args
, args_depth
- parms_depth
);
5650 /* This special case arises when we have something like this:
5652 template <class T> struct S {
5653 friend void f<int>(int, double);
5656 Here, the DECL_TI_TEMPLATE for the friend declaration
5657 will be a LOOKUP_EXPR or an IDENTIFIER_NODE. We are
5658 being called from tsubst_friend_function, and we want
5659 only to create a new decl (R) with appropriate types so
5660 that we can call determine_specialization. */
5661 my_friendly_assert ((TREE_CODE (DECL_TI_TEMPLATE (t
))
5663 || (TREE_CODE (DECL_TI_TEMPLATE (t
))
5664 == IDENTIFIER_NODE
), 0);
5665 gen_tmpl
= NULL_TREE
;
5668 if (DECL_CLASS_SCOPE_P (t
))
5670 if (DECL_NAME (t
) == constructor_name (DECL_CONTEXT (t
)))
5674 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
,
5676 /*entering_scope=*/1);
5681 ctx
= DECL_CONTEXT (t
);
5683 type
= tsubst (type
, args
, /*complain=*/1, in_decl
);
5684 if (type
== error_mark_node
)
5685 return error_mark_node
;
5687 /* We do NOT check for matching decls pushed separately at this
5688 point, as they may not represent instantiations of this
5689 template, and in any case are considered separate under the
5690 discrete model. Instead, see add_maybe_template. */
5694 DECL_USE_TEMPLATE (r
) = 0;
5695 TREE_TYPE (r
) = type
;
5697 DECL_CONTEXT (r
) = ctx
;
5698 DECL_VIRTUAL_CONTEXT (r
)
5699 = tsubst_aggr_type (DECL_VIRTUAL_CONTEXT (t
), args
,
5701 /*entering_scope=*/1);
5703 if (member
&& IDENTIFIER_TYPENAME_P (DECL_NAME (r
)))
5704 /* Type-conversion operator. Reconstruct the name, in
5705 case it's the name of one of the template's parameters. */
5706 DECL_NAME (r
) = build_typename_overload (TREE_TYPE (type
));
5708 DECL_ARGUMENTS (r
) = tsubst (DECL_ARGUMENTS (t
), args
,
5710 DECL_MAIN_VARIANT (r
) = r
;
5711 DECL_RESULT (r
) = NULL_TREE
;
5713 TREE_STATIC (r
) = 0;
5714 TREE_PUBLIC (r
) = TREE_PUBLIC (t
);
5715 DECL_EXTERNAL (r
) = 1;
5716 DECL_INTERFACE_KNOWN (r
) = 0;
5717 DECL_DEFER_OUTPUT (r
) = 0;
5718 TREE_CHAIN (r
) = NULL_TREE
;
5719 DECL_PENDING_INLINE_INFO (r
) = 0;
5720 DECL_PENDING_INLINE_P (r
) = 0;
5723 /* Set up the DECL_TEMPLATE_INFO for R and compute its mangled
5724 name. There's no need to do this in the special friend
5725 case mentioned above where GEN_TMPL is NULL. */
5728 DECL_TEMPLATE_INFO (r
)
5729 = tree_cons (gen_tmpl
, argvec
, NULL_TREE
);
5730 SET_DECL_IMPLICIT_INSTANTIATION (r
);
5731 register_specialization (r
, gen_tmpl
, argvec
);
5733 /* Set the mangled name for R. */
5734 if (DECL_DESTRUCTOR_P (t
))
5735 DECL_ASSEMBLER_NAME (r
) = build_destructor_name (ctx
);
5738 /* Instantiations of template functions must be mangled
5739 specially, in order to conform to 14.5.5.1
5740 [temp.over.link]. */
5741 tree tmpl
= DECL_TI_TEMPLATE (t
);
5743 /* TMPL will be NULL if this is a specialization of a
5744 member function of a template class. */
5745 if (name_mangling_version
< 1
5746 || tmpl
== NULL_TREE
5747 || (member
&& !is_member_template (tmpl
)
5748 && !DECL_TEMPLATE_INFO (tmpl
)))
5749 set_mangled_name_for_decl (r
);
5751 set_mangled_name_for_template_decl (r
);
5755 make_decl_rtl (r
, NULL_PTR
, 1);
5757 /* Like grokfndecl. If we don't do this, pushdecl will
5758 mess up our TREE_CHAIN because it doesn't find a
5759 previous decl. Sigh. */
5761 && ! uses_template_parms (r
)
5762 && (IDENTIFIER_GLOBAL_VALUE (DECL_ASSEMBLER_NAME (r
))
5764 SET_IDENTIFIER_GLOBAL_VALUE (DECL_ASSEMBLER_NAME (r
), r
);
5766 /* We're not supposed to instantiate default arguments
5767 until they are called, for a template. But, for a
5770 template <class T> void f ()
5771 { extern void g(int i = T()); }
5773 we should do the substitution when the template is
5774 instantiated. We handle the member function case in
5775 instantiate_class_template since the default arguments
5776 might refer to other members of the class. */
5778 && !PRIMARY_TEMPLATE_P (gen_tmpl
)
5779 && !uses_template_parms (argvec
))
5780 tsubst_default_arguments (r
);
5783 /* Copy the list of befriending classes. */
5784 for (friends
= &DECL_BEFRIENDING_CLASSES (r
);
5786 friends
= &TREE_CHAIN (*friends
))
5788 *friends
= copy_node (*friends
);
5789 TREE_VALUE (*friends
) = tsubst (TREE_VALUE (*friends
),
5790 args
, /*complain=*/1,
5794 if (DECL_CONSTRUCTOR_P (r
))
5796 maybe_retrofit_in_chrg (r
);
5797 grok_ctor_properties (ctx
, r
);
5799 else if (DECL_OVERLOADED_OPERATOR_P (r
))
5800 grok_op_properties (r
, DECL_VIRTUAL_P (r
), DECL_FRIEND_P (r
));
5807 TREE_TYPE (r
) = type
;
5808 c_apply_type_quals_to_decl (CP_TYPE_QUALS (type
), r
);
5810 if (TREE_CODE (DECL_INITIAL (r
)) != TEMPLATE_PARM_INDEX
)
5811 DECL_INITIAL (r
) = TREE_TYPE (r
);
5813 DECL_INITIAL (r
) = tsubst (DECL_INITIAL (r
), args
,
5814 /*complain=*/1, in_decl
);
5816 DECL_CONTEXT (r
) = NULL_TREE
;
5817 if (PROMOTE_PROTOTYPES
5818 && (TREE_CODE (type
) == INTEGER_TYPE
5819 || TREE_CODE (type
) == ENUMERAL_TYPE
)
5820 && TYPE_PRECISION (type
) < TYPE_PRECISION (integer_type_node
))
5821 DECL_ARG_TYPE (r
) = integer_type_node
;
5823 TREE_CHAIN (r
) = tsubst (TREE_CHAIN (t
), args
,
5824 /*complain=*/1, TREE_CHAIN (t
));
5832 TREE_TYPE (r
) = type
;
5833 c_apply_type_quals_to_decl (CP_TYPE_QUALS (type
), r
);
5835 /* We don't have to set DECL_CONTEXT here; it is set by
5836 finish_member_declaration. */
5837 DECL_INITIAL (r
) = tsubst_expr (DECL_INITIAL (t
), args
,
5838 /*complain=*/1, in_decl
);
5839 TREE_CHAIN (r
) = NULL_TREE
;
5840 if (TREE_CODE (type
) == VOID_TYPE
)
5841 cp_error_at ("instantiation of `%D' as type void", r
);
5849 = tsubst_copy (DECL_INITIAL (t
), args
, /*complain=*/1, in_decl
);
5850 TREE_CHAIN (r
) = NULL_TREE
;
5855 if (DECL_IMPLICIT_TYPEDEF_P (t
))
5857 /* For an implicit typedef, we just want the implicit
5858 typedef for the tsubst'd type. We've already got the
5859 tsubst'd type, as TYPE, so we just need it's associated
5861 r
= TYPE_NAME (type
);
5864 else if (!DECL_LANG_SPECIFIC (t
))
5866 /* For a template type parameter, we don't have to do
5867 anything special. */
5868 r
= TYPE_NAME (type
);
5882 /* Nobody should be tsubst'ing into non-template variables. */
5883 my_friendly_assert (DECL_LANG_SPECIFIC (t
)
5884 && DECL_TEMPLATE_INFO (t
) != NULL_TREE
, 0);
5886 if (TYPE_P (CP_DECL_CONTEXT (t
)))
5887 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
,
5889 in_decl
, /*entering_scope=*/1);
5891 /* Subsequent calls to pushdecl will fill this in. */
5894 /* Check to see if we already have this specialization. */
5895 tmpl
= DECL_TI_TEMPLATE (t
);
5896 gen_tmpl
= most_general_template (tmpl
);
5897 argvec
= tsubst (DECL_TI_ARGS (t
), args
, /*complain=*/1, in_decl
);
5899 spec
= retrieve_specialization (gen_tmpl
, argvec
);
5901 spec
= retrieve_local_specialization (gen_tmpl
,
5902 current_function_decl
);
5910 /* This declaration is going to have to be around for a while,
5911 so me make sure it is on a saveable obstack. */
5914 TREE_TYPE (r
) = type
;
5915 c_apply_type_quals_to_decl (CP_TYPE_QUALS (type
), r
);
5916 DECL_CONTEXT (r
) = ctx
;
5918 /* Don't try to expand the initializer until someone tries to use
5919 this variable; otherwise we run into circular dependencies. */
5920 DECL_INITIAL (r
) = NULL_TREE
;
5922 DECL_SIZE (r
) = DECL_SIZE_UNIT (r
) = 0;
5925 /* For __PRETTY_FUNCTION__ we have to adjust the initializer. */
5926 if (DECL_PRETTY_FUNCTION_P (r
))
5928 DECL_INITIAL (r
) = tsubst (DECL_INITIAL (t
),
5932 TREE_TYPE (r
) = TREE_TYPE (DECL_INITIAL (r
));
5935 /* Even if the original location is out of scope, the newly
5936 substituted one is not. */
5937 if (TREE_CODE (r
) == VAR_DECL
)
5938 DECL_DEAD_FOR_LOCAL (r
) = 0;
5940 /* A static data member declaration is always marked external
5941 when it is declared in-class, even if an initializer is
5942 present. We mimic the non-template processing here. */
5944 DECL_EXTERNAL (r
) = 1;
5946 DECL_TEMPLATE_INFO (r
) = tree_cons (tmpl
, argvec
, NULL_TREE
);
5947 SET_DECL_IMPLICIT_INSTANTIATION (r
);
5949 register_specialization (r
, gen_tmpl
, argvec
);
5951 register_local_specialization (r
, gen_tmpl
,
5952 current_function_decl
);
5954 TREE_CHAIN (r
) = NULL_TREE
;
5955 if (TREE_CODE (r
) == VAR_DECL
&& TREE_CODE (type
) == VOID_TYPE
)
5956 cp_error_at ("instantiation of `%D' as type void", r
);
5961 my_friendly_abort (0);
5964 /* Restore the file and line information. */
5965 lineno
= saved_lineno
;
5966 input_filename
= saved_filename
;
5971 /* Substitue into the ARG_TYPES of a function type. */
5974 tsubst_arg_types (arg_types
, args
, complain
, in_decl
)
5980 tree remaining_arg_types
;
5983 if (!arg_types
|| arg_types
== void_list_node
)
5986 remaining_arg_types
= tsubst_arg_types (TREE_CHAIN (arg_types
),
5987 args
, complain
, in_decl
);
5988 if (remaining_arg_types
== error_mark_node
)
5989 return error_mark_node
;
5991 type
= tsubst (TREE_VALUE (arg_types
), args
, complain
, in_decl
);
5992 if (type
== error_mark_node
)
5993 return error_mark_node
;
5995 /* Do array-to-pointer, function-to-pointer conversion, and ignore
5996 top-level qualifiers as required. */
5997 type
= TYPE_MAIN_VARIANT (type_decays_to (type
));
5999 /* Note that we do not substitute into default arguments here. The
6000 standard mandates that they be instantiated only when needed,
6001 which is done in build_over_call. */
6002 return hash_tree_cons (TREE_PURPOSE (arg_types
), type
,
6003 remaining_arg_types
);
6007 /* Substitute into a FUNCTION_TYPE or METHOD_TYPE. This routine does
6008 *not* handle the exception-specification for FNTYPE, because the
6009 initial substitution of explicitly provided template parameters
6010 during argument deduction forbids substitution into the
6011 exception-specification:
6015 All references in the function type of the function template to the
6016 corresponding template parameters are replaced by the specified tem-
6017 plate argument values. If a substitution in a template parameter or
6018 in the function type of the function template results in an invalid
6019 type, type deduction fails. [Note: The equivalent substitution in
6020 exception specifications is done only when the function is instanti-
6021 ated, at which point a program is ill-formed if the substitution
6022 results in an invalid type.] */
6025 tsubst_function_type (t
, args
, complain
, in_decl
)
6035 /* The TYPE_CONTEXT is not used for function/method types. */
6036 my_friendly_assert (TYPE_CONTEXT (t
) == NULL_TREE
, 0);
6038 /* Substitue the return type. */
6039 return_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
6040 if (return_type
== error_mark_node
)
6041 return error_mark_node
;
6043 /* Substitue the argument types. */
6044 arg_types
= tsubst_arg_types (TYPE_ARG_TYPES (t
), args
,
6046 if (arg_types
== error_mark_node
)
6047 return error_mark_node
;
6049 /* Construct a new type node and return it. */
6050 if (TREE_CODE (t
) == FUNCTION_TYPE
)
6051 fntype
= build_function_type (return_type
, arg_types
);
6054 tree r
= TREE_TYPE (TREE_VALUE (arg_types
));
6055 if (! IS_AGGR_TYPE (r
))
6059 Type deduction may fail for any of the following
6062 -- Attempting to create "pointer to member of T" when T
6063 is not a class type. */
6065 cp_error ("creating pointer to member function of non-class type `%T'",
6067 return error_mark_node
;
6070 fntype
= build_cplus_method_type (r
, return_type
, TREE_CHAIN
6073 fntype
= build_qualified_type (fntype
, TYPE_QUALS (t
));
6074 fntype
= build_type_attribute_variant (fntype
, TYPE_ATTRIBUTES (t
));
6079 /* Substitute into the PARMS of a call-declarator. */
6082 tsubst_call_declarator_parms (parms
, args
, complain
, in_decl
)
6092 if (!parms
|| parms
== void_list_node
)
6095 new_parms
= tsubst_call_declarator_parms (TREE_CHAIN (parms
),
6096 args
, complain
, in_decl
);
6098 /* Figure out the type of this parameter. */
6099 type
= tsubst (TREE_VALUE (parms
), args
, complain
, in_decl
);
6101 /* Figure out the default argument as well. Note that we use
6102 tsubst_expr since the default argument is really an expression. */
6103 defarg
= tsubst_expr (TREE_PURPOSE (parms
), args
, complain
, in_decl
);
6105 /* Chain this parameter on to the front of those we have already
6106 processed. We don't use hash_tree_cons because that function
6107 doesn't check TREE_PARMLIST. */
6108 new_parms
= tree_cons (defarg
, type
, new_parms
);
6110 /* And note that these are parameters. */
6111 TREE_PARMLIST (new_parms
) = 1;
6116 /* Take the tree structure T and replace template parameters used
6117 therein with the argument vector ARGS. IN_DECL is an associated
6118 decl for diagnostics. If an error occurs, returns ERROR_MARK_NODE.
6119 An appropriate error message is issued only if COMPLAIN is
6120 non-zero. Note that we must be relatively non-tolerant of
6121 extensions here, in order to preserve conformance; if we allow
6122 substitutions that should not be allowed, we may allow argument
6123 deductions that should not succeed, and therefore report ambiguous
6124 overload situations where there are none. In theory, we could
6125 allow the substitution, but indicate that it should have failed,
6126 and allow our caller to make sure that the right thing happens, but
6127 we don't try to do this yet.
6129 This function is used for dealing with types, decls and the like;
6130 for expressions, use tsubst_expr or tsubst_copy. */
6133 tsubst (t
, args
, complain
, in_decl
)
6140 if (t
== NULL_TREE
|| t
== error_mark_node
6141 || t
== integer_type_node
6142 || t
== void_type_node
6143 || t
== char_type_node
6144 || TREE_CODE (t
) == NAMESPACE_DECL
)
6147 if (TREE_CODE (t
) == IDENTIFIER_NODE
)
6148 type
= IDENTIFIER_TYPE_VALUE (t
);
6150 type
= TREE_TYPE (t
);
6151 if (type
== unknown_type_node
)
6152 my_friendly_abort (42);
6154 if (type
&& TREE_CODE (t
) != FUNCTION_DECL
6155 && TREE_CODE (t
) != TYPENAME_TYPE
6156 && TREE_CODE (t
) != TEMPLATE_DECL
6157 && TREE_CODE (t
) != IDENTIFIER_NODE
6158 && TREE_CODE (t
) != FUNCTION_TYPE
6159 && TREE_CODE (t
) != METHOD_TYPE
)
6160 type
= tsubst (type
, args
, complain
, in_decl
);
6161 if (type
== error_mark_node
)
6162 return error_mark_node
;
6164 if (TREE_CODE_CLASS (TREE_CODE (t
)) == 'd')
6165 return tsubst_decl (t
, args
, type
, in_decl
);
6167 switch (TREE_CODE (t
))
6172 return tsubst_aggr_type (t
, args
, complain
, in_decl
,
6173 /*entering_scope=*/0);
6176 case IDENTIFIER_NODE
:
6188 if (t
== integer_type_node
)
6191 if (TREE_CODE (TYPE_MIN_VALUE (t
)) == INTEGER_CST
6192 && TREE_CODE (TYPE_MAX_VALUE (t
)) == INTEGER_CST
)
6196 tree max
, omax
= TREE_OPERAND (TYPE_MAX_VALUE (t
), 0);
6198 max
= tsubst_expr (omax
, args
, complain
, in_decl
);
6199 if (max
== error_mark_node
)
6200 return error_mark_node
;
6202 /* See if we can reduce this expression to something simpler. */
6203 max
= maybe_fold_nontype_arg (max
);
6204 if (!processing_template_decl
&& TREE_READONLY_DECL_P (max
))
6205 max
= decl_constant_value (max
);
6207 if (processing_template_decl
6208 /* When providing explicit arguments to a template
6209 function, but leaving some arguments for subsequent
6210 deduction, MAX may be template-dependent even if we're
6211 not PROCESSING_TEMPLATE_DECL. We still need to check for
6212 template parms, though; MAX won't be an INTEGER_CST for
6213 dynamic arrays, either. */
6214 || (TREE_CODE (max
) != INTEGER_CST
6215 && uses_template_parms (max
)))
6217 tree itype
= make_node (INTEGER_TYPE
);
6218 TYPE_MIN_VALUE (itype
) = size_zero_node
;
6219 TYPE_MAX_VALUE (itype
) = build_min (MINUS_EXPR
, sizetype
, max
,
6224 if (integer_zerop (omax
))
6226 /* Still allow an explicit array of size zero. */
6228 pedwarn ("creating array with size zero");
6230 else if (integer_zerop (max
)
6231 || (TREE_CODE (max
) == INTEGER_CST
6232 && INT_CST_LT (max
, integer_zero_node
)))
6236 Type deduction may fail for any of the following
6239 Attempting to create an array with a size that is
6240 zero or negative. */
6242 cp_error ("creating array with size zero (`%E')", max
);
6244 return error_mark_node
;
6247 return compute_array_index_type (NULL_TREE
, max
);
6250 case TEMPLATE_TYPE_PARM
:
6251 case TEMPLATE_TEMPLATE_PARM
:
6252 case TEMPLATE_PARM_INDEX
:
6260 if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
6261 || TREE_CODE (t
) == TEMPLATE_TEMPLATE_PARM
)
6263 idx
= TEMPLATE_TYPE_IDX (t
);
6264 level
= TEMPLATE_TYPE_LEVEL (t
);
6268 idx
= TEMPLATE_PARM_IDX (t
);
6269 level
= TEMPLATE_PARM_LEVEL (t
);
6272 if (TREE_VEC_LENGTH (args
) > 0)
6274 tree arg
= NULL_TREE
;
6276 levels
= TMPL_ARGS_DEPTH (args
);
6277 if (level
<= levels
)
6278 arg
= TMPL_ARG (args
, level
, idx
);
6280 if (arg
== error_mark_node
)
6281 return error_mark_node
;
6282 else if (arg
!= NULL_TREE
)
6284 if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
6286 my_friendly_assert (TREE_CODE_CLASS (TREE_CODE (arg
))
6288 return cp_build_qualified_type_real
6289 (arg
, CP_TYPE_QUALS (arg
) | CP_TYPE_QUALS (t
),
6292 else if (TREE_CODE (t
) == TEMPLATE_TEMPLATE_PARM
)
6294 if (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t
))
6296 /* We are processing a type constructed from
6297 a template template parameter */
6298 tree argvec
= tsubst (TYPE_TI_ARGS (t
),
6299 args
, complain
, in_decl
);
6300 if (argvec
== error_mark_node
)
6301 return error_mark_node
;
6303 /* We can get a TEMPLATE_TEMPLATE_PARM here when
6304 we are resolving nested-types in the signature of
6305 a member function templates.
6306 Otherwise ARG is a TEMPLATE_DECL and is the real
6307 template to be instantiated. */
6308 if (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
6309 arg
= TYPE_NAME (arg
);
6311 r
= lookup_template_class (DECL_NAME (arg
),
6314 /*entering_scope=*/0);
6315 return cp_build_qualified_type_real (r
,
6320 /* We are processing a template argument list. */
6328 my_friendly_abort (981018);
6331 /* This can happen during the attempted tsubst'ing in
6332 unify. This means that we don't yet have any information
6333 about the template parameter in question. */
6336 /* If we get here, we must have been looking at a parm for a
6337 more deeply nested template. Make a new version of this
6338 template parameter, but with a lower level. */
6339 switch (TREE_CODE (t
))
6341 case TEMPLATE_TYPE_PARM
:
6342 case TEMPLATE_TEMPLATE_PARM
:
6344 TEMPLATE_TYPE_PARM_INDEX (r
)
6345 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (t
),
6347 TYPE_STUB_DECL (r
) = TYPE_NAME (r
) = TEMPLATE_TYPE_DECL (r
);
6348 TYPE_MAIN_VARIANT (r
) = r
;
6349 TYPE_POINTER_TO (r
) = NULL_TREE
;
6350 TYPE_REFERENCE_TO (r
) = NULL_TREE
;
6352 if (TREE_CODE (t
) == TEMPLATE_TEMPLATE_PARM
6353 && TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t
))
6355 tree argvec
= tsubst (TYPE_TI_ARGS (t
), args
,
6357 if (argvec
== error_mark_node
)
6358 return error_mark_node
;
6360 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (r
)
6361 = tree_cons (TYPE_NAME (t
), argvec
, NULL_TREE
);
6365 case TEMPLATE_PARM_INDEX
:
6366 r
= reduce_template_parm_level (t
, type
, levels
);
6370 my_friendly_abort (0);
6378 tree purpose
, value
, chain
, result
;
6380 if (t
== void_list_node
)
6383 purpose
= TREE_PURPOSE (t
);
6386 purpose
= tsubst (purpose
, args
, complain
, in_decl
);
6387 if (purpose
== error_mark_node
)
6388 return error_mark_node
;
6390 value
= TREE_VALUE (t
);
6393 value
= tsubst (value
, args
, complain
, in_decl
);
6394 if (value
== error_mark_node
)
6395 return error_mark_node
;
6397 chain
= TREE_CHAIN (t
);
6398 if (chain
&& chain
!= void_type_node
)
6400 chain
= tsubst (chain
, args
, complain
, in_decl
);
6401 if (chain
== error_mark_node
)
6402 return error_mark_node
;
6404 if (purpose
== TREE_PURPOSE (t
)
6405 && value
== TREE_VALUE (t
)
6406 && chain
== TREE_CHAIN (t
))
6408 result
= hash_tree_cons (purpose
, value
, chain
);
6409 TREE_PARMLIST (result
) = TREE_PARMLIST (t
);
6413 if (type
!= NULL_TREE
)
6415 /* A binfo node. We always need to make a copy, of the node
6416 itself and of its BINFO_BASETYPES. */
6420 /* Make sure type isn't a typedef copy. */
6421 type
= BINFO_TYPE (TYPE_BINFO (type
));
6423 TREE_TYPE (t
) = complete_type (type
);
6424 if (IS_AGGR_TYPE (type
))
6426 BINFO_VTABLE (t
) = TYPE_BINFO_VTABLE (type
);
6427 BINFO_VIRTUALS (t
) = TYPE_BINFO_VIRTUALS (type
);
6428 if (TYPE_BINFO_BASETYPES (type
) != NULL_TREE
)
6429 BINFO_BASETYPES (t
) = copy_node (TYPE_BINFO_BASETYPES (type
));
6434 /* Otherwise, a vector of template arguments. */
6435 return tsubst_template_arg_vector (t
, args
, complain
);
6438 case REFERENCE_TYPE
:
6440 enum tree_code code
;
6442 if (type
== TREE_TYPE (t
))
6445 code
= TREE_CODE (t
);
6450 Type deduction may fail for any of the following
6453 -- Attempting to create a pointer to reference type.
6454 -- Attempting to create a reference to a reference type or
6455 a reference to void. */
6456 if (TREE_CODE (type
) == REFERENCE_TYPE
6457 || (code
== REFERENCE_TYPE
&& TREE_CODE (type
) == VOID_TYPE
))
6459 static int last_line
= 0;
6460 static char* last_file
= 0;
6462 /* We keep track of the last time we issued this error
6463 message to avoid spewing a ton of messages during a
6464 single bad template instantiation. */
6465 if (complain
&& (last_line
!= lineno
||
6466 last_file
!= input_filename
))
6468 if (TREE_CODE (type
) == VOID_TYPE
)
6469 cp_error ("forming reference to void");
6471 cp_error ("forming %s to reference type `%T'",
6472 (code
== POINTER_TYPE
) ? "pointer" : "reference",
6475 last_file
= input_filename
;
6478 return error_mark_node
;
6480 else if (code
== POINTER_TYPE
)
6481 r
= build_pointer_type (type
);
6483 r
= build_reference_type (type
);
6484 r
= cp_build_qualified_type_real (r
, TYPE_QUALS (t
), complain
);
6486 /* Will this ever be needed for TYPE_..._TO values? */
6492 r
= tsubst (TYPE_OFFSET_BASETYPE (t
), args
, complain
, in_decl
);
6493 if (r
== error_mark_node
|| !IS_AGGR_TYPE (r
))
6497 Type deduction may fail for any of the following
6500 -- Attempting to create "pointer to member of T" when T
6501 is not a class type. */
6503 cp_error ("creating pointer to member of non-class type `%T'",
6505 return error_mark_node
;
6507 return build_offset_type (r
, type
);
6515 fntype
= tsubst_function_type (t
, args
, complain
, in_decl
);
6516 if (fntype
== error_mark_node
)
6517 return error_mark_node
;
6519 /* Substitue the exception specification. */
6520 raises
= TYPE_RAISES_EXCEPTIONS (t
);
6523 tree list
= NULL_TREE
;
6525 if (! TREE_VALUE (raises
))
6528 for (; raises
!= NULL_TREE
; raises
= TREE_CHAIN (raises
))
6530 tree spec
= TREE_VALUE (raises
);
6532 spec
= tsubst (spec
, args
, complain
, in_decl
);
6533 if (spec
== error_mark_node
)
6535 list
= add_exception_specifier (list
, spec
, complain
);
6537 fntype
= build_exception_variant (fntype
, list
);
6543 tree domain
= tsubst (TYPE_DOMAIN (t
), args
, complain
, in_decl
);
6544 if (domain
== error_mark_node
)
6545 return error_mark_node
;
6547 /* As an optimization, we avoid regenerating the array type if
6548 it will obviously be the same as T. */
6549 if (type
== TREE_TYPE (t
) && domain
== TYPE_DOMAIN (t
))
6552 /* These checks should match the ones in grokdeclarator.
6556 The deduction may fail for any of the following reasons:
6558 -- Attempting to create an array with an element type that
6559 is void, a function type, or a reference type. */
6560 if (TREE_CODE (type
) == VOID_TYPE
6561 || TREE_CODE (type
) == FUNCTION_TYPE
6562 || TREE_CODE (type
) == REFERENCE_TYPE
)
6565 cp_error ("creating array of `%T'", type
);
6566 return error_mark_node
;
6569 r
= build_cplus_array_type (type
, domain
);
6576 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6578 tree e2
= tsubst (TREE_OPERAND (t
, 1), args
, complain
,
6581 if (e1
== error_mark_node
|| e2
== error_mark_node
)
6582 return error_mark_node
;
6584 return fold (build (TREE_CODE (t
), TREE_TYPE (t
), e1
, e2
));
6590 tree e
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6592 if (e
== error_mark_node
)
6593 return error_mark_node
;
6595 return fold (build (TREE_CODE (t
), TREE_TYPE (t
), e
));
6600 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
6601 in_decl
, /*entering_scope=*/1);
6602 tree f
= tsubst_copy (TYPENAME_TYPE_FULLNAME (t
), args
,
6605 if (ctx
== error_mark_node
|| f
== error_mark_node
)
6606 return error_mark_node
;
6608 if (!IS_AGGR_TYPE (ctx
))
6611 cp_error ("`%T' is not a class, struct, or union type",
6613 return error_mark_node
;
6615 else if (!uses_template_parms (ctx
) && !TYPE_BEING_DEFINED (ctx
))
6617 /* Normally, make_typename_type does not require that the CTX
6618 have complete type in order to allow things like:
6620 template <class T> struct S { typename S<T>::X Y; };
6622 But, such constructs have already been resolved by this
6623 point, so here CTX really should have complete type, unless
6624 it's a partial instantiation. */
6625 ctx
= complete_type (ctx
);
6626 if (!COMPLETE_TYPE_P (ctx
))
6629 incomplete_type_error (NULL_TREE
, ctx
);
6630 return error_mark_node
;
6634 f
= make_typename_type (ctx
, f
, complain
);
6635 if (f
== error_mark_node
)
6637 return cp_build_qualified_type_real (f
,
6639 | CP_TYPE_QUALS (t
),
6645 tree e
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6647 if (e
== error_mark_node
)
6648 return error_mark_node
;
6649 return make_pointer_declarator (type
, e
);
6654 tree e
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6656 if (e
== error_mark_node
)
6657 return error_mark_node
;
6658 return make_reference_declarator (type
, e
);
6663 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6665 tree e2
= tsubst_expr (TREE_OPERAND (t
, 1), args
, complain
,
6667 if (e1
== error_mark_node
|| e2
== error_mark_node
)
6668 return error_mark_node
;
6670 return build_parse_node (ARRAY_REF
, e1
, e2
, tsubst_expr
);
6675 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6677 tree e2
= (tsubst_call_declarator_parms
6678 (CALL_DECLARATOR_PARMS (t
), args
, complain
, in_decl
));
6679 tree e3
= tsubst (CALL_DECLARATOR_EXCEPTION_SPEC (t
), args
,
6682 if (e1
== error_mark_node
|| e2
== error_mark_node
6683 || e3
== error_mark_node
)
6684 return error_mark_node
;
6686 return make_call_declarator (e1
, e2
, CALL_DECLARATOR_QUALS (t
), e3
);
6691 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6693 tree e2
= tsubst (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
6694 if (e1
== error_mark_node
|| e2
== error_mark_node
)
6695 return error_mark_node
;
6697 return build_parse_node (TREE_CODE (t
), e1
, e2
);
6702 tree e1
= tsubst_expr (TYPE_FIELDS (t
), args
, complain
,
6704 if (e1
== error_mark_node
)
6705 return error_mark_node
;
6707 return TREE_TYPE (e1
);
6717 /* This code should match declare_hidden_char_array in
6719 name
= (*decl_printable_name
) (current_function_decl
, 2);
6720 len
= strlen (name
) + 1;
6721 type
= build_array_type (char_type_node
,
6722 build_index_type (build_int_2 (len
, 0)));
6723 str
= build_string (len
, name
);
6724 TREE_TYPE (str
) = type
;
6729 sorry ("use of `%s' in template",
6730 tree_code_name
[(int) TREE_CODE (t
)]);
6731 return error_mark_node
;
6735 /* Like tsubst, but deals with expressions. This function just replaces
6736 template parms; to finish processing the resultant expression, use
6740 tsubst_copy (t
, args
, complain
, in_decl
)
6745 enum tree_code code
;
6748 if (t
== NULL_TREE
|| t
== error_mark_node
)
6751 code
= TREE_CODE (t
);
6756 return do_identifier (DECL_NAME (t
), 0, NULL_TREE
);
6763 if (!DECL_CONTEXT (t
))
6764 /* This is a global enumeration constant. */
6767 /* Unfortunately, we cannot just call lookup_name here.
6770 template <int I> int f() {
6772 struct S { void g() { E e = a; } };
6775 When we instantiate f<7>::S::g(), say, lookup_name is not
6776 clever enough to find f<7>::a. */
6778 = tsubst_aggr_type (TREE_TYPE (t
), args
, complain
, in_decl
,
6779 /*entering_scope=*/0);
6781 for (v
= TYPE_VALUES (enum_type
);
6784 if (TREE_PURPOSE (v
) == DECL_NAME (t
))
6785 return TREE_VALUE (v
);
6787 /* We didn't find the name. That should never happen; if
6788 name-lookup found it during preliminary parsing, we
6789 should find it again here during instantiation. */
6790 my_friendly_abort (0);
6795 if (DECL_CONTEXT (t
))
6799 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
6800 /*entering_scope=*/1);
6801 if (ctx
!= DECL_CONTEXT (t
))
6802 return lookup_field (ctx
, DECL_NAME (t
), 0, 0);
6808 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
))
6809 t
= tsubst (t
, args
, complain
, in_decl
);
6814 if (is_member_template (t
))
6815 return tsubst (t
, args
, complain
, in_decl
);
6821 /* We must tsbust into a LOOKUP_EXPR in case the names to
6822 which it refers is a conversion operator; in that case the
6823 name will change. We avoid making unnecessary copies,
6826 tree id
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
6828 if (id
!= TREE_OPERAND (t
, 0))
6830 r
= build_nt (LOOKUP_EXPR
, id
);
6831 LOOKUP_EXPR_GLOBAL (r
) = LOOKUP_EXPR_GLOBAL (t
);
6839 case REINTERPRET_CAST_EXPR
:
6840 case CONST_CAST_EXPR
:
6841 case STATIC_CAST_EXPR
:
6842 case DYNAMIC_CAST_EXPR
:
6845 (code
, tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
6846 tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
));
6849 case PREDECREMENT_EXPR
:
6850 case PREINCREMENT_EXPR
:
6851 case POSTDECREMENT_EXPR
:
6852 case POSTINCREMENT_EXPR
:
6854 case TRUTH_NOT_EXPR
:
6857 case CONVERT_EXPR
: /* Unary + */
6866 (code
, tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
6867 tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
));
6872 case TRUNC_DIV_EXPR
:
6874 case FLOOR_DIV_EXPR
:
6875 case ROUND_DIV_EXPR
:
6876 case EXACT_DIV_EXPR
:
6878 case BIT_ANDTC_EXPR
:
6881 case TRUNC_MOD_EXPR
:
6882 case FLOOR_MOD_EXPR
:
6883 case TRUTH_ANDIF_EXPR
:
6884 case TRUTH_ORIF_EXPR
:
6885 case TRUTH_AND_EXPR
:
6906 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
6907 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
));
6911 tree fn
= TREE_OPERAND (t
, 0);
6912 if (is_overloaded_fn (fn
))
6913 fn
= tsubst_copy (get_first_fn (fn
), args
, complain
, in_decl
);
6915 /* Sometimes FN is a LOOKUP_EXPR. */
6916 fn
= tsubst_copy (fn
, args
, complain
, in_decl
);
6918 (code
, fn
, tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
,
6923 case METHOD_CALL_EXPR
:
6925 tree name
= TREE_OPERAND (t
, 0);
6926 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
6928 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
6930 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
6932 else if (TREE_CODE (name
) == SCOPE_REF
6933 && TREE_CODE (TREE_OPERAND (name
, 1)) == BIT_NOT_EXPR
)
6935 tree base
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
6937 name
= TREE_OPERAND (name
, 1);
6938 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
6940 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
6941 name
= build_nt (SCOPE_REF
, base
, name
);
6944 name
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
6946 (code
, name
, tsubst_copy (TREE_OPERAND (t
, 1), args
,
6948 tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
),
6953 /* This processing should really occur in tsubst_expr, However,
6954 tsubst_expr does not recurse into expressions, since it
6955 assumes that there aren't any statements inside them.
6956 Instead, it simply calls build_expr_from_tree. So, we need
6957 to expand the STMT_EXPR here. */
6958 if (!processing_template_decl
)
6960 tree stmt_expr
= begin_stmt_expr ();
6961 tsubst_expr (STMT_EXPR_STMT (t
), args
,
6963 return finish_stmt_expr (stmt_expr
);
6970 case PSEUDO_DTOR_EXPR
:
6973 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
6974 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
),
6975 tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
));
6982 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
6983 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
),
6984 tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
));
6985 NEW_EXPR_USE_GLOBAL (r
) = NEW_EXPR_USE_GLOBAL (t
);
6992 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
6993 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
));
6994 DELETE_EXPR_USE_GLOBAL (r
) = DELETE_EXPR_USE_GLOBAL (t
);
6995 DELETE_EXPR_USE_VEC (r
) = DELETE_EXPR_USE_VEC (t
);
6999 case TEMPLATE_ID_EXPR
:
7001 /* Substituted template arguments */
7002 tree targs
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
,
7005 if (targs
&& TREE_CODE (targs
) == TREE_LIST
)
7008 for (chain
= targs
; chain
; chain
= TREE_CHAIN (chain
))
7009 TREE_VALUE (chain
) = maybe_fold_nontype_arg (TREE_VALUE (chain
));
7014 for (i
= 0; i
< TREE_VEC_LENGTH (targs
); ++i
)
7015 TREE_VEC_ELT (targs
, i
)
7016 = maybe_fold_nontype_arg (TREE_VEC_ELT (targs
, i
));
7019 return lookup_template_function
7020 (tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
), targs
);
7025 tree purpose
, value
, chain
;
7027 if (t
== void_list_node
)
7030 purpose
= TREE_PURPOSE (t
);
7032 purpose
= tsubst_copy (purpose
, args
, complain
, in_decl
);
7033 value
= TREE_VALUE (t
);
7035 value
= tsubst_copy (value
, args
, complain
, in_decl
);
7036 chain
= TREE_CHAIN (t
);
7037 if (chain
&& chain
!= void_type_node
)
7038 chain
= tsubst_copy (chain
, args
, complain
, in_decl
);
7039 if (purpose
== TREE_PURPOSE (t
)
7040 && value
== TREE_VALUE (t
)
7041 && chain
== TREE_CHAIN (t
))
7043 return tree_cons (purpose
, value
, chain
);
7050 case TEMPLATE_TYPE_PARM
:
7051 case TEMPLATE_TEMPLATE_PARM
:
7052 case TEMPLATE_PARM_INDEX
:
7054 case REFERENCE_TYPE
:
7061 return tsubst (t
, args
, complain
, in_decl
);
7063 case IDENTIFIER_NODE
:
7064 if (IDENTIFIER_TYPENAME_P (t
)
7065 /* Make sure it's not just a variable named `__opr', for instance,
7066 which can occur in some existing code. */
7068 return build_typename_overload
7069 (tsubst (TREE_TYPE (t
), args
, complain
, in_decl
));
7076 (CONSTRUCTOR
, tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
7077 NULL_TREE
, tsubst_copy (CONSTRUCTOR_ELTS (t
), args
,
7078 complain
, in_decl
));
7079 TREE_HAS_CONSTRUCTOR (r
) = TREE_HAS_CONSTRUCTOR (t
);
7084 return build_va_arg (tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
,
7086 tsubst (TREE_TYPE (t
), args
, complain
, in_decl
));
7089 return tsubst (t
, args
, complain
, in_decl
);
7096 /* Like tsubst_copy, but also does semantic processing. */
7099 tsubst_expr (t
, args
, complain
, in_decl
)
7106 if (t
== NULL_TREE
|| t
== error_mark_node
)
7109 if (processing_template_decl
)
7110 return tsubst_copy (t
, args
, complain
, in_decl
);
7112 switch (TREE_CODE (t
))
7116 finish_named_return_value
7117 (TREE_OPERAND (t
, 0),
7118 tsubst_expr (TREE_OPERAND (t
, 1), args
, /*complain=*/1, in_decl
));
7119 tsubst_expr (TREE_CHAIN (t
), args
, complain
, in_decl
);
7122 case CTOR_INITIALIZER
:
7124 current_member_init_list
7125 = tsubst_expr_values (TREE_OPERAND (t
, 0), args
);
7126 current_base_init_list
7127 = tsubst_expr_values (TREE_OPERAND (t
, 1), args
);
7129 tsubst_expr (TREE_CHAIN (t
), args
, complain
, in_decl
);
7134 finish_return_stmt (tsubst_expr (RETURN_EXPR (t
),
7135 args
, complain
, in_decl
));
7140 finish_expr_stmt (tsubst_expr (EXPR_STMT_EXPR (t
),
7141 args
, complain
, in_decl
));
7150 decl
= DECL_STMT_DECL (t
);
7151 if (TREE_CODE (decl
) == LABEL_DECL
)
7152 finish_label_decl (DECL_NAME (decl
));
7155 init
= DECL_INITIAL (decl
);
7156 decl
= tsubst (decl
, args
, complain
, in_decl
);
7157 init
= tsubst_expr (init
, args
, complain
, in_decl
);
7159 DECL_INITIAL (decl
) = error_mark_node
;
7160 /* By marking the declaration as instantiated, we avoid
7161 trying to instantiate it. Since instantiate_decl can't
7162 handle local variables, and since we've already done
7163 all that needs to be done, that's the right thing to
7165 if (TREE_CODE (decl
) == VAR_DECL
)
7166 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
7167 maybe_push_decl (decl
);
7168 cp_finish_decl (decl
, init
, NULL_TREE
, 0);
7178 stmt
= begin_for_stmt ();
7179 for (tmp
= FOR_INIT_STMT (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
7180 tsubst_expr (tmp
, args
, complain
, in_decl
);
7181 finish_for_init_stmt (stmt
);
7182 finish_for_cond (tsubst_expr (FOR_COND (t
), args
,
7185 tmp
= tsubst_expr (FOR_EXPR (t
), args
, complain
, in_decl
);
7186 finish_for_expr (tmp
, stmt
);
7187 tsubst_expr (FOR_BODY (t
), args
, complain
, in_decl
);
7188 finish_for_stmt (tmp
, stmt
);
7195 stmt
= begin_while_stmt ();
7196 finish_while_stmt_cond (tsubst_expr (WHILE_COND (t
),
7197 args
, complain
, in_decl
),
7199 tsubst_expr (WHILE_BODY (t
), args
, complain
, in_decl
);
7200 finish_while_stmt (stmt
);
7207 stmt
= begin_do_stmt ();
7208 tsubst_expr (DO_BODY (t
), args
, complain
, in_decl
);
7209 finish_do_body (stmt
);
7210 finish_do_stmt (tsubst_expr (DO_COND (t
), args
,
7221 stmt
= begin_if_stmt ();
7222 finish_if_stmt_cond (tsubst_expr (IF_COND (t
),
7223 args
, complain
, in_decl
),
7226 if (tmp
= THEN_CLAUSE (t
), tmp
)
7228 tsubst_expr (tmp
, args
, complain
, in_decl
);
7229 finish_then_clause (stmt
);
7232 if (tmp
= ELSE_CLAUSE (t
), tmp
)
7234 begin_else_clause ();
7235 tsubst_expr (tmp
, args
, complain
, in_decl
);
7236 finish_else_clause (stmt
);
7248 stmt
= begin_compound_stmt (COMPOUND_STMT_NO_SCOPE (t
));
7249 for (substmt
= COMPOUND_BODY (t
);
7250 substmt
!= NULL_TREE
;
7251 substmt
= TREE_CHAIN (substmt
))
7252 tsubst_expr (substmt
, args
, complain
, in_decl
);
7253 return finish_compound_stmt (COMPOUND_STMT_NO_SCOPE (t
), stmt
);
7259 finish_break_stmt ();
7264 finish_continue_stmt ();
7272 stmt
= begin_switch_stmt ();
7273 val
= tsubst_expr (SWITCH_COND (t
), args
, complain
, in_decl
);
7274 finish_switch_cond (val
, stmt
);
7275 tsubst_expr (SWITCH_BODY (t
), args
, complain
, in_decl
);
7276 finish_switch_stmt (val
, stmt
);
7282 finish_case_label (tsubst_expr (CASE_LOW (t
), args
, complain
, in_decl
),
7283 tsubst_expr (CASE_HIGH (t
), args
, complain
, in_decl
));
7287 lineno
= STMT_LINENO (t
);
7288 finish_label_stmt (DECL_NAME (LABEL_STMT_LABEL (t
)));
7293 t
= GOTO_DESTINATION (t
);
7294 if (TREE_CODE (t
) != LABEL_DECL
)
7295 /* Computed goto's must be tsubst'd into. On the other hand,
7296 non-computed gotos must not be; the identifier in question
7297 will have no binding. */
7298 t
= tsubst_expr (t
, args
, complain
, in_decl
);
7301 finish_goto_stmt (t
);
7306 finish_asm_stmt (ASM_CV_QUAL (t
),
7307 tsubst_expr (ASM_STRING (t
), args
, complain
, in_decl
),
7308 tsubst_expr (ASM_OUTPUTS (t
), args
, complain
, in_decl
),
7309 tsubst_expr (ASM_INPUTS (t
), args
, complain
, in_decl
),
7310 tsubst_expr (ASM_CLOBBERS (t
), args
, complain
,
7318 stmt
= begin_try_block ();
7319 tsubst_expr (TRY_STMTS (t
), args
, complain
, in_decl
);
7320 finish_cleanup_try_block (stmt
);
7321 finish_cleanup (tsubst_expr (TRY_HANDLERS (t
), args
,
7329 if (FN_TRY_BLOCK_P (t
))
7330 stmt
= begin_function_try_block ();
7332 stmt
= begin_try_block ();
7334 tsubst_expr (TRY_STMTS (t
), args
, complain
, in_decl
);
7336 if (FN_TRY_BLOCK_P (t
))
7337 finish_function_try_block (stmt
);
7339 finish_try_block (stmt
);
7341 handler
= TRY_HANDLERS (t
);
7342 for (; handler
; handler
= TREE_CHAIN (handler
))
7343 tsubst_expr (handler
, args
, complain
, in_decl
);
7344 if (FN_TRY_BLOCK_P (t
))
7345 finish_function_handler_sequence (stmt
);
7347 finish_handler_sequence (stmt
);
7357 stmt
= begin_handler ();
7358 if (HANDLER_PARMS (t
))
7360 decl
= DECL_STMT_DECL (HANDLER_PARMS (t
));
7361 decl
= tsubst (decl
, args
, complain
, in_decl
);
7362 /* Prevent instantiate_decl from trying to instantiate
7363 this variable. We've already done all that needs to be
7365 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
7369 blocks
= finish_handler_parms (decl
, stmt
);
7370 tsubst_expr (HANDLER_BODY (t
), args
, complain
, in_decl
);
7371 finish_handler (blocks
, stmt
);
7378 tsubst (t
, args
, complain
, NULL_TREE
);
7382 return build_expr_from_tree (tsubst_copy (t
, args
, complain
, in_decl
));
7387 /* Instantiate the indicated variable or function template TMPL with
7388 the template arguments in TARG_PTR. */
7391 instantiate_template (tmpl
, targ_ptr
)
7392 tree tmpl
, targ_ptr
;
7400 if (tmpl
== error_mark_node
)
7401 return error_mark_node
;
7403 my_friendly_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
, 283);
7405 /* Check to see if we already have this specialization. */
7406 spec
= retrieve_specialization (tmpl
, targ_ptr
);
7407 if (spec
!= NULL_TREE
)
7410 if (DECL_TEMPLATE_INFO (tmpl
) && !DECL_TEMPLATE_SPECIALIZATION (tmpl
))
7412 /* The TMPL is a partial instantiation. To get a full set of
7413 arguments we must add the arguments used to perform the
7414 partial instantiation. */
7415 targ_ptr
= add_outermost_template_args (DECL_TI_ARGS (tmpl
),
7417 gen_tmpl
= most_general_template (tmpl
);
7419 /* Check to see if we already have this specialization. */
7420 spec
= retrieve_specialization (gen_tmpl
, targ_ptr
);
7421 if (spec
!= NULL_TREE
)
7427 len
= DECL_NTPARMS (gen_tmpl
);
7428 inner_args
= innermost_args (targ_ptr
);
7432 tree t
= TREE_VEC_ELT (inner_args
, i
);
7433 if (TREE_CODE_CLASS (TREE_CODE (t
)) == 't')
7435 tree nt
= target_type (t
);
7436 if (IS_AGGR_TYPE (nt
) && decl_function_context (TYPE_MAIN_DECL (nt
)))
7438 cp_error ("type `%T' composed from a local class is not a valid template-argument", t
);
7439 cp_error (" trying to instantiate `%D'", gen_tmpl
);
7440 fndecl
= error_mark_node
;
7446 /* substitute template parameters */
7447 fndecl
= tsubst (DECL_RESULT (gen_tmpl
), targ_ptr
, /*complain=*/1, gen_tmpl
);
7448 /* The DECL_TI_TEMPLATE should always be the immediate parent
7449 template, not the most general template. */
7450 DECL_TI_TEMPLATE (fndecl
) = tmpl
;
7452 if (flag_external_templates
)
7453 add_pending_template (fndecl
);
7459 /* Push the name of the class template into the scope of the instantiation. */
7462 overload_template_name (type
)
7465 tree id
= DECL_NAME (CLASSTYPE_TI_TEMPLATE (type
));
7468 if (IDENTIFIER_CLASS_VALUE (id
)
7469 && TREE_TYPE (IDENTIFIER_CLASS_VALUE (id
)) == type
)
7472 decl
= build_decl (TYPE_DECL
, id
, type
);
7473 SET_DECL_ARTIFICIAL (decl
);
7474 pushdecl_class_level (decl
);
7477 /* The FN is a TEMPLATE_DECL for a function. The ARGS are the
7478 arguments that are being used when calling it. TARGS is a vector
7479 into which the deduced template arguments are placed.
7481 Return zero for success, 2 for an incomplete match that doesn't resolve
7482 all the types, and 1 for complete failure. An error message will be
7483 printed only for an incomplete match.
7485 If FN is a conversion operator, RETURN_TYPE is the type desired as
7486 the result of the conversion operator.
7488 TPARMS is a vector of template parameters.
7490 The EXPLICIT_TARGS are explicit template arguments provided via a
7493 The parameter STRICT is one of:
7496 We are deducing arguments for a function call, as in
7500 We are deducing arguments for a conversion function, as in
7504 We are deducing arguments when calculating the partial
7505 ordering between specializations of function or class
7506 templates, as in [temp.func.order] and [temp.class.order],
7507 when doing an explicit instantiation as in [temp.explicit],
7508 when determining an explicit specialization as in
7509 [temp.expl.spec], or when taking the address of a function
7510 template, as in [temp.deduct.funcaddr].
7512 The other arguments are as for type_unification. */
7515 fn_type_unification (fn
, explicit_targs
, targs
, args
, return_type
,
7517 tree fn
, explicit_targs
, targs
, args
, return_type
;
7518 unification_kind_t strict
;
7524 my_friendly_assert (TREE_CODE (fn
) == TEMPLATE_DECL
, 0);
7526 fntype
= TREE_TYPE (fn
);
7531 The specified template arguments must match the template
7532 parameters in kind (i.e., type, nontype, template), and there
7533 must not be more arguments than there are parameters;
7534 otherwise type deduction fails.
7536 Nontype arguments must match the types of the corresponding
7537 nontype template parameters, or must be convertible to the
7538 types of the corresponding nontype parameters as specified in
7539 _temp.arg.nontype_, otherwise type deduction fails.
7541 All references in the function type of the function template
7542 to the corresponding template parameters are replaced by the
7543 specified template argument values. If a substitution in a
7544 template parameter or in the function type of the function
7545 template results in an invalid type, type deduction fails. */
7547 tree converted_args
;
7550 = (coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
7551 explicit_targs
, NULL_TREE
, /*complain=*/0,
7552 /*require_all_arguments=*/0));
7553 if (converted_args
== error_mark_node
)
7556 fntype
= tsubst (fntype
, converted_args
, /*complain=*/0, NULL_TREE
);
7557 if (fntype
== error_mark_node
)
7560 /* Place the explicitly specified arguments in TARGS. */
7561 for (i
= 0; i
< TREE_VEC_LENGTH (targs
); i
++)
7562 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (converted_args
, i
);
7565 parms
= TYPE_ARG_TYPES (fntype
);
7567 if (DECL_CONV_FN_P (fn
))
7569 /* This is a template conversion operator. Remove `this', since
7570 we could be comparing conversions from different classes. */
7571 parms
= TREE_CHAIN (parms
);
7572 args
= TREE_CHAIN (args
);
7573 my_friendly_assert (return_type
!= NULL_TREE
, 20000227);
7578 /* We've been given a return type to match, prepend it. */
7579 parms
= tree_cons (NULL_TREE
, TREE_TYPE (fntype
), parms
);
7580 args
= tree_cons (NULL_TREE
, return_type
, args
);
7583 /* We allow incomplete unification without an error message here
7584 because the standard doesn't seem to explicitly prohibit it. Our
7585 callers must be ready to deal with unification failures in any
7587 result
= type_unification_real (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
7588 targs
, parms
, args
, /*subr=*/0,
7589 strict
, /*allow_incomplete*/1);
7592 /* All is well so far. Now, check:
7596 When all template arguments have been deduced, all uses of
7597 template parameters in nondeduced contexts are replaced with
7598 the corresponding deduced argument values. If the
7599 substitution results in an invalid type, as described above,
7600 type deduction fails. */
7601 if (tsubst (TREE_TYPE (fn
), targs
, /*complain=*/0, NULL_TREE
)
7608 /* Adjust types before performing type deduction, as described in
7609 [temp.deduct.call] and [temp.deduct.conv]. The rules in these two
7610 sections are symmetric. PARM is the type of a function parameter
7611 or the return type of the conversion function. ARG is the type of
7612 the argument passed to the call, or the type of the value
7613 intialized with the result of the conversion function. */
7616 maybe_adjust_types_for_deduction (strict
, parm
, arg
)
7617 unification_kind_t strict
;
7628 /* Swap PARM and ARG throughout the remainder of this
7629 function; the handling is precisely symmetric since PARM
7630 will initialize ARG rather than vice versa. */
7638 /* There is nothing to do in this case. */
7642 my_friendly_abort (0);
7645 if (TREE_CODE (*parm
) != REFERENCE_TYPE
)
7647 /* [temp.deduct.call]
7649 If P is not a reference type:
7651 --If A is an array type, the pointer type produced by the
7652 array-to-pointer standard conversion (_conv.array_) is
7653 used in place of A for type deduction; otherwise,
7655 --If A is a function type, the pointer type produced by
7656 the function-to-pointer standard conversion
7657 (_conv.func_) is used in place of A for type deduction;
7660 --If A is a cv-qualified type, the top level
7661 cv-qualifiers of A's type are ignored for type
7663 if (TREE_CODE (*arg
) == ARRAY_TYPE
)
7664 *arg
= build_pointer_type (TREE_TYPE (*arg
));
7665 else if (TREE_CODE (*arg
) == FUNCTION_TYPE
)
7666 *arg
= build_pointer_type (*arg
);
7668 *arg
= TYPE_MAIN_VARIANT (*arg
);
7671 /* [temp.deduct.call]
7673 If P is a cv-qualified type, the top level cv-qualifiers
7674 of P's type are ignored for type deduction. If P is a
7675 reference type, the type referred to by P is used for
7677 *parm
= TYPE_MAIN_VARIANT (*parm
);
7678 if (TREE_CODE (*parm
) == REFERENCE_TYPE
)
7679 *parm
= TREE_TYPE (*parm
);
7682 /* Like type_unfication.
7684 If SUBR is 1, we're being called recursively (to unify the
7685 arguments of a function or method parameter of a function
7689 type_unification_real (tparms
, targs
, parms
, args
, subr
,
7690 strict
, allow_incomplete
)
7691 tree tparms
, targs
, parms
, args
;
7693 unification_kind_t strict
;
7694 int allow_incomplete
;
7698 int ntparms
= TREE_VEC_LENGTH (tparms
);
7701 my_friendly_assert (TREE_CODE (tparms
) == TREE_VEC
, 289);
7702 my_friendly_assert (parms
== NULL_TREE
7703 || TREE_CODE (parms
) == TREE_LIST
, 290);
7704 /* ARGS could be NULL (via a call from parse.y to
7705 build_x_function_call). */
7707 my_friendly_assert (TREE_CODE (args
) == TREE_LIST
, 291);
7708 my_friendly_assert (ntparms
> 0, 292);
7713 sub_strict
= UNIFY_ALLOW_MORE_CV_QUAL
| UNIFY_ALLOW_DERIVED
;
7717 sub_strict
= UNIFY_ALLOW_LESS_CV_QUAL
;
7721 sub_strict
= UNIFY_ALLOW_NONE
;
7725 my_friendly_abort (0);
7729 && parms
!= void_list_node
7731 && args
!= void_list_node
)
7733 parm
= TREE_VALUE (parms
);
7734 parms
= TREE_CHAIN (parms
);
7735 arg
= TREE_VALUE (args
);
7736 args
= TREE_CHAIN (args
);
7738 if (arg
== error_mark_node
)
7740 if (arg
== unknown_type_node
)
7741 /* We can't deduce anything from this, but we might get all the
7742 template args from other function args. */
7745 /* Conversions will be performed on a function argument that
7746 corresponds with a function parameter that contains only
7747 non-deducible template parameters and explicitly specified
7748 template parameters. */
7749 if (! uses_template_parms (parm
))
7753 if (TREE_CODE_CLASS (TREE_CODE (arg
)) != 't')
7754 type
= TREE_TYPE (arg
);
7761 if (strict
== DEDUCE_EXACT
)
7763 if (same_type_p (parm
, type
))
7767 /* It might work; we shouldn't check now, because we might
7768 get into infinite recursion. Overload resolution will
7775 if (TREE_CODE_CLASS (TREE_CODE (arg
)) != 't')
7777 my_friendly_assert (TREE_TYPE (arg
) != NULL_TREE
, 293);
7778 if (type_unknown_p (arg
))
7780 /* [temp.deduct.type] A template-argument can be deduced from
7781 a pointer to function or pointer to member function
7782 argument if the set of overloaded functions does not
7783 contain function templates and at most one of a set of
7784 overloaded functions provides a unique match. */
7786 if (resolve_overloaded_unification
7787 (tparms
, targs
, parm
, arg
, strict
, sub_strict
)
7792 arg
= TREE_TYPE (arg
);
7796 maybe_adjust_types_for_deduction (strict
, &parm
, &arg
);
7798 switch (unify (tparms
, targs
, parm
, arg
, sub_strict
))
7806 /* Fail if we've reached the end of the parm list, and more args
7807 are present, and the parm list isn't variadic. */
7808 if (args
&& args
!= void_list_node
&& parms
== void_list_node
)
7810 /* Fail if parms are left and they don't have default values. */
7812 && parms
!= void_list_node
7813 && TREE_PURPOSE (parms
) == NULL_TREE
)
7816 for (i
= 0; i
< ntparms
; i
++)
7817 if (TREE_VEC_ELT (targs
, i
) == NULL_TREE
)
7819 if (!allow_incomplete
)
7820 error ("incomplete type unification");
7826 /* Subroutine of type_unification_real. Args are like the variables at the
7827 call site. ARG is an overloaded function (or template-id); we try
7828 deducing template args from each of the overloads, and if only one
7829 succeeds, we go with that. Modifies TARGS and returns 0 on success. */
7832 resolve_overloaded_unification (tparms
, targs
, parm
, arg
, strict
,
7834 tree tparms
, targs
, parm
, arg
;
7835 unification_kind_t strict
;
7838 tree tempargs
= copy_node (targs
);
7841 if (TREE_CODE (arg
) == ADDR_EXPR
)
7842 arg
= TREE_OPERAND (arg
, 0);
7844 if (TREE_CODE (arg
) == COMPONENT_REF
)
7845 /* Handle `&x' where `x' is some static or non-static member
7847 arg
= TREE_OPERAND (arg
, 1);
7849 if (TREE_CODE (arg
) == OFFSET_REF
)
7850 arg
= TREE_OPERAND (arg
, 1);
7852 /* Strip baselink information. */
7853 while (TREE_CODE (arg
) == TREE_LIST
)
7854 arg
= TREE_VALUE (arg
);
7856 if (TREE_CODE (arg
) == TEMPLATE_ID_EXPR
)
7858 /* If we got some explicit template args, we need to plug them into
7859 the affected templates before we try to unify, in case the
7860 explicit args will completely resolve the templates in question. */
7862 tree expl_subargs
= TREE_OPERAND (arg
, 1);
7863 arg
= TREE_OPERAND (arg
, 0);
7865 for (; arg
; arg
= OVL_NEXT (arg
))
7867 tree fn
= OVL_CURRENT (arg
);
7870 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
7873 subargs
= get_bindings_overload (fn
, DECL_RESULT (fn
), expl_subargs
);
7876 elem
= tsubst (TREE_TYPE (fn
), subargs
, /*complain=*/0,
7878 if (TREE_CODE (elem
) == METHOD_TYPE
)
7879 elem
= build_ptrmemfunc_type (build_pointer_type (elem
));
7880 good
+= try_one_overload (tparms
, targs
, tempargs
, parm
, elem
,
7881 strict
, sub_strict
);
7885 else if (TREE_CODE (arg
) == OVERLOAD
)
7887 for (; arg
; arg
= OVL_NEXT (arg
))
7889 tree type
= TREE_TYPE (OVL_CURRENT (arg
));
7890 if (TREE_CODE (type
) == METHOD_TYPE
)
7891 type
= build_ptrmemfunc_type (build_pointer_type (type
));
7892 good
+= try_one_overload (tparms
, targs
, tempargs
, parm
,
7894 strict
, sub_strict
);
7898 my_friendly_abort (981006);
7900 /* [temp.deduct.type] A template-argument can be deduced from a pointer
7901 to function or pointer to member function argument if the set of
7902 overloaded functions does not contain function templates and at most
7903 one of a set of overloaded functions provides a unique match.
7905 So if we found multiple possibilities, we return success but don't
7910 int i
= TREE_VEC_LENGTH (targs
);
7912 if (TREE_VEC_ELT (tempargs
, i
))
7913 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (tempargs
, i
);
7921 /* Subroutine of resolve_overloaded_unification; does deduction for a single
7922 overload. Fills TARGS with any deduced arguments, or error_mark_node if
7923 different overloads deduce different arguments for a given parm.
7924 Returns 1 on success. */
7927 try_one_overload (tparms
, orig_targs
, targs
, parm
, arg
, strict
,
7929 tree tparms
, orig_targs
, targs
, parm
, arg
;
7930 unification_kind_t strict
;
7937 /* [temp.deduct.type] A template-argument can be deduced from a pointer
7938 to function or pointer to member function argument if the set of
7939 overloaded functions does not contain function templates and at most
7940 one of a set of overloaded functions provides a unique match.
7942 So if this is a template, just return success. */
7944 if (uses_template_parms (arg
))
7947 maybe_adjust_types_for_deduction (strict
, &parm
, &arg
);
7949 /* We don't copy orig_targs for this because if we have already deduced
7950 some template args from previous args, unify would complain when we
7951 try to deduce a template parameter for the same argument, even though
7952 there isn't really a conflict. */
7953 nargs
= TREE_VEC_LENGTH (targs
);
7954 tempargs
= make_tree_vec (nargs
);
7956 if (unify (tparms
, tempargs
, parm
, arg
, sub_strict
) != 0)
7959 /* First make sure we didn't deduce anything that conflicts with
7960 explicitly specified args. */
7961 for (i
= nargs
; i
--; )
7963 tree elt
= TREE_VEC_ELT (tempargs
, i
);
7964 tree oldelt
= TREE_VEC_ELT (orig_targs
, i
);
7966 if (elt
== NULL_TREE
)
7968 else if (uses_template_parms (elt
))
7970 /* Since we're unifying against ourselves, we will fill in template
7971 args used in the function parm list with our own template parms.
7973 TREE_VEC_ELT (tempargs
, i
) = NULL_TREE
;
7976 else if (oldelt
&& ! template_args_equal (oldelt
, elt
))
7980 for (i
= nargs
; i
--; )
7982 tree elt
= TREE_VEC_ELT (tempargs
, i
);
7985 TREE_VEC_ELT (targs
, i
) = elt
;
7991 /* PARM is a template class (perhaps with unbound template
7992 parameters). ARG is a fully instantiated type. If ARG can be
7993 bound to PARM, return ARG, otherwise return NULL_TREE. TPARMS and
7994 TARGS are as for unify. */
7997 try_class_unification (tparms
, targs
, parm
, arg
)
8006 if (!CLASSTYPE_TEMPLATE_INFO (arg
)
8007 || CLASSTYPE_TI_TEMPLATE (arg
) != CLASSTYPE_TI_TEMPLATE (parm
))
8010 /* We need to make a new template argument vector for the call to
8011 unify. If we used TARGS, we'd clutter it up with the result of
8012 the attempted unification, even if this class didn't work out.
8013 We also don't want to commit ourselves to all the unifications
8014 we've already done, since unification is supposed to be done on
8015 an argument-by-argument basis. In other words, consider the
8016 following pathological case:
8018 template <int I, int J, int K>
8021 template <int I, int J>
8022 struct S<I, J, 2> : public S<I, I, I>, S<J, J, J> {};
8024 template <int I, int J, int K>
8025 void f(S<I, J, K>, S<I, I, I>);
8034 Now, by the time we consider the unification involving `s2', we
8035 already know that we must have `f<0, 0, 0>'. But, even though
8036 `S<0, 1, 2>' is derived from `S<0, 0, 0>', the code is not legal
8037 because there are two ways to unify base classes of S<0, 1, 2>
8038 with S<I, I, I>. If we kept the already deduced knowledge, we
8039 would reject the possibility I=1. */
8040 copy_of_targs
= make_tree_vec (TREE_VEC_LENGTH (targs
));
8041 i
= unify (tparms
, copy_of_targs
, CLASSTYPE_TI_ARGS (parm
),
8042 CLASSTYPE_TI_ARGS (arg
), UNIFY_ALLOW_NONE
);
8044 /* If unification failed, we're done. */
8051 /* Subroutine of get_template_base. RVAL, if non-NULL, is a base we
8052 have alreay discovered to be satisfactory. ARG_BINFO is the binfo
8053 for the base class of ARG that we are currently examining. */
8056 get_template_base_recursive (tparms
, targs
, parm
,
8057 arg_binfo
, rval
, flags
)
8067 tree arg
= BINFO_TYPE (arg_binfo
);
8069 if (!(flags
& GTB_IGNORE_TYPE
))
8071 tree r
= try_class_unification (tparms
, targs
,
8074 /* If there is more than one satisfactory baseclass, then:
8078 If they yield more than one possible deduced A, the type
8082 if (r
&& rval
&& !same_type_p (r
, rval
))
8083 return error_mark_node
;
8088 binfos
= BINFO_BASETYPES (arg_binfo
);
8089 n_baselinks
= binfos
? TREE_VEC_LENGTH (binfos
) : 0;
8091 /* Process base types. */
8092 for (i
= 0; i
< n_baselinks
; i
++)
8094 tree base_binfo
= TREE_VEC_ELT (binfos
, i
);
8097 /* Skip this base, if we've already seen it. */
8098 if (BINFO_MARKED (base_binfo
))
8102 (flags
& GTB_VIA_VIRTUAL
) || TREE_VIA_VIRTUAL (base_binfo
);
8104 /* When searching for a non-virtual, we cannot mark virtually
8107 SET_BINFO_MARKED (base_binfo
);
8109 rval
= get_template_base_recursive (tparms
, targs
,
8113 GTB_VIA_VIRTUAL
* this_virtual
);
8115 /* If we discovered more than one matching base class, we can
8117 if (rval
== error_mark_node
)
8118 return error_mark_node
;
8124 /* Given a template type PARM and a class type ARG, find the unique
8125 base type in ARG that is an instance of PARM. We do not examine
8126 ARG itself; only its base-classes. If there is no appropriate base
8127 class, return NULL_TREE. If there is more than one, return
8128 error_mark_node. PARM may be the type of a partial specialization,
8129 as well as a plain template type. Used by unify. */
8132 get_template_base (tparms
, targs
, parm
, arg
)
8141 my_friendly_assert (IS_AGGR_TYPE_CODE (TREE_CODE (arg
)), 92);
8143 arg_binfo
= TYPE_BINFO (complete_type (arg
));
8144 rval
= get_template_base_recursive (tparms
, targs
,
8149 /* Since get_template_base_recursive marks the bases classes, we
8150 must unmark them here. */
8151 dfs_walk (arg_binfo
, dfs_unmark
, markedp
, 0);
8156 /* Returns the level of DECL, which declares a template parameter. */
8159 template_decl_level (decl
)
8162 switch (TREE_CODE (decl
))
8166 return TEMPLATE_TYPE_LEVEL (TREE_TYPE (decl
));
8169 return TEMPLATE_PARM_LEVEL (DECL_INITIAL (decl
));
8172 my_friendly_abort (0);
8177 /* Decide whether ARG can be unified with PARM, considering only the
8178 cv-qualifiers of each type, given STRICT as documented for unify.
8179 Returns non-zero iff the unification is OK on that basis.*/
8182 check_cv_quals_for_unify (strict
, arg
, parm
)
8187 if (!(strict
& UNIFY_ALLOW_MORE_CV_QUAL
)
8188 && !at_least_as_qualified_p (arg
, parm
))
8191 if (!(strict
& UNIFY_ALLOW_LESS_CV_QUAL
)
8192 && !at_least_as_qualified_p (parm
, arg
))
8198 /* Takes parameters as for type_unification. Returns 0 if the
8199 type deduction suceeds, 1 otherwise. The parameter STRICT is a
8200 bitwise or of the following flags:
8203 Require an exact match between PARM and ARG.
8204 UNIFY_ALLOW_MORE_CV_QUAL:
8205 Allow the deduced ARG to be more cv-qualified than ARG.
8206 UNIFY_ALLOW_LESS_CV_QUAL:
8207 Allow the deduced ARG to be less cv-qualified than ARG.
8208 UNIFY_ALLOW_DERIVED:
8209 Allow the deduced ARG to be a template base class of ARG,
8210 or a pointer to a template base class of the type pointed to by
8212 UNIFY_ALLOW_INTEGER:
8213 Allow any integral type to be deduced. See the TEMPLATE_PARM_INDEX
8214 case for more information. */
8217 unify (tparms
, targs
, parm
, arg
, strict
)
8218 tree tparms
, targs
, parm
, arg
;
8225 /* I don't think this will do the right thing with respect to types.
8226 But the only case I've seen it in so far has been array bounds, where
8227 signedness is the only information lost, and I think that will be
8229 while (TREE_CODE (parm
) == NOP_EXPR
)
8230 parm
= TREE_OPERAND (parm
, 0);
8232 if (arg
== error_mark_node
)
8234 if (arg
== unknown_type_node
)
8235 /* We can't deduce anything from this, but we might get all the
8236 template args from other function args. */
8239 /* If PARM uses template parameters, then we can't bail out here,
8240 even if ARG == PARM, since we won't record unifications for the
8241 template parameters. We might need them if we're trying to
8242 figure out which of two things is more specialized. */
8243 if (arg
== parm
&& !uses_template_parms (parm
))
8246 /* Immediately reject some pairs that won't unify because of
8247 cv-qualification mismatches. */
8248 if (TREE_CODE (arg
) == TREE_CODE (parm
)
8249 && TREE_CODE_CLASS (TREE_CODE (arg
)) == 't'
8250 /* We check the cv-qualifiers when unifying with template type
8251 parameters below. We want to allow ARG `const T' to unify with
8252 PARM `T' for example, when computing which of two templates
8253 is more specialized, for example. */
8254 && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
8255 && !check_cv_quals_for_unify (strict
, arg
, parm
))
8258 switch (TREE_CODE (parm
))
8261 /* In a type which contains a nested-name-specifier, template
8262 argument values cannot be deduced for template parameters used
8263 within the nested-name-specifier. */
8266 case TEMPLATE_TYPE_PARM
:
8267 case TEMPLATE_TEMPLATE_PARM
:
8268 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
8270 if (TEMPLATE_TYPE_LEVEL (parm
)
8271 != template_decl_level (tparm
))
8272 /* The PARM is not one we're trying to unify. Just check
8273 to see if it matches ARG. */
8274 return (TREE_CODE (arg
) == TREE_CODE (parm
)
8275 && same_type_p (parm
, arg
)) ? 0 : 1;
8276 idx
= TEMPLATE_TYPE_IDX (parm
);
8277 targ
= TREE_VEC_ELT (targs
, idx
);
8278 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, idx
));
8280 /* Check for mixed types and values. */
8281 if ((TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
8282 && TREE_CODE (tparm
) != TYPE_DECL
)
8283 || (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
8284 && TREE_CODE (tparm
) != TEMPLATE_DECL
))
8287 if (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
)
8289 if (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (parm
))
8291 /* We arrive here when PARM does not involve template
8294 /* ARG must be constructed from a template class. */
8295 if (TREE_CODE (arg
) != RECORD_TYPE
|| !CLASSTYPE_TEMPLATE_INFO (arg
))
8299 tree parmtmpl
= TYPE_TI_TEMPLATE (parm
);
8300 tree parmvec
= TYPE_TI_ARGS (parm
);
8301 tree argvec
= CLASSTYPE_TI_ARGS (arg
);
8303 = DECL_INNERMOST_TEMPLATE_PARMS (CLASSTYPE_TI_TEMPLATE (arg
));
8306 /* The parameter and argument roles have to be switched here
8307 in order to handle default arguments properly. For example,
8308 template<template <class> class TT> void f(TT<int>)
8309 should be able to accept vector<int> which comes from
8310 template <class T, class Allocator = allocator>
8313 if (coerce_template_parms (argtmplvec
, parmvec
, parmtmpl
, 0, 1)
8317 /* Deduce arguments T, i from TT<T> or TT<i>.
8318 We check each element of PARMVEC and ARGVEC individually
8319 rather than the whole TREE_VEC since they can have
8320 different number of elements. */
8322 for (i
= 0; i
< TREE_VEC_LENGTH (parmvec
); ++i
)
8324 tree t
= TREE_VEC_ELT (parmvec
, i
);
8326 if (unify (tparms
, targs
, t
,
8327 TREE_VEC_ELT (argvec
, i
),
8332 arg
= CLASSTYPE_TI_TEMPLATE (arg
);
8337 /* If PARM is `const T' and ARG is only `int', we don't have
8338 a match unless we are allowing additional qualification.
8339 If ARG is `const int' and PARM is just `T' that's OK;
8340 that binds `const int' to `T'. */
8341 if (!check_cv_quals_for_unify (strict
| UNIFY_ALLOW_LESS_CV_QUAL
,
8345 /* Consider the case where ARG is `const volatile int' and
8346 PARM is `const T'. Then, T should be `volatile int'. */
8348 cp_build_qualified_type_real (arg
,
8350 & ~CP_TYPE_QUALS (parm
),
8352 if (arg
== error_mark_node
)
8356 /* Simple cases: Value already set, does match or doesn't. */
8357 if (targ
!= NULL_TREE
&& same_type_p (targ
, arg
))
8362 /* Make sure that ARG is not a variable-sized array. (Note that
8363 were talking about variable-sized arrays (like `int[n]'),
8364 rather than arrays of unknown size (like `int[]').) We'll
8365 get very confused by such a type since the bound of the array
8366 will not be computable in an instantiation. Besides, such
8367 types are not allowed in ISO C++, so we can do as we please
8369 if (TREE_CODE (arg
) == ARRAY_TYPE
8370 && !uses_template_parms (arg
)
8371 && (TREE_CODE (TYPE_MAX_VALUE (TYPE_DOMAIN (arg
)))
8375 TREE_VEC_ELT (targs
, idx
) = arg
;
8378 case TEMPLATE_PARM_INDEX
:
8379 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
8381 if (TEMPLATE_PARM_LEVEL (parm
)
8382 != template_decl_level (tparm
))
8383 /* The PARM is not one we're trying to unify. Just check
8384 to see if it matches ARG. */
8385 return (TREE_CODE (arg
) == TREE_CODE (parm
)
8386 && cp_tree_equal (parm
, arg
) > 0) ? 0 : 1;
8388 idx
= TEMPLATE_PARM_IDX (parm
);
8389 targ
= TREE_VEC_ELT (targs
, idx
);
8393 int i
= (cp_tree_equal (targ
, arg
) > 0);
8399 my_friendly_abort (42);
8402 /* [temp.deduct.type] If, in the declaration of a function template
8403 with a non-type template-parameter, the non-type
8404 template-parameter is used in an expression in the function
8405 parameter-list and, if the corresponding template-argument is
8406 deduced, the template-argument type shall match the type of the
8407 template-parameter exactly, except that a template-argument
8408 deduced from an array bound may be of any integral type. */
8409 if (same_type_p (TREE_TYPE (arg
), TREE_TYPE (parm
)))
8411 else if ((strict
& UNIFY_ALLOW_INTEGER
)
8412 && (TREE_CODE (TREE_TYPE (parm
)) == INTEGER_TYPE
8413 || TREE_CODE (TREE_TYPE (parm
)) == BOOLEAN_TYPE
))
8418 TREE_VEC_ELT (targs
, idx
) = arg
;
8425 if (TREE_CODE (arg
) != POINTER_TYPE
)
8428 /* [temp.deduct.call]
8430 A can be another pointer or pointer to member type that can
8431 be converted to the deduced A via a qualification
8432 conversion (_conv.qual_).
8434 We pass down STRICT here rather than UNIFY_ALLOW_NONE.
8435 This will allow for additional cv-qualification of the
8436 pointed-to types if appropriate. In general, this is a bit
8437 too generous; we are only supposed to allow qualification
8438 conversions and this method will allow an ARG of char** and
8439 a deduced ARG of const char**. However, overload
8440 resolution will subsequently invalidate the candidate, so
8441 this is probably OK. */
8442 sub_strict
= strict
;
8444 if (TREE_CODE (TREE_TYPE (arg
)) != RECORD_TYPE
)
8445 /* The derived-to-base conversion only persists through one
8446 level of pointers. */
8447 sub_strict
&= ~UNIFY_ALLOW_DERIVED
;
8449 return unify (tparms
, targs
, TREE_TYPE (parm
),
8450 TREE_TYPE (arg
), sub_strict
);
8453 case REFERENCE_TYPE
:
8454 if (TREE_CODE (arg
) != REFERENCE_TYPE
)
8456 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
8460 if (TREE_CODE (arg
) != ARRAY_TYPE
)
8462 if ((TYPE_DOMAIN (parm
) == NULL_TREE
)
8463 != (TYPE_DOMAIN (arg
) == NULL_TREE
))
8465 if (TYPE_DOMAIN (parm
) != NULL_TREE
8466 && unify (tparms
, targs
, TYPE_DOMAIN (parm
),
8467 TYPE_DOMAIN (arg
), UNIFY_ALLOW_NONE
) != 0)
8469 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
8477 if (TREE_CODE (arg
) != TREE_CODE (parm
))
8480 if (TREE_CODE (parm
) == INTEGER_TYPE
8481 && TREE_CODE (TYPE_MAX_VALUE (parm
)) != INTEGER_CST
)
8483 if (TYPE_MIN_VALUE (parm
) && TYPE_MIN_VALUE (arg
)
8484 && unify (tparms
, targs
, TYPE_MIN_VALUE (parm
),
8485 TYPE_MIN_VALUE (arg
), UNIFY_ALLOW_INTEGER
))
8487 if (TYPE_MAX_VALUE (parm
) && TYPE_MAX_VALUE (arg
)
8488 && unify (tparms
, targs
, TYPE_MAX_VALUE (parm
),
8489 TYPE_MAX_VALUE (arg
), UNIFY_ALLOW_INTEGER
))
8492 /* We use the TYPE_MAIN_VARIANT since we have already
8493 checked cv-qualification at the top of the
8495 else if (!same_type_p (TYPE_MAIN_VARIANT (arg
),
8496 TYPE_MAIN_VARIANT (parm
)))
8499 /* As far as unification is concerned, this wins. Later checks
8500 will invalidate it if necessary. */
8503 /* Types INTEGER_CST and MINUS_EXPR can come from array bounds. */
8504 /* Type INTEGER_CST can come from ordinary constant template args. */
8506 while (TREE_CODE (arg
) == NOP_EXPR
)
8507 arg
= TREE_OPERAND (arg
, 0);
8509 if (TREE_CODE (arg
) != INTEGER_CST
)
8511 return !tree_int_cst_equal (parm
, arg
);
8516 if (TREE_CODE (arg
) != TREE_VEC
)
8518 if (TREE_VEC_LENGTH (parm
) != TREE_VEC_LENGTH (arg
))
8520 for (i
= TREE_VEC_LENGTH (parm
) - 1; i
>= 0; i
--)
8521 if (unify (tparms
, targs
,
8522 TREE_VEC_ELT (parm
, i
), TREE_VEC_ELT (arg
, i
),
8530 if (TREE_CODE (arg
) != TREE_CODE (parm
))
8533 if (TYPE_PTRMEMFUNC_P (parm
))
8535 if (!TYPE_PTRMEMFUNC_P (arg
))
8538 return unify (tparms
, targs
,
8539 TYPE_PTRMEMFUNC_FN_TYPE (parm
),
8540 TYPE_PTRMEMFUNC_FN_TYPE (arg
),
8544 if (CLASSTYPE_TEMPLATE_INFO (parm
))
8548 if (strict
& UNIFY_ALLOW_DERIVED
)
8550 /* First, we try to unify the PARM and ARG directly. */
8551 t
= try_class_unification (tparms
, targs
,
8556 /* Fallback to the special case allowed in
8559 If P is a class, and P has the form
8560 template-id, then A can be a derived class of
8561 the deduced A. Likewise, if P is a pointer to
8562 a class of the form template-id, A can be a
8563 pointer to a derived class pointed to by the
8565 t
= get_template_base (tparms
, targs
,
8568 if (! t
|| t
== error_mark_node
)
8572 else if (CLASSTYPE_TEMPLATE_INFO (arg
)
8573 && (CLASSTYPE_TI_TEMPLATE (parm
)
8574 == CLASSTYPE_TI_TEMPLATE (arg
)))
8575 /* Perhaps PARM is something like S<U> and ARG is S<int>.
8576 Then, we should unify `int' and `U'. */
8579 /* There's no chance of unication succeeding. */
8582 return unify (tparms
, targs
, CLASSTYPE_TI_ARGS (parm
),
8583 CLASSTYPE_TI_ARGS (t
), UNIFY_ALLOW_NONE
);
8585 else if (!same_type_p (TYPE_MAIN_VARIANT (parm
),
8586 TYPE_MAIN_VARIANT (arg
)))
8592 if (TREE_CODE (arg
) != TREE_CODE (parm
))
8595 if (unify (tparms
, targs
, TREE_TYPE (parm
),
8596 TREE_TYPE (arg
), UNIFY_ALLOW_NONE
))
8598 return type_unification_real (tparms
, targs
, TYPE_ARG_TYPES (parm
),
8599 TYPE_ARG_TYPES (arg
), 1,
8603 if (TREE_CODE (arg
) != OFFSET_TYPE
)
8605 if (unify (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
8606 TYPE_OFFSET_BASETYPE (arg
), UNIFY_ALLOW_NONE
))
8608 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
8612 if (arg
!= decl_constant_value (parm
))
8617 /* Matched cases are handled by the ARG == PARM test above. */
8621 if (TREE_CODE (TREE_OPERAND (parm
, 1)) == INTEGER_CST
)
8623 /* We handle this case specially, since it comes up with
8624 arrays. In particular, something like:
8626 template <int N> void f(int (&x)[N]);
8628 Here, we are trying to unify the range type, which
8629 looks like [0 ... (N - 1)]. */
8631 t1
= TREE_OPERAND (parm
, 0);
8632 t2
= TREE_OPERAND (parm
, 1);
8634 t
= fold (build (PLUS_EXPR
, integer_type_node
, arg
, t2
));
8636 return unify (tparms
, targs
, t1
, t
, strict
);
8638 /* else fall through */
8641 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (parm
))))
8642 /* We're looking at an expression. This can happen with
8646 void foo(S<I>, S<I + 2>);
8648 This is a "nondeduced context":
8652 The nondeduced contexts are:
8654 --A type that is a template-id in which one or more of
8655 the template-arguments is an expression that references
8656 a template-parameter.
8658 In these cases, we assume deduction succeeded, but don't
8659 actually infer any unifications. */
8662 sorry ("use of `%s' in template type unification",
8663 tree_code_name
[(int) TREE_CODE (parm
)]);
8669 /* Called if RESULT is explicitly instantiated, or is a member of an
8670 explicitly instantiated class, or if using -frepo and the
8671 instantiation of RESULT has been assigned to this file. */
8674 mark_decl_instantiated (result
, extern_p
)
8678 if (TREE_CODE (result
) != FUNCTION_DECL
)
8679 /* The TREE_PUBLIC flag for function declarations will have been
8680 set correctly by tsubst. */
8681 TREE_PUBLIC (result
) = 1;
8685 DECL_INTERFACE_KNOWN (result
) = 1;
8686 DECL_NOT_REALLY_EXTERN (result
) = 1;
8688 /* Always make artificials weak. */
8689 if (DECL_ARTIFICIAL (result
) && flag_weak
)
8690 comdat_linkage (result
);
8691 /* For WIN32 we also want to put explicit instantiations in
8692 linkonce sections. */
8693 else if (TREE_PUBLIC (result
))
8694 maybe_make_one_only (result
);
8696 else if (TREE_CODE (result
) == FUNCTION_DECL
)
8697 mark_inline_for_output (result
);
8700 /* Given two function templates PAT1 and PAT2, and explicit template
8701 arguments EXPLICIT_ARGS return:
8703 1 if PAT1 is more specialized than PAT2 as described in [temp.func.order].
8704 -1 if PAT2 is more specialized than PAT1.
8705 0 if neither is more specialized. */
8708 more_specialized (pat1
, pat2
, explicit_args
)
8709 tree pat1
, pat2
, explicit_args
;
8714 targs
= get_bindings_overload (pat1
, DECL_RESULT (pat2
), explicit_args
);
8718 targs
= get_bindings_overload (pat2
, DECL_RESULT (pat1
), explicit_args
);
8725 /* Given two class template specialization list nodes PAT1 and PAT2, return:
8727 1 if PAT1 is more specialized than PAT2 as described in [temp.class.order].
8728 -1 if PAT2 is more specialized than PAT1.
8729 0 if neither is more specialized. */
8732 more_specialized_class (pat1
, pat2
)
8738 targs
= get_class_bindings (TREE_VALUE (pat1
), TREE_PURPOSE (pat1
),
8739 TREE_PURPOSE (pat2
));
8743 targs
= get_class_bindings (TREE_VALUE (pat2
), TREE_PURPOSE (pat2
),
8744 TREE_PURPOSE (pat1
));
8751 /* Return the template arguments that will produce the function signature
8752 DECL from the function template FN, with the explicit template
8753 arguments EXPLICIT_ARGS. If CHECK_RETTYPE is 1, the return type must
8754 also match. Return NULL_TREE if no satisfactory arguments could be
8758 get_bindings_real (fn
, decl
, explicit_args
, check_rettype
)
8759 tree fn
, decl
, explicit_args
;
8762 int ntparms
= DECL_NTPARMS (fn
);
8763 tree targs
= make_tree_vec (ntparms
);
8765 tree decl_arg_types
;
8768 /* Substitute the explicit template arguments into the type of DECL.
8769 The call to fn_type_unification will handle substitution into the
8771 decl_type
= TREE_TYPE (decl
);
8772 if (explicit_args
&& uses_template_parms (decl_type
))
8775 tree converted_args
;
8777 if (DECL_TEMPLATE_INFO (decl
))
8778 tmpl
= DECL_TI_TEMPLATE (decl
);
8780 /* We can get here for some illegal specializations. */
8784 = (coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
8785 explicit_args
, NULL_TREE
,
8787 /*require_all_arguments=*/0));
8788 if (converted_args
== error_mark_node
)
8791 decl_type
= tsubst (decl_type
, converted_args
, /*complain=*/0,
8793 if (decl_type
== error_mark_node
)
8797 /* If FN is a static member function, adjust the type of DECL
8799 decl_arg_types
= TYPE_ARG_TYPES (decl_type
);
8800 if (DECL_STATIC_FUNCTION_P (fn
)
8801 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
8802 decl_arg_types
= TREE_CHAIN (decl_arg_types
);
8804 i
= fn_type_unification (fn
, explicit_args
, targs
,
8806 (check_rettype
|| DECL_CONV_FN_P (fn
)
8807 ? TREE_TYPE (decl_type
) : NULL_TREE
),
8816 /* For most uses, we want to check the return type. */
8819 get_bindings (fn
, decl
, explicit_args
)
8820 tree fn
, decl
, explicit_args
;
8822 return get_bindings_real (fn
, decl
, explicit_args
, 1);
8825 /* But for more_specialized, we only care about the parameter types. */
8828 get_bindings_overload (fn
, decl
, explicit_args
)
8829 tree fn
, decl
, explicit_args
;
8831 return get_bindings_real (fn
, decl
, explicit_args
, 0);
8834 /* Return the innermost template arguments that, when applied to a
8835 template specialization whose innermost template parameters are
8836 TPARMS, and whose specialization arguments are ARGS, yield the
8839 For example, suppose we have:
8841 template <class T, class U> struct S {};
8842 template <class T> struct S<T*, int> {};
8844 Then, suppose we want to get `S<double*, int>'. The TPARMS will be
8845 {T}, the PARMS will be {T*, int} and the ARGS will be {double*,
8846 int}. The resulting vector will be {double}, indicating that `T'
8847 is bound to `double'. */
8850 get_class_bindings (tparms
, parms
, args
)
8851 tree tparms
, parms
, args
;
8853 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
8854 tree vec
= make_tree_vec (ntparms
);
8856 args
= innermost_args (args
);
8858 if (unify (tparms
, vec
, parms
, args
, UNIFY_ALLOW_NONE
))
8861 for (i
= 0; i
< ntparms
; ++i
)
8862 if (! TREE_VEC_ELT (vec
, i
))
8868 /* In INSTANTIATIONS is a list of <INSTANTIATION, TEMPLATE> pairs.
8869 Pick the most specialized template, and return the corresponding
8870 instantiation, or if there is no corresponding instantiation, the
8871 template itself. EXPLICIT_ARGS is any template arguments explicity
8872 mentioned in a template-id. If there is no most specialized
8873 tempalte, error_mark_node is returned. If there are no templates
8874 at all, NULL_TREE is returned. */
8877 most_specialized_instantiation (instantiations
, explicit_args
)
8878 tree instantiations
;
8884 if (!instantiations
)
8887 champ
= instantiations
;
8888 for (fn
= TREE_CHAIN (instantiations
); fn
; fn
= TREE_CHAIN (fn
))
8890 fate
= more_specialized (TREE_VALUE (champ
),
8891 TREE_VALUE (fn
), explicit_args
);
8898 fn
= TREE_CHAIN (fn
);
8900 return error_mark_node
;
8906 for (fn
= instantiations
; fn
&& fn
!= champ
; fn
= TREE_CHAIN (fn
))
8908 fate
= more_specialized (TREE_VALUE (champ
),
8909 TREE_VALUE (fn
), explicit_args
);
8911 return error_mark_node
;
8914 return TREE_PURPOSE (champ
) ? TREE_PURPOSE (champ
) : TREE_VALUE (champ
);
8917 /* Return the most specialized of the list of templates in FNS that can
8918 produce an instantiation matching DECL, given the explicit template
8919 arguments EXPLICIT_ARGS. */
8922 most_specialized (fns
, decl
, explicit_args
)
8923 tree fns
, decl
, explicit_args
;
8925 tree candidates
= NULL_TREE
;
8928 for (fn
= fns
; fn
; fn
= TREE_CHAIN (fn
))
8930 tree candidate
= TREE_VALUE (fn
);
8932 args
= get_bindings (candidate
, decl
, explicit_args
);
8934 candidates
= tree_cons (NULL_TREE
, candidate
, candidates
);
8937 return most_specialized_instantiation (candidates
, explicit_args
);
8940 /* If DECL is a specialization of some template, return the most
8941 general such template. For example, given:
8943 template <class T> struct S { template <class U> void f(U); };
8945 if TMPL is `template <class U> void S<int>::f(U)' this will return
8946 the full template. This function will not trace past partial
8947 specializations, however. For example, given in addition:
8949 template <class T> struct S<T*> { template <class U> void f(U); };
8951 if TMPL is `template <class U> void S<int*>::f(U)' this will return
8952 `template <class T> template <class U> S<T*>::f(U)'. */
8955 most_general_template (decl
)
8958 while (DECL_TEMPLATE_INFO (decl
)
8959 && !(TREE_CODE (decl
) == TEMPLATE_DECL
8960 && DECL_TEMPLATE_SPECIALIZATION (decl
))
8961 /* The DECL_TI_TEMPLATE can be a LOOKUP_EXPR or
8962 IDENTIFIER_NODE in some cases. (See cp-tree.h for
8964 && TREE_CODE (DECL_TI_TEMPLATE (decl
)) == TEMPLATE_DECL
)
8965 decl
= DECL_TI_TEMPLATE (decl
);
8970 /* Return the most specialized of the class template specializations
8971 of TMPL which can produce an instantiation matching ARGS, or
8972 error_mark_node if the choice is ambiguous. */
8975 most_specialized_class (tmpl
, args
)
8979 tree list
= NULL_TREE
;
8984 tmpl
= most_general_template (tmpl
);
8985 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
); t
; t
= TREE_CHAIN (t
))
8988 = get_class_bindings (TREE_VALUE (t
), TREE_PURPOSE (t
), args
);
8991 list
= decl_tree_cons (TREE_PURPOSE (t
), TREE_VALUE (t
), list
);
8992 TREE_TYPE (list
) = TREE_TYPE (t
);
9002 for (; t
; t
= TREE_CHAIN (t
))
9004 fate
= more_specialized_class (champ
, t
);
9013 return error_mark_node
;
9019 for (t
= list
; t
&& t
!= champ
; t
= TREE_CHAIN (t
))
9021 fate
= more_specialized_class (champ
, t
);
9023 return error_mark_node
;
9029 /* called from the parser. */
9032 do_decl_instantiation (declspecs
, declarator
, storage
)
9033 tree declspecs
, declarator
, storage
;
9035 tree decl
= grokdeclarator (declarator
, declspecs
, NORMAL
, 0, NULL_TREE
);
9036 tree result
= NULL_TREE
;
9040 /* An error ocurred, for which grokdeclarator has already issued
9041 an appropriate message. */
9043 else if (! DECL_LANG_SPECIFIC (decl
))
9045 cp_error ("explicit instantiation of non-template `%#D'", decl
);
9048 else if (TREE_CODE (decl
) == VAR_DECL
)
9050 /* There is an asymmetry here in the way VAR_DECLs and
9051 FUNCTION_DECLs are handled by grokdeclarator. In the case of
9052 the latter, the DECL we get back will be marked as a
9053 template instantiation, and the appropriate
9054 DECL_TEMPLATE_INFO will be set up. This does not happen for
9055 VAR_DECLs so we do the lookup here. Probably, grokdeclarator
9056 should handle VAR_DECLs as it currently handles
9058 result
= lookup_field (DECL_CONTEXT (decl
), DECL_NAME (decl
), 0, 0);
9059 if (result
&& TREE_CODE (result
) != VAR_DECL
)
9061 cp_error ("no matching template for `%D' found", result
);
9065 else if (TREE_CODE (decl
) != FUNCTION_DECL
)
9067 cp_error ("explicit instantiation of `%#D'", decl
);
9073 /* Check for various error cases. Note that if the explicit
9074 instantiation is legal the RESULT will currently be marked as an
9075 *implicit* instantiation; DECL_EXPLICIT_INSTANTIATION is not set
9076 until we get here. */
9078 if (DECL_TEMPLATE_SPECIALIZATION (result
))
9082 No program shall both explicitly instantiate and explicitly
9083 specialize a template. */
9084 cp_pedwarn ("explicit instantiation of `%#D' after", result
);
9085 cp_pedwarn_at ("explicit specialization here", result
);
9088 else if (DECL_EXPLICIT_INSTANTIATION (result
))
9092 No program shall explicitly instantiate any template more
9095 We check DECL_INTERFACE_KNOWN so as not to complain when the first
9096 instantiation was `extern' and the second is not, and EXTERN_P for
9097 the opposite case. If -frepo, chances are we already got marked
9098 as an explicit instantion because of the repo file. */
9099 if (DECL_INTERFACE_KNOWN (result
) && !extern_p
&& !flag_use_repository
)
9100 cp_pedwarn ("duplicate explicit instantiation of `%#D'", result
);
9102 /* If we've already instantiated the template, just return now. */
9103 if (DECL_INTERFACE_KNOWN (result
))
9106 else if (!DECL_IMPLICIT_INSTANTIATION (result
))
9108 cp_error ("no matching template for `%D' found", result
);
9111 else if (!DECL_TEMPLATE_INFO (result
))
9113 cp_pedwarn ("explicit instantiation of non-template `%#D'", result
);
9117 if (flag_external_templates
)
9120 if (storage
== NULL_TREE
)
9122 else if (storage
== ridpointers
[(int) RID_EXTERN
])
9125 cp_pedwarn ("ISO C++ forbids the use of `extern' on explicit instantiations");
9129 cp_error ("storage class `%D' applied to template instantiation",
9132 SET_DECL_EXPLICIT_INSTANTIATION (result
);
9133 mark_decl_instantiated (result
, extern_p
);
9134 repo_template_instantiated (result
, extern_p
);
9136 instantiate_decl (result
);
9140 mark_class_instantiated (t
, extern_p
)
9144 SET_CLASSTYPE_EXPLICIT_INSTANTIATION (t
);
9145 SET_CLASSTYPE_INTERFACE_KNOWN (t
);
9146 CLASSTYPE_INTERFACE_ONLY (t
) = extern_p
;
9147 CLASSTYPE_VTABLE_NEEDS_WRITING (t
) = ! extern_p
;
9148 TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (t
)) = extern_p
;
9151 CLASSTYPE_DEBUG_REQUESTED (t
) = 1;
9152 rest_of_type_compilation (t
, 1);
9157 do_type_instantiation (t
, storage
)
9164 if (TREE_CODE (t
) == TYPE_DECL
)
9167 if (! CLASS_TYPE_P (t
) || ! CLASSTYPE_TEMPLATE_INFO (t
))
9169 cp_error ("explicit instantiation of non-template type `%T'", t
);
9175 /* With -fexternal-templates, explicit instantiations are treated the same
9176 as implicit ones. */
9177 if (flag_external_templates
)
9180 if (!COMPLETE_TYPE_P (t
))
9182 cp_error ("explicit instantiation of `%#T' before definition of template",
9187 if (storage
!= NULL_TREE
)
9190 cp_pedwarn("ISO C++ forbids the use of `%s' on explicit instantiations",
9191 IDENTIFIER_POINTER (storage
));
9193 if (storage
== ridpointers
[(int) RID_INLINE
])
9195 else if (storage
== ridpointers
[(int) RID_EXTERN
])
9197 else if (storage
== ridpointers
[(int) RID_STATIC
])
9201 cp_error ("storage class `%D' applied to template instantiation",
9207 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
9211 No program shall both explicitly instantiate and explicitly
9212 specialize a template. */
9213 cp_error ("explicit instantiation of `%#T' after", t
);
9214 cp_error_at ("explicit specialization here", t
);
9217 else if (CLASSTYPE_EXPLICIT_INSTANTIATION (t
))
9221 No program shall explicitly instantiate any template more
9224 If CLASSTYPE_INTERFACE_ONLY, then the first explicit instantiation
9225 was `extern'. If EXTERN_P then the second is. If -frepo, chances
9226 are we already got marked as an explicit instantion because of the
9227 repo file. All these cases are OK. */
9228 if (!CLASSTYPE_INTERFACE_ONLY (t
) && !extern_p
&& !flag_use_repository
)
9229 cp_pedwarn ("duplicate explicit instantiation of `%#T'", t
);
9231 /* If we've already instantiated the template, just return now. */
9232 if (!CLASSTYPE_INTERFACE_ONLY (t
))
9236 mark_class_instantiated (t
, extern_p
);
9237 repo_template_instantiated (t
, extern_p
);
9245 /* In contrast to implicit instantiation, where only the
9246 declarations, and not the definitions, of members are
9247 instantiated, we have here:
9251 The explicit instantiation of a class template specialization
9252 implies the instantiation of all of its members not
9253 previously explicitly specialized in the translation unit
9254 containing the explicit instantiation.
9256 Of course, we can't instantiate member template classes, since
9257 we don't have any arguments for them. Note that the standard
9258 is unclear on whether the instatiation of the members are
9259 *explicit* instantiations or not. We choose to be generous,
9260 and not set DECL_EXPLICIT_INSTANTIATION. Therefore, we allow
9261 the explicit instantiation of a class where some of the members
9262 have no definition in the current translation unit. */
9265 for (tmp
= TYPE_METHODS (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
9266 if (TREE_CODE (tmp
) == FUNCTION_DECL
9267 && DECL_TEMPLATE_INSTANTIATION (tmp
))
9269 mark_decl_instantiated (tmp
, extern_p
);
9270 repo_template_instantiated (tmp
, extern_p
);
9272 instantiate_decl (tmp
);
9275 for (tmp
= TYPE_FIELDS (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
9276 if (TREE_CODE (tmp
) == VAR_DECL
&& DECL_TEMPLATE_INSTANTIATION (tmp
))
9278 mark_decl_instantiated (tmp
, extern_p
);
9279 repo_template_instantiated (tmp
, extern_p
);
9281 instantiate_decl (tmp
);
9284 for (tmp
= CLASSTYPE_TAGS (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
9285 if (IS_AGGR_TYPE (TREE_VALUE (tmp
))
9286 && !uses_template_parms (CLASSTYPE_TI_ARGS (TREE_VALUE (tmp
))))
9287 do_type_instantiation (TYPE_MAIN_DECL (TREE_VALUE (tmp
)), storage
);
9291 /* Given a function DECL, which is a specialization of TMPL, modify
9292 DECL to be a re-instantiation of TMPL with the same template
9293 arguments. TMPL should be the template into which tsubst'ing
9294 should occur for DECL, not the most general template.
9296 One reason for doing this is a scenario like this:
9299 void f(const T&, int i);
9301 void g() { f(3, 7); }
9304 void f(const T& t, const int i) { }
9306 Note that when the template is first instantiated, with
9307 instantiate_template, the resulting DECL will have no name for the
9308 first parameter, and the wrong type for the second. So, when we go
9309 to instantiate the DECL, we regenerate it. */
9312 regenerate_decl_from_template (decl
, tmpl
)
9322 args
= DECL_TI_ARGS (decl
);
9323 code_pattern
= DECL_TEMPLATE_RESULT (tmpl
);
9325 /* Unregister the specialization so that when we tsubst we will not
9326 just return DECL. We don't have to unregister DECL from TMPL
9327 because if would only be registered there if it were a partial
9328 instantiation of a specialization, which it isn't: it's a full
9330 gen_tmpl
= most_general_template (tmpl
);
9331 unregistered
= unregister_specialization (decl
, gen_tmpl
);
9333 /* If the DECL was not unregistered then something peculiar is
9334 happening: we created a specialization but did not call
9335 register_specialization for it. */
9336 my_friendly_assert (unregistered
, 0);
9338 if (TREE_CODE (decl
) == VAR_DECL
)
9339 /* Make sure that we can see identifiers, and compute access
9340 correctly, for the class members used in the declaration of
9341 this static variable. */
9342 pushclass (DECL_CONTEXT (decl
), 2);
9344 /* Do the substitution to get the new declaration. */
9345 new_decl
= tsubst (code_pattern
, args
, /*complain=*/1, NULL_TREE
);
9347 if (TREE_CODE (decl
) == VAR_DECL
)
9349 /* Set up DECL_INITIAL, since tsubst doesn't. */
9350 DECL_INITIAL (new_decl
) =
9351 tsubst_expr (DECL_INITIAL (code_pattern
), args
,
9352 /*complain=*/1, DECL_TI_TEMPLATE (decl
));
9353 /* Pop the class context we pushed above. */
9356 else if (TREE_CODE (decl
) == FUNCTION_DECL
)
9358 /* Convince duplicate_decls to use the DECL_ARGUMENTS from the
9360 DECL_INITIAL (new_decl
) = error_mark_node
;
9361 /* And don't complain about a duplicate definition. */
9362 DECL_INITIAL (decl
) = NULL_TREE
;
9365 /* The immediate parent of the new template is still whatever it was
9366 before, even though tsubst sets DECL_TI_TEMPLATE up as the most
9367 general template. We also reset the DECL_ASSEMBLER_NAME since
9368 tsubst always calculates the name as if the function in question
9369 were really a template instance, and sometimes, with friend
9370 functions, this is not so. See tsubst_friend_function for
9372 DECL_TI_TEMPLATE (new_decl
) = DECL_TI_TEMPLATE (decl
);
9373 DECL_ASSEMBLER_NAME (new_decl
) = DECL_ASSEMBLER_NAME (decl
);
9374 DECL_RTL (new_decl
) = DECL_RTL (decl
);
9376 /* Call duplicate decls to merge the old and new declarations. */
9377 duplicate_decls (new_decl
, decl
);
9379 /* Now, re-register the specialization. */
9380 register_specialization (decl
, gen_tmpl
, args
);
9383 /* Produce the definition of D, a _DECL generated from a template. */
9386 instantiate_decl (d
)
9389 tree tmpl
= DECL_TI_TEMPLATE (d
);
9390 tree args
= DECL_TI_ARGS (d
);
9395 int nested
= in_function_p ();
9396 int pattern_defined
;
9398 char *file
= input_filename
;
9399 tree old_fn
= current_function_decl
;
9401 /* This function should only be used to instantiate templates for
9402 functions and static member variables. */
9403 my_friendly_assert (TREE_CODE (d
) == FUNCTION_DECL
9404 || TREE_CODE (d
) == VAR_DECL
, 0);
9406 if (DECL_TEMPLATE_INSTANTIATED (d
))
9407 /* D has already been instantiated. It might seem reasonable to
9408 check whether or not D is an explict instantiation, and, if so,
9409 stop here. But when an explicit instantiation is deferred
9410 until the end of the compilation, DECL_EXPLICIT_INSTANTIATION
9411 is set, even though we still need to do the instantiation. */
9414 /* If we already have a specialization of this declaration, then
9415 there's no reason to instantiate it. Note that
9416 retrieve_specialization gives us both instantiations and
9417 specializations, so we must explicitly check
9418 DECL_TEMPLATE_SPECIALIZATION. */
9419 gen_tmpl
= most_general_template (tmpl
);
9420 spec
= retrieve_specialization (gen_tmpl
, args
);
9421 if (spec
!= NULL_TREE
&& DECL_TEMPLATE_SPECIALIZATION (spec
))
9424 /* This needs to happen before any tsubsting. */
9425 if (! push_tinst_level (d
))
9428 /* Set TD to the template whose DECL_TEMPLATE_RESULT is the pattern
9429 for the instantiation. This is not always the most general
9430 template. Consider, for example:
9433 struct S { template <class U> void f();
9434 template <> void f<int>(); };
9436 and an instantiation of S<double>::f<int>. We want TD to be the
9437 specialization S<T>::f<int>, not the more general S<T>::f<U>. */
9440 /* An instantiation cannot have a definition, so we need a
9441 more general template. */
9442 DECL_TEMPLATE_INSTANTIATION (td
)
9443 /* We must also deal with friend templates. Given:
9445 template <class T> struct S {
9446 template <class U> friend void f() {};
9449 S<int>::f<U> say, is not an instantiation of S<T>::f<U>,
9450 so far as the language is concerned, but that's still
9451 where we get the pattern for the instantiation from. On
9452 ther hand, if the definition comes outside the class, say:
9454 template <class T> struct S {
9455 template <class U> friend void f();
9457 template <class U> friend void f() {}
9459 we don't need to look any further. That's what the check for
9460 DECL_INITIAL is for. */
9461 || (TREE_CODE (d
) == FUNCTION_DECL
9462 && DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (td
)
9463 && !DECL_INITIAL (DECL_TEMPLATE_RESULT (td
)));
9466 /* The present template, TD, should not be a definition. If it
9467 were a definition, we should be using it! Note that we
9468 cannot restructure the loop to just keep going until we find
9469 a template with a definition, since that might go too far if
9470 a specialization was declared, but not defined. */
9471 my_friendly_assert (!(TREE_CODE (d
) == VAR_DECL
9472 && !DECL_IN_AGGR_P (DECL_TEMPLATE_RESULT (td
))),
9475 /* Fetch the more general template. */
9476 td
= DECL_TI_TEMPLATE (td
);
9479 code_pattern
= DECL_TEMPLATE_RESULT (td
);
9481 if (TREE_CODE (d
) == FUNCTION_DECL
)
9482 pattern_defined
= (DECL_SAVED_TREE (code_pattern
) != NULL_TREE
);
9484 pattern_defined
= ! DECL_IN_AGGR_P (code_pattern
);
9486 push_to_top_level ();
9487 lineno
= DECL_SOURCE_LINE (d
);
9488 input_filename
= DECL_SOURCE_FILE (d
);
9490 if (pattern_defined
)
9492 repo_template_used (d
);
9494 if (flag_external_templates
&& ! DECL_INTERFACE_KNOWN (d
))
9496 if (flag_alt_external_templates
)
9498 if (interface_unknown
)
9499 warn_if_unknown_interface (d
);
9501 else if (DECL_INTERFACE_KNOWN (code_pattern
))
9503 DECL_INTERFACE_KNOWN (d
) = 1;
9504 DECL_NOT_REALLY_EXTERN (d
) = ! DECL_EXTERNAL (code_pattern
);
9507 warn_if_unknown_interface (code_pattern
);
9511 import_export_decl (d
);
9514 /* Reject all external templates except inline functions. */
9515 if (DECL_INTERFACE_KNOWN (d
)
9516 && ! DECL_NOT_REALLY_EXTERN (d
)
9517 && ! (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_INLINE (d
)))
9520 if (TREE_CODE (d
) == VAR_DECL
9521 && TREE_READONLY (d
)
9522 && DECL_INITIAL (d
) == NULL_TREE
9523 && DECL_INITIAL (code_pattern
) != NULL_TREE
)
9524 /* We need to set up DECL_INITIAL regardless of pattern_defined if
9525 the variable is a static const initialized in the class body. */;
9526 else if (pattern_defined
&& nested
9527 && TREE_CODE (d
) == FUNCTION_DECL
&& DECL_INLINE (d
))
9528 /* An inline function used in another function; instantiate it now so
9529 we can inline it. */;
9530 else if (! pattern_defined
|| ! at_eof
)
9532 /* Defer all other templates. We restore the source position
9533 here because it's used by add_pending_template. */
9535 input_filename
= file
;
9537 if (at_eof
&& !pattern_defined
9538 && DECL_EXPLICIT_INSTANTIATION (d
))
9541 The definition of a non-exported function template, a
9542 non-exported member function template, or a non-exported
9543 member function or static data member of a class template
9544 shall be present in every translation unit in which it is
9545 explicitly instantiated. */
9546 cp_error ("explicit instantiation of `%D' but no definition available",
9549 add_pending_template (d
);
9553 /* If this instantiation is COMDAT, we don't know whether or not we
9554 will really need to write it out. If we can't be sure, mark it
9555 DECL_DEFER_OUTPUT. NOTE: This increases memory consumption,
9556 since we keep some instantiations in memory rather than write
9557 them out immediately and forget them. A better approach would be
9558 to wait until we know we need them to do the instantiation, but
9559 that would break templates with static locals, because we
9560 generate the functions to destroy statics before we determine
9561 which functions are needed. A better solution would be to
9562 generate the ctor and dtor functions as we go. */
9564 if (TREE_CODE (d
) == FUNCTION_DECL
9566 && ! DECL_NEEDED_P (d
)
9567 /* If the function that caused us to be instantiated is needed, we
9568 will be needed, too. */
9569 && (! nested
|| (old_fn
&& ! DECL_NEEDED_P (old_fn
))))
9570 DECL_DEFER_OUTPUT (d
) = 1;
9572 /* We're now committed to instantiating this template. Mark it as
9573 instantiated so that recursive calls to instantiate_decl do not
9574 try to instantiate it again. */
9575 DECL_TEMPLATE_INSTANTIATED (d
) = 1;
9577 /* Regenerate the declaration in case the template has been modified
9578 by a subsequent redeclaration. */
9579 regenerate_decl_from_template (d
, td
);
9581 /* We already set the file and line above. Reset them now in case
9582 they changed as a result of calling regenerate_decl_from_template. */
9583 lineno
= DECL_SOURCE_LINE (d
);
9584 input_filename
= DECL_SOURCE_FILE (d
);
9586 if (TREE_CODE (d
) == VAR_DECL
)
9588 DECL_IN_AGGR_P (d
) = 0;
9589 if (DECL_INTERFACE_KNOWN (d
))
9590 DECL_EXTERNAL (d
) = ! DECL_NOT_REALLY_EXTERN (d
);
9593 DECL_EXTERNAL (d
) = 1;
9594 DECL_NOT_REALLY_EXTERN (d
) = 1;
9596 cp_finish_decl (d
, DECL_INITIAL (d
), NULL_TREE
, 0);
9598 else if (TREE_CODE (d
) == FUNCTION_DECL
)
9600 /* Set up context. */
9601 start_function (NULL_TREE
, d
, NULL_TREE
, SF_PRE_PARSED
);
9602 store_parm_decls ();
9604 /* We already set up __FUNCTION__, etc., so we don't want to do
9606 current_function_name_declared
= 1;
9608 /* Substitute into the body of the function. */
9609 tsubst_expr (DECL_SAVED_TREE (code_pattern
), args
,
9610 /*complain=*/1, tmpl
);
9612 /* Finish the function. */
9613 expand_body (finish_function (lineno
, 0));
9616 /* We're not deferring instantiation any more. */
9617 TI_PENDING_TEMPLATE_FLAG (DECL_TEMPLATE_INFO (d
)) = 0;
9621 input_filename
= file
;
9623 pop_from_top_level ();
9629 /* Run through the list of templates that we wish we could
9630 instantiate, and instantiate any we can. */
9633 instantiate_pending_templates ()
9636 int instantiated_something
= 0;
9643 t
= &pending_templates
;
9646 tree srcloc
= TREE_PURPOSE (*t
);
9647 tree instantiation
= TREE_VALUE (*t
);
9649 input_filename
= SRCLOC_FILE (srcloc
);
9650 lineno
= SRCLOC_LINE (srcloc
);
9652 if (TREE_CODE_CLASS (TREE_CODE (instantiation
)) == 't')
9656 if (!COMPLETE_TYPE_P (instantiation
))
9658 instantiate_class_template (instantiation
);
9659 if (CLASSTYPE_TEMPLATE_INSTANTIATION (instantiation
))
9660 for (fn
= TYPE_METHODS (instantiation
);
9662 fn
= TREE_CHAIN (fn
))
9663 if (! DECL_ARTIFICIAL (fn
))
9664 instantiate_decl (fn
);
9665 if (COMPLETE_TYPE_P (instantiation
))
9667 instantiated_something
= 1;
9672 if (COMPLETE_TYPE_P (instantiation
))
9673 /* If INSTANTIATION has been instantiated, then we don't
9674 need to consider it again in the future. */
9675 *t
= TREE_CHAIN (*t
);
9677 t
= &TREE_CHAIN (*t
);
9681 if (DECL_TEMPLATE_INSTANTIATION (instantiation
)
9682 && !DECL_TEMPLATE_INSTANTIATED (instantiation
))
9684 instantiation
= instantiate_decl (instantiation
);
9685 if (DECL_TEMPLATE_INSTANTIATED (instantiation
))
9687 instantiated_something
= 1;
9692 if (!DECL_TEMPLATE_INSTANTIATION (instantiation
)
9693 || DECL_TEMPLATE_INSTANTIATED (instantiation
))
9694 /* If INSTANTIATION has been instantiated, then we don't
9695 need to consider it again in the future. */
9696 *t
= TREE_CHAIN (*t
);
9698 t
= &TREE_CHAIN (*t
);
9703 /* Go through the things that are template instantiations if we are
9704 using guiding declarations. */
9705 t
= &maybe_templates
;
9712 fn
= TREE_VALUE (*t
);
9714 if (DECL_INITIAL (fn
))
9715 /* If the FN is already defined, then it was either already
9716 instantiated or, even though guiding declarations were
9717 allowed, a non-template definition was provided. */
9721 template = TREE_PURPOSE (*t
);
9722 args
= get_bindings (template, fn
, NULL_TREE
);
9723 fn
= instantiate_template (template, args
);
9724 instantiate_decl (fn
);
9728 /* Remove this entry from the chain. */
9729 *t
= TREE_CHAIN (*t
);
9731 maybe_template_tail
= t
;
9735 return instantiated_something
;
9738 /* Substitute ARGVEC into T, which is a TREE_LIST. In particular, it
9739 is an initializer list: the TREE_PURPOSEs are DECLs, and the
9740 TREE_VALUEs are initializer values. Used by instantiate_decl. */
9743 tsubst_expr_values (t
, argvec
)
9746 tree first
= NULL_TREE
;
9749 for (; t
; t
= TREE_CHAIN (t
))
9751 tree pur
= tsubst_copy (TREE_PURPOSE (t
), argvec
,
9752 /*complain=*/1, NULL_TREE
);
9753 tree val
= tsubst_expr (TREE_VALUE (t
), argvec
, /*complain=*/1,
9755 *p
= build_tree_list (pur
, val
);
9756 p
= &TREE_CHAIN (*p
);
9761 /* D is an undefined function declaration in the presence of templates with
9762 the same name, listed in FNS. If one of them can produce D as an
9763 instantiation, remember this so we can instantiate it at EOF if D has
9764 not been defined by that time. */
9767 add_maybe_template (d
, fns
)
9772 if (DECL_MAYBE_TEMPLATE (d
))
9775 t
= most_specialized (fns
, d
, NULL_TREE
);
9778 if (t
== error_mark_node
)
9780 cp_error ("ambiguous template instantiation for `%D'", d
);
9784 *maybe_template_tail
= tree_cons (t
, d
, NULL_TREE
);
9785 maybe_template_tail
= &TREE_CHAIN (*maybe_template_tail
);
9786 DECL_MAYBE_TEMPLATE (d
) = 1;
9789 /* Set CURRENT_ACCESS_SPECIFIER based on the protection of DECL. */
9792 set_current_access_from_decl (decl
)
9795 if (TREE_PRIVATE (decl
))
9796 current_access_specifier
= access_private_node
;
9797 else if (TREE_PROTECTED (decl
))
9798 current_access_specifier
= access_protected_node
;
9800 current_access_specifier
= access_public_node
;
9803 /* Instantiate an enumerated type. TAG is the template type, NEWTAG
9804 is the instantiation (which should have been created with
9805 start_enum) and ARGS are the template arguments to use. */
9808 tsubst_enum (tag
, newtag
, args
)
9815 for (e
= TYPE_VALUES (tag
); e
; e
= TREE_CHAIN (e
))
9819 /* Note that in a template enum, the TREE_VALUE is the
9820 CONST_DECL, not the corresponding INTEGER_CST. */
9821 value
= tsubst_expr (DECL_INITIAL (TREE_VALUE (e
)),
9822 args
, /*complain=*/1,
9825 /* Give this enumeration constant the correct access. */
9826 set_current_access_from_decl (TREE_VALUE (e
));
9828 /* Actually build the enumerator itself. */
9829 build_enumerator (TREE_PURPOSE (e
), value
, newtag
);
9832 finish_enum (newtag
);
9835 /* Set the DECL_ASSEMBLER_NAME for DECL, which is a FUNCTION_DECL that
9836 is either an instantiation or specialization of a template
9840 set_mangled_name_for_template_decl (decl
)
9843 tree saved_namespace
;
9844 tree context
= NULL_TREE
;
9853 my_friendly_assert (TREE_CODE (decl
) == FUNCTION_DECL
, 0);
9854 my_friendly_assert (DECL_TEMPLATE_INFO (decl
) != NULL_TREE
, 0);
9856 /* The names of template functions must be mangled so as to indicate
9857 what template is being specialized with what template arguments.
9858 For example, each of the following three functions must get
9859 different mangled names:
9862 template <> void f<7>(int);
9863 template <> void f<8>(int); */
9865 targs
= DECL_TI_ARGS (decl
);
9866 if (uses_template_parms (targs
))
9867 /* This DECL is for a partial instantiation. There's no need to
9868 mangle the name of such an entity. */
9871 tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
9872 tparms
= DECL_TEMPLATE_PARMS (tmpl
);
9873 parm_depth
= TMPL_PARMS_DEPTH (tparms
);
9875 /* There should be as many levels of arguments as there are levels
9877 my_friendly_assert (parm_depth
== TMPL_ARGS_DEPTH (targs
), 0);
9879 /* We now compute the PARMS and RET_TYPE to give to
9880 build_decl_overload_real. The PARMS and RET_TYPE are the
9881 parameter and return types of the template, after all but the
9882 innermost template arguments have been substituted, not the
9883 parameter and return types of the function DECL. For example,
9886 template <class T> T f(T);
9888 both PARMS and RET_TYPE should be `T' even if DECL is `int f(int)'.
9889 A more subtle example is:
9891 template <class T> struct S { template <class U> void f(T, U); }
9893 Here, if DECL is `void S<int>::f(int, double)', PARMS should be
9894 {int, U}. Thus, the args that we want to subsitute into the
9895 return and parameter type for the function are those in TARGS,
9896 with the innermost level omitted. */
9897 fn_type
= TREE_TYPE (tmpl
);
9898 if (DECL_STATIC_FUNCTION_P (decl
))
9899 context
= DECL_CONTEXT (decl
);
9901 if (parm_depth
== 1)
9902 /* No substitution is necessary. */
9909 /* Replace the innermost level of the TARGS with NULL_TREEs to
9910 let tsubst know not to subsitute for those parameters. */
9911 partial_args
= make_tree_vec (TREE_VEC_LENGTH (targs
));
9912 for (i
= 1; i
< TMPL_ARGS_DEPTH (targs
); ++i
)
9913 SET_TMPL_ARGS_LEVEL (partial_args
, i
,
9914 TMPL_ARGS_LEVEL (targs
, i
));
9915 SET_TMPL_ARGS_LEVEL (partial_args
,
9916 TMPL_ARGS_DEPTH (targs
),
9917 make_tree_vec (DECL_NTPARMS (tmpl
)));
9919 /* Now, do the (partial) substitution to figure out the
9920 appropriate function type. */
9921 fn_type
= tsubst (fn_type
, partial_args
, /*complain=*/1, NULL_TREE
);
9922 if (DECL_STATIC_FUNCTION_P (decl
))
9923 context
= tsubst (context
, partial_args
, /*complain=*/1, NULL_TREE
);
9925 /* Substitute into the template parameters to obtain the real
9926 innermost set of parameters. This step is important if the
9927 innermost set of template parameters contains value
9928 parameters whose types depend on outer template parameters. */
9929 TREE_VEC_LENGTH (partial_args
)--;
9930 tparms
= tsubst_template_parms (tparms
, partial_args
, /*complain=*/1);
9933 /* Now, get the innermost parameters and arguments, and figure out
9934 the parameter and return types. */
9935 tparms
= INNERMOST_TEMPLATE_PARMS (tparms
);
9936 targs
= innermost_args (targs
);
9937 ret_type
= TREE_TYPE (fn_type
);
9938 parm_types
= TYPE_ARG_TYPES (fn_type
);
9940 /* For a static member function, we generate a fake `this' pointer,
9941 for the purposes of mangling. This indicates of which class the
9942 function is a member. Because of:
9946 There shall not be a static and a nonstatic member function
9947 with the same name and the same parameter types
9949 we don't have to worry that this will result in a clash with a
9950 non-static member function. */
9951 if (DECL_STATIC_FUNCTION_P (decl
))
9952 parm_types
= hash_tree_chain (build_pointer_type (context
), parm_types
);
9954 /* There should be the same number of template parameters as
9955 template arguments. */
9956 my_friendly_assert (TREE_VEC_LENGTH (tparms
) == TREE_VEC_LENGTH (targs
),
9959 /* If the template is in a namespace, we need to put that into the
9960 mangled name. Unfortunately, build_decl_overload_real does not
9961 get the decl to mangle, so it relies on the current
9962 namespace. Therefore, we set that here temporarily. */
9963 my_friendly_assert (TREE_CODE_CLASS (TREE_CODE (decl
)) == 'd', 980702);
9964 saved_namespace
= current_namespace
;
9965 current_namespace
= CP_DECL_CONTEXT (decl
);
9967 /* Actually set the DCL_ASSEMBLER_NAME. */
9968 DECL_ASSEMBLER_NAME (decl
)
9969 = build_decl_overload_real (DECL_NAME (decl
), parm_types
, ret_type
,
9971 DECL_FUNCTION_MEMBER_P (decl
)
9972 + DECL_CONSTRUCTOR_P (decl
));
9974 /* Restore the previously active namespace. */
9975 current_namespace
= saved_namespace
;