1 /* Handle parameterized types (templates) for GNU C++.
2 Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
3 2001 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". */
35 #include "tree-inline.h"
46 /* The type of functions taking a tree, and some additional data, and
48 typedef int (*tree_fn_t
) PARAMS ((tree
, void*));
50 extern struct obstack permanent_obstack
;
52 /* The PENDING_TEMPLATES is a TREE_LIST of templates whose
53 instantiations have been deferred, either because their definitions
54 were not yet available, or because we were putting off doing the
55 work. The TREE_PURPOSE of each entry is a SRCLOC indicating where
56 the instantiate request occurred; the TREE_VALUE is a either a DECL
57 (for a function or static data member), or a TYPE (for a class)
58 indicating what we are hoping to instantiate. */
59 static tree pending_templates
;
60 static tree last_pending_template
;
62 int processing_template_parmlist
;
63 static int template_header_count
;
65 static tree saved_trees
;
66 static varray_type inline_parm_levels
;
67 static size_t inline_parm_levels_used
;
69 static tree current_tinst_level
;
71 /* A map from local variable declarations in the body of the template
72 presently being instantiated to the corresponding instantiated
74 static htab_t local_specializations
;
76 #define obstack_chunk_alloc xmalloc
77 #define obstack_chunk_free free
79 #define UNIFY_ALLOW_NONE 0
80 #define UNIFY_ALLOW_MORE_CV_QUAL 1
81 #define UNIFY_ALLOW_LESS_CV_QUAL 2
82 #define UNIFY_ALLOW_DERIVED 4
83 #define UNIFY_ALLOW_INTEGER 8
84 #define UNIFY_ALLOW_OUTER_LEVEL 16
85 #define UNIFY_ALLOW_OUTER_MORE_CV_QUAL 32
86 #define UNIFY_ALLOW_OUTER_LESS_CV_QUAL 64
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 void reopen_tinst_level
PARAMS ((tree
));
102 static tree classtype_mangled_name
PARAMS ((tree
));
103 static char *mangle_class_name_for_template
PARAMS ((const char *, tree
, tree
));
104 static tree tsubst_initializer_list
PARAMS ((tree
, tree
));
105 static int list_eq
PARAMS ((tree
, tree
));
106 static tree get_class_bindings
PARAMS ((tree
, tree
, tree
));
107 static tree coerce_template_parms
PARAMS ((tree
, tree
, tree
, int, int));
108 static void tsubst_enum
PARAMS ((tree
, tree
, tree
));
109 static tree add_to_template_args
PARAMS ((tree
, tree
));
110 static tree add_outermost_template_args
PARAMS ((tree
, tree
));
111 static int maybe_adjust_types_for_deduction
PARAMS ((unification_kind_t
, tree
*,
113 static int type_unification_real
PARAMS ((tree
, tree
, tree
, tree
,
114 int, unification_kind_t
, int, int));
115 static void note_template_header
PARAMS ((int));
116 static tree maybe_fold_nontype_arg
PARAMS ((tree
));
117 static tree convert_nontype_argument
PARAMS ((tree
, tree
));
118 static tree convert_template_argument
PARAMS ((tree
, tree
, tree
, int,
120 static tree get_bindings_overload
PARAMS ((tree
, tree
, tree
));
121 static int for_each_template_parm
PARAMS ((tree
, tree_fn_t
, void*));
122 static tree build_template_parm_index
PARAMS ((int, int, int, tree
, tree
));
123 static int inline_needs_template_parms
PARAMS ((tree
));
124 static void push_inline_template_parms_recursive
PARAMS ((tree
, int));
125 static tree retrieve_specialization
PARAMS ((tree
, tree
));
126 static tree retrieve_local_specialization
PARAMS ((tree
));
127 static tree register_specialization
PARAMS ((tree
, tree
, tree
));
128 static void register_local_specialization
PARAMS ((tree
, tree
));
129 static int unregister_specialization
PARAMS ((tree
, tree
));
130 static tree reduce_template_parm_level
PARAMS ((tree
, tree
, int));
131 static tree build_template_decl
PARAMS ((tree
, tree
));
132 static int mark_template_parm
PARAMS ((tree
, void *));
133 static tree tsubst_friend_function
PARAMS ((tree
, tree
));
134 static tree tsubst_friend_class
PARAMS ((tree
, tree
));
135 static tree get_bindings_real
PARAMS ((tree
, tree
, tree
, int, int, int));
136 static int template_decl_level
PARAMS ((tree
));
137 static tree maybe_get_template_decl_from_type_decl
PARAMS ((tree
));
138 static int check_cv_quals_for_unify
PARAMS ((int, tree
, tree
));
139 static tree tsubst_template_arg_vector
PARAMS ((tree
, tree
, int));
140 static tree tsubst_template_parms
PARAMS ((tree
, tree
, int));
141 static void regenerate_decl_from_template
PARAMS ((tree
, tree
));
142 static tree most_specialized
PARAMS ((tree
, tree
, tree
));
143 static tree most_specialized_class
PARAMS ((tree
, 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
));
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 int verify_class_unification
PARAMS ((tree
, tree
, tree
));
158 static tree try_class_unification
PARAMS ((tree
, tree
, tree
, tree
));
159 static int coerce_template_template_parms
PARAMS ((tree
, tree
, int,
161 static tree determine_specialization
PARAMS ((tree
, tree
, tree
*, int));
162 static int template_args_equal
PARAMS ((tree
, tree
));
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
));
166 static tree copy_default_args_to_explicit_spec_1
PARAMS ((tree
, tree
));
167 static void copy_default_args_to_explicit_spec
PARAMS ((tree
));
168 static int invalid_nontype_parm_type_p
PARAMS ((tree
, int));
170 /* Called once to initialize pt.c. */
175 ggc_add_tree_root (&pending_templates
, 1);
176 ggc_add_tree_root (&saved_trees
, 1);
177 ggc_add_tree_root (¤t_tinst_level
, 1);
180 /* Do any processing required when DECL (a member template declaration
181 using TEMPLATE_PARAMETERS as its innermost parameter list) is
182 finished. Returns the TEMPLATE_DECL corresponding to DECL, unless
183 it is a specialization, in which case the DECL itself is returned. */
186 finish_member_template_decl (decl
)
189 if (decl
== NULL_TREE
|| decl
== void_type_node
)
191 else if (decl
== error_mark_node
)
192 /* By returning NULL_TREE, the parser will just ignore this
193 declaration. We have already issued the error. */
195 else if (TREE_CODE (decl
) == TREE_LIST
)
197 /* Assume that the class is the only declspec. */
198 decl
= TREE_VALUE (decl
);
199 if (IS_AGGR_TYPE (decl
) && CLASSTYPE_TEMPLATE_INFO (decl
)
200 && ! CLASSTYPE_TEMPLATE_SPECIALIZATION (decl
))
202 tree tmpl
= CLASSTYPE_TI_TEMPLATE (decl
);
203 check_member_template (tmpl
);
208 else if (TREE_CODE (decl
) == FIELD_DECL
)
209 cp_error ("data member `%D' cannot be a member template", decl
);
210 else if (DECL_TEMPLATE_INFO (decl
))
212 if (!DECL_TEMPLATE_SPECIALIZATION (decl
))
214 check_member_template (DECL_TI_TEMPLATE (decl
));
215 return DECL_TI_TEMPLATE (decl
);
221 cp_error ("invalid member template declaration `%D'", decl
);
223 return error_mark_node
;
226 /* Returns the template nesting level of the indicated class TYPE.
236 A<T>::B<U> has depth two, while A<T> has depth one.
237 Both A<T>::B<int> and A<int>::B<U> have depth one, if
238 COUNT_SPECIALIZATIONS is 0 or if they are instantiations, not
241 This function is guaranteed to return 0 if passed NULL_TREE so
242 that, for example, `template_class_depth (current_class_type)' is
246 template_class_depth_real (type
, count_specializations
)
248 int count_specializations
;
253 type
&& TREE_CODE (type
) != NAMESPACE_DECL
;
254 type
= (TREE_CODE (type
) == FUNCTION_DECL
)
255 ? CP_DECL_CONTEXT (type
) : TYPE_CONTEXT (type
))
257 if (TREE_CODE (type
) != FUNCTION_DECL
)
259 if (CLASSTYPE_TEMPLATE_INFO (type
)
260 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (type
))
261 && ((count_specializations
262 && CLASSTYPE_TEMPLATE_SPECIALIZATION (type
))
263 || uses_template_parms (CLASSTYPE_TI_ARGS (type
))))
268 if (DECL_TEMPLATE_INFO (type
)
269 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (type
))
270 && ((count_specializations
271 && DECL_TEMPLATE_SPECIALIZATION (type
))
272 || uses_template_parms (DECL_TI_ARGS (type
))))
280 /* Returns the template nesting level of the indicated class TYPE.
281 Like template_class_depth_real, but instantiations do not count in
285 template_class_depth (type
)
288 return template_class_depth_real (type
, /*count_specializations=*/0);
291 /* Returns 1 if processing DECL as part of do_pending_inlines
292 needs us to push template parms. */
295 inline_needs_template_parms (decl
)
298 if (! DECL_TEMPLATE_INFO (decl
))
301 return (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (most_general_template (decl
)))
302 > (processing_template_decl
+ DECL_TEMPLATE_SPECIALIZATION (decl
)));
305 /* Subroutine of maybe_begin_member_template_processing.
306 Push the template parms in PARMS, starting from LEVELS steps into the
307 chain, and ending at the beginning, since template parms are listed
311 push_inline_template_parms_recursive (parmlist
, levels
)
315 tree parms
= TREE_VALUE (parmlist
);
319 push_inline_template_parms_recursive (TREE_CHAIN (parmlist
), levels
- 1);
321 ++processing_template_decl
;
322 current_template_parms
323 = tree_cons (size_int (processing_template_decl
),
324 parms
, current_template_parms
);
325 TEMPLATE_PARMS_FOR_INLINE (current_template_parms
) = 1;
328 for (i
= 0; i
< TREE_VEC_LENGTH (parms
); ++i
)
330 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
331 my_friendly_assert (DECL_P (parm
), 0);
333 switch (TREE_CODE (parm
))
342 /* Make a CONST_DECL as is done in process_template_parm.
343 It is ugly that we recreate this here; the original
344 version built in process_template_parm is no longer
346 tree decl
= build_decl (CONST_DECL
, DECL_NAME (parm
),
348 DECL_ARTIFICIAL (decl
) = 1;
349 DECL_INITIAL (decl
) = DECL_INITIAL (parm
);
350 SET_DECL_TEMPLATE_PARM_P (decl
);
356 my_friendly_abort (0);
361 /* Restore the template parameter context for a member template or
362 a friend template defined in a class definition. */
365 maybe_begin_member_template_processing (decl
)
371 if (inline_needs_template_parms (decl
))
373 parms
= DECL_TEMPLATE_PARMS (most_general_template (decl
));
374 levels
= TMPL_PARMS_DEPTH (parms
) - processing_template_decl
;
376 if (DECL_TEMPLATE_SPECIALIZATION (decl
))
379 parms
= TREE_CHAIN (parms
);
382 push_inline_template_parms_recursive (parms
, levels
);
385 /* Remember how many levels of template parameters we pushed so that
386 we can pop them later. */
387 if (!inline_parm_levels
)
388 VARRAY_INT_INIT (inline_parm_levels
, 4, "inline_parm_levels");
389 if (inline_parm_levels_used
== inline_parm_levels
->num_elements
)
390 VARRAY_GROW (inline_parm_levels
, 2 * inline_parm_levels_used
);
391 VARRAY_INT (inline_parm_levels
, inline_parm_levels_used
) = levels
;
392 ++inline_parm_levels_used
;
395 /* Undo the effects of begin_member_template_processing. */
398 maybe_end_member_template_processing ()
402 if (!inline_parm_levels_used
)
405 --inline_parm_levels_used
;
407 i
< VARRAY_INT (inline_parm_levels
, inline_parm_levels_used
);
410 --processing_template_decl
;
411 current_template_parms
= TREE_CHAIN (current_template_parms
);
416 /* Returns non-zero iff T is a member template function. We must be
419 template <class T> class C { void f(); }
421 Here, f is a template function, and a member, but not a member
422 template. This function does not concern itself with the origin of
423 T, only its present state. So if we have
425 template <class T> class C { template <class U> void f(U); }
427 then neither C<int>::f<char> nor C<T>::f<double> is considered
428 to be a member template. But, `template <class U> void
429 C<int>::f(U)' is considered a member template. */
432 is_member_template (t
)
435 if (!DECL_FUNCTION_TEMPLATE_P (t
))
436 /* Anything that isn't a function or a template function is
437 certainly not a member template. */
440 /* A local class can't have member templates. */
441 if (decl_function_context (t
))
444 return (DECL_FUNCTION_MEMBER_P (DECL_TEMPLATE_RESULT (t
))
445 /* If there are more levels of template parameters than
446 there are template classes surrounding the declaration,
447 then we have a member template. */
448 && (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (t
)) >
449 template_class_depth (DECL_CONTEXT (t
))));
453 /* Returns non-zero iff T is a member template class. See
454 is_member_template for a description of what precisely constitutes
455 a member template. */
458 is_member_template_class (t
)
461 if (!DECL_CLASS_TEMPLATE_P (t
))
462 /* Anything that isn't a class template, is certainly not a member
466 if (!DECL_CLASS_SCOPE_P (t
))
467 /* Anything whose context isn't a class type is surely not a
471 /* If there are more levels of template parameters than there are
472 template classes surrounding the declaration, then we have a
474 return (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (t
)) >
475 template_class_depth (DECL_CONTEXT (t
)));
479 /* Return a new template argument vector which contains all of ARGS,
480 but has as its innermost set of arguments the EXTRA_ARGS. */
483 add_to_template_args (args
, extra_args
)
492 extra_depth
= TMPL_ARGS_DEPTH (extra_args
);
493 new_args
= make_tree_vec (TMPL_ARGS_DEPTH (args
) + extra_depth
);
495 for (i
= 1; i
<= TMPL_ARGS_DEPTH (args
); ++i
)
496 SET_TMPL_ARGS_LEVEL (new_args
, i
, TMPL_ARGS_LEVEL (args
, i
));
498 for (j
= 1; j
<= extra_depth
; ++j
, ++i
)
499 SET_TMPL_ARGS_LEVEL (new_args
, i
, TMPL_ARGS_LEVEL (extra_args
, j
));
504 /* Like add_to_template_args, but only the outermost ARGS are added to
505 the EXTRA_ARGS. In particular, all but TMPL_ARGS_DEPTH
506 (EXTRA_ARGS) levels are added. This function is used to combine
507 the template arguments from a partial instantiation with the
508 template arguments used to attain the full instantiation from the
509 partial instantiation. */
512 add_outermost_template_args (args
, extra_args
)
518 /* If there are more levels of EXTRA_ARGS than there are ARGS,
519 something very fishy is going on. */
520 my_friendly_assert (TMPL_ARGS_DEPTH (args
) >= TMPL_ARGS_DEPTH (extra_args
),
523 /* If *all* the new arguments will be the EXTRA_ARGS, just return
525 if (TMPL_ARGS_DEPTH (args
) == TMPL_ARGS_DEPTH (extra_args
))
528 /* For the moment, we make ARGS look like it contains fewer levels. */
529 TREE_VEC_LENGTH (args
) -= TMPL_ARGS_DEPTH (extra_args
);
531 new_args
= add_to_template_args (args
, extra_args
);
533 /* Now, we restore ARGS to its full dimensions. */
534 TREE_VEC_LENGTH (args
) += TMPL_ARGS_DEPTH (extra_args
);
539 /* Return the N levels of innermost template arguments from the ARGS. */
542 get_innermost_template_args (args
, n
)
550 my_friendly_assert (n
>= 0, 20000603);
552 /* If N is 1, just return the innermost set of template arguments. */
554 return TMPL_ARGS_LEVEL (args
, TMPL_ARGS_DEPTH (args
));
556 /* If we're not removing anything, just return the arguments we were
558 extra_levels
= TMPL_ARGS_DEPTH (args
) - n
;
559 my_friendly_assert (extra_levels
>= 0, 20000603);
560 if (extra_levels
== 0)
563 /* Make a new set of arguments, not containing the outer arguments. */
564 new_args
= make_tree_vec (n
);
565 for (i
= 1; i
<= n
; ++i
)
566 SET_TMPL_ARGS_LEVEL (new_args
, i
,
567 TMPL_ARGS_LEVEL (args
, i
+ extra_levels
));
572 /* We've got a template header coming up; push to a new level for storing
576 begin_template_parm_list ()
578 /* We use a non-tag-transparent scope here, which causes pushtag to
579 put tags in this scope, rather than in the enclosing class or
580 namespace scope. This is the right thing, since we want
581 TEMPLATE_DECLS, and not TYPE_DECLS for template classes. For a
582 global template class, push_template_decl handles putting the
583 TEMPLATE_DECL into top-level scope. For a nested template class,
586 template <class T> struct S1 {
587 template <class T> struct S2 {};
590 pushtag contains special code to call pushdecl_with_scope on the
591 TEMPLATE_DECL for S2. */
592 begin_scope (sk_template_parms
);
593 ++processing_template_decl
;
594 ++processing_template_parmlist
;
595 note_template_header (0);
598 /* This routine is called when a specialization is declared. If it is
599 illegal to declare a specialization here, an error is reported. */
602 check_specialization_scope ()
604 tree scope
= current_scope ();
608 An explicit specialization shall be declared in the namespace of
609 which the template is a member, or, for member templates, in the
610 namespace of which the enclosing class or enclosing class
611 template is a member. An explicit specialization of a member
612 function, member class or static data member of a class template
613 shall be declared in the namespace of which the class template
615 if (scope
&& TREE_CODE (scope
) != NAMESPACE_DECL
)
616 cp_error ("explicit specialization in non-namespace scope `%D'",
621 In an explicit specialization declaration for a member of a class
622 template or a member template that appears in namespace scope,
623 the member template and some of its enclosing class templates may
624 remain unspecialized, except that the declaration shall not
625 explicitly specialize a class member template if its enclosing
626 class templates are not explicitly specialized as well. */
627 if (current_template_parms
)
628 cp_error ("enclosing class templates are not explicitly specialized");
631 /* We've just seen template <>. */
634 begin_specialization ()
636 begin_scope (sk_template_spec
);
637 note_template_header (1);
638 check_specialization_scope ();
641 /* Called at then end of processing a declaration preceded by
645 end_specialization ()
648 reset_specialization ();
651 /* Any template <>'s that we have seen thus far are not referring to a
652 function specialization. */
655 reset_specialization ()
657 processing_specialization
= 0;
658 template_header_count
= 0;
661 /* We've just seen a template header. If SPECIALIZATION is non-zero,
662 it was of the form template <>. */
665 note_template_header (specialization
)
668 processing_specialization
= specialization
;
669 template_header_count
++;
672 /* We're beginning an explicit instantiation. */
675 begin_explicit_instantiation ()
677 ++processing_explicit_instantiation
;
682 end_explicit_instantiation ()
684 my_friendly_assert(processing_explicit_instantiation
> 0, 0);
685 --processing_explicit_instantiation
;
688 /* The TYPE is being declared. If it is a template type, that means it
689 is a partial specialization. Do appropriate error-checking. */
692 maybe_process_partial_specialization (type
)
695 if (IS_AGGR_TYPE (type
) && CLASSTYPE_USE_TEMPLATE (type
))
697 if (CLASSTYPE_IMPLICIT_INSTANTIATION (type
)
698 && !COMPLETE_TYPE_P (type
))
700 if (current_namespace
701 != decl_namespace_context (CLASSTYPE_TI_TEMPLATE (type
)))
703 cp_pedwarn ("specializing `%#T' in different namespace", type
);
704 cp_pedwarn_at (" from definition of `%#D'",
705 CLASSTYPE_TI_TEMPLATE (type
));
707 SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (type
);
708 if (processing_template_decl
)
709 push_template_decl (TYPE_MAIN_DECL (type
));
711 else if (CLASSTYPE_TEMPLATE_INSTANTIATION (type
))
712 cp_error ("specialization of `%T' after instantiation", type
);
714 else if (processing_specialization
)
715 cp_error ("explicit specialization of non-template `%T'", type
);
718 /* Retrieve the specialization (in the sense of [temp.spec] - a
719 specialization is either an instantiation or an explicit
720 specialization) of TMPL for the given template ARGS. If there is
721 no such specialization, return NULL_TREE. The ARGS are a vector of
722 arguments, or a vector of vectors of arguments, in the case of
723 templates with more than one level of parameters. */
726 retrieve_specialization (tmpl
, args
)
732 my_friendly_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
, 0);
734 /* There should be as many levels of arguments as there are
735 levels of parameters. */
736 my_friendly_assert (TMPL_ARGS_DEPTH (args
)
737 == TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
)),
740 for (s
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
743 if (comp_template_args (TREE_PURPOSE (s
), args
))
744 return TREE_VALUE (s
);
749 /* Like retrieve_specialization, but for local declarations. */
752 retrieve_local_specialization (tmpl
)
755 return (tree
) htab_find (local_specializations
, tmpl
);
758 /* Returns non-zero iff DECL is a specialization of TMPL. */
761 is_specialization_of (decl
, tmpl
)
767 if (TREE_CODE (decl
) == FUNCTION_DECL
)
771 t
= DECL_TEMPLATE_INFO (t
) ? DECL_TI_TEMPLATE (t
) : NULL_TREE
)
777 my_friendly_assert (TREE_CODE (decl
) == TYPE_DECL
, 0);
779 for (t
= TREE_TYPE (decl
);
781 t
= CLASSTYPE_USE_TEMPLATE (t
)
782 ? TREE_TYPE (CLASSTYPE_TI_TEMPLATE (t
)) : NULL_TREE
)
783 if (same_type_ignoring_top_level_qualifiers_p (t
, TREE_TYPE (tmpl
)))
790 /* Register the specialization SPEC as a specialization of TMPL with
791 the indicated ARGS. Returns SPEC, or an equivalent prior
792 declaration, if available. */
795 register_specialization (spec
, tmpl
, args
)
802 my_friendly_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
, 0);
804 if (TREE_CODE (spec
) == FUNCTION_DECL
805 && uses_template_parms (DECL_TI_ARGS (spec
)))
806 /* This is the FUNCTION_DECL for a partial instantiation. Don't
807 register it; we want the corresponding TEMPLATE_DECL instead.
808 We use `uses_template_parms (DECL_TI_ARGS (spec))' rather than
809 the more obvious `uses_template_parms (spec)' to avoid problems
810 with default function arguments. In particular, given
813 template <class T> void f(T t1, T t = T())
815 the default argument expression is not substituted for in an
816 instantiation unless and until it is actually needed. */
819 /* There should be as many levels of arguments as there are
820 levels of parameters. */
821 my_friendly_assert (TMPL_ARGS_DEPTH (args
)
822 == TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
)),
825 for (s
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
829 tree fn
= TREE_VALUE (s
);
831 /* We can sometimes try to re-register a specialization that we've
832 already got. In particular, regenerate_decl_from_template
833 calls duplicate_decls which will update the specialization
834 list. But, we'll still get called again here anyhow. It's
835 more convenient to simply allow this than to try to prevent it. */
838 else if (comp_template_args (TREE_PURPOSE (s
), args
))
840 if (DECL_TEMPLATE_SPECIALIZATION (spec
))
842 if (DECL_TEMPLATE_INSTANTIATION (fn
))
845 || DECL_EXPLICIT_INSTANTIATION (fn
))
847 cp_error ("specialization of %D after instantiation",
853 /* This situation should occur only if the first
854 specialization is an implicit instantiation,
855 the second is an explicit specialization, and
856 the implicit instantiation has not yet been
857 used. That situation can occur if we have
858 implicitly instantiated a member function and
859 then specialized it later.
861 We can also wind up here if a friend
862 declaration that looked like an instantiation
863 turns out to be a specialization:
865 template <class T> void foo(T);
866 class S { friend void foo<>(int) };
867 template <> void foo(int);
869 We transform the existing DECL in place so that
870 any pointers to it become pointers to the
873 If there was a definition for the template, but
874 not for the specialization, we want this to
875 look as if there is no definition, and vice
877 DECL_INITIAL (fn
) = NULL_TREE
;
878 duplicate_decls (spec
, fn
);
883 else if (DECL_TEMPLATE_SPECIALIZATION (fn
))
885 duplicate_decls (spec
, fn
);
892 DECL_TEMPLATE_SPECIALIZATIONS (tmpl
)
893 = tree_cons (args
, spec
, DECL_TEMPLATE_SPECIALIZATIONS (tmpl
));
898 /* Unregister the specialization SPEC as a specialization of TMPL.
899 Returns nonzero if the SPEC was listed as a specialization of
903 unregister_specialization (spec
, tmpl
)
909 for (s
= &DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
911 s
= &TREE_CHAIN (*s
))
912 if (TREE_VALUE (*s
) == spec
)
914 *s
= TREE_CHAIN (*s
);
921 /* Like register_specialization, but for local declarations. We are
922 registering SPEC, an instantiation of TMPL. */
925 register_local_specialization (spec
, tmpl
)
931 slot
= htab_find_slot (local_specializations
, tmpl
, INSERT
);
935 /* Print the list of candidate FNS in an error message. */
938 print_candidates (fns
)
943 const char *str
= "candidates are:";
945 for (fn
= fns
; fn
!= NULL_TREE
; fn
= TREE_CHAIN (fn
))
949 for (f
= TREE_VALUE (fn
); f
; f
= OVL_NEXT (f
))
950 cp_error_at ("%s %+#D", str
, OVL_CURRENT (f
));
955 /* Returns the template (one of the functions given by TEMPLATE_ID)
956 which can be specialized to match the indicated DECL with the
957 explicit template args given in TEMPLATE_ID. The DECL may be
958 NULL_TREE if none is available. In that case, the functions in
959 TEMPLATE_ID are non-members.
961 If NEED_MEMBER_TEMPLATE is non-zero the function is known to be a
962 specialization of a member template.
964 The template args (those explicitly specified and those deduced)
965 are output in a newly created vector *TARGS_OUT.
967 If it is impossible to determine the result, an error message is
968 issued. The error_mark_node is returned to indicate failure. */
971 determine_specialization (template_id
, decl
, targs_out
,
972 need_member_template
)
976 int need_member_template
;
981 tree candidates
= NULL_TREE
;
982 tree templates
= NULL_TREE
;
984 *targs_out
= NULL_TREE
;
986 if (template_id
== error_mark_node
)
987 return error_mark_node
;
989 fns
= TREE_OPERAND (template_id
, 0);
990 explicit_targs
= TREE_OPERAND (template_id
, 1);
992 if (fns
== error_mark_node
)
993 return error_mark_node
;
995 /* Check for baselinks. */
996 if (BASELINK_P (fns
))
997 fns
= TREE_VALUE (fns
);
999 if (!is_overloaded_fn (fns
))
1001 cp_error ("`%D' is not a function template", fns
);
1002 return error_mark_node
;
1005 for (; fns
; fns
= OVL_NEXT (fns
))
1009 tree fn
= OVL_CURRENT (fns
);
1011 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
1012 /* DECL might be a specialization of FN. */
1014 else if (need_member_template
)
1015 /* FN is an ordinary member function, and we need a
1016 specialization of a member template. */
1018 else if (TREE_CODE (fn
) != FUNCTION_DECL
)
1019 /* We can get IDENTIFIER_NODEs here in certain erroneous
1022 else if (!DECL_FUNCTION_MEMBER_P (fn
))
1023 /* This is just an ordinary non-member function. Nothing can
1024 be a specialization of that. */
1026 else if (DECL_ARTIFICIAL (fn
))
1027 /* Cannot specialize functions that are created implicitly. */
1031 tree decl_arg_types
;
1033 /* This is an ordinary member function. However, since
1034 we're here, we can assume it's enclosing class is a
1035 template class. For example,
1037 template <typename T> struct S { void f(); };
1038 template <> void S<int>::f() {}
1040 Here, S<int>::f is a non-template, but S<int> is a
1041 template class. If FN has the same type as DECL, we
1042 might be in business. */
1044 if (!DECL_TEMPLATE_INFO (fn
))
1045 /* Its enclosing class is an explicit specialization
1046 of a template class. This is not a candidate. */
1049 if (!same_type_p (TREE_TYPE (TREE_TYPE (decl
)),
1050 TREE_TYPE (TREE_TYPE (fn
))))
1051 /* The return types differ. */
1054 /* Adjust the type of DECL in case FN is a static member. */
1055 decl_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
1056 if (DECL_STATIC_FUNCTION_P (fn
)
1057 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
1058 decl_arg_types
= TREE_CHAIN (decl_arg_types
);
1060 if (compparms (TYPE_ARG_TYPES (TREE_TYPE (fn
)),
1063 candidates
= tree_cons (NULL_TREE
, fn
, candidates
);
1068 /* See whether this function might be a specialization of this
1070 targs
= get_bindings (tmpl
, decl
, explicit_targs
);
1073 /* We cannot deduce template arguments that when used to
1074 specialize TMPL will produce DECL. */
1077 /* Save this template, and the arguments deduced. */
1078 templates
= tree_cons (targs
, tmpl
, templates
);
1081 if (templates
&& TREE_CHAIN (templates
))
1087 It is possible for a specialization with a given function
1088 signature to be instantiated from more than one function
1089 template. In such cases, explicit specification of the
1090 template arguments must be used to uniquely identify the
1091 function template specialization being specialized.
1093 Note that here, there's no suggestion that we're supposed to
1094 determine which of the candidate templates is most
1095 specialized. However, we, also have:
1099 Partial ordering of overloaded function template
1100 declarations is used in the following contexts to select
1101 the function template to which a function template
1102 specialization refers:
1104 -- when an explicit specialization refers to a function
1107 So, we do use the partial ordering rules, at least for now.
1108 This extension can only serve to make illegal programs legal,
1109 so it's safe. And, there is strong anecdotal evidence that
1110 the committee intended the partial ordering rules to apply;
1111 the EDG front-end has that behavior, and John Spicer claims
1112 that the committee simply forgot to delete the wording in
1113 [temp.expl.spec]. */
1114 tree tmpl
= most_specialized (templates
, decl
, explicit_targs
);
1115 if (tmpl
&& tmpl
!= error_mark_node
)
1117 targs
= get_bindings (tmpl
, decl
, explicit_targs
);
1118 templates
= tree_cons (targs
, tmpl
, NULL_TREE
);
1122 if (templates
== NULL_TREE
&& candidates
== NULL_TREE
)
1124 cp_error_at ("template-id `%D' for `%+D' does not match any template declaration",
1126 return error_mark_node
;
1128 else if ((templates
&& TREE_CHAIN (templates
))
1129 || (candidates
&& TREE_CHAIN (candidates
))
1130 || (templates
&& candidates
))
1132 cp_error_at ("ambiguous template specialization `%D' for `%+D'",
1134 chainon (candidates
, templates
);
1135 print_candidates (candidates
);
1136 return error_mark_node
;
1139 /* We have one, and exactly one, match. */
1142 /* It was a specialization of an ordinary member function in a
1144 *targs_out
= copy_node (DECL_TI_ARGS (TREE_VALUE (candidates
)));
1145 return DECL_TI_TEMPLATE (TREE_VALUE (candidates
));
1148 /* It was a specialization of a template. */
1149 targs
= DECL_TI_ARGS (DECL_TEMPLATE_RESULT (TREE_VALUE (templates
)));
1150 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (targs
))
1152 *targs_out
= copy_node (targs
);
1153 SET_TMPL_ARGS_LEVEL (*targs_out
,
1154 TMPL_ARGS_DEPTH (*targs_out
),
1155 TREE_PURPOSE (templates
));
1158 *targs_out
= TREE_PURPOSE (templates
);
1159 return TREE_VALUE (templates
);
1162 /* Returns a chain of parameter types, exactly like the SPEC_TYPES,
1163 but with the default argument values filled in from those in the
1167 copy_default_args_to_explicit_spec_1 (spec_types
,
1172 tree new_spec_types
;
1177 if (spec_types
== void_list_node
)
1178 return void_list_node
;
1180 /* Substitute into the rest of the list. */
1182 copy_default_args_to_explicit_spec_1 (TREE_CHAIN (spec_types
),
1183 TREE_CHAIN (tmpl_types
));
1185 /* Add the default argument for this parameter. */
1186 return hash_tree_cons (TREE_PURPOSE (tmpl_types
),
1187 TREE_VALUE (spec_types
),
1191 /* DECL is an explicit specialization. Replicate default arguments
1192 from the template it specializes. (That way, code like:
1194 template <class T> void f(T = 3);
1195 template <> void f(double);
1198 works, as required.) An alternative approach would be to look up
1199 the correct default arguments at the call-site, but this approach
1200 is consistent with how implicit instantiations are handled. */
1203 copy_default_args_to_explicit_spec (decl
)
1209 tree new_spec_types
;
1213 tree object_type
= NULL_TREE
;
1214 tree in_charge
= NULL_TREE
;
1215 tree vtt
= NULL_TREE
;
1217 /* See if there's anything we need to do. */
1218 tmpl
= DECL_TI_TEMPLATE (decl
);
1219 tmpl_types
= TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (tmpl
)));
1220 for (t
= tmpl_types
; t
; t
= TREE_CHAIN (t
))
1221 if (TREE_PURPOSE (t
))
1226 old_type
= TREE_TYPE (decl
);
1227 spec_types
= TYPE_ARG_TYPES (old_type
);
1229 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
1231 /* Remove the this pointer, but remember the object's type for
1233 object_type
= TREE_TYPE (TREE_VALUE (spec_types
));
1234 spec_types
= TREE_CHAIN (spec_types
);
1235 tmpl_types
= TREE_CHAIN (tmpl_types
);
1237 if (DECL_HAS_IN_CHARGE_PARM_P (decl
))
1239 /* DECL may contain more parameters than TMPL due to the extra
1240 in-charge parameter in constructors and destructors. */
1241 in_charge
= spec_types
;
1242 spec_types
= TREE_CHAIN (spec_types
);
1244 if (DECL_HAS_VTT_PARM_P (decl
))
1247 spec_types
= TREE_CHAIN (spec_types
);
1251 /* Compute the merged default arguments. */
1253 copy_default_args_to_explicit_spec_1 (spec_types
, tmpl_types
);
1255 /* Compute the new FUNCTION_TYPE. */
1259 new_spec_types
= hash_tree_cons (TREE_PURPOSE (vtt
),
1264 /* Put the in-charge parameter back. */
1265 new_spec_types
= hash_tree_cons (TREE_PURPOSE (in_charge
),
1266 TREE_VALUE (in_charge
),
1269 new_type
= build_cplus_method_type (object_type
,
1270 TREE_TYPE (old_type
),
1274 new_type
= build_function_type (TREE_TYPE (old_type
),
1276 new_type
= build_type_attribute_variant (new_type
,
1277 TYPE_ATTRIBUTES (old_type
));
1278 new_type
= build_exception_variant (new_type
,
1279 TYPE_RAISES_EXCEPTIONS (old_type
));
1280 TREE_TYPE (decl
) = new_type
;
1283 /* Check to see if the function just declared, as indicated in
1284 DECLARATOR, and in DECL, is a specialization of a function
1285 template. We may also discover that the declaration is an explicit
1286 instantiation at this point.
1288 Returns DECL, or an equivalent declaration that should be used
1289 instead if all goes well. Issues an error message if something is
1290 amiss. Returns error_mark_node if the error is not easily
1293 FLAGS is a bitmask consisting of the following flags:
1295 2: The function has a definition.
1296 4: The function is a friend.
1298 The TEMPLATE_COUNT is the number of references to qualifying
1299 template classes that appeared in the name of the function. For
1302 template <class T> struct S { void f(); };
1305 the TEMPLATE_COUNT would be 1. However, explicitly specialized
1306 classes are not counted in the TEMPLATE_COUNT, so that in
1308 template <class T> struct S {};
1309 template <> struct S<int> { void f(); }
1310 template <> void S<int>::f();
1312 the TEMPLATE_COUNT would be 0. (Note that this declaration is
1313 illegal; there should be no template <>.)
1315 If the function is a specialization, it is marked as such via
1316 DECL_TEMPLATE_SPECIALIZATION. Furthermore, its DECL_TEMPLATE_INFO
1317 is set up correctly, and it is added to the list of specializations
1318 for that template. */
1321 check_explicit_specialization (declarator
, decl
, template_count
, flags
)
1327 int have_def
= flags
& 2;
1328 int is_friend
= flags
& 4;
1329 int specialization
= 0;
1330 int explicit_instantiation
= 0;
1331 int member_specialization
= 0;
1332 tree ctype
= DECL_CLASS_CONTEXT (decl
);
1333 tree dname
= DECL_NAME (decl
);
1336 tsk
= current_tmpl_spec_kind (template_count
);
1341 if (processing_specialization
)
1344 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
1346 else if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
1349 /* This could be something like:
1351 template <class T> void f(T);
1352 class S { friend void f<>(int); } */
1356 /* This case handles bogus declarations like template <>
1357 template <class T> void f<int>(); */
1359 cp_error ("template-id `%D' in declaration of primary template",
1366 case tsk_invalid_member_spec
:
1367 /* The error has already been reported in
1368 check_specialization_scope. */
1369 return error_mark_node
;
1371 case tsk_invalid_expl_inst
:
1372 cp_error ("template parameter list used in explicit instantiation");
1378 cp_error ("definition provided for explicit instantiation");
1380 explicit_instantiation
= 1;
1383 case tsk_excessive_parms
:
1384 cp_error ("too many template parameter lists in declaration of `%D'",
1386 return error_mark_node
;
1390 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
1392 member_specialization
= 1;
1397 case tsk_insufficient_parms
:
1398 if (template_header_count
)
1400 cp_error("too few template parameter lists in declaration of `%D'",
1404 else if (ctype
!= NULL_TREE
1405 && !TYPE_BEING_DEFINED (ctype
)
1406 && CLASSTYPE_TEMPLATE_INSTANTIATION (ctype
)
1409 /* For backwards compatibility, we accept:
1411 template <class T> struct S { void f(); };
1412 void S<int>::f() {} // Missing template <>
1414 That used to be legal C++. */
1417 ("explicit specialization not preceded by `template <>'");
1419 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
1424 if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
1426 /* This case handles bogus declarations like template <>
1427 template <class T> void f<int>(); */
1429 if (uses_template_parms (declarator
))
1430 cp_error ("partial specialization `%D' of function template",
1433 cp_error ("template-id `%D' in declaration of primary template",
1438 if (ctype
&& CLASSTYPE_TEMPLATE_INSTANTIATION (ctype
))
1439 /* This is a specialization of a member template, without
1440 specialization the containing class. Something like:
1442 template <class T> struct S {
1443 template <class U> void f (U);
1445 template <> template <class U> void S<int>::f(U) {}
1447 That's a specialization -- but of the entire template. */
1452 my_friendly_abort (20000309);
1455 if (specialization
|| member_specialization
)
1457 tree t
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
1458 for (; t
; t
= TREE_CHAIN (t
))
1459 if (TREE_PURPOSE (t
))
1462 ("default argument specified in explicit specialization");
1465 if (current_lang_name
== lang_name_c
)
1466 cp_error ("template specialization with C linkage");
1469 if (specialization
|| member_specialization
|| explicit_instantiation
)
1471 tree tmpl
= NULL_TREE
;
1472 tree targs
= NULL_TREE
;
1474 /* Make sure that the declarator is a TEMPLATE_ID_EXPR. */
1475 if (TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
1479 my_friendly_assert (TREE_CODE (declarator
) == IDENTIFIER_NODE
,
1482 fns
= IDENTIFIER_NAMESPACE_VALUE (dname
);
1487 lookup_template_function (fns
, NULL_TREE
);
1490 if (declarator
== error_mark_node
)
1491 return error_mark_node
;
1493 if (ctype
!= NULL_TREE
&& TYPE_BEING_DEFINED (ctype
))
1495 if (!explicit_instantiation
)
1496 /* A specialization in class scope. This is illegal,
1497 but the error will already have been flagged by
1498 check_specialization_scope. */
1499 return error_mark_node
;
1502 /* It's not legal to write an explicit instantiation in
1505 class C { template void f(); }
1507 This case is caught by the parser. However, on
1510 template class C { void f(); };
1512 (which is illegal) we can get here. The error will be
1519 else if (TREE_CODE (TREE_OPERAND (declarator
, 0)) == LOOKUP_EXPR
)
1521 /* A friend declaration. We can't do much, because we don't
1522 know what this resolves to, yet. */
1523 my_friendly_assert (is_friend
!= 0, 0);
1524 my_friendly_assert (!explicit_instantiation
, 0);
1525 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
1528 else if (ctype
!= NULL_TREE
1529 && (TREE_CODE (TREE_OPERAND (declarator
, 0)) ==
1532 /* Find the list of functions in ctype that have the same
1533 name as the declared function. */
1534 tree name
= TREE_OPERAND (declarator
, 0);
1535 tree fns
= NULL_TREE
;
1538 if (name
== constructor_name (ctype
)
1539 || name
== constructor_name_full (ctype
))
1541 int is_constructor
= DECL_CONSTRUCTOR_P (decl
);
1543 if (is_constructor
? !TYPE_HAS_CONSTRUCTOR (ctype
)
1544 : !TYPE_HAS_DESTRUCTOR (ctype
))
1546 /* From [temp.expl.spec]:
1548 If such an explicit specialization for the member
1549 of a class template names an implicitly-declared
1550 special member function (clause _special_), the
1551 program is ill-formed.
1553 Similar language is found in [temp.explicit]. */
1554 cp_error ("specialization of implicitly-declared special member function");
1555 return error_mark_node
;
1558 name
= is_constructor
? ctor_identifier
: dtor_identifier
;
1561 if (!DECL_CONV_FN_P (decl
))
1563 idx
= lookup_fnfields_1 (ctype
, name
);
1565 fns
= TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (ctype
), idx
);
1571 /* For a type-conversion operator, we cannot do a
1572 name-based lookup. We might be looking for `operator
1573 int' which will be a specialization of `operator T'.
1574 So, we find *all* the conversion operators, and then
1575 select from them. */
1578 methods
= CLASSTYPE_METHOD_VEC (ctype
);
1580 for (idx
= 2; idx
< TREE_VEC_LENGTH (methods
); ++idx
)
1582 tree ovl
= TREE_VEC_ELT (methods
, idx
);
1584 if (!ovl
|| !DECL_CONV_FN_P (OVL_CURRENT (ovl
)))
1585 /* There are no more conversion functions. */
1588 /* Glue all these conversion functions together
1589 with those we already have. */
1590 for (; ovl
; ovl
= OVL_NEXT (ovl
))
1591 fns
= ovl_cons (OVL_CURRENT (ovl
), fns
);
1595 if (fns
== NULL_TREE
)
1597 cp_error ("no member function `%D' declared in `%T'",
1599 return error_mark_node
;
1602 TREE_OPERAND (declarator
, 0) = fns
;
1605 /* Figure out what exactly is being specialized at this point.
1606 Note that for an explicit instantiation, even one for a
1607 member function, we cannot tell apriori whether the
1608 instantiation is for a member template, or just a member
1609 function of a template class. Even if a member template is
1610 being instantiated, the member template arguments may be
1611 elided if they can be deduced from the rest of the
1613 tmpl
= determine_specialization (declarator
, decl
,
1615 member_specialization
);
1617 if (!tmpl
|| tmpl
== error_mark_node
)
1618 /* We couldn't figure out what this declaration was
1620 return error_mark_node
;
1623 tree gen_tmpl
= most_general_template (tmpl
);
1625 if (explicit_instantiation
)
1627 /* We don't set DECL_EXPLICIT_INSTANTIATION here; that
1628 is done by do_decl_instantiation later. */
1630 int arg_depth
= TMPL_ARGS_DEPTH (targs
);
1631 int parm_depth
= TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
));
1633 if (arg_depth
> parm_depth
)
1635 /* If TMPL is not the most general template (for
1636 example, if TMPL is a friend template that is
1637 injected into namespace scope), then there will
1638 be too many levels of TARGS. Remove some of them
1643 new_targs
= make_tree_vec (parm_depth
);
1644 for (i
= arg_depth
- parm_depth
; i
< arg_depth
; ++i
)
1645 TREE_VEC_ELT (new_targs
, i
- (arg_depth
- parm_depth
))
1646 = TREE_VEC_ELT (targs
, i
);
1650 return instantiate_template (tmpl
, targs
);
1653 /* If this is a specialization of a member template of a
1654 template class. In we want to return the TEMPLATE_DECL,
1655 not the specialization of it. */
1656 if (tsk
== tsk_template
)
1658 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
1659 DECL_INITIAL (DECL_TEMPLATE_RESULT (tmpl
)) = NULL_TREE
;
1663 /* If we thought that the DECL was a member function, but it
1664 turns out to be specializing a static member function,
1665 make DECL a static member function as well. */
1666 if (DECL_STATIC_FUNCTION_P (tmpl
)
1667 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
1669 revert_static_member_fn (decl
);
1670 last_function_parms
= TREE_CHAIN (last_function_parms
);
1673 /* Set up the DECL_TEMPLATE_INFO for DECL. */
1674 DECL_TEMPLATE_INFO (decl
) = tree_cons (tmpl
, targs
, NULL_TREE
);
1676 /* Inherit default function arguments from the template
1677 DECL is specializing. */
1678 copy_default_args_to_explicit_spec (decl
);
1680 /* This specialization has the same protection as the
1681 template it specializes. */
1682 TREE_PRIVATE (decl
) = TREE_PRIVATE (gen_tmpl
);
1683 TREE_PROTECTED (decl
) = TREE_PROTECTED (gen_tmpl
);
1685 if (is_friend
&& !have_def
)
1686 /* This is not really a declaration of a specialization.
1687 It's just the name of an instantiation. But, it's not
1688 a request for an instantiation, either. */
1689 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
1690 else if (DECL_CONSTRUCTOR_P (decl
) || DECL_DESTRUCTOR_P (decl
))
1691 /* This is indeed a specialization. In case of constructors
1692 and destructors, we need in-charge and not-in-charge
1693 versions in V3 ABI. */
1694 clone_function_decl (decl
, /*update_method_vec_p=*/0);
1696 /* Register this specialization so that we can find it
1698 decl
= register_specialization (decl
, gen_tmpl
, targs
);
1705 /* TYPE is being declared. Verify that the use of template headers
1706 and such is reasonable. Issue error messages if not. */
1709 maybe_check_template_type (type
)
1712 if (template_header_count
)
1714 /* We are in the scope of some `template <...>' header. */
1717 = template_class_depth_real (TYPE_CONTEXT (type
),
1718 /*count_specializations=*/1);
1720 if (template_header_count
<= context_depth
)
1721 /* This is OK; the template headers are for the context. We
1722 are actually too lenient here; like
1723 check_explicit_specialization we should consider the number
1724 of template types included in the actual declaration. For
1727 template <class T> struct S {
1728 template <class U> template <class V>
1734 template <class T> struct S {
1735 template <class U> struct I;
1738 template <class T> template <class U.
1743 else if (template_header_count
> context_depth
+ 1)
1744 /* There are two many template parameter lists. */
1745 cp_error ("too many template parameter lists in declaration of `%T'", type
);
1749 /* Returns 1 iff PARMS1 and PARMS2 are identical sets of template
1750 parameters. These are represented in the same format used for
1751 DECL_TEMPLATE_PARMS. */
1753 int comp_template_parms (parms1
, parms2
)
1760 if (parms1
== parms2
)
1763 for (p1
= parms1
, p2
= parms2
;
1764 p1
!= NULL_TREE
&& p2
!= NULL_TREE
;
1765 p1
= TREE_CHAIN (p1
), p2
= TREE_CHAIN (p2
))
1767 tree t1
= TREE_VALUE (p1
);
1768 tree t2
= TREE_VALUE (p2
);
1771 my_friendly_assert (TREE_CODE (t1
) == TREE_VEC
, 0);
1772 my_friendly_assert (TREE_CODE (t2
) == TREE_VEC
, 0);
1774 if (TREE_VEC_LENGTH (t1
) != TREE_VEC_LENGTH (t2
))
1777 for (i
= 0; i
< TREE_VEC_LENGTH (t2
); ++i
)
1779 tree parm1
= TREE_VALUE (TREE_VEC_ELT (t1
, i
));
1780 tree parm2
= TREE_VALUE (TREE_VEC_ELT (t2
, i
));
1782 if (TREE_CODE (parm1
) != TREE_CODE (parm2
))
1785 if (TREE_CODE (parm1
) == TEMPLATE_TYPE_PARM
)
1787 else if (!same_type_p (TREE_TYPE (parm1
), TREE_TYPE (parm2
)))
1792 if ((p1
!= NULL_TREE
) != (p2
!= NULL_TREE
))
1793 /* One set of parameters has more parameters lists than the
1800 /* Complain if DECL shadows a template parameter.
1802 [temp.local]: A template-parameter shall not be redeclared within its
1803 scope (including nested scopes). */
1806 check_template_shadow (decl
)
1811 /* If we're not in a template, we can't possibly shadow a template
1813 if (!current_template_parms
)
1816 /* Figure out what we're shadowing. */
1817 if (TREE_CODE (decl
) == OVERLOAD
)
1818 decl
= OVL_CURRENT (decl
);
1819 olddecl
= IDENTIFIER_VALUE (DECL_NAME (decl
));
1821 /* If there's no previous binding for this name, we're not shadowing
1822 anything, let alone a template parameter. */
1826 /* If we're not shadowing a template parameter, we're done. Note
1827 that OLDDECL might be an OVERLOAD (or perhaps even an
1828 ERROR_MARK), so we can't just blithely assume it to be a _DECL
1830 if (!DECL_P (olddecl
) || !DECL_TEMPLATE_PARM_P (olddecl
))
1833 /* We check for decl != olddecl to avoid bogus errors for using a
1834 name inside a class. We check TPFI to avoid duplicate errors for
1835 inline member templates. */
1837 || TEMPLATE_PARMS_FOR_INLINE (current_template_parms
))
1840 cp_error_at ("declaration of `%#D'", decl
);
1841 cp_error_at (" shadows template parm `%#D'", olddecl
);
1844 /* Return a new TEMPLATE_PARM_INDEX with the indicated INDEX, LEVEL,
1845 ORIG_LEVEL, DECL, and TYPE. */
1848 build_template_parm_index (index
, level
, orig_level
, decl
, type
)
1855 tree t
= make_node (TEMPLATE_PARM_INDEX
);
1856 TEMPLATE_PARM_IDX (t
) = index
;
1857 TEMPLATE_PARM_LEVEL (t
) = level
;
1858 TEMPLATE_PARM_ORIG_LEVEL (t
) = orig_level
;
1859 TEMPLATE_PARM_DECL (t
) = decl
;
1860 TREE_TYPE (t
) = type
;
1865 /* Return a TEMPLATE_PARM_INDEX, similar to INDEX, but whose
1866 TEMPLATE_PARM_LEVEL has been decreased by LEVELS. If such a
1867 TEMPLATE_PARM_INDEX already exists, it is returned; otherwise, a
1868 new one is created. */
1871 reduce_template_parm_level (index
, type
, levels
)
1876 if (TEMPLATE_PARM_DESCENDANTS (index
) == NULL_TREE
1877 || (TEMPLATE_PARM_LEVEL (TEMPLATE_PARM_DESCENDANTS (index
))
1878 != TEMPLATE_PARM_LEVEL (index
) - levels
))
1881 = build_decl (TREE_CODE (TEMPLATE_PARM_DECL (index
)),
1882 DECL_NAME (TEMPLATE_PARM_DECL (index
)),
1885 = build_template_parm_index (TEMPLATE_PARM_IDX (index
),
1886 TEMPLATE_PARM_LEVEL (index
) - levels
,
1887 TEMPLATE_PARM_ORIG_LEVEL (index
),
1889 TEMPLATE_PARM_DESCENDANTS (index
) = t
;
1891 DECL_ARTIFICIAL (decl
) = 1;
1892 SET_DECL_TEMPLATE_PARM_P (decl
);
1894 /* Template template parameters need this. */
1895 DECL_TEMPLATE_PARMS (decl
)
1896 = DECL_TEMPLATE_PARMS (TEMPLATE_PARM_DECL (index
));
1899 return TEMPLATE_PARM_DESCENDANTS (index
);
1902 /* Process information from new template parameter NEXT and append it to the
1903 LIST being built. */
1906 process_template_parm (list
, next
)
1915 my_friendly_assert (TREE_CODE (parm
) == TREE_LIST
, 259);
1916 defval
= TREE_PURPOSE (parm
);
1917 parm
= TREE_VALUE (parm
);
1918 is_type
= TREE_PURPOSE (parm
) == class_type_node
;
1922 tree p
= TREE_VALUE (tree_last (list
));
1924 if (TREE_CODE (p
) == TYPE_DECL
|| TREE_CODE (p
) == TEMPLATE_DECL
)
1925 idx
= TEMPLATE_TYPE_IDX (TREE_TYPE (p
));
1927 idx
= TEMPLATE_PARM_IDX (DECL_INITIAL (p
));
1935 my_friendly_assert (TREE_CODE (TREE_PURPOSE (parm
)) == TREE_LIST
, 260);
1936 /* is a const-param */
1937 parm
= grokdeclarator (TREE_VALUE (parm
), TREE_PURPOSE (parm
),
1942 The top-level cv-qualifiers on the template-parameter are
1943 ignored when determining its type. */
1944 TREE_TYPE (parm
) = TYPE_MAIN_VARIANT (TREE_TYPE (parm
));
1946 /* A template parameter is not modifiable. */
1947 TREE_READONLY (parm
) = 1;
1948 if (invalid_nontype_parm_type_p (TREE_TYPE (parm
), 1))
1949 TREE_TYPE (parm
) = void_type_node
;
1950 decl
= build_decl (CONST_DECL
, DECL_NAME (parm
), TREE_TYPE (parm
));
1951 DECL_INITIAL (parm
) = DECL_INITIAL (decl
)
1952 = build_template_parm_index (idx
, processing_template_decl
,
1953 processing_template_decl
,
1954 decl
, TREE_TYPE (parm
));
1959 parm
= TREE_VALUE (parm
);
1961 if (parm
&& TREE_CODE (parm
) == TEMPLATE_DECL
)
1963 t
= make_aggr_type (TEMPLATE_TEMPLATE_PARM
);
1964 /* This is for distinguishing between real templates and template
1965 template parameters */
1966 TREE_TYPE (parm
) = t
;
1967 TREE_TYPE (DECL_TEMPLATE_RESULT (parm
)) = t
;
1972 t
= make_aggr_type (TEMPLATE_TYPE_PARM
);
1973 /* parm is either IDENTIFIER_NODE or NULL_TREE */
1974 decl
= build_decl (TYPE_DECL
, parm
, t
);
1977 TYPE_NAME (t
) = decl
;
1978 TYPE_STUB_DECL (t
) = decl
;
1980 TEMPLATE_TYPE_PARM_INDEX (t
)
1981 = build_template_parm_index (idx
, processing_template_decl
,
1982 processing_template_decl
,
1983 decl
, TREE_TYPE (parm
));
1985 DECL_ARTIFICIAL (decl
) = 1;
1986 SET_DECL_TEMPLATE_PARM_P (decl
);
1988 parm
= build_tree_list (defval
, parm
);
1989 return chainon (list
, parm
);
1992 /* The end of a template parameter list has been reached. Process the
1993 tree list into a parameter vector, converting each parameter into a more
1994 useful form. Type parameters are saved as IDENTIFIER_NODEs, and others
1998 end_template_parm_list (parms
)
2003 tree saved_parmlist
= make_tree_vec (list_length (parms
));
2005 current_template_parms
2006 = tree_cons (size_int (processing_template_decl
),
2007 saved_parmlist
, current_template_parms
);
2009 for (parm
= parms
, nparms
= 0;
2011 parm
= TREE_CHAIN (parm
), nparms
++)
2012 TREE_VEC_ELT (saved_parmlist
, nparms
) = parm
;
2014 --processing_template_parmlist
;
2016 return saved_parmlist
;
2019 /* end_template_decl is called after a template declaration is seen. */
2022 end_template_decl ()
2024 reset_specialization ();
2026 if (! processing_template_decl
)
2029 /* This matches the pushlevel in begin_template_parm_list. */
2032 --processing_template_decl
;
2033 current_template_parms
= TREE_CHAIN (current_template_parms
);
2036 /* Given a template argument vector containing the template PARMS.
2037 The innermost PARMS are given first. */
2040 current_template_args ()
2043 tree args
= NULL_TREE
;
2044 int length
= TMPL_PARMS_DEPTH (current_template_parms
);
2047 /* If there is only one level of template parameters, we do not
2048 create a TREE_VEC of TREE_VECs. Instead, we return a single
2049 TREE_VEC containing the arguments. */
2051 args
= make_tree_vec (length
);
2053 for (header
= current_template_parms
; header
; header
= TREE_CHAIN (header
))
2055 tree a
= copy_node (TREE_VALUE (header
));
2058 TREE_TYPE (a
) = NULL_TREE
;
2059 for (i
= TREE_VEC_LENGTH (a
) - 1; i
>= 0; --i
)
2061 tree t
= TREE_VEC_ELT (a
, i
);
2063 /* T will be a list if we are called from within a
2064 begin/end_template_parm_list pair, but a vector directly
2065 if within a begin/end_member_template_processing pair. */
2066 if (TREE_CODE (t
) == TREE_LIST
)
2070 if (TREE_CODE (t
) == TYPE_DECL
2071 || TREE_CODE (t
) == TEMPLATE_DECL
)
2074 t
= DECL_INITIAL (t
);
2075 TREE_VEC_ELT (a
, i
) = t
;
2080 TREE_VEC_ELT (args
, --l
) = a
;
2088 /* Return a TEMPLATE_DECL corresponding to DECL, using the indicated
2089 template PARMS. Used by push_template_decl below. */
2092 build_template_decl (decl
, parms
)
2096 tree tmpl
= build_lang_decl (TEMPLATE_DECL
, DECL_NAME (decl
), NULL_TREE
);
2097 DECL_TEMPLATE_PARMS (tmpl
) = parms
;
2098 DECL_CONTEXT (tmpl
) = DECL_CONTEXT (decl
);
2099 if (DECL_LANG_SPECIFIC (decl
))
2101 if (CAN_HAVE_FULL_LANG_DECL_P (decl
))
2102 DECL_VIRTUAL_CONTEXT (tmpl
) = DECL_VIRTUAL_CONTEXT (decl
);
2103 DECL_STATIC_FUNCTION_P (tmpl
) = DECL_STATIC_FUNCTION_P (decl
);
2104 DECL_CONSTRUCTOR_P (tmpl
) = DECL_CONSTRUCTOR_P (decl
);
2105 DECL_NONCONVERTING_P (tmpl
) = DECL_NONCONVERTING_P (decl
);
2106 DECL_ASSIGNMENT_OPERATOR_P (tmpl
) = DECL_ASSIGNMENT_OPERATOR_P (decl
);
2107 if (DECL_OVERLOADED_OPERATOR_P (decl
))
2108 SET_OVERLOADED_OPERATOR_CODE (tmpl
,
2109 DECL_OVERLOADED_OPERATOR_P (decl
));
2115 struct template_parm_data
2117 /* The level of the template parameters we are currently
2121 /* The index of the specialization argument we are currently
2125 /* An array whose size is the number of template parameters. The
2126 elements are non-zero if the parameter has been used in any one
2127 of the arguments processed so far. */
2130 /* An array whose size is the number of template arguments. The
2131 elements are non-zero if the argument makes use of template
2132 parameters of this level. */
2133 int* arg_uses_template_parms
;
2136 /* Subroutine of push_template_decl used to see if each template
2137 parameter in a partial specialization is used in the explicit
2138 argument list. If T is of the LEVEL given in DATA (which is
2139 treated as a template_parm_data*), then DATA->PARMS is marked
2143 mark_template_parm (t
, data
)
2149 struct template_parm_data
* tpd
= (struct template_parm_data
*) data
;
2151 if (TREE_CODE (t
) == TEMPLATE_PARM_INDEX
)
2153 level
= TEMPLATE_PARM_LEVEL (t
);
2154 idx
= TEMPLATE_PARM_IDX (t
);
2158 level
= TEMPLATE_TYPE_LEVEL (t
);
2159 idx
= TEMPLATE_TYPE_IDX (t
);
2162 if (level
== tpd
->level
)
2164 tpd
->parms
[idx
] = 1;
2165 tpd
->arg_uses_template_parms
[tpd
->current_arg
] = 1;
2168 /* Return zero so that for_each_template_parm will continue the
2169 traversal of the tree; we want to mark *every* template parm. */
2173 /* Process the partial specialization DECL. */
2176 process_partial_specialization (decl
)
2179 tree type
= TREE_TYPE (decl
);
2180 tree maintmpl
= CLASSTYPE_TI_TEMPLATE (type
);
2181 tree specargs
= CLASSTYPE_TI_ARGS (type
);
2182 tree inner_args
= INNERMOST_TEMPLATE_ARGS (specargs
);
2183 tree inner_parms
= INNERMOST_TEMPLATE_PARMS (current_template_parms
);
2184 tree main_inner_parms
= DECL_INNERMOST_TEMPLATE_PARMS (maintmpl
);
2185 int nargs
= TREE_VEC_LENGTH (inner_args
);
2186 int ntparms
= TREE_VEC_LENGTH (inner_parms
);
2188 int did_error_intro
= 0;
2189 struct template_parm_data tpd
;
2190 struct template_parm_data tpd2
;
2192 /* We check that each of the template parameters given in the
2193 partial specialization is used in the argument list to the
2194 specialization. For example:
2196 template <class T> struct S;
2197 template <class T> struct S<T*>;
2199 The second declaration is OK because `T*' uses the template
2200 parameter T, whereas
2202 template <class T> struct S<int>;
2204 is no good. Even trickier is:
2215 The S2<T> declaration is actually illegal; it is a
2216 full-specialization. Of course,
2219 struct S2<T (*)(U)>;
2221 or some such would have been OK. */
2222 tpd
.level
= TMPL_PARMS_DEPTH (current_template_parms
);
2223 tpd
.parms
= alloca (sizeof (int) * ntparms
);
2224 memset ((PTR
) tpd
.parms
, 0, sizeof (int) * ntparms
);
2226 tpd
.arg_uses_template_parms
= alloca (sizeof (int) * nargs
);
2227 memset ((PTR
) tpd
.arg_uses_template_parms
, 0, sizeof (int) * nargs
);
2228 for (i
= 0; i
< nargs
; ++i
)
2230 tpd
.current_arg
= i
;
2231 for_each_template_parm (TREE_VEC_ELT (inner_args
, i
),
2232 &mark_template_parm
,
2235 for (i
= 0; i
< ntparms
; ++i
)
2236 if (tpd
.parms
[i
] == 0)
2238 /* One of the template parms was not used in the
2240 if (!did_error_intro
)
2242 cp_error ("template parameters not used in partial specialization:");
2243 did_error_intro
= 1;
2247 TREE_VALUE (TREE_VEC_ELT (inner_parms
, i
)));
2250 /* [temp.class.spec]
2252 The argument list of the specialization shall not be identical to
2253 the implicit argument list of the primary template. */
2254 if (comp_template_args
2256 INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE
2258 cp_error ("partial specialization `%T' does not specialize any template arguments", type
);
2260 /* [temp.class.spec]
2262 A partially specialized non-type argument expression shall not
2263 involve template parameters of the partial specialization except
2264 when the argument expression is a simple identifier.
2266 The type of a template parameter corresponding to a specialized
2267 non-type argument shall not be dependent on a parameter of the
2269 my_friendly_assert (nargs
== DECL_NTPARMS (maintmpl
), 0);
2271 for (i
= 0; i
< nargs
; ++i
)
2273 tree arg
= TREE_VEC_ELT (inner_args
, i
);
2274 if (/* These first two lines are the `non-type' bit. */
2276 && TREE_CODE (arg
) != TEMPLATE_DECL
2277 /* This next line is the `argument expression is not just a
2278 simple identifier' condition and also the `specialized
2279 non-type argument' bit. */
2280 && TREE_CODE (arg
) != TEMPLATE_PARM_INDEX
)
2282 if (tpd
.arg_uses_template_parms
[i
])
2283 cp_error ("template argument `%E' involves template parameter(s)", arg
);
2286 /* Look at the corresponding template parameter,
2287 marking which template parameters its type depends
2290 TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (main_inner_parms
,
2295 /* We haven't yet initialized TPD2. Do so now. */
2296 tpd2
.arg_uses_template_parms
2297 = (int*) alloca (sizeof (int) * nargs
);
2298 /* The number of parameters here is the number in the
2299 main template, which, as checked in the assertion
2301 tpd2
.parms
= (int*) alloca (sizeof (int) * nargs
);
2303 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (maintmpl
));
2306 /* Mark the template parameters. But this time, we're
2307 looking for the template parameters of the main
2308 template, not in the specialization. */
2309 tpd2
.current_arg
= i
;
2310 tpd2
.arg_uses_template_parms
[i
] = 0;
2311 memset ((PTR
) tpd2
.parms
, 0, sizeof (int) * nargs
);
2312 for_each_template_parm (type
,
2313 &mark_template_parm
,
2316 if (tpd2
.arg_uses_template_parms
[i
])
2318 /* The type depended on some template parameters.
2319 If they are fully specialized in the
2320 specialization, that's OK. */
2322 for (j
= 0; j
< nargs
; ++j
)
2323 if (tpd2
.parms
[j
] != 0
2324 && tpd
.arg_uses_template_parms
[j
])
2326 cp_error ("type `%T' of template argument `%E' depends on template parameter(s)",
2336 if (retrieve_specialization (maintmpl
, specargs
))
2337 /* We've already got this specialization. */
2340 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)
2341 = tree_cons (inner_args
, inner_parms
,
2342 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
));
2343 TREE_TYPE (DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)) = type
;
2347 /* Check that a template declaration's use of default arguments is not
2348 invalid. Here, PARMS are the template parameters. IS_PRIMARY is
2349 non-zero if DECL is the thing declared by a primary template.
2350 IS_PARTIAL is non-zero if DECL is a partial specialization. */
2353 check_default_tmpl_args (decl
, parms
, is_primary
, is_partial
)
2360 int last_level_to_check
;
2365 A default template-argument shall not be specified in a
2366 function template declaration or a function template definition, nor
2367 in the template-parameter-list of the definition of a member of a
2370 if (TREE_CODE (CP_DECL_CONTEXT (decl
)) == FUNCTION_DECL
)
2371 /* You can't have a function template declaration in a local
2372 scope, nor you can you define a member of a class template in a
2376 if (current_class_type
2377 && !TYPE_BEING_DEFINED (current_class_type
)
2378 && DECL_LANG_SPECIFIC (decl
)
2379 /* If this is either a friend defined in the scope of the class
2380 or a member function. */
2381 && ((DECL_CONTEXT (decl
)
2382 && same_type_p (DECL_CONTEXT (decl
), current_class_type
))
2383 || (DECL_FRIEND_CONTEXT (decl
)
2384 && same_type_p (DECL_FRIEND_CONTEXT (decl
),
2385 current_class_type
)))
2386 /* And, if it was a member function, it really was defined in
2387 the scope of the class. */
2388 && (!DECL_FUNCTION_MEMBER_P (decl
) || DECL_INITIALIZED_IN_CLASS_P (decl
)))
2389 /* We already checked these parameters when the template was
2390 declared, so there's no need to do it again now. This function
2391 was defined in class scope, but we're processing it's body now
2392 that the class is complete. */
2397 If a template-parameter has a default template-argument, all
2398 subsequent template-parameters shall have a default
2399 template-argument supplied. */
2400 for (parm_level
= parms
; parm_level
; parm_level
= TREE_CHAIN (parm_level
))
2402 tree inner_parms
= TREE_VALUE (parm_level
);
2403 int ntparms
= TREE_VEC_LENGTH (inner_parms
);
2404 int seen_def_arg_p
= 0;
2407 for (i
= 0; i
< ntparms
; ++i
)
2409 tree parm
= TREE_VEC_ELT (inner_parms
, i
);
2410 if (TREE_PURPOSE (parm
))
2412 else if (seen_def_arg_p
)
2414 cp_error ("no default argument for `%D'", TREE_VALUE (parm
));
2415 /* For better subsequent error-recovery, we indicate that
2416 there should have been a default argument. */
2417 TREE_PURPOSE (parm
) = error_mark_node
;
2422 if (TREE_CODE (decl
) != TYPE_DECL
|| is_partial
|| !is_primary
)
2423 /* For an ordinary class template, default template arguments are
2424 allowed at the innermost level, e.g.:
2425 template <class T = int>
2427 but, in a partial specialization, they're not allowed even
2428 there, as we have in [temp.class.spec]:
2430 The template parameter list of a specialization shall not
2431 contain default template argument values.
2433 So, for a partial specialization, or for a function template,
2434 we look at all of them. */
2437 /* But, for a primary class template that is not a partial
2438 specialization we look at all template parameters except the
2440 parms
= TREE_CHAIN (parms
);
2442 /* Figure out what error message to issue. */
2443 if (TREE_CODE (decl
) == FUNCTION_DECL
)
2444 msg
= "default template arguments may not be used in function templates";
2445 else if (is_partial
)
2446 msg
= "default template arguments may not be used in partial specializations";
2448 msg
= "default argument for template parameter for class enclosing `%D'";
2450 if (current_class_type
&& TYPE_BEING_DEFINED (current_class_type
))
2451 /* If we're inside a class definition, there's no need to
2452 examine the parameters to the class itself. On the one
2453 hand, they will be checked when the class is defined, and,
2454 on the other, default arguments are legal in things like:
2455 template <class T = double>
2456 struct S { template <class U> void f(U); };
2457 Here the default argument for `S' has no bearing on the
2458 declaration of `f'. */
2459 last_level_to_check
= template_class_depth (current_class_type
) + 1;
2461 /* Check everything. */
2462 last_level_to_check
= 0;
2464 for (parm_level
= parms
;
2465 parm_level
&& TMPL_PARMS_DEPTH (parm_level
) >= last_level_to_check
;
2466 parm_level
= TREE_CHAIN (parm_level
))
2468 tree inner_parms
= TREE_VALUE (parm_level
);
2472 ntparms
= TREE_VEC_LENGTH (inner_parms
);
2473 for (i
= 0; i
< ntparms
; ++i
)
2474 if (TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)))
2478 cp_error (msg
, decl
);
2482 /* Clear out the default argument so that we are not
2484 TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)) = NULL_TREE
;
2487 /* At this point, if we're still interested in issuing messages,
2488 they must apply to classes surrounding the object declared. */
2490 msg
= "default argument for template parameter for class enclosing `%D'";
2494 /* Creates a TEMPLATE_DECL for the indicated DECL using the template
2495 parameters given by current_template_args, or reuses a
2496 previously existing one, if appropriate. Returns the DECL, or an
2497 equivalent one, if it is replaced via a call to duplicate_decls.
2499 If IS_FRIEND is non-zero, DECL is a friend declaration. */
2502 push_template_decl_real (decl
, is_friend
)
2512 int new_template_p
= 0;
2514 /* See if this is a partial specialization. */
2515 is_partial
= (DECL_IMPLICIT_TYPEDEF_P (decl
)
2516 && TREE_CODE (TREE_TYPE (decl
)) != ENUMERAL_TYPE
2517 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl
)));
2519 is_friend
|= (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_FRIEND_P (decl
));
2522 /* For a friend, we want the context of the friend function, not
2523 the type of which it is a friend. */
2524 ctx
= DECL_CONTEXT (decl
);
2525 else if (CP_DECL_CONTEXT (decl
)
2526 && TREE_CODE (CP_DECL_CONTEXT (decl
)) != NAMESPACE_DECL
)
2527 /* In the case of a virtual function, we want the class in which
2529 ctx
= CP_DECL_CONTEXT (decl
);
2531 /* Otherwise, if we're currently defining some class, the DECL
2532 is assumed to be a member of the class. */
2533 ctx
= current_scope ();
2535 if (ctx
&& TREE_CODE (ctx
) == NAMESPACE_DECL
)
2538 if (!DECL_CONTEXT (decl
))
2539 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
2541 /* See if this is a primary template. */
2542 primary
= template_parm_scope_p ();
2546 if (current_lang_name
== lang_name_c
)
2547 cp_error ("template with C linkage");
2548 else if (TREE_CODE (decl
) == TYPE_DECL
2549 && ANON_AGGRNAME_P (DECL_NAME (decl
)))
2550 cp_error ("template class without a name");
2551 else if ((DECL_IMPLICIT_TYPEDEF_P (decl
)
2552 && CLASS_TYPE_P (TREE_TYPE (decl
)))
2553 || (TREE_CODE (decl
) == VAR_DECL
&& ctx
&& CLASS_TYPE_P (ctx
))
2554 || TREE_CODE (decl
) == FUNCTION_DECL
)
2557 cp_error ("template declaration of `%#D'", decl
);
2560 /* Check to see that the rules regarding the use of default
2561 arguments are not being violated. */
2562 check_default_tmpl_args (decl
, current_template_parms
,
2563 primary
, is_partial
);
2566 return process_partial_specialization (decl
);
2568 args
= current_template_args ();
2571 || TREE_CODE (ctx
) == FUNCTION_DECL
2572 || TYPE_BEING_DEFINED (ctx
)
2573 || (is_friend
&& !DECL_TEMPLATE_INFO (decl
)))
2575 if (DECL_LANG_SPECIFIC (decl
)
2576 && DECL_TEMPLATE_INFO (decl
)
2577 && DECL_TI_TEMPLATE (decl
))
2578 tmpl
= DECL_TI_TEMPLATE (decl
);
2579 /* If DECL is a TYPE_DECL for a class-template, then there won't
2580 be DECL_LANG_SPECIFIC. The information equivalent to
2581 DECL_TEMPLATE_INFO is found in TYPE_TEMPLATE_INFO instead. */
2582 else if (DECL_IMPLICIT_TYPEDEF_P (decl
)
2583 && TYPE_TEMPLATE_INFO (TREE_TYPE (decl
))
2584 && TYPE_TI_TEMPLATE (TREE_TYPE (decl
)))
2586 /* Since a template declaration already existed for this
2587 class-type, we must be redeclaring it here. Make sure
2588 that the redeclaration is legal. */
2589 redeclare_class_template (TREE_TYPE (decl
),
2590 current_template_parms
);
2591 /* We don't need to create a new TEMPLATE_DECL; just use the
2592 one we already had. */
2593 tmpl
= TYPE_TI_TEMPLATE (TREE_TYPE (decl
));
2597 tmpl
= build_template_decl (decl
, current_template_parms
);
2600 if (DECL_LANG_SPECIFIC (decl
)
2601 && DECL_TEMPLATE_SPECIALIZATION (decl
))
2603 /* A specialization of a member template of a template
2605 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
2606 DECL_TEMPLATE_INFO (tmpl
) = DECL_TEMPLATE_INFO (decl
);
2607 DECL_TEMPLATE_INFO (decl
) = NULL_TREE
;
2613 tree a
, t
, current
, parms
;
2616 if (TREE_CODE (decl
) == TYPE_DECL
)
2618 if ((IS_AGGR_TYPE_CODE (TREE_CODE (TREE_TYPE (decl
)))
2619 || TREE_CODE (TREE_TYPE (decl
)) == ENUMERAL_TYPE
)
2620 && TYPE_TEMPLATE_INFO (TREE_TYPE (decl
))
2621 && TYPE_TI_TEMPLATE (TREE_TYPE (decl
)))
2622 tmpl
= TYPE_TI_TEMPLATE (TREE_TYPE (decl
));
2625 cp_error ("`%D' does not declare a template type", decl
);
2629 else if (! DECL_TEMPLATE_INFO (decl
))
2631 cp_error ("template definition of non-template `%#D'", decl
);
2635 tmpl
= DECL_TI_TEMPLATE (decl
);
2637 if (is_member_template (tmpl
)
2638 && DECL_FUNCTION_TEMPLATE_P (tmpl
)
2639 && DECL_TEMPLATE_INFO (decl
) && DECL_TI_ARGS (decl
)
2640 && DECL_TEMPLATE_SPECIALIZATION (decl
))
2644 /* The declaration is a specialization of a member
2645 template, declared outside the class. Therefore, the
2646 innermost template arguments will be NULL, so we
2647 replace them with the arguments determined by the
2648 earlier call to check_explicit_specialization. */
2649 args
= DECL_TI_ARGS (decl
);
2652 = build_template_decl (decl
, current_template_parms
);
2653 DECL_TEMPLATE_RESULT (new_tmpl
) = decl
;
2654 TREE_TYPE (new_tmpl
) = TREE_TYPE (decl
);
2655 DECL_TI_TEMPLATE (decl
) = new_tmpl
;
2656 SET_DECL_TEMPLATE_SPECIALIZATION (new_tmpl
);
2657 DECL_TEMPLATE_INFO (new_tmpl
)
2658 = tree_cons (tmpl
, args
, NULL_TREE
);
2660 register_specialization (new_tmpl
,
2661 most_general_template (tmpl
),
2666 /* Make sure the template headers we got make sense. */
2668 parms
= DECL_TEMPLATE_PARMS (tmpl
);
2669 i
= TMPL_PARMS_DEPTH (parms
);
2670 if (TMPL_ARGS_DEPTH (args
) != i
)
2672 cp_error ("expected %d levels of template parms for `%#D', got %d",
2673 i
, decl
, TMPL_ARGS_DEPTH (args
));
2676 for (current
= decl
; i
> 0; --i
, parms
= TREE_CHAIN (parms
))
2678 a
= TMPL_ARGS_LEVEL (args
, i
);
2679 t
= INNERMOST_TEMPLATE_PARMS (parms
);
2681 if (TREE_VEC_LENGTH (t
) != TREE_VEC_LENGTH (a
))
2683 if (current
== decl
)
2684 cp_error ("got %d template parameters for `%#D'",
2685 TREE_VEC_LENGTH (a
), decl
);
2687 cp_error ("got %d template parameters for `%#T'",
2688 TREE_VEC_LENGTH (a
), current
);
2689 cp_error (" but %d required", TREE_VEC_LENGTH (t
));
2692 /* Perhaps we should also check that the parms are used in the
2693 appropriate qualifying scopes in the declarator? */
2695 if (current
== decl
)
2698 current
= TYPE_CONTEXT (current
);
2702 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
2703 TREE_TYPE (tmpl
) = TREE_TYPE (decl
);
2705 /* Push template declarations for global functions and types. Note
2706 that we do not try to push a global template friend declared in a
2707 template class; such a thing may well depend on the template
2708 parameters of the class. */
2709 if (new_template_p
&& !ctx
2710 && !(is_friend
&& template_class_depth (current_class_type
) > 0))
2711 tmpl
= pushdecl_namespace_level (tmpl
);
2714 DECL_PRIMARY_TEMPLATE (tmpl
) = tmpl
;
2716 info
= tree_cons (tmpl
, args
, NULL_TREE
);
2718 if (DECL_IMPLICIT_TYPEDEF_P (decl
))
2720 SET_TYPE_TEMPLATE_INFO (TREE_TYPE (tmpl
), info
);
2721 if ((!ctx
|| TREE_CODE (ctx
) != FUNCTION_DECL
)
2722 && TREE_CODE (TREE_TYPE (decl
)) != ENUMERAL_TYPE
2723 /* Don't change the name if we've already set it up. */
2724 && !IDENTIFIER_TEMPLATE (DECL_NAME (decl
)))
2725 DECL_NAME (decl
) = classtype_mangled_name (TREE_TYPE (decl
));
2727 else if (DECL_LANG_SPECIFIC (decl
))
2728 DECL_TEMPLATE_INFO (decl
) = info
;
2730 return DECL_TEMPLATE_RESULT (tmpl
);
2734 push_template_decl (decl
)
2737 return push_template_decl_real (decl
, 0);
2740 /* Called when a class template TYPE is redeclared with the indicated
2741 template PARMS, e.g.:
2743 template <class T> struct S;
2744 template <class T> struct S {}; */
2747 redeclare_class_template (type
, parms
)
2755 if (!TYPE_TEMPLATE_INFO (type
))
2757 cp_error ("`%T' is not a template type", type
);
2761 tmpl
= TYPE_TI_TEMPLATE (type
);
2762 if (!PRIMARY_TEMPLATE_P (tmpl
))
2763 /* The type is nested in some template class. Nothing to worry
2764 about here; there are no new template parameters for the nested
2768 parms
= INNERMOST_TEMPLATE_PARMS (parms
);
2769 tmpl_parms
= DECL_INNERMOST_TEMPLATE_PARMS (tmpl
);
2771 if (TREE_VEC_LENGTH (parms
) != TREE_VEC_LENGTH (tmpl_parms
))
2773 cp_error_at ("previous declaration `%D'", tmpl
);
2774 cp_error ("used %d template parameter%s instead of %d",
2775 TREE_VEC_LENGTH (tmpl_parms
),
2776 TREE_VEC_LENGTH (tmpl_parms
) == 1 ? "" : "s",
2777 TREE_VEC_LENGTH (parms
));
2781 for (i
= 0; i
< TREE_VEC_LENGTH (tmpl_parms
); ++i
)
2783 tree tmpl_parm
= TREE_VALUE (TREE_VEC_ELT (tmpl_parms
, i
));
2784 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
2785 tree tmpl_default
= TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
));
2786 tree parm_default
= TREE_PURPOSE (TREE_VEC_ELT (parms
, i
));
2788 if (TREE_CODE (tmpl_parm
) != TREE_CODE (parm
))
2790 cp_error_at ("template parameter `%#D'", tmpl_parm
);
2791 cp_error ("redeclared here as `%#D'", parm
);
2795 if (tmpl_default
!= NULL_TREE
&& parm_default
!= NULL_TREE
)
2797 /* We have in [temp.param]:
2799 A template-parameter may not be given default arguments
2800 by two different declarations in the same scope. */
2801 cp_error ("redefinition of default argument for `%#D'", parm
);
2802 cp_error_at (" original definition appeared here", tmpl_parm
);
2806 if (parm_default
!= NULL_TREE
)
2807 /* Update the previous template parameters (which are the ones
2808 that will really count) with the new default value. */
2809 TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
)) = parm_default
;
2810 else if (tmpl_default
!= NULL_TREE
)
2811 /* Update the new parameters, too; they'll be used as the
2812 parameters for any members. */
2813 TREE_PURPOSE (TREE_VEC_ELT (parms
, i
)) = tmpl_default
;
2817 /* Attempt to convert the non-type template parameter EXPR to the
2818 indicated TYPE. If the conversion is successful, return the
2819 converted value. If the conversion is unsuccessful, return
2820 NULL_TREE if we issued an error message, or error_mark_node if we
2821 did not. We issue error messages for out-and-out bad template
2822 parameters, but not simply because the conversion failed, since we
2823 might be just trying to do argument deduction. By the time this
2824 function is called, neither TYPE nor EXPR may make use of template
2828 convert_nontype_argument (type
, expr
)
2832 tree expr_type
= TREE_TYPE (expr
);
2834 /* A template-argument for a non-type, non-template
2835 template-parameter shall be one of:
2837 --an integral constant-expression of integral or enumeration
2840 --the name of a non-type template-parameter; or
2842 --the name of an object or function with external linkage,
2843 including function templates and function template-ids but
2844 excluding non-static class members, expressed as id-expression;
2847 --the address of an object or function with external linkage,
2848 including function templates and function template-ids but
2849 excluding non-static class members, expressed as & id-expression
2850 where the & is optional if the name refers to a function or
2853 --a pointer to member expressed as described in _expr.unary.op_. */
2855 /* An integral constant-expression can include const variables or
2856 enumerators. Simplify things by folding them to their values,
2857 unless we're about to bind the declaration to a reference
2859 if (INTEGRAL_TYPE_P (expr_type
)
2860 && TREE_CODE (type
) != REFERENCE_TYPE
)
2861 expr
= decl_constant_value (expr
);
2863 if (is_overloaded_fn (expr
))
2864 /* OK for now. We'll check that it has external linkage later.
2865 Check this first since if expr_type is the unknown_type_node
2866 we would otherwise complain below. */
2868 else if (TYPE_PTRMEM_P (expr_type
)
2869 || TYPE_PTRMEMFUNC_P (expr_type
))
2871 if (TREE_CODE (expr
) != PTRMEM_CST
)
2874 else if (TYPE_PTR_P (expr_type
)
2875 || TYPE_PTRMEM_P (expr_type
)
2876 || TREE_CODE (expr_type
) == ARRAY_TYPE
2877 || TREE_CODE (type
) == REFERENCE_TYPE
2878 /* If expr is the address of an overloaded function, we
2879 will get the unknown_type_node at this point. */
2880 || expr_type
== unknown_type_node
)
2886 if (TREE_CODE (expr_type
) == ARRAY_TYPE
2887 || (TREE_CODE (type
) == REFERENCE_TYPE
2888 && TREE_CODE (e
) != ADDR_EXPR
))
2892 if (TREE_CODE (e
) != ADDR_EXPR
)
2895 cp_error ("`%E' is not a valid template argument", expr
);
2896 if (TYPE_PTR_P (expr_type
))
2898 if (TREE_CODE (TREE_TYPE (expr_type
)) == FUNCTION_TYPE
)
2899 cp_error ("it must be the address of a function with external linkage");
2901 cp_error ("it must be the address of an object with external linkage");
2903 else if (TYPE_PTRMEM_P (expr_type
)
2904 || TYPE_PTRMEMFUNC_P (expr_type
))
2905 cp_error ("it must be a pointer-to-member of the form `&X::Y'");
2910 referent
= TREE_OPERAND (e
, 0);
2911 STRIP_NOPS (referent
);
2914 if (TREE_CODE (referent
) == STRING_CST
)
2916 cp_error ("string literal %E is not a valid template argument because it is the address of an object with static linkage",
2921 if (is_overloaded_fn (referent
))
2922 /* We'll check that it has external linkage later. */
2924 else if (TREE_CODE (referent
) != VAR_DECL
)
2926 else if (!DECL_EXTERNAL_LINKAGE_P (referent
))
2928 cp_error ("address of non-extern `%E' cannot be used as template argument", referent
);
2929 return error_mark_node
;
2932 else if (INTEGRAL_TYPE_P (expr_type
)
2933 || TYPE_PTRMEM_P (expr_type
)
2934 || TYPE_PTRMEMFUNC_P (expr_type
))
2936 if (! TREE_CONSTANT (expr
))
2939 cp_error ("non-constant `%E' cannot be used as template argument",
2946 cp_error ("object `%E' cannot be used as template argument", expr
);
2950 switch (TREE_CODE (type
))
2955 /* For a non-type template-parameter of integral or enumeration
2956 type, integral promotions (_conv.prom_) and integral
2957 conversions (_conv.integral_) are applied. */
2958 if (!INTEGRAL_TYPE_P (expr_type
))
2959 return error_mark_node
;
2961 /* It's safe to call digest_init in this case; we know we're
2962 just converting one integral constant expression to another. */
2963 expr
= digest_init (type
, expr
, (tree
*) 0);
2965 if (TREE_CODE (expr
) != INTEGER_CST
)
2966 /* Curiously, some TREE_CONSTANT integral expressions do not
2967 simplify to integer constants. For example, `3 % 0',
2968 remains a TRUNC_MOD_EXPR. */
2975 tree type_pointed_to
= TREE_TYPE (type
);
2977 if (TYPE_PTRMEM_P (type
))
2981 /* For a non-type template-parameter of type pointer to data
2982 member, qualification conversions (_conv.qual_) are
2984 e
= perform_qualification_conversions (type
, expr
);
2985 if (TREE_CODE (e
) == NOP_EXPR
)
2986 /* The call to perform_qualification_conversions will
2987 insert a NOP_EXPR over EXPR to do express conversion,
2988 if necessary. But, that will confuse us if we use
2989 this (converted) template parameter to instantiate
2990 another template; then the thing will not look like a
2991 valid template argument. So, just make a new
2992 constant, of the appropriate type. */
2993 e
= make_ptrmem_cst (type
, PTRMEM_CST_MEMBER (expr
));
2996 else if (TREE_CODE (type_pointed_to
) == FUNCTION_TYPE
)
2998 /* For a non-type template-parameter of type pointer to
2999 function, only the function-to-pointer conversion
3000 (_conv.func_) is applied. If the template-argument
3001 represents a set of overloaded functions (or a pointer to
3002 such), the matching function is selected from the set
3007 if (TREE_CODE (expr
) == ADDR_EXPR
)
3008 fns
= TREE_OPERAND (expr
, 0);
3012 fn
= instantiate_type (type_pointed_to
, fns
, itf_none
);
3014 if (fn
== error_mark_node
)
3015 return error_mark_node
;
3017 if (!DECL_EXTERNAL_LINKAGE_P (fn
))
3019 if (really_overloaded_fn (fns
))
3020 return error_mark_node
;
3025 expr
= build_unary_op (ADDR_EXPR
, fn
, 0);
3027 my_friendly_assert (same_type_p (type
, TREE_TYPE (expr
)),
3033 /* For a non-type template-parameter of type pointer to
3034 object, qualification conversions (_conv.qual_) and the
3035 array-to-pointer conversion (_conv.array_) are applied.
3036 [Note: In particular, neither the null pointer conversion
3037 (_conv.ptr_) nor the derived-to-base conversion
3038 (_conv.ptr_) are applied. Although 0 is a valid
3039 template-argument for a non-type template-parameter of
3040 integral type, it is not a valid template-argument for a
3041 non-type template-parameter of pointer type.]
3043 The call to decay_conversion performs the
3044 array-to-pointer conversion, if appropriate. */
3045 expr
= decay_conversion (expr
);
3047 if (expr
== error_mark_node
)
3048 return error_mark_node
;
3050 return perform_qualification_conversions (type
, expr
);
3055 case REFERENCE_TYPE
:
3057 tree type_referred_to
= TREE_TYPE (type
);
3059 /* If this expression already has reference type, get the
3060 underling object. */
3061 if (TREE_CODE (expr_type
) == REFERENCE_TYPE
)
3063 my_friendly_assert (TREE_CODE (expr
) == ADDR_EXPR
, 20000604);
3064 expr
= TREE_OPERAND (expr
, 0);
3065 expr_type
= TREE_TYPE (expr
);
3068 if (TREE_CODE (type_referred_to
) == FUNCTION_TYPE
)
3070 /* For a non-type template-parameter of type reference to
3071 function, no conversions apply. If the
3072 template-argument represents a set of overloaded
3073 functions, the matching function is selected from the
3074 set (_over.over_). */
3077 fn
= instantiate_type (type_referred_to
, expr
, itf_none
);
3079 if (fn
== error_mark_node
)
3080 return error_mark_node
;
3082 if (!DECL_EXTERNAL_LINKAGE_P (fn
))
3084 if (really_overloaded_fn (expr
))
3085 /* Don't issue an error here; we might get a different
3086 function if the overloading had worked out
3088 return error_mark_node
;
3093 my_friendly_assert (same_type_p (type_referred_to
,
3101 /* For a non-type template-parameter of type reference to
3102 object, no conversions apply. The type referred to by the
3103 reference may be more cv-qualified than the (otherwise
3104 identical) type of the template-argument. The
3105 template-parameter is bound directly to the
3106 template-argument, which must be an lvalue. */
3107 if (!same_type_p (TYPE_MAIN_VARIANT (expr_type
),
3108 TYPE_MAIN_VARIANT (type_referred_to
))
3109 || !at_least_as_qualified_p (type_referred_to
,
3111 || !real_lvalue_p (expr
))
3112 return error_mark_node
;
3115 mark_addressable (expr
);
3116 return build1 (ADDR_EXPR
, type
, expr
);
3122 my_friendly_assert (TYPE_PTRMEMFUNC_P (type
), 20010112);
3124 /* For a non-type template-parameter of type pointer to member
3125 function, no conversions apply. If the template-argument
3126 represents a set of overloaded member functions, the
3127 matching member function is selected from the set
3130 if (!TYPE_PTRMEMFUNC_P (expr_type
) &&
3131 expr_type
!= unknown_type_node
)
3132 return error_mark_node
;
3134 if (TREE_CODE (expr
) == PTRMEM_CST
)
3136 /* A ptr-to-member constant. */
3137 if (!same_type_p (type
, expr_type
))
3138 return error_mark_node
;
3143 if (TREE_CODE (expr
) != ADDR_EXPR
)
3144 return error_mark_node
;
3146 expr
= instantiate_type (type
, expr
, itf_none
);
3148 if (expr
== error_mark_node
)
3149 return error_mark_node
;
3151 my_friendly_assert (same_type_p (type
, TREE_TYPE (expr
)),
3158 /* All non-type parameters must have one of these types. */
3159 my_friendly_abort (0);
3163 return error_mark_node
;
3166 /* Return 1 if PARM_PARMS and ARG_PARMS matches using rule for
3167 template template parameters. Both PARM_PARMS and ARG_PARMS are
3168 vectors of TREE_LIST nodes containing TYPE_DECL, TEMPLATE_DECL
3171 ARG_PARMS may contain more parameters than PARM_PARMS. If this is
3172 the case, then extra parameters must have default arguments.
3174 Consider the example:
3175 template <class T, class Allocator = allocator> class vector;
3176 template<template <class U> class TT> class C;
3178 C<vector> is a valid instantiation. PARM_PARMS for the above code
3179 contains a TYPE_DECL (for U), ARG_PARMS contains two TYPE_DECLs (for
3180 T and Allocator) and OUTER_ARGS contains the argument that is used to
3181 substitute the TT parameter. */
3184 coerce_template_template_parms (parm_parms
, arg_parms
, complain
,
3185 in_decl
, outer_args
)
3186 tree parm_parms
, arg_parms
;
3188 tree in_decl
, outer_args
;
3190 int nparms
, nargs
, i
;
3193 my_friendly_assert (TREE_CODE (parm_parms
) == TREE_VEC
, 0);
3194 my_friendly_assert (TREE_CODE (arg_parms
) == TREE_VEC
, 0);
3196 nparms
= TREE_VEC_LENGTH (parm_parms
);
3197 nargs
= TREE_VEC_LENGTH (arg_parms
);
3199 /* The rule here is opposite of coerce_template_parms. */
3202 && TREE_PURPOSE (TREE_VEC_ELT (arg_parms
, nparms
)) == NULL_TREE
))
3205 for (i
= 0; i
< nparms
; ++i
)
3207 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, i
));
3208 arg
= TREE_VALUE (TREE_VEC_ELT (arg_parms
, i
));
3210 if (arg
== NULL_TREE
|| arg
== error_mark_node
3211 || parm
== NULL_TREE
|| parm
== error_mark_node
)
3214 if (TREE_CODE (arg
) != TREE_CODE (parm
))
3217 switch (TREE_CODE (parm
))
3223 /* We encounter instantiations of templates like
3224 template <template <template <class> class> class TT>
3227 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
3228 tree argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
3230 if (!coerce_template_template_parms (parmparm
, argparm
,
3238 /* The tsubst call is used to handle cases such as
3239 template <class T, template <T> class TT> class D;
3240 i.e. the parameter list of TT depends on earlier parameters. */
3241 if (!same_type_p (tsubst (TREE_TYPE (parm
), outer_args
,
3248 my_friendly_abort (0);
3254 /* Convert the indicated template ARG as necessary to match the
3255 indicated template PARM. Returns the converted ARG, or
3256 error_mark_node if the conversion was unsuccessful. Error messages
3257 are issued if COMPLAIN is non-zero. This conversion is for the Ith
3258 parameter in the parameter list. ARGS is the full set of template
3259 arguments deduced so far. */
3262 convert_template_argument (parm
, arg
, args
, complain
, i
, in_decl
)
3272 int is_type
, requires_type
, is_tmpl_type
, requires_tmpl_type
;
3274 inner_args
= INNERMOST_TEMPLATE_ARGS (args
);
3276 if (TREE_CODE (arg
) == TREE_LIST
3277 && TREE_TYPE (arg
) != NULL_TREE
3278 && TREE_CODE (TREE_TYPE (arg
)) == OFFSET_TYPE
)
3280 /* The template argument was the name of some
3281 member function. That's usually
3282 illegal, but static members are OK. In any
3283 case, grab the underlying fields/functions
3284 and issue an error later if required. */
3285 arg
= TREE_VALUE (arg
);
3286 TREE_TYPE (arg
) = unknown_type_node
;
3289 requires_tmpl_type
= TREE_CODE (parm
) == TEMPLATE_DECL
;
3290 requires_type
= (TREE_CODE (parm
) == TYPE_DECL
3291 || requires_tmpl_type
);
3293 /* Check if it is a class template. If REQUIRES_TMPL_TYPE is true,
3294 we also accept implicitly created TYPE_DECL as a valid argument.
3295 This is necessary to handle the case where we pass a template name
3296 to a template template parameter in a scope where we've derived from
3297 in instantiation of that template, so the template name refers to that
3298 instantiation. We really ought to handle this better. */
3300 = ((TREE_CODE (arg
) == TEMPLATE_DECL
3301 && TREE_CODE (DECL_TEMPLATE_RESULT (arg
)) == TYPE_DECL
)
3302 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
3303 || (TREE_CODE (arg
) == RECORD_TYPE
3304 && CLASSTYPE_TEMPLATE_INFO (arg
)
3305 && TREE_CODE (TYPE_NAME (arg
)) == TYPE_DECL
3306 && DECL_ARTIFICIAL (TYPE_NAME (arg
))
3307 && requires_tmpl_type
3308 && is_base_of_enclosing_class (arg
, current_class_type
)));
3309 if (is_tmpl_type
&& TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
3310 arg
= TYPE_STUB_DECL (arg
);
3311 else if (is_tmpl_type
&& TREE_CODE (arg
) == RECORD_TYPE
)
3312 arg
= CLASSTYPE_TI_TEMPLATE (arg
);
3314 is_type
= TYPE_P (arg
) || is_tmpl_type
;
3316 if (requires_type
&& ! is_type
&& TREE_CODE (arg
) == SCOPE_REF
3317 && TREE_CODE (TREE_OPERAND (arg
, 0)) == TEMPLATE_TYPE_PARM
)
3319 cp_pedwarn ("to refer to a type member of a template parameter, use `typename %E'", arg
);
3321 arg
= make_typename_type (TREE_OPERAND (arg
, 0),
3322 TREE_OPERAND (arg
, 1),
3326 if (is_type
!= requires_type
)
3332 cp_error ("type/value mismatch at argument %d in template parameter list for `%D'",
3335 cp_error (" expected a constant of type `%T', got `%T'",
3337 (is_tmpl_type
? DECL_NAME (arg
) : arg
));
3339 cp_error (" expected a type, got `%E'", arg
);
3342 return error_mark_node
;
3344 if (is_tmpl_type
^ requires_tmpl_type
)
3346 if (in_decl
&& complain
)
3348 cp_error ("type/value mismatch at argument %d in template parameter list for `%D'",
3351 cp_error (" expected a type, got `%T'", DECL_NAME (arg
));
3353 cp_error (" expected a class template, got `%T'", arg
);
3355 return error_mark_node
;
3360 if (requires_tmpl_type
)
3362 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
3363 tree argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
3365 if (coerce_template_template_parms (parmparm
, argparm
, complain
,
3366 in_decl
, inner_args
))
3370 /* TEMPLATE_TEMPLATE_PARM node is preferred over
3372 if (val
!= error_mark_node
3373 && DECL_TEMPLATE_TEMPLATE_PARM_P (val
))
3374 val
= TREE_TYPE (val
);
3378 if (in_decl
&& complain
)
3380 cp_error ("type/value mismatch at argument %d in template parameter list for `%D'",
3382 cp_error (" expected a template of type `%D', got `%D'", parm
, arg
);
3385 val
= error_mark_node
;
3390 val
= groktypename (arg
);
3391 if (! processing_template_decl
)
3393 /* [basic.link]: A name with no linkage (notably, the
3394 name of a class or enumeration declared in a local
3395 scope) shall not be used to declare an entity with
3396 linkage. This implies that names with no linkage
3397 cannot be used as template arguments. */
3398 tree t
= no_linkage_check (val
);
3401 if (TYPE_ANONYMOUS_P (t
))
3403 ("template-argument `%T' uses anonymous type", val
);
3406 ("template-argument `%T' uses local type `%T'",
3408 return error_mark_node
;
3415 tree t
= tsubst (TREE_TYPE (parm
), args
, complain
, in_decl
);
3417 if (invalid_nontype_parm_type_p (t
, complain
))
3418 return error_mark_node
;
3420 if (processing_template_decl
)
3421 arg
= maybe_fold_nontype_arg (arg
);
3423 if (!uses_template_parms (arg
) && !uses_template_parms (t
))
3424 /* We used to call digest_init here. However, digest_init
3425 will report errors, which we don't want when complain
3426 is zero. More importantly, digest_init will try too
3427 hard to convert things: for example, `0' should not be
3428 converted to pointer type at this point according to
3429 the standard. Accepting this is not merely an
3430 extension, since deciding whether or not these
3431 conversions can occur is part of determining which
3432 function template to call, or whether a given explicit
3433 argument specification is legal. */
3434 val
= convert_nontype_argument (t
, arg
);
3438 if (val
== NULL_TREE
)
3439 val
= error_mark_node
;
3440 else if (val
== error_mark_node
&& complain
)
3441 cp_error ("could not convert template argument `%E' to `%T'",
3448 /* Convert all template arguments to their appropriate types, and
3449 return a vector containing the innermost resulting template
3450 arguments. If any error occurs, return error_mark_node, and, if
3451 COMPLAIN is non-zero, issue an error message. Some error messages
3452 are issued even if COMPLAIN is zero; for instance, if a template
3453 argument is composed from a local class.
3455 If REQUIRE_ALL_ARGUMENTS is non-zero, all arguments must be
3456 provided in ARGLIST, or else trailing parameters must have default
3457 values. If REQUIRE_ALL_ARGUMENTS is zero, we will attempt argument
3458 deduction for any unspecified trailing arguments. */
3461 coerce_template_parms (parms
, args
, in_decl
,
3463 require_all_arguments
)
3467 int require_all_arguments
;
3469 int nparms
, nargs
, i
, lost
= 0;
3472 tree new_inner_args
;
3474 inner_args
= INNERMOST_TEMPLATE_ARGS (args
);
3475 nargs
= NUM_TMPL_ARGS (inner_args
);
3476 nparms
= TREE_VEC_LENGTH (parms
);
3480 && require_all_arguments
3481 && TREE_PURPOSE (TREE_VEC_ELT (parms
, nargs
)) == NULL_TREE
))
3485 cp_error ("wrong number of template arguments (%d, should be %d)",
3489 cp_error_at ("provided for `%D'", in_decl
);
3492 return error_mark_node
;
3495 new_inner_args
= make_tree_vec (nparms
);
3496 new_args
= add_outermost_template_args (args
, new_inner_args
);
3497 for (i
= 0; i
< nparms
; i
++)
3502 /* Get the Ith template parameter. */
3503 parm
= TREE_VEC_ELT (parms
, i
);
3505 /* Calculate the Ith argument. */
3506 if (inner_args
&& TREE_CODE (inner_args
) == TREE_LIST
)
3508 arg
= TREE_VALUE (inner_args
);
3509 inner_args
= TREE_CHAIN (inner_args
);
3512 arg
= TREE_VEC_ELT (inner_args
, i
);
3513 /* If no template argument was supplied, look for a default
3515 else if (TREE_PURPOSE (parm
) == NULL_TREE
)
3517 /* There was no default value. */
3518 my_friendly_assert (!require_all_arguments
, 0);
3521 else if (TREE_CODE (TREE_VALUE (parm
)) == TYPE_DECL
)
3522 arg
= tsubst (TREE_PURPOSE (parm
), new_args
, complain
, in_decl
);
3524 arg
= tsubst_expr (TREE_PURPOSE (parm
), new_args
, complain
,
3527 /* Now, convert the Ith argument, as necessary. */
3528 if (arg
== NULL_TREE
)
3529 /* We're out of arguments. */
3531 my_friendly_assert (!require_all_arguments
, 0);
3534 else if (arg
== error_mark_node
)
3536 cp_error ("template argument %d is invalid", i
+ 1);
3537 arg
= error_mark_node
;
3540 arg
= convert_template_argument (TREE_VALUE (parm
),
3541 arg
, new_args
, complain
, i
,
3544 if (arg
== error_mark_node
)
3546 TREE_VEC_ELT (new_inner_args
, i
) = arg
;
3550 return error_mark_node
;
3552 return new_inner_args
;
3555 /* Returns 1 if template args OT and NT are equivalent. */
3558 template_args_equal (ot
, nt
)
3564 if (TREE_CODE (nt
) == TREE_VEC
)
3565 /* For member templates */
3566 return TREE_CODE (ot
) == TREE_VEC
&& comp_template_args (ot
, nt
);
3567 else if (TYPE_P (nt
))
3568 return TYPE_P (ot
) && same_type_p (ot
, nt
);
3569 else if (TREE_CODE (ot
) == TREE_VEC
|| TYPE_P (ot
))
3572 return (cp_tree_equal (ot
, nt
) > 0);
3575 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets
3576 of template arguments. Returns 0 otherwise. */
3579 comp_template_args (oldargs
, newargs
)
3580 tree oldargs
, newargs
;
3584 if (TREE_VEC_LENGTH (oldargs
) != TREE_VEC_LENGTH (newargs
))
3587 for (i
= 0; i
< TREE_VEC_LENGTH (oldargs
); ++i
)
3589 tree nt
= TREE_VEC_ELT (newargs
, i
);
3590 tree ot
= TREE_VEC_ELT (oldargs
, i
);
3592 if (! template_args_equal (ot
, nt
))
3598 /* Given class template name and parameter list, produce a user-friendly name
3599 for the instantiation. */
3602 mangle_class_name_for_template (name
, parms
, arglist
)
3604 tree parms
, arglist
;
3606 static struct obstack scratch_obstack
;
3607 static char *scratch_firstobj
;
3610 if (!scratch_firstobj
)
3611 gcc_obstack_init (&scratch_obstack
);
3613 obstack_free (&scratch_obstack
, scratch_firstobj
);
3614 scratch_firstobj
= obstack_alloc (&scratch_obstack
, 1);
3616 #define ccat(c) obstack_1grow (&scratch_obstack, (c));
3617 #define cat(s) obstack_grow (&scratch_obstack, (s), strlen (s))
3621 nparms
= TREE_VEC_LENGTH (parms
);
3622 arglist
= INNERMOST_TEMPLATE_ARGS (arglist
);
3623 my_friendly_assert (nparms
== TREE_VEC_LENGTH (arglist
), 268);
3624 for (i
= 0; i
< nparms
; i
++)
3626 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
3627 tree arg
= TREE_VEC_ELT (arglist
, i
);
3632 if (TREE_CODE (parm
) == TYPE_DECL
)
3634 cat (type_as_string (arg
, TFF_CHASE_TYPEDEF
));
3637 else if (TREE_CODE (parm
) == TEMPLATE_DECL
)
3639 if (TREE_CODE (arg
) == TEMPLATE_DECL
)
3641 /* Already substituted with real template. Just output
3642 the template name here */
3643 tree context
= DECL_CONTEXT (arg
);
3646 /* The template may be defined in a namespace, or
3647 may be a member template. */
3648 my_friendly_assert (TREE_CODE (context
) == NAMESPACE_DECL
3649 || CLASS_TYPE_P (context
),
3651 cat(decl_as_string (DECL_CONTEXT (arg
), TFF_PLAIN_IDENTIFIER
));
3654 cat (IDENTIFIER_POINTER (DECL_NAME (arg
)));
3657 /* Output the parameter declaration */
3658 cat (type_as_string (arg
, TFF_CHASE_TYPEDEF
));
3662 my_friendly_assert (TREE_CODE (parm
) == PARM_DECL
, 269);
3664 if (TREE_CODE (arg
) == TREE_LIST
)
3666 /* New list cell was built because old chain link was in
3668 my_friendly_assert (TREE_PURPOSE (arg
) == NULL_TREE
, 270);
3669 arg
= TREE_VALUE (arg
);
3671 /* No need to check arglist against parmlist here; we did that
3672 in coerce_template_parms, called from lookup_template_class. */
3673 cat (expr_as_string (arg
, TFF_PLAIN_IDENTIFIER
));
3676 char *bufp
= obstack_next_free (&scratch_obstack
);
3678 while (bufp
[offset
- 1] == ' ')
3680 obstack_blank_fast (&scratch_obstack
, offset
);
3682 /* B<C<char> >, not B<C<char>> */
3683 if (bufp
[offset
- 1] == '>')
3688 return (char *) obstack_base (&scratch_obstack
);
3692 classtype_mangled_name (t
)
3695 if (CLASSTYPE_TEMPLATE_INFO (t
)
3696 /* Specializations have already had their names set up in
3697 lookup_template_class. */
3698 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
3700 tree tmpl
= most_general_template (CLASSTYPE_TI_TEMPLATE (t
));
3702 /* For non-primary templates, the template parameters are
3703 implicit from their surrounding context. */
3704 if (PRIMARY_TEMPLATE_P (tmpl
))
3706 tree name
= DECL_NAME (tmpl
);
3707 char *mangled_name
= mangle_class_name_for_template
3708 (IDENTIFIER_POINTER (name
),
3709 DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
3710 CLASSTYPE_TI_ARGS (t
));
3711 tree id
= get_identifier (mangled_name
);
3712 IDENTIFIER_TEMPLATE (id
) = name
;
3717 return TYPE_IDENTIFIER (t
);
3721 add_pending_template (d
)
3724 tree ti
= (TYPE_P (d
)
3725 ? CLASSTYPE_TEMPLATE_INFO (d
)
3726 : DECL_TEMPLATE_INFO (d
));
3730 if (TI_PENDING_TEMPLATE_FLAG (ti
))
3733 /* We are called both from instantiate_decl, where we've already had a
3734 tinst_level pushed, and instantiate_template, where we haven't.
3736 level
= !(current_tinst_level
&& TINST_DECL (current_tinst_level
) == d
);
3739 push_tinst_level (d
);
3741 pt
= tree_cons (current_tinst_level
, d
, NULL_TREE
);
3742 if (last_pending_template
)
3743 TREE_CHAIN (last_pending_template
) = pt
;
3745 pending_templates
= pt
;
3747 last_pending_template
= pt
;
3749 TI_PENDING_TEMPLATE_FLAG (ti
) = 1;
3756 /* Return a TEMPLATE_ID_EXPR corresponding to the indicated FNS (which
3757 may be either a _DECL or an overloaded function or an
3758 IDENTIFIER_NODE), and ARGLIST. */
3761 lookup_template_function (fns
, arglist
)
3766 if (fns
== NULL_TREE
)
3768 cp_error ("non-template used as template");
3769 return error_mark_node
;
3772 type
= TREE_TYPE (fns
);
3773 if (TREE_CODE (fns
) == OVERLOAD
|| !type
)
3774 type
= unknown_type_node
;
3776 if (processing_template_decl
)
3777 return build_min (TEMPLATE_ID_EXPR
, type
, fns
, arglist
);
3779 return build (TEMPLATE_ID_EXPR
, type
, fns
, arglist
);
3782 /* Within the scope of a template class S<T>, the name S gets bound
3783 (in build_self_reference) to a TYPE_DECL for the class, not a
3784 TEMPLATE_DECL. If DECL is a TYPE_DECL for current_class_type,
3785 or one of its enclosing classes, and that type is a template,
3786 return the associated TEMPLATE_DECL. Otherwise, the original
3787 DECL is returned. */
3790 maybe_get_template_decl_from_type_decl (decl
)
3793 return (decl
!= NULL_TREE
3794 && TREE_CODE (decl
) == TYPE_DECL
3795 && DECL_ARTIFICIAL (decl
)
3796 && CLASS_TYPE_P (TREE_TYPE (decl
))
3797 && CLASSTYPE_TEMPLATE_INFO (TREE_TYPE (decl
)))
3798 ? CLASSTYPE_TI_TEMPLATE (TREE_TYPE (decl
)) : decl
;
3801 /* Given an IDENTIFIER_NODE (type TEMPLATE_DECL) and a chain of
3802 parameters, find the desired type.
3804 D1 is the PTYPENAME terminal, and ARGLIST is the list of arguments.
3805 (Actually ARGLIST may be either a TREE_LIST or a TREE_VEC. It will
3806 be a TREE_LIST if called directly from the parser, and a TREE_VEC
3809 IN_DECL, if non-NULL, is the template declaration we are trying to
3812 If ENTERING_SCOPE is non-zero, we are about to enter the scope of
3813 the class we are looking up.
3815 If COMPLAIN is non-zero, issue error messages.
3817 If the template class is really a local class in a template
3818 function, then the FUNCTION_CONTEXT is the function in which it is
3819 being instantiated. */
3822 lookup_template_class (d1
, arglist
, in_decl
, context
, entering_scope
, complain
)
3829 tree
template = NULL_TREE
, parmlist
;
3832 if (TREE_CODE (d1
) == IDENTIFIER_NODE
)
3834 if (IDENTIFIER_VALUE (d1
)
3835 && DECL_TEMPLATE_TEMPLATE_PARM_P (IDENTIFIER_VALUE (d1
)))
3836 template = IDENTIFIER_VALUE (d1
);
3840 push_decl_namespace (context
);
3841 template = lookup_name (d1
, /*prefer_type=*/0);
3842 template = maybe_get_template_decl_from_type_decl (template);
3844 pop_decl_namespace ();
3847 context
= DECL_CONTEXT (template);
3849 else if (TREE_CODE (d1
) == TYPE_DECL
&& IS_AGGR_TYPE (TREE_TYPE (d1
)))
3851 tree type
= TREE_TYPE (d1
);
3853 /* If we are declaring a constructor, say A<T>::A<T>, we will get
3854 an implicit typename for the second A. Deal with it. */
3855 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
3856 type
= TREE_TYPE (type
);
3858 if (CLASSTYPE_TEMPLATE_INFO (type
))
3860 template = CLASSTYPE_TI_TEMPLATE (type
);
3861 d1
= DECL_NAME (template);
3864 else if (TREE_CODE (d1
) == ENUMERAL_TYPE
3865 || (TYPE_P (d1
) && IS_AGGR_TYPE (d1
)))
3867 template = TYPE_TI_TEMPLATE (d1
);
3868 d1
= DECL_NAME (template);
3870 else if (TREE_CODE (d1
) == TEMPLATE_DECL
3871 && TREE_CODE (DECL_TEMPLATE_RESULT (d1
)) == TYPE_DECL
)
3874 d1
= DECL_NAME (template);
3875 context
= DECL_CONTEXT (template);
3878 /* With something like `template <class T> class X class X { ... };'
3879 we could end up with D1 having nothing but an IDENTIFIER_VALUE.
3880 We don't want to do that, but we have to deal with the situation,
3881 so let's give them some syntax errors to chew on instead of a
3882 crash. Alternatively D1 might not be a template type at all. */
3886 cp_error ("`%T' is not a template", d1
);
3887 return error_mark_node
;
3890 if (TREE_CODE (template) != TEMPLATE_DECL
3891 /* If we're called from the parser, make sure it's a user visible
3893 || ((!arglist
|| TREE_CODE (arglist
) == TREE_LIST
)
3894 && !DECL_TEMPLATE_PARM_P (template)
3895 && !PRIMARY_TEMPLATE_P (template)))
3899 cp_error ("non-template type `%T' used as a template", d1
);
3901 cp_error_at ("for template declaration `%D'", in_decl
);
3903 return error_mark_node
;
3906 if (DECL_TEMPLATE_TEMPLATE_PARM_P (template))
3908 /* Create a new TEMPLATE_DECL and TEMPLATE_TEMPLATE_PARM node to store
3909 template arguments */
3914 parmlist
= DECL_INNERMOST_TEMPLATE_PARMS (template);
3916 /* Consider an example where a template template parameter declared as
3918 template <class T, class U = std::allocator<T> > class TT
3920 The template parameter level of T and U are one level larger than
3921 of TT. To proper process the default argument of U, say when an
3922 instantiation `TT<int>' is seen, we need to build the full
3923 arguments containing {int} as the innermost level. Outer levels
3924 can be obtained from `current_template_args ()'. */
3926 if (processing_template_decl
)
3927 arglist
= add_to_template_args (current_template_args (), arglist
);
3929 arglist2
= coerce_template_parms (parmlist
, arglist
, template,
3930 complain
, /*require_all_args=*/1);
3931 if (arglist2
== error_mark_node
)
3932 return error_mark_node
;
3934 parm
= bind_template_template_parm (TREE_TYPE (template), arglist2
);
3939 tree template_type
= TREE_TYPE (template);
3942 tree found
= NULL_TREE
;
3946 int is_partial_instantiation
;
3948 gen_tmpl
= most_general_template (template);
3949 parmlist
= DECL_TEMPLATE_PARMS (gen_tmpl
);
3950 parm_depth
= TMPL_PARMS_DEPTH (parmlist
);
3951 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
3953 if (arg_depth
== 1 && parm_depth
> 1)
3955 /* We've been given an incomplete set of template arguments.
3958 template <class T> struct S1 {
3959 template <class U> struct S2 {};
3960 template <class U> struct S2<U*> {};
3963 we will be called with an ARGLIST of `U*', but the
3964 TEMPLATE will be `template <class T> template
3965 <class U> struct S1<T>::S2'. We must fill in the missing
3968 = add_outermost_template_args (TYPE_TI_ARGS (TREE_TYPE (template)),
3970 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
3973 /* Now we should enough arguments. */
3974 my_friendly_assert (parm_depth
== arg_depth
, 0);
3976 /* From here on, we're only interested in the most general
3978 template = gen_tmpl
;
3980 /* Calculate the BOUND_ARGS. These will be the args that are
3981 actually tsubst'd into the definition to create the
3985 /* We have multiple levels of arguments to coerce, at once. */
3987 int saved_depth
= TMPL_ARGS_DEPTH (arglist
);
3989 tree bound_args
= make_tree_vec (parm_depth
);
3991 for (i
= saved_depth
,
3992 t
= DECL_TEMPLATE_PARMS (template);
3993 i
> 0 && t
!= NULL_TREE
;
3994 --i
, t
= TREE_CHAIN (t
))
3996 tree a
= coerce_template_parms (TREE_VALUE (t
),
3998 complain
, /*require_all_args=*/1);
3999 SET_TMPL_ARGS_LEVEL (bound_args
, i
, a
);
4001 /* We temporarily reduce the length of the ARGLIST so
4002 that coerce_template_parms will see only the arguments
4003 corresponding to the template parameters it is
4005 TREE_VEC_LENGTH (arglist
)--;
4008 /* Restore the ARGLIST to its full size. */
4009 TREE_VEC_LENGTH (arglist
) = saved_depth
;
4011 arglist
= bound_args
;
4015 = coerce_template_parms (INNERMOST_TEMPLATE_PARMS (parmlist
),
4016 INNERMOST_TEMPLATE_ARGS (arglist
),
4018 complain
, /*require_all_args=*/1);
4020 if (arglist
== error_mark_node
)
4021 /* We were unable to bind the arguments. */
4022 return error_mark_node
;
4024 /* In the scope of a template class, explicit references to the
4025 template class refer to the type of the template, not any
4026 instantiation of it. For example, in:
4028 template <class T> class C { void f(C<T>); }
4030 the `C<T>' is just the same as `C'. Outside of the
4031 class, however, such a reference is an instantiation. */
4032 if (comp_template_args (TYPE_TI_ARGS (template_type
),
4035 found
= template_type
;
4037 if (!entering_scope
&& PRIMARY_TEMPLATE_P (template))
4041 /* Note that we use DECL_CONTEXT, rather than
4042 CP_DECL_CONTEXT, so that the termination test is
4043 always just `ctx'. We're not interested in namespace
4045 for (ctx
= current_class_type
;
4047 ctx
= (TYPE_P (ctx
)) ? TYPE_CONTEXT (ctx
) : DECL_CONTEXT (ctx
))
4048 if (same_type_p (ctx
, template_type
))
4052 /* We're not in the scope of the class, so the
4053 TEMPLATE_TYPE is not the type we want after
4061 for (tp
= &DECL_TEMPLATE_INSTANTIATIONS (template);
4063 tp
= &TREE_CHAIN (*tp
))
4064 if (comp_template_args (TREE_PURPOSE (*tp
), arglist
))
4068 /* Use the move-to-front heuristic to speed up future
4070 *tp
= TREE_CHAIN (*tp
);
4072 = DECL_TEMPLATE_INSTANTIATIONS (template);
4073 DECL_TEMPLATE_INSTANTIATIONS (template) = found
;
4075 return TREE_VALUE (found
);
4078 /* This type is a "partial instantiation" if any of the template
4079 arguments still involve template parameters. Note that we set
4080 IS_PARTIAL_INSTANTIATION for partial specializations as
4082 is_partial_instantiation
= uses_template_parms (arglist
);
4084 if (!is_partial_instantiation
4085 && !PRIMARY_TEMPLATE_P (template)
4086 && TREE_CODE (CP_DECL_CONTEXT (template)) == NAMESPACE_DECL
)
4088 found
= xref_tag_from_type (TREE_TYPE (template),
4089 DECL_NAME (template),
4094 context
= tsubst (DECL_CONTEXT (template), arglist
,
4095 /*complain=*/0, in_decl
);
4097 context
= global_namespace
;
4099 /* Create the type. */
4100 if (TREE_CODE (template_type
) == ENUMERAL_TYPE
)
4102 if (!is_partial_instantiation
)
4104 set_current_access_from_decl (TYPE_NAME (template_type
));
4105 t
= start_enum (TYPE_IDENTIFIER (template_type
));
4108 /* We don't want to call start_enum for this type, since
4109 the values for the enumeration constants may involve
4110 template parameters. And, no one should be interested
4111 in the enumeration constants for such a type. */
4112 t
= make_node (ENUMERAL_TYPE
);
4116 t
= make_aggr_type (TREE_CODE (template_type
));
4117 CLASSTYPE_DECLARED_CLASS (t
)
4118 = CLASSTYPE_DECLARED_CLASS (template_type
);
4119 CLASSTYPE_GOT_SEMICOLON (t
) = 1;
4120 SET_CLASSTYPE_IMPLICIT_INSTANTIATION (t
);
4121 TYPE_FOR_JAVA (t
) = TYPE_FOR_JAVA (template_type
);
4123 /* A local class. Make sure the decl gets registered properly. */
4124 if (context
== current_function_decl
)
4125 pushtag (DECL_NAME (template), t
, 0);
4128 /* If we called start_enum or pushtag above, this information
4129 will already be set up. */
4132 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
4134 type_decl
= create_implicit_typedef (DECL_NAME (template), t
);
4135 DECL_CONTEXT (type_decl
) = TYPE_CONTEXT (t
);
4136 TYPE_STUB_DECL (t
) = type_decl
;
4137 DECL_SOURCE_FILE (type_decl
)
4138 = DECL_SOURCE_FILE (TYPE_STUB_DECL (template_type
));
4139 DECL_SOURCE_LINE (type_decl
)
4140 = DECL_SOURCE_LINE (TYPE_STUB_DECL (template_type
));
4143 type_decl
= TYPE_NAME (t
);
4145 /* Set up the template information. We have to figure out which
4146 template is the immediate parent if this is a full
4148 if (parm_depth
== 1 || is_partial_instantiation
4149 || !PRIMARY_TEMPLATE_P (template))
4150 /* This case is easy; there are no member templates involved. */
4154 /* This is a full instantiation of a member template. Look
4155 for a partial instantiation of which this is an instance. */
4157 for (found
= DECL_TEMPLATE_INSTANTIATIONS (template);
4158 found
; found
= TREE_CHAIN (found
))
4161 tree tmpl
= CLASSTYPE_TI_TEMPLATE (TREE_VALUE (found
));
4163 /* We only want partial instantiations, here, not
4164 specializations or full instantiations. */
4165 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_VALUE (found
))
4166 || !uses_template_parms (TREE_VALUE (found
)))
4169 /* Temporarily reduce by one the number of levels in the
4170 ARGLIST and in FOUND so as to avoid comparing the
4171 last set of arguments. */
4172 TREE_VEC_LENGTH (arglist
)--;
4173 TREE_VEC_LENGTH (TREE_PURPOSE (found
)) --;
4175 /* See if the arguments match. If they do, then TMPL is
4176 the partial instantiation we want. */
4177 success
= comp_template_args (TREE_PURPOSE (found
), arglist
);
4179 /* Restore the argument vectors to their full size. */
4180 TREE_VEC_LENGTH (arglist
)++;
4181 TREE_VEC_LENGTH (TREE_PURPOSE (found
))++;
4192 /* There was no partial instantiation. This happens
4193 where C<T> is a member template of A<T> and it's used
4196 template <typename T> struct B { A<T>::C<int> m; };
4199 Create the partial instantiation.
4201 TREE_VEC_LENGTH (arglist
)--;
4202 template = tsubst (template, arglist
, /*complain=*/0, NULL_TREE
);
4203 TREE_VEC_LENGTH (arglist
)++;
4208 SET_TYPE_TEMPLATE_INFO (t
, tree_cons (found
, arglist
, NULL_TREE
));
4209 DECL_TEMPLATE_INSTANTIATIONS (template)
4210 = tree_cons (arglist
, t
,
4211 DECL_TEMPLATE_INSTANTIATIONS (template));
4213 if (TREE_CODE (t
) == ENUMERAL_TYPE
4214 && !is_partial_instantiation
)
4215 /* Now that the type has been registered on the instantiations
4216 list, we set up the enumerators. Because the enumeration
4217 constants may involve the enumeration type itself, we make
4218 sure to register the type first, and then create the
4219 constants. That way, doing tsubst_expr for the enumeration
4220 constants won't result in recursive calls here; we'll find
4221 the instantiation and exit above. */
4222 tsubst_enum (template_type
, t
, arglist
);
4224 /* Reset the name of the type, now that CLASSTYPE_TEMPLATE_INFO
4226 if (TREE_CODE (t
) != ENUMERAL_TYPE
)
4227 DECL_NAME (type_decl
) = classtype_mangled_name (t
);
4228 if (!is_partial_instantiation
)
4230 /* For backwards compatibility; code that uses
4231 -fexternal-templates expects looking up a template to
4232 instantiate it. I think DDD still relies on this.
4233 (jason 8/20/1998) */
4234 if (TREE_CODE (t
) != ENUMERAL_TYPE
4235 && flag_external_templates
4236 && CLASSTYPE_INTERFACE_KNOWN (TREE_TYPE (template))
4237 && ! CLASSTYPE_INTERFACE_ONLY (TREE_TYPE (template)))
4238 add_pending_template (t
);
4241 /* If the type makes use of template parameters, the
4242 code that generates debugging information will crash. */
4243 DECL_IGNORED_P (TYPE_STUB_DECL (t
)) = 1;
4255 /* Called from for_each_template_parm via walk_tree. */
4258 for_each_template_parm_r (tp
, walk_subtrees
, d
)
4264 struct pair_fn_data
*pfd
= (struct pair_fn_data
*) d
;
4265 tree_fn_t fn
= pfd
->fn
;
4266 void *data
= pfd
->data
;
4269 && for_each_template_parm (TYPE_CONTEXT (t
), fn
, data
))
4270 return error_mark_node
;
4272 switch (TREE_CODE (t
))
4275 if (TYPE_PTRMEMFUNC_P (t
))
4281 if (!TYPE_TEMPLATE_INFO (t
))
4283 else if (for_each_template_parm (TREE_VALUE (TYPE_TEMPLATE_INFO (t
)),
4285 return error_mark_node
;
4289 /* Since we're not going to walk subtrees, we have to do this
4291 if (for_each_template_parm (TYPE_METHOD_BASETYPE (t
), fn
, data
))
4292 return error_mark_node
;
4296 /* Check the return type. */
4297 if (for_each_template_parm (TREE_TYPE (t
), fn
, data
))
4298 return error_mark_node
;
4300 /* Check the parameter types. Since default arguments are not
4301 instantiated until they are needed, the TYPE_ARG_TYPES may
4302 contain expressions that involve template parameters. But,
4303 no-one should be looking at them yet. And, once they're
4304 instantiated, they don't contain template parameters, so
4305 there's no point in looking at them then, either. */
4309 for (parm
= TYPE_ARG_TYPES (t
); parm
; parm
= TREE_CHAIN (parm
))
4310 if (for_each_template_parm (TREE_VALUE (parm
), fn
, data
))
4311 return error_mark_node
;
4313 /* Since we've already handled the TYPE_ARG_TYPES, we don't
4314 want walk_tree walking into them itself. */
4321 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
)
4322 && for_each_template_parm (DECL_TI_ARGS (t
), fn
, data
))
4323 return error_mark_node
;
4328 if (DECL_CONTEXT (t
)
4329 && for_each_template_parm (DECL_CONTEXT (t
), fn
, data
))
4330 return error_mark_node
;
4333 case BOUND_TEMPLATE_TEMPLATE_PARM
:
4334 /* Record template parameters such as `T' inside `TT<T>'. */
4335 if (for_each_template_parm (TYPE_TI_ARGS (t
), fn
, data
))
4336 return error_mark_node
;
4339 case TEMPLATE_TEMPLATE_PARM
:
4340 case TEMPLATE_TYPE_PARM
:
4341 case TEMPLATE_PARM_INDEX
:
4342 if (fn
&& (*fn
)(t
, data
))
4343 return error_mark_node
;
4345 return error_mark_node
;
4349 /* A template template parameter is encountered */
4350 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
)
4351 && for_each_template_parm (TREE_TYPE (t
), fn
, data
))
4352 return error_mark_node
;
4354 /* Already substituted template template parameter */
4359 if (!fn
|| for_each_template_parm (TYPENAME_TYPE_FULLNAME (t
), fn
, data
))
4360 return error_mark_node
;
4364 if (TREE_TYPE (t
) && TYPE_PTRMEMFUNC_P (TREE_TYPE (t
))
4365 && for_each_template_parm (TYPE_PTRMEMFUNC_FN_TYPE
4366 (TREE_TYPE (t
)), fn
, data
))
4367 return error_mark_node
;
4372 /* If there's no type, then this thing must be some expression
4373 involving template parameters. */
4374 if (!fn
&& !TREE_TYPE (t
))
4375 return error_mark_node
;
4380 case REINTERPRET_CAST_EXPR
:
4381 case CONST_CAST_EXPR
:
4382 case STATIC_CAST_EXPR
:
4383 case DYNAMIC_CAST_EXPR
:
4388 case PSEUDO_DTOR_EXPR
:
4390 return error_mark_node
;
4397 /* We didn't find any template parameters we liked. */
4401 /* For each TEMPLATE_TYPE_PARM, TEMPLATE_TEMPLATE_PARM,
4402 BOUND_TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX in T,
4403 call FN with the parameter and the DATA.
4404 If FN returns non-zero, the iteration is terminated, and
4405 for_each_template_parm returns 1. Otherwise, the iteration
4406 continues. If FN never returns a non-zero value, the value
4407 returned by for_each_template_parm is 0. If FN is NULL, it is
4408 considered to be the function which always returns 1. */
4411 for_each_template_parm (t
, fn
, data
)
4416 struct pair_fn_data pfd
;
4422 /* Walk the tree. (Conceptually, we would like to walk without
4423 duplicates, but for_each_template_parm_r recursively calls
4424 for_each_template_parm, so we would need to reorganize a fair
4425 bit to use walk_tree_without_duplicates.) */
4426 return walk_tree (&t
,
4427 for_each_template_parm_r
,
4433 uses_template_parms (t
)
4436 return for_each_template_parm (t
, 0, 0);
4439 static int tinst_depth
;
4440 extern int max_tinst_depth
;
4441 #ifdef GATHER_STATISTICS
4444 static int tinst_level_tick
;
4445 static int last_template_error_tick
;
4447 /* We're starting to instantiate D; record the template instantiation context
4448 for diagnostics and to restore it later. */
4451 push_tinst_level (d
)
4456 if (tinst_depth
>= max_tinst_depth
)
4458 /* If the instantiation in question still has unbound template parms,
4459 we don't really care if we can't instantiate it, so just return.
4460 This happens with base instantiation for implicit `typename'. */
4461 if (uses_template_parms (d
))
4464 last_template_error_tick
= tinst_level_tick
;
4465 cp_error ("template instantiation depth exceeds maximum of %d (use -ftemplate-depth-NN to increase the maximum) instantiating `%D'",
4466 max_tinst_depth
, d
);
4468 print_instantiation_context ();
4473 new = build_expr_wfl (d
, input_filename
, lineno
, 0);
4474 TREE_CHAIN (new) = current_tinst_level
;
4475 current_tinst_level
= new;
4478 #ifdef GATHER_STATISTICS
4479 if (tinst_depth
> depth_reached
)
4480 depth_reached
= tinst_depth
;
4487 /* We're done instantiating this template; return to the instantiation
4493 tree old
= current_tinst_level
;
4495 /* Restore the filename and line number stashed away when we started
4496 this instantiation. */
4497 lineno
= TINST_LINE (old
);
4498 input_filename
= TINST_FILE (old
);
4499 extract_interface_info ();
4501 current_tinst_level
= TREE_CHAIN (old
);
4506 /* We're instantiating a deferred template; restore the template
4507 instantiation context in which the instantiation was requested, which
4508 is one step out from LEVEL. */
4511 reopen_tinst_level (level
)
4517 for (t
= level
; t
; t
= TREE_CHAIN (t
))
4520 current_tinst_level
= level
;
4524 /* Return the outermost template instantiation context, for use with
4525 -falt-external-templates. */
4530 tree p
= current_tinst_level
;
4533 for (; TREE_CHAIN (p
) ; p
= TREE_CHAIN (p
))
4538 /* DECL is a friend FUNCTION_DECL or TEMPLATE_DECL. ARGS is the
4539 vector of template arguments, as for tsubst.
4541 Returns an appropriate tsubst'd friend declaration. */
4544 tsubst_friend_function (decl
, args
)
4550 const char *file
= input_filename
;
4552 lineno
= DECL_SOURCE_LINE (decl
);
4553 input_filename
= DECL_SOURCE_FILE (decl
);
4555 if (TREE_CODE (decl
) == FUNCTION_DECL
4556 && DECL_TEMPLATE_INSTANTIATION (decl
)
4557 && TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
4558 /* This was a friend declared with an explicit template
4559 argument list, e.g.:
4563 to indicate that f was a template instantiation, not a new
4564 function declaration. Now, we have to figure out what
4565 instantiation of what template. */
4567 tree template_id
, arglist
, fns
;
4570 tree ns
= CP_DECL_CONTEXT (TYPE_MAIN_DECL (current_class_type
));
4572 /* Friend functions are looked up in the containing namespace scope.
4573 We must enter that scope, to avoid finding member functions of the
4574 current cless with same name. */
4575 push_nested_namespace (ns
);
4576 fns
= tsubst_expr (DECL_TI_TEMPLATE (decl
), args
,
4577 /*complain=*/1, NULL_TREE
);
4578 pop_nested_namespace (ns
);
4579 arglist
= tsubst (DECL_TI_ARGS (decl
), args
,
4580 /*complain=*/1, NULL_TREE
);
4581 template_id
= lookup_template_function (fns
, arglist
);
4583 new_friend
= tsubst (decl
, args
, /*complain=*/1, NULL_TREE
);
4584 tmpl
= determine_specialization (template_id
, new_friend
,
4586 /*need_member_template=*/0);
4587 new_friend
= instantiate_template (tmpl
, new_args
);
4591 new_friend
= tsubst (decl
, args
, /*complain=*/1, NULL_TREE
);
4593 /* The NEW_FRIEND will look like an instantiation, to the
4594 compiler, but is not an instantiation from the point of view of
4595 the language. For example, we might have had:
4597 template <class T> struct S {
4598 template <class U> friend void f(T, U);
4601 Then, in S<int>, template <class U> void f(int, U) is not an
4602 instantiation of anything. */
4603 DECL_USE_TEMPLATE (new_friend
) = 0;
4604 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
4606 DECL_USE_TEMPLATE (DECL_TEMPLATE_RESULT (new_friend
)) = 0;
4607 DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (new_friend
))
4608 = DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (decl
));
4611 /* The mangled name for the NEW_FRIEND is incorrect. The function
4612 is not a template instantiation and should not be mangled like
4613 one. Therefore, we forget the mangling here; we'll recompute it
4614 later if we need it. */
4615 if (TREE_CODE (new_friend
) != TEMPLATE_DECL
)
4617 SET_DECL_RTL (new_friend
, NULL_RTX
);
4618 SET_DECL_ASSEMBLER_NAME (new_friend
, NULL_TREE
);
4621 if (DECL_NAMESPACE_SCOPE_P (new_friend
))
4624 tree new_friend_template_info
;
4625 tree new_friend_result_template_info
;
4627 int new_friend_is_defn
;
4629 /* We must save some information from NEW_FRIEND before calling
4630 duplicate decls since that function will free NEW_FRIEND if
4632 new_friend_template_info
= DECL_TEMPLATE_INFO (new_friend
);
4633 if (TREE_CODE (new_friend
) == TEMPLATE_DECL
)
4635 /* This declaration is a `primary' template. */
4636 DECL_PRIMARY_TEMPLATE (new_friend
) = new_friend
;
4639 = DECL_INITIAL (DECL_TEMPLATE_RESULT (new_friend
)) != NULL_TREE
;
4640 new_friend_result_template_info
4641 = DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (new_friend
));
4645 new_friend_is_defn
= DECL_INITIAL (new_friend
) != NULL_TREE
;
4646 new_friend_result_template_info
= NULL_TREE
;
4649 /* Inside pushdecl_namespace_level, we will push into the
4650 current namespace. However, the friend function should go
4651 into the namespace of the template. */
4652 ns
= decl_namespace_context (new_friend
);
4653 push_nested_namespace (ns
);
4654 old_decl
= pushdecl_namespace_level (new_friend
);
4655 pop_nested_namespace (ns
);
4657 if (old_decl
!= new_friend
)
4659 /* This new friend declaration matched an existing
4660 declaration. For example, given:
4662 template <class T> void f(T);
4663 template <class U> class C {
4664 template <class T> friend void f(T) {}
4667 the friend declaration actually provides the definition
4668 of `f', once C has been instantiated for some type. So,
4669 old_decl will be the out-of-class template declaration,
4670 while new_friend is the in-class definition.
4672 But, if `f' was called before this point, the
4673 instantiation of `f' will have DECL_TI_ARGS corresponding
4674 to `T' but not to `U', references to which might appear
4675 in the definition of `f'. Previously, the most general
4676 template for an instantiation of `f' was the out-of-class
4677 version; now it is the in-class version. Therefore, we
4678 run through all specialization of `f', adding to their
4679 DECL_TI_ARGS appropriately. In particular, they need a
4680 new set of outer arguments, corresponding to the
4681 arguments for this class instantiation.
4683 The same situation can arise with something like this:
4686 template <class T> class C {
4690 when `C<int>' is instantiated. Now, `f(int)' is defined
4693 if (!new_friend_is_defn
)
4694 /* On the other hand, if the in-class declaration does
4695 *not* provide a definition, then we don't want to alter
4696 existing definitions. We can just leave everything
4701 /* Overwrite whatever template info was there before, if
4702 any, with the new template information pertaining to
4704 DECL_TEMPLATE_INFO (old_decl
) = new_friend_template_info
;
4706 if (TREE_CODE (old_decl
) != TEMPLATE_DECL
)
4707 /* duplicate_decls will take care of this case. */
4712 tree new_friend_args
;
4714 DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (old_decl
))
4715 = new_friend_result_template_info
;
4717 new_friend_args
= TI_ARGS (new_friend_template_info
);
4718 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (old_decl
);
4722 tree spec
= TREE_VALUE (t
);
4725 = add_outermost_template_args (new_friend_args
,
4726 DECL_TI_ARGS (spec
));
4729 /* Now, since specializations are always supposed to
4730 hang off of the most general template, we must move
4732 t
= most_general_template (old_decl
);
4735 DECL_TEMPLATE_SPECIALIZATIONS (t
)
4736 = chainon (DECL_TEMPLATE_SPECIALIZATIONS (t
),
4737 DECL_TEMPLATE_SPECIALIZATIONS (old_decl
));
4738 DECL_TEMPLATE_SPECIALIZATIONS (old_decl
) = NULL_TREE
;
4743 /* The information from NEW_FRIEND has been merged into OLD_DECL
4744 by duplicate_decls. */
4745 new_friend
= old_decl
;
4748 else if (COMPLETE_TYPE_P (DECL_CONTEXT (new_friend
)))
4750 /* Check to see that the declaration is really present, and,
4751 possibly obtain an improved declaration. */
4752 tree fn
= check_classfn (DECL_CONTEXT (new_friend
),
4761 input_filename
= file
;
4765 /* FRIEND_TMPL is a friend TEMPLATE_DECL. ARGS is the vector of
4766 template arguments, as for tsubst.
4768 Returns an appropriate tsubst'd friend type or error_mark_node on
4772 tsubst_friend_class (friend_tmpl
, args
)
4779 /* First, we look for a class template. */
4780 tmpl
= lookup_name (DECL_NAME (friend_tmpl
), /*prefer_type=*/0);
4782 /* But, if we don't find one, it might be because we're in a
4783 situation like this:
4791 Here, in the scope of (say) S<int>, `S' is bound to a TYPE_DECL
4792 for `S<int>', not the TEMPLATE_DECL. */
4793 if (!tmpl
|| !DECL_CLASS_TEMPLATE_P (tmpl
))
4795 tmpl
= lookup_name (DECL_NAME (friend_tmpl
), /*prefer_type=*/1);
4796 tmpl
= maybe_get_template_decl_from_type_decl (tmpl
);
4799 if (tmpl
&& DECL_CLASS_TEMPLATE_P (tmpl
))
4801 /* The friend template has already been declared. Just
4802 check to see that the declarations match, and install any new
4803 default parameters. We must tsubst the default parameters,
4804 of course. We only need the innermost template parameters
4805 because that is all that redeclare_class_template will look
4808 = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_tmpl
),
4809 args
, /*complain=*/1);
4811 return error_mark_node
;
4812 redeclare_class_template (TREE_TYPE (tmpl
), parms
);
4813 friend_type
= TREE_TYPE (tmpl
);
4817 /* The friend template has not already been declared. In this
4818 case, the instantiation of the template class will cause the
4819 injection of this template into the global scope. */
4820 tmpl
= tsubst (friend_tmpl
, args
, /*complain=*/1, NULL_TREE
);
4822 /* The new TMPL is not an instantiation of anything, so we
4823 forget its origins. We don't reset CLASSTYPE_TI_TEMPLATE for
4824 the new type because that is supposed to be the corresponding
4825 template decl, i.e., TMPL. */
4826 DECL_USE_TEMPLATE (tmpl
) = 0;
4827 DECL_TEMPLATE_INFO (tmpl
) = NULL_TREE
;
4828 CLASSTYPE_USE_TEMPLATE (TREE_TYPE (tmpl
)) = 0;
4830 /* Inject this template into the global scope. */
4831 friend_type
= TREE_TYPE (pushdecl_top_level (tmpl
));
4838 instantiate_class_template (type
)
4841 tree
template, args
, pattern
, t
;
4844 if (type
== error_mark_node
)
4845 return error_mark_node
;
4847 if (TYPE_BEING_DEFINED (type
) || COMPLETE_TYPE_P (type
))
4850 /* Figure out which template is being instantiated. */
4851 template = most_general_template (CLASSTYPE_TI_TEMPLATE (type
));
4852 my_friendly_assert (TREE_CODE (template) == TEMPLATE_DECL
, 279);
4854 /* Figure out which arguments are being used to do the
4856 args
= CLASSTYPE_TI_ARGS (type
);
4857 PARTIAL_INSTANTIATION_P (type
) = uses_template_parms (args
);
4859 if (pedantic
&& PARTIAL_INSTANTIATION_P (type
))
4860 /* If this is a partial instantiation, then we can't instantiate
4861 the type; there's no telling whether or not one of the
4862 template parameters might eventually be instantiated to some
4863 value that results in a specialization being used. For
4875 Now, the `S<U>' in `f<int>' is the specialization, not an
4876 instantiation of the original template. */
4879 /* Determine what specialization of the original template to
4881 if (PARTIAL_INSTANTIATION_P (type
))
4882 /* There's no telling which specialization is appropriate at this
4883 point. Since all peeking at the innards of this partial
4884 instantiation are extensions (like the "implicit typename"
4885 extension, which allows users to omit the keyword `typename' on
4886 names that are declared as types in template base classes), we
4887 are free to do what we please.
4889 Trying to figure out which partial instantiation to use can
4890 cause a crash. (Some of the template arguments don't even have
4891 types.) So, we just use the most general version. */
4895 t
= most_specialized_class (template, args
);
4897 if (t
== error_mark_node
)
4899 const char *str
= "candidates are:";
4900 cp_error ("ambiguous class template instantiation for `%#T'", type
);
4901 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (template); t
;
4904 if (get_class_bindings (TREE_VALUE (t
), TREE_PURPOSE (t
),
4907 cp_error_at ("%s %+#T", str
, TREE_TYPE (t
));
4911 TYPE_BEING_DEFINED (type
) = 1;
4912 return error_mark_node
;
4917 pattern
= TREE_TYPE (t
);
4919 pattern
= TREE_TYPE (template);
4921 /* If the template we're instantiating is incomplete, then clearly
4922 there's nothing we can do. */
4923 if (!COMPLETE_TYPE_P (pattern
))
4926 /* If this is a partial instantiation, don't tsubst anything. We will
4927 only use this type for implicit typename, so the actual contents don't
4928 matter. All that matters is whether a particular name is a type. */
4929 if (PARTIAL_INSTANTIATION_P (type
))
4931 /* The fields set here must be kept in sync with those cleared
4932 in begin_class_definition. */
4933 TYPE_BINFO_BASETYPES (type
) = TYPE_BINFO_BASETYPES (pattern
);
4934 TYPE_FIELDS (type
) = TYPE_FIELDS (pattern
);
4935 TYPE_METHODS (type
) = TYPE_METHODS (pattern
);
4936 CLASSTYPE_TAGS (type
) = CLASSTYPE_TAGS (pattern
);
4937 CLASSTYPE_VBASECLASSES (type
) = CLASSTYPE_VBASECLASSES (pattern
);
4939 /* Pretend that the type is complete, so that we will look
4940 inside it during name lookup and such. */
4941 TYPE_SIZE (type
) = bitsize_zero_node
;
4945 /* If we've recursively instantiated too many templates, stop. */
4946 if (! push_tinst_level (type
))
4949 /* Now we're really doing the instantiation. Mark the type as in
4950 the process of being defined. */
4951 TYPE_BEING_DEFINED (type
) = 1;
4953 maybe_push_to_top_level (uses_template_parms (type
));
4957 /* This TYPE is actually a instantiation of of a partial
4958 specialization. We replace the innermost set of ARGS with
4959 the arguments appropriate for substitution. For example,
4962 template <class T> struct S {};
4963 template <class T> struct S<T*> {};
4965 and supposing that we are instantiating S<int*>, ARGS will
4966 present be {int*} but we need {int}. */
4968 = get_class_bindings (TREE_VALUE (t
), TREE_PURPOSE (t
),
4971 /* If there were multiple levels in ARGS, replacing the
4972 innermost level would alter CLASSTYPE_TI_ARGS, which we don't
4973 want, so we make a copy first. */
4974 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
4976 args
= copy_node (args
);
4977 SET_TMPL_ARGS_LEVEL (args
, TMPL_ARGS_DEPTH (args
), inner_args
);
4983 if (flag_external_templates
)
4985 if (flag_alt_external_templates
)
4987 CLASSTYPE_INTERFACE_ONLY (type
) = interface_only
;
4988 SET_CLASSTYPE_INTERFACE_UNKNOWN_X (type
, interface_unknown
);
4992 CLASSTYPE_INTERFACE_ONLY (type
) = CLASSTYPE_INTERFACE_ONLY (pattern
);
4993 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
4994 (type
, CLASSTYPE_INTERFACE_UNKNOWN (pattern
));
4999 SET_CLASSTYPE_INTERFACE_UNKNOWN (type
);
5002 TYPE_HAS_CONSTRUCTOR (type
) = TYPE_HAS_CONSTRUCTOR (pattern
);
5003 TYPE_HAS_DESTRUCTOR (type
) = TYPE_HAS_DESTRUCTOR (pattern
);
5004 TYPE_OVERLOADS_CALL_EXPR (type
) = TYPE_OVERLOADS_CALL_EXPR (pattern
);
5005 TYPE_OVERLOADS_ARRAY_REF (type
) = TYPE_OVERLOADS_ARRAY_REF (pattern
);
5006 TYPE_OVERLOADS_ARROW (type
) = TYPE_OVERLOADS_ARROW (pattern
);
5007 TYPE_HAS_NEW_OPERATOR (type
) = TYPE_HAS_NEW_OPERATOR (pattern
);
5008 TYPE_HAS_ARRAY_NEW_OPERATOR (type
) = TYPE_HAS_ARRAY_NEW_OPERATOR (pattern
);
5009 TYPE_GETS_DELETE (type
) = TYPE_GETS_DELETE (pattern
);
5010 TYPE_HAS_ASSIGN_REF (type
) = TYPE_HAS_ASSIGN_REF (pattern
);
5011 TYPE_HAS_CONST_ASSIGN_REF (type
) = TYPE_HAS_CONST_ASSIGN_REF (pattern
);
5012 TYPE_HAS_ABSTRACT_ASSIGN_REF (type
) = TYPE_HAS_ABSTRACT_ASSIGN_REF (pattern
);
5013 TYPE_HAS_INIT_REF (type
) = TYPE_HAS_INIT_REF (pattern
);
5014 TYPE_HAS_CONST_INIT_REF (type
) = TYPE_HAS_CONST_INIT_REF (pattern
);
5015 TYPE_HAS_DEFAULT_CONSTRUCTOR (type
) = TYPE_HAS_DEFAULT_CONSTRUCTOR (pattern
);
5016 TYPE_HAS_CONVERSION (type
) = TYPE_HAS_CONVERSION (pattern
);
5017 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (type
)
5018 = TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (pattern
);
5019 TYPE_USES_MULTIPLE_INHERITANCE (type
)
5020 = TYPE_USES_MULTIPLE_INHERITANCE (pattern
);
5021 TYPE_USES_VIRTUAL_BASECLASSES (type
)
5022 = TYPE_USES_VIRTUAL_BASECLASSES (pattern
);
5023 TYPE_PACKED (type
) = TYPE_PACKED (pattern
);
5024 TYPE_ALIGN (type
) = TYPE_ALIGN (pattern
);
5025 TYPE_USER_ALIGN (type
) = TYPE_USER_ALIGN (pattern
);
5026 TYPE_FOR_JAVA (type
) = TYPE_FOR_JAVA (pattern
); /* For libjava's JArray<T> */
5027 if (ANON_AGGR_TYPE_P (pattern
))
5028 SET_ANON_AGGR_TYPE_P (type
);
5030 if (TYPE_BINFO_BASETYPES (pattern
))
5032 tree base_list
= NULL_TREE
;
5033 tree pbases
= TYPE_BINFO_BASETYPES (pattern
);
5036 /* Substitute into each of the bases to determine the actual
5038 for (i
= 0; i
< TREE_VEC_LENGTH (pbases
); ++i
)
5044 pbase
= TREE_VEC_ELT (pbases
, i
);
5046 /* Substitute to figure out the base class. */
5047 base
= tsubst (BINFO_TYPE (pbase
), args
,
5048 /*complain=*/1, NULL_TREE
);
5049 if (base
== error_mark_node
)
5052 /* Calculate the correct access node. */
5053 if (TREE_VIA_VIRTUAL (pbase
))
5055 if (TREE_VIA_PUBLIC (pbase
))
5056 access
= access_public_virtual_node
;
5057 else if (TREE_VIA_PROTECTED (pbase
))
5058 access
= access_protected_virtual_node
;
5060 access
= access_private_virtual_node
;
5064 if (TREE_VIA_PUBLIC (pbase
))
5065 access
= access_public_node
;
5066 else if (TREE_VIA_PROTECTED (pbase
))
5067 access
= access_protected_node
;
5069 access
= access_private_node
;
5072 base_list
= tree_cons (access
, base
, base_list
);
5075 /* The list is now in reverse order; correct that. */
5076 base_list
= nreverse (base_list
);
5078 /* Now call xref_basetypes to set up all the base-class
5080 xref_basetypes (TREE_CODE (pattern
) == RECORD_TYPE
5081 ? (CLASSTYPE_DECLARED_CLASS (pattern
)
5082 ? class_type_node
: record_type_node
)
5084 DECL_NAME (TYPE_NAME (pattern
)),
5089 /* Now that our base classes are set up, enter the scope of the
5090 class, so that name lookups into base classes, etc. will work
5091 correctly. This is precisely analogous to what we do in
5092 begin_class_definition when defining an ordinary non-template
5094 pushclass (type
, 1);
5096 for (t
= CLASSTYPE_TAGS (pattern
); t
; t
= TREE_CHAIN (t
))
5098 tree tag
= TREE_VALUE (t
);
5099 tree name
= TYPE_IDENTIFIER (tag
);
5102 newtag
= tsubst (tag
, args
, /*complain=*/1, NULL_TREE
);
5103 my_friendly_assert (newtag
!= error_mark_node
, 20010206);
5104 if (TREE_CODE (newtag
) != ENUMERAL_TYPE
)
5106 if (TYPE_LANG_SPECIFIC (tag
) && CLASSTYPE_IS_TEMPLATE (tag
))
5107 /* Unfortunately, lookup_template_class sets
5108 CLASSTYPE_IMPLICIT_INSTANTIATION for a partial
5109 instantiation (i.e., for the type of a member template
5110 class nested within a template class.) This behavior is
5111 required for maybe_process_partial_specialization to work
5112 correctly, but is not accurate in this case; the TAG is not
5113 an instantiation of anything. (The corresponding
5114 TEMPLATE_DECL is an instantiation, but the TYPE is not.) */
5115 CLASSTYPE_USE_TEMPLATE (newtag
) = 0;
5117 /* Now, we call pushtag to put this NEWTAG into the scope of
5118 TYPE. We first set up the IDENTIFIER_TYPE_VALUE to avoid
5119 pushtag calling push_template_decl. We don't have to do
5120 this for enums because it will already have been done in
5123 SET_IDENTIFIER_TYPE_VALUE (name
, newtag
);
5124 pushtag (name
, newtag
, /*globalize=*/0);
5128 /* Don't replace enum constants here. */
5129 for (t
= TYPE_FIELDS (pattern
); t
; t
= TREE_CHAIN (t
))
5130 if (TREE_CODE (t
) != CONST_DECL
)
5134 /* The the file and line for this declaration, to assist in
5135 error message reporting. Since we called push_tinst_level
5136 above, we don't need to restore these. */
5137 lineno
= DECL_SOURCE_LINE (t
);
5138 input_filename
= DECL_SOURCE_FILE (t
);
5140 r
= tsubst (t
, args
, /*complain=*/1, NULL_TREE
);
5141 if (TREE_CODE (r
) == VAR_DECL
)
5145 if (DECL_INITIALIZED_IN_CLASS_P (r
))
5146 init
= tsubst_expr (DECL_INITIAL (t
), args
,
5147 /*complain=*/1, NULL_TREE
);
5151 finish_static_data_member_decl (r
, init
,
5152 /*asmspec_tree=*/NULL_TREE
,
5155 if (DECL_INITIALIZED_IN_CLASS_P (r
))
5156 check_static_variable_definition (r
, TREE_TYPE (r
));
5159 /* R will have a TREE_CHAIN if and only if it has already been
5160 processed by finish_member_declaration. This can happen
5161 if, for example, it is a TYPE_DECL for a class-scoped
5162 ENUMERAL_TYPE; such a thing will already have been added to
5163 the field list by tsubst_enum above. */
5164 if (!TREE_CHAIN (r
))
5166 set_current_access_from_decl (r
);
5167 finish_member_declaration (r
);
5171 /* Set up the list (TYPE_METHODS) and vector (CLASSTYPE_METHOD_VEC)
5172 for this instantiation. */
5173 for (t
= TYPE_METHODS (pattern
); t
; t
= TREE_CHAIN (t
))
5175 tree r
= tsubst (t
, args
, /*complain=*/1, NULL_TREE
);
5176 set_current_access_from_decl (r
);
5177 finish_member_declaration (r
);
5180 /* Construct the DECL_FRIENDLIST for the new class type. */
5181 typedecl
= TYPE_MAIN_DECL (type
);
5182 for (t
= DECL_FRIENDLIST (TYPE_MAIN_DECL (pattern
));
5188 for (friends
= TREE_VALUE (t
);
5189 friends
!= NULL_TREE
;
5190 friends
= TREE_CHAIN (friends
))
5191 if (TREE_PURPOSE (friends
) == error_mark_node
)
5193 tsubst_friend_function (TREE_VALUE (friends
),
5196 my_friendly_abort (20000216);
5199 for (t
= CLASSTYPE_FRIEND_CLASSES (pattern
);
5203 tree friend_type
= TREE_VALUE (t
);
5204 tree new_friend_type
;
5206 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
5207 new_friend_type
= tsubst_friend_class (friend_type
, args
);
5208 else if (uses_template_parms (friend_type
))
5209 new_friend_type
= tsubst (friend_type
, args
, /*complain=*/1,
5213 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (friend_type
));
5215 /* The call to xref_tag_from_type does injection for friend
5217 push_nested_namespace (ns
);
5219 xref_tag_from_type (friend_type
, NULL_TREE
, 1);
5220 pop_nested_namespace (ns
);
5223 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
5224 /* Trick make_friend_class into realizing that the friend
5225 we're adding is a template, not an ordinary class. It's
5226 important that we use make_friend_class since it will
5227 perform some error-checking and output cross-reference
5229 ++processing_template_decl
;
5231 if (new_friend_type
!= error_mark_node
)
5232 make_friend_class (type
, new_friend_type
);
5234 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
5235 --processing_template_decl
;
5238 for (t
= TYPE_FIELDS (type
); t
; t
= TREE_CHAIN (t
))
5239 if (TREE_CODE (t
) == FIELD_DECL
)
5241 TREE_TYPE (t
) = complete_type (TREE_TYPE (t
));
5242 require_complete_type (t
);
5245 /* Set the file and line number information to whatever is given for
5246 the class itself. This puts error messages involving generated
5247 implicit functions at a predictable point, and the same point
5248 that would be used for non-template classes. */
5249 lineno
= DECL_SOURCE_LINE (typedecl
);
5250 input_filename
= DECL_SOURCE_FILE (typedecl
);
5252 unreverse_member_declarations (type
);
5253 finish_struct_1 (type
);
5254 CLASSTYPE_GOT_SEMICOLON (type
) = 1;
5256 /* Clear this now so repo_template_used is happy. */
5257 TYPE_BEING_DEFINED (type
) = 0;
5258 repo_template_used (type
);
5260 /* Now that the class is complete, instantiate default arguments for
5261 any member functions. We don't do this earlier because the
5262 default arguments may reference members of the class. */
5263 if (!PRIMARY_TEMPLATE_P (template))
5264 for (t
= TYPE_METHODS (type
); t
; t
= TREE_CHAIN (t
))
5265 if (TREE_CODE (t
) == FUNCTION_DECL
5266 /* Implicitly generated member functions will not have template
5267 information; they are not instantiations, but instead are
5268 created "fresh" for each instantiation. */
5269 && DECL_TEMPLATE_INFO (t
))
5270 tsubst_default_arguments (t
);
5273 pop_from_top_level ();
5283 if (t1
== NULL_TREE
)
5284 return t2
== NULL_TREE
;
5285 if (t2
== NULL_TREE
)
5287 /* Don't care if one declares its arg const and the other doesn't -- the
5288 main variant of the arg type is all that matters. */
5289 if (TYPE_MAIN_VARIANT (TREE_VALUE (t1
))
5290 != TYPE_MAIN_VARIANT (TREE_VALUE (t2
)))
5292 return list_eq (TREE_CHAIN (t1
), TREE_CHAIN (t2
));
5295 /* If arg is a non-type template parameter that does not depend on template
5296 arguments, fold it like we weren't in the body of a template. */
5299 maybe_fold_nontype_arg (arg
)
5302 if (arg
&& !TYPE_P (arg
) && !uses_template_parms (arg
))
5304 /* Sometimes, one of the args was an expression involving a
5305 template constant parameter, like N - 1. Now that we've
5306 tsubst'd, we might have something like 2 - 1. This will
5307 confuse lookup_template_class, so we do constant folding
5308 here. We have to unset processing_template_decl, to
5309 fool build_expr_from_tree() into building an actual
5312 /* If the TREE_TYPE of ARG is not NULL_TREE, ARG is already
5313 as simple as it's going to get, and trying to reprocess
5314 the trees will break. */
5315 if (!TREE_TYPE (arg
))
5317 int saved_processing_template_decl
= processing_template_decl
;
5318 processing_template_decl
= 0;
5319 arg
= build_expr_from_tree (arg
);
5320 processing_template_decl
= saved_processing_template_decl
;
5328 /* Substitute ARGS into the vector of template arguments T. */
5331 tsubst_template_arg_vector (t
, args
, complain
)
5336 int len
= TREE_VEC_LENGTH (t
), need_new
= 0, i
;
5337 tree
*elts
= (tree
*) alloca (len
* sizeof (tree
));
5339 memset ((char *) elts
, 0, len
* sizeof (tree
));
5341 for (i
= 0; i
< len
; i
++)
5343 if (TREE_VEC_ELT (t
, i
) != NULL_TREE
5344 && TREE_CODE (TREE_VEC_ELT (t
, i
)) == TREE_VEC
)
5345 elts
[i
] = tsubst_template_arg_vector (TREE_VEC_ELT (t
, i
),
5348 elts
[i
] = maybe_fold_nontype_arg
5349 (tsubst_expr (TREE_VEC_ELT (t
, i
), args
, complain
,
5352 if (elts
[i
] == error_mark_node
)
5353 return error_mark_node
;
5355 if (elts
[i
] != TREE_VEC_ELT (t
, i
))
5362 t
= make_tree_vec (len
);
5363 for (i
= 0; i
< len
; i
++)
5364 TREE_VEC_ELT (t
, i
) = elts
[i
];
5369 /* Return the result of substituting ARGS into the template parameters
5370 given by PARMS. If there are m levels of ARGS and m + n levels of
5371 PARMS, then the result will contain n levels of PARMS. For
5372 example, if PARMS is `template <class T> template <class U>
5373 template <T*, U, class V>' and ARGS is {{int}, {double}} then the
5374 result will be `template <int*, double, class V>'. */
5377 tsubst_template_parms (parms
, args
, complain
)
5385 for (new_parms
= &r
;
5386 TMPL_PARMS_DEPTH (parms
) > TMPL_ARGS_DEPTH (args
);
5387 new_parms
= &(TREE_CHAIN (*new_parms
)),
5388 parms
= TREE_CHAIN (parms
))
5391 make_tree_vec (TREE_VEC_LENGTH (TREE_VALUE (parms
)));
5394 for (i
= 0; i
< TREE_VEC_LENGTH (new_vec
); ++i
)
5396 tree default_value
=
5397 TREE_PURPOSE (TREE_VEC_ELT (TREE_VALUE (parms
), i
));
5399 TREE_VALUE (TREE_VEC_ELT (TREE_VALUE (parms
), i
));
5401 TREE_VEC_ELT (new_vec
, i
)
5402 = build_tree_list (maybe_fold_nontype_arg (
5403 tsubst_expr (default_value
, args
, complain
,
5405 tsubst (parm_decl
, args
, complain
,
5410 tree_cons (size_int (TMPL_PARMS_DEPTH (parms
)
5411 - TMPL_ARGS_DEPTH (args
)),
5412 new_vec
, NULL_TREE
);
5418 /* Substitute the ARGS into the indicated aggregate (or enumeration)
5419 type T. If T is not an aggregate or enumeration type, it is
5420 handled as if by tsubst. IN_DECL is as for tsubst. If
5421 ENTERING_SCOPE is non-zero, T is the context for a template which
5422 we are presently tsubst'ing. Return the substituted value. */
5425 tsubst_aggr_type (t
, args
, complain
, in_decl
, entering_scope
)
5435 switch (TREE_CODE (t
))
5438 if (TYPE_PTRMEMFUNC_P (t
))
5440 tree r
= build_ptrmemfunc_type
5441 (tsubst (TYPE_PTRMEMFUNC_FN_TYPE (t
), args
, complain
, in_decl
));
5442 return cp_build_qualified_type_real (r
, TYPE_QUALS (t
),
5446 /* else fall through */
5449 if (TYPE_TEMPLATE_INFO (t
))
5455 /* First, determine the context for the type we are looking
5457 if (TYPE_CONTEXT (t
) != NULL_TREE
)
5458 context
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
,
5460 in_decl
, /*entering_scope=*/1);
5462 context
= NULL_TREE
;
5464 /* Then, figure out what arguments are appropriate for the
5465 type we are trying to find. For example, given:
5467 template <class T> struct S;
5468 template <class T, class U> void f(T, U) { S<U> su; }
5470 and supposing that we are instantiating f<int, double>,
5471 then our ARGS will be {int, double}, but, when looking up
5472 S we only want {double}. */
5473 argvec
= tsubst_template_arg_vector (TYPE_TI_ARGS (t
), args
,
5475 if (argvec
== error_mark_node
)
5476 return error_mark_node
;
5478 r
= lookup_template_class (t
, argvec
, in_decl
, context
,
5479 entering_scope
, complain
);
5481 return cp_build_qualified_type_real (r
, TYPE_QUALS (t
),
5485 /* This is not a template type, so there's nothing to do. */
5489 return tsubst (t
, args
, complain
, in_decl
);
5493 /* Substitute into the default argument ARG (a default argument for
5494 FN), which has the indicated TYPE. */
5497 tsubst_default_argument (fn
, type
, arg
)
5502 /* This default argument came from a template. Instantiate the
5503 default argument here, not in tsubst. In the case of
5512 we must be careful to do name lookup in the scope of S<T>,
5513 rather than in the current class. */
5514 if (DECL_CLASS_SCOPE_P (fn
))
5515 pushclass (DECL_CONTEXT (fn
), 2);
5517 arg
= tsubst_expr (arg
, DECL_TI_ARGS (fn
), /*complain=*/1, NULL_TREE
);
5519 if (DECL_CLASS_SCOPE_P (fn
))
5522 /* Make sure the default argument is reasonable. */
5523 arg
= check_default_argument (type
, arg
);
5528 /* Substitute into all the default arguments for FN. */
5531 tsubst_default_arguments (fn
)
5537 tmpl_args
= DECL_TI_ARGS (fn
);
5539 /* If this function is not yet instantiated, we certainly don't need
5540 its default arguments. */
5541 if (uses_template_parms (tmpl_args
))
5544 for (arg
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
5546 arg
= TREE_CHAIN (arg
))
5547 if (TREE_PURPOSE (arg
))
5548 TREE_PURPOSE (arg
) = tsubst_default_argument (fn
,
5550 TREE_PURPOSE (arg
));
5553 /* Substitute the ARGS into the T, which is a _DECL. TYPE is the
5554 (already computed) substitution of ARGS into TREE_TYPE (T), if
5555 appropriate. Return the result of the substitution. */
5558 tsubst_decl (t
, args
, type
)
5564 const char *saved_filename
;
5568 /* Set the filename and linenumber to improve error-reporting. */
5569 saved_lineno
= lineno
;
5570 saved_filename
= input_filename
;
5571 lineno
= DECL_SOURCE_LINE (t
);
5572 input_filename
= DECL_SOURCE_FILE (t
);
5574 switch (TREE_CODE (t
))
5578 /* We can get here when processing a member template function
5579 of a template class. */
5580 tree decl
= DECL_TEMPLATE_RESULT (t
);
5582 int is_template_template_parm
= DECL_TEMPLATE_TEMPLATE_PARM_P (t
);
5584 if (!is_template_template_parm
)
5586 /* We might already have an instance of this template.
5587 The ARGS are for the surrounding class type, so the
5588 full args contain the tsubst'd args for the context,
5589 plus the innermost args from the template decl. */
5590 tree tmpl_args
= DECL_CLASS_TEMPLATE_P (t
)
5591 ? CLASSTYPE_TI_ARGS (TREE_TYPE (t
))
5592 : DECL_TI_ARGS (DECL_TEMPLATE_RESULT (t
));
5595 full_args
= tsubst_template_arg_vector (tmpl_args
, args
,
5598 /* tsubst_template_arg_vector doesn't copy the vector if
5599 nothing changed. But, *something* should have
5601 my_friendly_assert (full_args
!= tmpl_args
, 0);
5603 spec
= retrieve_specialization (t
, full_args
);
5604 if (spec
!= NULL_TREE
)
5611 /* Make a new template decl. It will be similar to the
5612 original, but will record the current template arguments.
5613 We also create a new function declaration, which is just
5614 like the old one, but points to this new template, rather
5615 than the old one. */
5617 my_friendly_assert (DECL_LANG_SPECIFIC (r
) != 0, 0);
5618 TREE_CHAIN (r
) = NULL_TREE
;
5620 if (is_template_template_parm
)
5622 tree new_decl
= tsubst (decl
, args
, /*complain=*/1, in_decl
);
5623 DECL_TEMPLATE_RESULT (r
) = new_decl
;
5624 TREE_TYPE (r
) = TREE_TYPE (new_decl
);
5629 = tsubst_aggr_type (DECL_CONTEXT (t
), args
,
5630 /*complain=*/1, in_decl
,
5631 /*entering_scope=*/1);
5632 DECL_VIRTUAL_CONTEXT (r
)
5633 = tsubst_aggr_type (DECL_VIRTUAL_CONTEXT (t
), args
,
5634 /*complain=*/1, in_decl
,
5635 /*entering_scope=*/1);
5636 DECL_TEMPLATE_INFO (r
) = build_tree_list (t
, args
);
5638 if (TREE_CODE (decl
) == TYPE_DECL
)
5640 tree new_type
= tsubst (TREE_TYPE (t
), args
,
5641 /*complain=*/1, in_decl
);
5642 TREE_TYPE (r
) = new_type
;
5643 CLASSTYPE_TI_TEMPLATE (new_type
) = r
;
5644 DECL_TEMPLATE_RESULT (r
) = TYPE_MAIN_DECL (new_type
);
5645 DECL_TI_ARGS (r
) = CLASSTYPE_TI_ARGS (new_type
);
5649 tree new_decl
= tsubst (decl
, args
, /*complain=*/1, in_decl
);
5651 DECL_TEMPLATE_RESULT (r
) = new_decl
;
5652 DECL_TI_TEMPLATE (new_decl
) = r
;
5653 TREE_TYPE (r
) = TREE_TYPE (new_decl
);
5654 DECL_TI_ARGS (r
) = DECL_TI_ARGS (new_decl
);
5657 SET_DECL_IMPLICIT_INSTANTIATION (r
);
5658 DECL_TEMPLATE_INSTANTIATIONS (r
) = NULL_TREE
;
5659 DECL_TEMPLATE_SPECIALIZATIONS (r
) = NULL_TREE
;
5661 /* The template parameters for this new template are all the
5662 template parameters for the old template, except the
5663 outermost level of parameters. */
5664 DECL_TEMPLATE_PARMS (r
)
5665 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t
), args
,
5668 if (PRIMARY_TEMPLATE_P (t
))
5669 DECL_PRIMARY_TEMPLATE (r
) = r
;
5671 /* We don't partially instantiate partial specializations. */
5672 if (TREE_CODE (decl
) == TYPE_DECL
)
5675 /* Record this partial instantiation. */
5676 register_specialization (r
, t
,
5677 DECL_TI_ARGS (DECL_TEMPLATE_RESULT (r
)));
5685 tree argvec
= NULL_TREE
;
5692 /* Nobody should be tsubst'ing into non-template functions. */
5693 my_friendly_assert (DECL_TEMPLATE_INFO (t
) != NULL_TREE
, 0);
5695 if (TREE_CODE (DECL_TI_TEMPLATE (t
)) == TEMPLATE_DECL
)
5699 /* Calculate the most general template of which R is a
5700 specialization, and the complete set of arguments used to
5702 gen_tmpl
= most_general_template (DECL_TI_TEMPLATE (t
));
5704 = tsubst_template_arg_vector (DECL_TI_ARGS
5705 (DECL_TEMPLATE_RESULT (gen_tmpl
)),
5706 args
, /*complain=*/1);
5708 /* Check to see if we already have this specialization. */
5709 spec
= retrieve_specialization (gen_tmpl
, argvec
);
5717 /* We can see more levels of arguments than parameters if
5718 there was a specialization of a member template, like
5721 template <class T> struct S { template <class U> void f(); }
5722 template <> template <class U> void S<int>::f(U);
5724 Here, we'll be substituting into the specialization,
5725 because that's where we can find the code we actually
5726 want to generate, but we'll have enough arguments for
5727 the most general template.
5729 We also deal with the peculiar case:
5731 template <class T> struct S {
5732 template <class U> friend void f();
5734 template <class U> void f() {}
5736 template void f<double>();
5738 Here, the ARGS for the instantiation of will be {int,
5739 double}. But, we only need as many ARGS as there are
5740 levels of template parameters in CODE_PATTERN. We are
5741 careful not to get fooled into reducing the ARGS in
5744 template <class T> struct S { template <class U> void f(U); }
5745 template <class T> template <> void S<T>::f(int) {}
5747 which we can spot because the pattern will be a
5748 specialization in this case. */
5749 args_depth
= TMPL_ARGS_DEPTH (args
);
5751 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (t
)));
5752 if (args_depth
> parms_depth
5753 && !DECL_TEMPLATE_SPECIALIZATION (t
))
5754 args
= get_innermost_template_args (args
, parms_depth
);
5758 /* This special case arises when we have something like this:
5760 template <class T> struct S {
5761 friend void f<int>(int, double);
5764 Here, the DECL_TI_TEMPLATE for the friend declaration
5765 will be a LOOKUP_EXPR or an IDENTIFIER_NODE. We are
5766 being called from tsubst_friend_function, and we want
5767 only to create a new decl (R) with appropriate types so
5768 that we can call determine_specialization. */
5769 my_friendly_assert ((TREE_CODE (DECL_TI_TEMPLATE (t
))
5771 || (TREE_CODE (DECL_TI_TEMPLATE (t
))
5772 == IDENTIFIER_NODE
), 0);
5773 gen_tmpl
= NULL_TREE
;
5776 if (DECL_CLASS_SCOPE_P (t
))
5778 if (DECL_NAME (t
) == constructor_name (DECL_CONTEXT (t
)))
5782 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
,
5784 /*entering_scope=*/1);
5789 ctx
= DECL_CONTEXT (t
);
5791 type
= tsubst (type
, args
, /*complain=*/1, in_decl
);
5792 if (type
== error_mark_node
)
5793 return error_mark_node
;
5795 /* We do NOT check for matching decls pushed separately at this
5796 point, as they may not represent instantiations of this
5797 template, and in any case are considered separate under the
5800 DECL_USE_TEMPLATE (r
) = 0;
5801 TREE_TYPE (r
) = type
;
5802 /* Clear out the mangled name and RTL for the instantiation. */
5803 SET_DECL_ASSEMBLER_NAME (r
, NULL_TREE
);
5804 SET_DECL_RTL (r
, NULL_RTX
);
5806 DECL_CONTEXT (r
) = ctx
;
5807 DECL_VIRTUAL_CONTEXT (r
)
5808 = tsubst_aggr_type (DECL_VIRTUAL_CONTEXT (t
), args
,
5810 /*entering_scope=*/1);
5812 if (member
&& DECL_CONV_FN_P (r
))
5813 /* Type-conversion operator. Reconstruct the name, in
5814 case it's the name of one of the template's parameters. */
5815 DECL_NAME (r
) = mangle_conv_op_name_for_type (TREE_TYPE (type
));
5817 DECL_ARGUMENTS (r
) = tsubst (DECL_ARGUMENTS (t
), args
,
5819 DECL_RESULT (r
) = NULL_TREE
;
5821 TREE_STATIC (r
) = 0;
5822 TREE_PUBLIC (r
) = TREE_PUBLIC (t
);
5823 DECL_EXTERNAL (r
) = 1;
5824 DECL_INTERFACE_KNOWN (r
) = 0;
5825 DECL_DEFER_OUTPUT (r
) = 0;
5826 TREE_CHAIN (r
) = NULL_TREE
;
5827 DECL_PENDING_INLINE_INFO (r
) = 0;
5828 DECL_PENDING_INLINE_P (r
) = 0;
5829 DECL_SAVED_TREE (r
) = NULL_TREE
;
5831 if (DECL_CLONED_FUNCTION (r
))
5833 DECL_CLONED_FUNCTION (r
) = tsubst (DECL_CLONED_FUNCTION (t
),
5834 args
, /*complain=*/1, t
);
5835 TREE_CHAIN (r
) = TREE_CHAIN (DECL_CLONED_FUNCTION (r
));
5836 TREE_CHAIN (DECL_CLONED_FUNCTION (r
)) = r
;
5839 /* Set up the DECL_TEMPLATE_INFO for R. There's no need to do
5840 this in the special friend case mentioned above where
5841 GEN_TMPL is NULL. */
5844 DECL_TEMPLATE_INFO (r
)
5845 = tree_cons (gen_tmpl
, argvec
, NULL_TREE
);
5846 SET_DECL_IMPLICIT_INSTANTIATION (r
);
5847 register_specialization (r
, gen_tmpl
, argvec
);
5849 /* We're not supposed to instantiate default arguments
5850 until they are called, for a template. But, for a
5853 template <class T> void f ()
5854 { extern void g(int i = T()); }
5856 we should do the substitution when the template is
5857 instantiated. We handle the member function case in
5858 instantiate_class_template since the default arguments
5859 might refer to other members of the class. */
5861 && !PRIMARY_TEMPLATE_P (gen_tmpl
)
5862 && !uses_template_parms (argvec
))
5863 tsubst_default_arguments (r
);
5866 /* Copy the list of befriending classes. */
5867 for (friends
= &DECL_BEFRIENDING_CLASSES (r
);
5869 friends
= &TREE_CHAIN (*friends
))
5871 *friends
= copy_node (*friends
);
5872 TREE_VALUE (*friends
) = tsubst (TREE_VALUE (*friends
),
5873 args
, /*complain=*/1,
5877 if (DECL_CONSTRUCTOR_P (r
) || DECL_DESTRUCTOR_P (r
))
5879 maybe_retrofit_in_chrg (r
);
5880 if (DECL_CONSTRUCTOR_P (r
))
5881 grok_ctor_properties (ctx
, r
);
5882 /* If this is an instantiation of a member template, clone it.
5883 If it isn't, that'll be handled by
5884 clone_constructors_and_destructors. */
5885 if (PRIMARY_TEMPLATE_P (gen_tmpl
))
5886 clone_function_decl(r
, /*update_method_vec_p=*/0);
5888 else if (IDENTIFIER_OPNAME_P (DECL_NAME (r
)))
5889 grok_op_properties (r
, DECL_VIRTUAL_P (r
), DECL_FRIEND_P (r
));
5896 TREE_TYPE (r
) = type
;
5897 c_apply_type_quals_to_decl (CP_TYPE_QUALS (type
), r
);
5899 if (TREE_CODE (DECL_INITIAL (r
)) != TEMPLATE_PARM_INDEX
)
5900 DECL_INITIAL (r
) = TREE_TYPE (r
);
5902 DECL_INITIAL (r
) = tsubst (DECL_INITIAL (r
), args
,
5903 /*complain=*/1, in_decl
);
5905 DECL_CONTEXT (r
) = NULL_TREE
;
5906 if (PROMOTE_PROTOTYPES
5907 && INTEGRAL_TYPE_P (type
)
5908 && TYPE_PRECISION (type
) < TYPE_PRECISION (integer_type_node
))
5909 DECL_ARG_TYPE (r
) = integer_type_node
;
5911 TREE_CHAIN (r
) = tsubst (TREE_CHAIN (t
), args
,
5912 /*complain=*/1, TREE_CHAIN (t
));
5919 TREE_TYPE (r
) = type
;
5920 c_apply_type_quals_to_decl (CP_TYPE_QUALS (type
), r
);
5922 /* We don't have to set DECL_CONTEXT here; it is set by
5923 finish_member_declaration. */
5924 DECL_INITIAL (r
) = tsubst_expr (DECL_INITIAL (t
), args
,
5925 /*complain=*/1, in_decl
);
5926 TREE_CHAIN (r
) = NULL_TREE
;
5927 if (VOID_TYPE_P (type
))
5928 cp_error_at ("instantiation of `%D' as type `%T'", r
, type
);
5936 = tsubst_copy (DECL_INITIAL (t
), args
, /*complain=*/1, in_decl
);
5937 TREE_CHAIN (r
) = NULL_TREE
;
5942 if (TREE_CODE (type
) == TEMPLATE_TEMPLATE_PARM
5943 || t
== TYPE_MAIN_DECL (TREE_TYPE (t
)))
5945 /* If this is the canonical decl, we don't have to mess with
5946 instantiations, and often we can't (for typename, template
5947 type parms and such). Note that TYPE_NAME is not correct for
5948 the above test if we've copied the type for a typedef. */
5949 r
= TYPE_NAME (type
);
5957 tree argvec
= NULL_TREE
;
5958 tree gen_tmpl
= NULL_TREE
;
5960 tree tmpl
= NULL_TREE
;
5964 /* Assume this is a non-local variable. */
5967 if (TYPE_P (CP_DECL_CONTEXT (t
)))
5968 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
,
5970 in_decl
, /*entering_scope=*/1);
5971 else if (DECL_NAMESPACE_SCOPE_P (t
))
5972 ctx
= DECL_CONTEXT (t
);
5975 /* Subsequent calls to pushdecl will fill this in. */
5980 /* Check to see if we already have this specialization. */
5983 tmpl
= DECL_TI_TEMPLATE (t
);
5984 gen_tmpl
= most_general_template (tmpl
);
5985 argvec
= tsubst (DECL_TI_ARGS (t
), args
, /*complain=*/1, in_decl
);
5986 spec
= retrieve_specialization (gen_tmpl
, argvec
);
5989 spec
= retrieve_local_specialization (t
);
5998 TREE_TYPE (r
) = type
;
5999 c_apply_type_quals_to_decl (CP_TYPE_QUALS (type
), r
);
6000 DECL_CONTEXT (r
) = ctx
;
6001 /* Clear out the mangled name and RTL for the instantiation. */
6002 SET_DECL_ASSEMBLER_NAME (r
, NULL_TREE
);
6003 SET_DECL_RTL (r
, NULL_RTX
);
6005 /* Don't try to expand the initializer until someone tries to use
6006 this variable; otherwise we run into circular dependencies. */
6007 DECL_INITIAL (r
) = NULL_TREE
;
6008 SET_DECL_RTL (r
, NULL_RTX
);
6009 DECL_SIZE (r
) = DECL_SIZE_UNIT (r
) = 0;
6011 /* For __PRETTY_FUNCTION__ we have to adjust the initializer. */
6012 if (DECL_PRETTY_FUNCTION_P (r
))
6014 const char *const name
= (*decl_printable_name
)
6015 (current_function_decl
, 2);
6016 DECL_INITIAL (r
) = cp_fname_init (name
);
6017 TREE_TYPE (r
) = TREE_TYPE (DECL_INITIAL (r
));
6020 /* Even if the original location is out of scope, the newly
6021 substituted one is not. */
6022 if (TREE_CODE (r
) == VAR_DECL
)
6023 DECL_DEAD_FOR_LOCAL (r
) = 0;
6027 /* A static data member declaration is always marked
6028 external when it is declared in-class, even if an
6029 initializer is present. We mimic the non-template
6031 DECL_EXTERNAL (r
) = 1;
6033 register_specialization (r
, gen_tmpl
, argvec
);
6034 DECL_TEMPLATE_INFO (r
) = tree_cons (tmpl
, argvec
, NULL_TREE
);
6035 SET_DECL_IMPLICIT_INSTANTIATION (r
);
6038 register_local_specialization (r
, t
);
6040 TREE_CHAIN (r
) = NULL_TREE
;
6041 if (TREE_CODE (r
) == VAR_DECL
&& VOID_TYPE_P (type
))
6042 cp_error_at ("instantiation of `%D' as type `%T'", r
, type
);
6047 my_friendly_abort (0);
6050 /* Restore the file and line information. */
6051 lineno
= saved_lineno
;
6052 input_filename
= saved_filename
;
6057 /* Substitue into the ARG_TYPES of a function type. */
6060 tsubst_arg_types (arg_types
, args
, complain
, in_decl
)
6066 tree remaining_arg_types
;
6069 if (!arg_types
|| arg_types
== void_list_node
)
6072 remaining_arg_types
= tsubst_arg_types (TREE_CHAIN (arg_types
),
6073 args
, complain
, in_decl
);
6074 if (remaining_arg_types
== error_mark_node
)
6075 return error_mark_node
;
6077 type
= tsubst (TREE_VALUE (arg_types
), args
, complain
, in_decl
);
6078 if (type
== error_mark_node
)
6079 return error_mark_node
;
6080 if (VOID_TYPE_P (type
))
6084 cp_error ("invalid parameter type `%T'", type
);
6086 cp_error_at ("in declaration `%D'", in_decl
);
6088 return error_mark_node
;
6091 /* Do array-to-pointer, function-to-pointer conversion, and ignore
6092 top-level qualifiers as required. */
6093 type
= TYPE_MAIN_VARIANT (type_decays_to (type
));
6095 /* Note that we do not substitute into default arguments here. The
6096 standard mandates that they be instantiated only when needed,
6097 which is done in build_over_call. */
6098 return hash_tree_cons (TREE_PURPOSE (arg_types
), type
,
6099 remaining_arg_types
);
6103 /* Substitute into a FUNCTION_TYPE or METHOD_TYPE. This routine does
6104 *not* handle the exception-specification for FNTYPE, because the
6105 initial substitution of explicitly provided template parameters
6106 during argument deduction forbids substitution into the
6107 exception-specification:
6111 All references in the function type of the function template to the
6112 corresponding template parameters are replaced by the specified tem-
6113 plate argument values. If a substitution in a template parameter or
6114 in the function type of the function template results in an invalid
6115 type, type deduction fails. [Note: The equivalent substitution in
6116 exception specifications is done only when the function is instanti-
6117 ated, at which point a program is ill-formed if the substitution
6118 results in an invalid type.] */
6121 tsubst_function_type (t
, args
, complain
, in_decl
)
6131 /* The TYPE_CONTEXT is not used for function/method types. */
6132 my_friendly_assert (TYPE_CONTEXT (t
) == NULL_TREE
, 0);
6134 /* Substitue the return type. */
6135 return_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
6136 if (return_type
== error_mark_node
)
6137 return error_mark_node
;
6139 /* Substitue the argument types. */
6140 arg_types
= tsubst_arg_types (TYPE_ARG_TYPES (t
), args
,
6142 if (arg_types
== error_mark_node
)
6143 return error_mark_node
;
6145 /* Construct a new type node and return it. */
6146 if (TREE_CODE (t
) == FUNCTION_TYPE
)
6147 fntype
= build_function_type (return_type
, arg_types
);
6150 tree r
= TREE_TYPE (TREE_VALUE (arg_types
));
6151 if (! IS_AGGR_TYPE (r
))
6155 Type deduction may fail for any of the following
6158 -- Attempting to create "pointer to member of T" when T
6159 is not a class type. */
6161 cp_error ("creating pointer to member function of non-class type `%T'",
6163 return error_mark_node
;
6166 fntype
= build_cplus_method_type (r
, return_type
, TREE_CHAIN
6169 fntype
= build_qualified_type (fntype
, TYPE_QUALS (t
));
6170 fntype
= build_type_attribute_variant (fntype
, TYPE_ATTRIBUTES (t
));
6175 /* Substitute into the PARMS of a call-declarator. */
6178 tsubst_call_declarator_parms (parms
, args
, complain
, in_decl
)
6188 if (!parms
|| parms
== void_list_node
)
6191 new_parms
= tsubst_call_declarator_parms (TREE_CHAIN (parms
),
6192 args
, complain
, in_decl
);
6194 /* Figure out the type of this parameter. */
6195 type
= tsubst (TREE_VALUE (parms
), args
, complain
, in_decl
);
6197 /* Figure out the default argument as well. Note that we use
6198 tsubst_expr since the default argument is really an expression. */
6199 defarg
= tsubst_expr (TREE_PURPOSE (parms
), args
, complain
, in_decl
);
6201 /* Chain this parameter on to the front of those we have already
6202 processed. We don't use hash_tree_cons because that function
6203 doesn't check TREE_PARMLIST. */
6204 new_parms
= tree_cons (defarg
, type
, new_parms
);
6206 /* And note that these are parameters. */
6207 TREE_PARMLIST (new_parms
) = 1;
6212 /* Take the tree structure T and replace template parameters used
6213 therein with the argument vector ARGS. IN_DECL is an associated
6214 decl for diagnostics. If an error occurs, returns ERROR_MARK_NODE.
6215 An appropriate error message is issued only if COMPLAIN is
6216 non-zero. Note that we must be relatively non-tolerant of
6217 extensions here, in order to preserve conformance; if we allow
6218 substitutions that should not be allowed, we may allow argument
6219 deductions that should not succeed, and therefore report ambiguous
6220 overload situations where there are none. In theory, we could
6221 allow the substitution, but indicate that it should have failed,
6222 and allow our caller to make sure that the right thing happens, but
6223 we don't try to do this yet.
6225 This function is used for dealing with types, decls and the like;
6226 for expressions, use tsubst_expr or tsubst_copy. */
6229 tsubst (t
, args
, complain
, in_decl
)
6236 if (t
== NULL_TREE
|| t
== error_mark_node
6237 || t
== integer_type_node
6238 || t
== void_type_node
6239 || t
== char_type_node
6240 || TREE_CODE (t
) == NAMESPACE_DECL
)
6243 if (TREE_CODE (t
) == IDENTIFIER_NODE
)
6244 type
= IDENTIFIER_TYPE_VALUE (t
);
6246 type
= TREE_TYPE (t
);
6247 if (type
== unknown_type_node
)
6248 my_friendly_abort (42);
6250 if (type
&& TREE_CODE (t
) != FUNCTION_DECL
6251 && TREE_CODE (t
) != TYPENAME_TYPE
6252 && TREE_CODE (t
) != TEMPLATE_DECL
6253 && TREE_CODE (t
) != IDENTIFIER_NODE
6254 && TREE_CODE (t
) != FUNCTION_TYPE
6255 && TREE_CODE (t
) != METHOD_TYPE
)
6256 type
= tsubst (type
, args
, complain
, in_decl
);
6257 if (type
== error_mark_node
)
6258 return error_mark_node
;
6261 return tsubst_decl (t
, args
, type
);
6263 switch (TREE_CODE (t
))
6268 return tsubst_aggr_type (t
, args
, complain
, in_decl
,
6269 /*entering_scope=*/0);
6272 case IDENTIFIER_NODE
:
6284 if (t
== integer_type_node
)
6287 if (TREE_CODE (TYPE_MIN_VALUE (t
)) == INTEGER_CST
6288 && TREE_CODE (TYPE_MAX_VALUE (t
)) == INTEGER_CST
)
6292 tree max
, omax
= TREE_OPERAND (TYPE_MAX_VALUE (t
), 0);
6294 max
= tsubst_expr (omax
, args
, complain
, in_decl
);
6295 if (max
== error_mark_node
)
6296 return error_mark_node
;
6298 /* See if we can reduce this expression to something simpler. */
6299 max
= maybe_fold_nontype_arg (max
);
6300 if (!processing_template_decl
)
6301 max
= decl_constant_value (max
);
6303 if (processing_template_decl
6304 /* When providing explicit arguments to a template
6305 function, but leaving some arguments for subsequent
6306 deduction, MAX may be template-dependent even if we're
6307 not PROCESSING_TEMPLATE_DECL. We still need to check for
6308 template parms, though; MAX won't be an INTEGER_CST for
6309 dynamic arrays, either. */
6310 || (TREE_CODE (max
) != INTEGER_CST
6311 && uses_template_parms (max
)))
6313 tree itype
= make_node (INTEGER_TYPE
);
6314 TYPE_MIN_VALUE (itype
) = size_zero_node
;
6315 TYPE_MAX_VALUE (itype
) = build_min (MINUS_EXPR
, sizetype
, max
,
6320 if (integer_zerop (omax
))
6322 /* Still allow an explicit array of size zero. */
6324 pedwarn ("creating array with size zero");
6326 else if (integer_zerop (max
)
6327 || (TREE_CODE (max
) == INTEGER_CST
6328 && INT_CST_LT (max
, integer_zero_node
)))
6332 Type deduction may fail for any of the following
6335 Attempting to create an array with a size that is
6336 zero or negative. */
6338 cp_error ("creating array with size zero (`%E')", max
);
6340 return error_mark_node
;
6343 return compute_array_index_type (NULL_TREE
, max
);
6346 case TEMPLATE_TYPE_PARM
:
6347 case TEMPLATE_TEMPLATE_PARM
:
6348 case BOUND_TEMPLATE_TEMPLATE_PARM
:
6349 case TEMPLATE_PARM_INDEX
:
6357 if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
6358 || TREE_CODE (t
) == TEMPLATE_TEMPLATE_PARM
6359 || TREE_CODE (t
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
6361 idx
= TEMPLATE_TYPE_IDX (t
);
6362 level
= TEMPLATE_TYPE_LEVEL (t
);
6366 idx
= TEMPLATE_PARM_IDX (t
);
6367 level
= TEMPLATE_PARM_LEVEL (t
);
6370 if (TREE_VEC_LENGTH (args
) > 0)
6372 tree arg
= NULL_TREE
;
6374 levels
= TMPL_ARGS_DEPTH (args
);
6375 if (level
<= levels
)
6376 arg
= TMPL_ARG (args
, level
, idx
);
6378 if (arg
== error_mark_node
)
6379 return error_mark_node
;
6380 else if (arg
!= NULL_TREE
)
6382 if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
6384 my_friendly_assert (TYPE_P (arg
), 0);
6385 return cp_build_qualified_type_real
6386 (arg
, CP_TYPE_QUALS (arg
) | CP_TYPE_QUALS (t
),
6389 else if (TREE_CODE (t
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
6391 /* We are processing a type constructed from
6392 a template template parameter */
6393 tree argvec
= tsubst (TYPE_TI_ARGS (t
),
6394 args
, complain
, in_decl
);
6395 if (argvec
== error_mark_node
)
6396 return error_mark_node
;
6398 /* We can get a TEMPLATE_TEMPLATE_PARM here when
6399 we are resolving nested-types in the signature of
6400 a member function templates.
6401 Otherwise ARG is a TEMPLATE_DECL and is the real
6402 template to be instantiated. */
6403 if (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
6404 arg
= TYPE_NAME (arg
);
6406 r
= lookup_template_class (arg
,
6409 /*entering_scope=*/0,
6411 return cp_build_qualified_type_real (r
,
6416 /* TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX. */
6421 my_friendly_abort (981018);
6424 /* This can happen during the attempted tsubst'ing in
6425 unify. This means that we don't yet have any information
6426 about the template parameter in question. */
6429 /* If we get here, we must have been looking at a parm for a
6430 more deeply nested template. Make a new version of this
6431 template parameter, but with a lower level. */
6432 switch (TREE_CODE (t
))
6434 case TEMPLATE_TYPE_PARM
:
6435 case TEMPLATE_TEMPLATE_PARM
:
6436 case BOUND_TEMPLATE_TEMPLATE_PARM
:
6437 if (CP_TYPE_QUALS (t
))
6439 r
= tsubst (TYPE_MAIN_VARIANT (t
), args
, complain
, in_decl
);
6440 r
= cp_build_qualified_type_real (r
, CP_TYPE_QUALS (t
),
6446 TEMPLATE_TYPE_PARM_INDEX (r
)
6447 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (t
),
6449 TYPE_STUB_DECL (r
) = TYPE_NAME (r
) = TEMPLATE_TYPE_DECL (r
);
6450 TYPE_MAIN_VARIANT (r
) = r
;
6451 TYPE_POINTER_TO (r
) = NULL_TREE
;
6452 TYPE_REFERENCE_TO (r
) = NULL_TREE
;
6454 if (TREE_CODE (t
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
6456 tree argvec
= tsubst (TYPE_TI_ARGS (t
), args
,
6458 if (argvec
== error_mark_node
)
6459 return error_mark_node
;
6461 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (r
)
6462 = tree_cons (TYPE_TI_TEMPLATE (t
), argvec
, NULL_TREE
);
6467 case TEMPLATE_PARM_INDEX
:
6468 r
= reduce_template_parm_level (t
, type
, levels
);
6472 my_friendly_abort (0);
6480 tree purpose
, value
, chain
, result
;
6482 if (t
== void_list_node
)
6485 purpose
= TREE_PURPOSE (t
);
6488 purpose
= tsubst (purpose
, args
, complain
, in_decl
);
6489 if (purpose
== error_mark_node
)
6490 return error_mark_node
;
6492 value
= TREE_VALUE (t
);
6495 value
= tsubst (value
, args
, complain
, in_decl
);
6496 if (value
== error_mark_node
)
6497 return error_mark_node
;
6499 chain
= TREE_CHAIN (t
);
6500 if (chain
&& chain
!= void_type_node
)
6502 chain
= tsubst (chain
, args
, complain
, in_decl
);
6503 if (chain
== error_mark_node
)
6504 return error_mark_node
;
6506 if (purpose
== TREE_PURPOSE (t
)
6507 && value
== TREE_VALUE (t
)
6508 && chain
== TREE_CHAIN (t
))
6510 if (TREE_PARMLIST (t
))
6512 result
= tree_cons (purpose
, value
, chain
);
6513 TREE_PARMLIST (result
) = 1;
6516 result
= hash_tree_cons (purpose
, value
, chain
);
6520 if (type
!= NULL_TREE
)
6522 /* A binfo node. We always need to make a copy, of the node
6523 itself and of its BINFO_BASETYPES. */
6527 /* Make sure type isn't a typedef copy. */
6528 type
= BINFO_TYPE (TYPE_BINFO (type
));
6530 TREE_TYPE (t
) = complete_type (type
);
6531 if (IS_AGGR_TYPE (type
))
6533 BINFO_VTABLE (t
) = TYPE_BINFO_VTABLE (type
);
6534 BINFO_VIRTUALS (t
) = TYPE_BINFO_VIRTUALS (type
);
6535 if (TYPE_BINFO_BASETYPES (type
) != NULL_TREE
)
6536 BINFO_BASETYPES (t
) = copy_node (TYPE_BINFO_BASETYPES (type
));
6541 /* Otherwise, a vector of template arguments. */
6542 return tsubst_template_arg_vector (t
, args
, complain
);
6545 case REFERENCE_TYPE
:
6547 enum tree_code code
;
6549 if (type
== TREE_TYPE (t
))
6552 code
= TREE_CODE (t
);
6557 Type deduction may fail for any of the following
6560 -- Attempting to create a pointer to reference type.
6561 -- Attempting to create a reference to a reference type or
6562 a reference to void. */
6563 if (TREE_CODE (type
) == REFERENCE_TYPE
6564 || (code
== REFERENCE_TYPE
&& TREE_CODE (type
) == VOID_TYPE
))
6566 static int last_line
= 0;
6567 static const char* last_file
= 0;
6569 /* We keep track of the last time we issued this error
6570 message to avoid spewing a ton of messages during a
6571 single bad template instantiation. */
6572 if (complain
&& (last_line
!= lineno
||
6573 last_file
!= input_filename
))
6575 if (TREE_CODE (type
) == VOID_TYPE
)
6576 cp_error ("forming reference to void");
6578 cp_error ("forming %s to reference type `%T'",
6579 (code
== POINTER_TYPE
) ? "pointer" : "reference",
6582 last_file
= input_filename
;
6585 return error_mark_node
;
6587 else if (code
== POINTER_TYPE
)
6588 r
= build_pointer_type (type
);
6590 r
= build_reference_type (type
);
6591 r
= cp_build_qualified_type_real (r
, TYPE_QUALS (t
), complain
);
6593 if (r
!= error_mark_node
)
6594 /* Will this ever be needed for TYPE_..._TO values? */
6601 r
= tsubst (TYPE_OFFSET_BASETYPE (t
), args
, complain
, in_decl
);
6602 if (r
== error_mark_node
|| !IS_AGGR_TYPE (r
))
6606 Type deduction may fail for any of the following
6609 -- Attempting to create "pointer to member of T" when T
6610 is not a class type. */
6612 cp_error ("creating pointer to member of non-class type `%T'",
6614 return error_mark_node
;
6616 return build_offset_type (r
, type
);
6624 fntype
= tsubst_function_type (t
, args
, complain
, in_decl
);
6625 if (fntype
== error_mark_node
)
6626 return error_mark_node
;
6628 /* Substitue the exception specification. */
6629 raises
= TYPE_RAISES_EXCEPTIONS (t
);
6632 tree list
= NULL_TREE
;
6634 if (! TREE_VALUE (raises
))
6637 for (; raises
!= NULL_TREE
; raises
= TREE_CHAIN (raises
))
6639 tree spec
= TREE_VALUE (raises
);
6641 spec
= tsubst (spec
, args
, complain
, in_decl
);
6642 if (spec
== error_mark_node
)
6644 list
= add_exception_specifier (list
, spec
, complain
);
6646 fntype
= build_exception_variant (fntype
, list
);
6652 tree domain
= tsubst (TYPE_DOMAIN (t
), args
, complain
, in_decl
);
6653 if (domain
== error_mark_node
)
6654 return error_mark_node
;
6656 /* As an optimization, we avoid regenerating the array type if
6657 it will obviously be the same as T. */
6658 if (type
== TREE_TYPE (t
) && domain
== TYPE_DOMAIN (t
))
6661 /* These checks should match the ones in grokdeclarator.
6665 The deduction may fail for any of the following reasons:
6667 -- Attempting to create an array with an element type that
6668 is void, a function type, or a reference type. */
6669 if (TREE_CODE (type
) == VOID_TYPE
6670 || TREE_CODE (type
) == FUNCTION_TYPE
6671 || TREE_CODE (type
) == REFERENCE_TYPE
)
6674 cp_error ("creating array of `%T'", type
);
6675 return error_mark_node
;
6678 r
= build_cplus_array_type (type
, domain
);
6685 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6687 tree e2
= tsubst (TREE_OPERAND (t
, 1), args
, complain
,
6690 if (e1
== error_mark_node
|| e2
== error_mark_node
)
6691 return error_mark_node
;
6693 return fold (build (TREE_CODE (t
), TREE_TYPE (t
), e1
, e2
));
6699 tree e
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6701 if (e
== error_mark_node
)
6702 return error_mark_node
;
6704 return fold (build (TREE_CODE (t
), TREE_TYPE (t
), e
));
6709 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
6710 in_decl
, /*entering_scope=*/1);
6711 tree f
= tsubst_copy (TYPENAME_TYPE_FULLNAME (t
), args
,
6714 if (ctx
== error_mark_node
|| f
== error_mark_node
)
6715 return error_mark_node
;
6717 if (!IS_AGGR_TYPE (ctx
))
6720 cp_error ("`%T' is not a class, struct, or union type",
6722 return error_mark_node
;
6724 else if (!uses_template_parms (ctx
) && !TYPE_BEING_DEFINED (ctx
))
6726 /* Normally, make_typename_type does not require that the CTX
6727 have complete type in order to allow things like:
6729 template <class T> struct S { typename S<T>::X Y; };
6731 But, such constructs have already been resolved by this
6732 point, so here CTX really should have complete type, unless
6733 it's a partial instantiation. */
6734 ctx
= complete_type (ctx
);
6735 if (!COMPLETE_TYPE_P (ctx
))
6738 incomplete_type_error (NULL_TREE
, ctx
);
6739 return error_mark_node
;
6743 f
= make_typename_type (ctx
, f
, complain
);
6744 if (f
== error_mark_node
)
6746 return cp_build_qualified_type_real (f
,
6748 | CP_TYPE_QUALS (t
),
6754 tree e
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6756 if (e
== error_mark_node
)
6757 return error_mark_node
;
6758 return make_pointer_declarator (type
, e
);
6763 tree e
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6765 if (e
== error_mark_node
)
6766 return error_mark_node
;
6767 return make_reference_declarator (type
, e
);
6772 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6774 tree e2
= tsubst_expr (TREE_OPERAND (t
, 1), args
, complain
,
6776 if (e1
== error_mark_node
|| e2
== error_mark_node
)
6777 return error_mark_node
;
6779 return build_nt (ARRAY_REF
, e1
, e2
, tsubst_expr
);
6784 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6786 tree e2
= (tsubst_call_declarator_parms
6787 (CALL_DECLARATOR_PARMS (t
), args
, complain
, in_decl
));
6788 tree e3
= tsubst (CALL_DECLARATOR_EXCEPTION_SPEC (t
), args
,
6791 if (e1
== error_mark_node
|| e2
== error_mark_node
6792 || e3
== error_mark_node
)
6793 return error_mark_node
;
6795 return make_call_declarator (e1
, e2
, CALL_DECLARATOR_QUALS (t
), e3
);
6800 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6802 tree e2
= tsubst (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
6803 if (e1
== error_mark_node
|| e2
== error_mark_node
)
6804 return error_mark_node
;
6806 return build_nt (TREE_CODE (t
), e1
, e2
);
6811 tree e1
= tsubst_expr (TYPE_FIELDS (t
), args
, complain
,
6813 if (e1
== error_mark_node
)
6814 return error_mark_node
;
6816 return TREE_TYPE (e1
);
6820 sorry ("use of `%s' in template",
6821 tree_code_name
[(int) TREE_CODE (t
)]);
6822 return error_mark_node
;
6826 /* Like tsubst, but deals with expressions. This function just replaces
6827 template parms; to finish processing the resultant expression, use
6831 tsubst_copy (t
, args
, complain
, in_decl
)
6836 enum tree_code code
;
6839 if (t
== NULL_TREE
|| t
== error_mark_node
)
6842 code
= TREE_CODE (t
);
6847 return do_identifier (DECL_NAME (t
), 0, NULL_TREE
);
6854 if (!DECL_CONTEXT (t
))
6855 /* This is a global enumeration constant. */
6858 /* Unfortunately, we cannot just call lookup_name here.
6861 template <int I> int f() {
6863 struct S { void g() { E e = a; } };
6866 When we instantiate f<7>::S::g(), say, lookup_name is not
6867 clever enough to find f<7>::a. */
6869 = tsubst_aggr_type (TREE_TYPE (t
), args
, complain
, in_decl
,
6870 /*entering_scope=*/0);
6872 for (v
= TYPE_VALUES (enum_type
);
6875 if (TREE_PURPOSE (v
) == DECL_NAME (t
))
6876 return TREE_VALUE (v
);
6878 /* We didn't find the name. That should never happen; if
6879 name-lookup found it during preliminary parsing, we
6880 should find it again here during instantiation. */
6881 my_friendly_abort (0);
6886 if (DECL_CONTEXT (t
))
6890 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
6891 /*entering_scope=*/1);
6892 if (ctx
!= DECL_CONTEXT (t
))
6893 return lookup_field (ctx
, DECL_NAME (t
), 0, 0);
6899 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
))
6900 t
= tsubst (t
, args
, complain
, in_decl
);
6905 if (is_member_template (t
))
6906 return tsubst (t
, args
, complain
, in_decl
);
6912 /* We must tsubst into a LOOKUP_EXPR in case the names to
6913 which it refers is a conversion operator; in that case the
6914 name will change. We avoid making unnecessary copies,
6917 tree id
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
6919 if (id
!= TREE_OPERAND (t
, 0))
6921 r
= build_nt (LOOKUP_EXPR
, id
);
6922 LOOKUP_EXPR_GLOBAL (r
) = LOOKUP_EXPR_GLOBAL (t
);
6930 case REINTERPRET_CAST_EXPR
:
6931 case CONST_CAST_EXPR
:
6932 case STATIC_CAST_EXPR
:
6933 case DYNAMIC_CAST_EXPR
:
6936 (code
, tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
6937 tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
));
6941 case TRUTH_NOT_EXPR
:
6944 case CONVERT_EXPR
: /* Unary + */
6953 (code
, tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
6954 tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
));
6959 case TRUNC_DIV_EXPR
:
6961 case FLOOR_DIV_EXPR
:
6962 case ROUND_DIV_EXPR
:
6963 case EXACT_DIV_EXPR
:
6965 case BIT_ANDTC_EXPR
:
6968 case TRUNC_MOD_EXPR
:
6969 case FLOOR_MOD_EXPR
:
6970 case TRUTH_ANDIF_EXPR
:
6971 case TRUTH_ORIF_EXPR
:
6972 case TRUTH_AND_EXPR
:
6992 case PREDECREMENT_EXPR
:
6993 case PREINCREMENT_EXPR
:
6994 case POSTDECREMENT_EXPR
:
6995 case POSTINCREMENT_EXPR
:
6997 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
6998 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
));
7002 tree fn
= TREE_OPERAND (t
, 0);
7003 if (is_overloaded_fn (fn
))
7004 fn
= tsubst_copy (get_first_fn (fn
), args
, complain
, in_decl
);
7006 /* Sometimes FN is a LOOKUP_EXPR. */
7007 fn
= tsubst_copy (fn
, args
, complain
, in_decl
);
7009 (code
, fn
, tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
,
7014 case METHOD_CALL_EXPR
:
7016 tree name
= TREE_OPERAND (t
, 0);
7017 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
7019 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
7021 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
7023 else if (TREE_CODE (name
) == SCOPE_REF
7024 && TREE_CODE (TREE_OPERAND (name
, 1)) == BIT_NOT_EXPR
)
7026 tree base
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
7028 name
= TREE_OPERAND (name
, 1);
7029 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
7031 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
7032 name
= build_nt (SCOPE_REF
, base
, name
);
7035 name
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
7037 (code
, name
, tsubst_copy (TREE_OPERAND (t
, 1), args
,
7039 tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
),
7044 /* This processing should really occur in tsubst_expr, However,
7045 tsubst_expr does not recurse into expressions, since it
7046 assumes that there aren't any statements inside them.
7047 Instead, it simply calls build_expr_from_tree. So, we need
7048 to expand the STMT_EXPR here. */
7049 if (!processing_template_decl
)
7051 tree stmt_expr
= begin_stmt_expr ();
7052 tsubst_expr (STMT_EXPR_STMT (t
), args
,
7054 return finish_stmt_expr (stmt_expr
);
7061 case PSEUDO_DTOR_EXPR
:
7064 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
7065 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
),
7066 tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
));
7073 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
7074 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
),
7075 tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
));
7076 NEW_EXPR_USE_GLOBAL (r
) = NEW_EXPR_USE_GLOBAL (t
);
7083 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
7084 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
));
7085 DELETE_EXPR_USE_GLOBAL (r
) = DELETE_EXPR_USE_GLOBAL (t
);
7086 DELETE_EXPR_USE_VEC (r
) = DELETE_EXPR_USE_VEC (t
);
7090 case TEMPLATE_ID_EXPR
:
7092 /* Substituted template arguments */
7093 tree targs
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
,
7096 if (targs
&& TREE_CODE (targs
) == TREE_LIST
)
7099 for (chain
= targs
; chain
; chain
= TREE_CHAIN (chain
))
7100 TREE_VALUE (chain
) = maybe_fold_nontype_arg (TREE_VALUE (chain
));
7105 for (i
= 0; i
< TREE_VEC_LENGTH (targs
); ++i
)
7106 TREE_VEC_ELT (targs
, i
)
7107 = maybe_fold_nontype_arg (TREE_VEC_ELT (targs
, i
));
7110 return lookup_template_function
7111 (tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
), targs
);
7116 tree purpose
, value
, chain
;
7118 if (t
== void_list_node
)
7121 purpose
= TREE_PURPOSE (t
);
7123 purpose
= tsubst_copy (purpose
, args
, complain
, in_decl
);
7124 value
= TREE_VALUE (t
);
7126 value
= tsubst_copy (value
, args
, complain
, in_decl
);
7127 chain
= TREE_CHAIN (t
);
7128 if (chain
&& chain
!= void_type_node
)
7129 chain
= tsubst_copy (chain
, args
, complain
, in_decl
);
7130 if (purpose
== TREE_PURPOSE (t
)
7131 && value
== TREE_VALUE (t
)
7132 && chain
== TREE_CHAIN (t
))
7134 return tree_cons (purpose
, value
, chain
);
7141 case TEMPLATE_TYPE_PARM
:
7142 case TEMPLATE_TEMPLATE_PARM
:
7143 case BOUND_TEMPLATE_TEMPLATE_PARM
:
7144 case TEMPLATE_PARM_INDEX
:
7146 case REFERENCE_TYPE
:
7153 return tsubst (t
, args
, complain
, in_decl
);
7155 case IDENTIFIER_NODE
:
7156 if (IDENTIFIER_TYPENAME_P (t
))
7158 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
7159 return mangle_conv_op_name_for_type (new_type
);
7167 (CONSTRUCTOR
, tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
7168 NULL_TREE
, tsubst_copy (CONSTRUCTOR_ELTS (t
), args
,
7169 complain
, in_decl
));
7170 TREE_HAS_CONSTRUCTOR (r
) = TREE_HAS_CONSTRUCTOR (t
);
7175 return build_x_va_arg (tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
,
7177 tsubst (TREE_TYPE (t
), args
, complain
, in_decl
));
7184 /* Like tsubst_copy, but also does semantic processing. */
7187 tsubst_expr (t
, args
, complain
, in_decl
)
7194 if (t
== NULL_TREE
|| t
== error_mark_node
)
7197 if (processing_template_decl
)
7198 return tsubst_copy (t
, args
, complain
, in_decl
);
7200 if (!statement_code_p (TREE_CODE (t
)))
7201 return build_expr_from_tree (tsubst_copy (t
, args
, complain
, in_decl
));
7203 switch (TREE_CODE (t
))
7207 finish_named_return_value
7208 (TREE_OPERAND (t
, 0),
7209 tsubst_expr (TREE_OPERAND (t
, 1), args
, /*complain=*/1, in_decl
));
7212 case CTOR_INITIALIZER
:
7214 tree member_init_list
;
7215 tree base_init_list
;
7219 = tsubst_initializer_list (TREE_OPERAND (t
, 0), args
);
7221 = tsubst_initializer_list (TREE_OPERAND (t
, 1), args
);
7222 setup_vtbl_ptr (member_init_list
, base_init_list
);
7228 finish_return_stmt (tsubst_expr (RETURN_EXPR (t
),
7229 args
, complain
, in_decl
));
7234 finish_expr_stmt (tsubst_expr (EXPR_STMT_EXPR (t
),
7235 args
, complain
, in_decl
));
7240 do_using_directive (tsubst_expr (USING_STMT_NAMESPACE (t
),
7241 args
, complain
, in_decl
));
7250 decl
= DECL_STMT_DECL (t
);
7251 if (TREE_CODE (decl
) == LABEL_DECL
)
7252 finish_label_decl (DECL_NAME (decl
));
7253 else if (TREE_CODE (decl
) == USING_DECL
)
7255 tree scope
= DECL_INITIAL (decl
);
7256 tree name
= DECL_NAME (decl
);
7258 scope
= tsubst_expr (scope
, args
, complain
, in_decl
);
7259 do_local_using_decl (build_nt (SCOPE_REF
, scope
, name
));
7263 init
= DECL_INITIAL (decl
);
7264 decl
= tsubst (decl
, args
, complain
, in_decl
);
7265 if (DECL_PRETTY_FUNCTION_P (decl
))
7266 init
= DECL_INITIAL (decl
);
7268 init
= tsubst_expr (init
, args
, complain
, in_decl
);
7269 if (decl
!= error_mark_node
)
7271 if (TREE_CODE (decl
) != TYPE_DECL
)
7272 /* Make sure the type is instantiated now. */
7273 complete_type (TREE_TYPE (decl
));
7275 DECL_INITIAL (decl
) = error_mark_node
;
7276 /* By marking the declaration as instantiated, we avoid
7277 trying to instantiate it. Since instantiate_decl can't
7278 handle local variables, and since we've already done
7279 all that needs to be done, that's the right thing to
7281 if (TREE_CODE (decl
) == VAR_DECL
)
7282 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
7283 maybe_push_decl (decl
);
7284 cp_finish_decl (decl
, init
, NULL_TREE
, 0);
7288 /* A DECL_STMT can also be used as an expression, in the condition
7289 clause of a if/for/while construct. If we aren't followed by
7290 another statement, return our decl. */
7291 if (TREE_CHAIN (t
) == NULL_TREE
)
7300 stmt
= begin_for_stmt ();
7301 tsubst_expr (FOR_INIT_STMT (t
), args
, complain
, in_decl
);
7302 finish_for_init_stmt (stmt
);
7303 finish_for_cond (tsubst_expr (FOR_COND (t
), args
,
7306 tmp
= tsubst_expr (FOR_EXPR (t
), args
, complain
, in_decl
);
7307 finish_for_expr (tmp
, stmt
);
7308 tsubst_expr (FOR_BODY (t
), args
, complain
, in_decl
);
7309 finish_for_stmt (stmt
);
7316 stmt
= begin_while_stmt ();
7317 finish_while_stmt_cond (tsubst_expr (WHILE_COND (t
),
7318 args
, complain
, in_decl
),
7320 tsubst_expr (WHILE_BODY (t
), args
, complain
, in_decl
);
7321 finish_while_stmt (stmt
);
7328 stmt
= begin_do_stmt ();
7329 tsubst_expr (DO_BODY (t
), args
, complain
, in_decl
);
7330 finish_do_body (stmt
);
7331 finish_do_stmt (tsubst_expr (DO_COND (t
), args
,
7340 stmt
= begin_if_stmt ();
7341 finish_if_stmt_cond (tsubst_expr (IF_COND (t
),
7342 args
, complain
, in_decl
),
7345 if (tmp
= THEN_CLAUSE (t
), tmp
)
7347 tsubst_expr (tmp
, args
, complain
, in_decl
);
7348 finish_then_clause (stmt
);
7351 if (tmp
= ELSE_CLAUSE (t
), tmp
)
7353 begin_else_clause ();
7354 tsubst_expr (tmp
, args
, complain
, in_decl
);
7355 finish_else_clause (stmt
);
7365 stmt
= begin_compound_stmt (COMPOUND_STMT_NO_SCOPE (t
));
7366 tsubst_expr (COMPOUND_BODY (t
), args
, complain
, in_decl
);
7367 finish_compound_stmt (COMPOUND_STMT_NO_SCOPE (t
), stmt
);
7373 finish_break_stmt ();
7378 finish_continue_stmt ();
7386 stmt
= begin_switch_stmt ();
7387 val
= tsubst_expr (SWITCH_COND (t
), args
, complain
, in_decl
);
7388 finish_switch_cond (val
, stmt
);
7389 tsubst_expr (SWITCH_BODY (t
), args
, complain
, in_decl
);
7390 finish_switch_stmt (stmt
);
7396 finish_case_label (tsubst_expr (CASE_LOW (t
), args
, complain
, in_decl
),
7397 tsubst_expr (CASE_HIGH (t
), args
, complain
,
7402 lineno
= STMT_LINENO (t
);
7403 finish_label_stmt (DECL_NAME (LABEL_STMT_LABEL (t
)));
7408 tmp
= GOTO_DESTINATION (t
);
7409 if (TREE_CODE (tmp
) != LABEL_DECL
)
7410 /* Computed goto's must be tsubst'd into. On the other hand,
7411 non-computed gotos must not be; the identifier in question
7412 will have no binding. */
7413 tmp
= tsubst_expr (tmp
, args
, complain
, in_decl
);
7415 tmp
= DECL_NAME (tmp
);
7416 finish_goto_stmt (tmp
);
7421 finish_asm_stmt (ASM_CV_QUAL (t
),
7422 tsubst_expr (ASM_STRING (t
), args
, complain
, in_decl
),
7423 tsubst_expr (ASM_OUTPUTS (t
), args
, complain
, in_decl
),
7424 tsubst_expr (ASM_INPUTS (t
), args
, complain
, in_decl
),
7425 tsubst_expr (ASM_CLOBBERS (t
), args
, complain
,
7433 stmt
= begin_try_block ();
7434 tsubst_expr (TRY_STMTS (t
), args
, complain
, in_decl
);
7435 finish_cleanup_try_block (stmt
);
7436 finish_cleanup (tsubst_expr (TRY_HANDLERS (t
), args
,
7442 if (FN_TRY_BLOCK_P (t
))
7443 stmt
= begin_function_try_block ();
7445 stmt
= begin_try_block ();
7447 tsubst_expr (TRY_STMTS (t
), args
, complain
, in_decl
);
7449 if (FN_TRY_BLOCK_P (t
))
7450 finish_function_try_block (stmt
);
7452 finish_try_block (stmt
);
7454 tsubst_expr (TRY_HANDLERS (t
), args
, complain
, in_decl
);
7455 if (FN_TRY_BLOCK_P (t
))
7456 finish_function_handler_sequence (stmt
);
7458 finish_handler_sequence (stmt
);
7467 stmt
= begin_handler ();
7468 if (HANDLER_PARMS (t
))
7470 decl
= DECL_STMT_DECL (HANDLER_PARMS (t
));
7471 decl
= tsubst (decl
, args
, complain
, in_decl
);
7472 /* Prevent instantiate_decl from trying to instantiate
7473 this variable. We've already done all that needs to be
7475 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
7479 finish_handler_parms (decl
, stmt
);
7480 tsubst_expr (HANDLER_BODY (t
), args
, complain
, in_decl
);
7481 finish_handler (stmt
);
7487 tsubst (TREE_TYPE (t
), args
, complain
, NULL_TREE
);
7491 add_stmt (copy_node (t
));
7498 return tsubst_expr (TREE_CHAIN (t
), args
, complain
, in_decl
);
7501 /* TMPL is a TEMPLATE_DECL for a cloned constructor or destructor.
7502 Instantiate it with the ARGS. */
7505 instantiate_clone (tmpl
, args
)
7512 /* Instantiated the cloned function, rather than the clone. */
7513 spec
= instantiate_template (DECL_CLONED_FUNCTION (tmpl
), args
);
7515 /* Then, see if we've already cloned the instantiation. */
7516 for (clone
= TREE_CHAIN (spec
);
7517 clone
&& DECL_CLONED_FUNCTION_P (clone
);
7518 clone
= TREE_CHAIN (clone
))
7519 if (DECL_NAME (clone
) == DECL_NAME (tmpl
))
7522 /* If we haven't, do so know. */
7524 clone_function_decl (spec
, /*update_method_vec_p=*/0);
7527 for (clone
= TREE_CHAIN (spec
);
7528 clone
&& DECL_CLONED_FUNCTION_P (clone
);
7529 clone
= TREE_CHAIN (clone
))
7530 if (DECL_NAME (clone
) == DECL_NAME (tmpl
))
7533 /* We should always have found the clone by now. */
7534 my_friendly_abort (20000411);
7538 /* Instantiate the indicated variable or function template TMPL with
7539 the template arguments in TARG_PTR. */
7542 instantiate_template (tmpl
, targ_ptr
)
7543 tree tmpl
, targ_ptr
;
7552 if (tmpl
== error_mark_node
)
7553 return error_mark_node
;
7555 my_friendly_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
, 283);
7557 /* If this function is a clone, handle it specially. */
7558 if (DECL_CLONED_FUNCTION_P (tmpl
))
7559 return instantiate_clone (tmpl
, targ_ptr
);
7561 /* Check to see if we already have this specialization. */
7562 spec
= retrieve_specialization (tmpl
, targ_ptr
);
7563 if (spec
!= NULL_TREE
)
7566 gen_tmpl
= most_general_template (tmpl
);
7567 if (tmpl
!= gen_tmpl
)
7569 /* The TMPL is a partial instantiation. To get a full set of
7570 arguments we must add the arguments used to perform the
7571 partial instantiation. */
7572 targ_ptr
= add_outermost_template_args (DECL_TI_ARGS (tmpl
),
7575 /* Check to see if we already have this specialization. */
7576 spec
= retrieve_specialization (gen_tmpl
, targ_ptr
);
7577 if (spec
!= NULL_TREE
)
7581 len
= DECL_NTPARMS (gen_tmpl
);
7582 inner_args
= INNERMOST_TEMPLATE_ARGS (targ_ptr
);
7586 tree t
= TREE_VEC_ELT (inner_args
, i
);
7589 tree nt
= target_type (t
);
7590 if (IS_AGGR_TYPE (nt
) && decl_function_context (TYPE_MAIN_DECL (nt
)))
7592 cp_error ("type `%T' composed from a local class is not a valid template-argument", t
);
7593 cp_error (" trying to instantiate `%D'", gen_tmpl
);
7594 return error_mark_node
;
7599 /* substitute template parameters */
7600 fndecl
= tsubst (DECL_TEMPLATE_RESULT (gen_tmpl
),
7601 targ_ptr
, /*complain=*/1, gen_tmpl
);
7602 /* The DECL_TI_TEMPLATE should always be the immediate parent
7603 template, not the most general template. */
7604 DECL_TI_TEMPLATE (fndecl
) = tmpl
;
7606 if (flag_external_templates
)
7607 add_pending_template (fndecl
);
7609 /* If we've just instantiated the main entry point for a function,
7610 instantiate all the alternate entry points as well. */
7611 for (clone
= TREE_CHAIN (gen_tmpl
);
7612 clone
&& DECL_CLONED_FUNCTION_P (clone
);
7613 clone
= TREE_CHAIN (clone
))
7614 instantiate_template (clone
, targ_ptr
);
7619 /* The FN is a TEMPLATE_DECL for a function. The ARGS are the
7620 arguments that are being used when calling it. TARGS is a vector
7621 into which the deduced template arguments are placed.
7623 Return zero for success, 2 for an incomplete match that doesn't resolve
7624 all the types, and 1 for complete failure. An error message will be
7625 printed only for an incomplete match.
7627 If FN is a conversion operator, or we are trying to produce a specific
7628 specialization, RETURN_TYPE is the return type desired.
7630 The EXPLICIT_TARGS are explicit template arguments provided via a
7633 The parameter STRICT is one of:
7636 We are deducing arguments for a function call, as in
7640 We are deducing arguments for a conversion function, as in
7644 We are deducing arguments when doing an explicit instantiation
7645 as in [temp.explicit], when determining an explicit specialization
7646 as in [temp.expl.spec], or when taking the address of a function
7647 template, as in [temp.deduct.funcaddr].
7650 We are deducing arguments when calculating the partial
7651 ordering between specializations of function or class
7652 templates, as in [temp.func.order] and [temp.class.order].
7654 LEN is the number of parms to consider before returning success, or -1
7655 for all. This is used in partial ordering to avoid comparing parms for
7656 which no actual argument was passed, since they are not considered in
7657 overload resolution (and are explicitly excluded from consideration in
7658 partial ordering in [temp.func.order]/6). */
7661 fn_type_unification (fn
, explicit_targs
, targs
, args
, return_type
,
7663 tree fn
, explicit_targs
, targs
, args
, return_type
;
7664 unification_kind_t strict
;
7671 my_friendly_assert (TREE_CODE (fn
) == TEMPLATE_DECL
, 0);
7673 fntype
= TREE_TYPE (fn
);
7678 The specified template arguments must match the template
7679 parameters in kind (i.e., type, nontype, template), and there
7680 must not be more arguments than there are parameters;
7681 otherwise type deduction fails.
7683 Nontype arguments must match the types of the corresponding
7684 nontype template parameters, or must be convertible to the
7685 types of the corresponding nontype parameters as specified in
7686 _temp.arg.nontype_, otherwise type deduction fails.
7688 All references in the function type of the function template
7689 to the corresponding template parameters are replaced by the
7690 specified template argument values. If a substitution in a
7691 template parameter or in the function type of the function
7692 template results in an invalid type, type deduction fails. */
7694 tree converted_args
;
7697 = (coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
7698 explicit_targs
, NULL_TREE
, /*complain=*/0,
7699 /*require_all_arguments=*/0));
7700 if (converted_args
== error_mark_node
)
7703 fntype
= tsubst (fntype
, converted_args
, /*complain=*/0, NULL_TREE
);
7704 if (fntype
== error_mark_node
)
7707 /* Place the explicitly specified arguments in TARGS. */
7708 for (i
= 0; i
< TREE_VEC_LENGTH (targs
); i
++)
7709 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (converted_args
, i
);
7712 parms
= TYPE_ARG_TYPES (fntype
);
7713 /* Never do unification on the 'this' parameter. */
7714 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
))
7715 parms
= TREE_CHAIN (parms
);
7719 /* We've been given a return type to match, prepend it. */
7720 parms
= tree_cons (NULL_TREE
, TREE_TYPE (fntype
), parms
);
7721 args
= tree_cons (NULL_TREE
, return_type
, args
);
7726 /* We allow incomplete unification without an error message here
7727 because the standard doesn't seem to explicitly prohibit it. Our
7728 callers must be ready to deal with unification failures in any
7730 result
= type_unification_real (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
7731 targs
, parms
, args
, /*subr=*/0,
7732 strict
, /*allow_incomplete*/1, len
);
7735 /* All is well so far. Now, check:
7739 When all template arguments have been deduced, all uses of
7740 template parameters in nondeduced contexts are replaced with
7741 the corresponding deduced argument values. If the
7742 substitution results in an invalid type, as described above,
7743 type deduction fails. */
7744 if (tsubst (TREE_TYPE (fn
), targs
, /*complain=*/0, NULL_TREE
)
7751 /* Adjust types before performing type deduction, as described in
7752 [temp.deduct.call] and [temp.deduct.conv]. The rules in these two
7753 sections are symmetric. PARM is the type of a function parameter
7754 or the return type of the conversion function. ARG is the type of
7755 the argument passed to the call, or the type of the value
7756 initialized with the result of the conversion function. */
7759 maybe_adjust_types_for_deduction (strict
, parm
, arg
)
7760 unification_kind_t strict
;
7773 /* Swap PARM and ARG throughout the remainder of this
7774 function; the handling is precisely symmetric since PARM
7775 will initialize ARG rather than vice versa. */
7783 /* There is nothing to do in this case. */
7787 /* DR 214. [temp.func.order] is underspecified, and leads to no
7788 ordering between things like `T *' and `T const &' for `U *'.
7789 The former has T=U and the latter T=U*. The former looks more
7790 specialized and John Spicer considers it well-formed (the EDG
7791 compiler accepts it).
7793 John also confirms that deduction should proceed as in a function
7794 call. Which implies the usual ARG and PARM conversions as DEDUCE_CALL.
7795 However, in ordering, ARG can have REFERENCE_TYPE, but no argument
7796 to an actual call can have such a type.
7798 If both ARG and PARM are REFERENCE_TYPE, we change neither.
7799 If only ARG is a REFERENCE_TYPE, we look through that and then
7800 proceed as with DEDUCE_CALL (which could further convert it). */
7801 if (TREE_CODE (*arg
) == REFERENCE_TYPE
)
7803 if (TREE_CODE (*parm
) == REFERENCE_TYPE
)
7805 *arg
= TREE_TYPE (*arg
);
7809 my_friendly_abort (0);
7812 if (TREE_CODE (*parm
) != REFERENCE_TYPE
)
7814 /* [temp.deduct.call]
7816 If P is not a reference type:
7818 --If A is an array type, the pointer type produced by the
7819 array-to-pointer standard conversion (_conv.array_) is
7820 used in place of A for type deduction; otherwise,
7822 --If A is a function type, the pointer type produced by
7823 the function-to-pointer standard conversion
7824 (_conv.func_) is used in place of A for type deduction;
7827 --If A is a cv-qualified type, the top level
7828 cv-qualifiers of A's type are ignored for type
7830 if (TREE_CODE (*arg
) == ARRAY_TYPE
)
7831 *arg
= build_pointer_type (TREE_TYPE (*arg
));
7832 else if (TREE_CODE (*arg
) == FUNCTION_TYPE
)
7833 *arg
= build_pointer_type (*arg
);
7835 *arg
= TYPE_MAIN_VARIANT (*arg
);
7838 /* [temp.deduct.call]
7840 If P is a cv-qualified type, the top level cv-qualifiers
7841 of P's type are ignored for type deduction. If P is a
7842 reference type, the type referred to by P is used for
7844 *parm
= TYPE_MAIN_VARIANT (*parm
);
7845 if (TREE_CODE (*parm
) == REFERENCE_TYPE
)
7847 *parm
= TREE_TYPE (*parm
);
7848 result
|= UNIFY_ALLOW_OUTER_MORE_CV_QUAL
;
7853 /* Most parms like fn_type_unification.
7855 If SUBR is 1, we're being called recursively (to unify the
7856 arguments of a function or method parameter of a function
7860 type_unification_real (tparms
, targs
, xparms
, xargs
, subr
,
7861 strict
, allow_incomplete
, xlen
)
7862 tree tparms
, targs
, xparms
, xargs
;
7864 unification_kind_t strict
;
7865 int allow_incomplete
, xlen
;
7869 int ntparms
= TREE_VEC_LENGTH (tparms
);
7871 int saw_undeduced
= 0;
7875 my_friendly_assert (TREE_CODE (tparms
) == TREE_VEC
, 289);
7876 my_friendly_assert (xparms
== NULL_TREE
7877 || TREE_CODE (xparms
) == TREE_LIST
, 290);
7878 /* ARGS could be NULL (via a call from parse.y to
7879 build_x_function_call). */
7881 my_friendly_assert (TREE_CODE (xargs
) == TREE_LIST
, 291);
7882 my_friendly_assert (ntparms
> 0, 292);
7887 sub_strict
= (UNIFY_ALLOW_OUTER_LEVEL
| UNIFY_ALLOW_MORE_CV_QUAL
7888 | UNIFY_ALLOW_DERIVED
);
7892 sub_strict
= UNIFY_ALLOW_LESS_CV_QUAL
;
7896 sub_strict
= UNIFY_ALLOW_NONE
;
7900 sub_strict
= UNIFY_ALLOW_NONE
;
7904 my_friendly_abort (0);
7916 && parms
!= void_list_node
7918 && args
!= void_list_node
)
7920 parm
= TREE_VALUE (parms
);
7921 parms
= TREE_CHAIN (parms
);
7922 arg
= TREE_VALUE (args
);
7923 args
= TREE_CHAIN (args
);
7925 if (arg
== error_mark_node
)
7927 if (arg
== unknown_type_node
)
7928 /* We can't deduce anything from this, but we might get all the
7929 template args from other function args. */
7932 /* Conversions will be performed on a function argument that
7933 corresponds with a function parameter that contains only
7934 non-deducible template parameters and explicitly specified
7935 template parameters. */
7936 if (! uses_template_parms (parm
))
7941 type
= TREE_TYPE (arg
);
7948 if (strict
== DEDUCE_EXACT
|| strict
== DEDUCE_ORDER
)
7950 if (same_type_p (parm
, type
))
7954 /* It might work; we shouldn't check now, because we might
7955 get into infinite recursion. Overload resolution will
7964 my_friendly_assert (TREE_TYPE (arg
) != NULL_TREE
, 293);
7965 if (type_unknown_p (arg
))
7967 /* [temp.deduct.type] A template-argument can be deduced from
7968 a pointer to function or pointer to member function
7969 argument if the set of overloaded functions does not
7970 contain function templates and at most one of a set of
7971 overloaded functions provides a unique match. */
7973 if (resolve_overloaded_unification
7974 (tparms
, targs
, parm
, arg
, strict
, sub_strict
)
7979 arg
= TREE_TYPE (arg
);
7983 int arg_strict
= sub_strict
;
7986 arg_strict
|= maybe_adjust_types_for_deduction (strict
, &parm
, &arg
);
7988 if (unify (tparms
, targs
, parm
, arg
, arg_strict
))
7992 /* Are we done with the interesting parms? */
7996 /* Fail if we've reached the end of the parm list, and more args
7997 are present, and the parm list isn't variadic. */
7998 if (args
&& args
!= void_list_node
&& parms
== void_list_node
)
8000 /* Fail if parms are left and they don't have default values. */
8002 && parms
!= void_list_node
8003 && TREE_PURPOSE (parms
) == NULL_TREE
)
8008 for (i
= 0; i
< ntparms
; i
++)
8009 if (TREE_VEC_ELT (targs
, i
) == NULL_TREE
)
8011 tree tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, i
));
8013 /* If this is an undeduced nontype parameter that depends on
8014 a type parameter, try another pass; its type may have been
8015 deduced from a later argument than the one from which
8016 this parameter can be deduced. */
8017 if (TREE_CODE (tparm
) == PARM_DECL
8018 && uses_template_parms (TREE_TYPE (tparm
))
8019 && !saw_undeduced
++)
8022 if (!allow_incomplete
)
8023 error ("incomplete type unification");
8029 /* Subroutine of type_unification_real. Args are like the variables at the
8030 call site. ARG is an overloaded function (or template-id); we try
8031 deducing template args from each of the overloads, and if only one
8032 succeeds, we go with that. Modifies TARGS and returns 0 on success. */
8035 resolve_overloaded_unification (tparms
, targs
, parm
, arg
, strict
,
8037 tree tparms
, targs
, parm
, arg
;
8038 unification_kind_t strict
;
8041 tree tempargs
= copy_node (targs
);
8044 if (TREE_CODE (arg
) == ADDR_EXPR
)
8045 arg
= TREE_OPERAND (arg
, 0);
8047 if (TREE_CODE (arg
) == COMPONENT_REF
)
8048 /* Handle `&x' where `x' is some static or non-static member
8050 arg
= TREE_OPERAND (arg
, 1);
8052 if (TREE_CODE (arg
) == OFFSET_REF
)
8053 arg
= TREE_OPERAND (arg
, 1);
8055 /* Strip baselink information. */
8056 while (TREE_CODE (arg
) == TREE_LIST
)
8057 arg
= TREE_VALUE (arg
);
8059 if (TREE_CODE (arg
) == TEMPLATE_ID_EXPR
)
8061 /* If we got some explicit template args, we need to plug them into
8062 the affected templates before we try to unify, in case the
8063 explicit args will completely resolve the templates in question. */
8065 tree expl_subargs
= TREE_OPERAND (arg
, 1);
8066 arg
= TREE_OPERAND (arg
, 0);
8068 for (; arg
; arg
= OVL_NEXT (arg
))
8070 tree fn
= OVL_CURRENT (arg
);
8073 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
8076 subargs
= get_bindings_overload (fn
, DECL_TEMPLATE_RESULT (fn
),
8080 elem
= tsubst (TREE_TYPE (fn
), subargs
, /*complain=*/0,
8082 if (TREE_CODE (elem
) == METHOD_TYPE
)
8083 elem
= build_ptrmemfunc_type (build_pointer_type (elem
));
8084 good
+= try_one_overload (tparms
, targs
, tempargs
, parm
, elem
,
8085 strict
, sub_strict
);
8089 else if (TREE_CODE (arg
) == OVERLOAD
)
8091 for (; arg
; arg
= OVL_NEXT (arg
))
8093 tree type
= TREE_TYPE (OVL_CURRENT (arg
));
8094 if (TREE_CODE (type
) == METHOD_TYPE
)
8095 type
= build_ptrmemfunc_type (build_pointer_type (type
));
8096 good
+= try_one_overload (tparms
, targs
, tempargs
, parm
,
8098 strict
, sub_strict
);
8102 my_friendly_abort (981006);
8104 /* [temp.deduct.type] A template-argument can be deduced from a pointer
8105 to function or pointer to member function argument if the set of
8106 overloaded functions does not contain function templates and at most
8107 one of a set of overloaded functions provides a unique match.
8109 So if we found multiple possibilities, we return success but don't
8114 int i
= TREE_VEC_LENGTH (targs
);
8116 if (TREE_VEC_ELT (tempargs
, i
))
8117 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (tempargs
, i
);
8125 /* Subroutine of resolve_overloaded_unification; does deduction for a single
8126 overload. Fills TARGS with any deduced arguments, or error_mark_node if
8127 different overloads deduce different arguments for a given parm.
8128 Returns 1 on success. */
8131 try_one_overload (tparms
, orig_targs
, targs
, parm
, arg
, strict
,
8133 tree tparms
, orig_targs
, targs
, parm
, arg
;
8134 unification_kind_t strict
;
8141 /* [temp.deduct.type] A template-argument can be deduced from a pointer
8142 to function or pointer to member function argument if the set of
8143 overloaded functions does not contain function templates and at most
8144 one of a set of overloaded functions provides a unique match.
8146 So if this is a template, just return success. */
8148 if (uses_template_parms (arg
))
8151 sub_strict
|= maybe_adjust_types_for_deduction (strict
, &parm
, &arg
);
8153 /* We don't copy orig_targs for this because if we have already deduced
8154 some template args from previous args, unify would complain when we
8155 try to deduce a template parameter for the same argument, even though
8156 there isn't really a conflict. */
8157 nargs
= TREE_VEC_LENGTH (targs
);
8158 tempargs
= make_tree_vec (nargs
);
8160 if (unify (tparms
, tempargs
, parm
, arg
, sub_strict
) != 0)
8163 /* First make sure we didn't deduce anything that conflicts with
8164 explicitly specified args. */
8165 for (i
= nargs
; i
--; )
8167 tree elt
= TREE_VEC_ELT (tempargs
, i
);
8168 tree oldelt
= TREE_VEC_ELT (orig_targs
, i
);
8170 if (elt
== NULL_TREE
)
8172 else if (uses_template_parms (elt
))
8174 /* Since we're unifying against ourselves, we will fill in template
8175 args used in the function parm list with our own template parms.
8177 TREE_VEC_ELT (tempargs
, i
) = NULL_TREE
;
8180 else if (oldelt
&& ! template_args_equal (oldelt
, elt
))
8184 for (i
= nargs
; i
--; )
8186 tree elt
= TREE_VEC_ELT (tempargs
, i
);
8189 TREE_VEC_ELT (targs
, i
) = elt
;
8195 /* Verify that nondeduce template argument agrees with the type
8196 obtained from argument deduction. Return nonzero if the
8201 struct A { typedef int X; };
8202 template <class T, class U> struct C {};
8203 template <class T> struct C<T, typename T::X> {};
8205 Then with the instantiation `C<A, int>', we can deduce that
8206 `T' is `A' but unify () does not check whether `typename T::X'
8207 is `int'. This function ensure that they agree.
8209 TARGS, PARMS are the same as the arguments of unify.
8210 ARGS contains template arguments from all levels. */
8213 verify_class_unification (targs
, parms
, args
)
8214 tree targs
, parms
, args
;
8217 int nparms
= TREE_VEC_LENGTH (parms
);
8218 tree new_parms
= tsubst (parms
, add_outermost_template_args (args
, targs
),
8219 /*complain=*/0, NULL_TREE
);
8220 if (new_parms
== error_mark_node
)
8223 args
= INNERMOST_TEMPLATE_ARGS (args
);
8225 for (i
= 0; i
< nparms
; i
++)
8227 tree parm
= TREE_VEC_ELT (new_parms
, i
);
8228 tree arg
= TREE_VEC_ELT (args
, i
);
8230 /* In case we are deducing from a function argument of a function
8231 templates, some parameters may not be deduced yet. So we
8232 make sure that only fully substituted elements of PARM are
8235 if (!uses_template_parms (parm
) && !template_args_equal (parm
, arg
))
8241 /* PARM is a template class (perhaps with unbound template
8242 parameters). ARG is a fully instantiated type. If ARG can be
8243 bound to PARM, return ARG, otherwise return NULL_TREE. TPARMS and
8244 TARGS are as for unify. */
8247 try_class_unification (tparms
, targs
, parm
, arg
)
8255 if (!CLASSTYPE_TEMPLATE_INFO (arg
)
8256 || CLASSTYPE_TI_TEMPLATE (arg
) != CLASSTYPE_TI_TEMPLATE (parm
))
8259 /* We need to make a new template argument vector for the call to
8260 unify. If we used TARGS, we'd clutter it up with the result of
8261 the attempted unification, even if this class didn't work out.
8262 We also don't want to commit ourselves to all the unifications
8263 we've already done, since unification is supposed to be done on
8264 an argument-by-argument basis. In other words, consider the
8265 following pathological case:
8267 template <int I, int J, int K>
8270 template <int I, int J>
8271 struct S<I, J, 2> : public S<I, I, I>, S<J, J, J> {};
8273 template <int I, int J, int K>
8274 void f(S<I, J, K>, S<I, I, I>);
8283 Now, by the time we consider the unification involving `s2', we
8284 already know that we must have `f<0, 0, 0>'. But, even though
8285 `S<0, 1, 2>' is derived from `S<0, 0, 0>', the code is not legal
8286 because there are two ways to unify base classes of S<0, 1, 2>
8287 with S<I, I, I>. If we kept the already deduced knowledge, we
8288 would reject the possibility I=1. */
8289 copy_of_targs
= make_tree_vec (TREE_VEC_LENGTH (targs
));
8291 /* If unification failed, we're done. */
8292 if (unify (tparms
, copy_of_targs
, CLASSTYPE_TI_ARGS (parm
),
8293 CLASSTYPE_TI_ARGS (arg
), UNIFY_ALLOW_NONE
))
8299 /* Subroutine of get_template_base. RVAL, if non-NULL, is a base we
8300 have already discovered to be satisfactory. ARG_BINFO is the binfo
8301 for the base class of ARG that we are currently examining. */
8304 get_template_base_recursive (tparms
, targs
, parm
,
8305 arg_binfo
, rval
, flags
)
8315 tree arg
= BINFO_TYPE (arg_binfo
);
8317 if (!(flags
& GTB_IGNORE_TYPE
))
8319 tree r
= try_class_unification (tparms
, targs
,
8322 /* If there is more than one satisfactory baseclass, then:
8326 If they yield more than one possible deduced A, the type
8330 if (r
&& rval
&& !same_type_p (r
, rval
))
8331 return error_mark_node
;
8336 binfos
= BINFO_BASETYPES (arg_binfo
);
8337 n_baselinks
= binfos
? TREE_VEC_LENGTH (binfos
) : 0;
8339 /* Process base types. */
8340 for (i
= 0; i
< n_baselinks
; i
++)
8342 tree base_binfo
= TREE_VEC_ELT (binfos
, i
);
8345 /* Skip this base, if we've already seen it. */
8346 if (BINFO_MARKED (base_binfo
))
8350 (flags
& GTB_VIA_VIRTUAL
) || TREE_VIA_VIRTUAL (base_binfo
);
8352 /* When searching for a non-virtual, we cannot mark virtually
8355 SET_BINFO_MARKED (base_binfo
);
8357 rval
= get_template_base_recursive (tparms
, targs
,
8361 GTB_VIA_VIRTUAL
* this_virtual
);
8363 /* If we discovered more than one matching base class, we can
8365 if (rval
== error_mark_node
)
8366 return error_mark_node
;
8372 /* Given a template type PARM and a class type ARG, find the unique
8373 base type in ARG that is an instance of PARM. We do not examine
8374 ARG itself; only its base-classes. If there is no appropriate base
8375 class, return NULL_TREE. If there is more than one, return
8376 error_mark_node. PARM may be the type of a partial specialization,
8377 as well as a plain template type. Used by unify. */
8380 get_template_base (tparms
, targs
, parm
, arg
)
8389 my_friendly_assert (IS_AGGR_TYPE_CODE (TREE_CODE (arg
)), 92);
8391 arg_binfo
= TYPE_BINFO (complete_type (arg
));
8392 rval
= get_template_base_recursive (tparms
, targs
,
8397 /* Since get_template_base_recursive marks the bases classes, we
8398 must unmark them here. */
8399 dfs_walk (arg_binfo
, dfs_unmark
, markedp
, 0);
8404 /* Returns the level of DECL, which declares a template parameter. */
8407 template_decl_level (decl
)
8410 switch (TREE_CODE (decl
))
8414 return TEMPLATE_TYPE_LEVEL (TREE_TYPE (decl
));
8417 return TEMPLATE_PARM_LEVEL (DECL_INITIAL (decl
));
8420 my_friendly_abort (0);
8425 /* Decide whether ARG can be unified with PARM, considering only the
8426 cv-qualifiers of each type, given STRICT as documented for unify.
8427 Returns non-zero iff the unification is OK on that basis.*/
8430 check_cv_quals_for_unify (strict
, arg
, parm
)
8435 if (!(strict
& (UNIFY_ALLOW_MORE_CV_QUAL
| UNIFY_ALLOW_OUTER_MORE_CV_QUAL
))
8436 && !at_least_as_qualified_p (arg
, parm
))
8439 if (!(strict
& (UNIFY_ALLOW_LESS_CV_QUAL
| UNIFY_ALLOW_OUTER_LESS_CV_QUAL
))
8440 && !at_least_as_qualified_p (parm
, arg
))
8446 /* Takes parameters as for type_unification. Returns 0 if the
8447 type deduction succeeds, 1 otherwise. The parameter STRICT is a
8448 bitwise or of the following flags:
8451 Require an exact match between PARM and ARG.
8452 UNIFY_ALLOW_MORE_CV_QUAL:
8453 Allow the deduced ARG to be more cv-qualified (by qualification
8454 conversion) than ARG.
8455 UNIFY_ALLOW_LESS_CV_QUAL:
8456 Allow the deduced ARG to be less cv-qualified than ARG.
8457 UNIFY_ALLOW_DERIVED:
8458 Allow the deduced ARG to be a template base class of ARG,
8459 or a pointer to a template base class of the type pointed to by
8461 UNIFY_ALLOW_INTEGER:
8462 Allow any integral type to be deduced. See the TEMPLATE_PARM_INDEX
8463 case for more information.
8464 UNIFY_ALLOW_OUTER_LEVEL:
8465 This is the outermost level of a deduction. Used to determine validity
8466 of qualification conversions. A valid qualification conversion must
8467 have const qualified pointers leading up to the inner type which
8468 requires additional CV quals, except at the outer level, where const
8469 is not required [conv.qual]. It would be normal to set this flag in
8470 addition to setting UNIFY_ALLOW_MORE_CV_QUAL.
8471 UNIFY_ALLOW_OUTER_MORE_CV_QUAL:
8472 This is the outermost level of a deduction, and PARM can be more CV
8473 qualified at this point.
8474 UNIFY_ALLOW_OUTER_LESS_CV_QUAL:
8475 This is the outermost level of a deduction, and PARM can be less CV
8476 qualified at this point. */
8479 unify (tparms
, targs
, parm
, arg
, strict
)
8480 tree tparms
, targs
, parm
, arg
;
8486 int strict_in
= strict
;
8488 /* I don't think this will do the right thing with respect to types.
8489 But the only case I've seen it in so far has been array bounds, where
8490 signedness is the only information lost, and I think that will be
8492 while (TREE_CODE (parm
) == NOP_EXPR
)
8493 parm
= TREE_OPERAND (parm
, 0);
8495 if (arg
== error_mark_node
)
8497 if (arg
== unknown_type_node
)
8498 /* We can't deduce anything from this, but we might get all the
8499 template args from other function args. */
8502 /* If PARM uses template parameters, then we can't bail out here,
8503 even if ARG == PARM, since we won't record unifications for the
8504 template parameters. We might need them if we're trying to
8505 figure out which of two things is more specialized. */
8506 if (arg
== parm
&& !uses_template_parms (parm
))
8509 /* Immediately reject some pairs that won't unify because of
8510 cv-qualification mismatches. */
8511 if (TREE_CODE (arg
) == TREE_CODE (parm
)
8513 /* It is the elements of the array which hold the cv quals of an array
8514 type, and the elements might be template type parms. We'll check
8516 && TREE_CODE (arg
) != ARRAY_TYPE
8517 /* We check the cv-qualifiers when unifying with template type
8518 parameters below. We want to allow ARG `const T' to unify with
8519 PARM `T' for example, when computing which of two templates
8520 is more specialized, for example. */
8521 && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
8522 && !check_cv_quals_for_unify (strict_in
, arg
, parm
))
8525 if (!(strict
& UNIFY_ALLOW_OUTER_LEVEL
)
8526 && TYPE_P (parm
) && !CP_TYPE_CONST_P (parm
))
8527 strict
&= ~UNIFY_ALLOW_MORE_CV_QUAL
;
8528 strict
&= ~UNIFY_ALLOW_OUTER_LEVEL
;
8529 strict
&= ~UNIFY_ALLOW_DERIVED
;
8530 strict
&= ~UNIFY_ALLOW_OUTER_MORE_CV_QUAL
;
8531 strict
&= ~UNIFY_ALLOW_OUTER_LESS_CV_QUAL
;
8533 switch (TREE_CODE (parm
))
8536 /* In a type which contains a nested-name-specifier, template
8537 argument values cannot be deduced for template parameters used
8538 within the nested-name-specifier. */
8541 case TEMPLATE_TYPE_PARM
:
8542 case TEMPLATE_TEMPLATE_PARM
:
8543 case BOUND_TEMPLATE_TEMPLATE_PARM
:
8544 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
8546 if (TEMPLATE_TYPE_LEVEL (parm
)
8547 != template_decl_level (tparm
))
8548 /* The PARM is not one we're trying to unify. Just check
8549 to see if it matches ARG. */
8550 return (TREE_CODE (arg
) == TREE_CODE (parm
)
8551 && same_type_p (parm
, arg
)) ? 0 : 1;
8552 idx
= TEMPLATE_TYPE_IDX (parm
);
8553 targ
= TREE_VEC_ELT (targs
, idx
);
8554 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, idx
));
8556 /* Check for mixed types and values. */
8557 if ((TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
8558 && TREE_CODE (tparm
) != TYPE_DECL
)
8559 || (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
8560 && TREE_CODE (tparm
) != TEMPLATE_DECL
))
8563 if (TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
8565 /* ARG must be constructed from a template class or a template
8566 template parameter. */
8567 if (TREE_CODE (arg
) != BOUND_TEMPLATE_TEMPLATE_PARM
8568 && (TREE_CODE (arg
) != RECORD_TYPE
|| !CLASSTYPE_TEMPLATE_INFO (arg
)))
8572 tree parmtmpl
= TYPE_TI_TEMPLATE (parm
);
8573 tree parmvec
= TYPE_TI_ARGS (parm
);
8574 tree argvec
= TYPE_TI_ARGS (arg
);
8576 = DECL_INNERMOST_TEMPLATE_PARMS (TYPE_TI_TEMPLATE (arg
));
8579 /* The parameter and argument roles have to be switched here
8580 in order to handle default arguments properly. For example,
8581 template<template <class> class TT> void f(TT<int>)
8582 should be able to accept vector<int> which comes from
8583 template <class T, class Allocator = allocator>
8586 if (coerce_template_parms (argtmplvec
, parmvec
, parmtmpl
, 0, 1)
8590 /* Deduce arguments T, i from TT<T> or TT<i>.
8591 We check each element of PARMVEC and ARGVEC individually
8592 rather than the whole TREE_VEC since they can have
8593 different number of elements. */
8595 for (i
= 0; i
< TREE_VEC_LENGTH (parmvec
); ++i
)
8597 tree t
= TREE_VEC_ELT (parmvec
, i
);
8599 if (unify (tparms
, targs
, t
,
8600 TREE_VEC_ELT (argvec
, i
),
8605 arg
= TYPE_TI_TEMPLATE (arg
);
8607 /* Fall through to deduce template name. */
8610 if (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
8611 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
8613 /* Deduce template name TT from TT, TT<>, TT<T> and TT<i>. */
8615 /* Simple cases: Value already set, does match or doesn't. */
8616 if (targ
!= NULL_TREE
&& template_args_equal (targ
, arg
))
8623 /* If PARM is `const T' and ARG is only `int', we don't have
8624 a match unless we are allowing additional qualification.
8625 If ARG is `const int' and PARM is just `T' that's OK;
8626 that binds `const int' to `T'. */
8627 if (!check_cv_quals_for_unify (strict_in
| UNIFY_ALLOW_LESS_CV_QUAL
,
8631 /* Consider the case where ARG is `const volatile int' and
8632 PARM is `const T'. Then, T should be `volatile int'. */
8634 cp_build_qualified_type_real (arg
,
8636 & ~CP_TYPE_QUALS (parm
),
8638 if (arg
== error_mark_node
)
8641 /* Simple cases: Value already set, does match or doesn't. */
8642 if (targ
!= NULL_TREE
&& same_type_p (targ
, arg
))
8648 /* Make sure that ARG is not a variable-sized array. (Note that
8649 were talking about variable-sized arrays (like `int[n]'),
8650 rather than arrays of unknown size (like `int[]').) We'll
8651 get very confused by such a type since the bound of the array
8652 will not be computable in an instantiation. Besides, such
8653 types are not allowed in ISO C++, so we can do as we please
8655 if (TREE_CODE (arg
) == ARRAY_TYPE
8656 && !uses_template_parms (arg
)
8657 && TYPE_DOMAIN (arg
)
8658 && (TREE_CODE (TYPE_MAX_VALUE (TYPE_DOMAIN (arg
)))
8662 TREE_VEC_ELT (targs
, idx
) = arg
;
8665 case TEMPLATE_PARM_INDEX
:
8666 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
8668 if (TEMPLATE_PARM_LEVEL (parm
)
8669 != template_decl_level (tparm
))
8670 /* The PARM is not one we're trying to unify. Just check
8671 to see if it matches ARG. */
8672 return (TREE_CODE (arg
) == TREE_CODE (parm
)
8673 && cp_tree_equal (parm
, arg
) > 0) ? 0 : 1;
8675 idx
= TEMPLATE_PARM_IDX (parm
);
8676 targ
= TREE_VEC_ELT (targs
, idx
);
8680 int i
= (cp_tree_equal (targ
, arg
) > 0);
8686 my_friendly_abort (42);
8689 /* [temp.deduct.type] If, in the declaration of a function template
8690 with a non-type template-parameter, the non-type
8691 template-parameter is used in an expression in the function
8692 parameter-list and, if the corresponding template-argument is
8693 deduced, the template-argument type shall match the type of the
8694 template-parameter exactly, except that a template-argument
8695 deduced from an array bound may be of any integral type.
8696 The non-type parameter might use already deduced type parameters. */
8697 tparm
= tsubst (TREE_TYPE (parm
), targs
, 0, NULL_TREE
);
8698 if (same_type_p (TREE_TYPE (arg
), tparm
))
8700 else if ((strict
& UNIFY_ALLOW_INTEGER
)
8701 && (TREE_CODE (tparm
) == INTEGER_TYPE
8702 || TREE_CODE (tparm
) == BOOLEAN_TYPE
))
8704 else if (uses_template_parms (tparm
))
8705 /* We haven't deduced the type of this parameter yet. Try again
8711 TREE_VEC_ELT (targs
, idx
) = arg
;
8716 if (TREE_CODE (arg
) != POINTER_TYPE
)
8719 /* [temp.deduct.call]
8721 A can be another pointer or pointer to member type that can
8722 be converted to the deduced A via a qualification
8723 conversion (_conv.qual_).
8725 We pass down STRICT here rather than UNIFY_ALLOW_NONE.
8726 This will allow for additional cv-qualification of the
8727 pointed-to types if appropriate. */
8729 if (TREE_CODE (TREE_TYPE (arg
)) == RECORD_TYPE
)
8730 /* The derived-to-base conversion only persists through one
8731 level of pointers. */
8732 strict
|= (strict_in
& UNIFY_ALLOW_DERIVED
);
8734 if (TREE_CODE (TREE_TYPE (parm
)) == OFFSET_TYPE
8735 && TREE_CODE (TREE_TYPE (arg
)) == OFFSET_TYPE
)
8737 /* Avoid getting confused about cv-quals; don't recurse here.
8738 Pointers to members should really be just OFFSET_TYPE, not
8739 this two-level nonsense... */
8741 parm
= TREE_TYPE (parm
);
8742 arg
= TREE_TYPE (arg
);
8746 return unify (tparms
, targs
, TREE_TYPE (parm
),
8747 TREE_TYPE (arg
), strict
);
8750 case REFERENCE_TYPE
:
8751 if (TREE_CODE (arg
) != REFERENCE_TYPE
)
8753 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
8754 strict
& UNIFY_ALLOW_MORE_CV_QUAL
);
8757 if (TREE_CODE (arg
) != ARRAY_TYPE
)
8759 if ((TYPE_DOMAIN (parm
) == NULL_TREE
)
8760 != (TYPE_DOMAIN (arg
) == NULL_TREE
))
8762 if (TYPE_DOMAIN (parm
) != NULL_TREE
8763 && unify (tparms
, targs
, TYPE_DOMAIN (parm
),
8764 TYPE_DOMAIN (arg
), UNIFY_ALLOW_NONE
) != 0)
8766 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
8775 if (TREE_CODE (arg
) != TREE_CODE (parm
))
8778 if (TREE_CODE (parm
) == INTEGER_TYPE
8779 && TREE_CODE (TYPE_MAX_VALUE (parm
)) != INTEGER_CST
)
8781 if (TYPE_MIN_VALUE (parm
) && TYPE_MIN_VALUE (arg
)
8782 && unify (tparms
, targs
, TYPE_MIN_VALUE (parm
),
8783 TYPE_MIN_VALUE (arg
), UNIFY_ALLOW_INTEGER
))
8785 if (TYPE_MAX_VALUE (parm
) && TYPE_MAX_VALUE (arg
)
8786 && unify (tparms
, targs
, TYPE_MAX_VALUE (parm
),
8787 TYPE_MAX_VALUE (arg
), UNIFY_ALLOW_INTEGER
))
8790 /* We have already checked cv-qualification at the top of the
8792 else if (!same_type_ignoring_top_level_qualifiers_p (arg
, parm
))
8795 /* As far as unification is concerned, this wins. Later checks
8796 will invalidate it if necessary. */
8799 /* Types INTEGER_CST and MINUS_EXPR can come from array bounds. */
8800 /* Type INTEGER_CST can come from ordinary constant template args. */
8802 while (TREE_CODE (arg
) == NOP_EXPR
)
8803 arg
= TREE_OPERAND (arg
, 0);
8805 if (TREE_CODE (arg
) != INTEGER_CST
)
8807 return !tree_int_cst_equal (parm
, arg
);
8812 if (TREE_CODE (arg
) != TREE_VEC
)
8814 if (TREE_VEC_LENGTH (parm
) != TREE_VEC_LENGTH (arg
))
8816 for (i
= 0; i
< TREE_VEC_LENGTH (parm
); ++i
)
8817 if (unify (tparms
, targs
,
8818 TREE_VEC_ELT (parm
, i
), TREE_VEC_ELT (arg
, i
),
8826 if (TREE_CODE (arg
) != TREE_CODE (parm
))
8829 if (TYPE_PTRMEMFUNC_P (parm
))
8831 if (!TYPE_PTRMEMFUNC_P (arg
))
8834 return unify (tparms
, targs
,
8835 TYPE_PTRMEMFUNC_FN_TYPE (parm
),
8836 TYPE_PTRMEMFUNC_FN_TYPE (arg
),
8840 if (CLASSTYPE_TEMPLATE_INFO (parm
))
8844 if (strict_in
& UNIFY_ALLOW_DERIVED
)
8846 /* First, we try to unify the PARM and ARG directly. */
8847 t
= try_class_unification (tparms
, targs
,
8852 /* Fallback to the special case allowed in
8855 If P is a class, and P has the form
8856 template-id, then A can be a derived class of
8857 the deduced A. Likewise, if P is a pointer to
8858 a class of the form template-id, A can be a
8859 pointer to a derived class pointed to by the
8861 t
= get_template_base (tparms
, targs
,
8864 if (! t
|| t
== error_mark_node
)
8868 else if (CLASSTYPE_TEMPLATE_INFO (arg
)
8869 && (CLASSTYPE_TI_TEMPLATE (parm
)
8870 == CLASSTYPE_TI_TEMPLATE (arg
)))
8871 /* Perhaps PARM is something like S<U> and ARG is S<int>.
8872 Then, we should unify `int' and `U'. */
8875 /* There's no chance of unification succeeding. */
8878 return unify (tparms
, targs
, CLASSTYPE_TI_ARGS (parm
),
8879 CLASSTYPE_TI_ARGS (t
), UNIFY_ALLOW_NONE
);
8881 else if (!same_type_ignoring_top_level_qualifiers_p (parm
, arg
))
8887 if (TREE_CODE (arg
) != TREE_CODE (parm
))
8890 if (unify (tparms
, targs
, TREE_TYPE (parm
),
8891 TREE_TYPE (arg
), UNIFY_ALLOW_NONE
))
8893 return type_unification_real (tparms
, targs
, TYPE_ARG_TYPES (parm
),
8894 TYPE_ARG_TYPES (arg
), 1,
8895 DEDUCE_EXACT
, 0, -1);
8899 if (TREE_CODE (arg
) != OFFSET_TYPE
)
8901 if (unify (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
8902 TYPE_OFFSET_BASETYPE (arg
), UNIFY_ALLOW_NONE
))
8904 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
8908 if (arg
!= decl_constant_value (parm
))
8913 /* Matched cases are handled by the ARG == PARM test above. */
8917 if (TREE_CODE (TREE_OPERAND (parm
, 1)) == INTEGER_CST
)
8919 /* We handle this case specially, since it comes up with
8920 arrays. In particular, something like:
8922 template <int N> void f(int (&x)[N]);
8924 Here, we are trying to unify the range type, which
8925 looks like [0 ... (N - 1)]. */
8927 t1
= TREE_OPERAND (parm
, 0);
8928 t2
= TREE_OPERAND (parm
, 1);
8930 t
= fold (build (PLUS_EXPR
, integer_type_node
, arg
, t2
));
8932 return unify (tparms
, targs
, t1
, t
, strict
);
8934 /* else fall through */
8937 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (parm
))))
8940 /* We're looking at an expression. This can happen with
8944 void foo(S<I>, S<I + 2>);
8946 This is a "nondeduced context":
8950 The nondeduced contexts are:
8952 --A type that is a template-id in which one or more of
8953 the template-arguments is an expression that references
8954 a template-parameter.
8956 In these cases, we assume deduction succeeded, but don't
8957 actually infer any unifications. */
8959 if (!uses_template_parms (parm
)
8960 && !template_args_equal (parm
, arg
))
8966 sorry ("use of `%s' in template type unification",
8967 tree_code_name
[(int) TREE_CODE (parm
)]);
8973 /* Called if RESULT is explicitly instantiated, or is a member of an
8974 explicitly instantiated class, or if using -frepo and the
8975 instantiation of RESULT has been assigned to this file. */
8978 mark_decl_instantiated (result
, extern_p
)
8982 if (TREE_CODE (result
) != FUNCTION_DECL
)
8983 /* The TREE_PUBLIC flag for function declarations will have been
8984 set correctly by tsubst. */
8985 TREE_PUBLIC (result
) = 1;
8987 /* We used to set this unconditionally; we moved that to
8988 do_decl_instantiation so it wouldn't get set on members of
8989 explicit class template instantiations. But we still need to set
8990 it here for the 'extern template' case in order to suppress
8991 implicit instantiations. */
8993 SET_DECL_EXPLICIT_INSTANTIATION (result
);
8997 DECL_INTERFACE_KNOWN (result
) = 1;
8998 DECL_NOT_REALLY_EXTERN (result
) = 1;
9000 /* Always make artificials weak. */
9001 if (DECL_ARTIFICIAL (result
) && flag_weak
)
9002 comdat_linkage (result
);
9003 /* For WIN32 we also want to put explicit instantiations in
9004 linkonce sections. */
9005 else if (TREE_PUBLIC (result
))
9006 maybe_make_one_only (result
);
9008 else if (TREE_CODE (result
) == FUNCTION_DECL
)
9012 /* Given two function templates PAT1 and PAT2, return:
9014 DEDUCE should be DEDUCE_EXACT or DEDUCE_ORDER.
9016 1 if PAT1 is more specialized than PAT2 as described in [temp.func.order].
9017 -1 if PAT2 is more specialized than PAT1.
9018 0 if neither is more specialized.
9020 LEN is passed through to fn_type_unification. */
9023 more_specialized (pat1
, pat2
, deduce
, len
)
9031 targs
= get_bindings_real (pat1
, DECL_TEMPLATE_RESULT (pat2
),
9032 NULL_TREE
, 0, deduce
, len
);
9036 targs
= get_bindings_real (pat2
, DECL_TEMPLATE_RESULT (pat1
),
9037 NULL_TREE
, 0, deduce
, len
);
9044 /* Given two class template specialization list nodes PAT1 and PAT2, return:
9046 1 if PAT1 is more specialized than PAT2 as described in [temp.class.order].
9047 -1 if PAT2 is more specialized than PAT1.
9048 0 if neither is more specialized. */
9051 more_specialized_class (pat1
, pat2
)
9057 targs
= get_class_bindings (TREE_VALUE (pat1
), TREE_PURPOSE (pat1
),
9058 TREE_PURPOSE (pat2
));
9062 targs
= get_class_bindings (TREE_VALUE (pat2
), TREE_PURPOSE (pat2
),
9063 TREE_PURPOSE (pat1
));
9070 /* Return the template arguments that will produce the function signature
9071 DECL from the function template FN, with the explicit template
9072 arguments EXPLICIT_ARGS. If CHECK_RETTYPE is 1, the return type must
9073 also match. Return NULL_TREE if no satisfactory arguments could be
9074 found. DEDUCE and LEN are passed through to fn_type_unification. */
9077 get_bindings_real (fn
, decl
, explicit_args
, check_rettype
, deduce
, len
)
9078 tree fn
, decl
, explicit_args
;
9079 int check_rettype
, deduce
, len
;
9081 int ntparms
= DECL_NTPARMS (fn
);
9082 tree targs
= make_tree_vec (ntparms
);
9084 tree decl_arg_types
;
9087 /* Substitute the explicit template arguments into the type of DECL.
9088 The call to fn_type_unification will handle substitution into the
9090 decl_type
= TREE_TYPE (decl
);
9091 if (explicit_args
&& uses_template_parms (decl_type
))
9094 tree converted_args
;
9096 if (DECL_TEMPLATE_INFO (decl
))
9097 tmpl
= DECL_TI_TEMPLATE (decl
);
9099 /* We can get here for some illegal specializations. */
9103 = (coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
9104 explicit_args
, NULL_TREE
,
9106 /*require_all_arguments=*/0));
9107 if (converted_args
== error_mark_node
)
9110 decl_type
= tsubst (decl_type
, converted_args
, /*complain=*/0,
9112 if (decl_type
== error_mark_node
)
9116 decl_arg_types
= TYPE_ARG_TYPES (decl_type
);
9117 /* Never do unification on the 'this' parameter. */
9118 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
9119 decl_arg_types
= TREE_CHAIN (decl_arg_types
);
9121 i
= fn_type_unification (fn
, explicit_args
, targs
,
9123 (check_rettype
|| DECL_CONV_FN_P (fn
)
9124 ? TREE_TYPE (decl_type
) : NULL_TREE
),
9133 /* For most uses, we want to check the return type. */
9136 get_bindings (fn
, decl
, explicit_args
)
9137 tree fn
, decl
, explicit_args
;
9139 return get_bindings_real (fn
, decl
, explicit_args
, 1, DEDUCE_EXACT
, -1);
9142 /* But for resolve_overloaded_unification, we only care about the parameter
9146 get_bindings_overload (fn
, decl
, explicit_args
)
9147 tree fn
, decl
, explicit_args
;
9149 return get_bindings_real (fn
, decl
, explicit_args
, 0, DEDUCE_EXACT
, -1);
9152 /* Return the innermost template arguments that, when applied to a
9153 template specialization whose innermost template parameters are
9154 TPARMS, and whose specialization arguments are ARGS, yield the
9157 For example, suppose we have:
9159 template <class T, class U> struct S {};
9160 template <class T> struct S<T*, int> {};
9162 Then, suppose we want to get `S<double*, int>'. The TPARMS will be
9163 {T}, the PARMS will be {T*, int} and the ARGS will be {double*,
9164 int}. The resulting vector will be {double}, indicating that `T'
9165 is bound to `double'. */
9168 get_class_bindings (tparms
, parms
, args
)
9169 tree tparms
, parms
, args
;
9171 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
9172 tree vec
= make_tree_vec (ntparms
);
9174 if (unify (tparms
, vec
, parms
, INNERMOST_TEMPLATE_ARGS (args
),
9178 for (i
= 0; i
< ntparms
; ++i
)
9179 if (! TREE_VEC_ELT (vec
, i
))
9182 if (verify_class_unification (vec
, parms
, args
))
9188 /* In INSTANTIATIONS is a list of <INSTANTIATION, TEMPLATE> pairs.
9189 Pick the most specialized template, and return the corresponding
9190 instantiation, or if there is no corresponding instantiation, the
9191 template itself. If there is no most specialized template,
9192 error_mark_node is returned. If there are no templates at all,
9193 NULL_TREE is returned. */
9196 most_specialized_instantiation (instantiations
)
9197 tree instantiations
;
9202 if (!instantiations
)
9205 champ
= instantiations
;
9206 for (fn
= TREE_CHAIN (instantiations
); fn
; fn
= TREE_CHAIN (fn
))
9208 fate
= more_specialized (TREE_VALUE (champ
), TREE_VALUE (fn
),
9216 fn
= TREE_CHAIN (fn
);
9218 return error_mark_node
;
9224 for (fn
= instantiations
; fn
&& fn
!= champ
; fn
= TREE_CHAIN (fn
))
9226 fate
= more_specialized (TREE_VALUE (champ
), TREE_VALUE (fn
),
9229 return error_mark_node
;
9232 return TREE_PURPOSE (champ
) ? TREE_PURPOSE (champ
) : TREE_VALUE (champ
);
9235 /* Return the most specialized of the list of templates in FNS that can
9236 produce an instantiation matching DECL, given the explicit template
9237 arguments EXPLICIT_ARGS. */
9240 most_specialized (fns
, decl
, explicit_args
)
9241 tree fns
, decl
, explicit_args
;
9243 tree candidates
= NULL_TREE
;
9246 for (fn
= fns
; fn
; fn
= TREE_CHAIN (fn
))
9248 tree candidate
= TREE_VALUE (fn
);
9250 args
= get_bindings (candidate
, decl
, explicit_args
);
9252 candidates
= tree_cons (NULL_TREE
, candidate
, candidates
);
9255 return most_specialized_instantiation (candidates
);
9258 /* If DECL is a specialization of some template, return the most
9259 general such template. Otherwise, returns NULL_TREE.
9263 template <class T> struct S { template <class U> void f(U); };
9265 if TMPL is `template <class U> void S<int>::f(U)' this will return
9266 the full template. This function will not trace past partial
9267 specializations, however. For example, given in addition:
9269 template <class T> struct S<T*> { template <class U> void f(U); };
9271 if TMPL is `template <class U> void S<int*>::f(U)' this will return
9272 `template <class T> template <class U> S<T*>::f(U)'. */
9275 most_general_template (decl
)
9278 /* If DECL is a FUNCTION_DECL, find the TEMPLATE_DECL of which it is
9279 an immediate specialization. */
9280 if (TREE_CODE (decl
) == FUNCTION_DECL
)
9282 if (DECL_TEMPLATE_INFO (decl
)) {
9283 decl
= DECL_TI_TEMPLATE (decl
);
9285 /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE for a
9287 if (TREE_CODE (decl
) != TEMPLATE_DECL
)
9293 /* Look for more and more general templates. */
9294 while (DECL_TEMPLATE_INFO (decl
))
9296 /* The DECL_TI_TEMPLATE can be a LOOKUP_EXPR or IDENTIFIER_NODE
9297 in some cases. (See cp-tree.h for details.) */
9298 if (TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
9301 /* Stop if we run into an explicitly specialized class template. */
9302 if (!DECL_NAMESPACE_SCOPE_P (decl
)
9303 && DECL_CONTEXT (decl
)
9304 && CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (decl
)))
9307 decl
= DECL_TI_TEMPLATE (decl
);
9313 /* Return the most specialized of the class template specializations
9314 of TMPL which can produce an instantiation matching ARGS, or
9315 error_mark_node if the choice is ambiguous. */
9318 most_specialized_class (tmpl
, args
)
9322 tree list
= NULL_TREE
;
9327 tmpl
= most_general_template (tmpl
);
9328 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
); t
; t
= TREE_CHAIN (t
))
9331 = get_class_bindings (TREE_VALUE (t
), TREE_PURPOSE (t
), args
);
9334 list
= tree_cons (TREE_PURPOSE (t
), TREE_VALUE (t
), list
);
9335 TREE_TYPE (list
) = TREE_TYPE (t
);
9345 for (; t
; t
= TREE_CHAIN (t
))
9347 fate
= more_specialized_class (champ
, t
);
9356 return error_mark_node
;
9362 for (t
= list
; t
&& t
!= champ
; t
= TREE_CHAIN (t
))
9364 fate
= more_specialized_class (champ
, t
);
9366 return error_mark_node
;
9372 /* called from the parser. */
9375 do_decl_instantiation (declspecs
, declarator
, storage
)
9376 tree declspecs
, declarator
, storage
;
9378 tree decl
= grokdeclarator (declarator
, declspecs
, NORMAL
, 0, NULL
);
9379 tree result
= NULL_TREE
;
9383 /* An error occurred, for which grokdeclarator has already issued
9384 an appropriate message. */
9386 else if (! DECL_LANG_SPECIFIC (decl
))
9388 cp_error ("explicit instantiation of non-template `%#D'", decl
);
9391 else if (TREE_CODE (decl
) == VAR_DECL
)
9393 /* There is an asymmetry here in the way VAR_DECLs and
9394 FUNCTION_DECLs are handled by grokdeclarator. In the case of
9395 the latter, the DECL we get back will be marked as a
9396 template instantiation, and the appropriate
9397 DECL_TEMPLATE_INFO will be set up. This does not happen for
9398 VAR_DECLs so we do the lookup here. Probably, grokdeclarator
9399 should handle VAR_DECLs as it currently handles
9401 result
= lookup_field (DECL_CONTEXT (decl
), DECL_NAME (decl
), 0, 0);
9402 if (result
&& TREE_CODE (result
) != VAR_DECL
)
9404 cp_error ("no matching template for `%D' found", result
);
9408 else if (TREE_CODE (decl
) != FUNCTION_DECL
)
9410 cp_error ("explicit instantiation of `%#D'", decl
);
9416 /* Check for various error cases. Note that if the explicit
9417 instantiation is legal the RESULT will currently be marked as an
9418 *implicit* instantiation; DECL_EXPLICIT_INSTANTIATION is not set
9419 until we get here. */
9421 if (DECL_TEMPLATE_SPECIALIZATION (result
))
9425 No program shall both explicitly instantiate and explicitly
9426 specialize a template. */
9427 cp_pedwarn ("explicit instantiation of `%#D' after", result
);
9428 cp_pedwarn_at ("explicit specialization here", result
);
9431 else if (DECL_EXPLICIT_INSTANTIATION (result
))
9435 No program shall explicitly instantiate any template more
9438 We check DECL_INTERFACE_KNOWN so as not to complain when the first
9439 instantiation was `extern' and the second is not, and EXTERN_P for
9440 the opposite case. If -frepo, chances are we already got marked
9441 as an explicit instantiation because of the repo file. */
9442 if (DECL_INTERFACE_KNOWN (result
) && !extern_p
&& !flag_use_repository
)
9443 cp_pedwarn ("duplicate explicit instantiation of `%#D'", result
);
9445 /* If we've already instantiated the template, just return now. */
9446 if (DECL_INTERFACE_KNOWN (result
))
9449 else if (!DECL_IMPLICIT_INSTANTIATION (result
))
9451 cp_error ("no matching template for `%D' found", result
);
9454 else if (!DECL_TEMPLATE_INFO (result
))
9456 cp_pedwarn ("explicit instantiation of non-template `%#D'", result
);
9460 if (flag_external_templates
)
9463 if (storage
== NULL_TREE
)
9465 else if (storage
== ridpointers
[(int) RID_EXTERN
])
9468 cp_pedwarn ("ISO C++ forbids the use of `extern' on explicit instantiations");
9472 cp_error ("storage class `%D' applied to template instantiation",
9475 SET_DECL_EXPLICIT_INSTANTIATION (result
);
9476 mark_decl_instantiated (result
, extern_p
);
9477 repo_template_instantiated (result
, extern_p
);
9479 instantiate_decl (result
, /*defer_ok=*/1);
9483 mark_class_instantiated (t
, extern_p
)
9487 SET_CLASSTYPE_EXPLICIT_INSTANTIATION (t
);
9488 SET_CLASSTYPE_INTERFACE_KNOWN (t
);
9489 CLASSTYPE_INTERFACE_ONLY (t
) = extern_p
;
9490 TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (t
)) = extern_p
;
9493 CLASSTYPE_DEBUG_REQUESTED (t
) = 1;
9494 rest_of_type_compilation (t
, 1);
9498 /* Perform an explicit instantiation of template class T. STORAGE, if
9499 non-null, is the RID for extern, inline or static. COMPLAIN is
9500 non-zero if this is called from the parser, zero if called recursively,
9501 since the standard is unclear (as detailed below). */
9504 do_type_instantiation (t
, storage
, complain
)
9512 if (TREE_CODE (t
) == TYPE_DECL
)
9515 if (! CLASS_TYPE_P (t
) || ! CLASSTYPE_TEMPLATE_INFO (t
))
9517 cp_error ("explicit instantiation of non-template type `%T'", t
);
9523 /* With -fexternal-templates, explicit instantiations are treated the same
9524 as implicit ones. */
9525 if (flag_external_templates
)
9528 if (!COMPLETE_TYPE_P (t
))
9531 cp_error ("explicit instantiation of `%#T' before definition of template",
9536 if (storage
!= NULL_TREE
)
9539 cp_pedwarn("ISO C++ forbids the use of `%s' on explicit instantiations",
9540 IDENTIFIER_POINTER (storage
));
9542 if (storage
== ridpointers
[(int) RID_INLINE
])
9544 else if (storage
== ridpointers
[(int) RID_EXTERN
])
9546 else if (storage
== ridpointers
[(int) RID_STATIC
])
9550 cp_error ("storage class `%D' applied to template instantiation",
9556 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
9560 No program shall both explicitly instantiate and explicitly
9561 specialize a template. */
9564 cp_error ("explicit instantiation of `%#T' after", t
);
9565 cp_error_at ("explicit specialization here", t
);
9569 else if (CLASSTYPE_EXPLICIT_INSTANTIATION (t
))
9573 No program shall explicitly instantiate any template more
9576 If CLASSTYPE_INTERFACE_ONLY, then the first explicit instantiation
9577 was `extern'. If EXTERN_P then the second is. If -frepo, chances
9578 are we already got marked as an explicit instantion because of the
9579 repo file. All these cases are OK. */
9580 if (!CLASSTYPE_INTERFACE_ONLY (t
) && !extern_p
&& !flag_use_repository
9582 cp_pedwarn ("duplicate explicit instantiation of `%#T'", t
);
9584 /* If we've already instantiated the template, just return now. */
9585 if (!CLASSTYPE_INTERFACE_ONLY (t
))
9589 mark_class_instantiated (t
, extern_p
);
9590 repo_template_instantiated (t
, extern_p
);
9598 /* In contrast to implicit instantiation, where only the
9599 declarations, and not the definitions, of members are
9600 instantiated, we have here:
9604 The explicit instantiation of a class template specialization
9605 implies the instantiation of all of its members not
9606 previously explicitly specialized in the translation unit
9607 containing the explicit instantiation.
9609 Of course, we can't instantiate member template classes, since
9610 we don't have any arguments for them. Note that the standard
9611 is unclear on whether the instantiation of the members are
9612 *explicit* instantiations or not. We choose to be generous,
9613 and not set DECL_EXPLICIT_INSTANTIATION. Therefore, we allow
9614 the explicit instantiation of a class where some of the members
9615 have no definition in the current translation unit. */
9618 for (tmp
= TYPE_METHODS (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
9619 if (TREE_CODE (tmp
) == FUNCTION_DECL
9620 && DECL_TEMPLATE_INSTANTIATION (tmp
))
9622 mark_decl_instantiated (tmp
, extern_p
);
9623 repo_template_instantiated (tmp
, extern_p
);
9625 instantiate_decl (tmp
, /*defer_ok=*/1);
9628 for (tmp
= TYPE_FIELDS (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
9629 if (TREE_CODE (tmp
) == VAR_DECL
&& DECL_TEMPLATE_INSTANTIATION (tmp
))
9631 mark_decl_instantiated (tmp
, extern_p
);
9632 repo_template_instantiated (tmp
, extern_p
);
9634 instantiate_decl (tmp
, /*defer_ok=*/1);
9637 for (tmp
= CLASSTYPE_TAGS (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
9638 if (IS_AGGR_TYPE (TREE_VALUE (tmp
))
9639 && !uses_template_parms (CLASSTYPE_TI_ARGS (TREE_VALUE (tmp
))))
9640 do_type_instantiation (TYPE_MAIN_DECL (TREE_VALUE (tmp
)), storage
, 0);
9644 /* Given a function DECL, which is a specialization of TMPL, modify
9645 DECL to be a re-instantiation of TMPL with the same template
9646 arguments. TMPL should be the template into which tsubst'ing
9647 should occur for DECL, not the most general template.
9649 One reason for doing this is a scenario like this:
9652 void f(const T&, int i);
9654 void g() { f(3, 7); }
9657 void f(const T& t, const int i) { }
9659 Note that when the template is first instantiated, with
9660 instantiate_template, the resulting DECL will have no name for the
9661 first parameter, and the wrong type for the second. So, when we go
9662 to instantiate the DECL, we regenerate it. */
9665 regenerate_decl_from_template (decl
, tmpl
)
9669 /* The most general version of TMPL. */
9671 /* The arguments used to instantiate DECL, from the most general
9678 args
= DECL_TI_ARGS (decl
);
9679 code_pattern
= DECL_TEMPLATE_RESULT (tmpl
);
9681 /* Unregister the specialization so that when we tsubst we will not
9682 just return DECL. We don't have to unregister DECL from TMPL
9683 because if would only be registered there if it were a partial
9684 instantiation of a specialization, which it isn't: it's a full
9686 gen_tmpl
= most_general_template (tmpl
);
9687 unregistered
= unregister_specialization (decl
, gen_tmpl
);
9689 /* If the DECL was not unregistered then something peculiar is
9690 happening: we created a specialization but did not call
9691 register_specialization for it. */
9692 my_friendly_assert (unregistered
, 0);
9694 if (TREE_CODE (decl
) == VAR_DECL
)
9695 /* Make sure that we can see identifiers, and compute access
9696 correctly, for the class members used in the declaration of
9697 this static variable. */
9698 pushclass (DECL_CONTEXT (decl
), 2);
9700 /* Do the substitution to get the new declaration. */
9701 new_decl
= tsubst (code_pattern
, args
, /*complain=*/1, NULL_TREE
);
9703 if (TREE_CODE (decl
) == VAR_DECL
)
9705 /* Set up DECL_INITIAL, since tsubst doesn't. */
9706 DECL_INITIAL (new_decl
) =
9707 tsubst_expr (DECL_INITIAL (code_pattern
), args
,
9708 /*complain=*/1, DECL_TI_TEMPLATE (decl
));
9709 /* Pop the class context we pushed above. */
9712 else if (TREE_CODE (decl
) == FUNCTION_DECL
)
9714 /* Convince duplicate_decls to use the DECL_ARGUMENTS from the
9716 DECL_INITIAL (new_decl
) = error_mark_node
;
9717 /* And don't complain about a duplicate definition. */
9718 DECL_INITIAL (decl
) = NULL_TREE
;
9721 /* The immediate parent of the new template is still whatever it was
9722 before, even though tsubst sets DECL_TI_TEMPLATE up as the most
9723 general template. We also reset the DECL_ASSEMBLER_NAME since
9724 tsubst always calculates the name as if the function in question
9725 were really a template instance, and sometimes, with friend
9726 functions, this is not so. See tsubst_friend_function for
9728 DECL_TI_TEMPLATE (new_decl
) = DECL_TI_TEMPLATE (decl
);
9729 COPY_DECL_ASSEMBLER_NAME (decl
, new_decl
);
9730 COPY_DECL_RTL (decl
, new_decl
);
9731 DECL_USE_TEMPLATE (new_decl
) = DECL_USE_TEMPLATE (decl
);
9733 /* Call duplicate decls to merge the old and new declarations. */
9734 duplicate_decls (new_decl
, decl
);
9736 /* Now, re-register the specialization. */
9737 register_specialization (decl
, gen_tmpl
, args
);
9740 /* Produce the definition of D, a _DECL generated from a template. If
9741 DEFER_OK is non-zero, then we don't have to actually do the
9742 instantiation now; we just have to do it sometime. */
9745 instantiate_decl (d
, defer_ok
)
9749 tree tmpl
= DECL_TI_TEMPLATE (d
);
9750 tree args
= DECL_TI_ARGS (d
);
9755 int pattern_defined
;
9758 const char *file
= input_filename
;
9760 /* This function should only be used to instantiate templates for
9761 functions and static member variables. */
9762 my_friendly_assert (TREE_CODE (d
) == FUNCTION_DECL
9763 || TREE_CODE (d
) == VAR_DECL
, 0);
9765 /* Don't instantiate cloned functions. Instead, instantiate the
9766 functions they cloned. */
9767 if (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_CLONED_FUNCTION_P (d
))
9768 d
= DECL_CLONED_FUNCTION (d
);
9770 if (DECL_TEMPLATE_INSTANTIATED (d
))
9771 /* D has already been instantiated. It might seem reasonable to
9772 check whether or not D is an explicit instantiation, and, if so,
9773 stop here. But when an explicit instantiation is deferred
9774 until the end of the compilation, DECL_EXPLICIT_INSTANTIATION
9775 is set, even though we still need to do the instantiation. */
9778 /* If we already have a specialization of this declaration, then
9779 there's no reason to instantiate it. Note that
9780 retrieve_specialization gives us both instantiations and
9781 specializations, so we must explicitly check
9782 DECL_TEMPLATE_SPECIALIZATION. */
9783 gen_tmpl
= most_general_template (tmpl
);
9784 spec
= retrieve_specialization (gen_tmpl
, args
);
9785 if (spec
!= NULL_TREE
&& DECL_TEMPLATE_SPECIALIZATION (spec
))
9788 /* This needs to happen before any tsubsting. */
9789 if (! push_tinst_level (d
))
9792 timevar_push (TV_PARSE
);
9794 /* Set TD to the template whose DECL_TEMPLATE_RESULT is the pattern
9795 for the instantiation. This is not always the most general
9796 template. Consider, for example:
9799 struct S { template <class U> void f();
9800 template <> void f<int>(); };
9802 and an instantiation of S<double>::f<int>. We want TD to be the
9803 specialization S<T>::f<int>, not the more general S<T>::f<U>. */
9805 while (/* An instantiation cannot have a definition, so we need a
9806 more general template. */
9807 DECL_TEMPLATE_INSTANTIATION (td
)
9808 /* We must also deal with friend templates. Given:
9810 template <class T> struct S {
9811 template <class U> friend void f() {};
9814 S<int>::f<U> say, is not an instantiation of S<T>::f<U>,
9815 so far as the language is concerned, but that's still
9816 where we get the pattern for the instantiation from. On
9817 other hand, if the definition comes outside the class, say:
9819 template <class T> struct S {
9820 template <class U> friend void f();
9822 template <class U> friend void f() {}
9824 we don't need to look any further. That's what the check for
9825 DECL_INITIAL is for. */
9826 || (TREE_CODE (d
) == FUNCTION_DECL
9827 && DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (td
)
9828 && !DECL_INITIAL (DECL_TEMPLATE_RESULT (td
))))
9830 /* The present template, TD, should not be a definition. If it
9831 were a definition, we should be using it! Note that we
9832 cannot restructure the loop to just keep going until we find
9833 a template with a definition, since that might go too far if
9834 a specialization was declared, but not defined. */
9835 my_friendly_assert (!(TREE_CODE (d
) == VAR_DECL
9836 && !DECL_IN_AGGR_P (DECL_TEMPLATE_RESULT (td
))),
9839 /* Fetch the more general template. */
9840 td
= DECL_TI_TEMPLATE (td
);
9843 code_pattern
= DECL_TEMPLATE_RESULT (td
);
9845 if (TREE_CODE (d
) == FUNCTION_DECL
)
9846 pattern_defined
= (DECL_SAVED_TREE (code_pattern
) != NULL_TREE
);
9848 pattern_defined
= ! DECL_IN_AGGR_P (code_pattern
);
9850 lineno
= DECL_SOURCE_LINE (d
);
9851 input_filename
= DECL_SOURCE_FILE (d
);
9853 if (pattern_defined
)
9855 /* Let the repository code that this template definition is
9858 The repository doesn't need to know about cloned functions
9859 because they never actually show up in the object file. It
9860 does need to know about the clones; those are the symbols
9861 that the linker will be emitting error messages about. */
9862 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (d
)
9863 || DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (d
))
9867 for (t
= TREE_CHAIN (d
);
9868 t
&& DECL_CLONED_FUNCTION_P (t
);
9870 repo_template_used (t
);
9873 repo_template_used (d
);
9875 if (flag_external_templates
&& ! DECL_INTERFACE_KNOWN (d
))
9877 if (flag_alt_external_templates
)
9879 if (interface_unknown
)
9880 warn_if_unknown_interface (d
);
9882 else if (DECL_INTERFACE_KNOWN (code_pattern
))
9884 DECL_INTERFACE_KNOWN (d
) = 1;
9885 DECL_NOT_REALLY_EXTERN (d
) = ! DECL_EXTERNAL (code_pattern
);
9888 warn_if_unknown_interface (code_pattern
);
9892 import_export_decl (d
);
9895 if (TREE_CODE (d
) == VAR_DECL
&& DECL_INITIALIZED_IN_CLASS_P (d
)
9896 && DECL_INITIAL (d
) == NULL_TREE
)
9897 /* We should have set up DECL_INITIAL in instantiate_class_template. */
9899 /* Reject all external templates except inline functions. */
9900 else if (DECL_INTERFACE_KNOWN (d
)
9901 && ! DECL_NOT_REALLY_EXTERN (d
)
9902 && ! (TREE_CODE (d
) == FUNCTION_DECL
9903 && DECL_INLINE (d
)))
9905 /* Defer all other templates, unless we have been explicitly
9906 forbidden from doing so. We restore the source position here
9907 because it's used by add_pending_template. */
9908 else if (! pattern_defined
|| defer_ok
)
9911 input_filename
= file
;
9913 if (at_eof
&& !pattern_defined
9914 && DECL_EXPLICIT_INSTANTIATION (d
))
9917 The definition of a non-exported function template, a
9918 non-exported member function template, or a non-exported
9919 member function or static data member of a class template
9920 shall be present in every translation unit in which it is
9921 explicitly instantiated. */
9923 ("explicit instantiation of `%D' but no definition available", d
);
9925 add_pending_template (d
);
9929 need_push
= !global_bindings_p ();
9931 push_to_top_level ();
9933 /* We're now committed to instantiating this template. Mark it as
9934 instantiated so that recursive calls to instantiate_decl do not
9935 try to instantiate it again. */
9936 DECL_TEMPLATE_INSTANTIATED (d
) = 1;
9938 /* Regenerate the declaration in case the template has been modified
9939 by a subsequent redeclaration. */
9940 regenerate_decl_from_template (d
, td
);
9942 /* We already set the file and line above. Reset them now in case
9943 they changed as a result of calling regenerate_decl_from_template. */
9944 lineno
= DECL_SOURCE_LINE (d
);
9945 input_filename
= DECL_SOURCE_FILE (d
);
9947 if (TREE_CODE (d
) == VAR_DECL
)
9949 DECL_IN_AGGR_P (d
) = 0;
9950 if (DECL_INTERFACE_KNOWN (d
))
9951 DECL_EXTERNAL (d
) = ! DECL_NOT_REALLY_EXTERN (d
);
9954 DECL_EXTERNAL (d
) = 1;
9955 DECL_NOT_REALLY_EXTERN (d
) = 1;
9957 cp_finish_decl (d
, DECL_INITIAL (d
), NULL_TREE
, 0);
9959 else if (TREE_CODE (d
) == FUNCTION_DECL
)
9961 htab_t saved_local_specializations
;
9963 /* Save away the current list, in case we are instantiating one
9964 template from within the body of another. */
9965 saved_local_specializations
= local_specializations
;
9967 /* Set up the list of local specializations. */
9968 local_specializations
= htab_create (37,
9973 /* Set up context. */
9974 start_function (NULL_TREE
, d
, NULL_TREE
, SF_PRE_PARSED
);
9976 /* Substitute into the body of the function. */
9977 tsubst_expr (DECL_SAVED_TREE (code_pattern
), args
,
9978 /*complain=*/1, tmpl
);
9980 /* We don't need the local specializations any more. */
9981 htab_delete (local_specializations
);
9982 local_specializations
= saved_local_specializations
;
9984 /* Finish the function. */
9985 expand_body (finish_function (0));
9988 /* We're not deferring instantiation any more. */
9989 TI_PENDING_TEMPLATE_FLAG (DECL_TEMPLATE_INFO (d
)) = 0;
9992 pop_from_top_level ();
9996 input_filename
= file
;
10000 timevar_pop (TV_PARSE
);
10005 /* Run through the list of templates that we wish we could
10006 instantiate, and instantiate any we can. */
10009 instantiate_pending_templates ()
10012 tree last
= NULL_TREE
;
10013 int instantiated_something
= 0;
10020 t
= &pending_templates
;
10023 tree instantiation
= TREE_VALUE (*t
);
10025 reopen_tinst_level (TREE_PURPOSE (*t
));
10027 if (TYPE_P (instantiation
))
10031 if (!COMPLETE_TYPE_P (instantiation
))
10033 instantiate_class_template (instantiation
);
10034 if (CLASSTYPE_TEMPLATE_INSTANTIATION (instantiation
))
10035 for (fn
= TYPE_METHODS (instantiation
);
10037 fn
= TREE_CHAIN (fn
))
10038 if (! DECL_ARTIFICIAL (fn
))
10039 instantiate_decl (fn
, /*defer_ok=*/0);
10040 if (COMPLETE_TYPE_P (instantiation
))
10042 instantiated_something
= 1;
10047 if (COMPLETE_TYPE_P (instantiation
))
10048 /* If INSTANTIATION has been instantiated, then we don't
10049 need to consider it again in the future. */
10050 *t
= TREE_CHAIN (*t
);
10054 t
= &TREE_CHAIN (*t
);
10059 if (!DECL_TEMPLATE_SPECIALIZATION (instantiation
)
10060 && !DECL_TEMPLATE_INSTANTIATED (instantiation
))
10062 instantiation
= instantiate_decl (instantiation
,
10064 if (DECL_TEMPLATE_INSTANTIATED (instantiation
))
10066 instantiated_something
= 1;
10071 if (DECL_TEMPLATE_SPECIALIZATION (instantiation
)
10072 || DECL_TEMPLATE_INSTANTIATED (instantiation
))
10073 /* If INSTANTIATION has been instantiated, then we don't
10074 need to consider it again in the future. */
10075 *t
= TREE_CHAIN (*t
);
10079 t
= &TREE_CHAIN (*t
);
10083 current_tinst_level
= NULL_TREE
;
10085 last_pending_template
= last
;
10087 while (reconsider
);
10089 return instantiated_something
;
10092 /* Substitute ARGVEC into T, which is a list of initializers for
10093 either base class or a non-static data member. The TREE_PURPOSEs
10094 are DECLs, and the TREE_VALUEs are the initializer values. Used by
10095 instantiate_decl. */
10098 tsubst_initializer_list (t
, argvec
)
10101 tree first
= NULL_TREE
;
10104 for (; t
; t
= TREE_CHAIN (t
))
10110 decl
= tsubst_copy (TREE_PURPOSE (t
), argvec
, /*complain=*/1,
10112 init
= tsubst_expr (TREE_VALUE (t
), argvec
, /*complain=*/1,
10117 else if (TREE_CODE (init
) == TREE_LIST
)
10118 for (val
= init
; val
; val
= TREE_CHAIN (val
))
10119 TREE_VALUE (val
) = convert_from_reference (TREE_VALUE (val
));
10121 init
= convert_from_reference (init
);
10123 *p
= build_tree_list (decl
, init
);
10124 p
= &TREE_CHAIN (*p
);
10129 /* Set CURRENT_ACCESS_SPECIFIER based on the protection of DECL. */
10132 set_current_access_from_decl (decl
)
10135 if (TREE_PRIVATE (decl
))
10136 current_access_specifier
= access_private_node
;
10137 else if (TREE_PROTECTED (decl
))
10138 current_access_specifier
= access_protected_node
;
10140 current_access_specifier
= access_public_node
;
10143 /* Instantiate an enumerated type. TAG is the template type, NEWTAG
10144 is the instantiation (which should have been created with
10145 start_enum) and ARGS are the template arguments to use. */
10148 tsubst_enum (tag
, newtag
, args
)
10155 for (e
= TYPE_VALUES (tag
); e
; e
= TREE_CHAIN (e
))
10159 /* Note that in a template enum, the TREE_VALUE is the
10160 CONST_DECL, not the corresponding INTEGER_CST. */
10161 value
= tsubst_expr (DECL_INITIAL (TREE_VALUE (e
)),
10162 args
, /*complain=*/1,
10165 /* Give this enumeration constant the correct access. */
10166 set_current_access_from_decl (TREE_VALUE (e
));
10168 /* Actually build the enumerator itself. */
10169 build_enumerator (TREE_PURPOSE (e
), value
, newtag
);
10172 finish_enum (newtag
);
10173 DECL_SOURCE_LINE (TYPE_NAME (newtag
)) = DECL_SOURCE_LINE (TYPE_NAME (tag
));
10174 DECL_SOURCE_FILE (TYPE_NAME (newtag
)) = DECL_SOURCE_FILE (TYPE_NAME (tag
));
10177 /* DECL is a FUNCTION_DECL that is a template specialization. Return
10178 its type -- but without substituting the innermost set of template
10179 arguments. So, innermost set of template parameters will appear in
10180 the type. If CONTEXTP is non-NULL, then the partially substituted
10181 DECL_CONTEXT (if any) will also be filled in. Similarly, TPARMSP
10182 will be filled in with the substituted template parameters, if it
10186 get_mostly_instantiated_function_type (decl
, contextp
, tparmsp
)
10191 tree context
= NULL_TREE
;
10198 tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
10199 targs
= DECL_TI_ARGS (decl
);
10200 tparms
= DECL_TEMPLATE_PARMS (tmpl
);
10201 parm_depth
= TMPL_PARMS_DEPTH (tparms
);
10203 /* There should be as many levels of arguments as there are levels
10205 my_friendly_assert (parm_depth
== TMPL_ARGS_DEPTH (targs
), 0);
10207 fn_type
= TREE_TYPE (tmpl
);
10208 if (DECL_STATIC_FUNCTION_P (decl
))
10209 context
= DECL_CONTEXT (decl
);
10211 if (parm_depth
== 1)
10212 /* No substitution is necessary. */
10219 /* Replace the innermost level of the TARGS with NULL_TREEs to
10220 let tsubst know not to substitute for those parameters. */
10221 partial_args
= make_tree_vec (TREE_VEC_LENGTH (targs
));
10222 for (i
= 1; i
< TMPL_ARGS_DEPTH (targs
); ++i
)
10223 SET_TMPL_ARGS_LEVEL (partial_args
, i
,
10224 TMPL_ARGS_LEVEL (targs
, i
));
10225 SET_TMPL_ARGS_LEVEL (partial_args
,
10226 TMPL_ARGS_DEPTH (targs
),
10227 make_tree_vec (DECL_NTPARMS (tmpl
)));
10229 /* Now, do the (partial) substitution to figure out the
10230 appropriate function type. */
10231 fn_type
= tsubst (fn_type
, partial_args
, /*complain=*/1, NULL_TREE
);
10232 if (DECL_STATIC_FUNCTION_P (decl
))
10233 context
= tsubst (context
, partial_args
, /*complain=*/1, NULL_TREE
);
10235 /* Substitute into the template parameters to obtain the real
10236 innermost set of parameters. This step is important if the
10237 innermost set of template parameters contains value
10238 parameters whose types depend on outer template parameters. */
10239 TREE_VEC_LENGTH (partial_args
)--;
10240 tparms
= tsubst_template_parms (tparms
, partial_args
, /*complain=*/1);
10244 *contextp
= context
;
10251 /* Return truthvalue if we're processing a template different from
10252 the last one involved in diagnostics. */
10254 problematic_instantiation_changed ()
10256 return last_template_error_tick
!= tinst_level_tick
;
10259 /* Remember current template involved in diagnostics. */
10261 record_last_problematic_instantiation ()
10263 last_template_error_tick
= tinst_level_tick
;
10267 current_instantiation ()
10269 return current_tinst_level
;
10272 /* [temp.param] Check that template non-type parm TYPE is of an allowable
10273 type. Return zero for ok, non-zero for disallowed. If COMPLAIN is
10274 non-zero, then complain. */
10277 invalid_nontype_parm_type_p (type
, complain
)
10281 if (INTEGRAL_TYPE_P (type
))
10283 else if (POINTER_TYPE_P (type
))
10285 else if (TYPE_PTRMEM_P (type
))
10287 else if (TYPE_PTRMEMFUNC_P (type
))
10289 else if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
)
10291 else if (TREE_CODE (type
) == TYPENAME_TYPE
)
10295 cp_error ("`%#T' is not a valid type for a template constant parameter",