1 /* Handle parameterized types (templates) for GNU C++.
2 Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000
3 Free Software Foundation, Inc.
4 Written by Ken Raeburn (raeburn@cygnus.com) while at Watchmaker Computing.
5 Rewritten by Jason Merrill (jason@cygnus.com).
7 This file is part of GNU CC.
9 GNU CC is free software; you can redistribute it and/or modify
10 it under the terms of the GNU General Public License as published by
11 the Free Software Foundation; either version 2, or (at your option)
14 GNU CC is distributed in the hope that it will be useful,
15 but WITHOUT ANY WARRANTY; without even the implied warranty of
16 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 GNU General Public License for more details.
19 You should have received a copy of the GNU General Public License
20 along with GNU CC; see the file COPYING. If not, write to
21 the Free Software Foundation, 59 Temple Place - Suite 330,
22 Boston, MA 02111-1307, USA. */
24 /* Known bugs or deficiencies include:
26 all methods must be provided in header files; can't use a source
27 file that contains only the method templates and "just win". */
48 /* The type of functions taking a tree, and some additional data, and
50 typedef int (*tree_fn_t
) PARAMS ((tree
, void*));
52 extern struct obstack permanent_obstack
;
54 /* The PENDING_TEMPLATES is a TREE_LIST of templates whose
55 instantiations have been deferred, either because their definitions
56 were not yet available, or because we were putting off doing the
57 work. The TREE_PURPOSE of each entry is a SRCLOC indicating where
58 the instantiate request occurred; the TREE_VALUE is a either a DECL
59 (for a function or static data member), or a TYPE (for a class)
60 indicating what we are hoping to instantiate. */
61 static tree pending_templates
;
62 static tree
*template_tail
= &pending_templates
;
64 static tree maybe_templates
;
65 static tree
*maybe_template_tail
= &maybe_templates
;
67 int processing_template_parmlist
;
68 static int template_header_count
;
70 static tree saved_trees
;
71 static varray_type inline_parm_levels
;
72 static size_t inline_parm_levels_used
;
74 static tree current_tinst_level
;
76 /* A map from local variable declarations in the body of the template
77 presently being instantiated to the corresponding instantiated
79 static htab_t local_specializations
;
81 #define obstack_chunk_alloc xmalloc
82 #define obstack_chunk_free free
84 #define UNIFY_ALLOW_NONE 0
85 #define UNIFY_ALLOW_MORE_CV_QUAL 1
86 #define UNIFY_ALLOW_LESS_CV_QUAL 2
87 #define UNIFY_ALLOW_DERIVED 4
88 #define UNIFY_ALLOW_INTEGER 8
90 #define GTB_VIA_VIRTUAL 1 /* The base class we are examining is
91 virtual, or a base class of a virtual
93 #define GTB_IGNORE_TYPE 2 /* We don't need to try to unify the current
94 type with the desired type. */
96 static int resolve_overloaded_unification
PARAMS ((tree
, tree
, tree
, tree
,
97 unification_kind_t
, int));
98 static int try_one_overload
PARAMS ((tree
, tree
, tree
, tree
, tree
,
99 unification_kind_t
, int));
100 static int unify
PARAMS ((tree
, tree
, tree
, tree
, int));
101 static void add_pending_template
PARAMS ((tree
));
102 static int push_tinst_level
PARAMS ((tree
));
103 static void reopen_tinst_level
PARAMS ((tree
));
104 static tree classtype_mangled_name
PARAMS ((tree
));
105 static char *mangle_class_name_for_template
PARAMS ((const char *, tree
, tree
));
106 static tree tsubst_initializer_list
PARAMS ((tree
, tree
));
107 static int list_eq
PARAMS ((tree
, tree
));
108 static tree get_class_bindings
PARAMS ((tree
, tree
, tree
));
109 static tree coerce_template_parms
PARAMS ((tree
, tree
, tree
, int, int));
110 static void tsubst_enum
PARAMS ((tree
, tree
, tree
));
111 static tree add_to_template_args
PARAMS ((tree
, tree
));
112 static tree add_outermost_template_args
PARAMS ((tree
, tree
));
113 static void maybe_adjust_types_for_deduction
PARAMS ((unification_kind_t
, tree
*,
115 static int type_unification_real
PARAMS ((tree
, tree
, tree
, tree
,
116 int, unification_kind_t
, int));
117 static void note_template_header
PARAMS ((int));
118 static tree maybe_fold_nontype_arg
PARAMS ((tree
));
119 static tree convert_nontype_argument
PARAMS ((tree
, tree
));
120 static tree convert_template_argument
PARAMS ((tree
, tree
, tree
, int,
122 static tree get_bindings_overload
PARAMS ((tree
, tree
, tree
));
123 static int for_each_template_parm
PARAMS ((tree
, tree_fn_t
, void*));
124 static tree build_template_parm_index
PARAMS ((int, int, int, tree
, tree
));
125 static int inline_needs_template_parms
PARAMS ((tree
));
126 static void push_inline_template_parms_recursive
PARAMS ((tree
, int));
127 static tree retrieve_specialization
PARAMS ((tree
, tree
));
128 static tree retrieve_local_specialization
PARAMS ((tree
));
129 static tree register_specialization
PARAMS ((tree
, tree
, tree
));
130 static tree register_local_specialization
PARAMS ((tree
, tree
));
131 static int unregister_specialization
PARAMS ((tree
, tree
));
132 static tree reduce_template_parm_level
PARAMS ((tree
, tree
, int));
133 static tree build_template_decl
PARAMS ((tree
, tree
));
134 static int mark_template_parm
PARAMS ((tree
, void *));
135 static tree tsubst_friend_function
PARAMS ((tree
, tree
));
136 static tree tsubst_friend_class
PARAMS ((tree
, tree
));
137 static tree get_bindings_real
PARAMS ((tree
, tree
, tree
, int));
138 static int template_decl_level
PARAMS ((tree
));
139 static tree maybe_get_template_decl_from_type_decl
PARAMS ((tree
));
140 static int check_cv_quals_for_unify
PARAMS ((int, tree
, tree
));
141 static tree tsubst_template_arg_vector
PARAMS ((tree
, tree
, int));
142 static tree tsubst_template_parms
PARAMS ((tree
, tree
, int));
143 static void regenerate_decl_from_template
PARAMS ((tree
, tree
));
144 static tree most_specialized
PARAMS ((tree
, tree
, tree
));
145 static tree most_specialized_class
PARAMS ((tree
, tree
));
146 static void set_mangled_name_for_template_decl
PARAMS ((tree
));
147 static int template_class_depth_real
PARAMS ((tree
, int));
148 static tree tsubst_aggr_type
PARAMS ((tree
, tree
, int, tree
, int));
149 static tree tsubst_decl
PARAMS ((tree
, tree
, tree
, tree
));
150 static tree tsubst_arg_types
PARAMS ((tree
, tree
, int, tree
));
151 static tree tsubst_function_type
PARAMS ((tree
, tree
, int, tree
));
152 static void check_specialization_scope
PARAMS ((void));
153 static tree process_partial_specialization
PARAMS ((tree
));
154 static void set_current_access_from_decl
PARAMS ((tree
));
155 static void check_default_tmpl_args
PARAMS ((tree
, tree
, int, int));
156 static tree tsubst_call_declarator_parms
PARAMS ((tree
, tree
, int, tree
));
157 static tree get_template_base_recursive
PARAMS ((tree
, tree
,
158 tree
, tree
, tree
, int));
159 static tree get_template_base
PARAMS ((tree
, tree
, tree
, tree
));
160 static tree try_class_unification
PARAMS ((tree
, tree
, tree
, tree
));
161 static int coerce_template_template_parms
PARAMS ((tree
, tree
, int,
163 static tree determine_specialization
PARAMS ((tree
, tree
, tree
*, int));
164 static int template_args_equal
PARAMS ((tree
, tree
));
165 static void tsubst_default_arguments
PARAMS ((tree
));
166 static tree for_each_template_parm_r
PARAMS ((tree
*, int *, void *));
167 static tree instantiate_clone
PARAMS ((tree
, tree
));
169 /* Called once to initialize pt.c. */
174 ggc_add_tree_root (&pending_templates
, 1);
175 ggc_add_tree_root (&maybe_templates
, 1);
176 ggc_add_tree_root (&saved_trees
, 1);
177 ggc_add_tree_root (¤t_tinst_level
, 1);
180 /* Do any processing required when DECL (a member template declaration
181 using TEMPLATE_PARAMETERS as its innermost parameter list) is
182 finished. Returns the TEMPLATE_DECL corresponding to DECL, unless
183 it is a specialization, in which case the DECL itself is returned. */
186 finish_member_template_decl (decl
)
189 if (decl
== NULL_TREE
|| decl
== void_type_node
)
191 else if (decl
== error_mark_node
)
192 /* By returning NULL_TREE, the parser will just ignore this
193 declaration. We have already issued the error. */
195 else if (TREE_CODE (decl
) == TREE_LIST
)
197 /* Assume that the class is the only declspec. */
198 decl
= TREE_VALUE (decl
);
199 if (IS_AGGR_TYPE (decl
) && CLASSTYPE_TEMPLATE_INFO (decl
)
200 && ! CLASSTYPE_TEMPLATE_SPECIALIZATION (decl
))
202 tree tmpl
= CLASSTYPE_TI_TEMPLATE (decl
);
203 check_member_template (tmpl
);
208 else if (TREE_CODE (decl
) == FIELD_DECL
)
209 cp_error ("data member `%D' cannot be a member template", decl
);
210 else if (DECL_TEMPLATE_INFO (decl
))
212 if (!DECL_TEMPLATE_SPECIALIZATION (decl
))
214 check_member_template (DECL_TI_TEMPLATE (decl
));
215 return DECL_TI_TEMPLATE (decl
);
221 cp_error ("invalid member template declaration `%D'", decl
);
223 return error_mark_node
;
226 /* Returns the template nesting level of the indicated class TYPE.
236 A<T>::B<U> has depth two, while A<T> has depth one.
237 Both A<T>::B<int> and A<int>::B<U> have depth one, if
238 COUNT_SPECIALIZATIONS is 0 or if they are instantiations, not
241 This function is guaranteed to return 0 if passed NULL_TREE so
242 that, for example, `template_class_depth (current_class_type)' is
246 template_class_depth_real (type
, count_specializations
)
248 int count_specializations
;
253 type
&& TREE_CODE (type
) != NAMESPACE_DECL
;
254 type
= (TREE_CODE (type
) == FUNCTION_DECL
)
255 ? CP_DECL_CONTEXT (type
) : TYPE_CONTEXT (type
))
257 if (TREE_CODE (type
) != FUNCTION_DECL
)
259 if (CLASSTYPE_TEMPLATE_INFO (type
)
260 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (type
))
261 && ((count_specializations
262 && CLASSTYPE_TEMPLATE_SPECIALIZATION (type
))
263 || uses_template_parms (CLASSTYPE_TI_ARGS (type
))))
268 if (DECL_TEMPLATE_INFO (type
)
269 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (type
))
270 && ((count_specializations
271 && DECL_TEMPLATE_SPECIALIZATION (type
))
272 || uses_template_parms (DECL_TI_ARGS (type
))))
280 /* Returns the template nesting level of the indicated class TYPE.
281 Like template_class_depth_real, but instantiations do not count in
285 template_class_depth (type
)
288 return template_class_depth_real (type
, /*count_specializations=*/0);
291 /* Returns 1 if processing DECL as part of do_pending_inlines
292 needs us to push template parms. */
295 inline_needs_template_parms (decl
)
298 if (! DECL_TEMPLATE_INFO (decl
))
301 return (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (most_general_template (decl
)))
302 > (processing_template_decl
+ DECL_TEMPLATE_SPECIALIZATION (decl
)));
305 /* Subroutine of maybe_begin_member_template_processing.
306 Push the template parms in PARMS, starting from LEVELS steps into the
307 chain, and ending at the beginning, since template parms are listed
311 push_inline_template_parms_recursive (parmlist
, levels
)
315 tree parms
= TREE_VALUE (parmlist
);
319 push_inline_template_parms_recursive (TREE_CHAIN (parmlist
), levels
- 1);
321 ++processing_template_decl
;
322 current_template_parms
323 = tree_cons (build_int_2 (0, processing_template_decl
),
324 parms
, current_template_parms
);
325 TEMPLATE_PARMS_FOR_INLINE (current_template_parms
) = 1;
328 for (i
= 0; i
< TREE_VEC_LENGTH (parms
); ++i
)
330 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
331 my_friendly_assert (DECL_P (parm
), 0);
333 switch (TREE_CODE (parm
))
342 /* Make a CONST_DECL as is done in process_template_parm.
343 It is ugly that we recreate this here; the original
344 version built in process_template_parm is no longer
346 tree decl
= build_decl (CONST_DECL
, DECL_NAME (parm
),
348 DECL_ARTIFICIAL (decl
) = 1;
349 DECL_INITIAL (decl
) = DECL_INITIAL (parm
);
350 SET_DECL_TEMPLATE_PARM_P (decl
);
356 my_friendly_abort (0);
361 /* Restore the template parameter context for a member template or
362 a friend template defined in a class definition. */
365 maybe_begin_member_template_processing (decl
)
371 if (inline_needs_template_parms (decl
))
373 parms
= DECL_TEMPLATE_PARMS (most_general_template (decl
));
374 levels
= TMPL_PARMS_DEPTH (parms
) - processing_template_decl
;
376 if (DECL_TEMPLATE_SPECIALIZATION (decl
))
379 parms
= TREE_CHAIN (parms
);
382 push_inline_template_parms_recursive (parms
, levels
);
385 /* Remember how many levels of template parameters we pushed so that
386 we can pop them later. */
387 if (!inline_parm_levels
)
388 VARRAY_INT_INIT (inline_parm_levels
, 4, "inline_parm_levels");
389 if (inline_parm_levels_used
== inline_parm_levels
->num_elements
)
390 VARRAY_GROW (inline_parm_levels
, 2 * inline_parm_levels_used
);
391 VARRAY_INT (inline_parm_levels
, inline_parm_levels_used
) = levels
;
392 ++inline_parm_levels_used
;
395 /* Undo the effects of begin_member_template_processing. */
398 maybe_end_member_template_processing ()
402 if (!inline_parm_levels_used
)
405 --inline_parm_levels_used
;
407 i
< VARRAY_INT (inline_parm_levels
, inline_parm_levels_used
);
410 --processing_template_decl
;
411 current_template_parms
= TREE_CHAIN (current_template_parms
);
416 /* Returns non-zero iff T is a member template function. We must be
419 template <class T> class C { void f(); }
421 Here, f is a template function, and a member, but not a member
422 template. This function does not concern itself with the origin of
423 T, only its present state. So if we have
425 template <class T> class C { template <class U> void f(U); }
427 then neither C<int>::f<char> nor C<T>::f<double> is considered
428 to be a member template. But, `template <class U> void
429 C<int>::f(U)' is considered a member template. */
432 is_member_template (t
)
435 if (!DECL_FUNCTION_TEMPLATE_P (t
))
436 /* Anything that isn't a function or a template function is
437 certainly not a member template. */
440 /* A local class can't have member templates. */
441 if (decl_function_context (t
))
444 return (DECL_FUNCTION_MEMBER_P (DECL_TEMPLATE_RESULT (t
))
445 /* If there are more levels of template parameters than
446 there are template classes surrounding the declaration,
447 then we have a member template. */
448 && (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (t
)) >
449 template_class_depth (DECL_CONTEXT (t
))));
453 /* Returns non-zero iff T is a member template class. See
454 is_member_template for a description of what precisely constitutes
455 a member template. */
458 is_member_template_class (t
)
461 if (!DECL_CLASS_TEMPLATE_P (t
))
462 /* Anything that isn't a class template, is certainly not a member
466 if (!DECL_CLASS_SCOPE_P (t
))
467 /* Anything whose context isn't a class type is surely not a
471 /* If there are more levels of template parameters than there are
472 template classes surrounding the declaration, then we have a
474 return (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (t
)) >
475 template_class_depth (DECL_CONTEXT (t
)));
479 /* Return a new template argument vector which contains all of ARGS,
480 but has as its innermost set of arguments the EXTRA_ARGS. */
483 add_to_template_args (args
, extra_args
)
492 extra_depth
= TMPL_ARGS_DEPTH (extra_args
);
493 new_args
= make_tree_vec (TMPL_ARGS_DEPTH (args
) + extra_depth
);
495 for (i
= 1; i
<= TMPL_ARGS_DEPTH (args
); ++i
)
496 SET_TMPL_ARGS_LEVEL (new_args
, i
, TMPL_ARGS_LEVEL (args
, i
));
498 for (j
= 1; j
<= extra_depth
; ++j
, ++i
)
499 SET_TMPL_ARGS_LEVEL (new_args
, i
, TMPL_ARGS_LEVEL (extra_args
, j
));
504 /* Like add_to_template_args, but only the outermost ARGS are added to
505 the EXTRA_ARGS. In particular, all but TMPL_ARGS_DEPTH
506 (EXTRA_ARGS) levels are added. This function is used to combine
507 the template arguments from a partial instantiation with the
508 template arguments used to attain the full instantiation from the
509 partial instantiation. */
512 add_outermost_template_args (args
, extra_args
)
518 /* If there are more levels of EXTRA_ARGS than there are ARGS,
519 something very fishy is going on. */
520 my_friendly_assert (TMPL_ARGS_DEPTH (args
) >= TMPL_ARGS_DEPTH (extra_args
),
523 /* If *all* the new arguments will be the EXTRA_ARGS, just return
525 if (TMPL_ARGS_DEPTH (args
) == TMPL_ARGS_DEPTH (extra_args
))
528 /* For the moment, we make ARGS look like it contains fewer levels. */
529 TREE_VEC_LENGTH (args
) -= TMPL_ARGS_DEPTH (extra_args
);
531 new_args
= add_to_template_args (args
, extra_args
);
533 /* Now, we restore ARGS to its full dimensions. */
534 TREE_VEC_LENGTH (args
) += TMPL_ARGS_DEPTH (extra_args
);
539 /* Return the N levels of innermost template arguments from the ARGS. */
542 get_innermost_template_args (args
, n
)
550 my_friendly_assert (n
>= 0, 20000603);
552 /* If N is 1, just return the innermost set of template arguments. */
554 return TMPL_ARGS_LEVEL (args
, TMPL_ARGS_DEPTH (args
));
556 /* If we're not removing anything, just return the arguments we were
558 extra_levels
= TMPL_ARGS_DEPTH (args
) - n
;
559 my_friendly_assert (extra_levels
>= 0, 20000603);
560 if (extra_levels
== 0)
563 /* Make a new set of arguments, not containing the outer arguments. */
564 new_args
= make_tree_vec (n
);
565 for (i
= 1; i
<= n
; ++i
)
566 SET_TMPL_ARGS_LEVEL (new_args
, i
,
567 TMPL_ARGS_LEVEL (args
, i
+ extra_levels
));
572 /* We've got a template header coming up; push to a new level for storing
576 begin_template_parm_list ()
578 /* We use a non-tag-transparent scope here, which causes pushtag to
579 put tags in this scope, rather than in the enclosing class or
580 namespace scope. This is the right thing, since we want
581 TEMPLATE_DECLS, and not TYPE_DECLS for template classes. For a
582 global template class, push_template_decl handles putting the
583 TEMPLATE_DECL into top-level scope. For a nested template class,
586 template <class T> struct S1 {
587 template <class T> struct S2 {};
590 pushtag contains special code to call pushdecl_with_scope on the
591 TEMPLATE_DECL for S2. */
592 begin_scope (sk_template_parms
);
593 ++processing_template_decl
;
594 ++processing_template_parmlist
;
595 note_template_header (0);
598 /* This routine is called when a specialization is declared. If it is
599 illegal to declare a specialization here, an error is reported. */
602 check_specialization_scope ()
604 tree scope
= current_scope ();
608 An explicit specialization shall be declared in the namespace of
609 which the template is a member, or, for member templates, in the
610 namespace of which the enclosing class or enclosing class
611 template is a member. An explicit specialization of a member
612 function, member class or static data member of a class template
613 shall be declared in the namespace of which the class template
615 if (scope
&& TREE_CODE (scope
) != NAMESPACE_DECL
)
616 cp_error ("explicit specialization in non-namespace scope `%D'",
621 In an explicit specialization declaration for a member of a class
622 template or a member template that appears in namespace scope,
623 the member template and some of its enclosing class templates may
624 remain unspecialized, except that the declaration shall not
625 explicitly specialize a class member template if its enclosing
626 class templates are not explicitly specialized as well. */
627 if (current_template_parms
)
628 cp_error ("enclosing class templates are not explicitly specialized");
631 /* We've just seen template <>. */
634 begin_specialization ()
636 begin_scope (sk_template_spec
);
637 note_template_header (1);
638 check_specialization_scope ();
641 /* Called at then end of processing a declaration preceeded by
645 end_specialization ()
648 reset_specialization ();
651 /* Any template <>'s that we have seen thus far are not referring to a
652 function specialization. */
655 reset_specialization ()
657 processing_specialization
= 0;
658 template_header_count
= 0;
661 /* We've just seen a template header. If SPECIALIZATION is non-zero,
662 it was of the form template <>. */
665 note_template_header (specialization
)
668 processing_specialization
= specialization
;
669 template_header_count
++;
672 /* We're beginning an explicit instantiation. */
675 begin_explicit_instantiation ()
677 ++processing_explicit_instantiation
;
682 end_explicit_instantiation ()
684 my_friendly_assert(processing_explicit_instantiation
> 0, 0);
685 --processing_explicit_instantiation
;
688 /* The TYPE is being declared. If it is a template type, that means it
689 is a partial specialization. Do appropriate error-checking. */
692 maybe_process_partial_specialization (type
)
695 if (IS_AGGR_TYPE (type
) && CLASSTYPE_USE_TEMPLATE (type
))
697 if (CLASSTYPE_IMPLICIT_INSTANTIATION (type
)
698 && !COMPLETE_TYPE_P (type
))
700 if (current_namespace
701 != decl_namespace_context (CLASSTYPE_TI_TEMPLATE (type
)))
703 cp_pedwarn ("specializing `%#T' in different namespace", type
);
704 cp_pedwarn_at (" from definition of `%#D'",
705 CLASSTYPE_TI_TEMPLATE (type
));
707 SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (type
);
708 if (processing_template_decl
)
709 push_template_decl (TYPE_MAIN_DECL (type
));
711 else if (CLASSTYPE_TEMPLATE_INSTANTIATION (type
))
712 cp_error ("specialization of `%T' after instantiation", type
);
714 else if (processing_specialization
)
715 cp_error ("explicit specialization of non-template `%T'", type
);
718 /* Retrieve the specialization (in the sense of [temp.spec] - a
719 specialization is either an instantiation or an explicit
720 specialization) of TMPL for the given template ARGS. If there is
721 no such specialization, return NULL_TREE. The ARGS are a vector of
722 arguments, or a vector of vectors of arguments, in the case of
723 templates with more than one level of parameters. */
726 retrieve_specialization (tmpl
, args
)
732 my_friendly_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
, 0);
734 /* There should be as many levels of arguments as there are
735 levels of parameters. */
736 my_friendly_assert (TMPL_ARGS_DEPTH (args
)
737 == TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
)),
740 for (s
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
743 if (comp_template_args (TREE_PURPOSE (s
), args
))
744 return TREE_VALUE (s
);
749 /* Like retrieve_speciailization, but for local declarations. */
752 retrieve_local_specialization (tmpl
)
755 return (tree
) htab_find (local_specializations
, tmpl
);
758 /* Returns non-zero iff DECL is a specialization of TMPL. */
761 is_specialization_of (decl
, tmpl
)
767 if (TREE_CODE (decl
) == FUNCTION_DECL
)
771 t
= DECL_TEMPLATE_INFO (t
) ? DECL_TI_TEMPLATE (t
) : NULL_TREE
)
777 my_friendly_assert (TREE_CODE (decl
) == TYPE_DECL
, 0);
779 for (t
= TREE_TYPE (decl
);
781 t
= CLASSTYPE_USE_TEMPLATE (t
)
782 ? TREE_TYPE (CLASSTYPE_TI_TEMPLATE (t
)) : NULL_TREE
)
783 if (same_type_ignoring_top_level_qualifiers_p (t
, TREE_TYPE (tmpl
)))
790 /* Register the specialization SPEC as a specialization of TMPL with
791 the indicated ARGS. Returns SPEC, or an equivalent prior
792 declaration, if available. */
795 register_specialization (spec
, tmpl
, args
)
802 my_friendly_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
, 0);
804 if (TREE_CODE (spec
) == FUNCTION_DECL
805 && uses_template_parms (DECL_TI_ARGS (spec
)))
806 /* This is the FUNCTION_DECL for a partial instantiation. Don't
807 register it; we want the corresponding TEMPLATE_DECL instead.
808 We use `uses_template_parms (DECL_TI_ARGS (spec))' rather than
809 the more obvious `uses_template_parms (spec)' to avoid problems
810 with default function arguments. In particular, given
813 template <class T> void f(T t1, T t = T())
815 the default argument expression is not substituted for in an
816 instantiation unless and until it is actually needed. */
819 /* There should be as many levels of arguments as there are
820 levels of parameters. */
821 my_friendly_assert (TMPL_ARGS_DEPTH (args
)
822 == TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
)),
825 for (s
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
829 tree fn
= TREE_VALUE (s
);
831 /* We can sometimes try to re-register a specialization that we've
832 already got. In particular, regenerate_decl_from_template
833 calls duplicate_decls which will update the specialization
834 list. But, we'll still get called again here anyhow. It's
835 more convenient to simply allow this than to try to prevent it. */
838 else if (comp_template_args (TREE_PURPOSE (s
), args
))
840 if (DECL_TEMPLATE_SPECIALIZATION (spec
))
842 if (DECL_TEMPLATE_INSTANTIATION (fn
))
845 || DECL_EXPLICIT_INSTANTIATION (fn
))
847 cp_error ("specialization of %D after instantiation",
853 /* This situation should occur only if the first
854 specialization is an implicit instantiation,
855 the second is an explicit specialization, and
856 the implicit instantiation has not yet been
857 used. That situation can occur if we have
858 implicitly instantiated a member function and
859 then specialized it later.
861 We can also wind up here if a friend
862 declaration that looked like an instantiation
863 turns out to be a specialization:
865 template <class T> void foo(T);
866 class S { friend void foo<>(int) };
867 template <> void foo(int);
869 We transform the existing DECL in place so that
870 any pointers to it become pointers to the
873 If there was a definition for the template, but
874 not for the specialization, we want this to
875 look as if there is no definition, and vice
877 DECL_INITIAL (fn
) = NULL_TREE
;
878 duplicate_decls (spec
, fn
);
883 else if (DECL_TEMPLATE_SPECIALIZATION (fn
))
885 duplicate_decls (spec
, fn
);
892 DECL_TEMPLATE_SPECIALIZATIONS (tmpl
)
893 = tree_cons (args
, spec
, DECL_TEMPLATE_SPECIALIZATIONS (tmpl
));
898 /* Unregister the specialization SPEC as a specialization of TMPL.
899 Returns nonzero if the SPEC was listed as a specialization of
903 unregister_specialization (spec
, tmpl
)
909 for (s
= &DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
911 s
= &TREE_CHAIN (*s
))
912 if (TREE_VALUE (*s
) == spec
)
914 *s
= TREE_CHAIN (*s
);
921 /* Like register_specialization, but for local declarations. We are
922 registering SPEC, an instantiation of TMPL. */
925 register_local_specialization (spec
, tmpl
)
931 slot
= htab_find_slot (local_specializations
, tmpl
, INSERT
);
937 /* Print the list of candidate FNS in an error message. */
940 print_candidates (fns
)
945 const char *str
= "candidates are:";
947 for (fn
= fns
; fn
!= NULL_TREE
; fn
= TREE_CHAIN (fn
))
951 for (f
= TREE_VALUE (fn
); f
; f
= OVL_NEXT (f
))
952 cp_error_at ("%s %+#D", str
, OVL_CURRENT (f
));
957 /* Returns the template (one of the functions given by TEMPLATE_ID)
958 which can be specialized to match the indicated DECL with the
959 explicit template args given in TEMPLATE_ID. The DECL may be
960 NULL_TREE if none is available. In that case, the functions in
961 TEMPLATE_ID are non-members.
963 If NEED_MEMBER_TEMPLATE is non-zero the function is known to be a
964 specialization of a member template.
966 The template args (those explicitly specified and those deduced)
967 are output in a newly created vector *TARGS_OUT.
969 If it is impossible to determine the result, an error message is
970 issued. The error_mark_node is returned to indicate failure. */
973 determine_specialization (template_id
, decl
, targs_out
,
974 need_member_template
)
978 int need_member_template
;
983 tree candidates
= NULL_TREE
;
984 tree templates
= NULL_TREE
;
986 *targs_out
= NULL_TREE
;
988 if (template_id
== error_mark_node
)
989 return error_mark_node
;
991 fns
= TREE_OPERAND (template_id
, 0);
992 explicit_targs
= TREE_OPERAND (template_id
, 1);
994 if (fns
== error_mark_node
)
995 return error_mark_node
;
997 /* Check for baselinks. */
998 if (BASELINK_P (fns
))
999 fns
= TREE_VALUE (fns
);
1001 if (!is_overloaded_fn (fns
))
1003 cp_error ("`%D' is not a function template", fns
);
1004 return error_mark_node
;
1007 for (; fns
; fns
= OVL_NEXT (fns
))
1011 tree fn
= OVL_CURRENT (fns
);
1013 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
1014 /* DECL might be a specialization of FN. */
1016 else if (need_member_template
)
1017 /* FN is an ordinary member function, and we need a
1018 specialization of a member template. */
1020 else if (TREE_CODE (fn
) != FUNCTION_DECL
)
1021 /* We can get IDENTIFIER_NODEs here in certain erroneous
1024 else if (!DECL_FUNCTION_MEMBER_P (fn
))
1025 /* This is just an ordinary non-member function. Nothing can
1026 be a specialization of that. */
1030 tree decl_arg_types
;
1032 /* This is an ordinary member function. However, since
1033 we're here, we can assume it's enclosing class is a
1034 template class. For example,
1036 template <typename T> struct S { void f(); };
1037 template <> void S<int>::f() {}
1039 Here, S<int>::f is a non-template, but S<int> is a
1040 template class. If FN has the same type as DECL, we
1041 might be in business. */
1042 if (!same_type_p (TREE_TYPE (TREE_TYPE (decl
)),
1043 TREE_TYPE (TREE_TYPE (fn
))))
1044 /* The return types differ. */
1047 /* Adjust the type of DECL in case FN is a static member. */
1048 decl_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
1049 if (DECL_STATIC_FUNCTION_P (fn
)
1050 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
1051 decl_arg_types
= TREE_CHAIN (decl_arg_types
);
1053 if (compparms (TYPE_ARG_TYPES (TREE_TYPE (fn
)),
1056 candidates
= tree_cons (NULL_TREE
, fn
, candidates
);
1061 /* See whether this function might be a specialization of this
1063 targs
= get_bindings (tmpl
, decl
, explicit_targs
);
1066 /* We cannot deduce template arguments that when used to
1067 specialize TMPL will produce DECL. */
1070 /* Save this template, and the arguments deduced. */
1071 templates
= tree_cons (targs
, tmpl
, templates
);
1074 if (templates
&& TREE_CHAIN (templates
))
1080 It is possible for a specialization with a given function
1081 signature to be instantiated from more than one function
1082 template. In such cases, explicit specification of the
1083 template arguments must be used to uniquely identify the
1084 function template specialization being specialized.
1086 Note that here, there's no suggestion that we're supposed to
1087 determine which of the candidate templates is most
1088 specialized. However, we, also have:
1092 Partial ordering of overloaded function template
1093 declarations is used in the following contexts to select
1094 the function template to which a function template
1095 specialization refers:
1097 -- when an explicit specialization refers to a function
1100 So, we do use the partial ordering rules, at least for now.
1101 This extension can only serve to make illegal programs legal,
1102 so it's safe. And, there is strong anecdotal evidence that
1103 the committee intended the partial ordering rules to apply;
1104 the EDG front-end has that behavior, and John Spicer claims
1105 that the committee simply forgot to delete the wording in
1106 [temp.expl.spec]. */
1107 tree tmpl
= most_specialized (templates
, decl
, explicit_targs
);
1108 if (tmpl
&& tmpl
!= error_mark_node
)
1110 targs
= get_bindings (tmpl
, decl
, explicit_targs
);
1111 templates
= tree_cons (targs
, tmpl
, NULL_TREE
);
1115 if (templates
== NULL_TREE
&& candidates
== NULL_TREE
)
1117 cp_error_at ("template-id `%D' for `%+D' does not match any template declaration",
1119 return error_mark_node
;
1121 else if ((templates
&& TREE_CHAIN (templates
))
1122 || (candidates
&& TREE_CHAIN (candidates
))
1123 || (templates
&& candidates
))
1125 cp_error_at ("ambiguous template specialization `%D' for `%+D'",
1127 chainon (candidates
, templates
);
1128 print_candidates (candidates
);
1129 return error_mark_node
;
1132 /* We have one, and exactly one, match. */
1135 /* It was a specialization of an ordinary member function in a
1137 *targs_out
= copy_node (DECL_TI_ARGS (TREE_VALUE (candidates
)));
1138 return DECL_TI_TEMPLATE (TREE_VALUE (candidates
));
1141 /* It was a specialization of a template. */
1142 targs
= DECL_TI_ARGS (DECL_TEMPLATE_RESULT (TREE_VALUE (templates
)));
1143 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (targs
))
1145 *targs_out
= copy_node (targs
);
1146 SET_TMPL_ARGS_LEVEL (*targs_out
,
1147 TMPL_ARGS_DEPTH (*targs_out
),
1148 TREE_PURPOSE (templates
));
1151 *targs_out
= TREE_PURPOSE (templates
);
1152 return TREE_VALUE (templates
);
1155 /* Check to see if the function just declared, as indicated in
1156 DECLARATOR, and in DECL, is a specialization of a function
1157 template. We may also discover that the declaration is an explicit
1158 instantiation at this point.
1160 Returns DECL, or an equivalent declaration that should be used
1161 instead if all goes well. Issues an error message if something is
1162 amiss. Returns error_mark_node if the error is not easily
1165 FLAGS is a bitmask consisting of the following flags:
1167 2: The function has a definition.
1168 4: The function is a friend.
1170 The TEMPLATE_COUNT is the number of references to qualifying
1171 template classes that appeared in the name of the function. For
1174 template <class T> struct S { void f(); };
1177 the TEMPLATE_COUNT would be 1. However, explicitly specialized
1178 classes are not counted in the TEMPLATE_COUNT, so that in
1180 template <class T> struct S {};
1181 template <> struct S<int> { void f(); }
1182 template <> void S<int>::f();
1184 the TEMPLATE_COUNT would be 0. (Note that this declaration is
1185 illegal; there should be no template <>.)
1187 If the function is a specialization, it is marked as such via
1188 DECL_TEMPLATE_SPECIALIZATION. Furthermore, its DECL_TEMPLATE_INFO
1189 is set up correctly, and it is added to the list of specializations
1190 for that template. */
1193 check_explicit_specialization (declarator
, decl
, template_count
, flags
)
1199 int have_def
= flags
& 2;
1200 int is_friend
= flags
& 4;
1201 int specialization
= 0;
1202 int explicit_instantiation
= 0;
1203 int member_specialization
= 0;
1204 tree ctype
= DECL_CLASS_CONTEXT (decl
);
1205 tree dname
= DECL_NAME (decl
);
1208 tsk
= current_tmpl_spec_kind (template_count
);
1213 if (processing_specialization
)
1216 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
1218 else if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
1221 /* This could be something like:
1223 template <class T> void f(T);
1224 class S { friend void f<>(int); } */
1228 /* This case handles bogus declarations like template <>
1229 template <class T> void f<int>(); */
1231 cp_error ("template-id `%D' in declaration of primary template",
1238 case tsk_invalid_member_spec
:
1239 /* The error has already been reported in
1240 check_specialization_scope. */
1241 return error_mark_node
;
1243 case tsk_invalid_expl_inst
:
1244 cp_error ("template parameter list used in explicit instantiation");
1250 cp_error ("definition provided for explicit instantiation");
1252 explicit_instantiation
= 1;
1255 case tsk_excessive_parms
:
1256 cp_error ("too many template parameter lists in declaration of `%D'",
1258 return error_mark_node
;
1262 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
1264 member_specialization
= 1;
1269 case tsk_insufficient_parms
:
1270 if (template_header_count
)
1272 cp_error("too few template parameter lists in declaration of `%D'",
1276 else if (ctype
!= NULL_TREE
1277 && !TYPE_BEING_DEFINED (ctype
)
1278 && CLASSTYPE_TEMPLATE_INSTANTIATION (ctype
)
1281 /* For backwards compatibility, we accept:
1283 template <class T> struct S { void f(); };
1284 void S<int>::f() {} // Missing template <>
1286 That used to be legal C++. */
1289 ("explicit specialization not preceded by `template <>'");
1291 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
1296 if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
1298 /* This case handles bogus declarations like template <>
1299 template <class T> void f<int>(); */
1301 if (uses_template_parms (declarator
))
1302 cp_error ("partial specialization `%D' of function template",
1305 cp_error ("template-id `%D' in declaration of primary template",
1310 if (ctype
&& CLASSTYPE_TEMPLATE_INSTANTIATION (ctype
))
1311 /* This is a specialization of a member template, without
1312 specialization the containing class. Something like:
1314 template <class T> struct S {
1315 template <class U> void f (U);
1317 template <> template <class U> void S<int>::f(U) {}
1319 That's a specialization -- but of the entire template. */
1324 my_friendly_abort (20000309);
1327 if (specialization
|| member_specialization
)
1329 tree t
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
1330 for (; t
; t
= TREE_CHAIN (t
))
1331 if (TREE_PURPOSE (t
))
1334 ("default argument specified in explicit specialization");
1337 if (current_lang_name
== lang_name_c
)
1338 cp_error ("template specialization with C linkage");
1341 if (specialization
|| member_specialization
|| explicit_instantiation
)
1343 tree tmpl
= NULL_TREE
;
1344 tree targs
= NULL_TREE
;
1346 /* Make sure that the declarator is a TEMPLATE_ID_EXPR. */
1347 if (TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
1351 my_friendly_assert (TREE_CODE (declarator
) == IDENTIFIER_NODE
,
1354 fns
= IDENTIFIER_NAMESPACE_VALUE (dname
);
1359 lookup_template_function (fns
, NULL_TREE
);
1362 if (declarator
== error_mark_node
)
1363 return error_mark_node
;
1365 if (ctype
!= NULL_TREE
&& TYPE_BEING_DEFINED (ctype
))
1367 if (!explicit_instantiation
)
1368 /* A specialization in class scope. This is illegal,
1369 but the error will already have been flagged by
1370 check_specialization_scope. */
1371 return error_mark_node
;
1374 /* It's not legal to write an explicit instantiation in
1377 class C { template void f(); }
1379 This case is caught by the parser. However, on
1382 template class C { void f(); };
1384 (which is illegal) we can get here. The error will be
1391 else if (TREE_CODE (TREE_OPERAND (declarator
, 0)) == LOOKUP_EXPR
)
1393 /* A friend declaration. We can't do much, because we don't
1394 know what this resolves to, yet. */
1395 my_friendly_assert (is_friend
!= 0, 0);
1396 my_friendly_assert (!explicit_instantiation
, 0);
1397 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
1400 else if (ctype
!= NULL_TREE
1401 && (TREE_CODE (TREE_OPERAND (declarator
, 0)) ==
1404 /* Find the list of functions in ctype that have the same
1405 name as the declared function. */
1406 tree name
= TREE_OPERAND (declarator
, 0);
1407 tree fns
= NULL_TREE
;
1410 if (name
== constructor_name (ctype
)
1411 || name
== constructor_name_full (ctype
))
1413 int is_constructor
= DECL_CONSTRUCTOR_P (decl
);
1415 if (is_constructor
? !TYPE_HAS_CONSTRUCTOR (ctype
)
1416 : !TYPE_HAS_DESTRUCTOR (ctype
))
1418 /* From [temp.expl.spec]:
1420 If such an explicit specialization for the member
1421 of a class template names an implicitly-declared
1422 special member function (clause _special_), the
1423 program is ill-formed.
1425 Similar language is found in [temp.explicit]. */
1426 cp_error ("specialization of implicitly-declared special member function");
1427 return error_mark_node
;
1430 name
= is_constructor
? ctor_identifier
: dtor_identifier
;
1433 if (!DECL_CONV_FN_P (decl
))
1435 idx
= lookup_fnfields_1 (ctype
, name
);
1437 fns
= TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (ctype
), idx
);
1443 /* For a type-conversion operator, we cannot do a
1444 name-based lookup. We might be looking for `operator
1445 int' which will be a specialization of `operator T'.
1446 So, we find *all* the conversion operators, and then
1447 select from them. */
1450 methods
= CLASSTYPE_METHOD_VEC (ctype
);
1452 for (idx
= 2; idx
< TREE_VEC_LENGTH (methods
); ++idx
)
1454 tree ovl
= TREE_VEC_ELT (methods
, idx
);
1456 if (!ovl
|| !DECL_CONV_FN_P (OVL_CURRENT (ovl
)))
1457 /* There are no more conversion functions. */
1460 /* Glue all these conversion functions together
1461 with those we already have. */
1462 for (; ovl
; ovl
= OVL_NEXT (ovl
))
1463 fns
= ovl_cons (OVL_CURRENT (ovl
), fns
);
1467 if (fns
== NULL_TREE
)
1469 cp_error ("no member function `%D' declared in `%T'",
1471 return error_mark_node
;
1474 TREE_OPERAND (declarator
, 0) = fns
;
1477 /* Figure out what exactly is being specialized at this point.
1478 Note that for an explicit instantiation, even one for a
1479 member function, we cannot tell apriori whether the
1480 instantiation is for a member template, or just a member
1481 function of a template class. Even if a member template is
1482 being instantiated, the member template arguments may be
1483 elided if they can be deduced from the rest of the
1485 tmpl
= determine_specialization (declarator
, decl
,
1487 member_specialization
);
1489 if (!tmpl
|| tmpl
== error_mark_node
)
1490 /* We couldn't figure out what this declaration was
1492 return error_mark_node
;
1495 tree gen_tmpl
= most_general_template (tmpl
);
1497 if (explicit_instantiation
)
1499 /* We don't set DECL_EXPLICIT_INSTANTIATION here; that
1500 is done by do_decl_instantiation later. */
1502 int arg_depth
= TMPL_ARGS_DEPTH (targs
);
1503 int parm_depth
= TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
));
1505 if (arg_depth
> parm_depth
)
1507 /* If TMPL is not the most general template (for
1508 example, if TMPL is a friend template that is
1509 injected into namespace scope), then there will
1510 be too many levels fo TARGS. Remove some of them
1515 new_targs
= make_tree_vec (parm_depth
);
1516 for (i
= arg_depth
- parm_depth
; i
< arg_depth
; ++i
)
1517 TREE_VEC_ELT (new_targs
, i
- (arg_depth
- parm_depth
))
1518 = TREE_VEC_ELT (targs
, i
);
1522 return instantiate_template (tmpl
, targs
);
1525 /* If this is a specialization of a member template of a
1526 template class. In we want to return the TEMPLATE_DECL,
1527 not the specialization of it. */
1528 if (tsk
== tsk_template
)
1530 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
1531 DECL_INITIAL (DECL_TEMPLATE_RESULT (tmpl
)) = NULL_TREE
;
1535 /* If we though that the DECL was a member function, but it
1536 turns out to be specializing a static member function,
1537 make DECL a static member function as well. */
1538 if (DECL_STATIC_FUNCTION_P (tmpl
)
1539 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
1541 revert_static_member_fn (decl
);
1542 last_function_parms
= TREE_CHAIN (last_function_parms
);
1545 /* Set up the DECL_TEMPLATE_INFO for DECL. */
1546 DECL_TEMPLATE_INFO (decl
) = tree_cons (tmpl
, targs
, NULL_TREE
);
1548 /* Mangle the function name appropriately. Note that we do
1549 not mangle specializations of non-template member
1550 functions of template classes, e.g. with
1552 template <class T> struct S { void f(); }
1554 and given the specialization
1556 template <> void S<int>::f() {}
1558 we do not mangle S<int>::f() here. That's because it's
1559 just an ordinary member function and doesn't need special
1560 treatment. We do this here so that the ordinary,
1561 non-template, name-mangling algorithm will not be used
1563 if ((is_member_template (tmpl
) || ctype
== NULL_TREE
)
1564 && name_mangling_version
>= 1)
1565 set_mangled_name_for_template_decl (decl
);
1567 if (is_friend
&& !have_def
)
1568 /* This is not really a declaration of a specialization.
1569 It's just the name of an instantiation. But, it's not
1570 a request for an instantiation, either. */
1571 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
1573 /* Register this specialization so that we can find it
1575 decl
= register_specialization (decl
, gen_tmpl
, targs
);
1582 /* TYPE is being declared. Verify that the use of template headers
1583 and such is reasonable. Issue error messages if not. */
1586 maybe_check_template_type (type
)
1589 if (template_header_count
)
1591 /* We are in the scope of some `template <...>' header. */
1594 = template_class_depth_real (TYPE_CONTEXT (type
),
1595 /*count_specializations=*/1);
1597 if (template_header_count
<= context_depth
)
1598 /* This is OK; the template headers are for the context. We
1599 are actually too lenient here; like
1600 check_explicit_specialization we should consider the number
1601 of template types included in the actual declaration. For
1604 template <class T> struct S {
1605 template <class U> template <class V>
1611 template <class T> struct S {
1612 template <class U> struct I;
1615 template <class T> template <class U.
1620 else if (template_header_count
> context_depth
+ 1)
1621 /* There are two many template parameter lists. */
1622 cp_error ("too many template parameter lists in declaration of `%T'", type
);
1626 /* Returns 1 iff PARMS1 and PARMS2 are identical sets of template
1627 parameters. These are represented in the same format used for
1628 DECL_TEMPLATE_PARMS. */
1630 int comp_template_parms (parms1
, parms2
)
1637 if (parms1
== parms2
)
1640 for (p1
= parms1
, p2
= parms2
;
1641 p1
!= NULL_TREE
&& p2
!= NULL_TREE
;
1642 p1
= TREE_CHAIN (p1
), p2
= TREE_CHAIN (p2
))
1644 tree t1
= TREE_VALUE (p1
);
1645 tree t2
= TREE_VALUE (p2
);
1648 my_friendly_assert (TREE_CODE (t1
) == TREE_VEC
, 0);
1649 my_friendly_assert (TREE_CODE (t2
) == TREE_VEC
, 0);
1651 if (TREE_VEC_LENGTH (t1
) != TREE_VEC_LENGTH (t2
))
1654 for (i
= 0; i
< TREE_VEC_LENGTH (t2
); ++i
)
1656 tree parm1
= TREE_VALUE (TREE_VEC_ELT (t1
, i
));
1657 tree parm2
= TREE_VALUE (TREE_VEC_ELT (t2
, i
));
1659 if (TREE_CODE (parm1
) != TREE_CODE (parm2
))
1662 if (TREE_CODE (parm1
) == TEMPLATE_TYPE_PARM
)
1664 else if (!same_type_p (TREE_TYPE (parm1
), TREE_TYPE (parm2
)))
1669 if ((p1
!= NULL_TREE
) != (p2
!= NULL_TREE
))
1670 /* One set of parameters has more parameters lists than the
1677 /* Complain if DECL shadows a template parameter.
1679 [temp.local]: A template-parameter shall not be redeclared within its
1680 scope (including nested scopes). */
1683 check_template_shadow (decl
)
1688 /* If we're not in a template, we can't possibly shadow a template
1690 if (!current_template_parms
)
1693 /* Figure out what we're shadowing. */
1694 if (TREE_CODE (decl
) == OVERLOAD
)
1695 decl
= OVL_CURRENT (decl
);
1696 olddecl
= IDENTIFIER_VALUE (DECL_NAME (decl
));
1698 /* If there's no previous binding for this name, we're not shadowing
1699 anything, let alone a template parameter. */
1703 /* If we're not shadowing a template parameter, we're done. Note
1704 that OLDDECL might be an OVERLOAD (or perhaps even an
1705 ERROR_MARK), so we can't just blithely assume it to be a _DECL
1707 if (!DECL_P (olddecl
) || !DECL_TEMPLATE_PARM_P (olddecl
))
1710 /* We check for decl != olddecl to avoid bogus errors for using a
1711 name inside a class. We check TPFI to avoid duplicate errors for
1712 inline member templates. */
1714 || TEMPLATE_PARMS_FOR_INLINE (current_template_parms
))
1717 cp_error_at ("declaration of `%#D'", decl
);
1718 cp_error_at (" shadows template parm `%#D'", olddecl
);
1721 /* Return a new TEMPLATE_PARM_INDEX with the indicated INDEX, LEVEL,
1722 ORIG_LEVEL, DECL, and TYPE. */
1725 build_template_parm_index (index
, level
, orig_level
, decl
, type
)
1732 tree t
= make_node (TEMPLATE_PARM_INDEX
);
1733 TEMPLATE_PARM_IDX (t
) = index
;
1734 TEMPLATE_PARM_LEVEL (t
) = level
;
1735 TEMPLATE_PARM_ORIG_LEVEL (t
) = orig_level
;
1736 TEMPLATE_PARM_DECL (t
) = decl
;
1737 TREE_TYPE (t
) = type
;
1742 /* Return a TEMPLATE_PARM_INDEX, similar to INDEX, but whose
1743 TEMPLATE_PARM_LEVEL has been decreased by LEVELS. If such a
1744 TEMPLATE_PARM_INDEX already exists, it is returned; otherwise, a
1745 new one is created. */
1748 reduce_template_parm_level (index
, type
, levels
)
1753 if (TEMPLATE_PARM_DESCENDANTS (index
) == NULL_TREE
1754 || (TEMPLATE_PARM_LEVEL (TEMPLATE_PARM_DESCENDANTS (index
))
1755 != TEMPLATE_PARM_LEVEL (index
) - levels
))
1758 = build_decl (TREE_CODE (TEMPLATE_PARM_DECL (index
)),
1759 DECL_NAME (TEMPLATE_PARM_DECL (index
)),
1762 = build_template_parm_index (TEMPLATE_PARM_IDX (index
),
1763 TEMPLATE_PARM_LEVEL (index
) - levels
,
1764 TEMPLATE_PARM_ORIG_LEVEL (index
),
1766 TEMPLATE_PARM_DESCENDANTS (index
) = t
;
1768 /* Template template parameters need this. */
1769 DECL_TEMPLATE_PARMS (decl
)
1770 = DECL_TEMPLATE_PARMS (TEMPLATE_PARM_DECL (index
));
1773 return TEMPLATE_PARM_DESCENDANTS (index
);
1776 /* Process information from new template parameter NEXT and append it to the
1777 LIST being built. */
1780 process_template_parm (list
, next
)
1789 my_friendly_assert (TREE_CODE (parm
) == TREE_LIST
, 259);
1790 defval
= TREE_PURPOSE (parm
);
1791 parm
= TREE_VALUE (parm
);
1792 is_type
= TREE_PURPOSE (parm
) == class_type_node
;
1796 tree p
= TREE_VALUE (tree_last (list
));
1798 if (TREE_CODE (p
) == TYPE_DECL
|| TREE_CODE (p
) == TEMPLATE_DECL
)
1799 idx
= TEMPLATE_TYPE_IDX (TREE_TYPE (p
));
1801 idx
= TEMPLATE_PARM_IDX (DECL_INITIAL (p
));
1809 my_friendly_assert (TREE_CODE (TREE_PURPOSE (parm
)) == TREE_LIST
, 260);
1810 /* is a const-param */
1811 parm
= grokdeclarator (TREE_VALUE (parm
), TREE_PURPOSE (parm
),
1812 PARM
, 0, NULL_TREE
);
1816 The top-level cv-qualifiers on the template-parameter are
1817 ignored when determining its type. */
1818 TREE_TYPE (parm
) = TYPE_MAIN_VARIANT (TREE_TYPE (parm
));
1820 /* A template parameter is not modifiable. */
1821 TREE_READONLY (parm
) = 1;
1822 if (IS_AGGR_TYPE (TREE_TYPE (parm
))
1823 && TREE_CODE (TREE_TYPE (parm
)) != TEMPLATE_TYPE_PARM
1824 && TREE_CODE (TREE_TYPE (parm
)) != TYPENAME_TYPE
)
1826 cp_error ("`%#T' is not a valid type for a template constant parameter",
1828 if (DECL_NAME (parm
) == NULL_TREE
)
1829 error (" a template type parameter must begin with `class' or `typename'");
1830 TREE_TYPE (parm
) = void_type_node
;
1833 && (TREE_CODE (TREE_TYPE (parm
)) == REAL_TYPE
1834 || TREE_CODE (TREE_TYPE (parm
)) == COMPLEX_TYPE
))
1835 cp_pedwarn ("`%T' is not a valid type for a template constant parameter",
1837 decl
= build_decl (CONST_DECL
, DECL_NAME (parm
), TREE_TYPE (parm
));
1838 DECL_INITIAL (parm
) = DECL_INITIAL (decl
)
1839 = build_template_parm_index (idx
, processing_template_decl
,
1840 processing_template_decl
,
1841 decl
, TREE_TYPE (parm
));
1846 parm
= TREE_VALUE (parm
);
1848 if (parm
&& TREE_CODE (parm
) == TEMPLATE_DECL
)
1850 t
= make_aggr_type (TEMPLATE_TEMPLATE_PARM
);
1851 /* This is for distinguishing between real templates and template
1852 template parameters */
1853 TREE_TYPE (parm
) = t
;
1854 TREE_TYPE (DECL_TEMPLATE_RESULT (parm
)) = t
;
1859 t
= make_aggr_type (TEMPLATE_TYPE_PARM
);
1860 /* parm is either IDENTIFIER_NODE or NULL_TREE */
1861 decl
= build_decl (TYPE_DECL
, parm
, t
);
1864 TYPE_NAME (t
) = decl
;
1865 TYPE_STUB_DECL (t
) = decl
;
1867 TEMPLATE_TYPE_PARM_INDEX (t
)
1868 = build_template_parm_index (idx
, processing_template_decl
,
1869 processing_template_decl
,
1870 decl
, TREE_TYPE (parm
));
1872 DECL_ARTIFICIAL (decl
) = 1;
1873 SET_DECL_TEMPLATE_PARM_P (decl
);
1875 parm
= build_tree_list (defval
, parm
);
1876 return chainon (list
, parm
);
1879 /* The end of a template parameter list has been reached. Process the
1880 tree list into a parameter vector, converting each parameter into a more
1881 useful form. Type parameters are saved as IDENTIFIER_NODEs, and others
1885 end_template_parm_list (parms
)
1890 tree saved_parmlist
= make_tree_vec (list_length (parms
));
1892 current_template_parms
1893 = tree_cons (build_int_2 (0, processing_template_decl
),
1894 saved_parmlist
, current_template_parms
);
1896 for (parm
= parms
, nparms
= 0;
1898 parm
= TREE_CHAIN (parm
), nparms
++)
1899 TREE_VEC_ELT (saved_parmlist
, nparms
) = parm
;
1901 --processing_template_parmlist
;
1903 return saved_parmlist
;
1906 /* end_template_decl is called after a template declaration is seen. */
1909 end_template_decl ()
1911 reset_specialization ();
1913 if (! processing_template_decl
)
1916 /* This matches the pushlevel in begin_template_parm_list. */
1919 --processing_template_decl
;
1920 current_template_parms
= TREE_CHAIN (current_template_parms
);
1923 /* Given a template argument vector containing the template PARMS.
1924 The innermost PARMS are given first. */
1927 current_template_args ()
1930 tree args
= NULL_TREE
;
1931 int length
= TMPL_PARMS_DEPTH (current_template_parms
);
1934 /* If there is only one level of template parameters, we do not
1935 create a TREE_VEC of TREE_VECs. Instead, we return a single
1936 TREE_VEC containing the arguments. */
1938 args
= make_tree_vec (length
);
1940 for (header
= current_template_parms
; header
; header
= TREE_CHAIN (header
))
1942 tree a
= copy_node (TREE_VALUE (header
));
1945 TREE_TYPE (a
) = NULL_TREE
;
1946 for (i
= TREE_VEC_LENGTH (a
) - 1; i
>= 0; --i
)
1948 tree t
= TREE_VEC_ELT (a
, i
);
1950 /* T will be a list if we are called from within a
1951 begin/end_template_parm_list pair, but a vector directly
1952 if within a begin/end_member_template_processing pair. */
1953 if (TREE_CODE (t
) == TREE_LIST
)
1957 if (TREE_CODE (t
) == TYPE_DECL
1958 || TREE_CODE (t
) == TEMPLATE_DECL
)
1961 t
= DECL_INITIAL (t
);
1962 TREE_VEC_ELT (a
, i
) = t
;
1967 TREE_VEC_ELT (args
, --l
) = a
;
1975 /* Return a TEMPLATE_DECL corresponding to DECL, using the indicated
1976 template PARMS. Used by push_template_decl below. */
1979 build_template_decl (decl
, parms
)
1983 tree tmpl
= build_lang_decl (TEMPLATE_DECL
, DECL_NAME (decl
), NULL_TREE
);
1984 DECL_TEMPLATE_PARMS (tmpl
) = parms
;
1985 DECL_CONTEXT (tmpl
) = DECL_CONTEXT (decl
);
1986 if (DECL_LANG_SPECIFIC (decl
))
1988 if (CAN_HAVE_FULL_LANG_DECL_P (decl
))
1989 DECL_VIRTUAL_CONTEXT (tmpl
) = DECL_VIRTUAL_CONTEXT (decl
);
1990 DECL_STATIC_FUNCTION_P (tmpl
) = DECL_STATIC_FUNCTION_P (decl
);
1991 DECL_CONSTRUCTOR_P (tmpl
) = DECL_CONSTRUCTOR_P (decl
);
1992 DECL_NONCONVERTING_P (tmpl
) = DECL_NONCONVERTING_P (decl
);
1993 DECL_ASSIGNMENT_OPERATOR_P (tmpl
) = DECL_ASSIGNMENT_OPERATOR_P (decl
);
1994 if (DECL_OVERLOADED_OPERATOR_P (decl
))
1995 SET_OVERLOADED_OPERATOR_CODE (tmpl
,
1996 DECL_OVERLOADED_OPERATOR_P (decl
));
2002 struct template_parm_data
2004 /* The level of the template parameters we are currently
2008 /* The index of the specialization argument we are currently
2012 /* An array whose size is the number of template parameters. The
2013 elements are non-zero if the parameter has been used in any one
2014 of the arguments processed so far. */
2017 /* An array whose size is the number of template arguments. The
2018 elements are non-zero if the argument makes use of template
2019 parameters of this level. */
2020 int* arg_uses_template_parms
;
2023 /* Subroutine of push_template_decl used to see if each template
2024 parameter in a partial specialization is used in the explicit
2025 argument list. If T is of the LEVEL given in DATA (which is
2026 treated as a template_parm_data*), then DATA->PARMS is marked
2030 mark_template_parm (t
, data
)
2036 struct template_parm_data
* tpd
= (struct template_parm_data
*) data
;
2038 if (TREE_CODE (t
) == TEMPLATE_PARM_INDEX
)
2040 level
= TEMPLATE_PARM_LEVEL (t
);
2041 idx
= TEMPLATE_PARM_IDX (t
);
2045 level
= TEMPLATE_TYPE_LEVEL (t
);
2046 idx
= TEMPLATE_TYPE_IDX (t
);
2049 if (level
== tpd
->level
)
2051 tpd
->parms
[idx
] = 1;
2052 tpd
->arg_uses_template_parms
[tpd
->current_arg
] = 1;
2055 /* Return zero so that for_each_template_parm will continue the
2056 traversal of the tree; we want to mark *every* template parm. */
2060 /* Process the partial specialization DECL. */
2063 process_partial_specialization (decl
)
2066 tree type
= TREE_TYPE (decl
);
2067 tree maintmpl
= CLASSTYPE_TI_TEMPLATE (type
);
2068 tree specargs
= CLASSTYPE_TI_ARGS (type
);
2069 tree inner_args
= INNERMOST_TEMPLATE_ARGS (specargs
);
2070 tree inner_parms
= INNERMOST_TEMPLATE_PARMS (current_template_parms
);
2071 tree main_inner_parms
= DECL_INNERMOST_TEMPLATE_PARMS (maintmpl
);
2072 int nargs
= TREE_VEC_LENGTH (inner_args
);
2073 int ntparms
= TREE_VEC_LENGTH (inner_parms
);
2075 int did_error_intro
= 0;
2076 struct template_parm_data tpd
;
2077 struct template_parm_data tpd2
;
2079 /* We check that each of the template parameters given in the
2080 partial specialization is used in the argument list to the
2081 specialization. For example:
2083 template <class T> struct S;
2084 template <class T> struct S<T*>;
2086 The second declaration is OK because `T*' uses the template
2087 parameter T, whereas
2089 template <class T> struct S<int>;
2091 is no good. Even trickier is:
2102 The S2<T> declaration is actually illegal; it is a
2103 full-specialization. Of course,
2106 struct S2<T (*)(U)>;
2108 or some such would have been OK. */
2109 tpd
.level
= TMPL_PARMS_DEPTH (current_template_parms
);
2110 tpd
.parms
= alloca (sizeof (int) * ntparms
);
2111 memset ((PTR
) tpd
.parms
, 0, sizeof (int) * ntparms
);
2113 tpd
.arg_uses_template_parms
= alloca (sizeof (int) * nargs
);
2114 memset ((PTR
) tpd
.arg_uses_template_parms
, 0, sizeof (int) * nargs
);
2115 for (i
= 0; i
< nargs
; ++i
)
2117 tpd
.current_arg
= i
;
2118 for_each_template_parm (TREE_VEC_ELT (inner_args
, i
),
2119 &mark_template_parm
,
2122 for (i
= 0; i
< ntparms
; ++i
)
2123 if (tpd
.parms
[i
] == 0)
2125 /* One of the template parms was not used in the
2127 if (!did_error_intro
)
2129 cp_error ("template parameters not used in partial specialization:");
2130 did_error_intro
= 1;
2134 TREE_VALUE (TREE_VEC_ELT (inner_parms
, i
)));
2137 /* [temp.class.spec]
2139 The argument list of the specialization shall not be identical to
2140 the implicit argument list of the primary template. */
2141 if (comp_template_args
2143 INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE
2145 cp_error ("partial specialization `%T' does not specialize any template arguments", type
);
2147 /* [temp.class.spec]
2149 A partially specialized non-type argument expression shall not
2150 involve template parameters of the partial specialization except
2151 when the argument expression is a simple identifier.
2153 The type of a template parameter corresponding to a specialized
2154 non-type argument shall not be dependent on a parameter of the
2156 my_friendly_assert (nargs
== DECL_NTPARMS (maintmpl
), 0);
2158 for (i
= 0; i
< nargs
; ++i
)
2160 tree arg
= TREE_VEC_ELT (inner_args
, i
);
2161 if (/* These first two lines are the `non-type' bit. */
2163 && TREE_CODE (arg
) != TEMPLATE_DECL
2164 /* This next line is the `argument expression is not just a
2165 simple identifier' condition and also the `specialized
2166 non-type argument' bit. */
2167 && TREE_CODE (arg
) != TEMPLATE_PARM_INDEX
)
2169 if (tpd
.arg_uses_template_parms
[i
])
2170 cp_error ("template argument `%E' involves template parameter(s)", arg
);
2173 /* Look at the corresponding template parameter,
2174 marking which template parameters its type depends
2177 TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (main_inner_parms
,
2182 /* We haven't yet initialized TPD2. Do so now. */
2183 tpd2
.arg_uses_template_parms
2184 = (int*) alloca (sizeof (int) * nargs
);
2185 /* The number of parameters here is the number in the
2186 main template, which, as checked in the assertion
2188 tpd2
.parms
= (int*) alloca (sizeof (int) * nargs
);
2190 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (maintmpl
));
2193 /* Mark the template parameters. But this time, we're
2194 looking for the template parameters of the main
2195 template, not in the specialization. */
2196 tpd2
.current_arg
= i
;
2197 tpd2
.arg_uses_template_parms
[i
] = 0;
2198 memset ((PTR
) tpd2
.parms
, 0, sizeof (int) * nargs
);
2199 for_each_template_parm (type
,
2200 &mark_template_parm
,
2203 if (tpd2
.arg_uses_template_parms
[i
])
2205 /* The type depended on some template parameters.
2206 If they are fully specialized in the
2207 specialization, that's OK. */
2209 for (j
= 0; j
< nargs
; ++j
)
2210 if (tpd2
.parms
[j
] != 0
2211 && tpd
.arg_uses_template_parms
[j
])
2213 cp_error ("type `%T' of template argument `%E' depends on template parameter(s)",
2223 if (retrieve_specialization (maintmpl
, specargs
))
2224 /* We've already got this specialization. */
2227 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)
2228 = tree_cons (inner_args
, inner_parms
,
2229 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
));
2230 TREE_TYPE (DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)) = type
;
2234 /* Check that a template declaration's use of default arguments is not
2235 invalid. Here, PARMS are the template parameters. IS_PRIMARY is
2236 non-zero if DECL is the thing declared by a primary template.
2237 IS_PARTIAL is non-zero if DECL is a partial specialization. */
2240 check_default_tmpl_args (decl
, parms
, is_primary
, is_partial
)
2247 int last_level_to_check
;
2252 A default template-argument shall not be specified in a
2253 function template declaration or a function template definition, nor
2254 in the template-parameter-list of the definition of a member of a
2257 if (TREE_CODE (CP_DECL_CONTEXT (decl
)) == FUNCTION_DECL
)
2258 /* You can't have a function template declaration in a local
2259 scope, nor you can you define a member of a class template in a
2263 if (current_class_type
2264 && !TYPE_BEING_DEFINED (current_class_type
)
2265 && DECL_LANG_SPECIFIC (decl
)
2266 /* If this is either a friend defined in the scope of the class
2267 or a member function. */
2268 && ((DECL_CONTEXT (decl
)
2269 && same_type_p (DECL_CONTEXT (decl
), current_class_type
))
2270 || (DECL_FRIEND_CONTEXT (decl
)
2271 && same_type_p (DECL_FRIEND_CONTEXT (decl
),
2272 current_class_type
)))
2273 /* And, if it was a member function, it really was defined in
2274 the scope of the class. */
2275 && (!DECL_FUNCTION_MEMBER_P (decl
) || DECL_DEFINED_IN_CLASS_P (decl
)))
2276 /* We already checked these parameters when the template was
2277 declared, so there's no need to do it again now. This function
2278 was defined in class scope, but we're processing it's body now
2279 that the class is complete. */
2284 If a template-parameter has a default template-argument, all
2285 subsequent template-parameters shall have a default
2286 template-argument supplied. */
2287 for (parm_level
= parms
; parm_level
; parm_level
= TREE_CHAIN (parm_level
))
2289 tree inner_parms
= TREE_VALUE (parm_level
);
2290 int ntparms
= TREE_VEC_LENGTH (inner_parms
);
2291 int seen_def_arg_p
= 0;
2294 for (i
= 0; i
< ntparms
; ++i
)
2296 tree parm
= TREE_VEC_ELT (inner_parms
, i
);
2297 if (TREE_PURPOSE (parm
))
2299 else if (seen_def_arg_p
)
2301 cp_error ("no default argument for `%D'", TREE_VALUE (parm
));
2302 /* For better subsequent error-recovery, we indicate that
2303 there should have been a default argument. */
2304 TREE_PURPOSE (parm
) = error_mark_node
;
2309 if (TREE_CODE (decl
) != TYPE_DECL
|| is_partial
|| !is_primary
)
2310 /* For an ordinary class template, default template arguments are
2311 allowed at the innermost level, e.g.:
2312 template <class T = int>
2314 but, in a partial specialization, they're not allowed even
2315 there, as we have in [temp.class.spec]:
2317 The template parameter list of a specialization shall not
2318 contain default template argument values.
2320 So, for a partial specialization, or for a function template,
2321 we look at all of them. */
2324 /* But, for a primary class template that is not a partial
2325 specialization we look at all template parameters except the
2327 parms
= TREE_CHAIN (parms
);
2329 /* Figure out what error message to issue. */
2330 if (TREE_CODE (decl
) == FUNCTION_DECL
)
2331 msg
= "default argument for template parameter in function template `%D'";
2332 else if (is_partial
)
2333 msg
= "default argument in partial specialization `%D'";
2335 msg
= "default argument for template parameter for class enclosing `%D'";
2337 if (current_class_type
&& TYPE_BEING_DEFINED (current_class_type
))
2338 /* If we're inside a class definition, there's no need to
2339 examine the parameters to the class itself. On the one
2340 hand, they will be checked when the class is defined, and,
2341 on the other, default arguments are legal in things like:
2342 template <class T = double>
2343 struct S { template <class U> void f(U); };
2344 Here the default argument for `S' has no bearing on the
2345 declaration of `f'. */
2346 last_level_to_check
= template_class_depth (current_class_type
) + 1;
2348 /* Check everything. */
2349 last_level_to_check
= 0;
2351 for (parm_level
= parms
;
2352 parm_level
&& TMPL_PARMS_DEPTH (parm_level
) >= last_level_to_check
;
2353 parm_level
= TREE_CHAIN (parm_level
))
2355 tree inner_parms
= TREE_VALUE (parm_level
);
2359 ntparms
= TREE_VEC_LENGTH (inner_parms
);
2360 for (i
= 0; i
< ntparms
; ++i
)
2361 if (TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)))
2365 cp_error (msg
, decl
);
2369 /* Clear out the default argument so that we are not
2371 TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)) = NULL_TREE
;
2374 /* At this point, if we're still interested in issuing messages,
2375 they must apply to classes surrounding the object declared. */
2377 msg
= "default argument for template parameter for class enclosing `%D'";
2381 /* Creates a TEMPLATE_DECL for the indicated DECL using the template
2382 parameters given by current_template_args, or reuses a
2383 previously existing one, if appropriate. Returns the DECL, or an
2384 equivalent one, if it is replaced via a call to duplicate_decls.
2386 If IS_FRIEND is non-zero, DECL is a friend declaration. */
2389 push_template_decl_real (decl
, is_friend
)
2399 int new_template_p
= 0;
2401 /* See if this is a partial specialization. */
2402 is_partial
= (DECL_IMPLICIT_TYPEDEF_P (decl
)
2403 && TREE_CODE (TREE_TYPE (decl
)) != ENUMERAL_TYPE
2404 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl
)));
2406 is_friend
|= (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_FRIEND_P (decl
));
2409 /* For a friend, we want the context of the friend function, not
2410 the type of which it is a friend. */
2411 ctx
= DECL_CONTEXT (decl
);
2412 else if (CP_DECL_CONTEXT (decl
)
2413 && TREE_CODE (CP_DECL_CONTEXT (decl
)) != NAMESPACE_DECL
)
2414 /* In the case of a virtual function, we want the class in which
2416 ctx
= CP_DECL_CONTEXT (decl
);
2418 /* Otherwise, if we're currently definining some class, the DECL
2419 is assumed to be a member of the class. */
2420 ctx
= current_scope ();
2422 if (ctx
&& TREE_CODE (ctx
) == NAMESPACE_DECL
)
2425 if (!DECL_CONTEXT (decl
))
2426 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
2428 /* See if this is a primary template. */
2429 primary
= template_parm_scope_p ();
2433 if (current_lang_name
== lang_name_c
)
2434 cp_error ("template with C linkage");
2435 else if (TREE_CODE (decl
) == TYPE_DECL
2436 && ANON_AGGRNAME_P (DECL_NAME (decl
)))
2437 cp_error ("template class without a name");
2438 else if ((DECL_IMPLICIT_TYPEDEF_P (decl
)
2439 && CLASS_TYPE_P (TREE_TYPE (decl
)))
2440 || (TREE_CODE (decl
) == VAR_DECL
&& ctx
&& CLASS_TYPE_P (ctx
))
2441 || TREE_CODE (decl
) == FUNCTION_DECL
)
2444 cp_error ("template declaration of `%#D'", decl
);
2447 /* Check to see that the rules regarding the use of default
2448 arguments are not being violated. */
2449 check_default_tmpl_args (decl
, current_template_parms
,
2450 primary
, is_partial
);
2453 return process_partial_specialization (decl
);
2455 args
= current_template_args ();
2458 || TREE_CODE (ctx
) == FUNCTION_DECL
2459 || TYPE_BEING_DEFINED (ctx
)
2460 || (is_friend
&& !DECL_TEMPLATE_INFO (decl
)))
2462 if (DECL_LANG_SPECIFIC (decl
)
2463 && DECL_TEMPLATE_INFO (decl
)
2464 && DECL_TI_TEMPLATE (decl
))
2465 tmpl
= DECL_TI_TEMPLATE (decl
);
2466 /* If DECL is a TYPE_DECL for a class-template, then there won't
2467 be DECL_LANG_SPECIFIC. The information equivalent to
2468 DECL_TEMPLATE_INFO is found in TYPE_TEMPLATE_INFO instead. */
2469 else if (DECL_IMPLICIT_TYPEDEF_P (decl
)
2470 && TYPE_TEMPLATE_INFO (TREE_TYPE (decl
))
2471 && TYPE_TI_TEMPLATE (TREE_TYPE (decl
)))
2473 /* Since a template declaration already existed for this
2474 class-type, we must be redeclaring it here. Make sure
2475 that the redeclaration is legal. */
2476 redeclare_class_template (TREE_TYPE (decl
),
2477 current_template_parms
);
2478 /* We don't need to create a new TEMPLATE_DECL; just use the
2479 one we already had. */
2480 tmpl
= TYPE_TI_TEMPLATE (TREE_TYPE (decl
));
2484 tmpl
= build_template_decl (decl
, current_template_parms
);
2487 if (DECL_LANG_SPECIFIC (decl
)
2488 && DECL_TEMPLATE_SPECIALIZATION (decl
))
2490 /* A specialization of a member template of a template
2492 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
2493 DECL_TEMPLATE_INFO (tmpl
) = DECL_TEMPLATE_INFO (decl
);
2494 DECL_TEMPLATE_INFO (decl
) = NULL_TREE
;
2500 tree a
, t
, current
, parms
;
2503 if (TREE_CODE (decl
) == TYPE_DECL
)
2505 if ((IS_AGGR_TYPE_CODE (TREE_CODE (TREE_TYPE (decl
)))
2506 || TREE_CODE (TREE_TYPE (decl
)) == ENUMERAL_TYPE
)
2507 && TYPE_TEMPLATE_INFO (TREE_TYPE (decl
))
2508 && TYPE_TI_TEMPLATE (TREE_TYPE (decl
)))
2509 tmpl
= TYPE_TI_TEMPLATE (TREE_TYPE (decl
));
2512 cp_error ("`%D' does not declare a template type", decl
);
2516 else if (! DECL_TEMPLATE_INFO (decl
))
2518 cp_error ("template definition of non-template `%#D'", decl
);
2522 tmpl
= DECL_TI_TEMPLATE (decl
);
2524 if (is_member_template (tmpl
)
2525 && DECL_FUNCTION_TEMPLATE_P (tmpl
)
2526 && DECL_TEMPLATE_INFO (decl
) && DECL_TI_ARGS (decl
)
2527 && DECL_TEMPLATE_SPECIALIZATION (decl
))
2531 /* The declaration is a specialization of a member
2532 template, declared outside the class. Therefore, the
2533 innermost template arguments will be NULL, so we
2534 replace them with the arguments determined by the
2535 earlier call to check_explicit_specialization. */
2536 args
= DECL_TI_ARGS (decl
);
2539 = build_template_decl (decl
, current_template_parms
);
2540 DECL_TEMPLATE_RESULT (new_tmpl
) = decl
;
2541 TREE_TYPE (new_tmpl
) = TREE_TYPE (decl
);
2542 DECL_TI_TEMPLATE (decl
) = new_tmpl
;
2543 SET_DECL_TEMPLATE_SPECIALIZATION (new_tmpl
);
2544 DECL_TEMPLATE_INFO (new_tmpl
)
2545 = tree_cons (tmpl
, args
, NULL_TREE
);
2547 register_specialization (new_tmpl
,
2548 most_general_template (tmpl
),
2553 /* Make sure the template headers we got make sense. */
2555 parms
= DECL_TEMPLATE_PARMS (tmpl
);
2556 i
= TMPL_PARMS_DEPTH (parms
);
2557 if (TMPL_ARGS_DEPTH (args
) != i
)
2559 cp_error ("expected %d levels of template parms for `%#D', got %d",
2560 i
, decl
, TMPL_ARGS_DEPTH (args
));
2563 for (current
= decl
; i
> 0; --i
, parms
= TREE_CHAIN (parms
))
2565 a
= TMPL_ARGS_LEVEL (args
, i
);
2566 t
= INNERMOST_TEMPLATE_PARMS (parms
);
2568 if (TREE_VEC_LENGTH (t
) != TREE_VEC_LENGTH (a
))
2570 if (current
== decl
)
2571 cp_error ("got %d template parameters for `%#D'",
2572 TREE_VEC_LENGTH (a
), decl
);
2574 cp_error ("got %d template parameters for `%#T'",
2575 TREE_VEC_LENGTH (a
), current
);
2576 cp_error (" but %d required", TREE_VEC_LENGTH (t
));
2579 /* Perhaps we should also check that the parms are used in the
2580 appropriate qualifying scopes in the declarator? */
2582 if (current
== decl
)
2585 current
= TYPE_CONTEXT (current
);
2589 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
2590 TREE_TYPE (tmpl
) = TREE_TYPE (decl
);
2592 /* Push template declarations for global functions and types. Note
2593 that we do not try to push a global template friend declared in a
2594 template class; such a thing may well depend on the template
2595 parameters of the class. */
2596 if (new_template_p
&& !ctx
2597 && !(is_friend
&& template_class_depth (current_class_type
) > 0))
2598 tmpl
= pushdecl_namespace_level (tmpl
);
2601 DECL_PRIMARY_TEMPLATE (tmpl
) = tmpl
;
2603 info
= tree_cons (tmpl
, args
, NULL_TREE
);
2605 if (DECL_IMPLICIT_TYPEDEF_P (decl
))
2607 SET_TYPE_TEMPLATE_INFO (TREE_TYPE (tmpl
), info
);
2608 if ((!ctx
|| TREE_CODE (ctx
) != FUNCTION_DECL
)
2609 && TREE_CODE (TREE_TYPE (decl
)) != ENUMERAL_TYPE
)
2610 DECL_NAME (decl
) = classtype_mangled_name (TREE_TYPE (decl
));
2612 else if (DECL_LANG_SPECIFIC (decl
))
2613 DECL_TEMPLATE_INFO (decl
) = info
;
2615 return DECL_TEMPLATE_RESULT (tmpl
);
2619 push_template_decl (decl
)
2622 return push_template_decl_real (decl
, 0);
2625 /* Called when a class template TYPE is redeclared with the indicated
2626 template PARMS, e.g.:
2628 template <class T> struct S;
2629 template <class T> struct S {}; */
2632 redeclare_class_template (type
, parms
)
2640 if (!TYPE_TEMPLATE_INFO (type
))
2642 cp_error ("`%T' is not a template type", type
);
2646 tmpl
= TYPE_TI_TEMPLATE (type
);
2647 if (!PRIMARY_TEMPLATE_P (tmpl
))
2648 /* The type is nested in some template class. Nothing to worry
2649 about here; there are no new template parameters for the nested
2653 parms
= INNERMOST_TEMPLATE_PARMS (parms
);
2654 tmpl_parms
= DECL_INNERMOST_TEMPLATE_PARMS (tmpl
);
2656 if (TREE_VEC_LENGTH (parms
) != TREE_VEC_LENGTH (tmpl_parms
))
2658 cp_error_at ("previous declaration `%D'", tmpl
);
2659 cp_error ("used %d template parameter%s instead of %d",
2660 TREE_VEC_LENGTH (tmpl_parms
),
2661 TREE_VEC_LENGTH (tmpl_parms
) == 1 ? "" : "s",
2662 TREE_VEC_LENGTH (parms
));
2666 for (i
= 0; i
< TREE_VEC_LENGTH (tmpl_parms
); ++i
)
2668 tree tmpl_parm
= TREE_VALUE (TREE_VEC_ELT (tmpl_parms
, i
));
2669 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
2670 tree tmpl_default
= TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
));
2671 tree parm_default
= TREE_PURPOSE (TREE_VEC_ELT (parms
, i
));
2673 if (TREE_CODE (tmpl_parm
) != TREE_CODE (parm
))
2675 cp_error_at ("template parameter `%#D'", tmpl_parm
);
2676 cp_error ("redeclared here as `%#D'", parm
);
2680 if (tmpl_default
!= NULL_TREE
&& parm_default
!= NULL_TREE
)
2682 /* We have in [temp.param]:
2684 A template-parameter may not be given default arguments
2685 by two different declarations in the same scope. */
2686 cp_error ("redefinition of default argument for `%#D'", parm
);
2687 cp_error_at (" original definition appeared here", tmpl_parm
);
2691 if (parm_default
!= NULL_TREE
)
2692 /* Update the previous template parameters (which are the ones
2693 that will really count) with the new default value. */
2694 TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
)) = parm_default
;
2695 else if (tmpl_default
!= NULL_TREE
)
2696 /* Update the new parameters, too; they'll be used as the
2697 parameters for any members. */
2698 TREE_PURPOSE (TREE_VEC_ELT (parms
, i
)) = tmpl_default
;
2702 /* Attempt to convert the non-type template parameter EXPR to the
2703 indicated TYPE. If the conversion is successful, return the
2704 converted value. If the conversion is unsuccesful, return
2705 NULL_TREE if we issued an error message, or error_mark_node if we
2706 did not. We issue error messages for out-and-out bad template
2707 parameters, but not simply because the conversion failed, since we
2708 might be just trying to do argument deduction. By the time this
2709 function is called, neither TYPE nor EXPR may make use of template
2713 convert_nontype_argument (type
, expr
)
2717 tree expr_type
= TREE_TYPE (expr
);
2719 /* A template-argument for a non-type, non-template
2720 template-parameter shall be one of:
2722 --an integral constant-expression of integral or enumeration
2725 --the name of a non-type template-parameter; or
2727 --the name of an object or function with external linkage,
2728 including function templates and function template-ids but
2729 excluding non-static class members, expressed as id-expression;
2732 --the address of an object or function with external linkage,
2733 including function templates and function template-ids but
2734 excluding non-static class members, expressed as & id-expression
2735 where the & is optional if the name refers to a function or
2738 --a pointer to member expressed as described in _expr.unary.op_. */
2740 /* An integral constant-expression can include const variables or
2741 enumerators. Simplify things by folding them to their values,
2742 unless we're about to bind the declaration to a reference
2744 if (INTEGRAL_TYPE_P (expr_type
)
2745 && TREE_CODE (type
) != REFERENCE_TYPE
)
2746 expr
= decl_constant_value (expr
);
2748 if (is_overloaded_fn (expr
))
2749 /* OK for now. We'll check that it has external linkage later.
2750 Check this first since if expr_type is the unknown_type_node
2751 we would otherwise complain below. */
2753 else if (TYPE_PTRMEM_P (expr_type
)
2754 || TYPE_PTRMEMFUNC_P (expr_type
))
2756 if (TREE_CODE (expr
) != PTRMEM_CST
)
2759 else if (TYPE_PTR_P (expr_type
)
2760 || TYPE_PTRMEM_P (expr_type
)
2761 || TREE_CODE (expr_type
) == ARRAY_TYPE
2762 || TREE_CODE (type
) == REFERENCE_TYPE
2763 /* If expr is the address of an overloaded function, we
2764 will get the unknown_type_node at this point. */
2765 || expr_type
== unknown_type_node
)
2771 if (TREE_CODE (expr_type
) == ARRAY_TYPE
2772 || (TREE_CODE (type
) == REFERENCE_TYPE
2773 && TREE_CODE (e
) != ADDR_EXPR
))
2777 if (TREE_CODE (e
) != ADDR_EXPR
)
2780 cp_error ("`%E' is not a valid template argument", expr
);
2781 if (TYPE_PTR_P (expr_type
))
2783 if (TREE_CODE (TREE_TYPE (expr_type
)) == FUNCTION_TYPE
)
2784 cp_error ("it must be the address of a function with external linkage");
2786 cp_error ("it must be the address of an object with external linkage");
2788 else if (TYPE_PTRMEM_P (expr_type
)
2789 || TYPE_PTRMEMFUNC_P (expr_type
))
2790 cp_error ("it must be a pointer-to-member of the form `&X::Y'");
2795 referent
= TREE_OPERAND (e
, 0);
2796 STRIP_NOPS (referent
);
2799 if (TREE_CODE (referent
) == STRING_CST
)
2801 cp_error ("string literal %E is not a valid template argument because it is the address of an object with static linkage",
2806 if (is_overloaded_fn (referent
))
2807 /* We'll check that it has external linkage later. */
2809 else if (TREE_CODE (referent
) != VAR_DECL
)
2811 else if (!DECL_EXTERNAL_LINKAGE_P (referent
))
2813 cp_error ("address of non-extern `%E' cannot be used as template argument", referent
);
2814 return error_mark_node
;
2817 else if (INTEGRAL_TYPE_P (expr_type
)
2818 || TYPE_PTRMEM_P (expr_type
)
2819 || TYPE_PTRMEMFUNC_P (expr_type
)
2820 /* The next two are g++ extensions. */
2821 || TREE_CODE (expr_type
) == REAL_TYPE
2822 || TREE_CODE (expr_type
) == COMPLEX_TYPE
)
2824 if (! TREE_CONSTANT (expr
))
2827 cp_error ("non-constant `%E' cannot be used as template argument",
2834 cp_error ("object `%E' cannot be used as template argument", expr
);
2838 switch (TREE_CODE (type
))
2843 /* For a non-type template-parameter of integral or enumeration
2844 type, integral promotions (_conv.prom_) and integral
2845 conversions (_conv.integral_) are applied. */
2846 if (!INTEGRAL_TYPE_P (expr_type
))
2847 return error_mark_node
;
2849 /* It's safe to call digest_init in this case; we know we're
2850 just converting one integral constant expression to another. */
2851 expr
= digest_init (type
, expr
, (tree
*) 0);
2853 if (TREE_CODE (expr
) != INTEGER_CST
)
2854 /* Curiously, some TREE_CONSTANT integral expressions do not
2855 simplify to integer constants. For example, `3 % 0',
2856 remains a TRUNC_MOD_EXPR. */
2863 /* These are g++ extensions. */
2864 if (TREE_CODE (expr_type
) != TREE_CODE (type
))
2865 return error_mark_node
;
2867 expr
= digest_init (type
, expr
, (tree
*) 0);
2869 if (TREE_CODE (expr
) != REAL_CST
)
2876 tree type_pointed_to
= TREE_TYPE (type
);
2878 if (TYPE_PTRMEM_P (type
))
2882 /* For a non-type template-parameter of type pointer to data
2883 member, qualification conversions (_conv.qual_) are
2885 e
= perform_qualification_conversions (type
, expr
);
2886 if (TREE_CODE (e
) == NOP_EXPR
)
2887 /* The call to perform_qualification_conversions will
2888 insert a NOP_EXPR over EXPR to do express conversion,
2889 if necessary. But, that will confuse us if we use
2890 this (converted) template parameter to instantiate
2891 another template; then the thing will not look like a
2892 valid template argument. So, just make a new
2893 constant, of the appropriate type. */
2894 e
= make_ptrmem_cst (type
, PTRMEM_CST_MEMBER (expr
));
2897 else if (TREE_CODE (type_pointed_to
) == FUNCTION_TYPE
)
2899 /* For a non-type template-parameter of type pointer to
2900 function, only the function-to-pointer conversion
2901 (_conv.func_) is applied. If the template-argument
2902 represents a set of overloaded functions (or a pointer to
2903 such), the matching function is selected from the set
2908 if (TREE_CODE (expr
) == ADDR_EXPR
)
2909 fns
= TREE_OPERAND (expr
, 0);
2913 fn
= instantiate_type (type_pointed_to
, fns
, itf_none
);
2915 if (fn
== error_mark_node
)
2916 return error_mark_node
;
2918 if (!DECL_EXTERNAL_LINKAGE_P (fn
))
2920 if (really_overloaded_fn (fns
))
2921 return error_mark_node
;
2926 expr
= build_unary_op (ADDR_EXPR
, fn
, 0);
2928 my_friendly_assert (same_type_p (type
, TREE_TYPE (expr
)),
2934 /* For a non-type template-parameter of type pointer to
2935 object, qualification conversions (_conv.qual_) and the
2936 array-to-pointer conversion (_conv.array_) are applied.
2937 [Note: In particular, neither the null pointer conversion
2938 (_conv.ptr_) nor the derived-to-base conversion
2939 (_conv.ptr_) are applied. Although 0 is a valid
2940 template-argument for a non-type template-parameter of
2941 integral type, it is not a valid template-argument for a
2942 non-type template-parameter of pointer type.]
2944 The call to decay_conversion performs the
2945 array-to-pointer conversion, if appropriate. */
2946 expr
= decay_conversion (expr
);
2948 if (expr
== error_mark_node
)
2949 return error_mark_node
;
2951 return perform_qualification_conversions (type
, expr
);
2956 case REFERENCE_TYPE
:
2958 tree type_referred_to
= TREE_TYPE (type
);
2960 /* If this expression already has reference type, get the
2961 underling object. */
2962 if (TREE_CODE (expr_type
) == REFERENCE_TYPE
)
2964 my_friendly_assert (TREE_CODE (expr
) == ADDR_EXPR
, 20000604);
2965 expr
= TREE_OPERAND (expr
, 0);
2966 expr_type
= TREE_TYPE (expr
);
2969 if (TREE_CODE (type_referred_to
) == FUNCTION_TYPE
)
2971 /* For a non-type template-parameter of type reference to
2972 function, no conversions apply. If the
2973 template-argument represents a set of overloaded
2974 functions, the matching function is selected from the
2975 set (_over.over_). */
2978 fn
= instantiate_type (type_referred_to
, expr
, itf_none
);
2980 if (fn
== error_mark_node
)
2981 return error_mark_node
;
2983 if (!DECL_EXTERNAL_LINKAGE_P (fn
))
2985 if (really_overloaded_fn (expr
))
2986 /* Don't issue an error here; we might get a different
2987 function if the overloading had worked out
2989 return error_mark_node
;
2994 my_friendly_assert (same_type_p (type_referred_to
,
3002 /* For a non-type template-parameter of type reference to
3003 object, no conversions apply. The type referred to by the
3004 reference may be more cv-qualified than the (otherwise
3005 identical) type of the template-argument. The
3006 template-parameter is bound directly to the
3007 template-argument, which must be an lvalue. */
3008 if (!same_type_p (TYPE_MAIN_VARIANT (expr_type
),
3009 TYPE_MAIN_VARIANT (type_referred_to
))
3010 || !at_least_as_qualified_p (type_referred_to
,
3012 || !real_lvalue_p (expr
))
3013 return error_mark_node
;
3016 mark_addressable (expr
);
3017 return build1 (ADDR_EXPR
, type
, expr
);
3023 if (!TYPE_PTRMEMFUNC_P (type
))
3024 /* This handles templates like
3025 template<class T, T t> void f();
3026 when T is substituted with any class. The second template
3027 parameter becomes invalid and the template candidate is
3029 return error_mark_node
;
3031 /* For a non-type template-parameter of type pointer to member
3032 function, no conversions apply. If the template-argument
3033 represents a set of overloaded member functions, the
3034 matching member function is selected from the set
3037 if (!TYPE_PTRMEMFUNC_P (expr_type
) &&
3038 expr_type
!= unknown_type_node
)
3039 return error_mark_node
;
3041 if (TREE_CODE (expr
) == PTRMEM_CST
)
3043 /* A ptr-to-member constant. */
3044 if (!same_type_p (type
, expr_type
))
3045 return error_mark_node
;
3050 if (TREE_CODE (expr
) != ADDR_EXPR
)
3051 return error_mark_node
;
3053 expr
= instantiate_type (type
, expr
, itf_none
);
3055 if (expr
== error_mark_node
)
3056 return error_mark_node
;
3058 my_friendly_assert (same_type_p (type
, TREE_TYPE (expr
)),
3065 /* All non-type parameters must have one of these types. */
3066 my_friendly_abort (0);
3070 return error_mark_node
;
3073 /* Return 1 if PARM_PARMS and ARG_PARMS matches using rule for
3074 template template parameters. Both PARM_PARMS and ARG_PARMS are
3075 vectors of TREE_LIST nodes containing TYPE_DECL, TEMPLATE_DECL
3078 ARG_PARMS may contain more parameters than PARM_PARMS. If this is
3079 the case, then extra parameters must have default arguments.
3081 Consider the example:
3082 template <class T, class Allocator = allocator> class vector;
3083 template<template <class U> class TT> class C;
3085 C<vector> is a valid instantiation. PARM_PARMS for the above code
3086 contains a TYPE_DECL (for U), ARG_PARMS contains two TYPE_DECLs (for
3087 T and Allocator) and OUTER_ARGS contains the argument that is used to
3088 substitute the TT parameter. */
3091 coerce_template_template_parms (parm_parms
, arg_parms
, complain
,
3092 in_decl
, outer_args
)
3093 tree parm_parms
, arg_parms
;
3095 tree in_decl
, outer_args
;
3097 int nparms
, nargs
, i
;
3100 my_friendly_assert (TREE_CODE (parm_parms
) == TREE_VEC
, 0);
3101 my_friendly_assert (TREE_CODE (arg_parms
) == TREE_VEC
, 0);
3103 nparms
= TREE_VEC_LENGTH (parm_parms
);
3104 nargs
= TREE_VEC_LENGTH (arg_parms
);
3106 /* The rule here is opposite of coerce_template_parms. */
3109 && TREE_PURPOSE (TREE_VEC_ELT (arg_parms
, nparms
)) == NULL_TREE
))
3112 for (i
= 0; i
< nparms
; ++i
)
3114 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, i
));
3115 arg
= TREE_VALUE (TREE_VEC_ELT (arg_parms
, i
));
3117 if (arg
== NULL_TREE
|| arg
== error_mark_node
3118 || parm
== NULL_TREE
|| parm
== error_mark_node
)
3121 if (TREE_CODE (arg
) != TREE_CODE (parm
))
3124 switch (TREE_CODE (parm
))
3130 /* We encounter instantiations of templates like
3131 template <template <template <class> class> class TT>
3134 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
3135 tree argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
3137 if (!coerce_template_template_parms (parmparm
, argparm
,
3145 /* The tsubst call is used to handle cases such as
3146 template <class T, template <T> class TT> class D;
3147 i.e. the parameter list of TT depends on earlier parameters. */
3148 if (!same_type_p (tsubst (TREE_TYPE (parm
), outer_args
,
3155 my_friendly_abort (0);
3161 /* Convert the indicated template ARG as necessary to match the
3162 indicated template PARM. Returns the converted ARG, or
3163 error_mark_node if the conversion was unsuccessful. Error messages
3164 are issued if COMPLAIN is non-zero. This conversion is for the Ith
3165 parameter in the parameter list. ARGS is the full set of template
3166 arguments deduced so far. */
3169 convert_template_argument (parm
, arg
, args
, complain
, i
, in_decl
)
3179 int is_type
, requires_type
, is_tmpl_type
, requires_tmpl_type
;
3181 inner_args
= INNERMOST_TEMPLATE_ARGS (args
);
3183 if (TREE_CODE (arg
) == TREE_LIST
3184 && TREE_TYPE (arg
) != NULL_TREE
3185 && TREE_CODE (TREE_TYPE (arg
)) == OFFSET_TYPE
)
3187 /* The template argument was the name of some
3188 member function. That's usually
3189 illegal, but static members are OK. In any
3190 case, grab the underlying fields/functions
3191 and issue an error later if required. */
3192 arg
= TREE_VALUE (arg
);
3193 TREE_TYPE (arg
) = unknown_type_node
;
3196 requires_tmpl_type
= TREE_CODE (parm
) == TEMPLATE_DECL
;
3197 requires_type
= (TREE_CODE (parm
) == TYPE_DECL
3198 || requires_tmpl_type
);
3200 /* Check if it is a class template. If REQUIRES_TMPL_TYPE is true,
3201 we also accept implicitly created TYPE_DECL as a valid argument.
3202 This is necessary to handle the case where we pass a template name
3203 to a template template parameter in a scope where we've derived from
3204 in instantiation of that template, so the template name refers to that
3205 instantiation. We really ought to handle this better. */
3207 = ((TREE_CODE (arg
) == TEMPLATE_DECL
3208 && TREE_CODE (DECL_TEMPLATE_RESULT (arg
)) == TYPE_DECL
)
3209 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
3210 || (TREE_CODE (arg
) == RECORD_TYPE
3211 && CLASSTYPE_TEMPLATE_INFO (arg
)
3212 && TREE_CODE (TYPE_NAME (arg
)) == TYPE_DECL
3213 && DECL_ARTIFICIAL (TYPE_NAME (arg
))
3214 && requires_tmpl_type
3215 && is_base_of_enclosing_class (arg
, current_class_type
)));
3216 if (is_tmpl_type
&& TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
3217 arg
= TYPE_STUB_DECL (arg
);
3218 else if (is_tmpl_type
&& TREE_CODE (arg
) == RECORD_TYPE
)
3219 arg
= CLASSTYPE_TI_TEMPLATE (arg
);
3221 is_type
= TYPE_P (arg
) || is_tmpl_type
;
3223 if (requires_type
&& ! is_type
&& TREE_CODE (arg
) == SCOPE_REF
3224 && TREE_CODE (TREE_OPERAND (arg
, 0)) == TEMPLATE_TYPE_PARM
)
3226 cp_pedwarn ("to refer to a type member of a template parameter, use `typename %E'", arg
);
3228 arg
= make_typename_type (TREE_OPERAND (arg
, 0),
3229 TREE_OPERAND (arg
, 1),
3233 if (is_type
!= requires_type
)
3239 cp_error ("type/value mismatch at argument %d in template parameter list for `%D'",
3242 cp_error (" expected a constant of type `%T', got `%T'",
3244 (is_tmpl_type
? DECL_NAME (arg
) : arg
));
3246 cp_error (" expected a type, got `%E'", arg
);
3249 return error_mark_node
;
3251 if (is_tmpl_type
^ requires_tmpl_type
)
3253 if (in_decl
&& complain
)
3255 cp_error ("type/value mismatch at argument %d in template parameter list for `%D'",
3258 cp_error (" expected a type, got `%T'", DECL_NAME (arg
));
3260 cp_error (" expected a class template, got `%T'", arg
);
3262 return error_mark_node
;
3267 if (requires_tmpl_type
)
3269 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
3270 tree argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
3272 if (coerce_template_template_parms (parmparm
, argparm
, complain
,
3273 in_decl
, inner_args
))
3277 /* TEMPLATE_TEMPLATE_PARM node is preferred over
3279 if (val
!= error_mark_node
3280 && DECL_TEMPLATE_TEMPLATE_PARM_P (val
))
3281 val
= TREE_TYPE (val
);
3285 if (in_decl
&& complain
)
3287 cp_error ("type/value mismatch at argument %d in template parameter list for `%D'",
3289 cp_error (" expected a template of type `%D', got `%D'", parm
, arg
);
3292 val
= error_mark_node
;
3297 val
= groktypename (arg
);
3298 if (! processing_template_decl
)
3300 /* [basic.link]: A name with no linkage (notably, the
3301 name of a class or enumeration declared in a local
3302 scope) shall not be used to declare an entity with
3303 linkage. This implies that names with no linkage
3304 cannot be used as template arguments. */
3305 tree t
= no_linkage_check (val
);
3308 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
3310 ("template-argument `%T' uses anonymous type", val
);
3313 ("template-argument `%T' uses local type `%T'",
3315 return error_mark_node
;
3322 tree t
= tsubst (TREE_TYPE (parm
), args
, complain
, in_decl
);
3324 if (processing_template_decl
)
3325 arg
= maybe_fold_nontype_arg (arg
);
3327 if (!uses_template_parms (arg
) && !uses_template_parms (t
))
3328 /* We used to call digest_init here. However, digest_init
3329 will report errors, which we don't want when complain
3330 is zero. More importantly, digest_init will try too
3331 hard to convert things: for example, `0' should not be
3332 converted to pointer type at this point according to
3333 the standard. Accepting this is not merely an
3334 extension, since deciding whether or not these
3335 conversions can occur is part of determining which
3336 function template to call, or whether a given epxlicit
3337 argument specification is legal. */
3338 val
= convert_nontype_argument (t
, arg
);
3342 if (val
== NULL_TREE
)
3343 val
= error_mark_node
;
3344 else if (val
== error_mark_node
&& complain
)
3345 cp_error ("could not convert template argument `%E' to `%T'",
3352 /* Convert all template arguments to their appropriate types, and
3353 return a vector containing the innermost resulting template
3354 arguments. If any error occurs, return error_mark_node, and, if
3355 COMPLAIN is non-zero, issue an error message. Some error messages
3356 are issued even if COMPLAIN is zero; for instance, if a template
3357 argument is composed from a local class.
3359 If REQUIRE_ALL_ARGUMENTS is non-zero, all arguments must be
3360 provided in ARGLIST, or else trailing parameters must have default
3361 values. If REQUIRE_ALL_ARGUMENTS is zero, we will attempt argument
3362 deduction for any unspecified trailing arguments. */
3365 coerce_template_parms (parms
, args
, in_decl
,
3367 require_all_arguments
)
3371 int require_all_arguments
;
3373 int nparms
, nargs
, i
, lost
= 0;
3376 tree new_inner_args
;
3378 inner_args
= INNERMOST_TEMPLATE_ARGS (args
);
3379 nargs
= NUM_TMPL_ARGS (inner_args
);
3380 nparms
= TREE_VEC_LENGTH (parms
);
3384 && require_all_arguments
3385 && TREE_PURPOSE (TREE_VEC_ELT (parms
, nargs
)) == NULL_TREE
))
3389 cp_error ("wrong number of template arguments (%d, should be %d)",
3393 cp_error_at ("provided for `%D'", in_decl
);
3396 return error_mark_node
;
3399 new_inner_args
= make_tree_vec (nparms
);
3400 new_args
= add_outermost_template_args (args
, new_inner_args
);
3401 for (i
= 0; i
< nparms
; i
++)
3406 /* Get the Ith template parameter. */
3407 parm
= TREE_VEC_ELT (parms
, i
);
3409 /* Calculate the Ith argument. */
3410 if (inner_args
&& TREE_CODE (inner_args
) == TREE_LIST
)
3412 arg
= TREE_VALUE (inner_args
);
3413 inner_args
= TREE_CHAIN (inner_args
);
3416 arg
= TREE_VEC_ELT (inner_args
, i
);
3417 /* If no template argument was supplied, look for a default
3419 else if (TREE_PURPOSE (parm
) == NULL_TREE
)
3421 /* There was no default value. */
3422 my_friendly_assert (!require_all_arguments
, 0);
3425 else if (TREE_CODE (TREE_VALUE (parm
)) == TYPE_DECL
)
3426 arg
= tsubst (TREE_PURPOSE (parm
), new_args
, complain
, in_decl
);
3428 arg
= tsubst_expr (TREE_PURPOSE (parm
), new_args
, complain
,
3431 /* Now, convert the Ith argument, as necessary. */
3432 if (arg
== NULL_TREE
)
3433 /* We're out of arguments. */
3435 my_friendly_assert (!require_all_arguments
, 0);
3438 else if (arg
== error_mark_node
)
3440 cp_error ("template argument %d is invalid", i
+ 1);
3441 arg
= error_mark_node
;
3444 arg
= convert_template_argument (TREE_VALUE (parm
),
3445 arg
, new_args
, complain
, i
,
3448 if (arg
== error_mark_node
)
3450 TREE_VEC_ELT (new_inner_args
, i
) = arg
;
3454 return error_mark_node
;
3456 return new_inner_args
;
3459 /* Returns 1 if template args OT and NT are equivalent. */
3462 template_args_equal (ot
, nt
)
3467 if (TREE_CODE (nt
) != TREE_CODE (ot
))
3469 if (TREE_CODE (nt
) == TREE_VEC
)
3470 /* For member templates */
3471 return comp_template_args (ot
, nt
);
3472 else if (TYPE_P (ot
))
3473 return same_type_p (ot
, nt
);
3475 return (cp_tree_equal (ot
, nt
) > 0);
3478 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets
3479 of template arguments. Returns 0 otherwise. */
3482 comp_template_args (oldargs
, newargs
)
3483 tree oldargs
, newargs
;
3487 if (TREE_VEC_LENGTH (oldargs
) != TREE_VEC_LENGTH (newargs
))
3490 for (i
= 0; i
< TREE_VEC_LENGTH (oldargs
); ++i
)
3492 tree nt
= TREE_VEC_ELT (newargs
, i
);
3493 tree ot
= TREE_VEC_ELT (oldargs
, i
);
3495 if (! template_args_equal (ot
, nt
))
3501 /* Given class template name and parameter list, produce a user-friendly name
3502 for the instantiation. */
3505 mangle_class_name_for_template (name
, parms
, arglist
)
3507 tree parms
, arglist
;
3509 static struct obstack scratch_obstack
;
3510 static char *scratch_firstobj
;
3513 if (!scratch_firstobj
)
3514 gcc_obstack_init (&scratch_obstack
);
3516 obstack_free (&scratch_obstack
, scratch_firstobj
);
3517 scratch_firstobj
= obstack_alloc (&scratch_obstack
, 1);
3519 #define ccat(c) obstack_1grow (&scratch_obstack, (c));
3520 #define cat(s) obstack_grow (&scratch_obstack, (s), strlen (s))
3524 nparms
= TREE_VEC_LENGTH (parms
);
3525 arglist
= INNERMOST_TEMPLATE_ARGS (arglist
);
3526 my_friendly_assert (nparms
== TREE_VEC_LENGTH (arglist
), 268);
3527 for (i
= 0; i
< nparms
; i
++)
3529 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
3530 tree arg
= TREE_VEC_ELT (arglist
, i
);
3535 if (TREE_CODE (parm
) == TYPE_DECL
)
3537 cat (type_as_string (arg
, TFF_CHASE_TYPEDEF
));
3540 else if (TREE_CODE (parm
) == TEMPLATE_DECL
)
3542 if (TREE_CODE (arg
) == TEMPLATE_DECL
)
3544 /* Already substituted with real template. Just output
3545 the template name here */
3546 tree context
= DECL_CONTEXT (arg
);
3549 /* The template may be defined in a namespace, or
3550 may be a member template. */
3551 my_friendly_assert (TREE_CODE (context
) == NAMESPACE_DECL
3552 || CLASS_TYPE_P (context
),
3554 cat(decl_as_string (DECL_CONTEXT (arg
), TFF_PLAIN_IDENTIFIER
));
3557 cat (IDENTIFIER_POINTER (DECL_NAME (arg
)));
3560 /* Output the parameter declaration */
3561 cat (type_as_string (arg
, TFF_CHASE_TYPEDEF
));
3565 my_friendly_assert (TREE_CODE (parm
) == PARM_DECL
, 269);
3567 if (TREE_CODE (arg
) == TREE_LIST
)
3569 /* New list cell was built because old chain link was in
3571 my_friendly_assert (TREE_PURPOSE (arg
) == NULL_TREE
, 270);
3572 arg
= TREE_VALUE (arg
);
3574 /* No need to check arglist against parmlist here; we did that
3575 in coerce_template_parms, called from lookup_template_class. */
3576 cat (expr_as_string (arg
, TFF_PLAIN_IDENTIFIER
));
3579 char *bufp
= obstack_next_free (&scratch_obstack
);
3581 while (bufp
[offset
- 1] == ' ')
3583 obstack_blank_fast (&scratch_obstack
, offset
);
3585 /* B<C<char> >, not B<C<char>> */
3586 if (bufp
[offset
- 1] == '>')
3591 return (char *) obstack_base (&scratch_obstack
);
3595 classtype_mangled_name (t
)
3598 if (CLASSTYPE_TEMPLATE_INFO (t
)
3599 /* Specializations have already had their names set up in
3600 lookup_template_class. */
3601 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
3603 tree tmpl
= most_general_template (CLASSTYPE_TI_TEMPLATE (t
));
3605 /* For non-primary templates, the template parameters are
3606 implicit from their surrounding context. */
3607 if (PRIMARY_TEMPLATE_P (tmpl
))
3609 tree name
= DECL_NAME (tmpl
);
3610 char *mangled_name
= mangle_class_name_for_template
3611 (IDENTIFIER_POINTER (name
),
3612 DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
3613 CLASSTYPE_TI_ARGS (t
));
3614 tree id
= get_identifier (mangled_name
);
3615 IDENTIFIER_TEMPLATE (id
) = name
;
3620 return TYPE_IDENTIFIER (t
);
3624 add_pending_template (d
)
3627 tree ti
= (TYPE_P (d
)
3628 ? CLASSTYPE_TEMPLATE_INFO (d
)
3629 : DECL_TEMPLATE_INFO (d
));
3632 if (TI_PENDING_TEMPLATE_FLAG (ti
))
3635 /* We are called both from instantiate_decl, where we've already had a
3636 tinst_level pushed, and instantiate_template, where we haven't.
3638 level
= !(current_tinst_level
&& TINST_DECL (current_tinst_level
) == d
);
3641 push_tinst_level (d
);
3643 *template_tail
= tree_cons (current_tinst_level
, d
, NULL_TREE
);
3644 template_tail
= &TREE_CHAIN (*template_tail
);
3645 TI_PENDING_TEMPLATE_FLAG (ti
) = 1;
3652 /* Return a TEMPLATE_ID_EXPR corresponding to the indicated FNS (which
3653 may be either a _DECL or an overloaded function or an
3654 IDENTIFIER_NODE), and ARGLIST. */
3657 lookup_template_function (fns
, arglist
)
3662 if (fns
== NULL_TREE
)
3664 cp_error ("non-template used as template");
3665 return error_mark_node
;
3668 type
= TREE_TYPE (fns
);
3669 if (TREE_CODE (fns
) == OVERLOAD
|| !type
)
3670 type
= unknown_type_node
;
3672 if (processing_template_decl
)
3673 return build_min (TEMPLATE_ID_EXPR
, type
, fns
, arglist
);
3675 return build (TEMPLATE_ID_EXPR
, type
, fns
, arglist
);
3678 /* Within the scope of a template class S<T>, the name S gets bound
3679 (in build_self_reference) to a TYPE_DECL for the class, not a
3680 TEMPLATE_DECL. If DECL is a TYPE_DECL for current_class_type,
3681 or one of its enclosing classes, and that type is a template,
3682 return the associated TEMPLATE_DECL. Otherwise, the original
3683 DECL is returned. */
3686 maybe_get_template_decl_from_type_decl (decl
)
3689 return (decl
!= NULL_TREE
3690 && TREE_CODE (decl
) == TYPE_DECL
3691 && DECL_ARTIFICIAL (decl
)
3692 && CLASS_TYPE_P (TREE_TYPE (decl
))
3693 && CLASSTYPE_TEMPLATE_INFO (TREE_TYPE (decl
)))
3694 ? CLASSTYPE_TI_TEMPLATE (TREE_TYPE (decl
)) : decl
;
3697 /* Given an IDENTIFIER_NODE (type TEMPLATE_DECL) and a chain of
3698 parameters, find the desired type.
3700 D1 is the PTYPENAME terminal, and ARGLIST is the list of arguments.
3701 (Actually ARGLIST may be either a TREE_LIST or a TREE_VEC. It will
3702 be a TREE_LIST if called directly from the parser, and a TREE_VEC
3705 IN_DECL, if non-NULL, is the template declaration we are trying to
3708 If ENTERING_SCOPE is non-zero, we are about to enter the scope of
3709 the class we are looking up.
3711 If the template class is really a local class in a template
3712 function, then the FUNCTION_CONTEXT is the function in which it is
3713 being instantiated. */
3716 lookup_template_class (d1
, arglist
, in_decl
, context
, entering_scope
)
3722 tree
template = NULL_TREE
, parmlist
;
3725 if (TREE_CODE (d1
) == IDENTIFIER_NODE
)
3727 if (IDENTIFIER_VALUE (d1
)
3728 && DECL_TEMPLATE_TEMPLATE_PARM_P (IDENTIFIER_VALUE (d1
)))
3729 template = IDENTIFIER_VALUE (d1
);
3733 push_decl_namespace (context
);
3734 template = lookup_name (d1
, /*prefer_type=*/0);
3735 template = maybe_get_template_decl_from_type_decl (template);
3737 pop_decl_namespace ();
3740 context
= DECL_CONTEXT (template);
3742 else if (TREE_CODE (d1
) == TYPE_DECL
&& IS_AGGR_TYPE (TREE_TYPE (d1
)))
3744 tree type
= TREE_TYPE (d1
);
3746 /* If we are declaring a constructor, say A<T>::A<T>, we will get
3747 an implicit typename for the second A. Deal with it. */
3748 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
3749 type
= TREE_TYPE (type
);
3751 if (CLASSTYPE_TEMPLATE_INFO (type
))
3753 template = CLASSTYPE_TI_TEMPLATE (type
);
3754 d1
= DECL_NAME (template);
3757 else if (TREE_CODE (d1
) == ENUMERAL_TYPE
3758 || (TYPE_P (d1
) && IS_AGGR_TYPE (d1
)))
3760 template = TYPE_TI_TEMPLATE (d1
);
3761 d1
= DECL_NAME (template);
3763 else if (TREE_CODE (d1
) == TEMPLATE_DECL
3764 && TREE_CODE (DECL_TEMPLATE_RESULT (d1
)) == TYPE_DECL
)
3767 d1
= DECL_NAME (template);
3768 context
= DECL_CONTEXT (template);
3771 /* With something like `template <class T> class X class X { ... };'
3772 we could end up with D1 having nothing but an IDENTIFIER_VALUE.
3773 We don't want to do that, but we have to deal with the situation,
3774 so let's give them some syntax errors to chew on instead of a
3775 crash. Alternatively D1 might not be a template type at all. */
3778 cp_error ("`%T' is not a template", d1
);
3779 return error_mark_node
;
3782 if (TREE_CODE (template) != TEMPLATE_DECL
)
3784 cp_error ("non-template type `%T' used as a template", d1
);
3786 cp_error_at ("for template declaration `%D'", in_decl
);
3787 return error_mark_node
;
3790 if (DECL_TEMPLATE_TEMPLATE_PARM_P (template))
3792 /* Create a new TEMPLATE_DECL and TEMPLATE_TEMPLATE_PARM node to store
3793 template arguments */
3798 parmlist
= DECL_INNERMOST_TEMPLATE_PARMS (template);
3800 arglist2
= coerce_template_parms (parmlist
, arglist
, template, 1, 1);
3801 if (arglist2
== error_mark_node
)
3802 return error_mark_node
;
3804 parm
= copy_template_template_parm (TREE_TYPE (template), arglist2
);
3805 TYPE_SIZE (parm
) = 0;
3810 tree template_type
= TREE_TYPE (template);
3813 tree found
= NULL_TREE
;
3816 int is_partial_instantiation
;
3818 gen_tmpl
= most_general_template (template);
3819 parmlist
= DECL_TEMPLATE_PARMS (gen_tmpl
);
3820 parm_depth
= TMPL_PARMS_DEPTH (parmlist
);
3821 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
3823 if (arg_depth
== 1 && parm_depth
> 1)
3825 /* We've been given an incomplete set of template arguments.
3828 template <class T> struct S1 {
3829 template <class U> struct S2 {};
3830 template <class U> struct S2<U*> {};
3833 we will be called with an ARGLIST of `U*', but the
3834 TEMPLATE will be `template <class T> template
3835 <class U> struct S1<T>::S2'. We must fill in the missing
3838 = add_outermost_template_args (TYPE_TI_ARGS (TREE_TYPE (template)),
3840 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
3843 /* Now we should enough arguments. */
3844 my_friendly_assert (parm_depth
== arg_depth
, 0);
3846 /* From here on, we're only interested in the most general
3848 template = gen_tmpl
;
3850 /* Calculate the BOUND_ARGS. These will be the args that are
3851 actually tsubst'd into the definition to create the
3855 /* We have multiple levels of arguments to coerce, at once. */
3857 int saved_depth
= TMPL_ARGS_DEPTH (arglist
);
3859 tree bound_args
= make_tree_vec (parm_depth
);
3861 for (i
= saved_depth
,
3862 t
= DECL_TEMPLATE_PARMS (template);
3863 i
> 0 && t
!= NULL_TREE
;
3864 --i
, t
= TREE_CHAIN (t
))
3866 tree a
= coerce_template_parms (TREE_VALUE (t
),
3867 arglist
, template, 1, 1);
3868 SET_TMPL_ARGS_LEVEL (bound_args
, i
, a
);
3870 /* We temporarily reduce the length of the ARGLIST so
3871 that coerce_template_parms will see only the arguments
3872 corresponding to the template parameters it is
3874 TREE_VEC_LENGTH (arglist
)--;
3877 /* Restore the ARGLIST to its full size. */
3878 TREE_VEC_LENGTH (arglist
) = saved_depth
;
3880 arglist
= bound_args
;
3884 = coerce_template_parms (INNERMOST_TEMPLATE_PARMS (parmlist
),
3885 INNERMOST_TEMPLATE_ARGS (arglist
),
3888 if (arglist
== error_mark_node
)
3889 /* We were unable to bind the arguments. */
3890 return error_mark_node
;
3892 /* In the scope of a template class, explicit references to the
3893 template class refer to the type of the template, not any
3894 instantiation of it. For example, in:
3896 template <class T> class C { void f(C<T>); }
3898 the `C<T>' is just the same as `C'. Outside of the
3899 class, however, such a reference is an instantiation. */
3900 if (comp_template_args (TYPE_TI_ARGS (template_type
),
3903 found
= template_type
;
3905 if (!entering_scope
&& PRIMARY_TEMPLATE_P (template))
3909 /* Note that we use DECL_CONTEXT, rather than
3910 CP_DECL_CONTEXT, so that the termination test is
3911 always just `ctx'. We're not interested in namepace
3913 for (ctx
= current_class_type
;
3915 ctx
= (TYPE_P (ctx
)) ? TYPE_CONTEXT (ctx
) : DECL_CONTEXT (ctx
))
3916 if (same_type_p (ctx
, template_type
))
3920 /* We're not in the scope of the class, so the
3921 TEMPLATE_TYPE is not the type we want after
3929 for (found
= DECL_TEMPLATE_INSTANTIATIONS (template);
3930 found
; found
= TREE_CHAIN (found
))
3931 if (comp_template_args (TREE_PURPOSE (found
), arglist
))
3932 return TREE_VALUE (found
);
3934 /* This type is a "partial instantiation" if any of the template
3935 arguments still involve template parameters. Note that we set
3936 IS_PARTIAL_INSTANTIATION for partial specializations as
3938 is_partial_instantiation
= uses_template_parms (arglist
);
3940 if (!is_partial_instantiation
3941 && !PRIMARY_TEMPLATE_P (template)
3942 && TREE_CODE (CP_DECL_CONTEXT (template)) == NAMESPACE_DECL
)
3944 found
= xref_tag_from_type (TREE_TYPE (template),
3945 DECL_NAME (template),
3950 context
= tsubst (DECL_CONTEXT (template), arglist
,
3951 /*complain=*/0, in_decl
);
3953 context
= global_namespace
;
3955 /* Create the type. */
3956 if (TREE_CODE (template_type
) == ENUMERAL_TYPE
)
3958 if (!is_partial_instantiation
)
3960 set_current_access_from_decl (TYPE_NAME (template_type
));
3961 t
= start_enum (TYPE_IDENTIFIER (template_type
));
3964 /* We don't want to call start_enum for this type, since
3965 the values for the enumeration constants may involve
3966 template parameters. And, no one should be interested
3967 in the enumeration constants for such a type. */
3968 t
= make_node (ENUMERAL_TYPE
);
3972 t
= make_aggr_type (TREE_CODE (template_type
));
3973 CLASSTYPE_DECLARED_CLASS (t
)
3974 = CLASSTYPE_DECLARED_CLASS (template_type
);
3975 CLASSTYPE_GOT_SEMICOLON (t
) = 1;
3976 SET_CLASSTYPE_IMPLICIT_INSTANTIATION (t
);
3977 TYPE_FOR_JAVA (t
) = TYPE_FOR_JAVA (template_type
);
3979 /* A local class. Make sure the decl gets registered properly. */
3980 if (context
== current_function_decl
)
3981 pushtag (DECL_NAME (template), t
, 0);
3984 /* If we called start_enum or pushtag above, this information
3985 will already be set up. */
3988 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
3990 type_decl
= create_implicit_typedef (DECL_NAME (template), t
);
3991 DECL_CONTEXT (type_decl
) = TYPE_CONTEXT (t
);
3992 TYPE_STUB_DECL (t
) = type_decl
;
3993 DECL_SOURCE_FILE (type_decl
)
3994 = DECL_SOURCE_FILE (TYPE_STUB_DECL (template_type
));
3995 DECL_SOURCE_LINE (type_decl
)
3996 = DECL_SOURCE_LINE (TYPE_STUB_DECL (template_type
));
3999 type_decl
= TYPE_NAME (t
);
4001 /* Set up the template information. We have to figure out which
4002 template is the immediate parent if this is a full
4004 if (parm_depth
== 1 || is_partial_instantiation
4005 || !PRIMARY_TEMPLATE_P (template))
4006 /* This case is easy; there are no member templates involved. */
4010 /* This is a full instantiation of a member template. Look
4011 for a partial instantiation of which this is an instance. */
4013 for (found
= DECL_TEMPLATE_INSTANTIATIONS (template);
4014 found
; found
= TREE_CHAIN (found
))
4017 tree tmpl
= CLASSTYPE_TI_TEMPLATE (TREE_VALUE (found
));
4019 /* We only want partial instantiations, here, not
4020 specializations or full instantiations. */
4021 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_VALUE (found
))
4022 || !uses_template_parms (TREE_VALUE (found
)))
4025 /* Temporarily reduce by one the number of levels in the
4026 ARGLIST and in FOUND so as to avoid comparing the
4027 last set of arguments. */
4028 TREE_VEC_LENGTH (arglist
)--;
4029 TREE_VEC_LENGTH (TREE_PURPOSE (found
)) --;
4031 /* See if the arguments match. If they do, then TMPL is
4032 the partial instantiation we want. */
4033 success
= comp_template_args (TREE_PURPOSE (found
), arglist
);
4035 /* Restore the argument vectors to their full size. */
4036 TREE_VEC_LENGTH (arglist
)++;
4037 TREE_VEC_LENGTH (TREE_PURPOSE (found
))++;
4048 /* There was no partial instantiation. This happens
4049 where C<T> is a member template of A<T> and it's used
4052 template <typename T> struct B { A<T>::C<int> m; };
4055 Create the partial instantiation.
4057 TREE_VEC_LENGTH (arglist
)--;
4058 template = tsubst (template, arglist
, /*complain=*/0, NULL_TREE
);
4059 TREE_VEC_LENGTH (arglist
)++;
4064 SET_TYPE_TEMPLATE_INFO (t
, tree_cons (found
, arglist
, NULL_TREE
));
4065 DECL_TEMPLATE_INSTANTIATIONS (template)
4066 = tree_cons (arglist
, t
,
4067 DECL_TEMPLATE_INSTANTIATIONS (template));
4069 if (TREE_CODE (t
) == ENUMERAL_TYPE
4070 && !is_partial_instantiation
)
4071 /* Now that the type has been registered on the instantiations
4072 list, we set up the enumerators. Because the enumeration
4073 constants may involve the enumeration type itself, we make
4074 sure to register the type first, and then create the
4075 constants. That way, doing tsubst_expr for the enumeration
4076 constants won't result in recursive calls here; we'll find
4077 the instantiation and exit above. */
4078 tsubst_enum (template_type
, t
, arglist
);
4080 /* Reset the name of the type, now that CLASSTYPE_TEMPLATE_INFO
4082 if (TREE_CODE (t
) != ENUMERAL_TYPE
)
4083 DECL_NAME (type_decl
) = classtype_mangled_name (t
);
4084 DECL_ASSEMBLER_NAME (type_decl
) = DECL_NAME (type_decl
);
4085 if (!is_partial_instantiation
)
4088 DECL_ASSEMBLER_NAME (type_decl
) = mangle_decl (type_decl
);
4090 DECL_ASSEMBLER_NAME (type_decl
)
4091 = get_identifier (build_overload_name (t
, 1, 1));
4093 /* For backwards compatibility; code that uses
4094 -fexternal-templates expects looking up a template to
4095 instantiate it. I think DDD still relies on this.
4096 (jason 8/20/1998) */
4097 if (TREE_CODE (t
) != ENUMERAL_TYPE
4098 && flag_external_templates
4099 && CLASSTYPE_INTERFACE_KNOWN (TREE_TYPE (template))
4100 && ! CLASSTYPE_INTERFACE_ONLY (TREE_TYPE (template)))
4101 add_pending_template (t
);
4104 /* If the type makes use of template parameters, the
4105 code that generates debugging information will crash. */
4106 DECL_IGNORED_P (TYPE_STUB_DECL (t
)) = 1;
4118 /* Called from for_each_template_parm via walk_tree. */
4121 for_each_template_parm_r (tp
, walk_subtrees
, d
)
4127 struct pair_fn_data
*pfd
= (struct pair_fn_data
*) d
;
4128 tree_fn_t fn
= pfd
->fn
;
4129 void *data
= pfd
->data
;
4132 && for_each_template_parm (TYPE_CONTEXT (t
), fn
, data
))
4133 return error_mark_node
;
4135 switch (TREE_CODE (t
))
4138 if (TYPE_PTRMEMFUNC_P (t
))
4144 if (!TYPE_TEMPLATE_INFO (t
))
4146 else if (for_each_template_parm (TREE_VALUE (TYPE_TEMPLATE_INFO (t
)),
4148 return error_mark_node
;
4152 /* Since we're not going to walk subtrees, we have to do this
4154 if (for_each_template_parm (TYPE_METHOD_BASETYPE (t
), fn
, data
))
4155 return error_mark_node
;
4158 /* Check the return type. */
4159 if (for_each_template_parm (TREE_TYPE (t
), fn
, data
))
4160 return error_mark_node
;
4162 /* Check the parameter types. Since default arguments are not
4163 instantiated until they are needed, the TYPE_ARG_TYPES may
4164 contain expressions that involve template parameters. But,
4165 no-one should be looking at them yet. And, once they're
4166 instantiated, they don't contain template parameters, so
4167 there's no point in looking at them then, either. */
4171 for (parm
= TYPE_ARG_TYPES (t
); parm
; parm
= TREE_CHAIN (parm
))
4172 if (for_each_template_parm (TREE_VALUE (parm
), fn
, data
))
4173 return error_mark_node
;
4175 /* Since we've already handled the TYPE_ARG_TYPES, we don't
4176 want walk_tree walking into them itself. */
4183 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
)
4184 && for_each_template_parm (DECL_TI_ARGS (t
), fn
, data
))
4185 return error_mark_node
;
4190 if (DECL_CONTEXT (t
)
4191 && for_each_template_parm (DECL_CONTEXT (t
), fn
, data
))
4192 return error_mark_node
;
4195 case BOUND_TEMPLATE_TEMPLATE_PARM
:
4196 /* Record template parameters such as `T' inside `TT<T>'. */
4197 if (for_each_template_parm (TYPE_TI_ARGS (t
), fn
, data
))
4198 return error_mark_node
;
4201 case TEMPLATE_TEMPLATE_PARM
:
4202 case TEMPLATE_TYPE_PARM
:
4203 case TEMPLATE_PARM_INDEX
:
4204 if (fn
&& (*fn
)(t
, data
))
4205 return error_mark_node
;
4207 return error_mark_node
;
4211 /* A template template parameter is encountered */
4212 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
)
4213 && for_each_template_parm (TREE_TYPE (t
), fn
, data
))
4214 return error_mark_node
;
4216 /* Already substituted template template parameter */
4221 if (!fn
|| for_each_template_parm (TYPENAME_TYPE_FULLNAME (t
), fn
, data
))
4222 return error_mark_node
;
4226 if (TREE_TYPE (t
) && TYPE_PTRMEMFUNC_P (TREE_TYPE (t
))
4227 && for_each_template_parm (TYPE_PTRMEMFUNC_FN_TYPE
4228 (TREE_TYPE (t
)), fn
, data
))
4229 return error_mark_node
;
4234 /* If there's no type, then this thing must be some expression
4235 involving template parameters. */
4236 if (!fn
&& !TREE_TYPE (t
))
4237 return error_mark_node
;
4242 case REINTERPRET_CAST_EXPR
:
4243 case CONST_CAST_EXPR
:
4244 case STATIC_CAST_EXPR
:
4245 case DYNAMIC_CAST_EXPR
:
4250 case PSEUDO_DTOR_EXPR
:
4252 return error_mark_node
;
4259 /* We didn't find any template parameters we liked. */
4263 /* For each TEMPLATE_TYPE_PARM, TEMPLATE_TEMPLATE_PARM,
4264 BOUND_TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX in T,
4265 call FN with the parameter and the DATA.
4266 If FN returns non-zero, the iteration is terminated, and
4267 for_each_template_parm returns 1. Otherwise, the iteration
4268 continues. If FN never returns a non-zero value, the value
4269 returned by for_each_template_parm is 0. If FN is NULL, it is
4270 considered to be the function which always returns 1. */
4273 for_each_template_parm (t
, fn
, data
)
4278 struct pair_fn_data pfd
;
4284 /* Walk the tree. */
4285 return walk_tree_without_duplicates (&t
,
4286 for_each_template_parm_r
,
4291 uses_template_parms (t
)
4294 return for_each_template_parm (t
, 0, 0);
4297 static int tinst_depth
;
4298 extern int max_tinst_depth
;
4299 #ifdef GATHER_STATISTICS
4302 static int tinst_level_tick
;
4303 static int last_template_error_tick
;
4305 /* We're starting to instantiate D; record the template instantiation context
4306 for diagnostics and to restore it later. */
4309 push_tinst_level (d
)
4314 if (tinst_depth
>= max_tinst_depth
)
4316 /* If the instantiation in question still has unbound template parms,
4317 we don't really care if we can't instantiate it, so just return.
4318 This happens with base instantiation for implicit `typename'. */
4319 if (uses_template_parms (d
))
4322 last_template_error_tick
= tinst_level_tick
;
4323 cp_error ("template instantiation depth exceeds maximum of %d (use -ftemplate-depth-NN to increase the maximum) instantiating `%D'",
4324 max_tinst_depth
, d
);
4326 print_instantiation_context ();
4331 new = build_expr_wfl (d
, input_filename
, lineno
, 0);
4332 TREE_CHAIN (new) = current_tinst_level
;
4333 current_tinst_level
= new;
4336 #ifdef GATHER_STATISTICS
4337 if (tinst_depth
> depth_reached
)
4338 depth_reached
= tinst_depth
;
4345 /* We're done instantiating this template; return to the instantiation
4351 tree old
= current_tinst_level
;
4353 /* Restore the filename and line number stashed away when we started
4354 this instantiation. */
4355 lineno
= TINST_LINE (old
);
4356 input_filename
= TINST_FILE (old
);
4357 extract_interface_info ();
4359 current_tinst_level
= TREE_CHAIN (old
);
4364 /* We're instantiating a deferred template; restore the template
4365 instantiation context in which the instantiation was requested, which
4366 is one step out from LEVEL. */
4369 reopen_tinst_level (level
)
4375 for (t
= level
; t
; t
= TREE_CHAIN (t
))
4378 current_tinst_level
= level
;
4382 /* Return the outermost template instantiation context, for use with
4383 -falt-external-templates. */
4388 tree p
= current_tinst_level
;
4391 for (; TREE_CHAIN (p
) ; p
= TREE_CHAIN (p
))
4396 /* DECL is a friend FUNCTION_DECL or TEMPLATE_DECL. ARGS is the
4397 vector of template arguments, as for tsubst.
4399 Returns an appropriate tsbust'd friend declaration. */
4402 tsubst_friend_function (decl
, args
)
4408 const char *file
= input_filename
;
4410 lineno
= DECL_SOURCE_LINE (decl
);
4411 input_filename
= DECL_SOURCE_FILE (decl
);
4413 if (TREE_CODE (decl
) == FUNCTION_DECL
4414 && DECL_TEMPLATE_INSTANTIATION (decl
)
4415 && TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
4416 /* This was a friend declared with an explicit template
4417 argument list, e.g.:
4421 to indicate that f was a template instantiation, not a new
4422 function declaration. Now, we have to figure out what
4423 instantiation of what template. */
4430 = lookup_template_function (tsubst_expr (DECL_TI_TEMPLATE (decl
),
4431 args
, /*complain=*/1,
4433 tsubst (DECL_TI_ARGS (decl
),
4434 args
, /*complain=*/1,
4436 new_friend
= tsubst (decl
, args
, /*complain=*/1, NULL_TREE
);
4437 tmpl
= determine_specialization (template_id
, new_friend
,
4439 /*need_member_template=*/0);
4440 new_friend
= instantiate_template (tmpl
, new_args
);
4444 new_friend
= tsubst (decl
, args
, /*complain=*/1, NULL_TREE
);
4446 /* The NEW_FRIEND will look like an instantiation, to the
4447 compiler, but is not an instantiation from the point of view of
4448 the language. For example, we might have had:
4450 template <class T> struct S {
4451 template <class U> friend void f(T, U);
4454 Then, in S<int>, template <class U> void f(int, U) is not an
4455 instantiation of anything. */
4456 DECL_USE_TEMPLATE (new_friend
) = 0;
4457 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
4459 DECL_USE_TEMPLATE (DECL_TEMPLATE_RESULT (new_friend
)) = 0;
4460 DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (new_friend
))
4461 = DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (decl
));
4464 /* The mangled name for the NEW_FRIEND is incorrect. The call to
4465 tsubst will have resulted in a call to
4466 set_mangled_name_for_template_decl. But, the function is not a
4467 template instantiation and should not be mangled like one.
4468 Therefore, we remangle the function name. We don't have to do
4469 this if the NEW_FRIEND is a template since
4470 set_mangled_name_for_template_decl doesn't do anything if the
4471 function declaration still uses template arguments. */
4472 if (TREE_CODE (new_friend
) != TEMPLATE_DECL
)
4474 set_mangled_name_for_decl (new_friend
);
4475 DECL_RTL (new_friend
) = 0;
4476 make_decl_rtl (new_friend
, NULL_PTR
, 1);
4479 if (DECL_NAMESPACE_SCOPE_P (new_friend
))
4482 tree new_friend_template_info
;
4483 tree new_friend_result_template_info
;
4485 int new_friend_is_defn
;
4487 /* We must save some information from NEW_FRIEND before calling
4488 duplicate decls since that function will free NEW_FRIEND if
4490 new_friend_template_info
= DECL_TEMPLATE_INFO (new_friend
);
4491 if (TREE_CODE (new_friend
) == TEMPLATE_DECL
)
4493 /* This declaration is a `primary' template. */
4494 DECL_PRIMARY_TEMPLATE (new_friend
) = new_friend
;
4497 = DECL_INITIAL (DECL_TEMPLATE_RESULT (new_friend
)) != NULL_TREE
;
4498 new_friend_result_template_info
4499 = DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (new_friend
));
4503 new_friend_is_defn
= DECL_INITIAL (new_friend
) != NULL_TREE
;
4504 new_friend_result_template_info
= NULL_TREE
;
4507 /* Inside pushdecl_namespace_level, we will push into the
4508 current namespace. However, the friend function should go
4509 into the namespace of the template. */
4510 ns
= decl_namespace_context (new_friend
);
4511 push_nested_namespace (ns
);
4512 old_decl
= pushdecl_namespace_level (new_friend
);
4513 pop_nested_namespace (ns
);
4515 if (old_decl
!= new_friend
)
4517 /* This new friend declaration matched an existing
4518 declaration. For example, given:
4520 template <class T> void f(T);
4521 template <class U> class C {
4522 template <class T> friend void f(T) {}
4525 the friend declaration actually provides the definition
4526 of `f', once C has been instantiated for some type. So,
4527 old_decl will be the out-of-class template declaration,
4528 while new_friend is the in-class definition.
4530 But, if `f' was called before this point, the
4531 instantiation of `f' will have DECL_TI_ARGS corresponding
4532 to `T' but not to `U', references to which might appear
4533 in the definition of `f'. Previously, the most general
4534 template for an instantiation of `f' was the out-of-class
4535 version; now it is the in-class version. Therefore, we
4536 run through all specialization of `f', adding to their
4537 DECL_TI_ARGS appropriately. In particular, they need a
4538 new set of outer arguments, corresponding to the
4539 arguments for this class instantiation.
4541 The same situation can arise with something like this:
4544 template <class T> class C {
4548 when `C<int>' is instantiated. Now, `f(int)' is defined
4551 if (!new_friend_is_defn
)
4552 /* On the other hand, if the in-class declaration does
4553 *not* provide a definition, then we don't want to alter
4554 existing definitions. We can just leave everything
4559 /* Overwrite whatever template info was there before, if
4560 any, with the new template information pertaining to
4562 DECL_TEMPLATE_INFO (old_decl
) = new_friend_template_info
;
4564 if (TREE_CODE (old_decl
) != TEMPLATE_DECL
)
4565 /* duplicate_decls will take care of this case. */
4570 tree new_friend_args
;
4572 DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (old_decl
))
4573 = new_friend_result_template_info
;
4575 new_friend_args
= TI_ARGS (new_friend_template_info
);
4576 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (old_decl
);
4580 tree spec
= TREE_VALUE (t
);
4583 = add_outermost_template_args (new_friend_args
,
4584 DECL_TI_ARGS (spec
));
4587 /* Now, since specializations are always supposed to
4588 hang off of the most general template, we must move
4590 t
= most_general_template (old_decl
);
4593 DECL_TEMPLATE_SPECIALIZATIONS (t
)
4594 = chainon (DECL_TEMPLATE_SPECIALIZATIONS (t
),
4595 DECL_TEMPLATE_SPECIALIZATIONS (old_decl
));
4596 DECL_TEMPLATE_SPECIALIZATIONS (old_decl
) = NULL_TREE
;
4601 /* The information from NEW_FRIEND has been merged into OLD_DECL
4602 by duplicate_decls. */
4603 new_friend
= old_decl
;
4606 else if (COMPLETE_TYPE_P (DECL_CONTEXT (new_friend
)))
4608 /* Check to see that the declaration is really present, and,
4609 possibly obtain an improved declaration. */
4610 tree fn
= check_classfn (DECL_CONTEXT (new_friend
),
4619 input_filename
= file
;
4623 /* FRIEND_TMPL is a friend TEMPLATE_DECL. ARGS is the vector of
4624 template arguments, as for tsubst.
4626 Returns an appropriate tsbust'd friend type or error_mark_node on
4630 tsubst_friend_class (friend_tmpl
, args
)
4637 /* First, we look for a class template. */
4638 tmpl
= lookup_name (DECL_NAME (friend_tmpl
), /*prefer_type=*/0);
4640 /* But, if we don't find one, it might be because we're in a
4641 situation like this:
4649 Here, in the scope of (say) S<int>, `S' is bound to a TYPE_DECL
4650 for `S<int>', not the TEMPLATE_DECL. */
4651 if (!tmpl
|| !DECL_CLASS_TEMPLATE_P (tmpl
))
4653 tmpl
= lookup_name (DECL_NAME (friend_tmpl
), /*prefer_type=*/1);
4654 tmpl
= maybe_get_template_decl_from_type_decl (tmpl
);
4657 if (tmpl
&& DECL_CLASS_TEMPLATE_P (tmpl
))
4659 /* The friend template has already been declared. Just
4660 check to see that the declarations match, and install any new
4661 default parameters. We must tsubst the default parameters,
4662 of course. We only need the innermost template parameters
4663 because that is all that redeclare_class_template will look
4666 = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_tmpl
),
4667 args
, /*complain=*/1);
4669 return error_mark_node
;
4670 redeclare_class_template (TREE_TYPE (tmpl
), parms
);
4671 friend_type
= TREE_TYPE (tmpl
);
4675 /* The friend template has not already been declared. In this
4676 case, the instantiation of the template class will cause the
4677 injection of this template into the global scope. */
4678 tmpl
= tsubst (friend_tmpl
, args
, /*complain=*/1, NULL_TREE
);
4680 /* The new TMPL is not an instantiation of anything, so we
4681 forget its origins. We don't reset CLASSTYPE_TI_TEMPLATE for
4682 the new type because that is supposed to be the corresponding
4683 template decl, i.e., TMPL. */
4684 DECL_USE_TEMPLATE (tmpl
) = 0;
4685 DECL_TEMPLATE_INFO (tmpl
) = NULL_TREE
;
4686 CLASSTYPE_USE_TEMPLATE (TREE_TYPE (tmpl
)) = 0;
4688 /* Inject this template into the global scope. */
4689 friend_type
= TREE_TYPE (pushdecl_top_level (tmpl
));
4696 instantiate_class_template (type
)
4699 tree
template, args
, pattern
, t
;
4702 if (type
== error_mark_node
)
4703 return error_mark_node
;
4705 if (TYPE_BEING_DEFINED (type
) || COMPLETE_TYPE_P (type
))
4708 /* Figure out which template is being instantiated. */
4709 template = most_general_template (CLASSTYPE_TI_TEMPLATE (type
));
4710 my_friendly_assert (TREE_CODE (template) == TEMPLATE_DECL
, 279);
4712 /* Figure out which arguments are being used to do the
4714 args
= CLASSTYPE_TI_ARGS (type
);
4715 PARTIAL_INSTANTIATION_P (type
) = uses_template_parms (args
);
4717 if (pedantic
&& PARTIAL_INSTANTIATION_P (type
))
4718 /* If this is a partial instantiation, then we can't instantiate
4719 the type; there's no telling whether or not one of the
4720 template parameters might eventually be instantiated to some
4721 value that results in a specialization being used. For
4733 Now, the `S<U>' in `f<int>' is the specialization, not an
4734 instantiation of the original template. */
4737 /* Determine what specialization of the original template to
4739 if (PARTIAL_INSTANTIATION_P (type
))
4740 /* There's no telling which specialization is appropriate at this
4741 point. Since all peeking at the innards of this partial
4742 instantiation are extensions (like the "implicit typename"
4743 extension, which allows users to omit the keyword `typename' on
4744 names that are declared as types in template base classes), we
4745 are free to do what we please.
4747 Trying to figure out which partial instantiation to use can
4748 cause a crash. (Some of the template arguments don't even have
4749 types.) So, we just use the most general version. */
4753 t
= most_specialized_class (template, args
);
4755 if (t
== error_mark_node
)
4757 const char *str
= "candidates are:";
4758 cp_error ("ambiguous class template instantiation for `%#T'", type
);
4759 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (template); t
;
4762 if (get_class_bindings (TREE_VALUE (t
), TREE_PURPOSE (t
),
4765 cp_error_at ("%s %+#T", str
, TREE_TYPE (t
));
4769 TYPE_BEING_DEFINED (type
) = 1;
4770 return error_mark_node
;
4775 pattern
= TREE_TYPE (t
);
4777 pattern
= TREE_TYPE (template);
4779 /* If the template we're instantiating is incomplete, then clearly
4780 there's nothing we can do. */
4781 if (!COMPLETE_TYPE_P (pattern
))
4784 /* If this is a partial instantiation, don't tsubst anything. We will
4785 only use this type for implicit typename, so the actual contents don't
4786 matter. All that matters is whether a particular name is a type. */
4787 if (PARTIAL_INSTANTIATION_P (type
))
4789 /* The fields set here must be kept in sync with those cleared
4790 in begin_class_definition. */
4791 TYPE_BINFO_BASETYPES (type
) = TYPE_BINFO_BASETYPES (pattern
);
4792 TYPE_FIELDS (type
) = TYPE_FIELDS (pattern
);
4793 TYPE_METHODS (type
) = TYPE_METHODS (pattern
);
4794 CLASSTYPE_TAGS (type
) = CLASSTYPE_TAGS (pattern
);
4795 CLASSTYPE_VBASECLASSES (type
) = CLASSTYPE_VBASECLASSES (pattern
);
4797 /* Pretend that the type is complete, so that we will look
4798 inside it during name lookup and such. */
4799 TYPE_SIZE (type
) = bitsize_zero_node
;
4803 /* If we've recursively instantiated too many templates, stop. */
4804 if (! push_tinst_level (type
))
4807 /* Now we're really doing the instantiation. Mark the type as in
4808 the process of being defined. */
4809 TYPE_BEING_DEFINED (type
) = 1;
4811 maybe_push_to_top_level (uses_template_parms (type
));
4815 /* This TYPE is actually a instantiation of of a partial
4816 specialization. We replace the innermost set of ARGS with
4817 the arguments appropriate for substitution. For example,
4820 template <class T> struct S {};
4821 template <class T> struct S<T*> {};
4823 and supposing that we are instantiating S<int*>, ARGS will
4824 present be {int*} but we need {int}. */
4826 = get_class_bindings (TREE_VALUE (t
), TREE_PURPOSE (t
),
4829 /* If there were multiple levels in ARGS, replacing the
4830 innermost level would alter CLASSTYPE_TI_ARGS, which we don't
4831 want, so we make a copy first. */
4832 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
4834 args
= copy_node (args
);
4835 SET_TMPL_ARGS_LEVEL (args
, TMPL_ARGS_DEPTH (args
), inner_args
);
4841 if (flag_external_templates
)
4843 if (flag_alt_external_templates
)
4845 CLASSTYPE_INTERFACE_ONLY (type
) = interface_only
;
4846 SET_CLASSTYPE_INTERFACE_UNKNOWN_X (type
, interface_unknown
);
4847 CLASSTYPE_VTABLE_NEEDS_WRITING (type
)
4848 = (! CLASSTYPE_INTERFACE_ONLY (type
)
4849 && CLASSTYPE_INTERFACE_KNOWN (type
));
4853 CLASSTYPE_INTERFACE_ONLY (type
) = CLASSTYPE_INTERFACE_ONLY (pattern
);
4854 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
4855 (type
, CLASSTYPE_INTERFACE_UNKNOWN (pattern
));
4856 CLASSTYPE_VTABLE_NEEDS_WRITING (type
)
4857 = (! CLASSTYPE_INTERFACE_ONLY (type
)
4858 && CLASSTYPE_INTERFACE_KNOWN (type
));
4863 SET_CLASSTYPE_INTERFACE_UNKNOWN (type
);
4864 CLASSTYPE_VTABLE_NEEDS_WRITING (type
) = 1;
4867 TYPE_HAS_CONSTRUCTOR (type
) = TYPE_HAS_CONSTRUCTOR (pattern
);
4868 TYPE_HAS_DESTRUCTOR (type
) = TYPE_HAS_DESTRUCTOR (pattern
);
4869 TYPE_OVERLOADS_CALL_EXPR (type
) = TYPE_OVERLOADS_CALL_EXPR (pattern
);
4870 TYPE_OVERLOADS_ARRAY_REF (type
) = TYPE_OVERLOADS_ARRAY_REF (pattern
);
4871 TYPE_OVERLOADS_ARROW (type
) = TYPE_OVERLOADS_ARROW (pattern
);
4872 TYPE_HAS_NEW_OPERATOR (type
) = TYPE_HAS_NEW_OPERATOR (pattern
);
4873 TYPE_HAS_ARRAY_NEW_OPERATOR (type
) = TYPE_HAS_ARRAY_NEW_OPERATOR (pattern
);
4874 TYPE_GETS_DELETE (type
) = TYPE_GETS_DELETE (pattern
);
4875 TYPE_VEC_DELETE_TAKES_SIZE (type
) = TYPE_VEC_DELETE_TAKES_SIZE (pattern
);
4876 TYPE_HAS_ASSIGN_REF (type
) = TYPE_HAS_ASSIGN_REF (pattern
);
4877 TYPE_HAS_CONST_ASSIGN_REF (type
) = TYPE_HAS_CONST_ASSIGN_REF (pattern
);
4878 TYPE_HAS_ABSTRACT_ASSIGN_REF (type
) = TYPE_HAS_ABSTRACT_ASSIGN_REF (pattern
);
4879 TYPE_HAS_INIT_REF (type
) = TYPE_HAS_INIT_REF (pattern
);
4880 TYPE_HAS_CONST_INIT_REF (type
) = TYPE_HAS_CONST_INIT_REF (pattern
);
4881 TYPE_HAS_DEFAULT_CONSTRUCTOR (type
) = TYPE_HAS_DEFAULT_CONSTRUCTOR (pattern
);
4882 TYPE_HAS_CONVERSION (type
) = TYPE_HAS_CONVERSION (pattern
);
4883 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (type
)
4884 = TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (pattern
);
4885 TYPE_USES_MULTIPLE_INHERITANCE (type
)
4886 = TYPE_USES_MULTIPLE_INHERITANCE (pattern
);
4887 TYPE_USES_VIRTUAL_BASECLASSES (type
)
4888 = TYPE_USES_VIRTUAL_BASECLASSES (pattern
);
4889 TYPE_PACKED (type
) = TYPE_PACKED (pattern
);
4890 TYPE_ALIGN (type
) = TYPE_ALIGN (pattern
);
4891 TYPE_USER_ALIGN (type
) = TYPE_USER_ALIGN (pattern
);
4892 TYPE_FOR_JAVA (type
) = TYPE_FOR_JAVA (pattern
); /* For libjava's JArray<T> */
4893 if (ANON_AGGR_TYPE_P (pattern
))
4894 SET_ANON_AGGR_TYPE_P (type
);
4896 if (TYPE_BINFO_BASETYPES (pattern
))
4898 tree base_list
= NULL_TREE
;
4899 tree pbases
= TYPE_BINFO_BASETYPES (pattern
);
4902 /* Substitute into each of the bases to determine the actual
4904 for (i
= 0; i
< TREE_VEC_LENGTH (pbases
); ++i
)
4910 pbase
= TREE_VEC_ELT (pbases
, i
);
4912 /* Substitue to figure out the base class. */
4913 base
= tsubst (BINFO_TYPE (pbase
), args
,
4914 /*complain=*/1, NULL_TREE
);
4915 if (base
== error_mark_node
)
4918 /* Calculate the correct access node. */
4919 if (TREE_VIA_VIRTUAL (pbase
))
4921 if (TREE_VIA_PUBLIC (pbase
))
4922 access
= access_public_virtual_node
;
4923 else if (TREE_VIA_PROTECTED (pbase
))
4924 access
= access_protected_virtual_node
;
4926 access
= access_private_virtual_node
;
4930 if (TREE_VIA_PUBLIC (pbase
))
4931 access
= access_public_node
;
4932 else if (TREE_VIA_PROTECTED (pbase
))
4933 access
= access_protected_node
;
4935 access
= access_private_node
;
4938 base_list
= tree_cons (access
, base
, base_list
);
4941 /* The list is now in reverse order; correct that. */
4942 base_list
= nreverse (base_list
);
4944 /* Now call xref_basetypes to set up all the base-class
4946 xref_basetypes (TREE_CODE (pattern
) == RECORD_TYPE
4947 ? (CLASSTYPE_DECLARED_CLASS (pattern
)
4948 ? class_type_node
: record_type_node
)
4950 DECL_NAME (TYPE_NAME (pattern
)),
4955 /* Now that our base classes are set up, enter the scope of the
4956 class, so that name lookups into base classes, etc. will work
4957 corectly. This is precisely analagous to what we do in
4958 begin_class_definition when defining an ordinary non-template
4960 pushclass (type
, 1);
4962 for (t
= CLASSTYPE_TAGS (pattern
); t
; t
= TREE_CHAIN (t
))
4964 tree tag
= TREE_VALUE (t
);
4965 tree name
= TYPE_IDENTIFIER (tag
);
4968 newtag
= tsubst (tag
, args
, /*complain=*/1, NULL_TREE
);
4969 if (TREE_CODE (newtag
) != ENUMERAL_TYPE
)
4971 if (TYPE_LANG_SPECIFIC (tag
) && CLASSTYPE_IS_TEMPLATE (tag
))
4972 /* Unfortunately, lookup_template_class sets
4973 CLASSTYPE_IMPLICIT_INSTANTIATION for a partial
4974 instantiation (i.e., for the type of a member template
4975 class nested within a template class.) This behavior is
4976 required for maybe_process_partial_specialization to work
4977 correctly, but is not accurate in this case; the TAG is not
4978 an instantiation of anything. (The corresponding
4979 TEMPLATE_DECL is an instantiation, but the TYPE is not.) */
4980 CLASSTYPE_USE_TEMPLATE (newtag
) = 0;
4982 /* Now, we call pushtag to put this NEWTAG into the scope of
4983 TYPE. We first set up the IDENTIFIER_TYPE_VALUE to avoid
4984 pushtag calling push_template_decl. We don't have to do
4985 this for enums because it will already have been done in
4988 SET_IDENTIFIER_TYPE_VALUE (name
, newtag
);
4989 pushtag (name
, newtag
, /*globalize=*/0);
4993 /* Don't replace enum constants here. */
4994 for (t
= TYPE_FIELDS (pattern
); t
; t
= TREE_CHAIN (t
))
4995 if (TREE_CODE (t
) != CONST_DECL
)
4999 /* The the file and line for this declaration, to assist in
5000 error message reporting. Since we called push_tinst_level
5001 above, we don't need to restore these. */
5002 lineno
= DECL_SOURCE_LINE (t
);
5003 input_filename
= DECL_SOURCE_FILE (t
);
5005 r
= tsubst (t
, args
, /*complain=*/1, NULL_TREE
);
5006 if (TREE_CODE (r
) == VAR_DECL
)
5010 if (DECL_DEFINED_IN_CLASS_P (r
))
5011 init
= tsubst_expr (DECL_INITIAL (t
), args
,
5012 /*complain=*/1, NULL_TREE
);
5016 finish_static_data_member_decl (r
, init
,
5017 /*asmspec_tree=*/NULL_TREE
,
5020 if (DECL_DEFINED_IN_CLASS_P (r
))
5021 check_static_variable_definition (r
, TREE_TYPE (r
));
5024 /* R will have a TREE_CHAIN if and only if it has already been
5025 processed by finish_member_declaration. This can happen
5026 if, for example, it is a TYPE_DECL for a class-scoped
5027 ENUMERAL_TYPE; such a thing will already have been added to
5028 the field list by tsubst_enum above. */
5029 if (!TREE_CHAIN (r
))
5031 set_current_access_from_decl (r
);
5032 finish_member_declaration (r
);
5036 /* Set up the list (TYPE_METHODS) and vector (CLASSTYPE_METHOD_VEC)
5037 for this instantiation. */
5038 for (t
= TYPE_METHODS (pattern
); t
; t
= TREE_CHAIN (t
))
5040 tree r
= tsubst (t
, args
, /*complain=*/1, NULL_TREE
);
5041 set_current_access_from_decl (r
);
5042 finish_member_declaration (r
);
5045 /* Construct the DECL_FRIENDLIST for the new class type. */
5046 typedecl
= TYPE_MAIN_DECL (type
);
5047 for (t
= DECL_FRIENDLIST (TYPE_MAIN_DECL (pattern
));
5053 for (friends
= TREE_VALUE (t
);
5054 friends
!= NULL_TREE
;
5055 friends
= TREE_CHAIN (friends
))
5056 if (TREE_PURPOSE (friends
) == error_mark_node
)
5058 tsubst_friend_function (TREE_VALUE (friends
),
5061 my_friendly_abort (20000216);
5064 for (t
= CLASSTYPE_FRIEND_CLASSES (pattern
);
5068 tree friend_type
= TREE_VALUE (t
);
5069 tree new_friend_type
;
5071 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
5072 new_friend_type
= tsubst_friend_class (friend_type
, args
);
5073 else if (uses_template_parms (friend_type
))
5074 new_friend_type
= tsubst (friend_type
, args
, /*complain=*/1,
5078 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (friend_type
));
5080 /* The call to xref_tag_from_type does injection for friend
5082 push_nested_namespace (ns
);
5084 xref_tag_from_type (friend_type
, NULL_TREE
, 1);
5085 pop_nested_namespace (ns
);
5088 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
5089 /* Trick make_friend_class into realizing that the friend
5090 we're adding is a template, not an ordinary class. It's
5091 important that we use make_friend_class since it will
5092 perform some error-checking and output cross-reference
5094 ++processing_template_decl
;
5096 if (new_friend_type
!= error_mark_node
)
5097 make_friend_class (type
, new_friend_type
);
5099 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
5100 --processing_template_decl
;
5103 for (t
= TYPE_FIELDS (type
); t
; t
= TREE_CHAIN (t
))
5104 if (TREE_CODE (t
) == FIELD_DECL
)
5106 TREE_TYPE (t
) = complete_type (TREE_TYPE (t
));
5107 require_complete_type (t
);
5110 /* Set the file and line number information to whatever is given for
5111 the class itself. This puts error messages involving generated
5112 implicit functions at a predictable point, and the same point
5113 that would be used for non-template classes. */
5114 lineno
= DECL_SOURCE_LINE (typedecl
);
5115 input_filename
= DECL_SOURCE_FILE (typedecl
);
5117 unreverse_member_declarations (type
);
5118 finish_struct_1 (type
);
5119 CLASSTYPE_GOT_SEMICOLON (type
) = 1;
5121 /* Clear this now so repo_template_used is happy. */
5122 TYPE_BEING_DEFINED (type
) = 0;
5123 repo_template_used (type
);
5125 /* Now that the class is complete, instantiate default arguments for
5126 any member functions. We don't do this earlier because the
5127 default arguments may reference members of the class. */
5128 if (!PRIMARY_TEMPLATE_P (template))
5129 for (t
= TYPE_METHODS (type
); t
; t
= TREE_CHAIN (t
))
5130 if (TREE_CODE (t
) == FUNCTION_DECL
5131 /* Implicitly generated member functions will not have tmplate
5132 information; they are not instantiations, but instead are
5133 created "fresh" for each instantiation. */
5134 && DECL_TEMPLATE_INFO (t
))
5135 tsubst_default_arguments (t
);
5138 pop_from_top_level ();
5148 if (t1
== NULL_TREE
)
5149 return t2
== NULL_TREE
;
5150 if (t2
== NULL_TREE
)
5152 /* Don't care if one declares its arg const and the other doesn't -- the
5153 main variant of the arg type is all that matters. */
5154 if (TYPE_MAIN_VARIANT (TREE_VALUE (t1
))
5155 != TYPE_MAIN_VARIANT (TREE_VALUE (t2
)))
5157 return list_eq (TREE_CHAIN (t1
), TREE_CHAIN (t2
));
5160 /* If arg is a non-type template parameter that does not depend on template
5161 arguments, fold it like we weren't in the body of a template. */
5164 maybe_fold_nontype_arg (arg
)
5167 /* If we're not in a template, ARG is already as simple as it's going to
5168 get, and trying to reprocess the trees will break. */
5169 if (! processing_template_decl
)
5172 if (!TYPE_P (arg
) && !uses_template_parms (arg
))
5174 /* Sometimes, one of the args was an expression involving a
5175 template constant parameter, like N - 1. Now that we've
5176 tsubst'd, we might have something like 2 - 1. This will
5177 confuse lookup_template_class, so we do constant folding
5178 here. We have to unset processing_template_decl, to
5179 fool build_expr_from_tree() into building an actual
5182 int saved_processing_template_decl
= processing_template_decl
;
5183 processing_template_decl
= 0;
5184 arg
= fold (build_expr_from_tree (arg
));
5185 processing_template_decl
= saved_processing_template_decl
;
5190 /* Substitute ARGS into the vector of template arguments T. */
5193 tsubst_template_arg_vector (t
, args
, complain
)
5198 int len
= TREE_VEC_LENGTH (t
), need_new
= 0, i
;
5199 tree
*elts
= (tree
*) alloca (len
* sizeof (tree
));
5201 memset ((char *) elts
, 0, len
* sizeof (tree
));
5203 for (i
= 0; i
< len
; i
++)
5205 if (TREE_VEC_ELT (t
, i
) != NULL_TREE
5206 && TREE_CODE (TREE_VEC_ELT (t
, i
)) == TREE_VEC
)
5207 elts
[i
] = tsubst_template_arg_vector (TREE_VEC_ELT (t
, i
),
5210 elts
[i
] = maybe_fold_nontype_arg
5211 (tsubst_expr (TREE_VEC_ELT (t
, i
), args
, complain
,
5214 if (elts
[i
] == error_mark_node
)
5215 return error_mark_node
;
5217 if (elts
[i
] != TREE_VEC_ELT (t
, i
))
5224 t
= make_tree_vec (len
);
5225 for (i
= 0; i
< len
; i
++)
5226 TREE_VEC_ELT (t
, i
) = elts
[i
];
5231 /* Return the result of substituting ARGS into the template parameters
5232 given by PARMS. If there are m levels of ARGS and m + n levels of
5233 PARMS, then the result will contain n levels of PARMS. For
5234 example, if PARMS is `template <class T> template <class U>
5235 template <T*, U, class V>' and ARGS is {{int}, {double}} then the
5236 result will be `template <int*, double, class V>'. */
5239 tsubst_template_parms (parms
, args
, complain
)
5247 for (new_parms
= &r
;
5248 TMPL_PARMS_DEPTH (parms
) > TMPL_ARGS_DEPTH (args
);
5249 new_parms
= &(TREE_CHAIN (*new_parms
)),
5250 parms
= TREE_CHAIN (parms
))
5253 make_tree_vec (TREE_VEC_LENGTH (TREE_VALUE (parms
)));
5256 for (i
= 0; i
< TREE_VEC_LENGTH (new_vec
); ++i
)
5258 tree default_value
=
5259 TREE_PURPOSE (TREE_VEC_ELT (TREE_VALUE (parms
), i
));
5261 TREE_VALUE (TREE_VEC_ELT (TREE_VALUE (parms
), i
));
5263 TREE_VEC_ELT (new_vec
, i
)
5264 = build_tree_list (tsubst (default_value
, args
, complain
,
5266 tsubst (parm_decl
, args
, complain
,
5271 tree_cons (build_int_2 (0, (TMPL_PARMS_DEPTH (parms
)
5272 - TMPL_ARGS_DEPTH (args
))),
5273 new_vec
, NULL_TREE
);
5279 /* Substitute the ARGS into the indicated aggregate (or enumeration)
5280 type T. If T is not an aggregate or enumeration type, it is
5281 handled as if by tsubst. IN_DECL is as for tsubst. If
5282 ENTERING_SCOPE is non-zero, T is the context for a template which
5283 we are presently tsubst'ing. Return the subsituted value. */
5286 tsubst_aggr_type (t
, args
, complain
, in_decl
, entering_scope
)
5296 switch (TREE_CODE (t
))
5299 if (TYPE_PTRMEMFUNC_P (t
))
5301 tree r
= build_ptrmemfunc_type
5302 (tsubst (TYPE_PTRMEMFUNC_FN_TYPE (t
), args
, complain
, in_decl
));
5303 return cp_build_qualified_type_real (r
, TYPE_QUALS (t
),
5307 /* else fall through */
5310 if (TYPE_TEMPLATE_INFO (t
))
5316 /* First, determine the context for the type we are looking
5318 if (TYPE_CONTEXT (t
) != NULL_TREE
)
5319 context
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
,
5321 in_decl
, /*entering_scope=*/1);
5323 context
= NULL_TREE
;
5325 /* Then, figure out what arguments are appropriate for the
5326 type we are trying to find. For example, given:
5328 template <class T> struct S;
5329 template <class T, class U> void f(T, U) { S<U> su; }
5331 and supposing that we are instantiating f<int, double>,
5332 then our ARGS will be {int, double}, but, when looking up
5333 S we only want {double}. */
5334 argvec
= tsubst_template_arg_vector (TYPE_TI_ARGS (t
), args
,
5336 if (argvec
== error_mark_node
)
5337 return error_mark_node
;
5339 r
= lookup_template_class (t
, argvec
, in_decl
, context
,
5342 return cp_build_qualified_type_real (r
, TYPE_QUALS (t
),
5346 /* This is not a template type, so there's nothing to do. */
5350 return tsubst (t
, args
, complain
, in_decl
);
5354 /* Substitute into the default argument ARG (a default argument for
5355 FN), which has the indicated TYPE. */
5358 tsubst_default_argument (fn
, type
, arg
)
5363 /* This default argument came from a template. Instantiate the
5364 default argument here, not in tsubst. In the case of
5373 we must be careful to do name lookup in the scope of S<T>,
5374 rather than in the current class. */
5375 if (DECL_CLASS_SCOPE_P (fn
))
5376 pushclass (DECL_CONTEXT (fn
), 2);
5378 arg
= tsubst_expr (arg
, DECL_TI_ARGS (fn
), /*complain=*/1, NULL_TREE
);
5380 if (DECL_CLASS_SCOPE_P (fn
))
5383 /* Make sure the default argument is reasonable. */
5384 arg
= check_default_argument (type
, arg
);
5389 /* Substitute into all the default arguments for FN. */
5392 tsubst_default_arguments (fn
)
5398 tmpl_args
= DECL_TI_ARGS (fn
);
5400 /* If this function is not yet instantiated, we certainly don't need
5401 its default arguments. */
5402 if (uses_template_parms (tmpl_args
))
5405 for (arg
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
5407 arg
= TREE_CHAIN (arg
))
5408 if (TREE_PURPOSE (arg
))
5409 TREE_PURPOSE (arg
) = tsubst_default_argument (fn
,
5411 TREE_PURPOSE (arg
));
5414 /* Substitute the ARGS into the T, which is a _DECL. TYPE is the
5415 (already computed) substitution of ARGS into TREE_TYPE (T), if
5416 appropriate. Return the result of the substitution. IN_DECL is as
5420 tsubst_decl (t
, args
, type
, in_decl
)
5427 const char *saved_filename
;
5430 /* Set the filename and linenumber to improve error-reporting. */
5431 saved_lineno
= lineno
;
5432 saved_filename
= input_filename
;
5433 lineno
= DECL_SOURCE_LINE (t
);
5434 input_filename
= DECL_SOURCE_FILE (t
);
5436 switch (TREE_CODE (t
))
5440 /* We can get here when processing a member template function
5441 of a template class. */
5442 tree decl
= DECL_TEMPLATE_RESULT (t
);
5444 int is_template_template_parm
= DECL_TEMPLATE_TEMPLATE_PARM_P (t
);
5446 if (!is_template_template_parm
)
5448 /* We might already have an instance of this template.
5449 The ARGS are for the surrounding class type, so the
5450 full args contain the tsubst'd args for the context,
5451 plus the innermost args from the template decl. */
5452 tree tmpl_args
= DECL_CLASS_TEMPLATE_P (t
)
5453 ? CLASSTYPE_TI_ARGS (TREE_TYPE (t
))
5454 : DECL_TI_ARGS (DECL_TEMPLATE_RESULT (t
));
5457 full_args
= tsubst_template_arg_vector (tmpl_args
, args
,
5460 /* tsubst_template_arg_vector doesn't copy the vector if
5461 nothing changed. But, *something* should have
5463 my_friendly_assert (full_args
!= tmpl_args
, 0);
5465 spec
= retrieve_specialization (t
, full_args
);
5466 if (spec
!= NULL_TREE
)
5473 /* Make a new template decl. It will be similar to the
5474 original, but will record the current template arguments.
5475 We also create a new function declaration, which is just
5476 like the old one, but points to this new template, rather
5477 than the old one. */
5479 my_friendly_assert (DECL_LANG_SPECIFIC (r
) != 0, 0);
5480 TREE_CHAIN (r
) = NULL_TREE
;
5482 if (is_template_template_parm
)
5484 tree new_decl
= tsubst (decl
, args
, /*complain=*/1, in_decl
);
5485 DECL_TEMPLATE_RESULT (r
) = new_decl
;
5486 TREE_TYPE (r
) = TREE_TYPE (new_decl
);
5491 = tsubst_aggr_type (DECL_CONTEXT (t
), args
,
5492 /*complain=*/1, in_decl
,
5493 /*entering_scope=*/1);
5494 DECL_VIRTUAL_CONTEXT (r
)
5495 = tsubst_aggr_type (DECL_VIRTUAL_CONTEXT (t
), args
,
5496 /*complain=*/1, in_decl
,
5497 /*entering_scope=*/1);
5498 DECL_TEMPLATE_INFO (r
) = build_tree_list (t
, args
);
5500 if (TREE_CODE (decl
) == TYPE_DECL
)
5502 tree new_type
= tsubst (TREE_TYPE (t
), args
,
5503 /*complain=*/1, in_decl
);
5504 TREE_TYPE (r
) = new_type
;
5505 CLASSTYPE_TI_TEMPLATE (new_type
) = r
;
5506 DECL_TEMPLATE_RESULT (r
) = TYPE_MAIN_DECL (new_type
);
5507 DECL_TI_ARGS (r
) = CLASSTYPE_TI_ARGS (new_type
);
5511 tree new_decl
= tsubst (decl
, args
, /*complain=*/1, in_decl
);
5513 DECL_TEMPLATE_RESULT (r
) = new_decl
;
5514 DECL_TI_TEMPLATE (new_decl
) = r
;
5515 TREE_TYPE (r
) = TREE_TYPE (new_decl
);
5516 DECL_TI_ARGS (r
) = DECL_TI_ARGS (new_decl
);
5519 SET_DECL_IMPLICIT_INSTANTIATION (r
);
5520 DECL_TEMPLATE_INSTANTIATIONS (r
) = NULL_TREE
;
5521 DECL_TEMPLATE_SPECIALIZATIONS (r
) = NULL_TREE
;
5523 /* The template parameters for this new template are all the
5524 template parameters for the old template, except the
5525 outermost level of parameters. */
5526 DECL_TEMPLATE_PARMS (r
)
5527 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t
), args
,
5530 if (PRIMARY_TEMPLATE_P (t
))
5531 DECL_PRIMARY_TEMPLATE (r
) = r
;
5533 /* We don't partially instantiate partial specializations. */
5534 if (TREE_CODE (decl
) == TYPE_DECL
)
5537 /* Record this partial instantiation. */
5538 register_specialization (r
, t
,
5539 DECL_TI_ARGS (DECL_TEMPLATE_RESULT (r
)));
5547 tree argvec
= NULL_TREE
;
5554 /* Nobody should be tsubst'ing into non-template functions. */
5555 my_friendly_assert (DECL_TEMPLATE_INFO (t
) != NULL_TREE
, 0);
5557 if (TREE_CODE (DECL_TI_TEMPLATE (t
)) == TEMPLATE_DECL
)
5561 /* Calculate the most general template of which R is a
5562 specialization, and the complete set of arguments used to
5564 gen_tmpl
= most_general_template (DECL_TI_TEMPLATE (t
));
5566 = tsubst_template_arg_vector (DECL_TI_ARGS
5567 (DECL_TEMPLATE_RESULT (gen_tmpl
)),
5568 args
, /*complain=*/1);
5570 /* Check to see if we already have this specialization. */
5571 spec
= retrieve_specialization (gen_tmpl
, argvec
);
5579 /* We can see more levels of arguments than parameters if
5580 there was a specialization of a member template, like
5583 template <class T> struct S { template <class U> void f(); }
5584 template <> template <class U> void S<int>::f(U);
5586 Here, we'll be subtituting into the specialization,
5587 because that's where we can find the code we actually
5588 want to generate, but we'll have enough arguments for
5589 the most general template.
5591 We also deal with the peculiar case:
5593 template <class T> struct S {
5594 template <class U> friend void f();
5596 template <class U> void f() {}
5598 template void f<double>();
5600 Here, the ARGS for the instantiation of will be {int,
5601 double}. But, we only need as many ARGS as there are
5602 levels of template parameters in CODE_PATTERN. We are
5603 careful not to get fooled into reducing the ARGS in
5606 template <class T> struct S { template <class U> void f(U); }
5607 template <class T> template <> void S<T>::f(int) {}
5609 which we can spot because the pattern will be a
5610 specialization in this case. */
5611 args_depth
= TMPL_ARGS_DEPTH (args
);
5613 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (t
)));
5614 if (args_depth
> parms_depth
5615 && !DECL_TEMPLATE_SPECIALIZATION (t
))
5616 args
= get_innermost_template_args (args
, parms_depth
);
5620 /* This special case arises when we have something like this:
5622 template <class T> struct S {
5623 friend void f<int>(int, double);
5626 Here, the DECL_TI_TEMPLATE for the friend declaration
5627 will be a LOOKUP_EXPR or an IDENTIFIER_NODE. We are
5628 being called from tsubst_friend_function, and we want
5629 only to create a new decl (R) with appropriate types so
5630 that we can call determine_specialization. */
5631 my_friendly_assert ((TREE_CODE (DECL_TI_TEMPLATE (t
))
5633 || (TREE_CODE (DECL_TI_TEMPLATE (t
))
5634 == IDENTIFIER_NODE
), 0);
5635 gen_tmpl
= NULL_TREE
;
5638 if (DECL_CLASS_SCOPE_P (t
))
5640 if (DECL_NAME (t
) == constructor_name (DECL_CONTEXT (t
)))
5644 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
,
5646 /*entering_scope=*/1);
5651 ctx
= DECL_CONTEXT (t
);
5653 type
= tsubst (type
, args
, /*complain=*/1, in_decl
);
5654 if (type
== error_mark_node
)
5655 return error_mark_node
;
5657 /* We do NOT check for matching decls pushed separately at this
5658 point, as they may not represent instantiations of this
5659 template, and in any case are considered separate under the
5662 DECL_USE_TEMPLATE (r
) = 0;
5663 TREE_TYPE (r
) = type
;
5665 DECL_CONTEXT (r
) = ctx
;
5666 DECL_VIRTUAL_CONTEXT (r
)
5667 = tsubst_aggr_type (DECL_VIRTUAL_CONTEXT (t
), args
,
5669 /*entering_scope=*/1);
5671 if (member
&& DECL_CONV_FN_P (r
))
5673 /* Type-conversion operator. Reconstruct the name, in
5674 case it's the name of one of the template's parameters. */
5676 DECL_NAME (r
) = mangle_conv_op_name_for_type (TREE_TYPE (type
));
5678 DECL_NAME (r
) = build_typename_overload (TREE_TYPE (type
));
5681 DECL_ARGUMENTS (r
) = tsubst (DECL_ARGUMENTS (t
), args
,
5683 DECL_TEMPLATE_RESULT (r
) = NULL_TREE
;
5685 TREE_STATIC (r
) = 0;
5686 TREE_PUBLIC (r
) = TREE_PUBLIC (t
);
5687 DECL_EXTERNAL (r
) = 1;
5688 DECL_INTERFACE_KNOWN (r
) = 0;
5689 DECL_DEFER_OUTPUT (r
) = 0;
5690 TREE_CHAIN (r
) = NULL_TREE
;
5691 DECL_PENDING_INLINE_INFO (r
) = 0;
5692 DECL_PENDING_INLINE_P (r
) = 0;
5693 DECL_SAVED_TREE (r
) = NULL_TREE
;
5695 if (DECL_CLONED_FUNCTION (r
))
5697 DECL_CLONED_FUNCTION (r
) = tsubst (DECL_CLONED_FUNCTION (t
),
5698 args
, /*complain=*/1, t
);
5699 TREE_CHAIN (r
) = TREE_CHAIN (DECL_CLONED_FUNCTION (r
));
5700 TREE_CHAIN (DECL_CLONED_FUNCTION (r
)) = r
;
5703 /* Set up the DECL_TEMPLATE_INFO for R and compute its mangled
5704 name. There's no need to do this in the special friend
5705 case mentioned above where GEN_TMPL is NULL. */
5708 DECL_TEMPLATE_INFO (r
)
5709 = tree_cons (gen_tmpl
, argvec
, NULL_TREE
);
5710 SET_DECL_IMPLICIT_INSTANTIATION (r
);
5711 register_specialization (r
, gen_tmpl
, argvec
);
5713 /* Set the mangled name for R. */
5714 if (DECL_DESTRUCTOR_P (t
))
5717 set_mangled_name_for_decl (r
);
5719 DECL_ASSEMBLER_NAME (r
) = build_destructor_name (ctx
);
5723 /* Instantiations of template functions must be mangled
5724 specially, in order to conform to 14.5.5.1
5725 [temp.over.link]. */
5726 tree tmpl
= DECL_TI_TEMPLATE (t
);
5728 /* TMPL will be NULL if this is a specialization of a
5729 member function of a template class. */
5730 if (name_mangling_version
< 1
5731 || tmpl
== NULL_TREE
5732 || (member
&& !is_member_template (tmpl
)
5733 && !DECL_TEMPLATE_INFO (tmpl
)))
5734 set_mangled_name_for_decl (r
);
5736 set_mangled_name_for_template_decl (r
);
5740 make_decl_rtl (r
, NULL_PTR
, 1);
5742 /* Like grokfndecl. If we don't do this, pushdecl will
5743 mess up our TREE_CHAIN because it doesn't find a
5744 previous decl. Sigh. */
5746 && ! uses_template_parms (r
)
5747 && (IDENTIFIER_GLOBAL_VALUE (DECL_ASSEMBLER_NAME (r
))
5749 SET_IDENTIFIER_GLOBAL_VALUE (DECL_ASSEMBLER_NAME (r
), r
);
5751 /* We're not supposed to instantiate default arguments
5752 until they are called, for a template. But, for a
5755 template <class T> void f ()
5756 { extern void g(int i = T()); }
5758 we should do the substitution when the template is
5759 instantiated. We handle the member function case in
5760 instantiate_class_template since the default arguments
5761 might refer to other members of the class. */
5763 && !PRIMARY_TEMPLATE_P (gen_tmpl
)
5764 && !uses_template_parms (argvec
))
5765 tsubst_default_arguments (r
);
5768 /* Copy the list of befriending classes. */
5769 for (friends
= &DECL_BEFRIENDING_CLASSES (r
);
5771 friends
= &TREE_CHAIN (*friends
))
5773 *friends
= copy_node (*friends
);
5774 TREE_VALUE (*friends
) = tsubst (TREE_VALUE (*friends
),
5775 args
, /*complain=*/1,
5779 if (DECL_CONSTRUCTOR_P (r
) || DECL_DESTRUCTOR_P (r
))
5781 maybe_retrofit_in_chrg (r
);
5782 if (DECL_CONSTRUCTOR_P (r
))
5783 grok_ctor_properties (ctx
, r
);
5785 else if (IDENTIFIER_OPNAME_P (DECL_NAME (r
)))
5786 grok_op_properties (r
, DECL_VIRTUAL_P (r
), DECL_FRIEND_P (r
));
5793 TREE_TYPE (r
) = type
;
5794 c_apply_type_quals_to_decl (CP_TYPE_QUALS (type
), r
);
5796 if (TREE_CODE (DECL_INITIAL (r
)) != TEMPLATE_PARM_INDEX
)
5797 DECL_INITIAL (r
) = TREE_TYPE (r
);
5799 DECL_INITIAL (r
) = tsubst (DECL_INITIAL (r
), args
,
5800 /*complain=*/1, in_decl
);
5802 DECL_CONTEXT (r
) = NULL_TREE
;
5803 if (PROMOTE_PROTOTYPES
5804 && (TREE_CODE (type
) == INTEGER_TYPE
5805 || TREE_CODE (type
) == ENUMERAL_TYPE
)
5806 && TYPE_PRECISION (type
) < TYPE_PRECISION (integer_type_node
))
5807 DECL_ARG_TYPE (r
) = integer_type_node
;
5809 TREE_CHAIN (r
) = tsubst (TREE_CHAIN (t
), args
,
5810 /*complain=*/1, TREE_CHAIN (t
));
5817 TREE_TYPE (r
) = type
;
5818 c_apply_type_quals_to_decl (CP_TYPE_QUALS (type
), r
);
5820 /* We don't have to set DECL_CONTEXT here; it is set by
5821 finish_member_declaration. */
5822 DECL_INITIAL (r
) = tsubst_expr (DECL_INITIAL (t
), args
,
5823 /*complain=*/1, in_decl
);
5824 TREE_CHAIN (r
) = NULL_TREE
;
5825 if (TREE_CODE (type
) == VOID_TYPE
)
5826 cp_error_at ("instantiation of `%D' as type void", r
);
5834 = tsubst_copy (DECL_INITIAL (t
), args
, /*complain=*/1, in_decl
);
5835 TREE_CHAIN (r
) = NULL_TREE
;
5840 if (TREE_CODE (type
) == TEMPLATE_TEMPLATE_PARM
5841 || t
== TYPE_MAIN_DECL (TREE_TYPE (t
)))
5843 /* If this is the canonical decl, we don't have to mess with
5844 instantiations, and often we can't (for typename, template
5845 type parms and such). Note that TYPE_NAME is not correct for
5846 the above test if we've copied the type for a typedef. */
5847 r
= TYPE_NAME (type
);
5855 tree argvec
= NULL_TREE
;
5856 tree gen_tmpl
= NULL_TREE
;
5858 tree tmpl
= NULL_TREE
;
5862 /* Assume this is a non-local variable. */
5865 if (TYPE_P (CP_DECL_CONTEXT (t
)))
5866 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
,
5868 in_decl
, /*entering_scope=*/1);
5871 /* Subsequent calls to pushdecl will fill this in. */
5873 if (!DECL_NAMESPACE_SCOPE_P (t
))
5877 /* Check to see if we already have this specialization. */
5880 tmpl
= DECL_TI_TEMPLATE (t
);
5881 gen_tmpl
= most_general_template (tmpl
);
5882 argvec
= tsubst (DECL_TI_ARGS (t
), args
, /*complain=*/1, in_decl
);
5883 spec
= retrieve_specialization (gen_tmpl
, argvec
);
5886 spec
= retrieve_local_specialization (t
);
5895 TREE_TYPE (r
) = type
;
5896 c_apply_type_quals_to_decl (CP_TYPE_QUALS (type
), r
);
5897 DECL_CONTEXT (r
) = ctx
;
5899 /* Don't try to expand the initializer until someone tries to use
5900 this variable; otherwise we run into circular dependencies. */
5901 DECL_INITIAL (r
) = NULL_TREE
;
5903 DECL_SIZE (r
) = DECL_SIZE_UNIT (r
) = 0;
5905 /* For __PRETTY_FUNCTION__ we have to adjust the initializer. */
5906 if (DECL_PRETTY_FUNCTION_P (r
))
5908 DECL_INITIAL (r
) = tsubst (DECL_INITIAL (t
),
5912 TREE_TYPE (r
) = TREE_TYPE (DECL_INITIAL (r
));
5915 /* Even if the original location is out of scope, the newly
5916 substituted one is not. */
5917 if (TREE_CODE (r
) == VAR_DECL
)
5918 DECL_DEAD_FOR_LOCAL (r
) = 0;
5922 /* A static data member declaration is always marked
5923 external when it is declared in-class, even if an
5924 initializer is present. We mimic the non-template
5926 DECL_EXTERNAL (r
) = 1;
5928 register_specialization (r
, gen_tmpl
, argvec
);
5929 DECL_TEMPLATE_INFO (r
) = tree_cons (tmpl
, argvec
, NULL_TREE
);
5930 SET_DECL_IMPLICIT_INSTANTIATION (r
);
5933 register_local_specialization (r
, t
);
5935 TREE_CHAIN (r
) = NULL_TREE
;
5936 if (TREE_CODE (r
) == VAR_DECL
&& TREE_CODE (type
) == VOID_TYPE
)
5937 cp_error_at ("instantiation of `%D' as type void", r
);
5942 my_friendly_abort (0);
5945 /* Restore the file and line information. */
5946 lineno
= saved_lineno
;
5947 input_filename
= saved_filename
;
5952 /* Substitue into the ARG_TYPES of a function type. */
5955 tsubst_arg_types (arg_types
, args
, complain
, in_decl
)
5961 tree remaining_arg_types
;
5964 if (!arg_types
|| arg_types
== void_list_node
)
5967 remaining_arg_types
= tsubst_arg_types (TREE_CHAIN (arg_types
),
5968 args
, complain
, in_decl
);
5969 if (remaining_arg_types
== error_mark_node
)
5970 return error_mark_node
;
5972 type
= tsubst (TREE_VALUE (arg_types
), args
, complain
, in_decl
);
5973 if (type
== error_mark_node
)
5974 return error_mark_node
;
5976 /* Do array-to-pointer, function-to-pointer conversion, and ignore
5977 top-level qualifiers as required. */
5978 type
= TYPE_MAIN_VARIANT (type_decays_to (type
));
5980 /* Note that we do not substitute into default arguments here. The
5981 standard mandates that they be instantiated only when needed,
5982 which is done in build_over_call. */
5983 return hash_tree_cons (TREE_PURPOSE (arg_types
), type
,
5984 remaining_arg_types
);
5988 /* Substitute into a FUNCTION_TYPE or METHOD_TYPE. This routine does
5989 *not* handle the exception-specification for FNTYPE, because the
5990 initial substitution of explicitly provided template parameters
5991 during argument deduction forbids substitution into the
5992 exception-specification:
5996 All references in the function type of the function template to the
5997 corresponding template parameters are replaced by the specified tem-
5998 plate argument values. If a substitution in a template parameter or
5999 in the function type of the function template results in an invalid
6000 type, type deduction fails. [Note: The equivalent substitution in
6001 exception specifications is done only when the function is instanti-
6002 ated, at which point a program is ill-formed if the substitution
6003 results in an invalid type.] */
6006 tsubst_function_type (t
, args
, complain
, in_decl
)
6016 /* The TYPE_CONTEXT is not used for function/method types. */
6017 my_friendly_assert (TYPE_CONTEXT (t
) == NULL_TREE
, 0);
6019 /* Substitue the return type. */
6020 return_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
6021 if (return_type
== error_mark_node
)
6022 return error_mark_node
;
6024 /* Substitue the argument types. */
6025 arg_types
= tsubst_arg_types (TYPE_ARG_TYPES (t
), args
,
6027 if (arg_types
== error_mark_node
)
6028 return error_mark_node
;
6030 /* Construct a new type node and return it. */
6031 if (TREE_CODE (t
) == FUNCTION_TYPE
)
6032 fntype
= build_function_type (return_type
, arg_types
);
6035 tree r
= TREE_TYPE (TREE_VALUE (arg_types
));
6036 if (! IS_AGGR_TYPE (r
))
6040 Type deduction may fail for any of the following
6043 -- Attempting to create "pointer to member of T" when T
6044 is not a class type. */
6046 cp_error ("creating pointer to member function of non-class type `%T'",
6048 return error_mark_node
;
6051 fntype
= build_cplus_method_type (r
, return_type
, TREE_CHAIN
6054 fntype
= build_qualified_type (fntype
, TYPE_QUALS (t
));
6055 fntype
= build_type_attribute_variant (fntype
, TYPE_ATTRIBUTES (t
));
6060 /* Substitute into the PARMS of a call-declarator. */
6063 tsubst_call_declarator_parms (parms
, args
, complain
, in_decl
)
6073 if (!parms
|| parms
== void_list_node
)
6076 new_parms
= tsubst_call_declarator_parms (TREE_CHAIN (parms
),
6077 args
, complain
, in_decl
);
6079 /* Figure out the type of this parameter. */
6080 type
= tsubst (TREE_VALUE (parms
), args
, complain
, in_decl
);
6082 /* Figure out the default argument as well. Note that we use
6083 tsubst_expr since the default argument is really an expression. */
6084 defarg
= tsubst_expr (TREE_PURPOSE (parms
), args
, complain
, in_decl
);
6086 /* Chain this parameter on to the front of those we have already
6087 processed. We don't use hash_tree_cons because that function
6088 doesn't check TREE_PARMLIST. */
6089 new_parms
= tree_cons (defarg
, type
, new_parms
);
6091 /* And note that these are parameters. */
6092 TREE_PARMLIST (new_parms
) = 1;
6097 /* Take the tree structure T and replace template parameters used
6098 therein with the argument vector ARGS. IN_DECL is an associated
6099 decl for diagnostics. If an error occurs, returns ERROR_MARK_NODE.
6100 An appropriate error message is issued only if COMPLAIN is
6101 non-zero. Note that we must be relatively non-tolerant of
6102 extensions here, in order to preserve conformance; if we allow
6103 substitutions that should not be allowed, we may allow argument
6104 deductions that should not succeed, and therefore report ambiguous
6105 overload situations where there are none. In theory, we could
6106 allow the substitution, but indicate that it should have failed,
6107 and allow our caller to make sure that the right thing happens, but
6108 we don't try to do this yet.
6110 This function is used for dealing with types, decls and the like;
6111 for expressions, use tsubst_expr or tsubst_copy. */
6114 tsubst (t
, args
, complain
, in_decl
)
6121 if (t
== NULL_TREE
|| t
== error_mark_node
6122 || t
== integer_type_node
6123 || t
== void_type_node
6124 || t
== char_type_node
6125 || TREE_CODE (t
) == NAMESPACE_DECL
)
6128 if (TREE_CODE (t
) == IDENTIFIER_NODE
)
6129 type
= IDENTIFIER_TYPE_VALUE (t
);
6131 type
= TREE_TYPE (t
);
6132 if (type
== unknown_type_node
)
6133 my_friendly_abort (42);
6135 if (type
&& TREE_CODE (t
) != FUNCTION_DECL
6136 && TREE_CODE (t
) != TYPENAME_TYPE
6137 && TREE_CODE (t
) != TEMPLATE_DECL
6138 && TREE_CODE (t
) != IDENTIFIER_NODE
6139 && TREE_CODE (t
) != FUNCTION_TYPE
6140 && TREE_CODE (t
) != METHOD_TYPE
)
6141 type
= tsubst (type
, args
, complain
, in_decl
);
6142 if (type
== error_mark_node
)
6143 return error_mark_node
;
6146 return tsubst_decl (t
, args
, type
, in_decl
);
6148 switch (TREE_CODE (t
))
6153 return tsubst_aggr_type (t
, args
, complain
, in_decl
,
6154 /*entering_scope=*/0);
6157 case IDENTIFIER_NODE
:
6169 if (t
== integer_type_node
)
6172 if (TREE_CODE (TYPE_MIN_VALUE (t
)) == INTEGER_CST
6173 && TREE_CODE (TYPE_MAX_VALUE (t
)) == INTEGER_CST
)
6177 tree max
, omax
= TREE_OPERAND (TYPE_MAX_VALUE (t
), 0);
6179 max
= tsubst_expr (omax
, args
, complain
, in_decl
);
6180 if (max
== error_mark_node
)
6181 return error_mark_node
;
6183 /* See if we can reduce this expression to something simpler. */
6184 max
= maybe_fold_nontype_arg (max
);
6185 if (!processing_template_decl
)
6186 max
= decl_constant_value (max
);
6188 if (processing_template_decl
6189 /* When providing explicit arguments to a template
6190 function, but leaving some arguments for subsequent
6191 deduction, MAX may be template-dependent even if we're
6192 not PROCESSING_TEMPLATE_DECL. We still need to check for
6193 template parms, though; MAX won't be an INTEGER_CST for
6194 dynamic arrays, either. */
6195 || (TREE_CODE (max
) != INTEGER_CST
6196 && uses_template_parms (max
)))
6198 tree itype
= make_node (INTEGER_TYPE
);
6199 TYPE_MIN_VALUE (itype
) = size_zero_node
;
6200 TYPE_MAX_VALUE (itype
) = build_min (MINUS_EXPR
, sizetype
, max
,
6205 if (integer_zerop (omax
))
6207 /* Still allow an explicit array of size zero. */
6209 pedwarn ("creating array with size zero");
6211 else if (integer_zerop (max
)
6212 || (TREE_CODE (max
) == INTEGER_CST
6213 && INT_CST_LT (max
, integer_zero_node
)))
6217 Type deduction may fail for any of the following
6220 Attempting to create an array with a size that is
6221 zero or negative. */
6223 cp_error ("creating array with size zero (`%E')", max
);
6225 return error_mark_node
;
6228 return compute_array_index_type (NULL_TREE
, max
);
6231 case TEMPLATE_TYPE_PARM
:
6232 case TEMPLATE_TEMPLATE_PARM
:
6233 case BOUND_TEMPLATE_TEMPLATE_PARM
:
6234 case TEMPLATE_PARM_INDEX
:
6242 if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
6243 || TREE_CODE (t
) == TEMPLATE_TEMPLATE_PARM
6244 || TREE_CODE (t
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
6246 idx
= TEMPLATE_TYPE_IDX (t
);
6247 level
= TEMPLATE_TYPE_LEVEL (t
);
6251 idx
= TEMPLATE_PARM_IDX (t
);
6252 level
= TEMPLATE_PARM_LEVEL (t
);
6255 if (TREE_VEC_LENGTH (args
) > 0)
6257 tree arg
= NULL_TREE
;
6259 levels
= TMPL_ARGS_DEPTH (args
);
6260 if (level
<= levels
)
6261 arg
= TMPL_ARG (args
, level
, idx
);
6263 if (arg
== error_mark_node
)
6264 return error_mark_node
;
6265 else if (arg
!= NULL_TREE
)
6267 if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
6269 my_friendly_assert (TYPE_P (arg
), 0);
6270 return cp_build_qualified_type_real
6271 (arg
, CP_TYPE_QUALS (arg
) | CP_TYPE_QUALS (t
),
6274 else if (TREE_CODE (t
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
6276 /* We are processing a type constructed from
6277 a template template parameter */
6278 tree argvec
= tsubst (TYPE_TI_ARGS (t
),
6279 args
, complain
, in_decl
);
6280 if (argvec
== error_mark_node
)
6281 return error_mark_node
;
6283 /* We can get a TEMPLATE_TEMPLATE_PARM here when
6284 we are resolving nested-types in the signature of
6285 a member function templates.
6286 Otherwise ARG is a TEMPLATE_DECL and is the real
6287 template to be instantiated. */
6288 if (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
6289 arg
= TYPE_NAME (arg
);
6291 r
= lookup_template_class (arg
,
6294 /*entering_scope=*/0);
6295 return cp_build_qualified_type_real (r
,
6300 /* TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX. */
6305 my_friendly_abort (981018);
6308 /* This can happen during the attempted tsubst'ing in
6309 unify. This means that we don't yet have any information
6310 about the template parameter in question. */
6313 /* If we get here, we must have been looking at a parm for a
6314 more deeply nested template. Make a new version of this
6315 template parameter, but with a lower level. */
6316 switch (TREE_CODE (t
))
6318 case TEMPLATE_TYPE_PARM
:
6319 case TEMPLATE_TEMPLATE_PARM
:
6320 case BOUND_TEMPLATE_TEMPLATE_PARM
:
6321 if (CP_TYPE_QUALS (t
))
6323 r
= tsubst (TYPE_MAIN_VARIANT (t
), args
, complain
, in_decl
);
6324 r
= cp_build_qualified_type_real (r
, CP_TYPE_QUALS (t
),
6330 TEMPLATE_TYPE_PARM_INDEX (r
)
6331 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (t
),
6333 TYPE_STUB_DECL (r
) = TYPE_NAME (r
) = TEMPLATE_TYPE_DECL (r
);
6334 TYPE_MAIN_VARIANT (r
) = r
;
6335 TYPE_POINTER_TO (r
) = NULL_TREE
;
6336 TYPE_REFERENCE_TO (r
) = NULL_TREE
;
6338 if (TREE_CODE (t
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
6340 tree argvec
= tsubst (TYPE_TI_ARGS (t
), args
,
6342 if (argvec
== error_mark_node
)
6343 return error_mark_node
;
6345 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (r
)
6346 = tree_cons (TYPE_TI_TEMPLATE (t
), argvec
, NULL_TREE
);
6351 case TEMPLATE_PARM_INDEX
:
6352 r
= reduce_template_parm_level (t
, type
, levels
);
6356 my_friendly_abort (0);
6364 tree purpose
, value
, chain
, result
;
6366 if (t
== void_list_node
)
6369 purpose
= TREE_PURPOSE (t
);
6372 purpose
= tsubst (purpose
, args
, complain
, in_decl
);
6373 if (purpose
== error_mark_node
)
6374 return error_mark_node
;
6376 value
= TREE_VALUE (t
);
6379 value
= tsubst (value
, args
, complain
, in_decl
);
6380 if (value
== error_mark_node
)
6381 return error_mark_node
;
6383 chain
= TREE_CHAIN (t
);
6384 if (chain
&& chain
!= void_type_node
)
6386 chain
= tsubst (chain
, args
, complain
, in_decl
);
6387 if (chain
== error_mark_node
)
6388 return error_mark_node
;
6390 if (purpose
== TREE_PURPOSE (t
)
6391 && value
== TREE_VALUE (t
)
6392 && chain
== TREE_CHAIN (t
))
6394 result
= hash_tree_cons (purpose
, value
, chain
);
6395 TREE_PARMLIST (result
) = TREE_PARMLIST (t
);
6399 if (type
!= NULL_TREE
)
6401 /* A binfo node. We always need to make a copy, of the node
6402 itself and of its BINFO_BASETYPES. */
6406 /* Make sure type isn't a typedef copy. */
6407 type
= BINFO_TYPE (TYPE_BINFO (type
));
6409 TREE_TYPE (t
) = complete_type (type
);
6410 if (IS_AGGR_TYPE (type
))
6412 BINFO_VTABLE (t
) = TYPE_BINFO_VTABLE (type
);
6413 BINFO_VIRTUALS (t
) = TYPE_BINFO_VIRTUALS (type
);
6414 if (TYPE_BINFO_BASETYPES (type
) != NULL_TREE
)
6415 BINFO_BASETYPES (t
) = copy_node (TYPE_BINFO_BASETYPES (type
));
6420 /* Otherwise, a vector of template arguments. */
6421 return tsubst_template_arg_vector (t
, args
, complain
);
6424 case REFERENCE_TYPE
:
6426 enum tree_code code
;
6428 if (type
== TREE_TYPE (t
))
6431 code
= TREE_CODE (t
);
6436 Type deduction may fail for any of the following
6439 -- Attempting to create a pointer to reference type.
6440 -- Attempting to create a reference to a reference type or
6441 a reference to void. */
6442 if (TREE_CODE (type
) == REFERENCE_TYPE
6443 || (code
== REFERENCE_TYPE
&& TREE_CODE (type
) == VOID_TYPE
))
6445 static int last_line
= 0;
6446 static const char* last_file
= 0;
6448 /* We keep track of the last time we issued this error
6449 message to avoid spewing a ton of messages during a
6450 single bad template instantiation. */
6451 if (complain
&& (last_line
!= lineno
||
6452 last_file
!= input_filename
))
6454 if (TREE_CODE (type
) == VOID_TYPE
)
6455 cp_error ("forming reference to void");
6457 cp_error ("forming %s to reference type `%T'",
6458 (code
== POINTER_TYPE
) ? "pointer" : "reference",
6461 last_file
= input_filename
;
6464 return error_mark_node
;
6466 else if (code
== POINTER_TYPE
)
6467 r
= build_pointer_type (type
);
6469 r
= build_reference_type (type
);
6470 r
= cp_build_qualified_type_real (r
, TYPE_QUALS (t
), complain
);
6472 if (r
!= error_mark_node
)
6473 /* Will this ever be needed for TYPE_..._TO values? */
6480 r
= tsubst (TYPE_OFFSET_BASETYPE (t
), args
, complain
, in_decl
);
6481 if (r
== error_mark_node
|| !IS_AGGR_TYPE (r
))
6485 Type deduction may fail for any of the following
6488 -- Attempting to create "pointer to member of T" when T
6489 is not a class type. */
6491 cp_error ("creating pointer to member of non-class type `%T'",
6493 return error_mark_node
;
6495 return build_offset_type (r
, type
);
6503 fntype
= tsubst_function_type (t
, args
, complain
, in_decl
);
6504 if (fntype
== error_mark_node
)
6505 return error_mark_node
;
6507 /* Substitue the exception specification. */
6508 raises
= TYPE_RAISES_EXCEPTIONS (t
);
6511 tree list
= NULL_TREE
;
6513 if (! TREE_VALUE (raises
))
6516 for (; raises
!= NULL_TREE
; raises
= TREE_CHAIN (raises
))
6518 tree spec
= TREE_VALUE (raises
);
6520 spec
= tsubst (spec
, args
, complain
, in_decl
);
6521 if (spec
== error_mark_node
)
6523 list
= add_exception_specifier (list
, spec
, complain
);
6525 fntype
= build_exception_variant (fntype
, list
);
6531 tree domain
= tsubst (TYPE_DOMAIN (t
), args
, complain
, in_decl
);
6532 if (domain
== error_mark_node
)
6533 return error_mark_node
;
6535 /* As an optimization, we avoid regenerating the array type if
6536 it will obviously be the same as T. */
6537 if (type
== TREE_TYPE (t
) && domain
== TYPE_DOMAIN (t
))
6540 /* These checks should match the ones in grokdeclarator.
6544 The deduction may fail for any of the following reasons:
6546 -- Attempting to create an array with an element type that
6547 is void, a function type, or a reference type. */
6548 if (TREE_CODE (type
) == VOID_TYPE
6549 || TREE_CODE (type
) == FUNCTION_TYPE
6550 || TREE_CODE (type
) == REFERENCE_TYPE
)
6553 cp_error ("creating array of `%T'", type
);
6554 return error_mark_node
;
6557 r
= build_cplus_array_type (type
, domain
);
6564 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6566 tree e2
= tsubst (TREE_OPERAND (t
, 1), args
, complain
,
6569 if (e1
== error_mark_node
|| e2
== error_mark_node
)
6570 return error_mark_node
;
6572 return fold (build (TREE_CODE (t
), TREE_TYPE (t
), e1
, e2
));
6578 tree e
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6580 if (e
== error_mark_node
)
6581 return error_mark_node
;
6583 return fold (build (TREE_CODE (t
), TREE_TYPE (t
), e
));
6588 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
6589 in_decl
, /*entering_scope=*/1);
6590 tree f
= tsubst_copy (TYPENAME_TYPE_FULLNAME (t
), args
,
6593 if (ctx
== error_mark_node
|| f
== error_mark_node
)
6594 return error_mark_node
;
6596 if (!IS_AGGR_TYPE (ctx
))
6599 cp_error ("`%T' is not a class, struct, or union type",
6601 return error_mark_node
;
6603 else if (!uses_template_parms (ctx
) && !TYPE_BEING_DEFINED (ctx
))
6605 /* Normally, make_typename_type does not require that the CTX
6606 have complete type in order to allow things like:
6608 template <class T> struct S { typename S<T>::X Y; };
6610 But, such constructs have already been resolved by this
6611 point, so here CTX really should have complete type, unless
6612 it's a partial instantiation. */
6613 ctx
= complete_type (ctx
);
6614 if (!COMPLETE_TYPE_P (ctx
))
6617 incomplete_type_error (NULL_TREE
, ctx
);
6618 return error_mark_node
;
6622 f
= make_typename_type (ctx
, f
, complain
);
6623 if (f
== error_mark_node
)
6625 return cp_build_qualified_type_real (f
,
6627 | CP_TYPE_QUALS (t
),
6633 tree e
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6635 if (e
== error_mark_node
)
6636 return error_mark_node
;
6637 return make_pointer_declarator (type
, e
);
6642 tree e
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6644 if (e
== error_mark_node
)
6645 return error_mark_node
;
6646 return make_reference_declarator (type
, e
);
6651 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6653 tree e2
= tsubst_expr (TREE_OPERAND (t
, 1), args
, complain
,
6655 if (e1
== error_mark_node
|| e2
== error_mark_node
)
6656 return error_mark_node
;
6658 return build_parse_node (ARRAY_REF
, e1
, e2
, tsubst_expr
);
6663 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6665 tree e2
= (tsubst_call_declarator_parms
6666 (CALL_DECLARATOR_PARMS (t
), args
, complain
, in_decl
));
6667 tree e3
= tsubst (CALL_DECLARATOR_EXCEPTION_SPEC (t
), args
,
6670 if (e1
== error_mark_node
|| e2
== error_mark_node
6671 || e3
== error_mark_node
)
6672 return error_mark_node
;
6674 return make_call_declarator (e1
, e2
, CALL_DECLARATOR_QUALS (t
), e3
);
6679 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6681 tree e2
= tsubst (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
6682 if (e1
== error_mark_node
|| e2
== error_mark_node
)
6683 return error_mark_node
;
6685 return build_parse_node (TREE_CODE (t
), e1
, e2
);
6690 tree e1
= tsubst_expr (TYPE_FIELDS (t
), args
, complain
,
6692 if (e1
== error_mark_node
)
6693 return error_mark_node
;
6695 return TREE_TYPE (e1
);
6705 /* This code should match declare_hidden_char_array in
6707 name
= (*decl_printable_name
) (current_function_decl
, 2);
6708 len
= strlen (name
) + 1;
6709 type
= build_array_type (char_type_node
,
6710 build_index_type (build_int_2 (len
, 0)));
6711 str
= build_string (len
, name
);
6712 TREE_TYPE (str
) = type
;
6717 sorry ("use of `%s' in template",
6718 tree_code_name
[(int) TREE_CODE (t
)]);
6719 return error_mark_node
;
6723 /* Like tsubst, but deals with expressions. This function just replaces
6724 template parms; to finish processing the resultant expression, use
6728 tsubst_copy (t
, args
, complain
, in_decl
)
6733 enum tree_code code
;
6736 if (t
== NULL_TREE
|| t
== error_mark_node
)
6739 code
= TREE_CODE (t
);
6744 return do_identifier (DECL_NAME (t
), 0, NULL_TREE
);
6751 if (!DECL_CONTEXT (t
))
6752 /* This is a global enumeration constant. */
6755 /* Unfortunately, we cannot just call lookup_name here.
6758 template <int I> int f() {
6760 struct S { void g() { E e = a; } };
6763 When we instantiate f<7>::S::g(), say, lookup_name is not
6764 clever enough to find f<7>::a. */
6766 = tsubst_aggr_type (TREE_TYPE (t
), args
, complain
, in_decl
,
6767 /*entering_scope=*/0);
6769 for (v
= TYPE_VALUES (enum_type
);
6772 if (TREE_PURPOSE (v
) == DECL_NAME (t
))
6773 return TREE_VALUE (v
);
6775 /* We didn't find the name. That should never happen; if
6776 name-lookup found it during preliminary parsing, we
6777 should find it again here during instantiation. */
6778 my_friendly_abort (0);
6783 if (DECL_CONTEXT (t
))
6787 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
6788 /*entering_scope=*/1);
6789 if (ctx
!= DECL_CONTEXT (t
))
6790 return lookup_field (ctx
, DECL_NAME (t
), 0, 0);
6796 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
))
6797 t
= tsubst (t
, args
, complain
, in_decl
);
6802 if (is_member_template (t
))
6803 return tsubst (t
, args
, complain
, in_decl
);
6809 /* We must tsbust into a LOOKUP_EXPR in case the names to
6810 which it refers is a conversion operator; in that case the
6811 name will change. We avoid making unnecessary copies,
6814 tree id
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
6816 if (id
!= TREE_OPERAND (t
, 0))
6818 r
= build_nt (LOOKUP_EXPR
, id
);
6819 LOOKUP_EXPR_GLOBAL (r
) = LOOKUP_EXPR_GLOBAL (t
);
6827 case REINTERPRET_CAST_EXPR
:
6828 case CONST_CAST_EXPR
:
6829 case STATIC_CAST_EXPR
:
6830 case DYNAMIC_CAST_EXPR
:
6833 (code
, tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
6834 tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
));
6837 case PREDECREMENT_EXPR
:
6838 case PREINCREMENT_EXPR
:
6839 case POSTDECREMENT_EXPR
:
6840 case POSTINCREMENT_EXPR
:
6842 case TRUTH_NOT_EXPR
:
6845 case CONVERT_EXPR
: /* Unary + */
6854 (code
, tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
6855 tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
));
6860 case TRUNC_DIV_EXPR
:
6862 case FLOOR_DIV_EXPR
:
6863 case ROUND_DIV_EXPR
:
6864 case EXACT_DIV_EXPR
:
6866 case BIT_ANDTC_EXPR
:
6869 case TRUNC_MOD_EXPR
:
6870 case FLOOR_MOD_EXPR
:
6871 case TRUTH_ANDIF_EXPR
:
6872 case TRUTH_ORIF_EXPR
:
6873 case TRUTH_AND_EXPR
:
6894 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
6895 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
));
6899 tree fn
= TREE_OPERAND (t
, 0);
6900 if (is_overloaded_fn (fn
))
6901 fn
= tsubst_copy (get_first_fn (fn
), args
, complain
, in_decl
);
6903 /* Sometimes FN is a LOOKUP_EXPR. */
6904 fn
= tsubst_copy (fn
, args
, complain
, in_decl
);
6906 (code
, fn
, tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
,
6911 case METHOD_CALL_EXPR
:
6913 tree name
= TREE_OPERAND (t
, 0);
6914 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
6916 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
6918 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
6920 else if (TREE_CODE (name
) == SCOPE_REF
6921 && TREE_CODE (TREE_OPERAND (name
, 1)) == BIT_NOT_EXPR
)
6923 tree base
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
6925 name
= TREE_OPERAND (name
, 1);
6926 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
6928 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
6929 name
= build_nt (SCOPE_REF
, base
, name
);
6932 name
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
6934 (code
, name
, tsubst_copy (TREE_OPERAND (t
, 1), args
,
6936 tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
),
6941 /* This processing should really occur in tsubst_expr, However,
6942 tsubst_expr does not recurse into expressions, since it
6943 assumes that there aren't any statements inside them.
6944 Instead, it simply calls build_expr_from_tree. So, we need
6945 to expand the STMT_EXPR here. */
6946 if (!processing_template_decl
)
6948 tree stmt_expr
= begin_stmt_expr ();
6949 tsubst_expr (STMT_EXPR_STMT (t
), args
,
6951 return finish_stmt_expr (stmt_expr
);
6958 case PSEUDO_DTOR_EXPR
:
6961 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
6962 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
),
6963 tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
));
6970 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
6971 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
),
6972 tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
));
6973 NEW_EXPR_USE_GLOBAL (r
) = NEW_EXPR_USE_GLOBAL (t
);
6980 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
6981 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
));
6982 DELETE_EXPR_USE_GLOBAL (r
) = DELETE_EXPR_USE_GLOBAL (t
);
6983 DELETE_EXPR_USE_VEC (r
) = DELETE_EXPR_USE_VEC (t
);
6987 case TEMPLATE_ID_EXPR
:
6989 /* Substituted template arguments */
6990 tree targs
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
,
6993 if (targs
&& TREE_CODE (targs
) == TREE_LIST
)
6996 for (chain
= targs
; chain
; chain
= TREE_CHAIN (chain
))
6997 TREE_VALUE (chain
) = maybe_fold_nontype_arg (TREE_VALUE (chain
));
7002 for (i
= 0; i
< TREE_VEC_LENGTH (targs
); ++i
)
7003 TREE_VEC_ELT (targs
, i
)
7004 = maybe_fold_nontype_arg (TREE_VEC_ELT (targs
, i
));
7007 return lookup_template_function
7008 (tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
), targs
);
7013 tree purpose
, value
, chain
;
7015 if (t
== void_list_node
)
7018 purpose
= TREE_PURPOSE (t
);
7020 purpose
= tsubst_copy (purpose
, args
, complain
, in_decl
);
7021 value
= TREE_VALUE (t
);
7023 value
= tsubst_copy (value
, args
, complain
, in_decl
);
7024 chain
= TREE_CHAIN (t
);
7025 if (chain
&& chain
!= void_type_node
)
7026 chain
= tsubst_copy (chain
, args
, complain
, in_decl
);
7027 if (purpose
== TREE_PURPOSE (t
)
7028 && value
== TREE_VALUE (t
)
7029 && chain
== TREE_CHAIN (t
))
7031 return tree_cons (purpose
, value
, chain
);
7038 case TEMPLATE_TYPE_PARM
:
7039 case TEMPLATE_TEMPLATE_PARM
:
7040 case BOUND_TEMPLATE_TEMPLATE_PARM
:
7041 case TEMPLATE_PARM_INDEX
:
7043 case REFERENCE_TYPE
:
7050 return tsubst (t
, args
, complain
, in_decl
);
7052 case IDENTIFIER_NODE
:
7053 if (IDENTIFIER_TYPENAME_P (t
))
7055 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
7057 return mangle_conv_op_name_for_type (new_type
);
7059 return (build_typename_overload (new_type
));
7067 (CONSTRUCTOR
, tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
7068 NULL_TREE
, tsubst_copy (CONSTRUCTOR_ELTS (t
), args
,
7069 complain
, in_decl
));
7070 TREE_HAS_CONSTRUCTOR (r
) = TREE_HAS_CONSTRUCTOR (t
);
7075 return build_x_va_arg (tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
,
7077 tsubst (TREE_TYPE (t
), args
, complain
, in_decl
));
7080 return tsubst (t
, args
, complain
, in_decl
);
7087 /* Like tsubst_copy, but also does semantic processing. */
7090 tsubst_expr (t
, args
, complain
, in_decl
)
7097 if (t
== NULL_TREE
|| t
== error_mark_node
)
7100 if (processing_template_decl
)
7101 return tsubst_copy (t
, args
, complain
, in_decl
);
7103 switch (TREE_CODE (t
))
7107 finish_named_return_value
7108 (TREE_OPERAND (t
, 0),
7109 tsubst_expr (TREE_OPERAND (t
, 1), args
, /*complain=*/1, in_decl
));
7110 tsubst_expr (TREE_CHAIN (t
), args
, complain
, in_decl
);
7113 case CTOR_INITIALIZER
:
7115 tree member_init_list
;
7116 tree base_init_list
;
7120 = tsubst_initializer_list (TREE_OPERAND (t
, 0), args
);
7122 = tsubst_initializer_list (TREE_OPERAND (t
, 1), args
);
7123 setup_vtbl_ptr (member_init_list
, base_init_list
);
7124 tsubst_expr (TREE_CHAIN (t
), args
, complain
, in_decl
);
7130 finish_return_stmt (tsubst_expr (RETURN_EXPR (t
),
7131 args
, complain
, in_decl
));
7136 finish_expr_stmt (tsubst_expr (EXPR_STMT_EXPR (t
),
7137 args
, complain
, in_decl
));
7146 decl
= DECL_STMT_DECL (t
);
7147 if (TREE_CODE (decl
) == LABEL_DECL
)
7148 finish_label_decl (DECL_NAME (decl
));
7151 init
= DECL_INITIAL (decl
);
7152 decl
= tsubst (decl
, args
, complain
, in_decl
);
7153 init
= tsubst_expr (init
, args
, complain
, in_decl
);
7154 if (decl
!= error_mark_node
)
7156 if (TREE_CODE (decl
) != TYPE_DECL
)
7157 /* Make sure the type is instantiated now. */
7158 complete_type (TREE_TYPE (decl
));
7160 DECL_INITIAL (decl
) = error_mark_node
;
7161 /* By marking the declaration as instantiated, we avoid
7162 trying to instantiate it. Since instantiate_decl can't
7163 handle local variables, and since we've already done
7164 all that needs to be done, that's the right thing to
7166 if (TREE_CODE (decl
) == VAR_DECL
)
7167 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
7168 maybe_push_decl (decl
);
7169 cp_finish_decl (decl
, init
, NULL_TREE
, 0);
7180 stmt
= begin_for_stmt ();
7181 for (tmp
= FOR_INIT_STMT (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
7182 tsubst_expr (tmp
, args
, complain
, in_decl
);
7183 finish_for_init_stmt (stmt
);
7184 finish_for_cond (tsubst_expr (FOR_COND (t
), args
,
7187 tmp
= tsubst_expr (FOR_EXPR (t
), args
, complain
, in_decl
);
7188 finish_for_expr (tmp
, stmt
);
7189 tsubst_expr (FOR_BODY (t
), args
, complain
, in_decl
);
7190 finish_for_stmt (stmt
);
7197 stmt
= begin_while_stmt ();
7198 finish_while_stmt_cond (tsubst_expr (WHILE_COND (t
),
7199 args
, complain
, in_decl
),
7201 tsubst_expr (WHILE_BODY (t
), args
, complain
, in_decl
);
7202 finish_while_stmt (stmt
);
7209 stmt
= begin_do_stmt ();
7210 tsubst_expr (DO_BODY (t
), args
, complain
, in_decl
);
7211 finish_do_body (stmt
);
7212 finish_do_stmt (tsubst_expr (DO_COND (t
), args
,
7223 stmt
= begin_if_stmt ();
7224 finish_if_stmt_cond (tsubst_expr (IF_COND (t
),
7225 args
, complain
, in_decl
),
7228 if (tmp
= THEN_CLAUSE (t
), tmp
)
7230 tsubst_expr (tmp
, args
, complain
, in_decl
);
7231 finish_then_clause (stmt
);
7234 if (tmp
= ELSE_CLAUSE (t
), tmp
)
7236 begin_else_clause ();
7237 tsubst_expr (tmp
, args
, complain
, in_decl
);
7238 finish_else_clause (stmt
);
7250 stmt
= begin_compound_stmt (COMPOUND_STMT_NO_SCOPE (t
));
7251 for (substmt
= COMPOUND_BODY (t
);
7252 substmt
!= NULL_TREE
;
7253 substmt
= TREE_CHAIN (substmt
))
7254 tsubst_expr (substmt
, args
, complain
, in_decl
);
7255 return finish_compound_stmt (COMPOUND_STMT_NO_SCOPE (t
), stmt
);
7261 finish_break_stmt ();
7266 finish_continue_stmt ();
7274 stmt
= begin_switch_stmt ();
7275 val
= tsubst_expr (SWITCH_COND (t
), args
, complain
, in_decl
);
7276 finish_switch_cond (val
, stmt
);
7277 tsubst_expr (SWITCH_BODY (t
), args
, complain
, in_decl
);
7278 finish_switch_stmt (stmt
);
7284 finish_case_label (tsubst_expr (CASE_LOW (t
), args
, complain
, in_decl
),
7285 tsubst_expr (CASE_HIGH (t
), args
, complain
,
7290 lineno
= STMT_LINENO (t
);
7291 finish_label_stmt (DECL_NAME (LABEL_STMT_LABEL (t
)));
7296 t
= GOTO_DESTINATION (t
);
7297 if (TREE_CODE (t
) != LABEL_DECL
)
7298 /* Computed goto's must be tsubst'd into. On the other hand,
7299 non-computed gotos must not be; the identifier in question
7300 will have no binding. */
7301 t
= tsubst_expr (t
, args
, complain
, in_decl
);
7304 finish_goto_stmt (t
);
7309 finish_asm_stmt (ASM_CV_QUAL (t
),
7310 tsubst_expr (ASM_STRING (t
), args
, complain
, in_decl
),
7311 tsubst_expr (ASM_OUTPUTS (t
), args
, complain
, in_decl
),
7312 tsubst_expr (ASM_INPUTS (t
), args
, complain
, in_decl
),
7313 tsubst_expr (ASM_CLOBBERS (t
), args
, complain
,
7321 stmt
= begin_try_block ();
7322 tsubst_expr (TRY_STMTS (t
), args
, complain
, in_decl
);
7323 finish_cleanup_try_block (stmt
);
7324 finish_cleanup (tsubst_expr (TRY_HANDLERS (t
), args
,
7332 if (FN_TRY_BLOCK_P (t
))
7333 stmt
= begin_function_try_block ();
7335 stmt
= begin_try_block ();
7337 tsubst_expr (TRY_STMTS (t
), args
, complain
, in_decl
);
7339 if (FN_TRY_BLOCK_P (t
))
7340 finish_function_try_block (stmt
);
7342 finish_try_block (stmt
);
7344 handler
= TRY_HANDLERS (t
);
7345 for (; handler
; handler
= TREE_CHAIN (handler
))
7346 tsubst_expr (handler
, args
, complain
, in_decl
);
7347 if (FN_TRY_BLOCK_P (t
))
7348 finish_function_handler_sequence (stmt
);
7350 finish_handler_sequence (stmt
);
7360 stmt
= begin_handler ();
7361 if (HANDLER_PARMS (t
))
7363 decl
= DECL_STMT_DECL (HANDLER_PARMS (t
));
7364 decl
= tsubst (decl
, args
, complain
, in_decl
);
7365 /* Prevent instantiate_decl from trying to instantiate
7366 this variable. We've already done all that needs to be
7368 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
7372 blocks
= finish_handler_parms (decl
, stmt
);
7373 tsubst_expr (HANDLER_BODY (t
), args
, complain
, in_decl
);
7374 finish_handler (blocks
, stmt
);
7381 tsubst (t
, args
, complain
, NULL_TREE
);
7385 return build_expr_from_tree (tsubst_copy (t
, args
, complain
, in_decl
));
7390 /* TMPL is a TEMPLATE_DECL for a cloned constructor or destructor.
7391 Instantiate it with the ARGS. */
7394 instantiate_clone (tmpl
, args
)
7401 /* Instantiated the cloned function, rather than the clone. */
7402 spec
= instantiate_template (DECL_CLONED_FUNCTION (tmpl
), args
);
7404 /* Then, see if we've already cloned the instantiation. */
7405 for (clone
= TREE_CHAIN (spec
);
7406 clone
&& DECL_CLONED_FUNCTION_P (clone
);
7407 clone
= TREE_CHAIN (clone
))
7408 if (DECL_NAME (clone
) == DECL_NAME (tmpl
))
7411 /* If we haven't, do so know. */
7413 clone_function_decl (spec
, /*update_method_vec_p=*/0);
7416 for (clone
= TREE_CHAIN (spec
);
7417 clone
&& DECL_CLONED_FUNCTION_P (clone
);
7418 clone
= TREE_CHAIN (clone
))
7419 if (DECL_NAME (clone
) == DECL_NAME (tmpl
))
7422 /* We should always have found the clone by now. */
7423 my_friendly_abort (20000411);
7427 /* Instantiate the indicated variable or function template TMPL with
7428 the template arguments in TARG_PTR. */
7431 instantiate_template (tmpl
, targ_ptr
)
7432 tree tmpl
, targ_ptr
;
7441 if (tmpl
== error_mark_node
)
7442 return error_mark_node
;
7444 my_friendly_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
, 283);
7446 /* If this function is a clone, handle it specially. */
7447 if (DECL_CLONED_FUNCTION_P (tmpl
))
7448 return instantiate_clone (tmpl
, targ_ptr
);
7450 /* Check to see if we already have this specialization. */
7451 spec
= retrieve_specialization (tmpl
, targ_ptr
);
7452 if (spec
!= NULL_TREE
)
7455 gen_tmpl
= most_general_template (tmpl
);
7456 if (tmpl
!= gen_tmpl
)
7458 /* The TMPL is a partial instantiation. To get a full set of
7459 arguments we must add the arguments used to perform the
7460 partial instantiation. */
7461 targ_ptr
= add_outermost_template_args (DECL_TI_ARGS (tmpl
),
7464 /* Check to see if we already have this specialization. */
7465 spec
= retrieve_specialization (gen_tmpl
, targ_ptr
);
7466 if (spec
!= NULL_TREE
)
7470 len
= DECL_NTPARMS (gen_tmpl
);
7471 inner_args
= INNERMOST_TEMPLATE_ARGS (targ_ptr
);
7475 tree t
= TREE_VEC_ELT (inner_args
, i
);
7478 tree nt
= target_type (t
);
7479 if (IS_AGGR_TYPE (nt
) && decl_function_context (TYPE_MAIN_DECL (nt
)))
7481 cp_error ("type `%T' composed from a local class is not a valid template-argument", t
);
7482 cp_error (" trying to instantiate `%D'", gen_tmpl
);
7483 return error_mark_node
;
7488 /* substitute template parameters */
7489 fndecl
= tsubst (DECL_TEMPLATE_RESULT (gen_tmpl
),
7490 targ_ptr
, /*complain=*/1, gen_tmpl
);
7491 /* The DECL_TI_TEMPLATE should always be the immediate parent
7492 template, not the most general template. */
7493 DECL_TI_TEMPLATE (fndecl
) = tmpl
;
7495 if (flag_external_templates
)
7496 add_pending_template (fndecl
);
7498 /* If we've just instantiated the main entry point for a function,
7499 instantiate all the alternate entry points as well. */
7500 for (clone
= TREE_CHAIN (gen_tmpl
);
7501 clone
&& DECL_CLONED_FUNCTION_P (clone
);
7502 clone
= TREE_CHAIN (clone
))
7503 instantiate_template (clone
, targ_ptr
);
7508 /* Push the name of the class template into the scope of the instantiation. */
7511 overload_template_name (type
)
7514 tree id
= DECL_NAME (CLASSTYPE_TI_TEMPLATE (type
));
7517 if (IDENTIFIER_CLASS_VALUE (id
)
7518 && TREE_TYPE (IDENTIFIER_CLASS_VALUE (id
)) == type
)
7521 decl
= build_decl (TYPE_DECL
, id
, type
);
7522 DECL_ARTIFICIAL (decl
) = 1;
7523 pushdecl_class_level (decl
);
7526 /* The FN is a TEMPLATE_DECL for a function. The ARGS are the
7527 arguments that are being used when calling it. TARGS is a vector
7528 into which the deduced template arguments are placed.
7530 Return zero for success, 2 for an incomplete match that doesn't resolve
7531 all the types, and 1 for complete failure. An error message will be
7532 printed only for an incomplete match.
7534 If FN is a conversion operator, RETURN_TYPE is the type desired as
7535 the result of the conversion operator.
7537 TPARMS is a vector of template parameters.
7539 The EXPLICIT_TARGS are explicit template arguments provided via a
7542 The parameter STRICT is one of:
7545 We are deducing arguments for a function call, as in
7549 We are deducing arguments for a conversion function, as in
7553 We are deducing arguments when calculating the partial
7554 ordering between specializations of function or class
7555 templates, as in [temp.func.order] and [temp.class.order],
7556 when doing an explicit instantiation as in [temp.explicit],
7557 when determining an explicit specialization as in
7558 [temp.expl.spec], or when taking the address of a function
7559 template, as in [temp.deduct.funcaddr].
7561 The other arguments are as for type_unification. */
7564 fn_type_unification (fn
, explicit_targs
, targs
, args
, return_type
,
7566 tree fn
, explicit_targs
, targs
, args
, return_type
;
7567 unification_kind_t strict
;
7573 my_friendly_assert (TREE_CODE (fn
) == TEMPLATE_DECL
, 0);
7575 fntype
= TREE_TYPE (fn
);
7580 The specified template arguments must match the template
7581 parameters in kind (i.e., type, nontype, template), and there
7582 must not be more arguments than there are parameters;
7583 otherwise type deduction fails.
7585 Nontype arguments must match the types of the corresponding
7586 nontype template parameters, or must be convertible to the
7587 types of the corresponding nontype parameters as specified in
7588 _temp.arg.nontype_, otherwise type deduction fails.
7590 All references in the function type of the function template
7591 to the corresponding template parameters are replaced by the
7592 specified template argument values. If a substitution in a
7593 template parameter or in the function type of the function
7594 template results in an invalid type, type deduction fails. */
7596 tree converted_args
;
7599 = (coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
7600 explicit_targs
, NULL_TREE
, /*complain=*/0,
7601 /*require_all_arguments=*/0));
7602 if (converted_args
== error_mark_node
)
7605 fntype
= tsubst (fntype
, converted_args
, /*complain=*/0, NULL_TREE
);
7606 if (fntype
== error_mark_node
)
7609 /* Place the explicitly specified arguments in TARGS. */
7610 for (i
= 0; i
< TREE_VEC_LENGTH (targs
); i
++)
7611 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (converted_args
, i
);
7614 parms
= TYPE_ARG_TYPES (fntype
);
7616 if (DECL_CONV_FN_P (fn
))
7618 /* This is a template conversion operator. Remove `this', since
7619 we could be comparing conversions from different classes. */
7620 parms
= TREE_CHAIN (parms
);
7621 args
= TREE_CHAIN (args
);
7622 my_friendly_assert (return_type
!= NULL_TREE
, 20000227);
7627 /* We've been given a return type to match, prepend it. */
7628 parms
= tree_cons (NULL_TREE
, TREE_TYPE (fntype
), parms
);
7629 args
= tree_cons (NULL_TREE
, return_type
, args
);
7632 /* We allow incomplete unification without an error message here
7633 because the standard doesn't seem to explicitly prohibit it. Our
7634 callers must be ready to deal with unification failures in any
7636 result
= type_unification_real (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
7637 targs
, parms
, args
, /*subr=*/0,
7638 strict
, /*allow_incomplete*/1);
7641 /* All is well so far. Now, check:
7645 When all template arguments have been deduced, all uses of
7646 template parameters in nondeduced contexts are replaced with
7647 the corresponding deduced argument values. If the
7648 substitution results in an invalid type, as described above,
7649 type deduction fails. */
7650 if (tsubst (TREE_TYPE (fn
), targs
, /*complain=*/0, NULL_TREE
)
7657 /* Adjust types before performing type deduction, as described in
7658 [temp.deduct.call] and [temp.deduct.conv]. The rules in these two
7659 sections are symmetric. PARM is the type of a function parameter
7660 or the return type of the conversion function. ARG is the type of
7661 the argument passed to the call, or the type of the value
7662 intialized with the result of the conversion function. */
7665 maybe_adjust_types_for_deduction (strict
, parm
, arg
)
7666 unification_kind_t strict
;
7677 /* Swap PARM and ARG throughout the remainder of this
7678 function; the handling is precisely symmetric since PARM
7679 will initialize ARG rather than vice versa. */
7687 /* There is nothing to do in this case. */
7691 my_friendly_abort (0);
7694 if (TREE_CODE (*parm
) != REFERENCE_TYPE
)
7696 /* [temp.deduct.call]
7698 If P is not a reference type:
7700 --If A is an array type, the pointer type produced by the
7701 array-to-pointer standard conversion (_conv.array_) is
7702 used in place of A for type deduction; otherwise,
7704 --If A is a function type, the pointer type produced by
7705 the function-to-pointer standard conversion
7706 (_conv.func_) is used in place of A for type deduction;
7709 --If A is a cv-qualified type, the top level
7710 cv-qualifiers of A's type are ignored for type
7712 if (TREE_CODE (*arg
) == ARRAY_TYPE
)
7713 *arg
= build_pointer_type (TREE_TYPE (*arg
));
7714 else if (TREE_CODE (*arg
) == FUNCTION_TYPE
)
7715 *arg
= build_pointer_type (*arg
);
7717 *arg
= TYPE_MAIN_VARIANT (*arg
);
7720 /* [temp.deduct.call]
7722 If P is a cv-qualified type, the top level cv-qualifiers
7723 of P's type are ignored for type deduction. If P is a
7724 reference type, the type referred to by P is used for
7726 *parm
= TYPE_MAIN_VARIANT (*parm
);
7727 if (TREE_CODE (*parm
) == REFERENCE_TYPE
)
7728 *parm
= TREE_TYPE (*parm
);
7731 /* Like type_unfication.
7733 If SUBR is 1, we're being called recursively (to unify the
7734 arguments of a function or method parameter of a function
7738 type_unification_real (tparms
, targs
, parms
, args
, subr
,
7739 strict
, allow_incomplete
)
7740 tree tparms
, targs
, parms
, args
;
7742 unification_kind_t strict
;
7743 int allow_incomplete
;
7747 int ntparms
= TREE_VEC_LENGTH (tparms
);
7750 my_friendly_assert (TREE_CODE (tparms
) == TREE_VEC
, 289);
7751 my_friendly_assert (parms
== NULL_TREE
7752 || TREE_CODE (parms
) == TREE_LIST
, 290);
7753 /* ARGS could be NULL (via a call from parse.y to
7754 build_x_function_call). */
7756 my_friendly_assert (TREE_CODE (args
) == TREE_LIST
, 291);
7757 my_friendly_assert (ntparms
> 0, 292);
7762 sub_strict
= UNIFY_ALLOW_MORE_CV_QUAL
| UNIFY_ALLOW_DERIVED
;
7766 sub_strict
= UNIFY_ALLOW_LESS_CV_QUAL
;
7770 sub_strict
= UNIFY_ALLOW_NONE
;
7774 my_friendly_abort (0);
7778 && parms
!= void_list_node
7780 && args
!= void_list_node
)
7782 parm
= TREE_VALUE (parms
);
7783 parms
= TREE_CHAIN (parms
);
7784 arg
= TREE_VALUE (args
);
7785 args
= TREE_CHAIN (args
);
7787 if (arg
== error_mark_node
)
7789 if (arg
== unknown_type_node
)
7790 /* We can't deduce anything from this, but we might get all the
7791 template args from other function args. */
7794 /* Conversions will be performed on a function argument that
7795 corresponds with a function parameter that contains only
7796 non-deducible template parameters and explicitly specified
7797 template parameters. */
7798 if (! uses_template_parms (parm
))
7803 type
= TREE_TYPE (arg
);
7810 if (strict
== DEDUCE_EXACT
)
7812 if (same_type_p (parm
, type
))
7816 /* It might work; we shouldn't check now, because we might
7817 get into infinite recursion. Overload resolution will
7826 my_friendly_assert (TREE_TYPE (arg
) != NULL_TREE
, 293);
7827 if (type_unknown_p (arg
))
7829 /* [temp.deduct.type] A template-argument can be deduced from
7830 a pointer to function or pointer to member function
7831 argument if the set of overloaded functions does not
7832 contain function templates and at most one of a set of
7833 overloaded functions provides a unique match. */
7835 if (resolve_overloaded_unification
7836 (tparms
, targs
, parm
, arg
, strict
, sub_strict
)
7841 arg
= TREE_TYPE (arg
);
7845 maybe_adjust_types_for_deduction (strict
, &parm
, &arg
);
7847 if (unify (tparms
, targs
, parm
, arg
, sub_strict
))
7850 /* Fail if we've reached the end of the parm list, and more args
7851 are present, and the parm list isn't variadic. */
7852 if (args
&& args
!= void_list_node
&& parms
== void_list_node
)
7854 /* Fail if parms are left and they don't have default values. */
7856 && parms
!= void_list_node
7857 && TREE_PURPOSE (parms
) == NULL_TREE
)
7860 for (i
= 0; i
< ntparms
; i
++)
7861 if (TREE_VEC_ELT (targs
, i
) == NULL_TREE
)
7863 if (!allow_incomplete
)
7864 error ("incomplete type unification");
7870 /* Subroutine of type_unification_real. Args are like the variables at the
7871 call site. ARG is an overloaded function (or template-id); we try
7872 deducing template args from each of the overloads, and if only one
7873 succeeds, we go with that. Modifies TARGS and returns 0 on success. */
7876 resolve_overloaded_unification (tparms
, targs
, parm
, arg
, strict
,
7878 tree tparms
, targs
, parm
, arg
;
7879 unification_kind_t strict
;
7882 tree tempargs
= copy_node (targs
);
7885 if (TREE_CODE (arg
) == ADDR_EXPR
)
7886 arg
= TREE_OPERAND (arg
, 0);
7888 if (TREE_CODE (arg
) == COMPONENT_REF
)
7889 /* Handle `&x' where `x' is some static or non-static member
7891 arg
= TREE_OPERAND (arg
, 1);
7893 if (TREE_CODE (arg
) == OFFSET_REF
)
7894 arg
= TREE_OPERAND (arg
, 1);
7896 /* Strip baselink information. */
7897 while (TREE_CODE (arg
) == TREE_LIST
)
7898 arg
= TREE_VALUE (arg
);
7900 if (TREE_CODE (arg
) == TEMPLATE_ID_EXPR
)
7902 /* If we got some explicit template args, we need to plug them into
7903 the affected templates before we try to unify, in case the
7904 explicit args will completely resolve the templates in question. */
7906 tree expl_subargs
= TREE_OPERAND (arg
, 1);
7907 arg
= TREE_OPERAND (arg
, 0);
7909 for (; arg
; arg
= OVL_NEXT (arg
))
7911 tree fn
= OVL_CURRENT (arg
);
7914 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
7917 subargs
= get_bindings_overload (fn
, DECL_TEMPLATE_RESULT (fn
),
7921 elem
= tsubst (TREE_TYPE (fn
), subargs
, /*complain=*/0,
7923 if (TREE_CODE (elem
) == METHOD_TYPE
)
7924 elem
= build_ptrmemfunc_type (build_pointer_type (elem
));
7925 good
+= try_one_overload (tparms
, targs
, tempargs
, parm
, elem
,
7926 strict
, sub_strict
);
7930 else if (TREE_CODE (arg
) == OVERLOAD
)
7932 for (; arg
; arg
= OVL_NEXT (arg
))
7934 tree type
= TREE_TYPE (OVL_CURRENT (arg
));
7935 if (TREE_CODE (type
) == METHOD_TYPE
)
7936 type
= build_ptrmemfunc_type (build_pointer_type (type
));
7937 good
+= try_one_overload (tparms
, targs
, tempargs
, parm
,
7939 strict
, sub_strict
);
7943 my_friendly_abort (981006);
7945 /* [temp.deduct.type] A template-argument can be deduced from a pointer
7946 to function or pointer to member function argument if the set of
7947 overloaded functions does not contain function templates and at most
7948 one of a set of overloaded functions provides a unique match.
7950 So if we found multiple possibilities, we return success but don't
7955 int i
= TREE_VEC_LENGTH (targs
);
7957 if (TREE_VEC_ELT (tempargs
, i
))
7958 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (tempargs
, i
);
7966 /* Subroutine of resolve_overloaded_unification; does deduction for a single
7967 overload. Fills TARGS with any deduced arguments, or error_mark_node if
7968 different overloads deduce different arguments for a given parm.
7969 Returns 1 on success. */
7972 try_one_overload (tparms
, orig_targs
, targs
, parm
, arg
, strict
,
7974 tree tparms
, orig_targs
, targs
, parm
, arg
;
7975 unification_kind_t strict
;
7982 /* [temp.deduct.type] A template-argument can be deduced from a pointer
7983 to function or pointer to member function argument if the set of
7984 overloaded functions does not contain function templates and at most
7985 one of a set of overloaded functions provides a unique match.
7987 So if this is a template, just return success. */
7989 if (uses_template_parms (arg
))
7992 maybe_adjust_types_for_deduction (strict
, &parm
, &arg
);
7994 /* We don't copy orig_targs for this because if we have already deduced
7995 some template args from previous args, unify would complain when we
7996 try to deduce a template parameter for the same argument, even though
7997 there isn't really a conflict. */
7998 nargs
= TREE_VEC_LENGTH (targs
);
7999 tempargs
= make_tree_vec (nargs
);
8001 if (unify (tparms
, tempargs
, parm
, arg
, sub_strict
) != 0)
8004 /* First make sure we didn't deduce anything that conflicts with
8005 explicitly specified args. */
8006 for (i
= nargs
; i
--; )
8008 tree elt
= TREE_VEC_ELT (tempargs
, i
);
8009 tree oldelt
= TREE_VEC_ELT (orig_targs
, i
);
8011 if (elt
== NULL_TREE
)
8013 else if (uses_template_parms (elt
))
8015 /* Since we're unifying against ourselves, we will fill in template
8016 args used in the function parm list with our own template parms.
8018 TREE_VEC_ELT (tempargs
, i
) = NULL_TREE
;
8021 else if (oldelt
&& ! template_args_equal (oldelt
, elt
))
8025 for (i
= nargs
; i
--; )
8027 tree elt
= TREE_VEC_ELT (tempargs
, i
);
8030 TREE_VEC_ELT (targs
, i
) = elt
;
8036 /* PARM is a template class (perhaps with unbound template
8037 parameters). ARG is a fully instantiated type. If ARG can be
8038 bound to PARM, return ARG, otherwise return NULL_TREE. TPARMS and
8039 TARGS are as for unify. */
8042 try_class_unification (tparms
, targs
, parm
, arg
)
8051 if (!CLASSTYPE_TEMPLATE_INFO (arg
)
8052 || CLASSTYPE_TI_TEMPLATE (arg
) != CLASSTYPE_TI_TEMPLATE (parm
))
8055 /* We need to make a new template argument vector for the call to
8056 unify. If we used TARGS, we'd clutter it up with the result of
8057 the attempted unification, even if this class didn't work out.
8058 We also don't want to commit ourselves to all the unifications
8059 we've already done, since unification is supposed to be done on
8060 an argument-by-argument basis. In other words, consider the
8061 following pathological case:
8063 template <int I, int J, int K>
8066 template <int I, int J>
8067 struct S<I, J, 2> : public S<I, I, I>, S<J, J, J> {};
8069 template <int I, int J, int K>
8070 void f(S<I, J, K>, S<I, I, I>);
8079 Now, by the time we consider the unification involving `s2', we
8080 already know that we must have `f<0, 0, 0>'. But, even though
8081 `S<0, 1, 2>' is derived from `S<0, 0, 0>', the code is not legal
8082 because there are two ways to unify base classes of S<0, 1, 2>
8083 with S<I, I, I>. If we kept the already deduced knowledge, we
8084 would reject the possibility I=1. */
8085 copy_of_targs
= make_tree_vec (TREE_VEC_LENGTH (targs
));
8086 i
= unify (tparms
, copy_of_targs
, CLASSTYPE_TI_ARGS (parm
),
8087 CLASSTYPE_TI_ARGS (arg
), UNIFY_ALLOW_NONE
);
8089 /* If unification failed, we're done. */
8096 /* Subroutine of get_template_base. RVAL, if non-NULL, is a base we
8097 have alreay discovered to be satisfactory. ARG_BINFO is the binfo
8098 for the base class of ARG that we are currently examining. */
8101 get_template_base_recursive (tparms
, targs
, parm
,
8102 arg_binfo
, rval
, flags
)
8112 tree arg
= BINFO_TYPE (arg_binfo
);
8114 if (!(flags
& GTB_IGNORE_TYPE
))
8116 tree r
= try_class_unification (tparms
, targs
,
8119 /* If there is more than one satisfactory baseclass, then:
8123 If they yield more than one possible deduced A, the type
8127 if (r
&& rval
&& !same_type_p (r
, rval
))
8128 return error_mark_node
;
8133 binfos
= BINFO_BASETYPES (arg_binfo
);
8134 n_baselinks
= binfos
? TREE_VEC_LENGTH (binfos
) : 0;
8136 /* Process base types. */
8137 for (i
= 0; i
< n_baselinks
; i
++)
8139 tree base_binfo
= TREE_VEC_ELT (binfos
, i
);
8142 /* Skip this base, if we've already seen it. */
8143 if (BINFO_MARKED (base_binfo
))
8147 (flags
& GTB_VIA_VIRTUAL
) || TREE_VIA_VIRTUAL (base_binfo
);
8149 /* When searching for a non-virtual, we cannot mark virtually
8152 SET_BINFO_MARKED (base_binfo
);
8154 rval
= get_template_base_recursive (tparms
, targs
,
8158 GTB_VIA_VIRTUAL
* this_virtual
);
8160 /* If we discovered more than one matching base class, we can
8162 if (rval
== error_mark_node
)
8163 return error_mark_node
;
8169 /* Given a template type PARM and a class type ARG, find the unique
8170 base type in ARG that is an instance of PARM. We do not examine
8171 ARG itself; only its base-classes. If there is no appropriate base
8172 class, return NULL_TREE. If there is more than one, return
8173 error_mark_node. PARM may be the type of a partial specialization,
8174 as well as a plain template type. Used by unify. */
8177 get_template_base (tparms
, targs
, parm
, arg
)
8186 my_friendly_assert (IS_AGGR_TYPE_CODE (TREE_CODE (arg
)), 92);
8188 arg_binfo
= TYPE_BINFO (complete_type (arg
));
8189 rval
= get_template_base_recursive (tparms
, targs
,
8194 /* Since get_template_base_recursive marks the bases classes, we
8195 must unmark them here. */
8196 dfs_walk (arg_binfo
, dfs_unmark
, markedp
, 0);
8201 /* Returns the level of DECL, which declares a template parameter. */
8204 template_decl_level (decl
)
8207 switch (TREE_CODE (decl
))
8211 return TEMPLATE_TYPE_LEVEL (TREE_TYPE (decl
));
8214 return TEMPLATE_PARM_LEVEL (DECL_INITIAL (decl
));
8217 my_friendly_abort (0);
8222 /* Decide whether ARG can be unified with PARM, considering only the
8223 cv-qualifiers of each type, given STRICT as documented for unify.
8224 Returns non-zero iff the unification is OK on that basis.*/
8227 check_cv_quals_for_unify (strict
, arg
, parm
)
8232 if (!(strict
& UNIFY_ALLOW_MORE_CV_QUAL
)
8233 && !at_least_as_qualified_p (arg
, parm
))
8236 if (!(strict
& UNIFY_ALLOW_LESS_CV_QUAL
)
8237 && !at_least_as_qualified_p (parm
, arg
))
8243 /* Takes parameters as for type_unification. Returns 0 if the
8244 type deduction suceeds, 1 otherwise. The parameter STRICT is a
8245 bitwise or of the following flags:
8248 Require an exact match between PARM and ARG.
8249 UNIFY_ALLOW_MORE_CV_QUAL:
8250 Allow the deduced ARG to be more cv-qualified than ARG.
8251 UNIFY_ALLOW_LESS_CV_QUAL:
8252 Allow the deduced ARG to be less cv-qualified than ARG.
8253 UNIFY_ALLOW_DERIVED:
8254 Allow the deduced ARG to be a template base class of ARG,
8255 or a pointer to a template base class of the type pointed to by
8257 UNIFY_ALLOW_INTEGER:
8258 Allow any integral type to be deduced. See the TEMPLATE_PARM_INDEX
8259 case for more information. */
8262 unify (tparms
, targs
, parm
, arg
, strict
)
8263 tree tparms
, targs
, parm
, arg
;
8270 /* I don't think this will do the right thing with respect to types.
8271 But the only case I've seen it in so far has been array bounds, where
8272 signedness is the only information lost, and I think that will be
8274 while (TREE_CODE (parm
) == NOP_EXPR
)
8275 parm
= TREE_OPERAND (parm
, 0);
8277 if (arg
== error_mark_node
)
8279 if (arg
== unknown_type_node
)
8280 /* We can't deduce anything from this, but we might get all the
8281 template args from other function args. */
8284 /* If PARM uses template parameters, then we can't bail out here,
8285 even if ARG == PARM, since we won't record unifications for the
8286 template parameters. We might need them if we're trying to
8287 figure out which of two things is more specialized. */
8288 if (arg
== parm
&& !uses_template_parms (parm
))
8291 /* Immediately reject some pairs that won't unify because of
8292 cv-qualification mismatches. */
8293 if (TREE_CODE (arg
) == TREE_CODE (parm
)
8295 /* We check the cv-qualifiers when unifying with template type
8296 parameters below. We want to allow ARG `const T' to unify with
8297 PARM `T' for example, when computing which of two templates
8298 is more specialized, for example. */
8299 && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
8300 && !check_cv_quals_for_unify (strict
, arg
, parm
))
8303 switch (TREE_CODE (parm
))
8306 /* In a type which contains a nested-name-specifier, template
8307 argument values cannot be deduced for template parameters used
8308 within the nested-name-specifier. */
8311 case TEMPLATE_TYPE_PARM
:
8312 case TEMPLATE_TEMPLATE_PARM
:
8313 case BOUND_TEMPLATE_TEMPLATE_PARM
:
8314 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
8316 if (TEMPLATE_TYPE_LEVEL (parm
)
8317 != template_decl_level (tparm
))
8318 /* The PARM is not one we're trying to unify. Just check
8319 to see if it matches ARG. */
8320 return (TREE_CODE (arg
) == TREE_CODE (parm
)
8321 && same_type_p (parm
, arg
)) ? 0 : 1;
8322 idx
= TEMPLATE_TYPE_IDX (parm
);
8323 targ
= TREE_VEC_ELT (targs
, idx
);
8324 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, idx
));
8326 /* Check for mixed types and values. */
8327 if ((TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
8328 && TREE_CODE (tparm
) != TYPE_DECL
)
8329 || (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
8330 && TREE_CODE (tparm
) != TEMPLATE_DECL
))
8333 if (TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
8335 /* ARG must be constructed from a template class. */
8336 if (TREE_CODE (arg
) != RECORD_TYPE
|| !CLASSTYPE_TEMPLATE_INFO (arg
))
8340 tree parmtmpl
= TYPE_TI_TEMPLATE (parm
);
8341 tree parmvec
= TYPE_TI_ARGS (parm
);
8342 tree argvec
= CLASSTYPE_TI_ARGS (arg
);
8344 = DECL_INNERMOST_TEMPLATE_PARMS (CLASSTYPE_TI_TEMPLATE (arg
));
8347 /* The parameter and argument roles have to be switched here
8348 in order to handle default arguments properly. For example,
8349 template<template <class> class TT> void f(TT<int>)
8350 should be able to accept vector<int> which comes from
8351 template <class T, class Allocator = allocator>
8354 if (coerce_template_parms (argtmplvec
, parmvec
, parmtmpl
, 0, 1)
8358 /* Deduce arguments T, i from TT<T> or TT<i>.
8359 We check each element of PARMVEC and ARGVEC individually
8360 rather than the whole TREE_VEC since they can have
8361 different number of elements. */
8363 for (i
= 0; i
< TREE_VEC_LENGTH (parmvec
); ++i
)
8365 tree t
= TREE_VEC_ELT (parmvec
, i
);
8367 if (unify (tparms
, targs
, t
,
8368 TREE_VEC_ELT (argvec
, i
),
8373 arg
= CLASSTYPE_TI_TEMPLATE (arg
);
8375 /* Fall through to deduce template name. */
8378 if (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
8379 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
8381 /* Deduce template name TT from TT, TT<>, TT<T> and TT<i>. */
8383 /* Simple cases: Value already set, does match or doesn't. */
8384 if (targ
!= NULL_TREE
&& template_args_equal (targ
, arg
))
8391 /* If PARM is `const T' and ARG is only `int', we don't have
8392 a match unless we are allowing additional qualification.
8393 If ARG is `const int' and PARM is just `T' that's OK;
8394 that binds `const int' to `T'. */
8395 if (!check_cv_quals_for_unify (strict
| UNIFY_ALLOW_LESS_CV_QUAL
,
8399 /* Consider the case where ARG is `const volatile int' and
8400 PARM is `const T'. Then, T should be `volatile int'. */
8402 cp_build_qualified_type_real (arg
,
8404 & ~CP_TYPE_QUALS (parm
),
8406 if (arg
== error_mark_node
)
8409 /* Simple cases: Value already set, does match or doesn't. */
8410 if (targ
!= NULL_TREE
&& same_type_p (targ
, arg
))
8416 /* Make sure that ARG is not a variable-sized array. (Note that
8417 were talking about variable-sized arrays (like `int[n]'),
8418 rather than arrays of unknown size (like `int[]').) We'll
8419 get very confused by such a type since the bound of the array
8420 will not be computable in an instantiation. Besides, such
8421 types are not allowed in ISO C++, so we can do as we please
8423 if (TREE_CODE (arg
) == ARRAY_TYPE
8424 && !uses_template_parms (arg
)
8425 && (TREE_CODE (TYPE_MAX_VALUE (TYPE_DOMAIN (arg
)))
8429 TREE_VEC_ELT (targs
, idx
) = arg
;
8432 case TEMPLATE_PARM_INDEX
:
8433 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
8435 if (TEMPLATE_PARM_LEVEL (parm
)
8436 != template_decl_level (tparm
))
8437 /* The PARM is not one we're trying to unify. Just check
8438 to see if it matches ARG. */
8439 return (TREE_CODE (arg
) == TREE_CODE (parm
)
8440 && cp_tree_equal (parm
, arg
) > 0) ? 0 : 1;
8442 idx
= TEMPLATE_PARM_IDX (parm
);
8443 targ
= TREE_VEC_ELT (targs
, idx
);
8447 int i
= (cp_tree_equal (targ
, arg
) > 0);
8453 my_friendly_abort (42);
8456 /* [temp.deduct.type] If, in the declaration of a function template
8457 with a non-type template-parameter, the non-type
8458 template-parameter is used in an expression in the function
8459 parameter-list and, if the corresponding template-argument is
8460 deduced, the template-argument type shall match the type of the
8461 template-parameter exactly, except that a template-argument
8462 deduced from an array bound may be of any integral type.
8463 The non-type parameter might use already deduced type parameters. */
8464 if (same_type_p (TREE_TYPE (arg
),
8465 tsubst (TREE_TYPE (parm
), targs
, 0, NULL_TREE
)))
8467 else if ((strict
& UNIFY_ALLOW_INTEGER
)
8468 && (TREE_CODE (TREE_TYPE (parm
)) == INTEGER_TYPE
8469 || TREE_CODE (TREE_TYPE (parm
)) == BOOLEAN_TYPE
))
8474 TREE_VEC_ELT (targs
, idx
) = arg
;
8481 if (TREE_CODE (arg
) != POINTER_TYPE
)
8484 /* [temp.deduct.call]
8486 A can be another pointer or pointer to member type that can
8487 be converted to the deduced A via a qualification
8488 conversion (_conv.qual_).
8490 We pass down STRICT here rather than UNIFY_ALLOW_NONE.
8491 This will allow for additional cv-qualification of the
8492 pointed-to types if appropriate. In general, this is a bit
8493 too generous; we are only supposed to allow qualification
8494 conversions and this method will allow an ARG of char** and
8495 a deduced ARG of const char**. However, overload
8496 resolution will subsequently invalidate the candidate, so
8497 this is probably OK. */
8498 sub_strict
= strict
;
8500 if (TREE_CODE (TREE_TYPE (arg
)) != RECORD_TYPE
)
8501 /* The derived-to-base conversion only persists through one
8502 level of pointers. */
8503 sub_strict
&= ~UNIFY_ALLOW_DERIVED
;
8505 return unify (tparms
, targs
, TREE_TYPE (parm
),
8506 TREE_TYPE (arg
), sub_strict
);
8509 case REFERENCE_TYPE
:
8510 if (TREE_CODE (arg
) != REFERENCE_TYPE
)
8512 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
8516 if (TREE_CODE (arg
) != ARRAY_TYPE
)
8518 if ((TYPE_DOMAIN (parm
) == NULL_TREE
)
8519 != (TYPE_DOMAIN (arg
) == NULL_TREE
))
8521 if (TYPE_DOMAIN (parm
) != NULL_TREE
8522 && unify (tparms
, targs
, TYPE_DOMAIN (parm
),
8523 TYPE_DOMAIN (arg
), UNIFY_ALLOW_NONE
) != 0)
8525 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
8533 if (TREE_CODE (arg
) != TREE_CODE (parm
))
8536 if (TREE_CODE (parm
) == INTEGER_TYPE
8537 && TREE_CODE (TYPE_MAX_VALUE (parm
)) != INTEGER_CST
)
8539 if (TYPE_MIN_VALUE (parm
) && TYPE_MIN_VALUE (arg
)
8540 && unify (tparms
, targs
, TYPE_MIN_VALUE (parm
),
8541 TYPE_MIN_VALUE (arg
), UNIFY_ALLOW_INTEGER
))
8543 if (TYPE_MAX_VALUE (parm
) && TYPE_MAX_VALUE (arg
)
8544 && unify (tparms
, targs
, TYPE_MAX_VALUE (parm
),
8545 TYPE_MAX_VALUE (arg
), UNIFY_ALLOW_INTEGER
))
8548 /* We have already checked cv-qualification at the top of the
8550 else if (!same_type_ignoring_top_level_qualifiers_p (arg
, parm
))
8553 /* As far as unification is concerned, this wins. Later checks
8554 will invalidate it if necessary. */
8557 /* Types INTEGER_CST and MINUS_EXPR can come from array bounds. */
8558 /* Type INTEGER_CST can come from ordinary constant template args. */
8560 while (TREE_CODE (arg
) == NOP_EXPR
)
8561 arg
= TREE_OPERAND (arg
, 0);
8563 if (TREE_CODE (arg
) != INTEGER_CST
)
8565 return !tree_int_cst_equal (parm
, arg
);
8570 if (TREE_CODE (arg
) != TREE_VEC
)
8572 if (TREE_VEC_LENGTH (parm
) != TREE_VEC_LENGTH (arg
))
8574 for (i
= 0; i
< TREE_VEC_LENGTH (parm
); ++i
)
8575 if (unify (tparms
, targs
,
8576 TREE_VEC_ELT (parm
, i
), TREE_VEC_ELT (arg
, i
),
8584 if (TREE_CODE (arg
) != TREE_CODE (parm
))
8587 if (TYPE_PTRMEMFUNC_P (parm
))
8589 if (!TYPE_PTRMEMFUNC_P (arg
))
8592 return unify (tparms
, targs
,
8593 TYPE_PTRMEMFUNC_FN_TYPE (parm
),
8594 TYPE_PTRMEMFUNC_FN_TYPE (arg
),
8598 if (CLASSTYPE_TEMPLATE_INFO (parm
))
8602 if (strict
& UNIFY_ALLOW_DERIVED
)
8604 /* First, we try to unify the PARM and ARG directly. */
8605 t
= try_class_unification (tparms
, targs
,
8610 /* Fallback to the special case allowed in
8613 If P is a class, and P has the form
8614 template-id, then A can be a derived class of
8615 the deduced A. Likewise, if P is a pointer to
8616 a class of the form template-id, A can be a
8617 pointer to a derived class pointed to by the
8619 t
= get_template_base (tparms
, targs
,
8622 if (! t
|| t
== error_mark_node
)
8626 else if (CLASSTYPE_TEMPLATE_INFO (arg
)
8627 && (CLASSTYPE_TI_TEMPLATE (parm
)
8628 == CLASSTYPE_TI_TEMPLATE (arg
)))
8629 /* Perhaps PARM is something like S<U> and ARG is S<int>.
8630 Then, we should unify `int' and `U'. */
8633 /* There's no chance of unication succeeding. */
8636 return unify (tparms
, targs
, CLASSTYPE_TI_ARGS (parm
),
8637 CLASSTYPE_TI_ARGS (t
), UNIFY_ALLOW_NONE
);
8639 else if (!same_type_ignoring_top_level_qualifiers_p (parm
, arg
))
8645 if (TREE_CODE (arg
) != TREE_CODE (parm
))
8648 if (unify (tparms
, targs
, TREE_TYPE (parm
),
8649 TREE_TYPE (arg
), UNIFY_ALLOW_NONE
))
8651 return type_unification_real (tparms
, targs
, TYPE_ARG_TYPES (parm
),
8652 TYPE_ARG_TYPES (arg
), 1,
8656 if (TREE_CODE (arg
) != OFFSET_TYPE
)
8658 if (unify (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
8659 TYPE_OFFSET_BASETYPE (arg
), UNIFY_ALLOW_NONE
))
8661 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
8665 if (arg
!= decl_constant_value (parm
))
8670 /* Matched cases are handled by the ARG == PARM test above. */
8674 if (TREE_CODE (TREE_OPERAND (parm
, 1)) == INTEGER_CST
)
8676 /* We handle this case specially, since it comes up with
8677 arrays. In particular, something like:
8679 template <int N> void f(int (&x)[N]);
8681 Here, we are trying to unify the range type, which
8682 looks like [0 ... (N - 1)]. */
8684 t1
= TREE_OPERAND (parm
, 0);
8685 t2
= TREE_OPERAND (parm
, 1);
8687 t
= fold (build (PLUS_EXPR
, integer_type_node
, arg
, t2
));
8689 return unify (tparms
, targs
, t1
, t
, strict
);
8691 /* else fall through */
8694 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (parm
))))
8695 /* We're looking at an expression. This can happen with
8699 void foo(S<I>, S<I + 2>);
8701 This is a "nondeduced context":
8705 The nondeduced contexts are:
8707 --A type that is a template-id in which one or more of
8708 the template-arguments is an expression that references
8709 a template-parameter.
8711 In these cases, we assume deduction succeeded, but don't
8712 actually infer any unifications. */
8715 sorry ("use of `%s' in template type unification",
8716 tree_code_name
[(int) TREE_CODE (parm
)]);
8722 /* Called if RESULT is explicitly instantiated, or is a member of an
8723 explicitly instantiated class, or if using -frepo and the
8724 instantiation of RESULT has been assigned to this file. */
8727 mark_decl_instantiated (result
, extern_p
)
8731 if (TREE_CODE (result
) != FUNCTION_DECL
)
8732 /* The TREE_PUBLIC flag for function declarations will have been
8733 set correctly by tsubst. */
8734 TREE_PUBLIC (result
) = 1;
8736 /* We used to set this unconditionally; we moved that to
8737 do_decl_instantiation so it wouldn't get set on members of
8738 explicit class template instantiations. But we still need to set
8739 it here for the 'extern template' case in order to suppress
8740 implicit instantiations. */
8742 SET_DECL_EXPLICIT_INSTANTIATION (result
);
8746 DECL_INTERFACE_KNOWN (result
) = 1;
8747 DECL_NOT_REALLY_EXTERN (result
) = 1;
8749 /* Always make artificials weak. */
8750 if (DECL_ARTIFICIAL (result
) && flag_weak
)
8751 comdat_linkage (result
);
8752 /* For WIN32 we also want to put explicit instantiations in
8753 linkonce sections. */
8754 else if (TREE_PUBLIC (result
))
8755 maybe_make_one_only (result
);
8757 else if (TREE_CODE (result
) == FUNCTION_DECL
)
8761 /* Given two function templates PAT1 and PAT2, and explicit template
8762 arguments EXPLICIT_ARGS return:
8764 1 if PAT1 is more specialized than PAT2 as described in [temp.func.order].
8765 -1 if PAT2 is more specialized than PAT1.
8766 0 if neither is more specialized. */
8769 more_specialized (pat1
, pat2
, explicit_args
)
8770 tree pat1
, pat2
, explicit_args
;
8776 = get_bindings_overload (pat1
, DECL_TEMPLATE_RESULT (pat2
), explicit_args
);
8781 = get_bindings_overload (pat2
, DECL_TEMPLATE_RESULT (pat1
), explicit_args
);
8788 /* Given two class template specialization list nodes PAT1 and PAT2, return:
8790 1 if PAT1 is more specialized than PAT2 as described in [temp.class.order].
8791 -1 if PAT2 is more specialized than PAT1.
8792 0 if neither is more specialized. */
8795 more_specialized_class (pat1
, pat2
)
8801 targs
= get_class_bindings (TREE_VALUE (pat1
), TREE_PURPOSE (pat1
),
8802 TREE_PURPOSE (pat2
));
8806 targs
= get_class_bindings (TREE_VALUE (pat2
), TREE_PURPOSE (pat2
),
8807 TREE_PURPOSE (pat1
));
8814 /* Return the template arguments that will produce the function signature
8815 DECL from the function template FN, with the explicit template
8816 arguments EXPLICIT_ARGS. If CHECK_RETTYPE is 1, the return type must
8817 also match. Return NULL_TREE if no satisfactory arguments could be
8821 get_bindings_real (fn
, decl
, explicit_args
, check_rettype
)
8822 tree fn
, decl
, explicit_args
;
8825 int ntparms
= DECL_NTPARMS (fn
);
8826 tree targs
= make_tree_vec (ntparms
);
8828 tree decl_arg_types
;
8831 /* Substitute the explicit template arguments into the type of DECL.
8832 The call to fn_type_unification will handle substitution into the
8834 decl_type
= TREE_TYPE (decl
);
8835 if (explicit_args
&& uses_template_parms (decl_type
))
8838 tree converted_args
;
8840 if (DECL_TEMPLATE_INFO (decl
))
8841 tmpl
= DECL_TI_TEMPLATE (decl
);
8843 /* We can get here for some illegal specializations. */
8847 = (coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
8848 explicit_args
, NULL_TREE
,
8850 /*require_all_arguments=*/0));
8851 if (converted_args
== error_mark_node
)
8854 decl_type
= tsubst (decl_type
, converted_args
, /*complain=*/0,
8856 if (decl_type
== error_mark_node
)
8860 /* If FN is a static member function, adjust the type of DECL
8862 decl_arg_types
= TYPE_ARG_TYPES (decl_type
);
8863 if (DECL_STATIC_FUNCTION_P (fn
)
8864 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
8865 decl_arg_types
= TREE_CHAIN (decl_arg_types
);
8867 i
= fn_type_unification (fn
, explicit_args
, targs
,
8869 (check_rettype
|| DECL_CONV_FN_P (fn
)
8870 ? TREE_TYPE (decl_type
) : NULL_TREE
),
8879 /* For most uses, we want to check the return type. */
8882 get_bindings (fn
, decl
, explicit_args
)
8883 tree fn
, decl
, explicit_args
;
8885 return get_bindings_real (fn
, decl
, explicit_args
, 1);
8888 /* But for more_specialized, we only care about the parameter types. */
8891 get_bindings_overload (fn
, decl
, explicit_args
)
8892 tree fn
, decl
, explicit_args
;
8894 return get_bindings_real (fn
, decl
, explicit_args
, 0);
8897 /* Return the innermost template arguments that, when applied to a
8898 template specialization whose innermost template parameters are
8899 TPARMS, and whose specialization arguments are ARGS, yield the
8902 For example, suppose we have:
8904 template <class T, class U> struct S {};
8905 template <class T> struct S<T*, int> {};
8907 Then, suppose we want to get `S<double*, int>'. The TPARMS will be
8908 {T}, the PARMS will be {T*, int} and the ARGS will be {double*,
8909 int}. The resulting vector will be {double}, indicating that `T'
8910 is bound to `double'. */
8913 get_class_bindings (tparms
, parms
, args
)
8914 tree tparms
, parms
, args
;
8916 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
8917 tree vec
= make_tree_vec (ntparms
);
8919 args
= INNERMOST_TEMPLATE_ARGS (args
);
8921 if (unify (tparms
, vec
, parms
, args
, UNIFY_ALLOW_NONE
))
8924 for (i
= 0; i
< ntparms
; ++i
)
8925 if (! TREE_VEC_ELT (vec
, i
))
8931 /* In INSTANTIATIONS is a list of <INSTANTIATION, TEMPLATE> pairs.
8932 Pick the most specialized template, and return the corresponding
8933 instantiation, or if there is no corresponding instantiation, the
8934 template itself. EXPLICIT_ARGS is any template arguments explicity
8935 mentioned in a template-id. If there is no most specialized
8936 template, error_mark_node is returned. If there are no templates
8937 at all, NULL_TREE is returned. */
8940 most_specialized_instantiation (instantiations
, explicit_args
)
8941 tree instantiations
;
8947 if (!instantiations
)
8950 champ
= instantiations
;
8951 for (fn
= TREE_CHAIN (instantiations
); fn
; fn
= TREE_CHAIN (fn
))
8953 fate
= more_specialized (TREE_VALUE (champ
),
8954 TREE_VALUE (fn
), explicit_args
);
8961 fn
= TREE_CHAIN (fn
);
8963 return error_mark_node
;
8969 for (fn
= instantiations
; fn
&& fn
!= champ
; fn
= TREE_CHAIN (fn
))
8971 fate
= more_specialized (TREE_VALUE (champ
),
8972 TREE_VALUE (fn
), explicit_args
);
8974 return error_mark_node
;
8977 return TREE_PURPOSE (champ
) ? TREE_PURPOSE (champ
) : TREE_VALUE (champ
);
8980 /* Return the most specialized of the list of templates in FNS that can
8981 produce an instantiation matching DECL, given the explicit template
8982 arguments EXPLICIT_ARGS. */
8985 most_specialized (fns
, decl
, explicit_args
)
8986 tree fns
, decl
, explicit_args
;
8988 tree candidates
= NULL_TREE
;
8991 for (fn
= fns
; fn
; fn
= TREE_CHAIN (fn
))
8993 tree candidate
= TREE_VALUE (fn
);
8995 args
= get_bindings (candidate
, decl
, explicit_args
);
8997 candidates
= tree_cons (NULL_TREE
, candidate
, candidates
);
9000 return most_specialized_instantiation (candidates
, explicit_args
);
9003 /* If DECL is a specialization of some template, return the most
9004 general such template. Otherwise, returns NULL_TREE.
9008 template <class T> struct S { template <class U> void f(U); };
9010 if TMPL is `template <class U> void S<int>::f(U)' this will return
9011 the full template. This function will not trace past partial
9012 specializations, however. For example, given in addition:
9014 template <class T> struct S<T*> { template <class U> void f(U); };
9016 if TMPL is `template <class U> void S<int*>::f(U)' this will return
9017 `template <class T> template <class U> S<T*>::f(U)'. */
9020 most_general_template (decl
)
9023 /* If DECL is a FUNCTION_DECL, find the TEMPLATE_DECL of which it is
9024 an immediate specialization. */
9025 if (TREE_CODE (decl
) == FUNCTION_DECL
)
9027 if (DECL_TEMPLATE_INFO (decl
)) {
9028 decl
= DECL_TI_TEMPLATE (decl
);
9030 /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE for a
9032 if (TREE_CODE (decl
) != TEMPLATE_DECL
)
9038 /* Look for more and more general templates. */
9039 while (DECL_TEMPLATE_INFO (decl
))
9041 /* The DECL_TI_TEMPLATE can be a LOOKUP_EXPR or IDENTIFIER_NODE
9042 in some cases. (See cp-tree.h for details.) */
9043 if (TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
9046 /* Stop if we run into an explicitly specialized class template. */
9047 if (!DECL_NAMESPACE_SCOPE_P (decl
)
9048 && DECL_CONTEXT (decl
)
9049 && CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (decl
)))
9052 decl
= DECL_TI_TEMPLATE (decl
);
9058 /* Return the most specialized of the class template specializations
9059 of TMPL which can produce an instantiation matching ARGS, or
9060 error_mark_node if the choice is ambiguous. */
9063 most_specialized_class (tmpl
, args
)
9067 tree list
= NULL_TREE
;
9072 tmpl
= most_general_template (tmpl
);
9073 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
); t
; t
= TREE_CHAIN (t
))
9076 = get_class_bindings (TREE_VALUE (t
), TREE_PURPOSE (t
), args
);
9079 list
= tree_cons (TREE_PURPOSE (t
), TREE_VALUE (t
), list
);
9080 TREE_TYPE (list
) = TREE_TYPE (t
);
9090 for (; t
; t
= TREE_CHAIN (t
))
9092 fate
= more_specialized_class (champ
, t
);
9101 return error_mark_node
;
9107 for (t
= list
; t
&& t
!= champ
; t
= TREE_CHAIN (t
))
9109 fate
= more_specialized_class (champ
, t
);
9111 return error_mark_node
;
9117 /* called from the parser. */
9120 do_decl_instantiation (declspecs
, declarator
, storage
)
9121 tree declspecs
, declarator
, storage
;
9123 tree decl
= grokdeclarator (declarator
, declspecs
, NORMAL
, 0, NULL_TREE
);
9124 tree result
= NULL_TREE
;
9128 /* An error ocurred, for which grokdeclarator has already issued
9129 an appropriate message. */
9131 else if (! DECL_LANG_SPECIFIC (decl
))
9133 cp_error ("explicit instantiation of non-template `%#D'", decl
);
9136 else if (TREE_CODE (decl
) == VAR_DECL
)
9138 /* There is an asymmetry here in the way VAR_DECLs and
9139 FUNCTION_DECLs are handled by grokdeclarator. In the case of
9140 the latter, the DECL we get back will be marked as a
9141 template instantiation, and the appropriate
9142 DECL_TEMPLATE_INFO will be set up. This does not happen for
9143 VAR_DECLs so we do the lookup here. Probably, grokdeclarator
9144 should handle VAR_DECLs as it currently handles
9146 result
= lookup_field (DECL_CONTEXT (decl
), DECL_NAME (decl
), 0, 0);
9147 if (result
&& TREE_CODE (result
) != VAR_DECL
)
9149 cp_error ("no matching template for `%D' found", result
);
9153 else if (TREE_CODE (decl
) != FUNCTION_DECL
)
9155 cp_error ("explicit instantiation of `%#D'", decl
);
9161 /* Check for various error cases. Note that if the explicit
9162 instantiation is legal the RESULT will currently be marked as an
9163 *implicit* instantiation; DECL_EXPLICIT_INSTANTIATION is not set
9164 until we get here. */
9166 if (DECL_TEMPLATE_SPECIALIZATION (result
))
9170 No program shall both explicitly instantiate and explicitly
9171 specialize a template. */
9172 cp_pedwarn ("explicit instantiation of `%#D' after", result
);
9173 cp_pedwarn_at ("explicit specialization here", result
);
9176 else if (DECL_EXPLICIT_INSTANTIATION (result
))
9180 No program shall explicitly instantiate any template more
9183 We check DECL_INTERFACE_KNOWN so as not to complain when the first
9184 instantiation was `extern' and the second is not, and EXTERN_P for
9185 the opposite case. If -frepo, chances are we already got marked
9186 as an explicit instantion because of the repo file. */
9187 if (DECL_INTERFACE_KNOWN (result
) && !extern_p
&& !flag_use_repository
)
9188 cp_pedwarn ("duplicate explicit instantiation of `%#D'", result
);
9190 /* If we've already instantiated the template, just return now. */
9191 if (DECL_INTERFACE_KNOWN (result
))
9194 else if (!DECL_IMPLICIT_INSTANTIATION (result
))
9196 cp_error ("no matching template for `%D' found", result
);
9199 else if (!DECL_TEMPLATE_INFO (result
))
9201 cp_pedwarn ("explicit instantiation of non-template `%#D'", result
);
9205 if (flag_external_templates
)
9208 if (storage
== NULL_TREE
)
9210 else if (storage
== ridpointers
[(int) RID_EXTERN
])
9213 cp_pedwarn ("ISO C++ forbids the use of `extern' on explicit instantiations");
9217 cp_error ("storage class `%D' applied to template instantiation",
9220 /* Under the new ABI, we need to make sure to instantiate all the
9221 cloned versions of constructors or destructors. */
9223 (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (result
) ||
9224 DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (result
)) &&
9225 !(TREE_CHAIN (result
) &&
9226 DECL_CLONED_FUNCTION (TREE_CHAIN (result
))))
9227 clone_function_decl(result
, /*update_method_vec_p=*/0);
9229 SET_DECL_EXPLICIT_INSTANTIATION (result
);
9230 mark_decl_instantiated (result
, extern_p
);
9231 repo_template_instantiated (result
, extern_p
);
9233 instantiate_decl (result
, /*defer_ok=*/1);
9237 mark_class_instantiated (t
, extern_p
)
9241 SET_CLASSTYPE_EXPLICIT_INSTANTIATION (t
);
9242 SET_CLASSTYPE_INTERFACE_KNOWN (t
);
9243 CLASSTYPE_INTERFACE_ONLY (t
) = extern_p
;
9244 CLASSTYPE_VTABLE_NEEDS_WRITING (t
) = ! extern_p
;
9245 TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (t
)) = extern_p
;
9248 CLASSTYPE_DEBUG_REQUESTED (t
) = 1;
9249 rest_of_type_compilation (t
, 1);
9253 /* Perform an explicit instantiation of template class T. STORAGE, if
9254 non-null, is the RID for extern, inline or static. COMPLAIN is
9255 non-zero if this is called from the parser, zero if called recursively,
9256 since the standard is unclear (as detailed below). */
9259 do_type_instantiation (t
, storage
, complain
)
9267 if (TREE_CODE (t
) == TYPE_DECL
)
9270 if (! CLASS_TYPE_P (t
) || ! CLASSTYPE_TEMPLATE_INFO (t
))
9272 cp_error ("explicit instantiation of non-template type `%T'", t
);
9278 /* With -fexternal-templates, explicit instantiations are treated the same
9279 as implicit ones. */
9280 if (flag_external_templates
)
9283 if (!COMPLETE_TYPE_P (t
))
9286 cp_error ("explicit instantiation of `%#T' before definition of template",
9291 if (storage
!= NULL_TREE
)
9294 cp_pedwarn("ISO C++ forbids the use of `%s' on explicit instantiations",
9295 IDENTIFIER_POINTER (storage
));
9297 if (storage
== ridpointers
[(int) RID_INLINE
])
9299 else if (storage
== ridpointers
[(int) RID_EXTERN
])
9301 else if (storage
== ridpointers
[(int) RID_STATIC
])
9305 cp_error ("storage class `%D' applied to template instantiation",
9311 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
9315 No program shall both explicitly instantiate and explicitly
9316 specialize a template. */
9319 cp_error ("explicit instantiation of `%#T' after", t
);
9320 cp_error_at ("explicit specialization here", t
);
9324 else if (CLASSTYPE_EXPLICIT_INSTANTIATION (t
))
9328 No program shall explicitly instantiate any template more
9331 If CLASSTYPE_INTERFACE_ONLY, then the first explicit instantiation
9332 was `extern'. If EXTERN_P then the second is. If -frepo, chances
9333 are we already got marked as an explicit instantion because of the
9334 repo file. All these cases are OK. */
9335 if (!CLASSTYPE_INTERFACE_ONLY (t
) && !extern_p
&& !flag_use_repository
9337 cp_pedwarn ("duplicate explicit instantiation of `%#T'", t
);
9339 /* If we've already instantiated the template, just return now. */
9340 if (!CLASSTYPE_INTERFACE_ONLY (t
))
9344 mark_class_instantiated (t
, extern_p
);
9345 repo_template_instantiated (t
, extern_p
);
9353 /* In contrast to implicit instantiation, where only the
9354 declarations, and not the definitions, of members are
9355 instantiated, we have here:
9359 The explicit instantiation of a class template specialization
9360 implies the instantiation of all of its members not
9361 previously explicitly specialized in the translation unit
9362 containing the explicit instantiation.
9364 Of course, we can't instantiate member template classes, since
9365 we don't have any arguments for them. Note that the standard
9366 is unclear on whether the instatiation of the members are
9367 *explicit* instantiations or not. We choose to be generous,
9368 and not set DECL_EXPLICIT_INSTANTIATION. Therefore, we allow
9369 the explicit instantiation of a class where some of the members
9370 have no definition in the current translation unit. */
9373 for (tmp
= TYPE_METHODS (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
9374 if (TREE_CODE (tmp
) == FUNCTION_DECL
9375 && DECL_TEMPLATE_INSTANTIATION (tmp
))
9377 mark_decl_instantiated (tmp
, extern_p
);
9378 repo_template_instantiated (tmp
, extern_p
);
9380 instantiate_decl (tmp
, /*defer_ok=*/1);
9383 for (tmp
= TYPE_FIELDS (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
9384 if (TREE_CODE (tmp
) == VAR_DECL
&& DECL_TEMPLATE_INSTANTIATION (tmp
))
9386 mark_decl_instantiated (tmp
, extern_p
);
9387 repo_template_instantiated (tmp
, extern_p
);
9389 instantiate_decl (tmp
, /*defer_ok=*/1);
9392 for (tmp
= CLASSTYPE_TAGS (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
9393 if (IS_AGGR_TYPE (TREE_VALUE (tmp
))
9394 && !uses_template_parms (CLASSTYPE_TI_ARGS (TREE_VALUE (tmp
))))
9395 do_type_instantiation (TYPE_MAIN_DECL (TREE_VALUE (tmp
)), storage
, 0);
9399 /* Given a function DECL, which is a specialization of TMPL, modify
9400 DECL to be a re-instantiation of TMPL with the same template
9401 arguments. TMPL should be the template into which tsubst'ing
9402 should occur for DECL, not the most general template.
9404 One reason for doing this is a scenario like this:
9407 void f(const T&, int i);
9409 void g() { f(3, 7); }
9412 void f(const T& t, const int i) { }
9414 Note that when the template is first instantiated, with
9415 instantiate_template, the resulting DECL will have no name for the
9416 first parameter, and the wrong type for the second. So, when we go
9417 to instantiate the DECL, we regenerate it. */
9420 regenerate_decl_from_template (decl
, tmpl
)
9424 /* The most general version of TMPL. */
9426 /* The arguments used to instantiate DECL, from the most general
9433 args
= DECL_TI_ARGS (decl
);
9434 code_pattern
= DECL_TEMPLATE_RESULT (tmpl
);
9436 /* Unregister the specialization so that when we tsubst we will not
9437 just return DECL. We don't have to unregister DECL from TMPL
9438 because if would only be registered there if it were a partial
9439 instantiation of a specialization, which it isn't: it's a full
9441 gen_tmpl
= most_general_template (tmpl
);
9442 unregistered
= unregister_specialization (decl
, gen_tmpl
);
9444 /* If the DECL was not unregistered then something peculiar is
9445 happening: we created a specialization but did not call
9446 register_specialization for it. */
9447 my_friendly_assert (unregistered
, 0);
9449 if (TREE_CODE (decl
) == VAR_DECL
)
9450 /* Make sure that we can see identifiers, and compute access
9451 correctly, for the class members used in the declaration of
9452 this static variable. */
9453 pushclass (DECL_CONTEXT (decl
), 2);
9455 /* Do the substitution to get the new declaration. */
9456 new_decl
= tsubst (code_pattern
, args
, /*complain=*/1, NULL_TREE
);
9458 if (TREE_CODE (decl
) == VAR_DECL
)
9460 /* Set up DECL_INITIAL, since tsubst doesn't. */
9461 DECL_INITIAL (new_decl
) =
9462 tsubst_expr (DECL_INITIAL (code_pattern
), args
,
9463 /*complain=*/1, DECL_TI_TEMPLATE (decl
));
9464 /* Pop the class context we pushed above. */
9467 else if (TREE_CODE (decl
) == FUNCTION_DECL
)
9469 /* Convince duplicate_decls to use the DECL_ARGUMENTS from the
9471 DECL_INITIAL (new_decl
) = error_mark_node
;
9472 /* And don't complain about a duplicate definition. */
9473 DECL_INITIAL (decl
) = NULL_TREE
;
9476 /* The immediate parent of the new template is still whatever it was
9477 before, even though tsubst sets DECL_TI_TEMPLATE up as the most
9478 general template. We also reset the DECL_ASSEMBLER_NAME since
9479 tsubst always calculates the name as if the function in question
9480 were really a template instance, and sometimes, with friend
9481 functions, this is not so. See tsubst_friend_function for
9483 DECL_TI_TEMPLATE (new_decl
) = DECL_TI_TEMPLATE (decl
);
9484 DECL_ASSEMBLER_NAME (new_decl
) = DECL_ASSEMBLER_NAME (decl
);
9485 DECL_RTL (new_decl
) = DECL_RTL (decl
);
9486 DECL_USE_TEMPLATE (new_decl
) = DECL_USE_TEMPLATE (decl
);
9488 /* Call duplicate decls to merge the old and new declarations. */
9489 duplicate_decls (new_decl
, decl
);
9491 /* Now, re-register the specialization. */
9492 register_specialization (decl
, gen_tmpl
, args
);
9495 /* Produce the definition of D, a _DECL generated from a template. If
9496 DEFER_OK is non-zero, then we don't have to actually do the
9497 instantiation now; we just have to do it sometime. */
9500 instantiate_decl (d
, defer_ok
)
9504 tree tmpl
= DECL_TI_TEMPLATE (d
);
9505 tree args
= DECL_TI_ARGS (d
);
9510 int pattern_defined
;
9512 const char *file
= input_filename
;
9514 /* This function should only be used to instantiate templates for
9515 functions and static member variables. */
9516 my_friendly_assert (TREE_CODE (d
) == FUNCTION_DECL
9517 || TREE_CODE (d
) == VAR_DECL
, 0);
9519 /* Don't instantiate cloned functions. Instead, instantiate the
9520 functions they cloned. */
9521 if (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_CLONED_FUNCTION_P (d
))
9522 d
= DECL_CLONED_FUNCTION (d
);
9524 if (DECL_TEMPLATE_INSTANTIATED (d
))
9525 /* D has already been instantiated. It might seem reasonable to
9526 check whether or not D is an explict instantiation, and, if so,
9527 stop here. But when an explicit instantiation is deferred
9528 until the end of the compilation, DECL_EXPLICIT_INSTANTIATION
9529 is set, even though we still need to do the instantiation. */
9532 /* If we already have a specialization of this declaration, then
9533 there's no reason to instantiate it. Note that
9534 retrieve_specialization gives us both instantiations and
9535 specializations, so we must explicitly check
9536 DECL_TEMPLATE_SPECIALIZATION. */
9537 gen_tmpl
= most_general_template (tmpl
);
9538 spec
= retrieve_specialization (gen_tmpl
, args
);
9539 if (spec
!= NULL_TREE
&& DECL_TEMPLATE_SPECIALIZATION (spec
))
9542 /* This needs to happen before any tsubsting. */
9543 if (! push_tinst_level (d
))
9546 timevar_push (TV_PARSE
);
9548 /* Set TD to the template whose DECL_TEMPLATE_RESULT is the pattern
9549 for the instantiation. This is not always the most general
9550 template. Consider, for example:
9553 struct S { template <class U> void f();
9554 template <> void f<int>(); };
9556 and an instantiation of S<double>::f<int>. We want TD to be the
9557 specialization S<T>::f<int>, not the more general S<T>::f<U>. */
9559 while (/* An instantiation cannot have a definition, so we need a
9560 more general template. */
9561 DECL_TEMPLATE_INSTANTIATION (td
)
9562 /* We must also deal with friend templates. Given:
9564 template <class T> struct S {
9565 template <class U> friend void f() {};
9568 S<int>::f<U> say, is not an instantiation of S<T>::f<U>,
9569 so far as the language is concerned, but that's still
9570 where we get the pattern for the instantiation from. On
9571 ther hand, if the definition comes outside the class, say:
9573 template <class T> struct S {
9574 template <class U> friend void f();
9576 template <class U> friend void f() {}
9578 we don't need to look any further. That's what the check for
9579 DECL_INITIAL is for. */
9580 || (TREE_CODE (d
) == FUNCTION_DECL
9581 && DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (td
)
9582 && !DECL_INITIAL (DECL_TEMPLATE_RESULT (td
))))
9584 /* The present template, TD, should not be a definition. If it
9585 were a definition, we should be using it! Note that we
9586 cannot restructure the loop to just keep going until we find
9587 a template with a definition, since that might go too far if
9588 a specialization was declared, but not defined. */
9589 my_friendly_assert (!(TREE_CODE (d
) == VAR_DECL
9590 && !DECL_IN_AGGR_P (DECL_TEMPLATE_RESULT (td
))),
9593 /* Fetch the more general template. */
9594 td
= DECL_TI_TEMPLATE (td
);
9597 code_pattern
= DECL_TEMPLATE_RESULT (td
);
9599 if (TREE_CODE (d
) == FUNCTION_DECL
)
9600 pattern_defined
= (DECL_SAVED_TREE (code_pattern
) != NULL_TREE
);
9602 pattern_defined
= ! DECL_IN_AGGR_P (code_pattern
);
9604 push_to_top_level ();
9605 lineno
= DECL_SOURCE_LINE (d
);
9606 input_filename
= DECL_SOURCE_FILE (d
);
9608 if (pattern_defined
)
9610 repo_template_used (d
);
9612 if (flag_external_templates
&& ! DECL_INTERFACE_KNOWN (d
))
9614 if (flag_alt_external_templates
)
9616 if (interface_unknown
)
9617 warn_if_unknown_interface (d
);
9619 else if (DECL_INTERFACE_KNOWN (code_pattern
))
9621 DECL_INTERFACE_KNOWN (d
) = 1;
9622 DECL_NOT_REALLY_EXTERN (d
) = ! DECL_EXTERNAL (code_pattern
);
9625 warn_if_unknown_interface (code_pattern
);
9629 import_export_decl (d
);
9632 /* We need to set up DECL_INITIAL regardless of pattern_defined if
9633 the variable is a static const initialized in the class body. */
9634 if (TREE_CODE (d
) == VAR_DECL
9635 && TREE_READONLY (d
)
9636 && DECL_INITIAL (d
) == NULL_TREE
9637 && DECL_INITIAL (code_pattern
) != NULL_TREE
)
9639 /* Reject all external templates except inline functions. */
9640 else if (DECL_INTERFACE_KNOWN (d
)
9641 && ! DECL_NOT_REALLY_EXTERN (d
)
9642 && ! (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_INLINE (d
)))
9644 /* Defer all other templates, unless we have been explicitly
9645 forbidden from doing so. We restore the source position here
9646 because it's used by add_pending_template. */
9647 else if (! pattern_defined
|| defer_ok
)
9650 input_filename
= file
;
9652 if (at_eof
&& !pattern_defined
9653 && DECL_EXPLICIT_INSTANTIATION (d
))
9656 The definition of a non-exported function template, a
9657 non-exported member function template, or a non-exported
9658 member function or static data member of a class template
9659 shall be present in every translation unit in which it is
9660 explicitly instantiated. */
9661 cp_error ("explicit instantiation of `%D' but no definition available",
9664 add_pending_template (d
);
9668 /* We're now committed to instantiating this template. Mark it as
9669 instantiated so that recursive calls to instantiate_decl do not
9670 try to instantiate it again. */
9671 DECL_TEMPLATE_INSTANTIATED (d
) = 1;
9673 /* Regenerate the declaration in case the template has been modified
9674 by a subsequent redeclaration. */
9675 regenerate_decl_from_template (d
, td
);
9677 /* We already set the file and line above. Reset them now in case
9678 they changed as a result of calling regenerate_decl_from_template. */
9679 lineno
= DECL_SOURCE_LINE (d
);
9680 input_filename
= DECL_SOURCE_FILE (d
);
9682 if (TREE_CODE (d
) == VAR_DECL
)
9684 DECL_IN_AGGR_P (d
) = 0;
9685 if (DECL_INTERFACE_KNOWN (d
))
9686 DECL_EXTERNAL (d
) = ! DECL_NOT_REALLY_EXTERN (d
);
9689 DECL_EXTERNAL (d
) = 1;
9690 DECL_NOT_REALLY_EXTERN (d
) = 1;
9692 cp_finish_decl (d
, DECL_INITIAL (d
), NULL_TREE
, 0);
9694 else if (TREE_CODE (d
) == FUNCTION_DECL
)
9696 htab_t saved_local_specializations
;
9698 /* Save away the current list, in case we are instantiating one
9699 template from within the body of another. */
9700 saved_local_specializations
= local_specializations
;
9702 /* Set up the list of local specializations. */
9703 local_specializations
= htab_create (37,
9708 /* Set up context. */
9709 start_function (NULL_TREE
, d
, NULL_TREE
, SF_PRE_PARSED
);
9711 /* We already set up __FUNCTION__, etc., so we don't want to do
9713 function_name_declared_p
= 1;
9715 /* Substitute into the body of the function. */
9716 tsubst_expr (DECL_SAVED_TREE (code_pattern
), args
,
9717 /*complain=*/1, tmpl
);
9719 /* We don't need the local specializations any more. */
9720 htab_delete (local_specializations
);
9721 local_specializations
= saved_local_specializations
;
9723 /* Finish the function. */
9724 expand_body (finish_function (0));
9727 /* We're not deferring instantiation any more. */
9728 TI_PENDING_TEMPLATE_FLAG (DECL_TEMPLATE_INFO (d
)) = 0;
9732 input_filename
= file
;
9734 pop_from_top_level ();
9737 timevar_pop (TV_PARSE
);
9742 /* Run through the list of templates that we wish we could
9743 instantiate, and instantiate any we can. */
9746 instantiate_pending_templates ()
9749 int instantiated_something
= 0;
9756 t
= &pending_templates
;
9759 tree instantiation
= TREE_VALUE (*t
);
9761 reopen_tinst_level (TREE_PURPOSE (*t
));
9763 if (TYPE_P (instantiation
))
9767 if (!COMPLETE_TYPE_P (instantiation
))
9769 instantiate_class_template (instantiation
);
9770 if (CLASSTYPE_TEMPLATE_INSTANTIATION (instantiation
))
9771 for (fn
= TYPE_METHODS (instantiation
);
9773 fn
= TREE_CHAIN (fn
))
9774 if (! DECL_ARTIFICIAL (fn
))
9775 instantiate_decl (fn
, /*defer_ok=*/0);
9776 if (COMPLETE_TYPE_P (instantiation
))
9778 instantiated_something
= 1;
9783 if (COMPLETE_TYPE_P (instantiation
))
9784 /* If INSTANTIATION has been instantiated, then we don't
9785 need to consider it again in the future. */
9786 *t
= TREE_CHAIN (*t
);
9788 t
= &TREE_CHAIN (*t
);
9792 if (!DECL_TEMPLATE_SPECIALIZATION (instantiation
)
9793 && !DECL_TEMPLATE_INSTANTIATED (instantiation
))
9795 instantiation
= instantiate_decl (instantiation
,
9797 if (DECL_TEMPLATE_INSTANTIATED (instantiation
))
9799 instantiated_something
= 1;
9804 if (DECL_TEMPLATE_SPECIALIZATION (instantiation
)
9805 || DECL_TEMPLATE_INSTANTIATED (instantiation
))
9806 /* If INSTANTIATION has been instantiated, then we don't
9807 need to consider it again in the future. */
9808 *t
= TREE_CHAIN (*t
);
9810 t
= &TREE_CHAIN (*t
);
9813 current_tinst_level
= NULL_TREE
;
9817 /* Go through the things that are template instantiations if we are
9818 using guiding declarations. */
9819 t
= &maybe_templates
;
9826 fn
= TREE_VALUE (*t
);
9828 if (DECL_INITIAL (fn
))
9829 /* If the FN is already defined, then it was either already
9830 instantiated or, even though guiding declarations were
9831 allowed, a non-template definition was provided. */
9835 template = TREE_PURPOSE (*t
);
9836 args
= get_bindings (template, fn
, NULL_TREE
);
9837 fn
= instantiate_template (template, args
);
9838 instantiate_decl (fn
, /*defer_ok=*/0);
9842 /* Remove this entry from the chain. */
9843 *t
= TREE_CHAIN (*t
);
9845 maybe_template_tail
= t
;
9849 return instantiated_something
;
9852 /* Substitute ARGVEC into T, which is a list of initializers for
9853 either base class or a non-static data member. The TREE_PURPOSEs
9854 are DECLs, and the TREE_VALUEs are the initializer values. Used by
9855 instantiate_decl. */
9858 tsubst_initializer_list (t
, argvec
)
9861 tree first
= NULL_TREE
;
9864 for (; t
; t
= TREE_CHAIN (t
))
9870 decl
= tsubst_copy (TREE_PURPOSE (t
), argvec
, /*complain=*/1,
9872 init
= tsubst_expr (TREE_VALUE (t
), argvec
, /*complain=*/1,
9877 else if (TREE_CODE (init
) == TREE_LIST
)
9878 for (val
= init
; val
; val
= TREE_CHAIN (val
))
9879 TREE_VALUE (val
) = convert_from_reference (TREE_VALUE (val
));
9881 init
= convert_from_reference (init
);
9883 *p
= build_tree_list (decl
, init
);
9884 p
= &TREE_CHAIN (*p
);
9889 /* Set CURRENT_ACCESS_SPECIFIER based on the protection of DECL. */
9892 set_current_access_from_decl (decl
)
9895 if (TREE_PRIVATE (decl
))
9896 current_access_specifier
= access_private_node
;
9897 else if (TREE_PROTECTED (decl
))
9898 current_access_specifier
= access_protected_node
;
9900 current_access_specifier
= access_public_node
;
9903 /* Instantiate an enumerated type. TAG is the template type, NEWTAG
9904 is the instantiation (which should have been created with
9905 start_enum) and ARGS are the template arguments to use. */
9908 tsubst_enum (tag
, newtag
, args
)
9915 for (e
= TYPE_VALUES (tag
); e
; e
= TREE_CHAIN (e
))
9919 /* Note that in a template enum, the TREE_VALUE is the
9920 CONST_DECL, not the corresponding INTEGER_CST. */
9921 value
= tsubst_expr (DECL_INITIAL (TREE_VALUE (e
)),
9922 args
, /*complain=*/1,
9925 /* Give this enumeration constant the correct access. */
9926 set_current_access_from_decl (TREE_VALUE (e
));
9928 /* Actually build the enumerator itself. */
9929 build_enumerator (TREE_PURPOSE (e
), value
, newtag
);
9932 finish_enum (newtag
);
9933 DECL_SOURCE_LINE (TYPE_NAME (newtag
)) = DECL_SOURCE_LINE (TYPE_NAME (tag
));
9934 DECL_SOURCE_FILE (TYPE_NAME (newtag
)) = DECL_SOURCE_FILE (TYPE_NAME (tag
));
9937 /* DECL is a FUNCTION_DECL that is a template specialization. Return
9938 its type -- but without substituting the innermost set of template
9939 arguments. So, innermost set of template parameters will appear in
9940 the type. If CONTEXTP is non-NULL, then the partially substituted
9941 DECL_CONTEXT (if any) will also be filled in. Similarly, TPARMSP
9942 will be filled in with the substituted template parameters, if it
9946 get_mostly_instantiated_function_type (decl
, contextp
, tparmsp
)
9951 tree context
= NULL_TREE
;
9958 tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
9959 targs
= DECL_TI_ARGS (decl
);
9960 tparms
= DECL_TEMPLATE_PARMS (tmpl
);
9961 parm_depth
= TMPL_PARMS_DEPTH (tparms
);
9963 /* There should be as many levels of arguments as there are levels
9965 my_friendly_assert (parm_depth
== TMPL_ARGS_DEPTH (targs
), 0);
9967 fn_type
= TREE_TYPE (tmpl
);
9968 if (DECL_STATIC_FUNCTION_P (decl
))
9969 context
= DECL_CONTEXT (decl
);
9971 if (parm_depth
== 1)
9972 /* No substitution is necessary. */
9979 /* Replace the innermost level of the TARGS with NULL_TREEs to
9980 let tsubst know not to subsitute for those parameters. */
9981 partial_args
= make_tree_vec (TREE_VEC_LENGTH (targs
));
9982 for (i
= 1; i
< TMPL_ARGS_DEPTH (targs
); ++i
)
9983 SET_TMPL_ARGS_LEVEL (partial_args
, i
,
9984 TMPL_ARGS_LEVEL (targs
, i
));
9985 SET_TMPL_ARGS_LEVEL (partial_args
,
9986 TMPL_ARGS_DEPTH (targs
),
9987 make_tree_vec (DECL_NTPARMS (tmpl
)));
9989 /* Now, do the (partial) substitution to figure out the
9990 appropriate function type. */
9991 fn_type
= tsubst (fn_type
, partial_args
, /*complain=*/1, NULL_TREE
);
9992 if (DECL_STATIC_FUNCTION_P (decl
))
9993 context
= tsubst (context
, partial_args
, /*complain=*/1, NULL_TREE
);
9995 /* Substitute into the template parameters to obtain the real
9996 innermost set of parameters. This step is important if the
9997 innermost set of template parameters contains value
9998 parameters whose types depend on outer template parameters. */
9999 TREE_VEC_LENGTH (partial_args
)--;
10000 tparms
= tsubst_template_parms (tparms
, partial_args
, /*complain=*/1);
10004 *contextp
= context
;
10011 /* Set the DECL_ASSEMBLER_NAME for DECL, which is a FUNCTION_DECL that
10012 is either an instantiation or specialization of a template
10016 set_mangled_name_for_template_decl (decl
)
10019 tree context
= NULL_TREE
;
10026 my_friendly_assert (TREE_CODE (decl
) == FUNCTION_DECL
, 0);
10027 my_friendly_assert (DECL_TEMPLATE_INFO (decl
) != NULL_TREE
, 0);
10029 /* Under the new ABI, we don't need special machinery. */
10032 set_mangled_name_for_decl (decl
);
10036 /* The names of template functions must be mangled so as to indicate
10037 what template is being specialized with what template arguments.
10038 For example, each of the following three functions must get
10039 different mangled names:
10042 template <> void f<7>(int);
10043 template <> void f<8>(int); */
10045 targs
= DECL_TI_ARGS (decl
);
10046 if (uses_template_parms (targs
))
10047 /* This DECL is for a partial instantiation. There's no need to
10048 mangle the name of such an entity. */
10051 /* We now compute the PARMS and RET_TYPE to give to
10052 build_decl_overload_real. The PARMS and RET_TYPE are the
10053 parameter and return types of the template, after all but the
10054 innermost template arguments have been substituted, not the
10055 parameter and return types of the function DECL. For example,
10058 template <class T> T f(T);
10060 both PARMS and RET_TYPE should be `T' even if DECL is `int f(int)'.
10061 A more subtle example is:
10063 template <class T> struct S { template <class U> void f(T, U); }
10065 Here, if DECL is `void S<int>::f(int, double)', PARMS should be
10066 {int, U}. Thus, the args that we want to subsitute into the
10067 return and parameter type for the function are those in TARGS,
10068 with the innermost level omitted. */
10069 fn_type
= get_mostly_instantiated_function_type (decl
, &context
, &tparms
);
10071 /* Now, get the innermost parameters and arguments, and figure out
10072 the parameter and return types. */
10073 tparms
= INNERMOST_TEMPLATE_PARMS (tparms
);
10074 targs
= INNERMOST_TEMPLATE_ARGS (targs
);
10075 ret_type
= TREE_TYPE (fn_type
);
10076 parm_types
= TYPE_ARG_TYPES (fn_type
);
10078 /* For a static member function, we generate a fake `this' pointer,
10079 for the purposes of mangling. This indicates of which class the
10080 function is a member. Because of:
10084 There shall not be a static and a nonstatic member function
10085 with the same name and the same parameter types
10087 we don't have to worry that this will result in a clash with a
10088 non-static member function. */
10089 if (DECL_STATIC_FUNCTION_P (decl
))
10090 parm_types
= hash_tree_chain (build_pointer_type (context
), parm_types
);
10092 /* There should be the same number of template parameters as
10093 template arguments. */
10094 my_friendly_assert (TREE_VEC_LENGTH (tparms
) == TREE_VEC_LENGTH (targs
),
10097 /* Actually set the DECL_ASSEMBLER_NAME. */
10098 DECL_ASSEMBLER_NAME (decl
)
10099 = build_decl_overload_real (decl
, parm_types
, ret_type
,
10101 DECL_FUNCTION_MEMBER_P (decl
)
10102 + DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (decl
));
10105 /* Return truthvalue if we're processing a template different from
10106 the last one involved in diagnotics. */
10108 problematic_instantiation_changed ()
10110 return last_template_error_tick
!= tinst_level_tick
;
10113 /* Remember current template involved in diagnostics. */
10115 record_last_problematic_instantiation ()
10117 last_template_error_tick
= tinst_level_tick
;
10121 current_instantiation ()
10123 return current_tinst_level
;