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". */
49 /* The type of functions taking a tree, and some additional data, and
51 typedef int (*tree_fn_t
) PARAMS ((tree
, void*));
53 extern struct obstack permanent_obstack
;
55 /* The PENDING_TEMPLATES is a TREE_LIST of templates whose
56 instantiations have been deferred, either because their definitions
57 were not yet available, or because we were putting off doing the
58 work. The TREE_PURPOSE of each entry is a SRCLOC indicating where
59 the instantiate request occurred; the TREE_VALUE is a either a DECL
60 (for a function or static data member), or a TYPE (for a class)
61 indicating what we are hoping to instantiate. */
62 static tree pending_templates
;
63 static tree
*template_tail
= &pending_templates
;
65 static tree maybe_templates
;
66 static tree
*maybe_template_tail
= &maybe_templates
;
68 int processing_template_parmlist
;
69 static int template_header_count
;
71 static tree saved_trees
;
72 static varray_type inline_parm_levels
;
73 static size_t inline_parm_levels_used
;
75 tree current_tinst_level
;
77 /* A map from local variable declarations in the body of the template
78 presently being instantiated to the corresponding instantiated
80 static htab_t local_specializations
;
82 #define obstack_chunk_alloc xmalloc
83 #define obstack_chunk_free free
85 #define UNIFY_ALLOW_NONE 0
86 #define UNIFY_ALLOW_MORE_CV_QUAL 1
87 #define UNIFY_ALLOW_LESS_CV_QUAL 2
88 #define UNIFY_ALLOW_DERIVED 4
89 #define UNIFY_ALLOW_INTEGER 8
91 #define GTB_VIA_VIRTUAL 1 /* The base class we are examining is
92 virtual, or a base class of a virtual
94 #define GTB_IGNORE_TYPE 2 /* We don't need to try to unify the current
95 type with the desired type. */
97 static int resolve_overloaded_unification
PARAMS ((tree
, tree
, tree
, tree
,
98 unification_kind_t
, int));
99 static int try_one_overload
PARAMS ((tree
, tree
, tree
, tree
, tree
,
100 unification_kind_t
, int));
101 static int unify
PARAMS ((tree
, tree
, tree
, tree
, int));
102 static void add_pending_template
PARAMS ((tree
));
103 static int push_tinst_level
PARAMS ((tree
));
104 static void reopen_tinst_level
PARAMS ((tree
));
105 static tree classtype_mangled_name
PARAMS ((tree
));
106 static char *mangle_class_name_for_template
PARAMS ((char *, tree
, tree
));
107 static tree tsubst_initializer_list
PARAMS ((tree
, tree
));
108 static int list_eq
PARAMS ((tree
, tree
));
109 static tree get_class_bindings
PARAMS ((tree
, tree
, tree
));
110 static tree coerce_template_parms
PARAMS ((tree
, tree
, tree
, int, int));
111 static void tsubst_enum
PARAMS ((tree
, tree
, tree
));
112 static tree add_to_template_args
PARAMS ((tree
, tree
));
113 static tree add_outermost_template_args
PARAMS ((tree
, tree
));
114 static void maybe_adjust_types_for_deduction
PARAMS ((unification_kind_t
, tree
*,
116 static int type_unification_real
PARAMS ((tree
, tree
, tree
, tree
,
117 int, unification_kind_t
, int));
118 static void note_template_header
PARAMS ((int));
119 static tree maybe_fold_nontype_arg
PARAMS ((tree
));
120 static tree convert_nontype_argument
PARAMS ((tree
, tree
));
121 static tree convert_template_argument
PARAMS ((tree
, tree
, tree
, int,
123 static tree get_bindings_overload
PARAMS ((tree
, tree
, tree
));
124 static int for_each_template_parm
PARAMS ((tree
, tree_fn_t
, void*));
125 static tree build_template_parm_index
PARAMS ((int, int, int, tree
, tree
));
126 static int inline_needs_template_parms
PARAMS ((tree
));
127 static void push_inline_template_parms_recursive
PARAMS ((tree
, int));
128 static tree retrieve_specialization
PARAMS ((tree
, tree
));
129 static tree retrieve_local_specialization
PARAMS ((tree
));
130 static tree register_specialization
PARAMS ((tree
, tree
, tree
));
131 static tree register_local_specialization
PARAMS ((tree
, tree
));
132 static int unregister_specialization
PARAMS ((tree
, tree
));
133 static tree reduce_template_parm_level
PARAMS ((tree
, tree
, int));
134 static tree build_template_decl
PARAMS ((tree
, tree
));
135 static int mark_template_parm
PARAMS ((tree
, void *));
136 static tree tsubst_friend_function
PARAMS ((tree
, tree
));
137 static tree tsubst_friend_class
PARAMS ((tree
, tree
));
138 static tree get_bindings_real
PARAMS ((tree
, tree
, tree
, int));
139 static int template_decl_level
PARAMS ((tree
));
140 static tree maybe_get_template_decl_from_type_decl
PARAMS ((tree
));
141 static int check_cv_quals_for_unify
PARAMS ((int, tree
, tree
));
142 static tree tsubst_template_arg_vector
PARAMS ((tree
, tree
, int));
143 static tree tsubst_template_parms
PARAMS ((tree
, tree
, int));
144 static void regenerate_decl_from_template
PARAMS ((tree
, tree
));
145 static tree most_specialized
PARAMS ((tree
, tree
, tree
));
146 static tree most_specialized_class
PARAMS ((tree
, tree
));
147 static void set_mangled_name_for_template_decl
PARAMS ((tree
));
148 static int template_class_depth_real
PARAMS ((tree
, int));
149 static tree tsubst_aggr_type
PARAMS ((tree
, tree
, int, tree
, int));
150 static tree tsubst_decl
PARAMS ((tree
, tree
, tree
, tree
));
151 static tree tsubst_arg_types
PARAMS ((tree
, tree
, int, tree
));
152 static tree tsubst_function_type
PARAMS ((tree
, tree
, int, tree
));
153 static void check_specialization_scope
PARAMS ((void));
154 static tree process_partial_specialization
PARAMS ((tree
));
155 static void set_current_access_from_decl
PARAMS ((tree
));
156 static void check_default_tmpl_args
PARAMS ((tree
, tree
, int, int));
157 static tree tsubst_call_declarator_parms
PARAMS ((tree
, tree
, int, tree
));
158 static tree get_template_base_recursive
PARAMS ((tree
, tree
,
159 tree
, tree
, tree
, int));
160 static tree get_template_base
PARAMS ((tree
, tree
, tree
, tree
));
161 static tree try_class_unification
PARAMS ((tree
, tree
, tree
, tree
));
162 static int coerce_template_template_parms
PARAMS ((tree
, tree
, int,
164 static tree determine_specialization
PARAMS ((tree
, tree
, tree
*, int));
165 static int template_args_equal
PARAMS ((tree
, tree
));
166 static void print_template_context
PARAMS ((int));
167 static void tsubst_default_arguments
PARAMS ((tree
));
168 static tree for_each_template_parm_r
PARAMS ((tree
*, int *, void *));
169 static tree instantiate_clone
PARAMS ((tree
, tree
));
171 /* Called once to initialize pt.c. */
176 ggc_add_tree_root (&pending_templates
, 1);
177 ggc_add_tree_root (&maybe_templates
, 1);
178 ggc_add_tree_root (&saved_trees
, 1);
179 ggc_add_tree_root (¤t_tinst_level
, 1);
182 /* Do any processing required when DECL (a member template declaration
183 using TEMPLATE_PARAMETERS as its innermost parameter list) is
184 finished. Returns the TEMPLATE_DECL corresponding to DECL, unless
185 it is a specialization, in which case the DECL itself is returned. */
188 finish_member_template_decl (decl
)
191 if (decl
== NULL_TREE
|| decl
== void_type_node
)
193 else if (decl
== error_mark_node
)
194 /* By returning NULL_TREE, the parser will just ignore this
195 declaration. We have already issued the error. */
197 else if (TREE_CODE (decl
) == TREE_LIST
)
199 /* Assume that the class is the only declspec. */
200 decl
= TREE_VALUE (decl
);
201 if (IS_AGGR_TYPE (decl
) && CLASSTYPE_TEMPLATE_INFO (decl
)
202 && ! CLASSTYPE_TEMPLATE_SPECIALIZATION (decl
))
204 tree tmpl
= CLASSTYPE_TI_TEMPLATE (decl
);
205 check_member_template (tmpl
);
210 else if (TREE_CODE (decl
) == FIELD_DECL
)
211 cp_error ("data member `%D' cannot be a member template", decl
);
212 else if (DECL_TEMPLATE_INFO (decl
))
214 if (!DECL_TEMPLATE_SPECIALIZATION (decl
))
216 check_member_template (DECL_TI_TEMPLATE (decl
));
217 return DECL_TI_TEMPLATE (decl
);
223 cp_error ("invalid member template declaration `%D'", decl
);
225 return error_mark_node
;
228 /* Returns the template nesting level of the indicated class TYPE.
238 A<T>::B<U> has depth two, while A<T> has depth one.
239 Both A<T>::B<int> and A<int>::B<U> have depth one, if
240 COUNT_SPECIALIZATIONS is 0 or if they are instantiations, not
243 This function is guaranteed to return 0 if passed NULL_TREE so
244 that, for example, `template_class_depth (current_class_type)' is
248 template_class_depth_real (type
, count_specializations
)
250 int count_specializations
;
255 type
&& TREE_CODE (type
) != NAMESPACE_DECL
;
256 type
= (TREE_CODE (type
) == FUNCTION_DECL
)
257 ? CP_DECL_CONTEXT (type
) : TYPE_CONTEXT (type
))
259 if (TREE_CODE (type
) != FUNCTION_DECL
)
261 if (CLASSTYPE_TEMPLATE_INFO (type
)
262 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (type
))
263 && ((count_specializations
264 && CLASSTYPE_TEMPLATE_SPECIALIZATION (type
))
265 || uses_template_parms (CLASSTYPE_TI_ARGS (type
))))
270 if (DECL_TEMPLATE_INFO (type
)
271 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (type
))
272 && ((count_specializations
273 && DECL_TEMPLATE_SPECIALIZATION (type
))
274 || uses_template_parms (DECL_TI_ARGS (type
))))
282 /* Returns the template nesting level of the indicated class TYPE.
283 Like template_class_depth_real, but instantiations do not count in
287 template_class_depth (type
)
290 return template_class_depth_real (type
, /*count_specializations=*/0);
293 /* Returns 1 if processing DECL as part of do_pending_inlines
294 needs us to push template parms. */
297 inline_needs_template_parms (decl
)
300 if (! DECL_TEMPLATE_INFO (decl
))
303 return (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (most_general_template (decl
)))
304 > (processing_template_decl
+ DECL_TEMPLATE_SPECIALIZATION (decl
)));
307 /* Subroutine of maybe_begin_member_template_processing.
308 Push the template parms in PARMS, starting from LEVELS steps into the
309 chain, and ending at the beginning, since template parms are listed
313 push_inline_template_parms_recursive (parmlist
, levels
)
317 tree parms
= TREE_VALUE (parmlist
);
321 push_inline_template_parms_recursive (TREE_CHAIN (parmlist
), levels
- 1);
323 ++processing_template_decl
;
324 current_template_parms
325 = tree_cons (build_int_2 (0, processing_template_decl
),
326 parms
, current_template_parms
);
327 TEMPLATE_PARMS_FOR_INLINE (current_template_parms
) = 1;
330 for (i
= 0; i
< TREE_VEC_LENGTH (parms
); ++i
)
332 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
333 my_friendly_assert (DECL_P (parm
), 0);
335 switch (TREE_CODE (parm
))
344 /* Make a CONST_DECL as is done in process_template_parm.
345 It is ugly that we recreate this here; the original
346 version built in process_template_parm is no longer
348 tree decl
= build_decl (CONST_DECL
, DECL_NAME (parm
),
350 DECL_ARTIFICIAL (decl
) = 1;
351 DECL_INITIAL (decl
) = DECL_INITIAL (parm
);
352 SET_DECL_TEMPLATE_PARM_P (decl
);
358 my_friendly_abort (0);
363 /* Restore the template parameter context for a member template or
364 a friend template defined in a class definition. */
367 maybe_begin_member_template_processing (decl
)
373 if (inline_needs_template_parms (decl
))
375 parms
= DECL_TEMPLATE_PARMS (most_general_template (decl
));
376 levels
= TMPL_PARMS_DEPTH (parms
) - processing_template_decl
;
378 if (DECL_TEMPLATE_SPECIALIZATION (decl
))
381 parms
= TREE_CHAIN (parms
);
384 push_inline_template_parms_recursive (parms
, levels
);
387 /* Remember how many levels of template parameters we pushed so that
388 we can pop them later. */
389 if (!inline_parm_levels
)
390 VARRAY_INT_INIT (inline_parm_levels
, 4, "inline_parm_levels");
391 if (inline_parm_levels_used
== inline_parm_levels
->num_elements
)
392 VARRAY_GROW (inline_parm_levels
, 2 * inline_parm_levels_used
);
393 VARRAY_INT (inline_parm_levels
, inline_parm_levels_used
) = levels
;
394 ++inline_parm_levels_used
;
397 /* Undo the effects of begin_member_template_processing. */
400 maybe_end_member_template_processing ()
404 if (!inline_parm_levels_used
)
407 --inline_parm_levels_used
;
409 i
< VARRAY_INT (inline_parm_levels
, inline_parm_levels_used
);
412 --processing_template_decl
;
413 current_template_parms
= TREE_CHAIN (current_template_parms
);
418 /* Returns non-zero iff T is a member template function. We must be
421 template <class T> class C { void f(); }
423 Here, f is a template function, and a member, but not a member
424 template. This function does not concern itself with the origin of
425 T, only its present state. So if we have
427 template <class T> class C { template <class U> void f(U); }
429 then neither C<int>::f<char> nor C<T>::f<double> is considered
430 to be a member template. But, `template <class U> void
431 C<int>::f(U)' is considered a member template. */
434 is_member_template (t
)
437 if (!DECL_FUNCTION_TEMPLATE_P (t
))
438 /* Anything that isn't a function or a template function is
439 certainly not a member template. */
442 /* A local class can't have member templates. */
443 if (decl_function_context (t
))
446 return (DECL_FUNCTION_MEMBER_P (DECL_TEMPLATE_RESULT (t
))
447 /* If there are more levels of template parameters than
448 there are template classes surrounding the declaration,
449 then we have a member template. */
450 && (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (t
)) >
451 template_class_depth (DECL_CONTEXT (t
))));
455 /* Returns non-zero iff T is a member template class. See
456 is_member_template for a description of what precisely constitutes
457 a member template. */
460 is_member_template_class (t
)
463 if (!DECL_CLASS_TEMPLATE_P (t
))
464 /* Anything that isn't a class template, is certainly not a member
468 if (!DECL_CLASS_SCOPE_P (t
))
469 /* Anything whose context isn't a class type is surely not a
473 /* If there are more levels of template parameters than there are
474 template classes surrounding the declaration, then we have a
476 return (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (t
)) >
477 template_class_depth (DECL_CONTEXT (t
)));
481 /* Return a new template argument vector which contains all of ARGS,
482 but has as its innermost set of arguments the EXTRA_ARGS. */
485 add_to_template_args (args
, extra_args
)
494 extra_depth
= TMPL_ARGS_DEPTH (extra_args
);
495 new_args
= make_tree_vec (TMPL_ARGS_DEPTH (args
) + extra_depth
);
497 for (i
= 1; i
<= TMPL_ARGS_DEPTH (args
); ++i
)
498 SET_TMPL_ARGS_LEVEL (new_args
, i
, TMPL_ARGS_LEVEL (args
, i
));
500 for (j
= 1; j
<= extra_depth
; ++j
, ++i
)
501 SET_TMPL_ARGS_LEVEL (new_args
, i
, TMPL_ARGS_LEVEL (extra_args
, j
));
506 /* Like add_to_template_args, but only the outermost ARGS are added to
507 the EXTRA_ARGS. In particular, all but TMPL_ARGS_DEPTH
508 (EXTRA_ARGS) levels are added. This function is used to combine
509 the template arguments from a partial instantiation with the
510 template arguments used to attain the full instantiation from the
511 partial instantiation. */
514 add_outermost_template_args (args
, extra_args
)
520 /* If there are more levels of EXTRA_ARGS than there are ARGS,
521 something very fishy is going on. */
522 my_friendly_assert (TMPL_ARGS_DEPTH (args
) >= TMPL_ARGS_DEPTH (extra_args
),
525 /* If *all* the new arguments will be the EXTRA_ARGS, just return
527 if (TMPL_ARGS_DEPTH (args
) == TMPL_ARGS_DEPTH (extra_args
))
530 /* For the moment, we make ARGS look like it contains fewer levels. */
531 TREE_VEC_LENGTH (args
) -= TMPL_ARGS_DEPTH (extra_args
);
533 new_args
= add_to_template_args (args
, extra_args
);
535 /* Now, we restore ARGS to its full dimensions. */
536 TREE_VEC_LENGTH (args
) += TMPL_ARGS_DEPTH (extra_args
);
541 /* Return the N levels of innermost template arguments from the ARGS. */
544 get_innermost_template_args (args
, n
)
552 my_friendly_assert (n
>= 0, 20000603);
554 /* If N is 1, just return the innermost set of template arguments. */
556 return TMPL_ARGS_LEVEL (args
, TMPL_ARGS_DEPTH (args
));
558 /* If we're not removing anything, just return the arguments we were
560 extra_levels
= TMPL_ARGS_DEPTH (args
) - n
;
561 my_friendly_assert (extra_levels
>= 0, 20000603);
562 if (extra_levels
== 0)
565 /* Make a new set of arguments, not containing the outer arguments. */
566 new_args
= make_tree_vec (n
);
567 for (i
= 1; i
<= n
; ++i
)
568 SET_TMPL_ARGS_LEVEL (new_args
, i
,
569 TMPL_ARGS_LEVEL (args
, i
+ extra_levels
));
574 /* We've got a template header coming up; push to a new level for storing
578 begin_template_parm_list ()
580 /* We use a non-tag-transparent scope here, which causes pushtag to
581 put tags in this scope, rather than in the enclosing class or
582 namespace scope. This is the right thing, since we want
583 TEMPLATE_DECLS, and not TYPE_DECLS for template classes. For a
584 global template class, push_template_decl handles putting the
585 TEMPLATE_DECL into top-level scope. For a nested template class,
588 template <class T> struct S1 {
589 template <class T> struct S2 {};
592 pushtag contains special code to call pushdecl_with_scope on the
593 TEMPLATE_DECL for S2. */
594 begin_scope (sk_template_parms
);
595 ++processing_template_decl
;
596 ++processing_template_parmlist
;
597 note_template_header (0);
600 /* This routine is called when a specialization is declared. If it is
601 illegal to declare a specialization here, an error is reported. */
604 check_specialization_scope ()
606 tree scope
= current_scope ();
610 An explicit specialization shall be declared in the namespace of
611 which the template is a member, or, for member templates, in the
612 namespace of which the enclosing class or enclosing class
613 template is a member. An explicit specialization of a member
614 function, member class or static data member of a class template
615 shall be declared in the namespace of which the class template
617 if (scope
&& TREE_CODE (scope
) != NAMESPACE_DECL
)
618 cp_error ("explicit specialization in non-namespace scope `%D'",
623 In an explicit specialization declaration for a member of a class
624 template or a member template that appears in namespace scope,
625 the member template and some of its enclosing class templates may
626 remain unspecialized, except that the declaration shall not
627 explicitly specialize a class member template if its enclosing
628 class templates are not explicitly specialized as well. */
629 if (current_template_parms
)
630 cp_error ("enclosing class templates are not explicitly specialized");
633 /* We've just seen template <>. */
636 begin_specialization ()
638 begin_scope (sk_template_spec
);
639 note_template_header (1);
640 check_specialization_scope ();
643 /* Called at then end of processing a declaration preceeded by
647 end_specialization ()
650 reset_specialization ();
653 /* Any template <>'s that we have seen thus far are not referring to a
654 function specialization. */
657 reset_specialization ()
659 processing_specialization
= 0;
660 template_header_count
= 0;
663 /* We've just seen a template header. If SPECIALIZATION is non-zero,
664 it was of the form template <>. */
667 note_template_header (specialization
)
670 processing_specialization
= specialization
;
671 template_header_count
++;
674 /* We're beginning an explicit instantiation. */
677 begin_explicit_instantiation ()
679 ++processing_explicit_instantiation
;
684 end_explicit_instantiation ()
686 my_friendly_assert(processing_explicit_instantiation
> 0, 0);
687 --processing_explicit_instantiation
;
690 /* The TYPE is being declared. If it is a template type, that means it
691 is a partial specialization. Do appropriate error-checking. */
694 maybe_process_partial_specialization (type
)
697 if (IS_AGGR_TYPE (type
) && CLASSTYPE_USE_TEMPLATE (type
))
699 if (CLASSTYPE_IMPLICIT_INSTANTIATION (type
)
700 && !COMPLETE_TYPE_P (type
))
702 if (current_namespace
703 != decl_namespace_context (CLASSTYPE_TI_TEMPLATE (type
)))
705 cp_pedwarn ("specializing `%#T' in different namespace", type
);
706 cp_pedwarn_at (" from definition of `%#D'",
707 CLASSTYPE_TI_TEMPLATE (type
));
709 SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (type
);
710 if (processing_template_decl
)
711 push_template_decl (TYPE_MAIN_DECL (type
));
713 else if (CLASSTYPE_TEMPLATE_INSTANTIATION (type
))
714 cp_error ("specialization of `%T' after instantiation", type
);
716 else if (processing_specialization
)
717 cp_error ("explicit specialization of non-template `%T'", type
);
720 /* Retrieve the specialization (in the sense of [temp.spec] - a
721 specialization is either an instantiation or an explicit
722 specialization) of TMPL for the given template ARGS. If there is
723 no such specialization, return NULL_TREE. The ARGS are a vector of
724 arguments, or a vector of vectors of arguments, in the case of
725 templates with more than one level of parameters. */
728 retrieve_specialization (tmpl
, args
)
734 my_friendly_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
, 0);
736 /* There should be as many levels of arguments as there are
737 levels of parameters. */
738 my_friendly_assert (TMPL_ARGS_DEPTH (args
)
739 == TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
)),
742 for (s
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
745 if (comp_template_args (TREE_PURPOSE (s
), args
))
746 return TREE_VALUE (s
);
751 /* Like retrieve_speciailization, but for local declarations. */
754 retrieve_local_specialization (tmpl
)
757 return (tree
) htab_find (local_specializations
, tmpl
);
760 /* Returns non-zero iff DECL is a specialization of TMPL. */
763 is_specialization_of (decl
, tmpl
)
769 if (TREE_CODE (decl
) == FUNCTION_DECL
)
773 t
= DECL_TEMPLATE_INFO (t
) ? DECL_TI_TEMPLATE (t
) : NULL_TREE
)
779 my_friendly_assert (TREE_CODE (decl
) == TYPE_DECL
, 0);
781 for (t
= TREE_TYPE (decl
);
783 t
= CLASSTYPE_USE_TEMPLATE (t
)
784 ? TREE_TYPE (CLASSTYPE_TI_TEMPLATE (t
)) : NULL_TREE
)
785 if (same_type_ignoring_top_level_qualifiers_p (t
, TREE_TYPE (tmpl
)))
792 /* Register the specialization SPEC as a specialization of TMPL with
793 the indicated ARGS. Returns SPEC, or an equivalent prior
794 declaration, if available. */
797 register_specialization (spec
, tmpl
, args
)
804 my_friendly_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
, 0);
806 if (TREE_CODE (spec
) == FUNCTION_DECL
807 && uses_template_parms (DECL_TI_ARGS (spec
)))
808 /* This is the FUNCTION_DECL for a partial instantiation. Don't
809 register it; we want the corresponding TEMPLATE_DECL instead.
810 We use `uses_template_parms (DECL_TI_ARGS (spec))' rather than
811 the more obvious `uses_template_parms (spec)' to avoid problems
812 with default function arguments. In particular, given
815 template <class T> void f(T t1, T t = T())
817 the default argument expression is not substituted for in an
818 instantiation unless and until it is actually needed. */
821 /* There should be as many levels of arguments as there are
822 levels of parameters. */
823 my_friendly_assert (TMPL_ARGS_DEPTH (args
)
824 == TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
)),
827 for (s
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
831 tree fn
= TREE_VALUE (s
);
833 /* We can sometimes try to re-register a specialization that we've
834 already got. In particular, regenerate_decl_from_template
835 calls duplicate_decls which will update the specialization
836 list. But, we'll still get called again here anyhow. It's
837 more convenient to simply allow this than to try to prevent it. */
840 else if (comp_template_args (TREE_PURPOSE (s
), args
))
842 if (DECL_TEMPLATE_SPECIALIZATION (spec
))
844 if (DECL_TEMPLATE_INSTANTIATION (fn
))
847 || DECL_EXPLICIT_INSTANTIATION (fn
))
849 cp_error ("specialization of %D after instantiation",
855 /* This situation should occur only if the first
856 specialization is an implicit instantiation,
857 the second is an explicit specialization, and
858 the implicit instantiation has not yet been
859 used. That situation can occur if we have
860 implicitly instantiated a member function and
861 then specialized it later.
863 We can also wind up here if a friend
864 declaration that looked like an instantiation
865 turns out to be a specialization:
867 template <class T> void foo(T);
868 class S { friend void foo<>(int) };
869 template <> void foo(int);
871 We transform the existing DECL in place so that
872 any pointers to it become pointers to the
875 If there was a definition for the template, but
876 not for the specialization, we want this to
877 look as if there is no definition, and vice
879 DECL_INITIAL (fn
) = NULL_TREE
;
880 duplicate_decls (spec
, fn
);
885 else if (DECL_TEMPLATE_SPECIALIZATION (fn
))
887 duplicate_decls (spec
, fn
);
894 DECL_TEMPLATE_SPECIALIZATIONS (tmpl
)
895 = tree_cons (args
, spec
, DECL_TEMPLATE_SPECIALIZATIONS (tmpl
));
900 /* Unregister the specialization SPEC as a specialization of TMPL.
901 Returns nonzero if the SPEC was listed as a specialization of
905 unregister_specialization (spec
, tmpl
)
911 for (s
= &DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
913 s
= &TREE_CHAIN (*s
))
914 if (TREE_VALUE (*s
) == spec
)
916 *s
= TREE_CHAIN (*s
);
923 /* Like register_specialization, but for local declarations. We are
924 registering SPEC, an instantiation of TMPL. */
927 register_local_specialization (spec
, tmpl
)
933 slot
= htab_find_slot (local_specializations
, tmpl
, INSERT
);
939 /* Print the list of candidate FNS in an error message. */
942 print_candidates (fns
)
947 const char *str
= "candidates are:";
949 for (fn
= fns
; fn
!= NULL_TREE
; fn
= TREE_CHAIN (fn
))
953 for (f
= TREE_VALUE (fn
); f
; f
= OVL_NEXT (f
))
954 cp_error_at ("%s %+#D", str
, OVL_CURRENT (f
));
959 /* Returns the template (one of the functions given by TEMPLATE_ID)
960 which can be specialized to match the indicated DECL with the
961 explicit template args given in TEMPLATE_ID. The DECL may be
962 NULL_TREE if none is available. In that case, the functions in
963 TEMPLATE_ID are non-members.
965 If NEED_MEMBER_TEMPLATE is non-zero the function is known to be a
966 specialization of a member template.
968 The template args (those explicitly specified and those deduced)
969 are output in a newly created vector *TARGS_OUT.
971 If it is impossible to determine the result, an error message is
972 issued. The error_mark_node is returned to indicate failure. */
975 determine_specialization (template_id
, decl
, targs_out
,
976 need_member_template
)
980 int need_member_template
;
985 tree candidates
= NULL_TREE
;
986 tree templates
= NULL_TREE
;
988 *targs_out
= NULL_TREE
;
990 if (template_id
== error_mark_node
)
991 return error_mark_node
;
993 fns
= TREE_OPERAND (template_id
, 0);
994 explicit_targs
= TREE_OPERAND (template_id
, 1);
996 if (fns
== error_mark_node
)
997 return error_mark_node
;
999 /* Check for baselinks. */
1000 if (BASELINK_P (fns
))
1001 fns
= TREE_VALUE (fns
);
1003 if (!is_overloaded_fn (fns
))
1005 cp_error ("`%D' is not a function template", fns
);
1006 return error_mark_node
;
1009 for (; fns
; fns
= OVL_NEXT (fns
))
1013 tree fn
= OVL_CURRENT (fns
);
1015 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
1016 /* DECL might be a specialization of FN. */
1018 else if (need_member_template
)
1019 /* FN is an ordinary member function, and we need a
1020 specialization of a member template. */
1022 else if (TREE_CODE (fn
) != FUNCTION_DECL
)
1023 /* We can get IDENTIFIER_NODEs here in certain erroneous
1026 else if (!DECL_FUNCTION_MEMBER_P (fn
))
1027 /* This is just an ordinary non-member function. Nothing can
1028 be a specialization of that. */
1032 tree decl_arg_types
;
1034 /* This is an ordinary member function. However, since
1035 we're here, we can assume it's enclosing class is a
1036 template class. For example,
1038 template <typename T> struct S { void f(); };
1039 template <> void S<int>::f() {}
1041 Here, S<int>::f is a non-template, but S<int> is a
1042 template class. If FN has the same type as DECL, we
1043 might be in business. */
1044 if (!same_type_p (TREE_TYPE (TREE_TYPE (decl
)),
1045 TREE_TYPE (TREE_TYPE (fn
))))
1046 /* The return types differ. */
1049 /* Adjust the type of DECL in case FN is a static member. */
1050 decl_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
1051 if (DECL_STATIC_FUNCTION_P (fn
)
1052 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
1053 decl_arg_types
= TREE_CHAIN (decl_arg_types
);
1055 if (compparms (TYPE_ARG_TYPES (TREE_TYPE (fn
)),
1058 candidates
= tree_cons (NULL_TREE
, fn
, candidates
);
1063 /* See whether this function might be a specialization of this
1065 targs
= get_bindings (tmpl
, decl
, explicit_targs
);
1068 /* We cannot deduce template arguments that when used to
1069 specialize TMPL will produce DECL. */
1072 /* Save this template, and the arguments deduced. */
1073 templates
= tree_cons (targs
, tmpl
, templates
);
1076 if (templates
&& TREE_CHAIN (templates
))
1082 It is possible for a specialization with a given function
1083 signature to be instantiated from more than one function
1084 template. In such cases, explicit specification of the
1085 template arguments must be used to uniquely identify the
1086 function template specialization being specialized.
1088 Note that here, there's no suggestion that we're supposed to
1089 determine which of the candidate templates is most
1090 specialized. However, we, also have:
1094 Partial ordering of overloaded function template
1095 declarations is used in the following contexts to select
1096 the function template to which a function template
1097 specialization refers:
1099 -- when an explicit specialization refers to a function
1102 So, we do use the partial ordering rules, at least for now.
1103 This extension can only serve to make illegal programs legal,
1104 so it's safe. And, there is strong anecdotal evidence that
1105 the committee intended the partial ordering rules to apply;
1106 the EDG front-end has that behavior, and John Spicer claims
1107 that the committee simply forgot to delete the wording in
1108 [temp.expl.spec]. */
1109 tree tmpl
= most_specialized (templates
, decl
, explicit_targs
);
1110 if (tmpl
&& tmpl
!= error_mark_node
)
1112 targs
= get_bindings (tmpl
, decl
, explicit_targs
);
1113 templates
= tree_cons (targs
, tmpl
, NULL_TREE
);
1117 if (templates
== NULL_TREE
&& candidates
== NULL_TREE
)
1119 cp_error_at ("template-id `%D' for `%+D' does not match any template declaration",
1121 return error_mark_node
;
1123 else if ((templates
&& TREE_CHAIN (templates
))
1124 || (candidates
&& TREE_CHAIN (candidates
))
1125 || (templates
&& candidates
))
1127 cp_error_at ("ambiguous template specialization `%D' for `%+D'",
1129 chainon (candidates
, templates
);
1130 print_candidates (candidates
);
1131 return error_mark_node
;
1134 /* We have one, and exactly one, match. */
1137 /* It was a specialization of an ordinary member function in a
1139 *targs_out
= copy_node (DECL_TI_ARGS (TREE_VALUE (candidates
)));
1140 return DECL_TI_TEMPLATE (TREE_VALUE (candidates
));
1143 /* It was a specialization of a template. */
1144 targs
= DECL_TI_ARGS (DECL_TEMPLATE_RESULT (TREE_VALUE (templates
)));
1145 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (targs
))
1147 *targs_out
= copy_node (targs
);
1148 SET_TMPL_ARGS_LEVEL (*targs_out
,
1149 TMPL_ARGS_DEPTH (*targs_out
),
1150 TREE_PURPOSE (templates
));
1153 *targs_out
= TREE_PURPOSE (templates
);
1154 return TREE_VALUE (templates
);
1157 /* Check to see if the function just declared, as indicated in
1158 DECLARATOR, and in DECL, is a specialization of a function
1159 template. We may also discover that the declaration is an explicit
1160 instantiation at this point.
1162 Returns DECL, or an equivalent declaration that should be used
1163 instead if all goes well. Issues an error message if something is
1164 amiss. Returns error_mark_node if the error is not easily
1167 FLAGS is a bitmask consisting of the following flags:
1169 2: The function has a definition.
1170 4: The function is a friend.
1172 The TEMPLATE_COUNT is the number of references to qualifying
1173 template classes that appeared in the name of the function. For
1176 template <class T> struct S { void f(); };
1179 the TEMPLATE_COUNT would be 1. However, explicitly specialized
1180 classes are not counted in the TEMPLATE_COUNT, so that in
1182 template <class T> struct S {};
1183 template <> struct S<int> { void f(); }
1184 template <> void S<int>::f();
1186 the TEMPLATE_COUNT would be 0. (Note that this declaration is
1187 illegal; there should be no template <>.)
1189 If the function is a specialization, it is marked as such via
1190 DECL_TEMPLATE_SPECIALIZATION. Furthermore, its DECL_TEMPLATE_INFO
1191 is set up correctly, and it is added to the list of specializations
1192 for that template. */
1195 check_explicit_specialization (declarator
, decl
, template_count
, flags
)
1201 int have_def
= flags
& 2;
1202 int is_friend
= flags
& 4;
1203 int specialization
= 0;
1204 int explicit_instantiation
= 0;
1205 int member_specialization
= 0;
1206 tree ctype
= DECL_CLASS_CONTEXT (decl
);
1207 tree dname
= DECL_NAME (decl
);
1210 tsk
= current_tmpl_spec_kind (template_count
);
1215 if (processing_specialization
)
1218 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
1220 else if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
1223 /* This could be something like:
1225 template <class T> void f(T);
1226 class S { friend void f<>(int); } */
1230 /* This case handles bogus declarations like template <>
1231 template <class T> void f<int>(); */
1233 cp_error ("template-id `%D' in declaration of primary template",
1240 case tsk_invalid_member_spec
:
1241 /* The error has already been reported in
1242 check_specialization_scope. */
1243 return error_mark_node
;
1245 case tsk_invalid_expl_inst
:
1246 cp_error ("template parameter list used in explicit instantiation");
1252 cp_error ("definition provided for explicit instantiation");
1254 explicit_instantiation
= 1;
1257 case tsk_excessive_parms
:
1258 cp_error ("too many template parameter lists in declaration of `%D'",
1260 return error_mark_node
;
1264 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
1266 member_specialization
= 1;
1271 case tsk_insufficient_parms
:
1272 if (template_header_count
)
1274 cp_error("too few template parameter lists in declaration of `%D'",
1278 else if (ctype
!= NULL_TREE
1279 && !TYPE_BEING_DEFINED (ctype
)
1280 && CLASSTYPE_TEMPLATE_INSTANTIATION (ctype
)
1283 /* For backwards compatibility, we accept:
1285 template <class T> struct S { void f(); };
1286 void S<int>::f() {} // Missing template <>
1288 That used to be legal C++. */
1291 ("explicit specialization not preceded by `template <>'");
1293 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
1298 if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
1300 /* This case handles bogus declarations like template <>
1301 template <class T> void f<int>(); */
1303 if (uses_template_parms (declarator
))
1304 cp_error ("partial specialization `%D' of function template",
1307 cp_error ("template-id `%D' in declaration of primary template",
1312 if (ctype
&& CLASSTYPE_TEMPLATE_INSTANTIATION (ctype
))
1313 /* This is a specialization of a member template, without
1314 specialization the containing class. Something like:
1316 template <class T> struct S {
1317 template <class U> void f (U);
1319 template <> template <class U> void S<int>::f(U) {}
1321 That's a specialization -- but of the entire template. */
1326 my_friendly_abort (20000309);
1329 if (specialization
|| member_specialization
)
1331 tree t
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
1332 for (; t
; t
= TREE_CHAIN (t
))
1333 if (TREE_PURPOSE (t
))
1336 ("default argument specified in explicit specialization");
1339 if (current_lang_name
== lang_name_c
)
1340 cp_error ("template specialization with C linkage");
1343 if (specialization
|| member_specialization
|| explicit_instantiation
)
1345 tree tmpl
= NULL_TREE
;
1346 tree targs
= NULL_TREE
;
1348 /* Make sure that the declarator is a TEMPLATE_ID_EXPR. */
1349 if (TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
1353 my_friendly_assert (TREE_CODE (declarator
) == IDENTIFIER_NODE
,
1356 fns
= IDENTIFIER_NAMESPACE_VALUE (dname
);
1361 lookup_template_function (fns
, NULL_TREE
);
1364 if (declarator
== error_mark_node
)
1365 return error_mark_node
;
1367 if (ctype
!= NULL_TREE
&& TYPE_BEING_DEFINED (ctype
))
1369 if (!explicit_instantiation
)
1370 /* A specialization in class scope. This is illegal,
1371 but the error will already have been flagged by
1372 check_specialization_scope. */
1373 return error_mark_node
;
1376 /* It's not legal to write an explicit instantiation in
1379 class C { template void f(); }
1381 This case is caught by the parser. However, on
1384 template class C { void f(); };
1386 (which is illegal) we can get here. The error will be
1393 else if (TREE_CODE (TREE_OPERAND (declarator
, 0)) == LOOKUP_EXPR
)
1395 /* A friend declaration. We can't do much, because we don't
1396 know what this resolves to, yet. */
1397 my_friendly_assert (is_friend
!= 0, 0);
1398 my_friendly_assert (!explicit_instantiation
, 0);
1399 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
1402 else if (ctype
!= NULL_TREE
1403 && (TREE_CODE (TREE_OPERAND (declarator
, 0)) ==
1406 /* Find the list of functions in ctype that have the same
1407 name as the declared function. */
1408 tree name
= TREE_OPERAND (declarator
, 0);
1409 tree fns
= NULL_TREE
;
1412 if (name
== constructor_name (ctype
)
1413 || name
== constructor_name_full (ctype
))
1415 int is_constructor
= DECL_CONSTRUCTOR_P (decl
);
1417 if (is_constructor
? !TYPE_HAS_CONSTRUCTOR (ctype
)
1418 : !TYPE_HAS_DESTRUCTOR (ctype
))
1420 /* From [temp.expl.spec]:
1422 If such an explicit specialization for the member
1423 of a class template names an implicitly-declared
1424 special member function (clause _special_), the
1425 program is ill-formed.
1427 Similar language is found in [temp.explicit]. */
1428 cp_error ("specialization of implicitly-declared special member function");
1429 return error_mark_node
;
1432 name
= is_constructor
? ctor_identifier
: dtor_identifier
;
1435 if (!DECL_CONV_FN_P (decl
))
1437 idx
= lookup_fnfields_1 (ctype
, name
);
1439 fns
= TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (ctype
), idx
);
1445 /* For a type-conversion operator, we cannot do a
1446 name-based lookup. We might be looking for `operator
1447 int' which will be a specialization of `operator T'.
1448 So, we find *all* the conversion operators, and then
1449 select from them. */
1452 methods
= CLASSTYPE_METHOD_VEC (ctype
);
1454 for (idx
= 2; idx
< TREE_VEC_LENGTH (methods
); ++idx
)
1456 tree ovl
= TREE_VEC_ELT (methods
, idx
);
1458 if (!ovl
|| !DECL_CONV_FN_P (OVL_CURRENT (ovl
)))
1459 /* There are no more conversion functions. */
1462 /* Glue all these conversion functions together
1463 with those we already have. */
1464 for (; ovl
; ovl
= OVL_NEXT (ovl
))
1465 fns
= ovl_cons (OVL_CURRENT (ovl
), fns
);
1469 if (fns
== NULL_TREE
)
1471 cp_error ("no member function `%D' declared in `%T'",
1473 return error_mark_node
;
1476 TREE_OPERAND (declarator
, 0) = fns
;
1479 /* Figure out what exactly is being specialized at this point.
1480 Note that for an explicit instantiation, even one for a
1481 member function, we cannot tell apriori whether the
1482 instantiation is for a member template, or just a member
1483 function of a template class. Even if a member template is
1484 being instantiated, the member template arguments may be
1485 elided if they can be deduced from the rest of the
1487 tmpl
= determine_specialization (declarator
, decl
,
1489 member_specialization
);
1491 if (!tmpl
|| tmpl
== error_mark_node
)
1492 /* We couldn't figure out what this declaration was
1494 return error_mark_node
;
1497 tree gen_tmpl
= most_general_template (tmpl
);
1499 if (explicit_instantiation
)
1501 /* We don't set DECL_EXPLICIT_INSTANTIATION here; that
1502 is done by do_decl_instantiation later. */
1504 int arg_depth
= TMPL_ARGS_DEPTH (targs
);
1505 int parm_depth
= TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
));
1507 if (arg_depth
> parm_depth
)
1509 /* If TMPL is not the most general template (for
1510 example, if TMPL is a friend template that is
1511 injected into namespace scope), then there will
1512 be too many levels fo TARGS. Remove some of them
1517 new_targs
= make_tree_vec (parm_depth
);
1518 for (i
= arg_depth
- parm_depth
; i
< arg_depth
; ++i
)
1519 TREE_VEC_ELT (new_targs
, i
- (arg_depth
- parm_depth
))
1520 = TREE_VEC_ELT (targs
, i
);
1524 return instantiate_template (tmpl
, targs
);
1527 /* If this is a specialization of a member template of a
1528 template class. In we want to return the TEMPLATE_DECL,
1529 not the specialization of it. */
1530 if (tsk
== tsk_template
)
1532 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
1533 DECL_INITIAL (DECL_TEMPLATE_RESULT (tmpl
)) = NULL_TREE
;
1537 /* If we though that the DECL was a member function, but it
1538 turns out to be specializing a static member function,
1539 make DECL a static member function as well. */
1540 if (DECL_STATIC_FUNCTION_P (tmpl
)
1541 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
1543 revert_static_member_fn (decl
);
1544 last_function_parms
= TREE_CHAIN (last_function_parms
);
1547 /* Set up the DECL_TEMPLATE_INFO for DECL. */
1548 DECL_TEMPLATE_INFO (decl
) = tree_cons (tmpl
, targs
, NULL_TREE
);
1550 /* Mangle the function name appropriately. Note that we do
1551 not mangle specializations of non-template member
1552 functions of template classes, e.g. with
1554 template <class T> struct S { void f(); }
1556 and given the specialization
1558 template <> void S<int>::f() {}
1560 we do not mangle S<int>::f() here. That's because it's
1561 just an ordinary member function and doesn't need special
1562 treatment. We do this here so that the ordinary,
1563 non-template, name-mangling algorithm will not be used
1565 if ((is_member_template (tmpl
) || ctype
== NULL_TREE
)
1566 && name_mangling_version
>= 1)
1567 set_mangled_name_for_template_decl (decl
);
1569 if (is_friend
&& !have_def
)
1570 /* This is not really a declaration of a specialization.
1571 It's just the name of an instantiation. But, it's not
1572 a request for an instantiation, either. */
1573 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
1575 /* Register this specialization so that we can find it
1577 decl
= register_specialization (decl
, gen_tmpl
, targs
);
1584 /* TYPE is being declared. Verify that the use of template headers
1585 and such is reasonable. Issue error messages if not. */
1588 maybe_check_template_type (type
)
1591 if (template_header_count
)
1593 /* We are in the scope of some `template <...>' header. */
1596 = template_class_depth_real (TYPE_CONTEXT (type
),
1597 /*count_specializations=*/1);
1599 if (template_header_count
<= context_depth
)
1600 /* This is OK; the template headers are for the context. We
1601 are actually too lenient here; like
1602 check_explicit_specialization we should consider the number
1603 of template types included in the actual declaration. For
1606 template <class T> struct S {
1607 template <class U> template <class V>
1613 template <class T> struct S {
1614 template <class U> struct I;
1617 template <class T> template <class U.
1622 else if (template_header_count
> context_depth
+ 1)
1623 /* There are two many template parameter lists. */
1624 cp_error ("too many template parameter lists in declaration of `%T'", type
);
1628 /* Returns 1 iff PARMS1 and PARMS2 are identical sets of template
1629 parameters. These are represented in the same format used for
1630 DECL_TEMPLATE_PARMS. */
1632 int comp_template_parms (parms1
, parms2
)
1639 if (parms1
== parms2
)
1642 for (p1
= parms1
, p2
= parms2
;
1643 p1
!= NULL_TREE
&& p2
!= NULL_TREE
;
1644 p1
= TREE_CHAIN (p1
), p2
= TREE_CHAIN (p2
))
1646 tree t1
= TREE_VALUE (p1
);
1647 tree t2
= TREE_VALUE (p2
);
1650 my_friendly_assert (TREE_CODE (t1
) == TREE_VEC
, 0);
1651 my_friendly_assert (TREE_CODE (t2
) == TREE_VEC
, 0);
1653 if (TREE_VEC_LENGTH (t1
) != TREE_VEC_LENGTH (t2
))
1656 for (i
= 0; i
< TREE_VEC_LENGTH (t2
); ++i
)
1658 tree parm1
= TREE_VALUE (TREE_VEC_ELT (t1
, i
));
1659 tree parm2
= TREE_VALUE (TREE_VEC_ELT (t2
, i
));
1661 if (TREE_CODE (parm1
) != TREE_CODE (parm2
))
1664 if (TREE_CODE (parm1
) == TEMPLATE_TYPE_PARM
)
1666 else if (!same_type_p (TREE_TYPE (parm1
), TREE_TYPE (parm2
)))
1671 if ((p1
!= NULL_TREE
) != (p2
!= NULL_TREE
))
1672 /* One set of parameters has more parameters lists than the
1679 /* Complain if DECL shadows a template parameter.
1681 [temp.local]: A template-parameter shall not be redeclared within its
1682 scope (including nested scopes). */
1685 check_template_shadow (decl
)
1690 /* If we're not in a template, we can't possibly shadow a template
1692 if (!current_template_parms
)
1695 /* Figure out what we're shadowing. */
1696 if (TREE_CODE (decl
) == OVERLOAD
)
1697 decl
= OVL_CURRENT (decl
);
1698 olddecl
= IDENTIFIER_VALUE (DECL_NAME (decl
));
1700 /* If there's no previous binding for this name, we're not shadowing
1701 anything, let alone a template parameter. */
1705 /* If we're not shadowing a template parameter, we're done. Note
1706 that OLDDECL might be an OVERLOAD (or perhaps even an
1707 ERROR_MARK), so we can't just blithely assume it to be a _DECL
1709 if (!DECL_P (olddecl
) || !DECL_TEMPLATE_PARM_P (olddecl
))
1712 /* We check for decl != olddecl to avoid bogus errors for using a
1713 name inside a class. We check TPFI to avoid duplicate errors for
1714 inline member templates. */
1716 || TEMPLATE_PARMS_FOR_INLINE (current_template_parms
))
1719 cp_error_at ("declaration of `%#D'", decl
);
1720 cp_error_at (" shadows template parm `%#D'", olddecl
);
1723 /* Return a new TEMPLATE_PARM_INDEX with the indicated INDEX, LEVEL,
1724 ORIG_LEVEL, DECL, and TYPE. */
1727 build_template_parm_index (index
, level
, orig_level
, decl
, type
)
1734 tree t
= make_node (TEMPLATE_PARM_INDEX
);
1735 TEMPLATE_PARM_IDX (t
) = index
;
1736 TEMPLATE_PARM_LEVEL (t
) = level
;
1737 TEMPLATE_PARM_ORIG_LEVEL (t
) = orig_level
;
1738 TEMPLATE_PARM_DECL (t
) = decl
;
1739 TREE_TYPE (t
) = type
;
1744 /* Return a TEMPLATE_PARM_INDEX, similar to INDEX, but whose
1745 TEMPLATE_PARM_LEVEL has been decreased by LEVELS. If such a
1746 TEMPLATE_PARM_INDEX already exists, it is returned; otherwise, a
1747 new one is created. */
1750 reduce_template_parm_level (index
, type
, levels
)
1755 if (TEMPLATE_PARM_DESCENDANTS (index
) == NULL_TREE
1756 || (TEMPLATE_PARM_LEVEL (TEMPLATE_PARM_DESCENDANTS (index
))
1757 != TEMPLATE_PARM_LEVEL (index
) - levels
))
1760 = build_decl (TREE_CODE (TEMPLATE_PARM_DECL (index
)),
1761 DECL_NAME (TEMPLATE_PARM_DECL (index
)),
1764 = build_template_parm_index (TEMPLATE_PARM_IDX (index
),
1765 TEMPLATE_PARM_LEVEL (index
) - levels
,
1766 TEMPLATE_PARM_ORIG_LEVEL (index
),
1768 TEMPLATE_PARM_DESCENDANTS (index
) = t
;
1770 /* Template template parameters need this. */
1771 DECL_TEMPLATE_PARMS (decl
)
1772 = DECL_TEMPLATE_PARMS (TEMPLATE_PARM_DECL (index
));
1775 return TEMPLATE_PARM_DESCENDANTS (index
);
1778 /* Process information from new template parameter NEXT and append it to the
1779 LIST being built. */
1782 process_template_parm (list
, next
)
1791 my_friendly_assert (TREE_CODE (parm
) == TREE_LIST
, 259);
1792 defval
= TREE_PURPOSE (parm
);
1793 parm
= TREE_VALUE (parm
);
1794 is_type
= TREE_PURPOSE (parm
) == class_type_node
;
1798 tree p
= TREE_VALUE (tree_last (list
));
1800 if (TREE_CODE (p
) == TYPE_DECL
|| TREE_CODE (p
) == TEMPLATE_DECL
)
1801 idx
= TEMPLATE_TYPE_IDX (TREE_TYPE (p
));
1803 idx
= TEMPLATE_PARM_IDX (DECL_INITIAL (p
));
1811 my_friendly_assert (TREE_CODE (TREE_PURPOSE (parm
)) == TREE_LIST
, 260);
1812 /* is a const-param */
1813 parm
= grokdeclarator (TREE_VALUE (parm
), TREE_PURPOSE (parm
),
1814 PARM
, 0, NULL_TREE
);
1818 The top-level cv-qualifiers on the template-parameter are
1819 ignored when determining its type. */
1820 TREE_TYPE (parm
) = TYPE_MAIN_VARIANT (TREE_TYPE (parm
));
1822 /* A template parameter is not modifiable. */
1823 TREE_READONLY (parm
) = 1;
1824 if (IS_AGGR_TYPE (TREE_TYPE (parm
))
1825 && TREE_CODE (TREE_TYPE (parm
)) != TEMPLATE_TYPE_PARM
1826 && TREE_CODE (TREE_TYPE (parm
)) != TYPENAME_TYPE
)
1828 cp_error ("`%#T' is not a valid type for a template constant parameter",
1830 if (DECL_NAME (parm
) == NULL_TREE
)
1831 error (" a template type parameter must begin with `class' or `typename'");
1832 TREE_TYPE (parm
) = void_type_node
;
1835 && (TREE_CODE (TREE_TYPE (parm
)) == REAL_TYPE
1836 || TREE_CODE (TREE_TYPE (parm
)) == COMPLEX_TYPE
))
1837 cp_pedwarn ("`%T' is not a valid type for a template constant parameter",
1839 decl
= build_decl (CONST_DECL
, DECL_NAME (parm
), TREE_TYPE (parm
));
1840 DECL_INITIAL (parm
) = DECL_INITIAL (decl
)
1841 = build_template_parm_index (idx
, processing_template_decl
,
1842 processing_template_decl
,
1843 decl
, TREE_TYPE (parm
));
1848 parm
= TREE_VALUE (parm
);
1850 if (parm
&& TREE_CODE (parm
) == TEMPLATE_DECL
)
1852 t
= make_aggr_type (TEMPLATE_TEMPLATE_PARM
);
1853 /* This is for distinguishing between real templates and template
1854 template parameters */
1855 TREE_TYPE (parm
) = t
;
1856 TREE_TYPE (DECL_TEMPLATE_RESULT (parm
)) = t
;
1861 t
= make_aggr_type (TEMPLATE_TYPE_PARM
);
1862 /* parm is either IDENTIFIER_NODE or NULL_TREE */
1863 decl
= build_decl (TYPE_DECL
, parm
, t
);
1866 TYPE_NAME (t
) = decl
;
1867 TYPE_STUB_DECL (t
) = decl
;
1869 TEMPLATE_TYPE_PARM_INDEX (t
)
1870 = build_template_parm_index (idx
, processing_template_decl
,
1871 processing_template_decl
,
1872 decl
, TREE_TYPE (parm
));
1874 DECL_ARTIFICIAL (decl
) = 1;
1875 SET_DECL_TEMPLATE_PARM_P (decl
);
1877 parm
= build_tree_list (defval
, parm
);
1878 return chainon (list
, parm
);
1881 /* The end of a template parameter list has been reached. Process the
1882 tree list into a parameter vector, converting each parameter into a more
1883 useful form. Type parameters are saved as IDENTIFIER_NODEs, and others
1887 end_template_parm_list (parms
)
1892 tree saved_parmlist
= make_tree_vec (list_length (parms
));
1894 current_template_parms
1895 = tree_cons (build_int_2 (0, processing_template_decl
),
1896 saved_parmlist
, current_template_parms
);
1898 for (parm
= parms
, nparms
= 0;
1900 parm
= TREE_CHAIN (parm
), nparms
++)
1901 TREE_VEC_ELT (saved_parmlist
, nparms
) = parm
;
1903 --processing_template_parmlist
;
1905 return saved_parmlist
;
1908 /* end_template_decl is called after a template declaration is seen. */
1911 end_template_decl ()
1913 reset_specialization ();
1915 if (! processing_template_decl
)
1918 /* This matches the pushlevel in begin_template_parm_list. */
1921 --processing_template_decl
;
1922 current_template_parms
= TREE_CHAIN (current_template_parms
);
1925 /* Given a template argument vector containing the template PARMS.
1926 The innermost PARMS are given first. */
1929 current_template_args ()
1932 tree args
= NULL_TREE
;
1933 int length
= TMPL_PARMS_DEPTH (current_template_parms
);
1936 /* If there is only one level of template parameters, we do not
1937 create a TREE_VEC of TREE_VECs. Instead, we return a single
1938 TREE_VEC containing the arguments. */
1940 args
= make_tree_vec (length
);
1942 for (header
= current_template_parms
; header
; header
= TREE_CHAIN (header
))
1944 tree a
= copy_node (TREE_VALUE (header
));
1947 TREE_TYPE (a
) = NULL_TREE
;
1948 for (i
= TREE_VEC_LENGTH (a
) - 1; i
>= 0; --i
)
1950 tree t
= TREE_VEC_ELT (a
, i
);
1952 /* T will be a list if we are called from within a
1953 begin/end_template_parm_list pair, but a vector directly
1954 if within a begin/end_member_template_processing pair. */
1955 if (TREE_CODE (t
) == TREE_LIST
)
1959 if (TREE_CODE (t
) == TYPE_DECL
1960 || TREE_CODE (t
) == TEMPLATE_DECL
)
1963 t
= DECL_INITIAL (t
);
1964 TREE_VEC_ELT (a
, i
) = t
;
1969 TREE_VEC_ELT (args
, --l
) = a
;
1977 /* Return a TEMPLATE_DECL corresponding to DECL, using the indicated
1978 template PARMS. Used by push_template_decl below. */
1981 build_template_decl (decl
, parms
)
1985 tree tmpl
= build_lang_decl (TEMPLATE_DECL
, DECL_NAME (decl
), NULL_TREE
);
1986 DECL_TEMPLATE_PARMS (tmpl
) = parms
;
1987 DECL_CONTEXT (tmpl
) = DECL_CONTEXT (decl
);
1988 if (DECL_LANG_SPECIFIC (decl
))
1990 DECL_VIRTUAL_CONTEXT (tmpl
) = DECL_VIRTUAL_CONTEXT (decl
);
1991 DECL_STATIC_FUNCTION_P (tmpl
) = DECL_STATIC_FUNCTION_P (decl
);
1992 DECL_CONSTRUCTOR_P (tmpl
) = DECL_CONSTRUCTOR_P (decl
);
1993 DECL_NONCONVERTING_P (tmpl
) = DECL_NONCONVERTING_P (decl
);
1994 DECL_ASSIGNMENT_OPERATOR_P (tmpl
) = DECL_ASSIGNMENT_OPERATOR_P (decl
);
1995 if (DECL_OVERLOADED_OPERATOR_P (decl
))
1996 SET_OVERLOADED_OPERATOR_CODE (tmpl
,
1997 DECL_OVERLOADED_OPERATOR_P (decl
));
2003 struct template_parm_data
2005 /* The level of the template parameters we are currently
2009 /* The index of the specialization argument we are currently
2013 /* An array whose size is the number of template parameters. The
2014 elements are non-zero if the parameter has been used in any one
2015 of the arguments processed so far. */
2018 /* An array whose size is the number of template arguments. The
2019 elements are non-zero if the argument makes use of template
2020 parameters of this level. */
2021 int* arg_uses_template_parms
;
2024 /* Subroutine of push_template_decl used to see if each template
2025 parameter in a partial specialization is used in the explicit
2026 argument list. If T is of the LEVEL given in DATA (which is
2027 treated as a template_parm_data*), then DATA->PARMS is marked
2031 mark_template_parm (t
, data
)
2037 struct template_parm_data
* tpd
= (struct template_parm_data
*) data
;
2039 if (TREE_CODE (t
) == TEMPLATE_PARM_INDEX
)
2041 level
= TEMPLATE_PARM_LEVEL (t
);
2042 idx
= TEMPLATE_PARM_IDX (t
);
2046 level
= TEMPLATE_TYPE_LEVEL (t
);
2047 idx
= TEMPLATE_TYPE_IDX (t
);
2050 if (level
== tpd
->level
)
2052 tpd
->parms
[idx
] = 1;
2053 tpd
->arg_uses_template_parms
[tpd
->current_arg
] = 1;
2056 /* Return zero so that for_each_template_parm will continue the
2057 traversal of the tree; we want to mark *every* template parm. */
2061 /* Process the partial specialization DECL. */
2064 process_partial_specialization (decl
)
2067 tree type
= TREE_TYPE (decl
);
2068 tree maintmpl
= CLASSTYPE_TI_TEMPLATE (type
);
2069 tree specargs
= CLASSTYPE_TI_ARGS (type
);
2070 tree inner_args
= INNERMOST_TEMPLATE_ARGS (specargs
);
2071 tree inner_parms
= INNERMOST_TEMPLATE_PARMS (current_template_parms
);
2072 tree main_inner_parms
= DECL_INNERMOST_TEMPLATE_PARMS (maintmpl
);
2073 int nargs
= TREE_VEC_LENGTH (inner_args
);
2074 int ntparms
= TREE_VEC_LENGTH (inner_parms
);
2076 int did_error_intro
= 0;
2077 struct template_parm_data tpd
;
2078 struct template_parm_data tpd2
;
2080 /* We check that each of the template parameters given in the
2081 partial specialization is used in the argument list to the
2082 specialization. For example:
2084 template <class T> struct S;
2085 template <class T> struct S<T*>;
2087 The second declaration is OK because `T*' uses the template
2088 parameter T, whereas
2090 template <class T> struct S<int>;
2092 is no good. Even trickier is:
2103 The S2<T> declaration is actually illegal; it is a
2104 full-specialization. Of course,
2107 struct S2<T (*)(U)>;
2109 or some such would have been OK. */
2110 tpd
.level
= TMPL_PARMS_DEPTH (current_template_parms
);
2111 tpd
.parms
= alloca (sizeof (int) * ntparms
);
2112 bzero ((PTR
) tpd
.parms
, sizeof (int) * ntparms
);
2114 tpd
.arg_uses_template_parms
= alloca (sizeof (int) * nargs
);
2115 bzero ((PTR
) tpd
.arg_uses_template_parms
, sizeof (int) * nargs
);
2116 for (i
= 0; i
< nargs
; ++i
)
2118 tpd
.current_arg
= i
;
2119 for_each_template_parm (TREE_VEC_ELT (inner_args
, i
),
2120 &mark_template_parm
,
2123 for (i
= 0; i
< ntparms
; ++i
)
2124 if (tpd
.parms
[i
] == 0)
2126 /* One of the template parms was not used in the
2128 if (!did_error_intro
)
2130 cp_error ("template parameters not used in partial specialization:");
2131 did_error_intro
= 1;
2135 TREE_VALUE (TREE_VEC_ELT (inner_parms
, i
)));
2138 /* [temp.class.spec]
2140 The argument list of the specialization shall not be identical to
2141 the implicit argument list of the primary template. */
2142 if (comp_template_args
2144 INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE
2146 cp_error ("partial specialization `%T' does not specialize any template arguments", type
);
2148 /* [temp.class.spec]
2150 A partially specialized non-type argument expression shall not
2151 involve template parameters of the partial specialization except
2152 when the argument expression is a simple identifier.
2154 The type of a template parameter corresponding to a specialized
2155 non-type argument shall not be dependent on a parameter of the
2157 my_friendly_assert (nargs
== DECL_NTPARMS (maintmpl
), 0);
2159 for (i
= 0; i
< nargs
; ++i
)
2161 tree arg
= TREE_VEC_ELT (inner_args
, i
);
2162 if (/* These first two lines are the `non-type' bit. */
2164 && TREE_CODE (arg
) != TEMPLATE_DECL
2165 /* This next line is the `argument expression is not just a
2166 simple identifier' condition and also the `specialized
2167 non-type argument' bit. */
2168 && TREE_CODE (arg
) != TEMPLATE_PARM_INDEX
)
2170 if (tpd
.arg_uses_template_parms
[i
])
2171 cp_error ("template argument `%E' involves template parameter(s)", arg
);
2174 /* Look at the corresponding template parameter,
2175 marking which template parameters its type depends
2178 TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (main_inner_parms
,
2183 /* We haven't yet initialized TPD2. Do so now. */
2184 tpd2
.arg_uses_template_parms
2185 = (int*) alloca (sizeof (int) * nargs
);
2186 /* The number of parameters here is the number in the
2187 main template, which, as checked in the assertion
2189 tpd2
.parms
= (int*) alloca (sizeof (int) * nargs
);
2191 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (maintmpl
));
2194 /* Mark the template parameters. But this time, we're
2195 looking for the template parameters of the main
2196 template, not in the specialization. */
2197 tpd2
.current_arg
= i
;
2198 tpd2
.arg_uses_template_parms
[i
] = 0;
2199 bzero ((PTR
) tpd2
.parms
, sizeof (int) * nargs
);
2200 for_each_template_parm (type
,
2201 &mark_template_parm
,
2204 if (tpd2
.arg_uses_template_parms
[i
])
2206 /* The type depended on some template parameters.
2207 If they are fully specialized in the
2208 specialization, that's OK. */
2210 for (j
= 0; j
< nargs
; ++j
)
2211 if (tpd2
.parms
[j
] != 0
2212 && tpd
.arg_uses_template_parms
[j
])
2214 cp_error ("type `%T' of template argument `%E' depends on template parameter(s)",
2224 if (retrieve_specialization (maintmpl
, specargs
))
2225 /* We've already got this specialization. */
2228 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)
2229 = tree_cons (inner_args
, inner_parms
,
2230 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
));
2231 TREE_TYPE (DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)) = type
;
2235 /* Check that a template declaration's use of default arguments is not
2236 invalid. Here, PARMS are the template parameters. IS_PRIMARY is
2237 non-zero if DECL is the thing declared by a primary template.
2238 IS_PARTIAL is non-zero if DECL is a partial specialization. */
2241 check_default_tmpl_args (decl
, parms
, is_primary
, is_partial
)
2248 int last_level_to_check
;
2253 A default template-argument shall not be specified in a
2254 function template declaration or a function template definition, nor
2255 in the template-parameter-list of the definition of a member of a
2258 if (TREE_CODE (CP_DECL_CONTEXT (decl
)) == FUNCTION_DECL
)
2259 /* You can't have a function template declaration in a local
2260 scope, nor you can you define a member of a class template in a
2264 if (current_class_type
2265 && !TYPE_BEING_DEFINED (current_class_type
)
2266 && DECL_LANG_SPECIFIC (decl
)
2267 /* If this is either a friend defined in the scope of the class
2268 or a member function. */
2269 && ((DECL_CONTEXT (decl
)
2270 && same_type_p (DECL_CONTEXT (decl
), current_class_type
))
2271 || (DECL_FRIEND_CONTEXT (decl
)
2272 && same_type_p (DECL_FRIEND_CONTEXT (decl
),
2273 current_class_type
)))
2274 /* And, if it was a member function, it really was defined in
2275 the scope of the class. */
2276 && (!DECL_FUNCTION_MEMBER_P (decl
) || DECL_DEFINED_IN_CLASS_P (decl
)))
2277 /* We already checked these parameters when the template was
2278 declared, so there's no need to do it again now. This function
2279 was defined in class scope, but we're processing it's body now
2280 that the class is complete. */
2285 If a template-parameter has a default template-argument, all
2286 subsequent template-parameters shall have a default
2287 template-argument supplied. */
2288 for (parm_level
= parms
; parm_level
; parm_level
= TREE_CHAIN (parm_level
))
2290 tree inner_parms
= TREE_VALUE (parm_level
);
2291 int ntparms
= TREE_VEC_LENGTH (inner_parms
);
2292 int seen_def_arg_p
= 0;
2295 for (i
= 0; i
< ntparms
; ++i
)
2297 tree parm
= TREE_VEC_ELT (inner_parms
, i
);
2298 if (TREE_PURPOSE (parm
))
2300 else if (seen_def_arg_p
)
2302 cp_error ("no default argument for `%D'", TREE_VALUE (parm
));
2303 /* For better subsequent error-recovery, we indicate that
2304 there should have been a default argument. */
2305 TREE_PURPOSE (parm
) = error_mark_node
;
2310 if (TREE_CODE (decl
) != TYPE_DECL
|| is_partial
|| !is_primary
)
2311 /* For an ordinary class template, default template arguments are
2312 allowed at the innermost level, e.g.:
2313 template <class T = int>
2315 but, in a partial specialization, they're not allowed even
2316 there, as we have in [temp.class.spec]:
2318 The template parameter list of a specialization shall not
2319 contain default template argument values.
2321 So, for a partial specialization, or for a function template,
2322 we look at all of them. */
2325 /* But, for a primary class template that is not a partial
2326 specialization we look at all template parameters except the
2328 parms
= TREE_CHAIN (parms
);
2330 /* Figure out what error message to issue. */
2331 if (TREE_CODE (decl
) == FUNCTION_DECL
)
2332 msg
= "default argument for template parameter in function template `%D'";
2333 else if (is_partial
)
2334 msg
= "default argument in partial specialization `%D'";
2336 msg
= "default argument for template parameter for class enclosing `%D'";
2338 if (current_class_type
&& TYPE_BEING_DEFINED (current_class_type
))
2339 /* If we're inside a class definition, there's no need to
2340 examine the parameters to the class itself. On the one
2341 hand, they will be checked when the class is defined, and,
2342 on the other, default arguments are legal in things like:
2343 template <class T = double>
2344 struct S { template <class U> void f(U); };
2345 Here the default argument for `S' has no bearing on the
2346 declaration of `f'. */
2347 last_level_to_check
= template_class_depth (current_class_type
) + 1;
2349 /* Check everything. */
2350 last_level_to_check
= 0;
2352 for (parm_level
= parms
;
2353 parm_level
&& TMPL_PARMS_DEPTH (parm_level
) >= last_level_to_check
;
2354 parm_level
= TREE_CHAIN (parm_level
))
2356 tree inner_parms
= TREE_VALUE (parm_level
);
2360 ntparms
= TREE_VEC_LENGTH (inner_parms
);
2361 for (i
= 0; i
< ntparms
; ++i
)
2362 if (TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)))
2366 cp_error (msg
, decl
);
2370 /* Clear out the default argument so that we are not
2372 TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)) = NULL_TREE
;
2375 /* At this point, if we're still interested in issuing messages,
2376 they must apply to classes surrounding the object declared. */
2378 msg
= "default argument for template parameter for class enclosing `%D'";
2382 /* Creates a TEMPLATE_DECL for the indicated DECL using the template
2383 parameters given by current_template_args, or reuses a
2384 previously existing one, if appropriate. Returns the DECL, or an
2385 equivalent one, if it is replaced via a call to duplicate_decls.
2387 If IS_FRIEND is non-zero, DECL is a friend declaration. */
2390 push_template_decl_real (decl
, is_friend
)
2400 int new_template_p
= 0;
2402 /* See if this is a partial specialization. */
2403 is_partial
= (DECL_IMPLICIT_TYPEDEF_P (decl
)
2404 && TREE_CODE (TREE_TYPE (decl
)) != ENUMERAL_TYPE
2405 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl
)));
2407 is_friend
|= (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_FRIEND_P (decl
));
2410 /* For a friend, we want the context of the friend function, not
2411 the type of which it is a friend. */
2412 ctx
= DECL_CONTEXT (decl
);
2413 else if (CP_DECL_CONTEXT (decl
)
2414 && TREE_CODE (CP_DECL_CONTEXT (decl
)) != NAMESPACE_DECL
)
2415 /* In the case of a virtual function, we want the class in which
2417 ctx
= CP_DECL_CONTEXT (decl
);
2419 /* Otherwise, if we're currently definining some class, the DECL
2420 is assumed to be a member of the class. */
2421 ctx
= current_scope ();
2423 if (ctx
&& TREE_CODE (ctx
) == NAMESPACE_DECL
)
2426 if (!DECL_CONTEXT (decl
))
2427 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
2429 /* See if this is a primary template. */
2430 primary
= template_parm_scope_p ();
2434 if (current_lang_name
== lang_name_c
)
2435 cp_error ("template with C linkage");
2436 else if (TREE_CODE (decl
) == TYPE_DECL
2437 && ANON_AGGRNAME_P (DECL_NAME (decl
)))
2438 cp_error ("template class without a name");
2439 else if ((DECL_IMPLICIT_TYPEDEF_P (decl
)
2440 && CLASS_TYPE_P (TREE_TYPE (decl
)))
2441 || (TREE_CODE (decl
) == VAR_DECL
&& ctx
&& CLASS_TYPE_P (ctx
))
2442 || TREE_CODE (decl
) == FUNCTION_DECL
)
2445 cp_error ("template declaration of `%#D'", decl
);
2448 /* Check to see that the rules regarding the use of default
2449 arguments are not being violated. */
2450 check_default_tmpl_args (decl
, current_template_parms
,
2451 primary
, is_partial
);
2454 return process_partial_specialization (decl
);
2456 args
= current_template_args ();
2459 || TREE_CODE (ctx
) == FUNCTION_DECL
2460 || TYPE_BEING_DEFINED (ctx
)
2461 || (is_friend
&& !DECL_TEMPLATE_INFO (decl
)))
2463 if (DECL_LANG_SPECIFIC (decl
)
2464 && DECL_TEMPLATE_INFO (decl
)
2465 && DECL_TI_TEMPLATE (decl
))
2466 tmpl
= DECL_TI_TEMPLATE (decl
);
2467 /* If DECL is a TYPE_DECL for a class-template, then there won't
2468 be DECL_LANG_SPECIFIC. The information equivalent to
2469 DECL_TEMPLATE_INFO is found in TYPE_TEMPLATE_INFO instead. */
2470 else if (DECL_IMPLICIT_TYPEDEF_P (decl
)
2471 && TYPE_TEMPLATE_INFO (TREE_TYPE (decl
))
2472 && TYPE_TI_TEMPLATE (TREE_TYPE (decl
)))
2474 /* Since a template declaration already existed for this
2475 class-type, we must be redeclaring it here. Make sure
2476 that the redeclaration is legal. */
2477 redeclare_class_template (TREE_TYPE (decl
),
2478 current_template_parms
);
2479 /* We don't need to create a new TEMPLATE_DECL; just use the
2480 one we already had. */
2481 tmpl
= TYPE_TI_TEMPLATE (TREE_TYPE (decl
));
2485 tmpl
= build_template_decl (decl
, current_template_parms
);
2488 if (DECL_LANG_SPECIFIC (decl
)
2489 && DECL_TEMPLATE_SPECIALIZATION (decl
))
2491 /* A specialization of a member template of a template
2493 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
2494 DECL_TEMPLATE_INFO (tmpl
) = DECL_TEMPLATE_INFO (decl
);
2495 DECL_TEMPLATE_INFO (decl
) = NULL_TREE
;
2501 tree a
, t
, current
, parms
;
2504 if (TREE_CODE (decl
) == TYPE_DECL
)
2506 if ((IS_AGGR_TYPE_CODE (TREE_CODE (TREE_TYPE (decl
)))
2507 || TREE_CODE (TREE_TYPE (decl
)) == ENUMERAL_TYPE
)
2508 && TYPE_TEMPLATE_INFO (TREE_TYPE (decl
))
2509 && TYPE_TI_TEMPLATE (TREE_TYPE (decl
)))
2510 tmpl
= TYPE_TI_TEMPLATE (TREE_TYPE (decl
));
2513 cp_error ("`%D' does not declare a template type", decl
);
2517 else if (! DECL_TEMPLATE_INFO (decl
))
2519 cp_error ("template definition of non-template `%#D'", decl
);
2523 tmpl
= DECL_TI_TEMPLATE (decl
);
2525 if (is_member_template (tmpl
)
2526 && DECL_FUNCTION_TEMPLATE_P (tmpl
)
2527 && DECL_TEMPLATE_INFO (decl
) && DECL_TI_ARGS (decl
)
2528 && DECL_TEMPLATE_SPECIALIZATION (decl
))
2532 /* The declaration is a specialization of a member
2533 template, declared outside the class. Therefore, the
2534 innermost template arguments will be NULL, so we
2535 replace them with the arguments determined by the
2536 earlier call to check_explicit_specialization. */
2537 args
= DECL_TI_ARGS (decl
);
2540 = build_template_decl (decl
, current_template_parms
);
2541 DECL_TEMPLATE_RESULT (new_tmpl
) = decl
;
2542 TREE_TYPE (new_tmpl
) = TREE_TYPE (decl
);
2543 DECL_TI_TEMPLATE (decl
) = new_tmpl
;
2544 SET_DECL_TEMPLATE_SPECIALIZATION (new_tmpl
);
2545 DECL_TEMPLATE_INFO (new_tmpl
)
2546 = tree_cons (tmpl
, args
, NULL_TREE
);
2548 register_specialization (new_tmpl
,
2549 most_general_template (tmpl
),
2554 /* Make sure the template headers we got make sense. */
2556 parms
= DECL_TEMPLATE_PARMS (tmpl
);
2557 i
= TMPL_PARMS_DEPTH (parms
);
2558 if (TMPL_ARGS_DEPTH (args
) != i
)
2560 cp_error ("expected %d levels of template parms for `%#D', got %d",
2561 i
, decl
, TMPL_ARGS_DEPTH (args
));
2564 for (current
= decl
; i
> 0; --i
, parms
= TREE_CHAIN (parms
))
2566 a
= TMPL_ARGS_LEVEL (args
, i
);
2567 t
= INNERMOST_TEMPLATE_PARMS (parms
);
2569 if (TREE_VEC_LENGTH (t
) != TREE_VEC_LENGTH (a
))
2571 if (current
== decl
)
2572 cp_error ("got %d template parameters for `%#D'",
2573 TREE_VEC_LENGTH (a
), decl
);
2575 cp_error ("got %d template parameters for `%#T'",
2576 TREE_VEC_LENGTH (a
), current
);
2577 cp_error (" but %d required", TREE_VEC_LENGTH (t
));
2580 /* Perhaps we should also check that the parms are used in the
2581 appropriate qualifying scopes in the declarator? */
2583 if (current
== decl
)
2586 current
= TYPE_CONTEXT (current
);
2590 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
2591 TREE_TYPE (tmpl
) = TREE_TYPE (decl
);
2593 /* Push template declarations for global functions and types. Note
2594 that we do not try to push a global template friend declared in a
2595 template class; such a thing may well depend on the template
2596 parameters of the class. */
2597 if (new_template_p
&& !ctx
2598 && !(is_friend
&& template_class_depth (current_class_type
) > 0))
2599 tmpl
= pushdecl_namespace_level (tmpl
);
2602 DECL_PRIMARY_TEMPLATE (tmpl
) = tmpl
;
2604 info
= tree_cons (tmpl
, args
, NULL_TREE
);
2606 if (DECL_IMPLICIT_TYPEDEF_P (decl
))
2608 SET_TYPE_TEMPLATE_INFO (TREE_TYPE (tmpl
), info
);
2609 if ((!ctx
|| TREE_CODE (ctx
) != FUNCTION_DECL
)
2610 && TREE_CODE (TREE_TYPE (decl
)) != ENUMERAL_TYPE
)
2611 DECL_NAME (decl
) = classtype_mangled_name (TREE_TYPE (decl
));
2613 else if (DECL_LANG_SPECIFIC (decl
))
2614 DECL_TEMPLATE_INFO (decl
) = info
;
2616 return DECL_TEMPLATE_RESULT (tmpl
);
2620 push_template_decl (decl
)
2623 return push_template_decl_real (decl
, 0);
2626 /* Called when a class template TYPE is redeclared with the indicated
2627 template PARMS, e.g.:
2629 template <class T> struct S;
2630 template <class T> struct S {}; */
2633 redeclare_class_template (type
, parms
)
2641 if (!TYPE_TEMPLATE_INFO (type
))
2643 cp_error ("`%T' is not a template type", type
);
2647 tmpl
= TYPE_TI_TEMPLATE (type
);
2648 if (!PRIMARY_TEMPLATE_P (tmpl
))
2649 /* The type is nested in some template class. Nothing to worry
2650 about here; there are no new template parameters for the nested
2654 parms
= INNERMOST_TEMPLATE_PARMS (parms
);
2655 tmpl_parms
= DECL_INNERMOST_TEMPLATE_PARMS (tmpl
);
2657 if (TREE_VEC_LENGTH (parms
) != TREE_VEC_LENGTH (tmpl_parms
))
2659 cp_error_at ("previous declaration `%D'", tmpl
);
2660 cp_error ("used %d template parameter%s instead of %d",
2661 TREE_VEC_LENGTH (tmpl_parms
),
2662 TREE_VEC_LENGTH (tmpl_parms
) == 1 ? "" : "s",
2663 TREE_VEC_LENGTH (parms
));
2667 for (i
= 0; i
< TREE_VEC_LENGTH (tmpl_parms
); ++i
)
2669 tree tmpl_parm
= TREE_VALUE (TREE_VEC_ELT (tmpl_parms
, i
));
2670 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
2671 tree tmpl_default
= TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
));
2672 tree parm_default
= TREE_PURPOSE (TREE_VEC_ELT (parms
, i
));
2674 if (TREE_CODE (tmpl_parm
) != TREE_CODE (parm
))
2676 cp_error_at ("template parameter `%#D'", tmpl_parm
);
2677 cp_error ("redeclared here as `%#D'", parm
);
2681 if (tmpl_default
!= NULL_TREE
&& parm_default
!= NULL_TREE
)
2683 /* We have in [temp.param]:
2685 A template-parameter may not be given default arguments
2686 by two different declarations in the same scope. */
2687 cp_error ("redefinition of default argument for `%#D'", parm
);
2688 cp_error_at (" original definition appeared here", tmpl_parm
);
2692 if (parm_default
!= NULL_TREE
)
2693 /* Update the previous template parameters (which are the ones
2694 that will really count) with the new default value. */
2695 TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
)) = parm_default
;
2696 else if (tmpl_default
!= NULL_TREE
)
2697 /* Update the new parameters, too; they'll be used as the
2698 parameters for any members. */
2699 TREE_PURPOSE (TREE_VEC_ELT (parms
, i
)) = tmpl_default
;
2703 /* Attempt to convert the non-type template parameter EXPR to the
2704 indicated TYPE. If the conversion is successful, return the
2705 converted value. If the conversion is unsuccesful, return
2706 NULL_TREE if we issued an error message, or error_mark_node if we
2707 did not. We issue error messages for out-and-out bad template
2708 parameters, but not simply because the conversion failed, since we
2709 might be just trying to do argument deduction. By the time this
2710 function is called, neither TYPE nor EXPR may make use of template
2714 convert_nontype_argument (type
, expr
)
2718 tree expr_type
= TREE_TYPE (expr
);
2720 /* A template-argument for a non-type, non-template
2721 template-parameter shall be one of:
2723 --an integral constant-expression of integral or enumeration
2726 --the name of a non-type template-parameter; or
2728 --the name of an object or function with external linkage,
2729 including function templates and function template-ids but
2730 excluding non-static class members, expressed as id-expression;
2733 --the address of an object or function with external linkage,
2734 including function templates and function template-ids but
2735 excluding non-static class members, expressed as & id-expression
2736 where the & is optional if the name refers to a function or
2739 --a pointer to member expressed as described in _expr.unary.op_. */
2741 /* An integral constant-expression can include const variables or
2742 enumerators. Simplify things by folding them to their values,
2743 unless we're about to bind the declaration to a reference
2745 if (INTEGRAL_TYPE_P (expr_type
)
2746 && TREE_CODE (type
) != REFERENCE_TYPE
)
2747 expr
= decl_constant_value (expr
);
2749 if (is_overloaded_fn (expr
))
2750 /* OK for now. We'll check that it has external linkage later.
2751 Check this first since if expr_type is the unknown_type_node
2752 we would otherwise complain below. */
2754 else if (TYPE_PTRMEM_P (expr_type
)
2755 || TYPE_PTRMEMFUNC_P (expr_type
))
2757 if (TREE_CODE (expr
) != PTRMEM_CST
)
2760 else if (TYPE_PTR_P (expr_type
)
2761 || TYPE_PTRMEM_P (expr_type
)
2762 || TREE_CODE (expr_type
) == ARRAY_TYPE
2763 || TREE_CODE (type
) == REFERENCE_TYPE
2764 /* If expr is the address of an overloaded function, we
2765 will get the unknown_type_node at this point. */
2766 || expr_type
== unknown_type_node
)
2772 if (TREE_CODE (expr_type
) == ARRAY_TYPE
2773 || (TREE_CODE (type
) == REFERENCE_TYPE
2774 && TREE_CODE (e
) != ADDR_EXPR
))
2778 if (TREE_CODE (e
) != ADDR_EXPR
)
2781 cp_error ("`%E' is not a valid template argument", expr
);
2782 if (TYPE_PTR_P (expr_type
))
2784 if (TREE_CODE (TREE_TYPE (expr_type
)) == FUNCTION_TYPE
)
2785 cp_error ("it must be the address of a function with external linkage");
2787 cp_error ("it must be the address of an object with external linkage");
2789 else if (TYPE_PTRMEM_P (expr_type
)
2790 || TYPE_PTRMEMFUNC_P (expr_type
))
2791 cp_error ("it must be a pointer-to-member of the form `&X::Y'");
2796 referent
= TREE_OPERAND (e
, 0);
2797 STRIP_NOPS (referent
);
2800 if (TREE_CODE (referent
) == STRING_CST
)
2802 cp_error ("string literal %E is not a valid template argument because it is the address of an object with static linkage",
2807 if (is_overloaded_fn (referent
))
2808 /* We'll check that it has external linkage later. */
2810 else if (TREE_CODE (referent
) != VAR_DECL
)
2812 else if (!TREE_PUBLIC (referent
))
2814 cp_error ("address of non-extern `%E' cannot be used as template argument", referent
);
2815 return error_mark_node
;
2818 else if (INTEGRAL_TYPE_P (expr_type
)
2819 || TYPE_PTRMEM_P (expr_type
)
2820 || TYPE_PTRMEMFUNC_P (expr_type
)
2821 /* The next two are g++ extensions. */
2822 || TREE_CODE (expr_type
) == REAL_TYPE
2823 || TREE_CODE (expr_type
) == COMPLEX_TYPE
)
2825 if (! TREE_CONSTANT (expr
))
2828 cp_error ("non-constant `%E' cannot be used as template argument",
2835 cp_error ("object `%E' cannot be used as template argument", expr
);
2839 switch (TREE_CODE (type
))
2844 /* For a non-type template-parameter of integral or enumeration
2845 type, integral promotions (_conv.prom_) and integral
2846 conversions (_conv.integral_) are applied. */
2847 if (!INTEGRAL_TYPE_P (expr_type
))
2848 return error_mark_node
;
2850 /* It's safe to call digest_init in this case; we know we're
2851 just converting one integral constant expression to another. */
2852 expr
= digest_init (type
, expr
, (tree
*) 0);
2854 if (TREE_CODE (expr
) != INTEGER_CST
)
2855 /* Curiously, some TREE_CONSTANT integral expressions do not
2856 simplify to integer constants. For example, `3 % 0',
2857 remains a TRUNC_MOD_EXPR. */
2864 /* These are g++ extensions. */
2865 if (TREE_CODE (expr_type
) != TREE_CODE (type
))
2866 return error_mark_node
;
2868 expr
= digest_init (type
, expr
, (tree
*) 0);
2870 if (TREE_CODE (expr
) != REAL_CST
)
2877 tree type_pointed_to
= TREE_TYPE (type
);
2879 if (TYPE_PTRMEM_P (type
))
2883 /* For a non-type template-parameter of type pointer to data
2884 member, qualification conversions (_conv.qual_) are
2886 e
= perform_qualification_conversions (type
, expr
);
2887 if (TREE_CODE (e
) == NOP_EXPR
)
2888 /* The call to perform_qualification_conversions will
2889 insert a NOP_EXPR over EXPR to do express conversion,
2890 if necessary. But, that will confuse us if we use
2891 this (converted) template parameter to instantiate
2892 another template; then the thing will not look like a
2893 valid template argument. So, just make a new
2894 constant, of the appropriate type. */
2895 e
= make_ptrmem_cst (type
, PTRMEM_CST_MEMBER (expr
));
2898 else if (TREE_CODE (type_pointed_to
) == FUNCTION_TYPE
)
2900 /* For a non-type template-parameter of type pointer to
2901 function, only the function-to-pointer conversion
2902 (_conv.func_) is applied. If the template-argument
2903 represents a set of overloaded functions (or a pointer to
2904 such), the matching function is selected from the set
2909 if (TREE_CODE (expr
) == ADDR_EXPR
)
2910 fns
= TREE_OPERAND (expr
, 0);
2914 fn
= instantiate_type (type_pointed_to
, fns
, 0);
2916 if (fn
== error_mark_node
)
2917 return error_mark_node
;
2919 if (!TREE_PUBLIC (fn
))
2921 if (really_overloaded_fn (fns
))
2922 return error_mark_node
;
2927 expr
= build_unary_op (ADDR_EXPR
, fn
, 0);
2929 my_friendly_assert (same_type_p (type
, TREE_TYPE (expr
)),
2935 /* For a non-type template-parameter of type pointer to
2936 object, qualification conversions (_conv.qual_) and the
2937 array-to-pointer conversion (_conv.array_) are applied.
2938 [Note: In particular, neither the null pointer conversion
2939 (_conv.ptr_) nor the derived-to-base conversion
2940 (_conv.ptr_) are applied. Although 0 is a valid
2941 template-argument for a non-type template-parameter of
2942 integral type, it is not a valid template-argument for a
2943 non-type template-parameter of pointer type.]
2945 The call to decay_conversion performs the
2946 array-to-pointer conversion, if appropriate. */
2947 expr
= decay_conversion (expr
);
2949 if (expr
== error_mark_node
)
2950 return error_mark_node
;
2952 return perform_qualification_conversions (type
, expr
);
2957 case REFERENCE_TYPE
:
2959 tree type_referred_to
= TREE_TYPE (type
);
2961 /* If this expression already has reference type, get the
2962 underling object. */
2963 if (TREE_CODE (expr_type
) == REFERENCE_TYPE
)
2965 my_friendly_assert (TREE_CODE (expr
) == ADDR_EXPR
, 20000604);
2966 expr
= TREE_OPERAND (expr
, 0);
2967 expr_type
= TREE_TYPE (expr
);
2970 if (TREE_CODE (type_referred_to
) == FUNCTION_TYPE
)
2972 /* For a non-type template-parameter of type reference to
2973 function, no conversions apply. If the
2974 template-argument represents a set of overloaded
2975 functions, the matching function is selected from the
2976 set (_over.over_). */
2979 fn
= instantiate_type (type_referred_to
, expr
, 0);
2981 if (fn
== error_mark_node
)
2982 return error_mark_node
;
2984 if (!TREE_PUBLIC (fn
))
2986 if (really_overloaded_fn (expr
))
2987 /* Don't issue an error here; we might get a different
2988 function if the overloading had worked out
2990 return error_mark_node
;
2995 my_friendly_assert (same_type_p (type_referred_to
,
3003 /* For a non-type template-parameter of type reference to
3004 object, no conversions apply. The type referred to by the
3005 reference may be more cv-qualified than the (otherwise
3006 identical) type of the template-argument. The
3007 template-parameter is bound directly to the
3008 template-argument, which must be an lvalue. */
3009 if (!same_type_p (TYPE_MAIN_VARIANT (expr_type
),
3010 TYPE_MAIN_VARIANT (type_referred_to
))
3011 || !at_least_as_qualified_p (type_referred_to
,
3013 || !real_lvalue_p (expr
))
3014 return error_mark_node
;
3017 mark_addressable (expr
);
3018 return build1 (ADDR_EXPR
, type
, expr
);
3024 if (!TYPE_PTRMEMFUNC_P (type
))
3025 /* This handles templates like
3026 template<class T, T t> void f();
3027 when T is substituted with any class. The second template
3028 parameter becomes invalid and the template candidate is
3030 return error_mark_node
;
3032 /* For a non-type template-parameter of type pointer to member
3033 function, no conversions apply. If the template-argument
3034 represents a set of overloaded member functions, the
3035 matching member function is selected from the set
3038 if (!TYPE_PTRMEMFUNC_P (expr_type
) &&
3039 expr_type
!= unknown_type_node
)
3040 return error_mark_node
;
3042 if (TREE_CODE (expr
) == PTRMEM_CST
)
3044 /* A ptr-to-member constant. */
3045 if (!same_type_p (type
, expr_type
))
3046 return error_mark_node
;
3051 if (TREE_CODE (expr
) != ADDR_EXPR
)
3052 return error_mark_node
;
3054 expr
= instantiate_type (type
, expr
, 0);
3056 if (expr
== error_mark_node
)
3057 return error_mark_node
;
3059 my_friendly_assert (same_type_p (type
, TREE_TYPE (expr
)),
3066 /* All non-type parameters must have one of these types. */
3067 my_friendly_abort (0);
3071 return error_mark_node
;
3074 /* Return 1 if PARM_PARMS and ARG_PARMS matches using rule for
3075 template template parameters. Both PARM_PARMS and ARG_PARMS are
3076 vectors of TREE_LIST nodes containing TYPE_DECL, TEMPLATE_DECL
3079 ARG_PARMS may contain more parameters than PARM_PARMS. If this is
3080 the case, then extra parameters must have default arguments.
3082 Consider the example:
3083 template <class T, class Allocator = allocator> class vector;
3084 template<template <class U> class TT> class C;
3086 C<vector> is a valid instantiation. PARM_PARMS for the above code
3087 contains a TYPE_DECL (for U), ARG_PARMS contains two TYPE_DECLs (for
3088 T and Allocator) and OUTER_ARGS contains the argument that is used to
3089 substitute the TT parameter. */
3092 coerce_template_template_parms (parm_parms
, arg_parms
, complain
,
3093 in_decl
, outer_args
)
3094 tree parm_parms
, arg_parms
;
3096 tree in_decl
, outer_args
;
3098 int nparms
, nargs
, i
;
3101 my_friendly_assert (TREE_CODE (parm_parms
) == TREE_VEC
, 0);
3102 my_friendly_assert (TREE_CODE (arg_parms
) == TREE_VEC
, 0);
3104 nparms
= TREE_VEC_LENGTH (parm_parms
);
3105 nargs
= TREE_VEC_LENGTH (arg_parms
);
3107 /* The rule here is opposite of coerce_template_parms. */
3110 && TREE_PURPOSE (TREE_VEC_ELT (arg_parms
, nparms
)) == NULL_TREE
))
3113 for (i
= 0; i
< nparms
; ++i
)
3115 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, i
));
3116 arg
= TREE_VALUE (TREE_VEC_ELT (arg_parms
, i
));
3118 if (arg
== NULL_TREE
|| arg
== error_mark_node
3119 || parm
== NULL_TREE
|| parm
== error_mark_node
)
3122 if (TREE_CODE (arg
) != TREE_CODE (parm
))
3125 switch (TREE_CODE (parm
))
3131 /* We encounter instantiations of templates like
3132 template <template <template <class> class> class TT>
3135 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
3136 tree argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
3138 if (!coerce_template_template_parms (parmparm
, argparm
,
3146 /* The tsubst call is used to handle cases such as
3147 template <class T, template <T> class TT> class D;
3148 i.e. the parameter list of TT depends on earlier parameters. */
3149 if (!same_type_p (tsubst (TREE_TYPE (parm
), outer_args
,
3156 my_friendly_abort (0);
3162 /* Convert the indicated template ARG as necessary to match the
3163 indicated template PARM. Returns the converted ARG, or
3164 error_mark_node if the conversion was unsuccessful. Error messages
3165 are issued if COMPLAIN is non-zero. This conversion is for the Ith
3166 parameter in the parameter list. ARGS is the full set of template
3167 arguments deduced so far. */
3170 convert_template_argument (parm
, arg
, args
, complain
, i
, in_decl
)
3180 int is_type
, requires_type
, is_tmpl_type
, requires_tmpl_type
;
3182 inner_args
= INNERMOST_TEMPLATE_ARGS (args
);
3184 if (TREE_CODE (arg
) == TREE_LIST
3185 && TREE_TYPE (arg
) != NULL_TREE
3186 && TREE_CODE (TREE_TYPE (arg
)) == OFFSET_TYPE
)
3188 /* The template argument was the name of some
3189 member function. That's usually
3190 illegal, but static members are OK. In any
3191 case, grab the underlying fields/functions
3192 and issue an error later if required. */
3193 arg
= TREE_VALUE (arg
);
3194 TREE_TYPE (arg
) = unknown_type_node
;
3197 requires_tmpl_type
= TREE_CODE (parm
) == TEMPLATE_DECL
;
3198 requires_type
= (TREE_CODE (parm
) == TYPE_DECL
3199 || requires_tmpl_type
);
3201 /* Check if it is a class template. If REQUIRES_TMPL_TYPE is true,
3202 we also accept implicitly created TYPE_DECL as a valid argument.
3203 This is necessary to handle the case where we pass a template name
3204 to a template template parameter in a scope where we've derived from
3205 in instantiation of that template, so the template name refers to that
3206 instantiation. We really ought to handle this better. */
3208 = ((TREE_CODE (arg
) == TEMPLATE_DECL
3209 && TREE_CODE (DECL_TEMPLATE_RESULT (arg
)) == TYPE_DECL
)
3210 || (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
3211 && !TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (arg
))
3212 || (TREE_CODE (arg
) == RECORD_TYPE
3213 && CLASSTYPE_TEMPLATE_INFO (arg
)
3214 && TREE_CODE (TYPE_NAME (arg
)) == TYPE_DECL
3215 && DECL_ARTIFICIAL (TYPE_NAME (arg
))
3216 && requires_tmpl_type
3217 && is_base_of_enclosing_class (arg
, current_class_type
)));
3218 if (is_tmpl_type
&& TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
3219 arg
= TYPE_STUB_DECL (arg
);
3220 else if (is_tmpl_type
&& TREE_CODE (arg
) == RECORD_TYPE
)
3221 arg
= CLASSTYPE_TI_TEMPLATE (arg
);
3223 is_type
= TYPE_P (arg
) || is_tmpl_type
;
3225 if (requires_type
&& ! is_type
&& TREE_CODE (arg
) == SCOPE_REF
3226 && TREE_CODE (TREE_OPERAND (arg
, 0)) == TEMPLATE_TYPE_PARM
)
3228 cp_pedwarn ("to refer to a type member of a template parameter, use `typename %E'", arg
);
3230 arg
= make_typename_type (TREE_OPERAND (arg
, 0),
3231 TREE_OPERAND (arg
, 1),
3235 if (is_type
!= requires_type
)
3241 cp_error ("type/value mismatch at argument %d in template parameter list for `%D'",
3244 cp_error (" expected a constant of type `%T', got `%T'",
3246 (is_tmpl_type
? DECL_NAME (arg
) : arg
));
3248 cp_error (" expected a type, got `%E'", arg
);
3251 return error_mark_node
;
3253 if (is_tmpl_type
^ requires_tmpl_type
)
3255 if (in_decl
&& complain
)
3257 cp_error ("type/value mismatch at argument %d in template parameter list for `%D'",
3260 cp_error (" expected a type, got `%T'", DECL_NAME (arg
));
3262 cp_error (" expected a class template, got `%T'", arg
);
3264 return error_mark_node
;
3269 if (requires_tmpl_type
)
3271 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
3272 tree argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
3274 if (coerce_template_template_parms (parmparm
, argparm
, complain
,
3275 in_decl
, inner_args
))
3279 /* TEMPLATE_TEMPLATE_PARM node is preferred over
3281 if (val
!= error_mark_node
3282 && DECL_TEMPLATE_TEMPLATE_PARM_P (val
))
3283 val
= TREE_TYPE (val
);
3287 if (in_decl
&& complain
)
3289 cp_error ("type/value mismatch at argument %d in template parameter list for `%D'",
3291 cp_error (" expected a template of type `%D', got `%D'", parm
, arg
);
3294 val
= error_mark_node
;
3299 val
= groktypename (arg
);
3300 if (! processing_template_decl
)
3302 /* [basic.link]: A name with no linkage (notably, the
3303 name of a class or enumeration declared in a local
3304 scope) shall not be used to declare an entity with
3305 linkage. This implies that names with no linkage
3306 cannot be used as template arguments. */
3307 tree t
= no_linkage_check (val
);
3310 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
3312 ("template-argument `%T' uses anonymous type", val
);
3315 ("template-argument `%T' uses local type `%T'",
3317 return error_mark_node
;
3324 tree t
= tsubst (TREE_TYPE (parm
), args
, complain
, in_decl
);
3326 if (processing_template_decl
)
3327 arg
= maybe_fold_nontype_arg (arg
);
3329 if (!uses_template_parms (arg
) && !uses_template_parms (t
))
3330 /* We used to call digest_init here. However, digest_init
3331 will report errors, which we don't want when complain
3332 is zero. More importantly, digest_init will try too
3333 hard to convert things: for example, `0' should not be
3334 converted to pointer type at this point according to
3335 the standard. Accepting this is not merely an
3336 extension, since deciding whether or not these
3337 conversions can occur is part of determining which
3338 function template to call, or whether a given epxlicit
3339 argument specification is legal. */
3340 val
= convert_nontype_argument (t
, arg
);
3344 if (val
== NULL_TREE
)
3345 val
= error_mark_node
;
3346 else if (val
== error_mark_node
&& complain
)
3347 cp_error ("could not convert template argument `%E' to `%T'",
3354 /* Convert all template arguments to their appropriate types, and
3355 return a vector containing the innermost resulting template
3356 arguments. If any error occurs, return error_mark_node, and, if
3357 COMPLAIN is non-zero, issue an error message. Some error messages
3358 are issued even if COMPLAIN is zero; for instance, if a template
3359 argument is composed from a local class.
3361 If REQUIRE_ALL_ARGUMENTS is non-zero, all arguments must be
3362 provided in ARGLIST, or else trailing parameters must have default
3363 values. If REQUIRE_ALL_ARGUMENTS is zero, we will attempt argument
3364 deduction for any unspecified trailing arguments. */
3367 coerce_template_parms (parms
, args
, in_decl
,
3369 require_all_arguments
)
3373 int require_all_arguments
;
3375 int nparms
, nargs
, i
, lost
= 0;
3378 tree new_inner_args
;
3380 inner_args
= INNERMOST_TEMPLATE_ARGS (args
);
3381 nargs
= NUM_TMPL_ARGS (inner_args
);
3382 nparms
= TREE_VEC_LENGTH (parms
);
3386 && require_all_arguments
3387 && TREE_PURPOSE (TREE_VEC_ELT (parms
, nargs
)) == NULL_TREE
))
3391 cp_error ("wrong number of template arguments (%d, should be %d)",
3395 cp_error_at ("provided for `%D'", in_decl
);
3398 return error_mark_node
;
3401 new_inner_args
= make_tree_vec (nparms
);
3402 new_args
= add_outermost_template_args (args
, new_inner_args
);
3403 for (i
= 0; i
< nparms
; i
++)
3408 /* Get the Ith template parameter. */
3409 parm
= TREE_VEC_ELT (parms
, i
);
3411 /* Calculate the Ith argument. */
3412 if (inner_args
&& TREE_CODE (inner_args
) == TREE_LIST
)
3414 arg
= TREE_VALUE (inner_args
);
3415 inner_args
= TREE_CHAIN (inner_args
);
3418 arg
= TREE_VEC_ELT (inner_args
, i
);
3419 /* If no template argument was supplied, look for a default
3421 else if (TREE_PURPOSE (parm
) == NULL_TREE
)
3423 /* There was no default value. */
3424 my_friendly_assert (!require_all_arguments
, 0);
3427 else if (TREE_CODE (TREE_VALUE (parm
)) == TYPE_DECL
)
3428 arg
= tsubst (TREE_PURPOSE (parm
), new_args
, complain
, in_decl
);
3430 arg
= tsubst_expr (TREE_PURPOSE (parm
), new_args
, complain
,
3433 /* Now, convert the Ith argument, as necessary. */
3434 if (arg
== NULL_TREE
)
3435 /* We're out of arguments. */
3437 my_friendly_assert (!require_all_arguments
, 0);
3440 else if (arg
== error_mark_node
)
3442 cp_error ("template argument %d is invalid", i
+ 1);
3443 arg
= error_mark_node
;
3446 arg
= convert_template_argument (TREE_VALUE (parm
),
3447 arg
, new_args
, complain
, i
,
3450 if (arg
== error_mark_node
)
3452 TREE_VEC_ELT (new_inner_args
, i
) = arg
;
3456 return error_mark_node
;
3458 return new_inner_args
;
3461 /* Returns 1 if template args OT and NT are equivalent. */
3464 template_args_equal (ot
, nt
)
3469 if (TREE_CODE (nt
) != TREE_CODE (ot
))
3471 if (TREE_CODE (nt
) == TREE_VEC
)
3472 /* For member templates */
3473 return comp_template_args (ot
, nt
);
3474 else if (TYPE_P (ot
))
3475 return same_type_p (ot
, nt
);
3477 return (cp_tree_equal (ot
, nt
) > 0);
3480 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets
3481 of template arguments. Returns 0 otherwise. */
3484 comp_template_args (oldargs
, newargs
)
3485 tree oldargs
, newargs
;
3489 if (TREE_VEC_LENGTH (oldargs
) != TREE_VEC_LENGTH (newargs
))
3492 for (i
= 0; i
< TREE_VEC_LENGTH (oldargs
); ++i
)
3494 tree nt
= TREE_VEC_ELT (newargs
, i
);
3495 tree ot
= TREE_VEC_ELT (oldargs
, i
);
3497 if (! template_args_equal (ot
, nt
))
3503 /* Given class template name and parameter list, produce a user-friendly name
3504 for the instantiation. */
3507 mangle_class_name_for_template (name
, parms
, arglist
)
3509 tree parms
, arglist
;
3511 static struct obstack scratch_obstack
;
3512 static char *scratch_firstobj
;
3515 if (!scratch_firstobj
)
3516 gcc_obstack_init (&scratch_obstack
);
3518 obstack_free (&scratch_obstack
, scratch_firstobj
);
3519 scratch_firstobj
= obstack_alloc (&scratch_obstack
, 1);
3521 #define ccat(c) obstack_1grow (&scratch_obstack, (c));
3522 #define cat(s) obstack_grow (&scratch_obstack, (s), strlen (s))
3526 nparms
= TREE_VEC_LENGTH (parms
);
3527 arglist
= INNERMOST_TEMPLATE_ARGS (arglist
);
3528 my_friendly_assert (nparms
== TREE_VEC_LENGTH (arglist
), 268);
3529 for (i
= 0; i
< nparms
; i
++)
3531 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
3532 tree arg
= TREE_VEC_ELT (arglist
, i
);
3537 if (TREE_CODE (parm
) == TYPE_DECL
)
3539 cat (type_as_string (arg
, TS_CHASE_TYPEDEFS
));
3542 else if (TREE_CODE (parm
) == TEMPLATE_DECL
)
3544 if (TREE_CODE (arg
) == TEMPLATE_DECL
)
3546 /* Already substituted with real template. Just output
3547 the template name here */
3548 tree context
= DECL_CONTEXT (arg
);
3551 /* The template may be defined in a namespace, or
3552 may be a member template. */
3553 my_friendly_assert (TREE_CODE (context
) == NAMESPACE_DECL
3554 || CLASS_TYPE_P (context
),
3556 cat(decl_as_string (DECL_CONTEXT (arg
), 0));
3559 cat (IDENTIFIER_POINTER (DECL_NAME (arg
)));
3562 /* Output the parameter declaration */
3563 cat (type_as_string (arg
, TS_CHASE_TYPEDEFS
));
3567 my_friendly_assert (TREE_CODE (parm
) == PARM_DECL
, 269);
3569 if (TREE_CODE (arg
) == TREE_LIST
)
3571 /* New list cell was built because old chain link was in
3573 my_friendly_assert (TREE_PURPOSE (arg
) == NULL_TREE
, 270);
3574 arg
= TREE_VALUE (arg
);
3576 /* No need to check arglist against parmlist here; we did that
3577 in coerce_template_parms, called from lookup_template_class. */
3578 cat (expr_as_string (arg
, 0));
3581 char *bufp
= obstack_next_free (&scratch_obstack
);
3583 while (bufp
[offset
- 1] == ' ')
3585 obstack_blank_fast (&scratch_obstack
, offset
);
3587 /* B<C<char> >, not B<C<char>> */
3588 if (bufp
[offset
- 1] == '>')
3593 return (char *) obstack_base (&scratch_obstack
);
3597 classtype_mangled_name (t
)
3600 if (CLASSTYPE_TEMPLATE_INFO (t
)
3601 /* Specializations have already had their names set up in
3602 lookup_template_class. */
3603 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
3605 tree tmpl
= most_general_template (CLASSTYPE_TI_TEMPLATE (t
));
3607 /* For non-primary templates, the template parameters are
3608 implicit from their surrounding context. */
3609 if (PRIMARY_TEMPLATE_P (tmpl
))
3611 tree name
= DECL_NAME (tmpl
);
3612 char *mangled_name
= mangle_class_name_for_template
3613 (IDENTIFIER_POINTER (name
),
3614 DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
3615 CLASSTYPE_TI_ARGS (t
));
3616 tree id
= get_identifier (mangled_name
);
3617 IDENTIFIER_TEMPLATE (id
) = name
;
3622 return TYPE_IDENTIFIER (t
);
3626 add_pending_template (d
)
3629 tree ti
= (TYPE_P (d
)
3630 ? CLASSTYPE_TEMPLATE_INFO (d
)
3631 : DECL_TEMPLATE_INFO (d
));
3634 if (TI_PENDING_TEMPLATE_FLAG (ti
))
3637 /* We are called both from instantiate_decl, where we've already had a
3638 tinst_level pushed, and instantiate_template, where we haven't.
3640 level
= !(current_tinst_level
&& TINST_DECL (current_tinst_level
) == d
);
3643 push_tinst_level (d
);
3645 *template_tail
= tree_cons (current_tinst_level
, d
, NULL_TREE
);
3646 template_tail
= &TREE_CHAIN (*template_tail
);
3647 TI_PENDING_TEMPLATE_FLAG (ti
) = 1;
3654 /* Return a TEMPLATE_ID_EXPR corresponding to the indicated FNS (which
3655 may be either a _DECL or an overloaded function or an
3656 IDENTIFIER_NODE), and ARGLIST. */
3659 lookup_template_function (fns
, arglist
)
3664 if (fns
== NULL_TREE
)
3666 cp_error ("non-template used as template");
3667 return error_mark_node
;
3670 type
= TREE_TYPE (fns
);
3671 if (TREE_CODE (fns
) == OVERLOAD
|| !type
)
3672 type
= unknown_type_node
;
3674 if (processing_template_decl
)
3675 return build_min (TEMPLATE_ID_EXPR
, type
, fns
, arglist
);
3677 return build (TEMPLATE_ID_EXPR
, type
, fns
, arglist
);
3680 /* Within the scope of a template class S<T>, the name S gets bound
3681 (in build_self_reference) to a TYPE_DECL for the class, not a
3682 TEMPLATE_DECL. If DECL is a TYPE_DECL for current_class_type,
3683 or one of its enclosing classes, and that type is a template,
3684 return the associated TEMPLATE_DECL. Otherwise, the original
3685 DECL is returned. */
3688 maybe_get_template_decl_from_type_decl (decl
)
3691 return (decl
!= NULL_TREE
3692 && TREE_CODE (decl
) == TYPE_DECL
3693 && DECL_ARTIFICIAL (decl
)
3694 && CLASS_TYPE_P (TREE_TYPE (decl
))
3695 && CLASSTYPE_TEMPLATE_INFO (TREE_TYPE (decl
)))
3696 ? CLASSTYPE_TI_TEMPLATE (TREE_TYPE (decl
)) : decl
;
3699 /* Given an IDENTIFIER_NODE (type TEMPLATE_DECL) and a chain of
3700 parameters, find the desired type.
3702 D1 is the PTYPENAME terminal, and ARGLIST is the list of arguments.
3703 (Actually ARGLIST may be either a TREE_LIST or a TREE_VEC. It will
3704 be a TREE_LIST if called directly from the parser, and a TREE_VEC
3705 otherwise.) Since ARGLIST is build on the temp_decl_obstack, we must
3706 copy it here to keep it from being reclaimed when the decl storage
3709 IN_DECL, if non-NULL, is the template declaration we are trying to
3712 If ENTERING_SCOPE is non-zero, we are about to enter the scope of
3713 the class we are looking up.
3715 If the template class is really a local class in a template
3716 function, then the FUNCTION_CONTEXT is the function in which it is
3717 being instantiated. */
3720 lookup_template_class (d1
, arglist
, in_decl
, context
, entering_scope
)
3726 tree
template = NULL_TREE
, parmlist
;
3729 if (TREE_CODE (d1
) == IDENTIFIER_NODE
)
3731 if (IDENTIFIER_VALUE (d1
)
3732 && DECL_TEMPLATE_TEMPLATE_PARM_P (IDENTIFIER_VALUE (d1
)))
3733 template = IDENTIFIER_VALUE (d1
);
3737 push_decl_namespace (context
);
3738 template = lookup_name (d1
, /*prefer_type=*/0);
3739 template = maybe_get_template_decl_from_type_decl (template);
3741 pop_decl_namespace ();
3744 context
= DECL_CONTEXT (template);
3746 else if (TREE_CODE (d1
) == TYPE_DECL
&& IS_AGGR_TYPE (TREE_TYPE (d1
)))
3748 tree type
= TREE_TYPE (d1
);
3750 /* If we are declaring a constructor, say A<T>::A<T>, we will get
3751 an implicit typename for the second A. Deal with it. */
3752 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
3753 type
= TREE_TYPE (type
);
3755 if (CLASSTYPE_TEMPLATE_INFO (type
))
3757 template = CLASSTYPE_TI_TEMPLATE (type
);
3758 d1
= DECL_NAME (template);
3761 else if (TREE_CODE (d1
) == ENUMERAL_TYPE
3762 || (TYPE_P (d1
) && IS_AGGR_TYPE (d1
)))
3764 template = TYPE_TI_TEMPLATE (d1
);
3765 d1
= DECL_NAME (template);
3767 else if (TREE_CODE (d1
) == TEMPLATE_DECL
3768 && TREE_CODE (DECL_TEMPLATE_RESULT (d1
)) == TYPE_DECL
)
3771 d1
= DECL_NAME (template);
3772 context
= DECL_CONTEXT (template);
3775 my_friendly_abort (272);
3777 /* With something like `template <class T> class X class X { ... };'
3778 we could end up with D1 having nothing but an IDENTIFIER_VALUE.
3779 We don't want to do that, but we have to deal with the situation,
3780 so let's give them some syntax errors to chew on instead of a
3784 cp_error ("`%T' is not a template", d1
);
3785 return error_mark_node
;
3788 if (TREE_CODE (template) != TEMPLATE_DECL
)
3790 cp_error ("non-template type `%T' used as a template", d1
);
3792 cp_error_at ("for template declaration `%D'", in_decl
);
3793 return error_mark_node
;
3796 if (DECL_TEMPLATE_TEMPLATE_PARM_P (template))
3798 /* Create a new TEMPLATE_DECL and TEMPLATE_TEMPLATE_PARM node to store
3799 template arguments */
3804 parmlist
= DECL_INNERMOST_TEMPLATE_PARMS (template);
3806 arglist2
= coerce_template_parms (parmlist
, arglist
, template, 1, 1);
3807 if (arglist2
== error_mark_node
)
3808 return error_mark_node
;
3810 parm
= copy_template_template_parm (TREE_TYPE (template), arglist2
);
3811 TYPE_SIZE (parm
) = 0;
3816 tree template_type
= TREE_TYPE (template);
3819 tree found
= NULL_TREE
;
3822 int is_partial_instantiation
;
3824 gen_tmpl
= most_general_template (template);
3825 parmlist
= DECL_TEMPLATE_PARMS (gen_tmpl
);
3826 parm_depth
= TMPL_PARMS_DEPTH (parmlist
);
3827 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
3829 if (arg_depth
== 1 && parm_depth
> 1)
3831 /* We've been given an incomplete set of template arguments.
3834 template <class T> struct S1 {
3835 template <class U> struct S2 {};
3836 template <class U> struct S2<U*> {};
3839 we will be called with an ARGLIST of `U*', but the
3840 TEMPLATE will be `template <class T> template
3841 <class U> struct S1<T>::S2'. We must fill in the missing
3844 = add_outermost_template_args (TYPE_TI_ARGS (TREE_TYPE (template)),
3846 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
3849 /* Now we should enough arguments. */
3850 my_friendly_assert (parm_depth
== arg_depth
, 0);
3852 /* From here on, we're only interested in the most general
3854 template = gen_tmpl
;
3856 /* Calculate the BOUND_ARGS. These will be the args that are
3857 actually tsubst'd into the definition to create the
3861 /* We have multiple levels of arguments to coerce, at once. */
3863 int saved_depth
= TMPL_ARGS_DEPTH (arglist
);
3865 tree bound_args
= make_tree_vec (parm_depth
);
3867 for (i
= saved_depth
,
3868 t
= DECL_TEMPLATE_PARMS (template);
3869 i
> 0 && t
!= NULL_TREE
;
3870 --i
, t
= TREE_CHAIN (t
))
3872 tree a
= coerce_template_parms (TREE_VALUE (t
),
3873 arglist
, template, 1, 1);
3874 SET_TMPL_ARGS_LEVEL (bound_args
, i
, a
);
3876 /* We temporarily reduce the length of the ARGLIST so
3877 that coerce_template_parms will see only the arguments
3878 corresponding to the template parameters it is
3880 TREE_VEC_LENGTH (arglist
)--;
3883 /* Restore the ARGLIST to its full size. */
3884 TREE_VEC_LENGTH (arglist
) = saved_depth
;
3886 arglist
= bound_args
;
3890 = coerce_template_parms (INNERMOST_TEMPLATE_PARMS (parmlist
),
3891 INNERMOST_TEMPLATE_ARGS (arglist
),
3894 if (arglist
== error_mark_node
)
3895 /* We were unable to bind the arguments. */
3896 return error_mark_node
;
3898 /* In the scope of a template class, explicit references to the
3899 template class refer to the type of the template, not any
3900 instantiation of it. For example, in:
3902 template <class T> class C { void f(C<T>); }
3904 the `C<T>' is just the same as `C'. Outside of the
3905 class, however, such a reference is an instantiation. */
3906 if (comp_template_args (TYPE_TI_ARGS (template_type
),
3909 found
= template_type
;
3911 if (!entering_scope
&& PRIMARY_TEMPLATE_P (template))
3915 /* Note that we use DECL_CONTEXT, rather than
3916 CP_DECL_CONTEXT, so that the termination test is
3917 always just `ctx'. We're not interested in namepace
3919 for (ctx
= current_class_type
;
3921 ctx
= (TYPE_P (ctx
)) ? TYPE_CONTEXT (ctx
) : DECL_CONTEXT (ctx
))
3922 if (same_type_p (ctx
, template_type
))
3926 /* We're not in the scope of the class, so the
3927 TEMPLATE_TYPE is not the type we want after
3935 for (found
= DECL_TEMPLATE_INSTANTIATIONS (template);
3936 found
; found
= TREE_CHAIN (found
))
3937 if (comp_template_args (TREE_PURPOSE (found
), arglist
))
3941 found
= TREE_VALUE (found
);
3947 /* This type is a "partial instantiation" if any of the template
3948 arguments still inolve template parameters. Note that we set
3949 IS_PARTIAL_INSTANTIATION for partial specializations as
3951 is_partial_instantiation
= uses_template_parms (arglist
);
3953 if (!is_partial_instantiation
3954 && !PRIMARY_TEMPLATE_P (template)
3955 && TREE_CODE (CP_DECL_CONTEXT (template)) == NAMESPACE_DECL
)
3957 found
= xref_tag_from_type (TREE_TYPE (template),
3958 DECL_NAME (template),
3963 context
= tsubst (DECL_CONTEXT (template), arglist
,
3964 /*complain=*/0, in_decl
);
3966 context
= global_namespace
;
3968 /* Create the type. */
3969 if (TREE_CODE (template_type
) == ENUMERAL_TYPE
)
3971 if (!is_partial_instantiation
)
3972 t
= start_enum (TYPE_IDENTIFIER (template_type
));
3974 /* We don't want to call start_enum for this type, since
3975 the values for the enumeration constants may involve
3976 template parameters. And, no one should be interested
3977 in the enumeration constants for such a type. */
3978 t
= make_node (ENUMERAL_TYPE
);
3982 t
= make_aggr_type (TREE_CODE (template_type
));
3983 CLASSTYPE_DECLARED_CLASS (t
)
3984 = CLASSTYPE_DECLARED_CLASS (template_type
);
3985 CLASSTYPE_GOT_SEMICOLON (t
) = 1;
3986 SET_CLASSTYPE_IMPLICIT_INSTANTIATION (t
);
3987 TYPE_FOR_JAVA (t
) = TYPE_FOR_JAVA (template_type
);
3989 /* A local class. Make sure the decl gets registered properly. */
3990 if (context
== current_function_decl
)
3991 pushtag (DECL_NAME (template), t
, 0);
3994 /* If we called start_enum or pushtag above, this information
3995 will already be set up. */
3998 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
4000 type_decl
= create_implicit_typedef (DECL_NAME (template), t
);
4001 DECL_CONTEXT (type_decl
) = TYPE_CONTEXT (t
);
4002 TYPE_STUB_DECL (t
) = type_decl
;
4003 DECL_SOURCE_FILE (type_decl
)
4004 = DECL_SOURCE_FILE (TYPE_STUB_DECL (template_type
));
4005 DECL_SOURCE_LINE (type_decl
)
4006 = DECL_SOURCE_LINE (TYPE_STUB_DECL (template_type
));
4009 type_decl
= TYPE_NAME (t
);
4011 /* Set up the template information. We have to figure out which
4012 template is the immediate parent if this is a full
4014 if (parm_depth
== 1 || is_partial_instantiation
4015 || !PRIMARY_TEMPLATE_P (template))
4016 /* This case is easy; there are no member templates involved. */
4020 /* This is a full instantiation of a member template. There
4021 should be some partial instantiation of which this is an
4024 for (found
= DECL_TEMPLATE_INSTANTIATIONS (template);
4025 found
; found
= TREE_CHAIN (found
))
4028 tree tmpl
= CLASSTYPE_TI_TEMPLATE (TREE_VALUE (found
));
4030 /* We only want partial instantiations, here, not
4031 specializations or full instantiations. */
4032 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_VALUE (found
))
4033 || !uses_template_parms (TREE_VALUE (found
)))
4036 /* Temporarily reduce by one the number of levels in the
4037 ARGLIST and in FOUND so as to avoid comparing the
4038 last set of arguments. */
4039 TREE_VEC_LENGTH (arglist
)--;
4040 TREE_VEC_LENGTH (TREE_PURPOSE (found
)) --;
4042 /* See if the arguments match. If they do, then TMPL is
4043 the partial instantiation we want. */
4044 success
= comp_template_args (TREE_PURPOSE (found
), arglist
);
4046 /* Restore the argument vectors to their full size. */
4047 TREE_VEC_LENGTH (arglist
)++;
4048 TREE_VEC_LENGTH (TREE_PURPOSE (found
))++;
4058 my_friendly_abort (0);
4061 SET_TYPE_TEMPLATE_INFO (t
,
4062 tree_cons (found
, arglist
, NULL_TREE
));
4063 DECL_TEMPLATE_INSTANTIATIONS (template)
4064 = tree_cons (arglist
, t
,
4065 DECL_TEMPLATE_INSTANTIATIONS (template));
4067 if (TREE_CODE (t
) == ENUMERAL_TYPE
4068 && !is_partial_instantiation
)
4069 /* Now that the type has been registered on the instantiations
4070 list, we set up the enumerators. Because the enumeration
4071 constants may involve the enumeration type itself, we make
4072 sure to register the type first, and then create the
4073 constants. That way, doing tsubst_expr for the enumeration
4074 constants won't result in recursive calls here; we'll find
4075 the instantiation and exit above. */
4076 tsubst_enum (template_type
, t
, arglist
);
4078 /* Reset the name of the type, now that CLASSTYPE_TEMPLATE_INFO
4080 if (TREE_CODE (t
) != ENUMERAL_TYPE
)
4081 DECL_NAME (type_decl
) = classtype_mangled_name (t
);
4082 DECL_ASSEMBLER_NAME (type_decl
) = DECL_NAME (type_decl
);
4083 if (!is_partial_instantiation
)
4086 DECL_ASSEMBLER_NAME (type_decl
) = mangle_decl (type_decl
);
4088 DECL_ASSEMBLER_NAME (type_decl
)
4089 = get_identifier (build_overload_name (t
, 1, 1));
4091 /* For backwards compatibility; code that uses
4092 -fexternal-templates expects looking up a template to
4093 instantiate it. I think DDD still relies on this.
4094 (jason 8/20/1998) */
4095 if (TREE_CODE (t
) != ENUMERAL_TYPE
4096 && flag_external_templates
4097 && CLASSTYPE_INTERFACE_KNOWN (TREE_TYPE (template))
4098 && ! CLASSTYPE_INTERFACE_ONLY (TREE_TYPE (template)))
4099 add_pending_template (t
);
4102 /* If the type makes use of template parameters, the
4103 code that generates debugging information will crash. */
4104 DECL_IGNORED_P (TYPE_STUB_DECL (t
)) = 1;
4116 /* Called from for_each_template_parm via walk_tree. */
4119 for_each_template_parm_r (tp
, walk_subtrees
, d
)
4125 struct pair_fn_data
*pfd
= (struct pair_fn_data
*) d
;
4126 tree_fn_t fn
= pfd
->fn
;
4127 void *data
= pfd
->data
;
4130 && for_each_template_parm (TYPE_CONTEXT (t
), fn
, data
))
4131 return error_mark_node
;
4133 switch (TREE_CODE (t
))
4136 if (TYPE_PTRMEMFUNC_FLAG (t
))
4142 if (!TYPE_TEMPLATE_INFO (t
))
4144 else if (for_each_template_parm (TREE_VALUE (TYPE_TEMPLATE_INFO (t
)),
4146 return error_mark_node
;
4150 /* Since we're not going to walk subtrees, we have to do this
4152 if (for_each_template_parm (TYPE_METHOD_BASETYPE (t
), fn
, data
))
4153 return error_mark_node
;
4156 /* Check the return type. */
4157 if (for_each_template_parm (TREE_TYPE (t
), fn
, data
))
4158 return error_mark_node
;
4160 /* Check the parameter types. Since default arguments are not
4161 instantiated until they are needed, the TYPE_ARG_TYPES may
4162 contain expressions that involve template parameters. But,
4163 no-one should be looking at them yet. And, once they're
4164 instantiated, they don't contain template parameters, so
4165 there's no point in looking at them then, either. */
4169 for (parm
= TYPE_ARG_TYPES (t
); parm
; parm
= TREE_CHAIN (parm
))
4170 if (for_each_template_parm (TREE_VALUE (parm
), fn
, data
))
4171 return error_mark_node
;
4173 /* Since we've already handled the TYPE_ARG_TYPES, we don't
4174 want walk_tree walking into them itself. */
4181 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
)
4182 && for_each_template_parm (DECL_TI_ARGS (t
), fn
, data
))
4183 return error_mark_node
;
4188 if (DECL_CONTEXT (t
)
4189 && for_each_template_parm (DECL_CONTEXT (t
), fn
, data
))
4190 return error_mark_node
;
4193 case TEMPLATE_TEMPLATE_PARM
:
4194 /* Record template parameters such as `T' inside `TT<T>'. */
4195 if (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t
)
4196 && for_each_template_parm (TYPE_TI_ARGS (t
), fn
, data
))
4197 return error_mark_node
;
4200 case TEMPLATE_TYPE_PARM
:
4201 case TEMPLATE_PARM_INDEX
:
4202 if (fn
&& (*fn
)(t
, data
))
4203 return error_mark_node
;
4205 return error_mark_node
;
4209 /* A template template parameter is encountered */
4210 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
)
4211 && for_each_template_parm (TREE_TYPE (t
), fn
, data
))
4212 return error_mark_node
;
4214 /* Already substituted template template parameter */
4219 if (!fn
|| for_each_template_parm (TYPENAME_TYPE_FULLNAME (t
), fn
, data
))
4220 return error_mark_node
;
4224 if (TREE_TYPE (t
) && TYPE_PTRMEMFUNC_P (TREE_TYPE (t
))
4225 && for_each_template_parm (TYPE_PTRMEMFUNC_FN_TYPE
4226 (TREE_TYPE (t
)), fn
, data
))
4227 return error_mark_node
;
4232 /* If there's no type, then this thing must be some expression
4233 involving template parameters. */
4234 if (!fn
&& !TREE_TYPE (t
))
4235 return error_mark_node
;
4240 case REINTERPRET_CAST_EXPR
:
4241 case CONST_CAST_EXPR
:
4242 case STATIC_CAST_EXPR
:
4243 case DYNAMIC_CAST_EXPR
:
4248 case PSEUDO_DTOR_EXPR
:
4250 return error_mark_node
;
4257 /* We didn't find any template parameters we liked. */
4261 /* For each TEMPLATE_TYPE_PARM, TEMPLATE_TEMPLATE_PARM, or
4262 TEMPLATE_PARM_INDEX in T, call FN with the parameter and the DATA.
4263 If FN returns non-zero, the iteration is terminated, and
4264 for_each_template_parm returns 1. Otherwise, the iteration
4265 continues. If FN never returns a non-zero value, the value
4266 returned by for_each_template_parm is 0. If FN is NULL, it is
4267 considered to be the function which always returns 1. */
4270 for_each_template_parm (t
, fn
, data
)
4275 struct pair_fn_data pfd
;
4281 /* Walk the tree. */
4282 return walk_tree (&t
, for_each_template_parm_r
, &pfd
) != NULL_TREE
;
4286 uses_template_parms (t
)
4289 return for_each_template_parm (t
, 0, 0);
4292 static int tinst_depth
;
4293 extern int max_tinst_depth
;
4294 #ifdef GATHER_STATISTICS
4297 static int tinst_level_tick
;
4298 static int last_template_error_tick
;
4300 /* Print out all the template instantiations that we are currently
4301 working on. If ERR, we are being called from cp_thing, so do
4302 the right thing for an error message. */
4305 print_template_context (err
)
4308 tree p
= current_tinst_level
;
4310 const char *file
= input_filename
;
4314 if (current_function_decl
!= TINST_DECL (p
)
4315 && current_function_decl
!= NULL_TREE
)
4316 /* We can get here during the processing of some synthesized
4317 method. Then, TINST_DECL (p) will be the function that's causing
4322 if (current_function_decl
== TINST_DECL (p
))
4323 /* Avoid redundancy with the the "In function" line. */;
4325 fprintf (stderr
, "%s: In instantiation of `%s':\n",
4326 file
, decl_as_string (TINST_DECL (p
),
4327 TS_DECL_TYPE
| TS_FUNC_NORETURN
));
4329 line
= TINST_LINE (p
);
4330 file
= TINST_FILE (p
);
4335 for (; p
; p
= TREE_CHAIN (p
))
4337 fprintf (stderr
, "%s:%d: instantiated from `%s'\n", file
, line
,
4338 decl_as_string (TINST_DECL (p
),
4339 TS_DECL_TYPE
| TS_FUNC_NORETURN
));
4340 line
= TINST_LINE (p
);
4341 file
= TINST_FILE (p
);
4343 fprintf (stderr
, "%s:%d: instantiated from here\n", file
, line
);
4346 /* Called from cp_thing to print the template context for an error. */
4349 maybe_print_template_context ()
4351 if (last_template_error_tick
== tinst_level_tick
4352 || current_tinst_level
== 0)
4355 last_template_error_tick
= tinst_level_tick
;
4356 print_template_context (1);
4359 /* We're starting to instantiate D; record the template instantiation context
4360 for diagnostics and to restore it later. */
4363 push_tinst_level (d
)
4368 if (tinst_depth
>= max_tinst_depth
)
4370 /* If the instantiation in question still has unbound template parms,
4371 we don't really care if we can't instantiate it, so just return.
4372 This happens with base instantiation for implicit `typename'. */
4373 if (uses_template_parms (d
))
4376 last_template_error_tick
= tinst_level_tick
;
4377 cp_error ("template instantiation depth exceeds maximum of %d (use -ftemplate-depth-NN to increase the maximum) instantiating `%D'",
4378 max_tinst_depth
, d
);
4380 print_template_context (0);
4385 new = build_expr_wfl (d
, input_filename
, lineno
, 0);
4386 TREE_CHAIN (new) = current_tinst_level
;
4387 current_tinst_level
= new;
4390 #ifdef GATHER_STATISTICS
4391 if (tinst_depth
> depth_reached
)
4392 depth_reached
= tinst_depth
;
4399 /* We're done instantiating this template; return to the instantiation
4405 tree old
= current_tinst_level
;
4407 /* Restore the filename and line number stashed away when we started
4408 this instantiation. */
4409 lineno
= TINST_LINE (old
);
4410 input_filename
= TINST_FILE (old
);
4411 extract_interface_info ();
4413 current_tinst_level
= TREE_CHAIN (old
);
4418 /* We're instantiating a deferred template; restore the template
4419 instantiation context in which the instantiation was requested, which
4420 is one step out from LEVEL. */
4423 reopen_tinst_level (level
)
4429 for (t
= level
; t
; t
= TREE_CHAIN (t
))
4432 current_tinst_level
= level
;
4436 /* Return the outermost template instantiation context, for use with
4437 -falt-external-templates. */
4442 tree p
= current_tinst_level
;
4445 for (; TREE_CHAIN (p
) ; p
= TREE_CHAIN (p
))
4450 /* DECL is a friend FUNCTION_DECL or TEMPLATE_DECL. ARGS is the
4451 vector of template arguments, as for tsubst.
4453 Returns an appropriate tsbust'd friend declaration. */
4456 tsubst_friend_function (decl
, args
)
4462 const char *file
= input_filename
;
4464 lineno
= DECL_SOURCE_LINE (decl
);
4465 input_filename
= DECL_SOURCE_FILE (decl
);
4467 if (TREE_CODE (decl
) == FUNCTION_DECL
4468 && DECL_TEMPLATE_INSTANTIATION (decl
)
4469 && TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
4470 /* This was a friend declared with an explicit template
4471 argument list, e.g.:
4475 to indicate that f was a template instantiation, not a new
4476 function declaration. Now, we have to figure out what
4477 instantiation of what template. */
4484 = lookup_template_function (tsubst_expr (DECL_TI_TEMPLATE (decl
),
4485 args
, /*complain=*/1,
4487 tsubst (DECL_TI_ARGS (decl
),
4488 args
, /*complain=*/1,
4490 new_friend
= tsubst (decl
, args
, /*complain=*/1, NULL_TREE
);
4491 tmpl
= determine_specialization (template_id
, new_friend
,
4493 /*need_member_template=*/0);
4494 new_friend
= instantiate_template (tmpl
, new_args
);
4498 new_friend
= tsubst (decl
, args
, /*complain=*/1, NULL_TREE
);
4500 /* The NEW_FRIEND will look like an instantiation, to the
4501 compiler, but is not an instantiation from the point of view of
4502 the language. For example, we might have had:
4504 template <class T> struct S {
4505 template <class U> friend void f(T, U);
4508 Then, in S<int>, template <class U> void f(int, U) is not an
4509 instantiation of anything. */
4510 DECL_USE_TEMPLATE (new_friend
) = 0;
4511 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
4513 DECL_USE_TEMPLATE (DECL_TEMPLATE_RESULT (new_friend
)) = 0;
4514 DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (new_friend
))
4515 = DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (decl
));
4518 /* The mangled name for the NEW_FRIEND is incorrect. The call to
4519 tsubst will have resulted in a call to
4520 set_mangled_name_for_template_decl. But, the function is not a
4521 template instantiation and should not be mangled like one.
4522 Therefore, we remangle the function name. We don't have to do
4523 this if the NEW_FRIEND is a template since
4524 set_mangled_name_for_template_decl doesn't do anything if the
4525 function declaration still uses template arguments. */
4526 if (TREE_CODE (new_friend
) != TEMPLATE_DECL
)
4528 set_mangled_name_for_decl (new_friend
);
4529 DECL_RTL (new_friend
) = 0;
4530 make_decl_rtl (new_friend
, NULL_PTR
, 1);
4533 if (DECL_NAMESPACE_SCOPE_P (new_friend
))
4536 tree new_friend_template_info
;
4537 tree new_friend_result_template_info
;
4539 int new_friend_is_defn
;
4541 /* We must save some information from NEW_FRIEND before calling
4542 duplicate decls since that function will free NEW_FRIEND if
4544 new_friend_template_info
= DECL_TEMPLATE_INFO (new_friend
);
4545 if (TREE_CODE (new_friend
) == TEMPLATE_DECL
)
4547 /* This declaration is a `primary' template. */
4548 DECL_PRIMARY_TEMPLATE (new_friend
) = new_friend
;
4551 = DECL_INITIAL (DECL_TEMPLATE_RESULT (new_friend
)) != NULL_TREE
;
4552 new_friend_result_template_info
4553 = DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (new_friend
));
4557 new_friend_is_defn
= DECL_INITIAL (new_friend
) != NULL_TREE
;
4558 new_friend_result_template_info
= NULL_TREE
;
4561 /* Inside pushdecl_namespace_level, we will push into the
4562 current namespace. However, the friend function should go
4563 into the namespace of the template. */
4564 ns
= decl_namespace_context (new_friend
);
4565 push_nested_namespace (ns
);
4566 old_decl
= pushdecl_namespace_level (new_friend
);
4567 pop_nested_namespace (ns
);
4569 if (old_decl
!= new_friend
)
4571 /* This new friend declaration matched an existing
4572 declaration. For example, given:
4574 template <class T> void f(T);
4575 template <class U> class C {
4576 template <class T> friend void f(T) {}
4579 the friend declaration actually provides the definition
4580 of `f', once C has been instantiated for some type. So,
4581 old_decl will be the out-of-class template declaration,
4582 while new_friend is the in-class definition.
4584 But, if `f' was called before this point, the
4585 instantiation of `f' will have DECL_TI_ARGS corresponding
4586 to `T' but not to `U', references to which might appear
4587 in the definition of `f'. Previously, the most general
4588 template for an instantiation of `f' was the out-of-class
4589 version; now it is the in-class version. Therefore, we
4590 run through all specialization of `f', adding to their
4591 DECL_TI_ARGS appropriately. In particular, they need a
4592 new set of outer arguments, corresponding to the
4593 arguments for this class instantiation.
4595 The same situation can arise with something like this:
4598 template <class T> class C {
4602 when `C<int>' is instantiated. Now, `f(int)' is defined
4605 if (!new_friend_is_defn
)
4606 /* On the other hand, if the in-class declaration does
4607 *not* provide a definition, then we don't want to alter
4608 existing definitions. We can just leave everything
4613 /* Overwrite whatever template info was there before, if
4614 any, with the new template information pertaining to
4616 DECL_TEMPLATE_INFO (old_decl
) = new_friend_template_info
;
4618 if (TREE_CODE (old_decl
) != TEMPLATE_DECL
)
4619 /* duplicate_decls will take care of this case. */
4624 tree new_friend_args
;
4626 DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (old_decl
))
4627 = new_friend_result_template_info
;
4629 new_friend_args
= TI_ARGS (new_friend_template_info
);
4630 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (old_decl
);
4634 tree spec
= TREE_VALUE (t
);
4637 = add_outermost_template_args (new_friend_args
,
4638 DECL_TI_ARGS (spec
));
4641 /* Now, since specializations are always supposed to
4642 hang off of the most general template, we must move
4644 t
= most_general_template (old_decl
);
4647 DECL_TEMPLATE_SPECIALIZATIONS (t
)
4648 = chainon (DECL_TEMPLATE_SPECIALIZATIONS (t
),
4649 DECL_TEMPLATE_SPECIALIZATIONS (old_decl
));
4650 DECL_TEMPLATE_SPECIALIZATIONS (old_decl
) = NULL_TREE
;
4655 /* The information from NEW_FRIEND has been merged into OLD_DECL
4656 by duplicate_decls. */
4657 new_friend
= old_decl
;
4660 else if (COMPLETE_TYPE_P (DECL_CONTEXT (new_friend
)))
4662 /* Check to see that the declaration is really present, and,
4663 possibly obtain an improved declaration. */
4664 tree fn
= check_classfn (DECL_CONTEXT (new_friend
),
4673 input_filename
= file
;
4677 /* FRIEND_TMPL is a friend TEMPLATE_DECL. ARGS is the vector of
4678 template arguments, as for tsubst.
4680 Returns an appropriate tsbust'd friend type. */
4683 tsubst_friend_class (friend_tmpl
, args
)
4690 /* First, we look for a class template. */
4691 tmpl
= lookup_name (DECL_NAME (friend_tmpl
), /*prefer_type=*/0);
4693 /* But, if we don't find one, it might be because we're in a
4694 situation like this:
4702 Here, in the scope of (say) S<int>, `S' is bound to a TYPE_DECL
4703 for `S<int>', not the TEMPLATE_DECL. */
4704 if (!tmpl
|| !DECL_CLASS_TEMPLATE_P (tmpl
))
4706 tmpl
= lookup_name (DECL_NAME (friend_tmpl
), /*prefer_type=*/1);
4707 tmpl
= maybe_get_template_decl_from_type_decl (tmpl
);
4710 if (tmpl
&& DECL_CLASS_TEMPLATE_P (tmpl
))
4712 /* The friend template has already been declared. Just
4713 check to see that the declarations match, and install any new
4714 default parameters. We must tsubst the default parameters,
4715 of course. We only need the innermost template parameters
4716 because that is all that redeclare_class_template will look
4719 = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_tmpl
),
4720 args
, /*complain=*/1);
4721 redeclare_class_template (TREE_TYPE (tmpl
), parms
);
4722 friend_type
= TREE_TYPE (tmpl
);
4726 /* The friend template has not already been declared. In this
4727 case, the instantiation of the template class will cause the
4728 injection of this template into the global scope. */
4729 tmpl
= tsubst (friend_tmpl
, args
, /*complain=*/1, NULL_TREE
);
4731 /* The new TMPL is not an instantiation of anything, so we
4732 forget its origins. We don't reset CLASSTYPE_TI_TEMPLATE for
4733 the new type because that is supposed to be the corresponding
4734 template decl, i.e., TMPL. */
4735 DECL_USE_TEMPLATE (tmpl
) = 0;
4736 DECL_TEMPLATE_INFO (tmpl
) = NULL_TREE
;
4737 CLASSTYPE_USE_TEMPLATE (TREE_TYPE (tmpl
)) = 0;
4739 /* Inject this template into the global scope. */
4740 friend_type
= TREE_TYPE (pushdecl_top_level (tmpl
));
4747 instantiate_class_template (type
)
4750 tree
template, args
, pattern
, t
;
4753 if (type
== error_mark_node
)
4754 return error_mark_node
;
4756 if (TYPE_BEING_DEFINED (type
) || COMPLETE_TYPE_P (type
))
4759 /* Figure out which template is being instantiated. */
4760 template = most_general_template (CLASSTYPE_TI_TEMPLATE (type
));
4761 my_friendly_assert (TREE_CODE (template) == TEMPLATE_DECL
, 279);
4763 /* Figure out which arguments are being used to do the
4765 args
= CLASSTYPE_TI_ARGS (type
);
4766 PARTIAL_INSTANTIATION_P (type
) = uses_template_parms (args
);
4768 if (pedantic
&& PARTIAL_INSTANTIATION_P (type
))
4769 /* If this is a partial instantiation, then we can't instantiate
4770 the type; there's no telling whether or not one of the
4771 template parameters might eventually be instantiated to some
4772 value that results in a specialization being used. For
4784 Now, the `S<U>' in `f<int>' is the specialization, not an
4785 instantiation of the original template. */
4788 /* Determine what specialization of the original template to
4790 if (PARTIAL_INSTANTIATION_P (type
))
4791 /* There's no telling which specialization is appropriate at this
4792 point. Since all peeking at the innards of this partial
4793 instantiation are extensions (like the "implicit typename"
4794 extension, which allows users to omit the keyword `typename' on
4795 names that are declared as types in template base classes), we
4796 are free to do what we please.
4798 Trying to figure out which partial instantiation to use can
4799 cause a crash. (Some of the template arguments don't even have
4800 types.) So, we just use the most general version. */
4804 t
= most_specialized_class (template, args
);
4806 if (t
== error_mark_node
)
4808 const char *str
= "candidates are:";
4809 cp_error ("ambiguous class template instantiation for `%#T'", type
);
4810 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (template); t
;
4813 if (get_class_bindings (TREE_VALUE (t
), TREE_PURPOSE (t
),
4816 cp_error_at ("%s %+#T", str
, TREE_TYPE (t
));
4820 TYPE_BEING_DEFINED (type
) = 1;
4821 return error_mark_node
;
4826 pattern
= TREE_TYPE (t
);
4828 pattern
= TREE_TYPE (template);
4830 /* If the template we're instantiating is incomplete, then clearly
4831 there's nothing we can do. */
4832 if (!COMPLETE_TYPE_P (pattern
))
4835 /* If this is a partial instantiation, don't tsubst anything. We will
4836 only use this type for implicit typename, so the actual contents don't
4837 matter. All that matters is whether a particular name is a type. */
4838 if (PARTIAL_INSTANTIATION_P (type
))
4840 /* The fields set here must be kept in sync with those cleared
4841 in begin_class_definition. */
4842 TYPE_BINFO_BASETYPES (type
) = TYPE_BINFO_BASETYPES (pattern
);
4843 TYPE_FIELDS (type
) = TYPE_FIELDS (pattern
);
4844 TYPE_METHODS (type
) = TYPE_METHODS (pattern
);
4845 CLASSTYPE_TAGS (type
) = CLASSTYPE_TAGS (pattern
);
4846 CLASSTYPE_VBASECLASSES (type
) = CLASSTYPE_VBASECLASSES (pattern
);
4848 /* Pretend that the type is complete, so that we will look
4849 inside it during name lookup and such. */
4850 TYPE_SIZE (type
) = bitsize_zero_node
;
4854 /* If we've recursively instantiated too many templates, stop. */
4855 if (! push_tinst_level (type
))
4858 /* Now we're really doing the instantiation. Mark the type as in
4859 the process of being defined. */
4860 TYPE_BEING_DEFINED (type
) = 1;
4862 maybe_push_to_top_level (uses_template_parms (type
));
4866 /* This TYPE is actually a instantiation of of a partial
4867 specialization. We replace the innermost set of ARGS with
4868 the arguments appropriate for substitution. For example,
4871 template <class T> struct S {};
4872 template <class T> struct S<T*> {};
4874 and supposing that we are instantiating S<int*>, ARGS will
4875 present be {int*} but we need {int}. */
4877 = get_class_bindings (TREE_VALUE (t
), TREE_PURPOSE (t
),
4880 /* If there were multiple levels in ARGS, replacing the
4881 innermost level would alter CLASSTYPE_TI_ARGS, which we don't
4882 want, so we make a copy first. */
4883 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
4885 args
= copy_node (args
);
4886 SET_TMPL_ARGS_LEVEL (args
, TMPL_ARGS_DEPTH (args
), inner_args
);
4892 if (flag_external_templates
)
4894 if (flag_alt_external_templates
)
4896 CLASSTYPE_INTERFACE_ONLY (type
) = interface_only
;
4897 SET_CLASSTYPE_INTERFACE_UNKNOWN_X (type
, interface_unknown
);
4898 CLASSTYPE_VTABLE_NEEDS_WRITING (type
)
4899 = (! CLASSTYPE_INTERFACE_ONLY (type
)
4900 && CLASSTYPE_INTERFACE_KNOWN (type
));
4904 CLASSTYPE_INTERFACE_ONLY (type
) = CLASSTYPE_INTERFACE_ONLY (pattern
);
4905 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
4906 (type
, CLASSTYPE_INTERFACE_UNKNOWN (pattern
));
4907 CLASSTYPE_VTABLE_NEEDS_WRITING (type
)
4908 = (! CLASSTYPE_INTERFACE_ONLY (type
)
4909 && CLASSTYPE_INTERFACE_KNOWN (type
));
4914 SET_CLASSTYPE_INTERFACE_UNKNOWN (type
);
4915 CLASSTYPE_VTABLE_NEEDS_WRITING (type
) = 1;
4918 TYPE_HAS_CONSTRUCTOR (type
) = TYPE_HAS_CONSTRUCTOR (pattern
);
4919 TYPE_HAS_DESTRUCTOR (type
) = TYPE_HAS_DESTRUCTOR (pattern
);
4920 TYPE_OVERLOADS_CALL_EXPR (type
) = TYPE_OVERLOADS_CALL_EXPR (pattern
);
4921 TYPE_OVERLOADS_ARRAY_REF (type
) = TYPE_OVERLOADS_ARRAY_REF (pattern
);
4922 TYPE_OVERLOADS_ARROW (type
) = TYPE_OVERLOADS_ARROW (pattern
);
4923 TYPE_HAS_NEW_OPERATOR (type
) = TYPE_HAS_NEW_OPERATOR (pattern
);
4924 TYPE_HAS_ARRAY_NEW_OPERATOR (type
) = TYPE_HAS_ARRAY_NEW_OPERATOR (pattern
);
4925 TYPE_GETS_DELETE (type
) = TYPE_GETS_DELETE (pattern
);
4926 TYPE_VEC_DELETE_TAKES_SIZE (type
) = TYPE_VEC_DELETE_TAKES_SIZE (pattern
);
4927 TYPE_HAS_ASSIGN_REF (type
) = TYPE_HAS_ASSIGN_REF (pattern
);
4928 TYPE_HAS_CONST_ASSIGN_REF (type
) = TYPE_HAS_CONST_ASSIGN_REF (pattern
);
4929 TYPE_HAS_ABSTRACT_ASSIGN_REF (type
) = TYPE_HAS_ABSTRACT_ASSIGN_REF (pattern
);
4930 TYPE_HAS_INIT_REF (type
) = TYPE_HAS_INIT_REF (pattern
);
4931 TYPE_HAS_CONST_INIT_REF (type
) = TYPE_HAS_CONST_INIT_REF (pattern
);
4932 TYPE_HAS_DEFAULT_CONSTRUCTOR (type
) = TYPE_HAS_DEFAULT_CONSTRUCTOR (pattern
);
4933 TYPE_HAS_CONVERSION (type
) = TYPE_HAS_CONVERSION (pattern
);
4934 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (type
)
4935 = TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (pattern
);
4936 TYPE_USES_MULTIPLE_INHERITANCE (type
)
4937 = TYPE_USES_MULTIPLE_INHERITANCE (pattern
);
4938 TYPE_USES_VIRTUAL_BASECLASSES (type
)
4939 = TYPE_USES_VIRTUAL_BASECLASSES (pattern
);
4940 TYPE_PACKED (type
) = TYPE_PACKED (pattern
);
4941 TYPE_ALIGN (type
) = TYPE_ALIGN (pattern
);
4942 TYPE_USER_ALIGN (type
) = TYPE_USER_ALIGN (pattern
);
4943 TYPE_FOR_JAVA (type
) = TYPE_FOR_JAVA (pattern
); /* For libjava's JArray<T> */
4944 if (ANON_AGGR_TYPE_P (pattern
))
4945 SET_ANON_AGGR_TYPE_P (type
);
4947 if (TYPE_BINFO_BASETYPES (pattern
))
4949 tree base_list
= NULL_TREE
;
4950 tree pbases
= TYPE_BINFO_BASETYPES (pattern
);
4953 /* Substitute into each of the bases to determine the actual
4955 for (i
= 0; i
< TREE_VEC_LENGTH (pbases
); ++i
)
4961 pbase
= TREE_VEC_ELT (pbases
, i
);
4963 /* Substitue to figure out the base class. */
4964 base
= tsubst (BINFO_TYPE (pbase
), args
,
4965 /*complain=*/1, NULL_TREE
);
4966 if (base
== error_mark_node
)
4969 /* Calculate the correct access node. */
4970 if (TREE_VIA_VIRTUAL (pbase
))
4972 if (TREE_VIA_PUBLIC (pbase
))
4973 access
= access_public_virtual_node
;
4974 else if (TREE_VIA_PROTECTED (pbase
))
4975 access
= access_protected_virtual_node
;
4977 access
= access_private_virtual_node
;
4981 if (TREE_VIA_PUBLIC (pbase
))
4982 access
= access_public_node
;
4983 else if (TREE_VIA_PROTECTED (pbase
))
4984 access
= access_protected_node
;
4986 access
= access_private_node
;
4989 base_list
= tree_cons (access
, base
, base_list
);
4992 /* The list is now in reverse order; correct that. */
4993 base_list
= nreverse (base_list
);
4995 /* Now call xref_basetypes to set up all the base-class
4997 xref_basetypes (TREE_CODE (pattern
) == RECORD_TYPE
4998 ? (CLASSTYPE_DECLARED_CLASS (pattern
)
4999 ? class_type_node
: record_type_node
)
5001 DECL_NAME (TYPE_NAME (pattern
)),
5006 /* Now that our base classes are set up, enter the scope of the
5007 class, so that name lookups into base classes, etc. will work
5008 corectly. This is precisely analagous to what we do in
5009 begin_class_definition when defining an ordinary non-template
5011 pushclass (type
, 1);
5013 for (t
= CLASSTYPE_TAGS (pattern
); t
; t
= TREE_CHAIN (t
))
5015 tree tag
= TREE_VALUE (t
);
5016 tree name
= TYPE_IDENTIFIER (tag
);
5019 newtag
= tsubst (tag
, args
, /*complain=*/1, NULL_TREE
);
5020 if (TREE_CODE (newtag
) != ENUMERAL_TYPE
)
5022 if (TYPE_LANG_SPECIFIC (tag
) && CLASSTYPE_IS_TEMPLATE (tag
))
5023 /* Unfortunately, lookup_template_class sets
5024 CLASSTYPE_IMPLICIT_INSTANTIATION for a partial
5025 instantiation (i.e., for the type of a member template
5026 class nested within a template class.) This behavior is
5027 required for maybe_process_partial_specialization to work
5028 correctly, but is not accurate in this case; the TAG is not
5029 an instantiation of anything. (The corresponding
5030 TEMPLATE_DECL is an instantiation, but the TYPE is not.) */
5031 CLASSTYPE_USE_TEMPLATE (newtag
) = 0;
5033 /* Now, we call pushtag to put this NEWTAG into the scope of
5034 TYPE. We first set up the IDENTIFIER_TYPE_VALUE to avoid
5035 pushtag calling push_template_decl. We don't have to do
5036 this for enums because it will already have been done in
5039 SET_IDENTIFIER_TYPE_VALUE (name
, newtag
);
5040 pushtag (name
, newtag
, /*globalize=*/0);
5044 /* Don't replace enum constants here. */
5045 for (t
= TYPE_FIELDS (pattern
); t
; t
= TREE_CHAIN (t
))
5046 if (TREE_CODE (t
) != CONST_DECL
)
5050 /* The the file and line for this declaration, to assist in
5051 error message reporting. Since we called push_tinst_level
5052 above, we don't need to restore these. */
5053 lineno
= DECL_SOURCE_LINE (t
);
5054 input_filename
= DECL_SOURCE_FILE (t
);
5056 r
= tsubst (t
, args
, /*complain=*/1, NULL_TREE
);
5057 if (TREE_CODE (r
) == VAR_DECL
)
5061 if (DECL_DEFINED_IN_CLASS_P (r
))
5062 init
= tsubst_expr (DECL_INITIAL (t
), args
,
5063 /*complain=*/1, NULL_TREE
);
5067 finish_static_data_member_decl (r
, init
,
5068 /*asmspec_tree=*/NULL_TREE
,
5071 if (DECL_DEFINED_IN_CLASS_P (r
))
5072 check_static_variable_definition (r
, TREE_TYPE (r
));
5075 /* R will have a TREE_CHAIN if and only if it has already been
5076 processed by finish_member_declaration. This can happen
5077 if, for example, it is a TYPE_DECL for a class-scoped
5078 ENUMERAL_TYPE; such a thing will already have been added to
5079 the field list by tsubst_enum above. */
5080 if (!TREE_CHAIN (r
))
5082 set_current_access_from_decl (r
);
5083 finish_member_declaration (r
);
5087 /* Set up the list (TYPE_METHODS) and vector (CLASSTYPE_METHOD_VEC)
5088 for this instantiation. */
5089 for (t
= TYPE_METHODS (pattern
); t
; t
= TREE_CHAIN (t
))
5091 tree r
= tsubst (t
, args
, /*complain=*/1, NULL_TREE
);
5092 set_current_access_from_decl (r
);
5093 finish_member_declaration (r
);
5096 /* Construct the DECL_FRIENDLIST for the new class type. */
5097 typedecl
= TYPE_MAIN_DECL (type
);
5098 for (t
= DECL_FRIENDLIST (TYPE_MAIN_DECL (pattern
));
5104 for (friends
= TREE_VALUE (t
);
5105 friends
!= NULL_TREE
;
5106 friends
= TREE_CHAIN (friends
))
5107 if (TREE_PURPOSE (friends
) == error_mark_node
)
5109 tsubst_friend_function (TREE_VALUE (friends
),
5112 my_friendly_abort (20000216);
5115 for (t
= CLASSTYPE_FRIEND_CLASSES (pattern
);
5119 tree friend_type
= TREE_VALUE (t
);
5120 tree new_friend_type
;
5122 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
5123 new_friend_type
= tsubst_friend_class (friend_type
, args
);
5124 else if (uses_template_parms (friend_type
))
5125 new_friend_type
= tsubst (friend_type
, args
, /*complain=*/1,
5129 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (friend_type
));
5131 /* The call to xref_tag_from_type does injection for friend
5133 push_nested_namespace (ns
);
5135 xref_tag_from_type (friend_type
, NULL_TREE
, 1);
5136 pop_nested_namespace (ns
);
5139 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
5140 /* Trick make_friend_class into realizing that the friend
5141 we're adding is a template, not an ordinary class. It's
5142 important that we use make_friend_class since it will
5143 perform some error-checking and output cross-reference
5145 ++processing_template_decl
;
5147 make_friend_class (type
, new_friend_type
);
5149 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
5150 --processing_template_decl
;
5153 for (t
= TYPE_FIELDS (type
); t
; t
= TREE_CHAIN (t
))
5154 if (TREE_CODE (t
) == FIELD_DECL
)
5156 TREE_TYPE (t
) = complete_type (TREE_TYPE (t
));
5157 require_complete_type (t
);
5160 /* Set the file and line number information to whatever is given for
5161 the class itself. This puts error messages involving generated
5162 implicit functions at a predictable point, and the same point
5163 that would be used for non-template classes. */
5164 lineno
= DECL_SOURCE_LINE (typedecl
);
5165 input_filename
= DECL_SOURCE_FILE (typedecl
);
5167 unreverse_member_declarations (type
);
5168 finish_struct_1 (type
);
5169 CLASSTYPE_GOT_SEMICOLON (type
) = 1;
5171 /* Clear this now so repo_template_used is happy. */
5172 TYPE_BEING_DEFINED (type
) = 0;
5173 repo_template_used (type
);
5175 /* Now that the class is complete, instantiate default arguments for
5176 any member functions. We don't do this earlier because the
5177 default arguments may reference members of the class. */
5178 if (!PRIMARY_TEMPLATE_P (template))
5179 for (t
= TYPE_METHODS (type
); t
; t
= TREE_CHAIN (t
))
5180 if (TREE_CODE (t
) == FUNCTION_DECL
5181 /* Implicitly generated member functions will not have tmplate
5182 information; they are not instantiations, but instead are
5183 created "fresh" for each instantiation. */
5184 && DECL_TEMPLATE_INFO (t
))
5185 tsubst_default_arguments (t
);
5188 pop_from_top_level ();
5198 if (t1
== NULL_TREE
)
5199 return t2
== NULL_TREE
;
5200 if (t2
== NULL_TREE
)
5202 /* Don't care if one declares its arg const and the other doesn't -- the
5203 main variant of the arg type is all that matters. */
5204 if (TYPE_MAIN_VARIANT (TREE_VALUE (t1
))
5205 != TYPE_MAIN_VARIANT (TREE_VALUE (t2
)))
5207 return list_eq (TREE_CHAIN (t1
), TREE_CHAIN (t2
));
5210 /* If arg is a non-type template parameter that does not depend on template
5211 arguments, fold it like we weren't in the body of a template. */
5214 maybe_fold_nontype_arg (arg
)
5217 /* If we're not in a template, ARG is already as simple as it's going to
5218 get, and trying to reprocess the trees will break. */
5219 if (! processing_template_decl
)
5222 if (!TYPE_P (arg
) && !uses_template_parms (arg
))
5224 /* Sometimes, one of the args was an expression involving a
5225 template constant parameter, like N - 1. Now that we've
5226 tsubst'd, we might have something like 2 - 1. This will
5227 confuse lookup_template_class, so we do constant folding
5228 here. We have to unset processing_template_decl, to
5229 fool build_expr_from_tree() into building an actual
5232 int saved_processing_template_decl
= processing_template_decl
;
5233 processing_template_decl
= 0;
5234 arg
= fold (build_expr_from_tree (arg
));
5235 processing_template_decl
= saved_processing_template_decl
;
5240 /* Substitute ARGS into the vector of template arguments T. */
5243 tsubst_template_arg_vector (t
, args
, complain
)
5248 int len
= TREE_VEC_LENGTH (t
), need_new
= 0, i
;
5249 tree
*elts
= (tree
*) alloca (len
* sizeof (tree
));
5251 bzero ((char *) elts
, len
* sizeof (tree
));
5253 for (i
= 0; i
< len
; i
++)
5255 if (TREE_VEC_ELT (t
, i
) != NULL_TREE
5256 && TREE_CODE (TREE_VEC_ELT (t
, i
)) == TREE_VEC
)
5257 elts
[i
] = tsubst_template_arg_vector (TREE_VEC_ELT (t
, i
),
5260 elts
[i
] = maybe_fold_nontype_arg
5261 (tsubst_expr (TREE_VEC_ELT (t
, i
), args
, complain
,
5264 if (elts
[i
] != TREE_VEC_ELT (t
, i
))
5271 t
= make_tree_vec (len
);
5272 for (i
= 0; i
< len
; i
++)
5273 TREE_VEC_ELT (t
, i
) = elts
[i
];
5278 /* Return the result of substituting ARGS into the template parameters
5279 given by PARMS. If there are m levels of ARGS and m + n levels of
5280 PARMS, then the result will contain n levels of PARMS. For
5281 example, if PARMS is `template <class T> template <class U>
5282 template <T*, U, class V>' and ARGS is {{int}, {double}} then the
5283 result will be `template <int*, double, class V>'. */
5286 tsubst_template_parms (parms
, args
, complain
)
5294 for (new_parms
= &r
;
5295 TMPL_PARMS_DEPTH (parms
) > TMPL_ARGS_DEPTH (args
);
5296 new_parms
= &(TREE_CHAIN (*new_parms
)),
5297 parms
= TREE_CHAIN (parms
))
5300 make_tree_vec (TREE_VEC_LENGTH (TREE_VALUE (parms
)));
5303 for (i
= 0; i
< TREE_VEC_LENGTH (new_vec
); ++i
)
5305 tree default_value
=
5306 TREE_PURPOSE (TREE_VEC_ELT (TREE_VALUE (parms
), i
));
5308 TREE_VALUE (TREE_VEC_ELT (TREE_VALUE (parms
), i
));
5310 TREE_VEC_ELT (new_vec
, i
)
5311 = build_tree_list (tsubst (default_value
, args
, complain
,
5313 tsubst (parm_decl
, args
, complain
,
5318 tree_cons (build_int_2 (0, (TMPL_PARMS_DEPTH (parms
)
5319 - TMPL_ARGS_DEPTH (args
))),
5320 new_vec
, NULL_TREE
);
5326 /* Substitute the ARGS into the indicated aggregate (or enumeration)
5327 type T. If T is not an aggregate or enumeration type, it is
5328 handled as if by tsubst. IN_DECL is as for tsubst. If
5329 ENTERING_SCOPE is non-zero, T is the context for a template which
5330 we are presently tsubst'ing. Return the subsituted value. */
5333 tsubst_aggr_type (t
, args
, complain
, in_decl
, entering_scope
)
5343 switch (TREE_CODE (t
))
5346 if (TYPE_PTRMEMFUNC_P (t
))
5348 tree r
= build_ptrmemfunc_type
5349 (tsubst (TYPE_PTRMEMFUNC_FN_TYPE (t
), args
, complain
, in_decl
));
5350 return cp_build_qualified_type_real (r
, TYPE_QUALS (t
),
5354 /* else fall through */
5357 if (TYPE_TEMPLATE_INFO (t
))
5363 /* First, determine the context for the type we are looking
5365 if (TYPE_CONTEXT (t
) != NULL_TREE
)
5366 context
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
,
5368 in_decl
, /*entering_scope=*/1);
5370 context
= NULL_TREE
;
5372 /* Then, figure out what arguments are appropriate for the
5373 type we are trying to find. For example, given:
5375 template <class T> struct S;
5376 template <class T, class U> void f(T, U) { S<U> su; }
5378 and supposing that we are instantiating f<int, double>,
5379 then our ARGS will be {int, double}, but, when looking up
5380 S we only want {double}. */
5381 argvec
= tsubst_template_arg_vector (TYPE_TI_ARGS (t
), args
,
5384 r
= lookup_template_class (t
, argvec
, in_decl
, context
,
5387 return cp_build_qualified_type_real (r
, TYPE_QUALS (t
),
5391 /* This is not a template type, so there's nothing to do. */
5395 return tsubst (t
, args
, complain
, in_decl
);
5399 /* Substitute into the default argument ARG (a default argument for
5400 FN), which has the indicated TYPE. */
5403 tsubst_default_argument (fn
, type
, arg
)
5408 /* This default argument came from a template. Instantiate the
5409 default argument here, not in tsubst. In the case of
5418 we must be careful to do name lookup in the scope of S<T>,
5419 rather than in the current class. */
5420 if (DECL_CLASS_SCOPE_P (fn
))
5421 pushclass (DECL_CONTEXT (fn
), 2);
5423 arg
= tsubst_expr (arg
, DECL_TI_ARGS (fn
), /*complain=*/1, NULL_TREE
);
5425 if (DECL_CLASS_SCOPE_P (fn
))
5428 /* Make sure the default argument is reasonable. */
5429 arg
= check_default_argument (type
, arg
);
5434 /* Substitute into all the default arguments for FN. */
5437 tsubst_default_arguments (fn
)
5443 tmpl_args
= DECL_TI_ARGS (fn
);
5445 /* If this function is not yet instantiated, we certainly don't need
5446 its default arguments. */
5447 if (uses_template_parms (tmpl_args
))
5450 for (arg
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
5452 arg
= TREE_CHAIN (arg
))
5453 if (TREE_PURPOSE (arg
))
5454 TREE_PURPOSE (arg
) = tsubst_default_argument (fn
,
5456 TREE_PURPOSE (arg
));
5459 /* Substitute the ARGS into the T, which is a _DECL. TYPE is the
5460 (already computed) substitution of ARGS into TREE_TYPE (T), if
5461 appropriate. Return the result of the substitution. IN_DECL is as
5465 tsubst_decl (t
, args
, type
, in_decl
)
5472 const char *saved_filename
;
5475 /* Set the filename and linenumber to improve error-reporting. */
5476 saved_lineno
= lineno
;
5477 saved_filename
= input_filename
;
5478 lineno
= DECL_SOURCE_LINE (t
);
5479 input_filename
= DECL_SOURCE_FILE (t
);
5481 switch (TREE_CODE (t
))
5485 /* We can get here when processing a member template function
5486 of a template class. */
5487 tree decl
= DECL_TEMPLATE_RESULT (t
);
5489 int is_template_template_parm
= DECL_TEMPLATE_TEMPLATE_PARM_P (t
);
5491 if (!is_template_template_parm
)
5493 /* We might already have an instance of this template.
5494 The ARGS are for the surrounding class type, so the
5495 full args contain the tsubst'd args for the context,
5496 plus the innermost args from the template decl. */
5497 tree tmpl_args
= DECL_CLASS_TEMPLATE_P (t
)
5498 ? CLASSTYPE_TI_ARGS (TREE_TYPE (t
))
5499 : DECL_TI_ARGS (DECL_TEMPLATE_RESULT (t
));
5502 full_args
= tsubst_template_arg_vector (tmpl_args
, args
,
5505 /* tsubst_template_arg_vector doesn't copy the vector if
5506 nothing changed. But, *something* should have
5508 my_friendly_assert (full_args
!= tmpl_args
, 0);
5510 spec
= retrieve_specialization (t
, full_args
);
5511 if (spec
!= NULL_TREE
)
5518 /* Make a new template decl. It will be similar to the
5519 original, but will record the current template arguments.
5520 We also create a new function declaration, which is just
5521 like the old one, but points to this new template, rather
5522 than the old one. */
5524 my_friendly_assert (DECL_LANG_SPECIFIC (r
) != 0, 0);
5525 TREE_CHAIN (r
) = NULL_TREE
;
5527 if (is_template_template_parm
)
5529 tree new_decl
= tsubst (decl
, args
, /*complain=*/1, in_decl
);
5530 DECL_TEMPLATE_RESULT (r
) = new_decl
;
5531 TREE_TYPE (r
) = TREE_TYPE (new_decl
);
5536 = tsubst_aggr_type (DECL_CONTEXT (t
), args
,
5537 /*complain=*/1, in_decl
,
5538 /*entering_scope=*/1);
5539 DECL_VIRTUAL_CONTEXT (r
)
5540 = tsubst_aggr_type (DECL_VIRTUAL_CONTEXT (t
), args
,
5541 /*complain=*/1, in_decl
,
5542 /*entering_scope=*/1);
5543 DECL_TEMPLATE_INFO (r
) = build_tree_list (t
, args
);
5545 if (TREE_CODE (decl
) == TYPE_DECL
)
5547 tree new_type
= tsubst (TREE_TYPE (t
), args
,
5548 /*complain=*/1, in_decl
);
5549 TREE_TYPE (r
) = new_type
;
5550 CLASSTYPE_TI_TEMPLATE (new_type
) = r
;
5551 DECL_TEMPLATE_RESULT (r
) = TYPE_MAIN_DECL (new_type
);
5552 DECL_TI_ARGS (r
) = CLASSTYPE_TI_ARGS (new_type
);
5556 tree new_decl
= tsubst (decl
, args
, /*complain=*/1, in_decl
);
5558 DECL_TEMPLATE_RESULT (r
) = new_decl
;
5559 DECL_TI_TEMPLATE (new_decl
) = r
;
5560 TREE_TYPE (r
) = TREE_TYPE (new_decl
);
5561 DECL_TI_ARGS (r
) = DECL_TI_ARGS (new_decl
);
5564 SET_DECL_IMPLICIT_INSTANTIATION (r
);
5565 DECL_TEMPLATE_INSTANTIATIONS (r
) = NULL_TREE
;
5566 DECL_TEMPLATE_SPECIALIZATIONS (r
) = NULL_TREE
;
5568 /* The template parameters for this new template are all the
5569 template parameters for the old template, except the
5570 outermost level of parameters. */
5571 DECL_TEMPLATE_PARMS (r
)
5572 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t
), args
,
5575 if (PRIMARY_TEMPLATE_P (t
))
5576 DECL_PRIMARY_TEMPLATE (r
) = r
;
5578 /* We don't partially instantiate partial specializations. */
5579 if (TREE_CODE (decl
) == TYPE_DECL
)
5582 /* Record this partial instantiation. */
5583 register_specialization (r
, t
,
5584 DECL_TI_ARGS (DECL_TEMPLATE_RESULT (r
)));
5592 tree argvec
= NULL_TREE
;
5599 /* Nobody should be tsubst'ing into non-template functions. */
5600 my_friendly_assert (DECL_TEMPLATE_INFO (t
) != NULL_TREE
, 0);
5602 if (TREE_CODE (DECL_TI_TEMPLATE (t
)) == TEMPLATE_DECL
)
5606 /* Calculate the most general template of which R is a
5607 specialization, and the complete set of arguments used to
5609 gen_tmpl
= most_general_template (DECL_TI_TEMPLATE (t
));
5611 = tsubst_template_arg_vector (DECL_TI_ARGS
5612 (DECL_TEMPLATE_RESULT (gen_tmpl
)),
5613 args
, /*complain=*/1);
5615 /* Check to see if we already have this specialization. */
5616 spec
= retrieve_specialization (gen_tmpl
, argvec
);
5624 /* We can see more levels of arguments than parameters if
5625 there was a specialization of a member template, like
5628 template <class T> struct S { template <class U> void f(); }
5629 template <> template <class U> void S<int>::f(U);
5631 Here, we'll be subtituting into the specialization,
5632 because that's where we can find the code we actually
5633 want to generate, but we'll have enough arguments for
5634 the most general template.
5636 We also deal with the peculiar case:
5638 template <class T> struct S {
5639 template <class U> friend void f();
5641 template <class U> void f() {}
5643 template void f<double>();
5645 Here, the ARGS for the instantiation of will be {int,
5646 double}. But, we only need as many ARGS as there are
5647 levels of template parameters in CODE_PATTERN. We are
5648 careful not to get fooled into reducing the ARGS in
5651 template <class T> struct S { template <class U> void f(U); }
5652 template <class T> template <> void S<T>::f(int) {}
5654 which we can spot because the pattern will be a
5655 specialization in this case. */
5656 args_depth
= TMPL_ARGS_DEPTH (args
);
5658 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (t
)));
5659 if (args_depth
> parms_depth
5660 && !DECL_TEMPLATE_SPECIALIZATION (t
))
5661 args
= get_innermost_template_args (args
, parms_depth
);
5665 /* This special case arises when we have something like this:
5667 template <class T> struct S {
5668 friend void f<int>(int, double);
5671 Here, the DECL_TI_TEMPLATE for the friend declaration
5672 will be a LOOKUP_EXPR or an IDENTIFIER_NODE. We are
5673 being called from tsubst_friend_function, and we want
5674 only to create a new decl (R) with appropriate types so
5675 that we can call determine_specialization. */
5676 my_friendly_assert ((TREE_CODE (DECL_TI_TEMPLATE (t
))
5678 || (TREE_CODE (DECL_TI_TEMPLATE (t
))
5679 == IDENTIFIER_NODE
), 0);
5680 gen_tmpl
= NULL_TREE
;
5683 if (DECL_CLASS_SCOPE_P (t
))
5685 if (DECL_NAME (t
) == constructor_name (DECL_CONTEXT (t
)))
5689 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
,
5691 /*entering_scope=*/1);
5696 ctx
= DECL_CONTEXT (t
);
5698 type
= tsubst (type
, args
, /*complain=*/1, in_decl
);
5699 if (type
== error_mark_node
)
5700 return error_mark_node
;
5702 /* We do NOT check for matching decls pushed separately at this
5703 point, as they may not represent instantiations of this
5704 template, and in any case are considered separate under the
5705 discrete model. Instead, see add_maybe_template. */
5707 DECL_USE_TEMPLATE (r
) = 0;
5708 TREE_TYPE (r
) = type
;
5710 DECL_CONTEXT (r
) = ctx
;
5711 DECL_VIRTUAL_CONTEXT (r
)
5712 = tsubst_aggr_type (DECL_VIRTUAL_CONTEXT (t
), args
,
5714 /*entering_scope=*/1);
5716 if (member
&& DECL_CONV_FN_P (r
))
5718 /* Type-conversion operator. Reconstruct the name, in
5719 case it's the name of one of the template's parameters. */
5721 DECL_NAME (r
) = mangle_conv_op_name_for_type (TREE_TYPE (type
));
5723 DECL_NAME (r
) = build_typename_overload (TREE_TYPE (type
));
5726 DECL_ARGUMENTS (r
) = tsubst (DECL_ARGUMENTS (t
), args
,
5728 DECL_TEMPLATE_RESULT (r
) = NULL_TREE
;
5730 TREE_STATIC (r
) = 0;
5731 TREE_PUBLIC (r
) = TREE_PUBLIC (t
);
5732 DECL_EXTERNAL (r
) = 1;
5733 DECL_INTERFACE_KNOWN (r
) = 0;
5734 DECL_DEFER_OUTPUT (r
) = 0;
5735 TREE_CHAIN (r
) = NULL_TREE
;
5736 DECL_PENDING_INLINE_INFO (r
) = 0;
5737 DECL_PENDING_INLINE_P (r
) = 0;
5738 DECL_SAVED_TREE (r
) = NULL_TREE
;
5740 if (DECL_CLONED_FUNCTION (r
))
5742 DECL_CLONED_FUNCTION (r
) = tsubst (DECL_CLONED_FUNCTION (t
),
5743 args
, /*complain=*/1, t
);
5744 TREE_CHAIN (r
) = TREE_CHAIN (DECL_CLONED_FUNCTION (r
));
5745 TREE_CHAIN (DECL_CLONED_FUNCTION (r
)) = r
;
5748 /* Set up the DECL_TEMPLATE_INFO for R and compute its mangled
5749 name. There's no need to do this in the special friend
5750 case mentioned above where GEN_TMPL is NULL. */
5753 DECL_TEMPLATE_INFO (r
)
5754 = tree_cons (gen_tmpl
, argvec
, NULL_TREE
);
5755 SET_DECL_IMPLICIT_INSTANTIATION (r
);
5756 register_specialization (r
, gen_tmpl
, argvec
);
5758 /* Set the mangled name for R. */
5759 if (DECL_DESTRUCTOR_P (t
))
5762 set_mangled_name_for_decl (r
);
5764 DECL_ASSEMBLER_NAME (r
) = build_destructor_name (ctx
);
5768 /* Instantiations of template functions must be mangled
5769 specially, in order to conform to 14.5.5.1
5770 [temp.over.link]. */
5771 tree tmpl
= DECL_TI_TEMPLATE (t
);
5773 /* TMPL will be NULL if this is a specialization of a
5774 member function of a template class. */
5775 if (name_mangling_version
< 1
5776 || tmpl
== NULL_TREE
5777 || (member
&& !is_member_template (tmpl
)
5778 && !DECL_TEMPLATE_INFO (tmpl
)))
5779 set_mangled_name_for_decl (r
);
5781 set_mangled_name_for_template_decl (r
);
5785 make_decl_rtl (r
, NULL_PTR
, 1);
5787 /* Like grokfndecl. If we don't do this, pushdecl will
5788 mess up our TREE_CHAIN because it doesn't find a
5789 previous decl. Sigh. */
5791 && ! uses_template_parms (r
)
5792 && (IDENTIFIER_GLOBAL_VALUE (DECL_ASSEMBLER_NAME (r
))
5794 SET_IDENTIFIER_GLOBAL_VALUE (DECL_ASSEMBLER_NAME (r
), r
);
5796 /* We're not supposed to instantiate default arguments
5797 until they are called, for a template. But, for a
5800 template <class T> void f ()
5801 { extern void g(int i = T()); }
5803 we should do the substitution when the template is
5804 instantiated. We handle the member function case in
5805 instantiate_class_template since the default arguments
5806 might refer to other members of the class. */
5808 && !PRIMARY_TEMPLATE_P (gen_tmpl
)
5809 && !uses_template_parms (argvec
))
5810 tsubst_default_arguments (r
);
5813 /* Copy the list of befriending classes. */
5814 for (friends
= &DECL_BEFRIENDING_CLASSES (r
);
5816 friends
= &TREE_CHAIN (*friends
))
5818 *friends
= copy_node (*friends
);
5819 TREE_VALUE (*friends
) = tsubst (TREE_VALUE (*friends
),
5820 args
, /*complain=*/1,
5824 if (DECL_CONSTRUCTOR_P (r
) || DECL_DESTRUCTOR_P (r
))
5826 maybe_retrofit_in_chrg (r
);
5827 if (DECL_CONSTRUCTOR_P (r
))
5828 grok_ctor_properties (ctx
, r
);
5830 else if (IDENTIFIER_OPNAME_P (DECL_NAME (r
)))
5831 grok_op_properties (r
, DECL_VIRTUAL_P (r
), DECL_FRIEND_P (r
));
5838 TREE_TYPE (r
) = type
;
5839 c_apply_type_quals_to_decl (CP_TYPE_QUALS (type
), r
);
5841 if (TREE_CODE (DECL_INITIAL (r
)) != TEMPLATE_PARM_INDEX
)
5842 DECL_INITIAL (r
) = TREE_TYPE (r
);
5844 DECL_INITIAL (r
) = tsubst (DECL_INITIAL (r
), args
,
5845 /*complain=*/1, in_decl
);
5847 DECL_CONTEXT (r
) = NULL_TREE
;
5848 if (PROMOTE_PROTOTYPES
5849 && (TREE_CODE (type
) == INTEGER_TYPE
5850 || TREE_CODE (type
) == ENUMERAL_TYPE
)
5851 && TYPE_PRECISION (type
) < TYPE_PRECISION (integer_type_node
))
5852 DECL_ARG_TYPE (r
) = integer_type_node
;
5854 TREE_CHAIN (r
) = tsubst (TREE_CHAIN (t
), args
,
5855 /*complain=*/1, TREE_CHAIN (t
));
5862 TREE_TYPE (r
) = type
;
5863 c_apply_type_quals_to_decl (CP_TYPE_QUALS (type
), r
);
5865 /* We don't have to set DECL_CONTEXT here; it is set by
5866 finish_member_declaration. */
5867 DECL_INITIAL (r
) = tsubst_expr (DECL_INITIAL (t
), args
,
5868 /*complain=*/1, in_decl
);
5869 TREE_CHAIN (r
) = NULL_TREE
;
5870 if (TREE_CODE (type
) == VOID_TYPE
)
5871 cp_error_at ("instantiation of `%D' as type void", r
);
5879 = tsubst_copy (DECL_INITIAL (t
), args
, /*complain=*/1, in_decl
);
5880 TREE_CHAIN (r
) = NULL_TREE
;
5885 if (TREE_CODE (type
) == TEMPLATE_TEMPLATE_PARM
5886 || t
== TYPE_MAIN_DECL (TREE_TYPE (t
)))
5888 /* If this is the canonical decl, we don't have to mess with
5889 instantiations, and often we can't (for typename, template
5890 type parms and such). Note that TYPE_NAME is not correct for
5891 the above test if we've copied the type for a typedef. */
5892 r
= TYPE_NAME (type
);
5900 tree argvec
= NULL_TREE
;
5901 tree gen_tmpl
= NULL_TREE
;
5903 tree tmpl
= NULL_TREE
;
5907 /* Assume this is a non-local variable. */
5910 if (TYPE_P (CP_DECL_CONTEXT (t
)))
5911 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
,
5913 in_decl
, /*entering_scope=*/1);
5916 /* Subsequent calls to pushdecl will fill this in. */
5918 if (!DECL_NAMESPACE_SCOPE_P (t
))
5922 /* Check to see if we already have this specialization. */
5925 tmpl
= DECL_TI_TEMPLATE (t
);
5926 gen_tmpl
= most_general_template (tmpl
);
5927 argvec
= tsubst (DECL_TI_ARGS (t
), args
, /*complain=*/1, in_decl
);
5928 spec
= retrieve_specialization (gen_tmpl
, argvec
);
5931 spec
= retrieve_local_specialization (t
);
5940 TREE_TYPE (r
) = type
;
5941 c_apply_type_quals_to_decl (CP_TYPE_QUALS (type
), r
);
5942 DECL_CONTEXT (r
) = ctx
;
5944 /* Don't try to expand the initializer until someone tries to use
5945 this variable; otherwise we run into circular dependencies. */
5946 DECL_INITIAL (r
) = NULL_TREE
;
5948 DECL_SIZE (r
) = DECL_SIZE_UNIT (r
) = 0;
5950 /* For __PRETTY_FUNCTION__ we have to adjust the initializer. */
5951 if (DECL_PRETTY_FUNCTION_P (r
))
5953 DECL_INITIAL (r
) = tsubst (DECL_INITIAL (t
),
5957 TREE_TYPE (r
) = TREE_TYPE (DECL_INITIAL (r
));
5960 /* Even if the original location is out of scope, the newly
5961 substituted one is not. */
5962 if (TREE_CODE (r
) == VAR_DECL
)
5963 DECL_DEAD_FOR_LOCAL (r
) = 0;
5967 /* A static data member declaration is always marked
5968 external when it is declared in-class, even if an
5969 initializer is present. We mimic the non-template
5971 DECL_EXTERNAL (r
) = 1;
5973 register_specialization (r
, gen_tmpl
, argvec
);
5974 DECL_TEMPLATE_INFO (r
) = tree_cons (tmpl
, argvec
, NULL_TREE
);
5975 SET_DECL_IMPLICIT_INSTANTIATION (r
);
5978 register_local_specialization (r
, t
);
5980 TREE_CHAIN (r
) = NULL_TREE
;
5981 if (TREE_CODE (r
) == VAR_DECL
&& TREE_CODE (type
) == VOID_TYPE
)
5982 cp_error_at ("instantiation of `%D' as type void", r
);
5987 my_friendly_abort (0);
5990 /* Restore the file and line information. */
5991 lineno
= saved_lineno
;
5992 input_filename
= saved_filename
;
5997 /* Substitue into the ARG_TYPES of a function type. */
6000 tsubst_arg_types (arg_types
, args
, complain
, in_decl
)
6006 tree remaining_arg_types
;
6009 if (!arg_types
|| arg_types
== void_list_node
)
6012 remaining_arg_types
= tsubst_arg_types (TREE_CHAIN (arg_types
),
6013 args
, complain
, in_decl
);
6014 if (remaining_arg_types
== error_mark_node
)
6015 return error_mark_node
;
6017 type
= tsubst (TREE_VALUE (arg_types
), args
, complain
, in_decl
);
6018 if (type
== error_mark_node
)
6019 return error_mark_node
;
6021 /* Do array-to-pointer, function-to-pointer conversion, and ignore
6022 top-level qualifiers as required. */
6023 type
= TYPE_MAIN_VARIANT (type_decays_to (type
));
6025 /* Note that we do not substitute into default arguments here. The
6026 standard mandates that they be instantiated only when needed,
6027 which is done in build_over_call. */
6028 return hash_tree_cons (TREE_PURPOSE (arg_types
), type
,
6029 remaining_arg_types
);
6033 /* Substitute into a FUNCTION_TYPE or METHOD_TYPE. This routine does
6034 *not* handle the exception-specification for FNTYPE, because the
6035 initial substitution of explicitly provided template parameters
6036 during argument deduction forbids substitution into the
6037 exception-specification:
6041 All references in the function type of the function template to the
6042 corresponding template parameters are replaced by the specified tem-
6043 plate argument values. If a substitution in a template parameter or
6044 in the function type of the function template results in an invalid
6045 type, type deduction fails. [Note: The equivalent substitution in
6046 exception specifications is done only when the function is instanti-
6047 ated, at which point a program is ill-formed if the substitution
6048 results in an invalid type.] */
6051 tsubst_function_type (t
, args
, complain
, in_decl
)
6061 /* The TYPE_CONTEXT is not used for function/method types. */
6062 my_friendly_assert (TYPE_CONTEXT (t
) == NULL_TREE
, 0);
6064 /* Substitue the return type. */
6065 return_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
6066 if (return_type
== error_mark_node
)
6067 return error_mark_node
;
6069 /* Substitue the argument types. */
6070 arg_types
= tsubst_arg_types (TYPE_ARG_TYPES (t
), args
,
6072 if (arg_types
== error_mark_node
)
6073 return error_mark_node
;
6075 /* Construct a new type node and return it. */
6076 if (TREE_CODE (t
) == FUNCTION_TYPE
)
6077 fntype
= build_function_type (return_type
, arg_types
);
6080 tree r
= TREE_TYPE (TREE_VALUE (arg_types
));
6081 if (! IS_AGGR_TYPE (r
))
6085 Type deduction may fail for any of the following
6088 -- Attempting to create "pointer to member of T" when T
6089 is not a class type. */
6091 cp_error ("creating pointer to member function of non-class type `%T'",
6093 return error_mark_node
;
6096 fntype
= build_cplus_method_type (r
, return_type
, TREE_CHAIN
6099 fntype
= build_qualified_type (fntype
, TYPE_QUALS (t
));
6100 fntype
= build_type_attribute_variant (fntype
, TYPE_ATTRIBUTES (t
));
6105 /* Substitute into the PARMS of a call-declarator. */
6108 tsubst_call_declarator_parms (parms
, args
, complain
, in_decl
)
6118 if (!parms
|| parms
== void_list_node
)
6121 new_parms
= tsubst_call_declarator_parms (TREE_CHAIN (parms
),
6122 args
, complain
, in_decl
);
6124 /* Figure out the type of this parameter. */
6125 type
= tsubst (TREE_VALUE (parms
), args
, complain
, in_decl
);
6127 /* Figure out the default argument as well. Note that we use
6128 tsubst_expr since the default argument is really an expression. */
6129 defarg
= tsubst_expr (TREE_PURPOSE (parms
), args
, complain
, in_decl
);
6131 /* Chain this parameter on to the front of those we have already
6132 processed. We don't use hash_tree_cons because that function
6133 doesn't check TREE_PARMLIST. */
6134 new_parms
= tree_cons (defarg
, type
, new_parms
);
6136 /* And note that these are parameters. */
6137 TREE_PARMLIST (new_parms
) = 1;
6142 /* Take the tree structure T and replace template parameters used
6143 therein with the argument vector ARGS. IN_DECL is an associated
6144 decl for diagnostics. If an error occurs, returns ERROR_MARK_NODE.
6145 An appropriate error message is issued only if COMPLAIN is
6146 non-zero. Note that we must be relatively non-tolerant of
6147 extensions here, in order to preserve conformance; if we allow
6148 substitutions that should not be allowed, we may allow argument
6149 deductions that should not succeed, and therefore report ambiguous
6150 overload situations where there are none. In theory, we could
6151 allow the substitution, but indicate that it should have failed,
6152 and allow our caller to make sure that the right thing happens, but
6153 we don't try to do this yet.
6155 This function is used for dealing with types, decls and the like;
6156 for expressions, use tsubst_expr or tsubst_copy. */
6159 tsubst (t
, args
, complain
, in_decl
)
6166 if (t
== NULL_TREE
|| t
== error_mark_node
6167 || t
== integer_type_node
6168 || t
== void_type_node
6169 || t
== char_type_node
6170 || TREE_CODE (t
) == NAMESPACE_DECL
)
6173 if (TREE_CODE (t
) == IDENTIFIER_NODE
)
6174 type
= IDENTIFIER_TYPE_VALUE (t
);
6176 type
= TREE_TYPE (t
);
6177 if (type
== unknown_type_node
)
6178 my_friendly_abort (42);
6180 if (type
&& TREE_CODE (t
) != FUNCTION_DECL
6181 && TREE_CODE (t
) != TYPENAME_TYPE
6182 && TREE_CODE (t
) != TEMPLATE_DECL
6183 && TREE_CODE (t
) != IDENTIFIER_NODE
6184 && TREE_CODE (t
) != FUNCTION_TYPE
6185 && TREE_CODE (t
) != METHOD_TYPE
)
6186 type
= tsubst (type
, args
, complain
, in_decl
);
6187 if (type
== error_mark_node
)
6188 return error_mark_node
;
6191 return tsubst_decl (t
, args
, type
, in_decl
);
6193 switch (TREE_CODE (t
))
6198 return tsubst_aggr_type (t
, args
, complain
, in_decl
,
6199 /*entering_scope=*/0);
6202 case IDENTIFIER_NODE
:
6214 if (t
== integer_type_node
)
6217 if (TREE_CODE (TYPE_MIN_VALUE (t
)) == INTEGER_CST
6218 && TREE_CODE (TYPE_MAX_VALUE (t
)) == INTEGER_CST
)
6222 tree max
, omax
= TREE_OPERAND (TYPE_MAX_VALUE (t
), 0);
6224 max
= tsubst_expr (omax
, args
, complain
, in_decl
);
6225 if (max
== error_mark_node
)
6226 return error_mark_node
;
6228 /* See if we can reduce this expression to something simpler. */
6229 max
= maybe_fold_nontype_arg (max
);
6230 if (!processing_template_decl
)
6231 max
= decl_constant_value (max
);
6233 if (processing_template_decl
6234 /* When providing explicit arguments to a template
6235 function, but leaving some arguments for subsequent
6236 deduction, MAX may be template-dependent even if we're
6237 not PROCESSING_TEMPLATE_DECL. We still need to check for
6238 template parms, though; MAX won't be an INTEGER_CST for
6239 dynamic arrays, either. */
6240 || (TREE_CODE (max
) != INTEGER_CST
6241 && uses_template_parms (max
)))
6243 tree itype
= make_node (INTEGER_TYPE
);
6244 TYPE_MIN_VALUE (itype
) = size_zero_node
;
6245 TYPE_MAX_VALUE (itype
) = build_min (MINUS_EXPR
, sizetype
, max
,
6250 if (integer_zerop (omax
))
6252 /* Still allow an explicit array of size zero. */
6254 pedwarn ("creating array with size zero");
6256 else if (integer_zerop (max
)
6257 || (TREE_CODE (max
) == INTEGER_CST
6258 && INT_CST_LT (max
, integer_zero_node
)))
6262 Type deduction may fail for any of the following
6265 Attempting to create an array with a size that is
6266 zero or negative. */
6268 cp_error ("creating array with size zero (`%E')", max
);
6270 return error_mark_node
;
6273 return compute_array_index_type (NULL_TREE
, max
);
6276 case TEMPLATE_TYPE_PARM
:
6277 case TEMPLATE_TEMPLATE_PARM
:
6278 case TEMPLATE_PARM_INDEX
:
6286 if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
6287 || TREE_CODE (t
) == TEMPLATE_TEMPLATE_PARM
)
6289 idx
= TEMPLATE_TYPE_IDX (t
);
6290 level
= TEMPLATE_TYPE_LEVEL (t
);
6294 idx
= TEMPLATE_PARM_IDX (t
);
6295 level
= TEMPLATE_PARM_LEVEL (t
);
6298 if (TREE_VEC_LENGTH (args
) > 0)
6300 tree arg
= NULL_TREE
;
6302 levels
= TMPL_ARGS_DEPTH (args
);
6303 if (level
<= levels
)
6304 arg
= TMPL_ARG (args
, level
, idx
);
6306 if (arg
== error_mark_node
)
6307 return error_mark_node
;
6308 else if (arg
!= NULL_TREE
)
6310 if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
6312 my_friendly_assert (TYPE_P (arg
), 0);
6313 return cp_build_qualified_type_real
6314 (arg
, CP_TYPE_QUALS (arg
) | CP_TYPE_QUALS (t
),
6317 else if (TREE_CODE (t
) == TEMPLATE_TEMPLATE_PARM
)
6319 if (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t
))
6321 /* We are processing a type constructed from
6322 a template template parameter */
6323 tree argvec
= tsubst (TYPE_TI_ARGS (t
),
6324 args
, complain
, in_decl
);
6325 if (argvec
== error_mark_node
)
6326 return error_mark_node
;
6328 /* We can get a TEMPLATE_TEMPLATE_PARM here when
6329 we are resolving nested-types in the signature of
6330 a member function templates.
6331 Otherwise ARG is a TEMPLATE_DECL and is the real
6332 template to be instantiated. */
6333 if (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
6334 arg
= TYPE_NAME (arg
);
6336 r
= lookup_template_class (arg
,
6339 /*entering_scope=*/0);
6340 return cp_build_qualified_type_real (r
,
6345 /* We are processing a template argument list. */
6353 my_friendly_abort (981018);
6356 /* This can happen during the attempted tsubst'ing in
6357 unify. This means that we don't yet have any information
6358 about the template parameter in question. */
6361 /* If we get here, we must have been looking at a parm for a
6362 more deeply nested template. Make a new version of this
6363 template parameter, but with a lower level. */
6364 switch (TREE_CODE (t
))
6366 case TEMPLATE_TYPE_PARM
:
6367 case TEMPLATE_TEMPLATE_PARM
:
6368 if (CP_TYPE_QUALS (t
))
6370 r
= tsubst (TYPE_MAIN_VARIANT (t
), args
, complain
, in_decl
);
6371 r
= cp_build_qualified_type_real (r
, CP_TYPE_QUALS (t
),
6377 TEMPLATE_TYPE_PARM_INDEX (r
)
6378 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (t
),
6380 TYPE_STUB_DECL (r
) = TYPE_NAME (r
) = TEMPLATE_TYPE_DECL (r
);
6381 TYPE_MAIN_VARIANT (r
) = r
;
6382 TYPE_POINTER_TO (r
) = NULL_TREE
;
6383 TYPE_REFERENCE_TO (r
) = NULL_TREE
;
6385 if (TREE_CODE (t
) == TEMPLATE_TEMPLATE_PARM
6386 && TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t
))
6388 tree argvec
= tsubst (TYPE_TI_ARGS (t
), args
,
6390 if (argvec
== error_mark_node
)
6391 return error_mark_node
;
6393 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (r
)
6394 = tree_cons (TYPE_TI_TEMPLATE (t
), argvec
, NULL_TREE
);
6399 case TEMPLATE_PARM_INDEX
:
6400 r
= reduce_template_parm_level (t
, type
, levels
);
6404 my_friendly_abort (0);
6412 tree purpose
, value
, chain
, result
;
6414 if (t
== void_list_node
)
6417 purpose
= TREE_PURPOSE (t
);
6420 purpose
= tsubst (purpose
, args
, complain
, in_decl
);
6421 if (purpose
== error_mark_node
)
6422 return error_mark_node
;
6424 value
= TREE_VALUE (t
);
6427 value
= tsubst (value
, args
, complain
, in_decl
);
6428 if (value
== error_mark_node
)
6429 return error_mark_node
;
6431 chain
= TREE_CHAIN (t
);
6432 if (chain
&& chain
!= void_type_node
)
6434 chain
= tsubst (chain
, args
, complain
, in_decl
);
6435 if (chain
== error_mark_node
)
6436 return error_mark_node
;
6438 if (purpose
== TREE_PURPOSE (t
)
6439 && value
== TREE_VALUE (t
)
6440 && chain
== TREE_CHAIN (t
))
6442 result
= hash_tree_cons (purpose
, value
, chain
);
6443 TREE_PARMLIST (result
) = TREE_PARMLIST (t
);
6447 if (type
!= NULL_TREE
)
6449 /* A binfo node. We always need to make a copy, of the node
6450 itself and of its BINFO_BASETYPES. */
6454 /* Make sure type isn't a typedef copy. */
6455 type
= BINFO_TYPE (TYPE_BINFO (type
));
6457 TREE_TYPE (t
) = complete_type (type
);
6458 if (IS_AGGR_TYPE (type
))
6460 BINFO_VTABLE (t
) = TYPE_BINFO_VTABLE (type
);
6461 BINFO_VIRTUALS (t
) = TYPE_BINFO_VIRTUALS (type
);
6462 if (TYPE_BINFO_BASETYPES (type
) != NULL_TREE
)
6463 BINFO_BASETYPES (t
) = copy_node (TYPE_BINFO_BASETYPES (type
));
6468 /* Otherwise, a vector of template arguments. */
6469 return tsubst_template_arg_vector (t
, args
, complain
);
6472 case REFERENCE_TYPE
:
6474 enum tree_code code
;
6476 if (type
== TREE_TYPE (t
))
6479 code
= TREE_CODE (t
);
6484 Type deduction may fail for any of the following
6487 -- Attempting to create a pointer to reference type.
6488 -- Attempting to create a reference to a reference type or
6489 a reference to void. */
6490 if (TREE_CODE (type
) == REFERENCE_TYPE
6491 || (code
== REFERENCE_TYPE
&& TREE_CODE (type
) == VOID_TYPE
))
6493 static int last_line
= 0;
6494 static const char* last_file
= 0;
6496 /* We keep track of the last time we issued this error
6497 message to avoid spewing a ton of messages during a
6498 single bad template instantiation. */
6499 if (complain
&& (last_line
!= lineno
||
6500 last_file
!= input_filename
))
6502 if (TREE_CODE (type
) == VOID_TYPE
)
6503 cp_error ("forming reference to void");
6505 cp_error ("forming %s to reference type `%T'",
6506 (code
== POINTER_TYPE
) ? "pointer" : "reference",
6509 last_file
= input_filename
;
6512 return error_mark_node
;
6514 else if (code
== POINTER_TYPE
)
6515 r
= build_pointer_type (type
);
6517 r
= build_reference_type (type
);
6518 r
= cp_build_qualified_type_real (r
, TYPE_QUALS (t
), complain
);
6520 if (r
!= error_mark_node
)
6521 /* Will this ever be needed for TYPE_..._TO values? */
6528 r
= tsubst (TYPE_OFFSET_BASETYPE (t
), args
, complain
, in_decl
);
6529 if (r
== error_mark_node
|| !IS_AGGR_TYPE (r
))
6533 Type deduction may fail for any of the following
6536 -- Attempting to create "pointer to member of T" when T
6537 is not a class type. */
6539 cp_error ("creating pointer to member of non-class type `%T'",
6541 return error_mark_node
;
6543 return build_offset_type (r
, type
);
6551 fntype
= tsubst_function_type (t
, args
, complain
, in_decl
);
6552 if (fntype
== error_mark_node
)
6553 return error_mark_node
;
6555 /* Substitue the exception specification. */
6556 raises
= TYPE_RAISES_EXCEPTIONS (t
);
6559 tree list
= NULL_TREE
;
6561 if (! TREE_VALUE (raises
))
6564 for (; raises
!= NULL_TREE
; raises
= TREE_CHAIN (raises
))
6566 tree spec
= TREE_VALUE (raises
);
6568 spec
= tsubst (spec
, args
, complain
, in_decl
);
6569 if (spec
== error_mark_node
)
6571 list
= add_exception_specifier (list
, spec
, complain
);
6573 fntype
= build_exception_variant (fntype
, list
);
6579 tree domain
= tsubst (TYPE_DOMAIN (t
), args
, complain
, in_decl
);
6580 if (domain
== error_mark_node
)
6581 return error_mark_node
;
6583 /* As an optimization, we avoid regenerating the array type if
6584 it will obviously be the same as T. */
6585 if (type
== TREE_TYPE (t
) && domain
== TYPE_DOMAIN (t
))
6588 /* These checks should match the ones in grokdeclarator.
6592 The deduction may fail for any of the following reasons:
6594 -- Attempting to create an array with an element type that
6595 is void, a function type, or a reference type. */
6596 if (TREE_CODE (type
) == VOID_TYPE
6597 || TREE_CODE (type
) == FUNCTION_TYPE
6598 || TREE_CODE (type
) == REFERENCE_TYPE
)
6601 cp_error ("creating array of `%T'", type
);
6602 return error_mark_node
;
6605 r
= build_cplus_array_type (type
, domain
);
6612 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6614 tree e2
= tsubst (TREE_OPERAND (t
, 1), args
, complain
,
6617 if (e1
== error_mark_node
|| e2
== error_mark_node
)
6618 return error_mark_node
;
6620 return fold (build (TREE_CODE (t
), TREE_TYPE (t
), e1
, e2
));
6626 tree e
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6628 if (e
== error_mark_node
)
6629 return error_mark_node
;
6631 return fold (build (TREE_CODE (t
), TREE_TYPE (t
), e
));
6636 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
6637 in_decl
, /*entering_scope=*/1);
6638 tree f
= tsubst_copy (TYPENAME_TYPE_FULLNAME (t
), args
,
6641 if (ctx
== error_mark_node
|| f
== error_mark_node
)
6642 return error_mark_node
;
6644 if (!IS_AGGR_TYPE (ctx
))
6647 cp_error ("`%T' is not a class, struct, or union type",
6649 return error_mark_node
;
6651 else if (!uses_template_parms (ctx
) && !TYPE_BEING_DEFINED (ctx
))
6653 /* Normally, make_typename_type does not require that the CTX
6654 have complete type in order to allow things like:
6656 template <class T> struct S { typename S<T>::X Y; };
6658 But, such constructs have already been resolved by this
6659 point, so here CTX really should have complete type, unless
6660 it's a partial instantiation. */
6661 ctx
= complete_type (ctx
);
6662 if (!COMPLETE_TYPE_P (ctx
))
6665 incomplete_type_error (NULL_TREE
, ctx
);
6666 return error_mark_node
;
6670 f
= make_typename_type (ctx
, f
, complain
);
6671 if (f
== error_mark_node
)
6673 return cp_build_qualified_type_real (f
,
6675 | CP_TYPE_QUALS (t
),
6681 tree e
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6683 if (e
== error_mark_node
)
6684 return error_mark_node
;
6685 return make_pointer_declarator (type
, e
);
6690 tree e
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6692 if (e
== error_mark_node
)
6693 return error_mark_node
;
6694 return make_reference_declarator (type
, e
);
6699 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6701 tree e2
= tsubst_expr (TREE_OPERAND (t
, 1), args
, complain
,
6703 if (e1
== error_mark_node
|| e2
== error_mark_node
)
6704 return error_mark_node
;
6706 return build_parse_node (ARRAY_REF
, e1
, e2
, tsubst_expr
);
6711 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6713 tree e2
= (tsubst_call_declarator_parms
6714 (CALL_DECLARATOR_PARMS (t
), args
, complain
, in_decl
));
6715 tree e3
= tsubst (CALL_DECLARATOR_EXCEPTION_SPEC (t
), args
,
6718 if (e1
== error_mark_node
|| e2
== error_mark_node
6719 || e3
== error_mark_node
)
6720 return error_mark_node
;
6722 return make_call_declarator (e1
, e2
, CALL_DECLARATOR_QUALS (t
), e3
);
6727 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6729 tree e2
= tsubst (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
6730 if (e1
== error_mark_node
|| e2
== error_mark_node
)
6731 return error_mark_node
;
6733 return build_parse_node (TREE_CODE (t
), e1
, e2
);
6738 tree e1
= tsubst_expr (TYPE_FIELDS (t
), args
, complain
,
6740 if (e1
== error_mark_node
)
6741 return error_mark_node
;
6743 return TREE_TYPE (e1
);
6753 /* This code should match declare_hidden_char_array in
6755 name
= (*decl_printable_name
) (current_function_decl
, 2);
6756 len
= strlen (name
) + 1;
6757 type
= build_array_type (char_type_node
,
6758 build_index_type (build_int_2 (len
, 0)));
6759 str
= build_string (len
, name
);
6760 TREE_TYPE (str
) = type
;
6765 sorry ("use of `%s' in template",
6766 tree_code_name
[(int) TREE_CODE (t
)]);
6767 return error_mark_node
;
6771 /* Like tsubst, but deals with expressions. This function just replaces
6772 template parms; to finish processing the resultant expression, use
6776 tsubst_copy (t
, args
, complain
, in_decl
)
6781 enum tree_code code
;
6784 if (t
== NULL_TREE
|| t
== error_mark_node
)
6787 code
= TREE_CODE (t
);
6792 return do_identifier (DECL_NAME (t
), 0, NULL_TREE
);
6799 if (!DECL_CONTEXT (t
))
6800 /* This is a global enumeration constant. */
6803 /* Unfortunately, we cannot just call lookup_name here.
6806 template <int I> int f() {
6808 struct S { void g() { E e = a; } };
6811 When we instantiate f<7>::S::g(), say, lookup_name is not
6812 clever enough to find f<7>::a. */
6814 = tsubst_aggr_type (TREE_TYPE (t
), args
, complain
, in_decl
,
6815 /*entering_scope=*/0);
6817 for (v
= TYPE_VALUES (enum_type
);
6820 if (TREE_PURPOSE (v
) == DECL_NAME (t
))
6821 return TREE_VALUE (v
);
6823 /* We didn't find the name. That should never happen; if
6824 name-lookup found it during preliminary parsing, we
6825 should find it again here during instantiation. */
6826 my_friendly_abort (0);
6831 if (DECL_CONTEXT (t
))
6835 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
6836 /*entering_scope=*/1);
6837 if (ctx
!= DECL_CONTEXT (t
))
6838 return lookup_field (ctx
, DECL_NAME (t
), 0, 0);
6844 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
))
6845 t
= tsubst (t
, args
, complain
, in_decl
);
6850 if (is_member_template (t
))
6851 return tsubst (t
, args
, complain
, in_decl
);
6857 /* We must tsbust into a LOOKUP_EXPR in case the names to
6858 which it refers is a conversion operator; in that case the
6859 name will change. We avoid making unnecessary copies,
6862 tree id
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
6864 if (id
!= TREE_OPERAND (t
, 0))
6866 r
= build_nt (LOOKUP_EXPR
, id
);
6867 LOOKUP_EXPR_GLOBAL (r
) = LOOKUP_EXPR_GLOBAL (t
);
6875 case REINTERPRET_CAST_EXPR
:
6876 case CONST_CAST_EXPR
:
6877 case STATIC_CAST_EXPR
:
6878 case DYNAMIC_CAST_EXPR
:
6881 (code
, tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
6882 tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
));
6885 case PREDECREMENT_EXPR
:
6886 case PREINCREMENT_EXPR
:
6887 case POSTDECREMENT_EXPR
:
6888 case POSTINCREMENT_EXPR
:
6890 case TRUTH_NOT_EXPR
:
6893 case CONVERT_EXPR
: /* Unary + */
6902 (code
, tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
6903 tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
));
6908 case TRUNC_DIV_EXPR
:
6910 case FLOOR_DIV_EXPR
:
6911 case ROUND_DIV_EXPR
:
6912 case EXACT_DIV_EXPR
:
6914 case BIT_ANDTC_EXPR
:
6917 case TRUNC_MOD_EXPR
:
6918 case FLOOR_MOD_EXPR
:
6919 case TRUTH_ANDIF_EXPR
:
6920 case TRUTH_ORIF_EXPR
:
6921 case TRUTH_AND_EXPR
:
6942 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
6943 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
));
6947 tree fn
= TREE_OPERAND (t
, 0);
6948 if (is_overloaded_fn (fn
))
6949 fn
= tsubst_copy (get_first_fn (fn
), args
, complain
, in_decl
);
6951 /* Sometimes FN is a LOOKUP_EXPR. */
6952 fn
= tsubst_copy (fn
, args
, complain
, in_decl
);
6954 (code
, fn
, tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
,
6959 case METHOD_CALL_EXPR
:
6961 tree name
= TREE_OPERAND (t
, 0);
6962 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
6964 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
6966 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
6968 else if (TREE_CODE (name
) == SCOPE_REF
6969 && TREE_CODE (TREE_OPERAND (name
, 1)) == BIT_NOT_EXPR
)
6971 tree base
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
6973 name
= TREE_OPERAND (name
, 1);
6974 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
6976 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
6977 name
= build_nt (SCOPE_REF
, base
, name
);
6980 name
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
6982 (code
, name
, tsubst_copy (TREE_OPERAND (t
, 1), args
,
6984 tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
),
6989 /* This processing should really occur in tsubst_expr, However,
6990 tsubst_expr does not recurse into expressions, since it
6991 assumes that there aren't any statements inside them.
6992 Instead, it simply calls build_expr_from_tree. So, we need
6993 to expand the STMT_EXPR here. */
6994 if (!processing_template_decl
)
6996 tree stmt_expr
= begin_stmt_expr ();
6997 tsubst_expr (STMT_EXPR_STMT (t
), args
,
6999 return finish_stmt_expr (stmt_expr
);
7006 case PSEUDO_DTOR_EXPR
:
7009 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
7010 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
),
7011 tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
));
7018 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
7019 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
),
7020 tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
));
7021 NEW_EXPR_USE_GLOBAL (r
) = NEW_EXPR_USE_GLOBAL (t
);
7028 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
7029 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
));
7030 DELETE_EXPR_USE_GLOBAL (r
) = DELETE_EXPR_USE_GLOBAL (t
);
7031 DELETE_EXPR_USE_VEC (r
) = DELETE_EXPR_USE_VEC (t
);
7035 case TEMPLATE_ID_EXPR
:
7037 /* Substituted template arguments */
7038 tree targs
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
,
7041 if (targs
&& TREE_CODE (targs
) == TREE_LIST
)
7044 for (chain
= targs
; chain
; chain
= TREE_CHAIN (chain
))
7045 TREE_VALUE (chain
) = maybe_fold_nontype_arg (TREE_VALUE (chain
));
7050 for (i
= 0; i
< TREE_VEC_LENGTH (targs
); ++i
)
7051 TREE_VEC_ELT (targs
, i
)
7052 = maybe_fold_nontype_arg (TREE_VEC_ELT (targs
, i
));
7055 return lookup_template_function
7056 (tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
), targs
);
7061 tree purpose
, value
, chain
;
7063 if (t
== void_list_node
)
7066 purpose
= TREE_PURPOSE (t
);
7068 purpose
= tsubst_copy (purpose
, args
, complain
, in_decl
);
7069 value
= TREE_VALUE (t
);
7071 value
= tsubst_copy (value
, args
, complain
, in_decl
);
7072 chain
= TREE_CHAIN (t
);
7073 if (chain
&& chain
!= void_type_node
)
7074 chain
= tsubst_copy (chain
, args
, complain
, in_decl
);
7075 if (purpose
== TREE_PURPOSE (t
)
7076 && value
== TREE_VALUE (t
)
7077 && chain
== TREE_CHAIN (t
))
7079 return tree_cons (purpose
, value
, chain
);
7086 case TEMPLATE_TYPE_PARM
:
7087 case TEMPLATE_TEMPLATE_PARM
:
7088 case TEMPLATE_PARM_INDEX
:
7090 case REFERENCE_TYPE
:
7097 return tsubst (t
, args
, complain
, in_decl
);
7099 case IDENTIFIER_NODE
:
7100 if (IDENTIFIER_TYPENAME_P (t
))
7102 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
7104 return mangle_conv_op_name_for_type (new_type
);
7106 return (build_typename_overload (new_type
));
7114 (CONSTRUCTOR
, tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
7115 NULL_TREE
, tsubst_copy (CONSTRUCTOR_ELTS (t
), args
,
7116 complain
, in_decl
));
7117 TREE_HAS_CONSTRUCTOR (r
) = TREE_HAS_CONSTRUCTOR (t
);
7122 return build_x_va_arg (tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
,
7124 tsubst (TREE_TYPE (t
), args
, complain
, in_decl
));
7127 return tsubst (t
, args
, complain
, in_decl
);
7134 /* Like tsubst_copy, but also does semantic processing. */
7137 tsubst_expr (t
, args
, complain
, in_decl
)
7144 if (t
== NULL_TREE
|| t
== error_mark_node
)
7147 if (processing_template_decl
)
7148 return tsubst_copy (t
, args
, complain
, in_decl
);
7150 switch (TREE_CODE (t
))
7154 finish_named_return_value
7155 (TREE_OPERAND (t
, 0),
7156 tsubst_expr (TREE_OPERAND (t
, 1), args
, /*complain=*/1, in_decl
));
7157 tsubst_expr (TREE_CHAIN (t
), args
, complain
, in_decl
);
7160 case CTOR_INITIALIZER
:
7162 tree member_init_list
;
7163 tree base_init_list
;
7167 = tsubst_initializer_list (TREE_OPERAND (t
, 0), args
);
7169 = tsubst_initializer_list (TREE_OPERAND (t
, 1), args
);
7170 setup_vtbl_ptr (member_init_list
, base_init_list
);
7171 tsubst_expr (TREE_CHAIN (t
), args
, complain
, in_decl
);
7177 finish_return_stmt (tsubst_expr (RETURN_EXPR (t
),
7178 args
, complain
, in_decl
));
7183 finish_expr_stmt (tsubst_expr (EXPR_STMT_EXPR (t
),
7184 args
, complain
, in_decl
));
7193 decl
= DECL_STMT_DECL (t
);
7194 if (TREE_CODE (decl
) == LABEL_DECL
)
7195 finish_label_decl (DECL_NAME (decl
));
7198 init
= DECL_INITIAL (decl
);
7199 decl
= tsubst (decl
, args
, complain
, in_decl
);
7200 init
= tsubst_expr (init
, args
, complain
, in_decl
);
7202 DECL_INITIAL (decl
) = error_mark_node
;
7203 /* By marking the declaration as instantiated, we avoid
7204 trying to instantiate it. Since instantiate_decl can't
7205 handle local variables, and since we've already done
7206 all that needs to be done, that's the right thing to
7208 if (TREE_CODE (decl
) == VAR_DECL
)
7209 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
7210 maybe_push_decl (decl
);
7211 cp_finish_decl (decl
, init
, NULL_TREE
, 0);
7221 stmt
= begin_for_stmt ();
7222 for (tmp
= FOR_INIT_STMT (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
7223 tsubst_expr (tmp
, args
, complain
, in_decl
);
7224 finish_for_init_stmt (stmt
);
7225 finish_for_cond (tsubst_expr (FOR_COND (t
), args
,
7228 tmp
= tsubst_expr (FOR_EXPR (t
), args
, complain
, in_decl
);
7229 finish_for_expr (tmp
, stmt
);
7230 tsubst_expr (FOR_BODY (t
), args
, complain
, in_decl
);
7231 finish_for_stmt (stmt
);
7238 stmt
= begin_while_stmt ();
7239 finish_while_stmt_cond (tsubst_expr (WHILE_COND (t
),
7240 args
, complain
, in_decl
),
7242 tsubst_expr (WHILE_BODY (t
), args
, complain
, in_decl
);
7243 finish_while_stmt (stmt
);
7250 stmt
= begin_do_stmt ();
7251 tsubst_expr (DO_BODY (t
), args
, complain
, in_decl
);
7252 finish_do_body (stmt
);
7253 finish_do_stmt (tsubst_expr (DO_COND (t
), args
,
7264 stmt
= begin_if_stmt ();
7265 finish_if_stmt_cond (tsubst_expr (IF_COND (t
),
7266 args
, complain
, in_decl
),
7269 if (tmp
= THEN_CLAUSE (t
), tmp
)
7271 tsubst_expr (tmp
, args
, complain
, in_decl
);
7272 finish_then_clause (stmt
);
7275 if (tmp
= ELSE_CLAUSE (t
), tmp
)
7277 begin_else_clause ();
7278 tsubst_expr (tmp
, args
, complain
, in_decl
);
7279 finish_else_clause (stmt
);
7291 stmt
= begin_compound_stmt (COMPOUND_STMT_NO_SCOPE (t
));
7292 for (substmt
= COMPOUND_BODY (t
);
7293 substmt
!= NULL_TREE
;
7294 substmt
= TREE_CHAIN (substmt
))
7295 tsubst_expr (substmt
, args
, complain
, in_decl
);
7296 return finish_compound_stmt (COMPOUND_STMT_NO_SCOPE (t
), stmt
);
7302 finish_break_stmt ();
7307 finish_continue_stmt ();
7315 stmt
= begin_switch_stmt ();
7316 val
= tsubst_expr (SWITCH_COND (t
), args
, complain
, in_decl
);
7317 finish_switch_cond (val
, stmt
);
7318 tsubst_expr (SWITCH_BODY (t
), args
, complain
, in_decl
);
7319 finish_switch_stmt (stmt
);
7325 finish_case_label (tsubst_expr (CASE_LOW (t
), args
, complain
, in_decl
),
7326 tsubst_expr (CASE_HIGH (t
), args
, complain
, in_decl
));
7330 lineno
= STMT_LINENO (t
);
7331 finish_label_stmt (DECL_NAME (LABEL_STMT_LABEL (t
)));
7336 t
= GOTO_DESTINATION (t
);
7337 if (TREE_CODE (t
) != LABEL_DECL
)
7338 /* Computed goto's must be tsubst'd into. On the other hand,
7339 non-computed gotos must not be; the identifier in question
7340 will have no binding. */
7341 t
= tsubst_expr (t
, args
, complain
, in_decl
);
7344 finish_goto_stmt (t
);
7349 finish_asm_stmt (ASM_CV_QUAL (t
),
7350 tsubst_expr (ASM_STRING (t
), args
, complain
, in_decl
),
7351 tsubst_expr (ASM_OUTPUTS (t
), args
, complain
, in_decl
),
7352 tsubst_expr (ASM_INPUTS (t
), args
, complain
, in_decl
),
7353 tsubst_expr (ASM_CLOBBERS (t
), args
, complain
,
7361 stmt
= begin_try_block ();
7362 tsubst_expr (TRY_STMTS (t
), args
, complain
, in_decl
);
7363 finish_cleanup_try_block (stmt
);
7364 finish_cleanup (tsubst_expr (TRY_HANDLERS (t
), args
,
7372 if (FN_TRY_BLOCK_P (t
))
7373 stmt
= begin_function_try_block ();
7375 stmt
= begin_try_block ();
7377 tsubst_expr (TRY_STMTS (t
), args
, complain
, in_decl
);
7379 if (FN_TRY_BLOCK_P (t
))
7380 finish_function_try_block (stmt
);
7382 finish_try_block (stmt
);
7384 handler
= TRY_HANDLERS (t
);
7385 for (; handler
; handler
= TREE_CHAIN (handler
))
7386 tsubst_expr (handler
, args
, complain
, in_decl
);
7387 if (FN_TRY_BLOCK_P (t
))
7388 finish_function_handler_sequence (stmt
);
7390 finish_handler_sequence (stmt
);
7400 stmt
= begin_handler ();
7401 if (HANDLER_PARMS (t
))
7403 decl
= DECL_STMT_DECL (HANDLER_PARMS (t
));
7404 decl
= tsubst (decl
, args
, complain
, in_decl
);
7405 /* Prevent instantiate_decl from trying to instantiate
7406 this variable. We've already done all that needs to be
7408 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
7412 blocks
= finish_handler_parms (decl
, stmt
);
7413 tsubst_expr (HANDLER_BODY (t
), args
, complain
, in_decl
);
7414 finish_handler (blocks
, stmt
);
7421 tsubst (t
, args
, complain
, NULL_TREE
);
7425 return build_expr_from_tree (tsubst_copy (t
, args
, complain
, in_decl
));
7430 /* TMPL is a TEMPLATE_DECL for a cloned constructor or destructor.
7431 Instantiate it with the ARGS. */
7434 instantiate_clone (tmpl
, args
)
7441 /* Instantiated the cloned function, rather than the clone. */
7442 spec
= instantiate_template (DECL_CLONED_FUNCTION (tmpl
), args
);
7444 /* Then, see if we've already cloned the instantiation. */
7445 for (clone
= TREE_CHAIN (spec
);
7446 clone
&& DECL_CLONED_FUNCTION_P (clone
);
7447 clone
= TREE_CHAIN (clone
))
7448 if (DECL_NAME (clone
) == DECL_NAME (tmpl
))
7451 /* If we haven't, do so know. */
7453 clone_function_decl (spec
, /*update_method_vec_p=*/0);
7456 for (clone
= TREE_CHAIN (spec
);
7457 clone
&& DECL_CLONED_FUNCTION_P (clone
);
7458 clone
= TREE_CHAIN (clone
))
7459 if (DECL_NAME (clone
) == DECL_NAME (tmpl
))
7462 /* We should always have found the clone by now. */
7463 my_friendly_abort (20000411);
7467 /* Instantiate the indicated variable or function template TMPL with
7468 the template arguments in TARG_PTR. */
7471 instantiate_template (tmpl
, targ_ptr
)
7472 tree tmpl
, targ_ptr
;
7480 if (tmpl
== error_mark_node
)
7481 return error_mark_node
;
7483 my_friendly_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
, 283);
7485 /* If this function is a clone, handle it specially. */
7486 if (DECL_CLONED_FUNCTION_P (tmpl
))
7487 return instantiate_clone (tmpl
, targ_ptr
);
7489 /* Check to see if we already have this specialization. */
7490 spec
= retrieve_specialization (tmpl
, targ_ptr
);
7491 if (spec
!= NULL_TREE
)
7494 gen_tmpl
= most_general_template (tmpl
);
7495 if (tmpl
!= gen_tmpl
)
7497 /* The TMPL is a partial instantiation. To get a full set of
7498 arguments we must add the arguments used to perform the
7499 partial instantiation. */
7500 targ_ptr
= add_outermost_template_args (DECL_TI_ARGS (tmpl
),
7503 /* Check to see if we already have this specialization. */
7504 spec
= retrieve_specialization (gen_tmpl
, targ_ptr
);
7505 if (spec
!= NULL_TREE
)
7509 len
= DECL_NTPARMS (gen_tmpl
);
7510 inner_args
= INNERMOST_TEMPLATE_ARGS (targ_ptr
);
7514 tree t
= TREE_VEC_ELT (inner_args
, i
);
7517 tree nt
= target_type (t
);
7518 if (IS_AGGR_TYPE (nt
) && decl_function_context (TYPE_MAIN_DECL (nt
)))
7520 cp_error ("type `%T' composed from a local class is not a valid template-argument", t
);
7521 cp_error (" trying to instantiate `%D'", gen_tmpl
);
7522 return error_mark_node
;
7527 /* substitute template parameters */
7528 fndecl
= tsubst (DECL_TEMPLATE_RESULT (gen_tmpl
),
7529 targ_ptr
, /*complain=*/1, gen_tmpl
);
7530 /* The DECL_TI_TEMPLATE should always be the immediate parent
7531 template, not the most general template. */
7532 DECL_TI_TEMPLATE (fndecl
) = tmpl
;
7534 if (flag_external_templates
)
7535 add_pending_template (fndecl
);
7540 /* Push the name of the class template into the scope of the instantiation. */
7543 overload_template_name (type
)
7546 tree id
= DECL_NAME (CLASSTYPE_TI_TEMPLATE (type
));
7549 if (IDENTIFIER_CLASS_VALUE (id
)
7550 && TREE_TYPE (IDENTIFIER_CLASS_VALUE (id
)) == type
)
7553 decl
= build_decl (TYPE_DECL
, id
, type
);
7554 DECL_ARTIFICIAL (decl
) = 1;
7555 pushdecl_class_level (decl
);
7558 /* The FN is a TEMPLATE_DECL for a function. The ARGS are the
7559 arguments that are being used when calling it. TARGS is a vector
7560 into which the deduced template arguments are placed.
7562 Return zero for success, 2 for an incomplete match that doesn't resolve
7563 all the types, and 1 for complete failure. An error message will be
7564 printed only for an incomplete match.
7566 If FN is a conversion operator, RETURN_TYPE is the type desired as
7567 the result of the conversion operator.
7569 TPARMS is a vector of template parameters.
7571 The EXPLICIT_TARGS are explicit template arguments provided via a
7574 The parameter STRICT is one of:
7577 We are deducing arguments for a function call, as in
7581 We are deducing arguments for a conversion function, as in
7585 We are deducing arguments when calculating the partial
7586 ordering between specializations of function or class
7587 templates, as in [temp.func.order] and [temp.class.order],
7588 when doing an explicit instantiation as in [temp.explicit],
7589 when determining an explicit specialization as in
7590 [temp.expl.spec], or when taking the address of a function
7591 template, as in [temp.deduct.funcaddr].
7593 The other arguments are as for type_unification. */
7596 fn_type_unification (fn
, explicit_targs
, targs
, args
, return_type
,
7598 tree fn
, explicit_targs
, targs
, args
, return_type
;
7599 unification_kind_t strict
;
7605 my_friendly_assert (TREE_CODE (fn
) == TEMPLATE_DECL
, 0);
7607 fntype
= TREE_TYPE (fn
);
7612 The specified template arguments must match the template
7613 parameters in kind (i.e., type, nontype, template), and there
7614 must not be more arguments than there are parameters;
7615 otherwise type deduction fails.
7617 Nontype arguments must match the types of the corresponding
7618 nontype template parameters, or must be convertible to the
7619 types of the corresponding nontype parameters as specified in
7620 _temp.arg.nontype_, otherwise type deduction fails.
7622 All references in the function type of the function template
7623 to the corresponding template parameters are replaced by the
7624 specified template argument values. If a substitution in a
7625 template parameter or in the function type of the function
7626 template results in an invalid type, type deduction fails. */
7628 tree converted_args
;
7631 = (coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
7632 explicit_targs
, NULL_TREE
, /*complain=*/0,
7633 /*require_all_arguments=*/0));
7634 if (converted_args
== error_mark_node
)
7637 fntype
= tsubst (fntype
, converted_args
, /*complain=*/0, NULL_TREE
);
7638 if (fntype
== error_mark_node
)
7641 /* Place the explicitly specified arguments in TARGS. */
7642 for (i
= 0; i
< TREE_VEC_LENGTH (targs
); i
++)
7643 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (converted_args
, i
);
7646 parms
= TYPE_ARG_TYPES (fntype
);
7648 if (DECL_CONV_FN_P (fn
))
7650 /* This is a template conversion operator. Remove `this', since
7651 we could be comparing conversions from different classes. */
7652 parms
= TREE_CHAIN (parms
);
7653 args
= TREE_CHAIN (args
);
7654 my_friendly_assert (return_type
!= NULL_TREE
, 20000227);
7659 /* We've been given a return type to match, prepend it. */
7660 parms
= tree_cons (NULL_TREE
, TREE_TYPE (fntype
), parms
);
7661 args
= tree_cons (NULL_TREE
, return_type
, args
);
7664 /* We allow incomplete unification without an error message here
7665 because the standard doesn't seem to explicitly prohibit it. Our
7666 callers must be ready to deal with unification failures in any
7668 result
= type_unification_real (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
7669 targs
, parms
, args
, /*subr=*/0,
7670 strict
, /*allow_incomplete*/1);
7673 /* All is well so far. Now, check:
7677 When all template arguments have been deduced, all uses of
7678 template parameters in nondeduced contexts are replaced with
7679 the corresponding deduced argument values. If the
7680 substitution results in an invalid type, as described above,
7681 type deduction fails. */
7682 if (tsubst (TREE_TYPE (fn
), targs
, /*complain=*/0, NULL_TREE
)
7689 /* Adjust types before performing type deduction, as described in
7690 [temp.deduct.call] and [temp.deduct.conv]. The rules in these two
7691 sections are symmetric. PARM is the type of a function parameter
7692 or the return type of the conversion function. ARG is the type of
7693 the argument passed to the call, or the type of the value
7694 intialized with the result of the conversion function. */
7697 maybe_adjust_types_for_deduction (strict
, parm
, arg
)
7698 unification_kind_t strict
;
7709 /* Swap PARM and ARG throughout the remainder of this
7710 function; the handling is precisely symmetric since PARM
7711 will initialize ARG rather than vice versa. */
7719 /* There is nothing to do in this case. */
7723 my_friendly_abort (0);
7726 if (TREE_CODE (*parm
) != REFERENCE_TYPE
)
7728 /* [temp.deduct.call]
7730 If P is not a reference type:
7732 --If A is an array type, the pointer type produced by the
7733 array-to-pointer standard conversion (_conv.array_) is
7734 used in place of A for type deduction; otherwise,
7736 --If A is a function type, the pointer type produced by
7737 the function-to-pointer standard conversion
7738 (_conv.func_) is used in place of A for type deduction;
7741 --If A is a cv-qualified type, the top level
7742 cv-qualifiers of A's type are ignored for type
7744 if (TREE_CODE (*arg
) == ARRAY_TYPE
)
7745 *arg
= build_pointer_type (TREE_TYPE (*arg
));
7746 else if (TREE_CODE (*arg
) == FUNCTION_TYPE
)
7747 *arg
= build_pointer_type (*arg
);
7749 *arg
= TYPE_MAIN_VARIANT (*arg
);
7752 /* [temp.deduct.call]
7754 If P is a cv-qualified type, the top level cv-qualifiers
7755 of P's type are ignored for type deduction. If P is a
7756 reference type, the type referred to by P is used for
7758 *parm
= TYPE_MAIN_VARIANT (*parm
);
7759 if (TREE_CODE (*parm
) == REFERENCE_TYPE
)
7760 *parm
= TREE_TYPE (*parm
);
7763 /* Like type_unfication.
7765 If SUBR is 1, we're being called recursively (to unify the
7766 arguments of a function or method parameter of a function
7770 type_unification_real (tparms
, targs
, parms
, args
, subr
,
7771 strict
, allow_incomplete
)
7772 tree tparms
, targs
, parms
, args
;
7774 unification_kind_t strict
;
7775 int allow_incomplete
;
7779 int ntparms
= TREE_VEC_LENGTH (tparms
);
7782 my_friendly_assert (TREE_CODE (tparms
) == TREE_VEC
, 289);
7783 my_friendly_assert (parms
== NULL_TREE
7784 || TREE_CODE (parms
) == TREE_LIST
, 290);
7785 /* ARGS could be NULL (via a call from parse.y to
7786 build_x_function_call). */
7788 my_friendly_assert (TREE_CODE (args
) == TREE_LIST
, 291);
7789 my_friendly_assert (ntparms
> 0, 292);
7794 sub_strict
= UNIFY_ALLOW_MORE_CV_QUAL
| UNIFY_ALLOW_DERIVED
;
7798 sub_strict
= UNIFY_ALLOW_LESS_CV_QUAL
;
7802 sub_strict
= UNIFY_ALLOW_NONE
;
7806 my_friendly_abort (0);
7810 && parms
!= void_list_node
7812 && args
!= void_list_node
)
7814 parm
= TREE_VALUE (parms
);
7815 parms
= TREE_CHAIN (parms
);
7816 arg
= TREE_VALUE (args
);
7817 args
= TREE_CHAIN (args
);
7819 if (arg
== error_mark_node
)
7821 if (arg
== unknown_type_node
)
7822 /* We can't deduce anything from this, but we might get all the
7823 template args from other function args. */
7826 /* Conversions will be performed on a function argument that
7827 corresponds with a function parameter that contains only
7828 non-deducible template parameters and explicitly specified
7829 template parameters. */
7830 if (! uses_template_parms (parm
))
7835 type
= TREE_TYPE (arg
);
7842 if (strict
== DEDUCE_EXACT
)
7844 if (same_type_p (parm
, type
))
7848 /* It might work; we shouldn't check now, because we might
7849 get into infinite recursion. Overload resolution will
7858 my_friendly_assert (TREE_TYPE (arg
) != NULL_TREE
, 293);
7859 if (type_unknown_p (arg
))
7861 /* [temp.deduct.type] A template-argument can be deduced from
7862 a pointer to function or pointer to member function
7863 argument if the set of overloaded functions does not
7864 contain function templates and at most one of a set of
7865 overloaded functions provides a unique match. */
7867 if (resolve_overloaded_unification
7868 (tparms
, targs
, parm
, arg
, strict
, sub_strict
)
7873 arg
= TREE_TYPE (arg
);
7877 maybe_adjust_types_for_deduction (strict
, &parm
, &arg
);
7879 switch (unify (tparms
, targs
, parm
, arg
, sub_strict
))
7887 /* Fail if we've reached the end of the parm list, and more args
7888 are present, and the parm list isn't variadic. */
7889 if (args
&& args
!= void_list_node
&& parms
== void_list_node
)
7891 /* Fail if parms are left and they don't have default values. */
7893 && parms
!= void_list_node
7894 && TREE_PURPOSE (parms
) == NULL_TREE
)
7897 for (i
= 0; i
< ntparms
; i
++)
7898 if (TREE_VEC_ELT (targs
, i
) == NULL_TREE
)
7900 if (!allow_incomplete
)
7901 error ("incomplete type unification");
7907 /* Subroutine of type_unification_real. Args are like the variables at the
7908 call site. ARG is an overloaded function (or template-id); we try
7909 deducing template args from each of the overloads, and if only one
7910 succeeds, we go with that. Modifies TARGS and returns 0 on success. */
7913 resolve_overloaded_unification (tparms
, targs
, parm
, arg
, strict
,
7915 tree tparms
, targs
, parm
, arg
;
7916 unification_kind_t strict
;
7919 tree tempargs
= copy_node (targs
);
7922 if (TREE_CODE (arg
) == ADDR_EXPR
)
7923 arg
= TREE_OPERAND (arg
, 0);
7925 if (TREE_CODE (arg
) == COMPONENT_REF
)
7926 /* Handle `&x' where `x' is some static or non-static member
7928 arg
= TREE_OPERAND (arg
, 1);
7930 if (TREE_CODE (arg
) == OFFSET_REF
)
7931 arg
= TREE_OPERAND (arg
, 1);
7933 /* Strip baselink information. */
7934 while (TREE_CODE (arg
) == TREE_LIST
)
7935 arg
= TREE_VALUE (arg
);
7937 if (TREE_CODE (arg
) == TEMPLATE_ID_EXPR
)
7939 /* If we got some explicit template args, we need to plug them into
7940 the affected templates before we try to unify, in case the
7941 explicit args will completely resolve the templates in question. */
7943 tree expl_subargs
= TREE_OPERAND (arg
, 1);
7944 arg
= TREE_OPERAND (arg
, 0);
7946 for (; arg
; arg
= OVL_NEXT (arg
))
7948 tree fn
= OVL_CURRENT (arg
);
7951 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
7954 subargs
= get_bindings_overload (fn
, DECL_TEMPLATE_RESULT (fn
),
7958 elem
= tsubst (TREE_TYPE (fn
), subargs
, /*complain=*/0,
7960 if (TREE_CODE (elem
) == METHOD_TYPE
)
7961 elem
= build_ptrmemfunc_type (build_pointer_type (elem
));
7962 good
+= try_one_overload (tparms
, targs
, tempargs
, parm
, elem
,
7963 strict
, sub_strict
);
7967 else if (TREE_CODE (arg
) == OVERLOAD
)
7969 for (; arg
; arg
= OVL_NEXT (arg
))
7971 tree type
= TREE_TYPE (OVL_CURRENT (arg
));
7972 if (TREE_CODE (type
) == METHOD_TYPE
)
7973 type
= build_ptrmemfunc_type (build_pointer_type (type
));
7974 good
+= try_one_overload (tparms
, targs
, tempargs
, parm
,
7976 strict
, sub_strict
);
7980 my_friendly_abort (981006);
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 we found multiple possibilities, we return success but don't
7992 int i
= TREE_VEC_LENGTH (targs
);
7994 if (TREE_VEC_ELT (tempargs
, i
))
7995 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (tempargs
, i
);
8003 /* Subroutine of resolve_overloaded_unification; does deduction for a single
8004 overload. Fills TARGS with any deduced arguments, or error_mark_node if
8005 different overloads deduce different arguments for a given parm.
8006 Returns 1 on success. */
8009 try_one_overload (tparms
, orig_targs
, targs
, parm
, arg
, strict
,
8011 tree tparms
, orig_targs
, targs
, parm
, arg
;
8012 unification_kind_t strict
;
8019 /* [temp.deduct.type] A template-argument can be deduced from a pointer
8020 to function or pointer to member function argument if the set of
8021 overloaded functions does not contain function templates and at most
8022 one of a set of overloaded functions provides a unique match.
8024 So if this is a template, just return success. */
8026 if (uses_template_parms (arg
))
8029 maybe_adjust_types_for_deduction (strict
, &parm
, &arg
);
8031 /* We don't copy orig_targs for this because if we have already deduced
8032 some template args from previous args, unify would complain when we
8033 try to deduce a template parameter for the same argument, even though
8034 there isn't really a conflict. */
8035 nargs
= TREE_VEC_LENGTH (targs
);
8036 tempargs
= make_tree_vec (nargs
);
8038 if (unify (tparms
, tempargs
, parm
, arg
, sub_strict
) != 0)
8041 /* First make sure we didn't deduce anything that conflicts with
8042 explicitly specified args. */
8043 for (i
= nargs
; i
--; )
8045 tree elt
= TREE_VEC_ELT (tempargs
, i
);
8046 tree oldelt
= TREE_VEC_ELT (orig_targs
, i
);
8048 if (elt
== NULL_TREE
)
8050 else if (uses_template_parms (elt
))
8052 /* Since we're unifying against ourselves, we will fill in template
8053 args used in the function parm list with our own template parms.
8055 TREE_VEC_ELT (tempargs
, i
) = NULL_TREE
;
8058 else if (oldelt
&& ! template_args_equal (oldelt
, elt
))
8062 for (i
= nargs
; i
--; )
8064 tree elt
= TREE_VEC_ELT (tempargs
, i
);
8067 TREE_VEC_ELT (targs
, i
) = elt
;
8073 /* PARM is a template class (perhaps with unbound template
8074 parameters). ARG is a fully instantiated type. If ARG can be
8075 bound to PARM, return ARG, otherwise return NULL_TREE. TPARMS and
8076 TARGS are as for unify. */
8079 try_class_unification (tparms
, targs
, parm
, arg
)
8088 if (!CLASSTYPE_TEMPLATE_INFO (arg
)
8089 || CLASSTYPE_TI_TEMPLATE (arg
) != CLASSTYPE_TI_TEMPLATE (parm
))
8092 /* We need to make a new template argument vector for the call to
8093 unify. If we used TARGS, we'd clutter it up with the result of
8094 the attempted unification, even if this class didn't work out.
8095 We also don't want to commit ourselves to all the unifications
8096 we've already done, since unification is supposed to be done on
8097 an argument-by-argument basis. In other words, consider the
8098 following pathological case:
8100 template <int I, int J, int K>
8103 template <int I, int J>
8104 struct S<I, J, 2> : public S<I, I, I>, S<J, J, J> {};
8106 template <int I, int J, int K>
8107 void f(S<I, J, K>, S<I, I, I>);
8116 Now, by the time we consider the unification involving `s2', we
8117 already know that we must have `f<0, 0, 0>'. But, even though
8118 `S<0, 1, 2>' is derived from `S<0, 0, 0>', the code is not legal
8119 because there are two ways to unify base classes of S<0, 1, 2>
8120 with S<I, I, I>. If we kept the already deduced knowledge, we
8121 would reject the possibility I=1. */
8122 copy_of_targs
= make_tree_vec (TREE_VEC_LENGTH (targs
));
8123 i
= unify (tparms
, copy_of_targs
, CLASSTYPE_TI_ARGS (parm
),
8124 CLASSTYPE_TI_ARGS (arg
), UNIFY_ALLOW_NONE
);
8126 /* If unification failed, we're done. */
8133 /* Subroutine of get_template_base. RVAL, if non-NULL, is a base we
8134 have alreay discovered to be satisfactory. ARG_BINFO is the binfo
8135 for the base class of ARG that we are currently examining. */
8138 get_template_base_recursive (tparms
, targs
, parm
,
8139 arg_binfo
, rval
, flags
)
8149 tree arg
= BINFO_TYPE (arg_binfo
);
8151 if (!(flags
& GTB_IGNORE_TYPE
))
8153 tree r
= try_class_unification (tparms
, targs
,
8156 /* If there is more than one satisfactory baseclass, then:
8160 If they yield more than one possible deduced A, the type
8164 if (r
&& rval
&& !same_type_p (r
, rval
))
8165 return error_mark_node
;
8170 binfos
= BINFO_BASETYPES (arg_binfo
);
8171 n_baselinks
= binfos
? TREE_VEC_LENGTH (binfos
) : 0;
8173 /* Process base types. */
8174 for (i
= 0; i
< n_baselinks
; i
++)
8176 tree base_binfo
= TREE_VEC_ELT (binfos
, i
);
8179 /* Skip this base, if we've already seen it. */
8180 if (BINFO_MARKED (base_binfo
))
8184 (flags
& GTB_VIA_VIRTUAL
) || TREE_VIA_VIRTUAL (base_binfo
);
8186 /* When searching for a non-virtual, we cannot mark virtually
8189 SET_BINFO_MARKED (base_binfo
);
8191 rval
= get_template_base_recursive (tparms
, targs
,
8195 GTB_VIA_VIRTUAL
* this_virtual
);
8197 /* If we discovered more than one matching base class, we can
8199 if (rval
== error_mark_node
)
8200 return error_mark_node
;
8206 /* Given a template type PARM and a class type ARG, find the unique
8207 base type in ARG that is an instance of PARM. We do not examine
8208 ARG itself; only its base-classes. If there is no appropriate base
8209 class, return NULL_TREE. If there is more than one, return
8210 error_mark_node. PARM may be the type of a partial specialization,
8211 as well as a plain template type. Used by unify. */
8214 get_template_base (tparms
, targs
, parm
, arg
)
8223 my_friendly_assert (IS_AGGR_TYPE_CODE (TREE_CODE (arg
)), 92);
8225 arg_binfo
= TYPE_BINFO (complete_type (arg
));
8226 rval
= get_template_base_recursive (tparms
, targs
,
8231 /* Since get_template_base_recursive marks the bases classes, we
8232 must unmark them here. */
8233 dfs_walk (arg_binfo
, dfs_unmark
, markedp
, 0);
8238 /* Returns the level of DECL, which declares a template parameter. */
8241 template_decl_level (decl
)
8244 switch (TREE_CODE (decl
))
8248 return TEMPLATE_TYPE_LEVEL (TREE_TYPE (decl
));
8251 return TEMPLATE_PARM_LEVEL (DECL_INITIAL (decl
));
8254 my_friendly_abort (0);
8259 /* Decide whether ARG can be unified with PARM, considering only the
8260 cv-qualifiers of each type, given STRICT as documented for unify.
8261 Returns non-zero iff the unification is OK on that basis.*/
8264 check_cv_quals_for_unify (strict
, arg
, parm
)
8269 if (!(strict
& UNIFY_ALLOW_MORE_CV_QUAL
)
8270 && !at_least_as_qualified_p (arg
, parm
))
8273 if (!(strict
& UNIFY_ALLOW_LESS_CV_QUAL
)
8274 && !at_least_as_qualified_p (parm
, arg
))
8280 /* Takes parameters as for type_unification. Returns 0 if the
8281 type deduction suceeds, 1 otherwise. The parameter STRICT is a
8282 bitwise or of the following flags:
8285 Require an exact match between PARM and ARG.
8286 UNIFY_ALLOW_MORE_CV_QUAL:
8287 Allow the deduced ARG to be more cv-qualified than ARG.
8288 UNIFY_ALLOW_LESS_CV_QUAL:
8289 Allow the deduced ARG to be less cv-qualified than ARG.
8290 UNIFY_ALLOW_DERIVED:
8291 Allow the deduced ARG to be a template base class of ARG,
8292 or a pointer to a template base class of the type pointed to by
8294 UNIFY_ALLOW_INTEGER:
8295 Allow any integral type to be deduced. See the TEMPLATE_PARM_INDEX
8296 case for more information. */
8299 unify (tparms
, targs
, parm
, arg
, strict
)
8300 tree tparms
, targs
, parm
, arg
;
8307 /* I don't think this will do the right thing with respect to types.
8308 But the only case I've seen it in so far has been array bounds, where
8309 signedness is the only information lost, and I think that will be
8311 while (TREE_CODE (parm
) == NOP_EXPR
)
8312 parm
= TREE_OPERAND (parm
, 0);
8314 if (arg
== error_mark_node
)
8316 if (arg
== unknown_type_node
)
8317 /* We can't deduce anything from this, but we might get all the
8318 template args from other function args. */
8321 /* If PARM uses template parameters, then we can't bail out here,
8322 even if ARG == PARM, since we won't record unifications for the
8323 template parameters. We might need them if we're trying to
8324 figure out which of two things is more specialized. */
8325 if (arg
== parm
&& !uses_template_parms (parm
))
8328 /* Immediately reject some pairs that won't unify because of
8329 cv-qualification mismatches. */
8330 if (TREE_CODE (arg
) == TREE_CODE (parm
)
8332 /* We check the cv-qualifiers when unifying with template type
8333 parameters below. We want to allow ARG `const T' to unify with
8334 PARM `T' for example, when computing which of two templates
8335 is more specialized, for example. */
8336 && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
8337 && !check_cv_quals_for_unify (strict
, arg
, parm
))
8340 switch (TREE_CODE (parm
))
8343 /* In a type which contains a nested-name-specifier, template
8344 argument values cannot be deduced for template parameters used
8345 within the nested-name-specifier. */
8348 case TEMPLATE_TYPE_PARM
:
8349 case TEMPLATE_TEMPLATE_PARM
:
8350 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
8352 if (TEMPLATE_TYPE_LEVEL (parm
)
8353 != template_decl_level (tparm
))
8354 /* The PARM is not one we're trying to unify. Just check
8355 to see if it matches ARG. */
8356 return (TREE_CODE (arg
) == TREE_CODE (parm
)
8357 && same_type_p (parm
, arg
)) ? 0 : 1;
8358 idx
= TEMPLATE_TYPE_IDX (parm
);
8359 targ
= TREE_VEC_ELT (targs
, idx
);
8360 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, idx
));
8362 /* Check for mixed types and values. */
8363 if ((TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
8364 && TREE_CODE (tparm
) != TYPE_DECL
)
8365 || (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
8366 && TREE_CODE (tparm
) != TEMPLATE_DECL
))
8369 if (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
)
8371 if (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (parm
))
8373 /* We arrive here when PARM does not involve template
8376 /* ARG must be constructed from a template class. */
8377 if (TREE_CODE (arg
) != RECORD_TYPE
|| !CLASSTYPE_TEMPLATE_INFO (arg
))
8381 tree parmtmpl
= TYPE_TI_TEMPLATE (parm
);
8382 tree parmvec
= TYPE_TI_ARGS (parm
);
8383 tree argvec
= CLASSTYPE_TI_ARGS (arg
);
8385 = DECL_INNERMOST_TEMPLATE_PARMS (CLASSTYPE_TI_TEMPLATE (arg
));
8388 /* The parameter and argument roles have to be switched here
8389 in order to handle default arguments properly. For example,
8390 template<template <class> class TT> void f(TT<int>)
8391 should be able to accept vector<int> which comes from
8392 template <class T, class Allocator = allocator>
8395 if (coerce_template_parms (argtmplvec
, parmvec
, parmtmpl
, 0, 1)
8399 /* Deduce arguments T, i from TT<T> or TT<i>.
8400 We check each element of PARMVEC and ARGVEC individually
8401 rather than the whole TREE_VEC since they can have
8402 different number of elements. */
8404 for (i
= 0; i
< TREE_VEC_LENGTH (parmvec
); ++i
)
8406 tree t
= TREE_VEC_ELT (parmvec
, i
);
8408 if (unify (tparms
, targs
, t
,
8409 TREE_VEC_ELT (argvec
, i
),
8414 arg
= CLASSTYPE_TI_TEMPLATE (arg
);
8419 /* If PARM is `const T' and ARG is only `int', we don't have
8420 a match unless we are allowing additional qualification.
8421 If ARG is `const int' and PARM is just `T' that's OK;
8422 that binds `const int' to `T'. */
8423 if (!check_cv_quals_for_unify (strict
| UNIFY_ALLOW_LESS_CV_QUAL
,
8427 /* Consider the case where ARG is `const volatile int' and
8428 PARM is `const T'. Then, T should be `volatile int'. */
8430 cp_build_qualified_type_real (arg
,
8432 & ~CP_TYPE_QUALS (parm
),
8434 if (arg
== error_mark_node
)
8438 /* Simple cases: Value already set, does match or doesn't. */
8439 if (targ
!= NULL_TREE
&& same_type_p (targ
, arg
))
8444 /* Make sure that ARG is not a variable-sized array. (Note that
8445 were talking about variable-sized arrays (like `int[n]'),
8446 rather than arrays of unknown size (like `int[]').) We'll
8447 get very confused by such a type since the bound of the array
8448 will not be computable in an instantiation. Besides, such
8449 types are not allowed in ISO C++, so we can do as we please
8451 if (TREE_CODE (arg
) == ARRAY_TYPE
8452 && !uses_template_parms (arg
)
8453 && (TREE_CODE (TYPE_MAX_VALUE (TYPE_DOMAIN (arg
)))
8457 TREE_VEC_ELT (targs
, idx
) = arg
;
8460 case TEMPLATE_PARM_INDEX
:
8461 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
8463 if (TEMPLATE_PARM_LEVEL (parm
)
8464 != template_decl_level (tparm
))
8465 /* The PARM is not one we're trying to unify. Just check
8466 to see if it matches ARG. */
8467 return (TREE_CODE (arg
) == TREE_CODE (parm
)
8468 && cp_tree_equal (parm
, arg
) > 0) ? 0 : 1;
8470 idx
= TEMPLATE_PARM_IDX (parm
);
8471 targ
= TREE_VEC_ELT (targs
, idx
);
8475 int i
= (cp_tree_equal (targ
, arg
) > 0);
8481 my_friendly_abort (42);
8484 /* [temp.deduct.type] If, in the declaration of a function template
8485 with a non-type template-parameter, the non-type
8486 template-parameter is used in an expression in the function
8487 parameter-list and, if the corresponding template-argument is
8488 deduced, the template-argument type shall match the type of the
8489 template-parameter exactly, except that a template-argument
8490 deduced from an array bound may be of any integral type. */
8491 if (same_type_p (TREE_TYPE (arg
), TREE_TYPE (parm
)))
8493 else if ((strict
& UNIFY_ALLOW_INTEGER
)
8494 && (TREE_CODE (TREE_TYPE (parm
)) == INTEGER_TYPE
8495 || TREE_CODE (TREE_TYPE (parm
)) == BOOLEAN_TYPE
))
8500 TREE_VEC_ELT (targs
, idx
) = arg
;
8507 if (TREE_CODE (arg
) != POINTER_TYPE
)
8510 /* [temp.deduct.call]
8512 A can be another pointer or pointer to member type that can
8513 be converted to the deduced A via a qualification
8514 conversion (_conv.qual_).
8516 We pass down STRICT here rather than UNIFY_ALLOW_NONE.
8517 This will allow for additional cv-qualification of the
8518 pointed-to types if appropriate. In general, this is a bit
8519 too generous; we are only supposed to allow qualification
8520 conversions and this method will allow an ARG of char** and
8521 a deduced ARG of const char**. However, overload
8522 resolution will subsequently invalidate the candidate, so
8523 this is probably OK. */
8524 sub_strict
= strict
;
8526 if (TREE_CODE (TREE_TYPE (arg
)) != RECORD_TYPE
)
8527 /* The derived-to-base conversion only persists through one
8528 level of pointers. */
8529 sub_strict
&= ~UNIFY_ALLOW_DERIVED
;
8531 return unify (tparms
, targs
, TREE_TYPE (parm
),
8532 TREE_TYPE (arg
), sub_strict
);
8535 case REFERENCE_TYPE
:
8536 if (TREE_CODE (arg
) != REFERENCE_TYPE
)
8538 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
8542 if (TREE_CODE (arg
) != ARRAY_TYPE
)
8544 if ((TYPE_DOMAIN (parm
) == NULL_TREE
)
8545 != (TYPE_DOMAIN (arg
) == NULL_TREE
))
8547 if (TYPE_DOMAIN (parm
) != NULL_TREE
8548 && unify (tparms
, targs
, TYPE_DOMAIN (parm
),
8549 TYPE_DOMAIN (arg
), UNIFY_ALLOW_NONE
) != 0)
8551 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
8559 if (TREE_CODE (arg
) != TREE_CODE (parm
))
8562 if (TREE_CODE (parm
) == INTEGER_TYPE
8563 && TREE_CODE (TYPE_MAX_VALUE (parm
)) != INTEGER_CST
)
8565 if (TYPE_MIN_VALUE (parm
) && TYPE_MIN_VALUE (arg
)
8566 && unify (tparms
, targs
, TYPE_MIN_VALUE (parm
),
8567 TYPE_MIN_VALUE (arg
), UNIFY_ALLOW_INTEGER
))
8569 if (TYPE_MAX_VALUE (parm
) && TYPE_MAX_VALUE (arg
)
8570 && unify (tparms
, targs
, TYPE_MAX_VALUE (parm
),
8571 TYPE_MAX_VALUE (arg
), UNIFY_ALLOW_INTEGER
))
8574 /* We have already checked cv-qualification at the top of the
8576 else if (!same_type_ignoring_top_level_qualifiers_p (arg
, parm
))
8579 /* As far as unification is concerned, this wins. Later checks
8580 will invalidate it if necessary. */
8583 /* Types INTEGER_CST and MINUS_EXPR can come from array bounds. */
8584 /* Type INTEGER_CST can come from ordinary constant template args. */
8586 while (TREE_CODE (arg
) == NOP_EXPR
)
8587 arg
= TREE_OPERAND (arg
, 0);
8589 if (TREE_CODE (arg
) != INTEGER_CST
)
8591 return !tree_int_cst_equal (parm
, arg
);
8596 if (TREE_CODE (arg
) != TREE_VEC
)
8598 if (TREE_VEC_LENGTH (parm
) != TREE_VEC_LENGTH (arg
))
8600 for (i
= 0; i
< TREE_VEC_LENGTH (parm
); ++i
)
8601 if (unify (tparms
, targs
,
8602 TREE_VEC_ELT (parm
, i
), TREE_VEC_ELT (arg
, i
),
8610 if (TREE_CODE (arg
) != TREE_CODE (parm
))
8613 if (TYPE_PTRMEMFUNC_P (parm
))
8615 if (!TYPE_PTRMEMFUNC_P (arg
))
8618 return unify (tparms
, targs
,
8619 TYPE_PTRMEMFUNC_FN_TYPE (parm
),
8620 TYPE_PTRMEMFUNC_FN_TYPE (arg
),
8624 if (CLASSTYPE_TEMPLATE_INFO (parm
))
8628 if (strict
& UNIFY_ALLOW_DERIVED
)
8630 /* First, we try to unify the PARM and ARG directly. */
8631 t
= try_class_unification (tparms
, targs
,
8636 /* Fallback to the special case allowed in
8639 If P is a class, and P has the form
8640 template-id, then A can be a derived class of
8641 the deduced A. Likewise, if P is a pointer to
8642 a class of the form template-id, A can be a
8643 pointer to a derived class pointed to by the
8645 t
= get_template_base (tparms
, targs
,
8648 if (! t
|| t
== error_mark_node
)
8652 else if (CLASSTYPE_TEMPLATE_INFO (arg
)
8653 && (CLASSTYPE_TI_TEMPLATE (parm
)
8654 == CLASSTYPE_TI_TEMPLATE (arg
)))
8655 /* Perhaps PARM is something like S<U> and ARG is S<int>.
8656 Then, we should unify `int' and `U'. */
8659 /* There's no chance of unication succeeding. */
8662 return unify (tparms
, targs
, CLASSTYPE_TI_ARGS (parm
),
8663 CLASSTYPE_TI_ARGS (t
), UNIFY_ALLOW_NONE
);
8665 else if (!same_type_ignoring_top_level_qualifiers_p (parm
, arg
))
8671 if (TREE_CODE (arg
) != TREE_CODE (parm
))
8674 if (unify (tparms
, targs
, TREE_TYPE (parm
),
8675 TREE_TYPE (arg
), UNIFY_ALLOW_NONE
))
8677 return type_unification_real (tparms
, targs
, TYPE_ARG_TYPES (parm
),
8678 TYPE_ARG_TYPES (arg
), 1,
8682 if (TREE_CODE (arg
) != OFFSET_TYPE
)
8684 if (unify (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
8685 TYPE_OFFSET_BASETYPE (arg
), UNIFY_ALLOW_NONE
))
8687 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
8691 if (arg
!= decl_constant_value (parm
))
8696 /* Matched cases are handled by the ARG == PARM test above. */
8700 if (TREE_CODE (TREE_OPERAND (parm
, 1)) == INTEGER_CST
)
8702 /* We handle this case specially, since it comes up with
8703 arrays. In particular, something like:
8705 template <int N> void f(int (&x)[N]);
8707 Here, we are trying to unify the range type, which
8708 looks like [0 ... (N - 1)]. */
8710 t1
= TREE_OPERAND (parm
, 0);
8711 t2
= TREE_OPERAND (parm
, 1);
8713 t
= fold (build (PLUS_EXPR
, integer_type_node
, arg
, t2
));
8715 return unify (tparms
, targs
, t1
, t
, strict
);
8717 /* else fall through */
8720 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (parm
))))
8721 /* We're looking at an expression. This can happen with
8725 void foo(S<I>, S<I + 2>);
8727 This is a "nondeduced context":
8731 The nondeduced contexts are:
8733 --A type that is a template-id in which one or more of
8734 the template-arguments is an expression that references
8735 a template-parameter.
8737 In these cases, we assume deduction succeeded, but don't
8738 actually infer any unifications. */
8741 sorry ("use of `%s' in template type unification",
8742 tree_code_name
[(int) TREE_CODE (parm
)]);
8748 /* Called if RESULT is explicitly instantiated, or is a member of an
8749 explicitly instantiated class, or if using -frepo and the
8750 instantiation of RESULT has been assigned to this file. */
8753 mark_decl_instantiated (result
, extern_p
)
8757 if (TREE_CODE (result
) != FUNCTION_DECL
)
8758 /* The TREE_PUBLIC flag for function declarations will have been
8759 set correctly by tsubst. */
8760 TREE_PUBLIC (result
) = 1;
8762 /* We used to set this unconditionally; we moved that to
8763 do_decl_instantiation so it wouldn't get set on members of
8764 explicit class template instantiations. But we still need to set
8765 it here for the 'extern template' case in order to suppress
8766 implicit instantiations. */
8768 SET_DECL_EXPLICIT_INSTANTIATION (result
);
8772 DECL_INTERFACE_KNOWN (result
) = 1;
8773 DECL_NOT_REALLY_EXTERN (result
) = 1;
8775 /* Always make artificials weak. */
8776 if (DECL_ARTIFICIAL (result
) && flag_weak
)
8777 comdat_linkage (result
);
8778 /* For WIN32 we also want to put explicit instantiations in
8779 linkonce sections. */
8780 else if (TREE_PUBLIC (result
))
8781 maybe_make_one_only (result
);
8783 else if (TREE_CODE (result
) == FUNCTION_DECL
)
8787 /* Given two function templates PAT1 and PAT2, and explicit template
8788 arguments EXPLICIT_ARGS return:
8790 1 if PAT1 is more specialized than PAT2 as described in [temp.func.order].
8791 -1 if PAT2 is more specialized than PAT1.
8792 0 if neither is more specialized. */
8795 more_specialized (pat1
, pat2
, explicit_args
)
8796 tree pat1
, pat2
, explicit_args
;
8802 = get_bindings_overload (pat1
, DECL_TEMPLATE_RESULT (pat2
), explicit_args
);
8807 = get_bindings_overload (pat2
, DECL_TEMPLATE_RESULT (pat1
), explicit_args
);
8814 /* Given two class template specialization list nodes PAT1 and PAT2, return:
8816 1 if PAT1 is more specialized than PAT2 as described in [temp.class.order].
8817 -1 if PAT2 is more specialized than PAT1.
8818 0 if neither is more specialized. */
8821 more_specialized_class (pat1
, pat2
)
8827 targs
= get_class_bindings (TREE_VALUE (pat1
), TREE_PURPOSE (pat1
),
8828 TREE_PURPOSE (pat2
));
8832 targs
= get_class_bindings (TREE_VALUE (pat2
), TREE_PURPOSE (pat2
),
8833 TREE_PURPOSE (pat1
));
8840 /* Return the template arguments that will produce the function signature
8841 DECL from the function template FN, with the explicit template
8842 arguments EXPLICIT_ARGS. If CHECK_RETTYPE is 1, the return type must
8843 also match. Return NULL_TREE if no satisfactory arguments could be
8847 get_bindings_real (fn
, decl
, explicit_args
, check_rettype
)
8848 tree fn
, decl
, explicit_args
;
8851 int ntparms
= DECL_NTPARMS (fn
);
8852 tree targs
= make_tree_vec (ntparms
);
8854 tree decl_arg_types
;
8857 /* Substitute the explicit template arguments into the type of DECL.
8858 The call to fn_type_unification will handle substitution into the
8860 decl_type
= TREE_TYPE (decl
);
8861 if (explicit_args
&& uses_template_parms (decl_type
))
8864 tree converted_args
;
8866 if (DECL_TEMPLATE_INFO (decl
))
8867 tmpl
= DECL_TI_TEMPLATE (decl
);
8869 /* We can get here for some illegal specializations. */
8873 = (coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
8874 explicit_args
, NULL_TREE
,
8876 /*require_all_arguments=*/0));
8877 if (converted_args
== error_mark_node
)
8880 decl_type
= tsubst (decl_type
, converted_args
, /*complain=*/0,
8882 if (decl_type
== error_mark_node
)
8886 /* If FN is a static member function, adjust the type of DECL
8888 decl_arg_types
= TYPE_ARG_TYPES (decl_type
);
8889 if (DECL_STATIC_FUNCTION_P (fn
)
8890 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
8891 decl_arg_types
= TREE_CHAIN (decl_arg_types
);
8893 i
= fn_type_unification (fn
, explicit_args
, targs
,
8895 (check_rettype
|| DECL_CONV_FN_P (fn
)
8896 ? TREE_TYPE (decl_type
) : NULL_TREE
),
8905 /* For most uses, we want to check the return type. */
8908 get_bindings (fn
, decl
, explicit_args
)
8909 tree fn
, decl
, explicit_args
;
8911 return get_bindings_real (fn
, decl
, explicit_args
, 1);
8914 /* But for more_specialized, we only care about the parameter types. */
8917 get_bindings_overload (fn
, decl
, explicit_args
)
8918 tree fn
, decl
, explicit_args
;
8920 return get_bindings_real (fn
, decl
, explicit_args
, 0);
8923 /* Return the innermost template arguments that, when applied to a
8924 template specialization whose innermost template parameters are
8925 TPARMS, and whose specialization arguments are ARGS, yield the
8928 For example, suppose we have:
8930 template <class T, class U> struct S {};
8931 template <class T> struct S<T*, int> {};
8933 Then, suppose we want to get `S<double*, int>'. The TPARMS will be
8934 {T}, the PARMS will be {T*, int} and the ARGS will be {double*,
8935 int}. The resulting vector will be {double}, indicating that `T'
8936 is bound to `double'. */
8939 get_class_bindings (tparms
, parms
, args
)
8940 tree tparms
, parms
, args
;
8942 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
8943 tree vec
= make_tree_vec (ntparms
);
8945 args
= INNERMOST_TEMPLATE_ARGS (args
);
8947 if (unify (tparms
, vec
, parms
, args
, UNIFY_ALLOW_NONE
))
8950 for (i
= 0; i
< ntparms
; ++i
)
8951 if (! TREE_VEC_ELT (vec
, i
))
8957 /* In INSTANTIATIONS is a list of <INSTANTIATION, TEMPLATE> pairs.
8958 Pick the most specialized template, and return the corresponding
8959 instantiation, or if there is no corresponding instantiation, the
8960 template itself. EXPLICIT_ARGS is any template arguments explicity
8961 mentioned in a template-id. If there is no most specialized
8962 template, error_mark_node is returned. If there are no templates
8963 at all, NULL_TREE is returned. */
8966 most_specialized_instantiation (instantiations
, explicit_args
)
8967 tree instantiations
;
8973 if (!instantiations
)
8976 champ
= instantiations
;
8977 for (fn
= TREE_CHAIN (instantiations
); fn
; fn
= TREE_CHAIN (fn
))
8979 fate
= more_specialized (TREE_VALUE (champ
),
8980 TREE_VALUE (fn
), explicit_args
);
8987 fn
= TREE_CHAIN (fn
);
8989 return error_mark_node
;
8995 for (fn
= instantiations
; fn
&& fn
!= champ
; fn
= TREE_CHAIN (fn
))
8997 fate
= more_specialized (TREE_VALUE (champ
),
8998 TREE_VALUE (fn
), explicit_args
);
9000 return error_mark_node
;
9003 return TREE_PURPOSE (champ
) ? TREE_PURPOSE (champ
) : TREE_VALUE (champ
);
9006 /* Return the most specialized of the list of templates in FNS that can
9007 produce an instantiation matching DECL, given the explicit template
9008 arguments EXPLICIT_ARGS. */
9011 most_specialized (fns
, decl
, explicit_args
)
9012 tree fns
, decl
, explicit_args
;
9014 tree candidates
= NULL_TREE
;
9017 for (fn
= fns
; fn
; fn
= TREE_CHAIN (fn
))
9019 tree candidate
= TREE_VALUE (fn
);
9021 args
= get_bindings (candidate
, decl
, explicit_args
);
9023 candidates
= tree_cons (NULL_TREE
, candidate
, candidates
);
9026 return most_specialized_instantiation (candidates
, explicit_args
);
9029 /* If DECL is a specialization of some template, return the most
9030 general such template. Otherwise, returns NULL_TREE.
9034 template <class T> struct S { template <class U> void f(U); };
9036 if TMPL is `template <class U> void S<int>::f(U)' this will return
9037 the full template. This function will not trace past partial
9038 specializations, however. For example, given in addition:
9040 template <class T> struct S<T*> { template <class U> void f(U); };
9042 if TMPL is `template <class U> void S<int*>::f(U)' this will return
9043 `template <class T> template <class U> S<T*>::f(U)'. */
9046 most_general_template (decl
)
9049 /* If DECL is a FUNCTION_DECL, find the TEMPLATE_DECL of which it is
9050 an immediate specialization. */
9051 if (TREE_CODE (decl
) == FUNCTION_DECL
)
9053 if (DECL_TEMPLATE_INFO (decl
)) {
9054 decl
= DECL_TI_TEMPLATE (decl
);
9056 /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE for a
9058 if (TREE_CODE (decl
) != TEMPLATE_DECL
)
9064 /* Look for more and more general templates. */
9065 while (DECL_TEMPLATE_INFO (decl
))
9067 /* The DECL_TI_TEMPLATE can be a LOOKUP_EXPR or IDENTIFIER_NODE
9068 in some cases. (See cp-tree.h for details.) */
9069 if (TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
9072 /* Stop if we run into an explicitly specialized class template. */
9073 if (!DECL_NAMESPACE_SCOPE_P (decl
)
9074 && DECL_CONTEXT (decl
)
9075 && CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (decl
)))
9078 decl
= DECL_TI_TEMPLATE (decl
);
9084 /* Return the most specialized of the class template specializations
9085 of TMPL which can produce an instantiation matching ARGS, or
9086 error_mark_node if the choice is ambiguous. */
9089 most_specialized_class (tmpl
, args
)
9093 tree list
= NULL_TREE
;
9098 tmpl
= most_general_template (tmpl
);
9099 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
); t
; t
= TREE_CHAIN (t
))
9102 = get_class_bindings (TREE_VALUE (t
), TREE_PURPOSE (t
), args
);
9105 list
= decl_tree_cons (TREE_PURPOSE (t
), TREE_VALUE (t
), list
);
9106 TREE_TYPE (list
) = TREE_TYPE (t
);
9116 for (; t
; t
= TREE_CHAIN (t
))
9118 fate
= more_specialized_class (champ
, t
);
9127 return error_mark_node
;
9133 for (t
= list
; t
&& t
!= champ
; t
= TREE_CHAIN (t
))
9135 fate
= more_specialized_class (champ
, t
);
9137 return error_mark_node
;
9143 /* called from the parser. */
9146 do_decl_instantiation (declspecs
, declarator
, storage
)
9147 tree declspecs
, declarator
, storage
;
9149 tree decl
= grokdeclarator (declarator
, declspecs
, NORMAL
, 0, NULL_TREE
);
9150 tree result
= NULL_TREE
;
9154 /* An error ocurred, for which grokdeclarator has already issued
9155 an appropriate message. */
9157 else if (! DECL_LANG_SPECIFIC (decl
))
9159 cp_error ("explicit instantiation of non-template `%#D'", decl
);
9162 else if (TREE_CODE (decl
) == VAR_DECL
)
9164 /* There is an asymmetry here in the way VAR_DECLs and
9165 FUNCTION_DECLs are handled by grokdeclarator. In the case of
9166 the latter, the DECL we get back will be marked as a
9167 template instantiation, and the appropriate
9168 DECL_TEMPLATE_INFO will be set up. This does not happen for
9169 VAR_DECLs so we do the lookup here. Probably, grokdeclarator
9170 should handle VAR_DECLs as it currently handles
9172 result
= lookup_field (DECL_CONTEXT (decl
), DECL_NAME (decl
), 0, 0);
9173 if (result
&& TREE_CODE (result
) != VAR_DECL
)
9175 cp_error ("no matching template for `%D' found", result
);
9179 else if (TREE_CODE (decl
) != FUNCTION_DECL
)
9181 cp_error ("explicit instantiation of `%#D'", decl
);
9187 /* Check for various error cases. Note that if the explicit
9188 instantiation is legal the RESULT will currently be marked as an
9189 *implicit* instantiation; DECL_EXPLICIT_INSTANTIATION is not set
9190 until we get here. */
9192 if (DECL_TEMPLATE_SPECIALIZATION (result
))
9196 No program shall both explicitly instantiate and explicitly
9197 specialize a template. */
9198 cp_pedwarn ("explicit instantiation of `%#D' after", result
);
9199 cp_pedwarn_at ("explicit specialization here", result
);
9202 else if (DECL_EXPLICIT_INSTANTIATION (result
))
9206 No program shall explicitly instantiate any template more
9209 We check DECL_INTERFACE_KNOWN so as not to complain when the first
9210 instantiation was `extern' and the second is not, and EXTERN_P for
9211 the opposite case. If -frepo, chances are we already got marked
9212 as an explicit instantion because of the repo file. */
9213 if (DECL_INTERFACE_KNOWN (result
) && !extern_p
&& !flag_use_repository
)
9214 cp_pedwarn ("duplicate explicit instantiation of `%#D'", result
);
9216 /* If we've already instantiated the template, just return now. */
9217 if (DECL_INTERFACE_KNOWN (result
))
9220 else if (!DECL_IMPLICIT_INSTANTIATION (result
))
9222 cp_error ("no matching template for `%D' found", result
);
9225 else if (!DECL_TEMPLATE_INFO (result
))
9227 cp_pedwarn ("explicit instantiation of non-template `%#D'", result
);
9231 if (flag_external_templates
)
9234 if (storage
== NULL_TREE
)
9236 else if (storage
== ridpointers
[(int) RID_EXTERN
])
9239 cp_pedwarn ("ISO C++ forbids the use of `extern' on explicit instantiations");
9243 cp_error ("storage class `%D' applied to template instantiation",
9246 SET_DECL_EXPLICIT_INSTANTIATION (result
);
9247 mark_decl_instantiated (result
, extern_p
);
9248 repo_template_instantiated (result
, extern_p
);
9250 instantiate_decl (result
, /*defer_ok=*/1);
9254 mark_class_instantiated (t
, extern_p
)
9258 SET_CLASSTYPE_EXPLICIT_INSTANTIATION (t
);
9259 SET_CLASSTYPE_INTERFACE_KNOWN (t
);
9260 CLASSTYPE_INTERFACE_ONLY (t
) = extern_p
;
9261 CLASSTYPE_VTABLE_NEEDS_WRITING (t
) = ! extern_p
;
9262 TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (t
)) = extern_p
;
9265 CLASSTYPE_DEBUG_REQUESTED (t
) = 1;
9266 rest_of_type_compilation (t
, 1);
9271 do_type_instantiation (t
, storage
)
9278 if (TREE_CODE (t
) == TYPE_DECL
)
9281 if (! CLASS_TYPE_P (t
) || ! CLASSTYPE_TEMPLATE_INFO (t
))
9283 cp_error ("explicit instantiation of non-template type `%T'", t
);
9289 /* With -fexternal-templates, explicit instantiations are treated the same
9290 as implicit ones. */
9291 if (flag_external_templates
)
9294 if (!COMPLETE_TYPE_P (t
))
9296 cp_error ("explicit instantiation of `%#T' before definition of template",
9301 if (storage
!= NULL_TREE
)
9304 cp_pedwarn("ISO C++ forbids the use of `%s' on explicit instantiations",
9305 IDENTIFIER_POINTER (storage
));
9307 if (storage
== ridpointers
[(int) RID_INLINE
])
9309 else if (storage
== ridpointers
[(int) RID_EXTERN
])
9311 else if (storage
== ridpointers
[(int) RID_STATIC
])
9315 cp_error ("storage class `%D' applied to template instantiation",
9321 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
9325 No program shall both explicitly instantiate and explicitly
9326 specialize a template. */
9327 cp_error ("explicit instantiation of `%#T' after", t
);
9328 cp_error_at ("explicit specialization here", t
);
9331 else if (CLASSTYPE_EXPLICIT_INSTANTIATION (t
))
9335 No program shall explicitly instantiate any template more
9338 If CLASSTYPE_INTERFACE_ONLY, then the first explicit instantiation
9339 was `extern'. If EXTERN_P then the second is. If -frepo, chances
9340 are we already got marked as an explicit instantion because of the
9341 repo file. All these cases are OK. */
9342 if (!CLASSTYPE_INTERFACE_ONLY (t
) && !extern_p
&& !flag_use_repository
)
9343 cp_pedwarn ("duplicate explicit instantiation of `%#T'", t
);
9345 /* If we've already instantiated the template, just return now. */
9346 if (!CLASSTYPE_INTERFACE_ONLY (t
))
9350 mark_class_instantiated (t
, extern_p
);
9351 repo_template_instantiated (t
, extern_p
);
9359 /* In contrast to implicit instantiation, where only the
9360 declarations, and not the definitions, of members are
9361 instantiated, we have here:
9365 The explicit instantiation of a class template specialization
9366 implies the instantiation of all of its members not
9367 previously explicitly specialized in the translation unit
9368 containing the explicit instantiation.
9370 Of course, we can't instantiate member template classes, since
9371 we don't have any arguments for them. Note that the standard
9372 is unclear on whether the instatiation of the members are
9373 *explicit* instantiations or not. We choose to be generous,
9374 and not set DECL_EXPLICIT_INSTANTIATION. Therefore, we allow
9375 the explicit instantiation of a class where some of the members
9376 have no definition in the current translation unit. */
9379 for (tmp
= TYPE_METHODS (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
9380 if (TREE_CODE (tmp
) == FUNCTION_DECL
9381 && DECL_TEMPLATE_INSTANTIATION (tmp
))
9383 mark_decl_instantiated (tmp
, extern_p
);
9384 repo_template_instantiated (tmp
, extern_p
);
9386 instantiate_decl (tmp
, /*defer_ok=*/1);
9389 for (tmp
= TYPE_FIELDS (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
9390 if (TREE_CODE (tmp
) == VAR_DECL
&& DECL_TEMPLATE_INSTANTIATION (tmp
))
9392 mark_decl_instantiated (tmp
, extern_p
);
9393 repo_template_instantiated (tmp
, extern_p
);
9395 instantiate_decl (tmp
, /*defer_ok=*/1);
9398 for (tmp
= CLASSTYPE_TAGS (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
9399 if (IS_AGGR_TYPE (TREE_VALUE (tmp
))
9400 && !uses_template_parms (CLASSTYPE_TI_ARGS (TREE_VALUE (tmp
))))
9401 do_type_instantiation (TYPE_MAIN_DECL (TREE_VALUE (tmp
)), storage
);
9405 /* Given a function DECL, which is a specialization of TMPL, modify
9406 DECL to be a re-instantiation of TMPL with the same template
9407 arguments. TMPL should be the template into which tsubst'ing
9408 should occur for DECL, not the most general template.
9410 One reason for doing this is a scenario like this:
9413 void f(const T&, int i);
9415 void g() { f(3, 7); }
9418 void f(const T& t, const int i) { }
9420 Note that when the template is first instantiated, with
9421 instantiate_template, the resulting DECL will have no name for the
9422 first parameter, and the wrong type for the second. So, when we go
9423 to instantiate the DECL, we regenerate it. */
9426 regenerate_decl_from_template (decl
, tmpl
)
9430 /* The most general version of TMPL. */
9432 /* The arguments used to instantiate DECL, from the most general
9439 args
= DECL_TI_ARGS (decl
);
9440 code_pattern
= DECL_TEMPLATE_RESULT (tmpl
);
9442 /* Unregister the specialization so that when we tsubst we will not
9443 just return DECL. We don't have to unregister DECL from TMPL
9444 because if would only be registered there if it were a partial
9445 instantiation of a specialization, which it isn't: it's a full
9447 gen_tmpl
= most_general_template (tmpl
);
9448 unregistered
= unregister_specialization (decl
, gen_tmpl
);
9450 /* If the DECL was not unregistered then something peculiar is
9451 happening: we created a specialization but did not call
9452 register_specialization for it. */
9453 my_friendly_assert (unregistered
, 0);
9455 if (TREE_CODE (decl
) == VAR_DECL
)
9456 /* Make sure that we can see identifiers, and compute access
9457 correctly, for the class members used in the declaration of
9458 this static variable. */
9459 pushclass (DECL_CONTEXT (decl
), 2);
9461 /* Do the substitution to get the new declaration. */
9462 new_decl
= tsubst (code_pattern
, args
, /*complain=*/1, NULL_TREE
);
9464 if (TREE_CODE (decl
) == VAR_DECL
)
9466 /* Set up DECL_INITIAL, since tsubst doesn't. */
9467 DECL_INITIAL (new_decl
) =
9468 tsubst_expr (DECL_INITIAL (code_pattern
), args
,
9469 /*complain=*/1, DECL_TI_TEMPLATE (decl
));
9470 /* Pop the class context we pushed above. */
9473 else if (TREE_CODE (decl
) == FUNCTION_DECL
)
9475 /* Convince duplicate_decls to use the DECL_ARGUMENTS from the
9477 DECL_INITIAL (new_decl
) = error_mark_node
;
9478 /* And don't complain about a duplicate definition. */
9479 DECL_INITIAL (decl
) = NULL_TREE
;
9482 /* The immediate parent of the new template is still whatever it was
9483 before, even though tsubst sets DECL_TI_TEMPLATE up as the most
9484 general template. We also reset the DECL_ASSEMBLER_NAME since
9485 tsubst always calculates the name as if the function in question
9486 were really a template instance, and sometimes, with friend
9487 functions, this is not so. See tsubst_friend_function for
9489 DECL_TI_TEMPLATE (new_decl
) = DECL_TI_TEMPLATE (decl
);
9490 DECL_ASSEMBLER_NAME (new_decl
) = DECL_ASSEMBLER_NAME (decl
);
9491 DECL_RTL (new_decl
) = DECL_RTL (decl
);
9492 DECL_USE_TEMPLATE (new_decl
) = DECL_USE_TEMPLATE (decl
);
9494 /* Call duplicate decls to merge the old and new declarations. */
9495 duplicate_decls (new_decl
, decl
);
9497 /* Now, re-register the specialization. */
9498 register_specialization (decl
, gen_tmpl
, args
);
9501 /* Produce the definition of D, a _DECL generated from a template. If
9502 DEFER_OK is non-zero, then we don't have to actually do the
9503 instantiation now; we just have to do it sometime. */
9506 instantiate_decl (d
, defer_ok
)
9510 tree tmpl
= DECL_TI_TEMPLATE (d
);
9511 tree args
= DECL_TI_ARGS (d
);
9516 int pattern_defined
;
9518 const char *file
= input_filename
;
9520 /* This function should only be used to instantiate templates for
9521 functions and static member variables. */
9522 my_friendly_assert (TREE_CODE (d
) == FUNCTION_DECL
9523 || TREE_CODE (d
) == VAR_DECL
, 0);
9525 /* Don't instantiate cloned functions. Instead, instantiate the
9526 functions they cloned. */
9527 if (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_CLONED_FUNCTION_P (d
))
9528 d
= DECL_CLONED_FUNCTION (d
);
9530 if (DECL_TEMPLATE_INSTANTIATED (d
))
9531 /* D has already been instantiated. It might seem reasonable to
9532 check whether or not D is an explict instantiation, and, if so,
9533 stop here. But when an explicit instantiation is deferred
9534 until the end of the compilation, DECL_EXPLICIT_INSTANTIATION
9535 is set, even though we still need to do the instantiation. */
9538 /* If we already have a specialization of this declaration, then
9539 there's no reason to instantiate it. Note that
9540 retrieve_specialization gives us both instantiations and
9541 specializations, so we must explicitly check
9542 DECL_TEMPLATE_SPECIALIZATION. */
9543 gen_tmpl
= most_general_template (tmpl
);
9544 spec
= retrieve_specialization (gen_tmpl
, args
);
9545 if (spec
!= NULL_TREE
&& DECL_TEMPLATE_SPECIALIZATION (spec
))
9548 /* This needs to happen before any tsubsting. */
9549 if (! push_tinst_level (d
))
9552 timevar_push (TV_PARSE
);
9554 /* Set TD to the template whose DECL_TEMPLATE_RESULT is the pattern
9555 for the instantiation. This is not always the most general
9556 template. Consider, for example:
9559 struct S { template <class U> void f();
9560 template <> void f<int>(); };
9562 and an instantiation of S<double>::f<int>. We want TD to be the
9563 specialization S<T>::f<int>, not the more general S<T>::f<U>. */
9565 while (/* An instantiation cannot have a definition, so we need a
9566 more general template. */
9567 DECL_TEMPLATE_INSTANTIATION (td
)
9568 /* We must also deal with friend templates. Given:
9570 template <class T> struct S {
9571 template <class U> friend void f() {};
9574 S<int>::f<U> say, is not an instantiation of S<T>::f<U>,
9575 so far as the language is concerned, but that's still
9576 where we get the pattern for the instantiation from. On
9577 ther hand, if the definition comes outside the class, say:
9579 template <class T> struct S {
9580 template <class U> friend void f();
9582 template <class U> friend void f() {}
9584 we don't need to look any further. That's what the check for
9585 DECL_INITIAL is for. */
9586 || (TREE_CODE (d
) == FUNCTION_DECL
9587 && DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (td
)
9588 && !DECL_INITIAL (DECL_TEMPLATE_RESULT (td
))))
9590 /* The present template, TD, should not be a definition. If it
9591 were a definition, we should be using it! Note that we
9592 cannot restructure the loop to just keep going until we find
9593 a template with a definition, since that might go too far if
9594 a specialization was declared, but not defined. */
9595 my_friendly_assert (!(TREE_CODE (d
) == VAR_DECL
9596 && !DECL_IN_AGGR_P (DECL_TEMPLATE_RESULT (td
))),
9599 /* Fetch the more general template. */
9600 td
= DECL_TI_TEMPLATE (td
);
9603 code_pattern
= DECL_TEMPLATE_RESULT (td
);
9605 if (TREE_CODE (d
) == FUNCTION_DECL
)
9606 pattern_defined
= (DECL_SAVED_TREE (code_pattern
) != NULL_TREE
);
9608 pattern_defined
= ! DECL_IN_AGGR_P (code_pattern
);
9610 push_to_top_level ();
9611 lineno
= DECL_SOURCE_LINE (d
);
9612 input_filename
= DECL_SOURCE_FILE (d
);
9614 if (pattern_defined
)
9616 repo_template_used (d
);
9618 if (flag_external_templates
&& ! DECL_INTERFACE_KNOWN (d
))
9620 if (flag_alt_external_templates
)
9622 if (interface_unknown
)
9623 warn_if_unknown_interface (d
);
9625 else if (DECL_INTERFACE_KNOWN (code_pattern
))
9627 DECL_INTERFACE_KNOWN (d
) = 1;
9628 DECL_NOT_REALLY_EXTERN (d
) = ! DECL_EXTERNAL (code_pattern
);
9631 warn_if_unknown_interface (code_pattern
);
9635 import_export_decl (d
);
9638 /* Reject all external templates except inline functions. */
9639 if (DECL_INTERFACE_KNOWN (d
)
9640 && ! DECL_NOT_REALLY_EXTERN (d
)
9641 && ! (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_INLINE (d
)))
9644 /* We need to set up DECL_INITIAL regardless of pattern_defined if
9645 the variable is a static const initialized in the class body. */
9646 if (TREE_CODE (d
) == VAR_DECL
9647 && TREE_READONLY (d
)
9648 && DECL_INITIAL (d
) == NULL_TREE
9649 && DECL_INITIAL (code_pattern
) != NULL_TREE
)
9651 /* Defer all other templates, unless we have been explicitly
9652 forbidden from doing so. We restore the source position here
9653 because it's used by add_pending_template. */
9654 else if (! pattern_defined
|| defer_ok
)
9657 input_filename
= file
;
9659 if (at_eof
&& !pattern_defined
9660 && DECL_EXPLICIT_INSTANTIATION (d
))
9663 The definition of a non-exported function template, a
9664 non-exported member function template, or a non-exported
9665 member function or static data member of a class template
9666 shall be present in every translation unit in which it is
9667 explicitly instantiated. */
9668 cp_error ("explicit instantiation of `%D' but no definition available",
9671 add_pending_template (d
);
9675 /* We're now committed to instantiating this template. Mark it as
9676 instantiated so that recursive calls to instantiate_decl do not
9677 try to instantiate it again. */
9678 DECL_TEMPLATE_INSTANTIATED (d
) = 1;
9680 /* Regenerate the declaration in case the template has been modified
9681 by a subsequent redeclaration. */
9682 regenerate_decl_from_template (d
, td
);
9684 /* We already set the file and line above. Reset them now in case
9685 they changed as a result of calling regenerate_decl_from_template. */
9686 lineno
= DECL_SOURCE_LINE (d
);
9687 input_filename
= DECL_SOURCE_FILE (d
);
9689 if (TREE_CODE (d
) == VAR_DECL
)
9691 DECL_IN_AGGR_P (d
) = 0;
9692 if (DECL_INTERFACE_KNOWN (d
))
9693 DECL_EXTERNAL (d
) = ! DECL_NOT_REALLY_EXTERN (d
);
9696 DECL_EXTERNAL (d
) = 1;
9697 DECL_NOT_REALLY_EXTERN (d
) = 1;
9699 cp_finish_decl (d
, DECL_INITIAL (d
), NULL_TREE
, 0);
9701 else if (TREE_CODE (d
) == FUNCTION_DECL
)
9703 htab_t saved_local_specializations
;
9705 /* Save away the current list, in case we are instantiating one
9706 template from within the body of another. */
9707 saved_local_specializations
= local_specializations
;
9709 /* Set up the list of local specializations. */
9710 local_specializations
= htab_create (37,
9715 /* Set up context. */
9716 start_function (NULL_TREE
, d
, NULL_TREE
, SF_PRE_PARSED
);
9717 store_parm_decls ();
9719 /* We already set up __FUNCTION__, etc., so we don't want to do
9721 cp_function_chain
->name_declared
= 1;
9723 /* Substitute into the body of the function. */
9724 tsubst_expr (DECL_SAVED_TREE (code_pattern
), args
,
9725 /*complain=*/1, tmpl
);
9727 /* We don't need the local specializations any more. */
9728 htab_delete (local_specializations
);
9729 local_specializations
= saved_local_specializations
;
9731 /* Finish the function. */
9732 expand_body (finish_function (0));
9735 /* We're not deferring instantiation any more. */
9736 TI_PENDING_TEMPLATE_FLAG (DECL_TEMPLATE_INFO (d
)) = 0;
9740 input_filename
= file
;
9742 pop_from_top_level ();
9745 timevar_pop (TV_PARSE
);
9750 /* Run through the list of templates that we wish we could
9751 instantiate, and instantiate any we can. */
9754 instantiate_pending_templates ()
9757 int instantiated_something
= 0;
9764 t
= &pending_templates
;
9767 tree instantiation
= TREE_VALUE (*t
);
9769 reopen_tinst_level (TREE_PURPOSE (*t
));
9771 if (TYPE_P (instantiation
))
9775 if (!COMPLETE_TYPE_P (instantiation
))
9777 instantiate_class_template (instantiation
);
9778 if (CLASSTYPE_TEMPLATE_INSTANTIATION (instantiation
))
9779 for (fn
= TYPE_METHODS (instantiation
);
9781 fn
= TREE_CHAIN (fn
))
9782 if (! DECL_ARTIFICIAL (fn
))
9783 instantiate_decl (fn
, /*defer_ok=*/0);
9784 if (COMPLETE_TYPE_P (instantiation
))
9786 instantiated_something
= 1;
9791 if (COMPLETE_TYPE_P (instantiation
))
9792 /* If INSTANTIATION has been instantiated, then we don't
9793 need to consider it again in the future. */
9794 *t
= TREE_CHAIN (*t
);
9796 t
= &TREE_CHAIN (*t
);
9800 if (!DECL_TEMPLATE_SPECIALIZATION (instantiation
)
9801 && !DECL_TEMPLATE_INSTANTIATED (instantiation
))
9803 instantiation
= instantiate_decl (instantiation
,
9805 if (DECL_TEMPLATE_INSTANTIATED (instantiation
))
9807 instantiated_something
= 1;
9812 if (DECL_TEMPLATE_SPECIALIZATION (instantiation
)
9813 || DECL_TEMPLATE_INSTANTIATED (instantiation
))
9814 /* If INSTANTIATION has been instantiated, then we don't
9815 need to consider it again in the future. */
9816 *t
= TREE_CHAIN (*t
);
9818 t
= &TREE_CHAIN (*t
);
9821 current_tinst_level
= NULL_TREE
;
9825 /* Go through the things that are template instantiations if we are
9826 using guiding declarations. */
9827 t
= &maybe_templates
;
9834 fn
= TREE_VALUE (*t
);
9836 if (DECL_INITIAL (fn
))
9837 /* If the FN is already defined, then it was either already
9838 instantiated or, even though guiding declarations were
9839 allowed, a non-template definition was provided. */
9843 template = TREE_PURPOSE (*t
);
9844 args
= get_bindings (template, fn
, NULL_TREE
);
9845 fn
= instantiate_template (template, args
);
9846 instantiate_decl (fn
, /*defer_ok=*/0);
9850 /* Remove this entry from the chain. */
9851 *t
= TREE_CHAIN (*t
);
9853 maybe_template_tail
= t
;
9857 return instantiated_something
;
9860 /* Substitute ARGVEC into T, which is a list of initializers for
9861 either base class or a non-static data member. The TREE_PURPOSEs
9862 are DECLs, and the TREE_VALUEs are the initializer values. Used by
9863 instantiate_decl. */
9866 tsubst_initializer_list (t
, argvec
)
9869 tree first
= NULL_TREE
;
9872 for (; t
; t
= TREE_CHAIN (t
))
9878 decl
= tsubst_copy (TREE_PURPOSE (t
), argvec
, /*complain=*/1,
9880 init
= tsubst_expr (TREE_VALUE (t
), argvec
, /*complain=*/1,
9885 else if (TREE_CODE (init
) == TREE_LIST
)
9886 for (val
= init
; val
; val
= TREE_CHAIN (val
))
9887 TREE_VALUE (val
) = convert_from_reference (TREE_VALUE (val
));
9889 init
= convert_from_reference (init
);
9891 *p
= build_tree_list (decl
, init
);
9892 p
= &TREE_CHAIN (*p
);
9897 /* D is an undefined function declaration in the presence of templates with
9898 the same name, listed in FNS. If one of them can produce D as an
9899 instantiation, remember this so we can instantiate it at EOF if D has
9900 not been defined by that time. */
9903 add_maybe_template (d
, fns
)
9908 if (DECL_MAYBE_TEMPLATE (d
))
9911 t
= most_specialized (fns
, d
, NULL_TREE
);
9914 if (t
== error_mark_node
)
9916 cp_error ("ambiguous template instantiation for `%D'", d
);
9920 *maybe_template_tail
= tree_cons (t
, d
, NULL_TREE
);
9921 maybe_template_tail
= &TREE_CHAIN (*maybe_template_tail
);
9922 DECL_MAYBE_TEMPLATE (d
) = 1;
9925 /* Set CURRENT_ACCESS_SPECIFIER based on the protection of DECL. */
9928 set_current_access_from_decl (decl
)
9931 if (TREE_PRIVATE (decl
))
9932 current_access_specifier
= access_private_node
;
9933 else if (TREE_PROTECTED (decl
))
9934 current_access_specifier
= access_protected_node
;
9936 current_access_specifier
= access_public_node
;
9939 /* Instantiate an enumerated type. TAG is the template type, NEWTAG
9940 is the instantiation (which should have been created with
9941 start_enum) and ARGS are the template arguments to use. */
9944 tsubst_enum (tag
, newtag
, args
)
9951 for (e
= TYPE_VALUES (tag
); e
; e
= TREE_CHAIN (e
))
9955 /* Note that in a template enum, the TREE_VALUE is the
9956 CONST_DECL, not the corresponding INTEGER_CST. */
9957 value
= tsubst_expr (DECL_INITIAL (TREE_VALUE (e
)),
9958 args
, /*complain=*/1,
9961 /* Give this enumeration constant the correct access. */
9962 set_current_access_from_decl (TREE_VALUE (e
));
9964 /* Actually build the enumerator itself. */
9965 build_enumerator (TREE_PURPOSE (e
), value
, newtag
);
9968 finish_enum (newtag
);
9971 /* DECL is a FUNCTION_DECL that is a template specialization. Return
9972 its type -- but without substituting the innermost set of template
9973 arguments. So, innermost set of template parameters will appear in
9974 the type. If CONTEXTP is non-NULL, then the partially substituted
9975 DECL_CONTEXT (if any) will also be filled in. Similarly, TPARMSP
9976 will be filled in with the substituted template parameters, if it
9980 get_mostly_instantiated_function_type (decl
, contextp
, tparmsp
)
9985 tree context
= NULL_TREE
;
9992 tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
9993 targs
= DECL_TI_ARGS (decl
);
9994 tparms
= DECL_TEMPLATE_PARMS (tmpl
);
9995 parm_depth
= TMPL_PARMS_DEPTH (tparms
);
9997 /* There should be as many levels of arguments as there are levels
9999 my_friendly_assert (parm_depth
== TMPL_ARGS_DEPTH (targs
), 0);
10001 fn_type
= TREE_TYPE (tmpl
);
10002 if (DECL_STATIC_FUNCTION_P (decl
))
10003 context
= DECL_CONTEXT (decl
);
10005 if (parm_depth
== 1)
10006 /* No substitution is necessary. */
10013 /* Replace the innermost level of the TARGS with NULL_TREEs to
10014 let tsubst know not to subsitute for those parameters. */
10015 partial_args
= make_tree_vec (TREE_VEC_LENGTH (targs
));
10016 for (i
= 1; i
< TMPL_ARGS_DEPTH (targs
); ++i
)
10017 SET_TMPL_ARGS_LEVEL (partial_args
, i
,
10018 TMPL_ARGS_LEVEL (targs
, i
));
10019 SET_TMPL_ARGS_LEVEL (partial_args
,
10020 TMPL_ARGS_DEPTH (targs
),
10021 make_tree_vec (DECL_NTPARMS (tmpl
)));
10023 /* Now, do the (partial) substitution to figure out the
10024 appropriate function type. */
10025 fn_type
= tsubst (fn_type
, partial_args
, /*complain=*/1, NULL_TREE
);
10026 if (DECL_STATIC_FUNCTION_P (decl
))
10027 context
= tsubst (context
, partial_args
, /*complain=*/1, NULL_TREE
);
10029 /* Substitute into the template parameters to obtain the real
10030 innermost set of parameters. This step is important if the
10031 innermost set of template parameters contains value
10032 parameters whose types depend on outer template parameters. */
10033 TREE_VEC_LENGTH (partial_args
)--;
10034 tparms
= tsubst_template_parms (tparms
, partial_args
, /*complain=*/1);
10038 *contextp
= context
;
10045 /* Set the DECL_ASSEMBLER_NAME for DECL, which is a FUNCTION_DECL that
10046 is either an instantiation or specialization of a template
10050 set_mangled_name_for_template_decl (decl
)
10053 tree context
= NULL_TREE
;
10060 my_friendly_assert (TREE_CODE (decl
) == FUNCTION_DECL
, 0);
10061 my_friendly_assert (DECL_TEMPLATE_INFO (decl
) != NULL_TREE
, 0);
10063 /* Under the new ABI, we don't need special machinery. */
10066 set_mangled_name_for_decl (decl
);
10070 /* The names of template functions must be mangled so as to indicate
10071 what template is being specialized with what template arguments.
10072 For example, each of the following three functions must get
10073 different mangled names:
10076 template <> void f<7>(int);
10077 template <> void f<8>(int); */
10079 targs
= DECL_TI_ARGS (decl
);
10080 if (uses_template_parms (targs
))
10081 /* This DECL is for a partial instantiation. There's no need to
10082 mangle the name of such an entity. */
10085 /* We now compute the PARMS and RET_TYPE to give to
10086 build_decl_overload_real. The PARMS and RET_TYPE are the
10087 parameter and return types of the template, after all but the
10088 innermost template arguments have been substituted, not the
10089 parameter and return types of the function DECL. For example,
10092 template <class T> T f(T);
10094 both PARMS and RET_TYPE should be `T' even if DECL is `int f(int)'.
10095 A more subtle example is:
10097 template <class T> struct S { template <class U> void f(T, U); }
10099 Here, if DECL is `void S<int>::f(int, double)', PARMS should be
10100 {int, U}. Thus, the args that we want to subsitute into the
10101 return and parameter type for the function are those in TARGS,
10102 with the innermost level omitted. */
10103 fn_type
= get_mostly_instantiated_function_type (decl
, &context
, &tparms
);
10105 /* Now, get the innermost parameters and arguments, and figure out
10106 the parameter and return types. */
10107 tparms
= INNERMOST_TEMPLATE_PARMS (tparms
);
10108 targs
= INNERMOST_TEMPLATE_ARGS (targs
);
10109 ret_type
= TREE_TYPE (fn_type
);
10110 parm_types
= TYPE_ARG_TYPES (fn_type
);
10112 /* For a static member function, we generate a fake `this' pointer,
10113 for the purposes of mangling. This indicates of which class the
10114 function is a member. Because of:
10118 There shall not be a static and a nonstatic member function
10119 with the same name and the same parameter types
10121 we don't have to worry that this will result in a clash with a
10122 non-static member function. */
10123 if (DECL_STATIC_FUNCTION_P (decl
))
10124 parm_types
= hash_tree_chain (build_pointer_type (context
), parm_types
);
10126 /* There should be the same number of template parameters as
10127 template arguments. */
10128 my_friendly_assert (TREE_VEC_LENGTH (tparms
) == TREE_VEC_LENGTH (targs
),
10131 /* Actually set the DECL_ASSEMBLER_NAME. */
10132 DECL_ASSEMBLER_NAME (decl
)
10133 = build_decl_overload_real (decl
, parm_types
, ret_type
,
10135 DECL_FUNCTION_MEMBER_P (decl
)
10136 + DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (decl
));