1 /* Handle parameterized types (templates) for GNU C++.
2 Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
3 2001, 2002, 2003, 2004, 2005 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 GCC.
9 GCC 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 GCC 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 GCC; see the file COPYING. If not, write to
21 the Free Software Foundation, 51 Franklin Street, Fifth Floor,
22 Boston, MA 02110-1301, 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". */
31 #include "coretypes.h"
35 #include "pointer-set.h"
39 #include "cp-objcp-common.h"
40 #include "tree-inline.h"
47 #include "tree-iterator.h"
50 /* The type of functions taking a tree, and some additional data, and
52 typedef int (*tree_fn_t
) (tree
, void*);
54 /* The PENDING_TEMPLATES is a TREE_LIST of templates whose
55 instantiations have been deferred, either because their definitions
56 were not yet available, or because we were putting off doing the work.
57 The TREE_PURPOSE of each entry is either a DECL (for a function or
58 static data member), or a TYPE (for a class) indicating what we are
59 hoping to instantiate. The TREE_VALUE is not used. */
60 static GTY(()) tree pending_templates
;
61 static GTY(()) tree last_pending_template
;
63 int processing_template_parmlist
;
64 static int template_header_count
;
66 static GTY(()) tree saved_trees
;
67 static VEC(int,heap
) *inline_parm_levels
;
69 static GTY(()) tree current_tinst_level
;
71 static GTY(()) tree saved_access_scope
;
73 /* Live only within one (recursive) call to tsubst_expr. We use
74 this to pass the statement expression node from the STMT_EXPR
75 to the EXPR_STMT that is its result. */
76 static tree cur_stmt_expr
;
78 /* A map from local variable declarations in the body of the template
79 presently being instantiated to the corresponding instantiated
81 static htab_t local_specializations
;
83 #define UNIFY_ALLOW_NONE 0
84 #define UNIFY_ALLOW_MORE_CV_QUAL 1
85 #define UNIFY_ALLOW_LESS_CV_QUAL 2
86 #define UNIFY_ALLOW_DERIVED 4
87 #define UNIFY_ALLOW_INTEGER 8
88 #define UNIFY_ALLOW_OUTER_LEVEL 16
89 #define UNIFY_ALLOW_OUTER_MORE_CV_QUAL 32
90 #define UNIFY_ALLOW_OUTER_LESS_CV_QUAL 64
92 static void push_access_scope (tree
);
93 static void pop_access_scope (tree
);
94 static int resolve_overloaded_unification (tree
, tree
, tree
, tree
,
95 unification_kind_t
, int);
96 static int try_one_overload (tree
, tree
, tree
, tree
, tree
,
97 unification_kind_t
, int, bool);
98 static int unify (tree
, tree
, tree
, tree
, int);
99 static void add_pending_template (tree
);
100 static int push_tinst_level (tree
);
101 static void pop_tinst_level (void);
102 static void reopen_tinst_level (tree
);
103 static tree
classtype_mangled_name (tree
);
104 static char* mangle_class_name_for_template (const char *, tree
, tree
);
105 static tree
tsubst_initializer_list (tree
, tree
);
106 static tree
get_class_bindings (tree
, tree
, tree
);
107 static tree
coerce_template_parms (tree
, tree
, tree
, tsubst_flags_t
,
109 static void tsubst_enum (tree
, tree
, tree
);
110 static tree
add_to_template_args (tree
, tree
);
111 static tree
add_outermost_template_args (tree
, tree
);
112 static bool check_instantiated_args (tree
, tree
, tsubst_flags_t
);
113 static int maybe_adjust_types_for_deduction (unification_kind_t
, tree
*, tree
*);
114 static int type_unification_real (tree
, tree
, tree
, tree
,
115 int, unification_kind_t
, int);
116 static void note_template_header (int);
117 static tree
convert_nontype_argument_function (tree
, tree
);
118 static tree
convert_nontype_argument (tree
, tree
);
119 static tree
convert_template_argument (tree
, tree
, tree
,
120 tsubst_flags_t
, int, tree
);
121 static int for_each_template_parm (tree
, tree_fn_t
, void*,
122 struct pointer_set_t
*);
123 static tree
build_template_parm_index (int, int, int, tree
, tree
);
124 static int inline_needs_template_parms (tree
);
125 static void push_inline_template_parms_recursive (tree
, int);
126 static tree
retrieve_local_specialization (tree
);
127 static void register_local_specialization (tree
, tree
);
128 static tree
reduce_template_parm_level (tree
, tree
, int);
129 static int mark_template_parm (tree
, void *);
130 static int template_parm_this_level_p (tree
, void *);
131 static tree
tsubst_friend_function (tree
, tree
);
132 static tree
tsubst_friend_class (tree
, tree
);
133 static int can_complete_type_without_circularity (tree
);
134 static tree
get_bindings (tree
, tree
, tree
, bool);
135 static int template_decl_level (tree
);
136 static int check_cv_quals_for_unify (int, tree
, tree
);
137 static tree
tsubst_template_arg (tree
, tree
, tsubst_flags_t
, tree
);
138 static tree
tsubst_template_args (tree
, tree
, tsubst_flags_t
, tree
);
139 static tree
tsubst_template_parms (tree
, tree
, tsubst_flags_t
);
140 static void regenerate_decl_from_template (tree
, tree
);
141 static tree
most_specialized_class (tree
, tree
);
142 static tree
tsubst_aggr_type (tree
, tree
, tsubst_flags_t
, tree
, int);
143 static tree
tsubst_arg_types (tree
, tree
, tsubst_flags_t
, tree
);
144 static tree
tsubst_function_type (tree
, tree
, tsubst_flags_t
, tree
);
145 static void check_specialization_scope (void);
146 static tree
process_partial_specialization (tree
);
147 static void set_current_access_from_decl (tree
);
148 static void check_default_tmpl_args (tree
, tree
, int, int);
149 static tree
get_template_base (tree
, tree
, tree
, tree
);
150 static tree
try_class_unification (tree
, tree
, tree
, tree
);
151 static int coerce_template_template_parms (tree
, tree
, tsubst_flags_t
,
153 static int template_args_equal (tree
, tree
);
154 static void tsubst_default_arguments (tree
);
155 static tree
for_each_template_parm_r (tree
*, int *, void *);
156 static tree
copy_default_args_to_explicit_spec_1 (tree
, tree
);
157 static void copy_default_args_to_explicit_spec (tree
);
158 static int invalid_nontype_parm_type_p (tree
, tsubst_flags_t
);
159 static int eq_local_specializations (const void *, const void *);
160 static bool dependent_type_p_r (tree
);
161 static tree
tsubst (tree
, tree
, tsubst_flags_t
, tree
);
162 static tree
tsubst_expr (tree
, tree
, tsubst_flags_t
, tree
);
163 static tree
tsubst_copy (tree
, tree
, tsubst_flags_t
, tree
);
165 /* Make the current scope suitable for access checking when we are
166 processing T. T can be FUNCTION_DECL for instantiated function
167 template, or VAR_DECL for static member variable (need by
168 instantiate_decl). */
171 push_access_scope (tree t
)
173 gcc_assert (TREE_CODE (t
) == FUNCTION_DECL
174 || TREE_CODE (t
) == VAR_DECL
);
176 if (DECL_FRIEND_CONTEXT (t
))
177 push_nested_class (DECL_FRIEND_CONTEXT (t
));
178 else if (DECL_CLASS_SCOPE_P (t
))
179 push_nested_class (DECL_CONTEXT (t
));
181 push_to_top_level ();
183 if (TREE_CODE (t
) == FUNCTION_DECL
)
185 saved_access_scope
= tree_cons
186 (NULL_TREE
, current_function_decl
, saved_access_scope
);
187 current_function_decl
= t
;
191 /* Restore the scope set up by push_access_scope. T is the node we
195 pop_access_scope (tree t
)
197 if (TREE_CODE (t
) == FUNCTION_DECL
)
199 current_function_decl
= TREE_VALUE (saved_access_scope
);
200 saved_access_scope
= TREE_CHAIN (saved_access_scope
);
203 if (DECL_FRIEND_CONTEXT (t
) || DECL_CLASS_SCOPE_P (t
))
206 pop_from_top_level ();
209 /* Do any processing required when DECL (a member template
210 declaration) is finished. Returns the TEMPLATE_DECL corresponding
211 to DECL, unless it is a specialization, in which case the DECL
212 itself is returned. */
215 finish_member_template_decl (tree decl
)
217 if (decl
== error_mark_node
)
218 return error_mark_node
;
220 gcc_assert (DECL_P (decl
));
222 if (TREE_CODE (decl
) == TYPE_DECL
)
226 type
= TREE_TYPE (decl
);
227 if (IS_AGGR_TYPE (type
)
228 && CLASSTYPE_TEMPLATE_INFO (type
)
229 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (type
))
231 tree tmpl
= CLASSTYPE_TI_TEMPLATE (type
);
232 check_member_template (tmpl
);
237 else if (TREE_CODE (decl
) == FIELD_DECL
)
238 error ("data member %qD cannot be a member template", decl
);
239 else if (DECL_TEMPLATE_INFO (decl
))
241 if (!DECL_TEMPLATE_SPECIALIZATION (decl
))
243 check_member_template (DECL_TI_TEMPLATE (decl
));
244 return DECL_TI_TEMPLATE (decl
);
250 error ("invalid member template declaration %qD", decl
);
252 return error_mark_node
;
255 /* Returns the template nesting level of the indicated class TYPE.
265 A<T>::B<U> has depth two, while A<T> has depth one.
266 Both A<T>::B<int> and A<int>::B<U> have depth one, if
267 they are instantiations, not specializations.
269 This function is guaranteed to return 0 if passed NULL_TREE so
270 that, for example, `template_class_depth (current_class_type)' is
274 template_class_depth (tree type
)
279 type
&& TREE_CODE (type
) != NAMESPACE_DECL
;
280 type
= (TREE_CODE (type
) == FUNCTION_DECL
)
281 ? CP_DECL_CONTEXT (type
) : TYPE_CONTEXT (type
))
283 if (TREE_CODE (type
) != FUNCTION_DECL
)
285 if (CLASSTYPE_TEMPLATE_INFO (type
)
286 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (type
))
287 && uses_template_parms (CLASSTYPE_TI_ARGS (type
)))
292 if (DECL_TEMPLATE_INFO (type
)
293 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (type
))
294 && uses_template_parms (DECL_TI_ARGS (type
)))
302 /* Returns 1 if processing DECL as part of do_pending_inlines
303 needs us to push template parms. */
306 inline_needs_template_parms (tree decl
)
308 if (! DECL_TEMPLATE_INFO (decl
))
311 return (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (most_general_template (decl
)))
312 > (processing_template_decl
+ DECL_TEMPLATE_SPECIALIZATION (decl
)));
315 /* Subroutine of maybe_begin_member_template_processing.
316 Push the template parms in PARMS, starting from LEVELS steps into the
317 chain, and ending at the beginning, since template parms are listed
321 push_inline_template_parms_recursive (tree parmlist
, int levels
)
323 tree parms
= TREE_VALUE (parmlist
);
327 push_inline_template_parms_recursive (TREE_CHAIN (parmlist
), levels
- 1);
329 ++processing_template_decl
;
330 current_template_parms
331 = tree_cons (size_int (processing_template_decl
),
332 parms
, current_template_parms
);
333 TEMPLATE_PARMS_FOR_INLINE (current_template_parms
) = 1;
335 begin_scope (TREE_VEC_LENGTH (parms
) ? sk_template_parms
: sk_template_spec
,
337 for (i
= 0; i
< TREE_VEC_LENGTH (parms
); ++i
)
341 if (TREE_VEC_ELT (parms
, i
) == error_mark_node
)
344 parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
345 gcc_assert (DECL_P (parm
));
347 switch (TREE_CODE (parm
))
356 /* Make a CONST_DECL as is done in process_template_parm.
357 It is ugly that we recreate this here; the original
358 version built in process_template_parm is no longer
360 tree decl
= build_decl (CONST_DECL
, DECL_NAME (parm
),
362 DECL_ARTIFICIAL (decl
) = 1;
363 TREE_CONSTANT (decl
) = 1;
364 TREE_INVARIANT (decl
) = 1;
365 TREE_READONLY (decl
) = 1;
366 DECL_INITIAL (decl
) = DECL_INITIAL (parm
);
367 SET_DECL_TEMPLATE_PARM_P (decl
);
378 /* Restore the template parameter context for a member template or
379 a friend template defined in a class definition. */
382 maybe_begin_member_template_processing (tree decl
)
387 if (inline_needs_template_parms (decl
))
389 parms
= DECL_TEMPLATE_PARMS (most_general_template (decl
));
390 levels
= TMPL_PARMS_DEPTH (parms
) - processing_template_decl
;
392 if (DECL_TEMPLATE_SPECIALIZATION (decl
))
395 parms
= TREE_CHAIN (parms
);
398 push_inline_template_parms_recursive (parms
, levels
);
401 /* Remember how many levels of template parameters we pushed so that
402 we can pop them later. */
403 VEC_safe_push (int, heap
, inline_parm_levels
, levels
);
406 /* Undo the effects of maybe_begin_member_template_processing. */
409 maybe_end_member_template_processing (void)
414 if (VEC_length (int, inline_parm_levels
) == 0)
417 last
= VEC_pop (int, inline_parm_levels
);
418 for (i
= 0; i
< last
; ++i
)
420 --processing_template_decl
;
421 current_template_parms
= TREE_CHAIN (current_template_parms
);
426 /* Return a new template argument vector which contains all of ARGS,
427 but has as its innermost set of arguments the EXTRA_ARGS. */
430 add_to_template_args (tree args
, tree extra_args
)
437 extra_depth
= TMPL_ARGS_DEPTH (extra_args
);
438 new_args
= make_tree_vec (TMPL_ARGS_DEPTH (args
) + extra_depth
);
440 for (i
= 1; i
<= TMPL_ARGS_DEPTH (args
); ++i
)
441 SET_TMPL_ARGS_LEVEL (new_args
, i
, TMPL_ARGS_LEVEL (args
, i
));
443 for (j
= 1; j
<= extra_depth
; ++j
, ++i
)
444 SET_TMPL_ARGS_LEVEL (new_args
, i
, TMPL_ARGS_LEVEL (extra_args
, j
));
449 /* Like add_to_template_args, but only the outermost ARGS are added to
450 the EXTRA_ARGS. In particular, all but TMPL_ARGS_DEPTH
451 (EXTRA_ARGS) levels are added. This function is used to combine
452 the template arguments from a partial instantiation with the
453 template arguments used to attain the full instantiation from the
454 partial instantiation. */
457 add_outermost_template_args (tree args
, tree extra_args
)
461 /* If there are more levels of EXTRA_ARGS than there are ARGS,
462 something very fishy is going on. */
463 gcc_assert (TMPL_ARGS_DEPTH (args
) >= TMPL_ARGS_DEPTH (extra_args
));
465 /* If *all* the new arguments will be the EXTRA_ARGS, just return
467 if (TMPL_ARGS_DEPTH (args
) == TMPL_ARGS_DEPTH (extra_args
))
470 /* For the moment, we make ARGS look like it contains fewer levels. */
471 TREE_VEC_LENGTH (args
) -= TMPL_ARGS_DEPTH (extra_args
);
473 new_args
= add_to_template_args (args
, extra_args
);
475 /* Now, we restore ARGS to its full dimensions. */
476 TREE_VEC_LENGTH (args
) += TMPL_ARGS_DEPTH (extra_args
);
481 /* Return the N levels of innermost template arguments from the ARGS. */
484 get_innermost_template_args (tree args
, int n
)
492 /* If N is 1, just return the innermost set of template arguments. */
494 return TMPL_ARGS_LEVEL (args
, TMPL_ARGS_DEPTH (args
));
496 /* If we're not removing anything, just return the arguments we were
498 extra_levels
= TMPL_ARGS_DEPTH (args
) - n
;
499 gcc_assert (extra_levels
>= 0);
500 if (extra_levels
== 0)
503 /* Make a new set of arguments, not containing the outer arguments. */
504 new_args
= make_tree_vec (n
);
505 for (i
= 1; i
<= n
; ++i
)
506 SET_TMPL_ARGS_LEVEL (new_args
, i
,
507 TMPL_ARGS_LEVEL (args
, i
+ extra_levels
));
512 /* We've got a template header coming up; push to a new level for storing
516 begin_template_parm_list (void)
518 /* We use a non-tag-transparent scope here, which causes pushtag to
519 put tags in this scope, rather than in the enclosing class or
520 namespace scope. This is the right thing, since we want
521 TEMPLATE_DECLS, and not TYPE_DECLS for template classes. For a
522 global template class, push_template_decl handles putting the
523 TEMPLATE_DECL into top-level scope. For a nested template class,
526 template <class T> struct S1 {
527 template <class T> struct S2 {};
530 pushtag contains special code to call pushdecl_with_scope on the
531 TEMPLATE_DECL for S2. */
532 begin_scope (sk_template_parms
, NULL
);
533 ++processing_template_decl
;
534 ++processing_template_parmlist
;
535 note_template_header (0);
538 /* This routine is called when a specialization is declared. If it is
539 invalid to declare a specialization here, an error is reported. */
542 check_specialization_scope (void)
544 tree scope
= current_scope ();
548 An explicit specialization shall be declared in the namespace of
549 which the template is a member, or, for member templates, in the
550 namespace of which the enclosing class or enclosing class
551 template is a member. An explicit specialization of a member
552 function, member class or static data member of a class template
553 shall be declared in the namespace of which the class template
555 if (scope
&& TREE_CODE (scope
) != NAMESPACE_DECL
)
556 error ("explicit specialization in non-namespace scope %qD", scope
);
560 In an explicit specialization declaration for a member of a class
561 template or a member template that appears in namespace scope,
562 the member template and some of its enclosing class templates may
563 remain unspecialized, except that the declaration shall not
564 explicitly specialize a class member template if its enclosing
565 class templates are not explicitly specialized as well. */
566 if (current_template_parms
)
567 error ("enclosing class templates are not explicitly specialized");
570 /* We've just seen template <>. */
573 begin_specialization (void)
575 begin_scope (sk_template_spec
, NULL
);
576 note_template_header (1);
577 check_specialization_scope ();
580 /* Called at then end of processing a declaration preceded by
584 end_specialization (void)
587 reset_specialization ();
590 /* Any template <>'s that we have seen thus far are not referring to a
591 function specialization. */
594 reset_specialization (void)
596 processing_specialization
= 0;
597 template_header_count
= 0;
600 /* We've just seen a template header. If SPECIALIZATION is nonzero,
601 it was of the form template <>. */
604 note_template_header (int specialization
)
606 processing_specialization
= specialization
;
607 template_header_count
++;
610 /* We're beginning an explicit instantiation. */
613 begin_explicit_instantiation (void)
615 gcc_assert (!processing_explicit_instantiation
);
616 processing_explicit_instantiation
= true;
621 end_explicit_instantiation (void)
623 gcc_assert (processing_explicit_instantiation
);
624 processing_explicit_instantiation
= false;
627 /* An explicit specialization or partial specialization TMPL is being
628 declared. Check that the namespace in which the specialization is
629 occurring is permissible. Returns false iff it is invalid to
630 specialize TMPL in the current namespace. */
633 check_specialization_namespace (tree tmpl
)
635 tree tpl_ns
= decl_namespace_context (tmpl
);
639 An explicit specialization shall be declared in the namespace of
640 which the template is a member, or, for member templates, in the
641 namespace of which the enclosing class or enclosing class
642 template is a member. An explicit specialization of a member
643 function, member class or static data member of a class template
644 shall be declared in the namespace of which the class template is
646 if (is_associated_namespace (current_namespace
, tpl_ns
))
647 /* Same or super-using namespace. */
651 pedwarn ("specialization of %qD in different namespace", tmpl
);
652 pedwarn (" from definition of %q+#D", tmpl
);
657 /* SPEC is an explicit instantiation. Check that it is valid to
658 perform this explicit instantiation in the current namespace. */
661 check_explicit_instantiation_namespace (tree spec
)
665 /* DR 275: An explicit instantiation shall appear in an enclosing
666 namespace of its template. */
667 ns
= decl_namespace_context (spec
);
668 if (!is_ancestor (current_namespace
, ns
))
669 pedwarn ("explicit instantiation of %qD in namespace %qD "
670 "(which does not enclose namespace %qD)",
671 spec
, current_namespace
, ns
);
674 /* The TYPE is being declared. If it is a template type, that means it
675 is a partial specialization. Do appropriate error-checking. */
678 maybe_process_partial_specialization (tree type
)
682 if (type
== error_mark_node
)
685 context
= TYPE_CONTEXT (type
);
687 if (CLASS_TYPE_P (type
) && CLASSTYPE_USE_TEMPLATE (type
))
689 /* This is for ordinary explicit specialization and partial
690 specialization of a template class such as:
692 template <> class C<int>;
696 template <class T> class C<T*>;
698 Make sure that `C<int>' and `C<T*>' are implicit instantiations. */
700 if (CLASSTYPE_IMPLICIT_INSTANTIATION (type
)
701 && !COMPLETE_TYPE_P (type
))
703 check_specialization_namespace (CLASSTYPE_TI_TEMPLATE (type
));
704 SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (type
);
705 if (processing_template_decl
)
706 push_template_decl (TYPE_MAIN_DECL (type
));
708 else if (CLASSTYPE_TEMPLATE_INSTANTIATION (type
))
709 error ("specialization of %qT after instantiation", type
);
711 else if (CLASS_TYPE_P (type
)
712 && !CLASSTYPE_USE_TEMPLATE (type
)
713 && CLASSTYPE_TEMPLATE_INFO (type
)
714 && context
&& CLASS_TYPE_P (context
)
715 && CLASSTYPE_TEMPLATE_INFO (context
))
717 /* This is for an explicit specialization of member class
718 template according to [temp.expl.spec/18]:
720 template <> template <class U> class C<int>::D;
722 The context `C<int>' must be an implicit instantiation.
723 Otherwise this is just a member class template declared
726 template <> class C<int> { template <class U> class D; };
727 template <> template <class U> class C<int>::D;
729 In the first case, `C<int>::D' is a specialization of `C<T>::D'
730 while in the second case, `C<int>::D' is a primary template
731 and `C<T>::D' may not exist. */
733 if (CLASSTYPE_IMPLICIT_INSTANTIATION (context
)
734 && !COMPLETE_TYPE_P (type
))
738 if (current_namespace
739 != decl_namespace_context (CLASSTYPE_TI_TEMPLATE (type
)))
741 pedwarn ("specializing %q#T in different namespace", type
);
742 pedwarn (" from definition of %q+#D",
743 CLASSTYPE_TI_TEMPLATE (type
));
746 /* Check for invalid specialization after instantiation:
748 template <> template <> class C<int>::D<int>;
749 template <> template <class U> class C<int>::D; */
751 for (t
= DECL_TEMPLATE_INSTANTIATIONS
752 (most_general_template (CLASSTYPE_TI_TEMPLATE (type
)));
753 t
; t
= TREE_CHAIN (t
))
754 if (TREE_VALUE (t
) != type
755 && TYPE_CONTEXT (TREE_VALUE (t
)) == context
)
756 error ("specialization %qT after instantiation %qT",
757 type
, TREE_VALUE (t
));
759 /* Mark TYPE as a specialization. And as a result, we only
760 have one level of template argument for the innermost
762 SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (type
);
763 CLASSTYPE_TI_ARGS (type
)
764 = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type
));
767 else if (processing_specialization
)
768 error ("explicit specialization of non-template %qT", type
);
771 /* Returns nonzero if we can optimize the retrieval of specializations
772 for TMPL, a TEMPLATE_DECL. In particular, for such a template, we
773 do not use DECL_TEMPLATE_SPECIALIZATIONS at all. */
776 optimize_specialization_lookup_p (tree tmpl
)
778 return (DECL_FUNCTION_TEMPLATE_P (tmpl
)
779 && DECL_CLASS_SCOPE_P (tmpl
)
780 /* DECL_CLASS_SCOPE_P holds of T::f even if T is a template
782 && CLASS_TYPE_P (DECL_CONTEXT (tmpl
))
783 /* The optimized lookup depends on the fact that the
784 template arguments for the member function template apply
785 purely to the containing class, which is not true if the
786 containing class is an explicit or partial
788 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (tmpl
))
789 && !DECL_MEMBER_TEMPLATE_P (tmpl
)
790 && !DECL_CONV_FN_P (tmpl
)
791 /* It is possible to have a template that is not a member
792 template and is not a member of a template class:
794 template <typename T>
795 struct S { friend A::f(); };
797 Here, the friend function is a template, but the context does
798 not have template information. The optimized lookup relies
799 on having ARGS be the template arguments for both the class
800 and the function template. */
801 && !DECL_FRIEND_P (DECL_TEMPLATE_RESULT (tmpl
)));
804 /* Retrieve the specialization (in the sense of [temp.spec] - a
805 specialization is either an instantiation or an explicit
806 specialization) of TMPL for the given template ARGS. If there is
807 no such specialization, return NULL_TREE. The ARGS are a vector of
808 arguments, or a vector of vectors of arguments, in the case of
809 templates with more than one level of parameters.
811 If TMPL is a type template and CLASS_SPECIALIZATIONS_P is true,
812 then we search for a partial specialization matching ARGS. This
813 parameter is ignored if TMPL is not a class template. */
816 retrieve_specialization (tree tmpl
, tree args
,
817 bool class_specializations_p
)
819 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
);
821 /* There should be as many levels of arguments as there are
822 levels of parameters. */
823 gcc_assert (TMPL_ARGS_DEPTH (args
)
824 == TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
)));
826 if (optimize_specialization_lookup_p (tmpl
))
829 tree class_specialization
;
830 VEC(tree
,gc
) *methods
;
834 /* The template arguments actually apply to the containing
835 class. Find the class specialization with those
837 class_template
= CLASSTYPE_TI_TEMPLATE (DECL_CONTEXT (tmpl
));
839 = retrieve_specialization (class_template
, args
,
840 /*class_specializations_p=*/false);
841 if (!class_specialization
)
843 /* Now, find the appropriate entry in the CLASSTYPE_METHOD_VEC
844 for the specialization. */
845 idx
= class_method_index_for_fn (class_specialization
, tmpl
);
848 /* Iterate through the methods with the indicated name, looking
849 for the one that has an instance of TMPL. */
850 methods
= CLASSTYPE_METHOD_VEC (class_specialization
);
851 for (fns
= VEC_index (tree
, methods
, idx
); fns
; fns
= OVL_NEXT (fns
))
853 tree fn
= OVL_CURRENT (fns
);
854 if (DECL_TEMPLATE_INFO (fn
) && DECL_TI_TEMPLATE (fn
) == tmpl
)
864 /* Class templates store their instantiations on the
865 DECL_TEMPLATE_INSTANTIATIONS list; other templates use the
866 DECL_TEMPLATE_SPECIALIZATIONS list. */
867 if (!class_specializations_p
868 && TREE_CODE (DECL_TEMPLATE_RESULT (tmpl
)) == TYPE_DECL
)
869 sp
= &DECL_TEMPLATE_INSTANTIATIONS (tmpl
);
871 sp
= &DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
873 /* Iterate through the list until we find a matching template. */
874 while (*sp
!= NULL_TREE
)
878 if (comp_template_args (TREE_PURPOSE (spec
), args
))
880 /* Use the move-to-front heuristic to speed up future
884 *sp
= TREE_CHAIN (*sp
);
885 TREE_CHAIN (spec
) = *head
;
888 return TREE_VALUE (spec
);
890 sp
= &TREE_CHAIN (spec
);
897 /* Like retrieve_specialization, but for local declarations. */
900 retrieve_local_specialization (tree tmpl
)
902 tree spec
= (tree
) htab_find_with_hash (local_specializations
, tmpl
,
903 htab_hash_pointer (tmpl
));
904 return spec
? TREE_PURPOSE (spec
) : NULL_TREE
;
907 /* Returns nonzero iff DECL is a specialization of TMPL. */
910 is_specialization_of (tree decl
, tree tmpl
)
914 if (TREE_CODE (decl
) == FUNCTION_DECL
)
918 t
= DECL_TEMPLATE_INFO (t
) ? DECL_TI_TEMPLATE (t
) : NULL_TREE
)
924 gcc_assert (TREE_CODE (decl
) == TYPE_DECL
);
926 for (t
= TREE_TYPE (decl
);
928 t
= CLASSTYPE_USE_TEMPLATE (t
)
929 ? TREE_TYPE (CLASSTYPE_TI_TEMPLATE (t
)) : NULL_TREE
)
930 if (same_type_ignoring_top_level_qualifiers_p (t
, TREE_TYPE (tmpl
)))
937 /* Returns nonzero iff DECL is a specialization of friend declaration
938 FRIEND according to [temp.friend]. */
941 is_specialization_of_friend (tree decl
, tree
friend)
943 bool need_template
= true;
946 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
947 || TREE_CODE (decl
) == TYPE_DECL
);
949 /* For [temp.friend/6] when FRIEND is an ordinary member function
950 of a template class, we want to check if DECL is a specialization
952 if (TREE_CODE (friend) == FUNCTION_DECL
953 && DECL_TEMPLATE_INFO (friend)
954 && !DECL_USE_TEMPLATE (friend))
956 /* We want a TEMPLATE_DECL for `is_specialization_of'. */
957 friend = DECL_TI_TEMPLATE (friend);
958 need_template
= false;
960 else if (TREE_CODE (friend) == TEMPLATE_DECL
961 && !PRIMARY_TEMPLATE_P (friend))
962 need_template
= false;
964 /* There is nothing to do if this is not a template friend. */
965 if (TREE_CODE (friend) != TEMPLATE_DECL
)
968 if (is_specialization_of (decl
, friend))
972 A member of a class template may be declared to be a friend of a
973 non-template class. In this case, the corresponding member of
974 every specialization of the class template is a friend of the
975 class granting friendship.
977 For example, given a template friend declaration
979 template <class T> friend void A<T>::f();
981 the member function below is considered a friend
983 template <> struct A<int> {
987 For this type of template friend, TEMPLATE_DEPTH below will be
988 nonzero. To determine if DECL is a friend of FRIEND, we first
989 check if the enclosing class is a specialization of another. */
991 template_depth
= template_class_depth (DECL_CONTEXT (friend));
993 && DECL_CLASS_SCOPE_P (decl
)
994 && is_specialization_of (TYPE_NAME (DECL_CONTEXT (decl
)),
995 CLASSTYPE_TI_TEMPLATE (DECL_CONTEXT (friend))))
997 /* Next, we check the members themselves. In order to handle
998 a few tricky cases, such as when FRIEND's are
1000 template <class T> friend void A<T>::g(T t);
1001 template <class T> template <T t> friend void A<T>::h();
1005 void A<int>::g(int);
1006 template <int> void A<int>::h();
1008 we need to figure out ARGS, the template arguments from
1009 the context of DECL. This is required for template substitution
1010 of `T' in the function parameter of `g' and template parameter
1011 of `h' in the above examples. Here ARGS corresponds to `int'. */
1013 tree context
= DECL_CONTEXT (decl
);
1014 tree args
= NULL_TREE
;
1015 int current_depth
= 0;
1017 while (current_depth
< template_depth
)
1019 if (CLASSTYPE_TEMPLATE_INFO (context
))
1021 if (current_depth
== 0)
1022 args
= TYPE_TI_ARGS (context
);
1024 args
= add_to_template_args (TYPE_TI_ARGS (context
), args
);
1027 context
= TYPE_CONTEXT (context
);
1030 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1035 tree friend_args_type
;
1036 tree decl_args_type
;
1038 /* Make sure that both DECL and FRIEND are templates or
1040 is_template
= DECL_TEMPLATE_INFO (decl
)
1041 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl
));
1042 if (need_template
^ is_template
)
1044 else if (is_template
)
1046 /* If both are templates, check template parameter list. */
1048 = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend),
1050 if (!comp_template_parms
1051 (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (decl
)),
1055 decl_type
= TREE_TYPE (DECL_TI_TEMPLATE (decl
));
1058 decl_type
= TREE_TYPE (decl
);
1060 friend_type
= tsubst_function_type (TREE_TYPE (friend), args
,
1061 tf_none
, NULL_TREE
);
1062 if (friend_type
== error_mark_node
)
1065 /* Check if return types match. */
1066 if (!same_type_p (TREE_TYPE (decl_type
), TREE_TYPE (friend_type
)))
1069 /* Check if function parameter types match, ignoring the
1070 `this' parameter. */
1071 friend_args_type
= TYPE_ARG_TYPES (friend_type
);
1072 decl_args_type
= TYPE_ARG_TYPES (decl_type
);
1073 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (friend))
1074 friend_args_type
= TREE_CHAIN (friend_args_type
);
1075 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
1076 decl_args_type
= TREE_CHAIN (decl_args_type
);
1078 return compparms (decl_args_type
, friend_args_type
);
1082 /* DECL is a TYPE_DECL */
1084 tree decl_type
= TREE_TYPE (decl
);
1086 /* Make sure that both DECL and FRIEND are templates or
1089 = CLASSTYPE_TEMPLATE_INFO (decl_type
)
1090 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (decl_type
));
1092 if (need_template
^ is_template
)
1094 else if (is_template
)
1097 /* If both are templates, check the name of the two
1098 TEMPLATE_DECL's first because is_friend didn't. */
1099 if (DECL_NAME (CLASSTYPE_TI_TEMPLATE (decl_type
))
1100 != DECL_NAME (friend))
1103 /* Now check template parameter list. */
1105 = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend),
1107 return comp_template_parms
1108 (DECL_TEMPLATE_PARMS (CLASSTYPE_TI_TEMPLATE (decl_type
)),
1112 return (DECL_NAME (decl
)
1113 == DECL_NAME (friend));
1119 /* Register the specialization SPEC as a specialization of TMPL with
1120 the indicated ARGS. IS_FRIEND indicates whether the specialization
1121 is actually just a friend declaration. Returns SPEC, or an
1122 equivalent prior declaration, if available. */
1125 register_specialization (tree spec
, tree tmpl
, tree args
, bool is_friend
)
1129 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
);
1131 if (TREE_CODE (spec
) == FUNCTION_DECL
1132 && uses_template_parms (DECL_TI_ARGS (spec
)))
1133 /* This is the FUNCTION_DECL for a partial instantiation. Don't
1134 register it; we want the corresponding TEMPLATE_DECL instead.
1135 We use `uses_template_parms (DECL_TI_ARGS (spec))' rather than
1136 the more obvious `uses_template_parms (spec)' to avoid problems
1137 with default function arguments. In particular, given
1138 something like this:
1140 template <class T> void f(T t1, T t = T())
1142 the default argument expression is not substituted for in an
1143 instantiation unless and until it is actually needed. */
1146 fn
= retrieve_specialization (tmpl
, args
,
1147 /*class_specializations_p=*/false);
1148 /* We can sometimes try to re-register a specialization that we've
1149 already got. In particular, regenerate_decl_from_template calls
1150 duplicate_decls which will update the specialization list. But,
1151 we'll still get called again here anyhow. It's more convenient
1152 to simply allow this than to try to prevent it. */
1155 else if (fn
&& DECL_TEMPLATE_SPECIALIZATION (spec
))
1157 if (DECL_TEMPLATE_INSTANTIATION (fn
))
1160 || DECL_EXPLICIT_INSTANTIATION (fn
))
1162 error ("specialization of %qD after instantiation",
1169 /* This situation should occur only if the first
1170 specialization is an implicit instantiation, the
1171 second is an explicit specialization, and the
1172 implicit instantiation has not yet been used. That
1173 situation can occur if we have implicitly
1174 instantiated a member function and then specialized
1177 We can also wind up here if a friend declaration that
1178 looked like an instantiation turns out to be a
1181 template <class T> void foo(T);
1182 class S { friend void foo<>(int) };
1183 template <> void foo(int);
1185 We transform the existing DECL in place so that any
1186 pointers to it become pointers to the updated
1189 If there was a definition for the template, but not
1190 for the specialization, we want this to look as if
1191 there were no definition, and vice versa. */
1192 DECL_INITIAL (fn
) = NULL_TREE
;
1193 duplicate_decls (spec
, fn
, is_friend
);
1194 /* The call to duplicate_decls will have applied
1197 An explicit specialization of a function template
1198 is inline only if it is explicitly declared to be,
1199 and independently of whether its function template
1202 to the primary function; now copy the inline bits to
1203 the various clones. */
1204 FOR_EACH_CLONE (clone
, fn
)
1206 DECL_DECLARED_INLINE_P (clone
)
1207 = DECL_DECLARED_INLINE_P (fn
);
1211 check_specialization_namespace (fn
);
1216 else if (DECL_TEMPLATE_SPECIALIZATION (fn
))
1218 if (!duplicate_decls (spec
, fn
, is_friend
) && DECL_INITIAL (spec
))
1219 /* Dup decl failed, but this is a new definition. Set the
1220 line number so any errors match this new
1222 DECL_SOURCE_LOCATION (fn
) = DECL_SOURCE_LOCATION (spec
);
1228 /* A specialization must be declared in the same namespace as the
1229 template it is specializing. */
1230 if (DECL_TEMPLATE_SPECIALIZATION (spec
)
1231 && !check_specialization_namespace (tmpl
))
1232 DECL_CONTEXT (spec
) = FROB_CONTEXT (decl_namespace_context (tmpl
));
1234 if (!optimize_specialization_lookup_p (tmpl
))
1235 DECL_TEMPLATE_SPECIALIZATIONS (tmpl
)
1236 = tree_cons (args
, spec
, DECL_TEMPLATE_SPECIALIZATIONS (tmpl
));
1241 /* Unregister the specialization SPEC as a specialization of TMPL.
1242 Replace it with NEW_SPEC, if NEW_SPEC is non-NULL. Returns true
1243 if the SPEC was listed as a specialization of TMPL. */
1246 reregister_specialization (tree spec
, tree tmpl
, tree new_spec
)
1250 for (s
= &DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
1252 s
= &TREE_CHAIN (*s
))
1253 if (TREE_VALUE (*s
) == spec
)
1256 *s
= TREE_CHAIN (*s
);
1258 TREE_VALUE (*s
) = new_spec
;
1265 /* Compare an entry in the local specializations hash table P1 (which
1266 is really a pointer to a TREE_LIST) with P2 (which is really a
1270 eq_local_specializations (const void *p1
, const void *p2
)
1272 return TREE_VALUE ((tree
) p1
) == (tree
) p2
;
1275 /* Hash P1, an entry in the local specializations table. */
1278 hash_local_specialization (const void* p1
)
1280 return htab_hash_pointer (TREE_VALUE ((tree
) p1
));
1283 /* Like register_specialization, but for local declarations. We are
1284 registering SPEC, an instantiation of TMPL. */
1287 register_local_specialization (tree spec
, tree tmpl
)
1291 slot
= htab_find_slot_with_hash (local_specializations
, tmpl
,
1292 htab_hash_pointer (tmpl
), INSERT
);
1293 *slot
= build_tree_list (spec
, tmpl
);
1296 /* Print the list of candidate FNS in an error message. */
1299 print_candidates (tree fns
)
1303 const char *str
= "candidates are:";
1305 for (fn
= fns
; fn
!= NULL_TREE
; fn
= TREE_CHAIN (fn
))
1309 for (f
= TREE_VALUE (fn
); f
; f
= OVL_NEXT (f
))
1310 error ("%s %+#D", str
, OVL_CURRENT (f
));
1315 /* Returns the template (one of the functions given by TEMPLATE_ID)
1316 which can be specialized to match the indicated DECL with the
1317 explicit template args given in TEMPLATE_ID. The DECL may be
1318 NULL_TREE if none is available. In that case, the functions in
1319 TEMPLATE_ID are non-members.
1321 If NEED_MEMBER_TEMPLATE is nonzero the function is known to be a
1322 specialization of a member template.
1324 The TEMPLATE_COUNT is the number of references to qualifying
1325 template classes that appeared in the name of the function. See
1326 check_explicit_specialization for a more accurate description.
1328 TSK indicates what kind of template declaration (if any) is being
1329 declared. TSK_TEMPLATE indicates that the declaration given by
1330 DECL, though a FUNCTION_DECL, has template parameters, and is
1331 therefore a template function.
1333 The template args (those explicitly specified and those deduced)
1334 are output in a newly created vector *TARGS_OUT.
1336 If it is impossible to determine the result, an error message is
1337 issued. The error_mark_node is returned to indicate failure. */
1340 determine_specialization (tree template_id
,
1343 int need_member_template
,
1349 tree explicit_targs
;
1350 tree candidates
= NULL_TREE
;
1351 /* A TREE_LIST of templates of which DECL may be a specialization.
1352 The TREE_VALUE of each node is a TEMPLATE_DECL. The
1353 corresponding TREE_PURPOSE is the set of template arguments that,
1354 when used to instantiate the template, would produce a function
1355 with the signature of DECL. */
1356 tree templates
= NULL_TREE
;
1358 struct cp_binding_level
*b
;
1360 *targs_out
= NULL_TREE
;
1362 if (template_id
== error_mark_node
|| decl
== error_mark_node
)
1363 return error_mark_node
;
1365 fns
= TREE_OPERAND (template_id
, 0);
1366 explicit_targs
= TREE_OPERAND (template_id
, 1);
1368 if (fns
== error_mark_node
)
1369 return error_mark_node
;
1371 /* Check for baselinks. */
1372 if (BASELINK_P (fns
))
1373 fns
= BASELINK_FUNCTIONS (fns
);
1375 if (!is_overloaded_fn (fns
))
1377 error ("%qD is not a function template", fns
);
1378 return error_mark_node
;
1381 /* Count the number of template headers specified for this
1384 for (b
= current_binding_level
;
1385 b
->kind
== sk_template_parms
;
1389 for (; fns
; fns
= OVL_NEXT (fns
))
1391 tree fn
= OVL_CURRENT (fns
);
1393 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
1395 tree decl_arg_types
;
1398 /* DECL might be a specialization of FN. */
1400 /* Adjust the type of DECL in case FN is a static member. */
1401 decl_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
1402 if (DECL_STATIC_FUNCTION_P (fn
)
1403 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
1404 decl_arg_types
= TREE_CHAIN (decl_arg_types
);
1406 /* Check that the number of function parameters matches.
1408 template <class T> void f(int i = 0);
1409 template <> void f<int>();
1410 The specialization f<int> is invalid but is not caught
1411 by get_bindings below. */
1413 fn_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
1414 if (list_length (fn_arg_types
) != list_length (decl_arg_types
))
1417 /* For a non-static member function, we need to make sure that
1418 the const qualification is the same. This can be done by
1419 checking the 'this' in the argument list. */
1420 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
1421 && !same_type_p (TREE_VALUE (fn_arg_types
),
1422 TREE_VALUE (decl_arg_types
)))
1425 /* In case of explicit specialization, we need to check if
1426 the number of template headers appearing in the specialization
1427 is correct. This is usually done in check_explicit_specialization,
1428 but the check done there cannot be exhaustive when specializing
1429 member functions. Consider the following code:
1431 template <> void A<int>::f(int);
1432 template <> template <> void A<int>::f(int);
1434 Assuming that A<int> is not itself an explicit specialization
1435 already, the first line specializes "f" which is a non-template
1436 member function, whilst the second line specializes "f" which
1437 is a template member function. So both lines are syntactically
1438 correct, and check_explicit_specialization does not reject
1441 Here, we can do better, as we are matching the specialization
1442 against the declarations. We count the number of template
1443 headers, and we check if they match TEMPLATE_COUNT + 1
1444 (TEMPLATE_COUNT is the number of qualifying template classes,
1445 plus there must be another header for the member template
1448 Notice that if header_count is zero, this is not a
1449 specialization but rather a template instantiation, so there
1450 is no check we can perform here. */
1451 if (header_count
&& header_count
!= template_count
+ 1)
1454 /* Check that the number of template arguments at the
1455 innermost level for DECL is the same as for FN. */
1456 if (current_binding_level
->kind
== sk_template_parms
1457 && !current_binding_level
->explicit_spec_p
1458 && (TREE_VEC_LENGTH (DECL_INNERMOST_TEMPLATE_PARMS (fn
))
1459 != TREE_VEC_LENGTH (INNERMOST_TEMPLATE_PARMS
1460 (current_template_parms
))))
1463 /* Function templates cannot be specializations; there are
1464 no partial specializations of functions. Therefore, if
1465 the type of DECL does not match FN, there is no
1467 if (tsk
== tsk_template
)
1469 if (compparms (TYPE_ARG_TYPES (TREE_TYPE (fn
)),
1471 candidates
= tree_cons (NULL_TREE
, fn
, candidates
);
1475 /* See whether this function might be a specialization of this
1477 targs
= get_bindings (fn
, decl
, explicit_targs
, /*check_ret=*/true);
1480 /* We cannot deduce template arguments that when used to
1481 specialize TMPL will produce DECL. */
1484 /* Save this template, and the arguments deduced. */
1485 templates
= tree_cons (targs
, fn
, templates
);
1487 else if (need_member_template
)
1488 /* FN is an ordinary member function, and we need a
1489 specialization of a member template. */
1491 else if (TREE_CODE (fn
) != FUNCTION_DECL
)
1492 /* We can get IDENTIFIER_NODEs here in certain erroneous
1495 else if (!DECL_FUNCTION_MEMBER_P (fn
))
1496 /* This is just an ordinary non-member function. Nothing can
1497 be a specialization of that. */
1499 else if (DECL_ARTIFICIAL (fn
))
1500 /* Cannot specialize functions that are created implicitly. */
1504 tree decl_arg_types
;
1506 /* This is an ordinary member function. However, since
1507 we're here, we can assume it's enclosing class is a
1508 template class. For example,
1510 template <typename T> struct S { void f(); };
1511 template <> void S<int>::f() {}
1513 Here, S<int>::f is a non-template, but S<int> is a
1514 template class. If FN has the same type as DECL, we
1515 might be in business. */
1517 if (!DECL_TEMPLATE_INFO (fn
))
1518 /* Its enclosing class is an explicit specialization
1519 of a template class. This is not a candidate. */
1522 if (!same_type_p (TREE_TYPE (TREE_TYPE (decl
)),
1523 TREE_TYPE (TREE_TYPE (fn
))))
1524 /* The return types differ. */
1527 /* Adjust the type of DECL in case FN is a static member. */
1528 decl_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
1529 if (DECL_STATIC_FUNCTION_P (fn
)
1530 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
1531 decl_arg_types
= TREE_CHAIN (decl_arg_types
);
1533 if (compparms (TYPE_ARG_TYPES (TREE_TYPE (fn
)),
1536 candidates
= tree_cons (NULL_TREE
, fn
, candidates
);
1540 if (templates
&& TREE_CHAIN (templates
))
1546 It is possible for a specialization with a given function
1547 signature to be instantiated from more than one function
1548 template. In such cases, explicit specification of the
1549 template arguments must be used to uniquely identify the
1550 function template specialization being specialized.
1552 Note that here, there's no suggestion that we're supposed to
1553 determine which of the candidate templates is most
1554 specialized. However, we, also have:
1558 Partial ordering of overloaded function template
1559 declarations is used in the following contexts to select
1560 the function template to which a function template
1561 specialization refers:
1563 -- when an explicit specialization refers to a function
1566 So, we do use the partial ordering rules, at least for now.
1567 This extension can only serve to make invalid programs valid,
1568 so it's safe. And, there is strong anecdotal evidence that
1569 the committee intended the partial ordering rules to apply;
1570 the EDG front-end has that behavior, and John Spicer claims
1571 that the committee simply forgot to delete the wording in
1572 [temp.expl.spec]. */
1573 tree tmpl
= most_specialized_instantiation (templates
);
1574 if (tmpl
!= error_mark_node
)
1577 TREE_CHAIN (templates
) = NULL_TREE
;
1581 if (templates
== NULL_TREE
&& candidates
== NULL_TREE
)
1583 error ("template-id %qD for %q+D does not match any template "
1584 "declaration", template_id
, decl
);
1585 return error_mark_node
;
1587 else if ((templates
&& TREE_CHAIN (templates
))
1588 || (candidates
&& TREE_CHAIN (candidates
))
1589 || (templates
&& candidates
))
1591 error ("ambiguous template specialization %qD for %q+D",
1593 chainon (candidates
, templates
);
1594 print_candidates (candidates
);
1595 return error_mark_node
;
1598 /* We have one, and exactly one, match. */
1601 tree fn
= TREE_VALUE (candidates
);
1602 /* DECL is a re-declaration of a template function. */
1603 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
1605 /* It was a specialization of an ordinary member function in a
1607 *targs_out
= copy_node (DECL_TI_ARGS (fn
));
1608 return DECL_TI_TEMPLATE (fn
);
1611 /* It was a specialization of a template. */
1612 targs
= DECL_TI_ARGS (DECL_TEMPLATE_RESULT (TREE_VALUE (templates
)));
1613 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (targs
))
1615 *targs_out
= copy_node (targs
);
1616 SET_TMPL_ARGS_LEVEL (*targs_out
,
1617 TMPL_ARGS_DEPTH (*targs_out
),
1618 TREE_PURPOSE (templates
));
1621 *targs_out
= TREE_PURPOSE (templates
);
1622 return TREE_VALUE (templates
);
1625 /* Returns a chain of parameter types, exactly like the SPEC_TYPES,
1626 but with the default argument values filled in from those in the
1630 copy_default_args_to_explicit_spec_1 (tree spec_types
,
1633 tree new_spec_types
;
1638 if (spec_types
== void_list_node
)
1639 return void_list_node
;
1641 /* Substitute into the rest of the list. */
1643 copy_default_args_to_explicit_spec_1 (TREE_CHAIN (spec_types
),
1644 TREE_CHAIN (tmpl_types
));
1646 /* Add the default argument for this parameter. */
1647 return hash_tree_cons (TREE_PURPOSE (tmpl_types
),
1648 TREE_VALUE (spec_types
),
1652 /* DECL is an explicit specialization. Replicate default arguments
1653 from the template it specializes. (That way, code like:
1655 template <class T> void f(T = 3);
1656 template <> void f(double);
1659 works, as required.) An alternative approach would be to look up
1660 the correct default arguments at the call-site, but this approach
1661 is consistent with how implicit instantiations are handled. */
1664 copy_default_args_to_explicit_spec (tree decl
)
1669 tree new_spec_types
;
1673 tree object_type
= NULL_TREE
;
1674 tree in_charge
= NULL_TREE
;
1675 tree vtt
= NULL_TREE
;
1677 /* See if there's anything we need to do. */
1678 tmpl
= DECL_TI_TEMPLATE (decl
);
1679 tmpl_types
= TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (tmpl
)));
1680 for (t
= tmpl_types
; t
; t
= TREE_CHAIN (t
))
1681 if (TREE_PURPOSE (t
))
1686 old_type
= TREE_TYPE (decl
);
1687 spec_types
= TYPE_ARG_TYPES (old_type
);
1689 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
1691 /* Remove the this pointer, but remember the object's type for
1693 object_type
= TREE_TYPE (TREE_VALUE (spec_types
));
1694 spec_types
= TREE_CHAIN (spec_types
);
1695 tmpl_types
= TREE_CHAIN (tmpl_types
);
1697 if (DECL_HAS_IN_CHARGE_PARM_P (decl
))
1699 /* DECL may contain more parameters than TMPL due to the extra
1700 in-charge parameter in constructors and destructors. */
1701 in_charge
= spec_types
;
1702 spec_types
= TREE_CHAIN (spec_types
);
1704 if (DECL_HAS_VTT_PARM_P (decl
))
1707 spec_types
= TREE_CHAIN (spec_types
);
1711 /* Compute the merged default arguments. */
1713 copy_default_args_to_explicit_spec_1 (spec_types
, tmpl_types
);
1715 /* Compute the new FUNCTION_TYPE. */
1719 new_spec_types
= hash_tree_cons (TREE_PURPOSE (vtt
),
1724 /* Put the in-charge parameter back. */
1725 new_spec_types
= hash_tree_cons (TREE_PURPOSE (in_charge
),
1726 TREE_VALUE (in_charge
),
1729 new_type
= build_method_type_directly (object_type
,
1730 TREE_TYPE (old_type
),
1734 new_type
= build_function_type (TREE_TYPE (old_type
),
1736 new_type
= cp_build_type_attribute_variant (new_type
,
1737 TYPE_ATTRIBUTES (old_type
));
1738 new_type
= build_exception_variant (new_type
,
1739 TYPE_RAISES_EXCEPTIONS (old_type
));
1740 TREE_TYPE (decl
) = new_type
;
1743 /* Check to see if the function just declared, as indicated in
1744 DECLARATOR, and in DECL, is a specialization of a function
1745 template. We may also discover that the declaration is an explicit
1746 instantiation at this point.
1748 Returns DECL, or an equivalent declaration that should be used
1749 instead if all goes well. Issues an error message if something is
1750 amiss. Returns error_mark_node if the error is not easily
1753 FLAGS is a bitmask consisting of the following flags:
1755 2: The function has a definition.
1756 4: The function is a friend.
1758 The TEMPLATE_COUNT is the number of references to qualifying
1759 template classes that appeared in the name of the function. For
1762 template <class T> struct S { void f(); };
1765 the TEMPLATE_COUNT would be 1. However, explicitly specialized
1766 classes are not counted in the TEMPLATE_COUNT, so that in
1768 template <class T> struct S {};
1769 template <> struct S<int> { void f(); }
1770 template <> void S<int>::f();
1772 the TEMPLATE_COUNT would be 0. (Note that this declaration is
1773 invalid; there should be no template <>.)
1775 If the function is a specialization, it is marked as such via
1776 DECL_TEMPLATE_SPECIALIZATION. Furthermore, its DECL_TEMPLATE_INFO
1777 is set up correctly, and it is added to the list of specializations
1778 for that template. */
1781 check_explicit_specialization (tree declarator
,
1786 int have_def
= flags
& 2;
1787 int is_friend
= flags
& 4;
1788 int specialization
= 0;
1789 int explicit_instantiation
= 0;
1790 int member_specialization
= 0;
1791 tree ctype
= DECL_CLASS_CONTEXT (decl
);
1792 tree dname
= DECL_NAME (decl
);
1797 if (!processing_specialization
)
1800 tsk
= tsk_excessive_parms
;
1803 tsk
= current_tmpl_spec_kind (template_count
);
1808 if (processing_specialization
)
1811 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
1813 else if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
1816 /* This could be something like:
1818 template <class T> void f(T);
1819 class S { friend void f<>(int); } */
1823 /* This case handles bogus declarations like template <>
1824 template <class T> void f<int>(); */
1826 error ("template-id %qD in declaration of primary template",
1833 case tsk_invalid_member_spec
:
1834 /* The error has already been reported in
1835 check_specialization_scope. */
1836 return error_mark_node
;
1838 case tsk_invalid_expl_inst
:
1839 error ("template parameter list used in explicit instantiation");
1845 error ("definition provided for explicit instantiation");
1847 explicit_instantiation
= 1;
1850 case tsk_excessive_parms
:
1851 case tsk_insufficient_parms
:
1852 if (tsk
== tsk_excessive_parms
)
1853 error ("too many template parameter lists in declaration of %qD",
1855 else if (template_header_count
)
1856 error("too few template parameter lists in declaration of %qD", decl
);
1858 error("explicit specialization of %qD must be introduced by "
1859 "%<template <>%>", decl
);
1863 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
1865 member_specialization
= 1;
1871 if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
1873 /* This case handles bogus declarations like template <>
1874 template <class T> void f<int>(); */
1876 if (uses_template_parms (declarator
))
1877 error ("function template partial specialization %qD "
1878 "is not allowed", declarator
);
1880 error ("template-id %qD in declaration of primary template",
1885 if (ctype
&& CLASSTYPE_TEMPLATE_INSTANTIATION (ctype
))
1886 /* This is a specialization of a member template, without
1887 specialization the containing class. Something like:
1889 template <class T> struct S {
1890 template <class U> void f (U);
1892 template <> template <class U> void S<int>::f(U) {}
1894 That's a specialization -- but of the entire template. */
1902 if (specialization
|| member_specialization
)
1904 tree t
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
1905 for (; t
; t
= TREE_CHAIN (t
))
1906 if (TREE_PURPOSE (t
))
1909 ("default argument specified in explicit specialization");
1914 if (specialization
|| member_specialization
|| explicit_instantiation
)
1916 tree tmpl
= NULL_TREE
;
1917 tree targs
= NULL_TREE
;
1919 /* Make sure that the declarator is a TEMPLATE_ID_EXPR. */
1920 if (TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
1924 gcc_assert (TREE_CODE (declarator
) == IDENTIFIER_NODE
);
1929 /* If there is no class context, the explicit instantiation
1930 must be at namespace scope. */
1931 gcc_assert (DECL_NAMESPACE_SCOPE_P (decl
));
1933 /* Find the namespace binding, using the declaration
1935 fns
= lookup_qualified_name (CP_DECL_CONTEXT (decl
), dname
,
1937 if (!fns
|| !is_overloaded_fn (fns
))
1939 error ("%qD is not a template function", dname
);
1940 fns
= error_mark_node
;
1944 tree fn
= OVL_CURRENT (fns
);
1945 if (!is_associated_namespace (CP_DECL_CONTEXT (decl
),
1946 CP_DECL_CONTEXT (fn
)))
1947 error ("%qD is not declared in %qD",
1948 decl
, current_namespace
);
1952 declarator
= lookup_template_function (fns
, NULL_TREE
);
1955 if (declarator
== error_mark_node
)
1956 return error_mark_node
;
1958 if (ctype
!= NULL_TREE
&& TYPE_BEING_DEFINED (ctype
))
1960 if (!explicit_instantiation
)
1961 /* A specialization in class scope. This is invalid,
1962 but the error will already have been flagged by
1963 check_specialization_scope. */
1964 return error_mark_node
;
1967 /* It's not valid to write an explicit instantiation in
1970 class C { template void f(); }
1972 This case is caught by the parser. However, on
1975 template class C { void f(); };
1977 (which is invalid) we can get here. The error will be
1984 else if (ctype
!= NULL_TREE
1985 && (TREE_CODE (TREE_OPERAND (declarator
, 0)) ==
1988 /* Find the list of functions in ctype that have the same
1989 name as the declared function. */
1990 tree name
= TREE_OPERAND (declarator
, 0);
1991 tree fns
= NULL_TREE
;
1994 if (constructor_name_p (name
, ctype
))
1996 int is_constructor
= DECL_CONSTRUCTOR_P (decl
);
1998 if (is_constructor
? !TYPE_HAS_CONSTRUCTOR (ctype
)
1999 : !CLASSTYPE_DESTRUCTORS (ctype
))
2001 /* From [temp.expl.spec]:
2003 If such an explicit specialization for the member
2004 of a class template names an implicitly-declared
2005 special member function (clause _special_), the
2006 program is ill-formed.
2008 Similar language is found in [temp.explicit]. */
2009 error ("specialization of implicitly-declared special member function");
2010 return error_mark_node
;
2013 name
= is_constructor
? ctor_identifier
: dtor_identifier
;
2016 if (!DECL_CONV_FN_P (decl
))
2018 idx
= lookup_fnfields_1 (ctype
, name
);
2020 fns
= VEC_index (tree
, CLASSTYPE_METHOD_VEC (ctype
), idx
);
2024 VEC(tree
,gc
) *methods
;
2027 /* For a type-conversion operator, we cannot do a
2028 name-based lookup. We might be looking for `operator
2029 int' which will be a specialization of `operator T'.
2030 So, we find *all* the conversion operators, and then
2031 select from them. */
2034 methods
= CLASSTYPE_METHOD_VEC (ctype
);
2036 for (idx
= CLASSTYPE_FIRST_CONVERSION_SLOT
;
2037 VEC_iterate (tree
, methods
, idx
, ovl
);
2040 if (!DECL_CONV_FN_P (OVL_CURRENT (ovl
)))
2041 /* There are no more conversion functions. */
2044 /* Glue all these conversion functions together
2045 with those we already have. */
2046 for (; ovl
; ovl
= OVL_NEXT (ovl
))
2047 fns
= ovl_cons (OVL_CURRENT (ovl
), fns
);
2051 if (fns
== NULL_TREE
)
2053 error ("no member function %qD declared in %qT", name
, ctype
);
2054 return error_mark_node
;
2057 TREE_OPERAND (declarator
, 0) = fns
;
2060 /* Figure out what exactly is being specialized at this point.
2061 Note that for an explicit instantiation, even one for a
2062 member function, we cannot tell apriori whether the
2063 instantiation is for a member template, or just a member
2064 function of a template class. Even if a member template is
2065 being instantiated, the member template arguments may be
2066 elided if they can be deduced from the rest of the
2068 tmpl
= determine_specialization (declarator
, decl
,
2070 member_specialization
,
2074 if (!tmpl
|| tmpl
== error_mark_node
)
2075 /* We couldn't figure out what this declaration was
2077 return error_mark_node
;
2080 tree gen_tmpl
= most_general_template (tmpl
);
2082 if (explicit_instantiation
)
2084 /* We don't set DECL_EXPLICIT_INSTANTIATION here; that
2085 is done by do_decl_instantiation later. */
2087 int arg_depth
= TMPL_ARGS_DEPTH (targs
);
2088 int parm_depth
= TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
));
2090 if (arg_depth
> parm_depth
)
2092 /* If TMPL is not the most general template (for
2093 example, if TMPL is a friend template that is
2094 injected into namespace scope), then there will
2095 be too many levels of TARGS. Remove some of them
2100 new_targs
= make_tree_vec (parm_depth
);
2101 for (i
= arg_depth
- parm_depth
; i
< arg_depth
; ++i
)
2102 TREE_VEC_ELT (new_targs
, i
- (arg_depth
- parm_depth
))
2103 = TREE_VEC_ELT (targs
, i
);
2107 return instantiate_template (tmpl
, targs
, tf_error
);
2110 /* If we thought that the DECL was a member function, but it
2111 turns out to be specializing a static member function,
2112 make DECL a static member function as well. */
2113 if (DECL_STATIC_FUNCTION_P (tmpl
)
2114 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
2115 revert_static_member_fn (decl
);
2117 /* If this is a specialization of a member template of a
2118 template class, we want to return the TEMPLATE_DECL, not
2119 the specialization of it. */
2120 if (tsk
== tsk_template
)
2122 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
2123 DECL_INITIAL (DECL_TEMPLATE_RESULT (tmpl
)) = NULL_TREE
;
2126 DECL_SOURCE_LOCATION (tmpl
) = DECL_SOURCE_LOCATION (decl
);
2127 DECL_SOURCE_LOCATION (DECL_TEMPLATE_RESULT (tmpl
))
2128 = DECL_SOURCE_LOCATION (decl
);
2129 /* We want to use the argument list specified in the
2130 definition, not in the original declaration. */
2131 DECL_ARGUMENTS (DECL_TEMPLATE_RESULT (tmpl
))
2132 = DECL_ARGUMENTS (decl
);
2137 /* Set up the DECL_TEMPLATE_INFO for DECL. */
2138 DECL_TEMPLATE_INFO (decl
) = tree_cons (tmpl
, targs
, NULL_TREE
);
2140 /* Inherit default function arguments from the template
2141 DECL is specializing. */
2142 copy_default_args_to_explicit_spec (decl
);
2144 /* This specialization has the same protection as the
2145 template it specializes. */
2146 TREE_PRIVATE (decl
) = TREE_PRIVATE (gen_tmpl
);
2147 TREE_PROTECTED (decl
) = TREE_PROTECTED (gen_tmpl
);
2149 /* If DECL is a friend declaration, declared using an
2150 unqualified name, the namespace associated with DECL may
2151 have been set incorrectly. For example, in:
2153 template <typename T> void f(T);
2155 struct S { friend void f<int>(int); }
2158 we will have set the DECL_CONTEXT for the friend
2159 declaration to N, rather than to the global namespace. */
2160 if (DECL_NAMESPACE_SCOPE_P (decl
))
2161 DECL_CONTEXT (decl
) = DECL_CONTEXT (tmpl
);
2163 if (is_friend
&& !have_def
)
2164 /* This is not really a declaration of a specialization.
2165 It's just the name of an instantiation. But, it's not
2166 a request for an instantiation, either. */
2167 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
2168 else if (DECL_CONSTRUCTOR_P (decl
) || DECL_DESTRUCTOR_P (decl
))
2169 /* This is indeed a specialization. In case of constructors
2170 and destructors, we need in-charge and not-in-charge
2171 versions in V3 ABI. */
2172 clone_function_decl (decl
, /*update_method_vec_p=*/0);
2174 /* Register this specialization so that we can find it
2176 decl
= register_specialization (decl
, gen_tmpl
, targs
, is_friend
);
2183 /* Returns 1 iff PARMS1 and PARMS2 are identical sets of template
2184 parameters. These are represented in the same format used for
2185 DECL_TEMPLATE_PARMS. */
2188 comp_template_parms (tree parms1
, tree parms2
)
2193 if (parms1
== parms2
)
2196 for (p1
= parms1
, p2
= parms2
;
2197 p1
!= NULL_TREE
&& p2
!= NULL_TREE
;
2198 p1
= TREE_CHAIN (p1
), p2
= TREE_CHAIN (p2
))
2200 tree t1
= TREE_VALUE (p1
);
2201 tree t2
= TREE_VALUE (p2
);
2204 gcc_assert (TREE_CODE (t1
) == TREE_VEC
);
2205 gcc_assert (TREE_CODE (t2
) == TREE_VEC
);
2207 if (TREE_VEC_LENGTH (t1
) != TREE_VEC_LENGTH (t2
))
2210 for (i
= 0; i
< TREE_VEC_LENGTH (t2
); ++i
)
2215 if (TREE_VEC_ELT (t1
, i
) == error_mark_node
2216 || TREE_VEC_ELT (t2
, i
) == error_mark_node
)
2219 parm1
= TREE_VALUE (TREE_VEC_ELT (t1
, i
));
2220 parm2
= TREE_VALUE (TREE_VEC_ELT (t2
, i
));
2222 if (TREE_CODE (parm1
) != TREE_CODE (parm2
))
2225 if (TREE_CODE (parm1
) == TEMPLATE_TYPE_PARM
)
2227 else if (!same_type_p (TREE_TYPE (parm1
), TREE_TYPE (parm2
)))
2232 if ((p1
!= NULL_TREE
) != (p2
!= NULL_TREE
))
2233 /* One set of parameters has more parameters lists than the
2240 /* Complain if DECL shadows a template parameter.
2242 [temp.local]: A template-parameter shall not be redeclared within its
2243 scope (including nested scopes). */
2246 check_template_shadow (tree decl
)
2250 /* If we're not in a template, we can't possibly shadow a template
2252 if (!current_template_parms
)
2255 /* Figure out what we're shadowing. */
2256 if (TREE_CODE (decl
) == OVERLOAD
)
2257 decl
= OVL_CURRENT (decl
);
2258 olddecl
= innermost_non_namespace_value (DECL_NAME (decl
));
2260 /* If there's no previous binding for this name, we're not shadowing
2261 anything, let alone a template parameter. */
2265 /* If we're not shadowing a template parameter, we're done. Note
2266 that OLDDECL might be an OVERLOAD (or perhaps even an
2267 ERROR_MARK), so we can't just blithely assume it to be a _DECL
2269 if (!DECL_P (olddecl
) || !DECL_TEMPLATE_PARM_P (olddecl
))
2272 /* We check for decl != olddecl to avoid bogus errors for using a
2273 name inside a class. We check TPFI to avoid duplicate errors for
2274 inline member templates. */
2276 || TEMPLATE_PARMS_FOR_INLINE (current_template_parms
))
2279 error ("declaration of %q+#D", decl
);
2280 error (" shadows template parm %q+#D", olddecl
);
2283 /* Return a new TEMPLATE_PARM_INDEX with the indicated INDEX, LEVEL,
2284 ORIG_LEVEL, DECL, and TYPE. */
2287 build_template_parm_index (int index
,
2293 tree t
= make_node (TEMPLATE_PARM_INDEX
);
2294 TEMPLATE_PARM_IDX (t
) = index
;
2295 TEMPLATE_PARM_LEVEL (t
) = level
;
2296 TEMPLATE_PARM_ORIG_LEVEL (t
) = orig_level
;
2297 TEMPLATE_PARM_DECL (t
) = decl
;
2298 TREE_TYPE (t
) = type
;
2299 TREE_CONSTANT (t
) = TREE_CONSTANT (decl
);
2300 TREE_INVARIANT (t
) = TREE_INVARIANT (decl
);
2301 TREE_READONLY (t
) = TREE_READONLY (decl
);
2306 /* Return a TEMPLATE_PARM_INDEX, similar to INDEX, but whose
2307 TEMPLATE_PARM_LEVEL has been decreased by LEVELS. If such a
2308 TEMPLATE_PARM_INDEX already exists, it is returned; otherwise, a
2309 new one is created. */
2312 reduce_template_parm_level (tree index
, tree type
, int levels
)
2314 if (TEMPLATE_PARM_DESCENDANTS (index
) == NULL_TREE
2315 || (TEMPLATE_PARM_LEVEL (TEMPLATE_PARM_DESCENDANTS (index
))
2316 != TEMPLATE_PARM_LEVEL (index
) - levels
))
2318 tree orig_decl
= TEMPLATE_PARM_DECL (index
);
2321 decl
= build_decl (TREE_CODE (orig_decl
), DECL_NAME (orig_decl
), type
);
2322 TREE_CONSTANT (decl
) = TREE_CONSTANT (orig_decl
);
2323 TREE_INVARIANT (decl
) = TREE_INVARIANT (orig_decl
);
2324 TREE_READONLY (decl
) = TREE_READONLY (orig_decl
);
2325 DECL_ARTIFICIAL (decl
) = 1;
2326 SET_DECL_TEMPLATE_PARM_P (decl
);
2328 t
= build_template_parm_index (TEMPLATE_PARM_IDX (index
),
2329 TEMPLATE_PARM_LEVEL (index
) - levels
,
2330 TEMPLATE_PARM_ORIG_LEVEL (index
),
2332 TEMPLATE_PARM_DESCENDANTS (index
) = t
;
2334 /* Template template parameters need this. */
2335 if (TREE_CODE (decl
) != CONST_DECL
)
2336 DECL_TEMPLATE_PARMS (decl
)
2337 = DECL_TEMPLATE_PARMS (TEMPLATE_PARM_DECL (index
));
2340 return TEMPLATE_PARM_DESCENDANTS (index
);
2343 /* Process information from new template parameter PARM and append it to the
2344 LIST being built. This new parameter is a non-type parameter iff
2345 IS_NON_TYPE is true. */
2348 process_template_parm (tree list
, tree parm
, bool is_non_type
)
2354 gcc_assert (TREE_CODE (parm
) == TREE_LIST
);
2355 defval
= TREE_PURPOSE (parm
);
2359 tree p
= TREE_VALUE (tree_last (list
));
2361 if (TREE_CODE (p
) == TYPE_DECL
|| TREE_CODE (p
) == TEMPLATE_DECL
)
2362 idx
= TEMPLATE_TYPE_IDX (TREE_TYPE (p
));
2364 idx
= TEMPLATE_PARM_IDX (DECL_INITIAL (p
));
2372 parm
= TREE_VALUE (parm
);
2374 SET_DECL_TEMPLATE_PARM_P (parm
);
2376 if (TREE_TYPE (parm
) == error_mark_node
)
2377 return chainon(list
, error_mark_node
);
2382 The top-level cv-qualifiers on the template-parameter are
2383 ignored when determining its type. */
2384 TREE_TYPE (parm
) = TYPE_MAIN_VARIANT (TREE_TYPE (parm
));
2385 if (invalid_nontype_parm_type_p (TREE_TYPE (parm
), 1))
2386 return chainon(list
, error_mark_node
);
2389 /* A template parameter is not modifiable. */
2390 TREE_CONSTANT (parm
) = 1;
2391 TREE_INVARIANT (parm
) = 1;
2392 TREE_READONLY (parm
) = 1;
2393 decl
= build_decl (CONST_DECL
, DECL_NAME (parm
), TREE_TYPE (parm
));
2394 TREE_CONSTANT (decl
) = 1;
2395 TREE_INVARIANT (decl
) = 1;
2396 TREE_READONLY (decl
) = 1;
2397 DECL_INITIAL (parm
) = DECL_INITIAL (decl
)
2398 = build_template_parm_index (idx
, processing_template_decl
,
2399 processing_template_decl
,
2400 decl
, TREE_TYPE (parm
));
2405 parm
= TREE_VALUE (TREE_VALUE (parm
));
2407 if (parm
&& TREE_CODE (parm
) == TEMPLATE_DECL
)
2409 t
= make_aggr_type (TEMPLATE_TEMPLATE_PARM
);
2410 /* This is for distinguishing between real templates and template
2411 template parameters */
2412 TREE_TYPE (parm
) = t
;
2413 TREE_TYPE (DECL_TEMPLATE_RESULT (parm
)) = t
;
2418 t
= make_aggr_type (TEMPLATE_TYPE_PARM
);
2419 /* parm is either IDENTIFIER_NODE or NULL_TREE. */
2420 decl
= build_decl (TYPE_DECL
, parm
, t
);
2423 TYPE_NAME (t
) = decl
;
2424 TYPE_STUB_DECL (t
) = decl
;
2426 TEMPLATE_TYPE_PARM_INDEX (t
)
2427 = build_template_parm_index (idx
, processing_template_decl
,
2428 processing_template_decl
,
2429 decl
, TREE_TYPE (parm
));
2431 DECL_ARTIFICIAL (decl
) = 1;
2432 SET_DECL_TEMPLATE_PARM_P (decl
);
2434 parm
= build_tree_list (defval
, parm
);
2435 return chainon (list
, parm
);
2438 /* The end of a template parameter list has been reached. Process the
2439 tree list into a parameter vector, converting each parameter into a more
2440 useful form. Type parameters are saved as IDENTIFIER_NODEs, and others
2444 end_template_parm_list (tree parms
)
2448 tree saved_parmlist
= make_tree_vec (list_length (parms
));
2450 current_template_parms
2451 = tree_cons (size_int (processing_template_decl
),
2452 saved_parmlist
, current_template_parms
);
2454 for (parm
= parms
, nparms
= 0; parm
; parm
= next
, nparms
++)
2456 next
= TREE_CHAIN (parm
);
2457 TREE_VEC_ELT (saved_parmlist
, nparms
) = parm
;
2458 TREE_CHAIN (parm
) = NULL_TREE
;
2461 --processing_template_parmlist
;
2463 return saved_parmlist
;
2466 /* end_template_decl is called after a template declaration is seen. */
2469 end_template_decl (void)
2471 reset_specialization ();
2473 if (! processing_template_decl
)
2476 /* This matches the pushlevel in begin_template_parm_list. */
2479 --processing_template_decl
;
2480 current_template_parms
= TREE_CHAIN (current_template_parms
);
2483 /* Given a template argument vector containing the template PARMS.
2484 The innermost PARMS are given first. */
2487 current_template_args (void)
2490 tree args
= NULL_TREE
;
2491 int length
= TMPL_PARMS_DEPTH (current_template_parms
);
2494 /* If there is only one level of template parameters, we do not
2495 create a TREE_VEC of TREE_VECs. Instead, we return a single
2496 TREE_VEC containing the arguments. */
2498 args
= make_tree_vec (length
);
2500 for (header
= current_template_parms
; header
; header
= TREE_CHAIN (header
))
2502 tree a
= copy_node (TREE_VALUE (header
));
2505 TREE_TYPE (a
) = NULL_TREE
;
2506 for (i
= TREE_VEC_LENGTH (a
) - 1; i
>= 0; --i
)
2508 tree t
= TREE_VEC_ELT (a
, i
);
2510 /* T will be a list if we are called from within a
2511 begin/end_template_parm_list pair, but a vector directly
2512 if within a begin/end_member_template_processing pair. */
2513 if (TREE_CODE (t
) == TREE_LIST
)
2517 if (TREE_CODE (t
) == TYPE_DECL
2518 || TREE_CODE (t
) == TEMPLATE_DECL
)
2521 t
= DECL_INITIAL (t
);
2522 TREE_VEC_ELT (a
, i
) = t
;
2527 TREE_VEC_ELT (args
, --l
) = a
;
2535 /* Return a TEMPLATE_DECL corresponding to DECL, using the indicated
2536 template PARMS. If MEMBER_TEMPLATE_P is true, the new template is
2537 a member template. Used by push_template_decl below. */
2540 build_template_decl (tree decl
, tree parms
, bool member_template_p
)
2542 tree tmpl
= build_lang_decl (TEMPLATE_DECL
, DECL_NAME (decl
), NULL_TREE
);
2543 DECL_TEMPLATE_PARMS (tmpl
) = parms
;
2544 DECL_CONTEXT (tmpl
) = DECL_CONTEXT (decl
);
2545 DECL_MEMBER_TEMPLATE_P (tmpl
) = member_template_p
;
2546 if (DECL_LANG_SPECIFIC (decl
))
2548 DECL_STATIC_FUNCTION_P (tmpl
) = DECL_STATIC_FUNCTION_P (decl
);
2549 DECL_CONSTRUCTOR_P (tmpl
) = DECL_CONSTRUCTOR_P (decl
);
2550 DECL_DESTRUCTOR_P (tmpl
) = DECL_DESTRUCTOR_P (decl
);
2551 DECL_NONCONVERTING_P (tmpl
) = DECL_NONCONVERTING_P (decl
);
2552 DECL_ASSIGNMENT_OPERATOR_P (tmpl
) = DECL_ASSIGNMENT_OPERATOR_P (decl
);
2553 if (DECL_OVERLOADED_OPERATOR_P (decl
))
2554 SET_OVERLOADED_OPERATOR_CODE (tmpl
,
2555 DECL_OVERLOADED_OPERATOR_P (decl
));
2561 struct template_parm_data
2563 /* The level of the template parameters we are currently
2567 /* The index of the specialization argument we are currently
2571 /* An array whose size is the number of template parameters. The
2572 elements are nonzero if the parameter has been used in any one
2573 of the arguments processed so far. */
2576 /* An array whose size is the number of template arguments. The
2577 elements are nonzero if the argument makes use of template
2578 parameters of this level. */
2579 int* arg_uses_template_parms
;
2582 /* Subroutine of push_template_decl used to see if each template
2583 parameter in a partial specialization is used in the explicit
2584 argument list. If T is of the LEVEL given in DATA (which is
2585 treated as a template_parm_data*), then DATA->PARMS is marked
2589 mark_template_parm (tree t
, void* data
)
2593 struct template_parm_data
* tpd
= (struct template_parm_data
*) data
;
2595 if (TREE_CODE (t
) == TEMPLATE_PARM_INDEX
)
2597 level
= TEMPLATE_PARM_LEVEL (t
);
2598 idx
= TEMPLATE_PARM_IDX (t
);
2602 level
= TEMPLATE_TYPE_LEVEL (t
);
2603 idx
= TEMPLATE_TYPE_IDX (t
);
2606 if (level
== tpd
->level
)
2608 tpd
->parms
[idx
] = 1;
2609 tpd
->arg_uses_template_parms
[tpd
->current_arg
] = 1;
2612 /* Return zero so that for_each_template_parm will continue the
2613 traversal of the tree; we want to mark *every* template parm. */
2617 /* Process the partial specialization DECL. */
2620 process_partial_specialization (tree decl
)
2622 tree type
= TREE_TYPE (decl
);
2623 tree maintmpl
= CLASSTYPE_TI_TEMPLATE (type
);
2624 tree specargs
= CLASSTYPE_TI_ARGS (type
);
2625 tree inner_args
= INNERMOST_TEMPLATE_ARGS (specargs
);
2626 tree inner_parms
= INNERMOST_TEMPLATE_PARMS (current_template_parms
);
2627 tree main_inner_parms
= DECL_INNERMOST_TEMPLATE_PARMS (maintmpl
);
2628 int nargs
= TREE_VEC_LENGTH (inner_args
);
2629 int ntparms
= TREE_VEC_LENGTH (inner_parms
);
2631 int did_error_intro
= 0;
2632 struct template_parm_data tpd
;
2633 struct template_parm_data tpd2
;
2635 /* We check that each of the template parameters given in the
2636 partial specialization is used in the argument list to the
2637 specialization. For example:
2639 template <class T> struct S;
2640 template <class T> struct S<T*>;
2642 The second declaration is OK because `T*' uses the template
2643 parameter T, whereas
2645 template <class T> struct S<int>;
2647 is no good. Even trickier is:
2658 The S2<T> declaration is actually invalid; it is a
2659 full-specialization. Of course,
2662 struct S2<T (*)(U)>;
2664 or some such would have been OK. */
2665 tpd
.level
= TMPL_PARMS_DEPTH (current_template_parms
);
2666 tpd
.parms
= (int *) alloca (sizeof (int) * ntparms
);
2667 memset (tpd
.parms
, 0, sizeof (int) * ntparms
);
2669 tpd
.arg_uses_template_parms
= (int *) alloca (sizeof (int) * nargs
);
2670 memset (tpd
.arg_uses_template_parms
, 0, sizeof (int) * nargs
);
2671 for (i
= 0; i
< nargs
; ++i
)
2673 tpd
.current_arg
= i
;
2674 for_each_template_parm (TREE_VEC_ELT (inner_args
, i
),
2675 &mark_template_parm
,
2679 for (i
= 0; i
< ntparms
; ++i
)
2680 if (tpd
.parms
[i
] == 0)
2682 /* One of the template parms was not used in the
2684 if (!did_error_intro
)
2686 error ("template parameters not used in partial specialization:");
2687 did_error_intro
= 1;
2690 error (" %qD", TREE_VALUE (TREE_VEC_ELT (inner_parms
, i
)));
2693 /* [temp.class.spec]
2695 The argument list of the specialization shall not be identical to
2696 the implicit argument list of the primary template. */
2697 if (comp_template_args
2699 INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE
2701 error ("partial specialization %qT does not specialize any template arguments", type
);
2703 /* [temp.class.spec]
2705 A partially specialized non-type argument expression shall not
2706 involve template parameters of the partial specialization except
2707 when the argument expression is a simple identifier.
2709 The type of a template parameter corresponding to a specialized
2710 non-type argument shall not be dependent on a parameter of the
2712 gcc_assert (nargs
== DECL_NTPARMS (maintmpl
));
2714 for (i
= 0; i
< nargs
; ++i
)
2716 tree arg
= TREE_VEC_ELT (inner_args
, i
);
2717 if (/* These first two lines are the `non-type' bit. */
2719 && TREE_CODE (arg
) != TEMPLATE_DECL
2720 /* This next line is the `argument expression is not just a
2721 simple identifier' condition and also the `specialized
2722 non-type argument' bit. */
2723 && TREE_CODE (arg
) != TEMPLATE_PARM_INDEX
)
2725 if (tpd
.arg_uses_template_parms
[i
])
2726 error ("template argument %qE involves template parameter(s)", arg
);
2729 /* Look at the corresponding template parameter,
2730 marking which template parameters its type depends
2733 TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (main_inner_parms
,
2738 /* We haven't yet initialized TPD2. Do so now. */
2739 tpd2
.arg_uses_template_parms
2740 = (int *) alloca (sizeof (int) * nargs
);
2741 /* The number of parameters here is the number in the
2742 main template, which, as checked in the assertion
2744 tpd2
.parms
= (int *) alloca (sizeof (int) * nargs
);
2746 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (maintmpl
));
2749 /* Mark the template parameters. But this time, we're
2750 looking for the template parameters of the main
2751 template, not in the specialization. */
2752 tpd2
.current_arg
= i
;
2753 tpd2
.arg_uses_template_parms
[i
] = 0;
2754 memset (tpd2
.parms
, 0, sizeof (int) * nargs
);
2755 for_each_template_parm (type
,
2756 &mark_template_parm
,
2760 if (tpd2
.arg_uses_template_parms
[i
])
2762 /* The type depended on some template parameters.
2763 If they are fully specialized in the
2764 specialization, that's OK. */
2766 for (j
= 0; j
< nargs
; ++j
)
2767 if (tpd2
.parms
[j
] != 0
2768 && tpd
.arg_uses_template_parms
[j
])
2770 error ("type %qT of template argument %qE depends "
2771 "on template parameter(s)",
2781 if (retrieve_specialization (maintmpl
, specargs
,
2782 /*class_specializations_p=*/true))
2783 /* We've already got this specialization. */
2786 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)
2787 = tree_cons (specargs
, inner_parms
,
2788 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
));
2789 TREE_TYPE (DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)) = type
;
2793 /* Check that a template declaration's use of default arguments is not
2794 invalid. Here, PARMS are the template parameters. IS_PRIMARY is
2795 nonzero if DECL is the thing declared by a primary template.
2796 IS_PARTIAL is nonzero if DECL is a partial specialization. */
2799 check_default_tmpl_args (tree decl
, tree parms
, int is_primary
, int is_partial
)
2802 int last_level_to_check
;
2807 A default template-argument shall not be specified in a
2808 function template declaration or a function template definition, nor
2809 in the template-parameter-list of the definition of a member of a
2812 if (TREE_CODE (CP_DECL_CONTEXT (decl
)) == FUNCTION_DECL
)
2813 /* You can't have a function template declaration in a local
2814 scope, nor you can you define a member of a class template in a
2818 if (current_class_type
2819 && !TYPE_BEING_DEFINED (current_class_type
)
2820 && DECL_LANG_SPECIFIC (decl
)
2821 /* If this is either a friend defined in the scope of the class
2822 or a member function. */
2823 && (DECL_FUNCTION_MEMBER_P (decl
)
2824 ? same_type_p (DECL_CONTEXT (decl
), current_class_type
)
2825 : DECL_FRIEND_CONTEXT (decl
)
2826 ? same_type_p (DECL_FRIEND_CONTEXT (decl
), current_class_type
)
2828 /* And, if it was a member function, it really was defined in
2829 the scope of the class. */
2830 && (!DECL_FUNCTION_MEMBER_P (decl
)
2831 || DECL_INITIALIZED_IN_CLASS_P (decl
)))
2832 /* We already checked these parameters when the template was
2833 declared, so there's no need to do it again now. This function
2834 was defined in class scope, but we're processing it's body now
2835 that the class is complete. */
2840 If a template-parameter has a default template-argument, all
2841 subsequent template-parameters shall have a default
2842 template-argument supplied. */
2843 for (parm_level
= parms
; parm_level
; parm_level
= TREE_CHAIN (parm_level
))
2845 tree inner_parms
= TREE_VALUE (parm_level
);
2846 int ntparms
= TREE_VEC_LENGTH (inner_parms
);
2847 int seen_def_arg_p
= 0;
2850 for (i
= 0; i
< ntparms
; ++i
)
2852 tree parm
= TREE_VEC_ELT (inner_parms
, i
);
2854 if (parm
== error_mark_node
)
2857 if (TREE_PURPOSE (parm
))
2859 else if (seen_def_arg_p
)
2861 error ("no default argument for %qD", TREE_VALUE (parm
));
2862 /* For better subsequent error-recovery, we indicate that
2863 there should have been a default argument. */
2864 TREE_PURPOSE (parm
) = error_mark_node
;
2869 if (TREE_CODE (decl
) != TYPE_DECL
|| is_partial
|| !is_primary
)
2870 /* For an ordinary class template, default template arguments are
2871 allowed at the innermost level, e.g.:
2872 template <class T = int>
2874 but, in a partial specialization, they're not allowed even
2875 there, as we have in [temp.class.spec]:
2877 The template parameter list of a specialization shall not
2878 contain default template argument values.
2880 So, for a partial specialization, or for a function template,
2881 we look at all of them. */
2884 /* But, for a primary class template that is not a partial
2885 specialization we look at all template parameters except the
2887 parms
= TREE_CHAIN (parms
);
2889 /* Figure out what error message to issue. */
2890 if (TREE_CODE (decl
) == FUNCTION_DECL
)
2891 msg
= "default template arguments may not be used in function templates";
2892 else if (is_partial
)
2893 msg
= "default template arguments may not be used in partial specializations";
2895 msg
= "default argument for template parameter for class enclosing %qD";
2897 if (current_class_type
&& TYPE_BEING_DEFINED (current_class_type
))
2898 /* If we're inside a class definition, there's no need to
2899 examine the parameters to the class itself. On the one
2900 hand, they will be checked when the class is defined, and,
2901 on the other, default arguments are valid in things like:
2902 template <class T = double>
2903 struct S { template <class U> void f(U); };
2904 Here the default argument for `S' has no bearing on the
2905 declaration of `f'. */
2906 last_level_to_check
= template_class_depth (current_class_type
) + 1;
2908 /* Check everything. */
2909 last_level_to_check
= 0;
2911 for (parm_level
= parms
;
2912 parm_level
&& TMPL_PARMS_DEPTH (parm_level
) >= last_level_to_check
;
2913 parm_level
= TREE_CHAIN (parm_level
))
2915 tree inner_parms
= TREE_VALUE (parm_level
);
2919 ntparms
= TREE_VEC_LENGTH (inner_parms
);
2920 for (i
= 0; i
< ntparms
; ++i
)
2922 if (TREE_VEC_ELT (inner_parms
, i
) == error_mark_node
)
2925 if (TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)))
2933 /* Clear out the default argument so that we are not
2935 TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)) = NULL_TREE
;
2939 /* At this point, if we're still interested in issuing messages,
2940 they must apply to classes surrounding the object declared. */
2942 msg
= "default argument for template parameter for class enclosing %qD";
2946 /* Worker for push_template_decl_real, called via
2947 for_each_template_parm. DATA is really an int, indicating the
2948 level of the parameters we are interested in. If T is a template
2949 parameter of that level, return nonzero. */
2952 template_parm_this_level_p (tree t
, void* data
)
2954 int this_level
= *(int *)data
;
2957 if (TREE_CODE (t
) == TEMPLATE_PARM_INDEX
)
2958 level
= TEMPLATE_PARM_LEVEL (t
);
2960 level
= TEMPLATE_TYPE_LEVEL (t
);
2961 return level
== this_level
;
2964 /* Creates a TEMPLATE_DECL for the indicated DECL using the template
2965 parameters given by current_template_args, or reuses a
2966 previously existing one, if appropriate. Returns the DECL, or an
2967 equivalent one, if it is replaced via a call to duplicate_decls.
2969 If IS_FRIEND is true, DECL is a friend declaration. */
2972 push_template_decl_real (tree decl
, bool is_friend
)
2980 int new_template_p
= 0;
2981 /* True if the template is a member template, in the sense of
2983 bool member_template_p
= false;
2985 if (decl
== error_mark_node
)
2988 /* See if this is a partial specialization. */
2989 is_partial
= (DECL_IMPLICIT_TYPEDEF_P (decl
)
2990 && TREE_CODE (TREE_TYPE (decl
)) != ENUMERAL_TYPE
2991 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl
)));
2993 if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_FRIEND_P (decl
))
2997 /* For a friend, we want the context of the friend function, not
2998 the type of which it is a friend. */
2999 ctx
= DECL_CONTEXT (decl
);
3000 else if (CP_DECL_CONTEXT (decl
)
3001 && TREE_CODE (CP_DECL_CONTEXT (decl
)) != NAMESPACE_DECL
)
3002 /* In the case of a virtual function, we want the class in which
3004 ctx
= CP_DECL_CONTEXT (decl
);
3006 /* Otherwise, if we're currently defining some class, the DECL
3007 is assumed to be a member of the class. */
3008 ctx
= current_scope ();
3010 if (ctx
&& TREE_CODE (ctx
) == NAMESPACE_DECL
)
3013 if (!DECL_CONTEXT (decl
))
3014 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
3016 /* See if this is a primary template. */
3017 primary
= template_parm_scope_p ();
3021 if (DECL_CLASS_SCOPE_P (decl
))
3022 member_template_p
= true;
3023 if (TREE_CODE (decl
) == TYPE_DECL
3024 && ANON_AGGRNAME_P (DECL_NAME (decl
)))
3025 error ("template class without a name");
3026 else if (TREE_CODE (decl
) == FUNCTION_DECL
)
3028 if (DECL_DESTRUCTOR_P (decl
))
3032 A destructor shall not be a member template. */
3033 error ("destructor %qD declared as member template", decl
);
3034 return error_mark_node
;
3036 if (NEW_DELETE_OPNAME_P (DECL_NAME (decl
))
3037 && (!TYPE_ARG_TYPES (TREE_TYPE (decl
))
3038 || TYPE_ARG_TYPES (TREE_TYPE (decl
)) == void_list_node
3039 || !TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)))
3040 || (TREE_CHAIN (TYPE_ARG_TYPES ((TREE_TYPE (decl
))))
3041 == void_list_node
)))
3043 /* [basic.stc.dynamic.allocation]
3045 An allocation function can be a function
3046 template. ... Template allocation functions shall
3047 have two or more parameters. */
3048 error ("invalid template declaration of %qD", decl
);
3049 return error_mark_node
;
3052 else if (DECL_IMPLICIT_TYPEDEF_P (decl
)
3053 && CLASS_TYPE_P (TREE_TYPE (decl
)))
3057 error ("template declaration of %q#D", decl
);
3058 return error_mark_node
;
3062 /* Check to see that the rules regarding the use of default
3063 arguments are not being violated. */
3064 check_default_tmpl_args (decl
, current_template_parms
,
3065 primary
, is_partial
);
3068 return process_partial_specialization (decl
);
3070 args
= current_template_args ();
3073 || TREE_CODE (ctx
) == FUNCTION_DECL
3074 || (CLASS_TYPE_P (ctx
) && TYPE_BEING_DEFINED (ctx
))
3075 || (is_friend
&& !DECL_TEMPLATE_INFO (decl
)))
3077 if (DECL_LANG_SPECIFIC (decl
)
3078 && DECL_TEMPLATE_INFO (decl
)
3079 && DECL_TI_TEMPLATE (decl
))
3080 tmpl
= DECL_TI_TEMPLATE (decl
);
3081 /* If DECL is a TYPE_DECL for a class-template, then there won't
3082 be DECL_LANG_SPECIFIC. The information equivalent to
3083 DECL_TEMPLATE_INFO is found in TYPE_TEMPLATE_INFO instead. */
3084 else if (DECL_IMPLICIT_TYPEDEF_P (decl
)
3085 && TYPE_TEMPLATE_INFO (TREE_TYPE (decl
))
3086 && TYPE_TI_TEMPLATE (TREE_TYPE (decl
)))
3088 /* Since a template declaration already existed for this
3089 class-type, we must be redeclaring it here. Make sure
3090 that the redeclaration is valid. */
3091 redeclare_class_template (TREE_TYPE (decl
),
3092 current_template_parms
);
3093 /* We don't need to create a new TEMPLATE_DECL; just use the
3094 one we already had. */
3095 tmpl
= TYPE_TI_TEMPLATE (TREE_TYPE (decl
));
3099 tmpl
= build_template_decl (decl
, current_template_parms
,
3103 if (DECL_LANG_SPECIFIC (decl
)
3104 && DECL_TEMPLATE_SPECIALIZATION (decl
))
3106 /* A specialization of a member template of a template
3108 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
3109 DECL_TEMPLATE_INFO (tmpl
) = DECL_TEMPLATE_INFO (decl
);
3110 DECL_TEMPLATE_INFO (decl
) = NULL_TREE
;
3116 tree a
, t
, current
, parms
;
3119 if (TREE_CODE (decl
) == TYPE_DECL
)
3121 if ((IS_AGGR_TYPE_CODE (TREE_CODE (TREE_TYPE (decl
)))
3122 || TREE_CODE (TREE_TYPE (decl
)) == ENUMERAL_TYPE
)
3123 && TYPE_TEMPLATE_INFO (TREE_TYPE (decl
))
3124 && TYPE_TI_TEMPLATE (TREE_TYPE (decl
)))
3125 tmpl
= TYPE_TI_TEMPLATE (TREE_TYPE (decl
));
3128 error ("%qD does not declare a template type", decl
);
3132 else if (!DECL_LANG_SPECIFIC (decl
) || !DECL_TEMPLATE_INFO (decl
))
3134 error ("template definition of non-template %q#D", decl
);
3138 tmpl
= DECL_TI_TEMPLATE (decl
);
3140 if (DECL_FUNCTION_TEMPLATE_P (tmpl
)
3141 && DECL_TEMPLATE_INFO (decl
) && DECL_TI_ARGS (decl
)
3142 && DECL_TEMPLATE_SPECIALIZATION (decl
)
3143 && DECL_MEMBER_TEMPLATE_P (tmpl
))
3147 /* The declaration is a specialization of a member
3148 template, declared outside the class. Therefore, the
3149 innermost template arguments will be NULL, so we
3150 replace them with the arguments determined by the
3151 earlier call to check_explicit_specialization. */
3152 args
= DECL_TI_ARGS (decl
);
3155 = build_template_decl (decl
, current_template_parms
,
3157 DECL_TEMPLATE_RESULT (new_tmpl
) = decl
;
3158 TREE_TYPE (new_tmpl
) = TREE_TYPE (decl
);
3159 DECL_TI_TEMPLATE (decl
) = new_tmpl
;
3160 SET_DECL_TEMPLATE_SPECIALIZATION (new_tmpl
);
3161 DECL_TEMPLATE_INFO (new_tmpl
)
3162 = tree_cons (tmpl
, args
, NULL_TREE
);
3164 register_specialization (new_tmpl
,
3165 most_general_template (tmpl
),
3171 /* Make sure the template headers we got make sense. */
3173 parms
= DECL_TEMPLATE_PARMS (tmpl
);
3174 i
= TMPL_PARMS_DEPTH (parms
);
3175 if (TMPL_ARGS_DEPTH (args
) != i
)
3177 error ("expected %d levels of template parms for %q#D, got %d",
3178 i
, decl
, TMPL_ARGS_DEPTH (args
));
3181 for (current
= decl
; i
> 0; --i
, parms
= TREE_CHAIN (parms
))
3183 a
= TMPL_ARGS_LEVEL (args
, i
);
3184 t
= INNERMOST_TEMPLATE_PARMS (parms
);
3186 if (TREE_VEC_LENGTH (t
) != TREE_VEC_LENGTH (a
))
3188 if (current
== decl
)
3189 error ("got %d template parameters for %q#D",
3190 TREE_VEC_LENGTH (a
), decl
);
3192 error ("got %d template parameters for %q#T",
3193 TREE_VEC_LENGTH (a
), current
);
3194 error (" but %d required", TREE_VEC_LENGTH (t
));
3195 return error_mark_node
;
3198 /* Perhaps we should also check that the parms are used in the
3199 appropriate qualifying scopes in the declarator? */
3201 if (current
== decl
)
3204 current
= TYPE_CONTEXT (current
);
3208 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
3209 TREE_TYPE (tmpl
) = TREE_TYPE (decl
);
3211 /* Push template declarations for global functions and types. Note
3212 that we do not try to push a global template friend declared in a
3213 template class; such a thing may well depend on the template
3214 parameters of the class. */
3215 if (new_template_p
&& !ctx
3216 && !(is_friend
&& template_class_depth (current_class_type
) > 0))
3218 tmpl
= pushdecl_namespace_level (tmpl
, is_friend
);
3219 if (tmpl
== error_mark_node
)
3220 return error_mark_node
;
3222 /* Hide template friend classes that haven't been declared yet. */
3223 if (is_friend
&& TREE_CODE (decl
) == TYPE_DECL
)
3225 DECL_ANTICIPATED (tmpl
) = 1;
3226 DECL_FRIEND_P (tmpl
) = 1;
3232 DECL_PRIMARY_TEMPLATE (tmpl
) = tmpl
;
3233 if (DECL_CONV_FN_P (tmpl
))
3235 int depth
= TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
));
3237 /* It is a conversion operator. See if the type converted to
3238 depends on innermost template operands. */
3240 if (uses_template_parms_level (TREE_TYPE (TREE_TYPE (tmpl
)),
3242 DECL_TEMPLATE_CONV_FN_P (tmpl
) = 1;
3246 /* The DECL_TI_ARGS of DECL contains full set of arguments referring
3247 back to its most general template. If TMPL is a specialization,
3248 ARGS may only have the innermost set of arguments. Add the missing
3249 argument levels if necessary. */
3250 if (DECL_TEMPLATE_INFO (tmpl
))
3251 args
= add_outermost_template_args (DECL_TI_ARGS (tmpl
), args
);
3253 info
= tree_cons (tmpl
, args
, NULL_TREE
);
3255 if (DECL_IMPLICIT_TYPEDEF_P (decl
))
3257 SET_TYPE_TEMPLATE_INFO (TREE_TYPE (tmpl
), info
);
3258 if ((!ctx
|| TREE_CODE (ctx
) != FUNCTION_DECL
)
3259 && TREE_CODE (TREE_TYPE (decl
)) != ENUMERAL_TYPE
3260 /* Don't change the name if we've already set it up. */
3261 && !IDENTIFIER_TEMPLATE (DECL_NAME (decl
)))
3262 DECL_NAME (decl
) = classtype_mangled_name (TREE_TYPE (decl
));
3264 else if (DECL_LANG_SPECIFIC (decl
))
3265 DECL_TEMPLATE_INFO (decl
) = info
;
3267 return DECL_TEMPLATE_RESULT (tmpl
);
3271 push_template_decl (tree decl
)
3273 return push_template_decl_real (decl
, false);
3276 /* Called when a class template TYPE is redeclared with the indicated
3277 template PARMS, e.g.:
3279 template <class T> struct S;
3280 template <class T> struct S {}; */
3283 redeclare_class_template (tree type
, tree parms
)
3289 if (!TYPE_TEMPLATE_INFO (type
))
3291 error ("%qT is not a template type", type
);
3295 tmpl
= TYPE_TI_TEMPLATE (type
);
3296 if (!PRIMARY_TEMPLATE_P (tmpl
))
3297 /* The type is nested in some template class. Nothing to worry
3298 about here; there are no new template parameters for the nested
3304 error ("template specifiers not specified in declaration of %qD",
3309 parms
= INNERMOST_TEMPLATE_PARMS (parms
);
3310 tmpl_parms
= DECL_INNERMOST_TEMPLATE_PARMS (tmpl
);
3312 if (TREE_VEC_LENGTH (parms
) != TREE_VEC_LENGTH (tmpl_parms
))
3314 error ("previous declaration %q+D", tmpl
);
3315 error ("used %d template parameter(s) instead of %d",
3316 TREE_VEC_LENGTH (tmpl_parms
),
3317 TREE_VEC_LENGTH (parms
));
3321 for (i
= 0; i
< TREE_VEC_LENGTH (tmpl_parms
); ++i
)
3323 tree tmpl_parm
= TREE_VALUE (TREE_VEC_ELT (tmpl_parms
, i
));
3324 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
3325 tree tmpl_default
= TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
));
3326 tree parm_default
= TREE_PURPOSE (TREE_VEC_ELT (parms
, i
));
3328 /* TMPL_PARM and PARM can be either TYPE_DECL, PARM_DECL, or
3330 if (TREE_CODE (tmpl_parm
) != TREE_CODE (parm
)
3331 || (TREE_CODE (tmpl_parm
) != TYPE_DECL
3332 && !same_type_p (TREE_TYPE (tmpl_parm
), TREE_TYPE (parm
))))
3334 error ("template parameter %q+#D", tmpl_parm
);
3335 error ("redeclared here as %q#D", parm
);
3339 if (tmpl_default
!= NULL_TREE
&& parm_default
!= NULL_TREE
)
3341 /* We have in [temp.param]:
3343 A template-parameter may not be given default arguments
3344 by two different declarations in the same scope. */
3345 error ("redefinition of default argument for %q#D", parm
);
3346 error ("%J original definition appeared here", tmpl_parm
);
3350 if (parm_default
!= NULL_TREE
)
3351 /* Update the previous template parameters (which are the ones
3352 that will really count) with the new default value. */
3353 TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
)) = parm_default
;
3354 else if (tmpl_default
!= NULL_TREE
)
3355 /* Update the new parameters, too; they'll be used as the
3356 parameters for any members. */
3357 TREE_PURPOSE (TREE_VEC_ELT (parms
, i
)) = tmpl_default
;
3361 /* Simplify EXPR if it is a non-dependent expression. Returns the
3362 (possibly simplified) expression. */
3365 fold_non_dependent_expr (tree expr
)
3367 /* If we're in a template, but EXPR isn't value dependent, simplify
3368 it. We're supposed to treat:
3370 template <typename T> void f(T[1 + 1]);
3371 template <typename T> void f(T[2]);
3373 as two declarations of the same function, for example. */
3374 if (processing_template_decl
3375 && !type_dependent_expression_p (expr
)
3376 && !value_dependent_expression_p (expr
))
3378 HOST_WIDE_INT saved_processing_template_decl
;
3380 saved_processing_template_decl
= processing_template_decl
;
3381 processing_template_decl
= 0;
3382 expr
= tsubst_copy_and_build (expr
,
3385 /*in_decl=*/NULL_TREE
,
3386 /*function_p=*/false);
3387 processing_template_decl
= saved_processing_template_decl
;
3392 /* EXPR is an expression which is used in a constant-expression context.
3393 For instance, it could be a VAR_DECL with a constant initializer.
3394 Extract the innest constant expression.
3396 This is basically a more powerful version of
3397 integral_constant_value, which can be used also in templates where
3398 initializers can maintain a syntactic rather than semantic form
3399 (even if they are non-dependent, for access-checking purposes). */
3402 fold_decl_constant_value (tree expr
)
3404 tree const_expr
= expr
;
3407 expr
= fold_non_dependent_expr (const_expr
);
3408 const_expr
= integral_constant_value (expr
);
3410 while (expr
!= const_expr
);
3415 /* Subroutine of convert_nontype_argument. Converts EXPR to TYPE, which
3416 must be a function or a pointer-to-function type, as specified
3417 in [temp.arg.nontype]: disambiguate EXPR if it is an overload set,
3418 and check that the resulting function has external linkage. */
3421 convert_nontype_argument_function (tree type
, tree expr
)
3426 fn
= instantiate_type (type
, fns
, tf_none
);
3427 if (fn
== error_mark_node
)
3428 return error_mark_node
;
3431 if (TREE_CODE (fn_no_ptr
) == ADDR_EXPR
)
3432 fn_no_ptr
= TREE_OPERAND (fn_no_ptr
, 0);
3434 /* [temp.arg.nontype]/1
3436 A template-argument for a non-type, non-template template-parameter
3439 -- the address of an object or function with external linkage. */
3440 if (!DECL_EXTERNAL_LINKAGE_P (fn_no_ptr
))
3442 error ("%qE is not a valid template argument for type %qT "
3443 "because function %qD has not external linkage",
3444 expr
, type
, fn_no_ptr
);
3451 /* Attempt to convert the non-type template parameter EXPR to the
3452 indicated TYPE. If the conversion is successful, return the
3453 converted value. If the conversion is unsuccessful, return
3454 NULL_TREE if we issued an error message, or error_mark_node if we
3455 did not. We issue error messages for out-and-out bad template
3456 parameters, but not simply because the conversion failed, since we
3457 might be just trying to do argument deduction. Both TYPE and EXPR
3458 must be non-dependent.
3460 The conversion follows the special rules described in
3461 [temp.arg.nontype], and it is much more strict than an implicit
3464 This function is called twice for each template argument (see
3465 lookup_template_class for a more accurate description of this
3466 problem). This means that we need to handle expressions which
3467 are not valid in a C++ source, but can be created from the
3468 first call (for instance, casts to perform conversions). These
3469 hacks can go away after we fix the double coercion problem. */
3472 convert_nontype_argument (tree type
, tree expr
)
3476 /* Detect immediately string literals as invalid non-type argument.
3477 This special-case is not needed for correctness (we would easily
3478 catch this later), but only to provide better diagnostic for this
3479 common user mistake. As suggested by DR 100, we do not mention
3480 linkage issues in the diagnostic as this is not the point. */
3481 if (TREE_CODE (expr
) == STRING_CST
)
3483 error ("%qE is not a valid template argument for type %qT "
3484 "because string literals can never be used in this context",
3489 /* If we are in a template, EXPR may be non-dependent, but still
3490 have a syntactic, rather than semantic, form. For example, EXPR
3491 might be a SCOPE_REF, rather than the VAR_DECL to which the
3492 SCOPE_REF refers. Preserving the qualifying scope is necessary
3493 so that access checking can be performed when the template is
3494 instantiated -- but here we need the resolved form so that we can
3495 convert the argument. */
3496 expr
= fold_non_dependent_expr (expr
);
3497 if (error_operand_p (expr
))
3498 return error_mark_node
;
3499 expr_type
= TREE_TYPE (expr
);
3501 /* HACK: Due to double coercion, we can get a
3502 NOP_EXPR<REFERENCE_TYPE>(ADDR_EXPR<POINTER_TYPE> (arg)) here,
3503 which is the tree that we built on the first call (see
3504 below when coercing to reference to object or to reference to
3505 function). We just strip everything and get to the arg.
3506 See g++.old-deja/g++.oliva/template4.C and g++.dg/template/nontype9.C
3508 if (TREE_CODE (expr
) == NOP_EXPR
)
3510 if (TYPE_REF_OBJ_P (type
) || TYPE_REFFN_P (type
))
3512 /* ??? Maybe we could use convert_from_reference here, but we
3513 would need to relax its constraints because the NOP_EXPR
3514 could actually change the type to something more cv-qualified,
3515 and this is not folded by convert_from_reference. */
3516 tree addr
= TREE_OPERAND (expr
, 0);
3517 gcc_assert (TREE_CODE (expr_type
) == REFERENCE_TYPE
);
3518 gcc_assert (TREE_CODE (addr
) == ADDR_EXPR
);
3519 gcc_assert (TREE_CODE (TREE_TYPE (addr
)) == POINTER_TYPE
);
3520 gcc_assert (same_type_ignoring_top_level_qualifiers_p
3521 (TREE_TYPE (expr_type
),
3522 TREE_TYPE (TREE_TYPE (addr
))));
3524 expr
= TREE_OPERAND (addr
, 0);
3525 expr_type
= TREE_TYPE (expr
);
3528 /* We could also generate a NOP_EXPR(ADDR_EXPR()) when the
3529 parameter is a pointer to object, through decay and
3530 qualification conversion. Let's strip everything. */
3531 else if (TYPE_PTROBV_P (type
))
3534 gcc_assert (TREE_CODE (expr
) == ADDR_EXPR
);
3535 gcc_assert (TREE_CODE (TREE_TYPE (expr
)) == POINTER_TYPE
);
3536 /* Skip the ADDR_EXPR only if it is part of the decay for
3537 an array. Otherwise, it is part of the original argument
3538 in the source code. */
3539 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (expr
, 0))) == ARRAY_TYPE
)
3540 expr
= TREE_OPERAND (expr
, 0);
3541 expr_type
= TREE_TYPE (expr
);
3545 /* [temp.arg.nontype]/5, bullet 1
3547 For a non-type template-parameter of integral or enumeration type,
3548 integral promotions (_conv.prom_) and integral conversions
3549 (_conv.integral_) are applied. */
3550 if (INTEGRAL_TYPE_P (type
))
3552 if (!INTEGRAL_TYPE_P (expr_type
))
3553 return error_mark_node
;
3555 expr
= fold_decl_constant_value (expr
);
3556 /* Notice that there are constant expressions like '4 % 0' which
3557 do not fold into integer constants. */
3558 if (TREE_CODE (expr
) != INTEGER_CST
)
3560 error ("%qE is not a valid template argument for type %qT "
3561 "because it is a non-constant expression", expr
, type
);
3565 /* At this point, an implicit conversion does what we want,
3566 because we already know that the expression is of integral
3568 expr
= ocp_convert (type
, expr
, CONV_IMPLICIT
, LOOKUP_PROTECT
);
3569 if (expr
== error_mark_node
)
3570 return error_mark_node
;
3572 /* Conversion was allowed: fold it to a bare integer constant. */
3575 /* [temp.arg.nontype]/5, bullet 2
3577 For a non-type template-parameter of type pointer to object,
3578 qualification conversions (_conv.qual_) and the array-to-pointer
3579 conversion (_conv.array_) are applied. */
3580 else if (TYPE_PTROBV_P (type
))
3582 /* [temp.arg.nontype]/1 (TC1 version, DR 49):
3584 A template-argument for a non-type, non-template template-parameter
3585 shall be one of: [...]
3587 -- the name of a non-type template-parameter;
3588 -- the address of an object or function with external linkage, [...]
3589 expressed as "& id-expression" where the & is optional if the name
3590 refers to a function or array, or if the corresponding
3591 template-parameter is a reference.
3593 Here, we do not care about functions, as they are invalid anyway
3594 for a parameter of type pointer-to-object. */
3595 bool constant_address_p
=
3596 (TREE_CODE (expr
) == ADDR_EXPR
3597 || TREE_CODE (expr_type
) == ARRAY_TYPE
3598 || (DECL_P (expr
) && DECL_TEMPLATE_PARM_P (expr
)));
3600 expr
= decay_conversion (expr
);
3601 if (expr
== error_mark_node
)
3602 return error_mark_node
;
3604 expr
= perform_qualification_conversions (type
, expr
);
3605 if (expr
== error_mark_node
)
3606 return error_mark_node
;
3608 if (!constant_address_p
)
3610 error ("%qE is not a valid template argument for type %qT "
3611 "because it is not a constant pointer", expr
, type
);
3615 /* [temp.arg.nontype]/5, bullet 3
3617 For a non-type template-parameter of type reference to object, no
3618 conversions apply. The type referred to by the reference may be more
3619 cv-qualified than the (otherwise identical) type of the
3620 template-argument. The template-parameter is bound directly to the
3621 template-argument, which must be an lvalue. */
3622 else if (TYPE_REF_OBJ_P (type
))
3624 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type
),
3626 return error_mark_node
;
3628 if (!at_least_as_qualified_p (TREE_TYPE (type
), expr_type
))
3630 error ("%qE is not a valid template argument for type %qT "
3631 "because of conflicts in cv-qualification", expr
, type
);
3635 if (!real_lvalue_p (expr
))
3637 error ("%qE is not a valid template argument for type %qT "
3638 "because it is not an lvalue", expr
, type
);
3642 /* [temp.arg.nontype]/1
3644 A template-argument for a non-type, non-template template-parameter
3645 shall be one of: [...]
3647 -- the address of an object or function with external linkage. */
3648 if (!DECL_EXTERNAL_LINKAGE_P (expr
))
3650 error ("%qE is not a valid template argument for type %qT "
3651 "because object %qD has not external linkage",
3656 expr
= build_nop (type
, build_address (expr
));
3658 /* [temp.arg.nontype]/5, bullet 4
3660 For a non-type template-parameter of type pointer to function, only
3661 the function-to-pointer conversion (_conv.func_) is applied. If the
3662 template-argument represents a set of overloaded functions (or a
3663 pointer to such), the matching function is selected from the set
3665 else if (TYPE_PTRFN_P (type
))
3667 /* If the argument is a template-id, we might not have enough
3668 context information to decay the pointer. */
3669 if (!type_unknown_p (expr_type
))
3671 expr
= decay_conversion (expr
);
3672 if (expr
== error_mark_node
)
3673 return error_mark_node
;
3676 expr
= convert_nontype_argument_function (type
, expr
);
3677 if (!expr
|| expr
== error_mark_node
)
3680 /* [temp.arg.nontype]/5, bullet 5
3682 For a non-type template-parameter of type reference to function, no
3683 conversions apply. If the template-argument represents a set of
3684 overloaded functions, the matching function is selected from the set
3686 else if (TYPE_REFFN_P (type
))
3688 if (TREE_CODE (expr
) == ADDR_EXPR
)
3690 error ("%qE is not a valid template argument for type %qT "
3691 "because it is a pointer", expr
, type
);
3692 inform ("try using %qE instead", TREE_OPERAND (expr
, 0));
3696 expr
= convert_nontype_argument_function (TREE_TYPE (type
), expr
);
3697 if (!expr
|| expr
== error_mark_node
)
3700 expr
= build_nop (type
, build_address (expr
));
3702 /* [temp.arg.nontype]/5, bullet 6
3704 For a non-type template-parameter of type pointer to member function,
3705 no conversions apply. If the template-argument represents a set of
3706 overloaded member functions, the matching member function is selected
3707 from the set (_over.over_). */
3708 else if (TYPE_PTRMEMFUNC_P (type
))
3710 expr
= instantiate_type (type
, expr
, tf_none
);
3711 if (expr
== error_mark_node
)
3712 return error_mark_node
;
3714 /* There is no way to disable standard conversions in
3715 resolve_address_of_overloaded_function (called by
3716 instantiate_type). It is possible that the call succeeded by
3717 converting &B::I to &D::I (where B is a base of D), so we need
3718 to reject this conversion here.
3720 Actually, even if there was a way to disable standard conversions,
3721 it would still be better to reject them here so that we can
3722 provide a superior diagnostic. */
3723 if (!same_type_p (TREE_TYPE (expr
), type
))
3725 /* Make sure we are just one standard conversion off. */
3726 gcc_assert (can_convert (type
, TREE_TYPE (expr
)));
3727 error ("%qE is not a valid template argument for type %qT "
3728 "because it is of type %qT", expr
, type
,
3730 inform ("standard conversions are not allowed in this context");
3734 /* [temp.arg.nontype]/5, bullet 7
3736 For a non-type template-parameter of type pointer to data member,
3737 qualification conversions (_conv.qual_) are applied. */
3738 else if (TYPE_PTRMEM_P (type
))
3740 expr
= perform_qualification_conversions (type
, expr
);
3741 if (expr
== error_mark_node
)
3744 /* A template non-type parameter must be one of the above. */
3748 /* Sanity check: did we actually convert the argument to the
3750 gcc_assert (same_type_p (type
, TREE_TYPE (expr
)));
3755 /* Return 1 if PARM_PARMS and ARG_PARMS matches using rule for
3756 template template parameters. Both PARM_PARMS and ARG_PARMS are
3757 vectors of TREE_LIST nodes containing TYPE_DECL, TEMPLATE_DECL
3760 Consider the example:
3761 template <class T> class A;
3762 template<template <class U> class TT> class B;
3764 For B<A>, PARM_PARMS are the parameters to TT, while ARG_PARMS are
3765 the parameters to A, and OUTER_ARGS contains A. */
3768 coerce_template_template_parms (tree parm_parms
,
3770 tsubst_flags_t complain
,
3774 int nparms
, nargs
, i
;
3777 gcc_assert (TREE_CODE (parm_parms
) == TREE_VEC
);
3778 gcc_assert (TREE_CODE (arg_parms
) == TREE_VEC
);
3780 nparms
= TREE_VEC_LENGTH (parm_parms
);
3781 nargs
= TREE_VEC_LENGTH (arg_parms
);
3783 if (nargs
!= nparms
)
3786 for (i
= 0; i
< nparms
; ++i
)
3788 if (TREE_VEC_ELT (parm_parms
, i
) == error_mark_node
)
3791 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, i
));
3792 arg
= TREE_VALUE (TREE_VEC_ELT (arg_parms
, i
));
3794 if (arg
== NULL_TREE
|| arg
== error_mark_node
3795 || parm
== NULL_TREE
|| parm
== error_mark_node
)
3798 if (TREE_CODE (arg
) != TREE_CODE (parm
))
3801 switch (TREE_CODE (parm
))
3807 /* We encounter instantiations of templates like
3808 template <template <template <class> class> class TT>
3811 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
3812 tree argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
3814 if (!coerce_template_template_parms
3815 (parmparm
, argparm
, complain
, in_decl
, outer_args
))
3821 /* The tsubst call is used to handle cases such as
3823 template <int> class C {};
3824 template <class T, template <T> class TT> class D {};
3827 i.e. the parameter list of TT depends on earlier parameters. */
3828 if (!dependent_type_p (TREE_TYPE (arg
))
3830 (tsubst (TREE_TYPE (parm
), outer_args
, complain
, in_decl
),
3842 /* Convert the indicated template ARG as necessary to match the
3843 indicated template PARM. Returns the converted ARG, or
3844 error_mark_node if the conversion was unsuccessful. Error and
3845 warning messages are issued under control of COMPLAIN. This
3846 conversion is for the Ith parameter in the parameter list. ARGS is
3847 the full set of template arguments deduced so far. */
3850 convert_template_argument (tree parm
,
3853 tsubst_flags_t complain
,
3858 int is_type
, requires_type
, is_tmpl_type
, requires_tmpl_type
;
3860 if (TREE_CODE (arg
) == TREE_LIST
3861 && TREE_CODE (TREE_VALUE (arg
)) == OFFSET_REF
)
3863 /* The template argument was the name of some
3864 member function. That's usually
3865 invalid, but static members are OK. In any
3866 case, grab the underlying fields/functions
3867 and issue an error later if required. */
3868 arg
= TREE_VALUE (arg
);
3869 TREE_TYPE (arg
) = unknown_type_node
;
3872 requires_tmpl_type
= TREE_CODE (parm
) == TEMPLATE_DECL
;
3873 requires_type
= (TREE_CODE (parm
) == TYPE_DECL
3874 || requires_tmpl_type
);
3876 is_tmpl_type
= ((TREE_CODE (arg
) == TEMPLATE_DECL
3877 && TREE_CODE (DECL_TEMPLATE_RESULT (arg
)) == TYPE_DECL
)
3878 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
3879 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
);
3882 && (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
3883 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
))
3884 arg
= TYPE_STUB_DECL (arg
);
3886 is_type
= TYPE_P (arg
) || is_tmpl_type
;
3888 if (requires_type
&& ! is_type
&& TREE_CODE (arg
) == SCOPE_REF
3889 && TREE_CODE (TREE_OPERAND (arg
, 0)) == TEMPLATE_TYPE_PARM
)
3891 pedwarn ("to refer to a type member of a template parameter, "
3892 "use %<typename %E%>", arg
);
3894 arg
= make_typename_type (TREE_OPERAND (arg
, 0),
3895 TREE_OPERAND (arg
, 1),
3897 complain
& tf_error
);
3900 if (is_type
!= requires_type
)
3904 if (complain
& tf_error
)
3906 error ("type/value mismatch at argument %d in template "
3907 "parameter list for %qD",
3910 error (" expected a constant of type %qT, got %qT",
3912 (is_tmpl_type
? DECL_NAME (arg
) : arg
));
3913 else if (requires_tmpl_type
)
3914 error (" expected a class template, got %qE", arg
);
3916 error (" expected a type, got %qE", arg
);
3919 return error_mark_node
;
3921 if (is_tmpl_type
^ requires_tmpl_type
)
3923 if (in_decl
&& (complain
& tf_error
))
3925 error ("type/value mismatch at argument %d in template "
3926 "parameter list for %qD",
3929 error (" expected a type, got %qT", DECL_NAME (arg
));
3931 error (" expected a class template, got %qT", arg
);
3933 return error_mark_node
;
3938 if (requires_tmpl_type
)
3940 if (TREE_CODE (TREE_TYPE (arg
)) == UNBOUND_CLASS_TEMPLATE
)
3941 /* The number of argument required is not known yet.
3942 Just accept it for now. */
3943 val
= TREE_TYPE (arg
);
3946 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
3947 tree argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
3949 if (coerce_template_template_parms (parmparm
, argparm
,
3955 /* TEMPLATE_TEMPLATE_PARM node is preferred over
3957 if (val
!= error_mark_node
3958 && DECL_TEMPLATE_TEMPLATE_PARM_P (val
))
3959 val
= TREE_TYPE (val
);
3963 if (in_decl
&& (complain
& tf_error
))
3965 error ("type/value mismatch at argument %d in "
3966 "template parameter list for %qD",
3968 error (" expected a template of type %qD, got %qD",
3972 val
= error_mark_node
;
3978 /* We only form one instance of each template specialization.
3979 Therefore, if we use a non-canonical variant (i.e., a
3980 typedef), any future messages referring to the type will use
3981 the typedef, which is confusing if those future uses do not
3982 themselves also use the typedef. */
3984 val
= canonical_type_variant (val
);
3988 tree t
= tsubst (TREE_TYPE (parm
), args
, complain
, in_decl
);
3990 if (invalid_nontype_parm_type_p (t
, complain
))
3991 return error_mark_node
;
3993 if (!uses_template_parms (arg
) && !uses_template_parms (t
))
3994 /* We used to call digest_init here. However, digest_init
3995 will report errors, which we don't want when complain
3996 is zero. More importantly, digest_init will try too
3997 hard to convert things: for example, `0' should not be
3998 converted to pointer type at this point according to
3999 the standard. Accepting this is not merely an
4000 extension, since deciding whether or not these
4001 conversions can occur is part of determining which
4002 function template to call, or whether a given explicit
4003 argument specification is valid. */
4004 val
= convert_nontype_argument (t
, arg
);
4008 if (val
== NULL_TREE
)
4009 val
= error_mark_node
;
4010 else if (val
== error_mark_node
&& (complain
& tf_error
))
4011 error ("could not convert template argument %qE to %qT", arg
, t
);
4017 /* Convert all template arguments to their appropriate types, and
4018 return a vector containing the innermost resulting template
4019 arguments. If any error occurs, return error_mark_node. Error and
4020 warning messages are issued under control of COMPLAIN.
4022 If REQUIRE_ALL_ARGS is false, argument deduction will be performed
4023 for arguments not specified in ARGS. Otherwise, if
4024 USE_DEFAULT_ARGS is true, default arguments will be used to fill in
4025 unspecified arguments. If REQUIRE_ALL_ARGS is true, but
4026 USE_DEFAULT_ARGS is false, then all arguments must be specified in
4030 coerce_template_parms (tree parms
,
4033 tsubst_flags_t complain
,
4034 bool require_all_args
,
4035 bool use_default_args
)
4037 int nparms
, nargs
, i
, lost
= 0;
4040 tree new_inner_args
;
4042 inner_args
= INNERMOST_TEMPLATE_ARGS (args
);
4043 nargs
= inner_args
? NUM_TMPL_ARGS (inner_args
) : 0;
4044 nparms
= TREE_VEC_LENGTH (parms
);
4049 && (!use_default_args
4050 || (TREE_VEC_ELT (parms
, nargs
) != error_mark_node
4051 && !TREE_PURPOSE (TREE_VEC_ELT (parms
, nargs
))))))
4053 if (complain
& tf_error
)
4055 error ("wrong number of template arguments (%d, should be %d)",
4059 error ("provided for %q+D", in_decl
);
4062 return error_mark_node
;
4065 new_inner_args
= make_tree_vec (nparms
);
4066 new_args
= add_outermost_template_args (args
, new_inner_args
);
4067 for (i
= 0; i
< nparms
; i
++)
4072 /* Get the Ith template parameter. */
4073 parm
= TREE_VEC_ELT (parms
, i
);
4075 if (parm
== error_mark_node
)
4078 /* Calculate the Ith argument. */
4080 arg
= TREE_VEC_ELT (inner_args
, i
);
4081 else if (require_all_args
)
4082 /* There must be a default arg in this case. */
4083 arg
= tsubst_template_arg (TREE_PURPOSE (parm
), new_args
,
4089 if (arg
== error_mark_node
)
4091 if (complain
& tf_error
)
4092 error ("template argument %d is invalid", i
+ 1);
4095 arg
= convert_template_argument (TREE_VALUE (parm
),
4096 arg
, new_args
, complain
, i
,
4099 if (arg
== error_mark_node
)
4101 TREE_VEC_ELT (new_inner_args
, i
) = arg
;
4105 return error_mark_node
;
4107 return new_inner_args
;
4110 /* Returns 1 if template args OT and NT are equivalent. */
4113 template_args_equal (tree ot
, tree nt
)
4118 if (TREE_CODE (nt
) == TREE_VEC
)
4119 /* For member templates */
4120 return TREE_CODE (ot
) == TREE_VEC
&& comp_template_args (ot
, nt
);
4121 else if (TYPE_P (nt
))
4122 return TYPE_P (ot
) && same_type_p (ot
, nt
);
4123 else if (TREE_CODE (ot
) == TREE_VEC
|| TYPE_P (ot
))
4126 return cp_tree_equal (ot
, nt
);
4129 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets
4130 of template arguments. Returns 0 otherwise. */
4133 comp_template_args (tree oldargs
, tree newargs
)
4137 if (TREE_VEC_LENGTH (oldargs
) != TREE_VEC_LENGTH (newargs
))
4140 for (i
= 0; i
< TREE_VEC_LENGTH (oldargs
); ++i
)
4142 tree nt
= TREE_VEC_ELT (newargs
, i
);
4143 tree ot
= TREE_VEC_ELT (oldargs
, i
);
4145 if (! template_args_equal (ot
, nt
))
4151 /* Given class template name and parameter list, produce a user-friendly name
4152 for the instantiation. */
4155 mangle_class_name_for_template (const char* name
, tree parms
, tree arglist
)
4157 static struct obstack scratch_obstack
;
4158 static char *scratch_firstobj
;
4161 if (!scratch_firstobj
)
4162 gcc_obstack_init (&scratch_obstack
);
4164 obstack_free (&scratch_obstack
, scratch_firstobj
);
4165 scratch_firstobj
= (char *) obstack_alloc (&scratch_obstack
, 1);
4167 #define ccat(C) obstack_1grow (&scratch_obstack, (C));
4168 #define cat(S) obstack_grow (&scratch_obstack, (S), strlen (S))
4172 nparms
= TREE_VEC_LENGTH (parms
);
4173 arglist
= INNERMOST_TEMPLATE_ARGS (arglist
);
4174 gcc_assert (nparms
== TREE_VEC_LENGTH (arglist
));
4175 for (i
= 0; i
< nparms
; i
++)
4180 if (TREE_VEC_ELT (parms
, i
) == error_mark_node
)
4183 parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
4184 arg
= TREE_VEC_ELT (arglist
, i
);
4189 if (TREE_CODE (parm
) == TYPE_DECL
)
4191 cat (type_as_string (arg
, TFF_CHASE_TYPEDEF
));
4194 else if (TREE_CODE (parm
) == TEMPLATE_DECL
)
4196 if (TREE_CODE (arg
) == TEMPLATE_DECL
)
4198 /* Already substituted with real template. Just output
4199 the template name here */
4200 tree context
= DECL_CONTEXT (arg
);
4203 /* The template may be defined in a namespace, or
4204 may be a member template. */
4205 gcc_assert (TREE_CODE (context
) == NAMESPACE_DECL
4206 || CLASS_TYPE_P (context
));
4207 cat (decl_as_string (DECL_CONTEXT (arg
),
4208 TFF_PLAIN_IDENTIFIER
));
4211 cat (IDENTIFIER_POINTER (DECL_NAME (arg
)));
4214 /* Output the parameter declaration. */
4215 cat (type_as_string (arg
, TFF_CHASE_TYPEDEF
));
4219 gcc_assert (TREE_CODE (parm
) == PARM_DECL
);
4221 /* No need to check arglist against parmlist here; we did that
4222 in coerce_template_parms, called from lookup_template_class. */
4223 cat (expr_as_string (arg
, TFF_PLAIN_IDENTIFIER
));
4226 char *bufp
= obstack_next_free (&scratch_obstack
);
4228 while (bufp
[offset
- 1] == ' ')
4230 obstack_blank_fast (&scratch_obstack
, offset
);
4232 /* B<C<char> >, not B<C<char>> */
4233 if (bufp
[offset
- 1] == '>')
4238 return (char *) obstack_base (&scratch_obstack
);
4242 classtype_mangled_name (tree t
)
4244 if (CLASSTYPE_TEMPLATE_INFO (t
)
4245 /* Specializations have already had their names set up in
4246 lookup_template_class. */
4247 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
4249 tree tmpl
= most_general_template (CLASSTYPE_TI_TEMPLATE (t
));
4251 /* For non-primary templates, the template parameters are
4252 implicit from their surrounding context. */
4253 if (PRIMARY_TEMPLATE_P (tmpl
))
4255 tree name
= DECL_NAME (tmpl
);
4256 char *mangled_name
= mangle_class_name_for_template
4257 (IDENTIFIER_POINTER (name
),
4258 DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
4259 CLASSTYPE_TI_ARGS (t
));
4260 tree id
= get_identifier (mangled_name
);
4261 IDENTIFIER_TEMPLATE (id
) = name
;
4266 return TYPE_IDENTIFIER (t
);
4270 add_pending_template (tree d
)
4272 tree ti
= (TYPE_P (d
)
4273 ? CLASSTYPE_TEMPLATE_INFO (d
)
4274 : DECL_TEMPLATE_INFO (d
));
4278 if (TI_PENDING_TEMPLATE_FLAG (ti
))
4281 /* We are called both from instantiate_decl, where we've already had a
4282 tinst_level pushed, and instantiate_template, where we haven't.
4284 level
= !(current_tinst_level
&& TINST_DECL (current_tinst_level
) == d
);
4287 push_tinst_level (d
);
4289 pt
= tree_cons (current_tinst_level
, d
, NULL_TREE
);
4290 if (last_pending_template
)
4291 TREE_CHAIN (last_pending_template
) = pt
;
4293 pending_templates
= pt
;
4295 last_pending_template
= pt
;
4297 TI_PENDING_TEMPLATE_FLAG (ti
) = 1;
4304 /* Return a TEMPLATE_ID_EXPR corresponding to the indicated FNS and
4305 ARGLIST. Valid choices for FNS are given in the cp-tree.def
4306 documentation for TEMPLATE_ID_EXPR. */
4309 lookup_template_function (tree fns
, tree arglist
)
4313 if (fns
== error_mark_node
|| arglist
== error_mark_node
)
4314 return error_mark_node
;
4316 gcc_assert (!arglist
|| TREE_CODE (arglist
) == TREE_VEC
);
4317 gcc_assert (fns
&& (is_overloaded_fn (fns
)
4318 || TREE_CODE (fns
) == IDENTIFIER_NODE
));
4320 if (BASELINK_P (fns
))
4322 BASELINK_FUNCTIONS (fns
) = build2 (TEMPLATE_ID_EXPR
,
4324 BASELINK_FUNCTIONS (fns
),
4329 type
= TREE_TYPE (fns
);
4330 if (TREE_CODE (fns
) == OVERLOAD
|| !type
)
4331 type
= unknown_type_node
;
4333 return build2 (TEMPLATE_ID_EXPR
, type
, fns
, arglist
);
4336 /* Within the scope of a template class S<T>, the name S gets bound
4337 (in build_self_reference) to a TYPE_DECL for the class, not a
4338 TEMPLATE_DECL. If DECL is a TYPE_DECL for current_class_type,
4339 or one of its enclosing classes, and that type is a template,
4340 return the associated TEMPLATE_DECL. Otherwise, the original
4341 DECL is returned. */
4344 maybe_get_template_decl_from_type_decl (tree decl
)
4346 return (decl
!= NULL_TREE
4347 && TREE_CODE (decl
) == TYPE_DECL
4348 && DECL_ARTIFICIAL (decl
)
4349 && CLASS_TYPE_P (TREE_TYPE (decl
))
4350 && CLASSTYPE_TEMPLATE_INFO (TREE_TYPE (decl
)))
4351 ? CLASSTYPE_TI_TEMPLATE (TREE_TYPE (decl
)) : decl
;
4354 /* Given an IDENTIFIER_NODE (type TEMPLATE_DECL) and a chain of
4355 parameters, find the desired type.
4357 D1 is the PTYPENAME terminal, and ARGLIST is the list of arguments.
4359 IN_DECL, if non-NULL, is the template declaration we are trying to
4362 If ENTERING_SCOPE is nonzero, we are about to enter the scope of
4363 the class we are looking up.
4365 Issue error and warning messages under control of COMPLAIN.
4367 If the template class is really a local class in a template
4368 function, then the FUNCTION_CONTEXT is the function in which it is
4371 ??? Note that this function is currently called *twice* for each
4372 template-id: the first time from the parser, while creating the
4373 incomplete type (finish_template_type), and the second type during the
4374 real instantiation (instantiate_template_class). This is surely something
4375 that we want to avoid. It also causes some problems with argument
4376 coercion (see convert_nontype_argument for more information on this). */
4379 lookup_template_class (tree d1
,
4384 tsubst_flags_t complain
)
4386 tree
template = NULL_TREE
, parmlist
;
4389 timevar_push (TV_NAME_LOOKUP
);
4391 if (TREE_CODE (d1
) == IDENTIFIER_NODE
)
4393 tree value
= innermost_non_namespace_value (d1
);
4394 if (value
&& DECL_TEMPLATE_TEMPLATE_PARM_P (value
))
4399 push_decl_namespace (context
);
4400 template = lookup_name (d1
);
4401 template = maybe_get_template_decl_from_type_decl (template);
4403 pop_decl_namespace ();
4406 context
= DECL_CONTEXT (template);
4408 else if (TREE_CODE (d1
) == TYPE_DECL
&& IS_AGGR_TYPE (TREE_TYPE (d1
)))
4410 tree type
= TREE_TYPE (d1
);
4412 /* If we are declaring a constructor, say A<T>::A<T>, we will get
4413 an implicit typename for the second A. Deal with it. */
4414 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
4415 type
= TREE_TYPE (type
);
4417 if (CLASSTYPE_TEMPLATE_INFO (type
))
4419 template = CLASSTYPE_TI_TEMPLATE (type
);
4420 d1
= DECL_NAME (template);
4423 else if (TREE_CODE (d1
) == ENUMERAL_TYPE
4424 || (TYPE_P (d1
) && IS_AGGR_TYPE (d1
)))
4426 template = TYPE_TI_TEMPLATE (d1
);
4427 d1
= DECL_NAME (template);
4429 else if (TREE_CODE (d1
) == TEMPLATE_DECL
4430 && TREE_CODE (DECL_TEMPLATE_RESULT (d1
)) == TYPE_DECL
)
4433 d1
= DECL_NAME (template);
4434 context
= DECL_CONTEXT (template);
4437 /* Issue an error message if we didn't find a template. */
4440 if (complain
& tf_error
)
4441 error ("%qT is not a template", d1
);
4442 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP
, error_mark_node
);
4445 if (TREE_CODE (template) != TEMPLATE_DECL
4446 /* Make sure it's a user visible template, if it was named by
4448 || ((complain
& tf_user
) && !DECL_TEMPLATE_PARM_P (template)
4449 && !PRIMARY_TEMPLATE_P (template)))
4451 if (complain
& tf_error
)
4453 error ("non-template type %qT used as a template", d1
);
4455 error ("for template declaration %q+D", in_decl
);
4457 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP
, error_mark_node
);
4460 complain
&= ~tf_user
;
4462 if (DECL_TEMPLATE_TEMPLATE_PARM_P (template))
4464 /* Create a new TEMPLATE_DECL and TEMPLATE_TEMPLATE_PARM node to store
4465 template arguments */
4470 parmlist
= DECL_INNERMOST_TEMPLATE_PARMS (template);
4472 /* Consider an example where a template template parameter declared as
4474 template <class T, class U = std::allocator<T> > class TT
4476 The template parameter level of T and U are one level larger than
4477 of TT. To proper process the default argument of U, say when an
4478 instantiation `TT<int>' is seen, we need to build the full
4479 arguments containing {int} as the innermost level. Outer levels,
4480 available when not appearing as default template argument, can be
4481 obtained from `current_template_args ()'.
4483 Suppose that TT is later substituted with std::vector. The above
4484 instantiation is `TT<int, std::allocator<T> >' with TT at
4485 level 1, and T at level 2, while the template arguments at level 1
4486 becomes {std::vector} and the inner level 2 is {int}. */
4488 if (current_template_parms
)
4489 arglist
= add_to_template_args (current_template_args (), arglist
);
4491 arglist2
= coerce_template_parms (parmlist
, arglist
, template,
4493 /*require_all_args=*/true,
4494 /*use_default_args=*/true);
4495 if (arglist2
== error_mark_node
4496 || (!uses_template_parms (arglist2
)
4497 && check_instantiated_args (template, arglist2
, complain
)))
4498 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP
, error_mark_node
);
4500 parm
= bind_template_template_parm (TREE_TYPE (template), arglist2
);
4501 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP
, parm
);
4505 tree template_type
= TREE_TYPE (template);
4508 tree found
= NULL_TREE
;
4511 int is_partial_instantiation
;
4513 gen_tmpl
= most_general_template (template);
4514 parmlist
= DECL_TEMPLATE_PARMS (gen_tmpl
);
4515 parm_depth
= TMPL_PARMS_DEPTH (parmlist
);
4516 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
4518 if (arg_depth
== 1 && parm_depth
> 1)
4520 /* We've been given an incomplete set of template arguments.
4523 template <class T> struct S1 {
4524 template <class U> struct S2 {};
4525 template <class U> struct S2<U*> {};
4528 we will be called with an ARGLIST of `U*', but the
4529 TEMPLATE will be `template <class T> template
4530 <class U> struct S1<T>::S2'. We must fill in the missing
4533 = add_outermost_template_args (TYPE_TI_ARGS (TREE_TYPE (template)),
4535 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
4538 /* Now we should have enough arguments. */
4539 gcc_assert (parm_depth
== arg_depth
);
4541 /* From here on, we're only interested in the most general
4543 template = gen_tmpl
;
4545 /* Calculate the BOUND_ARGS. These will be the args that are
4546 actually tsubst'd into the definition to create the
4550 /* We have multiple levels of arguments to coerce, at once. */
4552 int saved_depth
= TMPL_ARGS_DEPTH (arglist
);
4554 tree bound_args
= make_tree_vec (parm_depth
);
4556 for (i
= saved_depth
,
4557 t
= DECL_TEMPLATE_PARMS (template);
4558 i
> 0 && t
!= NULL_TREE
;
4559 --i
, t
= TREE_CHAIN (t
))
4561 tree a
= coerce_template_parms (TREE_VALUE (t
),
4564 /*require_all_args=*/true,
4565 /*use_default_args=*/true);
4567 /* Don't process further if one of the levels fails. */
4568 if (a
== error_mark_node
)
4570 /* Restore the ARGLIST to its full size. */
4571 TREE_VEC_LENGTH (arglist
) = saved_depth
;
4572 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP
, error_mark_node
);
4575 SET_TMPL_ARGS_LEVEL (bound_args
, i
, a
);
4577 /* We temporarily reduce the length of the ARGLIST so
4578 that coerce_template_parms will see only the arguments
4579 corresponding to the template parameters it is
4581 TREE_VEC_LENGTH (arglist
)--;
4584 /* Restore the ARGLIST to its full size. */
4585 TREE_VEC_LENGTH (arglist
) = saved_depth
;
4587 arglist
= bound_args
;
4591 = coerce_template_parms (INNERMOST_TEMPLATE_PARMS (parmlist
),
4592 INNERMOST_TEMPLATE_ARGS (arglist
),
4595 /*require_all_args=*/true,
4596 /*use_default_args=*/true);
4598 if (arglist
== error_mark_node
)
4599 /* We were unable to bind the arguments. */
4600 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP
, error_mark_node
);
4602 /* In the scope of a template class, explicit references to the
4603 template class refer to the type of the template, not any
4604 instantiation of it. For example, in:
4606 template <class T> class C { void f(C<T>); }
4608 the `C<T>' is just the same as `C'. Outside of the
4609 class, however, such a reference is an instantiation. */
4610 if (comp_template_args (TYPE_TI_ARGS (template_type
),
4613 found
= template_type
;
4615 if (!entering_scope
&& PRIMARY_TEMPLATE_P (template))
4619 for (ctx
= current_class_type
;
4620 ctx
&& TREE_CODE (ctx
) != NAMESPACE_DECL
;
4622 ? TYPE_CONTEXT (ctx
)
4623 : DECL_CONTEXT (ctx
)))
4624 if (TYPE_P (ctx
) && same_type_p (ctx
, template_type
))
4627 /* We're not in the scope of the class, so the
4628 TEMPLATE_TYPE is not the type we want after all. */
4634 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP
, found
);
4636 /* If we already have this specialization, return it. */
4637 found
= retrieve_specialization (template, arglist
,
4638 /*class_specializations_p=*/false);
4640 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP
, found
);
4642 /* This type is a "partial instantiation" if any of the template
4643 arguments still involve template parameters. Note that we set
4644 IS_PARTIAL_INSTANTIATION for partial specializations as
4646 is_partial_instantiation
= uses_template_parms (arglist
);
4648 /* If the deduced arguments are invalid, then the binding
4650 if (!is_partial_instantiation
4651 && check_instantiated_args (template,
4652 INNERMOST_TEMPLATE_ARGS (arglist
),
4654 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP
, error_mark_node
);
4656 if (!is_partial_instantiation
4657 && !PRIMARY_TEMPLATE_P (template)
4658 && TREE_CODE (CP_DECL_CONTEXT (template)) == NAMESPACE_DECL
)
4660 found
= xref_tag_from_type (TREE_TYPE (template),
4661 DECL_NAME (template),
4662 /*tag_scope=*/ts_global
);
4663 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP
, found
);
4666 context
= tsubst (DECL_CONTEXT (template), arglist
,
4669 context
= global_namespace
;
4671 /* Create the type. */
4672 if (TREE_CODE (template_type
) == ENUMERAL_TYPE
)
4674 if (!is_partial_instantiation
)
4676 set_current_access_from_decl (TYPE_NAME (template_type
));
4677 t
= start_enum (TYPE_IDENTIFIER (template_type
));
4680 /* We don't want to call start_enum for this type, since
4681 the values for the enumeration constants may involve
4682 template parameters. And, no one should be interested
4683 in the enumeration constants for such a type. */
4684 t
= make_node (ENUMERAL_TYPE
);
4688 t
= make_aggr_type (TREE_CODE (template_type
));
4689 CLASSTYPE_DECLARED_CLASS (t
)
4690 = CLASSTYPE_DECLARED_CLASS (template_type
);
4691 SET_CLASSTYPE_IMPLICIT_INSTANTIATION (t
);
4692 TYPE_FOR_JAVA (t
) = TYPE_FOR_JAVA (template_type
);
4694 /* A local class. Make sure the decl gets registered properly. */
4695 if (context
== current_function_decl
)
4696 pushtag (DECL_NAME (template), t
, /*tag_scope=*/ts_current
);
4699 /* If we called start_enum or pushtag above, this information
4700 will already be set up. */
4703 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
4705 type_decl
= create_implicit_typedef (DECL_NAME (template), t
);
4706 DECL_CONTEXT (type_decl
) = TYPE_CONTEXT (t
);
4707 TYPE_STUB_DECL (t
) = type_decl
;
4708 DECL_SOURCE_LOCATION (type_decl
)
4709 = DECL_SOURCE_LOCATION (TYPE_STUB_DECL (template_type
));
4712 type_decl
= TYPE_NAME (t
);
4714 TREE_PRIVATE (type_decl
)
4715 = TREE_PRIVATE (TYPE_STUB_DECL (template_type
));
4716 TREE_PROTECTED (type_decl
)
4717 = TREE_PROTECTED (TYPE_STUB_DECL (template_type
));
4718 DECL_IN_SYSTEM_HEADER (type_decl
)
4719 = DECL_IN_SYSTEM_HEADER (template);
4720 if (CLASSTYPE_VISIBILITY_SPECIFIED (template_type
))
4722 DECL_VISIBILITY_SPECIFIED (type_decl
) = 1;
4723 DECL_VISIBILITY (type_decl
) = CLASSTYPE_VISIBILITY (template_type
);
4726 /* Set up the template information. We have to figure out which
4727 template is the immediate parent if this is a full
4729 if (parm_depth
== 1 || is_partial_instantiation
4730 || !PRIMARY_TEMPLATE_P (template))
4731 /* This case is easy; there are no member templates involved. */
4735 /* This is a full instantiation of a member template. Look
4736 for a partial instantiation of which this is an instance. */
4738 for (found
= DECL_TEMPLATE_INSTANTIATIONS (template);
4739 found
; found
= TREE_CHAIN (found
))
4742 tree tmpl
= CLASSTYPE_TI_TEMPLATE (TREE_VALUE (found
));
4744 /* We only want partial instantiations, here, not
4745 specializations or full instantiations. */
4746 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_VALUE (found
))
4747 || !uses_template_parms (TREE_VALUE (found
)))
4750 /* Temporarily reduce by one the number of levels in the
4751 ARGLIST and in FOUND so as to avoid comparing the
4752 last set of arguments. */
4753 TREE_VEC_LENGTH (arglist
)--;
4754 TREE_VEC_LENGTH (TREE_PURPOSE (found
)) --;
4756 /* See if the arguments match. If they do, then TMPL is
4757 the partial instantiation we want. */
4758 success
= comp_template_args (TREE_PURPOSE (found
), arglist
);
4760 /* Restore the argument vectors to their full size. */
4761 TREE_VEC_LENGTH (arglist
)++;
4762 TREE_VEC_LENGTH (TREE_PURPOSE (found
))++;
4773 /* There was no partial instantiation. This happens
4774 where C<T> is a member template of A<T> and it's used
4777 template <typename T> struct B { A<T>::C<int> m; };
4780 Create the partial instantiation.
4782 TREE_VEC_LENGTH (arglist
)--;
4783 found
= tsubst (template, arglist
, complain
, NULL_TREE
);
4784 TREE_VEC_LENGTH (arglist
)++;
4788 SET_TYPE_TEMPLATE_INFO (t
, tree_cons (found
, arglist
, NULL_TREE
));
4789 DECL_TEMPLATE_INSTANTIATIONS (template)
4790 = tree_cons (arglist
, t
,
4791 DECL_TEMPLATE_INSTANTIATIONS (template));
4793 if (TREE_CODE (t
) == ENUMERAL_TYPE
4794 && !is_partial_instantiation
)
4795 /* Now that the type has been registered on the instantiations
4796 list, we set up the enumerators. Because the enumeration
4797 constants may involve the enumeration type itself, we make
4798 sure to register the type first, and then create the
4799 constants. That way, doing tsubst_expr for the enumeration
4800 constants won't result in recursive calls here; we'll find
4801 the instantiation and exit above. */
4802 tsubst_enum (template_type
, t
, arglist
);
4804 /* Reset the name of the type, now that CLASSTYPE_TEMPLATE_INFO
4806 if (TREE_CODE (t
) != ENUMERAL_TYPE
)
4807 DECL_NAME (type_decl
) = classtype_mangled_name (t
);
4808 if (is_partial_instantiation
)
4809 /* If the type makes use of template parameters, the
4810 code that generates debugging information will crash. */
4811 DECL_IGNORED_P (TYPE_STUB_DECL (t
)) = 1;
4813 /* Possibly limit visibility based on template args. */
4814 TREE_PUBLIC (type_decl
) = 1;
4815 determine_visibility (type_decl
);
4817 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP
, t
);
4819 timevar_pop (TV_NAME_LOOKUP
);
4826 struct pointer_set_t
*visited
;
4829 /* Called from for_each_template_parm via walk_tree. */
4832 for_each_template_parm_r (tree
*tp
, int *walk_subtrees
, void *d
)
4835 struct pair_fn_data
*pfd
= (struct pair_fn_data
*) d
;
4836 tree_fn_t fn
= pfd
->fn
;
4837 void *data
= pfd
->data
;
4840 && for_each_template_parm (TYPE_CONTEXT (t
), fn
, data
, pfd
->visited
))
4841 return error_mark_node
;
4843 switch (TREE_CODE (t
))
4846 if (TYPE_PTRMEMFUNC_P (t
))
4852 if (!TYPE_TEMPLATE_INFO (t
))
4854 else if (for_each_template_parm (TREE_VALUE (TYPE_TEMPLATE_INFO (t
)),
4855 fn
, data
, pfd
->visited
))
4856 return error_mark_node
;
4860 /* Since we're not going to walk subtrees, we have to do this
4862 if (for_each_template_parm (TYPE_METHOD_BASETYPE (t
), fn
, data
,
4864 return error_mark_node
;
4868 /* Check the return type. */
4869 if (for_each_template_parm (TREE_TYPE (t
), fn
, data
, pfd
->visited
))
4870 return error_mark_node
;
4872 /* Check the parameter types. Since default arguments are not
4873 instantiated until they are needed, the TYPE_ARG_TYPES may
4874 contain expressions that involve template parameters. But,
4875 no-one should be looking at them yet. And, once they're
4876 instantiated, they don't contain template parameters, so
4877 there's no point in looking at them then, either. */
4881 for (parm
= TYPE_ARG_TYPES (t
); parm
; parm
= TREE_CHAIN (parm
))
4882 if (for_each_template_parm (TREE_VALUE (parm
), fn
, data
,
4884 return error_mark_node
;
4886 /* Since we've already handled the TYPE_ARG_TYPES, we don't
4887 want walk_tree walking into them itself. */
4893 if (for_each_template_parm (TYPE_FIELDS (t
), fn
, data
,
4895 return error_mark_node
;
4900 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
)
4901 && for_each_template_parm (DECL_TI_ARGS (t
), fn
, data
,
4903 return error_mark_node
;
4908 if (TREE_CODE (t
) == CONST_DECL
&& DECL_TEMPLATE_PARM_P (t
)
4909 && for_each_template_parm (DECL_INITIAL (t
), fn
, data
,
4911 return error_mark_node
;
4912 if (DECL_CONTEXT (t
)
4913 && for_each_template_parm (DECL_CONTEXT (t
), fn
, data
,
4915 return error_mark_node
;
4918 case BOUND_TEMPLATE_TEMPLATE_PARM
:
4919 /* Record template parameters such as `T' inside `TT<T>'. */
4920 if (for_each_template_parm (TYPE_TI_ARGS (t
), fn
, data
, pfd
->visited
))
4921 return error_mark_node
;
4924 case TEMPLATE_TEMPLATE_PARM
:
4925 case TEMPLATE_TYPE_PARM
:
4926 case TEMPLATE_PARM_INDEX
:
4927 if (fn
&& (*fn
)(t
, data
))
4928 return error_mark_node
;
4930 return error_mark_node
;
4934 /* A template template parameter is encountered. */
4935 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
)
4936 && for_each_template_parm (TREE_TYPE (t
), fn
, data
, pfd
->visited
))
4937 return error_mark_node
;
4939 /* Already substituted template template parameter */
4945 || for_each_template_parm (TYPENAME_TYPE_FULLNAME (t
), fn
,
4946 data
, pfd
->visited
))
4947 return error_mark_node
;
4951 if (TREE_TYPE (t
) && TYPE_PTRMEMFUNC_P (TREE_TYPE (t
))
4952 && for_each_template_parm (TYPE_PTRMEMFUNC_FN_TYPE
4953 (TREE_TYPE (t
)), fn
, data
,
4955 return error_mark_node
;
4960 /* If there's no type, then this thing must be some expression
4961 involving template parameters. */
4962 if (!fn
&& !TREE_TYPE (t
))
4963 return error_mark_node
;
4968 case REINTERPRET_CAST_EXPR
:
4969 case CONST_CAST_EXPR
:
4970 case STATIC_CAST_EXPR
:
4971 case DYNAMIC_CAST_EXPR
:
4975 case PSEUDO_DTOR_EXPR
:
4977 return error_mark_node
;
4981 /* If we do not handle this case specially, we end up walking
4982 the BINFO hierarchy, which is circular, and therefore
4983 confuses walk_tree. */
4985 if (for_each_template_parm (BASELINK_FUNCTIONS (*tp
), fn
, data
,
4987 return error_mark_node
;
4994 /* We didn't find any template parameters we liked. */
4998 /* For each TEMPLATE_TYPE_PARM, TEMPLATE_TEMPLATE_PARM,
4999 BOUND_TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX in T,
5000 call FN with the parameter and the DATA.
5001 If FN returns nonzero, the iteration is terminated, and
5002 for_each_template_parm returns 1. Otherwise, the iteration
5003 continues. If FN never returns a nonzero value, the value
5004 returned by for_each_template_parm is 0. If FN is NULL, it is
5005 considered to be the function which always returns 1. */
5008 for_each_template_parm (tree t
, tree_fn_t fn
, void* data
,
5009 struct pointer_set_t
*visited
)
5011 struct pair_fn_data pfd
;
5018 /* Walk the tree. (Conceptually, we would like to walk without
5019 duplicates, but for_each_template_parm_r recursively calls
5020 for_each_template_parm, so we would need to reorganize a fair
5021 bit to use walk_tree_without_duplicates, so we keep our own
5024 pfd
.visited
= visited
;
5026 pfd
.visited
= pointer_set_create ();
5027 result
= walk_tree (&t
,
5028 for_each_template_parm_r
,
5030 pfd
.visited
) != NULL_TREE
;
5035 pointer_set_destroy (pfd
.visited
);
5042 /* Returns true if T depends on any template parameter. */
5045 uses_template_parms (tree t
)
5048 int saved_processing_template_decl
;
5050 saved_processing_template_decl
= processing_template_decl
;
5051 if (!saved_processing_template_decl
)
5052 processing_template_decl
= 1;
5054 dependent_p
= dependent_type_p (t
);
5055 else if (TREE_CODE (t
) == TREE_VEC
)
5056 dependent_p
= any_dependent_template_arguments_p (t
);
5057 else if (TREE_CODE (t
) == TREE_LIST
)
5058 dependent_p
= (uses_template_parms (TREE_VALUE (t
))
5059 || uses_template_parms (TREE_CHAIN (t
)));
5060 else if (TREE_CODE (t
) == TYPE_DECL
)
5061 dependent_p
= dependent_type_p (TREE_TYPE (t
));
5064 || TREE_CODE (t
) == TEMPLATE_PARM_INDEX
5065 || TREE_CODE (t
) == OVERLOAD
5066 || TREE_CODE (t
) == BASELINK
5067 || TREE_CODE (t
) == IDENTIFIER_NODE
5068 || CONSTANT_CLASS_P (t
))
5069 dependent_p
= (type_dependent_expression_p (t
)
5070 || value_dependent_expression_p (t
));
5073 gcc_assert (t
== error_mark_node
);
5074 dependent_p
= false;
5077 processing_template_decl
= saved_processing_template_decl
;
5082 /* Returns true if T depends on any template parameter with level LEVEL. */
5085 uses_template_parms_level (tree t
, int level
)
5087 return for_each_template_parm (t
, template_parm_this_level_p
, &level
, NULL
);
5090 static int tinst_depth
;
5091 extern int max_tinst_depth
;
5092 #ifdef GATHER_STATISTICS
5095 static int tinst_level_tick
;
5096 static int last_template_error_tick
;
5098 /* We're starting to instantiate D; record the template instantiation context
5099 for diagnostics and to restore it later. */
5102 push_tinst_level (tree d
)
5106 if (tinst_depth
>= max_tinst_depth
)
5108 /* If the instantiation in question still has unbound template parms,
5109 we don't really care if we can't instantiate it, so just return.
5110 This happens with base instantiation for implicit `typename'. */
5111 if (uses_template_parms (d
))
5114 last_template_error_tick
= tinst_level_tick
;
5115 error ("template instantiation depth exceeds maximum of %d (use "
5116 "-ftemplate-depth-NN to increase the maximum) instantiating %qD",
5117 max_tinst_depth
, d
);
5119 print_instantiation_context ();
5124 new = make_node (TINST_LEVEL
);
5125 TINST_DECL (new) = d
;
5126 TINST_LOCATION (new) = input_location
;
5127 TINST_IN_SYSTEM_HEADER_P (new) = in_system_header
;
5128 TREE_CHAIN (new) = current_tinst_level
;
5129 current_tinst_level
= new;
5132 #ifdef GATHER_STATISTICS
5133 if (tinst_depth
> depth_reached
)
5134 depth_reached
= tinst_depth
;
5141 /* We're done instantiating this template; return to the instantiation
5145 pop_tinst_level (void)
5147 tree old
= current_tinst_level
;
5149 /* Restore the filename and line number stashed away when we started
5150 this instantiation. */
5151 input_location
= TINST_LOCATION (old
);
5152 in_system_header
= TINST_IN_SYSTEM_HEADER_P (old
);
5153 current_tinst_level
= TREE_CHAIN (old
);
5158 /* We're instantiating a deferred template; restore the template
5159 instantiation context in which the instantiation was requested, which
5160 is one step out from LEVEL. */
5163 reopen_tinst_level (tree level
)
5168 for (t
= level
; t
; t
= TREE_CHAIN (t
))
5171 current_tinst_level
= level
;
5175 /* DECL is a friend FUNCTION_DECL or TEMPLATE_DECL. ARGS is the
5176 vector of template arguments, as for tsubst.
5178 Returns an appropriate tsubst'd friend declaration. */
5181 tsubst_friend_function (tree decl
, tree args
)
5185 if (TREE_CODE (decl
) == FUNCTION_DECL
5186 && DECL_TEMPLATE_INSTANTIATION (decl
)
5187 && TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
5188 /* This was a friend declared with an explicit template
5189 argument list, e.g.:
5193 to indicate that f was a template instantiation, not a new
5194 function declaration. Now, we have to figure out what
5195 instantiation of what template. */
5197 tree template_id
, arglist
, fns
;
5200 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (current_class_type
));
5202 /* Friend functions are looked up in the containing namespace scope.
5203 We must enter that scope, to avoid finding member functions of the
5204 current cless with same name. */
5205 push_nested_namespace (ns
);
5206 fns
= tsubst_expr (DECL_TI_TEMPLATE (decl
), args
,
5207 tf_warning_or_error
, NULL_TREE
);
5208 pop_nested_namespace (ns
);
5209 arglist
= tsubst (DECL_TI_ARGS (decl
), args
,
5210 tf_warning_or_error
, NULL_TREE
);
5211 template_id
= lookup_template_function (fns
, arglist
);
5213 new_friend
= tsubst (decl
, args
, tf_warning_or_error
, NULL_TREE
);
5214 tmpl
= determine_specialization (template_id
, new_friend
,
5216 /*need_member_template=*/0,
5217 TREE_VEC_LENGTH (args
),
5219 return instantiate_template (tmpl
, new_args
, tf_error
);
5222 new_friend
= tsubst (decl
, args
, tf_warning_or_error
, NULL_TREE
);
5224 /* The NEW_FRIEND will look like an instantiation, to the
5225 compiler, but is not an instantiation from the point of view of
5226 the language. For example, we might have had:
5228 template <class T> struct S {
5229 template <class U> friend void f(T, U);
5232 Then, in S<int>, template <class U> void f(int, U) is not an
5233 instantiation of anything. */
5234 if (new_friend
== error_mark_node
)
5235 return error_mark_node
;
5237 DECL_USE_TEMPLATE (new_friend
) = 0;
5238 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
5240 DECL_USE_TEMPLATE (DECL_TEMPLATE_RESULT (new_friend
)) = 0;
5241 DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (new_friend
))
5242 = DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (decl
));
5245 /* The mangled name for the NEW_FRIEND is incorrect. The function
5246 is not a template instantiation and should not be mangled like
5247 one. Therefore, we forget the mangling here; we'll recompute it
5248 later if we need it. */
5249 if (TREE_CODE (new_friend
) != TEMPLATE_DECL
)
5251 SET_DECL_RTL (new_friend
, NULL_RTX
);
5252 SET_DECL_ASSEMBLER_NAME (new_friend
, NULL_TREE
);
5255 if (DECL_NAMESPACE_SCOPE_P (new_friend
))
5258 tree new_friend_template_info
;
5259 tree new_friend_result_template_info
;
5261 int new_friend_is_defn
;
5263 /* We must save some information from NEW_FRIEND before calling
5264 duplicate decls since that function will free NEW_FRIEND if
5266 new_friend_template_info
= DECL_TEMPLATE_INFO (new_friend
);
5267 new_friend_is_defn
=
5268 (DECL_INITIAL (DECL_TEMPLATE_RESULT
5269 (template_for_substitution (new_friend
)))
5271 if (TREE_CODE (new_friend
) == TEMPLATE_DECL
)
5273 /* This declaration is a `primary' template. */
5274 DECL_PRIMARY_TEMPLATE (new_friend
) = new_friend
;
5276 new_friend_result_template_info
5277 = DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (new_friend
));
5280 new_friend_result_template_info
= NULL_TREE
;
5282 /* Inside pushdecl_namespace_level, we will push into the
5283 current namespace. However, the friend function should go
5284 into the namespace of the template. */
5285 ns
= decl_namespace_context (new_friend
);
5286 push_nested_namespace (ns
);
5287 old_decl
= pushdecl_namespace_level (new_friend
, /*is_friend=*/true);
5288 pop_nested_namespace (ns
);
5290 if (old_decl
== error_mark_node
)
5291 return error_mark_node
;
5293 if (old_decl
!= new_friend
)
5295 /* This new friend declaration matched an existing
5296 declaration. For example, given:
5298 template <class T> void f(T);
5299 template <class U> class C {
5300 template <class T> friend void f(T) {}
5303 the friend declaration actually provides the definition
5304 of `f', once C has been instantiated for some type. So,
5305 old_decl will be the out-of-class template declaration,
5306 while new_friend is the in-class definition.
5308 But, if `f' was called before this point, the
5309 instantiation of `f' will have DECL_TI_ARGS corresponding
5310 to `T' but not to `U', references to which might appear
5311 in the definition of `f'. Previously, the most general
5312 template for an instantiation of `f' was the out-of-class
5313 version; now it is the in-class version. Therefore, we
5314 run through all specialization of `f', adding to their
5315 DECL_TI_ARGS appropriately. In particular, they need a
5316 new set of outer arguments, corresponding to the
5317 arguments for this class instantiation.
5319 The same situation can arise with something like this:
5322 template <class T> class C {
5326 when `C<int>' is instantiated. Now, `f(int)' is defined
5329 if (!new_friend_is_defn
)
5330 /* On the other hand, if the in-class declaration does
5331 *not* provide a definition, then we don't want to alter
5332 existing definitions. We can just leave everything
5337 /* Overwrite whatever template info was there before, if
5338 any, with the new template information pertaining to
5340 DECL_TEMPLATE_INFO (old_decl
) = new_friend_template_info
;
5342 if (TREE_CODE (old_decl
) != TEMPLATE_DECL
)
5343 reregister_specialization (new_friend
,
5344 most_general_template (old_decl
),
5349 tree new_friend_args
;
5351 DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (old_decl
))
5352 = new_friend_result_template_info
;
5354 new_friend_args
= TI_ARGS (new_friend_template_info
);
5355 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (old_decl
);
5359 tree spec
= TREE_VALUE (t
);
5362 = add_outermost_template_args (new_friend_args
,
5363 DECL_TI_ARGS (spec
));
5366 /* Now, since specializations are always supposed to
5367 hang off of the most general template, we must move
5369 t
= most_general_template (old_decl
);
5372 DECL_TEMPLATE_SPECIALIZATIONS (t
)
5373 = chainon (DECL_TEMPLATE_SPECIALIZATIONS (t
),
5374 DECL_TEMPLATE_SPECIALIZATIONS (old_decl
));
5375 DECL_TEMPLATE_SPECIALIZATIONS (old_decl
) = NULL_TREE
;
5380 /* The information from NEW_FRIEND has been merged into OLD_DECL
5381 by duplicate_decls. */
5382 new_friend
= old_decl
;
5387 tree context
= DECL_CONTEXT (new_friend
);
5391 template <class T> class C {
5392 template <class U> friend void C1<U>::f (); // case 1
5393 friend void C2<T>::f (); // case 2
5395 we only need to make sure CONTEXT is a complete type for
5396 case 2. To distinguish between the two cases, we note that
5397 CONTEXT of case 1 remains dependent type after tsubst while
5398 this isn't true for case 2. */
5399 ++processing_template_decl
;
5400 dependent_p
= dependent_type_p (context
);
5401 --processing_template_decl
;
5404 && !complete_type_or_else (context
, NULL_TREE
))
5405 return error_mark_node
;
5407 if (COMPLETE_TYPE_P (context
))
5409 /* Check to see that the declaration is really present, and,
5410 possibly obtain an improved declaration. */
5411 tree fn
= check_classfn (context
,
5412 new_friend
, NULL_TREE
);
5422 /* FRIEND_TMPL is a friend TEMPLATE_DECL. ARGS is the vector of
5423 template arguments, as for tsubst.
5425 Returns an appropriate tsubst'd friend type or error_mark_node on
5429 tsubst_friend_class (tree friend_tmpl
, tree args
)
5435 context
= DECL_CONTEXT (friend_tmpl
);
5439 if (TREE_CODE (context
) == NAMESPACE_DECL
)
5440 push_nested_namespace (context
);
5442 push_nested_class (tsubst (context
, args
, tf_none
, NULL_TREE
));
5445 /* Look for a class template declaration. We look for hidden names
5446 because two friend declarations of the same template are the
5447 same. For example, in:
5450 template <typename> friend class F;
5452 template <typename> struct B {
5453 template <typename> friend class F;
5456 both F templates are the same. */
5457 tmpl
= lookup_name_real (DECL_NAME (friend_tmpl
), 0, 0,
5458 /*block_p=*/true, 0,
5459 LOOKUP_COMPLAIN
| LOOKUP_HIDDEN
);
5461 /* But, if we don't find one, it might be because we're in a
5462 situation like this:
5470 Here, in the scope of (say) S<int>, `S' is bound to a TYPE_DECL
5471 for `S<int>', not the TEMPLATE_DECL. */
5472 if (!tmpl
|| !DECL_CLASS_TEMPLATE_P (tmpl
))
5474 tmpl
= lookup_name_prefer_type (DECL_NAME (friend_tmpl
), 1);
5475 tmpl
= maybe_get_template_decl_from_type_decl (tmpl
);
5478 if (tmpl
&& DECL_CLASS_TEMPLATE_P (tmpl
))
5480 /* The friend template has already been declared. Just
5481 check to see that the declarations match, and install any new
5482 default parameters. We must tsubst the default parameters,
5483 of course. We only need the innermost template parameters
5484 because that is all that redeclare_class_template will look
5486 if (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (friend_tmpl
))
5487 > TMPL_ARGS_DEPTH (args
))
5490 parms
= tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_tmpl
),
5491 args
, tf_warning_or_error
);
5492 redeclare_class_template (TREE_TYPE (tmpl
), parms
);
5495 friend_type
= TREE_TYPE (tmpl
);
5499 /* The friend template has not already been declared. In this
5500 case, the instantiation of the template class will cause the
5501 injection of this template into the global scope. */
5502 tmpl
= tsubst (friend_tmpl
, args
, tf_warning_or_error
, NULL_TREE
);
5503 if (tmpl
== error_mark_node
)
5504 return error_mark_node
;
5506 /* The new TMPL is not an instantiation of anything, so we
5507 forget its origins. We don't reset CLASSTYPE_TI_TEMPLATE for
5508 the new type because that is supposed to be the corresponding
5509 template decl, i.e., TMPL. */
5510 DECL_USE_TEMPLATE (tmpl
) = 0;
5511 DECL_TEMPLATE_INFO (tmpl
) = NULL_TREE
;
5512 CLASSTYPE_USE_TEMPLATE (TREE_TYPE (tmpl
)) = 0;
5513 CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl
))
5514 = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl
)));
5516 /* Inject this template into the global scope. */
5517 friend_type
= TREE_TYPE (pushdecl_top_level_maybe_friend (tmpl
, true));
5522 if (TREE_CODE (context
) == NAMESPACE_DECL
)
5523 pop_nested_namespace (context
);
5525 pop_nested_class ();
5531 /* Returns zero if TYPE cannot be completed later due to circularity.
5532 Otherwise returns one. */
5535 can_complete_type_without_circularity (tree type
)
5537 if (type
== NULL_TREE
|| type
== error_mark_node
)
5539 else if (COMPLETE_TYPE_P (type
))
5541 else if (TREE_CODE (type
) == ARRAY_TYPE
&& TYPE_DOMAIN (type
))
5542 return can_complete_type_without_circularity (TREE_TYPE (type
));
5543 else if (CLASS_TYPE_P (type
)
5544 && TYPE_BEING_DEFINED (TYPE_MAIN_VARIANT (type
)))
5551 instantiate_class_template (tree type
)
5553 tree
template, args
, pattern
, t
, member
;
5558 if (type
== error_mark_node
)
5559 return error_mark_node
;
5561 if (TYPE_BEING_DEFINED (type
)
5562 || COMPLETE_TYPE_P (type
)
5563 || dependent_type_p (type
))
5566 /* Figure out which template is being instantiated. */
5567 template = most_general_template (CLASSTYPE_TI_TEMPLATE (type
));
5568 gcc_assert (TREE_CODE (template) == TEMPLATE_DECL
);
5570 /* Determine what specialization of the original template to
5572 t
= most_specialized_class (type
, template);
5573 if (t
== error_mark_node
)
5575 TYPE_BEING_DEFINED (type
) = 1;
5576 return error_mark_node
;
5580 /* This TYPE is actually an instantiation of a partial
5581 specialization. We replace the innermost set of ARGS with
5582 the arguments appropriate for substitution. For example,
5585 template <class T> struct S {};
5586 template <class T> struct S<T*> {};
5588 and supposing that we are instantiating S<int*>, ARGS will
5589 presently be {int*} -- but we need {int}. */
5590 pattern
= TREE_TYPE (t
);
5591 args
= TREE_PURPOSE (t
);
5595 pattern
= TREE_TYPE (template);
5596 args
= CLASSTYPE_TI_ARGS (type
);
5599 /* If the template we're instantiating is incomplete, then clearly
5600 there's nothing we can do. */
5601 if (!COMPLETE_TYPE_P (pattern
))
5604 /* If we've recursively instantiated too many templates, stop. */
5605 if (! push_tinst_level (type
))
5608 /* Now we're really doing the instantiation. Mark the type as in
5609 the process of being defined. */
5610 TYPE_BEING_DEFINED (type
) = 1;
5612 /* We may be in the middle of deferred access check. Disable
5614 push_deferring_access_checks (dk_no_deferred
);
5616 push_to_top_level ();
5618 SET_CLASSTYPE_INTERFACE_UNKNOWN (type
);
5620 /* Set the input location to the template definition. This is needed
5621 if tsubsting causes an error. */
5622 typedecl
= TYPE_MAIN_DECL (type
);
5623 input_location
= DECL_SOURCE_LOCATION (typedecl
);
5624 in_system_header
= DECL_IN_SYSTEM_HEADER (typedecl
);
5626 TYPE_HAS_CONSTRUCTOR (type
) = TYPE_HAS_CONSTRUCTOR (pattern
);
5627 TYPE_HAS_NEW_OPERATOR (type
) = TYPE_HAS_NEW_OPERATOR (pattern
);
5628 TYPE_HAS_ARRAY_NEW_OPERATOR (type
) = TYPE_HAS_ARRAY_NEW_OPERATOR (pattern
);
5629 TYPE_GETS_DELETE (type
) = TYPE_GETS_DELETE (pattern
);
5630 TYPE_HAS_ASSIGN_REF (type
) = TYPE_HAS_ASSIGN_REF (pattern
);
5631 TYPE_HAS_CONST_ASSIGN_REF (type
) = TYPE_HAS_CONST_ASSIGN_REF (pattern
);
5632 TYPE_HAS_INIT_REF (type
) = TYPE_HAS_INIT_REF (pattern
);
5633 TYPE_HAS_CONST_INIT_REF (type
) = TYPE_HAS_CONST_INIT_REF (pattern
);
5634 TYPE_HAS_DEFAULT_CONSTRUCTOR (type
) = TYPE_HAS_DEFAULT_CONSTRUCTOR (pattern
);
5635 TYPE_HAS_CONVERSION (type
) = TYPE_HAS_CONVERSION (pattern
);
5636 TYPE_PACKED (type
) = TYPE_PACKED (pattern
);
5637 TYPE_ALIGN (type
) = TYPE_ALIGN (pattern
);
5638 TYPE_USER_ALIGN (type
) = TYPE_USER_ALIGN (pattern
);
5639 TYPE_FOR_JAVA (type
) = TYPE_FOR_JAVA (pattern
); /* For libjava's JArray<T> */
5640 if (ANON_AGGR_TYPE_P (pattern
))
5641 SET_ANON_AGGR_TYPE_P (type
);
5642 if (CLASSTYPE_VISIBILITY_SPECIFIED (pattern
))
5644 CLASSTYPE_VISIBILITY_SPECIFIED (type
) = 1;
5645 CLASSTYPE_VISIBILITY (type
) = CLASSTYPE_VISIBILITY (pattern
);
5648 pbinfo
= TYPE_BINFO (pattern
);
5650 /* We should never instantiate a nested class before its enclosing
5651 class; we need to look up the nested class by name before we can
5652 instantiate it, and that lookup should instantiate the enclosing
5654 gcc_assert (!DECL_CLASS_SCOPE_P (TYPE_MAIN_DECL (pattern
))
5655 || COMPLETE_TYPE_P (TYPE_CONTEXT (type
))
5656 || TYPE_BEING_DEFINED (TYPE_CONTEXT (type
)));
5658 base_list
= NULL_TREE
;
5659 if (BINFO_N_BASE_BINFOS (pbinfo
))
5662 tree context
= TYPE_CONTEXT (type
);
5666 /* We must enter the scope containing the type, as that is where
5667 the accessibility of types named in dependent bases are
5669 pushed_scope
= push_scope (context
? context
: global_namespace
);
5671 /* Substitute into each of the bases to determine the actual
5673 for (i
= 0; BINFO_BASE_ITERATE (pbinfo
, i
, pbase_binfo
); i
++)
5676 tree access
= BINFO_BASE_ACCESS (pbinfo
, i
);
5678 /* Substitute to figure out the base class. */
5679 base
= tsubst (BINFO_TYPE (pbase_binfo
), args
, tf_error
, NULL_TREE
);
5680 if (base
== error_mark_node
)
5683 base_list
= tree_cons (access
, base
, base_list
);
5684 if (BINFO_VIRTUAL_P (pbase_binfo
))
5685 TREE_TYPE (base_list
) = integer_type_node
;
5688 /* The list is now in reverse order; correct that. */
5689 base_list
= nreverse (base_list
);
5692 pop_scope (pushed_scope
);
5694 /* Now call xref_basetypes to set up all the base-class
5696 xref_basetypes (type
, base_list
);
5699 /* Now that our base classes are set up, enter the scope of the
5700 class, so that name lookups into base classes, etc. will work
5701 correctly. This is precisely analogous to what we do in
5702 begin_class_definition when defining an ordinary non-template
5706 /* Now members are processed in the order of declaration. */
5707 for (member
= CLASSTYPE_DECL_LIST (pattern
);
5708 member
; member
= TREE_CHAIN (member
))
5710 tree t
= TREE_VALUE (member
);
5712 if (TREE_PURPOSE (member
))
5716 /* Build new CLASSTYPE_NESTED_UTDS. */
5719 bool class_template_p
;
5721 class_template_p
= (TREE_CODE (t
) != ENUMERAL_TYPE
5722 && TYPE_LANG_SPECIFIC (t
)
5723 && CLASSTYPE_IS_TEMPLATE (t
));
5724 /* If the member is a class template, then -- even after
5725 substitution -- there may be dependent types in the
5726 template argument list for the class. We increment
5727 PROCESSING_TEMPLATE_DECL so that dependent_type_p, as
5728 that function will assume that no types are dependent
5729 when outside of a template. */
5730 if (class_template_p
)
5731 ++processing_template_decl
;
5732 newtag
= tsubst (t
, args
, tf_error
, NULL_TREE
);
5733 if (class_template_p
)
5734 --processing_template_decl
;
5735 if (newtag
== error_mark_node
)
5738 if (TREE_CODE (newtag
) != ENUMERAL_TYPE
)
5740 tree name
= TYPE_IDENTIFIER (t
);
5742 if (class_template_p
)
5743 /* Unfortunately, lookup_template_class sets
5744 CLASSTYPE_IMPLICIT_INSTANTIATION for a partial
5745 instantiation (i.e., for the type of a member
5746 template class nested within a template class.)
5747 This behavior is required for
5748 maybe_process_partial_specialization to work
5749 correctly, but is not accurate in this case;
5750 the TAG is not an instantiation of anything.
5751 (The corresponding TEMPLATE_DECL is an
5752 instantiation, but the TYPE is not.) */
5753 CLASSTYPE_USE_TEMPLATE (newtag
) = 0;
5755 /* Now, we call pushtag to put this NEWTAG into the scope of
5756 TYPE. We first set up the IDENTIFIER_TYPE_VALUE to avoid
5757 pushtag calling push_template_decl. We don't have to do
5758 this for enums because it will already have been done in
5761 SET_IDENTIFIER_TYPE_VALUE (name
, newtag
);
5762 pushtag (name
, newtag
, /*tag_scope=*/ts_current
);
5765 else if (TREE_CODE (t
) == FUNCTION_DECL
5766 || DECL_FUNCTION_TEMPLATE_P (t
))
5768 /* Build new TYPE_METHODS. */
5771 if (TREE_CODE (t
) == TEMPLATE_DECL
)
5772 ++processing_template_decl
;
5773 r
= tsubst (t
, args
, tf_error
, NULL_TREE
);
5774 if (TREE_CODE (t
) == TEMPLATE_DECL
)
5775 --processing_template_decl
;
5776 set_current_access_from_decl (r
);
5777 finish_member_declaration (r
);
5781 /* Build new TYPE_FIELDS. */
5783 if (TREE_CODE (t
) != CONST_DECL
)
5787 /* The the file and line for this declaration, to
5788 assist in error message reporting. Since we
5789 called push_tinst_level above, we don't need to
5791 input_location
= DECL_SOURCE_LOCATION (t
);
5793 if (TREE_CODE (t
) == TEMPLATE_DECL
)
5794 ++processing_template_decl
;
5795 r
= tsubst (t
, args
, tf_warning_or_error
, NULL_TREE
);
5796 if (TREE_CODE (t
) == TEMPLATE_DECL
)
5797 --processing_template_decl
;
5798 if (TREE_CODE (r
) == VAR_DECL
)
5802 [t]he initialization (and any associated
5803 side-effects) of a static data member does
5804 not occur unless the static data member is
5805 itself used in a way that requires the
5806 definition of the static data member to
5809 Therefore, we do not substitute into the
5810 initialized for the static data member here. */
5811 finish_static_data_member_decl
5814 /*init_const_expr_p=*/false,
5815 /*asmspec_tree=*/NULL_TREE
,
5817 if (DECL_INITIALIZED_IN_CLASS_P (r
))
5818 check_static_variable_definition (r
, TREE_TYPE (r
));
5820 else if (TREE_CODE (r
) == FIELD_DECL
)
5822 /* Determine whether R has a valid type and can be
5823 completed later. If R is invalid, then it is
5824 replaced by error_mark_node so that it will not be
5825 added to TYPE_FIELDS. */
5826 tree rtype
= TREE_TYPE (r
);
5827 if (can_complete_type_without_circularity (rtype
))
5828 complete_type (rtype
);
5830 if (!COMPLETE_TYPE_P (rtype
))
5832 cxx_incomplete_type_error (r
, rtype
);
5833 r
= error_mark_node
;
5837 /* If it is a TYPE_DECL for a class-scoped ENUMERAL_TYPE,
5838 such a thing will already have been added to the field
5839 list by tsubst_enum in finish_member_declaration in the
5840 CLASSTYPE_NESTED_UTDS case above. */
5841 if (!(TREE_CODE (r
) == TYPE_DECL
5842 && TREE_CODE (TREE_TYPE (r
)) == ENUMERAL_TYPE
5843 && DECL_ARTIFICIAL (r
)))
5845 set_current_access_from_decl (r
);
5846 finish_member_declaration (r
);
5853 if (TYPE_P (t
) || DECL_CLASS_TEMPLATE_P (t
))
5855 /* Build new CLASSTYPE_FRIEND_CLASSES. */
5857 tree friend_type
= t
;
5858 bool adjust_processing_template_decl
= false;
5860 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
5862 /* template <class T> friend class C; */
5863 friend_type
= tsubst_friend_class (friend_type
, args
);
5864 adjust_processing_template_decl
= true;
5866 else if (TREE_CODE (friend_type
) == UNBOUND_CLASS_TEMPLATE
)
5868 /* template <class T> friend class C::D; */
5869 friend_type
= tsubst (friend_type
, args
,
5870 tf_warning_or_error
, NULL_TREE
);
5871 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
5872 friend_type
= TREE_TYPE (friend_type
);
5873 adjust_processing_template_decl
= true;
5875 else if (TREE_CODE (friend_type
) == TYPENAME_TYPE
)
5877 /* This could be either
5881 when dependent_type_p is false or
5883 template <class U> friend class T::C;
5886 friend_type
= tsubst (friend_type
, args
,
5887 tf_warning_or_error
, NULL_TREE
);
5888 /* Bump processing_template_decl for correct
5889 dependent_type_p calculation. */
5890 ++processing_template_decl
;
5891 if (dependent_type_p (friend_type
))
5892 adjust_processing_template_decl
= true;
5893 --processing_template_decl
;
5895 else if (!CLASSTYPE_USE_TEMPLATE (friend_type
)
5896 && hidden_name_p (TYPE_NAME (friend_type
)))
5900 where C hasn't been declared yet. Let's lookup name
5901 from namespace scope directly, bypassing any name that
5902 come from dependent base class. */
5903 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (friend_type
));
5905 /* The call to xref_tag_from_type does injection for friend
5907 push_nested_namespace (ns
);
5909 xref_tag_from_type (friend_type
, NULL_TREE
,
5910 /*tag_scope=*/ts_current
);
5911 pop_nested_namespace (ns
);
5913 else if (uses_template_parms (friend_type
))
5914 /* friend class C<T>; */
5915 friend_type
= tsubst (friend_type
, args
,
5916 tf_warning_or_error
, NULL_TREE
);
5921 where C is already declared or
5923 friend class C<int>;
5925 We don't have to do anything in these cases. */
5927 if (adjust_processing_template_decl
)
5928 /* Trick make_friend_class into realizing that the friend
5929 we're adding is a template, not an ordinary class. It's
5930 important that we use make_friend_class since it will
5931 perform some error-checking and output cross-reference
5933 ++processing_template_decl
;
5935 if (friend_type
!= error_mark_node
)
5936 make_friend_class (type
, friend_type
, /*complain=*/false);
5938 if (adjust_processing_template_decl
)
5939 --processing_template_decl
;
5943 /* Build new DECL_FRIENDLIST. */
5946 /* The the file and line for this declaration, to
5947 assist in error message reporting. Since we
5948 called push_tinst_level above, we don't need to
5950 input_location
= DECL_SOURCE_LOCATION (t
);
5952 if (TREE_CODE (t
) == TEMPLATE_DECL
)
5954 ++processing_template_decl
;
5955 push_deferring_access_checks (dk_no_check
);
5958 r
= tsubst_friend_function (t
, args
);
5959 add_friend (type
, r
, /*complain=*/false);
5960 if (TREE_CODE (t
) == TEMPLATE_DECL
)
5962 pop_deferring_access_checks ();
5963 --processing_template_decl
;
5969 /* Set the file and line number information to whatever is given for
5970 the class itself. This puts error messages involving generated
5971 implicit functions at a predictable point, and the same point
5972 that would be used for non-template classes. */
5973 input_location
= DECL_SOURCE_LOCATION (typedecl
);
5975 unreverse_member_declarations (type
);
5976 finish_struct_1 (type
);
5977 TYPE_BEING_DEFINED (type
) = 0;
5979 /* Now that the class is complete, instantiate default arguments for
5980 any member functions. We don't do this earlier because the
5981 default arguments may reference members of the class. */
5982 if (!PRIMARY_TEMPLATE_P (template))
5983 for (t
= TYPE_METHODS (type
); t
; t
= TREE_CHAIN (t
))
5984 if (TREE_CODE (t
) == FUNCTION_DECL
5985 /* Implicitly generated member functions will not have template
5986 information; they are not instantiations, but instead are
5987 created "fresh" for each instantiation. */
5988 && DECL_TEMPLATE_INFO (t
))
5989 tsubst_default_arguments (t
);
5992 pop_from_top_level ();
5993 pop_deferring_access_checks ();
5996 /* The vtable for a template class can be emitted in any translation
5997 unit in which the class is instantiated. When there is no key
5998 method, however, finish_struct_1 will already have added TYPE to
5999 the keyed_classes list. */
6000 if (TYPE_CONTAINS_VPTR_P (type
) && CLASSTYPE_KEY_METHOD (type
))
6001 keyed_classes
= tree_cons (NULL_TREE
, type
, keyed_classes
);
6007 tsubst_template_arg (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
6013 else if (TYPE_P (t
))
6014 r
= tsubst (t
, args
, complain
, in_decl
);
6017 r
= tsubst_expr (t
, args
, complain
, in_decl
);
6018 r
= fold_non_dependent_expr (r
);
6023 /* Substitute ARGS into the vector or list of template arguments T. */
6026 tsubst_template_args (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
6028 int len
= TREE_VEC_LENGTH (t
);
6029 int need_new
= 0, i
;
6030 tree
*elts
= (tree
*) alloca (len
* sizeof (tree
));
6032 for (i
= 0; i
< len
; i
++)
6034 tree orig_arg
= TREE_VEC_ELT (t
, i
);
6037 if (TREE_CODE (orig_arg
) == TREE_VEC
)
6038 new_arg
= tsubst_template_args (orig_arg
, args
, complain
, in_decl
);
6040 new_arg
= tsubst_template_arg (orig_arg
, args
, complain
, in_decl
);
6042 if (new_arg
== error_mark_node
)
6043 return error_mark_node
;
6046 if (new_arg
!= orig_arg
)
6053 t
= make_tree_vec (len
);
6054 for (i
= 0; i
< len
; i
++)
6055 TREE_VEC_ELT (t
, i
) = elts
[i
];
6060 /* Return the result of substituting ARGS into the template parameters
6061 given by PARMS. If there are m levels of ARGS and m + n levels of
6062 PARMS, then the result will contain n levels of PARMS. For
6063 example, if PARMS is `template <class T> template <class U>
6064 template <T*, U, class V>' and ARGS is {{int}, {double}} then the
6065 result will be `template <int*, double, class V>'. */
6068 tsubst_template_parms (tree parms
, tree args
, tsubst_flags_t complain
)
6073 /* When substituting into a template, we must set
6074 PROCESSING_TEMPLATE_DECL as the template parameters may be
6075 dependent if they are based on one-another, and the dependency
6076 predicates are short-circuit outside of templates. */
6077 ++processing_template_decl
;
6079 for (new_parms
= &r
;
6080 TMPL_PARMS_DEPTH (parms
) > TMPL_ARGS_DEPTH (args
);
6081 new_parms
= &(TREE_CHAIN (*new_parms
)),
6082 parms
= TREE_CHAIN (parms
))
6085 make_tree_vec (TREE_VEC_LENGTH (TREE_VALUE (parms
)));
6088 for (i
= 0; i
< TREE_VEC_LENGTH (new_vec
); ++i
)
6094 if (parms
== error_mark_node
)
6097 tuple
= TREE_VEC_ELT (TREE_VALUE (parms
), i
);
6099 if (tuple
== error_mark_node
)
6102 default_value
= TREE_PURPOSE (tuple
);
6103 parm_decl
= TREE_VALUE (tuple
);
6105 parm_decl
= tsubst (parm_decl
, args
, complain
, NULL_TREE
);
6106 if (TREE_CODE (parm_decl
) == PARM_DECL
6107 && invalid_nontype_parm_type_p (TREE_TYPE (parm_decl
), complain
))
6108 parm_decl
= error_mark_node
;
6109 default_value
= tsubst_template_arg (default_value
, args
,
6110 complain
, NULL_TREE
);
6112 tuple
= build_tree_list (default_value
, parm_decl
);
6113 TREE_VEC_ELT (new_vec
, i
) = tuple
;
6117 tree_cons (size_int (TMPL_PARMS_DEPTH (parms
)
6118 - TMPL_ARGS_DEPTH (args
)),
6119 new_vec
, NULL_TREE
);
6122 --processing_template_decl
;
6127 /* Substitute the ARGS into the indicated aggregate (or enumeration)
6128 type T. If T is not an aggregate or enumeration type, it is
6129 handled as if by tsubst. IN_DECL is as for tsubst. If
6130 ENTERING_SCOPE is nonzero, T is the context for a template which
6131 we are presently tsubst'ing. Return the substituted value. */
6134 tsubst_aggr_type (tree t
,
6136 tsubst_flags_t complain
,
6143 switch (TREE_CODE (t
))
6146 if (TYPE_PTRMEMFUNC_P (t
))
6147 return tsubst (TYPE_PTRMEMFUNC_FN_TYPE (t
), args
, complain
, in_decl
);
6149 /* Else fall through. */
6152 if (TYPE_TEMPLATE_INFO (t
))
6157 bool saved_skip_evaluation
;
6159 /* In "sizeof(X<I>)" we need to evaluate "I". */
6160 saved_skip_evaluation
= skip_evaluation
;
6161 skip_evaluation
= false;
6163 /* First, determine the context for the type we are looking
6165 context
= TYPE_CONTEXT (t
);
6167 context
= tsubst_aggr_type (context
, args
, complain
,
6168 in_decl
, /*entering_scope=*/1);
6170 /* Then, figure out what arguments are appropriate for the
6171 type we are trying to find. For example, given:
6173 template <class T> struct S;
6174 template <class T, class U> void f(T, U) { S<U> su; }
6176 and supposing that we are instantiating f<int, double>,
6177 then our ARGS will be {int, double}, but, when looking up
6178 S we only want {double}. */
6179 argvec
= tsubst_template_args (TYPE_TI_ARGS (t
), args
,
6181 if (argvec
== error_mark_node
)
6182 r
= error_mark_node
;
6185 r
= lookup_template_class (t
, argvec
, in_decl
, context
,
6186 entering_scope
, complain
);
6187 r
= cp_build_qualified_type_real (r
, TYPE_QUALS (t
), complain
);
6190 skip_evaluation
= saved_skip_evaluation
;
6195 /* This is not a template type, so there's nothing to do. */
6199 return tsubst (t
, args
, complain
, in_decl
);
6203 /* Substitute into the default argument ARG (a default argument for
6204 FN), which has the indicated TYPE. */
6207 tsubst_default_argument (tree fn
, tree type
, tree arg
)
6209 tree saved_class_ptr
= NULL_TREE
;
6210 tree saved_class_ref
= NULL_TREE
;
6212 /* This default argument came from a template. Instantiate the
6213 default argument here, not in tsubst. In the case of
6222 we must be careful to do name lookup in the scope of S<T>,
6223 rather than in the current class. */
6224 push_access_scope (fn
);
6225 /* The "this" pointer is not valid in a default argument. */
6228 saved_class_ptr
= current_class_ptr
;
6229 cp_function_chain
->x_current_class_ptr
= NULL_TREE
;
6230 saved_class_ref
= current_class_ref
;
6231 cp_function_chain
->x_current_class_ref
= NULL_TREE
;
6234 push_deferring_access_checks(dk_no_deferred
);
6235 /* The default argument expression may cause implicitly defined
6236 member functions to be synthesized, which will result in garbage
6237 collection. We must treat this situation as if we were within
6238 the body of function so as to avoid collecting live data on the
6241 arg
= tsubst_expr (arg
, DECL_TI_ARGS (fn
),
6242 tf_warning_or_error
, NULL_TREE
);
6244 pop_deferring_access_checks();
6246 /* Restore the "this" pointer. */
6249 cp_function_chain
->x_current_class_ptr
= saved_class_ptr
;
6250 cp_function_chain
->x_current_class_ref
= saved_class_ref
;
6253 pop_access_scope (fn
);
6255 /* Make sure the default argument is reasonable. */
6256 arg
= check_default_argument (type
, arg
);
6261 /* Substitute into all the default arguments for FN. */
6264 tsubst_default_arguments (tree fn
)
6269 tmpl_args
= DECL_TI_ARGS (fn
);
6271 /* If this function is not yet instantiated, we certainly don't need
6272 its default arguments. */
6273 if (uses_template_parms (tmpl_args
))
6276 for (arg
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
6278 arg
= TREE_CHAIN (arg
))
6279 if (TREE_PURPOSE (arg
))
6280 TREE_PURPOSE (arg
) = tsubst_default_argument (fn
,
6282 TREE_PURPOSE (arg
));
6285 /* Substitute the ARGS into the T, which is a _DECL. Return the
6286 result of the substitution. Issue error and warning messages under
6287 control of COMPLAIN. */
6290 tsubst_decl (tree t
, tree args
, tsubst_flags_t complain
)
6292 location_t saved_loc
;
6296 /* Set the filename and linenumber to improve error-reporting. */
6297 saved_loc
= input_location
;
6298 input_location
= DECL_SOURCE_LOCATION (t
);
6300 switch (TREE_CODE (t
))
6304 /* We can get here when processing a member function template,
6305 member class template, and template template parameter of
6306 a template class. */
6307 tree decl
= DECL_TEMPLATE_RESULT (t
);
6312 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
6314 /* Template template parameter is treated here. */
6315 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
6316 if (new_type
== error_mark_node
)
6317 return error_mark_node
;
6320 TREE_CHAIN (r
) = NULL_TREE
;
6321 TREE_TYPE (r
) = new_type
;
6322 DECL_TEMPLATE_RESULT (r
)
6323 = build_decl (TYPE_DECL
, DECL_NAME (decl
), new_type
);
6324 DECL_TEMPLATE_PARMS (r
)
6325 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t
), args
,
6327 TYPE_NAME (new_type
) = r
;
6331 /* We might already have an instance of this template.
6332 The ARGS are for the surrounding class type, so the
6333 full args contain the tsubst'd args for the context,
6334 plus the innermost args from the template decl. */
6335 tmpl_args
= DECL_CLASS_TEMPLATE_P (t
)
6336 ? CLASSTYPE_TI_ARGS (TREE_TYPE (t
))
6337 : DECL_TI_ARGS (DECL_TEMPLATE_RESULT (t
));
6338 /* Because this is a template, the arguments will still be
6339 dependent, even after substitution. If
6340 PROCESSING_TEMPLATE_DECL is not set, the dependency
6341 predicates will short-circuit. */
6342 ++processing_template_decl
;
6343 full_args
= tsubst_template_args (tmpl_args
, args
,
6345 --processing_template_decl
;
6346 if (full_args
== error_mark_node
)
6347 return error_mark_node
;
6349 /* tsubst_template_args doesn't copy the vector if
6350 nothing changed. But, *something* should have
6352 gcc_assert (full_args
!= tmpl_args
);
6354 spec
= retrieve_specialization (t
, full_args
,
6355 /*class_specializations_p=*/true);
6356 if (spec
!= NULL_TREE
)
6362 /* Make a new template decl. It will be similar to the
6363 original, but will record the current template arguments.
6364 We also create a new function declaration, which is just
6365 like the old one, but points to this new template, rather
6366 than the old one. */
6368 gcc_assert (DECL_LANG_SPECIFIC (r
) != 0);
6369 TREE_CHAIN (r
) = NULL_TREE
;
6371 DECL_TEMPLATE_INFO (r
) = build_tree_list (t
, args
);
6373 if (TREE_CODE (decl
) == TYPE_DECL
)
6376 ++processing_template_decl
;
6377 new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
6378 --processing_template_decl
;
6379 if (new_type
== error_mark_node
)
6380 return error_mark_node
;
6382 TREE_TYPE (r
) = new_type
;
6383 CLASSTYPE_TI_TEMPLATE (new_type
) = r
;
6384 DECL_TEMPLATE_RESULT (r
) = TYPE_MAIN_DECL (new_type
);
6385 DECL_TI_ARGS (r
) = CLASSTYPE_TI_ARGS (new_type
);
6386 DECL_CONTEXT (r
) = TYPE_CONTEXT (new_type
);
6391 ++processing_template_decl
;
6392 new_decl
= tsubst (decl
, args
, complain
, in_decl
);
6393 --processing_template_decl
;
6394 if (new_decl
== error_mark_node
)
6395 return error_mark_node
;
6397 DECL_TEMPLATE_RESULT (r
) = new_decl
;
6398 DECL_TI_TEMPLATE (new_decl
) = r
;
6399 TREE_TYPE (r
) = TREE_TYPE (new_decl
);
6400 DECL_TI_ARGS (r
) = DECL_TI_ARGS (new_decl
);
6401 DECL_CONTEXT (r
) = DECL_CONTEXT (new_decl
);
6404 SET_DECL_IMPLICIT_INSTANTIATION (r
);
6405 DECL_TEMPLATE_INSTANTIATIONS (r
) = NULL_TREE
;
6406 DECL_TEMPLATE_SPECIALIZATIONS (r
) = NULL_TREE
;
6408 /* The template parameters for this new template are all the
6409 template parameters for the old template, except the
6410 outermost level of parameters. */
6411 DECL_TEMPLATE_PARMS (r
)
6412 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t
), args
,
6415 if (PRIMARY_TEMPLATE_P (t
))
6416 DECL_PRIMARY_TEMPLATE (r
) = r
;
6418 if (TREE_CODE (decl
) != TYPE_DECL
)
6419 /* Record this non-type partial instantiation. */
6420 register_specialization (r
, t
,
6421 DECL_TI_ARGS (DECL_TEMPLATE_RESULT (r
)),
6429 tree argvec
= NULL_TREE
;
6437 /* Nobody should be tsubst'ing into non-template functions. */
6438 gcc_assert (DECL_TEMPLATE_INFO (t
) != NULL_TREE
);
6440 if (TREE_CODE (DECL_TI_TEMPLATE (t
)) == TEMPLATE_DECL
)
6445 /* If T is not dependent, just return it. We have to
6446 increment PROCESSING_TEMPLATE_DECL because
6447 value_dependent_expression_p assumes that nothing is
6448 dependent when PROCESSING_TEMPLATE_DECL is zero. */
6449 ++processing_template_decl
;
6450 dependent_p
= value_dependent_expression_p (t
);
6451 --processing_template_decl
;
6455 /* Calculate the most general template of which R is a
6456 specialization, and the complete set of arguments used to
6458 gen_tmpl
= most_general_template (DECL_TI_TEMPLATE (t
));
6459 argvec
= tsubst_template_args (DECL_TI_ARGS
6460 (DECL_TEMPLATE_RESULT (gen_tmpl
)),
6461 args
, complain
, in_decl
);
6463 /* Check to see if we already have this specialization. */
6464 spec
= retrieve_specialization (gen_tmpl
, argvec
,
6465 /*class_specializations_p=*/false);
6473 /* We can see more levels of arguments than parameters if
6474 there was a specialization of a member template, like
6477 template <class T> struct S { template <class U> void f(); }
6478 template <> template <class U> void S<int>::f(U);
6480 Here, we'll be substituting into the specialization,
6481 because that's where we can find the code we actually
6482 want to generate, but we'll have enough arguments for
6483 the most general template.
6485 We also deal with the peculiar case:
6487 template <class T> struct S {
6488 template <class U> friend void f();
6490 template <class U> void f() {}
6492 template void f<double>();
6494 Here, the ARGS for the instantiation of will be {int,
6495 double}. But, we only need as many ARGS as there are
6496 levels of template parameters in CODE_PATTERN. We are
6497 careful not to get fooled into reducing the ARGS in
6500 template <class T> struct S { template <class U> void f(U); }
6501 template <class T> template <> void S<T>::f(int) {}
6503 which we can spot because the pattern will be a
6504 specialization in this case. */
6505 args_depth
= TMPL_ARGS_DEPTH (args
);
6507 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (t
)));
6508 if (args_depth
> parms_depth
6509 && !DECL_TEMPLATE_SPECIALIZATION (t
))
6510 args
= get_innermost_template_args (args
, parms_depth
);
6514 /* This special case arises when we have something like this:
6516 template <class T> struct S {
6517 friend void f<int>(int, double);
6520 Here, the DECL_TI_TEMPLATE for the friend declaration
6521 will be an IDENTIFIER_NODE. We are being called from
6522 tsubst_friend_function, and we want only to create a
6523 new decl (R) with appropriate types so that we can call
6524 determine_specialization. */
6525 gen_tmpl
= NULL_TREE
;
6528 if (DECL_CLASS_SCOPE_P (t
))
6530 if (DECL_NAME (t
) == constructor_name (DECL_CONTEXT (t
)))
6534 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
,
6535 complain
, t
, /*entering_scope=*/1);
6540 ctx
= DECL_CONTEXT (t
);
6542 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
6543 if (type
== error_mark_node
)
6544 return error_mark_node
;
6546 /* We do NOT check for matching decls pushed separately at this
6547 point, as they may not represent instantiations of this
6548 template, and in any case are considered separate under the
6551 DECL_USE_TEMPLATE (r
) = 0;
6552 TREE_TYPE (r
) = type
;
6553 /* Clear out the mangled name and RTL for the instantiation. */
6554 SET_DECL_ASSEMBLER_NAME (r
, NULL_TREE
);
6555 SET_DECL_RTL (r
, NULL_RTX
);
6556 DECL_INITIAL (r
) = NULL_TREE
;
6557 DECL_CONTEXT (r
) = ctx
;
6559 if (member
&& DECL_CONV_FN_P (r
))
6560 /* Type-conversion operator. Reconstruct the name, in
6561 case it's the name of one of the template's parameters. */
6562 DECL_NAME (r
) = mangle_conv_op_name_for_type (TREE_TYPE (type
));
6564 DECL_ARGUMENTS (r
) = tsubst (DECL_ARGUMENTS (t
), args
,
6566 DECL_RESULT (r
) = NULL_TREE
;
6568 TREE_STATIC (r
) = 0;
6569 TREE_PUBLIC (r
) = TREE_PUBLIC (t
);
6570 DECL_EXTERNAL (r
) = 1;
6571 /* If this is an instantiation of a function with internal
6572 linkage, we already know what object file linkage will be
6573 assigned to the instantiation. */
6574 DECL_INTERFACE_KNOWN (r
) = !TREE_PUBLIC (r
);
6575 DECL_DEFER_OUTPUT (r
) = 0;
6576 TREE_CHAIN (r
) = NULL_TREE
;
6577 DECL_PENDING_INLINE_INFO (r
) = 0;
6578 DECL_PENDING_INLINE_P (r
) = 0;
6579 DECL_SAVED_TREE (r
) = NULL_TREE
;
6581 if (DECL_CLONED_FUNCTION (r
))
6583 DECL_CLONED_FUNCTION (r
) = tsubst (DECL_CLONED_FUNCTION (t
),
6585 TREE_CHAIN (r
) = TREE_CHAIN (DECL_CLONED_FUNCTION (r
));
6586 TREE_CHAIN (DECL_CLONED_FUNCTION (r
)) = r
;
6589 /* Set up the DECL_TEMPLATE_INFO for R. There's no need to do
6590 this in the special friend case mentioned above where
6591 GEN_TMPL is NULL. */
6594 DECL_TEMPLATE_INFO (r
)
6595 = tree_cons (gen_tmpl
, argvec
, NULL_TREE
);
6596 SET_DECL_IMPLICIT_INSTANTIATION (r
);
6597 register_specialization (r
, gen_tmpl
, argvec
, false);
6599 /* We're not supposed to instantiate default arguments
6600 until they are called, for a template. But, for a
6603 template <class T> void f ()
6604 { extern void g(int i = T()); }
6606 we should do the substitution when the template is
6607 instantiated. We handle the member function case in
6608 instantiate_class_template since the default arguments
6609 might refer to other members of the class. */
6611 && !PRIMARY_TEMPLATE_P (gen_tmpl
)
6612 && !uses_template_parms (argvec
))
6613 tsubst_default_arguments (r
);
6616 DECL_TEMPLATE_INFO (r
) = NULL_TREE
;
6618 /* Copy the list of befriending classes. */
6619 for (friends
= &DECL_BEFRIENDING_CLASSES (r
);
6621 friends
= &TREE_CHAIN (*friends
))
6623 *friends
= copy_node (*friends
);
6624 TREE_VALUE (*friends
) = tsubst (TREE_VALUE (*friends
),
6629 if (DECL_CONSTRUCTOR_P (r
) || DECL_DESTRUCTOR_P (r
))
6631 maybe_retrofit_in_chrg (r
);
6632 if (DECL_CONSTRUCTOR_P (r
))
6633 grok_ctor_properties (ctx
, r
);
6634 /* If this is an instantiation of a member template, clone it.
6635 If it isn't, that'll be handled by
6636 clone_constructors_and_destructors. */
6637 if (PRIMARY_TEMPLATE_P (gen_tmpl
))
6638 clone_function_decl (r
, /*update_method_vec_p=*/0);
6640 else if (IDENTIFIER_OPNAME_P (DECL_NAME (r
)))
6641 grok_op_properties (r
, (complain
& tf_error
) != 0);
6643 if (DECL_FRIEND_P (t
) && DECL_FRIEND_CONTEXT (t
))
6644 SET_DECL_FRIEND_CONTEXT (r
,
6645 tsubst (DECL_FRIEND_CONTEXT (t
),
6646 args
, complain
, in_decl
));
6648 /* Possibly limit visibility based on template args. */
6649 DECL_VISIBILITY (r
) = VISIBILITY_DEFAULT
;
6650 if (DECL_VISIBILITY_SPECIFIED (t
))
6652 DECL_VISIBILITY_SPECIFIED (r
) = 0;
6654 = remove_attribute ("visibility", DECL_ATTRIBUTES (r
));
6656 determine_visibility (r
);
6665 if (DECL_TEMPLATE_PARM_P (t
))
6666 SET_DECL_TEMPLATE_PARM_P (r
);
6668 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
6669 type
= type_decays_to (type
);
6670 TREE_TYPE (r
) = type
;
6671 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
6673 if (DECL_INITIAL (r
))
6675 if (TREE_CODE (DECL_INITIAL (r
)) != TEMPLATE_PARM_INDEX
)
6676 DECL_INITIAL (r
) = TREE_TYPE (r
);
6678 DECL_INITIAL (r
) = tsubst (DECL_INITIAL (r
), args
,
6682 DECL_CONTEXT (r
) = NULL_TREE
;
6684 if (!DECL_TEMPLATE_PARM_P (r
))
6685 DECL_ARG_TYPE (r
) = type_passed_as (type
);
6687 TREE_CHAIN (r
) = tsubst (TREE_CHAIN (t
), args
,
6688 complain
, TREE_CHAIN (t
));
6697 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
6698 if (type
== error_mark_node
)
6699 return error_mark_node
;
6700 TREE_TYPE (r
) = type
;
6701 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
6703 /* We don't have to set DECL_CONTEXT here; it is set by
6704 finish_member_declaration. */
6705 DECL_INITIAL (r
) = tsubst_expr (DECL_INITIAL (t
), args
,
6707 TREE_CHAIN (r
) = NULL_TREE
;
6708 if (VOID_TYPE_P (type
))
6709 error ("instantiation of %q+D as type %qT", r
, type
);
6714 /* We reach here only for member using decls. */
6715 if (DECL_DEPENDENT_P (t
))
6717 r
= do_class_using_decl
6718 (tsubst_copy (USING_DECL_SCOPE (t
), args
, complain
, in_decl
),
6719 tsubst_copy (DECL_NAME (t
), args
, complain
, in_decl
));
6721 r
= error_mark_node
;
6726 TREE_CHAIN (r
) = NULL_TREE
;
6733 tree argvec
= NULL_TREE
;
6734 tree gen_tmpl
= NULL_TREE
;
6736 tree tmpl
= NULL_TREE
;
6738 tree type
= NULL_TREE
;
6741 if (TREE_CODE (t
) == TYPE_DECL
)
6743 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
6744 if (TREE_CODE (type
) == TEMPLATE_TEMPLATE_PARM
6745 || t
== TYPE_MAIN_DECL (TREE_TYPE (t
)))
6747 /* If this is the canonical decl, we don't have to
6748 mess with instantiations, and often we can't (for
6749 typename, template type parms and such). Note that
6750 TYPE_NAME is not correct for the above test if
6751 we've copied the type for a typedef. */
6752 r
= TYPE_NAME (type
);
6757 /* Check to see if we already have the specialization we
6760 if (DECL_CLASS_SCOPE_P (t
) || DECL_NAMESPACE_SCOPE_P (t
))
6762 /* T is a static data member or namespace-scope entity.
6763 We have to substitute into namespace-scope variables
6764 (even though such entities are never templates) because
6767 template <class T> void f() { extern T t; }
6769 where the entity referenced is not known until
6770 instantiation time. */
6772 ctx
= DECL_CONTEXT (t
);
6773 if (DECL_CLASS_SCOPE_P (t
))
6775 ctx
= tsubst_aggr_type (ctx
, args
,
6777 in_decl
, /*entering_scope=*/1);
6778 /* If CTX is unchanged, then T is in fact the
6779 specialization we want. That situation occurs when
6780 referencing a static data member within in its own
6781 class. We can use pointer equality, rather than
6782 same_type_p, because DECL_CONTEXT is always
6784 if (ctx
== DECL_CONTEXT (t
))
6790 tmpl
= DECL_TI_TEMPLATE (t
);
6791 gen_tmpl
= most_general_template (tmpl
);
6792 argvec
= tsubst (DECL_TI_ARGS (t
), args
, complain
, in_decl
);
6793 spec
= (retrieve_specialization
6795 /*class_specializations_p=*/false));
6800 /* A local variable. */
6802 /* Subsequent calls to pushdecl will fill this in. */
6804 spec
= retrieve_local_specialization (t
);
6806 /* If we already have the specialization we need, there is
6807 nothing more to do. */
6814 /* Create a new node for the specialization we need. */
6816 if (TREE_CODE (r
) == VAR_DECL
)
6818 /* Even if the original location is out of scope, the
6819 newly substituted one is not. */
6820 DECL_DEAD_FOR_LOCAL (r
) = 0;
6821 DECL_INITIALIZED_P (r
) = 0;
6822 DECL_TEMPLATE_INSTANTIATED (r
) = 0;
6823 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
6824 if (type
== error_mark_node
)
6825 return error_mark_node
;
6826 type
= complete_type (type
);
6827 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (r
)
6828 = DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (t
);
6829 type
= check_var_type (DECL_NAME (r
), type
);
6831 if (DECL_HAS_VALUE_EXPR_P (t
))
6833 tree ve
= DECL_VALUE_EXPR (t
);
6834 ve
= tsubst_expr (ve
, args
, complain
, in_decl
);
6835 SET_DECL_VALUE_EXPR (r
, ve
);
6838 else if (DECL_SELF_REFERENCE_P (t
))
6839 SET_DECL_SELF_REFERENCE_P (r
);
6840 TREE_TYPE (r
) = type
;
6841 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
6842 DECL_CONTEXT (r
) = ctx
;
6843 /* Clear out the mangled name and RTL for the instantiation. */
6844 SET_DECL_ASSEMBLER_NAME (r
, NULL_TREE
);
6845 if (CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_DECL_WRTL
))
6846 SET_DECL_RTL (r
, NULL_RTX
);
6847 /* The initializer must not be expanded until it is required;
6849 DECL_INITIAL (r
) = NULL_TREE
;
6850 if (CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_DECL_WRTL
))
6851 SET_DECL_RTL (r
, NULL_RTX
);
6852 DECL_SIZE (r
) = DECL_SIZE_UNIT (r
) = 0;
6853 if (TREE_CODE (r
) == VAR_DECL
)
6855 /* Possibly limit visibility based on template args. */
6856 DECL_VISIBILITY (r
) = VISIBILITY_DEFAULT
;
6857 if (DECL_VISIBILITY_SPECIFIED (t
))
6859 DECL_VISIBILITY_SPECIFIED (r
) = 0;
6861 = remove_attribute ("visibility", DECL_ATTRIBUTES (r
));
6863 determine_visibility (r
);
6868 /* A static data member declaration is always marked
6869 external when it is declared in-class, even if an
6870 initializer is present. We mimic the non-template
6872 DECL_EXTERNAL (r
) = 1;
6874 register_specialization (r
, gen_tmpl
, argvec
, false);
6875 DECL_TEMPLATE_INFO (r
) = tree_cons (tmpl
, argvec
, NULL_TREE
);
6876 SET_DECL_IMPLICIT_INSTANTIATION (r
);
6879 register_local_specialization (r
, t
);
6881 TREE_CHAIN (r
) = NULL_TREE
;
6890 /* Restore the file and line information. */
6891 input_location
= saved_loc
;
6896 /* Substitute into the ARG_TYPES of a function type. */
6899 tsubst_arg_types (tree arg_types
,
6901 tsubst_flags_t complain
,
6904 tree remaining_arg_types
;
6907 tree result
= NULL_TREE
;
6909 if (!arg_types
|| arg_types
== void_list_node
)
6912 remaining_arg_types
= tsubst_arg_types (TREE_CHAIN (arg_types
),
6913 args
, complain
, in_decl
);
6914 if (remaining_arg_types
== error_mark_node
)
6915 return error_mark_node
;
6917 type
= tsubst (TREE_VALUE (arg_types
), args
, complain
, in_decl
);
6918 if (type
== error_mark_node
)
6919 return error_mark_node
;
6920 if (VOID_TYPE_P (type
))
6922 if (complain
& tf_error
)
6924 error ("invalid parameter type %qT", type
);
6926 error ("in declaration %q+D", in_decl
);
6928 return error_mark_node
;
6931 /* Do array-to-pointer, function-to-pointer conversion, and ignore
6932 top-level qualifiers as required. */
6933 type
= TYPE_MAIN_VARIANT (type_decays_to (type
));
6935 /* We do not substitute into default arguments here. The standard
6936 mandates that they be instantiated only when needed, which is
6937 done in build_over_call. */
6938 default_arg
= TREE_PURPOSE (arg_types
);
6940 if (default_arg
&& TREE_CODE (default_arg
) == DEFAULT_ARG
)
6942 /* We've instantiated a template before its default arguments
6943 have been parsed. This can happen for a nested template
6944 class, and is not an error unless we require the default
6945 argument in a call of this function. */
6946 result
= tree_cons (default_arg
, type
, remaining_arg_types
);
6947 VEC_safe_push (tree
, gc
, DEFARG_INSTANTIATIONS (default_arg
), result
);
6950 result
= hash_tree_cons (default_arg
, type
, remaining_arg_types
);
6955 /* Substitute into a FUNCTION_TYPE or METHOD_TYPE. This routine does
6956 *not* handle the exception-specification for FNTYPE, because the
6957 initial substitution of explicitly provided template parameters
6958 during argument deduction forbids substitution into the
6959 exception-specification:
6963 All references in the function type of the function template to the
6964 corresponding template parameters are replaced by the specified tem-
6965 plate argument values. If a substitution in a template parameter or
6966 in the function type of the function template results in an invalid
6967 type, type deduction fails. [Note: The equivalent substitution in
6968 exception specifications is done only when the function is instanti-
6969 ated, at which point a program is ill-formed if the substitution
6970 results in an invalid type.] */
6973 tsubst_function_type (tree t
,
6975 tsubst_flags_t complain
,
6982 /* The TYPE_CONTEXT is not used for function/method types. */
6983 gcc_assert (TYPE_CONTEXT (t
) == NULL_TREE
);
6985 /* Substitute the return type. */
6986 return_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
6987 if (return_type
== error_mark_node
)
6988 return error_mark_node
;
6989 /* The standard does not presently indicate that creation of a
6990 function type with an invalid return type is a deduction failure.
6991 However, that is clearly analogous to creating an array of "void"
6992 or a reference to a reference. This is core issue #486. */
6993 if (TREE_CODE (return_type
) == ARRAY_TYPE
6994 || TREE_CODE (return_type
) == FUNCTION_TYPE
)
6996 if (complain
& tf_error
)
6998 if (TREE_CODE (return_type
) == ARRAY_TYPE
)
6999 error ("function returning an array");
7001 error ("function returning a function");
7003 return error_mark_node
;
7006 /* Substitute the argument types. */
7007 arg_types
= tsubst_arg_types (TYPE_ARG_TYPES (t
), args
,
7009 if (arg_types
== error_mark_node
)
7010 return error_mark_node
;
7012 /* Construct a new type node and return it. */
7013 if (TREE_CODE (t
) == FUNCTION_TYPE
)
7014 fntype
= build_function_type (return_type
, arg_types
);
7017 tree r
= TREE_TYPE (TREE_VALUE (arg_types
));
7018 if (! IS_AGGR_TYPE (r
))
7022 Type deduction may fail for any of the following
7025 -- Attempting to create "pointer to member of T" when T
7026 is not a class type. */
7027 if (complain
& tf_error
)
7028 error ("creating pointer to member function of non-class type %qT",
7030 return error_mark_node
;
7033 fntype
= build_method_type_directly (r
, return_type
,
7034 TREE_CHAIN (arg_types
));
7036 fntype
= cp_build_qualified_type_real (fntype
, TYPE_QUALS (t
), complain
);
7037 fntype
= cp_build_type_attribute_variant (fntype
, TYPE_ATTRIBUTES (t
));
7042 /* FNTYPE is a FUNCTION_TYPE or METHOD_TYPE. Substitute the template
7043 ARGS into that specification, and return the substituted
7044 specification. If there is no specification, return NULL_TREE. */
7047 tsubst_exception_specification (tree fntype
,
7049 tsubst_flags_t complain
,
7055 specs
= TYPE_RAISES_EXCEPTIONS (fntype
);
7056 new_specs
= NULL_TREE
;
7059 if (! TREE_VALUE (specs
))
7065 spec
= tsubst (TREE_VALUE (specs
), args
, complain
, in_decl
);
7066 if (spec
== error_mark_node
)
7068 new_specs
= add_exception_specifier (new_specs
, spec
, complain
);
7069 specs
= TREE_CHAIN (specs
);
7075 /* Take the tree structure T and replace template parameters used
7076 therein with the argument vector ARGS. IN_DECL is an associated
7077 decl for diagnostics. If an error occurs, returns ERROR_MARK_NODE.
7078 Issue error and warning messages under control of COMPLAIN. Note
7079 that we must be relatively non-tolerant of extensions here, in
7080 order to preserve conformance; if we allow substitutions that
7081 should not be allowed, we may allow argument deductions that should
7082 not succeed, and therefore report ambiguous overload situations
7083 where there are none. In theory, we could allow the substitution,
7084 but indicate that it should have failed, and allow our caller to
7085 make sure that the right thing happens, but we don't try to do this
7088 This function is used for dealing with types, decls and the like;
7089 for expressions, use tsubst_expr or tsubst_copy. */
7092 tsubst (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
7096 if (t
== NULL_TREE
|| t
== error_mark_node
7097 || t
== integer_type_node
7098 || t
== void_type_node
7099 || t
== char_type_node
7100 || t
== unknown_type_node
7101 || TREE_CODE (t
) == NAMESPACE_DECL
)
7105 return tsubst_decl (t
, args
, complain
);
7107 if (TREE_CODE (t
) == IDENTIFIER_NODE
)
7108 type
= IDENTIFIER_TYPE_VALUE (t
);
7110 type
= TREE_TYPE (t
);
7112 gcc_assert (type
!= unknown_type_node
);
7115 && TREE_CODE (t
) != TYPENAME_TYPE
7116 && TREE_CODE (t
) != IDENTIFIER_NODE
7117 && TREE_CODE (t
) != FUNCTION_TYPE
7118 && TREE_CODE (t
) != METHOD_TYPE
)
7119 type
= tsubst (type
, args
, complain
, in_decl
);
7120 if (type
== error_mark_node
)
7121 return error_mark_node
;
7123 switch (TREE_CODE (t
))
7128 return tsubst_aggr_type (t
, args
, complain
, in_decl
,
7129 /*entering_scope=*/0);
7132 case IDENTIFIER_NODE
:
7144 if (t
== integer_type_node
)
7147 if (TREE_CODE (TYPE_MIN_VALUE (t
)) == INTEGER_CST
7148 && TREE_CODE (TYPE_MAX_VALUE (t
)) == INTEGER_CST
)
7152 tree max
, omax
= TREE_OPERAND (TYPE_MAX_VALUE (t
), 0);
7154 /* The array dimension behaves like a non-type template arg,
7155 in that we want to fold it as much as possible. */
7156 max
= tsubst_template_arg (omax
, args
, complain
, in_decl
);
7157 max
= fold_decl_constant_value (max
);
7161 Type deduction may fail for any of the following
7164 Attempting to create an array with a size that is
7165 zero or negative. */
7166 if (integer_zerop (max
) && !(complain
& tf_error
))
7167 /* We must fail if performing argument deduction (as
7168 indicated by the state of complain), so that
7169 another substitution can be found. */
7170 return error_mark_node
;
7172 else if (TREE_CODE (max
) == INTEGER_CST
7173 && INT_CST_LT (max
, integer_zero_node
))
7175 if (complain
& tf_error
)
7176 error ("creating array with negative size (%qE)", max
);
7178 return error_mark_node
;
7181 return compute_array_index_type (NULL_TREE
, max
);
7184 case TEMPLATE_TYPE_PARM
:
7185 case TEMPLATE_TEMPLATE_PARM
:
7186 case BOUND_TEMPLATE_TEMPLATE_PARM
:
7187 case TEMPLATE_PARM_INDEX
:
7192 tree arg
= NULL_TREE
;
7196 gcc_assert (TREE_VEC_LENGTH (args
) > 0);
7197 if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
7198 || TREE_CODE (t
) == TEMPLATE_TEMPLATE_PARM
7199 || TREE_CODE (t
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
7201 idx
= TEMPLATE_TYPE_IDX (t
);
7202 level
= TEMPLATE_TYPE_LEVEL (t
);
7206 idx
= TEMPLATE_PARM_IDX (t
);
7207 level
= TEMPLATE_PARM_LEVEL (t
);
7210 levels
= TMPL_ARGS_DEPTH (args
);
7211 if (level
<= levels
)
7212 arg
= TMPL_ARG (args
, level
, idx
);
7214 if (arg
== error_mark_node
)
7215 return error_mark_node
;
7216 else if (arg
!= NULL_TREE
)
7218 if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
7220 gcc_assert (TYPE_P (arg
));
7221 return cp_build_qualified_type_real
7222 (arg
, cp_type_quals (arg
) | cp_type_quals (t
),
7223 complain
| tf_ignore_bad_quals
);
7225 else if (TREE_CODE (t
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
7227 /* We are processing a type constructed from a
7228 template template parameter. */
7229 tree argvec
= tsubst (TYPE_TI_ARGS (t
),
7230 args
, complain
, in_decl
);
7231 if (argvec
== error_mark_node
)
7232 return error_mark_node
;
7234 /* We can get a TEMPLATE_TEMPLATE_PARM here when we
7235 are resolving nested-types in the signature of a
7236 member function templates. Otherwise ARG is a
7237 TEMPLATE_DECL and is the real template to be
7239 if (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
7240 arg
= TYPE_NAME (arg
);
7242 r
= lookup_template_class (arg
,
7245 /*entering_scope=*/0,
7247 return cp_build_qualified_type_real
7248 (r
, TYPE_QUALS (t
), complain
);
7251 /* TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX. */
7256 /* This can happen during the attempted tsubst'ing in
7257 unify. This means that we don't yet have any information
7258 about the template parameter in question. */
7261 /* If we get here, we must have been looking at a parm for a
7262 more deeply nested template. Make a new version of this
7263 template parameter, but with a lower level. */
7264 switch (TREE_CODE (t
))
7266 case TEMPLATE_TYPE_PARM
:
7267 case TEMPLATE_TEMPLATE_PARM
:
7268 case BOUND_TEMPLATE_TEMPLATE_PARM
:
7269 if (cp_type_quals (t
))
7271 r
= tsubst (TYPE_MAIN_VARIANT (t
), args
, complain
, in_decl
);
7272 r
= cp_build_qualified_type_real
7273 (r
, cp_type_quals (t
),
7274 complain
| (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
7275 ? tf_ignore_bad_quals
: 0));
7280 TEMPLATE_TYPE_PARM_INDEX (r
)
7281 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (t
),
7283 TYPE_STUB_DECL (r
) = TYPE_NAME (r
) = TEMPLATE_TYPE_DECL (r
);
7284 TYPE_MAIN_VARIANT (r
) = r
;
7285 TYPE_POINTER_TO (r
) = NULL_TREE
;
7286 TYPE_REFERENCE_TO (r
) = NULL_TREE
;
7288 if (TREE_CODE (t
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
7290 tree argvec
= tsubst (TYPE_TI_ARGS (t
), args
,
7292 if (argvec
== error_mark_node
)
7293 return error_mark_node
;
7295 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (r
)
7296 = tree_cons (TYPE_TI_TEMPLATE (t
), argvec
, NULL_TREE
);
7301 case TEMPLATE_PARM_INDEX
:
7302 r
= reduce_template_parm_level (t
, type
, levels
);
7314 tree purpose
, value
, chain
;
7316 if (t
== void_list_node
)
7319 purpose
= TREE_PURPOSE (t
);
7322 purpose
= tsubst (purpose
, args
, complain
, in_decl
);
7323 if (purpose
== error_mark_node
)
7324 return error_mark_node
;
7326 value
= TREE_VALUE (t
);
7329 value
= tsubst (value
, args
, complain
, in_decl
);
7330 if (value
== error_mark_node
)
7331 return error_mark_node
;
7333 chain
= TREE_CHAIN (t
);
7334 if (chain
&& chain
!= void_type_node
)
7336 chain
= tsubst (chain
, args
, complain
, in_decl
);
7337 if (chain
== error_mark_node
)
7338 return error_mark_node
;
7340 if (purpose
== TREE_PURPOSE (t
)
7341 && value
== TREE_VALUE (t
)
7342 && chain
== TREE_CHAIN (t
))
7344 return hash_tree_cons (purpose
, value
, chain
);
7348 /* We should never be tsubsting a binfo. */
7352 /* A vector of template arguments. */
7354 return tsubst_template_args (t
, args
, complain
, in_decl
);
7357 case REFERENCE_TYPE
:
7359 enum tree_code code
;
7361 if (type
== TREE_TYPE (t
) && TREE_CODE (type
) != METHOD_TYPE
)
7364 code
= TREE_CODE (t
);
7369 Type deduction may fail for any of the following
7372 -- Attempting to create a pointer to reference type.
7373 -- Attempting to create a reference to a reference type or
7374 a reference to void. */
7375 if (TREE_CODE (type
) == REFERENCE_TYPE
7376 || (code
== REFERENCE_TYPE
&& TREE_CODE (type
) == VOID_TYPE
))
7378 static location_t last_loc
;
7380 /* We keep track of the last time we issued this error
7381 message to avoid spewing a ton of messages during a
7382 single bad template instantiation. */
7383 if (complain
& tf_error
7384 #ifdef USE_MAPPED_LOCATION
7385 && last_loc
!= input_location
7387 && (last_loc
.line
!= input_line
7388 || last_loc
.file
!= input_filename
)
7392 if (TREE_CODE (type
) == VOID_TYPE
)
7393 error ("forming reference to void");
7395 error ("forming %s to reference type %qT",
7396 (code
== POINTER_TYPE
) ? "pointer" : "reference",
7398 last_loc
= input_location
;
7401 return error_mark_node
;
7403 else if (code
== POINTER_TYPE
)
7405 r
= build_pointer_type (type
);
7406 if (TREE_CODE (type
) == METHOD_TYPE
)
7407 r
= build_ptrmemfunc_type (r
);
7410 r
= build_reference_type (type
);
7411 r
= cp_build_qualified_type_real (r
, TYPE_QUALS (t
), complain
);
7413 if (r
!= error_mark_node
)
7414 /* Will this ever be needed for TYPE_..._TO values? */
7421 r
= tsubst (TYPE_OFFSET_BASETYPE (t
), args
, complain
, in_decl
);
7422 if (r
== error_mark_node
|| !IS_AGGR_TYPE (r
))
7426 Type deduction may fail for any of the following
7429 -- Attempting to create "pointer to member of T" when T
7430 is not a class type. */
7431 if (complain
& tf_error
)
7432 error ("creating pointer to member of non-class type %qT", r
);
7433 return error_mark_node
;
7435 if (TREE_CODE (type
) == REFERENCE_TYPE
)
7437 if (complain
& tf_error
)
7438 error ("creating pointer to member reference type %qT", type
);
7439 return error_mark_node
;
7441 if (TREE_CODE (type
) == VOID_TYPE
)
7443 if (complain
& tf_error
)
7444 error ("creating pointer to member of type void");
7445 return error_mark_node
;
7447 gcc_assert (TREE_CODE (type
) != METHOD_TYPE
);
7448 if (TREE_CODE (type
) == FUNCTION_TYPE
)
7450 /* The type of the implicit object parameter gets its
7451 cv-qualifiers from the FUNCTION_TYPE. */
7453 tree this_type
= cp_build_qualified_type (TYPE_MAIN_VARIANT (r
),
7454 cp_type_quals (type
));
7456 method_type
= build_method_type_directly (this_type
,
7458 TYPE_ARG_TYPES (type
));
7459 memptr
= build_ptrmemfunc_type (build_pointer_type (method_type
));
7460 return cp_build_qualified_type_real (memptr
, cp_type_quals (t
),
7464 return cp_build_qualified_type_real (build_ptrmem_type (r
, type
),
7473 fntype
= tsubst_function_type (t
, args
, complain
, in_decl
);
7474 if (fntype
== error_mark_node
)
7475 return error_mark_node
;
7477 /* Substitute the exception specification. */
7478 specs
= tsubst_exception_specification (t
, args
, complain
,
7480 if (specs
== error_mark_node
)
7481 return error_mark_node
;
7483 fntype
= build_exception_variant (fntype
, specs
);
7488 tree domain
= tsubst (TYPE_DOMAIN (t
), args
, complain
, in_decl
);
7489 if (domain
== error_mark_node
)
7490 return error_mark_node
;
7492 /* As an optimization, we avoid regenerating the array type if
7493 it will obviously be the same as T. */
7494 if (type
== TREE_TYPE (t
) && domain
== TYPE_DOMAIN (t
))
7497 /* These checks should match the ones in grokdeclarator.
7501 The deduction may fail for any of the following reasons:
7503 -- Attempting to create an array with an element type that
7504 is void, a function type, or a reference type, or [DR337]
7505 an abstract class type. */
7506 if (TREE_CODE (type
) == VOID_TYPE
7507 || TREE_CODE (type
) == FUNCTION_TYPE
7508 || TREE_CODE (type
) == REFERENCE_TYPE
)
7510 if (complain
& tf_error
)
7511 error ("creating array of %qT", type
);
7512 return error_mark_node
;
7514 if (CLASS_TYPE_P (type
) && CLASSTYPE_PURE_VIRTUALS (type
))
7516 if (complain
& tf_error
)
7517 error ("creating array of %qT, which is an abstract class type",
7519 return error_mark_node
;
7522 r
= build_cplus_array_type (type
, domain
);
7529 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
7530 tree e2
= tsubst (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
7532 if (e1
== error_mark_node
|| e2
== error_mark_node
)
7533 return error_mark_node
;
7535 return fold_build2 (TREE_CODE (t
), TREE_TYPE (t
), e1
, e2
);
7541 tree e
= tsubst (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
7542 if (e
== error_mark_node
)
7543 return error_mark_node
;
7545 return fold_build1 (TREE_CODE (t
), TREE_TYPE (t
), e
);
7550 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
7551 in_decl
, /*entering_scope=*/1);
7552 tree f
= tsubst_copy (TYPENAME_TYPE_FULLNAME (t
), args
,
7555 if (ctx
== error_mark_node
|| f
== error_mark_node
)
7556 return error_mark_node
;
7558 if (!IS_AGGR_TYPE (ctx
))
7560 if (complain
& tf_error
)
7561 error ("%qT is not a class, struct, or union type", ctx
);
7562 return error_mark_node
;
7564 else if (!uses_template_parms (ctx
) && !TYPE_BEING_DEFINED (ctx
))
7566 /* Normally, make_typename_type does not require that the CTX
7567 have complete type in order to allow things like:
7569 template <class T> struct S { typename S<T>::X Y; };
7571 But, such constructs have already been resolved by this
7572 point, so here CTX really should have complete type, unless
7573 it's a partial instantiation. */
7574 ctx
= complete_type (ctx
);
7575 if (!COMPLETE_TYPE_P (ctx
))
7577 if (complain
& tf_error
)
7578 cxx_incomplete_type_error (NULL_TREE
, ctx
);
7579 return error_mark_node
;
7583 f
= make_typename_type (ctx
, f
, typename_type
,
7584 (complain
& tf_error
) | tf_keep_type_decl
);
7585 if (f
== error_mark_node
)
7587 if (TREE_CODE (f
) == TYPE_DECL
)
7589 complain
|= tf_ignore_bad_quals
;
7593 if (TREE_CODE (f
) != TYPENAME_TYPE
)
7595 if (TYPENAME_IS_ENUM_P (t
) && TREE_CODE (f
) != ENUMERAL_TYPE
)
7596 error ("%qT resolves to %qT, which is not an enumeration type",
7598 else if (TYPENAME_IS_CLASS_P (t
) && !CLASS_TYPE_P (f
))
7599 error ("%qT resolves to %qT, which is is not a class type",
7603 return cp_build_qualified_type_real
7604 (f
, cp_type_quals (f
) | cp_type_quals (t
), complain
);
7607 case UNBOUND_CLASS_TEMPLATE
:
7609 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
7610 in_decl
, /*entering_scope=*/1);
7611 tree name
= TYPE_IDENTIFIER (t
);
7612 tree parm_list
= DECL_TEMPLATE_PARMS (TYPE_NAME (t
));
7614 if (ctx
== error_mark_node
|| name
== error_mark_node
)
7615 return error_mark_node
;
7618 parm_list
= tsubst_template_parms (parm_list
, args
, complain
);
7619 return make_unbound_class_template (ctx
, name
, parm_list
, complain
);
7629 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
7630 tree e2
= tsubst_expr (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
7631 if (e1
== error_mark_node
|| e2
== error_mark_node
)
7632 return error_mark_node
;
7634 return build_nt (ARRAY_REF
, e1
, e2
, NULL_TREE
, NULL_TREE
);
7639 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
7640 tree e2
= tsubst (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
7641 if (e1
== error_mark_node
|| e2
== error_mark_node
)
7642 return error_mark_node
;
7644 return build_qualified_name (/*type=*/NULL_TREE
,
7645 e1
, e2
, QUALIFIED_NAME_IS_TEMPLATE (t
));
7652 type
= finish_typeof (tsubst_expr (TYPEOF_TYPE_EXPR (t
), args
,
7653 complain
, in_decl
));
7654 return cp_build_qualified_type_real (type
,
7656 | cp_type_quals (type
),
7661 sorry ("use of %qs in template",
7662 tree_code_name
[(int) TREE_CODE (t
)]);
7663 return error_mark_node
;
7667 /* Like tsubst_expr for a BASELINK. OBJECT_TYPE, if non-NULL, is the
7668 type of the expression on the left-hand side of the "." or "->"
7672 tsubst_baselink (tree baselink
, tree object_type
,
7673 tree args
, tsubst_flags_t complain
, tree in_decl
)
7676 tree qualifying_scope
;
7678 tree template_args
= 0;
7679 bool template_id_p
= false;
7681 /* A baselink indicates a function from a base class. The
7682 BASELINK_ACCESS_BINFO and BASELINK_BINFO are going to have
7683 non-dependent types; otherwise, the lookup could not have
7684 succeeded. However, they may indicate bases of the template
7685 class, rather than the instantiated class.
7687 In addition, lookups that were not ambiguous before may be
7688 ambiguous now. Therefore, we perform the lookup again. */
7689 qualifying_scope
= BINFO_TYPE (BASELINK_ACCESS_BINFO (baselink
));
7690 fns
= BASELINK_FUNCTIONS (baselink
);
7691 if (TREE_CODE (fns
) == TEMPLATE_ID_EXPR
)
7693 template_id_p
= true;
7694 template_args
= TREE_OPERAND (fns
, 1);
7695 fns
= TREE_OPERAND (fns
, 0);
7697 template_args
= tsubst_template_args (template_args
, args
,
7700 name
= DECL_NAME (get_first_fn (fns
));
7701 baselink
= lookup_fnfields (qualifying_scope
, name
, /*protect=*/1);
7703 /* If lookup found a single function, mark it as used at this
7704 point. (If it lookup found multiple functions the one selected
7705 later by overload resolution will be marked as used at that
7707 if (BASELINK_P (baselink
))
7708 fns
= BASELINK_FUNCTIONS (baselink
);
7709 if (!template_id_p
&& !really_overloaded_fn (fns
))
7710 mark_used (OVL_CURRENT (fns
));
7712 /* Add back the template arguments, if present. */
7713 if (BASELINK_P (baselink
) && template_id_p
)
7714 BASELINK_FUNCTIONS (baselink
)
7715 = build_nt (TEMPLATE_ID_EXPR
,
7716 BASELINK_FUNCTIONS (baselink
),
7720 object_type
= current_class_type
;
7721 return adjust_result_of_qualified_name_lookup (baselink
,
7726 /* Like tsubst_expr for a SCOPE_REF, given by QUALIFIED_ID. DONE is
7727 true if the qualified-id will be a postfix-expression in-and-of
7728 itself; false if more of the postfix-expression follows the
7729 QUALIFIED_ID. ADDRESS_P is true if the qualified-id is the operand
7733 tsubst_qualified_id (tree qualified_id
, tree args
,
7734 tsubst_flags_t complain
, tree in_decl
,
7735 bool done
, bool address_p
)
7743 gcc_assert (TREE_CODE (qualified_id
) == SCOPE_REF
);
7745 /* Figure out what name to look up. */
7746 name
= TREE_OPERAND (qualified_id
, 1);
7747 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
7750 template_args
= TREE_OPERAND (name
, 1);
7752 template_args
= tsubst_template_args (template_args
, args
,
7754 name
= TREE_OPERAND (name
, 0);
7758 is_template
= false;
7759 template_args
= NULL_TREE
;
7762 /* Substitute into the qualifying scope. When there are no ARGS, we
7763 are just trying to simplify a non-dependent expression. In that
7764 case the qualifying scope may be dependent, and, in any case,
7765 substituting will not help. */
7766 scope
= TREE_OPERAND (qualified_id
, 0);
7769 scope
= tsubst (scope
, args
, complain
, in_decl
);
7770 expr
= tsubst_copy (name
, args
, complain
, in_decl
);
7775 if (dependent_type_p (scope
))
7776 return build_qualified_name (/*type=*/NULL_TREE
,
7778 QUALIFIED_NAME_IS_TEMPLATE (qualified_id
));
7780 if (!BASELINK_P (name
) && !DECL_P (expr
))
7782 if (TREE_CODE (expr
) == BIT_NOT_EXPR
)
7783 /* If this were actually a destructor call, it would have been
7784 parsed as such by the parser. */
7785 expr
= error_mark_node
;
7787 expr
= lookup_qualified_name (scope
, expr
, /*is_type_p=*/0, false);
7788 if (TREE_CODE (TREE_CODE (expr
) == TEMPLATE_DECL
7789 ? DECL_TEMPLATE_RESULT (expr
) : expr
) == TYPE_DECL
)
7791 if (complain
& tf_error
)
7793 error ("dependent-name %qE is parsed as a non-type, but "
7794 "instantiation yields a type", qualified_id
);
7795 inform ("say %<typename %E%> if a type is meant", qualified_id
);
7797 return error_mark_node
;
7803 check_accessibility_of_qualified_id (expr
, /*object_type=*/NULL_TREE
,
7805 /* Remember that there was a reference to this entity. */
7809 if (expr
== error_mark_node
|| TREE_CODE (expr
) == TREE_LIST
)
7811 if (complain
& tf_error
)
7812 qualified_name_lookup_error (scope
,
7813 TREE_OPERAND (qualified_id
, 1),
7815 return error_mark_node
;
7819 expr
= lookup_template_function (expr
, template_args
);
7821 if (expr
== error_mark_node
&& complain
& tf_error
)
7822 qualified_name_lookup_error (scope
, TREE_OPERAND (qualified_id
, 1),
7824 else if (TYPE_P (scope
))
7826 expr
= (adjust_result_of_qualified_name_lookup
7827 (expr
, scope
, current_class_type
));
7828 expr
= (finish_qualified_id_expr
7829 (scope
, expr
, done
, address_p
,
7830 QUALIFIED_NAME_IS_TEMPLATE (qualified_id
),
7831 /*template_arg_p=*/false));
7834 if (TREE_CODE (expr
) != SCOPE_REF
)
7835 expr
= convert_from_reference (expr
);
7840 /* Like tsubst, but deals with expressions. This function just replaces
7841 template parms; to finish processing the resultant expression, use
7845 tsubst_copy (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
7847 enum tree_code code
;
7850 if (t
== NULL_TREE
|| t
== error_mark_node
)
7853 code
= TREE_CODE (t
);
7858 r
= retrieve_local_specialization (t
);
7859 gcc_assert (r
!= NULL
);
7868 if (DECL_TEMPLATE_PARM_P (t
))
7869 return tsubst_copy (DECL_INITIAL (t
), args
, complain
, in_decl
);
7870 /* There is no need to substitute into namespace-scope
7872 if (DECL_NAMESPACE_SCOPE_P (t
))
7874 /* If ARGS is NULL, then T is known to be non-dependent. */
7875 if (args
== NULL_TREE
)
7876 return integral_constant_value (t
);
7878 /* Unfortunately, we cannot just call lookup_name here.
7881 template <int I> int f() {
7883 struct S { void g() { E e = a; } };
7886 When we instantiate f<7>::S::g(), say, lookup_name is not
7887 clever enough to find f<7>::a. */
7889 = tsubst_aggr_type (TREE_TYPE (t
), args
, complain
, in_decl
,
7890 /*entering_scope=*/0);
7892 for (v
= TYPE_VALUES (enum_type
);
7895 if (TREE_PURPOSE (v
) == DECL_NAME (t
))
7896 return TREE_VALUE (v
);
7898 /* We didn't find the name. That should never happen; if
7899 name-lookup found it during preliminary parsing, we
7900 should find it again here during instantiation. */
7906 if (DECL_CONTEXT (t
))
7910 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
7911 /*entering_scope=*/1);
7912 if (ctx
!= DECL_CONTEXT (t
))
7914 tree r
= lookup_field (ctx
, DECL_NAME (t
), 0, false);
7917 if (complain
& tf_error
)
7918 error ("using invalid field %qD", t
);
7919 return error_mark_node
;
7929 if ((DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
))
7930 || local_variable_p (t
))
7931 t
= tsubst (t
, args
, complain
, in_decl
);
7936 return tsubst_baselink (t
, current_class_type
, args
, complain
, in_decl
);
7939 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
7940 return tsubst (TREE_TYPE (DECL_TEMPLATE_RESULT (t
)),
7941 args
, complain
, in_decl
);
7942 else if (DECL_FUNCTION_TEMPLATE_P (t
) && DECL_MEMBER_TEMPLATE_P (t
))
7943 return tsubst (t
, args
, complain
, in_decl
);
7944 else if (DECL_CLASS_SCOPE_P (t
)
7945 && uses_template_parms (DECL_CONTEXT (t
)))
7947 /* Template template argument like the following example need
7950 template <template <class> class TT> struct C {};
7951 template <class T> struct D {
7952 template <class U> struct E {};
7957 We are processing the template argument `E' in #1 for
7958 the template instantiation #2. Originally, `E' is a
7959 TEMPLATE_DECL with `D<T>' as its DECL_CONTEXT. Now we
7960 have to substitute this with one having context `D<int>'. */
7962 tree context
= tsubst (DECL_CONTEXT (t
), args
, complain
, in_decl
);
7963 return lookup_field (context
, DECL_NAME(t
), 0, false);
7966 /* Ordinary template template argument. */
7970 case REINTERPRET_CAST_EXPR
:
7971 case CONST_CAST_EXPR
:
7972 case STATIC_CAST_EXPR
:
7973 case DYNAMIC_CAST_EXPR
:
7976 (code
, tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
7977 tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
));
7981 case TRUTH_NOT_EXPR
:
7984 case UNARY_PLUS_EXPR
: /* Unary + */
7993 (code
, tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
7994 tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
));
8001 object
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
8002 name
= TREE_OPERAND (t
, 1);
8003 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
8005 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
8007 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
8009 else if (TREE_CODE (name
) == SCOPE_REF
8010 && TREE_CODE (TREE_OPERAND (name
, 1)) == BIT_NOT_EXPR
)
8012 tree base
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
8014 name
= TREE_OPERAND (name
, 1);
8015 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
8017 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
8018 name
= build_qualified_name (/*type=*/NULL_TREE
,
8020 /*template_p=*/false);
8022 else if (TREE_CODE (name
) == BASELINK
)
8023 name
= tsubst_baselink (name
,
8024 non_reference (TREE_TYPE (object
)),
8028 name
= tsubst_copy (name
, args
, complain
, in_decl
);
8029 return build_nt (COMPONENT_REF
, object
, name
, NULL_TREE
);
8035 case TRUNC_DIV_EXPR
:
8037 case FLOOR_DIV_EXPR
:
8038 case ROUND_DIV_EXPR
:
8039 case EXACT_DIV_EXPR
:
8043 case TRUNC_MOD_EXPR
:
8044 case FLOOR_MOD_EXPR
:
8045 case TRUTH_ANDIF_EXPR
:
8046 case TRUTH_ORIF_EXPR
:
8047 case TRUTH_AND_EXPR
:
8064 case PREDECREMENT_EXPR
:
8065 case PREINCREMENT_EXPR
:
8066 case POSTDECREMENT_EXPR
:
8067 case POSTINCREMENT_EXPR
:
8069 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
8070 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
));
8073 return build_qualified_name (/*type=*/NULL_TREE
,
8074 tsubst_copy (TREE_OPERAND (t
, 0),
8075 args
, complain
, in_decl
),
8076 tsubst_copy (TREE_OPERAND (t
, 1),
8077 args
, complain
, in_decl
),
8078 QUALIFIED_NAME_IS_TEMPLATE (t
));
8083 tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
8084 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
),
8085 NULL_TREE
, NULL_TREE
);
8088 return build_nt (code
,
8089 tsubst_copy (TREE_OPERAND (t
, 0), args
,
8091 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
,
8097 case PSEUDO_DTOR_EXPR
:
8100 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
8101 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
),
8102 tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
));
8103 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
8110 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
8111 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
),
8112 tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
));
8113 NEW_EXPR_USE_GLOBAL (r
) = NEW_EXPR_USE_GLOBAL (t
);
8120 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
8121 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
));
8122 DELETE_EXPR_USE_GLOBAL (r
) = DELETE_EXPR_USE_GLOBAL (t
);
8123 DELETE_EXPR_USE_VEC (r
) = DELETE_EXPR_USE_VEC (t
);
8127 case TEMPLATE_ID_EXPR
:
8129 /* Substituted template arguments */
8130 tree fn
= TREE_OPERAND (t
, 0);
8131 tree targs
= TREE_OPERAND (t
, 1);
8133 fn
= tsubst_copy (fn
, args
, complain
, in_decl
);
8135 targs
= tsubst_template_args (targs
, args
, complain
, in_decl
);
8137 return lookup_template_function (fn
, targs
);
8142 tree purpose
, value
, chain
;
8144 if (t
== void_list_node
)
8147 purpose
= TREE_PURPOSE (t
);
8149 purpose
= tsubst_copy (purpose
, args
, complain
, in_decl
);
8150 value
= TREE_VALUE (t
);
8152 value
= tsubst_copy (value
, args
, complain
, in_decl
);
8153 chain
= TREE_CHAIN (t
);
8154 if (chain
&& chain
!= void_type_node
)
8155 chain
= tsubst_copy (chain
, args
, complain
, in_decl
);
8156 if (purpose
== TREE_PURPOSE (t
)
8157 && value
== TREE_VALUE (t
)
8158 && chain
== TREE_CHAIN (t
))
8160 return tree_cons (purpose
, value
, chain
);
8167 case TEMPLATE_TYPE_PARM
:
8168 case TEMPLATE_TEMPLATE_PARM
:
8169 case BOUND_TEMPLATE_TEMPLATE_PARM
:
8170 case TEMPLATE_PARM_INDEX
:
8172 case REFERENCE_TYPE
:
8178 case UNBOUND_CLASS_TEMPLATE
:
8181 return tsubst (t
, args
, complain
, in_decl
);
8183 case IDENTIFIER_NODE
:
8184 if (IDENTIFIER_TYPENAME_P (t
))
8186 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
8187 return mangle_conv_op_name_for_type (new_type
);
8193 /* This is handled by tsubst_copy_and_build. */
8197 return build_x_va_arg (tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
,
8199 tsubst (TREE_TYPE (t
), args
, complain
, in_decl
));
8201 case CLEANUP_POINT_EXPR
:
8202 /* We shouldn't have built any of these during initial template
8203 generation. Instead, they should be built during instantiation
8204 in response to the saved STMT_IS_FULL_EXPR_P setting. */
8208 mark_used (TREE_OPERAND (t
, 1));
8216 /* Like tsubst_copy, but specifically for OpenMP clauses. */
8219 tsubst_omp_clauses (tree clauses
, tree args
, tsubst_flags_t complain
,
8222 tree new_clauses
= NULL
, nc
, oc
;
8224 for (oc
= clauses
; oc
; oc
= OMP_CLAUSE_CHAIN (oc
))
8226 nc
= copy_node (oc
);
8227 OMP_CLAUSE_CHAIN (nc
) = new_clauses
;
8230 switch (OMP_CLAUSE_CODE (nc
))
8232 case OMP_CLAUSE_PRIVATE
:
8233 case OMP_CLAUSE_SHARED
:
8234 case OMP_CLAUSE_FIRSTPRIVATE
:
8235 case OMP_CLAUSE_LASTPRIVATE
:
8236 case OMP_CLAUSE_REDUCTION
:
8237 case OMP_CLAUSE_COPYIN
:
8238 case OMP_CLAUSE_COPYPRIVATE
:
8240 case OMP_CLAUSE_NUM_THREADS
:
8241 case OMP_CLAUSE_SCHEDULE
:
8242 OMP_CLAUSE_OPERAND (nc
, 0)
8243 = tsubst_expr (OMP_CLAUSE_OPERAND (oc
, 0), args
, complain
, in_decl
);
8245 case OMP_CLAUSE_NOWAIT
:
8246 case OMP_CLAUSE_ORDERED
:
8247 case OMP_CLAUSE_DEFAULT
:
8254 return finish_omp_clauses (nreverse (new_clauses
));
8257 /* Like tsubst_copy_and_build, but unshare TREE_LIST nodes. */
8260 tsubst_copy_asm_operands (tree t
, tree args
, tsubst_flags_t complain
,
8263 #define RECUR(t) tsubst_copy_asm_operands (t, args, complain, in_decl)
8265 tree purpose
, value
, chain
;
8270 if (TREE_CODE (t
) != TREE_LIST
)
8271 return tsubst_copy_and_build (t
, args
, complain
, in_decl
,
8272 /*function_p=*/false);
8274 if (t
== void_list_node
)
8277 purpose
= TREE_PURPOSE (t
);
8279 purpose
= RECUR (purpose
);
8280 value
= TREE_VALUE (t
);
8282 value
= RECUR (value
);
8283 chain
= TREE_CHAIN (t
);
8284 if (chain
&& chain
!= void_type_node
)
8285 chain
= RECUR (chain
);
8286 return tree_cons (purpose
, value
, chain
);
8290 /* Like tsubst_copy for expressions, etc. but also does semantic
8294 tsubst_expr (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
8298 if (t
== NULL_TREE
|| t
== error_mark_node
)
8301 if (EXPR_HAS_LOCATION (t
))
8302 input_location
= EXPR_LOCATION (t
);
8303 if (STATEMENT_CODE_P (TREE_CODE (t
)))
8304 current_stmt_tree ()->stmts_are_full_exprs_p
= STMT_IS_FULL_EXPR_P (t
);
8306 switch (TREE_CODE (t
))
8308 case STATEMENT_LIST
:
8310 tree_stmt_iterator i
;
8311 for (i
= tsi_start (t
); !tsi_end_p (i
); tsi_next (&i
))
8312 tsubst_expr (tsi_stmt (i
), args
, complain
, in_decl
);
8316 case CTOR_INITIALIZER
:
8317 finish_mem_initializers (tsubst_initializer_list
8318 (TREE_OPERAND (t
, 0), args
));
8322 finish_return_stmt (tsubst_expr (TREE_OPERAND (t
, 0),
8323 args
, complain
, in_decl
));
8327 tmp
= tsubst_expr (EXPR_STMT_EXPR (t
), args
, complain
, in_decl
);
8328 if (EXPR_STMT_STMT_EXPR_RESULT (t
))
8329 finish_stmt_expr_expr (tmp
, cur_stmt_expr
);
8331 finish_expr_stmt (tmp
);
8335 do_using_directive (tsubst_expr (USING_STMT_NAMESPACE (t
),
8336 args
, complain
, in_decl
));
8344 decl
= DECL_EXPR_DECL (t
);
8345 if (TREE_CODE (decl
) == LABEL_DECL
)
8346 finish_label_decl (DECL_NAME (decl
));
8347 else if (TREE_CODE (decl
) == USING_DECL
)
8349 tree scope
= USING_DECL_SCOPE (decl
);
8350 tree name
= DECL_NAME (decl
);
8353 scope
= tsubst_expr (scope
, args
, complain
, in_decl
);
8354 decl
= lookup_qualified_name (scope
, name
,
8355 /*is_type_p=*/false,
8356 /*complain=*/false);
8357 if (decl
== error_mark_node
|| TREE_CODE (decl
) == TREE_LIST
)
8358 qualified_name_lookup_error (scope
, name
, decl
);
8360 do_local_using_decl (decl
, scope
, name
);
8364 init
= DECL_INITIAL (decl
);
8365 decl
= tsubst (decl
, args
, complain
, in_decl
);
8366 if (decl
!= error_mark_node
)
8368 /* By marking the declaration as instantiated, we avoid
8369 trying to instantiate it. Since instantiate_decl can't
8370 handle local variables, and since we've already done
8371 all that needs to be done, that's the right thing to
8373 if (TREE_CODE (decl
) == VAR_DECL
)
8374 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
8375 if (TREE_CODE (decl
) == VAR_DECL
8376 && ANON_AGGR_TYPE_P (TREE_TYPE (decl
)))
8377 /* Anonymous aggregates are a special case. */
8378 finish_anon_union (decl
);
8381 maybe_push_decl (decl
);
8382 if (TREE_CODE (decl
) == VAR_DECL
8383 && DECL_PRETTY_FUNCTION_P (decl
))
8385 /* For __PRETTY_FUNCTION__ we have to adjust the
8387 const char *const name
8388 = cxx_printable_name (current_function_decl
, 2);
8389 init
= cp_fname_init (name
, &TREE_TYPE (decl
));
8392 init
= tsubst_expr (init
, args
, complain
, in_decl
);
8393 finish_decl (decl
, init
, NULL_TREE
);
8398 /* A DECL_EXPR can also be used as an expression, in the condition
8399 clause of an if/for/while construct. */
8404 stmt
= begin_for_stmt ();
8405 tsubst_expr (FOR_INIT_STMT (t
), args
, complain
, in_decl
);
8406 finish_for_init_stmt (stmt
);
8407 tmp
= tsubst_expr (FOR_COND (t
), args
, complain
, in_decl
);
8408 finish_for_cond (tmp
, stmt
);
8409 tmp
= tsubst_expr (FOR_EXPR (t
), args
, complain
, in_decl
);
8410 finish_for_expr (tmp
, stmt
);
8411 tsubst_expr (FOR_BODY (t
), args
, complain
, in_decl
);
8412 finish_for_stmt (stmt
);
8416 stmt
= begin_while_stmt ();
8417 tmp
= tsubst_expr (WHILE_COND (t
), args
, complain
, in_decl
);
8418 finish_while_stmt_cond (tmp
, stmt
);
8419 tsubst_expr (WHILE_BODY (t
), args
, complain
, in_decl
);
8420 finish_while_stmt (stmt
);
8424 stmt
= begin_do_stmt ();
8425 tsubst_expr (DO_BODY (t
), args
, complain
, in_decl
);
8426 finish_do_body (stmt
);
8427 tmp
= tsubst_expr (DO_COND (t
), args
, complain
, in_decl
);
8428 finish_do_stmt (tmp
, stmt
);
8432 stmt
= begin_if_stmt ();
8433 tmp
= tsubst_expr (IF_COND (t
), args
, complain
, in_decl
);
8434 finish_if_stmt_cond (tmp
, stmt
);
8435 tsubst_expr (THEN_CLAUSE (t
), args
, complain
, in_decl
);
8436 finish_then_clause (stmt
);
8438 if (ELSE_CLAUSE (t
))
8440 begin_else_clause (stmt
);
8441 tsubst_expr (ELSE_CLAUSE (t
), args
, complain
, in_decl
);
8442 finish_else_clause (stmt
);
8445 finish_if_stmt (stmt
);
8449 if (BIND_EXPR_BODY_BLOCK (t
))
8450 stmt
= begin_function_body ();
8452 stmt
= begin_compound_stmt (BIND_EXPR_TRY_BLOCK (t
)
8453 ? BCS_TRY_BLOCK
: 0);
8455 tsubst_expr (BIND_EXPR_BODY (t
), args
, complain
, in_decl
);
8457 if (BIND_EXPR_BODY_BLOCK (t
))
8458 finish_function_body (stmt
);
8460 finish_compound_stmt (stmt
);
8464 finish_break_stmt ();
8468 finish_continue_stmt ();
8472 stmt
= begin_switch_stmt ();
8473 tmp
= tsubst_expr (SWITCH_STMT_COND (t
), args
, complain
, in_decl
);
8474 finish_switch_cond (tmp
, stmt
);
8475 tsubst_expr (SWITCH_STMT_BODY (t
), args
, complain
, in_decl
);
8476 finish_switch_stmt (stmt
);
8479 case CASE_LABEL_EXPR
:
8480 finish_case_label (tsubst_expr (CASE_LOW (t
), args
, complain
, in_decl
),
8481 tsubst_expr (CASE_HIGH (t
), args
, complain
,
8486 finish_label_stmt (DECL_NAME (LABEL_EXPR_LABEL (t
)));
8490 tmp
= GOTO_DESTINATION (t
);
8491 if (TREE_CODE (tmp
) != LABEL_DECL
)
8492 /* Computed goto's must be tsubst'd into. On the other hand,
8493 non-computed gotos must not be; the identifier in question
8494 will have no binding. */
8495 tmp
= tsubst_expr (tmp
, args
, complain
, in_decl
);
8497 tmp
= DECL_NAME (tmp
);
8498 finish_goto_stmt (tmp
);
8502 tmp
= finish_asm_stmt
8503 (ASM_VOLATILE_P (t
),
8504 tsubst_expr (ASM_STRING (t
), args
, complain
, in_decl
),
8505 tsubst_copy_asm_operands (ASM_OUTPUTS (t
), args
, complain
, in_decl
),
8506 tsubst_copy_asm_operands (ASM_INPUTS (t
), args
, complain
, in_decl
),
8507 tsubst_copy_asm_operands (ASM_CLOBBERS (t
), args
, complain
, in_decl
));
8509 tree asm_expr
= tmp
;
8510 if (TREE_CODE (asm_expr
) == CLEANUP_POINT_EXPR
)
8511 asm_expr
= TREE_OPERAND (asm_expr
, 0);
8512 ASM_INPUT_P (asm_expr
) = ASM_INPUT_P (t
);
8519 stmt
= begin_try_block ();
8520 tsubst_expr (TRY_STMTS (t
), args
, complain
, in_decl
);
8521 finish_cleanup_try_block (stmt
);
8522 finish_cleanup (tsubst_expr (TRY_HANDLERS (t
), args
,
8528 tree compound_stmt
= NULL_TREE
;
8530 if (FN_TRY_BLOCK_P (t
))
8531 stmt
= begin_function_try_block (&compound_stmt
);
8533 stmt
= begin_try_block ();
8535 tsubst_expr (TRY_STMTS (t
), args
, complain
, in_decl
);
8537 if (FN_TRY_BLOCK_P (t
))
8538 finish_function_try_block (stmt
);
8540 finish_try_block (stmt
);
8542 tsubst_expr (TRY_HANDLERS (t
), args
, complain
, in_decl
);
8543 if (FN_TRY_BLOCK_P (t
))
8544 finish_function_handler_sequence (stmt
, compound_stmt
);
8546 finish_handler_sequence (stmt
);
8552 tree decl
= HANDLER_PARMS (t
);
8556 decl
= tsubst (decl
, args
, complain
, in_decl
);
8557 /* Prevent instantiate_decl from trying to instantiate
8558 this variable. We've already done all that needs to be
8560 if (decl
!= error_mark_node
)
8561 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
8563 stmt
= begin_handler ();
8564 finish_handler_parms (decl
, stmt
);
8565 tsubst_expr (HANDLER_BODY (t
), args
, complain
, in_decl
);
8566 finish_handler (stmt
);
8571 tsubst (TREE_TYPE (t
), args
, complain
, NULL_TREE
);
8575 tmp
= tsubst_omp_clauses (OMP_PARALLEL_CLAUSES (t
),
8576 args
, complain
, in_decl
);
8577 stmt
= begin_omp_parallel ();
8578 tsubst_expr (OMP_PARALLEL_BODY (t
), args
, complain
, in_decl
);
8579 OMP_PARALLEL_COMBINED (finish_omp_parallel (tmp
, stmt
))
8580 = OMP_PARALLEL_COMBINED (t
);
8585 tree clauses
, decl
, init
, cond
, incr
, body
, pre_body
;
8587 clauses
= tsubst_omp_clauses (OMP_FOR_CLAUSES (t
),
8588 args
, complain
, in_decl
);
8589 init
= OMP_FOR_INIT (t
);
8590 gcc_assert (TREE_CODE (init
) == MODIFY_EXPR
);
8591 decl
= tsubst_expr (TREE_OPERAND (init
, 0), args
, complain
, in_decl
);
8592 init
= tsubst_expr (TREE_OPERAND (init
, 1), args
, complain
, in_decl
);
8593 cond
= tsubst_expr (OMP_FOR_COND (t
), args
, complain
, in_decl
);
8594 incr
= tsubst_expr (OMP_FOR_INCR (t
), args
, complain
, in_decl
);
8596 stmt
= begin_omp_structured_block ();
8598 pre_body
= push_stmt_list ();
8599 tsubst_expr (OMP_FOR_PRE_BODY (t
), args
, complain
, in_decl
);
8600 pre_body
= pop_stmt_list (pre_body
);
8602 body
= push_stmt_list ();
8603 tsubst_expr (OMP_FOR_BODY (t
), args
, complain
, in_decl
);
8604 body
= pop_stmt_list (body
);
8606 t
= finish_omp_for (EXPR_LOCATION (t
), decl
, init
, cond
, incr
, body
,
8609 OMP_FOR_CLAUSES (t
) = clauses
;
8611 add_stmt (finish_omp_structured_block (stmt
));
8617 tmp
= tsubst_omp_clauses (OMP_CLAUSES (t
), args
, complain
, in_decl
);
8618 stmt
= push_stmt_list ();
8619 tsubst_expr (OMP_BODY (t
), args
, complain
, in_decl
);
8620 stmt
= pop_stmt_list (stmt
);
8623 OMP_BODY (t
) = stmt
;
8624 OMP_CLAUSES (t
) = tmp
;
8632 stmt
= push_stmt_list ();
8633 tsubst_expr (OMP_BODY (t
), args
, complain
, in_decl
);
8634 stmt
= pop_stmt_list (stmt
);
8637 OMP_BODY (t
) = stmt
;
8644 op0
= tsubst_expr (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
8645 op1
= tsubst_expr (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
8646 finish_omp_atomic (OMP_ATOMIC_CODE (t
), op0
, op1
);
8651 gcc_assert (!STATEMENT_CODE_P (TREE_CODE (t
)));
8653 return tsubst_copy_and_build (t
, args
, complain
, in_decl
,
8654 /*function_p=*/false);
8660 /* T is a postfix-expression that is not being used in a function
8661 call. Return the substituted version of T. */
8664 tsubst_non_call_postfix_expression (tree t
, tree args
,
8665 tsubst_flags_t complain
,
8668 if (TREE_CODE (t
) == SCOPE_REF
)
8669 t
= tsubst_qualified_id (t
, args
, complain
, in_decl
,
8670 /*done=*/false, /*address_p=*/false);
8672 t
= tsubst_copy_and_build (t
, args
, complain
, in_decl
,
8673 /*function_p=*/false);
8678 /* Like tsubst but deals with expressions and performs semantic
8679 analysis. FUNCTION_P is true if T is the "F" in "F (ARGS)". */
8682 tsubst_copy_and_build (tree t
,
8684 tsubst_flags_t complain
,
8688 #define RECUR(NODE) \
8689 tsubst_copy_and_build (NODE, args, complain, in_decl, /*function_p=*/false)
8693 if (t
== NULL_TREE
|| t
== error_mark_node
)
8696 switch (TREE_CODE (t
))
8701 case IDENTIFIER_NODE
:
8705 bool non_integral_constant_expression_p
;
8706 const char *error_msg
;
8708 if (IDENTIFIER_TYPENAME_P (t
))
8710 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
8711 t
= mangle_conv_op_name_for_type (new_type
);
8714 /* Look up the name. */
8715 decl
= lookup_name (t
);
8717 /* By convention, expressions use ERROR_MARK_NODE to indicate
8718 failure, not NULL_TREE. */
8719 if (decl
== NULL_TREE
)
8720 decl
= error_mark_node
;
8722 decl
= finish_id_expression (t
, decl
, NULL_TREE
,
8724 /*integral_constant_expression_p=*/false,
8725 /*allow_non_integral_constant_expression_p=*/false,
8726 &non_integral_constant_expression_p
,
8727 /*template_p=*/false,
8729 /*address_p=*/false,
8730 /*template_arg_p=*/false,
8734 if (!function_p
&& TREE_CODE (decl
) == IDENTIFIER_NODE
)
8735 decl
= unqualified_name_lookup_error (decl
);
8739 case TEMPLATE_ID_EXPR
:
8742 tree
template = RECUR (TREE_OPERAND (t
, 0));
8743 tree targs
= TREE_OPERAND (t
, 1);
8746 targs
= tsubst_template_args (targs
, args
, complain
, in_decl
);
8748 if (TREE_CODE (template) == COMPONENT_REF
)
8750 object
= TREE_OPERAND (template, 0);
8751 template = TREE_OPERAND (template, 1);
8755 template = lookup_template_function (template, targs
);
8758 return build3 (COMPONENT_REF
, TREE_TYPE (template),
8759 object
, template, NULL_TREE
);
8766 tree r
= RECUR (TREE_OPERAND (t
, 0));
8768 if (REFERENCE_REF_P (t
))
8770 /* A type conversion to reference type will be enclosed in
8771 such an indirect ref, but the substitution of the cast
8772 will have also added such an indirect ref. */
8773 if (TREE_CODE (TREE_TYPE (r
)) == REFERENCE_TYPE
)
8774 r
= convert_from_reference (r
);
8777 r
= build_x_indirect_ref (r
, "unary *");
8783 (tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
8784 RECUR (TREE_OPERAND (t
, 0)));
8787 return build_functional_cast
8788 (tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
8789 RECUR (TREE_OPERAND (t
, 0)));
8791 case REINTERPRET_CAST_EXPR
:
8792 return build_reinterpret_cast
8793 (tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
8794 RECUR (TREE_OPERAND (t
, 0)));
8796 case CONST_CAST_EXPR
:
8797 return build_const_cast
8798 (tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
8799 RECUR (TREE_OPERAND (t
, 0)));
8801 case DYNAMIC_CAST_EXPR
:
8802 return build_dynamic_cast
8803 (tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
8804 RECUR (TREE_OPERAND (t
, 0)));
8806 case STATIC_CAST_EXPR
:
8807 return build_static_cast
8808 (tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
8809 RECUR (TREE_OPERAND (t
, 0)));
8811 case POSTDECREMENT_EXPR
:
8812 case POSTINCREMENT_EXPR
:
8813 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
8814 args
, complain
, in_decl
);
8815 return build_x_unary_op (TREE_CODE (t
), op1
);
8817 case PREDECREMENT_EXPR
:
8818 case PREINCREMENT_EXPR
:
8822 case TRUTH_NOT_EXPR
:
8823 case UNARY_PLUS_EXPR
: /* Unary + */
8826 return build_x_unary_op (TREE_CODE (t
), RECUR (TREE_OPERAND (t
, 0)));
8829 op1
= TREE_OPERAND (t
, 0);
8830 if (TREE_CODE (op1
) == SCOPE_REF
)
8831 op1
= tsubst_qualified_id (op1
, args
, complain
, in_decl
,
8832 /*done=*/true, /*address_p=*/true);
8834 op1
= tsubst_non_call_postfix_expression (op1
, args
, complain
,
8836 if (TREE_CODE (op1
) == LABEL_DECL
)
8837 return finish_label_address_expr (DECL_NAME (op1
));
8838 return build_x_unary_op (ADDR_EXPR
, op1
);
8843 case TRUNC_DIV_EXPR
:
8845 case FLOOR_DIV_EXPR
:
8846 case ROUND_DIV_EXPR
:
8847 case EXACT_DIV_EXPR
:
8851 case TRUNC_MOD_EXPR
:
8852 case FLOOR_MOD_EXPR
:
8853 case TRUTH_ANDIF_EXPR
:
8854 case TRUTH_ORIF_EXPR
:
8855 case TRUTH_AND_EXPR
:
8871 return build_x_binary_op
8873 RECUR (TREE_OPERAND (t
, 0)),
8874 RECUR (TREE_OPERAND (t
, 1)),
8875 /*overloaded_p=*/NULL
);
8878 return tsubst_qualified_id (t
, args
, complain
, in_decl
, /*done=*/true,
8879 /*address_p=*/false);
8881 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
8882 args
, complain
, in_decl
);
8883 return build_x_binary_op (ARRAY_REF
, op1
, RECUR (TREE_OPERAND (t
, 1)),
8884 /*overloaded_p=*/NULL
);
8888 op1
= TREE_OPERAND (t
, 0);
8891 /* When there are no ARGS, we are trying to evaluate a
8892 non-dependent expression from the parser. Trying to do
8893 the substitutions may not work. */
8895 op1
= TREE_TYPE (op1
);
8904 return cxx_sizeof_or_alignof_type (op1
, TREE_CODE (t
), true);
8906 return cxx_sizeof_or_alignof_expr (op1
, TREE_CODE (t
));
8910 tree r
= build_x_modify_expr
8911 (RECUR (TREE_OPERAND (t
, 0)),
8912 TREE_CODE (TREE_OPERAND (t
, 1)),
8913 RECUR (TREE_OPERAND (t
, 2)));
8914 /* TREE_NO_WARNING must be set if either the expression was
8915 parenthesized or it uses an operator such as >>= rather
8916 than plain assignment. In the former case, it was already
8917 set and must be copied. In the latter case,
8918 build_x_modify_expr sets it and it must not be reset
8920 if (TREE_NO_WARNING (t
))
8921 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
8926 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
8927 args
, complain
, in_decl
);
8928 /* Remember that there was a reference to this entity. */
8931 return build_x_arrow (op1
);
8935 (RECUR (TREE_OPERAND (t
, 0)),
8936 RECUR (TREE_OPERAND (t
, 1)),
8937 RECUR (TREE_OPERAND (t
, 2)),
8938 RECUR (TREE_OPERAND (t
, 3)),
8939 NEW_EXPR_USE_GLOBAL (t
));
8942 return delete_sanity
8943 (RECUR (TREE_OPERAND (t
, 0)),
8944 RECUR (TREE_OPERAND (t
, 1)),
8945 DELETE_EXPR_USE_VEC (t
),
8946 DELETE_EXPR_USE_GLOBAL (t
));
8949 return build_x_compound_expr (RECUR (TREE_OPERAND (t
, 0)),
8950 RECUR (TREE_OPERAND (t
, 1)));
8959 function
= TREE_OPERAND (t
, 0);
8960 /* When we parsed the expression, we determined whether or
8961 not Koenig lookup should be performed. */
8962 koenig_p
= KOENIG_LOOKUP_P (t
);
8963 if (TREE_CODE (function
) == SCOPE_REF
)
8966 function
= tsubst_qualified_id (function
, args
, complain
, in_decl
,
8968 /*address_p=*/false);
8972 if (TREE_CODE (function
) == COMPONENT_REF
)
8974 tree op
= TREE_OPERAND (function
, 1);
8976 qualified_p
= (TREE_CODE (op
) == SCOPE_REF
8978 && BASELINK_QUALIFIED_P (op
)));
8981 qualified_p
= false;
8983 function
= tsubst_copy_and_build (function
, args
, complain
,
8986 if (BASELINK_P (function
))
8990 call_args
= RECUR (TREE_OPERAND (t
, 1));
8992 /* We do not perform argument-dependent lookup if normal
8993 lookup finds a non-function, in accordance with the
8994 expected resolution of DR 218. */
8996 && ((is_overloaded_fn (function
)
8997 /* If lookup found a member function, the Koenig lookup is
8998 not appropriate, even if an unqualified-name was used
8999 to denote the function. */
9000 && !DECL_FUNCTION_MEMBER_P (get_first_fn (function
)))
9001 || TREE_CODE (function
) == IDENTIFIER_NODE
))
9002 function
= perform_koenig_lookup (function
, call_args
);
9004 if (TREE_CODE (function
) == IDENTIFIER_NODE
)
9006 unqualified_name_lookup_error (function
);
9007 return error_mark_node
;
9010 /* Remember that there was a reference to this entity. */
9011 if (DECL_P (function
))
9012 mark_used (function
);
9014 if (TREE_CODE (function
) == OFFSET_REF
)
9015 return build_offset_ref_call_from_tree (function
, call_args
);
9016 if (TREE_CODE (function
) == COMPONENT_REF
)
9018 if (!BASELINK_P (TREE_OPERAND (function
, 1)))
9019 return finish_call_expr (function
, call_args
,
9020 /*disallow_virtual=*/false,
9021 /*koenig_p=*/false);
9023 return (build_new_method_call
9024 (TREE_OPERAND (function
, 0),
9025 TREE_OPERAND (function
, 1),
9026 call_args
, NULL_TREE
,
9027 qualified_p
? LOOKUP_NONVIRTUAL
: LOOKUP_NORMAL
,
9030 return finish_call_expr (function
, call_args
,
9031 /*disallow_virtual=*/qualified_p
,
9036 return build_x_conditional_expr
9037 (RECUR (TREE_OPERAND (t
, 0)),
9038 RECUR (TREE_OPERAND (t
, 1)),
9039 RECUR (TREE_OPERAND (t
, 2)));
9041 case PSEUDO_DTOR_EXPR
:
9042 return finish_pseudo_destructor_expr
9043 (RECUR (TREE_OPERAND (t
, 0)),
9044 RECUR (TREE_OPERAND (t
, 1)),
9045 RECUR (TREE_OPERAND (t
, 2)));
9049 tree purpose
, value
, chain
;
9051 if (t
== void_list_node
)
9054 purpose
= TREE_PURPOSE (t
);
9056 purpose
= RECUR (purpose
);
9057 value
= TREE_VALUE (t
);
9059 value
= RECUR (value
);
9060 chain
= TREE_CHAIN (t
);
9061 if (chain
&& chain
!= void_type_node
)
9062 chain
= RECUR (chain
);
9063 if (purpose
== TREE_PURPOSE (t
)
9064 && value
== TREE_VALUE (t
)
9065 && chain
== TREE_CHAIN (t
))
9067 return tree_cons (purpose
, value
, chain
);
9076 object
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
9077 args
, complain
, in_decl
);
9078 /* Remember that there was a reference to this entity. */
9079 if (DECL_P (object
))
9081 object_type
= TREE_TYPE (object
);
9083 member
= TREE_OPERAND (t
, 1);
9084 if (BASELINK_P (member
))
9085 member
= tsubst_baselink (member
,
9086 non_reference (TREE_TYPE (object
)),
9087 args
, complain
, in_decl
);
9089 member
= tsubst_copy (member
, args
, complain
, in_decl
);
9090 if (member
== error_mark_node
)
9091 return error_mark_node
;
9093 if (object_type
&& !CLASS_TYPE_P (object_type
))
9095 if (TREE_CODE (member
) == BIT_NOT_EXPR
)
9096 return finish_pseudo_destructor_expr (object
,
9099 else if (TREE_CODE (member
) == SCOPE_REF
9100 && (TREE_CODE (TREE_OPERAND (member
, 1)) == BIT_NOT_EXPR
))
9101 return finish_pseudo_destructor_expr (object
,
9105 else if (TREE_CODE (member
) == SCOPE_REF
9106 && TREE_CODE (TREE_OPERAND (member
, 1)) == TEMPLATE_ID_EXPR
)
9111 /* Lookup the template functions now that we know what the
9113 tmpl
= TREE_OPERAND (TREE_OPERAND (member
, 1), 0);
9114 args
= TREE_OPERAND (TREE_OPERAND (member
, 1), 1);
9115 member
= lookup_qualified_name (TREE_OPERAND (member
, 0), tmpl
,
9116 /*is_type_p=*/false,
9117 /*complain=*/false);
9118 if (BASELINK_P (member
))
9120 BASELINK_FUNCTIONS (member
)
9121 = build_nt (TEMPLATE_ID_EXPR
, BASELINK_FUNCTIONS (member
),
9123 member
= (adjust_result_of_qualified_name_lookup
9124 (member
, BINFO_TYPE (BASELINK_BINFO (member
)),
9129 qualified_name_lookup_error (object_type
, tmpl
, member
);
9130 return error_mark_node
;
9133 else if (TREE_CODE (member
) == SCOPE_REF
9134 && !CLASS_TYPE_P (TREE_OPERAND (member
, 0))
9135 && TREE_CODE (TREE_OPERAND (member
, 0)) != NAMESPACE_DECL
)
9137 if (complain
& tf_error
)
9139 if (TYPE_P (TREE_OPERAND (member
, 0)))
9140 error ("%qT is not a class or namespace",
9141 TREE_OPERAND (member
, 0));
9143 error ("%qD is not a class or namespace",
9144 TREE_OPERAND (member
, 0));
9146 return error_mark_node
;
9148 else if (TREE_CODE (member
) == FIELD_DECL
)
9149 return finish_non_static_data_member (member
, object
, NULL_TREE
);
9151 return finish_class_member_access_expr (object
, member
,
9152 /*template_p=*/false);
9157 (RECUR (TREE_OPERAND (t
, 0)));
9161 VEC(constructor_elt
,gc
) *n
;
9162 constructor_elt
*ce
;
9163 unsigned HOST_WIDE_INT idx
;
9165 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
9166 bool process_index_p
;
9168 /* digest_init will do the wrong thing if we let it. */
9169 if (type
&& TYPE_PTRMEMFUNC_P (type
))
9172 /* We do not want to process the index of aggregate
9173 initializers as they are identifier nodes which will be
9174 looked up by digest_init. */
9175 process_index_p
= !(type
&& IS_AGGR_TYPE (type
));
9177 n
= VEC_copy (constructor_elt
, gc
, CONSTRUCTOR_ELTS (t
));
9178 for (idx
= 0; VEC_iterate (constructor_elt
, n
, idx
, ce
); idx
++)
9180 if (ce
->index
&& process_index_p
)
9181 ce
->index
= RECUR (ce
->index
);
9182 ce
->value
= RECUR (ce
->value
);
9185 r
= build_constructor (NULL_TREE
, n
);
9186 TREE_HAS_CONSTRUCTOR (r
) = TREE_HAS_CONSTRUCTOR (t
);
9189 return digest_init (type
, r
);
9195 tree operand_0
= RECUR (TREE_OPERAND (t
, 0));
9196 if (TYPE_P (operand_0
))
9197 return get_typeid (operand_0
);
9198 return build_typeid (operand_0
);
9208 tree r
= tsubst_copy (t
, args
, complain
, in_decl
);
9210 if (TREE_CODE (TREE_TYPE (t
)) != REFERENCE_TYPE
)
9211 /* If the original type was a reference, we'll be wrapped in
9212 the appropriate INDIRECT_REF. */
9213 r
= convert_from_reference (r
);
9218 return build_x_va_arg (RECUR (TREE_OPERAND (t
, 0)),
9219 tsubst_copy (TREE_TYPE (t
), args
, complain
,
9223 return finish_offsetof (RECUR (TREE_OPERAND (t
, 0)));
9227 tree old_stmt_expr
= cur_stmt_expr
;
9228 tree stmt_expr
= begin_stmt_expr ();
9230 cur_stmt_expr
= stmt_expr
;
9231 tsubst_expr (STMT_EXPR_STMT (t
), args
, complain
, in_decl
);
9232 stmt_expr
= finish_stmt_expr (stmt_expr
, false);
9233 cur_stmt_expr
= old_stmt_expr
;
9239 t
= tsubst_copy (t
, args
, complain
, in_decl
);
9240 /* As in finish_id_expression, we resolve enumeration constants
9241 to their underlying values. */
9242 if (TREE_CODE (t
) == CONST_DECL
)
9243 return DECL_INITIAL (t
);
9247 /* Handle Objective-C++ constructs, if appropriate. */
9250 = objcp_tsubst_copy_and_build (t
, args
, complain
,
9251 in_decl
, /*function_p=*/false);
9255 return tsubst_copy (t
, args
, complain
, in_decl
);
9261 /* Verify that the instantiated ARGS are valid. For type arguments,
9262 make sure that the type's linkage is ok. For non-type arguments,
9263 make sure they are constants if they are integral or enumerations.
9264 Emit an error under control of COMPLAIN, and return TRUE on error. */
9267 check_instantiated_args (tree tmpl
, tree args
, tsubst_flags_t complain
)
9269 int ix
, len
= DECL_NTPARMS (tmpl
);
9270 bool result
= false;
9272 for (ix
= 0; ix
!= len
; ix
++)
9274 tree t
= TREE_VEC_ELT (args
, ix
);
9278 /* [basic.link]: A name with no linkage (notably, the name
9279 of a class or enumeration declared in a local scope)
9280 shall not be used to declare an entity with linkage.
9281 This implies that names with no linkage cannot be used as
9282 template arguments. */
9283 tree nt
= no_linkage_check (t
, /*relaxed_p=*/false);
9287 /* DR 488 makes use of a type with no linkage cause
9288 type deduction to fail. */
9289 if (complain
& tf_error
)
9291 if (TYPE_ANONYMOUS_P (nt
))
9292 error ("%qT is/uses anonymous type", t
);
9294 error ("template argument for %qD uses local type %qT",
9299 /* In order to avoid all sorts of complications, we do not
9300 allow variably-modified types as template arguments. */
9301 else if (variably_modified_type_p (t
, NULL_TREE
))
9303 if (complain
& tf_error
)
9304 error ("%qT is a variably modified type", t
);
9308 /* A non-type argument of integral or enumerated type must be a
9310 else if (TREE_TYPE (t
)
9311 && INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (t
))
9312 && !TREE_CONSTANT (t
))
9314 if (complain
& tf_error
)
9315 error ("integral expression %qE is not constant", t
);
9319 if (result
&& (complain
& tf_error
))
9320 error (" trying to instantiate %qD", tmpl
);
9324 /* Instantiate the indicated variable or function template TMPL with
9325 the template arguments in TARG_PTR. */
9328 instantiate_template (tree tmpl
, tree targ_ptr
, tsubst_flags_t complain
)
9333 HOST_WIDE_INT saved_processing_template_decl
;
9335 if (tmpl
== error_mark_node
)
9336 return error_mark_node
;
9338 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
);
9340 /* If this function is a clone, handle it specially. */
9341 if (DECL_CLONED_FUNCTION_P (tmpl
))
9346 spec
= instantiate_template (DECL_CLONED_FUNCTION (tmpl
), targ_ptr
,
9348 if (spec
== error_mark_node
)
9349 return error_mark_node
;
9351 /* Look for the clone. */
9352 FOR_EACH_CLONE (clone
, spec
)
9353 if (DECL_NAME (clone
) == DECL_NAME (tmpl
))
9355 /* We should always have found the clone by now. */
9360 /* Check to see if we already have this specialization. */
9361 spec
= retrieve_specialization (tmpl
, targ_ptr
,
9362 /*class_specializations_p=*/false);
9363 if (spec
!= NULL_TREE
)
9366 gen_tmpl
= most_general_template (tmpl
);
9367 if (tmpl
!= gen_tmpl
)
9369 /* The TMPL is a partial instantiation. To get a full set of
9370 arguments we must add the arguments used to perform the
9371 partial instantiation. */
9372 targ_ptr
= add_outermost_template_args (DECL_TI_ARGS (tmpl
),
9375 /* Check to see if we already have this specialization. */
9376 spec
= retrieve_specialization (gen_tmpl
, targ_ptr
,
9377 /*class_specializations_p=*/false);
9378 if (spec
!= NULL_TREE
)
9382 if (check_instantiated_args (gen_tmpl
, INNERMOST_TEMPLATE_ARGS (targ_ptr
),
9384 return error_mark_node
;
9386 /* We are building a FUNCTION_DECL, during which the access of its
9387 parameters and return types have to be checked. However this
9388 FUNCTION_DECL which is the desired context for access checking
9389 is not built yet. We solve this chicken-and-egg problem by
9390 deferring all checks until we have the FUNCTION_DECL. */
9391 push_deferring_access_checks (dk_deferred
);
9393 /* Although PROCESSING_TEMPLATE_DECL may be true at this point
9394 (because, for example, we have encountered a non-dependent
9395 function call in the body of a template function and must now
9396 determine which of several overloaded functions will be called),
9397 within the instantiation itself we are not processing a
9399 saved_processing_template_decl
= processing_template_decl
;
9400 processing_template_decl
= 0;
9401 /* Substitute template parameters to obtain the specialization. */
9402 fndecl
= tsubst (DECL_TEMPLATE_RESULT (gen_tmpl
),
9403 targ_ptr
, complain
, gen_tmpl
);
9404 processing_template_decl
= saved_processing_template_decl
;
9405 if (fndecl
== error_mark_node
)
9406 return error_mark_node
;
9408 /* Now we know the specialization, compute access previously
9410 push_access_scope (fndecl
);
9411 perform_deferred_access_checks ();
9412 pop_access_scope (fndecl
);
9413 pop_deferring_access_checks ();
9415 /* The DECL_TI_TEMPLATE should always be the immediate parent
9416 template, not the most general template. */
9417 DECL_TI_TEMPLATE (fndecl
) = tmpl
;
9419 /* If we've just instantiated the main entry point for a function,
9420 instantiate all the alternate entry points as well. We do this
9421 by cloning the instantiation of the main entry point, not by
9422 instantiating the template clones. */
9423 if (TREE_CHAIN (gen_tmpl
) && DECL_CLONED_FUNCTION_P (TREE_CHAIN (gen_tmpl
)))
9424 clone_function_decl (fndecl
, /*update_method_vec_p=*/0);
9429 /* The FN is a TEMPLATE_DECL for a function. The ARGS are the
9430 arguments that are being used when calling it. TARGS is a vector
9431 into which the deduced template arguments are placed.
9433 Return zero for success, 2 for an incomplete match that doesn't resolve
9434 all the types, and 1 for complete failure. An error message will be
9435 printed only for an incomplete match.
9437 If FN is a conversion operator, or we are trying to produce a specific
9438 specialization, RETURN_TYPE is the return type desired.
9440 The EXPLICIT_TARGS are explicit template arguments provided via a
9443 The parameter STRICT is one of:
9446 We are deducing arguments for a function call, as in
9450 We are deducing arguments for a conversion function, as in
9454 We are deducing arguments when doing an explicit instantiation
9455 as in [temp.explicit], when determining an explicit specialization
9456 as in [temp.expl.spec], or when taking the address of a function
9457 template, as in [temp.deduct.funcaddr]. */
9460 fn_type_unification (tree fn
,
9461 tree explicit_targs
,
9465 unification_kind_t strict
,
9472 gcc_assert (TREE_CODE (fn
) == TEMPLATE_DECL
);
9474 fntype
= TREE_TYPE (fn
);
9479 The specified template arguments must match the template
9480 parameters in kind (i.e., type, nontype, template), and there
9481 must not be more arguments than there are parameters;
9482 otherwise type deduction fails.
9484 Nontype arguments must match the types of the corresponding
9485 nontype template parameters, or must be convertible to the
9486 types of the corresponding nontype parameters as specified in
9487 _temp.arg.nontype_, otherwise type deduction fails.
9489 All references in the function type of the function template
9490 to the corresponding template parameters are replaced by the
9491 specified template argument values. If a substitution in a
9492 template parameter or in the function type of the function
9493 template results in an invalid type, type deduction fails. */
9495 tree converted_args
;
9498 if (explicit_targs
== error_mark_node
)
9502 = (coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
9503 explicit_targs
, NULL_TREE
, tf_none
,
9504 /*require_all_args=*/false,
9505 /*use_default_args=*/false));
9506 if (converted_args
== error_mark_node
)
9509 /* Substitute the explicit args into the function type. This is
9510 necessary so that, for instance, explicitly declared function
9511 arguments can match null pointed constants. If we were given
9512 an incomplete set of explicit args, we must not do semantic
9513 processing during substitution as we could create partial
9515 incomplete
= NUM_TMPL_ARGS (explicit_targs
) != NUM_TMPL_ARGS (targs
);
9516 processing_template_decl
+= incomplete
;
9517 fntype
= tsubst (fntype
, converted_args
, tf_none
, NULL_TREE
);
9518 processing_template_decl
-= incomplete
;
9520 if (fntype
== error_mark_node
)
9523 /* Place the explicitly specified arguments in TARGS. */
9524 for (i
= NUM_TMPL_ARGS (converted_args
); i
--;)
9525 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (converted_args
, i
);
9528 parms
= TYPE_ARG_TYPES (fntype
);
9529 /* Never do unification on the 'this' parameter. */
9530 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
))
9531 parms
= TREE_CHAIN (parms
);
9535 parms
= tree_cons (NULL_TREE
, TREE_TYPE (fntype
), parms
);
9536 args
= tree_cons (NULL_TREE
, return_type
, args
);
9539 /* We allow incomplete unification without an error message here
9540 because the standard doesn't seem to explicitly prohibit it. Our
9541 callers must be ready to deal with unification failures in any
9543 result
= type_unification_real (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
9544 targs
, parms
, args
, /*subr=*/0,
9548 /* All is well so far. Now, check:
9552 When all template arguments have been deduced, all uses of
9553 template parameters in nondeduced contexts are replaced with
9554 the corresponding deduced argument values. If the
9555 substitution results in an invalid type, as described above,
9556 type deduction fails. */
9557 if (tsubst (TREE_TYPE (fn
), targs
, tf_none
, NULL_TREE
)
9564 /* Adjust types before performing type deduction, as described in
9565 [temp.deduct.call] and [temp.deduct.conv]. The rules in these two
9566 sections are symmetric. PARM is the type of a function parameter
9567 or the return type of the conversion function. ARG is the type of
9568 the argument passed to the call, or the type of the value
9569 initialized with the result of the conversion function. */
9572 maybe_adjust_types_for_deduction (unification_kind_t strict
,
9585 /* Swap PARM and ARG throughout the remainder of this
9586 function; the handling is precisely symmetric since PARM
9587 will initialize ARG rather than vice versa. */
9595 /* There is nothing to do in this case. */
9602 if (TREE_CODE (*parm
) != REFERENCE_TYPE
)
9604 /* [temp.deduct.call]
9606 If P is not a reference type:
9608 --If A is an array type, the pointer type produced by the
9609 array-to-pointer standard conversion (_conv.array_) is
9610 used in place of A for type deduction; otherwise,
9612 --If A is a function type, the pointer type produced by
9613 the function-to-pointer standard conversion
9614 (_conv.func_) is used in place of A for type deduction;
9617 --If A is a cv-qualified type, the top level
9618 cv-qualifiers of A's type are ignored for type
9620 if (TREE_CODE (*arg
) == ARRAY_TYPE
)
9621 *arg
= build_pointer_type (TREE_TYPE (*arg
));
9622 else if (TREE_CODE (*arg
) == FUNCTION_TYPE
)
9623 *arg
= build_pointer_type (*arg
);
9625 *arg
= TYPE_MAIN_VARIANT (*arg
);
9628 /* [temp.deduct.call]
9630 If P is a cv-qualified type, the top level cv-qualifiers
9631 of P's type are ignored for type deduction. If P is a
9632 reference type, the type referred to by P is used for
9634 *parm
= TYPE_MAIN_VARIANT (*parm
);
9635 if (TREE_CODE (*parm
) == REFERENCE_TYPE
)
9637 *parm
= TREE_TYPE (*parm
);
9638 result
|= UNIFY_ALLOW_OUTER_MORE_CV_QUAL
;
9641 /* DR 322. For conversion deduction, remove a reference type on parm
9642 too (which has been swapped into ARG). */
9643 if (strict
== DEDUCE_CONV
&& TREE_CODE (*arg
) == REFERENCE_TYPE
)
9644 *arg
= TREE_TYPE (*arg
);
9649 /* Most parms like fn_type_unification.
9651 If SUBR is 1, we're being called recursively (to unify the
9652 arguments of a function or method parameter of a function
9656 type_unification_real (tree tparms
,
9661 unification_kind_t strict
,
9666 int ntparms
= TREE_VEC_LENGTH (tparms
);
9668 int saw_undeduced
= 0;
9671 gcc_assert (TREE_CODE (tparms
) == TREE_VEC
);
9672 gcc_assert (xparms
== NULL_TREE
|| TREE_CODE (xparms
) == TREE_LIST
);
9673 gcc_assert (!xargs
|| TREE_CODE (xargs
) == TREE_LIST
);
9674 gcc_assert (ntparms
> 0);
9679 sub_strict
= (UNIFY_ALLOW_OUTER_LEVEL
| UNIFY_ALLOW_MORE_CV_QUAL
9680 | UNIFY_ALLOW_DERIVED
);
9684 sub_strict
= UNIFY_ALLOW_LESS_CV_QUAL
;
9688 sub_strict
= UNIFY_ALLOW_NONE
;
9699 while (parms
&& parms
!= void_list_node
9700 && args
&& args
!= void_list_node
)
9702 parm
= TREE_VALUE (parms
);
9703 parms
= TREE_CHAIN (parms
);
9704 arg
= TREE_VALUE (args
);
9705 args
= TREE_CHAIN (args
);
9707 if (arg
== error_mark_node
)
9709 if (arg
== unknown_type_node
)
9710 /* We can't deduce anything from this, but we might get all the
9711 template args from other function args. */
9714 /* Conversions will be performed on a function argument that
9715 corresponds with a function parameter that contains only
9716 non-deducible template parameters and explicitly specified
9717 template parameters. */
9718 if (!uses_template_parms (parm
))
9723 type
= TREE_TYPE (arg
);
9727 if (same_type_p (parm
, type
))
9729 if (strict
!= DEDUCE_EXACT
9730 && can_convert_arg (parm
, type
, TYPE_P (arg
) ? NULL_TREE
: arg
,
9739 gcc_assert (TREE_TYPE (arg
) != NULL_TREE
);
9740 if (type_unknown_p (arg
))
9742 /* [temp.deduct.type] A template-argument can be deduced from
9743 a pointer to function or pointer to member function
9744 argument if the set of overloaded functions does not
9745 contain function templates and at most one of a set of
9746 overloaded functions provides a unique match. */
9748 if (resolve_overloaded_unification
9749 (tparms
, targs
, parm
, arg
, strict
, sub_strict
)
9754 arg
= TREE_TYPE (arg
);
9755 if (arg
== error_mark_node
)
9760 int arg_strict
= sub_strict
;
9763 arg_strict
|= maybe_adjust_types_for_deduction (strict
, &parm
, &arg
);
9765 if (unify (tparms
, targs
, parm
, arg
, arg_strict
))
9770 /* Fail if we've reached the end of the parm list, and more args
9771 are present, and the parm list isn't variadic. */
9772 if (args
&& args
!= void_list_node
&& parms
== void_list_node
)
9774 /* Fail if parms are left and they don't have default values. */
9775 if (parms
&& parms
!= void_list_node
9776 && TREE_PURPOSE (parms
) == NULL_TREE
)
9780 for (i
= 0; i
< ntparms
; i
++)
9781 if (!TREE_VEC_ELT (targs
, i
))
9783 tree tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, i
));
9785 /* If this is an undeduced nontype parameter that depends on
9786 a type parameter, try another pass; its type may have been
9787 deduced from a later argument than the one from which
9788 this parameter can be deduced. */
9789 if (TREE_CODE (tparm
) == PARM_DECL
9790 && uses_template_parms (TREE_TYPE (tparm
))
9791 && !saw_undeduced
++)
9800 /* Subroutine of type_unification_real. Args are like the variables at the
9801 call site. ARG is an overloaded function (or template-id); we try
9802 deducing template args from each of the overloads, and if only one
9803 succeeds, we go with that. Modifies TARGS and returns 0 on success. */
9806 resolve_overloaded_unification (tree tparms
,
9810 unification_kind_t strict
,
9813 tree tempargs
= copy_node (targs
);
9817 if (TREE_CODE (arg
) == ADDR_EXPR
)
9819 arg
= TREE_OPERAND (arg
, 0);
9825 if (TREE_CODE (arg
) == COMPONENT_REF
)
9826 /* Handle `&x' where `x' is some static or non-static member
9828 arg
= TREE_OPERAND (arg
, 1);
9830 if (TREE_CODE (arg
) == OFFSET_REF
)
9831 arg
= TREE_OPERAND (arg
, 1);
9833 /* Strip baselink information. */
9834 if (BASELINK_P (arg
))
9835 arg
= BASELINK_FUNCTIONS (arg
);
9837 if (TREE_CODE (arg
) == TEMPLATE_ID_EXPR
)
9839 /* If we got some explicit template args, we need to plug them into
9840 the affected templates before we try to unify, in case the
9841 explicit args will completely resolve the templates in question. */
9843 tree expl_subargs
= TREE_OPERAND (arg
, 1);
9844 arg
= TREE_OPERAND (arg
, 0);
9846 for (; arg
; arg
= OVL_NEXT (arg
))
9848 tree fn
= OVL_CURRENT (arg
);
9851 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
9854 subargs
= get_bindings (fn
, DECL_TEMPLATE_RESULT (fn
),
9855 expl_subargs
, /*check_ret=*/false);
9858 elem
= tsubst (TREE_TYPE (fn
), subargs
, tf_none
, NULL_TREE
);
9859 good
+= try_one_overload (tparms
, targs
, tempargs
, parm
,
9860 elem
, strict
, sub_strict
, addr_p
);
9866 gcc_assert (TREE_CODE (arg
) == OVERLOAD
9867 || TREE_CODE (arg
) == FUNCTION_DECL
);
9869 for (; arg
; arg
= OVL_NEXT (arg
))
9870 good
+= try_one_overload (tparms
, targs
, tempargs
, parm
,
9871 TREE_TYPE (OVL_CURRENT (arg
)),
9872 strict
, sub_strict
, addr_p
);
9875 /* [temp.deduct.type] A template-argument can be deduced from a pointer
9876 to function or pointer to member function argument if the set of
9877 overloaded functions does not contain function templates and at most
9878 one of a set of overloaded functions provides a unique match.
9880 So if we found multiple possibilities, we return success but don't
9885 int i
= TREE_VEC_LENGTH (targs
);
9887 if (TREE_VEC_ELT (tempargs
, i
))
9888 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (tempargs
, i
);
9896 /* Subroutine of resolve_overloaded_unification; does deduction for a single
9897 overload. Fills TARGS with any deduced arguments, or error_mark_node if
9898 different overloads deduce different arguments for a given parm.
9899 ADDR_P is true if the expression for which deduction is being
9900 performed was of the form "& fn" rather than simply "fn".
9902 Returns 1 on success. */
9905 try_one_overload (tree tparms
,
9910 unification_kind_t strict
,
9918 /* [temp.deduct.type] A template-argument can be deduced from a pointer
9919 to function or pointer to member function argument if the set of
9920 overloaded functions does not contain function templates and at most
9921 one of a set of overloaded functions provides a unique match.
9923 So if this is a template, just return success. */
9925 if (uses_template_parms (arg
))
9928 if (TREE_CODE (arg
) == METHOD_TYPE
)
9929 arg
= build_ptrmemfunc_type (build_pointer_type (arg
));
9931 arg
= build_pointer_type (arg
);
9933 sub_strict
|= maybe_adjust_types_for_deduction (strict
, &parm
, &arg
);
9935 /* We don't copy orig_targs for this because if we have already deduced
9936 some template args from previous args, unify would complain when we
9937 try to deduce a template parameter for the same argument, even though
9938 there isn't really a conflict. */
9939 nargs
= TREE_VEC_LENGTH (targs
);
9940 tempargs
= make_tree_vec (nargs
);
9942 if (unify (tparms
, tempargs
, parm
, arg
, sub_strict
) != 0)
9945 /* First make sure we didn't deduce anything that conflicts with
9946 explicitly specified args. */
9947 for (i
= nargs
; i
--; )
9949 tree elt
= TREE_VEC_ELT (tempargs
, i
);
9950 tree oldelt
= TREE_VEC_ELT (orig_targs
, i
);
9954 else if (uses_template_parms (elt
))
9955 /* Since we're unifying against ourselves, we will fill in
9956 template args used in the function parm list with our own
9957 template parms. Discard them. */
9958 TREE_VEC_ELT (tempargs
, i
) = NULL_TREE
;
9959 else if (oldelt
&& !template_args_equal (oldelt
, elt
))
9963 for (i
= nargs
; i
--; )
9965 tree elt
= TREE_VEC_ELT (tempargs
, i
);
9968 TREE_VEC_ELT (targs
, i
) = elt
;
9974 /* PARM is a template class (perhaps with unbound template
9975 parameters). ARG is a fully instantiated type. If ARG can be
9976 bound to PARM, return ARG, otherwise return NULL_TREE. TPARMS and
9977 TARGS are as for unify. */
9980 try_class_unification (tree tparms
, tree targs
, tree parm
, tree arg
)
9984 if (!CLASSTYPE_TEMPLATE_INFO (arg
)
9985 || (most_general_template (CLASSTYPE_TI_TEMPLATE (arg
))
9986 != most_general_template (CLASSTYPE_TI_TEMPLATE (parm
))))
9989 /* We need to make a new template argument vector for the call to
9990 unify. If we used TARGS, we'd clutter it up with the result of
9991 the attempted unification, even if this class didn't work out.
9992 We also don't want to commit ourselves to all the unifications
9993 we've already done, since unification is supposed to be done on
9994 an argument-by-argument basis. In other words, consider the
9995 following pathological case:
9997 template <int I, int J, int K>
10000 template <int I, int J>
10001 struct S<I, J, 2> : public S<I, I, I>, S<J, J, J> {};
10003 template <int I, int J, int K>
10004 void f(S<I, J, K>, S<I, I, I>);
10013 Now, by the time we consider the unification involving `s2', we
10014 already know that we must have `f<0, 0, 0>'. But, even though
10015 `S<0, 1, 2>' is derived from `S<0, 0, 0>', the code is invalid
10016 because there are two ways to unify base classes of S<0, 1, 2>
10017 with S<I, I, I>. If we kept the already deduced knowledge, we
10018 would reject the possibility I=1. */
10019 copy_of_targs
= make_tree_vec (TREE_VEC_LENGTH (targs
));
10021 /* If unification failed, we're done. */
10022 if (unify (tparms
, copy_of_targs
, CLASSTYPE_TI_ARGS (parm
),
10023 CLASSTYPE_TI_ARGS (arg
), UNIFY_ALLOW_NONE
))
10029 /* Given a template type PARM and a class type ARG, find the unique
10030 base type in ARG that is an instance of PARM. We do not examine
10031 ARG itself; only its base-classes. If there is not exactly one
10032 appropriate base class, return NULL_TREE. PARM may be the type of
10033 a partial specialization, as well as a plain template type. Used
10037 get_template_base (tree tparms
, tree targs
, tree parm
, tree arg
)
10039 tree rval
= NULL_TREE
;
10042 gcc_assert (IS_AGGR_TYPE_CODE (TREE_CODE (arg
)));
10044 binfo
= TYPE_BINFO (complete_type (arg
));
10046 /* The type could not be completed. */
10049 /* Walk in inheritance graph order. The search order is not
10050 important, and this avoids multiple walks of virtual bases. */
10051 for (binfo
= TREE_CHAIN (binfo
); binfo
; binfo
= TREE_CHAIN (binfo
))
10053 tree r
= try_class_unification (tparms
, targs
, parm
, BINFO_TYPE (binfo
));
10057 /* If there is more than one satisfactory baseclass, then:
10061 If they yield more than one possible deduced A, the type
10065 if (rval
&& !same_type_p (r
, rval
))
10075 /* Returns the level of DECL, which declares a template parameter. */
10078 template_decl_level (tree decl
)
10080 switch (TREE_CODE (decl
))
10083 case TEMPLATE_DECL
:
10084 return TEMPLATE_TYPE_LEVEL (TREE_TYPE (decl
));
10087 return TEMPLATE_PARM_LEVEL (DECL_INITIAL (decl
));
10090 gcc_unreachable ();
10095 /* Decide whether ARG can be unified with PARM, considering only the
10096 cv-qualifiers of each type, given STRICT as documented for unify.
10097 Returns nonzero iff the unification is OK on that basis. */
10100 check_cv_quals_for_unify (int strict
, tree arg
, tree parm
)
10102 int arg_quals
= cp_type_quals (arg
);
10103 int parm_quals
= cp_type_quals (parm
);
10105 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
10106 && !(strict
& UNIFY_ALLOW_OUTER_MORE_CV_QUAL
))
10108 /* Although a CVR qualifier is ignored when being applied to a
10109 substituted template parameter ([8.3.2]/1 for example), that
10110 does not apply during deduction [14.8.2.4]/1, (even though
10111 that is not explicitly mentioned, [14.8.2.4]/9 indicates
10112 this). Except when we're allowing additional CV qualifiers
10113 at the outer level [14.8.2.1]/3,1st bullet. */
10114 if ((TREE_CODE (arg
) == REFERENCE_TYPE
10115 || TREE_CODE (arg
) == FUNCTION_TYPE
10116 || TREE_CODE (arg
) == METHOD_TYPE
)
10117 && (parm_quals
& (TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
)))
10120 if ((!POINTER_TYPE_P (arg
) && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
)
10121 && (parm_quals
& TYPE_QUAL_RESTRICT
))
10125 if (!(strict
& (UNIFY_ALLOW_MORE_CV_QUAL
| UNIFY_ALLOW_OUTER_MORE_CV_QUAL
))
10126 && (arg_quals
& parm_quals
) != parm_quals
)
10129 if (!(strict
& (UNIFY_ALLOW_LESS_CV_QUAL
| UNIFY_ALLOW_OUTER_LESS_CV_QUAL
))
10130 && (parm_quals
& arg_quals
) != arg_quals
)
10136 /* Deduce the value of template parameters. TPARMS is the (innermost)
10137 set of template parameters to a template. TARGS is the bindings
10138 for those template parameters, as determined thus far; TARGS may
10139 include template arguments for outer levels of template parameters
10140 as well. PARM is a parameter to a template function, or a
10141 subcomponent of that parameter; ARG is the corresponding argument.
10142 This function attempts to match PARM with ARG in a manner
10143 consistent with the existing assignments in TARGS. If more values
10144 are deduced, then TARGS is updated.
10146 Returns 0 if the type deduction succeeds, 1 otherwise. The
10147 parameter STRICT is a bitwise or of the following flags:
10150 Require an exact match between PARM and ARG.
10151 UNIFY_ALLOW_MORE_CV_QUAL:
10152 Allow the deduced ARG to be more cv-qualified (by qualification
10153 conversion) than ARG.
10154 UNIFY_ALLOW_LESS_CV_QUAL:
10155 Allow the deduced ARG to be less cv-qualified than ARG.
10156 UNIFY_ALLOW_DERIVED:
10157 Allow the deduced ARG to be a template base class of ARG,
10158 or a pointer to a template base class of the type pointed to by
10160 UNIFY_ALLOW_INTEGER:
10161 Allow any integral type to be deduced. See the TEMPLATE_PARM_INDEX
10162 case for more information.
10163 UNIFY_ALLOW_OUTER_LEVEL:
10164 This is the outermost level of a deduction. Used to determine validity
10165 of qualification conversions. A valid qualification conversion must
10166 have const qualified pointers leading up to the inner type which
10167 requires additional CV quals, except at the outer level, where const
10168 is not required [conv.qual]. It would be normal to set this flag in
10169 addition to setting UNIFY_ALLOW_MORE_CV_QUAL.
10170 UNIFY_ALLOW_OUTER_MORE_CV_QUAL:
10171 This is the outermost level of a deduction, and PARM can be more CV
10172 qualified at this point.
10173 UNIFY_ALLOW_OUTER_LESS_CV_QUAL:
10174 This is the outermost level of a deduction, and PARM can be less CV
10175 qualified at this point. */
10178 unify (tree tparms
, tree targs
, tree parm
, tree arg
, int strict
)
10183 int strict_in
= strict
;
10185 /* I don't think this will do the right thing with respect to types.
10186 But the only case I've seen it in so far has been array bounds, where
10187 signedness is the only information lost, and I think that will be
10189 while (TREE_CODE (parm
) == NOP_EXPR
)
10190 parm
= TREE_OPERAND (parm
, 0);
10192 if (arg
== error_mark_node
)
10194 if (arg
== unknown_type_node
)
10195 /* We can't deduce anything from this, but we might get all the
10196 template args from other function args. */
10199 /* If PARM uses template parameters, then we can't bail out here,
10200 even if ARG == PARM, since we won't record unifications for the
10201 template parameters. We might need them if we're trying to
10202 figure out which of two things is more specialized. */
10203 if (arg
== parm
&& !uses_template_parms (parm
))
10206 /* Immediately reject some pairs that won't unify because of
10207 cv-qualification mismatches. */
10208 if (TREE_CODE (arg
) == TREE_CODE (parm
)
10210 /* It is the elements of the array which hold the cv quals of an array
10211 type, and the elements might be template type parms. We'll check
10212 when we recurse. */
10213 && TREE_CODE (arg
) != ARRAY_TYPE
10214 /* We check the cv-qualifiers when unifying with template type
10215 parameters below. We want to allow ARG `const T' to unify with
10216 PARM `T' for example, when computing which of two templates
10217 is more specialized, for example. */
10218 && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
10219 && !check_cv_quals_for_unify (strict_in
, arg
, parm
))
10222 if (!(strict
& UNIFY_ALLOW_OUTER_LEVEL
)
10223 && TYPE_P (parm
) && !CP_TYPE_CONST_P (parm
))
10224 strict
&= ~UNIFY_ALLOW_MORE_CV_QUAL
;
10225 strict
&= ~UNIFY_ALLOW_OUTER_LEVEL
;
10226 strict
&= ~UNIFY_ALLOW_DERIVED
;
10227 strict
&= ~UNIFY_ALLOW_OUTER_MORE_CV_QUAL
;
10228 strict
&= ~UNIFY_ALLOW_OUTER_LESS_CV_QUAL
;
10230 switch (TREE_CODE (parm
))
10232 case TYPENAME_TYPE
:
10234 case UNBOUND_CLASS_TEMPLATE
:
10235 /* In a type which contains a nested-name-specifier, template
10236 argument values cannot be deduced for template parameters used
10237 within the nested-name-specifier. */
10240 case TEMPLATE_TYPE_PARM
:
10241 case TEMPLATE_TEMPLATE_PARM
:
10242 case BOUND_TEMPLATE_TEMPLATE_PARM
:
10243 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
10245 if (TEMPLATE_TYPE_LEVEL (parm
)
10246 != template_decl_level (tparm
))
10247 /* The PARM is not one we're trying to unify. Just check
10248 to see if it matches ARG. */
10249 return (TREE_CODE (arg
) == TREE_CODE (parm
)
10250 && same_type_p (parm
, arg
)) ? 0 : 1;
10251 idx
= TEMPLATE_TYPE_IDX (parm
);
10252 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
10253 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, idx
));
10255 /* Check for mixed types and values. */
10256 if ((TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
10257 && TREE_CODE (tparm
) != TYPE_DECL
)
10258 || (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
10259 && TREE_CODE (tparm
) != TEMPLATE_DECL
))
10262 if (TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
10264 /* ARG must be constructed from a template class or a template
10265 template parameter. */
10266 if (TREE_CODE (arg
) != BOUND_TEMPLATE_TEMPLATE_PARM
10267 && !CLASSTYPE_SPECIALIZATION_OF_PRIMARY_TEMPLATE_P (arg
))
10271 tree parmvec
= TYPE_TI_ARGS (parm
);
10272 tree argvec
= INNERMOST_TEMPLATE_ARGS (TYPE_TI_ARGS (arg
));
10274 = DECL_INNERMOST_TEMPLATE_PARMS (TYPE_TI_TEMPLATE (arg
));
10277 /* The resolution to DR150 makes clear that default
10278 arguments for an N-argument may not be used to bind T
10279 to a template template parameter with fewer than N
10280 parameters. It is not safe to permit the binding of
10281 default arguments as an extension, as that may change
10282 the meaning of a conforming program. Consider:
10284 struct Dense { static const unsigned int dim = 1; };
10286 template <template <typename> class View,
10288 void operator+(float, View<Block> const&);
10290 template <typename Block,
10291 unsigned int Dim = Block::dim>
10292 struct Lvalue_proxy { operator float() const; };
10296 Lvalue_proxy<Dense> p;
10301 Here, if Lvalue_proxy is permitted to bind to View, then
10302 the global operator+ will be used; if they are not, the
10303 Lvalue_proxy will be converted to float. */
10304 if (coerce_template_parms (argtmplvec
, parmvec
,
10305 TYPE_TI_TEMPLATE (parm
),
10307 /*require_all_args=*/true,
10308 /*use_default_args=*/false)
10309 == error_mark_node
)
10312 /* Deduce arguments T, i from TT<T> or TT<i>.
10313 We check each element of PARMVEC and ARGVEC individually
10314 rather than the whole TREE_VEC since they can have
10315 different number of elements. */
10317 for (i
= 0; i
< TREE_VEC_LENGTH (parmvec
); ++i
)
10319 if (unify (tparms
, targs
,
10320 TREE_VEC_ELT (parmvec
, i
),
10321 TREE_VEC_ELT (argvec
, i
),
10326 arg
= TYPE_TI_TEMPLATE (arg
);
10328 /* Fall through to deduce template name. */
10331 if (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
10332 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
10334 /* Deduce template name TT from TT, TT<>, TT<T> and TT<i>. */
10336 /* Simple cases: Value already set, does match or doesn't. */
10337 if (targ
!= NULL_TREE
&& template_args_equal (targ
, arg
))
10344 /* If PARM is `const T' and ARG is only `int', we don't have
10345 a match unless we are allowing additional qualification.
10346 If ARG is `const int' and PARM is just `T' that's OK;
10347 that binds `const int' to `T'. */
10348 if (!check_cv_quals_for_unify (strict_in
| UNIFY_ALLOW_LESS_CV_QUAL
,
10352 /* Consider the case where ARG is `const volatile int' and
10353 PARM is `const T'. Then, T should be `volatile int'. */
10354 arg
= cp_build_qualified_type_real
10355 (arg
, cp_type_quals (arg
) & ~cp_type_quals (parm
), tf_none
);
10356 if (arg
== error_mark_node
)
10359 /* Simple cases: Value already set, does match or doesn't. */
10360 if (targ
!= NULL_TREE
&& same_type_p (targ
, arg
))
10365 /* Make sure that ARG is not a variable-sized array. (Note
10366 that were talking about variable-sized arrays (like
10367 `int[n]'), rather than arrays of unknown size (like
10368 `int[]').) We'll get very confused by such a type since
10369 the bound of the array will not be computable in an
10370 instantiation. Besides, such types are not allowed in
10371 ISO C++, so we can do as we please here. */
10372 if (variably_modified_type_p (arg
, NULL_TREE
))
10376 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = arg
;
10379 case TEMPLATE_PARM_INDEX
:
10380 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
10381 if (tparm
== error_mark_node
)
10384 if (TEMPLATE_PARM_LEVEL (parm
)
10385 != template_decl_level (tparm
))
10386 /* The PARM is not one we're trying to unify. Just check
10387 to see if it matches ARG. */
10388 return !(TREE_CODE (arg
) == TREE_CODE (parm
)
10389 && cp_tree_equal (parm
, arg
));
10391 idx
= TEMPLATE_PARM_IDX (parm
);
10392 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
10395 return !cp_tree_equal (targ
, arg
);
10397 /* [temp.deduct.type] If, in the declaration of a function template
10398 with a non-type template-parameter, the non-type
10399 template-parameter is used in an expression in the function
10400 parameter-list and, if the corresponding template-argument is
10401 deduced, the template-argument type shall match the type of the
10402 template-parameter exactly, except that a template-argument
10403 deduced from an array bound may be of any integral type.
10404 The non-type parameter might use already deduced type parameters. */
10405 tparm
= tsubst (TREE_TYPE (parm
), targs
, 0, NULL_TREE
);
10406 if (!TREE_TYPE (arg
))
10407 /* Template-parameter dependent expression. Just accept it for now.
10408 It will later be processed in convert_template_argument. */
10410 else if (same_type_p (TREE_TYPE (arg
), tparm
))
10412 else if ((strict
& UNIFY_ALLOW_INTEGER
)
10413 && (TREE_CODE (tparm
) == INTEGER_TYPE
10414 || TREE_CODE (tparm
) == BOOLEAN_TYPE
))
10415 /* Convert the ARG to the type of PARM; the deduced non-type
10416 template argument must exactly match the types of the
10417 corresponding parameter. */
10418 arg
= fold (build_nop (TREE_TYPE (parm
), arg
));
10419 else if (uses_template_parms (tparm
))
10420 /* We haven't deduced the type of this parameter yet. Try again
10426 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = arg
;
10431 /* A pointer-to-member constant can be unified only with
10432 another constant. */
10433 if (TREE_CODE (arg
) != PTRMEM_CST
)
10436 /* Just unify the class member. It would be useless (and possibly
10437 wrong, depending on the strict flags) to unify also
10438 PTRMEM_CST_CLASS, because we want to be sure that both parm and
10439 arg refer to the same variable, even if through different
10440 classes. For instance:
10442 struct A { int x; };
10445 Unification of &A::x and &B::x must succeed. */
10446 return unify (tparms
, targs
, PTRMEM_CST_MEMBER (parm
),
10447 PTRMEM_CST_MEMBER (arg
), strict
);
10452 if (TREE_CODE (arg
) != POINTER_TYPE
)
10455 /* [temp.deduct.call]
10457 A can be another pointer or pointer to member type that can
10458 be converted to the deduced A via a qualification
10459 conversion (_conv.qual_).
10461 We pass down STRICT here rather than UNIFY_ALLOW_NONE.
10462 This will allow for additional cv-qualification of the
10463 pointed-to types if appropriate. */
10465 if (TREE_CODE (TREE_TYPE (arg
)) == RECORD_TYPE
)
10466 /* The derived-to-base conversion only persists through one
10467 level of pointers. */
10468 strict
|= (strict_in
& UNIFY_ALLOW_DERIVED
);
10470 return unify (tparms
, targs
, TREE_TYPE (parm
),
10471 TREE_TYPE (arg
), strict
);
10474 case REFERENCE_TYPE
:
10475 if (TREE_CODE (arg
) != REFERENCE_TYPE
)
10477 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
10478 strict
& UNIFY_ALLOW_MORE_CV_QUAL
);
10481 if (TREE_CODE (arg
) != ARRAY_TYPE
)
10483 if ((TYPE_DOMAIN (parm
) == NULL_TREE
)
10484 != (TYPE_DOMAIN (arg
) == NULL_TREE
))
10486 if (TYPE_DOMAIN (parm
) != NULL_TREE
)
10491 parm_max
= TYPE_MAX_VALUE (TYPE_DOMAIN (parm
));
10492 arg_max
= TYPE_MAX_VALUE (TYPE_DOMAIN (arg
));
10494 /* Our representation of array types uses "N - 1" as the
10495 TYPE_MAX_VALUE for an array with "N" elements, if "N" is
10496 not an integer constant. */
10497 if (TREE_CODE (parm_max
) == MINUS_EXPR
)
10499 arg_max
= fold_build2 (PLUS_EXPR
,
10502 TREE_OPERAND (parm_max
, 1));
10503 parm_max
= TREE_OPERAND (parm_max
, 0);
10506 if (unify (tparms
, targs
, parm_max
, arg_max
, UNIFY_ALLOW_INTEGER
))
10509 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
10510 strict
& UNIFY_ALLOW_MORE_CV_QUAL
);
10517 case ENUMERAL_TYPE
:
10519 if (TREE_CODE (arg
) != TREE_CODE (parm
))
10522 /* We have already checked cv-qualification at the top of the
10524 if (!same_type_ignoring_top_level_qualifiers_p (arg
, parm
))
10527 /* As far as unification is concerned, this wins. Later checks
10528 will invalidate it if necessary. */
10531 /* Types INTEGER_CST and MINUS_EXPR can come from array bounds. */
10532 /* Type INTEGER_CST can come from ordinary constant template args. */
10534 while (TREE_CODE (arg
) == NOP_EXPR
)
10535 arg
= TREE_OPERAND (arg
, 0);
10537 if (TREE_CODE (arg
) != INTEGER_CST
)
10539 return !tree_int_cst_equal (parm
, arg
);
10544 if (TREE_CODE (arg
) != TREE_VEC
)
10546 if (TREE_VEC_LENGTH (parm
) != TREE_VEC_LENGTH (arg
))
10548 for (i
= 0; i
< TREE_VEC_LENGTH (parm
); ++i
)
10549 if (unify (tparms
, targs
,
10550 TREE_VEC_ELT (parm
, i
), TREE_VEC_ELT (arg
, i
),
10558 if (TREE_CODE (arg
) != TREE_CODE (parm
))
10561 if (TYPE_PTRMEMFUNC_P (parm
))
10563 if (!TYPE_PTRMEMFUNC_P (arg
))
10566 return unify (tparms
, targs
,
10567 TYPE_PTRMEMFUNC_FN_TYPE (parm
),
10568 TYPE_PTRMEMFUNC_FN_TYPE (arg
),
10572 if (CLASSTYPE_TEMPLATE_INFO (parm
))
10574 tree t
= NULL_TREE
;
10576 if (strict_in
& UNIFY_ALLOW_DERIVED
)
10578 /* First, we try to unify the PARM and ARG directly. */
10579 t
= try_class_unification (tparms
, targs
,
10584 /* Fallback to the special case allowed in
10585 [temp.deduct.call]:
10587 If P is a class, and P has the form
10588 template-id, then A can be a derived class of
10589 the deduced A. Likewise, if P is a pointer to
10590 a class of the form template-id, A can be a
10591 pointer to a derived class pointed to by the
10593 t
= get_template_base (tparms
, targs
, parm
, arg
);
10599 else if (CLASSTYPE_TEMPLATE_INFO (arg
)
10600 && (CLASSTYPE_TI_TEMPLATE (parm
)
10601 == CLASSTYPE_TI_TEMPLATE (arg
)))
10602 /* Perhaps PARM is something like S<U> and ARG is S<int>.
10603 Then, we should unify `int' and `U'. */
10606 /* There's no chance of unification succeeding. */
10609 return unify (tparms
, targs
, CLASSTYPE_TI_ARGS (parm
),
10610 CLASSTYPE_TI_ARGS (t
), UNIFY_ALLOW_NONE
);
10612 else if (!same_type_ignoring_top_level_qualifiers_p (parm
, arg
))
10617 case FUNCTION_TYPE
:
10618 if (TREE_CODE (arg
) != TREE_CODE (parm
))
10621 /* CV qualifications for methods can never be deduced, they must
10622 match exactly. We need to check them explicitly here,
10623 because type_unification_real treats them as any other
10624 cvqualified parameter. */
10625 if (TREE_CODE (parm
) == METHOD_TYPE
10626 && (!check_cv_quals_for_unify
10628 TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (arg
))),
10629 TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (parm
))))))
10632 if (unify (tparms
, targs
, TREE_TYPE (parm
),
10633 TREE_TYPE (arg
), UNIFY_ALLOW_NONE
))
10635 return type_unification_real (tparms
, targs
, TYPE_ARG_TYPES (parm
),
10636 TYPE_ARG_TYPES (arg
), 1, DEDUCE_EXACT
,
10640 /* Unify a pointer to member with a pointer to member function, which
10641 deduces the type of the member as a function type. */
10642 if (TYPE_PTRMEMFUNC_P (arg
))
10646 cp_cv_quals cv_quals
;
10648 /* Check top-level cv qualifiers */
10649 if (!check_cv_quals_for_unify (UNIFY_ALLOW_NONE
, arg
, parm
))
10652 if (unify (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
10653 TYPE_PTRMEMFUNC_OBJECT_TYPE (arg
), UNIFY_ALLOW_NONE
))
10656 /* Determine the type of the function we are unifying against. */
10657 method_type
= TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (arg
));
10659 build_function_type (TREE_TYPE (method_type
),
10660 TREE_CHAIN (TYPE_ARG_TYPES (method_type
)));
10662 /* Extract the cv-qualifiers of the member function from the
10663 implicit object parameter and place them on the function
10664 type to be restored later. */
10666 cp_type_quals(TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (method_type
))));
10667 fntype
= build_qualified_type (fntype
, cv_quals
);
10668 return unify (tparms
, targs
, TREE_TYPE (parm
), fntype
, strict
);
10671 if (TREE_CODE (arg
) != OFFSET_TYPE
)
10673 if (unify (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
10674 TYPE_OFFSET_BASETYPE (arg
), UNIFY_ALLOW_NONE
))
10676 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
10680 if (DECL_TEMPLATE_PARM_P (parm
))
10681 return unify (tparms
, targs
, DECL_INITIAL (parm
), arg
, strict
);
10682 if (arg
!= integral_constant_value (parm
))
10687 case TEMPLATE_DECL
:
10688 /* Matched cases are handled by the ARG == PARM test above. */
10692 gcc_assert (EXPR_P (parm
));
10694 /* We must be looking at an expression. This can happen with
10698 void foo(S<I>, S<I + 2>);
10700 This is a "nondeduced context":
10704 The nondeduced contexts are:
10706 --A type that is a template-id in which one or more of
10707 the template-arguments is an expression that references
10708 a template-parameter.
10710 In these cases, we assume deduction succeeded, but don't
10711 actually infer any unifications. */
10713 if (!uses_template_parms (parm
)
10714 && !template_args_equal (parm
, arg
))
10721 /* Note that DECL can be defined in this translation unit, if
10725 mark_definable (tree decl
)
10728 DECL_NOT_REALLY_EXTERN (decl
) = 1;
10729 FOR_EACH_CLONE (clone
, decl
)
10730 DECL_NOT_REALLY_EXTERN (clone
) = 1;
10733 /* Called if RESULT is explicitly instantiated, or is a member of an
10734 explicitly instantiated class. */
10737 mark_decl_instantiated (tree result
, int extern_p
)
10739 SET_DECL_EXPLICIT_INSTANTIATION (result
);
10741 /* If this entity has already been written out, it's too late to
10742 make any modifications. */
10743 if (TREE_ASM_WRITTEN (result
))
10746 if (TREE_CODE (result
) != FUNCTION_DECL
)
10747 /* The TREE_PUBLIC flag for function declarations will have been
10748 set correctly by tsubst. */
10749 TREE_PUBLIC (result
) = 1;
10751 /* This might have been set by an earlier implicit instantiation. */
10752 DECL_COMDAT (result
) = 0;
10755 DECL_NOT_REALLY_EXTERN (result
) = 0;
10758 mark_definable (result
);
10759 /* Always make artificials weak. */
10760 if (DECL_ARTIFICIAL (result
) && flag_weak
)
10761 comdat_linkage (result
);
10762 /* For WIN32 we also want to put explicit instantiations in
10763 linkonce sections. */
10764 else if (TREE_PUBLIC (result
))
10765 maybe_make_one_only (result
);
10768 /* If EXTERN_P, then this function will not be emitted -- unless
10769 followed by an explicit instantiation, at which point its linkage
10770 will be adjusted. If !EXTERN_P, then this function will be
10771 emitted here. In neither circumstance do we want
10772 import_export_decl to adjust the linkage. */
10773 DECL_INTERFACE_KNOWN (result
) = 1;
10776 /* Given two function templates PAT1 and PAT2, return:
10778 1 if PAT1 is more specialized than PAT2 as described in [temp.func.order].
10779 -1 if PAT2 is more specialized than PAT1.
10780 0 if neither is more specialized.
10782 LEN indicates the number of parameters we should consider
10783 (defaulted parameters should not be considered).
10785 The 1998 std underspecified function template partial ordering, and
10786 DR214 addresses the issue. We take pairs of arguments, one from
10787 each of the templates, and deduce them against each other. One of
10788 the templates will be more specialized if all the *other*
10789 template's arguments deduce against its arguments and at least one
10790 of its arguments *does* *not* deduce against the other template's
10791 corresponding argument. Deduction is done as for class templates.
10792 The arguments used in deduction have reference and top level cv
10793 qualifiers removed. Iff both arguments were originally reference
10794 types *and* deduction succeeds in both directions, the template
10795 with the more cv-qualified argument wins for that pairing (if
10796 neither is more cv-qualified, they both are equal). Unlike regular
10797 deduction, after all the arguments have been deduced in this way,
10798 we do *not* verify the deduced template argument values can be
10799 substituted into non-deduced contexts, nor do we have to verify
10800 that all template arguments have been deduced. */
10803 more_specialized_fn (tree pat1
, tree pat2
, int len
)
10805 tree decl1
= DECL_TEMPLATE_RESULT (pat1
);
10806 tree decl2
= DECL_TEMPLATE_RESULT (pat2
);
10807 tree targs1
= make_tree_vec (DECL_NTPARMS (pat1
));
10808 tree targs2
= make_tree_vec (DECL_NTPARMS (pat2
));
10809 tree tparms1
= DECL_INNERMOST_TEMPLATE_PARMS (pat1
);
10810 tree tparms2
= DECL_INNERMOST_TEMPLATE_PARMS (pat2
);
10811 tree args1
= TYPE_ARG_TYPES (TREE_TYPE (decl1
));
10812 tree args2
= TYPE_ARG_TYPES (TREE_TYPE (decl2
));
10816 /* Remove the this parameter from non-static member functions. If
10817 one is a non-static member function and the other is not a static
10818 member function, remove the first parameter from that function
10819 also. This situation occurs for operator functions where we
10820 locate both a member function (with this pointer) and non-member
10821 operator (with explicit first operand). */
10822 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl1
))
10824 len
--; /* LEN is the number of significant arguments for DECL1 */
10825 args1
= TREE_CHAIN (args1
);
10826 if (!DECL_STATIC_FUNCTION_P (decl2
))
10827 args2
= TREE_CHAIN (args2
);
10829 else if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl2
))
10831 args2
= TREE_CHAIN (args2
);
10832 if (!DECL_STATIC_FUNCTION_P (decl1
))
10835 args1
= TREE_CHAIN (args1
);
10839 /* If only one is a conversion operator, they are unordered. */
10840 if (DECL_CONV_FN_P (decl1
) != DECL_CONV_FN_P (decl2
))
10843 /* Consider the return type for a conversion function */
10844 if (DECL_CONV_FN_P (decl1
))
10846 args1
= tree_cons (NULL_TREE
, TREE_TYPE (TREE_TYPE (decl1
)), args1
);
10847 args2
= tree_cons (NULL_TREE
, TREE_TYPE (TREE_TYPE (decl2
)), args2
);
10851 processing_template_decl
++;
10855 tree arg1
= TREE_VALUE (args1
);
10856 tree arg2
= TREE_VALUE (args2
);
10857 int deduce1
, deduce2
;
10861 if (TREE_CODE (arg1
) == REFERENCE_TYPE
)
10863 arg1
= TREE_TYPE (arg1
);
10864 quals1
= cp_type_quals (arg1
);
10867 if (TREE_CODE (arg2
) == REFERENCE_TYPE
)
10869 arg2
= TREE_TYPE (arg2
);
10870 quals2
= cp_type_quals (arg2
);
10873 if ((quals1
< 0) != (quals2
< 0))
10875 /* Only of the args is a reference, see if we should apply
10876 array/function pointer decay to it. This is not part of
10877 DR214, but is, IMHO, consistent with the deduction rules
10878 for the function call itself, and with our earlier
10879 implementation of the underspecified partial ordering
10880 rules. (nathan). */
10883 switch (TREE_CODE (arg1
))
10886 arg1
= TREE_TYPE (arg1
);
10888 case FUNCTION_TYPE
:
10889 arg1
= build_pointer_type (arg1
);
10898 switch (TREE_CODE (arg2
))
10901 arg2
= TREE_TYPE (arg2
);
10903 case FUNCTION_TYPE
:
10904 arg2
= build_pointer_type (arg2
);
10913 arg1
= TYPE_MAIN_VARIANT (arg1
);
10914 arg2
= TYPE_MAIN_VARIANT (arg2
);
10916 deduce1
= !unify (tparms1
, targs1
, arg1
, arg2
, UNIFY_ALLOW_NONE
);
10917 deduce2
= !unify (tparms2
, targs2
, arg2
, arg1
, UNIFY_ALLOW_NONE
);
10923 if (better1
< 0 && better2
< 0)
10924 /* We've failed to deduce something in either direction.
10925 These must be unordered. */
10928 if (deduce1
&& deduce2
&& quals1
>= 0 && quals2
>= 0)
10930 /* Deduces in both directions, see if quals can
10931 disambiguate. Pretend the worse one failed to deduce. */
10932 if ((quals1
& quals2
) == quals2
)
10934 if ((quals1
& quals2
) == quals1
)
10937 if (deduce1
&& !deduce2
&& !better2
)
10939 if (deduce2
&& !deduce1
&& !better1
)
10942 args1
= TREE_CHAIN (args1
);
10943 args2
= TREE_CHAIN (args2
);
10946 processing_template_decl
--;
10948 return (better1
> 0) - (better2
> 0);
10951 /* Determine which of two partial specializations is more specialized.
10953 PAT1 is a TREE_LIST whose TREE_TYPE is the _TYPE node corresponding
10954 to the first partial specialization. The TREE_VALUE is the
10955 innermost set of template parameters for the partial
10956 specialization. PAT2 is similar, but for the second template.
10958 Return 1 if the first partial specialization is more specialized;
10959 -1 if the second is more specialized; 0 if neither is more
10962 See [temp.class.order] for information about determining which of
10963 two templates is more specialized. */
10966 more_specialized_class (tree pat1
, tree pat2
)
10972 tmpl1
= TREE_TYPE (pat1
);
10973 tmpl2
= TREE_TYPE (pat2
);
10975 /* Just like what happens for functions, if we are ordering between
10976 different class template specializations, we may encounter dependent
10977 types in the arguments, and we need our dependency check functions
10978 to behave correctly. */
10979 ++processing_template_decl
;
10980 targs
= get_class_bindings (TREE_VALUE (pat1
),
10981 CLASSTYPE_TI_ARGS (tmpl1
),
10982 CLASSTYPE_TI_ARGS (tmpl2
));
10986 targs
= get_class_bindings (TREE_VALUE (pat2
),
10987 CLASSTYPE_TI_ARGS (tmpl2
),
10988 CLASSTYPE_TI_ARGS (tmpl1
));
10991 --processing_template_decl
;
10996 /* Return the template arguments that will produce the function signature
10997 DECL from the function template FN, with the explicit template
10998 arguments EXPLICIT_ARGS. If CHECK_RETTYPE is true, the return type must
10999 also match. Return NULL_TREE if no satisfactory arguments could be
11003 get_bindings (tree fn
, tree decl
, tree explicit_args
, bool check_rettype
)
11005 int ntparms
= DECL_NTPARMS (fn
);
11006 tree targs
= make_tree_vec (ntparms
);
11008 tree decl_arg_types
;
11010 /* Substitute the explicit template arguments into the type of DECL.
11011 The call to fn_type_unification will handle substitution into the
11013 decl_type
= TREE_TYPE (decl
);
11014 if (explicit_args
&& uses_template_parms (decl_type
))
11017 tree converted_args
;
11019 if (DECL_TEMPLATE_INFO (decl
))
11020 tmpl
= DECL_TI_TEMPLATE (decl
);
11022 /* We can get here for some invalid specializations. */
11026 = coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
11027 explicit_args
, NULL_TREE
,
11029 /*require_all_args=*/false,
11030 /*use_default_args=*/false);
11031 if (converted_args
== error_mark_node
)
11034 decl_type
= tsubst (decl_type
, converted_args
, tf_none
, NULL_TREE
);
11035 if (decl_type
== error_mark_node
)
11039 decl_arg_types
= TYPE_ARG_TYPES (decl_type
);
11040 /* Never do unification on the 'this' parameter. */
11041 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
11042 decl_arg_types
= TREE_CHAIN (decl_arg_types
);
11044 if (fn_type_unification (fn
, explicit_args
, targs
,
11046 (check_rettype
|| DECL_CONV_FN_P (fn
)
11047 ? TREE_TYPE (decl_type
) : NULL_TREE
),
11048 DEDUCE_EXACT
, LOOKUP_NORMAL
))
11054 /* Return the innermost template arguments that, when applied to a
11055 template specialization whose innermost template parameters are
11056 TPARMS, and whose specialization arguments are PARMS, yield the
11059 For example, suppose we have:
11061 template <class T, class U> struct S {};
11062 template <class T> struct S<T*, int> {};
11064 Then, suppose we want to get `S<double*, int>'. The TPARMS will be
11065 {T}, the SPEC_ARGS will be {T*, int} and the ARGS will be {double*,
11066 int}. The resulting vector will be {double}, indicating that `T'
11067 is bound to `double'. */
11070 get_class_bindings (tree tparms
, tree spec_args
, tree args
)
11072 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
11074 tree innermost_deduced_args
;
11076 innermost_deduced_args
= make_tree_vec (ntparms
);
11077 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
11079 deduced_args
= copy_node (args
);
11080 SET_TMPL_ARGS_LEVEL (deduced_args
,
11081 TMPL_ARGS_DEPTH (deduced_args
),
11082 innermost_deduced_args
);
11085 deduced_args
= innermost_deduced_args
;
11087 if (unify (tparms
, deduced_args
,
11088 INNERMOST_TEMPLATE_ARGS (spec_args
),
11089 INNERMOST_TEMPLATE_ARGS (args
),
11093 for (i
= 0; i
< ntparms
; ++i
)
11094 if (! TREE_VEC_ELT (innermost_deduced_args
, i
))
11097 /* Verify that nondeduced template arguments agree with the type
11098 obtained from argument deduction.
11102 struct A { typedef int X; };
11103 template <class T, class U> struct C {};
11104 template <class T> struct C<T, typename T::X> {};
11106 Then with the instantiation `C<A, int>', we can deduce that
11107 `T' is `A' but unify () does not check whether `typename T::X'
11109 spec_args
= tsubst (spec_args
, deduced_args
, tf_none
, NULL_TREE
);
11110 if (spec_args
== error_mark_node
11111 /* We only need to check the innermost arguments; the other
11112 arguments will always agree. */
11113 || !comp_template_args (INNERMOST_TEMPLATE_ARGS (spec_args
),
11114 INNERMOST_TEMPLATE_ARGS (args
)))
11117 return deduced_args
;
11120 /* TEMPLATES is a TREE_LIST. Each TREE_VALUE is a TEMPLATE_DECL.
11121 Return the TREE_LIST node with the most specialized template, if
11122 any. If there is no most specialized template, the error_mark_node
11125 Note that this function does not look at, or modify, the
11126 TREE_PURPOSE or TREE_TYPE of any of the nodes. Since the node
11127 returned is one of the elements of INSTANTIATIONS, callers may
11128 store information in the TREE_PURPOSE or TREE_TYPE of the nodes,
11129 and retrieve it from the value returned. */
11132 most_specialized_instantiation (tree templates
)
11136 ++processing_template_decl
;
11139 for (fn
= TREE_CHAIN (templates
); fn
; fn
= TREE_CHAIN (fn
))
11143 if (get_bindings (TREE_VALUE (champ
),
11144 DECL_TEMPLATE_RESULT (TREE_VALUE (fn
)),
11145 NULL_TREE
, /*check_ret=*/false))
11148 if (get_bindings (TREE_VALUE (fn
),
11149 DECL_TEMPLATE_RESULT (TREE_VALUE (champ
)),
11150 NULL_TREE
, /*check_ret=*/false))
11157 /* Equally specialized, move to next function. If there
11158 is no next function, nothing's most specialized. */
11159 fn
= TREE_CHAIN (fn
);
11167 /* Now verify that champ is better than everything earlier in the
11168 instantiation list. */
11169 for (fn
= templates
; fn
!= champ
; fn
= TREE_CHAIN (fn
))
11170 if (get_bindings (TREE_VALUE (champ
),
11171 DECL_TEMPLATE_RESULT (TREE_VALUE (fn
)),
11172 NULL_TREE
, /*check_ret=*/false)
11173 || !get_bindings (TREE_VALUE (fn
),
11174 DECL_TEMPLATE_RESULT (TREE_VALUE (champ
)),
11175 NULL_TREE
, /*check_ret=*/false))
11181 processing_template_decl
--;
11184 return error_mark_node
;
11189 /* If DECL is a specialization of some template, return the most
11190 general such template. Otherwise, returns NULL_TREE.
11192 For example, given:
11194 template <class T> struct S { template <class U> void f(U); };
11196 if TMPL is `template <class U> void S<int>::f(U)' this will return
11197 the full template. This function will not trace past partial
11198 specializations, however. For example, given in addition:
11200 template <class T> struct S<T*> { template <class U> void f(U); };
11202 if TMPL is `template <class U> void S<int*>::f(U)' this will return
11203 `template <class T> template <class U> S<T*>::f(U)'. */
11206 most_general_template (tree decl
)
11208 /* If DECL is a FUNCTION_DECL, find the TEMPLATE_DECL of which it is
11209 an immediate specialization. */
11210 if (TREE_CODE (decl
) == FUNCTION_DECL
)
11212 if (DECL_TEMPLATE_INFO (decl
)) {
11213 decl
= DECL_TI_TEMPLATE (decl
);
11215 /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE for a
11216 template friend. */
11217 if (TREE_CODE (decl
) != TEMPLATE_DECL
)
11223 /* Look for more and more general templates. */
11224 while (DECL_TEMPLATE_INFO (decl
))
11226 /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE in some cases.
11227 (See cp-tree.h for details.) */
11228 if (TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
11231 if (CLASS_TYPE_P (TREE_TYPE (decl
))
11232 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl
)))
11235 /* Stop if we run into an explicitly specialized class template. */
11236 if (!DECL_NAMESPACE_SCOPE_P (decl
)
11237 && DECL_CONTEXT (decl
)
11238 && CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (decl
)))
11241 decl
= DECL_TI_TEMPLATE (decl
);
11247 /* Return the most specialized of the class template partial
11248 specializations of TMPL which can produce TYPE, a specialization of
11249 TMPL. The value returned is actually a TREE_LIST; the TREE_TYPE is
11250 a _TYPE node corresponding to the partial specialization, while the
11251 TREE_PURPOSE is the set of template arguments that must be
11252 substituted into the TREE_TYPE in order to generate TYPE.
11254 If the choice of partial specialization is ambiguous, a diagnostic
11255 is issued, and the error_mark_node is returned. If there are no
11256 partial specializations of TMPL matching TYPE, then NULL_TREE is
11260 most_specialized_class (tree type
, tree tmpl
)
11262 tree list
= NULL_TREE
;
11269 tmpl
= most_general_template (tmpl
);
11270 args
= CLASSTYPE_TI_ARGS (type
);
11271 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
); t
; t
= TREE_CHAIN (t
))
11273 tree partial_spec_args
;
11276 partial_spec_args
= CLASSTYPE_TI_ARGS (TREE_TYPE (t
));
11277 spec_args
= get_class_bindings (TREE_VALUE (t
),
11282 list
= tree_cons (spec_args
, TREE_VALUE (t
), list
);
11283 TREE_TYPE (list
) = TREE_TYPE (t
);
11290 ambiguous_p
= false;
11293 t
= TREE_CHAIN (t
);
11294 for (; t
; t
= TREE_CHAIN (t
))
11296 fate
= more_specialized_class (champ
, t
);
11303 t
= TREE_CHAIN (t
);
11306 ambiguous_p
= true;
11315 for (t
= list
; t
&& t
!= champ
; t
= TREE_CHAIN (t
))
11317 fate
= more_specialized_class (champ
, t
);
11320 ambiguous_p
= true;
11327 const char *str
= "candidates are:";
11328 error ("ambiguous class template instantiation for %q#T", type
);
11329 for (t
= list
; t
; t
= TREE_CHAIN (t
))
11331 error ("%s %+#T", str
, TREE_TYPE (t
));
11334 return error_mark_node
;
11340 /* Explicitly instantiate DECL. */
11343 do_decl_instantiation (tree decl
, tree storage
)
11345 tree result
= NULL_TREE
;
11348 if (!decl
|| decl
== error_mark_node
)
11349 /* An error occurred, for which grokdeclarator has already issued
11350 an appropriate message. */
11352 else if (! DECL_LANG_SPECIFIC (decl
))
11354 error ("explicit instantiation of non-template %q#D", decl
);
11357 else if (TREE_CODE (decl
) == VAR_DECL
)
11359 /* There is an asymmetry here in the way VAR_DECLs and
11360 FUNCTION_DECLs are handled by grokdeclarator. In the case of
11361 the latter, the DECL we get back will be marked as a
11362 template instantiation, and the appropriate
11363 DECL_TEMPLATE_INFO will be set up. This does not happen for
11364 VAR_DECLs so we do the lookup here. Probably, grokdeclarator
11365 should handle VAR_DECLs as it currently handles
11367 result
= lookup_field (DECL_CONTEXT (decl
), DECL_NAME (decl
), 0, false);
11368 if (!result
|| TREE_CODE (result
) != VAR_DECL
)
11370 error ("no matching template for %qD found", decl
);
11374 else if (TREE_CODE (decl
) != FUNCTION_DECL
)
11376 error ("explicit instantiation of %q#D", decl
);
11382 /* Check for various error cases. Note that if the explicit
11383 instantiation is valid the RESULT will currently be marked as an
11384 *implicit* instantiation; DECL_EXPLICIT_INSTANTIATION is not set
11385 until we get here. */
11387 if (DECL_TEMPLATE_SPECIALIZATION (result
))
11389 /* DR 259 [temp.spec].
11391 Both an explicit instantiation and a declaration of an explicit
11392 specialization shall not appear in a program unless the explicit
11393 instantiation follows a declaration of the explicit specialization.
11395 For a given set of template parameters, if an explicit
11396 instantiation of a template appears after a declaration of an
11397 explicit specialization for that template, the explicit
11398 instantiation has no effect. */
11401 else if (DECL_EXPLICIT_INSTANTIATION (result
))
11405 No program shall explicitly instantiate any template more
11408 We check DECL_NOT_REALLY_EXTERN so as not to complain when
11409 the first instantiation was `extern' and the second is not,
11410 and EXTERN_P for the opposite case. */
11411 if (DECL_NOT_REALLY_EXTERN (result
) && !extern_p
)
11412 pedwarn ("duplicate explicit instantiation of %q#D", result
);
11413 /* If an "extern" explicit instantiation follows an ordinary
11414 explicit instantiation, the template is instantiated. */
11418 else if (!DECL_IMPLICIT_INSTANTIATION (result
))
11420 error ("no matching template for %qD found", result
);
11423 else if (!DECL_TEMPLATE_INFO (result
))
11425 pedwarn ("explicit instantiation of non-template %q#D", result
);
11429 if (storage
== NULL_TREE
)
11431 else if (storage
== ridpointers
[(int) RID_EXTERN
])
11433 if (pedantic
&& !in_system_header
)
11434 pedwarn ("ISO C++ forbids the use of %<extern%> on explicit "
11439 error ("storage class %qD applied to template instantiation", storage
);
11441 check_explicit_instantiation_namespace (result
);
11442 mark_decl_instantiated (result
, extern_p
);
11444 instantiate_decl (result
, /*defer_ok=*/1,
11445 /*expl_inst_class_mem_p=*/false);
11449 mark_class_instantiated (tree t
, int extern_p
)
11451 SET_CLASSTYPE_EXPLICIT_INSTANTIATION (t
);
11452 SET_CLASSTYPE_INTERFACE_KNOWN (t
);
11453 CLASSTYPE_INTERFACE_ONLY (t
) = extern_p
;
11454 TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (t
)) = extern_p
;
11457 CLASSTYPE_DEBUG_REQUESTED (t
) = 1;
11458 rest_of_type_compilation (t
, 1);
11462 /* Called from do_type_instantiation through binding_table_foreach to
11463 do recursive instantiation for the type bound in ENTRY. */
11465 bt_instantiate_type_proc (binding_entry entry
, void *data
)
11467 tree storage
= *(tree
*) data
;
11469 if (IS_AGGR_TYPE (entry
->type
)
11470 && !uses_template_parms (CLASSTYPE_TI_ARGS (entry
->type
)))
11471 do_type_instantiation (TYPE_MAIN_DECL (entry
->type
), storage
, 0);
11474 /* Called from do_type_instantiation to instantiate a member
11475 (a member function or a static member variable) of an
11476 explicitly instantiated class template. */
11478 instantiate_class_member (tree decl
, int extern_p
)
11480 mark_decl_instantiated (decl
, extern_p
);
11482 instantiate_decl (decl
, /*defer_ok=*/1,
11483 /*expl_inst_class_mem_p=*/true);
11486 /* Perform an explicit instantiation of template class T. STORAGE, if
11487 non-null, is the RID for extern, inline or static. COMPLAIN is
11488 nonzero if this is called from the parser, zero if called recursively,
11489 since the standard is unclear (as detailed below). */
11492 do_type_instantiation (tree t
, tree storage
, tsubst_flags_t complain
)
11497 int previous_instantiation_extern_p
= 0;
11499 if (TREE_CODE (t
) == TYPE_DECL
)
11502 if (! CLASS_TYPE_P (t
) || ! CLASSTYPE_TEMPLATE_INFO (t
))
11504 error ("explicit instantiation of non-template type %qT", t
);
11510 if (!COMPLETE_TYPE_P (t
))
11512 if (complain
& tf_error
)
11513 error ("explicit instantiation of %q#T before definition of template",
11518 if (storage
!= NULL_TREE
)
11520 if (pedantic
&& !in_system_header
)
11521 pedwarn("ISO C++ forbids the use of %qE on explicit instantiations",
11524 if (storage
== ridpointers
[(int) RID_INLINE
])
11526 else if (storage
== ridpointers
[(int) RID_EXTERN
])
11528 else if (storage
== ridpointers
[(int) RID_STATIC
])
11532 error ("storage class %qD applied to template instantiation",
11538 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
11540 /* DR 259 [temp.spec].
11542 Both an explicit instantiation and a declaration of an explicit
11543 specialization shall not appear in a program unless the explicit
11544 instantiation follows a declaration of the explicit specialization.
11546 For a given set of template parameters, if an explicit
11547 instantiation of a template appears after a declaration of an
11548 explicit specialization for that template, the explicit
11549 instantiation has no effect. */
11552 else if (CLASSTYPE_EXPLICIT_INSTANTIATION (t
))
11556 No program shall explicitly instantiate any template more
11559 If PREVIOUS_INSTANTIATION_EXTERN_P, then the first explicit
11560 instantiation was `extern'. If EXTERN_P then the second is.
11561 These cases are OK. */
11562 previous_instantiation_extern_p
= CLASSTYPE_INTERFACE_ONLY (t
);
11564 if (!previous_instantiation_extern_p
&& !extern_p
11565 && (complain
& tf_error
))
11566 pedwarn ("duplicate explicit instantiation of %q#T", t
);
11568 /* If we've already instantiated the template, just return now. */
11569 if (!CLASSTYPE_INTERFACE_ONLY (t
))
11573 check_explicit_instantiation_namespace (TYPE_NAME (t
));
11574 mark_class_instantiated (t
, extern_p
);
11582 /* In contrast to implicit instantiation, where only the
11583 declarations, and not the definitions, of members are
11584 instantiated, we have here:
11588 The explicit instantiation of a class template specialization
11589 implies the instantiation of all of its members not
11590 previously explicitly specialized in the translation unit
11591 containing the explicit instantiation.
11593 Of course, we can't instantiate member template classes, since
11594 we don't have any arguments for them. Note that the standard
11595 is unclear on whether the instantiation of the members are
11596 *explicit* instantiations or not. However, the most natural
11597 interpretation is that it should be an explicit instantiation. */
11600 for (tmp
= TYPE_METHODS (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
11601 if (TREE_CODE (tmp
) == FUNCTION_DECL
11602 && DECL_TEMPLATE_INSTANTIATION (tmp
))
11603 instantiate_class_member (tmp
, extern_p
);
11605 for (tmp
= TYPE_FIELDS (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
11606 if (TREE_CODE (tmp
) == VAR_DECL
&& DECL_TEMPLATE_INSTANTIATION (tmp
))
11607 instantiate_class_member (tmp
, extern_p
);
11609 if (CLASSTYPE_NESTED_UTDS (t
))
11610 binding_table_foreach (CLASSTYPE_NESTED_UTDS (t
),
11611 bt_instantiate_type_proc
, &storage
);
11615 /* Given a function DECL, which is a specialization of TMPL, modify
11616 DECL to be a re-instantiation of TMPL with the same template
11617 arguments. TMPL should be the template into which tsubst'ing
11618 should occur for DECL, not the most general template.
11620 One reason for doing this is a scenario like this:
11623 void f(const T&, int i);
11625 void g() { f(3, 7); }
11628 void f(const T& t, const int i) { }
11630 Note that when the template is first instantiated, with
11631 instantiate_template, the resulting DECL will have no name for the
11632 first parameter, and the wrong type for the second. So, when we go
11633 to instantiate the DECL, we regenerate it. */
11636 regenerate_decl_from_template (tree decl
, tree tmpl
)
11638 /* The arguments used to instantiate DECL, from the most general
11643 args
= DECL_TI_ARGS (decl
);
11644 code_pattern
= DECL_TEMPLATE_RESULT (tmpl
);
11646 /* Make sure that we can see identifiers, and compute access
11648 push_access_scope (decl
);
11650 if (TREE_CODE (decl
) == FUNCTION_DECL
)
11658 args_depth
= TMPL_ARGS_DEPTH (args
);
11659 parms_depth
= TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
));
11660 if (args_depth
> parms_depth
)
11661 args
= get_innermost_template_args (args
, parms_depth
);
11663 specs
= tsubst_exception_specification (TREE_TYPE (code_pattern
),
11664 args
, tf_error
, NULL_TREE
);
11666 TREE_TYPE (decl
) = build_exception_variant (TREE_TYPE (decl
),
11669 /* Merge parameter declarations. */
11670 decl_parm
= skip_artificial_parms_for (decl
,
11671 DECL_ARGUMENTS (decl
));
11673 = skip_artificial_parms_for (code_pattern
,
11674 DECL_ARGUMENTS (code_pattern
));
11680 if (DECL_NAME (decl_parm
) != DECL_NAME (pattern_parm
))
11681 DECL_NAME (decl_parm
) = DECL_NAME (pattern_parm
);
11682 parm_type
= tsubst (TREE_TYPE (pattern_parm
), args
, tf_error
,
11684 parm_type
= type_decays_to (parm_type
);
11685 if (!same_type_p (TREE_TYPE (decl_parm
), parm_type
))
11686 TREE_TYPE (decl_parm
) = parm_type
;
11687 attributes
= DECL_ATTRIBUTES (pattern_parm
);
11688 if (DECL_ATTRIBUTES (decl_parm
) != attributes
)
11690 DECL_ATTRIBUTES (decl_parm
) = attributes
;
11691 cplus_decl_attributes (&decl_parm
, attributes
, /*flags=*/0);
11693 decl_parm
= TREE_CHAIN (decl_parm
);
11694 pattern_parm
= TREE_CHAIN (pattern_parm
);
11697 /* Merge additional specifiers from the CODE_PATTERN. */
11698 if (DECL_DECLARED_INLINE_P (code_pattern
)
11699 && !DECL_DECLARED_INLINE_P (decl
))
11700 DECL_DECLARED_INLINE_P (decl
) = 1;
11701 if (DECL_INLINE (code_pattern
) && !DECL_INLINE (decl
))
11702 DECL_INLINE (decl
) = 1;
11704 else if (TREE_CODE (decl
) == VAR_DECL
)
11705 DECL_INITIAL (decl
) =
11706 tsubst_expr (DECL_INITIAL (code_pattern
), args
,
11707 tf_error
, DECL_TI_TEMPLATE (decl
));
11709 gcc_unreachable ();
11711 pop_access_scope (decl
);
11714 /* Return the TEMPLATE_DECL into which DECL_TI_ARGS(DECL) should be
11715 substituted to get DECL. */
11718 template_for_substitution (tree decl
)
11720 tree tmpl
= DECL_TI_TEMPLATE (decl
);
11722 /* Set TMPL to the template whose DECL_TEMPLATE_RESULT is the pattern
11723 for the instantiation. This is not always the most general
11724 template. Consider, for example:
11727 struct S { template <class U> void f();
11728 template <> void f<int>(); };
11730 and an instantiation of S<double>::f<int>. We want TD to be the
11731 specialization S<T>::f<int>, not the more general S<T>::f<U>. */
11732 while (/* An instantiation cannot have a definition, so we need a
11733 more general template. */
11734 DECL_TEMPLATE_INSTANTIATION (tmpl
)
11735 /* We must also deal with friend templates. Given:
11737 template <class T> struct S {
11738 template <class U> friend void f() {};
11741 S<int>::f<U> say, is not an instantiation of S<T>::f<U>,
11742 so far as the language is concerned, but that's still
11743 where we get the pattern for the instantiation from. On
11744 other hand, if the definition comes outside the class, say:
11746 template <class T> struct S {
11747 template <class U> friend void f();
11749 template <class U> friend void f() {}
11751 we don't need to look any further. That's what the check for
11752 DECL_INITIAL is for. */
11753 || (TREE_CODE (decl
) == FUNCTION_DECL
11754 && DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (tmpl
)
11755 && !DECL_INITIAL (DECL_TEMPLATE_RESULT (tmpl
))))
11757 /* The present template, TD, should not be a definition. If it
11758 were a definition, we should be using it! Note that we
11759 cannot restructure the loop to just keep going until we find
11760 a template with a definition, since that might go too far if
11761 a specialization was declared, but not defined. */
11762 gcc_assert (TREE_CODE (decl
) != VAR_DECL
11763 || DECL_IN_AGGR_P (DECL_TEMPLATE_RESULT (tmpl
)));
11765 /* Fetch the more general template. */
11766 tmpl
= DECL_TI_TEMPLATE (tmpl
);
11772 /* Produce the definition of D, a _DECL generated from a template. If
11773 DEFER_OK is nonzero, then we don't have to actually do the
11774 instantiation now; we just have to do it sometime. Normally it is
11775 an error if this is an explicit instantiation but D is undefined.
11776 EXPL_INST_CLASS_MEM_P is true iff D is a member of an
11777 explicitly instantiated class template. */
11780 instantiate_decl (tree d
, int defer_ok
,
11781 bool expl_inst_class_mem_p
)
11783 tree tmpl
= DECL_TI_TEMPLATE (d
);
11790 bool pattern_defined
;
11792 location_t saved_loc
= input_location
;
11795 /* This function should only be used to instantiate templates for
11796 functions and static member variables. */
11797 gcc_assert (TREE_CODE (d
) == FUNCTION_DECL
11798 || TREE_CODE (d
) == VAR_DECL
);
11800 /* Variables are never deferred; if instantiation is required, they
11801 are instantiated right away. That allows for better code in the
11802 case that an expression refers to the value of the variable --
11803 if the variable has a constant value the referring expression can
11804 take advantage of that fact. */
11805 if (TREE_CODE (d
) == VAR_DECL
)
11808 /* Don't instantiate cloned functions. Instead, instantiate the
11809 functions they cloned. */
11810 if (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_CLONED_FUNCTION_P (d
))
11811 d
= DECL_CLONED_FUNCTION (d
);
11813 if (DECL_TEMPLATE_INSTANTIATED (d
))
11814 /* D has already been instantiated. It might seem reasonable to
11815 check whether or not D is an explicit instantiation, and, if so,
11816 stop here. But when an explicit instantiation is deferred
11817 until the end of the compilation, DECL_EXPLICIT_INSTANTIATION
11818 is set, even though we still need to do the instantiation. */
11821 /* If we already have a specialization of this declaration, then
11822 there's no reason to instantiate it. Note that
11823 retrieve_specialization gives us both instantiations and
11824 specializations, so we must explicitly check
11825 DECL_TEMPLATE_SPECIALIZATION. */
11826 gen_tmpl
= most_general_template (tmpl
);
11827 gen_args
= DECL_TI_ARGS (d
);
11828 spec
= retrieve_specialization (gen_tmpl
, gen_args
,
11829 /*class_specializations_p=*/false);
11830 if (spec
!= NULL_TREE
&& DECL_TEMPLATE_SPECIALIZATION (spec
))
11833 /* This needs to happen before any tsubsting. */
11834 if (! push_tinst_level (d
))
11837 timevar_push (TV_PARSE
);
11839 /* Set TD to the template whose DECL_TEMPLATE_RESULT is the pattern
11840 for the instantiation. */
11841 td
= template_for_substitution (d
);
11842 code_pattern
= DECL_TEMPLATE_RESULT (td
);
11844 /* We should never be trying to instantiate a member of a class
11845 template or partial specialization. */
11846 gcc_assert (d
!= code_pattern
);
11848 if ((DECL_NAMESPACE_SCOPE_P (d
) && !DECL_INITIALIZED_IN_CLASS_P (d
))
11849 || DECL_TEMPLATE_SPECIALIZATION (td
))
11850 /* In the case of a friend template whose definition is provided
11851 outside the class, we may have too many arguments. Drop the
11852 ones we don't need. The same is true for specializations. */
11853 args
= get_innermost_template_args
11854 (gen_args
, TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (td
)));
11858 if (TREE_CODE (d
) == FUNCTION_DECL
)
11859 pattern_defined
= (DECL_SAVED_TREE (code_pattern
) != NULL_TREE
);
11861 pattern_defined
= ! DECL_IN_AGGR_P (code_pattern
);
11863 /* We may be in the middle of deferred access check. Disable it now. */
11864 push_deferring_access_checks (dk_no_deferred
);
11866 /* Unless an explicit instantiation directive has already determined
11867 the linkage of D, remember that a definition is available for
11869 if (pattern_defined
11870 && !DECL_INTERFACE_KNOWN (d
)
11871 && !DECL_NOT_REALLY_EXTERN (d
))
11872 mark_definable (d
);
11874 input_location
= DECL_SOURCE_LOCATION (d
);
11876 /* If D is a member of an explicitly instantiated class template,
11877 and no definition is available, treat it like an implicit
11879 if (!pattern_defined
&& expl_inst_class_mem_p
11880 && DECL_EXPLICIT_INSTANTIATION (d
))
11882 DECL_NOT_REALLY_EXTERN (d
) = 0;
11883 DECL_INTERFACE_KNOWN (d
) = 0;
11884 SET_DECL_IMPLICIT_INSTANTIATION (d
);
11889 /* Recheck the substitutions to obtain any warning messages
11890 about ignoring cv qualifiers. */
11891 tree gen
= DECL_TEMPLATE_RESULT (gen_tmpl
);
11892 tree type
= TREE_TYPE (gen
);
11894 /* Make sure that we can see identifiers, and compute access
11895 correctly. D is already the target FUNCTION_DECL with the
11897 push_access_scope (d
);
11899 if (TREE_CODE (gen
) == FUNCTION_DECL
)
11901 tsubst (DECL_ARGUMENTS (gen
), gen_args
, tf_warning_or_error
, d
);
11902 tsubst (TYPE_RAISES_EXCEPTIONS (type
), gen_args
,
11903 tf_warning_or_error
, d
);
11904 /* Don't simply tsubst the function type, as that will give
11905 duplicate warnings about poor parameter qualifications.
11906 The function arguments are the same as the decl_arguments
11907 without the top level cv qualifiers. */
11908 type
= TREE_TYPE (type
);
11910 tsubst (type
, gen_args
, tf_warning_or_error
, d
);
11912 pop_access_scope (d
);
11915 /* Check to see whether we know that this template will be
11916 instantiated in some other file, as with "extern template"
11918 external_p
= (DECL_INTERFACE_KNOWN (d
) && DECL_REALLY_EXTERN (d
));
11919 /* In general, we do not instantiate such templates... */
11921 /* ... but we instantiate inline functions so that we can inline
11923 && ! (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_INLINE (d
))
11924 /* ... we instantiate static data members whose values are
11925 needed in integral constant expressions. */
11926 && ! (TREE_CODE (d
) == VAR_DECL
11927 && DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (d
)))
11929 /* Defer all other templates, unless we have been explicitly
11930 forbidden from doing so. */
11931 if (/* If there is no definition, we cannot instantiate the
11934 /* If it's OK to postpone instantiation, do so. */
11936 /* If this is a static data member that will be defined
11937 elsewhere, we don't want to instantiate the entire data
11938 member, but we do want to instantiate the initializer so that
11939 we can substitute that elsewhere. */
11940 || (external_p
&& TREE_CODE (d
) == VAR_DECL
))
11942 /* The definition of the static data member is now required so
11943 we must substitute the initializer. */
11944 if (TREE_CODE (d
) == VAR_DECL
11945 && !DECL_INITIAL (d
)
11946 && DECL_INITIAL (code_pattern
))
11951 ns
= decl_namespace_context (d
);
11952 push_nested_namespace (ns
);
11953 push_nested_class (DECL_CONTEXT (d
));
11954 init
= tsubst_expr (DECL_INITIAL (code_pattern
),
11956 tf_warning_or_error
, NULL_TREE
);
11957 cp_finish_decl (d
, init
, /*init_const_expr_p=*/false,
11958 /*asmspec_tree=*/NULL_TREE
,
11959 LOOKUP_ONLYCONVERTING
);
11960 pop_nested_class ();
11961 pop_nested_namespace (ns
);
11964 /* We restore the source position here because it's used by
11965 add_pending_template. */
11966 input_location
= saved_loc
;
11968 if (at_eof
&& !pattern_defined
11969 && DECL_EXPLICIT_INSTANTIATION (d
))
11972 The definition of a non-exported function template, a
11973 non-exported member function template, or a non-exported
11974 member function or static data member of a class template
11975 shall be present in every translation unit in which it is
11976 explicitly instantiated. */
11978 ("explicit instantiation of %qD but no definition available", d
);
11980 /* ??? Historically, we have instantiated inline functions, even
11981 when marked as "extern template". */
11982 if (!(external_p
&& TREE_CODE (d
) == VAR_DECL
))
11983 add_pending_template (d
);
11986 /* Tell the repository that D is available in this translation unit
11987 -- and see if it is supposed to be instantiated here. */
11988 if (TREE_PUBLIC (d
) && !DECL_REALLY_EXTERN (d
) && !repo_emit_p (d
))
11990 /* In a PCH file, despite the fact that the repository hasn't
11991 requested instantiation in the PCH it is still possible that
11992 an instantiation will be required in a file that includes the
11995 add_pending_template (d
);
11996 /* Instantiate inline functions so that the inliner can do its
11997 job, even though we'll not be emitting a copy of this
11999 if (!(TREE_CODE (d
) == FUNCTION_DECL
12000 && flag_inline_trees
12001 && DECL_DECLARED_INLINE_P (d
)))
12005 need_push
= !cfun
|| !global_bindings_p ();
12007 push_to_top_level ();
12009 /* Mark D as instantiated so that recursive calls to
12010 instantiate_decl do not try to instantiate it again. */
12011 DECL_TEMPLATE_INSTANTIATED (d
) = 1;
12013 /* Regenerate the declaration in case the template has been modified
12014 by a subsequent redeclaration. */
12015 regenerate_decl_from_template (d
, td
);
12017 /* We already set the file and line above. Reset them now in case
12018 they changed as a result of calling regenerate_decl_from_template. */
12019 input_location
= DECL_SOURCE_LOCATION (d
);
12021 if (TREE_CODE (d
) == VAR_DECL
)
12025 /* Clear out DECL_RTL; whatever was there before may not be right
12026 since we've reset the type of the declaration. */
12027 SET_DECL_RTL (d
, NULL_RTX
);
12028 DECL_IN_AGGR_P (d
) = 0;
12030 /* The initializer is placed in DECL_INITIAL by
12031 regenerate_decl_from_template. Pull it out so that
12032 finish_decl can process it. */
12033 init
= DECL_INITIAL (d
);
12034 DECL_INITIAL (d
) = NULL_TREE
;
12035 DECL_INITIALIZED_P (d
) = 0;
12037 /* Clear DECL_EXTERNAL so that cp_finish_decl will process the
12038 initializer. That function will defer actual emission until
12039 we have a chance to determine linkage. */
12040 DECL_EXTERNAL (d
) = 0;
12042 /* Enter the scope of D so that access-checking works correctly. */
12043 push_nested_class (DECL_CONTEXT (d
));
12044 finish_decl (d
, init
, NULL_TREE
);
12045 pop_nested_class ();
12047 else if (TREE_CODE (d
) == FUNCTION_DECL
)
12049 htab_t saved_local_specializations
;
12054 /* Save away the current list, in case we are instantiating one
12055 template from within the body of another. */
12056 saved_local_specializations
= local_specializations
;
12058 /* Set up the list of local specializations. */
12059 local_specializations
= htab_create (37,
12060 hash_local_specialization
,
12061 eq_local_specializations
,
12064 /* Set up context. */
12065 start_preparsed_function (d
, NULL_TREE
, SF_PRE_PARSED
);
12067 /* Create substitution entries for the parameters. */
12068 subst_decl
= DECL_TEMPLATE_RESULT (template_for_substitution (d
));
12069 tmpl_parm
= DECL_ARGUMENTS (subst_decl
);
12070 spec_parm
= DECL_ARGUMENTS (d
);
12071 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (d
))
12073 register_local_specialization (spec_parm
, tmpl_parm
);
12074 spec_parm
= skip_artificial_parms_for (d
, spec_parm
);
12075 tmpl_parm
= skip_artificial_parms_for (subst_decl
, tmpl_parm
);
12079 register_local_specialization (spec_parm
, tmpl_parm
);
12080 tmpl_parm
= TREE_CHAIN (tmpl_parm
);
12081 spec_parm
= TREE_CHAIN (spec_parm
);
12083 gcc_assert (!spec_parm
);
12085 /* Substitute into the body of the function. */
12086 tsubst_expr (DECL_SAVED_TREE (code_pattern
), args
,
12087 tf_warning_or_error
, tmpl
);
12089 /* We don't need the local specializations any more. */
12090 htab_delete (local_specializations
);
12091 local_specializations
= saved_local_specializations
;
12093 /* Finish the function. */
12094 d
= finish_function (0);
12095 expand_or_defer_fn (d
);
12098 /* We're not deferring instantiation any more. */
12099 TI_PENDING_TEMPLATE_FLAG (DECL_TEMPLATE_INFO (d
)) = 0;
12102 pop_from_top_level ();
12105 input_location
= saved_loc
;
12106 pop_deferring_access_checks ();
12107 pop_tinst_level ();
12109 timevar_pop (TV_PARSE
);
12114 /* Run through the list of templates that we wish we could
12115 instantiate, and instantiate any we can. RETRIES is the
12116 number of times we retry pending template instantiation. */
12119 instantiate_pending_templates (int retries
)
12122 tree last
= NULL_TREE
;
12124 location_t saved_loc
= input_location
;
12125 int saved_in_system_header
= in_system_header
;
12127 /* Instantiating templates may trigger vtable generation. This in turn
12128 may require further template instantiations. We place a limit here
12129 to avoid infinite loop. */
12130 if (pending_templates
&& retries
>= max_tinst_depth
)
12132 tree decl
= TREE_VALUE (pending_templates
);
12134 error ("template instantiation depth exceeds maximum of %d"
12135 " instantiating %q+D, possibly from virtual table generation"
12136 " (use -ftemplate-depth-NN to increase the maximum)",
12137 max_tinst_depth
, decl
);
12138 if (TREE_CODE (decl
) == FUNCTION_DECL
)
12139 /* Pretend that we defined it. */
12140 DECL_INITIAL (decl
) = error_mark_node
;
12148 t
= &pending_templates
;
12151 tree instantiation
= TREE_VALUE (*t
);
12153 reopen_tinst_level (TREE_PURPOSE (*t
));
12155 if (TYPE_P (instantiation
))
12159 if (!COMPLETE_TYPE_P (instantiation
))
12161 instantiate_class_template (instantiation
);
12162 if (CLASSTYPE_TEMPLATE_INSTANTIATION (instantiation
))
12163 for (fn
= TYPE_METHODS (instantiation
);
12165 fn
= TREE_CHAIN (fn
))
12166 if (! DECL_ARTIFICIAL (fn
))
12167 instantiate_decl (fn
,
12169 /*expl_inst_class_mem_p=*/false);
12170 if (COMPLETE_TYPE_P (instantiation
))
12174 if (COMPLETE_TYPE_P (instantiation
))
12175 /* If INSTANTIATION has been instantiated, then we don't
12176 need to consider it again in the future. */
12177 *t
= TREE_CHAIN (*t
);
12181 t
= &TREE_CHAIN (*t
);
12186 if (!DECL_TEMPLATE_SPECIALIZATION (instantiation
)
12187 && !DECL_TEMPLATE_INSTANTIATED (instantiation
))
12190 = instantiate_decl (instantiation
,
12192 /*expl_inst_class_mem_p=*/false);
12193 if (DECL_TEMPLATE_INSTANTIATED (instantiation
))
12197 if (DECL_TEMPLATE_SPECIALIZATION (instantiation
)
12198 || DECL_TEMPLATE_INSTANTIATED (instantiation
))
12199 /* If INSTANTIATION has been instantiated, then we don't
12200 need to consider it again in the future. */
12201 *t
= TREE_CHAIN (*t
);
12205 t
= &TREE_CHAIN (*t
);
12209 current_tinst_level
= NULL_TREE
;
12211 last_pending_template
= last
;
12213 while (reconsider
);
12215 input_location
= saved_loc
;
12216 in_system_header
= saved_in_system_header
;
12219 /* Substitute ARGVEC into T, which is a list of initializers for
12220 either base class or a non-static data member. The TREE_PURPOSEs
12221 are DECLs, and the TREE_VALUEs are the initializer values. Used by
12222 instantiate_decl. */
12225 tsubst_initializer_list (tree t
, tree argvec
)
12227 tree inits
= NULL_TREE
;
12229 for (; t
; t
= TREE_CHAIN (t
))
12234 decl
= tsubst_copy (TREE_PURPOSE (t
), argvec
, tf_warning_or_error
,
12236 decl
= expand_member_init (decl
);
12237 if (decl
&& !DECL_P (decl
))
12238 in_base_initializer
= 1;
12240 init
= tsubst_expr (TREE_VALUE (t
), argvec
, tf_warning_or_error
,
12242 in_base_initializer
= 0;
12246 init
= build_tree_list (decl
, init
);
12247 TREE_CHAIN (init
) = inits
;
12254 /* Set CURRENT_ACCESS_SPECIFIER based on the protection of DECL. */
12257 set_current_access_from_decl (tree decl
)
12259 if (TREE_PRIVATE (decl
))
12260 current_access_specifier
= access_private_node
;
12261 else if (TREE_PROTECTED (decl
))
12262 current_access_specifier
= access_protected_node
;
12264 current_access_specifier
= access_public_node
;
12267 /* Instantiate an enumerated type. TAG is the template type, NEWTAG
12268 is the instantiation (which should have been created with
12269 start_enum) and ARGS are the template arguments to use. */
12272 tsubst_enum (tree tag
, tree newtag
, tree args
)
12276 for (e
= TYPE_VALUES (tag
); e
; e
= TREE_CHAIN (e
))
12281 decl
= TREE_VALUE (e
);
12282 /* Note that in a template enum, the TREE_VALUE is the
12283 CONST_DECL, not the corresponding INTEGER_CST. */
12284 value
= tsubst_expr (DECL_INITIAL (decl
),
12285 args
, tf_warning_or_error
, NULL_TREE
);
12287 /* Give this enumeration constant the correct access. */
12288 set_current_access_from_decl (decl
);
12290 /* Actually build the enumerator itself. */
12291 build_enumerator (DECL_NAME (decl
), value
, newtag
);
12294 finish_enum (newtag
);
12295 DECL_SOURCE_LOCATION (TYPE_NAME (newtag
))
12296 = DECL_SOURCE_LOCATION (TYPE_NAME (tag
));
12299 /* DECL is a FUNCTION_DECL that is a template specialization. Return
12300 its type -- but without substituting the innermost set of template
12301 arguments. So, innermost set of template parameters will appear in
12305 get_mostly_instantiated_function_type (tree decl
)
12313 tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
12314 targs
= DECL_TI_ARGS (decl
);
12315 tparms
= DECL_TEMPLATE_PARMS (tmpl
);
12316 parm_depth
= TMPL_PARMS_DEPTH (tparms
);
12318 /* There should be as many levels of arguments as there are levels
12320 gcc_assert (parm_depth
== TMPL_ARGS_DEPTH (targs
));
12322 fn_type
= TREE_TYPE (tmpl
);
12324 if (parm_depth
== 1)
12325 /* No substitution is necessary. */
12329 int i
, save_access_control
;
12332 /* Replace the innermost level of the TARGS with NULL_TREEs to
12333 let tsubst know not to substitute for those parameters. */
12334 partial_args
= make_tree_vec (TREE_VEC_LENGTH (targs
));
12335 for (i
= 1; i
< TMPL_ARGS_DEPTH (targs
); ++i
)
12336 SET_TMPL_ARGS_LEVEL (partial_args
, i
,
12337 TMPL_ARGS_LEVEL (targs
, i
));
12338 SET_TMPL_ARGS_LEVEL (partial_args
,
12339 TMPL_ARGS_DEPTH (targs
),
12340 make_tree_vec (DECL_NTPARMS (tmpl
)));
12342 /* Disable access control as this function is used only during
12344 save_access_control
= flag_access_control
;
12345 flag_access_control
= 0;
12347 ++processing_template_decl
;
12348 /* Now, do the (partial) substitution to figure out the
12349 appropriate function type. */
12350 fn_type
= tsubst (fn_type
, partial_args
, tf_error
, NULL_TREE
);
12351 --processing_template_decl
;
12353 /* Substitute into the template parameters to obtain the real
12354 innermost set of parameters. This step is important if the
12355 innermost set of template parameters contains value
12356 parameters whose types depend on outer template parameters. */
12357 TREE_VEC_LENGTH (partial_args
)--;
12358 tparms
= tsubst_template_parms (tparms
, partial_args
, tf_error
);
12360 flag_access_control
= save_access_control
;
12366 /* Return truthvalue if we're processing a template different from
12367 the last one involved in diagnostics. */
12369 problematic_instantiation_changed (void)
12371 return last_template_error_tick
!= tinst_level_tick
;
12374 /* Remember current template involved in diagnostics. */
12376 record_last_problematic_instantiation (void)
12378 last_template_error_tick
= tinst_level_tick
;
12382 current_instantiation (void)
12384 return current_tinst_level
;
12387 /* [temp.param] Check that template non-type parm TYPE is of an allowable
12388 type. Return zero for ok, nonzero for disallowed. Issue error and
12389 warning messages under control of COMPLAIN. */
12392 invalid_nontype_parm_type_p (tree type
, tsubst_flags_t complain
)
12394 if (INTEGRAL_TYPE_P (type
))
12396 else if (POINTER_TYPE_P (type
))
12398 else if (TYPE_PTR_TO_MEMBER_P (type
))
12400 else if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
)
12402 else if (TREE_CODE (type
) == TYPENAME_TYPE
)
12405 if (complain
& tf_error
)
12406 error ("%q#T is not a valid type for a template constant parameter", type
);
12410 /* Returns TRUE if TYPE is dependent, in the sense of [temp.dep.type].
12411 Assumes that TYPE really is a type, and not the ERROR_MARK_NODE.*/
12414 dependent_type_p_r (tree type
)
12420 A type is dependent if it is:
12422 -- a template parameter. Template template parameters are types
12423 for us (since TYPE_P holds true for them) so we handle
12425 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
12426 || TREE_CODE (type
) == TEMPLATE_TEMPLATE_PARM
)
12428 /* -- a qualified-id with a nested-name-specifier which contains a
12429 class-name that names a dependent type or whose unqualified-id
12430 names a dependent type. */
12431 if (TREE_CODE (type
) == TYPENAME_TYPE
)
12433 /* -- a cv-qualified type where the cv-unqualified type is
12435 type
= TYPE_MAIN_VARIANT (type
);
12436 /* -- a compound type constructed from any dependent type. */
12437 if (TYPE_PTR_TO_MEMBER_P (type
))
12438 return (dependent_type_p (TYPE_PTRMEM_CLASS_TYPE (type
))
12439 || dependent_type_p (TYPE_PTRMEM_POINTED_TO_TYPE
12441 else if (TREE_CODE (type
) == POINTER_TYPE
12442 || TREE_CODE (type
) == REFERENCE_TYPE
)
12443 return dependent_type_p (TREE_TYPE (type
));
12444 else if (TREE_CODE (type
) == FUNCTION_TYPE
12445 || TREE_CODE (type
) == METHOD_TYPE
)
12449 if (dependent_type_p (TREE_TYPE (type
)))
12451 for (arg_type
= TYPE_ARG_TYPES (type
);
12453 arg_type
= TREE_CHAIN (arg_type
))
12454 if (dependent_type_p (TREE_VALUE (arg_type
)))
12458 /* -- an array type constructed from any dependent type or whose
12459 size is specified by a constant expression that is
12460 value-dependent. */
12461 if (TREE_CODE (type
) == ARRAY_TYPE
)
12463 if (TYPE_DOMAIN (type
)
12464 && ((value_dependent_expression_p
12465 (TYPE_MAX_VALUE (TYPE_DOMAIN (type
))))
12466 || (type_dependent_expression_p
12467 (TYPE_MAX_VALUE (TYPE_DOMAIN (type
))))))
12469 return dependent_type_p (TREE_TYPE (type
));
12472 /* -- a template-id in which either the template name is a template
12474 if (TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
12476 /* ... or any of the template arguments is a dependent type or
12477 an expression that is type-dependent or value-dependent. */
12478 else if (CLASS_TYPE_P (type
) && CLASSTYPE_TEMPLATE_INFO (type
)
12479 && (any_dependent_template_arguments_p
12480 (INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type
)))))
12483 /* All TYPEOF_TYPEs are dependent; if the argument of the `typeof'
12484 expression is not type-dependent, then it should already been
12486 if (TREE_CODE (type
) == TYPEOF_TYPE
)
12489 /* The standard does not specifically mention types that are local
12490 to template functions or local classes, but they should be
12491 considered dependent too. For example:
12493 template <int I> void f() {
12498 The size of `E' cannot be known until the value of `I' has been
12499 determined. Therefore, `E' must be considered dependent. */
12500 scope
= TYPE_CONTEXT (type
);
12501 if (scope
&& TYPE_P (scope
))
12502 return dependent_type_p (scope
);
12503 else if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
)
12504 return type_dependent_expression_p (scope
);
12506 /* Other types are non-dependent. */
12510 /* Returns TRUE if TYPE is dependent, in the sense of
12511 [temp.dep.type]. */
12514 dependent_type_p (tree type
)
12516 /* If there are no template parameters in scope, then there can't be
12517 any dependent types. */
12518 if (!processing_template_decl
)
12520 /* If we are not processing a template, then nobody should be
12521 providing us with a dependent type. */
12523 gcc_assert (TREE_CODE (type
) != TEMPLATE_TYPE_PARM
);
12527 /* If the type is NULL, we have not computed a type for the entity
12528 in question; in that case, the type is dependent. */
12532 /* Erroneous types can be considered non-dependent. */
12533 if (type
== error_mark_node
)
12536 /* If we have not already computed the appropriate value for TYPE,
12538 if (!TYPE_DEPENDENT_P_VALID (type
))
12540 TYPE_DEPENDENT_P (type
) = dependent_type_p_r (type
);
12541 TYPE_DEPENDENT_P_VALID (type
) = 1;
12544 return TYPE_DEPENDENT_P (type
);
12547 /* Returns TRUE if EXPRESSION is dependent, according to CRITERION. */
12550 dependent_scope_ref_p (tree expression
, bool criterion (tree
))
12555 gcc_assert (TREE_CODE (expression
) == SCOPE_REF
);
12557 if (!TYPE_P (TREE_OPERAND (expression
, 0)))
12560 scope
= TREE_OPERAND (expression
, 0);
12561 name
= TREE_OPERAND (expression
, 1);
12565 An id-expression is type-dependent if it contains a
12566 nested-name-specifier that contains a class-name that names a
12568 /* The suggested resolution to Core Issue 2 implies that if the
12569 qualifying type is the current class, then we must peek
12572 && currently_open_class (scope
)
12573 && !criterion (name
))
12575 if (dependent_type_p (scope
))
12581 /* Returns TRUE if the EXPRESSION is value-dependent, in the sense of
12582 [temp.dep.constexpr]. EXPRESSION is already known to be a constant
12586 value_dependent_expression_p (tree expression
)
12588 if (!processing_template_decl
)
12591 /* A name declared with a dependent type. */
12592 if (DECL_P (expression
) && type_dependent_expression_p (expression
))
12595 switch (TREE_CODE (expression
))
12597 case IDENTIFIER_NODE
:
12598 /* A name that has not been looked up -- must be dependent. */
12601 case TEMPLATE_PARM_INDEX
:
12602 /* A non-type template parm. */
12606 /* A non-type template parm. */
12607 if (DECL_TEMPLATE_PARM_P (expression
))
12612 /* A constant with integral or enumeration type and is initialized
12613 with an expression that is value-dependent. */
12614 if (DECL_INITIAL (expression
)
12615 && INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (expression
))
12616 && value_dependent_expression_p (DECL_INITIAL (expression
)))
12620 case DYNAMIC_CAST_EXPR
:
12621 case STATIC_CAST_EXPR
:
12622 case CONST_CAST_EXPR
:
12623 case REINTERPRET_CAST_EXPR
:
12625 /* These expressions are value-dependent if the type to which
12626 the cast occurs is dependent or the expression being casted
12627 is value-dependent. */
12629 tree type
= TREE_TYPE (expression
);
12631 if (dependent_type_p (type
))
12634 /* A functional cast has a list of operands. */
12635 expression
= TREE_OPERAND (expression
, 0);
12638 /* If there are no operands, it must be an expression such
12639 as "int()". This should not happen for aggregate types
12640 because it would form non-constant expressions. */
12641 gcc_assert (INTEGRAL_OR_ENUMERATION_TYPE_P (type
));
12646 if (TREE_CODE (expression
) == TREE_LIST
)
12648 for (; expression
; expression
= TREE_CHAIN (expression
))
12649 if (value_dependent_expression_p (TREE_VALUE (expression
)))
12654 return value_dependent_expression_p (expression
);
12659 /* A `sizeof' expression is value-dependent if the operand is
12661 expression
= TREE_OPERAND (expression
, 0);
12662 if (TYPE_P (expression
))
12663 return dependent_type_p (expression
);
12664 return type_dependent_expression_p (expression
);
12667 return dependent_scope_ref_p (expression
, value_dependent_expression_p
);
12669 case COMPONENT_REF
:
12670 return (value_dependent_expression_p (TREE_OPERAND (expression
, 0))
12671 || value_dependent_expression_p (TREE_OPERAND (expression
, 1)));
12674 /* A CALL_EXPR may appear in a constant expression if it is a
12675 call to a builtin function, e.g., __builtin_constant_p. All
12676 such calls are value-dependent. */
12680 /* A constant expression is value-dependent if any subexpression is
12681 value-dependent. */
12682 switch (TREE_CODE_CLASS (TREE_CODE (expression
)))
12684 case tcc_reference
:
12686 return (value_dependent_expression_p
12687 (TREE_OPERAND (expression
, 0)));
12689 case tcc_comparison
:
12691 return ((value_dependent_expression_p
12692 (TREE_OPERAND (expression
, 0)))
12693 || (value_dependent_expression_p
12694 (TREE_OPERAND (expression
, 1))));
12696 case tcc_expression
:
12699 for (i
= 0; i
< TREE_CODE_LENGTH (TREE_CODE (expression
)); ++i
)
12700 /* In some cases, some of the operands may be missing.
12701 (For example, in the case of PREDECREMENT_EXPR, the
12702 amount to increment by may be missing.) That doesn't
12703 make the expression dependent. */
12704 if (TREE_OPERAND (expression
, i
)
12705 && (value_dependent_expression_p
12706 (TREE_OPERAND (expression
, i
))))
12716 /* The expression is not value-dependent. */
12720 /* Returns TRUE if the EXPRESSION is type-dependent, in the sense of
12721 [temp.dep.expr]. */
12724 type_dependent_expression_p (tree expression
)
12726 if (!processing_template_decl
)
12729 if (expression
== error_mark_node
)
12732 /* An unresolved name is always dependent. */
12733 if (TREE_CODE (expression
) == IDENTIFIER_NODE
)
12736 /* Some expression forms are never type-dependent. */
12737 if (TREE_CODE (expression
) == PSEUDO_DTOR_EXPR
12738 || TREE_CODE (expression
) == SIZEOF_EXPR
12739 || TREE_CODE (expression
) == ALIGNOF_EXPR
12740 || TREE_CODE (expression
) == TYPEID_EXPR
12741 || TREE_CODE (expression
) == DELETE_EXPR
12742 || TREE_CODE (expression
) == VEC_DELETE_EXPR
12743 || TREE_CODE (expression
) == THROW_EXPR
)
12746 /* The types of these expressions depends only on the type to which
12747 the cast occurs. */
12748 if (TREE_CODE (expression
) == DYNAMIC_CAST_EXPR
12749 || TREE_CODE (expression
) == STATIC_CAST_EXPR
12750 || TREE_CODE (expression
) == CONST_CAST_EXPR
12751 || TREE_CODE (expression
) == REINTERPRET_CAST_EXPR
12752 || TREE_CODE (expression
) == CAST_EXPR
)
12753 return dependent_type_p (TREE_TYPE (expression
));
12755 /* The types of these expressions depends only on the type created
12756 by the expression. */
12757 if (TREE_CODE (expression
) == NEW_EXPR
12758 || TREE_CODE (expression
) == VEC_NEW_EXPR
)
12760 /* For NEW_EXPR tree nodes created inside a template, either
12761 the object type itself or a TREE_LIST may appear as the
12763 tree type
= TREE_OPERAND (expression
, 1);
12764 if (TREE_CODE (type
) == TREE_LIST
)
12765 /* This is an array type. We need to check array dimensions
12767 return dependent_type_p (TREE_VALUE (TREE_PURPOSE (type
)))
12768 || value_dependent_expression_p
12769 (TREE_OPERAND (TREE_VALUE (type
), 1));
12771 return dependent_type_p (type
);
12774 if (TREE_CODE (expression
) == SCOPE_REF
12775 && dependent_scope_ref_p (expression
,
12776 type_dependent_expression_p
))
12779 if (TREE_CODE (expression
) == FUNCTION_DECL
12780 && DECL_LANG_SPECIFIC (expression
)
12781 && DECL_TEMPLATE_INFO (expression
)
12782 && (any_dependent_template_arguments_p
12783 (INNERMOST_TEMPLATE_ARGS (DECL_TI_ARGS (expression
)))))
12786 if (TREE_CODE (expression
) == TEMPLATE_DECL
12787 && !DECL_TEMPLATE_TEMPLATE_PARM_P (expression
))
12790 if (TREE_TYPE (expression
) == unknown_type_node
)
12792 if (TREE_CODE (expression
) == ADDR_EXPR
)
12793 return type_dependent_expression_p (TREE_OPERAND (expression
, 0));
12794 if (TREE_CODE (expression
) == COMPONENT_REF
12795 || TREE_CODE (expression
) == OFFSET_REF
)
12797 if (type_dependent_expression_p (TREE_OPERAND (expression
, 0)))
12799 expression
= TREE_OPERAND (expression
, 1);
12800 if (TREE_CODE (expression
) == IDENTIFIER_NODE
)
12803 /* SCOPE_REF with non-null TREE_TYPE is always non-dependent. */
12804 if (TREE_CODE (expression
) == SCOPE_REF
)
12807 if (TREE_CODE (expression
) == BASELINK
)
12808 expression
= BASELINK_FUNCTIONS (expression
);
12810 if (TREE_CODE (expression
) == TEMPLATE_ID_EXPR
)
12812 if (any_dependent_template_arguments_p
12813 (TREE_OPERAND (expression
, 1)))
12815 expression
= TREE_OPERAND (expression
, 0);
12817 gcc_assert (TREE_CODE (expression
) == OVERLOAD
12818 || TREE_CODE (expression
) == FUNCTION_DECL
);
12822 if (type_dependent_expression_p (OVL_CURRENT (expression
)))
12824 expression
= OVL_NEXT (expression
);
12829 gcc_assert (TREE_CODE (expression
) != TYPE_DECL
);
12831 return (dependent_type_p (TREE_TYPE (expression
)));
12834 /* Returns TRUE if ARGS (a TREE_LIST of arguments to a function call)
12835 contains a type-dependent expression. */
12838 any_type_dependent_arguments_p (tree args
)
12842 tree arg
= TREE_VALUE (args
);
12844 if (type_dependent_expression_p (arg
))
12846 args
= TREE_CHAIN (args
);
12851 /* Returns TRUE if the ARG (a template argument) is dependent. */
12854 dependent_template_arg_p (tree arg
)
12856 if (!processing_template_decl
)
12859 if (TREE_CODE (arg
) == TEMPLATE_DECL
12860 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
12861 return dependent_template_p (arg
);
12862 else if (TYPE_P (arg
))
12863 return dependent_type_p (arg
);
12865 return (type_dependent_expression_p (arg
)
12866 || value_dependent_expression_p (arg
));
12869 /* Returns true if ARGS (a collection of template arguments) contains
12870 any dependent arguments. */
12873 any_dependent_template_arguments_p (tree args
)
12880 if (args
== error_mark_node
)
12883 for (i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
12885 tree level
= TMPL_ARGS_LEVEL (args
, i
+ 1);
12886 for (j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
12887 if (dependent_template_arg_p (TREE_VEC_ELT (level
, j
)))
12894 /* Returns TRUE if the template TMPL is dependent. */
12897 dependent_template_p (tree tmpl
)
12899 if (TREE_CODE (tmpl
) == OVERLOAD
)
12903 if (dependent_template_p (OVL_FUNCTION (tmpl
)))
12905 tmpl
= OVL_CHAIN (tmpl
);
12910 /* Template template parameters are dependent. */
12911 if (DECL_TEMPLATE_TEMPLATE_PARM_P (tmpl
)
12912 || TREE_CODE (tmpl
) == TEMPLATE_TEMPLATE_PARM
)
12914 /* So are names that have not been looked up. */
12915 if (TREE_CODE (tmpl
) == SCOPE_REF
12916 || TREE_CODE (tmpl
) == IDENTIFIER_NODE
)
12918 /* So are member templates of dependent classes. */
12919 if (TYPE_P (CP_DECL_CONTEXT (tmpl
)))
12920 return dependent_type_p (DECL_CONTEXT (tmpl
));
12924 /* Returns TRUE if the specialization TMPL<ARGS> is dependent. */
12927 dependent_template_id_p (tree tmpl
, tree args
)
12929 return (dependent_template_p (tmpl
)
12930 || any_dependent_template_arguments_p (args
));
12933 /* TYPE is a TYPENAME_TYPE. Returns the ordinary TYPE to which the
12934 TYPENAME_TYPE corresponds. Returns ERROR_MARK_NODE if no such TYPE
12935 can be found. Note that this function peers inside uninstantiated
12936 templates and therefore should be used only in extremely limited
12937 situations. ONLY_CURRENT_P restricts this peering to the currently
12938 open classes hierarchy (which is required when comparing types). */
12941 resolve_typename_type (tree type
, bool only_current_p
)
12949 gcc_assert (TREE_CODE (type
) == TYPENAME_TYPE
);
12951 scope
= TYPE_CONTEXT (type
);
12952 name
= TYPE_IDENTIFIER (type
);
12954 /* If the SCOPE is itself a TYPENAME_TYPE, then we need to resolve
12955 it first before we can figure out what NAME refers to. */
12956 if (TREE_CODE (scope
) == TYPENAME_TYPE
)
12957 scope
= resolve_typename_type (scope
, only_current_p
);
12958 /* If we don't know what SCOPE refers to, then we cannot resolve the
12960 if (scope
== error_mark_node
|| TREE_CODE (scope
) == TYPENAME_TYPE
)
12961 return error_mark_node
;
12962 /* If the SCOPE is a template type parameter, we have no way of
12963 resolving the name. */
12964 if (TREE_CODE (scope
) == TEMPLATE_TYPE_PARM
)
12966 /* If the SCOPE is not the current instantiation, there's no reason
12967 to look inside it. */
12968 if (only_current_p
&& !currently_open_class (scope
))
12969 return error_mark_node
;
12970 /* If SCOPE is a partial instantiation, it will not have a valid
12971 TYPE_FIELDS list, so use the original template. */
12972 scope
= CLASSTYPE_PRIMARY_TEMPLATE_TYPE (scope
);
12973 /* Enter the SCOPE so that name lookup will be resolved as if we
12974 were in the class definition. In particular, SCOPE will no
12975 longer be considered a dependent type. */
12976 pushed_scope
= push_scope (scope
);
12977 /* Look up the declaration. */
12978 decl
= lookup_member (scope
, name
, /*protect=*/0, /*want_type=*/true);
12979 /* Obtain the set of qualifiers applied to the TYPE. */
12980 quals
= cp_type_quals (type
);
12981 /* For a TYPENAME_TYPE like "typename X::template Y<T>", we want to
12982 find a TEMPLATE_DECL. Otherwise, we want to find a TYPE_DECL. */
12984 type
= error_mark_node
;
12985 else if (TREE_CODE (TYPENAME_TYPE_FULLNAME (type
)) == IDENTIFIER_NODE
12986 && TREE_CODE (decl
) == TYPE_DECL
)
12987 type
= TREE_TYPE (decl
);
12988 else if (TREE_CODE (TYPENAME_TYPE_FULLNAME (type
)) == TEMPLATE_ID_EXPR
12989 && DECL_CLASS_TEMPLATE_P (decl
))
12993 /* Obtain the template and the arguments. */
12994 tmpl
= TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type
), 0);
12995 args
= TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type
), 1);
12996 /* Instantiate the template. */
12997 type
= lookup_template_class (tmpl
, args
, NULL_TREE
, NULL_TREE
,
12998 /*entering_scope=*/0, tf_error
| tf_user
);
13001 type
= error_mark_node
;
13002 /* Qualify the resulting type. */
13003 if (type
!= error_mark_node
&& quals
)
13004 type
= cp_build_qualified_type (type
, quals
);
13005 /* Leave the SCOPE. */
13007 pop_scope (pushed_scope
);
13012 /* EXPR is an expression which is not type-dependent. Return a proxy
13013 for EXPR that can be used to compute the types of larger
13014 expressions containing EXPR. */
13017 build_non_dependent_expr (tree expr
)
13021 /* Preserve null pointer constants so that the type of things like
13022 "p == 0" where "p" is a pointer can be determined. */
13023 if (null_ptr_cst_p (expr
))
13025 /* Preserve OVERLOADs; the functions must be available to resolve
13028 if (TREE_CODE (inner_expr
) == ADDR_EXPR
)
13029 inner_expr
= TREE_OPERAND (inner_expr
, 0);
13030 if (TREE_CODE (inner_expr
) == COMPONENT_REF
)
13031 inner_expr
= TREE_OPERAND (inner_expr
, 1);
13032 if (is_overloaded_fn (inner_expr
)
13033 || TREE_CODE (inner_expr
) == OFFSET_REF
)
13035 /* There is no need to return a proxy for a variable. */
13036 if (TREE_CODE (expr
) == VAR_DECL
)
13038 /* Preserve string constants; conversions from string constants to
13039 "char *" are allowed, even though normally a "const char *"
13040 cannot be used to initialize a "char *". */
13041 if (TREE_CODE (expr
) == STRING_CST
)
13043 /* Preserve arithmetic constants, as an optimization -- there is no
13044 reason to create a new node. */
13045 if (TREE_CODE (expr
) == INTEGER_CST
|| TREE_CODE (expr
) == REAL_CST
)
13047 /* Preserve THROW_EXPRs -- all throw-expressions have type "void".
13048 There is at least one place where we want to know that a
13049 particular expression is a throw-expression: when checking a ?:
13050 expression, there are special rules if the second or third
13051 argument is a throw-expression. */
13052 if (TREE_CODE (expr
) == THROW_EXPR
)
13055 if (TREE_CODE (expr
) == COND_EXPR
)
13056 return build3 (COND_EXPR
,
13058 TREE_OPERAND (expr
, 0),
13059 (TREE_OPERAND (expr
, 1)
13060 ? build_non_dependent_expr (TREE_OPERAND (expr
, 1))
13061 : build_non_dependent_expr (TREE_OPERAND (expr
, 0))),
13062 build_non_dependent_expr (TREE_OPERAND (expr
, 2)));
13063 if (TREE_CODE (expr
) == COMPOUND_EXPR
13064 && !COMPOUND_EXPR_OVERLOADED (expr
))
13065 return build2 (COMPOUND_EXPR
,
13067 TREE_OPERAND (expr
, 0),
13068 build_non_dependent_expr (TREE_OPERAND (expr
, 1)));
13070 /* If the type is unknown, it can't really be non-dependent */
13071 gcc_assert (TREE_TYPE (expr
) != unknown_type_node
);
13073 /* Otherwise, build a NON_DEPENDENT_EXPR.
13075 REFERENCE_TYPEs are not stripped for expressions in templates
13076 because doing so would play havoc with mangling. Consider, for
13079 template <typename T> void f<T& g>() { g(); }
13081 In the body of "f", the expression for "g" will have
13082 REFERENCE_TYPE, even though the standard says that it should
13083 not. The reason is that we must preserve the syntactic form of
13084 the expression so that mangling (say) "f<g>" inside the body of
13085 "f" works out correctly. Therefore, the REFERENCE_TYPE is
13087 return build1 (NON_DEPENDENT_EXPR
, non_reference (TREE_TYPE (expr
)), expr
);
13090 /* ARGS is a TREE_LIST of expressions as arguments to a function call.
13091 Return a new TREE_LIST with the various arguments replaced with
13092 equivalent non-dependent expressions. */
13095 build_non_dependent_args (tree args
)
13100 new_args
= NULL_TREE
;
13101 for (a
= args
; a
; a
= TREE_CHAIN (a
))
13102 new_args
= tree_cons (NULL_TREE
,
13103 build_non_dependent_expr (TREE_VALUE (a
)),
13105 return nreverse (new_args
);
13108 #include "gt-cp-pt.h"