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_temp_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_temp_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));
3162 if (is_type
!= requires_type
)
3168 cp_error ("type/value mismatch at argument %d in template parameter list for `%D'",
3171 cp_error (" expected a constant of type `%T', got `%T'",
3173 (is_tmpl_type
? DECL_NAME (arg
) : arg
));
3175 cp_error (" expected a type, got `%E'", arg
);
3178 return error_mark_node
;
3180 if (is_tmpl_type
^ requires_tmpl_type
)
3182 if (in_decl
&& complain
)
3184 cp_error ("type/value mismatch at argument %d in template parameter list for `%D'",
3187 cp_error (" expected a type, got `%T'", DECL_NAME (arg
));
3189 cp_error (" expected a class template, got `%T'", arg
);
3191 return error_mark_node
;
3196 if (requires_tmpl_type
)
3198 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
3199 tree argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
3201 if (coerce_template_template_parms (parmparm
, argparm
, complain
,
3202 in_decl
, inner_args
))
3206 /* TEMPLATE_TEMPLATE_PARM node is preferred over
3208 if (val
!= error_mark_node
3209 && DECL_TEMPLATE_TEMPLATE_PARM_P (val
))
3210 val
= TREE_TYPE (val
);
3214 if (in_decl
&& complain
)
3216 cp_error ("type/value mismatch at argument %d in template parameter list for `%D'",
3218 cp_error (" expected a template of type `%D', got `%D'", parm
, arg
);
3221 val
= error_mark_node
;
3226 val
= groktypename (arg
);
3227 if (! processing_template_decl
)
3229 /* [basic.link]: A name with no linkage (notably, the
3230 name of a class or enumeration declared in a local
3231 scope) shall not be used to declare an entity with
3232 linkage. This implies that names with no linkage
3233 cannot be used as template arguments. */
3234 tree t
= no_linkage_check (val
);
3237 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
3239 ("template-argument `%T' uses anonymous type", val
);
3242 ("template-argument `%T' uses local type `%T'",
3244 return error_mark_node
;
3251 tree t
= tsubst (TREE_TYPE (parm
), args
, complain
, in_decl
);
3253 if (processing_template_decl
)
3254 arg
= maybe_fold_nontype_arg (arg
);
3256 if (!uses_template_parms (arg
) && !uses_template_parms (t
))
3257 /* We used to call digest_init here. However, digest_init
3258 will report errors, which we don't want when complain
3259 is zero. More importantly, digest_init will try too
3260 hard to convert things: for example, `0' should not be
3261 converted to pointer type at this point according to
3262 the standard. Accepting this is not merely an
3263 extension, since deciding whether or not these
3264 conversions can occur is part of determining which
3265 function template to call, or whether a given epxlicit
3266 argument specification is legal. */
3267 val
= convert_nontype_argument (t
, arg
);
3271 if (val
== NULL_TREE
)
3272 val
= error_mark_node
;
3273 else if (val
== error_mark_node
&& complain
)
3274 cp_error ("could not convert template argument `%E' to `%T'",
3281 /* Convert all template arguments to their appropriate types, and
3282 return a vector containing the innermost resulting template
3283 arguments. If any error occurs, return error_mark_node, and, if
3284 COMPLAIN is non-zero, issue an error message. Some error messages
3285 are issued even if COMPLAIN is zero; for instance, if a template
3286 argument is composed from a local class.
3288 If REQUIRE_ALL_ARGUMENTS is non-zero, all arguments must be
3289 provided in ARGLIST, or else trailing parameters must have default
3290 values. If REQUIRE_ALL_ARGUMENTS is zero, we will attempt argument
3291 deduction for any unspecified trailing arguments.
3293 The resulting TREE_VEC is allocated on a temporary obstack, and
3294 must be explicitly copied if it will be permanent. */
3297 coerce_template_parms (parms
, args
, in_decl
,
3299 require_all_arguments
)
3303 int require_all_arguments
;
3305 int nparms
, nargs
, i
, lost
= 0;
3308 tree new_inner_args
;
3310 inner_args
= innermost_args (args
);
3311 nargs
= NUM_TMPL_ARGS (inner_args
);
3312 nparms
= TREE_VEC_LENGTH (parms
);
3316 && require_all_arguments
3317 && TREE_PURPOSE (TREE_VEC_ELT (parms
, nargs
)) == NULL_TREE
))
3321 cp_error ("wrong number of template arguments (%d, should be %d)",
3325 cp_error_at ("provided for `%D'", in_decl
);
3328 return error_mark_node
;
3331 new_inner_args
= make_temp_vec (nparms
);
3332 new_args
= add_outermost_template_args (args
, new_inner_args
);
3333 for (i
= 0; i
< nparms
; i
++)
3338 /* Get the Ith template parameter. */
3339 parm
= TREE_VEC_ELT (parms
, i
);
3341 /* Calculate the Ith argument. */
3342 if (inner_args
&& TREE_CODE (inner_args
) == TREE_LIST
)
3344 arg
= TREE_VALUE (inner_args
);
3345 inner_args
= TREE_CHAIN (inner_args
);
3348 arg
= TREE_VEC_ELT (inner_args
, i
);
3349 /* If no template argument was supplied, look for a default
3351 else if (TREE_PURPOSE (parm
) == NULL_TREE
)
3353 /* There was no default value. */
3354 my_friendly_assert (!require_all_arguments
, 0);
3357 else if (TREE_CODE (TREE_VALUE (parm
)) == TYPE_DECL
)
3358 arg
= tsubst (TREE_PURPOSE (parm
), new_args
, complain
, in_decl
);
3360 arg
= tsubst_expr (TREE_PURPOSE (parm
), new_args
, complain
,
3363 /* Now, convert the Ith argument, as necessary. */
3364 if (arg
== NULL_TREE
)
3365 /* We're out of arguments. */
3367 my_friendly_assert (!require_all_arguments
, 0);
3370 else if (arg
== error_mark_node
)
3372 cp_error ("template argument %d is invalid", i
+ 1);
3373 arg
= error_mark_node
;
3376 arg
= convert_template_argument (TREE_VALUE (parm
),
3377 arg
, new_args
, complain
, i
,
3380 if (arg
== error_mark_node
)
3382 TREE_VEC_ELT (new_inner_args
, i
) = arg
;
3386 return error_mark_node
;
3388 return new_inner_args
;
3391 /* Returns 1 if template args OT and NT are equivalent. */
3394 template_args_equal (ot
, nt
)
3399 if (TREE_CODE (nt
) != TREE_CODE (ot
))
3401 if (TREE_CODE (nt
) == TREE_VEC
)
3402 /* For member templates */
3403 return comp_template_args (ot
, nt
);
3404 else if (TREE_CODE_CLASS (TREE_CODE (ot
)) == 't')
3405 return same_type_p (ot
, nt
);
3407 return (cp_tree_equal (ot
, nt
) > 0);
3410 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets
3411 of template arguments. Returns 0 otherwise. */
3414 comp_template_args (oldargs
, newargs
)
3415 tree oldargs
, newargs
;
3419 if (TREE_VEC_LENGTH (oldargs
) != TREE_VEC_LENGTH (newargs
))
3422 for (i
= 0; i
< TREE_VEC_LENGTH (oldargs
); ++i
)
3424 tree nt
= TREE_VEC_ELT (newargs
, i
);
3425 tree ot
= TREE_VEC_ELT (oldargs
, i
);
3427 if (! template_args_equal (ot
, nt
))
3433 /* Given class template name and parameter list, produce a user-friendly name
3434 for the instantiation. */
3437 mangle_class_name_for_template (name
, parms
, arglist
)
3439 tree parms
, arglist
;
3441 static struct obstack scratch_obstack
;
3442 static char *scratch_firstobj
;
3445 if (!scratch_firstobj
)
3446 gcc_obstack_init (&scratch_obstack
);
3448 obstack_free (&scratch_obstack
, scratch_firstobj
);
3449 scratch_firstobj
= obstack_alloc (&scratch_obstack
, 1);
3451 #define ccat(c) obstack_1grow (&scratch_obstack, (c));
3452 #define cat(s) obstack_grow (&scratch_obstack, (s), strlen (s))
3456 nparms
= TREE_VEC_LENGTH (parms
);
3457 arglist
= innermost_args (arglist
);
3458 my_friendly_assert (nparms
== TREE_VEC_LENGTH (arglist
), 268);
3459 for (i
= 0; i
< nparms
; i
++)
3461 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
3462 tree arg
= TREE_VEC_ELT (arglist
, i
);
3467 if (TREE_CODE (parm
) == TYPE_DECL
)
3469 cat (type_as_string (arg
, TS_CHASE_TYPEDEFS
));
3472 else if (TREE_CODE (parm
) == TEMPLATE_DECL
)
3474 if (TREE_CODE (arg
) == TEMPLATE_DECL
)
3476 /* Already substituted with real template. Just output
3477 the template name here */
3478 tree context
= DECL_CONTEXT (arg
);
3481 /* The template may be defined in a namespace, or
3482 may be a member template. */
3483 my_friendly_assert (TREE_CODE (context
) == NAMESPACE_DECL
3484 || CLASS_TYPE_P (context
),
3486 cat(decl_as_string (DECL_CONTEXT (arg
), 0));
3489 cat (IDENTIFIER_POINTER (DECL_NAME (arg
)));
3492 /* Output the parameter declaration */
3493 cat (type_as_string (arg
, TS_CHASE_TYPEDEFS
));
3497 my_friendly_assert (TREE_CODE (parm
) == PARM_DECL
, 269);
3499 if (TREE_CODE (arg
) == TREE_LIST
)
3501 /* New list cell was built because old chain link was in
3503 my_friendly_assert (TREE_PURPOSE (arg
) == NULL_TREE
, 270);
3504 arg
= TREE_VALUE (arg
);
3506 /* No need to check arglist against parmlist here; we did that
3507 in coerce_template_parms, called from lookup_template_class. */
3508 cat (expr_as_string (arg
, 0));
3511 char *bufp
= obstack_next_free (&scratch_obstack
);
3513 while (bufp
[offset
- 1] == ' ')
3515 obstack_blank_fast (&scratch_obstack
, offset
);
3517 /* B<C<char> >, not B<C<char>> */
3518 if (bufp
[offset
- 1] == '>')
3523 return (char *) obstack_base (&scratch_obstack
);
3527 classtype_mangled_name (t
)
3530 if (CLASSTYPE_TEMPLATE_INFO (t
)
3531 /* Specializations have already had their names set up in
3532 lookup_template_class. */
3533 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
3535 tree tmpl
= most_general_template (CLASSTYPE_TI_TEMPLATE (t
));
3537 /* For non-primary templates, the template parameters are
3538 implicit from their surrounding context. */
3539 if (PRIMARY_TEMPLATE_P (tmpl
))
3541 tree name
= DECL_NAME (tmpl
);
3542 char *mangled_name
= mangle_class_name_for_template
3543 (IDENTIFIER_POINTER (name
),
3544 DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
3545 CLASSTYPE_TI_ARGS (t
));
3546 tree id
= get_identifier (mangled_name
);
3547 IDENTIFIER_TEMPLATE (id
) = name
;
3552 return TYPE_IDENTIFIER (t
);
3556 add_pending_template (d
)
3561 if (TREE_CODE_CLASS (TREE_CODE (d
)) == 't')
3562 ti
= CLASSTYPE_TEMPLATE_INFO (d
);
3564 ti
= DECL_TEMPLATE_INFO (d
);
3566 if (TI_PENDING_TEMPLATE_FLAG (ti
))
3569 *template_tail
= tree_cons (build_srcloc_here (), d
, NULL_TREE
);
3570 template_tail
= &TREE_CHAIN (*template_tail
);
3571 TI_PENDING_TEMPLATE_FLAG (ti
) = 1;
3575 /* Return a TEMPLATE_ID_EXPR corresponding to the indicated FNS (which
3576 may be either a _DECL or an overloaded function or an
3577 IDENTIFIER_NODE), and ARGLIST. */
3580 lookup_template_function (fns
, arglist
)
3585 if (fns
== NULL_TREE
)
3587 cp_error ("non-template used as template");
3588 return error_mark_node
;
3591 type
= TREE_TYPE (fns
);
3592 if (TREE_CODE (fns
) == OVERLOAD
|| !type
)
3593 type
= unknown_type_node
;
3595 if (processing_template_decl
)
3596 return build_min (TEMPLATE_ID_EXPR
, type
, fns
, arglist
);
3598 return build (TEMPLATE_ID_EXPR
, type
, fns
, arglist
);
3601 /* Within the scope of a template class S<T>, the name S gets bound
3602 (in build_self_reference) to a TYPE_DECL for the class, not a
3603 TEMPLATE_DECL. If DECL is a TYPE_DECL for current_class_type,
3604 or one of its enclosing classes, and that type is a template,
3605 return the associated TEMPLATE_DECL. Otherwise, the original
3606 DECL is returned. */
3609 maybe_get_template_decl_from_type_decl (decl
)
3612 return (decl
!= NULL_TREE
3613 && TREE_CODE (decl
) == TYPE_DECL
3614 && DECL_ARTIFICIAL (decl
)
3615 && CLASS_TYPE_P (TREE_TYPE (decl
))
3616 && CLASSTYPE_TEMPLATE_INFO (TREE_TYPE (decl
)))
3617 ? CLASSTYPE_TI_TEMPLATE (TREE_TYPE (decl
)) : decl
;
3620 /* Given an IDENTIFIER_NODE (type TEMPLATE_DECL) and a chain of
3621 parameters, find the desired type.
3623 D1 is the PTYPENAME terminal, and ARGLIST is the list of arguments.
3624 (Actually ARGLIST may be either a TREE_LIST or a TREE_VEC. It will
3625 be a TREE_LIST if called directly from the parser, and a TREE_VEC
3626 otherwise.) Since ARGLIST is build on the temp_decl_obstack, we must
3627 copy it here to keep it from being reclaimed when the decl storage
3630 IN_DECL, if non-NULL, is the template declaration we are trying to
3633 If ENTERING_SCOPE is non-zero, we are about to enter the scope of
3634 the class we are looking up.
3636 If the template class is really a local class in a template
3637 function, then the FUNCTION_CONTEXT is the function in which it is
3638 being instantiated. */
3641 lookup_template_class (d1
, arglist
, in_decl
, context
, entering_scope
)
3647 tree
template = NULL_TREE
, parmlist
;
3650 if (TREE_CODE (d1
) == IDENTIFIER_NODE
)
3652 if (IDENTIFIER_VALUE (d1
)
3653 && DECL_TEMPLATE_TEMPLATE_PARM_P (IDENTIFIER_VALUE (d1
)))
3654 template = IDENTIFIER_VALUE (d1
);
3658 push_decl_namespace (context
);
3659 template = lookup_name (d1
, /*prefer_type=*/0);
3660 template = maybe_get_template_decl_from_type_decl (template);
3662 pop_decl_namespace ();
3665 context
= DECL_CONTEXT (template);
3667 else if (TREE_CODE (d1
) == TYPE_DECL
&& IS_AGGR_TYPE (TREE_TYPE (d1
)))
3669 tree type
= TREE_TYPE (d1
);
3671 /* If we are declaring a constructor, say A<T>::A<T>, we will get
3672 an implicit typename for the second A. Deal with it. */
3673 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
3674 type
= TREE_TYPE (type
);
3676 if (CLASSTYPE_TEMPLATE_INFO (type
))
3678 template = CLASSTYPE_TI_TEMPLATE (type
);
3679 d1
= DECL_NAME (template);
3682 else if (TREE_CODE (d1
) == ENUMERAL_TYPE
3683 || (TREE_CODE_CLASS (TREE_CODE (d1
)) == 't'
3684 && IS_AGGR_TYPE (d1
)))
3686 template = TYPE_TI_TEMPLATE (d1
);
3687 d1
= DECL_NAME (template);
3689 else if (TREE_CODE (d1
) == TEMPLATE_DECL
3690 && TREE_CODE (DECL_RESULT (d1
)) == TYPE_DECL
)
3693 d1
= DECL_NAME (template);
3694 context
= DECL_CONTEXT (template);
3697 my_friendly_abort (272);
3699 /* With something like `template <class T> class X class X { ... };'
3700 we could end up with D1 having nothing but an IDENTIFIER_VALUE.
3701 We don't want to do that, but we have to deal with the situation,
3702 so let's give them some syntax errors to chew on instead of a
3706 cp_error ("`%T' is not a template", d1
);
3707 return error_mark_node
;
3710 if (context
== NULL_TREE
)
3711 context
= global_namespace
;
3713 if (TREE_CODE (template) != TEMPLATE_DECL
)
3715 cp_error ("non-template type `%T' used as a template", d1
);
3717 cp_error_at ("for template declaration `%D'", in_decl
);
3718 return error_mark_node
;
3721 if (DECL_TEMPLATE_TEMPLATE_PARM_P (template))
3723 /* Create a new TEMPLATE_DECL and TEMPLATE_TEMPLATE_PARM node to store
3724 template arguments */
3726 tree parm
= copy_template_template_parm (TREE_TYPE (template));
3727 tree template2
= TYPE_STUB_DECL (parm
);
3730 parmlist
= DECL_INNERMOST_TEMPLATE_PARMS (template);
3732 arglist2
= coerce_template_parms (parmlist
, arglist
, template, 1, 1);
3733 if (arglist2
== error_mark_node
)
3734 return error_mark_node
;
3736 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (parm
)
3737 = tree_cons (template2
, arglist2
, NULL_TREE
);
3738 TYPE_SIZE (parm
) = 0;
3743 tree template_type
= TREE_TYPE (template);
3746 tree found
= NULL_TREE
;
3749 int is_partial_instantiation
;
3751 gen_tmpl
= most_general_template (template);
3752 parmlist
= DECL_TEMPLATE_PARMS (gen_tmpl
);
3753 parm_depth
= TMPL_PARMS_DEPTH (parmlist
);
3754 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
3756 /* We build up the coerced arguments and such on the
3757 momentary_obstack. */
3760 if (arg_depth
== 1 && parm_depth
> 1)
3762 /* We've been given an incomplete set of template arguments.
3765 template <class T> struct S1 {
3766 template <class U> struct S2 {};
3767 template <class U> struct S2<U*> {};
3770 we will be called with an ARGLIST of `U*', but the
3771 TEMPLATE will be `template <class T> template
3772 <class U> struct S1<T>::S2'. We must fill in the missing
3775 = add_outermost_template_args (TYPE_TI_ARGS (TREE_TYPE (template)),
3777 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
3780 /* Now we should enough arguments. */
3781 my_friendly_assert (parm_depth
== arg_depth
, 0);
3783 /* From here on, we're only interested in the most general
3785 template = gen_tmpl
;
3787 /* Calculate the BOUND_ARGS. These will be the args that are
3788 actually tsubst'd into the definition to create the
3792 /* We have multiple levels of arguments to coerce, at once. */
3794 int saved_depth
= TMPL_ARGS_DEPTH (arglist
);
3796 tree bound_args
= make_temp_vec (parm_depth
);
3798 for (i
= saved_depth
,
3799 t
= DECL_TEMPLATE_PARMS (template);
3800 i
> 0 && t
!= NULL_TREE
;
3801 --i
, t
= TREE_CHAIN (t
))
3803 tree a
= coerce_template_parms (TREE_VALUE (t
),
3804 arglist
, template, 1, 1);
3805 SET_TMPL_ARGS_LEVEL (bound_args
, i
, a
);
3807 /* We temporarily reduce the length of the ARGLIST so
3808 that coerce_template_parms will see only the arguments
3809 corresponding to the template parameters it is
3811 TREE_VEC_LENGTH (arglist
)--;
3814 /* Restore the ARGLIST to its full size. */
3815 TREE_VEC_LENGTH (arglist
) = saved_depth
;
3817 arglist
= bound_args
;
3821 = coerce_template_parms (INNERMOST_TEMPLATE_PARMS (parmlist
),
3822 innermost_args (arglist
),
3825 if (arglist
== error_mark_node
)
3826 /* We were unable to bind the arguments. */
3827 return error_mark_node
;
3829 /* In the scope of a template class, explicit references to the
3830 template class refer to the type of the template, not any
3831 instantiation of it. For example, in:
3833 template <class T> class C { void f(C<T>); }
3835 the `C<T>' is just the same as `C'. Outside of the
3836 class, however, such a reference is an instantiation. */
3837 if (comp_template_args (TYPE_TI_ARGS (template_type
),
3840 found
= template_type
;
3842 if (!entering_scope
&& PRIMARY_TEMPLATE_P (template))
3846 /* Note that we use DECL_CONTEXT, rather than
3847 CP_DECL_CONTEXT, so that the termination test is
3848 always just `ctx'. We're not interested in namepace
3850 for (ctx
= current_class_type
;
3852 ctx
= (TREE_CODE_CLASS (TREE_CODE (ctx
)) == 't')
3853 ? TYPE_CONTEXT (ctx
) : DECL_CONTEXT (ctx
))
3854 if (same_type_p (ctx
, template_type
))
3858 /* We're not in the scope of the class, so the
3859 TEMPLATE_TYPE is not the type we want after
3867 for (found
= DECL_TEMPLATE_INSTANTIATIONS (template);
3868 found
; found
= TREE_CHAIN (found
))
3869 if (comp_template_args (TREE_PURPOSE (found
), arglist
))
3873 found
= TREE_VALUE (found
);
3882 /* This type is a "partial instantiation" if any of the template
3883 arguments still inolve template parameters. Note that we set
3884 IS_PARTIAL_INSTANTIATION for partial specializations as
3886 is_partial_instantiation
= uses_template_parms (arglist
);
3888 if (!is_partial_instantiation
3889 && !PRIMARY_TEMPLATE_P (template)
3890 && TREE_CODE (CP_DECL_CONTEXT (template)) == NAMESPACE_DECL
)
3893 found
= xref_tag_from_type (TREE_TYPE (template),
3894 DECL_NAME (template),
3899 /* Since we didn't find the type, we'll have to create it.
3900 Since we'll be saving this type on the
3901 DECL_TEMPLATE_INSTANTIATIONS list, it must be permanent. */
3902 push_obstacks (&permanent_obstack
, &permanent_obstack
);
3904 /* Create the type. */
3905 if (TREE_CODE (template_type
) == ENUMERAL_TYPE
)
3907 if (!is_partial_instantiation
)
3908 t
= start_enum (TYPE_IDENTIFIER (template_type
));
3910 /* We don't want to call start_enum for this type, since
3911 the values for the enumeration constants may involve
3912 template parameters. And, no one should be interested
3913 in the enumeration constants for such a type. */
3914 t
= make_node (ENUMERAL_TYPE
);
3918 t
= make_lang_type (TREE_CODE (template_type
));
3919 CLASSTYPE_DECLARED_CLASS (t
)
3920 = CLASSTYPE_DECLARED_CLASS (template_type
);
3921 CLASSTYPE_GOT_SEMICOLON (t
) = 1;
3922 SET_CLASSTYPE_IMPLICIT_INSTANTIATION (t
);
3923 TYPE_FOR_JAVA (t
) = TYPE_FOR_JAVA (template_type
);
3926 /* If we called start_enum above, this information will already
3930 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
3932 type_decl
= create_implicit_typedef (DECL_NAME (template), t
);
3933 DECL_CONTEXT (type_decl
) = TYPE_CONTEXT (t
);
3934 TYPE_STUB_DECL (t
) = type_decl
;
3935 DECL_SOURCE_FILE (type_decl
)
3936 = DECL_SOURCE_FILE (TYPE_STUB_DECL (template_type
));
3937 DECL_SOURCE_LINE (type_decl
)
3938 = DECL_SOURCE_LINE (TYPE_STUB_DECL (template_type
));
3941 type_decl
= TYPE_NAME (t
);
3943 /* Set up the template information. We have to figure out which
3944 template is the immediate parent if this is a full
3946 if (parm_depth
== 1 || is_partial_instantiation
3947 || !PRIMARY_TEMPLATE_P (template))
3948 /* This case is easy; there are no member templates involved. */
3952 /* This is a full instantiation of a member template. There
3953 should be some partial instantiation of which this is an
3956 for (found
= DECL_TEMPLATE_INSTANTIATIONS (template);
3957 found
; found
= TREE_CHAIN (found
))
3960 tree tmpl
= CLASSTYPE_TI_TEMPLATE (TREE_VALUE (found
));
3962 /* We only want partial instantiations, here, not
3963 specializations or full instantiations. */
3964 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_VALUE (found
))
3965 || !uses_template_parms (TREE_VALUE (found
)))
3968 /* Temporarily reduce by one the number of levels in the
3969 ARGLIST and in FOUND so as to avoid comparing the
3970 last set of arguments. */
3971 TREE_VEC_LENGTH (arglist
)--;
3972 TREE_VEC_LENGTH (TREE_PURPOSE (found
)) --;
3974 /* See if the arguments match. If they do, then TMPL is
3975 the partial instantiation we want. */
3976 success
= comp_template_args (TREE_PURPOSE (found
), arglist
);
3978 /* Restore the argument vectors to their full size. */
3979 TREE_VEC_LENGTH (arglist
)++;
3980 TREE_VEC_LENGTH (TREE_PURPOSE (found
))++;
3990 my_friendly_abort (0);
3993 SET_TYPE_TEMPLATE_INFO (t
,
3994 tree_cons (found
, arglist
, NULL_TREE
));
3995 DECL_TEMPLATE_INSTANTIATIONS (template)
3996 = tree_cons (arglist
, t
,
3997 DECL_TEMPLATE_INSTANTIATIONS (template));
3999 if (TREE_CODE (t
) == ENUMERAL_TYPE
4000 && !is_partial_instantiation
)
4001 /* Now that the type has been registered on the instantiations
4002 list, we set up the enumerators. Because the enumeration
4003 constants may involve the enumeration type itself, we make
4004 sure to register the type first, and then create the
4005 constants. That way, doing tsubst_expr for the enumeration
4006 constants won't result in recursive calls here; we'll find
4007 the instantiation and exit above. */
4008 tsubst_enum (template_type
, t
, arglist
);
4010 /* We're done with the permanent obstack, now. */
4012 /* We're also done with the momentary allocation we started
4016 /* Reset the name of the type, now that CLASSTYPE_TEMPLATE_INFO
4018 if (TREE_CODE (t
) != ENUMERAL_TYPE
)
4019 DECL_NAME (type_decl
) = classtype_mangled_name (t
);
4020 DECL_ASSEMBLER_NAME (type_decl
) = DECL_NAME (type_decl
);
4021 if (!is_partial_instantiation
)
4023 DECL_ASSEMBLER_NAME (type_decl
)
4024 = get_identifier (build_overload_name (t
, 1, 1));
4026 /* For backwards compatibility; code that uses
4027 -fexternal-templates expects looking up a template to
4028 instantiate it. I think DDD still relies on this.
4029 (jason 8/20/1998) */
4030 if (TREE_CODE (t
) != ENUMERAL_TYPE
4031 && flag_external_templates
4032 && CLASSTYPE_INTERFACE_KNOWN (TREE_TYPE (template))
4033 && ! CLASSTYPE_INTERFACE_ONLY (TREE_TYPE (template)))
4034 add_pending_template (t
);
4037 /* If the type makes use of template parameters, the
4038 code that generates debugging information will crash. */
4039 DECL_IGNORED_P (TYPE_STUB_DECL (t
)) = 1;
4045 /* For each TEMPLATE_TYPE_PARM, TEMPLATE_TEMPLATE_PARM, or
4046 TEMPLATE_PARM_INDEX in T, call FN with the parameter and the DATA.
4047 If FN returns non-zero, the iteration is terminated, and
4048 for_each_template_parm returns 1. Otherwise, the iteration
4049 continues. If FN never returns a non-zero value, the value
4050 returned by for_each_template_parm is 0. If FN is NULL, it is
4051 considered to be the function which always returns 1. */
4054 for_each_template_parm (t
, fn
, data
)
4062 if (TREE_CODE_CLASS (TREE_CODE (t
)) == 't'
4063 && for_each_template_parm (TYPE_CONTEXT (t
), fn
, data
))
4066 switch (TREE_CODE (t
))
4070 return (for_each_template_parm (TREE_OPERAND (t
, 0), fn
, data
)
4071 || for_each_template_parm (TREE_OPERAND (t
, 1), fn
, data
));
4073 case IDENTIFIER_NODE
:
4074 if (!IDENTIFIER_TEMPLATE (t
))
4076 my_friendly_abort (42);
4078 /* aggregates of tree nodes */
4081 int i
= TREE_VEC_LENGTH (t
);
4083 if (for_each_template_parm (TREE_VEC_ELT (t
, i
), fn
, data
))
4088 if (for_each_template_parm (TREE_PURPOSE (t
), fn
, data
)
4089 || for_each_template_parm (TREE_VALUE (t
), fn
, data
))
4091 return for_each_template_parm (TREE_CHAIN (t
), fn
, data
);
4094 if (for_each_template_parm (OVL_FUNCTION (t
), fn
, data
))
4096 return for_each_template_parm (OVL_CHAIN (t
), fn
, data
);
4098 /* constructed type nodes */
4100 case REFERENCE_TYPE
:
4101 return for_each_template_parm (TREE_TYPE (t
), fn
, data
);
4104 if (TYPE_PTRMEMFUNC_FLAG (t
))
4105 return for_each_template_parm (TYPE_PTRMEMFUNC_FN_TYPE (t
),
4111 if (! TYPE_TEMPLATE_INFO (t
))
4113 return for_each_template_parm (TREE_VALUE
4114 (TYPE_TEMPLATE_INFO (t
)),
4117 if (for_each_template_parm (TYPE_METHOD_BASETYPE (t
), fn
, data
))
4122 /* Check the parameter types. Since default arguments are not
4123 instantiated until they are needed, the TYPE_ARG_TYPES may
4124 contain expressions that involve template parameters. But,
4125 no-one should be looking at them yet. And, once they're
4126 instantiated, they don't contain template parameters, so
4127 there's no point in looking at them then, either. */
4131 for (parm
= TYPE_ARG_TYPES (t
); parm
; parm
= TREE_CHAIN (parm
))
4132 if (for_each_template_parm (TREE_VALUE (parm
), fn
, data
))
4136 /* Check the return type, too. */
4137 return for_each_template_parm (TREE_TYPE (t
), fn
, data
);
4140 if (for_each_template_parm (TYPE_DOMAIN (t
), fn
, data
))
4142 return for_each_template_parm (TREE_TYPE (t
), fn
, data
);
4144 if (for_each_template_parm (TYPE_OFFSET_BASETYPE (t
), fn
, data
))
4146 return for_each_template_parm (TREE_TYPE (t
), fn
, data
);
4150 return for_each_template_parm (TREE_TYPE (t
), fn
, data
);
4153 /* A template template parameter is encountered */
4154 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
4155 return for_each_template_parm (TREE_TYPE (t
), fn
, data
);
4156 /* Already substituted template template parameter */
4160 if (for_each_template_parm (DECL_INITIAL (t
), fn
, data
))
4162 goto check_type_and_context
;
4166 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
)
4167 && for_each_template_parm (DECL_TI_ARGS (t
), fn
, data
))
4171 check_type_and_context
:
4172 if (for_each_template_parm (TREE_TYPE (t
), fn
, data
))
4174 if (DECL_CONTEXT (t
)
4175 && for_each_template_parm (DECL_CONTEXT (t
), fn
, data
))
4180 return (for_each_template_parm (TREE_OPERAND (t
, 0), fn
, data
)
4181 || for_each_template_parm (TREE_OPERAND (t
, 1), fn
, data
));
4184 return for_each_template_parm (TREE_OPERAND (t
, 0), fn
, data
);
4186 /* template parm nodes */
4187 case TEMPLATE_TEMPLATE_PARM
:
4188 /* Record template parameters such as `T' inside `TT<T>'. */
4189 if (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t
)
4190 && for_each_template_parm (TYPE_TI_ARGS (t
), fn
, data
))
4192 case TEMPLATE_TYPE_PARM
:
4193 case TEMPLATE_PARM_INDEX
:
4195 return (*fn
)(t
, data
);
4199 /* simple type nodes */
4201 if (for_each_template_parm (TYPE_MIN_VALUE (t
), fn
, data
))
4203 return for_each_template_parm (TYPE_MAX_VALUE (t
), fn
, data
);
4209 case NAMESPACE_DECL
:
4220 /* Non-error_mark_node ERROR_MARKs are bad things. */
4221 my_friendly_assert (t
== error_mark_node
, 274);
4226 return for_each_template_parm (TREE_TYPE (t
), fn
, data
);
4229 return for_each_template_parm (TREE_OPERAND (t
, 0), fn
, data
);
4232 if (TREE_TYPE (t
) && TYPE_PTRMEMFUNC_P (TREE_TYPE (t
)))
4233 return for_each_template_parm (TYPE_PTRMEMFUNC_FN_TYPE
4234 (TREE_TYPE (t
)), fn
, data
);
4235 return for_each_template_parm (TREE_OPERAND (t
, 1), fn
, data
);
4239 return for_each_template_parm (TREE_OPERAND (t
, 0), fn
, data
);
4244 return (for_each_template_parm (TYPE_CONTEXT (t
), fn
, data
)
4245 || for_each_template_parm (TYPENAME_TYPE_FULLNAME (t
),
4250 /* If there's no type, then this thing must be some expression
4251 involving template parameters. */
4252 if (!fn
&& !TREE_TYPE (t
))
4254 if (TREE_CODE (t
) == COMPONENT_REF
)
4255 return (for_each_template_parm (TREE_OPERAND (t
, 0), fn
, data
)
4256 || for_each_template_parm (TREE_OPERAND (t
, 1), fn
, data
));
4258 return for_each_template_parm (TREE_OPERAND (t
, 0), fn
, data
);
4262 case REINTERPRET_CAST_EXPR
:
4263 case CONST_CAST_EXPR
:
4264 case STATIC_CAST_EXPR
:
4265 case DYNAMIC_CAST_EXPR
:
4270 case PSEUDO_DTOR_EXPR
:
4276 switch (TREE_CODE_CLASS (TREE_CODE (t
)))
4284 for (i
= first_rtl_op (TREE_CODE (t
)); --i
>= 0;)
4285 if (for_each_template_parm (TREE_OPERAND (t
, i
), fn
, data
))
4292 sorry ("testing %s for template parms",
4293 tree_code_name
[(int) TREE_CODE (t
)]);
4294 my_friendly_abort (82);
4301 uses_template_parms (t
)
4304 return for_each_template_parm (t
, 0, 0);
4307 static struct tinst_level
*current_tinst_level
;
4308 static struct tinst_level
*free_tinst_level
;
4309 static int tinst_depth
;
4310 extern int max_tinst_depth
;
4311 #ifdef GATHER_STATISTICS
4314 int tinst_level_tick
;
4315 int last_template_error_tick
;
4317 /* Print out all the template instantiations that we are currently
4318 working on. If ERR, we are being called from cp_thing, so do
4319 the right thing for an error message. */
4322 print_template_context (err
)
4325 struct tinst_level
*p
= current_tinst_level
;
4327 char *file
= input_filename
;
4331 if (current_function_decl
!= p
->decl
4332 && current_function_decl
!= NULL_TREE
)
4333 /* We can get here during the processing of some synthesized
4334 method. Then, p->decl will be the function that's causing
4339 if (current_function_decl
== p
->decl
)
4340 /* Avoid redundancy with the the "In function" line. */;
4342 fprintf (stderr
, "%s: In instantiation of `%s':\n",
4343 file
, decl_as_string (p
->decl
, TS_DECL_TYPE
| TS_FUNC_NORETURN
));
4351 for (; p
; p
= p
->next
)
4353 fprintf (stderr
, "%s:%d: instantiated from `%s'\n", file
, line
,
4354 decl_as_string (p
->decl
, TS_DECL_TYPE
| TS_FUNC_NORETURN
));
4358 fprintf (stderr
, "%s:%d: instantiated from here\n", file
, line
);
4361 /* Called from cp_thing to print the template context for an error. */
4364 maybe_print_template_context ()
4366 if (last_template_error_tick
== tinst_level_tick
4367 || current_tinst_level
== 0)
4370 last_template_error_tick
= tinst_level_tick
;
4371 print_template_context (1);
4375 push_tinst_level (d
)
4378 struct tinst_level
*new;
4380 if (tinst_depth
>= max_tinst_depth
)
4382 /* If the instantiation in question still has unbound template parms,
4383 we don't really care if we can't instantiate it, so just return.
4384 This happens with base instantiation for implicit `typename'. */
4385 if (uses_template_parms (d
))
4388 last_template_error_tick
= tinst_level_tick
;
4389 error ("template instantiation depth exceeds maximum of %d",
4391 error (" (use -ftemplate-depth-NN to increase the maximum)");
4392 cp_error (" instantiating `%D'", d
);
4394 print_template_context (0);
4399 if (free_tinst_level
)
4401 new = free_tinst_level
;
4402 free_tinst_level
= new->next
;
4405 new = (struct tinst_level
*) xmalloc (sizeof (struct tinst_level
));
4409 new->file
= input_filename
;
4410 new->next
= current_tinst_level
;
4411 current_tinst_level
= new;
4414 #ifdef GATHER_STATISTICS
4415 if (tinst_depth
> depth_reached
)
4416 depth_reached
= tinst_depth
;
4426 struct tinst_level
*old
= current_tinst_level
;
4428 /* Restore the filename and line number stashed away when we started
4429 this instantiation. */
4431 input_filename
= old
->file
;
4432 extract_interface_info ();
4434 current_tinst_level
= old
->next
;
4435 old
->next
= free_tinst_level
;
4436 free_tinst_level
= old
;
4441 struct tinst_level
*
4444 struct tinst_level
*p
= current_tinst_level
;
4447 for (; p
->next
; p
= p
->next
)
4452 /* DECL is a friend FUNCTION_DECL or TEMPLATE_DECL. ARGS is the
4453 vector of template arguments, as for tsubst.
4455 Returns an appropriate tsbust'd friend declaration. */
4458 tsubst_friend_function (decl
, args
)
4464 char *file
= input_filename
;
4466 lineno
= DECL_SOURCE_LINE (decl
);
4467 input_filename
= DECL_SOURCE_FILE (decl
);
4469 if (TREE_CODE (decl
) == FUNCTION_DECL
4470 && DECL_TEMPLATE_INSTANTIATION (decl
)
4471 && TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
4472 /* This was a friend declared with an explicit template
4473 argument list, e.g.:
4477 to indicate that f was a template instantiation, not a new
4478 function declaration. Now, we have to figure out what
4479 instantiation of what template. */
4486 = lookup_template_function (tsubst_expr (DECL_TI_TEMPLATE (decl
),
4487 args
, /*complain=*/1,
4489 tsubst (DECL_TI_ARGS (decl
),
4490 args
, /*complain=*/1,
4492 new_friend
= tsubst (decl
, args
, /*complain=*/1, NULL_TREE
);
4493 tmpl
= determine_specialization (template_id
, new_friend
,
4495 /*need_member_template=*/0);
4496 new_friend
= instantiate_template (tmpl
, new_args
);
4500 new_friend
= tsubst (decl
, args
, /*complain=*/1, NULL_TREE
);
4502 /* The NEW_FRIEND will look like an instantiation, to the
4503 compiler, but is not an instantiation from the point of view of
4504 the language. For example, we might have had:
4506 template <class T> struct S {
4507 template <class U> friend void f(T, U);
4510 Then, in S<int>, template <class U> void f(int, U) is not an
4511 instantiation of anything. */
4512 DECL_USE_TEMPLATE (new_friend
) = 0;
4513 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
4514 DECL_USE_TEMPLATE (DECL_TEMPLATE_RESULT (new_friend
)) = 0;
4516 /* The mangled name for the NEW_FRIEND is incorrect. The call to
4517 tsubst will have resulted in a call to
4518 set_mangled_name_for_template_decl. But, the function is not a
4519 template instantiation and should not be mangled like one.
4520 Therefore, we remangle the function name. We don't have to do
4521 this if the NEW_FRIEND is a template since
4522 set_mangled_name_for_template_decl doesn't do anything if the
4523 function declaration still uses template arguments. */
4524 if (TREE_CODE (new_friend
) != TEMPLATE_DECL
)
4526 set_mangled_name_for_decl (new_friend
);
4527 DECL_RTL (new_friend
) = 0;
4528 make_decl_rtl (new_friend
, NULL_PTR
, 1);
4531 if (DECL_NAMESPACE_SCOPE_P (new_friend
))
4534 tree new_friend_template_info
;
4535 tree new_friend_result_template_info
;
4537 int new_friend_is_defn
;
4539 /* We must save some information from NEW_FRIEND before calling
4540 duplicate decls since that function will free NEW_FRIEND if
4542 new_friend_template_info
= DECL_TEMPLATE_INFO (new_friend
);
4543 if (TREE_CODE (new_friend
) == TEMPLATE_DECL
)
4545 /* This declaration is a `primary' template. */
4546 DECL_PRIMARY_TEMPLATE (new_friend
) = new_friend
;
4549 = DECL_INITIAL (DECL_RESULT (new_friend
)) != NULL_TREE
;
4550 new_friend_result_template_info
4551 = DECL_TEMPLATE_INFO (DECL_RESULT (new_friend
));
4555 new_friend_is_defn
= DECL_INITIAL (new_friend
) != NULL_TREE
;
4556 new_friend_result_template_info
= NULL_TREE
;
4559 /* Inside pushdecl_namespace_level, we will push into the
4560 current namespace. However, the friend function should
4561 tyically go into the namespace of the template. */
4562 ns
= decl_namespace_context (new_friend
);
4563 push_nested_namespace (ns
);
4564 old_decl
= pushdecl_namespace_level (new_friend
);
4565 pop_nested_namespace (ns
);
4567 if (old_decl
!= new_friend
)
4569 /* This new friend declaration matched an existing
4570 declaration. For example, given:
4572 template <class T> void f(T);
4573 template <class U> class C {
4574 template <class T> friend void f(T) {}
4577 the friend declaration actually provides the definition
4578 of `f', once C has been instantiated for some type. So,
4579 old_decl will be the out-of-class template declaration,
4580 while new_friend is the in-class definition.
4582 But, if `f' was called before this point, the
4583 instantiation of `f' will have DECL_TI_ARGS corresponding
4584 to `T' but not to `U', references to which might appear
4585 in the definition of `f'. Previously, the most general
4586 template for an instantiation of `f' was the out-of-class
4587 version; now it is the in-class version. Therefore, we
4588 run through all specialization of `f', adding to their
4589 DECL_TI_ARGS appropriately. In particular, they need a
4590 new set of outer arguments, corresponding to the
4591 arguments for this class instantiation.
4593 The same situation can arise with something like this:
4596 template <class T> class C {
4600 when `C<int>' is instantiated. Now, `f(int)' is defined
4603 if (!new_friend_is_defn
)
4604 /* On the other hand, if the in-class declaration does
4605 *not* provide a definition, then we don't want to alter
4606 existing definitions. We can just leave everything
4611 /* Overwrite whatever template info was there before, if
4612 any, with the new template information pertaining to
4614 DECL_TEMPLATE_INFO (old_decl
) = new_friend_template_info
;
4616 if (TREE_CODE (old_decl
) != TEMPLATE_DECL
)
4617 /* duplicate_decls will take care of this case. */
4622 tree new_friend_args
;
4624 DECL_TEMPLATE_INFO (DECL_RESULT (old_decl
))
4625 = new_friend_result_template_info
;
4627 new_friend_args
= TI_ARGS (new_friend_template_info
);
4628 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (old_decl
);
4632 tree spec
= TREE_VALUE (t
);
4635 = add_outermost_template_args (new_friend_args
,
4636 DECL_TI_ARGS (spec
));
4639 /* Now, since specializations are always supposed to
4640 hang off of the most general template, we must move
4642 t
= most_general_template (old_decl
);
4645 DECL_TEMPLATE_SPECIALIZATIONS (t
)
4646 = chainon (DECL_TEMPLATE_SPECIALIZATIONS (t
),
4647 DECL_TEMPLATE_SPECIALIZATIONS (old_decl
));
4648 DECL_TEMPLATE_SPECIALIZATIONS (old_decl
) = NULL_TREE
;
4653 /* The information from NEW_FRIEND has been merged into OLD_DECL
4654 by duplicate_decls. */
4655 new_friend
= old_decl
;
4658 else if (TYPE_SIZE (DECL_CONTEXT (new_friend
)))
4660 /* Check to see that the declaration is really present, and,
4661 possibly obtain an improved declaration. */
4662 tree fn
= check_classfn (DECL_CONTEXT (new_friend
),
4671 input_filename
= file
;
4675 /* FRIEND_TMPL is a friend TEMPLATE_DECL. ARGS is the vector of
4676 template arguments, as for tsubst.
4678 Returns an appropriate tsbust'd friend type. */
4681 tsubst_friend_class (friend_tmpl
, args
)
4688 /* First, we look for a class template. */
4689 tmpl
= lookup_name (DECL_NAME (friend_tmpl
), /*prefer_type=*/0);
4691 /* But, if we don't find one, it might be because we're in a
4692 situation like this:
4700 Here, in the scope of (say) S<int>, `S' is bound to a TYPE_DECL
4701 for `S<int>', not the TEMPLATE_DECL. */
4702 if (!tmpl
|| !DECL_CLASS_TEMPLATE_P (tmpl
))
4704 tmpl
= lookup_name (DECL_NAME (friend_tmpl
), /*prefer_type=*/1);
4705 tmpl
= maybe_get_template_decl_from_type_decl (tmpl
);
4708 if (tmpl
&& DECL_CLASS_TEMPLATE_P (tmpl
))
4710 /* The friend template has already been declared. Just
4711 check to see that the declarations match, and install any new
4712 default parameters. We must tsubst the default parameters,
4713 of course. We only need the innermost template parameters
4714 because that is all that redeclare_class_template will look
4717 = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_tmpl
),
4718 args
, /*complain=*/1);
4719 redeclare_class_template (TREE_TYPE (tmpl
), parms
);
4720 friend_type
= TREE_TYPE (tmpl
);
4724 /* The friend template has not already been declared. In this
4725 case, the instantiation of the template class will cause the
4726 injection of this template into the global scope. */
4727 tmpl
= tsubst (friend_tmpl
, args
, /*complain=*/1, NULL_TREE
);
4729 /* The new TMPL is not an instantiation of anything, so we
4730 forget its origins. We don't reset CLASSTYPE_TI_TEMPLATE for
4731 the new type because that is supposed to be the corresponding
4732 template decl, i.e., TMPL. */
4733 DECL_USE_TEMPLATE (tmpl
) = 0;
4734 DECL_TEMPLATE_INFO (tmpl
) = NULL_TREE
;
4735 CLASSTYPE_USE_TEMPLATE (TREE_TYPE (tmpl
)) = 0;
4737 /* Inject this template into the global scope. */
4738 friend_type
= TREE_TYPE (pushdecl_top_level (tmpl
));
4745 instantiate_class_template (type
)
4748 tree
template, args
, pattern
, t
;
4751 if (type
== error_mark_node
)
4752 return error_mark_node
;
4754 if (TYPE_BEING_DEFINED (type
) || TYPE_SIZE (type
))
4757 /* We want to allocate temporary vectors of template arguments and
4758 template argument expressions on the momentary obstack, not on
4759 the expression obstack. Otherwise, all the space allocated in
4760 argument coercion and such is simply lost. */
4763 /* Figure out which template is being instantiated. */
4764 template = most_general_template (CLASSTYPE_TI_TEMPLATE (type
));
4765 my_friendly_assert (TREE_CODE (template) == TEMPLATE_DECL
, 279);
4767 /* Figure out which arguments are being used to do the
4769 args
= CLASSTYPE_TI_ARGS (type
);
4770 PARTIAL_INSTANTIATION_P (type
) = uses_template_parms (args
);
4772 if (pedantic
&& PARTIAL_INSTANTIATION_P (type
))
4773 /* If this is a partial instantiation, then we can't instantiate
4774 the type; there's no telling whether or not one of the
4775 template parameters might eventually be instantiated to some
4776 value that results in a specialization being used. For
4788 Now, the `S<U>' in `f<int>' is the specialization, not an
4789 instantiation of the original template. */
4792 /* Determine what specialization of the original template to
4794 if (PARTIAL_INSTANTIATION_P (type
))
4795 /* There's no telling which specialization is appropriate at this
4796 point. Since all peeking at the innards of this partial
4797 instantiation are extensions (like the "implicit typename"
4798 extension, which allows users to omit the keyword `typename' on
4799 names that are declared as types in template base classes), we
4800 are free to do what we please.
4802 Trying to figure out which partial instantiation to use can
4803 cause a crash. (Some of the template arguments don't even have
4804 types.) So, we just use the most general version. */
4808 t
= most_specialized_class (template, args
);
4810 if (t
== error_mark_node
)
4812 const char *str
= "candidates are:";
4813 cp_error ("ambiguous class template instantiation for `%#T'", type
);
4814 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (template); t
;
4817 if (get_class_bindings (TREE_VALUE (t
), TREE_PURPOSE (t
),
4820 cp_error_at ("%s %+#T", str
, TREE_TYPE (t
));
4824 TYPE_BEING_DEFINED (type
) = 1;
4825 type
= error_mark_node
;
4831 pattern
= TREE_TYPE (t
);
4833 pattern
= TREE_TYPE (template);
4835 /* If the template we're instantiating is incomplete, then clearly
4836 there's nothing we can do. */
4837 if (TYPE_SIZE (pattern
) == NULL_TREE
)
4840 /* If this is a partial instantiation, don't tsubst anything. We will
4841 only use this type for implicit typename, so the actual contents don't
4842 matter. All that matters is whether a particular name is a type. */
4843 if (PARTIAL_INSTANTIATION_P (type
))
4845 /* The fields set here must be kept in sync with those cleared
4846 in begin_class_definition. */
4847 TYPE_BINFO_BASETYPES (type
) = TYPE_BINFO_BASETYPES (pattern
);
4848 TYPE_FIELDS (type
) = TYPE_FIELDS (pattern
);
4849 TYPE_METHODS (type
) = TYPE_METHODS (pattern
);
4850 CLASSTYPE_TAGS (type
) = CLASSTYPE_TAGS (pattern
);
4851 /* Pretend that the type is complete, so that we will look
4852 inside it during name lookup and such. */
4853 TYPE_SIZE (type
) = integer_zero_node
;
4857 /* If we've recursively instantiated too many templates, stop. */
4858 if (! push_tinst_level (type
))
4861 /* Now we're really doing the instantiation. Mark the type as in
4862 the process of being defined. */
4863 TYPE_BEING_DEFINED (type
) = 1;
4865 maybe_push_to_top_level (uses_template_parms (type
));
4869 /* This TYPE is actually a instantiation of of a partial
4870 specialization. We replace the innermost set of ARGS with
4871 the arguments appropriate for substitution. For example,
4874 template <class T> struct S {};
4875 template <class T> struct S<T*> {};
4877 and supposing that we are instantiating S<int*>, ARGS will
4878 present be {int*} but we need {int}. */
4880 = get_class_bindings (TREE_VALUE (t
), TREE_PURPOSE (t
),
4883 /* If there were multiple levels in ARGS, replacing the
4884 innermost level would alter CLASSTYPE_TI_ARGS, which we don't
4885 want, so we make a copy first. */
4886 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
4888 args
= copy_node (args
);
4889 SET_TMPL_ARGS_LEVEL (args
, TMPL_ARGS_DEPTH (args
), inner_args
);
4895 if (flag_external_templates
)
4897 if (flag_alt_external_templates
)
4899 CLASSTYPE_INTERFACE_ONLY (type
) = interface_only
;
4900 SET_CLASSTYPE_INTERFACE_UNKNOWN_X (type
, interface_unknown
);
4901 CLASSTYPE_VTABLE_NEEDS_WRITING (type
)
4902 = (! CLASSTYPE_INTERFACE_ONLY (type
)
4903 && CLASSTYPE_INTERFACE_KNOWN (type
));
4907 CLASSTYPE_INTERFACE_ONLY (type
) = CLASSTYPE_INTERFACE_ONLY (pattern
);
4908 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
4909 (type
, CLASSTYPE_INTERFACE_UNKNOWN (pattern
));
4910 CLASSTYPE_VTABLE_NEEDS_WRITING (type
)
4911 = (! CLASSTYPE_INTERFACE_ONLY (type
)
4912 && CLASSTYPE_INTERFACE_KNOWN (type
));
4917 SET_CLASSTYPE_INTERFACE_UNKNOWN (type
);
4918 CLASSTYPE_VTABLE_NEEDS_WRITING (type
) = 1;
4921 TYPE_HAS_CONSTRUCTOR (type
) = TYPE_HAS_CONSTRUCTOR (pattern
);
4922 TYPE_HAS_DESTRUCTOR (type
) = TYPE_HAS_DESTRUCTOR (pattern
);
4923 TYPE_OVERLOADS_CALL_EXPR (type
) = TYPE_OVERLOADS_CALL_EXPR (pattern
);
4924 TYPE_OVERLOADS_ARRAY_REF (type
) = TYPE_OVERLOADS_ARRAY_REF (pattern
);
4925 TYPE_OVERLOADS_ARROW (type
) = TYPE_OVERLOADS_ARROW (pattern
);
4926 TYPE_GETS_NEW (type
) = TYPE_GETS_NEW (pattern
);
4927 TYPE_GETS_DELETE (type
) = TYPE_GETS_DELETE (pattern
);
4928 TYPE_VEC_DELETE_TAKES_SIZE (type
) = TYPE_VEC_DELETE_TAKES_SIZE (pattern
);
4929 TYPE_HAS_ASSIGN_REF (type
) = TYPE_HAS_ASSIGN_REF (pattern
);
4930 TYPE_HAS_CONST_ASSIGN_REF (type
) = TYPE_HAS_CONST_ASSIGN_REF (pattern
);
4931 TYPE_HAS_ABSTRACT_ASSIGN_REF (type
) = TYPE_HAS_ABSTRACT_ASSIGN_REF (pattern
);
4932 TYPE_HAS_INIT_REF (type
) = TYPE_HAS_INIT_REF (pattern
);
4933 TYPE_HAS_CONST_INIT_REF (type
) = TYPE_HAS_CONST_INIT_REF (pattern
);
4934 TYPE_HAS_DEFAULT_CONSTRUCTOR (type
) = TYPE_HAS_DEFAULT_CONSTRUCTOR (pattern
);
4935 TYPE_HAS_CONVERSION (type
) = TYPE_HAS_CONVERSION (pattern
);
4936 TYPE_USES_COMPLEX_INHERITANCE (type
)
4937 = TYPE_USES_COMPLEX_INHERITANCE (pattern
);
4938 TYPE_USES_MULTIPLE_INHERITANCE (type
)
4939 = TYPE_USES_MULTIPLE_INHERITANCE (pattern
);
4940 TYPE_USES_VIRTUAL_BASECLASSES (type
)
4941 = TYPE_USES_VIRTUAL_BASECLASSES (pattern
);
4942 TYPE_PACKED (type
) = TYPE_PACKED (pattern
);
4943 TYPE_ALIGN (type
) = TYPE_ALIGN (pattern
);
4944 TYPE_FOR_JAVA (type
) = TYPE_FOR_JAVA (pattern
); /* For libjava's JArray<T> */
4945 if (ANON_AGGR_TYPE_P (pattern
))
4946 SET_ANON_AGGR_TYPE_P (type
);
4948 if (TYPE_BINFO_BASETYPES (pattern
))
4950 tree base_list
= NULL_TREE
;
4951 tree pbases
= TYPE_BINFO_BASETYPES (pattern
);
4954 /* Substitute into each of the bases to determine the actual
4956 for (i
= 0; i
< TREE_VEC_LENGTH (pbases
); ++i
)
4962 pbase
= TREE_VEC_ELT (pbases
, i
);
4964 /* Substitue to figure out the base class. */
4965 base
= tsubst (BINFO_TYPE (pbase
), args
,
4966 /*complain=*/1, NULL_TREE
);
4967 if (base
== error_mark_node
)
4970 /* Calculate the correct access node. */
4971 if (TREE_VIA_VIRTUAL (pbase
))
4973 if (TREE_VIA_PUBLIC (pbase
))
4974 access
= access_public_virtual_node
;
4975 else if (TREE_VIA_PROTECTED (pbase
))
4976 access
= access_protected_virtual_node
;
4978 access
= access_private_virtual_node
;
4982 if (TREE_VIA_PUBLIC (pbase
))
4983 access
= access_public_node
;
4984 else if (TREE_VIA_PROTECTED (pbase
))
4985 access
= access_protected_node
;
4987 access
= access_private_node
;
4990 base_list
= tree_cons (access
, base
, base_list
);
4993 /* The list is now in reverse order; correct that. */
4994 base_list
= nreverse (base_list
);
4996 /* Now call xref_basetypes to set up all the base-class
4998 xref_basetypes (TREE_CODE (pattern
) == RECORD_TYPE
4999 ? (CLASSTYPE_DECLARED_CLASS (pattern
)
5000 ? class_type_node
: record_type_node
)
5002 DECL_NAME (TYPE_NAME (pattern
)),
5007 /* Now that our base classes are set up, enter the scope of the
5008 class, so that name lookups into base classes, etc. will work
5009 corectly. This is precisely analagous to what we do in
5010 begin_class_definition when defining an ordinary non-template
5012 pushclass (type
, 1);
5014 for (t
= CLASSTYPE_TAGS (pattern
); t
; t
= TREE_CHAIN (t
))
5016 tree tag
= TREE_VALUE (t
);
5017 tree name
= TYPE_IDENTIFIER (tag
);
5020 newtag
= tsubst (tag
, args
, /*complain=*/1, NULL_TREE
);
5021 if (TREE_CODE (newtag
) != ENUMERAL_TYPE
)
5023 if (TYPE_LANG_SPECIFIC (tag
) && CLASSTYPE_IS_TEMPLATE (tag
))
5024 /* Unfortunately, lookup_template_class sets
5025 CLASSTYPE_IMPLICIT_INSTANTIATION for a partial
5026 instantiation (i.e., for the type of a member template
5027 class nested within a template class.) This behavior is
5028 required for maybe_process_partial_specialization to work
5029 correctly, but is not accurate in this case; the TAG is not
5030 an instantiation of anything. (The corresponding
5031 TEMPLATE_DECL is an instantiation, but the TYPE is not.) */
5032 CLASSTYPE_USE_TEMPLATE (newtag
) = 0;
5034 /* Now, we call pushtag to put this NEWTAG into the scope of
5035 TYPE. We first set up the IDENTIFIER_TYPE_VALUE to avoid
5036 pushtag calling push_template_decl. We don't have to do
5037 this for enums because it will already have been done in
5040 SET_IDENTIFIER_TYPE_VALUE (name
, newtag
);
5041 pushtag (name
, newtag
, /*globalize=*/0);
5045 /* Don't replace enum constants here. */
5046 for (t
= TYPE_FIELDS (pattern
); t
; t
= TREE_CHAIN (t
))
5047 if (TREE_CODE (t
) != CONST_DECL
)
5051 /* The the file and line for this declaration, to assist in
5052 error message reporting. Since we called push_tinst_level
5053 above, we don't need to restore these. */
5054 lineno
= DECL_SOURCE_LINE (t
);
5055 input_filename
= DECL_SOURCE_FILE (t
);
5057 r
= tsubst (t
, args
, /*complain=*/1, NULL_TREE
);
5058 if (TREE_CODE (r
) == VAR_DECL
)
5062 if (DECL_DEFINED_IN_CLASS_P (r
))
5063 init
= tsubst_expr (DECL_INITIAL (t
), args
,
5064 /*complain=*/1, NULL_TREE
);
5068 finish_static_data_member_decl (r
, init
,
5069 /*asmspec_tree=*/NULL_TREE
,
5073 if (DECL_DEFINED_IN_CLASS_P (r
))
5074 check_static_variable_definition (r
, TREE_TYPE (r
));
5077 /* R will have a TREE_CHAIN if and only if it has already been
5078 processed by finish_member_declaration. This can happen
5079 if, for example, it is a TYPE_DECL for a class-scoped
5080 ENUMERAL_TYPE; such a thing will already have been added to
5081 the field list by tsubst_enum above. */
5082 if (!TREE_CHAIN (r
))
5084 set_current_access_from_decl (r
);
5085 finish_member_declaration (r
);
5089 /* Set up the list (TYPE_METHODS) and vector (CLASSTYPE_METHOD_VEC)
5090 for this instantiation. */
5091 for (t
= TYPE_METHODS (pattern
); t
; t
= TREE_CHAIN (t
))
5093 tree r
= tsubst (t
, args
, /*complain=*/1, NULL_TREE
);
5094 set_current_access_from_decl (r
);
5095 finish_member_declaration (r
);
5098 /* Construct the DECL_FRIENDLIST for the new class type. */
5099 typedecl
= TYPE_MAIN_DECL (type
);
5100 for (t
= DECL_FRIENDLIST (TYPE_MAIN_DECL (pattern
));
5106 for (friends
= TREE_VALUE (t
);
5107 friends
!= NULL_TREE
;
5108 friends
= TREE_CHAIN (friends
))
5109 if (TREE_PURPOSE (friends
) == error_mark_node
)
5111 tsubst_friend_function (TREE_VALUE (friends
),
5115 tsubst_copy (TREE_PURPOSE (t
), args
,
5116 /*complain=*/1, NULL_TREE
),
5117 tsubst (TREE_PURPOSE (friends
), args
,
5118 /*complain=*/1, NULL_TREE
));
5121 for (t
= CLASSTYPE_FRIEND_CLASSES (pattern
);
5125 tree friend_type
= TREE_VALUE (t
);
5126 tree new_friend_type
;
5128 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
5129 new_friend_type
= tsubst_friend_class (friend_type
, args
);
5130 else if (uses_template_parms (friend_type
))
5131 new_friend_type
= tsubst (friend_type
, args
, /*complain=*/1,
5135 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (friend_type
));
5137 /* The call to xref_tag_from_type does injection for friend
5139 push_nested_namespace (ns
);
5141 xref_tag_from_type (friend_type
, NULL_TREE
, 1);
5142 pop_nested_namespace (ns
);
5145 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
5146 /* Trick make_friend_class into realizing that the friend
5147 we're adding is a template, not an ordinary class. It's
5148 important that we use make_friend_class since it will
5149 perform some error-checking and output cross-reference
5151 ++processing_template_decl
;
5153 make_friend_class (type
, new_friend_type
);
5155 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
5156 --processing_template_decl
;
5159 for (t
= TYPE_FIELDS (type
); t
; t
= TREE_CHAIN (t
))
5160 if (TREE_CODE (t
) == FIELD_DECL
)
5162 TREE_TYPE (t
) = complete_type (TREE_TYPE (t
));
5163 require_complete_type (t
);
5166 /* Set the file and line number information to whatever is given for
5167 the class itself. This puts error messages involving generated
5168 implicit functions at a predictable point, and the same point
5169 that would be used for non-template classes. */
5170 lineno
= DECL_SOURCE_LINE (typedecl
);
5171 input_filename
= DECL_SOURCE_FILE (typedecl
);
5173 unreverse_member_declarations (type
);
5174 finish_struct_1 (type
);
5175 CLASSTYPE_GOT_SEMICOLON (type
) = 1;
5177 /* Clear this now so repo_template_used is happy. */
5178 TYPE_BEING_DEFINED (type
) = 0;
5179 repo_template_used (type
);
5181 /* Now that the class is complete, instantiate default arguments for
5182 any member functions. We don't do this earlier because the
5183 default arguments may reference members of the class. */
5184 if (!PRIMARY_TEMPLATE_P (template))
5185 for (t
= TYPE_METHODS (type
); t
; t
= TREE_CHAIN (t
))
5186 if (TREE_CODE (t
) == FUNCTION_DECL
5187 /* Implicitly generated member functions will not have tmplate
5188 information; they are not instantiations, but instead are
5189 created "fresh" for each instantiation. */
5190 && DECL_TEMPLATE_INFO (t
))
5191 tsubst_default_arguments (t
);
5194 pop_from_top_level ();
5207 if (t1
== NULL_TREE
)
5208 return t2
== NULL_TREE
;
5209 if (t2
== NULL_TREE
)
5211 /* Don't care if one declares its arg const and the other doesn't -- the
5212 main variant of the arg type is all that matters. */
5213 if (TYPE_MAIN_VARIANT (TREE_VALUE (t1
))
5214 != TYPE_MAIN_VARIANT (TREE_VALUE (t2
)))
5216 return list_eq (TREE_CHAIN (t1
), TREE_CHAIN (t2
));
5219 /* If arg is a non-type template parameter that does not depend on template
5220 arguments, fold it like we weren't in the body of a template. */
5223 maybe_fold_nontype_arg (arg
)
5226 if (TREE_CODE_CLASS (TREE_CODE (arg
)) != 't'
5227 && !uses_template_parms (arg
))
5229 /* Sometimes, one of the args was an expression involving a
5230 template constant parameter, like N - 1. Now that we've
5231 tsubst'd, we might have something like 2 - 1. This will
5232 confuse lookup_template_class, so we do constant folding
5233 here. We have to unset processing_template_decl, to
5234 fool build_expr_from_tree() into building an actual
5237 int saved_processing_template_decl
= processing_template_decl
;
5238 processing_template_decl
= 0;
5239 arg
= fold (build_expr_from_tree (arg
));
5240 processing_template_decl
= saved_processing_template_decl
;
5245 /* Return the TREE_VEC with the arguments for the innermost template header,
5246 where ARGS is either that or the VEC of VECs for all the
5250 innermost_args (args
)
5253 return TMPL_ARGS_LEVEL (args
, TMPL_ARGS_DEPTH (args
));
5256 /* Substitute ARGS into the vector of template arguments T. */
5259 tsubst_template_arg_vector (t
, args
, complain
)
5264 int len
= TREE_VEC_LENGTH (t
), need_new
= 0, i
;
5265 tree
*elts
= (tree
*) alloca (len
* sizeof (tree
));
5267 bzero ((char *) elts
, len
* sizeof (tree
));
5269 for (i
= 0; i
< len
; i
++)
5271 if (TREE_VEC_ELT (t
, i
) != NULL_TREE
5272 && TREE_CODE (TREE_VEC_ELT (t
, i
)) == TREE_VEC
)
5273 elts
[i
] = tsubst_template_arg_vector (TREE_VEC_ELT (t
, i
),
5276 elts
[i
] = maybe_fold_nontype_arg
5277 (tsubst_expr (TREE_VEC_ELT (t
, i
), args
, complain
,
5280 if (elts
[i
] != TREE_VEC_ELT (t
, i
))
5287 t
= make_temp_vec (len
);
5288 for (i
= 0; i
< len
; i
++)
5289 TREE_VEC_ELT (t
, i
) = elts
[i
];
5294 /* Return the result of substituting ARGS into the template parameters
5295 given by PARMS. If there are m levels of ARGS and m + n levels of
5296 PARMS, then the result will contain n levels of PARMS. For
5297 example, if PARMS is `template <class T> template <class U>
5298 template <T*, U, class V>' and ARGS is {{int}, {double}} then the
5299 result will be `template <int*, double, class V>'. */
5302 tsubst_template_parms (parms
, args
, complain
)
5310 for (new_parms
= &r
;
5311 TMPL_PARMS_DEPTH (parms
) > TMPL_ARGS_DEPTH (args
);
5312 new_parms
= &(TREE_CHAIN (*new_parms
)),
5313 parms
= TREE_CHAIN (parms
))
5316 make_tree_vec (TREE_VEC_LENGTH (TREE_VALUE (parms
)));
5319 for (i
= 0; i
< TREE_VEC_LENGTH (new_vec
); ++i
)
5321 tree default_value
=
5322 TREE_PURPOSE (TREE_VEC_ELT (TREE_VALUE (parms
), i
));
5324 TREE_VALUE (TREE_VEC_ELT (TREE_VALUE (parms
), i
));
5326 TREE_VEC_ELT (new_vec
, i
)
5327 = build_tree_list (tsubst (default_value
, args
, complain
,
5329 tsubst (parm_decl
, args
, complain
,
5334 tree_cons (build_int_2 (0, (TMPL_PARMS_DEPTH (parms
)
5335 - TMPL_ARGS_DEPTH (args
))),
5336 new_vec
, NULL_TREE
);
5342 /* Substitute the ARGS into the indicated aggregate (or enumeration)
5343 type T. If T is not an aggregate or enumeration type, it is
5344 handled as if by tsubst. IN_DECL is as for tsubst. If
5345 ENTERING_SCOPE is non-zero, T is the context for a template which
5346 we are presently tsubst'ing. Return the subsituted value. */
5349 tsubst_aggr_type (t
, args
, complain
, in_decl
, entering_scope
)
5359 switch (TREE_CODE (t
))
5362 if (TYPE_PTRMEMFUNC_P (t
))
5364 tree r
= build_ptrmemfunc_type
5365 (tsubst (TYPE_PTRMEMFUNC_FN_TYPE (t
), args
, complain
, in_decl
));
5366 return cp_build_qualified_type_real (r
, TYPE_QUALS (t
),
5370 /* else fall through */
5373 if (TYPE_TEMPLATE_INFO (t
))
5379 /* First, determine the context for the type we are looking
5381 if (TYPE_CONTEXT (t
) != NULL_TREE
)
5382 context
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
,
5384 in_decl
, /*entering_scope=*/1);
5386 context
= NULL_TREE
;
5388 /* Then, figure out what arguments are appropriate for the
5389 type we are trying to find. For example, given:
5391 template <class T> struct S;
5392 template <class T, class U> void f(T, U) { S<U> su; }
5394 and supposing that we are instantiating f<int, double>,
5395 then our ARGS will be {int, double}, but, when looking up
5396 S we only want {double}. */
5398 argvec
= tsubst_template_arg_vector (TYPE_TI_ARGS (t
), args
,
5401 r
= lookup_template_class (t
, argvec
, in_decl
, context
,
5405 return cp_build_qualified_type_real (r
, TYPE_QUALS (t
),
5409 /* This is not a template type, so there's nothing to do. */
5413 return tsubst (t
, args
, complain
, in_decl
);
5417 /* Substitute into the default argument ARG (a default argument for
5418 FN), which has the indicated TYPE. */
5421 tsubst_default_argument (fn
, type
, arg
)
5426 /* This default argument came from a template. Instantiate the
5427 default argument here, not in tsubst. In the case of
5436 we must be careful to do name lookup in the scope of S<T>,
5437 rather than in the current class. */
5438 if (DECL_CLASS_SCOPE_P (fn
))
5439 pushclass (DECL_REAL_CONTEXT (fn
), 2);
5441 arg
= tsubst_expr (arg
, DECL_TI_ARGS (fn
), /*complain=*/1, NULL_TREE
);
5443 if (DECL_CLASS_SCOPE_P (fn
))
5446 /* Make sure the default argument is reasonable. */
5447 arg
= check_default_argument (type
, arg
);
5452 /* Substitute into all the default arguments for FN. */
5455 tsubst_default_arguments (fn
)
5461 tmpl_args
= DECL_TI_ARGS (fn
);
5463 /* If this function is not yet instantiated, we certainly don't need
5464 its default arguments. */
5465 if (uses_template_parms (tmpl_args
))
5468 for (arg
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
5470 arg
= TREE_CHAIN (arg
))
5471 if (TREE_PURPOSE (arg
))
5472 TREE_PURPOSE (arg
) = tsubst_default_argument (fn
,
5474 TREE_PURPOSE (arg
));
5477 /* Substitute the ARGS into the T, which is a _DECL. TYPE is the
5478 (already computed) substitution of ARGS into TREE_TYPE (T), if
5479 appropriate. Return the result of the substitution. IN_DECL is as
5483 tsubst_decl (t
, args
, type
, in_decl
)
5490 char* saved_filename
;
5493 /* Set the filename and linenumber to improve error-reporting. */
5494 saved_lineno
= lineno
;
5495 saved_filename
= input_filename
;
5496 lineno
= DECL_SOURCE_LINE (t
);
5497 input_filename
= DECL_SOURCE_FILE (t
);
5499 switch (TREE_CODE (t
))
5503 /* We can get here when processing a member template function
5504 of a template class. */
5505 tree decl
= DECL_TEMPLATE_RESULT (t
);
5507 int is_template_template_parm
= DECL_TEMPLATE_TEMPLATE_PARM_P (t
);
5509 if (!is_template_template_parm
)
5511 /* We might already have an instance of this template.
5512 The ARGS are for the surrounding class type, so the
5513 full args contain the tsubst'd args for the context,
5514 plus the innermost args from the template decl. */
5515 tree tmpl_args
= DECL_CLASS_TEMPLATE_P (t
)
5516 ? CLASSTYPE_TI_ARGS (TREE_TYPE (t
))
5517 : DECL_TI_ARGS (DECL_RESULT (t
));
5521 full_args
= tsubst_template_arg_vector (tmpl_args
, args
,
5524 /* tsubst_template_arg_vector doesn't copy the vector if
5525 nothing changed. But, *something* should have
5527 my_friendly_assert (full_args
!= tmpl_args
, 0);
5529 spec
= retrieve_specialization (t
, full_args
);
5531 if (spec
!= NULL_TREE
)
5538 /* Make a new template decl. It will be similar to the
5539 original, but will record the current template arguments.
5540 We also create a new function declaration, which is just
5541 like the old one, but points to this new template, rather
5542 than the old one. */
5545 my_friendly_assert (DECL_LANG_SPECIFIC (r
) != 0, 0);
5546 TREE_CHAIN (r
) = NULL_TREE
;
5548 if (is_template_template_parm
)
5550 tree new_decl
= tsubst (decl
, args
, /*complain=*/1, in_decl
);
5551 DECL_RESULT (r
) = new_decl
;
5552 TREE_TYPE (r
) = TREE_TYPE (new_decl
);
5557 = tsubst_aggr_type (DECL_CONTEXT (t
), args
, /*complain=*/1,
5558 in_decl
, /*entering_scope=*/1);
5559 DECL_CLASS_CONTEXT (r
)
5560 = tsubst_aggr_type (DECL_CLASS_CONTEXT (t
), args
,
5561 /*complain=*/1, in_decl
,
5562 /*entering_scope=*/1);
5563 DECL_TEMPLATE_INFO (r
) = build_tree_list (t
, args
);
5565 if (TREE_CODE (decl
) == TYPE_DECL
)
5567 tree new_type
= tsubst (TREE_TYPE (t
), args
,
5568 /*complain=*/1, in_decl
);
5569 TREE_TYPE (r
) = new_type
;
5570 CLASSTYPE_TI_TEMPLATE (new_type
) = r
;
5571 DECL_RESULT (r
) = TYPE_MAIN_DECL (new_type
);
5572 DECL_TI_ARGS (r
) = CLASSTYPE_TI_ARGS (new_type
);
5576 tree new_decl
= tsubst (decl
, args
, /*complain=*/1, in_decl
);
5577 DECL_RESULT (r
) = new_decl
;
5578 DECL_TI_TEMPLATE (new_decl
) = r
;
5579 TREE_TYPE (r
) = TREE_TYPE (new_decl
);
5580 DECL_TI_ARGS (r
) = DECL_TI_ARGS (new_decl
);
5583 SET_DECL_IMPLICIT_INSTANTIATION (r
);
5584 DECL_TEMPLATE_INSTANTIATIONS (r
) = NULL_TREE
;
5585 DECL_TEMPLATE_SPECIALIZATIONS (r
) = NULL_TREE
;
5587 /* The template parameters for this new template are all the
5588 template parameters for the old template, except the
5589 outermost level of parameters. */
5590 DECL_TEMPLATE_PARMS (r
)
5591 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t
), args
,
5594 if (PRIMARY_TEMPLATE_P (t
))
5595 DECL_PRIMARY_TEMPLATE (r
) = r
;
5597 /* We don't partially instantiate partial specializations. */
5598 if (TREE_CODE (decl
) == TYPE_DECL
)
5601 for (spec
= DECL_TEMPLATE_SPECIALIZATIONS (t
);
5603 spec
= TREE_CHAIN (spec
))
5605 /* It helps to consider example here. Consider:
5616 Now, for example, we are instantiating S<int>::f(U u).
5617 We want to make a template:
5622 It will have a specialization, for the case U = int*, of
5626 void S<int>::f<int*>(int*);
5628 This specialization will be an instantiation of
5629 the specialization given in the declaration of S, with
5630 argument list int*. */
5632 tree fn
= TREE_VALUE (spec
);
5636 if (!DECL_TEMPLATE_SPECIALIZATION (fn
))
5637 /* Instantiations are on the same list, but they're of
5638 no concern to us. */
5641 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
5642 /* A full specialization. There's no need to record
5646 spec_args
= tsubst (DECL_TI_ARGS (fn
), args
,
5647 /*complain=*/1, in_decl
);
5648 new_fn
= tsubst (DECL_RESULT (most_general_template (fn
)),
5649 spec_args
, /*complain=*/1, in_decl
);
5650 DECL_TI_TEMPLATE (new_fn
) = fn
;
5651 register_specialization (new_fn
, r
,
5652 innermost_args (spec_args
));
5655 /* Record this partial instantiation. */
5656 register_specialization (r
, t
,
5657 DECL_TI_ARGS (DECL_RESULT (r
)));
5665 tree argvec
= NULL_TREE
;
5672 /* Nobody should be tsubst'ing into non-template functions. */
5673 my_friendly_assert (DECL_TEMPLATE_INFO (t
) != NULL_TREE
, 0);
5675 if (TREE_CODE (DECL_TI_TEMPLATE (t
)) == TEMPLATE_DECL
)
5679 /* Allocate template arguments on the momentary obstack,
5680 in case we don't need to keep them. */
5683 /* Calculate the most general template of which R is a
5684 specialization, and the complete set of arguments used to
5686 gen_tmpl
= most_general_template (DECL_TI_TEMPLATE (t
));
5688 = tsubst_template_arg_vector (DECL_TI_ARGS
5689 (DECL_TEMPLATE_RESULT (gen_tmpl
)),
5690 args
, /*complain=*/1);
5692 /* Check to see if we already have this specialization. */
5693 spec
= retrieve_specialization (gen_tmpl
, argvec
);
5704 /* Here, we deal with the peculiar case:
5706 template <class T> struct S {
5707 template <class U> friend void f();
5709 template <class U> friend void f() {}
5711 template void f<double>();
5713 Here, the ARGS for the instantiation of will be {int,
5714 double}. But, we only need as many ARGS as there are
5715 levels of template parameters in CODE_PATTERN. We are
5716 careful not to get fooled into reducing the ARGS in
5719 template <class T> struct S { template <class U> void f(U); }
5720 template <class T> template <> void S<T>::f(int) {}
5722 which we can spot because the pattern will be a
5723 specialization in this case. */
5724 args_depth
= TMPL_ARGS_DEPTH (args
);
5726 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (t
)));
5727 if (args_depth
> parms_depth
5728 && !DECL_TEMPLATE_SPECIALIZATION (t
))
5730 my_friendly_assert (DECL_FRIEND_P (t
), 0);
5732 if (parms_depth
> 1)
5736 args
= make_temp_vec (parms_depth
);
5737 for (i
= 0; i
< parms_depth
; ++i
)
5738 TREE_VEC_ELT (args
, i
) =
5739 TREE_VEC_ELT (args
, i
+ (args_depth
- parms_depth
));
5742 args
= TREE_VEC_ELT (args
, args_depth
- parms_depth
);
5747 /* This special case arises when we have something like this:
5749 template <class T> struct S {
5750 friend void f<int>(int, double);
5753 Here, the DECL_TI_TEMPLATE for the friend declaration
5754 will be a LOOKUP_EXPR or an IDENTIFIER_NODE. We are
5755 being called from tsubst_friend_function, and we want
5756 only to create a new decl (R) with appropriate types so
5757 that we can call determine_specialization. */
5758 my_friendly_assert ((TREE_CODE (DECL_TI_TEMPLATE (t
))
5760 || (TREE_CODE (DECL_TI_TEMPLATE (t
))
5761 == IDENTIFIER_NODE
), 0);
5762 gen_tmpl
= NULL_TREE
;
5765 if (DECL_CLASS_SCOPE_P (t
))
5767 if (DECL_NAME (t
) == constructor_name (DECL_CONTEXT (t
)))
5771 ctx
= tsubst_aggr_type (DECL_CLASS_CONTEXT (t
), args
,
5773 /*entering_scope=*/1);
5780 type
= tsubst (type
, args
, /*complain=*/1, in_decl
);
5781 if (type
== error_mark_node
)
5782 return error_mark_node
;
5784 /* We do NOT check for matching decls pushed separately at this
5785 point, as they may not represent instantiations of this
5786 template, and in any case are considered separate under the
5787 discrete model. Instead, see add_maybe_template. */
5791 DECL_USE_TEMPLATE (r
) = 0;
5792 TREE_TYPE (r
) = type
;
5795 = tsubst_aggr_type (DECL_CONTEXT (t
), args
, /*complain=*/1, t
,
5796 /*entering_scope=*/1);
5797 DECL_CLASS_CONTEXT (r
) = ctx
;
5799 if (member
&& IDENTIFIER_TYPENAME_P (DECL_NAME (r
)))
5800 /* Type-conversion operator. Reconstruct the name, in
5801 case it's the name of one of the template's parameters. */
5802 DECL_NAME (r
) = build_typename_overload (TREE_TYPE (type
));
5804 DECL_ARGUMENTS (r
) = tsubst (DECL_ARGUMENTS (t
), args
,
5806 DECL_MAIN_VARIANT (r
) = r
;
5807 DECL_RESULT (r
) = NULL_TREE
;
5809 TREE_STATIC (r
) = 0;
5810 TREE_PUBLIC (r
) = TREE_PUBLIC (t
);
5811 DECL_EXTERNAL (r
) = 1;
5812 DECL_INTERFACE_KNOWN (r
) = 0;
5813 DECL_DEFER_OUTPUT (r
) = 0;
5814 TREE_CHAIN (r
) = NULL_TREE
;
5815 DECL_PENDING_INLINE_INFO (r
) = 0;
5816 DECL_PENDING_INLINE_P (r
) = 0;
5819 /* Set up the DECL_TEMPLATE_INFO for R and compute its mangled
5820 name. There's no need to do this in the special friend
5821 case mentioned above where GEN_TMPL is NULL. */
5824 DECL_TEMPLATE_INFO (r
)
5825 = tree_cons (gen_tmpl
, argvec
, NULL_TREE
);
5826 SET_DECL_IMPLICIT_INSTANTIATION (r
);
5827 register_specialization (r
, gen_tmpl
, argvec
);
5829 /* Set the mangled name for R. */
5830 if (DECL_DESTRUCTOR_P (t
))
5831 DECL_ASSEMBLER_NAME (r
) = build_destructor_name (ctx
);
5834 /* Instantiations of template functions must be mangled
5835 specially, in order to conform to 14.5.5.1
5836 [temp.over.link]. */
5837 tree tmpl
= DECL_TI_TEMPLATE (t
);
5839 /* TMPL will be NULL if this is a specialization of a
5840 member function of a template class. */
5841 if (name_mangling_version
< 1
5842 || tmpl
== NULL_TREE
5843 || (member
&& !is_member_template (tmpl
)
5844 && !DECL_TEMPLATE_INFO (tmpl
)))
5845 set_mangled_name_for_decl (r
);
5847 set_mangled_name_for_template_decl (r
);
5851 make_decl_rtl (r
, NULL_PTR
, 1);
5853 /* Like grokfndecl. If we don't do this, pushdecl will
5854 mess up our TREE_CHAIN because it doesn't find a
5855 previous decl. Sigh. */
5857 && ! uses_template_parms (r
)
5858 && (IDENTIFIER_GLOBAL_VALUE (DECL_ASSEMBLER_NAME (r
))
5860 SET_IDENTIFIER_GLOBAL_VALUE (DECL_ASSEMBLER_NAME (r
), r
);
5862 /* We're not supposed to instantiate default arguments
5863 until they are called, for a template. But, for a
5866 template <class T> void f ()
5867 { extern void g(int i = T()); }
5869 we should do the substitution when the template is
5870 instantiated. We handle the member function case in
5871 instantiate_class_template since the default arguments
5872 might refer to other members of the class. */
5874 && !PRIMARY_TEMPLATE_P (gen_tmpl
)
5875 && !uses_template_parms (argvec
))
5876 tsubst_default_arguments (r
);
5879 /* Copy the list of befriending classes. */
5880 for (friends
= &DECL_BEFRIENDING_CLASSES (r
);
5882 friends
= &TREE_CHAIN (*friends
))
5884 *friends
= copy_node (*friends
);
5885 TREE_VALUE (*friends
) = tsubst (TREE_VALUE (*friends
),
5886 args
, /*complain=*/1,
5890 if (DECL_CONSTRUCTOR_P (r
))
5892 maybe_retrofit_in_chrg (r
);
5893 grok_ctor_properties (ctx
, r
);
5895 else if (DECL_OVERLOADED_OPERATOR_P (r
))
5896 grok_op_properties (r
, DECL_VIRTUAL_P (r
), DECL_FRIEND_P (r
));
5903 TREE_TYPE (r
) = type
;
5904 c_apply_type_quals_to_decl (CP_TYPE_QUALS (type
), r
);
5906 if (TREE_CODE (DECL_INITIAL (r
)) != TEMPLATE_PARM_INDEX
)
5907 DECL_INITIAL (r
) = TREE_TYPE (r
);
5909 DECL_INITIAL (r
) = tsubst (DECL_INITIAL (r
), args
,
5910 /*complain=*/1, in_decl
);
5912 DECL_CONTEXT (r
) = NULL_TREE
;
5913 if (PROMOTE_PROTOTYPES
5914 && (TREE_CODE (type
) == INTEGER_TYPE
5915 || TREE_CODE (type
) == ENUMERAL_TYPE
)
5916 && TYPE_PRECISION (type
) < TYPE_PRECISION (integer_type_node
))
5917 DECL_ARG_TYPE (r
) = integer_type_node
;
5919 TREE_CHAIN (r
) = tsubst (TREE_CHAIN (t
), args
,
5920 /*complain=*/1, TREE_CHAIN (t
));
5928 TREE_TYPE (r
) = type
;
5929 c_apply_type_quals_to_decl (CP_TYPE_QUALS (type
), r
);
5931 /* We don't have to set DECL_CONTEXT here; it is set by
5932 finish_member_declaration. */
5933 DECL_INITIAL (r
) = tsubst_expr (DECL_INITIAL (t
), args
,
5934 /*complain=*/1, in_decl
);
5935 TREE_CHAIN (r
) = NULL_TREE
;
5936 if (TREE_CODE (type
) == VOID_TYPE
)
5937 cp_error_at ("instantiation of `%D' as type void", r
);
5945 = tsubst_copy (DECL_INITIAL (t
), args
, /*complain=*/1, in_decl
);
5946 TREE_CHAIN (r
) = NULL_TREE
;
5951 if (DECL_IMPLICIT_TYPEDEF_P (t
))
5953 /* For an implicit typedef, we just want the implicit
5954 typedef for the tsubst'd type. We've already got the
5955 tsubst'd type, as TYPE, so we just need it's associated
5957 r
= TYPE_NAME (type
);
5960 else if (!DECL_LANG_SPECIFIC (t
))
5962 /* For a template type parameter, we don't have to do
5963 anything special. */
5964 r
= TYPE_NAME (type
);
5978 /* Nobody should be tsubst'ing into non-template variables. */
5979 my_friendly_assert (DECL_LANG_SPECIFIC (t
)
5980 && DECL_TEMPLATE_INFO (t
) != NULL_TREE
, 0);
5982 if (TYPE_P (DECL_CONTEXT (t
)))
5983 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
,
5985 in_decl
, /*entering_scope=*/1);
5987 /* Subsequent calls to pushdecl will fill this in. */
5990 /* Check to see if we already have this specialization. */
5991 tmpl
= DECL_TI_TEMPLATE (t
);
5992 gen_tmpl
= most_general_template (tmpl
);
5993 argvec
= tsubst (DECL_TI_ARGS (t
), args
, /*complain=*/1, in_decl
);
5995 spec
= retrieve_specialization (gen_tmpl
, argvec
);
5997 spec
= retrieve_local_specialization (gen_tmpl
,
5998 current_function_decl
);
6006 /* This declaration is going to have to be around for a while,
6007 so me make sure it is on a saveable obstack. */
6008 push_obstacks_nochange ();
6009 saveable_allocation ();
6013 TREE_TYPE (r
) = type
;
6014 c_apply_type_quals_to_decl (CP_TYPE_QUALS (type
), r
);
6015 DECL_CONTEXT (r
) = ctx
;
6017 /* Don't try to expand the initializer until someone tries to use
6018 this variable; otherwise we run into circular dependencies. */
6019 DECL_INITIAL (r
) = NULL_TREE
;
6023 DECL_CLASS_CONTEXT (r
) = DECL_CONTEXT (r
);
6025 /* Even if the original location is out of scope, the newly
6026 substituted one is not. */
6027 if (TREE_CODE (r
) == VAR_DECL
)
6028 DECL_DEAD_FOR_LOCAL (r
) = 0;
6030 /* A static data member declaration is always marked external
6031 when it is declared in-class, even if an initializer is
6032 present. We mimic the non-template processing here. */
6034 DECL_EXTERNAL (r
) = 1;
6036 DECL_TEMPLATE_INFO (r
) = tree_cons (tmpl
, argvec
, NULL_TREE
);
6037 SET_DECL_IMPLICIT_INSTANTIATION (r
);
6039 register_specialization (r
, gen_tmpl
, argvec
);
6041 register_local_specialization (r
, gen_tmpl
,
6042 current_function_decl
);
6044 TREE_CHAIN (r
) = NULL_TREE
;
6045 if (TREE_CODE (r
) == VAR_DECL
&& TREE_CODE (type
) == VOID_TYPE
)
6046 cp_error_at ("instantiation of `%D' as type void", r
);
6051 my_friendly_abort (0);
6054 /* Restore the file and line information. */
6055 lineno
= saved_lineno
;
6056 input_filename
= saved_filename
;
6061 /* Substitue into the ARG_TYPES of a function type. */
6064 tsubst_arg_types (arg_types
, args
, complain
, in_decl
)
6070 tree remaining_arg_types
;
6073 if (!arg_types
|| arg_types
== void_list_node
)
6076 remaining_arg_types
= tsubst_arg_types (TREE_CHAIN (arg_types
),
6077 args
, complain
, in_decl
);
6078 if (remaining_arg_types
== error_mark_node
)
6079 return error_mark_node
;
6081 type
= tsubst (TREE_VALUE (arg_types
), args
, complain
, in_decl
);
6082 if (type
== error_mark_node
)
6083 return error_mark_node
;
6085 /* Do array-to-pointer, function-to-pointer conversion, and ignore
6086 top-level qualifiers as required. */
6087 type
= TYPE_MAIN_VARIANT (type_decays_to (type
));
6089 /* Note that we do not substitute into default arguments here. The
6090 standard mandates that they be instantiated only when needed,
6091 which is done in build_over_call. */
6092 return hash_tree_cons (TREE_PURPOSE (arg_types
), type
,
6093 remaining_arg_types
);
6097 /* Substitute into a FUNCTION_TYPE or METHOD_TYPE. This routine does
6098 *not* handle the exception-specification for FNTYPE, because the
6099 initial substitution of explicitly provided template parameters
6100 during argument deduction forbids substitution into the
6101 exception-specification:
6105 All references in the function type of the function template to the
6106 corresponding template parameters are replaced by the specified tem-
6107 plate argument values. If a substitution in a template parameter or
6108 in the function type of the function template results in an invalid
6109 type, type deduction fails. [Note: The equivalent substitution in
6110 exception specifications is done only when the function is instanti-
6111 ated, at which point a program is ill-formed if the substitution
6112 results in an invalid type.] */
6115 tsubst_function_type (t
, args
, complain
, in_decl
)
6125 /* The TYPE_CONTEXT is not used for function/method types. */
6126 my_friendly_assert (TYPE_CONTEXT (t
) == NULL_TREE
, 0);
6128 /* Substitue the return type. */
6129 return_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
6130 if (return_type
== error_mark_node
)
6131 return error_mark_node
;
6133 /* Substitue the argument types. */
6134 arg_types
= tsubst_arg_types (TYPE_ARG_TYPES (t
), args
,
6136 if (arg_types
== error_mark_node
)
6137 return error_mark_node
;
6139 /* Construct a new type node and return it. */
6140 if (TREE_CODE (t
) == FUNCTION_TYPE
)
6141 fntype
= build_function_type (return_type
, arg_types
);
6144 tree r
= TREE_TYPE (TREE_VALUE (arg_types
));
6145 if (! IS_AGGR_TYPE (r
))
6149 Type deduction may fail for any of the following
6152 -- Attempting to create "pointer to member of T" when T
6153 is not a class type. */
6155 cp_error ("creating pointer to member function of non-class type `%T'",
6157 return error_mark_node
;
6160 fntype
= build_cplus_method_type (r
, return_type
, TREE_CHAIN
6163 fntype
= build_qualified_type (fntype
, TYPE_QUALS (t
));
6164 fntype
= build_type_attribute_variant (fntype
, TYPE_ATTRIBUTES (t
));
6169 /* Substitute into the PARMS of a call-declarator. */
6172 tsubst_call_declarator_parms (parms
, args
, complain
, in_decl
)
6182 if (!parms
|| parms
== void_list_node
)
6185 new_parms
= tsubst_call_declarator_parms (TREE_CHAIN (parms
),
6186 args
, complain
, in_decl
);
6188 /* Figure out the type of this parameter. */
6189 type
= tsubst (TREE_VALUE (parms
), args
, complain
, in_decl
);
6191 /* Figure out the default argument as well. Note that we use
6192 tsubst_expr since the default argument is really an expression. */
6193 defarg
= tsubst_expr (TREE_PURPOSE (parms
), args
, complain
, in_decl
);
6195 /* Chain this parameter on to the front of those we have already
6196 processed. We don't use hash_tree_cons because that function
6197 doesn't check TREE_PARMLIST. */
6198 new_parms
= tree_cons (defarg
, type
, new_parms
);
6200 /* And note that these are parameters. */
6201 TREE_PARMLIST (new_parms
) = 1;
6206 /* Take the tree structure T and replace template parameters used
6207 therein with the argument vector ARGS. IN_DECL is an associated
6208 decl for diagnostics. If an error occurs, returns ERROR_MARK_NODE.
6209 An appropriate error message is issued only if COMPLAIN is
6210 non-zero. Note that we must be relatively non-tolerant of
6211 extensions here, in order to preserve conformance; if we allow
6212 substitutions that should not be allowed, we may allow argument
6213 deductions that should not succeed, and therefore report ambiguous
6214 overload situations where there are none. In theory, we could
6215 allow the substitution, but indicate that it should have failed,
6216 and allow our caller to make sure that the right thing happens, but
6217 we don't try to do this yet.
6219 This function is used for dealing with types, decls and the like;
6220 for expressions, use tsubst_expr or tsubst_copy. */
6223 tsubst (t
, args
, complain
, in_decl
)
6230 if (t
== NULL_TREE
|| t
== error_mark_node
6231 || t
== integer_type_node
6232 || t
== void_type_node
6233 || t
== char_type_node
6234 || TREE_CODE (t
) == NAMESPACE_DECL
)
6237 if (TREE_CODE (t
) == IDENTIFIER_NODE
)
6238 type
= IDENTIFIER_TYPE_VALUE (t
);
6240 type
= TREE_TYPE (t
);
6241 if (type
== unknown_type_node
)
6242 my_friendly_abort (42);
6244 if (type
&& TREE_CODE (t
) != FUNCTION_DECL
6245 && TREE_CODE (t
) != TYPENAME_TYPE
6246 && TREE_CODE (t
) != TEMPLATE_DECL
6247 && TREE_CODE (t
) != IDENTIFIER_NODE
6248 && TREE_CODE (t
) != FUNCTION_TYPE
6249 && TREE_CODE (t
) != METHOD_TYPE
)
6250 type
= tsubst (type
, args
, complain
, in_decl
);
6251 if (type
== error_mark_node
)
6252 return error_mark_node
;
6254 if (TREE_CODE_CLASS (TREE_CODE (t
)) == 'd')
6255 return tsubst_decl (t
, args
, type
, in_decl
);
6257 switch (TREE_CODE (t
))
6262 return tsubst_aggr_type (t
, args
, complain
, in_decl
,
6263 /*entering_scope=*/0);
6266 case IDENTIFIER_NODE
:
6278 if (t
== integer_type_node
)
6281 if (TREE_CODE (TYPE_MIN_VALUE (t
)) == INTEGER_CST
6282 && TREE_CODE (TYPE_MAX_VALUE (t
)) == INTEGER_CST
)
6286 tree max
, omax
= TREE_OPERAND (TYPE_MAX_VALUE (t
), 0);
6288 max
= tsubst_expr (omax
, args
, complain
, in_decl
);
6289 if (max
== error_mark_node
)
6290 return error_mark_node
;
6292 /* See if we can reduce this expression to something simpler. */
6293 max
= maybe_fold_nontype_arg (max
);
6294 if (!processing_template_decl
&& TREE_READONLY_DECL_P (max
))
6295 max
= decl_constant_value (max
);
6297 if (processing_template_decl
6298 /* When providing explicit arguments to a template
6299 function, but leaving some arguments for subsequent
6300 deduction, MAX may be template-dependent even if we're
6301 not PROCESSING_TEMPLATE_DECL. */
6302 || TREE_CODE (max
) != INTEGER_CST
)
6304 tree itype
= make_node (INTEGER_TYPE
);
6305 TYPE_MIN_VALUE (itype
) = size_zero_node
;
6306 TYPE_MAX_VALUE (itype
) = build_min (MINUS_EXPR
, sizetype
, max
,
6311 if (integer_zerop (omax
))
6313 /* Still allow an explicit array of size zero. */
6315 pedwarn ("creating array with size zero");
6317 else if (integer_zerop (max
) || INT_CST_LT (max
, integer_zero_node
))
6321 Type deduction may fail for any of the following
6324 Attempting to create an array with a size that is
6325 zero or negative. */
6327 cp_error ("creating array with size `%E'", max
);
6329 return error_mark_node
;
6332 max
= fold (build_binary_op (MINUS_EXPR
, max
, integer_one_node
));
6333 return build_index_type (max
);
6336 case TEMPLATE_TYPE_PARM
:
6337 case TEMPLATE_TEMPLATE_PARM
:
6338 case TEMPLATE_PARM_INDEX
:
6346 if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
6347 || TREE_CODE (t
) == TEMPLATE_TEMPLATE_PARM
)
6349 idx
= TEMPLATE_TYPE_IDX (t
);
6350 level
= TEMPLATE_TYPE_LEVEL (t
);
6354 idx
= TEMPLATE_PARM_IDX (t
);
6355 level
= TEMPLATE_PARM_LEVEL (t
);
6358 if (TREE_VEC_LENGTH (args
) > 0)
6360 tree arg
= NULL_TREE
;
6362 levels
= TMPL_ARGS_DEPTH (args
);
6363 if (level
<= levels
)
6364 arg
= TMPL_ARG (args
, level
, idx
);
6366 if (arg
== error_mark_node
)
6367 return error_mark_node
;
6368 else if (arg
!= NULL_TREE
)
6370 if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
6372 my_friendly_assert (TREE_CODE_CLASS (TREE_CODE (arg
))
6374 return cp_build_qualified_type_real
6375 (arg
, CP_TYPE_QUALS (arg
) | CP_TYPE_QUALS (t
),
6378 else if (TREE_CODE (t
) == TEMPLATE_TEMPLATE_PARM
)
6380 if (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t
))
6382 /* We are processing a type constructed from
6383 a template template parameter */
6384 tree argvec
= tsubst (TYPE_TI_ARGS (t
),
6385 args
, complain
, in_decl
);
6386 if (argvec
== error_mark_node
)
6387 return error_mark_node
;
6389 /* We can get a TEMPLATE_TEMPLATE_PARM here when
6390 we are resolving nested-types in the signature of
6391 a member function templates.
6392 Otherwise ARG is a TEMPLATE_DECL and is the real
6393 template to be instantiated. */
6394 if (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
6395 arg
= TYPE_NAME (arg
);
6397 r
= lookup_template_class (DECL_NAME (arg
),
6400 /*entering_scope=*/0);
6401 return cp_build_qualified_type_real (r
,
6406 /* We are processing a template argument list. */
6414 my_friendly_abort (981018);
6417 /* This can happen during the attempted tsubst'ing in
6418 unify. This means that we don't yet have any information
6419 about the template parameter in question. */
6422 /* If we get here, we must have been looking at a parm for a
6423 more deeply nested template. Make a new version of this
6424 template parameter, but with a lower level. */
6425 switch (TREE_CODE (t
))
6427 case TEMPLATE_TYPE_PARM
:
6428 case TEMPLATE_TEMPLATE_PARM
:
6430 TEMPLATE_TYPE_PARM_INDEX (r
)
6431 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (t
),
6433 TYPE_STUB_DECL (r
) = TYPE_NAME (r
) = TEMPLATE_TYPE_DECL (r
);
6434 TYPE_MAIN_VARIANT (r
) = r
;
6435 TYPE_POINTER_TO (r
) = NULL_TREE
;
6436 TYPE_REFERENCE_TO (r
) = NULL_TREE
;
6438 if (TREE_CODE (t
) == TEMPLATE_TEMPLATE_PARM
6439 && TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t
))
6441 tree argvec
= tsubst (TYPE_TI_ARGS (t
), args
,
6443 if (argvec
== error_mark_node
)
6444 return error_mark_node
;
6446 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (r
)
6447 = tree_cons (TYPE_NAME (t
), argvec
, NULL_TREE
);
6451 case TEMPLATE_PARM_INDEX
:
6452 r
= reduce_template_parm_level (t
, type
, levels
);
6456 my_friendly_abort (0);
6464 tree purpose
, value
, chain
, result
;
6466 if (t
== void_list_node
)
6469 purpose
= TREE_PURPOSE (t
);
6472 purpose
= tsubst (purpose
, args
, complain
, in_decl
);
6473 if (purpose
== error_mark_node
)
6474 return error_mark_node
;
6476 value
= TREE_VALUE (t
);
6479 value
= tsubst (value
, args
, complain
, in_decl
);
6480 if (value
== error_mark_node
)
6481 return error_mark_node
;
6483 chain
= TREE_CHAIN (t
);
6484 if (chain
&& chain
!= void_type_node
)
6486 chain
= tsubst (chain
, args
, complain
, in_decl
);
6487 if (chain
== error_mark_node
)
6488 return error_mark_node
;
6490 if (purpose
== TREE_PURPOSE (t
)
6491 && value
== TREE_VALUE (t
)
6492 && chain
== TREE_CHAIN (t
))
6494 result
= hash_tree_cons (purpose
, value
, chain
);
6495 TREE_PARMLIST (result
) = TREE_PARMLIST (t
);
6499 if (type
!= NULL_TREE
)
6501 /* A binfo node. We always need to make a copy, of the node
6502 itself and of its BINFO_BASETYPES. */
6506 /* Make sure type isn't a typedef copy. */
6507 type
= BINFO_TYPE (TYPE_BINFO (type
));
6509 TREE_TYPE (t
) = complete_type (type
);
6510 if (IS_AGGR_TYPE (type
))
6512 BINFO_VTABLE (t
) = TYPE_BINFO_VTABLE (type
);
6513 BINFO_VIRTUALS (t
) = TYPE_BINFO_VIRTUALS (type
);
6514 if (TYPE_BINFO_BASETYPES (type
) != NULL_TREE
)
6515 BINFO_BASETYPES (t
) = copy_node (TYPE_BINFO_BASETYPES (type
));
6520 /* Otherwise, a vector of template arguments. */
6521 return tsubst_template_arg_vector (t
, args
, complain
);
6524 case REFERENCE_TYPE
:
6526 enum tree_code code
;
6528 if (type
== TREE_TYPE (t
))
6531 code
= TREE_CODE (t
);
6536 Type deduction may fail for any of the following
6539 -- Attempting to create a pointer to reference type.
6540 -- Attempting to create a reference to a reference type or
6541 a reference to void. */
6542 if (TREE_CODE (type
) == REFERENCE_TYPE
6543 || (code
== REFERENCE_TYPE
&& TREE_CODE (type
) == VOID_TYPE
))
6545 static int last_line
= 0;
6546 static char* last_file
= 0;
6548 /* We keep track of the last time we issued this error
6549 message to avoid spewing a ton of messages during a
6550 single bad template instantiation. */
6551 if (complain
&& (last_line
!= lineno
||
6552 last_file
!= input_filename
))
6554 if (TREE_CODE (type
) == VOID_TYPE
)
6555 cp_error ("forming reference to void");
6557 cp_error ("forming %s to reference type `%T'",
6558 (code
== POINTER_TYPE
) ? "pointer" : "reference",
6561 last_file
= input_filename
;
6564 return error_mark_node
;
6566 else if (code
== POINTER_TYPE
)
6567 r
= build_pointer_type (type
);
6569 r
= build_reference_type (type
);
6570 r
= cp_build_qualified_type_real (r
, TYPE_QUALS (t
), complain
);
6572 /* Will this ever be needed for TYPE_..._TO values? */
6578 r
= tsubst (TYPE_OFFSET_BASETYPE (t
), args
, complain
, in_decl
);
6579 if (r
== error_mark_node
|| !IS_AGGR_TYPE (r
))
6583 Type deduction may fail for any of the following
6586 -- Attempting to create "pointer to member of T" when T
6587 is not a class type. */
6589 cp_error ("creating pointer to member of non-class type `%T'",
6591 return error_mark_node
;
6593 return build_offset_type (r
, type
);
6601 fntype
= tsubst_function_type (t
, args
, complain
, in_decl
);
6602 if (fntype
== error_mark_node
)
6603 return error_mark_node
;
6605 /* Substitue the exception specification. */
6606 raises
= TYPE_RAISES_EXCEPTIONS (t
);
6609 tree list
= NULL_TREE
;
6611 if (! TREE_VALUE (raises
))
6614 for (; raises
!= NULL_TREE
; raises
= TREE_CHAIN (raises
))
6616 tree spec
= TREE_VALUE (raises
);
6618 spec
= tsubst (spec
, args
, complain
, in_decl
);
6619 if (spec
== error_mark_node
)
6621 list
= add_exception_specifier (list
, spec
, complain
);
6623 fntype
= build_exception_variant (fntype
, list
);
6629 tree domain
= tsubst (TYPE_DOMAIN (t
), args
, complain
, in_decl
);
6630 if (domain
== error_mark_node
)
6631 return error_mark_node
;
6633 /* As an optimization, we avoid regenerating the array type if
6634 it will obviously be the same as T. */
6635 if (type
== TREE_TYPE (t
) && domain
== TYPE_DOMAIN (t
))
6638 /* These checks should match the ones in grokdeclarator.
6642 The deduction may fail for any of the following reasons:
6644 -- Attempting to create an array with an element type that
6645 is void, a function type, or a reference type. */
6646 if (TREE_CODE (type
) == VOID_TYPE
6647 || TREE_CODE (type
) == FUNCTION_TYPE
6648 || TREE_CODE (type
) == REFERENCE_TYPE
)
6651 cp_error ("creating array of `%T'", type
);
6652 return error_mark_node
;
6655 r
= build_cplus_array_type (type
, domain
);
6662 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6664 tree e2
= tsubst (TREE_OPERAND (t
, 1), args
, complain
,
6667 if (e1
== error_mark_node
|| e2
== error_mark_node
)
6668 return error_mark_node
;
6670 return fold (build (TREE_CODE (t
), TREE_TYPE (t
), e1
, e2
));
6676 tree e
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6678 if (e
== error_mark_node
)
6679 return error_mark_node
;
6681 return fold (build (TREE_CODE (t
), TREE_TYPE (t
), e
));
6686 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
6687 in_decl
, /*entering_scope=*/1);
6688 tree f
= tsubst_copy (TYPENAME_TYPE_FULLNAME (t
), args
,
6691 if (ctx
== error_mark_node
|| f
== error_mark_node
)
6692 return error_mark_node
;
6694 if (!IS_AGGR_TYPE (ctx
))
6697 cp_error ("`%T' is not a class, struct, or union type",
6699 return error_mark_node
;
6701 else if (!uses_template_parms (ctx
) && !TYPE_BEING_DEFINED (ctx
))
6703 /* Normally, make_typename_type does not require that the CTX
6704 have complete type in order to allow things like:
6706 template <class T> struct S { typename S<T>::X Y; };
6708 But, such constructs have already been resolved by this
6709 point, so here CTX really should have complete type, unless
6710 it's a partial instantiation. */
6711 ctx
= complete_type (ctx
);
6712 if (!TYPE_SIZE (ctx
))
6715 incomplete_type_error (NULL_TREE
, ctx
);
6716 return error_mark_node
;
6720 f
= make_typename_type (ctx
, f
);
6721 if (f
== error_mark_node
)
6723 return cp_build_qualified_type_real (f
,
6725 | CP_TYPE_QUALS (t
),
6731 tree e
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6733 if (e
== error_mark_node
)
6734 return error_mark_node
;
6735 return make_pointer_declarator (type
, e
);
6740 tree e
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6742 if (e
== error_mark_node
)
6743 return error_mark_node
;
6744 return make_reference_declarator (type
, e
);
6749 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6751 tree e2
= tsubst_expr (TREE_OPERAND (t
, 1), args
, complain
,
6753 if (e1
== error_mark_node
|| e2
== error_mark_node
)
6754 return error_mark_node
;
6756 return build_parse_node (ARRAY_REF
, e1
, e2
, tsubst_expr
);
6761 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6763 tree e2
= (tsubst_call_declarator_parms
6764 (CALL_DECLARATOR_PARMS (t
), args
, complain
, in_decl
));
6765 tree e3
= tsubst (CALL_DECLARATOR_EXCEPTION_SPEC (t
), args
,
6768 if (e1
== error_mark_node
|| e2
== error_mark_node
6769 || e3
== error_mark_node
)
6770 return error_mark_node
;
6772 return make_call_declarator (e1
, e2
, CALL_DECLARATOR_QUALS (t
), e3
);
6777 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6779 tree e2
= tsubst (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
6780 if (e1
== error_mark_node
|| e2
== error_mark_node
)
6781 return error_mark_node
;
6783 return build_parse_node (TREE_CODE (t
), e1
, e2
);
6788 tree e1
= tsubst_expr (TYPE_FIELDS (t
), args
, complain
,
6790 if (e1
== error_mark_node
)
6791 return error_mark_node
;
6793 return TREE_TYPE (e1
);
6797 sorry ("use of `%s' in template",
6798 tree_code_name
[(int) TREE_CODE (t
)]);
6799 return error_mark_node
;
6803 /* Like tsubst, but deals with expressions. This function just replaces
6804 template parms; to finish processing the resultant expression, use
6808 tsubst_copy (t
, args
, complain
, in_decl
)
6813 enum tree_code code
;
6816 if (t
== NULL_TREE
|| t
== error_mark_node
)
6819 code
= TREE_CODE (t
);
6824 return do_identifier (DECL_NAME (t
), 0, NULL_TREE
);
6831 if (!DECL_CONTEXT (t
))
6832 /* This is a global enumeration constant. */
6835 /* Unfortunately, we cannot just call lookup_name here.
6838 template <int I> int f() {
6840 struct S { void g() { E e = a; } };
6843 When we instantiate f<7>::S::g(), say, lookup_name is not
6844 clever enough to find f<7>::a. */
6846 = tsubst_aggr_type (TREE_TYPE (t
), args
, complain
, in_decl
,
6847 /*entering_scope=*/0);
6849 for (v
= TYPE_VALUES (enum_type
);
6852 if (TREE_PURPOSE (v
) == DECL_NAME (t
))
6853 return TREE_VALUE (v
);
6855 /* We didn't find the name. That should never happen; if
6856 name-lookup found it during preliminary parsing, we
6857 should find it again here during instantiation. */
6858 my_friendly_abort (0);
6863 if (DECL_CONTEXT (t
))
6867 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
6868 /*entering_scope=*/1);
6869 if (ctx
!= DECL_CONTEXT (t
))
6870 return lookup_field (ctx
, DECL_NAME (t
), 0, 0);
6876 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
))
6877 t
= tsubst (t
, args
, complain
, in_decl
);
6882 if (is_member_template (t
))
6883 return tsubst (t
, args
, complain
, in_decl
);
6889 /* We must tsbust into a LOOKUP_EXPR in case the names to
6890 which it refers is a conversion operator; in that case the
6891 name will change. We avoid making unnecessary copies,
6894 tree id
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
6896 if (id
!= TREE_OPERAND (t
, 0))
6898 r
= build_nt (LOOKUP_EXPR
, id
);
6899 LOOKUP_EXPR_GLOBAL (r
) = LOOKUP_EXPR_GLOBAL (t
);
6907 case REINTERPRET_CAST_EXPR
:
6908 case CONST_CAST_EXPR
:
6909 case STATIC_CAST_EXPR
:
6910 case DYNAMIC_CAST_EXPR
:
6913 (code
, tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
6914 tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
));
6917 case PREDECREMENT_EXPR
:
6918 case PREINCREMENT_EXPR
:
6919 case POSTDECREMENT_EXPR
:
6920 case POSTINCREMENT_EXPR
:
6922 case TRUTH_NOT_EXPR
:
6925 case CONVERT_EXPR
: /* Unary + */
6932 (code
, tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
6933 tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
));
6938 case TRUNC_DIV_EXPR
:
6940 case FLOOR_DIV_EXPR
:
6941 case ROUND_DIV_EXPR
:
6942 case EXACT_DIV_EXPR
:
6944 case BIT_ANDTC_EXPR
:
6947 case TRUNC_MOD_EXPR
:
6948 case FLOOR_MOD_EXPR
:
6949 case TRUTH_ANDIF_EXPR
:
6950 case TRUTH_ORIF_EXPR
:
6951 case TRUTH_AND_EXPR
:
6972 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
6973 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
));
6977 tree fn
= TREE_OPERAND (t
, 0);
6978 if (is_overloaded_fn (fn
))
6979 fn
= tsubst_copy (get_first_fn (fn
), args
, complain
, in_decl
);
6981 /* Sometimes FN is a LOOKUP_EXPR. */
6982 fn
= tsubst_copy (fn
, args
, complain
, in_decl
);
6984 (code
, fn
, tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
,
6989 case METHOD_CALL_EXPR
:
6991 tree name
= TREE_OPERAND (t
, 0);
6992 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
6994 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
6996 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
6998 else if (TREE_CODE (name
) == SCOPE_REF
6999 && TREE_CODE (TREE_OPERAND (name
, 1)) == BIT_NOT_EXPR
)
7001 tree base
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
7003 name
= TREE_OPERAND (name
, 1);
7004 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
7006 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
7007 name
= build_nt (SCOPE_REF
, base
, name
);
7010 name
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
7012 (code
, name
, tsubst_copy (TREE_OPERAND (t
, 1), args
,
7014 tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
),
7019 /* This processing should really occur in tsubst_expr, However,
7020 tsubst_expr does not recurse into expressions, since it
7021 assumes that there aren't any statements inside them.
7022 Instead, it simply calls build_expr_from_tree. So, we need
7023 to expand the STMT_EXPR here. */
7024 if (!processing_template_decl
)
7026 tree stmt_expr
= begin_stmt_expr ();
7027 tsubst_expr (STMT_EXPR_STMT (t
), args
,
7029 return finish_stmt_expr (stmt_expr
);
7036 case PSEUDO_DTOR_EXPR
:
7039 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
7040 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
),
7041 tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
));
7048 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
7049 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
),
7050 tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
));
7051 NEW_EXPR_USE_GLOBAL (r
) = NEW_EXPR_USE_GLOBAL (t
);
7058 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
7059 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
));
7060 DELETE_EXPR_USE_GLOBAL (r
) = DELETE_EXPR_USE_GLOBAL (t
);
7061 DELETE_EXPR_USE_VEC (r
) = DELETE_EXPR_USE_VEC (t
);
7065 case TEMPLATE_ID_EXPR
:
7067 /* Substituted template arguments */
7068 tree targs
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
,
7071 if (targs
&& TREE_CODE (targs
) == TREE_LIST
)
7074 for (chain
= targs
; chain
; chain
= TREE_CHAIN (chain
))
7075 TREE_VALUE (chain
) = maybe_fold_nontype_arg (TREE_VALUE (chain
));
7080 for (i
= 0; i
< TREE_VEC_LENGTH (targs
); ++i
)
7081 TREE_VEC_ELT (targs
, i
)
7082 = maybe_fold_nontype_arg (TREE_VEC_ELT (targs
, i
));
7085 return lookup_template_function
7086 (tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
), targs
);
7091 tree purpose
, value
, chain
;
7093 if (t
== void_list_node
)
7096 purpose
= TREE_PURPOSE (t
);
7098 purpose
= tsubst_copy (purpose
, args
, complain
, in_decl
);
7099 value
= TREE_VALUE (t
);
7101 value
= tsubst_copy (value
, args
, complain
, in_decl
);
7102 chain
= TREE_CHAIN (t
);
7103 if (chain
&& chain
!= void_type_node
)
7104 chain
= tsubst_copy (chain
, args
, complain
, in_decl
);
7105 if (purpose
== TREE_PURPOSE (t
)
7106 && value
== TREE_VALUE (t
)
7107 && chain
== TREE_CHAIN (t
))
7109 return tree_cons (purpose
, value
, chain
);
7116 case TEMPLATE_TYPE_PARM
:
7117 case TEMPLATE_TEMPLATE_PARM
:
7118 case TEMPLATE_PARM_INDEX
:
7120 case REFERENCE_TYPE
:
7127 return tsubst (t
, args
, complain
, in_decl
);
7129 case IDENTIFIER_NODE
:
7130 if (IDENTIFIER_TYPENAME_P (t
)
7131 /* Make sure it's not just a variable named `__opr', for instance,
7132 which can occur in some existing code. */
7134 return build_typename_overload
7135 (tsubst (TREE_TYPE (t
), args
, complain
, in_decl
));
7142 (CONSTRUCTOR
, tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
7143 NULL_TREE
, tsubst_copy (CONSTRUCTOR_ELTS (t
), args
,
7144 complain
, in_decl
));
7145 TREE_HAS_CONSTRUCTOR (r
) = TREE_HAS_CONSTRUCTOR (t
);
7150 return build_va_arg (tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
,
7152 tsubst (TREE_TYPE (t
), args
, complain
, in_decl
));
7159 /* Like tsubst_copy, but also does semantic processing. */
7162 tsubst_expr (t
, args
, complain
, in_decl
)
7169 if (t
== NULL_TREE
|| t
== error_mark_node
)
7172 if (processing_template_decl
)
7173 return tsubst_copy (t
, args
, complain
, in_decl
);
7175 switch (TREE_CODE (t
))
7179 finish_named_return_value
7180 (TREE_OPERAND (t
, 0),
7181 tsubst_expr (TREE_OPERAND (t
, 1), args
, /*complain=*/1, in_decl
));
7182 tsubst_expr (TREE_CHAIN (t
), args
, complain
, in_decl
);
7185 case CTOR_INITIALIZER
:
7187 current_member_init_list
7188 = tsubst_expr_values (TREE_OPERAND (t
, 0), args
);
7189 current_base_init_list
7190 = tsubst_expr_values (TREE_OPERAND (t
, 1), args
);
7192 tsubst_expr (TREE_CHAIN (t
), args
, complain
, in_decl
);
7197 finish_return_stmt (tsubst_expr (RETURN_EXPR (t
),
7198 args
, complain
, in_decl
));
7203 finish_expr_stmt (tsubst_expr (EXPR_STMT_EXPR (t
),
7204 args
, complain
, in_decl
));
7209 int i
= suspend_momentary ();
7214 decl
= DECL_STMT_DECL (t
);
7215 if (TREE_CODE (decl
) == LABEL_DECL
)
7216 finish_label_decl (DECL_NAME (decl
));
7219 init
= DECL_INITIAL (decl
);
7220 decl
= tsubst (decl
, args
, complain
, in_decl
);
7221 init
= tsubst_expr (init
, args
, complain
, in_decl
);
7223 DECL_INITIAL (decl
) = error_mark_node
;
7224 /* By marking the declaration as instantiated, we avoid
7225 trying to instantiate it. Since instantiate_decl can't
7226 handle local variables, and since we've already done
7227 all that needs to be done, that's the right thing to
7229 if (TREE_CODE (decl
) == VAR_DECL
)
7230 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
7231 maybe_push_decl (decl
);
7232 cp_finish_decl (decl
, init
, NULL_TREE
, 0, 0);
7234 resume_momentary (i
);
7243 stmt
= begin_for_stmt ();
7244 for (tmp
= FOR_INIT_STMT (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
7245 tsubst_expr (tmp
, args
, complain
, in_decl
);
7246 finish_for_init_stmt (stmt
);
7247 finish_for_cond (tsubst_expr (FOR_COND (t
), args
,
7250 tmp
= tsubst_expr (FOR_EXPR (t
), args
, complain
, in_decl
);
7251 finish_for_expr (tmp
, stmt
);
7252 tsubst_expr (FOR_BODY (t
), args
, complain
, in_decl
);
7253 finish_for_stmt (tmp
, stmt
);
7260 stmt
= begin_while_stmt ();
7261 finish_while_stmt_cond (tsubst_expr (WHILE_COND (t
),
7262 args
, complain
, in_decl
),
7264 tsubst_expr (WHILE_BODY (t
), args
, complain
, in_decl
);
7265 finish_while_stmt (stmt
);
7272 stmt
= begin_do_stmt ();
7273 tsubst_expr (DO_BODY (t
), args
, complain
, in_decl
);
7274 finish_do_body (stmt
);
7275 finish_do_stmt (tsubst_expr (DO_COND (t
), args
,
7286 stmt
= begin_if_stmt ();
7287 finish_if_stmt_cond (tsubst_expr (IF_COND (t
),
7288 args
, complain
, in_decl
),
7291 if (tmp
= THEN_CLAUSE (t
), tmp
)
7293 tsubst_expr (tmp
, args
, complain
, in_decl
);
7294 finish_then_clause (stmt
);
7297 if (tmp
= ELSE_CLAUSE (t
), tmp
)
7299 begin_else_clause ();
7300 tsubst_expr (tmp
, args
, complain
, in_decl
);
7301 finish_else_clause (stmt
);
7313 stmt
= begin_compound_stmt (COMPOUND_STMT_NO_SCOPE (t
));
7314 for (substmt
= COMPOUND_BODY (t
);
7315 substmt
!= NULL_TREE
;
7316 substmt
= TREE_CHAIN (substmt
))
7317 tsubst_expr (substmt
, args
, complain
, in_decl
);
7318 return finish_compound_stmt (COMPOUND_STMT_NO_SCOPE (t
), stmt
);
7324 finish_break_stmt ();
7329 finish_continue_stmt ();
7337 stmt
= begin_switch_stmt ();
7338 val
= tsubst_expr (SWITCH_COND (t
), args
, complain
, in_decl
);
7339 finish_switch_cond (val
, stmt
);
7340 tsubst_expr (SWITCH_BODY (t
), args
, complain
, in_decl
);
7341 finish_switch_stmt (val
, stmt
);
7347 finish_case_label (tsubst_expr (CASE_LOW (t
), args
, complain
, in_decl
),
7348 tsubst_expr (CASE_HIGH (t
), args
, complain
, in_decl
));
7352 lineno
= STMT_LINENO (t
);
7353 finish_label_stmt (DECL_NAME (LABEL_STMT_LABEL (t
)));
7358 t
= GOTO_DESTINATION (t
);
7359 if (TREE_CODE (t
) != LABEL_DECL
)
7360 /* Computed goto's must be tsubst'd into. On the other hand,
7361 non-computed gotos must not be; the identifier in question
7362 will have no binding. */
7363 t
= tsubst_expr (t
, args
, complain
, in_decl
);
7366 finish_goto_stmt (t
);
7371 finish_asm_stmt (ASM_CV_QUAL (t
),
7372 tsubst_expr (ASM_STRING (t
), args
, complain
, in_decl
),
7373 tsubst_expr (ASM_OUTPUTS (t
), args
, complain
, in_decl
),
7374 tsubst_expr (ASM_INPUTS (t
), args
, complain
, in_decl
),
7375 tsubst_expr (ASM_CLOBBERS (t
), args
, complain
,
7383 stmt
= begin_try_block ();
7384 tsubst_expr (TRY_STMTS (t
), args
, complain
, in_decl
);
7385 finish_cleanup_try_block (stmt
);
7386 finish_cleanup (tsubst_expr (TRY_HANDLERS (t
), args
,
7394 if (FN_TRY_BLOCK_P (t
))
7395 stmt
= begin_function_try_block ();
7397 stmt
= begin_try_block ();
7399 tsubst_expr (TRY_STMTS (t
), args
, complain
, in_decl
);
7401 if (FN_TRY_BLOCK_P (t
))
7402 finish_function_try_block (stmt
);
7404 finish_try_block (stmt
);
7406 handler
= TRY_HANDLERS (t
);
7407 for (; handler
; handler
= TREE_CHAIN (handler
))
7408 tsubst_expr (handler
, args
, complain
, in_decl
);
7409 if (FN_TRY_BLOCK_P (t
))
7410 finish_function_handler_sequence (stmt
);
7412 finish_handler_sequence (stmt
);
7422 stmt
= begin_handler ();
7423 if (HANDLER_PARMS (t
))
7425 decl
= DECL_STMT_DECL (HANDLER_PARMS (t
));
7426 decl
= tsubst (decl
, args
, complain
, in_decl
);
7430 blocks
= finish_handler_parms (decl
, stmt
);
7431 tsubst_expr (HANDLER_BODY (t
), args
, complain
, in_decl
);
7432 finish_handler (blocks
, stmt
);
7439 if (TREE_CODE (t
) == ENUMERAL_TYPE
)
7440 tsubst (t
, args
, complain
, NULL_TREE
);
7444 return build_expr_from_tree (tsubst_copy (t
, args
, complain
, in_decl
));
7449 /* Instantiate the indicated variable or function template TMPL with
7450 the template arguments in TARG_PTR. */
7453 instantiate_template (tmpl
, targ_ptr
)
7454 tree tmpl
, targ_ptr
;
7460 struct obstack
*old_fmp_obstack
;
7461 extern struct obstack
*function_maybepermanent_obstack
;
7464 if (tmpl
== error_mark_node
)
7465 return error_mark_node
;
7467 my_friendly_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
, 283);
7469 /* Check to see if we already have this specialization. */
7470 spec
= retrieve_specialization (tmpl
, targ_ptr
);
7471 if (spec
!= NULL_TREE
)
7474 if (DECL_TEMPLATE_INFO (tmpl
))
7476 /* The TMPL is a partial instantiation. To get a full set of
7477 arguments we must add the arguments used to perform the
7478 partial instantiation. */
7479 targ_ptr
= add_outermost_template_args (DECL_TI_ARGS (tmpl
),
7481 gen_tmpl
= most_general_template (tmpl
);
7483 /* Check to see if we already have this specialization. */
7484 spec
= retrieve_specialization (gen_tmpl
, targ_ptr
);
7485 if (spec
!= NULL_TREE
)
7491 push_obstacks (&permanent_obstack
, &permanent_obstack
);
7492 old_fmp_obstack
= function_maybepermanent_obstack
;
7493 function_maybepermanent_obstack
= &permanent_obstack
;
7495 len
= DECL_NTPARMS (gen_tmpl
);
7496 inner_args
= innermost_args (targ_ptr
);
7500 tree t
= TREE_VEC_ELT (inner_args
, i
);
7501 if (TREE_CODE_CLASS (TREE_CODE (t
)) == 't')
7503 tree nt
= target_type (t
);
7504 if (IS_AGGR_TYPE (nt
) && decl_function_context (TYPE_MAIN_DECL (nt
)))
7506 cp_error ("type `%T' composed from a local class is not a valid template-argument", t
);
7507 cp_error (" trying to instantiate `%D'", gen_tmpl
);
7508 fndecl
= error_mark_node
;
7514 /* substitute template parameters */
7515 fndecl
= tsubst (DECL_RESULT (gen_tmpl
), targ_ptr
, /*complain=*/1, gen_tmpl
);
7516 /* The DECL_TI_TEMPLATE should always be the immediate parent
7517 template, not the most general template. */
7518 DECL_TI_TEMPLATE (fndecl
) = tmpl
;
7520 if (flag_external_templates
)
7521 add_pending_template (fndecl
);
7524 function_maybepermanent_obstack
= old_fmp_obstack
;
7530 /* Push the name of the class template into the scope of the instantiation. */
7533 overload_template_name (type
)
7536 tree id
= DECL_NAME (CLASSTYPE_TI_TEMPLATE (type
));
7539 if (IDENTIFIER_CLASS_VALUE (id
)
7540 && TREE_TYPE (IDENTIFIER_CLASS_VALUE (id
)) == type
)
7543 decl
= build_decl (TYPE_DECL
, id
, type
);
7544 SET_DECL_ARTIFICIAL (decl
);
7545 pushdecl_class_level (decl
);
7548 /* The FN is a TEMPLATE_DECL for a function. The ARGS are the
7549 arguments that are being used when calling it. TARGS is a vector
7550 into which the deduced template arguments are placed.
7552 Return zero for success, 2 for an incomplete match that doesn't resolve
7553 all the types, and 1 for complete failure. An error message will be
7554 printed only for an incomplete match.
7556 If FN is a conversion operator, RETURN_TYPE is the type desired as
7557 the result of the conversion operator.
7559 TPARMS is a vector of template parameters.
7561 The EXPLICIT_TARGS are explicit template arguments provided via a
7564 The parameter STRICT is one of:
7567 We are deducing arguments for a function call, as in
7571 We are deducing arguments for a conversion function, as in
7575 We are deducing arguments when calculating the partial
7576 ordering between specializations of function or class
7577 templates, as in [temp.func.order] and [temp.class.order],
7578 when doing an explicit instantiation as in [temp.explicit],
7579 when determining an explicit specialization as in
7580 [temp.expl.spec], or when taking the address of a function
7581 template, as in [temp.deduct.funcaddr].
7583 The other arguments are as for type_unification. */
7586 fn_type_unification (fn
, explicit_targs
, targs
, args
, return_type
,
7588 tree fn
, explicit_targs
, targs
, args
, return_type
;
7589 unification_kind_t strict
;
7595 my_friendly_assert (TREE_CODE (fn
) == TEMPLATE_DECL
, 0);
7597 fntype
= TREE_TYPE (fn
);
7602 The specified template arguments must match the template
7603 parameters in kind (i.e., type, nontype, template), and there
7604 must not be more arguments than there are parameters;
7605 otherwise type deduction fails.
7607 Nontype arguments must match the types of the corresponding
7608 nontype template parameters, or must be convertible to the
7609 types of the corresponding nontype parameters as specified in
7610 _temp.arg.nontype_, otherwise type deduction fails.
7612 All references in the function type of the function template
7613 to the corresponding template parameters are replaced by the
7614 specified template argument values. If a substitution in a
7615 template parameter or in the function type of the function
7616 template results in an invalid type, type deduction fails. */
7618 tree converted_args
;
7621 = (coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
7622 explicit_targs
, NULL_TREE
, /*complain=*/0,
7623 /*require_all_arguments=*/0));
7624 if (converted_args
== error_mark_node
)
7627 fntype
= tsubst (fntype
, converted_args
, /*complain=*/0, NULL_TREE
);
7628 if (fntype
== error_mark_node
)
7631 /* Place the explicitly specified arguments in TARGS. */
7632 for (i
= 0; i
< TREE_VEC_LENGTH (targs
); i
++)
7633 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (converted_args
, i
);
7636 parms
= TYPE_ARG_TYPES (fntype
);
7638 if (DECL_CONV_FN_P (fn
))
7640 /* This is a template conversion operator. Use the return types
7641 as well as the argument types. We use it instead of 'this', since
7642 we could be comparing conversions from different classes. */
7643 parms
= tree_cons (NULL_TREE
, TREE_TYPE (fntype
),
7644 TREE_CHAIN (parms
));
7645 args
= tree_cons (NULL_TREE
, return_type
, TREE_CHAIN (args
));
7648 /* We allow incomplete unification without an error message here
7649 because the standard doesn't seem to explicitly prohibit it. Our
7650 callers must be ready to deal with unification failures in any
7652 result
= type_unification_real (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
7653 targs
, parms
, args
, /*subr=*/0,
7654 strict
, /*allow_incomplete*/1);
7657 /* All is well so far. Now, check:
7661 When all template arguments have been deduced, all uses of
7662 template parameters in nondeduced contexts are replaced with
7663 the corresponding deduced argument values. If the
7664 substitution results in an invalid type, as described above,
7665 type deduction fails. */
7666 if (tsubst (TREE_TYPE (fn
), targs
, /*complain=*/0, NULL_TREE
)
7673 /* Adjust types before performing type deduction, as described in
7674 [temp.deduct.call] and [temp.deduct.conv]. The rules in these two
7675 sections are symmetric. PARM is the type of a function parameter
7676 or the return type of the conversion function. ARG is the type of
7677 the argument passed to the call, or the type of the value
7678 intialized with the result of the conversion function. */
7681 maybe_adjust_types_for_deduction (strict
, parm
, arg
)
7682 unification_kind_t strict
;
7693 /* Swap PARM and ARG throughout the remainder of this
7694 function; the handling is precisely symmetric since PARM
7695 will initialize ARG rather than vice versa. */
7703 /* There is nothing to do in this case. */
7707 my_friendly_abort (0);
7710 if (TREE_CODE (*parm
) != REFERENCE_TYPE
)
7712 /* [temp.deduct.call]
7714 If P is not a reference type:
7716 --If A is an array type, the pointer type produced by the
7717 array-to-pointer standard conversion (_conv.array_) is
7718 used in place of A for type deduction; otherwise,
7720 --If A is a function type, the pointer type produced by
7721 the function-to-pointer standard conversion
7722 (_conv.func_) is used in place of A for type deduction;
7725 --If A is a cv-qualified type, the top level
7726 cv-qualifiers of A's type are ignored for type
7728 if (TREE_CODE (*arg
) == ARRAY_TYPE
)
7729 *arg
= build_pointer_type (TREE_TYPE (*arg
));
7730 else if (TREE_CODE (*arg
) == FUNCTION_TYPE
)
7731 *arg
= build_pointer_type (*arg
);
7733 *arg
= TYPE_MAIN_VARIANT (*arg
);
7736 /* [temp.deduct.call]
7738 If P is a cv-qualified type, the top level cv-qualifiers
7739 of P's type are ignored for type deduction. If P is a
7740 reference type, the type referred to by P is used for
7742 *parm
= TYPE_MAIN_VARIANT (*parm
);
7743 if (TREE_CODE (*parm
) == REFERENCE_TYPE
)
7744 *parm
= TREE_TYPE (*parm
);
7747 /* Like type_unfication.
7749 If SUBR is 1, we're being called recursively (to unify the
7750 arguments of a function or method parameter of a function
7754 type_unification_real (tparms
, targs
, parms
, args
, subr
,
7755 strict
, allow_incomplete
)
7756 tree tparms
, targs
, parms
, args
;
7758 unification_kind_t strict
;
7759 int allow_incomplete
;
7763 int ntparms
= TREE_VEC_LENGTH (tparms
);
7766 my_friendly_assert (TREE_CODE (tparms
) == TREE_VEC
, 289);
7767 my_friendly_assert (parms
== NULL_TREE
7768 || TREE_CODE (parms
) == TREE_LIST
, 290);
7769 /* ARGS could be NULL (via a call from parse.y to
7770 build_x_function_call). */
7772 my_friendly_assert (TREE_CODE (args
) == TREE_LIST
, 291);
7773 my_friendly_assert (ntparms
> 0, 292);
7778 sub_strict
= UNIFY_ALLOW_MORE_CV_QUAL
| UNIFY_ALLOW_DERIVED
;
7782 sub_strict
= UNIFY_ALLOW_LESS_CV_QUAL
;
7786 sub_strict
= UNIFY_ALLOW_NONE
;
7790 my_friendly_abort (0);
7794 && parms
!= void_list_node
7796 && args
!= void_list_node
)
7798 parm
= TREE_VALUE (parms
);
7799 parms
= TREE_CHAIN (parms
);
7800 arg
= TREE_VALUE (args
);
7801 args
= TREE_CHAIN (args
);
7803 if (arg
== error_mark_node
)
7805 if (arg
== unknown_type_node
)
7806 /* We can't deduce anything from this, but we might get all the
7807 template args from other function args. */
7810 /* Conversions will be performed on a function argument that
7811 corresponds with a function parameter that contains only
7812 non-deducible template parameters and explicitly specified
7813 template parameters. */
7814 if (! uses_template_parms (parm
))
7818 if (TREE_CODE_CLASS (TREE_CODE (arg
)) != 't')
7819 type
= TREE_TYPE (arg
);
7826 if (strict
== DEDUCE_EXACT
)
7828 if (same_type_p (parm
, type
))
7832 /* It might work; we shouldn't check now, because we might
7833 get into infinite recursion. Overload resolution will
7840 if (TREE_CODE_CLASS (TREE_CODE (arg
)) != 't')
7842 my_friendly_assert (TREE_TYPE (arg
) != NULL_TREE
, 293);
7843 if (type_unknown_p (arg
))
7845 /* [temp.deduct.type] A template-argument can be deduced from
7846 a pointer to function or pointer to member function
7847 argument if the set of overloaded functions does not
7848 contain function templates and at most one of a set of
7849 overloaded functions provides a unique match. */
7851 if (resolve_overloaded_unification
7852 (tparms
, targs
, parm
, arg
, strict
, sub_strict
)
7857 arg
= TREE_TYPE (arg
);
7861 maybe_adjust_types_for_deduction (strict
, &parm
, &arg
);
7863 switch (unify (tparms
, targs
, parm
, arg
, sub_strict
))
7871 /* Fail if we've reached the end of the parm list, and more args
7872 are present, and the parm list isn't variadic. */
7873 if (args
&& args
!= void_list_node
&& parms
== void_list_node
)
7875 /* Fail if parms are left and they don't have default values. */
7877 && parms
!= void_list_node
7878 && TREE_PURPOSE (parms
) == NULL_TREE
)
7881 for (i
= 0; i
< ntparms
; i
++)
7882 if (TREE_VEC_ELT (targs
, i
) == NULL_TREE
)
7884 if (!allow_incomplete
)
7885 error ("incomplete type unification");
7891 /* Subroutine of type_unification_real. Args are like the variables at the
7892 call site. ARG is an overloaded function (or template-id); we try
7893 deducing template args from each of the overloads, and if only one
7894 succeeds, we go with that. Modifies TARGS and returns 0 on success. */
7897 resolve_overloaded_unification (tparms
, targs
, parm
, arg
, strict
,
7899 tree tparms
, targs
, parm
, arg
;
7900 unification_kind_t strict
;
7903 tree tempargs
= copy_node (targs
);
7906 if (TREE_CODE (arg
) == ADDR_EXPR
)
7907 arg
= TREE_OPERAND (arg
, 0);
7909 if (TREE_CODE (arg
) == COMPONENT_REF
)
7910 /* Handle `&x' where `x' is some static or non-static member
7912 arg
= TREE_OPERAND (arg
, 1);
7914 if (TREE_CODE (arg
) == OFFSET_REF
)
7915 arg
= TREE_OPERAND (arg
, 1);
7917 /* Strip baselink information. */
7918 while (TREE_CODE (arg
) == TREE_LIST
)
7919 arg
= TREE_VALUE (arg
);
7921 if (TREE_CODE (arg
) == TEMPLATE_ID_EXPR
)
7923 /* If we got some explicit template args, we need to plug them into
7924 the affected templates before we try to unify, in case the
7925 explicit args will completely resolve the templates in question. */
7927 tree expl_subargs
= TREE_OPERAND (arg
, 1);
7928 arg
= TREE_OPERAND (arg
, 0);
7930 for (; arg
; arg
= OVL_NEXT (arg
))
7932 tree fn
= OVL_CURRENT (arg
);
7935 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
7938 subargs
= get_bindings_overload (fn
, DECL_RESULT (fn
), expl_subargs
);
7941 elem
= tsubst (TREE_TYPE (fn
), subargs
, /*complain=*/0,
7943 if (TREE_CODE (elem
) == METHOD_TYPE
)
7944 elem
= build_ptrmemfunc_type (build_pointer_type (elem
));
7945 good
+= try_one_overload (tparms
, targs
, tempargs
, parm
, elem
,
7946 strict
, sub_strict
);
7950 else if (TREE_CODE (arg
) == OVERLOAD
)
7952 for (; arg
; arg
= OVL_NEXT (arg
))
7954 tree type
= TREE_TYPE (OVL_CURRENT (arg
));
7955 if (TREE_CODE (type
) == METHOD_TYPE
)
7956 type
= build_ptrmemfunc_type (build_pointer_type (type
));
7957 good
+= try_one_overload (tparms
, targs
, tempargs
, parm
,
7959 strict
, sub_strict
);
7963 my_friendly_abort (981006);
7965 /* [temp.deduct.type] A template-argument can be deduced from a pointer
7966 to function or pointer to member function argument if the set of
7967 overloaded functions does not contain function templates and at most
7968 one of a set of overloaded functions provides a unique match.
7970 So if we found multiple possibilities, we return success but don't
7975 int i
= TREE_VEC_LENGTH (targs
);
7977 if (TREE_VEC_ELT (tempargs
, i
))
7978 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (tempargs
, i
);
7986 /* Subroutine of resolve_overloaded_unification; does deduction for a single
7987 overload. Fills TARGS with any deduced arguments, or error_mark_node if
7988 different overloads deduce different arguments for a given parm.
7989 Returns 1 on success. */
7992 try_one_overload (tparms
, orig_targs
, targs
, parm
, arg
, strict
,
7994 tree tparms
, orig_targs
, targs
, parm
, arg
;
7995 unification_kind_t strict
;
8002 /* [temp.deduct.type] A template-argument can be deduced from a pointer
8003 to function or pointer to member function argument if the set of
8004 overloaded functions does not contain function templates and at most
8005 one of a set of overloaded functions provides a unique match.
8007 So if this is a template, just return success. */
8009 if (uses_template_parms (arg
))
8012 maybe_adjust_types_for_deduction (strict
, &parm
, &arg
);
8014 /* We don't copy orig_targs for this because if we have already deduced
8015 some template args from previous args, unify would complain when we
8016 try to deduce a template parameter for the same argument, even though
8017 there isn't really a conflict. */
8018 nargs
= TREE_VEC_LENGTH (targs
);
8019 tempargs
= make_scratch_vec (nargs
);
8021 if (unify (tparms
, tempargs
, parm
, arg
, sub_strict
) != 0)
8024 /* First make sure we didn't deduce anything that conflicts with
8025 explicitly specified args. */
8026 for (i
= nargs
; i
--; )
8028 tree elt
= TREE_VEC_ELT (tempargs
, i
);
8029 tree oldelt
= TREE_VEC_ELT (orig_targs
, i
);
8031 if (elt
== NULL_TREE
)
8033 else if (uses_template_parms (elt
))
8035 /* Since we're unifying against ourselves, we will fill in template
8036 args used in the function parm list with our own template parms.
8038 TREE_VEC_ELT (tempargs
, i
) = NULL_TREE
;
8041 else if (oldelt
&& ! template_args_equal (oldelt
, elt
))
8045 for (i
= nargs
; i
--; )
8047 tree elt
= TREE_VEC_ELT (tempargs
, i
);
8050 TREE_VEC_ELT (targs
, i
) = elt
;
8056 /* PARM is a template class (perhaps with unbound template
8057 parameters). ARG is a fully instantiated type. If ARG can be
8058 bound to PARM, return ARG, otherwise return NULL_TREE. TPARMS and
8059 TARGS are as for unify. */
8062 try_class_unification (tparms
, targs
, parm
, arg
)
8071 if (!CLASSTYPE_TEMPLATE_INFO (arg
)
8072 || CLASSTYPE_TI_TEMPLATE (arg
) != CLASSTYPE_TI_TEMPLATE (parm
))
8075 /* We need to make a new template argument vector for the call to
8076 unify. If we used TARGS, we'd clutter it up with the result of
8077 the attempted unification, even if this class didn't work out.
8078 We also don't want to commit ourselves to all the unifications
8079 we've already done, since unification is supposed to be done on
8080 an argument-by-argument basis. In other words, consider the
8081 following pathological case:
8083 template <int I, int J, int K>
8086 template <int I, int J>
8087 struct S<I, J, 2> : public S<I, I, I>, S<J, J, J> {};
8089 template <int I, int J, int K>
8090 void f(S<I, J, K>, S<I, I, I>);
8099 Now, by the time we consider the unification involving `s2', we
8100 already know that we must have `f<0, 0, 0>'. But, even though
8101 `S<0, 1, 2>' is derived from `S<0, 0, 0>', the code is not legal
8102 because there are two ways to unify base classes of S<0, 1, 2>
8103 with S<I, I, I>. If we kept the already deduced knowledge, we
8104 would reject the possibility I=1. */
8106 copy_of_targs
= make_temp_vec (TREE_VEC_LENGTH (targs
));
8107 i
= unify (tparms
, copy_of_targs
, CLASSTYPE_TI_ARGS (parm
),
8108 CLASSTYPE_TI_ARGS (arg
), UNIFY_ALLOW_NONE
);
8111 /* If unification failed, we're done. */
8118 /* Subroutine of get_template_base. RVAL, if non-NULL, is a base we
8119 have alreay discovered to be satisfactory. ARG_BINFO is the binfo
8120 for the base class of ARG that we are currently examining. */
8123 get_template_base_recursive (tparms
, targs
, parm
,
8124 arg_binfo
, rval
, flags
)
8134 tree arg
= BINFO_TYPE (arg_binfo
);
8136 if (!(flags
& GTB_IGNORE_TYPE
))
8138 tree r
= try_class_unification (tparms
, targs
,
8141 /* If there is more than one satisfactory baseclass, then:
8145 If they yield more than one possible deduced A, the type
8149 if (r
&& rval
&& !same_type_p (r
, rval
))
8150 return error_mark_node
;
8155 binfos
= BINFO_BASETYPES (arg_binfo
);
8156 n_baselinks
= binfos
? TREE_VEC_LENGTH (binfos
) : 0;
8158 /* Process base types. */
8159 for (i
= 0; i
< n_baselinks
; i
++)
8161 tree base_binfo
= TREE_VEC_ELT (binfos
, i
);
8164 /* Skip this base, if we've already seen it. */
8165 if (BINFO_MARKED (base_binfo
))
8169 (flags
& GTB_VIA_VIRTUAL
) || TREE_VIA_VIRTUAL (base_binfo
);
8171 /* When searching for a non-virtual, we cannot mark virtually
8174 SET_BINFO_MARKED (base_binfo
);
8176 rval
= get_template_base_recursive (tparms
, targs
,
8180 GTB_VIA_VIRTUAL
* this_virtual
);
8182 /* If we discovered more than one matching base class, we can
8184 if (rval
== error_mark_node
)
8185 return error_mark_node
;
8191 /* Given a template type PARM and a class type ARG, find the unique
8192 base type in ARG that is an instance of PARM. We do not examine
8193 ARG itself; only its base-classes. If there is no appropriate base
8194 class, return NULL_TREE. If there is more than one, return
8195 error_mark_node. PARM may be the type of a partial specialization,
8196 as well as a plain template type. Used by unify. */
8199 get_template_base (tparms
, targs
, parm
, arg
)
8208 my_friendly_assert (IS_AGGR_TYPE_CODE (TREE_CODE (arg
)), 92);
8210 arg_binfo
= TYPE_BINFO (complete_type (arg
));
8211 rval
= get_template_base_recursive (tparms
, targs
,
8216 /* Since get_template_base_recursive marks the bases classes, we
8217 must unmark them here. */
8218 dfs_walk (arg_binfo
, dfs_unmark
, markedp
, 0);
8223 /* Returns the level of DECL, which declares a template parameter. */
8226 template_decl_level (decl
)
8229 switch (TREE_CODE (decl
))
8233 return TEMPLATE_TYPE_LEVEL (TREE_TYPE (decl
));
8236 return TEMPLATE_PARM_LEVEL (DECL_INITIAL (decl
));
8239 my_friendly_abort (0);
8244 /* Decide whether ARG can be unified with PARM, considering only the
8245 cv-qualifiers of each type, given STRICT as documented for unify.
8246 Returns non-zero iff the unification is OK on that basis.*/
8249 check_cv_quals_for_unify (strict
, arg
, parm
)
8254 if (!(strict
& UNIFY_ALLOW_MORE_CV_QUAL
)
8255 && !at_least_as_qualified_p (arg
, parm
))
8258 if (!(strict
& UNIFY_ALLOW_LESS_CV_QUAL
)
8259 && !at_least_as_qualified_p (parm
, arg
))
8265 /* Takes parameters as for type_unification. Returns 0 if the
8266 type deduction suceeds, 1 otherwise. The parameter STRICT is a
8267 bitwise or of the following flags:
8270 Require an exact match between PARM and ARG.
8271 UNIFY_ALLOW_MORE_CV_QUAL:
8272 Allow the deduced ARG to be more cv-qualified than ARG.
8273 UNIFY_ALLOW_LESS_CV_QUAL:
8274 Allow the deduced ARG to be less cv-qualified than ARG.
8275 UNIFY_ALLOW_DERIVED:
8276 Allow the deduced ARG to be a template base class of ARG,
8277 or a pointer to a template base class of the type pointed to by
8279 UNIFY_ALLOW_INTEGER:
8280 Allow any integral type to be deduced. See the TEMPLATE_PARM_INDEX
8281 case for more information. */
8284 unify (tparms
, targs
, parm
, arg
, strict
)
8285 tree tparms
, targs
, parm
, arg
;
8292 /* I don't think this will do the right thing with respect to types.
8293 But the only case I've seen it in so far has been array bounds, where
8294 signedness is the only information lost, and I think that will be
8296 while (TREE_CODE (parm
) == NOP_EXPR
)
8297 parm
= TREE_OPERAND (parm
, 0);
8299 if (arg
== error_mark_node
)
8301 if (arg
== unknown_type_node
)
8302 /* We can't deduce anything from this, but we might get all the
8303 template args from other function args. */
8306 /* If PARM uses template parameters, then we can't bail out here,
8307 even if ARG == PARM, since we won't record unifications for the
8308 template parameters. We might need them if we're trying to
8309 figure out which of two things is more specialized. */
8310 if (arg
== parm
&& !uses_template_parms (parm
))
8313 /* Immediately reject some pairs that won't unify because of
8314 cv-qualification mismatches. */
8315 if (TREE_CODE (arg
) == TREE_CODE (parm
)
8316 && TREE_CODE_CLASS (TREE_CODE (arg
)) == 't'
8317 /* We check the cv-qualifiers when unifying with template type
8318 parameters below. We want to allow ARG `const T' to unify with
8319 PARM `T' for example, when computing which of two templates
8320 is more specialized, for example. */
8321 && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
8322 && !check_cv_quals_for_unify (strict
, arg
, parm
))
8325 switch (TREE_CODE (parm
))
8328 /* In a type which contains a nested-name-specifier, template
8329 argument values cannot be deduced for template parameters used
8330 within the nested-name-specifier. */
8333 case TEMPLATE_TYPE_PARM
:
8334 case TEMPLATE_TEMPLATE_PARM
:
8335 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
8337 if (TEMPLATE_TYPE_LEVEL (parm
)
8338 != template_decl_level (tparm
))
8339 /* The PARM is not one we're trying to unify. Just check
8340 to see if it matches ARG. */
8341 return (TREE_CODE (arg
) == TREE_CODE (parm
)
8342 && same_type_p (parm
, arg
)) ? 0 : 1;
8343 idx
= TEMPLATE_TYPE_IDX (parm
);
8344 targ
= TREE_VEC_ELT (targs
, idx
);
8345 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, idx
));
8347 /* Check for mixed types and values. */
8348 if ((TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
8349 && TREE_CODE (tparm
) != TYPE_DECL
)
8350 || (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
8351 && TREE_CODE (tparm
) != TEMPLATE_DECL
))
8354 if (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
)
8356 if (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (parm
))
8358 /* We arrive here when PARM does not involve template
8361 /* ARG must be constructed from a template class. */
8362 if (TREE_CODE (arg
) != RECORD_TYPE
|| !CLASSTYPE_TEMPLATE_INFO (arg
))
8366 tree parmtmpl
= TYPE_TI_TEMPLATE (parm
);
8367 tree parmvec
= TYPE_TI_ARGS (parm
);
8368 tree argvec
= CLASSTYPE_TI_ARGS (arg
);
8370 = DECL_INNERMOST_TEMPLATE_PARMS (CLASSTYPE_TI_TEMPLATE (arg
));
8373 /* The parameter and argument roles have to be switched here
8374 in order to handle default arguments properly. For example,
8375 template<template <class> class TT> void f(TT<int>)
8376 should be able to accept vector<int> which comes from
8377 template <class T, class Allocator = allocator>
8380 if (coerce_template_parms (argtmplvec
, parmvec
, parmtmpl
, 0, 1)
8384 /* Deduce arguments T, i from TT<T> or TT<i>.
8385 We check each element of PARMVEC and ARGVEC individually
8386 rather than the whole TREE_VEC since they can have
8387 different number of elements. */
8389 for (i
= 0; i
< TREE_VEC_LENGTH (parmvec
); ++i
)
8391 tree t
= TREE_VEC_ELT (parmvec
, i
);
8393 if (unify (tparms
, targs
, t
,
8394 TREE_VEC_ELT (argvec
, i
),
8399 arg
= CLASSTYPE_TI_TEMPLATE (arg
);
8404 /* If PARM is `const T' and ARG is only `int', we don't have
8405 a match unless we are allowing additional qualification.
8406 If ARG is `const int' and PARM is just `T' that's OK;
8407 that binds `const int' to `T'. */
8408 if (!check_cv_quals_for_unify (strict
| UNIFY_ALLOW_LESS_CV_QUAL
,
8412 /* Consider the case where ARG is `const volatile int' and
8413 PARM is `const T'. Then, T should be `volatile int'. */
8415 cp_build_qualified_type_real (arg
,
8417 & ~CP_TYPE_QUALS (parm
),
8419 if (arg
== error_mark_node
)
8423 /* Simple cases: Value already set, does match or doesn't. */
8424 if (targ
!= NULL_TREE
&& same_type_p (targ
, arg
))
8429 /* Make sure that ARG is not a variable-sized array. (Note that
8430 were talking about variable-sized arrays (like `int[n]'),
8431 rather than arrays of unknown size (like `int[]').) We'll
8432 get very confused by such a type since the bound of the array
8433 will not be computable in an instantiation. Besides, such
8434 types are not allowed in ISO C++, so we can do as we please
8436 if (TREE_CODE (arg
) == ARRAY_TYPE
8437 && !uses_template_parms (arg
)
8438 && (TREE_CODE (TYPE_MAX_VALUE (TYPE_DOMAIN (arg
)))
8442 TREE_VEC_ELT (targs
, idx
) = arg
;
8445 case TEMPLATE_PARM_INDEX
:
8446 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
8448 if (TEMPLATE_PARM_LEVEL (parm
)
8449 != template_decl_level (tparm
))
8450 /* The PARM is not one we're trying to unify. Just check
8451 to see if it matches ARG. */
8452 return (TREE_CODE (arg
) == TREE_CODE (parm
)
8453 && cp_tree_equal (parm
, arg
) > 0) ? 0 : 1;
8455 idx
= TEMPLATE_PARM_IDX (parm
);
8456 targ
= TREE_VEC_ELT (targs
, idx
);
8460 int i
= (cp_tree_equal (targ
, arg
) > 0);
8466 my_friendly_abort (42);
8469 /* [temp.deduct.type] If, in the declaration of a function template
8470 with a non-type template-parameter, the non-type
8471 template-parameter is used in an expression in the function
8472 parameter-list and, if the corresponding template-argument is
8473 deduced, the template-argument type shall match the type of the
8474 template-parameter exactly, except that a template-argument
8475 deduced from an array bound may be of any integral type. */
8476 if (same_type_p (TREE_TYPE (arg
), TREE_TYPE (parm
)))
8478 else if ((strict
& UNIFY_ALLOW_INTEGER
)
8479 && (TREE_CODE (TREE_TYPE (parm
)) == INTEGER_TYPE
8480 || TREE_CODE (TREE_TYPE (parm
)) == BOOLEAN_TYPE
))
8485 TREE_VEC_ELT (targs
, idx
) = arg
;
8492 if (TREE_CODE (arg
) != POINTER_TYPE
)
8495 /* [temp.deduct.call]
8497 A can be another pointer or pointer to member type that can
8498 be converted to the deduced A via a qualification
8499 conversion (_conv.qual_).
8501 We pass down STRICT here rather than UNIFY_ALLOW_NONE.
8502 This will allow for additional cv-qualification of the
8503 pointed-to types if appropriate. In general, this is a bit
8504 too generous; we are only supposed to allow qualification
8505 conversions and this method will allow an ARG of char** and
8506 a deduced ARG of const char**. However, overload
8507 resolution will subsequently invalidate the candidate, so
8508 this is probably OK. */
8509 sub_strict
= strict
;
8511 if (TREE_CODE (TREE_TYPE (arg
)) != RECORD_TYPE
)
8512 /* The derived-to-base conversion only persists through one
8513 level of pointers. */
8514 sub_strict
&= ~UNIFY_ALLOW_DERIVED
;
8516 return unify (tparms
, targs
, TREE_TYPE (parm
),
8517 TREE_TYPE (arg
), sub_strict
);
8520 case REFERENCE_TYPE
:
8521 if (TREE_CODE (arg
) != REFERENCE_TYPE
)
8523 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
8527 if (TREE_CODE (arg
) != ARRAY_TYPE
)
8529 if ((TYPE_DOMAIN (parm
) == NULL_TREE
)
8530 != (TYPE_DOMAIN (arg
) == NULL_TREE
))
8532 if (TYPE_DOMAIN (parm
) != NULL_TREE
8533 && unify (tparms
, targs
, TYPE_DOMAIN (parm
),
8534 TYPE_DOMAIN (arg
), UNIFY_ALLOW_NONE
) != 0)
8536 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
8544 if (TREE_CODE (arg
) != TREE_CODE (parm
))
8547 if (TREE_CODE (parm
) == INTEGER_TYPE
8548 && TREE_CODE (TYPE_MAX_VALUE (parm
)) != INTEGER_CST
)
8550 if (TYPE_MIN_VALUE (parm
) && TYPE_MIN_VALUE (arg
)
8551 && unify (tparms
, targs
, TYPE_MIN_VALUE (parm
),
8552 TYPE_MIN_VALUE (arg
), UNIFY_ALLOW_INTEGER
))
8554 if (TYPE_MAX_VALUE (parm
) && TYPE_MAX_VALUE (arg
)
8555 && unify (tparms
, targs
, TYPE_MAX_VALUE (parm
),
8556 TYPE_MAX_VALUE (arg
), UNIFY_ALLOW_INTEGER
))
8559 /* We use the TYPE_MAIN_VARIANT since we have already
8560 checked cv-qualification at the top of the
8562 else if (!same_type_p (TYPE_MAIN_VARIANT (arg
),
8563 TYPE_MAIN_VARIANT (parm
)))
8566 /* As far as unification is concerned, this wins. Later checks
8567 will invalidate it if necessary. */
8570 /* Types INTEGER_CST and MINUS_EXPR can come from array bounds. */
8571 /* Type INTEGER_CST can come from ordinary constant template args. */
8573 while (TREE_CODE (arg
) == NOP_EXPR
)
8574 arg
= TREE_OPERAND (arg
, 0);
8576 if (TREE_CODE (arg
) != INTEGER_CST
)
8578 return !tree_int_cst_equal (parm
, arg
);
8583 if (TREE_CODE (arg
) != TREE_VEC
)
8585 if (TREE_VEC_LENGTH (parm
) != TREE_VEC_LENGTH (arg
))
8587 for (i
= TREE_VEC_LENGTH (parm
) - 1; i
>= 0; i
--)
8588 if (unify (tparms
, targs
,
8589 TREE_VEC_ELT (parm
, i
), TREE_VEC_ELT (arg
, i
),
8597 if (TREE_CODE (arg
) != TREE_CODE (parm
))
8600 if (TYPE_PTRMEMFUNC_P (parm
))
8602 if (!TYPE_PTRMEMFUNC_P (arg
))
8605 return unify (tparms
, targs
,
8606 TYPE_PTRMEMFUNC_FN_TYPE (parm
),
8607 TYPE_PTRMEMFUNC_FN_TYPE (arg
),
8611 if (CLASSTYPE_TEMPLATE_INFO (parm
))
8615 if (strict
& UNIFY_ALLOW_DERIVED
)
8617 /* First, we try to unify the PARM and ARG directly. */
8618 t
= try_class_unification (tparms
, targs
,
8623 /* Fallback to the special case allowed in
8626 If P is a class, and P has the form
8627 template-id, then A can be a derived class of
8628 the deduced A. Likewise, if P is a pointer to
8629 a class of the form template-id, A can be a
8630 pointer to a derived class pointed to by the
8632 t
= get_template_base (tparms
, targs
,
8635 if (! t
|| t
== error_mark_node
)
8639 else if (CLASSTYPE_TEMPLATE_INFO (arg
)
8640 && (CLASSTYPE_TI_TEMPLATE (parm
)
8641 == CLASSTYPE_TI_TEMPLATE (arg
)))
8642 /* Perhaps PARM is something like S<U> and ARG is S<int>.
8643 Then, we should unify `int' and `U'. */
8646 /* There's no chance of unication succeeding. */
8649 return unify (tparms
, targs
, CLASSTYPE_TI_ARGS (parm
),
8650 CLASSTYPE_TI_ARGS (t
), UNIFY_ALLOW_NONE
);
8652 else if (!same_type_p (TYPE_MAIN_VARIANT (parm
),
8653 TYPE_MAIN_VARIANT (arg
)))
8659 if (TREE_CODE (arg
) != TREE_CODE (parm
))
8662 if (unify (tparms
, targs
, TREE_TYPE (parm
),
8663 TREE_TYPE (arg
), UNIFY_ALLOW_NONE
))
8665 return type_unification_real (tparms
, targs
, TYPE_ARG_TYPES (parm
),
8666 TYPE_ARG_TYPES (arg
), 1,
8670 if (TREE_CODE (arg
) != OFFSET_TYPE
)
8672 if (unify (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
8673 TYPE_OFFSET_BASETYPE (arg
), UNIFY_ALLOW_NONE
))
8675 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
8679 if (arg
!= decl_constant_value (parm
))
8684 /* Matched cases are handled by the ARG == PARM test above. */
8688 if (TREE_CODE (TREE_OPERAND (parm
, 1)) == INTEGER_CST
)
8690 /* We handle this case specially, since it comes up with
8691 arrays. In particular, something like:
8693 template <int N> void f(int (&x)[N]);
8695 Here, we are trying to unify the range type, which
8696 looks like [0 ... (N - 1)]. */
8698 t1
= TREE_OPERAND (parm
, 0);
8699 t2
= TREE_OPERAND (parm
, 1);
8701 /* Should this be a regular fold? */
8702 t
= maybe_fold_nontype_arg (build (PLUS_EXPR
,
8706 return unify (tparms
, targs
, t1
, t
, strict
);
8708 /* else fall through */
8711 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (parm
))))
8712 /* We're looking at an expression. This can happen with
8716 void foo(S<I>, S<I + 2>);
8718 This is a "nondeduced context":
8722 The nondeduced contexts are:
8724 --A type that is a template-id in which one or more of
8725 the template-arguments is an expression that references
8726 a template-parameter.
8728 In these cases, we assume deduction succeeded, but don't
8729 actually infer any unifications. */
8732 sorry ("use of `%s' in template type unification",
8733 tree_code_name
[(int) TREE_CODE (parm
)]);
8739 /* Called if RESULT is explicitly instantiated, or is a member of an
8740 explicitly instantiated class, or if using -frepo and the
8741 instantiation of RESULT has been assigned to this file. */
8744 mark_decl_instantiated (result
, extern_p
)
8748 if (TREE_CODE (result
) != FUNCTION_DECL
)
8749 /* The TREE_PUBLIC flag for function declarations will have been
8750 set correctly by tsubst. */
8751 TREE_PUBLIC (result
) = 1;
8755 DECL_INTERFACE_KNOWN (result
) = 1;
8756 DECL_NOT_REALLY_EXTERN (result
) = 1;
8758 /* Always make artificials weak. */
8759 if (DECL_ARTIFICIAL (result
) && flag_weak
)
8760 comdat_linkage (result
);
8761 /* For WIN32 we also want to put explicit instantiations in
8762 linkonce sections. */
8763 else if (TREE_PUBLIC (result
))
8764 maybe_make_one_only (result
);
8766 else if (TREE_CODE (result
) == FUNCTION_DECL
)
8767 mark_inline_for_output (result
);
8770 /* Given two function templates PAT1 and PAT2, and explicit template
8771 arguments EXPLICIT_ARGS return:
8773 1 if PAT1 is more specialized than PAT2 as described in [temp.func.order].
8774 -1 if PAT2 is more specialized than PAT1.
8775 0 if neither is more specialized. */
8778 more_specialized (pat1
, pat2
, explicit_args
)
8779 tree pat1
, pat2
, explicit_args
;
8784 targs
= get_bindings_overload (pat1
, DECL_RESULT (pat2
), explicit_args
);
8788 targs
= get_bindings_overload (pat2
, DECL_RESULT (pat1
), explicit_args
);
8795 /* Given two class template specialization list nodes PAT1 and PAT2, return:
8797 1 if PAT1 is more specialized than PAT2 as described in [temp.class.order].
8798 -1 if PAT2 is more specialized than PAT1.
8799 0 if neither is more specialized. */
8802 more_specialized_class (pat1
, pat2
)
8808 targs
= get_class_bindings (TREE_VALUE (pat1
), TREE_PURPOSE (pat1
),
8809 TREE_PURPOSE (pat2
));
8813 targs
= get_class_bindings (TREE_VALUE (pat2
), TREE_PURPOSE (pat2
),
8814 TREE_PURPOSE (pat1
));
8821 /* Return the template arguments that will produce the function signature
8822 DECL from the function template FN, with the explicit template
8823 arguments EXPLICIT_ARGS. If CHECK_RETTYPE is 1, the return type must
8824 also match. Return NULL_TREE if no satisfactory arguments could be
8828 get_bindings_real (fn
, decl
, explicit_args
, check_rettype
)
8829 tree fn
, decl
, explicit_args
;
8832 int ntparms
= DECL_NTPARMS (fn
);
8833 tree targs
= make_scratch_vec (ntparms
);
8835 tree decl_arg_types
;
8838 /* Substitute the explicit template arguments into the type of DECL.
8839 The call to fn_type_unification will handle substitution into the
8841 decl_type
= TREE_TYPE (decl
);
8842 if (explicit_args
&& uses_template_parms (decl_type
))
8845 tree converted_args
;
8847 if (DECL_TEMPLATE_INFO (decl
))
8848 tmpl
= DECL_TI_TEMPLATE (decl
);
8850 /* We can get here for some illegal specializations. */
8854 = (coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
8855 explicit_args
, NULL_TREE
,
8857 /*require_all_arguments=*/0));
8858 if (converted_args
== error_mark_node
)
8861 decl_type
= tsubst (decl_type
, converted_args
, /*complain=*/0,
8863 if (decl_type
== error_mark_node
)
8867 /* If FN is a static member function, adjust the type of DECL
8869 decl_arg_types
= TYPE_ARG_TYPES (decl_type
);
8870 if (DECL_STATIC_FUNCTION_P (fn
)
8871 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
8872 decl_arg_types
= TREE_CHAIN (decl_arg_types
);
8874 i
= fn_type_unification (fn
, explicit_args
, targs
,
8876 TREE_TYPE (decl_type
),
8884 /* Check to see that the resulting return type is also OK. */
8885 tree t
= tsubst (TREE_TYPE (TREE_TYPE (fn
)), targs
,
8886 /*complain=*/0, NULL_TREE
);
8888 if (!same_type_p (t
, TREE_TYPE (TREE_TYPE (decl
))))
8895 /* For most uses, we want to check the return type. */
8898 get_bindings (fn
, decl
, explicit_args
)
8899 tree fn
, decl
, explicit_args
;
8901 return get_bindings_real (fn
, decl
, explicit_args
, 1);
8904 /* But for more_specialized, we only care about the parameter types. */
8907 get_bindings_overload (fn
, decl
, explicit_args
)
8908 tree fn
, decl
, explicit_args
;
8910 return get_bindings_real (fn
, decl
, explicit_args
, 0);
8913 /* Return the innermost template arguments that, when applied to a
8914 template specialization whose innermost template parameters are
8915 TPARMS, and whose specialization arguments are ARGS, yield the
8918 For example, suppose we have:
8920 template <class T, class U> struct S {};
8921 template <class T> struct S<T*, int> {};
8923 Then, suppose we want to get `S<double*, int>'. The TPARMS will be
8924 {T}, the PARMS will be {T*, int} and the ARGS will be {double*,
8925 int}. The resulting vector will be {double}, indicating that `T'
8926 is bound to `double'. */
8929 get_class_bindings (tparms
, parms
, args
)
8930 tree tparms
, parms
, args
;
8932 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
8933 tree vec
= make_temp_vec (ntparms
);
8935 args
= innermost_args (args
);
8937 if (unify (tparms
, vec
, parms
, args
, UNIFY_ALLOW_NONE
))
8940 for (i
= 0; i
< ntparms
; ++i
)
8941 if (! TREE_VEC_ELT (vec
, i
))
8947 /* In INSTANTIATIONS is a list of <INSTANTIATION, TEMPLATE> pairs.
8948 Pick the most specialized template, and return the corresponding
8949 instantiation, or if there is no corresponding instantiation, the
8950 template itself. EXPLICIT_ARGS is any template arguments explicity
8951 mentioned in a template-id. If there is no most specialized
8952 tempalte, error_mark_node is returned. If there are no templates
8953 at all, NULL_TREE is returned. */
8956 most_specialized_instantiation (instantiations
, explicit_args
)
8957 tree instantiations
;
8963 if (!instantiations
)
8966 champ
= instantiations
;
8967 for (fn
= TREE_CHAIN (instantiations
); fn
; fn
= TREE_CHAIN (fn
))
8969 fate
= more_specialized (TREE_VALUE (champ
),
8970 TREE_VALUE (fn
), explicit_args
);
8977 fn
= TREE_CHAIN (fn
);
8979 return error_mark_node
;
8985 for (fn
= instantiations
; fn
&& fn
!= champ
; fn
= TREE_CHAIN (fn
))
8987 fate
= more_specialized (TREE_VALUE (champ
),
8988 TREE_VALUE (fn
), explicit_args
);
8990 return error_mark_node
;
8993 return TREE_PURPOSE (champ
) ? TREE_PURPOSE (champ
) : TREE_VALUE (champ
);
8996 /* Return the most specialized of the list of templates in FNS that can
8997 produce an instantiation matching DECL, given the explicit template
8998 arguments EXPLICIT_ARGS. */
9001 most_specialized (fns
, decl
, explicit_args
)
9002 tree fns
, decl
, explicit_args
;
9004 tree candidates
= NULL_TREE
;
9007 for (fn
= fns
; fn
; fn
= TREE_CHAIN (fn
))
9009 tree candidate
= TREE_VALUE (fn
);
9011 args
= get_bindings (candidate
, decl
, explicit_args
);
9013 candidates
= tree_cons (NULL_TREE
, candidate
, candidates
);
9016 return most_specialized_instantiation (candidates
, explicit_args
);
9019 /* If DECL is a specialization of some template, return the most
9020 general such template. For example, given:
9022 template <class T> struct S { template <class U> void f(U); };
9024 if TMPL is `template <class U> void S<int>::f(U)' this will return
9025 the full template. This function will not trace past partial
9026 specializations, however. For example, given in addition:
9028 template <class T> struct S<T*> { template <class U> void f(U); };
9030 if TMPL is `template <class U> void S<int*>::f(U)' this will return
9031 `template <class T> template <class U> S<T*>::f(U)'. */
9034 most_general_template (decl
)
9037 while (DECL_TEMPLATE_INFO (decl
)
9038 /* The DECL_TI_TEMPLATE can be a LOOKUP_EXPR or
9039 IDENTIFIER_NODE in some cases. (See cp-tree.h for
9041 && TREE_CODE (DECL_TI_TEMPLATE (decl
)) == TEMPLATE_DECL
)
9042 decl
= DECL_TI_TEMPLATE (decl
);
9047 /* Return the most specialized of the class template specializations
9048 of TMPL which can produce an instantiation matching ARGS, or
9049 error_mark_node if the choice is ambiguous. */
9052 most_specialized_class (tmpl
, args
)
9056 tree list
= NULL_TREE
;
9061 tmpl
= most_general_template (tmpl
);
9062 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
); t
; t
= TREE_CHAIN (t
))
9065 = get_class_bindings (TREE_VALUE (t
), TREE_PURPOSE (t
), args
);
9068 list
= decl_tree_cons (TREE_PURPOSE (t
), TREE_VALUE (t
), list
);
9069 TREE_TYPE (list
) = TREE_TYPE (t
);
9079 for (; t
; t
= TREE_CHAIN (t
))
9081 fate
= more_specialized_class (champ
, t
);
9090 return error_mark_node
;
9096 for (t
= list
; t
&& t
!= champ
; t
= TREE_CHAIN (t
))
9098 fate
= more_specialized_class (champ
, t
);
9100 return error_mark_node
;
9106 /* called from the parser. */
9109 do_decl_instantiation (declspecs
, declarator
, storage
)
9110 tree declspecs
, declarator
, storage
;
9112 tree decl
= grokdeclarator (declarator
, declspecs
, NORMAL
, 0, NULL_TREE
);
9113 tree result
= NULL_TREE
;
9117 /* An error ocurred, for which grokdeclarator has already issued
9118 an appropriate message. */
9120 else if (! DECL_LANG_SPECIFIC (decl
))
9122 cp_error ("explicit instantiation of non-template `%#D'", decl
);
9125 else if (TREE_CODE (decl
) == VAR_DECL
)
9127 /* There is an asymmetry here in the way VAR_DECLs and
9128 FUNCTION_DECLs are handled by grokdeclarator. In the case of
9129 the latter, the DECL we get back will be marked as a
9130 template instantiation, and the appropriate
9131 DECL_TEMPLATE_INFO will be set up. This does not happen for
9132 VAR_DECLs so we do the lookup here. Probably, grokdeclarator
9133 should handle VAR_DECLs as it currently handles
9135 result
= lookup_field (DECL_CONTEXT (decl
), DECL_NAME (decl
), 0, 0);
9136 if (result
&& TREE_CODE (result
) != VAR_DECL
)
9138 cp_error ("no matching template for `%D' found", result
);
9142 else if (TREE_CODE (decl
) != FUNCTION_DECL
)
9144 cp_error ("explicit instantiation of `%#D'", decl
);
9150 /* Check for various error cases. Note that if the explicit
9151 instantiation is legal the RESULT will currently be marked as an
9152 *implicit* instantiation; DECL_EXPLICIT_INSTANTIATION is not set
9153 until we get here. */
9155 if (DECL_TEMPLATE_SPECIALIZATION (result
))
9159 No program shall both explicitly instantiate and explicitly
9160 specialize a template. */
9161 cp_pedwarn ("explicit instantiation of `%#D' after", result
);
9162 cp_pedwarn_at ("explicit specialization here", result
);
9165 else if (DECL_EXPLICIT_INSTANTIATION (result
))
9169 No program shall explicitly instantiate any template more
9172 We check DECL_INTERFACE_KNOWN so as not to complain when the first
9173 instantiation was `extern' and the second is not, and EXTERN_P for
9174 the opposite case. If -frepo, chances are we already got marked
9175 as an explicit instantion because of the repo file. */
9176 if (DECL_INTERFACE_KNOWN (result
) && !extern_p
&& !flag_use_repository
)
9177 cp_pedwarn ("duplicate explicit instantiation of `%#D'", result
);
9179 /* If we've already instantiated the template, just return now. */
9180 if (DECL_INTERFACE_KNOWN (result
))
9183 else if (!DECL_IMPLICIT_INSTANTIATION (result
))
9185 cp_error ("no matching template for `%D' found", result
);
9188 else if (!DECL_TEMPLATE_INFO (result
))
9190 cp_pedwarn ("explicit instantiation of non-template `%#D'", result
);
9194 if (flag_external_templates
)
9197 if (storage
== NULL_TREE
)
9199 else if (storage
== ridpointers
[(int) RID_EXTERN
])
9202 cp_pedwarn ("ANSI C++ forbids the use of `extern' on explicit instantiations");
9206 cp_error ("storage class `%D' applied to template instantiation",
9209 SET_DECL_EXPLICIT_INSTANTIATION (result
);
9210 mark_decl_instantiated (result
, extern_p
);
9211 repo_template_instantiated (result
, extern_p
);
9213 instantiate_decl (result
);
9217 mark_class_instantiated (t
, extern_p
)
9221 SET_CLASSTYPE_EXPLICIT_INSTANTIATION (t
);
9222 SET_CLASSTYPE_INTERFACE_KNOWN (t
);
9223 CLASSTYPE_INTERFACE_ONLY (t
) = extern_p
;
9224 CLASSTYPE_VTABLE_NEEDS_WRITING (t
) = ! extern_p
;
9225 TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (t
)) = extern_p
;
9228 CLASSTYPE_DEBUG_REQUESTED (t
) = 1;
9229 rest_of_type_compilation (t
, 1);
9234 do_type_instantiation (t
, storage
)
9241 if (TREE_CODE (t
) == TYPE_DECL
)
9244 if (! CLASS_TYPE_P (t
) || ! CLASSTYPE_TEMPLATE_INFO (t
))
9246 cp_error ("explicit instantiation of non-template type `%T'", t
);
9252 /* With -fexternal-templates, explicit instantiations are treated the same
9253 as implicit ones. */
9254 if (flag_external_templates
)
9257 if (TYPE_SIZE (t
) == NULL_TREE
)
9259 cp_error ("explicit instantiation of `%#T' before definition of template",
9264 if (storage
!= NULL_TREE
)
9267 cp_pedwarn("ANSI C++ forbids the use of `%s' on explicit instantiations",
9268 IDENTIFIER_POINTER (storage
));
9270 if (storage
== ridpointers
[(int) RID_INLINE
])
9272 else if (storage
== ridpointers
[(int) RID_EXTERN
])
9274 else if (storage
== ridpointers
[(int) RID_STATIC
])
9278 cp_error ("storage class `%D' applied to template instantiation",
9284 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
9288 No program shall both explicitly instantiate and explicitly
9289 specialize a template. */
9290 cp_error ("explicit instantiation of `%#T' after", t
);
9291 cp_error_at ("explicit specialization here", t
);
9294 else if (CLASSTYPE_EXPLICIT_INSTANTIATION (t
))
9298 No program shall explicitly instantiate any template more
9301 If CLASSTYPE_INTERFACE_ONLY, then the first explicit instantiation
9302 was `extern'. If EXTERN_P then the second is. If -frepo, chances
9303 are we already got marked as an explicit instantion because of the
9304 repo file. All these cases are OK. */
9305 if (!CLASSTYPE_INTERFACE_ONLY (t
) && !extern_p
&& !flag_use_repository
)
9306 cp_pedwarn ("duplicate explicit instantiation of `%#T'", t
);
9308 /* If we've already instantiated the template, just return now. */
9309 if (!CLASSTYPE_INTERFACE_ONLY (t
))
9313 mark_class_instantiated (t
, extern_p
);
9314 repo_template_instantiated (t
, extern_p
);
9322 /* In contrast to implicit instantiation, where only the
9323 declarations, and not the definitions, of members are
9324 instantiated, we have here:
9328 The explicit instantiation of a class template specialization
9329 implies the instantiation of all of its members not
9330 previously explicitly specialized in the translation unit
9331 containing the explicit instantiation.
9333 Of course, we can't instantiate member template classes, since
9334 we don't have any arguments for them. Note that the standard
9335 is unclear on whether the instatiation of the members are
9336 *explicit* instantiations or not. We choose to be generous,
9337 and not set DECL_EXPLICIT_INSTANTIATION. Therefore, we allow
9338 the explicit instantiation of a class where some of the members
9339 have no definition in the current translation unit. */
9342 for (tmp
= TYPE_METHODS (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
9343 if (TREE_CODE (tmp
) == FUNCTION_DECL
9344 && DECL_TEMPLATE_INSTANTIATION (tmp
))
9346 mark_decl_instantiated (tmp
, extern_p
);
9347 repo_template_instantiated (tmp
, extern_p
);
9349 instantiate_decl (tmp
);
9352 for (tmp
= TYPE_FIELDS (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
9353 if (TREE_CODE (tmp
) == VAR_DECL
&& DECL_TEMPLATE_INSTANTIATION (tmp
))
9355 mark_decl_instantiated (tmp
, extern_p
);
9356 repo_template_instantiated (tmp
, extern_p
);
9358 instantiate_decl (tmp
);
9361 for (tmp
= CLASSTYPE_TAGS (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
9362 if (IS_AGGR_TYPE (TREE_VALUE (tmp
))
9363 && !uses_template_parms (CLASSTYPE_TI_ARGS (TREE_VALUE (tmp
))))
9364 do_type_instantiation (TYPE_MAIN_DECL (TREE_VALUE (tmp
)), storage
);
9368 /* Given a function DECL, which is a specialization of TMPL, modify
9369 DECL to be a re-instantiation of TMPL with the same template
9370 arguments. TMPL should be the template into which tsubst'ing
9371 should occur for DECL, not the most general template.
9373 One reason for doing this is a scenario like this:
9376 void f(const T&, int i);
9378 void g() { f(3, 7); }
9381 void f(const T& t, const int i) { }
9383 Note that when the template is first instantiated, with
9384 instantiate_template, the resulting DECL will have no name for the
9385 first parameter, and the wrong type for the second. So, when we go
9386 to instantiate the DECL, we regenerate it. */
9389 regenerate_decl_from_template (decl
, tmpl
)
9399 args
= DECL_TI_ARGS (decl
);
9400 code_pattern
= DECL_TEMPLATE_RESULT (tmpl
);
9402 /* Unregister the specialization so that when we tsubst we will not
9403 just return DECL. We don't have to unregister DECL from TMPL
9404 because if would only be registered there if it were a partial
9405 instantiation of a specialization, which it isn't: it's a full
9407 gen_tmpl
= most_general_template (tmpl
);
9408 unregistered
= unregister_specialization (decl
, gen_tmpl
);
9410 /* If the DECL was not unregistered then something peculiar is
9411 happening: we created a specialization but did not call
9412 register_specialization for it. */
9413 my_friendly_assert (unregistered
, 0);
9415 if (TREE_CODE (decl
) == VAR_DECL
)
9416 /* Make sure that we can see identifiers, and compute access
9417 correctly, for the class members used in the declaration of
9418 this static variable. */
9419 pushclass (DECL_CONTEXT (decl
), 2);
9421 /* Do the substitution to get the new declaration. */
9422 new_decl
= tsubst (code_pattern
, args
, /*complain=*/1, NULL_TREE
);
9424 if (TREE_CODE (decl
) == VAR_DECL
)
9426 /* Set up DECL_INITIAL, since tsubst doesn't. */
9427 DECL_INITIAL (new_decl
) =
9428 tsubst_expr (DECL_INITIAL (code_pattern
), args
,
9429 /*complain=*/1, DECL_TI_TEMPLATE (decl
));
9430 /* Pop the class context we pushed above. */
9433 else if (TREE_CODE (decl
) == FUNCTION_DECL
)
9435 /* Convince duplicate_decls to use the DECL_ARGUMENTS from the
9437 DECL_INITIAL (new_decl
) = error_mark_node
;
9438 /* And don't complain about a duplicate definition. */
9439 DECL_INITIAL (decl
) = NULL_TREE
;
9442 /* The immediate parent of the new template is still whatever it was
9443 before, even though tsubst sets DECL_TI_TEMPLATE up as the most
9444 general template. We also reset the DECL_ASSEMBLER_NAME since
9445 tsubst always calculates the name as if the function in question
9446 were really a template instance, and sometimes, with friend
9447 functions, this is not so. See tsubst_friend_function for
9449 DECL_TI_TEMPLATE (new_decl
) = DECL_TI_TEMPLATE (decl
);
9450 DECL_ASSEMBLER_NAME (new_decl
) = DECL_ASSEMBLER_NAME (decl
);
9451 DECL_RTL (new_decl
) = DECL_RTL (decl
);
9453 /* Call duplicate decls to merge the old and new declarations. */
9454 duplicate_decls (new_decl
, decl
);
9456 /* Now, re-register the specialization. */
9457 register_specialization (decl
, gen_tmpl
, args
);
9460 /* Produce the definition of D, a _DECL generated from a template. */
9463 instantiate_decl (d
)
9466 tree tmpl
= DECL_TI_TEMPLATE (d
);
9467 tree args
= DECL_TI_ARGS (d
);
9472 int nested
= in_function_p ();
9473 int pattern_defined
;
9475 char *file
= input_filename
;
9477 /* This function should only be used to instantiate templates for
9478 functions and static member variables. */
9479 my_friendly_assert (TREE_CODE (d
) == FUNCTION_DECL
9480 || TREE_CODE (d
) == VAR_DECL
, 0);
9482 if (DECL_TEMPLATE_INSTANTIATED (d
))
9483 /* D has already been instantiated. It might seem reasonable to
9484 check whether or not D is an explict instantiation, and, if so,
9485 stop here. But when an explicit instantiation is deferred
9486 until the end of the compilation, DECL_EXPLICIT_INSTANTIATION
9487 is set, even though we still need to do the instantiation. */
9490 /* If we already have a specialization of this declaration, then
9491 there's no reason to instantiate it. Note that
9492 retrieve_specialization gives us both instantiations and
9493 specializations, so we must explicitly check
9494 DECL_TEMPLATE_SPECIALIZATION. */
9495 gen_tmpl
= most_general_template (tmpl
);
9496 spec
= retrieve_specialization (gen_tmpl
, args
);
9497 if (spec
!= NULL_TREE
&& DECL_TEMPLATE_SPECIALIZATION (spec
))
9500 /* This needs to happen before any tsubsting. */
9501 if (! push_tinst_level (d
))
9504 /* Set TD to the template whose DECL_TEMPLATE_RESULT is the pattern
9505 for the instantiation. This is not always the most general
9506 template. Consider, for example:
9509 struct S { template <class U> void f();
9510 template <> void f<int>(); };
9512 and an instantiation of S<double>::f<int>. We want TD to be the
9513 specialization S<T>::f<int>, not the more general S<T>::f<U>. */
9516 /* An instantiation cannot have a definition, so we need a
9517 more general template. */
9518 DECL_TEMPLATE_INSTANTIATION (td
)
9519 /* We must also deal with friend templates. Given:
9521 template <class T> struct S {
9522 template <class U> friend void f() {};
9525 S<int>::f<U> say, is not an instantiation of S<T>::f<U>,
9526 so far as the language is concerned, but that's still
9527 where we get the pattern for the instantiation from. On
9528 ther hand, if the definition comes outside the class, say:
9530 template <class T> struct S {
9531 template <class U> friend void f();
9533 template <class U> friend void f() {}
9535 we don't need to look any further. That's what the check for
9536 DECL_INITIAL is for. */
9537 || (TREE_CODE (d
) == FUNCTION_DECL
9538 && DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (td
)
9539 && !DECL_INITIAL (DECL_TEMPLATE_RESULT (td
)));
9542 /* The present template, TD, should not be a definition. If it
9543 were a definition, we should be using it! Note that we
9544 cannot restructure the loop to just keep going until we find
9545 a template with a definition, since that might go too far if
9546 a specialization was declared, but not defined. */
9547 my_friendly_assert (!(TREE_CODE (d
) == VAR_DECL
9548 && !DECL_IN_AGGR_P (DECL_TEMPLATE_RESULT (td
))),
9551 /* Fetch the more general template. */
9552 td
= DECL_TI_TEMPLATE (td
);
9555 code_pattern
= DECL_TEMPLATE_RESULT (td
);
9557 if (TREE_CODE (d
) == FUNCTION_DECL
)
9558 pattern_defined
= (DECL_INITIAL (code_pattern
) != NULL_TREE
);
9560 pattern_defined
= ! DECL_IN_AGGR_P (code_pattern
);
9562 push_to_top_level ();
9563 lineno
= DECL_SOURCE_LINE (d
);
9564 input_filename
= DECL_SOURCE_FILE (d
);
9566 if (pattern_defined
)
9568 repo_template_used (d
);
9570 if (flag_external_templates
&& ! DECL_INTERFACE_KNOWN (d
))
9572 if (flag_alt_external_templates
)
9574 if (interface_unknown
)
9575 warn_if_unknown_interface (d
);
9577 else if (DECL_INTERFACE_KNOWN (code_pattern
))
9579 DECL_INTERFACE_KNOWN (d
) = 1;
9580 DECL_NOT_REALLY_EXTERN (d
) = ! DECL_EXTERNAL (code_pattern
);
9583 warn_if_unknown_interface (code_pattern
);
9587 import_export_decl (d
);
9590 /* Reject all external templates except inline functions. */
9591 if (DECL_INTERFACE_KNOWN (d
)
9592 && ! DECL_NOT_REALLY_EXTERN (d
)
9593 && ! (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_INLINE (d
)))
9596 if (TREE_CODE (d
) == VAR_DECL
9597 && TREE_READONLY (d
)
9598 && DECL_INITIAL (d
) == NULL_TREE
9599 && DECL_INITIAL (code_pattern
) != NULL_TREE
)
9600 /* We need to set up DECL_INITIAL regardless of pattern_defined if
9601 the variable is a static const initialized in the class body. */;
9602 else if (! pattern_defined
9603 || (! (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_INLINE (d
) && nested
)
9606 /* Defer all templates except inline functions used in another
9607 function. We restore the source position here because it's used
9608 by add_pending_template. */
9610 input_filename
= file
;
9612 if (at_eof
&& !pattern_defined
9613 && DECL_EXPLICIT_INSTANTIATION (d
))
9616 The definition of a non-exported function template, a
9617 non-exported member function template, or a non-exported
9618 member function or static data member of a class template
9619 shall be present in every translation unit in which it is
9620 explicitly instantiated. */
9621 cp_error ("explicit instantiation of `%D' but no definition available",
9624 add_pending_template (d
);
9628 /* We're now committed to instantiating this template. Mark it as
9629 instantiated so that recursive calls to instantiate_decl do not
9630 try to instantiate it again. */
9631 DECL_TEMPLATE_INSTANTIATED (d
) = 1;
9633 /* Regenerate the declaration in case the template has been modified
9634 by a subsequent redeclaration. */
9635 regenerate_decl_from_template (d
, td
);
9637 /* We already set the file and line above. Reset them now in case
9638 they changed as a result of calling regenerate_decl_from_template. */
9639 lineno
= DECL_SOURCE_LINE (d
);
9640 input_filename
= DECL_SOURCE_FILE (d
);
9642 if (TREE_CODE (d
) == VAR_DECL
)
9644 DECL_IN_AGGR_P (d
) = 0;
9645 if (DECL_INTERFACE_KNOWN (d
))
9646 DECL_EXTERNAL (d
) = ! DECL_NOT_REALLY_EXTERN (d
);
9649 DECL_EXTERNAL (d
) = 1;
9650 DECL_NOT_REALLY_EXTERN (d
) = 1;
9652 cp_finish_decl (d
, DECL_INITIAL (d
), NULL_TREE
, 0, 0);
9654 else if (TREE_CODE (d
) == FUNCTION_DECL
)
9656 /* Set up context. */
9657 start_function (NULL_TREE
, d
, NULL_TREE
, SF_PRE_PARSED
);
9658 store_parm_decls ();
9660 /* Substitute into the body of the function. */
9661 tsubst_expr (DECL_SAVED_TREE (code_pattern
), args
,
9662 /*complain=*/1, tmpl
);
9664 /* Finish the function. */
9665 expand_body (finish_function (lineno
, 0));
9670 input_filename
= file
;
9672 pop_from_top_level ();
9678 /* Run through the list of templates that we wish we could
9679 instantiate, and instantiate any we can. */
9682 instantiate_pending_templates ()
9685 int instantiated_something
= 0;
9692 t
= &pending_templates
;
9695 tree srcloc
= TREE_PURPOSE (*t
);
9696 tree instantiation
= TREE_VALUE (*t
);
9698 input_filename
= SRCLOC_FILE (srcloc
);
9699 lineno
= SRCLOC_LINE (srcloc
);
9701 if (TREE_CODE_CLASS (TREE_CODE (instantiation
)) == 't')
9705 if (!TYPE_SIZE (instantiation
))
9707 instantiate_class_template (instantiation
);
9708 if (CLASSTYPE_TEMPLATE_INSTANTIATION (instantiation
))
9709 for (fn
= TYPE_METHODS (instantiation
);
9711 fn
= TREE_CHAIN (fn
))
9712 if (! DECL_ARTIFICIAL (fn
))
9713 instantiate_decl (fn
);
9714 if (TYPE_SIZE (instantiation
))
9716 instantiated_something
= 1;
9721 if (TYPE_SIZE (instantiation
))
9722 /* If INSTANTIATION has been instantiated, then we don't
9723 need to consider it again in the future. */
9724 *t
= TREE_CHAIN (*t
);
9726 t
= &TREE_CHAIN (*t
);
9730 if (DECL_TEMPLATE_INSTANTIATION (instantiation
)
9731 && !DECL_TEMPLATE_INSTANTIATED (instantiation
))
9733 instantiation
= instantiate_decl (instantiation
);
9734 if (DECL_TEMPLATE_INSTANTIATED (instantiation
))
9736 instantiated_something
= 1;
9741 if (!DECL_TEMPLATE_INSTANTIATION (instantiation
)
9742 || DECL_TEMPLATE_INSTANTIATED (instantiation
))
9743 /* If INSTANTIATION has been instantiated, then we don't
9744 need to consider it again in the future. */
9745 *t
= TREE_CHAIN (*t
);
9747 t
= &TREE_CHAIN (*t
);
9752 /* Go through the things that are template instantiations if we are
9753 using guiding declarations. */
9754 t
= &maybe_templates
;
9761 fn
= TREE_VALUE (*t
);
9763 if (DECL_INITIAL (fn
))
9764 /* If the FN is already defined, then it was either already
9765 instantiated or, even though guiding declarations were
9766 allowed, a non-template definition was provided. */
9770 template = TREE_PURPOSE (*t
);
9771 args
= get_bindings (template, fn
, NULL_TREE
);
9772 fn
= instantiate_template (template, args
);
9773 instantiate_decl (fn
);
9777 /* Remove this entry from the chain. */
9778 *t
= TREE_CHAIN (*t
);
9780 maybe_template_tail
= t
;
9784 return instantiated_something
;
9787 /* Substitute ARGVEC into T, which is a TREE_LIST. In particular, it
9788 is an initializer list: the TREE_PURPOSEs are DECLs, and the
9789 TREE_VALUEs are initializer values. Used by instantiate_decl. */
9792 tsubst_expr_values (t
, argvec
)
9795 tree first
= NULL_TREE
;
9798 for (; t
; t
= TREE_CHAIN (t
))
9800 tree pur
= tsubst_copy (TREE_PURPOSE (t
), argvec
,
9801 /*complain=*/1, NULL_TREE
);
9802 tree val
= tsubst_expr (TREE_VALUE (t
), argvec
, /*complain=*/1,
9804 *p
= build_tree_list (pur
, val
);
9805 p
= &TREE_CHAIN (*p
);
9813 if (current_function
)
9815 saved_trees
= tree_cons (NULL_TREE
, last_tree
, saved_trees
);
9816 last_tree
= NULL_TREE
;
9819 saved_trees
= tree_cons (NULL_TREE
, NULL_TREE
, saved_trees
);
9826 my_friendly_assert (saved_trees
!= NULL_TREE
, 0);
9828 if (current_function
)
9829 last_tree
= TREE_VALUE (saved_trees
);
9830 saved_trees
= TREE_CHAIN (saved_trees
);
9833 /* D is an undefined function declaration in the presence of templates with
9834 the same name, listed in FNS. If one of them can produce D as an
9835 instantiation, remember this so we can instantiate it at EOF if D has
9836 not been defined by that time. */
9839 add_maybe_template (d
, fns
)
9844 if (DECL_MAYBE_TEMPLATE (d
))
9847 t
= most_specialized (fns
, d
, NULL_TREE
);
9850 if (t
== error_mark_node
)
9852 cp_error ("ambiguous template instantiation for `%D'", d
);
9856 *maybe_template_tail
= tree_cons (t
, d
, NULL_TREE
);
9857 maybe_template_tail
= &TREE_CHAIN (*maybe_template_tail
);
9858 DECL_MAYBE_TEMPLATE (d
) = 1;
9861 /* Set CURRENT_ACCESS_SPECIFIER based on the protection of DECL. */
9864 set_current_access_from_decl (decl
)
9867 if (TREE_PRIVATE (decl
))
9868 current_access_specifier
= access_private_node
;
9869 else if (TREE_PROTECTED (decl
))
9870 current_access_specifier
= access_protected_node
;
9872 current_access_specifier
= access_public_node
;
9875 /* Instantiate an enumerated type. TAG is the template type, NEWTAG
9876 is the instantiation (which should have been created with
9877 start_enum) and ARGS are the template arguments to use. */
9880 tsubst_enum (tag
, newtag
, args
)
9887 for (e
= TYPE_VALUES (tag
); e
; e
= TREE_CHAIN (e
))
9892 /* Note that in a template enum, the TREE_VALUE is the
9893 CONST_DECL, not the corresponding INTEGER_CST. */
9894 value
= tsubst_expr (DECL_INITIAL (TREE_VALUE (e
)),
9895 args
, /*complain=*/1,
9898 /* Give this enumeration constant the correct access. */
9899 set_current_access_from_decl (TREE_VALUE (e
));
9901 /* Actually build the enumerator itself. */
9902 elt
= build_enumerator (TREE_PURPOSE (e
), value
, newtag
);
9904 /* We save the enumerators we have built so far in the
9905 TYPE_VALUES so that if the enumeration constants for
9906 subsequent enumerators involve those for previous ones,
9907 tsubst_copy will be able to find them. */
9908 TREE_CHAIN (elt
) = TYPE_VALUES (newtag
);
9909 TYPE_VALUES (newtag
) = elt
;
9912 finish_enum (newtag
);
9915 /* Set the DECL_ASSEMBLER_NAME for DECL, which is a FUNCTION_DECL that
9916 is either an instantiation or specialization of a template
9920 set_mangled_name_for_template_decl (decl
)
9923 tree saved_namespace
;
9924 tree context
= NULL_TREE
;
9933 my_friendly_assert (TREE_CODE (decl
) == FUNCTION_DECL
, 0);
9934 my_friendly_assert (DECL_TEMPLATE_INFO (decl
) != NULL_TREE
, 0);
9936 /* The names of template functions must be mangled so as to indicate
9937 what template is being specialized with what template arguments.
9938 For example, each of the following three functions must get
9939 different mangled names:
9942 template <> void f<7>(int);
9943 template <> void f<8>(int); */
9945 targs
= DECL_TI_ARGS (decl
);
9946 if (uses_template_parms (targs
))
9947 /* This DECL is for a partial instantiation. There's no need to
9948 mangle the name of such an entity. */
9951 tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
9952 tparms
= DECL_TEMPLATE_PARMS (tmpl
);
9953 parm_depth
= TMPL_PARMS_DEPTH (tparms
);
9955 /* There should be as many levels of arguments as there are levels
9957 my_friendly_assert (parm_depth
== TMPL_ARGS_DEPTH (targs
), 0);
9959 /* We now compute the PARMS and RET_TYPE to give to
9960 build_decl_overload_real. The PARMS and RET_TYPE are the
9961 parameter and return types of the template, after all but the
9962 innermost template arguments have been substituted, not the
9963 parameter and return types of the function DECL. For example,
9966 template <class T> T f(T);
9968 both PARMS and RET_TYPE should be `T' even if DECL is `int f(int)'.
9969 A more subtle example is:
9971 template <class T> struct S { template <class U> void f(T, U); }
9973 Here, if DECL is `void S<int>::f(int, double)', PARMS should be
9974 {int, U}. Thus, the args that we want to subsitute into the
9975 return and parameter type for the function are those in TARGS,
9976 with the innermost level omitted. */
9977 fn_type
= TREE_TYPE (tmpl
);
9978 if (DECL_STATIC_FUNCTION_P (decl
))
9979 context
= DECL_CLASS_CONTEXT (decl
);
9981 if (parm_depth
== 1)
9982 /* No substitution is necessary. */
9989 /* Replace the innermost level of the TARGS with NULL_TREEs to
9990 let tsubst know not to subsitute for those parameters. */
9991 partial_args
= make_temp_vec (TREE_VEC_LENGTH (targs
));
9992 for (i
= 1; i
< TMPL_ARGS_DEPTH (targs
); ++i
)
9993 SET_TMPL_ARGS_LEVEL (partial_args
, i
,
9994 TMPL_ARGS_LEVEL (targs
, i
));
9995 SET_TMPL_ARGS_LEVEL (partial_args
,
9996 TMPL_ARGS_DEPTH (targs
),
9997 make_temp_vec (DECL_NTPARMS (tmpl
)));
9999 /* Now, do the (partial) substitution to figure out the
10000 appropriate function type. */
10001 fn_type
= tsubst (fn_type
, partial_args
, /*complain=*/1, NULL_TREE
);
10002 if (DECL_STATIC_FUNCTION_P (decl
))
10003 context
= tsubst (context
, partial_args
, /*complain=*/1, NULL_TREE
);
10005 /* Substitute into the template parameters to obtain the real
10006 innermost set of parameters. This step is important if the
10007 innermost set of template parameters contains value
10008 parameters whose types depend on outer template parameters. */
10009 TREE_VEC_LENGTH (partial_args
)--;
10010 tparms
= tsubst_template_parms (tparms
, partial_args
, /*complain=*/1);
10013 /* Now, get the innermost parameters and arguments, and figure out
10014 the parameter and return types. */
10015 tparms
= INNERMOST_TEMPLATE_PARMS (tparms
);
10016 targs
= innermost_args (targs
);
10017 ret_type
= TREE_TYPE (fn_type
);
10018 parm_types
= TYPE_ARG_TYPES (fn_type
);
10020 /* For a static member function, we generate a fake `this' pointer,
10021 for the purposes of mangling. This indicates of which class the
10022 function is a member. Because of:
10026 There shall not be a static and a nonstatic member function
10027 with the same name and the same parameter types
10029 we don't have to worry that this will result in a clash with a
10030 non-static member function. */
10031 if (DECL_STATIC_FUNCTION_P (decl
))
10032 parm_types
= hash_tree_chain (build_pointer_type (context
), parm_types
);
10034 /* There should be the same number of template parameters as
10035 template arguments. */
10036 my_friendly_assert (TREE_VEC_LENGTH (tparms
) == TREE_VEC_LENGTH (targs
),
10039 /* If the template is in a namespace, we need to put that into the
10040 mangled name. Unfortunately, build_decl_overload_real does not
10041 get the decl to mangle, so it relies on the current
10042 namespace. Therefore, we set that here temporarily. */
10043 my_friendly_assert (TREE_CODE_CLASS (TREE_CODE (decl
)) == 'd', 980702);
10044 saved_namespace
= current_namespace
;
10045 current_namespace
= CP_DECL_CONTEXT (decl
);
10047 /* Actually set the DCL_ASSEMBLER_NAME. */
10048 DECL_ASSEMBLER_NAME (decl
)
10049 = build_decl_overload_real (DECL_NAME (decl
), parm_types
, ret_type
,
10051 DECL_FUNCTION_MEMBER_P (decl
)
10052 + DECL_CONSTRUCTOR_P (decl
));
10054 /* Restore the previously active namespace. */
10055 current_namespace
= saved_namespace
;