1 /* Handle parameterized types (templates) for GNU C++.
2 Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000
3 Free Software Foundation, Inc.
4 Written by Ken Raeburn (raeburn@cygnus.com) while at Watchmaker Computing.
5 Rewritten by Jason Merrill (jason@cygnus.com).
7 This file is part of GNU CC.
9 GNU CC is free software; you can redistribute it and/or modify
10 it under the terms of the GNU General Public License as published by
11 the Free Software Foundation; either version 2, or (at your option)
14 GNU CC is distributed in the hope that it will be useful,
15 but WITHOUT ANY WARRANTY; without even the implied warranty of
16 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 GNU General Public License for more details.
19 You should have received a copy of the GNU General Public License
20 along with GNU CC; see the file COPYING. If not, write to
21 the Free Software Foundation, 59 Temple Place - Suite 330,
22 Boston, MA 02111-1307, USA. */
24 /* Known bugs or deficiencies include:
26 all methods must be provided in header files; can't use a source
27 file that contains only the method templates and "just win". */
48 /* The type of functions taking a tree, and some additional data, and
50 typedef int (*tree_fn_t
) PARAMS ((tree
, void*));
52 extern struct obstack permanent_obstack
;
54 /* The PENDING_TEMPLATES is a TREE_LIST of templates whose
55 instantiations have been deferred, either because their definitions
56 were not yet available, or because we were putting off doing the
57 work. The TREE_PURPOSE of each entry is a SRCLOC indicating where
58 the instantiate request occurred; the TREE_VALUE is a either a DECL
59 (for a function or static data member), or a TYPE (for a class)
60 indicating what we are hoping to instantiate. */
61 static tree pending_templates
;
62 static tree
*template_tail
= &pending_templates
;
64 static tree maybe_templates
;
65 static tree
*maybe_template_tail
= &maybe_templates
;
67 int processing_template_parmlist
;
68 static int template_header_count
;
70 static tree saved_trees
;
71 static varray_type inline_parm_levels
;
72 static size_t inline_parm_levels_used
;
74 /* A map from local variable declarations in the body of the template
75 presently being instantiated to the corresponding instantiated
77 static htab_t local_specializations
;
79 #define obstack_chunk_alloc xmalloc
80 #define obstack_chunk_free free
82 #define UNIFY_ALLOW_NONE 0
83 #define UNIFY_ALLOW_MORE_CV_QUAL 1
84 #define UNIFY_ALLOW_LESS_CV_QUAL 2
85 #define UNIFY_ALLOW_DERIVED 4
86 #define UNIFY_ALLOW_INTEGER 8
88 #define GTB_VIA_VIRTUAL 1 /* The base class we are examining is
89 virtual, or a base class of a virtual
91 #define GTB_IGNORE_TYPE 2 /* We don't need to try to unify the current
92 type with the desired type. */
94 static int resolve_overloaded_unification
PARAMS ((tree
, tree
, tree
, tree
,
95 unification_kind_t
, int));
96 static int try_one_overload
PARAMS ((tree
, tree
, tree
, tree
, tree
,
97 unification_kind_t
, int));
98 static int unify
PARAMS ((tree
, tree
, tree
, tree
, int));
99 static void add_pending_template
PARAMS ((tree
));
100 static int push_tinst_level
PARAMS ((tree
));
101 static tree classtype_mangled_name
PARAMS ((tree
));
102 static char *mangle_class_name_for_template
PARAMS ((char *, tree
, tree
));
103 static tree tsubst_expr_values
PARAMS ((tree
, tree
));
104 static int list_eq
PARAMS ((tree
, tree
));
105 static tree get_class_bindings
PARAMS ((tree
, tree
, tree
));
106 static tree coerce_template_parms
PARAMS ((tree
, tree
, tree
, int, int));
107 static void tsubst_enum
PARAMS ((tree
, tree
, tree
));
108 static tree add_to_template_args
PARAMS ((tree
, tree
));
109 static tree add_outermost_template_args
PARAMS ((tree
, tree
));
110 static void maybe_adjust_types_for_deduction
PARAMS ((unification_kind_t
, tree
*,
112 static int type_unification_real
PARAMS ((tree
, tree
, tree
, tree
,
113 int, unification_kind_t
, int));
114 static void note_template_header
PARAMS ((int));
115 static tree maybe_fold_nontype_arg
PARAMS ((tree
));
116 static tree convert_nontype_argument
PARAMS ((tree
, tree
));
117 static tree convert_template_argument
PARAMS ((tree
, tree
, tree
, int,
119 static tree get_bindings_overload
PARAMS ((tree
, tree
, tree
));
120 static int for_each_template_parm
PARAMS ((tree
, tree_fn_t
, void*));
121 static tree build_template_parm_index
PARAMS ((int, int, int, tree
, tree
));
122 static int inline_needs_template_parms
PARAMS ((tree
));
123 static void push_inline_template_parms_recursive
PARAMS ((tree
, int));
124 static tree retrieve_specialization
PARAMS ((tree
, tree
));
125 static tree retrieve_local_specialization
PARAMS ((tree
));
126 static tree register_specialization
PARAMS ((tree
, tree
, tree
));
127 static tree register_local_specialization
PARAMS ((tree
, tree
));
128 static int unregister_specialization
PARAMS ((tree
, tree
));
129 static tree reduce_template_parm_level
PARAMS ((tree
, tree
, int));
130 static tree build_template_decl
PARAMS ((tree
, tree
));
131 static int mark_template_parm
PARAMS ((tree
, void *));
132 static tree tsubst_friend_function
PARAMS ((tree
, tree
));
133 static tree tsubst_friend_class
PARAMS ((tree
, tree
));
134 static tree get_bindings_real
PARAMS ((tree
, tree
, tree
, int));
135 static int template_decl_level
PARAMS ((tree
));
136 static tree maybe_get_template_decl_from_type_decl
PARAMS ((tree
));
137 static int check_cv_quals_for_unify
PARAMS ((int, tree
, tree
));
138 static tree tsubst_template_arg_vector
PARAMS ((tree
, tree
, int));
139 static tree tsubst_template_parms
PARAMS ((tree
, tree
, int));
140 static void regenerate_decl_from_template
PARAMS ((tree
, tree
));
141 static tree most_specialized
PARAMS ((tree
, tree
, tree
));
142 static tree most_specialized_class
PARAMS ((tree
, tree
));
143 static void set_mangled_name_for_template_decl
PARAMS ((tree
));
144 static int template_class_depth_real
PARAMS ((tree
, int));
145 static tree tsubst_aggr_type
PARAMS ((tree
, tree
, int, tree
, int));
146 static tree tsubst_decl
PARAMS ((tree
, tree
, tree
, tree
));
147 static tree tsubst_arg_types
PARAMS ((tree
, tree
, int, tree
));
148 static tree tsubst_function_type
PARAMS ((tree
, tree
, int, tree
));
149 static void check_specialization_scope
PARAMS ((void));
150 static tree process_partial_specialization
PARAMS ((tree
));
151 static void set_current_access_from_decl
PARAMS ((tree
));
152 static void check_default_tmpl_args
PARAMS ((tree
, tree
, int, int));
153 static tree tsubst_call_declarator_parms
PARAMS ((tree
, tree
, int, tree
));
154 static tree get_template_base_recursive
PARAMS ((tree
, tree
,
155 tree
, tree
, tree
, int));
156 static tree get_template_base
PARAMS ((tree
, tree
, tree
, tree
));
157 static tree try_class_unification
PARAMS ((tree
, tree
, tree
, tree
));
158 static int coerce_template_template_parms
PARAMS ((tree
, tree
, int,
160 static tree determine_specialization
PARAMS ((tree
, tree
, tree
*, int));
161 static int template_args_equal
PARAMS ((tree
, tree
));
162 static void print_template_context
PARAMS ((int));
163 static void tsubst_default_arguments
PARAMS ((tree
));
164 static tree for_each_template_parm_r
PARAMS ((tree
*, int *, void *));
165 static tree instantiate_clone
PARAMS ((tree
, tree
));
167 /* Called once to initialize pt.c. */
172 ggc_add_tree_root (&pending_templates
, 1);
173 ggc_add_tree_root (&maybe_templates
, 1);
174 ggc_add_tree_root (&saved_trees
, 1);
177 /* Do any processing required when DECL (a member template declaration
178 using TEMPLATE_PARAMETERS as its innermost parameter list) is
179 finished. Returns the TEMPLATE_DECL corresponding to DECL, unless
180 it is a specialization, in which case the DECL itself is returned. */
183 finish_member_template_decl (decl
)
186 if (decl
== NULL_TREE
|| decl
== void_type_node
)
188 else if (decl
== error_mark_node
)
189 /* By returning NULL_TREE, the parser will just ignore this
190 declaration. We have already issued the error. */
192 else if (TREE_CODE (decl
) == TREE_LIST
)
194 /* Assume that the class is the only declspec. */
195 decl
= TREE_VALUE (decl
);
196 if (IS_AGGR_TYPE (decl
) && CLASSTYPE_TEMPLATE_INFO (decl
)
197 && ! CLASSTYPE_TEMPLATE_SPECIALIZATION (decl
))
199 tree tmpl
= CLASSTYPE_TI_TEMPLATE (decl
);
200 check_member_template (tmpl
);
205 else if (TREE_CODE (decl
) == FIELD_DECL
)
206 cp_error ("data member `%D' cannot be a member template", decl
);
207 else if (DECL_TEMPLATE_INFO (decl
))
209 if (!DECL_TEMPLATE_SPECIALIZATION (decl
))
211 check_member_template (DECL_TI_TEMPLATE (decl
));
212 return DECL_TI_TEMPLATE (decl
);
218 cp_error ("invalid member template declaration `%D'", decl
);
220 return error_mark_node
;
223 /* Returns the template nesting level of the indicated class TYPE.
233 A<T>::B<U> has depth two, while A<T> has depth one.
234 Both A<T>::B<int> and A<int>::B<U> have depth one, if
235 COUNT_SPECIALIZATIONS is 0 or if they are instantiations, not
238 This function is guaranteed to return 0 if passed NULL_TREE so
239 that, for example, `template_class_depth (current_class_type)' is
243 template_class_depth_real (type
, count_specializations
)
245 int count_specializations
;
250 type
&& TREE_CODE (type
) != NAMESPACE_DECL
;
251 type
= (TREE_CODE (type
) == FUNCTION_DECL
)
252 ? CP_DECL_CONTEXT (type
) : TYPE_CONTEXT (type
))
254 if (TREE_CODE (type
) != FUNCTION_DECL
)
256 if (CLASSTYPE_TEMPLATE_INFO (type
)
257 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (type
))
258 && ((count_specializations
259 && CLASSTYPE_TEMPLATE_SPECIALIZATION (type
))
260 || uses_template_parms (CLASSTYPE_TI_ARGS (type
))))
265 if (DECL_TEMPLATE_INFO (type
)
266 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (type
))
267 && ((count_specializations
268 && DECL_TEMPLATE_SPECIALIZATION (type
))
269 || uses_template_parms (DECL_TI_ARGS (type
))))
277 /* Returns the template nesting level of the indicated class TYPE.
278 Like template_class_depth_real, but instantiations do not count in
282 template_class_depth (type
)
285 return template_class_depth_real (type
, /*count_specializations=*/0);
288 /* Returns 1 if processing DECL as part of do_pending_inlines
289 needs us to push template parms. */
292 inline_needs_template_parms (decl
)
295 if (! DECL_TEMPLATE_INFO (decl
))
298 return (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (most_general_template (decl
)))
299 > (processing_template_decl
+ DECL_TEMPLATE_SPECIALIZATION (decl
)));
302 /* Subroutine of maybe_begin_member_template_processing.
303 Push the template parms in PARMS, starting from LEVELS steps into the
304 chain, and ending at the beginning, since template parms are listed
308 push_inline_template_parms_recursive (parmlist
, levels
)
312 tree parms
= TREE_VALUE (parmlist
);
316 push_inline_template_parms_recursive (TREE_CHAIN (parmlist
), levels
- 1);
318 ++processing_template_decl
;
319 current_template_parms
320 = tree_cons (build_int_2 (0, processing_template_decl
),
321 parms
, current_template_parms
);
322 TEMPLATE_PARMS_FOR_INLINE (current_template_parms
) = 1;
325 for (i
= 0; i
< TREE_VEC_LENGTH (parms
); ++i
)
327 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
328 my_friendly_assert (DECL_P (parm
), 0);
330 switch (TREE_CODE (parm
))
339 /* Make a CONST_DECL as is done in process_template_parm.
340 It is ugly that we recreate this here; the original
341 version built in process_template_parm is no longer
343 tree decl
= build_decl (CONST_DECL
, DECL_NAME (parm
),
345 SET_DECL_ARTIFICIAL (decl
);
346 DECL_INITIAL (decl
) = DECL_INITIAL (parm
);
347 SET_DECL_TEMPLATE_PARM_P (decl
);
353 my_friendly_abort (0);
358 /* Restore the template parameter context for a member template or
359 a friend template defined in a class definition. */
362 maybe_begin_member_template_processing (decl
)
368 if (inline_needs_template_parms (decl
))
370 parms
= DECL_TEMPLATE_PARMS (most_general_template (decl
));
371 levels
= TMPL_PARMS_DEPTH (parms
) - processing_template_decl
;
373 if (DECL_TEMPLATE_SPECIALIZATION (decl
))
376 parms
= TREE_CHAIN (parms
);
379 push_inline_template_parms_recursive (parms
, levels
);
382 /* Remember how many levels of template parameters we pushed so that
383 we can pop them later. */
384 if (!inline_parm_levels
)
385 VARRAY_INT_INIT (inline_parm_levels
, 4, "inline_parm_levels");
386 if (inline_parm_levels_used
== inline_parm_levels
->num_elements
)
387 VARRAY_GROW (inline_parm_levels
, 2 * inline_parm_levels_used
);
388 VARRAY_INT (inline_parm_levels
, inline_parm_levels_used
) = levels
;
389 ++inline_parm_levels_used
;
392 /* Undo the effects of begin_member_template_processing. */
395 maybe_end_member_template_processing ()
399 if (!inline_parm_levels_used
)
402 --inline_parm_levels_used
;
404 i
< VARRAY_INT (inline_parm_levels
, inline_parm_levels_used
);
407 --processing_template_decl
;
408 current_template_parms
= TREE_CHAIN (current_template_parms
);
413 /* Returns non-zero iff T is a member template function. We must be
416 template <class T> class C { void f(); }
418 Here, f is a template function, and a member, but not a member
419 template. This function does not concern itself with the origin of
420 T, only its present state. So if we have
422 template <class T> class C { template <class U> void f(U); }
424 then neither C<int>::f<char> nor C<T>::f<double> is considered
425 to be a member template. But, `template <class U> void
426 C<int>::f(U)' is considered a member template. */
429 is_member_template (t
)
432 if (!DECL_FUNCTION_TEMPLATE_P (t
))
433 /* Anything that isn't a function or a template function is
434 certainly not a member template. */
437 /* A local class can't have member templates. */
438 if (decl_function_context (t
))
441 return (DECL_FUNCTION_MEMBER_P (DECL_TEMPLATE_RESULT (t
))
442 /* If there are more levels of template parameters than
443 there are template classes surrounding the declaration,
444 then we have a member template. */
445 && (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (t
)) >
446 template_class_depth (DECL_CONTEXT (t
))));
450 /* Returns non-zero iff T is a member template class. See
451 is_member_template for a description of what precisely constitutes
452 a member template. */
455 is_member_template_class (t
)
458 if (!DECL_CLASS_TEMPLATE_P (t
))
459 /* Anything that isn't a class template, is certainly not a member
463 if (!DECL_CLASS_SCOPE_P (t
))
464 /* Anything whose context isn't a class type is surely not a
468 /* If there are more levels of template parameters than there are
469 template classes surrounding the declaration, then we have a
471 return (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (t
)) >
472 template_class_depth (DECL_CONTEXT (t
)));
476 /* Return a new template argument vector which contains all of ARGS,
477 but has as its innermost set of arguments the EXTRA_ARGS. The
478 resulting vector will be built on a temporary obstack, and so must
479 be explicitly copied to the permanent obstack, if required. */
482 add_to_template_args (args
, extra_args
)
491 extra_depth
= TMPL_ARGS_DEPTH (extra_args
);
492 new_args
= make_tree_vec (TMPL_ARGS_DEPTH (args
) + extra_depth
);
494 for (i
= 1; i
<= TMPL_ARGS_DEPTH (args
); ++i
)
495 SET_TMPL_ARGS_LEVEL (new_args
, i
, TMPL_ARGS_LEVEL (args
, i
));
497 for (j
= 1; j
<= extra_depth
; ++j
, ++i
)
498 SET_TMPL_ARGS_LEVEL (new_args
, i
, TMPL_ARGS_LEVEL (extra_args
, j
));
503 /* Like add_to_template_args, but only the outermost ARGS are added to
504 the EXTRA_ARGS. In particular, all but TMPL_ARGS_DEPTH
505 (EXTRA_ARGS) levels are added. This function is used to combine
506 the template arguments from a partial instantiation with the
507 template arguments used to attain the full instantiation from the
508 partial instantiation. */
511 add_outermost_template_args (args
, extra_args
)
517 /* If there are more levels of EXTRA_ARGS than there are ARGS,
518 something very fishy is going on. */
519 my_friendly_assert (TMPL_ARGS_DEPTH (args
) >= TMPL_ARGS_DEPTH (extra_args
),
522 /* If *all* the new arguments will be the EXTRA_ARGS, just return
524 if (TMPL_ARGS_DEPTH (args
) == TMPL_ARGS_DEPTH (extra_args
))
527 /* For the moment, we make ARGS look like it contains fewer levels. */
528 TREE_VEC_LENGTH (args
) -= TMPL_ARGS_DEPTH (extra_args
);
530 new_args
= add_to_template_args (args
, extra_args
);
532 /* Now, we restore ARGS to its full dimensions. */
533 TREE_VEC_LENGTH (args
) += TMPL_ARGS_DEPTH (extra_args
);
538 /* We've got a template header coming up; push to a new level for storing
542 begin_template_parm_list ()
544 /* We use a non-tag-transparent scope here, which causes pushtag to
545 put tags in this scope, rather than in the enclosing class or
546 namespace scope. This is the right thing, since we want
547 TEMPLATE_DECLS, and not TYPE_DECLS for template classes. For a
548 global template class, push_template_decl handles putting the
549 TEMPLATE_DECL into top-level scope. For a nested template class,
552 template <class T> struct S1 {
553 template <class T> struct S2 {};
556 pushtag contains special code to call pushdecl_with_scope on the
557 TEMPLATE_DECL for S2. */
558 begin_scope (sk_template_parms
);
559 ++processing_template_decl
;
560 ++processing_template_parmlist
;
561 note_template_header (0);
564 /* This routine is called when a specialization is declared. If it is
565 illegal to declare a specialization here, an error is reported. */
568 check_specialization_scope ()
570 tree scope
= current_scope ();
574 An explicit specialization shall be declared in the namespace of
575 which the template is a member, or, for member templates, in the
576 namespace of which the enclosing class or enclosing class
577 template is a member. An explicit specialization of a member
578 function, member class or static data member of a class template
579 shall be declared in the namespace of which the class template
581 if (scope
&& TREE_CODE (scope
) != NAMESPACE_DECL
)
582 cp_error ("explicit specialization in non-namespace scope `%D'",
587 In an explicit specialization declaration for a member of a class
588 template or a member template that appears in namespace scope,
589 the member template and some of its enclosing class templates may
590 remain unspecialized, except that the declaration shall not
591 explicitly specialize a class member template if its enclosing
592 class templates are not explicitly specialized as well. */
593 if (current_template_parms
)
594 cp_error ("enclosing class templates are not explicitly specialized");
597 /* We've just seen template <>. */
600 begin_specialization ()
602 begin_scope (sk_template_spec
);
603 note_template_header (1);
604 check_specialization_scope ();
607 /* Called at then end of processing a declaration preceeded by
611 end_specialization ()
614 reset_specialization ();
617 /* Any template <>'s that we have seen thus far are not referring to a
618 function specialization. */
621 reset_specialization ()
623 processing_specialization
= 0;
624 template_header_count
= 0;
627 /* We've just seen a template header. If SPECIALIZATION is non-zero,
628 it was of the form template <>. */
631 note_template_header (specialization
)
634 processing_specialization
= specialization
;
635 template_header_count
++;
638 /* We're beginning an explicit instantiation. */
641 begin_explicit_instantiation ()
643 ++processing_explicit_instantiation
;
648 end_explicit_instantiation ()
650 my_friendly_assert(processing_explicit_instantiation
> 0, 0);
651 --processing_explicit_instantiation
;
654 /* The TYPE is being declared. If it is a template type, that means it
655 is a partial specialization. Do appropriate error-checking. */
658 maybe_process_partial_specialization (type
)
661 if (IS_AGGR_TYPE (type
) && CLASSTYPE_USE_TEMPLATE (type
))
663 if (CLASSTYPE_IMPLICIT_INSTANTIATION (type
)
664 && !COMPLETE_TYPE_P (type
))
666 if (current_namespace
667 != decl_namespace_context (CLASSTYPE_TI_TEMPLATE (type
)))
669 cp_pedwarn ("specializing `%#T' in different namespace", type
);
670 cp_pedwarn_at (" from definition of `%#D'",
671 CLASSTYPE_TI_TEMPLATE (type
));
673 SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (type
);
674 if (processing_template_decl
)
675 push_template_decl (TYPE_MAIN_DECL (type
));
677 else if (CLASSTYPE_TEMPLATE_INSTANTIATION (type
))
678 cp_error ("specialization of `%T' after instantiation", type
);
680 else if (processing_specialization
)
681 cp_error ("explicit specialization of non-template `%T'", type
);
684 /* Retrieve the specialization (in the sense of [temp.spec] - a
685 specialization is either an instantiation or an explicit
686 specialization) of TMPL for the given template ARGS. If there is
687 no such specialization, return NULL_TREE. The ARGS are a vector of
688 arguments, or a vector of vectors of arguments, in the case of
689 templates with more than one level of parameters. */
692 retrieve_specialization (tmpl
, args
)
698 my_friendly_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
, 0);
700 /* There should be as many levels of arguments as there are
701 levels of parameters. */
702 my_friendly_assert (TMPL_ARGS_DEPTH (args
)
703 == TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
)),
706 for (s
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
709 if (comp_template_args (TREE_PURPOSE (s
), args
))
710 return TREE_VALUE (s
);
715 /* Like retrieve_speciailization, but for local declarations. */
718 retrieve_local_specialization (tmpl
)
721 return (tree
) htab_find (local_specializations
, tmpl
);
724 /* Returns non-zero iff DECL is a specialization of TMPL. */
727 is_specialization_of (decl
, tmpl
)
733 if (TREE_CODE (decl
) == FUNCTION_DECL
)
737 t
= DECL_TEMPLATE_INFO (t
) ? DECL_TI_TEMPLATE (t
) : NULL_TREE
)
743 my_friendly_assert (TREE_CODE (decl
) == TYPE_DECL
, 0);
745 for (t
= TREE_TYPE (decl
);
747 t
= CLASSTYPE_USE_TEMPLATE (t
)
748 ? TREE_TYPE (CLASSTYPE_TI_TEMPLATE (t
)) : NULL_TREE
)
749 if (same_type_ignoring_top_level_qualifiers_p (t
, TREE_TYPE (tmpl
)))
756 /* Register the specialization SPEC as a specialization of TMPL with
757 the indicated ARGS. Returns SPEC, or an equivalent prior
758 declaration, if available. */
761 register_specialization (spec
, tmpl
, args
)
768 my_friendly_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
, 0);
770 if (TREE_CODE (spec
) == FUNCTION_DECL
771 && uses_template_parms (DECL_TI_ARGS (spec
)))
772 /* This is the FUNCTION_DECL for a partial instantiation. Don't
773 register it; we want the corresponding TEMPLATE_DECL instead.
774 We use `uses_template_parms (DECL_TI_ARGS (spec))' rather than
775 the more obvious `uses_template_parms (spec)' to avoid problems
776 with default function arguments. In particular, given
779 template <class T> void f(T t1, T t = T())
781 the default argument expression is not substituted for in an
782 instantiation unless and until it is actually needed. */
785 /* There should be as many levels of arguments as there are
786 levels of parameters. */
787 my_friendly_assert (TMPL_ARGS_DEPTH (args
)
788 == TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
)),
791 for (s
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
795 tree fn
= TREE_VALUE (s
);
797 /* We can sometimes try to re-register a specialization that we've
798 already got. In particular, regenerate_decl_from_template
799 calls duplicate_decls which will update the specialization
800 list. But, we'll still get called again here anyhow. It's
801 more convenient to simply allow this than to try to prevent it. */
804 else if (comp_template_args (TREE_PURPOSE (s
), args
))
806 if (DECL_TEMPLATE_SPECIALIZATION (spec
))
808 if (DECL_TEMPLATE_INSTANTIATION (fn
))
811 || DECL_EXPLICIT_INSTANTIATION (fn
))
813 cp_error ("specialization of %D after instantiation",
819 /* This situation should occur only if the first
820 specialization is an implicit instantiation,
821 the second is an explicit specialization, and
822 the implicit instantiation has not yet been
823 used. That situation can occur if we have
824 implicitly instantiated a member function and
825 then specialized it later.
827 We can also wind up here if a friend
828 declaration that looked like an instantiation
829 turns out to be a specialization:
831 template <class T> void foo(T);
832 class S { friend void foo<>(int) };
833 template <> void foo(int);
835 We transform the existing DECL in place so that
836 any pointers to it become pointers to the
839 If there was a definition for the template, but
840 not for the specialization, we want this to
841 look as if there is no definition, and vice
843 DECL_INITIAL (fn
) = NULL_TREE
;
844 duplicate_decls (spec
, fn
);
849 else if (DECL_TEMPLATE_SPECIALIZATION (fn
))
851 duplicate_decls (spec
, fn
);
858 DECL_TEMPLATE_SPECIALIZATIONS (tmpl
)
859 = tree_cons (args
, spec
, DECL_TEMPLATE_SPECIALIZATIONS (tmpl
));
864 /* Unregister the specialization SPEC as a specialization of TMPL.
865 Returns nonzero if the SPEC was listed as a specialization of
869 unregister_specialization (spec
, tmpl
)
875 for (s
= &DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
877 s
= &TREE_CHAIN (*s
))
878 if (TREE_VALUE (*s
) == spec
)
880 *s
= TREE_CHAIN (*s
);
887 /* Like register_specialization, but for local declarations. We are
888 registering SPEC, an instantiation of TMPL. */
891 register_local_specialization (spec
, tmpl
)
897 slot
= htab_find_slot (local_specializations
, tmpl
, INSERT
);
903 /* Print the list of candidate FNS in an error message. */
906 print_candidates (fns
)
911 const char *str
= "candidates are:";
913 for (fn
= fns
; fn
!= NULL_TREE
; fn
= TREE_CHAIN (fn
))
917 for (f
= TREE_VALUE (fn
); f
; f
= OVL_NEXT (f
))
918 cp_error_at ("%s %+#D", str
, OVL_CURRENT (f
));
923 /* Returns the template (one of the functions given by TEMPLATE_ID)
924 which can be specialized to match the indicated DECL with the
925 explicit template args given in TEMPLATE_ID. The DECL may be
926 NULL_TREE if none is available. In that case, the functions in
927 TEMPLATE_ID are non-members.
929 If NEED_MEMBER_TEMPLATE is non-zero the function is known to be a
930 specialization of a member template.
932 The template args (those explicitly specified and those deduced)
933 are output in a newly created vector *TARGS_OUT.
935 If it is impossible to determine the result, an error message is
936 issued. The error_mark_node is returned to indicate failure. */
939 determine_specialization (template_id
, decl
, targs_out
,
940 need_member_template
)
944 int need_member_template
;
949 tree candidates
= NULL_TREE
;
950 tree templates
= NULL_TREE
;
952 *targs_out
= NULL_TREE
;
954 if (template_id
== error_mark_node
)
955 return error_mark_node
;
957 fns
= TREE_OPERAND (template_id
, 0);
958 explicit_targs
= TREE_OPERAND (template_id
, 1);
960 if (fns
== error_mark_node
)
961 return error_mark_node
;
963 /* Check for baselinks. */
964 if (BASELINK_P (fns
))
965 fns
= TREE_VALUE (fns
);
967 if (!is_overloaded_fn (fns
))
969 cp_error ("`%D' is not a function template", fns
);
970 return error_mark_node
;
973 for (; fns
; fns
= OVL_NEXT (fns
))
977 tree fn
= OVL_CURRENT (fns
);
979 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
980 /* DECL might be a specialization of FN. */
982 else if (need_member_template
)
983 /* FN is an ordinary member function, and we need a
984 specialization of a member template. */
986 else if (TREE_CODE (fn
) != FUNCTION_DECL
)
987 /* We can get IDENTIFIER_NODEs here in certain erroneous
990 else if (!DECL_FUNCTION_MEMBER_P (fn
))
991 /* This is just an ordinary non-member function. Nothing can
992 be a specialization of that. */
998 /* This is an ordinary member function. However, since
999 we're here, we can assume it's enclosing class is a
1000 template class. For example,
1002 template <typename T> struct S { void f(); };
1003 template <> void S<int>::f() {}
1005 Here, S<int>::f is a non-template, but S<int> is a
1006 template class. If FN has the same type as DECL, we
1007 might be in business. */
1008 if (!same_type_p (TREE_TYPE (TREE_TYPE (decl
)),
1009 TREE_TYPE (TREE_TYPE (fn
))))
1010 /* The return types differ. */
1013 /* Adjust the type of DECL in case FN is a static member. */
1014 decl_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
1015 if (DECL_STATIC_FUNCTION_P (fn
)
1016 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
1017 decl_arg_types
= TREE_CHAIN (decl_arg_types
);
1019 if (compparms (TYPE_ARG_TYPES (TREE_TYPE (fn
)),
1022 candidates
= tree_cons (NULL_TREE
, fn
, candidates
);
1027 /* See whether this function might be a specialization of this
1029 targs
= get_bindings (tmpl
, decl
, explicit_targs
);
1032 /* We cannot deduce template arguments that when used to
1033 specialize TMPL will produce DECL. */
1036 /* Save this template, and the arguments deduced. */
1037 templates
= tree_cons (targs
, tmpl
, templates
);
1040 if (templates
&& TREE_CHAIN (templates
))
1046 It is possible for a specialization with a given function
1047 signature to be instantiated from more than one function
1048 template. In such cases, explicit specification of the
1049 template arguments must be used to uniquely identify the
1050 function template specialization being specialized.
1052 Note that here, there's no suggestion that we're supposed to
1053 determine which of the candidate templates is most
1054 specialized. However, we, also have:
1058 Partial ordering of overloaded function template
1059 declarations is used in the following contexts to select
1060 the function template to which a function template
1061 specialization refers:
1063 -- when an explicit specialization refers to a function
1066 So, we do use the partial ordering rules, at least for now.
1067 This extension can only serve to make illegal programs legal,
1068 so it's safe. And, there is strong anecdotal evidence that
1069 the committee intended the partial ordering rules to apply;
1070 the EDG front-end has that behavior, and John Spicer claims
1071 that the committee simply forgot to delete the wording in
1072 [temp.expl.spec]. */
1073 tree tmpl
= most_specialized (templates
, decl
, explicit_targs
);
1074 if (tmpl
&& tmpl
!= error_mark_node
)
1076 targs
= get_bindings (tmpl
, decl
, explicit_targs
);
1077 templates
= tree_cons (targs
, tmpl
, NULL_TREE
);
1081 if (templates
== NULL_TREE
&& candidates
== NULL_TREE
)
1083 cp_error_at ("template-id `%D' for `%+D' does not match any template declaration",
1085 return error_mark_node
;
1087 else if ((templates
&& TREE_CHAIN (templates
))
1088 || (candidates
&& TREE_CHAIN (candidates
))
1089 || (templates
&& candidates
))
1091 cp_error_at ("ambiguous template specialization `%D' for `%+D'",
1093 chainon (candidates
, templates
);
1094 print_candidates (candidates
);
1095 return error_mark_node
;
1098 /* We have one, and exactly one, match. */
1101 /* It was a specialization of an ordinary member function in a
1103 *targs_out
= copy_node (DECL_TI_ARGS (TREE_VALUE (candidates
)));
1104 return DECL_TI_TEMPLATE (TREE_VALUE (candidates
));
1107 /* It was a specialization of a template. */
1108 targs
= DECL_TI_ARGS (DECL_TEMPLATE_RESULT (TREE_VALUE (templates
)));
1109 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (targs
))
1111 *targs_out
= copy_node (targs
);
1112 SET_TMPL_ARGS_LEVEL (*targs_out
,
1113 TMPL_ARGS_DEPTH (*targs_out
),
1114 TREE_PURPOSE (templates
));
1117 *targs_out
= TREE_PURPOSE (templates
);
1118 return TREE_VALUE (templates
);
1121 /* Check to see if the function just declared, as indicated in
1122 DECLARATOR, and in DECL, is a specialization of a function
1123 template. We may also discover that the declaration is an explicit
1124 instantiation at this point.
1126 Returns DECL, or an equivalent declaration that should be used
1127 instead if all goes well. Issues an error message if something is
1128 amiss. Returns error_mark_node if the error is not easily
1131 FLAGS is a bitmask consisting of the following flags:
1133 2: The function has a definition.
1134 4: The function is a friend.
1136 The TEMPLATE_COUNT is the number of references to qualifying
1137 template classes that appeared in the name of the function. For
1140 template <class T> struct S { void f(); };
1143 the TEMPLATE_COUNT would be 1. However, explicitly specialized
1144 classes are not counted in the TEMPLATE_COUNT, so that in
1146 template <class T> struct S {};
1147 template <> struct S<int> { void f(); }
1148 template <> void S<int>::f();
1150 the TEMPLATE_COUNT would be 0. (Note that this declaration is
1151 illegal; there should be no template <>.)
1153 If the function is a specialization, it is marked as such via
1154 DECL_TEMPLATE_SPECIALIZATION. Furthermore, its DECL_TEMPLATE_INFO
1155 is set up correctly, and it is added to the list of specializations
1156 for that template. */
1159 check_explicit_specialization (declarator
, decl
, template_count
, flags
)
1165 int have_def
= flags
& 2;
1166 int is_friend
= flags
& 4;
1167 int specialization
= 0;
1168 int explicit_instantiation
= 0;
1169 int member_specialization
= 0;
1170 tree ctype
= DECL_CLASS_CONTEXT (decl
);
1171 tree dname
= DECL_NAME (decl
);
1174 tsk
= current_tmpl_spec_kind (template_count
);
1179 if (processing_specialization
)
1182 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
1184 else if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
1187 /* This could be something like:
1189 template <class T> void f(T);
1190 class S { friend void f<>(int); } */
1194 /* This case handles bogus declarations like template <>
1195 template <class T> void f<int>(); */
1197 cp_error ("template-id `%D' in declaration of primary template",
1204 case tsk_invalid_member_spec
:
1205 /* The error has already been reported in
1206 check_specialization_scope. */
1207 return error_mark_node
;
1209 case tsk_invalid_expl_inst
:
1210 cp_error ("template parameter list used in explicit instantiation");
1216 cp_error ("definition provided for explicit instantiation");
1218 explicit_instantiation
= 1;
1221 case tsk_excessive_parms
:
1222 cp_error ("too many template parameter lists in declaration of `%D'",
1224 return error_mark_node
;
1228 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
1230 member_specialization
= 1;
1235 case tsk_insufficient_parms
:
1236 if (template_header_count
)
1238 cp_error("too few template parameter lists in declaration of `%D'",
1242 else if (ctype
!= NULL_TREE
1243 && !TYPE_BEING_DEFINED (ctype
)
1244 && CLASSTYPE_TEMPLATE_INSTANTIATION (ctype
)
1247 /* For backwards compatibility, we accept:
1249 template <class T> struct S { void f(); };
1250 void S<int>::f() {} // Missing template <>
1252 That used to be legal C++. */
1255 ("explicit specialization not preceded by `template <>'");
1257 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
1262 if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
1264 /* This case handles bogus declarations like template <>
1265 template <class T> void f<int>(); */
1267 cp_error ("template-id `%D' in declaration of primary template",
1272 if (ctype
&& CLASSTYPE_TEMPLATE_INSTANTIATION (ctype
))
1273 /* This is a specialization of a member template, without
1274 specialization the containing class. Something like:
1276 template <class T> struct S {
1277 template <class U> void f (U);
1279 template <> template <class U> void S<int>::f(U) {}
1281 That's a specialization -- but of the entire template. */
1286 my_friendly_abort (20000309);
1289 if (specialization
|| member_specialization
)
1291 tree t
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
1292 for (; t
; t
= TREE_CHAIN (t
))
1293 if (TREE_PURPOSE (t
))
1296 ("default argument specified in explicit specialization");
1299 if (current_lang_name
== lang_name_c
)
1300 cp_error ("template specialization with C linkage");
1303 if (specialization
|| member_specialization
|| explicit_instantiation
)
1305 tree tmpl
= NULL_TREE
;
1306 tree targs
= NULL_TREE
;
1308 /* Make sure that the declarator is a TEMPLATE_ID_EXPR. */
1309 if (TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
1313 my_friendly_assert (TREE_CODE (declarator
) == IDENTIFIER_NODE
,
1316 fns
= IDENTIFIER_NAMESPACE_VALUE (dname
);
1321 lookup_template_function (fns
, NULL_TREE
);
1324 if (declarator
== error_mark_node
)
1325 return error_mark_node
;
1327 if (ctype
!= NULL_TREE
&& TYPE_BEING_DEFINED (ctype
))
1329 if (!explicit_instantiation
)
1330 /* A specialization in class scope. This is illegal,
1331 but the error will already have been flagged by
1332 check_specialization_scope. */
1333 return error_mark_node
;
1336 /* It's not legal to write an explicit instantiation in
1339 class C { template void f(); }
1341 This case is caught by the parser. However, on
1344 template class C { void f(); };
1346 (which is illegal) we can get here. The error will be
1353 else if (TREE_CODE (TREE_OPERAND (declarator
, 0)) == LOOKUP_EXPR
)
1355 /* A friend declaration. We can't do much, because we don't
1356 know what this resolves to, yet. */
1357 my_friendly_assert (is_friend
!= 0, 0);
1358 my_friendly_assert (!explicit_instantiation
, 0);
1359 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
1362 else if (ctype
!= NULL_TREE
1363 && (TREE_CODE (TREE_OPERAND (declarator
, 0)) ==
1366 /* Find the list of functions in ctype that have the same
1367 name as the declared function. */
1368 tree name
= TREE_OPERAND (declarator
, 0);
1369 tree fns
= NULL_TREE
;
1372 if (name
== constructor_name (ctype
)
1373 || name
== constructor_name_full (ctype
))
1375 int is_constructor
= DECL_CONSTRUCTOR_P (decl
);
1377 if (is_constructor
? !TYPE_HAS_CONSTRUCTOR (ctype
)
1378 : !TYPE_HAS_DESTRUCTOR (ctype
))
1380 /* From [temp.expl.spec]:
1382 If such an explicit specialization for the member
1383 of a class template names an implicitly-declared
1384 special member function (clause _special_), the
1385 program is ill-formed.
1387 Similar language is found in [temp.explicit]. */
1388 cp_error ("specialization of implicitly-declared special member function");
1389 return error_mark_node
;
1392 name
= is_constructor
? ctor_identifier
: dtor_identifier
;
1395 if (!DECL_CONV_FN_P (decl
))
1397 idx
= lookup_fnfields_1 (ctype
, name
);
1399 fns
= TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (ctype
), idx
);
1405 /* For a type-conversion operator, we cannot do a
1406 name-based lookup. We might be looking for `operator
1407 int' which will be a specialization of `operator T'.
1408 So, we find *all* the conversion operators, and then
1409 select from them. */
1412 methods
= CLASSTYPE_METHOD_VEC (ctype
);
1414 for (idx
= 2; idx
< TREE_VEC_LENGTH (methods
); ++idx
)
1416 tree ovl
= TREE_VEC_ELT (methods
, idx
);
1418 if (!ovl
|| !DECL_CONV_FN_P (OVL_CURRENT (ovl
)))
1419 /* There are no more conversion functions. */
1422 /* Glue all these conversion functions together
1423 with those we already have. */
1424 for (; ovl
; ovl
= OVL_NEXT (ovl
))
1425 fns
= ovl_cons (OVL_CURRENT (ovl
), fns
);
1429 if (fns
== NULL_TREE
)
1431 cp_error ("no member function `%D' declared in `%T'",
1433 return error_mark_node
;
1436 TREE_OPERAND (declarator
, 0) = fns
;
1439 /* Figure out what exactly is being specialized at this point.
1440 Note that for an explicit instantiation, even one for a
1441 member function, we cannot tell apriori whether the
1442 instantiation is for a member template, or just a member
1443 function of a template class. Even if a member template is
1444 being instantiated, the member template arguments may be
1445 elided if they can be deduced from the rest of the
1447 tmpl
= determine_specialization (declarator
, decl
,
1449 member_specialization
);
1451 if (!tmpl
|| tmpl
== error_mark_node
)
1452 /* We couldn't figure out what this declaration was
1454 return error_mark_node
;
1457 tree gen_tmpl
= most_general_template (tmpl
);
1459 if (explicit_instantiation
)
1461 /* We don't set DECL_EXPLICIT_INSTANTIATION here; that
1462 is done by do_decl_instantiation later. */
1464 int arg_depth
= TMPL_ARGS_DEPTH (targs
);
1465 int parm_depth
= TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
));
1467 if (arg_depth
> parm_depth
)
1469 /* If TMPL is not the most general template (for
1470 example, if TMPL is a friend template that is
1471 injected into namespace scope), then there will
1472 be too many levels fo TARGS. Remove some of them
1477 new_targs
= make_tree_vec (parm_depth
);
1478 for (i
= arg_depth
- parm_depth
; i
< arg_depth
; ++i
)
1479 TREE_VEC_ELT (new_targs
, i
- (arg_depth
- parm_depth
))
1480 = TREE_VEC_ELT (targs
, i
);
1484 return instantiate_template (tmpl
, targs
);
1487 /* If this is both a template specialization, then it's a
1488 specialization of a member template of a template class.
1489 In that case we want to return the TEMPLATE_DECL, not the
1490 specialization of it. */
1491 if (tsk
== tsk_template
)
1493 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
1497 /* If we though that the DECL was a member function, but it
1498 turns out to be specializing a static member function,
1499 make DECL a static member function as well. */
1500 if (DECL_STATIC_FUNCTION_P (tmpl
)
1501 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
1503 revert_static_member_fn (decl
);
1504 last_function_parms
= TREE_CHAIN (last_function_parms
);
1507 /* Set up the DECL_TEMPLATE_INFO for DECL. */
1508 DECL_TEMPLATE_INFO (decl
) = tree_cons (tmpl
, targs
, NULL_TREE
);
1510 /* Mangle the function name appropriately. Note that we do
1511 not mangle specializations of non-template member
1512 functions of template classes, e.g. with
1514 template <class T> struct S { void f(); }
1516 and given the specialization
1518 template <> void S<int>::f() {}
1520 we do not mangle S<int>::f() here. That's because it's
1521 just an ordinary member function and doesn't need special
1522 treatment. We do this here so that the ordinary,
1523 non-template, name-mangling algorithm will not be used
1525 if ((is_member_template (tmpl
) || ctype
== NULL_TREE
)
1526 && name_mangling_version
>= 1)
1527 set_mangled_name_for_template_decl (decl
);
1529 if (is_friend
&& !have_def
)
1530 /* This is not really a declaration of a specialization.
1531 It's just the name of an instantiation. But, it's not
1532 a request for an instantiation, either. */
1533 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
1535 /* Register this specialization so that we can find it
1537 decl
= register_specialization (decl
, gen_tmpl
, targs
);
1544 /* TYPE is being declared. Verify that the use of template headers
1545 and such is reasonable. Issue error messages if not. */
1548 maybe_check_template_type (type
)
1551 if (template_header_count
)
1553 /* We are in the scope of some `template <...>' header. */
1556 = template_class_depth_real (TYPE_CONTEXT (type
),
1557 /*count_specializations=*/1);
1559 if (template_header_count
<= context_depth
)
1560 /* This is OK; the template headers are for the context. We
1561 are actually too lenient here; like
1562 check_explicit_specialization we should consider the number
1563 of template types included in the actual declaration. For
1566 template <class T> struct S {
1567 template <class U> template <class V>
1573 template <class T> struct S {
1574 template <class U> struct I;
1577 template <class T> template <class U.
1582 else if (template_header_count
> context_depth
+ 1)
1583 /* There are two many template parameter lists. */
1584 cp_error ("too many template parameter lists in declaration of `%T'", type
);
1588 /* Returns 1 iff PARMS1 and PARMS2 are identical sets of template
1589 parameters. These are represented in the same format used for
1590 DECL_TEMPLATE_PARMS. */
1592 int comp_template_parms (parms1
, parms2
)
1599 if (parms1
== parms2
)
1602 for (p1
= parms1
, p2
= parms2
;
1603 p1
!= NULL_TREE
&& p2
!= NULL_TREE
;
1604 p1
= TREE_CHAIN (p1
), p2
= TREE_CHAIN (p2
))
1606 tree t1
= TREE_VALUE (p1
);
1607 tree t2
= TREE_VALUE (p2
);
1610 my_friendly_assert (TREE_CODE (t1
) == TREE_VEC
, 0);
1611 my_friendly_assert (TREE_CODE (t2
) == TREE_VEC
, 0);
1613 if (TREE_VEC_LENGTH (t1
) != TREE_VEC_LENGTH (t2
))
1616 for (i
= 0; i
< TREE_VEC_LENGTH (t2
); ++i
)
1618 tree parm1
= TREE_VALUE (TREE_VEC_ELT (t1
, i
));
1619 tree parm2
= TREE_VALUE (TREE_VEC_ELT (t2
, i
));
1621 if (TREE_CODE (parm1
) != TREE_CODE (parm2
))
1624 if (TREE_CODE (parm1
) == TEMPLATE_TYPE_PARM
)
1626 else if (!same_type_p (TREE_TYPE (parm1
), TREE_TYPE (parm2
)))
1631 if ((p1
!= NULL_TREE
) != (p2
!= NULL_TREE
))
1632 /* One set of parameters has more parameters lists than the
1639 /* Complain if DECL shadows a template parameter.
1641 [temp.local]: A template-parameter shall not be redeclared within its
1642 scope (including nested scopes). */
1645 check_template_shadow (decl
)
1650 /* If we're not in a template, we can't possibly shadow a template
1652 if (!current_template_parms
)
1655 /* Figure out what we're shadowing. */
1656 if (TREE_CODE (decl
) == OVERLOAD
)
1657 decl
= OVL_CURRENT (decl
);
1658 olddecl
= IDENTIFIER_VALUE (DECL_NAME (decl
));
1660 /* If there's no previous binding for this name, we're not shadowing
1661 anything, let alone a template parameter. */
1665 /* If we're not shadowing a template parameter, we're done. Note
1666 that OLDDECL might be an OVERLOAD (or perhaps even an
1667 ERROR_MARK), so we can't just blithely assume it to be a _DECL
1669 if (!DECL_P (olddecl
) || !DECL_TEMPLATE_PARM_P (olddecl
))
1672 /* We check for decl != olddecl to avoid bogus errors for using a
1673 name inside a class. We check TPFI to avoid duplicate errors for
1674 inline member templates. */
1676 || TEMPLATE_PARMS_FOR_INLINE (current_template_parms
))
1679 cp_error_at ("declaration of `%#D'", decl
);
1680 cp_error_at (" shadows template parm `%#D'", olddecl
);
1683 /* Return a new TEMPLATE_PARM_INDEX with the indicated INDEX, LEVEL,
1684 ORIG_LEVEL, DECL, and TYPE. */
1687 build_template_parm_index (index
, level
, orig_level
, decl
, type
)
1694 tree t
= make_node (TEMPLATE_PARM_INDEX
);
1695 TEMPLATE_PARM_IDX (t
) = index
;
1696 TEMPLATE_PARM_LEVEL (t
) = level
;
1697 TEMPLATE_PARM_ORIG_LEVEL (t
) = orig_level
;
1698 TEMPLATE_PARM_DECL (t
) = decl
;
1699 TREE_TYPE (t
) = type
;
1704 /* Return a TEMPLATE_PARM_INDEX, similar to INDEX, but whose
1705 TEMPLATE_PARM_LEVEL has been decreased by LEVELS. If such a
1706 TEMPLATE_PARM_INDEX already exists, it is returned; otherwise, a
1707 new one is created. */
1710 reduce_template_parm_level (index
, type
, levels
)
1715 if (TEMPLATE_PARM_DESCENDANTS (index
) == NULL_TREE
1716 || (TEMPLATE_PARM_LEVEL (TEMPLATE_PARM_DESCENDANTS (index
))
1717 != TEMPLATE_PARM_LEVEL (index
) - levels
))
1720 = build_decl (TREE_CODE (TEMPLATE_PARM_DECL (index
)),
1721 DECL_NAME (TEMPLATE_PARM_DECL (index
)),
1724 = build_template_parm_index (TEMPLATE_PARM_IDX (index
),
1725 TEMPLATE_PARM_LEVEL (index
) - levels
,
1726 TEMPLATE_PARM_ORIG_LEVEL (index
),
1728 TEMPLATE_PARM_DESCENDANTS (index
) = t
;
1730 /* Template template parameters need this. */
1731 DECL_TEMPLATE_PARMS (decl
)
1732 = DECL_TEMPLATE_PARMS (TEMPLATE_PARM_DECL (index
));
1735 return TEMPLATE_PARM_DESCENDANTS (index
);
1738 /* Process information from new template parameter NEXT and append it to the
1739 LIST being built. */
1742 process_template_parm (list
, next
)
1751 my_friendly_assert (TREE_CODE (parm
) == TREE_LIST
, 259);
1752 defval
= TREE_PURPOSE (parm
);
1753 parm
= TREE_VALUE (parm
);
1754 is_type
= TREE_PURPOSE (parm
) == class_type_node
;
1758 tree p
= TREE_VALUE (tree_last (list
));
1760 if (TREE_CODE (p
) == TYPE_DECL
)
1761 idx
= TEMPLATE_TYPE_IDX (TREE_TYPE (p
));
1762 else if (TREE_CODE (p
) == TEMPLATE_DECL
)
1763 idx
= TEMPLATE_TYPE_IDX (TREE_TYPE (DECL_TEMPLATE_RESULT (p
)));
1765 idx
= TEMPLATE_PARM_IDX (DECL_INITIAL (p
));
1773 my_friendly_assert (TREE_CODE (TREE_PURPOSE (parm
)) == TREE_LIST
, 260);
1774 /* is a const-param */
1775 parm
= grokdeclarator (TREE_VALUE (parm
), TREE_PURPOSE (parm
),
1776 PARM
, 0, NULL_TREE
);
1780 The top-level cv-qualifiers on the template-parameter are
1781 ignored when determining its type. */
1782 TREE_TYPE (parm
) = TYPE_MAIN_VARIANT (TREE_TYPE (parm
));
1784 /* A template parameter is not modifiable. */
1785 TREE_READONLY (parm
) = 1;
1786 if (IS_AGGR_TYPE (TREE_TYPE (parm
))
1787 && TREE_CODE (TREE_TYPE (parm
)) != TEMPLATE_TYPE_PARM
1788 && TREE_CODE (TREE_TYPE (parm
)) != TYPENAME_TYPE
)
1790 cp_error ("`%#T' is not a valid type for a template constant parameter",
1792 if (DECL_NAME (parm
) == NULL_TREE
)
1793 error (" a template type parameter must begin with `class' or `typename'");
1794 TREE_TYPE (parm
) = void_type_node
;
1797 && (TREE_CODE (TREE_TYPE (parm
)) == REAL_TYPE
1798 || TREE_CODE (TREE_TYPE (parm
)) == COMPLEX_TYPE
))
1799 cp_pedwarn ("`%T' is not a valid type for a template constant parameter",
1801 decl
= build_decl (CONST_DECL
, DECL_NAME (parm
), TREE_TYPE (parm
));
1802 DECL_INITIAL (parm
) = DECL_INITIAL (decl
)
1803 = build_template_parm_index (idx
, processing_template_decl
,
1804 processing_template_decl
,
1805 decl
, TREE_TYPE (parm
));
1810 parm
= TREE_VALUE (parm
);
1812 if (parm
&& TREE_CODE (parm
) == TEMPLATE_DECL
)
1814 t
= make_aggr_type (TEMPLATE_TEMPLATE_PARM
);
1815 /* This is for distinguishing between real templates and template
1816 template parameters */
1817 TREE_TYPE (parm
) = t
;
1818 TREE_TYPE (DECL_TEMPLATE_RESULT (parm
)) = t
;
1823 t
= make_aggr_type (TEMPLATE_TYPE_PARM
);
1824 /* parm is either IDENTIFIER_NODE or NULL_TREE */
1825 decl
= build_decl (TYPE_DECL
, parm
, t
);
1828 TYPE_NAME (t
) = decl
;
1829 TYPE_STUB_DECL (t
) = decl
;
1831 TEMPLATE_TYPE_PARM_INDEX (t
)
1832 = build_template_parm_index (idx
, processing_template_decl
,
1833 processing_template_decl
,
1834 decl
, TREE_TYPE (parm
));
1836 SET_DECL_ARTIFICIAL (decl
);
1837 SET_DECL_TEMPLATE_PARM_P (decl
);
1839 parm
= build_tree_list (defval
, parm
);
1840 return chainon (list
, parm
);
1843 /* The end of a template parameter list has been reached. Process the
1844 tree list into a parameter vector, converting each parameter into a more
1845 useful form. Type parameters are saved as IDENTIFIER_NODEs, and others
1849 end_template_parm_list (parms
)
1854 tree saved_parmlist
= make_tree_vec (list_length (parms
));
1856 current_template_parms
1857 = tree_cons (build_int_2 (0, processing_template_decl
),
1858 saved_parmlist
, current_template_parms
);
1860 for (parm
= parms
, nparms
= 0;
1862 parm
= TREE_CHAIN (parm
), nparms
++)
1863 TREE_VEC_ELT (saved_parmlist
, nparms
) = parm
;
1865 --processing_template_parmlist
;
1867 return saved_parmlist
;
1870 /* end_template_decl is called after a template declaration is seen. */
1873 end_template_decl ()
1875 reset_specialization ();
1877 if (! processing_template_decl
)
1880 /* This matches the pushlevel in begin_template_parm_list. */
1883 --processing_template_decl
;
1884 current_template_parms
= TREE_CHAIN (current_template_parms
);
1887 /* Given a template argument vector containing the template PARMS.
1888 The innermost PARMS are given first. */
1891 current_template_args ()
1894 tree args
= NULL_TREE
;
1895 int length
= TMPL_PARMS_DEPTH (current_template_parms
);
1898 /* If there is only one level of template parameters, we do not
1899 create a TREE_VEC of TREE_VECs. Instead, we return a single
1900 TREE_VEC containing the arguments. */
1902 args
= make_tree_vec (length
);
1904 for (header
= current_template_parms
; header
; header
= TREE_CHAIN (header
))
1906 tree a
= copy_node (TREE_VALUE (header
));
1909 TREE_TYPE (a
) = NULL_TREE
;
1910 for (i
= TREE_VEC_LENGTH (a
) - 1; i
>= 0; --i
)
1912 tree t
= TREE_VEC_ELT (a
, i
);
1914 /* T will be a list if we are called from within a
1915 begin/end_template_parm_list pair, but a vector directly
1916 if within a begin/end_member_template_processing pair. */
1917 if (TREE_CODE (t
) == TREE_LIST
)
1921 if (TREE_CODE (t
) == TYPE_DECL
1922 || TREE_CODE (t
) == TEMPLATE_DECL
)
1925 t
= DECL_INITIAL (t
);
1926 TREE_VEC_ELT (a
, i
) = t
;
1931 TREE_VEC_ELT (args
, --l
) = a
;
1939 /* Return a TEMPLATE_DECL corresponding to DECL, using the indicated
1940 template PARMS. Used by push_template_decl below. */
1943 build_template_decl (decl
, parms
)
1947 tree tmpl
= build_lang_decl (TEMPLATE_DECL
, DECL_NAME (decl
), NULL_TREE
);
1948 DECL_TEMPLATE_PARMS (tmpl
) = parms
;
1949 DECL_CONTEXT (tmpl
) = DECL_CONTEXT (decl
);
1950 if (DECL_LANG_SPECIFIC (decl
))
1952 DECL_VIRTUAL_CONTEXT (tmpl
) = DECL_VIRTUAL_CONTEXT (decl
);
1953 DECL_STATIC_FUNCTION_P (tmpl
) = DECL_STATIC_FUNCTION_P (decl
);
1954 DECL_CONSTRUCTOR_P (tmpl
) = DECL_CONSTRUCTOR_P (decl
);
1955 DECL_NONCONVERTING_P (tmpl
) = DECL_NONCONVERTING_P (decl
);
1961 struct template_parm_data
1963 /* The level of the template parameters we are currently
1967 /* The index of the specialization argument we are currently
1971 /* An array whose size is the number of template parameters. The
1972 elements are non-zero if the parameter has been used in any one
1973 of the arguments processed so far. */
1976 /* An array whose size is the number of template arguments. The
1977 elements are non-zero if the argument makes use of template
1978 parameters of this level. */
1979 int* arg_uses_template_parms
;
1982 /* Subroutine of push_template_decl used to see if each template
1983 parameter in a partial specialization is used in the explicit
1984 argument list. If T is of the LEVEL given in DATA (which is
1985 treated as a template_parm_data*), then DATA->PARMS is marked
1989 mark_template_parm (t
, data
)
1995 struct template_parm_data
* tpd
= (struct template_parm_data
*) data
;
1997 if (TREE_CODE (t
) == TEMPLATE_PARM_INDEX
)
1999 level
= TEMPLATE_PARM_LEVEL (t
);
2000 idx
= TEMPLATE_PARM_IDX (t
);
2004 level
= TEMPLATE_TYPE_LEVEL (t
);
2005 idx
= TEMPLATE_TYPE_IDX (t
);
2008 if (level
== tpd
->level
)
2010 tpd
->parms
[idx
] = 1;
2011 tpd
->arg_uses_template_parms
[tpd
->current_arg
] = 1;
2014 /* Return zero so that for_each_template_parm will continue the
2015 traversal of the tree; we want to mark *every* template parm. */
2019 /* Process the partial specialization DECL. */
2022 process_partial_specialization (decl
)
2025 tree type
= TREE_TYPE (decl
);
2026 tree maintmpl
= CLASSTYPE_TI_TEMPLATE (type
);
2027 tree specargs
= CLASSTYPE_TI_ARGS (type
);
2028 tree inner_args
= innermost_args (specargs
);
2029 tree inner_parms
= INNERMOST_TEMPLATE_PARMS (current_template_parms
);
2030 tree main_inner_parms
= DECL_INNERMOST_TEMPLATE_PARMS (maintmpl
);
2031 int nargs
= TREE_VEC_LENGTH (inner_args
);
2032 int ntparms
= TREE_VEC_LENGTH (inner_parms
);
2034 int did_error_intro
= 0;
2035 struct template_parm_data tpd
;
2036 struct template_parm_data tpd2
;
2038 /* We check that each of the template parameters given in the
2039 partial specialization is used in the argument list to the
2040 specialization. For example:
2042 template <class T> struct S;
2043 template <class T> struct S<T*>;
2045 The second declaration is OK because `T*' uses the template
2046 parameter T, whereas
2048 template <class T> struct S<int>;
2050 is no good. Even trickier is:
2061 The S2<T> declaration is actually illegal; it is a
2062 full-specialization. Of course,
2065 struct S2<T (*)(U)>;
2067 or some such would have been OK. */
2068 tpd
.level
= TMPL_PARMS_DEPTH (current_template_parms
);
2069 tpd
.parms
= alloca (sizeof (int) * ntparms
);
2070 bzero ((PTR
) tpd
.parms
, sizeof (int) * ntparms
);
2072 tpd
.arg_uses_template_parms
= alloca (sizeof (int) * nargs
);
2073 bzero ((PTR
) tpd
.arg_uses_template_parms
, sizeof (int) * nargs
);
2074 for (i
= 0; i
< nargs
; ++i
)
2076 tpd
.current_arg
= i
;
2077 for_each_template_parm (TREE_VEC_ELT (inner_args
, i
),
2078 &mark_template_parm
,
2081 for (i
= 0; i
< ntparms
; ++i
)
2082 if (tpd
.parms
[i
] == 0)
2084 /* One of the template parms was not used in the
2086 if (!did_error_intro
)
2088 cp_error ("template parameters not used in partial specialization:");
2089 did_error_intro
= 1;
2093 TREE_VALUE (TREE_VEC_ELT (inner_parms
, i
)));
2096 /* [temp.class.spec]
2098 The argument list of the specialization shall not be identical to
2099 the implicit argument list of the primary template. */
2100 if (comp_template_args (inner_args
,
2101 innermost_args (CLASSTYPE_TI_ARGS (TREE_TYPE
2103 cp_error ("partial specialization `%T' does not specialize any template arguments", type
);
2105 /* [temp.class.spec]
2107 A partially specialized non-type argument expression shall not
2108 involve template parameters of the partial specialization except
2109 when the argument expression is a simple identifier.
2111 The type of a template parameter corresponding to a specialized
2112 non-type argument shall not be dependent on a parameter of the
2114 my_friendly_assert (nargs
== DECL_NTPARMS (maintmpl
), 0);
2116 for (i
= 0; i
< nargs
; ++i
)
2118 tree arg
= TREE_VEC_ELT (inner_args
, i
);
2119 if (/* These first two lines are the `non-type' bit. */
2121 && TREE_CODE (arg
) != TEMPLATE_DECL
2122 /* This next line is the `argument expression is not just a
2123 simple identifier' condition and also the `specialized
2124 non-type argument' bit. */
2125 && TREE_CODE (arg
) != TEMPLATE_PARM_INDEX
)
2127 if (tpd
.arg_uses_template_parms
[i
])
2128 cp_error ("template argument `%E' involves template parameter(s)", arg
);
2131 /* Look at the corresponding template parameter,
2132 marking which template parameters its type depends
2135 TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (main_inner_parms
,
2140 /* We haven't yet initialized TPD2. Do so now. */
2141 tpd2
.arg_uses_template_parms
2142 = (int*) alloca (sizeof (int) * nargs
);
2143 /* The number of parameters here is the number in the
2144 main template, which, as checked in the assertion
2146 tpd2
.parms
= (int*) alloca (sizeof (int) * nargs
);
2148 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (maintmpl
));
2151 /* Mark the template parameters. But this time, we're
2152 looking for the template parameters of the main
2153 template, not in the specialization. */
2154 tpd2
.current_arg
= i
;
2155 tpd2
.arg_uses_template_parms
[i
] = 0;
2156 bzero ((PTR
) tpd2
.parms
, sizeof (int) * nargs
);
2157 for_each_template_parm (type
,
2158 &mark_template_parm
,
2161 if (tpd2
.arg_uses_template_parms
[i
])
2163 /* The type depended on some template parameters.
2164 If they are fully specialized in the
2165 specialization, that's OK. */
2167 for (j
= 0; j
< nargs
; ++j
)
2168 if (tpd2
.parms
[j
] != 0
2169 && tpd
.arg_uses_template_parms
[j
])
2171 cp_error ("type `%T' of template argument `%E' depends on template parameter(s)",
2181 if (retrieve_specialization (maintmpl
, specargs
))
2182 /* We've already got this specialization. */
2185 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)
2186 = tree_cons (inner_args
, inner_parms
,
2187 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
));
2188 TREE_TYPE (DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)) = type
;
2192 /* Check that a template declaration's use of default arguments is not
2193 invalid. Here, PARMS are the template parameters. IS_PRIMARY is
2194 non-zero if DECL is the thing declared by a primary template.
2195 IS_PARTIAL is non-zero if DECL is a partial specialization. */
2198 check_default_tmpl_args (decl
, parms
, is_primary
, is_partial
)
2205 int last_level_to_check
;
2210 A default template-argument shall not be specified in a
2211 function template declaration or a function template definition, nor
2212 in the template-parameter-list of the definition of a member of a
2215 if (TREE_CODE (CP_DECL_CONTEXT (decl
)) == FUNCTION_DECL
)
2216 /* You can't have a function template declaration in a local
2217 scope, nor you can you define a member of a class template in a
2221 if (current_class_type
2222 && !TYPE_BEING_DEFINED (current_class_type
)
2223 && DECL_LANG_SPECIFIC (decl
)
2224 /* If this is either a friend defined in the scope of the class
2225 or a member function. */
2226 && ((DECL_CONTEXT (decl
)
2227 && same_type_p (DECL_CONTEXT (decl
), current_class_type
))
2228 || (DECL_FRIEND_CONTEXT (decl
)
2229 && same_type_p (DECL_FRIEND_CONTEXT (decl
),
2230 current_class_type
)))
2231 /* And, if it was a member function, it really was defined in
2232 the scope of the class. */
2233 && (!DECL_FUNCTION_MEMBER_P (decl
) || DECL_DEFINED_IN_CLASS_P (decl
)))
2234 /* We already checked these parameters when the template was
2235 declared, so there's no need to do it again now. This function
2236 was defined in class scope, but we're processing it's body now
2237 that the class is complete. */
2242 If a template-parameter has a default template-argument, all
2243 subsequent template-parameters shall have a default
2244 template-argument supplied. */
2245 for (parm_level
= parms
; parm_level
; parm_level
= TREE_CHAIN (parm_level
))
2247 tree inner_parms
= TREE_VALUE (parm_level
);
2248 int ntparms
= TREE_VEC_LENGTH (inner_parms
);
2249 int seen_def_arg_p
= 0;
2252 for (i
= 0; i
< ntparms
; ++i
)
2254 tree parm
= TREE_VEC_ELT (inner_parms
, i
);
2255 if (TREE_PURPOSE (parm
))
2257 else if (seen_def_arg_p
)
2259 cp_error ("no default argument for `%D'", TREE_VALUE (parm
));
2260 /* For better subsequent error-recovery, we indicate that
2261 there should have been a default argument. */
2262 TREE_PURPOSE (parm
) = error_mark_node
;
2267 if (TREE_CODE (decl
) != TYPE_DECL
|| is_partial
|| !is_primary
)
2268 /* For an ordinary class template, default template arguments are
2269 allowed at the innermost level, e.g.:
2270 template <class T = int>
2272 but, in a partial specialization, they're not allowed even
2273 there, as we have in [temp.class.spec]:
2275 The template parameter list of a specialization shall not
2276 contain default template argument values.
2278 So, for a partial specialization, or for a function template,
2279 we look at all of them. */
2282 /* But, for a primary class template that is not a partial
2283 specialization we look at all template parameters except the
2285 parms
= TREE_CHAIN (parms
);
2287 /* Figure out what error message to issue. */
2288 if (TREE_CODE (decl
) == FUNCTION_DECL
)
2289 msg
= "default argument for template parameter in function template `%D'";
2290 else if (is_partial
)
2291 msg
= "default argument in partial specialization `%D'";
2293 msg
= "default argument for template parameter for class enclosing `%D'";
2295 if (current_class_type
&& TYPE_BEING_DEFINED (current_class_type
))
2296 /* If we're inside a class definition, there's no need to
2297 examine the parameters to the class itself. On the one
2298 hand, they will be checked when the class is defined, and,
2299 on the other, default arguments are legal in things like:
2300 template <class T = double>
2301 struct S { template <class U> void f(U); };
2302 Here the default argument for `S' has no bearing on the
2303 declaration of `f'. */
2304 last_level_to_check
= template_class_depth (current_class_type
) + 1;
2306 /* Check everything. */
2307 last_level_to_check
= 0;
2309 for (parm_level
= parms
;
2310 parm_level
&& TMPL_PARMS_DEPTH (parm_level
) >= last_level_to_check
;
2311 parm_level
= TREE_CHAIN (parm_level
))
2313 tree inner_parms
= TREE_VALUE (parm_level
);
2317 ntparms
= TREE_VEC_LENGTH (inner_parms
);
2318 for (i
= 0; i
< ntparms
; ++i
)
2319 if (TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)))
2323 cp_error (msg
, decl
);
2327 /* Clear out the default argument so that we are not
2329 TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)) = NULL_TREE
;
2332 /* At this point, if we're still interested in issuing messages,
2333 they must apply to classes surrounding the object declared. */
2335 msg
= "default argument for template parameter for class enclosing `%D'";
2339 /* Creates a TEMPLATE_DECL for the indicated DECL using the template
2340 parameters given by current_template_args, or reuses a
2341 previously existing one, if appropriate. Returns the DECL, or an
2342 equivalent one, if it is replaced via a call to duplicate_decls.
2344 If IS_FRIEND is non-zero, DECL is a friend declaration. */
2347 push_template_decl_real (decl
, is_friend
)
2357 int new_template_p
= 0;
2359 /* See if this is a partial specialization. */
2360 is_partial
= (DECL_IMPLICIT_TYPEDEF_P (decl
)
2361 && TREE_CODE (TREE_TYPE (decl
)) != ENUMERAL_TYPE
2362 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl
)));
2364 is_friend
|= (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_FRIEND_P (decl
));
2367 /* For a friend, we want the context of the friend function, not
2368 the type of which it is a friend. */
2369 ctx
= DECL_CONTEXT (decl
);
2370 else if (CP_DECL_CONTEXT (decl
)
2371 && TREE_CODE (CP_DECL_CONTEXT (decl
)) != NAMESPACE_DECL
)
2372 /* In the case of a virtual function, we want the class in which
2374 ctx
= CP_DECL_CONTEXT (decl
);
2376 /* Otherwise, if we're currently definining some class, the DECL
2377 is assumed to be a member of the class. */
2378 ctx
= current_scope ();
2380 if (ctx
&& TREE_CODE (ctx
) == NAMESPACE_DECL
)
2383 if (!DECL_CONTEXT (decl
))
2384 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
2386 /* See if this is a primary template. */
2387 primary
= template_parm_scope_p ();
2391 if (current_lang_name
== lang_name_c
)
2392 cp_error ("template with C linkage");
2393 else if (TREE_CODE (decl
) == TYPE_DECL
2394 && ANON_AGGRNAME_P (DECL_NAME (decl
)))
2395 cp_error ("template class without a name");
2396 else if ((DECL_IMPLICIT_TYPEDEF_P (decl
)
2397 && CLASS_TYPE_P (TREE_TYPE (decl
)))
2398 || (TREE_CODE (decl
) == VAR_DECL
&& ctx
&& CLASS_TYPE_P (ctx
))
2399 || TREE_CODE (decl
) == FUNCTION_DECL
)
2402 cp_error ("template declaration of `%#D'", decl
);
2405 /* Check to see that the rules regarding the use of default
2406 arguments are not being violated. */
2407 check_default_tmpl_args (decl
, current_template_parms
,
2408 primary
, is_partial
);
2411 return process_partial_specialization (decl
);
2413 args
= current_template_args ();
2416 || TREE_CODE (ctx
) == FUNCTION_DECL
2417 || TYPE_BEING_DEFINED (ctx
)
2418 || (is_friend
&& !DECL_TEMPLATE_INFO (decl
)))
2420 if (DECL_LANG_SPECIFIC (decl
)
2421 && DECL_TEMPLATE_INFO (decl
)
2422 && DECL_TI_TEMPLATE (decl
))
2423 tmpl
= DECL_TI_TEMPLATE (decl
);
2424 /* If DECL is a TYPE_DECL for a class-template, then there won't
2425 be DECL_LANG_SPECIFIC. The information equivalent to
2426 DECL_TEMPLATE_INFO is found in TYPE_TEMPLATE_INFO instead. */
2427 else if (DECL_IMPLICIT_TYPEDEF_P (decl
)
2428 && TYPE_TEMPLATE_INFO (TREE_TYPE (decl
))
2429 && TYPE_TI_TEMPLATE (TREE_TYPE (decl
)))
2431 /* Since a template declaration already existed for this
2432 class-type, we must be redeclaring it here. Make sure
2433 that the redeclaration is legal. */
2434 redeclare_class_template (TREE_TYPE (decl
),
2435 current_template_parms
);
2436 /* We don't need to create a new TEMPLATE_DECL; just use the
2437 one we already had. */
2438 tmpl
= TYPE_TI_TEMPLATE (TREE_TYPE (decl
));
2442 tmpl
= build_template_decl (decl
, current_template_parms
);
2445 if (DECL_LANG_SPECIFIC (decl
)
2446 && DECL_TEMPLATE_SPECIALIZATION (decl
))
2448 /* A specialization of a member template of a template
2450 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
2451 DECL_TEMPLATE_INFO (tmpl
) = DECL_TEMPLATE_INFO (decl
);
2452 DECL_TEMPLATE_INFO (decl
) = NULL_TREE
;
2458 tree a
, t
, current
, parms
;
2461 if (TREE_CODE (decl
) == TYPE_DECL
)
2463 if ((IS_AGGR_TYPE_CODE (TREE_CODE (TREE_TYPE (decl
)))
2464 || TREE_CODE (TREE_TYPE (decl
)) == ENUMERAL_TYPE
)
2465 && TYPE_TEMPLATE_INFO (TREE_TYPE (decl
))
2466 && TYPE_TI_TEMPLATE (TREE_TYPE (decl
)))
2467 tmpl
= TYPE_TI_TEMPLATE (TREE_TYPE (decl
));
2470 cp_error ("`%D' does not declare a template type", decl
);
2474 else if (! DECL_TEMPLATE_INFO (decl
))
2476 cp_error ("template definition of non-template `%#D'", decl
);
2480 tmpl
= DECL_TI_TEMPLATE (decl
);
2482 if (is_member_template (tmpl
)
2483 && DECL_FUNCTION_TEMPLATE_P (tmpl
)
2484 && DECL_TEMPLATE_INFO (decl
) && DECL_TI_ARGS (decl
)
2485 && DECL_TEMPLATE_SPECIALIZATION (decl
))
2489 /* The declaration is a specialization of a member
2490 template, declared outside the class. Therefore, the
2491 innermost template arguments will be NULL, so we
2492 replace them with the arguments determined by the
2493 earlier call to check_explicit_specialization. */
2494 args
= DECL_TI_ARGS (decl
);
2497 = build_template_decl (decl
, current_template_parms
);
2498 DECL_TEMPLATE_RESULT (new_tmpl
) = decl
;
2499 TREE_TYPE (new_tmpl
) = TREE_TYPE (decl
);
2500 DECL_TI_TEMPLATE (decl
) = new_tmpl
;
2501 SET_DECL_TEMPLATE_SPECIALIZATION (new_tmpl
);
2502 DECL_TEMPLATE_INFO (new_tmpl
)
2503 = tree_cons (tmpl
, args
, NULL_TREE
);
2505 register_specialization (new_tmpl
, tmpl
, args
);
2509 /* Make sure the template headers we got make sense. */
2511 parms
= DECL_TEMPLATE_PARMS (tmpl
);
2512 i
= TMPL_PARMS_DEPTH (parms
);
2513 if (TMPL_ARGS_DEPTH (args
) != i
)
2515 cp_error ("expected %d levels of template parms for `%#D', got %d",
2516 i
, decl
, TMPL_ARGS_DEPTH (args
));
2519 for (current
= decl
; i
> 0; --i
, parms
= TREE_CHAIN (parms
))
2521 a
= TMPL_ARGS_LEVEL (args
, i
);
2522 t
= INNERMOST_TEMPLATE_PARMS (parms
);
2524 if (TREE_VEC_LENGTH (t
) != TREE_VEC_LENGTH (a
))
2526 if (current
== decl
)
2527 cp_error ("got %d template parameters for `%#D'",
2528 TREE_VEC_LENGTH (a
), decl
);
2530 cp_error ("got %d template parameters for `%#T'",
2531 TREE_VEC_LENGTH (a
), current
);
2532 cp_error (" but %d required", TREE_VEC_LENGTH (t
));
2535 /* Perhaps we should also check that the parms are used in the
2536 appropriate qualifying scopes in the declarator? */
2538 if (current
== decl
)
2541 current
= TYPE_CONTEXT (current
);
2545 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
2546 TREE_TYPE (tmpl
) = TREE_TYPE (decl
);
2548 /* Push template declarations for global functions and types. Note
2549 that we do not try to push a global template friend declared in a
2550 template class; such a thing may well depend on the template
2551 parameters of the class. */
2552 if (new_template_p
&& !ctx
2553 && !(is_friend
&& template_class_depth (current_class_type
) > 0))
2554 tmpl
= pushdecl_namespace_level (tmpl
);
2557 DECL_PRIMARY_TEMPLATE (tmpl
) = tmpl
;
2559 info
= tree_cons (tmpl
, args
, NULL_TREE
);
2561 if (DECL_IMPLICIT_TYPEDEF_P (decl
))
2563 SET_TYPE_TEMPLATE_INFO (TREE_TYPE (tmpl
), info
);
2564 if ((!ctx
|| TREE_CODE (ctx
) != FUNCTION_DECL
)
2565 && TREE_CODE (TREE_TYPE (decl
)) != ENUMERAL_TYPE
)
2566 DECL_NAME (decl
) = classtype_mangled_name (TREE_TYPE (decl
));
2568 else if (DECL_LANG_SPECIFIC (decl
))
2569 DECL_TEMPLATE_INFO (decl
) = info
;
2571 return DECL_TEMPLATE_RESULT (tmpl
);
2575 push_template_decl (decl
)
2578 return push_template_decl_real (decl
, 0);
2581 /* Called when a class template TYPE is redeclared with the indicated
2582 template PARMS, e.g.:
2584 template <class T> struct S;
2585 template <class T> struct S {}; */
2588 redeclare_class_template (type
, parms
)
2596 if (!TYPE_TEMPLATE_INFO (type
))
2598 cp_error ("`%T' is not a template type", type
);
2602 tmpl
= TYPE_TI_TEMPLATE (type
);
2603 if (!PRIMARY_TEMPLATE_P (tmpl
))
2604 /* The type is nested in some template class. Nothing to worry
2605 about here; there are no new template parameters for the nested
2609 parms
= INNERMOST_TEMPLATE_PARMS (parms
);
2610 tmpl_parms
= DECL_INNERMOST_TEMPLATE_PARMS (tmpl
);
2612 if (TREE_VEC_LENGTH (parms
) != TREE_VEC_LENGTH (tmpl_parms
))
2614 cp_error_at ("previous declaration `%D'", tmpl
);
2615 cp_error ("used %d template parameter%s instead of %d",
2616 TREE_VEC_LENGTH (tmpl_parms
),
2617 TREE_VEC_LENGTH (tmpl_parms
) == 1 ? "" : "s",
2618 TREE_VEC_LENGTH (parms
));
2622 for (i
= 0; i
< TREE_VEC_LENGTH (tmpl_parms
); ++i
)
2624 tree tmpl_parm
= TREE_VALUE (TREE_VEC_ELT (tmpl_parms
, i
));
2625 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
2626 tree tmpl_default
= TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
));
2627 tree parm_default
= TREE_PURPOSE (TREE_VEC_ELT (parms
, i
));
2629 if (TREE_CODE (tmpl_parm
) != TREE_CODE (parm
))
2631 cp_error_at ("template parameter `%#D'", tmpl_parm
);
2632 cp_error ("redeclared here as `%#D'", parm
);
2636 if (tmpl_default
!= NULL_TREE
&& parm_default
!= NULL_TREE
)
2638 /* We have in [temp.param]:
2640 A template-parameter may not be given default arguments
2641 by two different declarations in the same scope. */
2642 cp_error ("redefinition of default argument for `%#D'", parm
);
2643 cp_error_at (" original definition appeared here", tmpl_parm
);
2647 if (parm_default
!= NULL_TREE
)
2648 /* Update the previous template parameters (which are the ones
2649 that will really count) with the new default value. */
2650 TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
)) = parm_default
;
2651 else if (tmpl_default
!= NULL_TREE
)
2652 /* Update the new parameters, too; they'll be used as the
2653 parameters for any members. */
2654 TREE_PURPOSE (TREE_VEC_ELT (parms
, i
)) = tmpl_default
;
2658 /* Attempt to convert the non-type template parameter EXPR to the
2659 indicated TYPE. If the conversion is successful, return the
2660 converted value. If the conversion is unsuccesful, return
2661 NULL_TREE if we issued an error message, or error_mark_node if we
2662 did not. We issue error messages for out-and-out bad template
2663 parameters, but not simply because the conversion failed, since we
2664 might be just trying to do argument deduction. By the time this
2665 function is called, neither TYPE nor EXPR may make use of template
2669 convert_nontype_argument (type
, expr
)
2673 tree expr_type
= TREE_TYPE (expr
);
2675 /* A template-argument for a non-type, non-template
2676 template-parameter shall be one of:
2678 --an integral constant-expression of integral or enumeration
2681 --the name of a non-type template-parameter; or
2683 --the name of an object or function with external linkage,
2684 including function templates and function template-ids but
2685 excluding non-static class members, expressed as id-expression;
2688 --the address of an object or function with external linkage,
2689 including function templates and function template-ids but
2690 excluding non-static class members, expressed as & id-expression
2691 where the & is optional if the name refers to a function or
2694 --a pointer to member expressed as described in _expr.unary.op_. */
2696 /* An integral constant-expression can include const variables or
2697 enumerators. Simplify things by folding them to their values,
2698 unless we're about to bind the declaration to a reference
2700 if (INTEGRAL_TYPE_P (expr_type
)
2701 && TREE_CODE (type
) != REFERENCE_TYPE
)
2702 expr
= decl_constant_value (expr
);
2704 if (is_overloaded_fn (expr
))
2705 /* OK for now. We'll check that it has external linkage later.
2706 Check this first since if expr_type is the unknown_type_node
2707 we would otherwise complain below. */
2709 else if (TYPE_PTRMEM_P (expr_type
)
2710 || TYPE_PTRMEMFUNC_P (expr_type
))
2712 if (TREE_CODE (expr
) != PTRMEM_CST
)
2715 else if (TYPE_PTR_P (expr_type
)
2716 || TYPE_PTRMEM_P (expr_type
)
2717 || TREE_CODE (expr_type
) == ARRAY_TYPE
2718 || TREE_CODE (type
) == REFERENCE_TYPE
2719 /* If expr is the address of an overloaded function, we
2720 will get the unknown_type_node at this point. */
2721 || expr_type
== unknown_type_node
)
2727 if (TREE_CODE (type
) == REFERENCE_TYPE
2728 || TREE_CODE (expr_type
) == ARRAY_TYPE
)
2732 if (TREE_CODE (e
) != ADDR_EXPR
)
2735 cp_error ("`%E' is not a valid template argument", expr
);
2736 if (TYPE_PTR_P (expr_type
))
2738 if (TREE_CODE (TREE_TYPE (expr_type
)) == FUNCTION_TYPE
)
2739 cp_error ("it must be the address of a function with external linkage");
2741 cp_error ("it must be the address of an object with external linkage");
2743 else if (TYPE_PTRMEM_P (expr_type
)
2744 || TYPE_PTRMEMFUNC_P (expr_type
))
2745 cp_error ("it must be a pointer-to-member of the form `&X::Y'");
2750 referent
= TREE_OPERAND (e
, 0);
2751 STRIP_NOPS (referent
);
2754 if (TREE_CODE (referent
) == STRING_CST
)
2756 cp_error ("string literal %E is not a valid template argument because it is the address of an object with static linkage",
2761 if (is_overloaded_fn (referent
))
2762 /* We'll check that it has external linkage later. */
2764 else if (TREE_CODE (referent
) != VAR_DECL
)
2766 else if (!TREE_PUBLIC (referent
))
2768 cp_error ("address of non-extern `%E' cannot be used as template argument", referent
);
2769 return error_mark_node
;
2772 else if (INTEGRAL_TYPE_P (expr_type
)
2773 || TYPE_PTRMEM_P (expr_type
)
2774 || TYPE_PTRMEMFUNC_P (expr_type
)
2775 /* The next two are g++ extensions. */
2776 || TREE_CODE (expr_type
) == REAL_TYPE
2777 || TREE_CODE (expr_type
) == COMPLEX_TYPE
)
2779 if (! TREE_CONSTANT (expr
))
2782 cp_error ("non-constant `%E' cannot be used as template argument",
2789 cp_error ("object `%E' cannot be used as template argument", expr
);
2793 switch (TREE_CODE (type
))
2798 /* For a non-type template-parameter of integral or enumeration
2799 type, integral promotions (_conv.prom_) and integral
2800 conversions (_conv.integral_) are applied. */
2801 if (!INTEGRAL_TYPE_P (expr_type
))
2802 return error_mark_node
;
2804 /* It's safe to call digest_init in this case; we know we're
2805 just converting one integral constant expression to another. */
2806 expr
= digest_init (type
, expr
, (tree
*) 0);
2808 if (TREE_CODE (expr
) != INTEGER_CST
)
2809 /* Curiously, some TREE_CONSTANT integral expressions do not
2810 simplify to integer constants. For example, `3 % 0',
2811 remains a TRUNC_MOD_EXPR. */
2818 /* These are g++ extensions. */
2819 if (TREE_CODE (expr_type
) != TREE_CODE (type
))
2820 return error_mark_node
;
2822 expr
= digest_init (type
, expr
, (tree
*) 0);
2824 if (TREE_CODE (expr
) != REAL_CST
)
2831 tree type_pointed_to
= TREE_TYPE (type
);
2833 if (TYPE_PTRMEM_P (type
))
2837 /* For a non-type template-parameter of type pointer to data
2838 member, qualification conversions (_conv.qual_) are
2840 e
= perform_qualification_conversions (type
, expr
);
2841 if (TREE_CODE (e
) == NOP_EXPR
)
2842 /* The call to perform_qualification_conversions will
2843 insert a NOP_EXPR over EXPR to do express conversion,
2844 if necessary. But, that will confuse us if we use
2845 this (converted) template parameter to instantiate
2846 another template; then the thing will not look like a
2847 valid template argument. So, just make a new
2848 constant, of the appropriate type. */
2849 e
= make_ptrmem_cst (type
, PTRMEM_CST_MEMBER (expr
));
2852 else if (TREE_CODE (type_pointed_to
) == FUNCTION_TYPE
)
2854 /* For a non-type template-parameter of type pointer to
2855 function, only the function-to-pointer conversion
2856 (_conv.func_) is applied. If the template-argument
2857 represents a set of overloaded functions (or a pointer to
2858 such), the matching function is selected from the set
2863 if (TREE_CODE (expr
) == ADDR_EXPR
)
2864 fns
= TREE_OPERAND (expr
, 0);
2868 fn
= instantiate_type (type_pointed_to
, fns
, 0);
2870 if (fn
== error_mark_node
)
2871 return error_mark_node
;
2873 if (!TREE_PUBLIC (fn
))
2875 if (really_overloaded_fn (fns
))
2876 return error_mark_node
;
2881 expr
= build_unary_op (ADDR_EXPR
, fn
, 0);
2883 my_friendly_assert (same_type_p (type
, TREE_TYPE (expr
)),
2889 /* For a non-type template-parameter of type pointer to
2890 object, qualification conversions (_conv.qual_) and the
2891 array-to-pointer conversion (_conv.array_) are applied.
2892 [Note: In particular, neither the null pointer conversion
2893 (_conv.ptr_) nor the derived-to-base conversion
2894 (_conv.ptr_) are applied. Although 0 is a valid
2895 template-argument for a non-type template-parameter of
2896 integral type, it is not a valid template-argument for a
2897 non-type template-parameter of pointer type.]
2899 The call to decay_conversion performs the
2900 array-to-pointer conversion, if appropriate. */
2901 expr
= decay_conversion (expr
);
2903 if (expr
== error_mark_node
)
2904 return error_mark_node
;
2906 return perform_qualification_conversions (type
, expr
);
2911 case REFERENCE_TYPE
:
2913 tree type_referred_to
= TREE_TYPE (type
);
2915 if (TREE_CODE (type_referred_to
) == FUNCTION_TYPE
)
2917 /* For a non-type template-parameter of type reference to
2918 function, no conversions apply. If the
2919 template-argument represents a set of overloaded
2920 functions, the matching function is selected from the
2921 set (_over.over_). */
2925 fn
= instantiate_type (type_referred_to
, fns
, 0);
2927 if (fn
== error_mark_node
)
2928 return error_mark_node
;
2930 if (!TREE_PUBLIC (fn
))
2932 if (really_overloaded_fn (fns
))
2933 /* Don't issue an error here; we might get a different
2934 function if the overloading had worked out
2936 return error_mark_node
;
2941 my_friendly_assert (same_type_p (type_referred_to
,
2949 /* For a non-type template-parameter of type reference to
2950 object, no conversions apply. The type referred to by the
2951 reference may be more cv-qualified than the (otherwise
2952 identical) type of the template-argument. The
2953 template-parameter is bound directly to the
2954 template-argument, which must be an lvalue. */
2955 if ((TYPE_MAIN_VARIANT (expr_type
)
2956 != TYPE_MAIN_VARIANT (type_referred_to
))
2957 || !at_least_as_qualified_p (type_referred_to
,
2959 || !real_lvalue_p (expr
))
2960 return error_mark_node
;
2969 if (!TYPE_PTRMEMFUNC_P (type
))
2970 /* This handles templates like
2971 template<class T, T t> void f();
2972 when T is substituted with any class. The second template
2973 parameter becomes invalid and the template candidate is
2975 return error_mark_node
;
2977 /* For a non-type template-parameter of type pointer to member
2978 function, no conversions apply. If the template-argument
2979 represents a set of overloaded member functions, the
2980 matching member function is selected from the set
2983 if (!TYPE_PTRMEMFUNC_P (expr_type
) &&
2984 expr_type
!= unknown_type_node
)
2985 return error_mark_node
;
2987 if (TREE_CODE (expr
) == PTRMEM_CST
)
2989 /* A ptr-to-member constant. */
2990 if (!same_type_p (type
, expr_type
))
2991 return error_mark_node
;
2996 if (TREE_CODE (expr
) != ADDR_EXPR
)
2997 return error_mark_node
;
2999 expr
= instantiate_type (type
, expr
, 0);
3001 if (expr
== error_mark_node
)
3002 return error_mark_node
;
3004 my_friendly_assert (same_type_p (type
, TREE_TYPE (expr
)),
3011 /* All non-type parameters must have one of these types. */
3012 my_friendly_abort (0);
3016 return error_mark_node
;
3019 /* Return 1 if PARM_PARMS and ARG_PARMS matches using rule for
3020 template template parameters. Both PARM_PARMS and ARG_PARMS are
3021 vectors of TREE_LIST nodes containing TYPE_DECL, TEMPLATE_DECL
3024 ARG_PARMS may contain more parameters than PARM_PARMS. If this is
3025 the case, then extra parameters must have default arguments.
3027 Consider the example:
3028 template <class T, class Allocator = allocator> class vector;
3029 template<template <class U> class TT> class C;
3031 C<vector> is a valid instantiation. PARM_PARMS for the above code
3032 contains a TYPE_DECL (for U), ARG_PARMS contains two TYPE_DECLs (for
3033 T and Allocator) and OUTER_ARGS contains the argument that is used to
3034 substitute the TT parameter. */
3037 coerce_template_template_parms (parm_parms
, arg_parms
, complain
,
3038 in_decl
, outer_args
)
3039 tree parm_parms
, arg_parms
;
3041 tree in_decl
, outer_args
;
3043 int nparms
, nargs
, i
;
3046 my_friendly_assert (TREE_CODE (parm_parms
) == TREE_VEC
, 0);
3047 my_friendly_assert (TREE_CODE (arg_parms
) == TREE_VEC
, 0);
3049 nparms
= TREE_VEC_LENGTH (parm_parms
);
3050 nargs
= TREE_VEC_LENGTH (arg_parms
);
3052 /* The rule here is opposite of coerce_template_parms. */
3055 && TREE_PURPOSE (TREE_VEC_ELT (arg_parms
, nparms
)) == NULL_TREE
))
3058 for (i
= 0; i
< nparms
; ++i
)
3060 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, i
));
3061 arg
= TREE_VALUE (TREE_VEC_ELT (arg_parms
, i
));
3063 if (arg
== NULL_TREE
|| arg
== error_mark_node
3064 || parm
== NULL_TREE
|| parm
== error_mark_node
)
3067 if (TREE_CODE (arg
) != TREE_CODE (parm
))
3070 switch (TREE_CODE (parm
))
3076 /* We encounter instantiations of templates like
3077 template <template <template <class> class> class TT>
3080 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
3081 tree argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
3083 if (!coerce_template_template_parms (parmparm
, argparm
,
3091 /* The tsubst call is used to handle cases such as
3092 template <class T, template <T> class TT> class D;
3093 i.e. the parameter list of TT depends on earlier parameters. */
3094 if (!same_type_p (tsubst (TREE_TYPE (parm
), outer_args
,
3101 my_friendly_abort (0);
3107 /* Convert the indicated template ARG as necessary to match the
3108 indicated template PARM. Returns the converted ARG, or
3109 error_mark_node if the conversion was unsuccessful. Error messages
3110 are issued if COMPLAIN is non-zero. This conversion is for the Ith
3111 parameter in the parameter list. ARGS is the full set of template
3112 arguments deduced so far. */
3115 convert_template_argument (parm
, arg
, args
, complain
, i
, in_decl
)
3125 int is_type
, requires_type
, is_tmpl_type
, requires_tmpl_type
;
3127 inner_args
= innermost_args (args
);
3129 if (TREE_CODE (arg
) == TREE_LIST
3130 && TREE_TYPE (arg
) != NULL_TREE
3131 && TREE_CODE (TREE_TYPE (arg
)) == OFFSET_TYPE
)
3133 /* The template argument was the name of some
3134 member function. That's usually
3135 illegal, but static members are OK. In any
3136 case, grab the underlying fields/functions
3137 and issue an error later if required. */
3138 arg
= TREE_VALUE (arg
);
3139 TREE_TYPE (arg
) = unknown_type_node
;
3142 requires_tmpl_type
= TREE_CODE (parm
) == TEMPLATE_DECL
;
3143 requires_type
= (TREE_CODE (parm
) == TYPE_DECL
3144 || requires_tmpl_type
);
3146 /* Check if it is a class template. If REQUIRES_TMPL_TYPE is true,
3147 we also accept implicitly created TYPE_DECL as a valid argument.
3148 This is necessary to handle the case where we pass a template name
3149 to a template template parameter in a scope where we've derived from
3150 in instantiation of that template, so the template name refers to that
3151 instantiation. We really ought to handle this better. */
3153 = ((TREE_CODE (arg
) == TEMPLATE_DECL
3154 && TREE_CODE (DECL_TEMPLATE_RESULT (arg
)) == TYPE_DECL
)
3155 || (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
3156 && !TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (arg
))
3157 || (TREE_CODE (arg
) == RECORD_TYPE
3158 && CLASSTYPE_TEMPLATE_INFO (arg
)
3159 && TREE_CODE (TYPE_NAME (arg
)) == TYPE_DECL
3160 && DECL_ARTIFICIAL (TYPE_NAME (arg
))
3161 && requires_tmpl_type
3162 && is_base_of_enclosing_class (arg
, current_class_type
)));
3163 if (is_tmpl_type
&& TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
3164 arg
= TYPE_STUB_DECL (arg
);
3165 else if (is_tmpl_type
&& TREE_CODE (arg
) == RECORD_TYPE
)
3166 arg
= CLASSTYPE_TI_TEMPLATE (arg
);
3168 is_type
= TYPE_P (arg
) || is_tmpl_type
;
3170 if (requires_type
&& ! is_type
&& TREE_CODE (arg
) == SCOPE_REF
3171 && TREE_CODE (TREE_OPERAND (arg
, 0)) == TEMPLATE_TYPE_PARM
)
3173 cp_pedwarn ("to refer to a type member of a template parameter, use `typename %E'", arg
);
3175 arg
= make_typename_type (TREE_OPERAND (arg
, 0),
3176 TREE_OPERAND (arg
, 1),
3180 if (is_type
!= requires_type
)
3186 cp_error ("type/value mismatch at argument %d in template parameter list for `%D'",
3189 cp_error (" expected a constant of type `%T', got `%T'",
3191 (is_tmpl_type
? DECL_NAME (arg
) : arg
));
3193 cp_error (" expected a type, got `%E'", arg
);
3196 return error_mark_node
;
3198 if (is_tmpl_type
^ requires_tmpl_type
)
3200 if (in_decl
&& complain
)
3202 cp_error ("type/value mismatch at argument %d in template parameter list for `%D'",
3205 cp_error (" expected a type, got `%T'", DECL_NAME (arg
));
3207 cp_error (" expected a class template, got `%T'", arg
);
3209 return error_mark_node
;
3214 if (requires_tmpl_type
)
3216 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
3217 tree argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
3219 if (coerce_template_template_parms (parmparm
, argparm
, complain
,
3220 in_decl
, inner_args
))
3224 /* TEMPLATE_TEMPLATE_PARM node is preferred over
3226 if (val
!= error_mark_node
3227 && DECL_TEMPLATE_TEMPLATE_PARM_P (val
))
3228 val
= TREE_TYPE (val
);
3232 if (in_decl
&& complain
)
3234 cp_error ("type/value mismatch at argument %d in template parameter list for `%D'",
3236 cp_error (" expected a template of type `%D', got `%D'", parm
, arg
);
3239 val
= error_mark_node
;
3244 val
= groktypename (arg
);
3245 if (! processing_template_decl
)
3247 /* [basic.link]: A name with no linkage (notably, the
3248 name of a class or enumeration declared in a local
3249 scope) shall not be used to declare an entity with
3250 linkage. This implies that names with no linkage
3251 cannot be used as template arguments. */
3252 tree t
= no_linkage_check (val
);
3255 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
3257 ("template-argument `%T' uses anonymous type", val
);
3260 ("template-argument `%T' uses local type `%T'",
3262 return error_mark_node
;
3269 tree t
= tsubst (TREE_TYPE (parm
), args
, complain
, in_decl
);
3271 if (processing_template_decl
)
3272 arg
= maybe_fold_nontype_arg (arg
);
3274 if (!uses_template_parms (arg
) && !uses_template_parms (t
))
3275 /* We used to call digest_init here. However, digest_init
3276 will report errors, which we don't want when complain
3277 is zero. More importantly, digest_init will try too
3278 hard to convert things: for example, `0' should not be
3279 converted to pointer type at this point according to
3280 the standard. Accepting this is not merely an
3281 extension, since deciding whether or not these
3282 conversions can occur is part of determining which
3283 function template to call, or whether a given epxlicit
3284 argument specification is legal. */
3285 val
= convert_nontype_argument (t
, arg
);
3289 if (val
== NULL_TREE
)
3290 val
= error_mark_node
;
3291 else if (val
== error_mark_node
&& complain
)
3292 cp_error ("could not convert template argument `%E' to `%T'",
3299 /* Convert all template arguments to their appropriate types, and
3300 return a vector containing the innermost resulting template
3301 arguments. If any error occurs, return error_mark_node, and, if
3302 COMPLAIN is non-zero, issue an error message. Some error messages
3303 are issued even if COMPLAIN is zero; for instance, if a template
3304 argument is composed from a local class.
3306 If REQUIRE_ALL_ARGUMENTS is non-zero, all arguments must be
3307 provided in ARGLIST, or else trailing parameters must have default
3308 values. If REQUIRE_ALL_ARGUMENTS is zero, we will attempt argument
3309 deduction for any unspecified trailing arguments. */
3312 coerce_template_parms (parms
, args
, in_decl
,
3314 require_all_arguments
)
3318 int require_all_arguments
;
3320 int nparms
, nargs
, i
, lost
= 0;
3323 tree new_inner_args
;
3325 inner_args
= innermost_args (args
);
3326 nargs
= NUM_TMPL_ARGS (inner_args
);
3327 nparms
= TREE_VEC_LENGTH (parms
);
3331 && require_all_arguments
3332 && TREE_PURPOSE (TREE_VEC_ELT (parms
, nargs
)) == NULL_TREE
))
3336 cp_error ("wrong number of template arguments (%d, should be %d)",
3340 cp_error_at ("provided for `%D'", in_decl
);
3343 return error_mark_node
;
3346 new_inner_args
= make_tree_vec (nparms
);
3347 new_args
= add_outermost_template_args (args
, new_inner_args
);
3348 for (i
= 0; i
< nparms
; i
++)
3353 /* Get the Ith template parameter. */
3354 parm
= TREE_VEC_ELT (parms
, i
);
3356 /* Calculate the Ith argument. */
3357 if (inner_args
&& TREE_CODE (inner_args
) == TREE_LIST
)
3359 arg
= TREE_VALUE (inner_args
);
3360 inner_args
= TREE_CHAIN (inner_args
);
3363 arg
= TREE_VEC_ELT (inner_args
, i
);
3364 /* If no template argument was supplied, look for a default
3366 else if (TREE_PURPOSE (parm
) == NULL_TREE
)
3368 /* There was no default value. */
3369 my_friendly_assert (!require_all_arguments
, 0);
3372 else if (TREE_CODE (TREE_VALUE (parm
)) == TYPE_DECL
)
3373 arg
= tsubst (TREE_PURPOSE (parm
), new_args
, complain
, in_decl
);
3375 arg
= tsubst_expr (TREE_PURPOSE (parm
), new_args
, complain
,
3378 /* Now, convert the Ith argument, as necessary. */
3379 if (arg
== NULL_TREE
)
3380 /* We're out of arguments. */
3382 my_friendly_assert (!require_all_arguments
, 0);
3385 else if (arg
== error_mark_node
)
3387 cp_error ("template argument %d is invalid", i
+ 1);
3388 arg
= error_mark_node
;
3391 arg
= convert_template_argument (TREE_VALUE (parm
),
3392 arg
, new_args
, complain
, i
,
3395 if (arg
== error_mark_node
)
3397 TREE_VEC_ELT (new_inner_args
, i
) = arg
;
3401 return error_mark_node
;
3403 return new_inner_args
;
3406 /* Returns 1 if template args OT and NT are equivalent. */
3409 template_args_equal (ot
, nt
)
3414 if (TREE_CODE (nt
) != TREE_CODE (ot
))
3416 if (TREE_CODE (nt
) == TREE_VEC
)
3417 /* For member templates */
3418 return comp_template_args (ot
, nt
);
3419 else if (TYPE_P (ot
))
3420 return same_type_p (ot
, nt
);
3422 return (cp_tree_equal (ot
, nt
) > 0);
3425 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets
3426 of template arguments. Returns 0 otherwise. */
3429 comp_template_args (oldargs
, newargs
)
3430 tree oldargs
, newargs
;
3434 if (TREE_VEC_LENGTH (oldargs
) != TREE_VEC_LENGTH (newargs
))
3437 for (i
= 0; i
< TREE_VEC_LENGTH (oldargs
); ++i
)
3439 tree nt
= TREE_VEC_ELT (newargs
, i
);
3440 tree ot
= TREE_VEC_ELT (oldargs
, i
);
3442 if (! template_args_equal (ot
, nt
))
3448 /* Given class template name and parameter list, produce a user-friendly name
3449 for the instantiation. */
3452 mangle_class_name_for_template (name
, parms
, arglist
)
3454 tree parms
, arglist
;
3456 static struct obstack scratch_obstack
;
3457 static char *scratch_firstobj
;
3460 if (!scratch_firstobj
)
3461 gcc_obstack_init (&scratch_obstack
);
3463 obstack_free (&scratch_obstack
, scratch_firstobj
);
3464 scratch_firstobj
= obstack_alloc (&scratch_obstack
, 1);
3466 #define ccat(c) obstack_1grow (&scratch_obstack, (c));
3467 #define cat(s) obstack_grow (&scratch_obstack, (s), strlen (s))
3471 nparms
= TREE_VEC_LENGTH (parms
);
3472 arglist
= innermost_args (arglist
);
3473 my_friendly_assert (nparms
== TREE_VEC_LENGTH (arglist
), 268);
3474 for (i
= 0; i
< nparms
; i
++)
3476 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
3477 tree arg
= TREE_VEC_ELT (arglist
, i
);
3482 if (TREE_CODE (parm
) == TYPE_DECL
)
3484 cat (type_as_string (arg
, TS_CHASE_TYPEDEFS
));
3487 else if (TREE_CODE (parm
) == TEMPLATE_DECL
)
3489 if (TREE_CODE (arg
) == TEMPLATE_DECL
)
3491 /* Already substituted with real template. Just output
3492 the template name here */
3493 tree context
= DECL_CONTEXT (arg
);
3496 /* The template may be defined in a namespace, or
3497 may be a member template. */
3498 my_friendly_assert (TREE_CODE (context
) == NAMESPACE_DECL
3499 || CLASS_TYPE_P (context
),
3501 cat(decl_as_string (DECL_CONTEXT (arg
), 0));
3504 cat (IDENTIFIER_POINTER (DECL_NAME (arg
)));
3507 /* Output the parameter declaration */
3508 cat (type_as_string (arg
, TS_CHASE_TYPEDEFS
));
3512 my_friendly_assert (TREE_CODE (parm
) == PARM_DECL
, 269);
3514 if (TREE_CODE (arg
) == TREE_LIST
)
3516 /* New list cell was built because old chain link was in
3518 my_friendly_assert (TREE_PURPOSE (arg
) == NULL_TREE
, 270);
3519 arg
= TREE_VALUE (arg
);
3521 /* No need to check arglist against parmlist here; we did that
3522 in coerce_template_parms, called from lookup_template_class. */
3523 cat (expr_as_string (arg
, 0));
3526 char *bufp
= obstack_next_free (&scratch_obstack
);
3528 while (bufp
[offset
- 1] == ' ')
3530 obstack_blank_fast (&scratch_obstack
, offset
);
3532 /* B<C<char> >, not B<C<char>> */
3533 if (bufp
[offset
- 1] == '>')
3538 return (char *) obstack_base (&scratch_obstack
);
3542 classtype_mangled_name (t
)
3545 if (CLASSTYPE_TEMPLATE_INFO (t
)
3546 /* Specializations have already had their names set up in
3547 lookup_template_class. */
3548 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
3550 tree tmpl
= most_general_template (CLASSTYPE_TI_TEMPLATE (t
));
3552 /* For non-primary templates, the template parameters are
3553 implicit from their surrounding context. */
3554 if (PRIMARY_TEMPLATE_P (tmpl
))
3556 tree name
= DECL_NAME (tmpl
);
3557 char *mangled_name
= mangle_class_name_for_template
3558 (IDENTIFIER_POINTER (name
),
3559 DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
3560 CLASSTYPE_TI_ARGS (t
));
3561 tree id
= get_identifier (mangled_name
);
3562 IDENTIFIER_TEMPLATE (id
) = name
;
3567 return TYPE_IDENTIFIER (t
);
3571 add_pending_template (d
)
3574 tree ti
= (TYPE_P (d
)) ? CLASSTYPE_TEMPLATE_INFO (d
) : DECL_TEMPLATE_INFO (d
);
3576 if (TI_PENDING_TEMPLATE_FLAG (ti
))
3579 *template_tail
= tree_cons (build_srcloc_here (), d
, NULL_TREE
);
3580 template_tail
= &TREE_CHAIN (*template_tail
);
3581 TI_PENDING_TEMPLATE_FLAG (ti
) = 1;
3585 /* Return a TEMPLATE_ID_EXPR corresponding to the indicated FNS (which
3586 may be either a _DECL or an overloaded function or an
3587 IDENTIFIER_NODE), and ARGLIST. */
3590 lookup_template_function (fns
, arglist
)
3595 if (fns
== NULL_TREE
)
3597 cp_error ("non-template used as template");
3598 return error_mark_node
;
3601 type
= TREE_TYPE (fns
);
3602 if (TREE_CODE (fns
) == OVERLOAD
|| !type
)
3603 type
= unknown_type_node
;
3605 if (processing_template_decl
)
3606 return build_min (TEMPLATE_ID_EXPR
, type
, fns
, arglist
);
3608 return build (TEMPLATE_ID_EXPR
, type
, fns
, arglist
);
3611 /* Within the scope of a template class S<T>, the name S gets bound
3612 (in build_self_reference) to a TYPE_DECL for the class, not a
3613 TEMPLATE_DECL. If DECL is a TYPE_DECL for current_class_type,
3614 or one of its enclosing classes, and that type is a template,
3615 return the associated TEMPLATE_DECL. Otherwise, the original
3616 DECL is returned. */
3619 maybe_get_template_decl_from_type_decl (decl
)
3622 return (decl
!= NULL_TREE
3623 && TREE_CODE (decl
) == TYPE_DECL
3624 && DECL_ARTIFICIAL (decl
)
3625 && CLASS_TYPE_P (TREE_TYPE (decl
))
3626 && CLASSTYPE_TEMPLATE_INFO (TREE_TYPE (decl
)))
3627 ? CLASSTYPE_TI_TEMPLATE (TREE_TYPE (decl
)) : decl
;
3630 /* Given an IDENTIFIER_NODE (type TEMPLATE_DECL) and a chain of
3631 parameters, find the desired type.
3633 D1 is the PTYPENAME terminal, and ARGLIST is the list of arguments.
3634 (Actually ARGLIST may be either a TREE_LIST or a TREE_VEC. It will
3635 be a TREE_LIST if called directly from the parser, and a TREE_VEC
3636 otherwise.) Since ARGLIST is build on the temp_decl_obstack, we must
3637 copy it here to keep it from being reclaimed when the decl storage
3640 IN_DECL, if non-NULL, is the template declaration we are trying to
3643 If ENTERING_SCOPE is non-zero, we are about to enter the scope of
3644 the class we are looking up.
3646 If the template class is really a local class in a template
3647 function, then the FUNCTION_CONTEXT is the function in which it is
3648 being instantiated. */
3651 lookup_template_class (d1
, arglist
, in_decl
, context
, entering_scope
)
3657 tree
template = NULL_TREE
, parmlist
;
3660 if (TREE_CODE (d1
) == IDENTIFIER_NODE
)
3662 if (IDENTIFIER_VALUE (d1
)
3663 && DECL_TEMPLATE_TEMPLATE_PARM_P (IDENTIFIER_VALUE (d1
)))
3664 template = IDENTIFIER_VALUE (d1
);
3668 push_decl_namespace (context
);
3669 template = lookup_name (d1
, /*prefer_type=*/0);
3670 template = maybe_get_template_decl_from_type_decl (template);
3672 pop_decl_namespace ();
3675 context
= DECL_CONTEXT (template);
3677 else if (TREE_CODE (d1
) == TYPE_DECL
&& IS_AGGR_TYPE (TREE_TYPE (d1
)))
3679 tree type
= TREE_TYPE (d1
);
3681 /* If we are declaring a constructor, say A<T>::A<T>, we will get
3682 an implicit typename for the second A. Deal with it. */
3683 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
3684 type
= TREE_TYPE (type
);
3686 if (CLASSTYPE_TEMPLATE_INFO (type
))
3688 template = CLASSTYPE_TI_TEMPLATE (type
);
3689 d1
= DECL_NAME (template);
3692 else if (TREE_CODE (d1
) == ENUMERAL_TYPE
3693 || (TYPE_P (d1
) && IS_AGGR_TYPE (d1
)))
3695 template = TYPE_TI_TEMPLATE (d1
);
3696 d1
= DECL_NAME (template);
3698 else if (TREE_CODE (d1
) == TEMPLATE_DECL
3699 && TREE_CODE (DECL_TEMPLATE_RESULT (d1
)) == TYPE_DECL
)
3702 d1
= DECL_NAME (template);
3703 context
= DECL_CONTEXT (template);
3706 my_friendly_abort (272);
3708 /* With something like `template <class T> class X class X { ... };'
3709 we could end up with D1 having nothing but an IDENTIFIER_VALUE.
3710 We don't want to do that, but we have to deal with the situation,
3711 so let's give them some syntax errors to chew on instead of a
3715 cp_error ("`%T' is not a template", d1
);
3716 return error_mark_node
;
3719 if (context
== NULL_TREE
)
3720 context
= global_namespace
;
3722 if (TREE_CODE (template) != TEMPLATE_DECL
)
3724 cp_error ("non-template type `%T' used as a template", d1
);
3726 cp_error_at ("for template declaration `%D'", in_decl
);
3727 return error_mark_node
;
3730 if (DECL_TEMPLATE_TEMPLATE_PARM_P (template))
3732 /* Create a new TEMPLATE_DECL and TEMPLATE_TEMPLATE_PARM node to store
3733 template arguments */
3735 tree parm
= copy_template_template_parm (TREE_TYPE (template));
3736 tree template2
= TYPE_STUB_DECL (parm
);
3739 parmlist
= DECL_INNERMOST_TEMPLATE_PARMS (template);
3741 arglist2
= coerce_template_parms (parmlist
, arglist
, template, 1, 1);
3742 if (arglist2
== error_mark_node
)
3743 return error_mark_node
;
3745 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (parm
)
3746 = tree_cons (template2
, arglist2
, NULL_TREE
);
3747 TYPE_SIZE (parm
) = 0;
3752 tree template_type
= TREE_TYPE (template);
3755 tree found
= NULL_TREE
;
3758 int is_partial_instantiation
;
3760 gen_tmpl
= most_general_template (template);
3761 parmlist
= DECL_TEMPLATE_PARMS (gen_tmpl
);
3762 parm_depth
= TMPL_PARMS_DEPTH (parmlist
);
3763 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
3765 if (arg_depth
== 1 && parm_depth
> 1)
3767 /* We've been given an incomplete set of template arguments.
3770 template <class T> struct S1 {
3771 template <class U> struct S2 {};
3772 template <class U> struct S2<U*> {};
3775 we will be called with an ARGLIST of `U*', but the
3776 TEMPLATE will be `template <class T> template
3777 <class U> struct S1<T>::S2'. We must fill in the missing
3780 = add_outermost_template_args (TYPE_TI_ARGS (TREE_TYPE (template)),
3782 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
3785 /* Now we should enough arguments. */
3786 my_friendly_assert (parm_depth
== arg_depth
, 0);
3788 /* From here on, we're only interested in the most general
3790 template = gen_tmpl
;
3792 /* Calculate the BOUND_ARGS. These will be the args that are
3793 actually tsubst'd into the definition to create the
3797 /* We have multiple levels of arguments to coerce, at once. */
3799 int saved_depth
= TMPL_ARGS_DEPTH (arglist
);
3801 tree bound_args
= make_tree_vec (parm_depth
);
3803 for (i
= saved_depth
,
3804 t
= DECL_TEMPLATE_PARMS (template);
3805 i
> 0 && t
!= NULL_TREE
;
3806 --i
, t
= TREE_CHAIN (t
))
3808 tree a
= coerce_template_parms (TREE_VALUE (t
),
3809 arglist
, template, 1, 1);
3810 SET_TMPL_ARGS_LEVEL (bound_args
, i
, a
);
3812 /* We temporarily reduce the length of the ARGLIST so
3813 that coerce_template_parms will see only the arguments
3814 corresponding to the template parameters it is
3816 TREE_VEC_LENGTH (arglist
)--;
3819 /* Restore the ARGLIST to its full size. */
3820 TREE_VEC_LENGTH (arglist
) = saved_depth
;
3822 arglist
= bound_args
;
3826 = coerce_template_parms (INNERMOST_TEMPLATE_PARMS (parmlist
),
3827 innermost_args (arglist
),
3830 if (arglist
== error_mark_node
)
3831 /* We were unable to bind the arguments. */
3832 return error_mark_node
;
3834 /* In the scope of a template class, explicit references to the
3835 template class refer to the type of the template, not any
3836 instantiation of it. For example, in:
3838 template <class T> class C { void f(C<T>); }
3840 the `C<T>' is just the same as `C'. Outside of the
3841 class, however, such a reference is an instantiation. */
3842 if (comp_template_args (TYPE_TI_ARGS (template_type
),
3845 found
= template_type
;
3847 if (!entering_scope
&& PRIMARY_TEMPLATE_P (template))
3851 /* Note that we use DECL_CONTEXT, rather than
3852 CP_DECL_CONTEXT, so that the termination test is
3853 always just `ctx'. We're not interested in namepace
3855 for (ctx
= current_class_type
;
3857 ctx
= (TYPE_P (ctx
)) ? TYPE_CONTEXT (ctx
) : DECL_CONTEXT (ctx
))
3858 if (same_type_p (ctx
, template_type
))
3862 /* We're not in the scope of the class, so the
3863 TEMPLATE_TYPE is not the type we want after
3871 for (found
= DECL_TEMPLATE_INSTANTIATIONS (template);
3872 found
; found
= TREE_CHAIN (found
))
3873 if (comp_template_args (TREE_PURPOSE (found
), arglist
))
3877 found
= TREE_VALUE (found
);
3883 /* This type is a "partial instantiation" if any of the template
3884 arguments still inolve template parameters. Note that we set
3885 IS_PARTIAL_INSTANTIATION for partial specializations as
3887 is_partial_instantiation
= uses_template_parms (arglist
);
3889 if (!is_partial_instantiation
3890 && !PRIMARY_TEMPLATE_P (template)
3891 && TREE_CODE (CP_DECL_CONTEXT (template)) == NAMESPACE_DECL
)
3893 found
= xref_tag_from_type (TREE_TYPE (template),
3894 DECL_NAME (template),
3899 /* Create the type. */
3900 if (TREE_CODE (template_type
) == ENUMERAL_TYPE
)
3902 if (!is_partial_instantiation
)
3903 t
= start_enum (TYPE_IDENTIFIER (template_type
));
3905 /* We don't want to call start_enum for this type, since
3906 the values for the enumeration constants may involve
3907 template parameters. And, no one should be interested
3908 in the enumeration constants for such a type. */
3909 t
= make_node (ENUMERAL_TYPE
);
3913 t
= make_aggr_type (TREE_CODE (template_type
));
3914 CLASSTYPE_DECLARED_CLASS (t
)
3915 = CLASSTYPE_DECLARED_CLASS (template_type
);
3916 CLASSTYPE_GOT_SEMICOLON (t
) = 1;
3917 SET_CLASSTYPE_IMPLICIT_INSTANTIATION (t
);
3918 TYPE_FOR_JAVA (t
) = TYPE_FOR_JAVA (template_type
);
3920 /* A local class. Make sure the decl gets registered properly. */
3921 if (context
== current_function_decl
)
3922 pushtag (DECL_NAME (template), t
, 0);
3925 /* If we called start_enum or pushtag above, this information
3926 will already be set up. */
3929 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
3931 type_decl
= create_implicit_typedef (DECL_NAME (template), t
);
3932 DECL_CONTEXT (type_decl
) = TYPE_CONTEXT (t
);
3933 TYPE_STUB_DECL (t
) = type_decl
;
3934 DECL_SOURCE_FILE (type_decl
)
3935 = DECL_SOURCE_FILE (TYPE_STUB_DECL (template_type
));
3936 DECL_SOURCE_LINE (type_decl
)
3937 = DECL_SOURCE_LINE (TYPE_STUB_DECL (template_type
));
3940 type_decl
= TYPE_NAME (t
);
3942 /* Set up the template information. We have to figure out which
3943 template is the immediate parent if this is a full
3945 if (parm_depth
== 1 || is_partial_instantiation
3946 || !PRIMARY_TEMPLATE_P (template))
3947 /* This case is easy; there are no member templates involved. */
3951 /* This is a full instantiation of a member template. There
3952 should be some partial instantiation of which this is an
3955 for (found
= DECL_TEMPLATE_INSTANTIATIONS (template);
3956 found
; found
= TREE_CHAIN (found
))
3959 tree tmpl
= CLASSTYPE_TI_TEMPLATE (TREE_VALUE (found
));
3961 /* We only want partial instantiations, here, not
3962 specializations or full instantiations. */
3963 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_VALUE (found
))
3964 || !uses_template_parms (TREE_VALUE (found
)))
3967 /* Temporarily reduce by one the number of levels in the
3968 ARGLIST and in FOUND so as to avoid comparing the
3969 last set of arguments. */
3970 TREE_VEC_LENGTH (arglist
)--;
3971 TREE_VEC_LENGTH (TREE_PURPOSE (found
)) --;
3973 /* See if the arguments match. If they do, then TMPL is
3974 the partial instantiation we want. */
3975 success
= comp_template_args (TREE_PURPOSE (found
), arglist
);
3977 /* Restore the argument vectors to their full size. */
3978 TREE_VEC_LENGTH (arglist
)++;
3979 TREE_VEC_LENGTH (TREE_PURPOSE (found
))++;
3989 my_friendly_abort (0);
3992 SET_TYPE_TEMPLATE_INFO (t
,
3993 tree_cons (found
, arglist
, NULL_TREE
));
3994 DECL_TEMPLATE_INSTANTIATIONS (template)
3995 = tree_cons (arglist
, t
,
3996 DECL_TEMPLATE_INSTANTIATIONS (template));
3998 if (TREE_CODE (t
) == ENUMERAL_TYPE
3999 && !is_partial_instantiation
)
4000 /* Now that the type has been registered on the instantiations
4001 list, we set up the enumerators. Because the enumeration
4002 constants may involve the enumeration type itself, we make
4003 sure to register the type first, and then create the
4004 constants. That way, doing tsubst_expr for the enumeration
4005 constants won't result in recursive calls here; we'll find
4006 the instantiation and exit above. */
4007 tsubst_enum (template_type
, t
, arglist
);
4009 /* Reset the name of the type, now that CLASSTYPE_TEMPLATE_INFO
4011 if (TREE_CODE (t
) != ENUMERAL_TYPE
)
4012 DECL_NAME (type_decl
) = classtype_mangled_name (t
);
4013 DECL_ASSEMBLER_NAME (type_decl
) = DECL_NAME (type_decl
);
4014 if (!is_partial_instantiation
)
4016 DECL_ASSEMBLER_NAME (type_decl
)
4017 = get_identifier (build_overload_name (t
, 1, 1));
4019 /* For backwards compatibility; code that uses
4020 -fexternal-templates expects looking up a template to
4021 instantiate it. I think DDD still relies on this.
4022 (jason 8/20/1998) */
4023 if (TREE_CODE (t
) != ENUMERAL_TYPE
4024 && flag_external_templates
4025 && CLASSTYPE_INTERFACE_KNOWN (TREE_TYPE (template))
4026 && ! CLASSTYPE_INTERFACE_ONLY (TREE_TYPE (template)))
4027 add_pending_template (t
);
4030 /* If the type makes use of template parameters, the
4031 code that generates debugging information will crash. */
4032 DECL_IGNORED_P (TYPE_STUB_DECL (t
)) = 1;
4044 /* Called from for_each_template_parm via walk_tree. */
4047 for_each_template_parm_r (tp
, walk_subtrees
, d
)
4053 struct pair_fn_data
*pfd
= (struct pair_fn_data
*) d
;
4054 tree_fn_t fn
= pfd
->fn
;
4055 void *data
= pfd
->data
;
4058 && for_each_template_parm (TYPE_CONTEXT (t
), fn
, data
))
4059 return error_mark_node
;
4061 switch (TREE_CODE (t
))
4064 if (TYPE_PTRMEMFUNC_FLAG (t
))
4070 if (!TYPE_TEMPLATE_INFO (t
))
4072 else if (for_each_template_parm (TREE_VALUE (TYPE_TEMPLATE_INFO (t
)),
4074 return error_mark_node
;
4078 /* Since we're not going to walk subtrees, we have to do this
4080 if (for_each_template_parm (TYPE_METHOD_BASETYPE (t
), fn
, data
))
4081 return error_mark_node
;
4084 /* Check the return type. */
4085 if (for_each_template_parm (TREE_TYPE (t
), fn
, data
))
4086 return error_mark_node
;
4088 /* Check the parameter types. Since default arguments are not
4089 instantiated until they are needed, the TYPE_ARG_TYPES may
4090 contain expressions that involve template parameters. But,
4091 no-one should be looking at them yet. And, once they're
4092 instantiated, they don't contain template parameters, so
4093 there's no point in looking at them then, either. */
4097 for (parm
= TYPE_ARG_TYPES (t
); parm
; parm
= TREE_CHAIN (parm
))
4098 if (for_each_template_parm (TREE_VALUE (parm
), fn
, data
))
4099 return error_mark_node
;
4101 /* Since we've already handled the TYPE_ARG_TYPES, we don't
4102 want walk_tree walking into them itself. */
4109 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
)
4110 && for_each_template_parm (DECL_TI_ARGS (t
), fn
, data
))
4111 return error_mark_node
;
4116 if (DECL_CONTEXT (t
)
4117 && for_each_template_parm (DECL_CONTEXT (t
), fn
, data
))
4118 return error_mark_node
;
4121 case TEMPLATE_TEMPLATE_PARM
:
4122 /* Record template parameters such as `T' inside `TT<T>'. */
4123 if (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t
)
4124 && for_each_template_parm (TYPE_TI_ARGS (t
), fn
, data
))
4125 return error_mark_node
;
4128 case TEMPLATE_TYPE_PARM
:
4129 case TEMPLATE_PARM_INDEX
:
4130 if (fn
&& (*fn
)(t
, data
))
4131 return error_mark_node
;
4133 return error_mark_node
;
4137 /* A template template parameter is encountered */
4138 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
)
4139 && for_each_template_parm (TREE_TYPE (t
), fn
, data
))
4140 return error_mark_node
;
4142 /* Already substituted template template parameter */
4147 if (!fn
|| for_each_template_parm (TYPENAME_TYPE_FULLNAME (t
), fn
, data
))
4148 return error_mark_node
;
4152 if (TREE_TYPE (t
) && TYPE_PTRMEMFUNC_P (TREE_TYPE (t
))
4153 && for_each_template_parm (TYPE_PTRMEMFUNC_FN_TYPE
4154 (TREE_TYPE (t
)), fn
, data
))
4155 return error_mark_node
;
4160 /* If there's no type, then this thing must be some expression
4161 involving template parameters. */
4162 if (!fn
&& !TREE_TYPE (t
))
4163 return error_mark_node
;
4168 case REINTERPRET_CAST_EXPR
:
4169 case CONST_CAST_EXPR
:
4170 case STATIC_CAST_EXPR
:
4171 case DYNAMIC_CAST_EXPR
:
4176 case PSEUDO_DTOR_EXPR
:
4178 return error_mark_node
;
4185 /* We didn't find any template parameters we liked. */
4189 /* For each TEMPLATE_TYPE_PARM, TEMPLATE_TEMPLATE_PARM, or
4190 TEMPLATE_PARM_INDEX in T, call FN with the parameter and the DATA.
4191 If FN returns non-zero, the iteration is terminated, and
4192 for_each_template_parm returns 1. Otherwise, the iteration
4193 continues. If FN never returns a non-zero value, the value
4194 returned by for_each_template_parm is 0. If FN is NULL, it is
4195 considered to be the function which always returns 1. */
4198 for_each_template_parm (t
, fn
, data
)
4203 struct pair_fn_data pfd
;
4209 /* Walk the tree. */
4210 return walk_tree (&t
, for_each_template_parm_r
, &pfd
) != NULL_TREE
;
4214 uses_template_parms (t
)
4217 return for_each_template_parm (t
, 0, 0);
4220 static struct tinst_level
*current_tinst_level
;
4221 static struct tinst_level
*free_tinst_level
;
4222 static int tinst_depth
;
4223 extern int max_tinst_depth
;
4224 #ifdef GATHER_STATISTICS
4227 static int tinst_level_tick
;
4228 static int last_template_error_tick
;
4230 /* Print out all the template instantiations that we are currently
4231 working on. If ERR, we are being called from cp_thing, so do
4232 the right thing for an error message. */
4235 print_template_context (err
)
4238 struct tinst_level
*p
= current_tinst_level
;
4240 const char *file
= input_filename
;
4244 if (current_function_decl
!= p
->decl
4245 && current_function_decl
!= NULL_TREE
)
4246 /* We can get here during the processing of some synthesized
4247 method. Then, p->decl will be the function that's causing
4252 if (current_function_decl
== p
->decl
)
4253 /* Avoid redundancy with the the "In function" line. */;
4255 fprintf (stderr
, "%s: In instantiation of `%s':\n",
4256 file
, decl_as_string (p
->decl
, TS_DECL_TYPE
| TS_FUNC_NORETURN
));
4264 for (; p
; p
= p
->next
)
4266 fprintf (stderr
, "%s:%d: instantiated from `%s'\n", file
, line
,
4267 decl_as_string (p
->decl
, TS_DECL_TYPE
| TS_FUNC_NORETURN
));
4271 fprintf (stderr
, "%s:%d: instantiated from here\n", file
, line
);
4274 /* Called from cp_thing to print the template context for an error. */
4277 maybe_print_template_context ()
4279 if (last_template_error_tick
== tinst_level_tick
4280 || current_tinst_level
== 0)
4283 last_template_error_tick
= tinst_level_tick
;
4284 print_template_context (1);
4288 push_tinst_level (d
)
4291 struct tinst_level
*new;
4293 if (tinst_depth
>= max_tinst_depth
)
4295 /* If the instantiation in question still has unbound template parms,
4296 we don't really care if we can't instantiate it, so just return.
4297 This happens with base instantiation for implicit `typename'. */
4298 if (uses_template_parms (d
))
4301 last_template_error_tick
= tinst_level_tick
;
4302 cp_error ("template instantiation depth exceeds maximum of %d (use -ftemplate-depth-NN to increase the maximum) instantiating `%D'",
4303 max_tinst_depth
, d
);
4305 print_template_context (0);
4310 if (free_tinst_level
)
4312 new = free_tinst_level
;
4313 free_tinst_level
= new->next
;
4316 new = (struct tinst_level
*) xmalloc (sizeof (struct tinst_level
));
4320 new->file
= input_filename
;
4321 new->next
= current_tinst_level
;
4322 current_tinst_level
= new;
4325 #ifdef GATHER_STATISTICS
4326 if (tinst_depth
> depth_reached
)
4327 depth_reached
= tinst_depth
;
4337 struct tinst_level
*old
= current_tinst_level
;
4339 /* Restore the filename and line number stashed away when we started
4340 this instantiation. */
4342 input_filename
= old
->file
;
4343 extract_interface_info ();
4345 current_tinst_level
= old
->next
;
4346 old
->next
= free_tinst_level
;
4347 free_tinst_level
= old
;
4352 struct tinst_level
*
4355 struct tinst_level
*p
= current_tinst_level
;
4358 for (; p
->next
; p
= p
->next
)
4363 /* DECL is a friend FUNCTION_DECL or TEMPLATE_DECL. ARGS is the
4364 vector of template arguments, as for tsubst.
4366 Returns an appropriate tsbust'd friend declaration. */
4369 tsubst_friend_function (decl
, args
)
4375 const char *file
= input_filename
;
4377 lineno
= DECL_SOURCE_LINE (decl
);
4378 input_filename
= DECL_SOURCE_FILE (decl
);
4380 if (TREE_CODE (decl
) == FUNCTION_DECL
4381 && DECL_TEMPLATE_INSTANTIATION (decl
)
4382 && TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
4383 /* This was a friend declared with an explicit template
4384 argument list, e.g.:
4388 to indicate that f was a template instantiation, not a new
4389 function declaration. Now, we have to figure out what
4390 instantiation of what template. */
4397 = lookup_template_function (tsubst_expr (DECL_TI_TEMPLATE (decl
),
4398 args
, /*complain=*/1,
4400 tsubst (DECL_TI_ARGS (decl
),
4401 args
, /*complain=*/1,
4403 new_friend
= tsubst (decl
, args
, /*complain=*/1, NULL_TREE
);
4404 tmpl
= determine_specialization (template_id
, new_friend
,
4406 /*need_member_template=*/0);
4407 new_friend
= instantiate_template (tmpl
, new_args
);
4411 new_friend
= tsubst (decl
, args
, /*complain=*/1, NULL_TREE
);
4413 /* The NEW_FRIEND will look like an instantiation, to the
4414 compiler, but is not an instantiation from the point of view of
4415 the language. For example, we might have had:
4417 template <class T> struct S {
4418 template <class U> friend void f(T, U);
4421 Then, in S<int>, template <class U> void f(int, U) is not an
4422 instantiation of anything. */
4423 DECL_USE_TEMPLATE (new_friend
) = 0;
4424 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
4425 DECL_USE_TEMPLATE (DECL_TEMPLATE_RESULT (new_friend
)) = 0;
4427 /* The mangled name for the NEW_FRIEND is incorrect. The call to
4428 tsubst will have resulted in a call to
4429 set_mangled_name_for_template_decl. But, the function is not a
4430 template instantiation and should not be mangled like one.
4431 Therefore, we remangle the function name. We don't have to do
4432 this if the NEW_FRIEND is a template since
4433 set_mangled_name_for_template_decl doesn't do anything if the
4434 function declaration still uses template arguments. */
4435 if (TREE_CODE (new_friend
) != TEMPLATE_DECL
)
4437 set_mangled_name_for_decl (new_friend
);
4438 DECL_RTL (new_friend
) = 0;
4439 make_decl_rtl (new_friend
, NULL_PTR
, 1);
4442 if (DECL_NAMESPACE_SCOPE_P (new_friend
))
4445 tree new_friend_template_info
;
4446 tree new_friend_result_template_info
;
4448 int new_friend_is_defn
;
4450 /* We must save some information from NEW_FRIEND before calling
4451 duplicate decls since that function will free NEW_FRIEND if
4453 new_friend_template_info
= DECL_TEMPLATE_INFO (new_friend
);
4454 if (TREE_CODE (new_friend
) == TEMPLATE_DECL
)
4456 /* This declaration is a `primary' template. */
4457 DECL_PRIMARY_TEMPLATE (new_friend
) = new_friend
;
4460 = DECL_INITIAL (DECL_TEMPLATE_RESULT (new_friend
)) != NULL_TREE
;
4461 new_friend_result_template_info
4462 = DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (new_friend
));
4466 new_friend_is_defn
= DECL_INITIAL (new_friend
) != NULL_TREE
;
4467 new_friend_result_template_info
= NULL_TREE
;
4470 /* Inside pushdecl_namespace_level, we will push into the
4471 current namespace. However, the friend function should go
4472 into the namespace of the template. */
4473 ns
= decl_namespace_context (new_friend
);
4474 push_nested_namespace (ns
);
4475 old_decl
= pushdecl_namespace_level (new_friend
);
4476 pop_nested_namespace (ns
);
4478 if (old_decl
!= new_friend
)
4480 /* This new friend declaration matched an existing
4481 declaration. For example, given:
4483 template <class T> void f(T);
4484 template <class U> class C {
4485 template <class T> friend void f(T) {}
4488 the friend declaration actually provides the definition
4489 of `f', once C has been instantiated for some type. So,
4490 old_decl will be the out-of-class template declaration,
4491 while new_friend is the in-class definition.
4493 But, if `f' was called before this point, the
4494 instantiation of `f' will have DECL_TI_ARGS corresponding
4495 to `T' but not to `U', references to which might appear
4496 in the definition of `f'. Previously, the most general
4497 template for an instantiation of `f' was the out-of-class
4498 version; now it is the in-class version. Therefore, we
4499 run through all specialization of `f', adding to their
4500 DECL_TI_ARGS appropriately. In particular, they need a
4501 new set of outer arguments, corresponding to the
4502 arguments for this class instantiation.
4504 The same situation can arise with something like this:
4507 template <class T> class C {
4511 when `C<int>' is instantiated. Now, `f(int)' is defined
4514 if (!new_friend_is_defn
)
4515 /* On the other hand, if the in-class declaration does
4516 *not* provide a definition, then we don't want to alter
4517 existing definitions. We can just leave everything
4522 /* Overwrite whatever template info was there before, if
4523 any, with the new template information pertaining to
4525 DECL_TEMPLATE_INFO (old_decl
) = new_friend_template_info
;
4527 if (TREE_CODE (old_decl
) != TEMPLATE_DECL
)
4528 /* duplicate_decls will take care of this case. */
4533 tree new_friend_args
;
4535 DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (old_decl
))
4536 = new_friend_result_template_info
;
4538 new_friend_args
= TI_ARGS (new_friend_template_info
);
4539 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (old_decl
);
4543 tree spec
= TREE_VALUE (t
);
4546 = add_outermost_template_args (new_friend_args
,
4547 DECL_TI_ARGS (spec
));
4550 /* Now, since specializations are always supposed to
4551 hang off of the most general template, we must move
4553 t
= most_general_template (old_decl
);
4556 DECL_TEMPLATE_SPECIALIZATIONS (t
)
4557 = chainon (DECL_TEMPLATE_SPECIALIZATIONS (t
),
4558 DECL_TEMPLATE_SPECIALIZATIONS (old_decl
));
4559 DECL_TEMPLATE_SPECIALIZATIONS (old_decl
) = NULL_TREE
;
4564 /* The information from NEW_FRIEND has been merged into OLD_DECL
4565 by duplicate_decls. */
4566 new_friend
= old_decl
;
4569 else if (COMPLETE_TYPE_P (DECL_CONTEXT (new_friend
)))
4571 /* Check to see that the declaration is really present, and,
4572 possibly obtain an improved declaration. */
4573 tree fn
= check_classfn (DECL_CONTEXT (new_friend
),
4582 input_filename
= file
;
4586 /* FRIEND_TMPL is a friend TEMPLATE_DECL. ARGS is the vector of
4587 template arguments, as for tsubst.
4589 Returns an appropriate tsbust'd friend type. */
4592 tsubst_friend_class (friend_tmpl
, args
)
4599 /* First, we look for a class template. */
4600 tmpl
= lookup_name (DECL_NAME (friend_tmpl
), /*prefer_type=*/0);
4602 /* But, if we don't find one, it might be because we're in a
4603 situation like this:
4611 Here, in the scope of (say) S<int>, `S' is bound to a TYPE_DECL
4612 for `S<int>', not the TEMPLATE_DECL. */
4613 if (!tmpl
|| !DECL_CLASS_TEMPLATE_P (tmpl
))
4615 tmpl
= lookup_name (DECL_NAME (friend_tmpl
), /*prefer_type=*/1);
4616 tmpl
= maybe_get_template_decl_from_type_decl (tmpl
);
4619 if (tmpl
&& DECL_CLASS_TEMPLATE_P (tmpl
))
4621 /* The friend template has already been declared. Just
4622 check to see that the declarations match, and install any new
4623 default parameters. We must tsubst the default parameters,
4624 of course. We only need the innermost template parameters
4625 because that is all that redeclare_class_template will look
4628 = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_tmpl
),
4629 args
, /*complain=*/1);
4630 redeclare_class_template (TREE_TYPE (tmpl
), parms
);
4631 friend_type
= TREE_TYPE (tmpl
);
4635 /* The friend template has not already been declared. In this
4636 case, the instantiation of the template class will cause the
4637 injection of this template into the global scope. */
4638 tmpl
= tsubst (friend_tmpl
, args
, /*complain=*/1, NULL_TREE
);
4640 /* The new TMPL is not an instantiation of anything, so we
4641 forget its origins. We don't reset CLASSTYPE_TI_TEMPLATE for
4642 the new type because that is supposed to be the corresponding
4643 template decl, i.e., TMPL. */
4644 DECL_USE_TEMPLATE (tmpl
) = 0;
4645 DECL_TEMPLATE_INFO (tmpl
) = NULL_TREE
;
4646 CLASSTYPE_USE_TEMPLATE (TREE_TYPE (tmpl
)) = 0;
4648 /* Inject this template into the global scope. */
4649 friend_type
= TREE_TYPE (pushdecl_top_level (tmpl
));
4656 instantiate_class_template (type
)
4659 tree
template, args
, pattern
, t
;
4662 if (type
== error_mark_node
)
4663 return error_mark_node
;
4665 if (TYPE_BEING_DEFINED (type
) || COMPLETE_TYPE_P (type
))
4668 /* Figure out which template is being instantiated. */
4669 template = most_general_template (CLASSTYPE_TI_TEMPLATE (type
));
4670 my_friendly_assert (TREE_CODE (template) == TEMPLATE_DECL
, 279);
4672 /* Figure out which arguments are being used to do the
4674 args
= CLASSTYPE_TI_ARGS (type
);
4675 PARTIAL_INSTANTIATION_P (type
) = uses_template_parms (args
);
4677 if (pedantic
&& PARTIAL_INSTANTIATION_P (type
))
4678 /* If this is a partial instantiation, then we can't instantiate
4679 the type; there's no telling whether or not one of the
4680 template parameters might eventually be instantiated to some
4681 value that results in a specialization being used. For
4693 Now, the `S<U>' in `f<int>' is the specialization, not an
4694 instantiation of the original template. */
4697 /* Determine what specialization of the original template to
4699 if (PARTIAL_INSTANTIATION_P (type
))
4700 /* There's no telling which specialization is appropriate at this
4701 point. Since all peeking at the innards of this partial
4702 instantiation are extensions (like the "implicit typename"
4703 extension, which allows users to omit the keyword `typename' on
4704 names that are declared as types in template base classes), we
4705 are free to do what we please.
4707 Trying to figure out which partial instantiation to use can
4708 cause a crash. (Some of the template arguments don't even have
4709 types.) So, we just use the most general version. */
4713 t
= most_specialized_class (template, args
);
4715 if (t
== error_mark_node
)
4717 const char *str
= "candidates are:";
4718 cp_error ("ambiguous class template instantiation for `%#T'", type
);
4719 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (template); t
;
4722 if (get_class_bindings (TREE_VALUE (t
), TREE_PURPOSE (t
),
4725 cp_error_at ("%s %+#T", str
, TREE_TYPE (t
));
4729 TYPE_BEING_DEFINED (type
) = 1;
4730 return error_mark_node
;
4735 pattern
= TREE_TYPE (t
);
4737 pattern
= TREE_TYPE (template);
4739 /* If the template we're instantiating is incomplete, then clearly
4740 there's nothing we can do. */
4741 if (!COMPLETE_TYPE_P (pattern
))
4744 /* If this is a partial instantiation, don't tsubst anything. We will
4745 only use this type for implicit typename, so the actual contents don't
4746 matter. All that matters is whether a particular name is a type. */
4747 if (PARTIAL_INSTANTIATION_P (type
))
4749 /* The fields set here must be kept in sync with those cleared
4750 in begin_class_definition. */
4751 TYPE_BINFO_BASETYPES (type
) = TYPE_BINFO_BASETYPES (pattern
);
4752 TYPE_FIELDS (type
) = TYPE_FIELDS (pattern
);
4753 TYPE_METHODS (type
) = TYPE_METHODS (pattern
);
4754 CLASSTYPE_TAGS (type
) = CLASSTYPE_TAGS (pattern
);
4755 /* Pretend that the type is complete, so that we will look
4756 inside it during name lookup and such. */
4757 TYPE_SIZE (type
) = bitsize_zero_node
;
4761 /* If we've recursively instantiated too many templates, stop. */
4762 if (! push_tinst_level (type
))
4765 /* Now we're really doing the instantiation. Mark the type as in
4766 the process of being defined. */
4767 TYPE_BEING_DEFINED (type
) = 1;
4769 maybe_push_to_top_level (uses_template_parms (type
));
4773 /* This TYPE is actually a instantiation of of a partial
4774 specialization. We replace the innermost set of ARGS with
4775 the arguments appropriate for substitution. For example,
4778 template <class T> struct S {};
4779 template <class T> struct S<T*> {};
4781 and supposing that we are instantiating S<int*>, ARGS will
4782 present be {int*} but we need {int}. */
4784 = get_class_bindings (TREE_VALUE (t
), TREE_PURPOSE (t
),
4787 /* If there were multiple levels in ARGS, replacing the
4788 innermost level would alter CLASSTYPE_TI_ARGS, which we don't
4789 want, so we make a copy first. */
4790 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
4792 args
= copy_node (args
);
4793 SET_TMPL_ARGS_LEVEL (args
, TMPL_ARGS_DEPTH (args
), inner_args
);
4799 if (flag_external_templates
)
4801 if (flag_alt_external_templates
)
4803 CLASSTYPE_INTERFACE_ONLY (type
) = interface_only
;
4804 SET_CLASSTYPE_INTERFACE_UNKNOWN_X (type
, interface_unknown
);
4805 CLASSTYPE_VTABLE_NEEDS_WRITING (type
)
4806 = (! CLASSTYPE_INTERFACE_ONLY (type
)
4807 && CLASSTYPE_INTERFACE_KNOWN (type
));
4811 CLASSTYPE_INTERFACE_ONLY (type
) = CLASSTYPE_INTERFACE_ONLY (pattern
);
4812 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
4813 (type
, CLASSTYPE_INTERFACE_UNKNOWN (pattern
));
4814 CLASSTYPE_VTABLE_NEEDS_WRITING (type
)
4815 = (! CLASSTYPE_INTERFACE_ONLY (type
)
4816 && CLASSTYPE_INTERFACE_KNOWN (type
));
4821 SET_CLASSTYPE_INTERFACE_UNKNOWN (type
);
4822 CLASSTYPE_VTABLE_NEEDS_WRITING (type
) = 1;
4825 TYPE_HAS_CONSTRUCTOR (type
) = TYPE_HAS_CONSTRUCTOR (pattern
);
4826 TYPE_HAS_DESTRUCTOR (type
) = TYPE_HAS_DESTRUCTOR (pattern
);
4827 TYPE_OVERLOADS_CALL_EXPR (type
) = TYPE_OVERLOADS_CALL_EXPR (pattern
);
4828 TYPE_OVERLOADS_ARRAY_REF (type
) = TYPE_OVERLOADS_ARRAY_REF (pattern
);
4829 TYPE_OVERLOADS_ARROW (type
) = TYPE_OVERLOADS_ARROW (pattern
);
4830 TYPE_HAS_NEW_OPERATOR (type
) = TYPE_HAS_NEW_OPERATOR (pattern
);
4831 TYPE_HAS_ARRAY_NEW_OPERATOR (type
) = TYPE_HAS_ARRAY_NEW_OPERATOR (pattern
);
4832 TYPE_GETS_DELETE (type
) = TYPE_GETS_DELETE (pattern
);
4833 TYPE_VEC_DELETE_TAKES_SIZE (type
) = TYPE_VEC_DELETE_TAKES_SIZE (pattern
);
4834 TYPE_HAS_ASSIGN_REF (type
) = TYPE_HAS_ASSIGN_REF (pattern
);
4835 TYPE_HAS_CONST_ASSIGN_REF (type
) = TYPE_HAS_CONST_ASSIGN_REF (pattern
);
4836 TYPE_HAS_ABSTRACT_ASSIGN_REF (type
) = TYPE_HAS_ABSTRACT_ASSIGN_REF (pattern
);
4837 TYPE_HAS_INIT_REF (type
) = TYPE_HAS_INIT_REF (pattern
);
4838 TYPE_HAS_CONST_INIT_REF (type
) = TYPE_HAS_CONST_INIT_REF (pattern
);
4839 TYPE_HAS_DEFAULT_CONSTRUCTOR (type
) = TYPE_HAS_DEFAULT_CONSTRUCTOR (pattern
);
4840 TYPE_HAS_CONVERSION (type
) = TYPE_HAS_CONVERSION (pattern
);
4841 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (type
)
4842 = TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (pattern
);
4843 TYPE_USES_MULTIPLE_INHERITANCE (type
)
4844 = TYPE_USES_MULTIPLE_INHERITANCE (pattern
);
4845 TYPE_USES_VIRTUAL_BASECLASSES (type
)
4846 = TYPE_USES_VIRTUAL_BASECLASSES (pattern
);
4847 TYPE_PACKED (type
) = TYPE_PACKED (pattern
);
4848 TYPE_ALIGN (type
) = TYPE_ALIGN (pattern
);
4849 TYPE_FOR_JAVA (type
) = TYPE_FOR_JAVA (pattern
); /* For libjava's JArray<T> */
4850 if (ANON_AGGR_TYPE_P (pattern
))
4851 SET_ANON_AGGR_TYPE_P (type
);
4853 if (TYPE_BINFO_BASETYPES (pattern
))
4855 tree base_list
= NULL_TREE
;
4856 tree pbases
= TYPE_BINFO_BASETYPES (pattern
);
4859 /* Substitute into each of the bases to determine the actual
4861 for (i
= 0; i
< TREE_VEC_LENGTH (pbases
); ++i
)
4867 pbase
= TREE_VEC_ELT (pbases
, i
);
4869 /* Substitue to figure out the base class. */
4870 base
= tsubst (BINFO_TYPE (pbase
), args
,
4871 /*complain=*/1, NULL_TREE
);
4872 if (base
== error_mark_node
)
4875 /* Calculate the correct access node. */
4876 if (TREE_VIA_VIRTUAL (pbase
))
4878 if (TREE_VIA_PUBLIC (pbase
))
4879 access
= access_public_virtual_node
;
4880 else if (TREE_VIA_PROTECTED (pbase
))
4881 access
= access_protected_virtual_node
;
4883 access
= access_private_virtual_node
;
4887 if (TREE_VIA_PUBLIC (pbase
))
4888 access
= access_public_node
;
4889 else if (TREE_VIA_PROTECTED (pbase
))
4890 access
= access_protected_node
;
4892 access
= access_private_node
;
4895 base_list
= tree_cons (access
, base
, base_list
);
4898 /* The list is now in reverse order; correct that. */
4899 base_list
= nreverse (base_list
);
4901 /* Now call xref_basetypes to set up all the base-class
4903 xref_basetypes (TREE_CODE (pattern
) == RECORD_TYPE
4904 ? (CLASSTYPE_DECLARED_CLASS (pattern
)
4905 ? class_type_node
: record_type_node
)
4907 DECL_NAME (TYPE_NAME (pattern
)),
4912 /* Now that our base classes are set up, enter the scope of the
4913 class, so that name lookups into base classes, etc. will work
4914 corectly. This is precisely analagous to what we do in
4915 begin_class_definition when defining an ordinary non-template
4917 pushclass (type
, 1);
4919 for (t
= CLASSTYPE_TAGS (pattern
); t
; t
= TREE_CHAIN (t
))
4921 tree tag
= TREE_VALUE (t
);
4922 tree name
= TYPE_IDENTIFIER (tag
);
4925 newtag
= tsubst (tag
, args
, /*complain=*/1, NULL_TREE
);
4926 if (TREE_CODE (newtag
) != ENUMERAL_TYPE
)
4928 if (TYPE_LANG_SPECIFIC (tag
) && CLASSTYPE_IS_TEMPLATE (tag
))
4929 /* Unfortunately, lookup_template_class sets
4930 CLASSTYPE_IMPLICIT_INSTANTIATION for a partial
4931 instantiation (i.e., for the type of a member template
4932 class nested within a template class.) This behavior is
4933 required for maybe_process_partial_specialization to work
4934 correctly, but is not accurate in this case; the TAG is not
4935 an instantiation of anything. (The corresponding
4936 TEMPLATE_DECL is an instantiation, but the TYPE is not.) */
4937 CLASSTYPE_USE_TEMPLATE (newtag
) = 0;
4939 /* Now, we call pushtag to put this NEWTAG into the scope of
4940 TYPE. We first set up the IDENTIFIER_TYPE_VALUE to avoid
4941 pushtag calling push_template_decl. We don't have to do
4942 this for enums because it will already have been done in
4945 SET_IDENTIFIER_TYPE_VALUE (name
, newtag
);
4946 pushtag (name
, newtag
, /*globalize=*/0);
4950 /* Don't replace enum constants here. */
4951 for (t
= TYPE_FIELDS (pattern
); t
; t
= TREE_CHAIN (t
))
4952 if (TREE_CODE (t
) != CONST_DECL
)
4956 /* The the file and line for this declaration, to assist in
4957 error message reporting. Since we called push_tinst_level
4958 above, we don't need to restore these. */
4959 lineno
= DECL_SOURCE_LINE (t
);
4960 input_filename
= DECL_SOURCE_FILE (t
);
4962 r
= tsubst (t
, args
, /*complain=*/1, NULL_TREE
);
4963 if (TREE_CODE (r
) == VAR_DECL
)
4967 if (DECL_DEFINED_IN_CLASS_P (r
))
4968 init
= tsubst_expr (DECL_INITIAL (t
), args
,
4969 /*complain=*/1, NULL_TREE
);
4973 finish_static_data_member_decl (r
, init
,
4974 /*asmspec_tree=*/NULL_TREE
,
4977 if (DECL_DEFINED_IN_CLASS_P (r
))
4978 check_static_variable_definition (r
, TREE_TYPE (r
));
4981 /* R will have a TREE_CHAIN if and only if it has already been
4982 processed by finish_member_declaration. This can happen
4983 if, for example, it is a TYPE_DECL for a class-scoped
4984 ENUMERAL_TYPE; such a thing will already have been added to
4985 the field list by tsubst_enum above. */
4986 if (!TREE_CHAIN (r
))
4988 set_current_access_from_decl (r
);
4989 finish_member_declaration (r
);
4993 /* Set up the list (TYPE_METHODS) and vector (CLASSTYPE_METHOD_VEC)
4994 for this instantiation. */
4995 for (t
= TYPE_METHODS (pattern
); t
; t
= TREE_CHAIN (t
))
4997 tree r
= tsubst (t
, args
, /*complain=*/1, NULL_TREE
);
4998 set_current_access_from_decl (r
);
4999 finish_member_declaration (r
);
5002 /* Construct the DECL_FRIENDLIST for the new class type. */
5003 typedecl
= TYPE_MAIN_DECL (type
);
5004 for (t
= DECL_FRIENDLIST (TYPE_MAIN_DECL (pattern
));
5010 for (friends
= TREE_VALUE (t
);
5011 friends
!= NULL_TREE
;
5012 friends
= TREE_CHAIN (friends
))
5013 if (TREE_PURPOSE (friends
) == error_mark_node
)
5015 tsubst_friend_function (TREE_VALUE (friends
),
5018 my_friendly_abort (20000216);
5021 for (t
= CLASSTYPE_FRIEND_CLASSES (pattern
);
5025 tree friend_type
= TREE_VALUE (t
);
5026 tree new_friend_type
;
5028 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
5029 new_friend_type
= tsubst_friend_class (friend_type
, args
);
5030 else if (uses_template_parms (friend_type
))
5031 new_friend_type
= tsubst (friend_type
, args
, /*complain=*/1,
5035 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (friend_type
));
5037 /* The call to xref_tag_from_type does injection for friend
5039 push_nested_namespace (ns
);
5041 xref_tag_from_type (friend_type
, NULL_TREE
, 1);
5042 pop_nested_namespace (ns
);
5045 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
5046 /* Trick make_friend_class into realizing that the friend
5047 we're adding is a template, not an ordinary class. It's
5048 important that we use make_friend_class since it will
5049 perform some error-checking and output cross-reference
5051 ++processing_template_decl
;
5053 make_friend_class (type
, new_friend_type
);
5055 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
5056 --processing_template_decl
;
5059 for (t
= TYPE_FIELDS (type
); t
; t
= TREE_CHAIN (t
))
5060 if (TREE_CODE (t
) == FIELD_DECL
)
5062 TREE_TYPE (t
) = complete_type (TREE_TYPE (t
));
5063 require_complete_type (t
);
5066 /* Set the file and line number information to whatever is given for
5067 the class itself. This puts error messages involving generated
5068 implicit functions at a predictable point, and the same point
5069 that would be used for non-template classes. */
5070 lineno
= DECL_SOURCE_LINE (typedecl
);
5071 input_filename
= DECL_SOURCE_FILE (typedecl
);
5073 unreverse_member_declarations (type
);
5074 finish_struct_1 (type
);
5075 CLASSTYPE_GOT_SEMICOLON (type
) = 1;
5077 /* Clear this now so repo_template_used is happy. */
5078 TYPE_BEING_DEFINED (type
) = 0;
5079 repo_template_used (type
);
5081 /* Now that the class is complete, instantiate default arguments for
5082 any member functions. We don't do this earlier because the
5083 default arguments may reference members of the class. */
5084 if (!PRIMARY_TEMPLATE_P (template))
5085 for (t
= TYPE_METHODS (type
); t
; t
= TREE_CHAIN (t
))
5086 if (TREE_CODE (t
) == FUNCTION_DECL
5087 /* Implicitly generated member functions will not have tmplate
5088 information; they are not instantiations, but instead are
5089 created "fresh" for each instantiation. */
5090 && DECL_TEMPLATE_INFO (t
))
5091 tsubst_default_arguments (t
);
5094 pop_from_top_level ();
5104 if (t1
== NULL_TREE
)
5105 return t2
== NULL_TREE
;
5106 if (t2
== NULL_TREE
)
5108 /* Don't care if one declares its arg const and the other doesn't -- the
5109 main variant of the arg type is all that matters. */
5110 if (TYPE_MAIN_VARIANT (TREE_VALUE (t1
))
5111 != TYPE_MAIN_VARIANT (TREE_VALUE (t2
)))
5113 return list_eq (TREE_CHAIN (t1
), TREE_CHAIN (t2
));
5116 /* If arg is a non-type template parameter that does not depend on template
5117 arguments, fold it like we weren't in the body of a template. */
5120 maybe_fold_nontype_arg (arg
)
5123 /* If we're not in a template, ARG is already as simple as it's going to
5124 get, and trying to reprocess the trees will break. */
5125 if (! processing_template_decl
)
5128 if (!TYPE_P (arg
) && !uses_template_parms (arg
))
5130 /* Sometimes, one of the args was an expression involving a
5131 template constant parameter, like N - 1. Now that we've
5132 tsubst'd, we might have something like 2 - 1. This will
5133 confuse lookup_template_class, so we do constant folding
5134 here. We have to unset processing_template_decl, to
5135 fool build_expr_from_tree() into building an actual
5138 int saved_processing_template_decl
= processing_template_decl
;
5139 processing_template_decl
= 0;
5140 arg
= fold (build_expr_from_tree (arg
));
5141 processing_template_decl
= saved_processing_template_decl
;
5146 /* Return the TREE_VEC with the arguments for the innermost template header,
5147 where ARGS is either that or the VEC of VECs for all the
5151 innermost_args (args
)
5154 return TMPL_ARGS_LEVEL (args
, TMPL_ARGS_DEPTH (args
));
5157 /* Substitute ARGS into the vector of template arguments T. */
5160 tsubst_template_arg_vector (t
, args
, complain
)
5165 int len
= TREE_VEC_LENGTH (t
), need_new
= 0, i
;
5166 tree
*elts
= (tree
*) alloca (len
* sizeof (tree
));
5168 bzero ((char *) elts
, len
* sizeof (tree
));
5170 for (i
= 0; i
< len
; i
++)
5172 if (TREE_VEC_ELT (t
, i
) != NULL_TREE
5173 && TREE_CODE (TREE_VEC_ELT (t
, i
)) == TREE_VEC
)
5174 elts
[i
] = tsubst_template_arg_vector (TREE_VEC_ELT (t
, i
),
5177 elts
[i
] = maybe_fold_nontype_arg
5178 (tsubst_expr (TREE_VEC_ELT (t
, i
), args
, complain
,
5181 if (elts
[i
] != TREE_VEC_ELT (t
, i
))
5188 t
= make_tree_vec (len
);
5189 for (i
= 0; i
< len
; i
++)
5190 TREE_VEC_ELT (t
, i
) = elts
[i
];
5195 /* Return the result of substituting ARGS into the template parameters
5196 given by PARMS. If there are m levels of ARGS and m + n levels of
5197 PARMS, then the result will contain n levels of PARMS. For
5198 example, if PARMS is `template <class T> template <class U>
5199 template <T*, U, class V>' and ARGS is {{int}, {double}} then the
5200 result will be `template <int*, double, class V>'. */
5203 tsubst_template_parms (parms
, args
, complain
)
5211 for (new_parms
= &r
;
5212 TMPL_PARMS_DEPTH (parms
) > TMPL_ARGS_DEPTH (args
);
5213 new_parms
= &(TREE_CHAIN (*new_parms
)),
5214 parms
= TREE_CHAIN (parms
))
5217 make_tree_vec (TREE_VEC_LENGTH (TREE_VALUE (parms
)));
5220 for (i
= 0; i
< TREE_VEC_LENGTH (new_vec
); ++i
)
5222 tree default_value
=
5223 TREE_PURPOSE (TREE_VEC_ELT (TREE_VALUE (parms
), i
));
5225 TREE_VALUE (TREE_VEC_ELT (TREE_VALUE (parms
), i
));
5227 TREE_VEC_ELT (new_vec
, i
)
5228 = build_tree_list (tsubst (default_value
, args
, complain
,
5230 tsubst (parm_decl
, args
, complain
,
5235 tree_cons (build_int_2 (0, (TMPL_PARMS_DEPTH (parms
)
5236 - TMPL_ARGS_DEPTH (args
))),
5237 new_vec
, NULL_TREE
);
5243 /* Substitute the ARGS into the indicated aggregate (or enumeration)
5244 type T. If T is not an aggregate or enumeration type, it is
5245 handled as if by tsubst. IN_DECL is as for tsubst. If
5246 ENTERING_SCOPE is non-zero, T is the context for a template which
5247 we are presently tsubst'ing. Return the subsituted value. */
5250 tsubst_aggr_type (t
, args
, complain
, in_decl
, entering_scope
)
5260 switch (TREE_CODE (t
))
5263 if (TYPE_PTRMEMFUNC_P (t
))
5265 tree r
= build_ptrmemfunc_type
5266 (tsubst (TYPE_PTRMEMFUNC_FN_TYPE (t
), args
, complain
, in_decl
));
5267 return cp_build_qualified_type_real (r
, TYPE_QUALS (t
),
5271 /* else fall through */
5274 if (TYPE_TEMPLATE_INFO (t
))
5280 /* First, determine the context for the type we are looking
5282 if (TYPE_CONTEXT (t
) != NULL_TREE
)
5283 context
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
,
5285 in_decl
, /*entering_scope=*/1);
5287 context
= NULL_TREE
;
5289 /* Then, figure out what arguments are appropriate for the
5290 type we are trying to find. For example, given:
5292 template <class T> struct S;
5293 template <class T, class U> void f(T, U) { S<U> su; }
5295 and supposing that we are instantiating f<int, double>,
5296 then our ARGS will be {int, double}, but, when looking up
5297 S we only want {double}. */
5298 argvec
= tsubst_template_arg_vector (TYPE_TI_ARGS (t
), args
,
5301 r
= lookup_template_class (t
, argvec
, in_decl
, context
,
5304 return cp_build_qualified_type_real (r
, TYPE_QUALS (t
),
5308 /* This is not a template type, so there's nothing to do. */
5312 return tsubst (t
, args
, complain
, in_decl
);
5316 /* Substitute into the default argument ARG (a default argument for
5317 FN), which has the indicated TYPE. */
5320 tsubst_default_argument (fn
, type
, arg
)
5325 /* This default argument came from a template. Instantiate the
5326 default argument here, not in tsubst. In the case of
5335 we must be careful to do name lookup in the scope of S<T>,
5336 rather than in the current class. */
5337 if (DECL_CLASS_SCOPE_P (fn
))
5338 pushclass (DECL_CONTEXT (fn
), 2);
5340 arg
= tsubst_expr (arg
, DECL_TI_ARGS (fn
), /*complain=*/1, NULL_TREE
);
5342 if (DECL_CLASS_SCOPE_P (fn
))
5345 /* Make sure the default argument is reasonable. */
5346 arg
= check_default_argument (type
, arg
);
5351 /* Substitute into all the default arguments for FN. */
5354 tsubst_default_arguments (fn
)
5360 tmpl_args
= DECL_TI_ARGS (fn
);
5362 /* If this function is not yet instantiated, we certainly don't need
5363 its default arguments. */
5364 if (uses_template_parms (tmpl_args
))
5367 for (arg
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
5369 arg
= TREE_CHAIN (arg
))
5370 if (TREE_PURPOSE (arg
))
5371 TREE_PURPOSE (arg
) = tsubst_default_argument (fn
,
5373 TREE_PURPOSE (arg
));
5376 /* Substitute the ARGS into the T, which is a _DECL. TYPE is the
5377 (already computed) substitution of ARGS into TREE_TYPE (T), if
5378 appropriate. Return the result of the substitution. IN_DECL is as
5382 tsubst_decl (t
, args
, type
, in_decl
)
5389 const char *saved_filename
;
5392 /* Set the filename and linenumber to improve error-reporting. */
5393 saved_lineno
= lineno
;
5394 saved_filename
= input_filename
;
5395 lineno
= DECL_SOURCE_LINE (t
);
5396 input_filename
= DECL_SOURCE_FILE (t
);
5398 switch (TREE_CODE (t
))
5402 /* We can get here when processing a member template function
5403 of a template class. */
5404 tree decl
= DECL_TEMPLATE_RESULT (t
);
5406 int is_template_template_parm
= DECL_TEMPLATE_TEMPLATE_PARM_P (t
);
5408 if (!is_template_template_parm
)
5410 /* We might already have an instance of this template.
5411 The ARGS are for the surrounding class type, so the
5412 full args contain the tsubst'd args for the context,
5413 plus the innermost args from the template decl. */
5414 tree tmpl_args
= DECL_CLASS_TEMPLATE_P (t
)
5415 ? CLASSTYPE_TI_ARGS (TREE_TYPE (t
))
5416 : DECL_TI_ARGS (DECL_TEMPLATE_RESULT (t
));
5419 full_args
= tsubst_template_arg_vector (tmpl_args
, args
,
5422 /* tsubst_template_arg_vector doesn't copy the vector if
5423 nothing changed. But, *something* should have
5425 my_friendly_assert (full_args
!= tmpl_args
, 0);
5427 spec
= retrieve_specialization (t
, full_args
);
5428 if (spec
!= NULL_TREE
)
5435 /* Make a new template decl. It will be similar to the
5436 original, but will record the current template arguments.
5437 We also create a new function declaration, which is just
5438 like the old one, but points to this new template, rather
5439 than the old one. */
5441 my_friendly_assert (DECL_LANG_SPECIFIC (r
) != 0, 0);
5442 TREE_CHAIN (r
) = NULL_TREE
;
5444 if (is_template_template_parm
)
5446 tree new_decl
= tsubst (decl
, args
, /*complain=*/1, in_decl
);
5447 DECL_TEMPLATE_RESULT (r
) = new_decl
;
5448 TREE_TYPE (r
) = TREE_TYPE (new_decl
);
5453 = tsubst_aggr_type (DECL_CONTEXT (t
), args
,
5454 /*complain=*/1, in_decl
,
5455 /*entering_scope=*/1);
5456 DECL_VIRTUAL_CONTEXT (r
)
5457 = tsubst_aggr_type (DECL_VIRTUAL_CONTEXT (t
), args
,
5458 /*complain=*/1, in_decl
,
5459 /*entering_scope=*/1);
5460 DECL_TEMPLATE_INFO (r
) = build_tree_list (t
, args
);
5462 if (TREE_CODE (decl
) == TYPE_DECL
)
5464 tree new_type
= tsubst (TREE_TYPE (t
), args
,
5465 /*complain=*/1, in_decl
);
5466 TREE_TYPE (r
) = new_type
;
5467 CLASSTYPE_TI_TEMPLATE (new_type
) = r
;
5468 DECL_TEMPLATE_RESULT (r
) = TYPE_MAIN_DECL (new_type
);
5469 DECL_TI_ARGS (r
) = CLASSTYPE_TI_ARGS (new_type
);
5473 tree new_decl
= tsubst (decl
, args
, /*complain=*/1, in_decl
);
5475 DECL_TEMPLATE_RESULT (r
) = new_decl
;
5476 DECL_TI_TEMPLATE (new_decl
) = r
;
5477 TREE_TYPE (r
) = TREE_TYPE (new_decl
);
5478 DECL_TI_ARGS (r
) = DECL_TI_ARGS (new_decl
);
5481 SET_DECL_IMPLICIT_INSTANTIATION (r
);
5482 DECL_TEMPLATE_INSTANTIATIONS (r
) = NULL_TREE
;
5483 DECL_TEMPLATE_SPECIALIZATIONS (r
) = NULL_TREE
;
5485 /* The template parameters for this new template are all the
5486 template parameters for the old template, except the
5487 outermost level of parameters. */
5488 DECL_TEMPLATE_PARMS (r
)
5489 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t
), args
,
5492 if (PRIMARY_TEMPLATE_P (t
))
5493 DECL_PRIMARY_TEMPLATE (r
) = r
;
5495 /* We don't partially instantiate partial specializations. */
5496 if (TREE_CODE (decl
) == TYPE_DECL
)
5499 for (spec
= DECL_TEMPLATE_SPECIALIZATIONS (t
);
5501 spec
= TREE_CHAIN (spec
))
5503 /* It helps to consider example here. Consider:
5514 Now, for example, we are instantiating S<int>::f(U u).
5515 We want to make a template:
5520 It will have a specialization, for the case U = int*, of
5524 void S<int>::f<int*>(int*);
5526 This specialization will be an instantiation of
5527 the specialization given in the declaration of S, with
5528 argument list int*. */
5530 tree fn
= TREE_VALUE (spec
);
5534 if (!DECL_TEMPLATE_SPECIALIZATION (fn
))
5535 /* Instantiations are on the same list, but they're of
5536 no concern to us. */
5539 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
5540 /* A full specialization. There's no need to record
5544 spec_args
= tsubst (DECL_TI_ARGS (fn
), args
,
5545 /*complain=*/1, in_decl
);
5547 = tsubst (DECL_TEMPLATE_RESULT (most_general_template (fn
)),
5548 spec_args
, /*complain=*/1, in_decl
);
5549 DECL_TI_TEMPLATE (new_fn
) = fn
;
5550 register_specialization (new_fn
, r
,
5551 innermost_args (spec_args
));
5554 /* Record this partial instantiation. */
5555 register_specialization (r
, t
,
5556 DECL_TI_ARGS (DECL_TEMPLATE_RESULT (r
)));
5564 tree argvec
= NULL_TREE
;
5571 /* Nobody should be tsubst'ing into non-template functions. */
5572 my_friendly_assert (DECL_TEMPLATE_INFO (t
) != NULL_TREE
, 0);
5574 if (TREE_CODE (DECL_TI_TEMPLATE (t
)) == TEMPLATE_DECL
)
5578 /* Calculate the most general template of which R is a
5579 specialization, and the complete set of arguments used to
5581 gen_tmpl
= most_general_template (DECL_TI_TEMPLATE (t
));
5583 = tsubst_template_arg_vector (DECL_TI_ARGS
5584 (DECL_TEMPLATE_RESULT (gen_tmpl
)),
5585 args
, /*complain=*/1);
5587 /* Check to see if we already have this specialization. */
5588 spec
= retrieve_specialization (gen_tmpl
, argvec
);
5596 /* Here, we deal with the peculiar case:
5598 template <class T> struct S {
5599 template <class U> friend void f();
5601 template <class U> void f() {}
5603 template void f<double>();
5605 Here, the ARGS for the instantiation of will be {int,
5606 double}. But, we only need as many ARGS as there are
5607 levels of template parameters in CODE_PATTERN. We are
5608 careful not to get fooled into reducing the ARGS in
5611 template <class T> struct S { template <class U> void f(U); }
5612 template <class T> template <> void S<T>::f(int) {}
5614 which we can spot because the pattern will be a
5615 specialization in this case. */
5616 args_depth
= TMPL_ARGS_DEPTH (args
);
5618 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (t
)));
5619 if (args_depth
> parms_depth
5620 && !DECL_TEMPLATE_SPECIALIZATION (t
))
5622 my_friendly_assert (DECL_FRIEND_P (t
), 0);
5624 if (parms_depth
> 1)
5628 args
= make_tree_vec (parms_depth
);
5629 for (i
= 0; i
< parms_depth
; ++i
)
5630 TREE_VEC_ELT (args
, i
) =
5631 TREE_VEC_ELT (args
, i
+ (args_depth
- parms_depth
));
5634 args
= TREE_VEC_ELT (args
, args_depth
- parms_depth
);
5639 /* This special case arises when we have something like this:
5641 template <class T> struct S {
5642 friend void f<int>(int, double);
5645 Here, the DECL_TI_TEMPLATE for the friend declaration
5646 will be a LOOKUP_EXPR or an IDENTIFIER_NODE. We are
5647 being called from tsubst_friend_function, and we want
5648 only to create a new decl (R) with appropriate types so
5649 that we can call determine_specialization. */
5650 my_friendly_assert ((TREE_CODE (DECL_TI_TEMPLATE (t
))
5652 || (TREE_CODE (DECL_TI_TEMPLATE (t
))
5653 == IDENTIFIER_NODE
), 0);
5654 gen_tmpl
= NULL_TREE
;
5657 if (DECL_CLASS_SCOPE_P (t
))
5659 if (DECL_NAME (t
) == constructor_name (DECL_CONTEXT (t
)))
5663 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
,
5665 /*entering_scope=*/1);
5670 ctx
= DECL_CONTEXT (t
);
5672 type
= tsubst (type
, args
, /*complain=*/1, in_decl
);
5673 if (type
== error_mark_node
)
5674 return error_mark_node
;
5676 /* We do NOT check for matching decls pushed separately at this
5677 point, as they may not represent instantiations of this
5678 template, and in any case are considered separate under the
5679 discrete model. Instead, see add_maybe_template. */
5681 DECL_USE_TEMPLATE (r
) = 0;
5682 TREE_TYPE (r
) = type
;
5684 DECL_CONTEXT (r
) = ctx
;
5685 DECL_VIRTUAL_CONTEXT (r
)
5686 = tsubst_aggr_type (DECL_VIRTUAL_CONTEXT (t
), args
,
5688 /*entering_scope=*/1);
5690 if (member
&& DECL_CONV_FN_P (r
))
5691 /* Type-conversion operator. Reconstruct the name, in
5692 case it's the name of one of the template's parameters. */
5693 DECL_NAME (r
) = build_typename_overload (TREE_TYPE (type
));
5695 DECL_ARGUMENTS (r
) = tsubst (DECL_ARGUMENTS (t
), args
,
5697 DECL_TEMPLATE_RESULT (r
) = NULL_TREE
;
5699 TREE_STATIC (r
) = 0;
5700 TREE_PUBLIC (r
) = TREE_PUBLIC (t
);
5701 DECL_EXTERNAL (r
) = 1;
5702 DECL_INTERFACE_KNOWN (r
) = 0;
5703 DECL_DEFER_OUTPUT (r
) = 0;
5704 TREE_CHAIN (r
) = NULL_TREE
;
5705 DECL_PENDING_INLINE_INFO (r
) = 0;
5706 DECL_PENDING_INLINE_P (r
) = 0;
5708 if (DECL_CLONED_FUNCTION (r
))
5710 DECL_CLONED_FUNCTION (r
) = tsubst (DECL_CLONED_FUNCTION (t
),
5711 args
, /*complain=*/1, t
);
5712 TREE_CHAIN (r
) = TREE_CHAIN (DECL_CLONED_FUNCTION (r
));
5713 TREE_CHAIN (DECL_CLONED_FUNCTION (r
)) = r
;
5716 /* Set up the DECL_TEMPLATE_INFO for R and compute its mangled
5717 name. There's no need to do this in the special friend
5718 case mentioned above where GEN_TMPL is NULL. */
5721 DECL_TEMPLATE_INFO (r
)
5722 = tree_cons (gen_tmpl
, argvec
, NULL_TREE
);
5723 SET_DECL_IMPLICIT_INSTANTIATION (r
);
5724 register_specialization (r
, gen_tmpl
, argvec
);
5726 /* Set the mangled name for R. */
5727 if (DECL_DESTRUCTOR_P (t
))
5728 DECL_ASSEMBLER_NAME (r
) = build_destructor_name (ctx
);
5731 /* Instantiations of template functions must be mangled
5732 specially, in order to conform to 14.5.5.1
5733 [temp.over.link]. */
5734 tree tmpl
= DECL_TI_TEMPLATE (t
);
5736 /* TMPL will be NULL if this is a specialization of a
5737 member function of a template class. */
5738 if (name_mangling_version
< 1
5739 || tmpl
== NULL_TREE
5740 || (member
&& !is_member_template (tmpl
)
5741 && !DECL_TEMPLATE_INFO (tmpl
)))
5742 set_mangled_name_for_decl (r
);
5744 set_mangled_name_for_template_decl (r
);
5748 make_decl_rtl (r
, NULL_PTR
, 1);
5750 /* Like grokfndecl. If we don't do this, pushdecl will
5751 mess up our TREE_CHAIN because it doesn't find a
5752 previous decl. Sigh. */
5754 && ! uses_template_parms (r
)
5755 && (IDENTIFIER_GLOBAL_VALUE (DECL_ASSEMBLER_NAME (r
))
5757 SET_IDENTIFIER_GLOBAL_VALUE (DECL_ASSEMBLER_NAME (r
), r
);
5759 /* We're not supposed to instantiate default arguments
5760 until they are called, for a template. But, for a
5763 template <class T> void f ()
5764 { extern void g(int i = T()); }
5766 we should do the substitution when the template is
5767 instantiated. We handle the member function case in
5768 instantiate_class_template since the default arguments
5769 might refer to other members of the class. */
5771 && !PRIMARY_TEMPLATE_P (gen_tmpl
)
5772 && !uses_template_parms (argvec
))
5773 tsubst_default_arguments (r
);
5776 /* Copy the list of befriending classes. */
5777 for (friends
= &DECL_BEFRIENDING_CLASSES (r
);
5779 friends
= &TREE_CHAIN (*friends
))
5781 *friends
= copy_node (*friends
);
5782 TREE_VALUE (*friends
) = tsubst (TREE_VALUE (*friends
),
5783 args
, /*complain=*/1,
5787 if (DECL_CONSTRUCTOR_P (r
) || DECL_DESTRUCTOR_P (r
))
5789 maybe_retrofit_in_chrg (r
);
5790 if (DECL_CONSTRUCTOR_P (r
))
5791 grok_ctor_properties (ctx
, r
);
5793 else if (DECL_OVERLOADED_OPERATOR_P (r
))
5794 grok_op_properties (r
, DECL_VIRTUAL_P (r
), DECL_FRIEND_P (r
));
5801 TREE_TYPE (r
) = type
;
5802 c_apply_type_quals_to_decl (CP_TYPE_QUALS (type
), r
);
5804 if (TREE_CODE (DECL_INITIAL (r
)) != TEMPLATE_PARM_INDEX
)
5805 DECL_INITIAL (r
) = TREE_TYPE (r
);
5807 DECL_INITIAL (r
) = tsubst (DECL_INITIAL (r
), args
,
5808 /*complain=*/1, in_decl
);
5810 DECL_CONTEXT (r
) = NULL_TREE
;
5811 if (PROMOTE_PROTOTYPES
5812 && (TREE_CODE (type
) == INTEGER_TYPE
5813 || TREE_CODE (type
) == ENUMERAL_TYPE
)
5814 && TYPE_PRECISION (type
) < TYPE_PRECISION (integer_type_node
))
5815 DECL_ARG_TYPE (r
) = integer_type_node
;
5817 TREE_CHAIN (r
) = tsubst (TREE_CHAIN (t
), args
,
5818 /*complain=*/1, TREE_CHAIN (t
));
5825 TREE_TYPE (r
) = type
;
5826 c_apply_type_quals_to_decl (CP_TYPE_QUALS (type
), r
);
5828 /* We don't have to set DECL_CONTEXT here; it is set by
5829 finish_member_declaration. */
5830 DECL_INITIAL (r
) = tsubst_expr (DECL_INITIAL (t
), args
,
5831 /*complain=*/1, in_decl
);
5832 TREE_CHAIN (r
) = NULL_TREE
;
5833 if (TREE_CODE (type
) == VOID_TYPE
)
5834 cp_error_at ("instantiation of `%D' as type void", r
);
5842 = tsubst_copy (DECL_INITIAL (t
), args
, /*complain=*/1, in_decl
);
5843 TREE_CHAIN (r
) = NULL_TREE
;
5848 if (DECL_IMPLICIT_TYPEDEF_P (t
))
5850 /* For an implicit typedef, we just want the implicit
5851 typedef for the tsubst'd type. We've already got the
5852 tsubst'd type, as TYPE, so we just need it's associated
5854 r
= TYPE_NAME (type
);
5857 else if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
5858 || TREE_CODE (type
) == TEMPLATE_TEMPLATE_PARM
)
5860 /* For a template type parameter, we don't have to do
5861 anything special. */
5862 r
= TYPE_NAME (type
);
5870 tree argvec
= NULL_TREE
;
5871 tree gen_tmpl
= NULL_TREE
;
5873 tree tmpl
= NULL_TREE
;
5877 /* Assume this is a non-local variable. */
5880 if (TYPE_P (CP_DECL_CONTEXT (t
)))
5881 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
,
5883 in_decl
, /*entering_scope=*/1);
5886 /* Subsequent calls to pushdecl will fill this in. */
5888 if (!DECL_NAMESPACE_SCOPE_P (t
))
5892 /* Check to see if we already have this specialization. */
5895 tmpl
= DECL_TI_TEMPLATE (t
);
5896 gen_tmpl
= most_general_template (tmpl
);
5897 argvec
= tsubst (DECL_TI_ARGS (t
), args
, /*complain=*/1, in_decl
);
5898 spec
= retrieve_specialization (gen_tmpl
, argvec
);
5901 spec
= retrieve_local_specialization (t
);
5910 TREE_TYPE (r
) = type
;
5911 c_apply_type_quals_to_decl (CP_TYPE_QUALS (type
), r
);
5912 DECL_CONTEXT (r
) = ctx
;
5914 /* Don't try to expand the initializer until someone tries to use
5915 this variable; otherwise we run into circular dependencies. */
5916 DECL_INITIAL (r
) = NULL_TREE
;
5918 DECL_SIZE (r
) = DECL_SIZE_UNIT (r
) = 0;
5920 /* For __PRETTY_FUNCTION__ we have to adjust the initializer. */
5921 if (DECL_PRETTY_FUNCTION_P (r
))
5923 DECL_INITIAL (r
) = tsubst (DECL_INITIAL (t
),
5927 TREE_TYPE (r
) = TREE_TYPE (DECL_INITIAL (r
));
5930 /* Even if the original location is out of scope, the newly
5931 substituted one is not. */
5932 if (TREE_CODE (r
) == VAR_DECL
)
5933 DECL_DEAD_FOR_LOCAL (r
) = 0;
5937 /* A static data member declaration is always marked
5938 external when it is declared in-class, even if an
5939 initializer is present. We mimic the non-template
5941 DECL_EXTERNAL (r
) = 1;
5943 register_specialization (r
, gen_tmpl
, argvec
);
5944 DECL_TEMPLATE_INFO (r
) = tree_cons (tmpl
, argvec
, NULL_TREE
);
5945 SET_DECL_IMPLICIT_INSTANTIATION (r
);
5948 register_local_specialization (r
, t
);
5950 TREE_CHAIN (r
) = NULL_TREE
;
5951 if (TREE_CODE (r
) == VAR_DECL
&& TREE_CODE (type
) == VOID_TYPE
)
5952 cp_error_at ("instantiation of `%D' as type void", r
);
5957 my_friendly_abort (0);
5960 /* Restore the file and line information. */
5961 lineno
= saved_lineno
;
5962 input_filename
= saved_filename
;
5967 /* Substitue into the ARG_TYPES of a function type. */
5970 tsubst_arg_types (arg_types
, args
, complain
, in_decl
)
5976 tree remaining_arg_types
;
5979 if (!arg_types
|| arg_types
== void_list_node
)
5982 remaining_arg_types
= tsubst_arg_types (TREE_CHAIN (arg_types
),
5983 args
, complain
, in_decl
);
5984 if (remaining_arg_types
== error_mark_node
)
5985 return error_mark_node
;
5987 type
= tsubst (TREE_VALUE (arg_types
), args
, complain
, in_decl
);
5988 if (type
== error_mark_node
)
5989 return error_mark_node
;
5991 /* Do array-to-pointer, function-to-pointer conversion, and ignore
5992 top-level qualifiers as required. */
5993 type
= TYPE_MAIN_VARIANT (type_decays_to (type
));
5995 /* Note that we do not substitute into default arguments here. The
5996 standard mandates that they be instantiated only when needed,
5997 which is done in build_over_call. */
5998 return hash_tree_cons (TREE_PURPOSE (arg_types
), type
,
5999 remaining_arg_types
);
6003 /* Substitute into a FUNCTION_TYPE or METHOD_TYPE. This routine does
6004 *not* handle the exception-specification for FNTYPE, because the
6005 initial substitution of explicitly provided template parameters
6006 during argument deduction forbids substitution into the
6007 exception-specification:
6011 All references in the function type of the function template to the
6012 corresponding template parameters are replaced by the specified tem-
6013 plate argument values. If a substitution in a template parameter or
6014 in the function type of the function template results in an invalid
6015 type, type deduction fails. [Note: The equivalent substitution in
6016 exception specifications is done only when the function is instanti-
6017 ated, at which point a program is ill-formed if the substitution
6018 results in an invalid type.] */
6021 tsubst_function_type (t
, args
, complain
, in_decl
)
6031 /* The TYPE_CONTEXT is not used for function/method types. */
6032 my_friendly_assert (TYPE_CONTEXT (t
) == NULL_TREE
, 0);
6034 /* Substitue the return type. */
6035 return_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
6036 if (return_type
== error_mark_node
)
6037 return error_mark_node
;
6039 /* Substitue the argument types. */
6040 arg_types
= tsubst_arg_types (TYPE_ARG_TYPES (t
), args
,
6042 if (arg_types
== error_mark_node
)
6043 return error_mark_node
;
6045 /* Construct a new type node and return it. */
6046 if (TREE_CODE (t
) == FUNCTION_TYPE
)
6047 fntype
= build_function_type (return_type
, arg_types
);
6050 tree r
= TREE_TYPE (TREE_VALUE (arg_types
));
6051 if (! IS_AGGR_TYPE (r
))
6055 Type deduction may fail for any of the following
6058 -- Attempting to create "pointer to member of T" when T
6059 is not a class type. */
6061 cp_error ("creating pointer to member function of non-class type `%T'",
6063 return error_mark_node
;
6066 fntype
= build_cplus_method_type (r
, return_type
, TREE_CHAIN
6069 fntype
= build_qualified_type (fntype
, TYPE_QUALS (t
));
6070 fntype
= build_type_attribute_variant (fntype
, TYPE_ATTRIBUTES (t
));
6075 /* Substitute into the PARMS of a call-declarator. */
6078 tsubst_call_declarator_parms (parms
, args
, complain
, in_decl
)
6088 if (!parms
|| parms
== void_list_node
)
6091 new_parms
= tsubst_call_declarator_parms (TREE_CHAIN (parms
),
6092 args
, complain
, in_decl
);
6094 /* Figure out the type of this parameter. */
6095 type
= tsubst (TREE_VALUE (parms
), args
, complain
, in_decl
);
6097 /* Figure out the default argument as well. Note that we use
6098 tsubst_expr since the default argument is really an expression. */
6099 defarg
= tsubst_expr (TREE_PURPOSE (parms
), args
, complain
, in_decl
);
6101 /* Chain this parameter on to the front of those we have already
6102 processed. We don't use hash_tree_cons because that function
6103 doesn't check TREE_PARMLIST. */
6104 new_parms
= tree_cons (defarg
, type
, new_parms
);
6106 /* And note that these are parameters. */
6107 TREE_PARMLIST (new_parms
) = 1;
6112 /* Take the tree structure T and replace template parameters used
6113 therein with the argument vector ARGS. IN_DECL is an associated
6114 decl for diagnostics. If an error occurs, returns ERROR_MARK_NODE.
6115 An appropriate error message is issued only if COMPLAIN is
6116 non-zero. Note that we must be relatively non-tolerant of
6117 extensions here, in order to preserve conformance; if we allow
6118 substitutions that should not be allowed, we may allow argument
6119 deductions that should not succeed, and therefore report ambiguous
6120 overload situations where there are none. In theory, we could
6121 allow the substitution, but indicate that it should have failed,
6122 and allow our caller to make sure that the right thing happens, but
6123 we don't try to do this yet.
6125 This function is used for dealing with types, decls and the like;
6126 for expressions, use tsubst_expr or tsubst_copy. */
6129 tsubst (t
, args
, complain
, in_decl
)
6136 if (t
== NULL_TREE
|| t
== error_mark_node
6137 || t
== integer_type_node
6138 || t
== void_type_node
6139 || t
== char_type_node
6140 || TREE_CODE (t
) == NAMESPACE_DECL
)
6143 if (TREE_CODE (t
) == IDENTIFIER_NODE
)
6144 type
= IDENTIFIER_TYPE_VALUE (t
);
6146 type
= TREE_TYPE (t
);
6147 if (type
== unknown_type_node
)
6148 my_friendly_abort (42);
6150 if (type
&& TREE_CODE (t
) != FUNCTION_DECL
6151 && TREE_CODE (t
) != TYPENAME_TYPE
6152 && TREE_CODE (t
) != TEMPLATE_DECL
6153 && TREE_CODE (t
) != IDENTIFIER_NODE
6154 && TREE_CODE (t
) != FUNCTION_TYPE
6155 && TREE_CODE (t
) != METHOD_TYPE
)
6156 type
= tsubst (type
, args
, complain
, in_decl
);
6157 if (type
== error_mark_node
)
6158 return error_mark_node
;
6161 return tsubst_decl (t
, args
, type
, in_decl
);
6163 switch (TREE_CODE (t
))
6168 return tsubst_aggr_type (t
, args
, complain
, in_decl
,
6169 /*entering_scope=*/0);
6172 case IDENTIFIER_NODE
:
6184 if (t
== integer_type_node
)
6187 if (TREE_CODE (TYPE_MIN_VALUE (t
)) == INTEGER_CST
6188 && TREE_CODE (TYPE_MAX_VALUE (t
)) == INTEGER_CST
)
6192 tree max
, omax
= TREE_OPERAND (TYPE_MAX_VALUE (t
), 0);
6194 max
= tsubst_expr (omax
, args
, complain
, in_decl
);
6195 if (max
== error_mark_node
)
6196 return error_mark_node
;
6198 /* See if we can reduce this expression to something simpler. */
6199 max
= maybe_fold_nontype_arg (max
);
6200 if (!processing_template_decl
)
6201 max
= decl_constant_value (max
);
6203 if (processing_template_decl
6204 /* When providing explicit arguments to a template
6205 function, but leaving some arguments for subsequent
6206 deduction, MAX may be template-dependent even if we're
6207 not PROCESSING_TEMPLATE_DECL. We still need to check for
6208 template parms, though; MAX won't be an INTEGER_CST for
6209 dynamic arrays, either. */
6210 || (TREE_CODE (max
) != INTEGER_CST
6211 && uses_template_parms (max
)))
6213 tree itype
= make_node (INTEGER_TYPE
);
6214 TYPE_MIN_VALUE (itype
) = size_zero_node
;
6215 TYPE_MAX_VALUE (itype
) = build_min (MINUS_EXPR
, sizetype
, max
,
6220 if (integer_zerop (omax
))
6222 /* Still allow an explicit array of size zero. */
6224 pedwarn ("creating array with size zero");
6226 else if (integer_zerop (max
)
6227 || (TREE_CODE (max
) == INTEGER_CST
6228 && INT_CST_LT (max
, integer_zero_node
)))
6232 Type deduction may fail for any of the following
6235 Attempting to create an array with a size that is
6236 zero or negative. */
6238 cp_error ("creating array with size zero (`%E')", max
);
6240 return error_mark_node
;
6243 return compute_array_index_type (NULL_TREE
, max
);
6246 case TEMPLATE_TYPE_PARM
:
6247 case TEMPLATE_TEMPLATE_PARM
:
6248 case TEMPLATE_PARM_INDEX
:
6256 if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
6257 || TREE_CODE (t
) == TEMPLATE_TEMPLATE_PARM
)
6259 idx
= TEMPLATE_TYPE_IDX (t
);
6260 level
= TEMPLATE_TYPE_LEVEL (t
);
6264 idx
= TEMPLATE_PARM_IDX (t
);
6265 level
= TEMPLATE_PARM_LEVEL (t
);
6268 if (TREE_VEC_LENGTH (args
) > 0)
6270 tree arg
= NULL_TREE
;
6272 levels
= TMPL_ARGS_DEPTH (args
);
6273 if (level
<= levels
)
6274 arg
= TMPL_ARG (args
, level
, idx
);
6276 if (arg
== error_mark_node
)
6277 return error_mark_node
;
6278 else if (arg
!= NULL_TREE
)
6280 if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
6282 my_friendly_assert (TYPE_P (arg
), 0);
6283 return cp_build_qualified_type_real
6284 (arg
, CP_TYPE_QUALS (arg
) | CP_TYPE_QUALS (t
),
6287 else if (TREE_CODE (t
) == TEMPLATE_TEMPLATE_PARM
)
6289 if (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t
))
6291 /* We are processing a type constructed from
6292 a template template parameter */
6293 tree argvec
= tsubst (TYPE_TI_ARGS (t
),
6294 args
, complain
, in_decl
);
6295 if (argvec
== error_mark_node
)
6296 return error_mark_node
;
6298 /* We can get a TEMPLATE_TEMPLATE_PARM here when
6299 we are resolving nested-types in the signature of
6300 a member function templates.
6301 Otherwise ARG is a TEMPLATE_DECL and is the real
6302 template to be instantiated. */
6303 if (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
6304 arg
= TYPE_NAME (arg
);
6306 r
= lookup_template_class (DECL_NAME (arg
),
6309 /*entering_scope=*/0);
6310 return cp_build_qualified_type_real (r
,
6315 /* We are processing a template argument list. */
6323 my_friendly_abort (981018);
6326 /* This can happen during the attempted tsubst'ing in
6327 unify. This means that we don't yet have any information
6328 about the template parameter in question. */
6331 /* If we get here, we must have been looking at a parm for a
6332 more deeply nested template. Make a new version of this
6333 template parameter, but with a lower level. */
6334 switch (TREE_CODE (t
))
6336 case TEMPLATE_TYPE_PARM
:
6337 case TEMPLATE_TEMPLATE_PARM
:
6339 TEMPLATE_TYPE_PARM_INDEX (r
)
6340 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (t
),
6342 TYPE_STUB_DECL (r
) = TYPE_NAME (r
) = TEMPLATE_TYPE_DECL (r
);
6343 TYPE_MAIN_VARIANT (r
) = r
;
6344 TYPE_POINTER_TO (r
) = NULL_TREE
;
6345 TYPE_REFERENCE_TO (r
) = NULL_TREE
;
6347 if (TREE_CODE (t
) == TEMPLATE_TEMPLATE_PARM
6348 && TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t
))
6350 tree argvec
= tsubst (TYPE_TI_ARGS (t
), args
,
6352 if (argvec
== error_mark_node
)
6353 return error_mark_node
;
6355 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (r
)
6356 = tree_cons (TYPE_NAME (t
), argvec
, NULL_TREE
);
6360 case TEMPLATE_PARM_INDEX
:
6361 r
= reduce_template_parm_level (t
, type
, levels
);
6365 my_friendly_abort (0);
6373 tree purpose
, value
, chain
, result
;
6375 if (t
== void_list_node
)
6378 purpose
= TREE_PURPOSE (t
);
6381 purpose
= tsubst (purpose
, args
, complain
, in_decl
);
6382 if (purpose
== error_mark_node
)
6383 return error_mark_node
;
6385 value
= TREE_VALUE (t
);
6388 value
= tsubst (value
, args
, complain
, in_decl
);
6389 if (value
== error_mark_node
)
6390 return error_mark_node
;
6392 chain
= TREE_CHAIN (t
);
6393 if (chain
&& chain
!= void_type_node
)
6395 chain
= tsubst (chain
, args
, complain
, in_decl
);
6396 if (chain
== error_mark_node
)
6397 return error_mark_node
;
6399 if (purpose
== TREE_PURPOSE (t
)
6400 && value
== TREE_VALUE (t
)
6401 && chain
== TREE_CHAIN (t
))
6403 result
= hash_tree_cons (purpose
, value
, chain
);
6404 TREE_PARMLIST (result
) = TREE_PARMLIST (t
);
6408 if (type
!= NULL_TREE
)
6410 /* A binfo node. We always need to make a copy, of the node
6411 itself and of its BINFO_BASETYPES. */
6415 /* Make sure type isn't a typedef copy. */
6416 type
= BINFO_TYPE (TYPE_BINFO (type
));
6418 TREE_TYPE (t
) = complete_type (type
);
6419 if (IS_AGGR_TYPE (type
))
6421 BINFO_VTABLE (t
) = TYPE_BINFO_VTABLE (type
);
6422 BINFO_VIRTUALS (t
) = TYPE_BINFO_VIRTUALS (type
);
6423 if (TYPE_BINFO_BASETYPES (type
) != NULL_TREE
)
6424 BINFO_BASETYPES (t
) = copy_node (TYPE_BINFO_BASETYPES (type
));
6429 /* Otherwise, a vector of template arguments. */
6430 return tsubst_template_arg_vector (t
, args
, complain
);
6433 case REFERENCE_TYPE
:
6435 enum tree_code code
;
6437 if (type
== TREE_TYPE (t
))
6440 code
= TREE_CODE (t
);
6445 Type deduction may fail for any of the following
6448 -- Attempting to create a pointer to reference type.
6449 -- Attempting to create a reference to a reference type or
6450 a reference to void. */
6451 if (TREE_CODE (type
) == REFERENCE_TYPE
6452 || (code
== REFERENCE_TYPE
&& TREE_CODE (type
) == VOID_TYPE
))
6454 static int last_line
= 0;
6455 static const char* last_file
= 0;
6457 /* We keep track of the last time we issued this error
6458 message to avoid spewing a ton of messages during a
6459 single bad template instantiation. */
6460 if (complain
&& (last_line
!= lineno
||
6461 last_file
!= input_filename
))
6463 if (TREE_CODE (type
) == VOID_TYPE
)
6464 cp_error ("forming reference to void");
6466 cp_error ("forming %s to reference type `%T'",
6467 (code
== POINTER_TYPE
) ? "pointer" : "reference",
6470 last_file
= input_filename
;
6473 return error_mark_node
;
6475 else if (code
== POINTER_TYPE
)
6476 r
= build_pointer_type (type
);
6478 r
= build_reference_type (type
);
6479 r
= cp_build_qualified_type_real (r
, TYPE_QUALS (t
), complain
);
6481 /* Will this ever be needed for TYPE_..._TO values? */
6487 r
= tsubst (TYPE_OFFSET_BASETYPE (t
), args
, complain
, in_decl
);
6488 if (r
== error_mark_node
|| !IS_AGGR_TYPE (r
))
6492 Type deduction may fail for any of the following
6495 -- Attempting to create "pointer to member of T" when T
6496 is not a class type. */
6498 cp_error ("creating pointer to member of non-class type `%T'",
6500 return error_mark_node
;
6502 return build_offset_type (r
, type
);
6510 fntype
= tsubst_function_type (t
, args
, complain
, in_decl
);
6511 if (fntype
== error_mark_node
)
6512 return error_mark_node
;
6514 /* Substitue the exception specification. */
6515 raises
= TYPE_RAISES_EXCEPTIONS (t
);
6518 tree list
= NULL_TREE
;
6520 if (! TREE_VALUE (raises
))
6523 for (; raises
!= NULL_TREE
; raises
= TREE_CHAIN (raises
))
6525 tree spec
= TREE_VALUE (raises
);
6527 spec
= tsubst (spec
, args
, complain
, in_decl
);
6528 if (spec
== error_mark_node
)
6530 list
= add_exception_specifier (list
, spec
, complain
);
6532 fntype
= build_exception_variant (fntype
, list
);
6538 tree domain
= tsubst (TYPE_DOMAIN (t
), args
, complain
, in_decl
);
6539 if (domain
== error_mark_node
)
6540 return error_mark_node
;
6542 /* As an optimization, we avoid regenerating the array type if
6543 it will obviously be the same as T. */
6544 if (type
== TREE_TYPE (t
) && domain
== TYPE_DOMAIN (t
))
6547 /* These checks should match the ones in grokdeclarator.
6551 The deduction may fail for any of the following reasons:
6553 -- Attempting to create an array with an element type that
6554 is void, a function type, or a reference type. */
6555 if (TREE_CODE (type
) == VOID_TYPE
6556 || TREE_CODE (type
) == FUNCTION_TYPE
6557 || TREE_CODE (type
) == REFERENCE_TYPE
)
6560 cp_error ("creating array of `%T'", type
);
6561 return error_mark_node
;
6564 r
= build_cplus_array_type (type
, domain
);
6571 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6573 tree e2
= tsubst (TREE_OPERAND (t
, 1), args
, complain
,
6576 if (e1
== error_mark_node
|| e2
== error_mark_node
)
6577 return error_mark_node
;
6579 return fold (build (TREE_CODE (t
), TREE_TYPE (t
), e1
, e2
));
6585 tree e
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6587 if (e
== error_mark_node
)
6588 return error_mark_node
;
6590 return fold (build (TREE_CODE (t
), TREE_TYPE (t
), e
));
6595 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
6596 in_decl
, /*entering_scope=*/1);
6597 tree f
= tsubst_copy (TYPENAME_TYPE_FULLNAME (t
), args
,
6600 if (ctx
== error_mark_node
|| f
== error_mark_node
)
6601 return error_mark_node
;
6603 if (!IS_AGGR_TYPE (ctx
))
6606 cp_error ("`%T' is not a class, struct, or union type",
6608 return error_mark_node
;
6610 else if (!uses_template_parms (ctx
) && !TYPE_BEING_DEFINED (ctx
))
6612 /* Normally, make_typename_type does not require that the CTX
6613 have complete type in order to allow things like:
6615 template <class T> struct S { typename S<T>::X Y; };
6617 But, such constructs have already been resolved by this
6618 point, so here CTX really should have complete type, unless
6619 it's a partial instantiation. */
6620 ctx
= complete_type (ctx
);
6621 if (!COMPLETE_TYPE_P (ctx
))
6624 incomplete_type_error (NULL_TREE
, ctx
);
6625 return error_mark_node
;
6629 f
= make_typename_type (ctx
, f
, complain
);
6630 if (f
== error_mark_node
)
6632 return cp_build_qualified_type_real (f
,
6634 | CP_TYPE_QUALS (t
),
6640 tree e
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6642 if (e
== error_mark_node
)
6643 return error_mark_node
;
6644 return make_pointer_declarator (type
, e
);
6649 tree e
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6651 if (e
== error_mark_node
)
6652 return error_mark_node
;
6653 return make_reference_declarator (type
, e
);
6658 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6660 tree e2
= tsubst_expr (TREE_OPERAND (t
, 1), args
, complain
,
6662 if (e1
== error_mark_node
|| e2
== error_mark_node
)
6663 return error_mark_node
;
6665 return build_parse_node (ARRAY_REF
, e1
, e2
, tsubst_expr
);
6670 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6672 tree e2
= (tsubst_call_declarator_parms
6673 (CALL_DECLARATOR_PARMS (t
), args
, complain
, in_decl
));
6674 tree e3
= tsubst (CALL_DECLARATOR_EXCEPTION_SPEC (t
), args
,
6677 if (e1
== error_mark_node
|| e2
== error_mark_node
6678 || e3
== error_mark_node
)
6679 return error_mark_node
;
6681 return make_call_declarator (e1
, e2
, CALL_DECLARATOR_QUALS (t
), e3
);
6686 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6688 tree e2
= tsubst (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
6689 if (e1
== error_mark_node
|| e2
== error_mark_node
)
6690 return error_mark_node
;
6692 return build_parse_node (TREE_CODE (t
), e1
, e2
);
6697 tree e1
= tsubst_expr (TYPE_FIELDS (t
), args
, complain
,
6699 if (e1
== error_mark_node
)
6700 return error_mark_node
;
6702 return TREE_TYPE (e1
);
6712 /* This code should match declare_hidden_char_array in
6714 name
= (*decl_printable_name
) (current_function_decl
, 2);
6715 len
= strlen (name
) + 1;
6716 type
= build_array_type (char_type_node
,
6717 build_index_type (build_int_2 (len
, 0)));
6718 str
= build_string (len
, name
);
6719 TREE_TYPE (str
) = type
;
6724 sorry ("use of `%s' in template",
6725 tree_code_name
[(int) TREE_CODE (t
)]);
6726 return error_mark_node
;
6730 /* Like tsubst, but deals with expressions. This function just replaces
6731 template parms; to finish processing the resultant expression, use
6735 tsubst_copy (t
, args
, complain
, in_decl
)
6740 enum tree_code code
;
6743 if (t
== NULL_TREE
|| t
== error_mark_node
)
6746 code
= TREE_CODE (t
);
6751 return do_identifier (DECL_NAME (t
), 0, NULL_TREE
);
6758 if (!DECL_CONTEXT (t
))
6759 /* This is a global enumeration constant. */
6762 /* Unfortunately, we cannot just call lookup_name here.
6765 template <int I> int f() {
6767 struct S { void g() { E e = a; } };
6770 When we instantiate f<7>::S::g(), say, lookup_name is not
6771 clever enough to find f<7>::a. */
6773 = tsubst_aggr_type (TREE_TYPE (t
), args
, complain
, in_decl
,
6774 /*entering_scope=*/0);
6776 for (v
= TYPE_VALUES (enum_type
);
6779 if (TREE_PURPOSE (v
) == DECL_NAME (t
))
6780 return TREE_VALUE (v
);
6782 /* We didn't find the name. That should never happen; if
6783 name-lookup found it during preliminary parsing, we
6784 should find it again here during instantiation. */
6785 my_friendly_abort (0);
6790 if (DECL_CONTEXT (t
))
6794 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
6795 /*entering_scope=*/1);
6796 if (ctx
!= DECL_CONTEXT (t
))
6797 return lookup_field (ctx
, DECL_NAME (t
), 0, 0);
6803 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
))
6804 t
= tsubst (t
, args
, complain
, in_decl
);
6809 if (is_member_template (t
))
6810 return tsubst (t
, args
, complain
, in_decl
);
6816 /* We must tsbust into a LOOKUP_EXPR in case the names to
6817 which it refers is a conversion operator; in that case the
6818 name will change. We avoid making unnecessary copies,
6821 tree id
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
6823 if (id
!= TREE_OPERAND (t
, 0))
6825 r
= build_nt (LOOKUP_EXPR
, id
);
6826 LOOKUP_EXPR_GLOBAL (r
) = LOOKUP_EXPR_GLOBAL (t
);
6834 case REINTERPRET_CAST_EXPR
:
6835 case CONST_CAST_EXPR
:
6836 case STATIC_CAST_EXPR
:
6837 case DYNAMIC_CAST_EXPR
:
6840 (code
, tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
6841 tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
));
6844 case PREDECREMENT_EXPR
:
6845 case PREINCREMENT_EXPR
:
6846 case POSTDECREMENT_EXPR
:
6847 case POSTINCREMENT_EXPR
:
6849 case TRUTH_NOT_EXPR
:
6852 case CONVERT_EXPR
: /* Unary + */
6861 (code
, tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
6862 tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
));
6867 case TRUNC_DIV_EXPR
:
6869 case FLOOR_DIV_EXPR
:
6870 case ROUND_DIV_EXPR
:
6871 case EXACT_DIV_EXPR
:
6873 case BIT_ANDTC_EXPR
:
6876 case TRUNC_MOD_EXPR
:
6877 case FLOOR_MOD_EXPR
:
6878 case TRUTH_ANDIF_EXPR
:
6879 case TRUTH_ORIF_EXPR
:
6880 case TRUTH_AND_EXPR
:
6901 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
6902 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
));
6906 tree fn
= TREE_OPERAND (t
, 0);
6907 if (is_overloaded_fn (fn
))
6908 fn
= tsubst_copy (get_first_fn (fn
), args
, complain
, in_decl
);
6910 /* Sometimes FN is a LOOKUP_EXPR. */
6911 fn
= tsubst_copy (fn
, args
, complain
, in_decl
);
6913 (code
, fn
, tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
,
6918 case METHOD_CALL_EXPR
:
6920 tree name
= TREE_OPERAND (t
, 0);
6921 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
6923 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
6925 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
6927 else if (TREE_CODE (name
) == SCOPE_REF
6928 && TREE_CODE (TREE_OPERAND (name
, 1)) == BIT_NOT_EXPR
)
6930 tree base
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
6932 name
= TREE_OPERAND (name
, 1);
6933 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
6935 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
6936 name
= build_nt (SCOPE_REF
, base
, name
);
6939 name
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
6941 (code
, name
, tsubst_copy (TREE_OPERAND (t
, 1), args
,
6943 tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
),
6948 /* This processing should really occur in tsubst_expr, However,
6949 tsubst_expr does not recurse into expressions, since it
6950 assumes that there aren't any statements inside them.
6951 Instead, it simply calls build_expr_from_tree. So, we need
6952 to expand the STMT_EXPR here. */
6953 if (!processing_template_decl
)
6955 tree stmt_expr
= begin_stmt_expr ();
6956 tsubst_expr (STMT_EXPR_STMT (t
), args
,
6958 return finish_stmt_expr (stmt_expr
);
6965 case PSEUDO_DTOR_EXPR
:
6968 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
6969 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
),
6970 tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
));
6977 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
6978 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
),
6979 tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
));
6980 NEW_EXPR_USE_GLOBAL (r
) = NEW_EXPR_USE_GLOBAL (t
);
6987 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
6988 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
));
6989 DELETE_EXPR_USE_GLOBAL (r
) = DELETE_EXPR_USE_GLOBAL (t
);
6990 DELETE_EXPR_USE_VEC (r
) = DELETE_EXPR_USE_VEC (t
);
6994 case TEMPLATE_ID_EXPR
:
6996 /* Substituted template arguments */
6997 tree targs
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
,
7000 if (targs
&& TREE_CODE (targs
) == TREE_LIST
)
7003 for (chain
= targs
; chain
; chain
= TREE_CHAIN (chain
))
7004 TREE_VALUE (chain
) = maybe_fold_nontype_arg (TREE_VALUE (chain
));
7009 for (i
= 0; i
< TREE_VEC_LENGTH (targs
); ++i
)
7010 TREE_VEC_ELT (targs
, i
)
7011 = maybe_fold_nontype_arg (TREE_VEC_ELT (targs
, i
));
7014 return lookup_template_function
7015 (tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
), targs
);
7020 tree purpose
, value
, chain
;
7022 if (t
== void_list_node
)
7025 purpose
= TREE_PURPOSE (t
);
7027 purpose
= tsubst_copy (purpose
, args
, complain
, in_decl
);
7028 value
= TREE_VALUE (t
);
7030 value
= tsubst_copy (value
, args
, complain
, in_decl
);
7031 chain
= TREE_CHAIN (t
);
7032 if (chain
&& chain
!= void_type_node
)
7033 chain
= tsubst_copy (chain
, args
, complain
, in_decl
);
7034 if (purpose
== TREE_PURPOSE (t
)
7035 && value
== TREE_VALUE (t
)
7036 && chain
== TREE_CHAIN (t
))
7038 return tree_cons (purpose
, value
, chain
);
7045 case TEMPLATE_TYPE_PARM
:
7046 case TEMPLATE_TEMPLATE_PARM
:
7047 case TEMPLATE_PARM_INDEX
:
7049 case REFERENCE_TYPE
:
7056 return tsubst (t
, args
, complain
, in_decl
);
7058 case IDENTIFIER_NODE
:
7059 if (IDENTIFIER_TYPENAME_P (t
))
7060 return (build_typename_overload
7061 (tsubst (TREE_TYPE (t
), args
, complain
, in_decl
)));
7068 (CONSTRUCTOR
, tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
7069 NULL_TREE
, tsubst_copy (CONSTRUCTOR_ELTS (t
), args
,
7070 complain
, in_decl
));
7071 TREE_HAS_CONSTRUCTOR (r
) = TREE_HAS_CONSTRUCTOR (t
);
7076 return build_va_arg (tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
,
7078 tsubst (TREE_TYPE (t
), args
, complain
, in_decl
));
7081 return tsubst (t
, args
, complain
, in_decl
);
7088 /* Like tsubst_copy, but also does semantic processing. */
7091 tsubst_expr (t
, args
, complain
, in_decl
)
7098 if (t
== NULL_TREE
|| t
== error_mark_node
)
7101 if (processing_template_decl
)
7102 return tsubst_copy (t
, args
, complain
, in_decl
);
7104 switch (TREE_CODE (t
))
7108 finish_named_return_value
7109 (TREE_OPERAND (t
, 0),
7110 tsubst_expr (TREE_OPERAND (t
, 1), args
, /*complain=*/1, in_decl
));
7111 tsubst_expr (TREE_CHAIN (t
), args
, complain
, in_decl
);
7114 case CTOR_INITIALIZER
:
7116 current_member_init_list
7117 = tsubst_expr_values (TREE_OPERAND (t
, 0), args
);
7118 current_base_init_list
7119 = tsubst_expr_values (TREE_OPERAND (t
, 1), args
);
7121 tsubst_expr (TREE_CHAIN (t
), args
, complain
, in_decl
);
7126 finish_return_stmt (tsubst_expr (RETURN_EXPR (t
),
7127 args
, complain
, in_decl
));
7132 finish_expr_stmt (tsubst_expr (EXPR_STMT_EXPR (t
),
7133 args
, complain
, in_decl
));
7142 decl
= DECL_STMT_DECL (t
);
7143 if (TREE_CODE (decl
) == LABEL_DECL
)
7144 finish_label_decl (DECL_NAME (decl
));
7147 init
= DECL_INITIAL (decl
);
7148 decl
= tsubst (decl
, args
, complain
, in_decl
);
7149 init
= tsubst_expr (init
, args
, complain
, in_decl
);
7151 DECL_INITIAL (decl
) = error_mark_node
;
7152 /* By marking the declaration as instantiated, we avoid
7153 trying to instantiate it. Since instantiate_decl can't
7154 handle local variables, and since we've already done
7155 all that needs to be done, that's the right thing to
7157 if (TREE_CODE (decl
) == VAR_DECL
)
7158 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
7159 maybe_push_decl (decl
);
7160 cp_finish_decl (decl
, init
, NULL_TREE
, 0);
7170 stmt
= begin_for_stmt ();
7171 for (tmp
= FOR_INIT_STMT (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
7172 tsubst_expr (tmp
, args
, complain
, in_decl
);
7173 finish_for_init_stmt (stmt
);
7174 finish_for_cond (tsubst_expr (FOR_COND (t
), args
,
7177 tmp
= tsubst_expr (FOR_EXPR (t
), args
, complain
, in_decl
);
7178 finish_for_expr (tmp
, stmt
);
7179 tsubst_expr (FOR_BODY (t
), args
, complain
, in_decl
);
7180 finish_for_stmt (tmp
, stmt
);
7187 stmt
= begin_while_stmt ();
7188 finish_while_stmt_cond (tsubst_expr (WHILE_COND (t
),
7189 args
, complain
, in_decl
),
7191 tsubst_expr (WHILE_BODY (t
), args
, complain
, in_decl
);
7192 finish_while_stmt (stmt
);
7199 stmt
= begin_do_stmt ();
7200 tsubst_expr (DO_BODY (t
), args
, complain
, in_decl
);
7201 finish_do_body (stmt
);
7202 finish_do_stmt (tsubst_expr (DO_COND (t
), args
,
7213 stmt
= begin_if_stmt ();
7214 finish_if_stmt_cond (tsubst_expr (IF_COND (t
),
7215 args
, complain
, in_decl
),
7218 if (tmp
= THEN_CLAUSE (t
), tmp
)
7220 tsubst_expr (tmp
, args
, complain
, in_decl
);
7221 finish_then_clause (stmt
);
7224 if (tmp
= ELSE_CLAUSE (t
), tmp
)
7226 begin_else_clause ();
7227 tsubst_expr (tmp
, args
, complain
, in_decl
);
7228 finish_else_clause (stmt
);
7240 stmt
= begin_compound_stmt (COMPOUND_STMT_NO_SCOPE (t
));
7241 for (substmt
= COMPOUND_BODY (t
);
7242 substmt
!= NULL_TREE
;
7243 substmt
= TREE_CHAIN (substmt
))
7244 tsubst_expr (substmt
, args
, complain
, in_decl
);
7245 return finish_compound_stmt (COMPOUND_STMT_NO_SCOPE (t
), stmt
);
7251 finish_break_stmt ();
7256 finish_continue_stmt ();
7264 stmt
= begin_switch_stmt ();
7265 val
= tsubst_expr (SWITCH_COND (t
), args
, complain
, in_decl
);
7266 finish_switch_cond (val
, stmt
);
7267 tsubst_expr (SWITCH_BODY (t
), args
, complain
, in_decl
);
7268 finish_switch_stmt (val
, stmt
);
7274 finish_case_label (tsubst_expr (CASE_LOW (t
), args
, complain
, in_decl
),
7275 tsubst_expr (CASE_HIGH (t
), args
, complain
, in_decl
));
7279 lineno
= STMT_LINENO (t
);
7280 finish_label_stmt (DECL_NAME (LABEL_STMT_LABEL (t
)));
7285 t
= GOTO_DESTINATION (t
);
7286 if (TREE_CODE (t
) != LABEL_DECL
)
7287 /* Computed goto's must be tsubst'd into. On the other hand,
7288 non-computed gotos must not be; the identifier in question
7289 will have no binding. */
7290 t
= tsubst_expr (t
, args
, complain
, in_decl
);
7293 finish_goto_stmt (t
);
7298 finish_asm_stmt (ASM_CV_QUAL (t
),
7299 tsubst_expr (ASM_STRING (t
), args
, complain
, in_decl
),
7300 tsubst_expr (ASM_OUTPUTS (t
), args
, complain
, in_decl
),
7301 tsubst_expr (ASM_INPUTS (t
), args
, complain
, in_decl
),
7302 tsubst_expr (ASM_CLOBBERS (t
), args
, complain
,
7310 stmt
= begin_try_block ();
7311 tsubst_expr (TRY_STMTS (t
), args
, complain
, in_decl
);
7312 finish_cleanup_try_block (stmt
);
7313 finish_cleanup (tsubst_expr (TRY_HANDLERS (t
), args
,
7321 if (FN_TRY_BLOCK_P (t
))
7322 stmt
= begin_function_try_block ();
7324 stmt
= begin_try_block ();
7326 tsubst_expr (TRY_STMTS (t
), args
, complain
, in_decl
);
7328 if (FN_TRY_BLOCK_P (t
))
7329 finish_function_try_block (stmt
);
7331 finish_try_block (stmt
);
7333 handler
= TRY_HANDLERS (t
);
7334 for (; handler
; handler
= TREE_CHAIN (handler
))
7335 tsubst_expr (handler
, args
, complain
, in_decl
);
7336 if (FN_TRY_BLOCK_P (t
))
7337 finish_function_handler_sequence (stmt
);
7339 finish_handler_sequence (stmt
);
7349 stmt
= begin_handler ();
7350 if (HANDLER_PARMS (t
))
7352 decl
= DECL_STMT_DECL (HANDLER_PARMS (t
));
7353 decl
= tsubst (decl
, args
, complain
, in_decl
);
7354 /* Prevent instantiate_decl from trying to instantiate
7355 this variable. We've already done all that needs to be
7357 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
7361 blocks
= finish_handler_parms (decl
, stmt
);
7362 tsubst_expr (HANDLER_BODY (t
), args
, complain
, in_decl
);
7363 finish_handler (blocks
, stmt
);
7370 tsubst (t
, args
, complain
, NULL_TREE
);
7374 return build_expr_from_tree (tsubst_copy (t
, args
, complain
, in_decl
));
7379 /* TMPL is a TEMPLATE_DECL for a cloned constructor or destructor.
7380 Instantiate it with the ARGS. */
7383 instantiate_clone (tmpl
, args
)
7390 /* Instantiated the cloned function, rather than the clone. */
7391 spec
= instantiate_template (DECL_CLONED_FUNCTION (tmpl
), args
);
7393 /* Then, see if we've already cloned the instantiation. */
7394 for (clone
= TREE_CHAIN (spec
);
7395 clone
&& DECL_CLONED_FUNCTION_P (clone
);
7396 clone
= TREE_CHAIN (clone
))
7397 if (DECL_NAME (clone
) == DECL_NAME (tmpl
))
7400 /* If we haven't, do so know. */
7402 clone_function_decl (spec
, /*update_method_vec_p=*/0);
7405 for (clone
= TREE_CHAIN (spec
);
7406 clone
&& DECL_CLONED_FUNCTION_P (clone
);
7407 clone
= TREE_CHAIN (clone
))
7408 if (DECL_NAME (clone
) == DECL_NAME (tmpl
))
7411 /* We should always have found the clone by now. */
7412 my_friendly_abort (20000411);
7416 /* Instantiate the indicated variable or function template TMPL with
7417 the template arguments in TARG_PTR. */
7420 instantiate_template (tmpl
, targ_ptr
)
7421 tree tmpl
, targ_ptr
;
7429 if (tmpl
== error_mark_node
)
7430 return error_mark_node
;
7432 my_friendly_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
, 283);
7434 /* If this function is a clone, handle it specially. */
7435 if (DECL_CLONED_FUNCTION_P (tmpl
))
7436 return instantiate_clone (tmpl
, targ_ptr
);
7438 /* Check to see if we already have this specialization. */
7439 spec
= retrieve_specialization (tmpl
, targ_ptr
);
7440 if (spec
!= NULL_TREE
)
7443 if (DECL_TEMPLATE_INFO (tmpl
) && !DECL_TEMPLATE_SPECIALIZATION (tmpl
))
7445 /* The TMPL is a partial instantiation. To get a full set of
7446 arguments we must add the arguments used to perform the
7447 partial instantiation. */
7448 targ_ptr
= add_outermost_template_args (DECL_TI_ARGS (tmpl
),
7450 gen_tmpl
= most_general_template (tmpl
);
7452 /* Check to see if we already have this specialization. */
7453 spec
= retrieve_specialization (gen_tmpl
, targ_ptr
);
7454 if (spec
!= NULL_TREE
)
7460 len
= DECL_NTPARMS (gen_tmpl
);
7461 inner_args
= innermost_args (targ_ptr
);
7465 tree t
= TREE_VEC_ELT (inner_args
, i
);
7468 tree nt
= target_type (t
);
7469 if (IS_AGGR_TYPE (nt
) && decl_function_context (TYPE_MAIN_DECL (nt
)))
7471 cp_error ("type `%T' composed from a local class is not a valid template-argument", t
);
7472 cp_error (" trying to instantiate `%D'", gen_tmpl
);
7473 return error_mark_node
;
7478 /* substitute template parameters */
7479 fndecl
= tsubst (DECL_TEMPLATE_RESULT (gen_tmpl
),
7480 targ_ptr
, /*complain=*/1, gen_tmpl
);
7481 /* The DECL_TI_TEMPLATE should always be the immediate parent
7482 template, not the most general template. */
7483 DECL_TI_TEMPLATE (fndecl
) = tmpl
;
7485 if (flag_external_templates
)
7486 add_pending_template (fndecl
);
7491 /* Push the name of the class template into the scope of the instantiation. */
7494 overload_template_name (type
)
7497 tree id
= DECL_NAME (CLASSTYPE_TI_TEMPLATE (type
));
7500 if (IDENTIFIER_CLASS_VALUE (id
)
7501 && TREE_TYPE (IDENTIFIER_CLASS_VALUE (id
)) == type
)
7504 decl
= build_decl (TYPE_DECL
, id
, type
);
7505 SET_DECL_ARTIFICIAL (decl
);
7506 pushdecl_class_level (decl
);
7509 /* The FN is a TEMPLATE_DECL for a function. The ARGS are the
7510 arguments that are being used when calling it. TARGS is a vector
7511 into which the deduced template arguments are placed.
7513 Return zero for success, 2 for an incomplete match that doesn't resolve
7514 all the types, and 1 for complete failure. An error message will be
7515 printed only for an incomplete match.
7517 If FN is a conversion operator, RETURN_TYPE is the type desired as
7518 the result of the conversion operator.
7520 TPARMS is a vector of template parameters.
7522 The EXPLICIT_TARGS are explicit template arguments provided via a
7525 The parameter STRICT is one of:
7528 We are deducing arguments for a function call, as in
7532 We are deducing arguments for a conversion function, as in
7536 We are deducing arguments when calculating the partial
7537 ordering between specializations of function or class
7538 templates, as in [temp.func.order] and [temp.class.order],
7539 when doing an explicit instantiation as in [temp.explicit],
7540 when determining an explicit specialization as in
7541 [temp.expl.spec], or when taking the address of a function
7542 template, as in [temp.deduct.funcaddr].
7544 The other arguments are as for type_unification. */
7547 fn_type_unification (fn
, explicit_targs
, targs
, args
, return_type
,
7549 tree fn
, explicit_targs
, targs
, args
, return_type
;
7550 unification_kind_t strict
;
7556 my_friendly_assert (TREE_CODE (fn
) == TEMPLATE_DECL
, 0);
7558 fntype
= TREE_TYPE (fn
);
7563 The specified template arguments must match the template
7564 parameters in kind (i.e., type, nontype, template), and there
7565 must not be more arguments than there are parameters;
7566 otherwise type deduction fails.
7568 Nontype arguments must match the types of the corresponding
7569 nontype template parameters, or must be convertible to the
7570 types of the corresponding nontype parameters as specified in
7571 _temp.arg.nontype_, otherwise type deduction fails.
7573 All references in the function type of the function template
7574 to the corresponding template parameters are replaced by the
7575 specified template argument values. If a substitution in a
7576 template parameter or in the function type of the function
7577 template results in an invalid type, type deduction fails. */
7579 tree converted_args
;
7582 = (coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
7583 explicit_targs
, NULL_TREE
, /*complain=*/0,
7584 /*require_all_arguments=*/0));
7585 if (converted_args
== error_mark_node
)
7588 fntype
= tsubst (fntype
, converted_args
, /*complain=*/0, NULL_TREE
);
7589 if (fntype
== error_mark_node
)
7592 /* Place the explicitly specified arguments in TARGS. */
7593 for (i
= 0; i
< TREE_VEC_LENGTH (targs
); i
++)
7594 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (converted_args
, i
);
7597 parms
= TYPE_ARG_TYPES (fntype
);
7599 if (DECL_CONV_FN_P (fn
))
7601 /* This is a template conversion operator. Remove `this', since
7602 we could be comparing conversions from different classes. */
7603 parms
= TREE_CHAIN (parms
);
7604 args
= TREE_CHAIN (args
);
7605 my_friendly_assert (return_type
!= NULL_TREE
, 20000227);
7610 /* We've been given a return type to match, prepend it. */
7611 parms
= tree_cons (NULL_TREE
, TREE_TYPE (fntype
), parms
);
7612 args
= tree_cons (NULL_TREE
, return_type
, args
);
7615 /* We allow incomplete unification without an error message here
7616 because the standard doesn't seem to explicitly prohibit it. Our
7617 callers must be ready to deal with unification failures in any
7619 result
= type_unification_real (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
7620 targs
, parms
, args
, /*subr=*/0,
7621 strict
, /*allow_incomplete*/1);
7624 /* All is well so far. Now, check:
7628 When all template arguments have been deduced, all uses of
7629 template parameters in nondeduced contexts are replaced with
7630 the corresponding deduced argument values. If the
7631 substitution results in an invalid type, as described above,
7632 type deduction fails. */
7633 if (tsubst (TREE_TYPE (fn
), targs
, /*complain=*/0, NULL_TREE
)
7640 /* Adjust types before performing type deduction, as described in
7641 [temp.deduct.call] and [temp.deduct.conv]. The rules in these two
7642 sections are symmetric. PARM is the type of a function parameter
7643 or the return type of the conversion function. ARG is the type of
7644 the argument passed to the call, or the type of the value
7645 intialized with the result of the conversion function. */
7648 maybe_adjust_types_for_deduction (strict
, parm
, arg
)
7649 unification_kind_t strict
;
7660 /* Swap PARM and ARG throughout the remainder of this
7661 function; the handling is precisely symmetric since PARM
7662 will initialize ARG rather than vice versa. */
7670 /* There is nothing to do in this case. */
7674 my_friendly_abort (0);
7677 if (TREE_CODE (*parm
) != REFERENCE_TYPE
)
7679 /* [temp.deduct.call]
7681 If P is not a reference type:
7683 --If A is an array type, the pointer type produced by the
7684 array-to-pointer standard conversion (_conv.array_) is
7685 used in place of A for type deduction; otherwise,
7687 --If A is a function type, the pointer type produced by
7688 the function-to-pointer standard conversion
7689 (_conv.func_) is used in place of A for type deduction;
7692 --If A is a cv-qualified type, the top level
7693 cv-qualifiers of A's type are ignored for type
7695 if (TREE_CODE (*arg
) == ARRAY_TYPE
)
7696 *arg
= build_pointer_type (TREE_TYPE (*arg
));
7697 else if (TREE_CODE (*arg
) == FUNCTION_TYPE
)
7698 *arg
= build_pointer_type (*arg
);
7700 *arg
= TYPE_MAIN_VARIANT (*arg
);
7703 /* [temp.deduct.call]
7705 If P is a cv-qualified type, the top level cv-qualifiers
7706 of P's type are ignored for type deduction. If P is a
7707 reference type, the type referred to by P is used for
7709 *parm
= TYPE_MAIN_VARIANT (*parm
);
7710 if (TREE_CODE (*parm
) == REFERENCE_TYPE
)
7711 *parm
= TREE_TYPE (*parm
);
7714 /* Like type_unfication.
7716 If SUBR is 1, we're being called recursively (to unify the
7717 arguments of a function or method parameter of a function
7721 type_unification_real (tparms
, targs
, parms
, args
, subr
,
7722 strict
, allow_incomplete
)
7723 tree tparms
, targs
, parms
, args
;
7725 unification_kind_t strict
;
7726 int allow_incomplete
;
7730 int ntparms
= TREE_VEC_LENGTH (tparms
);
7733 my_friendly_assert (TREE_CODE (tparms
) == TREE_VEC
, 289);
7734 my_friendly_assert (parms
== NULL_TREE
7735 || TREE_CODE (parms
) == TREE_LIST
, 290);
7736 /* ARGS could be NULL (via a call from parse.y to
7737 build_x_function_call). */
7739 my_friendly_assert (TREE_CODE (args
) == TREE_LIST
, 291);
7740 my_friendly_assert (ntparms
> 0, 292);
7745 sub_strict
= UNIFY_ALLOW_MORE_CV_QUAL
| UNIFY_ALLOW_DERIVED
;
7749 sub_strict
= UNIFY_ALLOW_LESS_CV_QUAL
;
7753 sub_strict
= UNIFY_ALLOW_NONE
;
7757 my_friendly_abort (0);
7761 && parms
!= void_list_node
7763 && args
!= void_list_node
)
7765 parm
= TREE_VALUE (parms
);
7766 parms
= TREE_CHAIN (parms
);
7767 arg
= TREE_VALUE (args
);
7768 args
= TREE_CHAIN (args
);
7770 if (arg
== error_mark_node
)
7772 if (arg
== unknown_type_node
)
7773 /* We can't deduce anything from this, but we might get all the
7774 template args from other function args. */
7777 /* Conversions will be performed on a function argument that
7778 corresponds with a function parameter that contains only
7779 non-deducible template parameters and explicitly specified
7780 template parameters. */
7781 if (! uses_template_parms (parm
))
7786 type
= TREE_TYPE (arg
);
7793 if (strict
== DEDUCE_EXACT
)
7795 if (same_type_p (parm
, type
))
7799 /* It might work; we shouldn't check now, because we might
7800 get into infinite recursion. Overload resolution will
7809 my_friendly_assert (TREE_TYPE (arg
) != NULL_TREE
, 293);
7810 if (type_unknown_p (arg
))
7812 /* [temp.deduct.type] A template-argument can be deduced from
7813 a pointer to function or pointer to member function
7814 argument if the set of overloaded functions does not
7815 contain function templates and at most one of a set of
7816 overloaded functions provides a unique match. */
7818 if (resolve_overloaded_unification
7819 (tparms
, targs
, parm
, arg
, strict
, sub_strict
)
7824 arg
= TREE_TYPE (arg
);
7828 maybe_adjust_types_for_deduction (strict
, &parm
, &arg
);
7830 switch (unify (tparms
, targs
, parm
, arg
, sub_strict
))
7838 /* Fail if we've reached the end of the parm list, and more args
7839 are present, and the parm list isn't variadic. */
7840 if (args
&& args
!= void_list_node
&& parms
== void_list_node
)
7842 /* Fail if parms are left and they don't have default values. */
7844 && parms
!= void_list_node
7845 && TREE_PURPOSE (parms
) == NULL_TREE
)
7848 for (i
= 0; i
< ntparms
; i
++)
7849 if (TREE_VEC_ELT (targs
, i
) == NULL_TREE
)
7851 if (!allow_incomplete
)
7852 error ("incomplete type unification");
7858 /* Subroutine of type_unification_real. Args are like the variables at the
7859 call site. ARG is an overloaded function (or template-id); we try
7860 deducing template args from each of the overloads, and if only one
7861 succeeds, we go with that. Modifies TARGS and returns 0 on success. */
7864 resolve_overloaded_unification (tparms
, targs
, parm
, arg
, strict
,
7866 tree tparms
, targs
, parm
, arg
;
7867 unification_kind_t strict
;
7870 tree tempargs
= copy_node (targs
);
7873 if (TREE_CODE (arg
) == ADDR_EXPR
)
7874 arg
= TREE_OPERAND (arg
, 0);
7876 if (TREE_CODE (arg
) == COMPONENT_REF
)
7877 /* Handle `&x' where `x' is some static or non-static member
7879 arg
= TREE_OPERAND (arg
, 1);
7881 if (TREE_CODE (arg
) == OFFSET_REF
)
7882 arg
= TREE_OPERAND (arg
, 1);
7884 /* Strip baselink information. */
7885 while (TREE_CODE (arg
) == TREE_LIST
)
7886 arg
= TREE_VALUE (arg
);
7888 if (TREE_CODE (arg
) == TEMPLATE_ID_EXPR
)
7890 /* If we got some explicit template args, we need to plug them into
7891 the affected templates before we try to unify, in case the
7892 explicit args will completely resolve the templates in question. */
7894 tree expl_subargs
= TREE_OPERAND (arg
, 1);
7895 arg
= TREE_OPERAND (arg
, 0);
7897 for (; arg
; arg
= OVL_NEXT (arg
))
7899 tree fn
= OVL_CURRENT (arg
);
7902 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
7905 subargs
= get_bindings_overload (fn
, DECL_TEMPLATE_RESULT (fn
),
7909 elem
= tsubst (TREE_TYPE (fn
), subargs
, /*complain=*/0,
7911 if (TREE_CODE (elem
) == METHOD_TYPE
)
7912 elem
= build_ptrmemfunc_type (build_pointer_type (elem
));
7913 good
+= try_one_overload (tparms
, targs
, tempargs
, parm
, elem
,
7914 strict
, sub_strict
);
7918 else if (TREE_CODE (arg
) == OVERLOAD
)
7920 for (; arg
; arg
= OVL_NEXT (arg
))
7922 tree type
= TREE_TYPE (OVL_CURRENT (arg
));
7923 if (TREE_CODE (type
) == METHOD_TYPE
)
7924 type
= build_ptrmemfunc_type (build_pointer_type (type
));
7925 good
+= try_one_overload (tparms
, targs
, tempargs
, parm
,
7927 strict
, sub_strict
);
7931 my_friendly_abort (981006);
7933 /* [temp.deduct.type] A template-argument can be deduced from a pointer
7934 to function or pointer to member function argument if the set of
7935 overloaded functions does not contain function templates and at most
7936 one of a set of overloaded functions provides a unique match.
7938 So if we found multiple possibilities, we return success but don't
7943 int i
= TREE_VEC_LENGTH (targs
);
7945 if (TREE_VEC_ELT (tempargs
, i
))
7946 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (tempargs
, i
);
7954 /* Subroutine of resolve_overloaded_unification; does deduction for a single
7955 overload. Fills TARGS with any deduced arguments, or error_mark_node if
7956 different overloads deduce different arguments for a given parm.
7957 Returns 1 on success. */
7960 try_one_overload (tparms
, orig_targs
, targs
, parm
, arg
, strict
,
7962 tree tparms
, orig_targs
, targs
, parm
, arg
;
7963 unification_kind_t strict
;
7970 /* [temp.deduct.type] A template-argument can be deduced from a pointer
7971 to function or pointer to member function argument if the set of
7972 overloaded functions does not contain function templates and at most
7973 one of a set of overloaded functions provides a unique match.
7975 So if this is a template, just return success. */
7977 if (uses_template_parms (arg
))
7980 maybe_adjust_types_for_deduction (strict
, &parm
, &arg
);
7982 /* We don't copy orig_targs for this because if we have already deduced
7983 some template args from previous args, unify would complain when we
7984 try to deduce a template parameter for the same argument, even though
7985 there isn't really a conflict. */
7986 nargs
= TREE_VEC_LENGTH (targs
);
7987 tempargs
= make_tree_vec (nargs
);
7989 if (unify (tparms
, tempargs
, parm
, arg
, sub_strict
) != 0)
7992 /* First make sure we didn't deduce anything that conflicts with
7993 explicitly specified args. */
7994 for (i
= nargs
; i
--; )
7996 tree elt
= TREE_VEC_ELT (tempargs
, i
);
7997 tree oldelt
= TREE_VEC_ELT (orig_targs
, i
);
7999 if (elt
== NULL_TREE
)
8001 else if (uses_template_parms (elt
))
8003 /* Since we're unifying against ourselves, we will fill in template
8004 args used in the function parm list with our own template parms.
8006 TREE_VEC_ELT (tempargs
, i
) = NULL_TREE
;
8009 else if (oldelt
&& ! template_args_equal (oldelt
, elt
))
8013 for (i
= nargs
; i
--; )
8015 tree elt
= TREE_VEC_ELT (tempargs
, i
);
8018 TREE_VEC_ELT (targs
, i
) = elt
;
8024 /* PARM is a template class (perhaps with unbound template
8025 parameters). ARG is a fully instantiated type. If ARG can be
8026 bound to PARM, return ARG, otherwise return NULL_TREE. TPARMS and
8027 TARGS are as for unify. */
8030 try_class_unification (tparms
, targs
, parm
, arg
)
8039 if (!CLASSTYPE_TEMPLATE_INFO (arg
)
8040 || CLASSTYPE_TI_TEMPLATE (arg
) != CLASSTYPE_TI_TEMPLATE (parm
))
8043 /* We need to make a new template argument vector for the call to
8044 unify. If we used TARGS, we'd clutter it up with the result of
8045 the attempted unification, even if this class didn't work out.
8046 We also don't want to commit ourselves to all the unifications
8047 we've already done, since unification is supposed to be done on
8048 an argument-by-argument basis. In other words, consider the
8049 following pathological case:
8051 template <int I, int J, int K>
8054 template <int I, int J>
8055 struct S<I, J, 2> : public S<I, I, I>, S<J, J, J> {};
8057 template <int I, int J, int K>
8058 void f(S<I, J, K>, S<I, I, I>);
8067 Now, by the time we consider the unification involving `s2', we
8068 already know that we must have `f<0, 0, 0>'. But, even though
8069 `S<0, 1, 2>' is derived from `S<0, 0, 0>', the code is not legal
8070 because there are two ways to unify base classes of S<0, 1, 2>
8071 with S<I, I, I>. If we kept the already deduced knowledge, we
8072 would reject the possibility I=1. */
8073 copy_of_targs
= make_tree_vec (TREE_VEC_LENGTH (targs
));
8074 i
= unify (tparms
, copy_of_targs
, CLASSTYPE_TI_ARGS (parm
),
8075 CLASSTYPE_TI_ARGS (arg
), UNIFY_ALLOW_NONE
);
8077 /* If unification failed, we're done. */
8084 /* Subroutine of get_template_base. RVAL, if non-NULL, is a base we
8085 have alreay discovered to be satisfactory. ARG_BINFO is the binfo
8086 for the base class of ARG that we are currently examining. */
8089 get_template_base_recursive (tparms
, targs
, parm
,
8090 arg_binfo
, rval
, flags
)
8100 tree arg
= BINFO_TYPE (arg_binfo
);
8102 if (!(flags
& GTB_IGNORE_TYPE
))
8104 tree r
= try_class_unification (tparms
, targs
,
8107 /* If there is more than one satisfactory baseclass, then:
8111 If they yield more than one possible deduced A, the type
8115 if (r
&& rval
&& !same_type_p (r
, rval
))
8116 return error_mark_node
;
8121 binfos
= BINFO_BASETYPES (arg_binfo
);
8122 n_baselinks
= binfos
? TREE_VEC_LENGTH (binfos
) : 0;
8124 /* Process base types. */
8125 for (i
= 0; i
< n_baselinks
; i
++)
8127 tree base_binfo
= TREE_VEC_ELT (binfos
, i
);
8130 /* Skip this base, if we've already seen it. */
8131 if (BINFO_MARKED (base_binfo
))
8135 (flags
& GTB_VIA_VIRTUAL
) || TREE_VIA_VIRTUAL (base_binfo
);
8137 /* When searching for a non-virtual, we cannot mark virtually
8140 SET_BINFO_MARKED (base_binfo
);
8142 rval
= get_template_base_recursive (tparms
, targs
,
8146 GTB_VIA_VIRTUAL
* this_virtual
);
8148 /* If we discovered more than one matching base class, we can
8150 if (rval
== error_mark_node
)
8151 return error_mark_node
;
8157 /* Given a template type PARM and a class type ARG, find the unique
8158 base type in ARG that is an instance of PARM. We do not examine
8159 ARG itself; only its base-classes. If there is no appropriate base
8160 class, return NULL_TREE. If there is more than one, return
8161 error_mark_node. PARM may be the type of a partial specialization,
8162 as well as a plain template type. Used by unify. */
8165 get_template_base (tparms
, targs
, parm
, arg
)
8174 my_friendly_assert (IS_AGGR_TYPE_CODE (TREE_CODE (arg
)), 92);
8176 arg_binfo
= TYPE_BINFO (complete_type (arg
));
8177 rval
= get_template_base_recursive (tparms
, targs
,
8182 /* Since get_template_base_recursive marks the bases classes, we
8183 must unmark them here. */
8184 dfs_walk (arg_binfo
, dfs_unmark
, markedp
, 0);
8189 /* Returns the level of DECL, which declares a template parameter. */
8192 template_decl_level (decl
)
8195 switch (TREE_CODE (decl
))
8199 return TEMPLATE_TYPE_LEVEL (TREE_TYPE (decl
));
8202 return TEMPLATE_PARM_LEVEL (DECL_INITIAL (decl
));
8205 my_friendly_abort (0);
8210 /* Decide whether ARG can be unified with PARM, considering only the
8211 cv-qualifiers of each type, given STRICT as documented for unify.
8212 Returns non-zero iff the unification is OK on that basis.*/
8215 check_cv_quals_for_unify (strict
, arg
, parm
)
8220 if (!(strict
& UNIFY_ALLOW_MORE_CV_QUAL
)
8221 && !at_least_as_qualified_p (arg
, parm
))
8224 if (!(strict
& UNIFY_ALLOW_LESS_CV_QUAL
)
8225 && !at_least_as_qualified_p (parm
, arg
))
8231 /* Takes parameters as for type_unification. Returns 0 if the
8232 type deduction suceeds, 1 otherwise. The parameter STRICT is a
8233 bitwise or of the following flags:
8236 Require an exact match between PARM and ARG.
8237 UNIFY_ALLOW_MORE_CV_QUAL:
8238 Allow the deduced ARG to be more cv-qualified than ARG.
8239 UNIFY_ALLOW_LESS_CV_QUAL:
8240 Allow the deduced ARG to be less cv-qualified than ARG.
8241 UNIFY_ALLOW_DERIVED:
8242 Allow the deduced ARG to be a template base class of ARG,
8243 or a pointer to a template base class of the type pointed to by
8245 UNIFY_ALLOW_INTEGER:
8246 Allow any integral type to be deduced. See the TEMPLATE_PARM_INDEX
8247 case for more information. */
8250 unify (tparms
, targs
, parm
, arg
, strict
)
8251 tree tparms
, targs
, parm
, arg
;
8258 /* I don't think this will do the right thing with respect to types.
8259 But the only case I've seen it in so far has been array bounds, where
8260 signedness is the only information lost, and I think that will be
8262 while (TREE_CODE (parm
) == NOP_EXPR
)
8263 parm
= TREE_OPERAND (parm
, 0);
8265 if (arg
== error_mark_node
)
8267 if (arg
== unknown_type_node
)
8268 /* We can't deduce anything from this, but we might get all the
8269 template args from other function args. */
8272 /* If PARM uses template parameters, then we can't bail out here,
8273 even if ARG == PARM, since we won't record unifications for the
8274 template parameters. We might need them if we're trying to
8275 figure out which of two things is more specialized. */
8276 if (arg
== parm
&& !uses_template_parms (parm
))
8279 /* Immediately reject some pairs that won't unify because of
8280 cv-qualification mismatches. */
8281 if (TREE_CODE (arg
) == TREE_CODE (parm
)
8283 /* We check the cv-qualifiers when unifying with template type
8284 parameters below. We want to allow ARG `const T' to unify with
8285 PARM `T' for example, when computing which of two templates
8286 is more specialized, for example. */
8287 && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
8288 && !check_cv_quals_for_unify (strict
, arg
, parm
))
8291 switch (TREE_CODE (parm
))
8294 /* In a type which contains a nested-name-specifier, template
8295 argument values cannot be deduced for template parameters used
8296 within the nested-name-specifier. */
8299 case TEMPLATE_TYPE_PARM
:
8300 case TEMPLATE_TEMPLATE_PARM
:
8301 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
8303 if (TEMPLATE_TYPE_LEVEL (parm
)
8304 != template_decl_level (tparm
))
8305 /* The PARM is not one we're trying to unify. Just check
8306 to see if it matches ARG. */
8307 return (TREE_CODE (arg
) == TREE_CODE (parm
)
8308 && same_type_p (parm
, arg
)) ? 0 : 1;
8309 idx
= TEMPLATE_TYPE_IDX (parm
);
8310 targ
= TREE_VEC_ELT (targs
, idx
);
8311 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, idx
));
8313 /* Check for mixed types and values. */
8314 if ((TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
8315 && TREE_CODE (tparm
) != TYPE_DECL
)
8316 || (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
8317 && TREE_CODE (tparm
) != TEMPLATE_DECL
))
8320 if (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
)
8322 if (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (parm
))
8324 /* We arrive here when PARM does not involve template
8327 /* ARG must be constructed from a template class. */
8328 if (TREE_CODE (arg
) != RECORD_TYPE
|| !CLASSTYPE_TEMPLATE_INFO (arg
))
8332 tree parmtmpl
= TYPE_TI_TEMPLATE (parm
);
8333 tree parmvec
= TYPE_TI_ARGS (parm
);
8334 tree argvec
= CLASSTYPE_TI_ARGS (arg
);
8336 = DECL_INNERMOST_TEMPLATE_PARMS (CLASSTYPE_TI_TEMPLATE (arg
));
8339 /* The parameter and argument roles have to be switched here
8340 in order to handle default arguments properly. For example,
8341 template<template <class> class TT> void f(TT<int>)
8342 should be able to accept vector<int> which comes from
8343 template <class T, class Allocator = allocator>
8346 if (coerce_template_parms (argtmplvec
, parmvec
, parmtmpl
, 0, 1)
8350 /* Deduce arguments T, i from TT<T> or TT<i>.
8351 We check each element of PARMVEC and ARGVEC individually
8352 rather than the whole TREE_VEC since they can have
8353 different number of elements. */
8355 for (i
= 0; i
< TREE_VEC_LENGTH (parmvec
); ++i
)
8357 tree t
= TREE_VEC_ELT (parmvec
, i
);
8359 if (unify (tparms
, targs
, t
,
8360 TREE_VEC_ELT (argvec
, i
),
8365 arg
= CLASSTYPE_TI_TEMPLATE (arg
);
8370 /* If PARM is `const T' and ARG is only `int', we don't have
8371 a match unless we are allowing additional qualification.
8372 If ARG is `const int' and PARM is just `T' that's OK;
8373 that binds `const int' to `T'. */
8374 if (!check_cv_quals_for_unify (strict
| UNIFY_ALLOW_LESS_CV_QUAL
,
8378 /* Consider the case where ARG is `const volatile int' and
8379 PARM is `const T'. Then, T should be `volatile int'. */
8381 cp_build_qualified_type_real (arg
,
8383 & ~CP_TYPE_QUALS (parm
),
8385 if (arg
== error_mark_node
)
8389 /* Simple cases: Value already set, does match or doesn't. */
8390 if (targ
!= NULL_TREE
&& same_type_p (targ
, arg
))
8395 /* Make sure that ARG is not a variable-sized array. (Note that
8396 were talking about variable-sized arrays (like `int[n]'),
8397 rather than arrays of unknown size (like `int[]').) We'll
8398 get very confused by such a type since the bound of the array
8399 will not be computable in an instantiation. Besides, such
8400 types are not allowed in ISO C++, so we can do as we please
8402 if (TREE_CODE (arg
) == ARRAY_TYPE
8403 && !uses_template_parms (arg
)
8404 && (TREE_CODE (TYPE_MAX_VALUE (TYPE_DOMAIN (arg
)))
8408 TREE_VEC_ELT (targs
, idx
) = arg
;
8411 case TEMPLATE_PARM_INDEX
:
8412 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
8414 if (TEMPLATE_PARM_LEVEL (parm
)
8415 != template_decl_level (tparm
))
8416 /* The PARM is not one we're trying to unify. Just check
8417 to see if it matches ARG. */
8418 return (TREE_CODE (arg
) == TREE_CODE (parm
)
8419 && cp_tree_equal (parm
, arg
) > 0) ? 0 : 1;
8421 idx
= TEMPLATE_PARM_IDX (parm
);
8422 targ
= TREE_VEC_ELT (targs
, idx
);
8426 int i
= (cp_tree_equal (targ
, arg
) > 0);
8432 my_friendly_abort (42);
8435 /* [temp.deduct.type] If, in the declaration of a function template
8436 with a non-type template-parameter, the non-type
8437 template-parameter is used in an expression in the function
8438 parameter-list and, if the corresponding template-argument is
8439 deduced, the template-argument type shall match the type of the
8440 template-parameter exactly, except that a template-argument
8441 deduced from an array bound may be of any integral type. */
8442 if (same_type_p (TREE_TYPE (arg
), TREE_TYPE (parm
)))
8444 else if ((strict
& UNIFY_ALLOW_INTEGER
)
8445 && (TREE_CODE (TREE_TYPE (parm
)) == INTEGER_TYPE
8446 || TREE_CODE (TREE_TYPE (parm
)) == BOOLEAN_TYPE
))
8451 TREE_VEC_ELT (targs
, idx
) = arg
;
8458 if (TREE_CODE (arg
) != POINTER_TYPE
)
8461 /* [temp.deduct.call]
8463 A can be another pointer or pointer to member type that can
8464 be converted to the deduced A via a qualification
8465 conversion (_conv.qual_).
8467 We pass down STRICT here rather than UNIFY_ALLOW_NONE.
8468 This will allow for additional cv-qualification of the
8469 pointed-to types if appropriate. In general, this is a bit
8470 too generous; we are only supposed to allow qualification
8471 conversions and this method will allow an ARG of char** and
8472 a deduced ARG of const char**. However, overload
8473 resolution will subsequently invalidate the candidate, so
8474 this is probably OK. */
8475 sub_strict
= strict
;
8477 if (TREE_CODE (TREE_TYPE (arg
)) != RECORD_TYPE
)
8478 /* The derived-to-base conversion only persists through one
8479 level of pointers. */
8480 sub_strict
&= ~UNIFY_ALLOW_DERIVED
;
8482 return unify (tparms
, targs
, TREE_TYPE (parm
),
8483 TREE_TYPE (arg
), sub_strict
);
8486 case REFERENCE_TYPE
:
8487 if (TREE_CODE (arg
) != REFERENCE_TYPE
)
8489 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
8493 if (TREE_CODE (arg
) != ARRAY_TYPE
)
8495 if ((TYPE_DOMAIN (parm
) == NULL_TREE
)
8496 != (TYPE_DOMAIN (arg
) == NULL_TREE
))
8498 if (TYPE_DOMAIN (parm
) != NULL_TREE
8499 && unify (tparms
, targs
, TYPE_DOMAIN (parm
),
8500 TYPE_DOMAIN (arg
), UNIFY_ALLOW_NONE
) != 0)
8502 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
8510 if (TREE_CODE (arg
) != TREE_CODE (parm
))
8513 if (TREE_CODE (parm
) == INTEGER_TYPE
8514 && TREE_CODE (TYPE_MAX_VALUE (parm
)) != INTEGER_CST
)
8516 if (TYPE_MIN_VALUE (parm
) && TYPE_MIN_VALUE (arg
)
8517 && unify (tparms
, targs
, TYPE_MIN_VALUE (parm
),
8518 TYPE_MIN_VALUE (arg
), UNIFY_ALLOW_INTEGER
))
8520 if (TYPE_MAX_VALUE (parm
) && TYPE_MAX_VALUE (arg
)
8521 && unify (tparms
, targs
, TYPE_MAX_VALUE (parm
),
8522 TYPE_MAX_VALUE (arg
), UNIFY_ALLOW_INTEGER
))
8525 /* We have already checked cv-qualification at the top of the
8527 else if (!same_type_ignoring_top_level_qualifiers_p (arg
, parm
))
8530 /* As far as unification is concerned, this wins. Later checks
8531 will invalidate it if necessary. */
8534 /* Types INTEGER_CST and MINUS_EXPR can come from array bounds. */
8535 /* Type INTEGER_CST can come from ordinary constant template args. */
8537 while (TREE_CODE (arg
) == NOP_EXPR
)
8538 arg
= TREE_OPERAND (arg
, 0);
8540 if (TREE_CODE (arg
) != INTEGER_CST
)
8542 return !tree_int_cst_equal (parm
, arg
);
8547 if (TREE_CODE (arg
) != TREE_VEC
)
8549 if (TREE_VEC_LENGTH (parm
) != TREE_VEC_LENGTH (arg
))
8551 for (i
= TREE_VEC_LENGTH (parm
) - 1; i
>= 0; i
--)
8552 if (unify (tparms
, targs
,
8553 TREE_VEC_ELT (parm
, i
), TREE_VEC_ELT (arg
, i
),
8561 if (TREE_CODE (arg
) != TREE_CODE (parm
))
8564 if (TYPE_PTRMEMFUNC_P (parm
))
8566 if (!TYPE_PTRMEMFUNC_P (arg
))
8569 return unify (tparms
, targs
,
8570 TYPE_PTRMEMFUNC_FN_TYPE (parm
),
8571 TYPE_PTRMEMFUNC_FN_TYPE (arg
),
8575 if (CLASSTYPE_TEMPLATE_INFO (parm
))
8579 if (strict
& UNIFY_ALLOW_DERIVED
)
8581 /* First, we try to unify the PARM and ARG directly. */
8582 t
= try_class_unification (tparms
, targs
,
8587 /* Fallback to the special case allowed in
8590 If P is a class, and P has the form
8591 template-id, then A can be a derived class of
8592 the deduced A. Likewise, if P is a pointer to
8593 a class of the form template-id, A can be a
8594 pointer to a derived class pointed to by the
8596 t
= get_template_base (tparms
, targs
,
8599 if (! t
|| t
== error_mark_node
)
8603 else if (CLASSTYPE_TEMPLATE_INFO (arg
)
8604 && (CLASSTYPE_TI_TEMPLATE (parm
)
8605 == CLASSTYPE_TI_TEMPLATE (arg
)))
8606 /* Perhaps PARM is something like S<U> and ARG is S<int>.
8607 Then, we should unify `int' and `U'. */
8610 /* There's no chance of unication succeeding. */
8613 return unify (tparms
, targs
, CLASSTYPE_TI_ARGS (parm
),
8614 CLASSTYPE_TI_ARGS (t
), UNIFY_ALLOW_NONE
);
8616 else if (!same_type_ignoring_top_level_qualifiers_p (parm
, arg
))
8622 if (TREE_CODE (arg
) != TREE_CODE (parm
))
8625 if (unify (tparms
, targs
, TREE_TYPE (parm
),
8626 TREE_TYPE (arg
), UNIFY_ALLOW_NONE
))
8628 return type_unification_real (tparms
, targs
, TYPE_ARG_TYPES (parm
),
8629 TYPE_ARG_TYPES (arg
), 1,
8633 if (TREE_CODE (arg
) != OFFSET_TYPE
)
8635 if (unify (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
8636 TYPE_OFFSET_BASETYPE (arg
), UNIFY_ALLOW_NONE
))
8638 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
8642 if (arg
!= decl_constant_value (parm
))
8647 /* Matched cases are handled by the ARG == PARM test above. */
8651 if (TREE_CODE (TREE_OPERAND (parm
, 1)) == INTEGER_CST
)
8653 /* We handle this case specially, since it comes up with
8654 arrays. In particular, something like:
8656 template <int N> void f(int (&x)[N]);
8658 Here, we are trying to unify the range type, which
8659 looks like [0 ... (N - 1)]. */
8661 t1
= TREE_OPERAND (parm
, 0);
8662 t2
= TREE_OPERAND (parm
, 1);
8664 t
= fold (build (PLUS_EXPR
, integer_type_node
, arg
, t2
));
8666 return unify (tparms
, targs
, t1
, t
, strict
);
8668 /* else fall through */
8671 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (parm
))))
8672 /* We're looking at an expression. This can happen with
8676 void foo(S<I>, S<I + 2>);
8678 This is a "nondeduced context":
8682 The nondeduced contexts are:
8684 --A type that is a template-id in which one or more of
8685 the template-arguments is an expression that references
8686 a template-parameter.
8688 In these cases, we assume deduction succeeded, but don't
8689 actually infer any unifications. */
8692 sorry ("use of `%s' in template type unification",
8693 tree_code_name
[(int) TREE_CODE (parm
)]);
8699 /* Called if RESULT is explicitly instantiated, or is a member of an
8700 explicitly instantiated class, or if using -frepo and the
8701 instantiation of RESULT has been assigned to this file. */
8704 mark_decl_instantiated (result
, extern_p
)
8708 if (TREE_CODE (result
) != FUNCTION_DECL
)
8709 /* The TREE_PUBLIC flag for function declarations will have been
8710 set correctly by tsubst. */
8711 TREE_PUBLIC (result
) = 1;
8715 DECL_INTERFACE_KNOWN (result
) = 1;
8716 DECL_NOT_REALLY_EXTERN (result
) = 1;
8718 /* Always make artificials weak. */
8719 if (DECL_ARTIFICIAL (result
) && flag_weak
)
8720 comdat_linkage (result
);
8721 /* For WIN32 we also want to put explicit instantiations in
8722 linkonce sections. */
8723 else if (TREE_PUBLIC (result
))
8724 maybe_make_one_only (result
);
8726 else if (TREE_CODE (result
) == FUNCTION_DECL
)
8730 /* Given two function templates PAT1 and PAT2, and explicit template
8731 arguments EXPLICIT_ARGS return:
8733 1 if PAT1 is more specialized than PAT2 as described in [temp.func.order].
8734 -1 if PAT2 is more specialized than PAT1.
8735 0 if neither is more specialized. */
8738 more_specialized (pat1
, pat2
, explicit_args
)
8739 tree pat1
, pat2
, explicit_args
;
8745 = get_bindings_overload (pat1
, DECL_TEMPLATE_RESULT (pat2
), explicit_args
);
8750 = get_bindings_overload (pat2
, DECL_TEMPLATE_RESULT (pat1
), explicit_args
);
8757 /* Given two class template specialization list nodes PAT1 and PAT2, return:
8759 1 if PAT1 is more specialized than PAT2 as described in [temp.class.order].
8760 -1 if PAT2 is more specialized than PAT1.
8761 0 if neither is more specialized. */
8764 more_specialized_class (pat1
, pat2
)
8770 targs
= get_class_bindings (TREE_VALUE (pat1
), TREE_PURPOSE (pat1
),
8771 TREE_PURPOSE (pat2
));
8775 targs
= get_class_bindings (TREE_VALUE (pat2
), TREE_PURPOSE (pat2
),
8776 TREE_PURPOSE (pat1
));
8783 /* Return the template arguments that will produce the function signature
8784 DECL from the function template FN, with the explicit template
8785 arguments EXPLICIT_ARGS. If CHECK_RETTYPE is 1, the return type must
8786 also match. Return NULL_TREE if no satisfactory arguments could be
8790 get_bindings_real (fn
, decl
, explicit_args
, check_rettype
)
8791 tree fn
, decl
, explicit_args
;
8794 int ntparms
= DECL_NTPARMS (fn
);
8795 tree targs
= make_tree_vec (ntparms
);
8797 tree decl_arg_types
;
8800 /* Substitute the explicit template arguments into the type of DECL.
8801 The call to fn_type_unification will handle substitution into the
8803 decl_type
= TREE_TYPE (decl
);
8804 if (explicit_args
&& uses_template_parms (decl_type
))
8807 tree converted_args
;
8809 if (DECL_TEMPLATE_INFO (decl
))
8810 tmpl
= DECL_TI_TEMPLATE (decl
);
8812 /* We can get here for some illegal specializations. */
8816 = (coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
8817 explicit_args
, NULL_TREE
,
8819 /*require_all_arguments=*/0));
8820 if (converted_args
== error_mark_node
)
8823 decl_type
= tsubst (decl_type
, converted_args
, /*complain=*/0,
8825 if (decl_type
== error_mark_node
)
8829 /* If FN is a static member function, adjust the type of DECL
8831 decl_arg_types
= TYPE_ARG_TYPES (decl_type
);
8832 if (DECL_STATIC_FUNCTION_P (fn
)
8833 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
8834 decl_arg_types
= TREE_CHAIN (decl_arg_types
);
8836 i
= fn_type_unification (fn
, explicit_args
, targs
,
8838 (check_rettype
|| DECL_CONV_FN_P (fn
)
8839 ? TREE_TYPE (decl_type
) : NULL_TREE
),
8848 /* For most uses, we want to check the return type. */
8851 get_bindings (fn
, decl
, explicit_args
)
8852 tree fn
, decl
, explicit_args
;
8854 return get_bindings_real (fn
, decl
, explicit_args
, 1);
8857 /* But for more_specialized, we only care about the parameter types. */
8860 get_bindings_overload (fn
, decl
, explicit_args
)
8861 tree fn
, decl
, explicit_args
;
8863 return get_bindings_real (fn
, decl
, explicit_args
, 0);
8866 /* Return the innermost template arguments that, when applied to a
8867 template specialization whose innermost template parameters are
8868 TPARMS, and whose specialization arguments are ARGS, yield the
8871 For example, suppose we have:
8873 template <class T, class U> struct S {};
8874 template <class T> struct S<T*, int> {};
8876 Then, suppose we want to get `S<double*, int>'. The TPARMS will be
8877 {T}, the PARMS will be {T*, int} and the ARGS will be {double*,
8878 int}. The resulting vector will be {double}, indicating that `T'
8879 is bound to `double'. */
8882 get_class_bindings (tparms
, parms
, args
)
8883 tree tparms
, parms
, args
;
8885 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
8886 tree vec
= make_tree_vec (ntparms
);
8888 args
= innermost_args (args
);
8890 if (unify (tparms
, vec
, parms
, args
, UNIFY_ALLOW_NONE
))
8893 for (i
= 0; i
< ntparms
; ++i
)
8894 if (! TREE_VEC_ELT (vec
, i
))
8900 /* In INSTANTIATIONS is a list of <INSTANTIATION, TEMPLATE> pairs.
8901 Pick the most specialized template, and return the corresponding
8902 instantiation, or if there is no corresponding instantiation, the
8903 template itself. EXPLICIT_ARGS is any template arguments explicity
8904 mentioned in a template-id. If there is no most specialized
8905 template, error_mark_node is returned. If there are no templates
8906 at all, NULL_TREE is returned. */
8909 most_specialized_instantiation (instantiations
, explicit_args
)
8910 tree instantiations
;
8916 if (!instantiations
)
8919 champ
= instantiations
;
8920 for (fn
= TREE_CHAIN (instantiations
); fn
; fn
= TREE_CHAIN (fn
))
8922 fate
= more_specialized (TREE_VALUE (champ
),
8923 TREE_VALUE (fn
), explicit_args
);
8930 fn
= TREE_CHAIN (fn
);
8932 return error_mark_node
;
8938 for (fn
= instantiations
; fn
&& fn
!= champ
; fn
= TREE_CHAIN (fn
))
8940 fate
= more_specialized (TREE_VALUE (champ
),
8941 TREE_VALUE (fn
), explicit_args
);
8943 return error_mark_node
;
8946 return TREE_PURPOSE (champ
) ? TREE_PURPOSE (champ
) : TREE_VALUE (champ
);
8949 /* Return the most specialized of the list of templates in FNS that can
8950 produce an instantiation matching DECL, given the explicit template
8951 arguments EXPLICIT_ARGS. */
8954 most_specialized (fns
, decl
, explicit_args
)
8955 tree fns
, decl
, explicit_args
;
8957 tree candidates
= NULL_TREE
;
8960 for (fn
= fns
; fn
; fn
= TREE_CHAIN (fn
))
8962 tree candidate
= TREE_VALUE (fn
);
8964 args
= get_bindings (candidate
, decl
, explicit_args
);
8966 candidates
= tree_cons (NULL_TREE
, candidate
, candidates
);
8969 return most_specialized_instantiation (candidates
, explicit_args
);
8972 /* If DECL is a specialization of some template, return the most
8973 general such template. For example, given:
8975 template <class T> struct S { template <class U> void f(U); };
8977 if TMPL is `template <class U> void S<int>::f(U)' this will return
8978 the full template. This function will not trace past partial
8979 specializations, however. For example, given in addition:
8981 template <class T> struct S<T*> { template <class U> void f(U); };
8983 if TMPL is `template <class U> void S<int*>::f(U)' this will return
8984 `template <class T> template <class U> S<T*>::f(U)'. */
8987 most_general_template (decl
)
8990 while (DECL_TEMPLATE_INFO (decl
)
8991 && !(TREE_CODE (decl
) == TEMPLATE_DECL
8992 && DECL_TEMPLATE_SPECIALIZATION (decl
))
8993 /* The DECL_TI_TEMPLATE can be a LOOKUP_EXPR or
8994 IDENTIFIER_NODE in some cases. (See cp-tree.h for
8996 && TREE_CODE (DECL_TI_TEMPLATE (decl
)) == TEMPLATE_DECL
)
8997 decl
= DECL_TI_TEMPLATE (decl
);
9002 /* Return the most specialized of the class template specializations
9003 of TMPL which can produce an instantiation matching ARGS, or
9004 error_mark_node if the choice is ambiguous. */
9007 most_specialized_class (tmpl
, args
)
9011 tree list
= NULL_TREE
;
9016 tmpl
= most_general_template (tmpl
);
9017 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
); t
; t
= TREE_CHAIN (t
))
9020 = get_class_bindings (TREE_VALUE (t
), TREE_PURPOSE (t
), args
);
9023 list
= decl_tree_cons (TREE_PURPOSE (t
), TREE_VALUE (t
), list
);
9024 TREE_TYPE (list
) = TREE_TYPE (t
);
9034 for (; t
; t
= TREE_CHAIN (t
))
9036 fate
= more_specialized_class (champ
, t
);
9045 return error_mark_node
;
9051 for (t
= list
; t
&& t
!= champ
; t
= TREE_CHAIN (t
))
9053 fate
= more_specialized_class (champ
, t
);
9055 return error_mark_node
;
9061 /* called from the parser. */
9064 do_decl_instantiation (declspecs
, declarator
, storage
)
9065 tree declspecs
, declarator
, storage
;
9067 tree decl
= grokdeclarator (declarator
, declspecs
, NORMAL
, 0, NULL_TREE
);
9068 tree result
= NULL_TREE
;
9072 /* An error ocurred, for which grokdeclarator has already issued
9073 an appropriate message. */
9075 else if (! DECL_LANG_SPECIFIC (decl
))
9077 cp_error ("explicit instantiation of non-template `%#D'", decl
);
9080 else if (TREE_CODE (decl
) == VAR_DECL
)
9082 /* There is an asymmetry here in the way VAR_DECLs and
9083 FUNCTION_DECLs are handled by grokdeclarator. In the case of
9084 the latter, the DECL we get back will be marked as a
9085 template instantiation, and the appropriate
9086 DECL_TEMPLATE_INFO will be set up. This does not happen for
9087 VAR_DECLs so we do the lookup here. Probably, grokdeclarator
9088 should handle VAR_DECLs as it currently handles
9090 result
= lookup_field (DECL_CONTEXT (decl
), DECL_NAME (decl
), 0, 0);
9091 if (result
&& TREE_CODE (result
) != VAR_DECL
)
9093 cp_error ("no matching template for `%D' found", result
);
9097 else if (TREE_CODE (decl
) != FUNCTION_DECL
)
9099 cp_error ("explicit instantiation of `%#D'", decl
);
9105 /* Check for various error cases. Note that if the explicit
9106 instantiation is legal the RESULT will currently be marked as an
9107 *implicit* instantiation; DECL_EXPLICIT_INSTANTIATION is not set
9108 until we get here. */
9110 if (DECL_TEMPLATE_SPECIALIZATION (result
))
9114 No program shall both explicitly instantiate and explicitly
9115 specialize a template. */
9116 cp_pedwarn ("explicit instantiation of `%#D' after", result
);
9117 cp_pedwarn_at ("explicit specialization here", result
);
9120 else if (DECL_EXPLICIT_INSTANTIATION (result
))
9124 No program shall explicitly instantiate any template more
9127 We check DECL_INTERFACE_KNOWN so as not to complain when the first
9128 instantiation was `extern' and the second is not, and EXTERN_P for
9129 the opposite case. If -frepo, chances are we already got marked
9130 as an explicit instantion because of the repo file. */
9131 if (DECL_INTERFACE_KNOWN (result
) && !extern_p
&& !flag_use_repository
)
9132 cp_pedwarn ("duplicate explicit instantiation of `%#D'", result
);
9134 /* If we've already instantiated the template, just return now. */
9135 if (DECL_INTERFACE_KNOWN (result
))
9138 else if (!DECL_IMPLICIT_INSTANTIATION (result
))
9140 cp_error ("no matching template for `%D' found", result
);
9143 else if (!DECL_TEMPLATE_INFO (result
))
9145 cp_pedwarn ("explicit instantiation of non-template `%#D'", result
);
9149 if (flag_external_templates
)
9152 if (storage
== NULL_TREE
)
9154 else if (storage
== ridpointers
[(int) RID_EXTERN
])
9157 cp_pedwarn ("ISO C++ forbids the use of `extern' on explicit instantiations");
9161 cp_error ("storage class `%D' applied to template instantiation",
9164 SET_DECL_EXPLICIT_INSTANTIATION (result
);
9165 mark_decl_instantiated (result
, extern_p
);
9166 repo_template_instantiated (result
, extern_p
);
9168 instantiate_decl (result
, /*defer_ok=*/1);
9172 mark_class_instantiated (t
, extern_p
)
9176 SET_CLASSTYPE_EXPLICIT_INSTANTIATION (t
);
9177 SET_CLASSTYPE_INTERFACE_KNOWN (t
);
9178 CLASSTYPE_INTERFACE_ONLY (t
) = extern_p
;
9179 CLASSTYPE_VTABLE_NEEDS_WRITING (t
) = ! extern_p
;
9180 TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (t
)) = extern_p
;
9183 CLASSTYPE_DEBUG_REQUESTED (t
) = 1;
9184 rest_of_type_compilation (t
, 1);
9189 do_type_instantiation (t
, storage
)
9196 if (TREE_CODE (t
) == TYPE_DECL
)
9199 if (! CLASS_TYPE_P (t
) || ! CLASSTYPE_TEMPLATE_INFO (t
))
9201 cp_error ("explicit instantiation of non-template type `%T'", t
);
9207 /* With -fexternal-templates, explicit instantiations are treated the same
9208 as implicit ones. */
9209 if (flag_external_templates
)
9212 if (!COMPLETE_TYPE_P (t
))
9214 cp_error ("explicit instantiation of `%#T' before definition of template",
9219 if (storage
!= NULL_TREE
)
9222 cp_pedwarn("ISO C++ forbids the use of `%s' on explicit instantiations",
9223 IDENTIFIER_POINTER (storage
));
9225 if (storage
== ridpointers
[(int) RID_INLINE
])
9227 else if (storage
== ridpointers
[(int) RID_EXTERN
])
9229 else if (storage
== ridpointers
[(int) RID_STATIC
])
9233 cp_error ("storage class `%D' applied to template instantiation",
9239 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
9243 No program shall both explicitly instantiate and explicitly
9244 specialize a template. */
9245 cp_error ("explicit instantiation of `%#T' after", t
);
9246 cp_error_at ("explicit specialization here", t
);
9249 else if (CLASSTYPE_EXPLICIT_INSTANTIATION (t
))
9253 No program shall explicitly instantiate any template more
9256 If CLASSTYPE_INTERFACE_ONLY, then the first explicit instantiation
9257 was `extern'. If EXTERN_P then the second is. If -frepo, chances
9258 are we already got marked as an explicit instantion because of the
9259 repo file. All these cases are OK. */
9260 if (!CLASSTYPE_INTERFACE_ONLY (t
) && !extern_p
&& !flag_use_repository
)
9261 cp_pedwarn ("duplicate explicit instantiation of `%#T'", t
);
9263 /* If we've already instantiated the template, just return now. */
9264 if (!CLASSTYPE_INTERFACE_ONLY (t
))
9268 mark_class_instantiated (t
, extern_p
);
9269 repo_template_instantiated (t
, extern_p
);
9277 /* In contrast to implicit instantiation, where only the
9278 declarations, and not the definitions, of members are
9279 instantiated, we have here:
9283 The explicit instantiation of a class template specialization
9284 implies the instantiation of all of its members not
9285 previously explicitly specialized in the translation unit
9286 containing the explicit instantiation.
9288 Of course, we can't instantiate member template classes, since
9289 we don't have any arguments for them. Note that the standard
9290 is unclear on whether the instatiation of the members are
9291 *explicit* instantiations or not. We choose to be generous,
9292 and not set DECL_EXPLICIT_INSTANTIATION. Therefore, we allow
9293 the explicit instantiation of a class where some of the members
9294 have no definition in the current translation unit. */
9297 for (tmp
= TYPE_METHODS (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
9298 if (TREE_CODE (tmp
) == FUNCTION_DECL
9299 && DECL_TEMPLATE_INSTANTIATION (tmp
))
9301 mark_decl_instantiated (tmp
, extern_p
);
9302 repo_template_instantiated (tmp
, extern_p
);
9304 instantiate_decl (tmp
, /*defer_ok=*/1);
9307 for (tmp
= TYPE_FIELDS (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
9308 if (TREE_CODE (tmp
) == VAR_DECL
&& DECL_TEMPLATE_INSTANTIATION (tmp
))
9310 mark_decl_instantiated (tmp
, extern_p
);
9311 repo_template_instantiated (tmp
, extern_p
);
9313 instantiate_decl (tmp
, /*defer_ok=*/1);
9316 for (tmp
= CLASSTYPE_TAGS (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
9317 if (IS_AGGR_TYPE (TREE_VALUE (tmp
))
9318 && !uses_template_parms (CLASSTYPE_TI_ARGS (TREE_VALUE (tmp
))))
9319 do_type_instantiation (TYPE_MAIN_DECL (TREE_VALUE (tmp
)), storage
);
9323 /* Given a function DECL, which is a specialization of TMPL, modify
9324 DECL to be a re-instantiation of TMPL with the same template
9325 arguments. TMPL should be the template into which tsubst'ing
9326 should occur for DECL, not the most general template.
9328 One reason for doing this is a scenario like this:
9331 void f(const T&, int i);
9333 void g() { f(3, 7); }
9336 void f(const T& t, const int i) { }
9338 Note that when the template is first instantiated, with
9339 instantiate_template, the resulting DECL will have no name for the
9340 first parameter, and the wrong type for the second. So, when we go
9341 to instantiate the DECL, we regenerate it. */
9344 regenerate_decl_from_template (decl
, tmpl
)
9354 args
= DECL_TI_ARGS (decl
);
9355 code_pattern
= DECL_TEMPLATE_RESULT (tmpl
);
9357 /* Unregister the specialization so that when we tsubst we will not
9358 just return DECL. We don't have to unregister DECL from TMPL
9359 because if would only be registered there if it were a partial
9360 instantiation of a specialization, which it isn't: it's a full
9362 gen_tmpl
= most_general_template (tmpl
);
9363 unregistered
= unregister_specialization (decl
, gen_tmpl
);
9365 /* If the DECL was not unregistered then something peculiar is
9366 happening: we created a specialization but did not call
9367 register_specialization for it. */
9368 my_friendly_assert (unregistered
, 0);
9370 if (TREE_CODE (decl
) == VAR_DECL
)
9371 /* Make sure that we can see identifiers, and compute access
9372 correctly, for the class members used in the declaration of
9373 this static variable. */
9374 pushclass (DECL_CONTEXT (decl
), 2);
9376 /* Do the substitution to get the new declaration. */
9377 new_decl
= tsubst (code_pattern
, args
, /*complain=*/1, NULL_TREE
);
9379 if (TREE_CODE (decl
) == VAR_DECL
)
9381 /* Set up DECL_INITIAL, since tsubst doesn't. */
9382 DECL_INITIAL (new_decl
) =
9383 tsubst_expr (DECL_INITIAL (code_pattern
), args
,
9384 /*complain=*/1, DECL_TI_TEMPLATE (decl
));
9385 /* Pop the class context we pushed above. */
9388 else if (TREE_CODE (decl
) == FUNCTION_DECL
)
9390 /* Convince duplicate_decls to use the DECL_ARGUMENTS from the
9392 DECL_INITIAL (new_decl
) = error_mark_node
;
9393 /* And don't complain about a duplicate definition. */
9394 DECL_INITIAL (decl
) = NULL_TREE
;
9397 /* The immediate parent of the new template is still whatever it was
9398 before, even though tsubst sets DECL_TI_TEMPLATE up as the most
9399 general template. We also reset the DECL_ASSEMBLER_NAME since
9400 tsubst always calculates the name as if the function in question
9401 were really a template instance, and sometimes, with friend
9402 functions, this is not so. See tsubst_friend_function for
9404 DECL_TI_TEMPLATE (new_decl
) = DECL_TI_TEMPLATE (decl
);
9405 DECL_ASSEMBLER_NAME (new_decl
) = DECL_ASSEMBLER_NAME (decl
);
9406 DECL_RTL (new_decl
) = DECL_RTL (decl
);
9408 /* Call duplicate decls to merge the old and new declarations. */
9409 duplicate_decls (new_decl
, decl
);
9411 /* Now, re-register the specialization. */
9412 register_specialization (decl
, gen_tmpl
, args
);
9415 /* Produce the definition of D, a _DECL generated from a template. If
9416 DEFER_OK is non-zero, then we don't have to actually do the
9417 instantiation now; we just have to do it sometime. */
9420 instantiate_decl (d
, defer_ok
)
9424 tree tmpl
= DECL_TI_TEMPLATE (d
);
9425 tree args
= DECL_TI_ARGS (d
);
9430 int pattern_defined
;
9432 const char *file
= input_filename
;
9434 /* This function should only be used to instantiate templates for
9435 functions and static member variables. */
9436 my_friendly_assert (TREE_CODE (d
) == FUNCTION_DECL
9437 || TREE_CODE (d
) == VAR_DECL
, 0);
9439 /* Don't instantiate cloned functions. Instead, instantiate the
9440 functions they cloned. */
9441 if (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_CLONED_FUNCTION_P (d
))
9442 d
= DECL_CLONED_FUNCTION (d
);
9444 if (DECL_TEMPLATE_INSTANTIATED (d
))
9445 /* D has already been instantiated. It might seem reasonable to
9446 check whether or not D is an explict instantiation, and, if so,
9447 stop here. But when an explicit instantiation is deferred
9448 until the end of the compilation, DECL_EXPLICIT_INSTANTIATION
9449 is set, even though we still need to do the instantiation. */
9452 /* If we already have a specialization of this declaration, then
9453 there's no reason to instantiate it. Note that
9454 retrieve_specialization gives us both instantiations and
9455 specializations, so we must explicitly check
9456 DECL_TEMPLATE_SPECIALIZATION. */
9457 gen_tmpl
= most_general_template (tmpl
);
9458 spec
= retrieve_specialization (gen_tmpl
, args
);
9459 if (spec
!= NULL_TREE
&& DECL_TEMPLATE_SPECIALIZATION (spec
))
9462 /* This needs to happen before any tsubsting. */
9463 if (! push_tinst_level (d
))
9466 /* Set TD to the template whose DECL_TEMPLATE_RESULT is the pattern
9467 for the instantiation. This is not always the most general
9468 template. Consider, for example:
9471 struct S { template <class U> void f();
9472 template <> void f<int>(); };
9474 and an instantiation of S<double>::f<int>. We want TD to be the
9475 specialization S<T>::f<int>, not the more general S<T>::f<U>. */
9478 /* An instantiation cannot have a definition, so we need a
9479 more general template. */
9480 DECL_TEMPLATE_INSTANTIATION (td
)
9481 /* We must also deal with friend templates. Given:
9483 template <class T> struct S {
9484 template <class U> friend void f() {};
9487 S<int>::f<U> say, is not an instantiation of S<T>::f<U>,
9488 so far as the language is concerned, but that's still
9489 where we get the pattern for the instantiation from. On
9490 ther hand, if the definition comes outside the class, say:
9492 template <class T> struct S {
9493 template <class U> friend void f();
9495 template <class U> friend void f() {}
9497 we don't need to look any further. That's what the check for
9498 DECL_INITIAL is for. */
9499 || (TREE_CODE (d
) == FUNCTION_DECL
9500 && DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (td
)
9501 && !DECL_INITIAL (DECL_TEMPLATE_RESULT (td
)));
9504 /* The present template, TD, should not be a definition. If it
9505 were a definition, we should be using it! Note that we
9506 cannot restructure the loop to just keep going until we find
9507 a template with a definition, since that might go too far if
9508 a specialization was declared, but not defined. */
9509 my_friendly_assert (!(TREE_CODE (d
) == VAR_DECL
9510 && !DECL_IN_AGGR_P (DECL_TEMPLATE_RESULT (td
))),
9513 /* Fetch the more general template. */
9514 td
= DECL_TI_TEMPLATE (td
);
9517 code_pattern
= DECL_TEMPLATE_RESULT (td
);
9519 if (TREE_CODE (d
) == FUNCTION_DECL
)
9520 pattern_defined
= (DECL_SAVED_TREE (code_pattern
) != NULL_TREE
);
9522 pattern_defined
= ! DECL_IN_AGGR_P (code_pattern
);
9524 push_to_top_level ();
9525 lineno
= DECL_SOURCE_LINE (d
);
9526 input_filename
= DECL_SOURCE_FILE (d
);
9528 if (pattern_defined
)
9530 repo_template_used (d
);
9532 if (flag_external_templates
&& ! DECL_INTERFACE_KNOWN (d
))
9534 if (flag_alt_external_templates
)
9536 if (interface_unknown
)
9537 warn_if_unknown_interface (d
);
9539 else if (DECL_INTERFACE_KNOWN (code_pattern
))
9541 DECL_INTERFACE_KNOWN (d
) = 1;
9542 DECL_NOT_REALLY_EXTERN (d
) = ! DECL_EXTERNAL (code_pattern
);
9545 warn_if_unknown_interface (code_pattern
);
9549 import_export_decl (d
);
9552 /* Reject all external templates except inline functions. */
9553 if (DECL_INTERFACE_KNOWN (d
)
9554 && ! DECL_NOT_REALLY_EXTERN (d
)
9555 && ! (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_INLINE (d
)))
9558 /* We need to set up DECL_INITIAL regardless of pattern_defined if
9559 the variable is a static const initialized in the class body. */
9560 if (TREE_CODE (d
) == VAR_DECL
9561 && TREE_READONLY (d
)
9562 && DECL_INITIAL (d
) == NULL_TREE
9563 && DECL_INITIAL (code_pattern
) != NULL_TREE
)
9565 /* Defer all other templates, unless we have been explicitly
9566 forbidden from doing so. We restore the source position here
9567 because it's used by add_pending_template. */
9568 else if (! pattern_defined
|| defer_ok
)
9571 input_filename
= file
;
9573 if (at_eof
&& !pattern_defined
9574 && DECL_EXPLICIT_INSTANTIATION (d
))
9577 The definition of a non-exported function template, a
9578 non-exported member function template, or a non-exported
9579 member function or static data member of a class template
9580 shall be present in every translation unit in which it is
9581 explicitly instantiated. */
9582 cp_error ("explicit instantiation of `%D' but no definition available",
9585 add_pending_template (d
);
9589 /* We're now committed to instantiating this template. Mark it as
9590 instantiated so that recursive calls to instantiate_decl do not
9591 try to instantiate it again. */
9592 DECL_TEMPLATE_INSTANTIATED (d
) = 1;
9594 /* Regenerate the declaration in case the template has been modified
9595 by a subsequent redeclaration. */
9596 regenerate_decl_from_template (d
, td
);
9598 /* We already set the file and line above. Reset them now in case
9599 they changed as a result of calling regenerate_decl_from_template. */
9600 lineno
= DECL_SOURCE_LINE (d
);
9601 input_filename
= DECL_SOURCE_FILE (d
);
9603 if (TREE_CODE (d
) == VAR_DECL
)
9605 DECL_IN_AGGR_P (d
) = 0;
9606 if (DECL_INTERFACE_KNOWN (d
))
9607 DECL_EXTERNAL (d
) = ! DECL_NOT_REALLY_EXTERN (d
);
9610 DECL_EXTERNAL (d
) = 1;
9611 DECL_NOT_REALLY_EXTERN (d
) = 1;
9613 cp_finish_decl (d
, DECL_INITIAL (d
), NULL_TREE
, 0);
9615 else if (TREE_CODE (d
) == FUNCTION_DECL
)
9617 /* Set up the list of local specializations. */
9618 my_friendly_assert (local_specializations
== NULL
, 20000422);
9619 local_specializations
= htab_create (37,
9624 /* Set up context. */
9625 start_function (NULL_TREE
, d
, NULL_TREE
, SF_PRE_PARSED
);
9626 store_parm_decls ();
9628 /* We already set up __FUNCTION__, etc., so we don't want to do
9630 current_function_name_declared
= 1;
9632 /* Substitute into the body of the function. */
9633 tsubst_expr (DECL_SAVED_TREE (code_pattern
), args
,
9634 /*complain=*/1, tmpl
);
9636 /* We don't need the local specializations any more. */
9637 htab_delete (local_specializations
);
9638 local_specializations
= NULL
;
9640 /* Finish the function. */
9641 expand_body (finish_function (0));
9644 /* We're not deferring instantiation any more. */
9645 TI_PENDING_TEMPLATE_FLAG (DECL_TEMPLATE_INFO (d
)) = 0;
9649 input_filename
= file
;
9651 pop_from_top_level ();
9657 /* Run through the list of templates that we wish we could
9658 instantiate, and instantiate any we can. */
9661 instantiate_pending_templates ()
9664 int instantiated_something
= 0;
9671 t
= &pending_templates
;
9674 tree srcloc
= TREE_PURPOSE (*t
);
9675 tree instantiation
= TREE_VALUE (*t
);
9677 input_filename
= SRCLOC_FILE (srcloc
);
9678 lineno
= SRCLOC_LINE (srcloc
);
9680 if (TYPE_P (instantiation
))
9684 if (!COMPLETE_TYPE_P (instantiation
))
9686 instantiate_class_template (instantiation
);
9687 if (CLASSTYPE_TEMPLATE_INSTANTIATION (instantiation
))
9688 for (fn
= TYPE_METHODS (instantiation
);
9690 fn
= TREE_CHAIN (fn
))
9691 if (! DECL_ARTIFICIAL (fn
))
9692 instantiate_decl (fn
, /*defer_ok=*/0);
9693 if (COMPLETE_TYPE_P (instantiation
))
9695 instantiated_something
= 1;
9700 if (COMPLETE_TYPE_P (instantiation
))
9701 /* If INSTANTIATION has been instantiated, then we don't
9702 need to consider it again in the future. */
9703 *t
= TREE_CHAIN (*t
);
9705 t
= &TREE_CHAIN (*t
);
9709 if (!DECL_TEMPLATE_SPECIALIZATION (instantiation
)
9710 && !DECL_TEMPLATE_INSTANTIATED (instantiation
))
9712 instantiation
= instantiate_decl (instantiation
,
9714 if (DECL_TEMPLATE_INSTANTIATED (instantiation
))
9716 instantiated_something
= 1;
9721 if (DECL_TEMPLATE_SPECIALIZATION (instantiation
)
9722 || DECL_TEMPLATE_INSTANTIATED (instantiation
))
9723 /* If INSTANTIATION has been instantiated, then we don't
9724 need to consider it again in the future. */
9725 *t
= TREE_CHAIN (*t
);
9727 t
= &TREE_CHAIN (*t
);
9732 /* Go through the things that are template instantiations if we are
9733 using guiding declarations. */
9734 t
= &maybe_templates
;
9741 fn
= TREE_VALUE (*t
);
9743 if (DECL_INITIAL (fn
))
9744 /* If the FN is already defined, then it was either already
9745 instantiated or, even though guiding declarations were
9746 allowed, a non-template definition was provided. */
9750 template = TREE_PURPOSE (*t
);
9751 args
= get_bindings (template, fn
, NULL_TREE
);
9752 fn
= instantiate_template (template, args
);
9753 instantiate_decl (fn
, /*defer_ok=*/0);
9757 /* Remove this entry from the chain. */
9758 *t
= TREE_CHAIN (*t
);
9760 maybe_template_tail
= t
;
9764 return instantiated_something
;
9767 /* Substitute ARGVEC into T, which is a TREE_LIST. In particular, it
9768 is an initializer list: the TREE_PURPOSEs are DECLs, and the
9769 TREE_VALUEs are initializer values. Used by instantiate_decl. */
9772 tsubst_expr_values (t
, argvec
)
9775 tree first
= NULL_TREE
;
9778 for (; t
; t
= TREE_CHAIN (t
))
9780 tree pur
= tsubst_copy (TREE_PURPOSE (t
), argvec
,
9781 /*complain=*/1, NULL_TREE
);
9782 tree val
= tsubst_expr (TREE_VALUE (t
), argvec
, /*complain=*/1,
9784 *p
= build_tree_list (pur
, val
);
9785 p
= &TREE_CHAIN (*p
);
9790 /* D is an undefined function declaration in the presence of templates with
9791 the same name, listed in FNS. If one of them can produce D as an
9792 instantiation, remember this so we can instantiate it at EOF if D has
9793 not been defined by that time. */
9796 add_maybe_template (d
, fns
)
9801 if (DECL_MAYBE_TEMPLATE (d
))
9804 t
= most_specialized (fns
, d
, NULL_TREE
);
9807 if (t
== error_mark_node
)
9809 cp_error ("ambiguous template instantiation for `%D'", d
);
9813 *maybe_template_tail
= tree_cons (t
, d
, NULL_TREE
);
9814 maybe_template_tail
= &TREE_CHAIN (*maybe_template_tail
);
9815 DECL_MAYBE_TEMPLATE (d
) = 1;
9818 /* Set CURRENT_ACCESS_SPECIFIER based on the protection of DECL. */
9821 set_current_access_from_decl (decl
)
9824 if (TREE_PRIVATE (decl
))
9825 current_access_specifier
= access_private_node
;
9826 else if (TREE_PROTECTED (decl
))
9827 current_access_specifier
= access_protected_node
;
9829 current_access_specifier
= access_public_node
;
9832 /* Instantiate an enumerated type. TAG is the template type, NEWTAG
9833 is the instantiation (which should have been created with
9834 start_enum) and ARGS are the template arguments to use. */
9837 tsubst_enum (tag
, newtag
, args
)
9844 for (e
= TYPE_VALUES (tag
); e
; e
= TREE_CHAIN (e
))
9848 /* Note that in a template enum, the TREE_VALUE is the
9849 CONST_DECL, not the corresponding INTEGER_CST. */
9850 value
= tsubst_expr (DECL_INITIAL (TREE_VALUE (e
)),
9851 args
, /*complain=*/1,
9854 /* Give this enumeration constant the correct access. */
9855 set_current_access_from_decl (TREE_VALUE (e
));
9857 /* Actually build the enumerator itself. */
9858 build_enumerator (TREE_PURPOSE (e
), value
, newtag
);
9861 finish_enum (newtag
);
9864 /* Set the DECL_ASSEMBLER_NAME for DECL, which is a FUNCTION_DECL that
9865 is either an instantiation or specialization of a template
9869 set_mangled_name_for_template_decl (decl
)
9872 tree saved_namespace
;
9873 tree context
= NULL_TREE
;
9882 my_friendly_assert (TREE_CODE (decl
) == FUNCTION_DECL
, 0);
9883 my_friendly_assert (DECL_TEMPLATE_INFO (decl
) != NULL_TREE
, 0);
9885 /* The names of template functions must be mangled so as to indicate
9886 what template is being specialized with what template arguments.
9887 For example, each of the following three functions must get
9888 different mangled names:
9891 template <> void f<7>(int);
9892 template <> void f<8>(int); */
9894 targs
= DECL_TI_ARGS (decl
);
9895 if (uses_template_parms (targs
))
9896 /* This DECL is for a partial instantiation. There's no need to
9897 mangle the name of such an entity. */
9900 tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
9901 tparms
= DECL_TEMPLATE_PARMS (tmpl
);
9902 parm_depth
= TMPL_PARMS_DEPTH (tparms
);
9904 /* There should be as many levels of arguments as there are levels
9906 my_friendly_assert (parm_depth
== TMPL_ARGS_DEPTH (targs
), 0);
9908 /* We now compute the PARMS and RET_TYPE to give to
9909 build_decl_overload_real. The PARMS and RET_TYPE are the
9910 parameter and return types of the template, after all but the
9911 innermost template arguments have been substituted, not the
9912 parameter and return types of the function DECL. For example,
9915 template <class T> T f(T);
9917 both PARMS and RET_TYPE should be `T' even if DECL is `int f(int)'.
9918 A more subtle example is:
9920 template <class T> struct S { template <class U> void f(T, U); }
9922 Here, if DECL is `void S<int>::f(int, double)', PARMS should be
9923 {int, U}. Thus, the args that we want to subsitute into the
9924 return and parameter type for the function are those in TARGS,
9925 with the innermost level omitted. */
9926 fn_type
= TREE_TYPE (tmpl
);
9927 if (DECL_STATIC_FUNCTION_P (decl
))
9928 context
= DECL_CONTEXT (decl
);
9930 if (parm_depth
== 1)
9931 /* No substitution is necessary. */
9938 /* Replace the innermost level of the TARGS with NULL_TREEs to
9939 let tsubst know not to subsitute for those parameters. */
9940 partial_args
= make_tree_vec (TREE_VEC_LENGTH (targs
));
9941 for (i
= 1; i
< TMPL_ARGS_DEPTH (targs
); ++i
)
9942 SET_TMPL_ARGS_LEVEL (partial_args
, i
,
9943 TMPL_ARGS_LEVEL (targs
, i
));
9944 SET_TMPL_ARGS_LEVEL (partial_args
,
9945 TMPL_ARGS_DEPTH (targs
),
9946 make_tree_vec (DECL_NTPARMS (tmpl
)));
9948 /* Now, do the (partial) substitution to figure out the
9949 appropriate function type. */
9950 fn_type
= tsubst (fn_type
, partial_args
, /*complain=*/1, NULL_TREE
);
9951 if (DECL_STATIC_FUNCTION_P (decl
))
9952 context
= tsubst (context
, partial_args
, /*complain=*/1, NULL_TREE
);
9954 /* Substitute into the template parameters to obtain the real
9955 innermost set of parameters. This step is important if the
9956 innermost set of template parameters contains value
9957 parameters whose types depend on outer template parameters. */
9958 TREE_VEC_LENGTH (partial_args
)--;
9959 tparms
= tsubst_template_parms (tparms
, partial_args
, /*complain=*/1);
9962 /* Now, get the innermost parameters and arguments, and figure out
9963 the parameter and return types. */
9964 tparms
= INNERMOST_TEMPLATE_PARMS (tparms
);
9965 targs
= innermost_args (targs
);
9966 ret_type
= TREE_TYPE (fn_type
);
9967 parm_types
= TYPE_ARG_TYPES (fn_type
);
9969 /* For a static member function, we generate a fake `this' pointer,
9970 for the purposes of mangling. This indicates of which class the
9971 function is a member. Because of:
9975 There shall not be a static and a nonstatic member function
9976 with the same name and the same parameter types
9978 we don't have to worry that this will result in a clash with a
9979 non-static member function. */
9980 if (DECL_STATIC_FUNCTION_P (decl
))
9981 parm_types
= hash_tree_chain (build_pointer_type (context
), parm_types
);
9983 /* There should be the same number of template parameters as
9984 template arguments. */
9985 my_friendly_assert (TREE_VEC_LENGTH (tparms
) == TREE_VEC_LENGTH (targs
),
9988 /* If the template is in a namespace, we need to put that into the
9989 mangled name. Unfortunately, build_decl_overload_real does not
9990 get the decl to mangle, so it relies on the current
9991 namespace. Therefore, we set that here temporarily. */
9992 my_friendly_assert (DECL_P (decl
), 980702);
9993 saved_namespace
= current_namespace
;
9994 current_namespace
= CP_DECL_CONTEXT (decl
);
9996 /* Actually set the DCL_ASSEMBLER_NAME. */
9997 DECL_ASSEMBLER_NAME (decl
)
9998 = build_decl_overload_real (DECL_NAME (decl
), parm_types
, ret_type
,
10000 DECL_FUNCTION_MEMBER_P (decl
)
10001 + DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (decl
));
10003 /* Restore the previously active namespace. */
10004 current_namespace
= saved_namespace
;