1 /* Handle parameterized types (templates) for GNU C++.
2 Copyright (C) 1992, 93-97, 1998, 1999 Free Software Foundation, Inc.
3 Written by Ken Raeburn (raeburn@cygnus.com) while at Watchmaker Computing.
4 Rewritten by Jason Merrill (jason@cygnus.com).
6 This file is part of GNU CC.
8 GNU CC is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 2, or (at your option)
13 GNU CC is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GNU CC; see the file COPYING. If not, write to
20 the Free Software Foundation, 59 Temple Place - Suite 330,
21 Boston, MA 02111-1307, USA. */
23 /* Known bugs or deficiencies include:
25 all methods must be provided in header files; can't use a source
26 file that contains only the method templates and "just win". */
46 /* The type of functions taking a tree, and some additional data, and
48 typedef int (*tree_fn_t
) PROTO((tree
, void*));
50 extern struct obstack permanent_obstack
;
53 extern char *input_filename
;
55 /* The PENDING_TEMPLATES is a TREE_LIST of templates whose
56 instantiations have been deferred, either because their definitions
57 were not yet available, or because we were putting off doing the
58 work. The TREE_PURPOSE of each entry is a SRCLOC indicating where
59 the instantiate request occurred; the TREE_VALUE is a either a DECL
60 (for a function or static data member), or a TYPE (for a class)
61 indicating what we are hoping to instantiate. */
62 static tree pending_templates
;
63 static tree
*template_tail
= &pending_templates
;
65 static tree maybe_templates
;
66 static tree
*maybe_template_tail
= &maybe_templates
;
68 int processing_template_parmlist
;
69 static int template_header_count
;
71 static tree saved_trees
;
72 static varray_type inline_parm_levels
;
73 static size_t inline_parm_levels_used
;
75 #define obstack_chunk_alloc xmalloc
76 #define obstack_chunk_free free
78 #define UNIFY_ALLOW_NONE 0
79 #define UNIFY_ALLOW_MORE_CV_QUAL 1
80 #define UNIFY_ALLOW_LESS_CV_QUAL 2
81 #define UNIFY_ALLOW_DERIVED 4
82 #define UNIFY_ALLOW_INTEGER 8
84 #define GTB_VIA_VIRTUAL 1 /* The base class we are examining is
85 virtual, or a base class of a virtual
87 #define GTB_IGNORE_TYPE 2 /* We don't need to try to unify the current
88 type with the desired type. */
90 static int resolve_overloaded_unification
PROTO((tree
, tree
, tree
, tree
,
91 unification_kind_t
, int));
92 static int try_one_overload
PROTO((tree
, tree
, tree
, tree
, tree
,
93 unification_kind_t
, int));
94 static int unify
PROTO((tree
, tree
, tree
, tree
, int));
95 static void add_pending_template
PROTO((tree
));
96 static int push_tinst_level
PROTO((tree
));
97 static tree classtype_mangled_name
PROTO((tree
));
98 static char *mangle_class_name_for_template
PROTO((char *, tree
, tree
));
99 static tree tsubst_expr_values
PROTO((tree
, tree
));
100 static int list_eq
PROTO((tree
, tree
));
101 static tree get_class_bindings
PROTO((tree
, tree
, tree
));
102 static tree coerce_template_parms
PROTO((tree
, tree
, tree
, int, int));
103 static void tsubst_enum
PROTO((tree
, tree
, tree
));
104 static tree add_to_template_args
PROTO((tree
, tree
));
105 static tree add_outermost_template_args
PROTO((tree
, tree
));
106 static void maybe_adjust_types_for_deduction
PROTO((unification_kind_t
, tree
*,
108 static int type_unification_real
PROTO((tree
, tree
, tree
, tree
,
109 int, unification_kind_t
, int));
110 static void note_template_header
PROTO((int));
111 static tree maybe_fold_nontype_arg
PROTO((tree
));
112 static tree convert_nontype_argument
PROTO((tree
, tree
));
113 static tree convert_template_argument
PROTO ((tree
, tree
, tree
, int,
115 static tree get_bindings_overload
PROTO((tree
, tree
, tree
));
116 static int for_each_template_parm
PROTO((tree
, tree_fn_t
, void*));
117 static tree build_template_parm_index
PROTO((int, int, int, tree
, tree
));
118 static int inline_needs_template_parms
PROTO((tree
));
119 static void push_inline_template_parms_recursive
PROTO((tree
, int));
120 static tree retrieve_specialization
PROTO((tree
, tree
));
121 static tree retrieve_local_specialization
PROTO((tree
, tree
));
122 static tree register_specialization
PROTO((tree
, tree
, tree
));
123 static tree register_local_specialization
PROTO((tree
, tree
, tree
));
124 static int unregister_specialization
PROTO((tree
, tree
));
125 static tree reduce_template_parm_level
PROTO((tree
, tree
, int));
126 static tree build_template_decl
PROTO((tree
, tree
));
127 static int mark_template_parm
PROTO((tree
, void *));
128 static tree tsubst_friend_function
PROTO((tree
, tree
));
129 static tree tsubst_friend_class
PROTO((tree
, tree
));
130 static tree get_bindings_real
PROTO((tree
, tree
, tree
, int));
131 static int template_decl_level
PROTO((tree
));
132 static tree maybe_get_template_decl_from_type_decl
PROTO((tree
));
133 static int check_cv_quals_for_unify
PROTO((int, tree
, tree
));
134 static tree tsubst_template_arg_vector
PROTO((tree
, tree
, int));
135 static tree tsubst_template_parms
PROTO((tree
, tree
, int));
136 static void regenerate_decl_from_template
PROTO((tree
, tree
));
137 static tree most_specialized
PROTO((tree
, tree
, tree
));
138 static tree most_specialized_class
PROTO((tree
, tree
));
139 static void set_mangled_name_for_template_decl
PROTO((tree
));
140 static int template_class_depth_real
PROTO((tree
, int));
141 static tree tsubst_aggr_type
PROTO((tree
, tree
, int, tree
, int));
142 static tree tsubst_decl
PROTO((tree
, tree
, tree
, tree
));
143 static tree tsubst_arg_types
PROTO((tree
, tree
, int, tree
));
144 static tree tsubst_function_type
PROTO((tree
, tree
, int, tree
));
145 static void check_specialization_scope
PROTO((void));
146 static tree process_partial_specialization
PROTO((tree
));
147 static void set_current_access_from_decl
PROTO((tree
));
148 static void check_default_tmpl_args
PROTO((tree
, tree
, int, int));
149 static tree tsubst_call_declarator_parms
PROTO((tree
, tree
, int, tree
));
150 static tree get_template_base_recursive
PROTO((tree
, tree
,
151 tree
, tree
, tree
, int));
152 static tree get_template_base
PROTO((tree
, tree
, tree
, tree
));
153 static tree try_class_unification
PROTO((tree
, tree
, tree
, tree
));
154 static int coerce_template_template_parms
PROTO((tree
, tree
, int,
156 static tree determine_specialization
PROTO((tree
, tree
, tree
*, int));
157 static int template_args_equal
PROTO((tree
, tree
));
158 static void print_template_context
PROTO((int));
159 static void tsubst_default_arguments
PROTO((tree
));
161 /* Called once to initialize pt.c. */
166 ggc_add_tree_root (&pending_templates
, 1);
167 ggc_add_tree_root (&maybe_templates
, 1);
168 ggc_add_tree_root (&saved_trees
, 1);
171 /* Do any processing required when DECL (a member template declaration
172 using TEMPLATE_PARAMETERS as its innermost parameter list) is
173 finished. Returns the TEMPLATE_DECL corresponding to DECL, unless
174 it is a specialization, in which case the DECL itself is returned. */
177 finish_member_template_decl (decl
)
180 if (decl
== NULL_TREE
|| decl
== void_type_node
)
182 else if (decl
== error_mark_node
)
183 /* By returning NULL_TREE, the parser will just ignore this
184 declaration. We have already issued the error. */
186 else if (TREE_CODE (decl
) == TREE_LIST
)
188 /* Assume that the class is the only declspec. */
189 decl
= TREE_VALUE (decl
);
190 if (IS_AGGR_TYPE (decl
) && CLASSTYPE_TEMPLATE_INFO (decl
)
191 && ! CLASSTYPE_TEMPLATE_SPECIALIZATION (decl
))
193 tree tmpl
= CLASSTYPE_TI_TEMPLATE (decl
);
194 check_member_template (tmpl
);
199 else if (DECL_TEMPLATE_INFO (decl
))
201 if (!DECL_TEMPLATE_SPECIALIZATION (decl
))
203 check_member_template (DECL_TI_TEMPLATE (decl
));
204 return DECL_TI_TEMPLATE (decl
);
210 cp_error ("invalid member template declaration `%D'", decl
);
212 return error_mark_node
;
215 /* Returns the template nesting level of the indicated class TYPE.
225 A<T>::B<U> has depth two, while A<T> has depth one.
226 Both A<T>::B<int> and A<int>::B<U> have depth one, if
227 COUNT_SPECIALIZATIONS is 0 or if they are instantiations, not
230 This function is guaranteed to return 0 if passed NULL_TREE so
231 that, for example, `template_class_depth (current_class_type)' is
235 template_class_depth_real (type
, count_specializations
)
237 int count_specializations
;
242 type
&& TREE_CODE (type
) != NAMESPACE_DECL
;
243 type
= (TREE_CODE (type
) == FUNCTION_DECL
)
244 ? DECL_REAL_CONTEXT (type
) : TYPE_CONTEXT (type
))
246 if (TREE_CODE (type
) != FUNCTION_DECL
)
248 if (CLASSTYPE_TEMPLATE_INFO (type
)
249 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (type
))
250 && ((count_specializations
251 && CLASSTYPE_TEMPLATE_SPECIALIZATION (type
))
252 || uses_template_parms (CLASSTYPE_TI_ARGS (type
))))
257 if (DECL_TEMPLATE_INFO (type
)
258 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (type
))
259 && ((count_specializations
260 && DECL_TEMPLATE_SPECIALIZATION (type
))
261 || uses_template_parms (DECL_TI_ARGS (type
))))
269 /* Returns the template nesting level of the indicated class TYPE.
270 Like template_class_depth_real, but instantiations do not count in
274 template_class_depth (type
)
277 return template_class_depth_real (type
, /*count_specializations=*/0);
280 /* Returns 1 if processing DECL as part of do_pending_inlines
281 needs us to push template parms. */
284 inline_needs_template_parms (decl
)
287 if (! DECL_TEMPLATE_INFO (decl
))
290 return (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (most_general_template (decl
)))
291 > (processing_template_decl
+ DECL_TEMPLATE_SPECIALIZATION (decl
)));
294 /* Subroutine of maybe_begin_member_template_processing.
295 Push the template parms in PARMS, starting from LEVELS steps into the
296 chain, and ending at the beginning, since template parms are listed
300 push_inline_template_parms_recursive (parmlist
, levels
)
304 tree parms
= TREE_VALUE (parmlist
);
308 push_inline_template_parms_recursive (TREE_CHAIN (parmlist
), levels
- 1);
310 ++processing_template_decl
;
311 current_template_parms
312 = tree_cons (build_int_2 (0, processing_template_decl
),
313 parms
, current_template_parms
);
314 TEMPLATE_PARMS_FOR_INLINE (current_template_parms
) = 1;
317 for (i
= 0; i
< TREE_VEC_LENGTH (parms
); ++i
)
319 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
320 my_friendly_assert (TREE_CODE_CLASS (TREE_CODE (parm
)) == 'd', 0);
322 switch (TREE_CODE (parm
))
331 /* Make a CONST_DECL as is done in process_template_parm.
332 It is ugly that we recreate this here; the original
333 version built in process_template_parm is no longer
335 tree decl
= build_decl (CONST_DECL
, DECL_NAME (parm
),
337 SET_DECL_ARTIFICIAL (decl
);
338 DECL_INITIAL (decl
) = DECL_INITIAL (parm
);
339 DECL_TEMPLATE_PARM_P (decl
) = 1;
345 my_friendly_abort (0);
350 /* Restore the template parameter context for a member template or
351 a friend template defined in a class definition. */
354 maybe_begin_member_template_processing (decl
)
360 if (inline_needs_template_parms (decl
))
362 parms
= DECL_TEMPLATE_PARMS (most_general_template (decl
));
363 levels
= TMPL_PARMS_DEPTH (parms
) - processing_template_decl
;
365 if (DECL_TEMPLATE_SPECIALIZATION (decl
))
368 parms
= TREE_CHAIN (parms
);
371 push_inline_template_parms_recursive (parms
, levels
);
374 /* Remember how many levels of template parameters we pushed so that
375 we can pop them later. */
376 if (!inline_parm_levels
)
377 VARRAY_INT_INIT (inline_parm_levels
, 4, "inline_parm_levels");
378 if (inline_parm_levels_used
== inline_parm_levels
->num_elements
)
379 VARRAY_GROW (inline_parm_levels
, 2 * inline_parm_levels_used
);
380 VARRAY_INT (inline_parm_levels
, inline_parm_levels_used
) = levels
;
381 ++inline_parm_levels_used
;
384 /* Undo the effects of begin_member_template_processing. */
387 maybe_end_member_template_processing ()
391 if (!inline_parm_levels_used
)
394 --inline_parm_levels_used
;
396 i
< VARRAY_INT (inline_parm_levels
, inline_parm_levels_used
);
399 --processing_template_decl
;
400 current_template_parms
= TREE_CHAIN (current_template_parms
);
405 /* Returns non-zero iff T is a member template function. We must be
408 template <class T> class C { void f(); }
410 Here, f is a template function, and a member, but not a member
411 template. This function does not concern itself with the origin of
412 T, only its present state. So if we have
414 template <class T> class C { template <class U> void f(U); }
416 then neither C<int>::f<char> nor C<T>::f<double> is considered
417 to be a member template. But, `template <class U> void
418 C<int>::f(U)' is considered a member template. */
421 is_member_template (t
)
424 if (!DECL_FUNCTION_TEMPLATE_P (t
))
425 /* Anything that isn't a function or a template function is
426 certainly not a member template. */
429 /* A local class can't have member templates. */
430 if (hack_decl_function_context (t
))
433 return (DECL_FUNCTION_MEMBER_P (DECL_TEMPLATE_RESULT (t
))
434 /* If there are more levels of template parameters than
435 there are template classes surrounding the declaration,
436 then we have a member template. */
437 && (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (t
)) >
438 template_class_depth (DECL_CLASS_CONTEXT (t
))));
442 /* Returns non-zero iff T is a member template class. See
443 is_member_template for a description of what precisely constitutes
444 a member template. */
447 is_member_template_class (t
)
450 if (!DECL_CLASS_TEMPLATE_P (t
))
451 /* Anything that isn't a class template, is certainly not a member
455 if (!DECL_CLASS_SCOPE_P (t
))
456 /* Anything whose context isn't a class type is surely not a
460 /* If there are more levels of template parameters than there are
461 template classes surrounding the declaration, then we have a
463 return (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (t
)) >
464 template_class_depth (DECL_CONTEXT (t
)));
468 /* Return a new template argument vector which contains all of ARGS,
469 but has as its innermost set of arguments the EXTRA_ARGS. The
470 resulting vector will be built on a temporary obstack, and so must
471 be explicitly copied to the permanent obstack, if required. */
474 add_to_template_args (args
, extra_args
)
483 extra_depth
= TMPL_ARGS_DEPTH (extra_args
);
484 new_args
= make_tree_vec (TMPL_ARGS_DEPTH (args
) + extra_depth
);
486 for (i
= 1; i
<= TMPL_ARGS_DEPTH (args
); ++i
)
487 SET_TMPL_ARGS_LEVEL (new_args
, i
, TMPL_ARGS_LEVEL (args
, i
));
489 for (j
= 1; j
<= extra_depth
; ++j
, ++i
)
490 SET_TMPL_ARGS_LEVEL (new_args
, i
, TMPL_ARGS_LEVEL (extra_args
, j
));
495 /* Like add_to_template_args, but only the outermost ARGS are added to
496 the EXTRA_ARGS. In particular, all but TMPL_ARGS_DEPTH
497 (EXTRA_ARGS) levels are added. This function is used to combine
498 the template arguments from a partial instantiation with the
499 template arguments used to attain the full instantiation from the
500 partial instantiation. */
503 add_outermost_template_args (args
, extra_args
)
509 /* If there are more levels of EXTRA_ARGS than there are ARGS,
510 something very fishy is going on. */
511 my_friendly_assert (TMPL_ARGS_DEPTH (args
) >= TMPL_ARGS_DEPTH (extra_args
),
514 /* If *all* the new arguments will be the EXTRA_ARGS, just return
516 if (TMPL_ARGS_DEPTH (args
) == TMPL_ARGS_DEPTH (extra_args
))
519 /* For the moment, we make ARGS look like it contains fewer levels. */
520 TREE_VEC_LENGTH (args
) -= TMPL_ARGS_DEPTH (extra_args
);
522 new_args
= add_to_template_args (args
, extra_args
);
524 /* Now, we restore ARGS to its full dimensions. */
525 TREE_VEC_LENGTH (args
) += TMPL_ARGS_DEPTH (extra_args
);
530 /* We've got a template header coming up; push to a new level for storing
534 begin_template_parm_list ()
536 /* We use a non-tag-transparent scope here, which causes pushtag to
537 put tags in this scope, rather than in the enclosing class or
538 namespace scope. This is the right thing, since we want
539 TEMPLATE_DECLS, and not TYPE_DECLS for template classes. For a
540 global template class, push_template_decl handles putting the
541 TEMPLATE_DECL into top-level scope. For a nested template class,
544 template <class T> struct S1 {
545 template <class T> struct S2 {};
548 pushtag contains special code to call pushdecl_with_scope on the
549 TEMPLATE_DECL for S2. */
551 declare_pseudo_global_level ();
552 ++processing_template_decl
;
553 ++processing_template_parmlist
;
554 note_template_header (0);
557 /* This routine is called when a specialization is declared. If it is
558 illegal to declare a specialization here, an error is reported. */
561 check_specialization_scope ()
563 tree scope
= current_scope ();
567 An explicit specialization shall be declared in the namespace of
568 which the template is a member, or, for member templates, in the
569 namespace of which the enclosing class or enclosing class
570 template is a member. An explicit specialization of a member
571 function, member class or static data member of a class template
572 shall be declared in the namespace of which the class template
574 if (scope
&& TREE_CODE (scope
) != NAMESPACE_DECL
)
575 cp_error ("explicit specialization in non-namespace scope `%D'",
580 In an explicit specialization declaration for a member of a class
581 template or a member template that appears in namespace scope,
582 the member template and some of its enclosing class templates may
583 remain unspecialized, except that the declaration shall not
584 explicitly specialize a class member template if its enclosing
585 class templates are not explicitly specialized as well. */
586 if (current_template_parms
)
587 cp_error ("enclosing class templates are not explicitly specialized");
590 /* We've just seen template <>. */
593 begin_specialization ()
595 note_template_header (1);
596 check_specialization_scope ();
599 /* Called at then end of processing a declaration preceeded by
603 end_specialization ()
605 reset_specialization ();
608 /* Any template <>'s that we have seen thus far are not referring to a
609 function specialization. */
612 reset_specialization ()
614 processing_specialization
= 0;
615 template_header_count
= 0;
618 /* We've just seen a template header. If SPECIALIZATION is non-zero,
619 it was of the form template <>. */
622 note_template_header (specialization
)
625 processing_specialization
= specialization
;
626 template_header_count
++;
629 /* We're beginning an explicit instantiation. */
632 begin_explicit_instantiation ()
634 ++processing_explicit_instantiation
;
639 end_explicit_instantiation ()
641 my_friendly_assert(processing_explicit_instantiation
> 0, 0);
642 --processing_explicit_instantiation
;
645 /* The TYPE is being declared. If it is a template type, that means it
646 is a partial specialization. Do appropriate error-checking. */
649 maybe_process_partial_specialization (type
)
652 if (IS_AGGR_TYPE (type
) && CLASSTYPE_USE_TEMPLATE (type
))
654 if (CLASSTYPE_IMPLICIT_INSTANTIATION (type
)
655 && TYPE_SIZE (type
) == NULL_TREE
)
657 if (current_namespace
658 != decl_namespace_context (CLASSTYPE_TI_TEMPLATE (type
)))
660 cp_pedwarn ("specializing `%#T' in different namespace", type
);
661 cp_pedwarn_at (" from definition of `%#D'",
662 CLASSTYPE_TI_TEMPLATE (type
));
664 SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (type
);
665 if (processing_template_decl
)
666 push_template_decl (TYPE_MAIN_DECL (type
));
668 else if (CLASSTYPE_TEMPLATE_INSTANTIATION (type
))
669 cp_error ("specialization of `%T' after instantiation", type
);
671 else if (processing_specialization
)
672 cp_error ("explicit specialization of non-template `%T'", type
);
675 /* Retrieve the specialization (in the sense of [temp.spec] - a
676 specialization is either an instantiation or an explicit
677 specialization) of TMPL for the given template ARGS. If there is
678 no such specialization, return NULL_TREE. The ARGS are a vector of
679 arguments, or a vector of vectors of arguments, in the case of
680 templates with more than one level of parameters. */
683 retrieve_specialization (tmpl
, args
)
689 my_friendly_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
, 0);
691 /* There should be as many levels of arguments as there are
692 levels of parameters. */
693 my_friendly_assert (TMPL_ARGS_DEPTH (args
)
694 == TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
)),
697 for (s
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
700 if (comp_template_args (TREE_PURPOSE (s
), args
))
701 return TREE_VALUE (s
);
706 /* Like retrieve_speciailization, but for local declarations. FN is
707 the function in which we are looking for an instantiation. */
710 retrieve_local_specialization (tmpl
, fn
)
714 tree s
= purpose_member (fn
, DECL_TEMPLATE_SPECIALIZATIONS (tmpl
));
715 return s
? TREE_VALUE (s
) : NULL_TREE
;
718 /* Returns non-zero iff DECL is a specialization of TMPL. */
721 is_specialization_of (decl
, tmpl
)
727 if (TREE_CODE (decl
) == FUNCTION_DECL
)
731 t
= DECL_TEMPLATE_INFO (t
) ? DECL_TI_TEMPLATE (t
) : NULL_TREE
)
737 my_friendly_assert (TREE_CODE (decl
) == TYPE_DECL
, 0);
739 for (t
= TREE_TYPE (decl
);
741 t
= CLASSTYPE_USE_TEMPLATE (t
)
742 ? TREE_TYPE (CLASSTYPE_TI_TEMPLATE (t
)) : NULL_TREE
)
743 if (same_type_p (TYPE_MAIN_VARIANT (t
),
744 TYPE_MAIN_VARIANT (TREE_TYPE (tmpl
))))
751 /* Register the specialization SPEC as a specialization of TMPL with
752 the indicated ARGS. Returns SPEC, or an equivalent prior
753 declaration, if available. */
756 register_specialization (spec
, tmpl
, args
)
763 my_friendly_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
, 0);
765 if (TREE_CODE (spec
) == FUNCTION_DECL
766 && uses_template_parms (DECL_TI_ARGS (spec
)))
767 /* This is the FUNCTION_DECL for a partial instantiation. Don't
768 register it; we want the corresponding TEMPLATE_DECL instead.
769 We use `uses_template_parms (DECL_TI_ARGS (spec))' rather than
770 the more obvious `uses_template_parms (spec)' to avoid problems
771 with default function arguments. In particular, given
774 template <class T> void f(T t1, T t = T())
776 the default argument expression is not substituted for in an
777 instantiation unless and until it is actually needed. */
780 /* There should be as many levels of arguments as there are
781 levels of parameters. */
782 my_friendly_assert (TMPL_ARGS_DEPTH (args
)
783 == TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
)),
786 for (s
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
790 tree fn
= TREE_VALUE (s
);
792 /* We can sometimes try to re-register a specialization that we've
793 already got. In particular, regenerate_decl_from_template
794 calls duplicate_decls which will update the specialization
795 list. But, we'll still get called again here anyhow. It's
796 more convenient to simply allow this than to try to prevent it. */
799 else if (comp_template_args (TREE_PURPOSE (s
), args
))
801 if (DECL_TEMPLATE_SPECIALIZATION (spec
))
803 if (DECL_TEMPLATE_INSTANTIATION (fn
))
806 || DECL_EXPLICIT_INSTANTIATION (fn
))
808 cp_error ("specialization of %D after instantiation",
814 /* This situation should occur only if the first
815 specialization is an implicit instantiation,
816 the second is an explicit specialization, and
817 the implicit instantiation has not yet been
818 used. That situation can occur if we have
819 implicitly instantiated a member function and
820 then specialized it later.
822 We can also wind up here if a friend
823 declaration that looked like an instantiation
824 turns out to be a specialization:
826 template <class T> void foo(T);
827 class S { friend void foo<>(int) };
828 template <> void foo(int);
830 We transform the existing DECL in place so that
831 any pointers to it become pointers to the
834 If there was a definition for the template, but
835 not for the specialization, we want this to
836 look as if there is no definition, and vice
838 DECL_INITIAL (fn
) = NULL_TREE
;
839 duplicate_decls (spec
, fn
);
844 else if (DECL_TEMPLATE_SPECIALIZATION (fn
))
846 duplicate_decls (spec
, fn
);
853 DECL_TEMPLATE_SPECIALIZATIONS (tmpl
)
854 = tree_cons (args
, spec
, DECL_TEMPLATE_SPECIALIZATIONS (tmpl
));
859 /* Unregister the specialization SPEC as a specialization of TMPL.
860 Returns nonzero if the SPEC was listed as a specialization of
864 unregister_specialization (spec
, tmpl
)
870 for (s
= &DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
872 s
= &TREE_CHAIN (*s
))
873 if (TREE_VALUE (*s
) == spec
)
875 *s
= TREE_CHAIN (*s
);
882 /* Like register_specialization, but for local declarations. FN is
883 the function in which we are registering SPEC, an instantiation of
887 register_local_specialization (spec
, tmpl
, fn
)
892 DECL_TEMPLATE_SPECIALIZATIONS (tmpl
)
893 = tree_cons (fn
, spec
, DECL_TEMPLATE_SPECIALIZATIONS (tmpl
));
898 /* Print the list of candidate FNS in an error message. */
901 print_candidates (fns
)
906 const char *str
= "candidates are:";
908 for (fn
= fns
; fn
!= NULL_TREE
; fn
= TREE_CHAIN (fn
))
912 for (f
= TREE_VALUE (fn
); f
; f
= OVL_NEXT (f
))
913 cp_error_at ("%s %+#D", str
, OVL_CURRENT (f
));
918 /* Returns the template (one of the functions given by TEMPLATE_ID)
919 which can be specialized to match the indicated DECL with the
920 explicit template args given in TEMPLATE_ID. The DECL may be
921 NULL_TREE if none is available. In that case, the functions in
922 TEMPLATE_ID are non-members.
924 If NEED_MEMBER_TEMPLATE is non-zero the function is known to be a
925 specialization of a member template.
927 The template args (those explicitly specified and those deduced)
928 are output in a newly created vector *TARGS_OUT.
930 If it is impossible to determine the result, an error message is
931 issued. The error_mark_node is returned to indicate failure. */
934 determine_specialization (template_id
, decl
, targs_out
,
935 need_member_template
)
939 int need_member_template
;
944 tree candidates
= NULL_TREE
;
945 tree templates
= NULL_TREE
;
947 *targs_out
= NULL_TREE
;
949 if (template_id
== error_mark_node
)
950 return error_mark_node
;
952 fns
= TREE_OPERAND (template_id
, 0);
953 explicit_targs
= TREE_OPERAND (template_id
, 1);
955 if (fns
== error_mark_node
)
956 return error_mark_node
;
958 /* Check for baselinks. */
959 if (BASELINK_P (fns
))
960 fns
= TREE_VALUE (fns
);
962 if (!is_overloaded_fn (fns
))
964 cp_error ("`%D' is not a function template", fns
);
965 return error_mark_node
;
968 for (; fns
; fns
= OVL_NEXT (fns
))
972 tree fn
= OVL_CURRENT (fns
);
974 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
975 /* DECL might be a specialization of FN. */
977 else if (need_member_template
)
978 /* FN is an ordinary member function, and we need a
979 specialization of a member template. */
981 else if (TREE_CODE (fn
) != FUNCTION_DECL
)
982 /* We can get IDENTIFIER_NODEs here in certain erroneous
985 else if (!DECL_FUNCTION_MEMBER_P (fn
))
986 /* This is just an ordinary non-member function. Nothing can
987 be a specialization of that. */
993 /* This is an ordinary member function. However, since
994 we're here, we can assume it's enclosing class is a
995 template class. For example,
997 template <typename T> struct S { void f(); };
998 template <> void S<int>::f() {}
1000 Here, S<int>::f is a non-template, but S<int> is a
1001 template class. If FN has the same type as DECL, we
1002 might be in business. */
1003 if (!same_type_p (TREE_TYPE (TREE_TYPE (decl
)),
1004 TREE_TYPE (TREE_TYPE (fn
))))
1005 /* The return types differ. */
1008 /* Adjust the type of DECL in case FN is a static member. */
1009 decl_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
1010 if (DECL_STATIC_FUNCTION_P (fn
)
1011 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
1012 decl_arg_types
= TREE_CHAIN (decl_arg_types
);
1014 if (compparms (TYPE_ARG_TYPES (TREE_TYPE (fn
)),
1017 candidates
= tree_cons (NULL_TREE
, fn
, candidates
);
1022 /* See whether this function might be a specialization of this
1024 targs
= get_bindings (tmpl
, decl
, explicit_targs
);
1027 /* We cannot deduce template arguments that when used to
1028 specialize TMPL will produce DECL. */
1031 /* Save this template, and the arguments deduced. */
1032 templates
= tree_cons (targs
, tmpl
, templates
);
1035 if (templates
&& TREE_CHAIN (templates
))
1041 It is possible for a specialization with a given function
1042 signature to be instantiated from more than one function
1043 template. In such cases, explicit specification of the
1044 template arguments must be used to uniquely identify the
1045 function template specialization being specialized.
1047 Note that here, there's no suggestion that we're supposed to
1048 determine which of the candidate templates is most
1049 specialized. However, we, also have:
1053 Partial ordering of overloaded function template
1054 declarations is used in the following contexts to select
1055 the function template to which a function template
1056 specialization refers:
1058 -- when an explicit specialization refers to a function
1061 So, we do use the partial ordering rules, at least for now.
1062 This extension can only serve to make illegal programs legal,
1063 so it's safe. And, there is strong anecdotal evidence that
1064 the committee intended the partial ordering rules to apply;
1065 the EDG front-end has that behavior, and John Spicer claims
1066 that the committee simply forgot to delete the wording in
1067 [temp.expl.spec]. */
1068 tree tmpl
= most_specialized (templates
, decl
, explicit_targs
);
1069 if (tmpl
&& tmpl
!= error_mark_node
)
1071 targs
= get_bindings (tmpl
, decl
, explicit_targs
);
1072 templates
= tree_cons (targs
, tmpl
, NULL_TREE
);
1076 if (templates
== NULL_TREE
&& candidates
== NULL_TREE
)
1078 cp_error_at ("template-id `%D' for `%+D' does not match any template declaration",
1080 return error_mark_node
;
1082 else if ((templates
&& TREE_CHAIN (templates
))
1083 || (candidates
&& TREE_CHAIN (candidates
))
1084 || (templates
&& candidates
))
1086 cp_error_at ("ambiguous template specialization `%D' for `%+D'",
1088 chainon (candidates
, templates
);
1089 print_candidates (candidates
);
1090 return error_mark_node
;
1093 /* We have one, and exactly one, match. */
1096 /* It was a specialization of an ordinary member function in a
1098 *targs_out
= copy_node (DECL_TI_ARGS (TREE_VALUE (candidates
)));
1099 return DECL_TI_TEMPLATE (TREE_VALUE (candidates
));
1102 /* It was a specialization of a template. */
1103 targs
= DECL_TI_ARGS (DECL_RESULT (TREE_VALUE (templates
)));
1104 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (targs
))
1106 *targs_out
= copy_node (targs
);
1107 SET_TMPL_ARGS_LEVEL (*targs_out
,
1108 TMPL_ARGS_DEPTH (*targs_out
),
1109 TREE_PURPOSE (templates
));
1112 *targs_out
= TREE_PURPOSE (templates
);
1113 return TREE_VALUE (templates
);
1116 /* Check to see if the function just declared, as indicated in
1117 DECLARATOR, and in DECL, is a specialization of a function
1118 template. We may also discover that the declaration is an explicit
1119 instantiation at this point.
1121 Returns DECL, or an equivalent declaration that should be used
1122 instead if all goes well. Issues an error message if something is
1123 amiss. Returns error_mark_node if the error is not easily
1126 FLAGS is a bitmask consisting of the following flags:
1128 2: The function has a definition.
1129 4: The function is a friend.
1131 The TEMPLATE_COUNT is the number of references to qualifying
1132 template classes that appeared in the name of the function. For
1135 template <class T> struct S { void f(); };
1138 the TEMPLATE_COUNT would be 1. However, explicitly specialized
1139 classes are not counted in the TEMPLATE_COUNT, so that in
1141 template <class T> struct S {};
1142 template <> struct S<int> { void f(); }
1143 template <> void S<int>::f();
1145 the TEMPLATE_COUNT would be 0. (Note that this declaration is
1146 illegal; there should be no template <>.)
1148 If the function is a specialization, it is marked as such via
1149 DECL_TEMPLATE_SPECIALIZATION. Furthermore, its DECL_TEMPLATE_INFO
1150 is set up correctly, and it is added to the list of specializations
1151 for that template. */
1154 check_explicit_specialization (declarator
, decl
, template_count
, flags
)
1160 int have_def
= flags
& 2;
1161 int is_friend
= flags
& 4;
1162 int specialization
= 0;
1163 int explicit_instantiation
= 0;
1164 int member_specialization
= 0;
1166 tree ctype
= DECL_CLASS_CONTEXT (decl
);
1167 tree dname
= DECL_NAME (decl
);
1169 if (processing_specialization
)
1171 /* The last template header was of the form template <>. */
1173 if (template_header_count
> template_count
)
1175 /* There were more template headers than qualifying template
1177 if (template_header_count
- template_count
> 1)
1178 /* There shouldn't be that many template parameter lists.
1179 There can be at most one parameter list for every
1180 qualifying class, plus one for the function itself. */
1181 cp_error ("too many template parameter lists in declaration of `%D'", decl
);
1183 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
1185 member_specialization
= 1;
1189 else if (template_header_count
== template_count
)
1191 /* The counts are equal. So, this might be a
1192 specialization, but it is not a specialization of a
1193 member template. It might be something like
1195 template <class T> struct S {
1199 void S<int>::f(int i) {} */
1201 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
1205 /* This cannot be an explicit specialization. There are not
1206 enough headers for all of the qualifying classes. For
1207 example, we might have:
1210 void S<int>::T<char>::f();
1212 But, we're missing another template <>. */
1213 cp_error("too few template parameter lists in declaration of `%D'", decl
);
1217 else if (processing_explicit_instantiation
)
1219 if (template_header_count
)
1220 cp_error ("template parameter list used in explicit instantiation");
1223 cp_error ("definition provided for explicit instantiation");
1225 explicit_instantiation
= 1;
1227 else if (ctype
!= NULL_TREE
1228 && !TYPE_BEING_DEFINED (ctype
)
1229 && CLASSTYPE_TEMPLATE_INSTANTIATION (ctype
)
1232 /* This case catches outdated code that looks like this:
1234 template <class T> struct S { void f(); };
1235 void S<int>::f() {} // Missing template <>
1237 We disable this check when the type is being defined to
1238 avoid complaining about default compiler-generated
1239 constructors, destructors, and assignment operators.
1240 Since the type is an instantiation, not a specialization,
1241 these are the only functions that can be defined before
1242 the class is complete. */
1245 template <class T> void S<int>::f() {}
1247 if (template_header_count
)
1249 cp_error ("template parameters specified in specialization");
1255 ("explicit specialization not preceded by `template <>'");
1257 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
1259 else if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
1262 /* This could be something like:
1264 template <class T> void f(T);
1265 class S { friend void f<>(int); } */
1269 /* This case handles bogus declarations like template <>
1270 template <class T> void f<int>(); */
1272 cp_error ("template-id `%D' in declaration of primary template",
1278 if (specialization
|| member_specialization
)
1280 tree t
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
1281 for (; t
; t
= TREE_CHAIN (t
))
1282 if (TREE_PURPOSE (t
))
1285 ("default argument specified in explicit specialization");
1288 if (current_lang_name
== lang_name_c
)
1289 cp_error ("template specialization with C linkage");
1292 if (specialization
|| member_specialization
|| explicit_instantiation
)
1294 tree tmpl
= NULL_TREE
;
1295 tree targs
= NULL_TREE
;
1297 /* Make sure that the declarator is a TEMPLATE_ID_EXPR. */
1298 if (TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
1302 my_friendly_assert (TREE_CODE (declarator
) == IDENTIFIER_NODE
,
1305 fns
= IDENTIFIER_NAMESPACE_VALUE (dname
);
1310 lookup_template_function (fns
, NULL_TREE
);
1313 if (declarator
== error_mark_node
)
1314 return error_mark_node
;
1316 if (ctype
!= NULL_TREE
&& TYPE_BEING_DEFINED (ctype
))
1318 if (!explicit_instantiation
)
1319 /* A specialization in class scope. This is illegal,
1320 but the error will already have been flagged by
1321 check_specialization_scope. */
1322 return error_mark_node
;
1325 /* It's not legal to write an explicit instantiation in
1328 class C { template void f(); }
1330 This case is caught by the parser. However, on
1333 template class C { void f(); };
1335 (which is illegal) we can get here. The error will be
1342 else if (TREE_CODE (TREE_OPERAND (declarator
, 0)) == LOOKUP_EXPR
)
1344 /* A friend declaration. We can't do much, because we don't
1345 know what this resolves to, yet. */
1346 my_friendly_assert (is_friend
!= 0, 0);
1347 my_friendly_assert (!explicit_instantiation
, 0);
1348 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
1351 else if (ctype
!= NULL_TREE
1352 && (TREE_CODE (TREE_OPERAND (declarator
, 0)) ==
1355 /* Find the list of functions in ctype that have the same
1356 name as the declared function. */
1357 tree name
= TREE_OPERAND (declarator
, 0);
1358 tree fns
= NULL_TREE
;
1361 if (name
== constructor_name (ctype
)
1362 || name
== constructor_name_full (ctype
))
1364 int is_constructor
= DECL_CONSTRUCTOR_P (decl
);
1366 if (is_constructor
? !TYPE_HAS_CONSTRUCTOR (ctype
)
1367 : !TYPE_HAS_DESTRUCTOR (ctype
))
1369 /* From [temp.expl.spec]:
1371 If such an explicit specialization for the member
1372 of a class template names an implicitly-declared
1373 special member function (clause _special_), the
1374 program is ill-formed.
1376 Similar language is found in [temp.explicit]. */
1377 cp_error ("specialization of implicitly-declared special member function");
1378 return error_mark_node
;
1381 name
= is_constructor
? ctor_identifier
: dtor_identifier
;
1384 if (!IDENTIFIER_TYPENAME_P (name
))
1386 idx
= lookup_fnfields_1 (ctype
, name
);
1388 fns
= TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (ctype
), idx
);
1394 /* For a type-conversion operator, we cannot do a
1395 name-based lookup. We might be looking for `operator
1396 int' which will be a specialization of `operator T'.
1397 So, we find *all* the conversion operators, and then
1398 select from them. */
1401 methods
= CLASSTYPE_METHOD_VEC (ctype
);
1403 for (idx
= 2; idx
< TREE_VEC_LENGTH (methods
); ++idx
)
1405 tree ovl
= TREE_VEC_ELT (methods
, idx
);
1407 if (!ovl
|| !DECL_CONV_FN_P (OVL_CURRENT (ovl
)))
1408 /* There are no more conversion functions. */
1411 /* Glue all these conversion functions together
1412 with those we already have. */
1413 for (; ovl
; ovl
= OVL_NEXT (ovl
))
1414 fns
= ovl_cons (OVL_CURRENT (ovl
), fns
);
1418 if (fns
== NULL_TREE
)
1420 cp_error ("no member function `%D' declared in `%T'",
1422 return error_mark_node
;
1425 TREE_OPERAND (declarator
, 0) = fns
;
1428 /* Figure out what exactly is being specialized at this point.
1429 Note that for an explicit instantiation, even one for a
1430 member function, we cannot tell apriori whether the
1431 instantiation is for a member template, or just a member
1432 function of a template class. Even if a member template is
1433 being instantiated, the member template arguments may be
1434 elided if they can be deduced from the rest of the
1436 tmpl
= determine_specialization (declarator
, decl
,
1438 member_specialization
);
1440 if (!tmpl
|| tmpl
== error_mark_node
)
1441 /* We couldn't figure out what this declaration was
1443 return error_mark_node
;
1446 tree gen_tmpl
= most_general_template (tmpl
);
1448 if (explicit_instantiation
)
1450 /* We don't set DECL_EXPLICIT_INSTANTIATION here; that
1451 is done by do_decl_instantiation later. */
1453 int arg_depth
= TMPL_ARGS_DEPTH (targs
);
1454 int parm_depth
= TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
));
1456 if (arg_depth
> parm_depth
)
1458 /* If TMPL is not the most general template (for
1459 example, if TMPL is a friend template that is
1460 injected into namespace scope), then there will
1461 be too many levels fo TARGS. Remove some of them
1466 new_targs
= make_tree_vec (parm_depth
);
1467 for (i
= arg_depth
- parm_depth
; i
< arg_depth
; ++i
)
1468 TREE_VEC_ELT (new_targs
, i
- (arg_depth
- parm_depth
))
1469 = TREE_VEC_ELT (targs
, i
);
1473 decl
= instantiate_template (tmpl
, targs
);
1477 /* If we though that the DECL was a member function, but it
1478 turns out to be specializing a static member function,
1479 make DECL a static member function as well. */
1480 if (DECL_STATIC_FUNCTION_P (tmpl
)
1481 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
1483 revert_static_member_fn (&decl
, 0, 0);
1484 last_function_parms
= TREE_CHAIN (last_function_parms
);
1487 /* Set up the DECL_TEMPLATE_INFO for DECL. */
1488 DECL_TEMPLATE_INFO (decl
) = tree_cons (tmpl
, targs
, NULL_TREE
);
1490 /* Mangle the function name appropriately. Note that we do
1491 not mangle specializations of non-template member
1492 functions of template classes, e.g. with
1494 template <class T> struct S { void f(); }
1496 and given the specialization
1498 template <> void S<int>::f() {}
1500 we do not mangle S<int>::f() here. That's because it's
1501 just an ordinary member function and doesn't need special
1502 treatment. We do this here so that the ordinary,
1503 non-template, name-mangling algorith will not be used
1505 if ((is_member_template (tmpl
) || ctype
== NULL_TREE
)
1506 && name_mangling_version
>= 1)
1507 set_mangled_name_for_template_decl (decl
);
1509 if (is_friend
&& !have_def
)
1510 /* This is not really a declaration of a specialization.
1511 It's just the name of an instantiation. But, it's not
1512 a request for an instantiation, either. */
1513 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
1515 /* Register this specialization so that we can find it
1517 decl
= register_specialization (decl
, gen_tmpl
, targs
);
1524 /* TYPE is being declared. Verify that the use of template headers
1525 and such is reasonable. Issue error messages if not. */
1528 maybe_check_template_type (type
)
1531 if (template_header_count
)
1533 /* We are in the scope of some `template <...>' header. */
1536 = template_class_depth_real (TYPE_CONTEXT (type
),
1537 /*count_specializations=*/1);
1539 if (template_header_count
<= context_depth
)
1540 /* This is OK; the template headers are for the context. We
1541 are actually too lenient here; like
1542 check_explicit_specialization we should consider the number
1543 of template types included in the actual declaration. For
1546 template <class T> struct S {
1547 template <class U> template <class V>
1553 template <class T> struct S {
1554 template <class U> struct I;
1557 template <class T> template <class U.
1562 else if (template_header_count
> context_depth
+ 1)
1563 /* There are two many template parameter lists. */
1564 cp_error ("too many template parameter lists in declaration of `%T'", type
);
1568 /* Returns 1 iff PARMS1 and PARMS2 are identical sets of template
1569 parameters. These are represented in the same format used for
1570 DECL_TEMPLATE_PARMS. */
1572 int comp_template_parms (parms1
, parms2
)
1579 if (parms1
== parms2
)
1582 for (p1
= parms1
, p2
= parms2
;
1583 p1
!= NULL_TREE
&& p2
!= NULL_TREE
;
1584 p1
= TREE_CHAIN (p1
), p2
= TREE_CHAIN (p2
))
1586 tree t1
= TREE_VALUE (p1
);
1587 tree t2
= TREE_VALUE (p2
);
1590 my_friendly_assert (TREE_CODE (t1
) == TREE_VEC
, 0);
1591 my_friendly_assert (TREE_CODE (t2
) == TREE_VEC
, 0);
1593 if (TREE_VEC_LENGTH (t1
) != TREE_VEC_LENGTH (t2
))
1596 for (i
= 0; i
< TREE_VEC_LENGTH (t2
); ++i
)
1598 tree parm1
= TREE_VALUE (TREE_VEC_ELT (t1
, i
));
1599 tree parm2
= TREE_VALUE (TREE_VEC_ELT (t2
, i
));
1601 if (TREE_CODE (parm1
) != TREE_CODE (parm2
))
1604 if (TREE_CODE (parm1
) == TEMPLATE_TYPE_PARM
)
1606 else if (!same_type_p (TREE_TYPE (parm1
), TREE_TYPE (parm2
)))
1611 if ((p1
!= NULL_TREE
) != (p2
!= NULL_TREE
))
1612 /* One set of parameters has more parameters lists than the
1619 /* Complain if DECL shadows a template parameter.
1621 [temp.local]: A template-parameter shall not be redeclared within its
1622 scope (including nested scopes). */
1625 check_template_shadow (decl
)
1630 /* If we're not in a template, we can't possibly shadow a template
1632 if (!current_template_parms
)
1635 /* Figure out what we're shadowing. */
1636 if (TREE_CODE (decl
) == OVERLOAD
)
1637 decl
= OVL_CURRENT (decl
);
1638 olddecl
= IDENTIFIER_VALUE (DECL_NAME (decl
));
1640 /* If there's no previous binding for this name, we're not shadowing
1641 anything, let alone a template parameter. */
1645 /* If we're not shadowing a template parameter, we're done. Note
1646 that OLDDECL might be an OVERLOAD (or perhaps even an
1647 ERROR_MARK), so we can't just blithely assume it to be a _DECL
1649 if (TREE_CODE_CLASS (TREE_CODE (olddecl
)) != 'd'
1650 || !DECL_TEMPLATE_PARM_P (olddecl
))
1653 /* We check for decl != olddecl to avoid bogus errors for using a
1654 name inside a class. We check TPFI to avoid duplicate errors for
1655 inline member templates. */
1657 || TEMPLATE_PARMS_FOR_INLINE (current_template_parms
))
1660 cp_error_at ("declaration of `%#D'", decl
);
1661 cp_error_at (" shadows template parm `%#D'", olddecl
);
1664 /* Return a new TEMPLATE_PARM_INDEX with the indicated INDEX, LEVEL,
1665 ORIG_LEVEL, DECL, and TYPE. */
1668 build_template_parm_index (index
, level
, orig_level
, decl
, type
)
1675 tree t
= make_node (TEMPLATE_PARM_INDEX
);
1676 TEMPLATE_PARM_IDX (t
) = index
;
1677 TEMPLATE_PARM_LEVEL (t
) = level
;
1678 TEMPLATE_PARM_ORIG_LEVEL (t
) = orig_level
;
1679 TEMPLATE_PARM_DECL (t
) = decl
;
1680 TREE_TYPE (t
) = type
;
1685 /* Return a TEMPLATE_PARM_INDEX, similar to INDEX, but whose
1686 TEMPLATE_PARM_LEVEL has been decreased by LEVELS. If such a
1687 TEMPLATE_PARM_INDEX already exists, it is returned; otherwise, a
1688 new one is created. */
1691 reduce_template_parm_level (index
, type
, levels
)
1696 if (TEMPLATE_PARM_DESCENDANTS (index
) == NULL_TREE
1697 || (TEMPLATE_PARM_LEVEL (TEMPLATE_PARM_DESCENDANTS (index
))
1698 != TEMPLATE_PARM_LEVEL (index
) - levels
))
1701 = build_decl (TREE_CODE (TEMPLATE_PARM_DECL (index
)),
1702 DECL_NAME (TEMPLATE_PARM_DECL (index
)),
1705 = build_template_parm_index (TEMPLATE_PARM_IDX (index
),
1706 TEMPLATE_PARM_LEVEL (index
) - levels
,
1707 TEMPLATE_PARM_ORIG_LEVEL (index
),
1709 TEMPLATE_PARM_DESCENDANTS (index
) = t
;
1711 /* Template template parameters need this. */
1712 DECL_TEMPLATE_PARMS (decl
)
1713 = DECL_TEMPLATE_PARMS (TEMPLATE_PARM_DECL (index
));
1716 return TEMPLATE_PARM_DESCENDANTS (index
);
1719 /* Process information from new template parameter NEXT and append it to the
1720 LIST being built. */
1723 process_template_parm (list
, next
)
1732 my_friendly_assert (TREE_CODE (parm
) == TREE_LIST
, 259);
1733 defval
= TREE_PURPOSE (parm
);
1734 parm
= TREE_VALUE (parm
);
1735 is_type
= TREE_PURPOSE (parm
) == class_type_node
;
1739 tree p
= TREE_VALUE (tree_last (list
));
1741 if (TREE_CODE (p
) == TYPE_DECL
)
1742 idx
= TEMPLATE_TYPE_IDX (TREE_TYPE (p
));
1743 else if (TREE_CODE (p
) == TEMPLATE_DECL
)
1744 idx
= TEMPLATE_TYPE_IDX (TREE_TYPE (DECL_TEMPLATE_RESULT (p
)));
1746 idx
= TEMPLATE_PARM_IDX (DECL_INITIAL (p
));
1754 my_friendly_assert (TREE_CODE (TREE_PURPOSE (parm
)) == TREE_LIST
, 260);
1755 /* is a const-param */
1756 parm
= grokdeclarator (TREE_VALUE (parm
), TREE_PURPOSE (parm
),
1757 PARM
, 0, NULL_TREE
);
1761 The top-level cv-qualifiers on the template-parameter are
1762 ignored when determining its type. */
1763 TREE_TYPE (parm
) = TYPE_MAIN_VARIANT (TREE_TYPE (parm
));
1765 /* A template parameter is not modifiable. */
1766 TREE_READONLY (parm
) = 1;
1767 if (IS_AGGR_TYPE (TREE_TYPE (parm
))
1768 && TREE_CODE (TREE_TYPE (parm
)) != TEMPLATE_TYPE_PARM
1769 && TREE_CODE (TREE_TYPE (parm
)) != TYPENAME_TYPE
)
1771 cp_error ("`%#T' is not a valid type for a template constant parameter",
1773 if (DECL_NAME (parm
) == NULL_TREE
)
1774 error (" a template type parameter must begin with `class' or `typename'");
1775 TREE_TYPE (parm
) = void_type_node
;
1778 && (TREE_CODE (TREE_TYPE (parm
)) == REAL_TYPE
1779 || TREE_CODE (TREE_TYPE (parm
)) == COMPLEX_TYPE
))
1780 cp_pedwarn ("`%T' is not a valid type for a template constant parameter",
1782 decl
= build_decl (CONST_DECL
, DECL_NAME (parm
), TREE_TYPE (parm
));
1783 DECL_INITIAL (parm
) = DECL_INITIAL (decl
)
1784 = build_template_parm_index (idx
, processing_template_decl
,
1785 processing_template_decl
,
1786 decl
, TREE_TYPE (parm
));
1791 parm
= TREE_VALUE (parm
);
1793 if (parm
&& TREE_CODE (parm
) == TEMPLATE_DECL
)
1795 t
= make_lang_type (TEMPLATE_TEMPLATE_PARM
);
1796 /* This is for distinguishing between real templates and template
1797 template parameters */
1798 TREE_TYPE (parm
) = t
;
1799 TREE_TYPE (DECL_TEMPLATE_RESULT (parm
)) = t
;
1804 t
= make_lang_type (TEMPLATE_TYPE_PARM
);
1805 /* parm is either IDENTIFIER_NODE or NULL_TREE */
1806 decl
= build_decl (TYPE_DECL
, parm
, t
);
1809 TYPE_NAME (t
) = decl
;
1810 TYPE_STUB_DECL (t
) = decl
;
1812 TEMPLATE_TYPE_PARM_INDEX (t
)
1813 = build_template_parm_index (idx
, processing_template_decl
,
1814 processing_template_decl
,
1815 decl
, TREE_TYPE (parm
));
1817 SET_DECL_ARTIFICIAL (decl
);
1818 DECL_TEMPLATE_PARM_P (decl
) = 1;
1820 parm
= build_tree_list (defval
, parm
);
1821 return chainon (list
, parm
);
1824 /* The end of a template parameter list has been reached. Process the
1825 tree list into a parameter vector, converting each parameter into a more
1826 useful form. Type parameters are saved as IDENTIFIER_NODEs, and others
1830 end_template_parm_list (parms
)
1835 tree saved_parmlist
= make_tree_vec (list_length (parms
));
1837 current_template_parms
1838 = tree_cons (build_int_2 (0, processing_template_decl
),
1839 saved_parmlist
, current_template_parms
);
1841 for (parm
= parms
, nparms
= 0;
1843 parm
= TREE_CHAIN (parm
), nparms
++)
1844 TREE_VEC_ELT (saved_parmlist
, nparms
) = parm
;
1846 --processing_template_parmlist
;
1848 return saved_parmlist
;
1851 /* end_template_decl is called after a template declaration is seen. */
1854 end_template_decl ()
1856 reset_specialization ();
1858 if (! processing_template_decl
)
1861 /* This matches the pushlevel in begin_template_parm_list. */
1864 --processing_template_decl
;
1865 current_template_parms
= TREE_CHAIN (current_template_parms
);
1866 (void) get_pending_sizes (); /* Why? */
1869 /* Given a template argument vector containing the template PARMS.
1870 The innermost PARMS are given first. */
1873 current_template_args ()
1876 tree args
= NULL_TREE
;
1877 int length
= TMPL_PARMS_DEPTH (current_template_parms
);
1880 /* If there is only one level of template parameters, we do not
1881 create a TREE_VEC of TREE_VECs. Instead, we return a single
1882 TREE_VEC containing the arguments. */
1884 args
= make_tree_vec (length
);
1886 for (header
= current_template_parms
; header
; header
= TREE_CHAIN (header
))
1888 tree a
= copy_node (TREE_VALUE (header
));
1891 TREE_TYPE (a
) = NULL_TREE
;
1892 for (i
= TREE_VEC_LENGTH (a
) - 1; i
>= 0; --i
)
1894 tree t
= TREE_VEC_ELT (a
, i
);
1896 /* T will be a list if we are called from within a
1897 begin/end_template_parm_list pair, but a vector directly
1898 if within a begin/end_member_template_processing pair. */
1899 if (TREE_CODE (t
) == TREE_LIST
)
1903 if (TREE_CODE (t
) == TYPE_DECL
1904 || TREE_CODE (t
) == TEMPLATE_DECL
)
1907 t
= DECL_INITIAL (t
);
1908 TREE_VEC_ELT (a
, i
) = t
;
1913 TREE_VEC_ELT (args
, --l
) = a
;
1921 /* Return a TEMPLATE_DECL corresponding to DECL, using the indicated
1922 template PARMS. Used by push_template_decl below. */
1925 build_template_decl (decl
, parms
)
1929 tree tmpl
= build_lang_decl (TEMPLATE_DECL
, DECL_NAME (decl
), NULL_TREE
);
1930 DECL_TEMPLATE_PARMS (tmpl
) = parms
;
1931 DECL_CONTEXT (tmpl
) = DECL_CONTEXT (decl
);
1932 if (DECL_LANG_SPECIFIC (decl
))
1934 DECL_CLASS_CONTEXT (tmpl
) = DECL_CLASS_CONTEXT (decl
);
1935 DECL_STATIC_FUNCTION_P (tmpl
) = DECL_STATIC_FUNCTION_P (decl
);
1936 DECL_CONSTRUCTOR_P (tmpl
) = DECL_CONSTRUCTOR_P (decl
);
1937 DECL_NONCONVERTING_P (tmpl
) = DECL_NONCONVERTING_P (decl
);
1943 struct template_parm_data
1945 /* The level of the template parameters we are currently
1949 /* The index of the specialization argument we are currently
1953 /* An array whose size is the number of template parameters. The
1954 elements are non-zero if the parameter has been used in any one
1955 of the arguments processed so far. */
1958 /* An array whose size is the number of template arguments. The
1959 elements are non-zero if the argument makes use of template
1960 parameters of this level. */
1961 int* arg_uses_template_parms
;
1964 /* Subroutine of push_template_decl used to see if each template
1965 parameter in a partial specialization is used in the explicit
1966 argument list. If T is of the LEVEL given in DATA (which is
1967 treated as a template_parm_data*), then DATA->PARMS is marked
1971 mark_template_parm (t
, data
)
1977 struct template_parm_data
* tpd
= (struct template_parm_data
*) data
;
1979 if (TREE_CODE (t
) == TEMPLATE_PARM_INDEX
)
1981 level
= TEMPLATE_PARM_LEVEL (t
);
1982 idx
= TEMPLATE_PARM_IDX (t
);
1986 level
= TEMPLATE_TYPE_LEVEL (t
);
1987 idx
= TEMPLATE_TYPE_IDX (t
);
1990 if (level
== tpd
->level
)
1992 tpd
->parms
[idx
] = 1;
1993 tpd
->arg_uses_template_parms
[tpd
->current_arg
] = 1;
1996 /* Return zero so that for_each_template_parm will continue the
1997 traversal of the tree; we want to mark *every* template parm. */
2001 /* Process the partial specialization DECL. */
2004 process_partial_specialization (decl
)
2007 tree type
= TREE_TYPE (decl
);
2008 tree maintmpl
= CLASSTYPE_TI_TEMPLATE (type
);
2009 tree specargs
= CLASSTYPE_TI_ARGS (type
);
2010 tree inner_args
= innermost_args (specargs
);
2011 tree inner_parms
= INNERMOST_TEMPLATE_PARMS (current_template_parms
);
2012 tree main_inner_parms
= DECL_INNERMOST_TEMPLATE_PARMS (maintmpl
);
2013 int nargs
= TREE_VEC_LENGTH (inner_args
);
2014 int ntparms
= TREE_VEC_LENGTH (inner_parms
);
2016 int did_error_intro
= 0;
2017 struct template_parm_data tpd
;
2018 struct template_parm_data tpd2
;
2020 /* We check that each of the template parameters given in the
2021 partial specialization is used in the argument list to the
2022 specialization. For example:
2024 template <class T> struct S;
2025 template <class T> struct S<T*>;
2027 The second declaration is OK because `T*' uses the template
2028 parameter T, whereas
2030 template <class T> struct S<int>;
2032 is no good. Even trickier is:
2043 The S2<T> declaration is actually illegal; it is a
2044 full-specialization. Of course,
2047 struct S2<T (*)(U)>;
2049 or some such would have been OK. */
2050 tpd
.level
= TMPL_PARMS_DEPTH (current_template_parms
);
2051 tpd
.parms
= alloca (sizeof (int) * ntparms
);
2052 bzero ((PTR
) tpd
.parms
, sizeof (int) * ntparms
);
2054 tpd
.arg_uses_template_parms
= alloca (sizeof (int) * nargs
);
2055 bzero ((PTR
) tpd
.arg_uses_template_parms
, sizeof (int) * nargs
);
2056 for (i
= 0; i
< nargs
; ++i
)
2058 tpd
.current_arg
= i
;
2059 for_each_template_parm (TREE_VEC_ELT (inner_args
, i
),
2060 &mark_template_parm
,
2063 for (i
= 0; i
< ntparms
; ++i
)
2064 if (tpd
.parms
[i
] == 0)
2066 /* One of the template parms was not used in the
2068 if (!did_error_intro
)
2070 cp_error ("template parameters not used in partial specialization:");
2071 did_error_intro
= 1;
2075 TREE_VALUE (TREE_VEC_ELT (inner_parms
, i
)));
2078 /* [temp.class.spec]
2080 The argument list of the specialization shall not be identical to
2081 the implicit argument list of the primary template. */
2082 if (comp_template_args (inner_args
,
2083 innermost_args (CLASSTYPE_TI_ARGS (TREE_TYPE
2085 cp_error ("partial specialization `%T' does not specialize any template arguments", type
);
2087 /* [temp.class.spec]
2089 A partially specialized non-type argument expression shall not
2090 involve template parameters of the partial specialization except
2091 when the argument expression is a simple identifier.
2093 The type of a template parameter corresponding to a specialized
2094 non-type argument shall not be dependent on a parameter of the
2096 my_friendly_assert (nargs
== DECL_NTPARMS (maintmpl
), 0);
2098 for (i
= 0; i
< nargs
; ++i
)
2100 tree arg
= TREE_VEC_ELT (inner_args
, i
);
2101 if (/* These first two lines are the `non-type' bit. */
2102 TREE_CODE_CLASS (TREE_CODE (arg
)) != 't'
2103 && TREE_CODE (arg
) != TEMPLATE_DECL
2104 /* This next line is the `argument expression is not just a
2105 simple identifier' condition and also the `specialized
2106 non-type argument' bit. */
2107 && TREE_CODE (arg
) != TEMPLATE_PARM_INDEX
)
2109 if (tpd
.arg_uses_template_parms
[i
])
2110 cp_error ("template argument `%E' involves template parameter(s)", arg
);
2113 /* Look at the corresponding template parameter,
2114 marking which template parameters its type depends
2117 TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (main_inner_parms
,
2122 /* We haven't yet initialized TPD2. Do so now. */
2123 tpd2
.arg_uses_template_parms
2124 = (int*) alloca (sizeof (int) * nargs
);
2125 /* The number of parameters here is the number in the
2126 main template, which, as checked in the assertion
2128 tpd2
.parms
= (int*) alloca (sizeof (int) * nargs
);
2130 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (maintmpl
));
2133 /* Mark the template parameters. But this time, we're
2134 looking for the template parameters of the main
2135 template, not in the specialization. */
2136 tpd2
.current_arg
= i
;
2137 tpd2
.arg_uses_template_parms
[i
] = 0;
2138 bzero ((PTR
) tpd2
.parms
, sizeof (int) * nargs
);
2139 for_each_template_parm (type
,
2140 &mark_template_parm
,
2143 if (tpd2
.arg_uses_template_parms
[i
])
2145 /* The type depended on some template parameters.
2146 If they are fully specialized in the
2147 specialization, that's OK. */
2149 for (j
= 0; j
< nargs
; ++j
)
2150 if (tpd2
.parms
[j
] != 0
2151 && tpd
.arg_uses_template_parms
[j
])
2153 cp_error ("type `%T' of template argument `%E' depends on template parameter(s)",
2163 if (retrieve_specialization (maintmpl
, specargs
))
2164 /* We've already got this specialization. */
2167 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
) = CLASSTYPE_TI_SPEC_INFO (type
)
2168 = tree_cons (inner_args
, inner_parms
,
2169 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
));
2170 TREE_TYPE (DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)) = type
;
2174 /* Check that a template declaration's use of default arguments is not
2175 invalid. Here, PARMS are the template parameters. IS_PRIMARY is
2176 non-zero if DECL is the thing declared by a primary template.
2177 IS_PARTIAL is non-zero if DECL is a partial specialization. */
2180 check_default_tmpl_args (decl
, parms
, is_primary
, is_partial
)
2187 int last_level_to_check
;
2192 A default template-argument shall not be specified in a
2193 function template declaration or a function template definition, nor
2194 in the template-parameter-list of the definition of a member of a
2197 if (TREE_CODE (DECL_REAL_CONTEXT (decl
)) == FUNCTION_DECL
)
2198 /* You can't have a function template declaration in a local
2199 scope, nor you can you define a member of a class template in a
2203 if (current_class_type
2204 && !TYPE_BEING_DEFINED (current_class_type
)
2205 && DECL_LANG_SPECIFIC (decl
)
2206 /* If this is either a friend defined in the scope of the class
2207 or a member function. */
2208 && DECL_CLASS_CONTEXT (decl
) == current_class_type
2209 /* And, if it was a member function, it really was defined in
2210 the scope of the class. */
2211 && (!DECL_FUNCTION_MEMBER_P (decl
) || DECL_DEFINED_IN_CLASS_P (decl
)))
2212 /* We already checked these parameters when the template was
2213 declared, so there's no need to do it again now. This function
2214 was defined in class scope, but we're processing it's body now
2215 that the class is complete. */
2220 If a template-parameter has a default template-argument, all
2221 subsequent template-parameters shall have a default
2222 template-argument supplied. */
2223 for (parm_level
= parms
; parm_level
; parm_level
= TREE_CHAIN (parm_level
))
2225 tree inner_parms
= TREE_VALUE (parm_level
);
2226 int ntparms
= TREE_VEC_LENGTH (inner_parms
);
2227 int seen_def_arg_p
= 0;
2230 for (i
= 0; i
< ntparms
; ++i
)
2232 tree parm
= TREE_VEC_ELT (inner_parms
, i
);
2233 if (TREE_PURPOSE (parm
))
2235 else if (seen_def_arg_p
)
2237 cp_error ("no default argument for `%D'", TREE_VALUE (parm
));
2238 /* For better subsequent error-recovery, we indicate that
2239 there should have been a default argument. */
2240 TREE_PURPOSE (parm
) = error_mark_node
;
2245 if (TREE_CODE (decl
) != TYPE_DECL
|| is_partial
|| !is_primary
)
2246 /* For an ordinary class template, default template arguments are
2247 allowed at the innermost level, e.g.:
2248 template <class T = int>
2250 but, in a partial specialization, they're not allowed even
2251 there, as we have in [temp.class.spec]:
2253 The template parameter list of a specialization shall not
2254 contain default template argument values.
2256 So, for a partial specialization, or for a function template,
2257 we look at all of them. */
2260 /* But, for a primary class template that is not a partial
2261 specialization we look at all template parameters except the
2263 parms
= TREE_CHAIN (parms
);
2265 /* Figure out what error message to issue. */
2266 if (TREE_CODE (decl
) == FUNCTION_DECL
)
2267 msg
= "default argument for template parameter in function template `%D'";
2268 else if (is_partial
)
2269 msg
= "default argument in partial specialization `%D'";
2271 msg
= "default argument for template parameter for class enclosing `%D'";
2273 if (current_class_type
&& TYPE_BEING_DEFINED (current_class_type
))
2274 /* If we're inside a class definition, there's no need to
2275 examine the parameters to the class itself. On the one
2276 hand, they will be checked when the class is defined, and,
2277 on the other, default arguments are legal in things like:
2278 template <class T = double>
2279 struct S { template <class U> void f(U); };
2280 Here the default argument for `S' has no bearing on the
2281 declaration of `f'. */
2282 last_level_to_check
= template_class_depth (current_class_type
) + 1;
2284 /* Check everything. */
2285 last_level_to_check
= 0;
2287 for (parm_level
= parms
;
2288 parm_level
&& TMPL_PARMS_DEPTH (parm_level
) >= last_level_to_check
;
2289 parm_level
= TREE_CHAIN (parm_level
))
2291 tree inner_parms
= TREE_VALUE (parm_level
);
2295 ntparms
= TREE_VEC_LENGTH (inner_parms
);
2296 for (i
= 0; i
< ntparms
; ++i
)
2297 if (TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)))
2301 cp_error (msg
, decl
);
2305 /* Clear out the default argument so that we are not
2307 TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)) = NULL_TREE
;
2310 /* At this point, if we're still interested in issuing messages,
2311 they must apply to classes surrounding the object declared. */
2313 msg
= "default argument for template parameter for class enclosing `%D'";
2317 /* Creates a TEMPLATE_DECL for the indicated DECL using the template
2318 parameters given by current_template_args, or reuses a
2319 previously existing one, if appropriate. Returns the DECL, or an
2320 equivalent one, if it is replaced via a call to duplicate_decls.
2322 If IS_FRIEND is non-zero, DECL is a friend declaration. */
2325 push_template_decl_real (decl
, is_friend
)
2335 int new_template_p
= 0;
2337 /* See if this is a partial specialization. */
2338 is_partial
= (DECL_IMPLICIT_TYPEDEF_P (decl
)
2339 && TREE_CODE (TREE_TYPE (decl
)) != ENUMERAL_TYPE
2340 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl
)));
2342 is_friend
|= (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_FRIEND_P (decl
));
2345 /* For a friend, we want the context of the friend function, not
2346 the type of which it is a friend. */
2347 ctx
= DECL_CONTEXT (decl
);
2348 else if (DECL_REAL_CONTEXT (decl
)
2349 && TREE_CODE (DECL_REAL_CONTEXT (decl
)) != NAMESPACE_DECL
)
2350 /* In the case of a virtual function, we want the class in which
2352 ctx
= DECL_REAL_CONTEXT (decl
);
2354 /* Otherwise, if we're currently definining some class, the DECL
2355 is assumed to be a member of the class. */
2356 ctx
= current_scope ();
2358 if (ctx
&& TREE_CODE (ctx
) == NAMESPACE_DECL
)
2361 if (!DECL_CONTEXT (decl
))
2362 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
2364 /* See if this is a primary template. */
2365 primary
= pseudo_global_level_p ();
2369 if (current_lang_name
== lang_name_c
)
2370 cp_error ("template with C linkage");
2371 else if (TREE_CODE (decl
) == TYPE_DECL
2372 && ANON_AGGRNAME_P (DECL_NAME (decl
)))
2373 cp_error ("template class without a name");
2374 else if ((DECL_IMPLICIT_TYPEDEF_P (decl
)
2375 && CLASS_TYPE_P (TREE_TYPE (decl
)))
2376 || (TREE_CODE (decl
) == VAR_DECL
&& ctx
&& CLASS_TYPE_P (ctx
))
2377 || TREE_CODE (decl
) == FUNCTION_DECL
)
2380 cp_error ("template declaration of `%#D'", decl
);
2383 /* Check to see that the rules regarding the use of default
2384 arguments are not being violated. */
2385 check_default_tmpl_args (decl
, current_template_parms
,
2386 primary
, is_partial
);
2389 return process_partial_specialization (decl
);
2391 args
= current_template_args ();
2394 || TREE_CODE (ctx
) == FUNCTION_DECL
2395 || TYPE_BEING_DEFINED (ctx
)
2396 || (is_friend
&& !DECL_TEMPLATE_INFO (decl
)))
2398 if (DECL_LANG_SPECIFIC (decl
)
2399 && DECL_TEMPLATE_INFO (decl
)
2400 && DECL_TI_TEMPLATE (decl
))
2401 tmpl
= DECL_TI_TEMPLATE (decl
);
2402 /* If DECL is a TYPE_DECL for a class-template, then there won't
2403 be DECL_LANG_SPECIFIC. The information equivalent to
2404 DECL_TEMPLATE_INFO is found in TYPE_TEMPLATE_INFO instead. */
2405 else if (DECL_IMPLICIT_TYPEDEF_P (decl
)
2406 && TYPE_TEMPLATE_INFO (TREE_TYPE (decl
))
2407 && TYPE_TI_TEMPLATE (TREE_TYPE (decl
)))
2409 /* Since a template declaration already existed for this
2410 class-type, we must be redeclaring it here. Make sure
2411 that the redeclaration is legal. */
2412 redeclare_class_template (TREE_TYPE (decl
),
2413 current_template_parms
);
2414 /* We don't need to create a new TEMPLATE_DECL; just use the
2415 one we already had. */
2416 tmpl
= TYPE_TI_TEMPLATE (TREE_TYPE (decl
));
2420 tmpl
= build_template_decl (decl
, current_template_parms
);
2423 if (DECL_LANG_SPECIFIC (decl
)
2424 && DECL_TEMPLATE_SPECIALIZATION (decl
))
2426 /* A specialization of a member template of a template
2428 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
2429 DECL_TEMPLATE_INFO (tmpl
) = DECL_TEMPLATE_INFO (decl
);
2430 DECL_TEMPLATE_INFO (decl
) = NULL_TREE
;
2436 tree a
, t
, current
, parms
;
2439 if (CLASSTYPE_TEMPLATE_INSTANTIATION (ctx
))
2440 cp_error ("must specialize `%#T' before defining member `%#D'",
2442 if (TREE_CODE (decl
) == TYPE_DECL
)
2444 if ((IS_AGGR_TYPE_CODE (TREE_CODE (TREE_TYPE (decl
)))
2445 || TREE_CODE (TREE_TYPE (decl
)) == ENUMERAL_TYPE
)
2446 && TYPE_TEMPLATE_INFO (TREE_TYPE (decl
))
2447 && TYPE_TI_TEMPLATE (TREE_TYPE (decl
)))
2448 tmpl
= TYPE_TI_TEMPLATE (TREE_TYPE (decl
));
2451 cp_error ("`%D' does not declare a template type", decl
);
2455 else if (! DECL_TEMPLATE_INFO (decl
))
2457 cp_error ("template definition of non-template `%#D'", decl
);
2461 tmpl
= DECL_TI_TEMPLATE (decl
);
2463 if (is_member_template (tmpl
)
2464 && DECL_FUNCTION_TEMPLATE_P (tmpl
)
2465 && DECL_TEMPLATE_INFO (decl
) && DECL_TI_ARGS (decl
)
2466 && DECL_TEMPLATE_SPECIALIZATION (decl
))
2470 /* The declaration is a specialization of a member
2471 template, declared outside the class. Therefore, the
2472 innermost template arguments will be NULL, so we
2473 replace them with the arguments determined by the
2474 earlier call to check_explicit_specialization. */
2475 args
= DECL_TI_ARGS (decl
);
2478 = build_template_decl (decl
, current_template_parms
);
2479 DECL_TEMPLATE_RESULT (new_tmpl
) = decl
;
2480 TREE_TYPE (new_tmpl
) = TREE_TYPE (decl
);
2481 DECL_TI_TEMPLATE (decl
) = new_tmpl
;
2482 SET_DECL_TEMPLATE_SPECIALIZATION (new_tmpl
);
2483 DECL_TEMPLATE_INFO (new_tmpl
)
2484 = tree_cons (tmpl
, args
, NULL_TREE
);
2486 register_specialization (new_tmpl
, tmpl
, args
);
2490 /* Make sure the template headers we got make sense. */
2492 parms
= DECL_TEMPLATE_PARMS (tmpl
);
2493 i
= TMPL_PARMS_DEPTH (parms
);
2494 if (TMPL_ARGS_DEPTH (args
) != i
)
2496 cp_error ("expected %d levels of template parms for `%#D', got %d",
2497 i
, decl
, TMPL_ARGS_DEPTH (args
));
2500 for (current
= decl
; i
> 0; --i
, parms
= TREE_CHAIN (parms
))
2502 a
= TMPL_ARGS_LEVEL (args
, i
);
2503 t
= INNERMOST_TEMPLATE_PARMS (parms
);
2505 if (TREE_VEC_LENGTH (t
) != TREE_VEC_LENGTH (a
))
2507 if (current
== decl
)
2508 cp_error ("got %d template parameters for `%#D'",
2509 TREE_VEC_LENGTH (a
), decl
);
2511 cp_error ("got %d template parameters for `%#T'",
2512 TREE_VEC_LENGTH (a
), current
);
2513 cp_error (" but %d required", TREE_VEC_LENGTH (t
));
2516 /* Perhaps we should also check that the parms are used in the
2517 appropriate qualifying scopes in the declarator? */
2519 if (current
== decl
)
2522 current
= TYPE_CONTEXT (current
);
2526 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
2527 TREE_TYPE (tmpl
) = TREE_TYPE (decl
);
2529 /* Push template declarations for global functions and types. Note
2530 that we do not try to push a global template friend declared in a
2531 template class; such a thing may well depend on the template
2532 parameters of the class. */
2533 if (new_template_p
&& !ctx
2534 && !(is_friend
&& template_class_depth (current_class_type
) > 0))
2535 tmpl
= pushdecl_namespace_level (tmpl
);
2538 DECL_PRIMARY_TEMPLATE (tmpl
) = tmpl
;
2540 info
= tree_cons (tmpl
, args
, NULL_TREE
);
2542 if (DECL_IMPLICIT_TYPEDEF_P (decl
))
2544 SET_TYPE_TEMPLATE_INFO (TREE_TYPE (tmpl
), info
);
2545 if ((!ctx
|| TREE_CODE (ctx
) != FUNCTION_DECL
)
2546 && TREE_CODE (TREE_TYPE (decl
)) != ENUMERAL_TYPE
)
2547 DECL_NAME (decl
) = classtype_mangled_name (TREE_TYPE (decl
));
2549 else if (DECL_LANG_SPECIFIC (decl
))
2550 DECL_TEMPLATE_INFO (decl
) = info
;
2552 return DECL_TEMPLATE_RESULT (tmpl
);
2556 push_template_decl (decl
)
2559 return push_template_decl_real (decl
, 0);
2562 /* Called when a class template TYPE is redeclared with the indicated
2563 template PARMS, e.g.:
2565 template <class T> struct S;
2566 template <class T> struct S {}; */
2569 redeclare_class_template (type
, parms
)
2577 if (!TYPE_TEMPLATE_INFO (type
))
2579 cp_error ("`%T' is not a template type", type
);
2583 tmpl
= TYPE_TI_TEMPLATE (type
);
2584 if (!PRIMARY_TEMPLATE_P (tmpl
))
2585 /* The type is nested in some template class. Nothing to worry
2586 about here; there are no new template parameters for the nested
2590 parms
= INNERMOST_TEMPLATE_PARMS (parms
);
2591 tmpl_parms
= DECL_INNERMOST_TEMPLATE_PARMS (tmpl
);
2593 if (TREE_VEC_LENGTH (parms
) != TREE_VEC_LENGTH (tmpl_parms
))
2595 cp_error_at ("previous declaration `%D'", tmpl
);
2596 cp_error ("used %d template parameter%s instead of %d",
2597 TREE_VEC_LENGTH (tmpl_parms
),
2598 TREE_VEC_LENGTH (tmpl_parms
) == 1 ? "" : "s",
2599 TREE_VEC_LENGTH (parms
));
2603 for (i
= 0; i
< TREE_VEC_LENGTH (tmpl_parms
); ++i
)
2605 tree tmpl_parm
= TREE_VALUE (TREE_VEC_ELT (tmpl_parms
, i
));
2606 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
2607 tree tmpl_default
= TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
));
2608 tree parm_default
= TREE_PURPOSE (TREE_VEC_ELT (parms
, i
));
2610 if (TREE_CODE (tmpl_parm
) != TREE_CODE (parm
))
2612 cp_error_at ("template parameter `%#D'", tmpl_parm
);
2613 cp_error ("redeclared here as `%#D'", parm
);
2617 if (tmpl_default
!= NULL_TREE
&& parm_default
!= NULL_TREE
)
2619 /* We have in [temp.param]:
2621 A template-parameter may not be given default arguments
2622 by two different declarations in the same scope. */
2623 cp_error ("redefinition of default argument for `%#D'", parm
);
2624 cp_error_at (" original definition appeared here", tmpl_parm
);
2628 if (parm_default
!= NULL_TREE
)
2629 /* Update the previous template parameters (which are the ones
2630 that will really count) with the new default value. */
2631 TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
)) = parm_default
;
2632 else if (tmpl_default
!= NULL_TREE
)
2633 /* Update the new parameters, too; they'll be used as the
2634 parameters for any members. */
2635 TREE_PURPOSE (TREE_VEC_ELT (parms
, i
)) = tmpl_default
;
2639 /* Attempt to convert the non-type template parameter EXPR to the
2640 indicated TYPE. If the conversion is successful, return the
2641 converted value. If the conversion is unsuccesful, return
2642 NULL_TREE if we issued an error message, or error_mark_node if we
2643 did not. We issue error messages for out-and-out bad template
2644 parameters, but not simply because the conversion failed, since we
2645 might be just trying to do argument deduction. By the time this
2646 function is called, neither TYPE nor EXPR may make use of template
2650 convert_nontype_argument (type
, expr
)
2654 tree expr_type
= TREE_TYPE (expr
);
2656 /* A template-argument for a non-type, non-template
2657 template-parameter shall be one of:
2659 --an integral constant-expression of integral or enumeration
2662 --the name of a non-type template-parameter; or
2664 --the name of an object or function with external linkage,
2665 including function templates and function template-ids but
2666 excluding non-static class members, expressed as id-expression;
2669 --the address of an object or function with external linkage,
2670 including function templates and function template-ids but
2671 excluding non-static class members, expressed as & id-expression
2672 where the & is optional if the name refers to a function or
2675 --a pointer to member expressed as described in _expr.unary.op_. */
2677 /* An integral constant-expression can include const variables or
2678 enumerators. Simplify things by folding them to their values,
2679 unless we're about to bind the declaration to a reference
2681 if (INTEGRAL_TYPE_P (expr_type
) && TREE_READONLY_DECL_P (expr
)
2682 && TREE_CODE (type
) != REFERENCE_TYPE
)
2683 expr
= decl_constant_value (expr
);
2685 if (is_overloaded_fn (expr
))
2686 /* OK for now. We'll check that it has external linkage later.
2687 Check this first since if expr_type is the unknown_type_node
2688 we would otherwise complain below. */
2690 else if (TYPE_PTRMEM_P (expr_type
)
2691 || TYPE_PTRMEMFUNC_P (expr_type
))
2693 if (TREE_CODE (expr
) != PTRMEM_CST
)
2696 else if (TYPE_PTR_P (expr_type
)
2697 || TYPE_PTRMEM_P (expr_type
)
2698 || TREE_CODE (expr_type
) == ARRAY_TYPE
2699 || TREE_CODE (type
) == REFERENCE_TYPE
2700 /* If expr is the address of an overloaded function, we
2701 will get the unknown_type_node at this point. */
2702 || expr_type
== unknown_type_node
)
2708 if (TREE_CODE (type
) == REFERENCE_TYPE
2709 || TREE_CODE (expr_type
) == ARRAY_TYPE
)
2713 if (TREE_CODE (e
) != ADDR_EXPR
)
2716 cp_error ("`%E' is not a valid template argument", expr
);
2717 if (TYPE_PTR_P (expr_type
))
2719 if (TREE_CODE (TREE_TYPE (expr_type
)) == FUNCTION_TYPE
)
2720 cp_error ("it must be the address of a function with external linkage");
2722 cp_error ("it must be the address of an object with external linkage");
2724 else if (TYPE_PTRMEM_P (expr_type
)
2725 || TYPE_PTRMEMFUNC_P (expr_type
))
2726 cp_error ("it must be a pointer-to-member of the form `&X::Y'");
2731 referent
= TREE_OPERAND (e
, 0);
2732 STRIP_NOPS (referent
);
2735 if (TREE_CODE (referent
) == STRING_CST
)
2737 cp_error ("string literal %E is not a valid template argument",
2739 error ("because it is the address of an object with static linkage");
2743 if (is_overloaded_fn (referent
))
2744 /* We'll check that it has external linkage later. */
2746 else if (TREE_CODE (referent
) != VAR_DECL
)
2748 else if (!TREE_PUBLIC (referent
))
2750 cp_error ("address of non-extern `%E' cannot be used as template argument", referent
);
2751 return error_mark_node
;
2754 else if (INTEGRAL_TYPE_P (expr_type
)
2755 || TYPE_PTRMEM_P (expr_type
)
2756 || TYPE_PTRMEMFUNC_P (expr_type
)
2757 /* The next two are g++ extensions. */
2758 || TREE_CODE (expr_type
) == REAL_TYPE
2759 || TREE_CODE (expr_type
) == COMPLEX_TYPE
)
2761 if (! TREE_CONSTANT (expr
))
2764 cp_error ("non-constant `%E' cannot be used as template argument",
2771 cp_error ("object `%E' cannot be used as template argument", expr
);
2775 switch (TREE_CODE (type
))
2780 /* For a non-type template-parameter of integral or enumeration
2781 type, integral promotions (_conv.prom_) and integral
2782 conversions (_conv.integral_) are applied. */
2783 if (!INTEGRAL_TYPE_P (expr_type
))
2784 return error_mark_node
;
2786 /* It's safe to call digest_init in this case; we know we're
2787 just converting one integral constant expression to another. */
2788 expr
= digest_init (type
, expr
, (tree
*) 0);
2790 if (TREE_CODE (expr
) != INTEGER_CST
)
2791 /* Curiously, some TREE_CONSTANT integral expressions do not
2792 simplify to integer constants. For example, `3 % 0',
2793 remains a TRUNC_MOD_EXPR. */
2800 /* These are g++ extensions. */
2801 if (TREE_CODE (expr_type
) != TREE_CODE (type
))
2802 return error_mark_node
;
2804 expr
= digest_init (type
, expr
, (tree
*) 0);
2806 if (TREE_CODE (expr
) != REAL_CST
)
2813 tree type_pointed_to
= TREE_TYPE (type
);
2815 if (TYPE_PTRMEM_P (type
))
2819 /* For a non-type template-parameter of type pointer to data
2820 member, qualification conversions (_conv.qual_) are
2822 e
= perform_qualification_conversions (type
, expr
);
2823 if (TREE_CODE (e
) == NOP_EXPR
)
2824 /* The call to perform_qualification_conversions will
2825 insert a NOP_EXPR over EXPR to do express conversion,
2826 if necessary. But, that will confuse us if we use
2827 this (converted) template parameter to instantiate
2828 another template; then the thing will not look like a
2829 valid template argument. So, just make a new
2830 constant, of the appropriate type. */
2831 e
= make_ptrmem_cst (type
, PTRMEM_CST_MEMBER (expr
));
2834 else if (TREE_CODE (type_pointed_to
) == FUNCTION_TYPE
)
2836 /* For a non-type template-parameter of type pointer to
2837 function, only the function-to-pointer conversion
2838 (_conv.func_) is applied. If the template-argument
2839 represents a set of overloaded functions (or a pointer to
2840 such), the matching function is selected from the set
2845 if (TREE_CODE (expr
) == ADDR_EXPR
)
2846 fns
= TREE_OPERAND (expr
, 0);
2850 fn
= instantiate_type (type_pointed_to
, fns
, 0);
2852 if (fn
== error_mark_node
)
2853 return error_mark_node
;
2855 if (!TREE_PUBLIC (fn
))
2857 if (really_overloaded_fn (fns
))
2858 return error_mark_node
;
2863 expr
= build_unary_op (ADDR_EXPR
, fn
, 0);
2865 my_friendly_assert (same_type_p (type
, TREE_TYPE (expr
)),
2871 /* For a non-type template-parameter of type pointer to
2872 object, qualification conversions (_conv.qual_) and the
2873 array-to-pointer conversion (_conv.array_) are applied.
2874 [Note: In particular, neither the null pointer conversion
2875 (_conv.ptr_) nor the derived-to-base conversion
2876 (_conv.ptr_) are applied. Although 0 is a valid
2877 template-argument for a non-type template-parameter of
2878 integral type, it is not a valid template-argument for a
2879 non-type template-parameter of pointer type.]
2881 The call to decay_conversion performs the
2882 array-to-pointer conversion, if appropriate. */
2883 expr
= decay_conversion (expr
);
2885 if (expr
== error_mark_node
)
2886 return error_mark_node
;
2888 return perform_qualification_conversions (type
, expr
);
2893 case REFERENCE_TYPE
:
2895 tree type_referred_to
= TREE_TYPE (type
);
2897 if (TREE_CODE (type_referred_to
) == FUNCTION_TYPE
)
2899 /* For a non-type template-parameter of type reference to
2900 function, no conversions apply. If the
2901 template-argument represents a set of overloaded
2902 functions, the matching function is selected from the
2903 set (_over.over_). */
2907 fn
= instantiate_type (type_referred_to
, fns
, 0);
2909 if (fn
== error_mark_node
)
2910 return error_mark_node
;
2912 if (!TREE_PUBLIC (fn
))
2914 if (really_overloaded_fn (fns
))
2915 /* Don't issue an error here; we might get a different
2916 function if the overloading had worked out
2918 return error_mark_node
;
2923 my_friendly_assert (same_type_p (type_referred_to
,
2931 /* For a non-type template-parameter of type reference to
2932 object, no conversions apply. The type referred to by the
2933 reference may be more cv-qualified than the (otherwise
2934 identical) type of the template-argument. The
2935 template-parameter is bound directly to the
2936 template-argument, which must be an lvalue. */
2937 if ((TYPE_MAIN_VARIANT (expr_type
)
2938 != TYPE_MAIN_VARIANT (type_referred_to
))
2939 || !at_least_as_qualified_p (type_referred_to
,
2941 || !real_lvalue_p (expr
))
2942 return error_mark_node
;
2951 if (!TYPE_PTRMEMFUNC_P (type
))
2952 /* This handles templates like
2953 template<class T, T t> void f();
2954 when T is substituted with any class. The second template
2955 parameter becomes invalid and the template candidate is
2957 return error_mark_node
;
2959 /* For a non-type template-parameter of type pointer to member
2960 function, no conversions apply. If the template-argument
2961 represents a set of overloaded member functions, the
2962 matching member function is selected from the set
2965 if (!TYPE_PTRMEMFUNC_P (expr_type
) &&
2966 expr_type
!= unknown_type_node
)
2967 return error_mark_node
;
2969 if (TREE_CODE (expr
) == PTRMEM_CST
)
2971 /* A ptr-to-member constant. */
2972 if (!same_type_p (type
, expr_type
))
2973 return error_mark_node
;
2978 if (TREE_CODE (expr
) != ADDR_EXPR
)
2979 return error_mark_node
;
2981 expr
= instantiate_type (type
, expr
, 0);
2983 if (expr
== error_mark_node
)
2984 return error_mark_node
;
2986 my_friendly_assert (same_type_p (type
, TREE_TYPE (expr
)),
2993 /* All non-type parameters must have one of these types. */
2994 my_friendly_abort (0);
2998 return error_mark_node
;
3001 /* Return 1 if PARM_PARMS and ARG_PARMS matches using rule for
3002 template template parameters. Both PARM_PARMS and ARG_PARMS are
3003 vectors of TREE_LIST nodes containing TYPE_DECL, TEMPLATE_DECL
3006 ARG_PARMS may contain more parameters than PARM_PARMS. If this is
3007 the case, then extra parameters must have default arguments.
3009 Consider the example:
3010 template <class T, class Allocator = allocator> class vector;
3011 template<template <class U> class TT> class C;
3013 C<vector> is a valid instantiation. PARM_PARMS for the above code
3014 contains a TYPE_DECL (for U), ARG_PARMS contains two TYPE_DECLs (for
3015 T and Allocator) and OUTER_ARGS contains the argument that is used to
3016 substitute the TT parameter. */
3019 coerce_template_template_parms (parm_parms
, arg_parms
, complain
,
3020 in_decl
, outer_args
)
3021 tree parm_parms
, arg_parms
;
3023 tree in_decl
, outer_args
;
3025 int nparms
, nargs
, i
;
3028 my_friendly_assert (TREE_CODE (parm_parms
) == TREE_VEC
, 0);
3029 my_friendly_assert (TREE_CODE (arg_parms
) == TREE_VEC
, 0);
3031 nparms
= TREE_VEC_LENGTH (parm_parms
);
3032 nargs
= TREE_VEC_LENGTH (arg_parms
);
3034 /* The rule here is opposite of coerce_template_parms. */
3037 && TREE_PURPOSE (TREE_VEC_ELT (arg_parms
, nparms
)) == NULL_TREE
))
3040 for (i
= 0; i
< nparms
; ++i
)
3042 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, i
));
3043 arg
= TREE_VALUE (TREE_VEC_ELT (arg_parms
, i
));
3045 if (arg
== NULL_TREE
|| arg
== error_mark_node
3046 || parm
== NULL_TREE
|| parm
== error_mark_node
)
3049 if (TREE_CODE (arg
) != TREE_CODE (parm
))
3052 switch (TREE_CODE (parm
))
3058 /* We encounter instantiations of templates like
3059 template <template <template <class> class> class TT>
3062 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
3063 tree argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
3065 if (!coerce_template_template_parms (parmparm
, argparm
,
3073 /* The tsubst call is used to handle cases such as
3074 template <class T, template <T> class TT> class D;
3075 i.e. the parameter list of TT depends on earlier parameters. */
3076 if (!same_type_p (tsubst (TREE_TYPE (parm
), outer_args
,
3083 my_friendly_abort (0);
3089 /* Convert the indicated template ARG as necessary to match the
3090 indicated template PARM. Returns the converted ARG, or
3091 error_mark_node if the conversion was unsuccessful. Error messages
3092 are issued if COMPLAIN is non-zero. This conversion is for the Ith
3093 parameter in the parameter list. ARGS is the full set of template
3094 arguments deduced so far. */
3097 convert_template_argument (parm
, arg
, args
, complain
, i
, in_decl
)
3107 int is_type
, requires_type
, is_tmpl_type
, requires_tmpl_type
;
3109 inner_args
= innermost_args (args
);
3111 if (TREE_CODE (arg
) == TREE_LIST
3112 && TREE_TYPE (arg
) != NULL_TREE
3113 && TREE_CODE (TREE_TYPE (arg
)) == OFFSET_TYPE
)
3115 /* The template argument was the name of some
3116 member function. That's usually
3117 illegal, but static members are OK. In any
3118 case, grab the underlying fields/functions
3119 and issue an error later if required. */
3120 arg
= TREE_VALUE (arg
);
3121 TREE_TYPE (arg
) = unknown_type_node
;
3124 requires_tmpl_type
= TREE_CODE (parm
) == TEMPLATE_DECL
;
3125 requires_type
= (TREE_CODE (parm
) == TYPE_DECL
3126 || requires_tmpl_type
);
3128 /* Check if it is a class template. If REQUIRES_TMPL_TYPE is true,
3129 we also accept implicitly created TYPE_DECL as a valid argument.
3130 This is necessary to handle the case where we pass a template name
3131 to a template template parameter in a scope where we've derived from
3132 in instantiation of that template, so the template name refers to that
3133 instantiation. We really ought to handle this better. */
3135 = ((TREE_CODE (arg
) == TEMPLATE_DECL
3136 && TREE_CODE (DECL_TEMPLATE_RESULT (arg
)) == TYPE_DECL
)
3137 || (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
3138 && !TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (arg
))
3139 || (TREE_CODE (arg
) == RECORD_TYPE
3140 && CLASSTYPE_TEMPLATE_INFO (arg
)
3141 && TREE_CODE (TYPE_NAME (arg
)) == TYPE_DECL
3142 && DECL_ARTIFICIAL (TYPE_NAME (arg
))
3143 && requires_tmpl_type
3144 && is_base_of_enclosing_class (arg
, current_class_type
)));
3145 if (is_tmpl_type
&& TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
3146 arg
= TYPE_STUB_DECL (arg
);
3147 else if (is_tmpl_type
&& TREE_CODE (arg
) == RECORD_TYPE
)
3148 arg
= CLASSTYPE_TI_TEMPLATE (arg
);
3150 is_type
= TREE_CODE_CLASS (TREE_CODE (arg
)) == 't' || is_tmpl_type
;
3152 if (requires_type
&& ! is_type
&& TREE_CODE (arg
) == SCOPE_REF
3153 && TREE_CODE (TREE_OPERAND (arg
, 0)) == TEMPLATE_TYPE_PARM
)
3155 cp_pedwarn ("to refer to a type member of a template parameter,");
3156 cp_pedwarn (" use `typename %E'", arg
);
3158 arg
= make_typename_type (TREE_OPERAND (arg
, 0),
3159 TREE_OPERAND (arg
, 1),
3163 if (is_type
!= requires_type
)
3169 cp_error ("type/value mismatch at argument %d in template parameter list for `%D'",
3172 cp_error (" expected a constant of type `%T', got `%T'",
3174 (is_tmpl_type
? DECL_NAME (arg
) : arg
));
3176 cp_error (" expected a type, got `%E'", arg
);
3179 return error_mark_node
;
3181 if (is_tmpl_type
^ requires_tmpl_type
)
3183 if (in_decl
&& complain
)
3185 cp_error ("type/value mismatch at argument %d in template parameter list for `%D'",
3188 cp_error (" expected a type, got `%T'", DECL_NAME (arg
));
3190 cp_error (" expected a class template, got `%T'", arg
);
3192 return error_mark_node
;
3197 if (requires_tmpl_type
)
3199 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
3200 tree argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
3202 if (coerce_template_template_parms (parmparm
, argparm
, complain
,
3203 in_decl
, inner_args
))
3207 /* TEMPLATE_TEMPLATE_PARM node is preferred over
3209 if (val
!= error_mark_node
3210 && DECL_TEMPLATE_TEMPLATE_PARM_P (val
))
3211 val
= TREE_TYPE (val
);
3215 if (in_decl
&& complain
)
3217 cp_error ("type/value mismatch at argument %d in template parameter list for `%D'",
3219 cp_error (" expected a template of type `%D', got `%D'", parm
, arg
);
3222 val
= error_mark_node
;
3227 val
= groktypename (arg
);
3228 if (! processing_template_decl
)
3230 /* [basic.link]: A name with no linkage (notably, the
3231 name of a class or enumeration declared in a local
3232 scope) shall not be used to declare an entity with
3233 linkage. This implies that names with no linkage
3234 cannot be used as template arguments. */
3235 tree t
= no_linkage_check (val
);
3238 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
3240 ("template-argument `%T' uses anonymous type", val
);
3243 ("template-argument `%T' uses local type `%T'",
3245 return error_mark_node
;
3252 tree t
= tsubst (TREE_TYPE (parm
), args
, complain
, in_decl
);
3254 if (processing_template_decl
)
3255 arg
= maybe_fold_nontype_arg (arg
);
3257 if (!uses_template_parms (arg
) && !uses_template_parms (t
))
3258 /* We used to call digest_init here. However, digest_init
3259 will report errors, which we don't want when complain
3260 is zero. More importantly, digest_init will try too
3261 hard to convert things: for example, `0' should not be
3262 converted to pointer type at this point according to
3263 the standard. Accepting this is not merely an
3264 extension, since deciding whether or not these
3265 conversions can occur is part of determining which
3266 function template to call, or whether a given epxlicit
3267 argument specification is legal. */
3268 val
= convert_nontype_argument (t
, arg
);
3272 if (val
== NULL_TREE
)
3273 val
= error_mark_node
;
3274 else if (val
== error_mark_node
&& complain
)
3275 cp_error ("could not convert template argument `%E' to `%T'",
3282 /* Convert all template arguments to their appropriate types, and
3283 return a vector containing the innermost resulting template
3284 arguments. If any error occurs, return error_mark_node, and, if
3285 COMPLAIN is non-zero, issue an error message. Some error messages
3286 are issued even if COMPLAIN is zero; for instance, if a template
3287 argument is composed from a local class.
3289 If REQUIRE_ALL_ARGUMENTS is non-zero, all arguments must be
3290 provided in ARGLIST, or else trailing parameters must have default
3291 values. If REQUIRE_ALL_ARGUMENTS is zero, we will attempt argument
3292 deduction for any unspecified trailing arguments.
3294 The resulting TREE_VEC is allocated on a temporary obstack, and
3295 must be explicitly copied if it will be permanent. */
3298 coerce_template_parms (parms
, args
, in_decl
,
3300 require_all_arguments
)
3304 int require_all_arguments
;
3306 int nparms
, nargs
, i
, lost
= 0;
3309 tree new_inner_args
;
3311 inner_args
= innermost_args (args
);
3312 nargs
= NUM_TMPL_ARGS (inner_args
);
3313 nparms
= TREE_VEC_LENGTH (parms
);
3317 && require_all_arguments
3318 && TREE_PURPOSE (TREE_VEC_ELT (parms
, nargs
)) == NULL_TREE
))
3322 cp_error ("wrong number of template arguments (%d, should be %d)",
3326 cp_error_at ("provided for `%D'", in_decl
);
3329 return error_mark_node
;
3332 new_inner_args
= make_tree_vec (nparms
);
3333 new_args
= add_outermost_template_args (args
, new_inner_args
);
3334 for (i
= 0; i
< nparms
; i
++)
3339 /* Get the Ith template parameter. */
3340 parm
= TREE_VEC_ELT (parms
, i
);
3342 /* Calculate the Ith argument. */
3343 if (inner_args
&& TREE_CODE (inner_args
) == TREE_LIST
)
3345 arg
= TREE_VALUE (inner_args
);
3346 inner_args
= TREE_CHAIN (inner_args
);
3349 arg
= TREE_VEC_ELT (inner_args
, i
);
3350 /* If no template argument was supplied, look for a default
3352 else if (TREE_PURPOSE (parm
) == NULL_TREE
)
3354 /* There was no default value. */
3355 my_friendly_assert (!require_all_arguments
, 0);
3358 else if (TREE_CODE (TREE_VALUE (parm
)) == TYPE_DECL
)
3359 arg
= tsubst (TREE_PURPOSE (parm
), new_args
, complain
, in_decl
);
3361 arg
= tsubst_expr (TREE_PURPOSE (parm
), new_args
, complain
,
3364 /* Now, convert the Ith argument, as necessary. */
3365 if (arg
== NULL_TREE
)
3366 /* We're out of arguments. */
3368 my_friendly_assert (!require_all_arguments
, 0);
3371 else if (arg
== error_mark_node
)
3373 cp_error ("template argument %d is invalid", i
+ 1);
3374 arg
= error_mark_node
;
3377 arg
= convert_template_argument (TREE_VALUE (parm
),
3378 arg
, new_args
, complain
, i
,
3381 if (arg
== error_mark_node
)
3383 TREE_VEC_ELT (new_inner_args
, i
) = arg
;
3387 return error_mark_node
;
3389 return new_inner_args
;
3392 /* Returns 1 if template args OT and NT are equivalent. */
3395 template_args_equal (ot
, nt
)
3400 if (TREE_CODE (nt
) != TREE_CODE (ot
))
3402 if (TREE_CODE (nt
) == TREE_VEC
)
3403 /* For member templates */
3404 return comp_template_args (ot
, nt
);
3405 else if (TREE_CODE_CLASS (TREE_CODE (ot
)) == 't')
3406 return same_type_p (ot
, nt
);
3408 return (cp_tree_equal (ot
, nt
) > 0);
3411 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets
3412 of template arguments. Returns 0 otherwise. */
3415 comp_template_args (oldargs
, newargs
)
3416 tree oldargs
, newargs
;
3420 if (TREE_VEC_LENGTH (oldargs
) != TREE_VEC_LENGTH (newargs
))
3423 for (i
= 0; i
< TREE_VEC_LENGTH (oldargs
); ++i
)
3425 tree nt
= TREE_VEC_ELT (newargs
, i
);
3426 tree ot
= TREE_VEC_ELT (oldargs
, i
);
3428 if (! template_args_equal (ot
, nt
))
3434 /* Given class template name and parameter list, produce a user-friendly name
3435 for the instantiation. */
3438 mangle_class_name_for_template (name
, parms
, arglist
)
3440 tree parms
, arglist
;
3442 static struct obstack scratch_obstack
;
3443 static char *scratch_firstobj
;
3446 if (!scratch_firstobj
)
3447 gcc_obstack_init (&scratch_obstack
);
3449 obstack_free (&scratch_obstack
, scratch_firstobj
);
3450 scratch_firstobj
= obstack_alloc (&scratch_obstack
, 1);
3452 #define ccat(c) obstack_1grow (&scratch_obstack, (c));
3453 #define cat(s) obstack_grow (&scratch_obstack, (s), strlen (s))
3457 nparms
= TREE_VEC_LENGTH (parms
);
3458 arglist
= innermost_args (arglist
);
3459 my_friendly_assert (nparms
== TREE_VEC_LENGTH (arglist
), 268);
3460 for (i
= 0; i
< nparms
; i
++)
3462 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
3463 tree arg
= TREE_VEC_ELT (arglist
, i
);
3468 if (TREE_CODE (parm
) == TYPE_DECL
)
3470 cat (type_as_string (arg
, TS_CHASE_TYPEDEFS
));
3473 else if (TREE_CODE (parm
) == TEMPLATE_DECL
)
3475 if (TREE_CODE (arg
) == TEMPLATE_DECL
)
3477 /* Already substituted with real template. Just output
3478 the template name here */
3479 tree context
= DECL_CONTEXT (arg
);
3482 /* The template may be defined in a namespace, or
3483 may be a member template. */
3484 my_friendly_assert (TREE_CODE (context
) == NAMESPACE_DECL
3485 || CLASS_TYPE_P (context
),
3487 cat(decl_as_string (DECL_CONTEXT (arg
), 0));
3490 cat (IDENTIFIER_POINTER (DECL_NAME (arg
)));
3493 /* Output the parameter declaration */
3494 cat (type_as_string (arg
, TS_CHASE_TYPEDEFS
));
3498 my_friendly_assert (TREE_CODE (parm
) == PARM_DECL
, 269);
3500 if (TREE_CODE (arg
) == TREE_LIST
)
3502 /* New list cell was built because old chain link was in
3504 my_friendly_assert (TREE_PURPOSE (arg
) == NULL_TREE
, 270);
3505 arg
= TREE_VALUE (arg
);
3507 /* No need to check arglist against parmlist here; we did that
3508 in coerce_template_parms, called from lookup_template_class. */
3509 cat (expr_as_string (arg
, 0));
3512 char *bufp
= obstack_next_free (&scratch_obstack
);
3514 while (bufp
[offset
- 1] == ' ')
3516 obstack_blank_fast (&scratch_obstack
, offset
);
3518 /* B<C<char> >, not B<C<char>> */
3519 if (bufp
[offset
- 1] == '>')
3524 return (char *) obstack_base (&scratch_obstack
);
3528 classtype_mangled_name (t
)
3531 if (CLASSTYPE_TEMPLATE_INFO (t
)
3532 /* Specializations have already had their names set up in
3533 lookup_template_class. */
3534 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
3536 tree tmpl
= most_general_template (CLASSTYPE_TI_TEMPLATE (t
));
3538 /* For non-primary templates, the template parameters are
3539 implicit from their surrounding context. */
3540 if (PRIMARY_TEMPLATE_P (tmpl
))
3542 tree name
= DECL_NAME (tmpl
);
3543 char *mangled_name
= mangle_class_name_for_template
3544 (IDENTIFIER_POINTER (name
),
3545 DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
3546 CLASSTYPE_TI_ARGS (t
));
3547 tree id
= get_identifier (mangled_name
);
3548 IDENTIFIER_TEMPLATE (id
) = name
;
3553 return TYPE_IDENTIFIER (t
);
3557 add_pending_template (d
)
3562 if (TREE_CODE_CLASS (TREE_CODE (d
)) == 't')
3563 ti
= CLASSTYPE_TEMPLATE_INFO (d
);
3565 ti
= DECL_TEMPLATE_INFO (d
);
3567 if (TI_PENDING_TEMPLATE_FLAG (ti
))
3570 *template_tail
= tree_cons (build_srcloc_here (), d
, NULL_TREE
);
3571 template_tail
= &TREE_CHAIN (*template_tail
);
3572 TI_PENDING_TEMPLATE_FLAG (ti
) = 1;
3576 /* Return a TEMPLATE_ID_EXPR corresponding to the indicated FNS (which
3577 may be either a _DECL or an overloaded function or an
3578 IDENTIFIER_NODE), and ARGLIST. */
3581 lookup_template_function (fns
, arglist
)
3586 if (fns
== NULL_TREE
)
3588 cp_error ("non-template used as template");
3589 return error_mark_node
;
3592 type
= TREE_TYPE (fns
);
3593 if (TREE_CODE (fns
) == OVERLOAD
|| !type
)
3594 type
= unknown_type_node
;
3596 if (processing_template_decl
)
3597 return build_min (TEMPLATE_ID_EXPR
, type
, fns
, arglist
);
3599 return build (TEMPLATE_ID_EXPR
, type
, fns
, arglist
);
3602 /* Within the scope of a template class S<T>, the name S gets bound
3603 (in build_self_reference) to a TYPE_DECL for the class, not a
3604 TEMPLATE_DECL. If DECL is a TYPE_DECL for current_class_type,
3605 or one of its enclosing classes, and that type is a template,
3606 return the associated TEMPLATE_DECL. Otherwise, the original
3607 DECL is returned. */
3610 maybe_get_template_decl_from_type_decl (decl
)
3613 return (decl
!= NULL_TREE
3614 && TREE_CODE (decl
) == TYPE_DECL
3615 && DECL_ARTIFICIAL (decl
)
3616 && CLASS_TYPE_P (TREE_TYPE (decl
))
3617 && CLASSTYPE_TEMPLATE_INFO (TREE_TYPE (decl
)))
3618 ? CLASSTYPE_TI_TEMPLATE (TREE_TYPE (decl
)) : decl
;
3621 /* Given an IDENTIFIER_NODE (type TEMPLATE_DECL) and a chain of
3622 parameters, find the desired type.
3624 D1 is the PTYPENAME terminal, and ARGLIST is the list of arguments.
3625 (Actually ARGLIST may be either a TREE_LIST or a TREE_VEC. It will
3626 be a TREE_LIST if called directly from the parser, and a TREE_VEC
3627 otherwise.) Since ARGLIST is build on the temp_decl_obstack, we must
3628 copy it here to keep it from being reclaimed when the decl storage
3631 IN_DECL, if non-NULL, is the template declaration we are trying to
3634 If ENTERING_SCOPE is non-zero, we are about to enter the scope of
3635 the class we are looking up.
3637 If the template class is really a local class in a template
3638 function, then the FUNCTION_CONTEXT is the function in which it is
3639 being instantiated. */
3642 lookup_template_class (d1
, arglist
, in_decl
, context
, entering_scope
)
3648 tree
template = NULL_TREE
, parmlist
;
3651 if (TREE_CODE (d1
) == IDENTIFIER_NODE
)
3653 if (IDENTIFIER_VALUE (d1
)
3654 && DECL_TEMPLATE_TEMPLATE_PARM_P (IDENTIFIER_VALUE (d1
)))
3655 template = IDENTIFIER_VALUE (d1
);
3659 push_decl_namespace (context
);
3660 template = lookup_name (d1
, /*prefer_type=*/0);
3661 template = maybe_get_template_decl_from_type_decl (template);
3663 pop_decl_namespace ();
3666 context
= DECL_CONTEXT (template);
3668 else if (TREE_CODE (d1
) == TYPE_DECL
&& IS_AGGR_TYPE (TREE_TYPE (d1
)))
3670 tree type
= TREE_TYPE (d1
);
3672 /* If we are declaring a constructor, say A<T>::A<T>, we will get
3673 an implicit typename for the second A. Deal with it. */
3674 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
3675 type
= TREE_TYPE (type
);
3677 if (CLASSTYPE_TEMPLATE_INFO (type
))
3679 template = CLASSTYPE_TI_TEMPLATE (type
);
3680 d1
= DECL_NAME (template);
3683 else if (TREE_CODE (d1
) == ENUMERAL_TYPE
3684 || (TREE_CODE_CLASS (TREE_CODE (d1
)) == 't'
3685 && IS_AGGR_TYPE (d1
)))
3687 template = TYPE_TI_TEMPLATE (d1
);
3688 d1
= DECL_NAME (template);
3690 else if (TREE_CODE (d1
) == TEMPLATE_DECL
3691 && TREE_CODE (DECL_RESULT (d1
)) == TYPE_DECL
)
3694 d1
= DECL_NAME (template);
3695 context
= DECL_CONTEXT (template);
3698 my_friendly_abort (272);
3700 /* With something like `template <class T> class X class X { ... };'
3701 we could end up with D1 having nothing but an IDENTIFIER_VALUE.
3702 We don't want to do that, but we have to deal with the situation,
3703 so let's give them some syntax errors to chew on instead of a
3707 cp_error ("`%T' is not a template", d1
);
3708 return error_mark_node
;
3711 if (context
== NULL_TREE
)
3712 context
= global_namespace
;
3714 if (TREE_CODE (template) != TEMPLATE_DECL
)
3716 cp_error ("non-template type `%T' used as a template", d1
);
3718 cp_error_at ("for template declaration `%D'", in_decl
);
3719 return error_mark_node
;
3722 if (DECL_TEMPLATE_TEMPLATE_PARM_P (template))
3724 /* Create a new TEMPLATE_DECL and TEMPLATE_TEMPLATE_PARM node to store
3725 template arguments */
3727 tree parm
= copy_template_template_parm (TREE_TYPE (template));
3728 tree template2
= TYPE_STUB_DECL (parm
);
3731 parmlist
= DECL_INNERMOST_TEMPLATE_PARMS (template);
3733 arglist2
= coerce_template_parms (parmlist
, arglist
, template, 1, 1);
3734 if (arglist2
== error_mark_node
)
3735 return error_mark_node
;
3737 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (parm
)
3738 = tree_cons (template2
, arglist2
, NULL_TREE
);
3739 TYPE_SIZE (parm
) = 0;
3744 tree template_type
= TREE_TYPE (template);
3747 tree found
= NULL_TREE
;
3750 int is_partial_instantiation
;
3752 gen_tmpl
= most_general_template (template);
3753 parmlist
= DECL_TEMPLATE_PARMS (gen_tmpl
);
3754 parm_depth
= TMPL_PARMS_DEPTH (parmlist
);
3755 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
3757 if (arg_depth
== 1 && parm_depth
> 1)
3759 /* We've been given an incomplete set of template arguments.
3762 template <class T> struct S1 {
3763 template <class U> struct S2 {};
3764 template <class U> struct S2<U*> {};
3767 we will be called with an ARGLIST of `U*', but the
3768 TEMPLATE will be `template <class T> template
3769 <class U> struct S1<T>::S2'. We must fill in the missing
3772 = add_outermost_template_args (TYPE_TI_ARGS (TREE_TYPE (template)),
3774 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
3777 /* Now we should enough arguments. */
3778 my_friendly_assert (parm_depth
== arg_depth
, 0);
3780 /* From here on, we're only interested in the most general
3782 template = gen_tmpl
;
3784 /* Calculate the BOUND_ARGS. These will be the args that are
3785 actually tsubst'd into the definition to create the
3789 /* We have multiple levels of arguments to coerce, at once. */
3791 int saved_depth
= TMPL_ARGS_DEPTH (arglist
);
3793 tree bound_args
= make_tree_vec (parm_depth
);
3795 for (i
= saved_depth
,
3796 t
= DECL_TEMPLATE_PARMS (template);
3797 i
> 0 && t
!= NULL_TREE
;
3798 --i
, t
= TREE_CHAIN (t
))
3800 tree a
= coerce_template_parms (TREE_VALUE (t
),
3801 arglist
, template, 1, 1);
3802 SET_TMPL_ARGS_LEVEL (bound_args
, i
, a
);
3804 /* We temporarily reduce the length of the ARGLIST so
3805 that coerce_template_parms will see only the arguments
3806 corresponding to the template parameters it is
3808 TREE_VEC_LENGTH (arglist
)--;
3811 /* Restore the ARGLIST to its full size. */
3812 TREE_VEC_LENGTH (arglist
) = saved_depth
;
3814 arglist
= bound_args
;
3818 = coerce_template_parms (INNERMOST_TEMPLATE_PARMS (parmlist
),
3819 innermost_args (arglist
),
3822 if (arglist
== error_mark_node
)
3823 /* We were unable to bind the arguments. */
3824 return error_mark_node
;
3826 /* In the scope of a template class, explicit references to the
3827 template class refer to the type of the template, not any
3828 instantiation of it. For example, in:
3830 template <class T> class C { void f(C<T>); }
3832 the `C<T>' is just the same as `C'. Outside of the
3833 class, however, such a reference is an instantiation. */
3834 if (comp_template_args (TYPE_TI_ARGS (template_type
),
3837 found
= template_type
;
3839 if (!entering_scope
&& PRIMARY_TEMPLATE_P (template))
3843 /* Note that we use DECL_CONTEXT, rather than
3844 CP_DECL_CONTEXT, so that the termination test is
3845 always just `ctx'. We're not interested in namepace
3847 for (ctx
= current_class_type
;
3849 ctx
= (TREE_CODE_CLASS (TREE_CODE (ctx
)) == 't')
3850 ? TYPE_CONTEXT (ctx
) : DECL_CONTEXT (ctx
))
3851 if (same_type_p (ctx
, template_type
))
3855 /* We're not in the scope of the class, so the
3856 TEMPLATE_TYPE is not the type we want after
3864 for (found
= DECL_TEMPLATE_INSTANTIATIONS (template);
3865 found
; found
= TREE_CHAIN (found
))
3866 if (comp_template_args (TREE_PURPOSE (found
), arglist
))
3870 found
= TREE_VALUE (found
);
3876 /* This type is a "partial instantiation" if any of the template
3877 arguments still inolve template parameters. Note that we set
3878 IS_PARTIAL_INSTANTIATION for partial specializations as
3880 is_partial_instantiation
= uses_template_parms (arglist
);
3882 if (!is_partial_instantiation
3883 && !PRIMARY_TEMPLATE_P (template)
3884 && TREE_CODE (CP_DECL_CONTEXT (template)) == NAMESPACE_DECL
)
3886 found
= xref_tag_from_type (TREE_TYPE (template),
3887 DECL_NAME (template),
3892 /* Since we didn't find the type, we'll have to create it.
3893 Since we'll be saving this type on the
3894 DECL_TEMPLATE_INSTANTIATIONS list, it must be permanent. */
3895 push_obstacks (&permanent_obstack
, &permanent_obstack
);
3897 /* Create the type. */
3898 if (TREE_CODE (template_type
) == ENUMERAL_TYPE
)
3900 if (!is_partial_instantiation
)
3901 t
= start_enum (TYPE_IDENTIFIER (template_type
));
3903 /* We don't want to call start_enum for this type, since
3904 the values for the enumeration constants may involve
3905 template parameters. And, no one should be interested
3906 in the enumeration constants for such a type. */
3907 t
= make_node (ENUMERAL_TYPE
);
3911 t
= make_lang_type (TREE_CODE (template_type
));
3912 CLASSTYPE_DECLARED_CLASS (t
)
3913 = CLASSTYPE_DECLARED_CLASS (template_type
);
3914 CLASSTYPE_GOT_SEMICOLON (t
) = 1;
3915 SET_CLASSTYPE_IMPLICIT_INSTANTIATION (t
);
3916 TYPE_FOR_JAVA (t
) = TYPE_FOR_JAVA (template_type
);
3919 /* If we called start_enum above, this information will already
3923 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
3925 type_decl
= create_implicit_typedef (DECL_NAME (template), t
);
3926 DECL_CONTEXT (type_decl
) = TYPE_CONTEXT (t
);
3927 TYPE_STUB_DECL (t
) = type_decl
;
3928 DECL_SOURCE_FILE (type_decl
)
3929 = DECL_SOURCE_FILE (TYPE_STUB_DECL (template_type
));
3930 DECL_SOURCE_LINE (type_decl
)
3931 = DECL_SOURCE_LINE (TYPE_STUB_DECL (template_type
));
3934 type_decl
= TYPE_NAME (t
);
3936 /* Set up the template information. We have to figure out which
3937 template is the immediate parent if this is a full
3939 if (parm_depth
== 1 || is_partial_instantiation
3940 || !PRIMARY_TEMPLATE_P (template))
3941 /* This case is easy; there are no member templates involved. */
3945 /* This is a full instantiation of a member template. There
3946 should be some partial instantiation of which this is an
3949 for (found
= DECL_TEMPLATE_INSTANTIATIONS (template);
3950 found
; found
= TREE_CHAIN (found
))
3953 tree tmpl
= CLASSTYPE_TI_TEMPLATE (TREE_VALUE (found
));
3955 /* We only want partial instantiations, here, not
3956 specializations or full instantiations. */
3957 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_VALUE (found
))
3958 || !uses_template_parms (TREE_VALUE (found
)))
3961 /* Temporarily reduce by one the number of levels in the
3962 ARGLIST and in FOUND so as to avoid comparing the
3963 last set of arguments. */
3964 TREE_VEC_LENGTH (arglist
)--;
3965 TREE_VEC_LENGTH (TREE_PURPOSE (found
)) --;
3967 /* See if the arguments match. If they do, then TMPL is
3968 the partial instantiation we want. */
3969 success
= comp_template_args (TREE_PURPOSE (found
), arglist
);
3971 /* Restore the argument vectors to their full size. */
3972 TREE_VEC_LENGTH (arglist
)++;
3973 TREE_VEC_LENGTH (TREE_PURPOSE (found
))++;
3983 my_friendly_abort (0);
3986 SET_TYPE_TEMPLATE_INFO (t
,
3987 tree_cons (found
, arglist
, NULL_TREE
));
3988 DECL_TEMPLATE_INSTANTIATIONS (template)
3989 = tree_cons (arglist
, t
,
3990 DECL_TEMPLATE_INSTANTIATIONS (template));
3992 if (TREE_CODE (t
) == ENUMERAL_TYPE
3993 && !is_partial_instantiation
)
3994 /* Now that the type has been registered on the instantiations
3995 list, we set up the enumerators. Because the enumeration
3996 constants may involve the enumeration type itself, we make
3997 sure to register the type first, and then create the
3998 constants. That way, doing tsubst_expr for the enumeration
3999 constants won't result in recursive calls here; we'll find
4000 the instantiation and exit above. */
4001 tsubst_enum (template_type
, t
, arglist
);
4003 /* We're done with the permanent obstack, now. */
4006 /* Reset the name of the type, now that CLASSTYPE_TEMPLATE_INFO
4008 if (TREE_CODE (t
) != ENUMERAL_TYPE
)
4009 DECL_NAME (type_decl
) = classtype_mangled_name (t
);
4010 DECL_ASSEMBLER_NAME (type_decl
) = DECL_NAME (type_decl
);
4011 if (!is_partial_instantiation
)
4013 DECL_ASSEMBLER_NAME (type_decl
)
4014 = get_identifier (build_overload_name (t
, 1, 1));
4016 /* For backwards compatibility; code that uses
4017 -fexternal-templates expects looking up a template to
4018 instantiate it. I think DDD still relies on this.
4019 (jason 8/20/1998) */
4020 if (TREE_CODE (t
) != ENUMERAL_TYPE
4021 && flag_external_templates
4022 && CLASSTYPE_INTERFACE_KNOWN (TREE_TYPE (template))
4023 && ! CLASSTYPE_INTERFACE_ONLY (TREE_TYPE (template)))
4024 add_pending_template (t
);
4027 /* If the type makes use of template parameters, the
4028 code that generates debugging information will crash. */
4029 DECL_IGNORED_P (TYPE_STUB_DECL (t
)) = 1;
4035 /* For each TEMPLATE_TYPE_PARM, TEMPLATE_TEMPLATE_PARM, or
4036 TEMPLATE_PARM_INDEX in T, call FN with the parameter and the DATA.
4037 If FN returns non-zero, the iteration is terminated, and
4038 for_each_template_parm returns 1. Otherwise, the iteration
4039 continues. If FN never returns a non-zero value, the value
4040 returned by for_each_template_parm is 0. If FN is NULL, it is
4041 considered to be the function which always returns 1. */
4044 for_each_template_parm (t
, fn
, data
)
4052 if (TREE_CODE_CLASS (TREE_CODE (t
)) == 't'
4053 && for_each_template_parm (TYPE_CONTEXT (t
), fn
, data
))
4056 switch (TREE_CODE (t
))
4060 return (for_each_template_parm (TREE_OPERAND (t
, 0), fn
, data
)
4061 || for_each_template_parm (TREE_OPERAND (t
, 1), fn
, data
));
4063 case IDENTIFIER_NODE
:
4064 if (!IDENTIFIER_TEMPLATE (t
))
4066 my_friendly_abort (42);
4068 /* aggregates of tree nodes */
4071 int i
= TREE_VEC_LENGTH (t
);
4073 if (for_each_template_parm (TREE_VEC_ELT (t
, i
), fn
, data
))
4078 if (for_each_template_parm (TREE_PURPOSE (t
), fn
, data
)
4079 || for_each_template_parm (TREE_VALUE (t
), fn
, data
))
4081 return for_each_template_parm (TREE_CHAIN (t
), fn
, data
);
4084 if (for_each_template_parm (OVL_FUNCTION (t
), fn
, data
))
4086 return for_each_template_parm (OVL_CHAIN (t
), fn
, data
);
4088 /* constructed type nodes */
4090 case REFERENCE_TYPE
:
4091 return for_each_template_parm (TREE_TYPE (t
), fn
, data
);
4094 if (TYPE_PTRMEMFUNC_FLAG (t
))
4095 return for_each_template_parm (TYPE_PTRMEMFUNC_FN_TYPE (t
),
4101 if (! TYPE_TEMPLATE_INFO (t
))
4103 return for_each_template_parm (TREE_VALUE
4104 (TYPE_TEMPLATE_INFO (t
)),
4107 if (for_each_template_parm (TYPE_METHOD_BASETYPE (t
), fn
, data
))
4112 /* Check the parameter types. Since default arguments are not
4113 instantiated until they are needed, the TYPE_ARG_TYPES may
4114 contain expressions that involve template parameters. But,
4115 no-one should be looking at them yet. And, once they're
4116 instantiated, they don't contain template parameters, so
4117 there's no point in looking at them then, either. */
4121 for (parm
= TYPE_ARG_TYPES (t
); parm
; parm
= TREE_CHAIN (parm
))
4122 if (for_each_template_parm (TREE_VALUE (parm
), fn
, data
))
4126 /* Check the return type, too. */
4127 return for_each_template_parm (TREE_TYPE (t
), fn
, data
);
4130 if (for_each_template_parm (TYPE_DOMAIN (t
), fn
, data
))
4132 return for_each_template_parm (TREE_TYPE (t
), fn
, data
);
4134 if (for_each_template_parm (TYPE_OFFSET_BASETYPE (t
), fn
, data
))
4136 return for_each_template_parm (TREE_TYPE (t
), fn
, data
);
4140 return for_each_template_parm (TREE_TYPE (t
), fn
, data
);
4143 /* A template template parameter is encountered */
4144 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
4145 return for_each_template_parm (TREE_TYPE (t
), fn
, data
);
4146 /* Already substituted template template parameter */
4150 if (for_each_template_parm (DECL_INITIAL (t
), fn
, data
))
4152 goto check_type_and_context
;
4156 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
)
4157 && for_each_template_parm (DECL_TI_ARGS (t
), fn
, data
))
4161 check_type_and_context
:
4162 if (for_each_template_parm (TREE_TYPE (t
), fn
, data
))
4164 if (DECL_CONTEXT (t
)
4165 && for_each_template_parm (DECL_CONTEXT (t
), fn
, data
))
4170 return (for_each_template_parm (TREE_OPERAND (t
, 0), fn
, data
)
4171 || for_each_template_parm (TREE_OPERAND (t
, 1), fn
, data
));
4174 return for_each_template_parm (TREE_OPERAND (t
, 0), fn
, data
);
4176 /* template parm nodes */
4177 case TEMPLATE_TEMPLATE_PARM
:
4178 /* Record template parameters such as `T' inside `TT<T>'. */
4179 if (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t
)
4180 && for_each_template_parm (TYPE_TI_ARGS (t
), fn
, data
))
4182 case TEMPLATE_TYPE_PARM
:
4183 case TEMPLATE_PARM_INDEX
:
4185 return (*fn
)(t
, data
);
4189 /* simple type nodes */
4191 if (for_each_template_parm (TYPE_MIN_VALUE (t
), fn
, data
))
4193 return for_each_template_parm (TYPE_MAX_VALUE (t
), fn
, data
);
4199 case NAMESPACE_DECL
:
4210 /* Non-error_mark_node ERROR_MARKs are bad things. */
4211 my_friendly_assert (t
== error_mark_node
, 274);
4216 return for_each_template_parm (TREE_TYPE (t
), fn
, data
);
4219 return for_each_template_parm (TREE_OPERAND (t
, 0), fn
, data
);
4222 if (TREE_TYPE (t
) && TYPE_PTRMEMFUNC_P (TREE_TYPE (t
)))
4223 return for_each_template_parm (TYPE_PTRMEMFUNC_FN_TYPE
4224 (TREE_TYPE (t
)), fn
, data
);
4225 return for_each_template_parm (TREE_OPERAND (t
, 1), fn
, data
);
4229 return for_each_template_parm (TREE_OPERAND (t
, 0), fn
, data
);
4234 return (for_each_template_parm (TYPE_CONTEXT (t
), fn
, data
)
4235 || for_each_template_parm (TYPENAME_TYPE_FULLNAME (t
),
4240 /* If there's no type, then this thing must be some expression
4241 involving template parameters. */
4242 if (!fn
&& !TREE_TYPE (t
))
4244 if (TREE_CODE (t
) == COMPONENT_REF
)
4245 return (for_each_template_parm (TREE_OPERAND (t
, 0), fn
, data
)
4246 || for_each_template_parm (TREE_OPERAND (t
, 1), fn
, data
));
4248 return for_each_template_parm (TREE_OPERAND (t
, 0), fn
, data
);
4252 case REINTERPRET_CAST_EXPR
:
4253 case CONST_CAST_EXPR
:
4254 case STATIC_CAST_EXPR
:
4255 case DYNAMIC_CAST_EXPR
:
4260 case PSEUDO_DTOR_EXPR
:
4266 switch (TREE_CODE_CLASS (TREE_CODE (t
)))
4274 for (i
= first_rtl_op (TREE_CODE (t
)); --i
>= 0;)
4275 if (for_each_template_parm (TREE_OPERAND (t
, i
), fn
, data
))
4282 sorry ("testing %s for template parms",
4283 tree_code_name
[(int) TREE_CODE (t
)]);
4284 my_friendly_abort (82);
4291 uses_template_parms (t
)
4294 return for_each_template_parm (t
, 0, 0);
4297 static struct tinst_level
*current_tinst_level
;
4298 static struct tinst_level
*free_tinst_level
;
4299 static int tinst_depth
;
4300 extern int max_tinst_depth
;
4301 #ifdef GATHER_STATISTICS
4304 int tinst_level_tick
;
4305 int last_template_error_tick
;
4307 /* Print out all the template instantiations that we are currently
4308 working on. If ERR, we are being called from cp_thing, so do
4309 the right thing for an error message. */
4312 print_template_context (err
)
4315 struct tinst_level
*p
= current_tinst_level
;
4317 char *file
= input_filename
;
4321 if (current_function_decl
!= p
->decl
4322 && current_function_decl
!= NULL_TREE
)
4323 /* We can get here during the processing of some synthesized
4324 method. Then, p->decl will be the function that's causing
4329 if (current_function_decl
== p
->decl
)
4330 /* Avoid redundancy with the the "In function" line. */;
4332 fprintf (stderr
, "%s: In instantiation of `%s':\n",
4333 file
, decl_as_string (p
->decl
, TS_DECL_TYPE
| TS_FUNC_NORETURN
));
4341 for (; p
; p
= p
->next
)
4343 fprintf (stderr
, "%s:%d: instantiated from `%s'\n", file
, line
,
4344 decl_as_string (p
->decl
, TS_DECL_TYPE
| TS_FUNC_NORETURN
));
4348 fprintf (stderr
, "%s:%d: instantiated from here\n", file
, line
);
4351 /* Called from cp_thing to print the template context for an error. */
4354 maybe_print_template_context ()
4356 if (last_template_error_tick
== tinst_level_tick
4357 || current_tinst_level
== 0)
4360 last_template_error_tick
= tinst_level_tick
;
4361 print_template_context (1);
4365 push_tinst_level (d
)
4368 struct tinst_level
*new;
4370 if (tinst_depth
>= max_tinst_depth
)
4372 /* If the instantiation in question still has unbound template parms,
4373 we don't really care if we can't instantiate it, so just return.
4374 This happens with base instantiation for implicit `typename'. */
4375 if (uses_template_parms (d
))
4378 last_template_error_tick
= tinst_level_tick
;
4379 error ("template instantiation depth exceeds maximum of %d",
4381 error (" (use -ftemplate-depth-NN to increase the maximum)");
4382 cp_error (" instantiating `%D'", d
);
4384 print_template_context (0);
4389 if (free_tinst_level
)
4391 new = free_tinst_level
;
4392 free_tinst_level
= new->next
;
4395 new = (struct tinst_level
*) xmalloc (sizeof (struct tinst_level
));
4399 new->file
= input_filename
;
4400 new->next
= current_tinst_level
;
4401 current_tinst_level
= new;
4404 #ifdef GATHER_STATISTICS
4405 if (tinst_depth
> depth_reached
)
4406 depth_reached
= tinst_depth
;
4416 struct tinst_level
*old
= current_tinst_level
;
4418 /* Restore the filename and line number stashed away when we started
4419 this instantiation. */
4421 input_filename
= old
->file
;
4422 extract_interface_info ();
4424 current_tinst_level
= old
->next
;
4425 old
->next
= free_tinst_level
;
4426 free_tinst_level
= old
;
4431 struct tinst_level
*
4434 struct tinst_level
*p
= current_tinst_level
;
4437 for (; p
->next
; p
= p
->next
)
4442 /* DECL is a friend FUNCTION_DECL or TEMPLATE_DECL. ARGS is the
4443 vector of template arguments, as for tsubst.
4445 Returns an appropriate tsbust'd friend declaration. */
4448 tsubst_friend_function (decl
, args
)
4454 char *file
= input_filename
;
4456 lineno
= DECL_SOURCE_LINE (decl
);
4457 input_filename
= DECL_SOURCE_FILE (decl
);
4459 if (TREE_CODE (decl
) == FUNCTION_DECL
4460 && DECL_TEMPLATE_INSTANTIATION (decl
)
4461 && TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
4462 /* This was a friend declared with an explicit template
4463 argument list, e.g.:
4467 to indicate that f was a template instantiation, not a new
4468 function declaration. Now, we have to figure out what
4469 instantiation of what template. */
4476 = lookup_template_function (tsubst_expr (DECL_TI_TEMPLATE (decl
),
4477 args
, /*complain=*/1,
4479 tsubst (DECL_TI_ARGS (decl
),
4480 args
, /*complain=*/1,
4482 new_friend
= tsubst (decl
, args
, /*complain=*/1, NULL_TREE
);
4483 tmpl
= determine_specialization (template_id
, new_friend
,
4485 /*need_member_template=*/0);
4486 new_friend
= instantiate_template (tmpl
, new_args
);
4490 new_friend
= tsubst (decl
, args
, /*complain=*/1, NULL_TREE
);
4492 /* The NEW_FRIEND will look like an instantiation, to the
4493 compiler, but is not an instantiation from the point of view of
4494 the language. For example, we might have had:
4496 template <class T> struct S {
4497 template <class U> friend void f(T, U);
4500 Then, in S<int>, template <class U> void f(int, U) is not an
4501 instantiation of anything. */
4502 DECL_USE_TEMPLATE (new_friend
) = 0;
4503 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
4504 DECL_USE_TEMPLATE (DECL_TEMPLATE_RESULT (new_friend
)) = 0;
4506 /* The mangled name for the NEW_FRIEND is incorrect. The call to
4507 tsubst will have resulted in a call to
4508 set_mangled_name_for_template_decl. But, the function is not a
4509 template instantiation and should not be mangled like one.
4510 Therefore, we remangle the function name. We don't have to do
4511 this if the NEW_FRIEND is a template since
4512 set_mangled_name_for_template_decl doesn't do anything if the
4513 function declaration still uses template arguments. */
4514 if (TREE_CODE (new_friend
) != TEMPLATE_DECL
)
4516 set_mangled_name_for_decl (new_friend
);
4517 DECL_RTL (new_friend
) = 0;
4518 make_decl_rtl (new_friend
, NULL_PTR
, 1);
4521 if (DECL_NAMESPACE_SCOPE_P (new_friend
))
4524 tree new_friend_template_info
;
4525 tree new_friend_result_template_info
;
4527 int new_friend_is_defn
;
4529 /* We must save some information from NEW_FRIEND before calling
4530 duplicate decls since that function will free NEW_FRIEND if
4532 new_friend_template_info
= DECL_TEMPLATE_INFO (new_friend
);
4533 if (TREE_CODE (new_friend
) == TEMPLATE_DECL
)
4535 /* This declaration is a `primary' template. */
4536 DECL_PRIMARY_TEMPLATE (new_friend
) = new_friend
;
4539 = DECL_INITIAL (DECL_RESULT (new_friend
)) != NULL_TREE
;
4540 new_friend_result_template_info
4541 = DECL_TEMPLATE_INFO (DECL_RESULT (new_friend
));
4545 new_friend_is_defn
= DECL_INITIAL (new_friend
) != NULL_TREE
;
4546 new_friend_result_template_info
= NULL_TREE
;
4549 /* Inside pushdecl_namespace_level, we will push into the
4550 current namespace. However, the friend function should
4551 tyically go into the namespace of the template. */
4552 ns
= decl_namespace_context (new_friend
);
4553 push_nested_namespace (ns
);
4554 old_decl
= pushdecl_namespace_level (new_friend
);
4555 pop_nested_namespace (ns
);
4557 if (old_decl
!= new_friend
)
4559 /* This new friend declaration matched an existing
4560 declaration. For example, given:
4562 template <class T> void f(T);
4563 template <class U> class C {
4564 template <class T> friend void f(T) {}
4567 the friend declaration actually provides the definition
4568 of `f', once C has been instantiated for some type. So,
4569 old_decl will be the out-of-class template declaration,
4570 while new_friend is the in-class definition.
4572 But, if `f' was called before this point, the
4573 instantiation of `f' will have DECL_TI_ARGS corresponding
4574 to `T' but not to `U', references to which might appear
4575 in the definition of `f'. Previously, the most general
4576 template for an instantiation of `f' was the out-of-class
4577 version; now it is the in-class version. Therefore, we
4578 run through all specialization of `f', adding to their
4579 DECL_TI_ARGS appropriately. In particular, they need a
4580 new set of outer arguments, corresponding to the
4581 arguments for this class instantiation.
4583 The same situation can arise with something like this:
4586 template <class T> class C {
4590 when `C<int>' is instantiated. Now, `f(int)' is defined
4593 if (!new_friend_is_defn
)
4594 /* On the other hand, if the in-class declaration does
4595 *not* provide a definition, then we don't want to alter
4596 existing definitions. We can just leave everything
4601 /* Overwrite whatever template info was there before, if
4602 any, with the new template information pertaining to
4604 DECL_TEMPLATE_INFO (old_decl
) = new_friend_template_info
;
4606 if (TREE_CODE (old_decl
) != TEMPLATE_DECL
)
4607 /* duplicate_decls will take care of this case. */
4612 tree new_friend_args
;
4614 DECL_TEMPLATE_INFO (DECL_RESULT (old_decl
))
4615 = new_friend_result_template_info
;
4617 new_friend_args
= TI_ARGS (new_friend_template_info
);
4618 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (old_decl
);
4622 tree spec
= TREE_VALUE (t
);
4625 = add_outermost_template_args (new_friend_args
,
4626 DECL_TI_ARGS (spec
));
4629 /* Now, since specializations are always supposed to
4630 hang off of the most general template, we must move
4632 t
= most_general_template (old_decl
);
4635 DECL_TEMPLATE_SPECIALIZATIONS (t
)
4636 = chainon (DECL_TEMPLATE_SPECIALIZATIONS (t
),
4637 DECL_TEMPLATE_SPECIALIZATIONS (old_decl
));
4638 DECL_TEMPLATE_SPECIALIZATIONS (old_decl
) = NULL_TREE
;
4643 /* The information from NEW_FRIEND has been merged into OLD_DECL
4644 by duplicate_decls. */
4645 new_friend
= old_decl
;
4648 else if (TYPE_SIZE (DECL_CONTEXT (new_friend
)))
4650 /* Check to see that the declaration is really present, and,
4651 possibly obtain an improved declaration. */
4652 tree fn
= check_classfn (DECL_CONTEXT (new_friend
),
4661 input_filename
= file
;
4665 /* FRIEND_TMPL is a friend TEMPLATE_DECL. ARGS is the vector of
4666 template arguments, as for tsubst.
4668 Returns an appropriate tsbust'd friend type. */
4671 tsubst_friend_class (friend_tmpl
, args
)
4678 /* First, we look for a class template. */
4679 tmpl
= lookup_name (DECL_NAME (friend_tmpl
), /*prefer_type=*/0);
4681 /* But, if we don't find one, it might be because we're in a
4682 situation like this:
4690 Here, in the scope of (say) S<int>, `S' is bound to a TYPE_DECL
4691 for `S<int>', not the TEMPLATE_DECL. */
4692 if (!tmpl
|| !DECL_CLASS_TEMPLATE_P (tmpl
))
4694 tmpl
= lookup_name (DECL_NAME (friend_tmpl
), /*prefer_type=*/1);
4695 tmpl
= maybe_get_template_decl_from_type_decl (tmpl
);
4698 if (tmpl
&& DECL_CLASS_TEMPLATE_P (tmpl
))
4700 /* The friend template has already been declared. Just
4701 check to see that the declarations match, and install any new
4702 default parameters. We must tsubst the default parameters,
4703 of course. We only need the innermost template parameters
4704 because that is all that redeclare_class_template will look
4707 = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_tmpl
),
4708 args
, /*complain=*/1);
4709 redeclare_class_template (TREE_TYPE (tmpl
), parms
);
4710 friend_type
= TREE_TYPE (tmpl
);
4714 /* The friend template has not already been declared. In this
4715 case, the instantiation of the template class will cause the
4716 injection of this template into the global scope. */
4717 tmpl
= tsubst (friend_tmpl
, args
, /*complain=*/1, NULL_TREE
);
4719 /* The new TMPL is not an instantiation of anything, so we
4720 forget its origins. We don't reset CLASSTYPE_TI_TEMPLATE for
4721 the new type because that is supposed to be the corresponding
4722 template decl, i.e., TMPL. */
4723 DECL_USE_TEMPLATE (tmpl
) = 0;
4724 DECL_TEMPLATE_INFO (tmpl
) = NULL_TREE
;
4725 CLASSTYPE_USE_TEMPLATE (TREE_TYPE (tmpl
)) = 0;
4727 /* Inject this template into the global scope. */
4728 friend_type
= TREE_TYPE (pushdecl_top_level (tmpl
));
4735 instantiate_class_template (type
)
4738 tree
template, args
, pattern
, t
;
4741 if (type
== error_mark_node
)
4742 return error_mark_node
;
4744 if (TYPE_BEING_DEFINED (type
) || TYPE_SIZE (type
))
4747 /* Figure out which template is being instantiated. */
4748 template = most_general_template (CLASSTYPE_TI_TEMPLATE (type
));
4749 my_friendly_assert (TREE_CODE (template) == TEMPLATE_DECL
, 279);
4751 /* Figure out which arguments are being used to do the
4753 args
= CLASSTYPE_TI_ARGS (type
);
4754 PARTIAL_INSTANTIATION_P (type
) = uses_template_parms (args
);
4756 if (pedantic
&& PARTIAL_INSTANTIATION_P (type
))
4757 /* If this is a partial instantiation, then we can't instantiate
4758 the type; there's no telling whether or not one of the
4759 template parameters might eventually be instantiated to some
4760 value that results in a specialization being used. For
4772 Now, the `S<U>' in `f<int>' is the specialization, not an
4773 instantiation of the original template. */
4776 /* Determine what specialization of the original template to
4778 if (PARTIAL_INSTANTIATION_P (type
))
4779 /* There's no telling which specialization is appropriate at this
4780 point. Since all peeking at the innards of this partial
4781 instantiation are extensions (like the "implicit typename"
4782 extension, which allows users to omit the keyword `typename' on
4783 names that are declared as types in template base classes), we
4784 are free to do what we please.
4786 Trying to figure out which partial instantiation to use can
4787 cause a crash. (Some of the template arguments don't even have
4788 types.) So, we just use the most general version. */
4792 t
= most_specialized_class (template, args
);
4794 if (t
== error_mark_node
)
4796 const char *str
= "candidates are:";
4797 cp_error ("ambiguous class template instantiation for `%#T'", type
);
4798 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (template); t
;
4801 if (get_class_bindings (TREE_VALUE (t
), TREE_PURPOSE (t
),
4804 cp_error_at ("%s %+#T", str
, TREE_TYPE (t
));
4808 TYPE_BEING_DEFINED (type
) = 1;
4809 return error_mark_node
;
4814 pattern
= TREE_TYPE (t
);
4816 pattern
= TREE_TYPE (template);
4818 /* If the template we're instantiating is incomplete, then clearly
4819 there's nothing we can do. */
4820 if (TYPE_SIZE (pattern
) == NULL_TREE
)
4823 /* If this is a partial instantiation, don't tsubst anything. We will
4824 only use this type for implicit typename, so the actual contents don't
4825 matter. All that matters is whether a particular name is a type. */
4826 if (PARTIAL_INSTANTIATION_P (type
))
4828 /* The fields set here must be kept in sync with those cleared
4829 in begin_class_definition. */
4830 TYPE_BINFO_BASETYPES (type
) = TYPE_BINFO_BASETYPES (pattern
);
4831 TYPE_FIELDS (type
) = TYPE_FIELDS (pattern
);
4832 TYPE_METHODS (type
) = TYPE_METHODS (pattern
);
4833 CLASSTYPE_TAGS (type
) = CLASSTYPE_TAGS (pattern
);
4834 /* Pretend that the type is complete, so that we will look
4835 inside it during name lookup and such. */
4836 TYPE_SIZE (type
) = integer_zero_node
;
4840 /* If we've recursively instantiated too many templates, stop. */
4841 if (! push_tinst_level (type
))
4844 /* Now we're really doing the instantiation. Mark the type as in
4845 the process of being defined. */
4846 TYPE_BEING_DEFINED (type
) = 1;
4848 maybe_push_to_top_level (uses_template_parms (type
));
4852 /* This TYPE is actually a instantiation of of a partial
4853 specialization. We replace the innermost set of ARGS with
4854 the arguments appropriate for substitution. For example,
4857 template <class T> struct S {};
4858 template <class T> struct S<T*> {};
4860 and supposing that we are instantiating S<int*>, ARGS will
4861 present be {int*} but we need {int}. */
4863 = get_class_bindings (TREE_VALUE (t
), TREE_PURPOSE (t
),
4866 /* If there were multiple levels in ARGS, replacing the
4867 innermost level would alter CLASSTYPE_TI_ARGS, which we don't
4868 want, so we make a copy first. */
4869 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
4871 args
= copy_node (args
);
4872 SET_TMPL_ARGS_LEVEL (args
, TMPL_ARGS_DEPTH (args
), inner_args
);
4878 if (flag_external_templates
)
4880 if (flag_alt_external_templates
)
4882 CLASSTYPE_INTERFACE_ONLY (type
) = interface_only
;
4883 SET_CLASSTYPE_INTERFACE_UNKNOWN_X (type
, interface_unknown
);
4884 CLASSTYPE_VTABLE_NEEDS_WRITING (type
)
4885 = (! CLASSTYPE_INTERFACE_ONLY (type
)
4886 && CLASSTYPE_INTERFACE_KNOWN (type
));
4890 CLASSTYPE_INTERFACE_ONLY (type
) = CLASSTYPE_INTERFACE_ONLY (pattern
);
4891 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
4892 (type
, CLASSTYPE_INTERFACE_UNKNOWN (pattern
));
4893 CLASSTYPE_VTABLE_NEEDS_WRITING (type
)
4894 = (! CLASSTYPE_INTERFACE_ONLY (type
)
4895 && CLASSTYPE_INTERFACE_KNOWN (type
));
4900 SET_CLASSTYPE_INTERFACE_UNKNOWN (type
);
4901 CLASSTYPE_VTABLE_NEEDS_WRITING (type
) = 1;
4904 TYPE_HAS_CONSTRUCTOR (type
) = TYPE_HAS_CONSTRUCTOR (pattern
);
4905 TYPE_HAS_DESTRUCTOR (type
) = TYPE_HAS_DESTRUCTOR (pattern
);
4906 TYPE_OVERLOADS_CALL_EXPR (type
) = TYPE_OVERLOADS_CALL_EXPR (pattern
);
4907 TYPE_OVERLOADS_ARRAY_REF (type
) = TYPE_OVERLOADS_ARRAY_REF (pattern
);
4908 TYPE_OVERLOADS_ARROW (type
) = TYPE_OVERLOADS_ARROW (pattern
);
4909 TYPE_GETS_NEW (type
) = TYPE_GETS_NEW (pattern
);
4910 TYPE_GETS_DELETE (type
) = TYPE_GETS_DELETE (pattern
);
4911 TYPE_VEC_DELETE_TAKES_SIZE (type
) = TYPE_VEC_DELETE_TAKES_SIZE (pattern
);
4912 TYPE_HAS_ASSIGN_REF (type
) = TYPE_HAS_ASSIGN_REF (pattern
);
4913 TYPE_HAS_CONST_ASSIGN_REF (type
) = TYPE_HAS_CONST_ASSIGN_REF (pattern
);
4914 TYPE_HAS_ABSTRACT_ASSIGN_REF (type
) = TYPE_HAS_ABSTRACT_ASSIGN_REF (pattern
);
4915 TYPE_HAS_INIT_REF (type
) = TYPE_HAS_INIT_REF (pattern
);
4916 TYPE_HAS_CONST_INIT_REF (type
) = TYPE_HAS_CONST_INIT_REF (pattern
);
4917 TYPE_HAS_DEFAULT_CONSTRUCTOR (type
) = TYPE_HAS_DEFAULT_CONSTRUCTOR (pattern
);
4918 TYPE_HAS_CONVERSION (type
) = TYPE_HAS_CONVERSION (pattern
);
4919 TYPE_USES_COMPLEX_INHERITANCE (type
)
4920 = TYPE_USES_COMPLEX_INHERITANCE (pattern
);
4921 TYPE_USES_MULTIPLE_INHERITANCE (type
)
4922 = TYPE_USES_MULTIPLE_INHERITANCE (pattern
);
4923 TYPE_USES_VIRTUAL_BASECLASSES (type
)
4924 = TYPE_USES_VIRTUAL_BASECLASSES (pattern
);
4925 TYPE_PACKED (type
) = TYPE_PACKED (pattern
);
4926 TYPE_ALIGN (type
) = TYPE_ALIGN (pattern
);
4927 TYPE_FOR_JAVA (type
) = TYPE_FOR_JAVA (pattern
); /* For libjava's JArray<T> */
4928 if (ANON_AGGR_TYPE_P (pattern
))
4929 SET_ANON_AGGR_TYPE_P (type
);
4931 if (TYPE_BINFO_BASETYPES (pattern
))
4933 tree base_list
= NULL_TREE
;
4934 tree pbases
= TYPE_BINFO_BASETYPES (pattern
);
4937 /* Substitute into each of the bases to determine the actual
4939 for (i
= 0; i
< TREE_VEC_LENGTH (pbases
); ++i
)
4945 pbase
= TREE_VEC_ELT (pbases
, i
);
4947 /* Substitue to figure out the base class. */
4948 base
= tsubst (BINFO_TYPE (pbase
), args
,
4949 /*complain=*/1, NULL_TREE
);
4950 if (base
== error_mark_node
)
4953 /* Calculate the correct access node. */
4954 if (TREE_VIA_VIRTUAL (pbase
))
4956 if (TREE_VIA_PUBLIC (pbase
))
4957 access
= access_public_virtual_node
;
4958 else if (TREE_VIA_PROTECTED (pbase
))
4959 access
= access_protected_virtual_node
;
4961 access
= access_private_virtual_node
;
4965 if (TREE_VIA_PUBLIC (pbase
))
4966 access
= access_public_node
;
4967 else if (TREE_VIA_PROTECTED (pbase
))
4968 access
= access_protected_node
;
4970 access
= access_private_node
;
4973 base_list
= tree_cons (access
, base
, base_list
);
4976 /* The list is now in reverse order; correct that. */
4977 base_list
= nreverse (base_list
);
4979 /* Now call xref_basetypes to set up all the base-class
4981 xref_basetypes (TREE_CODE (pattern
) == RECORD_TYPE
4982 ? (CLASSTYPE_DECLARED_CLASS (pattern
)
4983 ? class_type_node
: record_type_node
)
4985 DECL_NAME (TYPE_NAME (pattern
)),
4990 /* Now that our base classes are set up, enter the scope of the
4991 class, so that name lookups into base classes, etc. will work
4992 corectly. This is precisely analagous to what we do in
4993 begin_class_definition when defining an ordinary non-template
4995 pushclass (type
, 1);
4997 for (t
= CLASSTYPE_TAGS (pattern
); t
; t
= TREE_CHAIN (t
))
4999 tree tag
= TREE_VALUE (t
);
5000 tree name
= TYPE_IDENTIFIER (tag
);
5003 newtag
= tsubst (tag
, args
, /*complain=*/1, NULL_TREE
);
5004 if (TREE_CODE (newtag
) != ENUMERAL_TYPE
)
5006 if (TYPE_LANG_SPECIFIC (tag
) && CLASSTYPE_IS_TEMPLATE (tag
))
5007 /* Unfortunately, lookup_template_class sets
5008 CLASSTYPE_IMPLICIT_INSTANTIATION for a partial
5009 instantiation (i.e., for the type of a member template
5010 class nested within a template class.) This behavior is
5011 required for maybe_process_partial_specialization to work
5012 correctly, but is not accurate in this case; the TAG is not
5013 an instantiation of anything. (The corresponding
5014 TEMPLATE_DECL is an instantiation, but the TYPE is not.) */
5015 CLASSTYPE_USE_TEMPLATE (newtag
) = 0;
5017 /* Now, we call pushtag to put this NEWTAG into the scope of
5018 TYPE. We first set up the IDENTIFIER_TYPE_VALUE to avoid
5019 pushtag calling push_template_decl. We don't have to do
5020 this for enums because it will already have been done in
5023 SET_IDENTIFIER_TYPE_VALUE (name
, newtag
);
5024 pushtag (name
, newtag
, /*globalize=*/0);
5028 /* Don't replace enum constants here. */
5029 for (t
= TYPE_FIELDS (pattern
); t
; t
= TREE_CHAIN (t
))
5030 if (TREE_CODE (t
) != CONST_DECL
)
5034 /* The the file and line for this declaration, to assist in
5035 error message reporting. Since we called push_tinst_level
5036 above, we don't need to restore these. */
5037 lineno
= DECL_SOURCE_LINE (t
);
5038 input_filename
= DECL_SOURCE_FILE (t
);
5040 r
= tsubst (t
, args
, /*complain=*/1, NULL_TREE
);
5041 if (TREE_CODE (r
) == VAR_DECL
)
5045 if (DECL_DEFINED_IN_CLASS_P (r
))
5046 init
= tsubst_expr (DECL_INITIAL (t
), args
,
5047 /*complain=*/1, NULL_TREE
);
5051 finish_static_data_member_decl (r
, init
,
5052 /*asmspec_tree=*/NULL_TREE
,
5056 if (DECL_DEFINED_IN_CLASS_P (r
))
5057 check_static_variable_definition (r
, TREE_TYPE (r
));
5060 /* R will have a TREE_CHAIN if and only if it has already been
5061 processed by finish_member_declaration. This can happen
5062 if, for example, it is a TYPE_DECL for a class-scoped
5063 ENUMERAL_TYPE; such a thing will already have been added to
5064 the field list by tsubst_enum above. */
5065 if (!TREE_CHAIN (r
))
5067 set_current_access_from_decl (r
);
5068 finish_member_declaration (r
);
5072 /* Set up the list (TYPE_METHODS) and vector (CLASSTYPE_METHOD_VEC)
5073 for this instantiation. */
5074 for (t
= TYPE_METHODS (pattern
); t
; t
= TREE_CHAIN (t
))
5076 tree r
= tsubst (t
, args
, /*complain=*/1, NULL_TREE
);
5077 set_current_access_from_decl (r
);
5078 finish_member_declaration (r
);
5081 /* Construct the DECL_FRIENDLIST for the new class type. */
5082 typedecl
= TYPE_MAIN_DECL (type
);
5083 for (t
= DECL_FRIENDLIST (TYPE_MAIN_DECL (pattern
));
5089 for (friends
= TREE_VALUE (t
);
5090 friends
!= NULL_TREE
;
5091 friends
= TREE_CHAIN (friends
))
5092 if (TREE_PURPOSE (friends
) == error_mark_node
)
5094 tsubst_friend_function (TREE_VALUE (friends
),
5098 tsubst_copy (TREE_PURPOSE (t
), args
,
5099 /*complain=*/1, NULL_TREE
),
5100 tsubst (TREE_PURPOSE (friends
), args
,
5101 /*complain=*/1, NULL_TREE
));
5104 for (t
= CLASSTYPE_FRIEND_CLASSES (pattern
);
5108 tree friend_type
= TREE_VALUE (t
);
5109 tree new_friend_type
;
5111 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
5112 new_friend_type
= tsubst_friend_class (friend_type
, args
);
5113 else if (uses_template_parms (friend_type
))
5114 new_friend_type
= tsubst (friend_type
, args
, /*complain=*/1,
5118 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (friend_type
));
5120 /* The call to xref_tag_from_type does injection for friend
5122 push_nested_namespace (ns
);
5124 xref_tag_from_type (friend_type
, NULL_TREE
, 1);
5125 pop_nested_namespace (ns
);
5128 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
5129 /* Trick make_friend_class into realizing that the friend
5130 we're adding is a template, not an ordinary class. It's
5131 important that we use make_friend_class since it will
5132 perform some error-checking and output cross-reference
5134 ++processing_template_decl
;
5136 make_friend_class (type
, new_friend_type
);
5138 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
5139 --processing_template_decl
;
5142 for (t
= TYPE_FIELDS (type
); t
; t
= TREE_CHAIN (t
))
5143 if (TREE_CODE (t
) == FIELD_DECL
)
5145 TREE_TYPE (t
) = complete_type (TREE_TYPE (t
));
5146 require_complete_type (t
);
5149 /* Set the file and line number information to whatever is given for
5150 the class itself. This puts error messages involving generated
5151 implicit functions at a predictable point, and the same point
5152 that would be used for non-template classes. */
5153 lineno
= DECL_SOURCE_LINE (typedecl
);
5154 input_filename
= DECL_SOURCE_FILE (typedecl
);
5156 unreverse_member_declarations (type
);
5157 finish_struct_1 (type
);
5158 CLASSTYPE_GOT_SEMICOLON (type
) = 1;
5160 /* Clear this now so repo_template_used is happy. */
5161 TYPE_BEING_DEFINED (type
) = 0;
5162 repo_template_used (type
);
5164 /* Now that the class is complete, instantiate default arguments for
5165 any member functions. We don't do this earlier because the
5166 default arguments may reference members of the class. */
5167 if (!PRIMARY_TEMPLATE_P (template))
5168 for (t
= TYPE_METHODS (type
); t
; t
= TREE_CHAIN (t
))
5169 if (TREE_CODE (t
) == FUNCTION_DECL
5170 /* Implicitly generated member functions will not have tmplate
5171 information; they are not instantiations, but instead are
5172 created "fresh" for each instantiation. */
5173 && DECL_TEMPLATE_INFO (t
))
5174 tsubst_default_arguments (t
);
5177 pop_from_top_level ();
5187 if (t1
== NULL_TREE
)
5188 return t2
== NULL_TREE
;
5189 if (t2
== NULL_TREE
)
5191 /* Don't care if one declares its arg const and the other doesn't -- the
5192 main variant of the arg type is all that matters. */
5193 if (TYPE_MAIN_VARIANT (TREE_VALUE (t1
))
5194 != TYPE_MAIN_VARIANT (TREE_VALUE (t2
)))
5196 return list_eq (TREE_CHAIN (t1
), TREE_CHAIN (t2
));
5199 /* If arg is a non-type template parameter that does not depend on template
5200 arguments, fold it like we weren't in the body of a template. */
5203 maybe_fold_nontype_arg (arg
)
5206 if (TREE_CODE_CLASS (TREE_CODE (arg
)) != 't'
5207 && !uses_template_parms (arg
))
5209 /* Sometimes, one of the args was an expression involving a
5210 template constant parameter, like N - 1. Now that we've
5211 tsubst'd, we might have something like 2 - 1. This will
5212 confuse lookup_template_class, so we do constant folding
5213 here. We have to unset processing_template_decl, to
5214 fool build_expr_from_tree() into building an actual
5217 int saved_processing_template_decl
= processing_template_decl
;
5218 processing_template_decl
= 0;
5219 arg
= fold (build_expr_from_tree (arg
));
5220 processing_template_decl
= saved_processing_template_decl
;
5225 /* Return the TREE_VEC with the arguments for the innermost template header,
5226 where ARGS is either that or the VEC of VECs for all the
5230 innermost_args (args
)
5233 return TMPL_ARGS_LEVEL (args
, TMPL_ARGS_DEPTH (args
));
5236 /* Substitute ARGS into the vector of template arguments T. */
5239 tsubst_template_arg_vector (t
, args
, complain
)
5244 int len
= TREE_VEC_LENGTH (t
), need_new
= 0, i
;
5245 tree
*elts
= (tree
*) alloca (len
* sizeof (tree
));
5247 bzero ((char *) elts
, len
* sizeof (tree
));
5249 for (i
= 0; i
< len
; i
++)
5251 if (TREE_VEC_ELT (t
, i
) != NULL_TREE
5252 && TREE_CODE (TREE_VEC_ELT (t
, i
)) == TREE_VEC
)
5253 elts
[i
] = tsubst_template_arg_vector (TREE_VEC_ELT (t
, i
),
5256 elts
[i
] = maybe_fold_nontype_arg
5257 (tsubst_expr (TREE_VEC_ELT (t
, i
), args
, complain
,
5260 if (elts
[i
] != TREE_VEC_ELT (t
, i
))
5267 t
= make_tree_vec (len
);
5268 for (i
= 0; i
< len
; i
++)
5269 TREE_VEC_ELT (t
, i
) = elts
[i
];
5274 /* Return the result of substituting ARGS into the template parameters
5275 given by PARMS. If there are m levels of ARGS and m + n levels of
5276 PARMS, then the result will contain n levels of PARMS. For
5277 example, if PARMS is `template <class T> template <class U>
5278 template <T*, U, class V>' and ARGS is {{int}, {double}} then the
5279 result will be `template <int*, double, class V>'. */
5282 tsubst_template_parms (parms
, args
, complain
)
5290 for (new_parms
= &r
;
5291 TMPL_PARMS_DEPTH (parms
) > TMPL_ARGS_DEPTH (args
);
5292 new_parms
= &(TREE_CHAIN (*new_parms
)),
5293 parms
= TREE_CHAIN (parms
))
5296 make_tree_vec (TREE_VEC_LENGTH (TREE_VALUE (parms
)));
5299 for (i
= 0; i
< TREE_VEC_LENGTH (new_vec
); ++i
)
5301 tree default_value
=
5302 TREE_PURPOSE (TREE_VEC_ELT (TREE_VALUE (parms
), i
));
5304 TREE_VALUE (TREE_VEC_ELT (TREE_VALUE (parms
), i
));
5306 TREE_VEC_ELT (new_vec
, i
)
5307 = build_tree_list (tsubst (default_value
, args
, complain
,
5309 tsubst (parm_decl
, args
, complain
,
5314 tree_cons (build_int_2 (0, (TMPL_PARMS_DEPTH (parms
)
5315 - TMPL_ARGS_DEPTH (args
))),
5316 new_vec
, NULL_TREE
);
5322 /* Substitute the ARGS into the indicated aggregate (or enumeration)
5323 type T. If T is not an aggregate or enumeration type, it is
5324 handled as if by tsubst. IN_DECL is as for tsubst. If
5325 ENTERING_SCOPE is non-zero, T is the context for a template which
5326 we are presently tsubst'ing. Return the subsituted value. */
5329 tsubst_aggr_type (t
, args
, complain
, in_decl
, entering_scope
)
5339 switch (TREE_CODE (t
))
5342 if (TYPE_PTRMEMFUNC_P (t
))
5344 tree r
= build_ptrmemfunc_type
5345 (tsubst (TYPE_PTRMEMFUNC_FN_TYPE (t
), args
, complain
, in_decl
));
5346 return cp_build_qualified_type_real (r
, TYPE_QUALS (t
),
5350 /* else fall through */
5353 if (TYPE_TEMPLATE_INFO (t
))
5359 /* First, determine the context for the type we are looking
5361 if (TYPE_CONTEXT (t
) != NULL_TREE
)
5362 context
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
,
5364 in_decl
, /*entering_scope=*/1);
5366 context
= NULL_TREE
;
5368 /* Then, figure out what arguments are appropriate for the
5369 type we are trying to find. For example, given:
5371 template <class T> struct S;
5372 template <class T, class U> void f(T, U) { S<U> su; }
5374 and supposing that we are instantiating f<int, double>,
5375 then our ARGS will be {int, double}, but, when looking up
5376 S we only want {double}. */
5377 argvec
= tsubst_template_arg_vector (TYPE_TI_ARGS (t
), args
,
5380 r
= lookup_template_class (t
, argvec
, in_decl
, context
,
5383 return cp_build_qualified_type_real (r
, TYPE_QUALS (t
),
5387 /* This is not a template type, so there's nothing to do. */
5391 return tsubst (t
, args
, complain
, in_decl
);
5395 /* Substitute into the default argument ARG (a default argument for
5396 FN), which has the indicated TYPE. */
5399 tsubst_default_argument (fn
, type
, arg
)
5404 /* This default argument came from a template. Instantiate the
5405 default argument here, not in tsubst. In the case of
5414 we must be careful to do name lookup in the scope of S<T>,
5415 rather than in the current class. */
5416 if (DECL_CLASS_SCOPE_P (fn
))
5417 pushclass (DECL_REAL_CONTEXT (fn
), 2);
5419 arg
= tsubst_expr (arg
, DECL_TI_ARGS (fn
), /*complain=*/1, NULL_TREE
);
5421 if (DECL_CLASS_SCOPE_P (fn
))
5424 /* Make sure the default argument is reasonable. */
5425 arg
= check_default_argument (type
, arg
);
5430 /* Substitute into all the default arguments for FN. */
5433 tsubst_default_arguments (fn
)
5439 tmpl_args
= DECL_TI_ARGS (fn
);
5441 /* If this function is not yet instantiated, we certainly don't need
5442 its default arguments. */
5443 if (uses_template_parms (tmpl_args
))
5446 for (arg
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
5448 arg
= TREE_CHAIN (arg
))
5449 if (TREE_PURPOSE (arg
))
5450 TREE_PURPOSE (arg
) = tsubst_default_argument (fn
,
5452 TREE_PURPOSE (arg
));
5455 /* Substitute the ARGS into the T, which is a _DECL. TYPE is the
5456 (already computed) substitution of ARGS into TREE_TYPE (T), if
5457 appropriate. Return the result of the substitution. IN_DECL is as
5461 tsubst_decl (t
, args
, type
, in_decl
)
5468 char* saved_filename
;
5471 /* Set the filename and linenumber to improve error-reporting. */
5472 saved_lineno
= lineno
;
5473 saved_filename
= input_filename
;
5474 lineno
= DECL_SOURCE_LINE (t
);
5475 input_filename
= DECL_SOURCE_FILE (t
);
5477 switch (TREE_CODE (t
))
5481 /* We can get here when processing a member template function
5482 of a template class. */
5483 tree decl
= DECL_TEMPLATE_RESULT (t
);
5485 int is_template_template_parm
= DECL_TEMPLATE_TEMPLATE_PARM_P (t
);
5487 if (!is_template_template_parm
)
5489 /* We might already have an instance of this template.
5490 The ARGS are for the surrounding class type, so the
5491 full args contain the tsubst'd args for the context,
5492 plus the innermost args from the template decl. */
5493 tree tmpl_args
= DECL_CLASS_TEMPLATE_P (t
)
5494 ? CLASSTYPE_TI_ARGS (TREE_TYPE (t
))
5495 : DECL_TI_ARGS (DECL_RESULT (t
));
5498 full_args
= tsubst_template_arg_vector (tmpl_args
, args
,
5501 /* tsubst_template_arg_vector doesn't copy the vector if
5502 nothing changed. But, *something* should have
5504 my_friendly_assert (full_args
!= tmpl_args
, 0);
5506 spec
= retrieve_specialization (t
, full_args
);
5507 if (spec
!= NULL_TREE
)
5514 /* Make a new template decl. It will be similar to the
5515 original, but will record the current template arguments.
5516 We also create a new function declaration, which is just
5517 like the old one, but points to this new template, rather
5518 than the old one. */
5521 my_friendly_assert (DECL_LANG_SPECIFIC (r
) != 0, 0);
5522 TREE_CHAIN (r
) = NULL_TREE
;
5524 if (is_template_template_parm
)
5526 tree new_decl
= tsubst (decl
, args
, /*complain=*/1, in_decl
);
5527 DECL_RESULT (r
) = new_decl
;
5528 TREE_TYPE (r
) = TREE_TYPE (new_decl
);
5533 = tsubst_aggr_type (DECL_CONTEXT (t
), args
, /*complain=*/1,
5534 in_decl
, /*entering_scope=*/1);
5535 DECL_CLASS_CONTEXT (r
)
5536 = tsubst_aggr_type (DECL_CLASS_CONTEXT (t
), args
,
5537 /*complain=*/1, in_decl
,
5538 /*entering_scope=*/1);
5539 DECL_TEMPLATE_INFO (r
) = build_tree_list (t
, args
);
5541 if (TREE_CODE (decl
) == TYPE_DECL
)
5543 tree new_type
= tsubst (TREE_TYPE (t
), args
,
5544 /*complain=*/1, in_decl
);
5545 TREE_TYPE (r
) = new_type
;
5546 CLASSTYPE_TI_TEMPLATE (new_type
) = r
;
5547 DECL_RESULT (r
) = TYPE_MAIN_DECL (new_type
);
5548 DECL_TI_ARGS (r
) = CLASSTYPE_TI_ARGS (new_type
);
5552 tree new_decl
= tsubst (decl
, args
, /*complain=*/1, in_decl
);
5553 DECL_RESULT (r
) = new_decl
;
5554 DECL_TI_TEMPLATE (new_decl
) = r
;
5555 TREE_TYPE (r
) = TREE_TYPE (new_decl
);
5556 DECL_TI_ARGS (r
) = DECL_TI_ARGS (new_decl
);
5559 SET_DECL_IMPLICIT_INSTANTIATION (r
);
5560 DECL_TEMPLATE_INSTANTIATIONS (r
) = NULL_TREE
;
5561 DECL_TEMPLATE_SPECIALIZATIONS (r
) = NULL_TREE
;
5563 /* The template parameters for this new template are all the
5564 template parameters for the old template, except the
5565 outermost level of parameters. */
5566 DECL_TEMPLATE_PARMS (r
)
5567 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t
), args
,
5570 if (PRIMARY_TEMPLATE_P (t
))
5571 DECL_PRIMARY_TEMPLATE (r
) = r
;
5573 /* We don't partially instantiate partial specializations. */
5574 if (TREE_CODE (decl
) == TYPE_DECL
)
5577 for (spec
= DECL_TEMPLATE_SPECIALIZATIONS (t
);
5579 spec
= TREE_CHAIN (spec
))
5581 /* It helps to consider example here. Consider:
5592 Now, for example, we are instantiating S<int>::f(U u).
5593 We want to make a template:
5598 It will have a specialization, for the case U = int*, of
5602 void S<int>::f<int*>(int*);
5604 This specialization will be an instantiation of
5605 the specialization given in the declaration of S, with
5606 argument list int*. */
5608 tree fn
= TREE_VALUE (spec
);
5612 if (!DECL_TEMPLATE_SPECIALIZATION (fn
))
5613 /* Instantiations are on the same list, but they're of
5614 no concern to us. */
5617 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
5618 /* A full specialization. There's no need to record
5622 spec_args
= tsubst (DECL_TI_ARGS (fn
), args
,
5623 /*complain=*/1, in_decl
);
5624 new_fn
= tsubst (DECL_RESULT (most_general_template (fn
)),
5625 spec_args
, /*complain=*/1, in_decl
);
5626 DECL_TI_TEMPLATE (new_fn
) = fn
;
5627 register_specialization (new_fn
, r
,
5628 innermost_args (spec_args
));
5631 /* Record this partial instantiation. */
5632 register_specialization (r
, t
,
5633 DECL_TI_ARGS (DECL_RESULT (r
)));
5641 tree argvec
= NULL_TREE
;
5648 /* Nobody should be tsubst'ing into non-template functions. */
5649 my_friendly_assert (DECL_TEMPLATE_INFO (t
) != NULL_TREE
, 0);
5651 if (TREE_CODE (DECL_TI_TEMPLATE (t
)) == TEMPLATE_DECL
)
5655 /* Calculate the most general template of which R is a
5656 specialization, and the complete set of arguments used to
5658 gen_tmpl
= most_general_template (DECL_TI_TEMPLATE (t
));
5660 = tsubst_template_arg_vector (DECL_TI_ARGS
5661 (DECL_TEMPLATE_RESULT (gen_tmpl
)),
5662 args
, /*complain=*/1);
5664 /* Check to see if we already have this specialization. */
5665 spec
= retrieve_specialization (gen_tmpl
, argvec
);
5673 /* Here, we deal with the peculiar case:
5675 template <class T> struct S {
5676 template <class U> friend void f();
5678 template <class U> friend void f() {}
5680 template void f<double>();
5682 Here, the ARGS for the instantiation of will be {int,
5683 double}. But, we only need as many ARGS as there are
5684 levels of template parameters in CODE_PATTERN. We are
5685 careful not to get fooled into reducing the ARGS in
5688 template <class T> struct S { template <class U> void f(U); }
5689 template <class T> template <> void S<T>::f(int) {}
5691 which we can spot because the pattern will be a
5692 specialization in this case. */
5693 args_depth
= TMPL_ARGS_DEPTH (args
);
5695 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (t
)));
5696 if (args_depth
> parms_depth
5697 && !DECL_TEMPLATE_SPECIALIZATION (t
))
5699 my_friendly_assert (DECL_FRIEND_P (t
), 0);
5701 if (parms_depth
> 1)
5705 args
= make_tree_vec (parms_depth
);
5706 for (i
= 0; i
< parms_depth
; ++i
)
5707 TREE_VEC_ELT (args
, i
) =
5708 TREE_VEC_ELT (args
, i
+ (args_depth
- parms_depth
));
5711 args
= TREE_VEC_ELT (args
, args_depth
- parms_depth
);
5716 /* This special case arises when we have something like this:
5718 template <class T> struct S {
5719 friend void f<int>(int, double);
5722 Here, the DECL_TI_TEMPLATE for the friend declaration
5723 will be a LOOKUP_EXPR or an IDENTIFIER_NODE. We are
5724 being called from tsubst_friend_function, and we want
5725 only to create a new decl (R) with appropriate types so
5726 that we can call determine_specialization. */
5727 my_friendly_assert ((TREE_CODE (DECL_TI_TEMPLATE (t
))
5729 || (TREE_CODE (DECL_TI_TEMPLATE (t
))
5730 == IDENTIFIER_NODE
), 0);
5731 gen_tmpl
= NULL_TREE
;
5734 if (DECL_CLASS_SCOPE_P (t
))
5736 if (DECL_NAME (t
) == constructor_name (DECL_CONTEXT (t
)))
5740 ctx
= tsubst_aggr_type (DECL_CLASS_CONTEXT (t
), args
,
5742 /*entering_scope=*/1);
5749 type
= tsubst (type
, args
, /*complain=*/1, in_decl
);
5750 if (type
== error_mark_node
)
5751 return error_mark_node
;
5753 /* We do NOT check for matching decls pushed separately at this
5754 point, as they may not represent instantiations of this
5755 template, and in any case are considered separate under the
5756 discrete model. Instead, see add_maybe_template. */
5760 DECL_USE_TEMPLATE (r
) = 0;
5761 TREE_TYPE (r
) = type
;
5764 = tsubst_aggr_type (DECL_CONTEXT (t
), args
, /*complain=*/1, t
,
5765 /*entering_scope=*/1);
5766 DECL_CLASS_CONTEXT (r
) = ctx
;
5768 if (member
&& IDENTIFIER_TYPENAME_P (DECL_NAME (r
)))
5769 /* Type-conversion operator. Reconstruct the name, in
5770 case it's the name of one of the template's parameters. */
5771 DECL_NAME (r
) = build_typename_overload (TREE_TYPE (type
));
5773 DECL_ARGUMENTS (r
) = tsubst (DECL_ARGUMENTS (t
), args
,
5775 DECL_MAIN_VARIANT (r
) = r
;
5776 DECL_RESULT (r
) = NULL_TREE
;
5778 TREE_STATIC (r
) = 0;
5779 TREE_PUBLIC (r
) = TREE_PUBLIC (t
);
5780 DECL_EXTERNAL (r
) = 1;
5781 DECL_INTERFACE_KNOWN (r
) = 0;
5782 DECL_DEFER_OUTPUT (r
) = 0;
5783 TREE_CHAIN (r
) = NULL_TREE
;
5784 DECL_PENDING_INLINE_INFO (r
) = 0;
5785 DECL_PENDING_INLINE_P (r
) = 0;
5788 /* Set up the DECL_TEMPLATE_INFO for R and compute its mangled
5789 name. There's no need to do this in the special friend
5790 case mentioned above where GEN_TMPL is NULL. */
5793 DECL_TEMPLATE_INFO (r
)
5794 = tree_cons (gen_tmpl
, argvec
, NULL_TREE
);
5795 SET_DECL_IMPLICIT_INSTANTIATION (r
);
5796 register_specialization (r
, gen_tmpl
, argvec
);
5798 /* Set the mangled name for R. */
5799 if (DECL_DESTRUCTOR_P (t
))
5800 DECL_ASSEMBLER_NAME (r
) = build_destructor_name (ctx
);
5803 /* Instantiations of template functions must be mangled
5804 specially, in order to conform to 14.5.5.1
5805 [temp.over.link]. */
5806 tree tmpl
= DECL_TI_TEMPLATE (t
);
5808 /* TMPL will be NULL if this is a specialization of a
5809 member function of a template class. */
5810 if (name_mangling_version
< 1
5811 || tmpl
== NULL_TREE
5812 || (member
&& !is_member_template (tmpl
)
5813 && !DECL_TEMPLATE_INFO (tmpl
)))
5814 set_mangled_name_for_decl (r
);
5816 set_mangled_name_for_template_decl (r
);
5820 make_decl_rtl (r
, NULL_PTR
, 1);
5822 /* Like grokfndecl. If we don't do this, pushdecl will
5823 mess up our TREE_CHAIN because it doesn't find a
5824 previous decl. Sigh. */
5826 && ! uses_template_parms (r
)
5827 && (IDENTIFIER_GLOBAL_VALUE (DECL_ASSEMBLER_NAME (r
))
5829 SET_IDENTIFIER_GLOBAL_VALUE (DECL_ASSEMBLER_NAME (r
), r
);
5831 /* We're not supposed to instantiate default arguments
5832 until they are called, for a template. But, for a
5835 template <class T> void f ()
5836 { extern void g(int i = T()); }
5838 we should do the substitution when the template is
5839 instantiated. We handle the member function case in
5840 instantiate_class_template since the default arguments
5841 might refer to other members of the class. */
5843 && !PRIMARY_TEMPLATE_P (gen_tmpl
)
5844 && !uses_template_parms (argvec
))
5845 tsubst_default_arguments (r
);
5848 /* Copy the list of befriending classes. */
5849 for (friends
= &DECL_BEFRIENDING_CLASSES (r
);
5851 friends
= &TREE_CHAIN (*friends
))
5853 *friends
= copy_node (*friends
);
5854 TREE_VALUE (*friends
) = tsubst (TREE_VALUE (*friends
),
5855 args
, /*complain=*/1,
5859 if (DECL_CONSTRUCTOR_P (r
))
5861 maybe_retrofit_in_chrg (r
);
5862 grok_ctor_properties (ctx
, r
);
5864 else if (DECL_OVERLOADED_OPERATOR_P (r
))
5865 grok_op_properties (r
, DECL_VIRTUAL_P (r
), DECL_FRIEND_P (r
));
5872 TREE_TYPE (r
) = type
;
5873 c_apply_type_quals_to_decl (CP_TYPE_QUALS (type
), r
);
5875 if (TREE_CODE (DECL_INITIAL (r
)) != TEMPLATE_PARM_INDEX
)
5876 DECL_INITIAL (r
) = TREE_TYPE (r
);
5878 DECL_INITIAL (r
) = tsubst (DECL_INITIAL (r
), args
,
5879 /*complain=*/1, in_decl
);
5881 DECL_CONTEXT (r
) = NULL_TREE
;
5882 if (PROMOTE_PROTOTYPES
5883 && (TREE_CODE (type
) == INTEGER_TYPE
5884 || TREE_CODE (type
) == ENUMERAL_TYPE
)
5885 && TYPE_PRECISION (type
) < TYPE_PRECISION (integer_type_node
))
5886 DECL_ARG_TYPE (r
) = integer_type_node
;
5888 TREE_CHAIN (r
) = tsubst (TREE_CHAIN (t
), args
,
5889 /*complain=*/1, TREE_CHAIN (t
));
5897 TREE_TYPE (r
) = type
;
5898 c_apply_type_quals_to_decl (CP_TYPE_QUALS (type
), r
);
5900 /* We don't have to set DECL_CONTEXT here; it is set by
5901 finish_member_declaration. */
5902 DECL_INITIAL (r
) = tsubst_expr (DECL_INITIAL (t
), args
,
5903 /*complain=*/1, in_decl
);
5904 TREE_CHAIN (r
) = NULL_TREE
;
5905 if (TREE_CODE (type
) == VOID_TYPE
)
5906 cp_error_at ("instantiation of `%D' as type void", r
);
5914 = tsubst_copy (DECL_INITIAL (t
), args
, /*complain=*/1, in_decl
);
5915 TREE_CHAIN (r
) = NULL_TREE
;
5920 if (DECL_IMPLICIT_TYPEDEF_P (t
))
5922 /* For an implicit typedef, we just want the implicit
5923 typedef for the tsubst'd type. We've already got the
5924 tsubst'd type, as TYPE, so we just need it's associated
5926 r
= TYPE_NAME (type
);
5929 else if (!DECL_LANG_SPECIFIC (t
))
5931 /* For a template type parameter, we don't have to do
5932 anything special. */
5933 r
= TYPE_NAME (type
);
5947 /* Nobody should be tsubst'ing into non-template variables. */
5948 my_friendly_assert (DECL_LANG_SPECIFIC (t
)
5949 && DECL_TEMPLATE_INFO (t
) != NULL_TREE
, 0);
5951 if (TYPE_P (DECL_CONTEXT (t
)))
5952 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
,
5954 in_decl
, /*entering_scope=*/1);
5956 /* Subsequent calls to pushdecl will fill this in. */
5959 /* Check to see if we already have this specialization. */
5960 tmpl
= DECL_TI_TEMPLATE (t
);
5961 gen_tmpl
= most_general_template (tmpl
);
5962 argvec
= tsubst (DECL_TI_ARGS (t
), args
, /*complain=*/1, in_decl
);
5964 spec
= retrieve_specialization (gen_tmpl
, argvec
);
5966 spec
= retrieve_local_specialization (gen_tmpl
,
5967 current_function_decl
);
5975 /* This declaration is going to have to be around for a while,
5976 so me make sure it is on a saveable obstack. */
5977 push_obstacks_nochange ();
5978 saveable_allocation ();
5982 TREE_TYPE (r
) = type
;
5983 c_apply_type_quals_to_decl (CP_TYPE_QUALS (type
), r
);
5984 DECL_CONTEXT (r
) = ctx
;
5986 /* Don't try to expand the initializer until someone tries to use
5987 this variable; otherwise we run into circular dependencies. */
5988 DECL_INITIAL (r
) = NULL_TREE
;
5992 DECL_CLASS_CONTEXT (r
) = DECL_CONTEXT (r
);
5994 /* Even if the original location is out of scope, the newly
5995 substituted one is not. */
5996 if (TREE_CODE (r
) == VAR_DECL
)
5997 DECL_DEAD_FOR_LOCAL (r
) = 0;
5999 /* A static data member declaration is always marked external
6000 when it is declared in-class, even if an initializer is
6001 present. We mimic the non-template processing here. */
6003 DECL_EXTERNAL (r
) = 1;
6005 DECL_TEMPLATE_INFO (r
) = tree_cons (tmpl
, argvec
, NULL_TREE
);
6006 SET_DECL_IMPLICIT_INSTANTIATION (r
);
6008 register_specialization (r
, gen_tmpl
, argvec
);
6010 register_local_specialization (r
, gen_tmpl
,
6011 current_function_decl
);
6013 TREE_CHAIN (r
) = NULL_TREE
;
6014 if (TREE_CODE (r
) == VAR_DECL
&& TREE_CODE (type
) == VOID_TYPE
)
6015 cp_error_at ("instantiation of `%D' as type void", r
);
6020 my_friendly_abort (0);
6023 /* Restore the file and line information. */
6024 lineno
= saved_lineno
;
6025 input_filename
= saved_filename
;
6030 /* Substitue into the ARG_TYPES of a function type. */
6033 tsubst_arg_types (arg_types
, args
, complain
, in_decl
)
6039 tree remaining_arg_types
;
6042 if (!arg_types
|| arg_types
== void_list_node
)
6045 remaining_arg_types
= tsubst_arg_types (TREE_CHAIN (arg_types
),
6046 args
, complain
, in_decl
);
6047 if (remaining_arg_types
== error_mark_node
)
6048 return error_mark_node
;
6050 type
= tsubst (TREE_VALUE (arg_types
), args
, complain
, in_decl
);
6051 if (type
== error_mark_node
)
6052 return error_mark_node
;
6054 /* Do array-to-pointer, function-to-pointer conversion, and ignore
6055 top-level qualifiers as required. */
6056 type
= TYPE_MAIN_VARIANT (type_decays_to (type
));
6058 /* Note that we do not substitute into default arguments here. The
6059 standard mandates that they be instantiated only when needed,
6060 which is done in build_over_call. */
6061 return hash_tree_cons (TREE_PURPOSE (arg_types
), type
,
6062 remaining_arg_types
);
6066 /* Substitute into a FUNCTION_TYPE or METHOD_TYPE. This routine does
6067 *not* handle the exception-specification for FNTYPE, because the
6068 initial substitution of explicitly provided template parameters
6069 during argument deduction forbids substitution into the
6070 exception-specification:
6074 All references in the function type of the function template to the
6075 corresponding template parameters are replaced by the specified tem-
6076 plate argument values. If a substitution in a template parameter or
6077 in the function type of the function template results in an invalid
6078 type, type deduction fails. [Note: The equivalent substitution in
6079 exception specifications is done only when the function is instanti-
6080 ated, at which point a program is ill-formed if the substitution
6081 results in an invalid type.] */
6084 tsubst_function_type (t
, args
, complain
, in_decl
)
6094 /* The TYPE_CONTEXT is not used for function/method types. */
6095 my_friendly_assert (TYPE_CONTEXT (t
) == NULL_TREE
, 0);
6097 /* Substitue the return type. */
6098 return_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
6099 if (return_type
== error_mark_node
)
6100 return error_mark_node
;
6102 /* Substitue the argument types. */
6103 arg_types
= tsubst_arg_types (TYPE_ARG_TYPES (t
), args
,
6105 if (arg_types
== error_mark_node
)
6106 return error_mark_node
;
6108 /* Construct a new type node and return it. */
6109 if (TREE_CODE (t
) == FUNCTION_TYPE
)
6110 fntype
= build_function_type (return_type
, arg_types
);
6113 tree r
= TREE_TYPE (TREE_VALUE (arg_types
));
6114 if (! IS_AGGR_TYPE (r
))
6118 Type deduction may fail for any of the following
6121 -- Attempting to create "pointer to member of T" when T
6122 is not a class type. */
6124 cp_error ("creating pointer to member function of non-class type `%T'",
6126 return error_mark_node
;
6129 fntype
= build_cplus_method_type (r
, return_type
, TREE_CHAIN
6132 fntype
= build_qualified_type (fntype
, TYPE_QUALS (t
));
6133 fntype
= build_type_attribute_variant (fntype
, TYPE_ATTRIBUTES (t
));
6138 /* Substitute into the PARMS of a call-declarator. */
6141 tsubst_call_declarator_parms (parms
, args
, complain
, in_decl
)
6151 if (!parms
|| parms
== void_list_node
)
6154 new_parms
= tsubst_call_declarator_parms (TREE_CHAIN (parms
),
6155 args
, complain
, in_decl
);
6157 /* Figure out the type of this parameter. */
6158 type
= tsubst (TREE_VALUE (parms
), args
, complain
, in_decl
);
6160 /* Figure out the default argument as well. Note that we use
6161 tsubst_expr since the default argument is really an expression. */
6162 defarg
= tsubst_expr (TREE_PURPOSE (parms
), args
, complain
, in_decl
);
6164 /* Chain this parameter on to the front of those we have already
6165 processed. We don't use hash_tree_cons because that function
6166 doesn't check TREE_PARMLIST. */
6167 new_parms
= tree_cons (defarg
, type
, new_parms
);
6169 /* And note that these are parameters. */
6170 TREE_PARMLIST (new_parms
) = 1;
6175 /* Take the tree structure T and replace template parameters used
6176 therein with the argument vector ARGS. IN_DECL is an associated
6177 decl for diagnostics. If an error occurs, returns ERROR_MARK_NODE.
6178 An appropriate error message is issued only if COMPLAIN is
6179 non-zero. Note that we must be relatively non-tolerant of
6180 extensions here, in order to preserve conformance; if we allow
6181 substitutions that should not be allowed, we may allow argument
6182 deductions that should not succeed, and therefore report ambiguous
6183 overload situations where there are none. In theory, we could
6184 allow the substitution, but indicate that it should have failed,
6185 and allow our caller to make sure that the right thing happens, but
6186 we don't try to do this yet.
6188 This function is used for dealing with types, decls and the like;
6189 for expressions, use tsubst_expr or tsubst_copy. */
6192 tsubst (t
, args
, complain
, in_decl
)
6199 if (t
== NULL_TREE
|| t
== error_mark_node
6200 || t
== integer_type_node
6201 || t
== void_type_node
6202 || t
== char_type_node
6203 || TREE_CODE (t
) == NAMESPACE_DECL
)
6206 if (TREE_CODE (t
) == IDENTIFIER_NODE
)
6207 type
= IDENTIFIER_TYPE_VALUE (t
);
6209 type
= TREE_TYPE (t
);
6210 if (type
== unknown_type_node
)
6211 my_friendly_abort (42);
6213 if (type
&& TREE_CODE (t
) != FUNCTION_DECL
6214 && TREE_CODE (t
) != TYPENAME_TYPE
6215 && TREE_CODE (t
) != TEMPLATE_DECL
6216 && TREE_CODE (t
) != IDENTIFIER_NODE
6217 && TREE_CODE (t
) != FUNCTION_TYPE
6218 && TREE_CODE (t
) != METHOD_TYPE
)
6219 type
= tsubst (type
, args
, complain
, in_decl
);
6220 if (type
== error_mark_node
)
6221 return error_mark_node
;
6223 if (TREE_CODE_CLASS (TREE_CODE (t
)) == 'd')
6224 return tsubst_decl (t
, args
, type
, in_decl
);
6226 switch (TREE_CODE (t
))
6231 return tsubst_aggr_type (t
, args
, complain
, in_decl
,
6232 /*entering_scope=*/0);
6235 case IDENTIFIER_NODE
:
6247 if (t
== integer_type_node
)
6250 if (TREE_CODE (TYPE_MIN_VALUE (t
)) == INTEGER_CST
6251 && TREE_CODE (TYPE_MAX_VALUE (t
)) == INTEGER_CST
)
6255 tree max
, omax
= TREE_OPERAND (TYPE_MAX_VALUE (t
), 0);
6257 max
= tsubst_expr (omax
, args
, complain
, in_decl
);
6258 if (max
== error_mark_node
)
6259 return error_mark_node
;
6261 /* See if we can reduce this expression to something simpler. */
6262 max
= maybe_fold_nontype_arg (max
);
6263 if (!processing_template_decl
&& TREE_READONLY_DECL_P (max
))
6264 max
= decl_constant_value (max
);
6266 if (processing_template_decl
6267 /* When providing explicit arguments to a template
6268 function, but leaving some arguments for subsequent
6269 deduction, MAX may be template-dependent even if we're
6270 not PROCESSING_TEMPLATE_DECL. */
6271 || TREE_CODE (max
) != INTEGER_CST
)
6273 tree itype
= make_node (INTEGER_TYPE
);
6274 TYPE_MIN_VALUE (itype
) = size_zero_node
;
6275 TYPE_MAX_VALUE (itype
) = build_min (MINUS_EXPR
, sizetype
, max
,
6280 if (integer_zerop (omax
))
6282 /* Still allow an explicit array of size zero. */
6284 pedwarn ("creating array with size zero");
6286 else if (integer_zerop (max
) || INT_CST_LT (max
, integer_zero_node
))
6290 Type deduction may fail for any of the following
6293 Attempting to create an array with a size that is
6294 zero or negative. */
6296 cp_error ("creating array with size zero (`%E')", max
);
6298 return error_mark_node
;
6301 max
= fold (build_binary_op (MINUS_EXPR
, max
, integer_one_node
));
6302 return build_index_type (max
);
6305 case TEMPLATE_TYPE_PARM
:
6306 case TEMPLATE_TEMPLATE_PARM
:
6307 case TEMPLATE_PARM_INDEX
:
6315 if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
6316 || TREE_CODE (t
) == TEMPLATE_TEMPLATE_PARM
)
6318 idx
= TEMPLATE_TYPE_IDX (t
);
6319 level
= TEMPLATE_TYPE_LEVEL (t
);
6323 idx
= TEMPLATE_PARM_IDX (t
);
6324 level
= TEMPLATE_PARM_LEVEL (t
);
6327 if (TREE_VEC_LENGTH (args
) > 0)
6329 tree arg
= NULL_TREE
;
6331 levels
= TMPL_ARGS_DEPTH (args
);
6332 if (level
<= levels
)
6333 arg
= TMPL_ARG (args
, level
, idx
);
6335 if (arg
== error_mark_node
)
6336 return error_mark_node
;
6337 else if (arg
!= NULL_TREE
)
6339 if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
6341 my_friendly_assert (TREE_CODE_CLASS (TREE_CODE (arg
))
6343 return cp_build_qualified_type_real
6344 (arg
, CP_TYPE_QUALS (arg
) | CP_TYPE_QUALS (t
),
6347 else if (TREE_CODE (t
) == TEMPLATE_TEMPLATE_PARM
)
6349 if (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t
))
6351 /* We are processing a type constructed from
6352 a template template parameter */
6353 tree argvec
= tsubst (TYPE_TI_ARGS (t
),
6354 args
, complain
, in_decl
);
6355 if (argvec
== error_mark_node
)
6356 return error_mark_node
;
6358 /* We can get a TEMPLATE_TEMPLATE_PARM here when
6359 we are resolving nested-types in the signature of
6360 a member function templates.
6361 Otherwise ARG is a TEMPLATE_DECL and is the real
6362 template to be instantiated. */
6363 if (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
6364 arg
= TYPE_NAME (arg
);
6366 r
= lookup_template_class (DECL_NAME (arg
),
6369 /*entering_scope=*/0);
6370 return cp_build_qualified_type_real (r
,
6375 /* We are processing a template argument list. */
6383 my_friendly_abort (981018);
6386 /* This can happen during the attempted tsubst'ing in
6387 unify. This means that we don't yet have any information
6388 about the template parameter in question. */
6391 /* If we get here, we must have been looking at a parm for a
6392 more deeply nested template. Make a new version of this
6393 template parameter, but with a lower level. */
6394 switch (TREE_CODE (t
))
6396 case TEMPLATE_TYPE_PARM
:
6397 case TEMPLATE_TEMPLATE_PARM
:
6399 TEMPLATE_TYPE_PARM_INDEX (r
)
6400 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (t
),
6402 TYPE_STUB_DECL (r
) = TYPE_NAME (r
) = TEMPLATE_TYPE_DECL (r
);
6403 TYPE_MAIN_VARIANT (r
) = r
;
6404 TYPE_POINTER_TO (r
) = NULL_TREE
;
6405 TYPE_REFERENCE_TO (r
) = NULL_TREE
;
6407 if (TREE_CODE (t
) == TEMPLATE_TEMPLATE_PARM
6408 && TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t
))
6410 tree argvec
= tsubst (TYPE_TI_ARGS (t
), args
,
6412 if (argvec
== error_mark_node
)
6413 return error_mark_node
;
6415 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (r
)
6416 = tree_cons (TYPE_NAME (t
), argvec
, NULL_TREE
);
6420 case TEMPLATE_PARM_INDEX
:
6421 r
= reduce_template_parm_level (t
, type
, levels
);
6425 my_friendly_abort (0);
6433 tree purpose
, value
, chain
, result
;
6435 if (t
== void_list_node
)
6438 purpose
= TREE_PURPOSE (t
);
6441 purpose
= tsubst (purpose
, args
, complain
, in_decl
);
6442 if (purpose
== error_mark_node
)
6443 return error_mark_node
;
6445 value
= TREE_VALUE (t
);
6448 value
= tsubst (value
, args
, complain
, in_decl
);
6449 if (value
== error_mark_node
)
6450 return error_mark_node
;
6452 chain
= TREE_CHAIN (t
);
6453 if (chain
&& chain
!= void_type_node
)
6455 chain
= tsubst (chain
, args
, complain
, in_decl
);
6456 if (chain
== error_mark_node
)
6457 return error_mark_node
;
6459 if (purpose
== TREE_PURPOSE (t
)
6460 && value
== TREE_VALUE (t
)
6461 && chain
== TREE_CHAIN (t
))
6463 result
= hash_tree_cons (purpose
, value
, chain
);
6464 TREE_PARMLIST (result
) = TREE_PARMLIST (t
);
6468 if (type
!= NULL_TREE
)
6470 /* A binfo node. We always need to make a copy, of the node
6471 itself and of its BINFO_BASETYPES. */
6475 /* Make sure type isn't a typedef copy. */
6476 type
= BINFO_TYPE (TYPE_BINFO (type
));
6478 TREE_TYPE (t
) = complete_type (type
);
6479 if (IS_AGGR_TYPE (type
))
6481 BINFO_VTABLE (t
) = TYPE_BINFO_VTABLE (type
);
6482 BINFO_VIRTUALS (t
) = TYPE_BINFO_VIRTUALS (type
);
6483 if (TYPE_BINFO_BASETYPES (type
) != NULL_TREE
)
6484 BINFO_BASETYPES (t
) = copy_node (TYPE_BINFO_BASETYPES (type
));
6489 /* Otherwise, a vector of template arguments. */
6490 return tsubst_template_arg_vector (t
, args
, complain
);
6493 case REFERENCE_TYPE
:
6495 enum tree_code code
;
6497 if (type
== TREE_TYPE (t
))
6500 code
= TREE_CODE (t
);
6505 Type deduction may fail for any of the following
6508 -- Attempting to create a pointer to reference type.
6509 -- Attempting to create a reference to a reference type or
6510 a reference to void. */
6511 if (TREE_CODE (type
) == REFERENCE_TYPE
6512 || (code
== REFERENCE_TYPE
&& TREE_CODE (type
) == VOID_TYPE
))
6514 static int last_line
= 0;
6515 static char* last_file
= 0;
6517 /* We keep track of the last time we issued this error
6518 message to avoid spewing a ton of messages during a
6519 single bad template instantiation. */
6520 if (complain
&& (last_line
!= lineno
||
6521 last_file
!= input_filename
))
6523 if (TREE_CODE (type
) == VOID_TYPE
)
6524 cp_error ("forming reference to void");
6526 cp_error ("forming %s to reference type `%T'",
6527 (code
== POINTER_TYPE
) ? "pointer" : "reference",
6530 last_file
= input_filename
;
6533 return error_mark_node
;
6535 else if (code
== POINTER_TYPE
)
6536 r
= build_pointer_type (type
);
6538 r
= build_reference_type (type
);
6539 r
= cp_build_qualified_type_real (r
, TYPE_QUALS (t
), complain
);
6541 /* Will this ever be needed for TYPE_..._TO values? */
6547 r
= tsubst (TYPE_OFFSET_BASETYPE (t
), args
, complain
, in_decl
);
6548 if (r
== error_mark_node
|| !IS_AGGR_TYPE (r
))
6552 Type deduction may fail for any of the following
6555 -- Attempting to create "pointer to member of T" when T
6556 is not a class type. */
6558 cp_error ("creating pointer to member of non-class type `%T'",
6560 return error_mark_node
;
6562 return build_offset_type (r
, type
);
6570 fntype
= tsubst_function_type (t
, args
, complain
, in_decl
);
6571 if (fntype
== error_mark_node
)
6572 return error_mark_node
;
6574 /* Substitue the exception specification. */
6575 raises
= TYPE_RAISES_EXCEPTIONS (t
);
6578 tree list
= NULL_TREE
;
6580 if (! TREE_VALUE (raises
))
6583 for (; raises
!= NULL_TREE
; raises
= TREE_CHAIN (raises
))
6585 tree spec
= TREE_VALUE (raises
);
6587 spec
= tsubst (spec
, args
, complain
, in_decl
);
6588 if (spec
== error_mark_node
)
6590 list
= add_exception_specifier (list
, spec
, complain
);
6592 fntype
= build_exception_variant (fntype
, list
);
6598 tree domain
= tsubst (TYPE_DOMAIN (t
), args
, complain
, in_decl
);
6599 if (domain
== error_mark_node
)
6600 return error_mark_node
;
6602 /* As an optimization, we avoid regenerating the array type if
6603 it will obviously be the same as T. */
6604 if (type
== TREE_TYPE (t
) && domain
== TYPE_DOMAIN (t
))
6607 /* These checks should match the ones in grokdeclarator.
6611 The deduction may fail for any of the following reasons:
6613 -- Attempting to create an array with an element type that
6614 is void, a function type, or a reference type. */
6615 if (TREE_CODE (type
) == VOID_TYPE
6616 || TREE_CODE (type
) == FUNCTION_TYPE
6617 || TREE_CODE (type
) == REFERENCE_TYPE
)
6620 cp_error ("creating array of `%T'", type
);
6621 return error_mark_node
;
6624 r
= build_cplus_array_type (type
, domain
);
6631 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6633 tree e2
= tsubst (TREE_OPERAND (t
, 1), args
, complain
,
6636 if (e1
== error_mark_node
|| e2
== error_mark_node
)
6637 return error_mark_node
;
6639 return fold (build (TREE_CODE (t
), TREE_TYPE (t
), e1
, e2
));
6645 tree e
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6647 if (e
== error_mark_node
)
6648 return error_mark_node
;
6650 return fold (build (TREE_CODE (t
), TREE_TYPE (t
), e
));
6655 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
6656 in_decl
, /*entering_scope=*/1);
6657 tree f
= tsubst_copy (TYPENAME_TYPE_FULLNAME (t
), args
,
6660 if (ctx
== error_mark_node
|| f
== error_mark_node
)
6661 return error_mark_node
;
6663 if (!IS_AGGR_TYPE (ctx
))
6666 cp_error ("`%T' is not a class, struct, or union type",
6668 return error_mark_node
;
6670 else if (!uses_template_parms (ctx
) && !TYPE_BEING_DEFINED (ctx
))
6672 /* Normally, make_typename_type does not require that the CTX
6673 have complete type in order to allow things like:
6675 template <class T> struct S { typename S<T>::X Y; };
6677 But, such constructs have already been resolved by this
6678 point, so here CTX really should have complete type, unless
6679 it's a partial instantiation. */
6680 ctx
= complete_type (ctx
);
6681 if (!TYPE_SIZE (ctx
))
6684 incomplete_type_error (NULL_TREE
, ctx
);
6685 return error_mark_node
;
6689 f
= make_typename_type (ctx
, f
, complain
);
6690 if (f
== error_mark_node
)
6692 return cp_build_qualified_type_real (f
,
6694 | CP_TYPE_QUALS (t
),
6700 tree e
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6702 if (e
== error_mark_node
)
6703 return error_mark_node
;
6704 return make_pointer_declarator (type
, e
);
6709 tree e
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6711 if (e
== error_mark_node
)
6712 return error_mark_node
;
6713 return make_reference_declarator (type
, e
);
6718 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6720 tree e2
= tsubst_expr (TREE_OPERAND (t
, 1), args
, complain
,
6722 if (e1
== error_mark_node
|| e2
== error_mark_node
)
6723 return error_mark_node
;
6725 return build_parse_node (ARRAY_REF
, e1
, e2
, tsubst_expr
);
6730 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6732 tree e2
= (tsubst_call_declarator_parms
6733 (CALL_DECLARATOR_PARMS (t
), args
, complain
, in_decl
));
6734 tree e3
= tsubst (CALL_DECLARATOR_EXCEPTION_SPEC (t
), args
,
6737 if (e1
== error_mark_node
|| e2
== error_mark_node
6738 || e3
== error_mark_node
)
6739 return error_mark_node
;
6741 return make_call_declarator (e1
, e2
, CALL_DECLARATOR_QUALS (t
), e3
);
6746 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6748 tree e2
= tsubst (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
6749 if (e1
== error_mark_node
|| e2
== error_mark_node
)
6750 return error_mark_node
;
6752 return build_parse_node (TREE_CODE (t
), e1
, e2
);
6757 tree e1
= tsubst_expr (TYPE_FIELDS (t
), args
, complain
,
6759 if (e1
== error_mark_node
)
6760 return error_mark_node
;
6762 return TREE_TYPE (e1
);
6766 sorry ("use of `%s' in template",
6767 tree_code_name
[(int) TREE_CODE (t
)]);
6768 return error_mark_node
;
6772 /* Like tsubst, but deals with expressions. This function just replaces
6773 template parms; to finish processing the resultant expression, use
6777 tsubst_copy (t
, args
, complain
, in_decl
)
6782 enum tree_code code
;
6785 if (t
== NULL_TREE
|| t
== error_mark_node
)
6788 code
= TREE_CODE (t
);
6793 return do_identifier (DECL_NAME (t
), 0, NULL_TREE
);
6800 if (!DECL_CONTEXT (t
))
6801 /* This is a global enumeration constant. */
6804 /* Unfortunately, we cannot just call lookup_name here.
6807 template <int I> int f() {
6809 struct S { void g() { E e = a; } };
6812 When we instantiate f<7>::S::g(), say, lookup_name is not
6813 clever enough to find f<7>::a. */
6815 = tsubst_aggr_type (TREE_TYPE (t
), args
, complain
, in_decl
,
6816 /*entering_scope=*/0);
6818 for (v
= TYPE_VALUES (enum_type
);
6821 if (TREE_PURPOSE (v
) == DECL_NAME (t
))
6822 return TREE_VALUE (v
);
6824 /* We didn't find the name. That should never happen; if
6825 name-lookup found it during preliminary parsing, we
6826 should find it again here during instantiation. */
6827 my_friendly_abort (0);
6832 if (DECL_CONTEXT (t
))
6836 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
6837 /*entering_scope=*/1);
6838 if (ctx
!= DECL_CONTEXT (t
))
6839 return lookup_field (ctx
, DECL_NAME (t
), 0, 0);
6845 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
))
6846 t
= tsubst (t
, args
, complain
, in_decl
);
6851 if (is_member_template (t
))
6852 return tsubst (t
, args
, complain
, in_decl
);
6858 /* We must tsbust into a LOOKUP_EXPR in case the names to
6859 which it refers is a conversion operator; in that case the
6860 name will change. We avoid making unnecessary copies,
6863 tree id
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
6865 if (id
!= TREE_OPERAND (t
, 0))
6867 r
= build_nt (LOOKUP_EXPR
, id
);
6868 LOOKUP_EXPR_GLOBAL (r
) = LOOKUP_EXPR_GLOBAL (t
);
6876 case REINTERPRET_CAST_EXPR
:
6877 case CONST_CAST_EXPR
:
6878 case STATIC_CAST_EXPR
:
6879 case DYNAMIC_CAST_EXPR
:
6882 (code
, tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
6883 tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
));
6886 case PREDECREMENT_EXPR
:
6887 case PREINCREMENT_EXPR
:
6888 case POSTDECREMENT_EXPR
:
6889 case POSTINCREMENT_EXPR
:
6891 case TRUTH_NOT_EXPR
:
6894 case CONVERT_EXPR
: /* Unary + */
6901 (code
, tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
6902 tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
));
6907 case TRUNC_DIV_EXPR
:
6909 case FLOOR_DIV_EXPR
:
6910 case ROUND_DIV_EXPR
:
6911 case EXACT_DIV_EXPR
:
6913 case BIT_ANDTC_EXPR
:
6916 case TRUNC_MOD_EXPR
:
6917 case FLOOR_MOD_EXPR
:
6918 case TRUTH_ANDIF_EXPR
:
6919 case TRUTH_ORIF_EXPR
:
6920 case TRUTH_AND_EXPR
:
6941 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
6942 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
));
6946 tree fn
= TREE_OPERAND (t
, 0);
6947 if (is_overloaded_fn (fn
))
6948 fn
= tsubst_copy (get_first_fn (fn
), args
, complain
, in_decl
);
6950 /* Sometimes FN is a LOOKUP_EXPR. */
6951 fn
= tsubst_copy (fn
, args
, complain
, in_decl
);
6953 (code
, fn
, tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
,
6958 case METHOD_CALL_EXPR
:
6960 tree name
= TREE_OPERAND (t
, 0);
6961 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
6963 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
6965 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
6967 else if (TREE_CODE (name
) == SCOPE_REF
6968 && TREE_CODE (TREE_OPERAND (name
, 1)) == BIT_NOT_EXPR
)
6970 tree base
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
6972 name
= TREE_OPERAND (name
, 1);
6973 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
6975 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
6976 name
= build_nt (SCOPE_REF
, base
, name
);
6979 name
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
6981 (code
, name
, tsubst_copy (TREE_OPERAND (t
, 1), args
,
6983 tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
),
6988 /* This processing should really occur in tsubst_expr, However,
6989 tsubst_expr does not recurse into expressions, since it
6990 assumes that there aren't any statements inside them.
6991 Instead, it simply calls build_expr_from_tree. So, we need
6992 to expand the STMT_EXPR here. */
6993 if (!processing_template_decl
)
6995 tree stmt_expr
= begin_stmt_expr ();
6996 tsubst_expr (STMT_EXPR_STMT (t
), args
,
6998 return finish_stmt_expr (stmt_expr
);
7005 case PSEUDO_DTOR_EXPR
:
7008 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
7009 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
),
7010 tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
));
7017 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
7018 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
),
7019 tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
));
7020 NEW_EXPR_USE_GLOBAL (r
) = NEW_EXPR_USE_GLOBAL (t
);
7027 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
7028 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
));
7029 DELETE_EXPR_USE_GLOBAL (r
) = DELETE_EXPR_USE_GLOBAL (t
);
7030 DELETE_EXPR_USE_VEC (r
) = DELETE_EXPR_USE_VEC (t
);
7034 case TEMPLATE_ID_EXPR
:
7036 /* Substituted template arguments */
7037 tree targs
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
,
7040 if (targs
&& TREE_CODE (targs
) == TREE_LIST
)
7043 for (chain
= targs
; chain
; chain
= TREE_CHAIN (chain
))
7044 TREE_VALUE (chain
) = maybe_fold_nontype_arg (TREE_VALUE (chain
));
7049 for (i
= 0; i
< TREE_VEC_LENGTH (targs
); ++i
)
7050 TREE_VEC_ELT (targs
, i
)
7051 = maybe_fold_nontype_arg (TREE_VEC_ELT (targs
, i
));
7054 return lookup_template_function
7055 (tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
), targs
);
7060 tree purpose
, value
, chain
;
7062 if (t
== void_list_node
)
7065 purpose
= TREE_PURPOSE (t
);
7067 purpose
= tsubst_copy (purpose
, args
, complain
, in_decl
);
7068 value
= TREE_VALUE (t
);
7070 value
= tsubst_copy (value
, args
, complain
, in_decl
);
7071 chain
= TREE_CHAIN (t
);
7072 if (chain
&& chain
!= void_type_node
)
7073 chain
= tsubst_copy (chain
, args
, complain
, in_decl
);
7074 if (purpose
== TREE_PURPOSE (t
)
7075 && value
== TREE_VALUE (t
)
7076 && chain
== TREE_CHAIN (t
))
7078 return tree_cons (purpose
, value
, chain
);
7085 case TEMPLATE_TYPE_PARM
:
7086 case TEMPLATE_TEMPLATE_PARM
:
7087 case TEMPLATE_PARM_INDEX
:
7089 case REFERENCE_TYPE
:
7096 return tsubst (t
, args
, complain
, in_decl
);
7098 case IDENTIFIER_NODE
:
7099 if (IDENTIFIER_TYPENAME_P (t
)
7100 /* Make sure it's not just a variable named `__opr', for instance,
7101 which can occur in some existing code. */
7103 return build_typename_overload
7104 (tsubst (TREE_TYPE (t
), args
, complain
, in_decl
));
7111 (CONSTRUCTOR
, tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
7112 NULL_TREE
, tsubst_copy (CONSTRUCTOR_ELTS (t
), args
,
7113 complain
, in_decl
));
7114 TREE_HAS_CONSTRUCTOR (r
) = TREE_HAS_CONSTRUCTOR (t
);
7119 return build_va_arg (tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
,
7121 tsubst (TREE_TYPE (t
), args
, complain
, in_decl
));
7128 /* Like tsubst_copy, but also does semantic processing. */
7131 tsubst_expr (t
, args
, complain
, in_decl
)
7138 if (t
== NULL_TREE
|| t
== error_mark_node
)
7141 if (processing_template_decl
)
7142 return tsubst_copy (t
, args
, complain
, in_decl
);
7144 switch (TREE_CODE (t
))
7148 finish_named_return_value
7149 (TREE_OPERAND (t
, 0),
7150 tsubst_expr (TREE_OPERAND (t
, 1), args
, /*complain=*/1, in_decl
));
7151 tsubst_expr (TREE_CHAIN (t
), args
, complain
, in_decl
);
7154 case CTOR_INITIALIZER
:
7156 current_member_init_list
7157 = tsubst_expr_values (TREE_OPERAND (t
, 0), args
);
7158 current_base_init_list
7159 = tsubst_expr_values (TREE_OPERAND (t
, 1), args
);
7161 tsubst_expr (TREE_CHAIN (t
), args
, complain
, in_decl
);
7166 finish_return_stmt (tsubst_expr (RETURN_EXPR (t
),
7167 args
, complain
, in_decl
));
7172 finish_expr_stmt (tsubst_expr (EXPR_STMT_EXPR (t
),
7173 args
, complain
, in_decl
));
7178 int i
= suspend_momentary ();
7183 decl
= DECL_STMT_DECL (t
);
7184 if (TREE_CODE (decl
) == LABEL_DECL
)
7185 finish_label_decl (DECL_NAME (decl
));
7188 init
= DECL_INITIAL (decl
);
7189 decl
= tsubst (decl
, args
, complain
, in_decl
);
7190 init
= tsubst_expr (init
, args
, complain
, in_decl
);
7192 DECL_INITIAL (decl
) = error_mark_node
;
7193 /* By marking the declaration as instantiated, we avoid
7194 trying to instantiate it. Since instantiate_decl can't
7195 handle local variables, and since we've already done
7196 all that needs to be done, that's the right thing to
7198 if (TREE_CODE (decl
) == VAR_DECL
)
7199 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
7200 maybe_push_decl (decl
);
7201 cp_finish_decl (decl
, init
, NULL_TREE
, 0, 0);
7203 resume_momentary (i
);
7212 stmt
= begin_for_stmt ();
7213 for (tmp
= FOR_INIT_STMT (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
7214 tsubst_expr (tmp
, args
, complain
, in_decl
);
7215 finish_for_init_stmt (stmt
);
7216 finish_for_cond (tsubst_expr (FOR_COND (t
), args
,
7219 tmp
= tsubst_expr (FOR_EXPR (t
), args
, complain
, in_decl
);
7220 finish_for_expr (tmp
, stmt
);
7221 tsubst_expr (FOR_BODY (t
), args
, complain
, in_decl
);
7222 finish_for_stmt (tmp
, stmt
);
7229 stmt
= begin_while_stmt ();
7230 finish_while_stmt_cond (tsubst_expr (WHILE_COND (t
),
7231 args
, complain
, in_decl
),
7233 tsubst_expr (WHILE_BODY (t
), args
, complain
, in_decl
);
7234 finish_while_stmt (stmt
);
7241 stmt
= begin_do_stmt ();
7242 tsubst_expr (DO_BODY (t
), args
, complain
, in_decl
);
7243 finish_do_body (stmt
);
7244 finish_do_stmt (tsubst_expr (DO_COND (t
), args
,
7255 stmt
= begin_if_stmt ();
7256 finish_if_stmt_cond (tsubst_expr (IF_COND (t
),
7257 args
, complain
, in_decl
),
7260 if (tmp
= THEN_CLAUSE (t
), tmp
)
7262 tsubst_expr (tmp
, args
, complain
, in_decl
);
7263 finish_then_clause (stmt
);
7266 if (tmp
= ELSE_CLAUSE (t
), tmp
)
7268 begin_else_clause ();
7269 tsubst_expr (tmp
, args
, complain
, in_decl
);
7270 finish_else_clause (stmt
);
7282 stmt
= begin_compound_stmt (COMPOUND_STMT_NO_SCOPE (t
));
7283 for (substmt
= COMPOUND_BODY (t
);
7284 substmt
!= NULL_TREE
;
7285 substmt
= TREE_CHAIN (substmt
))
7286 tsubst_expr (substmt
, args
, complain
, in_decl
);
7287 return finish_compound_stmt (COMPOUND_STMT_NO_SCOPE (t
), stmt
);
7293 finish_break_stmt ();
7298 finish_continue_stmt ();
7306 stmt
= begin_switch_stmt ();
7307 val
= tsubst_expr (SWITCH_COND (t
), args
, complain
, in_decl
);
7308 finish_switch_cond (val
, stmt
);
7309 tsubst_expr (SWITCH_BODY (t
), args
, complain
, in_decl
);
7310 finish_switch_stmt (val
, stmt
);
7316 finish_case_label (tsubst_expr (CASE_LOW (t
), args
, complain
, in_decl
),
7317 tsubst_expr (CASE_HIGH (t
), args
, complain
, in_decl
));
7321 lineno
= STMT_LINENO (t
);
7322 finish_label_stmt (DECL_NAME (LABEL_STMT_LABEL (t
)));
7327 t
= GOTO_DESTINATION (t
);
7328 if (TREE_CODE (t
) != LABEL_DECL
)
7329 /* Computed goto's must be tsubst'd into. On the other hand,
7330 non-computed gotos must not be; the identifier in question
7331 will have no binding. */
7332 t
= tsubst_expr (t
, args
, complain
, in_decl
);
7335 finish_goto_stmt (t
);
7340 finish_asm_stmt (ASM_CV_QUAL (t
),
7341 tsubst_expr (ASM_STRING (t
), args
, complain
, in_decl
),
7342 tsubst_expr (ASM_OUTPUTS (t
), args
, complain
, in_decl
),
7343 tsubst_expr (ASM_INPUTS (t
), args
, complain
, in_decl
),
7344 tsubst_expr (ASM_CLOBBERS (t
), args
, complain
,
7352 stmt
= begin_try_block ();
7353 tsubst_expr (TRY_STMTS (t
), args
, complain
, in_decl
);
7354 finish_cleanup_try_block (stmt
);
7355 finish_cleanup (tsubst_expr (TRY_HANDLERS (t
), args
,
7363 if (FN_TRY_BLOCK_P (t
))
7364 stmt
= begin_function_try_block ();
7366 stmt
= begin_try_block ();
7368 tsubst_expr (TRY_STMTS (t
), args
, complain
, in_decl
);
7370 if (FN_TRY_BLOCK_P (t
))
7371 finish_function_try_block (stmt
);
7373 finish_try_block (stmt
);
7375 handler
= TRY_HANDLERS (t
);
7376 for (; handler
; handler
= TREE_CHAIN (handler
))
7377 tsubst_expr (handler
, args
, complain
, in_decl
);
7378 if (FN_TRY_BLOCK_P (t
))
7379 finish_function_handler_sequence (stmt
);
7381 finish_handler_sequence (stmt
);
7391 stmt
= begin_handler ();
7392 if (HANDLER_PARMS (t
))
7394 decl
= DECL_STMT_DECL (HANDLER_PARMS (t
));
7395 decl
= tsubst (decl
, args
, complain
, in_decl
);
7396 /* Prevent instantiate_decl from trying to instantiate
7397 this variable. We've already done all that needs to be
7399 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
7403 blocks
= finish_handler_parms (decl
, stmt
);
7404 tsubst_expr (HANDLER_BODY (t
), args
, complain
, in_decl
);
7405 finish_handler (blocks
, stmt
);
7412 if (TREE_CODE (t
) == ENUMERAL_TYPE
)
7413 tsubst (t
, args
, complain
, NULL_TREE
);
7417 return build_expr_from_tree (tsubst_copy (t
, args
, complain
, in_decl
));
7422 /* Instantiate the indicated variable or function template TMPL with
7423 the template arguments in TARG_PTR. */
7426 instantiate_template (tmpl
, targ_ptr
)
7427 tree tmpl
, targ_ptr
;
7433 struct obstack
*old_fmp_obstack
;
7434 extern struct obstack
*function_maybepermanent_obstack
;
7437 if (tmpl
== error_mark_node
)
7438 return error_mark_node
;
7440 my_friendly_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
, 283);
7442 /* Check to see if we already have this specialization. */
7443 spec
= retrieve_specialization (tmpl
, targ_ptr
);
7444 if (spec
!= NULL_TREE
)
7447 if (DECL_TEMPLATE_INFO (tmpl
))
7449 /* The TMPL is a partial instantiation. To get a full set of
7450 arguments we must add the arguments used to perform the
7451 partial instantiation. */
7452 targ_ptr
= add_outermost_template_args (DECL_TI_ARGS (tmpl
),
7454 gen_tmpl
= most_general_template (tmpl
);
7456 /* Check to see if we already have this specialization. */
7457 spec
= retrieve_specialization (gen_tmpl
, targ_ptr
);
7458 if (spec
!= NULL_TREE
)
7464 push_obstacks (&permanent_obstack
, &permanent_obstack
);
7465 old_fmp_obstack
= function_maybepermanent_obstack
;
7466 function_maybepermanent_obstack
= &permanent_obstack
;
7468 len
= DECL_NTPARMS (gen_tmpl
);
7469 inner_args
= innermost_args (targ_ptr
);
7473 tree t
= TREE_VEC_ELT (inner_args
, i
);
7474 if (TREE_CODE_CLASS (TREE_CODE (t
)) == 't')
7476 tree nt
= target_type (t
);
7477 if (IS_AGGR_TYPE (nt
) && decl_function_context (TYPE_MAIN_DECL (nt
)))
7479 cp_error ("type `%T' composed from a local class is not a valid template-argument", t
);
7480 cp_error (" trying to instantiate `%D'", gen_tmpl
);
7481 fndecl
= error_mark_node
;
7487 /* substitute template parameters */
7488 fndecl
= tsubst (DECL_RESULT (gen_tmpl
), targ_ptr
, /*complain=*/1, gen_tmpl
);
7489 /* The DECL_TI_TEMPLATE should always be the immediate parent
7490 template, not the most general template. */
7491 DECL_TI_TEMPLATE (fndecl
) = tmpl
;
7493 if (flag_external_templates
)
7494 add_pending_template (fndecl
);
7497 function_maybepermanent_obstack
= old_fmp_obstack
;
7503 /* Push the name of the class template into the scope of the instantiation. */
7506 overload_template_name (type
)
7509 tree id
= DECL_NAME (CLASSTYPE_TI_TEMPLATE (type
));
7512 if (IDENTIFIER_CLASS_VALUE (id
)
7513 && TREE_TYPE (IDENTIFIER_CLASS_VALUE (id
)) == type
)
7516 decl
= build_decl (TYPE_DECL
, id
, type
);
7517 SET_DECL_ARTIFICIAL (decl
);
7518 pushdecl_class_level (decl
);
7521 /* The FN is a TEMPLATE_DECL for a function. The ARGS are the
7522 arguments that are being used when calling it. TARGS is a vector
7523 into which the deduced template arguments are placed.
7525 Return zero for success, 2 for an incomplete match that doesn't resolve
7526 all the types, and 1 for complete failure. An error message will be
7527 printed only for an incomplete match.
7529 If FN is a conversion operator, RETURN_TYPE is the type desired as
7530 the result of the conversion operator.
7532 TPARMS is a vector of template parameters.
7534 The EXPLICIT_TARGS are explicit template arguments provided via a
7537 The parameter STRICT is one of:
7540 We are deducing arguments for a function call, as in
7544 We are deducing arguments for a conversion function, as in
7548 We are deducing arguments when calculating the partial
7549 ordering between specializations of function or class
7550 templates, as in [temp.func.order] and [temp.class.order],
7551 when doing an explicit instantiation as in [temp.explicit],
7552 when determining an explicit specialization as in
7553 [temp.expl.spec], or when taking the address of a function
7554 template, as in [temp.deduct.funcaddr].
7556 The other arguments are as for type_unification. */
7559 fn_type_unification (fn
, explicit_targs
, targs
, args
, return_type
,
7561 tree fn
, explicit_targs
, targs
, args
, return_type
;
7562 unification_kind_t strict
;
7568 my_friendly_assert (TREE_CODE (fn
) == TEMPLATE_DECL
, 0);
7570 fntype
= TREE_TYPE (fn
);
7575 The specified template arguments must match the template
7576 parameters in kind (i.e., type, nontype, template), and there
7577 must not be more arguments than there are parameters;
7578 otherwise type deduction fails.
7580 Nontype arguments must match the types of the corresponding
7581 nontype template parameters, or must be convertible to the
7582 types of the corresponding nontype parameters as specified in
7583 _temp.arg.nontype_, otherwise type deduction fails.
7585 All references in the function type of the function template
7586 to the corresponding template parameters are replaced by the
7587 specified template argument values. If a substitution in a
7588 template parameter or in the function type of the function
7589 template results in an invalid type, type deduction fails. */
7591 tree converted_args
;
7594 = (coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
7595 explicit_targs
, NULL_TREE
, /*complain=*/0,
7596 /*require_all_arguments=*/0));
7597 if (converted_args
== error_mark_node
)
7600 fntype
= tsubst (fntype
, converted_args
, /*complain=*/0, NULL_TREE
);
7601 if (fntype
== error_mark_node
)
7604 /* Place the explicitly specified arguments in TARGS. */
7605 for (i
= 0; i
< TREE_VEC_LENGTH (targs
); i
++)
7606 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (converted_args
, i
);
7609 parms
= TYPE_ARG_TYPES (fntype
);
7611 if (DECL_CONV_FN_P (fn
))
7613 /* This is a template conversion operator. Use the return types
7614 as well as the argument types. We use it instead of 'this', since
7615 we could be comparing conversions from different classes. */
7616 parms
= tree_cons (NULL_TREE
, TREE_TYPE (fntype
),
7617 TREE_CHAIN (parms
));
7618 args
= tree_cons (NULL_TREE
, return_type
, TREE_CHAIN (args
));
7621 /* We allow incomplete unification without an error message here
7622 because the standard doesn't seem to explicitly prohibit it. Our
7623 callers must be ready to deal with unification failures in any
7625 result
= type_unification_real (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
7626 targs
, parms
, args
, /*subr=*/0,
7627 strict
, /*allow_incomplete*/1);
7630 /* All is well so far. Now, check:
7634 When all template arguments have been deduced, all uses of
7635 template parameters in nondeduced contexts are replaced with
7636 the corresponding deduced argument values. If the
7637 substitution results in an invalid type, as described above,
7638 type deduction fails. */
7639 if (tsubst (TREE_TYPE (fn
), targs
, /*complain=*/0, NULL_TREE
)
7646 /* Adjust types before performing type deduction, as described in
7647 [temp.deduct.call] and [temp.deduct.conv]. The rules in these two
7648 sections are symmetric. PARM is the type of a function parameter
7649 or the return type of the conversion function. ARG is the type of
7650 the argument passed to the call, or the type of the value
7651 intialized with the result of the conversion function. */
7654 maybe_adjust_types_for_deduction (strict
, parm
, arg
)
7655 unification_kind_t strict
;
7666 /* Swap PARM and ARG throughout the remainder of this
7667 function; the handling is precisely symmetric since PARM
7668 will initialize ARG rather than vice versa. */
7676 /* There is nothing to do in this case. */
7680 my_friendly_abort (0);
7683 if (TREE_CODE (*parm
) != REFERENCE_TYPE
)
7685 /* [temp.deduct.call]
7687 If P is not a reference type:
7689 --If A is an array type, the pointer type produced by the
7690 array-to-pointer standard conversion (_conv.array_) is
7691 used in place of A for type deduction; otherwise,
7693 --If A is a function type, the pointer type produced by
7694 the function-to-pointer standard conversion
7695 (_conv.func_) is used in place of A for type deduction;
7698 --If A is a cv-qualified type, the top level
7699 cv-qualifiers of A's type are ignored for type
7701 if (TREE_CODE (*arg
) == ARRAY_TYPE
)
7702 *arg
= build_pointer_type (TREE_TYPE (*arg
));
7703 else if (TREE_CODE (*arg
) == FUNCTION_TYPE
)
7704 *arg
= build_pointer_type (*arg
);
7706 *arg
= TYPE_MAIN_VARIANT (*arg
);
7709 /* [temp.deduct.call]
7711 If P is a cv-qualified type, the top level cv-qualifiers
7712 of P's type are ignored for type deduction. If P is a
7713 reference type, the type referred to by P is used for
7715 *parm
= TYPE_MAIN_VARIANT (*parm
);
7716 if (TREE_CODE (*parm
) == REFERENCE_TYPE
)
7717 *parm
= TREE_TYPE (*parm
);
7720 /* Like type_unfication.
7722 If SUBR is 1, we're being called recursively (to unify the
7723 arguments of a function or method parameter of a function
7727 type_unification_real (tparms
, targs
, parms
, args
, subr
,
7728 strict
, allow_incomplete
)
7729 tree tparms
, targs
, parms
, args
;
7731 unification_kind_t strict
;
7732 int allow_incomplete
;
7736 int ntparms
= TREE_VEC_LENGTH (tparms
);
7739 my_friendly_assert (TREE_CODE (tparms
) == TREE_VEC
, 289);
7740 my_friendly_assert (parms
== NULL_TREE
7741 || TREE_CODE (parms
) == TREE_LIST
, 290);
7742 /* ARGS could be NULL (via a call from parse.y to
7743 build_x_function_call). */
7745 my_friendly_assert (TREE_CODE (args
) == TREE_LIST
, 291);
7746 my_friendly_assert (ntparms
> 0, 292);
7751 sub_strict
= UNIFY_ALLOW_MORE_CV_QUAL
| UNIFY_ALLOW_DERIVED
;
7755 sub_strict
= UNIFY_ALLOW_LESS_CV_QUAL
;
7759 sub_strict
= UNIFY_ALLOW_NONE
;
7763 my_friendly_abort (0);
7767 && parms
!= void_list_node
7769 && args
!= void_list_node
)
7771 parm
= TREE_VALUE (parms
);
7772 parms
= TREE_CHAIN (parms
);
7773 arg
= TREE_VALUE (args
);
7774 args
= TREE_CHAIN (args
);
7776 if (arg
== error_mark_node
)
7778 if (arg
== unknown_type_node
)
7779 /* We can't deduce anything from this, but we might get all the
7780 template args from other function args. */
7783 /* Conversions will be performed on a function argument that
7784 corresponds with a function parameter that contains only
7785 non-deducible template parameters and explicitly specified
7786 template parameters. */
7787 if (! uses_template_parms (parm
))
7791 if (TREE_CODE_CLASS (TREE_CODE (arg
)) != 't')
7792 type
= TREE_TYPE (arg
);
7799 if (strict
== DEDUCE_EXACT
)
7801 if (same_type_p (parm
, type
))
7805 /* It might work; we shouldn't check now, because we might
7806 get into infinite recursion. Overload resolution will
7813 if (TREE_CODE_CLASS (TREE_CODE (arg
)) != 't')
7815 my_friendly_assert (TREE_TYPE (arg
) != NULL_TREE
, 293);
7816 if (type_unknown_p (arg
))
7818 /* [temp.deduct.type] A template-argument can be deduced from
7819 a pointer to function or pointer to member function
7820 argument if the set of overloaded functions does not
7821 contain function templates and at most one of a set of
7822 overloaded functions provides a unique match. */
7824 if (resolve_overloaded_unification
7825 (tparms
, targs
, parm
, arg
, strict
, sub_strict
)
7830 arg
= TREE_TYPE (arg
);
7834 maybe_adjust_types_for_deduction (strict
, &parm
, &arg
);
7836 switch (unify (tparms
, targs
, parm
, arg
, sub_strict
))
7844 /* Fail if we've reached the end of the parm list, and more args
7845 are present, and the parm list isn't variadic. */
7846 if (args
&& args
!= void_list_node
&& parms
== void_list_node
)
7848 /* Fail if parms are left and they don't have default values. */
7850 && parms
!= void_list_node
7851 && TREE_PURPOSE (parms
) == NULL_TREE
)
7854 for (i
= 0; i
< ntparms
; i
++)
7855 if (TREE_VEC_ELT (targs
, i
) == NULL_TREE
)
7857 if (!allow_incomplete
)
7858 error ("incomplete type unification");
7864 /* Subroutine of type_unification_real. Args are like the variables at the
7865 call site. ARG is an overloaded function (or template-id); we try
7866 deducing template args from each of the overloads, and if only one
7867 succeeds, we go with that. Modifies TARGS and returns 0 on success. */
7870 resolve_overloaded_unification (tparms
, targs
, parm
, arg
, strict
,
7872 tree tparms
, targs
, parm
, arg
;
7873 unification_kind_t strict
;
7876 tree tempargs
= copy_node (targs
);
7879 if (TREE_CODE (arg
) == ADDR_EXPR
)
7880 arg
= TREE_OPERAND (arg
, 0);
7882 if (TREE_CODE (arg
) == COMPONENT_REF
)
7883 /* Handle `&x' where `x' is some static or non-static member
7885 arg
= TREE_OPERAND (arg
, 1);
7887 if (TREE_CODE (arg
) == OFFSET_REF
)
7888 arg
= TREE_OPERAND (arg
, 1);
7890 /* Strip baselink information. */
7891 while (TREE_CODE (arg
) == TREE_LIST
)
7892 arg
= TREE_VALUE (arg
);
7894 if (TREE_CODE (arg
) == TEMPLATE_ID_EXPR
)
7896 /* If we got some explicit template args, we need to plug them into
7897 the affected templates before we try to unify, in case the
7898 explicit args will completely resolve the templates in question. */
7900 tree expl_subargs
= TREE_OPERAND (arg
, 1);
7901 arg
= TREE_OPERAND (arg
, 0);
7903 for (; arg
; arg
= OVL_NEXT (arg
))
7905 tree fn
= OVL_CURRENT (arg
);
7908 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
7911 subargs
= get_bindings_overload (fn
, DECL_RESULT (fn
), expl_subargs
);
7914 elem
= tsubst (TREE_TYPE (fn
), subargs
, /*complain=*/0,
7916 if (TREE_CODE (elem
) == METHOD_TYPE
)
7917 elem
= build_ptrmemfunc_type (build_pointer_type (elem
));
7918 good
+= try_one_overload (tparms
, targs
, tempargs
, parm
, elem
,
7919 strict
, sub_strict
);
7923 else if (TREE_CODE (arg
) == OVERLOAD
)
7925 for (; arg
; arg
= OVL_NEXT (arg
))
7927 tree type
= TREE_TYPE (OVL_CURRENT (arg
));
7928 if (TREE_CODE (type
) == METHOD_TYPE
)
7929 type
= build_ptrmemfunc_type (build_pointer_type (type
));
7930 good
+= try_one_overload (tparms
, targs
, tempargs
, parm
,
7932 strict
, sub_strict
);
7936 my_friendly_abort (981006);
7938 /* [temp.deduct.type] A template-argument can be deduced from a pointer
7939 to function or pointer to member function argument if the set of
7940 overloaded functions does not contain function templates and at most
7941 one of a set of overloaded functions provides a unique match.
7943 So if we found multiple possibilities, we return success but don't
7948 int i
= TREE_VEC_LENGTH (targs
);
7950 if (TREE_VEC_ELT (tempargs
, i
))
7951 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (tempargs
, i
);
7959 /* Subroutine of resolve_overloaded_unification; does deduction for a single
7960 overload. Fills TARGS with any deduced arguments, or error_mark_node if
7961 different overloads deduce different arguments for a given parm.
7962 Returns 1 on success. */
7965 try_one_overload (tparms
, orig_targs
, targs
, parm
, arg
, strict
,
7967 tree tparms
, orig_targs
, targs
, parm
, arg
;
7968 unification_kind_t strict
;
7975 /* [temp.deduct.type] A template-argument can be deduced from a pointer
7976 to function or pointer to member function argument if the set of
7977 overloaded functions does not contain function templates and at most
7978 one of a set of overloaded functions provides a unique match.
7980 So if this is a template, just return success. */
7982 if (uses_template_parms (arg
))
7985 maybe_adjust_types_for_deduction (strict
, &parm
, &arg
);
7987 /* We don't copy orig_targs for this because if we have already deduced
7988 some template args from previous args, unify would complain when we
7989 try to deduce a template parameter for the same argument, even though
7990 there isn't really a conflict. */
7991 nargs
= TREE_VEC_LENGTH (targs
);
7992 tempargs
= make_tree_vec (nargs
);
7994 if (unify (tparms
, tempargs
, parm
, arg
, sub_strict
) != 0)
7997 /* First make sure we didn't deduce anything that conflicts with
7998 explicitly specified args. */
7999 for (i
= nargs
; i
--; )
8001 tree elt
= TREE_VEC_ELT (tempargs
, i
);
8002 tree oldelt
= TREE_VEC_ELT (orig_targs
, i
);
8004 if (elt
== NULL_TREE
)
8006 else if (uses_template_parms (elt
))
8008 /* Since we're unifying against ourselves, we will fill in template
8009 args used in the function parm list with our own template parms.
8011 TREE_VEC_ELT (tempargs
, i
) = NULL_TREE
;
8014 else if (oldelt
&& ! template_args_equal (oldelt
, elt
))
8018 for (i
= nargs
; i
--; )
8020 tree elt
= TREE_VEC_ELT (tempargs
, i
);
8023 TREE_VEC_ELT (targs
, i
) = elt
;
8029 /* PARM is a template class (perhaps with unbound template
8030 parameters). ARG is a fully instantiated type. If ARG can be
8031 bound to PARM, return ARG, otherwise return NULL_TREE. TPARMS and
8032 TARGS are as for unify. */
8035 try_class_unification (tparms
, targs
, parm
, arg
)
8044 if (!CLASSTYPE_TEMPLATE_INFO (arg
)
8045 || CLASSTYPE_TI_TEMPLATE (arg
) != CLASSTYPE_TI_TEMPLATE (parm
))
8048 /* We need to make a new template argument vector for the call to
8049 unify. If we used TARGS, we'd clutter it up with the result of
8050 the attempted unification, even if this class didn't work out.
8051 We also don't want to commit ourselves to all the unifications
8052 we've already done, since unification is supposed to be done on
8053 an argument-by-argument basis. In other words, consider the
8054 following pathological case:
8056 template <int I, int J, int K>
8059 template <int I, int J>
8060 struct S<I, J, 2> : public S<I, I, I>, S<J, J, J> {};
8062 template <int I, int J, int K>
8063 void f(S<I, J, K>, S<I, I, I>);
8072 Now, by the time we consider the unification involving `s2', we
8073 already know that we must have `f<0, 0, 0>'. But, even though
8074 `S<0, 1, 2>' is derived from `S<0, 0, 0>', the code is not legal
8075 because there are two ways to unify base classes of S<0, 1, 2>
8076 with S<I, I, I>. If we kept the already deduced knowledge, we
8077 would reject the possibility I=1. */
8078 copy_of_targs
= make_tree_vec (TREE_VEC_LENGTH (targs
));
8079 i
= unify (tparms
, copy_of_targs
, CLASSTYPE_TI_ARGS (parm
),
8080 CLASSTYPE_TI_ARGS (arg
), UNIFY_ALLOW_NONE
);
8082 /* If unification failed, we're done. */
8089 /* Subroutine of get_template_base. RVAL, if non-NULL, is a base we
8090 have alreay discovered to be satisfactory. ARG_BINFO is the binfo
8091 for the base class of ARG that we are currently examining. */
8094 get_template_base_recursive (tparms
, targs
, parm
,
8095 arg_binfo
, rval
, flags
)
8105 tree arg
= BINFO_TYPE (arg_binfo
);
8107 if (!(flags
& GTB_IGNORE_TYPE
))
8109 tree r
= try_class_unification (tparms
, targs
,
8112 /* If there is more than one satisfactory baseclass, then:
8116 If they yield more than one possible deduced A, the type
8120 if (r
&& rval
&& !same_type_p (r
, rval
))
8121 return error_mark_node
;
8126 binfos
= BINFO_BASETYPES (arg_binfo
);
8127 n_baselinks
= binfos
? TREE_VEC_LENGTH (binfos
) : 0;
8129 /* Process base types. */
8130 for (i
= 0; i
< n_baselinks
; i
++)
8132 tree base_binfo
= TREE_VEC_ELT (binfos
, i
);
8135 /* Skip this base, if we've already seen it. */
8136 if (BINFO_MARKED (base_binfo
))
8140 (flags
& GTB_VIA_VIRTUAL
) || TREE_VIA_VIRTUAL (base_binfo
);
8142 /* When searching for a non-virtual, we cannot mark virtually
8145 SET_BINFO_MARKED (base_binfo
);
8147 rval
= get_template_base_recursive (tparms
, targs
,
8151 GTB_VIA_VIRTUAL
* this_virtual
);
8153 /* If we discovered more than one matching base class, we can
8155 if (rval
== error_mark_node
)
8156 return error_mark_node
;
8162 /* Given a template type PARM and a class type ARG, find the unique
8163 base type in ARG that is an instance of PARM. We do not examine
8164 ARG itself; only its base-classes. If there is no appropriate base
8165 class, return NULL_TREE. If there is more than one, return
8166 error_mark_node. PARM may be the type of a partial specialization,
8167 as well as a plain template type. Used by unify. */
8170 get_template_base (tparms
, targs
, parm
, arg
)
8179 my_friendly_assert (IS_AGGR_TYPE_CODE (TREE_CODE (arg
)), 92);
8181 arg_binfo
= TYPE_BINFO (complete_type (arg
));
8182 rval
= get_template_base_recursive (tparms
, targs
,
8187 /* Since get_template_base_recursive marks the bases classes, we
8188 must unmark them here. */
8189 dfs_walk (arg_binfo
, dfs_unmark
, markedp
, 0);
8194 /* Returns the level of DECL, which declares a template parameter. */
8197 template_decl_level (decl
)
8200 switch (TREE_CODE (decl
))
8204 return TEMPLATE_TYPE_LEVEL (TREE_TYPE (decl
));
8207 return TEMPLATE_PARM_LEVEL (DECL_INITIAL (decl
));
8210 my_friendly_abort (0);
8215 /* Decide whether ARG can be unified with PARM, considering only the
8216 cv-qualifiers of each type, given STRICT as documented for unify.
8217 Returns non-zero iff the unification is OK on that basis.*/
8220 check_cv_quals_for_unify (strict
, arg
, parm
)
8225 if (!(strict
& UNIFY_ALLOW_MORE_CV_QUAL
)
8226 && !at_least_as_qualified_p (arg
, parm
))
8229 if (!(strict
& UNIFY_ALLOW_LESS_CV_QUAL
)
8230 && !at_least_as_qualified_p (parm
, arg
))
8236 /* Takes parameters as for type_unification. Returns 0 if the
8237 type deduction suceeds, 1 otherwise. The parameter STRICT is a
8238 bitwise or of the following flags:
8241 Require an exact match between PARM and ARG.
8242 UNIFY_ALLOW_MORE_CV_QUAL:
8243 Allow the deduced ARG to be more cv-qualified than ARG.
8244 UNIFY_ALLOW_LESS_CV_QUAL:
8245 Allow the deduced ARG to be less cv-qualified than ARG.
8246 UNIFY_ALLOW_DERIVED:
8247 Allow the deduced ARG to be a template base class of ARG,
8248 or a pointer to a template base class of the type pointed to by
8250 UNIFY_ALLOW_INTEGER:
8251 Allow any integral type to be deduced. See the TEMPLATE_PARM_INDEX
8252 case for more information. */
8255 unify (tparms
, targs
, parm
, arg
, strict
)
8256 tree tparms
, targs
, parm
, arg
;
8263 /* I don't think this will do the right thing with respect to types.
8264 But the only case I've seen it in so far has been array bounds, where
8265 signedness is the only information lost, and I think that will be
8267 while (TREE_CODE (parm
) == NOP_EXPR
)
8268 parm
= TREE_OPERAND (parm
, 0);
8270 if (arg
== error_mark_node
)
8272 if (arg
== unknown_type_node
)
8273 /* We can't deduce anything from this, but we might get all the
8274 template args from other function args. */
8277 /* If PARM uses template parameters, then we can't bail out here,
8278 even if ARG == PARM, since we won't record unifications for the
8279 template parameters. We might need them if we're trying to
8280 figure out which of two things is more specialized. */
8281 if (arg
== parm
&& !uses_template_parms (parm
))
8284 /* Immediately reject some pairs that won't unify because of
8285 cv-qualification mismatches. */
8286 if (TREE_CODE (arg
) == TREE_CODE (parm
)
8287 && TREE_CODE_CLASS (TREE_CODE (arg
)) == 't'
8288 /* We check the cv-qualifiers when unifying with template type
8289 parameters below. We want to allow ARG `const T' to unify with
8290 PARM `T' for example, when computing which of two templates
8291 is more specialized, for example. */
8292 && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
8293 && !check_cv_quals_for_unify (strict
, arg
, parm
))
8296 switch (TREE_CODE (parm
))
8299 /* In a type which contains a nested-name-specifier, template
8300 argument values cannot be deduced for template parameters used
8301 within the nested-name-specifier. */
8304 case TEMPLATE_TYPE_PARM
:
8305 case TEMPLATE_TEMPLATE_PARM
:
8306 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
8308 if (TEMPLATE_TYPE_LEVEL (parm
)
8309 != template_decl_level (tparm
))
8310 /* The PARM is not one we're trying to unify. Just check
8311 to see if it matches ARG. */
8312 return (TREE_CODE (arg
) == TREE_CODE (parm
)
8313 && same_type_p (parm
, arg
)) ? 0 : 1;
8314 idx
= TEMPLATE_TYPE_IDX (parm
);
8315 targ
= TREE_VEC_ELT (targs
, idx
);
8316 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, idx
));
8318 /* Check for mixed types and values. */
8319 if ((TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
8320 && TREE_CODE (tparm
) != TYPE_DECL
)
8321 || (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
8322 && TREE_CODE (tparm
) != TEMPLATE_DECL
))
8325 if (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
)
8327 if (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (parm
))
8329 /* We arrive here when PARM does not involve template
8332 /* ARG must be constructed from a template class. */
8333 if (TREE_CODE (arg
) != RECORD_TYPE
|| !CLASSTYPE_TEMPLATE_INFO (arg
))
8337 tree parmtmpl
= TYPE_TI_TEMPLATE (parm
);
8338 tree parmvec
= TYPE_TI_ARGS (parm
);
8339 tree argvec
= CLASSTYPE_TI_ARGS (arg
);
8341 = DECL_INNERMOST_TEMPLATE_PARMS (CLASSTYPE_TI_TEMPLATE (arg
));
8344 /* The parameter and argument roles have to be switched here
8345 in order to handle default arguments properly. For example,
8346 template<template <class> class TT> void f(TT<int>)
8347 should be able to accept vector<int> which comes from
8348 template <class T, class Allocator = allocator>
8351 if (coerce_template_parms (argtmplvec
, parmvec
, parmtmpl
, 0, 1)
8355 /* Deduce arguments T, i from TT<T> or TT<i>.
8356 We check each element of PARMVEC and ARGVEC individually
8357 rather than the whole TREE_VEC since they can have
8358 different number of elements. */
8360 for (i
= 0; i
< TREE_VEC_LENGTH (parmvec
); ++i
)
8362 tree t
= TREE_VEC_ELT (parmvec
, i
);
8364 if (unify (tparms
, targs
, t
,
8365 TREE_VEC_ELT (argvec
, i
),
8370 arg
= CLASSTYPE_TI_TEMPLATE (arg
);
8375 /* If PARM is `const T' and ARG is only `int', we don't have
8376 a match unless we are allowing additional qualification.
8377 If ARG is `const int' and PARM is just `T' that's OK;
8378 that binds `const int' to `T'. */
8379 if (!check_cv_quals_for_unify (strict
| UNIFY_ALLOW_LESS_CV_QUAL
,
8383 /* Consider the case where ARG is `const volatile int' and
8384 PARM is `const T'. Then, T should be `volatile int'. */
8386 cp_build_qualified_type_real (arg
,
8388 & ~CP_TYPE_QUALS (parm
),
8390 if (arg
== error_mark_node
)
8394 /* Simple cases: Value already set, does match or doesn't. */
8395 if (targ
!= NULL_TREE
&& same_type_p (targ
, arg
))
8400 /* Make sure that ARG is not a variable-sized array. (Note that
8401 were talking about variable-sized arrays (like `int[n]'),
8402 rather than arrays of unknown size (like `int[]').) We'll
8403 get very confused by such a type since the bound of the array
8404 will not be computable in an instantiation. Besides, such
8405 types are not allowed in ISO C++, so we can do as we please
8407 if (TREE_CODE (arg
) == ARRAY_TYPE
8408 && !uses_template_parms (arg
)
8409 && (TREE_CODE (TYPE_MAX_VALUE (TYPE_DOMAIN (arg
)))
8413 TREE_VEC_ELT (targs
, idx
) = arg
;
8416 case TEMPLATE_PARM_INDEX
:
8417 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
8419 if (TEMPLATE_PARM_LEVEL (parm
)
8420 != template_decl_level (tparm
))
8421 /* The PARM is not one we're trying to unify. Just check
8422 to see if it matches ARG. */
8423 return (TREE_CODE (arg
) == TREE_CODE (parm
)
8424 && cp_tree_equal (parm
, arg
) > 0) ? 0 : 1;
8426 idx
= TEMPLATE_PARM_IDX (parm
);
8427 targ
= TREE_VEC_ELT (targs
, idx
);
8431 int i
= (cp_tree_equal (targ
, arg
) > 0);
8437 my_friendly_abort (42);
8440 /* [temp.deduct.type] If, in the declaration of a function template
8441 with a non-type template-parameter, the non-type
8442 template-parameter is used in an expression in the function
8443 parameter-list and, if the corresponding template-argument is
8444 deduced, the template-argument type shall match the type of the
8445 template-parameter exactly, except that a template-argument
8446 deduced from an array bound may be of any integral type. */
8447 if (same_type_p (TREE_TYPE (arg
), TREE_TYPE (parm
)))
8449 else if ((strict
& UNIFY_ALLOW_INTEGER
)
8450 && (TREE_CODE (TREE_TYPE (parm
)) == INTEGER_TYPE
8451 || TREE_CODE (TREE_TYPE (parm
)) == BOOLEAN_TYPE
))
8456 TREE_VEC_ELT (targs
, idx
) = arg
;
8463 if (TREE_CODE (arg
) != POINTER_TYPE
)
8466 /* [temp.deduct.call]
8468 A can be another pointer or pointer to member type that can
8469 be converted to the deduced A via a qualification
8470 conversion (_conv.qual_).
8472 We pass down STRICT here rather than UNIFY_ALLOW_NONE.
8473 This will allow for additional cv-qualification of the
8474 pointed-to types if appropriate. In general, this is a bit
8475 too generous; we are only supposed to allow qualification
8476 conversions and this method will allow an ARG of char** and
8477 a deduced ARG of const char**. However, overload
8478 resolution will subsequently invalidate the candidate, so
8479 this is probably OK. */
8480 sub_strict
= strict
;
8482 if (TREE_CODE (TREE_TYPE (arg
)) != RECORD_TYPE
)
8483 /* The derived-to-base conversion only persists through one
8484 level of pointers. */
8485 sub_strict
&= ~UNIFY_ALLOW_DERIVED
;
8487 return unify (tparms
, targs
, TREE_TYPE (parm
),
8488 TREE_TYPE (arg
), sub_strict
);
8491 case REFERENCE_TYPE
:
8492 if (TREE_CODE (arg
) != REFERENCE_TYPE
)
8494 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
8498 if (TREE_CODE (arg
) != ARRAY_TYPE
)
8500 if ((TYPE_DOMAIN (parm
) == NULL_TREE
)
8501 != (TYPE_DOMAIN (arg
) == NULL_TREE
))
8503 if (TYPE_DOMAIN (parm
) != NULL_TREE
8504 && unify (tparms
, targs
, TYPE_DOMAIN (parm
),
8505 TYPE_DOMAIN (arg
), UNIFY_ALLOW_NONE
) != 0)
8507 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
8515 if (TREE_CODE (arg
) != TREE_CODE (parm
))
8518 if (TREE_CODE (parm
) == INTEGER_TYPE
8519 && TREE_CODE (TYPE_MAX_VALUE (parm
)) != INTEGER_CST
)
8521 if (TYPE_MIN_VALUE (parm
) && TYPE_MIN_VALUE (arg
)
8522 && unify (tparms
, targs
, TYPE_MIN_VALUE (parm
),
8523 TYPE_MIN_VALUE (arg
), UNIFY_ALLOW_INTEGER
))
8525 if (TYPE_MAX_VALUE (parm
) && TYPE_MAX_VALUE (arg
)
8526 && unify (tparms
, targs
, TYPE_MAX_VALUE (parm
),
8527 TYPE_MAX_VALUE (arg
), UNIFY_ALLOW_INTEGER
))
8530 /* We use the TYPE_MAIN_VARIANT since we have already
8531 checked cv-qualification at the top of the
8533 else if (!same_type_p (TYPE_MAIN_VARIANT (arg
),
8534 TYPE_MAIN_VARIANT (parm
)))
8537 /* As far as unification is concerned, this wins. Later checks
8538 will invalidate it if necessary. */
8541 /* Types INTEGER_CST and MINUS_EXPR can come from array bounds. */
8542 /* Type INTEGER_CST can come from ordinary constant template args. */
8544 while (TREE_CODE (arg
) == NOP_EXPR
)
8545 arg
= TREE_OPERAND (arg
, 0);
8547 if (TREE_CODE (arg
) != INTEGER_CST
)
8549 return !tree_int_cst_equal (parm
, arg
);
8554 if (TREE_CODE (arg
) != TREE_VEC
)
8556 if (TREE_VEC_LENGTH (parm
) != TREE_VEC_LENGTH (arg
))
8558 for (i
= TREE_VEC_LENGTH (parm
) - 1; i
>= 0; i
--)
8559 if (unify (tparms
, targs
,
8560 TREE_VEC_ELT (parm
, i
), TREE_VEC_ELT (arg
, i
),
8568 if (TREE_CODE (arg
) != TREE_CODE (parm
))
8571 if (TYPE_PTRMEMFUNC_P (parm
))
8573 if (!TYPE_PTRMEMFUNC_P (arg
))
8576 return unify (tparms
, targs
,
8577 TYPE_PTRMEMFUNC_FN_TYPE (parm
),
8578 TYPE_PTRMEMFUNC_FN_TYPE (arg
),
8582 if (CLASSTYPE_TEMPLATE_INFO (parm
))
8586 if (strict
& UNIFY_ALLOW_DERIVED
)
8588 /* First, we try to unify the PARM and ARG directly. */
8589 t
= try_class_unification (tparms
, targs
,
8594 /* Fallback to the special case allowed in
8597 If P is a class, and P has the form
8598 template-id, then A can be a derived class of
8599 the deduced A. Likewise, if P is a pointer to
8600 a class of the form template-id, A can be a
8601 pointer to a derived class pointed to by the
8603 t
= get_template_base (tparms
, targs
,
8606 if (! t
|| t
== error_mark_node
)
8610 else if (CLASSTYPE_TEMPLATE_INFO (arg
)
8611 && (CLASSTYPE_TI_TEMPLATE (parm
)
8612 == CLASSTYPE_TI_TEMPLATE (arg
)))
8613 /* Perhaps PARM is something like S<U> and ARG is S<int>.
8614 Then, we should unify `int' and `U'. */
8617 /* There's no chance of unication succeeding. */
8620 return unify (tparms
, targs
, CLASSTYPE_TI_ARGS (parm
),
8621 CLASSTYPE_TI_ARGS (t
), UNIFY_ALLOW_NONE
);
8623 else if (!same_type_p (TYPE_MAIN_VARIANT (parm
),
8624 TYPE_MAIN_VARIANT (arg
)))
8630 if (TREE_CODE (arg
) != TREE_CODE (parm
))
8633 if (unify (tparms
, targs
, TREE_TYPE (parm
),
8634 TREE_TYPE (arg
), UNIFY_ALLOW_NONE
))
8636 return type_unification_real (tparms
, targs
, TYPE_ARG_TYPES (parm
),
8637 TYPE_ARG_TYPES (arg
), 1,
8641 if (TREE_CODE (arg
) != OFFSET_TYPE
)
8643 if (unify (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
8644 TYPE_OFFSET_BASETYPE (arg
), UNIFY_ALLOW_NONE
))
8646 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
8650 if (arg
!= decl_constant_value (parm
))
8655 /* Matched cases are handled by the ARG == PARM test above. */
8659 if (TREE_CODE (TREE_OPERAND (parm
, 1)) == INTEGER_CST
)
8661 /* We handle this case specially, since it comes up with
8662 arrays. In particular, something like:
8664 template <int N> void f(int (&x)[N]);
8666 Here, we are trying to unify the range type, which
8667 looks like [0 ... (N - 1)]. */
8669 t1
= TREE_OPERAND (parm
, 0);
8670 t2
= TREE_OPERAND (parm
, 1);
8672 /* Should this be a regular fold? */
8673 t
= maybe_fold_nontype_arg (build (PLUS_EXPR
,
8677 return unify (tparms
, targs
, t1
, t
, strict
);
8679 /* else fall through */
8682 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (parm
))))
8683 /* We're looking at an expression. This can happen with
8687 void foo(S<I>, S<I + 2>);
8689 This is a "nondeduced context":
8693 The nondeduced contexts are:
8695 --A type that is a template-id in which one or more of
8696 the template-arguments is an expression that references
8697 a template-parameter.
8699 In these cases, we assume deduction succeeded, but don't
8700 actually infer any unifications. */
8703 sorry ("use of `%s' in template type unification",
8704 tree_code_name
[(int) TREE_CODE (parm
)]);
8710 /* Called if RESULT is explicitly instantiated, or is a member of an
8711 explicitly instantiated class, or if using -frepo and the
8712 instantiation of RESULT has been assigned to this file. */
8715 mark_decl_instantiated (result
, extern_p
)
8719 if (TREE_CODE (result
) != FUNCTION_DECL
)
8720 /* The TREE_PUBLIC flag for function declarations will have been
8721 set correctly by tsubst. */
8722 TREE_PUBLIC (result
) = 1;
8726 DECL_INTERFACE_KNOWN (result
) = 1;
8727 DECL_NOT_REALLY_EXTERN (result
) = 1;
8729 /* Always make artificials weak. */
8730 if (DECL_ARTIFICIAL (result
) && flag_weak
)
8731 comdat_linkage (result
);
8732 /* For WIN32 we also want to put explicit instantiations in
8733 linkonce sections. */
8734 else if (TREE_PUBLIC (result
))
8735 maybe_make_one_only (result
);
8737 else if (TREE_CODE (result
) == FUNCTION_DECL
)
8738 mark_inline_for_output (result
);
8741 /* Given two function templates PAT1 and PAT2, and explicit template
8742 arguments EXPLICIT_ARGS return:
8744 1 if PAT1 is more specialized than PAT2 as described in [temp.func.order].
8745 -1 if PAT2 is more specialized than PAT1.
8746 0 if neither is more specialized. */
8749 more_specialized (pat1
, pat2
, explicit_args
)
8750 tree pat1
, pat2
, explicit_args
;
8755 targs
= get_bindings_overload (pat1
, DECL_RESULT (pat2
), explicit_args
);
8759 targs
= get_bindings_overload (pat2
, DECL_RESULT (pat1
), explicit_args
);
8766 /* Given two class template specialization list nodes PAT1 and PAT2, return:
8768 1 if PAT1 is more specialized than PAT2 as described in [temp.class.order].
8769 -1 if PAT2 is more specialized than PAT1.
8770 0 if neither is more specialized. */
8773 more_specialized_class (pat1
, pat2
)
8779 targs
= get_class_bindings (TREE_VALUE (pat1
), TREE_PURPOSE (pat1
),
8780 TREE_PURPOSE (pat2
));
8784 targs
= get_class_bindings (TREE_VALUE (pat2
), TREE_PURPOSE (pat2
),
8785 TREE_PURPOSE (pat1
));
8792 /* Return the template arguments that will produce the function signature
8793 DECL from the function template FN, with the explicit template
8794 arguments EXPLICIT_ARGS. If CHECK_RETTYPE is 1, the return type must
8795 also match. Return NULL_TREE if no satisfactory arguments could be
8799 get_bindings_real (fn
, decl
, explicit_args
, check_rettype
)
8800 tree fn
, decl
, explicit_args
;
8803 int ntparms
= DECL_NTPARMS (fn
);
8804 tree targs
= make_tree_vec (ntparms
);
8806 tree decl_arg_types
;
8809 /* Substitute the explicit template arguments into the type of DECL.
8810 The call to fn_type_unification will handle substitution into the
8812 decl_type
= TREE_TYPE (decl
);
8813 if (explicit_args
&& uses_template_parms (decl_type
))
8816 tree converted_args
;
8818 if (DECL_TEMPLATE_INFO (decl
))
8819 tmpl
= DECL_TI_TEMPLATE (decl
);
8821 /* We can get here for some illegal specializations. */
8825 = (coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
8826 explicit_args
, NULL_TREE
,
8828 /*require_all_arguments=*/0));
8829 if (converted_args
== error_mark_node
)
8832 decl_type
= tsubst (decl_type
, converted_args
, /*complain=*/0,
8834 if (decl_type
== error_mark_node
)
8838 /* If FN is a static member function, adjust the type of DECL
8840 decl_arg_types
= TYPE_ARG_TYPES (decl_type
);
8841 if (DECL_STATIC_FUNCTION_P (fn
)
8842 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
8843 decl_arg_types
= TREE_CHAIN (decl_arg_types
);
8845 i
= fn_type_unification (fn
, explicit_args
, targs
,
8847 TREE_TYPE (decl_type
),
8855 /* Check to see that the resulting return type is also OK. */
8856 tree t
= tsubst (TREE_TYPE (TREE_TYPE (fn
)), targs
,
8857 /*complain=*/0, NULL_TREE
);
8859 if (!same_type_p (t
, TREE_TYPE (TREE_TYPE (decl
))))
8866 /* For most uses, we want to check the return type. */
8869 get_bindings (fn
, decl
, explicit_args
)
8870 tree fn
, decl
, explicit_args
;
8872 return get_bindings_real (fn
, decl
, explicit_args
, 1);
8875 /* But for more_specialized, we only care about the parameter types. */
8878 get_bindings_overload (fn
, decl
, explicit_args
)
8879 tree fn
, decl
, explicit_args
;
8881 return get_bindings_real (fn
, decl
, explicit_args
, 0);
8884 /* Return the innermost template arguments that, when applied to a
8885 template specialization whose innermost template parameters are
8886 TPARMS, and whose specialization arguments are ARGS, yield the
8889 For example, suppose we have:
8891 template <class T, class U> struct S {};
8892 template <class T> struct S<T*, int> {};
8894 Then, suppose we want to get `S<double*, int>'. The TPARMS will be
8895 {T}, the PARMS will be {T*, int} and the ARGS will be {double*,
8896 int}. The resulting vector will be {double}, indicating that `T'
8897 is bound to `double'. */
8900 get_class_bindings (tparms
, parms
, args
)
8901 tree tparms
, parms
, args
;
8903 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
8904 tree vec
= make_tree_vec (ntparms
);
8906 args
= innermost_args (args
);
8908 if (unify (tparms
, vec
, parms
, args
, UNIFY_ALLOW_NONE
))
8911 for (i
= 0; i
< ntparms
; ++i
)
8912 if (! TREE_VEC_ELT (vec
, i
))
8918 /* In INSTANTIATIONS is a list of <INSTANTIATION, TEMPLATE> pairs.
8919 Pick the most specialized template, and return the corresponding
8920 instantiation, or if there is no corresponding instantiation, the
8921 template itself. EXPLICIT_ARGS is any template arguments explicity
8922 mentioned in a template-id. If there is no most specialized
8923 tempalte, error_mark_node is returned. If there are no templates
8924 at all, NULL_TREE is returned. */
8927 most_specialized_instantiation (instantiations
, explicit_args
)
8928 tree instantiations
;
8934 if (!instantiations
)
8937 champ
= instantiations
;
8938 for (fn
= TREE_CHAIN (instantiations
); fn
; fn
= TREE_CHAIN (fn
))
8940 fate
= more_specialized (TREE_VALUE (champ
),
8941 TREE_VALUE (fn
), explicit_args
);
8948 fn
= TREE_CHAIN (fn
);
8950 return error_mark_node
;
8956 for (fn
= instantiations
; fn
&& fn
!= champ
; fn
= TREE_CHAIN (fn
))
8958 fate
= more_specialized (TREE_VALUE (champ
),
8959 TREE_VALUE (fn
), explicit_args
);
8961 return error_mark_node
;
8964 return TREE_PURPOSE (champ
) ? TREE_PURPOSE (champ
) : TREE_VALUE (champ
);
8967 /* Return the most specialized of the list of templates in FNS that can
8968 produce an instantiation matching DECL, given the explicit template
8969 arguments EXPLICIT_ARGS. */
8972 most_specialized (fns
, decl
, explicit_args
)
8973 tree fns
, decl
, explicit_args
;
8975 tree candidates
= NULL_TREE
;
8978 for (fn
= fns
; fn
; fn
= TREE_CHAIN (fn
))
8980 tree candidate
= TREE_VALUE (fn
);
8982 args
= get_bindings (candidate
, decl
, explicit_args
);
8984 candidates
= tree_cons (NULL_TREE
, candidate
, candidates
);
8987 return most_specialized_instantiation (candidates
, explicit_args
);
8990 /* If DECL is a specialization of some template, return the most
8991 general such template. For example, given:
8993 template <class T> struct S { template <class U> void f(U); };
8995 if TMPL is `template <class U> void S<int>::f(U)' this will return
8996 the full template. This function will not trace past partial
8997 specializations, however. For example, given in addition:
8999 template <class T> struct S<T*> { template <class U> void f(U); };
9001 if TMPL is `template <class U> void S<int*>::f(U)' this will return
9002 `template <class T> template <class U> S<T*>::f(U)'. */
9005 most_general_template (decl
)
9008 while (DECL_TEMPLATE_INFO (decl
)
9009 /* The DECL_TI_TEMPLATE can be a LOOKUP_EXPR or
9010 IDENTIFIER_NODE in some cases. (See cp-tree.h for
9012 && TREE_CODE (DECL_TI_TEMPLATE (decl
)) == TEMPLATE_DECL
)
9013 decl
= DECL_TI_TEMPLATE (decl
);
9018 /* Return the most specialized of the class template specializations
9019 of TMPL which can produce an instantiation matching ARGS, or
9020 error_mark_node if the choice is ambiguous. */
9023 most_specialized_class (tmpl
, args
)
9027 tree list
= NULL_TREE
;
9032 tmpl
= most_general_template (tmpl
);
9033 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
); t
; t
= TREE_CHAIN (t
))
9036 = get_class_bindings (TREE_VALUE (t
), TREE_PURPOSE (t
), args
);
9039 list
= decl_tree_cons (TREE_PURPOSE (t
), TREE_VALUE (t
), list
);
9040 TREE_TYPE (list
) = TREE_TYPE (t
);
9050 for (; t
; t
= TREE_CHAIN (t
))
9052 fate
= more_specialized_class (champ
, t
);
9061 return error_mark_node
;
9067 for (t
= list
; t
&& t
!= champ
; t
= TREE_CHAIN (t
))
9069 fate
= more_specialized_class (champ
, t
);
9071 return error_mark_node
;
9077 /* called from the parser. */
9080 do_decl_instantiation (declspecs
, declarator
, storage
)
9081 tree declspecs
, declarator
, storage
;
9083 tree decl
= grokdeclarator (declarator
, declspecs
, NORMAL
, 0, NULL_TREE
);
9084 tree result
= NULL_TREE
;
9088 /* An error ocurred, for which grokdeclarator has already issued
9089 an appropriate message. */
9091 else if (! DECL_LANG_SPECIFIC (decl
))
9093 cp_error ("explicit instantiation of non-template `%#D'", decl
);
9096 else if (TREE_CODE (decl
) == VAR_DECL
)
9098 /* There is an asymmetry here in the way VAR_DECLs and
9099 FUNCTION_DECLs are handled by grokdeclarator. In the case of
9100 the latter, the DECL we get back will be marked as a
9101 template instantiation, and the appropriate
9102 DECL_TEMPLATE_INFO will be set up. This does not happen for
9103 VAR_DECLs so we do the lookup here. Probably, grokdeclarator
9104 should handle VAR_DECLs as it currently handles
9106 result
= lookup_field (DECL_CONTEXT (decl
), DECL_NAME (decl
), 0, 0);
9107 if (result
&& TREE_CODE (result
) != VAR_DECL
)
9109 cp_error ("no matching template for `%D' found", result
);
9113 else if (TREE_CODE (decl
) != FUNCTION_DECL
)
9115 cp_error ("explicit instantiation of `%#D'", decl
);
9121 /* Check for various error cases. Note that if the explicit
9122 instantiation is legal the RESULT will currently be marked as an
9123 *implicit* instantiation; DECL_EXPLICIT_INSTANTIATION is not set
9124 until we get here. */
9126 if (DECL_TEMPLATE_SPECIALIZATION (result
))
9130 No program shall both explicitly instantiate and explicitly
9131 specialize a template. */
9132 cp_pedwarn ("explicit instantiation of `%#D' after", result
);
9133 cp_pedwarn_at ("explicit specialization here", result
);
9136 else if (DECL_EXPLICIT_INSTANTIATION (result
))
9140 No program shall explicitly instantiate any template more
9143 We check DECL_INTERFACE_KNOWN so as not to complain when the first
9144 instantiation was `extern' and the second is not, and EXTERN_P for
9145 the opposite case. If -frepo, chances are we already got marked
9146 as an explicit instantion because of the repo file. */
9147 if (DECL_INTERFACE_KNOWN (result
) && !extern_p
&& !flag_use_repository
)
9148 cp_pedwarn ("duplicate explicit instantiation of `%#D'", result
);
9150 /* If we've already instantiated the template, just return now. */
9151 if (DECL_INTERFACE_KNOWN (result
))
9154 else if (!DECL_IMPLICIT_INSTANTIATION (result
))
9156 cp_error ("no matching template for `%D' found", result
);
9159 else if (!DECL_TEMPLATE_INFO (result
))
9161 cp_pedwarn ("explicit instantiation of non-template `%#D'", result
);
9165 if (flag_external_templates
)
9168 if (storage
== NULL_TREE
)
9170 else if (storage
== ridpointers
[(int) RID_EXTERN
])
9173 cp_pedwarn ("ANSI C++ forbids the use of `extern' on explicit instantiations");
9177 cp_error ("storage class `%D' applied to template instantiation",
9180 SET_DECL_EXPLICIT_INSTANTIATION (result
);
9181 mark_decl_instantiated (result
, extern_p
);
9182 repo_template_instantiated (result
, extern_p
);
9184 instantiate_decl (result
);
9188 mark_class_instantiated (t
, extern_p
)
9192 SET_CLASSTYPE_EXPLICIT_INSTANTIATION (t
);
9193 SET_CLASSTYPE_INTERFACE_KNOWN (t
);
9194 CLASSTYPE_INTERFACE_ONLY (t
) = extern_p
;
9195 CLASSTYPE_VTABLE_NEEDS_WRITING (t
) = ! extern_p
;
9196 TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (t
)) = extern_p
;
9199 CLASSTYPE_DEBUG_REQUESTED (t
) = 1;
9200 rest_of_type_compilation (t
, 1);
9205 do_type_instantiation (t
, storage
)
9212 if (TREE_CODE (t
) == TYPE_DECL
)
9215 if (! CLASS_TYPE_P (t
) || ! CLASSTYPE_TEMPLATE_INFO (t
))
9217 cp_error ("explicit instantiation of non-template type `%T'", t
);
9223 /* With -fexternal-templates, explicit instantiations are treated the same
9224 as implicit ones. */
9225 if (flag_external_templates
)
9228 if (TYPE_SIZE (t
) == NULL_TREE
)
9230 cp_error ("explicit instantiation of `%#T' before definition of template",
9235 if (storage
!= NULL_TREE
)
9238 cp_pedwarn("ANSI C++ forbids the use of `%s' on explicit instantiations",
9239 IDENTIFIER_POINTER (storage
));
9241 if (storage
== ridpointers
[(int) RID_INLINE
])
9243 else if (storage
== ridpointers
[(int) RID_EXTERN
])
9245 else if (storage
== ridpointers
[(int) RID_STATIC
])
9249 cp_error ("storage class `%D' applied to template instantiation",
9255 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
9259 No program shall both explicitly instantiate and explicitly
9260 specialize a template. */
9261 cp_error ("explicit instantiation of `%#T' after", t
);
9262 cp_error_at ("explicit specialization here", t
);
9265 else if (CLASSTYPE_EXPLICIT_INSTANTIATION (t
))
9269 No program shall explicitly instantiate any template more
9272 If CLASSTYPE_INTERFACE_ONLY, then the first explicit instantiation
9273 was `extern'. If EXTERN_P then the second is. If -frepo, chances
9274 are we already got marked as an explicit instantion because of the
9275 repo file. All these cases are OK. */
9276 if (!CLASSTYPE_INTERFACE_ONLY (t
) && !extern_p
&& !flag_use_repository
)
9277 cp_pedwarn ("duplicate explicit instantiation of `%#T'", t
);
9279 /* If we've already instantiated the template, just return now. */
9280 if (!CLASSTYPE_INTERFACE_ONLY (t
))
9284 mark_class_instantiated (t
, extern_p
);
9285 repo_template_instantiated (t
, extern_p
);
9293 /* In contrast to implicit instantiation, where only the
9294 declarations, and not the definitions, of members are
9295 instantiated, we have here:
9299 The explicit instantiation of a class template specialization
9300 implies the instantiation of all of its members not
9301 previously explicitly specialized in the translation unit
9302 containing the explicit instantiation.
9304 Of course, we can't instantiate member template classes, since
9305 we don't have any arguments for them. Note that the standard
9306 is unclear on whether the instatiation of the members are
9307 *explicit* instantiations or not. We choose to be generous,
9308 and not set DECL_EXPLICIT_INSTANTIATION. Therefore, we allow
9309 the explicit instantiation of a class where some of the members
9310 have no definition in the current translation unit. */
9313 for (tmp
= TYPE_METHODS (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
9314 if (TREE_CODE (tmp
) == FUNCTION_DECL
9315 && DECL_TEMPLATE_INSTANTIATION (tmp
))
9317 mark_decl_instantiated (tmp
, extern_p
);
9318 repo_template_instantiated (tmp
, extern_p
);
9320 instantiate_decl (tmp
);
9323 for (tmp
= TYPE_FIELDS (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
9324 if (TREE_CODE (tmp
) == VAR_DECL
&& DECL_TEMPLATE_INSTANTIATION (tmp
))
9326 mark_decl_instantiated (tmp
, extern_p
);
9327 repo_template_instantiated (tmp
, extern_p
);
9329 instantiate_decl (tmp
);
9332 for (tmp
= CLASSTYPE_TAGS (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
9333 if (IS_AGGR_TYPE (TREE_VALUE (tmp
))
9334 && !uses_template_parms (CLASSTYPE_TI_ARGS (TREE_VALUE (tmp
))))
9335 do_type_instantiation (TYPE_MAIN_DECL (TREE_VALUE (tmp
)), storage
);
9339 /* Given a function DECL, which is a specialization of TMPL, modify
9340 DECL to be a re-instantiation of TMPL with the same template
9341 arguments. TMPL should be the template into which tsubst'ing
9342 should occur for DECL, not the most general template.
9344 One reason for doing this is a scenario like this:
9347 void f(const T&, int i);
9349 void g() { f(3, 7); }
9352 void f(const T& t, const int i) { }
9354 Note that when the template is first instantiated, with
9355 instantiate_template, the resulting DECL will have no name for the
9356 first parameter, and the wrong type for the second. So, when we go
9357 to instantiate the DECL, we regenerate it. */
9360 regenerate_decl_from_template (decl
, tmpl
)
9370 args
= DECL_TI_ARGS (decl
);
9371 code_pattern
= DECL_TEMPLATE_RESULT (tmpl
);
9373 /* Unregister the specialization so that when we tsubst we will not
9374 just return DECL. We don't have to unregister DECL from TMPL
9375 because if would only be registered there if it were a partial
9376 instantiation of a specialization, which it isn't: it's a full
9378 gen_tmpl
= most_general_template (tmpl
);
9379 unregistered
= unregister_specialization (decl
, gen_tmpl
);
9381 /* If the DECL was not unregistered then something peculiar is
9382 happening: we created a specialization but did not call
9383 register_specialization for it. */
9384 my_friendly_assert (unregistered
, 0);
9386 if (TREE_CODE (decl
) == VAR_DECL
)
9387 /* Make sure that we can see identifiers, and compute access
9388 correctly, for the class members used in the declaration of
9389 this static variable. */
9390 pushclass (DECL_CONTEXT (decl
), 2);
9392 /* Do the substitution to get the new declaration. */
9393 new_decl
= tsubst (code_pattern
, args
, /*complain=*/1, NULL_TREE
);
9395 if (TREE_CODE (decl
) == VAR_DECL
)
9397 /* Set up DECL_INITIAL, since tsubst doesn't. */
9398 DECL_INITIAL (new_decl
) =
9399 tsubst_expr (DECL_INITIAL (code_pattern
), args
,
9400 /*complain=*/1, DECL_TI_TEMPLATE (decl
));
9401 /* Pop the class context we pushed above. */
9404 else if (TREE_CODE (decl
) == FUNCTION_DECL
)
9406 /* Convince duplicate_decls to use the DECL_ARGUMENTS from the
9408 DECL_INITIAL (new_decl
) = error_mark_node
;
9409 /* And don't complain about a duplicate definition. */
9410 DECL_INITIAL (decl
) = NULL_TREE
;
9413 /* The immediate parent of the new template is still whatever it was
9414 before, even though tsubst sets DECL_TI_TEMPLATE up as the most
9415 general template. We also reset the DECL_ASSEMBLER_NAME since
9416 tsubst always calculates the name as if the function in question
9417 were really a template instance, and sometimes, with friend
9418 functions, this is not so. See tsubst_friend_function for
9420 DECL_TI_TEMPLATE (new_decl
) = DECL_TI_TEMPLATE (decl
);
9421 DECL_ASSEMBLER_NAME (new_decl
) = DECL_ASSEMBLER_NAME (decl
);
9422 DECL_RTL (new_decl
) = DECL_RTL (decl
);
9424 /* Call duplicate decls to merge the old and new declarations. */
9425 duplicate_decls (new_decl
, decl
);
9427 /* Now, re-register the specialization. */
9428 register_specialization (decl
, gen_tmpl
, args
);
9431 /* Produce the definition of D, a _DECL generated from a template. */
9434 instantiate_decl (d
)
9437 tree tmpl
= DECL_TI_TEMPLATE (d
);
9438 tree args
= DECL_TI_ARGS (d
);
9443 int nested
= in_function_p ();
9444 int pattern_defined
;
9446 char *file
= input_filename
;
9448 /* This function should only be used to instantiate templates for
9449 functions and static member variables. */
9450 my_friendly_assert (TREE_CODE (d
) == FUNCTION_DECL
9451 || TREE_CODE (d
) == VAR_DECL
, 0);
9453 if (DECL_TEMPLATE_INSTANTIATED (d
))
9454 /* D has already been instantiated. It might seem reasonable to
9455 check whether or not D is an explict instantiation, and, if so,
9456 stop here. But when an explicit instantiation is deferred
9457 until the end of the compilation, DECL_EXPLICIT_INSTANTIATION
9458 is set, even though we still need to do the instantiation. */
9461 /* If we already have a specialization of this declaration, then
9462 there's no reason to instantiate it. Note that
9463 retrieve_specialization gives us both instantiations and
9464 specializations, so we must explicitly check
9465 DECL_TEMPLATE_SPECIALIZATION. */
9466 gen_tmpl
= most_general_template (tmpl
);
9467 spec
= retrieve_specialization (gen_tmpl
, args
);
9468 if (spec
!= NULL_TREE
&& DECL_TEMPLATE_SPECIALIZATION (spec
))
9471 /* This needs to happen before any tsubsting. */
9472 if (! push_tinst_level (d
))
9475 /* Set TD to the template whose DECL_TEMPLATE_RESULT is the pattern
9476 for the instantiation. This is not always the most general
9477 template. Consider, for example:
9480 struct S { template <class U> void f();
9481 template <> void f<int>(); };
9483 and an instantiation of S<double>::f<int>. We want TD to be the
9484 specialization S<T>::f<int>, not the more general S<T>::f<U>. */
9487 /* An instantiation cannot have a definition, so we need a
9488 more general template. */
9489 DECL_TEMPLATE_INSTANTIATION (td
)
9490 /* We must also deal with friend templates. Given:
9492 template <class T> struct S {
9493 template <class U> friend void f() {};
9496 S<int>::f<U> say, is not an instantiation of S<T>::f<U>,
9497 so far as the language is concerned, but that's still
9498 where we get the pattern for the instantiation from. On
9499 ther hand, if the definition comes outside the class, say:
9501 template <class T> struct S {
9502 template <class U> friend void f();
9504 template <class U> friend void f() {}
9506 we don't need to look any further. That's what the check for
9507 DECL_INITIAL is for. */
9508 || (TREE_CODE (d
) == FUNCTION_DECL
9509 && DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (td
)
9510 && !DECL_INITIAL (DECL_TEMPLATE_RESULT (td
)));
9513 /* The present template, TD, should not be a definition. If it
9514 were a definition, we should be using it! Note that we
9515 cannot restructure the loop to just keep going until we find
9516 a template with a definition, since that might go too far if
9517 a specialization was declared, but not defined. */
9518 my_friendly_assert (!(TREE_CODE (d
) == VAR_DECL
9519 && !DECL_IN_AGGR_P (DECL_TEMPLATE_RESULT (td
))),
9522 /* Fetch the more general template. */
9523 td
= DECL_TI_TEMPLATE (td
);
9526 code_pattern
= DECL_TEMPLATE_RESULT (td
);
9528 if (TREE_CODE (d
) == FUNCTION_DECL
)
9529 pattern_defined
= (DECL_SAVED_TREE (code_pattern
) != NULL_TREE
);
9531 pattern_defined
= ! DECL_IN_AGGR_P (code_pattern
);
9533 push_to_top_level ();
9534 lineno
= DECL_SOURCE_LINE (d
);
9535 input_filename
= DECL_SOURCE_FILE (d
);
9537 if (pattern_defined
)
9539 repo_template_used (d
);
9541 if (flag_external_templates
&& ! DECL_INTERFACE_KNOWN (d
))
9543 if (flag_alt_external_templates
)
9545 if (interface_unknown
)
9546 warn_if_unknown_interface (d
);
9548 else if (DECL_INTERFACE_KNOWN (code_pattern
))
9550 DECL_INTERFACE_KNOWN (d
) = 1;
9551 DECL_NOT_REALLY_EXTERN (d
) = ! DECL_EXTERNAL (code_pattern
);
9554 warn_if_unknown_interface (code_pattern
);
9558 import_export_decl (d
);
9561 /* Reject all external templates except inline functions. */
9562 if (DECL_INTERFACE_KNOWN (d
)
9563 && ! DECL_NOT_REALLY_EXTERN (d
)
9564 && ! (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_INLINE (d
)))
9567 if (TREE_CODE (d
) == VAR_DECL
9568 && TREE_READONLY (d
)
9569 && DECL_INITIAL (d
) == NULL_TREE
9570 && DECL_INITIAL (code_pattern
) != NULL_TREE
)
9571 /* We need to set up DECL_INITIAL regardless of pattern_defined if
9572 the variable is a static const initialized in the class body. */;
9573 else if (! pattern_defined
9574 || (! (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_INLINE (d
) && nested
)
9577 /* Defer all templates except inline functions used in another
9578 function. We restore the source position here because it's used
9579 by add_pending_template. */
9581 input_filename
= file
;
9583 if (at_eof
&& !pattern_defined
9584 && DECL_EXPLICIT_INSTANTIATION (d
))
9587 The definition of a non-exported function template, a
9588 non-exported member function template, or a non-exported
9589 member function or static data member of a class template
9590 shall be present in every translation unit in which it is
9591 explicitly instantiated. */
9592 cp_error ("explicit instantiation of `%D' but no definition available",
9595 add_pending_template (d
);
9599 /* We're now committed to instantiating this template. Mark it as
9600 instantiated so that recursive calls to instantiate_decl do not
9601 try to instantiate it again. */
9602 DECL_TEMPLATE_INSTANTIATED (d
) = 1;
9604 /* Regenerate the declaration in case the template has been modified
9605 by a subsequent redeclaration. */
9606 regenerate_decl_from_template (d
, td
);
9608 /* We already set the file and line above. Reset them now in case
9609 they changed as a result of calling regenerate_decl_from_template. */
9610 lineno
= DECL_SOURCE_LINE (d
);
9611 input_filename
= DECL_SOURCE_FILE (d
);
9613 if (TREE_CODE (d
) == VAR_DECL
)
9615 DECL_IN_AGGR_P (d
) = 0;
9616 if (DECL_INTERFACE_KNOWN (d
))
9617 DECL_EXTERNAL (d
) = ! DECL_NOT_REALLY_EXTERN (d
);
9620 DECL_EXTERNAL (d
) = 1;
9621 DECL_NOT_REALLY_EXTERN (d
) = 1;
9623 cp_finish_decl (d
, DECL_INITIAL (d
), NULL_TREE
, 0, 0);
9625 else if (TREE_CODE (d
) == FUNCTION_DECL
)
9627 /* Set up context. */
9628 start_function (NULL_TREE
, d
, NULL_TREE
, SF_PRE_PARSED
);
9629 store_parm_decls ();
9631 /* Substitute into the body of the function. */
9632 tsubst_expr (DECL_SAVED_TREE (code_pattern
), args
,
9633 /*complain=*/1, tmpl
);
9635 /* Finish the function. */
9636 expand_body (finish_function (lineno
, 0));
9641 input_filename
= file
;
9643 pop_from_top_level ();
9649 /* Run through the list of templates that we wish we could
9650 instantiate, and instantiate any we can. */
9653 instantiate_pending_templates ()
9656 int instantiated_something
= 0;
9663 t
= &pending_templates
;
9666 tree srcloc
= TREE_PURPOSE (*t
);
9667 tree instantiation
= TREE_VALUE (*t
);
9669 input_filename
= SRCLOC_FILE (srcloc
);
9670 lineno
= SRCLOC_LINE (srcloc
);
9672 if (TREE_CODE_CLASS (TREE_CODE (instantiation
)) == 't')
9676 if (!TYPE_SIZE (instantiation
))
9678 instantiate_class_template (instantiation
);
9679 if (CLASSTYPE_TEMPLATE_INSTANTIATION (instantiation
))
9680 for (fn
= TYPE_METHODS (instantiation
);
9682 fn
= TREE_CHAIN (fn
))
9683 if (! DECL_ARTIFICIAL (fn
))
9684 instantiate_decl (fn
);
9685 if (TYPE_SIZE (instantiation
))
9687 instantiated_something
= 1;
9692 if (TYPE_SIZE (instantiation
))
9693 /* If INSTANTIATION has been instantiated, then we don't
9694 need to consider it again in the future. */
9695 *t
= TREE_CHAIN (*t
);
9697 t
= &TREE_CHAIN (*t
);
9701 if (DECL_TEMPLATE_INSTANTIATION (instantiation
)
9702 && !DECL_TEMPLATE_INSTANTIATED (instantiation
))
9704 instantiation
= instantiate_decl (instantiation
);
9705 if (DECL_TEMPLATE_INSTANTIATED (instantiation
))
9707 instantiated_something
= 1;
9712 if (!DECL_TEMPLATE_INSTANTIATION (instantiation
)
9713 || DECL_TEMPLATE_INSTANTIATED (instantiation
))
9714 /* If INSTANTIATION has been instantiated, then we don't
9715 need to consider it again in the future. */
9716 *t
= TREE_CHAIN (*t
);
9718 t
= &TREE_CHAIN (*t
);
9723 /* Go through the things that are template instantiations if we are
9724 using guiding declarations. */
9725 t
= &maybe_templates
;
9732 fn
= TREE_VALUE (*t
);
9734 if (DECL_INITIAL (fn
))
9735 /* If the FN is already defined, then it was either already
9736 instantiated or, even though guiding declarations were
9737 allowed, a non-template definition was provided. */
9741 template = TREE_PURPOSE (*t
);
9742 args
= get_bindings (template, fn
, NULL_TREE
);
9743 fn
= instantiate_template (template, args
);
9744 instantiate_decl (fn
);
9748 /* Remove this entry from the chain. */
9749 *t
= TREE_CHAIN (*t
);
9751 maybe_template_tail
= t
;
9755 return instantiated_something
;
9758 /* Substitute ARGVEC into T, which is a TREE_LIST. In particular, it
9759 is an initializer list: the TREE_PURPOSEs are DECLs, and the
9760 TREE_VALUEs are initializer values. Used by instantiate_decl. */
9763 tsubst_expr_values (t
, argvec
)
9766 tree first
= NULL_TREE
;
9769 for (; t
; t
= TREE_CHAIN (t
))
9771 tree pur
= tsubst_copy (TREE_PURPOSE (t
), argvec
,
9772 /*complain=*/1, NULL_TREE
);
9773 tree val
= tsubst_expr (TREE_VALUE (t
), argvec
, /*complain=*/1,
9775 *p
= build_tree_list (pur
, val
);
9776 p
= &TREE_CHAIN (*p
);
9781 /* D is an undefined function declaration in the presence of templates with
9782 the same name, listed in FNS. If one of them can produce D as an
9783 instantiation, remember this so we can instantiate it at EOF if D has
9784 not been defined by that time. */
9787 add_maybe_template (d
, fns
)
9792 if (DECL_MAYBE_TEMPLATE (d
))
9795 t
= most_specialized (fns
, d
, NULL_TREE
);
9798 if (t
== error_mark_node
)
9800 cp_error ("ambiguous template instantiation for `%D'", d
);
9804 *maybe_template_tail
= tree_cons (t
, d
, NULL_TREE
);
9805 maybe_template_tail
= &TREE_CHAIN (*maybe_template_tail
);
9806 DECL_MAYBE_TEMPLATE (d
) = 1;
9809 /* Set CURRENT_ACCESS_SPECIFIER based on the protection of DECL. */
9812 set_current_access_from_decl (decl
)
9815 if (TREE_PRIVATE (decl
))
9816 current_access_specifier
= access_private_node
;
9817 else if (TREE_PROTECTED (decl
))
9818 current_access_specifier
= access_protected_node
;
9820 current_access_specifier
= access_public_node
;
9823 /* Instantiate an enumerated type. TAG is the template type, NEWTAG
9824 is the instantiation (which should have been created with
9825 start_enum) and ARGS are the template arguments to use. */
9828 tsubst_enum (tag
, newtag
, args
)
9835 for (e
= TYPE_VALUES (tag
); e
; e
= TREE_CHAIN (e
))
9840 /* Note that in a template enum, the TREE_VALUE is the
9841 CONST_DECL, not the corresponding INTEGER_CST. */
9842 value
= tsubst_expr (DECL_INITIAL (TREE_VALUE (e
)),
9843 args
, /*complain=*/1,
9846 /* Give this enumeration constant the correct access. */
9847 set_current_access_from_decl (TREE_VALUE (e
));
9849 /* Actually build the enumerator itself. */
9850 elt
= build_enumerator (TREE_PURPOSE (e
), value
, newtag
);
9852 /* We save the enumerators we have built so far in the
9853 TYPE_VALUES so that if the enumeration constants for
9854 subsequent enumerators involve those for previous ones,
9855 tsubst_copy will be able to find them. */
9856 TREE_CHAIN (elt
) = TYPE_VALUES (newtag
);
9857 TYPE_VALUES (newtag
) = elt
;
9860 finish_enum (newtag
);
9863 /* Set the DECL_ASSEMBLER_NAME for DECL, which is a FUNCTION_DECL that
9864 is either an instantiation or specialization of a template
9868 set_mangled_name_for_template_decl (decl
)
9871 tree saved_namespace
;
9872 tree context
= NULL_TREE
;
9881 my_friendly_assert (TREE_CODE (decl
) == FUNCTION_DECL
, 0);
9882 my_friendly_assert (DECL_TEMPLATE_INFO (decl
) != NULL_TREE
, 0);
9884 /* The names of template functions must be mangled so as to indicate
9885 what template is being specialized with what template arguments.
9886 For example, each of the following three functions must get
9887 different mangled names:
9890 template <> void f<7>(int);
9891 template <> void f<8>(int); */
9893 targs
= DECL_TI_ARGS (decl
);
9894 if (uses_template_parms (targs
))
9895 /* This DECL is for a partial instantiation. There's no need to
9896 mangle the name of such an entity. */
9899 tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
9900 tparms
= DECL_TEMPLATE_PARMS (tmpl
);
9901 parm_depth
= TMPL_PARMS_DEPTH (tparms
);
9903 /* There should be as many levels of arguments as there are levels
9905 my_friendly_assert (parm_depth
== TMPL_ARGS_DEPTH (targs
), 0);
9907 /* We now compute the PARMS and RET_TYPE to give to
9908 build_decl_overload_real. The PARMS and RET_TYPE are the
9909 parameter and return types of the template, after all but the
9910 innermost template arguments have been substituted, not the
9911 parameter and return types of the function DECL. For example,
9914 template <class T> T f(T);
9916 both PARMS and RET_TYPE should be `T' even if DECL is `int f(int)'.
9917 A more subtle example is:
9919 template <class T> struct S { template <class U> void f(T, U); }
9921 Here, if DECL is `void S<int>::f(int, double)', PARMS should be
9922 {int, U}. Thus, the args that we want to subsitute into the
9923 return and parameter type for the function are those in TARGS,
9924 with the innermost level omitted. */
9925 fn_type
= TREE_TYPE (tmpl
);
9926 if (DECL_STATIC_FUNCTION_P (decl
))
9927 context
= DECL_CLASS_CONTEXT (decl
);
9929 if (parm_depth
== 1)
9930 /* No substitution is necessary. */
9937 /* Replace the innermost level of the TARGS with NULL_TREEs to
9938 let tsubst know not to subsitute for those parameters. */
9939 partial_args
= make_tree_vec (TREE_VEC_LENGTH (targs
));
9940 for (i
= 1; i
< TMPL_ARGS_DEPTH (targs
); ++i
)
9941 SET_TMPL_ARGS_LEVEL (partial_args
, i
,
9942 TMPL_ARGS_LEVEL (targs
, i
));
9943 SET_TMPL_ARGS_LEVEL (partial_args
,
9944 TMPL_ARGS_DEPTH (targs
),
9945 make_tree_vec (DECL_NTPARMS (tmpl
)));
9947 /* Now, do the (partial) substitution to figure out the
9948 appropriate function type. */
9949 fn_type
= tsubst (fn_type
, partial_args
, /*complain=*/1, NULL_TREE
);
9950 if (DECL_STATIC_FUNCTION_P (decl
))
9951 context
= tsubst (context
, partial_args
, /*complain=*/1, NULL_TREE
);
9953 /* Substitute into the template parameters to obtain the real
9954 innermost set of parameters. This step is important if the
9955 innermost set of template parameters contains value
9956 parameters whose types depend on outer template parameters. */
9957 TREE_VEC_LENGTH (partial_args
)--;
9958 tparms
= tsubst_template_parms (tparms
, partial_args
, /*complain=*/1);
9961 /* Now, get the innermost parameters and arguments, and figure out
9962 the parameter and return types. */
9963 tparms
= INNERMOST_TEMPLATE_PARMS (tparms
);
9964 targs
= innermost_args (targs
);
9965 ret_type
= TREE_TYPE (fn_type
);
9966 parm_types
= TYPE_ARG_TYPES (fn_type
);
9968 /* For a static member function, we generate a fake `this' pointer,
9969 for the purposes of mangling. This indicates of which class the
9970 function is a member. Because of:
9974 There shall not be a static and a nonstatic member function
9975 with the same name and the same parameter types
9977 we don't have to worry that this will result in a clash with a
9978 non-static member function. */
9979 if (DECL_STATIC_FUNCTION_P (decl
))
9980 parm_types
= hash_tree_chain (build_pointer_type (context
), parm_types
);
9982 /* There should be the same number of template parameters as
9983 template arguments. */
9984 my_friendly_assert (TREE_VEC_LENGTH (tparms
) == TREE_VEC_LENGTH (targs
),
9987 /* If the template is in a namespace, we need to put that into the
9988 mangled name. Unfortunately, build_decl_overload_real does not
9989 get the decl to mangle, so it relies on the current
9990 namespace. Therefore, we set that here temporarily. */
9991 my_friendly_assert (TREE_CODE_CLASS (TREE_CODE (decl
)) == 'd', 980702);
9992 saved_namespace
= current_namespace
;
9993 current_namespace
= CP_DECL_CONTEXT (decl
);
9995 /* Actually set the DCL_ASSEMBLER_NAME. */
9996 DECL_ASSEMBLER_NAME (decl
)
9997 = build_decl_overload_real (DECL_NAME (decl
), parm_types
, ret_type
,
9999 DECL_FUNCTION_MEMBER_P (decl
)
10000 + DECL_CONSTRUCTOR_P (decl
));
10002 /* Restore the previously active namespace. */
10003 current_namespace
= saved_namespace
;