1 /* Handle parameterized types (templates) for GNU C++.
2 Copyright (C) 1992, 93-97, 1998, 1999, 2000 Free Software Foundation, Inc.
3 Written by Ken Raeburn (raeburn@cygnus.com) while at Watchmaker Computing.
4 Rewritten by Jason Merrill (jason@cygnus.com).
6 This file is part of GNU CC.
8 GNU CC is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 2, or (at your option)
13 GNU CC is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GNU CC; see the file COPYING. If not, write to
20 the Free Software Foundation, 59 Temple Place - Suite 330,
21 Boston, MA 02111-1307, USA. */
23 /* Known bugs or deficiencies include:
25 all methods must be provided in header files; can't use a source
26 file that contains only the method templates and "just win". */
46 /* The type of functions taking a tree, and some additional data, and
48 typedef int (*tree_fn_t
) PROTO((tree
, void*));
50 extern struct obstack permanent_obstack
;
53 extern char *input_filename
;
55 /* The PENDING_TEMPLATES is a TREE_LIST of templates whose
56 instantiations have been deferred, either because their definitions
57 were not yet available, or because we were putting off doing the
58 work. The TREE_PURPOSE of each entry is a SRCLOC indicating where
59 the instantiate request occurred; the TREE_VALUE is a either a DECL
60 (for a function or static data member), or a TYPE (for a class)
61 indicating what we are hoping to instantiate. */
62 static tree pending_templates
;
63 static tree
*template_tail
= &pending_templates
;
65 static tree maybe_templates
;
66 static tree
*maybe_template_tail
= &maybe_templates
;
68 int processing_template_parmlist
;
69 static int template_header_count
;
71 static tree saved_trees
;
72 static varray_type inline_parm_levels
;
73 static size_t inline_parm_levels_used
;
75 #define obstack_chunk_alloc xmalloc
76 #define obstack_chunk_free free
78 #define UNIFY_ALLOW_NONE 0
79 #define UNIFY_ALLOW_MORE_CV_QUAL 1
80 #define UNIFY_ALLOW_LESS_CV_QUAL 2
81 #define UNIFY_ALLOW_DERIVED 4
82 #define UNIFY_ALLOW_INTEGER 8
84 #define GTB_VIA_VIRTUAL 1 /* The base class we are examining is
85 virtual, or a base class of a virtual
87 #define GTB_IGNORE_TYPE 2 /* We don't need to try to unify the current
88 type with the desired type. */
90 static int resolve_overloaded_unification
PROTO((tree
, tree
, tree
, tree
,
91 unification_kind_t
, int));
92 static int try_one_overload
PROTO((tree
, tree
, tree
, tree
, tree
,
93 unification_kind_t
, int));
94 static int unify
PROTO((tree
, tree
, tree
, tree
, int));
95 static void add_pending_template
PROTO((tree
));
96 static int push_tinst_level
PROTO((tree
));
97 static tree classtype_mangled_name
PROTO((tree
));
98 static char *mangle_class_name_for_template
PROTO((char *, tree
, tree
));
99 static tree tsubst_expr_values
PROTO((tree
, tree
));
100 static int list_eq
PROTO((tree
, tree
));
101 static tree get_class_bindings
PROTO((tree
, tree
, tree
));
102 static tree coerce_template_parms
PROTO((tree
, tree
, tree
, int, int));
103 static void tsubst_enum
PROTO((tree
, tree
, tree
));
104 static tree add_to_template_args
PROTO((tree
, tree
));
105 static tree add_outermost_template_args
PROTO((tree
, tree
));
106 static void maybe_adjust_types_for_deduction
PROTO((unification_kind_t
, tree
*,
108 static int type_unification_real
PROTO((tree
, tree
, tree
, tree
,
109 int, unification_kind_t
, int));
110 static void note_template_header
PROTO((int));
111 static tree maybe_fold_nontype_arg
PROTO((tree
));
112 static tree convert_nontype_argument
PROTO((tree
, tree
));
113 static tree convert_template_argument
PROTO ((tree
, tree
, tree
, int,
115 static tree get_bindings_overload
PROTO((tree
, tree
, tree
));
116 static int for_each_template_parm
PROTO((tree
, tree_fn_t
, void*));
117 static tree build_template_parm_index
PROTO((int, int, int, tree
, tree
));
118 static int inline_needs_template_parms
PROTO((tree
));
119 static void push_inline_template_parms_recursive
PROTO((tree
, int));
120 static tree retrieve_specialization
PROTO((tree
, tree
));
121 static tree retrieve_local_specialization
PROTO((tree
, tree
));
122 static tree register_specialization
PROTO((tree
, tree
, tree
));
123 static tree register_local_specialization
PROTO((tree
, tree
, tree
));
124 static int unregister_specialization
PROTO((tree
, tree
));
125 static tree reduce_template_parm_level
PROTO((tree
, tree
, int));
126 static tree build_template_decl
PROTO((tree
, tree
));
127 static int mark_template_parm
PROTO((tree
, void *));
128 static tree tsubst_friend_function
PROTO((tree
, tree
));
129 static tree tsubst_friend_class
PROTO((tree
, tree
));
130 static tree get_bindings_real
PROTO((tree
, tree
, tree
, int));
131 static int template_decl_level
PROTO((tree
));
132 static tree maybe_get_template_decl_from_type_decl
PROTO((tree
));
133 static int check_cv_quals_for_unify
PROTO((int, tree
, tree
));
134 static tree tsubst_template_arg_vector
PROTO((tree
, tree
, int));
135 static tree tsubst_template_parms
PROTO((tree
, tree
, int));
136 static void regenerate_decl_from_template
PROTO((tree
, tree
));
137 static tree most_specialized
PROTO((tree
, tree
, tree
));
138 static tree most_specialized_class
PROTO((tree
, tree
));
139 static void set_mangled_name_for_template_decl
PROTO((tree
));
140 static int template_class_depth_real
PROTO((tree
, int));
141 static tree tsubst_aggr_type
PROTO((tree
, tree
, int, tree
, int));
142 static tree tsubst_decl
PROTO((tree
, tree
, tree
, tree
));
143 static tree tsubst_arg_types
PROTO((tree
, tree
, int, tree
));
144 static tree tsubst_function_type
PROTO((tree
, tree
, int, tree
));
145 static void check_specialization_scope
PROTO((void));
146 static tree process_partial_specialization
PROTO((tree
));
147 static void set_current_access_from_decl
PROTO((tree
));
148 static void check_default_tmpl_args
PROTO((tree
, tree
, int, int));
149 static tree tsubst_call_declarator_parms
PROTO((tree
, tree
, int, tree
));
150 static tree get_template_base_recursive
PROTO((tree
, tree
,
151 tree
, tree
, tree
, int));
152 static tree get_template_base
PROTO((tree
, tree
, tree
, tree
));
153 static tree try_class_unification
PROTO((tree
, tree
, tree
, tree
));
154 static int coerce_template_template_parms
PROTO((tree
, tree
, int,
156 static tree determine_specialization
PROTO((tree
, tree
, tree
*, int));
157 static int template_args_equal
PROTO((tree
, tree
));
158 static void print_template_context
PROTO((int));
159 static void tsubst_default_arguments
PROTO((tree
));
160 static tree for_each_template_parm_r
PROTO((tree
*, int *, void *));
162 /* Called once to initialize pt.c. */
167 ggc_add_tree_root (&pending_templates
, 1);
168 ggc_add_tree_root (&maybe_templates
, 1);
169 ggc_add_tree_root (&saved_trees
, 1);
172 /* Do any processing required when DECL (a member template declaration
173 using TEMPLATE_PARAMETERS as its innermost parameter list) is
174 finished. Returns the TEMPLATE_DECL corresponding to DECL, unless
175 it is a specialization, in which case the DECL itself is returned. */
178 finish_member_template_decl (decl
)
181 if (decl
== NULL_TREE
|| decl
== void_type_node
)
183 else if (decl
== error_mark_node
)
184 /* By returning NULL_TREE, the parser will just ignore this
185 declaration. We have already issued the error. */
187 else if (TREE_CODE (decl
) == TREE_LIST
)
189 /* Assume that the class is the only declspec. */
190 decl
= TREE_VALUE (decl
);
191 if (IS_AGGR_TYPE (decl
) && CLASSTYPE_TEMPLATE_INFO (decl
)
192 && ! CLASSTYPE_TEMPLATE_SPECIALIZATION (decl
))
194 tree tmpl
= CLASSTYPE_TI_TEMPLATE (decl
);
195 check_member_template (tmpl
);
200 else if (TREE_CODE (decl
) == FIELD_DECL
)
201 cp_error ("data member `%D' cannot be a member template", decl
);
202 else if (DECL_TEMPLATE_INFO (decl
))
204 if (!DECL_TEMPLATE_SPECIALIZATION (decl
))
206 check_member_template (DECL_TI_TEMPLATE (decl
));
207 return DECL_TI_TEMPLATE (decl
);
213 cp_error ("invalid member template declaration `%D'", decl
);
215 return error_mark_node
;
218 /* Returns the template nesting level of the indicated class TYPE.
228 A<T>::B<U> has depth two, while A<T> has depth one.
229 Both A<T>::B<int> and A<int>::B<U> have depth one, if
230 COUNT_SPECIALIZATIONS is 0 or if they are instantiations, not
233 This function is guaranteed to return 0 if passed NULL_TREE so
234 that, for example, `template_class_depth (current_class_type)' is
238 template_class_depth_real (type
, count_specializations
)
240 int count_specializations
;
245 type
&& TREE_CODE (type
) != NAMESPACE_DECL
;
246 type
= (TREE_CODE (type
) == FUNCTION_DECL
)
247 ? DECL_REAL_CONTEXT (type
) : TYPE_CONTEXT (type
))
249 if (TREE_CODE (type
) != FUNCTION_DECL
)
251 if (CLASSTYPE_TEMPLATE_INFO (type
)
252 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (type
))
253 && ((count_specializations
254 && CLASSTYPE_TEMPLATE_SPECIALIZATION (type
))
255 || uses_template_parms (CLASSTYPE_TI_ARGS (type
))))
260 if (DECL_TEMPLATE_INFO (type
)
261 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (type
))
262 && ((count_specializations
263 && DECL_TEMPLATE_SPECIALIZATION (type
))
264 || uses_template_parms (DECL_TI_ARGS (type
))))
272 /* Returns the template nesting level of the indicated class TYPE.
273 Like template_class_depth_real, but instantiations do not count in
277 template_class_depth (type
)
280 return template_class_depth_real (type
, /*count_specializations=*/0);
283 /* Returns 1 if processing DECL as part of do_pending_inlines
284 needs us to push template parms. */
287 inline_needs_template_parms (decl
)
290 if (! DECL_TEMPLATE_INFO (decl
))
293 return (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (most_general_template (decl
)))
294 > (processing_template_decl
+ DECL_TEMPLATE_SPECIALIZATION (decl
)));
297 /* Subroutine of maybe_begin_member_template_processing.
298 Push the template parms in PARMS, starting from LEVELS steps into the
299 chain, and ending at the beginning, since template parms are listed
303 push_inline_template_parms_recursive (parmlist
, levels
)
307 tree parms
= TREE_VALUE (parmlist
);
311 push_inline_template_parms_recursive (TREE_CHAIN (parmlist
), levels
- 1);
313 ++processing_template_decl
;
314 current_template_parms
315 = tree_cons (build_int_2 (0, processing_template_decl
),
316 parms
, current_template_parms
);
317 TEMPLATE_PARMS_FOR_INLINE (current_template_parms
) = 1;
320 for (i
= 0; i
< TREE_VEC_LENGTH (parms
); ++i
)
322 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
323 my_friendly_assert (TREE_CODE_CLASS (TREE_CODE (parm
)) == 'd', 0);
325 switch (TREE_CODE (parm
))
334 /* Make a CONST_DECL as is done in process_template_parm.
335 It is ugly that we recreate this here; the original
336 version built in process_template_parm is no longer
338 tree decl
= build_decl (CONST_DECL
, DECL_NAME (parm
),
340 SET_DECL_ARTIFICIAL (decl
);
341 DECL_INITIAL (decl
) = DECL_INITIAL (parm
);
342 SET_DECL_TEMPLATE_PARM_P (decl
);
348 my_friendly_abort (0);
353 /* Restore the template parameter context for a member template or
354 a friend template defined in a class definition. */
357 maybe_begin_member_template_processing (decl
)
363 if (inline_needs_template_parms (decl
))
365 parms
= DECL_TEMPLATE_PARMS (most_general_template (decl
));
366 levels
= TMPL_PARMS_DEPTH (parms
) - processing_template_decl
;
368 if (DECL_TEMPLATE_SPECIALIZATION (decl
))
371 parms
= TREE_CHAIN (parms
);
374 push_inline_template_parms_recursive (parms
, levels
);
377 /* Remember how many levels of template parameters we pushed so that
378 we can pop them later. */
379 if (!inline_parm_levels
)
380 VARRAY_INT_INIT (inline_parm_levels
, 4, "inline_parm_levels");
381 if (inline_parm_levels_used
== inline_parm_levels
->num_elements
)
382 VARRAY_GROW (inline_parm_levels
, 2 * inline_parm_levels_used
);
383 VARRAY_INT (inline_parm_levels
, inline_parm_levels_used
) = levels
;
384 ++inline_parm_levels_used
;
387 /* Undo the effects of begin_member_template_processing. */
390 maybe_end_member_template_processing ()
394 if (!inline_parm_levels_used
)
397 --inline_parm_levels_used
;
399 i
< VARRAY_INT (inline_parm_levels
, inline_parm_levels_used
);
402 --processing_template_decl
;
403 current_template_parms
= TREE_CHAIN (current_template_parms
);
408 /* Returns non-zero iff T is a member template function. We must be
411 template <class T> class C { void f(); }
413 Here, f is a template function, and a member, but not a member
414 template. This function does not concern itself with the origin of
415 T, only its present state. So if we have
417 template <class T> class C { template <class U> void f(U); }
419 then neither C<int>::f<char> nor C<T>::f<double> is considered
420 to be a member template. But, `template <class U> void
421 C<int>::f(U)' is considered a member template. */
424 is_member_template (t
)
427 if (!DECL_FUNCTION_TEMPLATE_P (t
))
428 /* Anything that isn't a function or a template function is
429 certainly not a member template. */
432 /* A local class can't have member templates. */
433 if (hack_decl_function_context (t
))
436 return (DECL_FUNCTION_MEMBER_P (DECL_TEMPLATE_RESULT (t
))
437 /* If there are more levels of template parameters than
438 there are template classes surrounding the declaration,
439 then we have a member template. */
440 && (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (t
)) >
441 template_class_depth (DECL_CLASS_CONTEXT (t
))));
445 /* Returns non-zero iff T is a member template class. See
446 is_member_template for a description of what precisely constitutes
447 a member template. */
450 is_member_template_class (t
)
453 if (!DECL_CLASS_TEMPLATE_P (t
))
454 /* Anything that isn't a class template, is certainly not a member
458 if (!DECL_CLASS_SCOPE_P (t
))
459 /* Anything whose context isn't a class type is surely not a
463 /* If there are more levels of template parameters than there are
464 template classes surrounding the declaration, then we have a
466 return (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (t
)) >
467 template_class_depth (DECL_CONTEXT (t
)));
471 /* Return a new template argument vector which contains all of ARGS,
472 but has as its innermost set of arguments the EXTRA_ARGS. The
473 resulting vector will be built on a temporary obstack, and so must
474 be explicitly copied to the permanent obstack, if required. */
477 add_to_template_args (args
, extra_args
)
486 extra_depth
= TMPL_ARGS_DEPTH (extra_args
);
487 new_args
= make_tree_vec (TMPL_ARGS_DEPTH (args
) + extra_depth
);
489 for (i
= 1; i
<= TMPL_ARGS_DEPTH (args
); ++i
)
490 SET_TMPL_ARGS_LEVEL (new_args
, i
, TMPL_ARGS_LEVEL (args
, i
));
492 for (j
= 1; j
<= extra_depth
; ++j
, ++i
)
493 SET_TMPL_ARGS_LEVEL (new_args
, i
, TMPL_ARGS_LEVEL (extra_args
, j
));
498 /* Like add_to_template_args, but only the outermost ARGS are added to
499 the EXTRA_ARGS. In particular, all but TMPL_ARGS_DEPTH
500 (EXTRA_ARGS) levels are added. This function is used to combine
501 the template arguments from a partial instantiation with the
502 template arguments used to attain the full instantiation from the
503 partial instantiation. */
506 add_outermost_template_args (args
, extra_args
)
512 /* If there are more levels of EXTRA_ARGS than there are ARGS,
513 something very fishy is going on. */
514 my_friendly_assert (TMPL_ARGS_DEPTH (args
) >= TMPL_ARGS_DEPTH (extra_args
),
517 /* If *all* the new arguments will be the EXTRA_ARGS, just return
519 if (TMPL_ARGS_DEPTH (args
) == TMPL_ARGS_DEPTH (extra_args
))
522 /* For the moment, we make ARGS look like it contains fewer levels. */
523 TREE_VEC_LENGTH (args
) -= TMPL_ARGS_DEPTH (extra_args
);
525 new_args
= add_to_template_args (args
, extra_args
);
527 /* Now, we restore ARGS to its full dimensions. */
528 TREE_VEC_LENGTH (args
) += TMPL_ARGS_DEPTH (extra_args
);
533 /* We've got a template header coming up; push to a new level for storing
537 begin_template_parm_list ()
539 /* We use a non-tag-transparent scope here, which causes pushtag to
540 put tags in this scope, rather than in the enclosing class or
541 namespace scope. This is the right thing, since we want
542 TEMPLATE_DECLS, and not TYPE_DECLS for template classes. For a
543 global template class, push_template_decl handles putting the
544 TEMPLATE_DECL into top-level scope. For a nested template class,
547 template <class T> struct S1 {
548 template <class T> struct S2 {};
551 pushtag contains special code to call pushdecl_with_scope on the
552 TEMPLATE_DECL for S2. */
554 declare_pseudo_global_level ();
555 ++processing_template_decl
;
556 ++processing_template_parmlist
;
557 note_template_header (0);
560 /* This routine is called when a specialization is declared. If it is
561 illegal to declare a specialization here, an error is reported. */
564 check_specialization_scope ()
566 tree scope
= current_scope ();
570 An explicit specialization shall be declared in the namespace of
571 which the template is a member, or, for member templates, in the
572 namespace of which the enclosing class or enclosing class
573 template is a member. An explicit specialization of a member
574 function, member class or static data member of a class template
575 shall be declared in the namespace of which the class template
577 if (scope
&& TREE_CODE (scope
) != NAMESPACE_DECL
)
578 cp_error ("explicit specialization in non-namespace scope `%D'",
583 In an explicit specialization declaration for a member of a class
584 template or a member template that appears in namespace scope,
585 the member template and some of its enclosing class templates may
586 remain unspecialized, except that the declaration shall not
587 explicitly specialize a class member template if its enclosing
588 class templates are not explicitly specialized as well. */
589 if (current_template_parms
)
590 cp_error ("enclosing class templates are not explicitly specialized");
593 /* We've just seen template <>. */
596 begin_specialization ()
598 note_template_header (1);
599 check_specialization_scope ();
602 /* Called at then end of processing a declaration preceeded by
606 end_specialization ()
608 reset_specialization ();
611 /* Any template <>'s that we have seen thus far are not referring to a
612 function specialization. */
615 reset_specialization ()
617 processing_specialization
= 0;
618 template_header_count
= 0;
621 /* We've just seen a template header. If SPECIALIZATION is non-zero,
622 it was of the form template <>. */
625 note_template_header (specialization
)
628 processing_specialization
= specialization
;
629 template_header_count
++;
632 /* We're beginning an explicit instantiation. */
635 begin_explicit_instantiation ()
637 ++processing_explicit_instantiation
;
642 end_explicit_instantiation ()
644 my_friendly_assert(processing_explicit_instantiation
> 0, 0);
645 --processing_explicit_instantiation
;
648 /* The TYPE is being declared. If it is a template type, that means it
649 is a partial specialization. Do appropriate error-checking. */
652 maybe_process_partial_specialization (type
)
655 if (IS_AGGR_TYPE (type
) && CLASSTYPE_USE_TEMPLATE (type
))
657 if (CLASSTYPE_IMPLICIT_INSTANTIATION (type
)
658 && TYPE_SIZE (type
) == NULL_TREE
)
660 if (current_namespace
661 != decl_namespace_context (CLASSTYPE_TI_TEMPLATE (type
)))
663 cp_pedwarn ("specializing `%#T' in different namespace", type
);
664 cp_pedwarn_at (" from definition of `%#D'",
665 CLASSTYPE_TI_TEMPLATE (type
));
667 SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (type
);
668 if (processing_template_decl
)
669 push_template_decl (TYPE_MAIN_DECL (type
));
671 else if (CLASSTYPE_TEMPLATE_INSTANTIATION (type
))
672 cp_error ("specialization of `%T' after instantiation", type
);
674 else if (processing_specialization
)
675 cp_error ("explicit specialization of non-template `%T'", type
);
678 /* Retrieve the specialization (in the sense of [temp.spec] - a
679 specialization is either an instantiation or an explicit
680 specialization) of TMPL for the given template ARGS. If there is
681 no such specialization, return NULL_TREE. The ARGS are a vector of
682 arguments, or a vector of vectors of arguments, in the case of
683 templates with more than one level of parameters. */
686 retrieve_specialization (tmpl
, args
)
692 my_friendly_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
, 0);
694 /* There should be as many levels of arguments as there are
695 levels of parameters. */
696 my_friendly_assert (TMPL_ARGS_DEPTH (args
)
697 == TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
)),
700 for (s
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
703 if (comp_template_args (TREE_PURPOSE (s
), args
))
704 return TREE_VALUE (s
);
709 /* Like retrieve_speciailization, but for local declarations. FN is
710 the function in which we are looking for an instantiation. */
713 retrieve_local_specialization (tmpl
, fn
)
717 tree s
= purpose_member (fn
, DECL_TEMPLATE_SPECIALIZATIONS (tmpl
));
718 return s
? TREE_VALUE (s
) : NULL_TREE
;
721 /* Returns non-zero iff DECL is a specialization of TMPL. */
724 is_specialization_of (decl
, tmpl
)
730 if (TREE_CODE (decl
) == FUNCTION_DECL
)
734 t
= DECL_TEMPLATE_INFO (t
) ? DECL_TI_TEMPLATE (t
) : NULL_TREE
)
740 my_friendly_assert (TREE_CODE (decl
) == TYPE_DECL
, 0);
742 for (t
= TREE_TYPE (decl
);
744 t
= CLASSTYPE_USE_TEMPLATE (t
)
745 ? TREE_TYPE (CLASSTYPE_TI_TEMPLATE (t
)) : NULL_TREE
)
746 if (same_type_p (TYPE_MAIN_VARIANT (t
),
747 TYPE_MAIN_VARIANT (TREE_TYPE (tmpl
))))
754 /* Register the specialization SPEC as a specialization of TMPL with
755 the indicated ARGS. Returns SPEC, or an equivalent prior
756 declaration, if available. */
759 register_specialization (spec
, tmpl
, args
)
766 my_friendly_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
, 0);
768 if (TREE_CODE (spec
) == FUNCTION_DECL
769 && uses_template_parms (DECL_TI_ARGS (spec
)))
770 /* This is the FUNCTION_DECL for a partial instantiation. Don't
771 register it; we want the corresponding TEMPLATE_DECL instead.
772 We use `uses_template_parms (DECL_TI_ARGS (spec))' rather than
773 the more obvious `uses_template_parms (spec)' to avoid problems
774 with default function arguments. In particular, given
777 template <class T> void f(T t1, T t = T())
779 the default argument expression is not substituted for in an
780 instantiation unless and until it is actually needed. */
783 /* There should be as many levels of arguments as there are
784 levels of parameters. */
785 my_friendly_assert (TMPL_ARGS_DEPTH (args
)
786 == TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
)),
789 for (s
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
793 tree fn
= TREE_VALUE (s
);
795 /* We can sometimes try to re-register a specialization that we've
796 already got. In particular, regenerate_decl_from_template
797 calls duplicate_decls which will update the specialization
798 list. But, we'll still get called again here anyhow. It's
799 more convenient to simply allow this than to try to prevent it. */
802 else if (comp_template_args (TREE_PURPOSE (s
), args
))
804 if (DECL_TEMPLATE_SPECIALIZATION (spec
))
806 if (DECL_TEMPLATE_INSTANTIATION (fn
))
809 || DECL_EXPLICIT_INSTANTIATION (fn
))
811 cp_error ("specialization of %D after instantiation",
817 /* This situation should occur only if the first
818 specialization is an implicit instantiation,
819 the second is an explicit specialization, and
820 the implicit instantiation has not yet been
821 used. That situation can occur if we have
822 implicitly instantiated a member function and
823 then specialized it later.
825 We can also wind up here if a friend
826 declaration that looked like an instantiation
827 turns out to be a specialization:
829 template <class T> void foo(T);
830 class S { friend void foo<>(int) };
831 template <> void foo(int);
833 We transform the existing DECL in place so that
834 any pointers to it become pointers to the
837 If there was a definition for the template, but
838 not for the specialization, we want this to
839 look as if there is no definition, and vice
841 DECL_INITIAL (fn
) = NULL_TREE
;
842 duplicate_decls (spec
, fn
);
847 else if (DECL_TEMPLATE_SPECIALIZATION (fn
))
849 duplicate_decls (spec
, fn
);
856 DECL_TEMPLATE_SPECIALIZATIONS (tmpl
)
857 = tree_cons (args
, spec
, DECL_TEMPLATE_SPECIALIZATIONS (tmpl
));
862 /* Unregister the specialization SPEC as a specialization of TMPL.
863 Returns nonzero if the SPEC was listed as a specialization of
867 unregister_specialization (spec
, tmpl
)
873 for (s
= &DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
875 s
= &TREE_CHAIN (*s
))
876 if (TREE_VALUE (*s
) == spec
)
878 *s
= TREE_CHAIN (*s
);
885 /* Like register_specialization, but for local declarations. FN is
886 the function in which we are registering SPEC, an instantiation of
890 register_local_specialization (spec
, tmpl
, fn
)
895 DECL_TEMPLATE_SPECIALIZATIONS (tmpl
)
896 = tree_cons (fn
, spec
, DECL_TEMPLATE_SPECIALIZATIONS (tmpl
));
901 /* Print the list of candidate FNS in an error message. */
904 print_candidates (fns
)
909 const char *str
= "candidates are:";
911 for (fn
= fns
; fn
!= NULL_TREE
; fn
= TREE_CHAIN (fn
))
915 for (f
= TREE_VALUE (fn
); f
; f
= OVL_NEXT (f
))
916 cp_error_at ("%s %+#D", str
, OVL_CURRENT (f
));
921 /* Returns the template (one of the functions given by TEMPLATE_ID)
922 which can be specialized to match the indicated DECL with the
923 explicit template args given in TEMPLATE_ID. The DECL may be
924 NULL_TREE if none is available. In that case, the functions in
925 TEMPLATE_ID are non-members.
927 If NEED_MEMBER_TEMPLATE is non-zero the function is known to be a
928 specialization of a member template.
930 The template args (those explicitly specified and those deduced)
931 are output in a newly created vector *TARGS_OUT.
933 If it is impossible to determine the result, an error message is
934 issued. The error_mark_node is returned to indicate failure. */
937 determine_specialization (template_id
, decl
, targs_out
,
938 need_member_template
)
942 int need_member_template
;
947 tree candidates
= NULL_TREE
;
948 tree templates
= NULL_TREE
;
950 *targs_out
= NULL_TREE
;
952 if (template_id
== error_mark_node
)
953 return error_mark_node
;
955 fns
= TREE_OPERAND (template_id
, 0);
956 explicit_targs
= TREE_OPERAND (template_id
, 1);
958 if (fns
== error_mark_node
)
959 return error_mark_node
;
961 /* Check for baselinks. */
962 if (BASELINK_P (fns
))
963 fns
= TREE_VALUE (fns
);
965 if (!is_overloaded_fn (fns
))
967 cp_error ("`%D' is not a function template", fns
);
968 return error_mark_node
;
971 for (; fns
; fns
= OVL_NEXT (fns
))
975 tree fn
= OVL_CURRENT (fns
);
977 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
978 /* DECL might be a specialization of FN. */
980 else if (need_member_template
)
981 /* FN is an ordinary member function, and we need a
982 specialization of a member template. */
984 else if (TREE_CODE (fn
) != FUNCTION_DECL
)
985 /* We can get IDENTIFIER_NODEs here in certain erroneous
988 else if (!DECL_FUNCTION_MEMBER_P (fn
))
989 /* This is just an ordinary non-member function. Nothing can
990 be a specialization of that. */
996 /* This is an ordinary member function. However, since
997 we're here, we can assume it's enclosing class is a
998 template class. For example,
1000 template <typename T> struct S { void f(); };
1001 template <> void S<int>::f() {}
1003 Here, S<int>::f is a non-template, but S<int> is a
1004 template class. If FN has the same type as DECL, we
1005 might be in business. */
1006 if (!same_type_p (TREE_TYPE (TREE_TYPE (decl
)),
1007 TREE_TYPE (TREE_TYPE (fn
))))
1008 /* The return types differ. */
1011 /* Adjust the type of DECL in case FN is a static member. */
1012 decl_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
1013 if (DECL_STATIC_FUNCTION_P (fn
)
1014 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
1015 decl_arg_types
= TREE_CHAIN (decl_arg_types
);
1017 if (compparms (TYPE_ARG_TYPES (TREE_TYPE (fn
)),
1020 candidates
= tree_cons (NULL_TREE
, fn
, candidates
);
1025 /* See whether this function might be a specialization of this
1027 targs
= get_bindings (tmpl
, decl
, explicit_targs
);
1030 /* We cannot deduce template arguments that when used to
1031 specialize TMPL will produce DECL. */
1034 /* Save this template, and the arguments deduced. */
1035 templates
= tree_cons (targs
, tmpl
, templates
);
1038 if (templates
&& TREE_CHAIN (templates
))
1044 It is possible for a specialization with a given function
1045 signature to be instantiated from more than one function
1046 template. In such cases, explicit specification of the
1047 template arguments must be used to uniquely identify the
1048 function template specialization being specialized.
1050 Note that here, there's no suggestion that we're supposed to
1051 determine which of the candidate templates is most
1052 specialized. However, we, also have:
1056 Partial ordering of overloaded function template
1057 declarations is used in the following contexts to select
1058 the function template to which a function template
1059 specialization refers:
1061 -- when an explicit specialization refers to a function
1064 So, we do use the partial ordering rules, at least for now.
1065 This extension can only serve to make illegal programs legal,
1066 so it's safe. And, there is strong anecdotal evidence that
1067 the committee intended the partial ordering rules to apply;
1068 the EDG front-end has that behavior, and John Spicer claims
1069 that the committee simply forgot to delete the wording in
1070 [temp.expl.spec]. */
1071 tree tmpl
= most_specialized (templates
, decl
, explicit_targs
);
1072 if (tmpl
&& tmpl
!= error_mark_node
)
1074 targs
= get_bindings (tmpl
, decl
, explicit_targs
);
1075 templates
= tree_cons (targs
, tmpl
, NULL_TREE
);
1079 if (templates
== NULL_TREE
&& candidates
== NULL_TREE
)
1081 cp_error_at ("template-id `%D' for `%+D' does not match any template declaration",
1083 return error_mark_node
;
1085 else if ((templates
&& TREE_CHAIN (templates
))
1086 || (candidates
&& TREE_CHAIN (candidates
))
1087 || (templates
&& candidates
))
1089 cp_error_at ("ambiguous template specialization `%D' for `%+D'",
1091 chainon (candidates
, templates
);
1092 print_candidates (candidates
);
1093 return error_mark_node
;
1096 /* We have one, and exactly one, match. */
1099 /* It was a specialization of an ordinary member function in a
1101 *targs_out
= copy_node (DECL_TI_ARGS (TREE_VALUE (candidates
)));
1102 return DECL_TI_TEMPLATE (TREE_VALUE (candidates
));
1105 /* It was a specialization of a template. */
1106 targs
= DECL_TI_ARGS (DECL_RESULT (TREE_VALUE (templates
)));
1107 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (targs
))
1109 *targs_out
= copy_node (targs
);
1110 SET_TMPL_ARGS_LEVEL (*targs_out
,
1111 TMPL_ARGS_DEPTH (*targs_out
),
1112 TREE_PURPOSE (templates
));
1115 *targs_out
= TREE_PURPOSE (templates
);
1116 return TREE_VALUE (templates
);
1119 /* Check to see if the function just declared, as indicated in
1120 DECLARATOR, and in DECL, is a specialization of a function
1121 template. We may also discover that the declaration is an explicit
1122 instantiation at this point.
1124 Returns DECL, or an equivalent declaration that should be used
1125 instead if all goes well. Issues an error message if something is
1126 amiss. Returns error_mark_node if the error is not easily
1129 FLAGS is a bitmask consisting of the following flags:
1131 2: The function has a definition.
1132 4: The function is a friend.
1134 The TEMPLATE_COUNT is the number of references to qualifying
1135 template classes that appeared in the name of the function. For
1138 template <class T> struct S { void f(); };
1141 the TEMPLATE_COUNT would be 1. However, explicitly specialized
1142 classes are not counted in the TEMPLATE_COUNT, so that in
1144 template <class T> struct S {};
1145 template <> struct S<int> { void f(); }
1146 template <> void S<int>::f();
1148 the TEMPLATE_COUNT would be 0. (Note that this declaration is
1149 illegal; there should be no template <>.)
1151 If the function is a specialization, it is marked as such via
1152 DECL_TEMPLATE_SPECIALIZATION. Furthermore, its DECL_TEMPLATE_INFO
1153 is set up correctly, and it is added to the list of specializations
1154 for that template. */
1157 check_explicit_specialization (declarator
, decl
, template_count
, flags
)
1163 int have_def
= flags
& 2;
1164 int is_friend
= flags
& 4;
1165 int specialization
= 0;
1166 int explicit_instantiation
= 0;
1167 int member_specialization
= 0;
1169 tree ctype
= DECL_CLASS_CONTEXT (decl
);
1170 tree dname
= DECL_NAME (decl
);
1172 if (processing_specialization
)
1174 /* The last template header was of the form template <>. */
1176 if (template_header_count
> template_count
)
1178 /* There were more template headers than qualifying template
1180 if (template_header_count
- template_count
> 1)
1181 /* There shouldn't be that many template parameter lists.
1182 There can be at most one parameter list for every
1183 qualifying class, plus one for the function itself. */
1184 cp_error ("too many template parameter lists in declaration of `%D'", decl
);
1186 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
1188 member_specialization
= 1;
1192 else if (template_header_count
== template_count
)
1194 /* The counts are equal. So, this might be a
1195 specialization, but it is not a specialization of a
1196 member template. It might be something like
1198 template <class T> struct S {
1202 void S<int>::f(int i) {} */
1204 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
1208 /* This cannot be an explicit specialization. There are not
1209 enough headers for all of the qualifying classes. For
1210 example, we might have:
1213 void S<int>::T<char>::f();
1215 But, we're missing another template <>. */
1216 cp_error("too few template parameter lists in declaration of `%D'", decl
);
1220 else if (processing_explicit_instantiation
)
1222 if (template_header_count
)
1223 cp_error ("template parameter list used in explicit instantiation");
1226 cp_error ("definition provided for explicit instantiation");
1228 explicit_instantiation
= 1;
1230 else if (ctype
!= NULL_TREE
1231 && !TYPE_BEING_DEFINED (ctype
)
1232 && CLASSTYPE_TEMPLATE_INSTANTIATION (ctype
)
1235 /* This case catches outdated code that looks like this:
1237 template <class T> struct S { void f(); };
1238 void S<int>::f() {} // Missing template <>
1240 We disable this check when the type is being defined to
1241 avoid complaining about default compiler-generated
1242 constructors, destructors, and assignment operators.
1243 Since the type is an instantiation, not a specialization,
1244 these are the only functions that can be defined before
1245 the class is complete. */
1248 template <class T> void S<int>::f() {}
1250 if (template_header_count
)
1252 cp_error ("template parameters specified in specialization");
1258 ("explicit specialization not preceded by `template <>'");
1260 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
1262 else if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
1265 /* This could be something like:
1267 template <class T> void f(T);
1268 class S { friend void f<>(int); } */
1272 /* This case handles bogus declarations like template <>
1273 template <class T> void f<int>(); */
1275 cp_error ("template-id `%D' in declaration of primary template",
1281 if (specialization
|| member_specialization
)
1283 tree t
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
1284 for (; t
; t
= TREE_CHAIN (t
))
1285 if (TREE_PURPOSE (t
))
1288 ("default argument specified in explicit specialization");
1291 if (current_lang_name
== lang_name_c
)
1292 cp_error ("template specialization with C linkage");
1295 if (specialization
|| member_specialization
|| explicit_instantiation
)
1297 tree tmpl
= NULL_TREE
;
1298 tree targs
= NULL_TREE
;
1300 /* Make sure that the declarator is a TEMPLATE_ID_EXPR. */
1301 if (TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
1305 my_friendly_assert (TREE_CODE (declarator
) == IDENTIFIER_NODE
,
1308 fns
= IDENTIFIER_NAMESPACE_VALUE (dname
);
1313 lookup_template_function (fns
, NULL_TREE
);
1316 if (declarator
== error_mark_node
)
1317 return error_mark_node
;
1319 if (ctype
!= NULL_TREE
&& TYPE_BEING_DEFINED (ctype
))
1321 if (!explicit_instantiation
)
1322 /* A specialization in class scope. This is illegal,
1323 but the error will already have been flagged by
1324 check_specialization_scope. */
1325 return error_mark_node
;
1328 /* It's not legal to write an explicit instantiation in
1331 class C { template void f(); }
1333 This case is caught by the parser. However, on
1336 template class C { void f(); };
1338 (which is illegal) we can get here. The error will be
1345 else if (TREE_CODE (TREE_OPERAND (declarator
, 0)) == LOOKUP_EXPR
)
1347 /* A friend declaration. We can't do much, because we don't
1348 know what this resolves to, yet. */
1349 my_friendly_assert (is_friend
!= 0, 0);
1350 my_friendly_assert (!explicit_instantiation
, 0);
1351 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
1354 else if (ctype
!= NULL_TREE
1355 && (TREE_CODE (TREE_OPERAND (declarator
, 0)) ==
1358 /* Find the list of functions in ctype that have the same
1359 name as the declared function. */
1360 tree name
= TREE_OPERAND (declarator
, 0);
1361 tree fns
= NULL_TREE
;
1364 if (name
== constructor_name (ctype
)
1365 || name
== constructor_name_full (ctype
))
1367 int is_constructor
= DECL_CONSTRUCTOR_P (decl
);
1369 if (is_constructor
? !TYPE_HAS_CONSTRUCTOR (ctype
)
1370 : !TYPE_HAS_DESTRUCTOR (ctype
))
1372 /* From [temp.expl.spec]:
1374 If such an explicit specialization for the member
1375 of a class template names an implicitly-declared
1376 special member function (clause _special_), the
1377 program is ill-formed.
1379 Similar language is found in [temp.explicit]. */
1380 cp_error ("specialization of implicitly-declared special member function");
1381 return error_mark_node
;
1384 name
= is_constructor
? ctor_identifier
: dtor_identifier
;
1387 if (!IDENTIFIER_TYPENAME_P (name
))
1389 idx
= lookup_fnfields_1 (ctype
, name
);
1391 fns
= TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (ctype
), idx
);
1397 /* For a type-conversion operator, we cannot do a
1398 name-based lookup. We might be looking for `operator
1399 int' which will be a specialization of `operator T'.
1400 So, we find *all* the conversion operators, and then
1401 select from them. */
1404 methods
= CLASSTYPE_METHOD_VEC (ctype
);
1406 for (idx
= 2; idx
< TREE_VEC_LENGTH (methods
); ++idx
)
1408 tree ovl
= TREE_VEC_ELT (methods
, idx
);
1410 if (!ovl
|| !DECL_CONV_FN_P (OVL_CURRENT (ovl
)))
1411 /* There are no more conversion functions. */
1414 /* Glue all these conversion functions together
1415 with those we already have. */
1416 for (; ovl
; ovl
= OVL_NEXT (ovl
))
1417 fns
= ovl_cons (OVL_CURRENT (ovl
), fns
);
1421 if (fns
== NULL_TREE
)
1423 cp_error ("no member function `%D' declared in `%T'",
1425 return error_mark_node
;
1428 TREE_OPERAND (declarator
, 0) = fns
;
1431 /* Figure out what exactly is being specialized at this point.
1432 Note that for an explicit instantiation, even one for a
1433 member function, we cannot tell apriori whether the
1434 instantiation is for a member template, or just a member
1435 function of a template class. Even if a member template is
1436 being instantiated, the member template arguments may be
1437 elided if they can be deduced from the rest of the
1439 tmpl
= determine_specialization (declarator
, decl
,
1441 member_specialization
);
1443 if (!tmpl
|| tmpl
== error_mark_node
)
1444 /* We couldn't figure out what this declaration was
1446 return error_mark_node
;
1449 tree gen_tmpl
= most_general_template (tmpl
);
1451 if (explicit_instantiation
)
1453 /* We don't set DECL_EXPLICIT_INSTANTIATION here; that
1454 is done by do_decl_instantiation later. */
1456 int arg_depth
= TMPL_ARGS_DEPTH (targs
);
1457 int parm_depth
= TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
));
1459 if (arg_depth
> parm_depth
)
1461 /* If TMPL is not the most general template (for
1462 example, if TMPL is a friend template that is
1463 injected into namespace scope), then there will
1464 be too many levels fo TARGS. Remove some of them
1469 new_targs
= make_tree_vec (parm_depth
);
1470 for (i
= arg_depth
- parm_depth
; i
< arg_depth
; ++i
)
1471 TREE_VEC_ELT (new_targs
, i
- (arg_depth
- parm_depth
))
1472 = TREE_VEC_ELT (targs
, i
);
1476 decl
= instantiate_template (tmpl
, targs
);
1480 /* If we though that the DECL was a member function, but it
1481 turns out to be specializing a static member function,
1482 make DECL a static member function as well. */
1483 if (DECL_STATIC_FUNCTION_P (tmpl
)
1484 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
1486 revert_static_member_fn (&decl
, 0, 0);
1487 last_function_parms
= TREE_CHAIN (last_function_parms
);
1490 /* Set up the DECL_TEMPLATE_INFO for DECL. */
1491 DECL_TEMPLATE_INFO (decl
) = tree_cons (tmpl
, targs
, NULL_TREE
);
1493 /* Mangle the function name appropriately. Note that we do
1494 not mangle specializations of non-template member
1495 functions of template classes, e.g. with
1497 template <class T> struct S { void f(); }
1499 and given the specialization
1501 template <> void S<int>::f() {}
1503 we do not mangle S<int>::f() here. That's because it's
1504 just an ordinary member function and doesn't need special
1505 treatment. We do this here so that the ordinary,
1506 non-template, name-mangling algorith will not be used
1508 if ((is_member_template (tmpl
) || ctype
== NULL_TREE
)
1509 && name_mangling_version
>= 1)
1510 set_mangled_name_for_template_decl (decl
);
1512 if (is_friend
&& !have_def
)
1513 /* This is not really a declaration of a specialization.
1514 It's just the name of an instantiation. But, it's not
1515 a request for an instantiation, either. */
1516 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
1518 /* Register this specialization so that we can find it
1520 decl
= register_specialization (decl
, gen_tmpl
, targs
);
1527 /* TYPE is being declared. Verify that the use of template headers
1528 and such is reasonable. Issue error messages if not. */
1531 maybe_check_template_type (type
)
1534 if (template_header_count
)
1536 /* We are in the scope of some `template <...>' header. */
1539 = template_class_depth_real (TYPE_CONTEXT (type
),
1540 /*count_specializations=*/1);
1542 if (template_header_count
<= context_depth
)
1543 /* This is OK; the template headers are for the context. We
1544 are actually too lenient here; like
1545 check_explicit_specialization we should consider the number
1546 of template types included in the actual declaration. For
1549 template <class T> struct S {
1550 template <class U> template <class V>
1556 template <class T> struct S {
1557 template <class U> struct I;
1560 template <class T> template <class U.
1565 else if (template_header_count
> context_depth
+ 1)
1566 /* There are two many template parameter lists. */
1567 cp_error ("too many template parameter lists in declaration of `%T'", type
);
1571 /* Returns 1 iff PARMS1 and PARMS2 are identical sets of template
1572 parameters. These are represented in the same format used for
1573 DECL_TEMPLATE_PARMS. */
1575 int comp_template_parms (parms1
, parms2
)
1582 if (parms1
== parms2
)
1585 for (p1
= parms1
, p2
= parms2
;
1586 p1
!= NULL_TREE
&& p2
!= NULL_TREE
;
1587 p1
= TREE_CHAIN (p1
), p2
= TREE_CHAIN (p2
))
1589 tree t1
= TREE_VALUE (p1
);
1590 tree t2
= TREE_VALUE (p2
);
1593 my_friendly_assert (TREE_CODE (t1
) == TREE_VEC
, 0);
1594 my_friendly_assert (TREE_CODE (t2
) == TREE_VEC
, 0);
1596 if (TREE_VEC_LENGTH (t1
) != TREE_VEC_LENGTH (t2
))
1599 for (i
= 0; i
< TREE_VEC_LENGTH (t2
); ++i
)
1601 tree parm1
= TREE_VALUE (TREE_VEC_ELT (t1
, i
));
1602 tree parm2
= TREE_VALUE (TREE_VEC_ELT (t2
, i
));
1604 if (TREE_CODE (parm1
) != TREE_CODE (parm2
))
1607 if (TREE_CODE (parm1
) == TEMPLATE_TYPE_PARM
)
1609 else if (!same_type_p (TREE_TYPE (parm1
), TREE_TYPE (parm2
)))
1614 if ((p1
!= NULL_TREE
) != (p2
!= NULL_TREE
))
1615 /* One set of parameters has more parameters lists than the
1622 /* Complain if DECL shadows a template parameter.
1624 [temp.local]: A template-parameter shall not be redeclared within its
1625 scope (including nested scopes). */
1628 check_template_shadow (decl
)
1633 /* If we're not in a template, we can't possibly shadow a template
1635 if (!current_template_parms
)
1638 /* Figure out what we're shadowing. */
1639 if (TREE_CODE (decl
) == OVERLOAD
)
1640 decl
= OVL_CURRENT (decl
);
1641 olddecl
= IDENTIFIER_VALUE (DECL_NAME (decl
));
1643 /* If there's no previous binding for this name, we're not shadowing
1644 anything, let alone a template parameter. */
1648 /* If we're not shadowing a template parameter, we're done. Note
1649 that OLDDECL might be an OVERLOAD (or perhaps even an
1650 ERROR_MARK), so we can't just blithely assume it to be a _DECL
1652 if (TREE_CODE_CLASS (TREE_CODE (olddecl
)) != 'd'
1653 || !DECL_TEMPLATE_PARM_P (olddecl
))
1656 /* We check for decl != olddecl to avoid bogus errors for using a
1657 name inside a class. We check TPFI to avoid duplicate errors for
1658 inline member templates. */
1660 || TEMPLATE_PARMS_FOR_INLINE (current_template_parms
))
1663 cp_error_at ("declaration of `%#D'", decl
);
1664 cp_error_at (" shadows template parm `%#D'", olddecl
);
1667 /* Return a new TEMPLATE_PARM_INDEX with the indicated INDEX, LEVEL,
1668 ORIG_LEVEL, DECL, and TYPE. */
1671 build_template_parm_index (index
, level
, orig_level
, decl
, type
)
1678 tree t
= make_node (TEMPLATE_PARM_INDEX
);
1679 TEMPLATE_PARM_IDX (t
) = index
;
1680 TEMPLATE_PARM_LEVEL (t
) = level
;
1681 TEMPLATE_PARM_ORIG_LEVEL (t
) = orig_level
;
1682 TEMPLATE_PARM_DECL (t
) = decl
;
1683 TREE_TYPE (t
) = type
;
1688 /* Return a TEMPLATE_PARM_INDEX, similar to INDEX, but whose
1689 TEMPLATE_PARM_LEVEL has been decreased by LEVELS. If such a
1690 TEMPLATE_PARM_INDEX already exists, it is returned; otherwise, a
1691 new one is created. */
1694 reduce_template_parm_level (index
, type
, levels
)
1699 if (TEMPLATE_PARM_DESCENDANTS (index
) == NULL_TREE
1700 || (TEMPLATE_PARM_LEVEL (TEMPLATE_PARM_DESCENDANTS (index
))
1701 != TEMPLATE_PARM_LEVEL (index
) - levels
))
1704 = build_decl (TREE_CODE (TEMPLATE_PARM_DECL (index
)),
1705 DECL_NAME (TEMPLATE_PARM_DECL (index
)),
1708 = build_template_parm_index (TEMPLATE_PARM_IDX (index
),
1709 TEMPLATE_PARM_LEVEL (index
) - levels
,
1710 TEMPLATE_PARM_ORIG_LEVEL (index
),
1712 TEMPLATE_PARM_DESCENDANTS (index
) = t
;
1714 /* Template template parameters need this. */
1715 DECL_TEMPLATE_PARMS (decl
)
1716 = DECL_TEMPLATE_PARMS (TEMPLATE_PARM_DECL (index
));
1719 return TEMPLATE_PARM_DESCENDANTS (index
);
1722 /* Process information from new template parameter NEXT and append it to the
1723 LIST being built. */
1726 process_template_parm (list
, next
)
1735 my_friendly_assert (TREE_CODE (parm
) == TREE_LIST
, 259);
1736 defval
= TREE_PURPOSE (parm
);
1737 parm
= TREE_VALUE (parm
);
1738 is_type
= TREE_PURPOSE (parm
) == class_type_node
;
1742 tree p
= TREE_VALUE (tree_last (list
));
1744 if (TREE_CODE (p
) == TYPE_DECL
)
1745 idx
= TEMPLATE_TYPE_IDX (TREE_TYPE (p
));
1746 else if (TREE_CODE (p
) == TEMPLATE_DECL
)
1747 idx
= TEMPLATE_TYPE_IDX (TREE_TYPE (DECL_TEMPLATE_RESULT (p
)));
1749 idx
= TEMPLATE_PARM_IDX (DECL_INITIAL (p
));
1757 my_friendly_assert (TREE_CODE (TREE_PURPOSE (parm
)) == TREE_LIST
, 260);
1758 /* is a const-param */
1759 parm
= grokdeclarator (TREE_VALUE (parm
), TREE_PURPOSE (parm
),
1760 PARM
, 0, NULL_TREE
);
1764 The top-level cv-qualifiers on the template-parameter are
1765 ignored when determining its type. */
1766 TREE_TYPE (parm
) = TYPE_MAIN_VARIANT (TREE_TYPE (parm
));
1768 /* A template parameter is not modifiable. */
1769 TREE_READONLY (parm
) = 1;
1770 if (IS_AGGR_TYPE (TREE_TYPE (parm
))
1771 && TREE_CODE (TREE_TYPE (parm
)) != TEMPLATE_TYPE_PARM
1772 && TREE_CODE (TREE_TYPE (parm
)) != TYPENAME_TYPE
)
1774 cp_error ("`%#T' is not a valid type for a template constant parameter",
1776 if (DECL_NAME (parm
) == NULL_TREE
)
1777 error (" a template type parameter must begin with `class' or `typename'");
1778 TREE_TYPE (parm
) = void_type_node
;
1781 && (TREE_CODE (TREE_TYPE (parm
)) == REAL_TYPE
1782 || TREE_CODE (TREE_TYPE (parm
)) == COMPLEX_TYPE
))
1783 cp_pedwarn ("`%T' is not a valid type for a template constant parameter",
1785 decl
= build_decl (CONST_DECL
, DECL_NAME (parm
), TREE_TYPE (parm
));
1786 DECL_INITIAL (parm
) = DECL_INITIAL (decl
)
1787 = build_template_parm_index (idx
, processing_template_decl
,
1788 processing_template_decl
,
1789 decl
, TREE_TYPE (parm
));
1794 parm
= TREE_VALUE (parm
);
1796 if (parm
&& TREE_CODE (parm
) == TEMPLATE_DECL
)
1798 t
= make_aggr_type (TEMPLATE_TEMPLATE_PARM
);
1799 /* This is for distinguishing between real templates and template
1800 template parameters */
1801 TREE_TYPE (parm
) = t
;
1802 TREE_TYPE (DECL_TEMPLATE_RESULT (parm
)) = t
;
1807 t
= make_aggr_type (TEMPLATE_TYPE_PARM
);
1808 /* parm is either IDENTIFIER_NODE or NULL_TREE */
1809 decl
= build_decl (TYPE_DECL
, parm
, t
);
1812 TYPE_NAME (t
) = decl
;
1813 TYPE_STUB_DECL (t
) = decl
;
1815 TEMPLATE_TYPE_PARM_INDEX (t
)
1816 = build_template_parm_index (idx
, processing_template_decl
,
1817 processing_template_decl
,
1818 decl
, TREE_TYPE (parm
));
1820 SET_DECL_ARTIFICIAL (decl
);
1821 SET_DECL_TEMPLATE_PARM_P (decl
);
1823 parm
= build_tree_list (defval
, parm
);
1824 return chainon (list
, parm
);
1827 /* The end of a template parameter list has been reached. Process the
1828 tree list into a parameter vector, converting each parameter into a more
1829 useful form. Type parameters are saved as IDENTIFIER_NODEs, and others
1833 end_template_parm_list (parms
)
1838 tree saved_parmlist
= make_tree_vec (list_length (parms
));
1840 current_template_parms
1841 = tree_cons (build_int_2 (0, processing_template_decl
),
1842 saved_parmlist
, current_template_parms
);
1844 for (parm
= parms
, nparms
= 0;
1846 parm
= TREE_CHAIN (parm
), nparms
++)
1847 TREE_VEC_ELT (saved_parmlist
, nparms
) = parm
;
1849 --processing_template_parmlist
;
1851 return saved_parmlist
;
1854 /* end_template_decl is called after a template declaration is seen. */
1857 end_template_decl ()
1859 reset_specialization ();
1861 if (! processing_template_decl
)
1864 /* This matches the pushlevel in begin_template_parm_list. */
1867 --processing_template_decl
;
1868 current_template_parms
= TREE_CHAIN (current_template_parms
);
1869 (void) get_pending_sizes (); /* Why? */
1872 /* Given a template argument vector containing the template PARMS.
1873 The innermost PARMS are given first. */
1876 current_template_args ()
1879 tree args
= NULL_TREE
;
1880 int length
= TMPL_PARMS_DEPTH (current_template_parms
);
1883 /* If there is only one level of template parameters, we do not
1884 create a TREE_VEC of TREE_VECs. Instead, we return a single
1885 TREE_VEC containing the arguments. */
1887 args
= make_tree_vec (length
);
1889 for (header
= current_template_parms
; header
; header
= TREE_CHAIN (header
))
1891 tree a
= copy_node (TREE_VALUE (header
));
1894 TREE_TYPE (a
) = NULL_TREE
;
1895 for (i
= TREE_VEC_LENGTH (a
) - 1; i
>= 0; --i
)
1897 tree t
= TREE_VEC_ELT (a
, i
);
1899 /* T will be a list if we are called from within a
1900 begin/end_template_parm_list pair, but a vector directly
1901 if within a begin/end_member_template_processing pair. */
1902 if (TREE_CODE (t
) == TREE_LIST
)
1906 if (TREE_CODE (t
) == TYPE_DECL
1907 || TREE_CODE (t
) == TEMPLATE_DECL
)
1910 t
= DECL_INITIAL (t
);
1911 TREE_VEC_ELT (a
, i
) = t
;
1916 TREE_VEC_ELT (args
, --l
) = a
;
1924 /* Return a TEMPLATE_DECL corresponding to DECL, using the indicated
1925 template PARMS. Used by push_template_decl below. */
1928 build_template_decl (decl
, parms
)
1932 tree tmpl
= build_lang_decl (TEMPLATE_DECL
, DECL_NAME (decl
), NULL_TREE
);
1933 DECL_TEMPLATE_PARMS (tmpl
) = parms
;
1934 DECL_CONTEXT (tmpl
) = DECL_CONTEXT (decl
);
1935 if (DECL_LANG_SPECIFIC (decl
))
1937 DECL_CLASS_CONTEXT (tmpl
) = DECL_CLASS_CONTEXT (decl
);
1938 DECL_STATIC_FUNCTION_P (tmpl
) = DECL_STATIC_FUNCTION_P (decl
);
1939 DECL_CONSTRUCTOR_P (tmpl
) = DECL_CONSTRUCTOR_P (decl
);
1940 DECL_NONCONVERTING_P (tmpl
) = DECL_NONCONVERTING_P (decl
);
1946 struct template_parm_data
1948 /* The level of the template parameters we are currently
1952 /* The index of the specialization argument we are currently
1956 /* An array whose size is the number of template parameters. The
1957 elements are non-zero if the parameter has been used in any one
1958 of the arguments processed so far. */
1961 /* An array whose size is the number of template arguments. The
1962 elements are non-zero if the argument makes use of template
1963 parameters of this level. */
1964 int* arg_uses_template_parms
;
1967 /* Subroutine of push_template_decl used to see if each template
1968 parameter in a partial specialization is used in the explicit
1969 argument list. If T is of the LEVEL given in DATA (which is
1970 treated as a template_parm_data*), then DATA->PARMS is marked
1974 mark_template_parm (t
, data
)
1980 struct template_parm_data
* tpd
= (struct template_parm_data
*) data
;
1982 if (TREE_CODE (t
) == TEMPLATE_PARM_INDEX
)
1984 level
= TEMPLATE_PARM_LEVEL (t
);
1985 idx
= TEMPLATE_PARM_IDX (t
);
1989 level
= TEMPLATE_TYPE_LEVEL (t
);
1990 idx
= TEMPLATE_TYPE_IDX (t
);
1993 if (level
== tpd
->level
)
1995 tpd
->parms
[idx
] = 1;
1996 tpd
->arg_uses_template_parms
[tpd
->current_arg
] = 1;
1999 /* Return zero so that for_each_template_parm will continue the
2000 traversal of the tree; we want to mark *every* template parm. */
2004 /* Process the partial specialization DECL. */
2007 process_partial_specialization (decl
)
2010 tree type
= TREE_TYPE (decl
);
2011 tree maintmpl
= CLASSTYPE_TI_TEMPLATE (type
);
2012 tree specargs
= CLASSTYPE_TI_ARGS (type
);
2013 tree inner_args
= innermost_args (specargs
);
2014 tree inner_parms
= INNERMOST_TEMPLATE_PARMS (current_template_parms
);
2015 tree main_inner_parms
= DECL_INNERMOST_TEMPLATE_PARMS (maintmpl
);
2016 int nargs
= TREE_VEC_LENGTH (inner_args
);
2017 int ntparms
= TREE_VEC_LENGTH (inner_parms
);
2019 int did_error_intro
= 0;
2020 struct template_parm_data tpd
;
2021 struct template_parm_data tpd2
;
2023 /* We check that each of the template parameters given in the
2024 partial specialization is used in the argument list to the
2025 specialization. For example:
2027 template <class T> struct S;
2028 template <class T> struct S<T*>;
2030 The second declaration is OK because `T*' uses the template
2031 parameter T, whereas
2033 template <class T> struct S<int>;
2035 is no good. Even trickier is:
2046 The S2<T> declaration is actually illegal; it is a
2047 full-specialization. Of course,
2050 struct S2<T (*)(U)>;
2052 or some such would have been OK. */
2053 tpd
.level
= TMPL_PARMS_DEPTH (current_template_parms
);
2054 tpd
.parms
= alloca (sizeof (int) * ntparms
);
2055 bzero ((PTR
) tpd
.parms
, sizeof (int) * ntparms
);
2057 tpd
.arg_uses_template_parms
= alloca (sizeof (int) * nargs
);
2058 bzero ((PTR
) tpd
.arg_uses_template_parms
, sizeof (int) * nargs
);
2059 for (i
= 0; i
< nargs
; ++i
)
2061 tpd
.current_arg
= i
;
2062 for_each_template_parm (TREE_VEC_ELT (inner_args
, i
),
2063 &mark_template_parm
,
2066 for (i
= 0; i
< ntparms
; ++i
)
2067 if (tpd
.parms
[i
] == 0)
2069 /* One of the template parms was not used in the
2071 if (!did_error_intro
)
2073 cp_error ("template parameters not used in partial specialization:");
2074 did_error_intro
= 1;
2078 TREE_VALUE (TREE_VEC_ELT (inner_parms
, i
)));
2081 /* [temp.class.spec]
2083 The argument list of the specialization shall not be identical to
2084 the implicit argument list of the primary template. */
2085 if (comp_template_args (inner_args
,
2086 innermost_args (CLASSTYPE_TI_ARGS (TREE_TYPE
2088 cp_error ("partial specialization `%T' does not specialize any template arguments", type
);
2090 /* [temp.class.spec]
2092 A partially specialized non-type argument expression shall not
2093 involve template parameters of the partial specialization except
2094 when the argument expression is a simple identifier.
2096 The type of a template parameter corresponding to a specialized
2097 non-type argument shall not be dependent on a parameter of the
2099 my_friendly_assert (nargs
== DECL_NTPARMS (maintmpl
), 0);
2101 for (i
= 0; i
< nargs
; ++i
)
2103 tree arg
= TREE_VEC_ELT (inner_args
, i
);
2104 if (/* These first two lines are the `non-type' bit. */
2105 TREE_CODE_CLASS (TREE_CODE (arg
)) != 't'
2106 && TREE_CODE (arg
) != TEMPLATE_DECL
2107 /* This next line is the `argument expression is not just a
2108 simple identifier' condition and also the `specialized
2109 non-type argument' bit. */
2110 && TREE_CODE (arg
) != TEMPLATE_PARM_INDEX
)
2112 if (tpd
.arg_uses_template_parms
[i
])
2113 cp_error ("template argument `%E' involves template parameter(s)", arg
);
2116 /* Look at the corresponding template parameter,
2117 marking which template parameters its type depends
2120 TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (main_inner_parms
,
2125 /* We haven't yet initialized TPD2. Do so now. */
2126 tpd2
.arg_uses_template_parms
2127 = (int*) alloca (sizeof (int) * nargs
);
2128 /* The number of parameters here is the number in the
2129 main template, which, as checked in the assertion
2131 tpd2
.parms
= (int*) alloca (sizeof (int) * nargs
);
2133 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (maintmpl
));
2136 /* Mark the template parameters. But this time, we're
2137 looking for the template parameters of the main
2138 template, not in the specialization. */
2139 tpd2
.current_arg
= i
;
2140 tpd2
.arg_uses_template_parms
[i
] = 0;
2141 bzero ((PTR
) tpd2
.parms
, sizeof (int) * nargs
);
2142 for_each_template_parm (type
,
2143 &mark_template_parm
,
2146 if (tpd2
.arg_uses_template_parms
[i
])
2148 /* The type depended on some template parameters.
2149 If they are fully specialized in the
2150 specialization, that's OK. */
2152 for (j
= 0; j
< nargs
; ++j
)
2153 if (tpd2
.parms
[j
] != 0
2154 && tpd
.arg_uses_template_parms
[j
])
2156 cp_error ("type `%T' of template argument `%E' depends on template parameter(s)",
2166 if (retrieve_specialization (maintmpl
, specargs
))
2167 /* We've already got this specialization. */
2170 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
) = CLASSTYPE_TI_SPEC_INFO (type
)
2171 = tree_cons (inner_args
, inner_parms
,
2172 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
));
2173 TREE_TYPE (DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)) = type
;
2177 /* Check that a template declaration's use of default arguments is not
2178 invalid. Here, PARMS are the template parameters. IS_PRIMARY is
2179 non-zero if DECL is the thing declared by a primary template.
2180 IS_PARTIAL is non-zero if DECL is a partial specialization. */
2183 check_default_tmpl_args (decl
, parms
, is_primary
, is_partial
)
2190 int last_level_to_check
;
2195 A default template-argument shall not be specified in a
2196 function template declaration or a function template definition, nor
2197 in the template-parameter-list of the definition of a member of a
2200 if (TREE_CODE (DECL_REAL_CONTEXT (decl
)) == FUNCTION_DECL
)
2201 /* You can't have a function template declaration in a local
2202 scope, nor you can you define a member of a class template in a
2206 if (current_class_type
2207 && !TYPE_BEING_DEFINED (current_class_type
)
2208 && DECL_LANG_SPECIFIC (decl
)
2209 /* If this is either a friend defined in the scope of the class
2210 or a member function. */
2211 && DECL_CLASS_CONTEXT (decl
) == current_class_type
2212 /* And, if it was a member function, it really was defined in
2213 the scope of the class. */
2214 && (!DECL_FUNCTION_MEMBER_P (decl
) || DECL_DEFINED_IN_CLASS_P (decl
)))
2215 /* We already checked these parameters when the template was
2216 declared, so there's no need to do it again now. This function
2217 was defined in class scope, but we're processing it's body now
2218 that the class is complete. */
2223 If a template-parameter has a default template-argument, all
2224 subsequent template-parameters shall have a default
2225 template-argument supplied. */
2226 for (parm_level
= parms
; parm_level
; parm_level
= TREE_CHAIN (parm_level
))
2228 tree inner_parms
= TREE_VALUE (parm_level
);
2229 int ntparms
= TREE_VEC_LENGTH (inner_parms
);
2230 int seen_def_arg_p
= 0;
2233 for (i
= 0; i
< ntparms
; ++i
)
2235 tree parm
= TREE_VEC_ELT (inner_parms
, i
);
2236 if (TREE_PURPOSE (parm
))
2238 else if (seen_def_arg_p
)
2240 cp_error ("no default argument for `%D'", TREE_VALUE (parm
));
2241 /* For better subsequent error-recovery, we indicate that
2242 there should have been a default argument. */
2243 TREE_PURPOSE (parm
) = error_mark_node
;
2248 if (TREE_CODE (decl
) != TYPE_DECL
|| is_partial
|| !is_primary
)
2249 /* For an ordinary class template, default template arguments are
2250 allowed at the innermost level, e.g.:
2251 template <class T = int>
2253 but, in a partial specialization, they're not allowed even
2254 there, as we have in [temp.class.spec]:
2256 The template parameter list of a specialization shall not
2257 contain default template argument values.
2259 So, for a partial specialization, or for a function template,
2260 we look at all of them. */
2263 /* But, for a primary class template that is not a partial
2264 specialization we look at all template parameters except the
2266 parms
= TREE_CHAIN (parms
);
2268 /* Figure out what error message to issue. */
2269 if (TREE_CODE (decl
) == FUNCTION_DECL
)
2270 msg
= "default argument for template parameter in function template `%D'";
2271 else if (is_partial
)
2272 msg
= "default argument in partial specialization `%D'";
2274 msg
= "default argument for template parameter for class enclosing `%D'";
2276 if (current_class_type
&& TYPE_BEING_DEFINED (current_class_type
))
2277 /* If we're inside a class definition, there's no need to
2278 examine the parameters to the class itself. On the one
2279 hand, they will be checked when the class is defined, and,
2280 on the other, default arguments are legal in things like:
2281 template <class T = double>
2282 struct S { template <class U> void f(U); };
2283 Here the default argument for `S' has no bearing on the
2284 declaration of `f'. */
2285 last_level_to_check
= template_class_depth (current_class_type
) + 1;
2287 /* Check everything. */
2288 last_level_to_check
= 0;
2290 for (parm_level
= parms
;
2291 parm_level
&& TMPL_PARMS_DEPTH (parm_level
) >= last_level_to_check
;
2292 parm_level
= TREE_CHAIN (parm_level
))
2294 tree inner_parms
= TREE_VALUE (parm_level
);
2298 ntparms
= TREE_VEC_LENGTH (inner_parms
);
2299 for (i
= 0; i
< ntparms
; ++i
)
2300 if (TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)))
2304 cp_error (msg
, decl
);
2308 /* Clear out the default argument so that we are not
2310 TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)) = NULL_TREE
;
2313 /* At this point, if we're still interested in issuing messages,
2314 they must apply to classes surrounding the object declared. */
2316 msg
= "default argument for template parameter for class enclosing `%D'";
2320 /* Creates a TEMPLATE_DECL for the indicated DECL using the template
2321 parameters given by current_template_args, or reuses a
2322 previously existing one, if appropriate. Returns the DECL, or an
2323 equivalent one, if it is replaced via a call to duplicate_decls.
2325 If IS_FRIEND is non-zero, DECL is a friend declaration. */
2328 push_template_decl_real (decl
, is_friend
)
2338 int new_template_p
= 0;
2340 /* See if this is a partial specialization. */
2341 is_partial
= (DECL_IMPLICIT_TYPEDEF_P (decl
)
2342 && TREE_CODE (TREE_TYPE (decl
)) != ENUMERAL_TYPE
2343 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl
)));
2345 is_friend
|= (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_FRIEND_P (decl
));
2348 /* For a friend, we want the context of the friend function, not
2349 the type of which it is a friend. */
2350 ctx
= DECL_CONTEXT (decl
);
2351 else if (DECL_REAL_CONTEXT (decl
)
2352 && TREE_CODE (DECL_REAL_CONTEXT (decl
)) != NAMESPACE_DECL
)
2353 /* In the case of a virtual function, we want the class in which
2355 ctx
= DECL_REAL_CONTEXT (decl
);
2357 /* Otherwise, if we're currently definining some class, the DECL
2358 is assumed to be a member of the class. */
2359 ctx
= current_scope ();
2361 if (ctx
&& TREE_CODE (ctx
) == NAMESPACE_DECL
)
2364 if (!DECL_CONTEXT (decl
))
2365 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
2367 /* See if this is a primary template. */
2368 primary
= pseudo_global_level_p ();
2372 if (current_lang_name
== lang_name_c
)
2373 cp_error ("template with C linkage");
2374 else if (TREE_CODE (decl
) == TYPE_DECL
2375 && ANON_AGGRNAME_P (DECL_NAME (decl
)))
2376 cp_error ("template class without a name");
2377 else if ((DECL_IMPLICIT_TYPEDEF_P (decl
)
2378 && CLASS_TYPE_P (TREE_TYPE (decl
)))
2379 || (TREE_CODE (decl
) == VAR_DECL
&& ctx
&& CLASS_TYPE_P (ctx
))
2380 || TREE_CODE (decl
) == FUNCTION_DECL
)
2383 cp_error ("template declaration of `%#D'", decl
);
2386 /* Check to see that the rules regarding the use of default
2387 arguments are not being violated. */
2388 check_default_tmpl_args (decl
, current_template_parms
,
2389 primary
, is_partial
);
2392 return process_partial_specialization (decl
);
2394 args
= current_template_args ();
2397 || TREE_CODE (ctx
) == FUNCTION_DECL
2398 || TYPE_BEING_DEFINED (ctx
)
2399 || (is_friend
&& !DECL_TEMPLATE_INFO (decl
)))
2401 if (DECL_LANG_SPECIFIC (decl
)
2402 && DECL_TEMPLATE_INFO (decl
)
2403 && DECL_TI_TEMPLATE (decl
))
2404 tmpl
= DECL_TI_TEMPLATE (decl
);
2405 /* If DECL is a TYPE_DECL for a class-template, then there won't
2406 be DECL_LANG_SPECIFIC. The information equivalent to
2407 DECL_TEMPLATE_INFO is found in TYPE_TEMPLATE_INFO instead. */
2408 else if (DECL_IMPLICIT_TYPEDEF_P (decl
)
2409 && TYPE_TEMPLATE_INFO (TREE_TYPE (decl
))
2410 && TYPE_TI_TEMPLATE (TREE_TYPE (decl
)))
2412 /* Since a template declaration already existed for this
2413 class-type, we must be redeclaring it here. Make sure
2414 that the redeclaration is legal. */
2415 redeclare_class_template (TREE_TYPE (decl
),
2416 current_template_parms
);
2417 /* We don't need to create a new TEMPLATE_DECL; just use the
2418 one we already had. */
2419 tmpl
= TYPE_TI_TEMPLATE (TREE_TYPE (decl
));
2423 tmpl
= build_template_decl (decl
, current_template_parms
);
2426 if (DECL_LANG_SPECIFIC (decl
)
2427 && DECL_TEMPLATE_SPECIALIZATION (decl
))
2429 /* A specialization of a member template of a template
2431 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
2432 DECL_TEMPLATE_INFO (tmpl
) = DECL_TEMPLATE_INFO (decl
);
2433 DECL_TEMPLATE_INFO (decl
) = NULL_TREE
;
2439 tree a
, t
, current
, parms
;
2442 if (CLASSTYPE_TEMPLATE_INSTANTIATION (ctx
))
2443 cp_error ("must specialize `%#T' before defining member `%#D'",
2445 if (TREE_CODE (decl
) == TYPE_DECL
)
2447 if ((IS_AGGR_TYPE_CODE (TREE_CODE (TREE_TYPE (decl
)))
2448 || TREE_CODE (TREE_TYPE (decl
)) == ENUMERAL_TYPE
)
2449 && TYPE_TEMPLATE_INFO (TREE_TYPE (decl
))
2450 && TYPE_TI_TEMPLATE (TREE_TYPE (decl
)))
2451 tmpl
= TYPE_TI_TEMPLATE (TREE_TYPE (decl
));
2454 cp_error ("`%D' does not declare a template type", decl
);
2458 else if (! DECL_TEMPLATE_INFO (decl
))
2460 cp_error ("template definition of non-template `%#D'", decl
);
2464 tmpl
= DECL_TI_TEMPLATE (decl
);
2466 if (is_member_template (tmpl
)
2467 && DECL_FUNCTION_TEMPLATE_P (tmpl
)
2468 && DECL_TEMPLATE_INFO (decl
) && DECL_TI_ARGS (decl
)
2469 && DECL_TEMPLATE_SPECIALIZATION (decl
))
2473 /* The declaration is a specialization of a member
2474 template, declared outside the class. Therefore, the
2475 innermost template arguments will be NULL, so we
2476 replace them with the arguments determined by the
2477 earlier call to check_explicit_specialization. */
2478 args
= DECL_TI_ARGS (decl
);
2481 = build_template_decl (decl
, current_template_parms
);
2482 DECL_TEMPLATE_RESULT (new_tmpl
) = decl
;
2483 TREE_TYPE (new_tmpl
) = TREE_TYPE (decl
);
2484 DECL_TI_TEMPLATE (decl
) = new_tmpl
;
2485 SET_DECL_TEMPLATE_SPECIALIZATION (new_tmpl
);
2486 DECL_TEMPLATE_INFO (new_tmpl
)
2487 = tree_cons (tmpl
, args
, NULL_TREE
);
2489 register_specialization (new_tmpl
, tmpl
, args
);
2493 /* Make sure the template headers we got make sense. */
2495 parms
= DECL_TEMPLATE_PARMS (tmpl
);
2496 i
= TMPL_PARMS_DEPTH (parms
);
2497 if (TMPL_ARGS_DEPTH (args
) != i
)
2499 cp_error ("expected %d levels of template parms for `%#D', got %d",
2500 i
, decl
, TMPL_ARGS_DEPTH (args
));
2503 for (current
= decl
; i
> 0; --i
, parms
= TREE_CHAIN (parms
))
2505 a
= TMPL_ARGS_LEVEL (args
, i
);
2506 t
= INNERMOST_TEMPLATE_PARMS (parms
);
2508 if (TREE_VEC_LENGTH (t
) != TREE_VEC_LENGTH (a
))
2510 if (current
== decl
)
2511 cp_error ("got %d template parameters for `%#D'",
2512 TREE_VEC_LENGTH (a
), decl
);
2514 cp_error ("got %d template parameters for `%#T'",
2515 TREE_VEC_LENGTH (a
), current
);
2516 cp_error (" but %d required", TREE_VEC_LENGTH (t
));
2519 /* Perhaps we should also check that the parms are used in the
2520 appropriate qualifying scopes in the declarator? */
2522 if (current
== decl
)
2525 current
= TYPE_CONTEXT (current
);
2529 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
2530 TREE_TYPE (tmpl
) = TREE_TYPE (decl
);
2532 /* Push template declarations for global functions and types. Note
2533 that we do not try to push a global template friend declared in a
2534 template class; such a thing may well depend on the template
2535 parameters of the class. */
2536 if (new_template_p
&& !ctx
2537 && !(is_friend
&& template_class_depth (current_class_type
) > 0))
2538 tmpl
= pushdecl_namespace_level (tmpl
);
2541 DECL_PRIMARY_TEMPLATE (tmpl
) = tmpl
;
2543 info
= tree_cons (tmpl
, args
, NULL_TREE
);
2545 if (DECL_IMPLICIT_TYPEDEF_P (decl
))
2547 SET_TYPE_TEMPLATE_INFO (TREE_TYPE (tmpl
), info
);
2548 if ((!ctx
|| TREE_CODE (ctx
) != FUNCTION_DECL
)
2549 && TREE_CODE (TREE_TYPE (decl
)) != ENUMERAL_TYPE
)
2550 DECL_NAME (decl
) = classtype_mangled_name (TREE_TYPE (decl
));
2552 else if (DECL_LANG_SPECIFIC (decl
))
2553 DECL_TEMPLATE_INFO (decl
) = info
;
2555 return DECL_TEMPLATE_RESULT (tmpl
);
2559 push_template_decl (decl
)
2562 return push_template_decl_real (decl
, 0);
2565 /* Called when a class template TYPE is redeclared with the indicated
2566 template PARMS, e.g.:
2568 template <class T> struct S;
2569 template <class T> struct S {}; */
2572 redeclare_class_template (type
, parms
)
2580 if (!TYPE_TEMPLATE_INFO (type
))
2582 cp_error ("`%T' is not a template type", type
);
2586 tmpl
= TYPE_TI_TEMPLATE (type
);
2587 if (!PRIMARY_TEMPLATE_P (tmpl
))
2588 /* The type is nested in some template class. Nothing to worry
2589 about here; there are no new template parameters for the nested
2593 parms
= INNERMOST_TEMPLATE_PARMS (parms
);
2594 tmpl_parms
= DECL_INNERMOST_TEMPLATE_PARMS (tmpl
);
2596 if (TREE_VEC_LENGTH (parms
) != TREE_VEC_LENGTH (tmpl_parms
))
2598 cp_error_at ("previous declaration `%D'", tmpl
);
2599 cp_error ("used %d template parameter%s instead of %d",
2600 TREE_VEC_LENGTH (tmpl_parms
),
2601 TREE_VEC_LENGTH (tmpl_parms
) == 1 ? "" : "s",
2602 TREE_VEC_LENGTH (parms
));
2606 for (i
= 0; i
< TREE_VEC_LENGTH (tmpl_parms
); ++i
)
2608 tree tmpl_parm
= TREE_VALUE (TREE_VEC_ELT (tmpl_parms
, i
));
2609 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
2610 tree tmpl_default
= TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
));
2611 tree parm_default
= TREE_PURPOSE (TREE_VEC_ELT (parms
, i
));
2613 if (TREE_CODE (tmpl_parm
) != TREE_CODE (parm
))
2615 cp_error_at ("template parameter `%#D'", tmpl_parm
);
2616 cp_error ("redeclared here as `%#D'", parm
);
2620 if (tmpl_default
!= NULL_TREE
&& parm_default
!= NULL_TREE
)
2622 /* We have in [temp.param]:
2624 A template-parameter may not be given default arguments
2625 by two different declarations in the same scope. */
2626 cp_error ("redefinition of default argument for `%#D'", parm
);
2627 cp_error_at (" original definition appeared here", tmpl_parm
);
2631 if (parm_default
!= NULL_TREE
)
2632 /* Update the previous template parameters (which are the ones
2633 that will really count) with the new default value. */
2634 TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
)) = parm_default
;
2635 else if (tmpl_default
!= NULL_TREE
)
2636 /* Update the new parameters, too; they'll be used as the
2637 parameters for any members. */
2638 TREE_PURPOSE (TREE_VEC_ELT (parms
, i
)) = tmpl_default
;
2642 /* Attempt to convert the non-type template parameter EXPR to the
2643 indicated TYPE. If the conversion is successful, return the
2644 converted value. If the conversion is unsuccesful, return
2645 NULL_TREE if we issued an error message, or error_mark_node if we
2646 did not. We issue error messages for out-and-out bad template
2647 parameters, but not simply because the conversion failed, since we
2648 might be just trying to do argument deduction. By the time this
2649 function is called, neither TYPE nor EXPR may make use of template
2653 convert_nontype_argument (type
, expr
)
2657 tree expr_type
= TREE_TYPE (expr
);
2659 /* A template-argument for a non-type, non-template
2660 template-parameter shall be one of:
2662 --an integral constant-expression of integral or enumeration
2665 --the name of a non-type template-parameter; or
2667 --the name of an object or function with external linkage,
2668 including function templates and function template-ids but
2669 excluding non-static class members, expressed as id-expression;
2672 --the address of an object or function with external linkage,
2673 including function templates and function template-ids but
2674 excluding non-static class members, expressed as & id-expression
2675 where the & is optional if the name refers to a function or
2678 --a pointer to member expressed as described in _expr.unary.op_. */
2680 /* An integral constant-expression can include const variables or
2681 enumerators. Simplify things by folding them to their values,
2682 unless we're about to bind the declaration to a reference
2684 if (INTEGRAL_TYPE_P (expr_type
) && TREE_READONLY_DECL_P (expr
)
2685 && TREE_CODE (type
) != REFERENCE_TYPE
)
2686 expr
= decl_constant_value (expr
);
2688 if (is_overloaded_fn (expr
))
2689 /* OK for now. We'll check that it has external linkage later.
2690 Check this first since if expr_type is the unknown_type_node
2691 we would otherwise complain below. */
2693 else if (TYPE_PTRMEM_P (expr_type
)
2694 || TYPE_PTRMEMFUNC_P (expr_type
))
2696 if (TREE_CODE (expr
) != PTRMEM_CST
)
2699 else if (TYPE_PTR_P (expr_type
)
2700 || TYPE_PTRMEM_P (expr_type
)
2701 || TREE_CODE (expr_type
) == ARRAY_TYPE
2702 || TREE_CODE (type
) == REFERENCE_TYPE
2703 /* If expr is the address of an overloaded function, we
2704 will get the unknown_type_node at this point. */
2705 || expr_type
== unknown_type_node
)
2711 if (TREE_CODE (type
) == REFERENCE_TYPE
2712 || TREE_CODE (expr_type
) == ARRAY_TYPE
)
2716 if (TREE_CODE (e
) != ADDR_EXPR
)
2719 cp_error ("`%E' is not a valid template argument", expr
);
2720 if (TYPE_PTR_P (expr_type
))
2722 if (TREE_CODE (TREE_TYPE (expr_type
)) == FUNCTION_TYPE
)
2723 cp_error ("it must be the address of a function with external linkage");
2725 cp_error ("it must be the address of an object with external linkage");
2727 else if (TYPE_PTRMEM_P (expr_type
)
2728 || TYPE_PTRMEMFUNC_P (expr_type
))
2729 cp_error ("it must be a pointer-to-member of the form `&X::Y'");
2734 referent
= TREE_OPERAND (e
, 0);
2735 STRIP_NOPS (referent
);
2738 if (TREE_CODE (referent
) == STRING_CST
)
2740 cp_error ("string literal %E is not a valid template argument",
2742 error ("because it is the address of an object with static linkage");
2746 if (is_overloaded_fn (referent
))
2747 /* We'll check that it has external linkage later. */
2749 else if (TREE_CODE (referent
) != VAR_DECL
)
2751 else if (!TREE_PUBLIC (referent
))
2753 cp_error ("address of non-extern `%E' cannot be used as template argument", referent
);
2754 return error_mark_node
;
2757 else if (INTEGRAL_TYPE_P (expr_type
)
2758 || TYPE_PTRMEM_P (expr_type
)
2759 || TYPE_PTRMEMFUNC_P (expr_type
)
2760 /* The next two are g++ extensions. */
2761 || TREE_CODE (expr_type
) == REAL_TYPE
2762 || TREE_CODE (expr_type
) == COMPLEX_TYPE
)
2764 if (! TREE_CONSTANT (expr
))
2767 cp_error ("non-constant `%E' cannot be used as template argument",
2774 cp_error ("object `%E' cannot be used as template argument", expr
);
2778 switch (TREE_CODE (type
))
2783 /* For a non-type template-parameter of integral or enumeration
2784 type, integral promotions (_conv.prom_) and integral
2785 conversions (_conv.integral_) are applied. */
2786 if (!INTEGRAL_TYPE_P (expr_type
))
2787 return error_mark_node
;
2789 /* It's safe to call digest_init in this case; we know we're
2790 just converting one integral constant expression to another. */
2791 expr
= digest_init (type
, expr
, (tree
*) 0);
2793 if (TREE_CODE (expr
) != INTEGER_CST
)
2794 /* Curiously, some TREE_CONSTANT integral expressions do not
2795 simplify to integer constants. For example, `3 % 0',
2796 remains a TRUNC_MOD_EXPR. */
2803 /* These are g++ extensions. */
2804 if (TREE_CODE (expr_type
) != TREE_CODE (type
))
2805 return error_mark_node
;
2807 expr
= digest_init (type
, expr
, (tree
*) 0);
2809 if (TREE_CODE (expr
) != REAL_CST
)
2816 tree type_pointed_to
= TREE_TYPE (type
);
2818 if (TYPE_PTRMEM_P (type
))
2822 /* For a non-type template-parameter of type pointer to data
2823 member, qualification conversions (_conv.qual_) are
2825 e
= perform_qualification_conversions (type
, expr
);
2826 if (TREE_CODE (e
) == NOP_EXPR
)
2827 /* The call to perform_qualification_conversions will
2828 insert a NOP_EXPR over EXPR to do express conversion,
2829 if necessary. But, that will confuse us if we use
2830 this (converted) template parameter to instantiate
2831 another template; then the thing will not look like a
2832 valid template argument. So, just make a new
2833 constant, of the appropriate type. */
2834 e
= make_ptrmem_cst (type
, PTRMEM_CST_MEMBER (expr
));
2837 else if (TREE_CODE (type_pointed_to
) == FUNCTION_TYPE
)
2839 /* For a non-type template-parameter of type pointer to
2840 function, only the function-to-pointer conversion
2841 (_conv.func_) is applied. If the template-argument
2842 represents a set of overloaded functions (or a pointer to
2843 such), the matching function is selected from the set
2848 if (TREE_CODE (expr
) == ADDR_EXPR
)
2849 fns
= TREE_OPERAND (expr
, 0);
2853 fn
= instantiate_type (type_pointed_to
, fns
, 0);
2855 if (fn
== error_mark_node
)
2856 return error_mark_node
;
2858 if (!TREE_PUBLIC (fn
))
2860 if (really_overloaded_fn (fns
))
2861 return error_mark_node
;
2866 expr
= build_unary_op (ADDR_EXPR
, fn
, 0);
2868 my_friendly_assert (same_type_p (type
, TREE_TYPE (expr
)),
2874 /* For a non-type template-parameter of type pointer to
2875 object, qualification conversions (_conv.qual_) and the
2876 array-to-pointer conversion (_conv.array_) are applied.
2877 [Note: In particular, neither the null pointer conversion
2878 (_conv.ptr_) nor the derived-to-base conversion
2879 (_conv.ptr_) are applied. Although 0 is a valid
2880 template-argument for a non-type template-parameter of
2881 integral type, it is not a valid template-argument for a
2882 non-type template-parameter of pointer type.]
2884 The call to decay_conversion performs the
2885 array-to-pointer conversion, if appropriate. */
2886 expr
= decay_conversion (expr
);
2888 if (expr
== error_mark_node
)
2889 return error_mark_node
;
2891 return perform_qualification_conversions (type
, expr
);
2896 case REFERENCE_TYPE
:
2898 tree type_referred_to
= TREE_TYPE (type
);
2900 if (TREE_CODE (type_referred_to
) == FUNCTION_TYPE
)
2902 /* For a non-type template-parameter of type reference to
2903 function, no conversions apply. If the
2904 template-argument represents a set of overloaded
2905 functions, the matching function is selected from the
2906 set (_over.over_). */
2910 fn
= instantiate_type (type_referred_to
, fns
, 0);
2912 if (fn
== error_mark_node
)
2913 return error_mark_node
;
2915 if (!TREE_PUBLIC (fn
))
2917 if (really_overloaded_fn (fns
))
2918 /* Don't issue an error here; we might get a different
2919 function if the overloading had worked out
2921 return error_mark_node
;
2926 my_friendly_assert (same_type_p (type_referred_to
,
2934 /* For a non-type template-parameter of type reference to
2935 object, no conversions apply. The type referred to by the
2936 reference may be more cv-qualified than the (otherwise
2937 identical) type of the template-argument. The
2938 template-parameter is bound directly to the
2939 template-argument, which must be an lvalue. */
2940 if ((TYPE_MAIN_VARIANT (expr_type
)
2941 != TYPE_MAIN_VARIANT (type_referred_to
))
2942 || !at_least_as_qualified_p (type_referred_to
,
2944 || !real_lvalue_p (expr
))
2945 return error_mark_node
;
2954 if (!TYPE_PTRMEMFUNC_P (type
))
2955 /* This handles templates like
2956 template<class T, T t> void f();
2957 when T is substituted with any class. The second template
2958 parameter becomes invalid and the template candidate is
2960 return error_mark_node
;
2962 /* For a non-type template-parameter of type pointer to member
2963 function, no conversions apply. If the template-argument
2964 represents a set of overloaded member functions, the
2965 matching member function is selected from the set
2968 if (!TYPE_PTRMEMFUNC_P (expr_type
) &&
2969 expr_type
!= unknown_type_node
)
2970 return error_mark_node
;
2972 if (TREE_CODE (expr
) == PTRMEM_CST
)
2974 /* A ptr-to-member constant. */
2975 if (!same_type_p (type
, expr_type
))
2976 return error_mark_node
;
2981 if (TREE_CODE (expr
) != ADDR_EXPR
)
2982 return error_mark_node
;
2984 expr
= instantiate_type (type
, expr
, 0);
2986 if (expr
== error_mark_node
)
2987 return error_mark_node
;
2989 my_friendly_assert (same_type_p (type
, TREE_TYPE (expr
)),
2996 /* All non-type parameters must have one of these types. */
2997 my_friendly_abort (0);
3001 return error_mark_node
;
3004 /* Return 1 if PARM_PARMS and ARG_PARMS matches using rule for
3005 template template parameters. Both PARM_PARMS and ARG_PARMS are
3006 vectors of TREE_LIST nodes containing TYPE_DECL, TEMPLATE_DECL
3009 ARG_PARMS may contain more parameters than PARM_PARMS. If this is
3010 the case, then extra parameters must have default arguments.
3012 Consider the example:
3013 template <class T, class Allocator = allocator> class vector;
3014 template<template <class U> class TT> class C;
3016 C<vector> is a valid instantiation. PARM_PARMS for the above code
3017 contains a TYPE_DECL (for U), ARG_PARMS contains two TYPE_DECLs (for
3018 T and Allocator) and OUTER_ARGS contains the argument that is used to
3019 substitute the TT parameter. */
3022 coerce_template_template_parms (parm_parms
, arg_parms
, complain
,
3023 in_decl
, outer_args
)
3024 tree parm_parms
, arg_parms
;
3026 tree in_decl
, outer_args
;
3028 int nparms
, nargs
, i
;
3031 my_friendly_assert (TREE_CODE (parm_parms
) == TREE_VEC
, 0);
3032 my_friendly_assert (TREE_CODE (arg_parms
) == TREE_VEC
, 0);
3034 nparms
= TREE_VEC_LENGTH (parm_parms
);
3035 nargs
= TREE_VEC_LENGTH (arg_parms
);
3037 /* The rule here is opposite of coerce_template_parms. */
3040 && TREE_PURPOSE (TREE_VEC_ELT (arg_parms
, nparms
)) == NULL_TREE
))
3043 for (i
= 0; i
< nparms
; ++i
)
3045 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, i
));
3046 arg
= TREE_VALUE (TREE_VEC_ELT (arg_parms
, i
));
3048 if (arg
== NULL_TREE
|| arg
== error_mark_node
3049 || parm
== NULL_TREE
|| parm
== error_mark_node
)
3052 if (TREE_CODE (arg
) != TREE_CODE (parm
))
3055 switch (TREE_CODE (parm
))
3061 /* We encounter instantiations of templates like
3062 template <template <template <class> class> class TT>
3065 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
3066 tree argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
3068 if (!coerce_template_template_parms (parmparm
, argparm
,
3076 /* The tsubst call is used to handle cases such as
3077 template <class T, template <T> class TT> class D;
3078 i.e. the parameter list of TT depends on earlier parameters. */
3079 if (!same_type_p (tsubst (TREE_TYPE (parm
), outer_args
,
3086 my_friendly_abort (0);
3092 /* Convert the indicated template ARG as necessary to match the
3093 indicated template PARM. Returns the converted ARG, or
3094 error_mark_node if the conversion was unsuccessful. Error messages
3095 are issued if COMPLAIN is non-zero. This conversion is for the Ith
3096 parameter in the parameter list. ARGS is the full set of template
3097 arguments deduced so far. */
3100 convert_template_argument (parm
, arg
, args
, complain
, i
, in_decl
)
3110 int is_type
, requires_type
, is_tmpl_type
, requires_tmpl_type
;
3112 inner_args
= innermost_args (args
);
3114 if (TREE_CODE (arg
) == TREE_LIST
3115 && TREE_TYPE (arg
) != NULL_TREE
3116 && TREE_CODE (TREE_TYPE (arg
)) == OFFSET_TYPE
)
3118 /* The template argument was the name of some
3119 member function. That's usually
3120 illegal, but static members are OK. In any
3121 case, grab the underlying fields/functions
3122 and issue an error later if required. */
3123 arg
= TREE_VALUE (arg
);
3124 TREE_TYPE (arg
) = unknown_type_node
;
3127 requires_tmpl_type
= TREE_CODE (parm
) == TEMPLATE_DECL
;
3128 requires_type
= (TREE_CODE (parm
) == TYPE_DECL
3129 || requires_tmpl_type
);
3131 /* Check if it is a class template. If REQUIRES_TMPL_TYPE is true,
3132 we also accept implicitly created TYPE_DECL as a valid argument.
3133 This is necessary to handle the case where we pass a template name
3134 to a template template parameter in a scope where we've derived from
3135 in instantiation of that template, so the template name refers to that
3136 instantiation. We really ought to handle this better. */
3138 = ((TREE_CODE (arg
) == TEMPLATE_DECL
3139 && TREE_CODE (DECL_TEMPLATE_RESULT (arg
)) == TYPE_DECL
)
3140 || (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
3141 && !TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (arg
))
3142 || (TREE_CODE (arg
) == RECORD_TYPE
3143 && CLASSTYPE_TEMPLATE_INFO (arg
)
3144 && TREE_CODE (TYPE_NAME (arg
)) == TYPE_DECL
3145 && DECL_ARTIFICIAL (TYPE_NAME (arg
))
3146 && requires_tmpl_type
3147 && is_base_of_enclosing_class (arg
, current_class_type
)));
3148 if (is_tmpl_type
&& TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
3149 arg
= TYPE_STUB_DECL (arg
);
3150 else if (is_tmpl_type
&& TREE_CODE (arg
) == RECORD_TYPE
)
3151 arg
= CLASSTYPE_TI_TEMPLATE (arg
);
3153 is_type
= TREE_CODE_CLASS (TREE_CODE (arg
)) == 't' || is_tmpl_type
;
3155 if (requires_type
&& ! is_type
&& TREE_CODE (arg
) == SCOPE_REF
3156 && TREE_CODE (TREE_OPERAND (arg
, 0)) == TEMPLATE_TYPE_PARM
)
3158 cp_pedwarn ("to refer to a type member of a template parameter,");
3159 cp_pedwarn (" use `typename %E'", arg
);
3161 arg
= make_typename_type (TREE_OPERAND (arg
, 0),
3162 TREE_OPERAND (arg
, 1),
3166 if (is_type
!= requires_type
)
3172 cp_error ("type/value mismatch at argument %d in template parameter list for `%D'",
3175 cp_error (" expected a constant of type `%T', got `%T'",
3177 (is_tmpl_type
? DECL_NAME (arg
) : arg
));
3179 cp_error (" expected a type, got `%E'", arg
);
3182 return error_mark_node
;
3184 if (is_tmpl_type
^ requires_tmpl_type
)
3186 if (in_decl
&& complain
)
3188 cp_error ("type/value mismatch at argument %d in template parameter list for `%D'",
3191 cp_error (" expected a type, got `%T'", DECL_NAME (arg
));
3193 cp_error (" expected a class template, got `%T'", arg
);
3195 return error_mark_node
;
3200 if (requires_tmpl_type
)
3202 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
3203 tree argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
3205 if (coerce_template_template_parms (parmparm
, argparm
, complain
,
3206 in_decl
, inner_args
))
3210 /* TEMPLATE_TEMPLATE_PARM node is preferred over
3212 if (val
!= error_mark_node
3213 && DECL_TEMPLATE_TEMPLATE_PARM_P (val
))
3214 val
= TREE_TYPE (val
);
3218 if (in_decl
&& complain
)
3220 cp_error ("type/value mismatch at argument %d in template parameter list for `%D'",
3222 cp_error (" expected a template of type `%D', got `%D'", parm
, arg
);
3225 val
= error_mark_node
;
3230 val
= groktypename (arg
);
3231 if (! processing_template_decl
)
3233 /* [basic.link]: A name with no linkage (notably, the
3234 name of a class or enumeration declared in a local
3235 scope) shall not be used to declare an entity with
3236 linkage. This implies that names with no linkage
3237 cannot be used as template arguments. */
3238 tree t
= no_linkage_check (val
);
3241 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
3243 ("template-argument `%T' uses anonymous type", val
);
3246 ("template-argument `%T' uses local type `%T'",
3248 return error_mark_node
;
3255 tree t
= tsubst (TREE_TYPE (parm
), args
, complain
, in_decl
);
3257 if (processing_template_decl
)
3258 arg
= maybe_fold_nontype_arg (arg
);
3260 if (!uses_template_parms (arg
) && !uses_template_parms (t
))
3261 /* We used to call digest_init here. However, digest_init
3262 will report errors, which we don't want when complain
3263 is zero. More importantly, digest_init will try too
3264 hard to convert things: for example, `0' should not be
3265 converted to pointer type at this point according to
3266 the standard. Accepting this is not merely an
3267 extension, since deciding whether or not these
3268 conversions can occur is part of determining which
3269 function template to call, or whether a given epxlicit
3270 argument specification is legal. */
3271 val
= convert_nontype_argument (t
, arg
);
3275 if (val
== NULL_TREE
)
3276 val
= error_mark_node
;
3277 else if (val
== error_mark_node
&& complain
)
3278 cp_error ("could not convert template argument `%E' to `%T'",
3285 /* Convert all template arguments to their appropriate types, and
3286 return a vector containing the innermost resulting template
3287 arguments. If any error occurs, return error_mark_node, and, if
3288 COMPLAIN is non-zero, issue an error message. Some error messages
3289 are issued even if COMPLAIN is zero; for instance, if a template
3290 argument is composed from a local class.
3292 If REQUIRE_ALL_ARGUMENTS is non-zero, all arguments must be
3293 provided in ARGLIST, or else trailing parameters must have default
3294 values. If REQUIRE_ALL_ARGUMENTS is zero, we will attempt argument
3295 deduction for any unspecified trailing arguments.
3297 The resulting TREE_VEC is allocated on a temporary obstack, and
3298 must be explicitly copied if it will be permanent. */
3301 coerce_template_parms (parms
, args
, in_decl
,
3303 require_all_arguments
)
3307 int require_all_arguments
;
3309 int nparms
, nargs
, i
, lost
= 0;
3312 tree new_inner_args
;
3314 inner_args
= innermost_args (args
);
3315 nargs
= NUM_TMPL_ARGS (inner_args
);
3316 nparms
= TREE_VEC_LENGTH (parms
);
3320 && require_all_arguments
3321 && TREE_PURPOSE (TREE_VEC_ELT (parms
, nargs
)) == NULL_TREE
))
3325 cp_error ("wrong number of template arguments (%d, should be %d)",
3329 cp_error_at ("provided for `%D'", in_decl
);
3332 return error_mark_node
;
3335 new_inner_args
= make_tree_vec (nparms
);
3336 new_args
= add_outermost_template_args (args
, new_inner_args
);
3337 for (i
= 0; i
< nparms
; i
++)
3342 /* Get the Ith template parameter. */
3343 parm
= TREE_VEC_ELT (parms
, i
);
3345 /* Calculate the Ith argument. */
3346 if (inner_args
&& TREE_CODE (inner_args
) == TREE_LIST
)
3348 arg
= TREE_VALUE (inner_args
);
3349 inner_args
= TREE_CHAIN (inner_args
);
3352 arg
= TREE_VEC_ELT (inner_args
, i
);
3353 /* If no template argument was supplied, look for a default
3355 else if (TREE_PURPOSE (parm
) == NULL_TREE
)
3357 /* There was no default value. */
3358 my_friendly_assert (!require_all_arguments
, 0);
3361 else if (TREE_CODE (TREE_VALUE (parm
)) == TYPE_DECL
)
3362 arg
= tsubst (TREE_PURPOSE (parm
), new_args
, complain
, in_decl
);
3364 arg
= tsubst_expr (TREE_PURPOSE (parm
), new_args
, complain
,
3367 /* Now, convert the Ith argument, as necessary. */
3368 if (arg
== NULL_TREE
)
3369 /* We're out of arguments. */
3371 my_friendly_assert (!require_all_arguments
, 0);
3374 else if (arg
== error_mark_node
)
3376 cp_error ("template argument %d is invalid", i
+ 1);
3377 arg
= error_mark_node
;
3380 arg
= convert_template_argument (TREE_VALUE (parm
),
3381 arg
, new_args
, complain
, i
,
3384 if (arg
== error_mark_node
)
3386 TREE_VEC_ELT (new_inner_args
, i
) = arg
;
3390 return error_mark_node
;
3392 return new_inner_args
;
3395 /* Returns 1 if template args OT and NT are equivalent. */
3398 template_args_equal (ot
, nt
)
3403 if (TREE_CODE (nt
) != TREE_CODE (ot
))
3405 if (TREE_CODE (nt
) == TREE_VEC
)
3406 /* For member templates */
3407 return comp_template_args (ot
, nt
);
3408 else if (TREE_CODE_CLASS (TREE_CODE (ot
)) == 't')
3409 return same_type_p (ot
, nt
);
3411 return (cp_tree_equal (ot
, nt
) > 0);
3414 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets
3415 of template arguments. Returns 0 otherwise. */
3418 comp_template_args (oldargs
, newargs
)
3419 tree oldargs
, newargs
;
3423 if (TREE_VEC_LENGTH (oldargs
) != TREE_VEC_LENGTH (newargs
))
3426 for (i
= 0; i
< TREE_VEC_LENGTH (oldargs
); ++i
)
3428 tree nt
= TREE_VEC_ELT (newargs
, i
);
3429 tree ot
= TREE_VEC_ELT (oldargs
, i
);
3431 if (! template_args_equal (ot
, nt
))
3437 /* Given class template name and parameter list, produce a user-friendly name
3438 for the instantiation. */
3441 mangle_class_name_for_template (name
, parms
, arglist
)
3443 tree parms
, arglist
;
3445 static struct obstack scratch_obstack
;
3446 static char *scratch_firstobj
;
3449 if (!scratch_firstobj
)
3450 gcc_obstack_init (&scratch_obstack
);
3452 obstack_free (&scratch_obstack
, scratch_firstobj
);
3453 scratch_firstobj
= obstack_alloc (&scratch_obstack
, 1);
3455 #define ccat(c) obstack_1grow (&scratch_obstack, (c));
3456 #define cat(s) obstack_grow (&scratch_obstack, (s), strlen (s))
3460 nparms
= TREE_VEC_LENGTH (parms
);
3461 arglist
= innermost_args (arglist
);
3462 my_friendly_assert (nparms
== TREE_VEC_LENGTH (arglist
), 268);
3463 for (i
= 0; i
< nparms
; i
++)
3465 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
3466 tree arg
= TREE_VEC_ELT (arglist
, i
);
3471 if (TREE_CODE (parm
) == TYPE_DECL
)
3473 cat (type_as_string (arg
, TS_CHASE_TYPEDEFS
));
3476 else if (TREE_CODE (parm
) == TEMPLATE_DECL
)
3478 if (TREE_CODE (arg
) == TEMPLATE_DECL
)
3480 /* Already substituted with real template. Just output
3481 the template name here */
3482 tree context
= DECL_CONTEXT (arg
);
3485 /* The template may be defined in a namespace, or
3486 may be a member template. */
3487 my_friendly_assert (TREE_CODE (context
) == NAMESPACE_DECL
3488 || CLASS_TYPE_P (context
),
3490 cat(decl_as_string (DECL_CONTEXT (arg
), 0));
3493 cat (IDENTIFIER_POINTER (DECL_NAME (arg
)));
3496 /* Output the parameter declaration */
3497 cat (type_as_string (arg
, TS_CHASE_TYPEDEFS
));
3501 my_friendly_assert (TREE_CODE (parm
) == PARM_DECL
, 269);
3503 if (TREE_CODE (arg
) == TREE_LIST
)
3505 /* New list cell was built because old chain link was in
3507 my_friendly_assert (TREE_PURPOSE (arg
) == NULL_TREE
, 270);
3508 arg
= TREE_VALUE (arg
);
3510 /* No need to check arglist against parmlist here; we did that
3511 in coerce_template_parms, called from lookup_template_class. */
3512 cat (expr_as_string (arg
, 0));
3515 char *bufp
= obstack_next_free (&scratch_obstack
);
3517 while (bufp
[offset
- 1] == ' ')
3519 obstack_blank_fast (&scratch_obstack
, offset
);
3521 /* B<C<char> >, not B<C<char>> */
3522 if (bufp
[offset
- 1] == '>')
3527 return (char *) obstack_base (&scratch_obstack
);
3531 classtype_mangled_name (t
)
3534 if (CLASSTYPE_TEMPLATE_INFO (t
)
3535 /* Specializations have already had their names set up in
3536 lookup_template_class. */
3537 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
3539 tree tmpl
= most_general_template (CLASSTYPE_TI_TEMPLATE (t
));
3541 /* For non-primary templates, the template parameters are
3542 implicit from their surrounding context. */
3543 if (PRIMARY_TEMPLATE_P (tmpl
))
3545 tree name
= DECL_NAME (tmpl
);
3546 char *mangled_name
= mangle_class_name_for_template
3547 (IDENTIFIER_POINTER (name
),
3548 DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
3549 CLASSTYPE_TI_ARGS (t
));
3550 tree id
= get_identifier (mangled_name
);
3551 IDENTIFIER_TEMPLATE (id
) = name
;
3556 return TYPE_IDENTIFIER (t
);
3560 add_pending_template (d
)
3565 if (TREE_CODE_CLASS (TREE_CODE (d
)) == 't')
3566 ti
= CLASSTYPE_TEMPLATE_INFO (d
);
3568 ti
= DECL_TEMPLATE_INFO (d
);
3570 if (TI_PENDING_TEMPLATE_FLAG (ti
))
3573 *template_tail
= tree_cons (build_srcloc_here (), d
, NULL_TREE
);
3574 template_tail
= &TREE_CHAIN (*template_tail
);
3575 TI_PENDING_TEMPLATE_FLAG (ti
) = 1;
3579 /* Return a TEMPLATE_ID_EXPR corresponding to the indicated FNS (which
3580 may be either a _DECL or an overloaded function or an
3581 IDENTIFIER_NODE), and ARGLIST. */
3584 lookup_template_function (fns
, arglist
)
3589 if (fns
== NULL_TREE
)
3591 cp_error ("non-template used as template");
3592 return error_mark_node
;
3595 type
= TREE_TYPE (fns
);
3596 if (TREE_CODE (fns
) == OVERLOAD
|| !type
)
3597 type
= unknown_type_node
;
3599 if (processing_template_decl
)
3600 return build_min (TEMPLATE_ID_EXPR
, type
, fns
, arglist
);
3602 return build (TEMPLATE_ID_EXPR
, type
, fns
, arglist
);
3605 /* Within the scope of a template class S<T>, the name S gets bound
3606 (in build_self_reference) to a TYPE_DECL for the class, not a
3607 TEMPLATE_DECL. If DECL is a TYPE_DECL for current_class_type,
3608 or one of its enclosing classes, and that type is a template,
3609 return the associated TEMPLATE_DECL. Otherwise, the original
3610 DECL is returned. */
3613 maybe_get_template_decl_from_type_decl (decl
)
3616 return (decl
!= NULL_TREE
3617 && TREE_CODE (decl
) == TYPE_DECL
3618 && DECL_ARTIFICIAL (decl
)
3619 && CLASS_TYPE_P (TREE_TYPE (decl
))
3620 && CLASSTYPE_TEMPLATE_INFO (TREE_TYPE (decl
)))
3621 ? CLASSTYPE_TI_TEMPLATE (TREE_TYPE (decl
)) : decl
;
3624 /* Given an IDENTIFIER_NODE (type TEMPLATE_DECL) and a chain of
3625 parameters, find the desired type.
3627 D1 is the PTYPENAME terminal, and ARGLIST is the list of arguments.
3628 (Actually ARGLIST may be either a TREE_LIST or a TREE_VEC. It will
3629 be a TREE_LIST if called directly from the parser, and a TREE_VEC
3630 otherwise.) Since ARGLIST is build on the temp_decl_obstack, we must
3631 copy it here to keep it from being reclaimed when the decl storage
3634 IN_DECL, if non-NULL, is the template declaration we are trying to
3637 If ENTERING_SCOPE is non-zero, we are about to enter the scope of
3638 the class we are looking up.
3640 If the template class is really a local class in a template
3641 function, then the FUNCTION_CONTEXT is the function in which it is
3642 being instantiated. */
3645 lookup_template_class (d1
, arglist
, in_decl
, context
, entering_scope
)
3651 tree
template = NULL_TREE
, parmlist
;
3654 if (TREE_CODE (d1
) == IDENTIFIER_NODE
)
3656 if (IDENTIFIER_VALUE (d1
)
3657 && DECL_TEMPLATE_TEMPLATE_PARM_P (IDENTIFIER_VALUE (d1
)))
3658 template = IDENTIFIER_VALUE (d1
);
3662 push_decl_namespace (context
);
3663 template = lookup_name (d1
, /*prefer_type=*/0);
3664 template = maybe_get_template_decl_from_type_decl (template);
3666 pop_decl_namespace ();
3669 context
= DECL_CONTEXT (template);
3671 else if (TREE_CODE (d1
) == TYPE_DECL
&& IS_AGGR_TYPE (TREE_TYPE (d1
)))
3673 tree type
= TREE_TYPE (d1
);
3675 /* If we are declaring a constructor, say A<T>::A<T>, we will get
3676 an implicit typename for the second A. Deal with it. */
3677 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
3678 type
= TREE_TYPE (type
);
3680 if (CLASSTYPE_TEMPLATE_INFO (type
))
3682 template = CLASSTYPE_TI_TEMPLATE (type
);
3683 d1
= DECL_NAME (template);
3686 else if (TREE_CODE (d1
) == ENUMERAL_TYPE
3687 || (TREE_CODE_CLASS (TREE_CODE (d1
)) == 't'
3688 && IS_AGGR_TYPE (d1
)))
3690 template = TYPE_TI_TEMPLATE (d1
);
3691 d1
= DECL_NAME (template);
3693 else if (TREE_CODE (d1
) == TEMPLATE_DECL
3694 && TREE_CODE (DECL_RESULT (d1
)) == TYPE_DECL
)
3697 d1
= DECL_NAME (template);
3698 context
= DECL_CONTEXT (template);
3701 my_friendly_abort (272);
3703 /* With something like `template <class T> class X class X { ... };'
3704 we could end up with D1 having nothing but an IDENTIFIER_VALUE.
3705 We don't want to do that, but we have to deal with the situation,
3706 so let's give them some syntax errors to chew on instead of a
3710 cp_error ("`%T' is not a template", d1
);
3711 return error_mark_node
;
3714 if (context
== NULL_TREE
)
3715 context
= global_namespace
;
3717 if (TREE_CODE (template) != TEMPLATE_DECL
)
3719 cp_error ("non-template type `%T' used as a template", d1
);
3721 cp_error_at ("for template declaration `%D'", in_decl
);
3722 return error_mark_node
;
3725 if (DECL_TEMPLATE_TEMPLATE_PARM_P (template))
3727 /* Create a new TEMPLATE_DECL and TEMPLATE_TEMPLATE_PARM node to store
3728 template arguments */
3730 tree parm
= copy_template_template_parm (TREE_TYPE (template));
3731 tree template2
= TYPE_STUB_DECL (parm
);
3734 parmlist
= DECL_INNERMOST_TEMPLATE_PARMS (template);
3736 arglist2
= coerce_template_parms (parmlist
, arglist
, template, 1, 1);
3737 if (arglist2
== error_mark_node
)
3738 return error_mark_node
;
3740 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (parm
)
3741 = tree_cons (template2
, arglist2
, NULL_TREE
);
3742 TYPE_SIZE (parm
) = 0;
3747 tree template_type
= TREE_TYPE (template);
3750 tree found
= NULL_TREE
;
3753 int is_partial_instantiation
;
3755 gen_tmpl
= most_general_template (template);
3756 parmlist
= DECL_TEMPLATE_PARMS (gen_tmpl
);
3757 parm_depth
= TMPL_PARMS_DEPTH (parmlist
);
3758 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
3760 if (arg_depth
== 1 && parm_depth
> 1)
3762 /* We've been given an incomplete set of template arguments.
3765 template <class T> struct S1 {
3766 template <class U> struct S2 {};
3767 template <class U> struct S2<U*> {};
3770 we will be called with an ARGLIST of `U*', but the
3771 TEMPLATE will be `template <class T> template
3772 <class U> struct S1<T>::S2'. We must fill in the missing
3775 = add_outermost_template_args (TYPE_TI_ARGS (TREE_TYPE (template)),
3777 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
3780 /* Now we should enough arguments. */
3781 my_friendly_assert (parm_depth
== arg_depth
, 0);
3783 /* From here on, we're only interested in the most general
3785 template = gen_tmpl
;
3787 /* Calculate the BOUND_ARGS. These will be the args that are
3788 actually tsubst'd into the definition to create the
3792 /* We have multiple levels of arguments to coerce, at once. */
3794 int saved_depth
= TMPL_ARGS_DEPTH (arglist
);
3796 tree bound_args
= make_tree_vec (parm_depth
);
3798 for (i
= saved_depth
,
3799 t
= DECL_TEMPLATE_PARMS (template);
3800 i
> 0 && t
!= NULL_TREE
;
3801 --i
, t
= TREE_CHAIN (t
))
3803 tree a
= coerce_template_parms (TREE_VALUE (t
),
3804 arglist
, template, 1, 1);
3805 SET_TMPL_ARGS_LEVEL (bound_args
, i
, a
);
3807 /* We temporarily reduce the length of the ARGLIST so
3808 that coerce_template_parms will see only the arguments
3809 corresponding to the template parameters it is
3811 TREE_VEC_LENGTH (arglist
)--;
3814 /* Restore the ARGLIST to its full size. */
3815 TREE_VEC_LENGTH (arglist
) = saved_depth
;
3817 arglist
= bound_args
;
3821 = coerce_template_parms (INNERMOST_TEMPLATE_PARMS (parmlist
),
3822 innermost_args (arglist
),
3825 if (arglist
== error_mark_node
)
3826 /* We were unable to bind the arguments. */
3827 return error_mark_node
;
3829 /* In the scope of a template class, explicit references to the
3830 template class refer to the type of the template, not any
3831 instantiation of it. For example, in:
3833 template <class T> class C { void f(C<T>); }
3835 the `C<T>' is just the same as `C'. Outside of the
3836 class, however, such a reference is an instantiation. */
3837 if (comp_template_args (TYPE_TI_ARGS (template_type
),
3840 found
= template_type
;
3842 if (!entering_scope
&& PRIMARY_TEMPLATE_P (template))
3846 /* Note that we use DECL_CONTEXT, rather than
3847 CP_DECL_CONTEXT, so that the termination test is
3848 always just `ctx'. We're not interested in namepace
3850 for (ctx
= current_class_type
;
3852 ctx
= (TREE_CODE_CLASS (TREE_CODE (ctx
)) == 't')
3853 ? TYPE_CONTEXT (ctx
) : DECL_CONTEXT (ctx
))
3854 if (same_type_p (ctx
, template_type
))
3858 /* We're not in the scope of the class, so the
3859 TEMPLATE_TYPE is not the type we want after
3867 for (found
= DECL_TEMPLATE_INSTANTIATIONS (template);
3868 found
; found
= TREE_CHAIN (found
))
3869 if (comp_template_args (TREE_PURPOSE (found
), arglist
))
3873 found
= TREE_VALUE (found
);
3879 /* This type is a "partial instantiation" if any of the template
3880 arguments still inolve template parameters. Note that we set
3881 IS_PARTIAL_INSTANTIATION for partial specializations as
3883 is_partial_instantiation
= uses_template_parms (arglist
);
3885 if (!is_partial_instantiation
3886 && !PRIMARY_TEMPLATE_P (template)
3887 && TREE_CODE (CP_DECL_CONTEXT (template)) == NAMESPACE_DECL
)
3889 found
= xref_tag_from_type (TREE_TYPE (template),
3890 DECL_NAME (template),
3895 /* Create the type. */
3896 if (TREE_CODE (template_type
) == ENUMERAL_TYPE
)
3898 if (!is_partial_instantiation
)
3899 t
= start_enum (TYPE_IDENTIFIER (template_type
));
3901 /* We don't want to call start_enum for this type, since
3902 the values for the enumeration constants may involve
3903 template parameters. And, no one should be interested
3904 in the enumeration constants for such a type. */
3905 t
= make_node (ENUMERAL_TYPE
);
3909 t
= make_aggr_type (TREE_CODE (template_type
));
3910 CLASSTYPE_DECLARED_CLASS (t
)
3911 = CLASSTYPE_DECLARED_CLASS (template_type
);
3912 CLASSTYPE_GOT_SEMICOLON (t
) = 1;
3913 SET_CLASSTYPE_IMPLICIT_INSTANTIATION (t
);
3914 TYPE_FOR_JAVA (t
) = TYPE_FOR_JAVA (template_type
);
3916 /* A local class. Make sure the decl gets registered properly. */
3917 if (context
== current_function_decl
)
3918 pushtag (DECL_NAME (template), t
, 0);
3921 /* If we called start_enum or pushtag above, this information
3922 will already be set up. */
3925 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
3927 type_decl
= create_implicit_typedef (DECL_NAME (template), t
);
3928 DECL_CONTEXT (type_decl
) = TYPE_CONTEXT (t
);
3929 TYPE_STUB_DECL (t
) = type_decl
;
3930 DECL_SOURCE_FILE (type_decl
)
3931 = DECL_SOURCE_FILE (TYPE_STUB_DECL (template_type
));
3932 DECL_SOURCE_LINE (type_decl
)
3933 = DECL_SOURCE_LINE (TYPE_STUB_DECL (template_type
));
3936 type_decl
= TYPE_NAME (t
);
3938 /* Set up the template information. We have to figure out which
3939 template is the immediate parent if this is a full
3941 if (parm_depth
== 1 || is_partial_instantiation
3942 || !PRIMARY_TEMPLATE_P (template))
3943 /* This case is easy; there are no member templates involved. */
3947 /* This is a full instantiation of a member template. There
3948 should be some partial instantiation of which this is an
3951 for (found
= DECL_TEMPLATE_INSTANTIATIONS (template);
3952 found
; found
= TREE_CHAIN (found
))
3955 tree tmpl
= CLASSTYPE_TI_TEMPLATE (TREE_VALUE (found
));
3957 /* We only want partial instantiations, here, not
3958 specializations or full instantiations. */
3959 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_VALUE (found
))
3960 || !uses_template_parms (TREE_VALUE (found
)))
3963 /* Temporarily reduce by one the number of levels in the
3964 ARGLIST and in FOUND so as to avoid comparing the
3965 last set of arguments. */
3966 TREE_VEC_LENGTH (arglist
)--;
3967 TREE_VEC_LENGTH (TREE_PURPOSE (found
)) --;
3969 /* See if the arguments match. If they do, then TMPL is
3970 the partial instantiation we want. */
3971 success
= comp_template_args (TREE_PURPOSE (found
), arglist
);
3973 /* Restore the argument vectors to their full size. */
3974 TREE_VEC_LENGTH (arglist
)++;
3975 TREE_VEC_LENGTH (TREE_PURPOSE (found
))++;
3985 my_friendly_abort (0);
3988 SET_TYPE_TEMPLATE_INFO (t
,
3989 tree_cons (found
, arglist
, NULL_TREE
));
3990 DECL_TEMPLATE_INSTANTIATIONS (template)
3991 = tree_cons (arglist
, t
,
3992 DECL_TEMPLATE_INSTANTIATIONS (template));
3994 if (TREE_CODE (t
) == ENUMERAL_TYPE
3995 && !is_partial_instantiation
)
3996 /* Now that the type has been registered on the instantiations
3997 list, we set up the enumerators. Because the enumeration
3998 constants may involve the enumeration type itself, we make
3999 sure to register the type first, and then create the
4000 constants. That way, doing tsubst_expr for the enumeration
4001 constants won't result in recursive calls here; we'll find
4002 the instantiation and exit above. */
4003 tsubst_enum (template_type
, t
, arglist
);
4005 /* Reset the name of the type, now that CLASSTYPE_TEMPLATE_INFO
4007 if (TREE_CODE (t
) != ENUMERAL_TYPE
)
4008 DECL_NAME (type_decl
) = classtype_mangled_name (t
);
4009 DECL_ASSEMBLER_NAME (type_decl
) = DECL_NAME (type_decl
);
4010 if (!is_partial_instantiation
)
4012 DECL_ASSEMBLER_NAME (type_decl
)
4013 = get_identifier (build_overload_name (t
, 1, 1));
4015 /* For backwards compatibility; code that uses
4016 -fexternal-templates expects looking up a template to
4017 instantiate it. I think DDD still relies on this.
4018 (jason 8/20/1998) */
4019 if (TREE_CODE (t
) != ENUMERAL_TYPE
4020 && flag_external_templates
4021 && CLASSTYPE_INTERFACE_KNOWN (TREE_TYPE (template))
4022 && ! CLASSTYPE_INTERFACE_ONLY (TREE_TYPE (template)))
4023 add_pending_template (t
);
4026 /* If the type makes use of template parameters, the
4027 code that generates debugging information will crash. */
4028 DECL_IGNORED_P (TYPE_STUB_DECL (t
)) = 1;
4040 /* Called from for_each_template_parm via walk_tree. */
4043 for_each_template_parm_r (tp
, walk_subtrees
, d
)
4049 struct pair_fn_data
*pfd
= (struct pair_fn_data
*) d
;
4050 tree_fn_t fn
= pfd
->fn
;
4051 void *data
= pfd
->data
;
4053 if (TREE_CODE_CLASS (TREE_CODE (t
)) == 't'
4054 && for_each_template_parm (TYPE_CONTEXT (t
), fn
, data
))
4055 return error_mark_node
;
4057 switch (TREE_CODE (t
))
4060 if (TYPE_PTRMEMFUNC_FLAG (t
))
4066 if (!TYPE_TEMPLATE_INFO (t
))
4068 else if (for_each_template_parm (TREE_VALUE (TYPE_TEMPLATE_INFO (t
)),
4070 return error_mark_node
;
4074 /* Since we're not going to walk subtrees, we have to do this
4076 if (for_each_template_parm (TYPE_METHOD_BASETYPE (t
), fn
, data
))
4077 return error_mark_node
;
4080 /* Check the return type. */
4081 if (for_each_template_parm (TREE_TYPE (t
), fn
, data
))
4082 return error_mark_node
;
4084 /* Check the parameter types. Since default arguments are not
4085 instantiated until they are needed, the TYPE_ARG_TYPES may
4086 contain expressions that involve template parameters. But,
4087 no-one should be looking at them yet. And, once they're
4088 instantiated, they don't contain template parameters, so
4089 there's no point in looking at them then, either. */
4093 for (parm
= TYPE_ARG_TYPES (t
); parm
; parm
= TREE_CHAIN (parm
))
4094 if (for_each_template_parm (TREE_VALUE (parm
), fn
, data
))
4095 return error_mark_node
;
4097 /* Since we've already handled the TYPE_ARG_TYPES, we don't
4098 want walk_tree walking into them itself. */
4105 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
)
4106 && for_each_template_parm (DECL_TI_ARGS (t
), fn
, data
))
4107 return error_mark_node
;
4112 if (DECL_CONTEXT (t
)
4113 && for_each_template_parm (DECL_CONTEXT (t
), fn
, data
))
4114 return error_mark_node
;
4117 case TEMPLATE_TEMPLATE_PARM
:
4118 /* Record template parameters such as `T' inside `TT<T>'. */
4119 if (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t
)
4120 && for_each_template_parm (TYPE_TI_ARGS (t
), fn
, data
))
4121 return error_mark_node
;
4124 case TEMPLATE_TYPE_PARM
:
4125 case TEMPLATE_PARM_INDEX
:
4126 if (fn
&& (*fn
)(t
, data
))
4127 return error_mark_node
;
4129 return error_mark_node
;
4133 /* A template template parameter is encountered */
4134 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
)
4135 && for_each_template_parm (TREE_TYPE (t
), fn
, data
))
4136 return error_mark_node
;
4138 /* Already substituted template template parameter */
4143 if (!fn
|| for_each_template_parm (TYPENAME_TYPE_FULLNAME (t
), fn
, data
))
4144 return error_mark_node
;
4148 if (TREE_TYPE (t
) && TYPE_PTRMEMFUNC_P (TREE_TYPE (t
))
4149 && for_each_template_parm (TYPE_PTRMEMFUNC_FN_TYPE
4150 (TREE_TYPE (t
)), fn
, data
))
4151 return error_mark_node
;
4156 /* If there's no type, then this thing must be some expression
4157 involving template parameters. */
4158 if (!fn
&& !TREE_TYPE (t
))
4159 return error_mark_node
;
4164 case REINTERPRET_CAST_EXPR
:
4165 case CONST_CAST_EXPR
:
4166 case STATIC_CAST_EXPR
:
4167 case DYNAMIC_CAST_EXPR
:
4172 case PSEUDO_DTOR_EXPR
:
4174 return error_mark_node
;
4181 /* We didn't find any template parameters we liked. */
4185 /* For each TEMPLATE_TYPE_PARM, TEMPLATE_TEMPLATE_PARM, or
4186 TEMPLATE_PARM_INDEX in T, call FN with the parameter and the DATA.
4187 If FN returns non-zero, the iteration is terminated, and
4188 for_each_template_parm returns 1. Otherwise, the iteration
4189 continues. If FN never returns a non-zero value, the value
4190 returned by for_each_template_parm is 0. If FN is NULL, it is
4191 considered to be the function which always returns 1. */
4194 for_each_template_parm (t
, fn
, data
)
4199 struct pair_fn_data pfd
;
4205 /* Walk the tree. */
4206 return walk_tree (&t
, for_each_template_parm_r
, &pfd
) != NULL_TREE
;
4210 uses_template_parms (t
)
4213 return for_each_template_parm (t
, 0, 0);
4216 static struct tinst_level
*current_tinst_level
;
4217 static struct tinst_level
*free_tinst_level
;
4218 static int tinst_depth
;
4219 extern int max_tinst_depth
;
4220 #ifdef GATHER_STATISTICS
4223 static int tinst_level_tick
;
4224 static int last_template_error_tick
;
4226 /* Print out all the template instantiations that we are currently
4227 working on. If ERR, we are being called from cp_thing, so do
4228 the right thing for an error message. */
4231 print_template_context (err
)
4234 struct tinst_level
*p
= current_tinst_level
;
4236 char *file
= input_filename
;
4240 if (current_function_decl
!= p
->decl
4241 && current_function_decl
!= NULL_TREE
)
4242 /* We can get here during the processing of some synthesized
4243 method. Then, p->decl will be the function that's causing
4248 if (current_function_decl
== p
->decl
)
4249 /* Avoid redundancy with the the "In function" line. */;
4251 fprintf (stderr
, "%s: In instantiation of `%s':\n",
4252 file
, decl_as_string (p
->decl
, TS_DECL_TYPE
| TS_FUNC_NORETURN
));
4260 for (; p
; p
= p
->next
)
4262 fprintf (stderr
, "%s:%d: instantiated from `%s'\n", file
, line
,
4263 decl_as_string (p
->decl
, TS_DECL_TYPE
| TS_FUNC_NORETURN
));
4267 fprintf (stderr
, "%s:%d: instantiated from here\n", file
, line
);
4270 /* Called from cp_thing to print the template context for an error. */
4273 maybe_print_template_context ()
4275 if (last_template_error_tick
== tinst_level_tick
4276 || current_tinst_level
== 0)
4279 last_template_error_tick
= tinst_level_tick
;
4280 print_template_context (1);
4284 push_tinst_level (d
)
4287 struct tinst_level
*new;
4289 if (tinst_depth
>= max_tinst_depth
)
4291 /* If the instantiation in question still has unbound template parms,
4292 we don't really care if we can't instantiate it, so just return.
4293 This happens with base instantiation for implicit `typename'. */
4294 if (uses_template_parms (d
))
4297 last_template_error_tick
= tinst_level_tick
;
4298 error ("template instantiation depth exceeds maximum of %d",
4300 error (" (use -ftemplate-depth-NN to increase the maximum)");
4301 cp_error (" instantiating `%D'", d
);
4303 print_template_context (0);
4308 if (free_tinst_level
)
4310 new = free_tinst_level
;
4311 free_tinst_level
= new->next
;
4314 new = (struct tinst_level
*) xmalloc (sizeof (struct tinst_level
));
4318 new->file
= input_filename
;
4319 new->next
= current_tinst_level
;
4320 current_tinst_level
= new;
4323 #ifdef GATHER_STATISTICS
4324 if (tinst_depth
> depth_reached
)
4325 depth_reached
= tinst_depth
;
4335 struct tinst_level
*old
= current_tinst_level
;
4337 /* Restore the filename and line number stashed away when we started
4338 this instantiation. */
4340 input_filename
= old
->file
;
4341 extract_interface_info ();
4343 current_tinst_level
= old
->next
;
4344 old
->next
= free_tinst_level
;
4345 free_tinst_level
= old
;
4350 struct tinst_level
*
4353 struct tinst_level
*p
= current_tinst_level
;
4356 for (; p
->next
; p
= p
->next
)
4361 /* DECL is a friend FUNCTION_DECL or TEMPLATE_DECL. ARGS is the
4362 vector of template arguments, as for tsubst.
4364 Returns an appropriate tsbust'd friend declaration. */
4367 tsubst_friend_function (decl
, args
)
4373 char *file
= input_filename
;
4375 lineno
= DECL_SOURCE_LINE (decl
);
4376 input_filename
= DECL_SOURCE_FILE (decl
);
4378 if (TREE_CODE (decl
) == FUNCTION_DECL
4379 && DECL_TEMPLATE_INSTANTIATION (decl
)
4380 && TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
4381 /* This was a friend declared with an explicit template
4382 argument list, e.g.:
4386 to indicate that f was a template instantiation, not a new
4387 function declaration. Now, we have to figure out what
4388 instantiation of what template. */
4395 = lookup_template_function (tsubst_expr (DECL_TI_TEMPLATE (decl
),
4396 args
, /*complain=*/1,
4398 tsubst (DECL_TI_ARGS (decl
),
4399 args
, /*complain=*/1,
4401 new_friend
= tsubst (decl
, args
, /*complain=*/1, NULL_TREE
);
4402 tmpl
= determine_specialization (template_id
, new_friend
,
4404 /*need_member_template=*/0);
4405 new_friend
= instantiate_template (tmpl
, new_args
);
4409 new_friend
= tsubst (decl
, args
, /*complain=*/1, NULL_TREE
);
4411 /* The NEW_FRIEND will look like an instantiation, to the
4412 compiler, but is not an instantiation from the point of view of
4413 the language. For example, we might have had:
4415 template <class T> struct S {
4416 template <class U> friend void f(T, U);
4419 Then, in S<int>, template <class U> void f(int, U) is not an
4420 instantiation of anything. */
4421 DECL_USE_TEMPLATE (new_friend
) = 0;
4422 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
4423 DECL_USE_TEMPLATE (DECL_TEMPLATE_RESULT (new_friend
)) = 0;
4425 /* The mangled name for the NEW_FRIEND is incorrect. The call to
4426 tsubst will have resulted in a call to
4427 set_mangled_name_for_template_decl. But, the function is not a
4428 template instantiation and should not be mangled like one.
4429 Therefore, we remangle the function name. We don't have to do
4430 this if the NEW_FRIEND is a template since
4431 set_mangled_name_for_template_decl doesn't do anything if the
4432 function declaration still uses template arguments. */
4433 if (TREE_CODE (new_friend
) != TEMPLATE_DECL
)
4435 set_mangled_name_for_decl (new_friend
);
4436 DECL_RTL (new_friend
) = 0;
4437 make_decl_rtl (new_friend
, NULL_PTR
, 1);
4440 if (DECL_NAMESPACE_SCOPE_P (new_friend
))
4443 tree new_friend_template_info
;
4444 tree new_friend_result_template_info
;
4446 int new_friend_is_defn
;
4448 /* We must save some information from NEW_FRIEND before calling
4449 duplicate decls since that function will free NEW_FRIEND if
4451 new_friend_template_info
= DECL_TEMPLATE_INFO (new_friend
);
4452 if (TREE_CODE (new_friend
) == TEMPLATE_DECL
)
4454 /* This declaration is a `primary' template. */
4455 DECL_PRIMARY_TEMPLATE (new_friend
) = new_friend
;
4458 = DECL_INITIAL (DECL_RESULT (new_friend
)) != NULL_TREE
;
4459 new_friend_result_template_info
4460 = DECL_TEMPLATE_INFO (DECL_RESULT (new_friend
));
4464 new_friend_is_defn
= DECL_INITIAL (new_friend
) != NULL_TREE
;
4465 new_friend_result_template_info
= NULL_TREE
;
4468 /* Inside pushdecl_namespace_level, we will push into the
4469 current namespace. However, the friend function should go
4470 into the namespace of the template. */
4471 ns
= decl_namespace_context (new_friend
);
4472 push_nested_namespace (ns
);
4473 old_decl
= pushdecl_namespace_level (new_friend
);
4474 pop_nested_namespace (ns
);
4476 if (old_decl
!= new_friend
)
4478 /* This new friend declaration matched an existing
4479 declaration. For example, given:
4481 template <class T> void f(T);
4482 template <class U> class C {
4483 template <class T> friend void f(T) {}
4486 the friend declaration actually provides the definition
4487 of `f', once C has been instantiated for some type. So,
4488 old_decl will be the out-of-class template declaration,
4489 while new_friend is the in-class definition.
4491 But, if `f' was called before this point, the
4492 instantiation of `f' will have DECL_TI_ARGS corresponding
4493 to `T' but not to `U', references to which might appear
4494 in the definition of `f'. Previously, the most general
4495 template for an instantiation of `f' was the out-of-class
4496 version; now it is the in-class version. Therefore, we
4497 run through all specialization of `f', adding to their
4498 DECL_TI_ARGS appropriately. In particular, they need a
4499 new set of outer arguments, corresponding to the
4500 arguments for this class instantiation.
4502 The same situation can arise with something like this:
4505 template <class T> class C {
4509 when `C<int>' is instantiated. Now, `f(int)' is defined
4512 if (!new_friend_is_defn
)
4513 /* On the other hand, if the in-class declaration does
4514 *not* provide a definition, then we don't want to alter
4515 existing definitions. We can just leave everything
4520 /* Overwrite whatever template info was there before, if
4521 any, with the new template information pertaining to
4523 DECL_TEMPLATE_INFO (old_decl
) = new_friend_template_info
;
4525 if (TREE_CODE (old_decl
) != TEMPLATE_DECL
)
4526 /* duplicate_decls will take care of this case. */
4531 tree new_friend_args
;
4533 DECL_TEMPLATE_INFO (DECL_RESULT (old_decl
))
4534 = new_friend_result_template_info
;
4536 new_friend_args
= TI_ARGS (new_friend_template_info
);
4537 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (old_decl
);
4541 tree spec
= TREE_VALUE (t
);
4544 = add_outermost_template_args (new_friend_args
,
4545 DECL_TI_ARGS (spec
));
4548 /* Now, since specializations are always supposed to
4549 hang off of the most general template, we must move
4551 t
= most_general_template (old_decl
);
4554 DECL_TEMPLATE_SPECIALIZATIONS (t
)
4555 = chainon (DECL_TEMPLATE_SPECIALIZATIONS (t
),
4556 DECL_TEMPLATE_SPECIALIZATIONS (old_decl
));
4557 DECL_TEMPLATE_SPECIALIZATIONS (old_decl
) = NULL_TREE
;
4562 /* The information from NEW_FRIEND has been merged into OLD_DECL
4563 by duplicate_decls. */
4564 new_friend
= old_decl
;
4567 else if (TYPE_SIZE (DECL_CONTEXT (new_friend
)))
4569 /* Check to see that the declaration is really present, and,
4570 possibly obtain an improved declaration. */
4571 tree fn
= check_classfn (DECL_CONTEXT (new_friend
),
4580 input_filename
= file
;
4584 /* FRIEND_TMPL is a friend TEMPLATE_DECL. ARGS is the vector of
4585 template arguments, as for tsubst.
4587 Returns an appropriate tsbust'd friend type. */
4590 tsubst_friend_class (friend_tmpl
, args
)
4597 /* First, we look for a class template. */
4598 tmpl
= lookup_name (DECL_NAME (friend_tmpl
), /*prefer_type=*/0);
4600 /* But, if we don't find one, it might be because we're in a
4601 situation like this:
4609 Here, in the scope of (say) S<int>, `S' is bound to a TYPE_DECL
4610 for `S<int>', not the TEMPLATE_DECL. */
4611 if (!tmpl
|| !DECL_CLASS_TEMPLATE_P (tmpl
))
4613 tmpl
= lookup_name (DECL_NAME (friend_tmpl
), /*prefer_type=*/1);
4614 tmpl
= maybe_get_template_decl_from_type_decl (tmpl
);
4617 if (tmpl
&& DECL_CLASS_TEMPLATE_P (tmpl
))
4619 /* The friend template has already been declared. Just
4620 check to see that the declarations match, and install any new
4621 default parameters. We must tsubst the default parameters,
4622 of course. We only need the innermost template parameters
4623 because that is all that redeclare_class_template will look
4626 = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_tmpl
),
4627 args
, /*complain=*/1);
4628 redeclare_class_template (TREE_TYPE (tmpl
), parms
);
4629 friend_type
= TREE_TYPE (tmpl
);
4633 /* The friend template has not already been declared. In this
4634 case, the instantiation of the template class will cause the
4635 injection of this template into the global scope. */
4636 tmpl
= tsubst (friend_tmpl
, args
, /*complain=*/1, NULL_TREE
);
4638 /* The new TMPL is not an instantiation of anything, so we
4639 forget its origins. We don't reset CLASSTYPE_TI_TEMPLATE for
4640 the new type because that is supposed to be the corresponding
4641 template decl, i.e., TMPL. */
4642 DECL_USE_TEMPLATE (tmpl
) = 0;
4643 DECL_TEMPLATE_INFO (tmpl
) = NULL_TREE
;
4644 CLASSTYPE_USE_TEMPLATE (TREE_TYPE (tmpl
)) = 0;
4646 /* Inject this template into the global scope. */
4647 friend_type
= TREE_TYPE (pushdecl_top_level (tmpl
));
4654 instantiate_class_template (type
)
4657 tree
template, args
, pattern
, t
;
4660 if (type
== error_mark_node
)
4661 return error_mark_node
;
4663 if (TYPE_BEING_DEFINED (type
) || TYPE_SIZE (type
))
4666 /* Figure out which template is being instantiated. */
4667 template = most_general_template (CLASSTYPE_TI_TEMPLATE (type
));
4668 my_friendly_assert (TREE_CODE (template) == TEMPLATE_DECL
, 279);
4670 /* Figure out which arguments are being used to do the
4672 args
= CLASSTYPE_TI_ARGS (type
);
4673 PARTIAL_INSTANTIATION_P (type
) = uses_template_parms (args
);
4675 if (pedantic
&& PARTIAL_INSTANTIATION_P (type
))
4676 /* If this is a partial instantiation, then we can't instantiate
4677 the type; there's no telling whether or not one of the
4678 template parameters might eventually be instantiated to some
4679 value that results in a specialization being used. For
4691 Now, the `S<U>' in `f<int>' is the specialization, not an
4692 instantiation of the original template. */
4695 /* Determine what specialization of the original template to
4697 if (PARTIAL_INSTANTIATION_P (type
))
4698 /* There's no telling which specialization is appropriate at this
4699 point. Since all peeking at the innards of this partial
4700 instantiation are extensions (like the "implicit typename"
4701 extension, which allows users to omit the keyword `typename' on
4702 names that are declared as types in template base classes), we
4703 are free to do what we please.
4705 Trying to figure out which partial instantiation to use can
4706 cause a crash. (Some of the template arguments don't even have
4707 types.) So, we just use the most general version. */
4711 t
= most_specialized_class (template, args
);
4713 if (t
== error_mark_node
)
4715 const char *str
= "candidates are:";
4716 cp_error ("ambiguous class template instantiation for `%#T'", type
);
4717 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (template); t
;
4720 if (get_class_bindings (TREE_VALUE (t
), TREE_PURPOSE (t
),
4723 cp_error_at ("%s %+#T", str
, TREE_TYPE (t
));
4727 TYPE_BEING_DEFINED (type
) = 1;
4728 return error_mark_node
;
4733 pattern
= TREE_TYPE (t
);
4735 pattern
= TREE_TYPE (template);
4737 /* If the template we're instantiating is incomplete, then clearly
4738 there's nothing we can do. */
4739 if (TYPE_SIZE (pattern
) == NULL_TREE
)
4742 /* If this is a partial instantiation, don't tsubst anything. We will
4743 only use this type for implicit typename, so the actual contents don't
4744 matter. All that matters is whether a particular name is a type. */
4745 if (PARTIAL_INSTANTIATION_P (type
))
4747 /* The fields set here must be kept in sync with those cleared
4748 in begin_class_definition. */
4749 TYPE_BINFO_BASETYPES (type
) = TYPE_BINFO_BASETYPES (pattern
);
4750 TYPE_FIELDS (type
) = TYPE_FIELDS (pattern
);
4751 TYPE_METHODS (type
) = TYPE_METHODS (pattern
);
4752 CLASSTYPE_TAGS (type
) = CLASSTYPE_TAGS (pattern
);
4753 /* Pretend that the type is complete, so that we will look
4754 inside it during name lookup and such. */
4755 TYPE_SIZE (type
) = integer_zero_node
;
4759 /* If we've recursively instantiated too many templates, stop. */
4760 if (! push_tinst_level (type
))
4763 /* Now we're really doing the instantiation. Mark the type as in
4764 the process of being defined. */
4765 TYPE_BEING_DEFINED (type
) = 1;
4767 maybe_push_to_top_level (uses_template_parms (type
));
4771 /* This TYPE is actually a instantiation of of a partial
4772 specialization. We replace the innermost set of ARGS with
4773 the arguments appropriate for substitution. For example,
4776 template <class T> struct S {};
4777 template <class T> struct S<T*> {};
4779 and supposing that we are instantiating S<int*>, ARGS will
4780 present be {int*} but we need {int}. */
4782 = get_class_bindings (TREE_VALUE (t
), TREE_PURPOSE (t
),
4785 /* If there were multiple levels in ARGS, replacing the
4786 innermost level would alter CLASSTYPE_TI_ARGS, which we don't
4787 want, so we make a copy first. */
4788 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
4790 args
= copy_node (args
);
4791 SET_TMPL_ARGS_LEVEL (args
, TMPL_ARGS_DEPTH (args
), inner_args
);
4797 if (flag_external_templates
)
4799 if (flag_alt_external_templates
)
4801 CLASSTYPE_INTERFACE_ONLY (type
) = interface_only
;
4802 SET_CLASSTYPE_INTERFACE_UNKNOWN_X (type
, interface_unknown
);
4803 CLASSTYPE_VTABLE_NEEDS_WRITING (type
)
4804 = (! CLASSTYPE_INTERFACE_ONLY (type
)
4805 && CLASSTYPE_INTERFACE_KNOWN (type
));
4809 CLASSTYPE_INTERFACE_ONLY (type
) = CLASSTYPE_INTERFACE_ONLY (pattern
);
4810 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
4811 (type
, CLASSTYPE_INTERFACE_UNKNOWN (pattern
));
4812 CLASSTYPE_VTABLE_NEEDS_WRITING (type
)
4813 = (! CLASSTYPE_INTERFACE_ONLY (type
)
4814 && CLASSTYPE_INTERFACE_KNOWN (type
));
4819 SET_CLASSTYPE_INTERFACE_UNKNOWN (type
);
4820 CLASSTYPE_VTABLE_NEEDS_WRITING (type
) = 1;
4823 TYPE_HAS_CONSTRUCTOR (type
) = TYPE_HAS_CONSTRUCTOR (pattern
);
4824 TYPE_HAS_DESTRUCTOR (type
) = TYPE_HAS_DESTRUCTOR (pattern
);
4825 TYPE_OVERLOADS_CALL_EXPR (type
) = TYPE_OVERLOADS_CALL_EXPR (pattern
);
4826 TYPE_OVERLOADS_ARRAY_REF (type
) = TYPE_OVERLOADS_ARRAY_REF (pattern
);
4827 TYPE_OVERLOADS_ARROW (type
) = TYPE_OVERLOADS_ARROW (pattern
);
4828 TYPE_GETS_NEW (type
) = TYPE_GETS_NEW (pattern
);
4829 TYPE_GETS_DELETE (type
) = TYPE_GETS_DELETE (pattern
);
4830 TYPE_VEC_DELETE_TAKES_SIZE (type
) = TYPE_VEC_DELETE_TAKES_SIZE (pattern
);
4831 TYPE_HAS_ASSIGN_REF (type
) = TYPE_HAS_ASSIGN_REF (pattern
);
4832 TYPE_HAS_CONST_ASSIGN_REF (type
) = TYPE_HAS_CONST_ASSIGN_REF (pattern
);
4833 TYPE_HAS_ABSTRACT_ASSIGN_REF (type
) = TYPE_HAS_ABSTRACT_ASSIGN_REF (pattern
);
4834 TYPE_HAS_INIT_REF (type
) = TYPE_HAS_INIT_REF (pattern
);
4835 TYPE_HAS_CONST_INIT_REF (type
) = TYPE_HAS_CONST_INIT_REF (pattern
);
4836 TYPE_HAS_DEFAULT_CONSTRUCTOR (type
) = TYPE_HAS_DEFAULT_CONSTRUCTOR (pattern
);
4837 TYPE_HAS_CONVERSION (type
) = TYPE_HAS_CONVERSION (pattern
);
4838 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (type
)
4839 = TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (pattern
);
4840 TYPE_USES_MULTIPLE_INHERITANCE (type
)
4841 = TYPE_USES_MULTIPLE_INHERITANCE (pattern
);
4842 TYPE_USES_VIRTUAL_BASECLASSES (type
)
4843 = TYPE_USES_VIRTUAL_BASECLASSES (pattern
);
4844 TYPE_PACKED (type
) = TYPE_PACKED (pattern
);
4845 TYPE_ALIGN (type
) = TYPE_ALIGN (pattern
);
4846 TYPE_FOR_JAVA (type
) = TYPE_FOR_JAVA (pattern
); /* For libjava's JArray<T> */
4847 if (ANON_AGGR_TYPE_P (pattern
))
4848 SET_ANON_AGGR_TYPE_P (type
);
4850 if (TYPE_BINFO_BASETYPES (pattern
))
4852 tree base_list
= NULL_TREE
;
4853 tree pbases
= TYPE_BINFO_BASETYPES (pattern
);
4856 /* Substitute into each of the bases to determine the actual
4858 for (i
= 0; i
< TREE_VEC_LENGTH (pbases
); ++i
)
4864 pbase
= TREE_VEC_ELT (pbases
, i
);
4866 /* Substitue to figure out the base class. */
4867 base
= tsubst (BINFO_TYPE (pbase
), args
,
4868 /*complain=*/1, NULL_TREE
);
4869 if (base
== error_mark_node
)
4872 /* Calculate the correct access node. */
4873 if (TREE_VIA_VIRTUAL (pbase
))
4875 if (TREE_VIA_PUBLIC (pbase
))
4876 access
= access_public_virtual_node
;
4877 else if (TREE_VIA_PROTECTED (pbase
))
4878 access
= access_protected_virtual_node
;
4880 access
= access_private_virtual_node
;
4884 if (TREE_VIA_PUBLIC (pbase
))
4885 access
= access_public_node
;
4886 else if (TREE_VIA_PROTECTED (pbase
))
4887 access
= access_protected_node
;
4889 access
= access_private_node
;
4892 base_list
= tree_cons (access
, base
, base_list
);
4895 /* The list is now in reverse order; correct that. */
4896 base_list
= nreverse (base_list
);
4898 /* Now call xref_basetypes to set up all the base-class
4900 xref_basetypes (TREE_CODE (pattern
) == RECORD_TYPE
4901 ? (CLASSTYPE_DECLARED_CLASS (pattern
)
4902 ? class_type_node
: record_type_node
)
4904 DECL_NAME (TYPE_NAME (pattern
)),
4909 /* Now that our base classes are set up, enter the scope of the
4910 class, so that name lookups into base classes, etc. will work
4911 corectly. This is precisely analagous to what we do in
4912 begin_class_definition when defining an ordinary non-template
4914 pushclass (type
, 1);
4916 for (t
= CLASSTYPE_TAGS (pattern
); t
; t
= TREE_CHAIN (t
))
4918 tree tag
= TREE_VALUE (t
);
4919 tree name
= TYPE_IDENTIFIER (tag
);
4922 newtag
= tsubst (tag
, args
, /*complain=*/1, NULL_TREE
);
4923 if (TREE_CODE (newtag
) != ENUMERAL_TYPE
)
4925 if (TYPE_LANG_SPECIFIC (tag
) && CLASSTYPE_IS_TEMPLATE (tag
))
4926 /* Unfortunately, lookup_template_class sets
4927 CLASSTYPE_IMPLICIT_INSTANTIATION for a partial
4928 instantiation (i.e., for the type of a member template
4929 class nested within a template class.) This behavior is
4930 required for maybe_process_partial_specialization to work
4931 correctly, but is not accurate in this case; the TAG is not
4932 an instantiation of anything. (The corresponding
4933 TEMPLATE_DECL is an instantiation, but the TYPE is not.) */
4934 CLASSTYPE_USE_TEMPLATE (newtag
) = 0;
4936 /* Now, we call pushtag to put this NEWTAG into the scope of
4937 TYPE. We first set up the IDENTIFIER_TYPE_VALUE to avoid
4938 pushtag calling push_template_decl. We don't have to do
4939 this for enums because it will already have been done in
4942 SET_IDENTIFIER_TYPE_VALUE (name
, newtag
);
4943 pushtag (name
, newtag
, /*globalize=*/0);
4947 /* Don't replace enum constants here. */
4948 for (t
= TYPE_FIELDS (pattern
); t
; t
= TREE_CHAIN (t
))
4949 if (TREE_CODE (t
) != CONST_DECL
)
4953 /* The the file and line for this declaration, to assist in
4954 error message reporting. Since we called push_tinst_level
4955 above, we don't need to restore these. */
4956 lineno
= DECL_SOURCE_LINE (t
);
4957 input_filename
= DECL_SOURCE_FILE (t
);
4959 r
= tsubst (t
, args
, /*complain=*/1, NULL_TREE
);
4960 if (TREE_CODE (r
) == VAR_DECL
)
4964 if (DECL_DEFINED_IN_CLASS_P (r
))
4965 init
= tsubst_expr (DECL_INITIAL (t
), args
,
4966 /*complain=*/1, NULL_TREE
);
4970 finish_static_data_member_decl (r
, init
,
4971 /*asmspec_tree=*/NULL_TREE
,
4974 if (DECL_DEFINED_IN_CLASS_P (r
))
4975 check_static_variable_definition (r
, TREE_TYPE (r
));
4978 /* R will have a TREE_CHAIN if and only if it has already been
4979 processed by finish_member_declaration. This can happen
4980 if, for example, it is a TYPE_DECL for a class-scoped
4981 ENUMERAL_TYPE; such a thing will already have been added to
4982 the field list by tsubst_enum above. */
4983 if (!TREE_CHAIN (r
))
4985 set_current_access_from_decl (r
);
4986 finish_member_declaration (r
);
4990 /* Set up the list (TYPE_METHODS) and vector (CLASSTYPE_METHOD_VEC)
4991 for this instantiation. */
4992 for (t
= TYPE_METHODS (pattern
); t
; t
= TREE_CHAIN (t
))
4994 tree r
= tsubst (t
, args
, /*complain=*/1, NULL_TREE
);
4995 set_current_access_from_decl (r
);
4996 finish_member_declaration (r
);
4999 /* Construct the DECL_FRIENDLIST for the new class type. */
5000 typedecl
= TYPE_MAIN_DECL (type
);
5001 for (t
= DECL_FRIENDLIST (TYPE_MAIN_DECL (pattern
));
5007 for (friends
= TREE_VALUE (t
);
5008 friends
!= NULL_TREE
;
5009 friends
= TREE_CHAIN (friends
))
5010 if (TREE_PURPOSE (friends
) == error_mark_node
)
5012 tsubst_friend_function (TREE_VALUE (friends
),
5016 tsubst_copy (TREE_PURPOSE (t
), args
,
5017 /*complain=*/1, NULL_TREE
),
5018 tsubst (TREE_PURPOSE (friends
), args
,
5019 /*complain=*/1, NULL_TREE
));
5022 for (t
= CLASSTYPE_FRIEND_CLASSES (pattern
);
5026 tree friend_type
= TREE_VALUE (t
);
5027 tree new_friend_type
;
5029 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
5030 new_friend_type
= tsubst_friend_class (friend_type
, args
);
5031 else if (uses_template_parms (friend_type
))
5032 new_friend_type
= tsubst (friend_type
, args
, /*complain=*/1,
5036 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (friend_type
));
5038 /* The call to xref_tag_from_type does injection for friend
5040 push_nested_namespace (ns
);
5042 xref_tag_from_type (friend_type
, NULL_TREE
, 1);
5043 pop_nested_namespace (ns
);
5046 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
5047 /* Trick make_friend_class into realizing that the friend
5048 we're adding is a template, not an ordinary class. It's
5049 important that we use make_friend_class since it will
5050 perform some error-checking and output cross-reference
5052 ++processing_template_decl
;
5054 make_friend_class (type
, new_friend_type
);
5056 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
5057 --processing_template_decl
;
5060 for (t
= TYPE_FIELDS (type
); t
; t
= TREE_CHAIN (t
))
5061 if (TREE_CODE (t
) == FIELD_DECL
)
5063 TREE_TYPE (t
) = complete_type (TREE_TYPE (t
));
5064 require_complete_type (t
);
5067 /* Set the file and line number information to whatever is given for
5068 the class itself. This puts error messages involving generated
5069 implicit functions at a predictable point, and the same point
5070 that would be used for non-template classes. */
5071 lineno
= DECL_SOURCE_LINE (typedecl
);
5072 input_filename
= DECL_SOURCE_FILE (typedecl
);
5074 unreverse_member_declarations (type
);
5075 finish_struct_1 (type
);
5076 CLASSTYPE_GOT_SEMICOLON (type
) = 1;
5078 /* Clear this now so repo_template_used is happy. */
5079 TYPE_BEING_DEFINED (type
) = 0;
5080 repo_template_used (type
);
5082 /* Now that the class is complete, instantiate default arguments for
5083 any member functions. We don't do this earlier because the
5084 default arguments may reference members of the class. */
5085 if (!PRIMARY_TEMPLATE_P (template))
5086 for (t
= TYPE_METHODS (type
); t
; t
= TREE_CHAIN (t
))
5087 if (TREE_CODE (t
) == FUNCTION_DECL
5088 /* Implicitly generated member functions will not have tmplate
5089 information; they are not instantiations, but instead are
5090 created "fresh" for each instantiation. */
5091 && DECL_TEMPLATE_INFO (t
))
5092 tsubst_default_arguments (t
);
5095 pop_from_top_level ();
5105 if (t1
== NULL_TREE
)
5106 return t2
== NULL_TREE
;
5107 if (t2
== NULL_TREE
)
5109 /* Don't care if one declares its arg const and the other doesn't -- the
5110 main variant of the arg type is all that matters. */
5111 if (TYPE_MAIN_VARIANT (TREE_VALUE (t1
))
5112 != TYPE_MAIN_VARIANT (TREE_VALUE (t2
)))
5114 return list_eq (TREE_CHAIN (t1
), TREE_CHAIN (t2
));
5117 /* If arg is a non-type template parameter that does not depend on template
5118 arguments, fold it like we weren't in the body of a template. */
5121 maybe_fold_nontype_arg (arg
)
5124 /* If we're not in a template, ARG is already as simple as it's going to
5125 get, and trying to reprocess the trees will break. */
5126 if (! processing_template_decl
)
5129 if (TREE_CODE_CLASS (TREE_CODE (arg
)) != 't'
5130 && !uses_template_parms (arg
))
5132 /* Sometimes, one of the args was an expression involving a
5133 template constant parameter, like N - 1. Now that we've
5134 tsubst'd, we might have something like 2 - 1. This will
5135 confuse lookup_template_class, so we do constant folding
5136 here. We have to unset processing_template_decl, to
5137 fool build_expr_from_tree() into building an actual
5140 int saved_processing_template_decl
= processing_template_decl
;
5141 processing_template_decl
= 0;
5142 arg
= fold (build_expr_from_tree (arg
));
5143 processing_template_decl
= saved_processing_template_decl
;
5148 /* Return the TREE_VEC with the arguments for the innermost template header,
5149 where ARGS is either that or the VEC of VECs for all the
5153 innermost_args (args
)
5156 return TMPL_ARGS_LEVEL (args
, TMPL_ARGS_DEPTH (args
));
5159 /* Substitute ARGS into the vector of template arguments T. */
5162 tsubst_template_arg_vector (t
, args
, complain
)
5167 int len
= TREE_VEC_LENGTH (t
), need_new
= 0, i
;
5168 tree
*elts
= (tree
*) alloca (len
* sizeof (tree
));
5170 bzero ((char *) elts
, len
* sizeof (tree
));
5172 for (i
= 0; i
< len
; i
++)
5174 if (TREE_VEC_ELT (t
, i
) != NULL_TREE
5175 && TREE_CODE (TREE_VEC_ELT (t
, i
)) == TREE_VEC
)
5176 elts
[i
] = tsubst_template_arg_vector (TREE_VEC_ELT (t
, i
),
5179 elts
[i
] = maybe_fold_nontype_arg
5180 (tsubst_expr (TREE_VEC_ELT (t
, i
), args
, complain
,
5183 if (elts
[i
] != TREE_VEC_ELT (t
, i
))
5190 t
= make_tree_vec (len
);
5191 for (i
= 0; i
< len
; i
++)
5192 TREE_VEC_ELT (t
, i
) = elts
[i
];
5197 /* Return the result of substituting ARGS into the template parameters
5198 given by PARMS. If there are m levels of ARGS and m + n levels of
5199 PARMS, then the result will contain n levels of PARMS. For
5200 example, if PARMS is `template <class T> template <class U>
5201 template <T*, U, class V>' and ARGS is {{int}, {double}} then the
5202 result will be `template <int*, double, class V>'. */
5205 tsubst_template_parms (parms
, args
, complain
)
5213 for (new_parms
= &r
;
5214 TMPL_PARMS_DEPTH (parms
) > TMPL_ARGS_DEPTH (args
);
5215 new_parms
= &(TREE_CHAIN (*new_parms
)),
5216 parms
= TREE_CHAIN (parms
))
5219 make_tree_vec (TREE_VEC_LENGTH (TREE_VALUE (parms
)));
5222 for (i
= 0; i
< TREE_VEC_LENGTH (new_vec
); ++i
)
5224 tree default_value
=
5225 TREE_PURPOSE (TREE_VEC_ELT (TREE_VALUE (parms
), i
));
5227 TREE_VALUE (TREE_VEC_ELT (TREE_VALUE (parms
), i
));
5229 TREE_VEC_ELT (new_vec
, i
)
5230 = build_tree_list (tsubst (default_value
, args
, complain
,
5232 tsubst (parm_decl
, args
, complain
,
5237 tree_cons (build_int_2 (0, (TMPL_PARMS_DEPTH (parms
)
5238 - TMPL_ARGS_DEPTH (args
))),
5239 new_vec
, NULL_TREE
);
5245 /* Substitute the ARGS into the indicated aggregate (or enumeration)
5246 type T. If T is not an aggregate or enumeration type, it is
5247 handled as if by tsubst. IN_DECL is as for tsubst. If
5248 ENTERING_SCOPE is non-zero, T is the context for a template which
5249 we are presently tsubst'ing. Return the subsituted value. */
5252 tsubst_aggr_type (t
, args
, complain
, in_decl
, entering_scope
)
5262 switch (TREE_CODE (t
))
5265 if (TYPE_PTRMEMFUNC_P (t
))
5267 tree r
= build_ptrmemfunc_type
5268 (tsubst (TYPE_PTRMEMFUNC_FN_TYPE (t
), args
, complain
, in_decl
));
5269 return cp_build_qualified_type_real (r
, TYPE_QUALS (t
),
5273 /* else fall through */
5276 if (TYPE_TEMPLATE_INFO (t
))
5282 /* First, determine the context for the type we are looking
5284 if (TYPE_CONTEXT (t
) != NULL_TREE
)
5285 context
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
,
5287 in_decl
, /*entering_scope=*/1);
5289 context
= NULL_TREE
;
5291 /* Then, figure out what arguments are appropriate for the
5292 type we are trying to find. For example, given:
5294 template <class T> struct S;
5295 template <class T, class U> void f(T, U) { S<U> su; }
5297 and supposing that we are instantiating f<int, double>,
5298 then our ARGS will be {int, double}, but, when looking up
5299 S we only want {double}. */
5300 argvec
= tsubst_template_arg_vector (TYPE_TI_ARGS (t
), args
,
5303 r
= lookup_template_class (t
, argvec
, in_decl
, context
,
5306 return cp_build_qualified_type_real (r
, TYPE_QUALS (t
),
5310 /* This is not a template type, so there's nothing to do. */
5314 return tsubst (t
, args
, complain
, in_decl
);
5318 /* Substitute into the default argument ARG (a default argument for
5319 FN), which has the indicated TYPE. */
5322 tsubst_default_argument (fn
, type
, arg
)
5327 /* This default argument came from a template. Instantiate the
5328 default argument here, not in tsubst. In the case of
5337 we must be careful to do name lookup in the scope of S<T>,
5338 rather than in the current class. */
5339 if (DECL_CLASS_SCOPE_P (fn
))
5340 pushclass (DECL_REAL_CONTEXT (fn
), 2);
5342 arg
= tsubst_expr (arg
, DECL_TI_ARGS (fn
), /*complain=*/1, NULL_TREE
);
5344 if (DECL_CLASS_SCOPE_P (fn
))
5347 /* Make sure the default argument is reasonable. */
5348 arg
= check_default_argument (type
, arg
);
5353 /* Substitute into all the default arguments for FN. */
5356 tsubst_default_arguments (fn
)
5362 tmpl_args
= DECL_TI_ARGS (fn
);
5364 /* If this function is not yet instantiated, we certainly don't need
5365 its default arguments. */
5366 if (uses_template_parms (tmpl_args
))
5369 for (arg
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
5371 arg
= TREE_CHAIN (arg
))
5372 if (TREE_PURPOSE (arg
))
5373 TREE_PURPOSE (arg
) = tsubst_default_argument (fn
,
5375 TREE_PURPOSE (arg
));
5378 /* Substitute the ARGS into the T, which is a _DECL. TYPE is the
5379 (already computed) substitution of ARGS into TREE_TYPE (T), if
5380 appropriate. Return the result of the substitution. IN_DECL is as
5384 tsubst_decl (t
, args
, type
, in_decl
)
5391 char* saved_filename
;
5394 /* Set the filename and linenumber to improve error-reporting. */
5395 saved_lineno
= lineno
;
5396 saved_filename
= input_filename
;
5397 lineno
= DECL_SOURCE_LINE (t
);
5398 input_filename
= DECL_SOURCE_FILE (t
);
5400 switch (TREE_CODE (t
))
5404 /* We can get here when processing a member template function
5405 of a template class. */
5406 tree decl
= DECL_TEMPLATE_RESULT (t
);
5408 int is_template_template_parm
= DECL_TEMPLATE_TEMPLATE_PARM_P (t
);
5410 if (!is_template_template_parm
)
5412 /* We might already have an instance of this template.
5413 The ARGS are for the surrounding class type, so the
5414 full args contain the tsubst'd args for the context,
5415 plus the innermost args from the template decl. */
5416 tree tmpl_args
= DECL_CLASS_TEMPLATE_P (t
)
5417 ? CLASSTYPE_TI_ARGS (TREE_TYPE (t
))
5418 : DECL_TI_ARGS (DECL_RESULT (t
));
5421 full_args
= tsubst_template_arg_vector (tmpl_args
, args
,
5424 /* tsubst_template_arg_vector doesn't copy the vector if
5425 nothing changed. But, *something* should have
5427 my_friendly_assert (full_args
!= tmpl_args
, 0);
5429 spec
= retrieve_specialization (t
, full_args
);
5430 if (spec
!= NULL_TREE
)
5437 /* Make a new template decl. It will be similar to the
5438 original, but will record the current template arguments.
5439 We also create a new function declaration, which is just
5440 like the old one, but points to this new template, rather
5441 than the old one. */
5444 my_friendly_assert (DECL_LANG_SPECIFIC (r
) != 0, 0);
5445 TREE_CHAIN (r
) = NULL_TREE
;
5447 if (is_template_template_parm
)
5449 tree new_decl
= tsubst (decl
, args
, /*complain=*/1, in_decl
);
5450 DECL_RESULT (r
) = new_decl
;
5451 TREE_TYPE (r
) = TREE_TYPE (new_decl
);
5456 = tsubst_aggr_type (DECL_CONTEXT (t
), args
, /*complain=*/1,
5457 in_decl
, /*entering_scope=*/1);
5458 DECL_CLASS_CONTEXT (r
)
5459 = tsubst_aggr_type (DECL_CLASS_CONTEXT (t
), args
,
5460 /*complain=*/1, in_decl
,
5461 /*entering_scope=*/1);
5462 DECL_TEMPLATE_INFO (r
) = build_tree_list (t
, args
);
5464 if (TREE_CODE (decl
) == TYPE_DECL
)
5466 tree new_type
= tsubst (TREE_TYPE (t
), args
,
5467 /*complain=*/1, in_decl
);
5468 TREE_TYPE (r
) = new_type
;
5469 CLASSTYPE_TI_TEMPLATE (new_type
) = r
;
5470 DECL_RESULT (r
) = TYPE_MAIN_DECL (new_type
);
5471 DECL_TI_ARGS (r
) = CLASSTYPE_TI_ARGS (new_type
);
5475 tree new_decl
= tsubst (decl
, args
, /*complain=*/1, in_decl
);
5476 DECL_RESULT (r
) = new_decl
;
5477 DECL_TI_TEMPLATE (new_decl
) = r
;
5478 TREE_TYPE (r
) = TREE_TYPE (new_decl
);
5479 DECL_TI_ARGS (r
) = DECL_TI_ARGS (new_decl
);
5482 SET_DECL_IMPLICIT_INSTANTIATION (r
);
5483 DECL_TEMPLATE_INSTANTIATIONS (r
) = NULL_TREE
;
5484 DECL_TEMPLATE_SPECIALIZATIONS (r
) = NULL_TREE
;
5486 /* The template parameters for this new template are all the
5487 template parameters for the old template, except the
5488 outermost level of parameters. */
5489 DECL_TEMPLATE_PARMS (r
)
5490 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t
), args
,
5493 if (PRIMARY_TEMPLATE_P (t
))
5494 DECL_PRIMARY_TEMPLATE (r
) = r
;
5496 /* We don't partially instantiate partial specializations. */
5497 if (TREE_CODE (decl
) == TYPE_DECL
)
5500 for (spec
= DECL_TEMPLATE_SPECIALIZATIONS (t
);
5502 spec
= TREE_CHAIN (spec
))
5504 /* It helps to consider example here. Consider:
5515 Now, for example, we are instantiating S<int>::f(U u).
5516 We want to make a template:
5521 It will have a specialization, for the case U = int*, of
5525 void S<int>::f<int*>(int*);
5527 This specialization will be an instantiation of
5528 the specialization given in the declaration of S, with
5529 argument list int*. */
5531 tree fn
= TREE_VALUE (spec
);
5535 if (!DECL_TEMPLATE_SPECIALIZATION (fn
))
5536 /* Instantiations are on the same list, but they're of
5537 no concern to us. */
5540 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
5541 /* A full specialization. There's no need to record
5545 spec_args
= tsubst (DECL_TI_ARGS (fn
), args
,
5546 /*complain=*/1, in_decl
);
5547 new_fn
= tsubst (DECL_RESULT (most_general_template (fn
)),
5548 spec_args
, /*complain=*/1, in_decl
);
5549 DECL_TI_TEMPLATE (new_fn
) = fn
;
5550 register_specialization (new_fn
, r
,
5551 innermost_args (spec_args
));
5554 /* Record this partial instantiation. */
5555 register_specialization (r
, t
,
5556 DECL_TI_ARGS (DECL_RESULT (r
)));
5564 tree argvec
= NULL_TREE
;
5571 /* Nobody should be tsubst'ing into non-template functions. */
5572 my_friendly_assert (DECL_TEMPLATE_INFO (t
) != NULL_TREE
, 0);
5574 if (TREE_CODE (DECL_TI_TEMPLATE (t
)) == TEMPLATE_DECL
)
5578 /* Calculate the most general template of which R is a
5579 specialization, and the complete set of arguments used to
5581 gen_tmpl
= most_general_template (DECL_TI_TEMPLATE (t
));
5583 = tsubst_template_arg_vector (DECL_TI_ARGS
5584 (DECL_TEMPLATE_RESULT (gen_tmpl
)),
5585 args
, /*complain=*/1);
5587 /* Check to see if we already have this specialization. */
5588 spec
= retrieve_specialization (gen_tmpl
, argvec
);
5596 /* Here, we deal with the peculiar case:
5598 template <class T> struct S {
5599 template <class U> friend void f();
5601 template <class U> friend void f() {}
5603 template void f<double>();
5605 Here, the ARGS for the instantiation of will be {int,
5606 double}. But, we only need as many ARGS as there are
5607 levels of template parameters in CODE_PATTERN. We are
5608 careful not to get fooled into reducing the ARGS in
5611 template <class T> struct S { template <class U> void f(U); }
5612 template <class T> template <> void S<T>::f(int) {}
5614 which we can spot because the pattern will be a
5615 specialization in this case. */
5616 args_depth
= TMPL_ARGS_DEPTH (args
);
5618 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (t
)));
5619 if (args_depth
> parms_depth
5620 && !DECL_TEMPLATE_SPECIALIZATION (t
))
5622 my_friendly_assert (DECL_FRIEND_P (t
), 0);
5624 if (parms_depth
> 1)
5628 args
= make_tree_vec (parms_depth
);
5629 for (i
= 0; i
< parms_depth
; ++i
)
5630 TREE_VEC_ELT (args
, i
) =
5631 TREE_VEC_ELT (args
, i
+ (args_depth
- parms_depth
));
5634 args
= TREE_VEC_ELT (args
, args_depth
- parms_depth
);
5639 /* This special case arises when we have something like this:
5641 template <class T> struct S {
5642 friend void f<int>(int, double);
5645 Here, the DECL_TI_TEMPLATE for the friend declaration
5646 will be a LOOKUP_EXPR or an IDENTIFIER_NODE. We are
5647 being called from tsubst_friend_function, and we want
5648 only to create a new decl (R) with appropriate types so
5649 that we can call determine_specialization. */
5650 my_friendly_assert ((TREE_CODE (DECL_TI_TEMPLATE (t
))
5652 || (TREE_CODE (DECL_TI_TEMPLATE (t
))
5653 == IDENTIFIER_NODE
), 0);
5654 gen_tmpl
= NULL_TREE
;
5657 if (DECL_CLASS_SCOPE_P (t
))
5659 if (DECL_NAME (t
) == constructor_name (DECL_CONTEXT (t
)))
5663 ctx
= tsubst_aggr_type (DECL_CLASS_CONTEXT (t
), args
,
5665 /*entering_scope=*/1);
5672 type
= tsubst (type
, args
, /*complain=*/1, in_decl
);
5673 if (type
== error_mark_node
)
5674 return error_mark_node
;
5676 /* We do NOT check for matching decls pushed separately at this
5677 point, as they may not represent instantiations of this
5678 template, and in any case are considered separate under the
5679 discrete model. Instead, see add_maybe_template. */
5683 DECL_USE_TEMPLATE (r
) = 0;
5684 TREE_TYPE (r
) = type
;
5687 = tsubst_aggr_type (DECL_CONTEXT (t
), args
, /*complain=*/1, t
,
5688 /*entering_scope=*/1);
5689 DECL_CLASS_CONTEXT (r
) = ctx
;
5691 if (member
&& IDENTIFIER_TYPENAME_P (DECL_NAME (r
)))
5692 /* Type-conversion operator. Reconstruct the name, in
5693 case it's the name of one of the template's parameters. */
5694 DECL_NAME (r
) = build_typename_overload (TREE_TYPE (type
));
5696 DECL_ARGUMENTS (r
) = tsubst (DECL_ARGUMENTS (t
), args
,
5698 DECL_MAIN_VARIANT (r
) = r
;
5699 DECL_RESULT (r
) = NULL_TREE
;
5701 TREE_STATIC (r
) = 0;
5702 TREE_PUBLIC (r
) = TREE_PUBLIC (t
);
5703 DECL_EXTERNAL (r
) = 1;
5704 DECL_INTERFACE_KNOWN (r
) = 0;
5705 DECL_DEFER_OUTPUT (r
) = 0;
5706 TREE_CHAIN (r
) = NULL_TREE
;
5707 DECL_PENDING_INLINE_INFO (r
) = 0;
5708 DECL_PENDING_INLINE_P (r
) = 0;
5711 /* Set up the DECL_TEMPLATE_INFO for R and compute its mangled
5712 name. There's no need to do this in the special friend
5713 case mentioned above where GEN_TMPL is NULL. */
5716 DECL_TEMPLATE_INFO (r
)
5717 = tree_cons (gen_tmpl
, argvec
, NULL_TREE
);
5718 SET_DECL_IMPLICIT_INSTANTIATION (r
);
5719 register_specialization (r
, gen_tmpl
, argvec
);
5721 /* Set the mangled name for R. */
5722 if (DECL_DESTRUCTOR_P (t
))
5723 DECL_ASSEMBLER_NAME (r
) = build_destructor_name (ctx
);
5726 /* Instantiations of template functions must be mangled
5727 specially, in order to conform to 14.5.5.1
5728 [temp.over.link]. */
5729 tree tmpl
= DECL_TI_TEMPLATE (t
);
5731 /* TMPL will be NULL if this is a specialization of a
5732 member function of a template class. */
5733 if (name_mangling_version
< 1
5734 || tmpl
== NULL_TREE
5735 || (member
&& !is_member_template (tmpl
)
5736 && !DECL_TEMPLATE_INFO (tmpl
)))
5737 set_mangled_name_for_decl (r
);
5739 set_mangled_name_for_template_decl (r
);
5743 make_decl_rtl (r
, NULL_PTR
, 1);
5745 /* Like grokfndecl. If we don't do this, pushdecl will
5746 mess up our TREE_CHAIN because it doesn't find a
5747 previous decl. Sigh. */
5749 && ! uses_template_parms (r
)
5750 && (IDENTIFIER_GLOBAL_VALUE (DECL_ASSEMBLER_NAME (r
))
5752 SET_IDENTIFIER_GLOBAL_VALUE (DECL_ASSEMBLER_NAME (r
), r
);
5754 /* We're not supposed to instantiate default arguments
5755 until they are called, for a template. But, for a
5758 template <class T> void f ()
5759 { extern void g(int i = T()); }
5761 we should do the substitution when the template is
5762 instantiated. We handle the member function case in
5763 instantiate_class_template since the default arguments
5764 might refer to other members of the class. */
5766 && !PRIMARY_TEMPLATE_P (gen_tmpl
)
5767 && !uses_template_parms (argvec
))
5768 tsubst_default_arguments (r
);
5771 /* Copy the list of befriending classes. */
5772 for (friends
= &DECL_BEFRIENDING_CLASSES (r
);
5774 friends
= &TREE_CHAIN (*friends
))
5776 *friends
= copy_node (*friends
);
5777 TREE_VALUE (*friends
) = tsubst (TREE_VALUE (*friends
),
5778 args
, /*complain=*/1,
5782 if (DECL_CONSTRUCTOR_P (r
))
5784 maybe_retrofit_in_chrg (r
);
5785 grok_ctor_properties (ctx
, r
);
5787 else if (DECL_OVERLOADED_OPERATOR_P (r
))
5788 grok_op_properties (r
, DECL_VIRTUAL_P (r
), DECL_FRIEND_P (r
));
5795 TREE_TYPE (r
) = type
;
5796 c_apply_type_quals_to_decl (CP_TYPE_QUALS (type
), r
);
5798 if (TREE_CODE (DECL_INITIAL (r
)) != TEMPLATE_PARM_INDEX
)
5799 DECL_INITIAL (r
) = TREE_TYPE (r
);
5801 DECL_INITIAL (r
) = tsubst (DECL_INITIAL (r
), args
,
5802 /*complain=*/1, in_decl
);
5804 DECL_CONTEXT (r
) = NULL_TREE
;
5805 if (PROMOTE_PROTOTYPES
5806 && (TREE_CODE (type
) == INTEGER_TYPE
5807 || TREE_CODE (type
) == ENUMERAL_TYPE
)
5808 && TYPE_PRECISION (type
) < TYPE_PRECISION (integer_type_node
))
5809 DECL_ARG_TYPE (r
) = integer_type_node
;
5811 TREE_CHAIN (r
) = tsubst (TREE_CHAIN (t
), args
,
5812 /*complain=*/1, TREE_CHAIN (t
));
5820 TREE_TYPE (r
) = type
;
5821 c_apply_type_quals_to_decl (CP_TYPE_QUALS (type
), r
);
5823 /* We don't have to set DECL_CONTEXT here; it is set by
5824 finish_member_declaration. */
5825 DECL_INITIAL (r
) = tsubst_expr (DECL_INITIAL (t
), args
,
5826 /*complain=*/1, in_decl
);
5827 TREE_CHAIN (r
) = NULL_TREE
;
5828 if (TREE_CODE (type
) == VOID_TYPE
)
5829 cp_error_at ("instantiation of `%D' as type void", r
);
5837 = tsubst_copy (DECL_INITIAL (t
), args
, /*complain=*/1, in_decl
);
5838 TREE_CHAIN (r
) = NULL_TREE
;
5843 if (DECL_IMPLICIT_TYPEDEF_P (t
))
5845 /* For an implicit typedef, we just want the implicit
5846 typedef for the tsubst'd type. We've already got the
5847 tsubst'd type, as TYPE, so we just need it's associated
5849 r
= TYPE_NAME (type
);
5852 else if (!DECL_LANG_SPECIFIC (t
))
5854 /* For a template type parameter, we don't have to do
5855 anything special. */
5856 r
= TYPE_NAME (type
);
5870 /* Nobody should be tsubst'ing into non-template variables. */
5871 my_friendly_assert (DECL_LANG_SPECIFIC (t
)
5872 && DECL_TEMPLATE_INFO (t
) != NULL_TREE
, 0);
5874 if (TYPE_P (CP_DECL_CONTEXT (t
)))
5875 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
,
5877 in_decl
, /*entering_scope=*/1);
5879 /* Subsequent calls to pushdecl will fill this in. */
5882 /* Check to see if we already have this specialization. */
5883 tmpl
= DECL_TI_TEMPLATE (t
);
5884 gen_tmpl
= most_general_template (tmpl
);
5885 argvec
= tsubst (DECL_TI_ARGS (t
), args
, /*complain=*/1, in_decl
);
5887 spec
= retrieve_specialization (gen_tmpl
, argvec
);
5889 spec
= retrieve_local_specialization (gen_tmpl
,
5890 current_function_decl
);
5898 /* This declaration is going to have to be around for a while,
5899 so me make sure it is on a saveable obstack. */
5902 TREE_TYPE (r
) = type
;
5903 c_apply_type_quals_to_decl (CP_TYPE_QUALS (type
), r
);
5904 DECL_CONTEXT (r
) = ctx
;
5906 /* Don't try to expand the initializer until someone tries to use
5907 this variable; otherwise we run into circular dependencies. */
5908 DECL_INITIAL (r
) = NULL_TREE
;
5912 DECL_CLASS_CONTEXT (r
) = DECL_CONTEXT (r
);
5914 /* For __PRETTY_FUNCTION__ we have to adjust the initializer. */
5915 if (DECL_PRETTY_FUNCTION_P (r
))
5917 DECL_INITIAL (r
) = tsubst (DECL_INITIAL (t
),
5921 TREE_TYPE (r
) = TREE_TYPE (DECL_INITIAL (r
));
5924 /* If the template variable was marked TREE_ASM_WRITTEN, that
5925 means we don't need to write out any of the instantiations
5926 either. (__FUNCTION__ and its ilk are marked thusly.) */
5927 TREE_ASM_WRITTEN (r
) = TREE_ASM_WRITTEN (t
);
5929 /* Even if the original location is out of scope, the newly
5930 substituted one is not. */
5931 if (TREE_CODE (r
) == VAR_DECL
)
5932 DECL_DEAD_FOR_LOCAL (r
) = 0;
5934 /* A static data member declaration is always marked external
5935 when it is declared in-class, even if an initializer is
5936 present. We mimic the non-template processing here. */
5938 DECL_EXTERNAL (r
) = 1;
5940 DECL_TEMPLATE_INFO (r
) = tree_cons (tmpl
, argvec
, NULL_TREE
);
5941 SET_DECL_IMPLICIT_INSTANTIATION (r
);
5943 register_specialization (r
, gen_tmpl
, argvec
);
5945 register_local_specialization (r
, gen_tmpl
,
5946 current_function_decl
);
5948 TREE_CHAIN (r
) = NULL_TREE
;
5949 if (TREE_CODE (r
) == VAR_DECL
&& TREE_CODE (type
) == VOID_TYPE
)
5950 cp_error_at ("instantiation of `%D' as type void", r
);
5955 my_friendly_abort (0);
5958 /* Restore the file and line information. */
5959 lineno
= saved_lineno
;
5960 input_filename
= saved_filename
;
5965 /* Substitue into the ARG_TYPES of a function type. */
5968 tsubst_arg_types (arg_types
, args
, complain
, in_decl
)
5974 tree remaining_arg_types
;
5977 if (!arg_types
|| arg_types
== void_list_node
)
5980 remaining_arg_types
= tsubst_arg_types (TREE_CHAIN (arg_types
),
5981 args
, complain
, in_decl
);
5982 if (remaining_arg_types
== error_mark_node
)
5983 return error_mark_node
;
5985 type
= tsubst (TREE_VALUE (arg_types
), args
, complain
, in_decl
);
5986 if (type
== error_mark_node
)
5987 return error_mark_node
;
5989 /* Do array-to-pointer, function-to-pointer conversion, and ignore
5990 top-level qualifiers as required. */
5991 type
= TYPE_MAIN_VARIANT (type_decays_to (type
));
5993 /* Note that we do not substitute into default arguments here. The
5994 standard mandates that they be instantiated only when needed,
5995 which is done in build_over_call. */
5996 return hash_tree_cons (TREE_PURPOSE (arg_types
), type
,
5997 remaining_arg_types
);
6001 /* Substitute into a FUNCTION_TYPE or METHOD_TYPE. This routine does
6002 *not* handle the exception-specification for FNTYPE, because the
6003 initial substitution of explicitly provided template parameters
6004 during argument deduction forbids substitution into the
6005 exception-specification:
6009 All references in the function type of the function template to the
6010 corresponding template parameters are replaced by the specified tem-
6011 plate argument values. If a substitution in a template parameter or
6012 in the function type of the function template results in an invalid
6013 type, type deduction fails. [Note: The equivalent substitution in
6014 exception specifications is done only when the function is instanti-
6015 ated, at which point a program is ill-formed if the substitution
6016 results in an invalid type.] */
6019 tsubst_function_type (t
, args
, complain
, in_decl
)
6029 /* The TYPE_CONTEXT is not used for function/method types. */
6030 my_friendly_assert (TYPE_CONTEXT (t
) == NULL_TREE
, 0);
6032 /* Substitue the return type. */
6033 return_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
6034 if (return_type
== error_mark_node
)
6035 return error_mark_node
;
6037 /* Substitue the argument types. */
6038 arg_types
= tsubst_arg_types (TYPE_ARG_TYPES (t
), args
,
6040 if (arg_types
== error_mark_node
)
6041 return error_mark_node
;
6043 /* Construct a new type node and return it. */
6044 if (TREE_CODE (t
) == FUNCTION_TYPE
)
6045 fntype
= build_function_type (return_type
, arg_types
);
6048 tree r
= TREE_TYPE (TREE_VALUE (arg_types
));
6049 if (! IS_AGGR_TYPE (r
))
6053 Type deduction may fail for any of the following
6056 -- Attempting to create "pointer to member of T" when T
6057 is not a class type. */
6059 cp_error ("creating pointer to member function of non-class type `%T'",
6061 return error_mark_node
;
6064 fntype
= build_cplus_method_type (r
, return_type
, TREE_CHAIN
6067 fntype
= build_qualified_type (fntype
, TYPE_QUALS (t
));
6068 fntype
= build_type_attribute_variant (fntype
, TYPE_ATTRIBUTES (t
));
6073 /* Substitute into the PARMS of a call-declarator. */
6076 tsubst_call_declarator_parms (parms
, args
, complain
, in_decl
)
6086 if (!parms
|| parms
== void_list_node
)
6089 new_parms
= tsubst_call_declarator_parms (TREE_CHAIN (parms
),
6090 args
, complain
, in_decl
);
6092 /* Figure out the type of this parameter. */
6093 type
= tsubst (TREE_VALUE (parms
), args
, complain
, in_decl
);
6095 /* Figure out the default argument as well. Note that we use
6096 tsubst_expr since the default argument is really an expression. */
6097 defarg
= tsubst_expr (TREE_PURPOSE (parms
), args
, complain
, in_decl
);
6099 /* Chain this parameter on to the front of those we have already
6100 processed. We don't use hash_tree_cons because that function
6101 doesn't check TREE_PARMLIST. */
6102 new_parms
= tree_cons (defarg
, type
, new_parms
);
6104 /* And note that these are parameters. */
6105 TREE_PARMLIST (new_parms
) = 1;
6110 /* Take the tree structure T and replace template parameters used
6111 therein with the argument vector ARGS. IN_DECL is an associated
6112 decl for diagnostics. If an error occurs, returns ERROR_MARK_NODE.
6113 An appropriate error message is issued only if COMPLAIN is
6114 non-zero. Note that we must be relatively non-tolerant of
6115 extensions here, in order to preserve conformance; if we allow
6116 substitutions that should not be allowed, we may allow argument
6117 deductions that should not succeed, and therefore report ambiguous
6118 overload situations where there are none. In theory, we could
6119 allow the substitution, but indicate that it should have failed,
6120 and allow our caller to make sure that the right thing happens, but
6121 we don't try to do this yet.
6123 This function is used for dealing with types, decls and the like;
6124 for expressions, use tsubst_expr or tsubst_copy. */
6127 tsubst (t
, args
, complain
, in_decl
)
6134 if (t
== NULL_TREE
|| t
== error_mark_node
6135 || t
== integer_type_node
6136 || t
== void_type_node
6137 || t
== char_type_node
6138 || TREE_CODE (t
) == NAMESPACE_DECL
)
6141 if (TREE_CODE (t
) == IDENTIFIER_NODE
)
6142 type
= IDENTIFIER_TYPE_VALUE (t
);
6144 type
= TREE_TYPE (t
);
6145 if (type
== unknown_type_node
)
6146 my_friendly_abort (42);
6148 if (type
&& TREE_CODE (t
) != FUNCTION_DECL
6149 && TREE_CODE (t
) != TYPENAME_TYPE
6150 && TREE_CODE (t
) != TEMPLATE_DECL
6151 && TREE_CODE (t
) != IDENTIFIER_NODE
6152 && TREE_CODE (t
) != FUNCTION_TYPE
6153 && TREE_CODE (t
) != METHOD_TYPE
)
6154 type
= tsubst (type
, args
, complain
, in_decl
);
6155 if (type
== error_mark_node
)
6156 return error_mark_node
;
6158 if (TREE_CODE_CLASS (TREE_CODE (t
)) == 'd')
6159 return tsubst_decl (t
, args
, type
, in_decl
);
6161 switch (TREE_CODE (t
))
6166 return tsubst_aggr_type (t
, args
, complain
, in_decl
,
6167 /*entering_scope=*/0);
6170 case IDENTIFIER_NODE
:
6182 if (t
== integer_type_node
)
6185 if (TREE_CODE (TYPE_MIN_VALUE (t
)) == INTEGER_CST
6186 && TREE_CODE (TYPE_MAX_VALUE (t
)) == INTEGER_CST
)
6190 tree max
, omax
= TREE_OPERAND (TYPE_MAX_VALUE (t
), 0);
6192 max
= tsubst_expr (omax
, args
, complain
, in_decl
);
6193 if (max
== error_mark_node
)
6194 return error_mark_node
;
6196 /* See if we can reduce this expression to something simpler. */
6197 max
= maybe_fold_nontype_arg (max
);
6198 if (!processing_template_decl
&& TREE_READONLY_DECL_P (max
))
6199 max
= decl_constant_value (max
);
6201 if (processing_template_decl
6202 /* When providing explicit arguments to a template
6203 function, but leaving some arguments for subsequent
6204 deduction, MAX may be template-dependent even if we're
6205 not PROCESSING_TEMPLATE_DECL. We still need to check for
6206 template parms, though; MAX won't be an INTEGER_CST for
6207 dynamic arrays, either. */
6208 || (TREE_CODE (max
) != INTEGER_CST
6209 && uses_template_parms (max
)))
6211 tree itype
= make_node (INTEGER_TYPE
);
6212 TYPE_MIN_VALUE (itype
) = size_zero_node
;
6213 TYPE_MAX_VALUE (itype
) = build_min (MINUS_EXPR
, sizetype
, max
,
6218 if (integer_zerop (omax
))
6220 /* Still allow an explicit array of size zero. */
6222 pedwarn ("creating array with size zero");
6224 else if (integer_zerop (max
)
6225 || (TREE_CODE (max
) == INTEGER_CST
6226 && INT_CST_LT (max
, integer_zero_node
)))
6230 Type deduction may fail for any of the following
6233 Attempting to create an array with a size that is
6234 zero or negative. */
6236 cp_error ("creating array with size zero (`%E')", max
);
6238 return error_mark_node
;
6241 return compute_array_index_type (NULL_TREE
, max
);
6244 case TEMPLATE_TYPE_PARM
:
6245 case TEMPLATE_TEMPLATE_PARM
:
6246 case TEMPLATE_PARM_INDEX
:
6254 if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
6255 || TREE_CODE (t
) == TEMPLATE_TEMPLATE_PARM
)
6257 idx
= TEMPLATE_TYPE_IDX (t
);
6258 level
= TEMPLATE_TYPE_LEVEL (t
);
6262 idx
= TEMPLATE_PARM_IDX (t
);
6263 level
= TEMPLATE_PARM_LEVEL (t
);
6266 if (TREE_VEC_LENGTH (args
) > 0)
6268 tree arg
= NULL_TREE
;
6270 levels
= TMPL_ARGS_DEPTH (args
);
6271 if (level
<= levels
)
6272 arg
= TMPL_ARG (args
, level
, idx
);
6274 if (arg
== error_mark_node
)
6275 return error_mark_node
;
6276 else if (arg
!= NULL_TREE
)
6278 if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
6280 my_friendly_assert (TREE_CODE_CLASS (TREE_CODE (arg
))
6282 return cp_build_qualified_type_real
6283 (arg
, CP_TYPE_QUALS (arg
) | CP_TYPE_QUALS (t
),
6286 else if (TREE_CODE (t
) == TEMPLATE_TEMPLATE_PARM
)
6288 if (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t
))
6290 /* We are processing a type constructed from
6291 a template template parameter */
6292 tree argvec
= tsubst (TYPE_TI_ARGS (t
),
6293 args
, complain
, in_decl
);
6294 if (argvec
== error_mark_node
)
6295 return error_mark_node
;
6297 /* We can get a TEMPLATE_TEMPLATE_PARM here when
6298 we are resolving nested-types in the signature of
6299 a member function templates.
6300 Otherwise ARG is a TEMPLATE_DECL and is the real
6301 template to be instantiated. */
6302 if (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
6303 arg
= TYPE_NAME (arg
);
6305 r
= lookup_template_class (DECL_NAME (arg
),
6308 /*entering_scope=*/0);
6309 return cp_build_qualified_type_real (r
,
6314 /* We are processing a template argument list. */
6322 my_friendly_abort (981018);
6325 /* This can happen during the attempted tsubst'ing in
6326 unify. This means that we don't yet have any information
6327 about the template parameter in question. */
6330 /* If we get here, we must have been looking at a parm for a
6331 more deeply nested template. Make a new version of this
6332 template parameter, but with a lower level. */
6333 switch (TREE_CODE (t
))
6335 case TEMPLATE_TYPE_PARM
:
6336 case TEMPLATE_TEMPLATE_PARM
:
6338 TEMPLATE_TYPE_PARM_INDEX (r
)
6339 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (t
),
6341 TYPE_STUB_DECL (r
) = TYPE_NAME (r
) = TEMPLATE_TYPE_DECL (r
);
6342 TYPE_MAIN_VARIANT (r
) = r
;
6343 TYPE_POINTER_TO (r
) = NULL_TREE
;
6344 TYPE_REFERENCE_TO (r
) = NULL_TREE
;
6346 if (TREE_CODE (t
) == TEMPLATE_TEMPLATE_PARM
6347 && TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t
))
6349 tree argvec
= tsubst (TYPE_TI_ARGS (t
), args
,
6351 if (argvec
== error_mark_node
)
6352 return error_mark_node
;
6354 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (r
)
6355 = tree_cons (TYPE_NAME (t
), argvec
, NULL_TREE
);
6359 case TEMPLATE_PARM_INDEX
:
6360 r
= reduce_template_parm_level (t
, type
, levels
);
6364 my_friendly_abort (0);
6372 tree purpose
, value
, chain
, result
;
6374 if (t
== void_list_node
)
6377 purpose
= TREE_PURPOSE (t
);
6380 purpose
= tsubst (purpose
, args
, complain
, in_decl
);
6381 if (purpose
== error_mark_node
)
6382 return error_mark_node
;
6384 value
= TREE_VALUE (t
);
6387 value
= tsubst (value
, args
, complain
, in_decl
);
6388 if (value
== error_mark_node
)
6389 return error_mark_node
;
6391 chain
= TREE_CHAIN (t
);
6392 if (chain
&& chain
!= void_type_node
)
6394 chain
= tsubst (chain
, args
, complain
, in_decl
);
6395 if (chain
== error_mark_node
)
6396 return error_mark_node
;
6398 if (purpose
== TREE_PURPOSE (t
)
6399 && value
== TREE_VALUE (t
)
6400 && chain
== TREE_CHAIN (t
))
6402 result
= hash_tree_cons (purpose
, value
, chain
);
6403 TREE_PARMLIST (result
) = TREE_PARMLIST (t
);
6407 if (type
!= NULL_TREE
)
6409 /* A binfo node. We always need to make a copy, of the node
6410 itself and of its BINFO_BASETYPES. */
6414 /* Make sure type isn't a typedef copy. */
6415 type
= BINFO_TYPE (TYPE_BINFO (type
));
6417 TREE_TYPE (t
) = complete_type (type
);
6418 if (IS_AGGR_TYPE (type
))
6420 BINFO_VTABLE (t
) = TYPE_BINFO_VTABLE (type
);
6421 BINFO_VIRTUALS (t
) = TYPE_BINFO_VIRTUALS (type
);
6422 if (TYPE_BINFO_BASETYPES (type
) != NULL_TREE
)
6423 BINFO_BASETYPES (t
) = copy_node (TYPE_BINFO_BASETYPES (type
));
6428 /* Otherwise, a vector of template arguments. */
6429 return tsubst_template_arg_vector (t
, args
, complain
);
6432 case REFERENCE_TYPE
:
6434 enum tree_code code
;
6436 if (type
== TREE_TYPE (t
))
6439 code
= TREE_CODE (t
);
6444 Type deduction may fail for any of the following
6447 -- Attempting to create a pointer to reference type.
6448 -- Attempting to create a reference to a reference type or
6449 a reference to void. */
6450 if (TREE_CODE (type
) == REFERENCE_TYPE
6451 || (code
== REFERENCE_TYPE
&& TREE_CODE (type
) == VOID_TYPE
))
6453 static int last_line
= 0;
6454 static char* last_file
= 0;
6456 /* We keep track of the last time we issued this error
6457 message to avoid spewing a ton of messages during a
6458 single bad template instantiation. */
6459 if (complain
&& (last_line
!= lineno
||
6460 last_file
!= input_filename
))
6462 if (TREE_CODE (type
) == VOID_TYPE
)
6463 cp_error ("forming reference to void");
6465 cp_error ("forming %s to reference type `%T'",
6466 (code
== POINTER_TYPE
) ? "pointer" : "reference",
6469 last_file
= input_filename
;
6472 return error_mark_node
;
6474 else if (code
== POINTER_TYPE
)
6475 r
= build_pointer_type (type
);
6477 r
= build_reference_type (type
);
6478 r
= cp_build_qualified_type_real (r
, TYPE_QUALS (t
), complain
);
6480 /* Will this ever be needed for TYPE_..._TO values? */
6486 r
= tsubst (TYPE_OFFSET_BASETYPE (t
), args
, complain
, in_decl
);
6487 if (r
== error_mark_node
|| !IS_AGGR_TYPE (r
))
6491 Type deduction may fail for any of the following
6494 -- Attempting to create "pointer to member of T" when T
6495 is not a class type. */
6497 cp_error ("creating pointer to member of non-class type `%T'",
6499 return error_mark_node
;
6501 return build_offset_type (r
, type
);
6509 fntype
= tsubst_function_type (t
, args
, complain
, in_decl
);
6510 if (fntype
== error_mark_node
)
6511 return error_mark_node
;
6513 /* Substitue the exception specification. */
6514 raises
= TYPE_RAISES_EXCEPTIONS (t
);
6517 tree list
= NULL_TREE
;
6519 if (! TREE_VALUE (raises
))
6522 for (; raises
!= NULL_TREE
; raises
= TREE_CHAIN (raises
))
6524 tree spec
= TREE_VALUE (raises
);
6526 spec
= tsubst (spec
, args
, complain
, in_decl
);
6527 if (spec
== error_mark_node
)
6529 list
= add_exception_specifier (list
, spec
, complain
);
6531 fntype
= build_exception_variant (fntype
, list
);
6537 tree domain
= tsubst (TYPE_DOMAIN (t
), args
, complain
, in_decl
);
6538 if (domain
== error_mark_node
)
6539 return error_mark_node
;
6541 /* As an optimization, we avoid regenerating the array type if
6542 it will obviously be the same as T. */
6543 if (type
== TREE_TYPE (t
) && domain
== TYPE_DOMAIN (t
))
6546 /* These checks should match the ones in grokdeclarator.
6550 The deduction may fail for any of the following reasons:
6552 -- Attempting to create an array with an element type that
6553 is void, a function type, or a reference type. */
6554 if (TREE_CODE (type
) == VOID_TYPE
6555 || TREE_CODE (type
) == FUNCTION_TYPE
6556 || TREE_CODE (type
) == REFERENCE_TYPE
)
6559 cp_error ("creating array of `%T'", type
);
6560 return error_mark_node
;
6563 r
= build_cplus_array_type (type
, domain
);
6570 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6572 tree e2
= tsubst (TREE_OPERAND (t
, 1), args
, complain
,
6575 if (e1
== error_mark_node
|| e2
== error_mark_node
)
6576 return error_mark_node
;
6578 return fold (build (TREE_CODE (t
), TREE_TYPE (t
), e1
, e2
));
6584 tree e
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6586 if (e
== error_mark_node
)
6587 return error_mark_node
;
6589 return fold (build (TREE_CODE (t
), TREE_TYPE (t
), e
));
6594 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
6595 in_decl
, /*entering_scope=*/1);
6596 tree f
= tsubst_copy (TYPENAME_TYPE_FULLNAME (t
), args
,
6599 if (ctx
== error_mark_node
|| f
== error_mark_node
)
6600 return error_mark_node
;
6602 if (!IS_AGGR_TYPE (ctx
))
6605 cp_error ("`%T' is not a class, struct, or union type",
6607 return error_mark_node
;
6609 else if (!uses_template_parms (ctx
) && !TYPE_BEING_DEFINED (ctx
))
6611 /* Normally, make_typename_type does not require that the CTX
6612 have complete type in order to allow things like:
6614 template <class T> struct S { typename S<T>::X Y; };
6616 But, such constructs have already been resolved by this
6617 point, so here CTX really should have complete type, unless
6618 it's a partial instantiation. */
6619 ctx
= complete_type (ctx
);
6620 if (!TYPE_SIZE (ctx
))
6623 incomplete_type_error (NULL_TREE
, ctx
);
6624 return error_mark_node
;
6628 f
= make_typename_type (ctx
, f
, complain
);
6629 if (f
== error_mark_node
)
6631 return cp_build_qualified_type_real (f
,
6633 | CP_TYPE_QUALS (t
),
6639 tree e
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6641 if (e
== error_mark_node
)
6642 return error_mark_node
;
6643 return make_pointer_declarator (type
, e
);
6648 tree e
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6650 if (e
== error_mark_node
)
6651 return error_mark_node
;
6652 return make_reference_declarator (type
, e
);
6657 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6659 tree e2
= tsubst_expr (TREE_OPERAND (t
, 1), args
, complain
,
6661 if (e1
== error_mark_node
|| e2
== error_mark_node
)
6662 return error_mark_node
;
6664 return build_parse_node (ARRAY_REF
, e1
, e2
, tsubst_expr
);
6669 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6671 tree e2
= (tsubst_call_declarator_parms
6672 (CALL_DECLARATOR_PARMS (t
), args
, complain
, in_decl
));
6673 tree e3
= tsubst (CALL_DECLARATOR_EXCEPTION_SPEC (t
), args
,
6676 if (e1
== error_mark_node
|| e2
== error_mark_node
6677 || e3
== error_mark_node
)
6678 return error_mark_node
;
6680 return make_call_declarator (e1
, e2
, CALL_DECLARATOR_QUALS (t
), e3
);
6685 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6687 tree e2
= tsubst (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
6688 if (e1
== error_mark_node
|| e2
== error_mark_node
)
6689 return error_mark_node
;
6691 return build_parse_node (TREE_CODE (t
), e1
, e2
);
6696 tree e1
= tsubst_expr (TYPE_FIELDS (t
), args
, complain
,
6698 if (e1
== error_mark_node
)
6699 return error_mark_node
;
6701 return TREE_TYPE (e1
);
6711 /* This code should match declare_hidden_char_array in
6713 name
= (*decl_printable_name
) (current_function_decl
, 2);
6714 len
= strlen (name
) + 1;
6715 type
= build_array_type (char_type_node
,
6716 build_index_type (build_int_2 (len
, 0)));
6717 str
= build_string (len
, name
);
6718 TREE_TYPE (str
) = type
;
6723 sorry ("use of `%s' in template",
6724 tree_code_name
[(int) TREE_CODE (t
)]);
6725 return error_mark_node
;
6729 /* Like tsubst, but deals with expressions. This function just replaces
6730 template parms; to finish processing the resultant expression, use
6734 tsubst_copy (t
, args
, complain
, in_decl
)
6739 enum tree_code code
;
6742 if (t
== NULL_TREE
|| t
== error_mark_node
)
6745 code
= TREE_CODE (t
);
6750 return do_identifier (DECL_NAME (t
), 0, NULL_TREE
);
6757 if (!DECL_CONTEXT (t
))
6758 /* This is a global enumeration constant. */
6761 /* Unfortunately, we cannot just call lookup_name here.
6764 template <int I> int f() {
6766 struct S { void g() { E e = a; } };
6769 When we instantiate f<7>::S::g(), say, lookup_name is not
6770 clever enough to find f<7>::a. */
6772 = tsubst_aggr_type (TREE_TYPE (t
), args
, complain
, in_decl
,
6773 /*entering_scope=*/0);
6775 for (v
= TYPE_VALUES (enum_type
);
6778 if (TREE_PURPOSE (v
) == DECL_NAME (t
))
6779 return TREE_VALUE (v
);
6781 /* We didn't find the name. That should never happen; if
6782 name-lookup found it during preliminary parsing, we
6783 should find it again here during instantiation. */
6784 my_friendly_abort (0);
6789 if (DECL_CONTEXT (t
))
6793 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
6794 /*entering_scope=*/1);
6795 if (ctx
!= DECL_CONTEXT (t
))
6796 return lookup_field (ctx
, DECL_NAME (t
), 0, 0);
6802 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
))
6803 t
= tsubst (t
, args
, complain
, in_decl
);
6808 if (is_member_template (t
))
6809 return tsubst (t
, args
, complain
, in_decl
);
6815 /* We must tsbust into a LOOKUP_EXPR in case the names to
6816 which it refers is a conversion operator; in that case the
6817 name will change. We avoid making unnecessary copies,
6820 tree id
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
6822 if (id
!= TREE_OPERAND (t
, 0))
6824 r
= build_nt (LOOKUP_EXPR
, id
);
6825 LOOKUP_EXPR_GLOBAL (r
) = LOOKUP_EXPR_GLOBAL (t
);
6833 case REINTERPRET_CAST_EXPR
:
6834 case CONST_CAST_EXPR
:
6835 case STATIC_CAST_EXPR
:
6836 case DYNAMIC_CAST_EXPR
:
6839 (code
, tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
6840 tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
));
6843 case PREDECREMENT_EXPR
:
6844 case PREINCREMENT_EXPR
:
6845 case POSTDECREMENT_EXPR
:
6846 case POSTINCREMENT_EXPR
:
6848 case TRUTH_NOT_EXPR
:
6851 case CONVERT_EXPR
: /* Unary + */
6860 (code
, tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
6861 tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
));
6866 case TRUNC_DIV_EXPR
:
6868 case FLOOR_DIV_EXPR
:
6869 case ROUND_DIV_EXPR
:
6870 case EXACT_DIV_EXPR
:
6872 case BIT_ANDTC_EXPR
:
6875 case TRUNC_MOD_EXPR
:
6876 case FLOOR_MOD_EXPR
:
6877 case TRUTH_ANDIF_EXPR
:
6878 case TRUTH_ORIF_EXPR
:
6879 case TRUTH_AND_EXPR
:
6900 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
6901 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
));
6905 tree fn
= TREE_OPERAND (t
, 0);
6906 if (is_overloaded_fn (fn
))
6907 fn
= tsubst_copy (get_first_fn (fn
), args
, complain
, in_decl
);
6909 /* Sometimes FN is a LOOKUP_EXPR. */
6910 fn
= tsubst_copy (fn
, args
, complain
, in_decl
);
6912 (code
, fn
, tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
,
6917 case METHOD_CALL_EXPR
:
6919 tree name
= TREE_OPERAND (t
, 0);
6920 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
6922 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
6924 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
6926 else if (TREE_CODE (name
) == SCOPE_REF
6927 && TREE_CODE (TREE_OPERAND (name
, 1)) == BIT_NOT_EXPR
)
6929 tree base
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
6931 name
= TREE_OPERAND (name
, 1);
6932 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
6934 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
6935 name
= build_nt (SCOPE_REF
, base
, name
);
6938 name
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
6940 (code
, name
, tsubst_copy (TREE_OPERAND (t
, 1), args
,
6942 tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
),
6947 /* This processing should really occur in tsubst_expr, However,
6948 tsubst_expr does not recurse into expressions, since it
6949 assumes that there aren't any statements inside them.
6950 Instead, it simply calls build_expr_from_tree. So, we need
6951 to expand the STMT_EXPR here. */
6952 if (!processing_template_decl
)
6954 tree stmt_expr
= begin_stmt_expr ();
6955 tsubst_expr (STMT_EXPR_STMT (t
), args
,
6957 return finish_stmt_expr (stmt_expr
);
6964 case PSEUDO_DTOR_EXPR
:
6967 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
6968 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
),
6969 tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
));
6976 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
6977 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
),
6978 tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
));
6979 NEW_EXPR_USE_GLOBAL (r
) = NEW_EXPR_USE_GLOBAL (t
);
6986 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
6987 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
));
6988 DELETE_EXPR_USE_GLOBAL (r
) = DELETE_EXPR_USE_GLOBAL (t
);
6989 DELETE_EXPR_USE_VEC (r
) = DELETE_EXPR_USE_VEC (t
);
6993 case TEMPLATE_ID_EXPR
:
6995 /* Substituted template arguments */
6996 tree targs
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
,
6999 if (targs
&& TREE_CODE (targs
) == TREE_LIST
)
7002 for (chain
= targs
; chain
; chain
= TREE_CHAIN (chain
))
7003 TREE_VALUE (chain
) = maybe_fold_nontype_arg (TREE_VALUE (chain
));
7008 for (i
= 0; i
< TREE_VEC_LENGTH (targs
); ++i
)
7009 TREE_VEC_ELT (targs
, i
)
7010 = maybe_fold_nontype_arg (TREE_VEC_ELT (targs
, i
));
7013 return lookup_template_function
7014 (tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
), targs
);
7019 tree purpose
, value
, chain
;
7021 if (t
== void_list_node
)
7024 purpose
= TREE_PURPOSE (t
);
7026 purpose
= tsubst_copy (purpose
, args
, complain
, in_decl
);
7027 value
= TREE_VALUE (t
);
7029 value
= tsubst_copy (value
, args
, complain
, in_decl
);
7030 chain
= TREE_CHAIN (t
);
7031 if (chain
&& chain
!= void_type_node
)
7032 chain
= tsubst_copy (chain
, args
, complain
, in_decl
);
7033 if (purpose
== TREE_PURPOSE (t
)
7034 && value
== TREE_VALUE (t
)
7035 && chain
== TREE_CHAIN (t
))
7037 return tree_cons (purpose
, value
, chain
);
7044 case TEMPLATE_TYPE_PARM
:
7045 case TEMPLATE_TEMPLATE_PARM
:
7046 case TEMPLATE_PARM_INDEX
:
7048 case REFERENCE_TYPE
:
7055 return tsubst (t
, args
, complain
, in_decl
);
7057 case IDENTIFIER_NODE
:
7058 if (IDENTIFIER_TYPENAME_P (t
)
7059 /* Make sure it's not just a variable named `__opr', for instance,
7060 which can occur in some existing code. */
7062 return build_typename_overload
7063 (tsubst (TREE_TYPE (t
), args
, complain
, in_decl
));
7070 (CONSTRUCTOR
, tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
7071 NULL_TREE
, tsubst_copy (CONSTRUCTOR_ELTS (t
), args
,
7072 complain
, in_decl
));
7073 TREE_HAS_CONSTRUCTOR (r
) = TREE_HAS_CONSTRUCTOR (t
);
7078 return build_va_arg (tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
,
7080 tsubst (TREE_TYPE (t
), args
, complain
, in_decl
));
7083 return tsubst (t
, args
, complain
, in_decl
);
7090 /* Like tsubst_copy, but also does semantic processing. */
7093 tsubst_expr (t
, args
, complain
, in_decl
)
7100 if (t
== NULL_TREE
|| t
== error_mark_node
)
7103 if (processing_template_decl
)
7104 return tsubst_copy (t
, args
, complain
, in_decl
);
7106 switch (TREE_CODE (t
))
7110 finish_named_return_value
7111 (TREE_OPERAND (t
, 0),
7112 tsubst_expr (TREE_OPERAND (t
, 1), args
, /*complain=*/1, in_decl
));
7113 tsubst_expr (TREE_CHAIN (t
), args
, complain
, in_decl
);
7116 case CTOR_INITIALIZER
:
7118 current_member_init_list
7119 = tsubst_expr_values (TREE_OPERAND (t
, 0), args
);
7120 current_base_init_list
7121 = tsubst_expr_values (TREE_OPERAND (t
, 1), args
);
7123 tsubst_expr (TREE_CHAIN (t
), args
, complain
, in_decl
);
7128 finish_return_stmt (tsubst_expr (RETURN_EXPR (t
),
7129 args
, complain
, in_decl
));
7134 finish_expr_stmt (tsubst_expr (EXPR_STMT_EXPR (t
),
7135 args
, complain
, in_decl
));
7144 decl
= DECL_STMT_DECL (t
);
7145 if (TREE_CODE (decl
) == LABEL_DECL
)
7146 finish_label_decl (DECL_NAME (decl
));
7149 init
= DECL_INITIAL (decl
);
7150 decl
= tsubst (decl
, args
, complain
, in_decl
);
7151 init
= tsubst_expr (init
, args
, complain
, in_decl
);
7153 DECL_INITIAL (decl
) = error_mark_node
;
7154 /* By marking the declaration as instantiated, we avoid
7155 trying to instantiate it. Since instantiate_decl can't
7156 handle local variables, and since we've already done
7157 all that needs to be done, that's the right thing to
7159 if (TREE_CODE (decl
) == VAR_DECL
)
7160 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
7161 maybe_push_decl (decl
);
7162 cp_finish_decl (decl
, init
, NULL_TREE
, 0);
7172 stmt
= begin_for_stmt ();
7173 for (tmp
= FOR_INIT_STMT (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
7174 tsubst_expr (tmp
, args
, complain
, in_decl
);
7175 finish_for_init_stmt (stmt
);
7176 finish_for_cond (tsubst_expr (FOR_COND (t
), args
,
7179 tmp
= tsubst_expr (FOR_EXPR (t
), args
, complain
, in_decl
);
7180 finish_for_expr (tmp
, stmt
);
7181 tsubst_expr (FOR_BODY (t
), args
, complain
, in_decl
);
7182 finish_for_stmt (tmp
, stmt
);
7189 stmt
= begin_while_stmt ();
7190 finish_while_stmt_cond (tsubst_expr (WHILE_COND (t
),
7191 args
, complain
, in_decl
),
7193 tsubst_expr (WHILE_BODY (t
), args
, complain
, in_decl
);
7194 finish_while_stmt (stmt
);
7201 stmt
= begin_do_stmt ();
7202 tsubst_expr (DO_BODY (t
), args
, complain
, in_decl
);
7203 finish_do_body (stmt
);
7204 finish_do_stmt (tsubst_expr (DO_COND (t
), args
,
7215 stmt
= begin_if_stmt ();
7216 finish_if_stmt_cond (tsubst_expr (IF_COND (t
),
7217 args
, complain
, in_decl
),
7220 if (tmp
= THEN_CLAUSE (t
), tmp
)
7222 tsubst_expr (tmp
, args
, complain
, in_decl
);
7223 finish_then_clause (stmt
);
7226 if (tmp
= ELSE_CLAUSE (t
), tmp
)
7228 begin_else_clause ();
7229 tsubst_expr (tmp
, args
, complain
, in_decl
);
7230 finish_else_clause (stmt
);
7242 stmt
= begin_compound_stmt (COMPOUND_STMT_NO_SCOPE (t
));
7243 for (substmt
= COMPOUND_BODY (t
);
7244 substmt
!= NULL_TREE
;
7245 substmt
= TREE_CHAIN (substmt
))
7246 tsubst_expr (substmt
, args
, complain
, in_decl
);
7247 return finish_compound_stmt (COMPOUND_STMT_NO_SCOPE (t
), stmt
);
7253 finish_break_stmt ();
7258 finish_continue_stmt ();
7266 stmt
= begin_switch_stmt ();
7267 val
= tsubst_expr (SWITCH_COND (t
), args
, complain
, in_decl
);
7268 finish_switch_cond (val
, stmt
);
7269 tsubst_expr (SWITCH_BODY (t
), args
, complain
, in_decl
);
7270 finish_switch_stmt (val
, stmt
);
7276 finish_case_label (tsubst_expr (CASE_LOW (t
), args
, complain
, in_decl
),
7277 tsubst_expr (CASE_HIGH (t
), args
, complain
, in_decl
));
7281 lineno
= STMT_LINENO (t
);
7282 finish_label_stmt (DECL_NAME (LABEL_STMT_LABEL (t
)));
7287 t
= GOTO_DESTINATION (t
);
7288 if (TREE_CODE (t
) != LABEL_DECL
)
7289 /* Computed goto's must be tsubst'd into. On the other hand,
7290 non-computed gotos must not be; the identifier in question
7291 will have no binding. */
7292 t
= tsubst_expr (t
, args
, complain
, in_decl
);
7295 finish_goto_stmt (t
);
7300 finish_asm_stmt (ASM_CV_QUAL (t
),
7301 tsubst_expr (ASM_STRING (t
), args
, complain
, in_decl
),
7302 tsubst_expr (ASM_OUTPUTS (t
), args
, complain
, in_decl
),
7303 tsubst_expr (ASM_INPUTS (t
), args
, complain
, in_decl
),
7304 tsubst_expr (ASM_CLOBBERS (t
), args
, complain
,
7312 stmt
= begin_try_block ();
7313 tsubst_expr (TRY_STMTS (t
), args
, complain
, in_decl
);
7314 finish_cleanup_try_block (stmt
);
7315 finish_cleanup (tsubst_expr (TRY_HANDLERS (t
), args
,
7323 if (FN_TRY_BLOCK_P (t
))
7324 stmt
= begin_function_try_block ();
7326 stmt
= begin_try_block ();
7328 tsubst_expr (TRY_STMTS (t
), args
, complain
, in_decl
);
7330 if (FN_TRY_BLOCK_P (t
))
7331 finish_function_try_block (stmt
);
7333 finish_try_block (stmt
);
7335 handler
= TRY_HANDLERS (t
);
7336 for (; handler
; handler
= TREE_CHAIN (handler
))
7337 tsubst_expr (handler
, args
, complain
, in_decl
);
7338 if (FN_TRY_BLOCK_P (t
))
7339 finish_function_handler_sequence (stmt
);
7341 finish_handler_sequence (stmt
);
7351 stmt
= begin_handler ();
7352 if (HANDLER_PARMS (t
))
7354 decl
= DECL_STMT_DECL (HANDLER_PARMS (t
));
7355 decl
= tsubst (decl
, args
, complain
, in_decl
);
7356 /* Prevent instantiate_decl from trying to instantiate
7357 this variable. We've already done all that needs to be
7359 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
7363 blocks
= finish_handler_parms (decl
, stmt
);
7364 tsubst_expr (HANDLER_BODY (t
), args
, complain
, in_decl
);
7365 finish_handler (blocks
, stmt
);
7372 tsubst (t
, args
, complain
, NULL_TREE
);
7376 return build_expr_from_tree (tsubst_copy (t
, args
, complain
, in_decl
));
7381 /* Instantiate the indicated variable or function template TMPL with
7382 the template arguments in TARG_PTR. */
7385 instantiate_template (tmpl
, targ_ptr
)
7386 tree tmpl
, targ_ptr
;
7394 if (tmpl
== error_mark_node
)
7395 return error_mark_node
;
7397 my_friendly_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
, 283);
7399 /* Check to see if we already have this specialization. */
7400 spec
= retrieve_specialization (tmpl
, targ_ptr
);
7401 if (spec
!= NULL_TREE
)
7404 if (DECL_TEMPLATE_INFO (tmpl
))
7406 /* The TMPL is a partial instantiation. To get a full set of
7407 arguments we must add the arguments used to perform the
7408 partial instantiation. */
7409 targ_ptr
= add_outermost_template_args (DECL_TI_ARGS (tmpl
),
7411 gen_tmpl
= most_general_template (tmpl
);
7413 /* Check to see if we already have this specialization. */
7414 spec
= retrieve_specialization (gen_tmpl
, targ_ptr
);
7415 if (spec
!= NULL_TREE
)
7421 len
= DECL_NTPARMS (gen_tmpl
);
7422 inner_args
= innermost_args (targ_ptr
);
7426 tree t
= TREE_VEC_ELT (inner_args
, i
);
7427 if (TREE_CODE_CLASS (TREE_CODE (t
)) == 't')
7429 tree nt
= target_type (t
);
7430 if (IS_AGGR_TYPE (nt
) && decl_function_context (TYPE_MAIN_DECL (nt
)))
7432 cp_error ("type `%T' composed from a local class is not a valid template-argument", t
);
7433 cp_error (" trying to instantiate `%D'", gen_tmpl
);
7434 fndecl
= error_mark_node
;
7440 /* substitute template parameters */
7441 fndecl
= tsubst (DECL_RESULT (gen_tmpl
), targ_ptr
, /*complain=*/1, gen_tmpl
);
7442 /* The DECL_TI_TEMPLATE should always be the immediate parent
7443 template, not the most general template. */
7444 DECL_TI_TEMPLATE (fndecl
) = tmpl
;
7446 if (flag_external_templates
)
7447 add_pending_template (fndecl
);
7453 /* Push the name of the class template into the scope of the instantiation. */
7456 overload_template_name (type
)
7459 tree id
= DECL_NAME (CLASSTYPE_TI_TEMPLATE (type
));
7462 if (IDENTIFIER_CLASS_VALUE (id
)
7463 && TREE_TYPE (IDENTIFIER_CLASS_VALUE (id
)) == type
)
7466 decl
= build_decl (TYPE_DECL
, id
, type
);
7467 SET_DECL_ARTIFICIAL (decl
);
7468 pushdecl_class_level (decl
);
7471 /* The FN is a TEMPLATE_DECL for a function. The ARGS are the
7472 arguments that are being used when calling it. TARGS is a vector
7473 into which the deduced template arguments are placed.
7475 Return zero for success, 2 for an incomplete match that doesn't resolve
7476 all the types, and 1 for complete failure. An error message will be
7477 printed only for an incomplete match.
7479 If FN is a conversion operator, RETURN_TYPE is the type desired as
7480 the result of the conversion operator.
7482 TPARMS is a vector of template parameters.
7484 The EXPLICIT_TARGS are explicit template arguments provided via a
7487 The parameter STRICT is one of:
7490 We are deducing arguments for a function call, as in
7494 We are deducing arguments for a conversion function, as in
7498 We are deducing arguments when calculating the partial
7499 ordering between specializations of function or class
7500 templates, as in [temp.func.order] and [temp.class.order],
7501 when doing an explicit instantiation as in [temp.explicit],
7502 when determining an explicit specialization as in
7503 [temp.expl.spec], or when taking the address of a function
7504 template, as in [temp.deduct.funcaddr].
7506 The other arguments are as for type_unification. */
7509 fn_type_unification (fn
, explicit_targs
, targs
, args
, return_type
,
7511 tree fn
, explicit_targs
, targs
, args
, return_type
;
7512 unification_kind_t strict
;
7518 my_friendly_assert (TREE_CODE (fn
) == TEMPLATE_DECL
, 0);
7520 fntype
= TREE_TYPE (fn
);
7525 The specified template arguments must match the template
7526 parameters in kind (i.e., type, nontype, template), and there
7527 must not be more arguments than there are parameters;
7528 otherwise type deduction fails.
7530 Nontype arguments must match the types of the corresponding
7531 nontype template parameters, or must be convertible to the
7532 types of the corresponding nontype parameters as specified in
7533 _temp.arg.nontype_, otherwise type deduction fails.
7535 All references in the function type of the function template
7536 to the corresponding template parameters are replaced by the
7537 specified template argument values. If a substitution in a
7538 template parameter or in the function type of the function
7539 template results in an invalid type, type deduction fails. */
7541 tree converted_args
;
7544 = (coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
7545 explicit_targs
, NULL_TREE
, /*complain=*/0,
7546 /*require_all_arguments=*/0));
7547 if (converted_args
== error_mark_node
)
7550 fntype
= tsubst (fntype
, converted_args
, /*complain=*/0, NULL_TREE
);
7551 if (fntype
== error_mark_node
)
7554 /* Place the explicitly specified arguments in TARGS. */
7555 for (i
= 0; i
< TREE_VEC_LENGTH (targs
); i
++)
7556 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (converted_args
, i
);
7559 parms
= TYPE_ARG_TYPES (fntype
);
7561 if (DECL_CONV_FN_P (fn
))
7563 /* This is a template conversion operator. Use the return types
7564 as well as the argument types. We use it instead of 'this', since
7565 we could be comparing conversions from different classes. */
7566 parms
= tree_cons (NULL_TREE
, TREE_TYPE (fntype
),
7567 TREE_CHAIN (parms
));
7568 args
= tree_cons (NULL_TREE
, return_type
, TREE_CHAIN (args
));
7571 /* We allow incomplete unification without an error message here
7572 because the standard doesn't seem to explicitly prohibit it. Our
7573 callers must be ready to deal with unification failures in any
7575 result
= type_unification_real (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
7576 targs
, parms
, args
, /*subr=*/0,
7577 strict
, /*allow_incomplete*/1);
7580 /* All is well so far. Now, check:
7584 When all template arguments have been deduced, all uses of
7585 template parameters in nondeduced contexts are replaced with
7586 the corresponding deduced argument values. If the
7587 substitution results in an invalid type, as described above,
7588 type deduction fails. */
7589 if (tsubst (TREE_TYPE (fn
), targs
, /*complain=*/0, NULL_TREE
)
7596 /* Adjust types before performing type deduction, as described in
7597 [temp.deduct.call] and [temp.deduct.conv]. The rules in these two
7598 sections are symmetric. PARM is the type of a function parameter
7599 or the return type of the conversion function. ARG is the type of
7600 the argument passed to the call, or the type of the value
7601 intialized with the result of the conversion function. */
7604 maybe_adjust_types_for_deduction (strict
, parm
, arg
)
7605 unification_kind_t strict
;
7616 /* Swap PARM and ARG throughout the remainder of this
7617 function; the handling is precisely symmetric since PARM
7618 will initialize ARG rather than vice versa. */
7626 /* There is nothing to do in this case. */
7630 my_friendly_abort (0);
7633 if (TREE_CODE (*parm
) != REFERENCE_TYPE
)
7635 /* [temp.deduct.call]
7637 If P is not a reference type:
7639 --If A is an array type, the pointer type produced by the
7640 array-to-pointer standard conversion (_conv.array_) is
7641 used in place of A for type deduction; otherwise,
7643 --If A is a function type, the pointer type produced by
7644 the function-to-pointer standard conversion
7645 (_conv.func_) is used in place of A for type deduction;
7648 --If A is a cv-qualified type, the top level
7649 cv-qualifiers of A's type are ignored for type
7651 if (TREE_CODE (*arg
) == ARRAY_TYPE
)
7652 *arg
= build_pointer_type (TREE_TYPE (*arg
));
7653 else if (TREE_CODE (*arg
) == FUNCTION_TYPE
)
7654 *arg
= build_pointer_type (*arg
);
7656 *arg
= TYPE_MAIN_VARIANT (*arg
);
7659 /* [temp.deduct.call]
7661 If P is a cv-qualified type, the top level cv-qualifiers
7662 of P's type are ignored for type deduction. If P is a
7663 reference type, the type referred to by P is used for
7665 *parm
= TYPE_MAIN_VARIANT (*parm
);
7666 if (TREE_CODE (*parm
) == REFERENCE_TYPE
)
7667 *parm
= TREE_TYPE (*parm
);
7670 /* Like type_unfication.
7672 If SUBR is 1, we're being called recursively (to unify the
7673 arguments of a function or method parameter of a function
7677 type_unification_real (tparms
, targs
, parms
, args
, subr
,
7678 strict
, allow_incomplete
)
7679 tree tparms
, targs
, parms
, args
;
7681 unification_kind_t strict
;
7682 int allow_incomplete
;
7686 int ntparms
= TREE_VEC_LENGTH (tparms
);
7689 my_friendly_assert (TREE_CODE (tparms
) == TREE_VEC
, 289);
7690 my_friendly_assert (parms
== NULL_TREE
7691 || TREE_CODE (parms
) == TREE_LIST
, 290);
7692 /* ARGS could be NULL (via a call from parse.y to
7693 build_x_function_call). */
7695 my_friendly_assert (TREE_CODE (args
) == TREE_LIST
, 291);
7696 my_friendly_assert (ntparms
> 0, 292);
7701 sub_strict
= UNIFY_ALLOW_MORE_CV_QUAL
| UNIFY_ALLOW_DERIVED
;
7705 sub_strict
= UNIFY_ALLOW_LESS_CV_QUAL
;
7709 sub_strict
= UNIFY_ALLOW_NONE
;
7713 my_friendly_abort (0);
7717 && parms
!= void_list_node
7719 && args
!= void_list_node
)
7721 parm
= TREE_VALUE (parms
);
7722 parms
= TREE_CHAIN (parms
);
7723 arg
= TREE_VALUE (args
);
7724 args
= TREE_CHAIN (args
);
7726 if (arg
== error_mark_node
)
7728 if (arg
== unknown_type_node
)
7729 /* We can't deduce anything from this, but we might get all the
7730 template args from other function args. */
7733 /* Conversions will be performed on a function argument that
7734 corresponds with a function parameter that contains only
7735 non-deducible template parameters and explicitly specified
7736 template parameters. */
7737 if (! uses_template_parms (parm
))
7741 if (TREE_CODE_CLASS (TREE_CODE (arg
)) != 't')
7742 type
= TREE_TYPE (arg
);
7749 if (strict
== DEDUCE_EXACT
)
7751 if (same_type_p (parm
, type
))
7755 /* It might work; we shouldn't check now, because we might
7756 get into infinite recursion. Overload resolution will
7763 if (TREE_CODE_CLASS (TREE_CODE (arg
)) != 't')
7765 my_friendly_assert (TREE_TYPE (arg
) != NULL_TREE
, 293);
7766 if (type_unknown_p (arg
))
7768 /* [temp.deduct.type] A template-argument can be deduced from
7769 a pointer to function or pointer to member function
7770 argument if the set of overloaded functions does not
7771 contain function templates and at most one of a set of
7772 overloaded functions provides a unique match. */
7774 if (resolve_overloaded_unification
7775 (tparms
, targs
, parm
, arg
, strict
, sub_strict
)
7780 arg
= TREE_TYPE (arg
);
7784 maybe_adjust_types_for_deduction (strict
, &parm
, &arg
);
7786 switch (unify (tparms
, targs
, parm
, arg
, sub_strict
))
7794 /* Fail if we've reached the end of the parm list, and more args
7795 are present, and the parm list isn't variadic. */
7796 if (args
&& args
!= void_list_node
&& parms
== void_list_node
)
7798 /* Fail if parms are left and they don't have default values. */
7800 && parms
!= void_list_node
7801 && TREE_PURPOSE (parms
) == NULL_TREE
)
7804 for (i
= 0; i
< ntparms
; i
++)
7805 if (TREE_VEC_ELT (targs
, i
) == NULL_TREE
)
7807 if (!allow_incomplete
)
7808 error ("incomplete type unification");
7814 /* Subroutine of type_unification_real. Args are like the variables at the
7815 call site. ARG is an overloaded function (or template-id); we try
7816 deducing template args from each of the overloads, and if only one
7817 succeeds, we go with that. Modifies TARGS and returns 0 on success. */
7820 resolve_overloaded_unification (tparms
, targs
, parm
, arg
, strict
,
7822 tree tparms
, targs
, parm
, arg
;
7823 unification_kind_t strict
;
7826 tree tempargs
= copy_node (targs
);
7829 if (TREE_CODE (arg
) == ADDR_EXPR
)
7830 arg
= TREE_OPERAND (arg
, 0);
7832 if (TREE_CODE (arg
) == COMPONENT_REF
)
7833 /* Handle `&x' where `x' is some static or non-static member
7835 arg
= TREE_OPERAND (arg
, 1);
7837 if (TREE_CODE (arg
) == OFFSET_REF
)
7838 arg
= TREE_OPERAND (arg
, 1);
7840 /* Strip baselink information. */
7841 while (TREE_CODE (arg
) == TREE_LIST
)
7842 arg
= TREE_VALUE (arg
);
7844 if (TREE_CODE (arg
) == TEMPLATE_ID_EXPR
)
7846 /* If we got some explicit template args, we need to plug them into
7847 the affected templates before we try to unify, in case the
7848 explicit args will completely resolve the templates in question. */
7850 tree expl_subargs
= TREE_OPERAND (arg
, 1);
7851 arg
= TREE_OPERAND (arg
, 0);
7853 for (; arg
; arg
= OVL_NEXT (arg
))
7855 tree fn
= OVL_CURRENT (arg
);
7858 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
7861 subargs
= get_bindings_overload (fn
, DECL_RESULT (fn
), expl_subargs
);
7864 elem
= tsubst (TREE_TYPE (fn
), subargs
, /*complain=*/0,
7866 if (TREE_CODE (elem
) == METHOD_TYPE
)
7867 elem
= build_ptrmemfunc_type (build_pointer_type (elem
));
7868 good
+= try_one_overload (tparms
, targs
, tempargs
, parm
, elem
,
7869 strict
, sub_strict
);
7873 else if (TREE_CODE (arg
) == OVERLOAD
)
7875 for (; arg
; arg
= OVL_NEXT (arg
))
7877 tree type
= TREE_TYPE (OVL_CURRENT (arg
));
7878 if (TREE_CODE (type
) == METHOD_TYPE
)
7879 type
= build_ptrmemfunc_type (build_pointer_type (type
));
7880 good
+= try_one_overload (tparms
, targs
, tempargs
, parm
,
7882 strict
, sub_strict
);
7886 my_friendly_abort (981006);
7888 /* [temp.deduct.type] A template-argument can be deduced from a pointer
7889 to function or pointer to member function argument if the set of
7890 overloaded functions does not contain function templates and at most
7891 one of a set of overloaded functions provides a unique match.
7893 So if we found multiple possibilities, we return success but don't
7898 int i
= TREE_VEC_LENGTH (targs
);
7900 if (TREE_VEC_ELT (tempargs
, i
))
7901 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (tempargs
, i
);
7909 /* Subroutine of resolve_overloaded_unification; does deduction for a single
7910 overload. Fills TARGS with any deduced arguments, or error_mark_node if
7911 different overloads deduce different arguments for a given parm.
7912 Returns 1 on success. */
7915 try_one_overload (tparms
, orig_targs
, targs
, parm
, arg
, strict
,
7917 tree tparms
, orig_targs
, targs
, parm
, arg
;
7918 unification_kind_t strict
;
7925 /* [temp.deduct.type] A template-argument can be deduced from a pointer
7926 to function or pointer to member function argument if the set of
7927 overloaded functions does not contain function templates and at most
7928 one of a set of overloaded functions provides a unique match.
7930 So if this is a template, just return success. */
7932 if (uses_template_parms (arg
))
7935 maybe_adjust_types_for_deduction (strict
, &parm
, &arg
);
7937 /* We don't copy orig_targs for this because if we have already deduced
7938 some template args from previous args, unify would complain when we
7939 try to deduce a template parameter for the same argument, even though
7940 there isn't really a conflict. */
7941 nargs
= TREE_VEC_LENGTH (targs
);
7942 tempargs
= make_tree_vec (nargs
);
7944 if (unify (tparms
, tempargs
, parm
, arg
, sub_strict
) != 0)
7947 /* First make sure we didn't deduce anything that conflicts with
7948 explicitly specified args. */
7949 for (i
= nargs
; i
--; )
7951 tree elt
= TREE_VEC_ELT (tempargs
, i
);
7952 tree oldelt
= TREE_VEC_ELT (orig_targs
, i
);
7954 if (elt
== NULL_TREE
)
7956 else if (uses_template_parms (elt
))
7958 /* Since we're unifying against ourselves, we will fill in template
7959 args used in the function parm list with our own template parms.
7961 TREE_VEC_ELT (tempargs
, i
) = NULL_TREE
;
7964 else if (oldelt
&& ! template_args_equal (oldelt
, elt
))
7968 for (i
= nargs
; i
--; )
7970 tree elt
= TREE_VEC_ELT (tempargs
, i
);
7973 TREE_VEC_ELT (targs
, i
) = elt
;
7979 /* PARM is a template class (perhaps with unbound template
7980 parameters). ARG is a fully instantiated type. If ARG can be
7981 bound to PARM, return ARG, otherwise return NULL_TREE. TPARMS and
7982 TARGS are as for unify. */
7985 try_class_unification (tparms
, targs
, parm
, arg
)
7994 if (!CLASSTYPE_TEMPLATE_INFO (arg
)
7995 || CLASSTYPE_TI_TEMPLATE (arg
) != CLASSTYPE_TI_TEMPLATE (parm
))
7998 /* We need to make a new template argument vector for the call to
7999 unify. If we used TARGS, we'd clutter it up with the result of
8000 the attempted unification, even if this class didn't work out.
8001 We also don't want to commit ourselves to all the unifications
8002 we've already done, since unification is supposed to be done on
8003 an argument-by-argument basis. In other words, consider the
8004 following pathological case:
8006 template <int I, int J, int K>
8009 template <int I, int J>
8010 struct S<I, J, 2> : public S<I, I, I>, S<J, J, J> {};
8012 template <int I, int J, int K>
8013 void f(S<I, J, K>, S<I, I, I>);
8022 Now, by the time we consider the unification involving `s2', we
8023 already know that we must have `f<0, 0, 0>'. But, even though
8024 `S<0, 1, 2>' is derived from `S<0, 0, 0>', the code is not legal
8025 because there are two ways to unify base classes of S<0, 1, 2>
8026 with S<I, I, I>. If we kept the already deduced knowledge, we
8027 would reject the possibility I=1. */
8028 copy_of_targs
= make_tree_vec (TREE_VEC_LENGTH (targs
));
8029 i
= unify (tparms
, copy_of_targs
, CLASSTYPE_TI_ARGS (parm
),
8030 CLASSTYPE_TI_ARGS (arg
), UNIFY_ALLOW_NONE
);
8032 /* If unification failed, we're done. */
8039 /* Subroutine of get_template_base. RVAL, if non-NULL, is a base we
8040 have alreay discovered to be satisfactory. ARG_BINFO is the binfo
8041 for the base class of ARG that we are currently examining. */
8044 get_template_base_recursive (tparms
, targs
, parm
,
8045 arg_binfo
, rval
, flags
)
8055 tree arg
= BINFO_TYPE (arg_binfo
);
8057 if (!(flags
& GTB_IGNORE_TYPE
))
8059 tree r
= try_class_unification (tparms
, targs
,
8062 /* If there is more than one satisfactory baseclass, then:
8066 If they yield more than one possible deduced A, the type
8070 if (r
&& rval
&& !same_type_p (r
, rval
))
8071 return error_mark_node
;
8076 binfos
= BINFO_BASETYPES (arg_binfo
);
8077 n_baselinks
= binfos
? TREE_VEC_LENGTH (binfos
) : 0;
8079 /* Process base types. */
8080 for (i
= 0; i
< n_baselinks
; i
++)
8082 tree base_binfo
= TREE_VEC_ELT (binfos
, i
);
8085 /* Skip this base, if we've already seen it. */
8086 if (BINFO_MARKED (base_binfo
))
8090 (flags
& GTB_VIA_VIRTUAL
) || TREE_VIA_VIRTUAL (base_binfo
);
8092 /* When searching for a non-virtual, we cannot mark virtually
8095 SET_BINFO_MARKED (base_binfo
);
8097 rval
= get_template_base_recursive (tparms
, targs
,
8101 GTB_VIA_VIRTUAL
* this_virtual
);
8103 /* If we discovered more than one matching base class, we can
8105 if (rval
== error_mark_node
)
8106 return error_mark_node
;
8112 /* Given a template type PARM and a class type ARG, find the unique
8113 base type in ARG that is an instance of PARM. We do not examine
8114 ARG itself; only its base-classes. If there is no appropriate base
8115 class, return NULL_TREE. If there is more than one, return
8116 error_mark_node. PARM may be the type of a partial specialization,
8117 as well as a plain template type. Used by unify. */
8120 get_template_base (tparms
, targs
, parm
, arg
)
8129 my_friendly_assert (IS_AGGR_TYPE_CODE (TREE_CODE (arg
)), 92);
8131 arg_binfo
= TYPE_BINFO (complete_type (arg
));
8132 rval
= get_template_base_recursive (tparms
, targs
,
8137 /* Since get_template_base_recursive marks the bases classes, we
8138 must unmark them here. */
8139 dfs_walk (arg_binfo
, dfs_unmark
, markedp
, 0);
8144 /* Returns the level of DECL, which declares a template parameter. */
8147 template_decl_level (decl
)
8150 switch (TREE_CODE (decl
))
8154 return TEMPLATE_TYPE_LEVEL (TREE_TYPE (decl
));
8157 return TEMPLATE_PARM_LEVEL (DECL_INITIAL (decl
));
8160 my_friendly_abort (0);
8165 /* Decide whether ARG can be unified with PARM, considering only the
8166 cv-qualifiers of each type, given STRICT as documented for unify.
8167 Returns non-zero iff the unification is OK on that basis.*/
8170 check_cv_quals_for_unify (strict
, arg
, parm
)
8175 if (!(strict
& UNIFY_ALLOW_MORE_CV_QUAL
)
8176 && !at_least_as_qualified_p (arg
, parm
))
8179 if (!(strict
& UNIFY_ALLOW_LESS_CV_QUAL
)
8180 && !at_least_as_qualified_p (parm
, arg
))
8186 /* Takes parameters as for type_unification. Returns 0 if the
8187 type deduction suceeds, 1 otherwise. The parameter STRICT is a
8188 bitwise or of the following flags:
8191 Require an exact match between PARM and ARG.
8192 UNIFY_ALLOW_MORE_CV_QUAL:
8193 Allow the deduced ARG to be more cv-qualified than ARG.
8194 UNIFY_ALLOW_LESS_CV_QUAL:
8195 Allow the deduced ARG to be less cv-qualified than ARG.
8196 UNIFY_ALLOW_DERIVED:
8197 Allow the deduced ARG to be a template base class of ARG,
8198 or a pointer to a template base class of the type pointed to by
8200 UNIFY_ALLOW_INTEGER:
8201 Allow any integral type to be deduced. See the TEMPLATE_PARM_INDEX
8202 case for more information. */
8205 unify (tparms
, targs
, parm
, arg
, strict
)
8206 tree tparms
, targs
, parm
, arg
;
8213 /* I don't think this will do the right thing with respect to types.
8214 But the only case I've seen it in so far has been array bounds, where
8215 signedness is the only information lost, and I think that will be
8217 while (TREE_CODE (parm
) == NOP_EXPR
)
8218 parm
= TREE_OPERAND (parm
, 0);
8220 if (arg
== error_mark_node
)
8222 if (arg
== unknown_type_node
)
8223 /* We can't deduce anything from this, but we might get all the
8224 template args from other function args. */
8227 /* If PARM uses template parameters, then we can't bail out here,
8228 even if ARG == PARM, since we won't record unifications for the
8229 template parameters. We might need them if we're trying to
8230 figure out which of two things is more specialized. */
8231 if (arg
== parm
&& !uses_template_parms (parm
))
8234 /* Immediately reject some pairs that won't unify because of
8235 cv-qualification mismatches. */
8236 if (TREE_CODE (arg
) == TREE_CODE (parm
)
8237 && TREE_CODE_CLASS (TREE_CODE (arg
)) == 't'
8238 /* We check the cv-qualifiers when unifying with template type
8239 parameters below. We want to allow ARG `const T' to unify with
8240 PARM `T' for example, when computing which of two templates
8241 is more specialized, for example. */
8242 && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
8243 && !check_cv_quals_for_unify (strict
, arg
, parm
))
8246 switch (TREE_CODE (parm
))
8249 /* In a type which contains a nested-name-specifier, template
8250 argument values cannot be deduced for template parameters used
8251 within the nested-name-specifier. */
8254 case TEMPLATE_TYPE_PARM
:
8255 case TEMPLATE_TEMPLATE_PARM
:
8256 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
8258 if (TEMPLATE_TYPE_LEVEL (parm
)
8259 != template_decl_level (tparm
))
8260 /* The PARM is not one we're trying to unify. Just check
8261 to see if it matches ARG. */
8262 return (TREE_CODE (arg
) == TREE_CODE (parm
)
8263 && same_type_p (parm
, arg
)) ? 0 : 1;
8264 idx
= TEMPLATE_TYPE_IDX (parm
);
8265 targ
= TREE_VEC_ELT (targs
, idx
);
8266 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, idx
));
8268 /* Check for mixed types and values. */
8269 if ((TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
8270 && TREE_CODE (tparm
) != TYPE_DECL
)
8271 || (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
8272 && TREE_CODE (tparm
) != TEMPLATE_DECL
))
8275 if (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
)
8277 if (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (parm
))
8279 /* We arrive here when PARM does not involve template
8282 /* ARG must be constructed from a template class. */
8283 if (TREE_CODE (arg
) != RECORD_TYPE
|| !CLASSTYPE_TEMPLATE_INFO (arg
))
8287 tree parmtmpl
= TYPE_TI_TEMPLATE (parm
);
8288 tree parmvec
= TYPE_TI_ARGS (parm
);
8289 tree argvec
= CLASSTYPE_TI_ARGS (arg
);
8291 = DECL_INNERMOST_TEMPLATE_PARMS (CLASSTYPE_TI_TEMPLATE (arg
));
8294 /* The parameter and argument roles have to be switched here
8295 in order to handle default arguments properly. For example,
8296 template<template <class> class TT> void f(TT<int>)
8297 should be able to accept vector<int> which comes from
8298 template <class T, class Allocator = allocator>
8301 if (coerce_template_parms (argtmplvec
, parmvec
, parmtmpl
, 0, 1)
8305 /* Deduce arguments T, i from TT<T> or TT<i>.
8306 We check each element of PARMVEC and ARGVEC individually
8307 rather than the whole TREE_VEC since they can have
8308 different number of elements. */
8310 for (i
= 0; i
< TREE_VEC_LENGTH (parmvec
); ++i
)
8312 tree t
= TREE_VEC_ELT (parmvec
, i
);
8314 if (unify (tparms
, targs
, t
,
8315 TREE_VEC_ELT (argvec
, i
),
8320 arg
= CLASSTYPE_TI_TEMPLATE (arg
);
8325 /* If PARM is `const T' and ARG is only `int', we don't have
8326 a match unless we are allowing additional qualification.
8327 If ARG is `const int' and PARM is just `T' that's OK;
8328 that binds `const int' to `T'. */
8329 if (!check_cv_quals_for_unify (strict
| UNIFY_ALLOW_LESS_CV_QUAL
,
8333 /* Consider the case where ARG is `const volatile int' and
8334 PARM is `const T'. Then, T should be `volatile int'. */
8336 cp_build_qualified_type_real (arg
,
8338 & ~CP_TYPE_QUALS (parm
),
8340 if (arg
== error_mark_node
)
8344 /* Simple cases: Value already set, does match or doesn't. */
8345 if (targ
!= NULL_TREE
&& same_type_p (targ
, arg
))
8350 /* Make sure that ARG is not a variable-sized array. (Note that
8351 were talking about variable-sized arrays (like `int[n]'),
8352 rather than arrays of unknown size (like `int[]').) We'll
8353 get very confused by such a type since the bound of the array
8354 will not be computable in an instantiation. Besides, such
8355 types are not allowed in ISO C++, so we can do as we please
8357 if (TREE_CODE (arg
) == ARRAY_TYPE
8358 && !uses_template_parms (arg
)
8359 && (TREE_CODE (TYPE_MAX_VALUE (TYPE_DOMAIN (arg
)))
8363 TREE_VEC_ELT (targs
, idx
) = arg
;
8366 case TEMPLATE_PARM_INDEX
:
8367 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
8369 if (TEMPLATE_PARM_LEVEL (parm
)
8370 != template_decl_level (tparm
))
8371 /* The PARM is not one we're trying to unify. Just check
8372 to see if it matches ARG. */
8373 return (TREE_CODE (arg
) == TREE_CODE (parm
)
8374 && cp_tree_equal (parm
, arg
) > 0) ? 0 : 1;
8376 idx
= TEMPLATE_PARM_IDX (parm
);
8377 targ
= TREE_VEC_ELT (targs
, idx
);
8381 int i
= (cp_tree_equal (targ
, arg
) > 0);
8387 my_friendly_abort (42);
8390 /* [temp.deduct.type] If, in the declaration of a function template
8391 with a non-type template-parameter, the non-type
8392 template-parameter is used in an expression in the function
8393 parameter-list and, if the corresponding template-argument is
8394 deduced, the template-argument type shall match the type of the
8395 template-parameter exactly, except that a template-argument
8396 deduced from an array bound may be of any integral type. */
8397 if (same_type_p (TREE_TYPE (arg
), TREE_TYPE (parm
)))
8399 else if ((strict
& UNIFY_ALLOW_INTEGER
)
8400 && (TREE_CODE (TREE_TYPE (parm
)) == INTEGER_TYPE
8401 || TREE_CODE (TREE_TYPE (parm
)) == BOOLEAN_TYPE
))
8406 TREE_VEC_ELT (targs
, idx
) = arg
;
8413 if (TREE_CODE (arg
) != POINTER_TYPE
)
8416 /* [temp.deduct.call]
8418 A can be another pointer or pointer to member type that can
8419 be converted to the deduced A via a qualification
8420 conversion (_conv.qual_).
8422 We pass down STRICT here rather than UNIFY_ALLOW_NONE.
8423 This will allow for additional cv-qualification of the
8424 pointed-to types if appropriate. In general, this is a bit
8425 too generous; we are only supposed to allow qualification
8426 conversions and this method will allow an ARG of char** and
8427 a deduced ARG of const char**. However, overload
8428 resolution will subsequently invalidate the candidate, so
8429 this is probably OK. */
8430 sub_strict
= strict
;
8432 if (TREE_CODE (TREE_TYPE (arg
)) != RECORD_TYPE
)
8433 /* The derived-to-base conversion only persists through one
8434 level of pointers. */
8435 sub_strict
&= ~UNIFY_ALLOW_DERIVED
;
8437 return unify (tparms
, targs
, TREE_TYPE (parm
),
8438 TREE_TYPE (arg
), sub_strict
);
8441 case REFERENCE_TYPE
:
8442 if (TREE_CODE (arg
) != REFERENCE_TYPE
)
8444 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
8448 if (TREE_CODE (arg
) != ARRAY_TYPE
)
8450 if ((TYPE_DOMAIN (parm
) == NULL_TREE
)
8451 != (TYPE_DOMAIN (arg
) == NULL_TREE
))
8453 if (TYPE_DOMAIN (parm
) != NULL_TREE
8454 && unify (tparms
, targs
, TYPE_DOMAIN (parm
),
8455 TYPE_DOMAIN (arg
), UNIFY_ALLOW_NONE
) != 0)
8457 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
8465 if (TREE_CODE (arg
) != TREE_CODE (parm
))
8468 if (TREE_CODE (parm
) == INTEGER_TYPE
8469 && TREE_CODE (TYPE_MAX_VALUE (parm
)) != INTEGER_CST
)
8471 if (TYPE_MIN_VALUE (parm
) && TYPE_MIN_VALUE (arg
)
8472 && unify (tparms
, targs
, TYPE_MIN_VALUE (parm
),
8473 TYPE_MIN_VALUE (arg
), UNIFY_ALLOW_INTEGER
))
8475 if (TYPE_MAX_VALUE (parm
) && TYPE_MAX_VALUE (arg
)
8476 && unify (tparms
, targs
, TYPE_MAX_VALUE (parm
),
8477 TYPE_MAX_VALUE (arg
), UNIFY_ALLOW_INTEGER
))
8480 /* We use the TYPE_MAIN_VARIANT since we have already
8481 checked cv-qualification at the top of the
8483 else if (!same_type_p (TYPE_MAIN_VARIANT (arg
),
8484 TYPE_MAIN_VARIANT (parm
)))
8487 /* As far as unification is concerned, this wins. Later checks
8488 will invalidate it if necessary. */
8491 /* Types INTEGER_CST and MINUS_EXPR can come from array bounds. */
8492 /* Type INTEGER_CST can come from ordinary constant template args. */
8494 while (TREE_CODE (arg
) == NOP_EXPR
)
8495 arg
= TREE_OPERAND (arg
, 0);
8497 if (TREE_CODE (arg
) != INTEGER_CST
)
8499 return !tree_int_cst_equal (parm
, arg
);
8504 if (TREE_CODE (arg
) != TREE_VEC
)
8506 if (TREE_VEC_LENGTH (parm
) != TREE_VEC_LENGTH (arg
))
8508 for (i
= TREE_VEC_LENGTH (parm
) - 1; i
>= 0; i
--)
8509 if (unify (tparms
, targs
,
8510 TREE_VEC_ELT (parm
, i
), TREE_VEC_ELT (arg
, i
),
8518 if (TREE_CODE (arg
) != TREE_CODE (parm
))
8521 if (TYPE_PTRMEMFUNC_P (parm
))
8523 if (!TYPE_PTRMEMFUNC_P (arg
))
8526 return unify (tparms
, targs
,
8527 TYPE_PTRMEMFUNC_FN_TYPE (parm
),
8528 TYPE_PTRMEMFUNC_FN_TYPE (arg
),
8532 if (CLASSTYPE_TEMPLATE_INFO (parm
))
8536 if (strict
& UNIFY_ALLOW_DERIVED
)
8538 /* First, we try to unify the PARM and ARG directly. */
8539 t
= try_class_unification (tparms
, targs
,
8544 /* Fallback to the special case allowed in
8547 If P is a class, and P has the form
8548 template-id, then A can be a derived class of
8549 the deduced A. Likewise, if P is a pointer to
8550 a class of the form template-id, A can be a
8551 pointer to a derived class pointed to by the
8553 t
= get_template_base (tparms
, targs
,
8556 if (! t
|| t
== error_mark_node
)
8560 else if (CLASSTYPE_TEMPLATE_INFO (arg
)
8561 && (CLASSTYPE_TI_TEMPLATE (parm
)
8562 == CLASSTYPE_TI_TEMPLATE (arg
)))
8563 /* Perhaps PARM is something like S<U> and ARG is S<int>.
8564 Then, we should unify `int' and `U'. */
8567 /* There's no chance of unication succeeding. */
8570 return unify (tparms
, targs
, CLASSTYPE_TI_ARGS (parm
),
8571 CLASSTYPE_TI_ARGS (t
), UNIFY_ALLOW_NONE
);
8573 else if (!same_type_p (TYPE_MAIN_VARIANT (parm
),
8574 TYPE_MAIN_VARIANT (arg
)))
8580 if (TREE_CODE (arg
) != TREE_CODE (parm
))
8583 if (unify (tparms
, targs
, TREE_TYPE (parm
),
8584 TREE_TYPE (arg
), UNIFY_ALLOW_NONE
))
8586 return type_unification_real (tparms
, targs
, TYPE_ARG_TYPES (parm
),
8587 TYPE_ARG_TYPES (arg
), 1,
8591 if (TREE_CODE (arg
) != OFFSET_TYPE
)
8593 if (unify (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
8594 TYPE_OFFSET_BASETYPE (arg
), UNIFY_ALLOW_NONE
))
8596 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
8600 if (arg
!= decl_constant_value (parm
))
8605 /* Matched cases are handled by the ARG == PARM test above. */
8609 if (TREE_CODE (TREE_OPERAND (parm
, 1)) == INTEGER_CST
)
8611 /* We handle this case specially, since it comes up with
8612 arrays. In particular, something like:
8614 template <int N> void f(int (&x)[N]);
8616 Here, we are trying to unify the range type, which
8617 looks like [0 ... (N - 1)]. */
8619 t1
= TREE_OPERAND (parm
, 0);
8620 t2
= TREE_OPERAND (parm
, 1);
8622 /* Should this be a regular fold? */
8623 t
= maybe_fold_nontype_arg (build (PLUS_EXPR
,
8627 return unify (tparms
, targs
, t1
, t
, strict
);
8629 /* else fall through */
8632 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (parm
))))
8633 /* We're looking at an expression. This can happen with
8637 void foo(S<I>, S<I + 2>);
8639 This is a "nondeduced context":
8643 The nondeduced contexts are:
8645 --A type that is a template-id in which one or more of
8646 the template-arguments is an expression that references
8647 a template-parameter.
8649 In these cases, we assume deduction succeeded, but don't
8650 actually infer any unifications. */
8653 sorry ("use of `%s' in template type unification",
8654 tree_code_name
[(int) TREE_CODE (parm
)]);
8660 /* Called if RESULT is explicitly instantiated, or is a member of an
8661 explicitly instantiated class, or if using -frepo and the
8662 instantiation of RESULT has been assigned to this file. */
8665 mark_decl_instantiated (result
, extern_p
)
8669 if (TREE_CODE (result
) != FUNCTION_DECL
)
8670 /* The TREE_PUBLIC flag for function declarations will have been
8671 set correctly by tsubst. */
8672 TREE_PUBLIC (result
) = 1;
8676 DECL_INTERFACE_KNOWN (result
) = 1;
8677 DECL_NOT_REALLY_EXTERN (result
) = 1;
8679 /* Always make artificials weak. */
8680 if (DECL_ARTIFICIAL (result
) && flag_weak
)
8681 comdat_linkage (result
);
8682 /* For WIN32 we also want to put explicit instantiations in
8683 linkonce sections. */
8684 else if (TREE_PUBLIC (result
))
8685 maybe_make_one_only (result
);
8687 else if (TREE_CODE (result
) == FUNCTION_DECL
)
8688 mark_inline_for_output (result
);
8691 /* Given two function templates PAT1 and PAT2, and explicit template
8692 arguments EXPLICIT_ARGS return:
8694 1 if PAT1 is more specialized than PAT2 as described in [temp.func.order].
8695 -1 if PAT2 is more specialized than PAT1.
8696 0 if neither is more specialized. */
8699 more_specialized (pat1
, pat2
, explicit_args
)
8700 tree pat1
, pat2
, explicit_args
;
8705 targs
= get_bindings_overload (pat1
, DECL_RESULT (pat2
), explicit_args
);
8709 targs
= get_bindings_overload (pat2
, DECL_RESULT (pat1
), explicit_args
);
8716 /* Given two class template specialization list nodes PAT1 and PAT2, return:
8718 1 if PAT1 is more specialized than PAT2 as described in [temp.class.order].
8719 -1 if PAT2 is more specialized than PAT1.
8720 0 if neither is more specialized. */
8723 more_specialized_class (pat1
, pat2
)
8729 targs
= get_class_bindings (TREE_VALUE (pat1
), TREE_PURPOSE (pat1
),
8730 TREE_PURPOSE (pat2
));
8734 targs
= get_class_bindings (TREE_VALUE (pat2
), TREE_PURPOSE (pat2
),
8735 TREE_PURPOSE (pat1
));
8742 /* Return the template arguments that will produce the function signature
8743 DECL from the function template FN, with the explicit template
8744 arguments EXPLICIT_ARGS. If CHECK_RETTYPE is 1, the return type must
8745 also match. Return NULL_TREE if no satisfactory arguments could be
8749 get_bindings_real (fn
, decl
, explicit_args
, check_rettype
)
8750 tree fn
, decl
, explicit_args
;
8753 int ntparms
= DECL_NTPARMS (fn
);
8754 tree targs
= make_tree_vec (ntparms
);
8756 tree decl_arg_types
;
8759 /* Substitute the explicit template arguments into the type of DECL.
8760 The call to fn_type_unification will handle substitution into the
8762 decl_type
= TREE_TYPE (decl
);
8763 if (explicit_args
&& uses_template_parms (decl_type
))
8766 tree converted_args
;
8768 if (DECL_TEMPLATE_INFO (decl
))
8769 tmpl
= DECL_TI_TEMPLATE (decl
);
8771 /* We can get here for some illegal specializations. */
8775 = (coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
8776 explicit_args
, NULL_TREE
,
8778 /*require_all_arguments=*/0));
8779 if (converted_args
== error_mark_node
)
8782 decl_type
= tsubst (decl_type
, converted_args
, /*complain=*/0,
8784 if (decl_type
== error_mark_node
)
8788 /* If FN is a static member function, adjust the type of DECL
8790 decl_arg_types
= TYPE_ARG_TYPES (decl_type
);
8791 if (DECL_STATIC_FUNCTION_P (fn
)
8792 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
8793 decl_arg_types
= TREE_CHAIN (decl_arg_types
);
8795 i
= fn_type_unification (fn
, explicit_args
, targs
,
8797 TREE_TYPE (decl_type
),
8805 /* Check to see that the resulting return type is also OK. */
8806 tree t
= tsubst (TREE_TYPE (TREE_TYPE (fn
)), targs
,
8807 /*complain=*/0, NULL_TREE
);
8809 if (!same_type_p (t
, TREE_TYPE (TREE_TYPE (decl
))))
8816 /* For most uses, we want to check the return type. */
8819 get_bindings (fn
, decl
, explicit_args
)
8820 tree fn
, decl
, explicit_args
;
8822 return get_bindings_real (fn
, decl
, explicit_args
, 1);
8825 /* But for more_specialized, we only care about the parameter types. */
8828 get_bindings_overload (fn
, decl
, explicit_args
)
8829 tree fn
, decl
, explicit_args
;
8831 return get_bindings_real (fn
, decl
, explicit_args
, 0);
8834 /* Return the innermost template arguments that, when applied to a
8835 template specialization whose innermost template parameters are
8836 TPARMS, and whose specialization arguments are ARGS, yield the
8839 For example, suppose we have:
8841 template <class T, class U> struct S {};
8842 template <class T> struct S<T*, int> {};
8844 Then, suppose we want to get `S<double*, int>'. The TPARMS will be
8845 {T}, the PARMS will be {T*, int} and the ARGS will be {double*,
8846 int}. The resulting vector will be {double}, indicating that `T'
8847 is bound to `double'. */
8850 get_class_bindings (tparms
, parms
, args
)
8851 tree tparms
, parms
, args
;
8853 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
8854 tree vec
= make_tree_vec (ntparms
);
8856 args
= innermost_args (args
);
8858 if (unify (tparms
, vec
, parms
, args
, UNIFY_ALLOW_NONE
))
8861 for (i
= 0; i
< ntparms
; ++i
)
8862 if (! TREE_VEC_ELT (vec
, i
))
8868 /* In INSTANTIATIONS is a list of <INSTANTIATION, TEMPLATE> pairs.
8869 Pick the most specialized template, and return the corresponding
8870 instantiation, or if there is no corresponding instantiation, the
8871 template itself. EXPLICIT_ARGS is any template arguments explicity
8872 mentioned in a template-id. If there is no most specialized
8873 tempalte, error_mark_node is returned. If there are no templates
8874 at all, NULL_TREE is returned. */
8877 most_specialized_instantiation (instantiations
, explicit_args
)
8878 tree instantiations
;
8884 if (!instantiations
)
8887 champ
= instantiations
;
8888 for (fn
= TREE_CHAIN (instantiations
); fn
; fn
= TREE_CHAIN (fn
))
8890 fate
= more_specialized (TREE_VALUE (champ
),
8891 TREE_VALUE (fn
), explicit_args
);
8898 fn
= TREE_CHAIN (fn
);
8900 return error_mark_node
;
8906 for (fn
= instantiations
; fn
&& fn
!= champ
; fn
= TREE_CHAIN (fn
))
8908 fate
= more_specialized (TREE_VALUE (champ
),
8909 TREE_VALUE (fn
), explicit_args
);
8911 return error_mark_node
;
8914 return TREE_PURPOSE (champ
) ? TREE_PURPOSE (champ
) : TREE_VALUE (champ
);
8917 /* Return the most specialized of the list of templates in FNS that can
8918 produce an instantiation matching DECL, given the explicit template
8919 arguments EXPLICIT_ARGS. */
8922 most_specialized (fns
, decl
, explicit_args
)
8923 tree fns
, decl
, explicit_args
;
8925 tree candidates
= NULL_TREE
;
8928 for (fn
= fns
; fn
; fn
= TREE_CHAIN (fn
))
8930 tree candidate
= TREE_VALUE (fn
);
8932 args
= get_bindings (candidate
, decl
, explicit_args
);
8934 candidates
= tree_cons (NULL_TREE
, candidate
, candidates
);
8937 return most_specialized_instantiation (candidates
, explicit_args
);
8940 /* If DECL is a specialization of some template, return the most
8941 general such template. For example, given:
8943 template <class T> struct S { template <class U> void f(U); };
8945 if TMPL is `template <class U> void S<int>::f(U)' this will return
8946 the full template. This function will not trace past partial
8947 specializations, however. For example, given in addition:
8949 template <class T> struct S<T*> { template <class U> void f(U); };
8951 if TMPL is `template <class U> void S<int*>::f(U)' this will return
8952 `template <class T> template <class U> S<T*>::f(U)'. */
8955 most_general_template (decl
)
8958 while (DECL_TEMPLATE_INFO (decl
)
8959 /* The DECL_TI_TEMPLATE can be a LOOKUP_EXPR or
8960 IDENTIFIER_NODE in some cases. (See cp-tree.h for
8962 && TREE_CODE (DECL_TI_TEMPLATE (decl
)) == TEMPLATE_DECL
)
8963 decl
= DECL_TI_TEMPLATE (decl
);
8968 /* Return the most specialized of the class template specializations
8969 of TMPL which can produce an instantiation matching ARGS, or
8970 error_mark_node if the choice is ambiguous. */
8973 most_specialized_class (tmpl
, args
)
8977 tree list
= NULL_TREE
;
8982 tmpl
= most_general_template (tmpl
);
8983 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
); t
; t
= TREE_CHAIN (t
))
8986 = get_class_bindings (TREE_VALUE (t
), TREE_PURPOSE (t
), args
);
8989 list
= decl_tree_cons (TREE_PURPOSE (t
), TREE_VALUE (t
), list
);
8990 TREE_TYPE (list
) = TREE_TYPE (t
);
9000 for (; t
; t
= TREE_CHAIN (t
))
9002 fate
= more_specialized_class (champ
, t
);
9011 return error_mark_node
;
9017 for (t
= list
; t
&& t
!= champ
; t
= TREE_CHAIN (t
))
9019 fate
= more_specialized_class (champ
, t
);
9021 return error_mark_node
;
9027 /* called from the parser. */
9030 do_decl_instantiation (declspecs
, declarator
, storage
)
9031 tree declspecs
, declarator
, storage
;
9033 tree decl
= grokdeclarator (declarator
, declspecs
, NORMAL
, 0, NULL_TREE
);
9034 tree result
= NULL_TREE
;
9038 /* An error ocurred, for which grokdeclarator has already issued
9039 an appropriate message. */
9041 else if (! DECL_LANG_SPECIFIC (decl
))
9043 cp_error ("explicit instantiation of non-template `%#D'", decl
);
9046 else if (TREE_CODE (decl
) == VAR_DECL
)
9048 /* There is an asymmetry here in the way VAR_DECLs and
9049 FUNCTION_DECLs are handled by grokdeclarator. In the case of
9050 the latter, the DECL we get back will be marked as a
9051 template instantiation, and the appropriate
9052 DECL_TEMPLATE_INFO will be set up. This does not happen for
9053 VAR_DECLs so we do the lookup here. Probably, grokdeclarator
9054 should handle VAR_DECLs as it currently handles
9056 result
= lookup_field (DECL_CONTEXT (decl
), DECL_NAME (decl
), 0, 0);
9057 if (result
&& TREE_CODE (result
) != VAR_DECL
)
9059 cp_error ("no matching template for `%D' found", result
);
9063 else if (TREE_CODE (decl
) != FUNCTION_DECL
)
9065 cp_error ("explicit instantiation of `%#D'", decl
);
9071 /* Check for various error cases. Note that if the explicit
9072 instantiation is legal the RESULT will currently be marked as an
9073 *implicit* instantiation; DECL_EXPLICIT_INSTANTIATION is not set
9074 until we get here. */
9076 if (DECL_TEMPLATE_SPECIALIZATION (result
))
9080 No program shall both explicitly instantiate and explicitly
9081 specialize a template. */
9082 cp_pedwarn ("explicit instantiation of `%#D' after", result
);
9083 cp_pedwarn_at ("explicit specialization here", result
);
9086 else if (DECL_EXPLICIT_INSTANTIATION (result
))
9090 No program shall explicitly instantiate any template more
9093 We check DECL_INTERFACE_KNOWN so as not to complain when the first
9094 instantiation was `extern' and the second is not, and EXTERN_P for
9095 the opposite case. If -frepo, chances are we already got marked
9096 as an explicit instantion because of the repo file. */
9097 if (DECL_INTERFACE_KNOWN (result
) && !extern_p
&& !flag_use_repository
)
9098 cp_pedwarn ("duplicate explicit instantiation of `%#D'", result
);
9100 /* If we've already instantiated the template, just return now. */
9101 if (DECL_INTERFACE_KNOWN (result
))
9104 else if (!DECL_IMPLICIT_INSTANTIATION (result
))
9106 cp_error ("no matching template for `%D' found", result
);
9109 else if (!DECL_TEMPLATE_INFO (result
))
9111 cp_pedwarn ("explicit instantiation of non-template `%#D'", result
);
9115 if (flag_external_templates
)
9118 if (storage
== NULL_TREE
)
9120 else if (storage
== ridpointers
[(int) RID_EXTERN
])
9123 cp_pedwarn ("ANSI C++ forbids the use of `extern' on explicit instantiations");
9127 cp_error ("storage class `%D' applied to template instantiation",
9130 SET_DECL_EXPLICIT_INSTANTIATION (result
);
9131 mark_decl_instantiated (result
, extern_p
);
9132 repo_template_instantiated (result
, extern_p
);
9134 instantiate_decl (result
);
9138 mark_class_instantiated (t
, extern_p
)
9142 SET_CLASSTYPE_EXPLICIT_INSTANTIATION (t
);
9143 SET_CLASSTYPE_INTERFACE_KNOWN (t
);
9144 CLASSTYPE_INTERFACE_ONLY (t
) = extern_p
;
9145 CLASSTYPE_VTABLE_NEEDS_WRITING (t
) = ! extern_p
;
9146 TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (t
)) = extern_p
;
9149 CLASSTYPE_DEBUG_REQUESTED (t
) = 1;
9150 rest_of_type_compilation (t
, 1);
9155 do_type_instantiation (t
, storage
)
9162 if (TREE_CODE (t
) == TYPE_DECL
)
9165 if (! CLASS_TYPE_P (t
) || ! CLASSTYPE_TEMPLATE_INFO (t
))
9167 cp_error ("explicit instantiation of non-template type `%T'", t
);
9173 /* With -fexternal-templates, explicit instantiations are treated the same
9174 as implicit ones. */
9175 if (flag_external_templates
)
9178 if (TYPE_SIZE (t
) == NULL_TREE
)
9180 cp_error ("explicit instantiation of `%#T' before definition of template",
9185 if (storage
!= NULL_TREE
)
9188 cp_pedwarn("ANSI C++ forbids the use of `%s' on explicit instantiations",
9189 IDENTIFIER_POINTER (storage
));
9191 if (storage
== ridpointers
[(int) RID_INLINE
])
9193 else if (storage
== ridpointers
[(int) RID_EXTERN
])
9195 else if (storage
== ridpointers
[(int) RID_STATIC
])
9199 cp_error ("storage class `%D' applied to template instantiation",
9205 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
9209 No program shall both explicitly instantiate and explicitly
9210 specialize a template. */
9211 cp_error ("explicit instantiation of `%#T' after", t
);
9212 cp_error_at ("explicit specialization here", t
);
9215 else if (CLASSTYPE_EXPLICIT_INSTANTIATION (t
))
9219 No program shall explicitly instantiate any template more
9222 If CLASSTYPE_INTERFACE_ONLY, then the first explicit instantiation
9223 was `extern'. If EXTERN_P then the second is. If -frepo, chances
9224 are we already got marked as an explicit instantion because of the
9225 repo file. All these cases are OK. */
9226 if (!CLASSTYPE_INTERFACE_ONLY (t
) && !extern_p
&& !flag_use_repository
)
9227 cp_pedwarn ("duplicate explicit instantiation of `%#T'", t
);
9229 /* If we've already instantiated the template, just return now. */
9230 if (!CLASSTYPE_INTERFACE_ONLY (t
))
9234 mark_class_instantiated (t
, extern_p
);
9235 repo_template_instantiated (t
, extern_p
);
9243 /* In contrast to implicit instantiation, where only the
9244 declarations, and not the definitions, of members are
9245 instantiated, we have here:
9249 The explicit instantiation of a class template specialization
9250 implies the instantiation of all of its members not
9251 previously explicitly specialized in the translation unit
9252 containing the explicit instantiation.
9254 Of course, we can't instantiate member template classes, since
9255 we don't have any arguments for them. Note that the standard
9256 is unclear on whether the instatiation of the members are
9257 *explicit* instantiations or not. We choose to be generous,
9258 and not set DECL_EXPLICIT_INSTANTIATION. Therefore, we allow
9259 the explicit instantiation of a class where some of the members
9260 have no definition in the current translation unit. */
9263 for (tmp
= TYPE_METHODS (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
9264 if (TREE_CODE (tmp
) == FUNCTION_DECL
9265 && DECL_TEMPLATE_INSTANTIATION (tmp
))
9267 mark_decl_instantiated (tmp
, extern_p
);
9268 repo_template_instantiated (tmp
, extern_p
);
9270 instantiate_decl (tmp
);
9273 for (tmp
= TYPE_FIELDS (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
9274 if (TREE_CODE (tmp
) == VAR_DECL
&& DECL_TEMPLATE_INSTANTIATION (tmp
))
9276 mark_decl_instantiated (tmp
, extern_p
);
9277 repo_template_instantiated (tmp
, extern_p
);
9279 instantiate_decl (tmp
);
9282 for (tmp
= CLASSTYPE_TAGS (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
9283 if (IS_AGGR_TYPE (TREE_VALUE (tmp
))
9284 && !uses_template_parms (CLASSTYPE_TI_ARGS (TREE_VALUE (tmp
))))
9285 do_type_instantiation (TYPE_MAIN_DECL (TREE_VALUE (tmp
)), storage
);
9289 /* Given a function DECL, which is a specialization of TMPL, modify
9290 DECL to be a re-instantiation of TMPL with the same template
9291 arguments. TMPL should be the template into which tsubst'ing
9292 should occur for DECL, not the most general template.
9294 One reason for doing this is a scenario like this:
9297 void f(const T&, int i);
9299 void g() { f(3, 7); }
9302 void f(const T& t, const int i) { }
9304 Note that when the template is first instantiated, with
9305 instantiate_template, the resulting DECL will have no name for the
9306 first parameter, and the wrong type for the second. So, when we go
9307 to instantiate the DECL, we regenerate it. */
9310 regenerate_decl_from_template (decl
, tmpl
)
9320 args
= DECL_TI_ARGS (decl
);
9321 code_pattern
= DECL_TEMPLATE_RESULT (tmpl
);
9323 /* Unregister the specialization so that when we tsubst we will not
9324 just return DECL. We don't have to unregister DECL from TMPL
9325 because if would only be registered there if it were a partial
9326 instantiation of a specialization, which it isn't: it's a full
9328 gen_tmpl
= most_general_template (tmpl
);
9329 unregistered
= unregister_specialization (decl
, gen_tmpl
);
9331 /* If the DECL was not unregistered then something peculiar is
9332 happening: we created a specialization but did not call
9333 register_specialization for it. */
9334 my_friendly_assert (unregistered
, 0);
9336 if (TREE_CODE (decl
) == VAR_DECL
)
9337 /* Make sure that we can see identifiers, and compute access
9338 correctly, for the class members used in the declaration of
9339 this static variable. */
9340 pushclass (DECL_CONTEXT (decl
), 2);
9342 /* Do the substitution to get the new declaration. */
9343 new_decl
= tsubst (code_pattern
, args
, /*complain=*/1, NULL_TREE
);
9345 if (TREE_CODE (decl
) == VAR_DECL
)
9347 /* Set up DECL_INITIAL, since tsubst doesn't. */
9348 DECL_INITIAL (new_decl
) =
9349 tsubst_expr (DECL_INITIAL (code_pattern
), args
,
9350 /*complain=*/1, DECL_TI_TEMPLATE (decl
));
9351 /* Pop the class context we pushed above. */
9354 else if (TREE_CODE (decl
) == FUNCTION_DECL
)
9356 /* Convince duplicate_decls to use the DECL_ARGUMENTS from the
9358 DECL_INITIAL (new_decl
) = error_mark_node
;
9359 /* And don't complain about a duplicate definition. */
9360 DECL_INITIAL (decl
) = NULL_TREE
;
9363 /* The immediate parent of the new template is still whatever it was
9364 before, even though tsubst sets DECL_TI_TEMPLATE up as the most
9365 general template. We also reset the DECL_ASSEMBLER_NAME since
9366 tsubst always calculates the name as if the function in question
9367 were really a template instance, and sometimes, with friend
9368 functions, this is not so. See tsubst_friend_function for
9370 DECL_TI_TEMPLATE (new_decl
) = DECL_TI_TEMPLATE (decl
);
9371 DECL_ASSEMBLER_NAME (new_decl
) = DECL_ASSEMBLER_NAME (decl
);
9372 DECL_RTL (new_decl
) = DECL_RTL (decl
);
9374 /* Call duplicate decls to merge the old and new declarations. */
9375 duplicate_decls (new_decl
, decl
);
9377 /* Now, re-register the specialization. */
9378 register_specialization (decl
, gen_tmpl
, args
);
9381 /* Produce the definition of D, a _DECL generated from a template. */
9384 instantiate_decl (d
)
9387 tree tmpl
= DECL_TI_TEMPLATE (d
);
9388 tree args
= DECL_TI_ARGS (d
);
9393 int nested
= in_function_p ();
9394 int pattern_defined
;
9396 char *file
= input_filename
;
9397 tree old_fn
= current_function_decl
;
9399 /* This function should only be used to instantiate templates for
9400 functions and static member variables. */
9401 my_friendly_assert (TREE_CODE (d
) == FUNCTION_DECL
9402 || TREE_CODE (d
) == VAR_DECL
, 0);
9404 if (DECL_TEMPLATE_INSTANTIATED (d
))
9405 /* D has already been instantiated. It might seem reasonable to
9406 check whether or not D is an explict instantiation, and, if so,
9407 stop here. But when an explicit instantiation is deferred
9408 until the end of the compilation, DECL_EXPLICIT_INSTANTIATION
9409 is set, even though we still need to do the instantiation. */
9412 /* If we already have a specialization of this declaration, then
9413 there's no reason to instantiate it. Note that
9414 retrieve_specialization gives us both instantiations and
9415 specializations, so we must explicitly check
9416 DECL_TEMPLATE_SPECIALIZATION. */
9417 gen_tmpl
= most_general_template (tmpl
);
9418 spec
= retrieve_specialization (gen_tmpl
, args
);
9419 if (spec
!= NULL_TREE
&& DECL_TEMPLATE_SPECIALIZATION (spec
))
9422 /* This needs to happen before any tsubsting. */
9423 if (! push_tinst_level (d
))
9426 /* Set TD to the template whose DECL_TEMPLATE_RESULT is the pattern
9427 for the instantiation. This is not always the most general
9428 template. Consider, for example:
9431 struct S { template <class U> void f();
9432 template <> void f<int>(); };
9434 and an instantiation of S<double>::f<int>. We want TD to be the
9435 specialization S<T>::f<int>, not the more general S<T>::f<U>. */
9438 /* An instantiation cannot have a definition, so we need a
9439 more general template. */
9440 DECL_TEMPLATE_INSTANTIATION (td
)
9441 /* We must also deal with friend templates. Given:
9443 template <class T> struct S {
9444 template <class U> friend void f() {};
9447 S<int>::f<U> say, is not an instantiation of S<T>::f<U>,
9448 so far as the language is concerned, but that's still
9449 where we get the pattern for the instantiation from. On
9450 ther hand, if the definition comes outside the class, say:
9452 template <class T> struct S {
9453 template <class U> friend void f();
9455 template <class U> friend void f() {}
9457 we don't need to look any further. That's what the check for
9458 DECL_INITIAL is for. */
9459 || (TREE_CODE (d
) == FUNCTION_DECL
9460 && DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (td
)
9461 && !DECL_INITIAL (DECL_TEMPLATE_RESULT (td
)));
9464 /* The present template, TD, should not be a definition. If it
9465 were a definition, we should be using it! Note that we
9466 cannot restructure the loop to just keep going until we find
9467 a template with a definition, since that might go too far if
9468 a specialization was declared, but not defined. */
9469 my_friendly_assert (!(TREE_CODE (d
) == VAR_DECL
9470 && !DECL_IN_AGGR_P (DECL_TEMPLATE_RESULT (td
))),
9473 /* Fetch the more general template. */
9474 td
= DECL_TI_TEMPLATE (td
);
9477 code_pattern
= DECL_TEMPLATE_RESULT (td
);
9479 if (TREE_CODE (d
) == FUNCTION_DECL
)
9480 pattern_defined
= (DECL_SAVED_TREE (code_pattern
) != NULL_TREE
);
9482 pattern_defined
= ! DECL_IN_AGGR_P (code_pattern
);
9484 push_to_top_level ();
9485 lineno
= DECL_SOURCE_LINE (d
);
9486 input_filename
= DECL_SOURCE_FILE (d
);
9488 if (pattern_defined
)
9490 repo_template_used (d
);
9492 if (flag_external_templates
&& ! DECL_INTERFACE_KNOWN (d
))
9494 if (flag_alt_external_templates
)
9496 if (interface_unknown
)
9497 warn_if_unknown_interface (d
);
9499 else if (DECL_INTERFACE_KNOWN (code_pattern
))
9501 DECL_INTERFACE_KNOWN (d
) = 1;
9502 DECL_NOT_REALLY_EXTERN (d
) = ! DECL_EXTERNAL (code_pattern
);
9505 warn_if_unknown_interface (code_pattern
);
9509 import_export_decl (d
);
9512 /* Reject all external templates except inline functions. */
9513 if (DECL_INTERFACE_KNOWN (d
)
9514 && ! DECL_NOT_REALLY_EXTERN (d
)
9515 && ! (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_INLINE (d
)))
9518 if (TREE_CODE (d
) == VAR_DECL
9519 && TREE_READONLY (d
)
9520 && DECL_INITIAL (d
) == NULL_TREE
9521 && DECL_INITIAL (code_pattern
) != NULL_TREE
)
9522 /* We need to set up DECL_INITIAL regardless of pattern_defined if
9523 the variable is a static const initialized in the class body. */;
9524 else if (pattern_defined
&& nested
9525 && TREE_CODE (d
) == FUNCTION_DECL
&& DECL_INLINE (d
))
9526 /* An inline function used in another function; instantiate it now so
9527 we can inline it. */;
9528 else if (! pattern_defined
|| ! at_eof
)
9530 /* Defer all other templates. We restore the source position
9531 here because it's used by add_pending_template. */
9533 input_filename
= file
;
9535 if (at_eof
&& !pattern_defined
9536 && DECL_EXPLICIT_INSTANTIATION (d
))
9539 The definition of a non-exported function template, a
9540 non-exported member function template, or a non-exported
9541 member function or static data member of a class template
9542 shall be present in every translation unit in which it is
9543 explicitly instantiated. */
9544 cp_error ("explicit instantiation of `%D' but no definition available",
9547 add_pending_template (d
);
9551 /* If this instantiation is COMDAT, we don't know whether or not we
9552 will really need to write it out. If we can't be sure, mark it
9553 DECL_DEFER_OUTPUT. NOTE: This increases memory consumption,
9554 since we keep some instantiations in memory rather than write
9555 them out immediately and forget them. A better approach would be
9556 to wait until we know we need them to do the instantiation, but
9557 that would break templates with static locals, because we
9558 generate the functions to destroy statics before we determine
9559 which functions are needed. A better solution would be to
9560 generate the ctor and dtor functions as we go. */
9562 if (TREE_CODE (d
) == FUNCTION_DECL
9564 && ! DECL_NEEDED_P (d
)
9565 /* If the function that caused us to be instantiated is needed, we
9566 will be needed, too. */
9567 && (! nested
|| (old_fn
&& ! DECL_NEEDED_P (old_fn
))))
9568 DECL_DEFER_OUTPUT (d
) = 1;
9570 /* We're now committed to instantiating this template. Mark it as
9571 instantiated so that recursive calls to instantiate_decl do not
9572 try to instantiate it again. */
9573 DECL_TEMPLATE_INSTANTIATED (d
) = 1;
9575 /* Regenerate the declaration in case the template has been modified
9576 by a subsequent redeclaration. */
9577 regenerate_decl_from_template (d
, td
);
9579 /* We already set the file and line above. Reset them now in case
9580 they changed as a result of calling regenerate_decl_from_template. */
9581 lineno
= DECL_SOURCE_LINE (d
);
9582 input_filename
= DECL_SOURCE_FILE (d
);
9584 if (TREE_CODE (d
) == VAR_DECL
)
9586 DECL_IN_AGGR_P (d
) = 0;
9587 if (DECL_INTERFACE_KNOWN (d
))
9588 DECL_EXTERNAL (d
) = ! DECL_NOT_REALLY_EXTERN (d
);
9591 DECL_EXTERNAL (d
) = 1;
9592 DECL_NOT_REALLY_EXTERN (d
) = 1;
9594 cp_finish_decl (d
, DECL_INITIAL (d
), NULL_TREE
, 0);
9596 else if (TREE_CODE (d
) == FUNCTION_DECL
)
9598 /* Set up context. */
9599 start_function (NULL_TREE
, d
, NULL_TREE
, SF_PRE_PARSED
);
9600 store_parm_decls ();
9602 /* We already set up __FUNCTION__, etc., so we don't want to do
9604 current_function_name_declared
= 1;
9606 /* Substitute into the body of the function. */
9607 tsubst_expr (DECL_SAVED_TREE (code_pattern
), args
,
9608 /*complain=*/1, tmpl
);
9610 /* Finish the function. */
9611 expand_body (finish_function (lineno
, 0));
9616 input_filename
= file
;
9618 pop_from_top_level ();
9624 /* Run through the list of templates that we wish we could
9625 instantiate, and instantiate any we can. */
9628 instantiate_pending_templates ()
9631 int instantiated_something
= 0;
9638 t
= &pending_templates
;
9641 tree srcloc
= TREE_PURPOSE (*t
);
9642 tree instantiation
= TREE_VALUE (*t
);
9644 input_filename
= SRCLOC_FILE (srcloc
);
9645 lineno
= SRCLOC_LINE (srcloc
);
9647 if (TREE_CODE_CLASS (TREE_CODE (instantiation
)) == 't')
9651 if (!TYPE_SIZE (instantiation
))
9653 instantiate_class_template (instantiation
);
9654 if (CLASSTYPE_TEMPLATE_INSTANTIATION (instantiation
))
9655 for (fn
= TYPE_METHODS (instantiation
);
9657 fn
= TREE_CHAIN (fn
))
9658 if (! DECL_ARTIFICIAL (fn
))
9659 instantiate_decl (fn
);
9660 if (TYPE_SIZE (instantiation
))
9662 instantiated_something
= 1;
9667 if (TYPE_SIZE (instantiation
))
9668 /* If INSTANTIATION has been instantiated, then we don't
9669 need to consider it again in the future. */
9670 *t
= TREE_CHAIN (*t
);
9672 t
= &TREE_CHAIN (*t
);
9676 if (DECL_TEMPLATE_INSTANTIATION (instantiation
)
9677 && !DECL_TEMPLATE_INSTANTIATED (instantiation
))
9679 instantiation
= instantiate_decl (instantiation
);
9680 if (DECL_TEMPLATE_INSTANTIATED (instantiation
))
9682 instantiated_something
= 1;
9687 if (!DECL_TEMPLATE_INSTANTIATION (instantiation
)
9688 || DECL_TEMPLATE_INSTANTIATED (instantiation
))
9689 /* If INSTANTIATION has been instantiated, then we don't
9690 need to consider it again in the future. */
9691 *t
= TREE_CHAIN (*t
);
9693 t
= &TREE_CHAIN (*t
);
9698 /* Go through the things that are template instantiations if we are
9699 using guiding declarations. */
9700 t
= &maybe_templates
;
9707 fn
= TREE_VALUE (*t
);
9709 if (DECL_INITIAL (fn
))
9710 /* If the FN is already defined, then it was either already
9711 instantiated or, even though guiding declarations were
9712 allowed, a non-template definition was provided. */
9716 template = TREE_PURPOSE (*t
);
9717 args
= get_bindings (template, fn
, NULL_TREE
);
9718 fn
= instantiate_template (template, args
);
9719 instantiate_decl (fn
);
9723 /* Remove this entry from the chain. */
9724 *t
= TREE_CHAIN (*t
);
9726 maybe_template_tail
= t
;
9730 return instantiated_something
;
9733 /* Substitute ARGVEC into T, which is a TREE_LIST. In particular, it
9734 is an initializer list: the TREE_PURPOSEs are DECLs, and the
9735 TREE_VALUEs are initializer values. Used by instantiate_decl. */
9738 tsubst_expr_values (t
, argvec
)
9741 tree first
= NULL_TREE
;
9744 for (; t
; t
= TREE_CHAIN (t
))
9746 tree pur
= tsubst_copy (TREE_PURPOSE (t
), argvec
,
9747 /*complain=*/1, NULL_TREE
);
9748 tree val
= tsubst_expr (TREE_VALUE (t
), argvec
, /*complain=*/1,
9750 *p
= build_tree_list (pur
, val
);
9751 p
= &TREE_CHAIN (*p
);
9756 /* D is an undefined function declaration in the presence of templates with
9757 the same name, listed in FNS. If one of them can produce D as an
9758 instantiation, remember this so we can instantiate it at EOF if D has
9759 not been defined by that time. */
9762 add_maybe_template (d
, fns
)
9767 if (DECL_MAYBE_TEMPLATE (d
))
9770 t
= most_specialized (fns
, d
, NULL_TREE
);
9773 if (t
== error_mark_node
)
9775 cp_error ("ambiguous template instantiation for `%D'", d
);
9779 *maybe_template_tail
= tree_cons (t
, d
, NULL_TREE
);
9780 maybe_template_tail
= &TREE_CHAIN (*maybe_template_tail
);
9781 DECL_MAYBE_TEMPLATE (d
) = 1;
9784 /* Set CURRENT_ACCESS_SPECIFIER based on the protection of DECL. */
9787 set_current_access_from_decl (decl
)
9790 if (TREE_PRIVATE (decl
))
9791 current_access_specifier
= access_private_node
;
9792 else if (TREE_PROTECTED (decl
))
9793 current_access_specifier
= access_protected_node
;
9795 current_access_specifier
= access_public_node
;
9798 /* Instantiate an enumerated type. TAG is the template type, NEWTAG
9799 is the instantiation (which should have been created with
9800 start_enum) and ARGS are the template arguments to use. */
9803 tsubst_enum (tag
, newtag
, args
)
9810 for (e
= TYPE_VALUES (tag
); e
; e
= TREE_CHAIN (e
))
9814 /* Note that in a template enum, the TREE_VALUE is the
9815 CONST_DECL, not the corresponding INTEGER_CST. */
9816 value
= tsubst_expr (DECL_INITIAL (TREE_VALUE (e
)),
9817 args
, /*complain=*/1,
9820 /* Give this enumeration constant the correct access. */
9821 set_current_access_from_decl (TREE_VALUE (e
));
9823 /* Actually build the enumerator itself. */
9824 build_enumerator (TREE_PURPOSE (e
), value
, newtag
);
9827 finish_enum (newtag
);
9830 /* Set the DECL_ASSEMBLER_NAME for DECL, which is a FUNCTION_DECL that
9831 is either an instantiation or specialization of a template
9835 set_mangled_name_for_template_decl (decl
)
9838 tree saved_namespace
;
9839 tree context
= NULL_TREE
;
9848 my_friendly_assert (TREE_CODE (decl
) == FUNCTION_DECL
, 0);
9849 my_friendly_assert (DECL_TEMPLATE_INFO (decl
) != NULL_TREE
, 0);
9851 /* The names of template functions must be mangled so as to indicate
9852 what template is being specialized with what template arguments.
9853 For example, each of the following three functions must get
9854 different mangled names:
9857 template <> void f<7>(int);
9858 template <> void f<8>(int); */
9860 targs
= DECL_TI_ARGS (decl
);
9861 if (uses_template_parms (targs
))
9862 /* This DECL is for a partial instantiation. There's no need to
9863 mangle the name of such an entity. */
9866 tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
9867 tparms
= DECL_TEMPLATE_PARMS (tmpl
);
9868 parm_depth
= TMPL_PARMS_DEPTH (tparms
);
9870 /* There should be as many levels of arguments as there are levels
9872 my_friendly_assert (parm_depth
== TMPL_ARGS_DEPTH (targs
), 0);
9874 /* We now compute the PARMS and RET_TYPE to give to
9875 build_decl_overload_real. The PARMS and RET_TYPE are the
9876 parameter and return types of the template, after all but the
9877 innermost template arguments have been substituted, not the
9878 parameter and return types of the function DECL. For example,
9881 template <class T> T f(T);
9883 both PARMS and RET_TYPE should be `T' even if DECL is `int f(int)'.
9884 A more subtle example is:
9886 template <class T> struct S { template <class U> void f(T, U); }
9888 Here, if DECL is `void S<int>::f(int, double)', PARMS should be
9889 {int, U}. Thus, the args that we want to subsitute into the
9890 return and parameter type for the function are those in TARGS,
9891 with the innermost level omitted. */
9892 fn_type
= TREE_TYPE (tmpl
);
9893 if (DECL_STATIC_FUNCTION_P (decl
))
9894 context
= DECL_CLASS_CONTEXT (decl
);
9896 if (parm_depth
== 1)
9897 /* No substitution is necessary. */
9904 /* Replace the innermost level of the TARGS with NULL_TREEs to
9905 let tsubst know not to subsitute for those parameters. */
9906 partial_args
= make_tree_vec (TREE_VEC_LENGTH (targs
));
9907 for (i
= 1; i
< TMPL_ARGS_DEPTH (targs
); ++i
)
9908 SET_TMPL_ARGS_LEVEL (partial_args
, i
,
9909 TMPL_ARGS_LEVEL (targs
, i
));
9910 SET_TMPL_ARGS_LEVEL (partial_args
,
9911 TMPL_ARGS_DEPTH (targs
),
9912 make_tree_vec (DECL_NTPARMS (tmpl
)));
9914 /* Now, do the (partial) substitution to figure out the
9915 appropriate function type. */
9916 fn_type
= tsubst (fn_type
, partial_args
, /*complain=*/1, NULL_TREE
);
9917 if (DECL_STATIC_FUNCTION_P (decl
))
9918 context
= tsubst (context
, partial_args
, /*complain=*/1, NULL_TREE
);
9920 /* Substitute into the template parameters to obtain the real
9921 innermost set of parameters. This step is important if the
9922 innermost set of template parameters contains value
9923 parameters whose types depend on outer template parameters. */
9924 TREE_VEC_LENGTH (partial_args
)--;
9925 tparms
= tsubst_template_parms (tparms
, partial_args
, /*complain=*/1);
9928 /* Now, get the innermost parameters and arguments, and figure out
9929 the parameter and return types. */
9930 tparms
= INNERMOST_TEMPLATE_PARMS (tparms
);
9931 targs
= innermost_args (targs
);
9932 ret_type
= TREE_TYPE (fn_type
);
9933 parm_types
= TYPE_ARG_TYPES (fn_type
);
9935 /* For a static member function, we generate a fake `this' pointer,
9936 for the purposes of mangling. This indicates of which class the
9937 function is a member. Because of:
9941 There shall not be a static and a nonstatic member function
9942 with the same name and the same parameter types
9944 we don't have to worry that this will result in a clash with a
9945 non-static member function. */
9946 if (DECL_STATIC_FUNCTION_P (decl
))
9947 parm_types
= hash_tree_chain (build_pointer_type (context
), parm_types
);
9949 /* There should be the same number of template parameters as
9950 template arguments. */
9951 my_friendly_assert (TREE_VEC_LENGTH (tparms
) == TREE_VEC_LENGTH (targs
),
9954 /* If the template is in a namespace, we need to put that into the
9955 mangled name. Unfortunately, build_decl_overload_real does not
9956 get the decl to mangle, so it relies on the current
9957 namespace. Therefore, we set that here temporarily. */
9958 my_friendly_assert (TREE_CODE_CLASS (TREE_CODE (decl
)) == 'd', 980702);
9959 saved_namespace
= current_namespace
;
9960 current_namespace
= CP_DECL_CONTEXT (decl
);
9962 /* Actually set the DCL_ASSEMBLER_NAME. */
9963 DECL_ASSEMBLER_NAME (decl
)
9964 = build_decl_overload_real (DECL_NAME (decl
), parm_types
, ret_type
,
9966 DECL_FUNCTION_MEMBER_P (decl
)
9967 + DECL_CONSTRUCTOR_P (decl
));
9969 /* Restore the previously active namespace. */
9970 current_namespace
= saved_namespace
;