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)
339 tree parm = TREE_VALUE (TREE_VEC_ELT (parms, i));
340 gcc_assert (DECL_P (parm));
342 switch (TREE_CODE (parm))
351 /* Make a CONST_DECL as is done in process_template_parm.
352 It is ugly that we recreate this here; the original
353 version built in process_template_parm is no longer
355 tree decl = build_decl (CONST_DECL, DECL_NAME (parm),
357 DECL_ARTIFICIAL (decl) = 1;
358 TREE_CONSTANT (decl) = 1;
359 TREE_INVARIANT (decl) = 1;
360 TREE_READONLY (decl) = 1;
361 DECL_INITIAL (decl) = DECL_INITIAL (parm);
362 SET_DECL_TEMPLATE_PARM_P (decl);
373 /* Restore the template parameter context for a member template or
374 a friend template defined in a class definition. */
377 maybe_begin_member_template_processing (tree decl)
382 if (inline_needs_template_parms (decl))
384 parms = DECL_TEMPLATE_PARMS (most_general_template (decl));
385 levels = TMPL_PARMS_DEPTH (parms) - processing_template_decl;
387 if (DECL_TEMPLATE_SPECIALIZATION (decl))
390 parms = TREE_CHAIN (parms);
393 push_inline_template_parms_recursive (parms, levels);
396 /* Remember how many levels of template parameters we pushed so that
397 we can pop them later. */
398 VEC_safe_push (int, heap, inline_parm_levels, levels);
401 /* Undo the effects of maybe_begin_member_template_processing. */
404 maybe_end_member_template_processing (void)
409 if (VEC_length (int, inline_parm_levels) == 0)
412 last = VEC_pop (int, inline_parm_levels);
413 for (i = 0; i < last; ++i)
415 --processing_template_decl;
416 current_template_parms = TREE_CHAIN (current_template_parms);
421 /* Return a new template argument vector which contains all of ARGS,
422 but has as its innermost set of arguments the EXTRA_ARGS. */
425 add_to_template_args (tree args, tree extra_args)
432 extra_depth = TMPL_ARGS_DEPTH (extra_args);
433 new_args = make_tree_vec (TMPL_ARGS_DEPTH (args) + extra_depth);
435 for (i = 1; i <= TMPL_ARGS_DEPTH (args); ++i)
436 SET_TMPL_ARGS_LEVEL (new_args, i, TMPL_ARGS_LEVEL (args, i));
438 for (j = 1; j <= extra_depth; ++j, ++i)
439 SET_TMPL_ARGS_LEVEL (new_args, i, TMPL_ARGS_LEVEL (extra_args, j));
444 /* Like add_to_template_args, but only the outermost ARGS are added to
445 the EXTRA_ARGS. In particular, all but TMPL_ARGS_DEPTH
446 (EXTRA_ARGS) levels are added. This function is used to combine
447 the template arguments from a partial instantiation with the
448 template arguments used to attain the full instantiation from the
449 partial instantiation. */
452 add_outermost_template_args (tree args, tree extra_args)
456 /* If there are more levels of EXTRA_ARGS than there are ARGS,
457 something very fishy is going on. */
458 gcc_assert (TMPL_ARGS_DEPTH (args) >= TMPL_ARGS_DEPTH (extra_args));
460 /* If *all* the new arguments will be the EXTRA_ARGS, just return
462 if (TMPL_ARGS_DEPTH (args) == TMPL_ARGS_DEPTH (extra_args))
465 /* For the moment, we make ARGS look like it contains fewer levels. */
466 TREE_VEC_LENGTH (args) -= TMPL_ARGS_DEPTH (extra_args);
468 new_args = add_to_template_args (args, extra_args);
470 /* Now, we restore ARGS to its full dimensions. */
471 TREE_VEC_LENGTH (args) += TMPL_ARGS_DEPTH (extra_args);
476 /* Return the N levels of innermost template arguments from the ARGS. */
479 get_innermost_template_args (tree args, int n)
487 /* If N is 1, just return the innermost set of template arguments. */
489 return TMPL_ARGS_LEVEL (args, TMPL_ARGS_DEPTH (args));
491 /* If we're not removing anything, just return the arguments we were
493 extra_levels = TMPL_ARGS_DEPTH (args) - n;
494 gcc_assert (extra_levels >= 0);
495 if (extra_levels == 0)
498 /* Make a new set of arguments, not containing the outer arguments. */
499 new_args = make_tree_vec (n);
500 for (i = 1; i <= n; ++i)
501 SET_TMPL_ARGS_LEVEL (new_args, i,
502 TMPL_ARGS_LEVEL (args, i + extra_levels));
507 /* We've got a template header coming up; push to a new level for storing
511 begin_template_parm_list (void)
513 /* We use a non-tag-transparent scope here, which causes pushtag to
514 put tags in this scope, rather than in the enclosing class or
515 namespace scope. This is the right thing, since we want
516 TEMPLATE_DECLS, and not TYPE_DECLS for template classes. For a
517 global template class, push_template_decl handles putting the
518 TEMPLATE_DECL into top-level scope. For a nested template class,
521 template <class T> struct S1 {
522 template <class T> struct S2 {};
525 pushtag contains special code to call pushdecl_with_scope on the
526 TEMPLATE_DECL for S2. */
527 begin_scope (sk_template_parms, NULL);
528 ++processing_template_decl;
529 ++processing_template_parmlist;
530 note_template_header (0);
533 /* This routine is called when a specialization is declared. If it is
534 invalid to declare a specialization here, an error is reported. */
537 check_specialization_scope (void)
539 tree scope = current_scope ();
543 An explicit specialization shall be declared in the namespace of
544 which the template is a member, or, for member templates, in the
545 namespace of which the enclosing class or enclosing class
546 template is a member. An explicit specialization of a member
547 function, member class or static data member of a class template
548 shall be declared in the namespace of which the class template
550 if (scope && TREE_CODE (scope) != NAMESPACE_DECL)
551 error ("explicit specialization in non-namespace scope %qD", scope);
555 In an explicit specialization declaration for a member of a class
556 template or a member template that appears in namespace scope,
557 the member template and some of its enclosing class templates may
558 remain unspecialized, except that the declaration shall not
559 explicitly specialize a class member template if its enclosing
560 class templates are not explicitly specialized as well. */
561 if (current_template_parms)
562 error ("enclosing class templates are not explicitly specialized");
565 /* We've just seen template <>. */
568 begin_specialization (void)
570 begin_scope (sk_template_spec, NULL);
571 note_template_header (1);
572 check_specialization_scope ();
575 /* Called at then end of processing a declaration preceded by
579 end_specialization (void)
582 reset_specialization ();
585 /* Any template <>'s that we have seen thus far are not referring to a
586 function specialization. */
589 reset_specialization (void)
591 processing_specialization = 0;
592 template_header_count = 0;
595 /* We've just seen a template header. If SPECIALIZATION is nonzero,
596 it was of the form template <>. */
599 note_template_header (int specialization)
601 processing_specialization = specialization;
602 template_header_count++;
605 /* We're beginning an explicit instantiation. */
608 begin_explicit_instantiation (void)
610 gcc_assert (!processing_explicit_instantiation);
611 processing_explicit_instantiation = true;
616 end_explicit_instantiation (void)
618 gcc_assert (processing_explicit_instantiation);
619 processing_explicit_instantiation = false;
622 /* An explicit specialization or partial specialization TMPL is being
623 declared. Check that the namespace in which the specialization is
624 occurring is permissible. Returns false iff it is invalid to
625 specialize TMPL in the current namespace. */
628 check_specialization_namespace (tree tmpl)
630 tree tpl_ns = decl_namespace_context (tmpl);
634 An explicit specialization shall be declared in the namespace of
635 which the template is a member, or, for member templates, in the
636 namespace of which the enclosing class or enclosing class
637 template is a member. An explicit specialization of a member
638 function, member class or static data member of a class template
639 shall be declared in the namespace of which the class template is
641 if (is_associated_namespace (current_namespace, tpl_ns))
642 /* Same or super-using namespace. */
646 pedwarn ("specialization of %qD in different namespace", tmpl);
647 pedwarn (" from definition of %q+#D", tmpl);
652 /* SPEC is an explicit instantiation. Check that it is valid to
653 perform this explicit instantiation in the current namespace. */
656 check_explicit_instantiation_namespace (tree spec)
660 /* DR 275: An explicit instantiation shall appear in an enclosing
661 namespace of its template. */
662 ns = decl_namespace_context (spec);
663 if (!is_ancestor (current_namespace, ns))
664 pedwarn ("explicit instantiation of %qD in namespace %qD "
665 "(which does not enclose namespace %qD)",
666 spec, current_namespace, ns);
669 /* The TYPE is being declared. If it is a template type, that means it
670 is a partial specialization. Do appropriate error-checking. */
673 maybe_process_partial_specialization (tree type)
677 if (type == error_mark_node)
680 context = TYPE_CONTEXT (type);
682 if (CLASS_TYPE_P (type) && CLASSTYPE_USE_TEMPLATE (type))
684 /* This is for ordinary explicit specialization and partial
685 specialization of a template class such as:
687 template <> class C<int>;
691 template <class T> class C<T*>;
693 Make sure that `C<int>' and `C<T*>' are implicit instantiations. */
695 if (CLASSTYPE_IMPLICIT_INSTANTIATION (type)
696 && !COMPLETE_TYPE_P (type))
698 check_specialization_namespace (CLASSTYPE_TI_TEMPLATE (type));
699 SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (type);
700 if (processing_template_decl)
701 push_template_decl (TYPE_MAIN_DECL (type));
703 else if (CLASSTYPE_TEMPLATE_INSTANTIATION (type))
704 error ("specialization of %qT after instantiation", type);
706 else if (CLASS_TYPE_P (type)
707 && !CLASSTYPE_USE_TEMPLATE (type)
708 && CLASSTYPE_TEMPLATE_INFO (type)
709 && context && CLASS_TYPE_P (context)
710 && CLASSTYPE_TEMPLATE_INFO (context))
712 /* This is for an explicit specialization of member class
713 template according to [temp.expl.spec/18]:
715 template <> template <class U> class C<int>::D;
717 The context `C<int>' must be an implicit instantiation.
718 Otherwise this is just a member class template declared
721 template <> class C<int> { template <class U> class D; };
722 template <> template <class U> class C<int>::D;
724 In the first case, `C<int>::D' is a specialization of `C<T>::D'
725 while in the second case, `C<int>::D' is a primary template
726 and `C<T>::D' may not exist. */
728 if (CLASSTYPE_IMPLICIT_INSTANTIATION (context)
729 && !COMPLETE_TYPE_P (type))
733 if (current_namespace
734 != decl_namespace_context (CLASSTYPE_TI_TEMPLATE (type)))
736 pedwarn ("specializing %q#T in different namespace", type);
737 pedwarn (" from definition of %q+#D",
738 CLASSTYPE_TI_TEMPLATE (type));
741 /* Check for invalid specialization after instantiation:
743 template <> template <> class C<int>::D<int>;
744 template <> template <class U> class C<int>::D; */
746 for (t = DECL_TEMPLATE_INSTANTIATIONS
747 (most_general_template (CLASSTYPE_TI_TEMPLATE (type)));
748 t; t = TREE_CHAIN (t))
749 if (TREE_VALUE (t) != type
750 && TYPE_CONTEXT (TREE_VALUE (t)) == context)
751 error ("specialization %qT after instantiation %qT",
752 type, TREE_VALUE (t));
754 /* Mark TYPE as a specialization. And as a result, we only
755 have one level of template argument for the innermost
757 SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (type);
758 CLASSTYPE_TI_ARGS (type)
759 = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type));
762 else if (processing_specialization)
763 error ("explicit specialization of non-template %qT", type);
766 /* Returns nonzero if we can optimize the retrieval of specializations
767 for TMPL, a TEMPLATE_DECL. In particular, for such a template, we
768 do not use DECL_TEMPLATE_SPECIALIZATIONS at all. */
771 optimize_specialization_lookup_p (tree tmpl)
773 return (DECL_FUNCTION_TEMPLATE_P (tmpl)
774 && DECL_CLASS_SCOPE_P (tmpl)
775 /* DECL_CLASS_SCOPE_P holds of T::f even if T is a template
777 && CLASS_TYPE_P (DECL_CONTEXT (tmpl))
778 /* The optimized lookup depends on the fact that the
779 template arguments for the member function template apply
780 purely to the containing class, which is not true if the
781 containing class is an explicit or partial
783 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (tmpl))
784 && !DECL_MEMBER_TEMPLATE_P (tmpl)
785 && !DECL_CONV_FN_P (tmpl)
786 /* It is possible to have a template that is not a member
787 template and is not a member of a template class:
789 template <typename T>
790 struct S { friend A::f(); };
792 Here, the friend function is a template, but the context does
793 not have template information. The optimized lookup relies
794 on having ARGS be the template arguments for both the class
795 and the function template. */
796 && !DECL_FRIEND_P (DECL_TEMPLATE_RESULT (tmpl)));
799 /* Retrieve the specialization (in the sense of [temp.spec] - a
800 specialization is either an instantiation or an explicit
801 specialization) of TMPL for the given template ARGS. If there is
802 no such specialization, return NULL_TREE. The ARGS are a vector of
803 arguments, or a vector of vectors of arguments, in the case of
804 templates with more than one level of parameters.
806 If TMPL is a type template and CLASS_SPECIALIZATIONS_P is true,
807 then we search for a partial specialization matching ARGS. This
808 parameter is ignored if TMPL is not a class template. */
811 retrieve_specialization (tree tmpl, tree args,
812 bool class_specializations_p)
814 gcc_assert (TREE_CODE (tmpl) == TEMPLATE_DECL);
816 /* There should be as many levels of arguments as there are
817 levels of parameters. */
818 gcc_assert (TMPL_ARGS_DEPTH (args)
819 == TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl)));
821 if (optimize_specialization_lookup_p (tmpl))
824 tree class_specialization;
825 VEC(tree,gc) *methods;
829 /* The template arguments actually apply to the containing
830 class. Find the class specialization with those
832 class_template = CLASSTYPE_TI_TEMPLATE (DECL_CONTEXT (tmpl));
834 = retrieve_specialization (class_template, args,
835 /*class_specializations_p=*/false);
836 if (!class_specialization)
838 /* Now, find the appropriate entry in the CLASSTYPE_METHOD_VEC
839 for the specialization. */
840 idx = class_method_index_for_fn (class_specialization, tmpl);
843 /* Iterate through the methods with the indicated name, looking
844 for the one that has an instance of TMPL. */
845 methods = CLASSTYPE_METHOD_VEC (class_specialization);
846 for (fns = VEC_index (tree, methods, idx); fns; fns = OVL_NEXT (fns))
848 tree fn = OVL_CURRENT (fns);
849 if (DECL_TEMPLATE_INFO (fn) && DECL_TI_TEMPLATE (fn) == tmpl)
859 /* Class templates store their instantiations on the
860 DECL_TEMPLATE_INSTANTIATIONS list; other templates use the
861 DECL_TEMPLATE_SPECIALIZATIONS list. */
862 if (!class_specializations_p
863 && TREE_CODE (DECL_TEMPLATE_RESULT (tmpl)) == TYPE_DECL)
864 sp = &DECL_TEMPLATE_INSTANTIATIONS (tmpl);
866 sp = &DECL_TEMPLATE_SPECIALIZATIONS (tmpl);
868 /* Iterate through the list until we find a matching template. */
869 while (*sp != NULL_TREE)
873 if (comp_template_args (TREE_PURPOSE (spec), args))
875 /* Use the move-to-front heuristic to speed up future
879 *sp = TREE_CHAIN (*sp);
880 TREE_CHAIN (spec) = *head;
883 return TREE_VALUE (spec);
885 sp = &TREE_CHAIN (spec);
892 /* Like retrieve_specialization, but for local declarations. */
895 retrieve_local_specialization (tree tmpl)
897 tree spec = (tree) htab_find_with_hash (local_specializations, tmpl,
898 htab_hash_pointer (tmpl));
899 return spec ? TREE_PURPOSE (spec) : NULL_TREE;
902 /* Returns nonzero iff DECL is a specialization of TMPL. */
905 is_specialization_of (tree decl, tree tmpl)
909 if (TREE_CODE (decl) == FUNCTION_DECL)
913 t = DECL_TEMPLATE_INFO (t) ? DECL_TI_TEMPLATE (t) : NULL_TREE)
919 gcc_assert (TREE_CODE (decl) == TYPE_DECL);
921 for (t = TREE_TYPE (decl);
923 t = CLASSTYPE_USE_TEMPLATE (t)
924 ? TREE_TYPE (CLASSTYPE_TI_TEMPLATE (t)) : NULL_TREE)
925 if (same_type_ignoring_top_level_qualifiers_p (t, TREE_TYPE (tmpl)))
932 /* Returns nonzero iff DECL is a specialization of friend declaration
933 FRIEND according to [temp.friend]. */
936 is_specialization_of_friend (tree decl, tree friend)
938 bool need_template = true;
941 gcc_assert (TREE_CODE (decl) == FUNCTION_DECL
942 || TREE_CODE (decl) == TYPE_DECL);
944 /* For [temp.friend/6] when FRIEND is an ordinary member function
945 of a template class, we want to check if DECL is a specialization
947 if (TREE_CODE (friend) == FUNCTION_DECL
948 && DECL_TEMPLATE_INFO (friend)
949 && !DECL_USE_TEMPLATE (friend))
951 /* We want a TEMPLATE_DECL for `is_specialization_of'. */
952 friend = DECL_TI_TEMPLATE (friend);
953 need_template = false;
955 else if (TREE_CODE (friend) == TEMPLATE_DECL
956 && !PRIMARY_TEMPLATE_P (friend))
957 need_template = false;
959 /* There is nothing to do if this is not a template friend. */
960 if (TREE_CODE (friend) != TEMPLATE_DECL)
963 if (is_specialization_of (decl, friend))
967 A member of a class template may be declared to be a friend of a
968 non-template class. In this case, the corresponding member of
969 every specialization of the class template is a friend of the
970 class granting friendship.
972 For example, given a template friend declaration
974 template <class T> friend void A<T>::f();
976 the member function below is considered a friend
978 template <> struct A<int> {
982 For this type of template friend, TEMPLATE_DEPTH below will be
983 nonzero. To determine if DECL is a friend of FRIEND, we first
984 check if the enclosing class is a specialization of another. */
986 template_depth = template_class_depth (DECL_CONTEXT (friend));
988 && DECL_CLASS_SCOPE_P (decl)
989 && is_specialization_of (TYPE_NAME (DECL_CONTEXT (decl)),
990 CLASSTYPE_TI_TEMPLATE (DECL_CONTEXT (friend))))
992 /* Next, we check the members themselves. In order to handle
993 a few tricky cases, such as when FRIEND's are
995 template <class T> friend void A<T>::g(T t);
996 template <class T> template <T t> friend void A<T>::h();
1000 void A<int>::g(int);
1001 template <int> void A<int>::h();
1003 we need to figure out ARGS, the template arguments from
1004 the context of DECL. This is required for template substitution
1005 of `T' in the function parameter of `g' and template parameter
1006 of `h' in the above examples. Here ARGS corresponds to `int'. */
1008 tree context = DECL_CONTEXT (decl);
1009 tree args = NULL_TREE;
1010 int current_depth = 0;
1012 while (current_depth < template_depth)
1014 if (CLASSTYPE_TEMPLATE_INFO (context))
1016 if (current_depth == 0)
1017 args = TYPE_TI_ARGS (context);
1019 args = add_to_template_args (TYPE_TI_ARGS (context), args);
1022 context = TYPE_CONTEXT (context);
1025 if (TREE_CODE (decl) == FUNCTION_DECL)
1030 tree friend_args_type;
1031 tree decl_args_type;
1033 /* Make sure that both DECL and FRIEND are templates or
1035 is_template = DECL_TEMPLATE_INFO (decl)
1036 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl));
1037 if (need_template ^ is_template)
1039 else if (is_template)
1041 /* If both are templates, check template parameter list. */
1043 = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend),
1045 if (!comp_template_parms
1046 (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (decl)),
1050 decl_type = TREE_TYPE (DECL_TI_TEMPLATE (decl));
1053 decl_type = TREE_TYPE (decl);
1055 friend_type = tsubst_function_type (TREE_TYPE (friend), args,
1056 tf_none, NULL_TREE);
1057 if (friend_type == error_mark_node)
1060 /* Check if return types match. */
1061 if (!same_type_p (TREE_TYPE (decl_type), TREE_TYPE (friend_type)))
1064 /* Check if function parameter types match, ignoring the
1065 `this' parameter. */
1066 friend_args_type = TYPE_ARG_TYPES (friend_type);
1067 decl_args_type = TYPE_ARG_TYPES (decl_type);
1068 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (friend))
1069 friend_args_type = TREE_CHAIN (friend_args_type);
1070 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl))
1071 decl_args_type = TREE_CHAIN (decl_args_type);
1073 return compparms (decl_args_type, friend_args_type);
1077 /* DECL is a TYPE_DECL */
1079 tree decl_type = TREE_TYPE (decl);
1081 /* Make sure that both DECL and FRIEND are templates or
1084 = CLASSTYPE_TEMPLATE_INFO (decl_type)
1085 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (decl_type));
1087 if (need_template ^ is_template)
1089 else if (is_template)
1092 /* If both are templates, check the name of the two
1093 TEMPLATE_DECL's first because is_friend didn't. */
1094 if (DECL_NAME (CLASSTYPE_TI_TEMPLATE (decl_type))
1095 != DECL_NAME (friend))
1098 /* Now check template parameter list. */
1100 = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend),
1102 return comp_template_parms
1103 (DECL_TEMPLATE_PARMS (CLASSTYPE_TI_TEMPLATE (decl_type)),
1107 return (DECL_NAME (decl)
1108 == DECL_NAME (friend));
1114 /* Register the specialization SPEC as a specialization of TMPL with
1115 the indicated ARGS. IS_FRIEND indicates whether the specialization
1116 is actually just a friend declaration. Returns SPEC, or an
1117 equivalent prior declaration, if available. */
1120 register_specialization (tree spec, tree tmpl, tree args, bool is_friend)
1124 gcc_assert (TREE_CODE (tmpl) == TEMPLATE_DECL);
1126 if (TREE_CODE (spec) == FUNCTION_DECL
1127 && uses_template_parms (DECL_TI_ARGS (spec)))
1128 /* This is the FUNCTION_DECL for a partial instantiation. Don't
1129 register it; we want the corresponding TEMPLATE_DECL instead.
1130 We use `uses_template_parms (DECL_TI_ARGS (spec))' rather than
1131 the more obvious `uses_template_parms (spec)' to avoid problems
1132 with default function arguments. In particular, given
1133 something like this:
1135 template <class T> void f(T t1, T t = T())
1137 the default argument expression is not substituted for in an
1138 instantiation unless and until it is actually needed. */
1141 fn = retrieve_specialization (tmpl, args,
1142 /*class_specializations_p=*/false);
1143 /* We can sometimes try to re-register a specialization that we've
1144 already got. In particular, regenerate_decl_from_template calls
1145 duplicate_decls which will update the specialization list. But,
1146 we'll still get called again here anyhow. It's more convenient
1147 to simply allow this than to try to prevent it. */
1150 else if (fn && DECL_TEMPLATE_SPECIALIZATION (spec))
1152 if (DECL_TEMPLATE_INSTANTIATION (fn))
1155 || DECL_EXPLICIT_INSTANTIATION (fn))
1157 error ("specialization of %qD after instantiation",
1164 /* This situation should occur only if the first
1165 specialization is an implicit instantiation, the
1166 second is an explicit specialization, and the
1167 implicit instantiation has not yet been used. That
1168 situation can occur if we have implicitly
1169 instantiated a member function and then specialized
1172 We can also wind up here if a friend declaration that
1173 looked like an instantiation turns out to be a
1176 template <class T> void foo(T);
1177 class S { friend void foo<>(int) };
1178 template <> void foo(int);
1180 We transform the existing DECL in place so that any
1181 pointers to it become pointers to the updated
1184 If there was a definition for the template, but not
1185 for the specialization, we want this to look as if
1186 there were no definition, and vice versa. */
1187 DECL_INITIAL (fn) = NULL_TREE;
1188 duplicate_decls (spec, fn, is_friend);
1189 /* The call to duplicate_decls will have applied
1192 An explicit specialization of a function template
1193 is inline only if it is explicitly declared to be,
1194 and independently of whether its function template
1197 to the primary function; now copy the inline bits to
1198 the various clones. */
1199 FOR_EACH_CLONE (clone, fn)
1201 DECL_DECLARED_INLINE_P (clone)
1202 = DECL_DECLARED_INLINE_P (fn);
1206 check_specialization_namespace (fn);
1211 else if (DECL_TEMPLATE_SPECIALIZATION (fn))
1213 if (!duplicate_decls (spec, fn, is_friend) && DECL_INITIAL (spec))
1214 /* Dup decl failed, but this is a new definition. Set the
1215 line number so any errors match this new
1217 DECL_SOURCE_LOCATION (fn) = DECL_SOURCE_LOCATION (spec);
1223 /* A specialization must be declared in the same namespace as the
1224 template it is specializing. */
1225 if (DECL_TEMPLATE_SPECIALIZATION (spec)
1226 && !check_specialization_namespace (tmpl))
1227 DECL_CONTEXT (spec) = decl_namespace_context (tmpl);
1229 if (!optimize_specialization_lookup_p (tmpl))
1230 DECL_TEMPLATE_SPECIALIZATIONS (tmpl)
1231 = tree_cons (args, spec, DECL_TEMPLATE_SPECIALIZATIONS (tmpl));
1236 /* Unregister the specialization SPEC as a specialization of TMPL.
1237 Replace it with NEW_SPEC, if NEW_SPEC is non-NULL. Returns true
1238 if the SPEC was listed as a specialization of TMPL. */
1241 reregister_specialization (tree spec, tree tmpl, tree new_spec)
1245 for (s = &DECL_TEMPLATE_SPECIALIZATIONS (tmpl);
1247 s = &TREE_CHAIN (*s))
1248 if (TREE_VALUE (*s) == spec)
1251 *s = TREE_CHAIN (*s);
1253 TREE_VALUE (*s) = new_spec;
1260 /* Compare an entry in the local specializations hash table P1 (which
1261 is really a pointer to a TREE_LIST) with P2 (which is really a
1265 eq_local_specializations (const void *p1, const void *p2)
1267 return TREE_VALUE ((tree) p1) == (tree) p2;
1270 /* Hash P1, an entry in the local specializations table. */
1273 hash_local_specialization (const void* p1)
1275 return htab_hash_pointer (TREE_VALUE ((tree) p1));
1278 /* Like register_specialization, but for local declarations. We are
1279 registering SPEC, an instantiation of TMPL. */
1282 register_local_specialization (tree spec, tree tmpl)
1286 slot = htab_find_slot_with_hash (local_specializations, tmpl,
1287 htab_hash_pointer (tmpl), INSERT);
1288 *slot = build_tree_list (spec, tmpl);
1291 /* Print the list of candidate FNS in an error message. */
1294 print_candidates (tree fns)
1298 const char *str = "candidates are:";
1300 for (fn = fns; fn != NULL_TREE; fn = TREE_CHAIN (fn))
1304 for (f = TREE_VALUE (fn); f; f = OVL_NEXT (f))
1305 error ("%s %+#D", str, OVL_CURRENT (f));
1310 /* Returns the template (one of the functions given by TEMPLATE_ID)
1311 which can be specialized to match the indicated DECL with the
1312 explicit template args given in TEMPLATE_ID. The DECL may be
1313 NULL_TREE if none is available. In that case, the functions in
1314 TEMPLATE_ID are non-members.
1316 If NEED_MEMBER_TEMPLATE is nonzero the function is known to be a
1317 specialization of a member template.
1319 The TEMPLATE_COUNT is the number of references to qualifying
1320 template classes that appeared in the name of the function. See
1321 check_explicit_specialization for a more accurate description.
1323 TSK indicates what kind of template declaration (if any) is being
1324 declared. TSK_TEMPLATE indicates that the declaration given by
1325 DECL, though a FUNCTION_DECL, has template parameters, and is
1326 therefore a template function.
1328 The template args (those explicitly specified and those deduced)
1329 are output in a newly created vector *TARGS_OUT.
1331 If it is impossible to determine the result, an error message is
1332 issued. The error_mark_node is returned to indicate failure. */
1335 determine_specialization (tree template_id,
1338 int need_member_template,
1344 tree explicit_targs;
1345 tree candidates = NULL_TREE;
1346 /* A TREE_LIST of templates of which DECL may be a specialization.
1347 The TREE_VALUE of each node is a TEMPLATE_DECL. The
1348 corresponding TREE_PURPOSE is the set of template arguments that,
1349 when used to instantiate the template, would produce a function
1350 with the signature of DECL. */
1351 tree templates = NULL_TREE;
1353 struct cp_binding_level *b;
1355 *targs_out = NULL_TREE;
1357 if (template_id == error_mark_node)
1358 return error_mark_node;
1360 fns = TREE_OPERAND (template_id, 0);
1361 explicit_targs = TREE_OPERAND (template_id, 1);
1363 if (fns == error_mark_node)
1364 return error_mark_node;
1366 /* Check for baselinks. */
1367 if (BASELINK_P (fns))
1368 fns = BASELINK_FUNCTIONS (fns);
1370 if (!is_overloaded_fn (fns))
1372 error ("%qD is not a function template", fns);
1373 return error_mark_node;
1376 /* Count the number of template headers specified for this
1379 for (b = current_binding_level;
1380 b->kind == sk_template_parms;
1384 for (; fns; fns = OVL_NEXT (fns))
1386 tree fn = OVL_CURRENT (fns);
1388 if (TREE_CODE (fn) == TEMPLATE_DECL)
1390 tree decl_arg_types;
1393 /* DECL might be a specialization of FN. */
1395 /* Adjust the type of DECL in case FN is a static member. */
1396 decl_arg_types = TYPE_ARG_TYPES (TREE_TYPE (decl));
1397 if (DECL_STATIC_FUNCTION_P (fn)
1398 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl))
1399 decl_arg_types = TREE_CHAIN (decl_arg_types);
1401 /* Check that the number of function parameters matches.
1403 template <class T> void f(int i = 0);
1404 template <> void f<int>();
1405 The specialization f<int> is invalid but is not caught
1406 by get_bindings below. */
1408 fn_arg_types = TYPE_ARG_TYPES (TREE_TYPE (fn));
1409 if (list_length (fn_arg_types) != list_length (decl_arg_types))
1412 /* For a non-static member function, we need to make sure that
1413 the const qualification is the same. This can be done by
1414 checking the 'this' in the argument list. */
1415 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn)
1416 && !same_type_p (TREE_VALUE (fn_arg_types),
1417 TREE_VALUE (decl_arg_types)))
1420 /* In case of explicit specialization, we need to check if
1421 the number of template headers appearing in the specialization
1422 is correct. This is usually done in check_explicit_specialization,
1423 but the check done there cannot be exhaustive when specializing
1424 member functions. Consider the following code:
1426 template <> void A<int>::f(int);
1427 template <> template <> void A<int>::f(int);
1429 Assuming that A<int> is not itself an explicit specialization
1430 already, the first line specializes "f" which is a non-template
1431 member function, whilst the second line specializes "f" which
1432 is a template member function. So both lines are syntactically
1433 correct, and check_explicit_specialization does not reject
1436 Here, we can do better, as we are matching the specialization
1437 against the declarations. We count the number of template
1438 headers, and we check if they match TEMPLATE_COUNT + 1
1439 (TEMPLATE_COUNT is the number of qualifying template classes,
1440 plus there must be another header for the member template
1443 Notice that if header_count is zero, this is not a
1444 specialization but rather a template instantiation, so there
1445 is no check we can perform here. */
1446 if (header_count && header_count != template_count + 1)
1449 /* Check that the number of template arguments at the
1450 innermost level for DECL is the same as for FN. */
1451 if (current_binding_level->kind == sk_template_parms
1452 && !current_binding_level->explicit_spec_p
1453 && (TREE_VEC_LENGTH (DECL_INNERMOST_TEMPLATE_PARMS (fn))
1454 != TREE_VEC_LENGTH (INNERMOST_TEMPLATE_PARMS
1455 (current_template_parms))))
1458 /* Function templates cannot be specializations; there are
1459 no partial specializations of functions. Therefore, if
1460 the type of DECL does not match FN, there is no
1462 if (tsk == tsk_template)
1464 if (compparms (TYPE_ARG_TYPES (TREE_TYPE (fn)),
1466 candidates = tree_cons (NULL_TREE, fn, candidates);
1470 /* See whether this function might be a specialization of this
1472 targs = get_bindings (fn, decl, explicit_targs, /*check_ret=*/true);
1475 /* We cannot deduce template arguments that when used to
1476 specialize TMPL will produce DECL. */
1479 /* Save this template, and the arguments deduced. */
1480 templates = tree_cons (targs, fn, templates);
1482 else if (need_member_template)
1483 /* FN is an ordinary member function, and we need a
1484 specialization of a member template. */
1486 else if (TREE_CODE (fn) != FUNCTION_DECL)
1487 /* We can get IDENTIFIER_NODEs here in certain erroneous
1490 else if (!DECL_FUNCTION_MEMBER_P (fn))
1491 /* This is just an ordinary non-member function. Nothing can
1492 be a specialization of that. */
1494 else if (DECL_ARTIFICIAL (fn))
1495 /* Cannot specialize functions that are created implicitly. */
1499 tree decl_arg_types;
1501 /* This is an ordinary member function. However, since
1502 we're here, we can assume it's enclosing class is a
1503 template class. For example,
1505 template <typename T> struct S { void f(); };
1506 template <> void S<int>::f() {}
1508 Here, S<int>::f is a non-template, but S<int> is a
1509 template class. If FN has the same type as DECL, we
1510 might be in business. */
1512 if (!DECL_TEMPLATE_INFO (fn))
1513 /* Its enclosing class is an explicit specialization
1514 of a template class. This is not a candidate. */
1517 if (!same_type_p (TREE_TYPE (TREE_TYPE (decl)),
1518 TREE_TYPE (TREE_TYPE (fn))))
1519 /* The return types differ. */
1522 /* Adjust the type of DECL in case FN is a static member. */
1523 decl_arg_types = TYPE_ARG_TYPES (TREE_TYPE (decl));
1524 if (DECL_STATIC_FUNCTION_P (fn)
1525 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl))
1526 decl_arg_types = TREE_CHAIN (decl_arg_types);
1528 if (compparms (TYPE_ARG_TYPES (TREE_TYPE (fn)),
1531 candidates = tree_cons (NULL_TREE, fn, candidates);
1535 if (templates && TREE_CHAIN (templates))
1541 It is possible for a specialization with a given function
1542 signature to be instantiated from more than one function
1543 template. In such cases, explicit specification of the
1544 template arguments must be used to uniquely identify the
1545 function template specialization being specialized.
1547 Note that here, there's no suggestion that we're supposed to
1548 determine which of the candidate templates is most
1549 specialized. However, we, also have:
1553 Partial ordering of overloaded function template
1554 declarations is used in the following contexts to select
1555 the function template to which a function template
1556 specialization refers:
1558 -- when an explicit specialization refers to a function
1561 So, we do use the partial ordering rules, at least for now.
1562 This extension can only serve to make invalid programs valid,
1563 so it's safe. And, there is strong anecdotal evidence that
1564 the committee intended the partial ordering rules to apply;
1565 the EDG front-end has that behavior, and John Spicer claims
1566 that the committee simply forgot to delete the wording in
1567 [temp.expl.spec]. */
1568 tree tmpl = most_specialized_instantiation (templates);
1569 if (tmpl != error_mark_node)
1572 TREE_CHAIN (templates) = NULL_TREE;
1576 if (templates == NULL_TREE && candidates == NULL_TREE)
1578 error ("template-id %qD for %q+D does not match any template "
1579 "declaration", template_id, decl);
1580 return error_mark_node;
1582 else if ((templates && TREE_CHAIN (templates))
1583 || (candidates && TREE_CHAIN (candidates))
1584 || (templates && candidates))
1586 error ("ambiguous template specialization %qD for %q+D",
1588 chainon (candidates, templates);
1589 print_candidates (candidates);
1590 return error_mark_node;
1593 /* We have one, and exactly one, match. */
1596 tree fn = TREE_VALUE (candidates);
1597 /* DECL is a re-declaration of a template function. */
1598 if (TREE_CODE (fn) == TEMPLATE_DECL)
1600 /* It was a specialization of an ordinary member function in a
1602 *targs_out = copy_node (DECL_TI_ARGS (fn));
1603 return DECL_TI_TEMPLATE (fn);
1606 /* It was a specialization of a template. */
1607 targs = DECL_TI_ARGS (DECL_TEMPLATE_RESULT (TREE_VALUE (templates)));
1608 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (targs))
1610 *targs_out = copy_node (targs);
1611 SET_TMPL_ARGS_LEVEL (*targs_out,
1612 TMPL_ARGS_DEPTH (*targs_out),
1613 TREE_PURPOSE (templates));
1616 *targs_out = TREE_PURPOSE (templates);
1617 return TREE_VALUE (templates);
1620 /* Returns a chain of parameter types, exactly like the SPEC_TYPES,
1621 but with the default argument values filled in from those in the
1625 copy_default_args_to_explicit_spec_1 (tree spec_types,
1628 tree new_spec_types;
1633 if (spec_types == void_list_node)
1634 return void_list_node;
1636 /* Substitute into the rest of the list. */
1638 copy_default_args_to_explicit_spec_1 (TREE_CHAIN (spec_types),
1639 TREE_CHAIN (tmpl_types));
1641 /* Add the default argument for this parameter. */
1642 return hash_tree_cons (TREE_PURPOSE (tmpl_types),
1643 TREE_VALUE (spec_types),
1647 /* DECL is an explicit specialization. Replicate default arguments
1648 from the template it specializes. (That way, code like:
1650 template <class T> void f(T = 3);
1651 template <> void f(double);
1654 works, as required.) An alternative approach would be to look up
1655 the correct default arguments at the call-site, but this approach
1656 is consistent with how implicit instantiations are handled. */
1659 copy_default_args_to_explicit_spec (tree decl)
1664 tree new_spec_types;
1668 tree object_type = NULL_TREE;
1669 tree in_charge = NULL_TREE;
1670 tree vtt = NULL_TREE;
1672 /* See if there's anything we need to do. */
1673 tmpl = DECL_TI_TEMPLATE (decl);
1674 tmpl_types = TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (tmpl)));
1675 for (t = tmpl_types; t; t = TREE_CHAIN (t))
1676 if (TREE_PURPOSE (t))
1681 old_type = TREE_TYPE (decl);
1682 spec_types = TYPE_ARG_TYPES (old_type);
1684 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl))
1686 /* Remove the this pointer, but remember the object's type for
1688 object_type = TREE_TYPE (TREE_VALUE (spec_types));
1689 spec_types = TREE_CHAIN (spec_types);
1690 tmpl_types = TREE_CHAIN (tmpl_types);
1692 if (DECL_HAS_IN_CHARGE_PARM_P (decl))
1694 /* DECL may contain more parameters than TMPL due to the extra
1695 in-charge parameter in constructors and destructors. */
1696 in_charge = spec_types;
1697 spec_types = TREE_CHAIN (spec_types);
1699 if (DECL_HAS_VTT_PARM_P (decl))
1702 spec_types = TREE_CHAIN (spec_types);
1706 /* Compute the merged default arguments. */
1708 copy_default_args_to_explicit_spec_1 (spec_types, tmpl_types);
1710 /* Compute the new FUNCTION_TYPE. */
1714 new_spec_types = hash_tree_cons (TREE_PURPOSE (vtt),
1719 /* Put the in-charge parameter back. */
1720 new_spec_types = hash_tree_cons (TREE_PURPOSE (in_charge),
1721 TREE_VALUE (in_charge),
1724 new_type = build_method_type_directly (object_type,
1725 TREE_TYPE (old_type),
1729 new_type = build_function_type (TREE_TYPE (old_type),
1731 new_type = cp_build_type_attribute_variant (new_type,
1732 TYPE_ATTRIBUTES (old_type));
1733 new_type = build_exception_variant (new_type,
1734 TYPE_RAISES_EXCEPTIONS (old_type));
1735 TREE_TYPE (decl) = new_type;
1738 /* Check to see if the function just declared, as indicated in
1739 DECLARATOR, and in DECL, is a specialization of a function
1740 template. We may also discover that the declaration is an explicit
1741 instantiation at this point.
1743 Returns DECL, or an equivalent declaration that should be used
1744 instead if all goes well. Issues an error message if something is
1745 amiss. Returns error_mark_node if the error is not easily
1748 FLAGS is a bitmask consisting of the following flags:
1750 2: The function has a definition.
1751 4: The function is a friend.
1753 The TEMPLATE_COUNT is the number of references to qualifying
1754 template classes that appeared in the name of the function. For
1757 template <class T> struct S { void f(); };
1760 the TEMPLATE_COUNT would be 1. However, explicitly specialized
1761 classes are not counted in the TEMPLATE_COUNT, so that in
1763 template <class T> struct S {};
1764 template <> struct S<int> { void f(); }
1765 template <> void S<int>::f();
1767 the TEMPLATE_COUNT would be 0. (Note that this declaration is
1768 invalid; there should be no template <>.)
1770 If the function is a specialization, it is marked as such via
1771 DECL_TEMPLATE_SPECIALIZATION. Furthermore, its DECL_TEMPLATE_INFO
1772 is set up correctly, and it is added to the list of specializations
1773 for that template. */
1776 check_explicit_specialization (tree declarator,
1781 int have_def = flags & 2;
1782 int is_friend = flags & 4;
1783 int specialization = 0;
1784 int explicit_instantiation = 0;
1785 int member_specialization = 0;
1786 tree ctype = DECL_CLASS_CONTEXT (decl);
1787 tree dname = DECL_NAME (decl);
1792 if (!processing_specialization)
1795 tsk = tsk_excessive_parms;
1798 tsk = current_tmpl_spec_kind (template_count);
1803 if (processing_specialization)
1806 SET_DECL_TEMPLATE_SPECIALIZATION (decl);
1808 else if (TREE_CODE (declarator) == TEMPLATE_ID_EXPR)
1811 /* This could be something like:
1813 template <class T> void f(T);
1814 class S { friend void f<>(int); } */
1818 /* This case handles bogus declarations like template <>
1819 template <class T> void f<int>(); */
1821 error ("template-id %qD in declaration of primary template",
1828 case tsk_invalid_member_spec:
1829 /* The error has already been reported in
1830 check_specialization_scope. */
1831 return error_mark_node;
1833 case tsk_invalid_expl_inst:
1834 error ("template parameter list used in explicit instantiation");
1840 error ("definition provided for explicit instantiation");
1842 explicit_instantiation = 1;
1845 case tsk_excessive_parms:
1846 case tsk_insufficient_parms:
1847 if (tsk == tsk_excessive_parms)
1848 error ("too many template parameter lists in declaration of %qD",
1850 else if (template_header_count)
1851 error("too few template parameter lists in declaration of %qD", decl);
1853 error("explicit specialization of %qD must be introduced by "
1854 "%<template <>%>", decl);
1858 SET_DECL_TEMPLATE_SPECIALIZATION (decl);
1860 member_specialization = 1;
1866 if (TREE_CODE (declarator) == TEMPLATE_ID_EXPR)
1868 /* This case handles bogus declarations like template <>
1869 template <class T> void f<int>(); */
1871 if (uses_template_parms (declarator))
1872 error ("function template partial specialization %qD "
1873 "is not allowed", declarator);
1875 error ("template-id %qD in declaration of primary template",
1880 if (ctype && CLASSTYPE_TEMPLATE_INSTANTIATION (ctype))
1881 /* This is a specialization of a member template, without
1882 specialization the containing class. Something like:
1884 template <class T> struct S {
1885 template <class U> void f (U);
1887 template <> template <class U> void S<int>::f(U) {}
1889 That's a specialization -- but of the entire template. */
1897 if (specialization || member_specialization)
1899 tree t = TYPE_ARG_TYPES (TREE_TYPE (decl));
1900 for (; t; t = TREE_CHAIN (t))
1901 if (TREE_PURPOSE (t))
1904 ("default argument specified in explicit specialization");
1909 if (specialization || member_specialization || explicit_instantiation)
1911 tree tmpl = NULL_TREE;
1912 tree targs = NULL_TREE;
1914 /* Make sure that the declarator is a TEMPLATE_ID_EXPR. */
1915 if (TREE_CODE (declarator) != TEMPLATE_ID_EXPR)
1919 gcc_assert (TREE_CODE (declarator) == IDENTIFIER_NODE);
1924 /* If there is no class context, the explicit instantiation
1925 must be at namespace scope. */
1926 gcc_assert (DECL_NAMESPACE_SCOPE_P (decl));
1928 /* Find the namespace binding, using the declaration
1930 fns = lookup_qualified_name (CP_DECL_CONTEXT (decl), dname,
1932 if (!fns || !is_overloaded_fn (fns))
1934 error ("%qD is not a template function", dname);
1935 fns = error_mark_node;
1939 tree fn = OVL_CURRENT (fns);
1940 if (!is_associated_namespace (CP_DECL_CONTEXT (decl),
1941 CP_DECL_CONTEXT (fn)))
1942 error ("%qD is not declared in %qD",
1943 decl, current_namespace);
1947 declarator = lookup_template_function (fns, NULL_TREE);
1950 if (declarator == error_mark_node)
1951 return error_mark_node;
1953 if (ctype != NULL_TREE && TYPE_BEING_DEFINED (ctype))
1955 if (!explicit_instantiation)
1956 /* A specialization in class scope. This is invalid,
1957 but the error will already have been flagged by
1958 check_specialization_scope. */
1959 return error_mark_node;
1962 /* It's not valid to write an explicit instantiation in
1965 class C { template void f(); }
1967 This case is caught by the parser. However, on
1970 template class C { void f(); };
1972 (which is invalid) we can get here. The error will be
1979 else if (ctype != NULL_TREE
1980 && (TREE_CODE (TREE_OPERAND (declarator, 0)) ==
1983 /* Find the list of functions in ctype that have the same
1984 name as the declared function. */
1985 tree name = TREE_OPERAND (declarator, 0);
1986 tree fns = NULL_TREE;
1989 if (constructor_name_p (name, ctype))
1991 int is_constructor = DECL_CONSTRUCTOR_P (decl);
1993 if (is_constructor ? !TYPE_HAS_CONSTRUCTOR (ctype)
1994 : !CLASSTYPE_DESTRUCTORS (ctype))
1996 /* From [temp.expl.spec]:
1998 If such an explicit specialization for the member
1999 of a class template names an implicitly-declared
2000 special member function (clause _special_), the
2001 program is ill-formed.
2003 Similar language is found in [temp.explicit]. */
2004 error ("specialization of implicitly-declared special member function");
2005 return error_mark_node;
2008 name = is_constructor ? ctor_identifier : dtor_identifier;
2011 if (!DECL_CONV_FN_P (decl))
2013 idx = lookup_fnfields_1 (ctype, name);
2015 fns = VEC_index (tree, CLASSTYPE_METHOD_VEC (ctype), idx);
2019 VEC(tree,gc) *methods;
2022 /* For a type-conversion operator, we cannot do a
2023 name-based lookup. We might be looking for `operator
2024 int' which will be a specialization of `operator T'.
2025 So, we find *all* the conversion operators, and then
2026 select from them. */
2029 methods = CLASSTYPE_METHOD_VEC (ctype);
2031 for (idx = CLASSTYPE_FIRST_CONVERSION_SLOT;
2032 VEC_iterate (tree, methods, idx, ovl);
2035 if (!DECL_CONV_FN_P (OVL_CURRENT (ovl)))
2036 /* There are no more conversion functions. */
2039 /* Glue all these conversion functions together
2040 with those we already have. */
2041 for (; ovl; ovl = OVL_NEXT (ovl))
2042 fns = ovl_cons (OVL_CURRENT (ovl), fns);
2046 if (fns == NULL_TREE)
2048 error ("no member function %qD declared in %qT", name, ctype);
2049 return error_mark_node;
2052 TREE_OPERAND (declarator, 0) = fns;
2055 /* Figure out what exactly is being specialized at this point.
2056 Note that for an explicit instantiation, even one for a
2057 member function, we cannot tell apriori whether the
2058 instantiation is for a member template, or just a member
2059 function of a template class. Even if a member template is
2060 being instantiated, the member template arguments may be
2061 elided if they can be deduced from the rest of the
2063 tmpl = determine_specialization (declarator, decl,
2065 member_specialization,
2069 if (!tmpl || tmpl == error_mark_node)
2070 /* We couldn't figure out what this declaration was
2072 return error_mark_node;
2075 tree gen_tmpl = most_general_template (tmpl);
2077 if (explicit_instantiation)
2079 /* We don't set DECL_EXPLICIT_INSTANTIATION here; that
2080 is done by do_decl_instantiation later. */
2082 int arg_depth = TMPL_ARGS_DEPTH (targs);
2083 int parm_depth = TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl));
2085 if (arg_depth > parm_depth)
2087 /* If TMPL is not the most general template (for
2088 example, if TMPL is a friend template that is
2089 injected into namespace scope), then there will
2090 be too many levels of TARGS. Remove some of them
2095 new_targs = make_tree_vec (parm_depth);
2096 for (i = arg_depth - parm_depth; i < arg_depth; ++i)
2097 TREE_VEC_ELT (new_targs, i - (arg_depth - parm_depth))
2098 = TREE_VEC_ELT (targs, i);
2102 return instantiate_template (tmpl, targs, tf_error);
2105 /* If we thought that the DECL was a member function, but it
2106 turns out to be specializing a static member function,
2107 make DECL a static member function as well. */
2108 if (DECL_STATIC_FUNCTION_P (tmpl)
2109 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl))
2110 revert_static_member_fn (decl);
2112 /* If this is a specialization of a member template of a
2113 template class, we want to return the TEMPLATE_DECL, not
2114 the specialization of it. */
2115 if (tsk == tsk_template)
2117 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl);
2118 DECL_INITIAL (DECL_TEMPLATE_RESULT (tmpl)) = NULL_TREE;
2121 DECL_SOURCE_LOCATION (tmpl) = DECL_SOURCE_LOCATION (decl);
2122 DECL_SOURCE_LOCATION (DECL_TEMPLATE_RESULT (tmpl))
2123 = DECL_SOURCE_LOCATION (decl);
2124 /* We want to use the argument list specified in the
2125 definition, not in the original declaration. */
2126 DECL_ARGUMENTS (DECL_TEMPLATE_RESULT (tmpl))
2127 = DECL_ARGUMENTS (decl);
2132 /* Set up the DECL_TEMPLATE_INFO for DECL. */
2133 DECL_TEMPLATE_INFO (decl) = tree_cons (tmpl, targs, NULL_TREE);
2135 /* Inherit default function arguments from the template
2136 DECL is specializing. */
2137 copy_default_args_to_explicit_spec (decl);
2139 /* This specialization has the same protection as the
2140 template it specializes. */
2141 TREE_PRIVATE (decl) = TREE_PRIVATE (gen_tmpl);
2142 TREE_PROTECTED (decl) = TREE_PROTECTED (gen_tmpl);
2143 /* The specialization has the same visibility as the
2144 template it specializes. */
2145 if (DECL_VISIBILITY_SPECIFIED (gen_tmpl))
2147 DECL_VISIBILITY_SPECIFIED (decl) = 1;
2148 DECL_VISIBILITY (decl) = DECL_VISIBILITY (gen_tmpl);
2150 /* If DECL is a friend declaration, declared using an
2151 unqualified name, the namespace associated with DECL may
2152 have been set incorrectly. For example, in:
2154 template <typename T> void f(T);
2156 struct S { friend void f<int>(int); }
2159 we will have set the DECL_CONTEXT for the friend
2160 declaration to N, rather than to the global namespace. */
2161 if (DECL_NAMESPACE_SCOPE_P (decl))
2162 DECL_CONTEXT (decl) = DECL_CONTEXT (tmpl);
2164 if (is_friend && !have_def)
2165 /* This is not really a declaration of a specialization.
2166 It's just the name of an instantiation. But, it's not
2167 a request for an instantiation, either. */
2168 SET_DECL_IMPLICIT_INSTANTIATION (decl);
2169 else if (DECL_CONSTRUCTOR_P (decl) || DECL_DESTRUCTOR_P (decl))
2170 /* This is indeed a specialization. In case of constructors
2171 and destructors, we need in-charge and not-in-charge
2172 versions in V3 ABI. */
2173 clone_function_decl (decl, /*update_method_vec_p=*/0);
2175 /* Register this specialization so that we can find it
2177 decl = register_specialization (decl, gen_tmpl, targs, is_friend);
2184 /* Returns 1 iff PARMS1 and PARMS2 are identical sets of template
2185 parameters. These are represented in the same format used for
2186 DECL_TEMPLATE_PARMS. */
2189 comp_template_parms (tree parms1, tree parms2)
2194 if (parms1 == parms2)
2197 for (p1 = parms1, p2 = parms2;
2198 p1 != NULL_TREE && p2 != NULL_TREE;
2199 p1 = TREE_CHAIN (p1), p2 = TREE_CHAIN (p2))
2201 tree t1 = TREE_VALUE (p1);
2202 tree t2 = TREE_VALUE (p2);
2205 gcc_assert (TREE_CODE (t1) == TREE_VEC);
2206 gcc_assert (TREE_CODE (t2) == TREE_VEC);
2208 if (TREE_VEC_LENGTH (t1) != TREE_VEC_LENGTH (t2))
2211 for (i = 0; i < TREE_VEC_LENGTH (t2); ++i)
2213 tree parm1 = TREE_VALUE (TREE_VEC_ELT (t1, i));
2214 tree parm2 = TREE_VALUE (TREE_VEC_ELT (t2, i));
2216 if (TREE_CODE (parm1) != TREE_CODE (parm2))
2219 if (TREE_CODE (parm1) == TEMPLATE_TYPE_PARM)
2221 else if (!same_type_p (TREE_TYPE (parm1), TREE_TYPE (parm2)))
2226 if ((p1 != NULL_TREE) != (p2 != NULL_TREE))
2227 /* One set of parameters has more parameters lists than the
2234 /* Complain if DECL shadows a template parameter.
2236 [temp.local]: A template-parameter shall not be redeclared within its
2237 scope (including nested scopes). */
2240 check_template_shadow (tree decl)
2244 /* If we're not in a template, we can't possibly shadow a template
2246 if (!current_template_parms)
2249 /* Figure out what we're shadowing. */
2250 if (TREE_CODE (decl) == OVERLOAD)
2251 decl = OVL_CURRENT (decl);
2252 olddecl = innermost_non_namespace_value (DECL_NAME (decl));
2254 /* If there's no previous binding for this name, we're not shadowing
2255 anything, let alone a template parameter. */
2259 /* If we're not shadowing a template parameter, we're done. Note
2260 that OLDDECL might be an OVERLOAD (or perhaps even an
2261 ERROR_MARK), so we can't just blithely assume it to be a _DECL
2263 if (!DECL_P (olddecl) || !DECL_TEMPLATE_PARM_P (olddecl))
2266 /* We check for decl != olddecl to avoid bogus errors for using a
2267 name inside a class. We check TPFI to avoid duplicate errors for
2268 inline member templates. */
2270 || TEMPLATE_PARMS_FOR_INLINE (current_template_parms))
2273 error ("declaration of %q+#D", decl);
2274 error (" shadows template parm %q+#D", olddecl);
2277 /* Return a new TEMPLATE_PARM_INDEX with the indicated INDEX, LEVEL,
2278 ORIG_LEVEL, DECL, and TYPE. */
2281 build_template_parm_index (int index,
2287 tree t = make_node (TEMPLATE_PARM_INDEX);
2288 TEMPLATE_PARM_IDX (t) = index;
2289 TEMPLATE_PARM_LEVEL (t) = level;
2290 TEMPLATE_PARM_ORIG_LEVEL (t) = orig_level;
2291 TEMPLATE_PARM_DECL (t) = decl;
2292 TREE_TYPE (t) = type;
2293 TREE_CONSTANT (t) = TREE_CONSTANT (decl);
2294 TREE_INVARIANT (t) = TREE_INVARIANT (decl);
2295 TREE_READONLY (t) = TREE_READONLY (decl);
2300 /* Return a TEMPLATE_PARM_INDEX, similar to INDEX, but whose
2301 TEMPLATE_PARM_LEVEL has been decreased by LEVELS. If such a
2302 TEMPLATE_PARM_INDEX already exists, it is returned; otherwise, a
2303 new one is created. */
2306 reduce_template_parm_level (tree index, tree type, int levels)
2308 if (TEMPLATE_PARM_DESCENDANTS (index) == NULL_TREE
2309 || (TEMPLATE_PARM_LEVEL (TEMPLATE_PARM_DESCENDANTS (index))
2310 != TEMPLATE_PARM_LEVEL (index) - levels))
2312 tree orig_decl = TEMPLATE_PARM_DECL (index);
2315 decl = build_decl (TREE_CODE (orig_decl), DECL_NAME (orig_decl), type);
2316 TREE_CONSTANT (decl) = TREE_CONSTANT (orig_decl);
2317 TREE_INVARIANT (decl) = TREE_INVARIANT (orig_decl);
2318 TREE_READONLY (decl) = TREE_READONLY (orig_decl);
2319 DECL_ARTIFICIAL (decl) = 1;
2320 SET_DECL_TEMPLATE_PARM_P (decl);
2322 t = build_template_parm_index (TEMPLATE_PARM_IDX (index),
2323 TEMPLATE_PARM_LEVEL (index) - levels,
2324 TEMPLATE_PARM_ORIG_LEVEL (index),
2326 TEMPLATE_PARM_DESCENDANTS (index) = t;
2328 /* Template template parameters need this. */
2329 if (TREE_CODE (decl) != CONST_DECL)
2330 DECL_TEMPLATE_PARMS (decl)
2331 = DECL_TEMPLATE_PARMS (TEMPLATE_PARM_DECL (index));
2334 return TEMPLATE_PARM_DESCENDANTS (index);
2337 /* Process information from new template parameter PARM and append it to the
2338 LIST being built. This new parameter is a non-type parameter iff
2339 IS_NON_TYPE is true. */
2342 process_template_parm (tree list, tree parm, bool is_non_type)
2348 gcc_assert (TREE_CODE (parm) == TREE_LIST);
2349 defval = TREE_PURPOSE (parm);
2353 tree p = TREE_VALUE (tree_last (list));
2355 if (TREE_CODE (p) == TYPE_DECL || TREE_CODE (p) == TEMPLATE_DECL)
2356 idx = TEMPLATE_TYPE_IDX (TREE_TYPE (p));
2358 idx = TEMPLATE_PARM_IDX (DECL_INITIAL (p));
2366 parm = TREE_VALUE (parm);
2368 SET_DECL_TEMPLATE_PARM_P (parm);
2370 if (TREE_TYPE (parm) == error_mark_node)
2371 TREE_TYPE (parm) = void_type_node;
2376 The top-level cv-qualifiers on the template-parameter are
2377 ignored when determining its type. */
2378 TREE_TYPE (parm) = TYPE_MAIN_VARIANT (TREE_TYPE (parm));
2379 if (invalid_nontype_parm_type_p (TREE_TYPE (parm), 1))
2380 TREE_TYPE (parm) = void_type_node;
2383 /* A template parameter is not modifiable. */
2384 TREE_CONSTANT (parm) = 1;
2385 TREE_INVARIANT (parm) = 1;
2386 TREE_READONLY (parm) = 1;
2387 decl = build_decl (CONST_DECL, DECL_NAME (parm), TREE_TYPE (parm));
2388 TREE_CONSTANT (decl) = 1;
2389 TREE_INVARIANT (decl) = 1;
2390 TREE_READONLY (decl) = 1;
2391 DECL_INITIAL (parm) = DECL_INITIAL (decl)
2392 = build_template_parm_index (idx, processing_template_decl,
2393 processing_template_decl,
2394 decl, TREE_TYPE (parm));
2399 parm = TREE_VALUE (TREE_VALUE (parm));
2401 if (parm && TREE_CODE (parm) == TEMPLATE_DECL)
2403 t = make_aggr_type (TEMPLATE_TEMPLATE_PARM);
2404 /* This is for distinguishing between real templates and template
2405 template parameters */
2406 TREE_TYPE (parm) = t;
2407 TREE_TYPE (DECL_TEMPLATE_RESULT (parm)) = t;
2412 t = make_aggr_type (TEMPLATE_TYPE_PARM);
2413 /* parm is either IDENTIFIER_NODE or NULL_TREE. */
2414 decl = build_decl (TYPE_DECL, parm, t);
2417 TYPE_NAME (t) = decl;
2418 TYPE_STUB_DECL (t) = decl;
2420 TEMPLATE_TYPE_PARM_INDEX (t)
2421 = build_template_parm_index (idx, processing_template_decl,
2422 processing_template_decl,
2423 decl, TREE_TYPE (parm));
2425 DECL_ARTIFICIAL (decl) = 1;
2426 SET_DECL_TEMPLATE_PARM_P (decl);
2428 parm = build_tree_list (defval, parm);
2429 return chainon (list, parm);
2432 /* The end of a template parameter list has been reached. Process the
2433 tree list into a parameter vector, converting each parameter into a more
2434 useful form. Type parameters are saved as IDENTIFIER_NODEs, and others
2438 end_template_parm_list (tree parms)
2442 tree saved_parmlist = make_tree_vec (list_length (parms));
2444 current_template_parms
2445 = tree_cons (size_int (processing_template_decl),
2446 saved_parmlist, current_template_parms);
2448 for (parm = parms, nparms = 0; parm; parm = next, nparms++)
2450 next = TREE_CHAIN (parm);
2451 TREE_VEC_ELT (saved_parmlist, nparms) = parm;
2452 TREE_CHAIN (parm) = NULL_TREE;
2455 --processing_template_parmlist;
2457 return saved_parmlist;
2460 /* end_template_decl is called after a template declaration is seen. */
2463 end_template_decl (void)
2465 reset_specialization ();
2467 if (! processing_template_decl)
2470 /* This matches the pushlevel in begin_template_parm_list. */
2473 --processing_template_decl;
2474 current_template_parms = TREE_CHAIN (current_template_parms);
2477 /* Given a template argument vector containing the template PARMS.
2478 The innermost PARMS are given first. */
2481 current_template_args (void)
2484 tree args = NULL_TREE;
2485 int length = TMPL_PARMS_DEPTH (current_template_parms);
2488 /* If there is only one level of template parameters, we do not
2489 create a TREE_VEC of TREE_VECs. Instead, we return a single
2490 TREE_VEC containing the arguments. */
2492 args = make_tree_vec (length);
2494 for (header = current_template_parms; header; header = TREE_CHAIN (header))
2496 tree a = copy_node (TREE_VALUE (header));
2499 TREE_TYPE (a) = NULL_TREE;
2500 for (i = TREE_VEC_LENGTH (a) - 1; i >= 0; --i)
2502 tree t = TREE_VEC_ELT (a, i);
2504 /* T will be a list if we are called from within a
2505 begin/end_template_parm_list pair, but a vector directly
2506 if within a begin/end_member_template_processing pair. */
2507 if (TREE_CODE (t) == TREE_LIST)
2511 if (TREE_CODE (t) == TYPE_DECL
2512 || TREE_CODE (t) == TEMPLATE_DECL)
2515 t = DECL_INITIAL (t);
2516 TREE_VEC_ELT (a, i) = t;
2521 TREE_VEC_ELT (args, --l) = a;
2529 /* Return a TEMPLATE_DECL corresponding to DECL, using the indicated
2530 template PARMS. If MEMBER_TEMPLATE_P is true, the new template is
2531 a member template. Used by push_template_decl below. */
2534 build_template_decl (tree decl, tree parms, bool member_template_p)
2536 tree tmpl = build_lang_decl (TEMPLATE_DECL, DECL_NAME (decl), NULL_TREE);
2537 DECL_TEMPLATE_PARMS (tmpl) = parms;
2538 DECL_CONTEXT (tmpl) = DECL_CONTEXT (decl);
2539 DECL_MEMBER_TEMPLATE_P (tmpl) = member_template_p;
2540 if (DECL_LANG_SPECIFIC (decl))
2542 DECL_STATIC_FUNCTION_P (tmpl) = DECL_STATIC_FUNCTION_P (decl);
2543 DECL_CONSTRUCTOR_P (tmpl) = DECL_CONSTRUCTOR_P (decl);
2544 DECL_DESTRUCTOR_P (tmpl) = DECL_DESTRUCTOR_P (decl);
2545 DECL_NONCONVERTING_P (tmpl) = DECL_NONCONVERTING_P (decl);
2546 DECL_ASSIGNMENT_OPERATOR_P (tmpl) = DECL_ASSIGNMENT_OPERATOR_P (decl);
2547 if (DECL_OVERLOADED_OPERATOR_P (decl))
2548 SET_OVERLOADED_OPERATOR_CODE (tmpl,
2549 DECL_OVERLOADED_OPERATOR_P (decl));
2555 struct template_parm_data
2557 /* The level of the template parameters we are currently
2561 /* The index of the specialization argument we are currently
2565 /* An array whose size is the number of template parameters. The
2566 elements are nonzero if the parameter has been used in any one
2567 of the arguments processed so far. */
2570 /* An array whose size is the number of template arguments. The
2571 elements are nonzero if the argument makes use of template
2572 parameters of this level. */
2573 int* arg_uses_template_parms;
2576 /* Subroutine of push_template_decl used to see if each template
2577 parameter in a partial specialization is used in the explicit
2578 argument list. If T is of the LEVEL given in DATA (which is
2579 treated as a template_parm_data*), then DATA->PARMS is marked
2583 mark_template_parm (tree t, void* data)
2587 struct template_parm_data* tpd = (struct template_parm_data*) data;
2589 if (TREE_CODE (t) == TEMPLATE_PARM_INDEX)
2591 level = TEMPLATE_PARM_LEVEL (t);
2592 idx = TEMPLATE_PARM_IDX (t);
2596 level = TEMPLATE_TYPE_LEVEL (t);
2597 idx = TEMPLATE_TYPE_IDX (t);
2600 if (level == tpd->level)
2602 tpd->parms[idx] = 1;
2603 tpd->arg_uses_template_parms[tpd->current_arg] = 1;
2606 /* Return zero so that for_each_template_parm will continue the
2607 traversal of the tree; we want to mark *every* template parm. */
2611 /* Process the partial specialization DECL. */
2614 process_partial_specialization (tree decl)
2616 tree type = TREE_TYPE (decl);
2617 tree maintmpl = CLASSTYPE_TI_TEMPLATE (type);
2618 tree specargs = CLASSTYPE_TI_ARGS (type);
2619 tree inner_args = INNERMOST_TEMPLATE_ARGS (specargs);
2620 tree inner_parms = INNERMOST_TEMPLATE_PARMS (current_template_parms);
2621 tree main_inner_parms = DECL_INNERMOST_TEMPLATE_PARMS (maintmpl);
2622 int nargs = TREE_VEC_LENGTH (inner_args);
2623 int ntparms = TREE_VEC_LENGTH (inner_parms);
2625 int did_error_intro = 0;
2626 struct template_parm_data tpd;
2627 struct template_parm_data tpd2;
2629 /* We check that each of the template parameters given in the
2630 partial specialization is used in the argument list to the
2631 specialization. For example:
2633 template <class T> struct S;
2634 template <class T> struct S<T*>;
2636 The second declaration is OK because `T*' uses the template
2637 parameter T, whereas
2639 template <class T> struct S<int>;
2641 is no good. Even trickier is:
2652 The S2<T> declaration is actually invalid; it is a
2653 full-specialization. Of course,
2656 struct S2<T (*)(U)>;
2658 or some such would have been OK. */
2659 tpd.level = TMPL_PARMS_DEPTH (current_template_parms);
2660 tpd.parms = (int *) alloca (sizeof (int) * ntparms);
2661 memset (tpd.parms, 0, sizeof (int) * ntparms);
2663 tpd.arg_uses_template_parms = (int *) alloca (sizeof (int) * nargs);
2664 memset (tpd.arg_uses_template_parms, 0, sizeof (int) * nargs);
2665 for (i = 0; i < nargs; ++i)
2667 tpd.current_arg = i;
2668 for_each_template_parm (TREE_VEC_ELT (inner_args, i),
2669 &mark_template_parm,
2673 for (i = 0; i < ntparms; ++i)
2674 if (tpd.parms[i] == 0)
2676 /* One of the template parms was not used in the
2678 if (!did_error_intro)
2680 error ("template parameters not used in partial specialization:");
2681 did_error_intro = 1;
2684 error (" %qD", TREE_VALUE (TREE_VEC_ELT (inner_parms, i)));
2687 /* [temp.class.spec]
2689 The argument list of the specialization shall not be identical to
2690 the implicit argument list of the primary template. */
2691 if (comp_template_args
2693 INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE
2695 error ("partial specialization %qT does not specialize any template arguments", type);
2697 /* [temp.class.spec]
2699 A partially specialized non-type argument expression shall not
2700 involve template parameters of the partial specialization except
2701 when the argument expression is a simple identifier.
2703 The type of a template parameter corresponding to a specialized
2704 non-type argument shall not be dependent on a parameter of the
2706 gcc_assert (nargs == DECL_NTPARMS (maintmpl));
2708 for (i = 0; i < nargs; ++i)
2710 tree arg = TREE_VEC_ELT (inner_args, i);
2711 if (/* These first two lines are the `non-type' bit. */
2713 && TREE_CODE (arg) != TEMPLATE_DECL
2714 /* This next line is the `argument expression is not just a
2715 simple identifier' condition and also the `specialized
2716 non-type argument' bit. */
2717 && TREE_CODE (arg) != TEMPLATE_PARM_INDEX)
2719 if (tpd.arg_uses_template_parms[i])
2720 error ("template argument %qE involves template parameter(s)", arg);
2723 /* Look at the corresponding template parameter,
2724 marking which template parameters its type depends
2727 TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (main_inner_parms,
2732 /* We haven't yet initialized TPD2. Do so now. */
2733 tpd2.arg_uses_template_parms
2734 = (int *) alloca (sizeof (int) * nargs);
2735 /* The number of parameters here is the number in the
2736 main template, which, as checked in the assertion
2738 tpd2.parms = (int *) alloca (sizeof (int) * nargs);
2740 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (maintmpl));
2743 /* Mark the template parameters. But this time, we're
2744 looking for the template parameters of the main
2745 template, not in the specialization. */
2746 tpd2.current_arg = i;
2747 tpd2.arg_uses_template_parms[i] = 0;
2748 memset (tpd2.parms, 0, sizeof (int) * nargs);
2749 for_each_template_parm (type,
2750 &mark_template_parm,
2754 if (tpd2.arg_uses_template_parms [i])
2756 /* The type depended on some template parameters.
2757 If they are fully specialized in the
2758 specialization, that's OK. */
2760 for (j = 0; j < nargs; ++j)
2761 if (tpd2.parms[j] != 0
2762 && tpd.arg_uses_template_parms [j])
2764 error ("type %qT of template argument %qE depends "
2765 "on template parameter(s)",
2775 if (retrieve_specialization (maintmpl, specargs,
2776 /*class_specializations_p=*/true))
2777 /* We've already got this specialization. */
2780 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl)
2781 = tree_cons (specargs, inner_parms,
2782 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl));
2783 TREE_TYPE (DECL_TEMPLATE_SPECIALIZATIONS (maintmpl)) = type;
2787 /* Check that a template declaration's use of default arguments is not
2788 invalid. Here, PARMS are the template parameters. IS_PRIMARY is
2789 nonzero if DECL is the thing declared by a primary template.
2790 IS_PARTIAL is nonzero if DECL is a partial specialization. */
2793 check_default_tmpl_args (tree decl, tree parms, int is_primary, int is_partial)
2796 int last_level_to_check;
2801 A default template-argument shall not be specified in a
2802 function template declaration or a function template definition, nor
2803 in the template-parameter-list of the definition of a member of a
2806 if (TREE_CODE (CP_DECL_CONTEXT (decl)) == FUNCTION_DECL)
2807 /* You can't have a function template declaration in a local
2808 scope, nor you can you define a member of a class template in a
2812 if (current_class_type
2813 && !TYPE_BEING_DEFINED (current_class_type)
2814 && DECL_LANG_SPECIFIC (decl)
2815 /* If this is either a friend defined in the scope of the class
2816 or a member function. */
2817 && (DECL_FUNCTION_MEMBER_P (decl)
2818 ? same_type_p (DECL_CONTEXT (decl), current_class_type)
2819 : DECL_FRIEND_CONTEXT (decl)
2820 ? same_type_p (DECL_FRIEND_CONTEXT (decl), current_class_type)
2822 /* And, if it was a member function, it really was defined in
2823 the scope of the class. */
2824 && (!DECL_FUNCTION_MEMBER_P (decl)
2825 || DECL_INITIALIZED_IN_CLASS_P (decl)))
2826 /* We already checked these parameters when the template was
2827 declared, so there's no need to do it again now. This function
2828 was defined in class scope, but we're processing it's body now
2829 that the class is complete. */
2834 If a template-parameter has a default template-argument, all
2835 subsequent template-parameters shall have a default
2836 template-argument supplied. */
2837 for (parm_level = parms; parm_level; parm_level = TREE_CHAIN (parm_level))
2839 tree inner_parms = TREE_VALUE (parm_level);
2840 int ntparms = TREE_VEC_LENGTH (inner_parms);
2841 int seen_def_arg_p = 0;
2844 for (i = 0; i < ntparms; ++i)
2846 tree parm = TREE_VEC_ELT (inner_parms, i);
2847 if (TREE_PURPOSE (parm))
2849 else if (seen_def_arg_p)
2851 error ("no default argument for %qD", TREE_VALUE (parm));
2852 /* For better subsequent error-recovery, we indicate that
2853 there should have been a default argument. */
2854 TREE_PURPOSE (parm) = error_mark_node;
2859 if (TREE_CODE (decl) != TYPE_DECL || is_partial || !is_primary)
2860 /* For an ordinary class template, default template arguments are
2861 allowed at the innermost level, e.g.:
2862 template <class T = int>
2864 but, in a partial specialization, they're not allowed even
2865 there, as we have in [temp.class.spec]:
2867 The template parameter list of a specialization shall not
2868 contain default template argument values.
2870 So, for a partial specialization, or for a function template,
2871 we look at all of them. */
2874 /* But, for a primary class template that is not a partial
2875 specialization we look at all template parameters except the
2877 parms = TREE_CHAIN (parms);
2879 /* Figure out what error message to issue. */
2880 if (TREE_CODE (decl) == FUNCTION_DECL)
2881 msg = "default template arguments may not be used in function templates";
2882 else if (is_partial)
2883 msg = "default template arguments may not be used in partial specializations";
2885 msg = "default argument for template parameter for class enclosing %qD";
2887 if (current_class_type && TYPE_BEING_DEFINED (current_class_type))
2888 /* If we're inside a class definition, there's no need to
2889 examine the parameters to the class itself. On the one
2890 hand, they will be checked when the class is defined, and,
2891 on the other, default arguments are valid in things like:
2892 template <class T = double>
2893 struct S { template <class U> void f(U); };
2894 Here the default argument for `S' has no bearing on the
2895 declaration of `f'. */
2896 last_level_to_check = template_class_depth (current_class_type) + 1;
2898 /* Check everything. */
2899 last_level_to_check = 0;
2901 for (parm_level = parms;
2902 parm_level && TMPL_PARMS_DEPTH (parm_level) >= last_level_to_check;
2903 parm_level = TREE_CHAIN (parm_level))
2905 tree inner_parms = TREE_VALUE (parm_level);
2909 ntparms = TREE_VEC_LENGTH (inner_parms);
2910 for (i = 0; i < ntparms; ++i)
2911 if (TREE_PURPOSE (TREE_VEC_ELT (inner_parms, i)))
2919 /* Clear out the default argument so that we are not
2921 TREE_PURPOSE (TREE_VEC_ELT (inner_parms, i)) = NULL_TREE;
2924 /* At this point, if we're still interested in issuing messages,
2925 they must apply to classes surrounding the object declared. */
2927 msg = "default argument for template parameter for class enclosing %qD";
2931 /* Worker for push_template_decl_real, called via
2932 for_each_template_parm. DATA is really an int, indicating the
2933 level of the parameters we are interested in. If T is a template
2934 parameter of that level, return nonzero. */
2937 template_parm_this_level_p (tree t, void* data)
2939 int this_level = *(int *)data;
2942 if (TREE_CODE (t) == TEMPLATE_PARM_INDEX)
2943 level = TEMPLATE_PARM_LEVEL (t);
2945 level = TEMPLATE_TYPE_LEVEL (t);
2946 return level == this_level;
2949 /* Creates a TEMPLATE_DECL for the indicated DECL using the template
2950 parameters given by current_template_args, or reuses a
2951 previously existing one, if appropriate. Returns the DECL, or an
2952 equivalent one, if it is replaced via a call to duplicate_decls.
2954 If IS_FRIEND is true, DECL is a friend declaration. */
2957 push_template_decl_real (tree decl, bool is_friend)
2965 int new_template_p = 0;
2966 /* True if the template is a member template, in the sense of
2968 bool member_template_p = false;
2970 if (decl == error_mark_node)
2973 /* See if this is a partial specialization. */
2974 is_partial = (DECL_IMPLICIT_TYPEDEF_P (decl)
2975 && TREE_CODE (TREE_TYPE (decl)) != ENUMERAL_TYPE
2976 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl)));
2978 if (TREE_CODE (decl) == FUNCTION_DECL && DECL_FRIEND_P (decl))
2982 /* For a friend, we want the context of the friend function, not
2983 the type of which it is a friend. */
2984 ctx = DECL_CONTEXT (decl);
2985 else if (CP_DECL_CONTEXT (decl)
2986 && TREE_CODE (CP_DECL_CONTEXT (decl)) != NAMESPACE_DECL)
2987 /* In the case of a virtual function, we want the class in which
2989 ctx = CP_DECL_CONTEXT (decl);
2991 /* Otherwise, if we're currently defining some class, the DECL
2992 is assumed to be a member of the class. */
2993 ctx = current_scope ();
2995 if (ctx && TREE_CODE (ctx) == NAMESPACE_DECL)
2998 if (!DECL_CONTEXT (decl))
2999 DECL_CONTEXT (decl) = FROB_CONTEXT (current_namespace);
3001 /* See if this is a primary template. */
3002 primary = template_parm_scope_p ();
3006 if (DECL_CLASS_SCOPE_P (decl))
3007 member_template_p = true;
3008 if (TREE_CODE (decl) == TYPE_DECL
3009 && ANON_AGGRNAME_P (DECL_NAME (decl)))
3010 error ("template class without a name");
3011 else if (TREE_CODE (decl) == FUNCTION_DECL)
3013 if (DECL_DESTRUCTOR_P (decl))
3017 A destructor shall not be a member template. */
3018 error ("destructor %qD declared as member template", decl);
3019 return error_mark_node;
3021 if (NEW_DELETE_OPNAME_P (DECL_NAME (decl))
3022 && (!TYPE_ARG_TYPES (TREE_TYPE (decl))
3023 || TYPE_ARG_TYPES (TREE_TYPE (decl)) == void_list_node
3024 || !TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl)))
3025 || (TREE_CHAIN (TYPE_ARG_TYPES ((TREE_TYPE (decl))))
3026 == void_list_node)))
3028 /* [basic.stc.dynamic.allocation]
3030 An allocation function can be a function
3031 template. ... Template allocation functions shall
3032 have two or more parameters. */
3033 error ("invalid template declaration of %qD", decl);
3034 return error_mark_node;
3037 else if (DECL_IMPLICIT_TYPEDEF_P (decl)
3038 && CLASS_TYPE_P (TREE_TYPE (decl)))
3042 error ("template declaration of %q#D", decl);
3043 return error_mark_node;
3047 /* Check to see that the rules regarding the use of default
3048 arguments are not being violated. */
3049 check_default_tmpl_args (decl, current_template_parms,
3050 primary, is_partial);
3053 return process_partial_specialization (decl);
3055 args = current_template_args ();
3058 || TREE_CODE (ctx) == FUNCTION_DECL
3059 || (CLASS_TYPE_P (ctx) && TYPE_BEING_DEFINED (ctx))
3060 || (is_friend && !DECL_TEMPLATE_INFO (decl)))
3062 if (DECL_LANG_SPECIFIC (decl)
3063 && DECL_TEMPLATE_INFO (decl)
3064 && DECL_TI_TEMPLATE (decl))
3065 tmpl = DECL_TI_TEMPLATE (decl);
3066 /* If DECL is a TYPE_DECL for a class-template, then there won't
3067 be DECL_LANG_SPECIFIC. The information equivalent to
3068 DECL_TEMPLATE_INFO is found in TYPE_TEMPLATE_INFO instead. */
3069 else if (DECL_IMPLICIT_TYPEDEF_P (decl)
3070 && TYPE_TEMPLATE_INFO (TREE_TYPE (decl))
3071 && TYPE_TI_TEMPLATE (TREE_TYPE (decl)))
3073 /* Since a template declaration already existed for this
3074 class-type, we must be redeclaring it here. Make sure
3075 that the redeclaration is valid. */
3076 redeclare_class_template (TREE_TYPE (decl),
3077 current_template_parms);
3078 /* We don't need to create a new TEMPLATE_DECL; just use the
3079 one we already had. */
3080 tmpl = TYPE_TI_TEMPLATE (TREE_TYPE (decl));
3084 tmpl = build_template_decl (decl, current_template_parms,
3088 if (DECL_LANG_SPECIFIC (decl)
3089 && DECL_TEMPLATE_SPECIALIZATION (decl))
3091 /* A specialization of a member template of a template
3093 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl);
3094 DECL_TEMPLATE_INFO (tmpl) = DECL_TEMPLATE_INFO (decl);
3095 DECL_TEMPLATE_INFO (decl) = NULL_TREE;
3101 tree a, t, current, parms;
3104 if (TREE_CODE (decl) == TYPE_DECL)
3106 if ((IS_AGGR_TYPE_CODE (TREE_CODE (TREE_TYPE (decl)))
3107 || TREE_CODE (TREE_TYPE (decl)) == ENUMERAL_TYPE)
3108 && TYPE_TEMPLATE_INFO (TREE_TYPE (decl))
3109 && TYPE_TI_TEMPLATE (TREE_TYPE (decl)))
3110 tmpl = TYPE_TI_TEMPLATE (TREE_TYPE (decl));
3113 error ("%qD does not declare a template type", decl);
3117 else if (!DECL_LANG_SPECIFIC (decl) || !DECL_TEMPLATE_INFO (decl))
3119 error ("template definition of non-template %q#D", decl);
3123 tmpl = DECL_TI_TEMPLATE (decl);
3125 if (DECL_FUNCTION_TEMPLATE_P (tmpl)
3126 && DECL_TEMPLATE_INFO (decl) && DECL_TI_ARGS (decl)
3127 && DECL_TEMPLATE_SPECIALIZATION (decl)
3128 && DECL_MEMBER_TEMPLATE_P (tmpl))
3132 /* The declaration is a specialization of a member
3133 template, declared outside the class. Therefore, the
3134 innermost template arguments will be NULL, so we
3135 replace them with the arguments determined by the
3136 earlier call to check_explicit_specialization. */
3137 args = DECL_TI_ARGS (decl);
3140 = build_template_decl (decl, current_template_parms,
3142 DECL_TEMPLATE_RESULT (new_tmpl) = decl;
3143 TREE_TYPE (new_tmpl) = TREE_TYPE (decl);
3144 DECL_TI_TEMPLATE (decl) = new_tmpl;
3145 SET_DECL_TEMPLATE_SPECIALIZATION (new_tmpl);
3146 DECL_TEMPLATE_INFO (new_tmpl)
3147 = tree_cons (tmpl, args, NULL_TREE);
3149 register_specialization (new_tmpl,
3150 most_general_template (tmpl),
3156 /* Make sure the template headers we got make sense. */
3158 parms = DECL_TEMPLATE_PARMS (tmpl);
3159 i = TMPL_PARMS_DEPTH (parms);
3160 if (TMPL_ARGS_DEPTH (args) != i)
3162 error ("expected %d levels of template parms for %q#D, got %d",
3163 i, decl, TMPL_ARGS_DEPTH (args));
3166 for (current = decl; i > 0; --i, parms = TREE_CHAIN (parms))
3168 a = TMPL_ARGS_LEVEL (args, i);
3169 t = INNERMOST_TEMPLATE_PARMS (parms);
3171 if (TREE_VEC_LENGTH (t) != TREE_VEC_LENGTH (a))
3173 if (current == decl)
3174 error ("got %d template parameters for %q#D",
3175 TREE_VEC_LENGTH (a), decl);
3177 error ("got %d template parameters for %q#T",
3178 TREE_VEC_LENGTH (a), current);
3179 error (" but %d required", TREE_VEC_LENGTH (t));
3180 return error_mark_node;
3183 /* Perhaps we should also check that the parms are used in the
3184 appropriate qualifying scopes in the declarator? */
3186 if (current == decl)
3189 current = TYPE_CONTEXT (current);
3193 DECL_TEMPLATE_RESULT (tmpl) = decl;
3194 TREE_TYPE (tmpl) = TREE_TYPE (decl);
3196 /* Push template declarations for global functions and types. Note
3197 that we do not try to push a global template friend declared in a
3198 template class; such a thing may well depend on the template
3199 parameters of the class. */
3200 if (new_template_p && !ctx
3201 && !(is_friend && template_class_depth (current_class_type) > 0))
3203 tmpl = pushdecl_namespace_level (tmpl, is_friend);
3204 if (tmpl == error_mark_node)
3205 return error_mark_node;
3207 /* Hide template friend classes that haven't been declared yet. */
3208 if (is_friend && TREE_CODE (decl) == TYPE_DECL)
3210 DECL_ANTICIPATED (tmpl) = 1;
3211 DECL_FRIEND_P (tmpl) = 1;
3217 DECL_PRIMARY_TEMPLATE (tmpl) = tmpl;
3218 if (DECL_CONV_FN_P (tmpl))
3220 int depth = TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl));
3222 /* It is a conversion operator. See if the type converted to
3223 depends on innermost template operands. */
3225 if (uses_template_parms_level (TREE_TYPE (TREE_TYPE (tmpl)),
3227 DECL_TEMPLATE_CONV_FN_P (tmpl) = 1;
3231 /* The DECL_TI_ARGS of DECL contains full set of arguments referring
3232 back to its most general template. If TMPL is a specialization,
3233 ARGS may only have the innermost set of arguments. Add the missing
3234 argument levels if necessary. */
3235 if (DECL_TEMPLATE_INFO (tmpl))
3236 args = add_outermost_template_args (DECL_TI_ARGS (tmpl), args);
3238 info = tree_cons (tmpl, args, NULL_TREE);
3240 if (DECL_IMPLICIT_TYPEDEF_P (decl))
3242 SET_TYPE_TEMPLATE_INFO (TREE_TYPE (tmpl), info);
3243 if ((!ctx || TREE_CODE (ctx) != FUNCTION_DECL)
3244 && TREE_CODE (TREE_TYPE (decl)) != ENUMERAL_TYPE
3245 /* Don't change the name if we've already set it up. */
3246 && !IDENTIFIER_TEMPLATE (DECL_NAME (decl)))
3247 DECL_NAME (decl) = classtype_mangled_name (TREE_TYPE (decl));
3249 else if (DECL_LANG_SPECIFIC (decl))
3250 DECL_TEMPLATE_INFO (decl) = info;
3252 return DECL_TEMPLATE_RESULT (tmpl);
3256 push_template_decl (tree decl)
3258 return push_template_decl_real (decl, false);
3261 /* Called when a class template TYPE is redeclared with the indicated
3262 template PARMS, e.g.:
3264 template <class T> struct S;
3265 template <class T> struct S {}; */
3268 redeclare_class_template (tree type, tree parms)
3274 if (!TYPE_TEMPLATE_INFO (type))
3276 error ("%qT is not a template type", type);
3280 tmpl = TYPE_TI_TEMPLATE (type);
3281 if (!PRIMARY_TEMPLATE_P (tmpl))
3282 /* The type is nested in some template class. Nothing to worry
3283 about here; there are no new template parameters for the nested
3289 error ("template specifiers not specified in declaration of %qD",
3294 parms = INNERMOST_TEMPLATE_PARMS (parms);
3295 tmpl_parms = DECL_INNERMOST_TEMPLATE_PARMS (tmpl);
3297 if (TREE_VEC_LENGTH (parms) != TREE_VEC_LENGTH (tmpl_parms))
3299 error ("previous declaration %q+D", tmpl);
3300 error ("used %d template parameter(s) instead of %d",
3301 TREE_VEC_LENGTH (tmpl_parms),
3302 TREE_VEC_LENGTH (parms));
3306 for (i = 0; i < TREE_VEC_LENGTH (tmpl_parms); ++i)
3308 tree tmpl_parm = TREE_VALUE (TREE_VEC_ELT (tmpl_parms, i));
3309 tree parm = TREE_VALUE (TREE_VEC_ELT (parms, i));
3310 tree tmpl_default = TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms, i));
3311 tree parm_default = TREE_PURPOSE (TREE_VEC_ELT (parms, i));
3313 /* TMPL_PARM and PARM can be either TYPE_DECL, PARM_DECL, or
3315 if (TREE_CODE (tmpl_parm) != TREE_CODE (parm)
3316 || (TREE_CODE (tmpl_parm) != TYPE_DECL
3317 && !same_type_p (TREE_TYPE (tmpl_parm), TREE_TYPE (parm))))
3319 error ("template parameter %q+#D", tmpl_parm);
3320 error ("redeclared here as %q#D", parm);
3324 if (tmpl_default != NULL_TREE && parm_default != NULL_TREE)
3326 /* We have in [temp.param]:
3328 A template-parameter may not be given default arguments
3329 by two different declarations in the same scope. */
3330 error ("redefinition of default argument for %q#D", parm);
3331 error ("%J original definition appeared here", tmpl_parm);
3335 if (parm_default != NULL_TREE)
3336 /* Update the previous template parameters (which are the ones
3337 that will really count) with the new default value. */
3338 TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms, i)) = parm_default;
3339 else if (tmpl_default != NULL_TREE)
3340 /* Update the new parameters, too; they'll be used as the
3341 parameters for any members. */
3342 TREE_PURPOSE (TREE_VEC_ELT (parms, i)) = tmpl_default;
3346 /* Simplify EXPR if it is a non-dependent expression. Returns the
3347 (possibly simplified) expression. */
3350 fold_non_dependent_expr (tree expr)
3352 /* If we're in a template, but EXPR isn't value dependent, simplify
3353 it. We're supposed to treat:
3355 template <typename T> void f(T[1 + 1]);
3356 template <typename T> void f(T[2]);
3358 as two declarations of the same function, for example. */
3359 if (processing_template_decl
3360 && !type_dependent_expression_p (expr)
3361 && !value_dependent_expression_p (expr))
3363 HOST_WIDE_INT saved_processing_template_decl;
3365 saved_processing_template_decl = processing_template_decl;
3366 processing_template_decl = 0;
3367 expr = tsubst_copy_and_build (expr,
3370 /*in_decl=*/NULL_TREE,
3371 /*function_p=*/false);
3372 processing_template_decl = saved_processing_template_decl;
3377 /* EXPR is an expression which is used in a constant-expression context.
3378 For instance, it could be a VAR_DECL with a constant initializer.
3379 Extract the innest constant expression.
3381 This is basically a more powerful version of
3382 integral_constant_value, which can be used also in templates where
3383 initializers can maintain a syntactic rather than semantic form
3384 (even if they are non-dependent, for access-checking purposes). */
3387 fold_decl_constant_value (tree expr)
3389 tree const_expr = expr;
3392 expr = fold_non_dependent_expr (const_expr);
3393 const_expr = integral_constant_value (expr);
3395 while (expr != const_expr);
3400 /* Subroutine of convert_nontype_argument. Converts EXPR to TYPE, which
3401 must be a function or a pointer-to-function type, as specified
3402 in [temp.arg.nontype]: disambiguate EXPR if it is an overload set,
3403 and check that the resulting function has external linkage. */
3406 convert_nontype_argument_function (tree type, tree expr)
3411 fn = instantiate_type (type, fns, tf_none);
3412 if (fn == error_mark_node)
3413 return error_mark_node;
3416 if (TREE_CODE (fn_no_ptr) == ADDR_EXPR)
3417 fn_no_ptr = TREE_OPERAND (fn_no_ptr, 0);
3419 /* [temp.arg.nontype]/1
3421 A template-argument for a non-type, non-template template-parameter
3424 -- the address of an object or function with external linkage. */
3425 if (!DECL_EXTERNAL_LINKAGE_P (fn_no_ptr))
3427 error ("%qE is not a valid template argument for type %qT "
3428 "because function %qD has not external linkage",
3429 expr, type, fn_no_ptr);
3436 /* Attempt to convert the non-type template parameter EXPR to the
3437 indicated TYPE. If the conversion is successful, return the
3438 converted value. If the conversion is unsuccessful, return
3439 NULL_TREE if we issued an error message, or error_mark_node if we
3440 did not. We issue error messages for out-and-out bad template
3441 parameters, but not simply because the conversion failed, since we
3442 might be just trying to do argument deduction. Both TYPE and EXPR
3443 must be non-dependent.
3445 The conversion follows the special rules described in
3446 [temp.arg.nontype], and it is much more strict than an implicit
3449 This function is called twice for each template argument (see
3450 lookup_template_class for a more accurate description of this
3451 problem). This means that we need to handle expressions which
3452 are not valid in a C++ source, but can be created from the
3453 first call (for instance, casts to perform conversions). These
3454 hacks can go away after we fix the double coercion problem. */
3457 convert_nontype_argument (tree type, tree expr)
3461 /* Detect immediately string literals as invalid non-type argument.
3462 This special-case is not needed for correctness (we would easily
3463 catch this later), but only to provide better diagnostic for this
3464 common user mistake. As suggested by DR 100, we do not mention
3465 linkage issues in the diagnostic as this is not the point. */
3466 if (TREE_CODE (expr) == STRING_CST)
3468 error ("%qE is not a valid template argument for type %qT "
3469 "because string literals can never be used in this context",
3474 /* If we are in a template, EXPR may be non-dependent, but still
3475 have a syntactic, rather than semantic, form. For example, EXPR
3476 might be a SCOPE_REF, rather than the VAR_DECL to which the
3477 SCOPE_REF refers. Preserving the qualifying scope is necessary
3478 so that access checking can be performed when the template is
3479 instantiated -- but here we need the resolved form so that we can
3480 convert the argument. */
3481 expr = fold_non_dependent_expr (expr);
3482 if (error_operand_p (expr))
3483 return error_mark_node;
3484 expr_type = TREE_TYPE (expr);
3486 /* HACK: Due to double coercion, we can get a
3487 NOP_EXPR<REFERENCE_TYPE>(ADDR_EXPR<POINTER_TYPE> (arg)) here,
3488 which is the tree that we built on the first call (see
3489 below when coercing to reference to object or to reference to
3490 function). We just strip everything and get to the arg.
3491 See g++.old-deja/g++.oliva/template4.C and g++.dg/template/nontype9.C
3493 if (TREE_CODE (expr) == NOP_EXPR)
3495 if (TYPE_REF_OBJ_P (type) || TYPE_REFFN_P (type))
3497 /* ??? Maybe we could use convert_from_reference here, but we
3498 would need to relax its constraints because the NOP_EXPR
3499 could actually change the type to something more cv-qualified,
3500 and this is not folded by convert_from_reference. */
3501 tree addr = TREE_OPERAND (expr, 0);
3502 gcc_assert (TREE_CODE (expr_type) == REFERENCE_TYPE);
3503 gcc_assert (TREE_CODE (addr) == ADDR_EXPR);
3504 gcc_assert (TREE_CODE (TREE_TYPE (addr)) == POINTER_TYPE);
3505 gcc_assert (same_type_ignoring_top_level_qualifiers_p
3506 (TREE_TYPE (expr_type),
3507 TREE_TYPE (TREE_TYPE (addr))));
3509 expr = TREE_OPERAND (addr, 0);
3510 expr_type = TREE_TYPE (expr);
3513 /* We could also generate a NOP_EXPR(ADDR_EXPR()) when the
3514 parameter is a pointer to object, through decay and
3515 qualification conversion. Let's strip everything. */
3516 else if (TYPE_PTROBV_P (type))
3519 gcc_assert (TREE_CODE (expr) == ADDR_EXPR);
3520 gcc_assert (TREE_CODE (TREE_TYPE (expr)) == POINTER_TYPE);
3521 /* Skip the ADDR_EXPR only if it is part of the decay for
3522 an array. Otherwise, it is part of the original argument
3523 in the source code. */
3524 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (expr, 0))) == ARRAY_TYPE)
3525 expr = TREE_OPERAND (expr, 0);
3526 expr_type = TREE_TYPE (expr);
3530 /* [temp.arg.nontype]/5, bullet 1
3532 For a non-type template-parameter of integral or enumeration type,
3533 integral promotions (_conv.prom_) and integral conversions
3534 (_conv.integral_) are applied. */
3535 if (INTEGRAL_TYPE_P (type))
3537 if (!INTEGRAL_TYPE_P (expr_type))
3538 return error_mark_node;
3540 expr = fold_decl_constant_value (expr);
3541 /* Notice that there are constant expressions like '4 % 0' which
3542 do not fold into integer constants. */
3543 if (TREE_CODE (expr) != INTEGER_CST)
3545 error ("%qE is not a valid template argument for type %qT "
3546 "because it is a non-constant expression", expr, type);
3550 /* At this point, an implicit conversion does what we want,
3551 because we already know that the expression is of integral
3553 expr = ocp_convert (type, expr, CONV_IMPLICIT, LOOKUP_PROTECT);
3554 if (expr == error_mark_node)
3555 return error_mark_node;
3557 /* Conversion was allowed: fold it to a bare integer constant. */
3560 /* [temp.arg.nontype]/5, bullet 2
3562 For a non-type template-parameter of type pointer to object,
3563 qualification conversions (_conv.qual_) and the array-to-pointer
3564 conversion (_conv.array_) are applied. */
3565 else if (TYPE_PTROBV_P (type))
3567 /* [temp.arg.nontype]/1 (TC1 version, DR 49):
3569 A template-argument for a non-type, non-template template-parameter
3570 shall be one of: [...]
3572 -- the name of a non-type template-parameter;
3573 -- the address of an object or function with external linkage, [...]
3574 expressed as "& id-expression" where the & is optional if the name
3575 refers to a function or array, or if the corresponding
3576 template-parameter is a reference.
3578 Here, we do not care about functions, as they are invalid anyway
3579 for a parameter of type pointer-to-object. */
3580 bool constant_address_p =
3581 (TREE_CODE (expr) == ADDR_EXPR
3582 || TREE_CODE (expr_type) == ARRAY_TYPE
3583 || (DECL_P (expr) && DECL_TEMPLATE_PARM_P (expr)));
3585 expr = decay_conversion (expr);
3586 if (expr == error_mark_node)
3587 return error_mark_node;
3589 expr = perform_qualification_conversions (type, expr);
3590 if (expr == error_mark_node)
3591 return error_mark_node;
3593 if (!constant_address_p)
3595 error ("%qE is not a valid template argument for type %qT "
3596 "because it is not a constant pointer", expr, type);
3600 /* [temp.arg.nontype]/5, bullet 3
3602 For a non-type template-parameter of type reference to object, no
3603 conversions apply. The type referred to by the reference may be more
3604 cv-qualified than the (otherwise identical) type of the
3605 template-argument. The template-parameter is bound directly to the
3606 template-argument, which must be an lvalue. */
3607 else if (TYPE_REF_OBJ_P (type))
3609 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type),
3611 return error_mark_node;
3613 if (!at_least_as_qualified_p (TREE_TYPE (type), expr_type))
3615 error ("%qE is not a valid template argument for type %qT "
3616 "because of conflicts in cv-qualification", expr, type);
3620 if (!real_lvalue_p (expr))
3622 error ("%qE is not a valid template argument for type %qT "
3623 "because it is not a lvalue", expr, type);
3627 /* [temp.arg.nontype]/1
3629 A template-argument for a non-type, non-template template-parameter
3630 shall be one of: [...]
3632 -- the address of an object or function with external linkage. */
3633 if (!DECL_EXTERNAL_LINKAGE_P (expr))
3635 error ("%qE is not a valid template argument for type %qT "
3636 "because object %qD has not external linkage",
3641 expr = build_nop (type, build_address (expr));
3643 /* [temp.arg.nontype]/5, bullet 4
3645 For a non-type template-parameter of type pointer to function, only
3646 the function-to-pointer conversion (_conv.func_) is applied. If the
3647 template-argument represents a set of overloaded functions (or a
3648 pointer to such), the matching function is selected from the set
3650 else if (TYPE_PTRFN_P (type))
3652 /* If the argument is a template-id, we might not have enough
3653 context information to decay the pointer. */
3654 if (!type_unknown_p (expr_type))
3656 expr = decay_conversion (expr);
3657 if (expr == error_mark_node)
3658 return error_mark_node;
3661 expr = convert_nontype_argument_function (type, expr);
3662 if (!expr || expr == error_mark_node)
3665 /* [temp.arg.nontype]/5, bullet 5
3667 For a non-type template-parameter of type reference to function, no
3668 conversions apply. If the template-argument represents a set of
3669 overloaded functions, the matching function is selected from the set
3671 else if (TYPE_REFFN_P (type))
3673 if (TREE_CODE (expr) == ADDR_EXPR)
3675 error ("%qE is not a valid template argument for type %qT "
3676 "because it is a pointer", expr, type);
3677 inform ("try using %qE instead", TREE_OPERAND (expr, 0));
3681 expr = convert_nontype_argument_function (TREE_TYPE (type), expr);
3682 if (!expr || expr == error_mark_node)
3685 expr = build_nop (type, build_address (expr));
3687 /* [temp.arg.nontype]/5, bullet 6
3689 For a non-type template-parameter of type pointer to member function,
3690 no conversions apply. If the template-argument represents a set of
3691 overloaded member functions, the matching member function is selected
3692 from the set (_over.over_). */
3693 else if (TYPE_PTRMEMFUNC_P (type))
3695 expr = instantiate_type (type, expr, tf_none);
3696 if (expr == error_mark_node)
3697 return error_mark_node;
3699 /* There is no way to disable standard conversions in
3700 resolve_address_of_overloaded_function (called by
3701 instantiate_type). It is possible that the call succeeded by
3702 converting &B::I to &D::I (where B is a base of D), so we need
3703 to reject this conversion here.
3705 Actually, even if there was a way to disable standard conversions,
3706 it would still be better to reject them here so that we can
3707 provide a superior diagnostic. */
3708 if (!same_type_p (TREE_TYPE (expr), type))
3710 /* Make sure we are just one standard conversion off. */
3711 gcc_assert (can_convert (type, TREE_TYPE (expr)));
3712 error ("%qE is not a valid template argument for type %qT "
3713 "because it is of type %qT", expr, type,
3715 inform ("standard conversions are not allowed in this context");
3719 /* [temp.arg.nontype]/5, bullet 7
3721 For a non-type template-parameter of type pointer to data member,
3722 qualification conversions (_conv.qual_) are applied. */
3723 else if (TYPE_PTRMEM_P (type))
3725 expr = perform_qualification_conversions (type, expr);
3726 if (expr == error_mark_node)
3729 /* A template non-type parameter must be one of the above. */
3733 /* Sanity check: did we actually convert the argument to the
3735 gcc_assert (same_type_p (type, TREE_TYPE (expr)));
3740 /* Return 1 if PARM_PARMS and ARG_PARMS matches using rule for
3741 template template parameters. Both PARM_PARMS and ARG_PARMS are
3742 vectors of TREE_LIST nodes containing TYPE_DECL, TEMPLATE_DECL
3745 Consider the example:
3746 template <class T> class A;
3747 template<template <class U> class TT> class B;
3749 For B<A>, PARM_PARMS are the parameters to TT, while ARG_PARMS are
3750 the parameters to A, and OUTER_ARGS contains A. */
3753 coerce_template_template_parms (tree parm_parms,
3755 tsubst_flags_t complain,
3759 int nparms, nargs, i;
3762 gcc_assert (TREE_CODE (parm_parms) == TREE_VEC);
3763 gcc_assert (TREE_CODE (arg_parms) == TREE_VEC);
3765 nparms = TREE_VEC_LENGTH (parm_parms);
3766 nargs = TREE_VEC_LENGTH (arg_parms);
3768 if (nargs != nparms)
3771 for (i = 0; i < nparms; ++i)
3773 parm = TREE_VALUE (TREE_VEC_ELT (parm_parms, i));
3774 arg = TREE_VALUE (TREE_VEC_ELT (arg_parms, i));
3776 if (arg == NULL_TREE || arg == error_mark_node
3777 || parm == NULL_TREE || parm == error_mark_node)
3780 if (TREE_CODE (arg) != TREE_CODE (parm))
3783 switch (TREE_CODE (parm))
3789 /* We encounter instantiations of templates like
3790 template <template <template <class> class> class TT>
3793 tree parmparm = DECL_INNERMOST_TEMPLATE_PARMS (parm);
3794 tree argparm = DECL_INNERMOST_TEMPLATE_PARMS (arg);
3796 if (!coerce_template_template_parms
3797 (parmparm, argparm, complain, in_decl, outer_args))
3803 /* The tsubst call is used to handle cases such as
3805 template <int> class C {};
3806 template <class T, template <T> class TT> class D {};
3809 i.e. the parameter list of TT depends on earlier parameters. */
3810 if (!dependent_type_p (TREE_TYPE (arg))
3812 (tsubst (TREE_TYPE (parm), outer_args, complain, in_decl),
3824 /* Convert the indicated template ARG as necessary to match the
3825 indicated template PARM. Returns the converted ARG, or
3826 error_mark_node if the conversion was unsuccessful. Error and
3827 warning messages are issued under control of COMPLAIN. This
3828 conversion is for the Ith parameter in the parameter list. ARGS is
3829 the full set of template arguments deduced so far. */
3832 convert_template_argument (tree parm,
3835 tsubst_flags_t complain,
3841 int is_type, requires_type, is_tmpl_type, requires_tmpl_type;
3843 inner_args = INNERMOST_TEMPLATE_ARGS (args);
3845 if (TREE_CODE (arg) == TREE_LIST
3846 && TREE_CODE (TREE_VALUE (arg)) == OFFSET_REF)
3848 /* The template argument was the name of some
3849 member function. That's usually
3850 invalid, but static members are OK. In any
3851 case, grab the underlying fields/functions
3852 and issue an error later if required. */
3853 arg = TREE_VALUE (arg);
3854 TREE_TYPE (arg) = unknown_type_node;
3857 requires_tmpl_type = TREE_CODE (parm) == TEMPLATE_DECL;
3858 requires_type = (TREE_CODE (parm) == TYPE_DECL
3859 || requires_tmpl_type);
3861 is_tmpl_type = ((TREE_CODE (arg) == TEMPLATE_DECL
3862 && TREE_CODE (DECL_TEMPLATE_RESULT (arg)) == TYPE_DECL)
3863 || TREE_CODE (arg) == TEMPLATE_TEMPLATE_PARM
3864 || TREE_CODE (arg) == UNBOUND_CLASS_TEMPLATE);
3867 && (TREE_CODE (arg) == TEMPLATE_TEMPLATE_PARM
3868 || TREE_CODE (arg) == UNBOUND_CLASS_TEMPLATE))
3869 arg = TYPE_STUB_DECL (arg);
3871 is_type = TYPE_P (arg) || is_tmpl_type;
3873 if (requires_type && ! is_type && TREE_CODE (arg) == SCOPE_REF
3874 && TREE_CODE (TREE_OPERAND (arg, 0)) == TEMPLATE_TYPE_PARM)
3876 pedwarn ("to refer to a type member of a template parameter, "
3877 "use %<typename %E%>", arg);
3879 arg = make_typename_type (TREE_OPERAND (arg, 0),
3880 TREE_OPERAND (arg, 1),
3882 complain & tf_error);
3885 if (is_type != requires_type)
3889 if (complain & tf_error)
3891 error ("type/value mismatch at argument %d in template "
3892 "parameter list for %qD",
3895 error (" expected a constant of type %qT, got %qT",
3897 (is_tmpl_type ? DECL_NAME (arg) : arg));
3898 else if (requires_tmpl_type)
3899 error (" expected a class template, got %qE", arg);
3901 error (" expected a type, got %qE", arg);
3904 return error_mark_node;
3906 if (is_tmpl_type ^ requires_tmpl_type)
3908 if (in_decl && (complain & tf_error))
3910 error ("type/value mismatch at argument %d in template "
3911 "parameter list for %qD",
3914 error (" expected a type, got %qT", DECL_NAME (arg));
3916 error (" expected a class template, got %qT", arg);
3918 return error_mark_node;
3923 if (requires_tmpl_type)
3925 if (TREE_CODE (TREE_TYPE (arg)) == UNBOUND_CLASS_TEMPLATE)
3926 /* The number of argument required is not known yet.
3927 Just accept it for now. */
3928 val = TREE_TYPE (arg);
3931 tree parmparm = DECL_INNERMOST_TEMPLATE_PARMS (parm);
3932 tree argparm = DECL_INNERMOST_TEMPLATE_PARMS (arg);
3934 if (coerce_template_template_parms (parmparm, argparm,
3940 /* TEMPLATE_TEMPLATE_PARM node is preferred over
3942 if (val != error_mark_node
3943 && DECL_TEMPLATE_TEMPLATE_PARM_P (val))
3944 val = TREE_TYPE (val);
3948 if (in_decl && (complain & tf_error))
3950 error ("type/value mismatch at argument %d in "
3951 "template parameter list for %qD",
3953 error (" expected a template of type %qD, got %qD",
3957 val = error_mark_node;
3963 /* We only form one instance of each template specialization.
3964 Therefore, if we use a non-canonical variant (i.e., a
3965 typedef), any future messages referring to the type will use
3966 the typedef, which is confusing if those future uses do not
3967 themselves also use the typedef. */
3969 val = canonical_type_variant (val);
3973 tree t = tsubst (TREE_TYPE (parm), args, complain, in_decl);
3975 if (invalid_nontype_parm_type_p (t, complain))
3976 return error_mark_node;
3978 if (!uses_template_parms (arg) && !uses_template_parms (t))
3979 /* We used to call digest_init here. However, digest_init
3980 will report errors, which we don't want when complain
3981 is zero. More importantly, digest_init will try too
3982 hard to convert things: for example, `0' should not be
3983 converted to pointer type at this point according to
3984 the standard. Accepting this is not merely an
3985 extension, since deciding whether or not these
3986 conversions can occur is part of determining which
3987 function template to call, or whether a given explicit
3988 argument specification is valid. */
3989 val = convert_nontype_argument (t, arg);
3993 if (val == NULL_TREE)
3994 val = error_mark_node;
3995 else if (val == error_mark_node && (complain & tf_error))
3996 error ("could not convert template argument %qE to %qT", arg, t);
4002 /* Convert all template arguments to their appropriate types, and
4003 return a vector containing the innermost resulting template
4004 arguments. If any error occurs, return error_mark_node. Error and
4005 warning messages are issued under control of COMPLAIN.
4007 If REQUIRE_ALL_ARGS is false, argument deduction will be performed
4008 for arguments not specified in ARGS. Otherwise, if
4009 USE_DEFAULT_ARGS is true, default arguments will be used to fill in
4010 unspecified arguments. If REQUIRE_ALL_ARGS is true, but
4011 USE_DEFAULT_ARGS is false, then all arguments must be specified in
4015 coerce_template_parms (tree parms,
4018 tsubst_flags_t complain,
4019 bool require_all_args,
4020 bool use_default_args)
4022 int nparms, nargs, i, lost = 0;
4025 tree new_inner_args;
4027 inner_args = INNERMOST_TEMPLATE_ARGS (args);
4028 nargs = inner_args ? NUM_TMPL_ARGS (inner_args) : 0;
4029 nparms = TREE_VEC_LENGTH (parms);
4034 && (!use_default_args
4035 || !TREE_PURPOSE (TREE_VEC_ELT (parms, nargs)))))
4037 if (complain & tf_error)
4039 error ("wrong number of template arguments (%d, should be %d)",
4043 error ("provided for %q+D", in_decl);
4046 return error_mark_node;
4049 new_inner_args = make_tree_vec (nparms);
4050 new_args = add_outermost_template_args (args, new_inner_args);
4051 for (i = 0; i < nparms; i++)
4056 /* Get the Ith template parameter. */
4057 parm = TREE_VEC_ELT (parms, i);
4059 /* Calculate the Ith argument. */
4061 arg = TREE_VEC_ELT (inner_args, i);
4062 else if (require_all_args)
4063 /* There must be a default arg in this case. */
4064 arg = tsubst_template_arg (TREE_PURPOSE (parm), new_args,
4070 if (arg == error_mark_node)
4072 if (complain & tf_error)
4073 error ("template argument %d is invalid", i + 1);
4076 arg = convert_template_argument (TREE_VALUE (parm),
4077 arg, new_args, complain, i,
4080 if (arg == error_mark_node)
4082 TREE_VEC_ELT (new_inner_args, i) = arg;
4086 return error_mark_node;
4088 return new_inner_args;
4091 /* Returns 1 if template args OT and NT are equivalent. */
4094 template_args_equal (tree ot, tree nt)
4099 if (TREE_CODE (nt) == TREE_VEC)
4100 /* For member templates */
4101 return TREE_CODE (ot) == TREE_VEC && comp_template_args (ot, nt);
4102 else if (TYPE_P (nt))
4103 return TYPE_P (ot) && same_type_p (ot, nt);
4104 else if (TREE_CODE (ot) == TREE_VEC || TYPE_P (ot))
4107 return cp_tree_equal (ot, nt);
4110 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets
4111 of template arguments. Returns 0 otherwise. */
4114 comp_template_args (tree oldargs, tree newargs)
4118 if (TREE_VEC_LENGTH (oldargs) != TREE_VEC_LENGTH (newargs))
4121 for (i = 0; i < TREE_VEC_LENGTH (oldargs); ++i)
4123 tree nt = TREE_VEC_ELT (newargs, i);
4124 tree ot = TREE_VEC_ELT (oldargs, i);
4126 if (! template_args_equal (ot, nt))
4132 /* Given class template name and parameter list, produce a user-friendly name
4133 for the instantiation. */
4136 mangle_class_name_for_template (const char* name, tree parms, tree arglist)
4138 static struct obstack scratch_obstack;
4139 static char *scratch_firstobj;
4142 if (!scratch_firstobj)
4143 gcc_obstack_init (&scratch_obstack);
4145 obstack_free (&scratch_obstack, scratch_firstobj);
4146 scratch_firstobj = (char *) obstack_alloc (&scratch_obstack, 1);
4148 #define ccat(C) obstack_1grow (&scratch_obstack, (C));
4149 #define cat(S) obstack_grow (&scratch_obstack, (S), strlen (S))
4153 nparms = TREE_VEC_LENGTH (parms);
4154 arglist = INNERMOST_TEMPLATE_ARGS (arglist);
4155 gcc_assert (nparms == TREE_VEC_LENGTH (arglist));
4156 for (i = 0; i < nparms; i++)
4158 tree parm = TREE_VALUE (TREE_VEC_ELT (parms, i));
4159 tree arg = TREE_VEC_ELT (arglist, i);
4164 if (TREE_CODE (parm) == TYPE_DECL)
4166 cat (type_as_string (arg, TFF_CHASE_TYPEDEF));
4169 else if (TREE_CODE (parm) == TEMPLATE_DECL)
4171 if (TREE_CODE (arg) == TEMPLATE_DECL)
4173 /* Already substituted with real template. Just output
4174 the template name here */
4175 tree context = DECL_CONTEXT (arg);
4178 /* The template may be defined in a namespace, or
4179 may be a member template. */
4180 gcc_assert (TREE_CODE (context) == NAMESPACE_DECL
4181 || CLASS_TYPE_P (context));
4182 cat (decl_as_string (DECL_CONTEXT (arg),
4183 TFF_PLAIN_IDENTIFIER));
4186 cat (IDENTIFIER_POINTER (DECL_NAME (arg)));
4189 /* Output the parameter declaration. */
4190 cat (type_as_string (arg, TFF_CHASE_TYPEDEF));
4194 gcc_assert (TREE_CODE (parm) == PARM_DECL);
4196 /* No need to check arglist against parmlist here; we did that
4197 in coerce_template_parms, called from lookup_template_class. */
4198 cat (expr_as_string (arg, TFF_PLAIN_IDENTIFIER));
4201 char *bufp = obstack_next_free (&scratch_obstack);
4203 while (bufp[offset - 1] == ' ')
4205 obstack_blank_fast (&scratch_obstack, offset);
4207 /* B<C<char> >, not B<C<char>> */
4208 if (bufp[offset - 1] == '>')
4213 return (char *) obstack_base (&scratch_obstack);
4217 classtype_mangled_name (tree t)
4219 if (CLASSTYPE_TEMPLATE_INFO (t)
4220 /* Specializations have already had their names set up in
4221 lookup_template_class. */
4222 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (t))
4224 tree tmpl = most_general_template (CLASSTYPE_TI_TEMPLATE (t));
4226 /* For non-primary templates, the template parameters are
4227 implicit from their surrounding context. */
4228 if (PRIMARY_TEMPLATE_P (tmpl))
4230 tree name = DECL_NAME (tmpl);
4231 char *mangled_name = mangle_class_name_for_template
4232 (IDENTIFIER_POINTER (name),
4233 DECL_INNERMOST_TEMPLATE_PARMS (tmpl),
4234 CLASSTYPE_TI_ARGS (t));
4235 tree id = get_identifier (mangled_name);
4236 IDENTIFIER_TEMPLATE (id) = name;
4241 return TYPE_IDENTIFIER (t);
4245 add_pending_template (tree d)
4247 tree ti = (TYPE_P (d)
4248 ? CLASSTYPE_TEMPLATE_INFO (d)
4249 : DECL_TEMPLATE_INFO (d));
4253 if (TI_PENDING_TEMPLATE_FLAG (ti))
4256 /* We are called both from instantiate_decl, where we've already had a
4257 tinst_level pushed, and instantiate_template, where we haven't.
4259 level = !(current_tinst_level && TINST_DECL (current_tinst_level) == d);
4262 push_tinst_level (d);
4264 pt = tree_cons (current_tinst_level, d, NULL_TREE);
4265 if (last_pending_template)
4266 TREE_CHAIN (last_pending_template) = pt;
4268 pending_templates = pt;
4270 last_pending_template = pt;
4272 TI_PENDING_TEMPLATE_FLAG (ti) = 1;
4279 /* Return a TEMPLATE_ID_EXPR corresponding to the indicated FNS and
4280 ARGLIST. Valid choices for FNS are given in the cp-tree.def
4281 documentation for TEMPLATE_ID_EXPR. */
4284 lookup_template_function (tree fns, tree arglist)
4288 if (fns == error_mark_node || arglist == error_mark_node)
4289 return error_mark_node;
4291 gcc_assert (!arglist || TREE_CODE (arglist) == TREE_VEC);
4292 gcc_assert (fns && (is_overloaded_fn (fns)
4293 || TREE_CODE (fns) == IDENTIFIER_NODE));
4295 if (BASELINK_P (fns))
4297 BASELINK_FUNCTIONS (fns) = build2 (TEMPLATE_ID_EXPR,
4299 BASELINK_FUNCTIONS (fns),
4304 type = TREE_TYPE (fns);
4305 if (TREE_CODE (fns) == OVERLOAD || !type)
4306 type = unknown_type_node;
4308 return build2 (TEMPLATE_ID_EXPR, type, fns, arglist);
4311 /* Within the scope of a template class S<T>, the name S gets bound
4312 (in build_self_reference) to a TYPE_DECL for the class, not a
4313 TEMPLATE_DECL. If DECL is a TYPE_DECL for current_class_type,
4314 or one of its enclosing classes, and that type is a template,
4315 return the associated TEMPLATE_DECL. Otherwise, the original
4316 DECL is returned. */
4319 maybe_get_template_decl_from_type_decl (tree decl)
4321 return (decl != NULL_TREE
4322 && TREE_CODE (decl) == TYPE_DECL
4323 && DECL_ARTIFICIAL (decl)
4324 && CLASS_TYPE_P (TREE_TYPE (decl))
4325 && CLASSTYPE_TEMPLATE_INFO (TREE_TYPE (decl)))
4326 ? CLASSTYPE_TI_TEMPLATE (TREE_TYPE (decl)) : decl;
4329 /* Given an IDENTIFIER_NODE (type TEMPLATE_DECL) and a chain of
4330 parameters, find the desired type.
4332 D1 is the PTYPENAME terminal, and ARGLIST is the list of arguments.
4334 IN_DECL, if non-NULL, is the template declaration we are trying to
4337 If ENTERING_SCOPE is nonzero, we are about to enter the scope of
4338 the class we are looking up.
4340 Issue error and warning messages under control of COMPLAIN.
4342 If the template class is really a local class in a template
4343 function, then the FUNCTION_CONTEXT is the function in which it is
4346 ??? Note that this function is currently called *twice* for each
4347 template-id: the first time from the parser, while creating the
4348 incomplete type (finish_template_type), and the second type during the
4349 real instantiation (instantiate_template_class). This is surely something
4350 that we want to avoid. It also causes some problems with argument
4351 coercion (see convert_nontype_argument for more information on this). */
4354 lookup_template_class (tree d1,
4359 tsubst_flags_t complain)
4361 tree template = NULL_TREE, parmlist;
4364 timevar_push (TV_NAME_LOOKUP);
4366 if (TREE_CODE (d1) == IDENTIFIER_NODE)
4368 tree value = innermost_non_namespace_value (d1);
4369 if (value && DECL_TEMPLATE_TEMPLATE_PARM_P (value))
4374 push_decl_namespace (context);
4375 template = lookup_name (d1);
4376 template = maybe_get_template_decl_from_type_decl (template);
4378 pop_decl_namespace ();
4381 context = DECL_CONTEXT (template);
4383 else if (TREE_CODE (d1) == TYPE_DECL && IS_AGGR_TYPE (TREE_TYPE (d1)))
4385 tree type = TREE_TYPE (d1);
4387 /* If we are declaring a constructor, say A<T>::A<T>, we will get
4388 an implicit typename for the second A. Deal with it. */
4389 if (TREE_CODE (type) == TYPENAME_TYPE && TREE_TYPE (type))
4390 type = TREE_TYPE (type);
4392 if (CLASSTYPE_TEMPLATE_INFO (type))
4394 template = CLASSTYPE_TI_TEMPLATE (type);
4395 d1 = DECL_NAME (template);
4398 else if (TREE_CODE (d1) == ENUMERAL_TYPE
4399 || (TYPE_P (d1) && IS_AGGR_TYPE (d1)))
4401 template = TYPE_TI_TEMPLATE (d1);
4402 d1 = DECL_NAME (template);
4404 else if (TREE_CODE (d1) == TEMPLATE_DECL
4405 && TREE_CODE (DECL_TEMPLATE_RESULT (d1)) == TYPE_DECL)
4408 d1 = DECL_NAME (template);
4409 context = DECL_CONTEXT (template);
4412 /* Issue an error message if we didn't find a template. */
4415 if (complain & tf_error)
4416 error ("%qT is not a template", d1);
4417 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node);
4420 if (TREE_CODE (template) != TEMPLATE_DECL
4421 /* Make sure it's a user visible template, if it was named by
4423 || ((complain & tf_user) && !DECL_TEMPLATE_PARM_P (template)
4424 && !PRIMARY_TEMPLATE_P (template)))
4426 if (complain & tf_error)
4428 error ("non-template type %qT used as a template", d1);
4430 error ("for template declaration %q+D", in_decl);
4432 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node);
4435 complain &= ~tf_user;
4437 if (DECL_TEMPLATE_TEMPLATE_PARM_P (template))
4439 /* Create a new TEMPLATE_DECL and TEMPLATE_TEMPLATE_PARM node to store
4440 template arguments */
4445 parmlist = DECL_INNERMOST_TEMPLATE_PARMS (template);
4447 /* Consider an example where a template template parameter declared as
4449 template <class T, class U = std::allocator<T> > class TT
4451 The template parameter level of T and U are one level larger than
4452 of TT. To proper process the default argument of U, say when an
4453 instantiation `TT<int>' is seen, we need to build the full
4454 arguments containing {int} as the innermost level. Outer levels,
4455 available when not appearing as default template argument, can be
4456 obtained from `current_template_args ()'.
4458 Suppose that TT is later substituted with std::vector. The above
4459 instantiation is `TT<int, std::allocator<T> >' with TT at
4460 level 1, and T at level 2, while the template arguments at level 1
4461 becomes {std::vector} and the inner level 2 is {int}. */
4463 if (current_template_parms)
4464 arglist = add_to_template_args (current_template_args (), arglist);
4466 arglist2 = coerce_template_parms (parmlist, arglist, template,
4468 /*require_all_args=*/true,
4469 /*use_default_args=*/true);
4470 if (arglist2 == error_mark_node
4471 || (!uses_template_parms (arglist2)
4472 && check_instantiated_args (template, arglist2, complain)))
4473 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node);
4475 parm = bind_template_template_parm (TREE_TYPE (template), arglist2);
4476 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, parm);
4480 tree template_type = TREE_TYPE (template);
4483 tree found = NULL_TREE;
4486 int is_partial_instantiation;
4488 gen_tmpl = most_general_template (template);
4489 parmlist = DECL_TEMPLATE_PARMS (gen_tmpl);
4490 parm_depth = TMPL_PARMS_DEPTH (parmlist);
4491 arg_depth = TMPL_ARGS_DEPTH (arglist);
4493 if (arg_depth == 1 && parm_depth > 1)
4495 /* We've been given an incomplete set of template arguments.
4498 template <class T> struct S1 {
4499 template <class U> struct S2 {};
4500 template <class U> struct S2<U*> {};
4503 we will be called with an ARGLIST of `U*', but the
4504 TEMPLATE will be `template <class T> template
4505 <class U> struct S1<T>::S2'. We must fill in the missing
4508 = add_outermost_template_args (TYPE_TI_ARGS (TREE_TYPE (template)),
4510 arg_depth = TMPL_ARGS_DEPTH (arglist);
4513 /* Now we should have enough arguments. */
4514 gcc_assert (parm_depth == arg_depth);
4516 /* From here on, we're only interested in the most general
4518 template = gen_tmpl;
4520 /* Calculate the BOUND_ARGS. These will be the args that are
4521 actually tsubst'd into the definition to create the
4525 /* We have multiple levels of arguments to coerce, at once. */
4527 int saved_depth = TMPL_ARGS_DEPTH (arglist);
4529 tree bound_args = make_tree_vec (parm_depth);
4531 for (i = saved_depth,
4532 t = DECL_TEMPLATE_PARMS (template);
4533 i > 0 && t != NULL_TREE;
4534 --i, t = TREE_CHAIN (t))
4536 tree a = coerce_template_parms (TREE_VALUE (t),
4539 /*require_all_args=*/true,
4540 /*use_default_args=*/true);
4542 /* Don't process further if one of the levels fails. */
4543 if (a == error_mark_node)
4545 /* Restore the ARGLIST to its full size. */
4546 TREE_VEC_LENGTH (arglist) = saved_depth;
4547 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node);
4550 SET_TMPL_ARGS_LEVEL (bound_args, i, a);
4552 /* We temporarily reduce the length of the ARGLIST so
4553 that coerce_template_parms will see only the arguments
4554 corresponding to the template parameters it is
4556 TREE_VEC_LENGTH (arglist)--;
4559 /* Restore the ARGLIST to its full size. */
4560 TREE_VEC_LENGTH (arglist) = saved_depth;
4562 arglist = bound_args;
4566 = coerce_template_parms (INNERMOST_TEMPLATE_PARMS (parmlist),
4567 INNERMOST_TEMPLATE_ARGS (arglist),
4570 /*require_all_args=*/true,
4571 /*use_default_args=*/true);
4573 if (arglist == error_mark_node)
4574 /* We were unable to bind the arguments. */
4575 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node);
4577 /* In the scope of a template class, explicit references to the
4578 template class refer to the type of the template, not any
4579 instantiation of it. For example, in:
4581 template <class T> class C { void f(C<T>); }
4583 the `C<T>' is just the same as `C'. Outside of the
4584 class, however, such a reference is an instantiation. */
4585 if (comp_template_args (TYPE_TI_ARGS (template_type),
4588 found = template_type;
4590 if (!entering_scope && PRIMARY_TEMPLATE_P (template))
4594 for (ctx = current_class_type;
4595 ctx && TREE_CODE (ctx) != NAMESPACE_DECL;
4597 ? TYPE_CONTEXT (ctx)
4598 : DECL_CONTEXT (ctx)))
4599 if (TYPE_P (ctx) && same_type_p (ctx, template_type))
4602 /* We're not in the scope of the class, so the
4603 TEMPLATE_TYPE is not the type we want after all. */
4609 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, found);
4611 /* If we already have this specialization, return it. */
4612 found = retrieve_specialization (template, arglist,
4613 /*class_specializations_p=*/false);
4615 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, found);
4617 /* This type is a "partial instantiation" if any of the template
4618 arguments still involve template parameters. Note that we set
4619 IS_PARTIAL_INSTANTIATION for partial specializations as
4621 is_partial_instantiation = uses_template_parms (arglist);
4623 /* If the deduced arguments are invalid, then the binding
4625 if (!is_partial_instantiation
4626 && check_instantiated_args (template,
4627 INNERMOST_TEMPLATE_ARGS (arglist),
4629 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node);
4631 if (!is_partial_instantiation
4632 && !PRIMARY_TEMPLATE_P (template)
4633 && TREE_CODE (CP_DECL_CONTEXT (template)) == NAMESPACE_DECL)
4635 found = xref_tag_from_type (TREE_TYPE (template),
4636 DECL_NAME (template),
4637 /*tag_scope=*/ts_global);
4638 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, found);
4641 context = tsubst (DECL_CONTEXT (template), arglist,
4644 context = global_namespace;
4646 /* Create the type. */
4647 if (TREE_CODE (template_type) == ENUMERAL_TYPE)
4649 if (!is_partial_instantiation)
4651 set_current_access_from_decl (TYPE_NAME (template_type));
4652 t = start_enum (TYPE_IDENTIFIER (template_type));
4655 /* We don't want to call start_enum for this type, since
4656 the values for the enumeration constants may involve
4657 template parameters. And, no one should be interested
4658 in the enumeration constants for such a type. */
4659 t = make_node (ENUMERAL_TYPE);
4663 t = make_aggr_type (TREE_CODE (template_type));
4664 CLASSTYPE_DECLARED_CLASS (t)
4665 = CLASSTYPE_DECLARED_CLASS (template_type);
4666 SET_CLASSTYPE_IMPLICIT_INSTANTIATION (t);
4667 TYPE_FOR_JAVA (t) = TYPE_FOR_JAVA (template_type);
4669 /* A local class. Make sure the decl gets registered properly. */
4670 if (context == current_function_decl)
4671 pushtag (DECL_NAME (template), t, /*tag_scope=*/ts_current);
4674 /* If we called start_enum or pushtag above, this information
4675 will already be set up. */
4678 TYPE_CONTEXT (t) = FROB_CONTEXT (context);
4680 type_decl = create_implicit_typedef (DECL_NAME (template), t);
4681 DECL_CONTEXT (type_decl) = TYPE_CONTEXT (t);
4682 TYPE_STUB_DECL (t) = type_decl;
4683 DECL_SOURCE_LOCATION (type_decl)
4684 = DECL_SOURCE_LOCATION (TYPE_STUB_DECL (template_type));
4687 type_decl = TYPE_NAME (t);
4689 TREE_PRIVATE (type_decl)
4690 = TREE_PRIVATE (TYPE_STUB_DECL (template_type));
4691 TREE_PROTECTED (type_decl)
4692 = TREE_PROTECTED (TYPE_STUB_DECL (template_type));
4693 DECL_IN_SYSTEM_HEADER (type_decl)
4694 = DECL_IN_SYSTEM_HEADER (template);
4695 if (CLASSTYPE_VISIBILITY_SPECIFIED (template_type))
4697 DECL_VISIBILITY_SPECIFIED (type_decl) = 1;
4698 DECL_VISIBILITY (type_decl) = CLASSTYPE_VISIBILITY (template_type);
4701 /* Set up the template information. We have to figure out which
4702 template is the immediate parent if this is a full
4704 if (parm_depth == 1 || is_partial_instantiation
4705 || !PRIMARY_TEMPLATE_P (template))
4706 /* This case is easy; there are no member templates involved. */
4710 /* This is a full instantiation of a member template. Look
4711 for a partial instantiation of which this is an instance. */
4713 for (found = DECL_TEMPLATE_INSTANTIATIONS (template);
4714 found; found = TREE_CHAIN (found))
4717 tree tmpl = CLASSTYPE_TI_TEMPLATE (TREE_VALUE (found));
4719 /* We only want partial instantiations, here, not
4720 specializations or full instantiations. */
4721 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_VALUE (found))
4722 || !uses_template_parms (TREE_VALUE (found)))
4725 /* Temporarily reduce by one the number of levels in the
4726 ARGLIST and in FOUND so as to avoid comparing the
4727 last set of arguments. */
4728 TREE_VEC_LENGTH (arglist)--;
4729 TREE_VEC_LENGTH (TREE_PURPOSE (found)) --;
4731 /* See if the arguments match. If they do, then TMPL is
4732 the partial instantiation we want. */
4733 success = comp_template_args (TREE_PURPOSE (found), arglist);
4735 /* Restore the argument vectors to their full size. */
4736 TREE_VEC_LENGTH (arglist)++;
4737 TREE_VEC_LENGTH (TREE_PURPOSE (found))++;
4748 /* There was no partial instantiation. This happens
4749 where C<T> is a member template of A<T> and it's used
4752 template <typename T> struct B { A<T>::C<int> m; };
4755 Create the partial instantiation.
4757 TREE_VEC_LENGTH (arglist)--;
4758 found = tsubst (template, arglist, complain, NULL_TREE);
4759 TREE_VEC_LENGTH (arglist)++;
4763 SET_TYPE_TEMPLATE_INFO (t, tree_cons (found, arglist, NULL_TREE));
4764 DECL_TEMPLATE_INSTANTIATIONS (template)
4765 = tree_cons (arglist, t,
4766 DECL_TEMPLATE_INSTANTIATIONS (template));
4768 if (TREE_CODE (t) == ENUMERAL_TYPE
4769 && !is_partial_instantiation)
4770 /* Now that the type has been registered on the instantiations
4771 list, we set up the enumerators. Because the enumeration
4772 constants may involve the enumeration type itself, we make
4773 sure to register the type first, and then create the
4774 constants. That way, doing tsubst_expr for the enumeration
4775 constants won't result in recursive calls here; we'll find
4776 the instantiation and exit above. */
4777 tsubst_enum (template_type, t, arglist);
4779 /* Reset the name of the type, now that CLASSTYPE_TEMPLATE_INFO
4781 if (TREE_CODE (t) != ENUMERAL_TYPE)
4782 DECL_NAME (type_decl) = classtype_mangled_name (t);
4783 if (is_partial_instantiation)
4784 /* If the type makes use of template parameters, the
4785 code that generates debugging information will crash. */
4786 DECL_IGNORED_P (TYPE_STUB_DECL (t)) = 1;
4788 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, t);
4790 timevar_pop (TV_NAME_LOOKUP);
4797 struct pointer_set_t *visited;
4800 /* Called from for_each_template_parm via walk_tree. */
4803 for_each_template_parm_r (tree *tp, int *walk_subtrees, void *d)
4806 struct pair_fn_data *pfd = (struct pair_fn_data *) d;
4807 tree_fn_t fn = pfd->fn;
4808 void *data = pfd->data;
4811 && for_each_template_parm (TYPE_CONTEXT (t), fn, data, pfd->visited))
4812 return error_mark_node;
4814 switch (TREE_CODE (t))
4817 if (TYPE_PTRMEMFUNC_P (t))
4823 if (!TYPE_TEMPLATE_INFO (t))
4825 else if (for_each_template_parm (TREE_VALUE (TYPE_TEMPLATE_INFO (t)),
4826 fn, data, pfd->visited))
4827 return error_mark_node;
4831 /* Since we're not going to walk subtrees, we have to do this
4833 if (for_each_template_parm (TYPE_METHOD_BASETYPE (t), fn, data,
4835 return error_mark_node;
4839 /* Check the return type. */
4840 if (for_each_template_parm (TREE_TYPE (t), fn, data, pfd->visited))
4841 return error_mark_node;
4843 /* Check the parameter types. Since default arguments are not
4844 instantiated until they are needed, the TYPE_ARG_TYPES may
4845 contain expressions that involve template parameters. But,
4846 no-one should be looking at them yet. And, once they're
4847 instantiated, they don't contain template parameters, so
4848 there's no point in looking at them then, either. */
4852 for (parm = TYPE_ARG_TYPES (t); parm; parm = TREE_CHAIN (parm))
4853 if (for_each_template_parm (TREE_VALUE (parm), fn, data,
4855 return error_mark_node;
4857 /* Since we've already handled the TYPE_ARG_TYPES, we don't
4858 want walk_tree walking into them itself. */
4864 if (for_each_template_parm (TYPE_FIELDS (t), fn, data,
4866 return error_mark_node;
4871 if (DECL_LANG_SPECIFIC (t) && DECL_TEMPLATE_INFO (t)
4872 && for_each_template_parm (DECL_TI_ARGS (t), fn, data,
4874 return error_mark_node;
4879 if (TREE_CODE (t) == CONST_DECL && DECL_TEMPLATE_PARM_P (t)
4880 && for_each_template_parm (DECL_INITIAL (t), fn, data,
4882 return error_mark_node;
4883 if (DECL_CONTEXT (t)
4884 && for_each_template_parm (DECL_CONTEXT (t), fn, data,
4886 return error_mark_node;
4889 case BOUND_TEMPLATE_TEMPLATE_PARM:
4890 /* Record template parameters such as `T' inside `TT<T>'. */
4891 if (for_each_template_parm (TYPE_TI_ARGS (t), fn, data, pfd->visited))
4892 return error_mark_node;
4895 case TEMPLATE_TEMPLATE_PARM:
4896 case TEMPLATE_TYPE_PARM:
4897 case TEMPLATE_PARM_INDEX:
4898 if (fn && (*fn)(t, data))
4899 return error_mark_node;
4901 return error_mark_node;
4905 /* A template template parameter is encountered. */
4906 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t)
4907 && for_each_template_parm (TREE_TYPE (t), fn, data, pfd->visited))
4908 return error_mark_node;
4910 /* Already substituted template template parameter */
4916 || for_each_template_parm (TYPENAME_TYPE_FULLNAME (t), fn,
4917 data, pfd->visited))
4918 return error_mark_node;
4922 if (TREE_TYPE (t) && TYPE_PTRMEMFUNC_P (TREE_TYPE (t))
4923 && for_each_template_parm (TYPE_PTRMEMFUNC_FN_TYPE
4924 (TREE_TYPE (t)), fn, data,
4926 return error_mark_node;
4931 /* If there's no type, then this thing must be some expression
4932 involving template parameters. */
4933 if (!fn && !TREE_TYPE (t))
4934 return error_mark_node;
4939 case REINTERPRET_CAST_EXPR:
4940 case CONST_CAST_EXPR:
4941 case STATIC_CAST_EXPR:
4942 case DYNAMIC_CAST_EXPR:
4946 case PSEUDO_DTOR_EXPR:
4948 return error_mark_node;
4952 /* If we do not handle this case specially, we end up walking
4953 the BINFO hierarchy, which is circular, and therefore
4954 confuses walk_tree. */
4956 if (for_each_template_parm (BASELINK_FUNCTIONS (*tp), fn, data,
4958 return error_mark_node;
4965 /* We didn't find any template parameters we liked. */
4969 /* For each TEMPLATE_TYPE_PARM, TEMPLATE_TEMPLATE_PARM,
4970 BOUND_TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX in T,
4971 call FN with the parameter and the DATA.
4972 If FN returns nonzero, the iteration is terminated, and
4973 for_each_template_parm returns 1. Otherwise, the iteration
4974 continues. If FN never returns a nonzero value, the value
4975 returned by for_each_template_parm is 0. If FN is NULL, it is
4976 considered to be the function which always returns 1. */
4979 for_each_template_parm (tree t, tree_fn_t fn, void* data,
4980 struct pointer_set_t *visited)
4982 struct pair_fn_data pfd;
4989 /* Walk the tree. (Conceptually, we would like to walk without
4990 duplicates, but for_each_template_parm_r recursively calls
4991 for_each_template_parm, so we would need to reorganize a fair
4992 bit to use walk_tree_without_duplicates, so we keep our own
4995 pfd.visited = visited;
4997 pfd.visited = pointer_set_create ();
4998 result = walk_tree (&t,
4999 for_each_template_parm_r,
5001 pfd.visited) != NULL_TREE;
5006 pointer_set_destroy (pfd.visited);
5013 /* Returns true if T depends on any template parameter. */
5016 uses_template_parms (tree t)
5019 int saved_processing_template_decl;
5021 saved_processing_template_decl = processing_template_decl;
5022 if (!saved_processing_template_decl)
5023 processing_template_decl = 1;
5025 dependent_p = dependent_type_p (t);
5026 else if (TREE_CODE (t) == TREE_VEC)
5027 dependent_p = any_dependent_template_arguments_p (t);
5028 else if (TREE_CODE (t) == TREE_LIST)
5029 dependent_p = (uses_template_parms (TREE_VALUE (t))
5030 || uses_template_parms (TREE_CHAIN (t)));
5031 else if (TREE_CODE (t) == TYPE_DECL)
5032 dependent_p = dependent_type_p (TREE_TYPE (t));
5035 || TREE_CODE (t) == TEMPLATE_PARM_INDEX
5036 || TREE_CODE (t) == OVERLOAD
5037 || TREE_CODE (t) == BASELINK
5038 || TREE_CODE (t) == IDENTIFIER_NODE
5039 || CONSTANT_CLASS_P (t))
5040 dependent_p = (type_dependent_expression_p (t)
5041 || value_dependent_expression_p (t));
5044 gcc_assert (t == error_mark_node);
5045 dependent_p = false;
5048 processing_template_decl = saved_processing_template_decl;
5053 /* Returns true if T depends on any template parameter with level LEVEL. */
5056 uses_template_parms_level (tree t, int level)
5058 return for_each_template_parm (t, template_parm_this_level_p, &level, NULL);
5061 static int tinst_depth;
5062 extern int max_tinst_depth;
5063 #ifdef GATHER_STATISTICS
5066 static int tinst_level_tick;
5067 static int last_template_error_tick;
5069 /* We're starting to instantiate D; record the template instantiation context
5070 for diagnostics and to restore it later. */
5073 push_tinst_level (tree d)
5077 if (tinst_depth >= max_tinst_depth)
5079 /* If the instantiation in question still has unbound template parms,
5080 we don't really care if we can't instantiate it, so just return.
5081 This happens with base instantiation for implicit `typename'. */
5082 if (uses_template_parms (d))
5085 last_template_error_tick = tinst_level_tick;
5086 error ("template instantiation depth exceeds maximum of %d (use "
5087 "-ftemplate-depth-NN to increase the maximum) instantiating %qD",
5088 max_tinst_depth, d);
5090 print_instantiation_context ();
5095 new = make_node (TINST_LEVEL);
5096 TINST_DECL (new) = d;
5097 TINST_LOCATION (new) = input_location;
5098 TINST_IN_SYSTEM_HEADER_P (new) = in_system_header;
5099 TREE_CHAIN (new) = current_tinst_level;
5100 current_tinst_level = new;
5103 #ifdef GATHER_STATISTICS
5104 if (tinst_depth > depth_reached)
5105 depth_reached = tinst_depth;
5112 /* We're done instantiating this template; return to the instantiation
5116 pop_tinst_level (void)
5118 tree old = current_tinst_level;
5120 /* Restore the filename and line number stashed away when we started
5121 this instantiation. */
5122 input_location = TINST_LOCATION (old);
5123 in_system_header = TINST_IN_SYSTEM_HEADER_P (old);
5124 current_tinst_level = TREE_CHAIN (old);
5129 /* We're instantiating a deferred template; restore the template
5130 instantiation context in which the instantiation was requested, which
5131 is one step out from LEVEL. */
5134 reopen_tinst_level (tree level)
5139 for (t = level; t; t = TREE_CHAIN (t))
5142 current_tinst_level = level;
5146 /* DECL is a friend FUNCTION_DECL or TEMPLATE_DECL. ARGS is the
5147 vector of template arguments, as for tsubst.
5149 Returns an appropriate tsubst'd friend declaration. */
5152 tsubst_friend_function (tree decl, tree args)
5156 if (TREE_CODE (decl) == FUNCTION_DECL
5157 && DECL_TEMPLATE_INSTANTIATION (decl)
5158 && TREE_CODE (DECL_TI_TEMPLATE (decl)) != TEMPLATE_DECL)
5159 /* This was a friend declared with an explicit template
5160 argument list, e.g.:
5164 to indicate that f was a template instantiation, not a new
5165 function declaration. Now, we have to figure out what
5166 instantiation of what template. */
5168 tree template_id, arglist, fns;
5171 tree ns = decl_namespace_context (TYPE_MAIN_DECL (current_class_type));
5173 /* Friend functions are looked up in the containing namespace scope.
5174 We must enter that scope, to avoid finding member functions of the
5175 current cless with same name. */
5176 push_nested_namespace (ns);
5177 fns = tsubst_expr (DECL_TI_TEMPLATE (decl), args,
5178 tf_warning_or_error, NULL_TREE);
5179 pop_nested_namespace (ns);
5180 arglist = tsubst (DECL_TI_ARGS (decl), args,
5181 tf_warning_or_error, NULL_TREE);
5182 template_id = lookup_template_function (fns, arglist);
5184 new_friend = tsubst (decl, args, tf_warning_or_error, NULL_TREE);
5185 tmpl = determine_specialization (template_id, new_friend,
5187 /*need_member_template=*/0,
5188 TREE_VEC_LENGTH (args),
5190 return instantiate_template (tmpl, new_args, tf_error);
5193 new_friend = tsubst (decl, args, tf_warning_or_error, NULL_TREE);
5195 /* The NEW_FRIEND will look like an instantiation, to the
5196 compiler, but is not an instantiation from the point of view of
5197 the language. For example, we might have had:
5199 template <class T> struct S {
5200 template <class U> friend void f(T, U);
5203 Then, in S<int>, template <class U> void f(int, U) is not an
5204 instantiation of anything. */
5205 if (new_friend == error_mark_node)
5206 return error_mark_node;
5208 DECL_USE_TEMPLATE (new_friend) = 0;
5209 if (TREE_CODE (decl) == TEMPLATE_DECL)
5211 DECL_USE_TEMPLATE (DECL_TEMPLATE_RESULT (new_friend)) = 0;
5212 DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (new_friend))
5213 = DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (decl));
5216 /* The mangled name for the NEW_FRIEND is incorrect. The function
5217 is not a template instantiation and should not be mangled like
5218 one. Therefore, we forget the mangling here; we'll recompute it
5219 later if we need it. */
5220 if (TREE_CODE (new_friend) != TEMPLATE_DECL)
5222 SET_DECL_RTL (new_friend, NULL_RTX);
5223 SET_DECL_ASSEMBLER_NAME (new_friend, NULL_TREE);
5226 if (DECL_NAMESPACE_SCOPE_P (new_friend))
5229 tree new_friend_template_info;
5230 tree new_friend_result_template_info;
5232 int new_friend_is_defn;
5234 /* We must save some information from NEW_FRIEND before calling
5235 duplicate decls since that function will free NEW_FRIEND if
5237 new_friend_template_info = DECL_TEMPLATE_INFO (new_friend);
5238 new_friend_is_defn =
5239 (DECL_INITIAL (DECL_TEMPLATE_RESULT
5240 (template_for_substitution (new_friend)))
5242 if (TREE_CODE (new_friend) == TEMPLATE_DECL)
5244 /* This declaration is a `primary' template. */
5245 DECL_PRIMARY_TEMPLATE (new_friend) = new_friend;
5247 new_friend_result_template_info
5248 = DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (new_friend));
5251 new_friend_result_template_info = NULL_TREE;
5253 /* Inside pushdecl_namespace_level, we will push into the
5254 current namespace. However, the friend function should go
5255 into the namespace of the template. */
5256 ns = decl_namespace_context (new_friend);
5257 push_nested_namespace (ns);
5258 old_decl = pushdecl_namespace_level (new_friend, /*is_friend=*/true);
5259 pop_nested_namespace (ns);
5261 if (old_decl == error_mark_node)
5262 return error_mark_node;
5264 if (old_decl != new_friend)
5266 /* This new friend declaration matched an existing
5267 declaration. For example, given:
5269 template <class T> void f(T);
5270 template <class U> class C {
5271 template <class T> friend void f(T) {}
5274 the friend declaration actually provides the definition
5275 of `f', once C has been instantiated for some type. So,
5276 old_decl will be the out-of-class template declaration,
5277 while new_friend is the in-class definition.
5279 But, if `f' was called before this point, the
5280 instantiation of `f' will have DECL_TI_ARGS corresponding
5281 to `T' but not to `U', references to which might appear
5282 in the definition of `f'. Previously, the most general
5283 template for an instantiation of `f' was the out-of-class
5284 version; now it is the in-class version. Therefore, we
5285 run through all specialization of `f', adding to their
5286 DECL_TI_ARGS appropriately. In particular, they need a
5287 new set of outer arguments, corresponding to the
5288 arguments for this class instantiation.
5290 The same situation can arise with something like this:
5293 template <class T> class C {
5297 when `C<int>' is instantiated. Now, `f(int)' is defined
5300 if (!new_friend_is_defn)
5301 /* On the other hand, if the in-class declaration does
5302 *not* provide a definition, then we don't want to alter
5303 existing definitions. We can just leave everything
5308 /* Overwrite whatever template info was there before, if
5309 any, with the new template information pertaining to
5311 DECL_TEMPLATE_INFO (old_decl) = new_friend_template_info;
5313 if (TREE_CODE (old_decl) != TEMPLATE_DECL)
5314 reregister_specialization (new_friend,
5315 most_general_template (old_decl),
5320 tree new_friend_args;
5322 DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (old_decl))
5323 = new_friend_result_template_info;
5325 new_friend_args = TI_ARGS (new_friend_template_info);
5326 for (t = DECL_TEMPLATE_SPECIALIZATIONS (old_decl);
5330 tree spec = TREE_VALUE (t);
5333 = add_outermost_template_args (new_friend_args,
5334 DECL_TI_ARGS (spec));
5337 /* Now, since specializations are always supposed to
5338 hang off of the most general template, we must move
5340 t = most_general_template (old_decl);
5343 DECL_TEMPLATE_SPECIALIZATIONS (t)
5344 = chainon (DECL_TEMPLATE_SPECIALIZATIONS (t),
5345 DECL_TEMPLATE_SPECIALIZATIONS (old_decl));
5346 DECL_TEMPLATE_SPECIALIZATIONS (old_decl) = NULL_TREE;
5351 /* The information from NEW_FRIEND has been merged into OLD_DECL
5352 by duplicate_decls. */
5353 new_friend = old_decl;
5358 tree context = DECL_CONTEXT (new_friend);
5362 template <class T> class C {
5363 template <class U> friend void C1<U>::f (); // case 1
5364 friend void C2<T>::f (); // case 2
5366 we only need to make sure CONTEXT is a complete type for
5367 case 2. To distinguish between the two cases, we note that
5368 CONTEXT of case 1 remains dependent type after tsubst while
5369 this isn't true for case 2. */
5370 ++processing_template_decl;
5371 dependent_p = dependent_type_p (context);
5372 --processing_template_decl;
5375 && !complete_type_or_else (context, NULL_TREE))
5376 return error_mark_node;
5378 if (COMPLETE_TYPE_P (context))
5380 /* Check to see that the declaration is really present, and,
5381 possibly obtain an improved declaration. */
5382 tree fn = check_classfn (context,
5383 new_friend, NULL_TREE);
5393 /* FRIEND_TMPL is a friend TEMPLATE_DECL. ARGS is the vector of
5394 template arguments, as for tsubst.
5396 Returns an appropriate tsubst'd friend type or error_mark_node on
5400 tsubst_friend_class (tree friend_tmpl, tree args)
5406 context = DECL_CONTEXT (friend_tmpl);
5410 if (TREE_CODE (context) == NAMESPACE_DECL)
5411 push_nested_namespace (context);
5413 push_nested_class (tsubst (context, args, tf_none, NULL_TREE));
5416 /* First, we look for a class template. */
5417 tmpl = lookup_name (DECL_NAME (friend_tmpl));
5419 /* But, if we don't find one, it might be because we're in a
5420 situation like this:
5428 Here, in the scope of (say) S<int>, `S' is bound to a TYPE_DECL
5429 for `S<int>', not the TEMPLATE_DECL. */
5430 if (!tmpl || !DECL_CLASS_TEMPLATE_P (tmpl))
5432 tmpl = lookup_name_prefer_type (DECL_NAME (friend_tmpl), 1);
5433 tmpl = maybe_get_template_decl_from_type_decl (tmpl);
5436 if (tmpl && DECL_CLASS_TEMPLATE_P (tmpl))
5438 /* The friend template has already been declared. Just
5439 check to see that the declarations match, and install any new
5440 default parameters. We must tsubst the default parameters,
5441 of course. We only need the innermost template parameters
5442 because that is all that redeclare_class_template will look
5444 if (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (friend_tmpl))
5445 > TMPL_ARGS_DEPTH (args))
5448 parms = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_tmpl),
5449 args, tf_warning_or_error);
5450 redeclare_class_template (TREE_TYPE (tmpl), parms);
5453 friend_type = TREE_TYPE (tmpl);
5457 /* The friend template has not already been declared. In this
5458 case, the instantiation of the template class will cause the
5459 injection of this template into the global scope. */
5460 tmpl = tsubst (friend_tmpl, args, tf_warning_or_error, NULL_TREE);
5461 if (tmpl == error_mark_node)
5462 return error_mark_node;
5464 /* The new TMPL is not an instantiation of anything, so we
5465 forget its origins. We don't reset CLASSTYPE_TI_TEMPLATE for
5466 the new type because that is supposed to be the corresponding
5467 template decl, i.e., TMPL. */
5468 DECL_USE_TEMPLATE (tmpl) = 0;
5469 DECL_TEMPLATE_INFO (tmpl) = NULL_TREE;
5470 CLASSTYPE_USE_TEMPLATE (TREE_TYPE (tmpl)) = 0;
5471 CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl))
5472 = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl)));
5474 /* Inject this template into the global scope. */
5475 friend_type = TREE_TYPE (pushdecl_top_level_maybe_friend (tmpl, true));
5480 if (TREE_CODE (context) == NAMESPACE_DECL)
5481 pop_nested_namespace (context);
5483 pop_nested_class ();
5489 /* Returns zero if TYPE cannot be completed later due to circularity.
5490 Otherwise returns one. */
5493 can_complete_type_without_circularity (tree type)
5495 if (type == NULL_TREE || type == error_mark_node)
5497 else if (COMPLETE_TYPE_P (type))
5499 else if (TREE_CODE (type) == ARRAY_TYPE && TYPE_DOMAIN (type))
5500 return can_complete_type_without_circularity (TREE_TYPE (type));
5501 else if (CLASS_TYPE_P (type)
5502 && TYPE_BEING_DEFINED (TYPE_MAIN_VARIANT (type)))
5509 instantiate_class_template (tree type)
5511 tree template, args, pattern, t, member;
5516 if (type == error_mark_node)
5517 return error_mark_node;
5519 if (TYPE_BEING_DEFINED (type)
5520 || COMPLETE_TYPE_P (type)
5521 || dependent_type_p (type))
5524 /* Figure out which template is being instantiated. */
5525 template = most_general_template (CLASSTYPE_TI_TEMPLATE (type));
5526 gcc_assert (TREE_CODE (template) == TEMPLATE_DECL);
5528 /* Determine what specialization of the original template to
5530 t = most_specialized_class (type, template);
5531 if (t == error_mark_node)
5533 TYPE_BEING_DEFINED (type) = 1;
5534 return error_mark_node;
5538 /* This TYPE is actually an instantiation of a partial
5539 specialization. We replace the innermost set of ARGS with
5540 the arguments appropriate for substitution. For example,
5543 template <class T> struct S {};
5544 template <class T> struct S<T*> {};
5546 and supposing that we are instantiating S<int*>, ARGS will
5547 presently be {int*} -- but we need {int}. */
5548 pattern = TREE_TYPE (t);
5549 args = TREE_PURPOSE (t);
5553 pattern = TREE_TYPE (template);
5554 args = CLASSTYPE_TI_ARGS (type);
5557 /* If the template we're instantiating is incomplete, then clearly
5558 there's nothing we can do. */
5559 if (!COMPLETE_TYPE_P (pattern))
5562 /* If we've recursively instantiated too many templates, stop. */
5563 if (! push_tinst_level (type))
5566 /* Now we're really doing the instantiation. Mark the type as in
5567 the process of being defined. */
5568 TYPE_BEING_DEFINED (type) = 1;
5570 /* We may be in the middle of deferred access check. Disable
5572 push_deferring_access_checks (dk_no_deferred);
5574 push_to_top_level ();
5576 SET_CLASSTYPE_INTERFACE_UNKNOWN (type);
5578 /* Set the input location to the template definition. This is needed
5579 if tsubsting causes an error. */
5580 typedecl = TYPE_MAIN_DECL (type);
5581 input_location = DECL_SOURCE_LOCATION (typedecl);
5582 in_system_header = DECL_IN_SYSTEM_HEADER (typedecl);
5584 TYPE_HAS_CONSTRUCTOR (type) = TYPE_HAS_CONSTRUCTOR (pattern);
5585 TYPE_HAS_NEW_OPERATOR (type) = TYPE_HAS_NEW_OPERATOR (pattern);
5586 TYPE_HAS_ARRAY_NEW_OPERATOR (type) = TYPE_HAS_ARRAY_NEW_OPERATOR (pattern);
5587 TYPE_GETS_DELETE (type) = TYPE_GETS_DELETE (pattern);
5588 TYPE_HAS_ASSIGN_REF (type) = TYPE_HAS_ASSIGN_REF (pattern);
5589 TYPE_HAS_CONST_ASSIGN_REF (type) = TYPE_HAS_CONST_ASSIGN_REF (pattern);
5590 TYPE_HAS_INIT_REF (type) = TYPE_HAS_INIT_REF (pattern);
5591 TYPE_HAS_CONST_INIT_REF (type) = TYPE_HAS_CONST_INIT_REF (pattern);
5592 TYPE_HAS_DEFAULT_CONSTRUCTOR (type) = TYPE_HAS_DEFAULT_CONSTRUCTOR (pattern);
5593 TYPE_HAS_CONVERSION (type) = TYPE_HAS_CONVERSION (pattern);
5594 TYPE_PACKED (type) = TYPE_PACKED (pattern);
5595 TYPE_ALIGN (type) = TYPE_ALIGN (pattern);
5596 TYPE_USER_ALIGN (type) = TYPE_USER_ALIGN (pattern);
5597 TYPE_FOR_JAVA (type) = TYPE_FOR_JAVA (pattern); /* For libjava's JArray<T> */
5598 if (ANON_AGGR_TYPE_P (pattern))
5599 SET_ANON_AGGR_TYPE_P (type);
5600 if (CLASSTYPE_VISIBILITY_SPECIFIED (pattern))
5602 CLASSTYPE_VISIBILITY_SPECIFIED (type) = 1;
5603 CLASSTYPE_VISIBILITY (type) = CLASSTYPE_VISIBILITY (pattern);
5606 pbinfo = TYPE_BINFO (pattern);
5608 /* We should never instantiate a nested class before its enclosing
5609 class; we need to look up the nested class by name before we can
5610 instantiate it, and that lookup should instantiate the enclosing
5612 gcc_assert (!DECL_CLASS_SCOPE_P (TYPE_MAIN_DECL (pattern))
5613 || COMPLETE_TYPE_P (TYPE_CONTEXT (type))
5614 || TYPE_BEING_DEFINED (TYPE_CONTEXT (type)));
5616 base_list = NULL_TREE;
5617 if (BINFO_N_BASE_BINFOS (pbinfo))
5620 tree context = TYPE_CONTEXT (type);
5624 /* We must enter the scope containing the type, as that is where
5625 the accessibility of types named in dependent bases are
5627 pushed_scope = push_scope (context ? context : global_namespace);
5629 /* Substitute into each of the bases to determine the actual
5631 for (i = 0; BINFO_BASE_ITERATE (pbinfo, i, pbase_binfo); i++)
5634 tree access = BINFO_BASE_ACCESS (pbinfo, i);
5636 /* Substitute to figure out the base class. */
5637 base = tsubst (BINFO_TYPE (pbase_binfo), args, tf_error, NULL_TREE);
5638 if (base == error_mark_node)
5641 base_list = tree_cons (access, base, base_list);
5642 if (BINFO_VIRTUAL_P (pbase_binfo))
5643 TREE_TYPE (base_list) = integer_type_node;
5646 /* The list is now in reverse order; correct that. */
5647 base_list = nreverse (base_list);
5650 pop_scope (pushed_scope);
5652 /* Now call xref_basetypes to set up all the base-class
5654 xref_basetypes (type, base_list);
5657 /* Now that our base classes are set up, enter the scope of the
5658 class, so that name lookups into base classes, etc. will work
5659 correctly. This is precisely analogous to what we do in
5660 begin_class_definition when defining an ordinary non-template
5664 /* Now members are processed in the order of declaration. */
5665 for (member = CLASSTYPE_DECL_LIST (pattern);
5666 member; member = TREE_CHAIN (member))
5668 tree t = TREE_VALUE (member);
5670 if (TREE_PURPOSE (member))
5674 /* Build new CLASSTYPE_NESTED_UTDS. */
5677 bool class_template_p;
5679 class_template_p = (TREE_CODE (t) != ENUMERAL_TYPE
5680 && TYPE_LANG_SPECIFIC (t)
5681 && CLASSTYPE_IS_TEMPLATE (t));
5682 /* If the member is a class template, then -- even after
5683 substitution -- there may be dependent types in the
5684 template argument list for the class. We increment
5685 PROCESSING_TEMPLATE_DECL so that dependent_type_p, as
5686 that function will assume that no types are dependent
5687 when outside of a template. */
5688 if (class_template_p)
5689 ++processing_template_decl;
5690 newtag = tsubst (t, args, tf_error, NULL_TREE);
5691 if (class_template_p)
5692 --processing_template_decl;
5693 if (newtag == error_mark_node)
5696 if (TREE_CODE (newtag) != ENUMERAL_TYPE)
5698 tree name = TYPE_IDENTIFIER (t);
5700 if (class_template_p)
5701 /* Unfortunately, lookup_template_class sets
5702 CLASSTYPE_IMPLICIT_INSTANTIATION for a partial
5703 instantiation (i.e., for the type of a member
5704 template class nested within a template class.)
5705 This behavior is required for
5706 maybe_process_partial_specialization to work
5707 correctly, but is not accurate in this case;
5708 the TAG is not an instantiation of anything.
5709 (The corresponding TEMPLATE_DECL is an
5710 instantiation, but the TYPE is not.) */
5711 CLASSTYPE_USE_TEMPLATE (newtag) = 0;
5713 /* Now, we call pushtag to put this NEWTAG into the scope of
5714 TYPE. We first set up the IDENTIFIER_TYPE_VALUE to avoid
5715 pushtag calling push_template_decl. We don't have to do
5716 this for enums because it will already have been done in
5719 SET_IDENTIFIER_TYPE_VALUE (name, newtag);
5720 pushtag (name, newtag, /*tag_scope=*/ts_current);
5723 else if (TREE_CODE (t) == FUNCTION_DECL
5724 || DECL_FUNCTION_TEMPLATE_P (t))
5726 /* Build new TYPE_METHODS. */
5729 if (TREE_CODE (t) == TEMPLATE_DECL)
5730 ++processing_template_decl;
5731 r = tsubst (t, args, tf_error, NULL_TREE);
5732 if (TREE_CODE (t) == TEMPLATE_DECL)
5733 --processing_template_decl;
5734 set_current_access_from_decl (r);
5735 finish_member_declaration (r);
5739 /* Build new TYPE_FIELDS. */
5741 if (TREE_CODE (t) != CONST_DECL)
5745 /* The the file and line for this declaration, to
5746 assist in error message reporting. Since we
5747 called push_tinst_level above, we don't need to
5749 input_location = DECL_SOURCE_LOCATION (t);
5751 if (TREE_CODE (t) == TEMPLATE_DECL)
5752 ++processing_template_decl;
5753 r = tsubst (t, args, tf_warning_or_error, NULL_TREE);
5754 if (TREE_CODE (t) == TEMPLATE_DECL)
5755 --processing_template_decl;
5756 if (TREE_CODE (r) == VAR_DECL)
5760 [t]he initialization (and any associated
5761 side-effects) of a static data member does
5762 not occur unless the static data member is
5763 itself used in a way that requires the
5764 definition of the static data member to
5767 Therefore, we do not substitute into the
5768 initialized for the static data member here. */
5769 finish_static_data_member_decl
5772 /*init_const_expr_p=*/false,
5773 /*asmspec_tree=*/NULL_TREE,
5775 if (DECL_INITIALIZED_IN_CLASS_P (r))
5776 check_static_variable_definition (r, TREE_TYPE (r));
5778 else if (TREE_CODE (r) == FIELD_DECL)
5780 /* Determine whether R has a valid type and can be
5781 completed later. If R is invalid, then it is
5782 replaced by error_mark_node so that it will not be
5783 added to TYPE_FIELDS. */
5784 tree rtype = TREE_TYPE (r);
5785 if (can_complete_type_without_circularity (rtype))
5786 complete_type (rtype);
5788 if (!COMPLETE_TYPE_P (rtype))
5790 cxx_incomplete_type_error (r, rtype);
5791 r = error_mark_node;
5795 /* If it is a TYPE_DECL for a class-scoped ENUMERAL_TYPE,
5796 such a thing will already have been added to the field
5797 list by tsubst_enum in finish_member_declaration in the
5798 CLASSTYPE_NESTED_UTDS case above. */
5799 if (!(TREE_CODE (r) == TYPE_DECL
5800 && TREE_CODE (TREE_TYPE (r)) == ENUMERAL_TYPE
5801 && DECL_ARTIFICIAL (r)))
5803 set_current_access_from_decl (r);
5804 finish_member_declaration (r);
5811 if (TYPE_P (t) || DECL_CLASS_TEMPLATE_P (t))
5813 /* Build new CLASSTYPE_FRIEND_CLASSES. */
5815 tree friend_type = t;
5816 bool adjust_processing_template_decl = false;
5818 if (TREE_CODE (friend_type) == TEMPLATE_DECL)
5820 /* template <class T> friend class C; */
5821 friend_type = tsubst_friend_class (friend_type, args);
5822 adjust_processing_template_decl = true;
5824 else if (TREE_CODE (friend_type) == UNBOUND_CLASS_TEMPLATE)
5826 /* template <class T> friend class C::D; */
5827 friend_type = tsubst (friend_type, args,
5828 tf_warning_or_error, NULL_TREE);
5829 if (TREE_CODE (friend_type) == TEMPLATE_DECL)
5830 friend_type = TREE_TYPE (friend_type);
5831 adjust_processing_template_decl = true;
5833 else if (TREE_CODE (friend_type) == TYPENAME_TYPE)
5835 /* This could be either
5839 when dependent_type_p is false or
5841 template <class U> friend class T::C;
5844 friend_type = tsubst (friend_type, args,
5845 tf_warning_or_error, NULL_TREE);
5846 /* Bump processing_template_decl for correct
5847 dependent_type_p calculation. */
5848 ++processing_template_decl;
5849 if (dependent_type_p (friend_type))
5850 adjust_processing_template_decl = true;
5851 --processing_template_decl;
5853 else if (!CLASSTYPE_USE_TEMPLATE (friend_type)
5854 && hidden_name_p (TYPE_NAME (friend_type)))
5858 where C hasn't been declared yet. Let's lookup name
5859 from namespace scope directly, bypassing any name that
5860 come from dependent base class. */
5861 tree ns = decl_namespace_context (TYPE_MAIN_DECL (friend_type));
5863 /* The call to xref_tag_from_type does injection for friend
5865 push_nested_namespace (ns);
5867 xref_tag_from_type (friend_type, NULL_TREE,
5868 /*tag_scope=*/ts_current);
5869 pop_nested_namespace (ns);
5871 else if (uses_template_parms (friend_type))
5872 /* friend class C<T>; */
5873 friend_type = tsubst (friend_type, args,
5874 tf_warning_or_error, NULL_TREE);
5879 where C is already declared or
5881 friend class C<int>;
5883 We don't have to do anything in these cases. */
5885 if (adjust_processing_template_decl)
5886 /* Trick make_friend_class into realizing that the friend
5887 we're adding is a template, not an ordinary class. It's
5888 important that we use make_friend_class since it will
5889 perform some error-checking and output cross-reference
5891 ++processing_template_decl;
5893 if (friend_type != error_mark_node)
5894 make_friend_class (type, friend_type, /*complain=*/false);
5896 if (adjust_processing_template_decl)
5897 --processing_template_decl;
5901 /* Build new DECL_FRIENDLIST. */
5904 /* The the file and line for this declaration, to
5905 assist in error message reporting. Since we
5906 called push_tinst_level above, we don't need to
5908 input_location = DECL_SOURCE_LOCATION (t);
5910 if (TREE_CODE (t) == TEMPLATE_DECL)
5912 ++processing_template_decl;
5913 push_deferring_access_checks (dk_no_check);
5916 r = tsubst_friend_function (t, args);
5917 add_friend (type, r, /*complain=*/false);
5918 if (TREE_CODE (t) == TEMPLATE_DECL)
5920 pop_deferring_access_checks ();
5921 --processing_template_decl;
5927 /* Set the file and line number information to whatever is given for
5928 the class itself. This puts error messages involving generated
5929 implicit functions at a predictable point, and the same point
5930 that would be used for non-template classes. */
5931 input_location = DECL_SOURCE_LOCATION (typedecl);
5933 unreverse_member_declarations (type);
5934 finish_struct_1 (type);
5935 TYPE_BEING_DEFINED (type) = 0;
5937 /* Now that the class is complete, instantiate default arguments for
5938 any member functions. We don't do this earlier because the
5939 default arguments may reference members of the class. */
5940 if (!PRIMARY_TEMPLATE_P (template))
5941 for (t = TYPE_METHODS (type); t; t = TREE_CHAIN (t))
5942 if (TREE_CODE (t) == FUNCTION_DECL
5943 /* Implicitly generated member functions will not have template
5944 information; they are not instantiations, but instead are
5945 created "fresh" for each instantiation. */
5946 && DECL_TEMPLATE_INFO (t))
5947 tsubst_default_arguments (t);
5950 pop_from_top_level ();
5951 pop_deferring_access_checks ();
5954 /* The vtable for a template class can be emitted in any translation
5955 unit in which the class is instantiated. When there is no key
5956 method, however, finish_struct_1 will already have added TYPE to
5957 the keyed_classes list. */
5958 if (TYPE_CONTAINS_VPTR_P (type) && CLASSTYPE_KEY_METHOD (type))
5959 keyed_classes = tree_cons (NULL_TREE, type, keyed_classes);
5965 tsubst_template_arg (tree t, tree args, tsubst_flags_t complain, tree in_decl)
5971 else if (TYPE_P (t))
5972 r = tsubst (t, args, complain, in_decl);
5975 r = tsubst_expr (t, args, complain, in_decl);
5976 r = fold_non_dependent_expr (r);
5981 /* Substitute ARGS into the vector or list of template arguments T. */
5984 tsubst_template_args (tree t, tree args, tsubst_flags_t complain, tree in_decl)
5986 int len = TREE_VEC_LENGTH (t);
5987 int need_new = 0, i;
5988 tree *elts = (tree *) alloca (len * sizeof (tree));
5990 for (i = 0; i < len; i++)
5992 tree orig_arg = TREE_VEC_ELT (t, i);
5995 if (TREE_CODE (orig_arg) == TREE_VEC)
5996 new_arg = tsubst_template_args (orig_arg, args, complain, in_decl);
5998 new_arg = tsubst_template_arg (orig_arg, args, complain, in_decl);
6000 if (new_arg == error_mark_node)
6001 return error_mark_node;
6004 if (new_arg != orig_arg)
6011 t = make_tree_vec (len);
6012 for (i = 0; i < len; i++)
6013 TREE_VEC_ELT (t, i) = elts[i];
6018 /* Return the result of substituting ARGS into the template parameters
6019 given by PARMS. If there are m levels of ARGS and m + n levels of
6020 PARMS, then the result will contain n levels of PARMS. For
6021 example, if PARMS is `template <class T> template <class U>
6022 template <T*, U, class V>' and ARGS is {{int}, {double}} then the
6023 result will be `template <int*, double, class V>'. */
6026 tsubst_template_parms (tree parms, tree args, tsubst_flags_t complain)
6031 /* When substituting into a template, we must set
6032 PROCESSING_TEMPLATE_DECL as the template parameters may be
6033 dependent if they are based on one-another, and the dependency
6034 predicates are short-circuit outside of templates. */
6035 ++processing_template_decl;
6037 for (new_parms = &r;
6038 TMPL_PARMS_DEPTH (parms) > TMPL_ARGS_DEPTH (args);
6039 new_parms = &(TREE_CHAIN (*new_parms)),
6040 parms = TREE_CHAIN (parms))
6043 make_tree_vec (TREE_VEC_LENGTH (TREE_VALUE (parms)));
6046 for (i = 0; i < TREE_VEC_LENGTH (new_vec); ++i)
6048 tree tuple = TREE_VEC_ELT (TREE_VALUE (parms), i);
6049 tree default_value = TREE_PURPOSE (tuple);
6050 tree parm_decl = TREE_VALUE (tuple);
6052 parm_decl = tsubst (parm_decl, args, complain, NULL_TREE);
6053 if (TREE_CODE (parm_decl) == PARM_DECL
6054 && invalid_nontype_parm_type_p (TREE_TYPE (parm_decl), complain))
6055 parm_decl = error_mark_node;
6056 default_value = tsubst_template_arg (default_value, args,
6057 complain, NULL_TREE);
6059 tuple = build_tree_list (default_value, parm_decl);
6060 TREE_VEC_ELT (new_vec, i) = tuple;
6064 tree_cons (size_int (TMPL_PARMS_DEPTH (parms)
6065 - TMPL_ARGS_DEPTH (args)),
6066 new_vec, NULL_TREE);
6069 --processing_template_decl;
6074 /* Substitute the ARGS into the indicated aggregate (or enumeration)
6075 type T. If T is not an aggregate or enumeration type, it is
6076 handled as if by tsubst. IN_DECL is as for tsubst. If
6077 ENTERING_SCOPE is nonzero, T is the context for a template which
6078 we are presently tsubst'ing. Return the substituted value. */
6081 tsubst_aggr_type (tree t,
6083 tsubst_flags_t complain,
6090 switch (TREE_CODE (t))
6093 if (TYPE_PTRMEMFUNC_P (t))
6094 return tsubst (TYPE_PTRMEMFUNC_FN_TYPE (t), args, complain, in_decl);
6096 /* Else fall through. */
6099 if (TYPE_TEMPLATE_INFO (t))
6104 bool saved_skip_evaluation;
6106 /* In "sizeof(X<I>)" we need to evaluate "I". */
6107 saved_skip_evaluation = skip_evaluation;
6108 skip_evaluation = false;
6110 /* First, determine the context for the type we are looking
6112 context = TYPE_CONTEXT (t);
6114 context = tsubst_aggr_type (context, args, complain,
6115 in_decl, /*entering_scope=*/1);
6117 /* Then, figure out what arguments are appropriate for the
6118 type we are trying to find. For example, given:
6120 template <class T> struct S;
6121 template <class T, class U> void f(T, U) { S<U> su; }
6123 and supposing that we are instantiating f<int, double>,
6124 then our ARGS will be {int, double}, but, when looking up
6125 S we only want {double}. */
6126 argvec = tsubst_template_args (TYPE_TI_ARGS (t), args,
6128 if (argvec == error_mark_node)
6129 r = error_mark_node;
6132 r = lookup_template_class (t, argvec, in_decl, context,
6133 entering_scope, complain);
6134 r = cp_build_qualified_type_real (r, TYPE_QUALS (t), complain);
6137 skip_evaluation = saved_skip_evaluation;
6142 /* This is not a template type, so there's nothing to do. */
6146 return tsubst (t, args, complain, in_decl);
6150 /* Substitute into the default argument ARG (a default argument for
6151 FN), which has the indicated TYPE. */
6154 tsubst_default_argument (tree fn, tree type, tree arg)
6156 tree saved_class_ptr = NULL_TREE;
6157 tree saved_class_ref = NULL_TREE;
6159 /* This default argument came from a template. Instantiate the
6160 default argument here, not in tsubst. In the case of
6169 we must be careful to do name lookup in the scope of S<T>,
6170 rather than in the current class. */
6171 push_access_scope (fn);
6172 /* The "this" pointer is not valid in a default argument. */
6175 saved_class_ptr = current_class_ptr;
6176 cp_function_chain->x_current_class_ptr = NULL_TREE;
6177 saved_class_ref = current_class_ref;
6178 cp_function_chain->x_current_class_ref = NULL_TREE;
6181 push_deferring_access_checks(dk_no_deferred);
6182 /* The default argument expression may cause implicitly defined
6183 member functions to be synthesized, which will result in garbage
6184 collection. We must treat this situation as if we were within
6185 the body of function so as to avoid collecting live data on the
6188 arg = tsubst_expr (arg, DECL_TI_ARGS (fn),
6189 tf_warning_or_error, NULL_TREE);
6191 pop_deferring_access_checks();
6193 /* Restore the "this" pointer. */
6196 cp_function_chain->x_current_class_ptr = saved_class_ptr;
6197 cp_function_chain->x_current_class_ref = saved_class_ref;
6200 pop_access_scope (fn);
6202 /* Make sure the default argument is reasonable. */
6203 arg = check_default_argument (type, arg);
6208 /* Substitute into all the default arguments for FN. */
6211 tsubst_default_arguments (tree fn)
6216 tmpl_args = DECL_TI_ARGS (fn);
6218 /* If this function is not yet instantiated, we certainly don't need
6219 its default arguments. */
6220 if (uses_template_parms (tmpl_args))
6223 for (arg = TYPE_ARG_TYPES (TREE_TYPE (fn));
6225 arg = TREE_CHAIN (arg))
6226 if (TREE_PURPOSE (arg))
6227 TREE_PURPOSE (arg) = tsubst_default_argument (fn,
6229 TREE_PURPOSE (arg));
6232 /* Substitute the ARGS into the T, which is a _DECL. Return the
6233 result of the substitution. Issue error and warning messages under
6234 control of COMPLAIN. */
6237 tsubst_decl (tree t, tree args, tsubst_flags_t complain)
6239 location_t saved_loc;
6243 /* Set the filename and linenumber to improve error-reporting. */
6244 saved_loc = input_location;
6245 input_location = DECL_SOURCE_LOCATION (t);
6247 switch (TREE_CODE (t))
6251 /* We can get here when processing a member function template,
6252 member class template, and template template parameter of
6253 a template class. */
6254 tree decl = DECL_TEMPLATE_RESULT (t);
6259 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t))
6261 /* Template template parameter is treated here. */
6262 tree new_type = tsubst (TREE_TYPE (t), args, complain, in_decl);
6263 if (new_type == error_mark_node)
6264 return error_mark_node;
6267 TREE_CHAIN (r) = NULL_TREE;
6268 TREE_TYPE (r) = new_type;
6269 DECL_TEMPLATE_RESULT (r)
6270 = build_decl (TYPE_DECL, DECL_NAME (decl), new_type);
6271 DECL_TEMPLATE_PARMS (r)
6272 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t), args,
6274 TYPE_NAME (new_type) = r;
6278 /* We might already have an instance of this template.
6279 The ARGS are for the surrounding class type, so the
6280 full args contain the tsubst'd args for the context,
6281 plus the innermost args from the template decl. */
6282 tmpl_args = DECL_CLASS_TEMPLATE_P (t)
6283 ? CLASSTYPE_TI_ARGS (TREE_TYPE (t))
6284 : DECL_TI_ARGS (DECL_TEMPLATE_RESULT (t));
6285 /* Because this is a template, the arguments will still be
6286 dependent, even after substitution. If
6287 PROCESSING_TEMPLATE_DECL is not set, the dependency
6288 predicates will short-circuit. */
6289 ++processing_template_decl;
6290 full_args = tsubst_template_args (tmpl_args, args,
6292 --processing_template_decl;
6293 if (full_args == error_mark_node)
6294 return error_mark_node;
6296 /* tsubst_template_args doesn't copy the vector if
6297 nothing changed. But, *something* should have
6299 gcc_assert (full_args != tmpl_args);
6301 spec = retrieve_specialization (t, full_args,
6302 /*class_specializations_p=*/true);
6303 if (spec != NULL_TREE)
6309 /* Make a new template decl. It will be similar to the
6310 original, but will record the current template arguments.
6311 We also create a new function declaration, which is just
6312 like the old one, but points to this new template, rather
6313 than the old one. */
6315 gcc_assert (DECL_LANG_SPECIFIC (r) != 0);
6316 TREE_CHAIN (r) = NULL_TREE;
6318 DECL_TEMPLATE_INFO (r) = build_tree_list (t, args);
6320 if (TREE_CODE (decl) == TYPE_DECL)
6323 ++processing_template_decl;
6324 new_type = tsubst (TREE_TYPE (t), args, complain, in_decl);
6325 --processing_template_decl;
6326 if (new_type == error_mark_node)
6327 return error_mark_node;
6329 TREE_TYPE (r) = new_type;
6330 CLASSTYPE_TI_TEMPLATE (new_type) = r;
6331 DECL_TEMPLATE_RESULT (r) = TYPE_MAIN_DECL (new_type);
6332 DECL_TI_ARGS (r) = CLASSTYPE_TI_ARGS (new_type);
6333 DECL_CONTEXT (r) = TYPE_CONTEXT (new_type);
6338 ++processing_template_decl;
6339 new_decl = tsubst (decl, args, complain, in_decl);
6340 --processing_template_decl;
6341 if (new_decl == error_mark_node)
6342 return error_mark_node;
6344 DECL_TEMPLATE_RESULT (r) = new_decl;
6345 DECL_TI_TEMPLATE (new_decl) = r;
6346 TREE_TYPE (r) = TREE_TYPE (new_decl);
6347 DECL_TI_ARGS (r) = DECL_TI_ARGS (new_decl);
6348 DECL_CONTEXT (r) = DECL_CONTEXT (new_decl);
6351 SET_DECL_IMPLICIT_INSTANTIATION (r);
6352 DECL_TEMPLATE_INSTANTIATIONS (r) = NULL_TREE;
6353 DECL_TEMPLATE_SPECIALIZATIONS (r) = NULL_TREE;
6355 /* The template parameters for this new template are all the
6356 template parameters for the old template, except the
6357 outermost level of parameters. */
6358 DECL_TEMPLATE_PARMS (r)
6359 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t), args,
6362 if (PRIMARY_TEMPLATE_P (t))
6363 DECL_PRIMARY_TEMPLATE (r) = r;
6365 if (TREE_CODE (decl) != TYPE_DECL)
6366 /* Record this non-type partial instantiation. */
6367 register_specialization (r, t,
6368 DECL_TI_ARGS (DECL_TEMPLATE_RESULT (r)),
6376 tree argvec = NULL_TREE;
6384 /* Nobody should be tsubst'ing into non-template functions. */
6385 gcc_assert (DECL_TEMPLATE_INFO (t) != NULL_TREE);
6387 if (TREE_CODE (DECL_TI_TEMPLATE (t)) == TEMPLATE_DECL)
6392 /* If T is not dependent, just return it. We have to
6393 increment PROCESSING_TEMPLATE_DECL because
6394 value_dependent_expression_p assumes that nothing is
6395 dependent when PROCESSING_TEMPLATE_DECL is zero. */
6396 ++processing_template_decl;
6397 dependent_p = value_dependent_expression_p (t);
6398 --processing_template_decl;
6402 /* Calculate the most general template of which R is a
6403 specialization, and the complete set of arguments used to
6405 gen_tmpl = most_general_template (DECL_TI_TEMPLATE (t));
6406 argvec = tsubst_template_args (DECL_TI_ARGS
6407 (DECL_TEMPLATE_RESULT (gen_tmpl)),
6408 args, complain, in_decl);
6410 /* Check to see if we already have this specialization. */
6411 spec = retrieve_specialization (gen_tmpl, argvec,
6412 /*class_specializations_p=*/false);
6420 /* We can see more levels of arguments than parameters if
6421 there was a specialization of a member template, like
6424 template <class T> struct S { template <class U> void f(); }
6425 template <> template <class U> void S<int>::f(U);
6427 Here, we'll be substituting into the specialization,
6428 because that's where we can find the code we actually
6429 want to generate, but we'll have enough arguments for
6430 the most general template.
6432 We also deal with the peculiar case:
6434 template <class T> struct S {
6435 template <class U> friend void f();
6437 template <class U> void f() {}
6439 template void f<double>();
6441 Here, the ARGS for the instantiation of will be {int,
6442 double}. But, we only need as many ARGS as there are
6443 levels of template parameters in CODE_PATTERN. We are
6444 careful not to get fooled into reducing the ARGS in
6447 template <class T> struct S { template <class U> void f(U); }
6448 template <class T> template <> void S<T>::f(int) {}
6450 which we can spot because the pattern will be a
6451 specialization in this case. */
6452 args_depth = TMPL_ARGS_DEPTH (args);
6454 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (t)));
6455 if (args_depth > parms_depth
6456 && !DECL_TEMPLATE_SPECIALIZATION (t))
6457 args = get_innermost_template_args (args, parms_depth);
6461 /* This special case arises when we have something like this:
6463 template <class T> struct S {
6464 friend void f<int>(int, double);
6467 Here, the DECL_TI_TEMPLATE for the friend declaration
6468 will be an IDENTIFIER_NODE. We are being called from
6469 tsubst_friend_function, and we want only to create a
6470 new decl (R) with appropriate types so that we can call
6471 determine_specialization. */
6472 gen_tmpl = NULL_TREE;
6475 if (DECL_CLASS_SCOPE_P (t))
6477 if (DECL_NAME (t) == constructor_name (DECL_CONTEXT (t)))
6481 ctx = tsubst_aggr_type (DECL_CONTEXT (t), args,
6482 complain, t, /*entering_scope=*/1);
6487 ctx = DECL_CONTEXT (t);
6489 type = tsubst (TREE_TYPE (t), args, complain, in_decl);
6490 if (type == error_mark_node)
6491 return error_mark_node;
6493 /* We do NOT check for matching decls pushed separately at this
6494 point, as they may not represent instantiations of this
6495 template, and in any case are considered separate under the
6498 DECL_USE_TEMPLATE (r) = 0;
6499 TREE_TYPE (r) = type;
6500 /* Clear out the mangled name and RTL for the instantiation. */
6501 SET_DECL_ASSEMBLER_NAME (r, NULL_TREE);
6502 SET_DECL_RTL (r, NULL_RTX);
6503 DECL_INITIAL (r) = NULL_TREE;
6504 DECL_CONTEXT (r) = ctx;
6506 if (member && DECL_CONV_FN_P (r))
6507 /* Type-conversion operator. Reconstruct the name, in
6508 case it's the name of one of the template's parameters. */
6509 DECL_NAME (r) = mangle_conv_op_name_for_type (TREE_TYPE (type));
6511 DECL_ARGUMENTS (r) = tsubst (DECL_ARGUMENTS (t), args,
6513 DECL_RESULT (r) = NULL_TREE;
6515 TREE_STATIC (r) = 0;
6516 TREE_PUBLIC (r) = TREE_PUBLIC (t);
6517 DECL_EXTERNAL (r) = 1;
6518 /* If this is an instantiation of a function with internal
6519 linkage, we already know what object file linkage will be
6520 assigned to the instantiation. */
6521 DECL_INTERFACE_KNOWN (r) = !TREE_PUBLIC (r);
6522 DECL_DEFER_OUTPUT (r) = 0;
6523 TREE_CHAIN (r) = NULL_TREE;
6524 DECL_PENDING_INLINE_INFO (r) = 0;
6525 DECL_PENDING_INLINE_P (r) = 0;
6526 DECL_SAVED_TREE (r) = NULL_TREE;
6528 if (DECL_CLONED_FUNCTION (r))
6530 DECL_CLONED_FUNCTION (r) = tsubst (DECL_CLONED_FUNCTION (t),
6532 TREE_CHAIN (r) = TREE_CHAIN (DECL_CLONED_FUNCTION (r));
6533 TREE_CHAIN (DECL_CLONED_FUNCTION (r)) = r;
6536 /* Set up the DECL_TEMPLATE_INFO for R. There's no need to do
6537 this in the special friend case mentioned above where
6538 GEN_TMPL is NULL. */
6541 DECL_TEMPLATE_INFO (r)
6542 = tree_cons (gen_tmpl, argvec, NULL_TREE);
6543 SET_DECL_IMPLICIT_INSTANTIATION (r);
6544 register_specialization (r, gen_tmpl, argvec, false);
6546 /* We're not supposed to instantiate default arguments
6547 until they are called, for a template. But, for a
6550 template <class T> void f ()
6551 { extern void g(int i = T()); }
6553 we should do the substitution when the template is
6554 instantiated. We handle the member function case in
6555 instantiate_class_template since the default arguments
6556 might refer to other members of the class. */
6558 && !PRIMARY_TEMPLATE_P (gen_tmpl)
6559 && !uses_template_parms (argvec))
6560 tsubst_default_arguments (r);
6563 DECL_TEMPLATE_INFO (r) = NULL_TREE;
6565 /* Copy the list of befriending classes. */
6566 for (friends = &DECL_BEFRIENDING_CLASSES (r);
6568 friends = &TREE_CHAIN (*friends))
6570 *friends = copy_node (*friends);
6571 TREE_VALUE (*friends) = tsubst (TREE_VALUE (*friends),
6576 if (DECL_CONSTRUCTOR_P (r) || DECL_DESTRUCTOR_P (r))
6578 maybe_retrofit_in_chrg (r);
6579 if (DECL_CONSTRUCTOR_P (r))
6580 grok_ctor_properties (ctx, r);
6581 /* If this is an instantiation of a member template, clone it.
6582 If it isn't, that'll be handled by
6583 clone_constructors_and_destructors. */
6584 if (PRIMARY_TEMPLATE_P (gen_tmpl))
6585 clone_function_decl (r, /*update_method_vec_p=*/0);
6587 else if (IDENTIFIER_OPNAME_P (DECL_NAME (r)))
6588 grok_op_properties (r, (complain & tf_error) != 0);
6590 if (DECL_FRIEND_P (t) && DECL_FRIEND_CONTEXT (t))
6591 SET_DECL_FRIEND_CONTEXT (r,
6592 tsubst (DECL_FRIEND_CONTEXT (t),
6593 args, complain, in_decl));
6602 if (DECL_TEMPLATE_PARM_P (t))
6603 SET_DECL_TEMPLATE_PARM_P (r);
6605 type = tsubst (TREE_TYPE (t), args, complain, in_decl);
6606 type = type_decays_to (type);
6607 TREE_TYPE (r) = type;
6608 cp_apply_type_quals_to_decl (cp_type_quals (type), r);
6610 if (DECL_INITIAL (r))
6612 if (TREE_CODE (DECL_INITIAL (r)) != TEMPLATE_PARM_INDEX)
6613 DECL_INITIAL (r) = TREE_TYPE (r);
6615 DECL_INITIAL (r) = tsubst (DECL_INITIAL (r), args,
6619 DECL_CONTEXT (r) = NULL_TREE;
6621 if (!DECL_TEMPLATE_PARM_P (r))
6622 DECL_ARG_TYPE (r) = type_passed_as (type);
6624 TREE_CHAIN (r) = tsubst (TREE_CHAIN (t), args,
6625 complain, TREE_CHAIN (t));
6634 type = tsubst (TREE_TYPE (t), args, complain, in_decl);
6635 if (type == error_mark_node)
6636 return error_mark_node;
6637 TREE_TYPE (r) = type;
6638 cp_apply_type_quals_to_decl (cp_type_quals (type), r);
6640 /* We don't have to set DECL_CONTEXT here; it is set by
6641 finish_member_declaration. */
6642 DECL_INITIAL (r) = tsubst_expr (DECL_INITIAL (t), args,
6644 TREE_CHAIN (r) = NULL_TREE;
6645 if (VOID_TYPE_P (type))
6646 error ("instantiation of %q+D as type %qT", r, type);
6651 /* We reach here only for member using decls. */
6652 if (DECL_DEPENDENT_P (t))
6654 r = do_class_using_decl
6655 (tsubst_copy (USING_DECL_SCOPE (t), args, complain, in_decl),
6656 tsubst_copy (DECL_NAME (t), args, complain, in_decl));
6658 r = error_mark_node;
6663 TREE_CHAIN (r) = NULL_TREE;
6670 tree argvec = NULL_TREE;
6671 tree gen_tmpl = NULL_TREE;
6673 tree tmpl = NULL_TREE;
6675 tree type = NULL_TREE;
6678 if (TREE_CODE (t) == TYPE_DECL)
6680 type = tsubst (TREE_TYPE (t), args, complain, in_decl);
6681 if (TREE_CODE (type) == TEMPLATE_TEMPLATE_PARM
6682 || t == TYPE_MAIN_DECL (TREE_TYPE (t)))
6684 /* If this is the canonical decl, we don't have to
6685 mess with instantiations, and often we can't (for
6686 typename, template type parms and such). Note that
6687 TYPE_NAME is not correct for the above test if
6688 we've copied the type for a typedef. */
6689 r = TYPE_NAME (type);
6694 /* Assume this is a non-local variable. */
6697 if (TYPE_P (CP_DECL_CONTEXT (t)))
6698 ctx = tsubst_aggr_type (DECL_CONTEXT (t), args,
6700 in_decl, /*entering_scope=*/1);
6701 else if (DECL_NAMESPACE_SCOPE_P (t))
6702 ctx = DECL_CONTEXT (t);
6705 /* Subsequent calls to pushdecl will fill this in. */
6710 /* Check to see if we already have this specialization. */
6713 tmpl = DECL_TI_TEMPLATE (t);
6714 gen_tmpl = most_general_template (tmpl);
6715 argvec = tsubst (DECL_TI_ARGS (t), args, complain, in_decl);
6716 spec = retrieve_specialization (gen_tmpl, argvec,
6717 /*class_specializations_p=*/false);
6720 spec = retrieve_local_specialization (t);
6729 if (TREE_CODE (r) == VAR_DECL)
6731 /* Even if the original location is out of scope, the
6732 newly substituted one is not. */
6733 DECL_DEAD_FOR_LOCAL (r) = 0;
6734 DECL_INITIALIZED_P (r) = 0;
6735 DECL_TEMPLATE_INSTANTIATED (r) = 0;
6736 type = tsubst (TREE_TYPE (t), args, complain, in_decl);
6737 if (type == error_mark_node)
6738 return error_mark_node;
6739 type = complete_type (type);
6740 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (r)
6741 = DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (t);
6742 type = check_var_type (DECL_NAME (r), type);
6744 if (DECL_HAS_VALUE_EXPR_P (t))
6746 tree ve = DECL_VALUE_EXPR (t);
6747 ve = tsubst_expr (ve, args, complain, in_decl);
6748 SET_DECL_VALUE_EXPR (r, ve);
6751 else if (DECL_SELF_REFERENCE_P (t))
6752 SET_DECL_SELF_REFERENCE_P (r);
6753 TREE_TYPE (r) = type;
6754 cp_apply_type_quals_to_decl (cp_type_quals (type), r);
6755 DECL_CONTEXT (r) = ctx;
6756 /* Clear out the mangled name and RTL for the instantiation. */
6757 SET_DECL_ASSEMBLER_NAME (r, NULL_TREE);
6758 if (CODE_CONTAINS_STRUCT (TREE_CODE (t), TS_DECL_WRTL))
6759 SET_DECL_RTL (r, NULL_RTX);
6760 /* The initializer must not be expanded until it is required;
6762 DECL_INITIAL (r) = NULL_TREE;
6763 if (CODE_CONTAINS_STRUCT (TREE_CODE (t), TS_DECL_WRTL))
6764 SET_DECL_RTL (r, NULL_RTX);
6765 DECL_SIZE (r) = DECL_SIZE_UNIT (r) = 0;
6769 /* A static data member declaration is always marked
6770 external when it is declared in-class, even if an
6771 initializer is present. We mimic the non-template
6773 DECL_EXTERNAL (r) = 1;
6775 register_specialization (r, gen_tmpl, argvec, false);
6776 DECL_TEMPLATE_INFO (r) = tree_cons (tmpl, argvec, NULL_TREE);
6777 SET_DECL_IMPLICIT_INSTANTIATION (r);
6780 register_local_specialization (r, t);
6782 TREE_CHAIN (r) = NULL_TREE;
6791 /* Restore the file and line information. */
6792 input_location = saved_loc;
6797 /* Substitute into the ARG_TYPES of a function type. */
6800 tsubst_arg_types (tree arg_types,
6802 tsubst_flags_t complain,
6805 tree remaining_arg_types;
6808 tree result = NULL_TREE;
6810 if (!arg_types || arg_types == void_list_node)
6813 remaining_arg_types = tsubst_arg_types (TREE_CHAIN (arg_types),
6814 args, complain, in_decl);
6815 if (remaining_arg_types == error_mark_node)
6816 return error_mark_node;
6818 type = tsubst (TREE_VALUE (arg_types), args, complain, in_decl);
6819 if (type == error_mark_node)
6820 return error_mark_node;
6821 if (VOID_TYPE_P (type))
6823 if (complain & tf_error)
6825 error ("invalid parameter type %qT", type);
6827 error ("in declaration %q+D", in_decl);
6829 return error_mark_node;
6832 /* Do array-to-pointer, function-to-pointer conversion, and ignore
6833 top-level qualifiers as required. */
6834 type = TYPE_MAIN_VARIANT (type_decays_to (type));
6836 /* We do not substitute into default arguments here. The standard
6837 mandates that they be instantiated only when needed, which is
6838 done in build_over_call. */
6839 default_arg = TREE_PURPOSE (arg_types);
6841 if (default_arg && TREE_CODE (default_arg) == DEFAULT_ARG)
6843 /* We've instantiated a template before its default arguments
6844 have been parsed. This can happen for a nested template
6845 class, and is not an error unless we require the default
6846 argument in a call of this function. */
6847 result = tree_cons (default_arg, type, remaining_arg_types);
6848 VEC_safe_push (tree, gc, DEFARG_INSTANTIATIONS (default_arg), result);
6851 result = hash_tree_cons (default_arg, type, remaining_arg_types);
6856 /* Substitute into a FUNCTION_TYPE or METHOD_TYPE. This routine does
6857 *not* handle the exception-specification for FNTYPE, because the
6858 initial substitution of explicitly provided template parameters
6859 during argument deduction forbids substitution into the
6860 exception-specification:
6864 All references in the function type of the function template to the
6865 corresponding template parameters are replaced by the specified tem-
6866 plate argument values. If a substitution in a template parameter or
6867 in the function type of the function template results in an invalid
6868 type, type deduction fails. [Note: The equivalent substitution in
6869 exception specifications is done only when the function is instanti-
6870 ated, at which point a program is ill-formed if the substitution
6871 results in an invalid type.] */
6874 tsubst_function_type (tree t,
6876 tsubst_flags_t complain,
6883 /* The TYPE_CONTEXT is not used for function/method types. */
6884 gcc_assert (TYPE_CONTEXT (t) == NULL_TREE);
6886 /* Substitute the return type. */
6887 return_type = tsubst (TREE_TYPE (t), args, complain, in_decl);
6888 if (return_type == error_mark_node)
6889 return error_mark_node;
6890 /* The standard does not presently indicate that creation of a
6891 function type with an invalid return type is a deduction failure.
6892 However, that is clearly analogous to creating an array of "void"
6893 or a reference to a reference. This is core issue #486. */
6894 if (TREE_CODE (return_type) == ARRAY_TYPE
6895 || TREE_CODE (return_type) == FUNCTION_TYPE)
6897 if (complain & tf_error)
6899 if (TREE_CODE (return_type) == ARRAY_TYPE)
6900 error ("function returning an array");
6902 error ("function returning a function");
6904 return error_mark_node;
6907 /* Substitute the argument types. */
6908 arg_types = tsubst_arg_types (TYPE_ARG_TYPES (t), args,
6910 if (arg_types == error_mark_node)
6911 return error_mark_node;
6913 /* Construct a new type node and return it. */
6914 if (TREE_CODE (t) == FUNCTION_TYPE)
6915 fntype = build_function_type (return_type, arg_types);
6918 tree r = TREE_TYPE (TREE_VALUE (arg_types));
6919 if (! IS_AGGR_TYPE (r))
6923 Type deduction may fail for any of the following
6926 -- Attempting to create "pointer to member of T" when T
6927 is not a class type. */
6928 if (complain & tf_error)
6929 error ("creating pointer to member function of non-class type %qT",
6931 return error_mark_node;
6934 fntype = build_method_type_directly (r, return_type,
6935 TREE_CHAIN (arg_types));
6937 fntype = cp_build_qualified_type_real (fntype, TYPE_QUALS (t), complain);
6938 fntype = cp_build_type_attribute_variant (fntype, TYPE_ATTRIBUTES (t));
6943 /* FNTYPE is a FUNCTION_TYPE or METHOD_TYPE. Substitute the template
6944 ARGS into that specification, and return the substituted
6945 specification. If there is no specification, return NULL_TREE. */
6948 tsubst_exception_specification (tree fntype,
6950 tsubst_flags_t complain,
6956 specs = TYPE_RAISES_EXCEPTIONS (fntype);
6957 new_specs = NULL_TREE;
6960 if (! TREE_VALUE (specs))
6966 spec = tsubst (TREE_VALUE (specs), args, complain, in_decl);
6967 if (spec == error_mark_node)
6969 new_specs = add_exception_specifier (new_specs, spec, complain);
6970 specs = TREE_CHAIN (specs);
6976 /* Take the tree structure T and replace template parameters used
6977 therein with the argument vector ARGS. IN_DECL is an associated
6978 decl for diagnostics. If an error occurs, returns ERROR_MARK_NODE.
6979 Issue error and warning messages under control of COMPLAIN. Note
6980 that we must be relatively non-tolerant of extensions here, in
6981 order to preserve conformance; if we allow substitutions that
6982 should not be allowed, we may allow argument deductions that should
6983 not succeed, and therefore report ambiguous overload situations
6984 where there are none. In theory, we could allow the substitution,
6985 but indicate that it should have failed, and allow our caller to
6986 make sure that the right thing happens, but we don't try to do this
6989 This function is used for dealing with types, decls and the like;
6990 for expressions, use tsubst_expr or tsubst_copy. */
6993 tsubst (tree t, tree args, tsubst_flags_t complain, tree in_decl)
6997 if (t == NULL_TREE || t == error_mark_node
6998 || t == integer_type_node
6999 || t == void_type_node
7000 || t == char_type_node
7001 || t == unknown_type_node
7002 || TREE_CODE (t) == NAMESPACE_DECL)
7006 return tsubst_decl (t, args, complain);
7008 if (TREE_CODE (t) == IDENTIFIER_NODE)
7009 type = IDENTIFIER_TYPE_VALUE (t);
7011 type = TREE_TYPE (t);
7013 gcc_assert (type != unknown_type_node);
7016 && TREE_CODE (t) != TYPENAME_TYPE
7017 && TREE_CODE (t) != IDENTIFIER_NODE
7018 && TREE_CODE (t) != FUNCTION_TYPE
7019 && TREE_CODE (t) != METHOD_TYPE)
7020 type = tsubst (type, args, complain, in_decl);
7021 if (type == error_mark_node)
7022 return error_mark_node;
7024 switch (TREE_CODE (t))
7029 return tsubst_aggr_type (t, args, complain, in_decl,
7030 /*entering_scope=*/0);
7033 case IDENTIFIER_NODE:
7045 if (t == integer_type_node)
7048 if (TREE_CODE (TYPE_MIN_VALUE (t)) == INTEGER_CST
7049 && TREE_CODE (TYPE_MAX_VALUE (t)) == INTEGER_CST)
7053 tree max, omax = TREE_OPERAND (TYPE_MAX_VALUE (t), 0);
7055 /* The array dimension behaves like a non-type template arg,
7056 in that we want to fold it as much as possible. */
7057 max = tsubst_template_arg (omax, args, complain, in_decl);
7058 max = fold_decl_constant_value (max);
7062 Type deduction may fail for any of the following
7065 Attempting to create an array with a size that is
7066 zero or negative. */
7067 if (integer_zerop (max) && !(complain & tf_error))
7068 /* We must fail if performing argument deduction (as
7069 indicated by the state of complain), so that
7070 another substitution can be found. */
7071 return error_mark_node;
7073 else if (TREE_CODE (max) == INTEGER_CST
7074 && INT_CST_LT (max, integer_zero_node))
7076 if (complain & tf_error)
7077 error ("creating array with negative size (%qE)", max);
7079 return error_mark_node;
7082 return compute_array_index_type (NULL_TREE, max);
7085 case TEMPLATE_TYPE_PARM:
7086 case TEMPLATE_TEMPLATE_PARM:
7087 case BOUND_TEMPLATE_TEMPLATE_PARM:
7088 case TEMPLATE_PARM_INDEX:
7093 tree arg = NULL_TREE;
7097 gcc_assert (TREE_VEC_LENGTH (args) > 0);
7098 if (TREE_CODE (t) == TEMPLATE_TYPE_PARM
7099 || TREE_CODE (t) == TEMPLATE_TEMPLATE_PARM
7100 || TREE_CODE (t) == BOUND_TEMPLATE_TEMPLATE_PARM)
7102 idx = TEMPLATE_TYPE_IDX (t);
7103 level = TEMPLATE_TYPE_LEVEL (t);
7107 idx = TEMPLATE_PARM_IDX (t);
7108 level = TEMPLATE_PARM_LEVEL (t);
7111 levels = TMPL_ARGS_DEPTH (args);
7112 if (level <= levels)
7113 arg = TMPL_ARG (args, level, idx);
7115 if (arg == error_mark_node)
7116 return error_mark_node;
7117 else if (arg != NULL_TREE)
7119 if (TREE_CODE (t) == TEMPLATE_TYPE_PARM)
7121 gcc_assert (TYPE_P (arg));
7122 return cp_build_qualified_type_real
7123 (arg, cp_type_quals (arg) | cp_type_quals (t),
7124 complain | tf_ignore_bad_quals);
7126 else if (TREE_CODE (t) == BOUND_TEMPLATE_TEMPLATE_PARM)
7128 /* We are processing a type constructed from a
7129 template template parameter. */
7130 tree argvec = tsubst (TYPE_TI_ARGS (t),
7131 args, complain, in_decl);
7132 if (argvec == error_mark_node)
7133 return error_mark_node;
7135 /* We can get a TEMPLATE_TEMPLATE_PARM here when we
7136 are resolving nested-types in the signature of a
7137 member function templates. Otherwise ARG is a
7138 TEMPLATE_DECL and is the real template to be
7140 if (TREE_CODE (arg) == TEMPLATE_TEMPLATE_PARM)
7141 arg = TYPE_NAME (arg);
7143 r = lookup_template_class (arg,
7146 /*entering_scope=*/0,
7148 return cp_build_qualified_type_real
7149 (r, TYPE_QUALS (t), complain);
7152 /* TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX. */
7157 /* This can happen during the attempted tsubst'ing in
7158 unify. This means that we don't yet have any information
7159 about the template parameter in question. */
7162 /* If we get here, we must have been looking at a parm for a
7163 more deeply nested template. Make a new version of this
7164 template parameter, but with a lower level. */
7165 switch (TREE_CODE (t))
7167 case TEMPLATE_TYPE_PARM:
7168 case TEMPLATE_TEMPLATE_PARM:
7169 case BOUND_TEMPLATE_TEMPLATE_PARM:
7170 if (cp_type_quals (t))
7172 r = tsubst (TYPE_MAIN_VARIANT (t), args, complain, in_decl);
7173 r = cp_build_qualified_type_real
7174 (r, cp_type_quals (t),
7175 complain | (TREE_CODE (t) == TEMPLATE_TYPE_PARM
7176 ? tf_ignore_bad_quals : 0));
7181 TEMPLATE_TYPE_PARM_INDEX (r)
7182 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (t),
7184 TYPE_STUB_DECL (r) = TYPE_NAME (r) = TEMPLATE_TYPE_DECL (r);
7185 TYPE_MAIN_VARIANT (r) = r;
7186 TYPE_POINTER_TO (r) = NULL_TREE;
7187 TYPE_REFERENCE_TO (r) = NULL_TREE;
7189 if (TREE_CODE (t) == BOUND_TEMPLATE_TEMPLATE_PARM)
7191 tree argvec = tsubst (TYPE_TI_ARGS (t), args,
7193 if (argvec == error_mark_node)
7194 return error_mark_node;
7196 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (r)
7197 = tree_cons (TYPE_TI_TEMPLATE (t), argvec, NULL_TREE);
7202 case TEMPLATE_PARM_INDEX:
7203 r = reduce_template_parm_level (t, type, levels);
7215 tree purpose, value, chain;
7217 if (t == void_list_node)
7220 purpose = TREE_PURPOSE (t);
7223 purpose = tsubst (purpose, args, complain, in_decl);
7224 if (purpose == error_mark_node)
7225 return error_mark_node;
7227 value = TREE_VALUE (t);
7230 value = tsubst (value, args, complain, in_decl);
7231 if (value == error_mark_node)
7232 return error_mark_node;
7234 chain = TREE_CHAIN (t);
7235 if (chain && chain != void_type_node)
7237 chain = tsubst (chain, args, complain, in_decl);
7238 if (chain == error_mark_node)
7239 return error_mark_node;
7241 if (purpose == TREE_PURPOSE (t)
7242 && value == TREE_VALUE (t)
7243 && chain == TREE_CHAIN (t))
7245 return hash_tree_cons (purpose, value, chain);
7249 /* We should never be tsubsting a binfo. */
7253 /* A vector of template arguments. */
7255 return tsubst_template_args (t, args, complain, in_decl);
7258 case REFERENCE_TYPE:
7260 enum tree_code code;
7262 if (type == TREE_TYPE (t) && TREE_CODE (type) != METHOD_TYPE)
7265 code = TREE_CODE (t);
7270 Type deduction may fail for any of the following
7273 -- Attempting to create a pointer to reference type.
7274 -- Attempting to create a reference to a reference type or
7275 a reference to void. */
7276 if (TREE_CODE (type) == REFERENCE_TYPE
7277 || (code == REFERENCE_TYPE && TREE_CODE (type) == VOID_TYPE))
7279 static location_t last_loc;
7281 /* We keep track of the last time we issued this error
7282 message to avoid spewing a ton of messages during a
7283 single bad template instantiation. */
7284 if (complain & tf_error
7285 #ifdef USE_MAPPED_LOCATION
7286 && last_loc != input_location
7288 && (last_loc.line != input_line
7289 || last_loc.file != input_filename)
7293 if (TREE_CODE (type) == VOID_TYPE)
7294 error ("forming reference to void");
7296 error ("forming %s to reference type %qT",
7297 (code == POINTER_TYPE) ? "pointer" : "reference",
7299 last_loc = input_location;
7302 return error_mark_node;
7304 else if (code == POINTER_TYPE)
7306 r = build_pointer_type (type);
7307 if (TREE_CODE (type) == METHOD_TYPE)
7308 r = build_ptrmemfunc_type (r);
7311 r = build_reference_type (type);
7312 r = cp_build_qualified_type_real (r, TYPE_QUALS (t), complain);
7314 if (r != error_mark_node)
7315 /* Will this ever be needed for TYPE_..._TO values? */
7322 r = tsubst (TYPE_OFFSET_BASETYPE (t), args, complain, in_decl);
7323 if (r == error_mark_node || !IS_AGGR_TYPE (r))
7327 Type deduction may fail for any of the following
7330 -- Attempting to create "pointer to member of T" when T
7331 is not a class type. */
7332 if (complain & tf_error)
7333 error ("creating pointer to member of non-class type %qT", r);
7334 return error_mark_node;
7336 if (TREE_CODE (type) == REFERENCE_TYPE)
7338 if (complain & tf_error)
7339 error ("creating pointer to member reference type %qT", type);
7340 return error_mark_node;
7342 if (TREE_CODE (type) == VOID_TYPE)
7344 if (complain & tf_error)
7345 error ("creating pointer to member of type void");
7346 return error_mark_node;
7348 gcc_assert (TREE_CODE (type) != METHOD_TYPE);
7349 if (TREE_CODE (type) == FUNCTION_TYPE)
7351 /* The type of the implicit object parameter gets its
7352 cv-qualifiers from the FUNCTION_TYPE. */
7354 tree this_type = cp_build_qualified_type (TYPE_MAIN_VARIANT (r),
7355 cp_type_quals (type));
7357 method_type = build_method_type_directly (this_type,
7359 TYPE_ARG_TYPES (type));
7360 memptr = build_ptrmemfunc_type (build_pointer_type (method_type));
7361 return cp_build_qualified_type_real (memptr, cp_type_quals (t),
7365 return cp_build_qualified_type_real (build_ptrmem_type (r, type),
7374 fntype = tsubst_function_type (t, args, complain, in_decl);
7375 if (fntype == error_mark_node)
7376 return error_mark_node;
7378 /* Substitute the exception specification. */
7379 specs = tsubst_exception_specification (t, args, complain,
7381 if (specs == error_mark_node)
7382 return error_mark_node;
7384 fntype = build_exception_variant (fntype, specs);
7389 tree domain = tsubst (TYPE_DOMAIN (t), args, complain, in_decl);
7390 if (domain == error_mark_node)
7391 return error_mark_node;
7393 /* As an optimization, we avoid regenerating the array type if
7394 it will obviously be the same as T. */
7395 if (type == TREE_TYPE (t) && domain == TYPE_DOMAIN (t))
7398 /* These checks should match the ones in grokdeclarator.
7402 The deduction may fail for any of the following reasons:
7404 -- Attempting to create an array with an element type that
7405 is void, a function type, or a reference type, or [DR337]
7406 an abstract class type. */
7407 if (TREE_CODE (type) == VOID_TYPE
7408 || TREE_CODE (type) == FUNCTION_TYPE
7409 || TREE_CODE (type) == REFERENCE_TYPE)
7411 if (complain & tf_error)
7412 error ("creating array of %qT", type);
7413 return error_mark_node;
7415 if (CLASS_TYPE_P (type) && CLASSTYPE_PURE_VIRTUALS (type))
7417 if (complain & tf_error)
7418 error ("creating array of %qT, which is an abstract class type",
7420 return error_mark_node;
7423 r = build_cplus_array_type (type, domain);
7430 tree e1 = tsubst (TREE_OPERAND (t, 0), args, complain, in_decl);
7431 tree e2 = tsubst (TREE_OPERAND (t, 1), args, complain, in_decl);
7433 if (e1 == error_mark_node || e2 == error_mark_node)
7434 return error_mark_node;
7436 return fold_build2 (TREE_CODE (t), TREE_TYPE (t), e1, e2);
7442 tree e = tsubst (TREE_OPERAND (t, 0), args, complain, in_decl);
7443 if (e == error_mark_node)
7444 return error_mark_node;
7446 return fold_build1 (TREE_CODE (t), TREE_TYPE (t), e);
7451 tree ctx = tsubst_aggr_type (TYPE_CONTEXT (t), args, complain,
7452 in_decl, /*entering_scope=*/1);
7453 tree f = tsubst_copy (TYPENAME_TYPE_FULLNAME (t), args,
7456 if (ctx == error_mark_node || f == error_mark_node)
7457 return error_mark_node;
7459 if (!IS_AGGR_TYPE (ctx))
7461 if (complain & tf_error)
7462 error ("%qT is not a class, struct, or union type", ctx);
7463 return error_mark_node;
7465 else if (!uses_template_parms (ctx) && !TYPE_BEING_DEFINED (ctx))
7467 /* Normally, make_typename_type does not require that the CTX
7468 have complete type in order to allow things like:
7470 template <class T> struct S { typename S<T>::X Y; };
7472 But, such constructs have already been resolved by this
7473 point, so here CTX really should have complete type, unless
7474 it's a partial instantiation. */
7475 ctx = complete_type (ctx);
7476 if (!COMPLETE_TYPE_P (ctx))
7478 if (complain & tf_error)
7479 cxx_incomplete_type_error (NULL_TREE, ctx);
7480 return error_mark_node;
7484 f = make_typename_type (ctx, f, typename_type,
7485 (complain & tf_error) | tf_keep_type_decl);
7486 if (f == error_mark_node)
7488 if (TREE_CODE (f) == TYPE_DECL)
7490 complain |= tf_ignore_bad_quals;
7494 if (TREE_CODE (f) != TYPENAME_TYPE)
7496 if (TYPENAME_IS_ENUM_P (t) && TREE_CODE (f) != ENUMERAL_TYPE)
7497 error ("%qT resolves to %qT, which is not an enumeration type",
7499 else if (TYPENAME_IS_CLASS_P (t) && !CLASS_TYPE_P (f))
7500 error ("%qT resolves to %qT, which is is not a class type",
7504 return cp_build_qualified_type_real
7505 (f, cp_type_quals (f) | cp_type_quals (t), complain);
7508 case UNBOUND_CLASS_TEMPLATE:
7510 tree ctx = tsubst_aggr_type (TYPE_CONTEXT (t), args, complain,
7511 in_decl, /*entering_scope=*/1);
7512 tree name = TYPE_IDENTIFIER (t);
7513 tree parm_list = DECL_TEMPLATE_PARMS (TYPE_NAME (t));
7515 if (ctx == error_mark_node || name == error_mark_node)
7516 return error_mark_node;
7519 parm_list = tsubst_template_parms (parm_list, args, complain);
7520 return make_unbound_class_template (ctx, name, parm_list, complain);
7530 tree e1 = tsubst (TREE_OPERAND (t, 0), args, complain, in_decl);
7531 tree e2 = tsubst_expr (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 build_nt (ARRAY_REF, e1, e2, NULL_TREE, NULL_TREE);
7540 tree e1 = tsubst (TREE_OPERAND (t, 0), args, complain, in_decl);
7541 tree e2 = tsubst (TREE_OPERAND (t, 1), args, complain, in_decl);
7542 if (e1 == error_mark_node || e2 == error_mark_node)
7543 return error_mark_node;
7545 return build_qualified_name (/*type=*/NULL_TREE,
7546 e1, e2, QUALIFIED_NAME_IS_TEMPLATE (t));
7553 type = finish_typeof (tsubst_expr (TYPEOF_TYPE_EXPR (t), args,
7554 complain, in_decl));
7555 return cp_build_qualified_type_real (type,
7557 | cp_type_quals (type),
7562 sorry ("use of %qs in template",
7563 tree_code_name [(int) TREE_CODE (t)]);
7564 return error_mark_node;
7568 /* Like tsubst_expr for a BASELINK. OBJECT_TYPE, if non-NULL, is the
7569 type of the expression on the left-hand side of the "." or "->"
7573 tsubst_baselink (tree baselink, tree object_type,
7574 tree args, tsubst_flags_t complain, tree in_decl)
7577 tree qualifying_scope;
7579 tree template_args = 0;
7580 bool template_id_p = false;
7582 /* A baselink indicates a function from a base class. The
7583 BASELINK_ACCESS_BINFO and BASELINK_BINFO are going to have
7584 non-dependent types; otherwise, the lookup could not have
7585 succeeded. However, they may indicate bases of the template
7586 class, rather than the instantiated class.
7588 In addition, lookups that were not ambiguous before may be
7589 ambiguous now. Therefore, we perform the lookup again. */
7590 qualifying_scope = BINFO_TYPE (BASELINK_ACCESS_BINFO (baselink));
7591 fns = BASELINK_FUNCTIONS (baselink);
7592 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)
7594 template_id_p = true;
7595 template_args = TREE_OPERAND (fns, 1);
7596 fns = TREE_OPERAND (fns, 0);
7598 template_args = tsubst_template_args (template_args, args,
7601 name = DECL_NAME (get_first_fn (fns));
7602 baselink = lookup_fnfields (qualifying_scope, name, /*protect=*/1);
7604 /* If lookup found a single function, mark it as used at this
7605 point. (If it lookup found multiple functions the one selected
7606 later by overload resolution will be marked as used at that
7608 if (BASELINK_P (baselink))
7609 fns = BASELINK_FUNCTIONS (baselink);
7610 if (!template_id_p && !really_overloaded_fn (fns))
7611 mark_used (OVL_CURRENT (fns));
7613 /* Add back the template arguments, if present. */
7614 if (BASELINK_P (baselink) && template_id_p)
7615 BASELINK_FUNCTIONS (baselink)
7616 = build_nt (TEMPLATE_ID_EXPR,
7617 BASELINK_FUNCTIONS (baselink),
7621 object_type = current_class_type;
7622 return adjust_result_of_qualified_name_lookup (baselink,
7627 /* Like tsubst_expr for a SCOPE_REF, given by QUALIFIED_ID. DONE is
7628 true if the qualified-id will be a postfix-expression in-and-of
7629 itself; false if more of the postfix-expression follows the
7630 QUALIFIED_ID. ADDRESS_P is true if the qualified-id is the operand
7634 tsubst_qualified_id (tree qualified_id, tree args,
7635 tsubst_flags_t complain, tree in_decl,
7636 bool done, bool address_p)
7644 gcc_assert (TREE_CODE (qualified_id) == SCOPE_REF);
7646 /* Figure out what name to look up. */
7647 name = TREE_OPERAND (qualified_id, 1);
7648 if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
7651 template_args = TREE_OPERAND (name, 1);
7653 template_args = tsubst_template_args (template_args, args,
7655 name = TREE_OPERAND (name, 0);
7659 is_template = false;
7660 template_args = NULL_TREE;
7663 /* Substitute into the qualifying scope. When there are no ARGS, we
7664 are just trying to simplify a non-dependent expression. In that
7665 case the qualifying scope may be dependent, and, in any case,
7666 substituting will not help. */
7667 scope = TREE_OPERAND (qualified_id, 0);
7670 scope = tsubst (scope, args, complain, in_decl);
7671 expr = tsubst_copy (name, args, complain, in_decl);
7676 if (dependent_type_p (scope))
7677 return build_qualified_name (/*type=*/NULL_TREE,
7679 QUALIFIED_NAME_IS_TEMPLATE (qualified_id));
7681 if (!BASELINK_P (name) && !DECL_P (expr))
7683 if (TREE_CODE (expr) == BIT_NOT_EXPR)
7684 /* If this were actually a destructor call, it would have been
7685 parsed as such by the parser. */
7686 expr = error_mark_node;
7688 expr = lookup_qualified_name (scope, expr, /*is_type_p=*/0, false);
7689 if (TREE_CODE (TREE_CODE (expr) == TEMPLATE_DECL
7690 ? DECL_TEMPLATE_RESULT (expr) : expr) == TYPE_DECL)
7692 if (complain & tf_error)
7694 error ("dependent-name %qE is parsed as a non-type, but "
7695 "instantiation yields a type", qualified_id);
7696 inform ("say %<typename %E%> if a type is meant", qualified_id);
7698 return error_mark_node;
7704 check_accessibility_of_qualified_id (expr, /*object_type=*/NULL_TREE,
7706 /* Remember that there was a reference to this entity. */
7710 if (expr == error_mark_node || TREE_CODE (expr) == TREE_LIST)
7712 if (complain & tf_error)
7713 qualified_name_lookup_error (scope,
7714 TREE_OPERAND (qualified_id, 1),
7716 return error_mark_node;
7720 expr = lookup_template_function (expr, template_args);
7722 if (expr == error_mark_node && complain & tf_error)
7723 qualified_name_lookup_error (scope, TREE_OPERAND (qualified_id, 1),
7725 else if (TYPE_P (scope))
7727 expr = (adjust_result_of_qualified_name_lookup
7728 (expr, scope, current_class_type));
7729 expr = (finish_qualified_id_expr
7730 (scope, expr, done, address_p,
7731 QUALIFIED_NAME_IS_TEMPLATE (qualified_id),
7732 /*template_arg_p=*/false));
7735 if (TREE_CODE (expr) != SCOPE_REF)
7736 expr = convert_from_reference (expr);
7741 /* Like tsubst, but deals with expressions. This function just replaces
7742 template parms; to finish processing the resultant expression, use
7746 tsubst_copy (tree t, tree args, tsubst_flags_t complain, tree in_decl)
7748 enum tree_code code;
7751 if (t == NULL_TREE || t == error_mark_node)
7754 code = TREE_CODE (t);
7759 r = retrieve_local_specialization (t);
7760 gcc_assert (r != NULL);
7769 if (DECL_TEMPLATE_PARM_P (t))
7770 return tsubst_copy (DECL_INITIAL (t), args, complain, in_decl);
7771 /* There is no need to substitute into namespace-scope
7773 if (DECL_NAMESPACE_SCOPE_P (t))
7775 /* If ARGS is NULL, then T is known to be non-dependent. */
7776 if (args == NULL_TREE)
7777 return integral_constant_value (t);
7779 /* Unfortunately, we cannot just call lookup_name here.
7782 template <int I> int f() {
7784 struct S { void g() { E e = a; } };
7787 When we instantiate f<7>::S::g(), say, lookup_name is not
7788 clever enough to find f<7>::a. */
7790 = tsubst_aggr_type (TREE_TYPE (t), args, complain, in_decl,
7791 /*entering_scope=*/0);
7793 for (v = TYPE_VALUES (enum_type);
7796 if (TREE_PURPOSE (v) == DECL_NAME (t))
7797 return TREE_VALUE (v);
7799 /* We didn't find the name. That should never happen; if
7800 name-lookup found it during preliminary parsing, we
7801 should find it again here during instantiation. */
7807 if (DECL_CONTEXT (t))
7811 ctx = tsubst_aggr_type (DECL_CONTEXT (t), args, complain, in_decl,
7812 /*entering_scope=*/1);
7813 if (ctx != DECL_CONTEXT (t))
7815 tree r = lookup_field (ctx, DECL_NAME (t), 0, false);
7818 if (complain & tf_error)
7819 error ("using invalid field %qD", t);
7820 return error_mark_node;
7830 if ((DECL_LANG_SPECIFIC (t) && DECL_TEMPLATE_INFO (t))
7831 || local_variable_p (t))
7832 t = tsubst (t, args, complain, in_decl);
7837 return tsubst_baselink (t, current_class_type, args, complain, in_decl);
7840 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t))
7841 return tsubst (TREE_TYPE (DECL_TEMPLATE_RESULT (t)),
7842 args, complain, in_decl);
7843 else if (DECL_FUNCTION_TEMPLATE_P (t) && DECL_MEMBER_TEMPLATE_P (t))
7844 return tsubst (t, args, complain, in_decl);
7845 else if (DECL_CLASS_SCOPE_P (t)
7846 && uses_template_parms (DECL_CONTEXT (t)))
7848 /* Template template argument like the following example need
7851 template <template <class> class TT> struct C {};
7852 template <class T> struct D {
7853 template <class U> struct E {};
7858 We are processing the template argument `E' in #1 for
7859 the template instantiation #2. Originally, `E' is a
7860 TEMPLATE_DECL with `D<T>' as its DECL_CONTEXT. Now we
7861 have to substitute this with one having context `D<int>'. */
7863 tree context = tsubst (DECL_CONTEXT (t), args, complain, in_decl);
7864 return lookup_field (context, DECL_NAME(t), 0, false);
7867 /* Ordinary template template argument. */
7871 case REINTERPRET_CAST_EXPR:
7872 case CONST_CAST_EXPR:
7873 case STATIC_CAST_EXPR:
7874 case DYNAMIC_CAST_EXPR:
7877 (code, tsubst (TREE_TYPE (t), args, complain, in_decl),
7878 tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl));
7882 case TRUTH_NOT_EXPR:
7885 case UNARY_PLUS_EXPR: /* Unary + */
7894 (code, tsubst (TREE_TYPE (t), args, complain, in_decl),
7895 tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl));
7902 object = tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl);
7903 name = TREE_OPERAND (t, 1);
7904 if (TREE_CODE (name) == BIT_NOT_EXPR)
7906 name = tsubst_copy (TREE_OPERAND (name, 0), args,
7908 name = build1 (BIT_NOT_EXPR, NULL_TREE, name);
7910 else if (TREE_CODE (name) == SCOPE_REF
7911 && TREE_CODE (TREE_OPERAND (name, 1)) == BIT_NOT_EXPR)
7913 tree base = tsubst_copy (TREE_OPERAND (name, 0), args,
7915 name = TREE_OPERAND (name, 1);
7916 name = tsubst_copy (TREE_OPERAND (name, 0), args,
7918 name = build1 (BIT_NOT_EXPR, NULL_TREE, name);
7919 name = build_qualified_name (/*type=*/NULL_TREE,
7921 /*template_p=*/false);
7923 else if (TREE_CODE (name) == BASELINK)
7924 name = tsubst_baselink (name,
7925 non_reference (TREE_TYPE (object)),
7929 name = tsubst_copy (name, args, complain, in_decl);
7930 return build_nt (COMPONENT_REF, object, name, NULL_TREE);
7936 case TRUNC_DIV_EXPR:
7938 case FLOOR_DIV_EXPR:
7939 case ROUND_DIV_EXPR:
7940 case EXACT_DIV_EXPR:
7944 case TRUNC_MOD_EXPR:
7945 case FLOOR_MOD_EXPR:
7946 case TRUTH_ANDIF_EXPR:
7947 case TRUTH_ORIF_EXPR:
7948 case TRUTH_AND_EXPR:
7965 case PREDECREMENT_EXPR:
7966 case PREINCREMENT_EXPR:
7967 case POSTDECREMENT_EXPR:
7968 case POSTINCREMENT_EXPR:
7970 (code, tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl),
7971 tsubst_copy (TREE_OPERAND (t, 1), args, complain, in_decl));
7974 return build_qualified_name (/*type=*/NULL_TREE,
7975 tsubst_copy (TREE_OPERAND (t, 0),
7976 args, complain, in_decl),
7977 tsubst_copy (TREE_OPERAND (t, 1),
7978 args, complain, in_decl),
7979 QUALIFIED_NAME_IS_TEMPLATE (t));
7984 tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl),
7985 tsubst_copy (TREE_OPERAND (t, 1), args, complain, in_decl),
7986 NULL_TREE, NULL_TREE);
7989 return build_nt (code,
7990 tsubst_copy (TREE_OPERAND (t, 0), args,
7992 tsubst_copy (TREE_OPERAND (t, 1), args, complain,
7998 case PSEUDO_DTOR_EXPR:
8001 (code, tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl),
8002 tsubst_copy (TREE_OPERAND (t, 1), args, complain, in_decl),
8003 tsubst_copy (TREE_OPERAND (t, 2), args, complain, in_decl));
8004 TREE_NO_WARNING (r) = TREE_NO_WARNING (t);
8011 (code, tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl),
8012 tsubst_copy (TREE_OPERAND (t, 1), args, complain, in_decl),
8013 tsubst_copy (TREE_OPERAND (t, 2), args, complain, in_decl));
8014 NEW_EXPR_USE_GLOBAL (r) = NEW_EXPR_USE_GLOBAL (t);
8021 (code, tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl),
8022 tsubst_copy (TREE_OPERAND (t, 1), args, complain, in_decl));
8023 DELETE_EXPR_USE_GLOBAL (r) = DELETE_EXPR_USE_GLOBAL (t);
8024 DELETE_EXPR_USE_VEC (r) = DELETE_EXPR_USE_VEC (t);
8028 case TEMPLATE_ID_EXPR:
8030 /* Substituted template arguments */
8031 tree fn = TREE_OPERAND (t, 0);
8032 tree targs = TREE_OPERAND (t, 1);
8034 fn = tsubst_copy (fn, args, complain, in_decl);
8036 targs = tsubst_template_args (targs, args, complain, in_decl);
8038 return lookup_template_function (fn, targs);
8043 tree purpose, value, chain;
8045 if (t == void_list_node)
8048 purpose = TREE_PURPOSE (t);
8050 purpose = tsubst_copy (purpose, args, complain, in_decl);
8051 value = TREE_VALUE (t);
8053 value = tsubst_copy (value, args, complain, in_decl);
8054 chain = TREE_CHAIN (t);
8055 if (chain && chain != void_type_node)
8056 chain = tsubst_copy (chain, args, complain, in_decl);
8057 if (purpose == TREE_PURPOSE (t)
8058 && value == TREE_VALUE (t)
8059 && chain == TREE_CHAIN (t))
8061 return tree_cons (purpose, value, chain);
8068 case TEMPLATE_TYPE_PARM:
8069 case TEMPLATE_TEMPLATE_PARM:
8070 case BOUND_TEMPLATE_TEMPLATE_PARM:
8071 case TEMPLATE_PARM_INDEX:
8073 case REFERENCE_TYPE:
8079 case UNBOUND_CLASS_TEMPLATE:
8082 return tsubst (t, args, complain, in_decl);
8084 case IDENTIFIER_NODE:
8085 if (IDENTIFIER_TYPENAME_P (t))
8087 tree new_type = tsubst (TREE_TYPE (t), args, complain, in_decl);
8088 return mangle_conv_op_name_for_type (new_type);
8094 /* This is handled by tsubst_copy_and_build. */
8098 return build_x_va_arg (tsubst_copy (TREE_OPERAND (t, 0), args, complain,
8100 tsubst (TREE_TYPE (t), args, complain, in_decl));
8102 case CLEANUP_POINT_EXPR:
8103 /* We shouldn't have built any of these during initial template
8104 generation. Instead, they should be built during instantiation
8105 in response to the saved STMT_IS_FULL_EXPR_P setting. */
8109 mark_used (TREE_OPERAND (t, 1));
8117 /* Like tsubst_copy, but specifically for OpenMP clauses. */
8120 tsubst_omp_clauses (tree clauses, tree args, tsubst_flags_t complain,
8123 tree new_clauses = NULL, nc, oc;
8125 for (oc = clauses; oc ; oc = OMP_CLAUSE_CHAIN (oc))
8127 nc = copy_node (oc);
8128 OMP_CLAUSE_CHAIN (nc) = new_clauses;
8131 switch (OMP_CLAUSE_CODE (nc))
8133 case OMP_CLAUSE_PRIVATE:
8134 case OMP_CLAUSE_SHARED:
8135 case OMP_CLAUSE_FIRSTPRIVATE:
8136 case OMP_CLAUSE_LASTPRIVATE:
8137 case OMP_CLAUSE_REDUCTION:
8138 case OMP_CLAUSE_COPYIN:
8139 case OMP_CLAUSE_COPYPRIVATE:
8141 case OMP_CLAUSE_NUM_THREADS:
8142 case OMP_CLAUSE_SCHEDULE:
8143 OMP_CLAUSE_OPERAND (nc, 0)
8144 = tsubst_expr (OMP_CLAUSE_OPERAND (oc, 0), args, complain, in_decl);
8146 case OMP_CLAUSE_NOWAIT:
8147 case OMP_CLAUSE_ORDERED:
8148 case OMP_CLAUSE_DEFAULT:
8155 return finish_omp_clauses (nreverse (new_clauses));
8158 /* Like tsubst_copy_and_build, but unshare TREE_LIST nodes. */
8161 tsubst_copy_asm_operands (tree t, tree args, tsubst_flags_t complain,
8164 #define RECUR(t) tsubst_copy_asm_operands (t, args, complain, in_decl)
8166 tree purpose, value, chain;
8171 if (TREE_CODE (t) != TREE_LIST)
8172 return tsubst_copy_and_build (t, args, complain, in_decl,
8173 /*function_p=*/false);
8175 if (t == void_list_node)
8178 purpose = TREE_PURPOSE (t);
8180 purpose = RECUR (purpose);
8181 value = TREE_VALUE (t);
8183 value = RECUR (value);
8184 chain = TREE_CHAIN (t);
8185 if (chain && chain != void_type_node)
8186 chain = RECUR (chain);
8187 return tree_cons (purpose, value, chain);
8191 /* Like tsubst_copy for expressions, etc. but also does semantic
8195 tsubst_expr (tree t, tree args, tsubst_flags_t complain, tree in_decl)
8199 if (t == NULL_TREE || t == error_mark_node)
8202 if (EXPR_HAS_LOCATION (t))
8203 input_location = EXPR_LOCATION (t);
8204 if (STATEMENT_CODE_P (TREE_CODE (t)))
8205 current_stmt_tree ()->stmts_are_full_exprs_p = STMT_IS_FULL_EXPR_P (t);
8207 switch (TREE_CODE (t))
8209 case STATEMENT_LIST:
8211 tree_stmt_iterator i;
8212 for (i = tsi_start (t); !tsi_end_p (i); tsi_next (&i))
8213 tsubst_expr (tsi_stmt (i), args, complain, in_decl);
8217 case CTOR_INITIALIZER:
8218 finish_mem_initializers (tsubst_initializer_list
8219 (TREE_OPERAND (t, 0), args));
8223 finish_return_stmt (tsubst_expr (TREE_OPERAND (t, 0),
8224 args, complain, in_decl));
8228 tmp = tsubst_expr (EXPR_STMT_EXPR (t), args, complain, in_decl);
8229 if (EXPR_STMT_STMT_EXPR_RESULT (t))
8230 finish_stmt_expr_expr (tmp, cur_stmt_expr);
8232 finish_expr_stmt (tmp);
8236 do_using_directive (tsubst_expr (USING_STMT_NAMESPACE (t),
8237 args, complain, in_decl));
8245 decl = DECL_EXPR_DECL (t);
8246 if (TREE_CODE (decl) == LABEL_DECL)
8247 finish_label_decl (DECL_NAME (decl));
8248 else if (TREE_CODE (decl) == USING_DECL)
8250 tree scope = USING_DECL_SCOPE (decl);
8251 tree name = DECL_NAME (decl);
8254 scope = tsubst_expr (scope, args, complain, in_decl);
8255 decl = lookup_qualified_name (scope, name,
8256 /*is_type_p=*/false,
8257 /*complain=*/false);
8258 if (decl == error_mark_node || TREE_CODE (decl) == TREE_LIST)
8259 qualified_name_lookup_error (scope, name, decl);
8261 do_local_using_decl (decl, scope, name);
8265 init = DECL_INITIAL (decl);
8266 decl = tsubst (decl, args, complain, in_decl);
8267 if (decl != error_mark_node)
8269 /* By marking the declaration as instantiated, we avoid
8270 trying to instantiate it. Since instantiate_decl can't
8271 handle local variables, and since we've already done
8272 all that needs to be done, that's the right thing to
8274 if (TREE_CODE (decl) == VAR_DECL)
8275 DECL_TEMPLATE_INSTANTIATED (decl) = 1;
8276 if (TREE_CODE (decl) == VAR_DECL
8277 && ANON_AGGR_TYPE_P (TREE_TYPE (decl)))
8278 /* Anonymous aggregates are a special case. */
8279 finish_anon_union (decl);
8282 maybe_push_decl (decl);
8283 if (TREE_CODE (decl) == VAR_DECL
8284 && DECL_PRETTY_FUNCTION_P (decl))
8286 /* For __PRETTY_FUNCTION__ we have to adjust the
8288 const char *const name
8289 = cxx_printable_name (current_function_decl, 2);
8290 init = cp_fname_init (name, &TREE_TYPE (decl));
8293 init = tsubst_expr (init, args, complain, in_decl);
8294 finish_decl (decl, init, NULL_TREE);
8299 /* A DECL_EXPR can also be used as an expression, in the condition
8300 clause of an if/for/while construct. */
8305 stmt = begin_for_stmt ();
8306 tsubst_expr (FOR_INIT_STMT (t), args, complain, in_decl);
8307 finish_for_init_stmt (stmt);
8308 tmp = tsubst_expr (FOR_COND (t), args, complain, in_decl);
8309 finish_for_cond (tmp, stmt);
8310 tmp = tsubst_expr (FOR_EXPR (t), args, complain, in_decl);
8311 finish_for_expr (tmp, stmt);
8312 tsubst_expr (FOR_BODY (t), args, complain, in_decl);
8313 finish_for_stmt (stmt);
8317 stmt = begin_while_stmt ();
8318 tmp = tsubst_expr (WHILE_COND (t), args, complain, in_decl);
8319 finish_while_stmt_cond (tmp, stmt);
8320 tsubst_expr (WHILE_BODY (t), args, complain, in_decl);
8321 finish_while_stmt (stmt);
8325 stmt = begin_do_stmt ();
8326 tsubst_expr (DO_BODY (t), args, complain, in_decl);
8327 finish_do_body (stmt);
8328 tmp = tsubst_expr (DO_COND (t), args, complain, in_decl);
8329 finish_do_stmt (tmp, stmt);
8333 stmt = begin_if_stmt ();
8334 tmp = tsubst_expr (IF_COND (t), args, complain, in_decl);
8335 finish_if_stmt_cond (tmp, stmt);
8336 tsubst_expr (THEN_CLAUSE (t), args, complain, in_decl);
8337 finish_then_clause (stmt);
8339 if (ELSE_CLAUSE (t))
8341 begin_else_clause (stmt);
8342 tsubst_expr (ELSE_CLAUSE (t), args, complain, in_decl);
8343 finish_else_clause (stmt);
8346 finish_if_stmt (stmt);
8350 if (BIND_EXPR_BODY_BLOCK (t))
8351 stmt = begin_function_body ();
8353 stmt = begin_compound_stmt (BIND_EXPR_TRY_BLOCK (t)
8354 ? BCS_TRY_BLOCK : 0);
8356 tsubst_expr (BIND_EXPR_BODY (t), args, complain, in_decl);
8358 if (BIND_EXPR_BODY_BLOCK (t))
8359 finish_function_body (stmt);
8361 finish_compound_stmt (stmt);
8365 finish_break_stmt ();
8369 finish_continue_stmt ();
8373 stmt = begin_switch_stmt ();
8374 tmp = tsubst_expr (SWITCH_STMT_COND (t), args, complain, in_decl);
8375 finish_switch_cond (tmp, stmt);
8376 tsubst_expr (SWITCH_STMT_BODY (t), args, complain, in_decl);
8377 finish_switch_stmt (stmt);
8380 case CASE_LABEL_EXPR:
8381 finish_case_label (tsubst_expr (CASE_LOW (t), args, complain, in_decl),
8382 tsubst_expr (CASE_HIGH (t), args, complain,
8387 finish_label_stmt (DECL_NAME (LABEL_EXPR_LABEL (t)));
8391 tmp = GOTO_DESTINATION (t);
8392 if (TREE_CODE (tmp) != LABEL_DECL)
8393 /* Computed goto's must be tsubst'd into. On the other hand,
8394 non-computed gotos must not be; the identifier in question
8395 will have no binding. */
8396 tmp = tsubst_expr (tmp, args, complain, in_decl);
8398 tmp = DECL_NAME (tmp);
8399 finish_goto_stmt (tmp);
8403 tmp = finish_asm_stmt
8404 (ASM_VOLATILE_P (t),
8405 tsubst_expr (ASM_STRING (t), args, complain, in_decl),
8406 tsubst_copy_asm_operands (ASM_OUTPUTS (t), args, complain, in_decl),
8407 tsubst_copy_asm_operands (ASM_INPUTS (t), args, complain, in_decl),
8408 tsubst_copy_asm_operands (ASM_CLOBBERS (t), args, complain, in_decl));
8410 tree asm_expr = tmp;
8411 if (TREE_CODE (asm_expr) == CLEANUP_POINT_EXPR)
8412 asm_expr = TREE_OPERAND (asm_expr, 0);
8413 ASM_INPUT_P (asm_expr) = ASM_INPUT_P (t);
8420 stmt = begin_try_block ();
8421 tsubst_expr (TRY_STMTS (t), args, complain, in_decl);
8422 finish_cleanup_try_block (stmt);
8423 finish_cleanup (tsubst_expr (TRY_HANDLERS (t), args,
8429 tree compound_stmt = NULL_TREE;
8431 if (FN_TRY_BLOCK_P (t))
8432 stmt = begin_function_try_block (&compound_stmt);
8434 stmt = begin_try_block ();
8436 tsubst_expr (TRY_STMTS (t), args, complain, in_decl);
8438 if (FN_TRY_BLOCK_P (t))
8439 finish_function_try_block (stmt);
8441 finish_try_block (stmt);
8443 tsubst_expr (TRY_HANDLERS (t), args, complain, in_decl);
8444 if (FN_TRY_BLOCK_P (t))
8445 finish_function_handler_sequence (stmt, compound_stmt);
8447 finish_handler_sequence (stmt);
8455 stmt = begin_handler ();
8456 if (HANDLER_PARMS (t))
8458 decl = HANDLER_PARMS (t);
8459 decl = tsubst (decl, args, complain, in_decl);
8460 /* Prevent instantiate_decl from trying to instantiate
8461 this variable. We've already done all that needs to be
8463 DECL_TEMPLATE_INSTANTIATED (decl) = 1;
8467 finish_handler_parms (decl, stmt);
8468 tsubst_expr (HANDLER_BODY (t), args, complain, in_decl);
8469 finish_handler (stmt);
8474 tsubst (TREE_TYPE (t), args, complain, NULL_TREE);
8478 tmp = tsubst_omp_clauses (OMP_PARALLEL_CLAUSES (t),
8479 args, complain, in_decl);
8480 stmt = begin_omp_parallel ();
8481 tsubst_expr (OMP_PARALLEL_BODY (t), args, complain, in_decl);
8482 OMP_PARALLEL_COMBINED (finish_omp_parallel (tmp, stmt))
8483 = OMP_PARALLEL_COMBINED (t);
8488 tree clauses, decl, init, cond, incr, body, pre_body;
8490 clauses = tsubst_omp_clauses (OMP_FOR_CLAUSES (t),
8491 args, complain, in_decl);
8492 init = OMP_FOR_INIT (t);
8493 gcc_assert (TREE_CODE (init) == MODIFY_EXPR);
8494 decl = tsubst_expr (TREE_OPERAND (init, 0), args, complain, in_decl);
8495 init = tsubst_expr (TREE_OPERAND (init, 1), args, complain, in_decl);
8496 cond = tsubst_expr (OMP_FOR_COND (t), args, complain, in_decl);
8497 incr = tsubst_expr (OMP_FOR_INCR (t), args, complain, in_decl);
8499 stmt = begin_omp_structured_block ();
8501 pre_body = push_stmt_list ();
8502 tsubst_expr (OMP_FOR_PRE_BODY (t), args, complain, in_decl);
8503 pre_body = pop_stmt_list (pre_body);
8505 body = push_stmt_list ();
8506 tsubst_expr (OMP_FOR_BODY (t), args, complain, in_decl);
8507 body = pop_stmt_list (body);
8509 t = finish_omp_for (EXPR_LOCATION (t), decl, init, cond, incr, body,
8512 OMP_FOR_CLAUSES (t) = clauses;
8514 add_stmt (finish_omp_structured_block (stmt));
8520 tmp = tsubst_omp_clauses (OMP_CLAUSES (t), args, complain, in_decl);
8521 stmt = push_stmt_list ();
8522 tsubst_expr (OMP_BODY (t), args, complain, in_decl);
8523 stmt = pop_stmt_list (stmt);
8526 OMP_BODY (t) = stmt;
8527 OMP_CLAUSES (t) = tmp;
8535 stmt = push_stmt_list ();
8536 tsubst_expr (OMP_BODY (t), args, complain, in_decl);
8537 stmt = pop_stmt_list (stmt);
8540 OMP_BODY (t) = stmt;
8547 op0 = tsubst_expr (TREE_OPERAND (t, 0), args, complain, in_decl);
8548 op1 = tsubst_expr (TREE_OPERAND (t, 1), args, complain, in_decl);
8549 if (OMP_ATOMIC_DEPENDENT_P (t))
8550 c_finish_omp_atomic (OMP_ATOMIC_CODE (t), op0, op1);
8552 add_stmt (build2 (OMP_ATOMIC, void_type_node, op0, op1));
8557 gcc_assert (!STATEMENT_CODE_P (TREE_CODE (t)));
8559 return tsubst_copy_and_build (t, args, complain, in_decl,
8560 /*function_p=*/false);
8566 /* T is a postfix-expression that is not being used in a function
8567 call. Return the substituted version of T. */
8570 tsubst_non_call_postfix_expression (tree t, tree args,
8571 tsubst_flags_t complain,
8574 if (TREE_CODE (t) == SCOPE_REF)
8575 t = tsubst_qualified_id (t, args, complain, in_decl,
8576 /*done=*/false, /*address_p=*/false);
8578 t = tsubst_copy_and_build (t, args, complain, in_decl,
8579 /*function_p=*/false);
8584 /* Like tsubst but deals with expressions and performs semantic
8585 analysis. FUNCTION_P is true if T is the "F" in "F (ARGS)". */
8588 tsubst_copy_and_build (tree t,
8590 tsubst_flags_t complain,
8594 #define RECUR(NODE) \
8595 tsubst_copy_and_build (NODE, args, complain, in_decl, /*function_p=*/false)
8599 if (t == NULL_TREE || t == error_mark_node)
8602 switch (TREE_CODE (t))
8607 case IDENTIFIER_NODE:
8611 bool non_integral_constant_expression_p;
8612 const char *error_msg;
8614 if (IDENTIFIER_TYPENAME_P (t))
8616 tree new_type = tsubst (TREE_TYPE (t), args, complain, in_decl);
8617 t = mangle_conv_op_name_for_type (new_type);
8620 /* Look up the name. */
8621 decl = lookup_name (t);
8623 /* By convention, expressions use ERROR_MARK_NODE to indicate
8624 failure, not NULL_TREE. */
8625 if (decl == NULL_TREE)
8626 decl = error_mark_node;
8628 decl = finish_id_expression (t, decl, NULL_TREE,
8630 /*integral_constant_expression_p=*/false,
8631 /*allow_non_integral_constant_expression_p=*/false,
8632 &non_integral_constant_expression_p,
8633 /*template_p=*/false,
8635 /*address_p=*/false,
8636 /*template_arg_p=*/false,
8640 if (!function_p && TREE_CODE (decl) == IDENTIFIER_NODE)
8641 decl = unqualified_name_lookup_error (decl);
8645 case TEMPLATE_ID_EXPR:
8648 tree template = RECUR (TREE_OPERAND (t, 0));
8649 tree targs = TREE_OPERAND (t, 1);
8652 targs = tsubst_template_args (targs, args, complain, in_decl);
8654 if (TREE_CODE (template) == COMPONENT_REF)
8656 object = TREE_OPERAND (template, 0);
8657 template = TREE_OPERAND (template, 1);
8661 template = lookup_template_function (template, targs);
8664 return build3 (COMPONENT_REF, TREE_TYPE (template),
8665 object, template, NULL_TREE);
8672 tree r = RECUR (TREE_OPERAND (t, 0));
8674 if (REFERENCE_REF_P (t))
8676 /* A type conversion to reference type will be enclosed in
8677 such an indirect ref, but the substitution of the cast
8678 will have also added such an indirect ref. */
8679 if (TREE_CODE (TREE_TYPE (r)) == REFERENCE_TYPE)
8680 r = convert_from_reference (r);
8683 r = build_x_indirect_ref (r, "unary *");
8689 (tsubst (TREE_TYPE (t), args, complain, in_decl),
8690 RECUR (TREE_OPERAND (t, 0)));
8693 return build_functional_cast
8694 (tsubst (TREE_TYPE (t), args, complain, in_decl),
8695 RECUR (TREE_OPERAND (t, 0)));
8697 case REINTERPRET_CAST_EXPR:
8698 return build_reinterpret_cast
8699 (tsubst (TREE_TYPE (t), args, complain, in_decl),
8700 RECUR (TREE_OPERAND (t, 0)));
8702 case CONST_CAST_EXPR:
8703 return build_const_cast
8704 (tsubst (TREE_TYPE (t), args, complain, in_decl),
8705 RECUR (TREE_OPERAND (t, 0)));
8707 case DYNAMIC_CAST_EXPR:
8708 return build_dynamic_cast
8709 (tsubst (TREE_TYPE (t), args, complain, in_decl),
8710 RECUR (TREE_OPERAND (t, 0)));
8712 case STATIC_CAST_EXPR:
8713 return build_static_cast
8714 (tsubst (TREE_TYPE (t), args, complain, in_decl),
8715 RECUR (TREE_OPERAND (t, 0)));
8717 case POSTDECREMENT_EXPR:
8718 case POSTINCREMENT_EXPR:
8719 op1 = tsubst_non_call_postfix_expression (TREE_OPERAND (t, 0),
8720 args, complain, in_decl);
8721 return build_x_unary_op (TREE_CODE (t), op1);
8723 case PREDECREMENT_EXPR:
8724 case PREINCREMENT_EXPR:
8728 case TRUTH_NOT_EXPR:
8729 case UNARY_PLUS_EXPR: /* Unary + */
8732 return build_x_unary_op (TREE_CODE (t), RECUR (TREE_OPERAND (t, 0)));
8735 op1 = TREE_OPERAND (t, 0);
8736 if (TREE_CODE (op1) == SCOPE_REF)
8737 op1 = tsubst_qualified_id (op1, args, complain, in_decl,
8738 /*done=*/true, /*address_p=*/true);
8740 op1 = tsubst_non_call_postfix_expression (op1, args, complain,
8742 if (TREE_CODE (op1) == LABEL_DECL)
8743 return finish_label_address_expr (DECL_NAME (op1));
8744 return build_x_unary_op (ADDR_EXPR, op1);
8749 case TRUNC_DIV_EXPR:
8751 case FLOOR_DIV_EXPR:
8752 case ROUND_DIV_EXPR:
8753 case EXACT_DIV_EXPR:
8757 case TRUNC_MOD_EXPR:
8758 case FLOOR_MOD_EXPR:
8759 case TRUTH_ANDIF_EXPR:
8760 case TRUTH_ORIF_EXPR:
8761 case TRUTH_AND_EXPR:
8777 return build_x_binary_op
8779 RECUR (TREE_OPERAND (t, 0)),
8780 RECUR (TREE_OPERAND (t, 1)),
8781 /*overloaded_p=*/NULL);
8784 return tsubst_qualified_id (t, args, complain, in_decl, /*done=*/true,
8785 /*address_p=*/false);
8787 op1 = tsubst_non_call_postfix_expression (TREE_OPERAND (t, 0),
8788 args, complain, in_decl);
8789 return build_x_binary_op (ARRAY_REF, op1, RECUR (TREE_OPERAND (t, 1)),
8790 /*overloaded_p=*/NULL);
8794 op1 = TREE_OPERAND (t, 0);
8797 /* When there are no ARGS, we are trying to evaluate a
8798 non-dependent expression from the parser. Trying to do
8799 the substitutions may not work. */
8801 op1 = TREE_TYPE (op1);
8810 return cxx_sizeof_or_alignof_type (op1, TREE_CODE (t), true);
8812 return cxx_sizeof_or_alignof_expr (op1, TREE_CODE (t));
8816 tree r = build_x_modify_expr
8817 (RECUR (TREE_OPERAND (t, 0)),
8818 TREE_CODE (TREE_OPERAND (t, 1)),
8819 RECUR (TREE_OPERAND (t, 2)));
8820 /* TREE_NO_WARNING must be set if either the expression was
8821 parenthesized or it uses an operator such as >>= rather
8822 than plain assignment. In the former case, it was already
8823 set and must be copied. In the latter case,
8824 build_x_modify_expr sets it and it must not be reset
8826 if (TREE_NO_WARNING (t))
8827 TREE_NO_WARNING (r) = TREE_NO_WARNING (t);
8832 op1 = tsubst_non_call_postfix_expression (TREE_OPERAND (t, 0),
8833 args, complain, in_decl);
8834 /* Remember that there was a reference to this entity. */
8837 return build_x_arrow (op1);
8841 (RECUR (TREE_OPERAND (t, 0)),
8842 RECUR (TREE_OPERAND (t, 1)),
8843 RECUR (TREE_OPERAND (t, 2)),
8844 RECUR (TREE_OPERAND (t, 3)),
8845 NEW_EXPR_USE_GLOBAL (t));
8848 return delete_sanity
8849 (RECUR (TREE_OPERAND (t, 0)),
8850 RECUR (TREE_OPERAND (t, 1)),
8851 DELETE_EXPR_USE_VEC (t),
8852 DELETE_EXPR_USE_GLOBAL (t));
8855 return build_x_compound_expr (RECUR (TREE_OPERAND (t, 0)),
8856 RECUR (TREE_OPERAND (t, 1)));
8865 function = TREE_OPERAND (t, 0);
8866 /* When we parsed the expression, we determined whether or
8867 not Koenig lookup should be performed. */
8868 koenig_p = KOENIG_LOOKUP_P (t);
8869 if (TREE_CODE (function) == SCOPE_REF)
8872 function = tsubst_qualified_id (function, args, complain, in_decl,
8874 /*address_p=*/false);
8878 if (TREE_CODE (function) == COMPONENT_REF)
8880 tree op = TREE_OPERAND (function, 1);
8882 qualified_p = (TREE_CODE (op) == SCOPE_REF
8884 && BASELINK_QUALIFIED_P (op)));
8887 qualified_p = false;
8889 function = tsubst_copy_and_build (function, args, complain,
8892 if (BASELINK_P (function))
8896 call_args = RECUR (TREE_OPERAND (t, 1));
8898 /* We do not perform argument-dependent lookup if normal
8899 lookup finds a non-function, in accordance with the
8900 expected resolution of DR 218. */
8902 && ((is_overloaded_fn (function)
8903 /* If lookup found a member function, the Koenig lookup is
8904 not appropriate, even if an unqualified-name was used
8905 to denote the function. */
8906 && !DECL_FUNCTION_MEMBER_P (get_first_fn (function)))
8907 || TREE_CODE (function) == IDENTIFIER_NODE))
8908 function = perform_koenig_lookup (function, call_args);
8910 if (TREE_CODE (function) == IDENTIFIER_NODE)
8912 unqualified_name_lookup_error (function);
8913 return error_mark_node;
8916 /* Remember that there was a reference to this entity. */
8917 if (DECL_P (function))
8918 mark_used (function);
8920 if (TREE_CODE (function) == OFFSET_REF)
8921 return build_offset_ref_call_from_tree (function, call_args);
8922 if (TREE_CODE (function) == COMPONENT_REF)
8924 if (!BASELINK_P (TREE_OPERAND (function, 1)))
8925 return finish_call_expr (function, call_args,
8926 /*disallow_virtual=*/false,
8927 /*koenig_p=*/false);
8929 return (build_new_method_call
8930 (TREE_OPERAND (function, 0),
8931 TREE_OPERAND (function, 1),
8932 call_args, NULL_TREE,
8933 qualified_p ? LOOKUP_NONVIRTUAL : LOOKUP_NORMAL,
8936 return finish_call_expr (function, call_args,
8937 /*disallow_virtual=*/qualified_p,
8942 return build_x_conditional_expr
8943 (RECUR (TREE_OPERAND (t, 0)),
8944 RECUR (TREE_OPERAND (t, 1)),
8945 RECUR (TREE_OPERAND (t, 2)));
8947 case PSEUDO_DTOR_EXPR:
8948 return finish_pseudo_destructor_expr
8949 (RECUR (TREE_OPERAND (t, 0)),
8950 RECUR (TREE_OPERAND (t, 1)),
8951 RECUR (TREE_OPERAND (t, 2)));
8955 tree purpose, value, chain;
8957 if (t == void_list_node)
8960 purpose = TREE_PURPOSE (t);
8962 purpose = RECUR (purpose);
8963 value = TREE_VALUE (t);
8965 value = RECUR (value);
8966 chain = TREE_CHAIN (t);
8967 if (chain && chain != void_type_node)
8968 chain = RECUR (chain);
8969 if (purpose == TREE_PURPOSE (t)
8970 && value == TREE_VALUE (t)
8971 && chain == TREE_CHAIN (t))
8973 return tree_cons (purpose, value, chain);
8982 object = tsubst_non_call_postfix_expression (TREE_OPERAND (t, 0),
8983 args, complain, in_decl);
8984 /* Remember that there was a reference to this entity. */
8985 if (DECL_P (object))
8987 object_type = TREE_TYPE (object);
8989 member = TREE_OPERAND (t, 1);
8990 if (BASELINK_P (member))
8991 member = tsubst_baselink (member,
8992 non_reference (TREE_TYPE (object)),
8993 args, complain, in_decl);
8995 member = tsubst_copy (member, args, complain, in_decl);
8996 if (member == error_mark_node)
8997 return error_mark_node;
8999 if (object_type && !CLASS_TYPE_P (object_type))
9001 if (TREE_CODE (member) == BIT_NOT_EXPR)
9002 return finish_pseudo_destructor_expr (object,
9005 else if (TREE_CODE (member) == SCOPE_REF
9006 && (TREE_CODE (TREE_OPERAND (member, 1)) == BIT_NOT_EXPR))
9007 return finish_pseudo_destructor_expr (object,
9011 else if (TREE_CODE (member) == SCOPE_REF
9012 && TREE_CODE (TREE_OPERAND (member, 1)) == TEMPLATE_ID_EXPR)
9017 /* Lookup the template functions now that we know what the
9019 tmpl = TREE_OPERAND (TREE_OPERAND (member, 1), 0);
9020 args = TREE_OPERAND (TREE_OPERAND (member, 1), 1);
9021 member = lookup_qualified_name (TREE_OPERAND (member, 0), tmpl,
9022 /*is_type_p=*/false,
9023 /*complain=*/false);
9024 if (BASELINK_P (member))
9026 BASELINK_FUNCTIONS (member)
9027 = build_nt (TEMPLATE_ID_EXPR, BASELINK_FUNCTIONS (member),
9029 member = (adjust_result_of_qualified_name_lookup
9030 (member, BINFO_TYPE (BASELINK_BINFO (member)),
9035 qualified_name_lookup_error (object_type, tmpl, member);
9036 return error_mark_node;
9039 else if (TREE_CODE (member) == SCOPE_REF
9040 && !CLASS_TYPE_P (TREE_OPERAND (member, 0))
9041 && TREE_CODE (TREE_OPERAND (member, 0)) != NAMESPACE_DECL)
9043 if (complain & tf_error)
9045 if (TYPE_P (TREE_OPERAND (member, 0)))
9046 error ("%qT is not a class or namespace",
9047 TREE_OPERAND (member, 0));
9049 error ("%qD is not a class or namespace",
9050 TREE_OPERAND (member, 0));
9052 return error_mark_node;
9054 else if (TREE_CODE (member) == FIELD_DECL)
9055 return finish_non_static_data_member (member, object, NULL_TREE);
9057 return finish_class_member_access_expr (object, member,
9058 /*template_p=*/false);
9063 (RECUR (TREE_OPERAND (t, 0)));
9067 VEC(constructor_elt,gc) *n;
9068 constructor_elt *ce;
9069 unsigned HOST_WIDE_INT idx;
9071 tree type = tsubst (TREE_TYPE (t), args, complain, in_decl);
9072 bool process_index_p;
9074 /* digest_init will do the wrong thing if we let it. */
9075 if (type && TYPE_PTRMEMFUNC_P (type))
9078 /* We do not want to process the index of aggregate
9079 initializers as they are identifier nodes which will be
9080 looked up by digest_init. */
9081 process_index_p = !(type && IS_AGGR_TYPE (type));
9083 n = VEC_copy (constructor_elt, gc, CONSTRUCTOR_ELTS (t));
9084 for (idx = 0; VEC_iterate (constructor_elt, n, idx, ce); idx++)
9086 if (ce->index && process_index_p)
9087 ce->index = RECUR (ce->index);
9088 ce->value = RECUR (ce->value);
9091 r = build_constructor (NULL_TREE, n);
9092 TREE_HAS_CONSTRUCTOR (r) = TREE_HAS_CONSTRUCTOR (t);
9095 return digest_init (type, r);
9101 tree operand_0 = RECUR (TREE_OPERAND (t, 0));
9102 if (TYPE_P (operand_0))
9103 return get_typeid (operand_0);
9104 return build_typeid (operand_0);
9114 tree r = tsubst_copy (t, args, complain, in_decl);
9116 if (TREE_CODE (TREE_TYPE (t)) != REFERENCE_TYPE)
9117 /* If the original type was a reference, we'll be wrapped in
9118 the appropriate INDIRECT_REF. */
9119 r = convert_from_reference (r);
9124 return build_x_va_arg (RECUR (TREE_OPERAND (t, 0)),
9125 tsubst_copy (TREE_TYPE (t), args, complain,
9129 return fold_offsetof (RECUR (TREE_OPERAND (t, 0)));
9133 tree old_stmt_expr = cur_stmt_expr;
9134 tree stmt_expr = begin_stmt_expr ();
9136 cur_stmt_expr = stmt_expr;
9137 tsubst_expr (STMT_EXPR_STMT (t), args, complain, in_decl);
9138 stmt_expr = finish_stmt_expr (stmt_expr, false);
9139 cur_stmt_expr = old_stmt_expr;
9145 t = tsubst_copy (t, args, complain, in_decl);
9146 /* As in finish_id_expression, we resolve enumeration constants
9147 to their underlying values. */
9148 if (TREE_CODE (t) == CONST_DECL)
9149 return DECL_INITIAL (t);
9153 /* Handle Objective-C++ constructs, if appropriate. */
9156 = objcp_tsubst_copy_and_build (t, args, complain,
9157 in_decl, /*function_p=*/false);
9161 return tsubst_copy (t, args, complain, in_decl);
9167 /* Verify that the instantiated ARGS are valid. For type arguments,
9168 make sure that the type's linkage is ok. For non-type arguments,
9169 make sure they are constants if they are integral or enumerations.
9170 Emit an error under control of COMPLAIN, and return TRUE on error. */
9173 check_instantiated_args (tree tmpl, tree args, tsubst_flags_t complain)
9175 int ix, len = DECL_NTPARMS (tmpl);
9176 bool result = false;
9178 for (ix = 0; ix != len; ix++)
9180 tree t = TREE_VEC_ELT (args, ix);
9184 /* [basic.link]: A name with no linkage (notably, the name
9185 of a class or enumeration declared in a local scope)
9186 shall not be used to declare an entity with linkage.
9187 This implies that names with no linkage cannot be used as
9188 template arguments. */
9189 tree nt = no_linkage_check (t, /*relaxed_p=*/false);
9193 /* DR 488 makes use of a type with no linkage cause
9194 type deduction to fail. */
9195 if (complain & tf_error)
9197 if (TYPE_ANONYMOUS_P (nt))
9198 error ("%qT is/uses anonymous type", t);
9200 error ("template argument for %qD uses local type %qT",
9205 /* In order to avoid all sorts of complications, we do not
9206 allow variably-modified types as template arguments. */
9207 else if (variably_modified_type_p (t, NULL_TREE))
9209 if (complain & tf_error)
9210 error ("%qT is a variably modified type", t);
9214 /* A non-type argument of integral or enumerated type must be a
9216 else if (TREE_TYPE (t)
9217 && INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (t))
9218 && !TREE_CONSTANT (t))
9220 if (complain & tf_error)
9221 error ("integral expression %qE is not constant", t);
9225 if (result && (complain & tf_error))
9226 error (" trying to instantiate %qD", tmpl);
9230 /* Instantiate the indicated variable or function template TMPL with
9231 the template arguments in TARG_PTR. */
9234 instantiate_template (tree tmpl, tree targ_ptr, tsubst_flags_t complain)
9240 if (tmpl == error_mark_node)
9241 return error_mark_node;
9243 gcc_assert (TREE_CODE (tmpl) == TEMPLATE_DECL);
9245 /* If this function is a clone, handle it specially. */
9246 if (DECL_CLONED_FUNCTION_P (tmpl))
9251 spec = instantiate_template (DECL_CLONED_FUNCTION (tmpl), targ_ptr,
9253 if (spec == error_mark_node)
9254 return error_mark_node;
9256 /* Look for the clone. */
9257 FOR_EACH_CLONE (clone, spec)
9258 if (DECL_NAME (clone) == DECL_NAME (tmpl))
9260 /* We should always have found the clone by now. */
9265 /* Check to see if we already have this specialization. */
9266 spec = retrieve_specialization (tmpl, targ_ptr,
9267 /*class_specializations_p=*/false);
9268 if (spec != NULL_TREE)
9271 gen_tmpl = most_general_template (tmpl);
9272 if (tmpl != gen_tmpl)
9274 /* The TMPL is a partial instantiation. To get a full set of
9275 arguments we must add the arguments used to perform the
9276 partial instantiation. */
9277 targ_ptr = add_outermost_template_args (DECL_TI_ARGS (tmpl),
9280 /* Check to see if we already have this specialization. */
9281 spec = retrieve_specialization (gen_tmpl, targ_ptr,
9282 /*class_specializations_p=*/false);
9283 if (spec != NULL_TREE)
9287 if (check_instantiated_args (gen_tmpl, INNERMOST_TEMPLATE_ARGS (targ_ptr),
9289 return error_mark_node;
9291 /* We are building a FUNCTION_DECL, during which the access of its
9292 parameters and return types have to be checked. However this
9293 FUNCTION_DECL which is the desired context for access checking
9294 is not built yet. We solve this chicken-and-egg problem by
9295 deferring all checks until we have the FUNCTION_DECL. */
9296 push_deferring_access_checks (dk_deferred);
9298 /* Substitute template parameters. */
9299 fndecl = tsubst (DECL_TEMPLATE_RESULT (gen_tmpl),
9300 targ_ptr, complain, gen_tmpl);
9301 if (fndecl == error_mark_node)
9302 return error_mark_node;
9304 /* Now we know the specialization, compute access previously
9306 push_access_scope (fndecl);
9307 perform_deferred_access_checks ();
9308 pop_access_scope (fndecl);
9309 pop_deferring_access_checks ();
9311 /* The DECL_TI_TEMPLATE should always be the immediate parent
9312 template, not the most general template. */
9313 DECL_TI_TEMPLATE (fndecl) = tmpl;
9315 /* If we've just instantiated the main entry point for a function,
9316 instantiate all the alternate entry points as well. We do this
9317 by cloning the instantiation of the main entry point, not by
9318 instantiating the template clones. */
9319 if (TREE_CHAIN (gen_tmpl) && DECL_CLONED_FUNCTION_P (TREE_CHAIN (gen_tmpl)))
9320 clone_function_decl (fndecl, /*update_method_vec_p=*/0);
9325 /* The FN is a TEMPLATE_DECL for a function. The ARGS are the
9326 arguments that are being used when calling it. TARGS is a vector
9327 into which the deduced template arguments are placed.
9329 Return zero for success, 2 for an incomplete match that doesn't resolve
9330 all the types, and 1 for complete failure. An error message will be
9331 printed only for an incomplete match.
9333 If FN is a conversion operator, or we are trying to produce a specific
9334 specialization, RETURN_TYPE is the return type desired.
9336 The EXPLICIT_TARGS are explicit template arguments provided via a
9339 The parameter STRICT is one of:
9342 We are deducing arguments for a function call, as in
9346 We are deducing arguments for a conversion function, as in
9350 We are deducing arguments when doing an explicit instantiation
9351 as in [temp.explicit], when determining an explicit specialization
9352 as in [temp.expl.spec], or when taking the address of a function
9353 template, as in [temp.deduct.funcaddr]. */
9356 fn_type_unification (tree fn,
9357 tree explicit_targs,
9361 unification_kind_t strict,
9368 gcc_assert (TREE_CODE (fn) == TEMPLATE_DECL);
9370 fntype = TREE_TYPE (fn);
9375 The specified template arguments must match the template
9376 parameters in kind (i.e., type, nontype, template), and there
9377 must not be more arguments than there are parameters;
9378 otherwise type deduction fails.
9380 Nontype arguments must match the types of the corresponding
9381 nontype template parameters, or must be convertible to the
9382 types of the corresponding nontype parameters as specified in
9383 _temp.arg.nontype_, otherwise type deduction fails.
9385 All references in the function type of the function template
9386 to the corresponding template parameters are replaced by the
9387 specified template argument values. If a substitution in a
9388 template parameter or in the function type of the function
9389 template results in an invalid type, type deduction fails. */
9391 tree converted_args;
9394 if (explicit_targs == error_mark_node)
9398 = (coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn),
9399 explicit_targs, NULL_TREE, tf_none,
9400 /*require_all_args=*/false,
9401 /*use_default_args=*/false));
9402 if (converted_args == error_mark_node)
9405 /* Substitute the explicit args into the function type. This is
9406 necessary so that, for instance, explicitly declared function
9407 arguments can match null pointed constants. If we were given
9408 an incomplete set of explicit args, we must not do semantic
9409 processing during substitution as we could create partial
9411 incomplete = NUM_TMPL_ARGS (explicit_targs) != NUM_TMPL_ARGS (targs);
9412 processing_template_decl += incomplete;
9413 fntype = tsubst (fntype, converted_args, tf_none, NULL_TREE);
9414 processing_template_decl -= incomplete;
9416 if (fntype == error_mark_node)
9419 /* Place the explicitly specified arguments in TARGS. */
9420 for (i = NUM_TMPL_ARGS (converted_args); i--;)
9421 TREE_VEC_ELT (targs, i) = TREE_VEC_ELT (converted_args, i);
9424 parms = TYPE_ARG_TYPES (fntype);
9425 /* Never do unification on the 'this' parameter. */
9426 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn))
9427 parms = TREE_CHAIN (parms);
9431 parms = tree_cons (NULL_TREE, TREE_TYPE (fntype), parms);
9432 args = tree_cons (NULL_TREE, return_type, args);
9435 /* We allow incomplete unification without an error message here
9436 because the standard doesn't seem to explicitly prohibit it. Our
9437 callers must be ready to deal with unification failures in any
9439 result = type_unification_real (DECL_INNERMOST_TEMPLATE_PARMS (fn),
9440 targs, parms, args, /*subr=*/0,
9444 /* All is well so far. Now, check:
9448 When all template arguments have been deduced, all uses of
9449 template parameters in nondeduced contexts are replaced with
9450 the corresponding deduced argument values. If the
9451 substitution results in an invalid type, as described above,
9452 type deduction fails. */
9453 if (tsubst (TREE_TYPE (fn), targs, tf_none, NULL_TREE)
9460 /* Adjust types before performing type deduction, as described in
9461 [temp.deduct.call] and [temp.deduct.conv]. The rules in these two
9462 sections are symmetric. PARM is the type of a function parameter
9463 or the return type of the conversion function. ARG is the type of
9464 the argument passed to the call, or the type of the value
9465 initialized with the result of the conversion function. */
9468 maybe_adjust_types_for_deduction (unification_kind_t strict,
9481 /* Swap PARM and ARG throughout the remainder of this
9482 function; the handling is precisely symmetric since PARM
9483 will initialize ARG rather than vice versa. */
9491 /* There is nothing to do in this case. */
9498 if (TREE_CODE (*parm) != REFERENCE_TYPE)
9500 /* [temp.deduct.call]
9502 If P is not a reference type:
9504 --If A is an array type, the pointer type produced by the
9505 array-to-pointer standard conversion (_conv.array_) is
9506 used in place of A for type deduction; otherwise,
9508 --If A is a function type, the pointer type produced by
9509 the function-to-pointer standard conversion
9510 (_conv.func_) is used in place of A for type deduction;
9513 --If A is a cv-qualified type, the top level
9514 cv-qualifiers of A's type are ignored for type
9516 if (TREE_CODE (*arg) == ARRAY_TYPE)
9517 *arg = build_pointer_type (TREE_TYPE (*arg));
9518 else if (TREE_CODE (*arg) == FUNCTION_TYPE)
9519 *arg = build_pointer_type (*arg);
9521 *arg = TYPE_MAIN_VARIANT (*arg);
9524 /* [temp.deduct.call]
9526 If P is a cv-qualified type, the top level cv-qualifiers
9527 of P's type are ignored for type deduction. If P is a
9528 reference type, the type referred to by P is used for
9530 *parm = TYPE_MAIN_VARIANT (*parm);
9531 if (TREE_CODE (*parm) == REFERENCE_TYPE)
9533 *parm = TREE_TYPE (*parm);
9534 result |= UNIFY_ALLOW_OUTER_MORE_CV_QUAL;
9537 /* DR 322. For conversion deduction, remove a reference type on parm
9538 too (which has been swapped into ARG). */
9539 if (strict == DEDUCE_CONV && TREE_CODE (*arg) == REFERENCE_TYPE)
9540 *arg = TREE_TYPE (*arg);
9545 /* Most parms like fn_type_unification.
9547 If SUBR is 1, we're being called recursively (to unify the
9548 arguments of a function or method parameter of a function
9552 type_unification_real (tree tparms,
9557 unification_kind_t strict,
9562 int ntparms = TREE_VEC_LENGTH (tparms);
9564 int saw_undeduced = 0;
9567 gcc_assert (TREE_CODE (tparms) == TREE_VEC);
9568 gcc_assert (xparms == NULL_TREE || TREE_CODE (xparms) == TREE_LIST);
9569 gcc_assert (!xargs || TREE_CODE (xargs) == TREE_LIST);
9570 gcc_assert (ntparms > 0);
9575 sub_strict = (UNIFY_ALLOW_OUTER_LEVEL | UNIFY_ALLOW_MORE_CV_QUAL
9576 | UNIFY_ALLOW_DERIVED);
9580 sub_strict = UNIFY_ALLOW_LESS_CV_QUAL;
9584 sub_strict = UNIFY_ALLOW_NONE;
9595 while (parms && parms != void_list_node
9596 && args && args != void_list_node)
9598 parm = TREE_VALUE (parms);
9599 parms = TREE_CHAIN (parms);
9600 arg = TREE_VALUE (args);
9601 args = TREE_CHAIN (args);
9603 if (arg == error_mark_node)
9605 if (arg == unknown_type_node)
9606 /* We can't deduce anything from this, but we might get all the
9607 template args from other function args. */
9610 /* Conversions will be performed on a function argument that
9611 corresponds with a function parameter that contains only
9612 non-deducible template parameters and explicitly specified
9613 template parameters. */
9614 if (!uses_template_parms (parm))
9619 type = TREE_TYPE (arg);
9623 if (same_type_p (parm, type))
9625 if (strict != DEDUCE_EXACT
9626 && can_convert_arg (parm, type, TYPE_P (arg) ? NULL_TREE : arg,
9635 gcc_assert (TREE_TYPE (arg) != NULL_TREE);
9636 if (type_unknown_p (arg))
9638 /* [temp.deduct.type] A template-argument can be deduced from
9639 a pointer to function or pointer to member function
9640 argument if the set of overloaded functions does not
9641 contain function templates and at most one of a set of
9642 overloaded functions provides a unique match. */
9644 if (resolve_overloaded_unification
9645 (tparms, targs, parm, arg, strict, sub_strict)
9650 arg = TREE_TYPE (arg);
9651 if (arg == error_mark_node)
9656 int arg_strict = sub_strict;
9659 arg_strict |= maybe_adjust_types_for_deduction (strict, &parm, &arg);
9661 if (unify (tparms, targs, parm, arg, arg_strict))
9666 /* Fail if we've reached the end of the parm list, and more args
9667 are present, and the parm list isn't variadic. */
9668 if (args && args != void_list_node && parms == void_list_node)
9670 /* Fail if parms are left and they don't have default values. */
9671 if (parms && parms != void_list_node
9672 && TREE_PURPOSE (parms) == NULL_TREE)
9676 for (i = 0; i < ntparms; i++)
9677 if (!TREE_VEC_ELT (targs, i))
9679 tree tparm = TREE_VALUE (TREE_VEC_ELT (tparms, i));
9681 /* If this is an undeduced nontype parameter that depends on
9682 a type parameter, try another pass; its type may have been
9683 deduced from a later argument than the one from which
9684 this parameter can be deduced. */
9685 if (TREE_CODE (tparm) == PARM_DECL
9686 && uses_template_parms (TREE_TYPE (tparm))
9687 && !saw_undeduced++)
9696 /* Subroutine of type_unification_real. Args are like the variables at the
9697 call site. ARG is an overloaded function (or template-id); we try
9698 deducing template args from each of the overloads, and if only one
9699 succeeds, we go with that. Modifies TARGS and returns 0 on success. */
9702 resolve_overloaded_unification (tree tparms,
9706 unification_kind_t strict,
9709 tree tempargs = copy_node (targs);
9713 if (TREE_CODE (arg) == ADDR_EXPR)
9715 arg = TREE_OPERAND (arg, 0);
9721 if (TREE_CODE (arg) == COMPONENT_REF)
9722 /* Handle `&x' where `x' is some static or non-static member
9724 arg = TREE_OPERAND (arg, 1);
9726 if (TREE_CODE (arg) == OFFSET_REF)
9727 arg = TREE_OPERAND (arg, 1);
9729 /* Strip baselink information. */
9730 if (BASELINK_P (arg))
9731 arg = BASELINK_FUNCTIONS (arg);
9733 if (TREE_CODE (arg) == TEMPLATE_ID_EXPR)
9735 /* If we got some explicit template args, we need to plug them into
9736 the affected templates before we try to unify, in case the
9737 explicit args will completely resolve the templates in question. */
9739 tree expl_subargs = TREE_OPERAND (arg, 1);
9740 arg = TREE_OPERAND (arg, 0);
9742 for (; arg; arg = OVL_NEXT (arg))
9744 tree fn = OVL_CURRENT (arg);
9747 if (TREE_CODE (fn) != TEMPLATE_DECL)
9750 subargs = get_bindings (fn, DECL_TEMPLATE_RESULT (fn),
9751 expl_subargs, /*check_ret=*/false);
9754 elem = tsubst (TREE_TYPE (fn), subargs, tf_none, NULL_TREE);
9755 good += try_one_overload (tparms, targs, tempargs, parm,
9756 elem, strict, sub_strict, addr_p);
9762 gcc_assert (TREE_CODE (arg) == OVERLOAD
9763 || TREE_CODE (arg) == FUNCTION_DECL);
9765 for (; arg; arg = OVL_NEXT (arg))
9766 good += try_one_overload (tparms, targs, tempargs, parm,
9767 TREE_TYPE (OVL_CURRENT (arg)),
9768 strict, sub_strict, addr_p);
9771 /* [temp.deduct.type] A template-argument can be deduced from a pointer
9772 to function or pointer to member function argument if the set of
9773 overloaded functions does not contain function templates and at most
9774 one of a set of overloaded functions provides a unique match.
9776 So if we found multiple possibilities, we return success but don't
9781 int i = TREE_VEC_LENGTH (targs);
9783 if (TREE_VEC_ELT (tempargs, i))
9784 TREE_VEC_ELT (targs, i) = TREE_VEC_ELT (tempargs, i);
9792 /* Subroutine of resolve_overloaded_unification; does deduction for a single
9793 overload. Fills TARGS with any deduced arguments, or error_mark_node if
9794 different overloads deduce different arguments for a given parm.
9795 ADDR_P is true if the expression for which deduction is being
9796 performed was of the form "& fn" rather than simply "fn".
9798 Returns 1 on success. */
9801 try_one_overload (tree tparms,
9806 unification_kind_t strict,
9814 /* [temp.deduct.type] A template-argument can be deduced from a pointer
9815 to function or pointer to member function argument if the set of
9816 overloaded functions does not contain function templates and at most
9817 one of a set of overloaded functions provides a unique match.
9819 So if this is a template, just return success. */
9821 if (uses_template_parms (arg))
9824 if (TREE_CODE (arg) == METHOD_TYPE)
9825 arg = build_ptrmemfunc_type (build_pointer_type (arg));
9827 arg = build_pointer_type (arg);
9829 sub_strict |= maybe_adjust_types_for_deduction (strict, &parm, &arg);
9831 /* We don't copy orig_targs for this because if we have already deduced
9832 some template args from previous args, unify would complain when we
9833 try to deduce a template parameter for the same argument, even though
9834 there isn't really a conflict. */
9835 nargs = TREE_VEC_LENGTH (targs);
9836 tempargs = make_tree_vec (nargs);
9838 if (unify (tparms, tempargs, parm, arg, sub_strict) != 0)
9841 /* First make sure we didn't deduce anything that conflicts with
9842 explicitly specified args. */
9843 for (i = nargs; i--; )
9845 tree elt = TREE_VEC_ELT (tempargs, i);
9846 tree oldelt = TREE_VEC_ELT (orig_targs, i);
9850 else if (uses_template_parms (elt))
9851 /* Since we're unifying against ourselves, we will fill in
9852 template args used in the function parm list with our own
9853 template parms. Discard them. */
9854 TREE_VEC_ELT (tempargs, i) = NULL_TREE;
9855 else if (oldelt && !template_args_equal (oldelt, elt))
9859 for (i = nargs; i--; )
9861 tree elt = TREE_VEC_ELT (tempargs, i);
9864 TREE_VEC_ELT (targs, i) = elt;
9870 /* PARM is a template class (perhaps with unbound template
9871 parameters). ARG is a fully instantiated type. If ARG can be
9872 bound to PARM, return ARG, otherwise return NULL_TREE. TPARMS and
9873 TARGS are as for unify. */
9876 try_class_unification (tree tparms, tree targs, tree parm, tree arg)
9880 if (!CLASSTYPE_TEMPLATE_INFO (arg)
9881 || (most_general_template (CLASSTYPE_TI_TEMPLATE (arg))
9882 != most_general_template (CLASSTYPE_TI_TEMPLATE (parm))))
9885 /* We need to make a new template argument vector for the call to
9886 unify. If we used TARGS, we'd clutter it up with the result of
9887 the attempted unification, even if this class didn't work out.
9888 We also don't want to commit ourselves to all the unifications
9889 we've already done, since unification is supposed to be done on
9890 an argument-by-argument basis. In other words, consider the
9891 following pathological case:
9893 template <int I, int J, int K>
9896 template <int I, int J>
9897 struct S<I, J, 2> : public S<I, I, I>, S<J, J, J> {};
9899 template <int I, int J, int K>
9900 void f(S<I, J, K>, S<I, I, I>);
9909 Now, by the time we consider the unification involving `s2', we
9910 already know that we must have `f<0, 0, 0>'. But, even though
9911 `S<0, 1, 2>' is derived from `S<0, 0, 0>', the code is invalid
9912 because there are two ways to unify base classes of S<0, 1, 2>
9913 with S<I, I, I>. If we kept the already deduced knowledge, we
9914 would reject the possibility I=1. */
9915 copy_of_targs = make_tree_vec (TREE_VEC_LENGTH (targs));
9917 /* If unification failed, we're done. */
9918 if (unify (tparms, copy_of_targs, CLASSTYPE_TI_ARGS (parm),
9919 CLASSTYPE_TI_ARGS (arg), UNIFY_ALLOW_NONE))
9925 /* Given a template type PARM and a class type ARG, find the unique
9926 base type in ARG that is an instance of PARM. We do not examine
9927 ARG itself; only its base-classes. If there is not exactly one
9928 appropriate base class, return NULL_TREE. PARM may be the type of
9929 a partial specialization, as well as a plain template type. Used
9933 get_template_base (tree tparms, tree targs, tree parm, tree arg)
9935 tree rval = NULL_TREE;
9938 gcc_assert (IS_AGGR_TYPE_CODE (TREE_CODE (arg)));
9940 binfo = TYPE_BINFO (complete_type (arg));
9942 /* The type could not be completed. */
9945 /* Walk in inheritance graph order. The search order is not
9946 important, and this avoids multiple walks of virtual bases. */
9947 for (binfo = TREE_CHAIN (binfo); binfo; binfo = TREE_CHAIN (binfo))
9949 tree r = try_class_unification (tparms, targs, parm, BINFO_TYPE (binfo));
9953 /* If there is more than one satisfactory baseclass, then:
9957 If they yield more than one possible deduced A, the type
9961 if (rval && !same_type_p (r, rval))
9971 /* Returns the level of DECL, which declares a template parameter. */
9974 template_decl_level (tree decl)
9976 switch (TREE_CODE (decl))
9980 return TEMPLATE_TYPE_LEVEL (TREE_TYPE (decl));
9983 return TEMPLATE_PARM_LEVEL (DECL_INITIAL (decl));
9991 /* Decide whether ARG can be unified with PARM, considering only the
9992 cv-qualifiers of each type, given STRICT as documented for unify.
9993 Returns nonzero iff the unification is OK on that basis. */
9996 check_cv_quals_for_unify (int strict, tree arg, tree parm)
9998 int arg_quals = cp_type_quals (arg);
9999 int parm_quals = cp_type_quals (parm);
10001 if (TREE_CODE (parm) == TEMPLATE_TYPE_PARM
10002 && !(strict & UNIFY_ALLOW_OUTER_MORE_CV_QUAL))
10004 /* Although a CVR qualifier is ignored when being applied to a
10005 substituted template parameter ([8.3.2]/1 for example), that
10006 does not apply during deduction [14.8.2.4]/1, (even though
10007 that is not explicitly mentioned, [14.8.2.4]/9 indicates
10008 this). Except when we're allowing additional CV qualifiers
10009 at the outer level [14.8.2.1]/3,1st bullet. */
10010 if ((TREE_CODE (arg) == REFERENCE_TYPE
10011 || TREE_CODE (arg) == FUNCTION_TYPE
10012 || TREE_CODE (arg) == METHOD_TYPE)
10013 && (parm_quals & (TYPE_QUAL_CONST | TYPE_QUAL_VOLATILE)))
10016 if ((!POINTER_TYPE_P (arg) && TREE_CODE (arg) != TEMPLATE_TYPE_PARM)
10017 && (parm_quals & TYPE_QUAL_RESTRICT))
10021 if (!(strict & (UNIFY_ALLOW_MORE_CV_QUAL | UNIFY_ALLOW_OUTER_MORE_CV_QUAL))
10022 && (arg_quals & parm_quals) != parm_quals)
10025 if (!(strict & (UNIFY_ALLOW_LESS_CV_QUAL | UNIFY_ALLOW_OUTER_LESS_CV_QUAL))
10026 && (parm_quals & arg_quals) != arg_quals)
10032 /* Deduce the value of template parameters. TPARMS is the (innermost)
10033 set of template parameters to a template. TARGS is the bindings
10034 for those template parameters, as determined thus far; TARGS may
10035 include template arguments for outer levels of template parameters
10036 as well. PARM is a parameter to a template function, or a
10037 subcomponent of that parameter; ARG is the corresponding argument.
10038 This function attempts to match PARM with ARG in a manner
10039 consistent with the existing assignments in TARGS. If more values
10040 are deduced, then TARGS is updated.
10042 Returns 0 if the type deduction succeeds, 1 otherwise. The
10043 parameter STRICT is a bitwise or of the following flags:
10046 Require an exact match between PARM and ARG.
10047 UNIFY_ALLOW_MORE_CV_QUAL:
10048 Allow the deduced ARG to be more cv-qualified (by qualification
10049 conversion) than ARG.
10050 UNIFY_ALLOW_LESS_CV_QUAL:
10051 Allow the deduced ARG to be less cv-qualified than ARG.
10052 UNIFY_ALLOW_DERIVED:
10053 Allow the deduced ARG to be a template base class of ARG,
10054 or a pointer to a template base class of the type pointed to by
10056 UNIFY_ALLOW_INTEGER:
10057 Allow any integral type to be deduced. See the TEMPLATE_PARM_INDEX
10058 case for more information.
10059 UNIFY_ALLOW_OUTER_LEVEL:
10060 This is the outermost level of a deduction. Used to determine validity
10061 of qualification conversions. A valid qualification conversion must
10062 have const qualified pointers leading up to the inner type which
10063 requires additional CV quals, except at the outer level, where const
10064 is not required [conv.qual]. It would be normal to set this flag in
10065 addition to setting UNIFY_ALLOW_MORE_CV_QUAL.
10066 UNIFY_ALLOW_OUTER_MORE_CV_QUAL:
10067 This is the outermost level of a deduction, and PARM can be more CV
10068 qualified at this point.
10069 UNIFY_ALLOW_OUTER_LESS_CV_QUAL:
10070 This is the outermost level of a deduction, and PARM can be less CV
10071 qualified at this point. */
10074 unify (tree tparms, tree targs, tree parm, tree arg, int strict)
10079 int strict_in = strict;
10081 /* I don't think this will do the right thing with respect to types.
10082 But the only case I've seen it in so far has been array bounds, where
10083 signedness is the only information lost, and I think that will be
10085 while (TREE_CODE (parm) == NOP_EXPR)
10086 parm = TREE_OPERAND (parm, 0);
10088 if (arg == error_mark_node)
10090 if (arg == unknown_type_node)
10091 /* We can't deduce anything from this, but we might get all the
10092 template args from other function args. */
10095 /* If PARM uses template parameters, then we can't bail out here,
10096 even if ARG == PARM, since we won't record unifications for the
10097 template parameters. We might need them if we're trying to
10098 figure out which of two things is more specialized. */
10099 if (arg == parm && !uses_template_parms (parm))
10102 /* Immediately reject some pairs that won't unify because of
10103 cv-qualification mismatches. */
10104 if (TREE_CODE (arg) == TREE_CODE (parm)
10106 /* It is the elements of the array which hold the cv quals of an array
10107 type, and the elements might be template type parms. We'll check
10108 when we recurse. */
10109 && TREE_CODE (arg) != ARRAY_TYPE
10110 /* We check the cv-qualifiers when unifying with template type
10111 parameters below. We want to allow ARG `const T' to unify with
10112 PARM `T' for example, when computing which of two templates
10113 is more specialized, for example. */
10114 && TREE_CODE (arg) != TEMPLATE_TYPE_PARM
10115 && !check_cv_quals_for_unify (strict_in, arg, parm))
10118 if (!(strict & UNIFY_ALLOW_OUTER_LEVEL)
10119 && TYPE_P (parm) && !CP_TYPE_CONST_P (parm))
10120 strict &= ~UNIFY_ALLOW_MORE_CV_QUAL;
10121 strict &= ~UNIFY_ALLOW_OUTER_LEVEL;
10122 strict &= ~UNIFY_ALLOW_DERIVED;
10123 strict &= ~UNIFY_ALLOW_OUTER_MORE_CV_QUAL;
10124 strict &= ~UNIFY_ALLOW_OUTER_LESS_CV_QUAL;
10126 switch (TREE_CODE (parm))
10128 case TYPENAME_TYPE:
10130 case UNBOUND_CLASS_TEMPLATE:
10131 /* In a type which contains a nested-name-specifier, template
10132 argument values cannot be deduced for template parameters used
10133 within the nested-name-specifier. */
10136 case TEMPLATE_TYPE_PARM:
10137 case TEMPLATE_TEMPLATE_PARM:
10138 case BOUND_TEMPLATE_TEMPLATE_PARM:
10139 tparm = TREE_VALUE (TREE_VEC_ELT (tparms, 0));
10141 if (TEMPLATE_TYPE_LEVEL (parm)
10142 != template_decl_level (tparm))
10143 /* The PARM is not one we're trying to unify. Just check
10144 to see if it matches ARG. */
10145 return (TREE_CODE (arg) == TREE_CODE (parm)
10146 && same_type_p (parm, arg)) ? 0 : 1;
10147 idx = TEMPLATE_TYPE_IDX (parm);
10148 targ = TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs), idx);
10149 tparm = TREE_VALUE (TREE_VEC_ELT (tparms, idx));
10151 /* Check for mixed types and values. */
10152 if ((TREE_CODE (parm) == TEMPLATE_TYPE_PARM
10153 && TREE_CODE (tparm) != TYPE_DECL)
10154 || (TREE_CODE (parm) == TEMPLATE_TEMPLATE_PARM
10155 && TREE_CODE (tparm) != TEMPLATE_DECL))
10158 if (TREE_CODE (parm) == BOUND_TEMPLATE_TEMPLATE_PARM)
10160 /* ARG must be constructed from a template class or a template
10161 template parameter. */
10162 if (TREE_CODE (arg) != BOUND_TEMPLATE_TEMPLATE_PARM
10163 && (TREE_CODE (arg) != RECORD_TYPE || !CLASSTYPE_TEMPLATE_INFO (arg)))
10167 tree parmvec = TYPE_TI_ARGS (parm);
10168 tree argvec = INNERMOST_TEMPLATE_ARGS (TYPE_TI_ARGS (arg));
10170 = DECL_INNERMOST_TEMPLATE_PARMS (TYPE_TI_TEMPLATE (arg));
10173 /* The resolution to DR150 makes clear that default
10174 arguments for an N-argument may not be used to bind T
10175 to a template template parameter with fewer than N
10176 parameters. It is not safe to permit the binding of
10177 default arguments as an extension, as that may change
10178 the meaning of a conforming program. Consider:
10180 struct Dense { static const unsigned int dim = 1; };
10182 template <template <typename> class View,
10184 void operator+(float, View<Block> const&);
10186 template <typename Block,
10187 unsigned int Dim = Block::dim>
10188 struct Lvalue_proxy { operator float() const; };
10192 Lvalue_proxy<Dense> p;
10197 Here, if Lvalue_proxy is permitted to bind to View, then
10198 the global operator+ will be used; if they are not, the
10199 Lvalue_proxy will be converted to float. */
10200 if (coerce_template_parms (argtmplvec, parmvec,
10201 TYPE_TI_TEMPLATE (parm),
10203 /*require_all_args=*/true,
10204 /*use_default_args=*/false)
10205 == error_mark_node)
10208 /* Deduce arguments T, i from TT<T> or TT<i>.
10209 We check each element of PARMVEC and ARGVEC individually
10210 rather than the whole TREE_VEC since they can have
10211 different number of elements. */
10213 for (i = 0; i < TREE_VEC_LENGTH (parmvec); ++i)
10215 if (unify (tparms, targs,
10216 TREE_VEC_ELT (parmvec, i),
10217 TREE_VEC_ELT (argvec, i),
10222 arg = TYPE_TI_TEMPLATE (arg);
10224 /* Fall through to deduce template name. */
10227 if (TREE_CODE (parm) == TEMPLATE_TEMPLATE_PARM
10228 || TREE_CODE (parm) == BOUND_TEMPLATE_TEMPLATE_PARM)
10230 /* Deduce template name TT from TT, TT<>, TT<T> and TT<i>. */
10232 /* Simple cases: Value already set, does match or doesn't. */
10233 if (targ != NULL_TREE && template_args_equal (targ, arg))
10240 /* If PARM is `const T' and ARG is only `int', we don't have
10241 a match unless we are allowing additional qualification.
10242 If ARG is `const int' and PARM is just `T' that's OK;
10243 that binds `const int' to `T'. */
10244 if (!check_cv_quals_for_unify (strict_in | UNIFY_ALLOW_LESS_CV_QUAL,
10248 /* Consider the case where ARG is `const volatile int' and
10249 PARM is `const T'. Then, T should be `volatile int'. */
10250 arg = cp_build_qualified_type_real
10251 (arg, cp_type_quals (arg) & ~cp_type_quals (parm), tf_none);
10252 if (arg == error_mark_node)
10255 /* Simple cases: Value already set, does match or doesn't. */
10256 if (targ != NULL_TREE && same_type_p (targ, arg))
10261 /* Make sure that ARG is not a variable-sized array. (Note
10262 that were talking about variable-sized arrays (like
10263 `int[n]'), rather than arrays of unknown size (like
10264 `int[]').) We'll get very confused by such a type since
10265 the bound of the array will not be computable in an
10266 instantiation. Besides, such types are not allowed in
10267 ISO C++, so we can do as we please here. */
10268 if (variably_modified_type_p (arg, NULL_TREE))
10272 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs), idx) = arg;
10275 case TEMPLATE_PARM_INDEX:
10276 tparm = TREE_VALUE (TREE_VEC_ELT (tparms, 0));
10278 if (TEMPLATE_PARM_LEVEL (parm)
10279 != template_decl_level (tparm))
10280 /* The PARM is not one we're trying to unify. Just check
10281 to see if it matches ARG. */
10282 return !(TREE_CODE (arg) == TREE_CODE (parm)
10283 && cp_tree_equal (parm, arg));
10285 idx = TEMPLATE_PARM_IDX (parm);
10286 targ = TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs), idx);
10289 return !cp_tree_equal (targ, arg);
10291 /* [temp.deduct.type] If, in the declaration of a function template
10292 with a non-type template-parameter, the non-type
10293 template-parameter is used in an expression in the function
10294 parameter-list and, if the corresponding template-argument is
10295 deduced, the template-argument type shall match the type of the
10296 template-parameter exactly, except that a template-argument
10297 deduced from an array bound may be of any integral type.
10298 The non-type parameter might use already deduced type parameters. */
10299 tparm = tsubst (TREE_TYPE (parm), targs, 0, NULL_TREE);
10300 if (!TREE_TYPE (arg))
10301 /* Template-parameter dependent expression. Just accept it for now.
10302 It will later be processed in convert_template_argument. */
10304 else if (same_type_p (TREE_TYPE (arg), tparm))
10306 else if ((strict & UNIFY_ALLOW_INTEGER)
10307 && (TREE_CODE (tparm) == INTEGER_TYPE
10308 || TREE_CODE (tparm) == BOOLEAN_TYPE))
10309 /* Convert the ARG to the type of PARM; the deduced non-type
10310 template argument must exactly match the types of the
10311 corresponding parameter. */
10312 arg = fold (build_nop (TREE_TYPE (parm), arg));
10313 else if (uses_template_parms (tparm))
10314 /* We haven't deduced the type of this parameter yet. Try again
10320 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs), idx) = arg;
10325 /* A pointer-to-member constant can be unified only with
10326 another constant. */
10327 if (TREE_CODE (arg) != PTRMEM_CST)
10330 /* Just unify the class member. It would be useless (and possibly
10331 wrong, depending on the strict flags) to unify also
10332 PTRMEM_CST_CLASS, because we want to be sure that both parm and
10333 arg refer to the same variable, even if through different
10334 classes. For instance:
10336 struct A { int x; };
10339 Unification of &A::x and &B::x must succeed. */
10340 return unify (tparms, targs, PTRMEM_CST_MEMBER (parm),
10341 PTRMEM_CST_MEMBER (arg), strict);
10346 if (TREE_CODE (arg) != POINTER_TYPE)
10349 /* [temp.deduct.call]
10351 A can be another pointer or pointer to member type that can
10352 be converted to the deduced A via a qualification
10353 conversion (_conv.qual_).
10355 We pass down STRICT here rather than UNIFY_ALLOW_NONE.
10356 This will allow for additional cv-qualification of the
10357 pointed-to types if appropriate. */
10359 if (TREE_CODE (TREE_TYPE (arg)) == RECORD_TYPE)
10360 /* The derived-to-base conversion only persists through one
10361 level of pointers. */
10362 strict |= (strict_in & UNIFY_ALLOW_DERIVED);
10364 return unify (tparms, targs, TREE_TYPE (parm),
10365 TREE_TYPE (arg), strict);
10368 case REFERENCE_TYPE:
10369 if (TREE_CODE (arg) != REFERENCE_TYPE)
10371 return unify (tparms, targs, TREE_TYPE (parm), TREE_TYPE (arg),
10372 strict & UNIFY_ALLOW_MORE_CV_QUAL);
10375 if (TREE_CODE (arg) != ARRAY_TYPE)
10377 if ((TYPE_DOMAIN (parm) == NULL_TREE)
10378 != (TYPE_DOMAIN (arg) == NULL_TREE))
10380 if (TYPE_DOMAIN (parm) != NULL_TREE)
10385 parm_max = TYPE_MAX_VALUE (TYPE_DOMAIN (parm));
10386 arg_max = TYPE_MAX_VALUE (TYPE_DOMAIN (arg));
10388 /* Our representation of array types uses "N - 1" as the
10389 TYPE_MAX_VALUE for an array with "N" elements, if "N" is
10390 not an integer constant. */
10391 if (TREE_CODE (parm_max) == MINUS_EXPR)
10393 arg_max = fold_build2 (PLUS_EXPR,
10396 TREE_OPERAND (parm_max, 1));
10397 parm_max = TREE_OPERAND (parm_max, 0);
10400 if (unify (tparms, targs, parm_max, arg_max, UNIFY_ALLOW_INTEGER))
10403 return unify (tparms, targs, TREE_TYPE (parm), TREE_TYPE (arg),
10404 strict & UNIFY_ALLOW_MORE_CV_QUAL);
10411 case ENUMERAL_TYPE:
10413 if (TREE_CODE (arg) != TREE_CODE (parm))
10416 /* We have already checked cv-qualification at the top of the
10418 if (!same_type_ignoring_top_level_qualifiers_p (arg, parm))
10421 /* As far as unification is concerned, this wins. Later checks
10422 will invalidate it if necessary. */
10425 /* Types INTEGER_CST and MINUS_EXPR can come from array bounds. */
10426 /* Type INTEGER_CST can come from ordinary constant template args. */
10428 while (TREE_CODE (arg) == NOP_EXPR)
10429 arg = TREE_OPERAND (arg, 0);
10431 if (TREE_CODE (arg) != INTEGER_CST)
10433 return !tree_int_cst_equal (parm, arg);
10438 if (TREE_CODE (arg) != TREE_VEC)
10440 if (TREE_VEC_LENGTH (parm) != TREE_VEC_LENGTH (arg))
10442 for (i = 0; i < TREE_VEC_LENGTH (parm); ++i)
10443 if (unify (tparms, targs,
10444 TREE_VEC_ELT (parm, i), TREE_VEC_ELT (arg, i),
10452 if (TREE_CODE (arg) != TREE_CODE (parm))
10455 if (TYPE_PTRMEMFUNC_P (parm))
10457 if (!TYPE_PTRMEMFUNC_P (arg))
10460 return unify (tparms, targs,
10461 TYPE_PTRMEMFUNC_FN_TYPE (parm),
10462 TYPE_PTRMEMFUNC_FN_TYPE (arg),
10466 if (CLASSTYPE_TEMPLATE_INFO (parm))
10468 tree t = NULL_TREE;
10470 if (strict_in & UNIFY_ALLOW_DERIVED)
10472 /* First, we try to unify the PARM and ARG directly. */
10473 t = try_class_unification (tparms, targs,
10478 /* Fallback to the special case allowed in
10479 [temp.deduct.call]:
10481 If P is a class, and P has the form
10482 template-id, then A can be a derived class of
10483 the deduced A. Likewise, if P is a pointer to
10484 a class of the form template-id, A can be a
10485 pointer to a derived class pointed to by the
10487 t = get_template_base (tparms, targs, parm, arg);
10493 else if (CLASSTYPE_TEMPLATE_INFO (arg)
10494 && (CLASSTYPE_TI_TEMPLATE (parm)
10495 == CLASSTYPE_TI_TEMPLATE (arg)))
10496 /* Perhaps PARM is something like S<U> and ARG is S<int>.
10497 Then, we should unify `int' and `U'. */
10500 /* There's no chance of unification succeeding. */
10503 return unify (tparms, targs, CLASSTYPE_TI_ARGS (parm),
10504 CLASSTYPE_TI_ARGS (t), UNIFY_ALLOW_NONE);
10506 else if (!same_type_ignoring_top_level_qualifiers_p (parm, arg))
10511 case FUNCTION_TYPE:
10512 if (TREE_CODE (arg) != TREE_CODE (parm))
10515 /* CV qualifications for methods can never be deduced, they must
10516 match exactly. We need to check them explicitly here,
10517 because type_unification_real treats them as any other
10518 cvqualified parameter. */
10519 if (TREE_CODE (parm) == METHOD_TYPE
10520 && (!check_cv_quals_for_unify
10522 TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (arg))),
10523 TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (parm))))))
10526 if (unify (tparms, targs, TREE_TYPE (parm),
10527 TREE_TYPE (arg), UNIFY_ALLOW_NONE))
10529 return type_unification_real (tparms, targs, TYPE_ARG_TYPES (parm),
10530 TYPE_ARG_TYPES (arg), 1, DEDUCE_EXACT,
10534 /* Unify a pointer to member with a pointer to member function, which
10535 deduces the type of the member as a function type. */
10536 if (TYPE_PTRMEMFUNC_P (arg))
10540 cp_cv_quals cv_quals;
10542 /* Check top-level cv qualifiers */
10543 if (!check_cv_quals_for_unify (UNIFY_ALLOW_NONE, arg, parm))
10546 if (unify (tparms, targs, TYPE_OFFSET_BASETYPE (parm),
10547 TYPE_PTRMEMFUNC_OBJECT_TYPE (arg), UNIFY_ALLOW_NONE))
10550 /* Determine the type of the function we are unifying against. */
10551 method_type = TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (arg));
10553 build_function_type (TREE_TYPE (method_type),
10554 TREE_CHAIN (TYPE_ARG_TYPES (method_type)));
10556 /* Extract the cv-qualifiers of the member function from the
10557 implicit object parameter and place them on the function
10558 type to be restored later. */
10560 cp_type_quals(TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (method_type))));
10561 fntype = build_qualified_type (fntype, cv_quals);
10562 return unify (tparms, targs, TREE_TYPE (parm), fntype, strict);
10565 if (TREE_CODE (arg) != OFFSET_TYPE)
10567 if (unify (tparms, targs, TYPE_OFFSET_BASETYPE (parm),
10568 TYPE_OFFSET_BASETYPE (arg), UNIFY_ALLOW_NONE))
10570 return unify (tparms, targs, TREE_TYPE (parm), TREE_TYPE (arg),
10574 if (DECL_TEMPLATE_PARM_P (parm))
10575 return unify (tparms, targs, DECL_INITIAL (parm), arg, strict);
10576 if (arg != integral_constant_value (parm))
10581 case TEMPLATE_DECL:
10582 /* Matched cases are handled by the ARG == PARM test above. */
10586 gcc_assert (EXPR_P (parm));
10588 /* We must be looking at an expression. This can happen with
10592 void foo(S<I>, S<I + 2>);
10594 This is a "nondeduced context":
10598 The nondeduced contexts are:
10600 --A type that is a template-id in which one or more of
10601 the template-arguments is an expression that references
10602 a template-parameter.
10604 In these cases, we assume deduction succeeded, but don't
10605 actually infer any unifications. */
10607 if (!uses_template_parms (parm)
10608 && !template_args_equal (parm, arg))
10615 /* Note that DECL can be defined in this translation unit, if
10619 mark_definable (tree decl)
10622 DECL_NOT_REALLY_EXTERN (decl) = 1;
10623 FOR_EACH_CLONE (clone, decl)
10624 DECL_NOT_REALLY_EXTERN (clone) = 1;
10627 /* Called if RESULT is explicitly instantiated, or is a member of an
10628 explicitly instantiated class. */
10631 mark_decl_instantiated (tree result, int extern_p)
10633 SET_DECL_EXPLICIT_INSTANTIATION (result);
10635 /* If this entity has already been written out, it's too late to
10636 make any modifications. */
10637 if (TREE_ASM_WRITTEN (result))
10640 if (TREE_CODE (result) != FUNCTION_DECL)
10641 /* The TREE_PUBLIC flag for function declarations will have been
10642 set correctly by tsubst. */
10643 TREE_PUBLIC (result) = 1;
10645 /* This might have been set by an earlier implicit instantiation. */
10646 DECL_COMDAT (result) = 0;
10649 DECL_NOT_REALLY_EXTERN (result) = 0;
10652 mark_definable (result);
10653 /* Always make artificials weak. */
10654 if (DECL_ARTIFICIAL (result) && flag_weak)
10655 comdat_linkage (result);
10656 /* For WIN32 we also want to put explicit instantiations in
10657 linkonce sections. */
10658 else if (TREE_PUBLIC (result))
10659 maybe_make_one_only (result);
10662 /* If EXTERN_P, then this function will not be emitted -- unless
10663 followed by an explicit instantiation, at which point its linkage
10664 will be adjusted. If !EXTERN_P, then this function will be
10665 emitted here. In neither circumstance do we want
10666 import_export_decl to adjust the linkage. */
10667 DECL_INTERFACE_KNOWN (result) = 1;
10670 /* Given two function templates PAT1 and PAT2, return:
10672 1 if PAT1 is more specialized than PAT2 as described in [temp.func.order].
10673 -1 if PAT2 is more specialized than PAT1.
10674 0 if neither is more specialized.
10676 LEN indicates the number of parameters we should consider
10677 (defaulted parameters should not be considered).
10679 The 1998 std underspecified function template partial ordering, and
10680 DR214 addresses the issue. We take pairs of arguments, one from
10681 each of the templates, and deduce them against each other. One of
10682 the templates will be more specialized if all the *other*
10683 template's arguments deduce against its arguments and at least one
10684 of its arguments *does* *not* deduce against the other template's
10685 corresponding argument. Deduction is done as for class templates.
10686 The arguments used in deduction have reference and top level cv
10687 qualifiers removed. Iff both arguments were originally reference
10688 types *and* deduction succeeds in both directions, the template
10689 with the more cv-qualified argument wins for that pairing (if
10690 neither is more cv-qualified, they both are equal). Unlike regular
10691 deduction, after all the arguments have been deduced in this way,
10692 we do *not* verify the deduced template argument values can be
10693 substituted into non-deduced contexts, nor do we have to verify
10694 that all template arguments have been deduced. */
10697 more_specialized_fn (tree pat1, tree pat2, int len)
10699 tree decl1 = DECL_TEMPLATE_RESULT (pat1);
10700 tree decl2 = DECL_TEMPLATE_RESULT (pat2);
10701 tree targs1 = make_tree_vec (DECL_NTPARMS (pat1));
10702 tree targs2 = make_tree_vec (DECL_NTPARMS (pat2));
10703 tree tparms1 = DECL_INNERMOST_TEMPLATE_PARMS (pat1);
10704 tree tparms2 = DECL_INNERMOST_TEMPLATE_PARMS (pat2);
10705 tree args1 = TYPE_ARG_TYPES (TREE_TYPE (decl1));
10706 tree args2 = TYPE_ARG_TYPES (TREE_TYPE (decl2));
10710 /* Remove the this parameter from non-static member functions. If
10711 one is a non-static member function and the other is not a static
10712 member function, remove the first parameter from that function
10713 also. This situation occurs for operator functions where we
10714 locate both a member function (with this pointer) and non-member
10715 operator (with explicit first operand). */
10716 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl1))
10718 len--; /* LEN is the number of significant arguments for DECL1 */
10719 args1 = TREE_CHAIN (args1);
10720 if (!DECL_STATIC_FUNCTION_P (decl2))
10721 args2 = TREE_CHAIN (args2);
10723 else if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl2))
10725 args2 = TREE_CHAIN (args2);
10726 if (!DECL_STATIC_FUNCTION_P (decl1))
10729 args1 = TREE_CHAIN (args1);
10733 /* If only one is a conversion operator, they are unordered. */
10734 if (DECL_CONV_FN_P (decl1) != DECL_CONV_FN_P (decl2))
10737 /* Consider the return type for a conversion function */
10738 if (DECL_CONV_FN_P (decl1))
10740 args1 = tree_cons (NULL_TREE, TREE_TYPE (TREE_TYPE (decl1)), args1);
10741 args2 = tree_cons (NULL_TREE, TREE_TYPE (TREE_TYPE (decl2)), args2);
10745 processing_template_decl++;
10749 tree arg1 = TREE_VALUE (args1);
10750 tree arg2 = TREE_VALUE (args2);
10751 int deduce1, deduce2;
10755 if (TREE_CODE (arg1) == REFERENCE_TYPE)
10757 arg1 = TREE_TYPE (arg1);
10758 quals1 = cp_type_quals (arg1);
10761 if (TREE_CODE (arg2) == REFERENCE_TYPE)
10763 arg2 = TREE_TYPE (arg2);
10764 quals2 = cp_type_quals (arg2);
10767 if ((quals1 < 0) != (quals2 < 0))
10769 /* Only of the args is a reference, see if we should apply
10770 array/function pointer decay to it. This is not part of
10771 DR214, but is, IMHO, consistent with the deduction rules
10772 for the function call itself, and with our earlier
10773 implementation of the underspecified partial ordering
10774 rules. (nathan). */
10777 switch (TREE_CODE (arg1))
10780 arg1 = TREE_TYPE (arg1);
10782 case FUNCTION_TYPE:
10783 arg1 = build_pointer_type (arg1);
10792 switch (TREE_CODE (arg2))
10795 arg2 = TREE_TYPE (arg2);
10797 case FUNCTION_TYPE:
10798 arg2 = build_pointer_type (arg2);
10807 arg1 = TYPE_MAIN_VARIANT (arg1);
10808 arg2 = TYPE_MAIN_VARIANT (arg2);
10810 deduce1 = !unify (tparms1, targs1, arg1, arg2, UNIFY_ALLOW_NONE);
10811 deduce2 = !unify (tparms2, targs2, arg2, arg1, UNIFY_ALLOW_NONE);
10817 if (better1 < 0 && better2 < 0)
10818 /* We've failed to deduce something in either direction.
10819 These must be unordered. */
10822 if (deduce1 && deduce2 && quals1 >= 0 && quals2 >= 0)
10824 /* Deduces in both directions, see if quals can
10825 disambiguate. Pretend the worse one failed to deduce. */
10826 if ((quals1 & quals2) == quals2)
10828 if ((quals1 & quals2) == quals1)
10831 if (deduce1 && !deduce2 && !better2)
10833 if (deduce2 && !deduce1 && !better1)
10836 args1 = TREE_CHAIN (args1);
10837 args2 = TREE_CHAIN (args2);
10840 processing_template_decl--;
10842 return (better1 > 0) - (better2 > 0);
10845 /* Determine which of two partial specializations is more specialized.
10847 PAT1 is a TREE_LIST whose TREE_TYPE is the _TYPE node corresponding
10848 to the first partial specialization. The TREE_VALUE is the
10849 innermost set of template parameters for the partial
10850 specialization. PAT2 is similar, but for the second template.
10852 Return 1 if the first partial specialization is more specialized;
10853 -1 if the second is more specialized; 0 if neither is more
10856 See [temp.class.order] for information about determining which of
10857 two templates is more specialized. */
10860 more_specialized_class (tree pat1, tree pat2)
10866 tmpl1 = TREE_TYPE (pat1);
10867 tmpl2 = TREE_TYPE (pat2);
10869 /* Just like what happens for functions, if we are ordering between
10870 different class template specializations, we may encounter dependent
10871 types in the arguments, and we need our dependency check functions
10872 to behave correctly. */
10873 ++processing_template_decl;
10874 targs = get_class_bindings (TREE_VALUE (pat1),
10875 CLASSTYPE_TI_ARGS (tmpl1),
10876 CLASSTYPE_TI_ARGS (tmpl2));
10880 targs = get_class_bindings (TREE_VALUE (pat2),
10881 CLASSTYPE_TI_ARGS (tmpl2),
10882 CLASSTYPE_TI_ARGS (tmpl1));
10885 --processing_template_decl;
10890 /* Return the template arguments that will produce the function signature
10891 DECL from the function template FN, with the explicit template
10892 arguments EXPLICIT_ARGS. If CHECK_RETTYPE is true, the return type must
10893 also match. Return NULL_TREE if no satisfactory arguments could be
10897 get_bindings (tree fn, tree decl, tree explicit_args, bool check_rettype)
10899 int ntparms = DECL_NTPARMS (fn);
10900 tree targs = make_tree_vec (ntparms);
10902 tree decl_arg_types;
10904 /* Substitute the explicit template arguments into the type of DECL.
10905 The call to fn_type_unification will handle substitution into the
10907 decl_type = TREE_TYPE (decl);
10908 if (explicit_args && uses_template_parms (decl_type))
10911 tree converted_args;
10913 if (DECL_TEMPLATE_INFO (decl))
10914 tmpl = DECL_TI_TEMPLATE (decl);
10916 /* We can get here for some invalid specializations. */
10920 = coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl),
10921 explicit_args, NULL_TREE,
10923 /*require_all_args=*/false,
10924 /*use_default_args=*/false);
10925 if (converted_args == error_mark_node)
10928 decl_type = tsubst (decl_type, converted_args, tf_none, NULL_TREE);
10929 if (decl_type == error_mark_node)
10933 decl_arg_types = TYPE_ARG_TYPES (decl_type);
10934 /* Never do unification on the 'this' parameter. */
10935 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl))
10936 decl_arg_types = TREE_CHAIN (decl_arg_types);
10938 if (fn_type_unification (fn, explicit_args, targs,
10940 (check_rettype || DECL_CONV_FN_P (fn)
10941 ? TREE_TYPE (decl_type) : NULL_TREE),
10942 DEDUCE_EXACT, LOOKUP_NORMAL))
10948 /* Return the innermost template arguments that, when applied to a
10949 template specialization whose innermost template parameters are
10950 TPARMS, and whose specialization arguments are PARMS, yield the
10953 For example, suppose we have:
10955 template <class T, class U> struct S {};
10956 template <class T> struct S<T*, int> {};
10958 Then, suppose we want to get `S<double*, int>'. The TPARMS will be
10959 {T}, the SPEC_ARGS will be {T*, int} and the ARGS will be {double*,
10960 int}. The resulting vector will be {double}, indicating that `T'
10961 is bound to `double'. */
10964 get_class_bindings (tree tparms, tree spec_args, tree args)
10966 int i, ntparms = TREE_VEC_LENGTH (tparms);
10968 tree innermost_deduced_args;
10970 innermost_deduced_args = make_tree_vec (ntparms);
10971 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args))
10973 deduced_args = copy_node (args);
10974 SET_TMPL_ARGS_LEVEL (deduced_args,
10975 TMPL_ARGS_DEPTH (deduced_args),
10976 innermost_deduced_args);
10979 deduced_args = innermost_deduced_args;
10981 if (unify (tparms, deduced_args,
10982 INNERMOST_TEMPLATE_ARGS (spec_args),
10983 INNERMOST_TEMPLATE_ARGS (args),
10987 for (i = 0; i < ntparms; ++i)
10988 if (! TREE_VEC_ELT (innermost_deduced_args, i))
10991 /* Verify that nondeduced template arguments agree with the type
10992 obtained from argument deduction.
10996 struct A { typedef int X; };
10997 template <class T, class U> struct C {};
10998 template <class T> struct C<T, typename T::X> {};
11000 Then with the instantiation `C<A, int>', we can deduce that
11001 `T' is `A' but unify () does not check whether `typename T::X'
11003 spec_args = tsubst (spec_args, deduced_args, tf_none, NULL_TREE);
11004 if (spec_args == error_mark_node
11005 /* We only need to check the innermost arguments; the other
11006 arguments will always agree. */
11007 || !comp_template_args (INNERMOST_TEMPLATE_ARGS (spec_args),
11008 INNERMOST_TEMPLATE_ARGS (args)))
11011 return deduced_args;
11014 /* TEMPLATES is a TREE_LIST. Each TREE_VALUE is a TEMPLATE_DECL.
11015 Return the TREE_LIST node with the most specialized template, if
11016 any. If there is no most specialized template, the error_mark_node
11019 Note that this function does not look at, or modify, the
11020 TREE_PURPOSE or TREE_TYPE of any of the nodes. Since the node
11021 returned is one of the elements of INSTANTIATIONS, callers may
11022 store information in the TREE_PURPOSE or TREE_TYPE of the nodes,
11023 and retrieve it from the value returned. */
11026 most_specialized_instantiation (tree templates)
11030 ++processing_template_decl;
11033 for (fn = TREE_CHAIN (templates); fn; fn = TREE_CHAIN (fn))
11037 if (get_bindings (TREE_VALUE (champ),
11038 DECL_TEMPLATE_RESULT (TREE_VALUE (fn)),
11039 NULL_TREE, /*check_ret=*/false))
11042 if (get_bindings (TREE_VALUE (fn),
11043 DECL_TEMPLATE_RESULT (TREE_VALUE (champ)),
11044 NULL_TREE, /*check_ret=*/false))
11051 /* Equally specialized, move to next function. If there
11052 is no next function, nothing's most specialized. */
11053 fn = TREE_CHAIN (fn);
11061 /* Now verify that champ is better than everything earlier in the
11062 instantiation list. */
11063 for (fn = templates; fn != champ; fn = TREE_CHAIN (fn))
11064 if (get_bindings (TREE_VALUE (champ),
11065 DECL_TEMPLATE_RESULT (TREE_VALUE (fn)),
11066 NULL_TREE, /*check_ret=*/false)
11067 || !get_bindings (TREE_VALUE (fn),
11068 DECL_TEMPLATE_RESULT (TREE_VALUE (champ)),
11069 NULL_TREE, /*check_ret=*/false))
11075 processing_template_decl--;
11078 return error_mark_node;
11083 /* If DECL is a specialization of some template, return the most
11084 general such template. Otherwise, returns NULL_TREE.
11086 For example, given:
11088 template <class T> struct S { template <class U> void f(U); };
11090 if TMPL is `template <class U> void S<int>::f(U)' this will return
11091 the full template. This function will not trace past partial
11092 specializations, however. For example, given in addition:
11094 template <class T> struct S<T*> { template <class U> void f(U); };
11096 if TMPL is `template <class U> void S<int*>::f(U)' this will return
11097 `template <class T> template <class U> S<T*>::f(U)'. */
11100 most_general_template (tree decl)
11102 /* If DECL is a FUNCTION_DECL, find the TEMPLATE_DECL of which it is
11103 an immediate specialization. */
11104 if (TREE_CODE (decl) == FUNCTION_DECL)
11106 if (DECL_TEMPLATE_INFO (decl)) {
11107 decl = DECL_TI_TEMPLATE (decl);
11109 /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE for a
11110 template friend. */
11111 if (TREE_CODE (decl) != TEMPLATE_DECL)
11117 /* Look for more and more general templates. */
11118 while (DECL_TEMPLATE_INFO (decl))
11120 /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE in some cases.
11121 (See cp-tree.h for details.) */
11122 if (TREE_CODE (DECL_TI_TEMPLATE (decl)) != TEMPLATE_DECL)
11125 if (CLASS_TYPE_P (TREE_TYPE (decl))
11126 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl)))
11129 /* Stop if we run into an explicitly specialized class template. */
11130 if (!DECL_NAMESPACE_SCOPE_P (decl)
11131 && DECL_CONTEXT (decl)
11132 && CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (decl)))
11135 decl = DECL_TI_TEMPLATE (decl);
11141 /* Return the most specialized of the class template partial
11142 specializations of TMPL which can produce TYPE, a specialization of
11143 TMPL. The value returned is actually a TREE_LIST; the TREE_TYPE is
11144 a _TYPE node corresponding to the partial specialization, while the
11145 TREE_PURPOSE is the set of template arguments that must be
11146 substituted into the TREE_TYPE in order to generate TYPE.
11148 If the choice of partial specialization is ambiguous, a diagnostic
11149 is issued, and the error_mark_node is returned. If there are no
11150 partial specializations of TMPL matching TYPE, then NULL_TREE is
11154 most_specialized_class (tree type, tree tmpl)
11156 tree list = NULL_TREE;
11163 tmpl = most_general_template (tmpl);
11164 args = CLASSTYPE_TI_ARGS (type);
11165 for (t = DECL_TEMPLATE_SPECIALIZATIONS (tmpl); t; t = TREE_CHAIN (t))
11167 tree partial_spec_args;
11170 partial_spec_args = CLASSTYPE_TI_ARGS (TREE_TYPE (t));
11171 spec_args = get_class_bindings (TREE_VALUE (t),
11176 list = tree_cons (spec_args, TREE_VALUE (t), list);
11177 TREE_TYPE (list) = TREE_TYPE (t);
11184 ambiguous_p = false;
11187 t = TREE_CHAIN (t);
11188 for (; t; t = TREE_CHAIN (t))
11190 fate = more_specialized_class (champ, t);
11197 t = TREE_CHAIN (t);
11200 ambiguous_p = true;
11209 for (t = list; t && t != champ; t = TREE_CHAIN (t))
11211 fate = more_specialized_class (champ, t);
11214 ambiguous_p = true;
11221 const char *str = "candidates are:";
11222 error ("ambiguous class template instantiation for %q#T", type);
11223 for (t = list; t; t = TREE_CHAIN (t))
11225 error ("%s %+#T", str, TREE_TYPE (t));
11228 return error_mark_node;
11234 /* Explicitly instantiate DECL. */
11237 do_decl_instantiation (tree decl, tree storage)
11239 tree result = NULL_TREE;
11242 if (!decl || decl == error_mark_node)
11243 /* An error occurred, for which grokdeclarator has already issued
11244 an appropriate message. */
11246 else if (! DECL_LANG_SPECIFIC (decl))
11248 error ("explicit instantiation of non-template %q#D", decl);
11251 else if (TREE_CODE (decl) == VAR_DECL)
11253 /* There is an asymmetry here in the way VAR_DECLs and
11254 FUNCTION_DECLs are handled by grokdeclarator. In the case of
11255 the latter, the DECL we get back will be marked as a
11256 template instantiation, and the appropriate
11257 DECL_TEMPLATE_INFO will be set up. This does not happen for
11258 VAR_DECLs so we do the lookup here. Probably, grokdeclarator
11259 should handle VAR_DECLs as it currently handles
11261 result = lookup_field (DECL_CONTEXT (decl), DECL_NAME (decl), 0, false);
11262 if (!result || TREE_CODE (result) != VAR_DECL)
11264 error ("no matching template for %qD found", decl);
11268 else if (TREE_CODE (decl) != FUNCTION_DECL)
11270 error ("explicit instantiation of %q#D", decl);
11276 /* Check for various error cases. Note that if the explicit
11277 instantiation is valid the RESULT will currently be marked as an
11278 *implicit* instantiation; DECL_EXPLICIT_INSTANTIATION is not set
11279 until we get here. */
11281 if (DECL_TEMPLATE_SPECIALIZATION (result))
11283 /* DR 259 [temp.spec].
11285 Both an explicit instantiation and a declaration of an explicit
11286 specialization shall not appear in a program unless the explicit
11287 instantiation follows a declaration of the explicit specialization.
11289 For a given set of template parameters, if an explicit
11290 instantiation of a template appears after a declaration of an
11291 explicit specialization for that template, the explicit
11292 instantiation has no effect. */
11295 else if (DECL_EXPLICIT_INSTANTIATION (result))
11299 No program shall explicitly instantiate any template more
11302 We check DECL_NOT_REALLY_EXTERN so as not to complain when
11303 the first instantiation was `extern' and the second is not,
11304 and EXTERN_P for the opposite case. */
11305 if (DECL_NOT_REALLY_EXTERN (result) && !extern_p)
11306 pedwarn ("duplicate explicit instantiation of %q#D", result);
11307 /* If an "extern" explicit instantiation follows an ordinary
11308 explicit instantiation, the template is instantiated. */
11312 else if (!DECL_IMPLICIT_INSTANTIATION (result))
11314 error ("no matching template for %qD found", result);
11317 else if (!DECL_TEMPLATE_INFO (result))
11319 pedwarn ("explicit instantiation of non-template %q#D", result);
11323 if (storage == NULL_TREE)
11325 else if (storage == ridpointers[(int) RID_EXTERN])
11327 if (pedantic && !in_system_header)
11328 pedwarn ("ISO C++ forbids the use of %<extern%> on explicit "
11333 error ("storage class %qD applied to template instantiation", storage);
11335 check_explicit_instantiation_namespace (result);
11336 mark_decl_instantiated (result, extern_p);
11338 instantiate_decl (result, /*defer_ok=*/1,
11339 /*expl_inst_class_mem_p=*/false);
11343 mark_class_instantiated (tree t, int extern_p)
11345 SET_CLASSTYPE_EXPLICIT_INSTANTIATION (t);
11346 SET_CLASSTYPE_INTERFACE_KNOWN (t);
11347 CLASSTYPE_INTERFACE_ONLY (t) = extern_p;
11348 TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (t)) = extern_p;
11351 CLASSTYPE_DEBUG_REQUESTED (t) = 1;
11352 rest_of_type_compilation (t, 1);
11356 /* Called from do_type_instantiation through binding_table_foreach to
11357 do recursive instantiation for the type bound in ENTRY. */
11359 bt_instantiate_type_proc (binding_entry entry, void *data)
11361 tree storage = *(tree *) data;
11363 if (IS_AGGR_TYPE (entry->type)
11364 && !uses_template_parms (CLASSTYPE_TI_ARGS (entry->type)))
11365 do_type_instantiation (TYPE_MAIN_DECL (entry->type), storage, 0);
11368 /* Called from do_type_instantiation to instantiate a member
11369 (a member function or a static member variable) of an
11370 explicitly instantiated class template. */
11372 instantiate_class_member (tree decl, int extern_p)
11374 mark_decl_instantiated (decl, extern_p);
11376 instantiate_decl (decl, /*defer_ok=*/1,
11377 /*expl_inst_class_mem_p=*/true);
11380 /* Perform an explicit instantiation of template class T. STORAGE, if
11381 non-null, is the RID for extern, inline or static. COMPLAIN is
11382 nonzero if this is called from the parser, zero if called recursively,
11383 since the standard is unclear (as detailed below). */
11386 do_type_instantiation (tree t, tree storage, tsubst_flags_t complain)
11391 int previous_instantiation_extern_p = 0;
11393 if (TREE_CODE (t) == TYPE_DECL)
11396 if (! CLASS_TYPE_P (t) || ! CLASSTYPE_TEMPLATE_INFO (t))
11398 error ("explicit instantiation of non-template type %qT", t);
11404 if (!COMPLETE_TYPE_P (t))
11406 if (complain & tf_error)
11407 error ("explicit instantiation of %q#T before definition of template",
11412 if (storage != NULL_TREE)
11414 if (pedantic && !in_system_header)
11415 pedwarn("ISO C++ forbids the use of %qE on explicit instantiations",
11418 if (storage == ridpointers[(int) RID_INLINE])
11420 else if (storage == ridpointers[(int) RID_EXTERN])
11422 else if (storage == ridpointers[(int) RID_STATIC])
11426 error ("storage class %qD applied to template instantiation",
11432 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (t))
11434 /* DR 259 [temp.spec].
11436 Both an explicit instantiation and a declaration of an explicit
11437 specialization shall not appear in a program unless the explicit
11438 instantiation follows a declaration of the explicit specialization.
11440 For a given set of template parameters, if an explicit
11441 instantiation of a template appears after a declaration of an
11442 explicit specialization for that template, the explicit
11443 instantiation has no effect. */
11446 else if (CLASSTYPE_EXPLICIT_INSTANTIATION (t))
11450 No program shall explicitly instantiate any template more
11453 If PREVIOUS_INSTANTIATION_EXTERN_P, then the first explicit
11454 instantiation was `extern'. If EXTERN_P then the second is.
11455 These cases are OK. */
11456 previous_instantiation_extern_p = CLASSTYPE_INTERFACE_ONLY (t);
11458 if (!previous_instantiation_extern_p && !extern_p
11459 && (complain & tf_error))
11460 pedwarn ("duplicate explicit instantiation of %q#T", t);
11462 /* If we've already instantiated the template, just return now. */
11463 if (!CLASSTYPE_INTERFACE_ONLY (t))
11467 check_explicit_instantiation_namespace (TYPE_NAME (t));
11468 mark_class_instantiated (t, extern_p);
11476 /* In contrast to implicit instantiation, where only the
11477 declarations, and not the definitions, of members are
11478 instantiated, we have here:
11482 The explicit instantiation of a class template specialization
11483 implies the instantiation of all of its members not
11484 previously explicitly specialized in the translation unit
11485 containing the explicit instantiation.
11487 Of course, we can't instantiate member template classes, since
11488 we don't have any arguments for them. Note that the standard
11489 is unclear on whether the instantiation of the members are
11490 *explicit* instantiations or not. However, the most natural
11491 interpretation is that it should be an explicit instantiation. */
11494 for (tmp = TYPE_METHODS (t); tmp; tmp = TREE_CHAIN (tmp))
11495 if (TREE_CODE (tmp) == FUNCTION_DECL
11496 && DECL_TEMPLATE_INSTANTIATION (tmp))
11497 instantiate_class_member (tmp, extern_p);
11499 for (tmp = TYPE_FIELDS (t); tmp; tmp = TREE_CHAIN (tmp))
11500 if (TREE_CODE (tmp) == VAR_DECL && DECL_TEMPLATE_INSTANTIATION (tmp))
11501 instantiate_class_member (tmp, extern_p);
11503 if (CLASSTYPE_NESTED_UTDS (t))
11504 binding_table_foreach (CLASSTYPE_NESTED_UTDS (t),
11505 bt_instantiate_type_proc, &storage);
11509 /* Given a function DECL, which is a specialization of TMPL, modify
11510 DECL to be a re-instantiation of TMPL with the same template
11511 arguments. TMPL should be the template into which tsubst'ing
11512 should occur for DECL, not the most general template.
11514 One reason for doing this is a scenario like this:
11517 void f(const T&, int i);
11519 void g() { f(3, 7); }
11522 void f(const T& t, const int i) { }
11524 Note that when the template is first instantiated, with
11525 instantiate_template, the resulting DECL will have no name for the
11526 first parameter, and the wrong type for the second. So, when we go
11527 to instantiate the DECL, we regenerate it. */
11530 regenerate_decl_from_template (tree decl, tree tmpl)
11532 /* The arguments used to instantiate DECL, from the most general
11537 args = DECL_TI_ARGS (decl);
11538 code_pattern = DECL_TEMPLATE_RESULT (tmpl);
11540 /* Make sure that we can see identifiers, and compute access
11542 push_access_scope (decl);
11544 if (TREE_CODE (decl) == FUNCTION_DECL)
11552 args_depth = TMPL_ARGS_DEPTH (args);
11553 parms_depth = TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl));
11554 if (args_depth > parms_depth)
11555 args = get_innermost_template_args (args, parms_depth);
11557 specs = tsubst_exception_specification (TREE_TYPE (code_pattern),
11558 args, tf_error, NULL_TREE);
11560 TREE_TYPE (decl) = build_exception_variant (TREE_TYPE (decl),
11563 /* Merge parameter declarations. */
11564 decl_parm = skip_artificial_parms_for (decl,
11565 DECL_ARGUMENTS (decl));
11567 = skip_artificial_parms_for (code_pattern,
11568 DECL_ARGUMENTS (code_pattern));
11574 if (DECL_NAME (decl_parm) != DECL_NAME (pattern_parm))
11575 DECL_NAME (decl_parm) = DECL_NAME (pattern_parm);
11576 parm_type = tsubst (TREE_TYPE (pattern_parm), args, tf_error,
11578 parm_type = type_decays_to (parm_type);
11579 if (!same_type_p (TREE_TYPE (decl_parm), parm_type))
11580 TREE_TYPE (decl_parm) = parm_type;
11581 attributes = DECL_ATTRIBUTES (pattern_parm);
11582 if (DECL_ATTRIBUTES (decl_parm) != attributes)
11584 DECL_ATTRIBUTES (decl_parm) = attributes;
11585 cplus_decl_attributes (&decl_parm, attributes, /*flags=*/0);
11587 decl_parm = TREE_CHAIN (decl_parm);
11588 pattern_parm = TREE_CHAIN (pattern_parm);
11591 /* Merge additional specifiers from the CODE_PATTERN. */
11592 if (DECL_DECLARED_INLINE_P (code_pattern)
11593 && !DECL_DECLARED_INLINE_P (decl))
11594 DECL_DECLARED_INLINE_P (decl) = 1;
11595 if (DECL_INLINE (code_pattern) && !DECL_INLINE (decl))
11596 DECL_INLINE (decl) = 1;
11598 else if (TREE_CODE (decl) == VAR_DECL)
11599 DECL_INITIAL (decl) =
11600 tsubst_expr (DECL_INITIAL (code_pattern), args,
11601 tf_error, DECL_TI_TEMPLATE (decl));
11603 gcc_unreachable ();
11605 pop_access_scope (decl);
11608 /* Return the TEMPLATE_DECL into which DECL_TI_ARGS(DECL) should be
11609 substituted to get DECL. */
11612 template_for_substitution (tree decl)
11614 tree tmpl = DECL_TI_TEMPLATE (decl);
11616 /* Set TMPL to the template whose DECL_TEMPLATE_RESULT is the pattern
11617 for the instantiation. This is not always the most general
11618 template. Consider, for example:
11621 struct S { template <class U> void f();
11622 template <> void f<int>(); };
11624 and an instantiation of S<double>::f<int>. We want TD to be the
11625 specialization S<T>::f<int>, not the more general S<T>::f<U>. */
11626 while (/* An instantiation cannot have a definition, so we need a
11627 more general template. */
11628 DECL_TEMPLATE_INSTANTIATION (tmpl)
11629 /* We must also deal with friend templates. Given:
11631 template <class T> struct S {
11632 template <class U> friend void f() {};
11635 S<int>::f<U> say, is not an instantiation of S<T>::f<U>,
11636 so far as the language is concerned, but that's still
11637 where we get the pattern for the instantiation from. On
11638 other hand, if the definition comes outside the class, say:
11640 template <class T> struct S {
11641 template <class U> friend void f();
11643 template <class U> friend void f() {}
11645 we don't need to look any further. That's what the check for
11646 DECL_INITIAL is for. */
11647 || (TREE_CODE (decl) == FUNCTION_DECL
11648 && DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (tmpl)
11649 && !DECL_INITIAL (DECL_TEMPLATE_RESULT (tmpl))))
11651 /* The present template, TD, should not be a definition. If it
11652 were a definition, we should be using it! Note that we
11653 cannot restructure the loop to just keep going until we find
11654 a template with a definition, since that might go too far if
11655 a specialization was declared, but not defined. */
11656 gcc_assert (TREE_CODE (decl) != VAR_DECL
11657 || DECL_IN_AGGR_P (DECL_TEMPLATE_RESULT (tmpl)));
11659 /* Fetch the more general template. */
11660 tmpl = DECL_TI_TEMPLATE (tmpl);
11666 /* Produce the definition of D, a _DECL generated from a template. If
11667 DEFER_OK is nonzero, then we don't have to actually do the
11668 instantiation now; we just have to do it sometime. Normally it is
11669 an error if this is an explicit instantiation but D is undefined.
11670 EXPL_INST_CLASS_MEM_P is true iff D is a member of an
11671 explicitly instantiated class template. */
11674 instantiate_decl (tree d, int defer_ok,
11675 bool expl_inst_class_mem_p)
11677 tree tmpl = DECL_TI_TEMPLATE (d);
11684 bool pattern_defined;
11686 location_t saved_loc = input_location;
11689 /* This function should only be used to instantiate templates for
11690 functions and static member variables. */
11691 gcc_assert (TREE_CODE (d) == FUNCTION_DECL
11692 || TREE_CODE (d) == VAR_DECL);
11694 /* Variables are never deferred; if instantiation is required, they
11695 are instantiated right away. That allows for better code in the
11696 case that an expression refers to the value of the variable --
11697 if the variable has a constant value the referring expression can
11698 take advantage of that fact. */
11699 if (TREE_CODE (d) == VAR_DECL)
11702 /* Don't instantiate cloned functions. Instead, instantiate the
11703 functions they cloned. */
11704 if (TREE_CODE (d) == FUNCTION_DECL && DECL_CLONED_FUNCTION_P (d))
11705 d = DECL_CLONED_FUNCTION (d);
11707 if (DECL_TEMPLATE_INSTANTIATED (d))
11708 /* D has already been instantiated. It might seem reasonable to
11709 check whether or not D is an explicit instantiation, and, if so,
11710 stop here. But when an explicit instantiation is deferred
11711 until the end of the compilation, DECL_EXPLICIT_INSTANTIATION
11712 is set, even though we still need to do the instantiation. */
11715 /* If we already have a specialization of this declaration, then
11716 there's no reason to instantiate it. Note that
11717 retrieve_specialization gives us both instantiations and
11718 specializations, so we must explicitly check
11719 DECL_TEMPLATE_SPECIALIZATION. */
11720 gen_tmpl = most_general_template (tmpl);
11721 gen_args = DECL_TI_ARGS (d);
11722 spec = retrieve_specialization (gen_tmpl, gen_args,
11723 /*class_specializations_p=*/false);
11724 if (spec != NULL_TREE && DECL_TEMPLATE_SPECIALIZATION (spec))
11727 /* This needs to happen before any tsubsting. */
11728 if (! push_tinst_level (d))
11731 timevar_push (TV_PARSE);
11733 /* Set TD to the template whose DECL_TEMPLATE_RESULT is the pattern
11734 for the instantiation. */
11735 td = template_for_substitution (d);
11736 code_pattern = DECL_TEMPLATE_RESULT (td);
11738 /* We should never be trying to instantiate a member of a class
11739 template or partial specialization. */
11740 gcc_assert (d != code_pattern);
11742 if ((DECL_NAMESPACE_SCOPE_P (d) && !DECL_INITIALIZED_IN_CLASS_P (d))
11743 || DECL_TEMPLATE_SPECIALIZATION (td))
11744 /* In the case of a friend template whose definition is provided
11745 outside the class, we may have too many arguments. Drop the
11746 ones we don't need. The same is true for specializations. */
11747 args = get_innermost_template_args
11748 (gen_args, TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (td)));
11752 if (TREE_CODE (d) == FUNCTION_DECL)
11753 pattern_defined = (DECL_SAVED_TREE (code_pattern) != NULL_TREE);
11755 pattern_defined = ! DECL_IN_AGGR_P (code_pattern);
11757 /* We may be in the middle of deferred access check. Disable it now. */
11758 push_deferring_access_checks (dk_no_deferred);
11760 /* Unless an explicit instantiation directive has already determined
11761 the linkage of D, remember that a definition is available for
11763 if (pattern_defined
11764 && !DECL_INTERFACE_KNOWN (d)
11765 && !DECL_NOT_REALLY_EXTERN (d))
11766 mark_definable (d);
11768 input_location = DECL_SOURCE_LOCATION (d);
11770 /* If D is a member of an explicitly instantiated class template,
11771 and no definition is available, treat it like an implicit
11773 if (!pattern_defined && expl_inst_class_mem_p
11774 && DECL_EXPLICIT_INSTANTIATION (d))
11776 DECL_NOT_REALLY_EXTERN (d) = 0;
11777 DECL_INTERFACE_KNOWN (d) = 0;
11778 SET_DECL_IMPLICIT_INSTANTIATION (d);
11783 /* Recheck the substitutions to obtain any warning messages
11784 about ignoring cv qualifiers. */
11785 tree gen = DECL_TEMPLATE_RESULT (gen_tmpl);
11786 tree type = TREE_TYPE (gen);
11788 /* Make sure that we can see identifiers, and compute access
11789 correctly. D is already the target FUNCTION_DECL with the
11791 push_access_scope (d);
11793 if (TREE_CODE (gen) == FUNCTION_DECL)
11795 tsubst (DECL_ARGUMENTS (gen), gen_args, tf_warning_or_error, d);
11796 tsubst (TYPE_RAISES_EXCEPTIONS (type), gen_args,
11797 tf_warning_or_error, d);
11798 /* Don't simply tsubst the function type, as that will give
11799 duplicate warnings about poor parameter qualifications.
11800 The function arguments are the same as the decl_arguments
11801 without the top level cv qualifiers. */
11802 type = TREE_TYPE (type);
11804 tsubst (type, gen_args, tf_warning_or_error, d);
11806 pop_access_scope (d);
11809 /* Check to see whether we know that this template will be
11810 instantiated in some other file, as with "extern template"
11812 external_p = (DECL_INTERFACE_KNOWN (d) && DECL_REALLY_EXTERN (d));
11813 /* In general, we do not instantiate such templates... */
11815 /* ... but we instantiate inline functions so that we can inline
11817 && ! (TREE_CODE (d) == FUNCTION_DECL && DECL_INLINE (d))
11818 /* ... we instantiate static data members whose values are
11819 needed in integral constant expressions. */
11820 && ! (TREE_CODE (d) == VAR_DECL
11821 && DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (d)))
11823 /* Defer all other templates, unless we have been explicitly
11824 forbidden from doing so. */
11825 if (/* If there is no definition, we cannot instantiate the
11828 /* If it's OK to postpone instantiation, do so. */
11830 /* If this is a static data member that will be defined
11831 elsewhere, we don't want to instantiate the entire data
11832 member, but we do want to instantiate the initializer so that
11833 we can substitute that elsewhere. */
11834 || (external_p && TREE_CODE (d) == VAR_DECL))
11836 /* The definition of the static data member is now required so
11837 we must substitute the initializer. */
11838 if (TREE_CODE (d) == VAR_DECL
11839 && !DECL_INITIAL (d)
11840 && DECL_INITIAL (code_pattern))
11845 ns = decl_namespace_context (d);
11846 push_nested_namespace (ns);
11847 push_nested_class (DECL_CONTEXT (d));
11848 init = tsubst_expr (DECL_INITIAL (code_pattern),
11850 tf_warning_or_error, NULL_TREE);
11851 cp_finish_decl (d, init, /*init_const_expr_p=*/false,
11852 /*asmspec_tree=*/NULL_TREE,
11853 LOOKUP_ONLYCONVERTING);
11854 pop_nested_class ();
11855 pop_nested_namespace (ns);
11858 /* We restore the source position here because it's used by
11859 add_pending_template. */
11860 input_location = saved_loc;
11862 if (at_eof && !pattern_defined
11863 && DECL_EXPLICIT_INSTANTIATION (d))
11866 The definition of a non-exported function template, a
11867 non-exported member function template, or a non-exported
11868 member function or static data member of a class template
11869 shall be present in every translation unit in which it is
11870 explicitly instantiated. */
11872 ("explicit instantiation of %qD but no definition available", d);
11874 /* ??? Historically, we have instantiated inline functions, even
11875 when marked as "extern template". */
11876 if (!(external_p && TREE_CODE (d) == VAR_DECL))
11877 add_pending_template (d);
11880 /* Tell the repository that D is available in this translation unit
11881 -- and see if it is supposed to be instantiated here. */
11882 if (TREE_PUBLIC (d) && !DECL_REALLY_EXTERN (d) && !repo_emit_p (d))
11884 /* In a PCH file, despite the fact that the repository hasn't
11885 requested instantiation in the PCH it is still possible that
11886 an instantiation will be required in a file that includes the
11889 add_pending_template (d);
11890 /* Instantiate inline functions so that the inliner can do its
11891 job, even though we'll not be emitting a copy of this
11893 if (!(TREE_CODE (d) == FUNCTION_DECL
11894 && flag_inline_trees
11895 && DECL_DECLARED_INLINE_P (d)))
11899 need_push = !cfun || !global_bindings_p ();
11901 push_to_top_level ();
11903 /* Mark D as instantiated so that recursive calls to
11904 instantiate_decl do not try to instantiate it again. */
11905 DECL_TEMPLATE_INSTANTIATED (d) = 1;
11907 /* Regenerate the declaration in case the template has been modified
11908 by a subsequent redeclaration. */
11909 regenerate_decl_from_template (d, td);
11911 /* We already set the file and line above. Reset them now in case
11912 they changed as a result of calling regenerate_decl_from_template. */
11913 input_location = DECL_SOURCE_LOCATION (d);
11915 if (TREE_CODE (d) == VAR_DECL)
11919 /* Clear out DECL_RTL; whatever was there before may not be right
11920 since we've reset the type of the declaration. */
11921 SET_DECL_RTL (d, NULL_RTX);
11922 DECL_IN_AGGR_P (d) = 0;
11924 /* The initializer is placed in DECL_INITIAL by
11925 regenerate_decl_from_template. Pull it out so that
11926 finish_decl can process it. */
11927 init = DECL_INITIAL (d);
11928 DECL_INITIAL (d) = NULL_TREE;
11929 DECL_INITIALIZED_P (d) = 0;
11931 /* Clear DECL_EXTERNAL so that cp_finish_decl will process the
11932 initializer. That function will defer actual emission until
11933 we have a chance to determine linkage. */
11934 DECL_EXTERNAL (d) = 0;
11936 /* Enter the scope of D so that access-checking works correctly. */
11937 push_nested_class (DECL_CONTEXT (d));
11938 finish_decl (d, init, NULL_TREE);
11939 pop_nested_class ();
11941 else if (TREE_CODE (d) == FUNCTION_DECL)
11943 htab_t saved_local_specializations;
11948 /* Save away the current list, in case we are instantiating one
11949 template from within the body of another. */
11950 saved_local_specializations = local_specializations;
11952 /* Set up the list of local specializations. */
11953 local_specializations = htab_create (37,
11954 hash_local_specialization,
11955 eq_local_specializations,
11958 /* Set up context. */
11959 start_preparsed_function (d, NULL_TREE, SF_PRE_PARSED);
11961 /* Create substitution entries for the parameters. */
11962 subst_decl = DECL_TEMPLATE_RESULT (template_for_substitution (d));
11963 tmpl_parm = DECL_ARGUMENTS (subst_decl);
11964 spec_parm = DECL_ARGUMENTS (d);
11965 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (d))
11967 register_local_specialization (spec_parm, tmpl_parm);
11968 spec_parm = skip_artificial_parms_for (d, spec_parm);
11969 tmpl_parm = skip_artificial_parms_for (subst_decl, tmpl_parm);
11973 register_local_specialization (spec_parm, tmpl_parm);
11974 tmpl_parm = TREE_CHAIN (tmpl_parm);
11975 spec_parm = TREE_CHAIN (spec_parm);
11977 gcc_assert (!spec_parm);
11979 /* Substitute into the body of the function. */
11980 tsubst_expr (DECL_SAVED_TREE (code_pattern), args,
11981 tf_warning_or_error, tmpl);
11983 /* We don't need the local specializations any more. */
11984 htab_delete (local_specializations);
11985 local_specializations = saved_local_specializations;
11987 /* Finish the function. */
11988 d = finish_function (0);
11989 expand_or_defer_fn (d);
11992 /* We're not deferring instantiation any more. */
11993 TI_PENDING_TEMPLATE_FLAG (DECL_TEMPLATE_INFO (d)) = 0;
11996 pop_from_top_level ();
11999 input_location = saved_loc;
12000 pop_deferring_access_checks ();
12001 pop_tinst_level ();
12003 timevar_pop (TV_PARSE);
12008 /* Run through the list of templates that we wish we could
12009 instantiate, and instantiate any we can. RETRIES is the
12010 number of times we retry pending template instantiation. */
12013 instantiate_pending_templates (int retries)
12016 tree last = NULL_TREE;
12018 location_t saved_loc = input_location;
12019 int saved_in_system_header = in_system_header;
12021 /* Instantiating templates may trigger vtable generation. This in turn
12022 may require further template instantiations. We place a limit here
12023 to avoid infinite loop. */
12024 if (pending_templates && retries >= max_tinst_depth)
12026 tree decl = TREE_VALUE (pending_templates);
12028 error ("template instantiation depth exceeds maximum of %d"
12029 " instantiating %q+D, possibly from virtual table generation"
12030 " (use -ftemplate-depth-NN to increase the maximum)",
12031 max_tinst_depth, decl);
12032 if (TREE_CODE (decl) == FUNCTION_DECL)
12033 /* Pretend that we defined it. */
12034 DECL_INITIAL (decl) = error_mark_node;
12042 t = &pending_templates;
12045 tree instantiation = TREE_VALUE (*t);
12047 reopen_tinst_level (TREE_PURPOSE (*t));
12049 if (TYPE_P (instantiation))
12053 if (!COMPLETE_TYPE_P (instantiation))
12055 instantiate_class_template (instantiation);
12056 if (CLASSTYPE_TEMPLATE_INSTANTIATION (instantiation))
12057 for (fn = TYPE_METHODS (instantiation);
12059 fn = TREE_CHAIN (fn))
12060 if (! DECL_ARTIFICIAL (fn))
12061 instantiate_decl (fn,
12063 /*expl_inst_class_mem_p=*/false);
12064 if (COMPLETE_TYPE_P (instantiation))
12068 if (COMPLETE_TYPE_P (instantiation))
12069 /* If INSTANTIATION has been instantiated, then we don't
12070 need to consider it again in the future. */
12071 *t = TREE_CHAIN (*t);
12075 t = &TREE_CHAIN (*t);
12080 if (!DECL_TEMPLATE_SPECIALIZATION (instantiation)
12081 && !DECL_TEMPLATE_INSTANTIATED (instantiation))
12084 = instantiate_decl (instantiation,
12086 /*expl_inst_class_mem_p=*/false);
12087 if (DECL_TEMPLATE_INSTANTIATED (instantiation))
12091 if (DECL_TEMPLATE_SPECIALIZATION (instantiation)
12092 || DECL_TEMPLATE_INSTANTIATED (instantiation))
12093 /* If INSTANTIATION has been instantiated, then we don't
12094 need to consider it again in the future. */
12095 *t = TREE_CHAIN (*t);
12099 t = &TREE_CHAIN (*t);
12103 current_tinst_level = NULL_TREE;
12105 last_pending_template = last;
12107 while (reconsider);
12109 input_location = saved_loc;
12110 in_system_header = saved_in_system_header;
12113 /* Substitute ARGVEC into T, which is a list of initializers for
12114 either base class or a non-static data member. The TREE_PURPOSEs
12115 are DECLs, and the TREE_VALUEs are the initializer values. Used by
12116 instantiate_decl. */
12119 tsubst_initializer_list (tree t, tree argvec)
12121 tree inits = NULL_TREE;
12123 for (; t; t = TREE_CHAIN (t))
12128 decl = tsubst_copy (TREE_PURPOSE (t), argvec, tf_warning_or_error,
12130 decl = expand_member_init (decl);
12131 if (decl && !DECL_P (decl))
12132 in_base_initializer = 1;
12134 init = tsubst_expr (TREE_VALUE (t), argvec, tf_warning_or_error,
12136 in_base_initializer = 0;
12140 init = build_tree_list (decl, init);
12141 TREE_CHAIN (init) = inits;
12148 /* Set CURRENT_ACCESS_SPECIFIER based on the protection of DECL. */
12151 set_current_access_from_decl (tree decl)
12153 if (TREE_PRIVATE (decl))
12154 current_access_specifier = access_private_node;
12155 else if (TREE_PROTECTED (decl))
12156 current_access_specifier = access_protected_node;
12158 current_access_specifier = access_public_node;
12161 /* Instantiate an enumerated type. TAG is the template type, NEWTAG
12162 is the instantiation (which should have been created with
12163 start_enum) and ARGS are the template arguments to use. */
12166 tsubst_enum (tree tag, tree newtag, tree args)
12170 for (e = TYPE_VALUES (tag); e; e = TREE_CHAIN (e))
12175 decl = TREE_VALUE (e);
12176 /* Note that in a template enum, the TREE_VALUE is the
12177 CONST_DECL, not the corresponding INTEGER_CST. */
12178 value = tsubst_expr (DECL_INITIAL (decl),
12179 args, tf_warning_or_error, NULL_TREE);
12181 /* Give this enumeration constant the correct access. */
12182 set_current_access_from_decl (decl);
12184 /* Actually build the enumerator itself. */
12185 build_enumerator (DECL_NAME (decl), value, newtag);
12188 finish_enum (newtag);
12189 DECL_SOURCE_LOCATION (TYPE_NAME (newtag))
12190 = DECL_SOURCE_LOCATION (TYPE_NAME (tag));
12193 /* DECL is a FUNCTION_DECL that is a template specialization. Return
12194 its type -- but without substituting the innermost set of template
12195 arguments. So, innermost set of template parameters will appear in
12199 get_mostly_instantiated_function_type (tree decl)
12207 tmpl = most_general_template (DECL_TI_TEMPLATE (decl));
12208 targs = DECL_TI_ARGS (decl);
12209 tparms = DECL_TEMPLATE_PARMS (tmpl);
12210 parm_depth = TMPL_PARMS_DEPTH (tparms);
12212 /* There should be as many levels of arguments as there are levels
12214 gcc_assert (parm_depth == TMPL_ARGS_DEPTH (targs));
12216 fn_type = TREE_TYPE (tmpl);
12218 if (parm_depth == 1)
12219 /* No substitution is necessary. */
12223 int i, save_access_control;
12226 /* Replace the innermost level of the TARGS with NULL_TREEs to
12227 let tsubst know not to substitute for those parameters. */
12228 partial_args = make_tree_vec (TREE_VEC_LENGTH (targs));
12229 for (i = 1; i < TMPL_ARGS_DEPTH (targs); ++i)
12230 SET_TMPL_ARGS_LEVEL (partial_args, i,
12231 TMPL_ARGS_LEVEL (targs, i));
12232 SET_TMPL_ARGS_LEVEL (partial_args,
12233 TMPL_ARGS_DEPTH (targs),
12234 make_tree_vec (DECL_NTPARMS (tmpl)));
12236 /* Disable access control as this function is used only during
12238 save_access_control = flag_access_control;
12239 flag_access_control = 0;
12241 ++processing_template_decl;
12242 /* Now, do the (partial) substitution to figure out the
12243 appropriate function type. */
12244 fn_type = tsubst (fn_type, partial_args, tf_error, NULL_TREE);
12245 --processing_template_decl;
12247 /* Substitute into the template parameters to obtain the real
12248 innermost set of parameters. This step is important if the
12249 innermost set of template parameters contains value
12250 parameters whose types depend on outer template parameters. */
12251 TREE_VEC_LENGTH (partial_args)--;
12252 tparms = tsubst_template_parms (tparms, partial_args, tf_error);
12254 flag_access_control = save_access_control;
12260 /* Return truthvalue if we're processing a template different from
12261 the last one involved in diagnostics. */
12263 problematic_instantiation_changed (void)
12265 return last_template_error_tick != tinst_level_tick;
12268 /* Remember current template involved in diagnostics. */
12270 record_last_problematic_instantiation (void)
12272 last_template_error_tick = tinst_level_tick;
12276 current_instantiation (void)
12278 return current_tinst_level;
12281 /* [temp.param] Check that template non-type parm TYPE is of an allowable
12282 type. Return zero for ok, nonzero for disallowed. Issue error and
12283 warning messages under control of COMPLAIN. */
12286 invalid_nontype_parm_type_p (tree type, tsubst_flags_t complain)
12288 if (INTEGRAL_TYPE_P (type))
12290 else if (POINTER_TYPE_P (type))
12292 else if (TYPE_PTR_TO_MEMBER_P (type))
12294 else if (TREE_CODE (type) == TEMPLATE_TYPE_PARM)
12296 else if (TREE_CODE (type) == TYPENAME_TYPE)
12299 if (complain & tf_error)
12300 error ("%q#T is not a valid type for a template constant parameter", type);
12304 /* Returns TRUE if TYPE is dependent, in the sense of [temp.dep.type].
12305 Assumes that TYPE really is a type, and not the ERROR_MARK_NODE.*/
12308 dependent_type_p_r (tree type)
12314 A type is dependent if it is:
12316 -- a template parameter. Template template parameters are types
12317 for us (since TYPE_P holds true for them) so we handle
12319 if (TREE_CODE (type) == TEMPLATE_TYPE_PARM
12320 || TREE_CODE (type) == TEMPLATE_TEMPLATE_PARM)
12322 /* -- a qualified-id with a nested-name-specifier which contains a
12323 class-name that names a dependent type or whose unqualified-id
12324 names a dependent type. */
12325 if (TREE_CODE (type) == TYPENAME_TYPE)
12327 /* -- a cv-qualified type where the cv-unqualified type is
12329 type = TYPE_MAIN_VARIANT (type);
12330 /* -- a compound type constructed from any dependent type. */
12331 if (TYPE_PTR_TO_MEMBER_P (type))
12332 return (dependent_type_p (TYPE_PTRMEM_CLASS_TYPE (type))
12333 || dependent_type_p (TYPE_PTRMEM_POINTED_TO_TYPE
12335 else if (TREE_CODE (type) == POINTER_TYPE
12336 || TREE_CODE (type) == REFERENCE_TYPE)
12337 return dependent_type_p (TREE_TYPE (type));
12338 else if (TREE_CODE (type) == FUNCTION_TYPE
12339 || TREE_CODE (type) == METHOD_TYPE)
12343 if (dependent_type_p (TREE_TYPE (type)))
12345 for (arg_type = TYPE_ARG_TYPES (type);
12347 arg_type = TREE_CHAIN (arg_type))
12348 if (dependent_type_p (TREE_VALUE (arg_type)))
12352 /* -- an array type constructed from any dependent type or whose
12353 size is specified by a constant expression that is
12354 value-dependent. */
12355 if (TREE_CODE (type) == ARRAY_TYPE)
12357 if (TYPE_DOMAIN (type)
12358 && ((value_dependent_expression_p
12359 (TYPE_MAX_VALUE (TYPE_DOMAIN (type))))
12360 || (type_dependent_expression_p
12361 (TYPE_MAX_VALUE (TYPE_DOMAIN (type))))))
12363 return dependent_type_p (TREE_TYPE (type));
12366 /* -- a template-id in which either the template name is a template
12368 if (TREE_CODE (type) == BOUND_TEMPLATE_TEMPLATE_PARM)
12370 /* ... or any of the template arguments is a dependent type or
12371 an expression that is type-dependent or value-dependent. */
12372 else if (CLASS_TYPE_P (type) && CLASSTYPE_TEMPLATE_INFO (type)
12373 && (any_dependent_template_arguments_p
12374 (INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type)))))
12377 /* All TYPEOF_TYPEs are dependent; if the argument of the `typeof'
12378 expression is not type-dependent, then it should already been
12380 if (TREE_CODE (type) == TYPEOF_TYPE)
12383 /* The standard does not specifically mention types that are local
12384 to template functions or local classes, but they should be
12385 considered dependent too. For example:
12387 template <int I> void f() {
12392 The size of `E' cannot be known until the value of `I' has been
12393 determined. Therefore, `E' must be considered dependent. */
12394 scope = TYPE_CONTEXT (type);
12395 if (scope && TYPE_P (scope))
12396 return dependent_type_p (scope);
12397 else if (scope && TREE_CODE (scope) == FUNCTION_DECL)
12398 return type_dependent_expression_p (scope);
12400 /* Other types are non-dependent. */
12404 /* Returns TRUE if TYPE is dependent, in the sense of
12405 [temp.dep.type]. */
12408 dependent_type_p (tree type)
12410 /* If there are no template parameters in scope, then there can't be
12411 any dependent types. */
12412 if (!processing_template_decl)
12414 /* If we are not processing a template, then nobody should be
12415 providing us with a dependent type. */
12417 gcc_assert (TREE_CODE (type) != TEMPLATE_TYPE_PARM);
12421 /* If the type is NULL, we have not computed a type for the entity
12422 in question; in that case, the type is dependent. */
12426 /* Erroneous types can be considered non-dependent. */
12427 if (type == error_mark_node)
12430 /* If we have not already computed the appropriate value for TYPE,
12432 if (!TYPE_DEPENDENT_P_VALID (type))
12434 TYPE_DEPENDENT_P (type) = dependent_type_p_r (type);
12435 TYPE_DEPENDENT_P_VALID (type) = 1;
12438 return TYPE_DEPENDENT_P (type);
12441 /* Returns TRUE if EXPRESSION is dependent, according to CRITERION. */
12444 dependent_scope_ref_p (tree expression, bool criterion (tree))
12449 gcc_assert (TREE_CODE (expression) == SCOPE_REF);
12451 if (!TYPE_P (TREE_OPERAND (expression, 0)))
12454 scope = TREE_OPERAND (expression, 0);
12455 name = TREE_OPERAND (expression, 1);
12459 An id-expression is type-dependent if it contains a
12460 nested-name-specifier that contains a class-name that names a
12462 /* The suggested resolution to Core Issue 2 implies that if the
12463 qualifying type is the current class, then we must peek
12466 && currently_open_class (scope)
12467 && !criterion (name))
12469 if (dependent_type_p (scope))
12475 /* Returns TRUE if the EXPRESSION is value-dependent, in the sense of
12476 [temp.dep.constexpr] */
12479 value_dependent_expression_p (tree expression)
12481 if (!processing_template_decl)
12484 /* A name declared with a dependent type. */
12485 if (DECL_P (expression) && type_dependent_expression_p (expression))
12488 switch (TREE_CODE (expression))
12490 case IDENTIFIER_NODE:
12491 /* A name that has not been looked up -- must be dependent. */
12494 case TEMPLATE_PARM_INDEX:
12495 /* A non-type template parm. */
12499 /* A non-type template parm. */
12500 if (DECL_TEMPLATE_PARM_P (expression))
12505 /* A constant with integral or enumeration type and is initialized
12506 with an expression that is value-dependent. */
12507 if (DECL_INITIAL (expression)
12508 && INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (expression))
12509 && value_dependent_expression_p (DECL_INITIAL (expression)))
12513 case DYNAMIC_CAST_EXPR:
12514 case STATIC_CAST_EXPR:
12515 case CONST_CAST_EXPR:
12516 case REINTERPRET_CAST_EXPR:
12518 /* These expressions are value-dependent if the type to which
12519 the cast occurs is dependent or the expression being casted
12520 is value-dependent. */
12522 tree type = TREE_TYPE (expression);
12524 if (dependent_type_p (type))
12527 /* A functional cast has a list of operands. */
12528 expression = TREE_OPERAND (expression, 0);
12531 /* If there are no operands, it must be an expression such
12532 as "int()". This should not happen for aggregate types
12533 because it would form non-constant expressions. */
12534 gcc_assert (INTEGRAL_OR_ENUMERATION_TYPE_P (type));
12539 if (TREE_CODE (expression) == TREE_LIST)
12541 for (; expression; expression = TREE_CHAIN (expression))
12542 if (value_dependent_expression_p (TREE_VALUE (expression)))
12547 return value_dependent_expression_p (expression);
12552 /* A `sizeof' expression is value-dependent if the operand is
12554 expression = TREE_OPERAND (expression, 0);
12555 if (TYPE_P (expression))
12556 return dependent_type_p (expression);
12557 return type_dependent_expression_p (expression);
12560 return dependent_scope_ref_p (expression, value_dependent_expression_p);
12562 case COMPONENT_REF:
12563 return (value_dependent_expression_p (TREE_OPERAND (expression, 0))
12564 || value_dependent_expression_p (TREE_OPERAND (expression, 1)));
12567 /* A CALL_EXPR is value-dependent if any argument is
12568 value-dependent. Why do we have to handle CALL_EXPRs in this
12569 function at all? First, some function calls, those for which
12570 value_dependent_expression_p is true, man appear in constant
12571 expressions. Second, there appear to be bugs which result in
12572 other CALL_EXPRs reaching this point. */
12574 tree function = TREE_OPERAND (expression, 0);
12575 tree args = TREE_OPERAND (expression, 1);
12577 if (value_dependent_expression_p (function))
12583 if (TREE_CODE (args) == TREE_LIST)
12585 for (; args; args = TREE_CHAIN (args))
12586 if (value_dependent_expression_p (TREE_VALUE (args)))
12591 return value_dependent_expression_p (args);
12595 /* A constant expression is value-dependent if any subexpression is
12596 value-dependent. */
12597 switch (TREE_CODE_CLASS (TREE_CODE (expression)))
12599 case tcc_reference:
12601 return (value_dependent_expression_p
12602 (TREE_OPERAND (expression, 0)));
12604 case tcc_comparison:
12606 return ((value_dependent_expression_p
12607 (TREE_OPERAND (expression, 0)))
12608 || (value_dependent_expression_p
12609 (TREE_OPERAND (expression, 1))));
12611 case tcc_expression:
12614 for (i = 0; i < TREE_CODE_LENGTH (TREE_CODE (expression)); ++i)
12615 /* In some cases, some of the operands may be missing.
12616 (For example, in the case of PREDECREMENT_EXPR, the
12617 amount to increment by may be missing.) That doesn't
12618 make the expression dependent. */
12619 if (TREE_OPERAND (expression, i)
12620 && (value_dependent_expression_p
12621 (TREE_OPERAND (expression, i))))
12631 /* The expression is not value-dependent. */
12635 /* Returns TRUE if the EXPRESSION is type-dependent, in the sense of
12636 [temp.dep.expr]. */
12639 type_dependent_expression_p (tree expression)
12641 if (!processing_template_decl)
12644 if (expression == error_mark_node)
12647 /* An unresolved name is always dependent. */
12648 if (TREE_CODE (expression) == IDENTIFIER_NODE)
12651 /* Some expression forms are never type-dependent. */
12652 if (TREE_CODE (expression) == PSEUDO_DTOR_EXPR
12653 || TREE_CODE (expression) == SIZEOF_EXPR
12654 || TREE_CODE (expression) == ALIGNOF_EXPR
12655 || TREE_CODE (expression) == TYPEID_EXPR
12656 || TREE_CODE (expression) == DELETE_EXPR
12657 || TREE_CODE (expression) == VEC_DELETE_EXPR
12658 || TREE_CODE (expression) == THROW_EXPR)
12661 /* The types of these expressions depends only on the type to which
12662 the cast occurs. */
12663 if (TREE_CODE (expression) == DYNAMIC_CAST_EXPR
12664 || TREE_CODE (expression) == STATIC_CAST_EXPR
12665 || TREE_CODE (expression) == CONST_CAST_EXPR
12666 || TREE_CODE (expression) == REINTERPRET_CAST_EXPR
12667 || TREE_CODE (expression) == CAST_EXPR)
12668 return dependent_type_p (TREE_TYPE (expression));
12670 /* The types of these expressions depends only on the type created
12671 by the expression. */
12672 if (TREE_CODE (expression) == NEW_EXPR
12673 || TREE_CODE (expression) == VEC_NEW_EXPR)
12675 /* For NEW_EXPR tree nodes created inside a template, either
12676 the object type itself or a TREE_LIST may appear as the
12678 tree type = TREE_OPERAND (expression, 1);
12679 if (TREE_CODE (type) == TREE_LIST)
12680 /* This is an array type. We need to check array dimensions
12682 return dependent_type_p (TREE_VALUE (TREE_PURPOSE (type)))
12683 || value_dependent_expression_p
12684 (TREE_OPERAND (TREE_VALUE (type), 1));
12686 return dependent_type_p (type);
12689 if (TREE_CODE (expression) == SCOPE_REF
12690 && dependent_scope_ref_p (expression,
12691 type_dependent_expression_p))
12694 if (TREE_CODE (expression) == FUNCTION_DECL
12695 && DECL_LANG_SPECIFIC (expression)
12696 && DECL_TEMPLATE_INFO (expression)
12697 && (any_dependent_template_arguments_p
12698 (INNERMOST_TEMPLATE_ARGS (DECL_TI_ARGS (expression)))))
12701 if (TREE_CODE (expression) == TEMPLATE_DECL
12702 && !DECL_TEMPLATE_TEMPLATE_PARM_P (expression))
12705 if (TREE_TYPE (expression) == unknown_type_node)
12707 if (TREE_CODE (expression) == ADDR_EXPR)
12708 return type_dependent_expression_p (TREE_OPERAND (expression, 0));
12709 if (TREE_CODE (expression) == COMPONENT_REF
12710 || TREE_CODE (expression) == OFFSET_REF)
12712 if (type_dependent_expression_p (TREE_OPERAND (expression, 0)))
12714 expression = TREE_OPERAND (expression, 1);
12715 if (TREE_CODE (expression) == IDENTIFIER_NODE)
12718 /* SCOPE_REF with non-null TREE_TYPE is always non-dependent. */
12719 if (TREE_CODE (expression) == SCOPE_REF)
12722 if (TREE_CODE (expression) == BASELINK)
12723 expression = BASELINK_FUNCTIONS (expression);
12725 if (TREE_CODE (expression) == TEMPLATE_ID_EXPR)
12727 if (any_dependent_template_arguments_p
12728 (TREE_OPERAND (expression, 1)))
12730 expression = TREE_OPERAND (expression, 0);
12732 gcc_assert (TREE_CODE (expression) == OVERLOAD
12733 || TREE_CODE (expression) == FUNCTION_DECL);
12737 if (type_dependent_expression_p (OVL_CURRENT (expression)))
12739 expression = OVL_NEXT (expression);
12744 gcc_assert (TREE_CODE (expression) != TYPE_DECL);
12746 return (dependent_type_p (TREE_TYPE (expression)));
12749 /* Returns TRUE if ARGS (a TREE_LIST of arguments to a function call)
12750 contains a type-dependent expression. */
12753 any_type_dependent_arguments_p (tree args)
12757 tree arg = TREE_VALUE (args);
12759 if (type_dependent_expression_p (arg))
12761 args = TREE_CHAIN (args);
12766 /* Returns TRUE if the ARG (a template argument) is dependent. */
12769 dependent_template_arg_p (tree arg)
12771 if (!processing_template_decl)
12774 if (TREE_CODE (arg) == TEMPLATE_DECL
12775 || TREE_CODE (arg) == TEMPLATE_TEMPLATE_PARM)
12776 return dependent_template_p (arg);
12777 else if (TYPE_P (arg))
12778 return dependent_type_p (arg);
12780 return (type_dependent_expression_p (arg)
12781 || value_dependent_expression_p (arg));
12784 /* Returns true if ARGS (a collection of template arguments) contains
12785 any dependent arguments. */
12788 any_dependent_template_arguments_p (tree args)
12795 if (args == error_mark_node)
12798 for (i = 0; i < TMPL_ARGS_DEPTH (args); ++i)
12800 tree level = TMPL_ARGS_LEVEL (args, i + 1);
12801 for (j = 0; j < TREE_VEC_LENGTH (level); ++j)
12802 if (dependent_template_arg_p (TREE_VEC_ELT (level, j)))
12809 /* Returns TRUE if the template TMPL is dependent. */
12812 dependent_template_p (tree tmpl)
12814 if (TREE_CODE (tmpl) == OVERLOAD)
12818 if (dependent_template_p (OVL_FUNCTION (tmpl)))
12820 tmpl = OVL_CHAIN (tmpl);
12825 /* Template template parameters are dependent. */
12826 if (DECL_TEMPLATE_TEMPLATE_PARM_P (tmpl)
12827 || TREE_CODE (tmpl) == TEMPLATE_TEMPLATE_PARM)
12829 /* So are names that have not been looked up. */
12830 if (TREE_CODE (tmpl) == SCOPE_REF
12831 || TREE_CODE (tmpl) == IDENTIFIER_NODE)
12833 /* So are member templates of dependent classes. */
12834 if (TYPE_P (CP_DECL_CONTEXT (tmpl)))
12835 return dependent_type_p (DECL_CONTEXT (tmpl));
12839 /* Returns TRUE if the specialization TMPL<ARGS> is dependent. */
12842 dependent_template_id_p (tree tmpl, tree args)
12844 return (dependent_template_p (tmpl)
12845 || any_dependent_template_arguments_p (args));
12848 /* TYPE is a TYPENAME_TYPE. Returns the ordinary TYPE to which the
12849 TYPENAME_TYPE corresponds. Returns ERROR_MARK_NODE if no such TYPE
12850 can be found. Note that this function peers inside uninstantiated
12851 templates and therefore should be used only in extremely limited
12852 situations. ONLY_CURRENT_P restricts this peering to the currently
12853 open classes hierarchy (which is required when comparing types). */
12856 resolve_typename_type (tree type, bool only_current_p)
12864 gcc_assert (TREE_CODE (type) == TYPENAME_TYPE);
12866 scope = TYPE_CONTEXT (type);
12867 name = TYPE_IDENTIFIER (type);
12869 /* If the SCOPE is itself a TYPENAME_TYPE, then we need to resolve
12870 it first before we can figure out what NAME refers to. */
12871 if (TREE_CODE (scope) == TYPENAME_TYPE)
12872 scope = resolve_typename_type (scope, only_current_p);
12873 /* If we don't know what SCOPE refers to, then we cannot resolve the
12875 if (scope == error_mark_node || TREE_CODE (scope) == TYPENAME_TYPE)
12876 return error_mark_node;
12877 /* If the SCOPE is a template type parameter, we have no way of
12878 resolving the name. */
12879 if (TREE_CODE (scope) == TEMPLATE_TYPE_PARM)
12881 /* If the SCOPE is not the current instantiation, there's no reason
12882 to look inside it. */
12883 if (only_current_p && !currently_open_class (scope))
12884 return error_mark_node;
12885 /* If SCOPE is a partial instantiation, it will not have a valid
12886 TYPE_FIELDS list, so use the original template. */
12887 scope = CLASSTYPE_PRIMARY_TEMPLATE_TYPE (scope);
12888 /* Enter the SCOPE so that name lookup will be resolved as if we
12889 were in the class definition. In particular, SCOPE will no
12890 longer be considered a dependent type. */
12891 pushed_scope = push_scope (scope);
12892 /* Look up the declaration. */
12893 decl = lookup_member (scope, name, /*protect=*/0, /*want_type=*/true);
12894 /* Obtain the set of qualifiers applied to the TYPE. */
12895 quals = cp_type_quals (type);
12896 /* For a TYPENAME_TYPE like "typename X::template Y<T>", we want to
12897 find a TEMPLATE_DECL. Otherwise, we want to find a TYPE_DECL. */
12899 type = error_mark_node;
12900 else if (TREE_CODE (TYPENAME_TYPE_FULLNAME (type)) == IDENTIFIER_NODE
12901 && TREE_CODE (decl) == TYPE_DECL)
12902 type = TREE_TYPE (decl);
12903 else if (TREE_CODE (TYPENAME_TYPE_FULLNAME (type)) == TEMPLATE_ID_EXPR
12904 && DECL_CLASS_TEMPLATE_P (decl))
12908 /* Obtain the template and the arguments. */
12909 tmpl = TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type), 0);
12910 args = TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type), 1);
12911 /* Instantiate the template. */
12912 type = lookup_template_class (tmpl, args, NULL_TREE, NULL_TREE,
12913 /*entering_scope=*/0, tf_error | tf_user);
12916 type = error_mark_node;
12917 /* Qualify the resulting type. */
12918 if (type != error_mark_node && quals)
12919 type = cp_build_qualified_type (type, quals);
12920 /* Leave the SCOPE. */
12922 pop_scope (pushed_scope);
12927 /* EXPR is an expression which is not type-dependent. Return a proxy
12928 for EXPR that can be used to compute the types of larger
12929 expressions containing EXPR. */
12932 build_non_dependent_expr (tree expr)
12936 /* Preserve null pointer constants so that the type of things like
12937 "p == 0" where "p" is a pointer can be determined. */
12938 if (null_ptr_cst_p (expr))
12940 /* Preserve OVERLOADs; the functions must be available to resolve
12943 if (TREE_CODE (inner_expr) == ADDR_EXPR)
12944 inner_expr = TREE_OPERAND (inner_expr, 0);
12945 if (TREE_CODE (inner_expr) == COMPONENT_REF)
12946 inner_expr = TREE_OPERAND (inner_expr, 1);
12947 if (is_overloaded_fn (inner_expr)
12948 || TREE_CODE (inner_expr) == OFFSET_REF)
12950 /* There is no need to return a proxy for a variable. */
12951 if (TREE_CODE (expr) == VAR_DECL)
12953 /* Preserve string constants; conversions from string constants to
12954 "char *" are allowed, even though normally a "const char *"
12955 cannot be used to initialize a "char *". */
12956 if (TREE_CODE (expr) == STRING_CST)
12958 /* Preserve arithmetic constants, as an optimization -- there is no
12959 reason to create a new node. */
12960 if (TREE_CODE (expr) == INTEGER_CST || TREE_CODE (expr) == REAL_CST)
12962 /* Preserve THROW_EXPRs -- all throw-expressions have type "void".
12963 There is at least one place where we want to know that a
12964 particular expression is a throw-expression: when checking a ?:
12965 expression, there are special rules if the second or third
12966 argument is a throw-expression. */
12967 if (TREE_CODE (expr) == THROW_EXPR)
12970 if (TREE_CODE (expr) == COND_EXPR)
12971 return build3 (COND_EXPR,
12973 TREE_OPERAND (expr, 0),
12974 (TREE_OPERAND (expr, 1)
12975 ? build_non_dependent_expr (TREE_OPERAND (expr, 1))
12976 : build_non_dependent_expr (TREE_OPERAND (expr, 0))),
12977 build_non_dependent_expr (TREE_OPERAND (expr, 2)));
12978 if (TREE_CODE (expr) == COMPOUND_EXPR
12979 && !COMPOUND_EXPR_OVERLOADED (expr))
12980 return build2 (COMPOUND_EXPR,
12982 TREE_OPERAND (expr, 0),
12983 build_non_dependent_expr (TREE_OPERAND (expr, 1)));
12985 /* If the type is unknown, it can't really be non-dependent */
12986 gcc_assert (TREE_TYPE (expr) != unknown_type_node);
12988 /* Otherwise, build a NON_DEPENDENT_EXPR.
12990 REFERENCE_TYPEs are not stripped for expressions in templates
12991 because doing so would play havoc with mangling. Consider, for
12994 template <typename T> void f<T& g>() { g(); }
12996 In the body of "f", the expression for "g" will have
12997 REFERENCE_TYPE, even though the standard says that it should
12998 not. The reason is that we must preserve the syntactic form of
12999 the expression so that mangling (say) "f<g>" inside the body of
13000 "f" works out correctly. Therefore, the REFERENCE_TYPE is
13002 return build1 (NON_DEPENDENT_EXPR, non_reference (TREE_TYPE (expr)), expr);
13005 /* ARGS is a TREE_LIST of expressions as arguments to a function call.
13006 Return a new TREE_LIST with the various arguments replaced with
13007 equivalent non-dependent expressions. */
13010 build_non_dependent_args (tree args)
13015 new_args = NULL_TREE;
13016 for (a = args; a; a = TREE_CHAIN (a))
13017 new_args = tree_cons (NULL_TREE,
13018 build_non_dependent_expr (TREE_VALUE (a)),
13020 return nreverse (new_args);
13023 #include "gt-cp-pt.h"