1 /* Handle parameterized types (templates) for GNU C++.
2 Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000
3 Free Software Foundation, Inc.
4 Written by Ken Raeburn (raeburn@cygnus.com) while at Watchmaker Computing.
5 Rewritten by Jason Merrill (jason@cygnus.com).
7 This file is part of GNU CC.
9 GNU CC is free software; you can redistribute it and/or modify
10 it under the terms of the GNU General Public License as published by
11 the Free Software Foundation; either version 2, or (at your option)
14 GNU CC is distributed in the hope that it will be useful,
15 but WITHOUT ANY WARRANTY; without even the implied warranty of
16 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 GNU General Public License for more details.
19 You should have received a copy of the GNU General Public License
20 along with GNU CC; see the file COPYING. If not, write to
21 the Free Software Foundation, 59 Temple Place - Suite 330,
22 Boston, MA 02111-1307, USA. */
24 /* Known bugs or deficiencies include:
26 all methods must be provided in header files; can't use a source
27 file that contains only the method templates and "just win". */
47 /* The type of functions taking a tree, and some additional data, and
49 typedef int (*tree_fn_t
) PARAMS ((tree
, void*));
51 extern struct obstack permanent_obstack
;
54 extern char *input_filename
;
56 /* The PENDING_TEMPLATES is a TREE_LIST of templates whose
57 instantiations have been deferred, either because their definitions
58 were not yet available, or because we were putting off doing the
59 work. The TREE_PURPOSE of each entry is a SRCLOC indicating where
60 the instantiate request occurred; the TREE_VALUE is a either a DECL
61 (for a function or static data member), or a TYPE (for a class)
62 indicating what we are hoping to instantiate. */
63 static tree pending_templates
;
64 static tree
*template_tail
= &pending_templates
;
66 static tree maybe_templates
;
67 static tree
*maybe_template_tail
= &maybe_templates
;
69 int processing_template_parmlist
;
70 static int template_header_count
;
72 static tree saved_trees
;
73 static varray_type inline_parm_levels
;
74 static size_t inline_parm_levels_used
;
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
85 #define GTB_VIA_VIRTUAL 1 /* The base class we are examining is
86 virtual, or a base class of a virtual
88 #define GTB_IGNORE_TYPE 2 /* We don't need to try to unify the current
89 type with the desired type. */
91 static int resolve_overloaded_unification
PARAMS ((tree
, tree
, tree
, tree
,
92 unification_kind_t
, int));
93 static int try_one_overload
PARAMS ((tree
, tree
, tree
, tree
, tree
,
94 unification_kind_t
, int));
95 static int unify
PARAMS ((tree
, tree
, tree
, tree
, int));
96 static void add_pending_template
PARAMS ((tree
));
97 static int push_tinst_level
PARAMS ((tree
));
98 static tree classtype_mangled_name
PARAMS ((tree
));
99 static char *mangle_class_name_for_template
PARAMS ((char *, tree
, tree
));
100 static tree tsubst_expr_values
PARAMS ((tree
, tree
));
101 static int list_eq
PARAMS ((tree
, tree
));
102 static tree get_class_bindings
PARAMS ((tree
, tree
, tree
));
103 static tree coerce_template_parms
PARAMS ((tree
, tree
, tree
, int, int));
104 static void tsubst_enum
PARAMS ((tree
, tree
, tree
));
105 static tree add_to_template_args
PARAMS ((tree
, tree
));
106 static tree add_outermost_template_args
PARAMS ((tree
, tree
));
107 static void maybe_adjust_types_for_deduction
PARAMS ((unification_kind_t
, tree
*,
109 static int type_unification_real
PARAMS ((tree
, tree
, tree
, tree
,
110 int, unification_kind_t
, int));
111 static void note_template_header
PARAMS ((int));
112 static tree maybe_fold_nontype_arg
PARAMS ((tree
));
113 static tree convert_nontype_argument
PARAMS ((tree
, tree
));
114 static tree convert_template_argument
PARAMS ((tree
, tree
, tree
, int,
116 static tree get_bindings_overload
PARAMS ((tree
, tree
, tree
));
117 static int for_each_template_parm
PARAMS ((tree
, tree_fn_t
, void*));
118 static tree build_template_parm_index
PARAMS ((int, int, int, tree
, tree
));
119 static int inline_needs_template_parms
PARAMS ((tree
));
120 static void push_inline_template_parms_recursive
PARAMS ((tree
, int));
121 static tree retrieve_specialization
PARAMS ((tree
, tree
));
122 static tree retrieve_local_specialization
PARAMS ((tree
, tree
));
123 static tree register_specialization
PARAMS ((tree
, tree
, tree
));
124 static tree register_local_specialization
PARAMS ((tree
, tree
, tree
));
125 static int unregister_specialization
PARAMS ((tree
, tree
));
126 static tree reduce_template_parm_level
PARAMS ((tree
, tree
, int));
127 static tree build_template_decl
PARAMS ((tree
, tree
));
128 static int mark_template_parm
PARAMS ((tree
, void *));
129 static tree tsubst_friend_function
PARAMS ((tree
, tree
));
130 static tree tsubst_friend_class
PARAMS ((tree
, tree
));
131 static tree get_bindings_real
PARAMS ((tree
, tree
, tree
, int));
132 static int template_decl_level
PARAMS ((tree
));
133 static tree maybe_get_template_decl_from_type_decl
PARAMS ((tree
));
134 static int check_cv_quals_for_unify
PARAMS ((int, tree
, tree
));
135 static tree tsubst_template_arg_vector
PARAMS ((tree
, tree
, int));
136 static tree tsubst_template_parms
PARAMS ((tree
, tree
, int));
137 static void regenerate_decl_from_template
PARAMS ((tree
, tree
));
138 static tree most_specialized
PARAMS ((tree
, tree
, tree
));
139 static tree most_specialized_class
PARAMS ((tree
, tree
));
140 static void set_mangled_name_for_template_decl
PARAMS ((tree
));
141 static int template_class_depth_real
PARAMS ((tree
, int));
142 static tree tsubst_aggr_type
PARAMS ((tree
, tree
, int, tree
, int));
143 static tree tsubst_decl
PARAMS ((tree
, tree
, tree
, tree
));
144 static tree tsubst_arg_types
PARAMS ((tree
, tree
, int, tree
));
145 static tree tsubst_function_type
PARAMS ((tree
, tree
, int, tree
));
146 static void check_specialization_scope
PARAMS ((void));
147 static tree process_partial_specialization
PARAMS ((tree
));
148 static void set_current_access_from_decl
PARAMS ((tree
));
149 static void check_default_tmpl_args
PARAMS ((tree
, tree
, int, int));
150 static tree tsubst_call_declarator_parms
PARAMS ((tree
, tree
, int, tree
));
151 static tree get_template_base_recursive
PARAMS ((tree
, tree
,
152 tree
, tree
, tree
, int));
153 static tree get_template_base
PARAMS ((tree
, tree
, tree
, tree
));
154 static tree try_class_unification
PARAMS ((tree
, tree
, tree
, tree
));
155 static int coerce_template_template_parms
PARAMS ((tree
, tree
, int,
157 static tree determine_specialization
PARAMS ((tree
, tree
, tree
*, int));
158 static int template_args_equal
PARAMS ((tree
, tree
));
159 static void print_template_context
PARAMS ((int));
160 static void tsubst_default_arguments
PARAMS ((tree
));
161 static tree for_each_template_parm_r
PARAMS ((tree
*, int *, void *));
163 /* Called once to initialize pt.c. */
168 ggc_add_tree_root (&pending_templates
, 1);
169 ggc_add_tree_root (&maybe_templates
, 1);
170 ggc_add_tree_root (&saved_trees
, 1);
173 /* Do any processing required when DECL (a member template declaration
174 using TEMPLATE_PARAMETERS as its innermost parameter list) is
175 finished. Returns the TEMPLATE_DECL corresponding to DECL, unless
176 it is a specialization, in which case the DECL itself is returned. */
179 finish_member_template_decl (decl
)
182 if (decl
== NULL_TREE
|| decl
== void_type_node
)
184 else if (decl
== error_mark_node
)
185 /* By returning NULL_TREE, the parser will just ignore this
186 declaration. We have already issued the error. */
188 else if (TREE_CODE (decl
) == TREE_LIST
)
190 /* Assume that the class is the only declspec. */
191 decl
= TREE_VALUE (decl
);
192 if (IS_AGGR_TYPE (decl
) && CLASSTYPE_TEMPLATE_INFO (decl
)
193 && ! CLASSTYPE_TEMPLATE_SPECIALIZATION (decl
))
195 tree tmpl
= CLASSTYPE_TI_TEMPLATE (decl
);
196 check_member_template (tmpl
);
201 else if (TREE_CODE (decl
) == FIELD_DECL
)
202 cp_error ("data member `%D' cannot be a member template", decl
);
203 else if (DECL_TEMPLATE_INFO (decl
))
205 if (!DECL_TEMPLATE_SPECIALIZATION (decl
))
207 check_member_template (DECL_TI_TEMPLATE (decl
));
208 return DECL_TI_TEMPLATE (decl
);
214 cp_error ("invalid member template declaration `%D'", decl
);
216 return error_mark_node
;
219 /* Returns the template nesting level of the indicated class TYPE.
229 A<T>::B<U> has depth two, while A<T> has depth one.
230 Both A<T>::B<int> and A<int>::B<U> have depth one, if
231 COUNT_SPECIALIZATIONS is 0 or if they are instantiations, not
234 This function is guaranteed to return 0 if passed NULL_TREE so
235 that, for example, `template_class_depth (current_class_type)' is
239 template_class_depth_real (type
, count_specializations
)
241 int count_specializations
;
246 type
&& TREE_CODE (type
) != NAMESPACE_DECL
;
247 type
= (TREE_CODE (type
) == FUNCTION_DECL
)
248 ? CP_DECL_CONTEXT (type
) : TYPE_CONTEXT (type
))
250 if (TREE_CODE (type
) != FUNCTION_DECL
)
252 if (CLASSTYPE_TEMPLATE_INFO (type
)
253 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (type
))
254 && ((count_specializations
255 && CLASSTYPE_TEMPLATE_SPECIALIZATION (type
))
256 || uses_template_parms (CLASSTYPE_TI_ARGS (type
))))
261 if (DECL_TEMPLATE_INFO (type
)
262 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (type
))
263 && ((count_specializations
264 && DECL_TEMPLATE_SPECIALIZATION (type
))
265 || uses_template_parms (DECL_TI_ARGS (type
))))
273 /* Returns the template nesting level of the indicated class TYPE.
274 Like template_class_depth_real, but instantiations do not count in
278 template_class_depth (type
)
281 return template_class_depth_real (type
, /*count_specializations=*/0);
284 /* Returns 1 if processing DECL as part of do_pending_inlines
285 needs us to push template parms. */
288 inline_needs_template_parms (decl
)
291 if (! DECL_TEMPLATE_INFO (decl
))
294 return (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (most_general_template (decl
)))
295 > (processing_template_decl
+ DECL_TEMPLATE_SPECIALIZATION (decl
)));
298 /* Subroutine of maybe_begin_member_template_processing.
299 Push the template parms in PARMS, starting from LEVELS steps into the
300 chain, and ending at the beginning, since template parms are listed
304 push_inline_template_parms_recursive (parmlist
, levels
)
308 tree parms
= TREE_VALUE (parmlist
);
312 push_inline_template_parms_recursive (TREE_CHAIN (parmlist
), levels
- 1);
314 ++processing_template_decl
;
315 current_template_parms
316 = tree_cons (build_int_2 (0, processing_template_decl
),
317 parms
, current_template_parms
);
318 TEMPLATE_PARMS_FOR_INLINE (current_template_parms
) = 1;
321 for (i
= 0; i
< TREE_VEC_LENGTH (parms
); ++i
)
323 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
324 my_friendly_assert (TREE_CODE_CLASS (TREE_CODE (parm
)) == 'd', 0);
326 switch (TREE_CODE (parm
))
335 /* Make a CONST_DECL as is done in process_template_parm.
336 It is ugly that we recreate this here; the original
337 version built in process_template_parm is no longer
339 tree decl
= build_decl (CONST_DECL
, DECL_NAME (parm
),
341 SET_DECL_ARTIFICIAL (decl
);
342 DECL_INITIAL (decl
) = DECL_INITIAL (parm
);
343 SET_DECL_TEMPLATE_PARM_P (decl
);
349 my_friendly_abort (0);
354 /* Restore the template parameter context for a member template or
355 a friend template defined in a class definition. */
358 maybe_begin_member_template_processing (decl
)
364 if (inline_needs_template_parms (decl
))
366 parms
= DECL_TEMPLATE_PARMS (most_general_template (decl
));
367 levels
= TMPL_PARMS_DEPTH (parms
) - processing_template_decl
;
369 if (DECL_TEMPLATE_SPECIALIZATION (decl
))
372 parms
= TREE_CHAIN (parms
);
375 push_inline_template_parms_recursive (parms
, levels
);
378 /* Remember how many levels of template parameters we pushed so that
379 we can pop them later. */
380 if (!inline_parm_levels
)
381 VARRAY_INT_INIT (inline_parm_levels
, 4, "inline_parm_levels");
382 if (inline_parm_levels_used
== inline_parm_levels
->num_elements
)
383 VARRAY_GROW (inline_parm_levels
, 2 * inline_parm_levels_used
);
384 VARRAY_INT (inline_parm_levels
, inline_parm_levels_used
) = levels
;
385 ++inline_parm_levels_used
;
388 /* Undo the effects of begin_member_template_processing. */
391 maybe_end_member_template_processing ()
395 if (!inline_parm_levels_used
)
398 --inline_parm_levels_used
;
400 i
< VARRAY_INT (inline_parm_levels
, inline_parm_levels_used
);
403 --processing_template_decl
;
404 current_template_parms
= TREE_CHAIN (current_template_parms
);
409 /* Returns non-zero iff T is a member template function. We must be
412 template <class T> class C { void f(); }
414 Here, f is a template function, and a member, but not a member
415 template. This function does not concern itself with the origin of
416 T, only its present state. So if we have
418 template <class T> class C { template <class U> void f(U); }
420 then neither C<int>::f<char> nor C<T>::f<double> is considered
421 to be a member template. But, `template <class U> void
422 C<int>::f(U)' is considered a member template. */
425 is_member_template (t
)
428 if (!DECL_FUNCTION_TEMPLATE_P (t
))
429 /* Anything that isn't a function or a template function is
430 certainly not a member template. */
433 /* A local class can't have member templates. */
434 if (decl_function_context (t
))
437 return (DECL_FUNCTION_MEMBER_P (DECL_TEMPLATE_RESULT (t
))
438 /* If there are more levels of template parameters than
439 there are template classes surrounding the declaration,
440 then we have a member template. */
441 && (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (t
)) >
442 template_class_depth (DECL_CONTEXT (t
))));
446 /* Returns non-zero iff T is a member template class. See
447 is_member_template for a description of what precisely constitutes
448 a member template. */
451 is_member_template_class (t
)
454 if (!DECL_CLASS_TEMPLATE_P (t
))
455 /* Anything that isn't a class template, is certainly not a member
459 if (!DECL_CLASS_SCOPE_P (t
))
460 /* Anything whose context isn't a class type is surely not a
464 /* If there are more levels of template parameters than there are
465 template classes surrounding the declaration, then we have a
467 return (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (t
)) >
468 template_class_depth (DECL_CONTEXT (t
)));
472 /* Return a new template argument vector which contains all of ARGS,
473 but has as its innermost set of arguments the EXTRA_ARGS. The
474 resulting vector will be built on a temporary obstack, and so must
475 be explicitly copied to the permanent obstack, if required. */
478 add_to_template_args (args
, extra_args
)
487 extra_depth
= TMPL_ARGS_DEPTH (extra_args
);
488 new_args
= make_tree_vec (TMPL_ARGS_DEPTH (args
) + extra_depth
);
490 for (i
= 1; i
<= TMPL_ARGS_DEPTH (args
); ++i
)
491 SET_TMPL_ARGS_LEVEL (new_args
, i
, TMPL_ARGS_LEVEL (args
, i
));
493 for (j
= 1; j
<= extra_depth
; ++j
, ++i
)
494 SET_TMPL_ARGS_LEVEL (new_args
, i
, TMPL_ARGS_LEVEL (extra_args
, j
));
499 /* Like add_to_template_args, but only the outermost ARGS are added to
500 the EXTRA_ARGS. In particular, all but TMPL_ARGS_DEPTH
501 (EXTRA_ARGS) levels are added. This function is used to combine
502 the template arguments from a partial instantiation with the
503 template arguments used to attain the full instantiation from the
504 partial instantiation. */
507 add_outermost_template_args (args
, extra_args
)
513 /* If there are more levels of EXTRA_ARGS than there are ARGS,
514 something very fishy is going on. */
515 my_friendly_assert (TMPL_ARGS_DEPTH (args
) >= TMPL_ARGS_DEPTH (extra_args
),
518 /* If *all* the new arguments will be the EXTRA_ARGS, just return
520 if (TMPL_ARGS_DEPTH (args
) == TMPL_ARGS_DEPTH (extra_args
))
523 /* For the moment, we make ARGS look like it contains fewer levels. */
524 TREE_VEC_LENGTH (args
) -= TMPL_ARGS_DEPTH (extra_args
);
526 new_args
= add_to_template_args (args
, extra_args
);
528 /* Now, we restore ARGS to its full dimensions. */
529 TREE_VEC_LENGTH (args
) += TMPL_ARGS_DEPTH (extra_args
);
534 /* We've got a template header coming up; push to a new level for storing
538 begin_template_parm_list ()
540 /* We use a non-tag-transparent scope here, which causes pushtag to
541 put tags in this scope, rather than in the enclosing class or
542 namespace scope. This is the right thing, since we want
543 TEMPLATE_DECLS, and not TYPE_DECLS for template classes. For a
544 global template class, push_template_decl handles putting the
545 TEMPLATE_DECL into top-level scope. For a nested template class,
548 template <class T> struct S1 {
549 template <class T> struct S2 {};
552 pushtag contains special code to call pushdecl_with_scope on the
553 TEMPLATE_DECL for S2. */
555 declare_pseudo_global_level ();
556 ++processing_template_decl
;
557 ++processing_template_parmlist
;
558 note_template_header (0);
561 /* This routine is called when a specialization is declared. If it is
562 illegal to declare a specialization here, an error is reported. */
565 check_specialization_scope ()
567 tree scope
= current_scope ();
571 An explicit specialization shall be declared in the namespace of
572 which the template is a member, or, for member templates, in the
573 namespace of which the enclosing class or enclosing class
574 template is a member. An explicit specialization of a member
575 function, member class or static data member of a class template
576 shall be declared in the namespace of which the class template
578 if (scope
&& TREE_CODE (scope
) != NAMESPACE_DECL
)
579 cp_error ("explicit specialization in non-namespace scope `%D'",
584 In an explicit specialization declaration for a member of a class
585 template or a member template that appears in namespace scope,
586 the member template and some of its enclosing class templates may
587 remain unspecialized, except that the declaration shall not
588 explicitly specialize a class member template if its enclosing
589 class templates are not explicitly specialized as well. */
590 if (current_template_parms
)
591 cp_error ("enclosing class templates are not explicitly specialized");
594 /* We've just seen template <>. */
597 begin_specialization ()
599 note_template_header (1);
600 check_specialization_scope ();
603 /* Called at then end of processing a declaration preceeded by
607 end_specialization ()
609 reset_specialization ();
612 /* Any template <>'s that we have seen thus far are not referring to a
613 function specialization. */
616 reset_specialization ()
618 processing_specialization
= 0;
619 template_header_count
= 0;
622 /* We've just seen a template header. If SPECIALIZATION is non-zero,
623 it was of the form template <>. */
626 note_template_header (specialization
)
629 processing_specialization
= specialization
;
630 template_header_count
++;
633 /* We're beginning an explicit instantiation. */
636 begin_explicit_instantiation ()
638 ++processing_explicit_instantiation
;
643 end_explicit_instantiation ()
645 my_friendly_assert(processing_explicit_instantiation
> 0, 0);
646 --processing_explicit_instantiation
;
649 /* The TYPE is being declared. If it is a template type, that means it
650 is a partial specialization. Do appropriate error-checking. */
653 maybe_process_partial_specialization (type
)
656 if (IS_AGGR_TYPE (type
) && CLASSTYPE_USE_TEMPLATE (type
))
658 if (CLASSTYPE_IMPLICIT_INSTANTIATION (type
)
659 && TYPE_SIZE (type
) == NULL_TREE
)
661 if (current_namespace
662 != decl_namespace_context (CLASSTYPE_TI_TEMPLATE (type
)))
664 cp_pedwarn ("specializing `%#T' in different namespace", type
);
665 cp_pedwarn_at (" from definition of `%#D'",
666 CLASSTYPE_TI_TEMPLATE (type
));
668 SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (type
);
669 if (processing_template_decl
)
670 push_template_decl (TYPE_MAIN_DECL (type
));
672 else if (CLASSTYPE_TEMPLATE_INSTANTIATION (type
))
673 cp_error ("specialization of `%T' after instantiation", type
);
675 else if (processing_specialization
)
676 cp_error ("explicit specialization of non-template `%T'", type
);
679 /* Retrieve the specialization (in the sense of [temp.spec] - a
680 specialization is either an instantiation or an explicit
681 specialization) of TMPL for the given template ARGS. If there is
682 no such specialization, return NULL_TREE. The ARGS are a vector of
683 arguments, or a vector of vectors of arguments, in the case of
684 templates with more than one level of parameters. */
687 retrieve_specialization (tmpl
, args
)
693 my_friendly_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
, 0);
695 /* There should be as many levels of arguments as there are
696 levels of parameters. */
697 my_friendly_assert (TMPL_ARGS_DEPTH (args
)
698 == TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
)),
701 for (s
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
704 if (comp_template_args (TREE_PURPOSE (s
), args
))
705 return TREE_VALUE (s
);
710 /* Like retrieve_speciailization, but for local declarations. FN is
711 the function in which we are looking for an instantiation. */
714 retrieve_local_specialization (tmpl
, fn
)
718 tree s
= purpose_member (fn
, DECL_TEMPLATE_SPECIALIZATIONS (tmpl
));
719 return s
? TREE_VALUE (s
) : NULL_TREE
;
722 /* Returns non-zero iff DECL is a specialization of TMPL. */
725 is_specialization_of (decl
, tmpl
)
731 if (TREE_CODE (decl
) == FUNCTION_DECL
)
735 t
= DECL_TEMPLATE_INFO (t
) ? DECL_TI_TEMPLATE (t
) : NULL_TREE
)
741 my_friendly_assert (TREE_CODE (decl
) == TYPE_DECL
, 0);
743 for (t
= TREE_TYPE (decl
);
745 t
= CLASSTYPE_USE_TEMPLATE (t
)
746 ? TREE_TYPE (CLASSTYPE_TI_TEMPLATE (t
)) : NULL_TREE
)
747 if (same_type_p (TYPE_MAIN_VARIANT (t
),
748 TYPE_MAIN_VARIANT (TREE_TYPE (tmpl
))))
755 /* Register the specialization SPEC as a specialization of TMPL with
756 the indicated ARGS. Returns SPEC, or an equivalent prior
757 declaration, if available. */
760 register_specialization (spec
, tmpl
, args
)
767 my_friendly_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
, 0);
769 if (TREE_CODE (spec
) == FUNCTION_DECL
770 && uses_template_parms (DECL_TI_ARGS (spec
)))
771 /* This is the FUNCTION_DECL for a partial instantiation. Don't
772 register it; we want the corresponding TEMPLATE_DECL instead.
773 We use `uses_template_parms (DECL_TI_ARGS (spec))' rather than
774 the more obvious `uses_template_parms (spec)' to avoid problems
775 with default function arguments. In particular, given
778 template <class T> void f(T t1, T t = T())
780 the default argument expression is not substituted for in an
781 instantiation unless and until it is actually needed. */
784 /* There should be as many levels of arguments as there are
785 levels of parameters. */
786 my_friendly_assert (TMPL_ARGS_DEPTH (args
)
787 == TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
)),
790 for (s
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
794 tree fn
= TREE_VALUE (s
);
796 /* We can sometimes try to re-register a specialization that we've
797 already got. In particular, regenerate_decl_from_template
798 calls duplicate_decls which will update the specialization
799 list. But, we'll still get called again here anyhow. It's
800 more convenient to simply allow this than to try to prevent it. */
803 else if (comp_template_args (TREE_PURPOSE (s
), args
))
805 if (DECL_TEMPLATE_SPECIALIZATION (spec
))
807 if (DECL_TEMPLATE_INSTANTIATION (fn
))
810 || DECL_EXPLICIT_INSTANTIATION (fn
))
812 cp_error ("specialization of %D after instantiation",
818 /* This situation should occur only if the first
819 specialization is an implicit instantiation,
820 the second is an explicit specialization, and
821 the implicit instantiation has not yet been
822 used. That situation can occur if we have
823 implicitly instantiated a member function and
824 then specialized it later.
826 We can also wind up here if a friend
827 declaration that looked like an instantiation
828 turns out to be a specialization:
830 template <class T> void foo(T);
831 class S { friend void foo<>(int) };
832 template <> void foo(int);
834 We transform the existing DECL in place so that
835 any pointers to it become pointers to the
838 If there was a definition for the template, but
839 not for the specialization, we want this to
840 look as if there is no definition, and vice
842 DECL_INITIAL (fn
) = NULL_TREE
;
843 duplicate_decls (spec
, fn
);
848 else if (DECL_TEMPLATE_SPECIALIZATION (fn
))
850 duplicate_decls (spec
, fn
);
857 DECL_TEMPLATE_SPECIALIZATIONS (tmpl
)
858 = tree_cons (args
, spec
, DECL_TEMPLATE_SPECIALIZATIONS (tmpl
));
863 /* Unregister the specialization SPEC as a specialization of TMPL.
864 Returns nonzero if the SPEC was listed as a specialization of
868 unregister_specialization (spec
, tmpl
)
874 for (s
= &DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
876 s
= &TREE_CHAIN (*s
))
877 if (TREE_VALUE (*s
) == spec
)
879 *s
= TREE_CHAIN (*s
);
886 /* Like register_specialization, but for local declarations. FN is
887 the function in which we are registering SPEC, an instantiation of
891 register_local_specialization (spec
, tmpl
, fn
)
896 DECL_TEMPLATE_SPECIALIZATIONS (tmpl
)
897 = tree_cons (fn
, spec
, DECL_TEMPLATE_SPECIALIZATIONS (tmpl
));
902 /* Print the list of candidate FNS in an error message. */
905 print_candidates (fns
)
910 const char *str
= "candidates are:";
912 for (fn
= fns
; fn
!= NULL_TREE
; fn
= TREE_CHAIN (fn
))
916 for (f
= TREE_VALUE (fn
); f
; f
= OVL_NEXT (f
))
917 cp_error_at ("%s %+#D", str
, OVL_CURRENT (f
));
922 /* Returns the template (one of the functions given by TEMPLATE_ID)
923 which can be specialized to match the indicated DECL with the
924 explicit template args given in TEMPLATE_ID. The DECL may be
925 NULL_TREE if none is available. In that case, the functions in
926 TEMPLATE_ID are non-members.
928 If NEED_MEMBER_TEMPLATE is non-zero the function is known to be a
929 specialization of a member template.
931 The template args (those explicitly specified and those deduced)
932 are output in a newly created vector *TARGS_OUT.
934 If it is impossible to determine the result, an error message is
935 issued. The error_mark_node is returned to indicate failure. */
938 determine_specialization (template_id
, decl
, targs_out
,
939 need_member_template
)
943 int need_member_template
;
948 tree candidates
= NULL_TREE
;
949 tree templates
= NULL_TREE
;
951 *targs_out
= NULL_TREE
;
953 if (template_id
== error_mark_node
)
954 return error_mark_node
;
956 fns
= TREE_OPERAND (template_id
, 0);
957 explicit_targs
= TREE_OPERAND (template_id
, 1);
959 if (fns
== error_mark_node
)
960 return error_mark_node
;
962 /* Check for baselinks. */
963 if (BASELINK_P (fns
))
964 fns
= TREE_VALUE (fns
);
966 if (!is_overloaded_fn (fns
))
968 cp_error ("`%D' is not a function template", fns
);
969 return error_mark_node
;
972 for (; fns
; fns
= OVL_NEXT (fns
))
976 tree fn
= OVL_CURRENT (fns
);
978 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
979 /* DECL might be a specialization of FN. */
981 else if (need_member_template
)
982 /* FN is an ordinary member function, and we need a
983 specialization of a member template. */
985 else if (TREE_CODE (fn
) != FUNCTION_DECL
)
986 /* We can get IDENTIFIER_NODEs here in certain erroneous
989 else if (!DECL_FUNCTION_MEMBER_P (fn
))
990 /* This is just an ordinary non-member function. Nothing can
991 be a specialization of that. */
997 /* This is an ordinary member function. However, since
998 we're here, we can assume it's enclosing class is a
999 template class. For example,
1001 template <typename T> struct S { void f(); };
1002 template <> void S<int>::f() {}
1004 Here, S<int>::f is a non-template, but S<int> is a
1005 template class. If FN has the same type as DECL, we
1006 might be in business. */
1007 if (!same_type_p (TREE_TYPE (TREE_TYPE (decl
)),
1008 TREE_TYPE (TREE_TYPE (fn
))))
1009 /* The return types differ. */
1012 /* Adjust the type of DECL in case FN is a static member. */
1013 decl_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
1014 if (DECL_STATIC_FUNCTION_P (fn
)
1015 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
1016 decl_arg_types
= TREE_CHAIN (decl_arg_types
);
1018 if (compparms (TYPE_ARG_TYPES (TREE_TYPE (fn
)),
1021 candidates
= tree_cons (NULL_TREE
, fn
, candidates
);
1026 /* See whether this function might be a specialization of this
1028 targs
= get_bindings (tmpl
, decl
, explicit_targs
);
1031 /* We cannot deduce template arguments that when used to
1032 specialize TMPL will produce DECL. */
1035 /* Save this template, and the arguments deduced. */
1036 templates
= tree_cons (targs
, tmpl
, templates
);
1039 if (templates
&& TREE_CHAIN (templates
))
1045 It is possible for a specialization with a given function
1046 signature to be instantiated from more than one function
1047 template. In such cases, explicit specification of the
1048 template arguments must be used to uniquely identify the
1049 function template specialization being specialized.
1051 Note that here, there's no suggestion that we're supposed to
1052 determine which of the candidate templates is most
1053 specialized. However, we, also have:
1057 Partial ordering of overloaded function template
1058 declarations is used in the following contexts to select
1059 the function template to which a function template
1060 specialization refers:
1062 -- when an explicit specialization refers to a function
1065 So, we do use the partial ordering rules, at least for now.
1066 This extension can only serve to make illegal programs legal,
1067 so it's safe. And, there is strong anecdotal evidence that
1068 the committee intended the partial ordering rules to apply;
1069 the EDG front-end has that behavior, and John Spicer claims
1070 that the committee simply forgot to delete the wording in
1071 [temp.expl.spec]. */
1072 tree tmpl
= most_specialized (templates
, decl
, explicit_targs
);
1073 if (tmpl
&& tmpl
!= error_mark_node
)
1075 targs
= get_bindings (tmpl
, decl
, explicit_targs
);
1076 templates
= tree_cons (targs
, tmpl
, NULL_TREE
);
1080 if (templates
== NULL_TREE
&& candidates
== NULL_TREE
)
1082 cp_error_at ("template-id `%D' for `%+D' does not match any template declaration",
1084 return error_mark_node
;
1086 else if ((templates
&& TREE_CHAIN (templates
))
1087 || (candidates
&& TREE_CHAIN (candidates
))
1088 || (templates
&& candidates
))
1090 cp_error_at ("ambiguous template specialization `%D' for `%+D'",
1092 chainon (candidates
, templates
);
1093 print_candidates (candidates
);
1094 return error_mark_node
;
1097 /* We have one, and exactly one, match. */
1100 /* It was a specialization of an ordinary member function in a
1102 *targs_out
= copy_node (DECL_TI_ARGS (TREE_VALUE (candidates
)));
1103 return DECL_TI_TEMPLATE (TREE_VALUE (candidates
));
1106 /* It was a specialization of a template. */
1107 targs
= DECL_TI_ARGS (DECL_RESULT (TREE_VALUE (templates
)));
1108 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (targs
))
1110 *targs_out
= copy_node (targs
);
1111 SET_TMPL_ARGS_LEVEL (*targs_out
,
1112 TMPL_ARGS_DEPTH (*targs_out
),
1113 TREE_PURPOSE (templates
));
1116 *targs_out
= TREE_PURPOSE (templates
);
1117 return TREE_VALUE (templates
);
1120 /* Check to see if the function just declared, as indicated in
1121 DECLARATOR, and in DECL, is a specialization of a function
1122 template. We may also discover that the declaration is an explicit
1123 instantiation at this point.
1125 Returns DECL, or an equivalent declaration that should be used
1126 instead if all goes well. Issues an error message if something is
1127 amiss. Returns error_mark_node if the error is not easily
1130 FLAGS is a bitmask consisting of the following flags:
1132 2: The function has a definition.
1133 4: The function is a friend.
1135 The TEMPLATE_COUNT is the number of references to qualifying
1136 template classes that appeared in the name of the function. For
1139 template <class T> struct S { void f(); };
1142 the TEMPLATE_COUNT would be 1. However, explicitly specialized
1143 classes are not counted in the TEMPLATE_COUNT, so that in
1145 template <class T> struct S {};
1146 template <> struct S<int> { void f(); }
1147 template <> void S<int>::f();
1149 the TEMPLATE_COUNT would be 0. (Note that this declaration is
1150 illegal; there should be no template <>.)
1152 If the function is a specialization, it is marked as such via
1153 DECL_TEMPLATE_SPECIALIZATION. Furthermore, its DECL_TEMPLATE_INFO
1154 is set up correctly, and it is added to the list of specializations
1155 for that template. */
1158 check_explicit_specialization (declarator
, decl
, template_count
, flags
)
1164 int have_def
= flags
& 2;
1165 int is_friend
= flags
& 4;
1166 int specialization
= 0;
1167 int explicit_instantiation
= 0;
1168 int member_specialization
= 0;
1170 tree ctype
= DECL_CLASS_CONTEXT (decl
);
1171 tree dname
= DECL_NAME (decl
);
1173 if (processing_specialization
)
1175 /* The last template header was of the form template <>. */
1177 if (template_header_count
> template_count
)
1179 /* There were more template headers than qualifying template
1181 if (template_header_count
- template_count
> 1)
1182 /* There shouldn't be that many template parameter lists.
1183 There can be at most one parameter list for every
1184 qualifying class, plus one for the function itself. */
1185 cp_error ("too many template parameter lists in declaration of `%D'", decl
);
1187 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
1189 member_specialization
= 1;
1193 else if (template_header_count
== template_count
)
1195 /* The counts are equal. So, this might be a
1196 specialization, but it is not a specialization of a
1197 member template. It might be something like
1199 template <class T> struct S {
1203 void S<int>::f(int i) {} */
1205 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
1209 /* This cannot be an explicit specialization. There are not
1210 enough headers for all of the qualifying classes. For
1211 example, we might have:
1214 void S<int>::T<char>::f();
1216 But, we're missing another template <>. */
1217 cp_error("too few template parameter lists in declaration of `%D'", decl
);
1221 else if (processing_explicit_instantiation
)
1223 if (template_header_count
)
1224 cp_error ("template parameter list used in explicit instantiation");
1227 cp_error ("definition provided for explicit instantiation");
1229 explicit_instantiation
= 1;
1231 else if (ctype
!= NULL_TREE
1232 && !TYPE_BEING_DEFINED (ctype
)
1233 && CLASSTYPE_TEMPLATE_INSTANTIATION (ctype
)
1236 /* This case catches outdated code that looks like this:
1238 template <class T> struct S { void f(); };
1239 void S<int>::f() {} // Missing template <>
1241 We disable this check when the type is being defined to
1242 avoid complaining about default compiler-generated
1243 constructors, destructors, and assignment operators.
1244 Since the type is an instantiation, not a specialization,
1245 these are the only functions that can be defined before
1246 the class is complete. */
1249 template <class T> void S<int>::f() {}
1251 if (template_header_count
)
1253 cp_error ("template parameters specified in specialization");
1259 ("explicit specialization not preceded by `template <>'");
1261 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
1263 else if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
1266 /* This could be something like:
1268 template <class T> void f(T);
1269 class S { friend void f<>(int); } */
1273 /* This case handles bogus declarations like template <>
1274 template <class T> void f<int>(); */
1276 cp_error ("template-id `%D' in declaration of primary template",
1282 if (specialization
|| member_specialization
)
1284 tree t
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
1285 for (; t
; t
= TREE_CHAIN (t
))
1286 if (TREE_PURPOSE (t
))
1289 ("default argument specified in explicit specialization");
1292 if (current_lang_name
== lang_name_c
)
1293 cp_error ("template specialization with C linkage");
1296 if (specialization
|| member_specialization
|| explicit_instantiation
)
1298 tree tmpl
= NULL_TREE
;
1299 tree targs
= NULL_TREE
;
1301 /* Make sure that the declarator is a TEMPLATE_ID_EXPR. */
1302 if (TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
1306 my_friendly_assert (TREE_CODE (declarator
) == IDENTIFIER_NODE
,
1309 fns
= IDENTIFIER_NAMESPACE_VALUE (dname
);
1314 lookup_template_function (fns
, NULL_TREE
);
1317 if (declarator
== error_mark_node
)
1318 return error_mark_node
;
1320 if (ctype
!= NULL_TREE
&& TYPE_BEING_DEFINED (ctype
))
1322 if (!explicit_instantiation
)
1323 /* A specialization in class scope. This is illegal,
1324 but the error will already have been flagged by
1325 check_specialization_scope. */
1326 return error_mark_node
;
1329 /* It's not legal to write an explicit instantiation in
1332 class C { template void f(); }
1334 This case is caught by the parser. However, on
1337 template class C { void f(); };
1339 (which is illegal) we can get here. The error will be
1346 else if (TREE_CODE (TREE_OPERAND (declarator
, 0)) == LOOKUP_EXPR
)
1348 /* A friend declaration. We can't do much, because we don't
1349 know what this resolves to, yet. */
1350 my_friendly_assert (is_friend
!= 0, 0);
1351 my_friendly_assert (!explicit_instantiation
, 0);
1352 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
1355 else if (ctype
!= NULL_TREE
1356 && (TREE_CODE (TREE_OPERAND (declarator
, 0)) ==
1359 /* Find the list of functions in ctype that have the same
1360 name as the declared function. */
1361 tree name
= TREE_OPERAND (declarator
, 0);
1362 tree fns
= NULL_TREE
;
1365 if (name
== constructor_name (ctype
)
1366 || name
== constructor_name_full (ctype
))
1368 int is_constructor
= DECL_CONSTRUCTOR_P (decl
);
1370 if (is_constructor
? !TYPE_HAS_CONSTRUCTOR (ctype
)
1371 : !TYPE_HAS_DESTRUCTOR (ctype
))
1373 /* From [temp.expl.spec]:
1375 If such an explicit specialization for the member
1376 of a class template names an implicitly-declared
1377 special member function (clause _special_), the
1378 program is ill-formed.
1380 Similar language is found in [temp.explicit]. */
1381 cp_error ("specialization of implicitly-declared special member function");
1382 return error_mark_node
;
1385 name
= is_constructor
? ctor_identifier
: dtor_identifier
;
1388 if (!IDENTIFIER_TYPENAME_P (name
))
1390 idx
= lookup_fnfields_1 (ctype
, name
);
1392 fns
= TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (ctype
), idx
);
1398 /* For a type-conversion operator, we cannot do a
1399 name-based lookup. We might be looking for `operator
1400 int' which will be a specialization of `operator T'.
1401 So, we find *all* the conversion operators, and then
1402 select from them. */
1405 methods
= CLASSTYPE_METHOD_VEC (ctype
);
1407 for (idx
= 2; idx
< TREE_VEC_LENGTH (methods
); ++idx
)
1409 tree ovl
= TREE_VEC_ELT (methods
, idx
);
1411 if (!ovl
|| !DECL_CONV_FN_P (OVL_CURRENT (ovl
)))
1412 /* There are no more conversion functions. */
1415 /* Glue all these conversion functions together
1416 with those we already have. */
1417 for (; ovl
; ovl
= OVL_NEXT (ovl
))
1418 fns
= ovl_cons (OVL_CURRENT (ovl
), fns
);
1422 if (fns
== NULL_TREE
)
1424 cp_error ("no member function `%D' declared in `%T'",
1426 return error_mark_node
;
1429 TREE_OPERAND (declarator
, 0) = fns
;
1432 /* Figure out what exactly is being specialized at this point.
1433 Note that for an explicit instantiation, even one for a
1434 member function, we cannot tell apriori whether the
1435 instantiation is for a member template, or just a member
1436 function of a template class. Even if a member template is
1437 being instantiated, the member template arguments may be
1438 elided if they can be deduced from the rest of the
1440 tmpl
= determine_specialization (declarator
, decl
,
1442 member_specialization
);
1444 if (!tmpl
|| tmpl
== error_mark_node
)
1445 /* We couldn't figure out what this declaration was
1447 return error_mark_node
;
1450 tree gen_tmpl
= most_general_template (tmpl
);
1452 if (explicit_instantiation
)
1454 /* We don't set DECL_EXPLICIT_INSTANTIATION here; that
1455 is done by do_decl_instantiation later. */
1457 int arg_depth
= TMPL_ARGS_DEPTH (targs
);
1458 int parm_depth
= TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
));
1460 if (arg_depth
> parm_depth
)
1462 /* If TMPL is not the most general template (for
1463 example, if TMPL is a friend template that is
1464 injected into namespace scope), then there will
1465 be too many levels fo TARGS. Remove some of them
1470 new_targs
= make_tree_vec (parm_depth
);
1471 for (i
= arg_depth
- parm_depth
; i
< arg_depth
; ++i
)
1472 TREE_VEC_ELT (new_targs
, i
- (arg_depth
- parm_depth
))
1473 = TREE_VEC_ELT (targs
, i
);
1477 decl
= instantiate_template (tmpl
, targs
);
1481 /* If we though that the DECL was a member function, but it
1482 turns out to be specializing a static member function,
1483 make DECL a static member function as well. */
1484 if (DECL_STATIC_FUNCTION_P (tmpl
)
1485 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
1487 revert_static_member_fn (&decl
, 0, 0);
1488 last_function_parms
= TREE_CHAIN (last_function_parms
);
1491 /* Set up the DECL_TEMPLATE_INFO for DECL. */
1492 DECL_TEMPLATE_INFO (decl
) = tree_cons (tmpl
, targs
, NULL_TREE
);
1494 /* Mangle the function name appropriately. Note that we do
1495 not mangle specializations of non-template member
1496 functions of template classes, e.g. with
1498 template <class T> struct S { void f(); }
1500 and given the specialization
1502 template <> void S<int>::f() {}
1504 we do not mangle S<int>::f() here. That's because it's
1505 just an ordinary member function and doesn't need special
1506 treatment. We do this here so that the ordinary,
1507 non-template, name-mangling algorith will not be used
1509 if ((is_member_template (tmpl
) || ctype
== NULL_TREE
)
1510 && name_mangling_version
>= 1)
1511 set_mangled_name_for_template_decl (decl
);
1513 if (is_friend
&& !have_def
)
1514 /* This is not really a declaration of a specialization.
1515 It's just the name of an instantiation. But, it's not
1516 a request for an instantiation, either. */
1517 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
1519 /* Register this specialization so that we can find it
1521 decl
= register_specialization (decl
, gen_tmpl
, targs
);
1528 /* TYPE is being declared. Verify that the use of template headers
1529 and such is reasonable. Issue error messages if not. */
1532 maybe_check_template_type (type
)
1535 if (template_header_count
)
1537 /* We are in the scope of some `template <...>' header. */
1540 = template_class_depth_real (TYPE_CONTEXT (type
),
1541 /*count_specializations=*/1);
1543 if (template_header_count
<= context_depth
)
1544 /* This is OK; the template headers are for the context. We
1545 are actually too lenient here; like
1546 check_explicit_specialization we should consider the number
1547 of template types included in the actual declaration. For
1550 template <class T> struct S {
1551 template <class U> template <class V>
1557 template <class T> struct S {
1558 template <class U> struct I;
1561 template <class T> template <class U.
1566 else if (template_header_count
> context_depth
+ 1)
1567 /* There are two many template parameter lists. */
1568 cp_error ("too many template parameter lists in declaration of `%T'", type
);
1572 /* Returns 1 iff PARMS1 and PARMS2 are identical sets of template
1573 parameters. These are represented in the same format used for
1574 DECL_TEMPLATE_PARMS. */
1576 int comp_template_parms (parms1
, parms2
)
1583 if (parms1
== parms2
)
1586 for (p1
= parms1
, p2
= parms2
;
1587 p1
!= NULL_TREE
&& p2
!= NULL_TREE
;
1588 p1
= TREE_CHAIN (p1
), p2
= TREE_CHAIN (p2
))
1590 tree t1
= TREE_VALUE (p1
);
1591 tree t2
= TREE_VALUE (p2
);
1594 my_friendly_assert (TREE_CODE (t1
) == TREE_VEC
, 0);
1595 my_friendly_assert (TREE_CODE (t2
) == TREE_VEC
, 0);
1597 if (TREE_VEC_LENGTH (t1
) != TREE_VEC_LENGTH (t2
))
1600 for (i
= 0; i
< TREE_VEC_LENGTH (t2
); ++i
)
1602 tree parm1
= TREE_VALUE (TREE_VEC_ELT (t1
, i
));
1603 tree parm2
= TREE_VALUE (TREE_VEC_ELT (t2
, i
));
1605 if (TREE_CODE (parm1
) != TREE_CODE (parm2
))
1608 if (TREE_CODE (parm1
) == TEMPLATE_TYPE_PARM
)
1610 else if (!same_type_p (TREE_TYPE (parm1
), TREE_TYPE (parm2
)))
1615 if ((p1
!= NULL_TREE
) != (p2
!= NULL_TREE
))
1616 /* One set of parameters has more parameters lists than the
1623 /* Complain if DECL shadows a template parameter.
1625 [temp.local]: A template-parameter shall not be redeclared within its
1626 scope (including nested scopes). */
1629 check_template_shadow (decl
)
1634 /* If we're not in a template, we can't possibly shadow a template
1636 if (!current_template_parms
)
1639 /* Figure out what we're shadowing. */
1640 if (TREE_CODE (decl
) == OVERLOAD
)
1641 decl
= OVL_CURRENT (decl
);
1642 olddecl
= IDENTIFIER_VALUE (DECL_NAME (decl
));
1644 /* If there's no previous binding for this name, we're not shadowing
1645 anything, let alone a template parameter. */
1649 /* If we're not shadowing a template parameter, we're done. Note
1650 that OLDDECL might be an OVERLOAD (or perhaps even an
1651 ERROR_MARK), so we can't just blithely assume it to be a _DECL
1653 if (TREE_CODE_CLASS (TREE_CODE (olddecl
)) != 'd'
1654 || !DECL_TEMPLATE_PARM_P (olddecl
))
1657 /* We check for decl != olddecl to avoid bogus errors for using a
1658 name inside a class. We check TPFI to avoid duplicate errors for
1659 inline member templates. */
1661 || TEMPLATE_PARMS_FOR_INLINE (current_template_parms
))
1664 cp_error_at ("declaration of `%#D'", decl
);
1665 cp_error_at (" shadows template parm `%#D'", olddecl
);
1668 /* Return a new TEMPLATE_PARM_INDEX with the indicated INDEX, LEVEL,
1669 ORIG_LEVEL, DECL, and TYPE. */
1672 build_template_parm_index (index
, level
, orig_level
, decl
, type
)
1679 tree t
= make_node (TEMPLATE_PARM_INDEX
);
1680 TEMPLATE_PARM_IDX (t
) = index
;
1681 TEMPLATE_PARM_LEVEL (t
) = level
;
1682 TEMPLATE_PARM_ORIG_LEVEL (t
) = orig_level
;
1683 TEMPLATE_PARM_DECL (t
) = decl
;
1684 TREE_TYPE (t
) = type
;
1689 /* Return a TEMPLATE_PARM_INDEX, similar to INDEX, but whose
1690 TEMPLATE_PARM_LEVEL has been decreased by LEVELS. If such a
1691 TEMPLATE_PARM_INDEX already exists, it is returned; otherwise, a
1692 new one is created. */
1695 reduce_template_parm_level (index
, type
, levels
)
1700 if (TEMPLATE_PARM_DESCENDANTS (index
) == NULL_TREE
1701 || (TEMPLATE_PARM_LEVEL (TEMPLATE_PARM_DESCENDANTS (index
))
1702 != TEMPLATE_PARM_LEVEL (index
) - levels
))
1705 = build_decl (TREE_CODE (TEMPLATE_PARM_DECL (index
)),
1706 DECL_NAME (TEMPLATE_PARM_DECL (index
)),
1709 = build_template_parm_index (TEMPLATE_PARM_IDX (index
),
1710 TEMPLATE_PARM_LEVEL (index
) - levels
,
1711 TEMPLATE_PARM_ORIG_LEVEL (index
),
1713 TEMPLATE_PARM_DESCENDANTS (index
) = t
;
1715 /* Template template parameters need this. */
1716 DECL_TEMPLATE_PARMS (decl
)
1717 = DECL_TEMPLATE_PARMS (TEMPLATE_PARM_DECL (index
));
1720 return TEMPLATE_PARM_DESCENDANTS (index
);
1723 /* Process information from new template parameter NEXT and append it to the
1724 LIST being built. */
1727 process_template_parm (list
, next
)
1736 my_friendly_assert (TREE_CODE (parm
) == TREE_LIST
, 259);
1737 defval
= TREE_PURPOSE (parm
);
1738 parm
= TREE_VALUE (parm
);
1739 is_type
= TREE_PURPOSE (parm
) == class_type_node
;
1743 tree p
= TREE_VALUE (tree_last (list
));
1745 if (TREE_CODE (p
) == TYPE_DECL
)
1746 idx
= TEMPLATE_TYPE_IDX (TREE_TYPE (p
));
1747 else if (TREE_CODE (p
) == TEMPLATE_DECL
)
1748 idx
= TEMPLATE_TYPE_IDX (TREE_TYPE (DECL_TEMPLATE_RESULT (p
)));
1750 idx
= TEMPLATE_PARM_IDX (DECL_INITIAL (p
));
1758 my_friendly_assert (TREE_CODE (TREE_PURPOSE (parm
)) == TREE_LIST
, 260);
1759 /* is a const-param */
1760 parm
= grokdeclarator (TREE_VALUE (parm
), TREE_PURPOSE (parm
),
1761 PARM
, 0, NULL_TREE
);
1765 The top-level cv-qualifiers on the template-parameter are
1766 ignored when determining its type. */
1767 TREE_TYPE (parm
) = TYPE_MAIN_VARIANT (TREE_TYPE (parm
));
1769 /* A template parameter is not modifiable. */
1770 TREE_READONLY (parm
) = 1;
1771 if (IS_AGGR_TYPE (TREE_TYPE (parm
))
1772 && TREE_CODE (TREE_TYPE (parm
)) != TEMPLATE_TYPE_PARM
1773 && TREE_CODE (TREE_TYPE (parm
)) != TYPENAME_TYPE
)
1775 cp_error ("`%#T' is not a valid type for a template constant parameter",
1777 if (DECL_NAME (parm
) == NULL_TREE
)
1778 error (" a template type parameter must begin with `class' or `typename'");
1779 TREE_TYPE (parm
) = void_type_node
;
1782 && (TREE_CODE (TREE_TYPE (parm
)) == REAL_TYPE
1783 || TREE_CODE (TREE_TYPE (parm
)) == COMPLEX_TYPE
))
1784 cp_pedwarn ("`%T' is not a valid type for a template constant parameter",
1786 decl
= build_decl (CONST_DECL
, DECL_NAME (parm
), TREE_TYPE (parm
));
1787 DECL_INITIAL (parm
) = DECL_INITIAL (decl
)
1788 = build_template_parm_index (idx
, processing_template_decl
,
1789 processing_template_decl
,
1790 decl
, TREE_TYPE (parm
));
1795 parm
= TREE_VALUE (parm
);
1797 if (parm
&& TREE_CODE (parm
) == TEMPLATE_DECL
)
1799 t
= make_aggr_type (TEMPLATE_TEMPLATE_PARM
);
1800 /* This is for distinguishing between real templates and template
1801 template parameters */
1802 TREE_TYPE (parm
) = t
;
1803 TREE_TYPE (DECL_TEMPLATE_RESULT (parm
)) = t
;
1808 t
= make_aggr_type (TEMPLATE_TYPE_PARM
);
1809 /* parm is either IDENTIFIER_NODE or NULL_TREE */
1810 decl
= build_decl (TYPE_DECL
, parm
, t
);
1813 TYPE_NAME (t
) = decl
;
1814 TYPE_STUB_DECL (t
) = decl
;
1816 TEMPLATE_TYPE_PARM_INDEX (t
)
1817 = build_template_parm_index (idx
, processing_template_decl
,
1818 processing_template_decl
,
1819 decl
, TREE_TYPE (parm
));
1821 SET_DECL_ARTIFICIAL (decl
);
1822 SET_DECL_TEMPLATE_PARM_P (decl
);
1824 parm
= build_tree_list (defval
, parm
);
1825 return chainon (list
, parm
);
1828 /* The end of a template parameter list has been reached. Process the
1829 tree list into a parameter vector, converting each parameter into a more
1830 useful form. Type parameters are saved as IDENTIFIER_NODEs, and others
1834 end_template_parm_list (parms
)
1839 tree saved_parmlist
= make_tree_vec (list_length (parms
));
1841 current_template_parms
1842 = tree_cons (build_int_2 (0, processing_template_decl
),
1843 saved_parmlist
, current_template_parms
);
1845 for (parm
= parms
, nparms
= 0;
1847 parm
= TREE_CHAIN (parm
), nparms
++)
1848 TREE_VEC_ELT (saved_parmlist
, nparms
) = parm
;
1850 --processing_template_parmlist
;
1852 return saved_parmlist
;
1855 /* end_template_decl is called after a template declaration is seen. */
1858 end_template_decl ()
1860 reset_specialization ();
1862 if (! processing_template_decl
)
1865 /* This matches the pushlevel in begin_template_parm_list. */
1868 --processing_template_decl
;
1869 current_template_parms
= TREE_CHAIN (current_template_parms
);
1870 (void) get_pending_sizes (); /* Why? */
1873 /* Given a template argument vector containing the template PARMS.
1874 The innermost PARMS are given first. */
1877 current_template_args ()
1880 tree args
= NULL_TREE
;
1881 int length
= TMPL_PARMS_DEPTH (current_template_parms
);
1884 /* If there is only one level of template parameters, we do not
1885 create a TREE_VEC of TREE_VECs. Instead, we return a single
1886 TREE_VEC containing the arguments. */
1888 args
= make_tree_vec (length
);
1890 for (header
= current_template_parms
; header
; header
= TREE_CHAIN (header
))
1892 tree a
= copy_node (TREE_VALUE (header
));
1895 TREE_TYPE (a
) = NULL_TREE
;
1896 for (i
= TREE_VEC_LENGTH (a
) - 1; i
>= 0; --i
)
1898 tree t
= TREE_VEC_ELT (a
, i
);
1900 /* T will be a list if we are called from within a
1901 begin/end_template_parm_list pair, but a vector directly
1902 if within a begin/end_member_template_processing pair. */
1903 if (TREE_CODE (t
) == TREE_LIST
)
1907 if (TREE_CODE (t
) == TYPE_DECL
1908 || TREE_CODE (t
) == TEMPLATE_DECL
)
1911 t
= DECL_INITIAL (t
);
1912 TREE_VEC_ELT (a
, i
) = t
;
1917 TREE_VEC_ELT (args
, --l
) = a
;
1925 /* Return a TEMPLATE_DECL corresponding to DECL, using the indicated
1926 template PARMS. Used by push_template_decl below. */
1929 build_template_decl (decl
, parms
)
1933 tree tmpl
= build_lang_decl (TEMPLATE_DECL
, DECL_NAME (decl
), NULL_TREE
);
1934 DECL_TEMPLATE_PARMS (tmpl
) = parms
;
1935 DECL_CONTEXT (tmpl
) = DECL_CONTEXT (decl
);
1936 if (DECL_LANG_SPECIFIC (decl
))
1938 DECL_VIRTUAL_CONTEXT (tmpl
) = DECL_VIRTUAL_CONTEXT (decl
);
1939 DECL_STATIC_FUNCTION_P (tmpl
) = DECL_STATIC_FUNCTION_P (decl
);
1940 DECL_CONSTRUCTOR_P (tmpl
) = DECL_CONSTRUCTOR_P (decl
);
1941 DECL_NONCONVERTING_P (tmpl
) = DECL_NONCONVERTING_P (decl
);
1947 struct template_parm_data
1949 /* The level of the template parameters we are currently
1953 /* The index of the specialization argument we are currently
1957 /* An array whose size is the number of template parameters. The
1958 elements are non-zero if the parameter has been used in any one
1959 of the arguments processed so far. */
1962 /* An array whose size is the number of template arguments. The
1963 elements are non-zero if the argument makes use of template
1964 parameters of this level. */
1965 int* arg_uses_template_parms
;
1968 /* Subroutine of push_template_decl used to see if each template
1969 parameter in a partial specialization is used in the explicit
1970 argument list. If T is of the LEVEL given in DATA (which is
1971 treated as a template_parm_data*), then DATA->PARMS is marked
1975 mark_template_parm (t
, data
)
1981 struct template_parm_data
* tpd
= (struct template_parm_data
*) data
;
1983 if (TREE_CODE (t
) == TEMPLATE_PARM_INDEX
)
1985 level
= TEMPLATE_PARM_LEVEL (t
);
1986 idx
= TEMPLATE_PARM_IDX (t
);
1990 level
= TEMPLATE_TYPE_LEVEL (t
);
1991 idx
= TEMPLATE_TYPE_IDX (t
);
1994 if (level
== tpd
->level
)
1996 tpd
->parms
[idx
] = 1;
1997 tpd
->arg_uses_template_parms
[tpd
->current_arg
] = 1;
2000 /* Return zero so that for_each_template_parm will continue the
2001 traversal of the tree; we want to mark *every* template parm. */
2005 /* Process the partial specialization DECL. */
2008 process_partial_specialization (decl
)
2011 tree type
= TREE_TYPE (decl
);
2012 tree maintmpl
= CLASSTYPE_TI_TEMPLATE (type
);
2013 tree specargs
= CLASSTYPE_TI_ARGS (type
);
2014 tree inner_args
= innermost_args (specargs
);
2015 tree inner_parms
= INNERMOST_TEMPLATE_PARMS (current_template_parms
);
2016 tree main_inner_parms
= DECL_INNERMOST_TEMPLATE_PARMS (maintmpl
);
2017 int nargs
= TREE_VEC_LENGTH (inner_args
);
2018 int ntparms
= TREE_VEC_LENGTH (inner_parms
);
2020 int did_error_intro
= 0;
2021 struct template_parm_data tpd
;
2022 struct template_parm_data tpd2
;
2024 /* We check that each of the template parameters given in the
2025 partial specialization is used in the argument list to the
2026 specialization. For example:
2028 template <class T> struct S;
2029 template <class T> struct S<T*>;
2031 The second declaration is OK because `T*' uses the template
2032 parameter T, whereas
2034 template <class T> struct S<int>;
2036 is no good. Even trickier is:
2047 The S2<T> declaration is actually illegal; it is a
2048 full-specialization. Of course,
2051 struct S2<T (*)(U)>;
2053 or some such would have been OK. */
2054 tpd
.level
= TMPL_PARMS_DEPTH (current_template_parms
);
2055 tpd
.parms
= alloca (sizeof (int) * ntparms
);
2056 bzero ((PTR
) tpd
.parms
, sizeof (int) * ntparms
);
2058 tpd
.arg_uses_template_parms
= alloca (sizeof (int) * nargs
);
2059 bzero ((PTR
) tpd
.arg_uses_template_parms
, sizeof (int) * nargs
);
2060 for (i
= 0; i
< nargs
; ++i
)
2062 tpd
.current_arg
= i
;
2063 for_each_template_parm (TREE_VEC_ELT (inner_args
, i
),
2064 &mark_template_parm
,
2067 for (i
= 0; i
< ntparms
; ++i
)
2068 if (tpd
.parms
[i
] == 0)
2070 /* One of the template parms was not used in the
2072 if (!did_error_intro
)
2074 cp_error ("template parameters not used in partial specialization:");
2075 did_error_intro
= 1;
2079 TREE_VALUE (TREE_VEC_ELT (inner_parms
, i
)));
2082 /* [temp.class.spec]
2084 The argument list of the specialization shall not be identical to
2085 the implicit argument list of the primary template. */
2086 if (comp_template_args (inner_args
,
2087 innermost_args (CLASSTYPE_TI_ARGS (TREE_TYPE
2089 cp_error ("partial specialization `%T' does not specialize any template arguments", type
);
2091 /* [temp.class.spec]
2093 A partially specialized non-type argument expression shall not
2094 involve template parameters of the partial specialization except
2095 when the argument expression is a simple identifier.
2097 The type of a template parameter corresponding to a specialized
2098 non-type argument shall not be dependent on a parameter of the
2100 my_friendly_assert (nargs
== DECL_NTPARMS (maintmpl
), 0);
2102 for (i
= 0; i
< nargs
; ++i
)
2104 tree arg
= TREE_VEC_ELT (inner_args
, i
);
2105 if (/* These first two lines are the `non-type' bit. */
2106 TREE_CODE_CLASS (TREE_CODE (arg
)) != 't'
2107 && TREE_CODE (arg
) != TEMPLATE_DECL
2108 /* This next line is the `argument expression is not just a
2109 simple identifier' condition and also the `specialized
2110 non-type argument' bit. */
2111 && TREE_CODE (arg
) != TEMPLATE_PARM_INDEX
)
2113 if (tpd
.arg_uses_template_parms
[i
])
2114 cp_error ("template argument `%E' involves template parameter(s)", arg
);
2117 /* Look at the corresponding template parameter,
2118 marking which template parameters its type depends
2121 TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (main_inner_parms
,
2126 /* We haven't yet initialized TPD2. Do so now. */
2127 tpd2
.arg_uses_template_parms
2128 = (int*) alloca (sizeof (int) * nargs
);
2129 /* The number of parameters here is the number in the
2130 main template, which, as checked in the assertion
2132 tpd2
.parms
= (int*) alloca (sizeof (int) * nargs
);
2134 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (maintmpl
));
2137 /* Mark the template parameters. But this time, we're
2138 looking for the template parameters of the main
2139 template, not in the specialization. */
2140 tpd2
.current_arg
= i
;
2141 tpd2
.arg_uses_template_parms
[i
] = 0;
2142 bzero ((PTR
) tpd2
.parms
, sizeof (int) * nargs
);
2143 for_each_template_parm (type
,
2144 &mark_template_parm
,
2147 if (tpd2
.arg_uses_template_parms
[i
])
2149 /* The type depended on some template parameters.
2150 If they are fully specialized in the
2151 specialization, that's OK. */
2153 for (j
= 0; j
< nargs
; ++j
)
2154 if (tpd2
.parms
[j
] != 0
2155 && tpd
.arg_uses_template_parms
[j
])
2157 cp_error ("type `%T' of template argument `%E' depends on template parameter(s)",
2167 if (retrieve_specialization (maintmpl
, specargs
))
2168 /* We've already got this specialization. */
2171 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
) = CLASSTYPE_TI_SPEC_INFO (type
)
2172 = tree_cons (inner_args
, inner_parms
,
2173 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
));
2174 TREE_TYPE (DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)) = type
;
2178 /* Check that a template declaration's use of default arguments is not
2179 invalid. Here, PARMS are the template parameters. IS_PRIMARY is
2180 non-zero if DECL is the thing declared by a primary template.
2181 IS_PARTIAL is non-zero if DECL is a partial specialization. */
2184 check_default_tmpl_args (decl
, parms
, is_primary
, is_partial
)
2191 int last_level_to_check
;
2196 A default template-argument shall not be specified in a
2197 function template declaration or a function template definition, nor
2198 in the template-parameter-list of the definition of a member of a
2201 if (TREE_CODE (CP_DECL_CONTEXT (decl
)) == FUNCTION_DECL
)
2202 /* You can't have a function template declaration in a local
2203 scope, nor you can you define a member of a class template in a
2207 if (current_class_type
2208 && !TYPE_BEING_DEFINED (current_class_type
)
2209 && DECL_LANG_SPECIFIC (decl
)
2210 /* If this is either a friend defined in the scope of the class
2211 or a member function. */
2212 && ((DECL_CONTEXT (decl
)
2213 && same_type_p (DECL_CONTEXT (decl
), current_class_type
))
2214 || (DECL_FRIEND_CONTEXT (decl
)
2215 && same_type_p (DECL_FRIEND_CONTEXT (decl
),
2216 current_class_type
)))
2217 /* And, if it was a member function, it really was defined in
2218 the scope of the class. */
2219 && (!DECL_FUNCTION_MEMBER_P (decl
) || DECL_DEFINED_IN_CLASS_P (decl
)))
2220 /* We already checked these parameters when the template was
2221 declared, so there's no need to do it again now. This function
2222 was defined in class scope, but we're processing it's body now
2223 that the class is complete. */
2228 If a template-parameter has a default template-argument, all
2229 subsequent template-parameters shall have a default
2230 template-argument supplied. */
2231 for (parm_level
= parms
; parm_level
; parm_level
= TREE_CHAIN (parm_level
))
2233 tree inner_parms
= TREE_VALUE (parm_level
);
2234 int ntparms
= TREE_VEC_LENGTH (inner_parms
);
2235 int seen_def_arg_p
= 0;
2238 for (i
= 0; i
< ntparms
; ++i
)
2240 tree parm
= TREE_VEC_ELT (inner_parms
, i
);
2241 if (TREE_PURPOSE (parm
))
2243 else if (seen_def_arg_p
)
2245 cp_error ("no default argument for `%D'", TREE_VALUE (parm
));
2246 /* For better subsequent error-recovery, we indicate that
2247 there should have been a default argument. */
2248 TREE_PURPOSE (parm
) = error_mark_node
;
2253 if (TREE_CODE (decl
) != TYPE_DECL
|| is_partial
|| !is_primary
)
2254 /* For an ordinary class template, default template arguments are
2255 allowed at the innermost level, e.g.:
2256 template <class T = int>
2258 but, in a partial specialization, they're not allowed even
2259 there, as we have in [temp.class.spec]:
2261 The template parameter list of a specialization shall not
2262 contain default template argument values.
2264 So, for a partial specialization, or for a function template,
2265 we look at all of them. */
2268 /* But, for a primary class template that is not a partial
2269 specialization we look at all template parameters except the
2271 parms
= TREE_CHAIN (parms
);
2273 /* Figure out what error message to issue. */
2274 if (TREE_CODE (decl
) == FUNCTION_DECL
)
2275 msg
= "default argument for template parameter in function template `%D'";
2276 else if (is_partial
)
2277 msg
= "default argument in partial specialization `%D'";
2279 msg
= "default argument for template parameter for class enclosing `%D'";
2281 if (current_class_type
&& TYPE_BEING_DEFINED (current_class_type
))
2282 /* If we're inside a class definition, there's no need to
2283 examine the parameters to the class itself. On the one
2284 hand, they will be checked when the class is defined, and,
2285 on the other, default arguments are legal in things like:
2286 template <class T = double>
2287 struct S { template <class U> void f(U); };
2288 Here the default argument for `S' has no bearing on the
2289 declaration of `f'. */
2290 last_level_to_check
= template_class_depth (current_class_type
) + 1;
2292 /* Check everything. */
2293 last_level_to_check
= 0;
2295 for (parm_level
= parms
;
2296 parm_level
&& TMPL_PARMS_DEPTH (parm_level
) >= last_level_to_check
;
2297 parm_level
= TREE_CHAIN (parm_level
))
2299 tree inner_parms
= TREE_VALUE (parm_level
);
2303 ntparms
= TREE_VEC_LENGTH (inner_parms
);
2304 for (i
= 0; i
< ntparms
; ++i
)
2305 if (TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)))
2309 cp_error (msg
, decl
);
2313 /* Clear out the default argument so that we are not
2315 TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)) = NULL_TREE
;
2318 /* At this point, if we're still interested in issuing messages,
2319 they must apply to classes surrounding the object declared. */
2321 msg
= "default argument for template parameter for class enclosing `%D'";
2325 /* Creates a TEMPLATE_DECL for the indicated DECL using the template
2326 parameters given by current_template_args, or reuses a
2327 previously existing one, if appropriate. Returns the DECL, or an
2328 equivalent one, if it is replaced via a call to duplicate_decls.
2330 If IS_FRIEND is non-zero, DECL is a friend declaration. */
2333 push_template_decl_real (decl
, is_friend
)
2343 int new_template_p
= 0;
2345 /* See if this is a partial specialization. */
2346 is_partial
= (DECL_IMPLICIT_TYPEDEF_P (decl
)
2347 && TREE_CODE (TREE_TYPE (decl
)) != ENUMERAL_TYPE
2348 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl
)));
2350 is_friend
|= (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_FRIEND_P (decl
));
2353 /* For a friend, we want the context of the friend function, not
2354 the type of which it is a friend. */
2355 ctx
= DECL_CONTEXT (decl
);
2356 else if (CP_DECL_CONTEXT (decl
)
2357 && TREE_CODE (CP_DECL_CONTEXT (decl
)) != NAMESPACE_DECL
)
2358 /* In the case of a virtual function, we want the class in which
2360 ctx
= CP_DECL_CONTEXT (decl
);
2362 /* Otherwise, if we're currently definining some class, the DECL
2363 is assumed to be a member of the class. */
2364 ctx
= current_scope ();
2366 if (ctx
&& TREE_CODE (ctx
) == NAMESPACE_DECL
)
2369 if (!DECL_CONTEXT (decl
))
2370 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
2372 /* See if this is a primary template. */
2373 primary
= pseudo_global_level_p ();
2377 if (current_lang_name
== lang_name_c
)
2378 cp_error ("template with C linkage");
2379 else if (TREE_CODE (decl
) == TYPE_DECL
2380 && ANON_AGGRNAME_P (DECL_NAME (decl
)))
2381 cp_error ("template class without a name");
2382 else if ((DECL_IMPLICIT_TYPEDEF_P (decl
)
2383 && CLASS_TYPE_P (TREE_TYPE (decl
)))
2384 || (TREE_CODE (decl
) == VAR_DECL
&& ctx
&& CLASS_TYPE_P (ctx
))
2385 || TREE_CODE (decl
) == FUNCTION_DECL
)
2388 cp_error ("template declaration of `%#D'", decl
);
2391 /* Check to see that the rules regarding the use of default
2392 arguments are not being violated. */
2393 check_default_tmpl_args (decl
, current_template_parms
,
2394 primary
, is_partial
);
2397 return process_partial_specialization (decl
);
2399 args
= current_template_args ();
2402 || TREE_CODE (ctx
) == FUNCTION_DECL
2403 || TYPE_BEING_DEFINED (ctx
)
2404 || (is_friend
&& !DECL_TEMPLATE_INFO (decl
)))
2406 if (DECL_LANG_SPECIFIC (decl
)
2407 && DECL_TEMPLATE_INFO (decl
)
2408 && DECL_TI_TEMPLATE (decl
))
2409 tmpl
= DECL_TI_TEMPLATE (decl
);
2410 /* If DECL is a TYPE_DECL for a class-template, then there won't
2411 be DECL_LANG_SPECIFIC. The information equivalent to
2412 DECL_TEMPLATE_INFO is found in TYPE_TEMPLATE_INFO instead. */
2413 else if (DECL_IMPLICIT_TYPEDEF_P (decl
)
2414 && TYPE_TEMPLATE_INFO (TREE_TYPE (decl
))
2415 && TYPE_TI_TEMPLATE (TREE_TYPE (decl
)))
2417 /* Since a template declaration already existed for this
2418 class-type, we must be redeclaring it here. Make sure
2419 that the redeclaration is legal. */
2420 redeclare_class_template (TREE_TYPE (decl
),
2421 current_template_parms
);
2422 /* We don't need to create a new TEMPLATE_DECL; just use the
2423 one we already had. */
2424 tmpl
= TYPE_TI_TEMPLATE (TREE_TYPE (decl
));
2428 tmpl
= build_template_decl (decl
, current_template_parms
);
2431 if (DECL_LANG_SPECIFIC (decl
)
2432 && DECL_TEMPLATE_SPECIALIZATION (decl
))
2434 /* A specialization of a member template of a template
2436 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
2437 DECL_TEMPLATE_INFO (tmpl
) = DECL_TEMPLATE_INFO (decl
);
2438 DECL_TEMPLATE_INFO (decl
) = NULL_TREE
;
2444 tree a
, t
, current
, parms
;
2447 if (CLASSTYPE_TEMPLATE_INSTANTIATION (ctx
))
2448 cp_error ("must specialize `%#T' before defining member `%#D'",
2450 if (TREE_CODE (decl
) == TYPE_DECL
)
2452 if ((IS_AGGR_TYPE_CODE (TREE_CODE (TREE_TYPE (decl
)))
2453 || TREE_CODE (TREE_TYPE (decl
)) == ENUMERAL_TYPE
)
2454 && TYPE_TEMPLATE_INFO (TREE_TYPE (decl
))
2455 && TYPE_TI_TEMPLATE (TREE_TYPE (decl
)))
2456 tmpl
= TYPE_TI_TEMPLATE (TREE_TYPE (decl
));
2459 cp_error ("`%D' does not declare a template type", decl
);
2463 else if (! DECL_TEMPLATE_INFO (decl
))
2465 cp_error ("template definition of non-template `%#D'", decl
);
2469 tmpl
= DECL_TI_TEMPLATE (decl
);
2471 if (is_member_template (tmpl
)
2472 && DECL_FUNCTION_TEMPLATE_P (tmpl
)
2473 && DECL_TEMPLATE_INFO (decl
) && DECL_TI_ARGS (decl
)
2474 && DECL_TEMPLATE_SPECIALIZATION (decl
))
2478 /* The declaration is a specialization of a member
2479 template, declared outside the class. Therefore, the
2480 innermost template arguments will be NULL, so we
2481 replace them with the arguments determined by the
2482 earlier call to check_explicit_specialization. */
2483 args
= DECL_TI_ARGS (decl
);
2486 = build_template_decl (decl
, current_template_parms
);
2487 DECL_TEMPLATE_RESULT (new_tmpl
) = decl
;
2488 TREE_TYPE (new_tmpl
) = TREE_TYPE (decl
);
2489 DECL_TI_TEMPLATE (decl
) = new_tmpl
;
2490 SET_DECL_TEMPLATE_SPECIALIZATION (new_tmpl
);
2491 DECL_TEMPLATE_INFO (new_tmpl
)
2492 = tree_cons (tmpl
, args
, NULL_TREE
);
2494 register_specialization (new_tmpl
, tmpl
, args
);
2498 /* Make sure the template headers we got make sense. */
2500 parms
= DECL_TEMPLATE_PARMS (tmpl
);
2501 i
= TMPL_PARMS_DEPTH (parms
);
2502 if (TMPL_ARGS_DEPTH (args
) != i
)
2504 cp_error ("expected %d levels of template parms for `%#D', got %d",
2505 i
, decl
, TMPL_ARGS_DEPTH (args
));
2508 for (current
= decl
; i
> 0; --i
, parms
= TREE_CHAIN (parms
))
2510 a
= TMPL_ARGS_LEVEL (args
, i
);
2511 t
= INNERMOST_TEMPLATE_PARMS (parms
);
2513 if (TREE_VEC_LENGTH (t
) != TREE_VEC_LENGTH (a
))
2515 if (current
== decl
)
2516 cp_error ("got %d template parameters for `%#D'",
2517 TREE_VEC_LENGTH (a
), decl
);
2519 cp_error ("got %d template parameters for `%#T'",
2520 TREE_VEC_LENGTH (a
), current
);
2521 cp_error (" but %d required", TREE_VEC_LENGTH (t
));
2524 /* Perhaps we should also check that the parms are used in the
2525 appropriate qualifying scopes in the declarator? */
2527 if (current
== decl
)
2530 current
= TYPE_CONTEXT (current
);
2534 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
2535 TREE_TYPE (tmpl
) = TREE_TYPE (decl
);
2537 /* Push template declarations for global functions and types. Note
2538 that we do not try to push a global template friend declared in a
2539 template class; such a thing may well depend on the template
2540 parameters of the class. */
2541 if (new_template_p
&& !ctx
2542 && !(is_friend
&& template_class_depth (current_class_type
) > 0))
2543 tmpl
= pushdecl_namespace_level (tmpl
);
2546 DECL_PRIMARY_TEMPLATE (tmpl
) = tmpl
;
2548 info
= tree_cons (tmpl
, args
, NULL_TREE
);
2550 if (DECL_IMPLICIT_TYPEDEF_P (decl
))
2552 SET_TYPE_TEMPLATE_INFO (TREE_TYPE (tmpl
), info
);
2553 if ((!ctx
|| TREE_CODE (ctx
) != FUNCTION_DECL
)
2554 && TREE_CODE (TREE_TYPE (decl
)) != ENUMERAL_TYPE
)
2555 DECL_NAME (decl
) = classtype_mangled_name (TREE_TYPE (decl
));
2557 else if (DECL_LANG_SPECIFIC (decl
))
2558 DECL_TEMPLATE_INFO (decl
) = info
;
2560 return DECL_TEMPLATE_RESULT (tmpl
);
2564 push_template_decl (decl
)
2567 return push_template_decl_real (decl
, 0);
2570 /* Called when a class template TYPE is redeclared with the indicated
2571 template PARMS, e.g.:
2573 template <class T> struct S;
2574 template <class T> struct S {}; */
2577 redeclare_class_template (type
, parms
)
2585 if (!TYPE_TEMPLATE_INFO (type
))
2587 cp_error ("`%T' is not a template type", type
);
2591 tmpl
= TYPE_TI_TEMPLATE (type
);
2592 if (!PRIMARY_TEMPLATE_P (tmpl
))
2593 /* The type is nested in some template class. Nothing to worry
2594 about here; there are no new template parameters for the nested
2598 parms
= INNERMOST_TEMPLATE_PARMS (parms
);
2599 tmpl_parms
= DECL_INNERMOST_TEMPLATE_PARMS (tmpl
);
2601 if (TREE_VEC_LENGTH (parms
) != TREE_VEC_LENGTH (tmpl_parms
))
2603 cp_error_at ("previous declaration `%D'", tmpl
);
2604 cp_error ("used %d template parameter%s instead of %d",
2605 TREE_VEC_LENGTH (tmpl_parms
),
2606 TREE_VEC_LENGTH (tmpl_parms
) == 1 ? "" : "s",
2607 TREE_VEC_LENGTH (parms
));
2611 for (i
= 0; i
< TREE_VEC_LENGTH (tmpl_parms
); ++i
)
2613 tree tmpl_parm
= TREE_VALUE (TREE_VEC_ELT (tmpl_parms
, i
));
2614 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
2615 tree tmpl_default
= TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
));
2616 tree parm_default
= TREE_PURPOSE (TREE_VEC_ELT (parms
, i
));
2618 if (TREE_CODE (tmpl_parm
) != TREE_CODE (parm
))
2620 cp_error_at ("template parameter `%#D'", tmpl_parm
);
2621 cp_error ("redeclared here as `%#D'", parm
);
2625 if (tmpl_default
!= NULL_TREE
&& parm_default
!= NULL_TREE
)
2627 /* We have in [temp.param]:
2629 A template-parameter may not be given default arguments
2630 by two different declarations in the same scope. */
2631 cp_error ("redefinition of default argument for `%#D'", parm
);
2632 cp_error_at (" original definition appeared here", tmpl_parm
);
2636 if (parm_default
!= NULL_TREE
)
2637 /* Update the previous template parameters (which are the ones
2638 that will really count) with the new default value. */
2639 TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
)) = parm_default
;
2640 else if (tmpl_default
!= NULL_TREE
)
2641 /* Update the new parameters, too; they'll be used as the
2642 parameters for any members. */
2643 TREE_PURPOSE (TREE_VEC_ELT (parms
, i
)) = tmpl_default
;
2647 /* Attempt to convert the non-type template parameter EXPR to the
2648 indicated TYPE. If the conversion is successful, return the
2649 converted value. If the conversion is unsuccesful, return
2650 NULL_TREE if we issued an error message, or error_mark_node if we
2651 did not. We issue error messages for out-and-out bad template
2652 parameters, but not simply because the conversion failed, since we
2653 might be just trying to do argument deduction. By the time this
2654 function is called, neither TYPE nor EXPR may make use of template
2658 convert_nontype_argument (type
, expr
)
2662 tree expr_type
= TREE_TYPE (expr
);
2664 /* A template-argument for a non-type, non-template
2665 template-parameter shall be one of:
2667 --an integral constant-expression of integral or enumeration
2670 --the name of a non-type template-parameter; or
2672 --the name of an object or function with external linkage,
2673 including function templates and function template-ids but
2674 excluding non-static class members, expressed as id-expression;
2677 --the address of an object or function with external linkage,
2678 including function templates and function template-ids but
2679 excluding non-static class members, expressed as & id-expression
2680 where the & is optional if the name refers to a function or
2683 --a pointer to member expressed as described in _expr.unary.op_. */
2685 /* An integral constant-expression can include const variables or
2686 enumerators. Simplify things by folding them to their values,
2687 unless we're about to bind the declaration to a reference
2689 if (INTEGRAL_TYPE_P (expr_type
) && TREE_READONLY_DECL_P (expr
)
2690 && TREE_CODE (type
) != REFERENCE_TYPE
)
2691 expr
= decl_constant_value (expr
);
2693 if (is_overloaded_fn (expr
))
2694 /* OK for now. We'll check that it has external linkage later.
2695 Check this first since if expr_type is the unknown_type_node
2696 we would otherwise complain below. */
2698 else if (TYPE_PTRMEM_P (expr_type
)
2699 || TYPE_PTRMEMFUNC_P (expr_type
))
2701 if (TREE_CODE (expr
) != PTRMEM_CST
)
2704 else if (TYPE_PTR_P (expr_type
)
2705 || TYPE_PTRMEM_P (expr_type
)
2706 || TREE_CODE (expr_type
) == ARRAY_TYPE
2707 || TREE_CODE (type
) == REFERENCE_TYPE
2708 /* If expr is the address of an overloaded function, we
2709 will get the unknown_type_node at this point. */
2710 || expr_type
== unknown_type_node
)
2716 if (TREE_CODE (type
) == REFERENCE_TYPE
2717 || TREE_CODE (expr_type
) == ARRAY_TYPE
)
2721 if (TREE_CODE (e
) != ADDR_EXPR
)
2724 cp_error ("`%E' is not a valid template argument", expr
);
2725 if (TYPE_PTR_P (expr_type
))
2727 if (TREE_CODE (TREE_TYPE (expr_type
)) == FUNCTION_TYPE
)
2728 cp_error ("it must be the address of a function with external linkage");
2730 cp_error ("it must be the address of an object with external linkage");
2732 else if (TYPE_PTRMEM_P (expr_type
)
2733 || TYPE_PTRMEMFUNC_P (expr_type
))
2734 cp_error ("it must be a pointer-to-member of the form `&X::Y'");
2739 referent
= TREE_OPERAND (e
, 0);
2740 STRIP_NOPS (referent
);
2743 if (TREE_CODE (referent
) == STRING_CST
)
2745 cp_error ("string literal %E is not a valid template argument",
2747 error ("because it is the address of an object with static linkage");
2751 if (is_overloaded_fn (referent
))
2752 /* We'll check that it has external linkage later. */
2754 else if (TREE_CODE (referent
) != VAR_DECL
)
2756 else if (!TREE_PUBLIC (referent
))
2758 cp_error ("address of non-extern `%E' cannot be used as template argument", referent
);
2759 return error_mark_node
;
2762 else if (INTEGRAL_TYPE_P (expr_type
)
2763 || TYPE_PTRMEM_P (expr_type
)
2764 || TYPE_PTRMEMFUNC_P (expr_type
)
2765 /* The next two are g++ extensions. */
2766 || TREE_CODE (expr_type
) == REAL_TYPE
2767 || TREE_CODE (expr_type
) == COMPLEX_TYPE
)
2769 if (! TREE_CONSTANT (expr
))
2772 cp_error ("non-constant `%E' cannot be used as template argument",
2779 cp_error ("object `%E' cannot be used as template argument", expr
);
2783 switch (TREE_CODE (type
))
2788 /* For a non-type template-parameter of integral or enumeration
2789 type, integral promotions (_conv.prom_) and integral
2790 conversions (_conv.integral_) are applied. */
2791 if (!INTEGRAL_TYPE_P (expr_type
))
2792 return error_mark_node
;
2794 /* It's safe to call digest_init in this case; we know we're
2795 just converting one integral constant expression to another. */
2796 expr
= digest_init (type
, expr
, (tree
*) 0);
2798 if (TREE_CODE (expr
) != INTEGER_CST
)
2799 /* Curiously, some TREE_CONSTANT integral expressions do not
2800 simplify to integer constants. For example, `3 % 0',
2801 remains a TRUNC_MOD_EXPR. */
2808 /* These are g++ extensions. */
2809 if (TREE_CODE (expr_type
) != TREE_CODE (type
))
2810 return error_mark_node
;
2812 expr
= digest_init (type
, expr
, (tree
*) 0);
2814 if (TREE_CODE (expr
) != REAL_CST
)
2821 tree type_pointed_to
= TREE_TYPE (type
);
2823 if (TYPE_PTRMEM_P (type
))
2827 /* For a non-type template-parameter of type pointer to data
2828 member, qualification conversions (_conv.qual_) are
2830 e
= perform_qualification_conversions (type
, expr
);
2831 if (TREE_CODE (e
) == NOP_EXPR
)
2832 /* The call to perform_qualification_conversions will
2833 insert a NOP_EXPR over EXPR to do express conversion,
2834 if necessary. But, that will confuse us if we use
2835 this (converted) template parameter to instantiate
2836 another template; then the thing will not look like a
2837 valid template argument. So, just make a new
2838 constant, of the appropriate type. */
2839 e
= make_ptrmem_cst (type
, PTRMEM_CST_MEMBER (expr
));
2842 else if (TREE_CODE (type_pointed_to
) == FUNCTION_TYPE
)
2844 /* For a non-type template-parameter of type pointer to
2845 function, only the function-to-pointer conversion
2846 (_conv.func_) is applied. If the template-argument
2847 represents a set of overloaded functions (or a pointer to
2848 such), the matching function is selected from the set
2853 if (TREE_CODE (expr
) == ADDR_EXPR
)
2854 fns
= TREE_OPERAND (expr
, 0);
2858 fn
= instantiate_type (type_pointed_to
, fns
, 0);
2860 if (fn
== error_mark_node
)
2861 return error_mark_node
;
2863 if (!TREE_PUBLIC (fn
))
2865 if (really_overloaded_fn (fns
))
2866 return error_mark_node
;
2871 expr
= build_unary_op (ADDR_EXPR
, fn
, 0);
2873 my_friendly_assert (same_type_p (type
, TREE_TYPE (expr
)),
2879 /* For a non-type template-parameter of type pointer to
2880 object, qualification conversions (_conv.qual_) and the
2881 array-to-pointer conversion (_conv.array_) are applied.
2882 [Note: In particular, neither the null pointer conversion
2883 (_conv.ptr_) nor the derived-to-base conversion
2884 (_conv.ptr_) are applied. Although 0 is a valid
2885 template-argument for a non-type template-parameter of
2886 integral type, it is not a valid template-argument for a
2887 non-type template-parameter of pointer type.]
2889 The call to decay_conversion performs the
2890 array-to-pointer conversion, if appropriate. */
2891 expr
= decay_conversion (expr
);
2893 if (expr
== error_mark_node
)
2894 return error_mark_node
;
2896 return perform_qualification_conversions (type
, expr
);
2901 case REFERENCE_TYPE
:
2903 tree type_referred_to
= TREE_TYPE (type
);
2905 if (TREE_CODE (type_referred_to
) == FUNCTION_TYPE
)
2907 /* For a non-type template-parameter of type reference to
2908 function, no conversions apply. If the
2909 template-argument represents a set of overloaded
2910 functions, the matching function is selected from the
2911 set (_over.over_). */
2915 fn
= instantiate_type (type_referred_to
, fns
, 0);
2917 if (fn
== error_mark_node
)
2918 return error_mark_node
;
2920 if (!TREE_PUBLIC (fn
))
2922 if (really_overloaded_fn (fns
))
2923 /* Don't issue an error here; we might get a different
2924 function if the overloading had worked out
2926 return error_mark_node
;
2931 my_friendly_assert (same_type_p (type_referred_to
,
2939 /* For a non-type template-parameter of type reference to
2940 object, no conversions apply. The type referred to by the
2941 reference may be more cv-qualified than the (otherwise
2942 identical) type of the template-argument. The
2943 template-parameter is bound directly to the
2944 template-argument, which must be an lvalue. */
2945 if ((TYPE_MAIN_VARIANT (expr_type
)
2946 != TYPE_MAIN_VARIANT (type_referred_to
))
2947 || !at_least_as_qualified_p (type_referred_to
,
2949 || !real_lvalue_p (expr
))
2950 return error_mark_node
;
2959 if (!TYPE_PTRMEMFUNC_P (type
))
2960 /* This handles templates like
2961 template<class T, T t> void f();
2962 when T is substituted with any class. The second template
2963 parameter becomes invalid and the template candidate is
2965 return error_mark_node
;
2967 /* For a non-type template-parameter of type pointer to member
2968 function, no conversions apply. If the template-argument
2969 represents a set of overloaded member functions, the
2970 matching member function is selected from the set
2973 if (!TYPE_PTRMEMFUNC_P (expr_type
) &&
2974 expr_type
!= unknown_type_node
)
2975 return error_mark_node
;
2977 if (TREE_CODE (expr
) == PTRMEM_CST
)
2979 /* A ptr-to-member constant. */
2980 if (!same_type_p (type
, expr_type
))
2981 return error_mark_node
;
2986 if (TREE_CODE (expr
) != ADDR_EXPR
)
2987 return error_mark_node
;
2989 expr
= instantiate_type (type
, expr
, 0);
2991 if (expr
== error_mark_node
)
2992 return error_mark_node
;
2994 my_friendly_assert (same_type_p (type
, TREE_TYPE (expr
)),
3001 /* All non-type parameters must have one of these types. */
3002 my_friendly_abort (0);
3006 return error_mark_node
;
3009 /* Return 1 if PARM_PARMS and ARG_PARMS matches using rule for
3010 template template parameters. Both PARM_PARMS and ARG_PARMS are
3011 vectors of TREE_LIST nodes containing TYPE_DECL, TEMPLATE_DECL
3014 ARG_PARMS may contain more parameters than PARM_PARMS. If this is
3015 the case, then extra parameters must have default arguments.
3017 Consider the example:
3018 template <class T, class Allocator = allocator> class vector;
3019 template<template <class U> class TT> class C;
3021 C<vector> is a valid instantiation. PARM_PARMS for the above code
3022 contains a TYPE_DECL (for U), ARG_PARMS contains two TYPE_DECLs (for
3023 T and Allocator) and OUTER_ARGS contains the argument that is used to
3024 substitute the TT parameter. */
3027 coerce_template_template_parms (parm_parms
, arg_parms
, complain
,
3028 in_decl
, outer_args
)
3029 tree parm_parms
, arg_parms
;
3031 tree in_decl
, outer_args
;
3033 int nparms
, nargs
, i
;
3036 my_friendly_assert (TREE_CODE (parm_parms
) == TREE_VEC
, 0);
3037 my_friendly_assert (TREE_CODE (arg_parms
) == TREE_VEC
, 0);
3039 nparms
= TREE_VEC_LENGTH (parm_parms
);
3040 nargs
= TREE_VEC_LENGTH (arg_parms
);
3042 /* The rule here is opposite of coerce_template_parms. */
3045 && TREE_PURPOSE (TREE_VEC_ELT (arg_parms
, nparms
)) == NULL_TREE
))
3048 for (i
= 0; i
< nparms
; ++i
)
3050 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, i
));
3051 arg
= TREE_VALUE (TREE_VEC_ELT (arg_parms
, i
));
3053 if (arg
== NULL_TREE
|| arg
== error_mark_node
3054 || parm
== NULL_TREE
|| parm
== error_mark_node
)
3057 if (TREE_CODE (arg
) != TREE_CODE (parm
))
3060 switch (TREE_CODE (parm
))
3066 /* We encounter instantiations of templates like
3067 template <template <template <class> class> class TT>
3070 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
3071 tree argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
3073 if (!coerce_template_template_parms (parmparm
, argparm
,
3081 /* The tsubst call is used to handle cases such as
3082 template <class T, template <T> class TT> class D;
3083 i.e. the parameter list of TT depends on earlier parameters. */
3084 if (!same_type_p (tsubst (TREE_TYPE (parm
), outer_args
,
3091 my_friendly_abort (0);
3097 /* Convert the indicated template ARG as necessary to match the
3098 indicated template PARM. Returns the converted ARG, or
3099 error_mark_node if the conversion was unsuccessful. Error messages
3100 are issued if COMPLAIN is non-zero. This conversion is for the Ith
3101 parameter in the parameter list. ARGS is the full set of template
3102 arguments deduced so far. */
3105 convert_template_argument (parm
, arg
, args
, complain
, i
, in_decl
)
3115 int is_type
, requires_type
, is_tmpl_type
, requires_tmpl_type
;
3117 inner_args
= innermost_args (args
);
3119 if (TREE_CODE (arg
) == TREE_LIST
3120 && TREE_TYPE (arg
) != NULL_TREE
3121 && TREE_CODE (TREE_TYPE (arg
)) == OFFSET_TYPE
)
3123 /* The template argument was the name of some
3124 member function. That's usually
3125 illegal, but static members are OK. In any
3126 case, grab the underlying fields/functions
3127 and issue an error later if required. */
3128 arg
= TREE_VALUE (arg
);
3129 TREE_TYPE (arg
) = unknown_type_node
;
3132 requires_tmpl_type
= TREE_CODE (parm
) == TEMPLATE_DECL
;
3133 requires_type
= (TREE_CODE (parm
) == TYPE_DECL
3134 || requires_tmpl_type
);
3136 /* Check if it is a class template. If REQUIRES_TMPL_TYPE is true,
3137 we also accept implicitly created TYPE_DECL as a valid argument.
3138 This is necessary to handle the case where we pass a template name
3139 to a template template parameter in a scope where we've derived from
3140 in instantiation of that template, so the template name refers to that
3141 instantiation. We really ought to handle this better. */
3143 = ((TREE_CODE (arg
) == TEMPLATE_DECL
3144 && TREE_CODE (DECL_TEMPLATE_RESULT (arg
)) == TYPE_DECL
)
3145 || (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
3146 && !TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (arg
))
3147 || (TREE_CODE (arg
) == RECORD_TYPE
3148 && CLASSTYPE_TEMPLATE_INFO (arg
)
3149 && TREE_CODE (TYPE_NAME (arg
)) == TYPE_DECL
3150 && DECL_ARTIFICIAL (TYPE_NAME (arg
))
3151 && requires_tmpl_type
3152 && is_base_of_enclosing_class (arg
, current_class_type
)));
3153 if (is_tmpl_type
&& TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
3154 arg
= TYPE_STUB_DECL (arg
);
3155 else if (is_tmpl_type
&& TREE_CODE (arg
) == RECORD_TYPE
)
3156 arg
= CLASSTYPE_TI_TEMPLATE (arg
);
3158 is_type
= TREE_CODE_CLASS (TREE_CODE (arg
)) == 't' || is_tmpl_type
;
3160 if (requires_type
&& ! is_type
&& TREE_CODE (arg
) == SCOPE_REF
3161 && TREE_CODE (TREE_OPERAND (arg
, 0)) == TEMPLATE_TYPE_PARM
)
3163 cp_pedwarn ("to refer to a type member of a template parameter,");
3164 cp_pedwarn (" use `typename %E'", arg
);
3166 arg
= make_typename_type (TREE_OPERAND (arg
, 0),
3167 TREE_OPERAND (arg
, 1),
3171 if (is_type
!= requires_type
)
3177 cp_error ("type/value mismatch at argument %d in template parameter list for `%D'",
3180 cp_error (" expected a constant of type `%T', got `%T'",
3182 (is_tmpl_type
? DECL_NAME (arg
) : arg
));
3184 cp_error (" expected a type, got `%E'", arg
);
3187 return error_mark_node
;
3189 if (is_tmpl_type
^ requires_tmpl_type
)
3191 if (in_decl
&& complain
)
3193 cp_error ("type/value mismatch at argument %d in template parameter list for `%D'",
3196 cp_error (" expected a type, got `%T'", DECL_NAME (arg
));
3198 cp_error (" expected a class template, got `%T'", arg
);
3200 return error_mark_node
;
3205 if (requires_tmpl_type
)
3207 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
3208 tree argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
3210 if (coerce_template_template_parms (parmparm
, argparm
, complain
,
3211 in_decl
, inner_args
))
3215 /* TEMPLATE_TEMPLATE_PARM node is preferred over
3217 if (val
!= error_mark_node
3218 && DECL_TEMPLATE_TEMPLATE_PARM_P (val
))
3219 val
= TREE_TYPE (val
);
3223 if (in_decl
&& complain
)
3225 cp_error ("type/value mismatch at argument %d in template parameter list for `%D'",
3227 cp_error (" expected a template of type `%D', got `%D'", parm
, arg
);
3230 val
= error_mark_node
;
3235 val
= groktypename (arg
);
3236 if (! processing_template_decl
)
3238 /* [basic.link]: A name with no linkage (notably, the
3239 name of a class or enumeration declared in a local
3240 scope) shall not be used to declare an entity with
3241 linkage. This implies that names with no linkage
3242 cannot be used as template arguments. */
3243 tree t
= no_linkage_check (val
);
3246 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
3248 ("template-argument `%T' uses anonymous type", val
);
3251 ("template-argument `%T' uses local type `%T'",
3253 return error_mark_node
;
3260 tree t
= tsubst (TREE_TYPE (parm
), args
, complain
, in_decl
);
3262 if (processing_template_decl
)
3263 arg
= maybe_fold_nontype_arg (arg
);
3265 if (!uses_template_parms (arg
) && !uses_template_parms (t
))
3266 /* We used to call digest_init here. However, digest_init
3267 will report errors, which we don't want when complain
3268 is zero. More importantly, digest_init will try too
3269 hard to convert things: for example, `0' should not be
3270 converted to pointer type at this point according to
3271 the standard. Accepting this is not merely an
3272 extension, since deciding whether or not these
3273 conversions can occur is part of determining which
3274 function template to call, or whether a given epxlicit
3275 argument specification is legal. */
3276 val
= convert_nontype_argument (t
, arg
);
3280 if (val
== NULL_TREE
)
3281 val
= error_mark_node
;
3282 else if (val
== error_mark_node
&& complain
)
3283 cp_error ("could not convert template argument `%E' to `%T'",
3290 /* Convert all template arguments to their appropriate types, and
3291 return a vector containing the innermost resulting template
3292 arguments. If any error occurs, return error_mark_node, and, if
3293 COMPLAIN is non-zero, issue an error message. Some error messages
3294 are issued even if COMPLAIN is zero; for instance, if a template
3295 argument is composed from a local class.
3297 If REQUIRE_ALL_ARGUMENTS is non-zero, all arguments must be
3298 provided in ARGLIST, or else trailing parameters must have default
3299 values. If REQUIRE_ALL_ARGUMENTS is zero, we will attempt argument
3300 deduction for any unspecified trailing arguments.
3302 The resulting TREE_VEC is allocated on a temporary obstack, and
3303 must be explicitly copied if it will be permanent. */
3306 coerce_template_parms (parms
, args
, in_decl
,
3308 require_all_arguments
)
3312 int require_all_arguments
;
3314 int nparms
, nargs
, i
, lost
= 0;
3317 tree new_inner_args
;
3319 inner_args
= innermost_args (args
);
3320 nargs
= NUM_TMPL_ARGS (inner_args
);
3321 nparms
= TREE_VEC_LENGTH (parms
);
3325 && require_all_arguments
3326 && TREE_PURPOSE (TREE_VEC_ELT (parms
, nargs
)) == NULL_TREE
))
3330 cp_error ("wrong number of template arguments (%d, should be %d)",
3334 cp_error_at ("provided for `%D'", in_decl
);
3337 return error_mark_node
;
3340 new_inner_args
= make_tree_vec (nparms
);
3341 new_args
= add_outermost_template_args (args
, new_inner_args
);
3342 for (i
= 0; i
< nparms
; i
++)
3347 /* Get the Ith template parameter. */
3348 parm
= TREE_VEC_ELT (parms
, i
);
3350 /* Calculate the Ith argument. */
3351 if (inner_args
&& TREE_CODE (inner_args
) == TREE_LIST
)
3353 arg
= TREE_VALUE (inner_args
);
3354 inner_args
= TREE_CHAIN (inner_args
);
3357 arg
= TREE_VEC_ELT (inner_args
, i
);
3358 /* If no template argument was supplied, look for a default
3360 else if (TREE_PURPOSE (parm
) == NULL_TREE
)
3362 /* There was no default value. */
3363 my_friendly_assert (!require_all_arguments
, 0);
3366 else if (TREE_CODE (TREE_VALUE (parm
)) == TYPE_DECL
)
3367 arg
= tsubst (TREE_PURPOSE (parm
), new_args
, complain
, in_decl
);
3369 arg
= tsubst_expr (TREE_PURPOSE (parm
), new_args
, complain
,
3372 /* Now, convert the Ith argument, as necessary. */
3373 if (arg
== NULL_TREE
)
3374 /* We're out of arguments. */
3376 my_friendly_assert (!require_all_arguments
, 0);
3379 else if (arg
== error_mark_node
)
3381 cp_error ("template argument %d is invalid", i
+ 1);
3382 arg
= error_mark_node
;
3385 arg
= convert_template_argument (TREE_VALUE (parm
),
3386 arg
, new_args
, complain
, i
,
3389 if (arg
== error_mark_node
)
3391 TREE_VEC_ELT (new_inner_args
, i
) = arg
;
3395 return error_mark_node
;
3397 return new_inner_args
;
3400 /* Returns 1 if template args OT and NT are equivalent. */
3403 template_args_equal (ot
, nt
)
3408 if (TREE_CODE (nt
) != TREE_CODE (ot
))
3410 if (TREE_CODE (nt
) == TREE_VEC
)
3411 /* For member templates */
3412 return comp_template_args (ot
, nt
);
3413 else if (TREE_CODE_CLASS (TREE_CODE (ot
)) == 't')
3414 return same_type_p (ot
, nt
);
3416 return (cp_tree_equal (ot
, nt
) > 0);
3419 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets
3420 of template arguments. Returns 0 otherwise. */
3423 comp_template_args (oldargs
, newargs
)
3424 tree oldargs
, newargs
;
3428 if (TREE_VEC_LENGTH (oldargs
) != TREE_VEC_LENGTH (newargs
))
3431 for (i
= 0; i
< TREE_VEC_LENGTH (oldargs
); ++i
)
3433 tree nt
= TREE_VEC_ELT (newargs
, i
);
3434 tree ot
= TREE_VEC_ELT (oldargs
, i
);
3436 if (! template_args_equal (ot
, nt
))
3442 /* Given class template name and parameter list, produce a user-friendly name
3443 for the instantiation. */
3446 mangle_class_name_for_template (name
, parms
, arglist
)
3448 tree parms
, arglist
;
3450 static struct obstack scratch_obstack
;
3451 static char *scratch_firstobj
;
3454 if (!scratch_firstobj
)
3455 gcc_obstack_init (&scratch_obstack
);
3457 obstack_free (&scratch_obstack
, scratch_firstobj
);
3458 scratch_firstobj
= obstack_alloc (&scratch_obstack
, 1);
3460 #define ccat(c) obstack_1grow (&scratch_obstack, (c));
3461 #define cat(s) obstack_grow (&scratch_obstack, (s), strlen (s))
3465 nparms
= TREE_VEC_LENGTH (parms
);
3466 arglist
= innermost_args (arglist
);
3467 my_friendly_assert (nparms
== TREE_VEC_LENGTH (arglist
), 268);
3468 for (i
= 0; i
< nparms
; i
++)
3470 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
3471 tree arg
= TREE_VEC_ELT (arglist
, i
);
3476 if (TREE_CODE (parm
) == TYPE_DECL
)
3478 cat (type_as_string (arg
, TS_CHASE_TYPEDEFS
));
3481 else if (TREE_CODE (parm
) == TEMPLATE_DECL
)
3483 if (TREE_CODE (arg
) == TEMPLATE_DECL
)
3485 /* Already substituted with real template. Just output
3486 the template name here */
3487 tree context
= DECL_CONTEXT (arg
);
3490 /* The template may be defined in a namespace, or
3491 may be a member template. */
3492 my_friendly_assert (TREE_CODE (context
) == NAMESPACE_DECL
3493 || CLASS_TYPE_P (context
),
3495 cat(decl_as_string (DECL_CONTEXT (arg
), 0));
3498 cat (IDENTIFIER_POINTER (DECL_NAME (arg
)));
3501 /* Output the parameter declaration */
3502 cat (type_as_string (arg
, TS_CHASE_TYPEDEFS
));
3506 my_friendly_assert (TREE_CODE (parm
) == PARM_DECL
, 269);
3508 if (TREE_CODE (arg
) == TREE_LIST
)
3510 /* New list cell was built because old chain link was in
3512 my_friendly_assert (TREE_PURPOSE (arg
) == NULL_TREE
, 270);
3513 arg
= TREE_VALUE (arg
);
3515 /* No need to check arglist against parmlist here; we did that
3516 in coerce_template_parms, called from lookup_template_class. */
3517 cat (expr_as_string (arg
, 0));
3520 char *bufp
= obstack_next_free (&scratch_obstack
);
3522 while (bufp
[offset
- 1] == ' ')
3524 obstack_blank_fast (&scratch_obstack
, offset
);
3526 /* B<C<char> >, not B<C<char>> */
3527 if (bufp
[offset
- 1] == '>')
3532 return (char *) obstack_base (&scratch_obstack
);
3536 classtype_mangled_name (t
)
3539 if (CLASSTYPE_TEMPLATE_INFO (t
)
3540 /* Specializations have already had their names set up in
3541 lookup_template_class. */
3542 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
3544 tree tmpl
= most_general_template (CLASSTYPE_TI_TEMPLATE (t
));
3546 /* For non-primary templates, the template parameters are
3547 implicit from their surrounding context. */
3548 if (PRIMARY_TEMPLATE_P (tmpl
))
3550 tree name
= DECL_NAME (tmpl
);
3551 char *mangled_name
= mangle_class_name_for_template
3552 (IDENTIFIER_POINTER (name
),
3553 DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
3554 CLASSTYPE_TI_ARGS (t
));
3555 tree id
= get_identifier (mangled_name
);
3556 IDENTIFIER_TEMPLATE (id
) = name
;
3561 return TYPE_IDENTIFIER (t
);
3565 add_pending_template (d
)
3570 if (TREE_CODE_CLASS (TREE_CODE (d
)) == 't')
3571 ti
= CLASSTYPE_TEMPLATE_INFO (d
);
3573 ti
= DECL_TEMPLATE_INFO (d
);
3575 if (TI_PENDING_TEMPLATE_FLAG (ti
))
3578 *template_tail
= tree_cons (build_srcloc_here (), d
, NULL_TREE
);
3579 template_tail
= &TREE_CHAIN (*template_tail
);
3580 TI_PENDING_TEMPLATE_FLAG (ti
) = 1;
3584 /* Return a TEMPLATE_ID_EXPR corresponding to the indicated FNS (which
3585 may be either a _DECL or an overloaded function or an
3586 IDENTIFIER_NODE), and ARGLIST. */
3589 lookup_template_function (fns
, arglist
)
3594 if (fns
== NULL_TREE
)
3596 cp_error ("non-template used as template");
3597 return error_mark_node
;
3600 type
= TREE_TYPE (fns
);
3601 if (TREE_CODE (fns
) == OVERLOAD
|| !type
)
3602 type
= unknown_type_node
;
3604 if (processing_template_decl
)
3605 return build_min (TEMPLATE_ID_EXPR
, type
, fns
, arglist
);
3607 return build (TEMPLATE_ID_EXPR
, type
, fns
, arglist
);
3610 /* Within the scope of a template class S<T>, the name S gets bound
3611 (in build_self_reference) to a TYPE_DECL for the class, not a
3612 TEMPLATE_DECL. If DECL is a TYPE_DECL for current_class_type,
3613 or one of its enclosing classes, and that type is a template,
3614 return the associated TEMPLATE_DECL. Otherwise, the original
3615 DECL is returned. */
3618 maybe_get_template_decl_from_type_decl (decl
)
3621 return (decl
!= NULL_TREE
3622 && TREE_CODE (decl
) == TYPE_DECL
3623 && DECL_ARTIFICIAL (decl
)
3624 && CLASS_TYPE_P (TREE_TYPE (decl
))
3625 && CLASSTYPE_TEMPLATE_INFO (TREE_TYPE (decl
)))
3626 ? CLASSTYPE_TI_TEMPLATE (TREE_TYPE (decl
)) : decl
;
3629 /* Given an IDENTIFIER_NODE (type TEMPLATE_DECL) and a chain of
3630 parameters, find the desired type.
3632 D1 is the PTYPENAME terminal, and ARGLIST is the list of arguments.
3633 (Actually ARGLIST may be either a TREE_LIST or a TREE_VEC. It will
3634 be a TREE_LIST if called directly from the parser, and a TREE_VEC
3635 otherwise.) Since ARGLIST is build on the temp_decl_obstack, we must
3636 copy it here to keep it from being reclaimed when the decl storage
3639 IN_DECL, if non-NULL, is the template declaration we are trying to
3642 If ENTERING_SCOPE is non-zero, we are about to enter the scope of
3643 the class we are looking up.
3645 If the template class is really a local class in a template
3646 function, then the FUNCTION_CONTEXT is the function in which it is
3647 being instantiated. */
3650 lookup_template_class (d1
, arglist
, in_decl
, context
, entering_scope
)
3656 tree
template = NULL_TREE
, parmlist
;
3659 if (TREE_CODE (d1
) == IDENTIFIER_NODE
)
3661 if (IDENTIFIER_VALUE (d1
)
3662 && DECL_TEMPLATE_TEMPLATE_PARM_P (IDENTIFIER_VALUE (d1
)))
3663 template = IDENTIFIER_VALUE (d1
);
3667 push_decl_namespace (context
);
3668 template = lookup_name (d1
, /*prefer_type=*/0);
3669 template = maybe_get_template_decl_from_type_decl (template);
3671 pop_decl_namespace ();
3674 context
= DECL_CONTEXT (template);
3676 else if (TREE_CODE (d1
) == TYPE_DECL
&& IS_AGGR_TYPE (TREE_TYPE (d1
)))
3678 tree type
= TREE_TYPE (d1
);
3680 /* If we are declaring a constructor, say A<T>::A<T>, we will get
3681 an implicit typename for the second A. Deal with it. */
3682 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
3683 type
= TREE_TYPE (type
);
3685 if (CLASSTYPE_TEMPLATE_INFO (type
))
3687 template = CLASSTYPE_TI_TEMPLATE (type
);
3688 d1
= DECL_NAME (template);
3691 else if (TREE_CODE (d1
) == ENUMERAL_TYPE
3692 || (TREE_CODE_CLASS (TREE_CODE (d1
)) == 't'
3693 && IS_AGGR_TYPE (d1
)))
3695 template = TYPE_TI_TEMPLATE (d1
);
3696 d1
= DECL_NAME (template);
3698 else if (TREE_CODE (d1
) == TEMPLATE_DECL
3699 && TREE_CODE (DECL_RESULT (d1
)) == TYPE_DECL
)
3702 d1
= DECL_NAME (template);
3703 context
= DECL_CONTEXT (template);
3706 my_friendly_abort (272);
3708 /* With something like `template <class T> class X class X { ... };'
3709 we could end up with D1 having nothing but an IDENTIFIER_VALUE.
3710 We don't want to do that, but we have to deal with the situation,
3711 so let's give them some syntax errors to chew on instead of a
3715 cp_error ("`%T' is not a template", d1
);
3716 return error_mark_node
;
3719 if (context
== NULL_TREE
)
3720 context
= global_namespace
;
3722 if (TREE_CODE (template) != TEMPLATE_DECL
)
3724 cp_error ("non-template type `%T' used as a template", d1
);
3726 cp_error_at ("for template declaration `%D'", in_decl
);
3727 return error_mark_node
;
3730 if (DECL_TEMPLATE_TEMPLATE_PARM_P (template))
3732 /* Create a new TEMPLATE_DECL and TEMPLATE_TEMPLATE_PARM node to store
3733 template arguments */
3735 tree parm
= copy_template_template_parm (TREE_TYPE (template));
3736 tree template2
= TYPE_STUB_DECL (parm
);
3739 parmlist
= DECL_INNERMOST_TEMPLATE_PARMS (template);
3741 arglist2
= coerce_template_parms (parmlist
, arglist
, template, 1, 1);
3742 if (arglist2
== error_mark_node
)
3743 return error_mark_node
;
3745 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (parm
)
3746 = tree_cons (template2
, arglist2
, NULL_TREE
);
3747 TYPE_SIZE (parm
) = 0;
3752 tree template_type
= TREE_TYPE (template);
3755 tree found
= NULL_TREE
;
3758 int is_partial_instantiation
;
3760 gen_tmpl
= most_general_template (template);
3761 parmlist
= DECL_TEMPLATE_PARMS (gen_tmpl
);
3762 parm_depth
= TMPL_PARMS_DEPTH (parmlist
);
3763 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
3765 if (arg_depth
== 1 && parm_depth
> 1)
3767 /* We've been given an incomplete set of template arguments.
3770 template <class T> struct S1 {
3771 template <class U> struct S2 {};
3772 template <class U> struct S2<U*> {};
3775 we will be called with an ARGLIST of `U*', but the
3776 TEMPLATE will be `template <class T> template
3777 <class U> struct S1<T>::S2'. We must fill in the missing
3780 = add_outermost_template_args (TYPE_TI_ARGS (TREE_TYPE (template)),
3782 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
3785 /* Now we should enough arguments. */
3786 my_friendly_assert (parm_depth
== arg_depth
, 0);
3788 /* From here on, we're only interested in the most general
3790 template = gen_tmpl
;
3792 /* Calculate the BOUND_ARGS. These will be the args that are
3793 actually tsubst'd into the definition to create the
3797 /* We have multiple levels of arguments to coerce, at once. */
3799 int saved_depth
= TMPL_ARGS_DEPTH (arglist
);
3801 tree bound_args
= make_tree_vec (parm_depth
);
3803 for (i
= saved_depth
,
3804 t
= DECL_TEMPLATE_PARMS (template);
3805 i
> 0 && t
!= NULL_TREE
;
3806 --i
, t
= TREE_CHAIN (t
))
3808 tree a
= coerce_template_parms (TREE_VALUE (t
),
3809 arglist
, template, 1, 1);
3810 SET_TMPL_ARGS_LEVEL (bound_args
, i
, a
);
3812 /* We temporarily reduce the length of the ARGLIST so
3813 that coerce_template_parms will see only the arguments
3814 corresponding to the template parameters it is
3816 TREE_VEC_LENGTH (arglist
)--;
3819 /* Restore the ARGLIST to its full size. */
3820 TREE_VEC_LENGTH (arglist
) = saved_depth
;
3822 arglist
= bound_args
;
3826 = coerce_template_parms (INNERMOST_TEMPLATE_PARMS (parmlist
),
3827 innermost_args (arglist
),
3830 if (arglist
== error_mark_node
)
3831 /* We were unable to bind the arguments. */
3832 return error_mark_node
;
3834 /* In the scope of a template class, explicit references to the
3835 template class refer to the type of the template, not any
3836 instantiation of it. For example, in:
3838 template <class T> class C { void f(C<T>); }
3840 the `C<T>' is just the same as `C'. Outside of the
3841 class, however, such a reference is an instantiation. */
3842 if (comp_template_args (TYPE_TI_ARGS (template_type
),
3845 found
= template_type
;
3847 if (!entering_scope
&& PRIMARY_TEMPLATE_P (template))
3851 /* Note that we use DECL_CONTEXT, rather than
3852 CP_DECL_CONTEXT, so that the termination test is
3853 always just `ctx'. We're not interested in namepace
3855 for (ctx
= current_class_type
;
3857 ctx
= (TREE_CODE_CLASS (TREE_CODE (ctx
)) == 't')
3858 ? TYPE_CONTEXT (ctx
) : DECL_CONTEXT (ctx
))
3859 if (same_type_p (ctx
, template_type
))
3863 /* We're not in the scope of the class, so the
3864 TEMPLATE_TYPE is not the type we want after
3872 for (found
= DECL_TEMPLATE_INSTANTIATIONS (template);
3873 found
; found
= TREE_CHAIN (found
))
3874 if (comp_template_args (TREE_PURPOSE (found
), arglist
))
3878 found
= TREE_VALUE (found
);
3884 /* This type is a "partial instantiation" if any of the template
3885 arguments still inolve template parameters. Note that we set
3886 IS_PARTIAL_INSTANTIATION for partial specializations as
3888 is_partial_instantiation
= uses_template_parms (arglist
);
3890 if (!is_partial_instantiation
3891 && !PRIMARY_TEMPLATE_P (template)
3892 && TREE_CODE (CP_DECL_CONTEXT (template)) == NAMESPACE_DECL
)
3894 found
= xref_tag_from_type (TREE_TYPE (template),
3895 DECL_NAME (template),
3900 /* Create the type. */
3901 if (TREE_CODE (template_type
) == ENUMERAL_TYPE
)
3903 if (!is_partial_instantiation
)
3904 t
= start_enum (TYPE_IDENTIFIER (template_type
));
3906 /* We don't want to call start_enum for this type, since
3907 the values for the enumeration constants may involve
3908 template parameters. And, no one should be interested
3909 in the enumeration constants for such a type. */
3910 t
= make_node (ENUMERAL_TYPE
);
3914 t
= make_aggr_type (TREE_CODE (template_type
));
3915 CLASSTYPE_DECLARED_CLASS (t
)
3916 = CLASSTYPE_DECLARED_CLASS (template_type
);
3917 CLASSTYPE_GOT_SEMICOLON (t
) = 1;
3918 SET_CLASSTYPE_IMPLICIT_INSTANTIATION (t
);
3919 TYPE_FOR_JAVA (t
) = TYPE_FOR_JAVA (template_type
);
3921 /* A local class. Make sure the decl gets registered properly. */
3922 if (context
== current_function_decl
)
3923 pushtag (DECL_NAME (template), t
, 0);
3926 /* If we called start_enum or pushtag above, this information
3927 will already be set up. */
3930 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
3932 type_decl
= create_implicit_typedef (DECL_NAME (template), t
);
3933 DECL_CONTEXT (type_decl
) = TYPE_CONTEXT (t
);
3934 TYPE_STUB_DECL (t
) = type_decl
;
3935 DECL_SOURCE_FILE (type_decl
)
3936 = DECL_SOURCE_FILE (TYPE_STUB_DECL (template_type
));
3937 DECL_SOURCE_LINE (type_decl
)
3938 = DECL_SOURCE_LINE (TYPE_STUB_DECL (template_type
));
3941 type_decl
= TYPE_NAME (t
);
3943 /* Set up the template information. We have to figure out which
3944 template is the immediate parent if this is a full
3946 if (parm_depth
== 1 || is_partial_instantiation
3947 || !PRIMARY_TEMPLATE_P (template))
3948 /* This case is easy; there are no member templates involved. */
3952 /* This is a full instantiation of a member template. There
3953 should be some partial instantiation of which this is an
3956 for (found
= DECL_TEMPLATE_INSTANTIATIONS (template);
3957 found
; found
= TREE_CHAIN (found
))
3960 tree tmpl
= CLASSTYPE_TI_TEMPLATE (TREE_VALUE (found
));
3962 /* We only want partial instantiations, here, not
3963 specializations or full instantiations. */
3964 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_VALUE (found
))
3965 || !uses_template_parms (TREE_VALUE (found
)))
3968 /* Temporarily reduce by one the number of levels in the
3969 ARGLIST and in FOUND so as to avoid comparing the
3970 last set of arguments. */
3971 TREE_VEC_LENGTH (arglist
)--;
3972 TREE_VEC_LENGTH (TREE_PURPOSE (found
)) --;
3974 /* See if the arguments match. If they do, then TMPL is
3975 the partial instantiation we want. */
3976 success
= comp_template_args (TREE_PURPOSE (found
), arglist
);
3978 /* Restore the argument vectors to their full size. */
3979 TREE_VEC_LENGTH (arglist
)++;
3980 TREE_VEC_LENGTH (TREE_PURPOSE (found
))++;
3990 my_friendly_abort (0);
3993 SET_TYPE_TEMPLATE_INFO (t
,
3994 tree_cons (found
, arglist
, NULL_TREE
));
3995 DECL_TEMPLATE_INSTANTIATIONS (template)
3996 = tree_cons (arglist
, t
,
3997 DECL_TEMPLATE_INSTANTIATIONS (template));
3999 if (TREE_CODE (t
) == ENUMERAL_TYPE
4000 && !is_partial_instantiation
)
4001 /* Now that the type has been registered on the instantiations
4002 list, we set up the enumerators. Because the enumeration
4003 constants may involve the enumeration type itself, we make
4004 sure to register the type first, and then create the
4005 constants. That way, doing tsubst_expr for the enumeration
4006 constants won't result in recursive calls here; we'll find
4007 the instantiation and exit above. */
4008 tsubst_enum (template_type
, t
, arglist
);
4010 /* Reset the name of the type, now that CLASSTYPE_TEMPLATE_INFO
4012 if (TREE_CODE (t
) != ENUMERAL_TYPE
)
4013 DECL_NAME (type_decl
) = classtype_mangled_name (t
);
4014 DECL_ASSEMBLER_NAME (type_decl
) = DECL_NAME (type_decl
);
4015 if (!is_partial_instantiation
)
4017 DECL_ASSEMBLER_NAME (type_decl
)
4018 = get_identifier (build_overload_name (t
, 1, 1));
4020 /* For backwards compatibility; code that uses
4021 -fexternal-templates expects looking up a template to
4022 instantiate it. I think DDD still relies on this.
4023 (jason 8/20/1998) */
4024 if (TREE_CODE (t
) != ENUMERAL_TYPE
4025 && flag_external_templates
4026 && CLASSTYPE_INTERFACE_KNOWN (TREE_TYPE (template))
4027 && ! CLASSTYPE_INTERFACE_ONLY (TREE_TYPE (template)))
4028 add_pending_template (t
);
4031 /* If the type makes use of template parameters, the
4032 code that generates debugging information will crash. */
4033 DECL_IGNORED_P (TYPE_STUB_DECL (t
)) = 1;
4045 /* Called from for_each_template_parm via walk_tree. */
4048 for_each_template_parm_r (tp
, walk_subtrees
, d
)
4054 struct pair_fn_data
*pfd
= (struct pair_fn_data
*) d
;
4055 tree_fn_t fn
= pfd
->fn
;
4056 void *data
= pfd
->data
;
4058 if (TREE_CODE_CLASS (TREE_CODE (t
)) == 't'
4059 && for_each_template_parm (TYPE_CONTEXT (t
), fn
, data
))
4060 return error_mark_node
;
4062 switch (TREE_CODE (t
))
4065 if (TYPE_PTRMEMFUNC_FLAG (t
))
4071 if (!TYPE_TEMPLATE_INFO (t
))
4073 else if (for_each_template_parm (TREE_VALUE (TYPE_TEMPLATE_INFO (t
)),
4075 return error_mark_node
;
4079 /* Since we're not going to walk subtrees, we have to do this
4081 if (for_each_template_parm (TYPE_METHOD_BASETYPE (t
), fn
, data
))
4082 return error_mark_node
;
4085 /* Check the return type. */
4086 if (for_each_template_parm (TREE_TYPE (t
), fn
, data
))
4087 return error_mark_node
;
4089 /* Check the parameter types. Since default arguments are not
4090 instantiated until they are needed, the TYPE_ARG_TYPES may
4091 contain expressions that involve template parameters. But,
4092 no-one should be looking at them yet. And, once they're
4093 instantiated, they don't contain template parameters, so
4094 there's no point in looking at them then, either. */
4098 for (parm
= TYPE_ARG_TYPES (t
); parm
; parm
= TREE_CHAIN (parm
))
4099 if (for_each_template_parm (TREE_VALUE (parm
), fn
, data
))
4100 return error_mark_node
;
4102 /* Since we've already handled the TYPE_ARG_TYPES, we don't
4103 want walk_tree walking into them itself. */
4110 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
)
4111 && for_each_template_parm (DECL_TI_ARGS (t
), fn
, data
))
4112 return error_mark_node
;
4117 if (DECL_CONTEXT (t
)
4118 && for_each_template_parm (DECL_CONTEXT (t
), fn
, data
))
4119 return error_mark_node
;
4122 case TEMPLATE_TEMPLATE_PARM
:
4123 /* Record template parameters such as `T' inside `TT<T>'. */
4124 if (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t
)
4125 && for_each_template_parm (TYPE_TI_ARGS (t
), fn
, data
))
4126 return error_mark_node
;
4129 case TEMPLATE_TYPE_PARM
:
4130 case TEMPLATE_PARM_INDEX
:
4131 if (fn
&& (*fn
)(t
, data
))
4132 return error_mark_node
;
4134 return error_mark_node
;
4138 /* A template template parameter is encountered */
4139 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
)
4140 && for_each_template_parm (TREE_TYPE (t
), fn
, data
))
4141 return error_mark_node
;
4143 /* Already substituted template template parameter */
4148 if (!fn
|| for_each_template_parm (TYPENAME_TYPE_FULLNAME (t
), fn
, data
))
4149 return error_mark_node
;
4153 if (TREE_TYPE (t
) && TYPE_PTRMEMFUNC_P (TREE_TYPE (t
))
4154 && for_each_template_parm (TYPE_PTRMEMFUNC_FN_TYPE
4155 (TREE_TYPE (t
)), fn
, data
))
4156 return error_mark_node
;
4161 /* If there's no type, then this thing must be some expression
4162 involving template parameters. */
4163 if (!fn
&& !TREE_TYPE (t
))
4164 return error_mark_node
;
4169 case REINTERPRET_CAST_EXPR
:
4170 case CONST_CAST_EXPR
:
4171 case STATIC_CAST_EXPR
:
4172 case DYNAMIC_CAST_EXPR
:
4177 case PSEUDO_DTOR_EXPR
:
4179 return error_mark_node
;
4186 /* We didn't find any template parameters we liked. */
4190 /* For each TEMPLATE_TYPE_PARM, TEMPLATE_TEMPLATE_PARM, or
4191 TEMPLATE_PARM_INDEX in T, call FN with the parameter and the DATA.
4192 If FN returns non-zero, the iteration is terminated, and
4193 for_each_template_parm returns 1. Otherwise, the iteration
4194 continues. If FN never returns a non-zero value, the value
4195 returned by for_each_template_parm is 0. If FN is NULL, it is
4196 considered to be the function which always returns 1. */
4199 for_each_template_parm (t
, fn
, data
)
4204 struct pair_fn_data pfd
;
4210 /* Walk the tree. */
4211 return walk_tree (&t
, for_each_template_parm_r
, &pfd
) != NULL_TREE
;
4215 uses_template_parms (t
)
4218 return for_each_template_parm (t
, 0, 0);
4221 static struct tinst_level
*current_tinst_level
;
4222 static struct tinst_level
*free_tinst_level
;
4223 static int tinst_depth
;
4224 extern int max_tinst_depth
;
4225 #ifdef GATHER_STATISTICS
4228 static int tinst_level_tick
;
4229 static int last_template_error_tick
;
4231 /* Print out all the template instantiations that we are currently
4232 working on. If ERR, we are being called from cp_thing, so do
4233 the right thing for an error message. */
4236 print_template_context (err
)
4239 struct tinst_level
*p
= current_tinst_level
;
4241 char *file
= input_filename
;
4245 if (current_function_decl
!= p
->decl
4246 && current_function_decl
!= NULL_TREE
)
4247 /* We can get here during the processing of some synthesized
4248 method. Then, p->decl will be the function that's causing
4253 if (current_function_decl
== p
->decl
)
4254 /* Avoid redundancy with the the "In function" line. */;
4256 fprintf (stderr
, "%s: In instantiation of `%s':\n",
4257 file
, decl_as_string (p
->decl
, TS_DECL_TYPE
| TS_FUNC_NORETURN
));
4265 for (; p
; p
= p
->next
)
4267 fprintf (stderr
, "%s:%d: instantiated from `%s'\n", file
, line
,
4268 decl_as_string (p
->decl
, TS_DECL_TYPE
| TS_FUNC_NORETURN
));
4272 fprintf (stderr
, "%s:%d: instantiated from here\n", file
, line
);
4275 /* Called from cp_thing to print the template context for an error. */
4278 maybe_print_template_context ()
4280 if (last_template_error_tick
== tinst_level_tick
4281 || current_tinst_level
== 0)
4284 last_template_error_tick
= tinst_level_tick
;
4285 print_template_context (1);
4289 push_tinst_level (d
)
4292 struct tinst_level
*new;
4294 if (tinst_depth
>= max_tinst_depth
)
4296 /* If the instantiation in question still has unbound template parms,
4297 we don't really care if we can't instantiate it, so just return.
4298 This happens with base instantiation for implicit `typename'. */
4299 if (uses_template_parms (d
))
4302 last_template_error_tick
= tinst_level_tick
;
4303 error ("template instantiation depth exceeds maximum of %d",
4305 error (" (use -ftemplate-depth-NN to increase the maximum)");
4306 cp_error (" instantiating `%D'", d
);
4308 print_template_context (0);
4313 if (free_tinst_level
)
4315 new = free_tinst_level
;
4316 free_tinst_level
= new->next
;
4319 new = (struct tinst_level
*) xmalloc (sizeof (struct tinst_level
));
4323 new->file
= input_filename
;
4324 new->next
= current_tinst_level
;
4325 current_tinst_level
= new;
4328 #ifdef GATHER_STATISTICS
4329 if (tinst_depth
> depth_reached
)
4330 depth_reached
= tinst_depth
;
4340 struct tinst_level
*old
= current_tinst_level
;
4342 /* Restore the filename and line number stashed away when we started
4343 this instantiation. */
4345 input_filename
= old
->file
;
4346 extract_interface_info ();
4348 current_tinst_level
= old
->next
;
4349 old
->next
= free_tinst_level
;
4350 free_tinst_level
= old
;
4355 struct tinst_level
*
4358 struct tinst_level
*p
= current_tinst_level
;
4361 for (; p
->next
; p
= p
->next
)
4366 /* DECL is a friend FUNCTION_DECL or TEMPLATE_DECL. ARGS is the
4367 vector of template arguments, as for tsubst.
4369 Returns an appropriate tsbust'd friend declaration. */
4372 tsubst_friend_function (decl
, args
)
4378 char *file
= input_filename
;
4380 lineno
= DECL_SOURCE_LINE (decl
);
4381 input_filename
= DECL_SOURCE_FILE (decl
);
4383 if (TREE_CODE (decl
) == FUNCTION_DECL
4384 && DECL_TEMPLATE_INSTANTIATION (decl
)
4385 && TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
4386 /* This was a friend declared with an explicit template
4387 argument list, e.g.:
4391 to indicate that f was a template instantiation, not a new
4392 function declaration. Now, we have to figure out what
4393 instantiation of what template. */
4400 = lookup_template_function (tsubst_expr (DECL_TI_TEMPLATE (decl
),
4401 args
, /*complain=*/1,
4403 tsubst (DECL_TI_ARGS (decl
),
4404 args
, /*complain=*/1,
4406 new_friend
= tsubst (decl
, args
, /*complain=*/1, NULL_TREE
);
4407 tmpl
= determine_specialization (template_id
, new_friend
,
4409 /*need_member_template=*/0);
4410 new_friend
= instantiate_template (tmpl
, new_args
);
4414 new_friend
= tsubst (decl
, args
, /*complain=*/1, NULL_TREE
);
4416 /* The NEW_FRIEND will look like an instantiation, to the
4417 compiler, but is not an instantiation from the point of view of
4418 the language. For example, we might have had:
4420 template <class T> struct S {
4421 template <class U> friend void f(T, U);
4424 Then, in S<int>, template <class U> void f(int, U) is not an
4425 instantiation of anything. */
4426 DECL_USE_TEMPLATE (new_friend
) = 0;
4427 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
4428 DECL_USE_TEMPLATE (DECL_TEMPLATE_RESULT (new_friend
)) = 0;
4430 /* The mangled name for the NEW_FRIEND is incorrect. The call to
4431 tsubst will have resulted in a call to
4432 set_mangled_name_for_template_decl. But, the function is not a
4433 template instantiation and should not be mangled like one.
4434 Therefore, we remangle the function name. We don't have to do
4435 this if the NEW_FRIEND is a template since
4436 set_mangled_name_for_template_decl doesn't do anything if the
4437 function declaration still uses template arguments. */
4438 if (TREE_CODE (new_friend
) != TEMPLATE_DECL
)
4440 set_mangled_name_for_decl (new_friend
);
4441 DECL_RTL (new_friend
) = 0;
4442 make_decl_rtl (new_friend
, NULL_PTR
, 1);
4445 if (DECL_NAMESPACE_SCOPE_P (new_friend
))
4448 tree new_friend_template_info
;
4449 tree new_friend_result_template_info
;
4451 int new_friend_is_defn
;
4453 /* We must save some information from NEW_FRIEND before calling
4454 duplicate decls since that function will free NEW_FRIEND if
4456 new_friend_template_info
= DECL_TEMPLATE_INFO (new_friend
);
4457 if (TREE_CODE (new_friend
) == TEMPLATE_DECL
)
4459 /* This declaration is a `primary' template. */
4460 DECL_PRIMARY_TEMPLATE (new_friend
) = new_friend
;
4463 = DECL_INITIAL (DECL_RESULT (new_friend
)) != NULL_TREE
;
4464 new_friend_result_template_info
4465 = DECL_TEMPLATE_INFO (DECL_RESULT (new_friend
));
4469 new_friend_is_defn
= DECL_INITIAL (new_friend
) != NULL_TREE
;
4470 new_friend_result_template_info
= NULL_TREE
;
4473 /* Inside pushdecl_namespace_level, we will push into the
4474 current namespace. However, the friend function should go
4475 into the namespace of the template. */
4476 ns
= decl_namespace_context (new_friend
);
4477 push_nested_namespace (ns
);
4478 old_decl
= pushdecl_namespace_level (new_friend
);
4479 pop_nested_namespace (ns
);
4481 if (old_decl
!= new_friend
)
4483 /* This new friend declaration matched an existing
4484 declaration. For example, given:
4486 template <class T> void f(T);
4487 template <class U> class C {
4488 template <class T> friend void f(T) {}
4491 the friend declaration actually provides the definition
4492 of `f', once C has been instantiated for some type. So,
4493 old_decl will be the out-of-class template declaration,
4494 while new_friend is the in-class definition.
4496 But, if `f' was called before this point, the
4497 instantiation of `f' will have DECL_TI_ARGS corresponding
4498 to `T' but not to `U', references to which might appear
4499 in the definition of `f'. Previously, the most general
4500 template for an instantiation of `f' was the out-of-class
4501 version; now it is the in-class version. Therefore, we
4502 run through all specialization of `f', adding to their
4503 DECL_TI_ARGS appropriately. In particular, they need a
4504 new set of outer arguments, corresponding to the
4505 arguments for this class instantiation.
4507 The same situation can arise with something like this:
4510 template <class T> class C {
4514 when `C<int>' is instantiated. Now, `f(int)' is defined
4517 if (!new_friend_is_defn
)
4518 /* On the other hand, if the in-class declaration does
4519 *not* provide a definition, then we don't want to alter
4520 existing definitions. We can just leave everything
4525 /* Overwrite whatever template info was there before, if
4526 any, with the new template information pertaining to
4528 DECL_TEMPLATE_INFO (old_decl
) = new_friend_template_info
;
4530 if (TREE_CODE (old_decl
) != TEMPLATE_DECL
)
4531 /* duplicate_decls will take care of this case. */
4536 tree new_friend_args
;
4538 DECL_TEMPLATE_INFO (DECL_RESULT (old_decl
))
4539 = new_friend_result_template_info
;
4541 new_friend_args
= TI_ARGS (new_friend_template_info
);
4542 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (old_decl
);
4546 tree spec
= TREE_VALUE (t
);
4549 = add_outermost_template_args (new_friend_args
,
4550 DECL_TI_ARGS (spec
));
4553 /* Now, since specializations are always supposed to
4554 hang off of the most general template, we must move
4556 t
= most_general_template (old_decl
);
4559 DECL_TEMPLATE_SPECIALIZATIONS (t
)
4560 = chainon (DECL_TEMPLATE_SPECIALIZATIONS (t
),
4561 DECL_TEMPLATE_SPECIALIZATIONS (old_decl
));
4562 DECL_TEMPLATE_SPECIALIZATIONS (old_decl
) = NULL_TREE
;
4567 /* The information from NEW_FRIEND has been merged into OLD_DECL
4568 by duplicate_decls. */
4569 new_friend
= old_decl
;
4572 else if (TYPE_SIZE (DECL_CONTEXT (new_friend
)))
4574 /* Check to see that the declaration is really present, and,
4575 possibly obtain an improved declaration. */
4576 tree fn
= check_classfn (DECL_CONTEXT (new_friend
),
4585 input_filename
= file
;
4589 /* FRIEND_TMPL is a friend TEMPLATE_DECL. ARGS is the vector of
4590 template arguments, as for tsubst.
4592 Returns an appropriate tsbust'd friend type. */
4595 tsubst_friend_class (friend_tmpl
, args
)
4602 /* First, we look for a class template. */
4603 tmpl
= lookup_name (DECL_NAME (friend_tmpl
), /*prefer_type=*/0);
4605 /* But, if we don't find one, it might be because we're in a
4606 situation like this:
4614 Here, in the scope of (say) S<int>, `S' is bound to a TYPE_DECL
4615 for `S<int>', not the TEMPLATE_DECL. */
4616 if (!tmpl
|| !DECL_CLASS_TEMPLATE_P (tmpl
))
4618 tmpl
= lookup_name (DECL_NAME (friend_tmpl
), /*prefer_type=*/1);
4619 tmpl
= maybe_get_template_decl_from_type_decl (tmpl
);
4622 if (tmpl
&& DECL_CLASS_TEMPLATE_P (tmpl
))
4624 /* The friend template has already been declared. Just
4625 check to see that the declarations match, and install any new
4626 default parameters. We must tsubst the default parameters,
4627 of course. We only need the innermost template parameters
4628 because that is all that redeclare_class_template will look
4631 = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_tmpl
),
4632 args
, /*complain=*/1);
4633 redeclare_class_template (TREE_TYPE (tmpl
), parms
);
4634 friend_type
= TREE_TYPE (tmpl
);
4638 /* The friend template has not already been declared. In this
4639 case, the instantiation of the template class will cause the
4640 injection of this template into the global scope. */
4641 tmpl
= tsubst (friend_tmpl
, args
, /*complain=*/1, NULL_TREE
);
4643 /* The new TMPL is not an instantiation of anything, so we
4644 forget its origins. We don't reset CLASSTYPE_TI_TEMPLATE for
4645 the new type because that is supposed to be the corresponding
4646 template decl, i.e., TMPL. */
4647 DECL_USE_TEMPLATE (tmpl
) = 0;
4648 DECL_TEMPLATE_INFO (tmpl
) = NULL_TREE
;
4649 CLASSTYPE_USE_TEMPLATE (TREE_TYPE (tmpl
)) = 0;
4651 /* Inject this template into the global scope. */
4652 friend_type
= TREE_TYPE (pushdecl_top_level (tmpl
));
4659 instantiate_class_template (type
)
4662 tree
template, args
, pattern
, t
;
4665 if (type
== error_mark_node
)
4666 return error_mark_node
;
4668 if (TYPE_BEING_DEFINED (type
) || TYPE_SIZE (type
))
4671 /* Figure out which template is being instantiated. */
4672 template = most_general_template (CLASSTYPE_TI_TEMPLATE (type
));
4673 my_friendly_assert (TREE_CODE (template) == TEMPLATE_DECL
, 279);
4675 /* Figure out which arguments are being used to do the
4677 args
= CLASSTYPE_TI_ARGS (type
);
4678 PARTIAL_INSTANTIATION_P (type
) = uses_template_parms (args
);
4680 if (pedantic
&& PARTIAL_INSTANTIATION_P (type
))
4681 /* If this is a partial instantiation, then we can't instantiate
4682 the type; there's no telling whether or not one of the
4683 template parameters might eventually be instantiated to some
4684 value that results in a specialization being used. For
4696 Now, the `S<U>' in `f<int>' is the specialization, not an
4697 instantiation of the original template. */
4700 /* Determine what specialization of the original template to
4702 if (PARTIAL_INSTANTIATION_P (type
))
4703 /* There's no telling which specialization is appropriate at this
4704 point. Since all peeking at the innards of this partial
4705 instantiation are extensions (like the "implicit typename"
4706 extension, which allows users to omit the keyword `typename' on
4707 names that are declared as types in template base classes), we
4708 are free to do what we please.
4710 Trying to figure out which partial instantiation to use can
4711 cause a crash. (Some of the template arguments don't even have
4712 types.) So, we just use the most general version. */
4716 t
= most_specialized_class (template, args
);
4718 if (t
== error_mark_node
)
4720 const char *str
= "candidates are:";
4721 cp_error ("ambiguous class template instantiation for `%#T'", type
);
4722 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (template); t
;
4725 if (get_class_bindings (TREE_VALUE (t
), TREE_PURPOSE (t
),
4728 cp_error_at ("%s %+#T", str
, TREE_TYPE (t
));
4732 TYPE_BEING_DEFINED (type
) = 1;
4733 return error_mark_node
;
4738 pattern
= TREE_TYPE (t
);
4740 pattern
= TREE_TYPE (template);
4742 /* If the template we're instantiating is incomplete, then clearly
4743 there's nothing we can do. */
4744 if (TYPE_SIZE (pattern
) == NULL_TREE
)
4747 /* If this is a partial instantiation, don't tsubst anything. We will
4748 only use this type for implicit typename, so the actual contents don't
4749 matter. All that matters is whether a particular name is a type. */
4750 if (PARTIAL_INSTANTIATION_P (type
))
4752 /* The fields set here must be kept in sync with those cleared
4753 in begin_class_definition. */
4754 TYPE_BINFO_BASETYPES (type
) = TYPE_BINFO_BASETYPES (pattern
);
4755 TYPE_FIELDS (type
) = TYPE_FIELDS (pattern
);
4756 TYPE_METHODS (type
) = TYPE_METHODS (pattern
);
4757 CLASSTYPE_TAGS (type
) = CLASSTYPE_TAGS (pattern
);
4758 /* Pretend that the type is complete, so that we will look
4759 inside it during name lookup and such. */
4760 TYPE_SIZE (type
) = integer_zero_node
;
4764 /* If we've recursively instantiated too many templates, stop. */
4765 if (! push_tinst_level (type
))
4768 /* Now we're really doing the instantiation. Mark the type as in
4769 the process of being defined. */
4770 TYPE_BEING_DEFINED (type
) = 1;
4772 maybe_push_to_top_level (uses_template_parms (type
));
4776 /* This TYPE is actually a instantiation of of a partial
4777 specialization. We replace the innermost set of ARGS with
4778 the arguments appropriate for substitution. For example,
4781 template <class T> struct S {};
4782 template <class T> struct S<T*> {};
4784 and supposing that we are instantiating S<int*>, ARGS will
4785 present be {int*} but we need {int}. */
4787 = get_class_bindings (TREE_VALUE (t
), TREE_PURPOSE (t
),
4790 /* If there were multiple levels in ARGS, replacing the
4791 innermost level would alter CLASSTYPE_TI_ARGS, which we don't
4792 want, so we make a copy first. */
4793 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
4795 args
= copy_node (args
);
4796 SET_TMPL_ARGS_LEVEL (args
, TMPL_ARGS_DEPTH (args
), inner_args
);
4802 if (flag_external_templates
)
4804 if (flag_alt_external_templates
)
4806 CLASSTYPE_INTERFACE_ONLY (type
) = interface_only
;
4807 SET_CLASSTYPE_INTERFACE_UNKNOWN_X (type
, interface_unknown
);
4808 CLASSTYPE_VTABLE_NEEDS_WRITING (type
)
4809 = (! CLASSTYPE_INTERFACE_ONLY (type
)
4810 && CLASSTYPE_INTERFACE_KNOWN (type
));
4814 CLASSTYPE_INTERFACE_ONLY (type
) = CLASSTYPE_INTERFACE_ONLY (pattern
);
4815 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
4816 (type
, CLASSTYPE_INTERFACE_UNKNOWN (pattern
));
4817 CLASSTYPE_VTABLE_NEEDS_WRITING (type
)
4818 = (! CLASSTYPE_INTERFACE_ONLY (type
)
4819 && CLASSTYPE_INTERFACE_KNOWN (type
));
4824 SET_CLASSTYPE_INTERFACE_UNKNOWN (type
);
4825 CLASSTYPE_VTABLE_NEEDS_WRITING (type
) = 1;
4828 TYPE_HAS_CONSTRUCTOR (type
) = TYPE_HAS_CONSTRUCTOR (pattern
);
4829 TYPE_HAS_DESTRUCTOR (type
) = TYPE_HAS_DESTRUCTOR (pattern
);
4830 TYPE_OVERLOADS_CALL_EXPR (type
) = TYPE_OVERLOADS_CALL_EXPR (pattern
);
4831 TYPE_OVERLOADS_ARRAY_REF (type
) = TYPE_OVERLOADS_ARRAY_REF (pattern
);
4832 TYPE_OVERLOADS_ARROW (type
) = TYPE_OVERLOADS_ARROW (pattern
);
4833 TYPE_GETS_NEW (type
) = TYPE_GETS_NEW (pattern
);
4834 TYPE_GETS_DELETE (type
) = TYPE_GETS_DELETE (pattern
);
4835 TYPE_VEC_DELETE_TAKES_SIZE (type
) = TYPE_VEC_DELETE_TAKES_SIZE (pattern
);
4836 TYPE_HAS_ASSIGN_REF (type
) = TYPE_HAS_ASSIGN_REF (pattern
);
4837 TYPE_HAS_CONST_ASSIGN_REF (type
) = TYPE_HAS_CONST_ASSIGN_REF (pattern
);
4838 TYPE_HAS_ABSTRACT_ASSIGN_REF (type
) = TYPE_HAS_ABSTRACT_ASSIGN_REF (pattern
);
4839 TYPE_HAS_INIT_REF (type
) = TYPE_HAS_INIT_REF (pattern
);
4840 TYPE_HAS_CONST_INIT_REF (type
) = TYPE_HAS_CONST_INIT_REF (pattern
);
4841 TYPE_HAS_DEFAULT_CONSTRUCTOR (type
) = TYPE_HAS_DEFAULT_CONSTRUCTOR (pattern
);
4842 TYPE_HAS_CONVERSION (type
) = TYPE_HAS_CONVERSION (pattern
);
4843 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (type
)
4844 = TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (pattern
);
4845 TYPE_USES_MULTIPLE_INHERITANCE (type
)
4846 = TYPE_USES_MULTIPLE_INHERITANCE (pattern
);
4847 TYPE_USES_VIRTUAL_BASECLASSES (type
)
4848 = TYPE_USES_VIRTUAL_BASECLASSES (pattern
);
4849 TYPE_PACKED (type
) = TYPE_PACKED (pattern
);
4850 TYPE_ALIGN (type
) = TYPE_ALIGN (pattern
);
4851 TYPE_FOR_JAVA (type
) = TYPE_FOR_JAVA (pattern
); /* For libjava's JArray<T> */
4852 if (ANON_AGGR_TYPE_P (pattern
))
4853 SET_ANON_AGGR_TYPE_P (type
);
4855 if (TYPE_BINFO_BASETYPES (pattern
))
4857 tree base_list
= NULL_TREE
;
4858 tree pbases
= TYPE_BINFO_BASETYPES (pattern
);
4861 /* Substitute into each of the bases to determine the actual
4863 for (i
= 0; i
< TREE_VEC_LENGTH (pbases
); ++i
)
4869 pbase
= TREE_VEC_ELT (pbases
, i
);
4871 /* Substitue to figure out the base class. */
4872 base
= tsubst (BINFO_TYPE (pbase
), args
,
4873 /*complain=*/1, NULL_TREE
);
4874 if (base
== error_mark_node
)
4877 /* Calculate the correct access node. */
4878 if (TREE_VIA_VIRTUAL (pbase
))
4880 if (TREE_VIA_PUBLIC (pbase
))
4881 access
= access_public_virtual_node
;
4882 else if (TREE_VIA_PROTECTED (pbase
))
4883 access
= access_protected_virtual_node
;
4885 access
= access_private_virtual_node
;
4889 if (TREE_VIA_PUBLIC (pbase
))
4890 access
= access_public_node
;
4891 else if (TREE_VIA_PROTECTED (pbase
))
4892 access
= access_protected_node
;
4894 access
= access_private_node
;
4897 base_list
= tree_cons (access
, base
, base_list
);
4900 /* The list is now in reverse order; correct that. */
4901 base_list
= nreverse (base_list
);
4903 /* Now call xref_basetypes to set up all the base-class
4905 xref_basetypes (TREE_CODE (pattern
) == RECORD_TYPE
4906 ? (CLASSTYPE_DECLARED_CLASS (pattern
)
4907 ? class_type_node
: record_type_node
)
4909 DECL_NAME (TYPE_NAME (pattern
)),
4914 /* Now that our base classes are set up, enter the scope of the
4915 class, so that name lookups into base classes, etc. will work
4916 corectly. This is precisely analagous to what we do in
4917 begin_class_definition when defining an ordinary non-template
4919 pushclass (type
, 1);
4921 for (t
= CLASSTYPE_TAGS (pattern
); t
; t
= TREE_CHAIN (t
))
4923 tree tag
= TREE_VALUE (t
);
4924 tree name
= TYPE_IDENTIFIER (tag
);
4927 newtag
= tsubst (tag
, args
, /*complain=*/1, NULL_TREE
);
4928 if (TREE_CODE (newtag
) != ENUMERAL_TYPE
)
4930 if (TYPE_LANG_SPECIFIC (tag
) && CLASSTYPE_IS_TEMPLATE (tag
))
4931 /* Unfortunately, lookup_template_class sets
4932 CLASSTYPE_IMPLICIT_INSTANTIATION for a partial
4933 instantiation (i.e., for the type of a member template
4934 class nested within a template class.) This behavior is
4935 required for maybe_process_partial_specialization to work
4936 correctly, but is not accurate in this case; the TAG is not
4937 an instantiation of anything. (The corresponding
4938 TEMPLATE_DECL is an instantiation, but the TYPE is not.) */
4939 CLASSTYPE_USE_TEMPLATE (newtag
) = 0;
4941 /* Now, we call pushtag to put this NEWTAG into the scope of
4942 TYPE. We first set up the IDENTIFIER_TYPE_VALUE to avoid
4943 pushtag calling push_template_decl. We don't have to do
4944 this for enums because it will already have been done in
4947 SET_IDENTIFIER_TYPE_VALUE (name
, newtag
);
4948 pushtag (name
, newtag
, /*globalize=*/0);
4952 /* Don't replace enum constants here. */
4953 for (t
= TYPE_FIELDS (pattern
); t
; t
= TREE_CHAIN (t
))
4954 if (TREE_CODE (t
) != CONST_DECL
)
4958 /* The the file and line for this declaration, to assist in
4959 error message reporting. Since we called push_tinst_level
4960 above, we don't need to restore these. */
4961 lineno
= DECL_SOURCE_LINE (t
);
4962 input_filename
= DECL_SOURCE_FILE (t
);
4964 r
= tsubst (t
, args
, /*complain=*/1, NULL_TREE
);
4965 if (TREE_CODE (r
) == VAR_DECL
)
4969 if (DECL_DEFINED_IN_CLASS_P (r
))
4970 init
= tsubst_expr (DECL_INITIAL (t
), args
,
4971 /*complain=*/1, NULL_TREE
);
4975 finish_static_data_member_decl (r
, init
,
4976 /*asmspec_tree=*/NULL_TREE
,
4979 if (DECL_DEFINED_IN_CLASS_P (r
))
4980 check_static_variable_definition (r
, TREE_TYPE (r
));
4983 /* R will have a TREE_CHAIN if and only if it has already been
4984 processed by finish_member_declaration. This can happen
4985 if, for example, it is a TYPE_DECL for a class-scoped
4986 ENUMERAL_TYPE; such a thing will already have been added to
4987 the field list by tsubst_enum above. */
4988 if (!TREE_CHAIN (r
))
4990 set_current_access_from_decl (r
);
4991 finish_member_declaration (r
);
4995 /* Set up the list (TYPE_METHODS) and vector (CLASSTYPE_METHOD_VEC)
4996 for this instantiation. */
4997 for (t
= TYPE_METHODS (pattern
); t
; t
= TREE_CHAIN (t
))
4999 tree r
= tsubst (t
, args
, /*complain=*/1, NULL_TREE
);
5000 set_current_access_from_decl (r
);
5001 finish_member_declaration (r
);
5004 /* Construct the DECL_FRIENDLIST for the new class type. */
5005 typedecl
= TYPE_MAIN_DECL (type
);
5006 for (t
= DECL_FRIENDLIST (TYPE_MAIN_DECL (pattern
));
5012 for (friends
= TREE_VALUE (t
);
5013 friends
!= NULL_TREE
;
5014 friends
= TREE_CHAIN (friends
))
5015 if (TREE_PURPOSE (friends
) == error_mark_node
)
5017 tsubst_friend_function (TREE_VALUE (friends
),
5020 my_friendly_abort (20000216);
5023 for (t
= CLASSTYPE_FRIEND_CLASSES (pattern
);
5027 tree friend_type
= TREE_VALUE (t
);
5028 tree new_friend_type
;
5030 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
5031 new_friend_type
= tsubst_friend_class (friend_type
, args
);
5032 else if (uses_template_parms (friend_type
))
5033 new_friend_type
= tsubst (friend_type
, args
, /*complain=*/1,
5037 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (friend_type
));
5039 /* The call to xref_tag_from_type does injection for friend
5041 push_nested_namespace (ns
);
5043 xref_tag_from_type (friend_type
, NULL_TREE
, 1);
5044 pop_nested_namespace (ns
);
5047 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
5048 /* Trick make_friend_class into realizing that the friend
5049 we're adding is a template, not an ordinary class. It's
5050 important that we use make_friend_class since it will
5051 perform some error-checking and output cross-reference
5053 ++processing_template_decl
;
5055 make_friend_class (type
, new_friend_type
);
5057 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
5058 --processing_template_decl
;
5061 for (t
= TYPE_FIELDS (type
); t
; t
= TREE_CHAIN (t
))
5062 if (TREE_CODE (t
) == FIELD_DECL
)
5064 TREE_TYPE (t
) = complete_type (TREE_TYPE (t
));
5065 require_complete_type (t
);
5068 /* Set the file and line number information to whatever is given for
5069 the class itself. This puts error messages involving generated
5070 implicit functions at a predictable point, and the same point
5071 that would be used for non-template classes. */
5072 lineno
= DECL_SOURCE_LINE (typedecl
);
5073 input_filename
= DECL_SOURCE_FILE (typedecl
);
5075 unreverse_member_declarations (type
);
5076 finish_struct_1 (type
);
5077 CLASSTYPE_GOT_SEMICOLON (type
) = 1;
5079 /* Clear this now so repo_template_used is happy. */
5080 TYPE_BEING_DEFINED (type
) = 0;
5081 repo_template_used (type
);
5083 /* Now that the class is complete, instantiate default arguments for
5084 any member functions. We don't do this earlier because the
5085 default arguments may reference members of the class. */
5086 if (!PRIMARY_TEMPLATE_P (template))
5087 for (t
= TYPE_METHODS (type
); t
; t
= TREE_CHAIN (t
))
5088 if (TREE_CODE (t
) == FUNCTION_DECL
5089 /* Implicitly generated member functions will not have tmplate
5090 information; they are not instantiations, but instead are
5091 created "fresh" for each instantiation. */
5092 && DECL_TEMPLATE_INFO (t
))
5093 tsubst_default_arguments (t
);
5096 pop_from_top_level ();
5106 if (t1
== NULL_TREE
)
5107 return t2
== NULL_TREE
;
5108 if (t2
== NULL_TREE
)
5110 /* Don't care if one declares its arg const and the other doesn't -- the
5111 main variant of the arg type is all that matters. */
5112 if (TYPE_MAIN_VARIANT (TREE_VALUE (t1
))
5113 != TYPE_MAIN_VARIANT (TREE_VALUE (t2
)))
5115 return list_eq (TREE_CHAIN (t1
), TREE_CHAIN (t2
));
5118 /* If arg is a non-type template parameter that does not depend on template
5119 arguments, fold it like we weren't in the body of a template. */
5122 maybe_fold_nontype_arg (arg
)
5125 /* If we're not in a template, ARG is already as simple as it's going to
5126 get, and trying to reprocess the trees will break. */
5127 if (! processing_template_decl
)
5130 if (TREE_CODE_CLASS (TREE_CODE (arg
)) != 't'
5131 && !uses_template_parms (arg
))
5133 /* Sometimes, one of the args was an expression involving a
5134 template constant parameter, like N - 1. Now that we've
5135 tsubst'd, we might have something like 2 - 1. This will
5136 confuse lookup_template_class, so we do constant folding
5137 here. We have to unset processing_template_decl, to
5138 fool build_expr_from_tree() into building an actual
5141 int saved_processing_template_decl
= processing_template_decl
;
5142 processing_template_decl
= 0;
5143 arg
= fold (build_expr_from_tree (arg
));
5144 processing_template_decl
= saved_processing_template_decl
;
5149 /* Return the TREE_VEC with the arguments for the innermost template header,
5150 where ARGS is either that or the VEC of VECs for all the
5154 innermost_args (args
)
5157 return TMPL_ARGS_LEVEL (args
, TMPL_ARGS_DEPTH (args
));
5160 /* Substitute ARGS into the vector of template arguments T. */
5163 tsubst_template_arg_vector (t
, args
, complain
)
5168 int len
= TREE_VEC_LENGTH (t
), need_new
= 0, i
;
5169 tree
*elts
= (tree
*) alloca (len
* sizeof (tree
));
5171 bzero ((char *) elts
, len
* sizeof (tree
));
5173 for (i
= 0; i
< len
; i
++)
5175 if (TREE_VEC_ELT (t
, i
) != NULL_TREE
5176 && TREE_CODE (TREE_VEC_ELT (t
, i
)) == TREE_VEC
)
5177 elts
[i
] = tsubst_template_arg_vector (TREE_VEC_ELT (t
, i
),
5180 elts
[i
] = maybe_fold_nontype_arg
5181 (tsubst_expr (TREE_VEC_ELT (t
, i
), args
, complain
,
5184 if (elts
[i
] != TREE_VEC_ELT (t
, i
))
5191 t
= make_tree_vec (len
);
5192 for (i
= 0; i
< len
; i
++)
5193 TREE_VEC_ELT (t
, i
) = elts
[i
];
5198 /* Return the result of substituting ARGS into the template parameters
5199 given by PARMS. If there are m levels of ARGS and m + n levels of
5200 PARMS, then the result will contain n levels of PARMS. For
5201 example, if PARMS is `template <class T> template <class U>
5202 template <T*, U, class V>' and ARGS is {{int}, {double}} then the
5203 result will be `template <int*, double, class V>'. */
5206 tsubst_template_parms (parms
, args
, complain
)
5214 for (new_parms
= &r
;
5215 TMPL_PARMS_DEPTH (parms
) > TMPL_ARGS_DEPTH (args
);
5216 new_parms
= &(TREE_CHAIN (*new_parms
)),
5217 parms
= TREE_CHAIN (parms
))
5220 make_tree_vec (TREE_VEC_LENGTH (TREE_VALUE (parms
)));
5223 for (i
= 0; i
< TREE_VEC_LENGTH (new_vec
); ++i
)
5225 tree default_value
=
5226 TREE_PURPOSE (TREE_VEC_ELT (TREE_VALUE (parms
), i
));
5228 TREE_VALUE (TREE_VEC_ELT (TREE_VALUE (parms
), i
));
5230 TREE_VEC_ELT (new_vec
, i
)
5231 = build_tree_list (tsubst (default_value
, args
, complain
,
5233 tsubst (parm_decl
, args
, complain
,
5238 tree_cons (build_int_2 (0, (TMPL_PARMS_DEPTH (parms
)
5239 - TMPL_ARGS_DEPTH (args
))),
5240 new_vec
, NULL_TREE
);
5246 /* Substitute the ARGS into the indicated aggregate (or enumeration)
5247 type T. If T is not an aggregate or enumeration type, it is
5248 handled as if by tsubst. IN_DECL is as for tsubst. If
5249 ENTERING_SCOPE is non-zero, T is the context for a template which
5250 we are presently tsubst'ing. Return the subsituted value. */
5253 tsubst_aggr_type (t
, args
, complain
, in_decl
, entering_scope
)
5263 switch (TREE_CODE (t
))
5266 if (TYPE_PTRMEMFUNC_P (t
))
5268 tree r
= build_ptrmemfunc_type
5269 (tsubst (TYPE_PTRMEMFUNC_FN_TYPE (t
), args
, complain
, in_decl
));
5270 return cp_build_qualified_type_real (r
, TYPE_QUALS (t
),
5274 /* else fall through */
5277 if (TYPE_TEMPLATE_INFO (t
))
5283 /* First, determine the context for the type we are looking
5285 if (TYPE_CONTEXT (t
) != NULL_TREE
)
5286 context
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
,
5288 in_decl
, /*entering_scope=*/1);
5290 context
= NULL_TREE
;
5292 /* Then, figure out what arguments are appropriate for the
5293 type we are trying to find. For example, given:
5295 template <class T> struct S;
5296 template <class T, class U> void f(T, U) { S<U> su; }
5298 and supposing that we are instantiating f<int, double>,
5299 then our ARGS will be {int, double}, but, when looking up
5300 S we only want {double}. */
5301 argvec
= tsubst_template_arg_vector (TYPE_TI_ARGS (t
), args
,
5304 r
= lookup_template_class (t
, argvec
, in_decl
, context
,
5307 return cp_build_qualified_type_real (r
, TYPE_QUALS (t
),
5311 /* This is not a template type, so there's nothing to do. */
5315 return tsubst (t
, args
, complain
, in_decl
);
5319 /* Substitute into the default argument ARG (a default argument for
5320 FN), which has the indicated TYPE. */
5323 tsubst_default_argument (fn
, type
, arg
)
5328 /* This default argument came from a template. Instantiate the
5329 default argument here, not in tsubst. In the case of
5338 we must be careful to do name lookup in the scope of S<T>,
5339 rather than in the current class. */
5340 if (DECL_CLASS_SCOPE_P (fn
))
5341 pushclass (DECL_CONTEXT (fn
), 2);
5343 arg
= tsubst_expr (arg
, DECL_TI_ARGS (fn
), /*complain=*/1, NULL_TREE
);
5345 if (DECL_CLASS_SCOPE_P (fn
))
5348 /* Make sure the default argument is reasonable. */
5349 arg
= check_default_argument (type
, arg
);
5354 /* Substitute into all the default arguments for FN. */
5357 tsubst_default_arguments (fn
)
5363 tmpl_args
= DECL_TI_ARGS (fn
);
5365 /* If this function is not yet instantiated, we certainly don't need
5366 its default arguments. */
5367 if (uses_template_parms (tmpl_args
))
5370 for (arg
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
5372 arg
= TREE_CHAIN (arg
))
5373 if (TREE_PURPOSE (arg
))
5374 TREE_PURPOSE (arg
) = tsubst_default_argument (fn
,
5376 TREE_PURPOSE (arg
));
5379 /* Substitute the ARGS into the T, which is a _DECL. TYPE is the
5380 (already computed) substitution of ARGS into TREE_TYPE (T), if
5381 appropriate. Return the result of the substitution. IN_DECL is as
5385 tsubst_decl (t
, args
, type
, in_decl
)
5392 char* saved_filename
;
5395 /* Set the filename and linenumber to improve error-reporting. */
5396 saved_lineno
= lineno
;
5397 saved_filename
= input_filename
;
5398 lineno
= DECL_SOURCE_LINE (t
);
5399 input_filename
= DECL_SOURCE_FILE (t
);
5401 switch (TREE_CODE (t
))
5405 /* We can get here when processing a member template function
5406 of a template class. */
5407 tree decl
= DECL_TEMPLATE_RESULT (t
);
5409 int is_template_template_parm
= DECL_TEMPLATE_TEMPLATE_PARM_P (t
);
5411 if (!is_template_template_parm
)
5413 /* We might already have an instance of this template.
5414 The ARGS are for the surrounding class type, so the
5415 full args contain the tsubst'd args for the context,
5416 plus the innermost args from the template decl. */
5417 tree tmpl_args
= DECL_CLASS_TEMPLATE_P (t
)
5418 ? CLASSTYPE_TI_ARGS (TREE_TYPE (t
))
5419 : DECL_TI_ARGS (DECL_RESULT (t
));
5422 full_args
= tsubst_template_arg_vector (tmpl_args
, args
,
5425 /* tsubst_template_arg_vector doesn't copy the vector if
5426 nothing changed. But, *something* should have
5428 my_friendly_assert (full_args
!= tmpl_args
, 0);
5430 spec
= retrieve_specialization (t
, full_args
);
5431 if (spec
!= NULL_TREE
)
5438 /* Make a new template decl. It will be similar to the
5439 original, but will record the current template arguments.
5440 We also create a new function declaration, which is just
5441 like the old one, but points to this new template, rather
5442 than the old one. */
5445 my_friendly_assert (DECL_LANG_SPECIFIC (r
) != 0, 0);
5446 TREE_CHAIN (r
) = NULL_TREE
;
5448 if (is_template_template_parm
)
5450 tree new_decl
= tsubst (decl
, args
, /*complain=*/1, in_decl
);
5451 DECL_RESULT (r
) = new_decl
;
5452 TREE_TYPE (r
) = TREE_TYPE (new_decl
);
5457 = tsubst_aggr_type (DECL_CONTEXT (t
), args
,
5458 /*complain=*/1, in_decl
,
5459 /*entering_scope=*/1);
5460 DECL_VIRTUAL_CONTEXT (r
)
5461 = tsubst_aggr_type (DECL_VIRTUAL_CONTEXT (t
), args
,
5462 /*complain=*/1, in_decl
,
5463 /*entering_scope=*/1);
5464 DECL_TEMPLATE_INFO (r
) = build_tree_list (t
, args
);
5466 if (TREE_CODE (decl
) == TYPE_DECL
)
5468 tree new_type
= tsubst (TREE_TYPE (t
), args
,
5469 /*complain=*/1, in_decl
);
5470 TREE_TYPE (r
) = new_type
;
5471 CLASSTYPE_TI_TEMPLATE (new_type
) = r
;
5472 DECL_RESULT (r
) = TYPE_MAIN_DECL (new_type
);
5473 DECL_TI_ARGS (r
) = CLASSTYPE_TI_ARGS (new_type
);
5477 tree new_decl
= tsubst (decl
, args
, /*complain=*/1, in_decl
);
5478 DECL_RESULT (r
) = new_decl
;
5479 DECL_TI_TEMPLATE (new_decl
) = r
;
5480 TREE_TYPE (r
) = TREE_TYPE (new_decl
);
5481 DECL_TI_ARGS (r
) = DECL_TI_ARGS (new_decl
);
5484 SET_DECL_IMPLICIT_INSTANTIATION (r
);
5485 DECL_TEMPLATE_INSTANTIATIONS (r
) = NULL_TREE
;
5486 DECL_TEMPLATE_SPECIALIZATIONS (r
) = NULL_TREE
;
5488 /* The template parameters for this new template are all the
5489 template parameters for the old template, except the
5490 outermost level of parameters. */
5491 DECL_TEMPLATE_PARMS (r
)
5492 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t
), args
,
5495 if (PRIMARY_TEMPLATE_P (t
))
5496 DECL_PRIMARY_TEMPLATE (r
) = r
;
5498 /* We don't partially instantiate partial specializations. */
5499 if (TREE_CODE (decl
) == TYPE_DECL
)
5502 for (spec
= DECL_TEMPLATE_SPECIALIZATIONS (t
);
5504 spec
= TREE_CHAIN (spec
))
5506 /* It helps to consider example here. Consider:
5517 Now, for example, we are instantiating S<int>::f(U u).
5518 We want to make a template:
5523 It will have a specialization, for the case U = int*, of
5527 void S<int>::f<int*>(int*);
5529 This specialization will be an instantiation of
5530 the specialization given in the declaration of S, with
5531 argument list int*. */
5533 tree fn
= TREE_VALUE (spec
);
5537 if (!DECL_TEMPLATE_SPECIALIZATION (fn
))
5538 /* Instantiations are on the same list, but they're of
5539 no concern to us. */
5542 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
5543 /* A full specialization. There's no need to record
5547 spec_args
= tsubst (DECL_TI_ARGS (fn
), args
,
5548 /*complain=*/1, in_decl
);
5549 new_fn
= tsubst (DECL_RESULT (most_general_template (fn
)),
5550 spec_args
, /*complain=*/1, in_decl
);
5551 DECL_TI_TEMPLATE (new_fn
) = fn
;
5552 register_specialization (new_fn
, r
,
5553 innermost_args (spec_args
));
5556 /* Record this partial instantiation. */
5557 register_specialization (r
, t
,
5558 DECL_TI_ARGS (DECL_RESULT (r
)));
5566 tree argvec
= NULL_TREE
;
5573 /* Nobody should be tsubst'ing into non-template functions. */
5574 my_friendly_assert (DECL_TEMPLATE_INFO (t
) != NULL_TREE
, 0);
5576 if (TREE_CODE (DECL_TI_TEMPLATE (t
)) == TEMPLATE_DECL
)
5580 /* Calculate the most general template of which R is a
5581 specialization, and the complete set of arguments used to
5583 gen_tmpl
= most_general_template (DECL_TI_TEMPLATE (t
));
5585 = tsubst_template_arg_vector (DECL_TI_ARGS
5586 (DECL_TEMPLATE_RESULT (gen_tmpl
)),
5587 args
, /*complain=*/1);
5589 /* Check to see if we already have this specialization. */
5590 spec
= retrieve_specialization (gen_tmpl
, argvec
);
5598 /* Here, we deal with the peculiar case:
5600 template <class T> struct S {
5601 template <class U> friend void f();
5603 template <class U> friend void f() {}
5605 template void f<double>();
5607 Here, the ARGS for the instantiation of will be {int,
5608 double}. But, we only need as many ARGS as there are
5609 levels of template parameters in CODE_PATTERN. We are
5610 careful not to get fooled into reducing the ARGS in
5613 template <class T> struct S { template <class U> void f(U); }
5614 template <class T> template <> void S<T>::f(int) {}
5616 which we can spot because the pattern will be a
5617 specialization in this case. */
5618 args_depth
= TMPL_ARGS_DEPTH (args
);
5620 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (t
)));
5621 if (args_depth
> parms_depth
5622 && !DECL_TEMPLATE_SPECIALIZATION (t
))
5624 my_friendly_assert (DECL_FRIEND_P (t
), 0);
5626 if (parms_depth
> 1)
5630 args
= make_tree_vec (parms_depth
);
5631 for (i
= 0; i
< parms_depth
; ++i
)
5632 TREE_VEC_ELT (args
, i
) =
5633 TREE_VEC_ELT (args
, i
+ (args_depth
- parms_depth
));
5636 args
= TREE_VEC_ELT (args
, args_depth
- parms_depth
);
5641 /* This special case arises when we have something like this:
5643 template <class T> struct S {
5644 friend void f<int>(int, double);
5647 Here, the DECL_TI_TEMPLATE for the friend declaration
5648 will be a LOOKUP_EXPR or an IDENTIFIER_NODE. We are
5649 being called from tsubst_friend_function, and we want
5650 only to create a new decl (R) with appropriate types so
5651 that we can call determine_specialization. */
5652 my_friendly_assert ((TREE_CODE (DECL_TI_TEMPLATE (t
))
5654 || (TREE_CODE (DECL_TI_TEMPLATE (t
))
5655 == IDENTIFIER_NODE
), 0);
5656 gen_tmpl
= NULL_TREE
;
5659 if (DECL_CLASS_SCOPE_P (t
))
5661 if (DECL_NAME (t
) == constructor_name (DECL_CONTEXT (t
)))
5665 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
,
5667 /*entering_scope=*/1);
5672 ctx
= DECL_CONTEXT (t
);
5674 type
= tsubst (type
, args
, /*complain=*/1, in_decl
);
5675 if (type
== error_mark_node
)
5676 return error_mark_node
;
5678 /* We do NOT check for matching decls pushed separately at this
5679 point, as they may not represent instantiations of this
5680 template, and in any case are considered separate under the
5681 discrete model. Instead, see add_maybe_template. */
5685 DECL_USE_TEMPLATE (r
) = 0;
5686 TREE_TYPE (r
) = type
;
5688 DECL_CONTEXT (r
) = ctx
;
5689 DECL_VIRTUAL_CONTEXT (r
)
5690 = tsubst_aggr_type (DECL_VIRTUAL_CONTEXT (t
), args
,
5692 /*entering_scope=*/1);
5694 if (member
&& IDENTIFIER_TYPENAME_P (DECL_NAME (r
)))
5695 /* Type-conversion operator. Reconstruct the name, in
5696 case it's the name of one of the template's parameters. */
5697 DECL_NAME (r
) = build_typename_overload (TREE_TYPE (type
));
5699 DECL_ARGUMENTS (r
) = tsubst (DECL_ARGUMENTS (t
), args
,
5701 DECL_MAIN_VARIANT (r
) = r
;
5702 DECL_RESULT (r
) = NULL_TREE
;
5704 TREE_STATIC (r
) = 0;
5705 TREE_PUBLIC (r
) = TREE_PUBLIC (t
);
5706 DECL_EXTERNAL (r
) = 1;
5707 DECL_INTERFACE_KNOWN (r
) = 0;
5708 DECL_DEFER_OUTPUT (r
) = 0;
5709 TREE_CHAIN (r
) = NULL_TREE
;
5710 DECL_PENDING_INLINE_INFO (r
) = 0;
5711 DECL_PENDING_INLINE_P (r
) = 0;
5714 /* Set up the DECL_TEMPLATE_INFO for R and compute its mangled
5715 name. There's no need to do this in the special friend
5716 case mentioned above where GEN_TMPL is NULL. */
5719 DECL_TEMPLATE_INFO (r
)
5720 = tree_cons (gen_tmpl
, argvec
, NULL_TREE
);
5721 SET_DECL_IMPLICIT_INSTANTIATION (r
);
5722 register_specialization (r
, gen_tmpl
, argvec
);
5724 /* Set the mangled name for R. */
5725 if (DECL_DESTRUCTOR_P (t
))
5726 DECL_ASSEMBLER_NAME (r
) = build_destructor_name (ctx
);
5729 /* Instantiations of template functions must be mangled
5730 specially, in order to conform to 14.5.5.1
5731 [temp.over.link]. */
5732 tree tmpl
= DECL_TI_TEMPLATE (t
);
5734 /* TMPL will be NULL if this is a specialization of a
5735 member function of a template class. */
5736 if (name_mangling_version
< 1
5737 || tmpl
== NULL_TREE
5738 || (member
&& !is_member_template (tmpl
)
5739 && !DECL_TEMPLATE_INFO (tmpl
)))
5740 set_mangled_name_for_decl (r
);
5742 set_mangled_name_for_template_decl (r
);
5746 make_decl_rtl (r
, NULL_PTR
, 1);
5748 /* Like grokfndecl. If we don't do this, pushdecl will
5749 mess up our TREE_CHAIN because it doesn't find a
5750 previous decl. Sigh. */
5752 && ! uses_template_parms (r
)
5753 && (IDENTIFIER_GLOBAL_VALUE (DECL_ASSEMBLER_NAME (r
))
5755 SET_IDENTIFIER_GLOBAL_VALUE (DECL_ASSEMBLER_NAME (r
), r
);
5757 /* We're not supposed to instantiate default arguments
5758 until they are called, for a template. But, for a
5761 template <class T> void f ()
5762 { extern void g(int i = T()); }
5764 we should do the substitution when the template is
5765 instantiated. We handle the member function case in
5766 instantiate_class_template since the default arguments
5767 might refer to other members of the class. */
5769 && !PRIMARY_TEMPLATE_P (gen_tmpl
)
5770 && !uses_template_parms (argvec
))
5771 tsubst_default_arguments (r
);
5774 /* Copy the list of befriending classes. */
5775 for (friends
= &DECL_BEFRIENDING_CLASSES (r
);
5777 friends
= &TREE_CHAIN (*friends
))
5779 *friends
= copy_node (*friends
);
5780 TREE_VALUE (*friends
) = tsubst (TREE_VALUE (*friends
),
5781 args
, /*complain=*/1,
5785 if (DECL_CONSTRUCTOR_P (r
))
5787 maybe_retrofit_in_chrg (r
);
5788 grok_ctor_properties (ctx
, r
);
5790 else if (DECL_OVERLOADED_OPERATOR_P (r
))
5791 grok_op_properties (r
, DECL_VIRTUAL_P (r
), DECL_FRIEND_P (r
));
5798 TREE_TYPE (r
) = type
;
5799 c_apply_type_quals_to_decl (CP_TYPE_QUALS (type
), r
);
5801 if (TREE_CODE (DECL_INITIAL (r
)) != TEMPLATE_PARM_INDEX
)
5802 DECL_INITIAL (r
) = TREE_TYPE (r
);
5804 DECL_INITIAL (r
) = tsubst (DECL_INITIAL (r
), args
,
5805 /*complain=*/1, in_decl
);
5807 DECL_CONTEXT (r
) = NULL_TREE
;
5808 if (PROMOTE_PROTOTYPES
5809 && (TREE_CODE (type
) == INTEGER_TYPE
5810 || TREE_CODE (type
) == ENUMERAL_TYPE
)
5811 && TYPE_PRECISION (type
) < TYPE_PRECISION (integer_type_node
))
5812 DECL_ARG_TYPE (r
) = integer_type_node
;
5814 TREE_CHAIN (r
) = tsubst (TREE_CHAIN (t
), args
,
5815 /*complain=*/1, TREE_CHAIN (t
));
5823 TREE_TYPE (r
) = type
;
5824 c_apply_type_quals_to_decl (CP_TYPE_QUALS (type
), r
);
5826 /* We don't have to set DECL_CONTEXT here; it is set by
5827 finish_member_declaration. */
5828 DECL_INITIAL (r
) = tsubst_expr (DECL_INITIAL (t
), args
,
5829 /*complain=*/1, in_decl
);
5830 TREE_CHAIN (r
) = NULL_TREE
;
5831 if (TREE_CODE (type
) == VOID_TYPE
)
5832 cp_error_at ("instantiation of `%D' as type void", r
);
5840 = tsubst_copy (DECL_INITIAL (t
), args
, /*complain=*/1, in_decl
);
5841 TREE_CHAIN (r
) = NULL_TREE
;
5846 if (DECL_IMPLICIT_TYPEDEF_P (t
))
5848 /* For an implicit typedef, we just want the implicit
5849 typedef for the tsubst'd type. We've already got the
5850 tsubst'd type, as TYPE, so we just need it's associated
5852 r
= TYPE_NAME (type
);
5855 else if (!DECL_LANG_SPECIFIC (t
))
5857 /* For a template type parameter, we don't have to do
5858 anything special. */
5859 r
= TYPE_NAME (type
);
5873 /* Nobody should be tsubst'ing into non-template variables. */
5874 my_friendly_assert (DECL_LANG_SPECIFIC (t
)
5875 && DECL_TEMPLATE_INFO (t
) != NULL_TREE
, 0);
5877 if (TYPE_P (CP_DECL_CONTEXT (t
)))
5878 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
,
5880 in_decl
, /*entering_scope=*/1);
5882 /* Subsequent calls to pushdecl will fill this in. */
5885 /* Check to see if we already have this specialization. */
5886 tmpl
= DECL_TI_TEMPLATE (t
);
5887 gen_tmpl
= most_general_template (tmpl
);
5888 argvec
= tsubst (DECL_TI_ARGS (t
), args
, /*complain=*/1, in_decl
);
5890 spec
= retrieve_specialization (gen_tmpl
, argvec
);
5892 spec
= retrieve_local_specialization (gen_tmpl
,
5893 current_function_decl
);
5901 /* This declaration is going to have to be around for a while,
5902 so me make sure it is on a saveable obstack. */
5905 TREE_TYPE (r
) = type
;
5906 c_apply_type_quals_to_decl (CP_TYPE_QUALS (type
), r
);
5907 DECL_CONTEXT (r
) = ctx
;
5909 /* Don't try to expand the initializer until someone tries to use
5910 this variable; otherwise we run into circular dependencies. */
5911 DECL_INITIAL (r
) = NULL_TREE
;
5913 DECL_SIZE (r
) = DECL_SIZE_UNIT (r
) = 0;
5916 /* For __PRETTY_FUNCTION__ we have to adjust the initializer. */
5917 if (DECL_PRETTY_FUNCTION_P (r
))
5919 DECL_INITIAL (r
) = tsubst (DECL_INITIAL (t
),
5923 TREE_TYPE (r
) = TREE_TYPE (DECL_INITIAL (r
));
5926 /* If the template variable was marked TREE_ASM_WRITTEN, that
5927 means we don't need to write out any of the instantiations
5928 either. (__FUNCTION__ and its ilk are marked thusly.) */
5929 TREE_ASM_WRITTEN (r
) = TREE_ASM_WRITTEN (t
);
5931 /* Even if the original location is out of scope, the newly
5932 substituted one is not. */
5933 if (TREE_CODE (r
) == VAR_DECL
)
5934 DECL_DEAD_FOR_LOCAL (r
) = 0;
5936 /* A static data member declaration is always marked external
5937 when it is declared in-class, even if an initializer is
5938 present. We mimic the non-template processing here. */
5940 DECL_EXTERNAL (r
) = 1;
5942 DECL_TEMPLATE_INFO (r
) = tree_cons (tmpl
, argvec
, NULL_TREE
);
5943 SET_DECL_IMPLICIT_INSTANTIATION (r
);
5945 register_specialization (r
, gen_tmpl
, argvec
);
5947 register_local_specialization (r
, gen_tmpl
,
5948 current_function_decl
);
5950 TREE_CHAIN (r
) = NULL_TREE
;
5951 if (TREE_CODE (r
) == VAR_DECL
&& TREE_CODE (type
) == VOID_TYPE
)
5952 cp_error_at ("instantiation of `%D' as type void", r
);
5957 my_friendly_abort (0);
5960 /* Restore the file and line information. */
5961 lineno
= saved_lineno
;
5962 input_filename
= saved_filename
;
5967 /* Substitue into the ARG_TYPES of a function type. */
5970 tsubst_arg_types (arg_types
, args
, complain
, in_decl
)
5976 tree remaining_arg_types
;
5979 if (!arg_types
|| arg_types
== void_list_node
)
5982 remaining_arg_types
= tsubst_arg_types (TREE_CHAIN (arg_types
),
5983 args
, complain
, in_decl
);
5984 if (remaining_arg_types
== error_mark_node
)
5985 return error_mark_node
;
5987 type
= tsubst (TREE_VALUE (arg_types
), args
, complain
, in_decl
);
5988 if (type
== error_mark_node
)
5989 return error_mark_node
;
5991 /* Do array-to-pointer, function-to-pointer conversion, and ignore
5992 top-level qualifiers as required. */
5993 type
= TYPE_MAIN_VARIANT (type_decays_to (type
));
5995 /* Note that we do not substitute into default arguments here. The
5996 standard mandates that they be instantiated only when needed,
5997 which is done in build_over_call. */
5998 return hash_tree_cons (TREE_PURPOSE (arg_types
), type
,
5999 remaining_arg_types
);
6003 /* Substitute into a FUNCTION_TYPE or METHOD_TYPE. This routine does
6004 *not* handle the exception-specification for FNTYPE, because the
6005 initial substitution of explicitly provided template parameters
6006 during argument deduction forbids substitution into the
6007 exception-specification:
6011 All references in the function type of the function template to the
6012 corresponding template parameters are replaced by the specified tem-
6013 plate argument values. If a substitution in a template parameter or
6014 in the function type of the function template results in an invalid
6015 type, type deduction fails. [Note: The equivalent substitution in
6016 exception specifications is done only when the function is instanti-
6017 ated, at which point a program is ill-formed if the substitution
6018 results in an invalid type.] */
6021 tsubst_function_type (t
, args
, complain
, in_decl
)
6031 /* The TYPE_CONTEXT is not used for function/method types. */
6032 my_friendly_assert (TYPE_CONTEXT (t
) == NULL_TREE
, 0);
6034 /* Substitue the return type. */
6035 return_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
6036 if (return_type
== error_mark_node
)
6037 return error_mark_node
;
6039 /* Substitue the argument types. */
6040 arg_types
= tsubst_arg_types (TYPE_ARG_TYPES (t
), args
,
6042 if (arg_types
== error_mark_node
)
6043 return error_mark_node
;
6045 /* Construct a new type node and return it. */
6046 if (TREE_CODE (t
) == FUNCTION_TYPE
)
6047 fntype
= build_function_type (return_type
, arg_types
);
6050 tree r
= TREE_TYPE (TREE_VALUE (arg_types
));
6051 if (! IS_AGGR_TYPE (r
))
6055 Type deduction may fail for any of the following
6058 -- Attempting to create "pointer to member of T" when T
6059 is not a class type. */
6061 cp_error ("creating pointer to member function of non-class type `%T'",
6063 return error_mark_node
;
6066 fntype
= build_cplus_method_type (r
, return_type
, TREE_CHAIN
6069 fntype
= build_qualified_type (fntype
, TYPE_QUALS (t
));
6070 fntype
= build_type_attribute_variant (fntype
, TYPE_ATTRIBUTES (t
));
6075 /* Substitute into the PARMS of a call-declarator. */
6078 tsubst_call_declarator_parms (parms
, args
, complain
, in_decl
)
6088 if (!parms
|| parms
== void_list_node
)
6091 new_parms
= tsubst_call_declarator_parms (TREE_CHAIN (parms
),
6092 args
, complain
, in_decl
);
6094 /* Figure out the type of this parameter. */
6095 type
= tsubst (TREE_VALUE (parms
), args
, complain
, in_decl
);
6097 /* Figure out the default argument as well. Note that we use
6098 tsubst_expr since the default argument is really an expression. */
6099 defarg
= tsubst_expr (TREE_PURPOSE (parms
), args
, complain
, in_decl
);
6101 /* Chain this parameter on to the front of those we have already
6102 processed. We don't use hash_tree_cons because that function
6103 doesn't check TREE_PARMLIST. */
6104 new_parms
= tree_cons (defarg
, type
, new_parms
);
6106 /* And note that these are parameters. */
6107 TREE_PARMLIST (new_parms
) = 1;
6112 /* Take the tree structure T and replace template parameters used
6113 therein with the argument vector ARGS. IN_DECL is an associated
6114 decl for diagnostics. If an error occurs, returns ERROR_MARK_NODE.
6115 An appropriate error message is issued only if COMPLAIN is
6116 non-zero. Note that we must be relatively non-tolerant of
6117 extensions here, in order to preserve conformance; if we allow
6118 substitutions that should not be allowed, we may allow argument
6119 deductions that should not succeed, and therefore report ambiguous
6120 overload situations where there are none. In theory, we could
6121 allow the substitution, but indicate that it should have failed,
6122 and allow our caller to make sure that the right thing happens, but
6123 we don't try to do this yet.
6125 This function is used for dealing with types, decls and the like;
6126 for expressions, use tsubst_expr or tsubst_copy. */
6129 tsubst (t
, args
, complain
, in_decl
)
6136 if (t
== NULL_TREE
|| t
== error_mark_node
6137 || t
== integer_type_node
6138 || t
== void_type_node
6139 || t
== char_type_node
6140 || TREE_CODE (t
) == NAMESPACE_DECL
)
6143 if (TREE_CODE (t
) == IDENTIFIER_NODE
)
6144 type
= IDENTIFIER_TYPE_VALUE (t
);
6146 type
= TREE_TYPE (t
);
6147 if (type
== unknown_type_node
)
6148 my_friendly_abort (42);
6150 if (type
&& TREE_CODE (t
) != FUNCTION_DECL
6151 && TREE_CODE (t
) != TYPENAME_TYPE
6152 && TREE_CODE (t
) != TEMPLATE_DECL
6153 && TREE_CODE (t
) != IDENTIFIER_NODE
6154 && TREE_CODE (t
) != FUNCTION_TYPE
6155 && TREE_CODE (t
) != METHOD_TYPE
)
6156 type
= tsubst (type
, args
, complain
, in_decl
);
6157 if (type
== error_mark_node
)
6158 return error_mark_node
;
6160 if (TREE_CODE_CLASS (TREE_CODE (t
)) == 'd')
6161 return tsubst_decl (t
, args
, type
, in_decl
);
6163 switch (TREE_CODE (t
))
6168 return tsubst_aggr_type (t
, args
, complain
, in_decl
,
6169 /*entering_scope=*/0);
6172 case IDENTIFIER_NODE
:
6184 if (t
== integer_type_node
)
6187 if (TREE_CODE (TYPE_MIN_VALUE (t
)) == INTEGER_CST
6188 && TREE_CODE (TYPE_MAX_VALUE (t
)) == INTEGER_CST
)
6192 tree max
, omax
= TREE_OPERAND (TYPE_MAX_VALUE (t
), 0);
6194 max
= tsubst_expr (omax
, args
, complain
, in_decl
);
6195 if (max
== error_mark_node
)
6196 return error_mark_node
;
6198 /* See if we can reduce this expression to something simpler. */
6199 max
= maybe_fold_nontype_arg (max
);
6200 if (!processing_template_decl
&& TREE_READONLY_DECL_P (max
))
6201 max
= decl_constant_value (max
);
6203 if (processing_template_decl
6204 /* When providing explicit arguments to a template
6205 function, but leaving some arguments for subsequent
6206 deduction, MAX may be template-dependent even if we're
6207 not PROCESSING_TEMPLATE_DECL. We still need to check for
6208 template parms, though; MAX won't be an INTEGER_CST for
6209 dynamic arrays, either. */
6210 || (TREE_CODE (max
) != INTEGER_CST
6211 && uses_template_parms (max
)))
6213 tree itype
= make_node (INTEGER_TYPE
);
6214 TYPE_MIN_VALUE (itype
) = size_zero_node
;
6215 TYPE_MAX_VALUE (itype
) = build_min (MINUS_EXPR
, sizetype
, max
,
6220 if (integer_zerop (omax
))
6222 /* Still allow an explicit array of size zero. */
6224 pedwarn ("creating array with size zero");
6226 else if (integer_zerop (max
)
6227 || (TREE_CODE (max
) == INTEGER_CST
6228 && INT_CST_LT (max
, integer_zero_node
)))
6232 Type deduction may fail for any of the following
6235 Attempting to create an array with a size that is
6236 zero or negative. */
6238 cp_error ("creating array with size zero (`%E')", max
);
6240 return error_mark_node
;
6243 return compute_array_index_type (NULL_TREE
, max
);
6246 case TEMPLATE_TYPE_PARM
:
6247 case TEMPLATE_TEMPLATE_PARM
:
6248 case TEMPLATE_PARM_INDEX
:
6256 if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
6257 || TREE_CODE (t
) == TEMPLATE_TEMPLATE_PARM
)
6259 idx
= TEMPLATE_TYPE_IDX (t
);
6260 level
= TEMPLATE_TYPE_LEVEL (t
);
6264 idx
= TEMPLATE_PARM_IDX (t
);
6265 level
= TEMPLATE_PARM_LEVEL (t
);
6268 if (TREE_VEC_LENGTH (args
) > 0)
6270 tree arg
= NULL_TREE
;
6272 levels
= TMPL_ARGS_DEPTH (args
);
6273 if (level
<= levels
)
6274 arg
= TMPL_ARG (args
, level
, idx
);
6276 if (arg
== error_mark_node
)
6277 return error_mark_node
;
6278 else if (arg
!= NULL_TREE
)
6280 if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
6282 my_friendly_assert (TREE_CODE_CLASS (TREE_CODE (arg
))
6284 return cp_build_qualified_type_real
6285 (arg
, CP_TYPE_QUALS (arg
) | CP_TYPE_QUALS (t
),
6288 else if (TREE_CODE (t
) == TEMPLATE_TEMPLATE_PARM
)
6290 if (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t
))
6292 /* We are processing a type constructed from
6293 a template template parameter */
6294 tree argvec
= tsubst (TYPE_TI_ARGS (t
),
6295 args
, complain
, in_decl
);
6296 if (argvec
== error_mark_node
)
6297 return error_mark_node
;
6299 /* We can get a TEMPLATE_TEMPLATE_PARM here when
6300 we are resolving nested-types in the signature of
6301 a member function templates.
6302 Otherwise ARG is a TEMPLATE_DECL and is the real
6303 template to be instantiated. */
6304 if (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
6305 arg
= TYPE_NAME (arg
);
6307 r
= lookup_template_class (DECL_NAME (arg
),
6310 /*entering_scope=*/0);
6311 return cp_build_qualified_type_real (r
,
6316 /* We are processing a template argument list. */
6324 my_friendly_abort (981018);
6327 /* This can happen during the attempted tsubst'ing in
6328 unify. This means that we don't yet have any information
6329 about the template parameter in question. */
6332 /* If we get here, we must have been looking at a parm for a
6333 more deeply nested template. Make a new version of this
6334 template parameter, but with a lower level. */
6335 switch (TREE_CODE (t
))
6337 case TEMPLATE_TYPE_PARM
:
6338 case TEMPLATE_TEMPLATE_PARM
:
6340 TEMPLATE_TYPE_PARM_INDEX (r
)
6341 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (t
),
6343 TYPE_STUB_DECL (r
) = TYPE_NAME (r
) = TEMPLATE_TYPE_DECL (r
);
6344 TYPE_MAIN_VARIANT (r
) = r
;
6345 TYPE_POINTER_TO (r
) = NULL_TREE
;
6346 TYPE_REFERENCE_TO (r
) = NULL_TREE
;
6348 if (TREE_CODE (t
) == TEMPLATE_TEMPLATE_PARM
6349 && TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t
))
6351 tree argvec
= tsubst (TYPE_TI_ARGS (t
), args
,
6353 if (argvec
== error_mark_node
)
6354 return error_mark_node
;
6356 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (r
)
6357 = tree_cons (TYPE_NAME (t
), argvec
, NULL_TREE
);
6361 case TEMPLATE_PARM_INDEX
:
6362 r
= reduce_template_parm_level (t
, type
, levels
);
6366 my_friendly_abort (0);
6374 tree purpose
, value
, chain
, result
;
6376 if (t
== void_list_node
)
6379 purpose
= TREE_PURPOSE (t
);
6382 purpose
= tsubst (purpose
, args
, complain
, in_decl
);
6383 if (purpose
== error_mark_node
)
6384 return error_mark_node
;
6386 value
= TREE_VALUE (t
);
6389 value
= tsubst (value
, args
, complain
, in_decl
);
6390 if (value
== error_mark_node
)
6391 return error_mark_node
;
6393 chain
= TREE_CHAIN (t
);
6394 if (chain
&& chain
!= void_type_node
)
6396 chain
= tsubst (chain
, args
, complain
, in_decl
);
6397 if (chain
== error_mark_node
)
6398 return error_mark_node
;
6400 if (purpose
== TREE_PURPOSE (t
)
6401 && value
== TREE_VALUE (t
)
6402 && chain
== TREE_CHAIN (t
))
6404 result
= hash_tree_cons (purpose
, value
, chain
);
6405 TREE_PARMLIST (result
) = TREE_PARMLIST (t
);
6409 if (type
!= NULL_TREE
)
6411 /* A binfo node. We always need to make a copy, of the node
6412 itself and of its BINFO_BASETYPES. */
6416 /* Make sure type isn't a typedef copy. */
6417 type
= BINFO_TYPE (TYPE_BINFO (type
));
6419 TREE_TYPE (t
) = complete_type (type
);
6420 if (IS_AGGR_TYPE (type
))
6422 BINFO_VTABLE (t
) = TYPE_BINFO_VTABLE (type
);
6423 BINFO_VIRTUALS (t
) = TYPE_BINFO_VIRTUALS (type
);
6424 if (TYPE_BINFO_BASETYPES (type
) != NULL_TREE
)
6425 BINFO_BASETYPES (t
) = copy_node (TYPE_BINFO_BASETYPES (type
));
6430 /* Otherwise, a vector of template arguments. */
6431 return tsubst_template_arg_vector (t
, args
, complain
);
6434 case REFERENCE_TYPE
:
6436 enum tree_code code
;
6438 if (type
== TREE_TYPE (t
))
6441 code
= TREE_CODE (t
);
6446 Type deduction may fail for any of the following
6449 -- Attempting to create a pointer to reference type.
6450 -- Attempting to create a reference to a reference type or
6451 a reference to void. */
6452 if (TREE_CODE (type
) == REFERENCE_TYPE
6453 || (code
== REFERENCE_TYPE
&& TREE_CODE (type
) == VOID_TYPE
))
6455 static int last_line
= 0;
6456 static char* last_file
= 0;
6458 /* We keep track of the last time we issued this error
6459 message to avoid spewing a ton of messages during a
6460 single bad template instantiation. */
6461 if (complain
&& (last_line
!= lineno
||
6462 last_file
!= input_filename
))
6464 if (TREE_CODE (type
) == VOID_TYPE
)
6465 cp_error ("forming reference to void");
6467 cp_error ("forming %s to reference type `%T'",
6468 (code
== POINTER_TYPE
) ? "pointer" : "reference",
6471 last_file
= input_filename
;
6474 return error_mark_node
;
6476 else if (code
== POINTER_TYPE
)
6477 r
= build_pointer_type (type
);
6479 r
= build_reference_type (type
);
6480 r
= cp_build_qualified_type_real (r
, TYPE_QUALS (t
), complain
);
6482 /* Will this ever be needed for TYPE_..._TO values? */
6488 r
= tsubst (TYPE_OFFSET_BASETYPE (t
), args
, complain
, in_decl
);
6489 if (r
== error_mark_node
|| !IS_AGGR_TYPE (r
))
6493 Type deduction may fail for any of the following
6496 -- Attempting to create "pointer to member of T" when T
6497 is not a class type. */
6499 cp_error ("creating pointer to member of non-class type `%T'",
6501 return error_mark_node
;
6503 return build_offset_type (r
, type
);
6511 fntype
= tsubst_function_type (t
, args
, complain
, in_decl
);
6512 if (fntype
== error_mark_node
)
6513 return error_mark_node
;
6515 /* Substitue the exception specification. */
6516 raises
= TYPE_RAISES_EXCEPTIONS (t
);
6519 tree list
= NULL_TREE
;
6521 if (! TREE_VALUE (raises
))
6524 for (; raises
!= NULL_TREE
; raises
= TREE_CHAIN (raises
))
6526 tree spec
= TREE_VALUE (raises
);
6528 spec
= tsubst (spec
, args
, complain
, in_decl
);
6529 if (spec
== error_mark_node
)
6531 list
= add_exception_specifier (list
, spec
, complain
);
6533 fntype
= build_exception_variant (fntype
, list
);
6539 tree domain
= tsubst (TYPE_DOMAIN (t
), args
, complain
, in_decl
);
6540 if (domain
== error_mark_node
)
6541 return error_mark_node
;
6543 /* As an optimization, we avoid regenerating the array type if
6544 it will obviously be the same as T. */
6545 if (type
== TREE_TYPE (t
) && domain
== TYPE_DOMAIN (t
))
6548 /* These checks should match the ones in grokdeclarator.
6552 The deduction may fail for any of the following reasons:
6554 -- Attempting to create an array with an element type that
6555 is void, a function type, or a reference type. */
6556 if (TREE_CODE (type
) == VOID_TYPE
6557 || TREE_CODE (type
) == FUNCTION_TYPE
6558 || TREE_CODE (type
) == REFERENCE_TYPE
)
6561 cp_error ("creating array of `%T'", type
);
6562 return error_mark_node
;
6565 r
= build_cplus_array_type (type
, domain
);
6572 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6574 tree e2
= tsubst (TREE_OPERAND (t
, 1), args
, complain
,
6577 if (e1
== error_mark_node
|| e2
== error_mark_node
)
6578 return error_mark_node
;
6580 return fold (build (TREE_CODE (t
), TREE_TYPE (t
), e1
, e2
));
6586 tree e
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6588 if (e
== error_mark_node
)
6589 return error_mark_node
;
6591 return fold (build (TREE_CODE (t
), TREE_TYPE (t
), e
));
6596 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
6597 in_decl
, /*entering_scope=*/1);
6598 tree f
= tsubst_copy (TYPENAME_TYPE_FULLNAME (t
), args
,
6601 if (ctx
== error_mark_node
|| f
== error_mark_node
)
6602 return error_mark_node
;
6604 if (!IS_AGGR_TYPE (ctx
))
6607 cp_error ("`%T' is not a class, struct, or union type",
6609 return error_mark_node
;
6611 else if (!uses_template_parms (ctx
) && !TYPE_BEING_DEFINED (ctx
))
6613 /* Normally, make_typename_type does not require that the CTX
6614 have complete type in order to allow things like:
6616 template <class T> struct S { typename S<T>::X Y; };
6618 But, such constructs have already been resolved by this
6619 point, so here CTX really should have complete type, unless
6620 it's a partial instantiation. */
6621 ctx
= complete_type (ctx
);
6622 if (!TYPE_SIZE (ctx
))
6625 incomplete_type_error (NULL_TREE
, ctx
);
6626 return error_mark_node
;
6630 f
= make_typename_type (ctx
, f
, complain
);
6631 if (f
== error_mark_node
)
6633 return cp_build_qualified_type_real (f
,
6635 | CP_TYPE_QUALS (t
),
6641 tree e
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6643 if (e
== error_mark_node
)
6644 return error_mark_node
;
6645 return make_pointer_declarator (type
, e
);
6650 tree e
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6652 if (e
== error_mark_node
)
6653 return error_mark_node
;
6654 return make_reference_declarator (type
, e
);
6659 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6661 tree e2
= tsubst_expr (TREE_OPERAND (t
, 1), args
, complain
,
6663 if (e1
== error_mark_node
|| e2
== error_mark_node
)
6664 return error_mark_node
;
6666 return build_parse_node (ARRAY_REF
, e1
, e2
, tsubst_expr
);
6671 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6673 tree e2
= (tsubst_call_declarator_parms
6674 (CALL_DECLARATOR_PARMS (t
), args
, complain
, in_decl
));
6675 tree e3
= tsubst (CALL_DECLARATOR_EXCEPTION_SPEC (t
), args
,
6678 if (e1
== error_mark_node
|| e2
== error_mark_node
6679 || e3
== error_mark_node
)
6680 return error_mark_node
;
6682 return make_call_declarator (e1
, e2
, CALL_DECLARATOR_QUALS (t
), e3
);
6687 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
,
6689 tree e2
= tsubst (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
6690 if (e1
== error_mark_node
|| e2
== error_mark_node
)
6691 return error_mark_node
;
6693 return build_parse_node (TREE_CODE (t
), e1
, e2
);
6698 tree e1
= tsubst_expr (TYPE_FIELDS (t
), args
, complain
,
6700 if (e1
== error_mark_node
)
6701 return error_mark_node
;
6703 return TREE_TYPE (e1
);
6713 /* This code should match declare_hidden_char_array in
6715 name
= (*decl_printable_name
) (current_function_decl
, 2);
6716 len
= strlen (name
) + 1;
6717 type
= build_array_type (char_type_node
,
6718 build_index_type (build_int_2 (len
, 0)));
6719 str
= build_string (len
, name
);
6720 TREE_TYPE (str
) = type
;
6725 sorry ("use of `%s' in template",
6726 tree_code_name
[(int) TREE_CODE (t
)]);
6727 return error_mark_node
;
6731 /* Like tsubst, but deals with expressions. This function just replaces
6732 template parms; to finish processing the resultant expression, use
6736 tsubst_copy (t
, args
, complain
, in_decl
)
6741 enum tree_code code
;
6744 if (t
== NULL_TREE
|| t
== error_mark_node
)
6747 code
= TREE_CODE (t
);
6752 return do_identifier (DECL_NAME (t
), 0, NULL_TREE
);
6759 if (!DECL_CONTEXT (t
))
6760 /* This is a global enumeration constant. */
6763 /* Unfortunately, we cannot just call lookup_name here.
6766 template <int I> int f() {
6768 struct S { void g() { E e = a; } };
6771 When we instantiate f<7>::S::g(), say, lookup_name is not
6772 clever enough to find f<7>::a. */
6774 = tsubst_aggr_type (TREE_TYPE (t
), args
, complain
, in_decl
,
6775 /*entering_scope=*/0);
6777 for (v
= TYPE_VALUES (enum_type
);
6780 if (TREE_PURPOSE (v
) == DECL_NAME (t
))
6781 return TREE_VALUE (v
);
6783 /* We didn't find the name. That should never happen; if
6784 name-lookup found it during preliminary parsing, we
6785 should find it again here during instantiation. */
6786 my_friendly_abort (0);
6791 if (DECL_CONTEXT (t
))
6795 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
6796 /*entering_scope=*/1);
6797 if (ctx
!= DECL_CONTEXT (t
))
6798 return lookup_field (ctx
, DECL_NAME (t
), 0, 0);
6804 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
))
6805 t
= tsubst (t
, args
, complain
, in_decl
);
6810 if (is_member_template (t
))
6811 return tsubst (t
, args
, complain
, in_decl
);
6817 /* We must tsbust into a LOOKUP_EXPR in case the names to
6818 which it refers is a conversion operator; in that case the
6819 name will change. We avoid making unnecessary copies,
6822 tree id
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
6824 if (id
!= TREE_OPERAND (t
, 0))
6826 r
= build_nt (LOOKUP_EXPR
, id
);
6827 LOOKUP_EXPR_GLOBAL (r
) = LOOKUP_EXPR_GLOBAL (t
);
6835 case REINTERPRET_CAST_EXPR
:
6836 case CONST_CAST_EXPR
:
6837 case STATIC_CAST_EXPR
:
6838 case DYNAMIC_CAST_EXPR
:
6841 (code
, tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
6842 tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
));
6845 case PREDECREMENT_EXPR
:
6846 case PREINCREMENT_EXPR
:
6847 case POSTDECREMENT_EXPR
:
6848 case POSTINCREMENT_EXPR
:
6850 case TRUTH_NOT_EXPR
:
6853 case CONVERT_EXPR
: /* Unary + */
6862 (code
, tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
6863 tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
));
6868 case TRUNC_DIV_EXPR
:
6870 case FLOOR_DIV_EXPR
:
6871 case ROUND_DIV_EXPR
:
6872 case EXACT_DIV_EXPR
:
6874 case BIT_ANDTC_EXPR
:
6877 case TRUNC_MOD_EXPR
:
6878 case FLOOR_MOD_EXPR
:
6879 case TRUTH_ANDIF_EXPR
:
6880 case TRUTH_ORIF_EXPR
:
6881 case TRUTH_AND_EXPR
:
6902 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
6903 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
));
6907 tree fn
= TREE_OPERAND (t
, 0);
6908 if (is_overloaded_fn (fn
))
6909 fn
= tsubst_copy (get_first_fn (fn
), args
, complain
, in_decl
);
6911 /* Sometimes FN is a LOOKUP_EXPR. */
6912 fn
= tsubst_copy (fn
, args
, complain
, in_decl
);
6914 (code
, fn
, tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
,
6919 case METHOD_CALL_EXPR
:
6921 tree name
= TREE_OPERAND (t
, 0);
6922 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
6924 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
6926 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
6928 else if (TREE_CODE (name
) == SCOPE_REF
6929 && TREE_CODE (TREE_OPERAND (name
, 1)) == BIT_NOT_EXPR
)
6931 tree base
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
6933 name
= TREE_OPERAND (name
, 1);
6934 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
6936 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
6937 name
= build_nt (SCOPE_REF
, base
, name
);
6940 name
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
6942 (code
, name
, tsubst_copy (TREE_OPERAND (t
, 1), args
,
6944 tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
),
6949 /* This processing should really occur in tsubst_expr, However,
6950 tsubst_expr does not recurse into expressions, since it
6951 assumes that there aren't any statements inside them.
6952 Instead, it simply calls build_expr_from_tree. So, we need
6953 to expand the STMT_EXPR here. */
6954 if (!processing_template_decl
)
6956 tree stmt_expr
= begin_stmt_expr ();
6957 tsubst_expr (STMT_EXPR_STMT (t
), args
,
6959 return finish_stmt_expr (stmt_expr
);
6966 case PSEUDO_DTOR_EXPR
:
6969 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
6970 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
),
6971 tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
));
6978 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
6979 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
),
6980 tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
));
6981 NEW_EXPR_USE_GLOBAL (r
) = NEW_EXPR_USE_GLOBAL (t
);
6988 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
6989 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
));
6990 DELETE_EXPR_USE_GLOBAL (r
) = DELETE_EXPR_USE_GLOBAL (t
);
6991 DELETE_EXPR_USE_VEC (r
) = DELETE_EXPR_USE_VEC (t
);
6995 case TEMPLATE_ID_EXPR
:
6997 /* Substituted template arguments */
6998 tree targs
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
,
7001 if (targs
&& TREE_CODE (targs
) == TREE_LIST
)
7004 for (chain
= targs
; chain
; chain
= TREE_CHAIN (chain
))
7005 TREE_VALUE (chain
) = maybe_fold_nontype_arg (TREE_VALUE (chain
));
7010 for (i
= 0; i
< TREE_VEC_LENGTH (targs
); ++i
)
7011 TREE_VEC_ELT (targs
, i
)
7012 = maybe_fold_nontype_arg (TREE_VEC_ELT (targs
, i
));
7015 return lookup_template_function
7016 (tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
), targs
);
7021 tree purpose
, value
, chain
;
7023 if (t
== void_list_node
)
7026 purpose
= TREE_PURPOSE (t
);
7028 purpose
= tsubst_copy (purpose
, args
, complain
, in_decl
);
7029 value
= TREE_VALUE (t
);
7031 value
= tsubst_copy (value
, args
, complain
, in_decl
);
7032 chain
= TREE_CHAIN (t
);
7033 if (chain
&& chain
!= void_type_node
)
7034 chain
= tsubst_copy (chain
, args
, complain
, in_decl
);
7035 if (purpose
== TREE_PURPOSE (t
)
7036 && value
== TREE_VALUE (t
)
7037 && chain
== TREE_CHAIN (t
))
7039 return tree_cons (purpose
, value
, chain
);
7046 case TEMPLATE_TYPE_PARM
:
7047 case TEMPLATE_TEMPLATE_PARM
:
7048 case TEMPLATE_PARM_INDEX
:
7050 case REFERENCE_TYPE
:
7057 return tsubst (t
, args
, complain
, in_decl
);
7059 case IDENTIFIER_NODE
:
7060 if (IDENTIFIER_TYPENAME_P (t
)
7061 /* Make sure it's not just a variable named `__opr', for instance,
7062 which can occur in some existing code. */
7064 return build_typename_overload
7065 (tsubst (TREE_TYPE (t
), args
, complain
, in_decl
));
7072 (CONSTRUCTOR
, tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
7073 NULL_TREE
, tsubst_copy (CONSTRUCTOR_ELTS (t
), args
,
7074 complain
, in_decl
));
7075 TREE_HAS_CONSTRUCTOR (r
) = TREE_HAS_CONSTRUCTOR (t
);
7080 return build_va_arg (tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
,
7082 tsubst (TREE_TYPE (t
), args
, complain
, in_decl
));
7085 return tsubst (t
, args
, complain
, in_decl
);
7092 /* Like tsubst_copy, but also does semantic processing. */
7095 tsubst_expr (t
, args
, complain
, in_decl
)
7102 if (t
== NULL_TREE
|| t
== error_mark_node
)
7105 if (processing_template_decl
)
7106 return tsubst_copy (t
, args
, complain
, in_decl
);
7108 switch (TREE_CODE (t
))
7112 finish_named_return_value
7113 (TREE_OPERAND (t
, 0),
7114 tsubst_expr (TREE_OPERAND (t
, 1), args
, /*complain=*/1, in_decl
));
7115 tsubst_expr (TREE_CHAIN (t
), args
, complain
, in_decl
);
7118 case CTOR_INITIALIZER
:
7120 current_member_init_list
7121 = tsubst_expr_values (TREE_OPERAND (t
, 0), args
);
7122 current_base_init_list
7123 = tsubst_expr_values (TREE_OPERAND (t
, 1), args
);
7125 tsubst_expr (TREE_CHAIN (t
), args
, complain
, in_decl
);
7130 finish_return_stmt (tsubst_expr (RETURN_EXPR (t
),
7131 args
, complain
, in_decl
));
7136 finish_expr_stmt (tsubst_expr (EXPR_STMT_EXPR (t
),
7137 args
, complain
, in_decl
));
7146 decl
= DECL_STMT_DECL (t
);
7147 if (TREE_CODE (decl
) == LABEL_DECL
)
7148 finish_label_decl (DECL_NAME (decl
));
7151 init
= DECL_INITIAL (decl
);
7152 decl
= tsubst (decl
, args
, complain
, in_decl
);
7153 init
= tsubst_expr (init
, args
, complain
, in_decl
);
7155 DECL_INITIAL (decl
) = error_mark_node
;
7156 /* By marking the declaration as instantiated, we avoid
7157 trying to instantiate it. Since instantiate_decl can't
7158 handle local variables, and since we've already done
7159 all that needs to be done, that's the right thing to
7161 if (TREE_CODE (decl
) == VAR_DECL
)
7162 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
7163 maybe_push_decl (decl
);
7164 cp_finish_decl (decl
, init
, NULL_TREE
, 0);
7174 stmt
= begin_for_stmt ();
7175 for (tmp
= FOR_INIT_STMT (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
7176 tsubst_expr (tmp
, args
, complain
, in_decl
);
7177 finish_for_init_stmt (stmt
);
7178 finish_for_cond (tsubst_expr (FOR_COND (t
), args
,
7181 tmp
= tsubst_expr (FOR_EXPR (t
), args
, complain
, in_decl
);
7182 finish_for_expr (tmp
, stmt
);
7183 tsubst_expr (FOR_BODY (t
), args
, complain
, in_decl
);
7184 finish_for_stmt (tmp
, stmt
);
7191 stmt
= begin_while_stmt ();
7192 finish_while_stmt_cond (tsubst_expr (WHILE_COND (t
),
7193 args
, complain
, in_decl
),
7195 tsubst_expr (WHILE_BODY (t
), args
, complain
, in_decl
);
7196 finish_while_stmt (stmt
);
7203 stmt
= begin_do_stmt ();
7204 tsubst_expr (DO_BODY (t
), args
, complain
, in_decl
);
7205 finish_do_body (stmt
);
7206 finish_do_stmt (tsubst_expr (DO_COND (t
), args
,
7217 stmt
= begin_if_stmt ();
7218 finish_if_stmt_cond (tsubst_expr (IF_COND (t
),
7219 args
, complain
, in_decl
),
7222 if (tmp
= THEN_CLAUSE (t
), tmp
)
7224 tsubst_expr (tmp
, args
, complain
, in_decl
);
7225 finish_then_clause (stmt
);
7228 if (tmp
= ELSE_CLAUSE (t
), tmp
)
7230 begin_else_clause ();
7231 tsubst_expr (tmp
, args
, complain
, in_decl
);
7232 finish_else_clause (stmt
);
7244 stmt
= begin_compound_stmt (COMPOUND_STMT_NO_SCOPE (t
));
7245 for (substmt
= COMPOUND_BODY (t
);
7246 substmt
!= NULL_TREE
;
7247 substmt
= TREE_CHAIN (substmt
))
7248 tsubst_expr (substmt
, args
, complain
, in_decl
);
7249 return finish_compound_stmt (COMPOUND_STMT_NO_SCOPE (t
), stmt
);
7255 finish_break_stmt ();
7260 finish_continue_stmt ();
7268 stmt
= begin_switch_stmt ();
7269 val
= tsubst_expr (SWITCH_COND (t
), args
, complain
, in_decl
);
7270 finish_switch_cond (val
, stmt
);
7271 tsubst_expr (SWITCH_BODY (t
), args
, complain
, in_decl
);
7272 finish_switch_stmt (val
, stmt
);
7278 finish_case_label (tsubst_expr (CASE_LOW (t
), args
, complain
, in_decl
),
7279 tsubst_expr (CASE_HIGH (t
), args
, complain
, in_decl
));
7283 lineno
= STMT_LINENO (t
);
7284 finish_label_stmt (DECL_NAME (LABEL_STMT_LABEL (t
)));
7289 t
= GOTO_DESTINATION (t
);
7290 if (TREE_CODE (t
) != LABEL_DECL
)
7291 /* Computed goto's must be tsubst'd into. On the other hand,
7292 non-computed gotos must not be; the identifier in question
7293 will have no binding. */
7294 t
= tsubst_expr (t
, args
, complain
, in_decl
);
7297 finish_goto_stmt (t
);
7302 finish_asm_stmt (ASM_CV_QUAL (t
),
7303 tsubst_expr (ASM_STRING (t
), args
, complain
, in_decl
),
7304 tsubst_expr (ASM_OUTPUTS (t
), args
, complain
, in_decl
),
7305 tsubst_expr (ASM_INPUTS (t
), args
, complain
, in_decl
),
7306 tsubst_expr (ASM_CLOBBERS (t
), args
, complain
,
7314 stmt
= begin_try_block ();
7315 tsubst_expr (TRY_STMTS (t
), args
, complain
, in_decl
);
7316 finish_cleanup_try_block (stmt
);
7317 finish_cleanup (tsubst_expr (TRY_HANDLERS (t
), args
,
7325 if (FN_TRY_BLOCK_P (t
))
7326 stmt
= begin_function_try_block ();
7328 stmt
= begin_try_block ();
7330 tsubst_expr (TRY_STMTS (t
), args
, complain
, in_decl
);
7332 if (FN_TRY_BLOCK_P (t
))
7333 finish_function_try_block (stmt
);
7335 finish_try_block (stmt
);
7337 handler
= TRY_HANDLERS (t
);
7338 for (; handler
; handler
= TREE_CHAIN (handler
))
7339 tsubst_expr (handler
, args
, complain
, in_decl
);
7340 if (FN_TRY_BLOCK_P (t
))
7341 finish_function_handler_sequence (stmt
);
7343 finish_handler_sequence (stmt
);
7353 stmt
= begin_handler ();
7354 if (HANDLER_PARMS (t
))
7356 decl
= DECL_STMT_DECL (HANDLER_PARMS (t
));
7357 decl
= tsubst (decl
, args
, complain
, in_decl
);
7358 /* Prevent instantiate_decl from trying to instantiate
7359 this variable. We've already done all that needs to be
7361 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
7365 blocks
= finish_handler_parms (decl
, stmt
);
7366 tsubst_expr (HANDLER_BODY (t
), args
, complain
, in_decl
);
7367 finish_handler (blocks
, stmt
);
7374 tsubst (t
, args
, complain
, NULL_TREE
);
7378 return build_expr_from_tree (tsubst_copy (t
, args
, complain
, in_decl
));
7383 /* Instantiate the indicated variable or function template TMPL with
7384 the template arguments in TARG_PTR. */
7387 instantiate_template (tmpl
, targ_ptr
)
7388 tree tmpl
, targ_ptr
;
7396 if (tmpl
== error_mark_node
)
7397 return error_mark_node
;
7399 my_friendly_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
, 283);
7401 /* Check to see if we already have this specialization. */
7402 spec
= retrieve_specialization (tmpl
, targ_ptr
);
7403 if (spec
!= NULL_TREE
)
7406 if (DECL_TEMPLATE_INFO (tmpl
))
7408 /* The TMPL is a partial instantiation. To get a full set of
7409 arguments we must add the arguments used to perform the
7410 partial instantiation. */
7411 targ_ptr
= add_outermost_template_args (DECL_TI_ARGS (tmpl
),
7413 gen_tmpl
= most_general_template (tmpl
);
7415 /* Check to see if we already have this specialization. */
7416 spec
= retrieve_specialization (gen_tmpl
, targ_ptr
);
7417 if (spec
!= NULL_TREE
)
7423 len
= DECL_NTPARMS (gen_tmpl
);
7424 inner_args
= innermost_args (targ_ptr
);
7428 tree t
= TREE_VEC_ELT (inner_args
, i
);
7429 if (TREE_CODE_CLASS (TREE_CODE (t
)) == 't')
7431 tree nt
= target_type (t
);
7432 if (IS_AGGR_TYPE (nt
) && decl_function_context (TYPE_MAIN_DECL (nt
)))
7434 cp_error ("type `%T' composed from a local class is not a valid template-argument", t
);
7435 cp_error (" trying to instantiate `%D'", gen_tmpl
);
7436 fndecl
= error_mark_node
;
7442 /* substitute template parameters */
7443 fndecl
= tsubst (DECL_RESULT (gen_tmpl
), targ_ptr
, /*complain=*/1, gen_tmpl
);
7444 /* The DECL_TI_TEMPLATE should always be the immediate parent
7445 template, not the most general template. */
7446 DECL_TI_TEMPLATE (fndecl
) = tmpl
;
7448 if (flag_external_templates
)
7449 add_pending_template (fndecl
);
7455 /* Push the name of the class template into the scope of the instantiation. */
7458 overload_template_name (type
)
7461 tree id
= DECL_NAME (CLASSTYPE_TI_TEMPLATE (type
));
7464 if (IDENTIFIER_CLASS_VALUE (id
)
7465 && TREE_TYPE (IDENTIFIER_CLASS_VALUE (id
)) == type
)
7468 decl
= build_decl (TYPE_DECL
, id
, type
);
7469 SET_DECL_ARTIFICIAL (decl
);
7470 pushdecl_class_level (decl
);
7473 /* The FN is a TEMPLATE_DECL for a function. The ARGS are the
7474 arguments that are being used when calling it. TARGS is a vector
7475 into which the deduced template arguments are placed.
7477 Return zero for success, 2 for an incomplete match that doesn't resolve
7478 all the types, and 1 for complete failure. An error message will be
7479 printed only for an incomplete match.
7481 If FN is a conversion operator, RETURN_TYPE is the type desired as
7482 the result of the conversion operator.
7484 TPARMS is a vector of template parameters.
7486 The EXPLICIT_TARGS are explicit template arguments provided via a
7489 The parameter STRICT is one of:
7492 We are deducing arguments for a function call, as in
7496 We are deducing arguments for a conversion function, as in
7500 We are deducing arguments when calculating the partial
7501 ordering between specializations of function or class
7502 templates, as in [temp.func.order] and [temp.class.order],
7503 when doing an explicit instantiation as in [temp.explicit],
7504 when determining an explicit specialization as in
7505 [temp.expl.spec], or when taking the address of a function
7506 template, as in [temp.deduct.funcaddr].
7508 The other arguments are as for type_unification. */
7511 fn_type_unification (fn
, explicit_targs
, targs
, args
, return_type
,
7513 tree fn
, explicit_targs
, targs
, args
, return_type
;
7514 unification_kind_t strict
;
7520 my_friendly_assert (TREE_CODE (fn
) == TEMPLATE_DECL
, 0);
7522 fntype
= TREE_TYPE (fn
);
7527 The specified template arguments must match the template
7528 parameters in kind (i.e., type, nontype, template), and there
7529 must not be more arguments than there are parameters;
7530 otherwise type deduction fails.
7532 Nontype arguments must match the types of the corresponding
7533 nontype template parameters, or must be convertible to the
7534 types of the corresponding nontype parameters as specified in
7535 _temp.arg.nontype_, otherwise type deduction fails.
7537 All references in the function type of the function template
7538 to the corresponding template parameters are replaced by the
7539 specified template argument values. If a substitution in a
7540 template parameter or in the function type of the function
7541 template results in an invalid type, type deduction fails. */
7543 tree converted_args
;
7546 = (coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
7547 explicit_targs
, NULL_TREE
, /*complain=*/0,
7548 /*require_all_arguments=*/0));
7549 if (converted_args
== error_mark_node
)
7552 fntype
= tsubst (fntype
, converted_args
, /*complain=*/0, NULL_TREE
);
7553 if (fntype
== error_mark_node
)
7556 /* Place the explicitly specified arguments in TARGS. */
7557 for (i
= 0; i
< TREE_VEC_LENGTH (targs
); i
++)
7558 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (converted_args
, i
);
7561 parms
= TYPE_ARG_TYPES (fntype
);
7563 if (DECL_CONV_FN_P (fn
))
7565 /* This is a template conversion operator. Use the return types
7566 as well as the argument types. We use it instead of 'this', since
7567 we could be comparing conversions from different classes. */
7568 parms
= tree_cons (NULL_TREE
, TREE_TYPE (fntype
),
7569 TREE_CHAIN (parms
));
7570 args
= tree_cons (NULL_TREE
, return_type
, TREE_CHAIN (args
));
7573 /* We allow incomplete unification without an error message here
7574 because the standard doesn't seem to explicitly prohibit it. Our
7575 callers must be ready to deal with unification failures in any
7577 result
= type_unification_real (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
7578 targs
, parms
, args
, /*subr=*/0,
7579 strict
, /*allow_incomplete*/1);
7582 /* All is well so far. Now, check:
7586 When all template arguments have been deduced, all uses of
7587 template parameters in nondeduced contexts are replaced with
7588 the corresponding deduced argument values. If the
7589 substitution results in an invalid type, as described above,
7590 type deduction fails. */
7591 if (tsubst (TREE_TYPE (fn
), targs
, /*complain=*/0, NULL_TREE
)
7598 /* Adjust types before performing type deduction, as described in
7599 [temp.deduct.call] and [temp.deduct.conv]. The rules in these two
7600 sections are symmetric. PARM is the type of a function parameter
7601 or the return type of the conversion function. ARG is the type of
7602 the argument passed to the call, or the type of the value
7603 intialized with the result of the conversion function. */
7606 maybe_adjust_types_for_deduction (strict
, parm
, arg
)
7607 unification_kind_t strict
;
7618 /* Swap PARM and ARG throughout the remainder of this
7619 function; the handling is precisely symmetric since PARM
7620 will initialize ARG rather than vice versa. */
7628 /* There is nothing to do in this case. */
7632 my_friendly_abort (0);
7635 if (TREE_CODE (*parm
) != REFERENCE_TYPE
)
7637 /* [temp.deduct.call]
7639 If P is not a reference type:
7641 --If A is an array type, the pointer type produced by the
7642 array-to-pointer standard conversion (_conv.array_) is
7643 used in place of A for type deduction; otherwise,
7645 --If A is a function type, the pointer type produced by
7646 the function-to-pointer standard conversion
7647 (_conv.func_) is used in place of A for type deduction;
7650 --If A is a cv-qualified type, the top level
7651 cv-qualifiers of A's type are ignored for type
7653 if (TREE_CODE (*arg
) == ARRAY_TYPE
)
7654 *arg
= build_pointer_type (TREE_TYPE (*arg
));
7655 else if (TREE_CODE (*arg
) == FUNCTION_TYPE
)
7656 *arg
= build_pointer_type (*arg
);
7658 *arg
= TYPE_MAIN_VARIANT (*arg
);
7661 /* [temp.deduct.call]
7663 If P is a cv-qualified type, the top level cv-qualifiers
7664 of P's type are ignored for type deduction. If P is a
7665 reference type, the type referred to by P is used for
7667 *parm
= TYPE_MAIN_VARIANT (*parm
);
7668 if (TREE_CODE (*parm
) == REFERENCE_TYPE
)
7669 *parm
= TREE_TYPE (*parm
);
7672 /* Like type_unfication.
7674 If SUBR is 1, we're being called recursively (to unify the
7675 arguments of a function or method parameter of a function
7679 type_unification_real (tparms
, targs
, parms
, args
, subr
,
7680 strict
, allow_incomplete
)
7681 tree tparms
, targs
, parms
, args
;
7683 unification_kind_t strict
;
7684 int allow_incomplete
;
7688 int ntparms
= TREE_VEC_LENGTH (tparms
);
7691 my_friendly_assert (TREE_CODE (tparms
) == TREE_VEC
, 289);
7692 my_friendly_assert (parms
== NULL_TREE
7693 || TREE_CODE (parms
) == TREE_LIST
, 290);
7694 /* ARGS could be NULL (via a call from parse.y to
7695 build_x_function_call). */
7697 my_friendly_assert (TREE_CODE (args
) == TREE_LIST
, 291);
7698 my_friendly_assert (ntparms
> 0, 292);
7703 sub_strict
= UNIFY_ALLOW_MORE_CV_QUAL
| UNIFY_ALLOW_DERIVED
;
7707 sub_strict
= UNIFY_ALLOW_LESS_CV_QUAL
;
7711 sub_strict
= UNIFY_ALLOW_NONE
;
7715 my_friendly_abort (0);
7719 && parms
!= void_list_node
7721 && args
!= void_list_node
)
7723 parm
= TREE_VALUE (parms
);
7724 parms
= TREE_CHAIN (parms
);
7725 arg
= TREE_VALUE (args
);
7726 args
= TREE_CHAIN (args
);
7728 if (arg
== error_mark_node
)
7730 if (arg
== unknown_type_node
)
7731 /* We can't deduce anything from this, but we might get all the
7732 template args from other function args. */
7735 /* Conversions will be performed on a function argument that
7736 corresponds with a function parameter that contains only
7737 non-deducible template parameters and explicitly specified
7738 template parameters. */
7739 if (! uses_template_parms (parm
))
7743 if (TREE_CODE_CLASS (TREE_CODE (arg
)) != 't')
7744 type
= TREE_TYPE (arg
);
7751 if (strict
== DEDUCE_EXACT
)
7753 if (same_type_p (parm
, type
))
7757 /* It might work; we shouldn't check now, because we might
7758 get into infinite recursion. Overload resolution will
7765 if (TREE_CODE_CLASS (TREE_CODE (arg
)) != 't')
7767 my_friendly_assert (TREE_TYPE (arg
) != NULL_TREE
, 293);
7768 if (type_unknown_p (arg
))
7770 /* [temp.deduct.type] A template-argument can be deduced from
7771 a pointer to function or pointer to member function
7772 argument if the set of overloaded functions does not
7773 contain function templates and at most one of a set of
7774 overloaded functions provides a unique match. */
7776 if (resolve_overloaded_unification
7777 (tparms
, targs
, parm
, arg
, strict
, sub_strict
)
7782 arg
= TREE_TYPE (arg
);
7786 maybe_adjust_types_for_deduction (strict
, &parm
, &arg
);
7788 switch (unify (tparms
, targs
, parm
, arg
, sub_strict
))
7796 /* Fail if we've reached the end of the parm list, and more args
7797 are present, and the parm list isn't variadic. */
7798 if (args
&& args
!= void_list_node
&& parms
== void_list_node
)
7800 /* Fail if parms are left and they don't have default values. */
7802 && parms
!= void_list_node
7803 && TREE_PURPOSE (parms
) == NULL_TREE
)
7806 for (i
= 0; i
< ntparms
; i
++)
7807 if (TREE_VEC_ELT (targs
, i
) == NULL_TREE
)
7809 if (!allow_incomplete
)
7810 error ("incomplete type unification");
7816 /* Subroutine of type_unification_real. Args are like the variables at the
7817 call site. ARG is an overloaded function (or template-id); we try
7818 deducing template args from each of the overloads, and if only one
7819 succeeds, we go with that. Modifies TARGS and returns 0 on success. */
7822 resolve_overloaded_unification (tparms
, targs
, parm
, arg
, strict
,
7824 tree tparms
, targs
, parm
, arg
;
7825 unification_kind_t strict
;
7828 tree tempargs
= copy_node (targs
);
7831 if (TREE_CODE (arg
) == ADDR_EXPR
)
7832 arg
= TREE_OPERAND (arg
, 0);
7834 if (TREE_CODE (arg
) == COMPONENT_REF
)
7835 /* Handle `&x' where `x' is some static or non-static member
7837 arg
= TREE_OPERAND (arg
, 1);
7839 if (TREE_CODE (arg
) == OFFSET_REF
)
7840 arg
= TREE_OPERAND (arg
, 1);
7842 /* Strip baselink information. */
7843 while (TREE_CODE (arg
) == TREE_LIST
)
7844 arg
= TREE_VALUE (arg
);
7846 if (TREE_CODE (arg
) == TEMPLATE_ID_EXPR
)
7848 /* If we got some explicit template args, we need to plug them into
7849 the affected templates before we try to unify, in case the
7850 explicit args will completely resolve the templates in question. */
7852 tree expl_subargs
= TREE_OPERAND (arg
, 1);
7853 arg
= TREE_OPERAND (arg
, 0);
7855 for (; arg
; arg
= OVL_NEXT (arg
))
7857 tree fn
= OVL_CURRENT (arg
);
7860 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
7863 subargs
= get_bindings_overload (fn
, DECL_RESULT (fn
), expl_subargs
);
7866 elem
= tsubst (TREE_TYPE (fn
), subargs
, /*complain=*/0,
7868 if (TREE_CODE (elem
) == METHOD_TYPE
)
7869 elem
= build_ptrmemfunc_type (build_pointer_type (elem
));
7870 good
+= try_one_overload (tparms
, targs
, tempargs
, parm
, elem
,
7871 strict
, sub_strict
);
7875 else if (TREE_CODE (arg
) == OVERLOAD
)
7877 for (; arg
; arg
= OVL_NEXT (arg
))
7879 tree type
= TREE_TYPE (OVL_CURRENT (arg
));
7880 if (TREE_CODE (type
) == METHOD_TYPE
)
7881 type
= build_ptrmemfunc_type (build_pointer_type (type
));
7882 good
+= try_one_overload (tparms
, targs
, tempargs
, parm
,
7884 strict
, sub_strict
);
7888 my_friendly_abort (981006);
7890 /* [temp.deduct.type] A template-argument can be deduced from a pointer
7891 to function or pointer to member function argument if the set of
7892 overloaded functions does not contain function templates and at most
7893 one of a set of overloaded functions provides a unique match.
7895 So if we found multiple possibilities, we return success but don't
7900 int i
= TREE_VEC_LENGTH (targs
);
7902 if (TREE_VEC_ELT (tempargs
, i
))
7903 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (tempargs
, i
);
7911 /* Subroutine of resolve_overloaded_unification; does deduction for a single
7912 overload. Fills TARGS with any deduced arguments, or error_mark_node if
7913 different overloads deduce different arguments for a given parm.
7914 Returns 1 on success. */
7917 try_one_overload (tparms
, orig_targs
, targs
, parm
, arg
, strict
,
7919 tree tparms
, orig_targs
, targs
, parm
, arg
;
7920 unification_kind_t strict
;
7927 /* [temp.deduct.type] A template-argument can be deduced from a pointer
7928 to function or pointer to member function argument if the set of
7929 overloaded functions does not contain function templates and at most
7930 one of a set of overloaded functions provides a unique match.
7932 So if this is a template, just return success. */
7934 if (uses_template_parms (arg
))
7937 maybe_adjust_types_for_deduction (strict
, &parm
, &arg
);
7939 /* We don't copy orig_targs for this because if we have already deduced
7940 some template args from previous args, unify would complain when we
7941 try to deduce a template parameter for the same argument, even though
7942 there isn't really a conflict. */
7943 nargs
= TREE_VEC_LENGTH (targs
);
7944 tempargs
= make_tree_vec (nargs
);
7946 if (unify (tparms
, tempargs
, parm
, arg
, sub_strict
) != 0)
7949 /* First make sure we didn't deduce anything that conflicts with
7950 explicitly specified args. */
7951 for (i
= nargs
; i
--; )
7953 tree elt
= TREE_VEC_ELT (tempargs
, i
);
7954 tree oldelt
= TREE_VEC_ELT (orig_targs
, i
);
7956 if (elt
== NULL_TREE
)
7958 else if (uses_template_parms (elt
))
7960 /* Since we're unifying against ourselves, we will fill in template
7961 args used in the function parm list with our own template parms.
7963 TREE_VEC_ELT (tempargs
, i
) = NULL_TREE
;
7966 else if (oldelt
&& ! template_args_equal (oldelt
, elt
))
7970 for (i
= nargs
; i
--; )
7972 tree elt
= TREE_VEC_ELT (tempargs
, i
);
7975 TREE_VEC_ELT (targs
, i
) = elt
;
7981 /* PARM is a template class (perhaps with unbound template
7982 parameters). ARG is a fully instantiated type. If ARG can be
7983 bound to PARM, return ARG, otherwise return NULL_TREE. TPARMS and
7984 TARGS are as for unify. */
7987 try_class_unification (tparms
, targs
, parm
, arg
)
7996 if (!CLASSTYPE_TEMPLATE_INFO (arg
)
7997 || CLASSTYPE_TI_TEMPLATE (arg
) != CLASSTYPE_TI_TEMPLATE (parm
))
8000 /* We need to make a new template argument vector for the call to
8001 unify. If we used TARGS, we'd clutter it up with the result of
8002 the attempted unification, even if this class didn't work out.
8003 We also don't want to commit ourselves to all the unifications
8004 we've already done, since unification is supposed to be done on
8005 an argument-by-argument basis. In other words, consider the
8006 following pathological case:
8008 template <int I, int J, int K>
8011 template <int I, int J>
8012 struct S<I, J, 2> : public S<I, I, I>, S<J, J, J> {};
8014 template <int I, int J, int K>
8015 void f(S<I, J, K>, S<I, I, I>);
8024 Now, by the time we consider the unification involving `s2', we
8025 already know that we must have `f<0, 0, 0>'. But, even though
8026 `S<0, 1, 2>' is derived from `S<0, 0, 0>', the code is not legal
8027 because there are two ways to unify base classes of S<0, 1, 2>
8028 with S<I, I, I>. If we kept the already deduced knowledge, we
8029 would reject the possibility I=1. */
8030 copy_of_targs
= make_tree_vec (TREE_VEC_LENGTH (targs
));
8031 i
= unify (tparms
, copy_of_targs
, CLASSTYPE_TI_ARGS (parm
),
8032 CLASSTYPE_TI_ARGS (arg
), UNIFY_ALLOW_NONE
);
8034 /* If unification failed, we're done. */
8041 /* Subroutine of get_template_base. RVAL, if non-NULL, is a base we
8042 have alreay discovered to be satisfactory. ARG_BINFO is the binfo
8043 for the base class of ARG that we are currently examining. */
8046 get_template_base_recursive (tparms
, targs
, parm
,
8047 arg_binfo
, rval
, flags
)
8057 tree arg
= BINFO_TYPE (arg_binfo
);
8059 if (!(flags
& GTB_IGNORE_TYPE
))
8061 tree r
= try_class_unification (tparms
, targs
,
8064 /* If there is more than one satisfactory baseclass, then:
8068 If they yield more than one possible deduced A, the type
8072 if (r
&& rval
&& !same_type_p (r
, rval
))
8073 return error_mark_node
;
8078 binfos
= BINFO_BASETYPES (arg_binfo
);
8079 n_baselinks
= binfos
? TREE_VEC_LENGTH (binfos
) : 0;
8081 /* Process base types. */
8082 for (i
= 0; i
< n_baselinks
; i
++)
8084 tree base_binfo
= TREE_VEC_ELT (binfos
, i
);
8087 /* Skip this base, if we've already seen it. */
8088 if (BINFO_MARKED (base_binfo
))
8092 (flags
& GTB_VIA_VIRTUAL
) || TREE_VIA_VIRTUAL (base_binfo
);
8094 /* When searching for a non-virtual, we cannot mark virtually
8097 SET_BINFO_MARKED (base_binfo
);
8099 rval
= get_template_base_recursive (tparms
, targs
,
8103 GTB_VIA_VIRTUAL
* this_virtual
);
8105 /* If we discovered more than one matching base class, we can
8107 if (rval
== error_mark_node
)
8108 return error_mark_node
;
8114 /* Given a template type PARM and a class type ARG, find the unique
8115 base type in ARG that is an instance of PARM. We do not examine
8116 ARG itself; only its base-classes. If there is no appropriate base
8117 class, return NULL_TREE. If there is more than one, return
8118 error_mark_node. PARM may be the type of a partial specialization,
8119 as well as a plain template type. Used by unify. */
8122 get_template_base (tparms
, targs
, parm
, arg
)
8131 my_friendly_assert (IS_AGGR_TYPE_CODE (TREE_CODE (arg
)), 92);
8133 arg_binfo
= TYPE_BINFO (complete_type (arg
));
8134 rval
= get_template_base_recursive (tparms
, targs
,
8139 /* Since get_template_base_recursive marks the bases classes, we
8140 must unmark them here. */
8141 dfs_walk (arg_binfo
, dfs_unmark
, markedp
, 0);
8146 /* Returns the level of DECL, which declares a template parameter. */
8149 template_decl_level (decl
)
8152 switch (TREE_CODE (decl
))
8156 return TEMPLATE_TYPE_LEVEL (TREE_TYPE (decl
));
8159 return TEMPLATE_PARM_LEVEL (DECL_INITIAL (decl
));
8162 my_friendly_abort (0);
8167 /* Decide whether ARG can be unified with PARM, considering only the
8168 cv-qualifiers of each type, given STRICT as documented for unify.
8169 Returns non-zero iff the unification is OK on that basis.*/
8172 check_cv_quals_for_unify (strict
, arg
, parm
)
8177 if (!(strict
& UNIFY_ALLOW_MORE_CV_QUAL
)
8178 && !at_least_as_qualified_p (arg
, parm
))
8181 if (!(strict
& UNIFY_ALLOW_LESS_CV_QUAL
)
8182 && !at_least_as_qualified_p (parm
, arg
))
8188 /* Takes parameters as for type_unification. Returns 0 if the
8189 type deduction suceeds, 1 otherwise. The parameter STRICT is a
8190 bitwise or of the following flags:
8193 Require an exact match between PARM and ARG.
8194 UNIFY_ALLOW_MORE_CV_QUAL:
8195 Allow the deduced ARG to be more cv-qualified than ARG.
8196 UNIFY_ALLOW_LESS_CV_QUAL:
8197 Allow the deduced ARG to be less cv-qualified than ARG.
8198 UNIFY_ALLOW_DERIVED:
8199 Allow the deduced ARG to be a template base class of ARG,
8200 or a pointer to a template base class of the type pointed to by
8202 UNIFY_ALLOW_INTEGER:
8203 Allow any integral type to be deduced. See the TEMPLATE_PARM_INDEX
8204 case for more information. */
8207 unify (tparms
, targs
, parm
, arg
, strict
)
8208 tree tparms
, targs
, parm
, arg
;
8215 /* I don't think this will do the right thing with respect to types.
8216 But the only case I've seen it in so far has been array bounds, where
8217 signedness is the only information lost, and I think that will be
8219 while (TREE_CODE (parm
) == NOP_EXPR
)
8220 parm
= TREE_OPERAND (parm
, 0);
8222 if (arg
== error_mark_node
)
8224 if (arg
== unknown_type_node
)
8225 /* We can't deduce anything from this, but we might get all the
8226 template args from other function args. */
8229 /* If PARM uses template parameters, then we can't bail out here,
8230 even if ARG == PARM, since we won't record unifications for the
8231 template parameters. We might need them if we're trying to
8232 figure out which of two things is more specialized. */
8233 if (arg
== parm
&& !uses_template_parms (parm
))
8236 /* Immediately reject some pairs that won't unify because of
8237 cv-qualification mismatches. */
8238 if (TREE_CODE (arg
) == TREE_CODE (parm
)
8239 && TREE_CODE_CLASS (TREE_CODE (arg
)) == 't'
8240 /* We check the cv-qualifiers when unifying with template type
8241 parameters below. We want to allow ARG `const T' to unify with
8242 PARM `T' for example, when computing which of two templates
8243 is more specialized, for example. */
8244 && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
8245 && !check_cv_quals_for_unify (strict
, arg
, parm
))
8248 switch (TREE_CODE (parm
))
8251 /* In a type which contains a nested-name-specifier, template
8252 argument values cannot be deduced for template parameters used
8253 within the nested-name-specifier. */
8256 case TEMPLATE_TYPE_PARM
:
8257 case TEMPLATE_TEMPLATE_PARM
:
8258 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
8260 if (TEMPLATE_TYPE_LEVEL (parm
)
8261 != template_decl_level (tparm
))
8262 /* The PARM is not one we're trying to unify. Just check
8263 to see if it matches ARG. */
8264 return (TREE_CODE (arg
) == TREE_CODE (parm
)
8265 && same_type_p (parm
, arg
)) ? 0 : 1;
8266 idx
= TEMPLATE_TYPE_IDX (parm
);
8267 targ
= TREE_VEC_ELT (targs
, idx
);
8268 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, idx
));
8270 /* Check for mixed types and values. */
8271 if ((TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
8272 && TREE_CODE (tparm
) != TYPE_DECL
)
8273 || (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
8274 && TREE_CODE (tparm
) != TEMPLATE_DECL
))
8277 if (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
)
8279 if (TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (parm
))
8281 /* We arrive here when PARM does not involve template
8284 /* ARG must be constructed from a template class. */
8285 if (TREE_CODE (arg
) != RECORD_TYPE
|| !CLASSTYPE_TEMPLATE_INFO (arg
))
8289 tree parmtmpl
= TYPE_TI_TEMPLATE (parm
);
8290 tree parmvec
= TYPE_TI_ARGS (parm
);
8291 tree argvec
= CLASSTYPE_TI_ARGS (arg
);
8293 = DECL_INNERMOST_TEMPLATE_PARMS (CLASSTYPE_TI_TEMPLATE (arg
));
8296 /* The parameter and argument roles have to be switched here
8297 in order to handle default arguments properly. For example,
8298 template<template <class> class TT> void f(TT<int>)
8299 should be able to accept vector<int> which comes from
8300 template <class T, class Allocator = allocator>
8303 if (coerce_template_parms (argtmplvec
, parmvec
, parmtmpl
, 0, 1)
8307 /* Deduce arguments T, i from TT<T> or TT<i>.
8308 We check each element of PARMVEC and ARGVEC individually
8309 rather than the whole TREE_VEC since they can have
8310 different number of elements. */
8312 for (i
= 0; i
< TREE_VEC_LENGTH (parmvec
); ++i
)
8314 tree t
= TREE_VEC_ELT (parmvec
, i
);
8316 if (unify (tparms
, targs
, t
,
8317 TREE_VEC_ELT (argvec
, i
),
8322 arg
= CLASSTYPE_TI_TEMPLATE (arg
);
8327 /* If PARM is `const T' and ARG is only `int', we don't have
8328 a match unless we are allowing additional qualification.
8329 If ARG is `const int' and PARM is just `T' that's OK;
8330 that binds `const int' to `T'. */
8331 if (!check_cv_quals_for_unify (strict
| UNIFY_ALLOW_LESS_CV_QUAL
,
8335 /* Consider the case where ARG is `const volatile int' and
8336 PARM is `const T'. Then, T should be `volatile int'. */
8338 cp_build_qualified_type_real (arg
,
8340 & ~CP_TYPE_QUALS (parm
),
8342 if (arg
== error_mark_node
)
8346 /* Simple cases: Value already set, does match or doesn't. */
8347 if (targ
!= NULL_TREE
&& same_type_p (targ
, arg
))
8352 /* Make sure that ARG is not a variable-sized array. (Note that
8353 were talking about variable-sized arrays (like `int[n]'),
8354 rather than arrays of unknown size (like `int[]').) We'll
8355 get very confused by such a type since the bound of the array
8356 will not be computable in an instantiation. Besides, such
8357 types are not allowed in ISO C++, so we can do as we please
8359 if (TREE_CODE (arg
) == ARRAY_TYPE
8360 && !uses_template_parms (arg
)
8361 && (TREE_CODE (TYPE_MAX_VALUE (TYPE_DOMAIN (arg
)))
8365 TREE_VEC_ELT (targs
, idx
) = arg
;
8368 case TEMPLATE_PARM_INDEX
:
8369 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
8371 if (TEMPLATE_PARM_LEVEL (parm
)
8372 != template_decl_level (tparm
))
8373 /* The PARM is not one we're trying to unify. Just check
8374 to see if it matches ARG. */
8375 return (TREE_CODE (arg
) == TREE_CODE (parm
)
8376 && cp_tree_equal (parm
, arg
) > 0) ? 0 : 1;
8378 idx
= TEMPLATE_PARM_IDX (parm
);
8379 targ
= TREE_VEC_ELT (targs
, idx
);
8383 int i
= (cp_tree_equal (targ
, arg
) > 0);
8389 my_friendly_abort (42);
8392 /* [temp.deduct.type] If, in the declaration of a function template
8393 with a non-type template-parameter, the non-type
8394 template-parameter is used in an expression in the function
8395 parameter-list and, if the corresponding template-argument is
8396 deduced, the template-argument type shall match the type of the
8397 template-parameter exactly, except that a template-argument
8398 deduced from an array bound may be of any integral type. */
8399 if (same_type_p (TREE_TYPE (arg
), TREE_TYPE (parm
)))
8401 else if ((strict
& UNIFY_ALLOW_INTEGER
)
8402 && (TREE_CODE (TREE_TYPE (parm
)) == INTEGER_TYPE
8403 || TREE_CODE (TREE_TYPE (parm
)) == BOOLEAN_TYPE
))
8408 TREE_VEC_ELT (targs
, idx
) = arg
;
8415 if (TREE_CODE (arg
) != POINTER_TYPE
)
8418 /* [temp.deduct.call]
8420 A can be another pointer or pointer to member type that can
8421 be converted to the deduced A via a qualification
8422 conversion (_conv.qual_).
8424 We pass down STRICT here rather than UNIFY_ALLOW_NONE.
8425 This will allow for additional cv-qualification of the
8426 pointed-to types if appropriate. In general, this is a bit
8427 too generous; we are only supposed to allow qualification
8428 conversions and this method will allow an ARG of char** and
8429 a deduced ARG of const char**. However, overload
8430 resolution will subsequently invalidate the candidate, so
8431 this is probably OK. */
8432 sub_strict
= strict
;
8434 if (TREE_CODE (TREE_TYPE (arg
)) != RECORD_TYPE
)
8435 /* The derived-to-base conversion only persists through one
8436 level of pointers. */
8437 sub_strict
&= ~UNIFY_ALLOW_DERIVED
;
8439 return unify (tparms
, targs
, TREE_TYPE (parm
),
8440 TREE_TYPE (arg
), sub_strict
);
8443 case REFERENCE_TYPE
:
8444 if (TREE_CODE (arg
) != REFERENCE_TYPE
)
8446 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
8450 if (TREE_CODE (arg
) != ARRAY_TYPE
)
8452 if ((TYPE_DOMAIN (parm
) == NULL_TREE
)
8453 != (TYPE_DOMAIN (arg
) == NULL_TREE
))
8455 if (TYPE_DOMAIN (parm
) != NULL_TREE
8456 && unify (tparms
, targs
, TYPE_DOMAIN (parm
),
8457 TYPE_DOMAIN (arg
), UNIFY_ALLOW_NONE
) != 0)
8459 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
8467 if (TREE_CODE (arg
) != TREE_CODE (parm
))
8470 if (TREE_CODE (parm
) == INTEGER_TYPE
8471 && TREE_CODE (TYPE_MAX_VALUE (parm
)) != INTEGER_CST
)
8473 if (TYPE_MIN_VALUE (parm
) && TYPE_MIN_VALUE (arg
)
8474 && unify (tparms
, targs
, TYPE_MIN_VALUE (parm
),
8475 TYPE_MIN_VALUE (arg
), UNIFY_ALLOW_INTEGER
))
8477 if (TYPE_MAX_VALUE (parm
) && TYPE_MAX_VALUE (arg
)
8478 && unify (tparms
, targs
, TYPE_MAX_VALUE (parm
),
8479 TYPE_MAX_VALUE (arg
), UNIFY_ALLOW_INTEGER
))
8482 /* We use the TYPE_MAIN_VARIANT since we have already
8483 checked cv-qualification at the top of the
8485 else if (!same_type_p (TYPE_MAIN_VARIANT (arg
),
8486 TYPE_MAIN_VARIANT (parm
)))
8489 /* As far as unification is concerned, this wins. Later checks
8490 will invalidate it if necessary. */
8493 /* Types INTEGER_CST and MINUS_EXPR can come from array bounds. */
8494 /* Type INTEGER_CST can come from ordinary constant template args. */
8496 while (TREE_CODE (arg
) == NOP_EXPR
)
8497 arg
= TREE_OPERAND (arg
, 0);
8499 if (TREE_CODE (arg
) != INTEGER_CST
)
8501 return !tree_int_cst_equal (parm
, arg
);
8506 if (TREE_CODE (arg
) != TREE_VEC
)
8508 if (TREE_VEC_LENGTH (parm
) != TREE_VEC_LENGTH (arg
))
8510 for (i
= TREE_VEC_LENGTH (parm
) - 1; i
>= 0; i
--)
8511 if (unify (tparms
, targs
,
8512 TREE_VEC_ELT (parm
, i
), TREE_VEC_ELT (arg
, i
),
8520 if (TREE_CODE (arg
) != TREE_CODE (parm
))
8523 if (TYPE_PTRMEMFUNC_P (parm
))
8525 if (!TYPE_PTRMEMFUNC_P (arg
))
8528 return unify (tparms
, targs
,
8529 TYPE_PTRMEMFUNC_FN_TYPE (parm
),
8530 TYPE_PTRMEMFUNC_FN_TYPE (arg
),
8534 if (CLASSTYPE_TEMPLATE_INFO (parm
))
8538 if (strict
& UNIFY_ALLOW_DERIVED
)
8540 /* First, we try to unify the PARM and ARG directly. */
8541 t
= try_class_unification (tparms
, targs
,
8546 /* Fallback to the special case allowed in
8549 If P is a class, and P has the form
8550 template-id, then A can be a derived class of
8551 the deduced A. Likewise, if P is a pointer to
8552 a class of the form template-id, A can be a
8553 pointer to a derived class pointed to by the
8555 t
= get_template_base (tparms
, targs
,
8558 if (! t
|| t
== error_mark_node
)
8562 else if (CLASSTYPE_TEMPLATE_INFO (arg
)
8563 && (CLASSTYPE_TI_TEMPLATE (parm
)
8564 == CLASSTYPE_TI_TEMPLATE (arg
)))
8565 /* Perhaps PARM is something like S<U> and ARG is S<int>.
8566 Then, we should unify `int' and `U'. */
8569 /* There's no chance of unication succeeding. */
8572 return unify (tparms
, targs
, CLASSTYPE_TI_ARGS (parm
),
8573 CLASSTYPE_TI_ARGS (t
), UNIFY_ALLOW_NONE
);
8575 else if (!same_type_p (TYPE_MAIN_VARIANT (parm
),
8576 TYPE_MAIN_VARIANT (arg
)))
8582 if (TREE_CODE (arg
) != TREE_CODE (parm
))
8585 if (unify (tparms
, targs
, TREE_TYPE (parm
),
8586 TREE_TYPE (arg
), UNIFY_ALLOW_NONE
))
8588 return type_unification_real (tparms
, targs
, TYPE_ARG_TYPES (parm
),
8589 TYPE_ARG_TYPES (arg
), 1,
8593 if (TREE_CODE (arg
) != OFFSET_TYPE
)
8595 if (unify (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
8596 TYPE_OFFSET_BASETYPE (arg
), UNIFY_ALLOW_NONE
))
8598 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
8602 if (arg
!= decl_constant_value (parm
))
8607 /* Matched cases are handled by the ARG == PARM test above. */
8611 if (TREE_CODE (TREE_OPERAND (parm
, 1)) == INTEGER_CST
)
8613 /* We handle this case specially, since it comes up with
8614 arrays. In particular, something like:
8616 template <int N> void f(int (&x)[N]);
8618 Here, we are trying to unify the range type, which
8619 looks like [0 ... (N - 1)]. */
8621 t1
= TREE_OPERAND (parm
, 0);
8622 t2
= TREE_OPERAND (parm
, 1);
8624 t
= fold (build (PLUS_EXPR
, integer_type_node
, arg
, t2
));
8626 return unify (tparms
, targs
, t1
, t
, strict
);
8628 /* else fall through */
8631 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (parm
))))
8632 /* We're looking at an expression. This can happen with
8636 void foo(S<I>, S<I + 2>);
8638 This is a "nondeduced context":
8642 The nondeduced contexts are:
8644 --A type that is a template-id in which one or more of
8645 the template-arguments is an expression that references
8646 a template-parameter.
8648 In these cases, we assume deduction succeeded, but don't
8649 actually infer any unifications. */
8652 sorry ("use of `%s' in template type unification",
8653 tree_code_name
[(int) TREE_CODE (parm
)]);
8659 /* Called if RESULT is explicitly instantiated, or is a member of an
8660 explicitly instantiated class, or if using -frepo and the
8661 instantiation of RESULT has been assigned to this file. */
8664 mark_decl_instantiated (result
, extern_p
)
8668 if (TREE_CODE (result
) != FUNCTION_DECL
)
8669 /* The TREE_PUBLIC flag for function declarations will have been
8670 set correctly by tsubst. */
8671 TREE_PUBLIC (result
) = 1;
8675 DECL_INTERFACE_KNOWN (result
) = 1;
8676 DECL_NOT_REALLY_EXTERN (result
) = 1;
8678 /* Always make artificials weak. */
8679 if (DECL_ARTIFICIAL (result
) && flag_weak
)
8680 comdat_linkage (result
);
8681 /* For WIN32 we also want to put explicit instantiations in
8682 linkonce sections. */
8683 else if (TREE_PUBLIC (result
))
8684 maybe_make_one_only (result
);
8686 else if (TREE_CODE (result
) == FUNCTION_DECL
)
8687 mark_inline_for_output (result
);
8690 /* Given two function templates PAT1 and PAT2, and explicit template
8691 arguments EXPLICIT_ARGS return:
8693 1 if PAT1 is more specialized than PAT2 as described in [temp.func.order].
8694 -1 if PAT2 is more specialized than PAT1.
8695 0 if neither is more specialized. */
8698 more_specialized (pat1
, pat2
, explicit_args
)
8699 tree pat1
, pat2
, explicit_args
;
8704 targs
= get_bindings_overload (pat1
, DECL_RESULT (pat2
), explicit_args
);
8708 targs
= get_bindings_overload (pat2
, DECL_RESULT (pat1
), explicit_args
);
8715 /* Given two class template specialization list nodes PAT1 and PAT2, return:
8717 1 if PAT1 is more specialized than PAT2 as described in [temp.class.order].
8718 -1 if PAT2 is more specialized than PAT1.
8719 0 if neither is more specialized. */
8722 more_specialized_class (pat1
, pat2
)
8728 targs
= get_class_bindings (TREE_VALUE (pat1
), TREE_PURPOSE (pat1
),
8729 TREE_PURPOSE (pat2
));
8733 targs
= get_class_bindings (TREE_VALUE (pat2
), TREE_PURPOSE (pat2
),
8734 TREE_PURPOSE (pat1
));
8741 /* Return the template arguments that will produce the function signature
8742 DECL from the function template FN, with the explicit template
8743 arguments EXPLICIT_ARGS. If CHECK_RETTYPE is 1, the return type must
8744 also match. Return NULL_TREE if no satisfactory arguments could be
8748 get_bindings_real (fn
, decl
, explicit_args
, check_rettype
)
8749 tree fn
, decl
, explicit_args
;
8752 int ntparms
= DECL_NTPARMS (fn
);
8753 tree targs
= make_tree_vec (ntparms
);
8755 tree decl_arg_types
;
8758 /* Substitute the explicit template arguments into the type of DECL.
8759 The call to fn_type_unification will handle substitution into the
8761 decl_type
= TREE_TYPE (decl
);
8762 if (explicit_args
&& uses_template_parms (decl_type
))
8765 tree converted_args
;
8767 if (DECL_TEMPLATE_INFO (decl
))
8768 tmpl
= DECL_TI_TEMPLATE (decl
);
8770 /* We can get here for some illegal specializations. */
8774 = (coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
8775 explicit_args
, NULL_TREE
,
8777 /*require_all_arguments=*/0));
8778 if (converted_args
== error_mark_node
)
8781 decl_type
= tsubst (decl_type
, converted_args
, /*complain=*/0,
8783 if (decl_type
== error_mark_node
)
8787 /* If FN is a static member function, adjust the type of DECL
8789 decl_arg_types
= TYPE_ARG_TYPES (decl_type
);
8790 if (DECL_STATIC_FUNCTION_P (fn
)
8791 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
8792 decl_arg_types
= TREE_CHAIN (decl_arg_types
);
8794 i
= fn_type_unification (fn
, explicit_args
, targs
,
8796 TREE_TYPE (decl_type
),
8804 /* Check to see that the resulting return type is also OK. */
8805 tree t
= tsubst (TREE_TYPE (TREE_TYPE (fn
)), targs
,
8806 /*complain=*/0, NULL_TREE
);
8808 if (!same_type_p (t
, TREE_TYPE (TREE_TYPE (decl
))))
8815 /* For most uses, we want to check the return type. */
8818 get_bindings (fn
, decl
, explicit_args
)
8819 tree fn
, decl
, explicit_args
;
8821 return get_bindings_real (fn
, decl
, explicit_args
, 1);
8824 /* But for more_specialized, we only care about the parameter types. */
8827 get_bindings_overload (fn
, decl
, explicit_args
)
8828 tree fn
, decl
, explicit_args
;
8830 return get_bindings_real (fn
, decl
, explicit_args
, 0);
8833 /* Return the innermost template arguments that, when applied to a
8834 template specialization whose innermost template parameters are
8835 TPARMS, and whose specialization arguments are ARGS, yield the
8838 For example, suppose we have:
8840 template <class T, class U> struct S {};
8841 template <class T> struct S<T*, int> {};
8843 Then, suppose we want to get `S<double*, int>'. The TPARMS will be
8844 {T}, the PARMS will be {T*, int} and the ARGS will be {double*,
8845 int}. The resulting vector will be {double}, indicating that `T'
8846 is bound to `double'. */
8849 get_class_bindings (tparms
, parms
, args
)
8850 tree tparms
, parms
, args
;
8852 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
8853 tree vec
= make_tree_vec (ntparms
);
8855 args
= innermost_args (args
);
8857 if (unify (tparms
, vec
, parms
, args
, UNIFY_ALLOW_NONE
))
8860 for (i
= 0; i
< ntparms
; ++i
)
8861 if (! TREE_VEC_ELT (vec
, i
))
8867 /* In INSTANTIATIONS is a list of <INSTANTIATION, TEMPLATE> pairs.
8868 Pick the most specialized template, and return the corresponding
8869 instantiation, or if there is no corresponding instantiation, the
8870 template itself. EXPLICIT_ARGS is any template arguments explicity
8871 mentioned in a template-id. If there is no most specialized
8872 tempalte, error_mark_node is returned. If there are no templates
8873 at all, NULL_TREE is returned. */
8876 most_specialized_instantiation (instantiations
, explicit_args
)
8877 tree instantiations
;
8883 if (!instantiations
)
8886 champ
= instantiations
;
8887 for (fn
= TREE_CHAIN (instantiations
); fn
; fn
= TREE_CHAIN (fn
))
8889 fate
= more_specialized (TREE_VALUE (champ
),
8890 TREE_VALUE (fn
), explicit_args
);
8897 fn
= TREE_CHAIN (fn
);
8899 return error_mark_node
;
8905 for (fn
= instantiations
; fn
&& fn
!= champ
; fn
= TREE_CHAIN (fn
))
8907 fate
= more_specialized (TREE_VALUE (champ
),
8908 TREE_VALUE (fn
), explicit_args
);
8910 return error_mark_node
;
8913 return TREE_PURPOSE (champ
) ? TREE_PURPOSE (champ
) : TREE_VALUE (champ
);
8916 /* Return the most specialized of the list of templates in FNS that can
8917 produce an instantiation matching DECL, given the explicit template
8918 arguments EXPLICIT_ARGS. */
8921 most_specialized (fns
, decl
, explicit_args
)
8922 tree fns
, decl
, explicit_args
;
8924 tree candidates
= NULL_TREE
;
8927 for (fn
= fns
; fn
; fn
= TREE_CHAIN (fn
))
8929 tree candidate
= TREE_VALUE (fn
);
8931 args
= get_bindings (candidate
, decl
, explicit_args
);
8933 candidates
= tree_cons (NULL_TREE
, candidate
, candidates
);
8936 return most_specialized_instantiation (candidates
, explicit_args
);
8939 /* If DECL is a specialization of some template, return the most
8940 general such template. For example, given:
8942 template <class T> struct S { template <class U> void f(U); };
8944 if TMPL is `template <class U> void S<int>::f(U)' this will return
8945 the full template. This function will not trace past partial
8946 specializations, however. For example, given in addition:
8948 template <class T> struct S<T*> { template <class U> void f(U); };
8950 if TMPL is `template <class U> void S<int*>::f(U)' this will return
8951 `template <class T> template <class U> S<T*>::f(U)'. */
8954 most_general_template (decl
)
8957 while (DECL_TEMPLATE_INFO (decl
)
8958 /* The DECL_TI_TEMPLATE can be a LOOKUP_EXPR or
8959 IDENTIFIER_NODE in some cases. (See cp-tree.h for
8961 && TREE_CODE (DECL_TI_TEMPLATE (decl
)) == TEMPLATE_DECL
)
8962 decl
= DECL_TI_TEMPLATE (decl
);
8967 /* Return the most specialized of the class template specializations
8968 of TMPL which can produce an instantiation matching ARGS, or
8969 error_mark_node if the choice is ambiguous. */
8972 most_specialized_class (tmpl
, args
)
8976 tree list
= NULL_TREE
;
8981 tmpl
= most_general_template (tmpl
);
8982 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
); t
; t
= TREE_CHAIN (t
))
8985 = get_class_bindings (TREE_VALUE (t
), TREE_PURPOSE (t
), args
);
8988 list
= decl_tree_cons (TREE_PURPOSE (t
), TREE_VALUE (t
), list
);
8989 TREE_TYPE (list
) = TREE_TYPE (t
);
8999 for (; t
; t
= TREE_CHAIN (t
))
9001 fate
= more_specialized_class (champ
, t
);
9010 return error_mark_node
;
9016 for (t
= list
; t
&& t
!= champ
; t
= TREE_CHAIN (t
))
9018 fate
= more_specialized_class (champ
, t
);
9020 return error_mark_node
;
9026 /* called from the parser. */
9029 do_decl_instantiation (declspecs
, declarator
, storage
)
9030 tree declspecs
, declarator
, storage
;
9032 tree decl
= grokdeclarator (declarator
, declspecs
, NORMAL
, 0, NULL_TREE
);
9033 tree result
= NULL_TREE
;
9037 /* An error ocurred, for which grokdeclarator has already issued
9038 an appropriate message. */
9040 else if (! DECL_LANG_SPECIFIC (decl
))
9042 cp_error ("explicit instantiation of non-template `%#D'", decl
);
9045 else if (TREE_CODE (decl
) == VAR_DECL
)
9047 /* There is an asymmetry here in the way VAR_DECLs and
9048 FUNCTION_DECLs are handled by grokdeclarator. In the case of
9049 the latter, the DECL we get back will be marked as a
9050 template instantiation, and the appropriate
9051 DECL_TEMPLATE_INFO will be set up. This does not happen for
9052 VAR_DECLs so we do the lookup here. Probably, grokdeclarator
9053 should handle VAR_DECLs as it currently handles
9055 result
= lookup_field (DECL_CONTEXT (decl
), DECL_NAME (decl
), 0, 0);
9056 if (result
&& TREE_CODE (result
) != VAR_DECL
)
9058 cp_error ("no matching template for `%D' found", result
);
9062 else if (TREE_CODE (decl
) != FUNCTION_DECL
)
9064 cp_error ("explicit instantiation of `%#D'", decl
);
9070 /* Check for various error cases. Note that if the explicit
9071 instantiation is legal the RESULT will currently be marked as an
9072 *implicit* instantiation; DECL_EXPLICIT_INSTANTIATION is not set
9073 until we get here. */
9075 if (DECL_TEMPLATE_SPECIALIZATION (result
))
9079 No program shall both explicitly instantiate and explicitly
9080 specialize a template. */
9081 cp_pedwarn ("explicit instantiation of `%#D' after", result
);
9082 cp_pedwarn_at ("explicit specialization here", result
);
9085 else if (DECL_EXPLICIT_INSTANTIATION (result
))
9089 No program shall explicitly instantiate any template more
9092 We check DECL_INTERFACE_KNOWN so as not to complain when the first
9093 instantiation was `extern' and the second is not, and EXTERN_P for
9094 the opposite case. If -frepo, chances are we already got marked
9095 as an explicit instantion because of the repo file. */
9096 if (DECL_INTERFACE_KNOWN (result
) && !extern_p
&& !flag_use_repository
)
9097 cp_pedwarn ("duplicate explicit instantiation of `%#D'", result
);
9099 /* If we've already instantiated the template, just return now. */
9100 if (DECL_INTERFACE_KNOWN (result
))
9103 else if (!DECL_IMPLICIT_INSTANTIATION (result
))
9105 cp_error ("no matching template for `%D' found", result
);
9108 else if (!DECL_TEMPLATE_INFO (result
))
9110 cp_pedwarn ("explicit instantiation of non-template `%#D'", result
);
9114 if (flag_external_templates
)
9117 if (storage
== NULL_TREE
)
9119 else if (storage
== ridpointers
[(int) RID_EXTERN
])
9122 cp_pedwarn ("ISO C++ forbids the use of `extern' on explicit instantiations");
9126 cp_error ("storage class `%D' applied to template instantiation",
9129 SET_DECL_EXPLICIT_INSTANTIATION (result
);
9130 mark_decl_instantiated (result
, extern_p
);
9131 repo_template_instantiated (result
, extern_p
);
9133 instantiate_decl (result
);
9137 mark_class_instantiated (t
, extern_p
)
9141 SET_CLASSTYPE_EXPLICIT_INSTANTIATION (t
);
9142 SET_CLASSTYPE_INTERFACE_KNOWN (t
);
9143 CLASSTYPE_INTERFACE_ONLY (t
) = extern_p
;
9144 CLASSTYPE_VTABLE_NEEDS_WRITING (t
) = ! extern_p
;
9145 TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (t
)) = extern_p
;
9148 CLASSTYPE_DEBUG_REQUESTED (t
) = 1;
9149 rest_of_type_compilation (t
, 1);
9154 do_type_instantiation (t
, storage
)
9161 if (TREE_CODE (t
) == TYPE_DECL
)
9164 if (! CLASS_TYPE_P (t
) || ! CLASSTYPE_TEMPLATE_INFO (t
))
9166 cp_error ("explicit instantiation of non-template type `%T'", t
);
9172 /* With -fexternal-templates, explicit instantiations are treated the same
9173 as implicit ones. */
9174 if (flag_external_templates
)
9177 if (TYPE_SIZE (t
) == NULL_TREE
)
9179 cp_error ("explicit instantiation of `%#T' before definition of template",
9184 if (storage
!= NULL_TREE
)
9187 cp_pedwarn("ISO C++ forbids the use of `%s' on explicit instantiations",
9188 IDENTIFIER_POINTER (storage
));
9190 if (storage
== ridpointers
[(int) RID_INLINE
])
9192 else if (storage
== ridpointers
[(int) RID_EXTERN
])
9194 else if (storage
== ridpointers
[(int) RID_STATIC
])
9198 cp_error ("storage class `%D' applied to template instantiation",
9204 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
9208 No program shall both explicitly instantiate and explicitly
9209 specialize a template. */
9210 cp_error ("explicit instantiation of `%#T' after", t
);
9211 cp_error_at ("explicit specialization here", t
);
9214 else if (CLASSTYPE_EXPLICIT_INSTANTIATION (t
))
9218 No program shall explicitly instantiate any template more
9221 If CLASSTYPE_INTERFACE_ONLY, then the first explicit instantiation
9222 was `extern'. If EXTERN_P then the second is. If -frepo, chances
9223 are we already got marked as an explicit instantion because of the
9224 repo file. All these cases are OK. */
9225 if (!CLASSTYPE_INTERFACE_ONLY (t
) && !extern_p
&& !flag_use_repository
)
9226 cp_pedwarn ("duplicate explicit instantiation of `%#T'", t
);
9228 /* If we've already instantiated the template, just return now. */
9229 if (!CLASSTYPE_INTERFACE_ONLY (t
))
9233 mark_class_instantiated (t
, extern_p
);
9234 repo_template_instantiated (t
, extern_p
);
9242 /* In contrast to implicit instantiation, where only the
9243 declarations, and not the definitions, of members are
9244 instantiated, we have here:
9248 The explicit instantiation of a class template specialization
9249 implies the instantiation of all of its members not
9250 previously explicitly specialized in the translation unit
9251 containing the explicit instantiation.
9253 Of course, we can't instantiate member template classes, since
9254 we don't have any arguments for them. Note that the standard
9255 is unclear on whether the instatiation of the members are
9256 *explicit* instantiations or not. We choose to be generous,
9257 and not set DECL_EXPLICIT_INSTANTIATION. Therefore, we allow
9258 the explicit instantiation of a class where some of the members
9259 have no definition in the current translation unit. */
9262 for (tmp
= TYPE_METHODS (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
9263 if (TREE_CODE (tmp
) == FUNCTION_DECL
9264 && DECL_TEMPLATE_INSTANTIATION (tmp
))
9266 mark_decl_instantiated (tmp
, extern_p
);
9267 repo_template_instantiated (tmp
, extern_p
);
9269 instantiate_decl (tmp
);
9272 for (tmp
= TYPE_FIELDS (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
9273 if (TREE_CODE (tmp
) == VAR_DECL
&& DECL_TEMPLATE_INSTANTIATION (tmp
))
9275 mark_decl_instantiated (tmp
, extern_p
);
9276 repo_template_instantiated (tmp
, extern_p
);
9278 instantiate_decl (tmp
);
9281 for (tmp
= CLASSTYPE_TAGS (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
9282 if (IS_AGGR_TYPE (TREE_VALUE (tmp
))
9283 && !uses_template_parms (CLASSTYPE_TI_ARGS (TREE_VALUE (tmp
))))
9284 do_type_instantiation (TYPE_MAIN_DECL (TREE_VALUE (tmp
)), storage
);
9288 /* Given a function DECL, which is a specialization of TMPL, modify
9289 DECL to be a re-instantiation of TMPL with the same template
9290 arguments. TMPL should be the template into which tsubst'ing
9291 should occur for DECL, not the most general template.
9293 One reason for doing this is a scenario like this:
9296 void f(const T&, int i);
9298 void g() { f(3, 7); }
9301 void f(const T& t, const int i) { }
9303 Note that when the template is first instantiated, with
9304 instantiate_template, the resulting DECL will have no name for the
9305 first parameter, and the wrong type for the second. So, when we go
9306 to instantiate the DECL, we regenerate it. */
9309 regenerate_decl_from_template (decl
, tmpl
)
9319 args
= DECL_TI_ARGS (decl
);
9320 code_pattern
= DECL_TEMPLATE_RESULT (tmpl
);
9322 /* Unregister the specialization so that when we tsubst we will not
9323 just return DECL. We don't have to unregister DECL from TMPL
9324 because if would only be registered there if it were a partial
9325 instantiation of a specialization, which it isn't: it's a full
9327 gen_tmpl
= most_general_template (tmpl
);
9328 unregistered
= unregister_specialization (decl
, gen_tmpl
);
9330 /* If the DECL was not unregistered then something peculiar is
9331 happening: we created a specialization but did not call
9332 register_specialization for it. */
9333 my_friendly_assert (unregistered
, 0);
9335 if (TREE_CODE (decl
) == VAR_DECL
)
9336 /* Make sure that we can see identifiers, and compute access
9337 correctly, for the class members used in the declaration of
9338 this static variable. */
9339 pushclass (DECL_CONTEXT (decl
), 2);
9341 /* Do the substitution to get the new declaration. */
9342 new_decl
= tsubst (code_pattern
, args
, /*complain=*/1, NULL_TREE
);
9344 if (TREE_CODE (decl
) == VAR_DECL
)
9346 /* Set up DECL_INITIAL, since tsubst doesn't. */
9347 DECL_INITIAL (new_decl
) =
9348 tsubst_expr (DECL_INITIAL (code_pattern
), args
,
9349 /*complain=*/1, DECL_TI_TEMPLATE (decl
));
9350 /* Pop the class context we pushed above. */
9353 else if (TREE_CODE (decl
) == FUNCTION_DECL
)
9355 /* Convince duplicate_decls to use the DECL_ARGUMENTS from the
9357 DECL_INITIAL (new_decl
) = error_mark_node
;
9358 /* And don't complain about a duplicate definition. */
9359 DECL_INITIAL (decl
) = NULL_TREE
;
9362 /* The immediate parent of the new template is still whatever it was
9363 before, even though tsubst sets DECL_TI_TEMPLATE up as the most
9364 general template. We also reset the DECL_ASSEMBLER_NAME since
9365 tsubst always calculates the name as if the function in question
9366 were really a template instance, and sometimes, with friend
9367 functions, this is not so. See tsubst_friend_function for
9369 DECL_TI_TEMPLATE (new_decl
) = DECL_TI_TEMPLATE (decl
);
9370 DECL_ASSEMBLER_NAME (new_decl
) = DECL_ASSEMBLER_NAME (decl
);
9371 DECL_RTL (new_decl
) = DECL_RTL (decl
);
9373 /* Call duplicate decls to merge the old and new declarations. */
9374 duplicate_decls (new_decl
, decl
);
9376 /* Now, re-register the specialization. */
9377 register_specialization (decl
, gen_tmpl
, args
);
9380 /* Produce the definition of D, a _DECL generated from a template. */
9383 instantiate_decl (d
)
9386 tree tmpl
= DECL_TI_TEMPLATE (d
);
9387 tree args
= DECL_TI_ARGS (d
);
9392 int nested
= in_function_p ();
9393 int pattern_defined
;
9395 char *file
= input_filename
;
9396 tree old_fn
= current_function_decl
;
9398 /* This function should only be used to instantiate templates for
9399 functions and static member variables. */
9400 my_friendly_assert (TREE_CODE (d
) == FUNCTION_DECL
9401 || TREE_CODE (d
) == VAR_DECL
, 0);
9403 if (DECL_TEMPLATE_INSTANTIATED (d
))
9404 /* D has already been instantiated. It might seem reasonable to
9405 check whether or not D is an explict instantiation, and, if so,
9406 stop here. But when an explicit instantiation is deferred
9407 until the end of the compilation, DECL_EXPLICIT_INSTANTIATION
9408 is set, even though we still need to do the instantiation. */
9411 /* If we already have a specialization of this declaration, then
9412 there's no reason to instantiate it. Note that
9413 retrieve_specialization gives us both instantiations and
9414 specializations, so we must explicitly check
9415 DECL_TEMPLATE_SPECIALIZATION. */
9416 gen_tmpl
= most_general_template (tmpl
);
9417 spec
= retrieve_specialization (gen_tmpl
, args
);
9418 if (spec
!= NULL_TREE
&& DECL_TEMPLATE_SPECIALIZATION (spec
))
9421 /* This needs to happen before any tsubsting. */
9422 if (! push_tinst_level (d
))
9425 /* Set TD to the template whose DECL_TEMPLATE_RESULT is the pattern
9426 for the instantiation. This is not always the most general
9427 template. Consider, for example:
9430 struct S { template <class U> void f();
9431 template <> void f<int>(); };
9433 and an instantiation of S<double>::f<int>. We want TD to be the
9434 specialization S<T>::f<int>, not the more general S<T>::f<U>. */
9437 /* An instantiation cannot have a definition, so we need a
9438 more general template. */
9439 DECL_TEMPLATE_INSTANTIATION (td
)
9440 /* We must also deal with friend templates. Given:
9442 template <class T> struct S {
9443 template <class U> friend void f() {};
9446 S<int>::f<U> say, is not an instantiation of S<T>::f<U>,
9447 so far as the language is concerned, but that's still
9448 where we get the pattern for the instantiation from. On
9449 ther hand, if the definition comes outside the class, say:
9451 template <class T> struct S {
9452 template <class U> friend void f();
9454 template <class U> friend void f() {}
9456 we don't need to look any further. That's what the check for
9457 DECL_INITIAL is for. */
9458 || (TREE_CODE (d
) == FUNCTION_DECL
9459 && DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (td
)
9460 && !DECL_INITIAL (DECL_TEMPLATE_RESULT (td
)));
9463 /* The present template, TD, should not be a definition. If it
9464 were a definition, we should be using it! Note that we
9465 cannot restructure the loop to just keep going until we find
9466 a template with a definition, since that might go too far if
9467 a specialization was declared, but not defined. */
9468 my_friendly_assert (!(TREE_CODE (d
) == VAR_DECL
9469 && !DECL_IN_AGGR_P (DECL_TEMPLATE_RESULT (td
))),
9472 /* Fetch the more general template. */
9473 td
= DECL_TI_TEMPLATE (td
);
9476 code_pattern
= DECL_TEMPLATE_RESULT (td
);
9478 if (TREE_CODE (d
) == FUNCTION_DECL
)
9479 pattern_defined
= (DECL_SAVED_TREE (code_pattern
) != NULL_TREE
);
9481 pattern_defined
= ! DECL_IN_AGGR_P (code_pattern
);
9483 push_to_top_level ();
9484 lineno
= DECL_SOURCE_LINE (d
);
9485 input_filename
= DECL_SOURCE_FILE (d
);
9487 if (pattern_defined
)
9489 repo_template_used (d
);
9491 if (flag_external_templates
&& ! DECL_INTERFACE_KNOWN (d
))
9493 if (flag_alt_external_templates
)
9495 if (interface_unknown
)
9496 warn_if_unknown_interface (d
);
9498 else if (DECL_INTERFACE_KNOWN (code_pattern
))
9500 DECL_INTERFACE_KNOWN (d
) = 1;
9501 DECL_NOT_REALLY_EXTERN (d
) = ! DECL_EXTERNAL (code_pattern
);
9504 warn_if_unknown_interface (code_pattern
);
9508 import_export_decl (d
);
9511 /* Reject all external templates except inline functions. */
9512 if (DECL_INTERFACE_KNOWN (d
)
9513 && ! DECL_NOT_REALLY_EXTERN (d
)
9514 && ! (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_INLINE (d
)))
9517 if (TREE_CODE (d
) == VAR_DECL
9518 && TREE_READONLY (d
)
9519 && DECL_INITIAL (d
) == NULL_TREE
9520 && DECL_INITIAL (code_pattern
) != NULL_TREE
)
9521 /* We need to set up DECL_INITIAL regardless of pattern_defined if
9522 the variable is a static const initialized in the class body. */;
9523 else if (pattern_defined
&& nested
9524 && TREE_CODE (d
) == FUNCTION_DECL
&& DECL_INLINE (d
))
9525 /* An inline function used in another function; instantiate it now so
9526 we can inline it. */;
9527 else if (! pattern_defined
|| ! at_eof
)
9529 /* Defer all other templates. We restore the source position
9530 here because it's used by add_pending_template. */
9532 input_filename
= file
;
9534 if (at_eof
&& !pattern_defined
9535 && DECL_EXPLICIT_INSTANTIATION (d
))
9538 The definition of a non-exported function template, a
9539 non-exported member function template, or a non-exported
9540 member function or static data member of a class template
9541 shall be present in every translation unit in which it is
9542 explicitly instantiated. */
9543 cp_error ("explicit instantiation of `%D' but no definition available",
9546 add_pending_template (d
);
9550 /* If this instantiation is COMDAT, we don't know whether or not we
9551 will really need to write it out. If we can't be sure, mark it
9552 DECL_DEFER_OUTPUT. NOTE: This increases memory consumption,
9553 since we keep some instantiations in memory rather than write
9554 them out immediately and forget them. A better approach would be
9555 to wait until we know we need them to do the instantiation, but
9556 that would break templates with static locals, because we
9557 generate the functions to destroy statics before we determine
9558 which functions are needed. A better solution would be to
9559 generate the ctor and dtor functions as we go. */
9561 if (TREE_CODE (d
) == FUNCTION_DECL
9563 && ! DECL_NEEDED_P (d
)
9564 /* If the function that caused us to be instantiated is needed, we
9565 will be needed, too. */
9566 && (! nested
|| (old_fn
&& ! DECL_NEEDED_P (old_fn
))))
9567 DECL_DEFER_OUTPUT (d
) = 1;
9569 /* We're now committed to instantiating this template. Mark it as
9570 instantiated so that recursive calls to instantiate_decl do not
9571 try to instantiate it again. */
9572 DECL_TEMPLATE_INSTANTIATED (d
) = 1;
9574 /* Regenerate the declaration in case the template has been modified
9575 by a subsequent redeclaration. */
9576 regenerate_decl_from_template (d
, td
);
9578 /* We already set the file and line above. Reset them now in case
9579 they changed as a result of calling regenerate_decl_from_template. */
9580 lineno
= DECL_SOURCE_LINE (d
);
9581 input_filename
= DECL_SOURCE_FILE (d
);
9583 if (TREE_CODE (d
) == VAR_DECL
)
9585 DECL_IN_AGGR_P (d
) = 0;
9586 if (DECL_INTERFACE_KNOWN (d
))
9587 DECL_EXTERNAL (d
) = ! DECL_NOT_REALLY_EXTERN (d
);
9590 DECL_EXTERNAL (d
) = 1;
9591 DECL_NOT_REALLY_EXTERN (d
) = 1;
9593 cp_finish_decl (d
, DECL_INITIAL (d
), NULL_TREE
, 0);
9595 else if (TREE_CODE (d
) == FUNCTION_DECL
)
9597 /* Set up context. */
9598 start_function (NULL_TREE
, d
, NULL_TREE
, SF_PRE_PARSED
);
9599 store_parm_decls ();
9601 /* We already set up __FUNCTION__, etc., so we don't want to do
9603 current_function_name_declared
= 1;
9605 /* Substitute into the body of the function. */
9606 tsubst_expr (DECL_SAVED_TREE (code_pattern
), args
,
9607 /*complain=*/1, tmpl
);
9609 /* Finish the function. */
9610 expand_body (finish_function (lineno
, 0));
9615 input_filename
= file
;
9617 pop_from_top_level ();
9623 /* Run through the list of templates that we wish we could
9624 instantiate, and instantiate any we can. */
9627 instantiate_pending_templates ()
9630 int instantiated_something
= 0;
9637 t
= &pending_templates
;
9640 tree srcloc
= TREE_PURPOSE (*t
);
9641 tree instantiation
= TREE_VALUE (*t
);
9643 input_filename
= SRCLOC_FILE (srcloc
);
9644 lineno
= SRCLOC_LINE (srcloc
);
9646 if (TREE_CODE_CLASS (TREE_CODE (instantiation
)) == 't')
9650 if (!TYPE_SIZE (instantiation
))
9652 instantiate_class_template (instantiation
);
9653 if (CLASSTYPE_TEMPLATE_INSTANTIATION (instantiation
))
9654 for (fn
= TYPE_METHODS (instantiation
);
9656 fn
= TREE_CHAIN (fn
))
9657 if (! DECL_ARTIFICIAL (fn
))
9658 instantiate_decl (fn
);
9659 if (TYPE_SIZE (instantiation
))
9661 instantiated_something
= 1;
9666 if (TYPE_SIZE (instantiation
))
9667 /* If INSTANTIATION has been instantiated, then we don't
9668 need to consider it again in the future. */
9669 *t
= TREE_CHAIN (*t
);
9671 t
= &TREE_CHAIN (*t
);
9675 if (DECL_TEMPLATE_INSTANTIATION (instantiation
)
9676 && !DECL_TEMPLATE_INSTANTIATED (instantiation
))
9678 instantiation
= instantiate_decl (instantiation
);
9679 if (DECL_TEMPLATE_INSTANTIATED (instantiation
))
9681 instantiated_something
= 1;
9686 if (!DECL_TEMPLATE_INSTANTIATION (instantiation
)
9687 || DECL_TEMPLATE_INSTANTIATED (instantiation
))
9688 /* If INSTANTIATION has been instantiated, then we don't
9689 need to consider it again in the future. */
9690 *t
= TREE_CHAIN (*t
);
9692 t
= &TREE_CHAIN (*t
);
9697 /* Go through the things that are template instantiations if we are
9698 using guiding declarations. */
9699 t
= &maybe_templates
;
9706 fn
= TREE_VALUE (*t
);
9708 if (DECL_INITIAL (fn
))
9709 /* If the FN is already defined, then it was either already
9710 instantiated or, even though guiding declarations were
9711 allowed, a non-template definition was provided. */
9715 template = TREE_PURPOSE (*t
);
9716 args
= get_bindings (template, fn
, NULL_TREE
);
9717 fn
= instantiate_template (template, args
);
9718 instantiate_decl (fn
);
9722 /* Remove this entry from the chain. */
9723 *t
= TREE_CHAIN (*t
);
9725 maybe_template_tail
= t
;
9729 return instantiated_something
;
9732 /* Substitute ARGVEC into T, which is a TREE_LIST. In particular, it
9733 is an initializer list: the TREE_PURPOSEs are DECLs, and the
9734 TREE_VALUEs are initializer values. Used by instantiate_decl. */
9737 tsubst_expr_values (t
, argvec
)
9740 tree first
= NULL_TREE
;
9743 for (; t
; t
= TREE_CHAIN (t
))
9745 tree pur
= tsubst_copy (TREE_PURPOSE (t
), argvec
,
9746 /*complain=*/1, NULL_TREE
);
9747 tree val
= tsubst_expr (TREE_VALUE (t
), argvec
, /*complain=*/1,
9749 *p
= build_tree_list (pur
, val
);
9750 p
= &TREE_CHAIN (*p
);
9755 /* D is an undefined function declaration in the presence of templates with
9756 the same name, listed in FNS. If one of them can produce D as an
9757 instantiation, remember this so we can instantiate it at EOF if D has
9758 not been defined by that time. */
9761 add_maybe_template (d
, fns
)
9766 if (DECL_MAYBE_TEMPLATE (d
))
9769 t
= most_specialized (fns
, d
, NULL_TREE
);
9772 if (t
== error_mark_node
)
9774 cp_error ("ambiguous template instantiation for `%D'", d
);
9778 *maybe_template_tail
= tree_cons (t
, d
, NULL_TREE
);
9779 maybe_template_tail
= &TREE_CHAIN (*maybe_template_tail
);
9780 DECL_MAYBE_TEMPLATE (d
) = 1;
9783 /* Set CURRENT_ACCESS_SPECIFIER based on the protection of DECL. */
9786 set_current_access_from_decl (decl
)
9789 if (TREE_PRIVATE (decl
))
9790 current_access_specifier
= access_private_node
;
9791 else if (TREE_PROTECTED (decl
))
9792 current_access_specifier
= access_protected_node
;
9794 current_access_specifier
= access_public_node
;
9797 /* Instantiate an enumerated type. TAG is the template type, NEWTAG
9798 is the instantiation (which should have been created with
9799 start_enum) and ARGS are the template arguments to use. */
9802 tsubst_enum (tag
, newtag
, args
)
9809 for (e
= TYPE_VALUES (tag
); e
; e
= TREE_CHAIN (e
))
9813 /* Note that in a template enum, the TREE_VALUE is the
9814 CONST_DECL, not the corresponding INTEGER_CST. */
9815 value
= tsubst_expr (DECL_INITIAL (TREE_VALUE (e
)),
9816 args
, /*complain=*/1,
9819 /* Give this enumeration constant the correct access. */
9820 set_current_access_from_decl (TREE_VALUE (e
));
9822 /* Actually build the enumerator itself. */
9823 build_enumerator (TREE_PURPOSE (e
), value
, newtag
);
9826 finish_enum (newtag
);
9829 /* Set the DECL_ASSEMBLER_NAME for DECL, which is a FUNCTION_DECL that
9830 is either an instantiation or specialization of a template
9834 set_mangled_name_for_template_decl (decl
)
9837 tree saved_namespace
;
9838 tree context
= NULL_TREE
;
9847 my_friendly_assert (TREE_CODE (decl
) == FUNCTION_DECL
, 0);
9848 my_friendly_assert (DECL_TEMPLATE_INFO (decl
) != NULL_TREE
, 0);
9850 /* The names of template functions must be mangled so as to indicate
9851 what template is being specialized with what template arguments.
9852 For example, each of the following three functions must get
9853 different mangled names:
9856 template <> void f<7>(int);
9857 template <> void f<8>(int); */
9859 targs
= DECL_TI_ARGS (decl
);
9860 if (uses_template_parms (targs
))
9861 /* This DECL is for a partial instantiation. There's no need to
9862 mangle the name of such an entity. */
9865 tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
9866 tparms
= DECL_TEMPLATE_PARMS (tmpl
);
9867 parm_depth
= TMPL_PARMS_DEPTH (tparms
);
9869 /* There should be as many levels of arguments as there are levels
9871 my_friendly_assert (parm_depth
== TMPL_ARGS_DEPTH (targs
), 0);
9873 /* We now compute the PARMS and RET_TYPE to give to
9874 build_decl_overload_real. The PARMS and RET_TYPE are the
9875 parameter and return types of the template, after all but the
9876 innermost template arguments have been substituted, not the
9877 parameter and return types of the function DECL. For example,
9880 template <class T> T f(T);
9882 both PARMS and RET_TYPE should be `T' even if DECL is `int f(int)'.
9883 A more subtle example is:
9885 template <class T> struct S { template <class U> void f(T, U); }
9887 Here, if DECL is `void S<int>::f(int, double)', PARMS should be
9888 {int, U}. Thus, the args that we want to subsitute into the
9889 return and parameter type for the function are those in TARGS,
9890 with the innermost level omitted. */
9891 fn_type
= TREE_TYPE (tmpl
);
9892 if (DECL_STATIC_FUNCTION_P (decl
))
9893 context
= DECL_CONTEXT (decl
);
9895 if (parm_depth
== 1)
9896 /* No substitution is necessary. */
9903 /* Replace the innermost level of the TARGS with NULL_TREEs to
9904 let tsubst know not to subsitute for those parameters. */
9905 partial_args
= make_tree_vec (TREE_VEC_LENGTH (targs
));
9906 for (i
= 1; i
< TMPL_ARGS_DEPTH (targs
); ++i
)
9907 SET_TMPL_ARGS_LEVEL (partial_args
, i
,
9908 TMPL_ARGS_LEVEL (targs
, i
));
9909 SET_TMPL_ARGS_LEVEL (partial_args
,
9910 TMPL_ARGS_DEPTH (targs
),
9911 make_tree_vec (DECL_NTPARMS (tmpl
)));
9913 /* Now, do the (partial) substitution to figure out the
9914 appropriate function type. */
9915 fn_type
= tsubst (fn_type
, partial_args
, /*complain=*/1, NULL_TREE
);
9916 if (DECL_STATIC_FUNCTION_P (decl
))
9917 context
= tsubst (context
, partial_args
, /*complain=*/1, NULL_TREE
);
9919 /* Substitute into the template parameters to obtain the real
9920 innermost set of parameters. This step is important if the
9921 innermost set of template parameters contains value
9922 parameters whose types depend on outer template parameters. */
9923 TREE_VEC_LENGTH (partial_args
)--;
9924 tparms
= tsubst_template_parms (tparms
, partial_args
, /*complain=*/1);
9927 /* Now, get the innermost parameters and arguments, and figure out
9928 the parameter and return types. */
9929 tparms
= INNERMOST_TEMPLATE_PARMS (tparms
);
9930 targs
= innermost_args (targs
);
9931 ret_type
= TREE_TYPE (fn_type
);
9932 parm_types
= TYPE_ARG_TYPES (fn_type
);
9934 /* For a static member function, we generate a fake `this' pointer,
9935 for the purposes of mangling. This indicates of which class the
9936 function is a member. Because of:
9940 There shall not be a static and a nonstatic member function
9941 with the same name and the same parameter types
9943 we don't have to worry that this will result in a clash with a
9944 non-static member function. */
9945 if (DECL_STATIC_FUNCTION_P (decl
))
9946 parm_types
= hash_tree_chain (build_pointer_type (context
), parm_types
);
9948 /* There should be the same number of template parameters as
9949 template arguments. */
9950 my_friendly_assert (TREE_VEC_LENGTH (tparms
) == TREE_VEC_LENGTH (targs
),
9953 /* If the template is in a namespace, we need to put that into the
9954 mangled name. Unfortunately, build_decl_overload_real does not
9955 get the decl to mangle, so it relies on the current
9956 namespace. Therefore, we set that here temporarily. */
9957 my_friendly_assert (TREE_CODE_CLASS (TREE_CODE (decl
)) == 'd', 980702);
9958 saved_namespace
= current_namespace
;
9959 current_namespace
= CP_DECL_CONTEXT (decl
);
9961 /* Actually set the DCL_ASSEMBLER_NAME. */
9962 DECL_ASSEMBLER_NAME (decl
)
9963 = build_decl_overload_real (DECL_NAME (decl
), parm_types
, ret_type
,
9965 DECL_FUNCTION_MEMBER_P (decl
)
9966 + DECL_CONSTRUCTOR_P (decl
));
9968 /* Restore the previously active namespace. */
9969 current_namespace
= saved_namespace
;