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 (TREE_CODE_CLASS (TREE_CODE (arg
)) != 't'
5125 && !uses_template_parms (arg
))
5127 /* Sometimes, one of the args was an expression involving a
5128 template constant parameter, like N - 1. Now that we've
5129 tsubst'd, we might have something like 2 - 1. This will
5130 confuse lookup_template_class, so we do constant folding
5131 here. We have to unset processing_template_decl, to
5132 fool build_expr_from_tree() into building an actual
5135 int saved_processing_template_decl
= processing_template_decl
;
5136 processing_template_decl
= 0;
5137 arg
= fold (build_expr_from_tree (arg
));
5138 processing_template_decl
= saved_processing_template_decl
;
5143 /* Return the TREE_VEC with the arguments for the innermost template header,
5144 where ARGS is either that or the VEC of VECs for all the
5148 innermost_args (args
)
5151 return TMPL_ARGS_LEVEL (args
, TMPL_ARGS_DEPTH (args
));
5154 /* Substitute ARGS into the vector of template arguments T. */
5157 tsubst_template_arg_vector (t
, args
, complain
)
5162 int len
= TREE_VEC_LENGTH (t
), need_new
= 0, i
;
5163 tree
*elts
= (tree
*) alloca (len
* sizeof (tree
));
5165 bzero ((char *) elts
, len
* sizeof (tree
));
5167 for (i
= 0; i
< len
; i
++)
5169 if (TREE_VEC_ELT (t
, i
) != NULL_TREE
5170 && TREE_CODE (TREE_VEC_ELT (t
, i
)) == TREE_VEC
)
5171 elts
[i
] = tsubst_template_arg_vector (TREE_VEC_ELT (t
, i
),
5174 elts
[i
] = maybe_fold_nontype_arg
5175 (tsubst_expr (TREE_VEC_ELT (t
, i
), args
, complain
,
5178 if (elts
[i
] != TREE_VEC_ELT (t
, i
))
5185 t
= make_tree_vec (len
);
5186 for (i
= 0; i
< len
; i
++)
5187 TREE_VEC_ELT (t
, i
) = elts
[i
];
5192 /* Return the result of substituting ARGS into the template parameters
5193 given by PARMS. If there are m levels of ARGS and m + n levels of
5194 PARMS, then the result will contain n levels of PARMS. For
5195 example, if PARMS is `template <class T> template <class U>
5196 template <T*, U, class V>' and ARGS is {{int}, {double}} then the
5197 result will be `template <int*, double, class V>'. */
5200 tsubst_template_parms (parms
, args
, complain
)
5208 for (new_parms
= &r
;
5209 TMPL_PARMS_DEPTH (parms
) > TMPL_ARGS_DEPTH (args
);
5210 new_parms
= &(TREE_CHAIN (*new_parms
)),
5211 parms
= TREE_CHAIN (parms
))
5214 make_tree_vec (TREE_VEC_LENGTH (TREE_VALUE (parms
)));
5217 for (i
= 0; i
< TREE_VEC_LENGTH (new_vec
); ++i
)
5219 tree default_value
=
5220 TREE_PURPOSE (TREE_VEC_ELT (TREE_VALUE (parms
), i
));
5222 TREE_VALUE (TREE_VEC_ELT (TREE_VALUE (parms
), i
));
5224 TREE_VEC_ELT (new_vec
, i
)
5225 = build_tree_list (tsubst (default_value
, args
, complain
,
5227 tsubst (parm_decl
, args
, complain
,
5232 tree_cons (build_int_2 (0, (TMPL_PARMS_DEPTH (parms
)
5233 - TMPL_ARGS_DEPTH (args
))),
5234 new_vec
, NULL_TREE
);
5240 /* Substitute the ARGS into the indicated aggregate (or enumeration)
5241 type T. If T is not an aggregate or enumeration type, it is
5242 handled as if by tsubst. IN_DECL is as for tsubst. If
5243 ENTERING_SCOPE is non-zero, T is the context for a template which
5244 we are presently tsubst'ing. Return the subsituted value. */
5247 tsubst_aggr_type (t
, args
, complain
, in_decl
, entering_scope
)
5257 switch (TREE_CODE (t
))
5260 if (TYPE_PTRMEMFUNC_P (t
))
5262 tree r
= build_ptrmemfunc_type
5263 (tsubst (TYPE_PTRMEMFUNC_FN_TYPE (t
), args
, complain
, in_decl
));
5264 return cp_build_qualified_type_real (r
, TYPE_QUALS (t
),
5268 /* else fall through */
5271 if (TYPE_TEMPLATE_INFO (t
))
5277 /* First, determine the context for the type we are looking
5279 if (TYPE_CONTEXT (t
) != NULL_TREE
)
5280 context
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
,
5282 in_decl
, /*entering_scope=*/1);
5284 context
= NULL_TREE
;
5286 /* Then, figure out what arguments are appropriate for the
5287 type we are trying to find. For example, given:
5289 template <class T> struct S;
5290 template <class T, class U> void f(T, U) { S<U> su; }
5292 and supposing that we are instantiating f<int, double>,
5293 then our ARGS will be {int, double}, but, when looking up
5294 S we only want {double}. */
5295 argvec
= tsubst_template_arg_vector (TYPE_TI_ARGS (t
), args
,
5298 r
= lookup_template_class (t
, argvec
, in_decl
, context
,
5301 return cp_build_qualified_type_real (r
, TYPE_QUALS (t
),
5305 /* This is not a template type, so there's nothing to do. */
5309 return tsubst (t
, args
, complain
, in_decl
);
5313 /* Substitute into the default argument ARG (a default argument for
5314 FN), which has the indicated TYPE. */
5317 tsubst_default_argument (fn
, type
, arg
)
5322 /* This default argument came from a template. Instantiate the
5323 default argument here, not in tsubst. In the case of
5332 we must be careful to do name lookup in the scope of S<T>,
5333 rather than in the current class. */
5334 if (DECL_CLASS_SCOPE_P (fn
))
5335 pushclass (DECL_REAL_CONTEXT (fn
), 2);
5337 arg
= tsubst_expr (arg
, DECL_TI_ARGS (fn
), /*complain=*/1, NULL_TREE
);
5339 if (DECL_CLASS_SCOPE_P (fn
))
5342 /* Make sure the default argument is reasonable. */
5343 arg
= check_default_argument (type
, arg
);
5348 /* Substitute into all the default arguments for FN. */
5351 tsubst_default_arguments (fn
)
5357 tmpl_args
= DECL_TI_ARGS (fn
);
5359 /* If this function is not yet instantiated, we certainly don't need
5360 its default arguments. */
5361 if (uses_template_parms (tmpl_args
))
5364 for (arg
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
5366 arg
= TREE_CHAIN (arg
))
5367 if (TREE_PURPOSE (arg
))
5368 TREE_PURPOSE (arg
) = tsubst_default_argument (fn
,
5370 TREE_PURPOSE (arg
));
5373 /* Substitute the ARGS into the T, which is a _DECL. TYPE is the
5374 (already computed) substitution of ARGS into TREE_TYPE (T), if
5375 appropriate. Return the result of the substitution. IN_DECL is as
5379 tsubst_decl (t
, args
, type
, in_decl
)
5386 char* saved_filename
;
5389 /* Set the filename and linenumber to improve error-reporting. */
5390 saved_lineno
= lineno
;
5391 saved_filename
= input_filename
;
5392 lineno
= DECL_SOURCE_LINE (t
);
5393 input_filename
= DECL_SOURCE_FILE (t
);
5395 switch (TREE_CODE (t
))
5399 /* We can get here when processing a member template function
5400 of a template class. */
5401 tree decl
= DECL_TEMPLATE_RESULT (t
);
5403 int is_template_template_parm
= DECL_TEMPLATE_TEMPLATE_PARM_P (t
);
5405 if (!is_template_template_parm
)
5407 /* We might already have an instance of this template.
5408 The ARGS are for the surrounding class type, so the
5409 full args contain the tsubst'd args for the context,
5410 plus the innermost args from the template decl. */
5411 tree tmpl_args
= DECL_CLASS_TEMPLATE_P (t
)
5412 ? CLASSTYPE_TI_ARGS (TREE_TYPE (t
))
5413 : DECL_TI_ARGS (DECL_RESULT (t
));
5416 full_args
= tsubst_template_arg_vector (tmpl_args
, args
,
5419 /* tsubst_template_arg_vector doesn't copy the vector if
5420 nothing changed. But, *something* should have
5422 my_friendly_assert (full_args
!= tmpl_args
, 0);
5424 spec
= retrieve_specialization (t
, full_args
);
5425 if (spec
!= NULL_TREE
)
5432 /* Make a new template decl. It will be similar to the
5433 original, but will record the current template arguments.
5434 We also create a new function declaration, which is just
5435 like the old one, but points to this new template, rather
5436 than the old one. */
5439 my_friendly_assert (DECL_LANG_SPECIFIC (r
) != 0, 0);
5440 TREE_CHAIN (r
) = NULL_TREE
;
5442 if (is_template_template_parm
)
5444 tree new_decl
= tsubst (decl
, args
, /*complain=*/1, in_decl
);
5445 DECL_RESULT (r
) = new_decl
;
5446 TREE_TYPE (r
) = TREE_TYPE (new_decl
);
5451 = tsubst_aggr_type (DECL_CONTEXT (t
), args
, /*complain=*/1,
5452 in_decl
, /*entering_scope=*/1);
5453 DECL_CLASS_CONTEXT (r
)
5454 = tsubst_aggr_type (DECL_CLASS_CONTEXT (t
), args
,
5455 /*complain=*/1, in_decl
,
5456 /*entering_scope=*/1);
5457 DECL_TEMPLATE_INFO (r
) = build_tree_list (t
, args
);
5459 if (TREE_CODE (decl
) == TYPE_DECL
)
5461 tree new_type
= tsubst (TREE_TYPE (t
), args
,
5462 /*complain=*/1, in_decl
);
5463 TREE_TYPE (r
) = new_type
;
5464 CLASSTYPE_TI_TEMPLATE (new_type
) = r
;
5465 DECL_RESULT (r
) = TYPE_MAIN_DECL (new_type
);
5466 DECL_TI_ARGS (r
) = CLASSTYPE_TI_ARGS (new_type
);
5470 tree new_decl
= tsubst (decl
, args
, /*complain=*/1, in_decl
);
5471 DECL_RESULT (r
) = new_decl
;
5472 DECL_TI_TEMPLATE (new_decl
) = r
;
5473 TREE_TYPE (r
) = TREE_TYPE (new_decl
);
5474 DECL_TI_ARGS (r
) = DECL_TI_ARGS (new_decl
);
5477 SET_DECL_IMPLICIT_INSTANTIATION (r
);
5478 DECL_TEMPLATE_INSTANTIATIONS (r
) = NULL_TREE
;
5479 DECL_TEMPLATE_SPECIALIZATIONS (r
) = NULL_TREE
;
5481 /* The template parameters for this new template are all the
5482 template parameters for the old template, except the
5483 outermost level of parameters. */
5484 DECL_TEMPLATE_PARMS (r
)
5485 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t
), args
,
5488 if (PRIMARY_TEMPLATE_P (t
))
5489 DECL_PRIMARY_TEMPLATE (r
) = r
;
5491 /* We don't partially instantiate partial specializations. */
5492 if (TREE_CODE (decl
) == TYPE_DECL
)
5495 for (spec
= DECL_TEMPLATE_SPECIALIZATIONS (t
);
5497 spec
= TREE_CHAIN (spec
))
5499 /* It helps to consider example here. Consider:
5510 Now, for example, we are instantiating S<int>::f(U u).
5511 We want to make a template:
5516 It will have a specialization, for the case U = int*, of
5520 void S<int>::f<int*>(int*);
5522 This specialization will be an instantiation of
5523 the specialization given in the declaration of S, with
5524 argument list int*. */
5526 tree fn
= TREE_VALUE (spec
);
5530 if (!DECL_TEMPLATE_SPECIALIZATION (fn
))
5531 /* Instantiations are on the same list, but they're of
5532 no concern to us. */
5535 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
5536 /* A full specialization. There's no need to record
5540 spec_args
= tsubst (DECL_TI_ARGS (fn
), args
,
5541 /*complain=*/1, in_decl
);
5542 new_fn
= tsubst (DECL_RESULT (most_general_template (fn
)),
5543 spec_args
, /*complain=*/1, in_decl
);
5544 DECL_TI_TEMPLATE (new_fn
) = fn
;
5545 register_specialization (new_fn
, r
,
5546 innermost_args (spec_args
));
5549 /* Record this partial instantiation. */
5550 register_specialization (r
, t
,
5551 DECL_TI_ARGS (DECL_RESULT (r
)));
5559 tree argvec
= NULL_TREE
;
5566 /* Nobody should be tsubst'ing into non-template functions. */
5567 my_friendly_assert (DECL_TEMPLATE_INFO (t
) != NULL_TREE
, 0);
5569 if (TREE_CODE (DECL_TI_TEMPLATE (t
)) == TEMPLATE_DECL
)
5573 /* Calculate the most general template of which R is a
5574 specialization, and the complete set of arguments used to
5576 gen_tmpl
= most_general_template (DECL_TI_TEMPLATE (t
));
5578 = tsubst_template_arg_vector (DECL_TI_ARGS
5579 (DECL_TEMPLATE_RESULT (gen_tmpl
)),
5580 args
, /*complain=*/1);
5582 /* Check to see if we already have this specialization. */
5583 spec
= retrieve_specialization (gen_tmpl
, argvec
);
5591 /* Here, we deal with the peculiar case:
5593 template <class T> struct S {
5594 template <class U> friend void f();
5596 template <class U> friend void f() {}
5598 template void f<double>();
5600 Here, the ARGS for the instantiation of will be {int,
5601 double}. But, we only need as many ARGS as there are
5602 levels of template parameters in CODE_PATTERN. We are
5603 careful not to get fooled into reducing the ARGS in
5606 template <class T> struct S { template <class U> void f(U); }
5607 template <class T> template <> void S<T>::f(int) {}
5609 which we can spot because the pattern will be a
5610 specialization in this case. */
5611 args_depth
= TMPL_ARGS_DEPTH (args
);
5613 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (t
)));
5614 if (args_depth
> parms_depth
5615 && !DECL_TEMPLATE_SPECIALIZATION (t
))
5617 my_friendly_assert (DECL_FRIEND_P (t
), 0);
5619 if (parms_depth
> 1)
5623 args
= make_tree_vec (parms_depth
);
5624 for (i
= 0; i
< parms_depth
; ++i
)
5625 TREE_VEC_ELT (args
, i
) =
5626 TREE_VEC_ELT (args
, i
+ (args_depth
- parms_depth
));
5629 args
= TREE_VEC_ELT (args
, args_depth
- parms_depth
);
5634 /* This special case arises when we have something like this:
5636 template <class T> struct S {
5637 friend void f<int>(int, double);
5640 Here, the DECL_TI_TEMPLATE for the friend declaration
5641 will be a LOOKUP_EXPR or an IDENTIFIER_NODE. We are
5642 being called from tsubst_friend_function, and we want
5643 only to create a new decl (R) with appropriate types so
5644 that we can call determine_specialization. */
5645 my_friendly_assert ((TREE_CODE (DECL_TI_TEMPLATE (t
))
5647 || (TREE_CODE (DECL_TI_TEMPLATE (t
))
5648 == IDENTIFIER_NODE
), 0);
5649 gen_tmpl
= NULL_TREE
;
5652 if (DECL_CLASS_SCOPE_P (t
))
5654 if (DECL_NAME (t
) == constructor_name (DECL_CONTEXT (t
)))
5658 ctx
= tsubst_aggr_type (DECL_CLASS_CONTEXT (t
), args
,
5660 /*entering_scope=*/1);
5667 type
= tsubst (type
, args
, /*complain=*/1, in_decl
);
5668 if (type
== error_mark_node
)
5669 return error_mark_node
;
5671 /* We do NOT check for matching decls pushed separately at this
5672 point, as they may not represent instantiations of this
5673 template, and in any case are considered separate under the
5674 discrete model. Instead, see add_maybe_template. */
5678 DECL_USE_TEMPLATE (r
) = 0;
5679 TREE_TYPE (r
) = type
;
5682 = tsubst_aggr_type (DECL_CONTEXT (t
), args
, /*complain=*/1, t
,
5683 /*entering_scope=*/1);
5684 DECL_CLASS_CONTEXT (r
) = ctx
;
5686 if (member
&& IDENTIFIER_TYPENAME_P (DECL_NAME (r
)))
5687 /* Type-conversion operator. Reconstruct the name, in
5688 case it's the name of one of the template's parameters. */
5689 DECL_NAME (r
) = build_typename_overload (TREE_TYPE (type
));
5691 DECL_ARGUMENTS (r
) = tsubst (DECL_ARGUMENTS (t
), args
,
5693 DECL_MAIN_VARIANT (r
) = r
;
5694 DECL_RESULT (r
) = NULL_TREE
;
5696 TREE_STATIC (r
) = 0;
5697 TREE_PUBLIC (r
) = TREE_PUBLIC (t
);
5698 DECL_EXTERNAL (r
) = 1;
5699 DECL_INTERFACE_KNOWN (r
) = 0;
5700 DECL_DEFER_OUTPUT (r
) = 0;
5701 TREE_CHAIN (r
) = NULL_TREE
;
5702 DECL_PENDING_INLINE_INFO (r
) = 0;
5703 DECL_PENDING_INLINE_P (r
) = 0;
5706 /* Set up the DECL_TEMPLATE_INFO for R and compute its mangled
5707 name. There's no need to do this in the special friend
5708 case mentioned above where GEN_TMPL is NULL. */
5711 DECL_TEMPLATE_INFO (r
)
5712 = tree_cons (gen_tmpl
, argvec
, NULL_TREE
);
5713 SET_DECL_IMPLICIT_INSTANTIATION (r
);
5714 register_specialization (r
, gen_tmpl
, argvec
);
5716 /* Set the mangled name for R. */
5717 if (DECL_DESTRUCTOR_P (t
))
5718 DECL_ASSEMBLER_NAME (r
) = build_destructor_name (ctx
);
5721 /* Instantiations of template functions must be mangled
5722 specially, in order to conform to 14.5.5.1
5723 [temp.over.link]. */
5724 tree tmpl
= DECL_TI_TEMPLATE (t
);
5726 /* TMPL will be NULL if this is a specialization of a
5727 member function of a template class. */
5728 if (name_mangling_version
< 1
5729 || tmpl
== NULL_TREE
5730 || (member
&& !is_member_template (tmpl
)
5731 && !DECL_TEMPLATE_INFO (tmpl
)))
5732 set_mangled_name_for_decl (r
);
5734 set_mangled_name_for_template_decl (r
);
5738 make_decl_rtl (r
, NULL_PTR
, 1);
5740 /* Like grokfndecl. If we don't do this, pushdecl will
5741 mess up our TREE_CHAIN because it doesn't find a
5742 previous decl. Sigh. */
5744 && ! uses_template_parms (r
)
5745 && (IDENTIFIER_GLOBAL_VALUE (DECL_ASSEMBLER_NAME (r
))
5747 SET_IDENTIFIER_GLOBAL_VALUE (DECL_ASSEMBLER_NAME (r
), r
);
5749 /* We're not supposed to instantiate default arguments
5750 until they are called, for a template. But, for a
5753 template <class T> void f ()
5754 { extern void g(int i = T()); }
5756 we should do the substitution when the template is
5757 instantiated. We handle the member function case in
5758 instantiate_class_template since the default arguments
5759 might refer to other members of the class. */
5761 && !PRIMARY_TEMPLATE_P (gen_tmpl
)
5762 && !uses_template_parms (argvec
))
5763 tsubst_default_arguments (r
);
5766 /* Copy the list of befriending classes. */
5767 for (friends
= &DECL_BEFRIENDING_CLASSES (r
);
5769 friends
= &TREE_CHAIN (*friends
))
5771 *friends
= copy_node (*friends
);
5772 TREE_VALUE (*friends
) = tsubst (TREE_VALUE (*friends
),
5773 args
, /*complain=*/1,
5777 if (DECL_CONSTRUCTOR_P (r
))
5779 maybe_retrofit_in_chrg (r
);
5780 grok_ctor_properties (ctx
, r
);
5782 else if (DECL_OVERLOADED_OPERATOR_P (r
))
5783 grok_op_properties (r
, DECL_VIRTUAL_P (r
), DECL_FRIEND_P (r
));
5790 TREE_TYPE (r
) = type
;
5791 c_apply_type_quals_to_decl (CP_TYPE_QUALS (type
), r
);
5793 if (TREE_CODE (DECL_INITIAL (r
)) != TEMPLATE_PARM_INDEX
)
5794 DECL_INITIAL (r
) = TREE_TYPE (r
);
5796 DECL_INITIAL (r
) = tsubst (DECL_INITIAL (r
), args
,
5797 /*complain=*/1, in_decl
);
5799 DECL_CONTEXT (r
) = NULL_TREE
;
5800 if (PROMOTE_PROTOTYPES
5801 && (TREE_CODE (type
) == INTEGER_TYPE
5802 || TREE_CODE (type
) == ENUMERAL_TYPE
)
5803 && TYPE_PRECISION (type
) < TYPE_PRECISION (integer_type_node
))
5804 DECL_ARG_TYPE (r
) = integer_type_node
;
5806 TREE_CHAIN (r
) = tsubst (TREE_CHAIN (t
), args
,
5807 /*complain=*/1, TREE_CHAIN (t
));
5815 TREE_TYPE (r
) = type
;
5816 c_apply_type_quals_to_decl (CP_TYPE_QUALS (type
), r
);
5818 /* We don't have to set DECL_CONTEXT here; it is set by
5819 finish_member_declaration. */
5820 DECL_INITIAL (r
) = tsubst_expr (DECL_INITIAL (t
), args
,
5821 /*complain=*/1, in_decl
);
5822 TREE_CHAIN (r
) = NULL_TREE
;
5823 if (TREE_CODE (type
) == VOID_TYPE
)
5824 cp_error_at ("instantiation of `%D' as type void", r
);
5832 = tsubst_copy (DECL_INITIAL (t
), args
, /*complain=*/1, in_decl
);
5833 TREE_CHAIN (r
) = NULL_TREE
;
5838 if (DECL_IMPLICIT_TYPEDEF_P (t
))
5840 /* For an implicit typedef, we just want the implicit
5841 typedef for the tsubst'd type. We've already got the
5842 tsubst'd type, as TYPE, so we just need it's associated
5844 r
= TYPE_NAME (type
);
5847 else if (!DECL_LANG_SPECIFIC (t
))
5849 /* For a template type parameter, we don't have to do
5850 anything special. */
5851 r
= TYPE_NAME (type
);
5865 /* Nobody should be tsubst'ing into non-template variables. */
5866 my_friendly_assert (DECL_LANG_SPECIFIC (t
)
5867 && DECL_TEMPLATE_INFO (t
) != NULL_TREE
, 0);
5869 if (TYPE_P (CP_DECL_CONTEXT (t
)))
5870 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
,
5872 in_decl
, /*entering_scope=*/1);
5874 /* Subsequent calls to pushdecl will fill this in. */
5877 /* Check to see if we already have this specialization. */
5878 tmpl
= DECL_TI_TEMPLATE (t
);
5879 gen_tmpl
= most_general_template (tmpl
);
5880 argvec
= tsubst (DECL_TI_ARGS (t
), args
, /*complain=*/1, in_decl
);
5882 spec
= retrieve_specialization (gen_tmpl
, argvec
);
5884 spec
= retrieve_local_specialization (gen_tmpl
,
5885 current_function_decl
);
5893 /* This declaration is going to have to be around for a while,
5894 so me make sure it is on a saveable obstack. */
5897 TREE_TYPE (r
) = type
;
5898 c_apply_type_quals_to_decl (CP_TYPE_QUALS (type
), r
);
5899 DECL_CONTEXT (r
) = ctx
;
5901 /* Don't try to expand the initializer until someone tries to use
5902 this variable; otherwise we run into circular dependencies. */
5903 DECL_INITIAL (r
) = NULL_TREE
;
5907 DECL_CLASS_CONTEXT (r
) = DECL_CONTEXT (r
);
5909 /* For __PRETTY_FUNCTION__ we have to adjust the initializer. */
5910 if (DECL_PRETTY_FUNCTION_P (r
))
5912 DECL_INITIAL (r
) = tsubst (DECL_INITIAL (t
),
5916 TREE_TYPE (r
) = TREE_TYPE (DECL_INITIAL (r
));
5919 /* If the template variable was marked TREE_ASM_WRITTEN, that
5920 means we don't need to write out any of the instantiations
5921 either. (__FUNCTION__ and its ilk are marked thusly.) */
5922 TREE_ASM_WRITTEN (r
) = TREE_ASM_WRITTEN (t
);
5924 /* Even if the original location is out of scope, the newly
5925 substituted one is not. */
5926 if (TREE_CODE (r
) == VAR_DECL
)
5927 DECL_DEAD_FOR_LOCAL (r
) = 0;
5929 /* A static data member declaration is always marked external
5930 when it is declared in-class, even if an initializer is
5931 present. We mimic the non-template processing here. */
5933 DECL_EXTERNAL (r
) = 1;
5935 DECL_TEMPLATE_INFO (r
) = tree_cons (tmpl
, argvec
, NULL_TREE
);
5936 SET_DECL_IMPLICIT_INSTANTIATION (r
);
5938 register_specialization (r
, gen_tmpl
, argvec
);
5940 register_local_specialization (r
, gen_tmpl
,
5941 current_function_decl
);
5943 TREE_CHAIN (r
) = NULL_TREE
;
5944 if (TREE_CODE (r
) == VAR_DECL
&& TREE_CODE (type
) == VOID_TYPE
)
5945 cp_error_at ("instantiation of `%D' as type void", r
);
5950 my_friendly_abort (0);
5953 /* Restore the file and line information. */
5954 lineno
= saved_lineno
;
5955 input_filename
= saved_filename
;
5960 /* Substitue into the ARG_TYPES of a function type. */
5963 tsubst_arg_types (arg_types
, args
, complain
, in_decl
)
5969 tree remaining_arg_types
;
5972 if (!arg_types
|| arg_types
== void_list_node
)
5975 remaining_arg_types
= tsubst_arg_types (TREE_CHAIN (arg_types
),
5976 args
, complain
, in_decl
);
5977 if (remaining_arg_types
== error_mark_node
)
5978 return error_mark_node
;
5980 type
= tsubst (TREE_VALUE (arg_types
), args
, complain
, in_decl
);
5981 if (type
== error_mark_node
)
5982 return error_mark_node
;
5984 /* Do array-to-pointer, function-to-pointer conversion, and ignore
5985 top-level qualifiers as required. */
5986 type
= TYPE_MAIN_VARIANT (type_decays_to (type
));
5988 /* Note that we do not substitute into default arguments here. The
5989 standard mandates that they be instantiated only when needed,
5990 which is done in build_over_call. */
5991 return hash_tree_cons (TREE_PURPOSE (arg_types
), type
,
5992 remaining_arg_types
);
5996 /* Substitute into a FUNCTION_TYPE or METHOD_TYPE. This routine does
5997 *not* handle the exception-specification for FNTYPE, because the
5998 initial substitution of explicitly provided template parameters
5999 during argument deduction forbids substitution into the
6000 exception-specification:
6004 All references in the function type of the function template to the
6005 corresponding template parameters are replaced by the specified tem-
6006 plate argument values. If a substitution in a template parameter or
6007 in the function type of the function template results in an invalid
6008 type, type deduction fails. [Note: The equivalent substitution in
6009 exception specifications is done only when the function is instanti-
6010 ated, at which point a program is ill-formed if the substitution
6011 results in an invalid type.] */
6014 tsubst_function_type (t
, args
, complain
, in_decl
)
6024 /* The TYPE_CONTEXT is not used for function/method types. */
6025 my_friendly_assert (TYPE_CONTEXT (t
) == NULL_TREE
, 0);
6027 /* Substitue the return type. */
6028 return_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
6029 if (return_type
== error_mark_node
)
6030 return error_mark_node
;
6032 /* Substitue the argument types. */
6033 arg_types
= tsubst_arg_types (TYPE_ARG_TYPES (t
), args
,
6035 if (arg_types
== error_mark_node
)
6036 return error_mark_node
;
6038 /* Construct a new type node and return it. */
6039 if (TREE_CODE (t
) == FUNCTION_TYPE
)
6040 fntype
= build_function_type (return_type
, arg_types
);
6043 tree r
= TREE_TYPE (TREE_VALUE (arg_types
));
6044 if (! IS_AGGR_TYPE (r
))
6048 Type deduction may fail for any of the following
6051 -- Attempting to create "pointer to member of T" when T
6052 is not a class type. */
6054 cp_error ("creating pointer to member function of non-class type `%T'",
6056 return error_mark_node
;
6059 fntype
= build_cplus_method_type (r
, return_type
, TREE_CHAIN
6062 fntype
= build_qualified_type (fntype
, TYPE_QUALS (t
));
6063 fntype
= build_type_attribute_variant (fntype
, TYPE_ATTRIBUTES (t
));
6068 /* Substitute into the PARMS of a call-declarator. */
6071 tsubst_call_declarator_parms (parms
, args
, complain
, in_decl
)
6081 if (!parms
|| parms
== void_list_node
)
6084 new_parms
= tsubst_call_declarator_parms (TREE_CHAIN (parms
),
6085 args
, complain
, in_decl
);
6087 /* Figure out the type of this parameter. */
6088 type
= tsubst (TREE_VALUE (parms
), args
, complain
, in_decl
);
6090 /* Figure out the default argument as well. Note that we use
6091 tsubst_expr since the default argument is really an expression. */
6092 defarg
= tsubst_expr (TREE_PURPOSE (parms
), args
, complain
, in_decl
);
6094 /* Chain this parameter on to the front of those we have already
6095 processed. We don't use hash_tree_cons because that function
6096 doesn't check TREE_PARMLIST. */
6097 new_parms
= tree_cons (defarg
, type
, new_parms
);
6099 /* And note that these are parameters. */
6100 TREE_PARMLIST (new_parms
) = 1;
6105 /* Take the tree structure T and replace template parameters used
6106 therein with the argument vector ARGS. IN_DECL is an associated
6107 decl for diagnostics. If an error occurs, returns ERROR_MARK_NODE.
6108 An appropriate error message is issued only if COMPLAIN is
6109 non-zero. Note that we must be relatively non-tolerant of
6110 extensions here, in order to preserve conformance; if we allow
6111 substitutions that should not be allowed, we may allow argument
6112 deductions that should not succeed, and therefore report ambiguous
6113 overload situations where there are none. In theory, we could
6114 allow the substitution, but indicate that it should have failed,
6115 and allow our caller to make sure that the right thing happens, but
6116 we don't try to do this yet.
6118 This function is used for dealing with types, decls and the like;
6119 for expressions, use tsubst_expr or tsubst_copy. */
6122 tsubst (t
, args
, complain
, in_decl
)
6129 if (t
== NULL_TREE
|| t
== error_mark_node
6130 || t
== integer_type_node
6131 || t
== void_type_node
6132 || t
== char_type_node
6133 || TREE_CODE (t
) == NAMESPACE_DECL
)
6136 if (TREE_CODE (t
) == IDENTIFIER_NODE
)
6137 type
= IDENTIFIER_TYPE_VALUE (t
);
6139 type
= TREE_TYPE (t
);
6140 if (type
== unknown_type_node
)
6141 my_friendly_abort (42);
6143 if (type
&& TREE_CODE (t
) != FUNCTION_DECL
6144 && TREE_CODE (t
) != TYPENAME_TYPE
6145 && TREE_CODE (t
) != TEMPLATE_DECL
6146 && TREE_CODE (t
) != IDENTIFIER_NODE
6147 && TREE_CODE (t
) != FUNCTION_TYPE
6148 && TREE_CODE (t
) != METHOD_TYPE
)
6149 type
= tsubst (type
, args
, complain
, in_decl
);
6150 if (type
== error_mark_node
)
6151 return error_mark_node
;
6153 if (TREE_CODE_CLASS (TREE_CODE (t
)) == 'd')
6154 return tsubst_decl (t
, args
, type
, in_decl
);
6156 switch (TREE_CODE (t
))
6161 return tsubst_aggr_type (t
, args
, complain
, in_decl
,
6162 /*entering_scope=*/0);
6165 case IDENTIFIER_NODE
:
6177 if (t
== integer_type_node
)
6180 if (TREE_CODE (TYPE_MIN_VALUE (t
)) == INTEGER_CST
6181 && TREE_CODE (TYPE_MAX_VALUE (t
)) == INTEGER_CST
)
6185 tree max
, omax
= TREE_OPERAND (TYPE_MAX_VALUE (t
), 0);
6187 max
= tsubst_expr (omax
, args
, complain
, in_decl
);
6188 if (max
== error_mark_node
)
6189 return error_mark_node
;
6191 /* See if we can reduce this expression to something simpler. */
6192 max
= maybe_fold_nontype_arg (max
);
6193 if (!processing_template_decl
&& TREE_READONLY_DECL_P (max
))
6194 max
= decl_constant_value (max
);
6196 if (processing_template_decl
6197 /* When providing explicit arguments to a template
6198 function, but leaving some arguments for subsequent
6199 deduction, MAX may be template-dependent even if we're
6200 not PROCESSING_TEMPLATE_DECL. We still need to check for
6201 template parms, though; MAX won't be an INTEGER_CST for
6202 dynamic arrays, either. */
6203 || (TREE_CODE (max
) != INTEGER_CST
6204 && uses_template_parms (max
)))
6206 tree itype
= make_node (INTEGER_TYPE
);
6207 TYPE_MIN_VALUE (itype
) = size_zero_node
;
6208 TYPE_MAX_VALUE (itype
) = build_min (MINUS_EXPR
, sizetype
, max
,
6213 if (integer_zerop (omax
))
6215 /* Still allow an explicit array of size zero. */
6217 pedwarn ("creating array with size zero");
6219 else if (integer_zerop (max
)
6220 || (TREE_CODE (max
) == INTEGER_CST
6221 && INT_CST_LT (max
, integer_zero_node
)))
6225 Type deduction may fail for any of the following
6228 Attempting to create an array with a size that is
6229 zero or negative. */
6231 cp_error ("creating array with size zero (`%E')", max
);
6233 return error_mark_node
;
6236 return compute_array_index_type (NULL_TREE
, max
);
6239 case TEMPLATE_TYPE_PARM
:
6240 case TEMPLATE_TEMPLATE_PARM
:
6241 case TEMPLATE_PARM_INDEX
:
6249 if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
6250 || TREE_CODE (t
) == TEMPLATE_TEMPLATE_PARM
)
6252 idx
= TEMPLATE_TYPE_IDX (t
);
6253 level
= TEMPLATE_TYPE_LEVEL (t
);
6257 idx
= TEMPLATE_PARM_IDX (t
);
6258 level
= TEMPLATE_PARM_LEVEL (t
);
6261 if (TREE_VEC_LENGTH (args
) > 0)
6263 tree arg
= NULL_TREE
;
6265 levels
= TMPL_ARGS_DEPTH (args
);
6266 if (level
<= levels
)
6267 arg
= TMPL_ARG (args
, level
, idx
);
6269 if (arg
== error_mark_node
)
6270 return error_mark_node
;
6271 else if (arg
!= NULL_TREE
)
6273 if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
6275 my_friendly_assert (TREE_CODE_CLASS (TREE_CODE (arg
))
6277 return cp_build_qualified_type_real
6278 (arg
, CP_TYPE_QUALS (arg
) | CP_TYPE_QUALS (t
),
6281 else if (TREE_CODE (t
) == TEMPLATE_TEMPLATE_PARM
)
6283 if (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t
))
6285 /* We are processing a type constructed from
6286 a template template parameter */
6287 tree argvec
= tsubst (TYPE_TI_ARGS (t
),
6288 args
, complain
, in_decl
);
6289 if (argvec
== error_mark_node
)
6290 return error_mark_node
;
6292 /* We can get a TEMPLATE_TEMPLATE_PARM here when
6293 we are resolving nested-types in the signature of
6294 a member function templates.
6295 Otherwise ARG is a TEMPLATE_DECL and is the real
6296 template to be instantiated. */
6297 if (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
6298 arg
= TYPE_NAME (arg
);
6300 r
= lookup_template_class (DECL_NAME (arg
),
6303 /*entering_scope=*/0);
6304 return cp_build_qualified_type_real (r
,
6309 /* We are processing a template argument list. */
6317 my_friendly_abort (981018);
6320 /* This can happen during the attempted tsubst'ing in
6321 unify. This means that we don't yet have any information
6322 about the template parameter in question. */
6325 /* If we get here, we must have been looking at a parm for a
6326 more deeply nested template. Make a new version of this
6327 template parameter, but with a lower level. */
6328 switch (TREE_CODE (t
))
6330 case TEMPLATE_TYPE_PARM
:
6331 case TEMPLATE_TEMPLATE_PARM
:
6333 TEMPLATE_TYPE_PARM_INDEX (r
)
6334 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (t
),
6336 TYPE_STUB_DECL (r
) = TYPE_NAME (r
) = TEMPLATE_TYPE_DECL (r
);
6337 TYPE_MAIN_VARIANT (r
) = r
;
6338 TYPE_POINTER_TO (r
) = NULL_TREE
;
6339 TYPE_REFERENCE_TO (r
) = NULL_TREE
;
6341 if (TREE_CODE (t
) == TEMPLATE_TEMPLATE_PARM
6342 && TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t
))
6344 tree argvec
= tsubst (TYPE_TI_ARGS (t
), args
,
6346 if (argvec
== error_mark_node
)
6347 return error_mark_node
;
6349 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (r
)
6350 = tree_cons (TYPE_NAME (t
), argvec
, NULL_TREE
);
6354 case TEMPLATE_PARM_INDEX
:
6355 r
= reduce_template_parm_level (t
, type
, levels
);
6359 my_friendly_abort (0);
6367 tree purpose
, value
, chain
, result
;
6369 if (t
== void_list_node
)
6372 purpose
= TREE_PURPOSE (t
);
6375 purpose
= tsubst (purpose
, args
, complain
, in_decl
);
6376 if (purpose
== error_mark_node
)
6377 return error_mark_node
;
6379 value
= TREE_VALUE (t
);
6382 value
= tsubst (value
, args
, complain
, in_decl
);
6383 if (value
== error_mark_node
)
6384 return error_mark_node
;
6386 chain
= TREE_CHAIN (t
);
6387 if (chain
&& chain
!= void_type_node
)
6389 chain
= tsubst (chain
, args
, complain
, in_decl
);
6390 if (chain
== error_mark_node
)
6391 return error_mark_node
;
6393 if (purpose
== TREE_PURPOSE (t
)
6394 && value
== TREE_VALUE (t
)
6395 && chain
== TREE_CHAIN (t
))
6397 result
= hash_tree_cons (purpose
, value
, chain
);
6398 TREE_PARMLIST (result
) = TREE_PARMLIST (t
);
6402 if (type
!= NULL_TREE
)
6404 /* A binfo node. We always need to make a copy, of the node
6405 itself and of its BINFO_BASETYPES. */
6409 /* Make sure type isn't a typedef copy. */
6410 type
= BINFO_TYPE (TYPE_BINFO (type
));
6412 TREE_TYPE (t
) = complete_type (type
);
6413 if (IS_AGGR_TYPE (type
))
6415 BINFO_VTABLE (t
) = TYPE_BINFO_VTABLE (type
);
6416 BINFO_VIRTUALS (t
) = TYPE_BINFO_VIRTUALS (type
);
6417 if (TYPE_BINFO_BASETYPES (type
) != NULL_TREE
)
6418 BINFO_BASETYPES (t
) = copy_node (TYPE_BINFO_BASETYPES (type
));
6423 /* Otherwise, a vector of template arguments. */
6424 return tsubst_template_arg_vector (t
, args
, complain
);
6427 case REFERENCE_TYPE
:
6429 enum tree_code code
;
6431 if (type
== TREE_TYPE (t
))
6434 code
= TREE_CODE (t
);
6439 Type deduction may fail for any of the following
6442 -- Attempting to create a pointer to reference type.
6443 -- Attempting to create a reference to a reference type or
6444 a reference to void. */
6445 if (TREE_CODE (type
) == REFERENCE_TYPE
6446 || (code
== REFERENCE_TYPE
&& TREE_CODE (type
) == VOID_TYPE
))
6448 static int last_line
= 0;
6449 static char* last_file
= 0;
6451 /* We keep track of the last time we issued this error
6452 message to avoid spewing a ton of messages during a
6453 single bad template instantiation. */
6454 if (complain
&& (last_line
!= lineno
||
6455 last_file
!= input_filename
))
6457 if (TREE_CODE (type
) == VOID_TYPE
)
6458 cp_error ("forming reference to void");
6460 cp_error ("forming %s to reference type `%T'",
6461 (code
== POINTER_TYPE
) ? "pointer" : "reference",
6464 last_file
= input_filename
;
6467 return error_mark_node
;
6469 else if (code
== POINTER_TYPE
)
6470 r
= build_pointer_type (type
);
6472 r
= build_reference_type (type
);
6473 r
= cp_build_qualified_type_real (r
, TYPE_QUALS (t
), complain
);
6475 /* Will this ever be needed for TYPE_..._TO values? */
6481 r
= tsubst (TYPE_OFFSET_BASETYPE (t
), args
, complain
, in_decl
);
6482 if (r
== error_mark_node
|| !IS_AGGR_TYPE (r
))
6486 Type deduction may fail for any of the following
6489 -- Attempting to create "pointer to member of T" when T
6490 is not a class type. */
6492 cp_error ("creating pointer to member of non-class type `%T'",
6494 return error_mark_node
;
6496 return build_offset_type (r
, type
);
6504 fntype
= tsubst_function_type (t
, args
, complain
, in_decl
);
6505 if (fntype
== error_mark_node
)
6506 return error_mark_node
;
6508 /* Substitue the exception specification. */
6509 raises
= TYPE_RAISES_EXCEPTIONS (t
);
6512 tree list
= NULL_TREE
;
6514 if (! TREE_VALUE (raises
))
6517 for (; raises
!= NULL_TREE
; raises
= TREE_CHAIN (raises
))
6519 tree spec
= TREE_VALUE (raises
);
6521 spec
= tsubst (spec
, args
, complain
, in_decl
);
6522 if (spec
== error_mark_node
)
6524 list
= add_exception_specifier (list
, spec
, complain
);
6526 fntype
= build_exception_variant (fntype
, list
);
6532 tree domain
= tsubst (TYPE_DOMAIN (t
), args
, complain
, in_decl
);
6533 if (domain
== error_mark_node
)
6534 return error_mark_node
;
6536 /* As an optimization, we avoid regenerating the array type if
6537 it will obviously be the same as T. */
6538 if (type
== TREE_TYPE (t
) && domain
== TYPE_DOMAIN (t
))
6541 /* These checks should match the ones in grokdeclarator.
6545 The deduction may fail for any of the following reasons:
6547 -- Attempting to create an array with an element type that
6548 is void, a function type, or a reference type. */
6549 if (TREE_CODE (type
) == VOID_TYPE
6550 || TREE_CODE (type
) == FUNCTION_TYPE
6551 || TREE_CODE (type
) == REFERENCE_TYPE
)
6554 cp_error ("creating array of `%T'", type
);
6555 return error_mark_node
;
6558 r
= build_cplus_array_type (type
, domain
);
6565 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6567 tree e2
= tsubst (TREE_OPERAND (t
, 1), args
, complain
,
6570 if (e1
== error_mark_node
|| e2
== error_mark_node
)
6571 return error_mark_node
;
6573 return fold (build (TREE_CODE (t
), TREE_TYPE (t
), e1
, e2
));
6579 tree e
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6581 if (e
== error_mark_node
)
6582 return error_mark_node
;
6584 return fold (build (TREE_CODE (t
), TREE_TYPE (t
), e
));
6589 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
6590 in_decl
, /*entering_scope=*/1);
6591 tree f
= tsubst_copy (TYPENAME_TYPE_FULLNAME (t
), args
,
6594 if (ctx
== error_mark_node
|| f
== error_mark_node
)
6595 return error_mark_node
;
6597 if (!IS_AGGR_TYPE (ctx
))
6600 cp_error ("`%T' is not a class, struct, or union type",
6602 return error_mark_node
;
6604 else if (!uses_template_parms (ctx
) && !TYPE_BEING_DEFINED (ctx
))
6606 /* Normally, make_typename_type does not require that the CTX
6607 have complete type in order to allow things like:
6609 template <class T> struct S { typename S<T>::X Y; };
6611 But, such constructs have already been resolved by this
6612 point, so here CTX really should have complete type, unless
6613 it's a partial instantiation. */
6614 ctx
= complete_type (ctx
);
6615 if (!TYPE_SIZE (ctx
))
6618 incomplete_type_error (NULL_TREE
, ctx
);
6619 return error_mark_node
;
6623 f
= make_typename_type (ctx
, f
, complain
);
6624 if (f
== error_mark_node
)
6626 return cp_build_qualified_type_real (f
,
6628 | CP_TYPE_QUALS (t
),
6634 tree e
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6636 if (e
== error_mark_node
)
6637 return error_mark_node
;
6638 return make_pointer_declarator (type
, e
);
6643 tree e
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6645 if (e
== error_mark_node
)
6646 return error_mark_node
;
6647 return make_reference_declarator (type
, e
);
6652 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6654 tree e2
= tsubst_expr (TREE_OPERAND (t
, 1), args
, complain
,
6656 if (e1
== error_mark_node
|| e2
== error_mark_node
)
6657 return error_mark_node
;
6659 return build_parse_node (ARRAY_REF
, e1
, e2
, tsubst_expr
);
6664 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6666 tree e2
= (tsubst_call_declarator_parms
6667 (CALL_DECLARATOR_PARMS (t
), args
, complain
, in_decl
));
6668 tree e3
= tsubst (CALL_DECLARATOR_EXCEPTION_SPEC (t
), args
,
6671 if (e1
== error_mark_node
|| e2
== error_mark_node
6672 || e3
== error_mark_node
)
6673 return error_mark_node
;
6675 return make_call_declarator (e1
, e2
, CALL_DECLARATOR_QUALS (t
), e3
);
6680 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6682 tree e2
= tsubst (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
6683 if (e1
== error_mark_node
|| e2
== error_mark_node
)
6684 return error_mark_node
;
6686 return build_parse_node (TREE_CODE (t
), e1
, e2
);
6691 tree e1
= tsubst_expr (TYPE_FIELDS (t
), args
, complain
,
6693 if (e1
== error_mark_node
)
6694 return error_mark_node
;
6696 return TREE_TYPE (e1
);
6706 /* This code should match declare_hidden_char_array in
6708 name
= (*decl_printable_name
) (current_function_decl
, 2);
6709 len
= strlen (name
) + 1;
6710 type
= build_array_type (char_type_node
,
6711 build_index_type (build_int_2 (len
, 0)));
6712 str
= build_string (len
, name
);
6713 TREE_TYPE (str
) = type
;
6718 sorry ("use of `%s' in template",
6719 tree_code_name
[(int) TREE_CODE (t
)]);
6720 return error_mark_node
;
6724 /* Like tsubst, but deals with expressions. This function just replaces
6725 template parms; to finish processing the resultant expression, use
6729 tsubst_copy (t
, args
, complain
, in_decl
)
6734 enum tree_code code
;
6737 if (t
== NULL_TREE
|| t
== error_mark_node
)
6740 code
= TREE_CODE (t
);
6745 return do_identifier (DECL_NAME (t
), 0, NULL_TREE
);
6752 if (!DECL_CONTEXT (t
))
6753 /* This is a global enumeration constant. */
6756 /* Unfortunately, we cannot just call lookup_name here.
6759 template <int I> int f() {
6761 struct S { void g() { E e = a; } };
6764 When we instantiate f<7>::S::g(), say, lookup_name is not
6765 clever enough to find f<7>::a. */
6767 = tsubst_aggr_type (TREE_TYPE (t
), args
, complain
, in_decl
,
6768 /*entering_scope=*/0);
6770 for (v
= TYPE_VALUES (enum_type
);
6773 if (TREE_PURPOSE (v
) == DECL_NAME (t
))
6774 return TREE_VALUE (v
);
6776 /* We didn't find the name. That should never happen; if
6777 name-lookup found it during preliminary parsing, we
6778 should find it again here during instantiation. */
6779 my_friendly_abort (0);
6784 if (DECL_CONTEXT (t
))
6788 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
6789 /*entering_scope=*/1);
6790 if (ctx
!= DECL_CONTEXT (t
))
6791 return lookup_field (ctx
, DECL_NAME (t
), 0, 0);
6797 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
))
6798 t
= tsubst (t
, args
, complain
, in_decl
);
6803 if (is_member_template (t
))
6804 return tsubst (t
, args
, complain
, in_decl
);
6810 /* We must tsbust into a LOOKUP_EXPR in case the names to
6811 which it refers is a conversion operator; in that case the
6812 name will change. We avoid making unnecessary copies,
6815 tree id
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
6817 if (id
!= TREE_OPERAND (t
, 0))
6819 r
= build_nt (LOOKUP_EXPR
, id
);
6820 LOOKUP_EXPR_GLOBAL (r
) = LOOKUP_EXPR_GLOBAL (t
);
6828 case REINTERPRET_CAST_EXPR
:
6829 case CONST_CAST_EXPR
:
6830 case STATIC_CAST_EXPR
:
6831 case DYNAMIC_CAST_EXPR
:
6834 (code
, tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
6835 tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
));
6838 case PREDECREMENT_EXPR
:
6839 case PREINCREMENT_EXPR
:
6840 case POSTDECREMENT_EXPR
:
6841 case POSTINCREMENT_EXPR
:
6843 case TRUTH_NOT_EXPR
:
6846 case CONVERT_EXPR
: /* Unary + */
6855 (code
, tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
6856 tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
));
6861 case TRUNC_DIV_EXPR
:
6863 case FLOOR_DIV_EXPR
:
6864 case ROUND_DIV_EXPR
:
6865 case EXACT_DIV_EXPR
:
6867 case BIT_ANDTC_EXPR
:
6870 case TRUNC_MOD_EXPR
:
6871 case FLOOR_MOD_EXPR
:
6872 case TRUTH_ANDIF_EXPR
:
6873 case TRUTH_ORIF_EXPR
:
6874 case TRUTH_AND_EXPR
:
6895 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
6896 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
));
6900 tree fn
= TREE_OPERAND (t
, 0);
6901 if (is_overloaded_fn (fn
))
6902 fn
= tsubst_copy (get_first_fn (fn
), args
, complain
, in_decl
);
6904 /* Sometimes FN is a LOOKUP_EXPR. */
6905 fn
= tsubst_copy (fn
, args
, complain
, in_decl
);
6907 (code
, fn
, tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
,
6912 case METHOD_CALL_EXPR
:
6914 tree name
= TREE_OPERAND (t
, 0);
6915 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
6917 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
6919 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
6921 else if (TREE_CODE (name
) == SCOPE_REF
6922 && TREE_CODE (TREE_OPERAND (name
, 1)) == BIT_NOT_EXPR
)
6924 tree base
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
6926 name
= TREE_OPERAND (name
, 1);
6927 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
6929 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
6930 name
= build_nt (SCOPE_REF
, base
, name
);
6933 name
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
6935 (code
, name
, tsubst_copy (TREE_OPERAND (t
, 1), args
,
6937 tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
),
6942 /* This processing should really occur in tsubst_expr, However,
6943 tsubst_expr does not recurse into expressions, since it
6944 assumes that there aren't any statements inside them.
6945 Instead, it simply calls build_expr_from_tree. So, we need
6946 to expand the STMT_EXPR here. */
6947 if (!processing_template_decl
)
6949 tree stmt_expr
= begin_stmt_expr ();
6950 tsubst_expr (STMT_EXPR_STMT (t
), args
,
6952 return finish_stmt_expr (stmt_expr
);
6959 case PSEUDO_DTOR_EXPR
:
6962 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
6963 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
),
6964 tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
));
6971 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
6972 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
),
6973 tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
));
6974 NEW_EXPR_USE_GLOBAL (r
) = NEW_EXPR_USE_GLOBAL (t
);
6981 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
6982 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
));
6983 DELETE_EXPR_USE_GLOBAL (r
) = DELETE_EXPR_USE_GLOBAL (t
);
6984 DELETE_EXPR_USE_VEC (r
) = DELETE_EXPR_USE_VEC (t
);
6988 case TEMPLATE_ID_EXPR
:
6990 /* Substituted template arguments */
6991 tree targs
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
,
6994 if (targs
&& TREE_CODE (targs
) == TREE_LIST
)
6997 for (chain
= targs
; chain
; chain
= TREE_CHAIN (chain
))
6998 TREE_VALUE (chain
) = maybe_fold_nontype_arg (TREE_VALUE (chain
));
7003 for (i
= 0; i
< TREE_VEC_LENGTH (targs
); ++i
)
7004 TREE_VEC_ELT (targs
, i
)
7005 = maybe_fold_nontype_arg (TREE_VEC_ELT (targs
, i
));
7008 return lookup_template_function
7009 (tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
), targs
);
7014 tree purpose
, value
, chain
;
7016 if (t
== void_list_node
)
7019 purpose
= TREE_PURPOSE (t
);
7021 purpose
= tsubst_copy (purpose
, args
, complain
, in_decl
);
7022 value
= TREE_VALUE (t
);
7024 value
= tsubst_copy (value
, args
, complain
, in_decl
);
7025 chain
= TREE_CHAIN (t
);
7026 if (chain
&& chain
!= void_type_node
)
7027 chain
= tsubst_copy (chain
, args
, complain
, in_decl
);
7028 if (purpose
== TREE_PURPOSE (t
)
7029 && value
== TREE_VALUE (t
)
7030 && chain
== TREE_CHAIN (t
))
7032 return tree_cons (purpose
, value
, chain
);
7039 case TEMPLATE_TYPE_PARM
:
7040 case TEMPLATE_TEMPLATE_PARM
:
7041 case TEMPLATE_PARM_INDEX
:
7043 case REFERENCE_TYPE
:
7050 return tsubst (t
, args
, complain
, in_decl
);
7052 case IDENTIFIER_NODE
:
7053 if (IDENTIFIER_TYPENAME_P (t
)
7054 /* Make sure it's not just a variable named `__opr', for instance,
7055 which can occur in some existing code. */
7057 return build_typename_overload
7058 (tsubst (TREE_TYPE (t
), args
, complain
, in_decl
));
7065 (CONSTRUCTOR
, tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
7066 NULL_TREE
, tsubst_copy (CONSTRUCTOR_ELTS (t
), args
,
7067 complain
, in_decl
));
7068 TREE_HAS_CONSTRUCTOR (r
) = TREE_HAS_CONSTRUCTOR (t
);
7073 return build_va_arg (tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
,
7075 tsubst (TREE_TYPE (t
), args
, complain
, in_decl
));
7078 return tsubst (t
, args
, complain
, in_decl
);
7085 /* Like tsubst_copy, but also does semantic processing. */
7088 tsubst_expr (t
, args
, complain
, in_decl
)
7095 if (t
== NULL_TREE
|| t
== error_mark_node
)
7098 if (processing_template_decl
)
7099 return tsubst_copy (t
, args
, complain
, in_decl
);
7101 switch (TREE_CODE (t
))
7105 finish_named_return_value
7106 (TREE_OPERAND (t
, 0),
7107 tsubst_expr (TREE_OPERAND (t
, 1), args
, /*complain=*/1, in_decl
));
7108 tsubst_expr (TREE_CHAIN (t
), args
, complain
, in_decl
);
7111 case CTOR_INITIALIZER
:
7113 current_member_init_list
7114 = tsubst_expr_values (TREE_OPERAND (t
, 0), args
);
7115 current_base_init_list
7116 = tsubst_expr_values (TREE_OPERAND (t
, 1), args
);
7118 tsubst_expr (TREE_CHAIN (t
), args
, complain
, in_decl
);
7123 finish_return_stmt (tsubst_expr (RETURN_EXPR (t
),
7124 args
, complain
, in_decl
));
7129 finish_expr_stmt (tsubst_expr (EXPR_STMT_EXPR (t
),
7130 args
, complain
, in_decl
));
7139 decl
= DECL_STMT_DECL (t
);
7140 if (TREE_CODE (decl
) == LABEL_DECL
)
7141 finish_label_decl (DECL_NAME (decl
));
7144 init
= DECL_INITIAL (decl
);
7145 decl
= tsubst (decl
, args
, complain
, in_decl
);
7146 init
= tsubst_expr (init
, args
, complain
, in_decl
);
7148 DECL_INITIAL (decl
) = error_mark_node
;
7149 /* By marking the declaration as instantiated, we avoid
7150 trying to instantiate it. Since instantiate_decl can't
7151 handle local variables, and since we've already done
7152 all that needs to be done, that's the right thing to
7154 if (TREE_CODE (decl
) == VAR_DECL
)
7155 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
7156 maybe_push_decl (decl
);
7157 cp_finish_decl (decl
, init
, NULL_TREE
, 0);
7167 stmt
= begin_for_stmt ();
7168 for (tmp
= FOR_INIT_STMT (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
7169 tsubst_expr (tmp
, args
, complain
, in_decl
);
7170 finish_for_init_stmt (stmt
);
7171 finish_for_cond (tsubst_expr (FOR_COND (t
), args
,
7174 tmp
= tsubst_expr (FOR_EXPR (t
), args
, complain
, in_decl
);
7175 finish_for_expr (tmp
, stmt
);
7176 tsubst_expr (FOR_BODY (t
), args
, complain
, in_decl
);
7177 finish_for_stmt (tmp
, stmt
);
7184 stmt
= begin_while_stmt ();
7185 finish_while_stmt_cond (tsubst_expr (WHILE_COND (t
),
7186 args
, complain
, in_decl
),
7188 tsubst_expr (WHILE_BODY (t
), args
, complain
, in_decl
);
7189 finish_while_stmt (stmt
);
7196 stmt
= begin_do_stmt ();
7197 tsubst_expr (DO_BODY (t
), args
, complain
, in_decl
);
7198 finish_do_body (stmt
);
7199 finish_do_stmt (tsubst_expr (DO_COND (t
), args
,
7210 stmt
= begin_if_stmt ();
7211 finish_if_stmt_cond (tsubst_expr (IF_COND (t
),
7212 args
, complain
, in_decl
),
7215 if (tmp
= THEN_CLAUSE (t
), tmp
)
7217 tsubst_expr (tmp
, args
, complain
, in_decl
);
7218 finish_then_clause (stmt
);
7221 if (tmp
= ELSE_CLAUSE (t
), tmp
)
7223 begin_else_clause ();
7224 tsubst_expr (tmp
, args
, complain
, in_decl
);
7225 finish_else_clause (stmt
);
7237 stmt
= begin_compound_stmt (COMPOUND_STMT_NO_SCOPE (t
));
7238 for (substmt
= COMPOUND_BODY (t
);
7239 substmt
!= NULL_TREE
;
7240 substmt
= TREE_CHAIN (substmt
))
7241 tsubst_expr (substmt
, args
, complain
, in_decl
);
7242 return finish_compound_stmt (COMPOUND_STMT_NO_SCOPE (t
), stmt
);
7248 finish_break_stmt ();
7253 finish_continue_stmt ();
7261 stmt
= begin_switch_stmt ();
7262 val
= tsubst_expr (SWITCH_COND (t
), args
, complain
, in_decl
);
7263 finish_switch_cond (val
, stmt
);
7264 tsubst_expr (SWITCH_BODY (t
), args
, complain
, in_decl
);
7265 finish_switch_stmt (val
, stmt
);
7271 finish_case_label (tsubst_expr (CASE_LOW (t
), args
, complain
, in_decl
),
7272 tsubst_expr (CASE_HIGH (t
), args
, complain
, in_decl
));
7276 lineno
= STMT_LINENO (t
);
7277 finish_label_stmt (DECL_NAME (LABEL_STMT_LABEL (t
)));
7282 t
= GOTO_DESTINATION (t
);
7283 if (TREE_CODE (t
) != LABEL_DECL
)
7284 /* Computed goto's must be tsubst'd into. On the other hand,
7285 non-computed gotos must not be; the identifier in question
7286 will have no binding. */
7287 t
= tsubst_expr (t
, args
, complain
, in_decl
);
7290 finish_goto_stmt (t
);
7295 finish_asm_stmt (ASM_CV_QUAL (t
),
7296 tsubst_expr (ASM_STRING (t
), args
, complain
, in_decl
),
7297 tsubst_expr (ASM_OUTPUTS (t
), args
, complain
, in_decl
),
7298 tsubst_expr (ASM_INPUTS (t
), args
, complain
, in_decl
),
7299 tsubst_expr (ASM_CLOBBERS (t
), args
, complain
,
7307 stmt
= begin_try_block ();
7308 tsubst_expr (TRY_STMTS (t
), args
, complain
, in_decl
);
7309 finish_cleanup_try_block (stmt
);
7310 finish_cleanup (tsubst_expr (TRY_HANDLERS (t
), args
,
7318 if (FN_TRY_BLOCK_P (t
))
7319 stmt
= begin_function_try_block ();
7321 stmt
= begin_try_block ();
7323 tsubst_expr (TRY_STMTS (t
), args
, complain
, in_decl
);
7325 if (FN_TRY_BLOCK_P (t
))
7326 finish_function_try_block (stmt
);
7328 finish_try_block (stmt
);
7330 handler
= TRY_HANDLERS (t
);
7331 for (; handler
; handler
= TREE_CHAIN (handler
))
7332 tsubst_expr (handler
, args
, complain
, in_decl
);
7333 if (FN_TRY_BLOCK_P (t
))
7334 finish_function_handler_sequence (stmt
);
7336 finish_handler_sequence (stmt
);
7346 stmt
= begin_handler ();
7347 if (HANDLER_PARMS (t
))
7349 decl
= DECL_STMT_DECL (HANDLER_PARMS (t
));
7350 decl
= tsubst (decl
, args
, complain
, in_decl
);
7351 /* Prevent instantiate_decl from trying to instantiate
7352 this variable. We've already done all that needs to be
7354 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
7358 blocks
= finish_handler_parms (decl
, stmt
);
7359 tsubst_expr (HANDLER_BODY (t
), args
, complain
, in_decl
);
7360 finish_handler (blocks
, stmt
);
7367 tsubst (t
, args
, complain
, NULL_TREE
);
7371 return build_expr_from_tree (tsubst_copy (t
, args
, complain
, in_decl
));
7376 /* Instantiate the indicated variable or function template TMPL with
7377 the template arguments in TARG_PTR. */
7380 instantiate_template (tmpl
, targ_ptr
)
7381 tree tmpl
, targ_ptr
;
7389 if (tmpl
== error_mark_node
)
7390 return error_mark_node
;
7392 my_friendly_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
, 283);
7394 /* Check to see if we already have this specialization. */
7395 spec
= retrieve_specialization (tmpl
, targ_ptr
);
7396 if (spec
!= NULL_TREE
)
7399 if (DECL_TEMPLATE_INFO (tmpl
))
7401 /* The TMPL is a partial instantiation. To get a full set of
7402 arguments we must add the arguments used to perform the
7403 partial instantiation. */
7404 targ_ptr
= add_outermost_template_args (DECL_TI_ARGS (tmpl
),
7406 gen_tmpl
= most_general_template (tmpl
);
7408 /* Check to see if we already have this specialization. */
7409 spec
= retrieve_specialization (gen_tmpl
, targ_ptr
);
7410 if (spec
!= NULL_TREE
)
7416 len
= DECL_NTPARMS (gen_tmpl
);
7417 inner_args
= innermost_args (targ_ptr
);
7421 tree t
= TREE_VEC_ELT (inner_args
, i
);
7422 if (TREE_CODE_CLASS (TREE_CODE (t
)) == 't')
7424 tree nt
= target_type (t
);
7425 if (IS_AGGR_TYPE (nt
) && decl_function_context (TYPE_MAIN_DECL (nt
)))
7427 cp_error ("type `%T' composed from a local class is not a valid template-argument", t
);
7428 cp_error (" trying to instantiate `%D'", gen_tmpl
);
7429 fndecl
= error_mark_node
;
7435 /* substitute template parameters */
7436 fndecl
= tsubst (DECL_RESULT (gen_tmpl
), targ_ptr
, /*complain=*/1, gen_tmpl
);
7437 /* The DECL_TI_TEMPLATE should always be the immediate parent
7438 template, not the most general template. */
7439 DECL_TI_TEMPLATE (fndecl
) = tmpl
;
7441 if (flag_external_templates
)
7442 add_pending_template (fndecl
);
7448 /* Push the name of the class template into the scope of the instantiation. */
7451 overload_template_name (type
)
7454 tree id
= DECL_NAME (CLASSTYPE_TI_TEMPLATE (type
));
7457 if (IDENTIFIER_CLASS_VALUE (id
)
7458 && TREE_TYPE (IDENTIFIER_CLASS_VALUE (id
)) == type
)
7461 decl
= build_decl (TYPE_DECL
, id
, type
);
7462 SET_DECL_ARTIFICIAL (decl
);
7463 pushdecl_class_level (decl
);
7466 /* The FN is a TEMPLATE_DECL for a function. The ARGS are the
7467 arguments that are being used when calling it. TARGS is a vector
7468 into which the deduced template arguments are placed.
7470 Return zero for success, 2 for an incomplete match that doesn't resolve
7471 all the types, and 1 for complete failure. An error message will be
7472 printed only for an incomplete match.
7474 If FN is a conversion operator, RETURN_TYPE is the type desired as
7475 the result of the conversion operator.
7477 TPARMS is a vector of template parameters.
7479 The EXPLICIT_TARGS are explicit template arguments provided via a
7482 The parameter STRICT is one of:
7485 We are deducing arguments for a function call, as in
7489 We are deducing arguments for a conversion function, as in
7493 We are deducing arguments when calculating the partial
7494 ordering between specializations of function or class
7495 templates, as in [temp.func.order] and [temp.class.order],
7496 when doing an explicit instantiation as in [temp.explicit],
7497 when determining an explicit specialization as in
7498 [temp.expl.spec], or when taking the address of a function
7499 template, as in [temp.deduct.funcaddr].
7501 The other arguments are as for type_unification. */
7504 fn_type_unification (fn
, explicit_targs
, targs
, args
, return_type
,
7506 tree fn
, explicit_targs
, targs
, args
, return_type
;
7507 unification_kind_t strict
;
7513 my_friendly_assert (TREE_CODE (fn
) == TEMPLATE_DECL
, 0);
7515 fntype
= TREE_TYPE (fn
);
7520 The specified template arguments must match the template
7521 parameters in kind (i.e., type, nontype, template), and there
7522 must not be more arguments than there are parameters;
7523 otherwise type deduction fails.
7525 Nontype arguments must match the types of the corresponding
7526 nontype template parameters, or must be convertible to the
7527 types of the corresponding nontype parameters as specified in
7528 _temp.arg.nontype_, otherwise type deduction fails.
7530 All references in the function type of the function template
7531 to the corresponding template parameters are replaced by the
7532 specified template argument values. If a substitution in a
7533 template parameter or in the function type of the function
7534 template results in an invalid type, type deduction fails. */
7536 tree converted_args
;
7539 = (coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
7540 explicit_targs
, NULL_TREE
, /*complain=*/0,
7541 /*require_all_arguments=*/0));
7542 if (converted_args
== error_mark_node
)
7545 fntype
= tsubst (fntype
, converted_args
, /*complain=*/0, NULL_TREE
);
7546 if (fntype
== error_mark_node
)
7549 /* Place the explicitly specified arguments in TARGS. */
7550 for (i
= 0; i
< TREE_VEC_LENGTH (targs
); i
++)
7551 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (converted_args
, i
);
7554 parms
= TYPE_ARG_TYPES (fntype
);
7556 if (DECL_CONV_FN_P (fn
))
7558 /* This is a template conversion operator. Use the return types
7559 as well as the argument types. We use it instead of 'this', since
7560 we could be comparing conversions from different classes. */
7561 parms
= tree_cons (NULL_TREE
, TREE_TYPE (fntype
),
7562 TREE_CHAIN (parms
));
7563 args
= tree_cons (NULL_TREE
, return_type
, TREE_CHAIN (args
));
7566 /* We allow incomplete unification without an error message here
7567 because the standard doesn't seem to explicitly prohibit it. Our
7568 callers must be ready to deal with unification failures in any
7570 result
= type_unification_real (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
7571 targs
, parms
, args
, /*subr=*/0,
7572 strict
, /*allow_incomplete*/1);
7575 /* All is well so far. Now, check:
7579 When all template arguments have been deduced, all uses of
7580 template parameters in nondeduced contexts are replaced with
7581 the corresponding deduced argument values. If the
7582 substitution results in an invalid type, as described above,
7583 type deduction fails. */
7584 if (tsubst (TREE_TYPE (fn
), targs
, /*complain=*/0, NULL_TREE
)
7591 /* Adjust types before performing type deduction, as described in
7592 [temp.deduct.call] and [temp.deduct.conv]. The rules in these two
7593 sections are symmetric. PARM is the type of a function parameter
7594 or the return type of the conversion function. ARG is the type of
7595 the argument passed to the call, or the type of the value
7596 intialized with the result of the conversion function. */
7599 maybe_adjust_types_for_deduction (strict
, parm
, arg
)
7600 unification_kind_t strict
;
7611 /* Swap PARM and ARG throughout the remainder of this
7612 function; the handling is precisely symmetric since PARM
7613 will initialize ARG rather than vice versa. */
7621 /* There is nothing to do in this case. */
7625 my_friendly_abort (0);
7628 if (TREE_CODE (*parm
) != REFERENCE_TYPE
)
7630 /* [temp.deduct.call]
7632 If P is not a reference type:
7634 --If A is an array type, the pointer type produced by the
7635 array-to-pointer standard conversion (_conv.array_) is
7636 used in place of A for type deduction; otherwise,
7638 --If A is a function type, the pointer type produced by
7639 the function-to-pointer standard conversion
7640 (_conv.func_) is used in place of A for type deduction;
7643 --If A is a cv-qualified type, the top level
7644 cv-qualifiers of A's type are ignored for type
7646 if (TREE_CODE (*arg
) == ARRAY_TYPE
)
7647 *arg
= build_pointer_type (TREE_TYPE (*arg
));
7648 else if (TREE_CODE (*arg
) == FUNCTION_TYPE
)
7649 *arg
= build_pointer_type (*arg
);
7651 *arg
= TYPE_MAIN_VARIANT (*arg
);
7654 /* [temp.deduct.call]
7656 If P is a cv-qualified type, the top level cv-qualifiers
7657 of P's type are ignored for type deduction. If P is a
7658 reference type, the type referred to by P is used for
7660 *parm
= TYPE_MAIN_VARIANT (*parm
);
7661 if (TREE_CODE (*parm
) == REFERENCE_TYPE
)
7662 *parm
= TREE_TYPE (*parm
);
7665 /* Like type_unfication.
7667 If SUBR is 1, we're being called recursively (to unify the
7668 arguments of a function or method parameter of a function
7672 type_unification_real (tparms
, targs
, parms
, args
, subr
,
7673 strict
, allow_incomplete
)
7674 tree tparms
, targs
, parms
, args
;
7676 unification_kind_t strict
;
7677 int allow_incomplete
;
7681 int ntparms
= TREE_VEC_LENGTH (tparms
);
7684 my_friendly_assert (TREE_CODE (tparms
) == TREE_VEC
, 289);
7685 my_friendly_assert (parms
== NULL_TREE
7686 || TREE_CODE (parms
) == TREE_LIST
, 290);
7687 /* ARGS could be NULL (via a call from parse.y to
7688 build_x_function_call). */
7690 my_friendly_assert (TREE_CODE (args
) == TREE_LIST
, 291);
7691 my_friendly_assert (ntparms
> 0, 292);
7696 sub_strict
= UNIFY_ALLOW_MORE_CV_QUAL
| UNIFY_ALLOW_DERIVED
;
7700 sub_strict
= UNIFY_ALLOW_LESS_CV_QUAL
;
7704 sub_strict
= UNIFY_ALLOW_NONE
;
7708 my_friendly_abort (0);
7712 && parms
!= void_list_node
7714 && args
!= void_list_node
)
7716 parm
= TREE_VALUE (parms
);
7717 parms
= TREE_CHAIN (parms
);
7718 arg
= TREE_VALUE (args
);
7719 args
= TREE_CHAIN (args
);
7721 if (arg
== error_mark_node
)
7723 if (arg
== unknown_type_node
)
7724 /* We can't deduce anything from this, but we might get all the
7725 template args from other function args. */
7728 /* Conversions will be performed on a function argument that
7729 corresponds with a function parameter that contains only
7730 non-deducible template parameters and explicitly specified
7731 template parameters. */
7732 if (! uses_template_parms (parm
))
7736 if (TREE_CODE_CLASS (TREE_CODE (arg
)) != 't')
7737 type
= TREE_TYPE (arg
);
7744 if (strict
== DEDUCE_EXACT
)
7746 if (same_type_p (parm
, type
))
7750 /* It might work; we shouldn't check now, because we might
7751 get into infinite recursion. Overload resolution will
7758 if (TREE_CODE_CLASS (TREE_CODE (arg
)) != 't')
7760 my_friendly_assert (TREE_TYPE (arg
) != NULL_TREE
, 293);
7761 if (type_unknown_p (arg
))
7763 /* [temp.deduct.type] A template-argument can be deduced from
7764 a pointer to function or pointer to member function
7765 argument if the set of overloaded functions does not
7766 contain function templates and at most one of a set of
7767 overloaded functions provides a unique match. */
7769 if (resolve_overloaded_unification
7770 (tparms
, targs
, parm
, arg
, strict
, sub_strict
)
7775 arg
= TREE_TYPE (arg
);
7779 maybe_adjust_types_for_deduction (strict
, &parm
, &arg
);
7781 switch (unify (tparms
, targs
, parm
, arg
, sub_strict
))
7789 /* Fail if we've reached the end of the parm list, and more args
7790 are present, and the parm list isn't variadic. */
7791 if (args
&& args
!= void_list_node
&& parms
== void_list_node
)
7793 /* Fail if parms are left and they don't have default values. */
7795 && parms
!= void_list_node
7796 && TREE_PURPOSE (parms
) == NULL_TREE
)
7799 for (i
= 0; i
< ntparms
; i
++)
7800 if (TREE_VEC_ELT (targs
, i
) == NULL_TREE
)
7802 if (!allow_incomplete
)
7803 error ("incomplete type unification");
7809 /* Subroutine of type_unification_real. Args are like the variables at the
7810 call site. ARG is an overloaded function (or template-id); we try
7811 deducing template args from each of the overloads, and if only one
7812 succeeds, we go with that. Modifies TARGS and returns 0 on success. */
7815 resolve_overloaded_unification (tparms
, targs
, parm
, arg
, strict
,
7817 tree tparms
, targs
, parm
, arg
;
7818 unification_kind_t strict
;
7821 tree tempargs
= copy_node (targs
);
7824 if (TREE_CODE (arg
) == ADDR_EXPR
)
7825 arg
= TREE_OPERAND (arg
, 0);
7827 if (TREE_CODE (arg
) == COMPONENT_REF
)
7828 /* Handle `&x' where `x' is some static or non-static member
7830 arg
= TREE_OPERAND (arg
, 1);
7832 if (TREE_CODE (arg
) == OFFSET_REF
)
7833 arg
= TREE_OPERAND (arg
, 1);
7835 /* Strip baselink information. */
7836 while (TREE_CODE (arg
) == TREE_LIST
)
7837 arg
= TREE_VALUE (arg
);
7839 if (TREE_CODE (arg
) == TEMPLATE_ID_EXPR
)
7841 /* If we got some explicit template args, we need to plug them into
7842 the affected templates before we try to unify, in case the
7843 explicit args will completely resolve the templates in question. */
7845 tree expl_subargs
= TREE_OPERAND (arg
, 1);
7846 arg
= TREE_OPERAND (arg
, 0);
7848 for (; arg
; arg
= OVL_NEXT (arg
))
7850 tree fn
= OVL_CURRENT (arg
);
7853 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
7856 subargs
= get_bindings_overload (fn
, DECL_RESULT (fn
), expl_subargs
);
7859 elem
= tsubst (TREE_TYPE (fn
), subargs
, /*complain=*/0,
7861 if (TREE_CODE (elem
) == METHOD_TYPE
)
7862 elem
= build_ptrmemfunc_type (build_pointer_type (elem
));
7863 good
+= try_one_overload (tparms
, targs
, tempargs
, parm
, elem
,
7864 strict
, sub_strict
);
7868 else if (TREE_CODE (arg
) == OVERLOAD
)
7870 for (; arg
; arg
= OVL_NEXT (arg
))
7872 tree type
= TREE_TYPE (OVL_CURRENT (arg
));
7873 if (TREE_CODE (type
) == METHOD_TYPE
)
7874 type
= build_ptrmemfunc_type (build_pointer_type (type
));
7875 good
+= try_one_overload (tparms
, targs
, tempargs
, parm
,
7877 strict
, sub_strict
);
7881 my_friendly_abort (981006);
7883 /* [temp.deduct.type] A template-argument can be deduced from a pointer
7884 to function or pointer to member function argument if the set of
7885 overloaded functions does not contain function templates and at most
7886 one of a set of overloaded functions provides a unique match.
7888 So if we found multiple possibilities, we return success but don't
7893 int i
= TREE_VEC_LENGTH (targs
);
7895 if (TREE_VEC_ELT (tempargs
, i
))
7896 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (tempargs
, i
);
7904 /* Subroutine of resolve_overloaded_unification; does deduction for a single
7905 overload. Fills TARGS with any deduced arguments, or error_mark_node if
7906 different overloads deduce different arguments for a given parm.
7907 Returns 1 on success. */
7910 try_one_overload (tparms
, orig_targs
, targs
, parm
, arg
, strict
,
7912 tree tparms
, orig_targs
, targs
, parm
, arg
;
7913 unification_kind_t strict
;
7920 /* [temp.deduct.type] A template-argument can be deduced from a pointer
7921 to function or pointer to member function argument if the set of
7922 overloaded functions does not contain function templates and at most
7923 one of a set of overloaded functions provides a unique match.
7925 So if this is a template, just return success. */
7927 if (uses_template_parms (arg
))
7930 maybe_adjust_types_for_deduction (strict
, &parm
, &arg
);
7932 /* We don't copy orig_targs for this because if we have already deduced
7933 some template args from previous args, unify would complain when we
7934 try to deduce a template parameter for the same argument, even though
7935 there isn't really a conflict. */
7936 nargs
= TREE_VEC_LENGTH (targs
);
7937 tempargs
= make_tree_vec (nargs
);
7939 if (unify (tparms
, tempargs
, parm
, arg
, sub_strict
) != 0)
7942 /* First make sure we didn't deduce anything that conflicts with
7943 explicitly specified args. */
7944 for (i
= nargs
; i
--; )
7946 tree elt
= TREE_VEC_ELT (tempargs
, i
);
7947 tree oldelt
= TREE_VEC_ELT (orig_targs
, i
);
7949 if (elt
== NULL_TREE
)
7951 else if (uses_template_parms (elt
))
7953 /* Since we're unifying against ourselves, we will fill in template
7954 args used in the function parm list with our own template parms.
7956 TREE_VEC_ELT (tempargs
, i
) = NULL_TREE
;
7959 else if (oldelt
&& ! template_args_equal (oldelt
, elt
))
7963 for (i
= nargs
; i
--; )
7965 tree elt
= TREE_VEC_ELT (tempargs
, i
);
7968 TREE_VEC_ELT (targs
, i
) = elt
;
7974 /* PARM is a template class (perhaps with unbound template
7975 parameters). ARG is a fully instantiated type. If ARG can be
7976 bound to PARM, return ARG, otherwise return NULL_TREE. TPARMS and
7977 TARGS are as for unify. */
7980 try_class_unification (tparms
, targs
, parm
, arg
)
7989 if (!CLASSTYPE_TEMPLATE_INFO (arg
)
7990 || CLASSTYPE_TI_TEMPLATE (arg
) != CLASSTYPE_TI_TEMPLATE (parm
))
7993 /* We need to make a new template argument vector for the call to
7994 unify. If we used TARGS, we'd clutter it up with the result of
7995 the attempted unification, even if this class didn't work out.
7996 We also don't want to commit ourselves to all the unifications
7997 we've already done, since unification is supposed to be done on
7998 an argument-by-argument basis. In other words, consider the
7999 following pathological case:
8001 template <int I, int J, int K>
8004 template <int I, int J>
8005 struct S<I, J, 2> : public S<I, I, I>, S<J, J, J> {};
8007 template <int I, int J, int K>
8008 void f(S<I, J, K>, S<I, I, I>);
8017 Now, by the time we consider the unification involving `s2', we
8018 already know that we must have `f<0, 0, 0>'. But, even though
8019 `S<0, 1, 2>' is derived from `S<0, 0, 0>', the code is not legal
8020 because there are two ways to unify base classes of S<0, 1, 2>
8021 with S<I, I, I>. If we kept the already deduced knowledge, we
8022 would reject the possibility I=1. */
8023 copy_of_targs
= make_tree_vec (TREE_VEC_LENGTH (targs
));
8024 i
= unify (tparms
, copy_of_targs
, CLASSTYPE_TI_ARGS (parm
),
8025 CLASSTYPE_TI_ARGS (arg
), UNIFY_ALLOW_NONE
);
8027 /* If unification failed, we're done. */
8034 /* Subroutine of get_template_base. RVAL, if non-NULL, is a base we
8035 have alreay discovered to be satisfactory. ARG_BINFO is the binfo
8036 for the base class of ARG that we are currently examining. */
8039 get_template_base_recursive (tparms
, targs
, parm
,
8040 arg_binfo
, rval
, flags
)
8050 tree arg
= BINFO_TYPE (arg_binfo
);
8052 if (!(flags
& GTB_IGNORE_TYPE
))
8054 tree r
= try_class_unification (tparms
, targs
,
8057 /* If there is more than one satisfactory baseclass, then:
8061 If they yield more than one possible deduced A, the type
8065 if (r
&& rval
&& !same_type_p (r
, rval
))
8066 return error_mark_node
;
8071 binfos
= BINFO_BASETYPES (arg_binfo
);
8072 n_baselinks
= binfos
? TREE_VEC_LENGTH (binfos
) : 0;
8074 /* Process base types. */
8075 for (i
= 0; i
< n_baselinks
; i
++)
8077 tree base_binfo
= TREE_VEC_ELT (binfos
, i
);
8080 /* Skip this base, if we've already seen it. */
8081 if (BINFO_MARKED (base_binfo
))
8085 (flags
& GTB_VIA_VIRTUAL
) || TREE_VIA_VIRTUAL (base_binfo
);
8087 /* When searching for a non-virtual, we cannot mark virtually
8090 SET_BINFO_MARKED (base_binfo
);
8092 rval
= get_template_base_recursive (tparms
, targs
,
8096 GTB_VIA_VIRTUAL
* this_virtual
);
8098 /* If we discovered more than one matching base class, we can
8100 if (rval
== error_mark_node
)
8101 return error_mark_node
;
8107 /* Given a template type PARM and a class type ARG, find the unique
8108 base type in ARG that is an instance of PARM. We do not examine
8109 ARG itself; only its base-classes. If there is no appropriate base
8110 class, return NULL_TREE. If there is more than one, return
8111 error_mark_node. PARM may be the type of a partial specialization,
8112 as well as a plain template type. Used by unify. */
8115 get_template_base (tparms
, targs
, parm
, arg
)
8124 my_friendly_assert (IS_AGGR_TYPE_CODE (TREE_CODE (arg
)), 92);
8126 arg_binfo
= TYPE_BINFO (complete_type (arg
));
8127 rval
= get_template_base_recursive (tparms
, targs
,
8132 /* Since get_template_base_recursive marks the bases classes, we
8133 must unmark them here. */
8134 dfs_walk (arg_binfo
, dfs_unmark
, markedp
, 0);
8139 /* Returns the level of DECL, which declares a template parameter. */
8142 template_decl_level (decl
)
8145 switch (TREE_CODE (decl
))
8149 return TEMPLATE_TYPE_LEVEL (TREE_TYPE (decl
));
8152 return TEMPLATE_PARM_LEVEL (DECL_INITIAL (decl
));
8155 my_friendly_abort (0);
8160 /* Decide whether ARG can be unified with PARM, considering only the
8161 cv-qualifiers of each type, given STRICT as documented for unify.
8162 Returns non-zero iff the unification is OK on that basis.*/
8165 check_cv_quals_for_unify (strict
, arg
, parm
)
8170 if (!(strict
& UNIFY_ALLOW_MORE_CV_QUAL
)
8171 && !at_least_as_qualified_p (arg
, parm
))
8174 if (!(strict
& UNIFY_ALLOW_LESS_CV_QUAL
)
8175 && !at_least_as_qualified_p (parm
, arg
))
8181 /* Takes parameters as for type_unification. Returns 0 if the
8182 type deduction suceeds, 1 otherwise. The parameter STRICT is a
8183 bitwise or of the following flags:
8186 Require an exact match between PARM and ARG.
8187 UNIFY_ALLOW_MORE_CV_QUAL:
8188 Allow the deduced ARG to be more cv-qualified than ARG.
8189 UNIFY_ALLOW_LESS_CV_QUAL:
8190 Allow the deduced ARG to be less cv-qualified than ARG.
8191 UNIFY_ALLOW_DERIVED:
8192 Allow the deduced ARG to be a template base class of ARG,
8193 or a pointer to a template base class of the type pointed to by
8195 UNIFY_ALLOW_INTEGER:
8196 Allow any integral type to be deduced. See the TEMPLATE_PARM_INDEX
8197 case for more information. */
8200 unify (tparms
, targs
, parm
, arg
, strict
)
8201 tree tparms
, targs
, parm
, arg
;
8208 /* I don't think this will do the right thing with respect to types.
8209 But the only case I've seen it in so far has been array bounds, where
8210 signedness is the only information lost, and I think that will be
8212 while (TREE_CODE (parm
) == NOP_EXPR
)
8213 parm
= TREE_OPERAND (parm
, 0);
8215 if (arg
== error_mark_node
)
8217 if (arg
== unknown_type_node
)
8218 /* We can't deduce anything from this, but we might get all the
8219 template args from other function args. */
8222 /* If PARM uses template parameters, then we can't bail out here,
8223 even if ARG == PARM, since we won't record unifications for the
8224 template parameters. We might need them if we're trying to
8225 figure out which of two things is more specialized. */
8226 if (arg
== parm
&& !uses_template_parms (parm
))
8229 /* Immediately reject some pairs that won't unify because of
8230 cv-qualification mismatches. */
8231 if (TREE_CODE (arg
) == TREE_CODE (parm
)
8232 && TREE_CODE_CLASS (TREE_CODE (arg
)) == 't'
8233 /* We check the cv-qualifiers when unifying with template type
8234 parameters below. We want to allow ARG `const T' to unify with
8235 PARM `T' for example, when computing which of two templates
8236 is more specialized, for example. */
8237 && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
8238 && !check_cv_quals_for_unify (strict
, arg
, parm
))
8241 switch (TREE_CODE (parm
))
8244 /* In a type which contains a nested-name-specifier, template
8245 argument values cannot be deduced for template parameters used
8246 within the nested-name-specifier. */
8249 case TEMPLATE_TYPE_PARM
:
8250 case TEMPLATE_TEMPLATE_PARM
:
8251 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
8253 if (TEMPLATE_TYPE_LEVEL (parm
)
8254 != template_decl_level (tparm
))
8255 /* The PARM is not one we're trying to unify. Just check
8256 to see if it matches ARG. */
8257 return (TREE_CODE (arg
) == TREE_CODE (parm
)
8258 && same_type_p (parm
, arg
)) ? 0 : 1;
8259 idx
= TEMPLATE_TYPE_IDX (parm
);
8260 targ
= TREE_VEC_ELT (targs
, idx
);
8261 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, idx
));
8263 /* Check for mixed types and values. */
8264 if ((TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
8265 && TREE_CODE (tparm
) != TYPE_DECL
)
8266 || (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
8267 && TREE_CODE (tparm
) != TEMPLATE_DECL
))
8270 if (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
)
8272 if (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (parm
))
8274 /* We arrive here when PARM does not involve template
8277 /* ARG must be constructed from a template class. */
8278 if (TREE_CODE (arg
) != RECORD_TYPE
|| !CLASSTYPE_TEMPLATE_INFO (arg
))
8282 tree parmtmpl
= TYPE_TI_TEMPLATE (parm
);
8283 tree parmvec
= TYPE_TI_ARGS (parm
);
8284 tree argvec
= CLASSTYPE_TI_ARGS (arg
);
8286 = DECL_INNERMOST_TEMPLATE_PARMS (CLASSTYPE_TI_TEMPLATE (arg
));
8289 /* The parameter and argument roles have to be switched here
8290 in order to handle default arguments properly. For example,
8291 template<template <class> class TT> void f(TT<int>)
8292 should be able to accept vector<int> which comes from
8293 template <class T, class Allocator = allocator>
8296 if (coerce_template_parms (argtmplvec
, parmvec
, parmtmpl
, 0, 1)
8300 /* Deduce arguments T, i from TT<T> or TT<i>.
8301 We check each element of PARMVEC and ARGVEC individually
8302 rather than the whole TREE_VEC since they can have
8303 different number of elements. */
8305 for (i
= 0; i
< TREE_VEC_LENGTH (parmvec
); ++i
)
8307 tree t
= TREE_VEC_ELT (parmvec
, i
);
8309 if (unify (tparms
, targs
, t
,
8310 TREE_VEC_ELT (argvec
, i
),
8315 arg
= CLASSTYPE_TI_TEMPLATE (arg
);
8320 /* If PARM is `const T' and ARG is only `int', we don't have
8321 a match unless we are allowing additional qualification.
8322 If ARG is `const int' and PARM is just `T' that's OK;
8323 that binds `const int' to `T'. */
8324 if (!check_cv_quals_for_unify (strict
| UNIFY_ALLOW_LESS_CV_QUAL
,
8328 /* Consider the case where ARG is `const volatile int' and
8329 PARM is `const T'. Then, T should be `volatile int'. */
8331 cp_build_qualified_type_real (arg
,
8333 & ~CP_TYPE_QUALS (parm
),
8335 if (arg
== error_mark_node
)
8339 /* Simple cases: Value already set, does match or doesn't. */
8340 if (targ
!= NULL_TREE
&& same_type_p (targ
, arg
))
8345 /* Make sure that ARG is not a variable-sized array. (Note that
8346 were talking about variable-sized arrays (like `int[n]'),
8347 rather than arrays of unknown size (like `int[]').) We'll
8348 get very confused by such a type since the bound of the array
8349 will not be computable in an instantiation. Besides, such
8350 types are not allowed in ISO C++, so we can do as we please
8352 if (TREE_CODE (arg
) == ARRAY_TYPE
8353 && !uses_template_parms (arg
)
8354 && (TREE_CODE (TYPE_MAX_VALUE (TYPE_DOMAIN (arg
)))
8358 TREE_VEC_ELT (targs
, idx
) = arg
;
8361 case TEMPLATE_PARM_INDEX
:
8362 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
8364 if (TEMPLATE_PARM_LEVEL (parm
)
8365 != template_decl_level (tparm
))
8366 /* The PARM is not one we're trying to unify. Just check
8367 to see if it matches ARG. */
8368 return (TREE_CODE (arg
) == TREE_CODE (parm
)
8369 && cp_tree_equal (parm
, arg
) > 0) ? 0 : 1;
8371 idx
= TEMPLATE_PARM_IDX (parm
);
8372 targ
= TREE_VEC_ELT (targs
, idx
);
8376 int i
= (cp_tree_equal (targ
, arg
) > 0);
8382 my_friendly_abort (42);
8385 /* [temp.deduct.type] If, in the declaration of a function template
8386 with a non-type template-parameter, the non-type
8387 template-parameter is used in an expression in the function
8388 parameter-list and, if the corresponding template-argument is
8389 deduced, the template-argument type shall match the type of the
8390 template-parameter exactly, except that a template-argument
8391 deduced from an array bound may be of any integral type. */
8392 if (same_type_p (TREE_TYPE (arg
), TREE_TYPE (parm
)))
8394 else if ((strict
& UNIFY_ALLOW_INTEGER
)
8395 && (TREE_CODE (TREE_TYPE (parm
)) == INTEGER_TYPE
8396 || TREE_CODE (TREE_TYPE (parm
)) == BOOLEAN_TYPE
))
8401 TREE_VEC_ELT (targs
, idx
) = arg
;
8408 if (TREE_CODE (arg
) != POINTER_TYPE
)
8411 /* [temp.deduct.call]
8413 A can be another pointer or pointer to member type that can
8414 be converted to the deduced A via a qualification
8415 conversion (_conv.qual_).
8417 We pass down STRICT here rather than UNIFY_ALLOW_NONE.
8418 This will allow for additional cv-qualification of the
8419 pointed-to types if appropriate. In general, this is a bit
8420 too generous; we are only supposed to allow qualification
8421 conversions and this method will allow an ARG of char** and
8422 a deduced ARG of const char**. However, overload
8423 resolution will subsequently invalidate the candidate, so
8424 this is probably OK. */
8425 sub_strict
= strict
;
8427 if (TREE_CODE (TREE_TYPE (arg
)) != RECORD_TYPE
)
8428 /* The derived-to-base conversion only persists through one
8429 level of pointers. */
8430 sub_strict
&= ~UNIFY_ALLOW_DERIVED
;
8432 return unify (tparms
, targs
, TREE_TYPE (parm
),
8433 TREE_TYPE (arg
), sub_strict
);
8436 case REFERENCE_TYPE
:
8437 if (TREE_CODE (arg
) != REFERENCE_TYPE
)
8439 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
8443 if (TREE_CODE (arg
) != ARRAY_TYPE
)
8445 if ((TYPE_DOMAIN (parm
) == NULL_TREE
)
8446 != (TYPE_DOMAIN (arg
) == NULL_TREE
))
8448 if (TYPE_DOMAIN (parm
) != NULL_TREE
8449 && unify (tparms
, targs
, TYPE_DOMAIN (parm
),
8450 TYPE_DOMAIN (arg
), UNIFY_ALLOW_NONE
) != 0)
8452 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
8460 if (TREE_CODE (arg
) != TREE_CODE (parm
))
8463 if (TREE_CODE (parm
) == INTEGER_TYPE
8464 && TREE_CODE (TYPE_MAX_VALUE (parm
)) != INTEGER_CST
)
8466 if (TYPE_MIN_VALUE (parm
) && TYPE_MIN_VALUE (arg
)
8467 && unify (tparms
, targs
, TYPE_MIN_VALUE (parm
),
8468 TYPE_MIN_VALUE (arg
), UNIFY_ALLOW_INTEGER
))
8470 if (TYPE_MAX_VALUE (parm
) && TYPE_MAX_VALUE (arg
)
8471 && unify (tparms
, targs
, TYPE_MAX_VALUE (parm
),
8472 TYPE_MAX_VALUE (arg
), UNIFY_ALLOW_INTEGER
))
8475 /* We use the TYPE_MAIN_VARIANT since we have already
8476 checked cv-qualification at the top of the
8478 else if (!same_type_p (TYPE_MAIN_VARIANT (arg
),
8479 TYPE_MAIN_VARIANT (parm
)))
8482 /* As far as unification is concerned, this wins. Later checks
8483 will invalidate it if necessary. */
8486 /* Types INTEGER_CST and MINUS_EXPR can come from array bounds. */
8487 /* Type INTEGER_CST can come from ordinary constant template args. */
8489 while (TREE_CODE (arg
) == NOP_EXPR
)
8490 arg
= TREE_OPERAND (arg
, 0);
8492 if (TREE_CODE (arg
) != INTEGER_CST
)
8494 return !tree_int_cst_equal (parm
, arg
);
8499 if (TREE_CODE (arg
) != TREE_VEC
)
8501 if (TREE_VEC_LENGTH (parm
) != TREE_VEC_LENGTH (arg
))
8503 for (i
= TREE_VEC_LENGTH (parm
) - 1; i
>= 0; i
--)
8504 if (unify (tparms
, targs
,
8505 TREE_VEC_ELT (parm
, i
), TREE_VEC_ELT (arg
, i
),
8513 if (TREE_CODE (arg
) != TREE_CODE (parm
))
8516 if (TYPE_PTRMEMFUNC_P (parm
))
8518 if (!TYPE_PTRMEMFUNC_P (arg
))
8521 return unify (tparms
, targs
,
8522 TYPE_PTRMEMFUNC_FN_TYPE (parm
),
8523 TYPE_PTRMEMFUNC_FN_TYPE (arg
),
8527 if (CLASSTYPE_TEMPLATE_INFO (parm
))
8531 if (strict
& UNIFY_ALLOW_DERIVED
)
8533 /* First, we try to unify the PARM and ARG directly. */
8534 t
= try_class_unification (tparms
, targs
,
8539 /* Fallback to the special case allowed in
8542 If P is a class, and P has the form
8543 template-id, then A can be a derived class of
8544 the deduced A. Likewise, if P is a pointer to
8545 a class of the form template-id, A can be a
8546 pointer to a derived class pointed to by the
8548 t
= get_template_base (tparms
, targs
,
8551 if (! t
|| t
== error_mark_node
)
8555 else if (CLASSTYPE_TEMPLATE_INFO (arg
)
8556 && (CLASSTYPE_TI_TEMPLATE (parm
)
8557 == CLASSTYPE_TI_TEMPLATE (arg
)))
8558 /* Perhaps PARM is something like S<U> and ARG is S<int>.
8559 Then, we should unify `int' and `U'. */
8562 /* There's no chance of unication succeeding. */
8565 return unify (tparms
, targs
, CLASSTYPE_TI_ARGS (parm
),
8566 CLASSTYPE_TI_ARGS (t
), UNIFY_ALLOW_NONE
);
8568 else if (!same_type_p (TYPE_MAIN_VARIANT (parm
),
8569 TYPE_MAIN_VARIANT (arg
)))
8575 if (TREE_CODE (arg
) != TREE_CODE (parm
))
8578 if (unify (tparms
, targs
, TREE_TYPE (parm
),
8579 TREE_TYPE (arg
), UNIFY_ALLOW_NONE
))
8581 return type_unification_real (tparms
, targs
, TYPE_ARG_TYPES (parm
),
8582 TYPE_ARG_TYPES (arg
), 1,
8586 if (TREE_CODE (arg
) != OFFSET_TYPE
)
8588 if (unify (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
8589 TYPE_OFFSET_BASETYPE (arg
), UNIFY_ALLOW_NONE
))
8591 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
8595 if (arg
!= decl_constant_value (parm
))
8600 /* Matched cases are handled by the ARG == PARM test above. */
8604 if (TREE_CODE (TREE_OPERAND (parm
, 1)) == INTEGER_CST
)
8606 /* We handle this case specially, since it comes up with
8607 arrays. In particular, something like:
8609 template <int N> void f(int (&x)[N]);
8611 Here, we are trying to unify the range type, which
8612 looks like [0 ... (N - 1)]. */
8614 t1
= TREE_OPERAND (parm
, 0);
8615 t2
= TREE_OPERAND (parm
, 1);
8617 /* Should this be a regular fold? */
8618 t
= maybe_fold_nontype_arg (build (PLUS_EXPR
,
8622 return unify (tparms
, targs
, t1
, t
, strict
);
8624 /* else fall through */
8627 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (parm
))))
8628 /* We're looking at an expression. This can happen with
8632 void foo(S<I>, S<I + 2>);
8634 This is a "nondeduced context":
8638 The nondeduced contexts are:
8640 --A type that is a template-id in which one or more of
8641 the template-arguments is an expression that references
8642 a template-parameter.
8644 In these cases, we assume deduction succeeded, but don't
8645 actually infer any unifications. */
8648 sorry ("use of `%s' in template type unification",
8649 tree_code_name
[(int) TREE_CODE (parm
)]);
8655 /* Called if RESULT is explicitly instantiated, or is a member of an
8656 explicitly instantiated class, or if using -frepo and the
8657 instantiation of RESULT has been assigned to this file. */
8660 mark_decl_instantiated (result
, extern_p
)
8664 if (TREE_CODE (result
) != FUNCTION_DECL
)
8665 /* The TREE_PUBLIC flag for function declarations will have been
8666 set correctly by tsubst. */
8667 TREE_PUBLIC (result
) = 1;
8671 DECL_INTERFACE_KNOWN (result
) = 1;
8672 DECL_NOT_REALLY_EXTERN (result
) = 1;
8674 /* Always make artificials weak. */
8675 if (DECL_ARTIFICIAL (result
) && flag_weak
)
8676 comdat_linkage (result
);
8677 /* For WIN32 we also want to put explicit instantiations in
8678 linkonce sections. */
8679 else if (TREE_PUBLIC (result
))
8680 maybe_make_one_only (result
);
8682 else if (TREE_CODE (result
) == FUNCTION_DECL
)
8683 mark_inline_for_output (result
);
8686 /* Given two function templates PAT1 and PAT2, and explicit template
8687 arguments EXPLICIT_ARGS return:
8689 1 if PAT1 is more specialized than PAT2 as described in [temp.func.order].
8690 -1 if PAT2 is more specialized than PAT1.
8691 0 if neither is more specialized. */
8694 more_specialized (pat1
, pat2
, explicit_args
)
8695 tree pat1
, pat2
, explicit_args
;
8700 targs
= get_bindings_overload (pat1
, DECL_RESULT (pat2
), explicit_args
);
8704 targs
= get_bindings_overload (pat2
, DECL_RESULT (pat1
), explicit_args
);
8711 /* Given two class template specialization list nodes PAT1 and PAT2, return:
8713 1 if PAT1 is more specialized than PAT2 as described in [temp.class.order].
8714 -1 if PAT2 is more specialized than PAT1.
8715 0 if neither is more specialized. */
8718 more_specialized_class (pat1
, pat2
)
8724 targs
= get_class_bindings (TREE_VALUE (pat1
), TREE_PURPOSE (pat1
),
8725 TREE_PURPOSE (pat2
));
8729 targs
= get_class_bindings (TREE_VALUE (pat2
), TREE_PURPOSE (pat2
),
8730 TREE_PURPOSE (pat1
));
8737 /* Return the template arguments that will produce the function signature
8738 DECL from the function template FN, with the explicit template
8739 arguments EXPLICIT_ARGS. If CHECK_RETTYPE is 1, the return type must
8740 also match. Return NULL_TREE if no satisfactory arguments could be
8744 get_bindings_real (fn
, decl
, explicit_args
, check_rettype
)
8745 tree fn
, decl
, explicit_args
;
8748 int ntparms
= DECL_NTPARMS (fn
);
8749 tree targs
= make_tree_vec (ntparms
);
8751 tree decl_arg_types
;
8754 /* Substitute the explicit template arguments into the type of DECL.
8755 The call to fn_type_unification will handle substitution into the
8757 decl_type
= TREE_TYPE (decl
);
8758 if (explicit_args
&& uses_template_parms (decl_type
))
8761 tree converted_args
;
8763 if (DECL_TEMPLATE_INFO (decl
))
8764 tmpl
= DECL_TI_TEMPLATE (decl
);
8766 /* We can get here for some illegal specializations. */
8770 = (coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
8771 explicit_args
, NULL_TREE
,
8773 /*require_all_arguments=*/0));
8774 if (converted_args
== error_mark_node
)
8777 decl_type
= tsubst (decl_type
, converted_args
, /*complain=*/0,
8779 if (decl_type
== error_mark_node
)
8783 /* If FN is a static member function, adjust the type of DECL
8785 decl_arg_types
= TYPE_ARG_TYPES (decl_type
);
8786 if (DECL_STATIC_FUNCTION_P (fn
)
8787 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
8788 decl_arg_types
= TREE_CHAIN (decl_arg_types
);
8790 i
= fn_type_unification (fn
, explicit_args
, targs
,
8792 TREE_TYPE (decl_type
),
8800 /* Check to see that the resulting return type is also OK. */
8801 tree t
= tsubst (TREE_TYPE (TREE_TYPE (fn
)), targs
,
8802 /*complain=*/0, NULL_TREE
);
8804 if (!same_type_p (t
, TREE_TYPE (TREE_TYPE (decl
))))
8811 /* For most uses, we want to check the return type. */
8814 get_bindings (fn
, decl
, explicit_args
)
8815 tree fn
, decl
, explicit_args
;
8817 return get_bindings_real (fn
, decl
, explicit_args
, 1);
8820 /* But for more_specialized, we only care about the parameter types. */
8823 get_bindings_overload (fn
, decl
, explicit_args
)
8824 tree fn
, decl
, explicit_args
;
8826 return get_bindings_real (fn
, decl
, explicit_args
, 0);
8829 /* Return the innermost template arguments that, when applied to a
8830 template specialization whose innermost template parameters are
8831 TPARMS, and whose specialization arguments are ARGS, yield the
8834 For example, suppose we have:
8836 template <class T, class U> struct S {};
8837 template <class T> struct S<T*, int> {};
8839 Then, suppose we want to get `S<double*, int>'. The TPARMS will be
8840 {T}, the PARMS will be {T*, int} and the ARGS will be {double*,
8841 int}. The resulting vector will be {double}, indicating that `T'
8842 is bound to `double'. */
8845 get_class_bindings (tparms
, parms
, args
)
8846 tree tparms
, parms
, args
;
8848 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
8849 tree vec
= make_tree_vec (ntparms
);
8851 args
= innermost_args (args
);
8853 if (unify (tparms
, vec
, parms
, args
, UNIFY_ALLOW_NONE
))
8856 for (i
= 0; i
< ntparms
; ++i
)
8857 if (! TREE_VEC_ELT (vec
, i
))
8863 /* In INSTANTIATIONS is a list of <INSTANTIATION, TEMPLATE> pairs.
8864 Pick the most specialized template, and return the corresponding
8865 instantiation, or if there is no corresponding instantiation, the
8866 template itself. EXPLICIT_ARGS is any template arguments explicity
8867 mentioned in a template-id. If there is no most specialized
8868 tempalte, error_mark_node is returned. If there are no templates
8869 at all, NULL_TREE is returned. */
8872 most_specialized_instantiation (instantiations
, explicit_args
)
8873 tree instantiations
;
8879 if (!instantiations
)
8882 champ
= instantiations
;
8883 for (fn
= TREE_CHAIN (instantiations
); fn
; fn
= TREE_CHAIN (fn
))
8885 fate
= more_specialized (TREE_VALUE (champ
),
8886 TREE_VALUE (fn
), explicit_args
);
8893 fn
= TREE_CHAIN (fn
);
8895 return error_mark_node
;
8901 for (fn
= instantiations
; fn
&& fn
!= champ
; fn
= TREE_CHAIN (fn
))
8903 fate
= more_specialized (TREE_VALUE (champ
),
8904 TREE_VALUE (fn
), explicit_args
);
8906 return error_mark_node
;
8909 return TREE_PURPOSE (champ
) ? TREE_PURPOSE (champ
) : TREE_VALUE (champ
);
8912 /* Return the most specialized of the list of templates in FNS that can
8913 produce an instantiation matching DECL, given the explicit template
8914 arguments EXPLICIT_ARGS. */
8917 most_specialized (fns
, decl
, explicit_args
)
8918 tree fns
, decl
, explicit_args
;
8920 tree candidates
= NULL_TREE
;
8923 for (fn
= fns
; fn
; fn
= TREE_CHAIN (fn
))
8925 tree candidate
= TREE_VALUE (fn
);
8927 args
= get_bindings (candidate
, decl
, explicit_args
);
8929 candidates
= tree_cons (NULL_TREE
, candidate
, candidates
);
8932 return most_specialized_instantiation (candidates
, explicit_args
);
8935 /* If DECL is a specialization of some template, return the most
8936 general such template. For example, given:
8938 template <class T> struct S { template <class U> void f(U); };
8940 if TMPL is `template <class U> void S<int>::f(U)' this will return
8941 the full template. This function will not trace past partial
8942 specializations, however. For example, given in addition:
8944 template <class T> struct S<T*> { template <class U> void f(U); };
8946 if TMPL is `template <class U> void S<int*>::f(U)' this will return
8947 `template <class T> template <class U> S<T*>::f(U)'. */
8950 most_general_template (decl
)
8953 while (DECL_TEMPLATE_INFO (decl
)
8954 /* The DECL_TI_TEMPLATE can be a LOOKUP_EXPR or
8955 IDENTIFIER_NODE in some cases. (See cp-tree.h for
8957 && TREE_CODE (DECL_TI_TEMPLATE (decl
)) == TEMPLATE_DECL
)
8958 decl
= DECL_TI_TEMPLATE (decl
);
8963 /* Return the most specialized of the class template specializations
8964 of TMPL which can produce an instantiation matching ARGS, or
8965 error_mark_node if the choice is ambiguous. */
8968 most_specialized_class (tmpl
, args
)
8972 tree list
= NULL_TREE
;
8977 tmpl
= most_general_template (tmpl
);
8978 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
); t
; t
= TREE_CHAIN (t
))
8981 = get_class_bindings (TREE_VALUE (t
), TREE_PURPOSE (t
), args
);
8984 list
= decl_tree_cons (TREE_PURPOSE (t
), TREE_VALUE (t
), list
);
8985 TREE_TYPE (list
) = TREE_TYPE (t
);
8995 for (; t
; t
= TREE_CHAIN (t
))
8997 fate
= more_specialized_class (champ
, t
);
9006 return error_mark_node
;
9012 for (t
= list
; t
&& t
!= champ
; t
= TREE_CHAIN (t
))
9014 fate
= more_specialized_class (champ
, t
);
9016 return error_mark_node
;
9022 /* called from the parser. */
9025 do_decl_instantiation (declspecs
, declarator
, storage
)
9026 tree declspecs
, declarator
, storage
;
9028 tree decl
= grokdeclarator (declarator
, declspecs
, NORMAL
, 0, NULL_TREE
);
9029 tree result
= NULL_TREE
;
9033 /* An error ocurred, for which grokdeclarator has already issued
9034 an appropriate message. */
9036 else if (! DECL_LANG_SPECIFIC (decl
))
9038 cp_error ("explicit instantiation of non-template `%#D'", decl
);
9041 else if (TREE_CODE (decl
) == VAR_DECL
)
9043 /* There is an asymmetry here in the way VAR_DECLs and
9044 FUNCTION_DECLs are handled by grokdeclarator. In the case of
9045 the latter, the DECL we get back will be marked as a
9046 template instantiation, and the appropriate
9047 DECL_TEMPLATE_INFO will be set up. This does not happen for
9048 VAR_DECLs so we do the lookup here. Probably, grokdeclarator
9049 should handle VAR_DECLs as it currently handles
9051 result
= lookup_field (DECL_CONTEXT (decl
), DECL_NAME (decl
), 0, 0);
9052 if (result
&& TREE_CODE (result
) != VAR_DECL
)
9054 cp_error ("no matching template for `%D' found", result
);
9058 else if (TREE_CODE (decl
) != FUNCTION_DECL
)
9060 cp_error ("explicit instantiation of `%#D'", decl
);
9066 /* Check for various error cases. Note that if the explicit
9067 instantiation is legal the RESULT will currently be marked as an
9068 *implicit* instantiation; DECL_EXPLICIT_INSTANTIATION is not set
9069 until we get here. */
9071 if (DECL_TEMPLATE_SPECIALIZATION (result
))
9075 No program shall both explicitly instantiate and explicitly
9076 specialize a template. */
9077 cp_pedwarn ("explicit instantiation of `%#D' after", result
);
9078 cp_pedwarn_at ("explicit specialization here", result
);
9081 else if (DECL_EXPLICIT_INSTANTIATION (result
))
9085 No program shall explicitly instantiate any template more
9088 We check DECL_INTERFACE_KNOWN so as not to complain when the first
9089 instantiation was `extern' and the second is not, and EXTERN_P for
9090 the opposite case. If -frepo, chances are we already got marked
9091 as an explicit instantion because of the repo file. */
9092 if (DECL_INTERFACE_KNOWN (result
) && !extern_p
&& !flag_use_repository
)
9093 cp_pedwarn ("duplicate explicit instantiation of `%#D'", result
);
9095 /* If we've already instantiated the template, just return now. */
9096 if (DECL_INTERFACE_KNOWN (result
))
9099 else if (!DECL_IMPLICIT_INSTANTIATION (result
))
9101 cp_error ("no matching template for `%D' found", result
);
9104 else if (!DECL_TEMPLATE_INFO (result
))
9106 cp_pedwarn ("explicit instantiation of non-template `%#D'", result
);
9110 if (flag_external_templates
)
9113 if (storage
== NULL_TREE
)
9115 else if (storage
== ridpointers
[(int) RID_EXTERN
])
9118 cp_pedwarn ("ANSI C++ forbids the use of `extern' on explicit instantiations");
9122 cp_error ("storage class `%D' applied to template instantiation",
9125 SET_DECL_EXPLICIT_INSTANTIATION (result
);
9126 mark_decl_instantiated (result
, extern_p
);
9127 repo_template_instantiated (result
, extern_p
);
9129 instantiate_decl (result
);
9133 mark_class_instantiated (t
, extern_p
)
9137 SET_CLASSTYPE_EXPLICIT_INSTANTIATION (t
);
9138 SET_CLASSTYPE_INTERFACE_KNOWN (t
);
9139 CLASSTYPE_INTERFACE_ONLY (t
) = extern_p
;
9140 CLASSTYPE_VTABLE_NEEDS_WRITING (t
) = ! extern_p
;
9141 TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (t
)) = extern_p
;
9144 CLASSTYPE_DEBUG_REQUESTED (t
) = 1;
9145 rest_of_type_compilation (t
, 1);
9150 do_type_instantiation (t
, storage
)
9157 if (TREE_CODE (t
) == TYPE_DECL
)
9160 if (! CLASS_TYPE_P (t
) || ! CLASSTYPE_TEMPLATE_INFO (t
))
9162 cp_error ("explicit instantiation of non-template type `%T'", t
);
9168 /* With -fexternal-templates, explicit instantiations are treated the same
9169 as implicit ones. */
9170 if (flag_external_templates
)
9173 if (TYPE_SIZE (t
) == NULL_TREE
)
9175 cp_error ("explicit instantiation of `%#T' before definition of template",
9180 if (storage
!= NULL_TREE
)
9183 cp_pedwarn("ANSI C++ forbids the use of `%s' on explicit instantiations",
9184 IDENTIFIER_POINTER (storage
));
9186 if (storage
== ridpointers
[(int) RID_INLINE
])
9188 else if (storage
== ridpointers
[(int) RID_EXTERN
])
9190 else if (storage
== ridpointers
[(int) RID_STATIC
])
9194 cp_error ("storage class `%D' applied to template instantiation",
9200 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
9204 No program shall both explicitly instantiate and explicitly
9205 specialize a template. */
9206 cp_error ("explicit instantiation of `%#T' after", t
);
9207 cp_error_at ("explicit specialization here", t
);
9210 else if (CLASSTYPE_EXPLICIT_INSTANTIATION (t
))
9214 No program shall explicitly instantiate any template more
9217 If CLASSTYPE_INTERFACE_ONLY, then the first explicit instantiation
9218 was `extern'. If EXTERN_P then the second is. If -frepo, chances
9219 are we already got marked as an explicit instantion because of the
9220 repo file. All these cases are OK. */
9221 if (!CLASSTYPE_INTERFACE_ONLY (t
) && !extern_p
&& !flag_use_repository
)
9222 cp_pedwarn ("duplicate explicit instantiation of `%#T'", t
);
9224 /* If we've already instantiated the template, just return now. */
9225 if (!CLASSTYPE_INTERFACE_ONLY (t
))
9229 mark_class_instantiated (t
, extern_p
);
9230 repo_template_instantiated (t
, extern_p
);
9238 /* In contrast to implicit instantiation, where only the
9239 declarations, and not the definitions, of members are
9240 instantiated, we have here:
9244 The explicit instantiation of a class template specialization
9245 implies the instantiation of all of its members not
9246 previously explicitly specialized in the translation unit
9247 containing the explicit instantiation.
9249 Of course, we can't instantiate member template classes, since
9250 we don't have any arguments for them. Note that the standard
9251 is unclear on whether the instatiation of the members are
9252 *explicit* instantiations or not. We choose to be generous,
9253 and not set DECL_EXPLICIT_INSTANTIATION. Therefore, we allow
9254 the explicit instantiation of a class where some of the members
9255 have no definition in the current translation unit. */
9258 for (tmp
= TYPE_METHODS (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
9259 if (TREE_CODE (tmp
) == FUNCTION_DECL
9260 && DECL_TEMPLATE_INSTANTIATION (tmp
))
9262 mark_decl_instantiated (tmp
, extern_p
);
9263 repo_template_instantiated (tmp
, extern_p
);
9265 instantiate_decl (tmp
);
9268 for (tmp
= TYPE_FIELDS (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
9269 if (TREE_CODE (tmp
) == VAR_DECL
&& DECL_TEMPLATE_INSTANTIATION (tmp
))
9271 mark_decl_instantiated (tmp
, extern_p
);
9272 repo_template_instantiated (tmp
, extern_p
);
9274 instantiate_decl (tmp
);
9277 for (tmp
= CLASSTYPE_TAGS (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
9278 if (IS_AGGR_TYPE (TREE_VALUE (tmp
))
9279 && !uses_template_parms (CLASSTYPE_TI_ARGS (TREE_VALUE (tmp
))))
9280 do_type_instantiation (TYPE_MAIN_DECL (TREE_VALUE (tmp
)), storage
);
9284 /* Given a function DECL, which is a specialization of TMPL, modify
9285 DECL to be a re-instantiation of TMPL with the same template
9286 arguments. TMPL should be the template into which tsubst'ing
9287 should occur for DECL, not the most general template.
9289 One reason for doing this is a scenario like this:
9292 void f(const T&, int i);
9294 void g() { f(3, 7); }
9297 void f(const T& t, const int i) { }
9299 Note that when the template is first instantiated, with
9300 instantiate_template, the resulting DECL will have no name for the
9301 first parameter, and the wrong type for the second. So, when we go
9302 to instantiate the DECL, we regenerate it. */
9305 regenerate_decl_from_template (decl
, tmpl
)
9315 args
= DECL_TI_ARGS (decl
);
9316 code_pattern
= DECL_TEMPLATE_RESULT (tmpl
);
9318 /* Unregister the specialization so that when we tsubst we will not
9319 just return DECL. We don't have to unregister DECL from TMPL
9320 because if would only be registered there if it were a partial
9321 instantiation of a specialization, which it isn't: it's a full
9323 gen_tmpl
= most_general_template (tmpl
);
9324 unregistered
= unregister_specialization (decl
, gen_tmpl
);
9326 /* If the DECL was not unregistered then something peculiar is
9327 happening: we created a specialization but did not call
9328 register_specialization for it. */
9329 my_friendly_assert (unregistered
, 0);
9331 if (TREE_CODE (decl
) == VAR_DECL
)
9332 /* Make sure that we can see identifiers, and compute access
9333 correctly, for the class members used in the declaration of
9334 this static variable. */
9335 pushclass (DECL_CONTEXT (decl
), 2);
9337 /* Do the substitution to get the new declaration. */
9338 new_decl
= tsubst (code_pattern
, args
, /*complain=*/1, NULL_TREE
);
9340 if (TREE_CODE (decl
) == VAR_DECL
)
9342 /* Set up DECL_INITIAL, since tsubst doesn't. */
9343 DECL_INITIAL (new_decl
) =
9344 tsubst_expr (DECL_INITIAL (code_pattern
), args
,
9345 /*complain=*/1, DECL_TI_TEMPLATE (decl
));
9346 /* Pop the class context we pushed above. */
9349 else if (TREE_CODE (decl
) == FUNCTION_DECL
)
9351 /* Convince duplicate_decls to use the DECL_ARGUMENTS from the
9353 DECL_INITIAL (new_decl
) = error_mark_node
;
9354 /* And don't complain about a duplicate definition. */
9355 DECL_INITIAL (decl
) = NULL_TREE
;
9358 /* The immediate parent of the new template is still whatever it was
9359 before, even though tsubst sets DECL_TI_TEMPLATE up as the most
9360 general template. We also reset the DECL_ASSEMBLER_NAME since
9361 tsubst always calculates the name as if the function in question
9362 were really a template instance, and sometimes, with friend
9363 functions, this is not so. See tsubst_friend_function for
9365 DECL_TI_TEMPLATE (new_decl
) = DECL_TI_TEMPLATE (decl
);
9366 DECL_ASSEMBLER_NAME (new_decl
) = DECL_ASSEMBLER_NAME (decl
);
9367 DECL_RTL (new_decl
) = DECL_RTL (decl
);
9369 /* Call duplicate decls to merge the old and new declarations. */
9370 duplicate_decls (new_decl
, decl
);
9372 /* Now, re-register the specialization. */
9373 register_specialization (decl
, gen_tmpl
, args
);
9376 /* Produce the definition of D, a _DECL generated from a template. */
9379 instantiate_decl (d
)
9382 tree tmpl
= DECL_TI_TEMPLATE (d
);
9383 tree args
= DECL_TI_ARGS (d
);
9388 int nested
= in_function_p ();
9389 int pattern_defined
;
9391 char *file
= input_filename
;
9392 tree old_fn
= current_function_decl
;
9394 /* This function should only be used to instantiate templates for
9395 functions and static member variables. */
9396 my_friendly_assert (TREE_CODE (d
) == FUNCTION_DECL
9397 || TREE_CODE (d
) == VAR_DECL
, 0);
9399 if (DECL_TEMPLATE_INSTANTIATED (d
))
9400 /* D has already been instantiated. It might seem reasonable to
9401 check whether or not D is an explict instantiation, and, if so,
9402 stop here. But when an explicit instantiation is deferred
9403 until the end of the compilation, DECL_EXPLICIT_INSTANTIATION
9404 is set, even though we still need to do the instantiation. */
9407 /* If we already have a specialization of this declaration, then
9408 there's no reason to instantiate it. Note that
9409 retrieve_specialization gives us both instantiations and
9410 specializations, so we must explicitly check
9411 DECL_TEMPLATE_SPECIALIZATION. */
9412 gen_tmpl
= most_general_template (tmpl
);
9413 spec
= retrieve_specialization (gen_tmpl
, args
);
9414 if (spec
!= NULL_TREE
&& DECL_TEMPLATE_SPECIALIZATION (spec
))
9417 /* This needs to happen before any tsubsting. */
9418 if (! push_tinst_level (d
))
9421 /* Set TD to the template whose DECL_TEMPLATE_RESULT is the pattern
9422 for the instantiation. This is not always the most general
9423 template. Consider, for example:
9426 struct S { template <class U> void f();
9427 template <> void f<int>(); };
9429 and an instantiation of S<double>::f<int>. We want TD to be the
9430 specialization S<T>::f<int>, not the more general S<T>::f<U>. */
9433 /* An instantiation cannot have a definition, so we need a
9434 more general template. */
9435 DECL_TEMPLATE_INSTANTIATION (td
)
9436 /* We must also deal with friend templates. Given:
9438 template <class T> struct S {
9439 template <class U> friend void f() {};
9442 S<int>::f<U> say, is not an instantiation of S<T>::f<U>,
9443 so far as the language is concerned, but that's still
9444 where we get the pattern for the instantiation from. On
9445 ther hand, if the definition comes outside the class, say:
9447 template <class T> struct S {
9448 template <class U> friend void f();
9450 template <class U> friend void f() {}
9452 we don't need to look any further. That's what the check for
9453 DECL_INITIAL is for. */
9454 || (TREE_CODE (d
) == FUNCTION_DECL
9455 && DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (td
)
9456 && !DECL_INITIAL (DECL_TEMPLATE_RESULT (td
)));
9459 /* The present template, TD, should not be a definition. If it
9460 were a definition, we should be using it! Note that we
9461 cannot restructure the loop to just keep going until we find
9462 a template with a definition, since that might go too far if
9463 a specialization was declared, but not defined. */
9464 my_friendly_assert (!(TREE_CODE (d
) == VAR_DECL
9465 && !DECL_IN_AGGR_P (DECL_TEMPLATE_RESULT (td
))),
9468 /* Fetch the more general template. */
9469 td
= DECL_TI_TEMPLATE (td
);
9472 code_pattern
= DECL_TEMPLATE_RESULT (td
);
9474 if (TREE_CODE (d
) == FUNCTION_DECL
)
9475 pattern_defined
= (DECL_SAVED_TREE (code_pattern
) != NULL_TREE
);
9477 pattern_defined
= ! DECL_IN_AGGR_P (code_pattern
);
9479 push_to_top_level ();
9480 lineno
= DECL_SOURCE_LINE (d
);
9481 input_filename
= DECL_SOURCE_FILE (d
);
9483 if (pattern_defined
)
9485 repo_template_used (d
);
9487 if (flag_external_templates
&& ! DECL_INTERFACE_KNOWN (d
))
9489 if (flag_alt_external_templates
)
9491 if (interface_unknown
)
9492 warn_if_unknown_interface (d
);
9494 else if (DECL_INTERFACE_KNOWN (code_pattern
))
9496 DECL_INTERFACE_KNOWN (d
) = 1;
9497 DECL_NOT_REALLY_EXTERN (d
) = ! DECL_EXTERNAL (code_pattern
);
9500 warn_if_unknown_interface (code_pattern
);
9504 import_export_decl (d
);
9507 /* Reject all external templates except inline functions. */
9508 if (DECL_INTERFACE_KNOWN (d
)
9509 && ! DECL_NOT_REALLY_EXTERN (d
)
9510 && ! (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_INLINE (d
)))
9513 if (TREE_CODE (d
) == VAR_DECL
9514 && TREE_READONLY (d
)
9515 && DECL_INITIAL (d
) == NULL_TREE
9516 && DECL_INITIAL (code_pattern
) != NULL_TREE
)
9517 /* We need to set up DECL_INITIAL regardless of pattern_defined if
9518 the variable is a static const initialized in the class body. */;
9519 else if (pattern_defined
&& nested
9520 && TREE_CODE (d
) == FUNCTION_DECL
&& DECL_INLINE (d
))
9521 /* An inline function used in another function; instantiate it now so
9522 we can inline it. */;
9523 else if (! pattern_defined
|| ! at_eof
)
9525 /* Defer all other templates. We restore the source position
9526 here because it's used by add_pending_template. */
9528 input_filename
= file
;
9530 if (at_eof
&& !pattern_defined
9531 && DECL_EXPLICIT_INSTANTIATION (d
))
9534 The definition of a non-exported function template, a
9535 non-exported member function template, or a non-exported
9536 member function or static data member of a class template
9537 shall be present in every translation unit in which it is
9538 explicitly instantiated. */
9539 cp_error ("explicit instantiation of `%D' but no definition available",
9542 add_pending_template (d
);
9546 /* If this instantiation is COMDAT, we don't know whether or not we
9547 will really need to write it out. If we can't be sure, mark it
9548 DECL_DEFER_OUTPUT. NOTE: This increases memory consumption,
9549 since we keep some instantiations in memory rather than write
9550 them out immediately and forget them. A better approach would be
9551 to wait until we know we need them to do the instantiation, but
9552 that would break templates with static locals, because we
9553 generate the functions to destroy statics before we determine
9554 which functions are needed. A better solution would be to
9555 generate the ctor and dtor functions as we go. */
9557 if (TREE_CODE (d
) == FUNCTION_DECL
9559 && ! DECL_NEEDED_P (d
)
9560 /* If the function that caused us to be instantiated is needed, we
9561 will be needed, too. */
9562 && (! nested
|| (old_fn
&& ! DECL_NEEDED_P (old_fn
))))
9563 DECL_DEFER_OUTPUT (d
) = 1;
9565 /* We're now committed to instantiating this template. Mark it as
9566 instantiated so that recursive calls to instantiate_decl do not
9567 try to instantiate it again. */
9568 DECL_TEMPLATE_INSTANTIATED (d
) = 1;
9570 /* Regenerate the declaration in case the template has been modified
9571 by a subsequent redeclaration. */
9572 regenerate_decl_from_template (d
, td
);
9574 /* We already set the file and line above. Reset them now in case
9575 they changed as a result of calling regenerate_decl_from_template. */
9576 lineno
= DECL_SOURCE_LINE (d
);
9577 input_filename
= DECL_SOURCE_FILE (d
);
9579 if (TREE_CODE (d
) == VAR_DECL
)
9581 DECL_IN_AGGR_P (d
) = 0;
9582 if (DECL_INTERFACE_KNOWN (d
))
9583 DECL_EXTERNAL (d
) = ! DECL_NOT_REALLY_EXTERN (d
);
9586 DECL_EXTERNAL (d
) = 1;
9587 DECL_NOT_REALLY_EXTERN (d
) = 1;
9589 cp_finish_decl (d
, DECL_INITIAL (d
), NULL_TREE
, 0);
9591 else if (TREE_CODE (d
) == FUNCTION_DECL
)
9593 /* Set up context. */
9594 start_function (NULL_TREE
, d
, NULL_TREE
, SF_PRE_PARSED
);
9595 store_parm_decls ();
9597 /* We already set up __FUNCTION__, etc., so we don't want to do
9599 current_function_name_declared
= 1;
9601 /* Substitute into the body of the function. */
9602 tsubst_expr (DECL_SAVED_TREE (code_pattern
), args
,
9603 /*complain=*/1, tmpl
);
9605 /* Finish the function. */
9606 expand_body (finish_function (lineno
, 0));
9611 input_filename
= file
;
9613 pop_from_top_level ();
9619 /* Run through the list of templates that we wish we could
9620 instantiate, and instantiate any we can. */
9623 instantiate_pending_templates ()
9626 int instantiated_something
= 0;
9633 t
= &pending_templates
;
9636 tree srcloc
= TREE_PURPOSE (*t
);
9637 tree instantiation
= TREE_VALUE (*t
);
9639 input_filename
= SRCLOC_FILE (srcloc
);
9640 lineno
= SRCLOC_LINE (srcloc
);
9642 if (TREE_CODE_CLASS (TREE_CODE (instantiation
)) == 't')
9646 if (!TYPE_SIZE (instantiation
))
9648 instantiate_class_template (instantiation
);
9649 if (CLASSTYPE_TEMPLATE_INSTANTIATION (instantiation
))
9650 for (fn
= TYPE_METHODS (instantiation
);
9652 fn
= TREE_CHAIN (fn
))
9653 if (! DECL_ARTIFICIAL (fn
))
9654 instantiate_decl (fn
);
9655 if (TYPE_SIZE (instantiation
))
9657 instantiated_something
= 1;
9662 if (TYPE_SIZE (instantiation
))
9663 /* If INSTANTIATION has been instantiated, then we don't
9664 need to consider it again in the future. */
9665 *t
= TREE_CHAIN (*t
);
9667 t
= &TREE_CHAIN (*t
);
9671 if (DECL_TEMPLATE_INSTANTIATION (instantiation
)
9672 && !DECL_TEMPLATE_INSTANTIATED (instantiation
))
9674 instantiation
= instantiate_decl (instantiation
);
9675 if (DECL_TEMPLATE_INSTANTIATED (instantiation
))
9677 instantiated_something
= 1;
9682 if (!DECL_TEMPLATE_INSTANTIATION (instantiation
)
9683 || DECL_TEMPLATE_INSTANTIATED (instantiation
))
9684 /* If INSTANTIATION has been instantiated, then we don't
9685 need to consider it again in the future. */
9686 *t
= TREE_CHAIN (*t
);
9688 t
= &TREE_CHAIN (*t
);
9693 /* Go through the things that are template instantiations if we are
9694 using guiding declarations. */
9695 t
= &maybe_templates
;
9702 fn
= TREE_VALUE (*t
);
9704 if (DECL_INITIAL (fn
))
9705 /* If the FN is already defined, then it was either already
9706 instantiated or, even though guiding declarations were
9707 allowed, a non-template definition was provided. */
9711 template = TREE_PURPOSE (*t
);
9712 args
= get_bindings (template, fn
, NULL_TREE
);
9713 fn
= instantiate_template (template, args
);
9714 instantiate_decl (fn
);
9718 /* Remove this entry from the chain. */
9719 *t
= TREE_CHAIN (*t
);
9721 maybe_template_tail
= t
;
9725 return instantiated_something
;
9728 /* Substitute ARGVEC into T, which is a TREE_LIST. In particular, it
9729 is an initializer list: the TREE_PURPOSEs are DECLs, and the
9730 TREE_VALUEs are initializer values. Used by instantiate_decl. */
9733 tsubst_expr_values (t
, argvec
)
9736 tree first
= NULL_TREE
;
9739 for (; t
; t
= TREE_CHAIN (t
))
9741 tree pur
= tsubst_copy (TREE_PURPOSE (t
), argvec
,
9742 /*complain=*/1, NULL_TREE
);
9743 tree val
= tsubst_expr (TREE_VALUE (t
), argvec
, /*complain=*/1,
9745 *p
= build_tree_list (pur
, val
);
9746 p
= &TREE_CHAIN (*p
);
9751 /* D is an undefined function declaration in the presence of templates with
9752 the same name, listed in FNS. If one of them can produce D as an
9753 instantiation, remember this so we can instantiate it at EOF if D has
9754 not been defined by that time. */
9757 add_maybe_template (d
, fns
)
9762 if (DECL_MAYBE_TEMPLATE (d
))
9765 t
= most_specialized (fns
, d
, NULL_TREE
);
9768 if (t
== error_mark_node
)
9770 cp_error ("ambiguous template instantiation for `%D'", d
);
9774 *maybe_template_tail
= tree_cons (t
, d
, NULL_TREE
);
9775 maybe_template_tail
= &TREE_CHAIN (*maybe_template_tail
);
9776 DECL_MAYBE_TEMPLATE (d
) = 1;
9779 /* Set CURRENT_ACCESS_SPECIFIER based on the protection of DECL. */
9782 set_current_access_from_decl (decl
)
9785 if (TREE_PRIVATE (decl
))
9786 current_access_specifier
= access_private_node
;
9787 else if (TREE_PROTECTED (decl
))
9788 current_access_specifier
= access_protected_node
;
9790 current_access_specifier
= access_public_node
;
9793 /* Instantiate an enumerated type. TAG is the template type, NEWTAG
9794 is the instantiation (which should have been created with
9795 start_enum) and ARGS are the template arguments to use. */
9798 tsubst_enum (tag
, newtag
, args
)
9805 for (e
= TYPE_VALUES (tag
); e
; e
= TREE_CHAIN (e
))
9809 /* Note that in a template enum, the TREE_VALUE is the
9810 CONST_DECL, not the corresponding INTEGER_CST. */
9811 value
= tsubst_expr (DECL_INITIAL (TREE_VALUE (e
)),
9812 args
, /*complain=*/1,
9815 /* Give this enumeration constant the correct access. */
9816 set_current_access_from_decl (TREE_VALUE (e
));
9818 /* Actually build the enumerator itself. */
9819 build_enumerator (TREE_PURPOSE (e
), value
, newtag
);
9822 finish_enum (newtag
);
9825 /* Set the DECL_ASSEMBLER_NAME for DECL, which is a FUNCTION_DECL that
9826 is either an instantiation or specialization of a template
9830 set_mangled_name_for_template_decl (decl
)
9833 tree saved_namespace
;
9834 tree context
= NULL_TREE
;
9843 my_friendly_assert (TREE_CODE (decl
) == FUNCTION_DECL
, 0);
9844 my_friendly_assert (DECL_TEMPLATE_INFO (decl
) != NULL_TREE
, 0);
9846 /* The names of template functions must be mangled so as to indicate
9847 what template is being specialized with what template arguments.
9848 For example, each of the following three functions must get
9849 different mangled names:
9852 template <> void f<7>(int);
9853 template <> void f<8>(int); */
9855 targs
= DECL_TI_ARGS (decl
);
9856 if (uses_template_parms (targs
))
9857 /* This DECL is for a partial instantiation. There's no need to
9858 mangle the name of such an entity. */
9861 tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
9862 tparms
= DECL_TEMPLATE_PARMS (tmpl
);
9863 parm_depth
= TMPL_PARMS_DEPTH (tparms
);
9865 /* There should be as many levels of arguments as there are levels
9867 my_friendly_assert (parm_depth
== TMPL_ARGS_DEPTH (targs
), 0);
9869 /* We now compute the PARMS and RET_TYPE to give to
9870 build_decl_overload_real. The PARMS and RET_TYPE are the
9871 parameter and return types of the template, after all but the
9872 innermost template arguments have been substituted, not the
9873 parameter and return types of the function DECL. For example,
9876 template <class T> T f(T);
9878 both PARMS and RET_TYPE should be `T' even if DECL is `int f(int)'.
9879 A more subtle example is:
9881 template <class T> struct S { template <class U> void f(T, U); }
9883 Here, if DECL is `void S<int>::f(int, double)', PARMS should be
9884 {int, U}. Thus, the args that we want to subsitute into the
9885 return and parameter type for the function are those in TARGS,
9886 with the innermost level omitted. */
9887 fn_type
= TREE_TYPE (tmpl
);
9888 if (DECL_STATIC_FUNCTION_P (decl
))
9889 context
= DECL_CLASS_CONTEXT (decl
);
9891 if (parm_depth
== 1)
9892 /* No substitution is necessary. */
9899 /* Replace the innermost level of the TARGS with NULL_TREEs to
9900 let tsubst know not to subsitute for those parameters. */
9901 partial_args
= make_tree_vec (TREE_VEC_LENGTH (targs
));
9902 for (i
= 1; i
< TMPL_ARGS_DEPTH (targs
); ++i
)
9903 SET_TMPL_ARGS_LEVEL (partial_args
, i
,
9904 TMPL_ARGS_LEVEL (targs
, i
));
9905 SET_TMPL_ARGS_LEVEL (partial_args
,
9906 TMPL_ARGS_DEPTH (targs
),
9907 make_tree_vec (DECL_NTPARMS (tmpl
)));
9909 /* Now, do the (partial) substitution to figure out the
9910 appropriate function type. */
9911 fn_type
= tsubst (fn_type
, partial_args
, /*complain=*/1, NULL_TREE
);
9912 if (DECL_STATIC_FUNCTION_P (decl
))
9913 context
= tsubst (context
, partial_args
, /*complain=*/1, NULL_TREE
);
9915 /* Substitute into the template parameters to obtain the real
9916 innermost set of parameters. This step is important if the
9917 innermost set of template parameters contains value
9918 parameters whose types depend on outer template parameters. */
9919 TREE_VEC_LENGTH (partial_args
)--;
9920 tparms
= tsubst_template_parms (tparms
, partial_args
, /*complain=*/1);
9923 /* Now, get the innermost parameters and arguments, and figure out
9924 the parameter and return types. */
9925 tparms
= INNERMOST_TEMPLATE_PARMS (tparms
);
9926 targs
= innermost_args (targs
);
9927 ret_type
= TREE_TYPE (fn_type
);
9928 parm_types
= TYPE_ARG_TYPES (fn_type
);
9930 /* For a static member function, we generate a fake `this' pointer,
9931 for the purposes of mangling. This indicates of which class the
9932 function is a member. Because of:
9936 There shall not be a static and a nonstatic member function
9937 with the same name and the same parameter types
9939 we don't have to worry that this will result in a clash with a
9940 non-static member function. */
9941 if (DECL_STATIC_FUNCTION_P (decl
))
9942 parm_types
= hash_tree_chain (build_pointer_type (context
), parm_types
);
9944 /* There should be the same number of template parameters as
9945 template arguments. */
9946 my_friendly_assert (TREE_VEC_LENGTH (tparms
) == TREE_VEC_LENGTH (targs
),
9949 /* If the template is in a namespace, we need to put that into the
9950 mangled name. Unfortunately, build_decl_overload_real does not
9951 get the decl to mangle, so it relies on the current
9952 namespace. Therefore, we set that here temporarily. */
9953 my_friendly_assert (TREE_CODE_CLASS (TREE_CODE (decl
)) == 'd', 980702);
9954 saved_namespace
= current_namespace
;
9955 current_namespace
= CP_DECL_CONTEXT (decl
);
9957 /* Actually set the DCL_ASSEMBLER_NAME. */
9958 DECL_ASSEMBLER_NAME (decl
)
9959 = build_decl_overload_real (DECL_NAME (decl
), parm_types
, ret_type
,
9961 DECL_FUNCTION_MEMBER_P (decl
)
9962 + DECL_CONSTRUCTOR_P (decl
));
9964 /* Restore the previously active namespace. */
9965 current_namespace
= saved_namespace
;