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"
49 /* The type of functions taking a tree, and some additional data, and
51 typedef int (*tree_fn_t) (tree, void*);
53 /* The PENDING_TEMPLATES is a TREE_LIST of templates whose
54 instantiations have been deferred, either because their definitions
55 were not yet available, or because we were putting off doing the work.
56 The TREE_PURPOSE of each entry is either a DECL (for a function or
57 static data member), or a TYPE (for a class) indicating what we are
58 hoping to instantiate. The TREE_VALUE is not used. */
59 static GTY(()) tree pending_templates;
60 static GTY(()) tree last_pending_template;
62 int processing_template_parmlist;
63 static int template_header_count;
65 static GTY(()) tree saved_trees;
66 static GTY(()) varray_type inline_parm_levels;
67 static size_t inline_parm_levels_used;
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 void reopen_tinst_level (tree);
101 static tree classtype_mangled_name (tree);
102 static char* mangle_class_name_for_template (const char *, tree, tree);
103 static tree tsubst_initializer_list (tree, tree);
104 static tree get_class_bindings (tree, tree, tree);
105 static tree coerce_template_parms (tree, tree, tree, tsubst_flags_t, int);
106 static void tsubst_enum (tree, tree, tree);
107 static tree add_to_template_args (tree, tree);
108 static tree add_outermost_template_args (tree, tree);
109 static bool check_instantiated_args (tree, tree, tsubst_flags_t);
110 static int maybe_adjust_types_for_deduction (unification_kind_t, tree*, tree*);
111 static int type_unification_real (tree, tree, tree, tree,
112 int, unification_kind_t, int);
113 static void note_template_header (int);
114 static tree convert_nontype_argument_function (tree, tree);
115 static tree convert_nontype_argument (tree, tree);
116 static tree convert_template_argument (tree, tree, tree,
117 tsubst_flags_t, int, tree);
118 static int for_each_template_parm (tree, tree_fn_t, void*,
119 struct pointer_set_t*);
120 static tree build_template_parm_index (int, int, int, tree, tree);
121 static int inline_needs_template_parms (tree);
122 static void push_inline_template_parms_recursive (tree, int);
123 static tree retrieve_local_specialization (tree);
124 static void register_local_specialization (tree, tree);
125 static tree reduce_template_parm_level (tree, tree, int);
126 static int mark_template_parm (tree, void *);
127 static int template_parm_this_level_p (tree, void *);
128 static tree tsubst_friend_function (tree, tree);
129 static tree tsubst_friend_class (tree, tree);
130 static int can_complete_type_without_circularity (tree);
131 static tree get_bindings (tree, tree, tree, bool);
132 static int template_decl_level (tree);
133 static int check_cv_quals_for_unify (int, tree, tree);
134 static tree tsubst_template_arg (tree, tree, tsubst_flags_t, tree);
135 static tree tsubst_template_args (tree, tree, tsubst_flags_t, tree);
136 static tree tsubst_template_parms (tree, tree, tsubst_flags_t);
137 static void regenerate_decl_from_template (tree, tree);
138 static tree most_specialized (tree, tree, tree);
139 static tree most_specialized_class (tree, tree);
140 static tree tsubst_aggr_type (tree, tree, tsubst_flags_t, tree, int);
141 static tree tsubst_arg_types (tree, tree, tsubst_flags_t, tree);
142 static tree tsubst_function_type (tree, tree, tsubst_flags_t, tree);
143 static void check_specialization_scope (void);
144 static tree process_partial_specialization (tree);
145 static void set_current_access_from_decl (tree);
146 static void check_default_tmpl_args (tree, tree, int, int);
147 static tree get_template_base (tree, tree, tree, tree);
148 static int verify_class_unification (tree, tree, tree);
149 static tree try_class_unification (tree, tree, tree, tree);
150 static int coerce_template_template_parms (tree, tree, tsubst_flags_t,
152 static tree determine_specialization (tree, tree, tree *, int, int);
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 if (!inline_parm_levels)
399 VARRAY_INT_INIT (inline_parm_levels, 4, "inline_parm_levels");
400 if (inline_parm_levels_used == inline_parm_levels->num_elements)
401 VARRAY_GROW (inline_parm_levels, 2 * inline_parm_levels_used);
402 VARRAY_INT (inline_parm_levels, inline_parm_levels_used) = levels;
403 ++inline_parm_levels_used;
406 /* Undo the effects of maybe_begin_member_template_processing. */
409 maybe_end_member_template_processing (void)
413 if (!inline_parm_levels_used)
416 --inline_parm_levels_used;
418 i < VARRAY_INT (inline_parm_levels, inline_parm_levels_used);
421 --processing_template_decl;
422 current_template_parms = TREE_CHAIN (current_template_parms);
427 /* Return a new template argument vector which contains all of ARGS,
428 but has as its innermost set of arguments the EXTRA_ARGS. */
431 add_to_template_args (tree args, tree extra_args)
438 extra_depth = TMPL_ARGS_DEPTH (extra_args);
439 new_args = make_tree_vec (TMPL_ARGS_DEPTH (args) + extra_depth);
441 for (i = 1; i <= TMPL_ARGS_DEPTH (args); ++i)
442 SET_TMPL_ARGS_LEVEL (new_args, i, TMPL_ARGS_LEVEL (args, i));
444 for (j = 1; j <= extra_depth; ++j, ++i)
445 SET_TMPL_ARGS_LEVEL (new_args, i, TMPL_ARGS_LEVEL (extra_args, j));
450 /* Like add_to_template_args, but only the outermost ARGS are added to
451 the EXTRA_ARGS. In particular, all but TMPL_ARGS_DEPTH
452 (EXTRA_ARGS) levels are added. This function is used to combine
453 the template arguments from a partial instantiation with the
454 template arguments used to attain the full instantiation from the
455 partial instantiation. */
458 add_outermost_template_args (tree args, tree extra_args)
462 /* If there are more levels of EXTRA_ARGS than there are ARGS,
463 something very fishy is going on. */
464 gcc_assert (TMPL_ARGS_DEPTH (args) >= TMPL_ARGS_DEPTH (extra_args));
466 /* If *all* the new arguments will be the EXTRA_ARGS, just return
468 if (TMPL_ARGS_DEPTH (args) == TMPL_ARGS_DEPTH (extra_args))
471 /* For the moment, we make ARGS look like it contains fewer levels. */
472 TREE_VEC_LENGTH (args) -= TMPL_ARGS_DEPTH (extra_args);
474 new_args = add_to_template_args (args, extra_args);
476 /* Now, we restore ARGS to its full dimensions. */
477 TREE_VEC_LENGTH (args) += TMPL_ARGS_DEPTH (extra_args);
482 /* Return the N levels of innermost template arguments from the ARGS. */
485 get_innermost_template_args (tree args, int n)
493 /* If N is 1, just return the innermost set of template arguments. */
495 return TMPL_ARGS_LEVEL (args, TMPL_ARGS_DEPTH (args));
497 /* If we're not removing anything, just return the arguments we were
499 extra_levels = TMPL_ARGS_DEPTH (args) - n;
500 gcc_assert (extra_levels >= 0);
501 if (extra_levels == 0)
504 /* Make a new set of arguments, not containing the outer arguments. */
505 new_args = make_tree_vec (n);
506 for (i = 1; i <= n; ++i)
507 SET_TMPL_ARGS_LEVEL (new_args, i,
508 TMPL_ARGS_LEVEL (args, i + extra_levels));
513 /* We've got a template header coming up; push to a new level for storing
517 begin_template_parm_list (void)
519 /* We use a non-tag-transparent scope here, which causes pushtag to
520 put tags in this scope, rather than in the enclosing class or
521 namespace scope. This is the right thing, since we want
522 TEMPLATE_DECLS, and not TYPE_DECLS for template classes. For a
523 global template class, push_template_decl handles putting the
524 TEMPLATE_DECL into top-level scope. For a nested template class,
527 template <class T> struct S1 {
528 template <class T> struct S2 {};
531 pushtag contains special code to call pushdecl_with_scope on the
532 TEMPLATE_DECL for S2. */
533 begin_scope (sk_template_parms, NULL);
534 ++processing_template_decl;
535 ++processing_template_parmlist;
536 note_template_header (0);
539 /* This routine is called when a specialization is declared. If it is
540 invalid to declare a specialization here, an error is reported. */
543 check_specialization_scope (void)
545 tree scope = current_scope ();
549 An explicit specialization shall be declared in the namespace of
550 which the template is a member, or, for member templates, in the
551 namespace of which the enclosing class or enclosing class
552 template is a member. An explicit specialization of a member
553 function, member class or static data member of a class template
554 shall be declared in the namespace of which the class template
556 if (scope && TREE_CODE (scope) != NAMESPACE_DECL)
557 error ("explicit specialization in non-namespace scope %qD", scope);
561 In an explicit specialization declaration for a member of a class
562 template or a member template that appears in namespace scope,
563 the member template and some of its enclosing class templates may
564 remain unspecialized, except that the declaration shall not
565 explicitly specialize a class member template if its enclosing
566 class templates are not explicitly specialized as well. */
567 if (current_template_parms)
568 error ("enclosing class templates are not explicitly specialized");
571 /* We've just seen template <>. */
574 begin_specialization (void)
576 begin_scope (sk_template_spec, NULL);
577 note_template_header (1);
578 check_specialization_scope ();
581 /* Called at then end of processing a declaration preceded by
585 end_specialization (void)
588 reset_specialization ();
591 /* Any template <>'s that we have seen thus far are not referring to a
592 function specialization. */
595 reset_specialization (void)
597 processing_specialization = 0;
598 template_header_count = 0;
601 /* We've just seen a template header. If SPECIALIZATION is nonzero,
602 it was of the form template <>. */
605 note_template_header (int specialization)
607 processing_specialization = specialization;
608 template_header_count++;
611 /* We're beginning an explicit instantiation. */
614 begin_explicit_instantiation (void)
616 gcc_assert (!processing_explicit_instantiation);
617 processing_explicit_instantiation = true;
622 end_explicit_instantiation (void)
624 gcc_assert (processing_explicit_instantiation);
625 processing_explicit_instantiation = false;
628 /* An explicit specialization or partial specialization TMPL is being
629 declared. Check that the namespace in which the specialization is
630 occurring is permissible. Returns false iff it is invalid to
631 specialize TMPL in the current namespace. */
634 check_specialization_namespace (tree tmpl)
636 tree tpl_ns = decl_namespace_context (tmpl);
640 An explicit specialization shall be declared in the namespace of
641 which the template is a member, or, for member templates, in the
642 namespace of which the enclosing class or enclosing class
643 template is a member. An explicit specialization of a member
644 function, member class or static data member of a class template
645 shall be declared in the namespace of which the class template is
647 if (is_associated_namespace (current_namespace, tpl_ns))
648 /* Same or super-using namespace. */
652 pedwarn ("specialization of %qD in different namespace", tmpl);
653 pedwarn (" from definition of %q+#D", tmpl);
658 /* SPEC is an explicit instantiation. Check that it is valid to
659 perform this explicit instantiation in the current namespace. */
662 check_explicit_instantiation_namespace (tree spec)
666 /* DR 275: An explicit instantiation shall appear in an enclosing
667 namespace of its template. */
668 ns = decl_namespace_context (spec);
669 if (!is_ancestor (current_namespace, ns))
670 pedwarn ("explicit instantiation of %qD in namespace %qD "
671 "(which does not enclose namespace %qD)",
672 spec, current_namespace, ns);
675 /* The TYPE is being declared. If it is a template type, that means it
676 is a partial specialization. Do appropriate error-checking. */
679 maybe_process_partial_specialization (tree type)
681 /* TYPE maybe an ERROR_MARK_NODE. */
682 tree context = TYPE_P (type) ? TYPE_CONTEXT (type) : NULL_TREE;
684 if (CLASS_TYPE_P (type) && CLASSTYPE_USE_TEMPLATE (type))
686 /* This is for ordinary explicit specialization and partial
687 specialization of a template class such as:
689 template <> class C<int>;
693 template <class T> class C<T*>;
695 Make sure that `C<int>' and `C<T*>' are implicit instantiations. */
697 if (CLASSTYPE_IMPLICIT_INSTANTIATION (type)
698 && !COMPLETE_TYPE_P (type))
700 check_specialization_namespace (CLASSTYPE_TI_TEMPLATE (type));
701 SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (type);
702 if (processing_template_decl)
703 push_template_decl (TYPE_MAIN_DECL (type));
705 else if (CLASSTYPE_TEMPLATE_INSTANTIATION (type))
706 error ("specialization of %qT after instantiation", type);
708 else if (CLASS_TYPE_P (type)
709 && !CLASSTYPE_USE_TEMPLATE (type)
710 && CLASSTYPE_TEMPLATE_INFO (type)
711 && context && CLASS_TYPE_P (context)
712 && CLASSTYPE_TEMPLATE_INFO (context))
714 /* This is for an explicit specialization of member class
715 template according to [temp.expl.spec/18]:
717 template <> template <class U> class C<int>::D;
719 The context `C<int>' must be an implicit instantiation.
720 Otherwise this is just a member class template declared
723 template <> class C<int> { template <class U> class D; };
724 template <> template <class U> class C<int>::D;
726 In the first case, `C<int>::D' is a specialization of `C<T>::D'
727 while in the second case, `C<int>::D' is a primary template
728 and `C<T>::D' may not exist. */
730 if (CLASSTYPE_IMPLICIT_INSTANTIATION (context)
731 && !COMPLETE_TYPE_P (type))
735 if (current_namespace
736 != decl_namespace_context (CLASSTYPE_TI_TEMPLATE (type)))
738 pedwarn ("specializing %q#T in different namespace", type);
739 pedwarn (" from definition of %q+#D",
740 CLASSTYPE_TI_TEMPLATE (type));
743 /* Check for invalid specialization after instantiation:
745 template <> template <> class C<int>::D<int>;
746 template <> template <class U> class C<int>::D; */
748 for (t = DECL_TEMPLATE_INSTANTIATIONS
749 (most_general_template (CLASSTYPE_TI_TEMPLATE (type)));
750 t; t = TREE_CHAIN (t))
751 if (TREE_VALUE (t) != type
752 && TYPE_CONTEXT (TREE_VALUE (t)) == context)
753 error ("specialization %qT after instantiation %qT",
754 type, TREE_VALUE (t));
756 /* Mark TYPE as a specialization. And as a result, we only
757 have one level of template argument for the innermost
759 SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (type);
760 CLASSTYPE_TI_ARGS (type)
761 = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type));
764 else if (processing_specialization)
765 error ("explicit specialization of non-template %qT", type);
768 /* Returns nonzero if we can optimize the retrieval of specializations
769 for TMPL, a TEMPLATE_DECL. In particular, for such a template, we
770 do not use DECL_TEMPLATE_SPECIALIZATIONS at all. */
773 optimize_specialization_lookup_p (tree tmpl)
775 return (DECL_FUNCTION_TEMPLATE_P (tmpl)
776 && DECL_CLASS_SCOPE_P (tmpl)
777 /* DECL_CLASS_SCOPE_P holds of T::f even if T is a template
779 && CLASS_TYPE_P (DECL_CONTEXT (tmpl))
780 /* The optimized lookup depends on the fact that the
781 template arguments for the member function template apply
782 purely to the containing class, which is not true if the
783 containing class is an explicit or partial
785 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (tmpl))
786 && !DECL_MEMBER_TEMPLATE_P (tmpl)
787 && !DECL_CONV_FN_P (tmpl)
788 /* It is possible to have a template that is not a member
789 template and is not a member of a template class:
791 template <typename T>
792 struct S { friend A::f(); };
794 Here, the friend function is a template, but the context does
795 not have template information. The optimized lookup relies
796 on having ARGS be the template arguments for both the class
797 and the function template. */
798 && !DECL_FRIEND_P (DECL_TEMPLATE_RESULT (tmpl)));
801 /* Retrieve the specialization (in the sense of [temp.spec] - a
802 specialization is either an instantiation or an explicit
803 specialization) of TMPL for the given template ARGS. If there is
804 no such specialization, return NULL_TREE. The ARGS are a vector of
805 arguments, or a vector of vectors of arguments, in the case of
806 templates with more than one level of parameters.
808 If TMPL is a type template and CLASS_SPECIALIZATIONS_P is true,
809 then we search for a partial specialization matching ARGS. This
810 parameter is ignored if TMPL is not a class template. */
813 retrieve_specialization (tree tmpl, tree args,
814 bool class_specializations_p)
816 gcc_assert (TREE_CODE (tmpl) == TEMPLATE_DECL);
818 /* There should be as many levels of arguments as there are
819 levels of parameters. */
820 gcc_assert (TMPL_ARGS_DEPTH (args)
821 == TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl)));
823 if (optimize_specialization_lookup_p (tmpl))
826 tree class_specialization;
827 VEC(tree,gc) *methods;
831 /* The template arguments actually apply to the containing
832 class. Find the class specialization with those
834 class_template = CLASSTYPE_TI_TEMPLATE (DECL_CONTEXT (tmpl));
836 = retrieve_specialization (class_template, args,
837 /*class_specializations_p=*/false);
838 if (!class_specialization)
840 /* Now, find the appropriate entry in the CLASSTYPE_METHOD_VEC
841 for the specialization. */
842 idx = class_method_index_for_fn (class_specialization, tmpl);
845 /* Iterate through the methods with the indicated name, looking
846 for the one that has an instance of TMPL. */
847 methods = CLASSTYPE_METHOD_VEC (class_specialization);
848 for (fns = VEC_index (tree, methods, idx); fns; fns = OVL_NEXT (fns))
850 tree fn = OVL_CURRENT (fns);
851 if (DECL_TEMPLATE_INFO (fn) && DECL_TI_TEMPLATE (fn) == tmpl)
861 /* Class templates store their instantiations on the
862 DECL_TEMPLATE_INSTANTIATIONS list; other templates use the
863 DECL_TEMPLATE_SPECIALIZATIONS list. */
864 if (!class_specializations_p
865 && TREE_CODE (DECL_TEMPLATE_RESULT (tmpl)) == TYPE_DECL)
866 sp = &DECL_TEMPLATE_INSTANTIATIONS (tmpl);
868 sp = &DECL_TEMPLATE_SPECIALIZATIONS (tmpl);
870 /* Iterate through the list until we find a matching template. */
871 while (*sp != NULL_TREE)
875 if (comp_template_args (TREE_PURPOSE (spec), args))
877 /* Use the move-to-front heuristic to speed up future
881 *sp = TREE_CHAIN (*sp);
882 TREE_CHAIN (spec) = *head;
885 return TREE_VALUE (spec);
887 sp = &TREE_CHAIN (spec);
894 /* Like retrieve_specialization, but for local declarations. */
897 retrieve_local_specialization (tree tmpl)
899 tree spec = htab_find_with_hash (local_specializations, tmpl,
900 htab_hash_pointer (tmpl));
901 return spec ? TREE_PURPOSE (spec) : NULL_TREE;
904 /* Returns nonzero iff DECL is a specialization of TMPL. */
907 is_specialization_of (tree decl, tree tmpl)
911 if (TREE_CODE (decl) == FUNCTION_DECL)
915 t = DECL_TEMPLATE_INFO (t) ? DECL_TI_TEMPLATE (t) : NULL_TREE)
921 gcc_assert (TREE_CODE (decl) == TYPE_DECL);
923 for (t = TREE_TYPE (decl);
925 t = CLASSTYPE_USE_TEMPLATE (t)
926 ? TREE_TYPE (CLASSTYPE_TI_TEMPLATE (t)) : NULL_TREE)
927 if (same_type_ignoring_top_level_qualifiers_p (t, TREE_TYPE (tmpl)))
934 /* Returns nonzero iff DECL is a specialization of friend declaration
935 FRIEND according to [temp.friend]. */
938 is_specialization_of_friend (tree decl, tree friend)
940 bool need_template = true;
943 gcc_assert (TREE_CODE (decl) == FUNCTION_DECL
944 || TREE_CODE (decl) == TYPE_DECL);
946 /* For [temp.friend/6] when FRIEND is an ordinary member function
947 of a template class, we want to check if DECL is a specialization
949 if (TREE_CODE (friend) == FUNCTION_DECL
950 && DECL_TEMPLATE_INFO (friend)
951 && !DECL_USE_TEMPLATE (friend))
953 /* We want a TEMPLATE_DECL for `is_specialization_of'. */
954 friend = DECL_TI_TEMPLATE (friend);
955 need_template = false;
957 else if (TREE_CODE (friend) == TEMPLATE_DECL
958 && !PRIMARY_TEMPLATE_P (friend))
959 need_template = false;
961 /* There is nothing to do if this is not a template friend. */
962 if (TREE_CODE (friend) != TEMPLATE_DECL)
965 if (is_specialization_of (decl, friend))
969 A member of a class template may be declared to be a friend of a
970 non-template class. In this case, the corresponding member of
971 every specialization of the class template is a friend of the
972 class granting friendship.
974 For example, given a template friend declaration
976 template <class T> friend void A<T>::f();
978 the member function below is considered a friend
980 template <> struct A<int> {
984 For this type of template friend, TEMPLATE_DEPTH below will be
985 nonzero. To determine if DECL is a friend of FRIEND, we first
986 check if the enclosing class is a specialization of another. */
988 template_depth = template_class_depth (DECL_CONTEXT (friend));
990 && DECL_CLASS_SCOPE_P (decl)
991 && is_specialization_of (TYPE_NAME (DECL_CONTEXT (decl)),
992 CLASSTYPE_TI_TEMPLATE (DECL_CONTEXT (friend))))
994 /* Next, we check the members themselves. In order to handle
995 a few tricky cases, such as when FRIEND's are
997 template <class T> friend void A<T>::g(T t);
998 template <class T> template <T t> friend void A<T>::h();
1002 void A<int>::g(int);
1003 template <int> void A<int>::h();
1005 we need to figure out ARGS, the template arguments from
1006 the context of DECL. This is required for template substitution
1007 of `T' in the function parameter of `g' and template parameter
1008 of `h' in the above examples. Here ARGS corresponds to `int'. */
1010 tree context = DECL_CONTEXT (decl);
1011 tree args = NULL_TREE;
1012 int current_depth = 0;
1014 while (current_depth < template_depth)
1016 if (CLASSTYPE_TEMPLATE_INFO (context))
1018 if (current_depth == 0)
1019 args = TYPE_TI_ARGS (context);
1021 args = add_to_template_args (TYPE_TI_ARGS (context), args);
1024 context = TYPE_CONTEXT (context);
1027 if (TREE_CODE (decl) == FUNCTION_DECL)
1032 tree friend_args_type;
1033 tree decl_args_type;
1035 /* Make sure that both DECL and FRIEND are templates or
1037 is_template = DECL_TEMPLATE_INFO (decl)
1038 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl));
1039 if (need_template ^ is_template)
1041 else if (is_template)
1043 /* If both are templates, check template parameter list. */
1045 = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend),
1047 if (!comp_template_parms
1048 (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (decl)),
1052 decl_type = TREE_TYPE (DECL_TI_TEMPLATE (decl));
1055 decl_type = TREE_TYPE (decl);
1057 friend_type = tsubst_function_type (TREE_TYPE (friend), args,
1058 tf_none, NULL_TREE);
1059 if (friend_type == error_mark_node)
1062 /* Check if return types match. */
1063 if (!same_type_p (TREE_TYPE (decl_type), TREE_TYPE (friend_type)))
1066 /* Check if function parameter types match, ignoring the
1067 `this' parameter. */
1068 friend_args_type = TYPE_ARG_TYPES (friend_type);
1069 decl_args_type = TYPE_ARG_TYPES (decl_type);
1070 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (friend))
1071 friend_args_type = TREE_CHAIN (friend_args_type);
1072 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl))
1073 decl_args_type = TREE_CHAIN (decl_args_type);
1075 return compparms (decl_args_type, friend_args_type);
1079 /* DECL is a TYPE_DECL */
1081 tree decl_type = TREE_TYPE (decl);
1083 /* Make sure that both DECL and FRIEND are templates or
1086 = CLASSTYPE_TEMPLATE_INFO (decl_type)
1087 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (decl_type));
1089 if (need_template ^ is_template)
1091 else if (is_template)
1094 /* If both are templates, check the name of the two
1095 TEMPLATE_DECL's first because is_friend didn't. */
1096 if (DECL_NAME (CLASSTYPE_TI_TEMPLATE (decl_type))
1097 != DECL_NAME (friend))
1100 /* Now check template parameter list. */
1102 = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend),
1104 return comp_template_parms
1105 (DECL_TEMPLATE_PARMS (CLASSTYPE_TI_TEMPLATE (decl_type)),
1109 return (DECL_NAME (decl)
1110 == DECL_NAME (friend));
1116 /* Register the specialization SPEC as a specialization of TMPL with
1117 the indicated ARGS. IS_FRIEND indicates whether the specialization
1118 is actually just a friend declaration. Returns SPEC, or an
1119 equivalent prior declaration, if available. */
1122 register_specialization (tree spec, tree tmpl, tree args, bool is_friend)
1126 gcc_assert (TREE_CODE (tmpl) == TEMPLATE_DECL);
1128 if (TREE_CODE (spec) == FUNCTION_DECL
1129 && uses_template_parms (DECL_TI_ARGS (spec)))
1130 /* This is the FUNCTION_DECL for a partial instantiation. Don't
1131 register it; we want the corresponding TEMPLATE_DECL instead.
1132 We use `uses_template_parms (DECL_TI_ARGS (spec))' rather than
1133 the more obvious `uses_template_parms (spec)' to avoid problems
1134 with default function arguments. In particular, given
1135 something like this:
1137 template <class T> void f(T t1, T t = T())
1139 the default argument expression is not substituted for in an
1140 instantiation unless and until it is actually needed. */
1143 fn = retrieve_specialization (tmpl, args,
1144 /*class_specializations_p=*/false);
1145 /* We can sometimes try to re-register a specialization that we've
1146 already got. In particular, regenerate_decl_from_template calls
1147 duplicate_decls which will update the specialization list. But,
1148 we'll still get called again here anyhow. It's more convenient
1149 to simply allow this than to try to prevent it. */
1152 else if (fn && DECL_TEMPLATE_SPECIALIZATION (spec))
1154 if (DECL_TEMPLATE_INSTANTIATION (fn))
1157 || DECL_EXPLICIT_INSTANTIATION (fn))
1159 error ("specialization of %qD after instantiation",
1166 /* This situation should occur only if the first
1167 specialization is an implicit instantiation, the
1168 second is an explicit specialization, and the
1169 implicit instantiation has not yet been used. That
1170 situation can occur if we have implicitly
1171 instantiated a member function and then specialized
1174 We can also wind up here if a friend declaration that
1175 looked like an instantiation turns out to be a
1178 template <class T> void foo(T);
1179 class S { friend void foo<>(int) };
1180 template <> void foo(int);
1182 We transform the existing DECL in place so that any
1183 pointers to it become pointers to the updated
1186 If there was a definition for the template, but not
1187 for the specialization, we want this to look as if
1188 there were no definition, and vice versa. */
1189 DECL_INITIAL (fn) = NULL_TREE;
1190 duplicate_decls (spec, fn, is_friend);
1191 /* The call to duplicate_decls will have applied
1194 An explicit specialization of a function template
1195 is inline only if it is explicitly declared to be,
1196 and independently of whether its function template
1199 to the primary function; now copy the inline bits to
1200 the various clones. */
1201 FOR_EACH_CLONE (clone, fn)
1203 DECL_DECLARED_INLINE_P (clone)
1204 = DECL_DECLARED_INLINE_P (fn);
1208 check_specialization_namespace (fn);
1213 else if (DECL_TEMPLATE_SPECIALIZATION (fn))
1215 if (!duplicate_decls (spec, fn, is_friend) && DECL_INITIAL (spec))
1216 /* Dup decl failed, but this is a new definition. Set the
1217 line number so any errors match this new
1219 DECL_SOURCE_LOCATION (fn) = DECL_SOURCE_LOCATION (spec);
1225 /* A specialization must be declared in the same namespace as the
1226 template it is specializing. */
1227 if (DECL_TEMPLATE_SPECIALIZATION (spec)
1228 && !check_specialization_namespace (tmpl))
1229 DECL_CONTEXT (spec) = decl_namespace_context (tmpl);
1231 if (!optimize_specialization_lookup_p (tmpl))
1232 DECL_TEMPLATE_SPECIALIZATIONS (tmpl)
1233 = tree_cons (args, spec, DECL_TEMPLATE_SPECIALIZATIONS (tmpl));
1238 /* Unregister the specialization SPEC as a specialization of TMPL.
1239 Replace it with NEW_SPEC, if NEW_SPEC is non-NULL. Returns true
1240 if the SPEC was listed as a specialization of TMPL. */
1243 reregister_specialization (tree spec, tree tmpl, tree new_spec)
1247 for (s = &DECL_TEMPLATE_SPECIALIZATIONS (tmpl);
1249 s = &TREE_CHAIN (*s))
1250 if (TREE_VALUE (*s) == spec)
1253 *s = TREE_CHAIN (*s);
1255 TREE_VALUE (*s) = new_spec;
1262 /* Compare an entry in the local specializations hash table P1 (which
1263 is really a pointer to a TREE_LIST) with P2 (which is really a
1267 eq_local_specializations (const void *p1, const void *p2)
1269 return TREE_VALUE ((tree) p1) == (tree) p2;
1272 /* Hash P1, an entry in the local specializations table. */
1275 hash_local_specialization (const void* p1)
1277 return htab_hash_pointer (TREE_VALUE ((tree) p1));
1280 /* Like register_specialization, but for local declarations. We are
1281 registering SPEC, an instantiation of TMPL. */
1284 register_local_specialization (tree spec, tree tmpl)
1288 slot = htab_find_slot_with_hash (local_specializations, tmpl,
1289 htab_hash_pointer (tmpl), INSERT);
1290 *slot = build_tree_list (spec, tmpl);
1293 /* Print the list of candidate FNS in an error message. */
1296 print_candidates (tree fns)
1300 const char *str = "candidates are:";
1302 for (fn = fns; fn != NULL_TREE; fn = TREE_CHAIN (fn))
1306 for (f = TREE_VALUE (fn); f; f = OVL_NEXT (f))
1307 error ("%s %+#D", str, OVL_CURRENT (f));
1312 /* Returns the template (one of the functions given by TEMPLATE_ID)
1313 which can be specialized to match the indicated DECL with the
1314 explicit template args given in TEMPLATE_ID. The DECL may be
1315 NULL_TREE if none is available. In that case, the functions in
1316 TEMPLATE_ID are non-members.
1318 If NEED_MEMBER_TEMPLATE is nonzero the function is known to be a
1319 specialization of a member template.
1321 The TEMPLATE_COUNT is the number of references to qualifying
1322 template classes that appeared in the name of the function. See
1323 check_explicit_specialization for a more accurate description.
1325 The template args (those explicitly specified and those deduced)
1326 are output in a newly created vector *TARGS_OUT.
1328 If it is impossible to determine the result, an error message is
1329 issued. The error_mark_node is returned to indicate failure. */
1332 determine_specialization (tree template_id,
1335 int need_member_template,
1340 tree explicit_targs;
1341 tree candidates = NULL_TREE;
1342 tree templates = NULL_TREE;
1344 struct cp_binding_level *b;
1346 *targs_out = NULL_TREE;
1348 if (template_id == error_mark_node)
1349 return error_mark_node;
1351 fns = TREE_OPERAND (template_id, 0);
1352 explicit_targs = TREE_OPERAND (template_id, 1);
1354 if (fns == error_mark_node)
1355 return error_mark_node;
1357 /* Check for baselinks. */
1358 if (BASELINK_P (fns))
1359 fns = BASELINK_FUNCTIONS (fns);
1361 if (!is_overloaded_fn (fns))
1363 error ("%qD is not a function template", fns);
1364 return error_mark_node;
1367 /* Count the number of template headers specified for this
1370 for (b = current_binding_level;
1371 b->kind == sk_template_parms;
1375 for (; fns; fns = OVL_NEXT (fns))
1377 tree fn = OVL_CURRENT (fns);
1379 if (TREE_CODE (fn) == TEMPLATE_DECL)
1381 tree decl_arg_types;
1384 /* DECL might be a specialization of FN. */
1386 /* Adjust the type of DECL in case FN is a static member. */
1387 decl_arg_types = TYPE_ARG_TYPES (TREE_TYPE (decl));
1388 if (DECL_STATIC_FUNCTION_P (fn)
1389 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl))
1390 decl_arg_types = TREE_CHAIN (decl_arg_types);
1392 /* Check that the number of function parameters matches.
1394 template <class T> void f(int i = 0);
1395 template <> void f<int>();
1396 The specialization f<int> is invalid but is not caught
1397 by get_bindings below. */
1399 fn_arg_types = TYPE_ARG_TYPES (TREE_TYPE (fn));
1400 if (list_length (fn_arg_types) != list_length (decl_arg_types))
1403 /* For a non-static member function, we need to make sure that
1404 the const qualification is the same. This can be done by
1405 checking the 'this' in the argument list. */
1406 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn)
1407 && !same_type_p (TREE_VALUE (fn_arg_types),
1408 TREE_VALUE (decl_arg_types)))
1411 /* In case of explicit specialization, we need to check if
1412 the number of template headers appearing in the specialization
1413 is correct. This is usually done in check_explicit_specialization,
1414 but the check done there cannot be exhaustive when specializing
1415 member functions. Consider the following code:
1417 template <> void A<int>::f(int);
1418 template <> template <> void A<int>::f(int);
1420 Assuming that A<int> is not itself an explicit specialization
1421 already, the first line specializes "f" which is a non-template
1422 member function, whilst the second line specializes "f" which
1423 is a template member function. So both lines are syntactically
1424 correct, and check_explicit_specialization does not reject
1427 Here, we can do better, as we are matching the specialization
1428 against the declarations. We count the number of template
1429 headers, and we check if they match TEMPLATE_COUNT + 1
1430 (TEMPLATE_COUNT is the number of qualifying template classes,
1431 plus there must be another header for the member template
1434 Notice that if header_count is zero, this is not a
1435 specialization but rather a template instantiation, so there
1436 is no check we can perform here. */
1437 if (header_count && header_count != template_count + 1)
1440 /* Check that the number of template arguments at the
1441 innermost level for DECL is the same as for FN. */
1442 if (current_binding_level->kind == sk_template_parms
1443 && !current_binding_level->explicit_spec_p
1444 && (TREE_VEC_LENGTH (DECL_INNERMOST_TEMPLATE_PARMS (fn))
1445 != TREE_VEC_LENGTH (TREE_VALUE (current_template_parms))))
1448 /* See whether this function might be a specialization of this
1450 targs = get_bindings (fn, decl, explicit_targs, /*check_ret=*/true);
1453 /* We cannot deduce template arguments that when used to
1454 specialize TMPL will produce DECL. */
1457 /* Save this template, and the arguments deduced. */
1458 templates = tree_cons (targs, fn, templates);
1460 else if (need_member_template)
1461 /* FN is an ordinary member function, and we need a
1462 specialization of a member template. */
1464 else if (TREE_CODE (fn) != FUNCTION_DECL)
1465 /* We can get IDENTIFIER_NODEs here in certain erroneous
1468 else if (!DECL_FUNCTION_MEMBER_P (fn))
1469 /* This is just an ordinary non-member function. Nothing can
1470 be a specialization of that. */
1472 else if (DECL_ARTIFICIAL (fn))
1473 /* Cannot specialize functions that are created implicitly. */
1477 tree decl_arg_types;
1479 /* This is an ordinary member function. However, since
1480 we're here, we can assume it's enclosing class is a
1481 template class. For example,
1483 template <typename T> struct S { void f(); };
1484 template <> void S<int>::f() {}
1486 Here, S<int>::f is a non-template, but S<int> is a
1487 template class. If FN has the same type as DECL, we
1488 might be in business. */
1490 if (!DECL_TEMPLATE_INFO (fn))
1491 /* Its enclosing class is an explicit specialization
1492 of a template class. This is not a candidate. */
1495 if (!same_type_p (TREE_TYPE (TREE_TYPE (decl)),
1496 TREE_TYPE (TREE_TYPE (fn))))
1497 /* The return types differ. */
1500 /* Adjust the type of DECL in case FN is a static member. */
1501 decl_arg_types = TYPE_ARG_TYPES (TREE_TYPE (decl));
1502 if (DECL_STATIC_FUNCTION_P (fn)
1503 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl))
1504 decl_arg_types = TREE_CHAIN (decl_arg_types);
1506 if (compparms (TYPE_ARG_TYPES (TREE_TYPE (fn)),
1509 candidates = tree_cons (NULL_TREE, fn, candidates);
1513 if (templates && TREE_CHAIN (templates))
1519 It is possible for a specialization with a given function
1520 signature to be instantiated from more than one function
1521 template. In such cases, explicit specification of the
1522 template arguments must be used to uniquely identify the
1523 function template specialization being specialized.
1525 Note that here, there's no suggestion that we're supposed to
1526 determine which of the candidate templates is most
1527 specialized. However, we, also have:
1531 Partial ordering of overloaded function template
1532 declarations is used in the following contexts to select
1533 the function template to which a function template
1534 specialization refers:
1536 -- when an explicit specialization refers to a function
1539 So, we do use the partial ordering rules, at least for now.
1540 This extension can only serve to make invalid programs valid,
1541 so it's safe. And, there is strong anecdotal evidence that
1542 the committee intended the partial ordering rules to apply;
1543 the EDG front-end has that behavior, and John Spicer claims
1544 that the committee simply forgot to delete the wording in
1545 [temp.expl.spec]. */
1546 tree tmpl = most_specialized (templates, decl, explicit_targs);
1547 if (tmpl && tmpl != error_mark_node)
1549 targs = get_bindings (tmpl, decl, explicit_targs, /*check_ret=*/true);
1550 templates = tree_cons (targs, tmpl, NULL_TREE);
1554 if (templates == NULL_TREE && candidates == NULL_TREE)
1556 error ("template-id %qD for %q+D does not match any template "
1557 "declaration", template_id, decl);
1558 return error_mark_node;
1560 else if ((templates && TREE_CHAIN (templates))
1561 || (candidates && TREE_CHAIN (candidates))
1562 || (templates && candidates))
1564 error ("ambiguous template specialization %qD for %q+D",
1566 chainon (candidates, templates);
1567 print_candidates (candidates);
1568 return error_mark_node;
1571 /* We have one, and exactly one, match. */
1574 /* It was a specialization of an ordinary member function in a
1576 *targs_out = copy_node (DECL_TI_ARGS (TREE_VALUE (candidates)));
1577 return DECL_TI_TEMPLATE (TREE_VALUE (candidates));
1580 /* It was a specialization of a template. */
1581 targs = DECL_TI_ARGS (DECL_TEMPLATE_RESULT (TREE_VALUE (templates)));
1582 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (targs))
1584 *targs_out = copy_node (targs);
1585 SET_TMPL_ARGS_LEVEL (*targs_out,
1586 TMPL_ARGS_DEPTH (*targs_out),
1587 TREE_PURPOSE (templates));
1590 *targs_out = TREE_PURPOSE (templates);
1591 return TREE_VALUE (templates);
1594 /* Returns a chain of parameter types, exactly like the SPEC_TYPES,
1595 but with the default argument values filled in from those in the
1599 copy_default_args_to_explicit_spec_1 (tree spec_types,
1602 tree new_spec_types;
1607 if (spec_types == void_list_node)
1608 return void_list_node;
1610 /* Substitute into the rest of the list. */
1612 copy_default_args_to_explicit_spec_1 (TREE_CHAIN (spec_types),
1613 TREE_CHAIN (tmpl_types));
1615 /* Add the default argument for this parameter. */
1616 return hash_tree_cons (TREE_PURPOSE (tmpl_types),
1617 TREE_VALUE (spec_types),
1621 /* DECL is an explicit specialization. Replicate default arguments
1622 from the template it specializes. (That way, code like:
1624 template <class T> void f(T = 3);
1625 template <> void f(double);
1628 works, as required.) An alternative approach would be to look up
1629 the correct default arguments at the call-site, but this approach
1630 is consistent with how implicit instantiations are handled. */
1633 copy_default_args_to_explicit_spec (tree decl)
1638 tree new_spec_types;
1642 tree object_type = NULL_TREE;
1643 tree in_charge = NULL_TREE;
1644 tree vtt = NULL_TREE;
1646 /* See if there's anything we need to do. */
1647 tmpl = DECL_TI_TEMPLATE (decl);
1648 tmpl_types = TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (tmpl)));
1649 for (t = tmpl_types; t; t = TREE_CHAIN (t))
1650 if (TREE_PURPOSE (t))
1655 old_type = TREE_TYPE (decl);
1656 spec_types = TYPE_ARG_TYPES (old_type);
1658 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl))
1660 /* Remove the this pointer, but remember the object's type for
1662 object_type = TREE_TYPE (TREE_VALUE (spec_types));
1663 spec_types = TREE_CHAIN (spec_types);
1664 tmpl_types = TREE_CHAIN (tmpl_types);
1666 if (DECL_HAS_IN_CHARGE_PARM_P (decl))
1668 /* DECL may contain more parameters than TMPL due to the extra
1669 in-charge parameter in constructors and destructors. */
1670 in_charge = spec_types;
1671 spec_types = TREE_CHAIN (spec_types);
1673 if (DECL_HAS_VTT_PARM_P (decl))
1676 spec_types = TREE_CHAIN (spec_types);
1680 /* Compute the merged default arguments. */
1682 copy_default_args_to_explicit_spec_1 (spec_types, tmpl_types);
1684 /* Compute the new FUNCTION_TYPE. */
1688 new_spec_types = hash_tree_cons (TREE_PURPOSE (vtt),
1693 /* Put the in-charge parameter back. */
1694 new_spec_types = hash_tree_cons (TREE_PURPOSE (in_charge),
1695 TREE_VALUE (in_charge),
1698 new_type = build_method_type_directly (object_type,
1699 TREE_TYPE (old_type),
1703 new_type = build_function_type (TREE_TYPE (old_type),
1705 new_type = cp_build_type_attribute_variant (new_type,
1706 TYPE_ATTRIBUTES (old_type));
1707 new_type = build_exception_variant (new_type,
1708 TYPE_RAISES_EXCEPTIONS (old_type));
1709 TREE_TYPE (decl) = new_type;
1712 /* Check to see if the function just declared, as indicated in
1713 DECLARATOR, and in DECL, is a specialization of a function
1714 template. We may also discover that the declaration is an explicit
1715 instantiation at this point.
1717 Returns DECL, or an equivalent declaration that should be used
1718 instead if all goes well. Issues an error message if something is
1719 amiss. Returns error_mark_node if the error is not easily
1722 FLAGS is a bitmask consisting of the following flags:
1724 2: The function has a definition.
1725 4: The function is a friend.
1727 The TEMPLATE_COUNT is the number of references to qualifying
1728 template classes that appeared in the name of the function. For
1731 template <class T> struct S { void f(); };
1734 the TEMPLATE_COUNT would be 1. However, explicitly specialized
1735 classes are not counted in the TEMPLATE_COUNT, so that in
1737 template <class T> struct S {};
1738 template <> struct S<int> { void f(); }
1739 template <> void S<int>::f();
1741 the TEMPLATE_COUNT would be 0. (Note that this declaration is
1742 invalid; there should be no template <>.)
1744 If the function is a specialization, it is marked as such via
1745 DECL_TEMPLATE_SPECIALIZATION. Furthermore, its DECL_TEMPLATE_INFO
1746 is set up correctly, and it is added to the list of specializations
1747 for that template. */
1750 check_explicit_specialization (tree declarator,
1755 int have_def = flags & 2;
1756 int is_friend = flags & 4;
1757 int specialization = 0;
1758 int explicit_instantiation = 0;
1759 int member_specialization = 0;
1760 tree ctype = DECL_CLASS_CONTEXT (decl);
1761 tree dname = DECL_NAME (decl);
1766 if (!processing_specialization)
1769 tsk = tsk_excessive_parms;
1772 tsk = current_tmpl_spec_kind (template_count);
1777 if (processing_specialization)
1780 SET_DECL_TEMPLATE_SPECIALIZATION (decl);
1782 else if (TREE_CODE (declarator) == TEMPLATE_ID_EXPR)
1785 /* This could be something like:
1787 template <class T> void f(T);
1788 class S { friend void f<>(int); } */
1792 /* This case handles bogus declarations like template <>
1793 template <class T> void f<int>(); */
1795 error ("template-id %qD in declaration of primary template",
1802 case tsk_invalid_member_spec:
1803 /* The error has already been reported in
1804 check_specialization_scope. */
1805 return error_mark_node;
1807 case tsk_invalid_expl_inst:
1808 error ("template parameter list used in explicit instantiation");
1814 error ("definition provided for explicit instantiation");
1816 explicit_instantiation = 1;
1819 case tsk_excessive_parms:
1820 case tsk_insufficient_parms:
1821 if (tsk == tsk_excessive_parms)
1822 error ("too many template parameter lists in declaration of %qD",
1824 else if (template_header_count)
1825 error("too few template parameter lists in declaration of %qD", decl);
1827 error("explicit specialization of %qD must be introduced by "
1828 "%<template <>%>", decl);
1832 SET_DECL_TEMPLATE_SPECIALIZATION (decl);
1834 member_specialization = 1;
1840 if (TREE_CODE (declarator) == TEMPLATE_ID_EXPR)
1842 /* This case handles bogus declarations like template <>
1843 template <class T> void f<int>(); */
1845 if (uses_template_parms (declarator))
1846 error ("function template partial specialization %qD "
1847 "is not allowed", declarator);
1849 error ("template-id %qD in declaration of primary template",
1854 if (ctype && CLASSTYPE_TEMPLATE_INSTANTIATION (ctype))
1855 /* This is a specialization of a member template, without
1856 specialization the containing class. Something like:
1858 template <class T> struct S {
1859 template <class U> void f (U);
1861 template <> template <class U> void S<int>::f(U) {}
1863 That's a specialization -- but of the entire template. */
1871 if (specialization || member_specialization)
1873 tree t = TYPE_ARG_TYPES (TREE_TYPE (decl));
1874 for (; t; t = TREE_CHAIN (t))
1875 if (TREE_PURPOSE (t))
1878 ("default argument specified in explicit specialization");
1883 if (specialization || member_specialization || explicit_instantiation)
1885 tree tmpl = NULL_TREE;
1886 tree targs = NULL_TREE;
1888 /* Make sure that the declarator is a TEMPLATE_ID_EXPR. */
1889 if (TREE_CODE (declarator) != TEMPLATE_ID_EXPR)
1893 gcc_assert (TREE_CODE (declarator) == IDENTIFIER_NODE);
1898 /* If there is no class context, the explicit instantiation
1899 must be at namespace scope. */
1900 gcc_assert (DECL_NAMESPACE_SCOPE_P (decl));
1902 /* Find the namespace binding, using the declaration
1904 fns = lookup_qualified_name (current_namespace, dname,
1906 if (!fns || !is_overloaded_fn (fns))
1908 error ("%qD is not a template function", dname);
1909 fns = error_mark_node;
1913 tree fn = OVL_CURRENT (fns);
1914 if (!is_associated_namespace (current_namespace, DECL_CONTEXT (fn)))
1915 error ("%qD is not declared in %qD", decl, current_namespace);
1919 declarator = lookup_template_function (fns, NULL_TREE);
1922 if (declarator == error_mark_node)
1923 return error_mark_node;
1925 if (ctype != NULL_TREE && TYPE_BEING_DEFINED (ctype))
1927 if (!explicit_instantiation)
1928 /* A specialization in class scope. This is invalid,
1929 but the error will already have been flagged by
1930 check_specialization_scope. */
1931 return error_mark_node;
1934 /* It's not valid to write an explicit instantiation in
1937 class C { template void f(); }
1939 This case is caught by the parser. However, on
1942 template class C { void f(); };
1944 (which is invalid) we can get here. The error will be
1951 else if (ctype != NULL_TREE
1952 && (TREE_CODE (TREE_OPERAND (declarator, 0)) ==
1955 /* Find the list of functions in ctype that have the same
1956 name as the declared function. */
1957 tree name = TREE_OPERAND (declarator, 0);
1958 tree fns = NULL_TREE;
1961 if (constructor_name_p (name, ctype))
1963 int is_constructor = DECL_CONSTRUCTOR_P (decl);
1965 if (is_constructor ? !TYPE_HAS_CONSTRUCTOR (ctype)
1966 : !CLASSTYPE_DESTRUCTORS (ctype))
1968 /* From [temp.expl.spec]:
1970 If such an explicit specialization for the member
1971 of a class template names an implicitly-declared
1972 special member function (clause _special_), the
1973 program is ill-formed.
1975 Similar language is found in [temp.explicit]. */
1976 error ("specialization of implicitly-declared special member function");
1977 return error_mark_node;
1980 name = is_constructor ? ctor_identifier : dtor_identifier;
1983 if (!DECL_CONV_FN_P (decl))
1985 idx = lookup_fnfields_1 (ctype, name);
1987 fns = VEC_index (tree, CLASSTYPE_METHOD_VEC (ctype), idx);
1991 VEC(tree,gc) *methods;
1994 /* For a type-conversion operator, we cannot do a
1995 name-based lookup. We might be looking for `operator
1996 int' which will be a specialization of `operator T'.
1997 So, we find *all* the conversion operators, and then
1998 select from them. */
2001 methods = CLASSTYPE_METHOD_VEC (ctype);
2003 for (idx = CLASSTYPE_FIRST_CONVERSION_SLOT;
2004 VEC_iterate (tree, methods, idx, ovl);
2007 if (!DECL_CONV_FN_P (OVL_CURRENT (ovl)))
2008 /* There are no more conversion functions. */
2011 /* Glue all these conversion functions together
2012 with those we already have. */
2013 for (; ovl; ovl = OVL_NEXT (ovl))
2014 fns = ovl_cons (OVL_CURRENT (ovl), fns);
2018 if (fns == NULL_TREE)
2020 error ("no member function %qD declared in %qT", name, ctype);
2021 return error_mark_node;
2024 TREE_OPERAND (declarator, 0) = fns;
2027 /* Figure out what exactly is being specialized at this point.
2028 Note that for an explicit instantiation, even one for a
2029 member function, we cannot tell apriori whether the
2030 instantiation is for a member template, or just a member
2031 function of a template class. Even if a member template is
2032 being instantiated, the member template arguments may be
2033 elided if they can be deduced from the rest of the
2035 tmpl = determine_specialization (declarator, decl,
2037 member_specialization,
2040 if (!tmpl || tmpl == error_mark_node)
2041 /* We couldn't figure out what this declaration was
2043 return error_mark_node;
2046 tree gen_tmpl = most_general_template (tmpl);
2048 if (explicit_instantiation)
2050 /* We don't set DECL_EXPLICIT_INSTANTIATION here; that
2051 is done by do_decl_instantiation later. */
2053 int arg_depth = TMPL_ARGS_DEPTH (targs);
2054 int parm_depth = TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl));
2056 if (arg_depth > parm_depth)
2058 /* If TMPL is not the most general template (for
2059 example, if TMPL is a friend template that is
2060 injected into namespace scope), then there will
2061 be too many levels of TARGS. Remove some of them
2066 new_targs = make_tree_vec (parm_depth);
2067 for (i = arg_depth - parm_depth; i < arg_depth; ++i)
2068 TREE_VEC_ELT (new_targs, i - (arg_depth - parm_depth))
2069 = TREE_VEC_ELT (targs, i);
2073 return instantiate_template (tmpl, targs, tf_error);
2076 /* If we thought that the DECL was a member function, but it
2077 turns out to be specializing a static member function,
2078 make DECL a static member function as well. */
2079 if (DECL_STATIC_FUNCTION_P (tmpl)
2080 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl))
2081 revert_static_member_fn (decl);
2083 /* If this is a specialization of a member template of a
2084 template class. In we want to return the TEMPLATE_DECL,
2085 not the specialization of it. */
2086 if (tsk == tsk_template)
2088 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl);
2089 DECL_INITIAL (DECL_TEMPLATE_RESULT (tmpl)) = NULL_TREE;
2092 DECL_SOURCE_LOCATION (tmpl) = DECL_SOURCE_LOCATION (decl);
2093 DECL_SOURCE_LOCATION (DECL_TEMPLATE_RESULT (tmpl))
2094 = DECL_SOURCE_LOCATION (decl);
2095 /* We want to use the argument list specified in the
2096 definition, not in the original declaration. */
2097 DECL_ARGUMENTS (DECL_TEMPLATE_RESULT (tmpl))
2098 = DECL_ARGUMENTS (decl);
2103 /* Set up the DECL_TEMPLATE_INFO for DECL. */
2104 DECL_TEMPLATE_INFO (decl) = tree_cons (tmpl, targs, NULL_TREE);
2106 /* Inherit default function arguments from the template
2107 DECL is specializing. */
2108 copy_default_args_to_explicit_spec (decl);
2110 /* This specialization has the same protection as the
2111 template it specializes. */
2112 TREE_PRIVATE (decl) = TREE_PRIVATE (gen_tmpl);
2113 TREE_PROTECTED (decl) = TREE_PROTECTED (gen_tmpl);
2114 /* The specialization has the same visibility as the
2115 template it specializes. */
2116 if (DECL_VISIBILITY_SPECIFIED (gen_tmpl))
2118 DECL_VISIBILITY_SPECIFIED (decl) = 1;
2119 DECL_VISIBILITY (decl) = DECL_VISIBILITY (gen_tmpl);
2121 /* If DECL is a friend declaration, declared using an
2122 unqualified name, the namespace associated with DECL may
2123 have been set incorrectly. For example, in:
2125 template <typename T> void f(T);
2127 struct S { friend void f<int>(int); }
2130 we will have set the DECL_CONTEXT for the friend
2131 declaration to N, rather than to the global namespace. */
2132 if (DECL_NAMESPACE_SCOPE_P (decl))
2133 DECL_CONTEXT (decl) = DECL_CONTEXT (tmpl);
2135 if (is_friend && !have_def)
2136 /* This is not really a declaration of a specialization.
2137 It's just the name of an instantiation. But, it's not
2138 a request for an instantiation, either. */
2139 SET_DECL_IMPLICIT_INSTANTIATION (decl);
2140 else if (DECL_CONSTRUCTOR_P (decl) || DECL_DESTRUCTOR_P (decl))
2141 /* This is indeed a specialization. In case of constructors
2142 and destructors, we need in-charge and not-in-charge
2143 versions in V3 ABI. */
2144 clone_function_decl (decl, /*update_method_vec_p=*/0);
2146 /* Register this specialization so that we can find it
2148 decl = register_specialization (decl, gen_tmpl, targs, is_friend);
2155 /* Returns 1 iff PARMS1 and PARMS2 are identical sets of template
2156 parameters. These are represented in the same format used for
2157 DECL_TEMPLATE_PARMS. */
2160 comp_template_parms (tree parms1, tree parms2)
2165 if (parms1 == parms2)
2168 for (p1 = parms1, p2 = parms2;
2169 p1 != NULL_TREE && p2 != NULL_TREE;
2170 p1 = TREE_CHAIN (p1), p2 = TREE_CHAIN (p2))
2172 tree t1 = TREE_VALUE (p1);
2173 tree t2 = TREE_VALUE (p2);
2176 gcc_assert (TREE_CODE (t1) == TREE_VEC);
2177 gcc_assert (TREE_CODE (t2) == TREE_VEC);
2179 if (TREE_VEC_LENGTH (t1) != TREE_VEC_LENGTH (t2))
2182 for (i = 0; i < TREE_VEC_LENGTH (t2); ++i)
2184 tree parm1 = TREE_VALUE (TREE_VEC_ELT (t1, i));
2185 tree parm2 = TREE_VALUE (TREE_VEC_ELT (t2, i));
2187 if (TREE_CODE (parm1) != TREE_CODE (parm2))
2190 if (TREE_CODE (parm1) == TEMPLATE_TYPE_PARM)
2192 else if (!same_type_p (TREE_TYPE (parm1), TREE_TYPE (parm2)))
2197 if ((p1 != NULL_TREE) != (p2 != NULL_TREE))
2198 /* One set of parameters has more parameters lists than the
2205 /* Complain if DECL shadows a template parameter.
2207 [temp.local]: A template-parameter shall not be redeclared within its
2208 scope (including nested scopes). */
2211 check_template_shadow (tree decl)
2215 /* If we're not in a template, we can't possibly shadow a template
2217 if (!current_template_parms)
2220 /* Figure out what we're shadowing. */
2221 if (TREE_CODE (decl) == OVERLOAD)
2222 decl = OVL_CURRENT (decl);
2223 olddecl = innermost_non_namespace_value (DECL_NAME (decl));
2225 /* If there's no previous binding for this name, we're not shadowing
2226 anything, let alone a template parameter. */
2230 /* If we're not shadowing a template parameter, we're done. Note
2231 that OLDDECL might be an OVERLOAD (or perhaps even an
2232 ERROR_MARK), so we can't just blithely assume it to be a _DECL
2234 if (!DECL_P (olddecl) || !DECL_TEMPLATE_PARM_P (olddecl))
2237 /* We check for decl != olddecl to avoid bogus errors for using a
2238 name inside a class. We check TPFI to avoid duplicate errors for
2239 inline member templates. */
2241 || TEMPLATE_PARMS_FOR_INLINE (current_template_parms))
2244 error ("declaration of %q+#D", decl);
2245 error (" shadows template parm %q+#D", olddecl);
2248 /* Return a new TEMPLATE_PARM_INDEX with the indicated INDEX, LEVEL,
2249 ORIG_LEVEL, DECL, and TYPE. */
2252 build_template_parm_index (int index,
2258 tree t = make_node (TEMPLATE_PARM_INDEX);
2259 TEMPLATE_PARM_IDX (t) = index;
2260 TEMPLATE_PARM_LEVEL (t) = level;
2261 TEMPLATE_PARM_ORIG_LEVEL (t) = orig_level;
2262 TEMPLATE_PARM_DECL (t) = decl;
2263 TREE_TYPE (t) = type;
2264 TREE_CONSTANT (t) = TREE_CONSTANT (decl);
2265 TREE_INVARIANT (t) = TREE_INVARIANT (decl);
2266 TREE_READONLY (t) = TREE_READONLY (decl);
2271 /* Return a TEMPLATE_PARM_INDEX, similar to INDEX, but whose
2272 TEMPLATE_PARM_LEVEL has been decreased by LEVELS. If such a
2273 TEMPLATE_PARM_INDEX already exists, it is returned; otherwise, a
2274 new one is created. */
2277 reduce_template_parm_level (tree index, tree type, int levels)
2279 if (TEMPLATE_PARM_DESCENDANTS (index) == NULL_TREE
2280 || (TEMPLATE_PARM_LEVEL (TEMPLATE_PARM_DESCENDANTS (index))
2281 != TEMPLATE_PARM_LEVEL (index) - levels))
2283 tree orig_decl = TEMPLATE_PARM_DECL (index);
2286 decl = build_decl (TREE_CODE (orig_decl), DECL_NAME (orig_decl), type);
2287 TREE_CONSTANT (decl) = TREE_CONSTANT (orig_decl);
2288 TREE_INVARIANT (decl) = TREE_INVARIANT (orig_decl);
2289 TREE_READONLY (decl) = TREE_READONLY (orig_decl);
2290 DECL_ARTIFICIAL (decl) = 1;
2291 SET_DECL_TEMPLATE_PARM_P (decl);
2293 t = build_template_parm_index (TEMPLATE_PARM_IDX (index),
2294 TEMPLATE_PARM_LEVEL (index) - levels,
2295 TEMPLATE_PARM_ORIG_LEVEL (index),
2297 TEMPLATE_PARM_DESCENDANTS (index) = t;
2299 /* Template template parameters need this. */
2300 if (TREE_CODE (decl) != CONST_DECL)
2301 DECL_TEMPLATE_PARMS (decl)
2302 = DECL_TEMPLATE_PARMS (TEMPLATE_PARM_DECL (index));
2305 return TEMPLATE_PARM_DESCENDANTS (index);
2308 /* Process information from new template parameter NEXT and append it to the
2309 LIST being built. This new parameter is a non-type parameter iff
2310 IS_NON_TYPE is true. */
2313 process_template_parm (tree list, tree next, bool is_non_type)
2321 gcc_assert (TREE_CODE (parm) == TREE_LIST);
2322 defval = TREE_PURPOSE (parm);
2326 tree p = TREE_VALUE (tree_last (list));
2328 if (TREE_CODE (p) == TYPE_DECL || TREE_CODE (p) == TEMPLATE_DECL)
2329 idx = TEMPLATE_TYPE_IDX (TREE_TYPE (p));
2331 idx = TEMPLATE_PARM_IDX (DECL_INITIAL (p));
2339 parm = TREE_VALUE (parm);
2341 SET_DECL_TEMPLATE_PARM_P (parm);
2345 The top-level cv-qualifiers on the template-parameter are
2346 ignored when determining its type. */
2347 TREE_TYPE (parm) = TYPE_MAIN_VARIANT (TREE_TYPE (parm));
2349 /* A template parameter is not modifiable. */
2350 TREE_CONSTANT (parm) = 1;
2351 TREE_INVARIANT (parm) = 1;
2352 TREE_READONLY (parm) = 1;
2353 if (invalid_nontype_parm_type_p (TREE_TYPE (parm), 1))
2354 TREE_TYPE (parm) = void_type_node;
2355 decl = build_decl (CONST_DECL, DECL_NAME (parm), TREE_TYPE (parm));
2356 TREE_CONSTANT (decl) = 1;
2357 TREE_INVARIANT (decl) = 1;
2358 TREE_READONLY (decl) = 1;
2359 DECL_INITIAL (parm) = DECL_INITIAL (decl)
2360 = build_template_parm_index (idx, processing_template_decl,
2361 processing_template_decl,
2362 decl, TREE_TYPE (parm));
2367 parm = TREE_VALUE (TREE_VALUE (parm));
2369 if (parm && TREE_CODE (parm) == TEMPLATE_DECL)
2371 t = make_aggr_type (TEMPLATE_TEMPLATE_PARM);
2372 /* This is for distinguishing between real templates and template
2373 template parameters */
2374 TREE_TYPE (parm) = t;
2375 TREE_TYPE (DECL_TEMPLATE_RESULT (parm)) = t;
2380 t = make_aggr_type (TEMPLATE_TYPE_PARM);
2381 /* parm is either IDENTIFIER_NODE or NULL_TREE. */
2382 decl = build_decl (TYPE_DECL, parm, t);
2385 TYPE_NAME (t) = decl;
2386 TYPE_STUB_DECL (t) = decl;
2388 TEMPLATE_TYPE_PARM_INDEX (t)
2389 = build_template_parm_index (idx, processing_template_decl,
2390 processing_template_decl,
2391 decl, TREE_TYPE (parm));
2393 DECL_ARTIFICIAL (decl) = 1;
2394 SET_DECL_TEMPLATE_PARM_P (decl);
2396 parm = build_tree_list (defval, parm);
2397 return chainon (list, parm);
2400 /* The end of a template parameter list has been reached. Process the
2401 tree list into a parameter vector, converting each parameter into a more
2402 useful form. Type parameters are saved as IDENTIFIER_NODEs, and others
2406 end_template_parm_list (tree parms)
2410 tree saved_parmlist = make_tree_vec (list_length (parms));
2412 current_template_parms
2413 = tree_cons (size_int (processing_template_decl),
2414 saved_parmlist, current_template_parms);
2416 for (parm = parms, nparms = 0; parm; parm = next, nparms++)
2418 next = TREE_CHAIN (parm);
2419 TREE_VEC_ELT (saved_parmlist, nparms) = parm;
2420 TREE_CHAIN (parm) = NULL_TREE;
2423 --processing_template_parmlist;
2425 return saved_parmlist;
2428 /* end_template_decl is called after a template declaration is seen. */
2431 end_template_decl (void)
2433 reset_specialization ();
2435 if (! processing_template_decl)
2438 /* This matches the pushlevel in begin_template_parm_list. */
2441 --processing_template_decl;
2442 current_template_parms = TREE_CHAIN (current_template_parms);
2445 /* Given a template argument vector containing the template PARMS.
2446 The innermost PARMS are given first. */
2449 current_template_args (void)
2452 tree args = NULL_TREE;
2453 int length = TMPL_PARMS_DEPTH (current_template_parms);
2456 /* If there is only one level of template parameters, we do not
2457 create a TREE_VEC of TREE_VECs. Instead, we return a single
2458 TREE_VEC containing the arguments. */
2460 args = make_tree_vec (length);
2462 for (header = current_template_parms; header; header = TREE_CHAIN (header))
2464 tree a = copy_node (TREE_VALUE (header));
2467 TREE_TYPE (a) = NULL_TREE;
2468 for (i = TREE_VEC_LENGTH (a) - 1; i >= 0; --i)
2470 tree t = TREE_VEC_ELT (a, i);
2472 /* T will be a list if we are called from within a
2473 begin/end_template_parm_list pair, but a vector directly
2474 if within a begin/end_member_template_processing pair. */
2475 if (TREE_CODE (t) == TREE_LIST)
2479 if (TREE_CODE (t) == TYPE_DECL
2480 || TREE_CODE (t) == TEMPLATE_DECL)
2483 t = DECL_INITIAL (t);
2484 TREE_VEC_ELT (a, i) = t;
2489 TREE_VEC_ELT (args, --l) = a;
2497 /* Return a TEMPLATE_DECL corresponding to DECL, using the indicated
2498 template PARMS. If MEMBER_TEMPLATE_P is true, the new template is
2499 a member template. Used by push_template_decl below. */
2502 build_template_decl (tree decl, tree parms, bool member_template_p)
2504 tree tmpl = build_lang_decl (TEMPLATE_DECL, DECL_NAME (decl), NULL_TREE);
2505 DECL_TEMPLATE_PARMS (tmpl) = parms;
2506 DECL_CONTEXT (tmpl) = DECL_CONTEXT (decl);
2507 DECL_MEMBER_TEMPLATE_P (tmpl) = member_template_p;
2508 if (DECL_LANG_SPECIFIC (decl))
2510 DECL_STATIC_FUNCTION_P (tmpl) = DECL_STATIC_FUNCTION_P (decl);
2511 DECL_CONSTRUCTOR_P (tmpl) = DECL_CONSTRUCTOR_P (decl);
2512 DECL_DESTRUCTOR_P (tmpl) = DECL_DESTRUCTOR_P (decl);
2513 DECL_NONCONVERTING_P (tmpl) = DECL_NONCONVERTING_P (decl);
2514 DECL_ASSIGNMENT_OPERATOR_P (tmpl) = DECL_ASSIGNMENT_OPERATOR_P (decl);
2515 if (DECL_OVERLOADED_OPERATOR_P (decl))
2516 SET_OVERLOADED_OPERATOR_CODE (tmpl,
2517 DECL_OVERLOADED_OPERATOR_P (decl));
2523 struct template_parm_data
2525 /* The level of the template parameters we are currently
2529 /* The index of the specialization argument we are currently
2533 /* An array whose size is the number of template parameters. The
2534 elements are nonzero if the parameter has been used in any one
2535 of the arguments processed so far. */
2538 /* An array whose size is the number of template arguments. The
2539 elements are nonzero if the argument makes use of template
2540 parameters of this level. */
2541 int* arg_uses_template_parms;
2544 /* Subroutine of push_template_decl used to see if each template
2545 parameter in a partial specialization is used in the explicit
2546 argument list. If T is of the LEVEL given in DATA (which is
2547 treated as a template_parm_data*), then DATA->PARMS is marked
2551 mark_template_parm (tree t, void* data)
2555 struct template_parm_data* tpd = (struct template_parm_data*) data;
2557 if (TREE_CODE (t) == TEMPLATE_PARM_INDEX)
2559 level = TEMPLATE_PARM_LEVEL (t);
2560 idx = TEMPLATE_PARM_IDX (t);
2564 level = TEMPLATE_TYPE_LEVEL (t);
2565 idx = TEMPLATE_TYPE_IDX (t);
2568 if (level == tpd->level)
2570 tpd->parms[idx] = 1;
2571 tpd->arg_uses_template_parms[tpd->current_arg] = 1;
2574 /* Return zero so that for_each_template_parm will continue the
2575 traversal of the tree; we want to mark *every* template parm. */
2579 /* Process the partial specialization DECL. */
2582 process_partial_specialization (tree decl)
2584 tree type = TREE_TYPE (decl);
2585 tree maintmpl = CLASSTYPE_TI_TEMPLATE (type);
2586 tree specargs = CLASSTYPE_TI_ARGS (type);
2587 tree inner_args = INNERMOST_TEMPLATE_ARGS (specargs);
2588 tree inner_parms = INNERMOST_TEMPLATE_PARMS (current_template_parms);
2589 tree main_inner_parms = DECL_INNERMOST_TEMPLATE_PARMS (maintmpl);
2590 int nargs = TREE_VEC_LENGTH (inner_args);
2591 int ntparms = TREE_VEC_LENGTH (inner_parms);
2593 int did_error_intro = 0;
2594 struct template_parm_data tpd;
2595 struct template_parm_data tpd2;
2597 /* We check that each of the template parameters given in the
2598 partial specialization is used in the argument list to the
2599 specialization. For example:
2601 template <class T> struct S;
2602 template <class T> struct S<T*>;
2604 The second declaration is OK because `T*' uses the template
2605 parameter T, whereas
2607 template <class T> struct S<int>;
2609 is no good. Even trickier is:
2620 The S2<T> declaration is actually invalid; it is a
2621 full-specialization. Of course,
2624 struct S2<T (*)(U)>;
2626 or some such would have been OK. */
2627 tpd.level = TMPL_PARMS_DEPTH (current_template_parms);
2628 tpd.parms = alloca (sizeof (int) * ntparms);
2629 memset (tpd.parms, 0, sizeof (int) * ntparms);
2631 tpd.arg_uses_template_parms = alloca (sizeof (int) * nargs);
2632 memset (tpd.arg_uses_template_parms, 0, sizeof (int) * nargs);
2633 for (i = 0; i < nargs; ++i)
2635 tpd.current_arg = i;
2636 for_each_template_parm (TREE_VEC_ELT (inner_args, i),
2637 &mark_template_parm,
2641 for (i = 0; i < ntparms; ++i)
2642 if (tpd.parms[i] == 0)
2644 /* One of the template parms was not used in the
2646 if (!did_error_intro)
2648 error ("template parameters not used in partial specialization:");
2649 did_error_intro = 1;
2652 error (" %qD", TREE_VALUE (TREE_VEC_ELT (inner_parms, i)));
2655 /* [temp.class.spec]
2657 The argument list of the specialization shall not be identical to
2658 the implicit argument list of the primary template. */
2659 if (comp_template_args
2661 INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE
2663 error ("partial specialization %qT does not specialize any template arguments", type);
2665 /* [temp.class.spec]
2667 A partially specialized non-type argument expression shall not
2668 involve template parameters of the partial specialization except
2669 when the argument expression is a simple identifier.
2671 The type of a template parameter corresponding to a specialized
2672 non-type argument shall not be dependent on a parameter of the
2674 gcc_assert (nargs == DECL_NTPARMS (maintmpl));
2676 for (i = 0; i < nargs; ++i)
2678 tree arg = TREE_VEC_ELT (inner_args, i);
2679 if (/* These first two lines are the `non-type' bit. */
2681 && TREE_CODE (arg) != TEMPLATE_DECL
2682 /* This next line is the `argument expression is not just a
2683 simple identifier' condition and also the `specialized
2684 non-type argument' bit. */
2685 && TREE_CODE (arg) != TEMPLATE_PARM_INDEX)
2687 if (tpd.arg_uses_template_parms[i])
2688 error ("template argument %qE involves template parameter(s)", arg);
2691 /* Look at the corresponding template parameter,
2692 marking which template parameters its type depends
2695 TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (main_inner_parms,
2700 /* We haven't yet initialized TPD2. Do so now. */
2701 tpd2.arg_uses_template_parms
2702 = alloca (sizeof (int) * nargs);
2703 /* The number of parameters here is the number in the
2704 main template, which, as checked in the assertion
2706 tpd2.parms = alloca (sizeof (int) * nargs);
2708 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (maintmpl));
2711 /* Mark the template parameters. But this time, we're
2712 looking for the template parameters of the main
2713 template, not in the specialization. */
2714 tpd2.current_arg = i;
2715 tpd2.arg_uses_template_parms[i] = 0;
2716 memset (tpd2.parms, 0, sizeof (int) * nargs);
2717 for_each_template_parm (type,
2718 &mark_template_parm,
2722 if (tpd2.arg_uses_template_parms [i])
2724 /* The type depended on some template parameters.
2725 If they are fully specialized in the
2726 specialization, that's OK. */
2728 for (j = 0; j < nargs; ++j)
2729 if (tpd2.parms[j] != 0
2730 && tpd.arg_uses_template_parms [j])
2732 error ("type %qT of template argument %qE depends "
2733 "on template parameter(s)",
2743 if (retrieve_specialization (maintmpl, specargs,
2744 /*class_specializations_p=*/true))
2745 /* We've already got this specialization. */
2748 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl)
2749 = tree_cons (inner_args, inner_parms,
2750 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl));
2751 TREE_TYPE (DECL_TEMPLATE_SPECIALIZATIONS (maintmpl)) = type;
2755 /* Check that a template declaration's use of default arguments is not
2756 invalid. Here, PARMS are the template parameters. IS_PRIMARY is
2757 nonzero if DECL is the thing declared by a primary template.
2758 IS_PARTIAL is nonzero if DECL is a partial specialization. */
2761 check_default_tmpl_args (tree decl, tree parms, int is_primary, int is_partial)
2764 int last_level_to_check;
2769 A default template-argument shall not be specified in a
2770 function template declaration or a function template definition, nor
2771 in the template-parameter-list of the definition of a member of a
2774 if (TREE_CODE (CP_DECL_CONTEXT (decl)) == FUNCTION_DECL)
2775 /* You can't have a function template declaration in a local
2776 scope, nor you can you define a member of a class template in a
2780 if (current_class_type
2781 && !TYPE_BEING_DEFINED (current_class_type)
2782 && DECL_LANG_SPECIFIC (decl)
2783 /* If this is either a friend defined in the scope of the class
2784 or a member function. */
2785 && (DECL_FUNCTION_MEMBER_P (decl)
2786 ? same_type_p (DECL_CONTEXT (decl), current_class_type)
2787 : DECL_FRIEND_CONTEXT (decl)
2788 ? same_type_p (DECL_FRIEND_CONTEXT (decl), current_class_type)
2790 /* And, if it was a member function, it really was defined in
2791 the scope of the class. */
2792 && (!DECL_FUNCTION_MEMBER_P (decl)
2793 || DECL_INITIALIZED_IN_CLASS_P (decl)))
2794 /* We already checked these parameters when the template was
2795 declared, so there's no need to do it again now. This function
2796 was defined in class scope, but we're processing it's body now
2797 that the class is complete. */
2802 If a template-parameter has a default template-argument, all
2803 subsequent template-parameters shall have a default
2804 template-argument supplied. */
2805 for (parm_level = parms; parm_level; parm_level = TREE_CHAIN (parm_level))
2807 tree inner_parms = TREE_VALUE (parm_level);
2808 int ntparms = TREE_VEC_LENGTH (inner_parms);
2809 int seen_def_arg_p = 0;
2812 for (i = 0; i < ntparms; ++i)
2814 tree parm = TREE_VEC_ELT (inner_parms, i);
2815 if (TREE_PURPOSE (parm))
2817 else if (seen_def_arg_p)
2819 error ("no default argument for %qD", TREE_VALUE (parm));
2820 /* For better subsequent error-recovery, we indicate that
2821 there should have been a default argument. */
2822 TREE_PURPOSE (parm) = error_mark_node;
2827 if (TREE_CODE (decl) != TYPE_DECL || is_partial || !is_primary)
2828 /* For an ordinary class template, default template arguments are
2829 allowed at the innermost level, e.g.:
2830 template <class T = int>
2832 but, in a partial specialization, they're not allowed even
2833 there, as we have in [temp.class.spec]:
2835 The template parameter list of a specialization shall not
2836 contain default template argument values.
2838 So, for a partial specialization, or for a function template,
2839 we look at all of them. */
2842 /* But, for a primary class template that is not a partial
2843 specialization we look at all template parameters except the
2845 parms = TREE_CHAIN (parms);
2847 /* Figure out what error message to issue. */
2848 if (TREE_CODE (decl) == FUNCTION_DECL)
2849 msg = "default template arguments may not be used in function templates";
2850 else if (is_partial)
2851 msg = "default template arguments may not be used in partial specializations";
2853 msg = "default argument for template parameter for class enclosing %qD";
2855 if (current_class_type && TYPE_BEING_DEFINED (current_class_type))
2856 /* If we're inside a class definition, there's no need to
2857 examine the parameters to the class itself. On the one
2858 hand, they will be checked when the class is defined, and,
2859 on the other, default arguments are valid in things like:
2860 template <class T = double>
2861 struct S { template <class U> void f(U); };
2862 Here the default argument for `S' has no bearing on the
2863 declaration of `f'. */
2864 last_level_to_check = template_class_depth (current_class_type) + 1;
2866 /* Check everything. */
2867 last_level_to_check = 0;
2869 for (parm_level = parms;
2870 parm_level && TMPL_PARMS_DEPTH (parm_level) >= last_level_to_check;
2871 parm_level = TREE_CHAIN (parm_level))
2873 tree inner_parms = TREE_VALUE (parm_level);
2877 ntparms = TREE_VEC_LENGTH (inner_parms);
2878 for (i = 0; i < ntparms; ++i)
2879 if (TREE_PURPOSE (TREE_VEC_ELT (inner_parms, i)))
2887 /* Clear out the default argument so that we are not
2889 TREE_PURPOSE (TREE_VEC_ELT (inner_parms, i)) = NULL_TREE;
2892 /* At this point, if we're still interested in issuing messages,
2893 they must apply to classes surrounding the object declared. */
2895 msg = "default argument for template parameter for class enclosing %qD";
2899 /* Worker for push_template_decl_real, called via
2900 for_each_template_parm. DATA is really an int, indicating the
2901 level of the parameters we are interested in. If T is a template
2902 parameter of that level, return nonzero. */
2905 template_parm_this_level_p (tree t, void* data)
2907 int this_level = *(int *)data;
2910 if (TREE_CODE (t) == TEMPLATE_PARM_INDEX)
2911 level = TEMPLATE_PARM_LEVEL (t);
2913 level = TEMPLATE_TYPE_LEVEL (t);
2914 return level == this_level;
2917 /* Creates a TEMPLATE_DECL for the indicated DECL using the template
2918 parameters given by current_template_args, or reuses a
2919 previously existing one, if appropriate. Returns the DECL, or an
2920 equivalent one, if it is replaced via a call to duplicate_decls.
2922 If IS_FRIEND is true, DECL is a friend declaration. */
2925 push_template_decl_real (tree decl, bool is_friend)
2933 int new_template_p = 0;
2934 /* True if the template is a member template, in the sense of
2936 bool member_template_p = false;
2938 if (decl == error_mark_node)
2941 /* See if this is a partial specialization. */
2942 is_partial = (DECL_IMPLICIT_TYPEDEF_P (decl)
2943 && TREE_CODE (TREE_TYPE (decl)) != ENUMERAL_TYPE
2944 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl)));
2946 if (TREE_CODE (decl) == FUNCTION_DECL && DECL_FRIEND_P (decl))
2950 /* For a friend, we want the context of the friend function, not
2951 the type of which it is a friend. */
2952 ctx = DECL_CONTEXT (decl);
2953 else if (CP_DECL_CONTEXT (decl)
2954 && TREE_CODE (CP_DECL_CONTEXT (decl)) != NAMESPACE_DECL)
2955 /* In the case of a virtual function, we want the class in which
2957 ctx = CP_DECL_CONTEXT (decl);
2959 /* Otherwise, if we're currently defining some class, the DECL
2960 is assumed to be a member of the class. */
2961 ctx = current_scope ();
2963 if (ctx && TREE_CODE (ctx) == NAMESPACE_DECL)
2966 if (!DECL_CONTEXT (decl))
2967 DECL_CONTEXT (decl) = FROB_CONTEXT (current_namespace);
2969 /* See if this is a primary template. */
2970 primary = template_parm_scope_p ();
2974 if (DECL_CLASS_SCOPE_P (decl))
2975 member_template_p = true;
2976 if (TREE_CODE (decl) == TYPE_DECL
2977 && ANON_AGGRNAME_P (DECL_NAME (decl)))
2978 error ("template class without a name");
2979 else if (TREE_CODE (decl) == FUNCTION_DECL)
2981 if (DECL_DESTRUCTOR_P (decl))
2985 A destructor shall not be a member template. */
2986 error ("destructor %qD declared as member template", decl);
2987 return error_mark_node;
2989 if (NEW_DELETE_OPNAME_P (DECL_NAME (decl))
2990 && (!TYPE_ARG_TYPES (TREE_TYPE (decl))
2991 || TYPE_ARG_TYPES (TREE_TYPE (decl)) == void_list_node
2992 || !TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl)))
2993 || (TREE_CHAIN (TYPE_ARG_TYPES ((TREE_TYPE (decl))))
2994 == void_list_node)))
2996 /* [basic.stc.dynamic.allocation]
2998 An allocation function can be a function
2999 template. ... Template allocation functions shall
3000 have two or more parameters. */
3001 error ("invalid template declaration of %qD", decl);
3005 else if (DECL_IMPLICIT_TYPEDEF_P (decl)
3006 && CLASS_TYPE_P (TREE_TYPE (decl)))
3010 error ("template declaration of %q#D", decl);
3011 return error_mark_node;
3015 /* Check to see that the rules regarding the use of default
3016 arguments are not being violated. */
3017 check_default_tmpl_args (decl, current_template_parms,
3018 primary, is_partial);
3021 return process_partial_specialization (decl);
3023 args = current_template_args ();
3026 || TREE_CODE (ctx) == FUNCTION_DECL
3027 || (CLASS_TYPE_P (ctx) && TYPE_BEING_DEFINED (ctx))
3028 || (is_friend && !DECL_TEMPLATE_INFO (decl)))
3030 if (DECL_LANG_SPECIFIC (decl)
3031 && DECL_TEMPLATE_INFO (decl)
3032 && DECL_TI_TEMPLATE (decl))
3033 tmpl = DECL_TI_TEMPLATE (decl);
3034 /* If DECL is a TYPE_DECL for a class-template, then there won't
3035 be DECL_LANG_SPECIFIC. The information equivalent to
3036 DECL_TEMPLATE_INFO is found in TYPE_TEMPLATE_INFO instead. */
3037 else if (DECL_IMPLICIT_TYPEDEF_P (decl)
3038 && TYPE_TEMPLATE_INFO (TREE_TYPE (decl))
3039 && TYPE_TI_TEMPLATE (TREE_TYPE (decl)))
3041 /* Since a template declaration already existed for this
3042 class-type, we must be redeclaring it here. Make sure
3043 that the redeclaration is valid. */
3044 redeclare_class_template (TREE_TYPE (decl),
3045 current_template_parms);
3046 /* We don't need to create a new TEMPLATE_DECL; just use the
3047 one we already had. */
3048 tmpl = TYPE_TI_TEMPLATE (TREE_TYPE (decl));
3052 tmpl = build_template_decl (decl, current_template_parms,
3056 if (DECL_LANG_SPECIFIC (decl)
3057 && DECL_TEMPLATE_SPECIALIZATION (decl))
3059 /* A specialization of a member template of a template
3061 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl);
3062 DECL_TEMPLATE_INFO (tmpl) = DECL_TEMPLATE_INFO (decl);
3063 DECL_TEMPLATE_INFO (decl) = NULL_TREE;
3069 tree a, t, current, parms;
3072 if (TREE_CODE (decl) == TYPE_DECL)
3074 if ((IS_AGGR_TYPE_CODE (TREE_CODE (TREE_TYPE (decl)))
3075 || TREE_CODE (TREE_TYPE (decl)) == ENUMERAL_TYPE)
3076 && TYPE_TEMPLATE_INFO (TREE_TYPE (decl))
3077 && TYPE_TI_TEMPLATE (TREE_TYPE (decl)))
3078 tmpl = TYPE_TI_TEMPLATE (TREE_TYPE (decl));
3081 error ("%qD does not declare a template type", decl);
3085 else if (!DECL_LANG_SPECIFIC (decl) || !DECL_TEMPLATE_INFO (decl))
3087 error ("template definition of non-template %q#D", decl);
3091 tmpl = DECL_TI_TEMPLATE (decl);
3093 if (DECL_FUNCTION_TEMPLATE_P (tmpl)
3094 && DECL_TEMPLATE_INFO (decl) && DECL_TI_ARGS (decl)
3095 && DECL_TEMPLATE_SPECIALIZATION (decl)
3096 && DECL_MEMBER_TEMPLATE_P (tmpl))
3100 /* The declaration is a specialization of a member
3101 template, declared outside the class. Therefore, the
3102 innermost template arguments will be NULL, so we
3103 replace them with the arguments determined by the
3104 earlier call to check_explicit_specialization. */
3105 args = DECL_TI_ARGS (decl);
3108 = build_template_decl (decl, current_template_parms,
3110 DECL_TEMPLATE_RESULT (new_tmpl) = decl;
3111 TREE_TYPE (new_tmpl) = TREE_TYPE (decl);
3112 DECL_TI_TEMPLATE (decl) = new_tmpl;
3113 SET_DECL_TEMPLATE_SPECIALIZATION (new_tmpl);
3114 DECL_TEMPLATE_INFO (new_tmpl)
3115 = tree_cons (tmpl, args, NULL_TREE);
3117 register_specialization (new_tmpl,
3118 most_general_template (tmpl),
3124 /* Make sure the template headers we got make sense. */
3126 parms = DECL_TEMPLATE_PARMS (tmpl);
3127 i = TMPL_PARMS_DEPTH (parms);
3128 if (TMPL_ARGS_DEPTH (args) != i)
3130 error ("expected %d levels of template parms for %q#D, got %d",
3131 i, decl, TMPL_ARGS_DEPTH (args));
3134 for (current = decl; i > 0; --i, parms = TREE_CHAIN (parms))
3136 a = TMPL_ARGS_LEVEL (args, i);
3137 t = INNERMOST_TEMPLATE_PARMS (parms);
3139 if (TREE_VEC_LENGTH (t) != TREE_VEC_LENGTH (a))
3141 if (current == decl)
3142 error ("got %d template parameters for %q#D",
3143 TREE_VEC_LENGTH (a), decl);
3145 error ("got %d template parameters for %q#T",
3146 TREE_VEC_LENGTH (a), current);
3147 error (" but %d required", TREE_VEC_LENGTH (t));
3148 return error_mark_node;
3151 /* Perhaps we should also check that the parms are used in the
3152 appropriate qualifying scopes in the declarator? */
3154 if (current == decl)
3157 current = TYPE_CONTEXT (current);
3161 DECL_TEMPLATE_RESULT (tmpl) = decl;
3162 TREE_TYPE (tmpl) = TREE_TYPE (decl);
3164 /* Push template declarations for global functions and types. Note
3165 that we do not try to push a global template friend declared in a
3166 template class; such a thing may well depend on the template
3167 parameters of the class. */
3168 if (new_template_p && !ctx
3169 && !(is_friend && template_class_depth (current_class_type) > 0))
3171 tmpl = pushdecl_namespace_level (tmpl, is_friend);
3172 if (tmpl == error_mark_node)
3173 return error_mark_node;
3175 /* Hide template friend classes that haven't been declared yet. */
3176 if (is_friend && TREE_CODE (decl) == TYPE_DECL)
3178 DECL_ANTICIPATED (tmpl) = 1;
3179 DECL_FRIEND_P (tmpl) = 1;
3185 DECL_PRIMARY_TEMPLATE (tmpl) = tmpl;
3186 if (DECL_CONV_FN_P (tmpl))
3188 int depth = TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl));
3190 /* It is a conversion operator. See if the type converted to
3191 depends on innermost template operands. */
3193 if (uses_template_parms_level (TREE_TYPE (TREE_TYPE (tmpl)),
3195 DECL_TEMPLATE_CONV_FN_P (tmpl) = 1;
3199 /* The DECL_TI_ARGS of DECL contains full set of arguments referring
3200 back to its most general template. If TMPL is a specialization,
3201 ARGS may only have the innermost set of arguments. Add the missing
3202 argument levels if necessary. */
3203 if (DECL_TEMPLATE_INFO (tmpl))
3204 args = add_outermost_template_args (DECL_TI_ARGS (tmpl), args);
3206 info = tree_cons (tmpl, args, NULL_TREE);
3208 if (DECL_IMPLICIT_TYPEDEF_P (decl))
3210 SET_TYPE_TEMPLATE_INFO (TREE_TYPE (tmpl), info);
3211 if ((!ctx || TREE_CODE (ctx) != FUNCTION_DECL)
3212 && TREE_CODE (TREE_TYPE (decl)) != ENUMERAL_TYPE
3213 /* Don't change the name if we've already set it up. */
3214 && !IDENTIFIER_TEMPLATE (DECL_NAME (decl)))
3215 DECL_NAME (decl) = classtype_mangled_name (TREE_TYPE (decl));
3217 else if (DECL_LANG_SPECIFIC (decl))
3218 DECL_TEMPLATE_INFO (decl) = info;
3220 return DECL_TEMPLATE_RESULT (tmpl);
3224 push_template_decl (tree decl)
3226 return push_template_decl_real (decl, false);
3229 /* Called when a class template TYPE is redeclared with the indicated
3230 template PARMS, e.g.:
3232 template <class T> struct S;
3233 template <class T> struct S {}; */
3236 redeclare_class_template (tree type, tree parms)
3242 if (!TYPE_TEMPLATE_INFO (type))
3244 error ("%qT is not a template type", type);
3248 tmpl = TYPE_TI_TEMPLATE (type);
3249 if (!PRIMARY_TEMPLATE_P (tmpl))
3250 /* The type is nested in some template class. Nothing to worry
3251 about here; there are no new template parameters for the nested
3257 error ("template specifiers not specified in declaration of %qD",
3262 parms = INNERMOST_TEMPLATE_PARMS (parms);
3263 tmpl_parms = DECL_INNERMOST_TEMPLATE_PARMS (tmpl);
3265 if (TREE_VEC_LENGTH (parms) != TREE_VEC_LENGTH (tmpl_parms))
3267 error ("previous declaration %q+D", tmpl);
3268 error ("used %d template parameter(s) instead of %d",
3269 TREE_VEC_LENGTH (tmpl_parms),
3270 TREE_VEC_LENGTH (parms));
3274 for (i = 0; i < TREE_VEC_LENGTH (tmpl_parms); ++i)
3276 tree tmpl_parm = TREE_VALUE (TREE_VEC_ELT (tmpl_parms, i));
3277 tree parm = TREE_VALUE (TREE_VEC_ELT (parms, i));
3278 tree tmpl_default = TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms, i));
3279 tree parm_default = TREE_PURPOSE (TREE_VEC_ELT (parms, i));
3281 /* TMPL_PARM and PARM can be either TYPE_DECL, PARM_DECL, or
3283 if (TREE_CODE (tmpl_parm) != TREE_CODE (parm)
3284 || (TREE_CODE (tmpl_parm) != TYPE_DECL
3285 && !same_type_p (TREE_TYPE (tmpl_parm), TREE_TYPE (parm))))
3287 error ("template parameter %q+#D", tmpl_parm);
3288 error ("redeclared here as %q#D", parm);
3292 if (tmpl_default != NULL_TREE && parm_default != NULL_TREE)
3294 /* We have in [temp.param]:
3296 A template-parameter may not be given default arguments
3297 by two different declarations in the same scope. */
3298 error ("redefinition of default argument for %q#D", parm);
3299 error ("%J original definition appeared here", tmpl_parm);
3303 if (parm_default != NULL_TREE)
3304 /* Update the previous template parameters (which are the ones
3305 that will really count) with the new default value. */
3306 TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms, i)) = parm_default;
3307 else if (tmpl_default != NULL_TREE)
3308 /* Update the new parameters, too; they'll be used as the
3309 parameters for any members. */
3310 TREE_PURPOSE (TREE_VEC_ELT (parms, i)) = tmpl_default;
3314 /* Simplify EXPR if it is a non-dependent expression. Returns the
3315 (possibly simplified) expression. */
3318 fold_non_dependent_expr (tree expr)
3320 /* If we're in a template, but EXPR isn't value dependent, simplify
3321 it. We're supposed to treat:
3323 template <typename T> void f(T[1 + 1]);
3324 template <typename T> void f(T[2]);
3326 as two declarations of the same function, for example. */
3327 if (processing_template_decl
3328 && !type_dependent_expression_p (expr)
3329 && !value_dependent_expression_p (expr))
3331 HOST_WIDE_INT saved_processing_template_decl;
3333 saved_processing_template_decl = processing_template_decl;
3334 processing_template_decl = 0;
3335 expr = tsubst_copy_and_build (expr,
3338 /*in_decl=*/NULL_TREE,
3339 /*function_p=*/false);
3340 processing_template_decl = saved_processing_template_decl;
3345 /* EXPR is an expression which is used in a constant-expression context.
3346 For instance, it could be a VAR_DECL with a constant initializer.
3347 Extract the innest constant expression.
3349 This is basically a more powerful version of
3350 integral_constant_value, which can be used also in templates where
3351 initializers can maintain a syntactic rather than semantic form
3352 (even if they are non-dependent, for access-checking purposes). */
3355 fold_decl_constant_value (tree expr)
3357 tree const_expr = expr;
3360 expr = fold_non_dependent_expr (const_expr);
3361 const_expr = integral_constant_value (expr);
3363 while (expr != const_expr);
3368 /* Subroutine of convert_nontype_argument. Converts EXPR to TYPE, which
3369 must be a function or a pointer-to-function type, as specified
3370 in [temp.arg.nontype]: disambiguate EXPR if it is an overload set,
3371 and check that the resulting function has external linkage. */
3374 convert_nontype_argument_function (tree type, tree expr)
3379 fn = instantiate_type (type, fns, tf_none);
3380 if (fn == error_mark_node)
3381 return error_mark_node;
3384 if (TREE_CODE (fn_no_ptr) == ADDR_EXPR)
3385 fn_no_ptr = TREE_OPERAND (fn_no_ptr, 0);
3387 /* [temp.arg.nontype]/1
3389 A template-argument for a non-type, non-template template-parameter
3392 -- the address of an object or function with external linkage. */
3393 if (!DECL_EXTERNAL_LINKAGE_P (fn_no_ptr))
3395 error ("%qE is not a valid template argument for type %qT "
3396 "because function %qD has not external linkage",
3397 expr, type, fn_no_ptr);
3404 /* Attempt to convert the non-type template parameter EXPR to the
3405 indicated TYPE. If the conversion is successful, return the
3406 converted value. If the conversion is unsuccessful, return
3407 NULL_TREE if we issued an error message, or error_mark_node if we
3408 did not. We issue error messages for out-and-out bad template
3409 parameters, but not simply because the conversion failed, since we
3410 might be just trying to do argument deduction. Both TYPE and EXPR
3411 must be non-dependent.
3413 The conversion follows the special rules described in
3414 [temp.arg.nontype], and it is much more strict than an implicit
3417 This function is called twice for each template argument (see
3418 lookup_template_class for a more accurate description of this
3419 problem). This means that we need to handle expressions which
3420 are not valid in a C++ source, but can be created from the
3421 first call (for instance, casts to perform conversions). These
3422 hacks can go away after we fix the double coercion problem. */
3425 convert_nontype_argument (tree type, tree expr)
3429 /* Detect immediately string literals as invalid non-type argument.
3430 This special-case is not needed for correctness (we would easily
3431 catch this later), but only to provide better diagnostic for this
3432 common user mistake. As suggested by DR 100, we do not mention
3433 linkage issues in the diagnostic as this is not the point. */
3434 if (TREE_CODE (expr) == STRING_CST)
3436 error ("%qE is not a valid template argument for type %qT "
3437 "because string literals can never be used in this context",
3442 /* If we are in a template, EXPR may be non-dependent, but still
3443 have a syntactic, rather than semantic, form. For example, EXPR
3444 might be a SCOPE_REF, rather than the VAR_DECL to which the
3445 SCOPE_REF refers. Preserving the qualifying scope is necessary
3446 so that access checking can be performed when the template is
3447 instantiated -- but here we need the resolved form so that we can
3448 convert the argument. */
3449 expr = fold_non_dependent_expr (expr);
3450 expr_type = TREE_TYPE (expr);
3452 /* HACK: Due to double coercion, we can get a
3453 NOP_EXPR<REFERENCE_TYPE>(ADDR_EXPR<POINTER_TYPE> (arg)) here,
3454 which is the tree that we built on the first call (see
3455 below when coercing to reference to object or to reference to
3456 function). We just strip everything and get to the arg.
3457 See g++.old-deja/g++.oliva/template4.C and g++.dg/template/nontype9.C
3459 if (TREE_CODE (expr) == NOP_EXPR)
3461 if (TYPE_REF_OBJ_P (type) || TYPE_REFFN_P (type))
3463 /* ??? Maybe we could use convert_from_reference here, but we
3464 would need to relax its constraints because the NOP_EXPR
3465 could actually change the type to something more cv-qualified,
3466 and this is not folded by convert_from_reference. */
3467 tree addr = TREE_OPERAND (expr, 0);
3468 gcc_assert (TREE_CODE (expr_type) == REFERENCE_TYPE);
3469 gcc_assert (TREE_CODE (addr) == ADDR_EXPR);
3470 gcc_assert (TREE_CODE (TREE_TYPE (addr)) == POINTER_TYPE);
3471 gcc_assert (same_type_ignoring_top_level_qualifiers_p
3472 (TREE_TYPE (expr_type),
3473 TREE_TYPE (TREE_TYPE (addr))));
3475 expr = TREE_OPERAND (addr, 0);
3476 expr_type = TREE_TYPE (expr);
3479 /* We could also generate a NOP_EXPR(ADDR_EXPR()) when the
3480 parameter is a pointer to object, through decay and
3481 qualification conversion. Let's strip everything. */
3482 else if (TYPE_PTROBV_P (type))
3485 gcc_assert (TREE_CODE (expr) == ADDR_EXPR);
3486 gcc_assert (TREE_CODE (TREE_TYPE (expr)) == POINTER_TYPE);
3487 /* Skip the ADDR_EXPR only if it is part of the decay for
3488 an array. Otherwise, it is part of the original argument
3489 in the source code. */
3490 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (expr, 0))) == ARRAY_TYPE)
3491 expr = TREE_OPERAND (expr, 0);
3492 expr_type = TREE_TYPE (expr);
3496 /* [temp.arg.nontype]/5, bullet 1
3498 For a non-type template-parameter of integral or enumeration type,
3499 integral promotions (_conv.prom_) and integral conversions
3500 (_conv.integral_) are applied. */
3501 if (INTEGRAL_TYPE_P (type))
3503 if (!INTEGRAL_TYPE_P (expr_type))
3504 return error_mark_node;
3506 expr = fold_decl_constant_value (expr);
3507 /* Notice that there are constant expressions like '4 % 0' which
3508 do not fold into integer constants. */
3509 if (TREE_CODE (expr) != INTEGER_CST)
3511 error ("%qE is not a valid template argument for type %qT "
3512 "because it is a non-constant expression", expr, type);
3516 /* At this point, an implicit conversion does what we want,
3517 because we already know that the expression is of integral
3519 expr = ocp_convert (type, expr, CONV_IMPLICIT, LOOKUP_PROTECT);
3520 if (expr == error_mark_node)
3521 return error_mark_node;
3523 /* Conversion was allowed: fold it to a bare integer constant. */
3526 /* [temp.arg.nontype]/5, bullet 2
3528 For a non-type template-parameter of type pointer to object,
3529 qualification conversions (_conv.qual_) and the array-to-pointer
3530 conversion (_conv.array_) are applied. */
3531 else if (TYPE_PTROBV_P (type))
3533 /* [temp.arg.nontype]/1 (TC1 version, DR 49):
3535 A template-argument for a non-type, non-template template-parameter
3536 shall be one of: [...]
3538 -- the name of a non-type template-parameter;
3539 -- the address of an object or function with external linkage, [...]
3540 expressed as "& id-expression" where the & is optional if the name
3541 refers to a function or array, or if the corresponding
3542 template-parameter is a reference.
3544 Here, we do not care about functions, as they are invalid anyway
3545 for a parameter of type pointer-to-object. */
3546 bool constant_address_p =
3547 (TREE_CODE (expr) == ADDR_EXPR
3548 || TREE_CODE (expr_type) == ARRAY_TYPE
3549 || (DECL_P (expr) && DECL_TEMPLATE_PARM_P (expr)));
3551 expr = decay_conversion (expr);
3552 if (expr == error_mark_node)
3553 return error_mark_node;
3555 expr = perform_qualification_conversions (type, expr);
3556 if (expr == error_mark_node)
3557 return error_mark_node;
3559 if (!constant_address_p)
3561 error ("%qE is not a valid template argument for type %qT "
3562 "because it is not a constant pointer", expr, type);
3566 /* [temp.arg.nontype]/5, bullet 3
3568 For a non-type template-parameter of type reference to object, no
3569 conversions apply. The type referred to by the reference may be more
3570 cv-qualified than the (otherwise identical) type of the
3571 template-argument. The template-parameter is bound directly to the
3572 template-argument, which must be an lvalue. */
3573 else if (TYPE_REF_OBJ_P (type))
3575 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type),
3577 return error_mark_node;
3579 if (!at_least_as_qualified_p (TREE_TYPE (type), expr_type))
3581 error ("%qE is not a valid template argument for type %qT "
3582 "because of conflicts in cv-qualification", expr, type);
3586 if (!real_lvalue_p (expr))
3588 error ("%qE is not a valid template argument for type %qT "
3589 "because it is not a lvalue", expr, type);
3593 /* [temp.arg.nontype]/1
3595 A template-argument for a non-type, non-template template-parameter
3596 shall be one of: [...]
3598 -- the address of an object or function with external linkage. */
3599 if (!DECL_EXTERNAL_LINKAGE_P (expr))
3601 error ("%qE is not a valid template argument for type %qT "
3602 "because object %qD has not external linkage",
3607 expr = build_nop (type, build_address (expr));
3609 /* [temp.arg.nontype]/5, bullet 4
3611 For a non-type template-parameter of type pointer to function, only
3612 the function-to-pointer conversion (_conv.func_) is applied. If the
3613 template-argument represents a set of overloaded functions (or a
3614 pointer to such), the matching function is selected from the set
3616 else if (TYPE_PTRFN_P (type))
3618 /* If the argument is a template-id, we might not have enough
3619 context information to decay the pointer. */
3620 if (!type_unknown_p (expr_type))
3622 expr = decay_conversion (expr);
3623 if (expr == error_mark_node)
3624 return error_mark_node;
3627 expr = convert_nontype_argument_function (type, expr);
3628 if (!expr || expr == error_mark_node)
3631 /* [temp.arg.nontype]/5, bullet 5
3633 For a non-type template-parameter of type reference to function, no
3634 conversions apply. If the template-argument represents a set of
3635 overloaded functions, the matching function is selected from the set
3637 else if (TYPE_REFFN_P (type))
3639 if (TREE_CODE (expr) == ADDR_EXPR)
3641 error ("%qE is not a valid template argument for type %qT "
3642 "because it is a pointer", expr, type);
3643 inform ("try using %qE instead", TREE_OPERAND (expr, 0));
3647 expr = convert_nontype_argument_function (TREE_TYPE (type), expr);
3648 if (!expr || expr == error_mark_node)
3651 expr = build_nop (type, build_address (expr));
3653 /* [temp.arg.nontype]/5, bullet 6
3655 For a non-type template-parameter of type pointer to member function,
3656 no conversions apply. If the template-argument represents a set of
3657 overloaded member functions, the matching member function is selected
3658 from the set (_over.over_). */
3659 else if (TYPE_PTRMEMFUNC_P (type))
3661 expr = instantiate_type (type, expr, tf_none);
3662 if (expr == error_mark_node)
3663 return error_mark_node;
3665 /* There is no way to disable standard conversions in
3666 resolve_address_of_overloaded_function (called by
3667 instantiate_type). It is possible that the call succeeded by
3668 converting &B::I to &D::I (where B is a base of D), so we need
3669 to reject this conversion here.
3671 Actually, even if there was a way to disable standard conversions,
3672 it would still be better to reject them here so that we can
3673 provide a superior diagnostic. */
3674 if (!same_type_p (TREE_TYPE (expr), type))
3676 /* Make sure we are just one standard conversion off. */
3677 gcc_assert (can_convert (type, TREE_TYPE (expr)));
3678 error ("%qE is not a valid template argument for type %qT "
3679 "because it is of type %qT", expr, type,
3681 inform ("standard conversions are not allowed in this context");
3685 /* [temp.arg.nontype]/5, bullet 7
3687 For a non-type template-parameter of type pointer to data member,
3688 qualification conversions (_conv.qual_) are applied. */
3689 else if (TYPE_PTRMEM_P (type))
3691 expr = perform_qualification_conversions (type, expr);
3692 if (expr == error_mark_node)
3695 /* A template non-type parameter must be one of the above. */
3699 /* Sanity check: did we actually convert the argument to the
3701 gcc_assert (same_type_p (type, TREE_TYPE (expr)));
3706 /* Return 1 if PARM_PARMS and ARG_PARMS matches using rule for
3707 template template parameters. Both PARM_PARMS and ARG_PARMS are
3708 vectors of TREE_LIST nodes containing TYPE_DECL, TEMPLATE_DECL
3711 ARG_PARMS may contain more parameters than PARM_PARMS. If this is
3712 the case, then extra parameters must have default arguments.
3714 Consider the example:
3715 template <class T, class Allocator = allocator> class vector;
3716 template<template <class U> class TT> class C;
3718 C<vector> is a valid instantiation. PARM_PARMS for the above code
3719 contains a TYPE_DECL (for U), ARG_PARMS contains two TYPE_DECLs (for
3720 T and Allocator) and OUTER_ARGS contains the argument that is used to
3721 substitute the TT parameter. */
3724 coerce_template_template_parms (tree parm_parms,
3726 tsubst_flags_t complain,
3730 int nparms, nargs, i;
3733 gcc_assert (TREE_CODE (parm_parms) == TREE_VEC);
3734 gcc_assert (TREE_CODE (arg_parms) == TREE_VEC);
3736 nparms = TREE_VEC_LENGTH (parm_parms);
3737 nargs = TREE_VEC_LENGTH (arg_parms);
3739 /* The rule here is opposite of coerce_template_parms. */
3742 && TREE_PURPOSE (TREE_VEC_ELT (arg_parms, nparms)) == NULL_TREE))
3745 for (i = 0; i < nparms; ++i)
3747 parm = TREE_VALUE (TREE_VEC_ELT (parm_parms, i));
3748 arg = TREE_VALUE (TREE_VEC_ELT (arg_parms, i));
3750 if (arg == NULL_TREE || arg == error_mark_node
3751 || parm == NULL_TREE || parm == error_mark_node)
3754 if (TREE_CODE (arg) != TREE_CODE (parm))
3757 switch (TREE_CODE (parm))
3763 /* We encounter instantiations of templates like
3764 template <template <template <class> class> class TT>
3767 tree parmparm = DECL_INNERMOST_TEMPLATE_PARMS (parm);
3768 tree argparm = DECL_INNERMOST_TEMPLATE_PARMS (arg);
3770 if (!coerce_template_template_parms
3771 (parmparm, argparm, complain, in_decl, outer_args))
3777 /* The tsubst call is used to handle cases such as
3779 template <int> class C {};
3780 template <class T, template <T> class TT> class D {};
3783 i.e. the parameter list of TT depends on earlier parameters. */
3784 if (!dependent_type_p (TREE_TYPE (arg))
3786 (tsubst (TREE_TYPE (parm), outer_args, complain, in_decl),
3798 /* Convert the indicated template ARG as necessary to match the
3799 indicated template PARM. Returns the converted ARG, or
3800 error_mark_node if the conversion was unsuccessful. Error and
3801 warning messages are issued under control of COMPLAIN. This
3802 conversion is for the Ith parameter in the parameter list. ARGS is
3803 the full set of template arguments deduced so far. */
3806 convert_template_argument (tree parm,
3809 tsubst_flags_t complain,
3815 int is_type, requires_type, is_tmpl_type, requires_tmpl_type;
3817 inner_args = INNERMOST_TEMPLATE_ARGS (args);
3819 if (TREE_CODE (arg) == TREE_LIST
3820 && TREE_CODE (TREE_VALUE (arg)) == OFFSET_REF)
3822 /* The template argument was the name of some
3823 member function. That's usually
3824 invalid, but static members are OK. In any
3825 case, grab the underlying fields/functions
3826 and issue an error later if required. */
3827 arg = TREE_VALUE (arg);
3828 TREE_TYPE (arg) = unknown_type_node;
3831 requires_tmpl_type = TREE_CODE (parm) == TEMPLATE_DECL;
3832 requires_type = (TREE_CODE (parm) == TYPE_DECL
3833 || requires_tmpl_type);
3835 is_tmpl_type = ((TREE_CODE (arg) == TEMPLATE_DECL
3836 && TREE_CODE (DECL_TEMPLATE_RESULT (arg)) == TYPE_DECL)
3837 || TREE_CODE (arg) == TEMPLATE_TEMPLATE_PARM
3838 || TREE_CODE (arg) == UNBOUND_CLASS_TEMPLATE);
3841 && (TREE_CODE (arg) == TEMPLATE_TEMPLATE_PARM
3842 || TREE_CODE (arg) == UNBOUND_CLASS_TEMPLATE))
3843 arg = TYPE_STUB_DECL (arg);
3845 is_type = TYPE_P (arg) || is_tmpl_type;
3847 if (requires_type && ! is_type && TREE_CODE (arg) == SCOPE_REF
3848 && TREE_CODE (TREE_OPERAND (arg, 0)) == TEMPLATE_TYPE_PARM)
3850 pedwarn ("to refer to a type member of a template parameter, "
3851 "use %<typename %E%>", arg);
3853 arg = make_typename_type (TREE_OPERAND (arg, 0),
3854 TREE_OPERAND (arg, 1),
3856 complain & tf_error);
3859 if (is_type != requires_type)
3863 if (complain & tf_error)
3865 error ("type/value mismatch at argument %d in template "
3866 "parameter list for %qD",
3869 error (" expected a constant of type %qT, got %qT",
3871 (is_tmpl_type ? DECL_NAME (arg) : arg));
3872 else if (requires_tmpl_type)
3873 error (" expected a class template, got %qE", arg);
3875 error (" expected a type, got %qE", arg);
3878 return error_mark_node;
3880 if (is_tmpl_type ^ requires_tmpl_type)
3882 if (in_decl && (complain & tf_error))
3884 error ("type/value mismatch at argument %d in template "
3885 "parameter list for %qD",
3888 error (" expected a type, got %qT", DECL_NAME (arg));
3890 error (" expected a class template, got %qT", arg);
3892 return error_mark_node;
3897 if (requires_tmpl_type)
3899 if (TREE_CODE (TREE_TYPE (arg)) == UNBOUND_CLASS_TEMPLATE)
3900 /* The number of argument required is not known yet.
3901 Just accept it for now. */
3902 val = TREE_TYPE (arg);
3905 tree parmparm = DECL_INNERMOST_TEMPLATE_PARMS (parm);
3906 tree argparm = DECL_INNERMOST_TEMPLATE_PARMS (arg);
3908 if (coerce_template_template_parms (parmparm, argparm,
3914 /* TEMPLATE_TEMPLATE_PARM node is preferred over
3916 if (val != error_mark_node
3917 && DECL_TEMPLATE_TEMPLATE_PARM_P (val))
3918 val = TREE_TYPE (val);
3922 if (in_decl && (complain & tf_error))
3924 error ("type/value mismatch at argument %d in "
3925 "template parameter list for %qD",
3927 error (" expected a template of type %qD, got %qD",
3931 val = error_mark_node;
3937 /* We only form one instance of each template specialization.
3938 Therefore, if we use a non-canonical variant (i.e., a
3939 typedef), any future messages referring to the type will use
3940 the typedef, which is confusing if those future uses do not
3941 themselves also use the typedef. */
3943 val = canonical_type_variant (val);
3947 tree t = tsubst (TREE_TYPE (parm), args, complain, in_decl);
3949 if (invalid_nontype_parm_type_p (t, complain))
3950 return error_mark_node;
3952 if (!uses_template_parms (arg) && !uses_template_parms (t))
3953 /* We used to call digest_init here. However, digest_init
3954 will report errors, which we don't want when complain
3955 is zero. More importantly, digest_init will try too
3956 hard to convert things: for example, `0' should not be
3957 converted to pointer type at this point according to
3958 the standard. Accepting this is not merely an
3959 extension, since deciding whether or not these
3960 conversions can occur is part of determining which
3961 function template to call, or whether a given explicit
3962 argument specification is valid. */
3963 val = convert_nontype_argument (t, arg);
3967 if (val == NULL_TREE)
3968 val = error_mark_node;
3969 else if (val == error_mark_node && (complain & tf_error))
3970 error ("could not convert template argument %qE to %qT", arg, t);
3976 /* Convert all template arguments to their appropriate types, and
3977 return a vector containing the innermost resulting template
3978 arguments. If any error occurs, return error_mark_node. Error and
3979 warning messages are issued under control of COMPLAIN.
3981 If REQUIRE_ALL_ARGUMENTS is nonzero, all arguments must be
3982 provided in ARGLIST, or else trailing parameters must have default
3983 values. If REQUIRE_ALL_ARGUMENTS is zero, we will attempt argument
3984 deduction for any unspecified trailing arguments. */
3987 coerce_template_parms (tree parms,
3990 tsubst_flags_t complain,
3991 int require_all_arguments)
3993 int nparms, nargs, i, lost = 0;
3996 tree new_inner_args;
3998 inner_args = INNERMOST_TEMPLATE_ARGS (args);
3999 nargs = inner_args ? NUM_TMPL_ARGS (inner_args) : 0;
4000 nparms = TREE_VEC_LENGTH (parms);
4004 && require_all_arguments
4005 && TREE_PURPOSE (TREE_VEC_ELT (parms, nargs)) == NULL_TREE))
4007 if (complain & tf_error)
4009 error ("wrong number of template arguments (%d, should be %d)",
4013 error ("provided for %q+D", in_decl);
4016 return error_mark_node;
4019 new_inner_args = make_tree_vec (nparms);
4020 new_args = add_outermost_template_args (args, new_inner_args);
4021 for (i = 0; i < nparms; i++)
4026 /* Get the Ith template parameter. */
4027 parm = TREE_VEC_ELT (parms, i);
4029 /* Calculate the Ith argument. */
4031 arg = TREE_VEC_ELT (inner_args, i);
4032 else if (require_all_arguments)
4033 /* There must be a default arg in this case. */
4034 arg = tsubst_template_arg (TREE_PURPOSE (parm), new_args,
4040 if (arg == error_mark_node)
4042 if (complain & tf_error)
4043 error ("template argument %d is invalid", i + 1);
4046 arg = convert_template_argument (TREE_VALUE (parm),
4047 arg, new_args, complain, i,
4050 if (arg == error_mark_node)
4052 TREE_VEC_ELT (new_inner_args, i) = arg;
4056 return error_mark_node;
4058 return new_inner_args;
4061 /* Returns 1 if template args OT and NT are equivalent. */
4064 template_args_equal (tree ot, tree nt)
4069 if (TREE_CODE (nt) == TREE_VEC)
4070 /* For member templates */
4071 return TREE_CODE (ot) == TREE_VEC && comp_template_args (ot, nt);
4072 else if (TYPE_P (nt))
4073 return TYPE_P (ot) && same_type_p (ot, nt);
4074 else if (TREE_CODE (ot) == TREE_VEC || TYPE_P (ot))
4077 return cp_tree_equal (ot, nt);
4080 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets
4081 of template arguments. Returns 0 otherwise. */
4084 comp_template_args (tree oldargs, tree newargs)
4088 if (TREE_VEC_LENGTH (oldargs) != TREE_VEC_LENGTH (newargs))
4091 for (i = 0; i < TREE_VEC_LENGTH (oldargs); ++i)
4093 tree nt = TREE_VEC_ELT (newargs, i);
4094 tree ot = TREE_VEC_ELT (oldargs, i);
4096 if (! template_args_equal (ot, nt))
4102 /* Given class template name and parameter list, produce a user-friendly name
4103 for the instantiation. */
4106 mangle_class_name_for_template (const char* name, tree parms, tree arglist)
4108 static struct obstack scratch_obstack;
4109 static char *scratch_firstobj;
4112 if (!scratch_firstobj)
4113 gcc_obstack_init (&scratch_obstack);
4115 obstack_free (&scratch_obstack, scratch_firstobj);
4116 scratch_firstobj = obstack_alloc (&scratch_obstack, 1);
4118 #define ccat(C) obstack_1grow (&scratch_obstack, (C));
4119 #define cat(S) obstack_grow (&scratch_obstack, (S), strlen (S))
4123 nparms = TREE_VEC_LENGTH (parms);
4124 arglist = INNERMOST_TEMPLATE_ARGS (arglist);
4125 gcc_assert (nparms == TREE_VEC_LENGTH (arglist));
4126 for (i = 0; i < nparms; i++)
4128 tree parm = TREE_VALUE (TREE_VEC_ELT (parms, i));
4129 tree arg = TREE_VEC_ELT (arglist, i);
4134 if (TREE_CODE (parm) == TYPE_DECL)
4136 cat (type_as_string (arg, TFF_CHASE_TYPEDEF));
4139 else if (TREE_CODE (parm) == TEMPLATE_DECL)
4141 if (TREE_CODE (arg) == TEMPLATE_DECL)
4143 /* Already substituted with real template. Just output
4144 the template name here */
4145 tree context = DECL_CONTEXT (arg);
4148 /* The template may be defined in a namespace, or
4149 may be a member template. */
4150 gcc_assert (TREE_CODE (context) == NAMESPACE_DECL
4151 || CLASS_TYPE_P (context));
4152 cat (decl_as_string (DECL_CONTEXT (arg),
4153 TFF_PLAIN_IDENTIFIER));
4156 cat (IDENTIFIER_POINTER (DECL_NAME (arg)));
4159 /* Output the parameter declaration. */
4160 cat (type_as_string (arg, TFF_CHASE_TYPEDEF));
4164 gcc_assert (TREE_CODE (parm) == PARM_DECL);
4166 /* No need to check arglist against parmlist here; we did that
4167 in coerce_template_parms, called from lookup_template_class. */
4168 cat (expr_as_string (arg, TFF_PLAIN_IDENTIFIER));
4171 char *bufp = obstack_next_free (&scratch_obstack);
4173 while (bufp[offset - 1] == ' ')
4175 obstack_blank_fast (&scratch_obstack, offset);
4177 /* B<C<char> >, not B<C<char>> */
4178 if (bufp[offset - 1] == '>')
4183 return (char *) obstack_base (&scratch_obstack);
4187 classtype_mangled_name (tree t)
4189 if (CLASSTYPE_TEMPLATE_INFO (t)
4190 /* Specializations have already had their names set up in
4191 lookup_template_class. */
4192 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (t))
4194 tree tmpl = most_general_template (CLASSTYPE_TI_TEMPLATE (t));
4196 /* For non-primary templates, the template parameters are
4197 implicit from their surrounding context. */
4198 if (PRIMARY_TEMPLATE_P (tmpl))
4200 tree name = DECL_NAME (tmpl);
4201 char *mangled_name = mangle_class_name_for_template
4202 (IDENTIFIER_POINTER (name),
4203 DECL_INNERMOST_TEMPLATE_PARMS (tmpl),
4204 CLASSTYPE_TI_ARGS (t));
4205 tree id = get_identifier (mangled_name);
4206 IDENTIFIER_TEMPLATE (id) = name;
4211 return TYPE_IDENTIFIER (t);
4215 add_pending_template (tree d)
4217 tree ti = (TYPE_P (d)
4218 ? CLASSTYPE_TEMPLATE_INFO (d)
4219 : DECL_TEMPLATE_INFO (d));
4223 if (TI_PENDING_TEMPLATE_FLAG (ti))
4226 /* We are called both from instantiate_decl, where we've already had a
4227 tinst_level pushed, and instantiate_template, where we haven't.
4229 level = !(current_tinst_level && TINST_DECL (current_tinst_level) == d);
4232 push_tinst_level (d);
4234 pt = tree_cons (current_tinst_level, d, NULL_TREE);
4235 if (last_pending_template)
4236 TREE_CHAIN (last_pending_template) = pt;
4238 pending_templates = pt;
4240 last_pending_template = pt;
4242 TI_PENDING_TEMPLATE_FLAG (ti) = 1;
4249 /* Return a TEMPLATE_ID_EXPR corresponding to the indicated FNS and
4250 ARGLIST. Valid choices for FNS are given in the cp-tree.def
4251 documentation for TEMPLATE_ID_EXPR. */
4254 lookup_template_function (tree fns, tree arglist)
4258 if (fns == error_mark_node || arglist == error_mark_node)
4259 return error_mark_node;
4261 gcc_assert (!arglist || TREE_CODE (arglist) == TREE_VEC);
4262 gcc_assert (fns && (is_overloaded_fn (fns)
4263 || TREE_CODE (fns) == IDENTIFIER_NODE));
4265 if (BASELINK_P (fns))
4267 BASELINK_FUNCTIONS (fns) = build2 (TEMPLATE_ID_EXPR,
4269 BASELINK_FUNCTIONS (fns),
4274 type = TREE_TYPE (fns);
4275 if (TREE_CODE (fns) == OVERLOAD || !type)
4276 type = unknown_type_node;
4278 return build2 (TEMPLATE_ID_EXPR, type, fns, arglist);
4281 /* Within the scope of a template class S<T>, the name S gets bound
4282 (in build_self_reference) to a TYPE_DECL for the class, not a
4283 TEMPLATE_DECL. If DECL is a TYPE_DECL for current_class_type,
4284 or one of its enclosing classes, and that type is a template,
4285 return the associated TEMPLATE_DECL. Otherwise, the original
4286 DECL is returned. */
4289 maybe_get_template_decl_from_type_decl (tree decl)
4291 return (decl != NULL_TREE
4292 && TREE_CODE (decl) == TYPE_DECL
4293 && DECL_ARTIFICIAL (decl)
4294 && CLASS_TYPE_P (TREE_TYPE (decl))
4295 && CLASSTYPE_TEMPLATE_INFO (TREE_TYPE (decl)))
4296 ? CLASSTYPE_TI_TEMPLATE (TREE_TYPE (decl)) : decl;
4299 /* Given an IDENTIFIER_NODE (type TEMPLATE_DECL) and a chain of
4300 parameters, find the desired type.
4302 D1 is the PTYPENAME terminal, and ARGLIST is the list of arguments.
4304 IN_DECL, if non-NULL, is the template declaration we are trying to
4307 If ENTERING_SCOPE is nonzero, we are about to enter the scope of
4308 the class we are looking up.
4310 Issue error and warning messages under control of COMPLAIN.
4312 If the template class is really a local class in a template
4313 function, then the FUNCTION_CONTEXT is the function in which it is
4316 ??? Note that this function is currently called *twice* for each
4317 template-id: the first time from the parser, while creating the
4318 incomplete type (finish_template_type), and the second type during the
4319 real instantiation (instantiate_template_class). This is surely something
4320 that we want to avoid. It also causes some problems with argument
4321 coercion (see convert_nontype_argument for more information on this). */
4324 lookup_template_class (tree d1,
4329 tsubst_flags_t complain)
4331 tree template = NULL_TREE, parmlist;
4334 timevar_push (TV_NAME_LOOKUP);
4336 if (TREE_CODE (d1) == IDENTIFIER_NODE)
4338 tree value = innermost_non_namespace_value (d1);
4339 if (value && DECL_TEMPLATE_TEMPLATE_PARM_P (value))
4344 push_decl_namespace (context);
4345 template = lookup_name (d1);
4346 template = maybe_get_template_decl_from_type_decl (template);
4348 pop_decl_namespace ();
4351 context = DECL_CONTEXT (template);
4353 else if (TREE_CODE (d1) == TYPE_DECL && IS_AGGR_TYPE (TREE_TYPE (d1)))
4355 tree type = TREE_TYPE (d1);
4357 /* If we are declaring a constructor, say A<T>::A<T>, we will get
4358 an implicit typename for the second A. Deal with it. */
4359 if (TREE_CODE (type) == TYPENAME_TYPE && TREE_TYPE (type))
4360 type = TREE_TYPE (type);
4362 if (CLASSTYPE_TEMPLATE_INFO (type))
4364 template = CLASSTYPE_TI_TEMPLATE (type);
4365 d1 = DECL_NAME (template);
4368 else if (TREE_CODE (d1) == ENUMERAL_TYPE
4369 || (TYPE_P (d1) && IS_AGGR_TYPE (d1)))
4371 template = TYPE_TI_TEMPLATE (d1);
4372 d1 = DECL_NAME (template);
4374 else if (TREE_CODE (d1) == TEMPLATE_DECL
4375 && TREE_CODE (DECL_TEMPLATE_RESULT (d1)) == TYPE_DECL)
4378 d1 = DECL_NAME (template);
4379 context = DECL_CONTEXT (template);
4382 /* Issue an error message if we didn't find a template. */
4385 if (complain & tf_error)
4386 error ("%qT is not a template", d1);
4387 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node);
4390 if (TREE_CODE (template) != TEMPLATE_DECL
4391 /* Make sure it's a user visible template, if it was named by
4393 || ((complain & tf_user) && !DECL_TEMPLATE_PARM_P (template)
4394 && !PRIMARY_TEMPLATE_P (template)))
4396 if (complain & tf_error)
4398 error ("non-template type %qT used as a template", d1);
4400 error ("for template declaration %q+D", in_decl);
4402 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node);
4405 complain &= ~tf_user;
4407 if (DECL_TEMPLATE_TEMPLATE_PARM_P (template))
4409 /* Create a new TEMPLATE_DECL and TEMPLATE_TEMPLATE_PARM node to store
4410 template arguments */
4415 parmlist = DECL_INNERMOST_TEMPLATE_PARMS (template);
4417 /* Consider an example where a template template parameter declared as
4419 template <class T, class U = std::allocator<T> > class TT
4421 The template parameter level of T and U are one level larger than
4422 of TT. To proper process the default argument of U, say when an
4423 instantiation `TT<int>' is seen, we need to build the full
4424 arguments containing {int} as the innermost level. Outer levels,
4425 available when not appearing as default template argument, can be
4426 obtained from `current_template_args ()'.
4428 Suppose that TT is later substituted with std::vector. The above
4429 instantiation is `TT<int, std::allocator<T> >' with TT at
4430 level 1, and T at level 2, while the template arguments at level 1
4431 becomes {std::vector} and the inner level 2 is {int}. */
4433 if (current_template_parms)
4434 arglist = add_to_template_args (current_template_args (), arglist);
4436 arglist2 = coerce_template_parms (parmlist, arglist, template,
4437 complain, /*require_all_args=*/1);
4438 if (arglist2 == error_mark_node
4439 || (!uses_template_parms (arglist2)
4440 && check_instantiated_args (template, arglist2, complain)))
4441 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node);
4443 parm = bind_template_template_parm (TREE_TYPE (template), arglist2);
4444 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, parm);
4448 tree template_type = TREE_TYPE (template);
4451 tree found = NULL_TREE;
4454 int is_partial_instantiation;
4456 gen_tmpl = most_general_template (template);
4457 parmlist = DECL_TEMPLATE_PARMS (gen_tmpl);
4458 parm_depth = TMPL_PARMS_DEPTH (parmlist);
4459 arg_depth = TMPL_ARGS_DEPTH (arglist);
4461 if (arg_depth == 1 && parm_depth > 1)
4463 /* We've been given an incomplete set of template arguments.
4466 template <class T> struct S1 {
4467 template <class U> struct S2 {};
4468 template <class U> struct S2<U*> {};
4471 we will be called with an ARGLIST of `U*', but the
4472 TEMPLATE will be `template <class T> template
4473 <class U> struct S1<T>::S2'. We must fill in the missing
4476 = add_outermost_template_args (TYPE_TI_ARGS (TREE_TYPE (template)),
4478 arg_depth = TMPL_ARGS_DEPTH (arglist);
4481 /* Now we should have enough arguments. */
4482 gcc_assert (parm_depth == arg_depth);
4484 /* From here on, we're only interested in the most general
4486 template = gen_tmpl;
4488 /* Calculate the BOUND_ARGS. These will be the args that are
4489 actually tsubst'd into the definition to create the
4493 /* We have multiple levels of arguments to coerce, at once. */
4495 int saved_depth = TMPL_ARGS_DEPTH (arglist);
4497 tree bound_args = make_tree_vec (parm_depth);
4499 for (i = saved_depth,
4500 t = DECL_TEMPLATE_PARMS (template);
4501 i > 0 && t != NULL_TREE;
4502 --i, t = TREE_CHAIN (t))
4504 tree a = coerce_template_parms (TREE_VALUE (t),
4506 complain, /*require_all_args=*/1);
4508 /* Don't process further if one of the levels fails. */
4509 if (a == error_mark_node)
4511 /* Restore the ARGLIST to its full size. */
4512 TREE_VEC_LENGTH (arglist) = saved_depth;
4513 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node);
4516 SET_TMPL_ARGS_LEVEL (bound_args, i, a);
4518 /* We temporarily reduce the length of the ARGLIST so
4519 that coerce_template_parms will see only the arguments
4520 corresponding to the template parameters it is
4522 TREE_VEC_LENGTH (arglist)--;
4525 /* Restore the ARGLIST to its full size. */
4526 TREE_VEC_LENGTH (arglist) = saved_depth;
4528 arglist = bound_args;
4532 = coerce_template_parms (INNERMOST_TEMPLATE_PARMS (parmlist),
4533 INNERMOST_TEMPLATE_ARGS (arglist),
4535 complain, /*require_all_args=*/1);
4537 if (arglist == error_mark_node)
4538 /* We were unable to bind the arguments. */
4539 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node);
4541 /* In the scope of a template class, explicit references to the
4542 template class refer to the type of the template, not any
4543 instantiation of it. For example, in:
4545 template <class T> class C { void f(C<T>); }
4547 the `C<T>' is just the same as `C'. Outside of the
4548 class, however, such a reference is an instantiation. */
4549 if (comp_template_args (TYPE_TI_ARGS (template_type),
4552 found = template_type;
4554 if (!entering_scope && PRIMARY_TEMPLATE_P (template))
4558 for (ctx = current_class_type;
4559 ctx && TREE_CODE (ctx) != NAMESPACE_DECL;
4561 ? TYPE_CONTEXT (ctx)
4562 : DECL_CONTEXT (ctx)))
4563 if (TYPE_P (ctx) && same_type_p (ctx, template_type))
4566 /* We're not in the scope of the class, so the
4567 TEMPLATE_TYPE is not the type we want after all. */
4573 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, found);
4575 /* If we already have this specialization, return it. */
4576 found = retrieve_specialization (template, arglist,
4577 /*class_specializations_p=*/false);
4579 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, found);
4581 /* This type is a "partial instantiation" if any of the template
4582 arguments still involve template parameters. Note that we set
4583 IS_PARTIAL_INSTANTIATION for partial specializations as
4585 is_partial_instantiation = uses_template_parms (arglist);
4587 /* If the deduced arguments are invalid, then the binding
4589 if (!is_partial_instantiation
4590 && check_instantiated_args (template,
4591 INNERMOST_TEMPLATE_ARGS (arglist),
4593 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node);
4595 if (!is_partial_instantiation
4596 && !PRIMARY_TEMPLATE_P (template)
4597 && TREE_CODE (CP_DECL_CONTEXT (template)) == NAMESPACE_DECL)
4599 found = xref_tag_from_type (TREE_TYPE (template),
4600 DECL_NAME (template),
4601 /*tag_scope=*/ts_global);
4602 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, found);
4605 context = tsubst (DECL_CONTEXT (template), arglist,
4608 context = global_namespace;
4610 /* Create the type. */
4611 if (TREE_CODE (template_type) == ENUMERAL_TYPE)
4613 if (!is_partial_instantiation)
4615 set_current_access_from_decl (TYPE_NAME (template_type));
4616 t = start_enum (TYPE_IDENTIFIER (template_type));
4619 /* We don't want to call start_enum for this type, since
4620 the values for the enumeration constants may involve
4621 template parameters. And, no one should be interested
4622 in the enumeration constants for such a type. */
4623 t = make_node (ENUMERAL_TYPE);
4627 t = make_aggr_type (TREE_CODE (template_type));
4628 CLASSTYPE_DECLARED_CLASS (t)
4629 = CLASSTYPE_DECLARED_CLASS (template_type);
4630 SET_CLASSTYPE_IMPLICIT_INSTANTIATION (t);
4631 TYPE_FOR_JAVA (t) = TYPE_FOR_JAVA (template_type);
4633 /* A local class. Make sure the decl gets registered properly. */
4634 if (context == current_function_decl)
4635 pushtag (DECL_NAME (template), t, /*tag_scope=*/ts_current);
4638 /* If we called start_enum or pushtag above, this information
4639 will already be set up. */
4642 TYPE_CONTEXT (t) = FROB_CONTEXT (context);
4644 type_decl = create_implicit_typedef (DECL_NAME (template), t);
4645 DECL_CONTEXT (type_decl) = TYPE_CONTEXT (t);
4646 TYPE_STUB_DECL (t) = type_decl;
4647 DECL_SOURCE_LOCATION (type_decl)
4648 = DECL_SOURCE_LOCATION (TYPE_STUB_DECL (template_type));
4651 type_decl = TYPE_NAME (t);
4653 TREE_PRIVATE (type_decl)
4654 = TREE_PRIVATE (TYPE_STUB_DECL (template_type));
4655 TREE_PROTECTED (type_decl)
4656 = TREE_PROTECTED (TYPE_STUB_DECL (template_type));
4657 DECL_IN_SYSTEM_HEADER (type_decl)
4658 = DECL_IN_SYSTEM_HEADER (template);
4659 if (CLASSTYPE_VISIBILITY_SPECIFIED (template_type))
4661 DECL_VISIBILITY_SPECIFIED (type_decl) = 1;
4662 DECL_VISIBILITY (type_decl) = CLASSTYPE_VISIBILITY (template_type);
4665 /* Set up the template information. We have to figure out which
4666 template is the immediate parent if this is a full
4668 if (parm_depth == 1 || is_partial_instantiation
4669 || !PRIMARY_TEMPLATE_P (template))
4670 /* This case is easy; there are no member templates involved. */
4674 /* This is a full instantiation of a member template. Look
4675 for a partial instantiation of which this is an instance. */
4677 for (found = DECL_TEMPLATE_INSTANTIATIONS (template);
4678 found; found = TREE_CHAIN (found))
4681 tree tmpl = CLASSTYPE_TI_TEMPLATE (TREE_VALUE (found));
4683 /* We only want partial instantiations, here, not
4684 specializations or full instantiations. */
4685 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_VALUE (found))
4686 || !uses_template_parms (TREE_VALUE (found)))
4689 /* Temporarily reduce by one the number of levels in the
4690 ARGLIST and in FOUND so as to avoid comparing the
4691 last set of arguments. */
4692 TREE_VEC_LENGTH (arglist)--;
4693 TREE_VEC_LENGTH (TREE_PURPOSE (found)) --;
4695 /* See if the arguments match. If they do, then TMPL is
4696 the partial instantiation we want. */
4697 success = comp_template_args (TREE_PURPOSE (found), arglist);
4699 /* Restore the argument vectors to their full size. */
4700 TREE_VEC_LENGTH (arglist)++;
4701 TREE_VEC_LENGTH (TREE_PURPOSE (found))++;
4712 /* There was no partial instantiation. This happens
4713 where C<T> is a member template of A<T> and it's used
4716 template <typename T> struct B { A<T>::C<int> m; };
4719 Create the partial instantiation.
4721 TREE_VEC_LENGTH (arglist)--;
4722 found = tsubst (template, arglist, complain, NULL_TREE);
4723 TREE_VEC_LENGTH (arglist)++;
4727 SET_TYPE_TEMPLATE_INFO (t, tree_cons (found, arglist, NULL_TREE));
4728 DECL_TEMPLATE_INSTANTIATIONS (template)
4729 = tree_cons (arglist, t,
4730 DECL_TEMPLATE_INSTANTIATIONS (template));
4732 if (TREE_CODE (t) == ENUMERAL_TYPE
4733 && !is_partial_instantiation)
4734 /* Now that the type has been registered on the instantiations
4735 list, we set up the enumerators. Because the enumeration
4736 constants may involve the enumeration type itself, we make
4737 sure to register the type first, and then create the
4738 constants. That way, doing tsubst_expr for the enumeration
4739 constants won't result in recursive calls here; we'll find
4740 the instantiation and exit above. */
4741 tsubst_enum (template_type, t, arglist);
4743 /* Reset the name of the type, now that CLASSTYPE_TEMPLATE_INFO
4745 if (TREE_CODE (t) != ENUMERAL_TYPE)
4746 DECL_NAME (type_decl) = classtype_mangled_name (t);
4747 if (is_partial_instantiation)
4748 /* If the type makes use of template parameters, the
4749 code that generates debugging information will crash. */
4750 DECL_IGNORED_P (TYPE_STUB_DECL (t)) = 1;
4752 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, t);
4754 timevar_pop (TV_NAME_LOOKUP);
4761 struct pointer_set_t *visited;
4764 /* Called from for_each_template_parm via walk_tree. */
4767 for_each_template_parm_r (tree *tp, int *walk_subtrees, void *d)
4770 struct pair_fn_data *pfd = (struct pair_fn_data *) d;
4771 tree_fn_t fn = pfd->fn;
4772 void *data = pfd->data;
4775 && for_each_template_parm (TYPE_CONTEXT (t), fn, data, pfd->visited))
4776 return error_mark_node;
4778 switch (TREE_CODE (t))
4781 if (TYPE_PTRMEMFUNC_P (t))
4787 if (!TYPE_TEMPLATE_INFO (t))
4789 else if (for_each_template_parm (TREE_VALUE (TYPE_TEMPLATE_INFO (t)),
4790 fn, data, pfd->visited))
4791 return error_mark_node;
4795 /* Since we're not going to walk subtrees, we have to do this
4797 if (for_each_template_parm (TYPE_METHOD_BASETYPE (t), fn, data,
4799 return error_mark_node;
4803 /* Check the return type. */
4804 if (for_each_template_parm (TREE_TYPE (t), fn, data, pfd->visited))
4805 return error_mark_node;
4807 /* Check the parameter types. Since default arguments are not
4808 instantiated until they are needed, the TYPE_ARG_TYPES may
4809 contain expressions that involve template parameters. But,
4810 no-one should be looking at them yet. And, once they're
4811 instantiated, they don't contain template parameters, so
4812 there's no point in looking at them then, either. */
4816 for (parm = TYPE_ARG_TYPES (t); parm; parm = TREE_CHAIN (parm))
4817 if (for_each_template_parm (TREE_VALUE (parm), fn, data,
4819 return error_mark_node;
4821 /* Since we've already handled the TYPE_ARG_TYPES, we don't
4822 want walk_tree walking into them itself. */
4828 if (for_each_template_parm (TYPE_FIELDS (t), fn, data,
4830 return error_mark_node;
4835 if (DECL_LANG_SPECIFIC (t) && DECL_TEMPLATE_INFO (t)
4836 && for_each_template_parm (DECL_TI_ARGS (t), fn, data,
4838 return error_mark_node;
4843 if (TREE_CODE (t) == CONST_DECL && DECL_TEMPLATE_PARM_P (t)
4844 && for_each_template_parm (DECL_INITIAL (t), fn, data,
4846 return error_mark_node;
4847 if (DECL_CONTEXT (t)
4848 && for_each_template_parm (DECL_CONTEXT (t), fn, data,
4850 return error_mark_node;
4853 case BOUND_TEMPLATE_TEMPLATE_PARM:
4854 /* Record template parameters such as `T' inside `TT<T>'. */
4855 if (for_each_template_parm (TYPE_TI_ARGS (t), fn, data, pfd->visited))
4856 return error_mark_node;
4859 case TEMPLATE_TEMPLATE_PARM:
4860 case TEMPLATE_TYPE_PARM:
4861 case TEMPLATE_PARM_INDEX:
4862 if (fn && (*fn)(t, data))
4863 return error_mark_node;
4865 return error_mark_node;
4869 /* A template template parameter is encountered. */
4870 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t)
4871 && for_each_template_parm (TREE_TYPE (t), fn, data, pfd->visited))
4872 return error_mark_node;
4874 /* Already substituted template template parameter */
4880 || for_each_template_parm (TYPENAME_TYPE_FULLNAME (t), fn,
4881 data, pfd->visited))
4882 return error_mark_node;
4886 if (TREE_TYPE (t) && TYPE_PTRMEMFUNC_P (TREE_TYPE (t))
4887 && for_each_template_parm (TYPE_PTRMEMFUNC_FN_TYPE
4888 (TREE_TYPE (t)), fn, data,
4890 return error_mark_node;
4895 /* If there's no type, then this thing must be some expression
4896 involving template parameters. */
4897 if (!fn && !TREE_TYPE (t))
4898 return error_mark_node;
4903 case REINTERPRET_CAST_EXPR:
4904 case CONST_CAST_EXPR:
4905 case STATIC_CAST_EXPR:
4906 case DYNAMIC_CAST_EXPR:
4910 case PSEUDO_DTOR_EXPR:
4912 return error_mark_node;
4916 /* If we do not handle this case specially, we end up walking
4917 the BINFO hierarchy, which is circular, and therefore
4918 confuses walk_tree. */
4920 if (for_each_template_parm (BASELINK_FUNCTIONS (*tp), fn, data,
4922 return error_mark_node;
4929 /* We didn't find any template parameters we liked. */
4933 /* For each TEMPLATE_TYPE_PARM, TEMPLATE_TEMPLATE_PARM,
4934 BOUND_TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX in T,
4935 call FN with the parameter and the DATA.
4936 If FN returns nonzero, the iteration is terminated, and
4937 for_each_template_parm returns 1. Otherwise, the iteration
4938 continues. If FN never returns a nonzero value, the value
4939 returned by for_each_template_parm is 0. If FN is NULL, it is
4940 considered to be the function which always returns 1. */
4943 for_each_template_parm (tree t, tree_fn_t fn, void* data,
4944 struct pointer_set_t *visited)
4946 struct pair_fn_data pfd;
4953 /* Walk the tree. (Conceptually, we would like to walk without
4954 duplicates, but for_each_template_parm_r recursively calls
4955 for_each_template_parm, so we would need to reorganize a fair
4956 bit to use walk_tree_without_duplicates, so we keep our own
4959 pfd.visited = visited;
4961 pfd.visited = pointer_set_create ();
4962 result = walk_tree (&t,
4963 for_each_template_parm_r,
4965 pfd.visited) != NULL_TREE;
4970 pointer_set_destroy (pfd.visited);
4977 /* Returns true if T depends on any template parameter. */
4980 uses_template_parms (tree t)
4983 int saved_processing_template_decl;
4985 saved_processing_template_decl = processing_template_decl;
4986 if (!saved_processing_template_decl)
4987 processing_template_decl = 1;
4989 dependent_p = dependent_type_p (t);
4990 else if (TREE_CODE (t) == TREE_VEC)
4991 dependent_p = any_dependent_template_arguments_p (t);
4992 else if (TREE_CODE (t) == TREE_LIST)
4993 dependent_p = (uses_template_parms (TREE_VALUE (t))
4994 || uses_template_parms (TREE_CHAIN (t)));
4995 else if (TREE_CODE (t) == TYPE_DECL)
4996 dependent_p = dependent_type_p (TREE_TYPE (t));
4999 || TREE_CODE (t) == TEMPLATE_PARM_INDEX
5000 || TREE_CODE (t) == OVERLOAD
5001 || TREE_CODE (t) == BASELINK
5002 || TREE_CODE (t) == IDENTIFIER_NODE
5003 || CONSTANT_CLASS_P (t))
5004 dependent_p = (type_dependent_expression_p (t)
5005 || value_dependent_expression_p (t));
5008 gcc_assert (t == error_mark_node);
5009 dependent_p = false;
5012 processing_template_decl = saved_processing_template_decl;
5017 /* Returns true if T depends on any template parameter with level LEVEL. */
5020 uses_template_parms_level (tree t, int level)
5022 return for_each_template_parm (t, template_parm_this_level_p, &level, NULL);
5025 static int tinst_depth;
5026 extern int max_tinst_depth;
5027 #ifdef GATHER_STATISTICS
5030 static int tinst_level_tick;
5031 static int last_template_error_tick;
5033 /* We're starting to instantiate D; record the template instantiation context
5034 for diagnostics and to restore it later. */
5037 push_tinst_level (tree d)
5041 if (tinst_depth >= max_tinst_depth)
5043 /* If the instantiation in question still has unbound template parms,
5044 we don't really care if we can't instantiate it, so just return.
5045 This happens with base instantiation for implicit `typename'. */
5046 if (uses_template_parms (d))
5049 last_template_error_tick = tinst_level_tick;
5050 error ("template instantiation depth exceeds maximum of %d (use "
5051 "-ftemplate-depth-NN to increase the maximum) instantiating %qD",
5052 max_tinst_depth, d);
5054 print_instantiation_context ();
5059 new = make_node (TINST_LEVEL);
5060 TINST_DECL (new) = d;
5061 TINST_LOCATION (new) = input_location;
5062 TINST_IN_SYSTEM_HEADER_P (new) = in_system_header;
5063 TREE_CHAIN (new) = current_tinst_level;
5064 current_tinst_level = new;
5067 #ifdef GATHER_STATISTICS
5068 if (tinst_depth > depth_reached)
5069 depth_reached = tinst_depth;
5076 /* We're done instantiating this template; return to the instantiation
5080 pop_tinst_level (void)
5082 tree old = current_tinst_level;
5084 /* Restore the filename and line number stashed away when we started
5085 this instantiation. */
5086 input_location = TINST_LOCATION (old);
5087 in_system_header = TINST_IN_SYSTEM_HEADER_P (old);
5088 current_tinst_level = TREE_CHAIN (old);
5093 /* We're instantiating a deferred template; restore the template
5094 instantiation context in which the instantiation was requested, which
5095 is one step out from LEVEL. */
5098 reopen_tinst_level (tree level)
5103 for (t = level; t; t = TREE_CHAIN (t))
5106 current_tinst_level = level;
5110 /* DECL is a friend FUNCTION_DECL or TEMPLATE_DECL. ARGS is the
5111 vector of template arguments, as for tsubst.
5113 Returns an appropriate tsubst'd friend declaration. */
5116 tsubst_friend_function (tree decl, tree args)
5120 if (TREE_CODE (decl) == FUNCTION_DECL
5121 && DECL_TEMPLATE_INSTANTIATION (decl)
5122 && TREE_CODE (DECL_TI_TEMPLATE (decl)) != TEMPLATE_DECL)
5123 /* This was a friend declared with an explicit template
5124 argument list, e.g.:
5128 to indicate that f was a template instantiation, not a new
5129 function declaration. Now, we have to figure out what
5130 instantiation of what template. */
5132 tree template_id, arglist, fns;
5135 tree ns = decl_namespace_context (TYPE_MAIN_DECL (current_class_type));
5137 /* Friend functions are looked up in the containing namespace scope.
5138 We must enter that scope, to avoid finding member functions of the
5139 current cless with same name. */
5140 push_nested_namespace (ns);
5141 fns = tsubst_expr (DECL_TI_TEMPLATE (decl), args,
5142 tf_error | tf_warning, NULL_TREE);
5143 pop_nested_namespace (ns);
5144 arglist = tsubst (DECL_TI_ARGS (decl), args,
5145 tf_error | tf_warning, NULL_TREE);
5146 template_id = lookup_template_function (fns, arglist);
5148 new_friend = tsubst (decl, args, tf_error | tf_warning, NULL_TREE);
5149 tmpl = determine_specialization (template_id, new_friend,
5151 /*need_member_template=*/0,
5152 TREE_VEC_LENGTH (args));
5153 return instantiate_template (tmpl, new_args, tf_error);
5156 new_friend = tsubst (decl, args, tf_error | tf_warning, NULL_TREE);
5158 /* The NEW_FRIEND will look like an instantiation, to the
5159 compiler, but is not an instantiation from the point of view of
5160 the language. For example, we might have had:
5162 template <class T> struct S {
5163 template <class U> friend void f(T, U);
5166 Then, in S<int>, template <class U> void f(int, U) is not an
5167 instantiation of anything. */
5168 if (new_friend == error_mark_node)
5169 return error_mark_node;
5171 DECL_USE_TEMPLATE (new_friend) = 0;
5172 if (TREE_CODE (decl) == TEMPLATE_DECL)
5174 DECL_USE_TEMPLATE (DECL_TEMPLATE_RESULT (new_friend)) = 0;
5175 DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (new_friend))
5176 = DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (decl));
5179 /* The mangled name for the NEW_FRIEND is incorrect. The function
5180 is not a template instantiation and should not be mangled like
5181 one. Therefore, we forget the mangling here; we'll recompute it
5182 later if we need it. */
5183 if (TREE_CODE (new_friend) != TEMPLATE_DECL)
5185 SET_DECL_RTL (new_friend, NULL_RTX);
5186 SET_DECL_ASSEMBLER_NAME (new_friend, NULL_TREE);
5189 if (DECL_NAMESPACE_SCOPE_P (new_friend))
5192 tree new_friend_template_info;
5193 tree new_friend_result_template_info;
5195 int new_friend_is_defn;
5197 /* We must save some information from NEW_FRIEND before calling
5198 duplicate decls since that function will free NEW_FRIEND if
5200 new_friend_template_info = DECL_TEMPLATE_INFO (new_friend);
5201 new_friend_is_defn =
5202 (DECL_INITIAL (DECL_TEMPLATE_RESULT
5203 (template_for_substitution (new_friend)))
5205 if (TREE_CODE (new_friend) == TEMPLATE_DECL)
5207 /* This declaration is a `primary' template. */
5208 DECL_PRIMARY_TEMPLATE (new_friend) = new_friend;
5210 new_friend_result_template_info
5211 = DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (new_friend));
5214 new_friend_result_template_info = NULL_TREE;
5216 /* Inside pushdecl_namespace_level, we will push into the
5217 current namespace. However, the friend function should go
5218 into the namespace of the template. */
5219 ns = decl_namespace_context (new_friend);
5220 push_nested_namespace (ns);
5221 old_decl = pushdecl_namespace_level (new_friend, /*is_friend=*/true);
5222 pop_nested_namespace (ns);
5224 if (old_decl != new_friend)
5226 /* This new friend declaration matched an existing
5227 declaration. For example, given:
5229 template <class T> void f(T);
5230 template <class U> class C {
5231 template <class T> friend void f(T) {}
5234 the friend declaration actually provides the definition
5235 of `f', once C has been instantiated for some type. So,
5236 old_decl will be the out-of-class template declaration,
5237 while new_friend is the in-class definition.
5239 But, if `f' was called before this point, the
5240 instantiation of `f' will have DECL_TI_ARGS corresponding
5241 to `T' but not to `U', references to which might appear
5242 in the definition of `f'. Previously, the most general
5243 template for an instantiation of `f' was the out-of-class
5244 version; now it is the in-class version. Therefore, we
5245 run through all specialization of `f', adding to their
5246 DECL_TI_ARGS appropriately. In particular, they need a
5247 new set of outer arguments, corresponding to the
5248 arguments for this class instantiation.
5250 The same situation can arise with something like this:
5253 template <class T> class C {
5257 when `C<int>' is instantiated. Now, `f(int)' is defined
5260 if (!new_friend_is_defn)
5261 /* On the other hand, if the in-class declaration does
5262 *not* provide a definition, then we don't want to alter
5263 existing definitions. We can just leave everything
5268 /* Overwrite whatever template info was there before, if
5269 any, with the new template information pertaining to
5271 DECL_TEMPLATE_INFO (old_decl) = new_friend_template_info;
5273 if (TREE_CODE (old_decl) != TEMPLATE_DECL)
5274 reregister_specialization (new_friend,
5275 most_general_template (old_decl),
5280 tree new_friend_args;
5282 DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (old_decl))
5283 = new_friend_result_template_info;
5285 new_friend_args = TI_ARGS (new_friend_template_info);
5286 for (t = DECL_TEMPLATE_SPECIALIZATIONS (old_decl);
5290 tree spec = TREE_VALUE (t);
5293 = add_outermost_template_args (new_friend_args,
5294 DECL_TI_ARGS (spec));
5297 /* Now, since specializations are always supposed to
5298 hang off of the most general template, we must move
5300 t = most_general_template (old_decl);
5303 DECL_TEMPLATE_SPECIALIZATIONS (t)
5304 = chainon (DECL_TEMPLATE_SPECIALIZATIONS (t),
5305 DECL_TEMPLATE_SPECIALIZATIONS (old_decl));
5306 DECL_TEMPLATE_SPECIALIZATIONS (old_decl) = NULL_TREE;
5311 /* The information from NEW_FRIEND has been merged into OLD_DECL
5312 by duplicate_decls. */
5313 new_friend = old_decl;
5318 tree context = DECL_CONTEXT (new_friend);
5322 template <class T> class C {
5323 template <class U> friend void C1<U>::f (); // case 1
5324 friend void C2<T>::f (); // case 2
5326 we only need to make sure CONTEXT is a complete type for
5327 case 2. To distinguish between the two cases, we note that
5328 CONTEXT of case 1 remains dependent type after tsubst while
5329 this isn't true for case 2. */
5330 ++processing_template_decl;
5331 dependent_p = dependent_type_p (context);
5332 --processing_template_decl;
5335 && !complete_type_or_else (context, NULL_TREE))
5336 return error_mark_node;
5338 if (COMPLETE_TYPE_P (context))
5340 /* Check to see that the declaration is really present, and,
5341 possibly obtain an improved declaration. */
5342 tree fn = check_classfn (context,
5343 new_friend, NULL_TREE);
5353 /* FRIEND_TMPL is a friend TEMPLATE_DECL. ARGS is the vector of
5354 template arguments, as for tsubst.
5356 Returns an appropriate tsubst'd friend type or error_mark_node on
5360 tsubst_friend_class (tree friend_tmpl, tree args)
5366 context = DECL_CONTEXT (friend_tmpl);
5370 if (TREE_CODE (context) == NAMESPACE_DECL)
5371 push_nested_namespace (context);
5373 push_nested_class (tsubst (context, args, tf_none, NULL_TREE));
5376 /* First, we look for a class template. */
5377 tmpl = lookup_name (DECL_NAME (friend_tmpl));
5379 /* But, if we don't find one, it might be because we're in a
5380 situation like this:
5388 Here, in the scope of (say) S<int>, `S' is bound to a TYPE_DECL
5389 for `S<int>', not the TEMPLATE_DECL. */
5390 if (!tmpl || !DECL_CLASS_TEMPLATE_P (tmpl))
5392 tmpl = lookup_name_prefer_type (DECL_NAME (friend_tmpl), 1);
5393 tmpl = maybe_get_template_decl_from_type_decl (tmpl);
5396 if (tmpl && DECL_CLASS_TEMPLATE_P (tmpl))
5398 /* The friend template has already been declared. Just
5399 check to see that the declarations match, and install any new
5400 default parameters. We must tsubst the default parameters,
5401 of course. We only need the innermost template parameters
5402 because that is all that redeclare_class_template will look
5404 if (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (friend_tmpl))
5405 > TMPL_ARGS_DEPTH (args))
5408 parms = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_tmpl),
5409 args, tf_error | tf_warning);
5410 redeclare_class_template (TREE_TYPE (tmpl), parms);
5413 friend_type = TREE_TYPE (tmpl);
5417 /* The friend template has not already been declared. In this
5418 case, the instantiation of the template class will cause the
5419 injection of this template into the global scope. */
5420 tmpl = tsubst (friend_tmpl, args, tf_error | tf_warning, NULL_TREE);
5422 /* The new TMPL is not an instantiation of anything, so we
5423 forget its origins. We don't reset CLASSTYPE_TI_TEMPLATE for
5424 the new type because that is supposed to be the corresponding
5425 template decl, i.e., TMPL. */
5426 DECL_USE_TEMPLATE (tmpl) = 0;
5427 DECL_TEMPLATE_INFO (tmpl) = NULL_TREE;
5428 CLASSTYPE_USE_TEMPLATE (TREE_TYPE (tmpl)) = 0;
5429 CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl))
5430 = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl)));
5432 /* Inject this template into the global scope. */
5433 friend_type = TREE_TYPE (pushdecl_top_level_maybe_friend (tmpl, true));
5438 if (TREE_CODE (context) == NAMESPACE_DECL)
5439 pop_nested_namespace (context);
5441 pop_nested_class ();
5447 /* Returns zero if TYPE cannot be completed later due to circularity.
5448 Otherwise returns one. */
5451 can_complete_type_without_circularity (tree type)
5453 if (type == NULL_TREE || type == error_mark_node)
5455 else if (COMPLETE_TYPE_P (type))
5457 else if (TREE_CODE (type) == ARRAY_TYPE && TYPE_DOMAIN (type))
5458 return can_complete_type_without_circularity (TREE_TYPE (type));
5459 else if (CLASS_TYPE_P (type)
5460 && TYPE_BEING_DEFINED (TYPE_MAIN_VARIANT (type)))
5467 instantiate_class_template (tree type)
5469 tree template, args, pattern, t, member;
5474 if (type == error_mark_node)
5475 return error_mark_node;
5477 if (TYPE_BEING_DEFINED (type)
5478 || COMPLETE_TYPE_P (type)
5479 || dependent_type_p (type))
5482 /* Figure out which template is being instantiated. */
5483 template = most_general_template (CLASSTYPE_TI_TEMPLATE (type));
5484 gcc_assert (TREE_CODE (template) == TEMPLATE_DECL);
5486 /* Figure out which arguments are being used to do the
5488 args = CLASSTYPE_TI_ARGS (type);
5490 /* Determine what specialization of the original template to
5492 t = most_specialized_class (template, args);
5493 if (t == error_mark_node)
5495 const char *str = "candidates are:";
5496 error ("ambiguous class template instantiation for %q#T", type);
5497 for (t = DECL_TEMPLATE_SPECIALIZATIONS (template); t;
5500 if (get_class_bindings (TREE_VALUE (t), TREE_PURPOSE (t), args))
5502 error ("%s %+#T", str, TREE_TYPE (t));
5506 TYPE_BEING_DEFINED (type) = 1;
5507 return error_mark_node;
5511 pattern = TREE_TYPE (t);
5513 pattern = TREE_TYPE (template);
5515 /* If the template we're instantiating is incomplete, then clearly
5516 there's nothing we can do. */
5517 if (!COMPLETE_TYPE_P (pattern))
5520 /* If we've recursively instantiated too many templates, stop. */
5521 if (! push_tinst_level (type))
5524 /* Now we're really doing the instantiation. Mark the type as in
5525 the process of being defined. */
5526 TYPE_BEING_DEFINED (type) = 1;
5528 /* We may be in the middle of deferred access check. Disable
5530 push_deferring_access_checks (dk_no_deferred);
5532 push_to_top_level ();
5536 /* This TYPE is actually an instantiation of a partial
5537 specialization. We replace the innermost set of ARGS with
5538 the arguments appropriate for substitution. For example,
5541 template <class T> struct S {};
5542 template <class T> struct S<T*> {};
5544 and supposing that we are instantiating S<int*>, ARGS will
5545 present be {int*} but we need {int}. */
5547 = get_class_bindings (TREE_VALUE (t), TREE_PURPOSE (t),
5550 /* If there were multiple levels in ARGS, replacing the
5551 innermost level would alter CLASSTYPE_TI_ARGS, which we don't
5552 want, so we make a copy first. */
5553 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args))
5555 args = copy_node (args);
5556 SET_TMPL_ARGS_LEVEL (args, TMPL_ARGS_DEPTH (args), inner_args);
5562 SET_CLASSTYPE_INTERFACE_UNKNOWN (type);
5564 /* Set the input location to the template definition. This is needed
5565 if tsubsting causes an error. */
5566 typedecl = TYPE_MAIN_DECL (type);
5567 input_location = DECL_SOURCE_LOCATION (typedecl);
5568 in_system_header = DECL_IN_SYSTEM_HEADER (typedecl);
5570 TYPE_HAS_CONSTRUCTOR (type) = TYPE_HAS_CONSTRUCTOR (pattern);
5571 TYPE_HAS_NEW_OPERATOR (type) = TYPE_HAS_NEW_OPERATOR (pattern);
5572 TYPE_HAS_ARRAY_NEW_OPERATOR (type) = TYPE_HAS_ARRAY_NEW_OPERATOR (pattern);
5573 TYPE_GETS_DELETE (type) = TYPE_GETS_DELETE (pattern);
5574 TYPE_HAS_ASSIGN_REF (type) = TYPE_HAS_ASSIGN_REF (pattern);
5575 TYPE_HAS_CONST_ASSIGN_REF (type) = TYPE_HAS_CONST_ASSIGN_REF (pattern);
5576 TYPE_HAS_INIT_REF (type) = TYPE_HAS_INIT_REF (pattern);
5577 TYPE_HAS_CONST_INIT_REF (type) = TYPE_HAS_CONST_INIT_REF (pattern);
5578 TYPE_HAS_DEFAULT_CONSTRUCTOR (type) = TYPE_HAS_DEFAULT_CONSTRUCTOR (pattern);
5579 TYPE_HAS_CONVERSION (type) = TYPE_HAS_CONVERSION (pattern);
5580 TYPE_PACKED (type) = TYPE_PACKED (pattern);
5581 TYPE_ALIGN (type) = TYPE_ALIGN (pattern);
5582 TYPE_USER_ALIGN (type) = TYPE_USER_ALIGN (pattern);
5583 TYPE_FOR_JAVA (type) = TYPE_FOR_JAVA (pattern); /* For libjava's JArray<T> */
5584 if (ANON_AGGR_TYPE_P (pattern))
5585 SET_ANON_AGGR_TYPE_P (type);
5586 if (CLASSTYPE_VISIBILITY_SPECIFIED (pattern))
5588 CLASSTYPE_VISIBILITY_SPECIFIED (type) = 1;
5589 CLASSTYPE_VISIBILITY (type) = CLASSTYPE_VISIBILITY (pattern);
5592 pbinfo = TYPE_BINFO (pattern);
5594 /* We should never instantiate a nested class before its enclosing
5595 class; we need to look up the nested class by name before we can
5596 instantiate it, and that lookup should instantiate the enclosing
5598 gcc_assert (!DECL_CLASS_SCOPE_P (TYPE_MAIN_DECL (pattern))
5599 || COMPLETE_TYPE_P (TYPE_CONTEXT (type))
5600 || TYPE_BEING_DEFINED (TYPE_CONTEXT (type)));
5602 base_list = NULL_TREE;
5603 if (BINFO_N_BASE_BINFOS (pbinfo))
5606 tree context = TYPE_CONTEXT (type);
5610 /* We must enter the scope containing the type, as that is where
5611 the accessibility of types named in dependent bases are
5613 pushed_scope = push_scope (context ? context : global_namespace);
5615 /* Substitute into each of the bases to determine the actual
5617 for (i = 0; BINFO_BASE_ITERATE (pbinfo, i, pbase_binfo); i++)
5620 tree access = BINFO_BASE_ACCESS (pbinfo, i);
5622 /* Substitute to figure out the base class. */
5623 base = tsubst (BINFO_TYPE (pbase_binfo), args, tf_error, NULL_TREE);
5624 if (base == error_mark_node)
5627 base_list = tree_cons (access, base, base_list);
5628 if (BINFO_VIRTUAL_P (pbase_binfo))
5629 TREE_TYPE (base_list) = integer_type_node;
5632 /* The list is now in reverse order; correct that. */
5633 base_list = nreverse (base_list);
5636 pop_scope (pushed_scope);
5638 /* Now call xref_basetypes to set up all the base-class
5640 xref_basetypes (type, base_list);
5643 /* Now that our base classes are set up, enter the scope of the
5644 class, so that name lookups into base classes, etc. will work
5645 correctly. This is precisely analogous to what we do in
5646 begin_class_definition when defining an ordinary non-template
5650 /* Now members are processed in the order of declaration. */
5651 for (member = CLASSTYPE_DECL_LIST (pattern);
5652 member; member = TREE_CHAIN (member))
5654 tree t = TREE_VALUE (member);
5656 if (TREE_PURPOSE (member))
5660 /* Build new CLASSTYPE_NESTED_UTDS. */
5663 bool class_template_p;
5665 class_template_p = (TREE_CODE (t) != ENUMERAL_TYPE
5666 && TYPE_LANG_SPECIFIC (t)
5667 && CLASSTYPE_IS_TEMPLATE (t));
5668 /* If the member is a class template, then -- even after
5669 substitution -- there may be dependent types in the
5670 template argument list for the class. We increment
5671 PROCESSING_TEMPLATE_DECL so that dependent_type_p, as
5672 that function will assume that no types are dependent
5673 when outside of a template. */
5674 if (class_template_p)
5675 ++processing_template_decl;
5676 newtag = tsubst (t, args, tf_error, NULL_TREE);
5677 if (class_template_p)
5678 --processing_template_decl;
5679 if (newtag == error_mark_node)
5682 if (TREE_CODE (newtag) != ENUMERAL_TYPE)
5684 tree name = TYPE_IDENTIFIER (t);
5686 if (class_template_p)
5687 /* Unfortunately, lookup_template_class sets
5688 CLASSTYPE_IMPLICIT_INSTANTIATION for a partial
5689 instantiation (i.e., for the type of a member
5690 template class nested within a template class.)
5691 This behavior is required for
5692 maybe_process_partial_specialization to work
5693 correctly, but is not accurate in this case;
5694 the TAG is not an instantiation of anything.
5695 (The corresponding TEMPLATE_DECL is an
5696 instantiation, but the TYPE is not.) */
5697 CLASSTYPE_USE_TEMPLATE (newtag) = 0;
5699 /* Now, we call pushtag to put this NEWTAG into the scope of
5700 TYPE. We first set up the IDENTIFIER_TYPE_VALUE to avoid
5701 pushtag calling push_template_decl. We don't have to do
5702 this for enums because it will already have been done in
5705 SET_IDENTIFIER_TYPE_VALUE (name, newtag);
5706 pushtag (name, newtag, /*tag_scope=*/ts_current);
5709 else if (TREE_CODE (t) == FUNCTION_DECL
5710 || DECL_FUNCTION_TEMPLATE_P (t))
5712 /* Build new TYPE_METHODS. */
5715 if (TREE_CODE (t) == TEMPLATE_DECL)
5716 ++processing_template_decl;
5717 r = tsubst (t, args, tf_error, NULL_TREE);
5718 if (TREE_CODE (t) == TEMPLATE_DECL)
5719 --processing_template_decl;
5720 set_current_access_from_decl (r);
5721 grok_special_member_properties (r);
5722 finish_member_declaration (r);
5726 /* Build new TYPE_FIELDS. */
5728 if (TREE_CODE (t) != CONST_DECL)
5732 /* The the file and line for this declaration, to
5733 assist in error message reporting. Since we
5734 called push_tinst_level above, we don't need to
5736 input_location = DECL_SOURCE_LOCATION (t);
5738 if (TREE_CODE (t) == TEMPLATE_DECL)
5739 ++processing_template_decl;
5740 r = tsubst (t, args, tf_error | tf_warning, NULL_TREE);
5741 if (TREE_CODE (t) == TEMPLATE_DECL)
5742 --processing_template_decl;
5743 if (TREE_CODE (r) == VAR_DECL)
5747 [t]he initialization (and any associated
5748 side-effects) of a static data member does
5749 not occur unless the static data member is
5750 itself used in a way that requires the
5751 definition of the static data member to
5754 Therefore, we do not substitute into the
5755 initialized for the static data member here. */
5756 finish_static_data_member_decl
5759 /*asmspec_tree=*/NULL_TREE,
5761 if (DECL_INITIALIZED_IN_CLASS_P (r))
5762 check_static_variable_definition (r, TREE_TYPE (r));
5764 else if (TREE_CODE (r) == FIELD_DECL)
5766 /* Determine whether R has a valid type and can be
5767 completed later. If R is invalid, then it is
5768 replaced by error_mark_node so that it will not be
5769 added to TYPE_FIELDS. */
5770 tree rtype = TREE_TYPE (r);
5771 if (can_complete_type_without_circularity (rtype))
5772 complete_type (rtype);
5774 if (!COMPLETE_TYPE_P (rtype))
5776 cxx_incomplete_type_error (r, rtype);
5777 r = error_mark_node;
5781 /* If it is a TYPE_DECL for a class-scoped ENUMERAL_TYPE,
5782 such a thing will already have been added to the field
5783 list by tsubst_enum in finish_member_declaration in the
5784 CLASSTYPE_NESTED_UTDS case above. */
5785 if (!(TREE_CODE (r) == TYPE_DECL
5786 && TREE_CODE (TREE_TYPE (r)) == ENUMERAL_TYPE
5787 && DECL_ARTIFICIAL (r)))
5789 set_current_access_from_decl (r);
5790 finish_member_declaration (r);
5797 if (TYPE_P (t) || DECL_CLASS_TEMPLATE_P (t))
5799 /* Build new CLASSTYPE_FRIEND_CLASSES. */
5801 tree friend_type = t;
5802 bool adjust_processing_template_decl = false;
5804 if (TREE_CODE (friend_type) == TEMPLATE_DECL)
5806 /* template <class T> friend class C; */
5807 friend_type = tsubst_friend_class (friend_type, args);
5808 adjust_processing_template_decl = true;
5810 else if (TREE_CODE (friend_type) == UNBOUND_CLASS_TEMPLATE)
5812 /* template <class T> friend class C::D; */
5813 friend_type = tsubst (friend_type, args,
5814 tf_error | tf_warning, NULL_TREE);
5815 if (TREE_CODE (friend_type) == TEMPLATE_DECL)
5816 friend_type = TREE_TYPE (friend_type);
5817 adjust_processing_template_decl = true;
5819 else if (TREE_CODE (friend_type) == TYPENAME_TYPE)
5821 /* This could be either
5825 when dependent_type_p is false or
5827 template <class U> friend class T::C;
5830 friend_type = tsubst (friend_type, args,
5831 tf_error | tf_warning, NULL_TREE);
5832 /* Bump processing_template_decl for correct
5833 dependent_type_p calculation. */
5834 ++processing_template_decl;
5835 if (dependent_type_p (friend_type))
5836 adjust_processing_template_decl = true;
5837 --processing_template_decl;
5839 else if (!CLASSTYPE_USE_TEMPLATE (friend_type)
5840 && hidden_name_p (TYPE_NAME (friend_type)))
5844 where C hasn't been declared yet. Let's lookup name
5845 from namespace scope directly, bypassing any name that
5846 come from dependent base class. */
5847 tree ns = decl_namespace_context (TYPE_MAIN_DECL (friend_type));
5849 /* The call to xref_tag_from_type does injection for friend
5851 push_nested_namespace (ns);
5853 xref_tag_from_type (friend_type, NULL_TREE,
5854 /*tag_scope=*/ts_current);
5855 pop_nested_namespace (ns);
5857 else if (uses_template_parms (friend_type))
5858 /* friend class C<T>; */
5859 friend_type = tsubst (friend_type, args,
5860 tf_error | tf_warning, NULL_TREE);
5865 where C is already declared or
5867 friend class C<int>;
5869 We don't have to do anything in these cases. */
5871 if (adjust_processing_template_decl)
5872 /* Trick make_friend_class into realizing that the friend
5873 we're adding is a template, not an ordinary class. It's
5874 important that we use make_friend_class since it will
5875 perform some error-checking and output cross-reference
5877 ++processing_template_decl;
5879 if (friend_type != error_mark_node)
5880 make_friend_class (type, friend_type, /*complain=*/false);
5882 if (adjust_processing_template_decl)
5883 --processing_template_decl;
5887 /* Build new DECL_FRIENDLIST. */
5890 /* The the file and line for this declaration, to
5891 assist in error message reporting. Since we
5892 called push_tinst_level above, we don't need to
5894 input_location = DECL_SOURCE_LOCATION (t);
5896 if (TREE_CODE (t) == TEMPLATE_DECL)
5898 ++processing_template_decl;
5899 push_deferring_access_checks (dk_no_check);
5902 r = tsubst_friend_function (t, args);
5903 add_friend (type, r, /*complain=*/false);
5904 if (TREE_CODE (t) == TEMPLATE_DECL)
5906 pop_deferring_access_checks ();
5907 --processing_template_decl;
5913 /* Set the file and line number information to whatever is given for
5914 the class itself. This puts error messages involving generated
5915 implicit functions at a predictable point, and the same point
5916 that would be used for non-template classes. */
5917 input_location = DECL_SOURCE_LOCATION (typedecl);
5919 unreverse_member_declarations (type);
5920 finish_struct_1 (type);
5921 TYPE_BEING_DEFINED (type) = 0;
5923 /* Now that the class is complete, instantiate default arguments for
5924 any member functions. We don't do this earlier because the
5925 default arguments may reference members of the class. */
5926 if (!PRIMARY_TEMPLATE_P (template))
5927 for (t = TYPE_METHODS (type); t; t = TREE_CHAIN (t))
5928 if (TREE_CODE (t) == FUNCTION_DECL
5929 /* Implicitly generated member functions will not have template
5930 information; they are not instantiations, but instead are
5931 created "fresh" for each instantiation. */
5932 && DECL_TEMPLATE_INFO (t))
5933 tsubst_default_arguments (t);
5936 pop_from_top_level ();
5937 pop_deferring_access_checks ();
5940 /* The vtable for a template class can be emitted in any translation
5941 unit in which the class is instantiated. When there is no key
5942 method, however, finish_struct_1 will already have added TYPE to
5943 the keyed_classes list. */
5944 if (TYPE_CONTAINS_VPTR_P (type) && CLASSTYPE_KEY_METHOD (type))
5945 keyed_classes = tree_cons (NULL_TREE, type, keyed_classes);
5951 tsubst_template_arg (tree t, tree args, tsubst_flags_t complain, tree in_decl)
5957 else if (TYPE_P (t))
5958 r = tsubst (t, args, complain, in_decl);
5961 r = tsubst_expr (t, args, complain, in_decl);
5962 r = fold_non_dependent_expr (r);
5967 /* Substitute ARGS into the vector or list of template arguments T. */
5970 tsubst_template_args (tree t, tree args, tsubst_flags_t complain, tree in_decl)
5972 int len = TREE_VEC_LENGTH (t);
5973 int need_new = 0, i;
5974 tree *elts = alloca (len * sizeof (tree));
5976 for (i = 0; i < len; i++)
5978 tree orig_arg = TREE_VEC_ELT (t, i);
5981 if (TREE_CODE (orig_arg) == TREE_VEC)
5982 new_arg = tsubst_template_args (orig_arg, args, complain, in_decl);
5984 new_arg = tsubst_template_arg (orig_arg, args, complain, in_decl);
5986 if (new_arg == error_mark_node)
5987 return error_mark_node;
5990 if (new_arg != orig_arg)
5997 t = make_tree_vec (len);
5998 for (i = 0; i < len; i++)
5999 TREE_VEC_ELT (t, i) = elts[i];
6004 /* Return the result of substituting ARGS into the template parameters
6005 given by PARMS. If there are m levels of ARGS and m + n levels of
6006 PARMS, then the result will contain n levels of PARMS. For
6007 example, if PARMS is `template <class T> template <class U>
6008 template <T*, U, class V>' and ARGS is {{int}, {double}} then the
6009 result will be `template <int*, double, class V>'. */
6012 tsubst_template_parms (tree parms, tree args, tsubst_flags_t complain)
6017 /* When substituting into a template, we must set
6018 PROCESSING_TEMPLATE_DECL as the template parameters may be
6019 dependent if they are based on one-another, and the dependency
6020 predicates are short-circuit outside of templates. */
6021 ++processing_template_decl;
6023 for (new_parms = &r;
6024 TMPL_PARMS_DEPTH (parms) > TMPL_ARGS_DEPTH (args);
6025 new_parms = &(TREE_CHAIN (*new_parms)),
6026 parms = TREE_CHAIN (parms))
6029 make_tree_vec (TREE_VEC_LENGTH (TREE_VALUE (parms)));
6032 for (i = 0; i < TREE_VEC_LENGTH (new_vec); ++i)
6034 tree tuple = TREE_VEC_ELT (TREE_VALUE (parms), i);
6035 tree default_value = TREE_PURPOSE (tuple);
6036 tree parm_decl = TREE_VALUE (tuple);
6038 parm_decl = tsubst (parm_decl, args, complain, NULL_TREE);
6039 if (TREE_CODE (parm_decl) == PARM_DECL
6040 && invalid_nontype_parm_type_p (TREE_TYPE (parm_decl), complain))
6041 parm_decl = error_mark_node;
6042 default_value = tsubst_template_arg (default_value, args,
6043 complain, NULL_TREE);
6045 tuple = build_tree_list (default_value, parm_decl);
6046 TREE_VEC_ELT (new_vec, i) = tuple;
6050 tree_cons (size_int (TMPL_PARMS_DEPTH (parms)
6051 - TMPL_ARGS_DEPTH (args)),
6052 new_vec, NULL_TREE);
6055 --processing_template_decl;
6060 /* Substitute the ARGS into the indicated aggregate (or enumeration)
6061 type T. If T is not an aggregate or enumeration type, it is
6062 handled as if by tsubst. IN_DECL is as for tsubst. If
6063 ENTERING_SCOPE is nonzero, T is the context for a template which
6064 we are presently tsubst'ing. Return the substituted value. */
6067 tsubst_aggr_type (tree t,
6069 tsubst_flags_t complain,
6076 switch (TREE_CODE (t))
6079 if (TYPE_PTRMEMFUNC_P (t))
6080 return tsubst (TYPE_PTRMEMFUNC_FN_TYPE (t), args, complain, in_decl);
6082 /* Else fall through. */
6085 if (TYPE_TEMPLATE_INFO (t))
6090 bool saved_skip_evaluation;
6092 /* In "sizeof(X<I>)" we need to evaluate "I". */
6093 saved_skip_evaluation = skip_evaluation;
6094 skip_evaluation = false;
6096 /* First, determine the context for the type we are looking
6098 context = TYPE_CONTEXT (t);
6100 context = tsubst_aggr_type (context, args, complain,
6101 in_decl, /*entering_scope=*/1);
6103 /* Then, figure out what arguments are appropriate for the
6104 type we are trying to find. For example, given:
6106 template <class T> struct S;
6107 template <class T, class U> void f(T, U) { S<U> su; }
6109 and supposing that we are instantiating f<int, double>,
6110 then our ARGS will be {int, double}, but, when looking up
6111 S we only want {double}. */
6112 argvec = tsubst_template_args (TYPE_TI_ARGS (t), args,
6114 if (argvec == error_mark_node)
6115 r = error_mark_node;
6118 r = lookup_template_class (t, argvec, in_decl, context,
6119 entering_scope, complain);
6120 r = cp_build_qualified_type_real (r, TYPE_QUALS (t), complain);
6123 skip_evaluation = saved_skip_evaluation;
6128 /* This is not a template type, so there's nothing to do. */
6132 return tsubst (t, args, complain, in_decl);
6136 /* Substitute into the default argument ARG (a default argument for
6137 FN), which has the indicated TYPE. */
6140 tsubst_default_argument (tree fn, tree type, tree arg)
6142 tree saved_class_ptr = NULL_TREE;
6143 tree saved_class_ref = NULL_TREE;
6145 /* This default argument came from a template. Instantiate the
6146 default argument here, not in tsubst. In the case of
6155 we must be careful to do name lookup in the scope of S<T>,
6156 rather than in the current class. */
6157 push_access_scope (fn);
6158 /* The "this" pointer is not valid in a default argument. */
6161 saved_class_ptr = current_class_ptr;
6162 cp_function_chain->x_current_class_ptr = NULL_TREE;
6163 saved_class_ref = current_class_ref;
6164 cp_function_chain->x_current_class_ref = NULL_TREE;
6167 push_deferring_access_checks(dk_no_deferred);
6168 arg = tsubst_expr (arg, DECL_TI_ARGS (fn),
6169 tf_error | tf_warning, NULL_TREE);
6170 pop_deferring_access_checks();
6172 /* Restore the "this" pointer. */
6175 cp_function_chain->x_current_class_ptr = saved_class_ptr;
6176 cp_function_chain->x_current_class_ref = saved_class_ref;
6179 pop_access_scope (fn);
6181 /* Make sure the default argument is reasonable. */
6182 arg = check_default_argument (type, arg);
6187 /* Substitute into all the default arguments for FN. */
6190 tsubst_default_arguments (tree fn)
6195 tmpl_args = DECL_TI_ARGS (fn);
6197 /* If this function is not yet instantiated, we certainly don't need
6198 its default arguments. */
6199 if (uses_template_parms (tmpl_args))
6202 for (arg = TYPE_ARG_TYPES (TREE_TYPE (fn));
6204 arg = TREE_CHAIN (arg))
6205 if (TREE_PURPOSE (arg))
6206 TREE_PURPOSE (arg) = tsubst_default_argument (fn,
6208 TREE_PURPOSE (arg));
6211 /* Substitute the ARGS into the T, which is a _DECL. Return the
6212 result of the substitution. Issue error and warning messages under
6213 control of COMPLAIN. */
6216 tsubst_decl (tree t, tree args, tsubst_flags_t complain)
6218 location_t saved_loc;
6222 /* Set the filename and linenumber to improve error-reporting. */
6223 saved_loc = input_location;
6224 input_location = DECL_SOURCE_LOCATION (t);
6226 switch (TREE_CODE (t))
6230 /* We can get here when processing a member function template,
6231 member class template, and template template parameter of
6232 a template class. */
6233 tree decl = DECL_TEMPLATE_RESULT (t);
6238 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t))
6240 /* Template template parameter is treated here. */
6241 tree new_type = tsubst (TREE_TYPE (t), args, complain, in_decl);
6242 if (new_type == error_mark_node)
6243 return error_mark_node;
6246 TREE_CHAIN (r) = NULL_TREE;
6247 TREE_TYPE (r) = new_type;
6248 DECL_TEMPLATE_RESULT (r)
6249 = build_decl (TYPE_DECL, DECL_NAME (decl), new_type);
6250 DECL_TEMPLATE_PARMS (r)
6251 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t), args,
6253 TYPE_NAME (new_type) = r;
6257 /* We might already have an instance of this template.
6258 The ARGS are for the surrounding class type, so the
6259 full args contain the tsubst'd args for the context,
6260 plus the innermost args from the template decl. */
6261 tmpl_args = DECL_CLASS_TEMPLATE_P (t)
6262 ? CLASSTYPE_TI_ARGS (TREE_TYPE (t))
6263 : DECL_TI_ARGS (DECL_TEMPLATE_RESULT (t));
6264 /* Because this is a template, the arguments will still be
6265 dependent, even after substitution. If
6266 PROCESSING_TEMPLATE_DECL is not set, the dependency
6267 predicates will short-circuit. */
6268 ++processing_template_decl;
6269 full_args = tsubst_template_args (tmpl_args, args,
6271 --processing_template_decl;
6272 if (full_args == error_mark_node)
6273 return error_mark_node;
6275 /* tsubst_template_args doesn't copy the vector if
6276 nothing changed. But, *something* should have
6278 gcc_assert (full_args != tmpl_args);
6280 spec = retrieve_specialization (t, full_args,
6281 /*class_specializations_p=*/true);
6282 if (spec != NULL_TREE)
6288 /* Make a new template decl. It will be similar to the
6289 original, but will record the current template arguments.
6290 We also create a new function declaration, which is just
6291 like the old one, but points to this new template, rather
6292 than the old one. */
6294 gcc_assert (DECL_LANG_SPECIFIC (r) != 0);
6295 TREE_CHAIN (r) = NULL_TREE;
6297 DECL_TEMPLATE_INFO (r) = build_tree_list (t, args);
6299 if (TREE_CODE (decl) == TYPE_DECL)
6302 ++processing_template_decl;
6303 new_type = tsubst (TREE_TYPE (t), args, complain, in_decl);
6304 --processing_template_decl;
6305 if (new_type == error_mark_node)
6306 return error_mark_node;
6308 TREE_TYPE (r) = new_type;
6309 CLASSTYPE_TI_TEMPLATE (new_type) = r;
6310 DECL_TEMPLATE_RESULT (r) = TYPE_MAIN_DECL (new_type);
6311 DECL_TI_ARGS (r) = CLASSTYPE_TI_ARGS (new_type);
6312 DECL_CONTEXT (r) = TYPE_CONTEXT (new_type);
6317 ++processing_template_decl;
6318 new_decl = tsubst (decl, args, complain, in_decl);
6319 --processing_template_decl;
6320 if (new_decl == error_mark_node)
6321 return error_mark_node;
6323 DECL_TEMPLATE_RESULT (r) = new_decl;
6324 DECL_TI_TEMPLATE (new_decl) = r;
6325 TREE_TYPE (r) = TREE_TYPE (new_decl);
6326 DECL_TI_ARGS (r) = DECL_TI_ARGS (new_decl);
6327 DECL_CONTEXT (r) = DECL_CONTEXT (new_decl);
6330 SET_DECL_IMPLICIT_INSTANTIATION (r);
6331 DECL_TEMPLATE_INSTANTIATIONS (r) = NULL_TREE;
6332 DECL_TEMPLATE_SPECIALIZATIONS (r) = NULL_TREE;
6334 /* The template parameters for this new template are all the
6335 template parameters for the old template, except the
6336 outermost level of parameters. */
6337 DECL_TEMPLATE_PARMS (r)
6338 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t), args,
6341 if (PRIMARY_TEMPLATE_P (t))
6342 DECL_PRIMARY_TEMPLATE (r) = r;
6344 if (TREE_CODE (decl) != TYPE_DECL)
6345 /* Record this non-type partial instantiation. */
6346 register_specialization (r, t,
6347 DECL_TI_ARGS (DECL_TEMPLATE_RESULT (r)),
6355 tree argvec = NULL_TREE;
6363 /* Nobody should be tsubst'ing into non-template functions. */
6364 gcc_assert (DECL_TEMPLATE_INFO (t) != NULL_TREE);
6366 if (TREE_CODE (DECL_TI_TEMPLATE (t)) == TEMPLATE_DECL)
6371 /* If T is not dependent, just return it. We have to
6372 increment PROCESSING_TEMPLATE_DECL because
6373 value_dependent_expression_p assumes that nothing is
6374 dependent when PROCESSING_TEMPLATE_DECL is zero. */
6375 ++processing_template_decl;
6376 dependent_p = value_dependent_expression_p (t);
6377 --processing_template_decl;
6381 /* Calculate the most general template of which R is a
6382 specialization, and the complete set of arguments used to
6384 gen_tmpl = most_general_template (DECL_TI_TEMPLATE (t));
6385 argvec = tsubst_template_args (DECL_TI_ARGS
6386 (DECL_TEMPLATE_RESULT (gen_tmpl)),
6387 args, complain, in_decl);
6389 /* Check to see if we already have this specialization. */
6390 spec = retrieve_specialization (gen_tmpl, argvec,
6391 /*class_specializations_p=*/false);
6399 /* We can see more levels of arguments than parameters if
6400 there was a specialization of a member template, like
6403 template <class T> struct S { template <class U> void f(); }
6404 template <> template <class U> void S<int>::f(U);
6406 Here, we'll be substituting into the specialization,
6407 because that's where we can find the code we actually
6408 want to generate, but we'll have enough arguments for
6409 the most general template.
6411 We also deal with the peculiar case:
6413 template <class T> struct S {
6414 template <class U> friend void f();
6416 template <class U> void f() {}
6418 template void f<double>();
6420 Here, the ARGS for the instantiation of will be {int,
6421 double}. But, we only need as many ARGS as there are
6422 levels of template parameters in CODE_PATTERN. We are
6423 careful not to get fooled into reducing the ARGS in
6426 template <class T> struct S { template <class U> void f(U); }
6427 template <class T> template <> void S<T>::f(int) {}
6429 which we can spot because the pattern will be a
6430 specialization in this case. */
6431 args_depth = TMPL_ARGS_DEPTH (args);
6433 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (t)));
6434 if (args_depth > parms_depth
6435 && !DECL_TEMPLATE_SPECIALIZATION (t))
6436 args = get_innermost_template_args (args, parms_depth);
6440 /* This special case arises when we have something like this:
6442 template <class T> struct S {
6443 friend void f<int>(int, double);
6446 Here, the DECL_TI_TEMPLATE for the friend declaration
6447 will be an IDENTIFIER_NODE. We are being called from
6448 tsubst_friend_function, and we want only to create a
6449 new decl (R) with appropriate types so that we can call
6450 determine_specialization. */
6451 gen_tmpl = NULL_TREE;
6454 if (DECL_CLASS_SCOPE_P (t))
6456 if (DECL_NAME (t) == constructor_name (DECL_CONTEXT (t)))
6460 ctx = tsubst_aggr_type (DECL_CONTEXT (t), args,
6461 complain, t, /*entering_scope=*/1);
6466 ctx = DECL_CONTEXT (t);
6468 type = tsubst (TREE_TYPE (t), args, complain, in_decl);
6469 if (type == error_mark_node)
6470 return error_mark_node;
6472 /* We do NOT check for matching decls pushed separately at this
6473 point, as they may not represent instantiations of this
6474 template, and in any case are considered separate under the
6477 DECL_USE_TEMPLATE (r) = 0;
6478 TREE_TYPE (r) = type;
6479 /* Clear out the mangled name and RTL for the instantiation. */
6480 SET_DECL_ASSEMBLER_NAME (r, NULL_TREE);
6481 SET_DECL_RTL (r, NULL_RTX);
6482 DECL_INITIAL (r) = NULL_TREE;
6483 DECL_CONTEXT (r) = ctx;
6485 if (member && DECL_CONV_FN_P (r))
6486 /* Type-conversion operator. Reconstruct the name, in
6487 case it's the name of one of the template's parameters. */
6488 DECL_NAME (r) = mangle_conv_op_name_for_type (TREE_TYPE (type));
6490 DECL_ARGUMENTS (r) = tsubst (DECL_ARGUMENTS (t), args,
6492 DECL_RESULT (r) = NULL_TREE;
6494 TREE_STATIC (r) = 0;
6495 TREE_PUBLIC (r) = TREE_PUBLIC (t);
6496 DECL_EXTERNAL (r) = 1;
6497 /* If this is an instantiation of a function with internal
6498 linkage, we already know what object file linkage will be
6499 assigned to the instantiation. */
6500 DECL_INTERFACE_KNOWN (r) = !TREE_PUBLIC (r);
6501 DECL_DEFER_OUTPUT (r) = 0;
6502 TREE_CHAIN (r) = NULL_TREE;
6503 DECL_PENDING_INLINE_INFO (r) = 0;
6504 DECL_PENDING_INLINE_P (r) = 0;
6505 DECL_SAVED_TREE (r) = NULL_TREE;
6507 if (DECL_CLONED_FUNCTION (r))
6509 DECL_CLONED_FUNCTION (r) = tsubst (DECL_CLONED_FUNCTION (t),
6511 TREE_CHAIN (r) = TREE_CHAIN (DECL_CLONED_FUNCTION (r));
6512 TREE_CHAIN (DECL_CLONED_FUNCTION (r)) = r;
6515 /* Set up the DECL_TEMPLATE_INFO for R. There's no need to do
6516 this in the special friend case mentioned above where
6517 GEN_TMPL is NULL. */
6520 DECL_TEMPLATE_INFO (r)
6521 = tree_cons (gen_tmpl, argvec, NULL_TREE);
6522 SET_DECL_IMPLICIT_INSTANTIATION (r);
6523 register_specialization (r, gen_tmpl, argvec, false);
6525 /* We're not supposed to instantiate default arguments
6526 until they are called, for a template. But, for a
6529 template <class T> void f ()
6530 { extern void g(int i = T()); }
6532 we should do the substitution when the template is
6533 instantiated. We handle the member function case in
6534 instantiate_class_template since the default arguments
6535 might refer to other members of the class. */
6537 && !PRIMARY_TEMPLATE_P (gen_tmpl)
6538 && !uses_template_parms (argvec))
6539 tsubst_default_arguments (r);
6542 DECL_TEMPLATE_INFO (r) = NULL_TREE;
6544 /* Copy the list of befriending classes. */
6545 for (friends = &DECL_BEFRIENDING_CLASSES (r);
6547 friends = &TREE_CHAIN (*friends))
6549 *friends = copy_node (*friends);
6550 TREE_VALUE (*friends) = tsubst (TREE_VALUE (*friends),
6555 if (DECL_CONSTRUCTOR_P (r) || DECL_DESTRUCTOR_P (r))
6557 maybe_retrofit_in_chrg (r);
6558 if (DECL_CONSTRUCTOR_P (r))
6559 grok_ctor_properties (ctx, r);
6560 /* If this is an instantiation of a member template, clone it.
6561 If it isn't, that'll be handled by
6562 clone_constructors_and_destructors. */
6563 if (PRIMARY_TEMPLATE_P (gen_tmpl))
6564 clone_function_decl (r, /*update_method_vec_p=*/0);
6566 else if (IDENTIFIER_OPNAME_P (DECL_NAME (r)))
6567 grok_op_properties (r, (complain & tf_error) != 0);
6569 if (DECL_FRIEND_P (t) && DECL_FRIEND_CONTEXT (t))
6570 SET_DECL_FRIEND_CONTEXT (r,
6571 tsubst (DECL_FRIEND_CONTEXT (t),
6572 args, complain, in_decl));
6581 if (DECL_TEMPLATE_PARM_P (t))
6582 SET_DECL_TEMPLATE_PARM_P (r);
6584 type = tsubst (TREE_TYPE (t), args, complain, in_decl);
6585 type = type_decays_to (type);
6586 TREE_TYPE (r) = type;
6587 cp_apply_type_quals_to_decl (cp_type_quals (type), r);
6589 if (DECL_INITIAL (r))
6591 if (TREE_CODE (DECL_INITIAL (r)) != TEMPLATE_PARM_INDEX)
6592 DECL_INITIAL (r) = TREE_TYPE (r);
6594 DECL_INITIAL (r) = tsubst (DECL_INITIAL (r), args,
6598 DECL_CONTEXT (r) = NULL_TREE;
6600 if (!DECL_TEMPLATE_PARM_P (r))
6601 DECL_ARG_TYPE (r) = type_passed_as (type);
6603 TREE_CHAIN (r) = tsubst (TREE_CHAIN (t), args,
6604 complain, TREE_CHAIN (t));
6613 type = tsubst (TREE_TYPE (t), args, complain, in_decl);
6614 if (type == error_mark_node)
6615 return error_mark_node;
6616 TREE_TYPE (r) = type;
6617 cp_apply_type_quals_to_decl (cp_type_quals (type), r);
6619 /* We don't have to set DECL_CONTEXT here; it is set by
6620 finish_member_declaration. */
6621 DECL_INITIAL (r) = tsubst_expr (DECL_INITIAL (t), args,
6623 TREE_CHAIN (r) = NULL_TREE;
6624 if (VOID_TYPE_P (type))
6625 error ("instantiation of %q+D as type %qT", r, type);
6630 /* We reach here only for member using decls. */
6631 if (DECL_DEPENDENT_P (t))
6633 r = do_class_using_decl
6634 (tsubst_copy (USING_DECL_SCOPE (t), args, complain, in_decl),
6635 tsubst_copy (DECL_NAME (t), args, complain, in_decl));
6637 r = error_mark_node;
6642 TREE_CHAIN (r) = NULL_TREE;
6649 tree argvec = NULL_TREE;
6650 tree gen_tmpl = NULL_TREE;
6652 tree tmpl = NULL_TREE;
6654 tree type = NULL_TREE;
6657 if (TREE_CODE (t) == TYPE_DECL)
6659 type = tsubst (TREE_TYPE (t), args, complain, in_decl);
6660 if (TREE_CODE (type) == TEMPLATE_TEMPLATE_PARM
6661 || t == TYPE_MAIN_DECL (TREE_TYPE (t)))
6663 /* If this is the canonical decl, we don't have to
6664 mess with instantiations, and often we can't (for
6665 typename, template type parms and such). Note that
6666 TYPE_NAME is not correct for the above test if
6667 we've copied the type for a typedef. */
6668 r = TYPE_NAME (type);
6673 /* Assume this is a non-local variable. */
6676 if (TYPE_P (CP_DECL_CONTEXT (t)))
6677 ctx = tsubst_aggr_type (DECL_CONTEXT (t), args,
6679 in_decl, /*entering_scope=*/1);
6680 else if (DECL_NAMESPACE_SCOPE_P (t))
6681 ctx = DECL_CONTEXT (t);
6684 /* Subsequent calls to pushdecl will fill this in. */
6689 /* Check to see if we already have this specialization. */
6692 tmpl = DECL_TI_TEMPLATE (t);
6693 gen_tmpl = most_general_template (tmpl);
6694 argvec = tsubst (DECL_TI_ARGS (t), args, complain, in_decl);
6695 spec = retrieve_specialization (gen_tmpl, argvec,
6696 /*class_specializations_p=*/false);
6699 spec = retrieve_local_specialization (t);
6708 if (TREE_CODE (r) == VAR_DECL)
6710 /* Even if the original location is out of scope, the
6711 newly substituted one is not. */
6712 DECL_DEAD_FOR_LOCAL (r) = 0;
6713 DECL_INITIALIZED_P (r) = 0;
6714 DECL_TEMPLATE_INSTANTIATED (r) = 0;
6715 type = tsubst (TREE_TYPE (t), args, complain, in_decl);
6716 if (type == error_mark_node)
6717 return error_mark_node;
6718 type = complete_type (type);
6719 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (r)
6720 = DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (t);
6721 type = check_var_type (DECL_NAME (r), type);
6723 if (DECL_HAS_VALUE_EXPR_P (t))
6725 tree ve = DECL_VALUE_EXPR (t);
6726 ve = tsubst_expr (ve, args, complain, in_decl);
6727 SET_DECL_VALUE_EXPR (r, ve);
6730 else if (DECL_SELF_REFERENCE_P (t))
6731 SET_DECL_SELF_REFERENCE_P (r);
6732 TREE_TYPE (r) = type;
6733 cp_apply_type_quals_to_decl (cp_type_quals (type), r);
6734 DECL_CONTEXT (r) = ctx;
6735 /* Clear out the mangled name and RTL for the instantiation. */
6736 SET_DECL_ASSEMBLER_NAME (r, NULL_TREE);
6737 if (CODE_CONTAINS_STRUCT (TREE_CODE (t), TS_DECL_WRTL))
6738 SET_DECL_RTL (r, NULL_RTX);
6739 /* The initializer must not be expanded until it is required;
6741 DECL_INITIAL (r) = NULL_TREE;
6742 if (CODE_CONTAINS_STRUCT (TREE_CODE (t), TS_DECL_WRTL))
6743 SET_DECL_RTL (r, NULL_RTX);
6744 DECL_SIZE (r) = DECL_SIZE_UNIT (r) = 0;
6748 /* A static data member declaration is always marked
6749 external when it is declared in-class, even if an
6750 initializer is present. We mimic the non-template
6752 DECL_EXTERNAL (r) = 1;
6754 register_specialization (r, gen_tmpl, argvec, false);
6755 DECL_TEMPLATE_INFO (r) = tree_cons (tmpl, argvec, NULL_TREE);
6756 SET_DECL_IMPLICIT_INSTANTIATION (r);
6759 register_local_specialization (r, t);
6761 TREE_CHAIN (r) = NULL_TREE;
6770 /* Restore the file and line information. */
6771 input_location = saved_loc;
6776 /* Substitute into the ARG_TYPES of a function type. */
6779 tsubst_arg_types (tree arg_types,
6781 tsubst_flags_t complain,
6784 tree remaining_arg_types;
6787 tree result = NULL_TREE;
6789 if (!arg_types || arg_types == void_list_node)
6792 remaining_arg_types = tsubst_arg_types (TREE_CHAIN (arg_types),
6793 args, complain, in_decl);
6794 if (remaining_arg_types == error_mark_node)
6795 return error_mark_node;
6797 type = tsubst (TREE_VALUE (arg_types), args, complain, in_decl);
6798 if (type == error_mark_node)
6799 return error_mark_node;
6800 if (VOID_TYPE_P (type))
6802 if (complain & tf_error)
6804 error ("invalid parameter type %qT", type);
6806 error ("in declaration %q+D", in_decl);
6808 return error_mark_node;
6811 /* Do array-to-pointer, function-to-pointer conversion, and ignore
6812 top-level qualifiers as required. */
6813 type = TYPE_MAIN_VARIANT (type_decays_to (type));
6815 /* We do not substitute into default arguments here. The standard
6816 mandates that they be instantiated only when needed, which is
6817 done in build_over_call. */
6818 default_arg = TREE_PURPOSE (arg_types);
6820 if (default_arg && TREE_CODE (default_arg) == DEFAULT_ARG)
6822 /* We've instantiated a template before its default arguments
6823 have been parsed. This can happen for a nested template
6824 class, and is not an error unless we require the default
6825 argument in a call of this function. */
6826 result = tree_cons (default_arg, type, remaining_arg_types);
6827 VEC_safe_push (tree, gc, DEFARG_INSTANTIATIONS (default_arg), result);
6830 result = hash_tree_cons (default_arg, type, remaining_arg_types);
6835 /* Substitute into a FUNCTION_TYPE or METHOD_TYPE. This routine does
6836 *not* handle the exception-specification for FNTYPE, because the
6837 initial substitution of explicitly provided template parameters
6838 during argument deduction forbids substitution into the
6839 exception-specification:
6843 All references in the function type of the function template to the
6844 corresponding template parameters are replaced by the specified tem-
6845 plate argument values. If a substitution in a template parameter or
6846 in the function type of the function template results in an invalid
6847 type, type deduction fails. [Note: The equivalent substitution in
6848 exception specifications is done only when the function is instanti-
6849 ated, at which point a program is ill-formed if the substitution
6850 results in an invalid type.] */
6853 tsubst_function_type (tree t,
6855 tsubst_flags_t complain,
6862 /* The TYPE_CONTEXT is not used for function/method types. */
6863 gcc_assert (TYPE_CONTEXT (t) == NULL_TREE);
6865 /* Substitute the return type. */
6866 return_type = tsubst (TREE_TYPE (t), args, complain, in_decl);
6867 if (return_type == error_mark_node)
6868 return error_mark_node;
6869 /* The standard does not presently indicate that creation of a
6870 function type with an invalid return type is a deduction failure.
6871 However, that is clearly analogous to creating an array of "void"
6872 or a reference to a reference. This is core issue #486. */
6873 if (TREE_CODE (return_type) == ARRAY_TYPE
6874 || TREE_CODE (return_type) == FUNCTION_TYPE)
6876 if (complain & tf_error)
6878 if (TREE_CODE (return_type) == ARRAY_TYPE)
6879 error ("function returning an array");
6881 error ("function returning a function");
6883 return error_mark_node;
6886 /* Substitute the argument types. */
6887 arg_types = tsubst_arg_types (TYPE_ARG_TYPES (t), args,
6889 if (arg_types == error_mark_node)
6890 return error_mark_node;
6892 /* Construct a new type node and return it. */
6893 if (TREE_CODE (t) == FUNCTION_TYPE)
6894 fntype = build_function_type (return_type, arg_types);
6897 tree r = TREE_TYPE (TREE_VALUE (arg_types));
6898 if (! IS_AGGR_TYPE (r))
6902 Type deduction may fail for any of the following
6905 -- Attempting to create "pointer to member of T" when T
6906 is not a class type. */
6907 if (complain & tf_error)
6908 error ("creating pointer to member function of non-class type %qT",
6910 return error_mark_node;
6913 fntype = build_method_type_directly (r, return_type,
6914 TREE_CHAIN (arg_types));
6916 fntype = cp_build_qualified_type_real (fntype, TYPE_QUALS (t), complain);
6917 fntype = cp_build_type_attribute_variant (fntype, TYPE_ATTRIBUTES (t));
6922 /* FNTYPE is a FUNCTION_TYPE or METHOD_TYPE. Substitute the template
6923 ARGS into that specification, and return the substituted
6924 specification. If there is no specification, return NULL_TREE. */
6927 tsubst_exception_specification (tree fntype,
6929 tsubst_flags_t complain,
6935 specs = TYPE_RAISES_EXCEPTIONS (fntype);
6936 new_specs = NULL_TREE;
6939 if (! TREE_VALUE (specs))
6945 spec = tsubst (TREE_VALUE (specs), args, complain, in_decl);
6946 if (spec == error_mark_node)
6948 new_specs = add_exception_specifier (new_specs, spec, complain);
6949 specs = TREE_CHAIN (specs);
6955 /* Take the tree structure T and replace template parameters used
6956 therein with the argument vector ARGS. IN_DECL is an associated
6957 decl for diagnostics. If an error occurs, returns ERROR_MARK_NODE.
6958 Issue error and warning messages under control of COMPLAIN. Note
6959 that we must be relatively non-tolerant of extensions here, in
6960 order to preserve conformance; if we allow substitutions that
6961 should not be allowed, we may allow argument deductions that should
6962 not succeed, and therefore report ambiguous overload situations
6963 where there are none. In theory, we could allow the substitution,
6964 but indicate that it should have failed, and allow our caller to
6965 make sure that the right thing happens, but we don't try to do this
6968 This function is used for dealing with types, decls and the like;
6969 for expressions, use tsubst_expr or tsubst_copy. */
6972 tsubst (tree t, tree args, tsubst_flags_t complain, tree in_decl)
6976 if (t == NULL_TREE || t == error_mark_node
6977 || t == integer_type_node
6978 || t == void_type_node
6979 || t == char_type_node
6980 || t == unknown_type_node
6981 || TREE_CODE (t) == NAMESPACE_DECL)
6985 return tsubst_decl (t, args, complain);
6987 if (TREE_CODE (t) == IDENTIFIER_NODE)
6988 type = IDENTIFIER_TYPE_VALUE (t);
6990 type = TREE_TYPE (t);
6992 gcc_assert (type != unknown_type_node);
6995 && TREE_CODE (t) != TYPENAME_TYPE
6996 && TREE_CODE (t) != IDENTIFIER_NODE
6997 && TREE_CODE (t) != FUNCTION_TYPE
6998 && TREE_CODE (t) != METHOD_TYPE)
6999 type = tsubst (type, args, complain, in_decl);
7000 if (type == error_mark_node)
7001 return error_mark_node;
7003 switch (TREE_CODE (t))
7008 return tsubst_aggr_type (t, args, complain, in_decl,
7009 /*entering_scope=*/0);
7012 case IDENTIFIER_NODE:
7024 if (t == integer_type_node)
7027 if (TREE_CODE (TYPE_MIN_VALUE (t)) == INTEGER_CST
7028 && TREE_CODE (TYPE_MAX_VALUE (t)) == INTEGER_CST)
7032 tree max, omax = TREE_OPERAND (TYPE_MAX_VALUE (t), 0);
7034 /* The array dimension behaves like a non-type template arg,
7035 in that we want to fold it as much as possible. */
7036 max = tsubst_template_arg (omax, args, complain, in_decl);
7037 max = fold_decl_constant_value (max);
7041 Type deduction may fail for any of the following
7044 Attempting to create an array with a size that is
7045 zero or negative. */
7046 if (integer_zerop (max) && !(complain & tf_error))
7047 /* We must fail if performing argument deduction (as
7048 indicated by the state of complain), so that
7049 another substitution can be found. */
7050 return error_mark_node;
7052 else if (TREE_CODE (max) == INTEGER_CST
7053 && INT_CST_LT (max, integer_zero_node))
7055 if (complain & tf_error)
7056 error ("creating array with negative size (%qE)", max);
7058 return error_mark_node;
7061 return compute_array_index_type (NULL_TREE, max);
7064 case TEMPLATE_TYPE_PARM:
7065 case TEMPLATE_TEMPLATE_PARM:
7066 case BOUND_TEMPLATE_TEMPLATE_PARM:
7067 case TEMPLATE_PARM_INDEX:
7072 tree arg = NULL_TREE;
7076 gcc_assert (TREE_VEC_LENGTH (args) > 0);
7077 if (TREE_CODE (t) == TEMPLATE_TYPE_PARM
7078 || TREE_CODE (t) == TEMPLATE_TEMPLATE_PARM
7079 || TREE_CODE (t) == BOUND_TEMPLATE_TEMPLATE_PARM)
7081 idx = TEMPLATE_TYPE_IDX (t);
7082 level = TEMPLATE_TYPE_LEVEL (t);
7086 idx = TEMPLATE_PARM_IDX (t);
7087 level = TEMPLATE_PARM_LEVEL (t);
7090 levels = TMPL_ARGS_DEPTH (args);
7091 if (level <= levels)
7092 arg = TMPL_ARG (args, level, idx);
7094 if (arg == error_mark_node)
7095 return error_mark_node;
7096 else if (arg != NULL_TREE)
7098 if (TREE_CODE (t) == TEMPLATE_TYPE_PARM)
7100 gcc_assert (TYPE_P (arg));
7101 return cp_build_qualified_type_real
7102 (arg, cp_type_quals (arg) | cp_type_quals (t),
7103 complain | tf_ignore_bad_quals);
7105 else if (TREE_CODE (t) == BOUND_TEMPLATE_TEMPLATE_PARM)
7107 /* We are processing a type constructed from a
7108 template template parameter. */
7109 tree argvec = tsubst (TYPE_TI_ARGS (t),
7110 args, complain, in_decl);
7111 if (argvec == error_mark_node)
7112 return error_mark_node;
7114 /* We can get a TEMPLATE_TEMPLATE_PARM here when we
7115 are resolving nested-types in the signature of a
7116 member function templates. Otherwise ARG is a
7117 TEMPLATE_DECL and is the real template to be
7119 if (TREE_CODE (arg) == TEMPLATE_TEMPLATE_PARM)
7120 arg = TYPE_NAME (arg);
7122 r = lookup_template_class (arg,
7125 /*entering_scope=*/0,
7127 return cp_build_qualified_type_real
7128 (r, TYPE_QUALS (t), complain);
7131 /* TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX. */
7136 /* This can happen during the attempted tsubst'ing in
7137 unify. This means that we don't yet have any information
7138 about the template parameter in question. */
7141 /* If we get here, we must have been looking at a parm for a
7142 more deeply nested template. Make a new version of this
7143 template parameter, but with a lower level. */
7144 switch (TREE_CODE (t))
7146 case TEMPLATE_TYPE_PARM:
7147 case TEMPLATE_TEMPLATE_PARM:
7148 case BOUND_TEMPLATE_TEMPLATE_PARM:
7149 if (cp_type_quals (t))
7151 r = tsubst (TYPE_MAIN_VARIANT (t), args, complain, in_decl);
7152 r = cp_build_qualified_type_real
7153 (r, cp_type_quals (t),
7154 complain | (TREE_CODE (t) == TEMPLATE_TYPE_PARM
7155 ? tf_ignore_bad_quals : 0));
7160 TEMPLATE_TYPE_PARM_INDEX (r)
7161 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (t),
7163 TYPE_STUB_DECL (r) = TYPE_NAME (r) = TEMPLATE_TYPE_DECL (r);
7164 TYPE_MAIN_VARIANT (r) = r;
7165 TYPE_POINTER_TO (r) = NULL_TREE;
7166 TYPE_REFERENCE_TO (r) = NULL_TREE;
7168 if (TREE_CODE (t) == BOUND_TEMPLATE_TEMPLATE_PARM)
7170 tree argvec = tsubst (TYPE_TI_ARGS (t), args,
7172 if (argvec == error_mark_node)
7173 return error_mark_node;
7175 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (r)
7176 = tree_cons (TYPE_TI_TEMPLATE (t), argvec, NULL_TREE);
7181 case TEMPLATE_PARM_INDEX:
7182 r = reduce_template_parm_level (t, type, levels);
7194 tree purpose, value, chain;
7196 if (t == void_list_node)
7199 purpose = TREE_PURPOSE (t);
7202 purpose = tsubst (purpose, args, complain, in_decl);
7203 if (purpose == error_mark_node)
7204 return error_mark_node;
7206 value = TREE_VALUE (t);
7209 value = tsubst (value, args, complain, in_decl);
7210 if (value == error_mark_node)
7211 return error_mark_node;
7213 chain = TREE_CHAIN (t);
7214 if (chain && chain != void_type_node)
7216 chain = tsubst (chain, args, complain, in_decl);
7217 if (chain == error_mark_node)
7218 return error_mark_node;
7220 if (purpose == TREE_PURPOSE (t)
7221 && value == TREE_VALUE (t)
7222 && chain == TREE_CHAIN (t))
7224 return hash_tree_cons (purpose, value, chain);
7228 /* We should never be tsubsting a binfo. */
7232 /* A vector of template arguments. */
7234 return tsubst_template_args (t, args, complain, in_decl);
7237 case REFERENCE_TYPE:
7239 enum tree_code code;
7241 if (type == TREE_TYPE (t) && TREE_CODE (type) != METHOD_TYPE)
7244 code = TREE_CODE (t);
7249 Type deduction may fail for any of the following
7252 -- Attempting to create a pointer to reference type.
7253 -- Attempting to create a reference to a reference type or
7254 a reference to void. */
7255 if (TREE_CODE (type) == REFERENCE_TYPE
7256 || (code == REFERENCE_TYPE && TREE_CODE (type) == VOID_TYPE))
7258 static location_t last_loc;
7260 /* We keep track of the last time we issued this error
7261 message to avoid spewing a ton of messages during a
7262 single bad template instantiation. */
7263 if (complain & tf_error
7264 #ifdef USE_MAPPED_LOCATION
7265 && last_loc != input_location
7267 && (last_loc.line != input_line
7268 || last_loc.file != input_filename)
7272 if (TREE_CODE (type) == VOID_TYPE)
7273 error ("forming reference to void");
7275 error ("forming %s to reference type %qT",
7276 (code == POINTER_TYPE) ? "pointer" : "reference",
7278 last_loc = input_location;
7281 return error_mark_node;
7283 else if (code == POINTER_TYPE)
7285 r = build_pointer_type (type);
7286 if (TREE_CODE (type) == METHOD_TYPE)
7287 r = build_ptrmemfunc_type (r);
7290 r = build_reference_type (type);
7291 r = cp_build_qualified_type_real (r, TYPE_QUALS (t), complain);
7293 if (r != error_mark_node)
7294 /* Will this ever be needed for TYPE_..._TO values? */
7301 r = tsubst (TYPE_OFFSET_BASETYPE (t), args, complain, in_decl);
7302 if (r == error_mark_node || !IS_AGGR_TYPE (r))
7306 Type deduction may fail for any of the following
7309 -- Attempting to create "pointer to member of T" when T
7310 is not a class type. */
7311 if (complain & tf_error)
7312 error ("creating pointer to member of non-class type %qT", r);
7313 return error_mark_node;
7315 if (TREE_CODE (type) == REFERENCE_TYPE)
7317 if (complain & tf_error)
7318 error ("creating pointer to member reference type %qT", type);
7319 return error_mark_node;
7321 if (TREE_CODE (type) == VOID_TYPE)
7323 if (complain & tf_error)
7324 error ("creating pointer to member of type void");
7325 return error_mark_node;
7327 gcc_assert (TREE_CODE (type) != METHOD_TYPE);
7328 if (TREE_CODE (type) == FUNCTION_TYPE)
7330 /* The type of the implicit object parameter gets its
7331 cv-qualifiers from the FUNCTION_TYPE. */
7333 tree this_type = cp_build_qualified_type (TYPE_MAIN_VARIANT (r),
7334 cp_type_quals (type));
7336 method_type = build_method_type_directly (this_type,
7338 TYPE_ARG_TYPES (type));
7339 memptr = build_ptrmemfunc_type (build_pointer_type (method_type));
7340 return cp_build_qualified_type_real (memptr, cp_type_quals (t),
7344 return cp_build_qualified_type_real (build_ptrmem_type (r, type),
7353 fntype = tsubst_function_type (t, args, complain, in_decl);
7354 if (fntype == error_mark_node)
7355 return error_mark_node;
7357 /* Substitute the exception specification. */
7358 specs = tsubst_exception_specification (t, args, complain,
7360 if (specs == error_mark_node)
7361 return error_mark_node;
7363 fntype = build_exception_variant (fntype, specs);
7368 tree domain = tsubst (TYPE_DOMAIN (t), args, complain, in_decl);
7369 if (domain == error_mark_node)
7370 return error_mark_node;
7372 /* As an optimization, we avoid regenerating the array type if
7373 it will obviously be the same as T. */
7374 if (type == TREE_TYPE (t) && domain == TYPE_DOMAIN (t))
7377 /* These checks should match the ones in grokdeclarator.
7381 The deduction may fail for any of the following reasons:
7383 -- Attempting to create an array with an element type that
7384 is void, a function type, or a reference type, or [DR337]
7385 an abstract class type. */
7386 if (TREE_CODE (type) == VOID_TYPE
7387 || TREE_CODE (type) == FUNCTION_TYPE
7388 || TREE_CODE (type) == REFERENCE_TYPE)
7390 if (complain & tf_error)
7391 error ("creating array of %qT", type);
7392 return error_mark_node;
7394 if (CLASS_TYPE_P (type) && CLASSTYPE_PURE_VIRTUALS (type))
7396 if (complain & tf_error)
7397 error ("creating array of %qT, which is an abstract class type",
7399 return error_mark_node;
7402 r = build_cplus_array_type (type, domain);
7409 tree e1 = tsubst (TREE_OPERAND (t, 0), args, complain, in_decl);
7410 tree e2 = tsubst (TREE_OPERAND (t, 1), args, complain, in_decl);
7412 if (e1 == error_mark_node || e2 == error_mark_node)
7413 return error_mark_node;
7415 return fold_build2 (TREE_CODE (t), TREE_TYPE (t), e1, e2);
7421 tree e = tsubst (TREE_OPERAND (t, 0), args, complain, in_decl);
7422 if (e == error_mark_node)
7423 return error_mark_node;
7425 return fold_build1 (TREE_CODE (t), TREE_TYPE (t), e);
7430 tree ctx = tsubst_aggr_type (TYPE_CONTEXT (t), args, complain,
7431 in_decl, /*entering_scope=*/1);
7432 tree f = tsubst_copy (TYPENAME_TYPE_FULLNAME (t), args,
7435 if (ctx == error_mark_node || f == error_mark_node)
7436 return error_mark_node;
7438 if (!IS_AGGR_TYPE (ctx))
7440 if (complain & tf_error)
7441 error ("%qT is not a class, struct, or union type", ctx);
7442 return error_mark_node;
7444 else if (!uses_template_parms (ctx) && !TYPE_BEING_DEFINED (ctx))
7446 /* Normally, make_typename_type does not require that the CTX
7447 have complete type in order to allow things like:
7449 template <class T> struct S { typename S<T>::X Y; };
7451 But, such constructs have already been resolved by this
7452 point, so here CTX really should have complete type, unless
7453 it's a partial instantiation. */
7454 ctx = complete_type (ctx);
7455 if (!COMPLETE_TYPE_P (ctx))
7457 if (complain & tf_error)
7458 cxx_incomplete_type_error (NULL_TREE, ctx);
7459 return error_mark_node;
7463 f = make_typename_type (ctx, f, typename_type,
7464 (complain & tf_error) | tf_keep_type_decl);
7465 if (f == error_mark_node)
7467 if (TREE_CODE (f) == TYPE_DECL)
7469 complain |= tf_ignore_bad_quals;
7473 if (TREE_CODE (f) != TYPENAME_TYPE)
7475 if (TYPENAME_IS_ENUM_P (t) && TREE_CODE (f) != ENUMERAL_TYPE)
7476 error ("%qT resolves to %qT, which is not an enumeration type",
7478 else if (TYPENAME_IS_CLASS_P (t) && !CLASS_TYPE_P (f))
7479 error ("%qT resolves to %qT, which is is not a class type",
7483 return cp_build_qualified_type_real
7484 (f, cp_type_quals (f) | cp_type_quals (t), complain);
7487 case UNBOUND_CLASS_TEMPLATE:
7489 tree ctx = tsubst_aggr_type (TYPE_CONTEXT (t), args, complain,
7490 in_decl, /*entering_scope=*/1);
7491 tree name = TYPE_IDENTIFIER (t);
7492 tree parm_list = DECL_TEMPLATE_PARMS (TYPE_NAME (t));
7494 if (ctx == error_mark_node || name == error_mark_node)
7495 return error_mark_node;
7498 parm_list = tsubst_template_parms (parm_list, args, complain);
7499 return make_unbound_class_template (ctx, name, parm_list, complain);
7509 tree e1 = tsubst (TREE_OPERAND (t, 0), args, complain, in_decl);
7510 tree e2 = tsubst_expr (TREE_OPERAND (t, 1), args, complain, in_decl);
7511 if (e1 == error_mark_node || e2 == error_mark_node)
7512 return error_mark_node;
7514 return build_nt (ARRAY_REF, e1, e2, NULL_TREE, NULL_TREE);
7519 tree e1 = tsubst (TREE_OPERAND (t, 0), args, complain, in_decl);
7520 tree e2 = tsubst (TREE_OPERAND (t, 1), args, complain, in_decl);
7521 if (e1 == error_mark_node || e2 == error_mark_node)
7522 return error_mark_node;
7524 return build_qualified_name (/*type=*/NULL_TREE,
7525 e1, e2, QUALIFIED_NAME_IS_TEMPLATE (t));
7532 type = finish_typeof (tsubst_expr (TYPEOF_TYPE_EXPR (t), args,
7533 complain, in_decl));
7534 return cp_build_qualified_type_real (type,
7536 | cp_type_quals (type),
7541 sorry ("use of %qs in template",
7542 tree_code_name [(int) TREE_CODE (t)]);
7543 return error_mark_node;
7547 /* Like tsubst_expr for a BASELINK. OBJECT_TYPE, if non-NULL, is the
7548 type of the expression on the left-hand side of the "." or "->"
7552 tsubst_baselink (tree baselink, tree object_type,
7553 tree args, tsubst_flags_t complain, tree in_decl)
7556 tree qualifying_scope;
7558 tree template_args = 0;
7559 bool template_id_p = false;
7561 /* A baselink indicates a function from a base class. The
7562 BASELINK_ACCESS_BINFO and BASELINK_BINFO are going to have
7563 non-dependent types; otherwise, the lookup could not have
7564 succeeded. However, they may indicate bases of the template
7565 class, rather than the instantiated class.
7567 In addition, lookups that were not ambiguous before may be
7568 ambiguous now. Therefore, we perform the lookup again. */
7569 qualifying_scope = BINFO_TYPE (BASELINK_ACCESS_BINFO (baselink));
7570 fns = BASELINK_FUNCTIONS (baselink);
7571 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)
7573 template_id_p = true;
7574 template_args = TREE_OPERAND (fns, 1);
7575 fns = TREE_OPERAND (fns, 0);
7577 template_args = tsubst_template_args (template_args, args,
7580 name = DECL_NAME (get_first_fn (fns));
7581 baselink = lookup_fnfields (qualifying_scope, name, /*protect=*/1);
7583 /* If lookup found a single function, mark it as used at this
7584 point. (If it lookup found multiple functions the one selected
7585 later by overload resolution will be marked as used at that
7587 if (BASELINK_P (baselink))
7588 fns = BASELINK_FUNCTIONS (baselink);
7589 if (!template_id_p && !really_overloaded_fn (fns))
7590 mark_used (OVL_CURRENT (fns));
7592 /* Add back the template arguments, if present. */
7593 if (BASELINK_P (baselink) && template_id_p)
7594 BASELINK_FUNCTIONS (baselink)
7595 = build_nt (TEMPLATE_ID_EXPR,
7596 BASELINK_FUNCTIONS (baselink),
7600 object_type = current_class_type;
7601 return adjust_result_of_qualified_name_lookup (baselink,
7606 /* Like tsubst_expr for a SCOPE_REF, given by QUALIFIED_ID. DONE is
7607 true if the qualified-id will be a postfix-expression in-and-of
7608 itself; false if more of the postfix-expression follows the
7609 QUALIFIED_ID. ADDRESS_P is true if the qualified-id is the operand
7613 tsubst_qualified_id (tree qualified_id, tree args,
7614 tsubst_flags_t complain, tree in_decl,
7615 bool done, bool address_p)
7623 gcc_assert (TREE_CODE (qualified_id) == SCOPE_REF);
7625 /* Figure out what name to look up. */
7626 name = TREE_OPERAND (qualified_id, 1);
7627 if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
7630 template_args = TREE_OPERAND (name, 1);
7632 template_args = tsubst_template_args (template_args, args,
7634 name = TREE_OPERAND (name, 0);
7638 is_template = false;
7639 template_args = NULL_TREE;
7642 /* Substitute into the qualifying scope. When there are no ARGS, we
7643 are just trying to simplify a non-dependent expression. In that
7644 case the qualifying scope may be dependent, and, in any case,
7645 substituting will not help. */
7646 scope = TREE_OPERAND (qualified_id, 0);
7649 scope = tsubst (scope, args, complain, in_decl);
7650 expr = tsubst_copy (name, args, complain, in_decl);
7655 if (dependent_type_p (scope))
7656 return build_qualified_name (/*type=*/NULL_TREE,
7658 QUALIFIED_NAME_IS_TEMPLATE (qualified_id));
7660 if (!BASELINK_P (name) && !DECL_P (expr))
7662 if (TREE_CODE (expr) == BIT_NOT_EXPR)
7663 /* If this were actually a destructor call, it would have been
7664 parsed as such by the parser. */
7665 expr = error_mark_node;
7667 expr = lookup_qualified_name (scope, expr, /*is_type_p=*/0, false);
7668 if (TREE_CODE (TREE_CODE (expr) == TEMPLATE_DECL
7669 ? DECL_TEMPLATE_RESULT (expr) : expr) == TYPE_DECL)
7671 if (complain & tf_error)
7673 error ("dependent-name %qE is parsed as a non-type, but "
7674 "instantiation yields a type", qualified_id);
7675 inform ("say %<typename %E%> if a type is meant", qualified_id);
7677 return error_mark_node;
7683 check_accessibility_of_qualified_id (expr, /*object_type=*/NULL_TREE,
7685 /* Remember that there was a reference to this entity. */
7689 if (expr == error_mark_node || TREE_CODE (expr) == TREE_LIST)
7691 if (complain & tf_error)
7692 qualified_name_lookup_error (scope,
7693 TREE_OPERAND (qualified_id, 1),
7695 return error_mark_node;
7699 expr = lookup_template_function (expr, template_args);
7701 if (expr == error_mark_node && complain & tf_error)
7702 qualified_name_lookup_error (scope, TREE_OPERAND (qualified_id, 1),
7704 else if (TYPE_P (scope))
7706 expr = (adjust_result_of_qualified_name_lookup
7707 (expr, scope, current_class_type));
7708 expr = (finish_qualified_id_expr
7709 (scope, expr, done, address_p,
7710 QUALIFIED_NAME_IS_TEMPLATE (qualified_id),
7711 /*template_arg_p=*/false));
7714 if (TREE_CODE (expr) != SCOPE_REF)
7715 expr = convert_from_reference (expr);
7720 /* Like tsubst, but deals with expressions. This function just replaces
7721 template parms; to finish processing the resultant expression, use
7725 tsubst_copy (tree t, tree args, tsubst_flags_t complain, tree in_decl)
7727 enum tree_code code;
7730 if (t == NULL_TREE || t == error_mark_node)
7733 code = TREE_CODE (t);
7738 r = retrieve_local_specialization (t);
7739 gcc_assert (r != NULL);
7748 if (DECL_TEMPLATE_PARM_P (t))
7749 return tsubst_copy (DECL_INITIAL (t), args, complain, in_decl);
7750 /* There is no need to substitute into namespace-scope
7752 if (DECL_NAMESPACE_SCOPE_P (t))
7754 /* If ARGS is NULL, then T is known to be non-dependent. */
7755 if (args == NULL_TREE)
7756 return integral_constant_value (t);
7758 /* Unfortunately, we cannot just call lookup_name here.
7761 template <int I> int f() {
7763 struct S { void g() { E e = a; } };
7766 When we instantiate f<7>::S::g(), say, lookup_name is not
7767 clever enough to find f<7>::a. */
7769 = tsubst_aggr_type (TREE_TYPE (t), args, complain, in_decl,
7770 /*entering_scope=*/0);
7772 for (v = TYPE_VALUES (enum_type);
7775 if (TREE_PURPOSE (v) == DECL_NAME (t))
7776 return TREE_VALUE (v);
7778 /* We didn't find the name. That should never happen; if
7779 name-lookup found it during preliminary parsing, we
7780 should find it again here during instantiation. */
7786 if (DECL_CONTEXT (t))
7790 ctx = tsubst_aggr_type (DECL_CONTEXT (t), args, complain, in_decl,
7791 /*entering_scope=*/1);
7792 if (ctx != DECL_CONTEXT (t))
7794 tree r = lookup_field (ctx, DECL_NAME (t), 0, false);
7797 if (complain & tf_error)
7798 error ("using invalid field %qD", t);
7799 return error_mark_node;
7809 if ((DECL_LANG_SPECIFIC (t) && DECL_TEMPLATE_INFO (t))
7810 || local_variable_p (t))
7811 t = tsubst (t, args, complain, in_decl);
7816 return tsubst_baselink (t, current_class_type, args, complain, in_decl);
7819 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t))
7820 return tsubst (TREE_TYPE (DECL_TEMPLATE_RESULT (t)),
7821 args, complain, in_decl);
7822 else if (DECL_FUNCTION_TEMPLATE_P (t) && DECL_MEMBER_TEMPLATE_P (t))
7823 return tsubst (t, args, complain, in_decl);
7824 else if (DECL_CLASS_SCOPE_P (t)
7825 && uses_template_parms (DECL_CONTEXT (t)))
7827 /* Template template argument like the following example need
7830 template <template <class> class TT> struct C {};
7831 template <class T> struct D {
7832 template <class U> struct E {};
7837 We are processing the template argument `E' in #1 for
7838 the template instantiation #2. Originally, `E' is a
7839 TEMPLATE_DECL with `D<T>' as its DECL_CONTEXT. Now we
7840 have to substitute this with one having context `D<int>'. */
7842 tree context = tsubst (DECL_CONTEXT (t), args, complain, in_decl);
7843 return lookup_field (context, DECL_NAME(t), 0, false);
7846 /* Ordinary template template argument. */
7850 case REINTERPRET_CAST_EXPR:
7851 case CONST_CAST_EXPR:
7852 case STATIC_CAST_EXPR:
7853 case DYNAMIC_CAST_EXPR:
7856 (code, tsubst (TREE_TYPE (t), args, complain, in_decl),
7857 tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl));
7861 case TRUTH_NOT_EXPR:
7864 case UNARY_PLUS_EXPR: /* Unary + */
7873 (code, tsubst (TREE_TYPE (t), args, complain, in_decl),
7874 tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl));
7881 object = tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl);
7882 name = TREE_OPERAND (t, 1);
7883 if (TREE_CODE (name) == BIT_NOT_EXPR)
7885 name = tsubst_copy (TREE_OPERAND (name, 0), args,
7887 name = build1 (BIT_NOT_EXPR, NULL_TREE, name);
7889 else if (TREE_CODE (name) == SCOPE_REF
7890 && TREE_CODE (TREE_OPERAND (name, 1)) == BIT_NOT_EXPR)
7892 tree base = tsubst_copy (TREE_OPERAND (name, 0), args,
7894 name = TREE_OPERAND (name, 1);
7895 name = tsubst_copy (TREE_OPERAND (name, 0), args,
7897 name = build1 (BIT_NOT_EXPR, NULL_TREE, name);
7898 name = build_qualified_name (/*type=*/NULL_TREE,
7900 /*template_p=*/false);
7902 else if (TREE_CODE (name) == BASELINK)
7903 name = tsubst_baselink (name,
7904 non_reference (TREE_TYPE (object)),
7908 name = tsubst_copy (name, args, complain, in_decl);
7909 return build_nt (COMPONENT_REF, object, name, NULL_TREE);
7915 case TRUNC_DIV_EXPR:
7917 case FLOOR_DIV_EXPR:
7918 case ROUND_DIV_EXPR:
7919 case EXACT_DIV_EXPR:
7923 case TRUNC_MOD_EXPR:
7924 case FLOOR_MOD_EXPR:
7925 case TRUTH_ANDIF_EXPR:
7926 case TRUTH_ORIF_EXPR:
7927 case TRUTH_AND_EXPR:
7944 case PREDECREMENT_EXPR:
7945 case PREINCREMENT_EXPR:
7946 case POSTDECREMENT_EXPR:
7947 case POSTINCREMENT_EXPR:
7949 (code, tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl),
7950 tsubst_copy (TREE_OPERAND (t, 1), args, complain, in_decl));
7953 return build_qualified_name (/*type=*/NULL_TREE,
7954 tsubst_copy (TREE_OPERAND (t, 0),
7955 args, complain, in_decl),
7956 tsubst_copy (TREE_OPERAND (t, 1),
7957 args, complain, in_decl),
7958 QUALIFIED_NAME_IS_TEMPLATE (t));
7963 tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl),
7964 tsubst_copy (TREE_OPERAND (t, 1), args, complain, in_decl),
7965 NULL_TREE, NULL_TREE);
7968 return build_nt (code,
7969 tsubst_copy (TREE_OPERAND (t, 0), args,
7971 tsubst_copy (TREE_OPERAND (t, 1), args, complain,
7977 case PSEUDO_DTOR_EXPR:
7980 (code, tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl),
7981 tsubst_copy (TREE_OPERAND (t, 1), args, complain, in_decl),
7982 tsubst_copy (TREE_OPERAND (t, 2), args, complain, in_decl));
7983 TREE_NO_WARNING (r) = TREE_NO_WARNING (t);
7990 (code, tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl),
7991 tsubst_copy (TREE_OPERAND (t, 1), args, complain, in_decl),
7992 tsubst_copy (TREE_OPERAND (t, 2), args, complain, in_decl));
7993 NEW_EXPR_USE_GLOBAL (r) = NEW_EXPR_USE_GLOBAL (t);
8000 (code, tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl),
8001 tsubst_copy (TREE_OPERAND (t, 1), args, complain, in_decl));
8002 DELETE_EXPR_USE_GLOBAL (r) = DELETE_EXPR_USE_GLOBAL (t);
8003 DELETE_EXPR_USE_VEC (r) = DELETE_EXPR_USE_VEC (t);
8007 case TEMPLATE_ID_EXPR:
8009 /* Substituted template arguments */
8010 tree fn = TREE_OPERAND (t, 0);
8011 tree targs = TREE_OPERAND (t, 1);
8013 fn = tsubst_copy (fn, args, complain, in_decl);
8015 targs = tsubst_template_args (targs, args, complain, in_decl);
8017 return lookup_template_function (fn, targs);
8022 tree purpose, value, chain;
8024 if (t == void_list_node)
8027 purpose = TREE_PURPOSE (t);
8029 purpose = tsubst_copy (purpose, args, complain, in_decl);
8030 value = TREE_VALUE (t);
8032 value = tsubst_copy (value, args, complain, in_decl);
8033 chain = TREE_CHAIN (t);
8034 if (chain && chain != void_type_node)
8035 chain = tsubst_copy (chain, args, complain, in_decl);
8036 if (purpose == TREE_PURPOSE (t)
8037 && value == TREE_VALUE (t)
8038 && chain == TREE_CHAIN (t))
8040 return tree_cons (purpose, value, chain);
8047 case TEMPLATE_TYPE_PARM:
8048 case TEMPLATE_TEMPLATE_PARM:
8049 case BOUND_TEMPLATE_TEMPLATE_PARM:
8050 case TEMPLATE_PARM_INDEX:
8052 case REFERENCE_TYPE:
8058 case UNBOUND_CLASS_TEMPLATE:
8061 return tsubst (t, args, complain, in_decl);
8063 case IDENTIFIER_NODE:
8064 if (IDENTIFIER_TYPENAME_P (t))
8066 tree new_type = tsubst (TREE_TYPE (t), args, complain, in_decl);
8067 return mangle_conv_op_name_for_type (new_type);
8073 /* This is handled by tsubst_copy_and_build. */
8077 return build_x_va_arg (tsubst_copy (TREE_OPERAND (t, 0), args, complain,
8079 tsubst (TREE_TYPE (t), args, complain, in_decl));
8081 case CLEANUP_POINT_EXPR:
8082 /* We shouldn't have built any of these during initial template
8083 generation. Instead, they should be built during instantiation
8084 in response to the saved STMT_IS_FULL_EXPR_P setting. */
8088 mark_used (TREE_OPERAND (t, 1));
8096 /* Like tsubst_copy_and_build, but unshare TREE_LIST nodes. */
8099 tsubst_copy_asm_operands (tree t, tree args, tsubst_flags_t complain,
8102 #define RECUR(t) tsubst_copy_asm_operands (t, args, complain, in_decl)
8104 tree purpose, value, chain;
8109 if (TREE_CODE (t) != TREE_LIST)
8110 return tsubst_copy_and_build (t, args, complain, in_decl,
8111 /*function_p=*/false);
8113 if (t == void_list_node)
8116 purpose = TREE_PURPOSE (t);
8118 purpose = RECUR (purpose);
8119 value = TREE_VALUE (t);
8121 value = RECUR (value);
8122 chain = TREE_CHAIN (t);
8123 if (chain && chain != void_type_node)
8124 chain = RECUR (chain);
8125 return tree_cons (purpose, value, chain);
8129 /* Like tsubst_copy for expressions, etc. but also does semantic
8133 tsubst_expr (tree t, tree args, tsubst_flags_t complain, tree in_decl)
8137 if (t == NULL_TREE || t == error_mark_node)
8140 if (EXPR_HAS_LOCATION (t))
8141 input_location = EXPR_LOCATION (t);
8142 if (STATEMENT_CODE_P (TREE_CODE (t)))
8143 current_stmt_tree ()->stmts_are_full_exprs_p = STMT_IS_FULL_EXPR_P (t);
8145 switch (TREE_CODE (t))
8147 case STATEMENT_LIST:
8149 tree_stmt_iterator i;
8150 for (i = tsi_start (t); !tsi_end_p (i); tsi_next (&i))
8151 tsubst_expr (tsi_stmt (i), args, complain, in_decl);
8155 case CTOR_INITIALIZER:
8156 finish_mem_initializers (tsubst_initializer_list
8157 (TREE_OPERAND (t, 0), args));
8161 finish_return_stmt (tsubst_expr (TREE_OPERAND (t, 0),
8162 args, complain, in_decl));
8166 tmp = tsubst_expr (EXPR_STMT_EXPR (t), args, complain, in_decl);
8167 if (EXPR_STMT_STMT_EXPR_RESULT (t))
8168 finish_stmt_expr_expr (tmp, cur_stmt_expr);
8170 finish_expr_stmt (tmp);
8174 do_using_directive (tsubst_expr (USING_STMT_NAMESPACE (t),
8175 args, complain, in_decl));
8183 decl = DECL_EXPR_DECL (t);
8184 if (TREE_CODE (decl) == LABEL_DECL)
8185 finish_label_decl (DECL_NAME (decl));
8186 else if (TREE_CODE (decl) == USING_DECL)
8188 tree scope = USING_DECL_SCOPE (decl);
8189 tree name = DECL_NAME (decl);
8192 scope = tsubst_expr (scope, args, complain, in_decl);
8193 decl = lookup_qualified_name (scope, name,
8194 /*is_type_p=*/false,
8195 /*complain=*/false);
8196 if (decl == error_mark_node || TREE_CODE (decl) == TREE_LIST)
8197 qualified_name_lookup_error (scope, name, decl);
8199 do_local_using_decl (decl, scope, name);
8203 init = DECL_INITIAL (decl);
8204 decl = tsubst (decl, args, complain, in_decl);
8205 if (decl != error_mark_node)
8208 DECL_INITIAL (decl) = error_mark_node;
8209 /* By marking the declaration as instantiated, we avoid
8210 trying to instantiate it. Since instantiate_decl can't
8211 handle local variables, and since we've already done
8212 all that needs to be done, that's the right thing to
8214 if (TREE_CODE (decl) == VAR_DECL)
8215 DECL_TEMPLATE_INSTANTIATED (decl) = 1;
8216 if (TREE_CODE (decl) == VAR_DECL
8217 && ANON_AGGR_TYPE_P (TREE_TYPE (decl)))
8218 /* Anonymous aggregates are a special case. */
8219 finish_anon_union (decl);
8222 maybe_push_decl (decl);
8223 if (TREE_CODE (decl) == VAR_DECL
8224 && DECL_PRETTY_FUNCTION_P (decl))
8226 /* For __PRETTY_FUNCTION__ we have to adjust the
8228 const char *const name
8229 = cxx_printable_name (current_function_decl, 2);
8230 init = cp_fname_init (name, &TREE_TYPE (decl));
8233 init = tsubst_expr (init, args, complain, in_decl);
8234 cp_finish_decl (decl, init, NULL_TREE, 0);
8239 /* A DECL_EXPR can also be used as an expression, in the condition
8240 clause of an if/for/while construct. */
8245 stmt = begin_for_stmt ();
8246 tsubst_expr (FOR_INIT_STMT (t), args, complain, in_decl);
8247 finish_for_init_stmt (stmt);
8248 tmp = tsubst_expr (FOR_COND (t), args, complain, in_decl);
8249 finish_for_cond (tmp, stmt);
8250 tmp = tsubst_expr (FOR_EXPR (t), args, complain, in_decl);
8251 finish_for_expr (tmp, stmt);
8252 tsubst_expr (FOR_BODY (t), args, complain, in_decl);
8253 finish_for_stmt (stmt);
8257 stmt = begin_while_stmt ();
8258 tmp = tsubst_expr (WHILE_COND (t), args, complain, in_decl);
8259 finish_while_stmt_cond (tmp, stmt);
8260 tsubst_expr (WHILE_BODY (t), args, complain, in_decl);
8261 finish_while_stmt (stmt);
8265 stmt = begin_do_stmt ();
8266 tsubst_expr (DO_BODY (t), args, complain, in_decl);
8267 finish_do_body (stmt);
8268 tmp = tsubst_expr (DO_COND (t), args, complain, in_decl);
8269 finish_do_stmt (tmp, stmt);
8273 stmt = begin_if_stmt ();
8274 tmp = tsubst_expr (IF_COND (t), args, complain, in_decl);
8275 finish_if_stmt_cond (tmp, stmt);
8276 tsubst_expr (THEN_CLAUSE (t), args, complain, in_decl);
8277 finish_then_clause (stmt);
8279 if (ELSE_CLAUSE (t))
8281 begin_else_clause (stmt);
8282 tsubst_expr (ELSE_CLAUSE (t), args, complain, in_decl);
8283 finish_else_clause (stmt);
8286 finish_if_stmt (stmt);
8290 if (BIND_EXPR_BODY_BLOCK (t))
8291 stmt = begin_function_body ();
8293 stmt = begin_compound_stmt (BIND_EXPR_TRY_BLOCK (t)
8294 ? BCS_TRY_BLOCK : 0);
8296 tsubst_expr (BIND_EXPR_BODY (t), args, complain, in_decl);
8298 if (BIND_EXPR_BODY_BLOCK (t))
8299 finish_function_body (stmt);
8301 finish_compound_stmt (stmt);
8305 finish_break_stmt ();
8309 finish_continue_stmt ();
8313 stmt = begin_switch_stmt ();
8314 tmp = tsubst_expr (SWITCH_STMT_COND (t), args, complain, in_decl);
8315 finish_switch_cond (tmp, stmt);
8316 tsubst_expr (SWITCH_STMT_BODY (t), args, complain, in_decl);
8317 finish_switch_stmt (stmt);
8320 case CASE_LABEL_EXPR:
8321 finish_case_label (tsubst_expr (CASE_LOW (t), args, complain, in_decl),
8322 tsubst_expr (CASE_HIGH (t), args, complain,
8327 finish_label_stmt (DECL_NAME (LABEL_EXPR_LABEL (t)));
8331 tmp = GOTO_DESTINATION (t);
8332 if (TREE_CODE (tmp) != LABEL_DECL)
8333 /* Computed goto's must be tsubst'd into. On the other hand,
8334 non-computed gotos must not be; the identifier in question
8335 will have no binding. */
8336 tmp = tsubst_expr (tmp, args, complain, in_decl);
8338 tmp = DECL_NAME (tmp);
8339 finish_goto_stmt (tmp);
8343 tmp = finish_asm_stmt
8344 (ASM_VOLATILE_P (t),
8345 tsubst_expr (ASM_STRING (t), args, complain, in_decl),
8346 tsubst_copy_asm_operands (ASM_OUTPUTS (t), args, complain, in_decl),
8347 tsubst_copy_asm_operands (ASM_INPUTS (t), args, complain, in_decl),
8348 tsubst_copy_asm_operands (ASM_CLOBBERS (t), args, complain, in_decl));
8350 tree asm_expr = tmp;
8351 if (TREE_CODE (asm_expr) == CLEANUP_POINT_EXPR)
8352 asm_expr = TREE_OPERAND (asm_expr, 0);
8353 ASM_INPUT_P (asm_expr) = ASM_INPUT_P (t);
8360 stmt = begin_try_block ();
8361 tsubst_expr (TRY_STMTS (t), args, complain, in_decl);
8362 finish_cleanup_try_block (stmt);
8363 finish_cleanup (tsubst_expr (TRY_HANDLERS (t), args,
8369 if (FN_TRY_BLOCK_P (t))
8370 stmt = begin_function_try_block ();
8372 stmt = begin_try_block ();
8374 tsubst_expr (TRY_STMTS (t), args, complain, in_decl);
8376 if (FN_TRY_BLOCK_P (t))
8377 finish_function_try_block (stmt);
8379 finish_try_block (stmt);
8381 tsubst_expr (TRY_HANDLERS (t), args, complain, in_decl);
8382 if (FN_TRY_BLOCK_P (t))
8383 finish_function_handler_sequence (stmt);
8385 finish_handler_sequence (stmt);
8393 stmt = begin_handler ();
8394 if (HANDLER_PARMS (t))
8396 decl = HANDLER_PARMS (t);
8397 decl = tsubst (decl, args, complain, in_decl);
8398 /* Prevent instantiate_decl from trying to instantiate
8399 this variable. We've already done all that needs to be
8401 DECL_TEMPLATE_INSTANTIATED (decl) = 1;
8405 finish_handler_parms (decl, stmt);
8406 tsubst_expr (HANDLER_BODY (t), args, complain, in_decl);
8407 finish_handler (stmt);
8412 tsubst (TREE_TYPE (t), args, complain, NULL_TREE);
8416 gcc_assert (!STATEMENT_CODE_P (TREE_CODE (t)));
8418 return tsubst_copy_and_build (t, args, complain, in_decl,
8419 /*function_p=*/false);
8425 /* T is a postfix-expression that is not being used in a function
8426 call. Return the substituted version of T. */
8429 tsubst_non_call_postfix_expression (tree t, tree args,
8430 tsubst_flags_t complain,
8433 if (TREE_CODE (t) == SCOPE_REF)
8434 t = tsubst_qualified_id (t, args, complain, in_decl,
8435 /*done=*/false, /*address_p=*/false);
8437 t = tsubst_copy_and_build (t, args, complain, in_decl,
8438 /*function_p=*/false);
8443 /* Like tsubst but deals with expressions and performs semantic
8444 analysis. FUNCTION_P is true if T is the "F" in "F (ARGS)". */
8447 tsubst_copy_and_build (tree t,
8449 tsubst_flags_t complain,
8453 #define RECUR(NODE) \
8454 tsubst_copy_and_build (NODE, args, complain, in_decl, /*function_p=*/false)
8458 if (t == NULL_TREE || t == error_mark_node)
8461 switch (TREE_CODE (t))
8466 case IDENTIFIER_NODE:
8470 bool non_integral_constant_expression_p;
8471 const char *error_msg;
8473 if (IDENTIFIER_TYPENAME_P (t))
8475 tree new_type = tsubst (TREE_TYPE (t), args, complain, in_decl);
8476 t = mangle_conv_op_name_for_type (new_type);
8479 /* Look up the name. */
8480 decl = lookup_name (t);
8482 /* By convention, expressions use ERROR_MARK_NODE to indicate
8483 failure, not NULL_TREE. */
8484 if (decl == NULL_TREE)
8485 decl = error_mark_node;
8487 decl = finish_id_expression (t, decl, NULL_TREE,
8489 /*integral_constant_expression_p=*/false,
8490 /*allow_non_integral_constant_expression_p=*/false,
8491 &non_integral_constant_expression_p,
8492 /*template_p=*/false,
8494 /*address_p=*/false,
8495 /*template_arg_p=*/false,
8499 if (!function_p && TREE_CODE (decl) == IDENTIFIER_NODE)
8500 decl = unqualified_name_lookup_error (decl);
8504 case TEMPLATE_ID_EXPR:
8507 tree template = RECUR (TREE_OPERAND (t, 0));
8508 tree targs = TREE_OPERAND (t, 1);
8511 targs = tsubst_template_args (targs, args, complain, in_decl);
8513 if (TREE_CODE (template) == COMPONENT_REF)
8515 object = TREE_OPERAND (template, 0);
8516 template = TREE_OPERAND (template, 1);
8520 template = lookup_template_function (template, targs);
8523 return build3 (COMPONENT_REF, TREE_TYPE (template),
8524 object, template, NULL_TREE);
8531 tree r = RECUR (TREE_OPERAND (t, 0));
8533 if (REFERENCE_REF_P (t))
8535 /* A type conversion to reference type will be enclosed in
8536 such an indirect ref, but the substitution of the cast
8537 will have also added such an indirect ref. */
8538 if (TREE_CODE (TREE_TYPE (r)) == REFERENCE_TYPE)
8539 r = convert_from_reference (r);
8542 r = build_x_indirect_ref (r, "unary *");
8548 (tsubst (TREE_TYPE (t), args, complain, in_decl),
8549 RECUR (TREE_OPERAND (t, 0)));
8552 return build_functional_cast
8553 (tsubst (TREE_TYPE (t), args, complain, in_decl),
8554 RECUR (TREE_OPERAND (t, 0)));
8556 case REINTERPRET_CAST_EXPR:
8557 return build_reinterpret_cast
8558 (tsubst (TREE_TYPE (t), args, complain, in_decl),
8559 RECUR (TREE_OPERAND (t, 0)));
8561 case CONST_CAST_EXPR:
8562 return build_const_cast
8563 (tsubst (TREE_TYPE (t), args, complain, in_decl),
8564 RECUR (TREE_OPERAND (t, 0)));
8566 case DYNAMIC_CAST_EXPR:
8567 return build_dynamic_cast
8568 (tsubst (TREE_TYPE (t), args, complain, in_decl),
8569 RECUR (TREE_OPERAND (t, 0)));
8571 case STATIC_CAST_EXPR:
8572 return build_static_cast
8573 (tsubst (TREE_TYPE (t), args, complain, in_decl),
8574 RECUR (TREE_OPERAND (t, 0)));
8576 case POSTDECREMENT_EXPR:
8577 case POSTINCREMENT_EXPR:
8578 op1 = tsubst_non_call_postfix_expression (TREE_OPERAND (t, 0),
8579 args, complain, in_decl);
8580 return build_x_unary_op (TREE_CODE (t), op1);
8582 case PREDECREMENT_EXPR:
8583 case PREINCREMENT_EXPR:
8587 case TRUTH_NOT_EXPR:
8588 case UNARY_PLUS_EXPR: /* Unary + */
8591 return build_x_unary_op (TREE_CODE (t), RECUR (TREE_OPERAND (t, 0)));
8594 op1 = TREE_OPERAND (t, 0);
8595 if (TREE_CODE (op1) == SCOPE_REF)
8596 op1 = tsubst_qualified_id (op1, args, complain, in_decl,
8597 /*done=*/true, /*address_p=*/true);
8599 op1 = tsubst_non_call_postfix_expression (op1, args, complain,
8601 if (TREE_CODE (op1) == LABEL_DECL)
8602 return finish_label_address_expr (DECL_NAME (op1));
8603 return build_x_unary_op (ADDR_EXPR, op1);
8608 case TRUNC_DIV_EXPR:
8610 case FLOOR_DIV_EXPR:
8611 case ROUND_DIV_EXPR:
8612 case EXACT_DIV_EXPR:
8616 case TRUNC_MOD_EXPR:
8617 case FLOOR_MOD_EXPR:
8618 case TRUTH_ANDIF_EXPR:
8619 case TRUTH_ORIF_EXPR:
8620 case TRUTH_AND_EXPR:
8636 return build_x_binary_op
8638 RECUR (TREE_OPERAND (t, 0)),
8639 RECUR (TREE_OPERAND (t, 1)),
8640 /*overloaded_p=*/NULL);
8643 return tsubst_qualified_id (t, args, complain, in_decl, /*done=*/true,
8644 /*address_p=*/false);
8646 op1 = tsubst_non_call_postfix_expression (TREE_OPERAND (t, 0),
8647 args, complain, in_decl);
8648 return build_x_binary_op (ARRAY_REF, op1, RECUR (TREE_OPERAND (t, 1)),
8649 /*overloaded_p=*/NULL);
8653 op1 = TREE_OPERAND (t, 0);
8656 /* When there are no ARGS, we are trying to evaluate a
8657 non-dependent expression from the parser. Trying to do
8658 the substitutions may not work. */
8660 op1 = TREE_TYPE (op1);
8669 return cxx_sizeof_or_alignof_type (op1, TREE_CODE (t), true);
8671 return cxx_sizeof_or_alignof_expr (op1, TREE_CODE (t));
8675 tree r = build_x_modify_expr
8676 (RECUR (TREE_OPERAND (t, 0)),
8677 TREE_CODE (TREE_OPERAND (t, 1)),
8678 RECUR (TREE_OPERAND (t, 2)));
8679 /* TREE_NO_WARNING must be set if either the expression was
8680 parenthesized or it uses an operator such as >>= rather
8681 than plain assignment. In the former case, it was already
8682 set and must be copied. In the latter case,
8683 build_x_modify_expr sets it and it must not be reset
8685 if (TREE_NO_WARNING (t))
8686 TREE_NO_WARNING (r) = TREE_NO_WARNING (t);
8691 op1 = tsubst_non_call_postfix_expression (TREE_OPERAND (t, 0),
8692 args, complain, in_decl);
8693 /* Remember that there was a reference to this entity. */
8696 return build_x_arrow (op1);
8700 (RECUR (TREE_OPERAND (t, 0)),
8701 RECUR (TREE_OPERAND (t, 1)),
8702 RECUR (TREE_OPERAND (t, 2)),
8703 RECUR (TREE_OPERAND (t, 3)),
8704 NEW_EXPR_USE_GLOBAL (t));
8707 return delete_sanity
8708 (RECUR (TREE_OPERAND (t, 0)),
8709 RECUR (TREE_OPERAND (t, 1)),
8710 DELETE_EXPR_USE_VEC (t),
8711 DELETE_EXPR_USE_GLOBAL (t));
8714 return build_x_compound_expr (RECUR (TREE_OPERAND (t, 0)),
8715 RECUR (TREE_OPERAND (t, 1)));
8724 function = TREE_OPERAND (t, 0);
8725 /* When we parsed the expression, we determined whether or
8726 not Koenig lookup should be performed. */
8727 koenig_p = KOENIG_LOOKUP_P (t);
8728 if (TREE_CODE (function) == SCOPE_REF)
8731 function = tsubst_qualified_id (function, args, complain, in_decl,
8733 /*address_p=*/false);
8737 if (TREE_CODE (function) == COMPONENT_REF)
8739 tree op = TREE_OPERAND (function, 1);
8741 qualified_p = (TREE_CODE (op) == SCOPE_REF
8743 && BASELINK_QUALIFIED_P (op)));
8746 qualified_p = false;
8748 function = tsubst_copy_and_build (function, args, complain,
8751 if (BASELINK_P (function))
8755 call_args = RECUR (TREE_OPERAND (t, 1));
8757 /* We do not perform argument-dependent lookup if normal
8758 lookup finds a non-function, in accordance with the
8759 expected resolution of DR 218. */
8761 && ((is_overloaded_fn (function)
8762 /* If lookup found a member function, the Koenig lookup is
8763 not appropriate, even if an unqualified-name was used
8764 to denote the function. */
8765 && !DECL_FUNCTION_MEMBER_P (get_first_fn (function)))
8766 || TREE_CODE (function) == IDENTIFIER_NODE))
8767 function = perform_koenig_lookup (function, call_args);
8769 if (TREE_CODE (function) == IDENTIFIER_NODE)
8771 unqualified_name_lookup_error (function);
8772 return error_mark_node;
8775 /* Remember that there was a reference to this entity. */
8776 if (DECL_P (function))
8777 mark_used (function);
8779 if (TREE_CODE (function) == OFFSET_REF)
8780 return build_offset_ref_call_from_tree (function, call_args);
8781 if (TREE_CODE (function) == COMPONENT_REF)
8783 if (!BASELINK_P (TREE_OPERAND (function, 1)))
8784 return finish_call_expr (function, call_args,
8785 /*disallow_virtual=*/false,
8786 /*koenig_p=*/false);
8788 return (build_new_method_call
8789 (TREE_OPERAND (function, 0),
8790 TREE_OPERAND (function, 1),
8791 call_args, NULL_TREE,
8792 qualified_p ? LOOKUP_NONVIRTUAL : LOOKUP_NORMAL));
8794 return finish_call_expr (function, call_args,
8795 /*disallow_virtual=*/qualified_p,
8800 return build_x_conditional_expr
8801 (RECUR (TREE_OPERAND (t, 0)),
8802 RECUR (TREE_OPERAND (t, 1)),
8803 RECUR (TREE_OPERAND (t, 2)));
8805 case PSEUDO_DTOR_EXPR:
8806 return finish_pseudo_destructor_expr
8807 (RECUR (TREE_OPERAND (t, 0)),
8808 RECUR (TREE_OPERAND (t, 1)),
8809 RECUR (TREE_OPERAND (t, 2)));
8813 tree purpose, value, chain;
8815 if (t == void_list_node)
8818 purpose = TREE_PURPOSE (t);
8820 purpose = RECUR (purpose);
8821 value = TREE_VALUE (t);
8823 value = RECUR (value);
8824 chain = TREE_CHAIN (t);
8825 if (chain && chain != void_type_node)
8826 chain = RECUR (chain);
8827 if (purpose == TREE_PURPOSE (t)
8828 && value == TREE_VALUE (t)
8829 && chain == TREE_CHAIN (t))
8831 return tree_cons (purpose, value, chain);
8840 object = tsubst_non_call_postfix_expression (TREE_OPERAND (t, 0),
8841 args, complain, in_decl);
8842 /* Remember that there was a reference to this entity. */
8843 if (DECL_P (object))
8845 object_type = TREE_TYPE (object);
8847 member = TREE_OPERAND (t, 1);
8848 if (BASELINK_P (member))
8849 member = tsubst_baselink (member,
8850 non_reference (TREE_TYPE (object)),
8851 args, complain, in_decl);
8853 member = tsubst_copy (member, args, complain, in_decl);
8854 if (member == error_mark_node)
8855 return error_mark_node;
8857 if (object_type && !CLASS_TYPE_P (object_type))
8859 if (TREE_CODE (member) == BIT_NOT_EXPR)
8860 return finish_pseudo_destructor_expr (object,
8863 else if (TREE_CODE (member) == SCOPE_REF
8864 && (TREE_CODE (TREE_OPERAND (member, 1)) == BIT_NOT_EXPR))
8865 return finish_pseudo_destructor_expr (object,
8869 else if (TREE_CODE (member) == SCOPE_REF
8870 && TREE_CODE (TREE_OPERAND (member, 1)) == TEMPLATE_ID_EXPR)
8875 /* Lookup the template functions now that we know what the
8877 tmpl = TREE_OPERAND (TREE_OPERAND (member, 1), 0);
8878 args = TREE_OPERAND (TREE_OPERAND (member, 1), 1);
8879 member = lookup_qualified_name (TREE_OPERAND (member, 0), tmpl,
8880 /*is_type_p=*/false,
8881 /*complain=*/false);
8882 if (BASELINK_P (member))
8884 BASELINK_FUNCTIONS (member)
8885 = build_nt (TEMPLATE_ID_EXPR, BASELINK_FUNCTIONS (member),
8887 member = (adjust_result_of_qualified_name_lookup
8888 (member, BINFO_TYPE (BASELINK_BINFO (member)),
8893 qualified_name_lookup_error (object_type, tmpl, member);
8894 return error_mark_node;
8897 else if (TREE_CODE (member) == SCOPE_REF
8898 && !CLASS_TYPE_P (TREE_OPERAND (member, 0))
8899 && TREE_CODE (TREE_OPERAND (member, 0)) != NAMESPACE_DECL)
8901 if (complain & tf_error)
8903 if (TYPE_P (TREE_OPERAND (member, 0)))
8904 error ("%qT is not a class or namespace",
8905 TREE_OPERAND (member, 0));
8907 error ("%qD is not a class or namespace",
8908 TREE_OPERAND (member, 0));
8910 return error_mark_node;
8912 else if (TREE_CODE (member) == FIELD_DECL)
8913 return finish_non_static_data_member (member, object, NULL_TREE);
8915 return finish_class_member_access_expr (object, member,
8916 /*template_p=*/false);
8921 (RECUR (TREE_OPERAND (t, 0)));
8925 VEC(constructor_elt,gc) *n;
8926 constructor_elt *ce;
8927 unsigned HOST_WIDE_INT idx;
8929 tree type = tsubst (TREE_TYPE (t), args, complain, in_decl);
8930 bool process_index_p;
8932 /* digest_init will do the wrong thing if we let it. */
8933 if (type && TYPE_PTRMEMFUNC_P (type))
8936 /* We do not want to process the index of aggregate
8937 initializers as they are identifier nodes which will be
8938 looked up by digest_init. */
8939 process_index_p = !(type && IS_AGGR_TYPE (type));
8941 n = VEC_copy (constructor_elt, gc, CONSTRUCTOR_ELTS (t));
8942 for (idx = 0; VEC_iterate (constructor_elt, n, idx, ce); idx++)
8944 if (ce->index && process_index_p)
8945 ce->index = RECUR (ce->index);
8946 ce->value = RECUR (ce->value);
8949 r = build_constructor (NULL_TREE, n);
8950 TREE_HAS_CONSTRUCTOR (r) = TREE_HAS_CONSTRUCTOR (t);
8953 return digest_init (type, r);
8959 tree operand_0 = RECUR (TREE_OPERAND (t, 0));
8960 if (TYPE_P (operand_0))
8961 return get_typeid (operand_0);
8962 return build_typeid (operand_0);
8972 tree r = tsubst_copy (t, args, complain, in_decl);
8974 if (TREE_CODE (TREE_TYPE (t)) != REFERENCE_TYPE)
8975 /* If the original type was a reference, we'll be wrapped in
8976 the appropriate INDIRECT_REF. */
8977 r = convert_from_reference (r);
8982 return build_x_va_arg (RECUR (TREE_OPERAND (t, 0)),
8983 tsubst_copy (TREE_TYPE (t), args, complain,
8987 return fold_offsetof (RECUR (TREE_OPERAND (t, 0)));
8991 tree old_stmt_expr = cur_stmt_expr;
8992 tree stmt_expr = begin_stmt_expr ();
8994 cur_stmt_expr = stmt_expr;
8995 tsubst_expr (STMT_EXPR_STMT (t), args, complain, in_decl);
8996 stmt_expr = finish_stmt_expr (stmt_expr, false);
8997 cur_stmt_expr = old_stmt_expr;
9003 t = tsubst_copy (t, args, complain, in_decl);
9004 /* As in finish_id_expression, we resolve enumeration constants
9005 to their underlying values. */
9006 if (TREE_CODE (t) == CONST_DECL)
9007 return DECL_INITIAL (t);
9011 /* Handle Objective-C++ constructs, if appropriate. */
9014 = objcp_tsubst_copy_and_build (t, args, complain,
9015 in_decl, /*function_p=*/false);
9019 return tsubst_copy (t, args, complain, in_decl);
9025 /* Verify that the instantiated ARGS are valid. For type arguments,
9026 make sure that the type's linkage is ok. For non-type arguments,
9027 make sure they are constants if they are integral or enumerations.
9028 Emit an error under control of COMPLAIN, and return TRUE on error. */
9031 check_instantiated_args (tree tmpl, tree args, tsubst_flags_t complain)
9033 int ix, len = DECL_NTPARMS (tmpl);
9034 bool result = false;
9036 for (ix = 0; ix != len; ix++)
9038 tree t = TREE_VEC_ELT (args, ix);
9042 /* [basic.link]: A name with no linkage (notably, the name
9043 of a class or enumeration declared in a local scope)
9044 shall not be used to declare an entity with linkage.
9045 This implies that names with no linkage cannot be used as
9046 template arguments. */
9047 tree nt = no_linkage_check (t, /*relaxed_p=*/false);
9051 /* DR 488 makes use of a type with no linkage cause
9052 type deduction to fail. */
9053 if (complain & tf_error)
9055 if (TYPE_ANONYMOUS_P (nt))
9056 error ("%qT is/uses anonymous type", t);
9058 error ("template argument for %qD uses local type %qT",
9063 /* In order to avoid all sorts of complications, we do not
9064 allow variably-modified types as template arguments. */
9065 else if (variably_modified_type_p (t, NULL_TREE))
9067 if (complain & tf_error)
9068 error ("%qT is a variably modified type", t);
9072 /* A non-type argument of integral or enumerated type must be a
9074 else if (TREE_TYPE (t)
9075 && INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (t))
9076 && !TREE_CONSTANT (t))
9078 if (complain & tf_error)
9079 error ("integral expression %qE is not constant", t);
9083 if (result && (complain & tf_error))
9084 error (" trying to instantiate %qD", tmpl);
9088 /* Instantiate the indicated variable or function template TMPL with
9089 the template arguments in TARG_PTR. */
9092 instantiate_template (tree tmpl, tree targ_ptr, tsubst_flags_t complain)
9098 if (tmpl == error_mark_node)
9099 return error_mark_node;
9101 gcc_assert (TREE_CODE (tmpl) == TEMPLATE_DECL);
9103 /* If this function is a clone, handle it specially. */
9104 if (DECL_CLONED_FUNCTION_P (tmpl))
9109 spec = instantiate_template (DECL_CLONED_FUNCTION (tmpl), targ_ptr,
9111 if (spec == error_mark_node)
9112 return error_mark_node;
9114 /* Look for the clone. */
9115 FOR_EACH_CLONE (clone, spec)
9116 if (DECL_NAME (clone) == DECL_NAME (tmpl))
9118 /* We should always have found the clone by now. */
9123 /* Check to see if we already have this specialization. */
9124 spec = retrieve_specialization (tmpl, targ_ptr,
9125 /*class_specializations_p=*/false);
9126 if (spec != NULL_TREE)
9129 gen_tmpl = most_general_template (tmpl);
9130 if (tmpl != gen_tmpl)
9132 /* The TMPL is a partial instantiation. To get a full set of
9133 arguments we must add the arguments used to perform the
9134 partial instantiation. */
9135 targ_ptr = add_outermost_template_args (DECL_TI_ARGS (tmpl),
9138 /* Check to see if we already have this specialization. */
9139 spec = retrieve_specialization (gen_tmpl, targ_ptr,
9140 /*class_specializations_p=*/false);
9141 if (spec != NULL_TREE)
9145 if (check_instantiated_args (gen_tmpl, INNERMOST_TEMPLATE_ARGS (targ_ptr),
9147 return error_mark_node;
9149 /* We are building a FUNCTION_DECL, during which the access of its
9150 parameters and return types have to be checked. However this
9151 FUNCTION_DECL which is the desired context for access checking
9152 is not built yet. We solve this chicken-and-egg problem by
9153 deferring all checks until we have the FUNCTION_DECL. */
9154 push_deferring_access_checks (dk_deferred);
9156 /* Substitute template parameters. */
9157 fndecl = tsubst (DECL_TEMPLATE_RESULT (gen_tmpl),
9158 targ_ptr, complain, gen_tmpl);
9159 if (fndecl == error_mark_node)
9160 return error_mark_node;
9162 /* Now we know the specialization, compute access previously
9164 push_access_scope (fndecl);
9165 perform_deferred_access_checks ();
9166 pop_access_scope (fndecl);
9167 pop_deferring_access_checks ();
9169 /* The DECL_TI_TEMPLATE should always be the immediate parent
9170 template, not the most general template. */
9171 DECL_TI_TEMPLATE (fndecl) = tmpl;
9173 /* If we've just instantiated the main entry point for a function,
9174 instantiate all the alternate entry points as well. We do this
9175 by cloning the instantiation of the main entry point, not by
9176 instantiating the template clones. */
9177 if (TREE_CHAIN (gen_tmpl) && DECL_CLONED_FUNCTION_P (TREE_CHAIN (gen_tmpl)))
9178 clone_function_decl (fndecl, /*update_method_vec_p=*/0);
9183 /* The FN is a TEMPLATE_DECL for a function. The ARGS are the
9184 arguments that are being used when calling it. TARGS is a vector
9185 into which the deduced template arguments are placed.
9187 Return zero for success, 2 for an incomplete match that doesn't resolve
9188 all the types, and 1 for complete failure. An error message will be
9189 printed only for an incomplete match.
9191 If FN is a conversion operator, or we are trying to produce a specific
9192 specialization, RETURN_TYPE is the return type desired.
9194 The EXPLICIT_TARGS are explicit template arguments provided via a
9197 The parameter STRICT is one of:
9200 We are deducing arguments for a function call, as in
9204 We are deducing arguments for a conversion function, as in
9208 We are deducing arguments when doing an explicit instantiation
9209 as in [temp.explicit], when determining an explicit specialization
9210 as in [temp.expl.spec], or when taking the address of a function
9211 template, as in [temp.deduct.funcaddr]. */
9214 fn_type_unification (tree fn,
9215 tree explicit_targs,
9219 unification_kind_t strict,
9226 gcc_assert (TREE_CODE (fn) == TEMPLATE_DECL);
9228 fntype = TREE_TYPE (fn);
9233 The specified template arguments must match the template
9234 parameters in kind (i.e., type, nontype, template), and there
9235 must not be more arguments than there are parameters;
9236 otherwise type deduction fails.
9238 Nontype arguments must match the types of the corresponding
9239 nontype template parameters, or must be convertible to the
9240 types of the corresponding nontype parameters as specified in
9241 _temp.arg.nontype_, otherwise type deduction fails.
9243 All references in the function type of the function template
9244 to the corresponding template parameters are replaced by the
9245 specified template argument values. If a substitution in a
9246 template parameter or in the function type of the function
9247 template results in an invalid type, type deduction fails. */
9249 tree converted_args;
9252 if (explicit_targs == error_mark_node)
9256 = (coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn),
9257 explicit_targs, NULL_TREE, tf_none,
9258 /*require_all_arguments=*/0));
9259 if (converted_args == error_mark_node)
9262 /* Substitute the explicit args into the function type. This is
9263 necessary so that, for instance, explicitly declared function
9264 arguments can match null pointed constants. If we were given
9265 an incomplete set of explicit args, we must not do semantic
9266 processing during substitution as we could create partial
9268 incomplete = NUM_TMPL_ARGS (explicit_targs) != NUM_TMPL_ARGS (targs);
9269 processing_template_decl += incomplete;
9270 fntype = tsubst (fntype, converted_args, tf_none, NULL_TREE);
9271 processing_template_decl -= incomplete;
9273 if (fntype == error_mark_node)
9276 /* Place the explicitly specified arguments in TARGS. */
9277 for (i = NUM_TMPL_ARGS (converted_args); i--;)
9278 TREE_VEC_ELT (targs, i) = TREE_VEC_ELT (converted_args, i);
9281 parms = TYPE_ARG_TYPES (fntype);
9282 /* Never do unification on the 'this' parameter. */
9283 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn))
9284 parms = TREE_CHAIN (parms);
9288 parms = tree_cons (NULL_TREE, TREE_TYPE (fntype), parms);
9289 args = tree_cons (NULL_TREE, return_type, args);
9292 /* We allow incomplete unification without an error message here
9293 because the standard doesn't seem to explicitly prohibit it. Our
9294 callers must be ready to deal with unification failures in any
9296 result = type_unification_real (DECL_INNERMOST_TEMPLATE_PARMS (fn),
9297 targs, parms, args, /*subr=*/0,
9301 /* All is well so far. Now, check:
9305 When all template arguments have been deduced, all uses of
9306 template parameters in nondeduced contexts are replaced with
9307 the corresponding deduced argument values. If the
9308 substitution results in an invalid type, as described above,
9309 type deduction fails. */
9310 if (tsubst (TREE_TYPE (fn), targs, tf_none, NULL_TREE)
9317 /* Adjust types before performing type deduction, as described in
9318 [temp.deduct.call] and [temp.deduct.conv]. The rules in these two
9319 sections are symmetric. PARM is the type of a function parameter
9320 or the return type of the conversion function. ARG is the type of
9321 the argument passed to the call, or the type of the value
9322 initialized with the result of the conversion function. */
9325 maybe_adjust_types_for_deduction (unification_kind_t strict,
9338 /* Swap PARM and ARG throughout the remainder of this
9339 function; the handling is precisely symmetric since PARM
9340 will initialize ARG rather than vice versa. */
9348 /* There is nothing to do in this case. */
9355 if (TREE_CODE (*parm) != REFERENCE_TYPE)
9357 /* [temp.deduct.call]
9359 If P is not a reference type:
9361 --If A is an array type, the pointer type produced by the
9362 array-to-pointer standard conversion (_conv.array_) is
9363 used in place of A for type deduction; otherwise,
9365 --If A is a function type, the pointer type produced by
9366 the function-to-pointer standard conversion
9367 (_conv.func_) is used in place of A for type deduction;
9370 --If A is a cv-qualified type, the top level
9371 cv-qualifiers of A's type are ignored for type
9373 if (TREE_CODE (*arg) == ARRAY_TYPE)
9374 *arg = build_pointer_type (TREE_TYPE (*arg));
9375 else if (TREE_CODE (*arg) == FUNCTION_TYPE)
9376 *arg = build_pointer_type (*arg);
9378 *arg = TYPE_MAIN_VARIANT (*arg);
9381 /* [temp.deduct.call]
9383 If P is a cv-qualified type, the top level cv-qualifiers
9384 of P's type are ignored for type deduction. If P is a
9385 reference type, the type referred to by P is used for
9387 *parm = TYPE_MAIN_VARIANT (*parm);
9388 if (TREE_CODE (*parm) == REFERENCE_TYPE)
9390 *parm = TREE_TYPE (*parm);
9391 result |= UNIFY_ALLOW_OUTER_MORE_CV_QUAL;
9394 /* DR 322. For conversion deduction, remove a reference type on parm
9395 too (which has been swapped into ARG). */
9396 if (strict == DEDUCE_CONV && TREE_CODE (*arg) == REFERENCE_TYPE)
9397 *arg = TREE_TYPE (*arg);
9402 /* Most parms like fn_type_unification.
9404 If SUBR is 1, we're being called recursively (to unify the
9405 arguments of a function or method parameter of a function
9409 type_unification_real (tree tparms,
9414 unification_kind_t strict,
9419 int ntparms = TREE_VEC_LENGTH (tparms);
9421 int saw_undeduced = 0;
9424 gcc_assert (TREE_CODE (tparms) == TREE_VEC);
9425 gcc_assert (xparms == NULL_TREE || TREE_CODE (xparms) == TREE_LIST);
9426 gcc_assert (!xargs || TREE_CODE (xargs) == TREE_LIST);
9427 gcc_assert (ntparms > 0);
9432 sub_strict = (UNIFY_ALLOW_OUTER_LEVEL | UNIFY_ALLOW_MORE_CV_QUAL
9433 | UNIFY_ALLOW_DERIVED);
9437 sub_strict = UNIFY_ALLOW_LESS_CV_QUAL;
9441 sub_strict = UNIFY_ALLOW_NONE;
9452 while (parms && parms != void_list_node
9453 && args && args != void_list_node)
9455 parm = TREE_VALUE (parms);
9456 parms = TREE_CHAIN (parms);
9457 arg = TREE_VALUE (args);
9458 args = TREE_CHAIN (args);
9460 if (arg == error_mark_node)
9462 if (arg == unknown_type_node)
9463 /* We can't deduce anything from this, but we might get all the
9464 template args from other function args. */
9467 /* Conversions will be performed on a function argument that
9468 corresponds with a function parameter that contains only
9469 non-deducible template parameters and explicitly specified
9470 template parameters. */
9471 if (!uses_template_parms (parm))
9476 type = TREE_TYPE (arg);
9480 if (same_type_p (parm, type))
9482 if (strict != DEDUCE_EXACT
9483 && can_convert_arg (parm, type, TYPE_P (arg) ? NULL_TREE : arg,
9492 gcc_assert (TREE_TYPE (arg) != NULL_TREE);
9493 if (type_unknown_p (arg))
9495 /* [temp.deduct.type] A template-argument can be deduced from
9496 a pointer to function or pointer to member function
9497 argument if the set of overloaded functions does not
9498 contain function templates and at most one of a set of
9499 overloaded functions provides a unique match. */
9501 if (resolve_overloaded_unification
9502 (tparms, targs, parm, arg, strict, sub_strict)
9507 arg = TREE_TYPE (arg);
9508 if (arg == error_mark_node)
9513 int arg_strict = sub_strict;
9516 arg_strict |= maybe_adjust_types_for_deduction (strict, &parm, &arg);
9518 if (unify (tparms, targs, parm, arg, arg_strict))
9523 /* Fail if we've reached the end of the parm list, and more args
9524 are present, and the parm list isn't variadic. */
9525 if (args && args != void_list_node && parms == void_list_node)
9527 /* Fail if parms are left and they don't have default values. */
9528 if (parms && parms != void_list_node
9529 && TREE_PURPOSE (parms) == NULL_TREE)
9533 for (i = 0; i < ntparms; i++)
9534 if (!TREE_VEC_ELT (targs, i))
9536 tree tparm = TREE_VALUE (TREE_VEC_ELT (tparms, i));
9538 /* If this is an undeduced nontype parameter that depends on
9539 a type parameter, try another pass; its type may have been
9540 deduced from a later argument than the one from which
9541 this parameter can be deduced. */
9542 if (TREE_CODE (tparm) == PARM_DECL
9543 && uses_template_parms (TREE_TYPE (tparm))
9544 && !saw_undeduced++)
9553 /* Subroutine of type_unification_real. Args are like the variables at the
9554 call site. ARG is an overloaded function (or template-id); we try
9555 deducing template args from each of the overloads, and if only one
9556 succeeds, we go with that. Modifies TARGS and returns 0 on success. */
9559 resolve_overloaded_unification (tree tparms,
9563 unification_kind_t strict,
9566 tree tempargs = copy_node (targs);
9570 if (TREE_CODE (arg) == ADDR_EXPR)
9572 arg = TREE_OPERAND (arg, 0);
9578 if (TREE_CODE (arg) == COMPONENT_REF)
9579 /* Handle `&x' where `x' is some static or non-static member
9581 arg = TREE_OPERAND (arg, 1);
9583 if (TREE_CODE (arg) == OFFSET_REF)
9584 arg = TREE_OPERAND (arg, 1);
9586 /* Strip baselink information. */
9587 if (BASELINK_P (arg))
9588 arg = BASELINK_FUNCTIONS (arg);
9590 if (TREE_CODE (arg) == TEMPLATE_ID_EXPR)
9592 /* If we got some explicit template args, we need to plug them into
9593 the affected templates before we try to unify, in case the
9594 explicit args will completely resolve the templates in question. */
9596 tree expl_subargs = TREE_OPERAND (arg, 1);
9597 arg = TREE_OPERAND (arg, 0);
9599 for (; arg; arg = OVL_NEXT (arg))
9601 tree fn = OVL_CURRENT (arg);
9604 if (TREE_CODE (fn) != TEMPLATE_DECL)
9607 subargs = get_bindings (fn, DECL_TEMPLATE_RESULT (fn),
9608 expl_subargs, /*check_ret=*/false);
9611 elem = tsubst (TREE_TYPE (fn), subargs, tf_none, NULL_TREE);
9612 good += try_one_overload (tparms, targs, tempargs, parm,
9613 elem, strict, sub_strict, addr_p);
9619 gcc_assert (TREE_CODE (arg) == OVERLOAD
9620 || TREE_CODE (arg) == FUNCTION_DECL);
9622 for (; arg; arg = OVL_NEXT (arg))
9623 good += try_one_overload (tparms, targs, tempargs, parm,
9624 TREE_TYPE (OVL_CURRENT (arg)),
9625 strict, sub_strict, addr_p);
9628 /* [temp.deduct.type] A template-argument can be deduced from a pointer
9629 to function or pointer to member function argument if the set of
9630 overloaded functions does not contain function templates and at most
9631 one of a set of overloaded functions provides a unique match.
9633 So if we found multiple possibilities, we return success but don't
9638 int i = TREE_VEC_LENGTH (targs);
9640 if (TREE_VEC_ELT (tempargs, i))
9641 TREE_VEC_ELT (targs, i) = TREE_VEC_ELT (tempargs, i);
9649 /* Subroutine of resolve_overloaded_unification; does deduction for a single
9650 overload. Fills TARGS with any deduced arguments, or error_mark_node if
9651 different overloads deduce different arguments for a given parm.
9652 ADDR_P is true if the expression for which deduction is being
9653 performed was of the form "& fn" rather than simply "fn".
9655 Returns 1 on success. */
9658 try_one_overload (tree tparms,
9663 unification_kind_t strict,
9671 /* [temp.deduct.type] A template-argument can be deduced from a pointer
9672 to function or pointer to member function argument if the set of
9673 overloaded functions does not contain function templates and at most
9674 one of a set of overloaded functions provides a unique match.
9676 So if this is a template, just return success. */
9678 if (uses_template_parms (arg))
9681 if (TREE_CODE (arg) == METHOD_TYPE)
9682 arg = build_ptrmemfunc_type (build_pointer_type (arg));
9684 arg = build_pointer_type (arg);
9686 sub_strict |= maybe_adjust_types_for_deduction (strict, &parm, &arg);
9688 /* We don't copy orig_targs for this because if we have already deduced
9689 some template args from previous args, unify would complain when we
9690 try to deduce a template parameter for the same argument, even though
9691 there isn't really a conflict. */
9692 nargs = TREE_VEC_LENGTH (targs);
9693 tempargs = make_tree_vec (nargs);
9695 if (unify (tparms, tempargs, parm, arg, sub_strict) != 0)
9698 /* First make sure we didn't deduce anything that conflicts with
9699 explicitly specified args. */
9700 for (i = nargs; i--; )
9702 tree elt = TREE_VEC_ELT (tempargs, i);
9703 tree oldelt = TREE_VEC_ELT (orig_targs, i);
9707 else if (uses_template_parms (elt))
9708 /* Since we're unifying against ourselves, we will fill in
9709 template args used in the function parm list with our own
9710 template parms. Discard them. */
9711 TREE_VEC_ELT (tempargs, i) = NULL_TREE;
9712 else if (oldelt && !template_args_equal (oldelt, elt))
9716 for (i = nargs; i--; )
9718 tree elt = TREE_VEC_ELT (tempargs, i);
9721 TREE_VEC_ELT (targs, i) = elt;
9727 /* Verify that nondeduce template argument agrees with the type
9728 obtained from argument deduction. Return nonzero if the
9733 struct A { typedef int X; };
9734 template <class T, class U> struct C {};
9735 template <class T> struct C<T, typename T::X> {};
9737 Then with the instantiation `C<A, int>', we can deduce that
9738 `T' is `A' but unify () does not check whether `typename T::X'
9739 is `int'. This function ensure that they agree.
9741 TARGS, PARMS are the same as the arguments of unify.
9742 ARGS contains template arguments from all levels. */
9745 verify_class_unification (tree targs, tree parms, tree args)
9747 parms = tsubst (parms, add_outermost_template_args (args, targs),
9748 tf_none, NULL_TREE);
9749 if (parms == error_mark_node)
9752 return !comp_template_args (parms, INNERMOST_TEMPLATE_ARGS (args));
9755 /* PARM is a template class (perhaps with unbound template
9756 parameters). ARG is a fully instantiated type. If ARG can be
9757 bound to PARM, return ARG, otherwise return NULL_TREE. TPARMS and
9758 TARGS are as for unify. */
9761 try_class_unification (tree tparms, tree targs, tree parm, tree arg)
9765 if (!CLASSTYPE_TEMPLATE_INFO (arg)
9766 || (most_general_template (CLASSTYPE_TI_TEMPLATE (arg))
9767 != most_general_template (CLASSTYPE_TI_TEMPLATE (parm))))
9770 /* We need to make a new template argument vector for the call to
9771 unify. If we used TARGS, we'd clutter it up with the result of
9772 the attempted unification, even if this class didn't work out.
9773 We also don't want to commit ourselves to all the unifications
9774 we've already done, since unification is supposed to be done on
9775 an argument-by-argument basis. In other words, consider the
9776 following pathological case:
9778 template <int I, int J, int K>
9781 template <int I, int J>
9782 struct S<I, J, 2> : public S<I, I, I>, S<J, J, J> {};
9784 template <int I, int J, int K>
9785 void f(S<I, J, K>, S<I, I, I>);
9794 Now, by the time we consider the unification involving `s2', we
9795 already know that we must have `f<0, 0, 0>'. But, even though
9796 `S<0, 1, 2>' is derived from `S<0, 0, 0>', the code is invalid
9797 because there are two ways to unify base classes of S<0, 1, 2>
9798 with S<I, I, I>. If we kept the already deduced knowledge, we
9799 would reject the possibility I=1. */
9800 copy_of_targs = make_tree_vec (TREE_VEC_LENGTH (targs));
9802 /* If unification failed, we're done. */
9803 if (unify (tparms, copy_of_targs, CLASSTYPE_TI_ARGS (parm),
9804 CLASSTYPE_TI_ARGS (arg), UNIFY_ALLOW_NONE))
9810 /* Given a template type PARM and a class type ARG, find the unique
9811 base type in ARG that is an instance of PARM. We do not examine
9812 ARG itself; only its base-classes. If there is not exactly one
9813 appropriate base class, return NULL_TREE. PARM may be the type of
9814 a partial specialization, as well as a plain template type. Used
9818 get_template_base (tree tparms, tree targs, tree parm, tree arg)
9820 tree rval = NULL_TREE;
9823 gcc_assert (IS_AGGR_TYPE_CODE (TREE_CODE (arg)));
9825 binfo = TYPE_BINFO (complete_type (arg));
9827 /* The type could not be completed. */
9830 /* Walk in inheritance graph order. The search order is not
9831 important, and this avoids multiple walks of virtual bases. */
9832 for (binfo = TREE_CHAIN (binfo); binfo; binfo = TREE_CHAIN (binfo))
9834 tree r = try_class_unification (tparms, targs, parm, BINFO_TYPE (binfo));
9838 /* If there is more than one satisfactory baseclass, then:
9842 If they yield more than one possible deduced A, the type
9846 if (rval && !same_type_p (r, rval))
9856 /* Returns the level of DECL, which declares a template parameter. */
9859 template_decl_level (tree decl)
9861 switch (TREE_CODE (decl))
9865 return TEMPLATE_TYPE_LEVEL (TREE_TYPE (decl));
9868 return TEMPLATE_PARM_LEVEL (DECL_INITIAL (decl));
9876 /* Decide whether ARG can be unified with PARM, considering only the
9877 cv-qualifiers of each type, given STRICT as documented for unify.
9878 Returns nonzero iff the unification is OK on that basis. */
9881 check_cv_quals_for_unify (int strict, tree arg, tree parm)
9883 int arg_quals = cp_type_quals (arg);
9884 int parm_quals = cp_type_quals (parm);
9886 if (TREE_CODE (parm) == TEMPLATE_TYPE_PARM
9887 && !(strict & UNIFY_ALLOW_OUTER_MORE_CV_QUAL))
9889 /* Although a CVR qualifier is ignored when being applied to a
9890 substituted template parameter ([8.3.2]/1 for example), that
9891 does not apply during deduction [14.8.2.4]/1, (even though
9892 that is not explicitly mentioned, [14.8.2.4]/9 indicates
9893 this). Except when we're allowing additional CV qualifiers
9894 at the outer level [14.8.2.1]/3,1st bullet. */
9895 if ((TREE_CODE (arg) == REFERENCE_TYPE
9896 || TREE_CODE (arg) == FUNCTION_TYPE
9897 || TREE_CODE (arg) == METHOD_TYPE)
9898 && (parm_quals & (TYPE_QUAL_CONST | TYPE_QUAL_VOLATILE)))
9901 if ((!POINTER_TYPE_P (arg) && TREE_CODE (arg) != TEMPLATE_TYPE_PARM)
9902 && (parm_quals & TYPE_QUAL_RESTRICT))
9906 if (!(strict & (UNIFY_ALLOW_MORE_CV_QUAL | UNIFY_ALLOW_OUTER_MORE_CV_QUAL))
9907 && (arg_quals & parm_quals) != parm_quals)
9910 if (!(strict & (UNIFY_ALLOW_LESS_CV_QUAL | UNIFY_ALLOW_OUTER_LESS_CV_QUAL))
9911 && (parm_quals & arg_quals) != arg_quals)
9917 /* Takes parameters as for type_unification. Returns 0 if the
9918 type deduction succeeds, 1 otherwise. The parameter STRICT is a
9919 bitwise or of the following flags:
9922 Require an exact match between PARM and ARG.
9923 UNIFY_ALLOW_MORE_CV_QUAL:
9924 Allow the deduced ARG to be more cv-qualified (by qualification
9925 conversion) than ARG.
9926 UNIFY_ALLOW_LESS_CV_QUAL:
9927 Allow the deduced ARG to be less cv-qualified than ARG.
9928 UNIFY_ALLOW_DERIVED:
9929 Allow the deduced ARG to be a template base class of ARG,
9930 or a pointer to a template base class of the type pointed to by
9932 UNIFY_ALLOW_INTEGER:
9933 Allow any integral type to be deduced. See the TEMPLATE_PARM_INDEX
9934 case for more information.
9935 UNIFY_ALLOW_OUTER_LEVEL:
9936 This is the outermost level of a deduction. Used to determine validity
9937 of qualification conversions. A valid qualification conversion must
9938 have const qualified pointers leading up to the inner type which
9939 requires additional CV quals, except at the outer level, where const
9940 is not required [conv.qual]. It would be normal to set this flag in
9941 addition to setting UNIFY_ALLOW_MORE_CV_QUAL.
9942 UNIFY_ALLOW_OUTER_MORE_CV_QUAL:
9943 This is the outermost level of a deduction, and PARM can be more CV
9944 qualified at this point.
9945 UNIFY_ALLOW_OUTER_LESS_CV_QUAL:
9946 This is the outermost level of a deduction, and PARM can be less CV
9947 qualified at this point. */
9950 unify (tree tparms, tree targs, tree parm, tree arg, int strict)
9955 int strict_in = strict;
9957 /* I don't think this will do the right thing with respect to types.
9958 But the only case I've seen it in so far has been array bounds, where
9959 signedness is the only information lost, and I think that will be
9961 while (TREE_CODE (parm) == NOP_EXPR)
9962 parm = TREE_OPERAND (parm, 0);
9964 if (arg == error_mark_node)
9966 if (arg == unknown_type_node)
9967 /* We can't deduce anything from this, but we might get all the
9968 template args from other function args. */
9971 /* If PARM uses template parameters, then we can't bail out here,
9972 even if ARG == PARM, since we won't record unifications for the
9973 template parameters. We might need them if we're trying to
9974 figure out which of two things is more specialized. */
9975 if (arg == parm && !uses_template_parms (parm))
9978 /* Immediately reject some pairs that won't unify because of
9979 cv-qualification mismatches. */
9980 if (TREE_CODE (arg) == TREE_CODE (parm)
9982 /* It is the elements of the array which hold the cv quals of an array
9983 type, and the elements might be template type parms. We'll check
9985 && TREE_CODE (arg) != ARRAY_TYPE
9986 /* We check the cv-qualifiers when unifying with template type
9987 parameters below. We want to allow ARG `const T' to unify with
9988 PARM `T' for example, when computing which of two templates
9989 is more specialized, for example. */
9990 && TREE_CODE (arg) != TEMPLATE_TYPE_PARM
9991 && !check_cv_quals_for_unify (strict_in, arg, parm))
9994 if (!(strict & UNIFY_ALLOW_OUTER_LEVEL)
9995 && TYPE_P (parm) && !CP_TYPE_CONST_P (parm))
9996 strict &= ~UNIFY_ALLOW_MORE_CV_QUAL;
9997 strict &= ~UNIFY_ALLOW_OUTER_LEVEL;
9998 strict &= ~UNIFY_ALLOW_DERIVED;
9999 strict &= ~UNIFY_ALLOW_OUTER_MORE_CV_QUAL;
10000 strict &= ~UNIFY_ALLOW_OUTER_LESS_CV_QUAL;
10002 switch (TREE_CODE (parm))
10004 case TYPENAME_TYPE:
10006 case UNBOUND_CLASS_TEMPLATE:
10007 /* In a type which contains a nested-name-specifier, template
10008 argument values cannot be deduced for template parameters used
10009 within the nested-name-specifier. */
10012 case TEMPLATE_TYPE_PARM:
10013 case TEMPLATE_TEMPLATE_PARM:
10014 case BOUND_TEMPLATE_TEMPLATE_PARM:
10015 tparm = TREE_VALUE (TREE_VEC_ELT (tparms, 0));
10017 if (TEMPLATE_TYPE_LEVEL (parm)
10018 != template_decl_level (tparm))
10019 /* The PARM is not one we're trying to unify. Just check
10020 to see if it matches ARG. */
10021 return (TREE_CODE (arg) == TREE_CODE (parm)
10022 && same_type_p (parm, arg)) ? 0 : 1;
10023 idx = TEMPLATE_TYPE_IDX (parm);
10024 targ = TREE_VEC_ELT (targs, idx);
10025 tparm = TREE_VALUE (TREE_VEC_ELT (tparms, idx));
10027 /* Check for mixed types and values. */
10028 if ((TREE_CODE (parm) == TEMPLATE_TYPE_PARM
10029 && TREE_CODE (tparm) != TYPE_DECL)
10030 || (TREE_CODE (parm) == TEMPLATE_TEMPLATE_PARM
10031 && TREE_CODE (tparm) != TEMPLATE_DECL))
10034 if (TREE_CODE (parm) == BOUND_TEMPLATE_TEMPLATE_PARM)
10036 /* ARG must be constructed from a template class or a template
10037 template parameter. */
10038 if (TREE_CODE (arg) != BOUND_TEMPLATE_TEMPLATE_PARM
10039 && (TREE_CODE (arg) != RECORD_TYPE || !CLASSTYPE_TEMPLATE_INFO (arg)))
10043 tree parmtmpl = TYPE_TI_TEMPLATE (parm);
10044 tree parmvec = TYPE_TI_ARGS (parm);
10045 tree argvec = INNERMOST_TEMPLATE_ARGS (TYPE_TI_ARGS (arg));
10047 = DECL_INNERMOST_TEMPLATE_PARMS (TYPE_TI_TEMPLATE (arg));
10050 /* The parameter and argument roles have to be switched here
10051 in order to handle default arguments properly. For example,
10052 template<template <class> class TT> void f(TT<int>)
10053 should be able to accept vector<int> which comes from
10054 template <class T, class Allocator = allocator>
10057 if (coerce_template_parms (argtmplvec, parmvec, parmtmpl, 0, 1)
10058 == error_mark_node)
10061 /* Deduce arguments T, i from TT<T> or TT<i>.
10062 We check each element of PARMVEC and ARGVEC individually
10063 rather than the whole TREE_VEC since they can have
10064 different number of elements. */
10066 for (i = 0; i < TREE_VEC_LENGTH (parmvec); ++i)
10068 if (unify (tparms, targs,
10069 TREE_VEC_ELT (parmvec, i),
10070 TREE_VEC_ELT (argvec, i),
10075 arg = TYPE_TI_TEMPLATE (arg);
10077 /* Fall through to deduce template name. */
10080 if (TREE_CODE (parm) == TEMPLATE_TEMPLATE_PARM
10081 || TREE_CODE (parm) == BOUND_TEMPLATE_TEMPLATE_PARM)
10083 /* Deduce template name TT from TT, TT<>, TT<T> and TT<i>. */
10085 /* Simple cases: Value already set, does match or doesn't. */
10086 if (targ != NULL_TREE && template_args_equal (targ, arg))
10093 /* If PARM is `const T' and ARG is only `int', we don't have
10094 a match unless we are allowing additional qualification.
10095 If ARG is `const int' and PARM is just `T' that's OK;
10096 that binds `const int' to `T'. */
10097 if (!check_cv_quals_for_unify (strict_in | UNIFY_ALLOW_LESS_CV_QUAL,
10101 /* Consider the case where ARG is `const volatile int' and
10102 PARM is `const T'. Then, T should be `volatile int'. */
10103 arg = cp_build_qualified_type_real
10104 (arg, cp_type_quals (arg) & ~cp_type_quals (parm), tf_none);
10105 if (arg == error_mark_node)
10108 /* Simple cases: Value already set, does match or doesn't. */
10109 if (targ != NULL_TREE && same_type_p (targ, arg))
10114 /* Make sure that ARG is not a variable-sized array. (Note
10115 that were talking about variable-sized arrays (like
10116 `int[n]'), rather than arrays of unknown size (like
10117 `int[]').) We'll get very confused by such a type since
10118 the bound of the array will not be computable in an
10119 instantiation. Besides, such types are not allowed in
10120 ISO C++, so we can do as we please here. */
10121 if (variably_modified_type_p (arg, NULL_TREE))
10125 TREE_VEC_ELT (targs, idx) = arg;
10128 case TEMPLATE_PARM_INDEX:
10129 tparm = TREE_VALUE (TREE_VEC_ELT (tparms, 0));
10131 if (TEMPLATE_PARM_LEVEL (parm)
10132 != template_decl_level (tparm))
10133 /* The PARM is not one we're trying to unify. Just check
10134 to see if it matches ARG. */
10135 return !(TREE_CODE (arg) == TREE_CODE (parm)
10136 && cp_tree_equal (parm, arg));
10138 idx = TEMPLATE_PARM_IDX (parm);
10139 targ = TREE_VEC_ELT (targs, idx);
10142 return !cp_tree_equal (targ, arg);
10144 /* [temp.deduct.type] If, in the declaration of a function template
10145 with a non-type template-parameter, the non-type
10146 template-parameter is used in an expression in the function
10147 parameter-list and, if the corresponding template-argument is
10148 deduced, the template-argument type shall match the type of the
10149 template-parameter exactly, except that a template-argument
10150 deduced from an array bound may be of any integral type.
10151 The non-type parameter might use already deduced type parameters. */
10152 tparm = tsubst (TREE_TYPE (parm), targs, 0, NULL_TREE);
10153 if (!TREE_TYPE (arg))
10154 /* Template-parameter dependent expression. Just accept it for now.
10155 It will later be processed in convert_template_argument. */
10157 else if (same_type_p (TREE_TYPE (arg), tparm))
10159 else if ((strict & UNIFY_ALLOW_INTEGER)
10160 && (TREE_CODE (tparm) == INTEGER_TYPE
10161 || TREE_CODE (tparm) == BOOLEAN_TYPE))
10162 /* Convert the ARG to the type of PARM; the deduced non-type
10163 template argument must exactly match the types of the
10164 corresponding parameter. */
10165 arg = fold (build_nop (TREE_TYPE (parm), arg));
10166 else if (uses_template_parms (tparm))
10167 /* We haven't deduced the type of this parameter yet. Try again
10173 TREE_VEC_ELT (targs, idx) = arg;
10178 /* A pointer-to-member constant can be unified only with
10179 another constant. */
10180 if (TREE_CODE (arg) != PTRMEM_CST)
10183 /* Just unify the class member. It would be useless (and possibly
10184 wrong, depending on the strict flags) to unify also
10185 PTRMEM_CST_CLASS, because we want to be sure that both parm and
10186 arg refer to the same variable, even if through different
10187 classes. For instance:
10189 struct A { int x; };
10192 Unification of &A::x and &B::x must succeed. */
10193 return unify (tparms, targs, PTRMEM_CST_MEMBER (parm),
10194 PTRMEM_CST_MEMBER (arg), strict);
10199 if (TREE_CODE (arg) != POINTER_TYPE)
10202 /* [temp.deduct.call]
10204 A can be another pointer or pointer to member type that can
10205 be converted to the deduced A via a qualification
10206 conversion (_conv.qual_).
10208 We pass down STRICT here rather than UNIFY_ALLOW_NONE.
10209 This will allow for additional cv-qualification of the
10210 pointed-to types if appropriate. */
10212 if (TREE_CODE (TREE_TYPE (arg)) == RECORD_TYPE)
10213 /* The derived-to-base conversion only persists through one
10214 level of pointers. */
10215 strict |= (strict_in & UNIFY_ALLOW_DERIVED);
10217 return unify (tparms, targs, TREE_TYPE (parm),
10218 TREE_TYPE (arg), strict);
10221 case REFERENCE_TYPE:
10222 if (TREE_CODE (arg) != REFERENCE_TYPE)
10224 return unify (tparms, targs, TREE_TYPE (parm), TREE_TYPE (arg),
10225 strict & UNIFY_ALLOW_MORE_CV_QUAL);
10228 if (TREE_CODE (arg) != ARRAY_TYPE)
10230 if ((TYPE_DOMAIN (parm) == NULL_TREE)
10231 != (TYPE_DOMAIN (arg) == NULL_TREE))
10233 if (TYPE_DOMAIN (parm) != NULL_TREE)
10238 parm_max = TYPE_MAX_VALUE (TYPE_DOMAIN (parm));
10239 arg_max = TYPE_MAX_VALUE (TYPE_DOMAIN (arg));
10241 /* Our representation of array types uses "N - 1" as the
10242 TYPE_MAX_VALUE for an array with "N" elements, if "N" is
10243 not an integer constant. */
10244 if (TREE_CODE (parm_max) == MINUS_EXPR)
10246 arg_max = fold_build2 (PLUS_EXPR,
10249 TREE_OPERAND (parm_max, 1));
10250 parm_max = TREE_OPERAND (parm_max, 0);
10253 if (unify (tparms, targs, parm_max, arg_max, UNIFY_ALLOW_INTEGER))
10256 return unify (tparms, targs, TREE_TYPE (parm), TREE_TYPE (arg),
10257 strict & UNIFY_ALLOW_MORE_CV_QUAL);
10264 case ENUMERAL_TYPE:
10266 if (TREE_CODE (arg) != TREE_CODE (parm))
10269 /* We have already checked cv-qualification at the top of the
10271 if (!same_type_ignoring_top_level_qualifiers_p (arg, parm))
10274 /* As far as unification is concerned, this wins. Later checks
10275 will invalidate it if necessary. */
10278 /* Types INTEGER_CST and MINUS_EXPR can come from array bounds. */
10279 /* Type INTEGER_CST can come from ordinary constant template args. */
10281 while (TREE_CODE (arg) == NOP_EXPR)
10282 arg = TREE_OPERAND (arg, 0);
10284 if (TREE_CODE (arg) != INTEGER_CST)
10286 return !tree_int_cst_equal (parm, arg);
10291 if (TREE_CODE (arg) != TREE_VEC)
10293 if (TREE_VEC_LENGTH (parm) != TREE_VEC_LENGTH (arg))
10295 for (i = 0; i < TREE_VEC_LENGTH (parm); ++i)
10296 if (unify (tparms, targs,
10297 TREE_VEC_ELT (parm, i), TREE_VEC_ELT (arg, i),
10305 if (TREE_CODE (arg) != TREE_CODE (parm))
10308 if (TYPE_PTRMEMFUNC_P (parm))
10310 if (!TYPE_PTRMEMFUNC_P (arg))
10313 return unify (tparms, targs,
10314 TYPE_PTRMEMFUNC_FN_TYPE (parm),
10315 TYPE_PTRMEMFUNC_FN_TYPE (arg),
10319 if (CLASSTYPE_TEMPLATE_INFO (parm))
10321 tree t = NULL_TREE;
10323 if (strict_in & UNIFY_ALLOW_DERIVED)
10325 /* First, we try to unify the PARM and ARG directly. */
10326 t = try_class_unification (tparms, targs,
10331 /* Fallback to the special case allowed in
10332 [temp.deduct.call]:
10334 If P is a class, and P has the form
10335 template-id, then A can be a derived class of
10336 the deduced A. Likewise, if P is a pointer to
10337 a class of the form template-id, A can be a
10338 pointer to a derived class pointed to by the
10340 t = get_template_base (tparms, targs, parm, arg);
10346 else if (CLASSTYPE_TEMPLATE_INFO (arg)
10347 && (CLASSTYPE_TI_TEMPLATE (parm)
10348 == CLASSTYPE_TI_TEMPLATE (arg)))
10349 /* Perhaps PARM is something like S<U> and ARG is S<int>.
10350 Then, we should unify `int' and `U'. */
10353 /* There's no chance of unification succeeding. */
10356 return unify (tparms, targs, CLASSTYPE_TI_ARGS (parm),
10357 CLASSTYPE_TI_ARGS (t), UNIFY_ALLOW_NONE);
10359 else if (!same_type_ignoring_top_level_qualifiers_p (parm, arg))
10364 case FUNCTION_TYPE:
10365 if (TREE_CODE (arg) != TREE_CODE (parm))
10368 /* CV qualifications for methods can never be deduced, they must
10369 match exactly. We need to check them explicitly here,
10370 because type_unification_real treats them as any other
10371 cvqualified parameter. */
10372 if (TREE_CODE (parm) == METHOD_TYPE
10373 && (!check_cv_quals_for_unify
10375 TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (arg))),
10376 TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (parm))))))
10379 if (unify (tparms, targs, TREE_TYPE (parm),
10380 TREE_TYPE (arg), UNIFY_ALLOW_NONE))
10382 return type_unification_real (tparms, targs, TYPE_ARG_TYPES (parm),
10383 TYPE_ARG_TYPES (arg), 1, DEDUCE_EXACT,
10387 /* Unify a pointer to member with a pointer to member function, which
10388 deduces the type of the member as a function type. */
10389 if (TYPE_PTRMEMFUNC_P (arg))
10393 cp_cv_quals cv_quals;
10395 /* Check top-level cv qualifiers */
10396 if (!check_cv_quals_for_unify (UNIFY_ALLOW_NONE, arg, parm))
10399 if (unify (tparms, targs, TYPE_OFFSET_BASETYPE (parm),
10400 TYPE_PTRMEMFUNC_OBJECT_TYPE (arg), UNIFY_ALLOW_NONE))
10403 /* Determine the type of the function we are unifying against. */
10404 method_type = TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (arg));
10406 build_function_type (TREE_TYPE (method_type),
10407 TREE_CHAIN (TYPE_ARG_TYPES (method_type)));
10409 /* Extract the cv-qualifiers of the member function from the
10410 implicit object parameter and place them on the function
10411 type to be restored later. */
10413 cp_type_quals(TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (method_type))));
10414 fntype = build_qualified_type (fntype, cv_quals);
10415 return unify (tparms, targs, TREE_TYPE (parm), fntype, strict);
10418 if (TREE_CODE (arg) != OFFSET_TYPE)
10420 if (unify (tparms, targs, TYPE_OFFSET_BASETYPE (parm),
10421 TYPE_OFFSET_BASETYPE (arg), UNIFY_ALLOW_NONE))
10423 return unify (tparms, targs, TREE_TYPE (parm), TREE_TYPE (arg),
10427 if (DECL_TEMPLATE_PARM_P (parm))
10428 return unify (tparms, targs, DECL_INITIAL (parm), arg, strict);
10429 if (arg != integral_constant_value (parm))
10434 case TEMPLATE_DECL:
10435 /* Matched cases are handled by the ARG == PARM test above. */
10439 gcc_assert (EXPR_P (parm));
10441 /* We must be looking at an expression. This can happen with
10445 void foo(S<I>, S<I + 2>);
10447 This is a "nondeduced context":
10451 The nondeduced contexts are:
10453 --A type that is a template-id in which one or more of
10454 the template-arguments is an expression that references
10455 a template-parameter.
10457 In these cases, we assume deduction succeeded, but don't
10458 actually infer any unifications. */
10460 if (!uses_template_parms (parm)
10461 && !template_args_equal (parm, arg))
10468 /* Note that DECL can be defined in this translation unit, if
10472 mark_definable (tree decl)
10475 DECL_NOT_REALLY_EXTERN (decl) = 1;
10476 FOR_EACH_CLONE (clone, decl)
10477 DECL_NOT_REALLY_EXTERN (clone) = 1;
10480 /* Called if RESULT is explicitly instantiated, or is a member of an
10481 explicitly instantiated class. */
10484 mark_decl_instantiated (tree result, int extern_p)
10486 SET_DECL_EXPLICIT_INSTANTIATION (result);
10488 /* If this entity has already been written out, it's too late to
10489 make any modifications. */
10490 if (TREE_ASM_WRITTEN (result))
10493 if (TREE_CODE (result) != FUNCTION_DECL)
10494 /* The TREE_PUBLIC flag for function declarations will have been
10495 set correctly by tsubst. */
10496 TREE_PUBLIC (result) = 1;
10498 /* This might have been set by an earlier implicit instantiation. */
10499 DECL_COMDAT (result) = 0;
10502 DECL_NOT_REALLY_EXTERN (result) = 0;
10505 mark_definable (result);
10506 /* Always make artificials weak. */
10507 if (DECL_ARTIFICIAL (result) && flag_weak)
10508 comdat_linkage (result);
10509 /* For WIN32 we also want to put explicit instantiations in
10510 linkonce sections. */
10511 else if (TREE_PUBLIC (result))
10512 maybe_make_one_only (result);
10515 /* If EXTERN_P, then this function will not be emitted -- unless
10516 followed by an explicit instantiation, at which point its linkage
10517 will be adjusted. If !EXTERN_P, then this function will be
10518 emitted here. In neither circumstance do we want
10519 import_export_decl to adjust the linkage. */
10520 DECL_INTERFACE_KNOWN (result) = 1;
10523 /* Given two function templates PAT1 and PAT2, return:
10525 1 if PAT1 is more specialized than PAT2 as described in [temp.func.order].
10526 -1 if PAT2 is more specialized than PAT1.
10527 0 if neither is more specialized.
10529 LEN indicates the number of parameters we should consider
10530 (defaulted parameters should not be considered).
10532 The 1998 std underspecified function template partial ordering, and
10533 DR214 addresses the issue. We take pairs of arguments, one from
10534 each of the templates, and deduce them against each other. One of
10535 the templates will be more specialized if all the *other*
10536 template's arguments deduce against its arguments and at least one
10537 of its arguments *does* *not* deduce against the other template's
10538 corresponding argument. Deduction is done as for class templates.
10539 The arguments used in deduction have reference and top level cv
10540 qualifiers removed. Iff both arguments were originally reference
10541 types *and* deduction succeeds in both directions, the template
10542 with the more cv-qualified argument wins for that pairing (if
10543 neither is more cv-qualified, they both are equal). Unlike regular
10544 deduction, after all the arguments have been deduced in this way,
10545 we do *not* verify the deduced template argument values can be
10546 substituted into non-deduced contexts, nor do we have to verify
10547 that all template arguments have been deduced. */
10550 more_specialized_fn (tree pat1, tree pat2, int len)
10552 tree decl1 = DECL_TEMPLATE_RESULT (pat1);
10553 tree decl2 = DECL_TEMPLATE_RESULT (pat2);
10554 tree targs1 = make_tree_vec (DECL_NTPARMS (pat1));
10555 tree targs2 = make_tree_vec (DECL_NTPARMS (pat2));
10556 tree tparms1 = DECL_INNERMOST_TEMPLATE_PARMS (pat1);
10557 tree tparms2 = DECL_INNERMOST_TEMPLATE_PARMS (pat2);
10558 tree args1 = TYPE_ARG_TYPES (TREE_TYPE (decl1));
10559 tree args2 = TYPE_ARG_TYPES (TREE_TYPE (decl2));
10563 /* Remove the this parameter from non-static member functions. If
10564 one is a non-static member function and the other is not a static
10565 member function, remove the first parameter from that function
10566 also. This situation occurs for operator functions where we
10567 locate both a member function (with this pointer) and non-member
10568 operator (with explicit first operand). */
10569 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl1))
10571 len--; /* LEN is the number of significant arguments for DECL1 */
10572 args1 = TREE_CHAIN (args1);
10573 if (!DECL_STATIC_FUNCTION_P (decl2))
10574 args2 = TREE_CHAIN (args2);
10576 else if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl2))
10578 args2 = TREE_CHAIN (args2);
10579 if (!DECL_STATIC_FUNCTION_P (decl1))
10582 args1 = TREE_CHAIN (args1);
10586 /* If only one is a conversion operator, they are unordered. */
10587 if (DECL_CONV_FN_P (decl1) != DECL_CONV_FN_P (decl2))
10590 /* Consider the return type for a conversion function */
10591 if (DECL_CONV_FN_P (decl1))
10593 args1 = tree_cons (NULL_TREE, TREE_TYPE (TREE_TYPE (decl1)), args1);
10594 args2 = tree_cons (NULL_TREE, TREE_TYPE (TREE_TYPE (decl2)), args2);
10598 processing_template_decl++;
10602 tree arg1 = TREE_VALUE (args1);
10603 tree arg2 = TREE_VALUE (args2);
10604 int deduce1, deduce2;
10608 if (TREE_CODE (arg1) == REFERENCE_TYPE)
10610 arg1 = TREE_TYPE (arg1);
10611 quals1 = cp_type_quals (arg1);
10614 if (TREE_CODE (arg2) == REFERENCE_TYPE)
10616 arg2 = TREE_TYPE (arg2);
10617 quals2 = cp_type_quals (arg2);
10620 if ((quals1 < 0) != (quals2 < 0))
10622 /* Only of the args is a reference, see if we should apply
10623 array/function pointer decay to it. This is not part of
10624 DR214, but is, IMHO, consistent with the deduction rules
10625 for the function call itself, and with our earlier
10626 implementation of the underspecified partial ordering
10627 rules. (nathan). */
10630 switch (TREE_CODE (arg1))
10633 arg1 = TREE_TYPE (arg1);
10635 case FUNCTION_TYPE:
10636 arg1 = build_pointer_type (arg1);
10645 switch (TREE_CODE (arg2))
10648 arg2 = TREE_TYPE (arg2);
10650 case FUNCTION_TYPE:
10651 arg2 = build_pointer_type (arg2);
10660 arg1 = TYPE_MAIN_VARIANT (arg1);
10661 arg2 = TYPE_MAIN_VARIANT (arg2);
10663 deduce1 = !unify (tparms1, targs1, arg1, arg2, UNIFY_ALLOW_NONE);
10664 deduce2 = !unify (tparms2, targs2, arg2, arg1, UNIFY_ALLOW_NONE);
10670 if (better1 < 0 && better2 < 0)
10671 /* We've failed to deduce something in either direction.
10672 These must be unordered. */
10675 if (deduce1 && deduce2 && quals1 >= 0 && quals2 >= 0)
10677 /* Deduces in both directions, see if quals can
10678 disambiguate. Pretend the worse one failed to deduce. */
10679 if ((quals1 & quals2) == quals2)
10681 if ((quals1 & quals2) == quals1)
10684 if (deduce1 && !deduce2 && !better2)
10686 if (deduce2 && !deduce1 && !better1)
10689 args1 = TREE_CHAIN (args1);
10690 args2 = TREE_CHAIN (args2);
10693 processing_template_decl--;
10695 return (better1 > 0) - (better2 > 0);
10698 /* Given two class template specialization list nodes PAT1 and PAT2, return:
10700 1 if PAT1 is more specialized than PAT2 as described in [temp.class.order].
10701 -1 if PAT2 is more specialized than PAT1.
10702 0 if neither is more specialized.
10704 FULL_ARGS is the full set of template arguments that triggers this
10705 partial ordering. */
10708 more_specialized_class (tree pat1, tree pat2, tree full_args)
10713 /* Just like what happens for functions, if we are ordering between
10714 different class template specializations, we may encounter dependent
10715 types in the arguments, and we need our dependency check functions
10716 to behave correctly. */
10717 ++processing_template_decl;
10718 targs = get_class_bindings (TREE_VALUE (pat1), TREE_PURPOSE (pat1),
10719 add_outermost_template_args (full_args, TREE_PURPOSE (pat2)));
10723 targs = get_class_bindings (TREE_VALUE (pat2), TREE_PURPOSE (pat2),
10724 add_outermost_template_args (full_args, TREE_PURPOSE (pat1)));
10727 --processing_template_decl;
10732 /* Return the template arguments that will produce the function signature
10733 DECL from the function template FN, with the explicit template
10734 arguments EXPLICIT_ARGS. If CHECK_RETTYPE is true, the return type must
10735 also match. Return NULL_TREE if no satisfactory arguments could be
10739 get_bindings (tree fn, tree decl, tree explicit_args, bool check_rettype)
10741 int ntparms = DECL_NTPARMS (fn);
10742 tree targs = make_tree_vec (ntparms);
10744 tree decl_arg_types;
10746 /* Substitute the explicit template arguments into the type of DECL.
10747 The call to fn_type_unification will handle substitution into the
10749 decl_type = TREE_TYPE (decl);
10750 if (explicit_args && uses_template_parms (decl_type))
10753 tree converted_args;
10755 if (DECL_TEMPLATE_INFO (decl))
10756 tmpl = DECL_TI_TEMPLATE (decl);
10758 /* We can get here for some invalid specializations. */
10762 = (coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl),
10763 explicit_args, NULL_TREE,
10764 tf_none, /*require_all_arguments=*/0));
10765 if (converted_args == error_mark_node)
10768 decl_type = tsubst (decl_type, converted_args, tf_none, NULL_TREE);
10769 if (decl_type == error_mark_node)
10773 decl_arg_types = TYPE_ARG_TYPES (decl_type);
10774 /* Never do unification on the 'this' parameter. */
10775 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl))
10776 decl_arg_types = TREE_CHAIN (decl_arg_types);
10778 if (fn_type_unification (fn, explicit_args, targs,
10780 (check_rettype || DECL_CONV_FN_P (fn)
10781 ? TREE_TYPE (decl_type) : NULL_TREE),
10782 DEDUCE_EXACT, LOOKUP_NORMAL))
10788 /* Return the innermost template arguments that, when applied to a
10789 template specialization whose innermost template parameters are
10790 TPARMS, and whose specialization arguments are PARMS, yield the
10793 For example, suppose we have:
10795 template <class T, class U> struct S {};
10796 template <class T> struct S<T*, int> {};
10798 Then, suppose we want to get `S<double*, int>'. The TPARMS will be
10799 {T}, the PARMS will be {T*, int} and the ARGS will be {double*,
10800 int}. The resulting vector will be {double}, indicating that `T'
10801 is bound to `double'. */
10804 get_class_bindings (tree tparms, tree parms, tree args)
10806 int i, ntparms = TREE_VEC_LENGTH (tparms);
10807 tree vec = make_tree_vec (ntparms);
10809 if (unify (tparms, vec, parms, INNERMOST_TEMPLATE_ARGS (args),
10813 for (i = 0; i < ntparms; ++i)
10814 if (! TREE_VEC_ELT (vec, i))
10817 if (verify_class_unification (vec, parms, args))
10823 /* In INSTANTIATIONS is a list of <INSTANTIATION, TEMPLATE> pairs.
10824 Pick the most specialized template, and return the corresponding
10825 instantiation, or if there is no corresponding instantiation, the
10826 template itself. If there is no most specialized template,
10827 error_mark_node is returned. If there are no templates at all,
10828 NULL_TREE is returned. */
10831 most_specialized_instantiation (tree instantiations)
10835 if (!instantiations)
10838 ++processing_template_decl;
10840 champ = instantiations;
10841 for (fn = TREE_CHAIN (instantiations); fn; fn = TREE_CHAIN (fn))
10845 if (get_bindings (TREE_VALUE (champ),
10846 DECL_TEMPLATE_RESULT (TREE_VALUE (fn)),
10847 NULL_TREE, /*check_ret=*/false))
10850 if (get_bindings (TREE_VALUE (fn),
10851 DECL_TEMPLATE_RESULT (TREE_VALUE (champ)),
10852 NULL_TREE, /*check_ret=*/false))
10859 /* Equally specialized, move to next function. If there
10860 is no next function, nothing's most specialized. */
10861 fn = TREE_CHAIN (fn);
10868 /* Now verify that champ is better than everything earlier in the
10869 instantiation list. */
10870 for (fn = instantiations; fn != champ; fn = TREE_CHAIN (fn))
10871 if (get_bindings (TREE_VALUE (champ),
10872 DECL_TEMPLATE_RESULT (TREE_VALUE (fn)),
10873 NULL_TREE, /*check_ret=*/false)
10874 || !get_bindings (TREE_VALUE (fn),
10875 DECL_TEMPLATE_RESULT (TREE_VALUE (champ)),
10876 NULL_TREE, /*check_ret=*/false))
10882 processing_template_decl--;
10885 return error_mark_node;
10887 return TREE_PURPOSE (champ) ? TREE_PURPOSE (champ) : TREE_VALUE (champ);
10890 /* Return the most specialized of the list of templates in FNS that can
10891 produce an instantiation matching DECL, given the explicit template
10892 arguments EXPLICIT_ARGS. */
10895 most_specialized (tree fns, tree decl, tree explicit_args)
10897 tree candidates = NULL_TREE;
10900 for (fn = fns; fn; fn = TREE_CHAIN (fn))
10902 tree candidate = TREE_VALUE (fn);
10904 args = get_bindings (candidate, decl, explicit_args, /*check_ret=*/true);
10906 candidates = tree_cons (NULL_TREE, candidate, candidates);
10909 return most_specialized_instantiation (candidates);
10912 /* If DECL is a specialization of some template, return the most
10913 general such template. Otherwise, returns NULL_TREE.
10915 For example, given:
10917 template <class T> struct S { template <class U> void f(U); };
10919 if TMPL is `template <class U> void S<int>::f(U)' this will return
10920 the full template. This function will not trace past partial
10921 specializations, however. For example, given in addition:
10923 template <class T> struct S<T*> { template <class U> void f(U); };
10925 if TMPL is `template <class U> void S<int*>::f(U)' this will return
10926 `template <class T> template <class U> S<T*>::f(U)'. */
10929 most_general_template (tree decl)
10931 /* If DECL is a FUNCTION_DECL, find the TEMPLATE_DECL of which it is
10932 an immediate specialization. */
10933 if (TREE_CODE (decl) == FUNCTION_DECL)
10935 if (DECL_TEMPLATE_INFO (decl)) {
10936 decl = DECL_TI_TEMPLATE (decl);
10938 /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE for a
10939 template friend. */
10940 if (TREE_CODE (decl) != TEMPLATE_DECL)
10946 /* Look for more and more general templates. */
10947 while (DECL_TEMPLATE_INFO (decl))
10949 /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE in some cases.
10950 (See cp-tree.h for details.) */
10951 if (TREE_CODE (DECL_TI_TEMPLATE (decl)) != TEMPLATE_DECL)
10954 if (CLASS_TYPE_P (TREE_TYPE (decl))
10955 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl)))
10958 /* Stop if we run into an explicitly specialized class template. */
10959 if (!DECL_NAMESPACE_SCOPE_P (decl)
10960 && DECL_CONTEXT (decl)
10961 && CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (decl)))
10964 decl = DECL_TI_TEMPLATE (decl);
10970 /* Return the most specialized of the class template specializations
10971 of TMPL which can produce an instantiation matching ARGS, or
10972 error_mark_node if the choice is ambiguous. */
10975 most_specialized_class (tree tmpl, tree args)
10977 tree list = NULL_TREE;
10982 tmpl = most_general_template (tmpl);
10983 for (t = DECL_TEMPLATE_SPECIALIZATIONS (tmpl); t; t = TREE_CHAIN (t))
10986 = get_class_bindings (TREE_VALUE (t), TREE_PURPOSE (t), args);
10989 list = tree_cons (TREE_PURPOSE (t), TREE_VALUE (t), list);
10990 TREE_TYPE (list) = TREE_TYPE (t);
10999 t = TREE_CHAIN (t);
11000 for (; t; t = TREE_CHAIN (t))
11002 fate = more_specialized_class (champ, t, args);
11009 t = TREE_CHAIN (t);
11011 return error_mark_node;
11017 for (t = list; t && t != champ; t = TREE_CHAIN (t))
11019 fate = more_specialized_class (champ, t, args);
11021 return error_mark_node;
11027 /* Explicitly instantiate DECL. */
11030 do_decl_instantiation (tree decl, tree storage)
11032 tree result = NULL_TREE;
11036 /* An error occurred, for which grokdeclarator has already issued
11037 an appropriate message. */
11039 else if (! DECL_LANG_SPECIFIC (decl))
11041 error ("explicit instantiation of non-template %q#D", decl);
11044 else if (TREE_CODE (decl) == VAR_DECL)
11046 /* There is an asymmetry here in the way VAR_DECLs and
11047 FUNCTION_DECLs are handled by grokdeclarator. In the case of
11048 the latter, the DECL we get back will be marked as a
11049 template instantiation, and the appropriate
11050 DECL_TEMPLATE_INFO will be set up. This does not happen for
11051 VAR_DECLs so we do the lookup here. Probably, grokdeclarator
11052 should handle VAR_DECLs as it currently handles
11054 result = lookup_field (DECL_CONTEXT (decl), DECL_NAME (decl), 0, false);
11055 if (!result || TREE_CODE (result) != VAR_DECL)
11057 error ("no matching template for %qD found", decl);
11061 else if (TREE_CODE (decl) != FUNCTION_DECL)
11063 error ("explicit instantiation of %q#D", decl);
11069 /* Check for various error cases. Note that if the explicit
11070 instantiation is valid the RESULT will currently be marked as an
11071 *implicit* instantiation; DECL_EXPLICIT_INSTANTIATION is not set
11072 until we get here. */
11074 if (DECL_TEMPLATE_SPECIALIZATION (result))
11076 /* DR 259 [temp.spec].
11078 Both an explicit instantiation and a declaration of an explicit
11079 specialization shall not appear in a program unless the explicit
11080 instantiation follows a declaration of the explicit specialization.
11082 For a given set of template parameters, if an explicit
11083 instantiation of a template appears after a declaration of an
11084 explicit specialization for that template, the explicit
11085 instantiation has no effect. */
11088 else if (DECL_EXPLICIT_INSTANTIATION (result))
11092 No program shall explicitly instantiate any template more
11095 We check DECL_NOT_REALLY_EXTERN so as not to complain when
11096 the first instantiation was `extern' and the second is not,
11097 and EXTERN_P for the opposite case. */
11098 if (DECL_NOT_REALLY_EXTERN (result) && !extern_p)
11099 pedwarn ("duplicate explicit instantiation of %q#D", result);
11100 /* If an "extern" explicit instantiation follows an ordinary
11101 explicit instantiation, the template is instantiated. */
11105 else if (!DECL_IMPLICIT_INSTANTIATION (result))
11107 error ("no matching template for %qD found", result);
11110 else if (!DECL_TEMPLATE_INFO (result))
11112 pedwarn ("explicit instantiation of non-template %q#D", result);
11116 if (storage == NULL_TREE)
11118 else if (storage == ridpointers[(int) RID_EXTERN])
11120 if (pedantic && !in_system_header)
11121 pedwarn ("ISO C++ forbids the use of %<extern%> on explicit "
11126 error ("storage class %qD applied to template instantiation", storage);
11128 check_explicit_instantiation_namespace (result);
11129 mark_decl_instantiated (result, extern_p);
11131 instantiate_decl (result, /*defer_ok=*/1,
11132 /*expl_inst_class_mem_p=*/false);
11136 mark_class_instantiated (tree t, int extern_p)
11138 SET_CLASSTYPE_EXPLICIT_INSTANTIATION (t);
11139 SET_CLASSTYPE_INTERFACE_KNOWN (t);
11140 CLASSTYPE_INTERFACE_ONLY (t) = extern_p;
11141 TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (t)) = extern_p;
11144 CLASSTYPE_DEBUG_REQUESTED (t) = 1;
11145 rest_of_type_compilation (t, 1);
11149 /* Called from do_type_instantiation through binding_table_foreach to
11150 do recursive instantiation for the type bound in ENTRY. */
11152 bt_instantiate_type_proc (binding_entry entry, void *data)
11154 tree storage = *(tree *) data;
11156 if (IS_AGGR_TYPE (entry->type)
11157 && !uses_template_parms (CLASSTYPE_TI_ARGS (entry->type)))
11158 do_type_instantiation (TYPE_MAIN_DECL (entry->type), storage, 0);
11161 /* Called from do_type_instantiation to instantiate a member
11162 (a member function or a static member variable) of an
11163 explicitly instantiated class template. */
11165 instantiate_class_member (tree decl, int extern_p)
11167 mark_decl_instantiated (decl, extern_p);
11169 instantiate_decl (decl, /*defer_ok=*/1,
11170 /*expl_inst_class_mem_p=*/true);
11173 /* Perform an explicit instantiation of template class T. STORAGE, if
11174 non-null, is the RID for extern, inline or static. COMPLAIN is
11175 nonzero if this is called from the parser, zero if called recursively,
11176 since the standard is unclear (as detailed below). */
11179 do_type_instantiation (tree t, tree storage, tsubst_flags_t complain)
11184 int previous_instantiation_extern_p = 0;
11186 if (TREE_CODE (t) == TYPE_DECL)
11189 if (! CLASS_TYPE_P (t) || ! CLASSTYPE_TEMPLATE_INFO (t))
11191 error ("explicit instantiation of non-template type %qT", t);
11197 if (!COMPLETE_TYPE_P (t))
11199 if (complain & tf_error)
11200 error ("explicit instantiation of %q#T before definition of template",
11205 if (storage != NULL_TREE)
11207 if (pedantic && !in_system_header)
11208 pedwarn("ISO C++ forbids the use of %qE on explicit instantiations",
11211 if (storage == ridpointers[(int) RID_INLINE])
11213 else if (storage == ridpointers[(int) RID_EXTERN])
11215 else if (storage == ridpointers[(int) RID_STATIC])
11219 error ("storage class %qD applied to template instantiation",
11225 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (t))
11227 /* DR 259 [temp.spec].
11229 Both an explicit instantiation and a declaration of an explicit
11230 specialization shall not appear in a program unless the explicit
11231 instantiation follows a declaration of the explicit specialization.
11233 For a given set of template parameters, if an explicit
11234 instantiation of a template appears after a declaration of an
11235 explicit specialization for that template, the explicit
11236 instantiation has no effect. */
11239 else if (CLASSTYPE_EXPLICIT_INSTANTIATION (t))
11243 No program shall explicitly instantiate any template more
11246 If PREVIOUS_INSTANTIATION_EXTERN_P, then the first explicit
11247 instantiation was `extern'. If EXTERN_P then the second is.
11248 These cases are OK. */
11249 previous_instantiation_extern_p = CLASSTYPE_INTERFACE_ONLY (t);
11251 if (!previous_instantiation_extern_p && !extern_p
11252 && (complain & tf_error))
11253 pedwarn ("duplicate explicit instantiation of %q#T", t);
11255 /* If we've already instantiated the template, just return now. */
11256 if (!CLASSTYPE_INTERFACE_ONLY (t))
11260 check_explicit_instantiation_namespace (TYPE_NAME (t));
11261 mark_class_instantiated (t, extern_p);
11269 /* In contrast to implicit instantiation, where only the
11270 declarations, and not the definitions, of members are
11271 instantiated, we have here:
11275 The explicit instantiation of a class template specialization
11276 implies the instantiation of all of its members not
11277 previously explicitly specialized in the translation unit
11278 containing the explicit instantiation.
11280 Of course, we can't instantiate member template classes, since
11281 we don't have any arguments for them. Note that the standard
11282 is unclear on whether the instantiation of the members are
11283 *explicit* instantiations or not. However, the most natural
11284 interpretation is that it should be an explicit instantiation. */
11287 for (tmp = TYPE_METHODS (t); tmp; tmp = TREE_CHAIN (tmp))
11288 if (TREE_CODE (tmp) == FUNCTION_DECL
11289 && DECL_TEMPLATE_INSTANTIATION (tmp))
11290 instantiate_class_member (tmp, extern_p);
11292 for (tmp = TYPE_FIELDS (t); tmp; tmp = TREE_CHAIN (tmp))
11293 if (TREE_CODE (tmp) == VAR_DECL && DECL_TEMPLATE_INSTANTIATION (tmp))
11294 instantiate_class_member (tmp, extern_p);
11296 if (CLASSTYPE_NESTED_UTDS (t))
11297 binding_table_foreach (CLASSTYPE_NESTED_UTDS (t),
11298 bt_instantiate_type_proc, &storage);
11302 /* Given a function DECL, which is a specialization of TMPL, modify
11303 DECL to be a re-instantiation of TMPL with the same template
11304 arguments. TMPL should be the template into which tsubst'ing
11305 should occur for DECL, not the most general template.
11307 One reason for doing this is a scenario like this:
11310 void f(const T&, int i);
11312 void g() { f(3, 7); }
11315 void f(const T& t, const int i) { }
11317 Note that when the template is first instantiated, with
11318 instantiate_template, the resulting DECL will have no name for the
11319 first parameter, and the wrong type for the second. So, when we go
11320 to instantiate the DECL, we regenerate it. */
11323 regenerate_decl_from_template (tree decl, tree tmpl)
11325 /* The arguments used to instantiate DECL, from the most general
11330 args = DECL_TI_ARGS (decl);
11331 code_pattern = DECL_TEMPLATE_RESULT (tmpl);
11333 /* Make sure that we can see identifiers, and compute access
11335 push_access_scope (decl);
11337 if (TREE_CODE (decl) == FUNCTION_DECL)
11345 args_depth = TMPL_ARGS_DEPTH (args);
11346 parms_depth = TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl));
11347 if (args_depth > parms_depth)
11348 args = get_innermost_template_args (args, parms_depth);
11350 specs = tsubst_exception_specification (TREE_TYPE (code_pattern),
11351 args, tf_error, NULL_TREE);
11353 TREE_TYPE (decl) = build_exception_variant (TREE_TYPE (decl),
11356 /* Merge parameter declarations. */
11357 decl_parm = skip_artificial_parms_for (decl,
11358 DECL_ARGUMENTS (decl));
11360 = skip_artificial_parms_for (code_pattern,
11361 DECL_ARGUMENTS (code_pattern));
11367 if (DECL_NAME (decl_parm) != DECL_NAME (pattern_parm))
11368 DECL_NAME (decl_parm) = DECL_NAME (pattern_parm);
11369 parm_type = tsubst (TREE_TYPE (pattern_parm), args, tf_error,
11371 parm_type = type_decays_to (parm_type);
11372 if (!same_type_p (TREE_TYPE (decl_parm), parm_type))
11373 TREE_TYPE (decl_parm) = parm_type;
11374 attributes = DECL_ATTRIBUTES (pattern_parm);
11375 if (DECL_ATTRIBUTES (decl_parm) != attributes)
11377 DECL_ATTRIBUTES (decl_parm) = attributes;
11378 cplus_decl_attributes (&decl_parm, attributes, /*flags=*/0);
11380 decl_parm = TREE_CHAIN (decl_parm);
11381 pattern_parm = TREE_CHAIN (pattern_parm);
11384 /* Merge additional specifiers from the CODE_PATTERN. */
11385 if (DECL_DECLARED_INLINE_P (code_pattern)
11386 && !DECL_DECLARED_INLINE_P (decl))
11387 DECL_DECLARED_INLINE_P (decl) = 1;
11388 if (DECL_INLINE (code_pattern) && !DECL_INLINE (decl))
11389 DECL_INLINE (decl) = 1;
11391 else if (TREE_CODE (decl) == VAR_DECL)
11392 DECL_INITIAL (decl) =
11393 tsubst_expr (DECL_INITIAL (code_pattern), args,
11394 tf_error, DECL_TI_TEMPLATE (decl));
11396 gcc_unreachable ();
11398 pop_access_scope (decl);
11401 /* Return the TEMPLATE_DECL into which DECL_TI_ARGS(DECL) should be
11402 substituted to get DECL. */
11405 template_for_substitution (tree decl)
11407 tree tmpl = DECL_TI_TEMPLATE (decl);
11409 /* Set TMPL to the template whose DECL_TEMPLATE_RESULT is the pattern
11410 for the instantiation. This is not always the most general
11411 template. Consider, for example:
11414 struct S { template <class U> void f();
11415 template <> void f<int>(); };
11417 and an instantiation of S<double>::f<int>. We want TD to be the
11418 specialization S<T>::f<int>, not the more general S<T>::f<U>. */
11419 while (/* An instantiation cannot have a definition, so we need a
11420 more general template. */
11421 DECL_TEMPLATE_INSTANTIATION (tmpl)
11422 /* We must also deal with friend templates. Given:
11424 template <class T> struct S {
11425 template <class U> friend void f() {};
11428 S<int>::f<U> say, is not an instantiation of S<T>::f<U>,
11429 so far as the language is concerned, but that's still
11430 where we get the pattern for the instantiation from. On
11431 other hand, if the definition comes outside the class, say:
11433 template <class T> struct S {
11434 template <class U> friend void f();
11436 template <class U> friend void f() {}
11438 we don't need to look any further. That's what the check for
11439 DECL_INITIAL is for. */
11440 || (TREE_CODE (decl) == FUNCTION_DECL
11441 && DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (tmpl)
11442 && !DECL_INITIAL (DECL_TEMPLATE_RESULT (tmpl))))
11444 /* The present template, TD, should not be a definition. If it
11445 were a definition, we should be using it! Note that we
11446 cannot restructure the loop to just keep going until we find
11447 a template with a definition, since that might go too far if
11448 a specialization was declared, but not defined. */
11449 gcc_assert (TREE_CODE (decl) != VAR_DECL
11450 || DECL_IN_AGGR_P (DECL_TEMPLATE_RESULT (tmpl)));
11452 /* Fetch the more general template. */
11453 tmpl = DECL_TI_TEMPLATE (tmpl);
11459 /* Produce the definition of D, a _DECL generated from a template. If
11460 DEFER_OK is nonzero, then we don't have to actually do the
11461 instantiation now; we just have to do it sometime. Normally it is
11462 an error if this is an explicit instantiation but D is undefined.
11463 EXPL_INST_CLASS_MEM_P is true iff D is a member of an
11464 explicitly instantiated class template. */
11467 instantiate_decl (tree d, int defer_ok,
11468 bool expl_inst_class_mem_p)
11470 tree tmpl = DECL_TI_TEMPLATE (d);
11477 bool pattern_defined;
11479 location_t saved_loc = input_location;
11482 /* This function should only be used to instantiate templates for
11483 functions and static member variables. */
11484 gcc_assert (TREE_CODE (d) == FUNCTION_DECL
11485 || TREE_CODE (d) == VAR_DECL);
11487 /* Variables are never deferred; if instantiation is required, they
11488 are instantiated right away. That allows for better code in the
11489 case that an expression refers to the value of the variable --
11490 if the variable has a constant value the referring expression can
11491 take advantage of that fact. */
11492 if (TREE_CODE (d) == VAR_DECL)
11495 /* Don't instantiate cloned functions. Instead, instantiate the
11496 functions they cloned. */
11497 if (TREE_CODE (d) == FUNCTION_DECL && DECL_CLONED_FUNCTION_P (d))
11498 d = DECL_CLONED_FUNCTION (d);
11500 if (DECL_TEMPLATE_INSTANTIATED (d))
11501 /* D has already been instantiated. It might seem reasonable to
11502 check whether or not D is an explicit instantiation, and, if so,
11503 stop here. But when an explicit instantiation is deferred
11504 until the end of the compilation, DECL_EXPLICIT_INSTANTIATION
11505 is set, even though we still need to do the instantiation. */
11508 /* If we already have a specialization of this declaration, then
11509 there's no reason to instantiate it. Note that
11510 retrieve_specialization gives us both instantiations and
11511 specializations, so we must explicitly check
11512 DECL_TEMPLATE_SPECIALIZATION. */
11513 gen_tmpl = most_general_template (tmpl);
11514 gen_args = DECL_TI_ARGS (d);
11515 spec = retrieve_specialization (gen_tmpl, gen_args,
11516 /*class_specializations_p=*/false);
11517 if (spec != NULL_TREE && DECL_TEMPLATE_SPECIALIZATION (spec))
11520 /* This needs to happen before any tsubsting. */
11521 if (! push_tinst_level (d))
11524 timevar_push (TV_PARSE);
11526 /* Set TD to the template whose DECL_TEMPLATE_RESULT is the pattern
11527 for the instantiation. */
11528 td = template_for_substitution (d);
11529 code_pattern = DECL_TEMPLATE_RESULT (td);
11531 /* We should never be trying to instantiate a member of a class
11532 template or partial specialization. */
11533 gcc_assert (d != code_pattern);
11535 if ((DECL_NAMESPACE_SCOPE_P (d) && !DECL_INITIALIZED_IN_CLASS_P (d))
11536 || DECL_TEMPLATE_SPECIALIZATION (td))
11537 /* In the case of a friend template whose definition is provided
11538 outside the class, we may have too many arguments. Drop the
11539 ones we don't need. The same is true for specializations. */
11540 args = get_innermost_template_args
11541 (gen_args, TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (td)));
11545 if (TREE_CODE (d) == FUNCTION_DECL)
11546 pattern_defined = (DECL_SAVED_TREE (code_pattern) != NULL_TREE);
11548 pattern_defined = ! DECL_IN_AGGR_P (code_pattern);
11550 /* We may be in the middle of deferred access check. Disable it now. */
11551 push_deferring_access_checks (dk_no_deferred);
11553 /* Unless an explicit instantiation directive has already determined
11554 the linkage of D, remember that a definition is available for
11556 if (pattern_defined
11557 && !DECL_INTERFACE_KNOWN (d)
11558 && !DECL_NOT_REALLY_EXTERN (d))
11559 mark_definable (d);
11561 input_location = DECL_SOURCE_LOCATION (d);
11563 /* If D is a member of an explicitly instantiated class template,
11564 and no definition is available, treat it like an implicit
11566 if (!pattern_defined && expl_inst_class_mem_p
11567 && DECL_EXPLICIT_INSTANTIATION (d))
11569 DECL_NOT_REALLY_EXTERN (d) = 0;
11570 DECL_INTERFACE_KNOWN (d) = 0;
11571 SET_DECL_IMPLICIT_INSTANTIATION (d);
11576 /* Recheck the substitutions to obtain any warning messages
11577 about ignoring cv qualifiers. */
11578 tree gen = DECL_TEMPLATE_RESULT (gen_tmpl);
11579 tree type = TREE_TYPE (gen);
11581 /* Make sure that we can see identifiers, and compute access
11582 correctly. D is already the target FUNCTION_DECL with the
11584 push_access_scope (d);
11586 if (TREE_CODE (gen) == FUNCTION_DECL)
11588 tsubst (DECL_ARGUMENTS (gen), gen_args, tf_error | tf_warning, d);
11589 tsubst (TYPE_RAISES_EXCEPTIONS (type), gen_args,
11590 tf_error | tf_warning, d);
11591 /* Don't simply tsubst the function type, as that will give
11592 duplicate warnings about poor parameter qualifications.
11593 The function arguments are the same as the decl_arguments
11594 without the top level cv qualifiers. */
11595 type = TREE_TYPE (type);
11597 tsubst (type, gen_args, tf_error | tf_warning, d);
11599 pop_access_scope (d);
11602 /* Check to see whether we know that this template will be
11603 instantiated in some other file, as with "extern template"
11605 external_p = (DECL_INTERFACE_KNOWN (d) && DECL_REALLY_EXTERN (d));
11606 /* In general, we do not instantiate such templates... */
11608 /* ... but we instantiate inline functions so that we can inline
11610 && ! (TREE_CODE (d) == FUNCTION_DECL && DECL_INLINE (d))
11611 /* ... we instantiate static data members whose values are
11612 needed in integral constant expressions. */
11613 && ! (TREE_CODE (d) == VAR_DECL
11614 && DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (d)))
11616 /* Defer all other templates, unless we have been explicitly
11617 forbidden from doing so. */
11618 if (/* If there is no definition, we cannot instantiate the
11621 /* If it's OK to postpone instantiation, do so. */
11623 /* If this is a static data member that will be defined
11624 elsewhere, we don't want to instantiate the entire data
11625 member, but we do want to instantiate the initializer so that
11626 we can substitute that elsewhere. */
11627 || (external_p && TREE_CODE (d) == VAR_DECL))
11629 /* The definition of the static data member is now required so
11630 we must substitute the initializer. */
11631 if (TREE_CODE (d) == VAR_DECL
11632 && !DECL_INITIAL (d)
11633 && DECL_INITIAL (code_pattern))
11638 ns = decl_namespace_context (d);
11639 push_nested_namespace (ns);
11640 push_nested_class (DECL_CONTEXT (d));
11641 init = tsubst_expr (DECL_INITIAL (code_pattern),
11643 tf_error | tf_warning, NULL_TREE);
11644 DECL_INITIAL (d) = init;
11645 cp_finish_decl (d, init, /*asmspec_tree=*/NULL_TREE,
11646 LOOKUP_ONLYCONVERTING);
11647 pop_nested_class ();
11648 pop_nested_namespace (ns);
11651 /* We restore the source position here because it's used by
11652 add_pending_template. */
11653 input_location = saved_loc;
11655 if (at_eof && !pattern_defined
11656 && DECL_EXPLICIT_INSTANTIATION (d))
11659 The definition of a non-exported function template, a
11660 non-exported member function template, or a non-exported
11661 member function or static data member of a class template
11662 shall be present in every translation unit in which it is
11663 explicitly instantiated. */
11665 ("explicit instantiation of %qD but no definition available", d);
11667 /* ??? Historically, we have instantiated inline functions, even
11668 when marked as "extern template". */
11669 if (!(external_p && TREE_CODE (d) == VAR_DECL))
11670 add_pending_template (d);
11673 /* Tell the repository that D is available in this translation unit
11674 -- and see if it is supposed to be instantiated here. */
11675 if (TREE_PUBLIC (d) && !DECL_REALLY_EXTERN (d) && !repo_emit_p (d))
11677 /* In a PCH file, despite the fact that the repository hasn't
11678 requested instantiation in the PCH it is still possible that
11679 an instantiation will be required in a file that includes the
11682 add_pending_template (d);
11683 /* Instantiate inline functions so that the inliner can do its
11684 job, even though we'll not be emitting a copy of this
11686 if (!(TREE_CODE (d) == FUNCTION_DECL
11687 && flag_inline_trees
11688 && DECL_DECLARED_INLINE_P (d)))
11692 need_push = !cfun || !global_bindings_p ();
11694 push_to_top_level ();
11696 /* Mark D as instantiated so that recursive calls to
11697 instantiate_decl do not try to instantiate it again. */
11698 DECL_TEMPLATE_INSTANTIATED (d) = 1;
11700 /* Regenerate the declaration in case the template has been modified
11701 by a subsequent redeclaration. */
11702 regenerate_decl_from_template (d, td);
11704 /* We already set the file and line above. Reset them now in case
11705 they changed as a result of calling regenerate_decl_from_template. */
11706 input_location = DECL_SOURCE_LOCATION (d);
11708 if (TREE_CODE (d) == VAR_DECL)
11710 /* Clear out DECL_RTL; whatever was there before may not be right
11711 since we've reset the type of the declaration. */
11712 SET_DECL_RTL (d, NULL_RTX);
11713 DECL_IN_AGGR_P (d) = 0;
11715 /* Clear DECL_EXTERNAL so that cp_finish_decl will process the
11716 initializer. That function will defer actual emission until
11717 we have a chance to determine linkage. */
11718 DECL_EXTERNAL (d) = 0;
11720 /* Enter the scope of D so that access-checking works correctly. */
11721 push_nested_class (DECL_CONTEXT (d));
11722 cp_finish_decl (d, DECL_INITIAL (d), NULL_TREE, 0);
11723 pop_nested_class ();
11725 else if (TREE_CODE (d) == FUNCTION_DECL)
11727 htab_t saved_local_specializations;
11732 /* Save away the current list, in case we are instantiating one
11733 template from within the body of another. */
11734 saved_local_specializations = local_specializations;
11736 /* Set up the list of local specializations. */
11737 local_specializations = htab_create (37,
11738 hash_local_specialization,
11739 eq_local_specializations,
11742 /* Set up context. */
11743 start_preparsed_function (d, NULL_TREE, SF_PRE_PARSED);
11745 /* Create substitution entries for the parameters. */
11746 subst_decl = DECL_TEMPLATE_RESULT (template_for_substitution (d));
11747 tmpl_parm = DECL_ARGUMENTS (subst_decl);
11748 spec_parm = DECL_ARGUMENTS (d);
11749 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (d))
11751 register_local_specialization (spec_parm, tmpl_parm);
11752 spec_parm = skip_artificial_parms_for (d, spec_parm);
11753 tmpl_parm = skip_artificial_parms_for (subst_decl, tmpl_parm);
11757 register_local_specialization (spec_parm, tmpl_parm);
11758 tmpl_parm = TREE_CHAIN (tmpl_parm);
11759 spec_parm = TREE_CHAIN (spec_parm);
11761 gcc_assert (!spec_parm);
11763 /* Substitute into the body of the function. */
11764 tsubst_expr (DECL_SAVED_TREE (code_pattern), args,
11765 tf_error | tf_warning, tmpl);
11767 /* We don't need the local specializations any more. */
11768 htab_delete (local_specializations);
11769 local_specializations = saved_local_specializations;
11771 /* Finish the function. */
11772 d = finish_function (0);
11773 expand_or_defer_fn (d);
11776 /* We're not deferring instantiation any more. */
11777 TI_PENDING_TEMPLATE_FLAG (DECL_TEMPLATE_INFO (d)) = 0;
11780 pop_from_top_level ();
11783 input_location = saved_loc;
11784 pop_deferring_access_checks ();
11785 pop_tinst_level ();
11787 timevar_pop (TV_PARSE);
11792 /* Run through the list of templates that we wish we could
11793 instantiate, and instantiate any we can. RETRIES is the
11794 number of times we retry pending template instantiation. */
11797 instantiate_pending_templates (int retries)
11800 tree last = NULL_TREE;
11802 location_t saved_loc = input_location;
11803 int saved_in_system_header = in_system_header;
11805 /* Instantiating templates may trigger vtable generation. This in turn
11806 may require further template instantiations. We place a limit here
11807 to avoid infinite loop. */
11808 if (pending_templates && retries >= max_tinst_depth)
11810 tree decl = TREE_VALUE (pending_templates);
11812 error ("template instantiation depth exceeds maximum of %d"
11813 " instantiating %q+D, possibly from virtual table generation"
11814 " (use -ftemplate-depth-NN to increase the maximum)",
11815 max_tinst_depth, decl);
11816 if (TREE_CODE (decl) == FUNCTION_DECL)
11817 /* Pretend that we defined it. */
11818 DECL_INITIAL (decl) = error_mark_node;
11826 t = &pending_templates;
11829 tree instantiation = TREE_VALUE (*t);
11831 reopen_tinst_level (TREE_PURPOSE (*t));
11833 if (TYPE_P (instantiation))
11837 if (!COMPLETE_TYPE_P (instantiation))
11839 instantiate_class_template (instantiation);
11840 if (CLASSTYPE_TEMPLATE_INSTANTIATION (instantiation))
11841 for (fn = TYPE_METHODS (instantiation);
11843 fn = TREE_CHAIN (fn))
11844 if (! DECL_ARTIFICIAL (fn))
11845 instantiate_decl (fn,
11847 /*expl_inst_class_mem_p=*/false);
11848 if (COMPLETE_TYPE_P (instantiation))
11852 if (COMPLETE_TYPE_P (instantiation))
11853 /* If INSTANTIATION has been instantiated, then we don't
11854 need to consider it again in the future. */
11855 *t = TREE_CHAIN (*t);
11859 t = &TREE_CHAIN (*t);
11864 if (!DECL_TEMPLATE_SPECIALIZATION (instantiation)
11865 && !DECL_TEMPLATE_INSTANTIATED (instantiation))
11868 = instantiate_decl (instantiation,
11870 /*expl_inst_class_mem_p=*/false);
11871 if (DECL_TEMPLATE_INSTANTIATED (instantiation))
11875 if (DECL_TEMPLATE_SPECIALIZATION (instantiation)
11876 || DECL_TEMPLATE_INSTANTIATED (instantiation))
11877 /* If INSTANTIATION has been instantiated, then we don't
11878 need to consider it again in the future. */
11879 *t = TREE_CHAIN (*t);
11883 t = &TREE_CHAIN (*t);
11887 current_tinst_level = NULL_TREE;
11889 last_pending_template = last;
11891 while (reconsider);
11893 input_location = saved_loc;
11894 in_system_header = saved_in_system_header;
11897 /* Substitute ARGVEC into T, which is a list of initializers for
11898 either base class or a non-static data member. The TREE_PURPOSEs
11899 are DECLs, and the TREE_VALUEs are the initializer values. Used by
11900 instantiate_decl. */
11903 tsubst_initializer_list (tree t, tree argvec)
11905 tree inits = NULL_TREE;
11907 for (; t; t = TREE_CHAIN (t))
11912 decl = tsubst_copy (TREE_PURPOSE (t), argvec, tf_error | tf_warning,
11914 decl = expand_member_init (decl);
11915 if (decl && !DECL_P (decl))
11916 in_base_initializer = 1;
11918 init = tsubst_expr (TREE_VALUE (t), argvec, tf_error | tf_warning,
11920 in_base_initializer = 0;
11924 init = build_tree_list (decl, init);
11925 TREE_CHAIN (init) = inits;
11932 /* Set CURRENT_ACCESS_SPECIFIER based on the protection of DECL. */
11935 set_current_access_from_decl (tree decl)
11937 if (TREE_PRIVATE (decl))
11938 current_access_specifier = access_private_node;
11939 else if (TREE_PROTECTED (decl))
11940 current_access_specifier = access_protected_node;
11942 current_access_specifier = access_public_node;
11945 /* Instantiate an enumerated type. TAG is the template type, NEWTAG
11946 is the instantiation (which should have been created with
11947 start_enum) and ARGS are the template arguments to use. */
11950 tsubst_enum (tree tag, tree newtag, tree args)
11954 for (e = TYPE_VALUES (tag); e; e = TREE_CHAIN (e))
11959 decl = TREE_VALUE (e);
11960 /* Note that in a template enum, the TREE_VALUE is the
11961 CONST_DECL, not the corresponding INTEGER_CST. */
11962 value = tsubst_expr (DECL_INITIAL (decl),
11963 args, tf_error | tf_warning,
11966 /* Give this enumeration constant the correct access. */
11967 set_current_access_from_decl (decl);
11969 /* Actually build the enumerator itself. */
11970 build_enumerator (DECL_NAME (decl), value, newtag);
11973 finish_enum (newtag);
11974 DECL_SOURCE_LOCATION (TYPE_NAME (newtag))
11975 = DECL_SOURCE_LOCATION (TYPE_NAME (tag));
11978 /* DECL is a FUNCTION_DECL that is a template specialization. Return
11979 its type -- but without substituting the innermost set of template
11980 arguments. So, innermost set of template parameters will appear in
11984 get_mostly_instantiated_function_type (tree decl)
11992 tmpl = most_general_template (DECL_TI_TEMPLATE (decl));
11993 targs = DECL_TI_ARGS (decl);
11994 tparms = DECL_TEMPLATE_PARMS (tmpl);
11995 parm_depth = TMPL_PARMS_DEPTH (tparms);
11997 /* There should be as many levels of arguments as there are levels
11999 gcc_assert (parm_depth == TMPL_ARGS_DEPTH (targs));
12001 fn_type = TREE_TYPE (tmpl);
12003 if (parm_depth == 1)
12004 /* No substitution is necessary. */
12008 int i, save_access_control;
12011 /* Replace the innermost level of the TARGS with NULL_TREEs to
12012 let tsubst know not to substitute for those parameters. */
12013 partial_args = make_tree_vec (TREE_VEC_LENGTH (targs));
12014 for (i = 1; i < TMPL_ARGS_DEPTH (targs); ++i)
12015 SET_TMPL_ARGS_LEVEL (partial_args, i,
12016 TMPL_ARGS_LEVEL (targs, i));
12017 SET_TMPL_ARGS_LEVEL (partial_args,
12018 TMPL_ARGS_DEPTH (targs),
12019 make_tree_vec (DECL_NTPARMS (tmpl)));
12021 /* Disable access control as this function is used only during
12023 save_access_control = flag_access_control;
12024 flag_access_control = 0;
12026 ++processing_template_decl;
12027 /* Now, do the (partial) substitution to figure out the
12028 appropriate function type. */
12029 fn_type = tsubst (fn_type, partial_args, tf_error, NULL_TREE);
12030 --processing_template_decl;
12032 /* Substitute into the template parameters to obtain the real
12033 innermost set of parameters. This step is important if the
12034 innermost set of template parameters contains value
12035 parameters whose types depend on outer template parameters. */
12036 TREE_VEC_LENGTH (partial_args)--;
12037 tparms = tsubst_template_parms (tparms, partial_args, tf_error);
12039 flag_access_control = save_access_control;
12045 /* Return truthvalue if we're processing a template different from
12046 the last one involved in diagnostics. */
12048 problematic_instantiation_changed (void)
12050 return last_template_error_tick != tinst_level_tick;
12053 /* Remember current template involved in diagnostics. */
12055 record_last_problematic_instantiation (void)
12057 last_template_error_tick = tinst_level_tick;
12061 current_instantiation (void)
12063 return current_tinst_level;
12066 /* [temp.param] Check that template non-type parm TYPE is of an allowable
12067 type. Return zero for ok, nonzero for disallowed. Issue error and
12068 warning messages under control of COMPLAIN. */
12071 invalid_nontype_parm_type_p (tree type, tsubst_flags_t complain)
12073 if (INTEGRAL_TYPE_P (type))
12075 else if (POINTER_TYPE_P (type))
12077 else if (TYPE_PTR_TO_MEMBER_P (type))
12079 else if (TREE_CODE (type) == TEMPLATE_TYPE_PARM)
12081 else if (TREE_CODE (type) == TYPENAME_TYPE)
12084 if (complain & tf_error)
12085 error ("%q#T is not a valid type for a template constant parameter", type);
12089 /* Returns TRUE if TYPE is dependent, in the sense of [temp.dep.type].
12090 Assumes that TYPE really is a type, and not the ERROR_MARK_NODE.*/
12093 dependent_type_p_r (tree type)
12099 A type is dependent if it is:
12101 -- a template parameter. Template template parameters are types
12102 for us (since TYPE_P holds true for them) so we handle
12104 if (TREE_CODE (type) == TEMPLATE_TYPE_PARM
12105 || TREE_CODE (type) == TEMPLATE_TEMPLATE_PARM)
12107 /* -- a qualified-id with a nested-name-specifier which contains a
12108 class-name that names a dependent type or whose unqualified-id
12109 names a dependent type. */
12110 if (TREE_CODE (type) == TYPENAME_TYPE)
12112 /* -- a cv-qualified type where the cv-unqualified type is
12114 type = TYPE_MAIN_VARIANT (type);
12115 /* -- a compound type constructed from any dependent type. */
12116 if (TYPE_PTR_TO_MEMBER_P (type))
12117 return (dependent_type_p (TYPE_PTRMEM_CLASS_TYPE (type))
12118 || dependent_type_p (TYPE_PTRMEM_POINTED_TO_TYPE
12120 else if (TREE_CODE (type) == POINTER_TYPE
12121 || TREE_CODE (type) == REFERENCE_TYPE)
12122 return dependent_type_p (TREE_TYPE (type));
12123 else if (TREE_CODE (type) == FUNCTION_TYPE
12124 || TREE_CODE (type) == METHOD_TYPE)
12128 if (dependent_type_p (TREE_TYPE (type)))
12130 for (arg_type = TYPE_ARG_TYPES (type);
12132 arg_type = TREE_CHAIN (arg_type))
12133 if (dependent_type_p (TREE_VALUE (arg_type)))
12137 /* -- an array type constructed from any dependent type or whose
12138 size is specified by a constant expression that is
12139 value-dependent. */
12140 if (TREE_CODE (type) == ARRAY_TYPE)
12142 if (TYPE_DOMAIN (type)
12143 && ((value_dependent_expression_p
12144 (TYPE_MAX_VALUE (TYPE_DOMAIN (type))))
12145 || (type_dependent_expression_p
12146 (TYPE_MAX_VALUE (TYPE_DOMAIN (type))))))
12148 return dependent_type_p (TREE_TYPE (type));
12151 /* -- a template-id in which either the template name is a template
12153 if (TREE_CODE (type) == BOUND_TEMPLATE_TEMPLATE_PARM)
12155 /* ... or any of the template arguments is a dependent type or
12156 an expression that is type-dependent or value-dependent. */
12157 else if (CLASS_TYPE_P (type) && CLASSTYPE_TEMPLATE_INFO (type)
12158 && (any_dependent_template_arguments_p
12159 (INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type)))))
12162 /* All TYPEOF_TYPEs are dependent; if the argument of the `typeof'
12163 expression is not type-dependent, then it should already been
12165 if (TREE_CODE (type) == TYPEOF_TYPE)
12168 /* The standard does not specifically mention types that are local
12169 to template functions or local classes, but they should be
12170 considered dependent too. For example:
12172 template <int I> void f() {
12177 The size of `E' cannot be known until the value of `I' has been
12178 determined. Therefore, `E' must be considered dependent. */
12179 scope = TYPE_CONTEXT (type);
12180 if (scope && TYPE_P (scope))
12181 return dependent_type_p (scope);
12182 else if (scope && TREE_CODE (scope) == FUNCTION_DECL)
12183 return type_dependent_expression_p (scope);
12185 /* Other types are non-dependent. */
12189 /* Returns TRUE if TYPE is dependent, in the sense of
12190 [temp.dep.type]. */
12193 dependent_type_p (tree type)
12195 /* If there are no template parameters in scope, then there can't be
12196 any dependent types. */
12197 if (!processing_template_decl)
12200 /* If the type is NULL, we have not computed a type for the entity
12201 in question; in that case, the type is dependent. */
12205 /* Erroneous types can be considered non-dependent. */
12206 if (type == error_mark_node)
12209 /* If we have not already computed the appropriate value for TYPE,
12211 if (!TYPE_DEPENDENT_P_VALID (type))
12213 TYPE_DEPENDENT_P (type) = dependent_type_p_r (type);
12214 TYPE_DEPENDENT_P_VALID (type) = 1;
12217 return TYPE_DEPENDENT_P (type);
12220 /* Returns TRUE if EXPRESSION is dependent, according to CRITERION. */
12223 dependent_scope_ref_p (tree expression, bool criterion (tree))
12228 gcc_assert (TREE_CODE (expression) == SCOPE_REF);
12230 if (!TYPE_P (TREE_OPERAND (expression, 0)))
12233 scope = TREE_OPERAND (expression, 0);
12234 name = TREE_OPERAND (expression, 1);
12238 An id-expression is type-dependent if it contains a
12239 nested-name-specifier that contains a class-name that names a
12241 /* The suggested resolution to Core Issue 2 implies that if the
12242 qualifying type is the current class, then we must peek
12245 && currently_open_class (scope)
12246 && !criterion (name))
12248 if (dependent_type_p (scope))
12254 /* Returns TRUE if the EXPRESSION is value-dependent, in the sense of
12255 [temp.dep.constexpr] */
12258 value_dependent_expression_p (tree expression)
12260 if (!processing_template_decl)
12263 /* A name declared with a dependent type. */
12264 if (DECL_P (expression) && type_dependent_expression_p (expression))
12267 switch (TREE_CODE (expression))
12269 case IDENTIFIER_NODE:
12270 /* A name that has not been looked up -- must be dependent. */
12273 case TEMPLATE_PARM_INDEX:
12274 /* A non-type template parm. */
12278 /* A non-type template parm. */
12279 if (DECL_TEMPLATE_PARM_P (expression))
12284 /* A constant with integral or enumeration type and is initialized
12285 with an expression that is value-dependent. */
12286 if (DECL_INITIAL (expression)
12287 && INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (expression))
12288 && value_dependent_expression_p (DECL_INITIAL (expression)))
12292 case DYNAMIC_CAST_EXPR:
12293 case STATIC_CAST_EXPR:
12294 case CONST_CAST_EXPR:
12295 case REINTERPRET_CAST_EXPR:
12297 /* These expressions are value-dependent if the type to which
12298 the cast occurs is dependent or the expression being casted
12299 is value-dependent. */
12301 tree type = TREE_TYPE (expression);
12303 if (dependent_type_p (type))
12306 /* A functional cast has a list of operands. */
12307 expression = TREE_OPERAND (expression, 0);
12310 /* If there are no operands, it must be an expression such
12311 as "int()". This should not happen for aggregate types
12312 because it would form non-constant expressions. */
12313 gcc_assert (INTEGRAL_OR_ENUMERATION_TYPE_P (type));
12318 if (TREE_CODE (expression) == TREE_LIST)
12320 for (; expression; expression = TREE_CHAIN (expression))
12321 if (value_dependent_expression_p (TREE_VALUE (expression)))
12326 return value_dependent_expression_p (expression);
12331 /* A `sizeof' expression is value-dependent if the operand is
12333 expression = TREE_OPERAND (expression, 0);
12334 if (TYPE_P (expression))
12335 return dependent_type_p (expression);
12336 return type_dependent_expression_p (expression);
12339 return dependent_scope_ref_p (expression, value_dependent_expression_p);
12341 case COMPONENT_REF:
12342 return (value_dependent_expression_p (TREE_OPERAND (expression, 0))
12343 || value_dependent_expression_p (TREE_OPERAND (expression, 1)));
12346 /* A CALL_EXPR is value-dependent if any argument is
12347 value-dependent. Why do we have to handle CALL_EXPRs in this
12348 function at all? First, some function calls, those for which
12349 value_dependent_expression_p is true, man appear in constant
12350 expressions. Second, there appear to be bugs which result in
12351 other CALL_EXPRs reaching this point. */
12353 tree function = TREE_OPERAND (expression, 0);
12354 tree args = TREE_OPERAND (expression, 1);
12356 if (value_dependent_expression_p (function))
12362 if (TREE_CODE (args) == TREE_LIST)
12364 for (; args; args = TREE_CHAIN (args))
12365 if (value_dependent_expression_p (TREE_VALUE (args)))
12370 return value_dependent_expression_p (args);
12374 /* A constant expression is value-dependent if any subexpression is
12375 value-dependent. */
12376 switch (TREE_CODE_CLASS (TREE_CODE (expression)))
12378 case tcc_reference:
12380 return (value_dependent_expression_p
12381 (TREE_OPERAND (expression, 0)));
12383 case tcc_comparison:
12385 return ((value_dependent_expression_p
12386 (TREE_OPERAND (expression, 0)))
12387 || (value_dependent_expression_p
12388 (TREE_OPERAND (expression, 1))));
12390 case tcc_expression:
12393 for (i = 0; i < TREE_CODE_LENGTH (TREE_CODE (expression)); ++i)
12394 /* In some cases, some of the operands may be missing.
12395 (For example, in the case of PREDECREMENT_EXPR, the
12396 amount to increment by may be missing.) That doesn't
12397 make the expression dependent. */
12398 if (TREE_OPERAND (expression, i)
12399 && (value_dependent_expression_p
12400 (TREE_OPERAND (expression, i))))
12410 /* The expression is not value-dependent. */
12414 /* Returns TRUE if the EXPRESSION is type-dependent, in the sense of
12415 [temp.dep.expr]. */
12418 type_dependent_expression_p (tree expression)
12420 if (!processing_template_decl)
12423 if (expression == error_mark_node)
12426 /* An unresolved name is always dependent. */
12427 if (TREE_CODE (expression) == IDENTIFIER_NODE)
12430 /* Some expression forms are never type-dependent. */
12431 if (TREE_CODE (expression) == PSEUDO_DTOR_EXPR
12432 || TREE_CODE (expression) == SIZEOF_EXPR
12433 || TREE_CODE (expression) == ALIGNOF_EXPR
12434 || TREE_CODE (expression) == TYPEID_EXPR
12435 || TREE_CODE (expression) == DELETE_EXPR
12436 || TREE_CODE (expression) == VEC_DELETE_EXPR
12437 || TREE_CODE (expression) == THROW_EXPR)
12440 /* The types of these expressions depends only on the type to which
12441 the cast occurs. */
12442 if (TREE_CODE (expression) == DYNAMIC_CAST_EXPR
12443 || TREE_CODE (expression) == STATIC_CAST_EXPR
12444 || TREE_CODE (expression) == CONST_CAST_EXPR
12445 || TREE_CODE (expression) == REINTERPRET_CAST_EXPR
12446 || TREE_CODE (expression) == CAST_EXPR)
12447 return dependent_type_p (TREE_TYPE (expression));
12449 /* The types of these expressions depends only on the type created
12450 by the expression. */
12451 if (TREE_CODE (expression) == NEW_EXPR
12452 || TREE_CODE (expression) == VEC_NEW_EXPR)
12454 /* For NEW_EXPR tree nodes created inside a template, either
12455 the object type itself or a TREE_LIST may appear as the
12457 tree type = TREE_OPERAND (expression, 1);
12458 if (TREE_CODE (type) == TREE_LIST)
12459 /* This is an array type. We need to check array dimensions
12461 return dependent_type_p (TREE_VALUE (TREE_PURPOSE (type)))
12462 || value_dependent_expression_p
12463 (TREE_OPERAND (TREE_VALUE (type), 1));
12465 return dependent_type_p (type);
12468 if (TREE_CODE (expression) == SCOPE_REF
12469 && dependent_scope_ref_p (expression,
12470 type_dependent_expression_p))
12473 if (TREE_CODE (expression) == FUNCTION_DECL
12474 && DECL_LANG_SPECIFIC (expression)
12475 && DECL_TEMPLATE_INFO (expression)
12476 && (any_dependent_template_arguments_p
12477 (INNERMOST_TEMPLATE_ARGS (DECL_TI_ARGS (expression)))))
12480 if (TREE_CODE (expression) == TEMPLATE_DECL
12481 && !DECL_TEMPLATE_TEMPLATE_PARM_P (expression))
12484 if (TREE_TYPE (expression) == unknown_type_node)
12486 if (TREE_CODE (expression) == ADDR_EXPR)
12487 return type_dependent_expression_p (TREE_OPERAND (expression, 0));
12488 if (TREE_CODE (expression) == COMPONENT_REF
12489 || TREE_CODE (expression) == OFFSET_REF)
12491 if (type_dependent_expression_p (TREE_OPERAND (expression, 0)))
12493 expression = TREE_OPERAND (expression, 1);
12494 if (TREE_CODE (expression) == IDENTIFIER_NODE)
12497 /* SCOPE_REF with non-null TREE_TYPE is always non-dependent. */
12498 if (TREE_CODE (expression) == SCOPE_REF)
12501 if (TREE_CODE (expression) == BASELINK)
12502 expression = BASELINK_FUNCTIONS (expression);
12504 if (TREE_CODE (expression) == TEMPLATE_ID_EXPR)
12506 if (any_dependent_template_arguments_p
12507 (TREE_OPERAND (expression, 1)))
12509 expression = TREE_OPERAND (expression, 0);
12511 gcc_assert (TREE_CODE (expression) == OVERLOAD
12512 || TREE_CODE (expression) == FUNCTION_DECL);
12516 if (type_dependent_expression_p (OVL_CURRENT (expression)))
12518 expression = OVL_NEXT (expression);
12523 gcc_assert (TREE_CODE (expression) != TYPE_DECL);
12525 return (dependent_type_p (TREE_TYPE (expression)));
12528 /* Returns TRUE if ARGS (a TREE_LIST of arguments to a function call)
12529 contains a type-dependent expression. */
12532 any_type_dependent_arguments_p (tree args)
12536 tree arg = TREE_VALUE (args);
12538 if (type_dependent_expression_p (arg))
12540 args = TREE_CHAIN (args);
12545 /* Returns TRUE if the ARG (a template argument) is dependent. */
12548 dependent_template_arg_p (tree arg)
12550 if (!processing_template_decl)
12553 if (TREE_CODE (arg) == TEMPLATE_DECL
12554 || TREE_CODE (arg) == TEMPLATE_TEMPLATE_PARM)
12555 return dependent_template_p (arg);
12556 else if (TYPE_P (arg))
12557 return dependent_type_p (arg);
12559 return (type_dependent_expression_p (arg)
12560 || value_dependent_expression_p (arg));
12563 /* Returns true if ARGS (a collection of template arguments) contains
12564 any dependent arguments. */
12567 any_dependent_template_arguments_p (tree args)
12575 for (i = 0; i < TMPL_ARGS_DEPTH (args); ++i)
12577 tree level = TMPL_ARGS_LEVEL (args, i + 1);
12578 for (j = 0; j < TREE_VEC_LENGTH (level); ++j)
12579 if (dependent_template_arg_p (TREE_VEC_ELT (level, j)))
12586 /* Returns TRUE if the template TMPL is dependent. */
12589 dependent_template_p (tree tmpl)
12591 if (TREE_CODE (tmpl) == OVERLOAD)
12595 if (dependent_template_p (OVL_FUNCTION (tmpl)))
12597 tmpl = OVL_CHAIN (tmpl);
12602 /* Template template parameters are dependent. */
12603 if (DECL_TEMPLATE_TEMPLATE_PARM_P (tmpl)
12604 || TREE_CODE (tmpl) == TEMPLATE_TEMPLATE_PARM)
12606 /* So are names that have not been looked up. */
12607 if (TREE_CODE (tmpl) == SCOPE_REF
12608 || TREE_CODE (tmpl) == IDENTIFIER_NODE)
12610 /* So are member templates of dependent classes. */
12611 if (TYPE_P (CP_DECL_CONTEXT (tmpl)))
12612 return dependent_type_p (DECL_CONTEXT (tmpl));
12616 /* Returns TRUE if the specialization TMPL<ARGS> is dependent. */
12619 dependent_template_id_p (tree tmpl, tree args)
12621 return (dependent_template_p (tmpl)
12622 || any_dependent_template_arguments_p (args));
12625 /* TYPE is a TYPENAME_TYPE. Returns the ordinary TYPE to which the
12626 TYPENAME_TYPE corresponds. Returns ERROR_MARK_NODE if no such TYPE
12627 can be found. Note that this function peers inside uninstantiated
12628 templates and therefore should be used only in extremely limited
12629 situations. ONLY_CURRENT_P restricts this peering to the currently
12630 open classes hierarchy (which is required when comparing types). */
12633 resolve_typename_type (tree type, bool only_current_p)
12641 gcc_assert (TREE_CODE (type) == TYPENAME_TYPE);
12643 scope = TYPE_CONTEXT (type);
12644 name = TYPE_IDENTIFIER (type);
12646 /* If the SCOPE is itself a TYPENAME_TYPE, then we need to resolve
12647 it first before we can figure out what NAME refers to. */
12648 if (TREE_CODE (scope) == TYPENAME_TYPE)
12649 scope = resolve_typename_type (scope, only_current_p);
12650 /* If we don't know what SCOPE refers to, then we cannot resolve the
12652 if (scope == error_mark_node || TREE_CODE (scope) == TYPENAME_TYPE)
12653 return error_mark_node;
12654 /* If the SCOPE is a template type parameter, we have no way of
12655 resolving the name. */
12656 if (TREE_CODE (scope) == TEMPLATE_TYPE_PARM)
12658 /* If the SCOPE is not the current instantiation, there's no reason
12659 to look inside it. */
12660 if (only_current_p && !currently_open_class (scope))
12661 return error_mark_node;
12662 /* If SCOPE is a partial instantiation, it will not have a valid
12663 TYPE_FIELDS list, so use the original template. */
12664 scope = CLASSTYPE_PRIMARY_TEMPLATE_TYPE (scope);
12665 /* Enter the SCOPE so that name lookup will be resolved as if we
12666 were in the class definition. In particular, SCOPE will no
12667 longer be considered a dependent type. */
12668 pushed_scope = push_scope (scope);
12669 /* Look up the declaration. */
12670 decl = lookup_member (scope, name, /*protect=*/0, /*want_type=*/true);
12671 /* Obtain the set of qualifiers applied to the TYPE. */
12672 quals = cp_type_quals (type);
12673 /* For a TYPENAME_TYPE like "typename X::template Y<T>", we want to
12674 find a TEMPLATE_DECL. Otherwise, we want to find a TYPE_DECL. */
12676 type = error_mark_node;
12677 else if (TREE_CODE (TYPENAME_TYPE_FULLNAME (type)) == IDENTIFIER_NODE
12678 && TREE_CODE (decl) == TYPE_DECL)
12679 type = TREE_TYPE (decl);
12680 else if (TREE_CODE (TYPENAME_TYPE_FULLNAME (type)) == TEMPLATE_ID_EXPR
12681 && DECL_CLASS_TEMPLATE_P (decl))
12685 /* Obtain the template and the arguments. */
12686 tmpl = TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type), 0);
12687 args = TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type), 1);
12688 /* Instantiate the template. */
12689 type = lookup_template_class (tmpl, args, NULL_TREE, NULL_TREE,
12690 /*entering_scope=*/0, tf_error | tf_user);
12693 type = error_mark_node;
12694 /* Qualify the resulting type. */
12695 if (type != error_mark_node && quals)
12696 type = cp_build_qualified_type (type, quals);
12697 /* Leave the SCOPE. */
12699 pop_scope (pushed_scope);
12704 /* EXPR is an expression which is not type-dependent. Return a proxy
12705 for EXPR that can be used to compute the types of larger
12706 expressions containing EXPR. */
12709 build_non_dependent_expr (tree expr)
12713 /* Preserve null pointer constants so that the type of things like
12714 "p == 0" where "p" is a pointer can be determined. */
12715 if (null_ptr_cst_p (expr))
12717 /* Preserve OVERLOADs; the functions must be available to resolve
12719 inner_expr = (TREE_CODE (expr) == ADDR_EXPR ?
12720 TREE_OPERAND (expr, 0) :
12721 TREE_CODE (expr) == COMPONENT_REF ?
12722 TREE_OPERAND (expr, 1) : expr);
12723 if (is_overloaded_fn (inner_expr)
12724 || TREE_CODE (inner_expr) == OFFSET_REF)
12726 /* There is no need to return a proxy for a variable. */
12727 if (TREE_CODE (expr) == VAR_DECL)
12729 /* Preserve string constants; conversions from string constants to
12730 "char *" are allowed, even though normally a "const char *"
12731 cannot be used to initialize a "char *". */
12732 if (TREE_CODE (expr) == STRING_CST)
12734 /* Preserve arithmetic constants, as an optimization -- there is no
12735 reason to create a new node. */
12736 if (TREE_CODE (expr) == INTEGER_CST || TREE_CODE (expr) == REAL_CST)
12738 /* Preserve THROW_EXPRs -- all throw-expressions have type "void".
12739 There is at least one place where we want to know that a
12740 particular expression is a throw-expression: when checking a ?:
12741 expression, there are special rules if the second or third
12742 argument is a throw-expression. */
12743 if (TREE_CODE (expr) == THROW_EXPR)
12746 if (TREE_CODE (expr) == COND_EXPR)
12747 return build3 (COND_EXPR,
12749 TREE_OPERAND (expr, 0),
12750 (TREE_OPERAND (expr, 1)
12751 ? build_non_dependent_expr (TREE_OPERAND (expr, 1))
12752 : build_non_dependent_expr (TREE_OPERAND (expr, 0))),
12753 build_non_dependent_expr (TREE_OPERAND (expr, 2)));
12754 if (TREE_CODE (expr) == COMPOUND_EXPR
12755 && !COMPOUND_EXPR_OVERLOADED (expr))
12756 return build2 (COMPOUND_EXPR,
12758 TREE_OPERAND (expr, 0),
12759 build_non_dependent_expr (TREE_OPERAND (expr, 1)));
12761 /* If the type is unknown, it can't really be non-dependent */
12762 gcc_assert (TREE_TYPE (expr) != unknown_type_node);
12764 /* Otherwise, build a NON_DEPENDENT_EXPR.
12766 REFERENCE_TYPEs are not stripped for expressions in templates
12767 because doing so would play havoc with mangling. Consider, for
12770 template <typename T> void f<T& g>() { g(); }
12772 In the body of "f", the expression for "g" will have
12773 REFERENCE_TYPE, even though the standard says that it should
12774 not. The reason is that we must preserve the syntactic form of
12775 the expression so that mangling (say) "f<g>" inside the body of
12776 "f" works out correctly. Therefore, the REFERENCE_TYPE is
12778 return build1 (NON_DEPENDENT_EXPR, non_reference (TREE_TYPE (expr)), expr);
12781 /* ARGS is a TREE_LIST of expressions as arguments to a function call.
12782 Return a new TREE_LIST with the various arguments replaced with
12783 equivalent non-dependent expressions. */
12786 build_non_dependent_args (tree args)
12791 new_args = NULL_TREE;
12792 for (a = args; a; a = TREE_CHAIN (a))
12793 new_args = tree_cons (NULL_TREE,
12794 build_non_dependent_expr (TREE_VALUE (a)),
12796 return nreverse (new_args);
12799 #include "gt-cp-pt.h"