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, 59 Temple Place - Suite 330,
22 Boston, MA 02111-1307, USA. */
24 /* Known bugs or deficiencies include:
26 all methods must be provided in header files; can't use a source
27 file that contains only the method templates and "just win". */
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 int template_class_depth_real (tree, int);
141 static tree tsubst_aggr_type (tree, tree, tsubst_flags_t, tree, int);
142 static tree tsubst_arg_types (tree, tree, tsubst_flags_t, tree);
143 static tree tsubst_function_type (tree, tree, tsubst_flags_t, tree);
144 static void check_specialization_scope (void);
145 static tree process_partial_specialization (tree);
146 static void set_current_access_from_decl (tree);
147 static void check_default_tmpl_args (tree, tree, int, int);
148 static tree tsubst_call_declarator_parms (tree, tree, tsubst_flags_t, tree);
149 static tree get_template_base (tree, tree, tree, tree);
150 static int verify_class_unification (tree, tree, tree);
151 static tree try_class_unification (tree, tree, tree, tree);
152 static int coerce_template_template_parms (tree, tree, tsubst_flags_t,
154 static tree determine_specialization (tree, tree, tree *, int, int);
155 static int template_args_equal (tree, tree);
156 static void tsubst_default_arguments (tree);
157 static tree for_each_template_parm_r (tree *, int *, void *);
158 static tree copy_default_args_to_explicit_spec_1 (tree, tree);
159 static void copy_default_args_to_explicit_spec (tree);
160 static int invalid_nontype_parm_type_p (tree, tsubst_flags_t);
161 static int eq_local_specializations (const void *, const void *);
162 static bool dependent_type_p_r (tree);
163 static tree tsubst (tree, tree, tsubst_flags_t, tree);
164 static tree tsubst_expr (tree, tree, tsubst_flags_t, tree);
165 static tree tsubst_copy (tree, tree, tsubst_flags_t, tree);
167 /* Make the current scope suitable for access checking when we are
168 processing T. T can be FUNCTION_DECL for instantiated function
169 template, or VAR_DECL for static member variable (need by
170 instantiate_decl). */
173 push_access_scope (tree t)
175 gcc_assert (TREE_CODE (t) == FUNCTION_DECL
176 || TREE_CODE (t) == VAR_DECL);
178 if (DECL_FRIEND_CONTEXT (t))
179 push_nested_class (DECL_FRIEND_CONTEXT (t));
180 else if (DECL_CLASS_SCOPE_P (t))
181 push_nested_class (DECL_CONTEXT (t));
183 push_to_top_level ();
185 if (TREE_CODE (t) == FUNCTION_DECL)
187 saved_access_scope = tree_cons
188 (NULL_TREE, current_function_decl, saved_access_scope);
189 current_function_decl = t;
193 /* Restore the scope set up by push_access_scope. T is the node we
197 pop_access_scope (tree t)
199 if (TREE_CODE (t) == FUNCTION_DECL)
201 current_function_decl = TREE_VALUE (saved_access_scope);
202 saved_access_scope = TREE_CHAIN (saved_access_scope);
205 if (DECL_FRIEND_CONTEXT (t) || DECL_CLASS_SCOPE_P (t))
208 pop_from_top_level ();
211 /* Do any processing required when DECL (a member template
212 declaration) is finished. Returns the TEMPLATE_DECL corresponding
213 to DECL, unless it is a specialization, in which case the DECL
214 itself is returned. */
217 finish_member_template_decl (tree decl)
219 if (decl == error_mark_node)
220 return error_mark_node;
222 gcc_assert (DECL_P (decl));
224 if (TREE_CODE (decl) == TYPE_DECL)
228 type = TREE_TYPE (decl);
229 if (IS_AGGR_TYPE (type)
230 && CLASSTYPE_TEMPLATE_INFO (type)
231 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (type))
233 tree tmpl = CLASSTYPE_TI_TEMPLATE (type);
234 check_member_template (tmpl);
239 else if (TREE_CODE (decl) == FIELD_DECL)
240 error ("data member %qD cannot be a member template", decl);
241 else if (DECL_TEMPLATE_INFO (decl))
243 if (!DECL_TEMPLATE_SPECIALIZATION (decl))
245 check_member_template (DECL_TI_TEMPLATE (decl));
246 return DECL_TI_TEMPLATE (decl);
252 error ("invalid member template declaration %qD", decl);
254 return error_mark_node;
257 /* Returns the template nesting level of the indicated class TYPE.
267 A<T>::B<U> has depth two, while A<T> has depth one.
268 Both A<T>::B<int> and A<int>::B<U> have depth one, if
269 COUNT_SPECIALIZATIONS is 0 or if they are instantiations, not
272 This function is guaranteed to return 0 if passed NULL_TREE so
273 that, for example, `template_class_depth (current_class_type)' is
277 template_class_depth_real (tree type, int count_specializations)
282 type && TREE_CODE (type) != NAMESPACE_DECL;
283 type = (TREE_CODE (type) == FUNCTION_DECL)
284 ? CP_DECL_CONTEXT (type) : TYPE_CONTEXT (type))
286 if (TREE_CODE (type) != FUNCTION_DECL)
288 if (CLASSTYPE_TEMPLATE_INFO (type)
289 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (type))
290 && ((count_specializations
291 && CLASSTYPE_TEMPLATE_SPECIALIZATION (type))
292 || uses_template_parms (CLASSTYPE_TI_ARGS (type))))
297 if (DECL_TEMPLATE_INFO (type)
298 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (type))
299 && ((count_specializations
300 && DECL_TEMPLATE_SPECIALIZATION (type))
301 || uses_template_parms (DECL_TI_ARGS (type))))
309 /* Returns the template nesting level of the indicated class TYPE.
310 Like template_class_depth_real, but instantiations do not count in
314 template_class_depth (tree type)
316 return template_class_depth_real (type, /*count_specializations=*/0);
319 /* Returns 1 if processing DECL as part of do_pending_inlines
320 needs us to push template parms. */
323 inline_needs_template_parms (tree decl)
325 if (! DECL_TEMPLATE_INFO (decl))
328 return (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (most_general_template (decl)))
329 > (processing_template_decl + DECL_TEMPLATE_SPECIALIZATION (decl)));
332 /* Subroutine of maybe_begin_member_template_processing.
333 Push the template parms in PARMS, starting from LEVELS steps into the
334 chain, and ending at the beginning, since template parms are listed
338 push_inline_template_parms_recursive (tree parmlist, int levels)
340 tree parms = TREE_VALUE (parmlist);
344 push_inline_template_parms_recursive (TREE_CHAIN (parmlist), levels - 1);
346 ++processing_template_decl;
347 current_template_parms
348 = tree_cons (size_int (processing_template_decl),
349 parms, current_template_parms);
350 TEMPLATE_PARMS_FOR_INLINE (current_template_parms) = 1;
352 begin_scope (TREE_VEC_LENGTH (parms) ? sk_template_parms : sk_template_spec,
354 for (i = 0; i < TREE_VEC_LENGTH (parms); ++i)
356 tree parm = TREE_VALUE (TREE_VEC_ELT (parms, i));
357 gcc_assert (DECL_P (parm));
359 switch (TREE_CODE (parm))
368 /* Make a CONST_DECL as is done in process_template_parm.
369 It is ugly that we recreate this here; the original
370 version built in process_template_parm is no longer
372 tree decl = build_decl (CONST_DECL, DECL_NAME (parm),
374 DECL_ARTIFICIAL (decl) = 1;
375 TREE_CONSTANT (decl) = 1;
376 TREE_INVARIANT (decl) = 1;
377 TREE_READONLY (decl) = 1;
378 DECL_INITIAL (decl) = DECL_INITIAL (parm);
379 SET_DECL_TEMPLATE_PARM_P (decl);
390 /* Restore the template parameter context for a member template or
391 a friend template defined in a class definition. */
394 maybe_begin_member_template_processing (tree decl)
399 if (inline_needs_template_parms (decl))
401 parms = DECL_TEMPLATE_PARMS (most_general_template (decl));
402 levels = TMPL_PARMS_DEPTH (parms) - processing_template_decl;
404 if (DECL_TEMPLATE_SPECIALIZATION (decl))
407 parms = TREE_CHAIN (parms);
410 push_inline_template_parms_recursive (parms, levels);
413 /* Remember how many levels of template parameters we pushed so that
414 we can pop them later. */
415 if (!inline_parm_levels)
416 VARRAY_INT_INIT (inline_parm_levels, 4, "inline_parm_levels");
417 if (inline_parm_levels_used == inline_parm_levels->num_elements)
418 VARRAY_GROW (inline_parm_levels, 2 * inline_parm_levels_used);
419 VARRAY_INT (inline_parm_levels, inline_parm_levels_used) = levels;
420 ++inline_parm_levels_used;
423 /* Undo the effects of maybe_begin_member_template_processing. */
426 maybe_end_member_template_processing (void)
430 if (!inline_parm_levels_used)
433 --inline_parm_levels_used;
435 i < VARRAY_INT (inline_parm_levels, inline_parm_levels_used);
438 --processing_template_decl;
439 current_template_parms = TREE_CHAIN (current_template_parms);
444 /* Return a new template argument vector which contains all of ARGS,
445 but has as its innermost set of arguments the EXTRA_ARGS. */
448 add_to_template_args (tree args, tree extra_args)
455 extra_depth = TMPL_ARGS_DEPTH (extra_args);
456 new_args = make_tree_vec (TMPL_ARGS_DEPTH (args) + extra_depth);
458 for (i = 1; i <= TMPL_ARGS_DEPTH (args); ++i)
459 SET_TMPL_ARGS_LEVEL (new_args, i, TMPL_ARGS_LEVEL (args, i));
461 for (j = 1; j <= extra_depth; ++j, ++i)
462 SET_TMPL_ARGS_LEVEL (new_args, i, TMPL_ARGS_LEVEL (extra_args, j));
467 /* Like add_to_template_args, but only the outermost ARGS are added to
468 the EXTRA_ARGS. In particular, all but TMPL_ARGS_DEPTH
469 (EXTRA_ARGS) levels are added. This function is used to combine
470 the template arguments from a partial instantiation with the
471 template arguments used to attain the full instantiation from the
472 partial instantiation. */
475 add_outermost_template_args (tree args, tree extra_args)
479 /* If there are more levels of EXTRA_ARGS than there are ARGS,
480 something very fishy is going on. */
481 gcc_assert (TMPL_ARGS_DEPTH (args) >= TMPL_ARGS_DEPTH (extra_args));
483 /* If *all* the new arguments will be the EXTRA_ARGS, just return
485 if (TMPL_ARGS_DEPTH (args) == TMPL_ARGS_DEPTH (extra_args))
488 /* For the moment, we make ARGS look like it contains fewer levels. */
489 TREE_VEC_LENGTH (args) -= TMPL_ARGS_DEPTH (extra_args);
491 new_args = add_to_template_args (args, extra_args);
493 /* Now, we restore ARGS to its full dimensions. */
494 TREE_VEC_LENGTH (args) += TMPL_ARGS_DEPTH (extra_args);
499 /* Return the N levels of innermost template arguments from the ARGS. */
502 get_innermost_template_args (tree args, int n)
510 /* If N is 1, just return the innermost set of template arguments. */
512 return TMPL_ARGS_LEVEL (args, TMPL_ARGS_DEPTH (args));
514 /* If we're not removing anything, just return the arguments we were
516 extra_levels = TMPL_ARGS_DEPTH (args) - n;
517 gcc_assert (extra_levels >= 0);
518 if (extra_levels == 0)
521 /* Make a new set of arguments, not containing the outer arguments. */
522 new_args = make_tree_vec (n);
523 for (i = 1; i <= n; ++i)
524 SET_TMPL_ARGS_LEVEL (new_args, i,
525 TMPL_ARGS_LEVEL (args, i + extra_levels));
530 /* We've got a template header coming up; push to a new level for storing
534 begin_template_parm_list (void)
536 /* We use a non-tag-transparent scope here, which causes pushtag to
537 put tags in this scope, rather than in the enclosing class or
538 namespace scope. This is the right thing, since we want
539 TEMPLATE_DECLS, and not TYPE_DECLS for template classes. For a
540 global template class, push_template_decl handles putting the
541 TEMPLATE_DECL into top-level scope. For a nested template class,
544 template <class T> struct S1 {
545 template <class T> struct S2 {};
548 pushtag contains special code to call pushdecl_with_scope on the
549 TEMPLATE_DECL for S2. */
550 begin_scope (sk_template_parms, NULL);
551 ++processing_template_decl;
552 ++processing_template_parmlist;
553 note_template_header (0);
556 /* This routine is called when a specialization is declared. If it is
557 invalid to declare a specialization here, an error is reported. */
560 check_specialization_scope (void)
562 tree scope = current_scope ();
566 An explicit specialization shall be declared in the namespace of
567 which the template is a member, or, for member templates, in the
568 namespace of which the enclosing class or enclosing class
569 template is a member. An explicit specialization of a member
570 function, member class or static data member of a class template
571 shall be declared in the namespace of which the class template
573 if (scope && TREE_CODE (scope) != NAMESPACE_DECL)
574 error ("explicit specialization in non-namespace scope %qD", scope);
578 In an explicit specialization declaration for a member of a class
579 template or a member template that appears in namespace scope,
580 the member template and some of its enclosing class templates may
581 remain unspecialized, except that the declaration shall not
582 explicitly specialize a class member template if its enclosing
583 class templates are not explicitly specialized as well. */
584 if (current_template_parms)
585 error ("enclosing class templates are not explicitly specialized");
588 /* We've just seen template <>. */
591 begin_specialization (void)
593 begin_scope (sk_template_spec, NULL);
594 note_template_header (1);
595 check_specialization_scope ();
598 /* Called at then end of processing a declaration preceded by
602 end_specialization (void)
605 reset_specialization ();
608 /* Any template <>'s that we have seen thus far are not referring to a
609 function specialization. */
612 reset_specialization (void)
614 processing_specialization = 0;
615 template_header_count = 0;
618 /* We've just seen a template header. If SPECIALIZATION is nonzero,
619 it was of the form template <>. */
622 note_template_header (int specialization)
624 processing_specialization = specialization;
625 template_header_count++;
628 /* We're beginning an explicit instantiation. */
631 begin_explicit_instantiation (void)
633 gcc_assert (!processing_explicit_instantiation);
634 processing_explicit_instantiation = true;
639 end_explicit_instantiation (void)
641 gcc_assert (processing_explicit_instantiation);
642 processing_explicit_instantiation = false;
645 /* A explicit specialization or partial specialization TMPL is being
646 declared. Check that the namespace in which the specialization is
647 occurring is permissible. Returns false iff it is invalid to
648 specialize TMPL in the current namespace. */
651 check_specialization_namespace (tree tmpl)
653 tree tpl_ns = decl_namespace_context (tmpl);
657 An explicit specialization shall be declared in the namespace of
658 which the template is a member, or, for member templates, in the
659 namespace of which the enclosing class or enclosing class
660 template is a member. An explicit specialization of a member
661 function, member class or static data member of a class template
662 shall be declared in the namespace of which the class template is
664 if (is_associated_namespace (current_namespace, tpl_ns))
665 /* Same or super-using namespace. */
669 pedwarn ("specialization of %qD in different namespace", tmpl);
670 cp_pedwarn_at (" from definition of %q#D", tmpl);
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 cp_pedwarn_at (" 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. Returns SPEC, or an equivalent prior
1118 declaration, if available. */
1121 register_specialization (tree spec, tree tmpl, tree args)
1125 gcc_assert (TREE_CODE (tmpl) == TEMPLATE_DECL);
1127 if (TREE_CODE (spec) == FUNCTION_DECL
1128 && uses_template_parms (DECL_TI_ARGS (spec)))
1129 /* This is the FUNCTION_DECL for a partial instantiation. Don't
1130 register it; we want the corresponding TEMPLATE_DECL instead.
1131 We use `uses_template_parms (DECL_TI_ARGS (spec))' rather than
1132 the more obvious `uses_template_parms (spec)' to avoid problems
1133 with default function arguments. In particular, given
1134 something like this:
1136 template <class T> void f(T t1, T t = T())
1138 the default argument expression is not substituted for in an
1139 instantiation unless and until it is actually needed. */
1142 /* There should be as many levels of arguments as there are
1143 levels of parameters. */
1144 gcc_assert (TMPL_ARGS_DEPTH (args)
1145 == TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl)));
1147 fn = retrieve_specialization (tmpl, args,
1148 /*class_specializations_p=*/false);
1149 /* We can sometimes try to re-register a specialization that we've
1150 already got. In particular, regenerate_decl_from_template calls
1151 duplicate_decls which will update the specialization list. But,
1152 we'll still get called again here anyhow. It's more convenient
1153 to simply allow this than to try to prevent it. */
1156 else if (fn && DECL_TEMPLATE_SPECIALIZATION (spec))
1158 if (DECL_TEMPLATE_INSTANTIATION (fn))
1161 || DECL_EXPLICIT_INSTANTIATION (fn))
1163 error ("specialization of %qD after instantiation",
1169 /* This situation should occur only if the first
1170 specialization is an implicit instantiation, the
1171 second is an explicit specialization, and the
1172 implicit instantiation has not yet been used. That
1173 situation can occur if we have implicitly
1174 instantiated a member function and then specialized
1177 We can also wind up here if a friend declaration that
1178 looked like an instantiation turns out to be a
1181 template <class T> void foo(T);
1182 class S { friend void foo<>(int) };
1183 template <> void foo(int);
1185 We transform the existing DECL in place so that any
1186 pointers to it become pointers to the updated
1189 If there was a definition for the template, but not
1190 for the specialization, we want this to look as if
1191 there were no definition, and vice versa. */
1192 DECL_INITIAL (fn) = NULL_TREE;
1193 duplicate_decls (spec, fn);
1198 else if (DECL_TEMPLATE_SPECIALIZATION (fn))
1200 if (!duplicate_decls (spec, fn) && DECL_INITIAL (spec))
1201 /* Dup decl failed, but this is a new definition. Set the
1202 line number so any errors match this new
1204 DECL_SOURCE_LOCATION (fn) = DECL_SOURCE_LOCATION (spec);
1210 /* A specialization must be declared in the same namespace as the
1211 template it is specializing. */
1212 if (DECL_TEMPLATE_SPECIALIZATION (spec)
1213 && !check_specialization_namespace (tmpl))
1214 DECL_CONTEXT (spec) = decl_namespace_context (tmpl);
1216 if (!optimize_specialization_lookup_p (tmpl))
1217 DECL_TEMPLATE_SPECIALIZATIONS (tmpl)
1218 = tree_cons (args, spec, DECL_TEMPLATE_SPECIALIZATIONS (tmpl));
1223 /* Unregister the specialization SPEC as a specialization of TMPL.
1224 Replace it with NEW_SPEC, if NEW_SPEC is non-NULL. Returns true
1225 if the SPEC was listed as a specialization of TMPL. */
1228 reregister_specialization (tree spec, tree tmpl, tree new_spec)
1232 for (s = &DECL_TEMPLATE_SPECIALIZATIONS (tmpl);
1234 s = &TREE_CHAIN (*s))
1235 if (TREE_VALUE (*s) == spec)
1238 *s = TREE_CHAIN (*s);
1240 TREE_VALUE (*s) = new_spec;
1247 /* Compare an entry in the local specializations hash table P1 (which
1248 is really a pointer to a TREE_LIST) with P2 (which is really a
1252 eq_local_specializations (const void *p1, const void *p2)
1254 return TREE_VALUE ((tree) p1) == (tree) p2;
1257 /* Hash P1, an entry in the local specializations table. */
1260 hash_local_specialization (const void* p1)
1262 return htab_hash_pointer (TREE_VALUE ((tree) p1));
1265 /* Like register_specialization, but for local declarations. We are
1266 registering SPEC, an instantiation of TMPL. */
1269 register_local_specialization (tree spec, tree tmpl)
1273 slot = htab_find_slot_with_hash (local_specializations, tmpl,
1274 htab_hash_pointer (tmpl), INSERT);
1275 *slot = build_tree_list (spec, tmpl);
1278 /* Print the list of candidate FNS in an error message. */
1281 print_candidates (tree fns)
1285 const char *str = "candidates are:";
1287 for (fn = fns; fn != NULL_TREE; fn = TREE_CHAIN (fn))
1291 for (f = TREE_VALUE (fn); f; f = OVL_NEXT (f))
1292 cp_error_at ("%s %+#D", str, OVL_CURRENT (f));
1297 /* Returns the template (one of the functions given by TEMPLATE_ID)
1298 which can be specialized to match the indicated DECL with the
1299 explicit template args given in TEMPLATE_ID. The DECL may be
1300 NULL_TREE if none is available. In that case, the functions in
1301 TEMPLATE_ID are non-members.
1303 If NEED_MEMBER_TEMPLATE is nonzero the function is known to be a
1304 specialization of a member template.
1306 The TEMPLATE_COUNT is the number of references to qualifying
1307 template classes that appeared in the name of the function. See
1308 check_explicit_specialization for a more accurate description.
1310 The template args (those explicitly specified and those deduced)
1311 are output in a newly created vector *TARGS_OUT.
1313 If it is impossible to determine the result, an error message is
1314 issued. The error_mark_node is returned to indicate failure. */
1317 determine_specialization (tree template_id,
1320 int need_member_template,
1325 tree explicit_targs;
1326 tree candidates = NULL_TREE;
1327 tree templates = NULL_TREE;
1329 struct cp_binding_level *b;
1331 *targs_out = NULL_TREE;
1333 if (template_id == error_mark_node)
1334 return error_mark_node;
1336 fns = TREE_OPERAND (template_id, 0);
1337 explicit_targs = TREE_OPERAND (template_id, 1);
1339 if (fns == error_mark_node)
1340 return error_mark_node;
1342 /* Check for baselinks. */
1343 if (BASELINK_P (fns))
1344 fns = BASELINK_FUNCTIONS (fns);
1346 if (!is_overloaded_fn (fns))
1348 error ("%qD is not a function template", fns);
1349 return error_mark_node;
1352 /* Count the number of template headers specified for this
1355 for (b = current_binding_level;
1356 b->kind == sk_template_parms;
1360 for (; fns; fns = OVL_NEXT (fns))
1362 tree fn = OVL_CURRENT (fns);
1364 if (TREE_CODE (fn) == TEMPLATE_DECL)
1366 tree decl_arg_types;
1369 /* DECL might be a specialization of FN. */
1371 /* Adjust the type of DECL in case FN is a static member. */
1372 decl_arg_types = TYPE_ARG_TYPES (TREE_TYPE (decl));
1373 if (DECL_STATIC_FUNCTION_P (fn)
1374 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl))
1375 decl_arg_types = TREE_CHAIN (decl_arg_types);
1377 /* Check that the number of function parameters matches.
1379 template <class T> void f(int i = 0);
1380 template <> void f<int>();
1381 The specialization f<int> is invalid but is not caught
1382 by get_bindings below. */
1384 fn_arg_types = TYPE_ARG_TYPES (TREE_TYPE (fn));
1385 if (list_length (fn_arg_types) != list_length (decl_arg_types))
1388 /* For a non-static member function, we need to make sure that
1389 the const qualification is the same. This can be done by
1390 checking the 'this' in the argument list. */
1391 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn)
1392 && !same_type_p (TREE_VALUE (fn_arg_types),
1393 TREE_VALUE (decl_arg_types)))
1396 /* In case of explicit specialization, we need to check if
1397 the number of template headers appearing in the specialization
1398 is correct. This is usually done in check_explicit_specialization,
1399 but the check done there cannot be exhaustive when specializing
1400 member functions. Consider the following code:
1402 template <> void A<int>::f(int);
1403 template <> template <> void A<int>::f(int);
1405 Assuming that A<int> is not itself an explicit specialization
1406 already, the first line specializes "f" which is a non-template
1407 member function, whilst the second line specializes "f" which
1408 is a template member function. So both lines are syntactically
1409 correct, and check_explicit_specialization does not reject
1412 Here, we can do better, as we are matching the specialization
1413 against the declarations. We count the number of template
1414 headers, and we check if they match TEMPLATE_COUNT + 1
1415 (TEMPLATE_COUNT is the number of qualifying template classes,
1416 plus there must be another header for the member template
1419 Notice that if header_count is zero, this is not a
1420 specialization but rather a template instantiation, so there
1421 is no check we can perform here. */
1422 if (header_count && header_count != template_count + 1)
1425 /* Check that the number of template arguments at the
1426 innermost level for DECL is the same as for FN. */
1427 if (current_binding_level->kind == sk_template_parms
1428 && !current_binding_level->explicit_spec_p
1429 && (TREE_VEC_LENGTH (DECL_INNERMOST_TEMPLATE_PARMS (fn))
1430 != TREE_VEC_LENGTH (TREE_VALUE (current_template_parms))))
1433 /* See whether this function might be a specialization of this
1435 targs = get_bindings (fn, decl, explicit_targs, /*check_ret=*/true);
1438 /* We cannot deduce template arguments that when used to
1439 specialize TMPL will produce DECL. */
1442 /* Save this template, and the arguments deduced. */
1443 templates = tree_cons (targs, fn, templates);
1445 else if (need_member_template)
1446 /* FN is an ordinary member function, and we need a
1447 specialization of a member template. */
1449 else if (TREE_CODE (fn) != FUNCTION_DECL)
1450 /* We can get IDENTIFIER_NODEs here in certain erroneous
1453 else if (!DECL_FUNCTION_MEMBER_P (fn))
1454 /* This is just an ordinary non-member function. Nothing can
1455 be a specialization of that. */
1457 else if (DECL_ARTIFICIAL (fn))
1458 /* Cannot specialize functions that are created implicitly. */
1462 tree decl_arg_types;
1464 /* This is an ordinary member function. However, since
1465 we're here, we can assume it's enclosing class is a
1466 template class. For example,
1468 template <typename T> struct S { void f(); };
1469 template <> void S<int>::f() {}
1471 Here, S<int>::f is a non-template, but S<int> is a
1472 template class. If FN has the same type as DECL, we
1473 might be in business. */
1475 if (!DECL_TEMPLATE_INFO (fn))
1476 /* Its enclosing class is an explicit specialization
1477 of a template class. This is not a candidate. */
1480 if (!same_type_p (TREE_TYPE (TREE_TYPE (decl)),
1481 TREE_TYPE (TREE_TYPE (fn))))
1482 /* The return types differ. */
1485 /* Adjust the type of DECL in case FN is a static member. */
1486 decl_arg_types = TYPE_ARG_TYPES (TREE_TYPE (decl));
1487 if (DECL_STATIC_FUNCTION_P (fn)
1488 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl))
1489 decl_arg_types = TREE_CHAIN (decl_arg_types);
1491 if (compparms (TYPE_ARG_TYPES (TREE_TYPE (fn)),
1494 candidates = tree_cons (NULL_TREE, fn, candidates);
1498 if (templates && TREE_CHAIN (templates))
1504 It is possible for a specialization with a given function
1505 signature to be instantiated from more than one function
1506 template. In such cases, explicit specification of the
1507 template arguments must be used to uniquely identify the
1508 function template specialization being specialized.
1510 Note that here, there's no suggestion that we're supposed to
1511 determine which of the candidate templates is most
1512 specialized. However, we, also have:
1516 Partial ordering of overloaded function template
1517 declarations is used in the following contexts to select
1518 the function template to which a function template
1519 specialization refers:
1521 -- when an explicit specialization refers to a function
1524 So, we do use the partial ordering rules, at least for now.
1525 This extension can only serve to make invalid programs valid,
1526 so it's safe. And, there is strong anecdotal evidence that
1527 the committee intended the partial ordering rules to apply;
1528 the EDG front-end has that behavior, and John Spicer claims
1529 that the committee simply forgot to delete the wording in
1530 [temp.expl.spec]. */
1531 tree tmpl = most_specialized (templates, decl, explicit_targs);
1532 if (tmpl && tmpl != error_mark_node)
1534 targs = get_bindings (tmpl, decl, explicit_targs, /*check_ret=*/true);
1535 templates = tree_cons (targs, tmpl, NULL_TREE);
1539 if (templates == NULL_TREE && candidates == NULL_TREE)
1541 cp_error_at ("template-id %qD for %q+D does not match any template "
1544 return error_mark_node;
1546 else if ((templates && TREE_CHAIN (templates))
1547 || (candidates && TREE_CHAIN (candidates))
1548 || (templates && candidates))
1550 cp_error_at ("ambiguous template specialization %qD for %q+D",
1552 chainon (candidates, templates);
1553 print_candidates (candidates);
1554 return error_mark_node;
1557 /* We have one, and exactly one, match. */
1560 /* It was a specialization of an ordinary member function in a
1562 *targs_out = copy_node (DECL_TI_ARGS (TREE_VALUE (candidates)));
1563 return DECL_TI_TEMPLATE (TREE_VALUE (candidates));
1566 /* It was a specialization of a template. */
1567 targs = DECL_TI_ARGS (DECL_TEMPLATE_RESULT (TREE_VALUE (templates)));
1568 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (targs))
1570 *targs_out = copy_node (targs);
1571 SET_TMPL_ARGS_LEVEL (*targs_out,
1572 TMPL_ARGS_DEPTH (*targs_out),
1573 TREE_PURPOSE (templates));
1576 *targs_out = TREE_PURPOSE (templates);
1577 return TREE_VALUE (templates);
1580 /* Returns a chain of parameter types, exactly like the SPEC_TYPES,
1581 but with the default argument values filled in from those in the
1585 copy_default_args_to_explicit_spec_1 (tree spec_types,
1588 tree new_spec_types;
1593 if (spec_types == void_list_node)
1594 return void_list_node;
1596 /* Substitute into the rest of the list. */
1598 copy_default_args_to_explicit_spec_1 (TREE_CHAIN (spec_types),
1599 TREE_CHAIN (tmpl_types));
1601 /* Add the default argument for this parameter. */
1602 return hash_tree_cons (TREE_PURPOSE (tmpl_types),
1603 TREE_VALUE (spec_types),
1607 /* DECL is an explicit specialization. Replicate default arguments
1608 from the template it specializes. (That way, code like:
1610 template <class T> void f(T = 3);
1611 template <> void f(double);
1614 works, as required.) An alternative approach would be to look up
1615 the correct default arguments at the call-site, but this approach
1616 is consistent with how implicit instantiations are handled. */
1619 copy_default_args_to_explicit_spec (tree decl)
1624 tree new_spec_types;
1628 tree object_type = NULL_TREE;
1629 tree in_charge = NULL_TREE;
1630 tree vtt = NULL_TREE;
1632 /* See if there's anything we need to do. */
1633 tmpl = DECL_TI_TEMPLATE (decl);
1634 tmpl_types = TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (tmpl)));
1635 for (t = tmpl_types; t; t = TREE_CHAIN (t))
1636 if (TREE_PURPOSE (t))
1641 old_type = TREE_TYPE (decl);
1642 spec_types = TYPE_ARG_TYPES (old_type);
1644 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl))
1646 /* Remove the this pointer, but remember the object's type for
1648 object_type = TREE_TYPE (TREE_VALUE (spec_types));
1649 spec_types = TREE_CHAIN (spec_types);
1650 tmpl_types = TREE_CHAIN (tmpl_types);
1652 if (DECL_HAS_IN_CHARGE_PARM_P (decl))
1654 /* DECL may contain more parameters than TMPL due to the extra
1655 in-charge parameter in constructors and destructors. */
1656 in_charge = spec_types;
1657 spec_types = TREE_CHAIN (spec_types);
1659 if (DECL_HAS_VTT_PARM_P (decl))
1662 spec_types = TREE_CHAIN (spec_types);
1666 /* Compute the merged default arguments. */
1668 copy_default_args_to_explicit_spec_1 (spec_types, tmpl_types);
1670 /* Compute the new FUNCTION_TYPE. */
1674 new_spec_types = hash_tree_cons (TREE_PURPOSE (vtt),
1679 /* Put the in-charge parameter back. */
1680 new_spec_types = hash_tree_cons (TREE_PURPOSE (in_charge),
1681 TREE_VALUE (in_charge),
1684 new_type = build_method_type_directly (object_type,
1685 TREE_TYPE (old_type),
1689 new_type = build_function_type (TREE_TYPE (old_type),
1691 new_type = cp_build_type_attribute_variant (new_type,
1692 TYPE_ATTRIBUTES (old_type));
1693 new_type = build_exception_variant (new_type,
1694 TYPE_RAISES_EXCEPTIONS (old_type));
1695 TREE_TYPE (decl) = new_type;
1698 /* Check to see if the function just declared, as indicated in
1699 DECLARATOR, and in DECL, is a specialization of a function
1700 template. We may also discover that the declaration is an explicit
1701 instantiation at this point.
1703 Returns DECL, or an equivalent declaration that should be used
1704 instead if all goes well. Issues an error message if something is
1705 amiss. Returns error_mark_node if the error is not easily
1708 FLAGS is a bitmask consisting of the following flags:
1710 2: The function has a definition.
1711 4: The function is a friend.
1713 The TEMPLATE_COUNT is the number of references to qualifying
1714 template classes that appeared in the name of the function. For
1717 template <class T> struct S { void f(); };
1720 the TEMPLATE_COUNT would be 1. However, explicitly specialized
1721 classes are not counted in the TEMPLATE_COUNT, so that in
1723 template <class T> struct S {};
1724 template <> struct S<int> { void f(); }
1725 template <> void S<int>::f();
1727 the TEMPLATE_COUNT would be 0. (Note that this declaration is
1728 invalid; there should be no template <>.)
1730 If the function is a specialization, it is marked as such via
1731 DECL_TEMPLATE_SPECIALIZATION. Furthermore, its DECL_TEMPLATE_INFO
1732 is set up correctly, and it is added to the list of specializations
1733 for that template. */
1736 check_explicit_specialization (tree declarator,
1741 int have_def = flags & 2;
1742 int is_friend = flags & 4;
1743 int specialization = 0;
1744 int explicit_instantiation = 0;
1745 int member_specialization = 0;
1746 tree ctype = DECL_CLASS_CONTEXT (decl);
1747 tree dname = DECL_NAME (decl);
1752 if (!processing_specialization)
1755 tsk = tsk_excessive_parms;
1758 tsk = current_tmpl_spec_kind (template_count);
1763 if (processing_specialization)
1766 SET_DECL_TEMPLATE_SPECIALIZATION (decl);
1768 else if (TREE_CODE (declarator) == TEMPLATE_ID_EXPR)
1771 /* This could be something like:
1773 template <class T> void f(T);
1774 class S { friend void f<>(int); } */
1778 /* This case handles bogus declarations like template <>
1779 template <class T> void f<int>(); */
1781 error ("template-id %qD in declaration of primary template",
1788 case tsk_invalid_member_spec:
1789 /* The error has already been reported in
1790 check_specialization_scope. */
1791 return error_mark_node;
1793 case tsk_invalid_expl_inst:
1794 error ("template parameter list used in explicit instantiation");
1800 error ("definition provided for explicit instantiation");
1802 explicit_instantiation = 1;
1805 case tsk_excessive_parms:
1806 case tsk_insufficient_parms:
1807 if (tsk == tsk_excessive_parms)
1808 error ("too many template parameter lists in declaration of %qD",
1810 else if (template_header_count)
1811 error("too few template parameter lists in declaration of %qD", decl);
1813 error("explicit specialization of %qD must be introduced by "
1814 "%<template <>%>", decl);
1818 SET_DECL_TEMPLATE_SPECIALIZATION (decl);
1820 member_specialization = 1;
1826 if (TREE_CODE (declarator) == TEMPLATE_ID_EXPR)
1828 /* This case handles bogus declarations like template <>
1829 template <class T> void f<int>(); */
1831 if (uses_template_parms (declarator))
1832 error ("function template partial specialization %qD "
1833 "is not allowed", declarator);
1835 error ("template-id %qD in declaration of primary template",
1840 if (ctype && CLASSTYPE_TEMPLATE_INSTANTIATION (ctype))
1841 /* This is a specialization of a member template, without
1842 specialization the containing class. Something like:
1844 template <class T> struct S {
1845 template <class U> void f (U);
1847 template <> template <class U> void S<int>::f(U) {}
1849 That's a specialization -- but of the entire template. */
1857 if (specialization || member_specialization)
1859 tree t = TYPE_ARG_TYPES (TREE_TYPE (decl));
1860 for (; t; t = TREE_CHAIN (t))
1861 if (TREE_PURPOSE (t))
1864 ("default argument specified in explicit specialization");
1867 if (current_lang_name == lang_name_c)
1868 error ("template specialization with C linkage");
1871 if (specialization || member_specialization || explicit_instantiation)
1873 tree tmpl = NULL_TREE;
1874 tree targs = NULL_TREE;
1876 /* Make sure that the declarator is a TEMPLATE_ID_EXPR. */
1877 if (TREE_CODE (declarator) != TEMPLATE_ID_EXPR)
1881 gcc_assert (TREE_CODE (declarator) == IDENTIFIER_NODE);
1886 /* If there is no class context, the explicit instantiation
1887 must be at namespace scope. */
1888 gcc_assert (DECL_NAMESPACE_SCOPE_P (decl));
1890 /* Find the namespace binding, using the declaration
1892 fns = namespace_binding (dname, CP_DECL_CONTEXT (decl));
1893 if (!fns || !is_overloaded_fn (fns))
1895 error ("%qD is not a template function", dname);
1896 fns = error_mark_node;
1900 declarator = lookup_template_function (fns, NULL_TREE);
1903 if (declarator == error_mark_node)
1904 return error_mark_node;
1906 if (ctype != NULL_TREE && TYPE_BEING_DEFINED (ctype))
1908 if (!explicit_instantiation)
1909 /* A specialization in class scope. This is invalid,
1910 but the error will already have been flagged by
1911 check_specialization_scope. */
1912 return error_mark_node;
1915 /* It's not valid to write an explicit instantiation in
1918 class C { template void f(); }
1920 This case is caught by the parser. However, on
1923 template class C { void f(); };
1925 (which is invalid) we can get here. The error will be
1932 else if (ctype != NULL_TREE
1933 && (TREE_CODE (TREE_OPERAND (declarator, 0)) ==
1936 /* Find the list of functions in ctype that have the same
1937 name as the declared function. */
1938 tree name = TREE_OPERAND (declarator, 0);
1939 tree fns = NULL_TREE;
1942 if (constructor_name_p (name, ctype))
1944 int is_constructor = DECL_CONSTRUCTOR_P (decl);
1946 if (is_constructor ? !TYPE_HAS_CONSTRUCTOR (ctype)
1947 : !CLASSTYPE_DESTRUCTORS (ctype))
1949 /* From [temp.expl.spec]:
1951 If such an explicit specialization for the member
1952 of a class template names an implicitly-declared
1953 special member function (clause _special_), the
1954 program is ill-formed.
1956 Similar language is found in [temp.explicit]. */
1957 error ("specialization of implicitly-declared special member function");
1958 return error_mark_node;
1961 name = is_constructor ? ctor_identifier : dtor_identifier;
1964 if (!DECL_CONV_FN_P (decl))
1966 idx = lookup_fnfields_1 (ctype, name);
1968 fns = VEC_index (tree, CLASSTYPE_METHOD_VEC (ctype), idx);
1972 VEC(tree,gc) *methods;
1975 /* For a type-conversion operator, we cannot do a
1976 name-based lookup. We might be looking for `operator
1977 int' which will be a specialization of `operator T'.
1978 So, we find *all* the conversion operators, and then
1979 select from them. */
1982 methods = CLASSTYPE_METHOD_VEC (ctype);
1984 for (idx = CLASSTYPE_FIRST_CONVERSION_SLOT;
1985 VEC_iterate (tree, methods, idx, ovl);
1988 if (!DECL_CONV_FN_P (OVL_CURRENT (ovl)))
1989 /* There are no more conversion functions. */
1992 /* Glue all these conversion functions together
1993 with those we already have. */
1994 for (; ovl; ovl = OVL_NEXT (ovl))
1995 fns = ovl_cons (OVL_CURRENT (ovl), fns);
1999 if (fns == NULL_TREE)
2001 error ("no member function %qD declared in %qT", name, ctype);
2002 return error_mark_node;
2005 TREE_OPERAND (declarator, 0) = fns;
2008 /* Figure out what exactly is being specialized at this point.
2009 Note that for an explicit instantiation, even one for a
2010 member function, we cannot tell apriori whether the
2011 instantiation is for a member template, or just a member
2012 function of a template class. Even if a member template is
2013 being instantiated, the member template arguments may be
2014 elided if they can be deduced from the rest of the
2016 tmpl = determine_specialization (declarator, decl,
2018 member_specialization,
2021 if (!tmpl || tmpl == error_mark_node)
2022 /* We couldn't figure out what this declaration was
2024 return error_mark_node;
2027 tree gen_tmpl = most_general_template (tmpl);
2029 if (explicit_instantiation)
2031 /* We don't set DECL_EXPLICIT_INSTANTIATION here; that
2032 is done by do_decl_instantiation later. */
2034 int arg_depth = TMPL_ARGS_DEPTH (targs);
2035 int parm_depth = TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl));
2037 if (arg_depth > parm_depth)
2039 /* If TMPL is not the most general template (for
2040 example, if TMPL is a friend template that is
2041 injected into namespace scope), then there will
2042 be too many levels of TARGS. Remove some of them
2047 new_targs = make_tree_vec (parm_depth);
2048 for (i = arg_depth - parm_depth; i < arg_depth; ++i)
2049 TREE_VEC_ELT (new_targs, i - (arg_depth - parm_depth))
2050 = TREE_VEC_ELT (targs, i);
2054 return instantiate_template (tmpl, targs, tf_error);
2057 /* If we thought that the DECL was a member function, but it
2058 turns out to be specializing a static member function,
2059 make DECL a static member function as well. */
2060 if (DECL_STATIC_FUNCTION_P (tmpl)
2061 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl))
2062 revert_static_member_fn (decl);
2064 /* If this is a specialization of a member template of a
2065 template class. In we want to return the TEMPLATE_DECL,
2066 not the specialization of it. */
2067 if (tsk == tsk_template)
2069 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl);
2070 DECL_INITIAL (DECL_TEMPLATE_RESULT (tmpl)) = NULL_TREE;
2073 DECL_SOURCE_LOCATION (tmpl) = DECL_SOURCE_LOCATION (decl);
2074 DECL_SOURCE_LOCATION (DECL_TEMPLATE_RESULT (tmpl))
2075 = DECL_SOURCE_LOCATION (decl);
2076 /* We want to use the argument list specified in the
2077 definition, not in the original declaration. */
2078 DECL_ARGUMENTS (DECL_TEMPLATE_RESULT (tmpl))
2079 = DECL_ARGUMENTS (decl);
2084 /* Set up the DECL_TEMPLATE_INFO for DECL. */
2085 DECL_TEMPLATE_INFO (decl) = tree_cons (tmpl, targs, NULL_TREE);
2087 /* Inherit default function arguments from the template
2088 DECL is specializing. */
2089 copy_default_args_to_explicit_spec (decl);
2091 /* This specialization has the same protection as the
2092 template it specializes. */
2093 TREE_PRIVATE (decl) = TREE_PRIVATE (gen_tmpl);
2094 TREE_PROTECTED (decl) = TREE_PROTECTED (gen_tmpl);
2096 if (is_friend && !have_def)
2097 /* This is not really a declaration of a specialization.
2098 It's just the name of an instantiation. But, it's not
2099 a request for an instantiation, either. */
2100 SET_DECL_IMPLICIT_INSTANTIATION (decl);
2101 else if (DECL_CONSTRUCTOR_P (decl) || DECL_DESTRUCTOR_P (decl))
2102 /* This is indeed a specialization. In case of constructors
2103 and destructors, we need in-charge and not-in-charge
2104 versions in V3 ABI. */
2105 clone_function_decl (decl, /*update_method_vec_p=*/0);
2107 /* Register this specialization so that we can find it
2109 decl = register_specialization (decl, gen_tmpl, targs);
2116 /* Returns 1 iff PARMS1 and PARMS2 are identical sets of template
2117 parameters. These are represented in the same format used for
2118 DECL_TEMPLATE_PARMS. */
2121 comp_template_parms (tree parms1, tree parms2)
2126 if (parms1 == parms2)
2129 for (p1 = parms1, p2 = parms2;
2130 p1 != NULL_TREE && p2 != NULL_TREE;
2131 p1 = TREE_CHAIN (p1), p2 = TREE_CHAIN (p2))
2133 tree t1 = TREE_VALUE (p1);
2134 tree t2 = TREE_VALUE (p2);
2137 gcc_assert (TREE_CODE (t1) == TREE_VEC);
2138 gcc_assert (TREE_CODE (t2) == TREE_VEC);
2140 if (TREE_VEC_LENGTH (t1) != TREE_VEC_LENGTH (t2))
2143 for (i = 0; i < TREE_VEC_LENGTH (t2); ++i)
2145 tree parm1 = TREE_VALUE (TREE_VEC_ELT (t1, i));
2146 tree parm2 = TREE_VALUE (TREE_VEC_ELT (t2, i));
2148 if (TREE_CODE (parm1) != TREE_CODE (parm2))
2151 if (TREE_CODE (parm1) == TEMPLATE_TYPE_PARM)
2153 else if (!same_type_p (TREE_TYPE (parm1), TREE_TYPE (parm2)))
2158 if ((p1 != NULL_TREE) != (p2 != NULL_TREE))
2159 /* One set of parameters has more parameters lists than the
2166 /* Complain if DECL shadows a template parameter.
2168 [temp.local]: A template-parameter shall not be redeclared within its
2169 scope (including nested scopes). */
2172 check_template_shadow (tree decl)
2176 /* If we're not in a template, we can't possibly shadow a template
2178 if (!current_template_parms)
2181 /* Figure out what we're shadowing. */
2182 if (TREE_CODE (decl) == OVERLOAD)
2183 decl = OVL_CURRENT (decl);
2184 olddecl = innermost_non_namespace_value (DECL_NAME (decl));
2186 /* If there's no previous binding for this name, we're not shadowing
2187 anything, let alone a template parameter. */
2191 /* If we're not shadowing a template parameter, we're done. Note
2192 that OLDDECL might be an OVERLOAD (or perhaps even an
2193 ERROR_MARK), so we can't just blithely assume it to be a _DECL
2195 if (!DECL_P (olddecl) || !DECL_TEMPLATE_PARM_P (olddecl))
2198 /* We check for decl != olddecl to avoid bogus errors for using a
2199 name inside a class. We check TPFI to avoid duplicate errors for
2200 inline member templates. */
2202 || TEMPLATE_PARMS_FOR_INLINE (current_template_parms))
2205 cp_error_at ("declaration of %q#D", decl);
2206 cp_error_at (" shadows template parm %q#D", olddecl);
2209 /* Return a new TEMPLATE_PARM_INDEX with the indicated INDEX, LEVEL,
2210 ORIG_LEVEL, DECL, and TYPE. */
2213 build_template_parm_index (int index,
2219 tree t = make_node (TEMPLATE_PARM_INDEX);
2220 TEMPLATE_PARM_IDX (t) = index;
2221 TEMPLATE_PARM_LEVEL (t) = level;
2222 TEMPLATE_PARM_ORIG_LEVEL (t) = orig_level;
2223 TEMPLATE_PARM_DECL (t) = decl;
2224 TREE_TYPE (t) = type;
2225 TREE_CONSTANT (t) = TREE_CONSTANT (decl);
2226 TREE_INVARIANT (t) = TREE_INVARIANT (decl);
2227 TREE_READONLY (t) = TREE_READONLY (decl);
2232 /* Return a TEMPLATE_PARM_INDEX, similar to INDEX, but whose
2233 TEMPLATE_PARM_LEVEL has been decreased by LEVELS. If such a
2234 TEMPLATE_PARM_INDEX already exists, it is returned; otherwise, a
2235 new one is created. */
2238 reduce_template_parm_level (tree index, tree type, int levels)
2240 if (TEMPLATE_PARM_DESCENDANTS (index) == NULL_TREE
2241 || (TEMPLATE_PARM_LEVEL (TEMPLATE_PARM_DESCENDANTS (index))
2242 != TEMPLATE_PARM_LEVEL (index) - levels))
2244 tree orig_decl = TEMPLATE_PARM_DECL (index);
2247 decl = build_decl (TREE_CODE (orig_decl), DECL_NAME (orig_decl), type);
2248 TREE_CONSTANT (decl) = TREE_CONSTANT (orig_decl);
2249 TREE_INVARIANT (decl) = TREE_INVARIANT (orig_decl);
2250 TREE_READONLY (decl) = TREE_READONLY (orig_decl);
2251 DECL_ARTIFICIAL (decl) = 1;
2252 SET_DECL_TEMPLATE_PARM_P (decl);
2254 t = build_template_parm_index (TEMPLATE_PARM_IDX (index),
2255 TEMPLATE_PARM_LEVEL (index) - levels,
2256 TEMPLATE_PARM_ORIG_LEVEL (index),
2258 TEMPLATE_PARM_DESCENDANTS (index) = t;
2260 /* Template template parameters need this. */
2261 DECL_TEMPLATE_PARMS (decl)
2262 = DECL_TEMPLATE_PARMS (TEMPLATE_PARM_DECL (index));
2265 return TEMPLATE_PARM_DESCENDANTS (index);
2268 /* Process information from new template parameter NEXT and append it to the
2269 LIST being built. This new parameter is a non-type parameter iff
2270 IS_NON_TYPE is true. */
2273 process_template_parm (tree list, tree next, bool is_non_type)
2281 gcc_assert (TREE_CODE (parm) == TREE_LIST);
2282 defval = TREE_PURPOSE (parm);
2286 tree p = TREE_VALUE (tree_last (list));
2288 if (TREE_CODE (p) == TYPE_DECL || TREE_CODE (p) == TEMPLATE_DECL)
2289 idx = TEMPLATE_TYPE_IDX (TREE_TYPE (p));
2291 idx = TEMPLATE_PARM_IDX (DECL_INITIAL (p));
2299 parm = TREE_VALUE (parm);
2301 SET_DECL_TEMPLATE_PARM_P (parm);
2305 The top-level cv-qualifiers on the template-parameter are
2306 ignored when determining its type. */
2307 TREE_TYPE (parm) = TYPE_MAIN_VARIANT (TREE_TYPE (parm));
2309 /* A template parameter is not modifiable. */
2310 TREE_CONSTANT (parm) = 1;
2311 TREE_INVARIANT (parm) = 1;
2312 TREE_READONLY (parm) = 1;
2313 if (invalid_nontype_parm_type_p (TREE_TYPE (parm), 1))
2314 TREE_TYPE (parm) = void_type_node;
2315 decl = build_decl (CONST_DECL, DECL_NAME (parm), TREE_TYPE (parm));
2316 TREE_CONSTANT (decl) = 1;
2317 TREE_INVARIANT (decl) = 1;
2318 TREE_READONLY (decl) = 1;
2319 DECL_INITIAL (parm) = DECL_INITIAL (decl)
2320 = build_template_parm_index (idx, processing_template_decl,
2321 processing_template_decl,
2322 decl, TREE_TYPE (parm));
2327 parm = TREE_VALUE (TREE_VALUE (parm));
2329 if (parm && TREE_CODE (parm) == TEMPLATE_DECL)
2331 t = make_aggr_type (TEMPLATE_TEMPLATE_PARM);
2332 /* This is for distinguishing between real templates and template
2333 template parameters */
2334 TREE_TYPE (parm) = t;
2335 TREE_TYPE (DECL_TEMPLATE_RESULT (parm)) = t;
2340 t = make_aggr_type (TEMPLATE_TYPE_PARM);
2341 /* parm is either IDENTIFIER_NODE or NULL_TREE. */
2342 decl = build_decl (TYPE_DECL, parm, t);
2345 TYPE_NAME (t) = decl;
2346 TYPE_STUB_DECL (t) = decl;
2348 TEMPLATE_TYPE_PARM_INDEX (t)
2349 = build_template_parm_index (idx, processing_template_decl,
2350 processing_template_decl,
2351 decl, TREE_TYPE (parm));
2353 DECL_ARTIFICIAL (decl) = 1;
2354 SET_DECL_TEMPLATE_PARM_P (decl);
2356 parm = build_tree_list (defval, parm);
2357 return chainon (list, parm);
2360 /* The end of a template parameter list has been reached. Process the
2361 tree list into a parameter vector, converting each parameter into a more
2362 useful form. Type parameters are saved as IDENTIFIER_NODEs, and others
2366 end_template_parm_list (tree parms)
2370 tree saved_parmlist = make_tree_vec (list_length (parms));
2372 current_template_parms
2373 = tree_cons (size_int (processing_template_decl),
2374 saved_parmlist, current_template_parms);
2376 for (parm = parms, nparms = 0; parm; parm = next, nparms++)
2378 next = TREE_CHAIN (parm);
2379 TREE_VEC_ELT (saved_parmlist, nparms) = parm;
2380 TREE_CHAIN (parm) = NULL_TREE;
2383 --processing_template_parmlist;
2385 return saved_parmlist;
2388 /* end_template_decl is called after a template declaration is seen. */
2391 end_template_decl (void)
2393 reset_specialization ();
2395 if (! processing_template_decl)
2398 /* This matches the pushlevel in begin_template_parm_list. */
2401 --processing_template_decl;
2402 current_template_parms = TREE_CHAIN (current_template_parms);
2405 /* Given a template argument vector containing the template PARMS.
2406 The innermost PARMS are given first. */
2409 current_template_args (void)
2412 tree args = NULL_TREE;
2413 int length = TMPL_PARMS_DEPTH (current_template_parms);
2416 /* If there is only one level of template parameters, we do not
2417 create a TREE_VEC of TREE_VECs. Instead, we return a single
2418 TREE_VEC containing the arguments. */
2420 args = make_tree_vec (length);
2422 for (header = current_template_parms; header; header = TREE_CHAIN (header))
2424 tree a = copy_node (TREE_VALUE (header));
2427 TREE_TYPE (a) = NULL_TREE;
2428 for (i = TREE_VEC_LENGTH (a) - 1; i >= 0; --i)
2430 tree t = TREE_VEC_ELT (a, i);
2432 /* T will be a list if we are called from within a
2433 begin/end_template_parm_list pair, but a vector directly
2434 if within a begin/end_member_template_processing pair. */
2435 if (TREE_CODE (t) == TREE_LIST)
2439 if (TREE_CODE (t) == TYPE_DECL
2440 || TREE_CODE (t) == TEMPLATE_DECL)
2443 t = DECL_INITIAL (t);
2444 TREE_VEC_ELT (a, i) = t;
2449 TREE_VEC_ELT (args, --l) = a;
2457 /* Return a TEMPLATE_DECL corresponding to DECL, using the indicated
2458 template PARMS. If MEMBER_TEMPLATE_P is true, the new template is
2459 a member template. Used by push_template_decl below. */
2462 build_template_decl (tree decl, tree parms, bool member_template_p)
2464 tree tmpl = build_lang_decl (TEMPLATE_DECL, DECL_NAME (decl), NULL_TREE);
2465 DECL_TEMPLATE_PARMS (tmpl) = parms;
2466 DECL_CONTEXT (tmpl) = DECL_CONTEXT (decl);
2467 DECL_MEMBER_TEMPLATE_P (tmpl) = member_template_p;
2468 if (DECL_LANG_SPECIFIC (decl))
2470 DECL_STATIC_FUNCTION_P (tmpl) = DECL_STATIC_FUNCTION_P (decl);
2471 DECL_CONSTRUCTOR_P (tmpl) = DECL_CONSTRUCTOR_P (decl);
2472 DECL_DESTRUCTOR_P (tmpl) = DECL_DESTRUCTOR_P (decl);
2473 DECL_NONCONVERTING_P (tmpl) = DECL_NONCONVERTING_P (decl);
2474 DECL_ASSIGNMENT_OPERATOR_P (tmpl) = DECL_ASSIGNMENT_OPERATOR_P (decl);
2475 if (DECL_OVERLOADED_OPERATOR_P (decl))
2476 SET_OVERLOADED_OPERATOR_CODE (tmpl,
2477 DECL_OVERLOADED_OPERATOR_P (decl));
2483 struct template_parm_data
2485 /* The level of the template parameters we are currently
2489 /* The index of the specialization argument we are currently
2493 /* An array whose size is the number of template parameters. The
2494 elements are nonzero if the parameter has been used in any one
2495 of the arguments processed so far. */
2498 /* An array whose size is the number of template arguments. The
2499 elements are nonzero if the argument makes use of template
2500 parameters of this level. */
2501 int* arg_uses_template_parms;
2504 /* Subroutine of push_template_decl used to see if each template
2505 parameter in a partial specialization is used in the explicit
2506 argument list. If T is of the LEVEL given in DATA (which is
2507 treated as a template_parm_data*), then DATA->PARMS is marked
2511 mark_template_parm (tree t, void* data)
2515 struct template_parm_data* tpd = (struct template_parm_data*) data;
2517 if (TREE_CODE (t) == TEMPLATE_PARM_INDEX)
2519 level = TEMPLATE_PARM_LEVEL (t);
2520 idx = TEMPLATE_PARM_IDX (t);
2524 level = TEMPLATE_TYPE_LEVEL (t);
2525 idx = TEMPLATE_TYPE_IDX (t);
2528 if (level == tpd->level)
2530 tpd->parms[idx] = 1;
2531 tpd->arg_uses_template_parms[tpd->current_arg] = 1;
2534 /* Return zero so that for_each_template_parm will continue the
2535 traversal of the tree; we want to mark *every* template parm. */
2539 /* Process the partial specialization DECL. */
2542 process_partial_specialization (tree decl)
2544 tree type = TREE_TYPE (decl);
2545 tree maintmpl = CLASSTYPE_TI_TEMPLATE (type);
2546 tree specargs = CLASSTYPE_TI_ARGS (type);
2547 tree inner_args = INNERMOST_TEMPLATE_ARGS (specargs);
2548 tree inner_parms = INNERMOST_TEMPLATE_PARMS (current_template_parms);
2549 tree main_inner_parms = DECL_INNERMOST_TEMPLATE_PARMS (maintmpl);
2550 int nargs = TREE_VEC_LENGTH (inner_args);
2551 int ntparms = TREE_VEC_LENGTH (inner_parms);
2553 int did_error_intro = 0;
2554 struct template_parm_data tpd;
2555 struct template_parm_data tpd2;
2557 /* We check that each of the template parameters given in the
2558 partial specialization is used in the argument list to the
2559 specialization. For example:
2561 template <class T> struct S;
2562 template <class T> struct S<T*>;
2564 The second declaration is OK because `T*' uses the template
2565 parameter T, whereas
2567 template <class T> struct S<int>;
2569 is no good. Even trickier is:
2580 The S2<T> declaration is actually invalid; it is a
2581 full-specialization. Of course,
2584 struct S2<T (*)(U)>;
2586 or some such would have been OK. */
2587 tpd.level = TMPL_PARMS_DEPTH (current_template_parms);
2588 tpd.parms = alloca (sizeof (int) * ntparms);
2589 memset (tpd.parms, 0, sizeof (int) * ntparms);
2591 tpd.arg_uses_template_parms = alloca (sizeof (int) * nargs);
2592 memset (tpd.arg_uses_template_parms, 0, sizeof (int) * nargs);
2593 for (i = 0; i < nargs; ++i)
2595 tpd.current_arg = i;
2596 for_each_template_parm (TREE_VEC_ELT (inner_args, i),
2597 &mark_template_parm,
2601 for (i = 0; i < ntparms; ++i)
2602 if (tpd.parms[i] == 0)
2604 /* One of the template parms was not used in the
2606 if (!did_error_intro)
2608 error ("template parameters not used in partial specialization:");
2609 did_error_intro = 1;
2612 error (" %qD", TREE_VALUE (TREE_VEC_ELT (inner_parms, i)));
2615 /* [temp.class.spec]
2617 The argument list of the specialization shall not be identical to
2618 the implicit argument list of the primary template. */
2619 if (comp_template_args
2621 INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE
2623 error ("partial specialization %qT does not specialize any template arguments", type);
2625 /* [temp.class.spec]
2627 A partially specialized non-type argument expression shall not
2628 involve template parameters of the partial specialization except
2629 when the argument expression is a simple identifier.
2631 The type of a template parameter corresponding to a specialized
2632 non-type argument shall not be dependent on a parameter of the
2634 gcc_assert (nargs == DECL_NTPARMS (maintmpl));
2636 for (i = 0; i < nargs; ++i)
2638 tree arg = TREE_VEC_ELT (inner_args, i);
2639 if (/* These first two lines are the `non-type' bit. */
2641 && TREE_CODE (arg) != TEMPLATE_DECL
2642 /* This next line is the `argument expression is not just a
2643 simple identifier' condition and also the `specialized
2644 non-type argument' bit. */
2645 && TREE_CODE (arg) != TEMPLATE_PARM_INDEX)
2647 if (tpd.arg_uses_template_parms[i])
2648 error ("template argument %qE involves template parameter(s)", arg);
2651 /* Look at the corresponding template parameter,
2652 marking which template parameters its type depends
2655 TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (main_inner_parms,
2660 /* We haven't yet initialized TPD2. Do so now. */
2661 tpd2.arg_uses_template_parms
2662 = alloca (sizeof (int) * nargs);
2663 /* The number of parameters here is the number in the
2664 main template, which, as checked in the assertion
2666 tpd2.parms = alloca (sizeof (int) * nargs);
2668 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (maintmpl));
2671 /* Mark the template parameters. But this time, we're
2672 looking for the template parameters of the main
2673 template, not in the specialization. */
2674 tpd2.current_arg = i;
2675 tpd2.arg_uses_template_parms[i] = 0;
2676 memset (tpd2.parms, 0, sizeof (int) * nargs);
2677 for_each_template_parm (type,
2678 &mark_template_parm,
2682 if (tpd2.arg_uses_template_parms [i])
2684 /* The type depended on some template parameters.
2685 If they are fully specialized in the
2686 specialization, that's OK. */
2688 for (j = 0; j < nargs; ++j)
2689 if (tpd2.parms[j] != 0
2690 && tpd.arg_uses_template_parms [j])
2692 error ("type %qT of template argument %qE depends "
2693 "on template parameter(s)",
2703 if (retrieve_specialization (maintmpl, specargs,
2704 /*class_specializations_p=*/true))
2705 /* We've already got this specialization. */
2708 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl)
2709 = tree_cons (inner_args, inner_parms,
2710 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl));
2711 TREE_TYPE (DECL_TEMPLATE_SPECIALIZATIONS (maintmpl)) = type;
2715 /* Check that a template declaration's use of default arguments is not
2716 invalid. Here, PARMS are the template parameters. IS_PRIMARY is
2717 nonzero if DECL is the thing declared by a primary template.
2718 IS_PARTIAL is nonzero if DECL is a partial specialization. */
2721 check_default_tmpl_args (tree decl, tree parms, int is_primary, int is_partial)
2724 int last_level_to_check;
2729 A default template-argument shall not be specified in a
2730 function template declaration or a function template definition, nor
2731 in the template-parameter-list of the definition of a member of a
2734 if (TREE_CODE (CP_DECL_CONTEXT (decl)) == FUNCTION_DECL)
2735 /* You can't have a function template declaration in a local
2736 scope, nor you can you define a member of a class template in a
2740 if (current_class_type
2741 && !TYPE_BEING_DEFINED (current_class_type)
2742 && DECL_LANG_SPECIFIC (decl)
2743 /* If this is either a friend defined in the scope of the class
2744 or a member function. */
2745 && (DECL_FUNCTION_MEMBER_P (decl)
2746 ? same_type_p (DECL_CONTEXT (decl), current_class_type)
2747 : DECL_FRIEND_CONTEXT (decl)
2748 ? same_type_p (DECL_FRIEND_CONTEXT (decl), current_class_type)
2750 /* And, if it was a member function, it really was defined in
2751 the scope of the class. */
2752 && (!DECL_FUNCTION_MEMBER_P (decl)
2753 || DECL_INITIALIZED_IN_CLASS_P (decl)))
2754 /* We already checked these parameters when the template was
2755 declared, so there's no need to do it again now. This function
2756 was defined in class scope, but we're processing it's body now
2757 that the class is complete. */
2762 If a template-parameter has a default template-argument, all
2763 subsequent template-parameters shall have a default
2764 template-argument supplied. */
2765 for (parm_level = parms; parm_level; parm_level = TREE_CHAIN (parm_level))
2767 tree inner_parms = TREE_VALUE (parm_level);
2768 int ntparms = TREE_VEC_LENGTH (inner_parms);
2769 int seen_def_arg_p = 0;
2772 for (i = 0; i < ntparms; ++i)
2774 tree parm = TREE_VEC_ELT (inner_parms, i);
2775 if (TREE_PURPOSE (parm))
2777 else if (seen_def_arg_p)
2779 error ("no default argument for %qD", TREE_VALUE (parm));
2780 /* For better subsequent error-recovery, we indicate that
2781 there should have been a default argument. */
2782 TREE_PURPOSE (parm) = error_mark_node;
2787 if (TREE_CODE (decl) != TYPE_DECL || is_partial || !is_primary)
2788 /* For an ordinary class template, default template arguments are
2789 allowed at the innermost level, e.g.:
2790 template <class T = int>
2792 but, in a partial specialization, they're not allowed even
2793 there, as we have in [temp.class.spec]:
2795 The template parameter list of a specialization shall not
2796 contain default template argument values.
2798 So, for a partial specialization, or for a function template,
2799 we look at all of them. */
2802 /* But, for a primary class template that is not a partial
2803 specialization we look at all template parameters except the
2805 parms = TREE_CHAIN (parms);
2807 /* Figure out what error message to issue. */
2808 if (TREE_CODE (decl) == FUNCTION_DECL)
2809 msg = "default template arguments may not be used in function templates";
2810 else if (is_partial)
2811 msg = "default template arguments may not be used in partial specializations";
2813 msg = "default argument for template parameter for class enclosing %qD";
2815 if (current_class_type && TYPE_BEING_DEFINED (current_class_type))
2816 /* If we're inside a class definition, there's no need to
2817 examine the parameters to the class itself. On the one
2818 hand, they will be checked when the class is defined, and,
2819 on the other, default arguments are valid in things like:
2820 template <class T = double>
2821 struct S { template <class U> void f(U); };
2822 Here the default argument for `S' has no bearing on the
2823 declaration of `f'. */
2824 last_level_to_check = template_class_depth (current_class_type) + 1;
2826 /* Check everything. */
2827 last_level_to_check = 0;
2829 for (parm_level = parms;
2830 parm_level && TMPL_PARMS_DEPTH (parm_level) >= last_level_to_check;
2831 parm_level = TREE_CHAIN (parm_level))
2833 tree inner_parms = TREE_VALUE (parm_level);
2837 ntparms = TREE_VEC_LENGTH (inner_parms);
2838 for (i = 0; i < ntparms; ++i)
2839 if (TREE_PURPOSE (TREE_VEC_ELT (inner_parms, i)))
2847 /* Clear out the default argument so that we are not
2849 TREE_PURPOSE (TREE_VEC_ELT (inner_parms, i)) = NULL_TREE;
2852 /* At this point, if we're still interested in issuing messages,
2853 they must apply to classes surrounding the object declared. */
2855 msg = "default argument for template parameter for class enclosing %qD";
2859 /* Worker for push_template_decl_real, called via
2860 for_each_template_parm. DATA is really an int, indicating the
2861 level of the parameters we are interested in. If T is a template
2862 parameter of that level, return nonzero. */
2865 template_parm_this_level_p (tree t, void* data)
2867 int this_level = *(int *)data;
2870 if (TREE_CODE (t) == TEMPLATE_PARM_INDEX)
2871 level = TEMPLATE_PARM_LEVEL (t);
2873 level = TEMPLATE_TYPE_LEVEL (t);
2874 return level == this_level;
2877 /* Creates a TEMPLATE_DECL for the indicated DECL using the template
2878 parameters given by current_template_args, or reuses a
2879 previously existing one, if appropriate. Returns the DECL, or an
2880 equivalent one, if it is replaced via a call to duplicate_decls.
2882 If IS_FRIEND is nonzero, DECL is a friend declaration. */
2885 push_template_decl_real (tree decl, int is_friend)
2893 int new_template_p = 0;
2894 /* True if the template is a member template, in the sense of
2896 bool member_template_p = false;
2898 if (decl == error_mark_node)
2901 /* See if this is a partial specialization. */
2902 is_partial = (DECL_IMPLICIT_TYPEDEF_P (decl)
2903 && TREE_CODE (TREE_TYPE (decl)) != ENUMERAL_TYPE
2904 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl)));
2906 is_friend |= (TREE_CODE (decl) == FUNCTION_DECL && DECL_FRIEND_P (decl));
2909 /* For a friend, we want the context of the friend function, not
2910 the type of which it is a friend. */
2911 ctx = DECL_CONTEXT (decl);
2912 else if (CP_DECL_CONTEXT (decl)
2913 && TREE_CODE (CP_DECL_CONTEXT (decl)) != NAMESPACE_DECL)
2914 /* In the case of a virtual function, we want the class in which
2916 ctx = CP_DECL_CONTEXT (decl);
2918 /* Otherwise, if we're currently defining some class, the DECL
2919 is assumed to be a member of the class. */
2920 ctx = current_scope ();
2922 if (ctx && TREE_CODE (ctx) == NAMESPACE_DECL)
2925 if (!DECL_CONTEXT (decl))
2926 DECL_CONTEXT (decl) = FROB_CONTEXT (current_namespace);
2928 /* See if this is a primary template. */
2929 primary = template_parm_scope_p ();
2933 if (DECL_CLASS_SCOPE_P (decl))
2934 member_template_p = true;
2935 if (current_lang_name == lang_name_c)
2936 error ("template with C linkage");
2937 else if (TREE_CODE (decl) == TYPE_DECL
2938 && ANON_AGGRNAME_P (DECL_NAME (decl)))
2939 error ("template class without a name");
2940 else if (TREE_CODE (decl) == FUNCTION_DECL)
2942 if (DECL_DESTRUCTOR_P (decl))
2946 A destructor shall not be a member template. */
2947 error ("destructor %qD declared as member template", decl);
2948 return error_mark_node;
2950 if (NEW_DELETE_OPNAME_P (DECL_NAME (decl))
2951 && (!TYPE_ARG_TYPES (TREE_TYPE (decl))
2952 || TYPE_ARG_TYPES (TREE_TYPE (decl)) == void_list_node
2953 || !TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl)))
2954 || (TREE_CHAIN (TYPE_ARG_TYPES ((TREE_TYPE (decl))))
2955 == void_list_node)))
2957 /* [basic.stc.dynamic.allocation]
2959 An allocation function can be a function
2960 template. ... Template allocation functions shall
2961 have two or more parameters. */
2962 error ("invalid template declaration of %qD", decl);
2966 else if ((DECL_IMPLICIT_TYPEDEF_P (decl)
2967 && CLASS_TYPE_P (TREE_TYPE (decl)))
2968 || (TREE_CODE (decl) == VAR_DECL && ctx && CLASS_TYPE_P (ctx)))
2972 error ("template declaration of %q#D", decl);
2973 return error_mark_node;
2977 /* Check to see that the rules regarding the use of default
2978 arguments are not being violated. */
2979 check_default_tmpl_args (decl, current_template_parms,
2980 primary, is_partial);
2983 return process_partial_specialization (decl);
2985 args = current_template_args ();
2988 || TREE_CODE (ctx) == FUNCTION_DECL
2989 || (CLASS_TYPE_P (ctx) && TYPE_BEING_DEFINED (ctx))
2990 || (is_friend && !DECL_TEMPLATE_INFO (decl)))
2992 if (DECL_LANG_SPECIFIC (decl)
2993 && DECL_TEMPLATE_INFO (decl)
2994 && DECL_TI_TEMPLATE (decl))
2995 tmpl = DECL_TI_TEMPLATE (decl);
2996 /* If DECL is a TYPE_DECL for a class-template, then there won't
2997 be DECL_LANG_SPECIFIC. The information equivalent to
2998 DECL_TEMPLATE_INFO is found in TYPE_TEMPLATE_INFO instead. */
2999 else if (DECL_IMPLICIT_TYPEDEF_P (decl)
3000 && TYPE_TEMPLATE_INFO (TREE_TYPE (decl))
3001 && TYPE_TI_TEMPLATE (TREE_TYPE (decl)))
3003 /* Since a template declaration already existed for this
3004 class-type, we must be redeclaring it here. Make sure
3005 that the redeclaration is valid. */
3006 redeclare_class_template (TREE_TYPE (decl),
3007 current_template_parms);
3008 /* We don't need to create a new TEMPLATE_DECL; just use the
3009 one we already had. */
3010 tmpl = TYPE_TI_TEMPLATE (TREE_TYPE (decl));
3014 tmpl = build_template_decl (decl, current_template_parms,
3018 if (DECL_LANG_SPECIFIC (decl)
3019 && DECL_TEMPLATE_SPECIALIZATION (decl))
3021 /* A specialization of a member template of a template
3023 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl);
3024 DECL_TEMPLATE_INFO (tmpl) = DECL_TEMPLATE_INFO (decl);
3025 DECL_TEMPLATE_INFO (decl) = NULL_TREE;
3031 tree a, t, current, parms;
3034 if (TREE_CODE (decl) == TYPE_DECL)
3036 if ((IS_AGGR_TYPE_CODE (TREE_CODE (TREE_TYPE (decl)))
3037 || TREE_CODE (TREE_TYPE (decl)) == ENUMERAL_TYPE)
3038 && TYPE_TEMPLATE_INFO (TREE_TYPE (decl))
3039 && TYPE_TI_TEMPLATE (TREE_TYPE (decl)))
3040 tmpl = TYPE_TI_TEMPLATE (TREE_TYPE (decl));
3043 error ("%qD does not declare a template type", decl);
3047 else if (!DECL_LANG_SPECIFIC (decl) || !DECL_TEMPLATE_INFO (decl))
3049 error ("template definition of non-template %q#D", decl);
3053 tmpl = DECL_TI_TEMPLATE (decl);
3055 if (DECL_FUNCTION_TEMPLATE_P (tmpl)
3056 && DECL_TEMPLATE_INFO (decl) && DECL_TI_ARGS (decl)
3057 && DECL_TEMPLATE_SPECIALIZATION (decl)
3058 && DECL_MEMBER_TEMPLATE_P (tmpl))
3062 /* The declaration is a specialization of a member
3063 template, declared outside the class. Therefore, the
3064 innermost template arguments will be NULL, so we
3065 replace them with the arguments determined by the
3066 earlier call to check_explicit_specialization. */
3067 args = DECL_TI_ARGS (decl);
3070 = build_template_decl (decl, current_template_parms,
3072 DECL_TEMPLATE_RESULT (new_tmpl) = decl;
3073 TREE_TYPE (new_tmpl) = TREE_TYPE (decl);
3074 DECL_TI_TEMPLATE (decl) = new_tmpl;
3075 SET_DECL_TEMPLATE_SPECIALIZATION (new_tmpl);
3076 DECL_TEMPLATE_INFO (new_tmpl)
3077 = tree_cons (tmpl, args, NULL_TREE);
3079 register_specialization (new_tmpl,
3080 most_general_template (tmpl),
3085 /* Make sure the template headers we got make sense. */
3087 parms = DECL_TEMPLATE_PARMS (tmpl);
3088 i = TMPL_PARMS_DEPTH (parms);
3089 if (TMPL_ARGS_DEPTH (args) != i)
3091 error ("expected %d levels of template parms for %q#D, got %d",
3092 i, decl, TMPL_ARGS_DEPTH (args));
3095 for (current = decl; i > 0; --i, parms = TREE_CHAIN (parms))
3097 a = TMPL_ARGS_LEVEL (args, i);
3098 t = INNERMOST_TEMPLATE_PARMS (parms);
3100 if (TREE_VEC_LENGTH (t) != TREE_VEC_LENGTH (a))
3102 if (current == decl)
3103 error ("got %d template parameters for %q#D",
3104 TREE_VEC_LENGTH (a), decl);
3106 error ("got %d template parameters for %q#T",
3107 TREE_VEC_LENGTH (a), current);
3108 error (" but %d required", TREE_VEC_LENGTH (t));
3111 /* Perhaps we should also check that the parms are used in the
3112 appropriate qualifying scopes in the declarator? */
3114 if (current == decl)
3117 current = TYPE_CONTEXT (current);
3121 DECL_TEMPLATE_RESULT (tmpl) = decl;
3122 TREE_TYPE (tmpl) = TREE_TYPE (decl);
3124 /* Push template declarations for global functions and types. Note
3125 that we do not try to push a global template friend declared in a
3126 template class; such a thing may well depend on the template
3127 parameters of the class. */
3128 if (new_template_p && !ctx
3129 && !(is_friend && template_class_depth (current_class_type) > 0))
3131 tmpl = pushdecl_namespace_level (tmpl);
3132 if (tmpl == error_mark_node)
3133 return error_mark_node;
3135 /* Hide template friend classes that haven't been declared yet. */
3136 if (is_friend && TREE_CODE (decl) == TYPE_DECL)
3138 DECL_ANTICIPATED (tmpl) = 1;
3139 DECL_FRIEND_P (tmpl) = 1;
3145 DECL_PRIMARY_TEMPLATE (tmpl) = tmpl;
3146 if (DECL_CONV_FN_P (tmpl))
3148 int depth = TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl));
3150 /* It is a conversion operator. See if the type converted to
3151 depends on innermost template operands. */
3153 if (uses_template_parms_level (TREE_TYPE (TREE_TYPE (tmpl)),
3155 DECL_TEMPLATE_CONV_FN_P (tmpl) = 1;
3159 /* The DECL_TI_ARGS of DECL contains full set of arguments referring
3160 back to its most general template. If TMPL is a specialization,
3161 ARGS may only have the innermost set of arguments. Add the missing
3162 argument levels if necessary. */
3163 if (DECL_TEMPLATE_INFO (tmpl))
3164 args = add_outermost_template_args (DECL_TI_ARGS (tmpl), args);
3166 info = tree_cons (tmpl, args, NULL_TREE);
3168 if (DECL_IMPLICIT_TYPEDEF_P (decl))
3170 SET_TYPE_TEMPLATE_INFO (TREE_TYPE (tmpl), info);
3171 if ((!ctx || TREE_CODE (ctx) != FUNCTION_DECL)
3172 && TREE_CODE (TREE_TYPE (decl)) != ENUMERAL_TYPE
3173 /* Don't change the name if we've already set it up. */
3174 && !IDENTIFIER_TEMPLATE (DECL_NAME (decl)))
3175 DECL_NAME (decl) = classtype_mangled_name (TREE_TYPE (decl));
3177 else if (DECL_LANG_SPECIFIC (decl))
3178 DECL_TEMPLATE_INFO (decl) = info;
3180 return DECL_TEMPLATE_RESULT (tmpl);
3184 push_template_decl (tree decl)
3186 return push_template_decl_real (decl, 0);
3189 /* Called when a class template TYPE is redeclared with the indicated
3190 template PARMS, e.g.:
3192 template <class T> struct S;
3193 template <class T> struct S {}; */
3196 redeclare_class_template (tree type, tree parms)
3202 if (!TYPE_TEMPLATE_INFO (type))
3204 error ("%qT is not a template type", type);
3208 tmpl = TYPE_TI_TEMPLATE (type);
3209 if (!PRIMARY_TEMPLATE_P (tmpl))
3210 /* The type is nested in some template class. Nothing to worry
3211 about here; there are no new template parameters for the nested
3217 error ("template specifiers not specified in declaration of %qD",
3222 parms = INNERMOST_TEMPLATE_PARMS (parms);
3223 tmpl_parms = DECL_INNERMOST_TEMPLATE_PARMS (tmpl);
3225 if (TREE_VEC_LENGTH (parms) != TREE_VEC_LENGTH (tmpl_parms))
3227 cp_error_at ("previous declaration %qD", tmpl);
3228 error ("used %d template parameter%s instead of %d",
3229 TREE_VEC_LENGTH (tmpl_parms),
3230 TREE_VEC_LENGTH (tmpl_parms) == 1 ? "" : "s",
3231 TREE_VEC_LENGTH (parms));
3235 for (i = 0; i < TREE_VEC_LENGTH (tmpl_parms); ++i)
3237 tree tmpl_parm = TREE_VALUE (TREE_VEC_ELT (tmpl_parms, i));
3238 tree parm = TREE_VALUE (TREE_VEC_ELT (parms, i));
3239 tree tmpl_default = TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms, i));
3240 tree parm_default = TREE_PURPOSE (TREE_VEC_ELT (parms, i));
3242 /* TMPL_PARM and PARM can be either TYPE_DECL, PARM_DECL, or
3244 if (TREE_CODE (tmpl_parm) != TREE_CODE (parm)
3245 || (TREE_CODE (tmpl_parm) != TYPE_DECL
3246 && !same_type_p (TREE_TYPE (tmpl_parm), TREE_TYPE (parm))))
3248 cp_error_at ("template parameter %q#D", tmpl_parm);
3249 error ("redeclared here as %q#D", parm);
3253 if (tmpl_default != NULL_TREE && parm_default != NULL_TREE)
3255 /* We have in [temp.param]:
3257 A template-parameter may not be given default arguments
3258 by two different declarations in the same scope. */
3259 error ("redefinition of default argument for %q#D", parm);
3260 error ("%J original definition appeared here", tmpl_parm);
3264 if (parm_default != NULL_TREE)
3265 /* Update the previous template parameters (which are the ones
3266 that will really count) with the new default value. */
3267 TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms, i)) = parm_default;
3268 else if (tmpl_default != NULL_TREE)
3269 /* Update the new parameters, too; they'll be used as the
3270 parameters for any members. */
3271 TREE_PURPOSE (TREE_VEC_ELT (parms, i)) = tmpl_default;
3275 /* Simplify EXPR if it is a non-dependent expression. Returns the
3276 (possibly simplified) expression. */
3279 fold_non_dependent_expr (tree expr)
3281 /* If we're in a template, but EXPR isn't value dependent, simplify
3282 it. We're supposed to treat:
3284 template <typename T> void f(T[1 + 1]);
3285 template <typename T> void f(T[2]);
3287 as two declarations of the same function, for example. */
3288 if (processing_template_decl
3289 && !type_dependent_expression_p (expr)
3290 && !value_dependent_expression_p (expr))
3292 HOST_WIDE_INT saved_processing_template_decl;
3294 saved_processing_template_decl = processing_template_decl;
3295 processing_template_decl = 0;
3296 expr = tsubst_copy_and_build (expr,
3299 /*in_decl=*/NULL_TREE,
3300 /*function_p=*/false);
3301 processing_template_decl = saved_processing_template_decl;
3306 /* EXPR is an expression which is used in a constant-expression context.
3307 For instance, it could be a VAR_DECL with a constant initializer.
3308 Extract the innest constant expression.
3310 This is basically a more powerful version of
3311 integral_constant_value, which can be used also in templates where
3312 initializers can maintain a syntactic rather than semantic form
3313 (even if they are non-dependent, for access-checking purposes). */
3316 fold_decl_constant_value (tree expr)
3318 tree const_expr = expr;
3321 expr = fold_non_dependent_expr (const_expr);
3322 const_expr = integral_constant_value (expr);
3324 while (expr != const_expr);
3329 /* Subroutine of convert_nontype_argument. Converts EXPR to TYPE, which
3330 must be a function or a pointer-to-function type, as specified
3331 in [temp.arg.nontype]: disambiguate EXPR if it is an overload set,
3332 and check that the resulting function has external linkage. */
3335 convert_nontype_argument_function (tree type, tree expr)
3340 fn = instantiate_type (type, fns, tf_none);
3341 if (fn == error_mark_node)
3342 return error_mark_node;
3345 if (TREE_CODE (fn_no_ptr) == ADDR_EXPR)
3346 fn_no_ptr = TREE_OPERAND (fn_no_ptr, 0);
3348 /* [temp.arg.nontype]/1
3350 A template-argument for a non-type, non-template template-parameter
3353 -- the address of an object or function with external linkage. */
3354 if (!DECL_EXTERNAL_LINKAGE_P (fn_no_ptr))
3356 error ("%qE is not a valid template argument for type %qT "
3357 "because function %qD has not external linkage",
3358 expr, type, fn_no_ptr);
3365 /* Attempt to convert the non-type template parameter EXPR to the
3366 indicated TYPE. If the conversion is successful, return the
3367 converted value. If the conversion is unsuccessful, return
3368 NULL_TREE if we issued an error message, or error_mark_node if we
3369 did not. We issue error messages for out-and-out bad template
3370 parameters, but not simply because the conversion failed, since we
3371 might be just trying to do argument deduction. Both TYPE and EXPR
3372 must be non-dependent.
3374 The conversion follows the special rules described in
3375 [temp.arg.nontype], and it is much more strict than an implicit
3378 This function is called twice for each template argument (see
3379 lookup_template_class for a more accurate description of this
3380 problem). This means that we need to handle expressions which
3381 are not valid in a C++ source, but can be created from the
3382 first call (for instance, casts to perform conversions). These
3383 hacks can go away after we fix the double coercion problem. */
3386 convert_nontype_argument (tree type, tree expr)
3390 /* Detect immediately string literals as invalid non-type argument.
3391 This special-case is not needed for correctness (we would easily
3392 catch this later), but only to provide better diagnostic for this
3393 common user mistake. As suggested by DR 100, we do not mention
3394 linkage issues in the diagnostic as this is not the point. */
3395 if (TREE_CODE (expr) == STRING_CST)
3397 error ("%qE is not a valid template argument for type %qT "
3398 "because string literals can never be used in this context",
3403 /* If we are in a template, EXPR may be non-dependent, but still
3404 have a syntactic, rather than semantic, form. For example, EXPR
3405 might be a SCOPE_REF, rather than the VAR_DECL to which the
3406 SCOPE_REF refers. Preserving the qualifying scope is necessary
3407 so that access checking can be performed when the template is
3408 instantiated -- but here we need the resolved form so that we can
3409 convert the argument. */
3410 expr = fold_non_dependent_expr (expr);
3411 expr_type = TREE_TYPE (expr);
3413 /* HACK: Due to double coercion, we can get a
3414 NOP_EXPR<REFERENCE_TYPE>(ADDR_EXPR<POINTER_TYPE> (arg)) here,
3415 which is the tree that we built on the first call (see
3416 below when coercing to reference to object or to reference to
3417 function). We just strip everything and get to the arg.
3418 See g++.old-deja/g++.oliva/template4.C and g++.dg/template/nontype9.C
3420 if (TREE_CODE (expr) == NOP_EXPR)
3422 if (TYPE_REF_OBJ_P (type) || TYPE_REFFN_P (type))
3424 /* ??? Maybe we could use convert_from_reference here, but we
3425 would need to relax its constraints because the NOP_EXPR
3426 could actually change the type to something more cv-qualified,
3427 and this is not folded by convert_from_reference. */
3428 tree addr = TREE_OPERAND (expr, 0);
3429 gcc_assert (TREE_CODE (expr_type) == REFERENCE_TYPE);
3430 gcc_assert (TREE_CODE (addr) == ADDR_EXPR);
3431 gcc_assert (TREE_CODE (TREE_TYPE (addr)) == POINTER_TYPE);
3432 gcc_assert (same_type_ignoring_top_level_qualifiers_p
3433 (TREE_TYPE (expr_type),
3434 TREE_TYPE (TREE_TYPE (addr))));
3436 expr = TREE_OPERAND (addr, 0);
3437 expr_type = TREE_TYPE (expr);
3440 /* We could also generate a NOP_EXPR(ADDR_EXPR()) when the
3441 parameter is a pointer to object, through decay and
3442 qualification conversion. Let's strip everything. */
3443 else if (TYPE_PTROBV_P (type))
3446 gcc_assert (TREE_CODE (expr) == ADDR_EXPR);
3447 gcc_assert (TREE_CODE (TREE_TYPE (expr)) == POINTER_TYPE);
3448 /* Skip the ADDR_EXPR only if it is part of the decay for
3449 an array. Otherwise, it is part of the original argument
3450 in the source code. */
3451 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (expr, 0))) == ARRAY_TYPE)
3452 expr = TREE_OPERAND (expr, 0);
3453 expr_type = TREE_TYPE (expr);
3457 /* [temp.arg.nontype]/5, bullet 1
3459 For a non-type template-parameter of integral or enumeration type,
3460 integral promotions (_conv.prom_) and integral conversions
3461 (_conv.integral_) are applied. */
3462 if (INTEGRAL_TYPE_P (type))
3464 if (!INTEGRAL_TYPE_P (expr_type))
3465 return error_mark_node;
3467 expr = fold_decl_constant_value (expr);
3468 /* Notice that there are constant expressions like '4 % 0' which
3469 do not fold into integer constants. */
3470 if (TREE_CODE (expr) != INTEGER_CST)
3472 error ("%qE is not a valid template argument for type %qT "
3473 "because it is a non-constant expression", expr, type);
3477 /* At this point, an implicit conversion does what we want,
3478 because we already know that the expression is of integral
3480 expr = ocp_convert (type, expr, CONV_IMPLICIT, LOOKUP_PROTECT);
3481 if (expr == error_mark_node)
3482 return error_mark_node;
3484 /* Conversion was allowed: fold it to a bare integer constant. */
3487 /* [temp.arg.nontype]/5, bullet 2
3489 For a non-type template-parameter of type pointer to object,
3490 qualification conversions (_conv.qual_) and the array-to-pointer
3491 conversion (_conv.array_) are applied. */
3492 else if (TYPE_PTROBV_P (type))
3494 /* [temp.arg.nontype]/1 (TC1 version, DR 49):
3496 A template-argument for a non-type, non-template template-parameter
3497 shall be one of: [...]
3499 -- the name of a non-type template-parameter;
3500 -- the address of an object or function with external linkage, [...]
3501 expressed as "& id-expression" where the & is optional if the name
3502 refers to a function or array, or if the corresponding
3503 template-parameter is a reference.
3505 Here, we do not care about functions, as they are invalid anyway
3506 for a parameter of type pointer-to-object. */
3507 bool constant_address_p =
3508 (TREE_CODE (expr) == ADDR_EXPR
3509 || TREE_CODE (expr_type) == ARRAY_TYPE
3510 || (DECL_P (expr) && DECL_TEMPLATE_PARM_P (expr)));
3512 expr = decay_conversion (expr);
3513 if (expr == error_mark_node)
3514 return error_mark_node;
3516 expr = perform_qualification_conversions (type, expr);
3517 if (expr == error_mark_node)
3518 return error_mark_node;
3520 if (!constant_address_p)
3522 error ("%qE is not a valid template argument for type %qT "
3523 "because it is not a constant pointer", expr, type);
3527 /* [temp.arg.nontype]/5, bullet 3
3529 For a non-type template-parameter of type reference to object, no
3530 conversions apply. The type referred to by the reference may be more
3531 cv-qualified than the (otherwise identical) type of the
3532 template-argument. The template-parameter is bound directly to the
3533 template-argument, which must be an lvalue. */
3534 else if (TYPE_REF_OBJ_P (type))
3536 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type),
3538 return error_mark_node;
3540 if (!at_least_as_qualified_p (TREE_TYPE (type), expr_type))
3542 error ("%qE is not a valid template argument for type %qT "
3543 "because of conflicts in cv-qualification", expr, type);
3547 if (!real_lvalue_p (expr))
3549 error ("%qE is not a valid template argument for type %qT "
3550 "because it is not a lvalue", expr, type);
3554 /* [temp.arg.nontype]/1
3556 A template-argument for a non-type, non-template template-parameter
3557 shall be one of: [...]
3559 -- the address of an object or function with external linkage. */
3560 if (!DECL_EXTERNAL_LINKAGE_P (expr))
3562 error ("%qE is not a valid template argument for type %qT "
3563 "because object %qD has not external linkage",
3568 expr = build_nop (type, build_address (expr));
3570 /* [temp.arg.nontype]/5, bullet 4
3572 For a non-type template-parameter of type pointer to function, only
3573 the function-to-pointer conversion (_conv.func_) is applied. If the
3574 template-argument represents a set of overloaded functions (or a
3575 pointer to such), the matching function is selected from the set
3577 else if (TYPE_PTRFN_P (type))
3579 /* If the argument is a template-id, we might not have enough
3580 context information to decay the pointer.
3581 ??? Why static5.C requires decay and subst1.C works fine
3583 if (!type_unknown_p (expr_type))
3585 expr = decay_conversion (expr);
3586 if (expr == error_mark_node)
3587 return error_mark_node;
3590 expr = convert_nontype_argument_function (type, expr);
3591 if (!expr || expr == error_mark_node)
3594 /* [temp.arg.nontype]/5, bullet 5
3596 For a non-type template-parameter of type reference to function, no
3597 conversions apply. If the template-argument represents a set of
3598 overloaded functions, the matching function is selected from the set
3600 else if (TYPE_REFFN_P (type))
3602 if (TREE_CODE (expr) == ADDR_EXPR)
3604 error ("%qE is not a valid template argument for type %qT "
3605 "because it is a pointer", expr, type);
3606 inform ("try using %qE instead", TREE_OPERAND (expr, 0));
3610 expr = convert_nontype_argument_function (TREE_TYPE (type), expr);
3611 if (!expr || expr == error_mark_node)
3614 expr = build_nop (type, build_address (expr));
3616 /* [temp.arg.nontype]/5, bullet 6
3618 For a non-type template-parameter of type pointer to member function,
3619 no conversions apply. If the template-argument represents a set of
3620 overloaded member functions, the matching member function is selected
3621 from the set (_over.over_). */
3622 else if (TYPE_PTRMEMFUNC_P (type))
3624 expr = instantiate_type (type, expr, tf_none);
3625 if (expr == error_mark_node)
3626 return error_mark_node;
3628 /* There is no way to disable standard conversions in
3629 resolve_address_of_overloaded_function (called by
3630 instantiate_type). It is possible that the call succeeded by
3631 converting &B::I to &D::I (where B is a base of D), so we need
3632 to reject this conversion here.
3634 Actually, even if there was a way to disable standard conversions,
3635 it would still be better to reject them here so that we can
3636 provide a superior diagnostic. */
3637 if (!same_type_p (TREE_TYPE (expr), type))
3639 /* Make sure we are just one standard conversion off. */
3640 gcc_assert (can_convert (type, TREE_TYPE (expr)));
3641 error ("%qE is not a valid template argument for type %qT "
3642 "because it is of type %qT", expr, type,
3644 inform ("standard conversions are not allowed in this context");
3648 /* [temp.arg.nontype]/5, bullet 7
3650 For a non-type template-parameter of type pointer to data member,
3651 qualification conversions (_conv.qual_) are applied. */
3652 else if (TYPE_PTRMEM_P (type))
3654 expr = perform_qualification_conversions (type, expr);
3655 if (expr == error_mark_node)
3658 /* A template non-type parameter must be one of the above. */
3662 /* Sanity check: did we actually convert the argument to the
3664 gcc_assert (same_type_p (type, TREE_TYPE (expr)));
3669 /* Return 1 if PARM_PARMS and ARG_PARMS matches using rule for
3670 template template parameters. Both PARM_PARMS and ARG_PARMS are
3671 vectors of TREE_LIST nodes containing TYPE_DECL, TEMPLATE_DECL
3674 ARG_PARMS may contain more parameters than PARM_PARMS. If this is
3675 the case, then extra parameters must have default arguments.
3677 Consider the example:
3678 template <class T, class Allocator = allocator> class vector;
3679 template<template <class U> class TT> class C;
3681 C<vector> is a valid instantiation. PARM_PARMS for the above code
3682 contains a TYPE_DECL (for U), ARG_PARMS contains two TYPE_DECLs (for
3683 T and Allocator) and OUTER_ARGS contains the argument that is used to
3684 substitute the TT parameter. */
3687 coerce_template_template_parms (tree parm_parms,
3689 tsubst_flags_t complain,
3693 int nparms, nargs, i;
3696 gcc_assert (TREE_CODE (parm_parms) == TREE_VEC);
3697 gcc_assert (TREE_CODE (arg_parms) == TREE_VEC);
3699 nparms = TREE_VEC_LENGTH (parm_parms);
3700 nargs = TREE_VEC_LENGTH (arg_parms);
3702 /* The rule here is opposite of coerce_template_parms. */
3705 && TREE_PURPOSE (TREE_VEC_ELT (arg_parms, nparms)) == NULL_TREE))
3708 for (i = 0; i < nparms; ++i)
3710 parm = TREE_VALUE (TREE_VEC_ELT (parm_parms, i));
3711 arg = TREE_VALUE (TREE_VEC_ELT (arg_parms, i));
3713 if (arg == NULL_TREE || arg == error_mark_node
3714 || parm == NULL_TREE || parm == error_mark_node)
3717 if (TREE_CODE (arg) != TREE_CODE (parm))
3720 switch (TREE_CODE (parm))
3726 /* We encounter instantiations of templates like
3727 template <template <template <class> class> class TT>
3730 tree parmparm = DECL_INNERMOST_TEMPLATE_PARMS (parm);
3731 tree argparm = DECL_INNERMOST_TEMPLATE_PARMS (arg);
3733 if (!coerce_template_template_parms
3734 (parmparm, argparm, complain, in_decl, outer_args))
3740 /* The tsubst call is used to handle cases such as
3742 template <int> class C {};
3743 template <class T, template <T> class TT> class D {};
3746 i.e. the parameter list of TT depends on earlier parameters. */
3747 if (!dependent_type_p (TREE_TYPE (arg))
3749 (tsubst (TREE_TYPE (parm), outer_args, complain, in_decl),
3761 /* Convert the indicated template ARG as necessary to match the
3762 indicated template PARM. Returns the converted ARG, or
3763 error_mark_node if the conversion was unsuccessful. Error and
3764 warning messages are issued under control of COMPLAIN. This
3765 conversion is for the Ith parameter in the parameter list. ARGS is
3766 the full set of template arguments deduced so far. */
3769 convert_template_argument (tree parm,
3772 tsubst_flags_t complain,
3778 int is_type, requires_type, is_tmpl_type, requires_tmpl_type;
3780 inner_args = INNERMOST_TEMPLATE_ARGS (args);
3782 if (TREE_CODE (arg) == TREE_LIST
3783 && TREE_CODE (TREE_VALUE (arg)) == OFFSET_REF)
3785 /* The template argument was the name of some
3786 member function. That's usually
3787 invalid, but static members are OK. In any
3788 case, grab the underlying fields/functions
3789 and issue an error later if required. */
3790 arg = TREE_VALUE (arg);
3791 TREE_TYPE (arg) = unknown_type_node;
3794 requires_tmpl_type = TREE_CODE (parm) == TEMPLATE_DECL;
3795 requires_type = (TREE_CODE (parm) == TYPE_DECL
3796 || requires_tmpl_type);
3798 is_tmpl_type = ((TREE_CODE (arg) == TEMPLATE_DECL
3799 && TREE_CODE (DECL_TEMPLATE_RESULT (arg)) == TYPE_DECL)
3800 || TREE_CODE (arg) == TEMPLATE_TEMPLATE_PARM
3801 || TREE_CODE (arg) == UNBOUND_CLASS_TEMPLATE);
3804 && (TREE_CODE (arg) == TEMPLATE_TEMPLATE_PARM
3805 || TREE_CODE (arg) == UNBOUND_CLASS_TEMPLATE))
3806 arg = TYPE_STUB_DECL (arg);
3808 is_type = TYPE_P (arg) || is_tmpl_type;
3810 if (requires_type && ! is_type && TREE_CODE (arg) == SCOPE_REF
3811 && TREE_CODE (TREE_OPERAND (arg, 0)) == TEMPLATE_TYPE_PARM)
3813 pedwarn ("to refer to a type member of a template parameter, "
3814 "use %<typename %E%>", arg);
3816 arg = make_typename_type (TREE_OPERAND (arg, 0),
3817 TREE_OPERAND (arg, 1),
3819 complain & tf_error);
3822 if (is_type != requires_type)
3826 if (complain & tf_error)
3828 error ("type/value mismatch at argument %d in template "
3829 "parameter list for %qD",
3832 error (" expected a constant of type %qT, got %qT",
3834 (is_tmpl_type ? DECL_NAME (arg) : arg));
3835 else if (requires_tmpl_type)
3836 error (" expected a class template, got %qE", arg);
3838 error (" expected a type, got %qE", arg);
3841 return error_mark_node;
3843 if (is_tmpl_type ^ requires_tmpl_type)
3845 if (in_decl && (complain & tf_error))
3847 error ("type/value mismatch at argument %d in template "
3848 "parameter list for %qD",
3851 error (" expected a type, got %qT", DECL_NAME (arg));
3853 error (" expected a class template, got %qT", arg);
3855 return error_mark_node;
3860 if (requires_tmpl_type)
3862 if (TREE_CODE (TREE_TYPE (arg)) == UNBOUND_CLASS_TEMPLATE)
3863 /* The number of argument required is not known yet.
3864 Just accept it for now. */
3865 val = TREE_TYPE (arg);
3868 tree parmparm = DECL_INNERMOST_TEMPLATE_PARMS (parm);
3869 tree argparm = DECL_INNERMOST_TEMPLATE_PARMS (arg);
3871 if (coerce_template_template_parms (parmparm, argparm,
3877 /* TEMPLATE_TEMPLATE_PARM node is preferred over
3879 if (val != error_mark_node
3880 && DECL_TEMPLATE_TEMPLATE_PARM_P (val))
3881 val = TREE_TYPE (val);
3885 if (in_decl && (complain & tf_error))
3887 error ("type/value mismatch at argument %d in "
3888 "template parameter list for %qD",
3890 error (" expected a template of type %qD, got %qD",
3894 val = error_mark_node;
3903 tree t = tsubst (TREE_TYPE (parm), args, complain, in_decl);
3905 if (invalid_nontype_parm_type_p (t, complain))
3906 return error_mark_node;
3908 if (!uses_template_parms (arg) && !uses_template_parms (t))
3909 /* We used to call digest_init here. However, digest_init
3910 will report errors, which we don't want when complain
3911 is zero. More importantly, digest_init will try too
3912 hard to convert things: for example, `0' should not be
3913 converted to pointer type at this point according to
3914 the standard. Accepting this is not merely an
3915 extension, since deciding whether or not these
3916 conversions can occur is part of determining which
3917 function template to call, or whether a given explicit
3918 argument specification is valid. */
3919 val = convert_nontype_argument (t, arg);
3923 if (val == NULL_TREE)
3924 val = error_mark_node;
3925 else if (val == error_mark_node && (complain & tf_error))
3926 error ("could not convert template argument %qE to %qT", arg, t);
3932 /* Convert all template arguments to their appropriate types, and
3933 return a vector containing the innermost resulting template
3934 arguments. If any error occurs, return error_mark_node. Error and
3935 warning messages are issued under control of COMPLAIN.
3937 If REQUIRE_ALL_ARGUMENTS is nonzero, all arguments must be
3938 provided in ARGLIST, or else trailing parameters must have default
3939 values. If REQUIRE_ALL_ARGUMENTS is zero, we will attempt argument
3940 deduction for any unspecified trailing arguments. */
3943 coerce_template_parms (tree parms,
3946 tsubst_flags_t complain,
3947 int require_all_arguments)
3949 int nparms, nargs, i, lost = 0;
3952 tree new_inner_args;
3954 inner_args = INNERMOST_TEMPLATE_ARGS (args);
3955 nargs = inner_args ? NUM_TMPL_ARGS (inner_args) : 0;
3956 nparms = TREE_VEC_LENGTH (parms);
3960 && require_all_arguments
3961 && TREE_PURPOSE (TREE_VEC_ELT (parms, nargs)) == NULL_TREE))
3963 if (complain & tf_error)
3965 error ("wrong number of template arguments (%d, should be %d)",
3969 cp_error_at ("provided for %qD", in_decl);
3972 return error_mark_node;
3975 new_inner_args = make_tree_vec (nparms);
3976 new_args = add_outermost_template_args (args, new_inner_args);
3977 for (i = 0; i < nparms; i++)
3982 /* Get the Ith template parameter. */
3983 parm = TREE_VEC_ELT (parms, i);
3985 /* Calculate the Ith argument. */
3987 arg = TREE_VEC_ELT (inner_args, i);
3988 else if (require_all_arguments)
3989 /* There must be a default arg in this case. */
3990 arg = tsubst_template_arg (TREE_PURPOSE (parm), new_args,
3996 if (arg == error_mark_node)
3998 if (complain & tf_error)
3999 error ("template argument %d is invalid", i + 1);
4002 arg = convert_template_argument (TREE_VALUE (parm),
4003 arg, new_args, complain, i,
4006 if (arg == error_mark_node)
4008 TREE_VEC_ELT (new_inner_args, i) = arg;
4012 return error_mark_node;
4014 return new_inner_args;
4017 /* Returns 1 if template args OT and NT are equivalent. */
4020 template_args_equal (tree ot, tree nt)
4025 if (TREE_CODE (nt) == TREE_VEC)
4026 /* For member templates */
4027 return TREE_CODE (ot) == TREE_VEC && comp_template_args (ot, nt);
4028 else if (TYPE_P (nt))
4035 /* We must handle ObjC types specially because they may differ
4036 only in protocol qualifications (e.g., 'NSObject *' vs.
4037 'NSObject <Foo> *') that must be taken into account here.
4038 See also cp/typeck.c:build_c_cast(), where a similar problem
4039 arises. We must call objc_comptypes() twice, since its
4040 comparisons are _not_ symmetric. */
4041 if ((c1 = objc_comptypes (ot, nt, 0)) >= 0
4042 && (c2 = objc_comptypes (nt, ot, 0)) >= 0)
4045 return same_type_p (ot, nt);
4047 else if (TREE_CODE (ot) == TREE_VEC || TYPE_P (ot))
4050 return cp_tree_equal (ot, nt);
4053 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets
4054 of template arguments. Returns 0 otherwise. */
4057 comp_template_args (tree oldargs, tree newargs)
4061 if (TREE_VEC_LENGTH (oldargs) != TREE_VEC_LENGTH (newargs))
4064 for (i = 0; i < TREE_VEC_LENGTH (oldargs); ++i)
4066 tree nt = TREE_VEC_ELT (newargs, i);
4067 tree ot = TREE_VEC_ELT (oldargs, i);
4069 if (! template_args_equal (ot, nt))
4075 /* Given class template name and parameter list, produce a user-friendly name
4076 for the instantiation. */
4079 mangle_class_name_for_template (const char* name, tree parms, tree arglist)
4081 static struct obstack scratch_obstack;
4082 static char *scratch_firstobj;
4085 if (!scratch_firstobj)
4086 gcc_obstack_init (&scratch_obstack);
4088 obstack_free (&scratch_obstack, scratch_firstobj);
4089 scratch_firstobj = obstack_alloc (&scratch_obstack, 1);
4091 #define ccat(C) obstack_1grow (&scratch_obstack, (C));
4092 #define cat(S) obstack_grow (&scratch_obstack, (S), strlen (S))
4096 nparms = TREE_VEC_LENGTH (parms);
4097 arglist = INNERMOST_TEMPLATE_ARGS (arglist);
4098 gcc_assert (nparms == TREE_VEC_LENGTH (arglist));
4099 for (i = 0; i < nparms; i++)
4101 tree parm = TREE_VALUE (TREE_VEC_ELT (parms, i));
4102 tree arg = TREE_VEC_ELT (arglist, i);
4107 if (TREE_CODE (parm) == TYPE_DECL)
4109 cat (type_as_string (arg, TFF_CHASE_TYPEDEF));
4112 else if (TREE_CODE (parm) == TEMPLATE_DECL)
4114 if (TREE_CODE (arg) == TEMPLATE_DECL)
4116 /* Already substituted with real template. Just output
4117 the template name here */
4118 tree context = DECL_CONTEXT (arg);
4121 /* The template may be defined in a namespace, or
4122 may be a member template. */
4123 gcc_assert (TREE_CODE (context) == NAMESPACE_DECL
4124 || CLASS_TYPE_P (context));
4125 cat (decl_as_string (DECL_CONTEXT (arg),
4126 TFF_PLAIN_IDENTIFIER));
4129 cat (IDENTIFIER_POINTER (DECL_NAME (arg)));
4132 /* Output the parameter declaration. */
4133 cat (type_as_string (arg, TFF_CHASE_TYPEDEF));
4137 gcc_assert (TREE_CODE (parm) == PARM_DECL);
4139 /* No need to check arglist against parmlist here; we did that
4140 in coerce_template_parms, called from lookup_template_class. */
4141 cat (expr_as_string (arg, TFF_PLAIN_IDENTIFIER));
4144 char *bufp = obstack_next_free (&scratch_obstack);
4146 while (bufp[offset - 1] == ' ')
4148 obstack_blank_fast (&scratch_obstack, offset);
4150 /* B<C<char> >, not B<C<char>> */
4151 if (bufp[offset - 1] == '>')
4156 return (char *) obstack_base (&scratch_obstack);
4160 classtype_mangled_name (tree t)
4162 if (CLASSTYPE_TEMPLATE_INFO (t)
4163 /* Specializations have already had their names set up in
4164 lookup_template_class. */
4165 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (t))
4167 tree tmpl = most_general_template (CLASSTYPE_TI_TEMPLATE (t));
4169 /* For non-primary templates, the template parameters are
4170 implicit from their surrounding context. */
4171 if (PRIMARY_TEMPLATE_P (tmpl))
4173 tree name = DECL_NAME (tmpl);
4174 char *mangled_name = mangle_class_name_for_template
4175 (IDENTIFIER_POINTER (name),
4176 DECL_INNERMOST_TEMPLATE_PARMS (tmpl),
4177 CLASSTYPE_TI_ARGS (t));
4178 tree id = get_identifier (mangled_name);
4179 IDENTIFIER_TEMPLATE (id) = name;
4184 return TYPE_IDENTIFIER (t);
4188 add_pending_template (tree d)
4190 tree ti = (TYPE_P (d)
4191 ? CLASSTYPE_TEMPLATE_INFO (d)
4192 : DECL_TEMPLATE_INFO (d));
4196 if (TI_PENDING_TEMPLATE_FLAG (ti))
4199 /* We are called both from instantiate_decl, where we've already had a
4200 tinst_level pushed, and instantiate_template, where we haven't.
4202 level = !(current_tinst_level && TINST_DECL (current_tinst_level) == d);
4205 push_tinst_level (d);
4207 pt = tree_cons (current_tinst_level, d, NULL_TREE);
4208 if (last_pending_template)
4209 TREE_CHAIN (last_pending_template) = pt;
4211 pending_templates = pt;
4213 last_pending_template = pt;
4215 TI_PENDING_TEMPLATE_FLAG (ti) = 1;
4222 /* Return a TEMPLATE_ID_EXPR corresponding to the indicated FNS and
4223 ARGLIST. Valid choices for FNS are given in the cp-tree.def
4224 documentation for TEMPLATE_ID_EXPR. */
4227 lookup_template_function (tree fns, tree arglist)
4231 if (fns == error_mark_node || arglist == error_mark_node)
4232 return error_mark_node;
4234 gcc_assert (!arglist || TREE_CODE (arglist) == TREE_VEC);
4235 gcc_assert (fns && (is_overloaded_fn (fns)
4236 || TREE_CODE (fns) == IDENTIFIER_NODE));
4238 if (BASELINK_P (fns))
4240 BASELINK_FUNCTIONS (fns) = build2 (TEMPLATE_ID_EXPR,
4242 BASELINK_FUNCTIONS (fns),
4247 type = TREE_TYPE (fns);
4248 if (TREE_CODE (fns) == OVERLOAD || !type)
4249 type = unknown_type_node;
4251 return build2 (TEMPLATE_ID_EXPR, type, fns, arglist);
4254 /* Within the scope of a template class S<T>, the name S gets bound
4255 (in build_self_reference) to a TYPE_DECL for the class, not a
4256 TEMPLATE_DECL. If DECL is a TYPE_DECL for current_class_type,
4257 or one of its enclosing classes, and that type is a template,
4258 return the associated TEMPLATE_DECL. Otherwise, the original
4259 DECL is returned. */
4262 maybe_get_template_decl_from_type_decl (tree decl)
4264 return (decl != NULL_TREE
4265 && TREE_CODE (decl) == TYPE_DECL
4266 && DECL_ARTIFICIAL (decl)
4267 && CLASS_TYPE_P (TREE_TYPE (decl))
4268 && CLASSTYPE_TEMPLATE_INFO (TREE_TYPE (decl)))
4269 ? CLASSTYPE_TI_TEMPLATE (TREE_TYPE (decl)) : decl;
4272 /* Given an IDENTIFIER_NODE (type TEMPLATE_DECL) and a chain of
4273 parameters, find the desired type.
4275 D1 is the PTYPENAME terminal, and ARGLIST is the list of arguments.
4277 IN_DECL, if non-NULL, is the template declaration we are trying to
4280 If ENTERING_SCOPE is nonzero, we are about to enter the scope of
4281 the class we are looking up.
4283 Issue error and warning messages under control of COMPLAIN.
4285 If the template class is really a local class in a template
4286 function, then the FUNCTION_CONTEXT is the function in which it is
4289 ??? Note that this function is currently called *twice* for each
4290 template-id: the first time from the parser, while creating the
4291 incomplete type (finish_template_type), and the second type during the
4292 real instantiation (instantiate_template_class). This is surely something
4293 that we want to avoid. It also causes some problems with argument
4294 coercion (see convert_nontype_argument for more information on this). */
4297 lookup_template_class (tree d1,
4302 tsubst_flags_t complain)
4304 tree template = NULL_TREE, parmlist;
4307 timevar_push (TV_NAME_LOOKUP);
4309 if (TREE_CODE (d1) == IDENTIFIER_NODE)
4311 tree value = innermost_non_namespace_value (d1);
4312 if (value && DECL_TEMPLATE_TEMPLATE_PARM_P (value))
4317 push_decl_namespace (context);
4318 template = lookup_name (d1, /*prefer_type=*/0);
4319 template = maybe_get_template_decl_from_type_decl (template);
4321 pop_decl_namespace ();
4324 context = DECL_CONTEXT (template);
4326 else if (TREE_CODE (d1) == TYPE_DECL && IS_AGGR_TYPE (TREE_TYPE (d1)))
4328 tree type = TREE_TYPE (d1);
4330 /* If we are declaring a constructor, say A<T>::A<T>, we will get
4331 an implicit typename for the second A. Deal with it. */
4332 if (TREE_CODE (type) == TYPENAME_TYPE && TREE_TYPE (type))
4333 type = TREE_TYPE (type);
4335 if (CLASSTYPE_TEMPLATE_INFO (type))
4337 template = CLASSTYPE_TI_TEMPLATE (type);
4338 d1 = DECL_NAME (template);
4341 else if (TREE_CODE (d1) == ENUMERAL_TYPE
4342 || (TYPE_P (d1) && IS_AGGR_TYPE (d1)))
4344 template = TYPE_TI_TEMPLATE (d1);
4345 d1 = DECL_NAME (template);
4347 else if (TREE_CODE (d1) == TEMPLATE_DECL
4348 && TREE_CODE (DECL_TEMPLATE_RESULT (d1)) == TYPE_DECL)
4351 d1 = DECL_NAME (template);
4352 context = DECL_CONTEXT (template);
4355 /* Issue an error message if we didn't find a template. */
4358 if (complain & tf_error)
4359 error ("%qT is not a template", d1);
4360 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node);
4363 if (TREE_CODE (template) != TEMPLATE_DECL
4364 /* Make sure it's a user visible template, if it was named by
4366 || ((complain & tf_user) && !DECL_TEMPLATE_PARM_P (template)
4367 && !PRIMARY_TEMPLATE_P (template)))
4369 if (complain & tf_error)
4371 error ("non-template type %qT used as a template", d1);
4373 cp_error_at ("for template declaration %qD", in_decl);
4375 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node);
4378 complain &= ~tf_user;
4380 if (DECL_TEMPLATE_TEMPLATE_PARM_P (template))
4382 /* Create a new TEMPLATE_DECL and TEMPLATE_TEMPLATE_PARM node to store
4383 template arguments */
4388 parmlist = DECL_INNERMOST_TEMPLATE_PARMS (template);
4390 /* Consider an example where a template template parameter declared as
4392 template <class T, class U = std::allocator<T> > class TT
4394 The template parameter level of T and U are one level larger than
4395 of TT. To proper process the default argument of U, say when an
4396 instantiation `TT<int>' is seen, we need to build the full
4397 arguments containing {int} as the innermost level. Outer levels,
4398 available when not appearing as default template argument, can be
4399 obtained from `current_template_args ()'.
4401 Suppose that TT is later substituted with std::vector. The above
4402 instantiation is `TT<int, std::allocator<T> >' with TT at
4403 level 1, and T at level 2, while the template arguments at level 1
4404 becomes {std::vector} and the inner level 2 is {int}. */
4406 if (current_template_parms)
4407 arglist = add_to_template_args (current_template_args (), arglist);
4409 arglist2 = coerce_template_parms (parmlist, arglist, template,
4410 complain, /*require_all_args=*/1);
4411 if (arglist2 == error_mark_node
4412 || (!uses_template_parms (arglist2)
4413 && check_instantiated_args (template, arglist2, complain)))
4414 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node);
4416 parm = bind_template_template_parm (TREE_TYPE (template), arglist2);
4417 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, parm);
4421 tree template_type = TREE_TYPE (template);
4424 tree found = NULL_TREE;
4427 int is_partial_instantiation;
4429 gen_tmpl = most_general_template (template);
4430 parmlist = DECL_TEMPLATE_PARMS (gen_tmpl);
4431 parm_depth = TMPL_PARMS_DEPTH (parmlist);
4432 arg_depth = TMPL_ARGS_DEPTH (arglist);
4434 if (arg_depth == 1 && parm_depth > 1)
4436 /* We've been given an incomplete set of template arguments.
4439 template <class T> struct S1 {
4440 template <class U> struct S2 {};
4441 template <class U> struct S2<U*> {};
4444 we will be called with an ARGLIST of `U*', but the
4445 TEMPLATE will be `template <class T> template
4446 <class U> struct S1<T>::S2'. We must fill in the missing
4449 = add_outermost_template_args (TYPE_TI_ARGS (TREE_TYPE (template)),
4451 arg_depth = TMPL_ARGS_DEPTH (arglist);
4454 /* Now we should have enough arguments. */
4455 gcc_assert (parm_depth == arg_depth);
4457 /* From here on, we're only interested in the most general
4459 template = gen_tmpl;
4461 /* Calculate the BOUND_ARGS. These will be the args that are
4462 actually tsubst'd into the definition to create the
4466 /* We have multiple levels of arguments to coerce, at once. */
4468 int saved_depth = TMPL_ARGS_DEPTH (arglist);
4470 tree bound_args = make_tree_vec (parm_depth);
4472 for (i = saved_depth,
4473 t = DECL_TEMPLATE_PARMS (template);
4474 i > 0 && t != NULL_TREE;
4475 --i, t = TREE_CHAIN (t))
4477 tree a = coerce_template_parms (TREE_VALUE (t),
4479 complain, /*require_all_args=*/1);
4481 /* Don't process further if one of the levels fails. */
4482 if (a == error_mark_node)
4484 /* Restore the ARGLIST to its full size. */
4485 TREE_VEC_LENGTH (arglist) = saved_depth;
4486 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node);
4489 SET_TMPL_ARGS_LEVEL (bound_args, i, a);
4491 /* We temporarily reduce the length of the ARGLIST so
4492 that coerce_template_parms will see only the arguments
4493 corresponding to the template parameters it is
4495 TREE_VEC_LENGTH (arglist)--;
4498 /* Restore the ARGLIST to its full size. */
4499 TREE_VEC_LENGTH (arglist) = saved_depth;
4501 arglist = bound_args;
4505 = coerce_template_parms (INNERMOST_TEMPLATE_PARMS (parmlist),
4506 INNERMOST_TEMPLATE_ARGS (arglist),
4508 complain, /*require_all_args=*/1);
4510 if (arglist == error_mark_node)
4511 /* We were unable to bind the arguments. */
4512 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node);
4514 /* In the scope of a template class, explicit references to the
4515 template class refer to the type of the template, not any
4516 instantiation of it. For example, in:
4518 template <class T> class C { void f(C<T>); }
4520 the `C<T>' is just the same as `C'. Outside of the
4521 class, however, such a reference is an instantiation. */
4522 if (comp_template_args (TYPE_TI_ARGS (template_type),
4525 found = template_type;
4527 if (!entering_scope && PRIMARY_TEMPLATE_P (template))
4531 for (ctx = current_class_type;
4532 ctx && TREE_CODE (ctx) != NAMESPACE_DECL;
4534 ? TYPE_CONTEXT (ctx)
4535 : DECL_CONTEXT (ctx)))
4536 if (TYPE_P (ctx) && same_type_p (ctx, template_type))
4539 /* We're not in the scope of the class, so the
4540 TEMPLATE_TYPE is not the type we want after all. */
4546 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, found);
4548 /* If we already have this specialization, return it. */
4549 found = retrieve_specialization (template, arglist,
4550 /*class_specializations_p=*/false);
4552 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, found);
4554 /* This type is a "partial instantiation" if any of the template
4555 arguments still involve template parameters. Note that we set
4556 IS_PARTIAL_INSTANTIATION for partial specializations as
4558 is_partial_instantiation = uses_template_parms (arglist);
4560 /* If the deduced arguments are invalid, then the binding
4562 if (!is_partial_instantiation
4563 && check_instantiated_args (template,
4564 INNERMOST_TEMPLATE_ARGS (arglist),
4566 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node);
4568 if (!is_partial_instantiation
4569 && !PRIMARY_TEMPLATE_P (template)
4570 && TREE_CODE (CP_DECL_CONTEXT (template)) == NAMESPACE_DECL)
4572 found = xref_tag_from_type (TREE_TYPE (template),
4573 DECL_NAME (template),
4574 /*tag_scope=*/ts_global);
4575 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, found);
4578 context = tsubst (DECL_CONTEXT (template), arglist,
4581 context = global_namespace;
4583 /* Create the type. */
4584 if (TREE_CODE (template_type) == ENUMERAL_TYPE)
4586 if (!is_partial_instantiation)
4588 set_current_access_from_decl (TYPE_NAME (template_type));
4589 t = start_enum (TYPE_IDENTIFIER (template_type));
4592 /* We don't want to call start_enum for this type, since
4593 the values for the enumeration constants may involve
4594 template parameters. And, no one should be interested
4595 in the enumeration constants for such a type. */
4596 t = make_node (ENUMERAL_TYPE);
4600 t = make_aggr_type (TREE_CODE (template_type));
4601 CLASSTYPE_DECLARED_CLASS (t)
4602 = CLASSTYPE_DECLARED_CLASS (template_type);
4603 SET_CLASSTYPE_IMPLICIT_INSTANTIATION (t);
4604 TYPE_FOR_JAVA (t) = TYPE_FOR_JAVA (template_type);
4606 /* A local class. Make sure the decl gets registered properly. */
4607 if (context == current_function_decl)
4608 pushtag (DECL_NAME (template), t, /*tag_scope=*/ts_current);
4611 /* If we called start_enum or pushtag above, this information
4612 will already be set up. */
4615 TYPE_CONTEXT (t) = FROB_CONTEXT (context);
4617 type_decl = create_implicit_typedef (DECL_NAME (template), t);
4618 DECL_CONTEXT (type_decl) = TYPE_CONTEXT (t);
4619 TYPE_STUB_DECL (t) = type_decl;
4620 DECL_SOURCE_LOCATION (type_decl)
4621 = DECL_SOURCE_LOCATION (TYPE_STUB_DECL (template_type));
4624 type_decl = TYPE_NAME (t);
4626 TREE_PRIVATE (type_decl)
4627 = TREE_PRIVATE (TYPE_STUB_DECL (template_type));
4628 TREE_PROTECTED (type_decl)
4629 = TREE_PROTECTED (TYPE_STUB_DECL (template_type));
4630 DECL_IN_SYSTEM_HEADER (type_decl)
4631 = DECL_IN_SYSTEM_HEADER (template);
4633 /* Set up the template information. We have to figure out which
4634 template is the immediate parent if this is a full
4636 if (parm_depth == 1 || is_partial_instantiation
4637 || !PRIMARY_TEMPLATE_P (template))
4638 /* This case is easy; there are no member templates involved. */
4642 /* This is a full instantiation of a member template. Look
4643 for a partial instantiation of which this is an instance. */
4645 for (found = DECL_TEMPLATE_INSTANTIATIONS (template);
4646 found; found = TREE_CHAIN (found))
4649 tree tmpl = CLASSTYPE_TI_TEMPLATE (TREE_VALUE (found));
4651 /* We only want partial instantiations, here, not
4652 specializations or full instantiations. */
4653 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_VALUE (found))
4654 || !uses_template_parms (TREE_VALUE (found)))
4657 /* Temporarily reduce by one the number of levels in the
4658 ARGLIST and in FOUND so as to avoid comparing the
4659 last set of arguments. */
4660 TREE_VEC_LENGTH (arglist)--;
4661 TREE_VEC_LENGTH (TREE_PURPOSE (found)) --;
4663 /* See if the arguments match. If they do, then TMPL is
4664 the partial instantiation we want. */
4665 success = comp_template_args (TREE_PURPOSE (found), arglist);
4667 /* Restore the argument vectors to their full size. */
4668 TREE_VEC_LENGTH (arglist)++;
4669 TREE_VEC_LENGTH (TREE_PURPOSE (found))++;
4680 /* There was no partial instantiation. This happens
4681 where C<T> is a member template of A<T> and it's used
4684 template <typename T> struct B { A<T>::C<int> m; };
4687 Create the partial instantiation.
4689 TREE_VEC_LENGTH (arglist)--;
4690 found = tsubst (template, arglist, complain, NULL_TREE);
4691 TREE_VEC_LENGTH (arglist)++;
4695 SET_TYPE_TEMPLATE_INFO (t, tree_cons (found, arglist, NULL_TREE));
4696 DECL_TEMPLATE_INSTANTIATIONS (template)
4697 = tree_cons (arglist, t,
4698 DECL_TEMPLATE_INSTANTIATIONS (template));
4700 if (TREE_CODE (t) == ENUMERAL_TYPE
4701 && !is_partial_instantiation)
4702 /* Now that the type has been registered on the instantiations
4703 list, we set up the enumerators. Because the enumeration
4704 constants may involve the enumeration type itself, we make
4705 sure to register the type first, and then create the
4706 constants. That way, doing tsubst_expr for the enumeration
4707 constants won't result in recursive calls here; we'll find
4708 the instantiation and exit above. */
4709 tsubst_enum (template_type, t, arglist);
4711 /* Reset the name of the type, now that CLASSTYPE_TEMPLATE_INFO
4713 if (TREE_CODE (t) != ENUMERAL_TYPE)
4714 DECL_NAME (type_decl) = classtype_mangled_name (t);
4715 if (is_partial_instantiation)
4716 /* If the type makes use of template parameters, the
4717 code that generates debugging information will crash. */
4718 DECL_IGNORED_P (TYPE_STUB_DECL (t)) = 1;
4720 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, t);
4722 timevar_pop (TV_NAME_LOOKUP);
4729 struct pointer_set_t *visited;
4732 /* Called from for_each_template_parm via walk_tree. */
4735 for_each_template_parm_r (tree *tp, int *walk_subtrees, void *d)
4738 struct pair_fn_data *pfd = (struct pair_fn_data *) d;
4739 tree_fn_t fn = pfd->fn;
4740 void *data = pfd->data;
4743 && for_each_template_parm (TYPE_CONTEXT (t), fn, data, pfd->visited))
4744 return error_mark_node;
4746 switch (TREE_CODE (t))
4749 if (TYPE_PTRMEMFUNC_P (t))
4755 if (!TYPE_TEMPLATE_INFO (t))
4757 else if (for_each_template_parm (TREE_VALUE (TYPE_TEMPLATE_INFO (t)),
4758 fn, data, pfd->visited))
4759 return error_mark_node;
4763 /* Since we're not going to walk subtrees, we have to do this
4765 if (for_each_template_parm (TYPE_METHOD_BASETYPE (t), fn, data,
4767 return error_mark_node;
4771 /* Check the return type. */
4772 if (for_each_template_parm (TREE_TYPE (t), fn, data, pfd->visited))
4773 return error_mark_node;
4775 /* Check the parameter types. Since default arguments are not
4776 instantiated until they are needed, the TYPE_ARG_TYPES may
4777 contain expressions that involve template parameters. But,
4778 no-one should be looking at them yet. And, once they're
4779 instantiated, they don't contain template parameters, so
4780 there's no point in looking at them then, either. */
4784 for (parm = TYPE_ARG_TYPES (t); parm; parm = TREE_CHAIN (parm))
4785 if (for_each_template_parm (TREE_VALUE (parm), fn, data,
4787 return error_mark_node;
4789 /* Since we've already handled the TYPE_ARG_TYPES, we don't
4790 want walk_tree walking into them itself. */
4796 if (for_each_template_parm (TYPE_FIELDS (t), fn, data,
4798 return error_mark_node;
4803 if (DECL_LANG_SPECIFIC (t) && DECL_TEMPLATE_INFO (t)
4804 && for_each_template_parm (DECL_TI_ARGS (t), fn, data,
4806 return error_mark_node;
4811 if (TREE_CODE (t) == CONST_DECL && DECL_TEMPLATE_PARM_P (t)
4812 && for_each_template_parm (DECL_INITIAL (t), fn, data,
4814 return error_mark_node;
4815 if (DECL_CONTEXT (t)
4816 && for_each_template_parm (DECL_CONTEXT (t), fn, data,
4818 return error_mark_node;
4821 case BOUND_TEMPLATE_TEMPLATE_PARM:
4822 /* Record template parameters such as `T' inside `TT<T>'. */
4823 if (for_each_template_parm (TYPE_TI_ARGS (t), fn, data, pfd->visited))
4824 return error_mark_node;
4827 case TEMPLATE_TEMPLATE_PARM:
4828 case TEMPLATE_TYPE_PARM:
4829 case TEMPLATE_PARM_INDEX:
4830 if (fn && (*fn)(t, data))
4831 return error_mark_node;
4833 return error_mark_node;
4837 /* A template template parameter is encountered. */
4838 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t)
4839 && for_each_template_parm (TREE_TYPE (t), fn, data, pfd->visited))
4840 return error_mark_node;
4842 /* Already substituted template template parameter */
4848 || for_each_template_parm (TYPENAME_TYPE_FULLNAME (t), fn,
4849 data, pfd->visited))
4850 return error_mark_node;
4854 if (TREE_TYPE (t) && TYPE_PTRMEMFUNC_P (TREE_TYPE (t))
4855 && for_each_template_parm (TYPE_PTRMEMFUNC_FN_TYPE
4856 (TREE_TYPE (t)), fn, data,
4858 return error_mark_node;
4863 /* If there's no type, then this thing must be some expression
4864 involving template parameters. */
4865 if (!fn && !TREE_TYPE (t))
4866 return error_mark_node;
4871 case REINTERPRET_CAST_EXPR:
4872 case CONST_CAST_EXPR:
4873 case STATIC_CAST_EXPR:
4874 case DYNAMIC_CAST_EXPR:
4878 case PSEUDO_DTOR_EXPR:
4880 return error_mark_node;
4884 /* If we do not handle this case specially, we end up walking
4885 the BINFO hierarchy, which is circular, and therefore
4886 confuses walk_tree. */
4888 if (for_each_template_parm (BASELINK_FUNCTIONS (*tp), fn, data,
4890 return error_mark_node;
4897 /* We didn't find any template parameters we liked. */
4901 /* For each TEMPLATE_TYPE_PARM, TEMPLATE_TEMPLATE_PARM,
4902 BOUND_TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX in T,
4903 call FN with the parameter and the DATA.
4904 If FN returns nonzero, the iteration is terminated, and
4905 for_each_template_parm returns 1. Otherwise, the iteration
4906 continues. If FN never returns a nonzero value, the value
4907 returned by for_each_template_parm is 0. If FN is NULL, it is
4908 considered to be the function which always returns 1. */
4911 for_each_template_parm (tree t, tree_fn_t fn, void* data,
4912 struct pointer_set_t *visited)
4914 struct pair_fn_data pfd;
4921 /* Walk the tree. (Conceptually, we would like to walk without
4922 duplicates, but for_each_template_parm_r recursively calls
4923 for_each_template_parm, so we would need to reorganize a fair
4924 bit to use walk_tree_without_duplicates, so we keep our own
4927 pfd.visited = visited;
4929 pfd.visited = pointer_set_create ();
4930 result = walk_tree (&t,
4931 for_each_template_parm_r,
4933 pfd.visited) != NULL_TREE;
4938 pointer_set_destroy (pfd.visited);
4945 /* Returns true if T depends on any template parameter. */
4948 uses_template_parms (tree t)
4951 int saved_processing_template_decl;
4953 saved_processing_template_decl = processing_template_decl;
4954 if (!saved_processing_template_decl)
4955 processing_template_decl = 1;
4957 dependent_p = dependent_type_p (t);
4958 else if (TREE_CODE (t) == TREE_VEC)
4959 dependent_p = any_dependent_template_arguments_p (t);
4960 else if (TREE_CODE (t) == TREE_LIST)
4961 dependent_p = (uses_template_parms (TREE_VALUE (t))
4962 || uses_template_parms (TREE_CHAIN (t)));
4965 || TREE_CODE (t) == TEMPLATE_PARM_INDEX
4966 || TREE_CODE (t) == OVERLOAD
4967 || TREE_CODE (t) == BASELINK
4968 || CONSTANT_CLASS_P (t))
4969 dependent_p = (type_dependent_expression_p (t)
4970 || value_dependent_expression_p (t));
4973 gcc_assert (t == error_mark_node);
4974 dependent_p = false;
4977 processing_template_decl = saved_processing_template_decl;
4982 /* Returns true if T depends on any template parameter with level LEVEL. */
4985 uses_template_parms_level (tree t, int level)
4987 return for_each_template_parm (t, template_parm_this_level_p, &level, NULL);
4990 static int tinst_depth;
4991 extern int max_tinst_depth;
4992 #ifdef GATHER_STATISTICS
4995 static int tinst_level_tick;
4996 static int last_template_error_tick;
4998 /* We're starting to instantiate D; record the template instantiation context
4999 for diagnostics and to restore it later. */
5002 push_tinst_level (tree d)
5006 if (tinst_depth >= max_tinst_depth)
5008 /* If the instantiation in question still has unbound template parms,
5009 we don't really care if we can't instantiate it, so just return.
5010 This happens with base instantiation for implicit `typename'. */
5011 if (uses_template_parms (d))
5014 last_template_error_tick = tinst_level_tick;
5015 error ("template instantiation depth exceeds maximum of %d (use "
5016 "-ftemplate-depth-NN to increase the maximum) instantiating %qD",
5017 max_tinst_depth, d);
5019 print_instantiation_context ();
5024 new = make_node (TINST_LEVEL);
5025 TINST_DECL (new) = d;
5026 TINST_LOCATION (new) = input_location;
5027 TINST_IN_SYSTEM_HEADER_P (new) = in_system_header;
5028 TREE_CHAIN (new) = current_tinst_level;
5029 current_tinst_level = new;
5032 #ifdef GATHER_STATISTICS
5033 if (tinst_depth > depth_reached)
5034 depth_reached = tinst_depth;
5041 /* We're done instantiating this template; return to the instantiation
5045 pop_tinst_level (void)
5047 tree old = current_tinst_level;
5049 /* Restore the filename and line number stashed away when we started
5050 this instantiation. */
5051 input_location = TINST_LOCATION (old);
5052 in_system_header = TINST_IN_SYSTEM_HEADER_P (old);
5053 current_tinst_level = TREE_CHAIN (old);
5058 /* We're instantiating a deferred template; restore the template
5059 instantiation context in which the instantiation was requested, which
5060 is one step out from LEVEL. */
5063 reopen_tinst_level (tree level)
5068 for (t = level; t; t = TREE_CHAIN (t))
5071 current_tinst_level = level;
5075 /* DECL is a friend FUNCTION_DECL or TEMPLATE_DECL. ARGS is the
5076 vector of template arguments, as for tsubst.
5078 Returns an appropriate tsubst'd friend declaration. */
5081 tsubst_friend_function (tree decl, tree args)
5085 if (TREE_CODE (decl) == FUNCTION_DECL
5086 && DECL_TEMPLATE_INSTANTIATION (decl)
5087 && TREE_CODE (DECL_TI_TEMPLATE (decl)) != TEMPLATE_DECL)
5088 /* This was a friend declared with an explicit template
5089 argument list, e.g.:
5093 to indicate that f was a template instantiation, not a new
5094 function declaration. Now, we have to figure out what
5095 instantiation of what template. */
5097 tree template_id, arglist, fns;
5100 tree ns = decl_namespace_context (TYPE_MAIN_DECL (current_class_type));
5102 /* Friend functions are looked up in the containing namespace scope.
5103 We must enter that scope, to avoid finding member functions of the
5104 current cless with same name. */
5105 push_nested_namespace (ns);
5106 fns = tsubst_expr (DECL_TI_TEMPLATE (decl), args,
5107 tf_error | tf_warning, NULL_TREE);
5108 pop_nested_namespace (ns);
5109 arglist = tsubst (DECL_TI_ARGS (decl), args,
5110 tf_error | tf_warning, NULL_TREE);
5111 template_id = lookup_template_function (fns, arglist);
5113 new_friend = tsubst (decl, args, tf_error | tf_warning, NULL_TREE);
5114 tmpl = determine_specialization (template_id, new_friend,
5116 /*need_member_template=*/0,
5117 TREE_VEC_LENGTH (args));
5118 return instantiate_template (tmpl, new_args, tf_error);
5121 new_friend = tsubst (decl, args, tf_error | tf_warning, NULL_TREE);
5123 /* The NEW_FRIEND will look like an instantiation, to the
5124 compiler, but is not an instantiation from the point of view of
5125 the language. For example, we might have had:
5127 template <class T> struct S {
5128 template <class U> friend void f(T, U);
5131 Then, in S<int>, template <class U> void f(int, U) is not an
5132 instantiation of anything. */
5133 if (new_friend == error_mark_node)
5134 return error_mark_node;
5136 DECL_USE_TEMPLATE (new_friend) = 0;
5137 if (TREE_CODE (decl) == TEMPLATE_DECL)
5139 DECL_USE_TEMPLATE (DECL_TEMPLATE_RESULT (new_friend)) = 0;
5140 DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (new_friend))
5141 = DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (decl));
5144 /* The mangled name for the NEW_FRIEND is incorrect. The function
5145 is not a template instantiation and should not be mangled like
5146 one. Therefore, we forget the mangling here; we'll recompute it
5147 later if we need it. */
5148 if (TREE_CODE (new_friend) != TEMPLATE_DECL)
5150 SET_DECL_RTL (new_friend, NULL_RTX);
5151 SET_DECL_ASSEMBLER_NAME (new_friend, NULL_TREE);
5154 if (DECL_NAMESPACE_SCOPE_P (new_friend))
5157 tree new_friend_template_info;
5158 tree new_friend_result_template_info;
5160 int new_friend_is_defn;
5162 /* We must save some information from NEW_FRIEND before calling
5163 duplicate decls since that function will free NEW_FRIEND if
5165 new_friend_template_info = DECL_TEMPLATE_INFO (new_friend);
5166 new_friend_is_defn =
5167 (DECL_INITIAL (DECL_TEMPLATE_RESULT
5168 (template_for_substitution (new_friend)))
5170 if (TREE_CODE (new_friend) == TEMPLATE_DECL)
5172 /* This declaration is a `primary' template. */
5173 DECL_PRIMARY_TEMPLATE (new_friend) = new_friend;
5175 new_friend_result_template_info
5176 = DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (new_friend));
5179 new_friend_result_template_info = NULL_TREE;
5181 /* Inside pushdecl_namespace_level, we will push into the
5182 current namespace. However, the friend function should go
5183 into the namespace of the template. */
5184 ns = decl_namespace_context (new_friend);
5185 push_nested_namespace (ns);
5186 old_decl = pushdecl_namespace_level (new_friend);
5187 pop_nested_namespace (ns);
5189 if (old_decl != new_friend)
5191 /* This new friend declaration matched an existing
5192 declaration. For example, given:
5194 template <class T> void f(T);
5195 template <class U> class C {
5196 template <class T> friend void f(T) {}
5199 the friend declaration actually provides the definition
5200 of `f', once C has been instantiated for some type. So,
5201 old_decl will be the out-of-class template declaration,
5202 while new_friend is the in-class definition.
5204 But, if `f' was called before this point, the
5205 instantiation of `f' will have DECL_TI_ARGS corresponding
5206 to `T' but not to `U', references to which might appear
5207 in the definition of `f'. Previously, the most general
5208 template for an instantiation of `f' was the out-of-class
5209 version; now it is the in-class version. Therefore, we
5210 run through all specialization of `f', adding to their
5211 DECL_TI_ARGS appropriately. In particular, they need a
5212 new set of outer arguments, corresponding to the
5213 arguments for this class instantiation.
5215 The same situation can arise with something like this:
5218 template <class T> class C {
5222 when `C<int>' is instantiated. Now, `f(int)' is defined
5225 if (!new_friend_is_defn)
5226 /* On the other hand, if the in-class declaration does
5227 *not* provide a definition, then we don't want to alter
5228 existing definitions. We can just leave everything
5233 /* Overwrite whatever template info was there before, if
5234 any, with the new template information pertaining to
5236 DECL_TEMPLATE_INFO (old_decl) = new_friend_template_info;
5238 if (TREE_CODE (old_decl) != TEMPLATE_DECL)
5239 reregister_specialization (new_friend,
5240 most_general_template (old_decl),
5245 tree new_friend_args;
5247 DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (old_decl))
5248 = new_friend_result_template_info;
5250 new_friend_args = TI_ARGS (new_friend_template_info);
5251 for (t = DECL_TEMPLATE_SPECIALIZATIONS (old_decl);
5255 tree spec = TREE_VALUE (t);
5258 = add_outermost_template_args (new_friend_args,
5259 DECL_TI_ARGS (spec));
5262 /* Now, since specializations are always supposed to
5263 hang off of the most general template, we must move
5265 t = most_general_template (old_decl);
5268 DECL_TEMPLATE_SPECIALIZATIONS (t)
5269 = chainon (DECL_TEMPLATE_SPECIALIZATIONS (t),
5270 DECL_TEMPLATE_SPECIALIZATIONS (old_decl));
5271 DECL_TEMPLATE_SPECIALIZATIONS (old_decl) = NULL_TREE;
5276 /* The information from NEW_FRIEND has been merged into OLD_DECL
5277 by duplicate_decls. */
5278 new_friend = old_decl;
5283 tree context = DECL_CONTEXT (new_friend);
5287 template <class T> class C {
5288 template <class U> friend void C1<U>::f (); // case 1
5289 friend void C2<T>::f (); // case 2
5291 we only need to make sure CONTEXT is a complete type for
5292 case 2. To distinguish between the two cases, we note that
5293 CONTEXT of case 1 remains dependent type after tsubst while
5294 this isn't true for case 2. */
5295 ++processing_template_decl;
5296 dependent_p = dependent_type_p (context);
5297 --processing_template_decl;
5300 && !complete_type_or_else (context, NULL_TREE))
5301 return error_mark_node;
5303 if (COMPLETE_TYPE_P (context))
5305 /* Check to see that the declaration is really present, and,
5306 possibly obtain an improved declaration. */
5307 tree fn = check_classfn (context,
5308 new_friend, NULL_TREE);
5318 /* FRIEND_TMPL is a friend TEMPLATE_DECL. ARGS is the vector of
5319 template arguments, as for tsubst.
5321 Returns an appropriate tsubst'd friend type or error_mark_node on
5325 tsubst_friend_class (tree friend_tmpl, tree args)
5331 context = DECL_CONTEXT (friend_tmpl);
5335 if (TREE_CODE (context) == NAMESPACE_DECL)
5336 push_nested_namespace (context);
5338 push_nested_class (tsubst (context, args, tf_none, NULL_TREE));
5341 /* First, we look for a class template. */
5342 tmpl = lookup_name (DECL_NAME (friend_tmpl), /*prefer_type=*/0);
5344 /* But, if we don't find one, it might be because we're in a
5345 situation like this:
5353 Here, in the scope of (say) S<int>, `S' is bound to a TYPE_DECL
5354 for `S<int>', not the TEMPLATE_DECL. */
5355 if (!tmpl || !DECL_CLASS_TEMPLATE_P (tmpl))
5357 tmpl = lookup_name (DECL_NAME (friend_tmpl), /*prefer_type=*/1);
5358 tmpl = maybe_get_template_decl_from_type_decl (tmpl);
5361 if (tmpl && DECL_CLASS_TEMPLATE_P (tmpl))
5363 /* The friend template has already been declared. Just
5364 check to see that the declarations match, and install any new
5365 default parameters. We must tsubst the default parameters,
5366 of course. We only need the innermost template parameters
5367 because that is all that redeclare_class_template will look
5369 if (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (friend_tmpl))
5370 > TMPL_ARGS_DEPTH (args))
5373 parms = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_tmpl),
5374 args, tf_error | tf_warning);
5375 redeclare_class_template (TREE_TYPE (tmpl), parms);
5378 friend_type = TREE_TYPE (tmpl);
5382 /* The friend template has not already been declared. In this
5383 case, the instantiation of the template class will cause the
5384 injection of this template into the global scope. */
5385 tmpl = tsubst (friend_tmpl, args, tf_error | tf_warning, NULL_TREE);
5387 /* The new TMPL is not an instantiation of anything, so we
5388 forget its origins. We don't reset CLASSTYPE_TI_TEMPLATE for
5389 the new type because that is supposed to be the corresponding
5390 template decl, i.e., TMPL. */
5391 DECL_USE_TEMPLATE (tmpl) = 0;
5392 DECL_TEMPLATE_INFO (tmpl) = NULL_TREE;
5393 CLASSTYPE_USE_TEMPLATE (TREE_TYPE (tmpl)) = 0;
5394 CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl))
5395 = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl)));
5397 /* Inject this template into the global scope. */
5398 friend_type = TREE_TYPE (pushdecl_top_level (tmpl));
5403 if (TREE_CODE (context) == NAMESPACE_DECL)
5404 pop_nested_namespace (context);
5406 pop_nested_class ();
5412 /* Returns zero if TYPE cannot be completed later due to circularity.
5413 Otherwise returns one. */
5416 can_complete_type_without_circularity (tree type)
5418 if (type == NULL_TREE || type == error_mark_node)
5420 else if (COMPLETE_TYPE_P (type))
5422 else if (TREE_CODE (type) == ARRAY_TYPE && TYPE_DOMAIN (type))
5423 return can_complete_type_without_circularity (TREE_TYPE (type));
5424 else if (CLASS_TYPE_P (type)
5425 && TYPE_BEING_DEFINED (TYPE_MAIN_VARIANT (type)))
5432 instantiate_class_template (tree type)
5434 tree template, args, pattern, t, member;
5439 if (type == error_mark_node)
5440 return error_mark_node;
5442 if (TYPE_BEING_DEFINED (type)
5443 || COMPLETE_TYPE_P (type)
5444 || dependent_type_p (type))
5447 /* Figure out which template is being instantiated. */
5448 template = most_general_template (CLASSTYPE_TI_TEMPLATE (type));
5449 gcc_assert (TREE_CODE (template) == TEMPLATE_DECL);
5451 /* Figure out which arguments are being used to do the
5453 args = CLASSTYPE_TI_ARGS (type);
5455 /* Determine what specialization of the original template to
5457 t = most_specialized_class (template, args);
5458 if (t == error_mark_node)
5460 const char *str = "candidates are:";
5461 error ("ambiguous class template instantiation for %q#T", type);
5462 for (t = DECL_TEMPLATE_SPECIALIZATIONS (template); t;
5465 if (get_class_bindings (TREE_VALUE (t), TREE_PURPOSE (t), args))
5467 cp_error_at ("%s %+#T", str, TREE_TYPE (t));
5471 TYPE_BEING_DEFINED (type) = 1;
5472 return error_mark_node;
5476 pattern = TREE_TYPE (t);
5478 pattern = TREE_TYPE (template);
5480 /* If the template we're instantiating is incomplete, then clearly
5481 there's nothing we can do. */
5482 if (!COMPLETE_TYPE_P (pattern))
5485 /* If we've recursively instantiated too many templates, stop. */
5486 if (! push_tinst_level (type))
5489 /* Now we're really doing the instantiation. Mark the type as in
5490 the process of being defined. */
5491 TYPE_BEING_DEFINED (type) = 1;
5493 /* We may be in the middle of deferred access check. Disable
5495 push_deferring_access_checks (dk_no_deferred);
5497 push_to_top_level ();
5501 /* This TYPE is actually an instantiation of a partial
5502 specialization. We replace the innermost set of ARGS with
5503 the arguments appropriate for substitution. For example,
5506 template <class T> struct S {};
5507 template <class T> struct S<T*> {};
5509 and supposing that we are instantiating S<int*>, ARGS will
5510 present be {int*} but we need {int}. */
5512 = get_class_bindings (TREE_VALUE (t), TREE_PURPOSE (t),
5515 /* If there were multiple levels in ARGS, replacing the
5516 innermost level would alter CLASSTYPE_TI_ARGS, which we don't
5517 want, so we make a copy first. */
5518 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args))
5520 args = copy_node (args);
5521 SET_TMPL_ARGS_LEVEL (args, TMPL_ARGS_DEPTH (args), inner_args);
5527 SET_CLASSTYPE_INTERFACE_UNKNOWN (type);
5529 /* Set the input location to the template definition. This is needed
5530 if tsubsting causes an error. */
5531 typedecl = TYPE_MAIN_DECL (type);
5532 input_location = DECL_SOURCE_LOCATION (typedecl);
5533 in_system_header = DECL_IN_SYSTEM_HEADER (typedecl);
5535 TYPE_HAS_CONSTRUCTOR (type) = TYPE_HAS_CONSTRUCTOR (pattern);
5536 TYPE_HAS_NEW_OPERATOR (type) = TYPE_HAS_NEW_OPERATOR (pattern);
5537 TYPE_HAS_ARRAY_NEW_OPERATOR (type) = TYPE_HAS_ARRAY_NEW_OPERATOR (pattern);
5538 TYPE_GETS_DELETE (type) = TYPE_GETS_DELETE (pattern);
5539 TYPE_HAS_ASSIGN_REF (type) = TYPE_HAS_ASSIGN_REF (pattern);
5540 TYPE_HAS_CONST_ASSIGN_REF (type) = TYPE_HAS_CONST_ASSIGN_REF (pattern);
5541 TYPE_HAS_INIT_REF (type) = TYPE_HAS_INIT_REF (pattern);
5542 TYPE_HAS_CONST_INIT_REF (type) = TYPE_HAS_CONST_INIT_REF (pattern);
5543 TYPE_HAS_DEFAULT_CONSTRUCTOR (type) = TYPE_HAS_DEFAULT_CONSTRUCTOR (pattern);
5544 TYPE_HAS_CONVERSION (type) = TYPE_HAS_CONVERSION (pattern);
5545 TYPE_PACKED (type) = TYPE_PACKED (pattern);
5546 TYPE_ALIGN (type) = TYPE_ALIGN (pattern);
5547 TYPE_USER_ALIGN (type) = TYPE_USER_ALIGN (pattern);
5548 TYPE_FOR_JAVA (type) = TYPE_FOR_JAVA (pattern); /* For libjava's JArray<T> */
5549 if (ANON_AGGR_TYPE_P (pattern))
5550 SET_ANON_AGGR_TYPE_P (type);
5552 pbinfo = TYPE_BINFO (pattern);
5554 /* We should never instantiate a nested class before its enclosing
5555 class; we need to look up the nested class by name before we can
5556 instantiate it, and that lookup should instantiate the enclosing
5558 gcc_assert (!DECL_CLASS_SCOPE_P (TYPE_MAIN_DECL (pattern))
5559 || COMPLETE_TYPE_P (TYPE_CONTEXT (type))
5560 || TYPE_BEING_DEFINED (TYPE_CONTEXT (type)));
5562 base_list = NULL_TREE;
5563 if (BINFO_N_BASE_BINFOS (pbinfo))
5566 tree context = TYPE_CONTEXT (type);
5570 /* We must enter the scope containing the type, as that is where
5571 the accessibility of types named in dependent bases are
5573 pushed_scope = push_scope (context ? context : global_namespace);
5575 /* Substitute into each of the bases to determine the actual
5577 for (i = 0; BINFO_BASE_ITERATE (pbinfo, i, pbase_binfo); i++)
5580 tree access = BINFO_BASE_ACCESS (pbinfo, i);
5582 /* Substitute to figure out the base class. */
5583 base = tsubst (BINFO_TYPE (pbase_binfo), args, tf_error, NULL_TREE);
5584 if (base == error_mark_node)
5587 base_list = tree_cons (access, base, base_list);
5588 if (BINFO_VIRTUAL_P (pbase_binfo))
5589 TREE_TYPE (base_list) = integer_type_node;
5592 /* The list is now in reverse order; correct that. */
5593 base_list = nreverse (base_list);
5596 pop_scope (pushed_scope);
5598 /* Now call xref_basetypes to set up all the base-class
5600 xref_basetypes (type, base_list);
5603 /* Now that our base classes are set up, enter the scope of the
5604 class, so that name lookups into base classes, etc. will work
5605 correctly. This is precisely analogous to what we do in
5606 begin_class_definition when defining an ordinary non-template
5610 /* Now members are processed in the order of declaration. */
5611 for (member = CLASSTYPE_DECL_LIST (pattern);
5612 member; member = TREE_CHAIN (member))
5614 tree t = TREE_VALUE (member);
5616 if (TREE_PURPOSE (member))
5620 /* Build new CLASSTYPE_NESTED_UTDS. */
5623 tree name = TYPE_IDENTIFIER (tag);
5625 bool class_template_p;
5627 class_template_p = (TREE_CODE (tag) != ENUMERAL_TYPE
5628 && TYPE_LANG_SPECIFIC (tag)
5629 && CLASSTYPE_IS_TEMPLATE (tag));
5630 /* If the member is a class template, then -- even after
5631 substitution -- there may be dependent types in the
5632 template argument list for the class. We increment
5633 PROCESSING_TEMPLATE_DECL so that dependent_type_p, as
5634 that function will assume that no types are dependent
5635 when outside of a template. */
5636 if (class_template_p)
5637 ++processing_template_decl;
5638 newtag = tsubst (tag, args, tf_error, NULL_TREE);
5639 if (class_template_p)
5640 --processing_template_decl;
5641 if (newtag == error_mark_node)
5644 if (TREE_CODE (newtag) != ENUMERAL_TYPE)
5646 if (class_template_p)
5647 /* Unfortunately, lookup_template_class sets
5648 CLASSTYPE_IMPLICIT_INSTANTIATION for a partial
5649 instantiation (i.e., for the type of a member
5650 template class nested within a template class.)
5651 This behavior is required for
5652 maybe_process_partial_specialization to work
5653 correctly, but is not accurate in this case;
5654 the TAG is not an instantiation of anything.
5655 (The corresponding TEMPLATE_DECL is an
5656 instantiation, but the TYPE is not.) */
5657 CLASSTYPE_USE_TEMPLATE (newtag) = 0;
5659 /* Now, we call pushtag to put this NEWTAG into the scope of
5660 TYPE. We first set up the IDENTIFIER_TYPE_VALUE to avoid
5661 pushtag calling push_template_decl. We don't have to do
5662 this for enums because it will already have been done in
5665 SET_IDENTIFIER_TYPE_VALUE (name, newtag);
5666 pushtag (name, newtag, /*tag_scope=*/ts_current);
5669 else if (TREE_CODE (t) == FUNCTION_DECL
5670 || DECL_FUNCTION_TEMPLATE_P (t))
5672 /* Build new TYPE_METHODS. */
5675 if (TREE_CODE (t) == TEMPLATE_DECL)
5676 ++processing_template_decl;
5677 r = tsubst (t, args, tf_error, NULL_TREE);
5678 if (TREE_CODE (t) == TEMPLATE_DECL)
5679 --processing_template_decl;
5680 set_current_access_from_decl (r);
5681 grok_special_member_properties (r);
5682 finish_member_declaration (r);
5686 /* Build new TYPE_FIELDS. */
5688 if (TREE_CODE (t) != CONST_DECL)
5692 /* The the file and line for this declaration, to
5693 assist in error message reporting. Since we
5694 called push_tinst_level above, we don't need to
5696 input_location = DECL_SOURCE_LOCATION (t);
5698 if (TREE_CODE (t) == TEMPLATE_DECL)
5699 ++processing_template_decl;
5700 r = tsubst (t, args, tf_error | tf_warning, NULL_TREE);
5701 if (TREE_CODE (t) == TEMPLATE_DECL)
5702 --processing_template_decl;
5703 if (TREE_CODE (r) == VAR_DECL)
5707 if (DECL_INITIALIZED_IN_CLASS_P (r))
5708 init = tsubst_expr (DECL_INITIAL (t), args,
5709 tf_error | tf_warning, NULL_TREE);
5713 finish_static_data_member_decl
5714 (r, init, /*asmspec_tree=*/NULL_TREE, /*flags=*/0);
5716 if (DECL_INITIALIZED_IN_CLASS_P (r))
5717 check_static_variable_definition (r, TREE_TYPE (r));
5719 else if (TREE_CODE (r) == FIELD_DECL)
5721 /* Determine whether R has a valid type and can be
5722 completed later. If R is invalid, then it is
5723 replaced by error_mark_node so that it will not be
5724 added to TYPE_FIELDS. */
5725 tree rtype = TREE_TYPE (r);
5726 if (can_complete_type_without_circularity (rtype))
5727 complete_type (rtype);
5729 if (!COMPLETE_TYPE_P (rtype))
5731 cxx_incomplete_type_error (r, rtype);
5732 r = error_mark_node;
5736 /* If it is a TYPE_DECL for a class-scoped ENUMERAL_TYPE,
5737 such a thing will already have been added to the field
5738 list by tsubst_enum in finish_member_declaration in the
5739 CLASSTYPE_NESTED_UTDS case above. */
5740 if (!(TREE_CODE (r) == TYPE_DECL
5741 && TREE_CODE (TREE_TYPE (r)) == ENUMERAL_TYPE
5742 && DECL_ARTIFICIAL (r)))
5744 set_current_access_from_decl (r);
5745 finish_member_declaration (r);
5752 if (TYPE_P (t) || DECL_CLASS_TEMPLATE_P (t))
5754 /* Build new CLASSTYPE_FRIEND_CLASSES. */
5756 tree friend_type = t;
5757 bool adjust_processing_template_decl = false;
5759 if (TREE_CODE (friend_type) == TEMPLATE_DECL)
5761 /* template <class T> friend class C; */
5762 friend_type = tsubst_friend_class (friend_type, args);
5763 adjust_processing_template_decl = true;
5765 else if (TREE_CODE (friend_type) == UNBOUND_CLASS_TEMPLATE)
5767 /* template <class T> friend class C::D; */
5768 friend_type = tsubst (friend_type, args,
5769 tf_error | tf_warning, NULL_TREE);
5770 if (TREE_CODE (friend_type) == TEMPLATE_DECL)
5771 friend_type = TREE_TYPE (friend_type);
5772 adjust_processing_template_decl = true;
5774 else if (TREE_CODE (friend_type) == TYPENAME_TYPE)
5776 /* This could be either
5780 when dependent_type_p is false or
5782 template <class U> friend class T::C;
5785 friend_type = tsubst (friend_type, args,
5786 tf_error | tf_warning, NULL_TREE);
5787 /* Bump processing_template_decl for correct
5788 dependent_type_p calculation. */
5789 ++processing_template_decl;
5790 if (dependent_type_p (friend_type))
5791 adjust_processing_template_decl = true;
5792 --processing_template_decl;
5794 else if (!CLASSTYPE_USE_TEMPLATE (friend_type)
5795 && hidden_name_p (TYPE_NAME (friend_type)))
5799 where C hasn't been declared yet. Let's lookup name
5800 from namespace scope directly, bypassing any name that
5801 come from dependent base class. */
5802 tree ns = decl_namespace_context (TYPE_MAIN_DECL (friend_type));
5804 /* The call to xref_tag_from_type does injection for friend
5806 push_nested_namespace (ns);
5808 xref_tag_from_type (friend_type, NULL_TREE,
5809 /*tag_scope=*/ts_current);
5810 pop_nested_namespace (ns);
5812 else if (uses_template_parms (friend_type))
5813 /* friend class C<T>; */
5814 friend_type = tsubst (friend_type, args,
5815 tf_error | tf_warning, NULL_TREE);
5820 where C is already declared or
5822 friend class C<int>;
5824 We don't have to do anything in these cases. */
5826 if (adjust_processing_template_decl)
5827 /* Trick make_friend_class into realizing that the friend
5828 we're adding is a template, not an ordinary class. It's
5829 important that we use make_friend_class since it will
5830 perform some error-checking and output cross-reference
5832 ++processing_template_decl;
5834 if (friend_type != error_mark_node)
5835 make_friend_class (type, friend_type, /*complain=*/false);
5837 if (adjust_processing_template_decl)
5838 --processing_template_decl;
5842 /* Build new DECL_FRIENDLIST. */
5845 /* The the file and line for this declaration, to
5846 assist in error message reporting. Since we
5847 called push_tinst_level above, we don't need to
5849 input_location = DECL_SOURCE_LOCATION (t);
5851 if (TREE_CODE (t) == TEMPLATE_DECL)
5853 ++processing_template_decl;
5854 push_deferring_access_checks (dk_no_check);
5857 r = tsubst_friend_function (t, args);
5858 add_friend (type, r, /*complain=*/false);
5859 if (TREE_CODE (t) == TEMPLATE_DECL)
5861 pop_deferring_access_checks ();
5862 --processing_template_decl;
5868 /* Set the file and line number information to whatever is given for
5869 the class itself. This puts error messages involving generated
5870 implicit functions at a predictable point, and the same point
5871 that would be used for non-template classes. */
5872 input_location = DECL_SOURCE_LOCATION (typedecl);
5874 unreverse_member_declarations (type);
5875 finish_struct_1 (type);
5876 TYPE_BEING_DEFINED (type) = 0;
5878 /* Now that the class is complete, instantiate default arguments for
5879 any member functions. We don't do this earlier because the
5880 default arguments may reference members of the class. */
5881 if (!PRIMARY_TEMPLATE_P (template))
5882 for (t = TYPE_METHODS (type); t; t = TREE_CHAIN (t))
5883 if (TREE_CODE (t) == FUNCTION_DECL
5884 /* Implicitly generated member functions will not have template
5885 information; they are not instantiations, but instead are
5886 created "fresh" for each instantiation. */
5887 && DECL_TEMPLATE_INFO (t))
5888 tsubst_default_arguments (t);
5891 pop_from_top_level ();
5892 pop_deferring_access_checks ();
5895 /* The vtable for a template class can be emitted in any translation
5896 unit in which the class is instantiated. When there is no key
5897 method, however, finish_struct_1 will already have added TYPE to
5898 the keyed_classes list. */
5899 if (TYPE_CONTAINS_VPTR_P (type) && CLASSTYPE_KEY_METHOD (type))
5900 keyed_classes = tree_cons (NULL_TREE, type, keyed_classes);
5906 tsubst_template_arg (tree t, tree args, tsubst_flags_t complain, tree in_decl)
5912 else if (TYPE_P (t))
5913 r = tsubst (t, args, complain, in_decl);
5916 r = tsubst_expr (t, args, complain, in_decl);
5918 if (!uses_template_parms (r))
5920 /* Sometimes, one of the args was an expression involving a
5921 template constant parameter, like N - 1. Now that we've
5922 tsubst'd, we might have something like 2 - 1. This will
5923 confuse lookup_template_class, so we do constant folding
5924 here. We have to unset processing_template_decl, to fool
5925 tsubst_copy_and_build() into building an actual tree. */
5927 /* If the TREE_TYPE of ARG is not NULL_TREE, ARG is already
5928 as simple as it's going to get, and trying to reprocess
5929 the trees will break. Once tsubst_expr et al DTRT for
5930 non-dependent exprs, this code can go away, as the type
5931 will always be set. */
5934 int saved_processing_template_decl = processing_template_decl;
5935 processing_template_decl = 0;
5936 r = tsubst_copy_and_build (r, /*args=*/NULL_TREE,
5937 tf_error, /*in_decl=*/NULL_TREE,
5938 /*function_p=*/false);
5939 processing_template_decl = saved_processing_template_decl;
5947 /* Substitute ARGS into the vector or list of template arguments T. */
5950 tsubst_template_args (tree t, tree args, tsubst_flags_t complain, tree in_decl)
5952 int len = TREE_VEC_LENGTH (t);
5953 int need_new = 0, i;
5954 tree *elts = alloca (len * sizeof (tree));
5956 for (i = 0; i < len; i++)
5958 tree orig_arg = TREE_VEC_ELT (t, i);
5961 if (TREE_CODE (orig_arg) == TREE_VEC)
5962 new_arg = tsubst_template_args (orig_arg, args, complain, in_decl);
5964 new_arg = tsubst_template_arg (orig_arg, args, complain, in_decl);
5966 if (new_arg == error_mark_node)
5967 return error_mark_node;
5970 if (new_arg != orig_arg)
5977 t = make_tree_vec (len);
5978 for (i = 0; i < len; i++)
5979 TREE_VEC_ELT (t, i) = elts[i];
5984 /* Return the result of substituting ARGS into the template parameters
5985 given by PARMS. If there are m levels of ARGS and m + n levels of
5986 PARMS, then the result will contain n levels of PARMS. For
5987 example, if PARMS is `template <class T> template <class U>
5988 template <T*, U, class V>' and ARGS is {{int}, {double}} then the
5989 result will be `template <int*, double, class V>'. */
5992 tsubst_template_parms (tree parms, tree args, tsubst_flags_t complain)
5997 for (new_parms = &r;
5998 TMPL_PARMS_DEPTH (parms) > TMPL_ARGS_DEPTH (args);
5999 new_parms = &(TREE_CHAIN (*new_parms)),
6000 parms = TREE_CHAIN (parms))
6003 make_tree_vec (TREE_VEC_LENGTH (TREE_VALUE (parms)));
6006 for (i = 0; i < TREE_VEC_LENGTH (new_vec); ++i)
6008 tree tuple = TREE_VEC_ELT (TREE_VALUE (parms), i);
6009 tree default_value = TREE_PURPOSE (tuple);
6010 tree parm_decl = TREE_VALUE (tuple);
6012 parm_decl = tsubst (parm_decl, args, complain, NULL_TREE);
6013 default_value = tsubst_template_arg (default_value, args,
6014 complain, NULL_TREE);
6016 tuple = build_tree_list (default_value, parm_decl);
6017 TREE_VEC_ELT (new_vec, i) = tuple;
6021 tree_cons (size_int (TMPL_PARMS_DEPTH (parms)
6022 - TMPL_ARGS_DEPTH (args)),
6023 new_vec, NULL_TREE);
6029 /* Substitute the ARGS into the indicated aggregate (or enumeration)
6030 type T. If T is not an aggregate or enumeration type, it is
6031 handled as if by tsubst. IN_DECL is as for tsubst. If
6032 ENTERING_SCOPE is nonzero, T is the context for a template which
6033 we are presently tsubst'ing. Return the substituted value. */
6036 tsubst_aggr_type (tree t,
6038 tsubst_flags_t complain,
6045 switch (TREE_CODE (t))
6048 if (TYPE_PTRMEMFUNC_P (t))
6049 return tsubst (TYPE_PTRMEMFUNC_FN_TYPE (t), args, complain, in_decl);
6051 /* Else fall through. */
6054 if (TYPE_TEMPLATE_INFO (t))
6060 /* First, determine the context for the type we are looking
6062 context = TYPE_CONTEXT (t);
6064 context = tsubst_aggr_type (context, args, complain,
6065 in_decl, /*entering_scope=*/1);
6067 /* Then, figure out what arguments are appropriate for the
6068 type we are trying to find. For example, given:
6070 template <class T> struct S;
6071 template <class T, class U> void f(T, U) { S<U> su; }
6073 and supposing that we are instantiating f<int, double>,
6074 then our ARGS will be {int, double}, but, when looking up
6075 S we only want {double}. */
6076 argvec = tsubst_template_args (TYPE_TI_ARGS (t), args,
6078 if (argvec == error_mark_node)
6079 return error_mark_node;
6081 r = lookup_template_class (t, argvec, in_decl, context,
6082 entering_scope, complain);
6084 return cp_build_qualified_type_real (r, TYPE_QUALS (t), complain);
6087 /* This is not a template type, so there's nothing to do. */
6091 return tsubst (t, args, complain, in_decl);
6095 /* Substitute into the default argument ARG (a default argument for
6096 FN), which has the indicated TYPE. */
6099 tsubst_default_argument (tree fn, tree type, tree arg)
6101 tree saved_class_ptr = NULL_TREE;
6102 tree saved_class_ref = NULL_TREE;
6104 /* This default argument came from a template. Instantiate the
6105 default argument here, not in tsubst. In the case of
6114 we must be careful to do name lookup in the scope of S<T>,
6115 rather than in the current class. */
6116 push_access_scope (fn);
6117 /* The default argument expression should not be considered to be
6118 within the scope of FN. Since push_access_scope sets
6119 current_function_decl, we must explicitly clear it here. */
6120 current_function_decl = NULL_TREE;
6121 /* The "this" pointer is not valid in a default argument. */
6124 saved_class_ptr = current_class_ptr;
6125 cp_function_chain->x_current_class_ptr = NULL_TREE;
6126 saved_class_ref = current_class_ref;
6127 cp_function_chain->x_current_class_ref = NULL_TREE;
6130 push_deferring_access_checks(dk_no_deferred);
6131 arg = tsubst_expr (arg, DECL_TI_ARGS (fn),
6132 tf_error | tf_warning, NULL_TREE);
6133 pop_deferring_access_checks();
6135 /* Restore the "this" pointer. */
6138 cp_function_chain->x_current_class_ptr = saved_class_ptr;
6139 cp_function_chain->x_current_class_ref = saved_class_ref;
6142 pop_access_scope (fn);
6144 /* Make sure the default argument is reasonable. */
6145 arg = check_default_argument (type, arg);
6150 /* Substitute into all the default arguments for FN. */
6153 tsubst_default_arguments (tree fn)
6158 tmpl_args = DECL_TI_ARGS (fn);
6160 /* If this function is not yet instantiated, we certainly don't need
6161 its default arguments. */
6162 if (uses_template_parms (tmpl_args))
6165 for (arg = TYPE_ARG_TYPES (TREE_TYPE (fn));
6167 arg = TREE_CHAIN (arg))
6168 if (TREE_PURPOSE (arg))
6169 TREE_PURPOSE (arg) = tsubst_default_argument (fn,
6171 TREE_PURPOSE (arg));
6174 /* Substitute the ARGS into the T, which is a _DECL. Return the
6175 result of the substitution. Issue error and warning messages under
6176 control of COMPLAIN. */
6179 tsubst_decl (tree t, tree args, tsubst_flags_t complain)
6181 location_t saved_loc;
6185 /* Set the filename and linenumber to improve error-reporting. */
6186 saved_loc = input_location;
6187 input_location = DECL_SOURCE_LOCATION (t);
6189 switch (TREE_CODE (t))
6193 /* We can get here when processing a member function template,
6194 member class template, and template template parameter of
6195 a template class. */
6196 tree decl = DECL_TEMPLATE_RESULT (t);
6201 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t))
6203 /* Template template parameter is treated here. */
6204 tree new_type = tsubst (TREE_TYPE (t), args, complain, in_decl);
6205 if (new_type == error_mark_node)
6206 return error_mark_node;
6209 TREE_CHAIN (r) = NULL_TREE;
6210 TREE_TYPE (r) = new_type;
6211 DECL_TEMPLATE_RESULT (r)
6212 = build_decl (TYPE_DECL, DECL_NAME (decl), new_type);
6213 DECL_TEMPLATE_PARMS (r)
6214 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t), args,
6216 TYPE_NAME (new_type) = r;
6220 /* We might already have an instance of this template.
6221 The ARGS are for the surrounding class type, so the
6222 full args contain the tsubst'd args for the context,
6223 plus the innermost args from the template decl. */
6224 tmpl_args = DECL_CLASS_TEMPLATE_P (t)
6225 ? CLASSTYPE_TI_ARGS (TREE_TYPE (t))
6226 : DECL_TI_ARGS (DECL_TEMPLATE_RESULT (t));
6227 full_args = tsubst_template_args (tmpl_args, args,
6230 /* tsubst_template_args doesn't copy the vector if
6231 nothing changed. But, *something* should have
6233 gcc_assert (full_args != tmpl_args);
6235 spec = retrieve_specialization (t, full_args,
6236 /*class_specializations_p=*/true);
6237 if (spec != NULL_TREE)
6243 /* Make a new template decl. It will be similar to the
6244 original, but will record the current template arguments.
6245 We also create a new function declaration, which is just
6246 like the old one, but points to this new template, rather
6247 than the old one. */
6249 gcc_assert (DECL_LANG_SPECIFIC (r) != 0);
6250 TREE_CHAIN (r) = NULL_TREE;
6253 = tsubst_aggr_type (DECL_CONTEXT (t), args,
6255 /*entering_scope=*/1);
6256 DECL_TEMPLATE_INFO (r) = build_tree_list (t, args);
6258 if (TREE_CODE (decl) == TYPE_DECL)
6260 tree new_type = tsubst (TREE_TYPE (t), args, complain, in_decl);
6261 if (new_type == error_mark_node)
6262 return error_mark_node;
6264 TREE_TYPE (r) = new_type;
6265 CLASSTYPE_TI_TEMPLATE (new_type) = r;
6266 DECL_TEMPLATE_RESULT (r) = TYPE_MAIN_DECL (new_type);
6267 DECL_TI_ARGS (r) = CLASSTYPE_TI_ARGS (new_type);
6271 tree new_decl = tsubst (decl, args, complain, in_decl);
6272 if (new_decl == error_mark_node)
6273 return error_mark_node;
6275 DECL_TEMPLATE_RESULT (r) = new_decl;
6276 DECL_TI_TEMPLATE (new_decl) = r;
6277 TREE_TYPE (r) = TREE_TYPE (new_decl);
6278 DECL_TI_ARGS (r) = DECL_TI_ARGS (new_decl);
6281 SET_DECL_IMPLICIT_INSTANTIATION (r);
6282 DECL_TEMPLATE_INSTANTIATIONS (r) = NULL_TREE;
6283 DECL_TEMPLATE_SPECIALIZATIONS (r) = NULL_TREE;
6285 /* The template parameters for this new template are all the
6286 template parameters for the old template, except the
6287 outermost level of parameters. */
6288 DECL_TEMPLATE_PARMS (r)
6289 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t), args,
6292 if (PRIMARY_TEMPLATE_P (t))
6293 DECL_PRIMARY_TEMPLATE (r) = r;
6295 if (TREE_CODE (decl) != TYPE_DECL)
6296 /* Record this non-type partial instantiation. */
6297 register_specialization (r, t,
6298 DECL_TI_ARGS (DECL_TEMPLATE_RESULT (r)));
6305 tree argvec = NULL_TREE;
6313 /* Nobody should be tsubst'ing into non-template functions. */
6314 gcc_assert (DECL_TEMPLATE_INFO (t) != NULL_TREE);
6316 if (TREE_CODE (DECL_TI_TEMPLATE (t)) == TEMPLATE_DECL)
6321 /* If T is not dependent, just return it. We have to
6322 increment PROCESSING_TEMPLATE_DECL because
6323 value_dependent_expression_p assumes that nothing is
6324 dependent when PROCESSING_TEMPLATE_DECL is zero. */
6325 ++processing_template_decl;
6326 dependent_p = value_dependent_expression_p (t);
6327 --processing_template_decl;
6331 /* Calculate the most general template of which R is a
6332 specialization, and the complete set of arguments used to
6334 gen_tmpl = most_general_template (DECL_TI_TEMPLATE (t));
6335 argvec = tsubst_template_args (DECL_TI_ARGS
6336 (DECL_TEMPLATE_RESULT (gen_tmpl)),
6337 args, complain, in_decl);
6339 /* Check to see if we already have this specialization. */
6340 spec = retrieve_specialization (gen_tmpl, argvec,
6341 /*class_specializations_p=*/false);
6349 /* We can see more levels of arguments than parameters if
6350 there was a specialization of a member template, like
6353 template <class T> struct S { template <class U> void f(); }
6354 template <> template <class U> void S<int>::f(U);
6356 Here, we'll be substituting into the specialization,
6357 because that's where we can find the code we actually
6358 want to generate, but we'll have enough arguments for
6359 the most general template.
6361 We also deal with the peculiar case:
6363 template <class T> struct S {
6364 template <class U> friend void f();
6366 template <class U> void f() {}
6368 template void f<double>();
6370 Here, the ARGS for the instantiation of will be {int,
6371 double}. But, we only need as many ARGS as there are
6372 levels of template parameters in CODE_PATTERN. We are
6373 careful not to get fooled into reducing the ARGS in
6376 template <class T> struct S { template <class U> void f(U); }
6377 template <class T> template <> void S<T>::f(int) {}
6379 which we can spot because the pattern will be a
6380 specialization in this case. */
6381 args_depth = TMPL_ARGS_DEPTH (args);
6383 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (t)));
6384 if (args_depth > parms_depth
6385 && !DECL_TEMPLATE_SPECIALIZATION (t))
6386 args = get_innermost_template_args (args, parms_depth);
6390 /* This special case arises when we have something like this:
6392 template <class T> struct S {
6393 friend void f<int>(int, double);
6396 Here, the DECL_TI_TEMPLATE for the friend declaration
6397 will be an IDENTIFIER_NODE. We are being called from
6398 tsubst_friend_function, and we want only to create a
6399 new decl (R) with appropriate types so that we can call
6400 determine_specialization. */
6401 gen_tmpl = NULL_TREE;
6404 if (DECL_CLASS_SCOPE_P (t))
6406 if (DECL_NAME (t) == constructor_name (DECL_CONTEXT (t)))
6410 ctx = tsubst_aggr_type (DECL_CONTEXT (t), args,
6411 complain, t, /*entering_scope=*/1);
6416 ctx = DECL_CONTEXT (t);
6418 type = tsubst (TREE_TYPE (t), args, complain, in_decl);
6419 if (type == error_mark_node)
6420 return error_mark_node;
6422 /* We do NOT check for matching decls pushed separately at this
6423 point, as they may not represent instantiations of this
6424 template, and in any case are considered separate under the
6427 DECL_USE_TEMPLATE (r) = 0;
6428 TREE_TYPE (r) = type;
6429 /* Clear out the mangled name and RTL for the instantiation. */
6430 SET_DECL_ASSEMBLER_NAME (r, NULL_TREE);
6431 SET_DECL_RTL (r, NULL_RTX);
6432 DECL_INITIAL (r) = NULL_TREE;
6433 DECL_CONTEXT (r) = ctx;
6435 if (member && DECL_CONV_FN_P (r))
6436 /* Type-conversion operator. Reconstruct the name, in
6437 case it's the name of one of the template's parameters. */
6438 DECL_NAME (r) = mangle_conv_op_name_for_type (TREE_TYPE (type));
6440 DECL_ARGUMENTS (r) = tsubst (DECL_ARGUMENTS (t), args,
6442 DECL_RESULT (r) = NULL_TREE;
6444 TREE_STATIC (r) = 0;
6445 TREE_PUBLIC (r) = TREE_PUBLIC (t);
6446 DECL_EXTERNAL (r) = 1;
6447 /* If this is an instantiation of a function with internal
6448 linkage, we already know what object file linkage will be
6449 assigned to the instantiation. */
6450 DECL_INTERFACE_KNOWN (r) = !TREE_PUBLIC (r);
6451 DECL_DEFER_OUTPUT (r) = 0;
6452 TREE_CHAIN (r) = NULL_TREE;
6453 DECL_PENDING_INLINE_INFO (r) = 0;
6454 DECL_PENDING_INLINE_P (r) = 0;
6455 DECL_SAVED_TREE (r) = NULL_TREE;
6457 if (DECL_CLONED_FUNCTION (r))
6459 DECL_CLONED_FUNCTION (r) = tsubst (DECL_CLONED_FUNCTION (t),
6461 TREE_CHAIN (r) = TREE_CHAIN (DECL_CLONED_FUNCTION (r));
6462 TREE_CHAIN (DECL_CLONED_FUNCTION (r)) = r;
6465 /* Set up the DECL_TEMPLATE_INFO for R. There's no need to do
6466 this in the special friend case mentioned above where
6467 GEN_TMPL is NULL. */
6470 DECL_TEMPLATE_INFO (r)
6471 = tree_cons (gen_tmpl, argvec, NULL_TREE);
6472 SET_DECL_IMPLICIT_INSTANTIATION (r);
6473 register_specialization (r, gen_tmpl, argvec);
6475 /* We're not supposed to instantiate default arguments
6476 until they are called, for a template. But, for a
6479 template <class T> void f ()
6480 { extern void g(int i = T()); }
6482 we should do the substitution when the template is
6483 instantiated. We handle the member function case in
6484 instantiate_class_template since the default arguments
6485 might refer to other members of the class. */
6487 && !PRIMARY_TEMPLATE_P (gen_tmpl)
6488 && !uses_template_parms (argvec))
6489 tsubst_default_arguments (r);
6492 /* Copy the list of befriending classes. */
6493 for (friends = &DECL_BEFRIENDING_CLASSES (r);
6495 friends = &TREE_CHAIN (*friends))
6497 *friends = copy_node (*friends);
6498 TREE_VALUE (*friends) = tsubst (TREE_VALUE (*friends),
6503 if (DECL_CONSTRUCTOR_P (r) || DECL_DESTRUCTOR_P (r))
6505 maybe_retrofit_in_chrg (r);
6506 if (DECL_CONSTRUCTOR_P (r))
6507 grok_ctor_properties (ctx, r);
6508 /* If this is an instantiation of a member template, clone it.
6509 If it isn't, that'll be handled by
6510 clone_constructors_and_destructors. */
6511 if (PRIMARY_TEMPLATE_P (gen_tmpl))
6512 clone_function_decl (r, /*update_method_vec_p=*/0);
6514 else if (IDENTIFIER_OPNAME_P (DECL_NAME (r)))
6515 grok_op_properties (r, DECL_FRIEND_P (r),
6516 (complain & tf_error) != 0);
6518 if (DECL_FRIEND_P (t) && DECL_FRIEND_CONTEXT (t))
6519 SET_DECL_FRIEND_CONTEXT (r,
6520 tsubst (DECL_FRIEND_CONTEXT (t),
6521 args, complain, in_decl));
6530 if (DECL_TEMPLATE_PARM_P (t))
6531 SET_DECL_TEMPLATE_PARM_P (r);
6533 type = tsubst (TREE_TYPE (t), args, complain, in_decl);
6534 type = type_decays_to (type);
6535 TREE_TYPE (r) = type;
6536 cp_apply_type_quals_to_decl (cp_type_quals (type), r);
6538 if (DECL_INITIAL (r))
6540 if (TREE_CODE (DECL_INITIAL (r)) != TEMPLATE_PARM_INDEX)
6541 DECL_INITIAL (r) = TREE_TYPE (r);
6543 DECL_INITIAL (r) = tsubst (DECL_INITIAL (r), args,
6547 DECL_CONTEXT (r) = NULL_TREE;
6549 if (!DECL_TEMPLATE_PARM_P (r))
6550 DECL_ARG_TYPE (r) = type_passed_as (type);
6552 TREE_CHAIN (r) = tsubst (TREE_CHAIN (t), args,
6553 complain, TREE_CHAIN (t));
6562 type = tsubst (TREE_TYPE (t), args, complain, in_decl);
6563 if (type == error_mark_node)
6564 return error_mark_node;
6565 TREE_TYPE (r) = type;
6566 cp_apply_type_quals_to_decl (cp_type_quals (type), r);
6568 /* We don't have to set DECL_CONTEXT here; it is set by
6569 finish_member_declaration. */
6570 DECL_INITIAL (r) = tsubst_expr (DECL_INITIAL (t), args,
6572 TREE_CHAIN (r) = NULL_TREE;
6573 if (VOID_TYPE_P (type))
6574 cp_error_at ("instantiation of %qD as type %qT", r, type);
6581 /* It is not a dependent using decl any more. */
6582 TREE_TYPE (r) = void_type_node;
6584 = tsubst_copy (DECL_INITIAL (t), args, complain, in_decl);
6586 = tsubst_copy (DECL_NAME (t), args, complain, in_decl);
6587 TREE_CHAIN (r) = NULL_TREE;
6594 tree argvec = NULL_TREE;
6595 tree gen_tmpl = NULL_TREE;
6597 tree tmpl = NULL_TREE;
6599 tree type = NULL_TREE;
6602 if (TREE_CODE (t) == TYPE_DECL)
6604 type = tsubst (TREE_TYPE (t), args, complain, in_decl);
6605 if (TREE_CODE (type) == TEMPLATE_TEMPLATE_PARM
6606 || t == TYPE_MAIN_DECL (TREE_TYPE (t)))
6608 /* If this is the canonical decl, we don't have to
6609 mess with instantiations, and often we can't (for
6610 typename, template type parms and such). Note that
6611 TYPE_NAME is not correct for the above test if
6612 we've copied the type for a typedef. */
6613 r = TYPE_NAME (type);
6618 /* Assume this is a non-local variable. */
6621 if (TYPE_P (CP_DECL_CONTEXT (t)))
6622 ctx = tsubst_aggr_type (DECL_CONTEXT (t), args,
6624 in_decl, /*entering_scope=*/1);
6625 else if (DECL_NAMESPACE_SCOPE_P (t))
6626 ctx = DECL_CONTEXT (t);
6629 /* Subsequent calls to pushdecl will fill this in. */
6634 /* Check to see if we already have this specialization. */
6637 tmpl = DECL_TI_TEMPLATE (t);
6638 gen_tmpl = most_general_template (tmpl);
6639 argvec = tsubst (DECL_TI_ARGS (t), args, complain, in_decl);
6640 spec = retrieve_specialization (gen_tmpl, argvec,
6641 /*class_specializations_p=*/false);
6644 spec = retrieve_local_specialization (t);
6653 if (TREE_CODE (r) == VAR_DECL)
6655 type = tsubst (TREE_TYPE (t), args, complain, in_decl);
6656 if (type == error_mark_node)
6657 return error_mark_node;
6658 type = complete_type (type);
6659 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (r)
6660 = DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (t);
6661 type = check_var_type (DECL_NAME (r), type);
6663 else if (DECL_SELF_REFERENCE_P (t))
6664 SET_DECL_SELF_REFERENCE_P (r);
6665 TREE_TYPE (r) = type;
6666 cp_apply_type_quals_to_decl (cp_type_quals (type), r);
6667 DECL_CONTEXT (r) = ctx;
6668 /* Clear out the mangled name and RTL for the instantiation. */
6669 SET_DECL_ASSEMBLER_NAME (r, NULL_TREE);
6670 SET_DECL_RTL (r, NULL_RTX);
6672 /* Don't try to expand the initializer until someone tries to use
6673 this variable; otherwise we run into circular dependencies. */
6674 DECL_INITIAL (r) = NULL_TREE;
6675 SET_DECL_RTL (r, NULL_RTX);
6676 DECL_SIZE (r) = DECL_SIZE_UNIT (r) = 0;
6678 /* Even if the original location is out of scope, the newly
6679 substituted one is not. */
6680 if (TREE_CODE (r) == VAR_DECL)
6682 DECL_DEAD_FOR_LOCAL (r) = 0;
6683 DECL_INITIALIZED_P (r) = 0;
6688 /* A static data member declaration is always marked
6689 external when it is declared in-class, even if an
6690 initializer is present. We mimic the non-template
6692 DECL_EXTERNAL (r) = 1;
6694 register_specialization (r, gen_tmpl, argvec);
6695 DECL_TEMPLATE_INFO (r) = tree_cons (tmpl, argvec, NULL_TREE);
6696 SET_DECL_IMPLICIT_INSTANTIATION (r);
6699 register_local_specialization (r, t);
6701 TREE_CHAIN (r) = NULL_TREE;
6710 /* Restore the file and line information. */
6711 input_location = saved_loc;
6716 /* Substitute into the ARG_TYPES of a function type. */
6719 tsubst_arg_types (tree arg_types,
6721 tsubst_flags_t complain,
6724 tree remaining_arg_types;
6727 if (!arg_types || arg_types == void_list_node)
6730 remaining_arg_types = tsubst_arg_types (TREE_CHAIN (arg_types),
6731 args, complain, in_decl);
6732 if (remaining_arg_types == error_mark_node)
6733 return error_mark_node;
6735 type = tsubst (TREE_VALUE (arg_types), args, complain, in_decl);
6736 if (type == error_mark_node)
6737 return error_mark_node;
6738 if (VOID_TYPE_P (type))
6740 if (complain & tf_error)
6742 error ("invalid parameter type %qT", type);
6744 cp_error_at ("in declaration %qD", in_decl);
6746 return error_mark_node;
6749 /* Do array-to-pointer, function-to-pointer conversion, and ignore
6750 top-level qualifiers as required. */
6751 type = TYPE_MAIN_VARIANT (type_decays_to (type));
6753 /* Note that we do not substitute into default arguments here. The
6754 standard mandates that they be instantiated only when needed,
6755 which is done in build_over_call. */
6756 return hash_tree_cons (TREE_PURPOSE (arg_types), type,
6757 remaining_arg_types);
6761 /* Substitute into a FUNCTION_TYPE or METHOD_TYPE. This routine does
6762 *not* handle the exception-specification for FNTYPE, because the
6763 initial substitution of explicitly provided template parameters
6764 during argument deduction forbids substitution into the
6765 exception-specification:
6769 All references in the function type of the function template to the
6770 corresponding template parameters are replaced by the specified tem-
6771 plate argument values. If a substitution in a template parameter or
6772 in the function type of the function template results in an invalid
6773 type, type deduction fails. [Note: The equivalent substitution in
6774 exception specifications is done only when the function is instanti-
6775 ated, at which point a program is ill-formed if the substitution
6776 results in an invalid type.] */
6779 tsubst_function_type (tree t,
6781 tsubst_flags_t complain,
6788 /* The TYPE_CONTEXT is not used for function/method types. */
6789 gcc_assert (TYPE_CONTEXT (t) == NULL_TREE);
6791 /* Substitute the return type. */
6792 return_type = tsubst (TREE_TYPE (t), args, complain, in_decl);
6793 if (return_type == error_mark_node)
6794 return error_mark_node;
6795 /* The standard does not presently indicate that creation of a
6796 function type with an invalid return type is a deduction failure.
6797 However, that is clearly analogous to creating an array of "void"
6798 or a reference to a reference. This is core issue #486. */
6799 if (TREE_CODE (return_type) == ARRAY_TYPE
6800 || TREE_CODE (return_type) == FUNCTION_TYPE)
6802 if (complain & tf_error)
6804 if (TREE_CODE (return_type) == ARRAY_TYPE)
6805 error ("function returning an array");
6807 error ("function returning a function");
6809 return error_mark_node;
6812 /* Substitute the argument types. */
6813 arg_types = tsubst_arg_types (TYPE_ARG_TYPES (t), args,
6815 if (arg_types == error_mark_node)
6816 return error_mark_node;
6818 /* Construct a new type node and return it. */
6819 if (TREE_CODE (t) == FUNCTION_TYPE)
6820 fntype = build_function_type (return_type, arg_types);
6823 tree r = TREE_TYPE (TREE_VALUE (arg_types));
6824 if (! IS_AGGR_TYPE (r))
6828 Type deduction may fail for any of the following
6831 -- Attempting to create "pointer to member of T" when T
6832 is not a class type. */
6833 if (complain & tf_error)
6834 error ("creating pointer to member function of non-class type %qT",
6836 return error_mark_node;
6839 fntype = build_method_type_directly (r, return_type,
6840 TREE_CHAIN (arg_types));
6842 fntype = cp_build_qualified_type_real (fntype, TYPE_QUALS (t), complain);
6843 fntype = cp_build_type_attribute_variant (fntype, TYPE_ATTRIBUTES (t));
6848 /* FNTYPE is a FUNCTION_TYPE or METHOD_TYPE. Substitute the template
6849 ARGS into that specification, and return the substituted
6850 specification. If there is no specification, return NULL_TREE. */
6853 tsubst_exception_specification (tree fntype,
6855 tsubst_flags_t complain,
6861 specs = TYPE_RAISES_EXCEPTIONS (fntype);
6862 new_specs = NULL_TREE;
6865 if (! TREE_VALUE (specs))
6871 spec = tsubst (TREE_VALUE (specs), args, complain, in_decl);
6872 if (spec == error_mark_node)
6874 new_specs = add_exception_specifier (new_specs, spec, complain);
6875 specs = TREE_CHAIN (specs);
6881 /* Substitute into the PARMS of a call-declarator. */
6884 tsubst_call_declarator_parms (tree parms,
6886 tsubst_flags_t complain,
6893 if (!parms || parms == void_list_node)
6896 new_parms = tsubst_call_declarator_parms (TREE_CHAIN (parms),
6897 args, complain, in_decl);
6899 /* Figure out the type of this parameter. */
6900 type = tsubst (TREE_VALUE (parms), args, complain, in_decl);
6902 /* Figure out the default argument as well. Note that we use
6903 tsubst_expr since the default argument is really an expression. */
6904 defarg = tsubst_expr (TREE_PURPOSE (parms), args, complain, in_decl);
6906 /* Chain this parameter on to the front of those we have already
6907 processed. We don't use hash_tree_cons because that function
6908 doesn't check TREE_PARMLIST. */
6909 new_parms = tree_cons (defarg, type, new_parms);
6914 /* Take the tree structure T and replace template parameters used
6915 therein with the argument vector ARGS. IN_DECL is an associated
6916 decl for diagnostics. If an error occurs, returns ERROR_MARK_NODE.
6917 Issue error and warning messages under control of COMPLAIN. Note
6918 that we must be relatively non-tolerant of extensions here, in
6919 order to preserve conformance; if we allow substitutions that
6920 should not be allowed, we may allow argument deductions that should
6921 not succeed, and therefore report ambiguous overload situations
6922 where there are none. In theory, we could allow the substitution,
6923 but indicate that it should have failed, and allow our caller to
6924 make sure that the right thing happens, but we don't try to do this
6927 This function is used for dealing with types, decls and the like;
6928 for expressions, use tsubst_expr or tsubst_copy. */
6931 tsubst (tree t, tree args, tsubst_flags_t complain, tree in_decl)
6935 if (t == NULL_TREE || t == error_mark_node
6936 || t == integer_type_node
6937 || t == void_type_node
6938 || t == char_type_node
6939 || t == unknown_type_node
6940 || TREE_CODE (t) == NAMESPACE_DECL)
6944 return tsubst_decl (t, args, complain);
6946 if (TREE_CODE (t) == IDENTIFIER_NODE)
6947 type = IDENTIFIER_TYPE_VALUE (t);
6949 type = TREE_TYPE (t);
6951 gcc_assert (type != unknown_type_node);
6954 && TREE_CODE (t) != TYPENAME_TYPE
6955 && TREE_CODE (t) != IDENTIFIER_NODE
6956 && TREE_CODE (t) != FUNCTION_TYPE
6957 && TREE_CODE (t) != METHOD_TYPE)
6958 type = tsubst (type, args, complain, in_decl);
6959 if (type == error_mark_node)
6960 return error_mark_node;
6962 switch (TREE_CODE (t))
6967 return tsubst_aggr_type (t, args, complain, in_decl,
6968 /*entering_scope=*/0);
6971 case IDENTIFIER_NODE:
6983 if (t == integer_type_node)
6986 if (TREE_CODE (TYPE_MIN_VALUE (t)) == INTEGER_CST
6987 && TREE_CODE (TYPE_MAX_VALUE (t)) == INTEGER_CST)
6991 tree max, omax = TREE_OPERAND (TYPE_MAX_VALUE (t), 0);
6993 /* The array dimension behaves like a non-type template arg,
6994 in that we want to fold it as much as possible. */
6995 max = tsubst_template_arg (omax, args, complain, in_decl);
6996 max = fold_decl_constant_value (max);
6998 if (integer_zerop (omax))
7000 /* Still allow an explicit array of size zero. */
7002 pedwarn ("creating array with size zero");
7004 else if (integer_zerop (max)
7005 || (TREE_CODE (max) == INTEGER_CST
7006 && INT_CST_LT (max, integer_zero_node)))
7010 Type deduction may fail for any of the following
7013 Attempting to create an array with a size that is
7014 zero or negative. */
7015 if (complain & tf_error)
7016 error ("creating array with size zero (%qE)", max);
7018 return error_mark_node;
7021 return compute_array_index_type (NULL_TREE, max);
7024 case TEMPLATE_TYPE_PARM:
7025 case TEMPLATE_TEMPLATE_PARM:
7026 case BOUND_TEMPLATE_TEMPLATE_PARM:
7027 case TEMPLATE_PARM_INDEX:
7032 tree arg = NULL_TREE;
7036 gcc_assert (TREE_VEC_LENGTH (args) > 0);
7037 if (TREE_CODE (t) == TEMPLATE_TYPE_PARM
7038 || TREE_CODE (t) == TEMPLATE_TEMPLATE_PARM
7039 || TREE_CODE (t) == BOUND_TEMPLATE_TEMPLATE_PARM)
7041 idx = TEMPLATE_TYPE_IDX (t);
7042 level = TEMPLATE_TYPE_LEVEL (t);
7046 idx = TEMPLATE_PARM_IDX (t);
7047 level = TEMPLATE_PARM_LEVEL (t);
7050 levels = TMPL_ARGS_DEPTH (args);
7051 if (level <= levels)
7052 arg = TMPL_ARG (args, level, idx);
7054 if (arg == error_mark_node)
7055 return error_mark_node;
7056 else if (arg != NULL_TREE)
7058 if (TREE_CODE (t) == TEMPLATE_TYPE_PARM)
7060 gcc_assert (TYPE_P (arg));
7061 return cp_build_qualified_type_real
7062 (arg, cp_type_quals (arg) | cp_type_quals (t),
7063 complain | tf_ignore_bad_quals);
7065 else if (TREE_CODE (t) == BOUND_TEMPLATE_TEMPLATE_PARM)
7067 /* We are processing a type constructed from a
7068 template template parameter. */
7069 tree argvec = tsubst (TYPE_TI_ARGS (t),
7070 args, complain, in_decl);
7071 if (argvec == error_mark_node)
7072 return error_mark_node;
7074 /* We can get a TEMPLATE_TEMPLATE_PARM here when we
7075 are resolving nested-types in the signature of a
7076 member function templates. Otherwise ARG is a
7077 TEMPLATE_DECL and is the real template to be
7079 if (TREE_CODE (arg) == TEMPLATE_TEMPLATE_PARM)
7080 arg = TYPE_NAME (arg);
7082 r = lookup_template_class (arg,
7085 /*entering_scope=*/0,
7087 return cp_build_qualified_type_real
7088 (r, TYPE_QUALS (t), complain);
7091 /* TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX. */
7096 /* This can happen during the attempted tsubst'ing in
7097 unify. This means that we don't yet have any information
7098 about the template parameter in question. */
7101 /* If we get here, we must have been looking at a parm for a
7102 more deeply nested template. Make a new version of this
7103 template parameter, but with a lower level. */
7104 switch (TREE_CODE (t))
7106 case TEMPLATE_TYPE_PARM:
7107 case TEMPLATE_TEMPLATE_PARM:
7108 case BOUND_TEMPLATE_TEMPLATE_PARM:
7109 if (cp_type_quals (t))
7111 r = tsubst (TYPE_MAIN_VARIANT (t), args, complain, in_decl);
7112 r = cp_build_qualified_type_real
7113 (r, cp_type_quals (t),
7114 complain | (TREE_CODE (t) == TEMPLATE_TYPE_PARM
7115 ? tf_ignore_bad_quals : 0));
7120 TEMPLATE_TYPE_PARM_INDEX (r)
7121 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (t),
7123 TYPE_STUB_DECL (r) = TYPE_NAME (r) = TEMPLATE_TYPE_DECL (r);
7124 TYPE_MAIN_VARIANT (r) = r;
7125 TYPE_POINTER_TO (r) = NULL_TREE;
7126 TYPE_REFERENCE_TO (r) = NULL_TREE;
7128 if (TREE_CODE (t) == BOUND_TEMPLATE_TEMPLATE_PARM)
7130 tree argvec = tsubst (TYPE_TI_ARGS (t), args,
7132 if (argvec == error_mark_node)
7133 return error_mark_node;
7135 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (r)
7136 = tree_cons (TYPE_TI_TEMPLATE (t), argvec, NULL_TREE);
7141 case TEMPLATE_PARM_INDEX:
7142 r = reduce_template_parm_level (t, type, levels);
7154 tree purpose, value, chain;
7156 if (t == void_list_node)
7159 purpose = TREE_PURPOSE (t);
7162 purpose = tsubst (purpose, args, complain, in_decl);
7163 if (purpose == error_mark_node)
7164 return error_mark_node;
7166 value = TREE_VALUE (t);
7169 value = tsubst (value, args, complain, in_decl);
7170 if (value == error_mark_node)
7171 return error_mark_node;
7173 chain = TREE_CHAIN (t);
7174 if (chain && chain != void_type_node)
7176 chain = tsubst (chain, args, complain, in_decl);
7177 if (chain == error_mark_node)
7178 return error_mark_node;
7180 if (purpose == TREE_PURPOSE (t)
7181 && value == TREE_VALUE (t)
7182 && chain == TREE_CHAIN (t))
7184 return hash_tree_cons (purpose, value, chain);
7188 /* We should never be tsubsting a binfo. */
7192 /* A vector of template arguments. */
7194 return tsubst_template_args (t, args, complain, in_decl);
7197 case REFERENCE_TYPE:
7199 enum tree_code code;
7201 if (type == TREE_TYPE (t) && TREE_CODE (type) != METHOD_TYPE)
7204 code = TREE_CODE (t);
7209 Type deduction may fail for any of the following
7212 -- Attempting to create a pointer to reference type.
7213 -- Attempting to create a reference to a reference type or
7214 a reference to void. */
7215 if (TREE_CODE (type) == REFERENCE_TYPE
7216 || (code == REFERENCE_TYPE && TREE_CODE (type) == VOID_TYPE))
7218 static location_t last_loc;
7220 /* We keep track of the last time we issued this error
7221 message to avoid spewing a ton of messages during a
7222 single bad template instantiation. */
7223 if (complain & tf_error
7224 #ifdef USE_MAPPED_LOCATION
7225 && last_loc != input_location
7227 && (last_loc.line != input_line
7228 || last_loc.file != input_filename)
7232 if (TREE_CODE (type) == VOID_TYPE)
7233 error ("forming reference to void");
7235 error ("forming %s to reference type %qT",
7236 (code == POINTER_TYPE) ? "pointer" : "reference",
7238 last_loc = input_location;
7241 return error_mark_node;
7243 else if (code == POINTER_TYPE)
7245 r = build_pointer_type (type);
7246 if (TREE_CODE (type) == METHOD_TYPE)
7247 r = build_ptrmemfunc_type (r);
7250 r = build_reference_type (type);
7251 r = cp_build_qualified_type_real (r, TYPE_QUALS (t), complain);
7253 if (r != error_mark_node)
7254 /* Will this ever be needed for TYPE_..._TO values? */
7261 r = tsubst (TYPE_OFFSET_BASETYPE (t), args, complain, in_decl);
7262 if (r == error_mark_node || !IS_AGGR_TYPE (r))
7266 Type deduction may fail for any of the following
7269 -- Attempting to create "pointer to member of T" when T
7270 is not a class type. */
7271 if (complain & tf_error)
7272 error ("creating pointer to member of non-class type %qT", r);
7273 return error_mark_node;
7275 if (TREE_CODE (type) == REFERENCE_TYPE)
7277 if (complain & tf_error)
7278 error ("creating pointer to member reference type %qT", type);
7280 return error_mark_node;
7282 gcc_assert (TREE_CODE (type) != METHOD_TYPE);
7283 if (TREE_CODE (type) == FUNCTION_TYPE)
7285 /* The type of the implicit object parameter gets its
7286 cv-qualifiers from the FUNCTION_TYPE. */
7288 tree this_type = cp_build_qualified_type (TYPE_MAIN_VARIANT (r),
7289 cp_type_quals (type));
7291 method_type = build_method_type_directly (this_type,
7293 TYPE_ARG_TYPES (type));
7294 memptr = build_ptrmemfunc_type (build_pointer_type (method_type));
7295 return cp_build_qualified_type_real (memptr, cp_type_quals (t),
7299 return cp_build_qualified_type_real (build_ptrmem_type (r, type),
7308 fntype = tsubst_function_type (t, args, complain, in_decl);
7309 if (fntype == error_mark_node)
7310 return error_mark_node;
7312 /* Substitute the exception specification. */
7313 specs = tsubst_exception_specification (t, args, complain,
7316 fntype = build_exception_variant (fntype, specs);
7321 tree domain = tsubst (TYPE_DOMAIN (t), args, complain, in_decl);
7322 if (domain == error_mark_node)
7323 return error_mark_node;
7325 /* As an optimization, we avoid regenerating the array type if
7326 it will obviously be the same as T. */
7327 if (type == TREE_TYPE (t) && domain == TYPE_DOMAIN (t))
7330 /* These checks should match the ones in grokdeclarator.
7334 The deduction may fail for any of the following reasons:
7336 -- Attempting to create an array with an element type that
7337 is void, a function type, or a reference type, or [DR337]
7338 an abstract class type. */
7339 if (TREE_CODE (type) == VOID_TYPE
7340 || TREE_CODE (type) == FUNCTION_TYPE
7341 || TREE_CODE (type) == REFERENCE_TYPE)
7343 if (complain & tf_error)
7344 error ("creating array of %qT", type);
7345 return error_mark_node;
7347 if (CLASS_TYPE_P (type) && CLASSTYPE_PURE_VIRTUALS (type))
7349 if (complain & tf_error)
7350 error ("creating array of %qT, which is an abstract class type",
7352 return error_mark_node;
7355 r = build_cplus_array_type (type, domain);
7362 tree e1 = tsubst (TREE_OPERAND (t, 0), args, complain, in_decl);
7363 tree e2 = tsubst (TREE_OPERAND (t, 1), args, complain, in_decl);
7365 if (e1 == error_mark_node || e2 == error_mark_node)
7366 return error_mark_node;
7368 return fold_build2 (TREE_CODE (t), TREE_TYPE (t), e1, e2);
7374 tree e = tsubst (TREE_OPERAND (t, 0), args, complain, in_decl);
7375 if (e == error_mark_node)
7376 return error_mark_node;
7378 return fold_build1 (TREE_CODE (t), TREE_TYPE (t), e);
7383 tree ctx = tsubst_aggr_type (TYPE_CONTEXT (t), args, complain,
7384 in_decl, /*entering_scope=*/1);
7385 tree f = tsubst_copy (TYPENAME_TYPE_FULLNAME (t), args,
7388 if (ctx == error_mark_node || f == error_mark_node)
7389 return error_mark_node;
7391 if (!IS_AGGR_TYPE (ctx))
7393 if (complain & tf_error)
7394 error ("%qT is not a class, struct, or union type", ctx);
7395 return error_mark_node;
7397 else if (!uses_template_parms (ctx) && !TYPE_BEING_DEFINED (ctx))
7399 /* Normally, make_typename_type does not require that the CTX
7400 have complete type in order to allow things like:
7402 template <class T> struct S { typename S<T>::X Y; };
7404 But, such constructs have already been resolved by this
7405 point, so here CTX really should have complete type, unless
7406 it's a partial instantiation. */
7407 ctx = complete_type (ctx);
7408 if (!COMPLETE_TYPE_P (ctx))
7410 if (complain & tf_error)
7411 cxx_incomplete_type_error (NULL_TREE, ctx);
7412 return error_mark_node;
7416 f = make_typename_type (ctx, f, typename_type,
7417 (complain & tf_error) | tf_keep_type_decl);
7418 if (f == error_mark_node)
7420 if (TREE_CODE (f) == TYPE_DECL)
7422 complain |= tf_ignore_bad_quals;
7426 if (TREE_CODE (f) != TYPENAME_TYPE)
7428 if (TYPENAME_IS_ENUM_P (t) && TREE_CODE (f) != ENUMERAL_TYPE)
7429 error ("%qT resolves to %qT, which is not an enumeration type",
7431 else if (TYPENAME_IS_CLASS_P (t) && !CLASS_TYPE_P (f))
7432 error ("%qT resolves to %qT, which is is not a class type",
7436 return cp_build_qualified_type_real
7437 (f, cp_type_quals (f) | cp_type_quals (t), complain);
7440 case UNBOUND_CLASS_TEMPLATE:
7442 tree ctx = tsubst_aggr_type (TYPE_CONTEXT (t), args, complain,
7443 in_decl, /*entering_scope=*/1);
7444 tree name = TYPE_IDENTIFIER (t);
7445 tree parm_list = DECL_TEMPLATE_PARMS (TYPE_NAME (t));
7447 if (ctx == error_mark_node || name == error_mark_node)
7448 return error_mark_node;
7451 parm_list = tsubst_template_parms (parm_list, args, complain);
7452 return make_unbound_class_template (ctx, name, parm_list, complain);
7462 tree e1 = tsubst (TREE_OPERAND (t, 0), args, complain, in_decl);
7463 tree e2 = tsubst_expr (TREE_OPERAND (t, 1), args, complain, in_decl);
7464 if (e1 == error_mark_node || e2 == error_mark_node)
7465 return error_mark_node;
7467 return build_nt (ARRAY_REF, e1, e2, NULL_TREE, NULL_TREE);
7472 tree e1 = tsubst (TREE_OPERAND (t, 0), args, complain, in_decl);
7473 tree e2 = tsubst (TREE_OPERAND (t, 1), args, complain, in_decl);
7474 if (e1 == error_mark_node || e2 == error_mark_node)
7475 return error_mark_node;
7477 return build_nt (TREE_CODE (t), e1, e2);
7484 type = finish_typeof (tsubst_expr (TYPEOF_TYPE_EXPR (t), args,
7485 complain, in_decl));
7486 return cp_build_qualified_type_real (type,
7488 | cp_type_quals (type),
7493 sorry ("use of %qs in template",
7494 tree_code_name [(int) TREE_CODE (t)]);
7495 return error_mark_node;
7499 /* Like tsubst_expr for a BASELINK. OBJECT_TYPE, if non-NULL, is the
7500 type of the expression on the left-hand side of the "." or "->"
7504 tsubst_baselink (tree baselink, tree object_type,
7505 tree args, tsubst_flags_t complain, tree in_decl)
7508 tree qualifying_scope;
7510 tree template_args = 0;
7511 bool template_id_p = false;
7513 /* A baselink indicates a function from a base class. The
7514 BASELINK_ACCESS_BINFO and BASELINK_BINFO are going to have
7515 non-dependent types; otherwise, the lookup could not have
7516 succeeded. However, they may indicate bases of the template
7517 class, rather than the instantiated class.
7519 In addition, lookups that were not ambiguous before may be
7520 ambiguous now. Therefore, we perform the lookup again. */
7521 qualifying_scope = BINFO_TYPE (BASELINK_ACCESS_BINFO (baselink));
7522 fns = BASELINK_FUNCTIONS (baselink);
7523 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)
7525 template_id_p = true;
7526 template_args = TREE_OPERAND (fns, 1);
7527 fns = TREE_OPERAND (fns, 0);
7529 template_args = tsubst_template_args (template_args, args,
7532 name = DECL_NAME (get_first_fn (fns));
7533 baselink = lookup_fnfields (qualifying_scope, name, /*protect=*/1);
7535 /* If lookup found a single function, mark it as used at this
7536 point. (If it lookup found multiple functions the one selected
7537 later by overload resolution will be marked as used at that
7539 if (BASELINK_P (baselink))
7540 fns = BASELINK_FUNCTIONS (baselink);
7541 if (!template_id_p && !really_overloaded_fn (fns))
7542 mark_used (OVL_CURRENT (fns));
7544 /* Add back the template arguments, if present. */
7545 if (BASELINK_P (baselink) && template_id_p)
7546 BASELINK_FUNCTIONS (baselink)
7547 = build_nt (TEMPLATE_ID_EXPR,
7548 BASELINK_FUNCTIONS (baselink),
7552 object_type = current_class_type;
7553 return adjust_result_of_qualified_name_lookup (baselink,
7558 /* Like tsubst_expr for a SCOPE_REF, given by QUALIFIED_ID. DONE is
7559 true if the qualified-id will be a postfix-expression in-and-of
7560 itself; false if more of the postfix-expression follows the
7561 QUALIFIED_ID. ADDRESS_P is true if the qualified-id is the operand
7565 tsubst_qualified_id (tree qualified_id, tree args,
7566 tsubst_flags_t complain, tree in_decl,
7567 bool done, bool address_p)
7575 gcc_assert (TREE_CODE (qualified_id) == SCOPE_REF);
7577 /* Figure out what name to look up. */
7578 name = TREE_OPERAND (qualified_id, 1);
7579 if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
7582 template_args = TREE_OPERAND (name, 1);
7584 template_args = tsubst_template_args (template_args, args,
7586 name = TREE_OPERAND (name, 0);
7590 is_template = false;
7591 template_args = NULL_TREE;
7594 /* Substitute into the qualifying scope. When there are no ARGS, we
7595 are just trying to simplify a non-dependent expression. In that
7596 case the qualifying scope may be dependent, and, in any case,
7597 substituting will not help. */
7598 scope = TREE_OPERAND (qualified_id, 0);
7601 scope = tsubst (scope, args, complain, in_decl);
7602 expr = tsubst_copy (name, args, complain, in_decl);
7607 if (dependent_type_p (scope))
7608 return build_nt (SCOPE_REF, scope, expr);
7610 if (!BASELINK_P (name) && !DECL_P (expr))
7612 expr = lookup_qualified_name (scope, expr, /*is_type_p=*/0, false);
7613 if (TREE_CODE (TREE_CODE (expr) == TEMPLATE_DECL
7614 ? DECL_TEMPLATE_RESULT (expr) : expr) == TYPE_DECL)
7616 if (complain & tf_error)
7618 error ("dependent-name %qE is parsed as a non-type, but "
7619 "instantiation yields a type", qualified_id);
7620 inform ("say %<typename %E%> if a type is meant", qualified_id);
7622 return error_mark_node;
7628 check_accessibility_of_qualified_id (expr, /*object_type=*/NULL_TREE,
7630 /* Remember that there was a reference to this entity. */
7634 if (expr == error_mark_node || TREE_CODE (expr) == TREE_LIST)
7636 if (complain & tf_error)
7637 qualified_name_lookup_error (scope,
7638 TREE_OPERAND (qualified_id, 1),
7640 return error_mark_node;
7644 expr = lookup_template_function (expr, template_args);
7646 if (expr == error_mark_node && complain & tf_error)
7647 qualified_name_lookup_error (scope, TREE_OPERAND (qualified_id, 1),
7649 else if (TYPE_P (scope))
7651 expr = (adjust_result_of_qualified_name_lookup
7652 (expr, scope, current_class_type));
7653 expr = finish_qualified_id_expr (scope, expr, done, address_p);
7656 expr = convert_from_reference (expr);
7661 /* Like tsubst, but deals with expressions. This function just replaces
7662 template parms; to finish processing the resultant expression, use
7666 tsubst_copy (tree t, tree args, tsubst_flags_t complain, tree in_decl)
7668 enum tree_code code;
7671 if (t == NULL_TREE || t == error_mark_node)
7674 code = TREE_CODE (t);
7679 r = retrieve_local_specialization (t);
7680 gcc_assert (r != NULL);
7689 if (DECL_TEMPLATE_PARM_P (t))
7690 return tsubst_copy (DECL_INITIAL (t), args, complain, in_decl);
7691 /* There is no need to substitute into namespace-scope
7693 if (DECL_NAMESPACE_SCOPE_P (t))
7695 /* If ARGS is NULL, then T is known to be non-dependent. */
7696 if (args == NULL_TREE)
7697 return integral_constant_value (t);
7699 /* Unfortunately, we cannot just call lookup_name here.
7702 template <int I> int f() {
7704 struct S { void g() { E e = a; } };
7707 When we instantiate f<7>::S::g(), say, lookup_name is not
7708 clever enough to find f<7>::a. */
7710 = tsubst_aggr_type (TREE_TYPE (t), args, complain, in_decl,
7711 /*entering_scope=*/0);
7713 for (v = TYPE_VALUES (enum_type);
7716 if (TREE_PURPOSE (v) == DECL_NAME (t))
7717 return TREE_VALUE (v);
7719 /* We didn't find the name. That should never happen; if
7720 name-lookup found it during preliminary parsing, we
7721 should find it again here during instantiation. */
7727 if (DECL_CONTEXT (t))
7731 ctx = tsubst_aggr_type (DECL_CONTEXT (t), args, complain, in_decl,
7732 /*entering_scope=*/1);
7733 if (ctx != DECL_CONTEXT (t))
7735 tree r = lookup_field (ctx, DECL_NAME (t), 0, false);
7738 if (complain & tf_error)
7739 error ("using invalid field %qD", t);
7740 return error_mark_node;
7750 if ((DECL_LANG_SPECIFIC (t) && DECL_TEMPLATE_INFO (t))
7751 || local_variable_p (t))
7752 t = tsubst (t, args, complain, in_decl);
7757 return tsubst_baselink (t, current_class_type, args, complain, in_decl);
7760 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t))
7761 return tsubst (TREE_TYPE (DECL_TEMPLATE_RESULT (t)),
7762 args, complain, in_decl);
7763 else if (DECL_FUNCTION_TEMPLATE_P (t) && DECL_MEMBER_TEMPLATE_P (t))
7764 return tsubst (t, args, complain, in_decl);
7765 else if (DECL_CLASS_SCOPE_P (t)
7766 && uses_template_parms (DECL_CONTEXT (t)))
7768 /* Template template argument like the following example need
7771 template <template <class> class TT> struct C {};
7772 template <class T> struct D {
7773 template <class U> struct E {};
7778 We are processing the template argument `E' in #1 for
7779 the template instantiation #2. Originally, `E' is a
7780 TEMPLATE_DECL with `D<T>' as its DECL_CONTEXT. Now we
7781 have to substitute this with one having context `D<int>'. */
7783 tree context = tsubst (DECL_CONTEXT (t), args, complain, in_decl);
7784 return lookup_field (context, DECL_NAME(t), 0, false);
7787 /* Ordinary template template argument. */
7791 case REINTERPRET_CAST_EXPR:
7792 case CONST_CAST_EXPR:
7793 case STATIC_CAST_EXPR:
7794 case DYNAMIC_CAST_EXPR:
7797 (code, tsubst (TREE_TYPE (t), args, complain, in_decl),
7798 tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl));
7802 case TRUTH_NOT_EXPR:
7805 case CONVERT_EXPR: /* Unary + */
7814 (code, tsubst (TREE_TYPE (t), args, complain, in_decl),
7815 tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl));
7822 object = tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl);
7823 name = TREE_OPERAND (t, 1);
7824 if (TREE_CODE (name) == BIT_NOT_EXPR)
7826 name = tsubst_copy (TREE_OPERAND (name, 0), args,
7828 name = build1 (BIT_NOT_EXPR, NULL_TREE, name);
7830 else if (TREE_CODE (name) == SCOPE_REF
7831 && TREE_CODE (TREE_OPERAND (name, 1)) == BIT_NOT_EXPR)
7833 tree base = tsubst_copy (TREE_OPERAND (name, 0), args,
7835 name = TREE_OPERAND (name, 1);
7836 name = tsubst_copy (TREE_OPERAND (name, 0), args,
7838 name = build1 (BIT_NOT_EXPR, NULL_TREE, name);
7839 name = build_nt (SCOPE_REF, base, name);
7841 else if (TREE_CODE (name) == BASELINK)
7842 name = tsubst_baselink (name,
7843 non_reference (TREE_TYPE (object)),
7847 name = tsubst_copy (name, args, complain, in_decl);
7848 return build_nt (COMPONENT_REF, object, name, NULL_TREE);
7854 case TRUNC_DIV_EXPR:
7856 case FLOOR_DIV_EXPR:
7857 case ROUND_DIV_EXPR:
7858 case EXACT_DIV_EXPR:
7862 case TRUNC_MOD_EXPR:
7863 case FLOOR_MOD_EXPR:
7864 case TRUTH_ANDIF_EXPR:
7865 case TRUTH_ORIF_EXPR:
7866 case TRUTH_AND_EXPR:
7884 case PREDECREMENT_EXPR:
7885 case PREINCREMENT_EXPR:
7886 case POSTDECREMENT_EXPR:
7887 case POSTINCREMENT_EXPR:
7889 (code, tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl),
7890 tsubst_copy (TREE_OPERAND (t, 1), args, complain, in_decl));
7895 tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl),
7896 tsubst_copy (TREE_OPERAND (t, 1), args, complain, in_decl),
7897 NULL_TREE, NULL_TREE);
7900 return build_nt (code,
7901 tsubst_copy (TREE_OPERAND (t, 0), args,
7903 tsubst_copy (TREE_OPERAND (t, 1), args, complain,
7909 case PSEUDO_DTOR_EXPR:
7912 (code, tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl),
7913 tsubst_copy (TREE_OPERAND (t, 1), args, complain, in_decl),
7914 tsubst_copy (TREE_OPERAND (t, 2), args, complain, in_decl));
7915 TREE_NO_WARNING (r) = TREE_NO_WARNING (t);
7922 (code, tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl),
7923 tsubst_copy (TREE_OPERAND (t, 1), args, complain, in_decl),
7924 tsubst_copy (TREE_OPERAND (t, 2), args, complain, in_decl));
7925 NEW_EXPR_USE_GLOBAL (r) = NEW_EXPR_USE_GLOBAL (t);
7932 (code, tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl),
7933 tsubst_copy (TREE_OPERAND (t, 1), args, complain, in_decl));
7934 DELETE_EXPR_USE_GLOBAL (r) = DELETE_EXPR_USE_GLOBAL (t);
7935 DELETE_EXPR_USE_VEC (r) = DELETE_EXPR_USE_VEC (t);
7939 case TEMPLATE_ID_EXPR:
7941 /* Substituted template arguments */
7942 tree fn = TREE_OPERAND (t, 0);
7943 tree targs = TREE_OPERAND (t, 1);
7945 fn = tsubst_copy (fn, args, complain, in_decl);
7947 targs = tsubst_template_args (targs, args, complain, in_decl);
7949 return lookup_template_function (fn, targs);
7954 tree purpose, value, chain;
7956 if (t == void_list_node)
7959 purpose = TREE_PURPOSE (t);
7961 purpose = tsubst_copy (purpose, args, complain, in_decl);
7962 value = TREE_VALUE (t);
7964 value = tsubst_copy (value, args, complain, in_decl);
7965 chain = TREE_CHAIN (t);
7966 if (chain && chain != void_type_node)
7967 chain = tsubst_copy (chain, args, complain, in_decl);
7968 if (purpose == TREE_PURPOSE (t)
7969 && value == TREE_VALUE (t)
7970 && chain == TREE_CHAIN (t))
7972 return tree_cons (purpose, value, chain);
7979 case TEMPLATE_TYPE_PARM:
7980 case TEMPLATE_TEMPLATE_PARM:
7981 case BOUND_TEMPLATE_TEMPLATE_PARM:
7982 case TEMPLATE_PARM_INDEX:
7984 case REFERENCE_TYPE:
7990 case UNBOUND_CLASS_TEMPLATE:
7993 return tsubst (t, args, complain, in_decl);
7995 case IDENTIFIER_NODE:
7996 if (IDENTIFIER_TYPENAME_P (t))
7998 tree new_type = tsubst (TREE_TYPE (t), args, complain, in_decl);
7999 return mangle_conv_op_name_for_type (new_type);
8006 r = build_constructor
8007 (tsubst (TREE_TYPE (t), args, complain, in_decl),
8008 tsubst_copy (CONSTRUCTOR_ELTS (t), args, complain, in_decl));
8009 TREE_HAS_CONSTRUCTOR (r) = TREE_HAS_CONSTRUCTOR (t);
8014 return build_x_va_arg (tsubst_copy (TREE_OPERAND (t, 0), args, complain,
8016 tsubst (TREE_TYPE (t), args, complain, in_decl));
8018 case CLEANUP_POINT_EXPR:
8019 /* We shouldn't have built any of these during initial template
8020 generation. Instead, they should be built during instantiation
8021 in response to the saved STMT_IS_FULL_EXPR_P setting. */
8029 /* Like tsubst_copy for expressions, etc. but also does semantic
8033 tsubst_expr (tree t, tree args, tsubst_flags_t complain, tree in_decl)
8037 if (t == NULL_TREE || t == error_mark_node)
8040 if (EXPR_HAS_LOCATION (t))
8041 input_location = EXPR_LOCATION (t);
8042 if (STATEMENT_CODE_P (TREE_CODE (t)))
8043 current_stmt_tree ()->stmts_are_full_exprs_p = STMT_IS_FULL_EXPR_P (t);
8045 switch (TREE_CODE (t))
8047 case STATEMENT_LIST:
8049 tree_stmt_iterator i;
8050 for (i = tsi_start (t); !tsi_end_p (i); tsi_next (&i))
8051 tsubst_expr (tsi_stmt (i), args, complain, in_decl);
8055 case CTOR_INITIALIZER:
8056 finish_mem_initializers (tsubst_initializer_list
8057 (TREE_OPERAND (t, 0), args));
8061 finish_return_stmt (tsubst_expr (TREE_OPERAND (t, 0),
8062 args, complain, in_decl));
8066 tmp = tsubst_expr (EXPR_STMT_EXPR (t), args, complain, in_decl);
8067 if (EXPR_STMT_STMT_EXPR_RESULT (t))
8068 finish_stmt_expr_expr (tmp, cur_stmt_expr);
8070 finish_expr_stmt (tmp);
8074 do_using_directive (tsubst_expr (USING_STMT_NAMESPACE (t),
8075 args, complain, in_decl));
8083 decl = DECL_EXPR_DECL (t);
8084 if (TREE_CODE (decl) == LABEL_DECL)
8085 finish_label_decl (DECL_NAME (decl));
8086 else if (TREE_CODE (decl) == USING_DECL)
8088 tree scope = DECL_INITIAL (decl);
8089 tree name = DECL_NAME (decl);
8092 scope = tsubst_expr (scope, args, complain, in_decl);
8093 decl = lookup_qualified_name (scope, name,
8094 /*is_type_p=*/false,
8095 /*complain=*/false);
8096 if (decl == error_mark_node || TREE_CODE (decl) == TREE_LIST)
8097 qualified_name_lookup_error (scope, name, decl);
8099 do_local_using_decl (decl, scope, name);
8103 init = DECL_INITIAL (decl);
8104 decl = tsubst (decl, args, complain, in_decl);
8105 if (decl != error_mark_node)
8108 DECL_INITIAL (decl) = error_mark_node;
8109 /* By marking the declaration as instantiated, we avoid
8110 trying to instantiate it. Since instantiate_decl can't
8111 handle local variables, and since we've already done
8112 all that needs to be done, that's the right thing to
8114 if (TREE_CODE (decl) == VAR_DECL)
8115 DECL_TEMPLATE_INSTANTIATED (decl) = 1;
8116 if (TREE_CODE (decl) == VAR_DECL
8117 && ANON_AGGR_TYPE_P (TREE_TYPE (decl)))
8118 /* Anonymous aggregates are a special case. */
8119 finish_anon_union (decl);
8122 maybe_push_decl (decl);
8123 if (TREE_CODE (decl) == VAR_DECL
8124 && DECL_PRETTY_FUNCTION_P (decl))
8126 /* For __PRETTY_FUNCTION__ we have to adjust the
8128 const char *const name
8129 = cxx_printable_name (current_function_decl, 2);
8130 init = cp_fname_init (name, &TREE_TYPE (decl));
8133 init = tsubst_expr (init, args, complain, in_decl);
8134 cp_finish_decl (decl, init, NULL_TREE, 0);
8139 /* A DECL_EXPR can also be used as an expression, in the condition
8140 clause of an if/for/while construct. */
8145 stmt = begin_for_stmt ();
8146 tsubst_expr (FOR_INIT_STMT (t), args, complain, in_decl);
8147 finish_for_init_stmt (stmt);
8148 tmp = tsubst_expr (FOR_COND (t), args, complain, in_decl);
8149 finish_for_cond (tmp, stmt);
8150 tmp = tsubst_expr (FOR_EXPR (t), args, complain, in_decl);
8151 finish_for_expr (tmp, stmt);
8152 tsubst_expr (FOR_BODY (t), args, complain, in_decl);
8153 finish_for_stmt (stmt);
8157 stmt = begin_while_stmt ();
8158 tmp = tsubst_expr (WHILE_COND (t), args, complain, in_decl);
8159 finish_while_stmt_cond (tmp, stmt);
8160 tsubst_expr (WHILE_BODY (t), args, complain, in_decl);
8161 finish_while_stmt (stmt);
8165 stmt = begin_do_stmt ();
8166 tsubst_expr (DO_BODY (t), args, complain, in_decl);
8167 finish_do_body (stmt);
8168 tmp = tsubst_expr (DO_COND (t), args, complain, in_decl);
8169 finish_do_stmt (tmp, stmt);
8173 stmt = begin_if_stmt ();
8174 tmp = tsubst_expr (IF_COND (t), args, complain, in_decl);
8175 finish_if_stmt_cond (tmp, stmt);
8176 tsubst_expr (THEN_CLAUSE (t), args, complain, in_decl);
8177 finish_then_clause (stmt);
8179 if (ELSE_CLAUSE (t))
8181 begin_else_clause (stmt);
8182 tsubst_expr (ELSE_CLAUSE (t), args, complain, in_decl);
8183 finish_else_clause (stmt);
8186 finish_if_stmt (stmt);
8190 if (BIND_EXPR_BODY_BLOCK (t))
8191 stmt = begin_function_body ();
8193 stmt = begin_compound_stmt (BIND_EXPR_TRY_BLOCK (t)
8194 ? BCS_TRY_BLOCK : 0);
8196 tsubst_expr (BIND_EXPR_BODY (t), args, complain, in_decl);
8198 if (BIND_EXPR_BODY_BLOCK (t))
8199 finish_function_body (stmt);
8201 finish_compound_stmt (stmt);
8205 finish_break_stmt ();
8209 finish_continue_stmt ();
8213 stmt = begin_switch_stmt ();
8214 tmp = tsubst_expr (SWITCH_STMT_COND (t), args, complain, in_decl);
8215 finish_switch_cond (tmp, stmt);
8216 tsubst_expr (SWITCH_STMT_BODY (t), args, complain, in_decl);
8217 finish_switch_stmt (stmt);
8220 case CASE_LABEL_EXPR:
8221 finish_case_label (tsubst_expr (CASE_LOW (t), args, complain, in_decl),
8222 tsubst_expr (CASE_HIGH (t), args, complain,
8227 finish_label_stmt (DECL_NAME (LABEL_EXPR_LABEL (t)));
8231 tmp = GOTO_DESTINATION (t);
8232 if (TREE_CODE (tmp) != LABEL_DECL)
8233 /* Computed goto's must be tsubst'd into. On the other hand,
8234 non-computed gotos must not be; the identifier in question
8235 will have no binding. */
8236 tmp = tsubst_expr (tmp, args, complain, in_decl);
8238 tmp = DECL_NAME (tmp);
8239 finish_goto_stmt (tmp);
8243 tmp = finish_asm_stmt
8244 (ASM_VOLATILE_P (t),
8245 tsubst_expr (ASM_STRING (t), args, complain, in_decl),
8246 tsubst_expr (ASM_OUTPUTS (t), args, complain, in_decl),
8247 tsubst_expr (ASM_INPUTS (t), args, complain, in_decl),
8248 tsubst_expr (ASM_CLOBBERS (t), args, complain, in_decl));
8250 tree asm_expr = tmp;
8251 if (TREE_CODE (asm_expr) == CLEANUP_POINT_EXPR)
8252 asm_expr = TREE_OPERAND (asm_expr, 0);
8253 ASM_INPUT_P (asm_expr) = ASM_INPUT_P (t);
8260 stmt = begin_try_block ();
8261 tsubst_expr (TRY_STMTS (t), args, complain, in_decl);
8262 finish_cleanup_try_block (stmt);
8263 finish_cleanup (tsubst_expr (TRY_HANDLERS (t), args,
8269 if (FN_TRY_BLOCK_P (t))
8270 stmt = begin_function_try_block ();
8272 stmt = begin_try_block ();
8274 tsubst_expr (TRY_STMTS (t), args, complain, in_decl);
8276 if (FN_TRY_BLOCK_P (t))
8277 finish_function_try_block (stmt);
8279 finish_try_block (stmt);
8281 tsubst_expr (TRY_HANDLERS (t), args, complain, in_decl);
8282 if (FN_TRY_BLOCK_P (t))
8283 finish_function_handler_sequence (stmt);
8285 finish_handler_sequence (stmt);
8293 stmt = begin_handler ();
8294 if (HANDLER_PARMS (t))
8296 decl = HANDLER_PARMS (t);
8297 decl = tsubst (decl, args, complain, in_decl);
8298 /* Prevent instantiate_decl from trying to instantiate
8299 this variable. We've already done all that needs to be
8301 DECL_TEMPLATE_INSTANTIATED (decl) = 1;
8305 finish_handler_parms (decl, stmt);
8306 tsubst_expr (HANDLER_BODY (t), args, complain, in_decl);
8307 finish_handler (stmt);
8312 tsubst (TREE_TYPE (t), args, complain, NULL_TREE);
8316 gcc_assert (!STATEMENT_CODE_P (TREE_CODE (t)));
8318 return tsubst_copy_and_build (t, args, complain, in_decl,
8319 /*function_p=*/false);
8325 /* T is a postfix-expression that is not being used in a function
8326 call. Return the substituted version of T. */
8329 tsubst_non_call_postfix_expression (tree t, tree args,
8330 tsubst_flags_t complain,
8333 if (TREE_CODE (t) == SCOPE_REF)
8334 t = tsubst_qualified_id (t, args, complain, in_decl,
8335 /*done=*/false, /*address_p=*/false);
8337 t = tsubst_copy_and_build (t, args, complain, in_decl,
8338 /*function_p=*/false);
8343 /* Like tsubst but deals with expressions and performs semantic
8344 analysis. FUNCTION_P is true if T is the "F" in "F (ARGS)". */
8347 tsubst_copy_and_build (tree t,
8349 tsubst_flags_t complain,
8353 #define RECUR(NODE) \
8354 tsubst_copy_and_build (NODE, args, complain, in_decl, /*function_p=*/false)
8358 if (t == NULL_TREE || t == error_mark_node)
8361 switch (TREE_CODE (t))
8366 case IDENTIFIER_NODE:
8370 tree qualifying_class;
8371 bool non_integral_constant_expression_p;
8372 const char *error_msg;
8374 if (IDENTIFIER_TYPENAME_P (t))
8376 tree new_type = tsubst (TREE_TYPE (t), args, complain, in_decl);
8377 t = mangle_conv_op_name_for_type (new_type);
8380 /* Look up the name. */
8381 decl = lookup_name (t, 0);
8383 /* By convention, expressions use ERROR_MARK_NODE to indicate
8384 failure, not NULL_TREE. */
8385 if (decl == NULL_TREE)
8386 decl = error_mark_node;
8388 decl = finish_id_expression (t, decl, NULL_TREE,
8391 /*integral_constant_expression_p=*/false,
8392 /*allow_non_integral_constant_expression_p=*/false,
8393 &non_integral_constant_expression_p,
8397 if (!function_p && TREE_CODE (decl) == IDENTIFIER_NODE)
8398 decl = unqualified_name_lookup_error (decl);
8402 case TEMPLATE_ID_EXPR:
8405 tree template = RECUR (TREE_OPERAND (t, 0));
8406 tree targs = TREE_OPERAND (t, 1);
8409 targs = tsubst_template_args (targs, args, complain, in_decl);
8411 if (TREE_CODE (template) == COMPONENT_REF)
8413 object = TREE_OPERAND (template, 0);
8414 template = TREE_OPERAND (template, 1);
8418 template = lookup_template_function (template, targs);
8421 return build3 (COMPONENT_REF, TREE_TYPE (template),
8422 object, template, NULL_TREE);
8429 tree r = RECUR (TREE_OPERAND (t, 0));
8431 if (REFERENCE_REF_P (t))
8433 /* A type conversion to reference type will be enclosed in
8434 such an indirect ref, but the substitution of the cast
8435 will have also added such an indirect ref. */
8436 if (TREE_CODE (TREE_TYPE (r)) == REFERENCE_TYPE)
8437 r = convert_from_reference (r);
8440 r = build_x_indirect_ref (r, "unary *");
8446 (tsubst (TREE_TYPE (t), args, complain, in_decl),
8447 RECUR (TREE_OPERAND (t, 0)));
8450 return build_functional_cast
8451 (tsubst (TREE_TYPE (t), args, complain, in_decl),
8452 RECUR (TREE_OPERAND (t, 0)));
8454 case REINTERPRET_CAST_EXPR:
8455 return build_reinterpret_cast
8456 (tsubst (TREE_TYPE (t), args, complain, in_decl),
8457 RECUR (TREE_OPERAND (t, 0)));
8459 case CONST_CAST_EXPR:
8460 return build_const_cast
8461 (tsubst (TREE_TYPE (t), args, complain, in_decl),
8462 RECUR (TREE_OPERAND (t, 0)));
8464 case DYNAMIC_CAST_EXPR:
8465 return build_dynamic_cast
8466 (tsubst (TREE_TYPE (t), args, complain, in_decl),
8467 RECUR (TREE_OPERAND (t, 0)));
8469 case STATIC_CAST_EXPR:
8470 return build_static_cast
8471 (tsubst (TREE_TYPE (t), args, complain, in_decl),
8472 RECUR (TREE_OPERAND (t, 0)));
8474 case POSTDECREMENT_EXPR:
8475 case POSTINCREMENT_EXPR:
8476 op1 = tsubst_non_call_postfix_expression (TREE_OPERAND (t, 0),
8477 args, complain, in_decl);
8478 return build_x_unary_op (TREE_CODE (t), op1);
8480 case PREDECREMENT_EXPR:
8481 case PREINCREMENT_EXPR:
8485 case TRUTH_NOT_EXPR:
8486 case CONVERT_EXPR: /* Unary + */
8489 return build_x_unary_op (TREE_CODE (t), RECUR (TREE_OPERAND (t, 0)));
8492 op1 = TREE_OPERAND (t, 0);
8493 if (TREE_CODE (op1) == SCOPE_REF)
8494 op1 = tsubst_qualified_id (op1, args, complain, in_decl,
8495 /*done=*/true, /*address_p=*/true);
8497 op1 = tsubst_non_call_postfix_expression (op1, args, complain,
8499 if (TREE_CODE (op1) == LABEL_DECL)
8500 return finish_label_address_expr (DECL_NAME (op1));
8501 return build_x_unary_op (ADDR_EXPR, op1);
8506 case TRUNC_DIV_EXPR:
8508 case FLOOR_DIV_EXPR:
8509 case ROUND_DIV_EXPR:
8510 case EXACT_DIV_EXPR:
8514 case TRUNC_MOD_EXPR:
8515 case FLOOR_MOD_EXPR:
8516 case TRUTH_ANDIF_EXPR:
8517 case TRUTH_ORIF_EXPR:
8518 case TRUTH_AND_EXPR:
8534 return build_x_binary_op
8536 RECUR (TREE_OPERAND (t, 0)),
8537 RECUR (TREE_OPERAND (t, 1)),
8538 /*overloaded_p=*/NULL);
8541 return tsubst_qualified_id (t, args, complain, in_decl, /*done=*/true,
8542 /*address_p=*/false);
8544 op1 = tsubst_non_call_postfix_expression (TREE_OPERAND (t, 0),
8545 args, complain, in_decl);
8546 return build_x_binary_op (ARRAY_REF, op1, RECUR (TREE_OPERAND (t, 1)),
8547 /*overloaded_p=*/NULL);
8551 op1 = TREE_OPERAND (t, 0);
8554 /* When there are no ARGS, we are trying to evaluate a
8555 non-dependent expression from the parser. Trying to do
8556 the substitutions may not work. */
8558 op1 = TREE_TYPE (op1);
8567 return cxx_sizeof_or_alignof_type (op1, TREE_CODE (t), true);
8569 return cxx_sizeof_or_alignof_expr (op1, TREE_CODE (t));
8573 tree r = build_x_modify_expr
8574 (RECUR (TREE_OPERAND (t, 0)),
8575 TREE_CODE (TREE_OPERAND (t, 1)),
8576 RECUR (TREE_OPERAND (t, 2)));
8577 /* TREE_NO_WARNING must be set if either the expression was
8578 parenthesized or it uses an operator such as >>= rather
8579 than plain assignment. In the former case, it was already
8580 set and must be copied. In the latter case,
8581 build_x_modify_expr sets it and it must not be reset
8583 if (TREE_NO_WARNING (t))
8584 TREE_NO_WARNING (r) = TREE_NO_WARNING (t);
8589 op1 = tsubst_non_call_postfix_expression (TREE_OPERAND (t, 0),
8590 args, complain, in_decl);
8591 /* Remember that there was a reference to this entity. */
8594 return build_x_arrow (op1);
8598 (RECUR (TREE_OPERAND (t, 0)),
8599 RECUR (TREE_OPERAND (t, 1)),
8600 RECUR (TREE_OPERAND (t, 2)),
8601 RECUR (TREE_OPERAND (t, 3)),
8602 NEW_EXPR_USE_GLOBAL (t));
8605 return delete_sanity
8606 (RECUR (TREE_OPERAND (t, 0)),
8607 RECUR (TREE_OPERAND (t, 1)),
8608 DELETE_EXPR_USE_VEC (t),
8609 DELETE_EXPR_USE_GLOBAL (t));
8612 return build_x_compound_expr (RECUR (TREE_OPERAND (t, 0)),
8613 RECUR (TREE_OPERAND (t, 1)));
8622 function = TREE_OPERAND (t, 0);
8623 /* When we parsed the expression, we determined whether or
8624 not Koenig lookup should be performed. */
8625 koenig_p = KOENIG_LOOKUP_P (t);
8626 if (TREE_CODE (function) == SCOPE_REF)
8629 function = tsubst_qualified_id (function, args, complain, in_decl,
8631 /*address_p=*/false);
8635 qualified_p = (TREE_CODE (function) == COMPONENT_REF
8636 && (TREE_CODE (TREE_OPERAND (function, 1))
8638 function = tsubst_copy_and_build (function, args, complain,
8641 if (BASELINK_P (function))
8645 call_args = RECUR (TREE_OPERAND (t, 1));
8647 /* We do not perform argument-dependent lookup if normal
8648 lookup finds a non-function, in accordance with the
8649 expected resolution of DR 218. */
8651 && ((is_overloaded_fn (function)
8652 /* If lookup found a member function, the Koenig lookup is
8653 not appropriate, even if an unqualified-name was used
8654 to denote the function. */
8655 && !DECL_FUNCTION_MEMBER_P (get_first_fn (function)))
8656 || TREE_CODE (function) == IDENTIFIER_NODE))
8657 function = perform_koenig_lookup (function, call_args);
8659 if (TREE_CODE (function) == IDENTIFIER_NODE)
8661 unqualified_name_lookup_error (function);
8662 return error_mark_node;
8665 /* Remember that there was a reference to this entity. */
8666 if (DECL_P (function))
8667 mark_used (function);
8669 if (TREE_CODE (function) == OFFSET_REF)
8670 return build_offset_ref_call_from_tree (function, call_args);
8671 if (TREE_CODE (function) == COMPONENT_REF)
8673 if (!BASELINK_P (TREE_OPERAND (function, 1)))
8674 return finish_call_expr (function, call_args,
8675 /*disallow_virtual=*/false,
8676 /*koenig_p=*/false);
8678 return (build_new_method_call
8679 (TREE_OPERAND (function, 0),
8680 TREE_OPERAND (function, 1),
8681 call_args, NULL_TREE,
8682 qualified_p ? LOOKUP_NONVIRTUAL : LOOKUP_NORMAL));
8684 return finish_call_expr (function, call_args,
8685 /*disallow_virtual=*/qualified_p,
8690 return build_x_conditional_expr
8691 (RECUR (TREE_OPERAND (t, 0)),
8692 RECUR (TREE_OPERAND (t, 1)),
8693 RECUR (TREE_OPERAND (t, 2)));
8695 case PSEUDO_DTOR_EXPR:
8696 return finish_pseudo_destructor_expr
8697 (RECUR (TREE_OPERAND (t, 0)),
8698 RECUR (TREE_OPERAND (t, 1)),
8699 RECUR (TREE_OPERAND (t, 2)));
8703 tree purpose, value, chain;
8705 if (t == void_list_node)
8708 purpose = TREE_PURPOSE (t);
8710 purpose = RECUR (purpose);
8711 value = TREE_VALUE (t);
8713 value = RECUR (value);
8714 chain = TREE_CHAIN (t);
8715 if (chain && chain != void_type_node)
8716 chain = RECUR (chain);
8717 if (purpose == TREE_PURPOSE (t)
8718 && value == TREE_VALUE (t)
8719 && chain == TREE_CHAIN (t))
8721 return tree_cons (purpose, value, chain);
8729 object = tsubst_non_call_postfix_expression (TREE_OPERAND (t, 0),
8730 args, complain, in_decl);
8731 /* Remember that there was a reference to this entity. */
8732 if (DECL_P (object))
8735 member = TREE_OPERAND (t, 1);
8736 if (BASELINK_P (member))
8737 member = tsubst_baselink (member,
8738 non_reference (TREE_TYPE (object)),
8739 args, complain, in_decl);
8741 member = tsubst_copy (member, args, complain, in_decl);
8743 if (member == error_mark_node)
8744 return error_mark_node;
8745 else if (!CLASS_TYPE_P (TREE_TYPE (object)))
8747 if (TREE_CODE (member) == BIT_NOT_EXPR)
8748 return finish_pseudo_destructor_expr (object,
8750 TREE_TYPE (object));
8751 else if (TREE_CODE (member) == SCOPE_REF
8752 && (TREE_CODE (TREE_OPERAND (member, 1)) == BIT_NOT_EXPR))
8753 return finish_pseudo_destructor_expr (object,
8755 TREE_TYPE (object));
8757 else if (TREE_CODE (member) == SCOPE_REF
8758 && TREE_CODE (TREE_OPERAND (member, 1)) == TEMPLATE_ID_EXPR)
8763 /* Lookup the template functions now that we know what the
8765 tmpl = TREE_OPERAND (TREE_OPERAND (member, 1), 0);
8766 args = TREE_OPERAND (TREE_OPERAND (member, 1), 1);
8767 member = lookup_qualified_name (TREE_OPERAND (member, 0), tmpl,
8768 /*is_type_p=*/false,
8769 /*complain=*/false);
8770 if (BASELINK_P (member))
8772 BASELINK_FUNCTIONS (member)
8773 = build_nt (TEMPLATE_ID_EXPR, BASELINK_FUNCTIONS (member),
8775 member = (adjust_result_of_qualified_name_lookup
8776 (member, BINFO_TYPE (BASELINK_BINFO (member)),
8777 TREE_TYPE (object)));
8781 qualified_name_lookup_error (TREE_TYPE (object), tmpl,
8783 return error_mark_node;
8786 else if (TREE_CODE (member) == SCOPE_REF
8787 && !CLASS_TYPE_P (TREE_OPERAND (member, 0))
8788 && TREE_CODE (TREE_OPERAND (member, 0)) != NAMESPACE_DECL)
8790 if (complain & tf_error)
8792 if (TYPE_P (TREE_OPERAND (member, 0)))
8793 error ("%qT is not a class or namespace",
8794 TREE_OPERAND (member, 0));
8796 error ("%qD is not a class or namespace",
8797 TREE_OPERAND (member, 0));
8799 return error_mark_node;
8801 else if (TREE_CODE (member) == FIELD_DECL)
8802 return finish_non_static_data_member (member, object, NULL_TREE);
8804 return finish_class_member_access_expr (object, member);
8809 (RECUR (TREE_OPERAND (t, 0)));
8815 tree type = tsubst (TREE_TYPE (t), args, complain, in_decl);
8818 /* digest_init will do the wrong thing if we let it. */
8819 if (type && TYPE_PTRMEMFUNC_P (type))
8823 /* We do not want to process the purpose of aggregate
8824 initializers as they are identifier nodes which will be
8825 looked up by digest_init. */
8826 purpose_p = !(type && IS_AGGR_TYPE (type));
8827 for (elts = CONSTRUCTOR_ELTS (t);
8829 elts = TREE_CHAIN (elts))
8831 tree purpose = TREE_PURPOSE (elts);
8832 tree value = TREE_VALUE (elts);
8834 if (purpose && purpose_p)
8835 purpose = RECUR (purpose);
8836 value = RECUR (value);
8837 r = tree_cons (purpose, value, r);
8840 r = build_constructor (NULL_TREE, nreverse (r));
8841 TREE_HAS_CONSTRUCTOR (r) = TREE_HAS_CONSTRUCTOR (t);
8844 return digest_init (type, r, 0);
8850 tree operand_0 = RECUR (TREE_OPERAND (t, 0));
8851 if (TYPE_P (operand_0))
8852 return get_typeid (operand_0);
8853 return build_typeid (operand_0);
8863 tree r = tsubst_copy (t, args, complain, in_decl);
8865 if (TREE_CODE (TREE_TYPE (t)) != REFERENCE_TYPE)
8866 /* If the original type was a reference, we'll be wrapped in
8867 the appropriate INDIRECT_REF. */
8868 r = convert_from_reference (r);
8873 return build_x_va_arg (RECUR (TREE_OPERAND (t, 0)),
8874 tsubst_copy (TREE_TYPE (t), args, complain,
8878 return fold_offsetof (RECUR (TREE_OPERAND (t, 0)));
8882 tree old_stmt_expr = cur_stmt_expr;
8883 tree stmt_expr = begin_stmt_expr ();
8885 cur_stmt_expr = stmt_expr;
8886 tsubst_expr (STMT_EXPR_STMT (t), args, complain, in_decl);
8887 stmt_expr = finish_stmt_expr (stmt_expr, false);
8888 cur_stmt_expr = old_stmt_expr;
8894 t = tsubst_copy (t, args, complain, in_decl);
8895 /* As in finish_id_expression, we resolve enumeration constants
8896 to their underlying values. */
8897 if (TREE_CODE (t) == CONST_DECL)
8898 return DECL_INITIAL (t);
8902 /* Handle Objective-C++ constructs, if appropriate. */
8905 = objcp_tsubst_copy_and_build (t, args, complain,
8906 in_decl, /*function_p=*/false);
8910 return tsubst_copy (t, args, complain, in_decl);
8916 /* Verify that the instantiated ARGS are valid. For type arguments,
8917 make sure that the type's linkage is ok. For non-type arguments,
8918 make sure they are constants if they are integral or enumerations.
8919 Emit an error under control of COMPLAIN, and return TRUE on error. */
8922 check_instantiated_args (tree tmpl, tree args, tsubst_flags_t complain)
8924 int ix, len = DECL_NTPARMS (tmpl);
8925 bool result = false;
8926 bool error_p = complain & tf_error;
8928 for (ix = 0; ix != len; ix++)
8930 tree t = TREE_VEC_ELT (args, ix);
8934 /* [basic.link]: A name with no linkage (notably, the name
8935 of a class or enumeration declared in a local scope)
8936 shall not be used to declare an entity with linkage.
8937 This implies that names with no linkage cannot be used as
8938 template arguments. */
8939 tree nt = no_linkage_check (t, /*relaxed_p=*/false);
8943 if (TYPE_ANONYMOUS_P (nt))
8944 error ("%qT is/uses anonymous type", t);
8946 error ("%qT uses local type %qT", t, nt);
8950 /* In order to avoid all sorts of complications, we do not
8951 allow variably-modified types as template arguments. */
8952 else if (variably_modified_type_p (t, NULL_TREE))
8954 if (complain & tf_error)
8955 error ("%qT is a variably modified type", t);
8959 /* A non-type argument of integral or enumerated type must be a
8961 else if (TREE_TYPE (t)
8962 && INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (t))
8963 && !TREE_CONSTANT (t))
8965 if (complain & tf_error)
8966 error ("integral expression %qE is not constant", t);
8970 if (result && error_p)
8971 error (" trying to instantiate %qD", tmpl);
8975 /* Instantiate the indicated variable or function template TMPL with
8976 the template arguments in TARG_PTR. */
8979 instantiate_template (tree tmpl, tree targ_ptr, tsubst_flags_t complain)
8985 if (tmpl == error_mark_node)
8986 return error_mark_node;
8988 gcc_assert (TREE_CODE (tmpl) == TEMPLATE_DECL);
8990 /* If this function is a clone, handle it specially. */
8991 if (DECL_CLONED_FUNCTION_P (tmpl))
8996 spec = instantiate_template (DECL_CLONED_FUNCTION (tmpl), targ_ptr,
8998 if (spec == error_mark_node)
8999 return error_mark_node;
9001 /* Look for the clone. */
9002 FOR_EACH_CLONE (clone, spec)
9003 if (DECL_NAME (clone) == DECL_NAME (tmpl))
9005 /* We should always have found the clone by now. */
9010 /* Check to see if we already have this specialization. */
9011 spec = retrieve_specialization (tmpl, targ_ptr,
9012 /*class_specializations_p=*/false);
9013 if (spec != NULL_TREE)
9016 gen_tmpl = most_general_template (tmpl);
9017 if (tmpl != gen_tmpl)
9019 /* The TMPL is a partial instantiation. To get a full set of
9020 arguments we must add the arguments used to perform the
9021 partial instantiation. */
9022 targ_ptr = add_outermost_template_args (DECL_TI_ARGS (tmpl),
9025 /* Check to see if we already have this specialization. */
9026 spec = retrieve_specialization (gen_tmpl, targ_ptr,
9027 /*class_specializations_p=*/false);
9028 if (spec != NULL_TREE)
9032 if (check_instantiated_args (gen_tmpl, INNERMOST_TEMPLATE_ARGS (targ_ptr),
9034 return error_mark_node;
9036 /* We are building a FUNCTION_DECL, during which the access of its
9037 parameters and return types have to be checked. However this
9038 FUNCTION_DECL which is the desired context for access checking
9039 is not built yet. We solve this chicken-and-egg problem by
9040 deferring all checks until we have the FUNCTION_DECL. */
9041 push_deferring_access_checks (dk_deferred);
9043 /* Substitute template parameters. */
9044 fndecl = tsubst (DECL_TEMPLATE_RESULT (gen_tmpl),
9045 targ_ptr, complain, gen_tmpl);
9047 /* Now we know the specialization, compute access previously
9049 push_access_scope (fndecl);
9050 perform_deferred_access_checks ();
9051 pop_access_scope (fndecl);
9052 pop_deferring_access_checks ();
9054 /* The DECL_TI_TEMPLATE should always be the immediate parent
9055 template, not the most general template. */
9056 DECL_TI_TEMPLATE (fndecl) = tmpl;
9058 /* If we've just instantiated the main entry point for a function,
9059 instantiate all the alternate entry points as well. We do this
9060 by cloning the instantiation of the main entry point, not by
9061 instantiating the template clones. */
9062 if (TREE_CHAIN (gen_tmpl) && DECL_CLONED_FUNCTION_P (TREE_CHAIN (gen_tmpl)))
9063 clone_function_decl (fndecl, /*update_method_vec_p=*/0);
9068 /* The FN is a TEMPLATE_DECL for a function. The ARGS are the
9069 arguments that are being used when calling it. TARGS is a vector
9070 into which the deduced template arguments are placed.
9072 Return zero for success, 2 for an incomplete match that doesn't resolve
9073 all the types, and 1 for complete failure. An error message will be
9074 printed only for an incomplete match.
9076 If FN is a conversion operator, or we are trying to produce a specific
9077 specialization, RETURN_TYPE is the return type desired.
9079 The EXPLICIT_TARGS are explicit template arguments provided via a
9082 The parameter STRICT is one of:
9085 We are deducing arguments for a function call, as in
9089 We are deducing arguments for a conversion function, as in
9093 We are deducing arguments when doing an explicit instantiation
9094 as in [temp.explicit], when determining an explicit specialization
9095 as in [temp.expl.spec], or when taking the address of a function
9096 template, as in [temp.deduct.funcaddr]. */
9099 fn_type_unification (tree fn,
9100 tree explicit_targs,
9104 unification_kind_t strict)
9110 gcc_assert (TREE_CODE (fn) == TEMPLATE_DECL);
9112 fntype = TREE_TYPE (fn);
9117 The specified template arguments must match the template
9118 parameters in kind (i.e., type, nontype, template), and there
9119 must not be more arguments than there are parameters;
9120 otherwise type deduction fails.
9122 Nontype arguments must match the types of the corresponding
9123 nontype template parameters, or must be convertible to the
9124 types of the corresponding nontype parameters as specified in
9125 _temp.arg.nontype_, otherwise type deduction fails.
9127 All references in the function type of the function template
9128 to the corresponding template parameters are replaced by the
9129 specified template argument values. If a substitution in a
9130 template parameter or in the function type of the function
9131 template results in an invalid type, type deduction fails. */
9133 tree converted_args;
9136 if (explicit_targs == error_mark_node)
9140 = (coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn),
9141 explicit_targs, NULL_TREE, tf_none,
9142 /*require_all_arguments=*/0));
9143 if (converted_args == error_mark_node)
9146 /* Substitute the explicit args into the function type. This is
9147 necessary so that, for instance, explicitly declared function
9148 arguments can match null pointed constants. If we were given
9149 an incomplete set of explicit args, we must not do semantic
9150 processing during substitution as we could create partial
9152 incomplete = NUM_TMPL_ARGS (explicit_targs) != NUM_TMPL_ARGS (targs);
9153 processing_template_decl += incomplete;
9154 fntype = tsubst (fntype, converted_args, tf_none, NULL_TREE);
9155 processing_template_decl -= incomplete;
9157 if (fntype == error_mark_node)
9160 /* Place the explicitly specified arguments in TARGS. */
9161 for (i = NUM_TMPL_ARGS (converted_args); i--;)
9162 TREE_VEC_ELT (targs, i) = TREE_VEC_ELT (converted_args, i);
9165 parms = TYPE_ARG_TYPES (fntype);
9166 /* Never do unification on the 'this' parameter. */
9167 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn))
9168 parms = TREE_CHAIN (parms);
9172 /* We've been given a return type to match, prepend it. */
9173 parms = tree_cons (NULL_TREE, TREE_TYPE (fntype), parms);
9174 args = tree_cons (NULL_TREE, return_type, args);
9177 /* We allow incomplete unification without an error message here
9178 because the standard doesn't seem to explicitly prohibit it. Our
9179 callers must be ready to deal with unification failures in any
9181 result = type_unification_real (DECL_INNERMOST_TEMPLATE_PARMS (fn),
9182 targs, parms, args, /*subr=*/0,
9183 strict, /*allow_incomplete*/1);
9186 /* All is well so far. Now, check:
9190 When all template arguments have been deduced, all uses of
9191 template parameters in nondeduced contexts are replaced with
9192 the corresponding deduced argument values. If the
9193 substitution results in an invalid type, as described above,
9194 type deduction fails. */
9195 if (tsubst (TREE_TYPE (fn), targs, tf_none, NULL_TREE)
9202 /* Adjust types before performing type deduction, as described in
9203 [temp.deduct.call] and [temp.deduct.conv]. The rules in these two
9204 sections are symmetric. PARM is the type of a function parameter
9205 or the return type of the conversion function. ARG is the type of
9206 the argument passed to the call, or the type of the value
9207 initialized with the result of the conversion function. */
9210 maybe_adjust_types_for_deduction (unification_kind_t strict,
9223 /* Swap PARM and ARG throughout the remainder of this
9224 function; the handling is precisely symmetric since PARM
9225 will initialize ARG rather than vice versa. */
9233 /* There is nothing to do in this case. */
9240 if (TREE_CODE (*parm) != REFERENCE_TYPE)
9242 /* [temp.deduct.call]
9244 If P is not a reference type:
9246 --If A is an array type, the pointer type produced by the
9247 array-to-pointer standard conversion (_conv.array_) is
9248 used in place of A for type deduction; otherwise,
9250 --If A is a function type, the pointer type produced by
9251 the function-to-pointer standard conversion
9252 (_conv.func_) is used in place of A for type deduction;
9255 --If A is a cv-qualified type, the top level
9256 cv-qualifiers of A's type are ignored for type
9258 if (TREE_CODE (*arg) == ARRAY_TYPE)
9259 *arg = build_pointer_type (TREE_TYPE (*arg));
9260 else if (TREE_CODE (*arg) == FUNCTION_TYPE)
9261 *arg = build_pointer_type (*arg);
9263 *arg = TYPE_MAIN_VARIANT (*arg);
9266 /* [temp.deduct.call]
9268 If P is a cv-qualified type, the top level cv-qualifiers
9269 of P's type are ignored for type deduction. If P is a
9270 reference type, the type referred to by P is used for
9272 *parm = TYPE_MAIN_VARIANT (*parm);
9273 if (TREE_CODE (*parm) == REFERENCE_TYPE)
9275 *parm = TREE_TYPE (*parm);
9276 result |= UNIFY_ALLOW_OUTER_MORE_CV_QUAL;
9279 /* DR 322. For conversion deduction, remove a reference type on parm
9280 too (which has been swapped into ARG). */
9281 if (strict == DEDUCE_CONV && TREE_CODE (*arg) == REFERENCE_TYPE)
9282 *arg = TREE_TYPE (*arg);
9287 /* Most parms like fn_type_unification.
9289 If SUBR is 1, we're being called recursively (to unify the
9290 arguments of a function or method parameter of a function
9294 type_unification_real (tree tparms,
9299 unification_kind_t strict,
9300 int allow_incomplete)
9304 int ntparms = TREE_VEC_LENGTH (tparms);
9306 int saw_undeduced = 0;
9309 gcc_assert (TREE_CODE (tparms) == TREE_VEC);
9310 gcc_assert (xparms == NULL_TREE || TREE_CODE (xparms) == TREE_LIST);
9311 gcc_assert (!xargs || TREE_CODE (xargs) == TREE_LIST);
9312 gcc_assert (ntparms > 0);
9317 sub_strict = (UNIFY_ALLOW_OUTER_LEVEL | UNIFY_ALLOW_MORE_CV_QUAL
9318 | UNIFY_ALLOW_DERIVED);
9322 sub_strict = UNIFY_ALLOW_LESS_CV_QUAL;
9326 sub_strict = UNIFY_ALLOW_NONE;
9337 while (parms && parms != void_list_node
9338 && args && args != void_list_node)
9340 parm = TREE_VALUE (parms);
9341 parms = TREE_CHAIN (parms);
9342 arg = TREE_VALUE (args);
9343 args = TREE_CHAIN (args);
9345 if (arg == error_mark_node)
9347 if (arg == unknown_type_node)
9348 /* We can't deduce anything from this, but we might get all the
9349 template args from other function args. */
9352 /* Conversions will be performed on a function argument that
9353 corresponds with a function parameter that contains only
9354 non-deducible template parameters and explicitly specified
9355 template parameters. */
9356 if (!uses_template_parms (parm))
9361 type = TREE_TYPE (arg);
9365 if (strict == DEDUCE_EXACT)
9367 if (same_type_p (parm, type))
9371 /* It might work; we shouldn't check now, because we might
9372 get into infinite recursion. Overload resolution will
9381 gcc_assert (TREE_TYPE (arg) != NULL_TREE);
9382 if (type_unknown_p (arg))
9384 /* [temp.deduct.type] A template-argument can be deduced from
9385 a pointer to function or pointer to member function
9386 argument if the set of overloaded functions does not
9387 contain function templates and at most one of a set of
9388 overloaded functions provides a unique match. */
9390 if (resolve_overloaded_unification
9391 (tparms, targs, parm, arg, strict, sub_strict)
9396 arg = TREE_TYPE (arg);
9397 if (arg == error_mark_node)
9402 int arg_strict = sub_strict;
9405 arg_strict |= maybe_adjust_types_for_deduction (strict, &parm, &arg);
9407 if (unify (tparms, targs, parm, arg, arg_strict))
9412 /* Fail if we've reached the end of the parm list, and more args
9413 are present, and the parm list isn't variadic. */
9414 if (args && args != void_list_node && parms == void_list_node)
9416 /* Fail if parms are left and they don't have default values. */
9417 if (parms && parms != void_list_node
9418 && TREE_PURPOSE (parms) == NULL_TREE)
9422 for (i = 0; i < ntparms; i++)
9423 if (!TREE_VEC_ELT (targs, i))
9425 tree tparm = TREE_VALUE (TREE_VEC_ELT (tparms, i));
9427 /* If this is an undeduced nontype parameter that depends on
9428 a type parameter, try another pass; its type may have been
9429 deduced from a later argument than the one from which
9430 this parameter can be deduced. */
9431 if (TREE_CODE (tparm) == PARM_DECL
9432 && uses_template_parms (TREE_TYPE (tparm))
9433 && !saw_undeduced++)
9436 if (!allow_incomplete)
9437 error ("incomplete type unification");
9444 /* Subroutine of type_unification_real. Args are like the variables at the
9445 call site. ARG is an overloaded function (or template-id); we try
9446 deducing template args from each of the overloads, and if only one
9447 succeeds, we go with that. Modifies TARGS and returns 0 on success. */
9450 resolve_overloaded_unification (tree tparms,
9454 unification_kind_t strict,
9457 tree tempargs = copy_node (targs);
9461 if (TREE_CODE (arg) == ADDR_EXPR)
9463 arg = TREE_OPERAND (arg, 0);
9469 if (TREE_CODE (arg) == COMPONENT_REF)
9470 /* Handle `&x' where `x' is some static or non-static member
9472 arg = TREE_OPERAND (arg, 1);
9474 if (TREE_CODE (arg) == OFFSET_REF)
9475 arg = TREE_OPERAND (arg, 1);
9477 /* Strip baselink information. */
9478 if (BASELINK_P (arg))
9479 arg = BASELINK_FUNCTIONS (arg);
9481 if (TREE_CODE (arg) == TEMPLATE_ID_EXPR)
9483 /* If we got some explicit template args, we need to plug them into
9484 the affected templates before we try to unify, in case the
9485 explicit args will completely resolve the templates in question. */
9487 tree expl_subargs = TREE_OPERAND (arg, 1);
9488 arg = TREE_OPERAND (arg, 0);
9490 for (; arg; arg = OVL_NEXT (arg))
9492 tree fn = OVL_CURRENT (arg);
9495 if (TREE_CODE (fn) != TEMPLATE_DECL)
9498 subargs = get_bindings (fn, DECL_TEMPLATE_RESULT (fn),
9499 expl_subargs, /*check_ret=*/false);
9502 elem = tsubst (TREE_TYPE (fn), subargs, tf_none, NULL_TREE);
9503 good += try_one_overload (tparms, targs, tempargs, parm,
9504 elem, strict, sub_strict, addr_p);
9510 gcc_assert (TREE_CODE (arg) == OVERLOAD
9511 || TREE_CODE (arg) == FUNCTION_DECL);
9513 for (; arg; arg = OVL_NEXT (arg))
9514 good += try_one_overload (tparms, targs, tempargs, parm,
9515 TREE_TYPE (OVL_CURRENT (arg)),
9516 strict, sub_strict, addr_p);
9519 /* [temp.deduct.type] A template-argument can be deduced from a pointer
9520 to function or pointer to member function argument if the set of
9521 overloaded functions does not contain function templates and at most
9522 one of a set of overloaded functions provides a unique match.
9524 So if we found multiple possibilities, we return success but don't
9529 int i = TREE_VEC_LENGTH (targs);
9531 if (TREE_VEC_ELT (tempargs, i))
9532 TREE_VEC_ELT (targs, i) = TREE_VEC_ELT (tempargs, i);
9540 /* Subroutine of resolve_overloaded_unification; does deduction for a single
9541 overload. Fills TARGS with any deduced arguments, or error_mark_node if
9542 different overloads deduce different arguments for a given parm.
9543 ADDR_P is true if the expression for which deduction is being
9544 performed was of the form "& fn" rather than simply "fn".
9546 Returns 1 on success. */
9549 try_one_overload (tree tparms,
9554 unification_kind_t strict,
9562 /* [temp.deduct.type] A template-argument can be deduced from a pointer
9563 to function or pointer to member function argument if the set of
9564 overloaded functions does not contain function templates and at most
9565 one of a set of overloaded functions provides a unique match.
9567 So if this is a template, just return success. */
9569 if (uses_template_parms (arg))
9572 if (TREE_CODE (arg) == METHOD_TYPE)
9573 arg = build_ptrmemfunc_type (build_pointer_type (arg));
9575 arg = build_pointer_type (arg);
9577 sub_strict |= maybe_adjust_types_for_deduction (strict, &parm, &arg);
9579 /* We don't copy orig_targs for this because if we have already deduced
9580 some template args from previous args, unify would complain when we
9581 try to deduce a template parameter for the same argument, even though
9582 there isn't really a conflict. */
9583 nargs = TREE_VEC_LENGTH (targs);
9584 tempargs = make_tree_vec (nargs);
9586 if (unify (tparms, tempargs, parm, arg, sub_strict) != 0)
9589 /* First make sure we didn't deduce anything that conflicts with
9590 explicitly specified args. */
9591 for (i = nargs; i--; )
9593 tree elt = TREE_VEC_ELT (tempargs, i);
9594 tree oldelt = TREE_VEC_ELT (orig_targs, i);
9598 else if (uses_template_parms (elt))
9599 /* Since we're unifying against ourselves, we will fill in
9600 template args used in the function parm list with our own
9601 template parms. Discard them. */
9602 TREE_VEC_ELT (tempargs, i) = NULL_TREE;
9603 else if (oldelt && !template_args_equal (oldelt, elt))
9607 for (i = nargs; i--; )
9609 tree elt = TREE_VEC_ELT (tempargs, i);
9612 TREE_VEC_ELT (targs, i) = elt;
9618 /* Verify that nondeduce template argument agrees with the type
9619 obtained from argument deduction. Return nonzero if the
9624 struct A { typedef int X; };
9625 template <class T, class U> struct C {};
9626 template <class T> struct C<T, typename T::X> {};
9628 Then with the instantiation `C<A, int>', we can deduce that
9629 `T' is `A' but unify () does not check whether `typename T::X'
9630 is `int'. This function ensure that they agree.
9632 TARGS, PARMS are the same as the arguments of unify.
9633 ARGS contains template arguments from all levels. */
9636 verify_class_unification (tree targs, tree parms, tree args)
9638 parms = tsubst (parms, add_outermost_template_args (args, targs),
9639 tf_none, NULL_TREE);
9640 if (parms == error_mark_node)
9643 return !comp_template_args (parms, INNERMOST_TEMPLATE_ARGS (args));
9646 /* PARM is a template class (perhaps with unbound template
9647 parameters). ARG is a fully instantiated type. If ARG can be
9648 bound to PARM, return ARG, otherwise return NULL_TREE. TPARMS and
9649 TARGS are as for unify. */
9652 try_class_unification (tree tparms, tree targs, tree parm, tree arg)
9656 if (!CLASSTYPE_TEMPLATE_INFO (arg)
9657 || (most_general_template (CLASSTYPE_TI_TEMPLATE (arg))
9658 != most_general_template (CLASSTYPE_TI_TEMPLATE (parm))))
9661 /* We need to make a new template argument vector for the call to
9662 unify. If we used TARGS, we'd clutter it up with the result of
9663 the attempted unification, even if this class didn't work out.
9664 We also don't want to commit ourselves to all the unifications
9665 we've already done, since unification is supposed to be done on
9666 an argument-by-argument basis. In other words, consider the
9667 following pathological case:
9669 template <int I, int J, int K>
9672 template <int I, int J>
9673 struct S<I, J, 2> : public S<I, I, I>, S<J, J, J> {};
9675 template <int I, int J, int K>
9676 void f(S<I, J, K>, S<I, I, I>);
9685 Now, by the time we consider the unification involving `s2', we
9686 already know that we must have `f<0, 0, 0>'. But, even though
9687 `S<0, 1, 2>' is derived from `S<0, 0, 0>', the code is invalid
9688 because there are two ways to unify base classes of S<0, 1, 2>
9689 with S<I, I, I>. If we kept the already deduced knowledge, we
9690 would reject the possibility I=1. */
9691 copy_of_targs = make_tree_vec (TREE_VEC_LENGTH (targs));
9693 /* If unification failed, we're done. */
9694 if (unify (tparms, copy_of_targs, CLASSTYPE_TI_ARGS (parm),
9695 CLASSTYPE_TI_ARGS (arg), UNIFY_ALLOW_NONE))
9701 /* Given a template type PARM and a class type ARG, find the unique
9702 base type in ARG that is an instance of PARM. We do not examine
9703 ARG itself; only its base-classes. If there is not exactly one
9704 appropriate base class, return NULL_TREE. PARM may be the type of
9705 a partial specialization, as well as a plain template type. Used
9709 get_template_base (tree tparms, tree targs, tree parm, tree arg)
9711 tree rval = NULL_TREE;
9714 gcc_assert (IS_AGGR_TYPE_CODE (TREE_CODE (arg)));
9716 binfo = TYPE_BINFO (complete_type (arg));
9718 /* The type could not be completed. */
9721 /* Walk in inheritance graph order. The search order is not
9722 important, and this avoids multiple walks of virtual bases. */
9723 for (binfo = TREE_CHAIN (binfo); binfo; binfo = TREE_CHAIN (binfo))
9725 tree r = try_class_unification (tparms, targs, parm, BINFO_TYPE (binfo));
9729 /* If there is more than one satisfactory baseclass, then:
9733 If they yield more than one possible deduced A, the type
9737 if (rval && !same_type_p (r, rval))
9747 /* Returns the level of DECL, which declares a template parameter. */
9750 template_decl_level (tree decl)
9752 switch (TREE_CODE (decl))
9756 return TEMPLATE_TYPE_LEVEL (TREE_TYPE (decl));
9759 return TEMPLATE_PARM_LEVEL (DECL_INITIAL (decl));
9767 /* Decide whether ARG can be unified with PARM, considering only the
9768 cv-qualifiers of each type, given STRICT as documented for unify.
9769 Returns nonzero iff the unification is OK on that basis. */
9772 check_cv_quals_for_unify (int strict, tree arg, tree parm)
9774 int arg_quals = cp_type_quals (arg);
9775 int parm_quals = cp_type_quals (parm);
9777 if (TREE_CODE (parm) == TEMPLATE_TYPE_PARM
9778 && !(strict & UNIFY_ALLOW_OUTER_MORE_CV_QUAL))
9780 /* Although a CVR qualifier is ignored when being applied to a
9781 substituted template parameter ([8.3.2]/1 for example), that
9782 does not apply during deduction [14.8.2.4]/1, (even though
9783 that is not explicitly mentioned, [14.8.2.4]/9 indicates
9784 this). Except when we're allowing additional CV qualifiers
9785 at the outer level [14.8.2.1]/3,1st bullet. */
9786 if ((TREE_CODE (arg) == REFERENCE_TYPE
9787 || TREE_CODE (arg) == FUNCTION_TYPE
9788 || TREE_CODE (arg) == METHOD_TYPE)
9789 && (parm_quals & (TYPE_QUAL_CONST | TYPE_QUAL_VOLATILE)))
9792 if ((!POINTER_TYPE_P (arg) && TREE_CODE (arg) != TEMPLATE_TYPE_PARM)
9793 && (parm_quals & TYPE_QUAL_RESTRICT))
9797 if (!(strict & (UNIFY_ALLOW_MORE_CV_QUAL | UNIFY_ALLOW_OUTER_MORE_CV_QUAL))
9798 && (arg_quals & parm_quals) != parm_quals)
9801 if (!(strict & (UNIFY_ALLOW_LESS_CV_QUAL | UNIFY_ALLOW_OUTER_LESS_CV_QUAL))
9802 && (parm_quals & arg_quals) != arg_quals)
9808 /* Takes parameters as for type_unification. Returns 0 if the
9809 type deduction succeeds, 1 otherwise. The parameter STRICT is a
9810 bitwise or of the following flags:
9813 Require an exact match between PARM and ARG.
9814 UNIFY_ALLOW_MORE_CV_QUAL:
9815 Allow the deduced ARG to be more cv-qualified (by qualification
9816 conversion) than ARG.
9817 UNIFY_ALLOW_LESS_CV_QUAL:
9818 Allow the deduced ARG to be less cv-qualified than ARG.
9819 UNIFY_ALLOW_DERIVED:
9820 Allow the deduced ARG to be a template base class of ARG,
9821 or a pointer to a template base class of the type pointed to by
9823 UNIFY_ALLOW_INTEGER:
9824 Allow any integral type to be deduced. See the TEMPLATE_PARM_INDEX
9825 case for more information.
9826 UNIFY_ALLOW_OUTER_LEVEL:
9827 This is the outermost level of a deduction. Used to determine validity
9828 of qualification conversions. A valid qualification conversion must
9829 have const qualified pointers leading up to the inner type which
9830 requires additional CV quals, except at the outer level, where const
9831 is not required [conv.qual]. It would be normal to set this flag in
9832 addition to setting UNIFY_ALLOW_MORE_CV_QUAL.
9833 UNIFY_ALLOW_OUTER_MORE_CV_QUAL:
9834 This is the outermost level of a deduction, and PARM can be more CV
9835 qualified at this point.
9836 UNIFY_ALLOW_OUTER_LESS_CV_QUAL:
9837 This is the outermost level of a deduction, and PARM can be less CV
9838 qualified at this point. */
9841 unify (tree tparms, tree targs, tree parm, tree arg, int strict)
9846 int strict_in = strict;
9848 /* I don't think this will do the right thing with respect to types.
9849 But the only case I've seen it in so far has been array bounds, where
9850 signedness is the only information lost, and I think that will be
9852 while (TREE_CODE (parm) == NOP_EXPR)
9853 parm = TREE_OPERAND (parm, 0);
9855 if (arg == error_mark_node)
9857 if (arg == unknown_type_node)
9858 /* We can't deduce anything from this, but we might get all the
9859 template args from other function args. */
9862 /* If PARM uses template parameters, then we can't bail out here,
9863 even if ARG == PARM, since we won't record unifications for the
9864 template parameters. We might need them if we're trying to
9865 figure out which of two things is more specialized. */
9866 if (arg == parm && !uses_template_parms (parm))
9869 /* Immediately reject some pairs that won't unify because of
9870 cv-qualification mismatches. */
9871 if (TREE_CODE (arg) == TREE_CODE (parm)
9873 /* It is the elements of the array which hold the cv quals of an array
9874 type, and the elements might be template type parms. We'll check
9876 && TREE_CODE (arg) != ARRAY_TYPE
9877 /* We check the cv-qualifiers when unifying with template type
9878 parameters below. We want to allow ARG `const T' to unify with
9879 PARM `T' for example, when computing which of two templates
9880 is more specialized, for example. */
9881 && TREE_CODE (arg) != TEMPLATE_TYPE_PARM
9882 && !check_cv_quals_for_unify (strict_in, arg, parm))
9885 if (!(strict & UNIFY_ALLOW_OUTER_LEVEL)
9886 && TYPE_P (parm) && !CP_TYPE_CONST_P (parm))
9887 strict &= ~UNIFY_ALLOW_MORE_CV_QUAL;
9888 strict &= ~UNIFY_ALLOW_OUTER_LEVEL;
9889 strict &= ~UNIFY_ALLOW_DERIVED;
9890 strict &= ~UNIFY_ALLOW_OUTER_MORE_CV_QUAL;
9891 strict &= ~UNIFY_ALLOW_OUTER_LESS_CV_QUAL;
9893 switch (TREE_CODE (parm))
9897 case UNBOUND_CLASS_TEMPLATE:
9898 /* In a type which contains a nested-name-specifier, template
9899 argument values cannot be deduced for template parameters used
9900 within the nested-name-specifier. */
9903 case TEMPLATE_TYPE_PARM:
9904 case TEMPLATE_TEMPLATE_PARM:
9905 case BOUND_TEMPLATE_TEMPLATE_PARM:
9906 tparm = TREE_VALUE (TREE_VEC_ELT (tparms, 0));
9908 if (TEMPLATE_TYPE_LEVEL (parm)
9909 != template_decl_level (tparm))
9910 /* The PARM is not one we're trying to unify. Just check
9911 to see if it matches ARG. */
9912 return (TREE_CODE (arg) == TREE_CODE (parm)
9913 && same_type_p (parm, arg)) ? 0 : 1;
9914 idx = TEMPLATE_TYPE_IDX (parm);
9915 targ = TREE_VEC_ELT (targs, idx);
9916 tparm = TREE_VALUE (TREE_VEC_ELT (tparms, idx));
9918 /* Check for mixed types and values. */
9919 if ((TREE_CODE (parm) == TEMPLATE_TYPE_PARM
9920 && TREE_CODE (tparm) != TYPE_DECL)
9921 || (TREE_CODE (parm) == TEMPLATE_TEMPLATE_PARM
9922 && TREE_CODE (tparm) != TEMPLATE_DECL))
9925 if (TREE_CODE (parm) == BOUND_TEMPLATE_TEMPLATE_PARM)
9927 /* ARG must be constructed from a template class or a template
9928 template parameter. */
9929 if (TREE_CODE (arg) != BOUND_TEMPLATE_TEMPLATE_PARM
9930 && (TREE_CODE (arg) != RECORD_TYPE || !CLASSTYPE_TEMPLATE_INFO (arg)))
9934 tree parmtmpl = TYPE_TI_TEMPLATE (parm);
9935 tree parmvec = TYPE_TI_ARGS (parm);
9936 tree argvec = INNERMOST_TEMPLATE_ARGS (TYPE_TI_ARGS (arg));
9938 = DECL_INNERMOST_TEMPLATE_PARMS (TYPE_TI_TEMPLATE (arg));
9941 /* The parameter and argument roles have to be switched here
9942 in order to handle default arguments properly. For example,
9943 template<template <class> class TT> void f(TT<int>)
9944 should be able to accept vector<int> which comes from
9945 template <class T, class Allocator = allocator>
9948 if (coerce_template_parms (argtmplvec, parmvec, parmtmpl, 0, 1)
9952 /* Deduce arguments T, i from TT<T> or TT<i>.
9953 We check each element of PARMVEC and ARGVEC individually
9954 rather than the whole TREE_VEC since they can have
9955 different number of elements. */
9957 for (i = 0; i < TREE_VEC_LENGTH (parmvec); ++i)
9959 if (unify (tparms, targs,
9960 TREE_VEC_ELT (parmvec, i),
9961 TREE_VEC_ELT (argvec, i),
9966 arg = TYPE_TI_TEMPLATE (arg);
9968 /* Fall through to deduce template name. */
9971 if (TREE_CODE (parm) == TEMPLATE_TEMPLATE_PARM
9972 || TREE_CODE (parm) == BOUND_TEMPLATE_TEMPLATE_PARM)
9974 /* Deduce template name TT from TT, TT<>, TT<T> and TT<i>. */
9976 /* Simple cases: Value already set, does match or doesn't. */
9977 if (targ != NULL_TREE && template_args_equal (targ, arg))
9984 /* If PARM is `const T' and ARG is only `int', we don't have
9985 a match unless we are allowing additional qualification.
9986 If ARG is `const int' and PARM is just `T' that's OK;
9987 that binds `const int' to `T'. */
9988 if (!check_cv_quals_for_unify (strict_in | UNIFY_ALLOW_LESS_CV_QUAL,
9992 /* Consider the case where ARG is `const volatile int' and
9993 PARM is `const T'. Then, T should be `volatile int'. */
9994 arg = cp_build_qualified_type_real
9995 (arg, cp_type_quals (arg) & ~cp_type_quals (parm), tf_none);
9996 if (arg == error_mark_node)
9999 /* Simple cases: Value already set, does match or doesn't. */
10000 if (targ != NULL_TREE && same_type_p (targ, arg))
10005 /* Make sure that ARG is not a variable-sized array. (Note
10006 that were talking about variable-sized arrays (like
10007 `int[n]'), rather than arrays of unknown size (like
10008 `int[]').) We'll get very confused by such a type since
10009 the bound of the array will not be computable in an
10010 instantiation. Besides, such types are not allowed in
10011 ISO C++, so we can do as we please here. */
10012 if (variably_modified_type_p (arg, NULL_TREE))
10016 TREE_VEC_ELT (targs, idx) = arg;
10019 case TEMPLATE_PARM_INDEX:
10020 tparm = TREE_VALUE (TREE_VEC_ELT (tparms, 0));
10022 if (TEMPLATE_PARM_LEVEL (parm)
10023 != template_decl_level (tparm))
10024 /* The PARM is not one we're trying to unify. Just check
10025 to see if it matches ARG. */
10026 return !(TREE_CODE (arg) == TREE_CODE (parm)
10027 && cp_tree_equal (parm, arg));
10029 idx = TEMPLATE_PARM_IDX (parm);
10030 targ = TREE_VEC_ELT (targs, idx);
10033 return !cp_tree_equal (targ, arg);
10035 /* [temp.deduct.type] If, in the declaration of a function template
10036 with a non-type template-parameter, the non-type
10037 template-parameter is used in an expression in the function
10038 parameter-list and, if the corresponding template-argument is
10039 deduced, the template-argument type shall match the type of the
10040 template-parameter exactly, except that a template-argument
10041 deduced from an array bound may be of any integral type.
10042 The non-type parameter might use already deduced type parameters. */
10043 tparm = tsubst (TREE_TYPE (parm), targs, 0, NULL_TREE);
10044 if (!TREE_TYPE (arg))
10045 /* Template-parameter dependent expression. Just accept it for now.
10046 It will later be processed in convert_template_argument. */
10048 else if (same_type_p (TREE_TYPE (arg), tparm))
10050 else if ((strict & UNIFY_ALLOW_INTEGER)
10051 && (TREE_CODE (tparm) == INTEGER_TYPE
10052 || TREE_CODE (tparm) == BOOLEAN_TYPE))
10053 /* Convert the ARG to the type of PARM; the deduced non-type
10054 template argument must exactly match the types of the
10055 corresponding parameter. */
10056 arg = fold (build_nop (TREE_TYPE (parm), arg));
10057 else if (uses_template_parms (tparm))
10058 /* We haven't deduced the type of this parameter yet. Try again
10064 TREE_VEC_ELT (targs, idx) = arg;
10069 /* A pointer-to-member constant can be unified only with
10070 another constant. */
10071 if (TREE_CODE (arg) != PTRMEM_CST)
10074 /* Just unify the class member. It would be useless (and possibly
10075 wrong, depending on the strict flags) to unify also
10076 PTRMEM_CST_CLASS, because we want to be sure that both parm and
10077 arg refer to the same variable, even if through different
10078 classes. For instance:
10080 struct A { int x; };
10083 Unification of &A::x and &B::x must succeed. */
10084 return unify (tparms, targs, PTRMEM_CST_MEMBER (parm),
10085 PTRMEM_CST_MEMBER (arg), strict);
10090 if (TREE_CODE (arg) != POINTER_TYPE)
10093 /* [temp.deduct.call]
10095 A can be another pointer or pointer to member type that can
10096 be converted to the deduced A via a qualification
10097 conversion (_conv.qual_).
10099 We pass down STRICT here rather than UNIFY_ALLOW_NONE.
10100 This will allow for additional cv-qualification of the
10101 pointed-to types if appropriate. */
10103 if (TREE_CODE (TREE_TYPE (arg)) == RECORD_TYPE)
10104 /* The derived-to-base conversion only persists through one
10105 level of pointers. */
10106 strict |= (strict_in & UNIFY_ALLOW_DERIVED);
10108 return unify (tparms, targs, TREE_TYPE (parm),
10109 TREE_TYPE (arg), strict);
10112 case REFERENCE_TYPE:
10113 if (TREE_CODE (arg) != REFERENCE_TYPE)
10115 return unify (tparms, targs, TREE_TYPE (parm), TREE_TYPE (arg),
10116 strict & UNIFY_ALLOW_MORE_CV_QUAL);
10119 if (TREE_CODE (arg) != ARRAY_TYPE)
10121 if ((TYPE_DOMAIN (parm) == NULL_TREE)
10122 != (TYPE_DOMAIN (arg) == NULL_TREE))
10124 if (TYPE_DOMAIN (parm) != NULL_TREE)
10129 parm_max = TYPE_MAX_VALUE (TYPE_DOMAIN (parm));
10130 arg_max = TYPE_MAX_VALUE (TYPE_DOMAIN (arg));
10132 /* Our representation of array types uses "N - 1" as the
10133 TYPE_MAX_VALUE for an array with "N" elements, if "N" is
10134 not an integer constant. */
10135 if (TREE_CODE (parm_max) == MINUS_EXPR)
10137 arg_max = fold_build2 (PLUS_EXPR,
10140 TREE_OPERAND (parm_max, 1));
10141 parm_max = TREE_OPERAND (parm_max, 0);
10144 if (unify (tparms, targs, parm_max, arg_max, UNIFY_ALLOW_INTEGER))
10147 return unify (tparms, targs, TREE_TYPE (parm), TREE_TYPE (arg),
10148 strict & UNIFY_ALLOW_MORE_CV_QUAL);
10155 case ENUMERAL_TYPE:
10157 if (TREE_CODE (arg) != TREE_CODE (parm))
10160 /* We have already checked cv-qualification at the top of the
10162 if (!same_type_ignoring_top_level_qualifiers_p (arg, parm))
10165 /* As far as unification is concerned, this wins. Later checks
10166 will invalidate it if necessary. */
10169 /* Types INTEGER_CST and MINUS_EXPR can come from array bounds. */
10170 /* Type INTEGER_CST can come from ordinary constant template args. */
10172 while (TREE_CODE (arg) == NOP_EXPR)
10173 arg = TREE_OPERAND (arg, 0);
10175 if (TREE_CODE (arg) != INTEGER_CST)
10177 return !tree_int_cst_equal (parm, arg);
10182 if (TREE_CODE (arg) != TREE_VEC)
10184 if (TREE_VEC_LENGTH (parm) != TREE_VEC_LENGTH (arg))
10186 for (i = 0; i < TREE_VEC_LENGTH (parm); ++i)
10187 if (unify (tparms, targs,
10188 TREE_VEC_ELT (parm, i), TREE_VEC_ELT (arg, i),
10196 if (TREE_CODE (arg) != TREE_CODE (parm))
10199 if (TYPE_PTRMEMFUNC_P (parm))
10201 if (!TYPE_PTRMEMFUNC_P (arg))
10204 return unify (tparms, targs,
10205 TYPE_PTRMEMFUNC_FN_TYPE (parm),
10206 TYPE_PTRMEMFUNC_FN_TYPE (arg),
10210 if (CLASSTYPE_TEMPLATE_INFO (parm))
10212 tree t = NULL_TREE;
10214 if (strict_in & UNIFY_ALLOW_DERIVED)
10216 /* First, we try to unify the PARM and ARG directly. */
10217 t = try_class_unification (tparms, targs,
10222 /* Fallback to the special case allowed in
10223 [temp.deduct.call]:
10225 If P is a class, and P has the form
10226 template-id, then A can be a derived class of
10227 the deduced A. Likewise, if P is a pointer to
10228 a class of the form template-id, A can be a
10229 pointer to a derived class pointed to by the
10231 t = get_template_base (tparms, targs, parm, arg);
10237 else if (CLASSTYPE_TEMPLATE_INFO (arg)
10238 && (CLASSTYPE_TI_TEMPLATE (parm)
10239 == CLASSTYPE_TI_TEMPLATE (arg)))
10240 /* Perhaps PARM is something like S<U> and ARG is S<int>.
10241 Then, we should unify `int' and `U'. */
10244 /* There's no chance of unification succeeding. */
10247 return unify (tparms, targs, CLASSTYPE_TI_ARGS (parm),
10248 CLASSTYPE_TI_ARGS (t), UNIFY_ALLOW_NONE);
10250 else if (!same_type_ignoring_top_level_qualifiers_p (parm, arg))
10255 case FUNCTION_TYPE:
10256 if (TREE_CODE (arg) != TREE_CODE (parm))
10259 if (unify (tparms, targs, TREE_TYPE (parm),
10260 TREE_TYPE (arg), UNIFY_ALLOW_NONE))
10262 return type_unification_real (tparms, targs, TYPE_ARG_TYPES (parm),
10263 TYPE_ARG_TYPES (arg), 1,
10267 /* Unify a pointer to member with a pointer to member function, which
10268 deduces the type of the member as a function type. */
10269 if (TYPE_PTRMEMFUNC_P (arg))
10273 cp_cv_quals cv_quals;
10275 /* Check top-level cv qualifiers */
10276 if (!check_cv_quals_for_unify (UNIFY_ALLOW_NONE, arg, parm))
10279 if (unify (tparms, targs, TYPE_OFFSET_BASETYPE (parm),
10280 TYPE_PTRMEMFUNC_OBJECT_TYPE (arg), UNIFY_ALLOW_NONE))
10283 /* Determine the type of the function we are unifying against. */
10284 method_type = TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (arg));
10286 build_function_type (TREE_TYPE (method_type),
10287 TREE_CHAIN (TYPE_ARG_TYPES (method_type)));
10289 /* Extract the cv-qualifiers of the member function from the
10290 implicit object parameter and place them on the function
10291 type to be restored later. */
10293 cp_type_quals(TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (method_type))));
10294 fntype = build_qualified_type (fntype, cv_quals);
10295 return unify (tparms, targs, TREE_TYPE (parm), fntype, strict);
10298 if (TREE_CODE (arg) != OFFSET_TYPE)
10300 if (unify (tparms, targs, TYPE_OFFSET_BASETYPE (parm),
10301 TYPE_OFFSET_BASETYPE (arg), UNIFY_ALLOW_NONE))
10303 return unify (tparms, targs, TREE_TYPE (parm), TREE_TYPE (arg),
10307 if (DECL_TEMPLATE_PARM_P (parm))
10308 return unify (tparms, targs, DECL_INITIAL (parm), arg, strict);
10309 if (arg != integral_constant_value (parm))
10314 case TEMPLATE_DECL:
10315 /* Matched cases are handled by the ARG == PARM test above. */
10319 gcc_assert (EXPR_P (parm));
10321 /* We must be looking at an expression. This can happen with
10325 void foo(S<I>, S<I + 2>);
10327 This is a "nondeduced context":
10331 The nondeduced contexts are:
10333 --A type that is a template-id in which one or more of
10334 the template-arguments is an expression that references
10335 a template-parameter.
10337 In these cases, we assume deduction succeeded, but don't
10338 actually infer any unifications. */
10340 if (!uses_template_parms (parm)
10341 && !template_args_equal (parm, arg))
10348 /* Note that DECL can be defined in this translation unit, if
10352 mark_definable (tree decl)
10355 DECL_NOT_REALLY_EXTERN (decl) = 1;
10356 FOR_EACH_CLONE (clone, decl)
10357 DECL_NOT_REALLY_EXTERN (clone) = 1;
10360 /* Called if RESULT is explicitly instantiated, or is a member of an
10361 explicitly instantiated class. */
10364 mark_decl_instantiated (tree result, int extern_p)
10366 SET_DECL_EXPLICIT_INSTANTIATION (result);
10368 /* If this entity has already been written out, it's too late to
10369 make any modifications. */
10370 if (TREE_ASM_WRITTEN (result))
10373 if (TREE_CODE (result) != FUNCTION_DECL)
10374 /* The TREE_PUBLIC flag for function declarations will have been
10375 set correctly by tsubst. */
10376 TREE_PUBLIC (result) = 1;
10378 /* This might have been set by an earlier implicit instantiation. */
10379 DECL_COMDAT (result) = 0;
10382 DECL_NOT_REALLY_EXTERN (result) = 0;
10385 mark_definable (result);
10386 /* Always make artificials weak. */
10387 if (DECL_ARTIFICIAL (result) && flag_weak)
10388 comdat_linkage (result);
10389 /* For WIN32 we also want to put explicit instantiations in
10390 linkonce sections. */
10391 else if (TREE_PUBLIC (result))
10392 maybe_make_one_only (result);
10395 /* If EXTERN_P, then this function will not be emitted -- unless
10396 followed by an explicit instantiation, at which point its linkage
10397 will be adjusted. If !EXTERN_P, then this function will be
10398 emitted here. In neither circumstance do we want
10399 import_export_decl to adjust the linkage. */
10400 DECL_INTERFACE_KNOWN (result) = 1;
10403 /* Given two function templates PAT1 and PAT2, return:
10405 1 if PAT1 is more specialized than PAT2 as described in [temp.func.order].
10406 -1 if PAT2 is more specialized than PAT1.
10407 0 if neither is more specialized.
10409 LEN indicates the number of parameters we should consider
10410 (defaulted parameters should not be considered).
10412 The 1998 std underspecified function template partial ordering, and
10413 DR214 addresses the issue. We take pairs of arguments, one from
10414 each of the templates, and deduce them against each other. One of
10415 the templates will be more specialized if all the *other*
10416 template's arguments deduce against its arguments and at least one
10417 of its arguments *does* *not* deduce against the other template's
10418 corresponding argument. Deduction is done as for class templates.
10419 The arguments used in deduction have reference and top level cv
10420 qualifiers removed. Iff both arguments were originally reference
10421 types *and* deduction succeeds in both directions, the template
10422 with the more cv-qualified argument wins for that pairing (if
10423 neither is more cv-qualified, they both are equal). Unlike regular
10424 deduction, after all the arguments have been deduced in this way,
10425 we do *not* verify the deduced template argument values can be
10426 substituted into non-deduced contexts, nor do we have to verify
10427 that all template arguments have been deduced. */
10430 more_specialized_fn (tree pat1, tree pat2, int len)
10432 tree decl1 = DECL_TEMPLATE_RESULT (pat1);
10433 tree decl2 = DECL_TEMPLATE_RESULT (pat2);
10434 tree targs1 = make_tree_vec (DECL_NTPARMS (pat1));
10435 tree targs2 = make_tree_vec (DECL_NTPARMS (pat2));
10436 tree tparms1 = DECL_INNERMOST_TEMPLATE_PARMS (pat1);
10437 tree tparms2 = DECL_INNERMOST_TEMPLATE_PARMS (pat2);
10438 tree args1 = TYPE_ARG_TYPES (TREE_TYPE (decl1));
10439 tree args2 = TYPE_ARG_TYPES (TREE_TYPE (decl2));
10443 /* If only one is a member function, they are unordered. */
10444 if (DECL_FUNCTION_MEMBER_P (decl1) != DECL_FUNCTION_MEMBER_P (decl2))
10447 /* Don't consider 'this' parameter. */
10448 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl1))
10449 args1 = TREE_CHAIN (args1);
10450 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl2))
10451 args2 = TREE_CHAIN (args2);
10453 /* If only one is a conversion operator, they are unordered. */
10454 if (DECL_CONV_FN_P (decl1) != DECL_CONV_FN_P (decl2))
10457 /* Consider the return type for a conversion function */
10458 if (DECL_CONV_FN_P (decl1))
10460 args1 = tree_cons (NULL_TREE, TREE_TYPE (TREE_TYPE (decl1)), args1);
10461 args2 = tree_cons (NULL_TREE, TREE_TYPE (TREE_TYPE (decl2)), args2);
10465 processing_template_decl++;
10469 tree arg1 = TREE_VALUE (args1);
10470 tree arg2 = TREE_VALUE (args2);
10471 int deduce1, deduce2;
10475 if (TREE_CODE (arg1) == REFERENCE_TYPE)
10477 arg1 = TREE_TYPE (arg1);
10478 quals1 = cp_type_quals (arg1);
10481 if (TREE_CODE (arg2) == REFERENCE_TYPE)
10483 arg2 = TREE_TYPE (arg2);
10484 quals2 = cp_type_quals (arg2);
10487 if ((quals1 < 0) != (quals2 < 0))
10489 /* Only of the args is a reference, see if we should apply
10490 array/function pointer decay to it. This is not part of
10491 DR214, but is, IMHO, consistent with the deduction rules
10492 for the function call itself, and with our earlier
10493 implementation of the underspecified partial ordering
10494 rules. (nathan). */
10497 switch (TREE_CODE (arg1))
10500 arg1 = TREE_TYPE (arg1);
10502 case FUNCTION_TYPE:
10503 arg1 = build_pointer_type (arg1);
10512 switch (TREE_CODE (arg2))
10515 arg2 = TREE_TYPE (arg2);
10517 case FUNCTION_TYPE:
10518 arg2 = build_pointer_type (arg2);
10527 arg1 = TYPE_MAIN_VARIANT (arg1);
10528 arg2 = TYPE_MAIN_VARIANT (arg2);
10530 deduce1 = !unify (tparms1, targs1, arg1, arg2, UNIFY_ALLOW_NONE);
10531 deduce2 = !unify (tparms2, targs2, arg2, arg1, UNIFY_ALLOW_NONE);
10537 if (better1 < 0 && better2 < 0)
10538 /* We've failed to deduce something in either direction.
10539 These must be unordered. */
10542 if (deduce1 && deduce2 && quals1 >= 0 && quals2 >= 0)
10544 /* Deduces in both directions, see if quals can
10545 disambiguate. Pretend the worse one failed to deduce. */
10546 if ((quals1 & quals2) == quals2)
10548 if ((quals1 & quals2) == quals1)
10551 if (deduce1 && !deduce2 && !better2)
10553 if (deduce2 && !deduce1 && !better1)
10556 args1 = TREE_CHAIN (args1);
10557 args2 = TREE_CHAIN (args2);
10560 processing_template_decl--;
10562 return (better1 > 0) - (better2 > 0);
10565 /* Given two class template specialization list nodes PAT1 and PAT2, return:
10567 1 if PAT1 is more specialized than PAT2 as described in [temp.class.order].
10568 -1 if PAT2 is more specialized than PAT1.
10569 0 if neither is more specialized.
10571 FULL_ARGS is the full set of template arguments that triggers this
10572 partial ordering. */
10575 more_specialized_class (tree pat1, tree pat2, tree full_args)
10580 /* Just like what happens for functions, if we are ordering between
10581 different class template specializations, we may encounter dependent
10582 types in the arguments, and we need our dependency check functions
10583 to behave correctly. */
10584 ++processing_template_decl;
10585 targs = get_class_bindings (TREE_VALUE (pat1), TREE_PURPOSE (pat1),
10586 add_outermost_template_args (full_args, TREE_PURPOSE (pat2)));
10590 targs = get_class_bindings (TREE_VALUE (pat2), TREE_PURPOSE (pat2),
10591 add_outermost_template_args (full_args, TREE_PURPOSE (pat1)));
10594 --processing_template_decl;
10599 /* Return the template arguments that will produce the function signature
10600 DECL from the function template FN, with the explicit template
10601 arguments EXPLICIT_ARGS. If CHECK_RETTYPE is true, the return type must
10602 also match. Return NULL_TREE if no satisfactory arguments could be
10606 get_bindings (tree fn, tree decl, tree explicit_args, bool check_rettype)
10608 int ntparms = DECL_NTPARMS (fn);
10609 tree targs = make_tree_vec (ntparms);
10611 tree decl_arg_types;
10613 /* Substitute the explicit template arguments into the type of DECL.
10614 The call to fn_type_unification will handle substitution into the
10616 decl_type = TREE_TYPE (decl);
10617 if (explicit_args && uses_template_parms (decl_type))
10620 tree converted_args;
10622 if (DECL_TEMPLATE_INFO (decl))
10623 tmpl = DECL_TI_TEMPLATE (decl);
10625 /* We can get here for some invalid specializations. */
10629 = (coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl),
10630 explicit_args, NULL_TREE,
10631 tf_none, /*require_all_arguments=*/0));
10632 if (converted_args == error_mark_node)
10635 decl_type = tsubst (decl_type, converted_args, tf_none, NULL_TREE);
10636 if (decl_type == error_mark_node)
10640 decl_arg_types = TYPE_ARG_TYPES (decl_type);
10641 /* Never do unification on the 'this' parameter. */
10642 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl))
10643 decl_arg_types = TREE_CHAIN (decl_arg_types);
10645 if (fn_type_unification (fn, explicit_args, targs,
10647 (check_rettype || DECL_CONV_FN_P (fn)
10648 ? TREE_TYPE (decl_type) : NULL_TREE),
10655 /* Return the innermost template arguments that, when applied to a
10656 template specialization whose innermost template parameters are
10657 TPARMS, and whose specialization arguments are PARMS, yield the
10660 For example, suppose we have:
10662 template <class T, class U> struct S {};
10663 template <class T> struct S<T*, int> {};
10665 Then, suppose we want to get `S<double*, int>'. The TPARMS will be
10666 {T}, the PARMS will be {T*, int} and the ARGS will be {double*,
10667 int}. The resulting vector will be {double}, indicating that `T'
10668 is bound to `double'. */
10671 get_class_bindings (tree tparms, tree parms, tree args)
10673 int i, ntparms = TREE_VEC_LENGTH (tparms);
10674 tree vec = make_tree_vec (ntparms);
10676 if (unify (tparms, vec, parms, INNERMOST_TEMPLATE_ARGS (args),
10680 for (i = 0; i < ntparms; ++i)
10681 if (! TREE_VEC_ELT (vec, i))
10684 if (verify_class_unification (vec, parms, args))
10690 /* In INSTANTIATIONS is a list of <INSTANTIATION, TEMPLATE> pairs.
10691 Pick the most specialized template, and return the corresponding
10692 instantiation, or if there is no corresponding instantiation, the
10693 template itself. If there is no most specialized template,
10694 error_mark_node is returned. If there are no templates at all,
10695 NULL_TREE is returned. */
10698 most_specialized_instantiation (tree instantiations)
10702 if (!instantiations)
10705 ++processing_template_decl;
10707 champ = instantiations;
10708 for (fn = TREE_CHAIN (instantiations); fn; fn = TREE_CHAIN (fn))
10712 if (get_bindings (TREE_VALUE (champ),
10713 DECL_TEMPLATE_RESULT (TREE_VALUE (fn)),
10714 NULL_TREE, /*check_ret=*/false))
10717 if (get_bindings (TREE_VALUE (fn),
10718 DECL_TEMPLATE_RESULT (TREE_VALUE (champ)),
10719 NULL_TREE, /*check_ret=*/false))
10725 /* Equally specialized, move to next function. If there
10726 is no next function, nothing's most specialized. */
10727 fn = TREE_CHAIN (fn);
10733 /* Now verify that champ is better than everything earlier in the
10734 instantiation list. */
10735 for (fn = instantiations; fn != champ; fn = TREE_CHAIN (fn))
10736 if (get_bindings (TREE_VALUE (champ),
10737 DECL_TEMPLATE_RESULT (TREE_VALUE (fn)),
10738 NULL_TREE, /*check_ret=*/false)
10739 || !get_bindings (TREE_VALUE (fn),
10740 DECL_TEMPLATE_RESULT (TREE_VALUE (champ)),
10741 NULL_TREE, /*check_ret=*/false))
10747 processing_template_decl--;
10750 return error_mark_node;
10752 return TREE_PURPOSE (champ) ? TREE_PURPOSE (champ) : TREE_VALUE (champ);
10755 /* Return the most specialized of the list of templates in FNS that can
10756 produce an instantiation matching DECL, given the explicit template
10757 arguments EXPLICIT_ARGS. */
10760 most_specialized (tree fns, tree decl, tree explicit_args)
10762 tree candidates = NULL_TREE;
10765 for (fn = fns; fn; fn = TREE_CHAIN (fn))
10767 tree candidate = TREE_VALUE (fn);
10769 args = get_bindings (candidate, decl, explicit_args, /*check_ret=*/true);
10771 candidates = tree_cons (NULL_TREE, candidate, candidates);
10774 return most_specialized_instantiation (candidates);
10777 /* If DECL is a specialization of some template, return the most
10778 general such template. Otherwise, returns NULL_TREE.
10780 For example, given:
10782 template <class T> struct S { template <class U> void f(U); };
10784 if TMPL is `template <class U> void S<int>::f(U)' this will return
10785 the full template. This function will not trace past partial
10786 specializations, however. For example, given in addition:
10788 template <class T> struct S<T*> { template <class U> void f(U); };
10790 if TMPL is `template <class U> void S<int*>::f(U)' this will return
10791 `template <class T> template <class U> S<T*>::f(U)'. */
10794 most_general_template (tree decl)
10796 /* If DECL is a FUNCTION_DECL, find the TEMPLATE_DECL of which it is
10797 an immediate specialization. */
10798 if (TREE_CODE (decl) == FUNCTION_DECL)
10800 if (DECL_TEMPLATE_INFO (decl)) {
10801 decl = DECL_TI_TEMPLATE (decl);
10803 /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE for a
10804 template friend. */
10805 if (TREE_CODE (decl) != TEMPLATE_DECL)
10811 /* Look for more and more general templates. */
10812 while (DECL_TEMPLATE_INFO (decl))
10814 /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE in some cases.
10815 (See cp-tree.h for details.) */
10816 if (TREE_CODE (DECL_TI_TEMPLATE (decl)) != TEMPLATE_DECL)
10819 if (CLASS_TYPE_P (TREE_TYPE (decl))
10820 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl)))
10823 /* Stop if we run into an explicitly specialized class template. */
10824 if (!DECL_NAMESPACE_SCOPE_P (decl)
10825 && DECL_CONTEXT (decl)
10826 && CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (decl)))
10829 decl = DECL_TI_TEMPLATE (decl);
10835 /* Return the most specialized of the class template specializations
10836 of TMPL which can produce an instantiation matching ARGS, or
10837 error_mark_node if the choice is ambiguous. */
10840 most_specialized_class (tree tmpl, tree args)
10842 tree list = NULL_TREE;
10847 tmpl = most_general_template (tmpl);
10848 for (t = DECL_TEMPLATE_SPECIALIZATIONS (tmpl); t; t = TREE_CHAIN (t))
10851 = get_class_bindings (TREE_VALUE (t), TREE_PURPOSE (t), args);
10854 list = tree_cons (TREE_PURPOSE (t), TREE_VALUE (t), list);
10855 TREE_TYPE (list) = TREE_TYPE (t);
10864 t = TREE_CHAIN (t);
10865 for (; t; t = TREE_CHAIN (t))
10867 fate = more_specialized_class (champ, t, args);
10874 t = TREE_CHAIN (t);
10876 return error_mark_node;
10882 for (t = list; t && t != champ; t = TREE_CHAIN (t))
10884 fate = more_specialized_class (champ, t, args);
10886 return error_mark_node;
10892 /* Explicitly instantiate DECL. */
10895 do_decl_instantiation (tree decl, tree storage)
10897 tree result = NULL_TREE;
10901 /* An error occurred, for which grokdeclarator has already issued
10902 an appropriate message. */
10904 else if (! DECL_LANG_SPECIFIC (decl))
10906 error ("explicit instantiation of non-template %q#D", decl);
10909 else if (TREE_CODE (decl) == VAR_DECL)
10911 /* There is an asymmetry here in the way VAR_DECLs and
10912 FUNCTION_DECLs are handled by grokdeclarator. In the case of
10913 the latter, the DECL we get back will be marked as a
10914 template instantiation, and the appropriate
10915 DECL_TEMPLATE_INFO will be set up. This does not happen for
10916 VAR_DECLs so we do the lookup here. Probably, grokdeclarator
10917 should handle VAR_DECLs as it currently handles
10919 result = lookup_field (DECL_CONTEXT (decl), DECL_NAME (decl), 0, false);
10920 if (!result || TREE_CODE (result) != VAR_DECL)
10922 error ("no matching template for %qD found", decl);
10926 else if (TREE_CODE (decl) != FUNCTION_DECL)
10928 error ("explicit instantiation of %q#D", decl);
10934 /* Check for various error cases. Note that if the explicit
10935 instantiation is valid the RESULT will currently be marked as an
10936 *implicit* instantiation; DECL_EXPLICIT_INSTANTIATION is not set
10937 until we get here. */
10939 if (DECL_TEMPLATE_SPECIALIZATION (result))
10941 /* DR 259 [temp.spec].
10943 Both an explicit instantiation and a declaration of an explicit
10944 specialization shall not appear in a program unless the explicit
10945 instantiation follows a declaration of the explicit specialization.
10947 For a given set of template parameters, if an explicit
10948 instantiation of a template appears after a declaration of an
10949 explicit specialization for that template, the explicit
10950 instantiation has no effect. */
10953 else if (DECL_EXPLICIT_INSTANTIATION (result))
10957 No program shall explicitly instantiate any template more
10960 We check DECL_NOT_REALLY_EXTERN so as not to complain when
10961 the first instantiation was `extern' and the second is not,
10962 and EXTERN_P for the opposite case. */
10963 if (DECL_NOT_REALLY_EXTERN (result) && !extern_p)
10964 pedwarn ("duplicate explicit instantiation of %q#D", result);
10965 /* If an "extern" explicit instantiation follows an ordinary
10966 explicit instantiation, the template is instantiated. */
10970 else if (!DECL_IMPLICIT_INSTANTIATION (result))
10972 error ("no matching template for %qD found", result);
10975 else if (!DECL_TEMPLATE_INFO (result))
10977 pedwarn ("explicit instantiation of non-template %q#D", result);
10981 if (storage == NULL_TREE)
10983 else if (storage == ridpointers[(int) RID_EXTERN])
10985 if (pedantic && !in_system_header)
10986 pedwarn ("ISO C++ forbids the use of %<extern%> on explicit "
10991 error ("storage class %qD applied to template instantiation", storage);
10993 mark_decl_instantiated (result, extern_p);
10995 instantiate_decl (result, /*defer_ok=*/1, /*undefined_ok=*/0);
10999 mark_class_instantiated (tree t, int extern_p)
11001 SET_CLASSTYPE_EXPLICIT_INSTANTIATION (t);
11002 SET_CLASSTYPE_INTERFACE_KNOWN (t);
11003 CLASSTYPE_INTERFACE_ONLY (t) = extern_p;
11004 TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (t)) = extern_p;
11007 CLASSTYPE_DEBUG_REQUESTED (t) = 1;
11008 rest_of_type_compilation (t, 1);
11012 /* Called from do_type_instantiation through binding_table_foreach to
11013 do recursive instantiation for the type bound in ENTRY. */
11015 bt_instantiate_type_proc (binding_entry entry, void *data)
11017 tree storage = *(tree *) data;
11019 if (IS_AGGR_TYPE (entry->type)
11020 && !uses_template_parms (CLASSTYPE_TI_ARGS (entry->type)))
11021 do_type_instantiation (TYPE_MAIN_DECL (entry->type), storage, 0);
11024 /* Called from do_type_instantiation to instantiate a member
11025 (a member function or a static member variable) of an
11026 explicitly instantiated class template. */
11028 instantiate_class_member (tree decl, int extern_p)
11030 mark_decl_instantiated (decl, extern_p);
11032 instantiate_decl (decl, /*defer_ok=*/1, /* undefined_ok=*/1);
11035 /* Perform an explicit instantiation of template class T. STORAGE, if
11036 non-null, is the RID for extern, inline or static. COMPLAIN is
11037 nonzero if this is called from the parser, zero if called recursively,
11038 since the standard is unclear (as detailed below). */
11041 do_type_instantiation (tree t, tree storage, tsubst_flags_t complain)
11046 int previous_instantiation_extern_p = 0;
11048 if (TREE_CODE (t) == TYPE_DECL)
11051 if (! CLASS_TYPE_P (t) || ! CLASSTYPE_TEMPLATE_INFO (t))
11053 error ("explicit instantiation of non-template type %qT", t);
11059 if (!COMPLETE_TYPE_P (t))
11061 if (complain & tf_error)
11062 error ("explicit instantiation of %q#T before definition of template",
11067 if (storage != NULL_TREE)
11069 if (pedantic && !in_system_header)
11070 pedwarn("ISO C++ forbids the use of %qE on explicit instantiations",
11073 if (storage == ridpointers[(int) RID_INLINE])
11075 else if (storage == ridpointers[(int) RID_EXTERN])
11077 else if (storage == ridpointers[(int) RID_STATIC])
11081 error ("storage class %qD applied to template instantiation",
11087 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (t))
11089 /* DR 259 [temp.spec].
11091 Both an explicit instantiation and a declaration of an explicit
11092 specialization shall not appear in a program unless the explicit
11093 instantiation follows a declaration of the explicit specialization.
11095 For a given set of template parameters, if an explicit
11096 instantiation of a template appears after a declaration of an
11097 explicit specialization for that template, the explicit
11098 instantiation has no effect. */
11101 else if (CLASSTYPE_EXPLICIT_INSTANTIATION (t))
11105 No program shall explicitly instantiate any template more
11108 If PREVIOUS_INSTANTIATION_EXTERN_P, then the first explicit
11109 instantiation was `extern'. If EXTERN_P then the second is.
11110 These cases are OK. */
11111 previous_instantiation_extern_p = CLASSTYPE_INTERFACE_ONLY (t);
11113 if (!previous_instantiation_extern_p && !extern_p
11114 && (complain & tf_error))
11115 pedwarn ("duplicate explicit instantiation of %q#T", t);
11117 /* If we've already instantiated the template, just return now. */
11118 if (!CLASSTYPE_INTERFACE_ONLY (t))
11122 mark_class_instantiated (t, extern_p);
11130 /* In contrast to implicit instantiation, where only the
11131 declarations, and not the definitions, of members are
11132 instantiated, we have here:
11136 The explicit instantiation of a class template specialization
11137 implies the instantiation of all of its members not
11138 previously explicitly specialized in the translation unit
11139 containing the explicit instantiation.
11141 Of course, we can't instantiate member template classes, since
11142 we don't have any arguments for them. Note that the standard
11143 is unclear on whether the instantiation of the members are
11144 *explicit* instantiations or not. However, the most natural
11145 interpretation is that it should be an explicit instantiation. */
11148 for (tmp = TYPE_METHODS (t); tmp; tmp = TREE_CHAIN (tmp))
11149 if (TREE_CODE (tmp) == FUNCTION_DECL
11150 && DECL_TEMPLATE_INSTANTIATION (tmp))
11151 instantiate_class_member (tmp, extern_p);
11153 for (tmp = TYPE_FIELDS (t); tmp; tmp = TREE_CHAIN (tmp))
11154 if (TREE_CODE (tmp) == VAR_DECL && DECL_TEMPLATE_INSTANTIATION (tmp))
11155 instantiate_class_member (tmp, extern_p);
11157 if (CLASSTYPE_NESTED_UTDS (t))
11158 binding_table_foreach (CLASSTYPE_NESTED_UTDS (t),
11159 bt_instantiate_type_proc, &storage);
11163 /* Given a function DECL, which is a specialization of TMPL, modify
11164 DECL to be a re-instantiation of TMPL with the same template
11165 arguments. TMPL should be the template into which tsubst'ing
11166 should occur for DECL, not the most general template.
11168 One reason for doing this is a scenario like this:
11171 void f(const T&, int i);
11173 void g() { f(3, 7); }
11176 void f(const T& t, const int i) { }
11178 Note that when the template is first instantiated, with
11179 instantiate_template, the resulting DECL will have no name for the
11180 first parameter, and the wrong type for the second. So, when we go
11181 to instantiate the DECL, we regenerate it. */
11184 regenerate_decl_from_template (tree decl, tree tmpl)
11186 /* The arguments used to instantiate DECL, from the most general
11191 args = DECL_TI_ARGS (decl);
11192 code_pattern = DECL_TEMPLATE_RESULT (tmpl);
11194 /* Make sure that we can see identifiers, and compute access
11196 push_access_scope (decl);
11198 if (TREE_CODE (decl) == FUNCTION_DECL)
11206 args_depth = TMPL_ARGS_DEPTH (args);
11207 parms_depth = TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl));
11208 if (args_depth > parms_depth)
11209 args = get_innermost_template_args (args, parms_depth);
11211 specs = tsubst_exception_specification (TREE_TYPE (code_pattern),
11212 args, tf_error, NULL_TREE);
11214 TREE_TYPE (decl) = build_exception_variant (TREE_TYPE (decl),
11217 /* Merge parameter declarations. */
11218 decl_parm = skip_artificial_parms_for (decl,
11219 DECL_ARGUMENTS (decl));
11221 = skip_artificial_parms_for (code_pattern,
11222 DECL_ARGUMENTS (code_pattern));
11228 if (DECL_NAME (decl_parm) != DECL_NAME (pattern_parm))
11229 DECL_NAME (decl_parm) = DECL_NAME (pattern_parm);
11230 parm_type = tsubst (TREE_TYPE (pattern_parm), args, tf_error,
11232 parm_type = type_decays_to (parm_type);
11233 if (!same_type_p (TREE_TYPE (decl_parm), parm_type))
11234 TREE_TYPE (decl_parm) = parm_type;
11235 attributes = DECL_ATTRIBUTES (pattern_parm);
11236 if (DECL_ATTRIBUTES (decl_parm) != attributes)
11238 DECL_ATTRIBUTES (decl_parm) = attributes;
11239 cplus_decl_attributes (&decl_parm, attributes, /*flags=*/0);
11241 decl_parm = TREE_CHAIN (decl_parm);
11242 pattern_parm = TREE_CHAIN (pattern_parm);
11245 /* Merge additional specifiers from the CODE_PATTERN. */
11246 if (DECL_DECLARED_INLINE_P (code_pattern)
11247 && !DECL_DECLARED_INLINE_P (decl))
11248 DECL_DECLARED_INLINE_P (decl) = 1;
11249 if (DECL_INLINE (code_pattern) && !DECL_INLINE (decl))
11250 DECL_INLINE (decl) = 1;
11252 else if (TREE_CODE (decl) == VAR_DECL)
11254 if (!DECL_INITIALIZED_IN_CLASS_P (decl)
11255 && DECL_INITIAL (code_pattern))
11256 DECL_INITIAL (decl) =
11257 tsubst_expr (DECL_INITIAL (code_pattern), args,
11258 tf_error, DECL_TI_TEMPLATE (decl));
11261 gcc_unreachable ();
11263 pop_access_scope (decl);
11266 /* Return the TEMPLATE_DECL into which DECL_TI_ARGS(DECL) should be
11267 substituted to get DECL. */
11270 template_for_substitution (tree decl)
11272 tree tmpl = DECL_TI_TEMPLATE (decl);
11274 /* Set TMPL to the template whose DECL_TEMPLATE_RESULT is the pattern
11275 for the instantiation. This is not always the most general
11276 template. Consider, for example:
11279 struct S { template <class U> void f();
11280 template <> void f<int>(); };
11282 and an instantiation of S<double>::f<int>. We want TD to be the
11283 specialization S<T>::f<int>, not the more general S<T>::f<U>. */
11284 while (/* An instantiation cannot have a definition, so we need a
11285 more general template. */
11286 DECL_TEMPLATE_INSTANTIATION (tmpl)
11287 /* We must also deal with friend templates. Given:
11289 template <class T> struct S {
11290 template <class U> friend void f() {};
11293 S<int>::f<U> say, is not an instantiation of S<T>::f<U>,
11294 so far as the language is concerned, but that's still
11295 where we get the pattern for the instantiation from. On
11296 other hand, if the definition comes outside the class, say:
11298 template <class T> struct S {
11299 template <class U> friend void f();
11301 template <class U> friend void f() {}
11303 we don't need to look any further. That's what the check for
11304 DECL_INITIAL is for. */
11305 || (TREE_CODE (decl) == FUNCTION_DECL
11306 && DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (tmpl)
11307 && !DECL_INITIAL (DECL_TEMPLATE_RESULT (tmpl))))
11309 /* The present template, TD, should not be a definition. If it
11310 were a definition, we should be using it! Note that we
11311 cannot restructure the loop to just keep going until we find
11312 a template with a definition, since that might go too far if
11313 a specialization was declared, but not defined. */
11314 gcc_assert (TREE_CODE (decl) != VAR_DECL
11315 || DECL_IN_AGGR_P (DECL_TEMPLATE_RESULT (tmpl)));
11317 /* Fetch the more general template. */
11318 tmpl = DECL_TI_TEMPLATE (tmpl);
11324 /* Produce the definition of D, a _DECL generated from a template. If
11325 DEFER_OK is nonzero, then we don't have to actually do the
11326 instantiation now; we just have to do it sometime. Normally it is
11327 an error if this is an explicit instantiation but D is undefined.
11328 If UNDEFINED_OK is nonzero, then instead we treat it as an implicit
11329 instantiation. UNDEFINED_OK is nonzero only if we are being used
11330 to instantiate the members of an explicitly instantiated class
11335 instantiate_decl (tree d, int defer_ok, int undefined_ok)
11337 tree tmpl = DECL_TI_TEMPLATE (d);
11344 int pattern_defined;
11346 location_t saved_loc = input_location;
11348 /* This function should only be used to instantiate templates for
11349 functions and static member variables. */
11350 gcc_assert (TREE_CODE (d) == FUNCTION_DECL
11351 || TREE_CODE (d) == VAR_DECL);
11353 /* Variables are never deferred; if instantiation is required, they
11354 are instantiated right away. That allows for better code in the
11355 case that an expression refers to the value of the variable --
11356 if the variable has a constant value the referring expression can
11357 take advantage of that fact. */
11358 if (TREE_CODE (d) == VAR_DECL)
11361 /* Don't instantiate cloned functions. Instead, instantiate the
11362 functions they cloned. */
11363 if (TREE_CODE (d) == FUNCTION_DECL && DECL_CLONED_FUNCTION_P (d))
11364 d = DECL_CLONED_FUNCTION (d);
11366 if (DECL_TEMPLATE_INSTANTIATED (d))
11367 /* D has already been instantiated. It might seem reasonable to
11368 check whether or not D is an explicit instantiation, and, if so,
11369 stop here. But when an explicit instantiation is deferred
11370 until the end of the compilation, DECL_EXPLICIT_INSTANTIATION
11371 is set, even though we still need to do the instantiation. */
11374 /* If we already have a specialization of this declaration, then
11375 there's no reason to instantiate it. Note that
11376 retrieve_specialization gives us both instantiations and
11377 specializations, so we must explicitly check
11378 DECL_TEMPLATE_SPECIALIZATION. */
11379 gen_tmpl = most_general_template (tmpl);
11380 gen_args = DECL_TI_ARGS (d);
11381 spec = retrieve_specialization (gen_tmpl, gen_args,
11382 /*class_specializations_p=*/false);
11383 if (spec != NULL_TREE && DECL_TEMPLATE_SPECIALIZATION (spec))
11386 /* This needs to happen before any tsubsting. */
11387 if (! push_tinst_level (d))
11390 timevar_push (TV_PARSE);
11392 /* We may be in the middle of deferred access check. Disable it now. */
11393 push_deferring_access_checks (dk_no_deferred);
11395 /* Set TD to the template whose DECL_TEMPLATE_RESULT is the pattern
11396 for the instantiation. */
11397 td = template_for_substitution (d);
11398 code_pattern = DECL_TEMPLATE_RESULT (td);
11400 if ((DECL_NAMESPACE_SCOPE_P (d) && !DECL_INITIALIZED_IN_CLASS_P (d))
11401 || DECL_TEMPLATE_SPECIALIZATION (td))
11402 /* In the case of a friend template whose definition is provided
11403 outside the class, we may have too many arguments. Drop the
11404 ones we don't need. The same is true for specializations. */
11405 args = get_innermost_template_args
11406 (gen_args, TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (td)));
11410 if (TREE_CODE (d) == FUNCTION_DECL)
11411 pattern_defined = (DECL_SAVED_TREE (code_pattern) != NULL_TREE);
11413 pattern_defined = ! DECL_IN_AGGR_P (code_pattern);
11414 /* Unless an explicit instantiation directive has already determined
11415 the linkage of D, remember that a definition is available for
11417 if (pattern_defined
11418 && !DECL_INTERFACE_KNOWN (d)
11419 && !DECL_NOT_REALLY_EXTERN (d))
11420 mark_definable (d);
11422 input_location = DECL_SOURCE_LOCATION (d);
11424 if (! pattern_defined && DECL_EXPLICIT_INSTANTIATION (d) && undefined_ok)
11426 DECL_NOT_REALLY_EXTERN (d) = 0;
11427 SET_DECL_IMPLICIT_INSTANTIATION (d);
11432 /* Recheck the substitutions to obtain any warning messages
11433 about ignoring cv qualifiers. */
11434 tree gen = DECL_TEMPLATE_RESULT (gen_tmpl);
11435 tree type = TREE_TYPE (gen);
11437 /* Make sure that we can see identifiers, and compute access
11438 correctly. D is already the target FUNCTION_DECL with the
11440 push_access_scope (d);
11442 if (TREE_CODE (gen) == FUNCTION_DECL)
11444 tsubst (DECL_ARGUMENTS (gen), gen_args, tf_error | tf_warning, d);
11445 tsubst (TYPE_RAISES_EXCEPTIONS (type), gen_args,
11446 tf_error | tf_warning, d);
11447 /* Don't simply tsubst the function type, as that will give
11448 duplicate warnings about poor parameter qualifications.
11449 The function arguments are the same as the decl_arguments
11450 without the top level cv qualifiers. */
11451 type = TREE_TYPE (type);
11453 tsubst (type, gen_args, tf_error | tf_warning, d);
11455 pop_access_scope (d);
11458 /* We should have set up DECL_INITIAL in instantiate_class_template
11459 for in-class definitions of static data members. */
11460 gcc_assert (!(TREE_CODE (d) == VAR_DECL
11461 && DECL_INITIALIZED_IN_CLASS_P (d)
11462 && DECL_INITIAL (d) == NULL_TREE));
11464 /* Do not instantiate templates that we know will be defined
11466 if (DECL_INTERFACE_KNOWN (d)
11467 && DECL_REALLY_EXTERN (d)
11468 && ! (TREE_CODE (d) == FUNCTION_DECL
11469 && DECL_INLINE (d)))
11471 /* Defer all other templates, unless we have been explicitly
11472 forbidden from doing so. We restore the source position here
11473 because it's used by add_pending_template. */
11474 else if (! pattern_defined || defer_ok)
11476 input_location = saved_loc;
11478 if (at_eof && !pattern_defined
11479 && DECL_EXPLICIT_INSTANTIATION (d))
11482 The definition of a non-exported function template, a
11483 non-exported member function template, or a non-exported
11484 member function or static data member of a class template
11485 shall be present in every translation unit in which it is
11486 explicitly instantiated. */
11488 ("explicit instantiation of %qD but no definition available", d);
11490 add_pending_template (d);
11493 /* Tell the repository that D is available in this translation unit
11494 -- and see if it is supposed to be instantiated here. */
11495 if (TREE_PUBLIC (d) && !DECL_REALLY_EXTERN (d) && !repo_emit_p (d))
11497 /* In a PCH file, despite the fact that the repository hasn't
11498 requested instantiation in the PCH it is still possible that
11499 an instantiation will be required in a file that includes the
11502 add_pending_template (d);
11503 /* Instantiate inline functions so that the inliner can do its
11504 job, even though we'll not be emitting a copy of this
11506 if (!(TREE_CODE (d) == FUNCTION_DECL
11507 && flag_inline_trees
11508 && DECL_DECLARED_INLINE_P (d)))
11512 need_push = !cfun || !global_bindings_p ();
11514 push_to_top_level ();
11516 /* Mark D as instantiated so that recursive calls to
11517 instantiate_decl do not try to instantiate it again. */
11518 DECL_TEMPLATE_INSTANTIATED (d) = 1;
11520 /* Regenerate the declaration in case the template has been modified
11521 by a subsequent redeclaration. */
11522 regenerate_decl_from_template (d, td);
11524 /* We already set the file and line above. Reset them now in case
11525 they changed as a result of calling regenerate_decl_from_template. */
11526 input_location = DECL_SOURCE_LOCATION (d);
11528 if (TREE_CODE (d) == VAR_DECL)
11530 /* Clear out DECL_RTL; whatever was there before may not be right
11531 since we've reset the type of the declaration. */
11532 SET_DECL_RTL (d, NULL_RTX);
11533 DECL_IN_AGGR_P (d) = 0;
11535 /* Clear DECL_EXTERNAL so that cp_finish_decl will process the
11536 initializer. That function will defer actual emission until
11537 we have a chance to determine linkage. */
11538 DECL_EXTERNAL (d) = 0;
11540 /* Enter the scope of D so that access-checking works correctly. */
11541 push_nested_class (DECL_CONTEXT (d));
11543 (!DECL_INITIALIZED_IN_CLASS_P (d)
11544 ? DECL_INITIAL (d) : NULL_TREE),
11546 pop_nested_class ();
11548 else if (TREE_CODE (d) == FUNCTION_DECL)
11550 htab_t saved_local_specializations;
11555 /* Save away the current list, in case we are instantiating one
11556 template from within the body of another. */
11557 saved_local_specializations = local_specializations;
11559 /* Set up the list of local specializations. */
11560 local_specializations = htab_create (37,
11561 hash_local_specialization,
11562 eq_local_specializations,
11565 /* Set up context. */
11566 start_preparsed_function (d, NULL_TREE, SF_PRE_PARSED);
11568 /* Create substitution entries for the parameters. */
11569 subst_decl = DECL_TEMPLATE_RESULT (template_for_substitution (d));
11570 tmpl_parm = DECL_ARGUMENTS (subst_decl);
11571 spec_parm = DECL_ARGUMENTS (d);
11572 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (d))
11574 register_local_specialization (spec_parm, tmpl_parm);
11575 spec_parm = skip_artificial_parms_for (d, spec_parm);
11576 tmpl_parm = skip_artificial_parms_for (subst_decl, tmpl_parm);
11580 register_local_specialization (spec_parm, tmpl_parm);
11581 tmpl_parm = TREE_CHAIN (tmpl_parm);
11582 spec_parm = TREE_CHAIN (spec_parm);
11584 gcc_assert (!spec_parm);
11586 /* Substitute into the body of the function. */
11587 tsubst_expr (DECL_SAVED_TREE (code_pattern), args,
11588 tf_error | tf_warning, tmpl);
11590 /* We don't need the local specializations any more. */
11591 htab_delete (local_specializations);
11592 local_specializations = saved_local_specializations;
11594 /* Finish the function. */
11595 d = finish_function (0);
11596 expand_or_defer_fn (d);
11599 /* We're not deferring instantiation any more. */
11600 TI_PENDING_TEMPLATE_FLAG (DECL_TEMPLATE_INFO (d)) = 0;
11603 pop_from_top_level ();
11606 input_location = saved_loc;
11607 pop_deferring_access_checks ();
11608 pop_tinst_level ();
11610 timevar_pop (TV_PARSE);
11615 /* Run through the list of templates that we wish we could
11616 instantiate, and instantiate any we can. RETRIES is the
11617 number of times we retry pending template instantiation. */
11620 instantiate_pending_templates (int retries)
11623 tree last = NULL_TREE;
11625 location_t saved_loc = input_location;
11626 int saved_in_system_header = in_system_header;
11628 /* Instantiating templates may trigger vtable generation. This in turn
11629 may require further template instantiations. We place a limit here
11630 to avoid infinite loop. */
11631 if (pending_templates && retries >= max_tinst_depth)
11633 cp_error_at ("template instantiation depth exceeds maximum of %d"
11634 " (use -ftemplate-depth-NN to increase the maximum)"
11635 " instantiating %q+D, possibly from virtual table"
11637 max_tinst_depth, TREE_VALUE (pending_templates));
11645 t = &pending_templates;
11648 tree instantiation = TREE_VALUE (*t);
11650 reopen_tinst_level (TREE_PURPOSE (*t));
11652 if (TYPE_P (instantiation))
11656 if (!COMPLETE_TYPE_P (instantiation))
11658 instantiate_class_template (instantiation);
11659 if (CLASSTYPE_TEMPLATE_INSTANTIATION (instantiation))
11660 for (fn = TYPE_METHODS (instantiation);
11662 fn = TREE_CHAIN (fn))
11663 if (! DECL_ARTIFICIAL (fn))
11664 instantiate_decl (fn, /*defer_ok=*/0,
11665 /*undefined_ok=*/0);
11666 if (COMPLETE_TYPE_P (instantiation))
11670 if (COMPLETE_TYPE_P (instantiation))
11671 /* If INSTANTIATION has been instantiated, then we don't
11672 need to consider it again in the future. */
11673 *t = TREE_CHAIN (*t);
11677 t = &TREE_CHAIN (*t);
11682 if (!DECL_TEMPLATE_SPECIALIZATION (instantiation)
11683 && !DECL_TEMPLATE_INSTANTIATED (instantiation))
11685 instantiation = instantiate_decl (instantiation,
11687 /*undefined_ok=*/0);
11688 if (DECL_TEMPLATE_INSTANTIATED (instantiation))
11692 if (DECL_TEMPLATE_SPECIALIZATION (instantiation)
11693 || DECL_TEMPLATE_INSTANTIATED (instantiation))
11694 /* If INSTANTIATION has been instantiated, then we don't
11695 need to consider it again in the future. */
11696 *t = TREE_CHAIN (*t);
11700 t = &TREE_CHAIN (*t);
11704 current_tinst_level = NULL_TREE;
11706 last_pending_template = last;
11708 while (reconsider);
11710 input_location = saved_loc;
11711 in_system_header = saved_in_system_header;
11714 /* Substitute ARGVEC into T, which is a list of initializers for
11715 either base class or a non-static data member. The TREE_PURPOSEs
11716 are DECLs, and the TREE_VALUEs are the initializer values. Used by
11717 instantiate_decl. */
11720 tsubst_initializer_list (tree t, tree argvec)
11722 tree inits = NULL_TREE;
11724 for (; t; t = TREE_CHAIN (t))
11729 decl = tsubst_copy (TREE_PURPOSE (t), argvec, tf_error | tf_warning,
11731 decl = expand_member_init (decl);
11732 if (decl && !DECL_P (decl))
11733 in_base_initializer = 1;
11735 init = tsubst_expr (TREE_VALUE (t), argvec, tf_error | tf_warning,
11737 in_base_initializer = 0;
11741 init = build_tree_list (decl, init);
11742 TREE_CHAIN (init) = inits;
11749 /* Set CURRENT_ACCESS_SPECIFIER based on the protection of DECL. */
11752 set_current_access_from_decl (tree decl)
11754 if (TREE_PRIVATE (decl))
11755 current_access_specifier = access_private_node;
11756 else if (TREE_PROTECTED (decl))
11757 current_access_specifier = access_protected_node;
11759 current_access_specifier = access_public_node;
11762 /* Instantiate an enumerated type. TAG is the template type, NEWTAG
11763 is the instantiation (which should have been created with
11764 start_enum) and ARGS are the template arguments to use. */
11767 tsubst_enum (tree tag, tree newtag, tree args)
11771 for (e = TYPE_VALUES (tag); e; e = TREE_CHAIN (e))
11776 decl = TREE_VALUE (e);
11777 /* Note that in a template enum, the TREE_VALUE is the
11778 CONST_DECL, not the corresponding INTEGER_CST. */
11779 value = tsubst_expr (DECL_INITIAL (decl),
11780 args, tf_error | tf_warning,
11783 /* Give this enumeration constant the correct access. */
11784 set_current_access_from_decl (decl);
11786 /* Actually build the enumerator itself. */
11787 build_enumerator (DECL_NAME (decl), value, newtag);
11790 finish_enum (newtag);
11791 DECL_SOURCE_LOCATION (TYPE_NAME (newtag))
11792 = DECL_SOURCE_LOCATION (TYPE_NAME (tag));
11795 /* DECL is a FUNCTION_DECL that is a template specialization. Return
11796 its type -- but without substituting the innermost set of template
11797 arguments. So, innermost set of template parameters will appear in
11801 get_mostly_instantiated_function_type (tree decl)
11809 tmpl = most_general_template (DECL_TI_TEMPLATE (decl));
11810 targs = DECL_TI_ARGS (decl);
11811 tparms = DECL_TEMPLATE_PARMS (tmpl);
11812 parm_depth = TMPL_PARMS_DEPTH (tparms);
11814 /* There should be as many levels of arguments as there are levels
11816 gcc_assert (parm_depth == TMPL_ARGS_DEPTH (targs));
11818 fn_type = TREE_TYPE (tmpl);
11820 if (parm_depth == 1)
11821 /* No substitution is necessary. */
11825 int i, save_access_control;
11828 /* Replace the innermost level of the TARGS with NULL_TREEs to
11829 let tsubst know not to substitute for those parameters. */
11830 partial_args = make_tree_vec (TREE_VEC_LENGTH (targs));
11831 for (i = 1; i < TMPL_ARGS_DEPTH (targs); ++i)
11832 SET_TMPL_ARGS_LEVEL (partial_args, i,
11833 TMPL_ARGS_LEVEL (targs, i));
11834 SET_TMPL_ARGS_LEVEL (partial_args,
11835 TMPL_ARGS_DEPTH (targs),
11836 make_tree_vec (DECL_NTPARMS (tmpl)));
11838 /* Disable access control as this function is used only during
11840 save_access_control = flag_access_control;
11841 flag_access_control = 0;
11843 ++processing_template_decl;
11844 /* Now, do the (partial) substitution to figure out the
11845 appropriate function type. */
11846 fn_type = tsubst (fn_type, partial_args, tf_error, NULL_TREE);
11847 --processing_template_decl;
11849 /* Substitute into the template parameters to obtain the real
11850 innermost set of parameters. This step is important if the
11851 innermost set of template parameters contains value
11852 parameters whose types depend on outer template parameters. */
11853 TREE_VEC_LENGTH (partial_args)--;
11854 tparms = tsubst_template_parms (tparms, partial_args, tf_error);
11856 flag_access_control = save_access_control;
11862 /* Return truthvalue if we're processing a template different from
11863 the last one involved in diagnostics. */
11865 problematic_instantiation_changed (void)
11867 return last_template_error_tick != tinst_level_tick;
11870 /* Remember current template involved in diagnostics. */
11872 record_last_problematic_instantiation (void)
11874 last_template_error_tick = tinst_level_tick;
11878 current_instantiation (void)
11880 return current_tinst_level;
11883 /* [temp.param] Check that template non-type parm TYPE is of an allowable
11884 type. Return zero for ok, nonzero for disallowed. Issue error and
11885 warning messages under control of COMPLAIN. */
11888 invalid_nontype_parm_type_p (tree type, tsubst_flags_t complain)
11890 if (INTEGRAL_TYPE_P (type))
11892 else if (POINTER_TYPE_P (type))
11894 else if (TYPE_PTR_TO_MEMBER_P (type))
11896 else if (TREE_CODE (type) == TEMPLATE_TYPE_PARM)
11898 else if (TREE_CODE (type) == TYPENAME_TYPE)
11901 if (complain & tf_error)
11902 error ("%q#T is not a valid type for a template constant parameter", type);
11906 /* Returns TRUE if TYPE is dependent, in the sense of [temp.dep.type].
11907 Assumes that TYPE really is a type, and not the ERROR_MARK_NODE.*/
11910 dependent_type_p_r (tree type)
11916 A type is dependent if it is:
11918 -- a template parameter. Template template parameters are types
11919 for us (since TYPE_P holds true for them) so we handle
11921 if (TREE_CODE (type) == TEMPLATE_TYPE_PARM
11922 || TREE_CODE (type) == TEMPLATE_TEMPLATE_PARM)
11924 /* -- a qualified-id with a nested-name-specifier which contains a
11925 class-name that names a dependent type or whose unqualified-id
11926 names a dependent type. */
11927 if (TREE_CODE (type) == TYPENAME_TYPE)
11929 /* -- a cv-qualified type where the cv-unqualified type is
11931 type = TYPE_MAIN_VARIANT (type);
11932 /* -- a compound type constructed from any dependent type. */
11933 if (TYPE_PTR_TO_MEMBER_P (type))
11934 return (dependent_type_p (TYPE_PTRMEM_CLASS_TYPE (type))
11935 || dependent_type_p (TYPE_PTRMEM_POINTED_TO_TYPE
11937 else if (TREE_CODE (type) == POINTER_TYPE
11938 || TREE_CODE (type) == REFERENCE_TYPE)
11939 return dependent_type_p (TREE_TYPE (type));
11940 else if (TREE_CODE (type) == FUNCTION_TYPE
11941 || TREE_CODE (type) == METHOD_TYPE)
11945 if (dependent_type_p (TREE_TYPE (type)))
11947 for (arg_type = TYPE_ARG_TYPES (type);
11949 arg_type = TREE_CHAIN (arg_type))
11950 if (dependent_type_p (TREE_VALUE (arg_type)))
11954 /* -- an array type constructed from any dependent type or whose
11955 size is specified by a constant expression that is
11956 value-dependent. */
11957 if (TREE_CODE (type) == ARRAY_TYPE)
11959 if (TYPE_DOMAIN (type)
11960 && ((value_dependent_expression_p
11961 (TYPE_MAX_VALUE (TYPE_DOMAIN (type))))
11962 || (type_dependent_expression_p
11963 (TYPE_MAX_VALUE (TYPE_DOMAIN (type))))))
11965 return dependent_type_p (TREE_TYPE (type));
11968 /* -- a template-id in which either the template name is a template
11970 if (TREE_CODE (type) == BOUND_TEMPLATE_TEMPLATE_PARM)
11972 /* ... or any of the template arguments is a dependent type or
11973 an expression that is type-dependent or value-dependent. */
11974 else if (CLASS_TYPE_P (type) && CLASSTYPE_TEMPLATE_INFO (type)
11975 && (any_dependent_template_arguments_p
11976 (INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type)))))
11979 /* All TYPEOF_TYPEs are dependent; if the argument of the `typeof'
11980 expression is not type-dependent, then it should already been
11982 if (TREE_CODE (type) == TYPEOF_TYPE)
11985 /* The standard does not specifically mention types that are local
11986 to template functions or local classes, but they should be
11987 considered dependent too. For example:
11989 template <int I> void f() {
11994 The size of `E' cannot be known until the value of `I' has been
11995 determined. Therefore, `E' must be considered dependent. */
11996 scope = TYPE_CONTEXT (type);
11997 if (scope && TYPE_P (scope))
11998 return dependent_type_p (scope);
11999 else if (scope && TREE_CODE (scope) == FUNCTION_DECL)
12000 return type_dependent_expression_p (scope);
12002 /* Other types are non-dependent. */
12006 /* Returns TRUE if TYPE is dependent, in the sense of
12007 [temp.dep.type]. */
12010 dependent_type_p (tree type)
12012 /* If there are no template parameters in scope, then there can't be
12013 any dependent types. */
12014 if (!processing_template_decl)
12017 /* If the type is NULL, we have not computed a type for the entity
12018 in question; in that case, the type is dependent. */
12022 /* Erroneous types can be considered non-dependent. */
12023 if (type == error_mark_node)
12026 /* If we have not already computed the appropriate value for TYPE,
12028 if (!TYPE_DEPENDENT_P_VALID (type))
12030 TYPE_DEPENDENT_P (type) = dependent_type_p_r (type);
12031 TYPE_DEPENDENT_P_VALID (type) = 1;
12034 return TYPE_DEPENDENT_P (type);
12037 /* Returns TRUE if EXPRESSION is dependent, according to CRITERION. */
12040 dependent_scope_ref_p (tree expression, bool criterion (tree))
12045 gcc_assert (TREE_CODE (expression) == SCOPE_REF);
12047 if (!TYPE_P (TREE_OPERAND (expression, 0)))
12050 scope = TREE_OPERAND (expression, 0);
12051 name = TREE_OPERAND (expression, 1);
12055 An id-expression is type-dependent if it contains a
12056 nested-name-specifier that contains a class-name that names a
12058 /* The suggested resolution to Core Issue 2 implies that if the
12059 qualifying type is the current class, then we must peek
12062 && currently_open_class (scope)
12063 && !criterion (name))
12065 if (dependent_type_p (scope))
12071 /* Returns TRUE if the EXPRESSION is value-dependent, in the sense of
12072 [temp.dep.constexpr] */
12075 value_dependent_expression_p (tree expression)
12077 if (!processing_template_decl)
12080 /* A name declared with a dependent type. */
12081 if (DECL_P (expression) && type_dependent_expression_p (expression))
12084 switch (TREE_CODE (expression))
12086 case IDENTIFIER_NODE:
12087 /* A name that has not been looked up -- must be dependent. */
12090 case TEMPLATE_PARM_INDEX:
12091 /* A non-type template parm. */
12095 /* A non-type template parm. */
12096 if (DECL_TEMPLATE_PARM_P (expression))
12101 /* A constant with integral or enumeration type and is initialized
12102 with an expression that is value-dependent. */
12103 if (DECL_INITIAL (expression)
12104 && INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (expression))
12105 && value_dependent_expression_p (DECL_INITIAL (expression)))
12109 case DYNAMIC_CAST_EXPR:
12110 case STATIC_CAST_EXPR:
12111 case CONST_CAST_EXPR:
12112 case REINTERPRET_CAST_EXPR:
12114 /* These expressions are value-dependent if the type to which
12115 the cast occurs is dependent or the expression being casted
12116 is value-dependent. */
12118 tree type = TREE_TYPE (expression);
12120 if (dependent_type_p (type))
12123 /* A functional cast has a list of operands. */
12124 expression = TREE_OPERAND (expression, 0);
12127 /* If there are no operands, it must be an expression such
12128 as "int()". This should not happen for aggregate types
12129 because it would form non-constant expressions. */
12130 gcc_assert (INTEGRAL_OR_ENUMERATION_TYPE_P (type));
12135 if (TREE_CODE (expression) == TREE_LIST)
12137 for (; expression; expression = TREE_CHAIN (expression))
12138 if (value_dependent_expression_p (TREE_VALUE (expression)))
12143 return value_dependent_expression_p (expression);
12148 /* A `sizeof' expression is value-dependent if the operand is
12150 expression = TREE_OPERAND (expression, 0);
12151 if (TYPE_P (expression))
12152 return dependent_type_p (expression);
12153 return type_dependent_expression_p (expression);
12156 return dependent_scope_ref_p (expression, value_dependent_expression_p);
12158 case COMPONENT_REF:
12159 return (value_dependent_expression_p (TREE_OPERAND (expression, 0))
12160 || value_dependent_expression_p (TREE_OPERAND (expression, 1)));
12163 /* A CALL_EXPR is value-dependent if any argument is
12164 value-dependent. Why do we have to handle CALL_EXPRs in this
12165 function at all? First, some function calls, those for which
12166 value_dependent_expression_p is true, man appear in constant
12167 expressions. Second, there appear to be bugs which result in
12168 other CALL_EXPRs reaching this point. */
12170 tree function = TREE_OPERAND (expression, 0);
12171 tree args = TREE_OPERAND (expression, 1);
12173 if (value_dependent_expression_p (function))
12179 if (TREE_CODE (args) == TREE_LIST)
12181 for (; args; args = TREE_CHAIN (args))
12182 if (value_dependent_expression_p (TREE_VALUE (args)))
12187 return value_dependent_expression_p (args);
12191 /* A constant expression is value-dependent if any subexpression is
12192 value-dependent. */
12193 switch (TREE_CODE_CLASS (TREE_CODE (expression)))
12195 case tcc_reference:
12197 return (value_dependent_expression_p
12198 (TREE_OPERAND (expression, 0)));
12200 case tcc_comparison:
12202 return ((value_dependent_expression_p
12203 (TREE_OPERAND (expression, 0)))
12204 || (value_dependent_expression_p
12205 (TREE_OPERAND (expression, 1))));
12207 case tcc_expression:
12210 for (i = 0; i < TREE_CODE_LENGTH (TREE_CODE (expression)); ++i)
12211 /* In some cases, some of the operands may be missing.
12212 (For example, in the case of PREDECREMENT_EXPR, the
12213 amount to increment by may be missing.) That doesn't
12214 make the expression dependent. */
12215 if (TREE_OPERAND (expression, i)
12216 && (value_dependent_expression_p
12217 (TREE_OPERAND (expression, i))))
12227 /* The expression is not value-dependent. */
12231 /* Returns TRUE if the EXPRESSION is type-dependent, in the sense of
12232 [temp.dep.expr]. */
12235 type_dependent_expression_p (tree expression)
12237 if (!processing_template_decl)
12240 if (expression == error_mark_node)
12243 /* An unresolved name is always dependent. */
12244 if (TREE_CODE (expression) == IDENTIFIER_NODE)
12247 /* Some expression forms are never type-dependent. */
12248 if (TREE_CODE (expression) == PSEUDO_DTOR_EXPR
12249 || TREE_CODE (expression) == SIZEOF_EXPR
12250 || TREE_CODE (expression) == ALIGNOF_EXPR
12251 || TREE_CODE (expression) == TYPEID_EXPR
12252 || TREE_CODE (expression) == DELETE_EXPR
12253 || TREE_CODE (expression) == VEC_DELETE_EXPR
12254 || TREE_CODE (expression) == THROW_EXPR)
12257 /* The types of these expressions depends only on the type to which
12258 the cast occurs. */
12259 if (TREE_CODE (expression) == DYNAMIC_CAST_EXPR
12260 || TREE_CODE (expression) == STATIC_CAST_EXPR
12261 || TREE_CODE (expression) == CONST_CAST_EXPR
12262 || TREE_CODE (expression) == REINTERPRET_CAST_EXPR
12263 || TREE_CODE (expression) == CAST_EXPR)
12264 return dependent_type_p (TREE_TYPE (expression));
12266 /* The types of these expressions depends only on the type created
12267 by the expression. */
12268 if (TREE_CODE (expression) == NEW_EXPR
12269 || TREE_CODE (expression) == VEC_NEW_EXPR)
12271 /* For NEW_EXPR tree nodes created inside a template, either
12272 the object type itself or a TREE_LIST may appear as the
12274 tree type = TREE_OPERAND (expression, 1);
12275 if (TREE_CODE (type) == TREE_LIST)
12276 /* This is an array type. We need to check array dimensions
12278 return dependent_type_p (TREE_VALUE (TREE_PURPOSE (type)))
12279 || value_dependent_expression_p
12280 (TREE_OPERAND (TREE_VALUE (type), 1));
12282 return dependent_type_p (type);
12285 if (TREE_CODE (expression) == SCOPE_REF
12286 && dependent_scope_ref_p (expression,
12287 type_dependent_expression_p))
12290 if (TREE_CODE (expression) == FUNCTION_DECL
12291 && DECL_LANG_SPECIFIC (expression)
12292 && DECL_TEMPLATE_INFO (expression)
12293 && (any_dependent_template_arguments_p
12294 (INNERMOST_TEMPLATE_ARGS (DECL_TI_ARGS (expression)))))
12297 if (TREE_CODE (expression) == TEMPLATE_DECL
12298 && !DECL_TEMPLATE_TEMPLATE_PARM_P (expression))
12301 if (TREE_TYPE (expression) == unknown_type_node)
12303 if (TREE_CODE (expression) == ADDR_EXPR)
12304 return type_dependent_expression_p (TREE_OPERAND (expression, 0));
12305 if (TREE_CODE (expression) == COMPONENT_REF
12306 || TREE_CODE (expression) == OFFSET_REF)
12308 if (type_dependent_expression_p (TREE_OPERAND (expression, 0)))
12310 expression = TREE_OPERAND (expression, 1);
12311 if (TREE_CODE (expression) == IDENTIFIER_NODE)
12314 /* SCOPE_REF with non-null TREE_TYPE is always non-dependent. */
12315 if (TREE_CODE (expression) == SCOPE_REF)
12318 if (TREE_CODE (expression) == BASELINK)
12319 expression = BASELINK_FUNCTIONS (expression);
12321 if (TREE_CODE (expression) == TEMPLATE_ID_EXPR)
12323 if (any_dependent_template_arguments_p
12324 (TREE_OPERAND (expression, 1)))
12326 expression = TREE_OPERAND (expression, 0);
12328 gcc_assert (TREE_CODE (expression) == OVERLOAD);
12332 if (type_dependent_expression_p (OVL_CURRENT (expression)))
12334 expression = OVL_NEXT (expression);
12339 return (dependent_type_p (TREE_TYPE (expression)));
12342 /* Returns TRUE if ARGS (a TREE_LIST of arguments to a function call)
12343 contains a type-dependent expression. */
12346 any_type_dependent_arguments_p (tree args)
12350 tree arg = TREE_VALUE (args);
12352 if (type_dependent_expression_p (arg))
12354 args = TREE_CHAIN (args);
12359 /* Returns TRUE if the ARG (a template argument) is dependent. */
12362 dependent_template_arg_p (tree arg)
12364 if (!processing_template_decl)
12367 if (TREE_CODE (arg) == TEMPLATE_DECL
12368 || TREE_CODE (arg) == TEMPLATE_TEMPLATE_PARM)
12369 return dependent_template_p (arg);
12370 else if (TYPE_P (arg))
12371 return dependent_type_p (arg);
12373 return (type_dependent_expression_p (arg)
12374 || value_dependent_expression_p (arg));
12377 /* Returns true if ARGS (a collection of template arguments) contains
12378 any dependent arguments. */
12381 any_dependent_template_arguments_p (tree args)
12389 for (i = 0; i < TMPL_ARGS_DEPTH (args); ++i)
12391 tree level = TMPL_ARGS_LEVEL (args, i + 1);
12392 for (j = 0; j < TREE_VEC_LENGTH (level); ++j)
12393 if (dependent_template_arg_p (TREE_VEC_ELT (level, j)))
12400 /* Returns TRUE if the template TMPL is dependent. */
12403 dependent_template_p (tree tmpl)
12405 if (TREE_CODE (tmpl) == OVERLOAD)
12409 if (dependent_template_p (OVL_FUNCTION (tmpl)))
12411 tmpl = OVL_CHAIN (tmpl);
12416 /* Template template parameters are dependent. */
12417 if (DECL_TEMPLATE_TEMPLATE_PARM_P (tmpl)
12418 || TREE_CODE (tmpl) == TEMPLATE_TEMPLATE_PARM)
12420 /* So are names that have not been looked up. */
12421 if (TREE_CODE (tmpl) == SCOPE_REF
12422 || TREE_CODE (tmpl) == IDENTIFIER_NODE)
12424 /* So are member templates of dependent classes. */
12425 if (TYPE_P (CP_DECL_CONTEXT (tmpl)))
12426 return dependent_type_p (DECL_CONTEXT (tmpl));
12430 /* Returns TRUE if the specialization TMPL<ARGS> is dependent. */
12433 dependent_template_id_p (tree tmpl, tree args)
12435 return (dependent_template_p (tmpl)
12436 || any_dependent_template_arguments_p (args));
12439 /* TYPE is a TYPENAME_TYPE. Returns the ordinary TYPE to which the
12440 TYPENAME_TYPE corresponds. Returns ERROR_MARK_NODE if no such TYPE
12441 can be found. Note that this function peers inside uninstantiated
12442 templates and therefore should be used only in extremely limited
12443 situations. ONLY_CURRENT_P restricts this peering to the currently
12444 open classes hierarchy (which is required when comparing types). */
12447 resolve_typename_type (tree type, bool only_current_p)
12455 gcc_assert (TREE_CODE (type) == TYPENAME_TYPE);
12457 scope = TYPE_CONTEXT (type);
12458 name = TYPE_IDENTIFIER (type);
12460 /* If the SCOPE is itself a TYPENAME_TYPE, then we need to resolve
12461 it first before we can figure out what NAME refers to. */
12462 if (TREE_CODE (scope) == TYPENAME_TYPE)
12463 scope = resolve_typename_type (scope, only_current_p);
12464 /* If we don't know what SCOPE refers to, then we cannot resolve the
12466 if (scope == error_mark_node || TREE_CODE (scope) == TYPENAME_TYPE)
12467 return error_mark_node;
12468 /* If the SCOPE is a template type parameter, we have no way of
12469 resolving the name. */
12470 if (TREE_CODE (scope) == TEMPLATE_TYPE_PARM)
12472 /* If the SCOPE is not the current instantiation, there's no reason
12473 to look inside it. */
12474 if (only_current_p && !currently_open_class (scope))
12475 return error_mark_node;
12476 /* If SCOPE is a partial instantiation, it will not have a valid
12477 TYPE_FIELDS list, so use the original template. */
12478 scope = CLASSTYPE_PRIMARY_TEMPLATE_TYPE (scope);
12479 /* Enter the SCOPE so that name lookup will be resolved as if we
12480 were in the class definition. In particular, SCOPE will no
12481 longer be considered a dependent type. */
12482 pushed_scope = push_scope (scope);
12483 /* Look up the declaration. */
12484 decl = lookup_member (scope, name, /*protect=*/0, /*want_type=*/true);
12485 /* Obtain the set of qualifiers applied to the TYPE. */
12486 quals = cp_type_quals (type);
12487 /* For a TYPENAME_TYPE like "typename X::template Y<T>", we want to
12488 find a TEMPLATE_DECL. Otherwise, we want to find a TYPE_DECL. */
12490 type = error_mark_node;
12491 else if (TREE_CODE (TYPENAME_TYPE_FULLNAME (type)) == IDENTIFIER_NODE
12492 && TREE_CODE (decl) == TYPE_DECL)
12493 type = TREE_TYPE (decl);
12494 else if (TREE_CODE (TYPENAME_TYPE_FULLNAME (type)) == TEMPLATE_ID_EXPR
12495 && DECL_CLASS_TEMPLATE_P (decl))
12499 /* Obtain the template and the arguments. */
12500 tmpl = TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type), 0);
12501 args = TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type), 1);
12502 /* Instantiate the template. */
12503 type = lookup_template_class (tmpl, args, NULL_TREE, NULL_TREE,
12504 /*entering_scope=*/0, tf_error | tf_user);
12507 type = error_mark_node;
12508 /* Qualify the resulting type. */
12509 if (type != error_mark_node && quals)
12510 type = cp_build_qualified_type (type, quals);
12511 /* Leave the SCOPE. */
12513 pop_scope (pushed_scope);
12518 /* EXPR is an expression which is not type-dependent. Return a proxy
12519 for EXPR that can be used to compute the types of larger
12520 expressions containing EXPR. */
12523 build_non_dependent_expr (tree expr)
12527 /* Preserve null pointer constants so that the type of things like
12528 "p == 0" where "p" is a pointer can be determined. */
12529 if (null_ptr_cst_p (expr))
12531 /* Preserve OVERLOADs; the functions must be available to resolve
12533 inner_expr = (TREE_CODE (expr) == ADDR_EXPR ?
12534 TREE_OPERAND (expr, 0) : expr);
12535 if (is_overloaded_fn (inner_expr)
12536 || TREE_CODE (inner_expr) == OFFSET_REF)
12538 /* There is no need to return a proxy for a variable. */
12539 if (TREE_CODE (expr) == VAR_DECL)
12541 /* Preserve string constants; conversions from string constants to
12542 "char *" are allowed, even though normally a "const char *"
12543 cannot be used to initialize a "char *". */
12544 if (TREE_CODE (expr) == STRING_CST)
12546 /* Preserve arithmetic constants, as an optimization -- there is no
12547 reason to create a new node. */
12548 if (TREE_CODE (expr) == INTEGER_CST || TREE_CODE (expr) == REAL_CST)
12550 /* Preserve THROW_EXPRs -- all throw-expressions have type "void".
12551 There is at least one place where we want to know that a
12552 particular expression is a throw-expression: when checking a ?:
12553 expression, there are special rules if the second or third
12554 argument is a throw-expression. */
12555 if (TREE_CODE (expr) == THROW_EXPR)
12558 if (TREE_CODE (expr) == COND_EXPR)
12559 return build3 (COND_EXPR,
12561 TREE_OPERAND (expr, 0),
12562 (TREE_OPERAND (expr, 1)
12563 ? build_non_dependent_expr (TREE_OPERAND (expr, 1))
12564 : build_non_dependent_expr (TREE_OPERAND (expr, 0))),
12565 build_non_dependent_expr (TREE_OPERAND (expr, 2)));
12566 if (TREE_CODE (expr) == COMPOUND_EXPR
12567 && !COMPOUND_EXPR_OVERLOADED (expr))
12568 return build2 (COMPOUND_EXPR,
12570 TREE_OPERAND (expr, 0),
12571 build_non_dependent_expr (TREE_OPERAND (expr, 1)));
12573 /* Otherwise, build a NON_DEPENDENT_EXPR.
12575 REFERENCE_TYPEs are not stripped for expressions in templates
12576 because doing so would play havoc with mangling. Consider, for
12579 template <typename T> void f<T& g>() { g(); }
12581 In the body of "f", the expression for "g" will have
12582 REFERENCE_TYPE, even though the standard says that it should
12583 not. The reason is that we must preserve the syntactic form of
12584 the expression so that mangling (say) "f<g>" inside the body of
12585 "f" works out correctly. Therefore, the REFERENCE_TYPE is
12587 return build1 (NON_DEPENDENT_EXPR, non_reference (TREE_TYPE (expr)), expr);
12590 /* ARGS is a TREE_LIST of expressions as arguments to a function call.
12591 Return a new TREE_LIST with the various arguments replaced with
12592 equivalent non-dependent expressions. */
12595 build_non_dependent_args (tree args)
12600 new_args = NULL_TREE;
12601 for (a = args; a; a = TREE_CHAIN (a))
12602 new_args = tree_cons (NULL_TREE,
12603 build_non_dependent_expr (TREE_VALUE (a)),
12605 return nreverse (new_args);
12608 #include "gt-cp-pt.h"