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))
4029 return TYPE_P (ot) && same_type_p (ot, nt);
4030 else if (TREE_CODE (ot) == TREE_VEC || TYPE_P (ot))
4033 return cp_tree_equal (ot, nt);
4036 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets
4037 of template arguments. Returns 0 otherwise. */
4040 comp_template_args (tree oldargs, tree newargs)
4044 if (TREE_VEC_LENGTH (oldargs) != TREE_VEC_LENGTH (newargs))
4047 for (i = 0; i < TREE_VEC_LENGTH (oldargs); ++i)
4049 tree nt = TREE_VEC_ELT (newargs, i);
4050 tree ot = TREE_VEC_ELT (oldargs, i);
4052 if (! template_args_equal (ot, nt))
4058 /* Given class template name and parameter list, produce a user-friendly name
4059 for the instantiation. */
4062 mangle_class_name_for_template (const char* name, tree parms, tree arglist)
4064 static struct obstack scratch_obstack;
4065 static char *scratch_firstobj;
4068 if (!scratch_firstobj)
4069 gcc_obstack_init (&scratch_obstack);
4071 obstack_free (&scratch_obstack, scratch_firstobj);
4072 scratch_firstobj = obstack_alloc (&scratch_obstack, 1);
4074 #define ccat(C) obstack_1grow (&scratch_obstack, (C));
4075 #define cat(S) obstack_grow (&scratch_obstack, (S), strlen (S))
4079 nparms = TREE_VEC_LENGTH (parms);
4080 arglist = INNERMOST_TEMPLATE_ARGS (arglist);
4081 gcc_assert (nparms == TREE_VEC_LENGTH (arglist));
4082 for (i = 0; i < nparms; i++)
4084 tree parm = TREE_VALUE (TREE_VEC_ELT (parms, i));
4085 tree arg = TREE_VEC_ELT (arglist, i);
4090 if (TREE_CODE (parm) == TYPE_DECL)
4092 cat (type_as_string (arg, TFF_CHASE_TYPEDEF));
4095 else if (TREE_CODE (parm) == TEMPLATE_DECL)
4097 if (TREE_CODE (arg) == TEMPLATE_DECL)
4099 /* Already substituted with real template. Just output
4100 the template name here */
4101 tree context = DECL_CONTEXT (arg);
4104 /* The template may be defined in a namespace, or
4105 may be a member template. */
4106 gcc_assert (TREE_CODE (context) == NAMESPACE_DECL
4107 || CLASS_TYPE_P (context));
4108 cat (decl_as_string (DECL_CONTEXT (arg),
4109 TFF_PLAIN_IDENTIFIER));
4112 cat (IDENTIFIER_POINTER (DECL_NAME (arg)));
4115 /* Output the parameter declaration. */
4116 cat (type_as_string (arg, TFF_CHASE_TYPEDEF));
4120 gcc_assert (TREE_CODE (parm) == PARM_DECL);
4122 /* No need to check arglist against parmlist here; we did that
4123 in coerce_template_parms, called from lookup_template_class. */
4124 cat (expr_as_string (arg, TFF_PLAIN_IDENTIFIER));
4127 char *bufp = obstack_next_free (&scratch_obstack);
4129 while (bufp[offset - 1] == ' ')
4131 obstack_blank_fast (&scratch_obstack, offset);
4133 /* B<C<char> >, not B<C<char>> */
4134 if (bufp[offset - 1] == '>')
4139 return (char *) obstack_base (&scratch_obstack);
4143 classtype_mangled_name (tree t)
4145 if (CLASSTYPE_TEMPLATE_INFO (t)
4146 /* Specializations have already had their names set up in
4147 lookup_template_class. */
4148 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (t))
4150 tree tmpl = most_general_template (CLASSTYPE_TI_TEMPLATE (t));
4152 /* For non-primary templates, the template parameters are
4153 implicit from their surrounding context. */
4154 if (PRIMARY_TEMPLATE_P (tmpl))
4156 tree name = DECL_NAME (tmpl);
4157 char *mangled_name = mangle_class_name_for_template
4158 (IDENTIFIER_POINTER (name),
4159 DECL_INNERMOST_TEMPLATE_PARMS (tmpl),
4160 CLASSTYPE_TI_ARGS (t));
4161 tree id = get_identifier (mangled_name);
4162 IDENTIFIER_TEMPLATE (id) = name;
4167 return TYPE_IDENTIFIER (t);
4171 add_pending_template (tree d)
4173 tree ti = (TYPE_P (d)
4174 ? CLASSTYPE_TEMPLATE_INFO (d)
4175 : DECL_TEMPLATE_INFO (d));
4179 if (TI_PENDING_TEMPLATE_FLAG (ti))
4182 /* We are called both from instantiate_decl, where we've already had a
4183 tinst_level pushed, and instantiate_template, where we haven't.
4185 level = !(current_tinst_level && TINST_DECL (current_tinst_level) == d);
4188 push_tinst_level (d);
4190 pt = tree_cons (current_tinst_level, d, NULL_TREE);
4191 if (last_pending_template)
4192 TREE_CHAIN (last_pending_template) = pt;
4194 pending_templates = pt;
4196 last_pending_template = pt;
4198 TI_PENDING_TEMPLATE_FLAG (ti) = 1;
4205 /* Return a TEMPLATE_ID_EXPR corresponding to the indicated FNS and
4206 ARGLIST. Valid choices for FNS are given in the cp-tree.def
4207 documentation for TEMPLATE_ID_EXPR. */
4210 lookup_template_function (tree fns, tree arglist)
4214 if (fns == error_mark_node || arglist == error_mark_node)
4215 return error_mark_node;
4217 gcc_assert (!arglist || TREE_CODE (arglist) == TREE_VEC);
4218 gcc_assert (fns && (is_overloaded_fn (fns)
4219 || TREE_CODE (fns) == IDENTIFIER_NODE));
4221 if (BASELINK_P (fns))
4223 BASELINK_FUNCTIONS (fns) = build2 (TEMPLATE_ID_EXPR,
4225 BASELINK_FUNCTIONS (fns),
4230 type = TREE_TYPE (fns);
4231 if (TREE_CODE (fns) == OVERLOAD || !type)
4232 type = unknown_type_node;
4234 return build2 (TEMPLATE_ID_EXPR, type, fns, arglist);
4237 /* Within the scope of a template class S<T>, the name S gets bound
4238 (in build_self_reference) to a TYPE_DECL for the class, not a
4239 TEMPLATE_DECL. If DECL is a TYPE_DECL for current_class_type,
4240 or one of its enclosing classes, and that type is a template,
4241 return the associated TEMPLATE_DECL. Otherwise, the original
4242 DECL is returned. */
4245 maybe_get_template_decl_from_type_decl (tree decl)
4247 return (decl != NULL_TREE
4248 && TREE_CODE (decl) == TYPE_DECL
4249 && DECL_ARTIFICIAL (decl)
4250 && CLASS_TYPE_P (TREE_TYPE (decl))
4251 && CLASSTYPE_TEMPLATE_INFO (TREE_TYPE (decl)))
4252 ? CLASSTYPE_TI_TEMPLATE (TREE_TYPE (decl)) : decl;
4255 /* Given an IDENTIFIER_NODE (type TEMPLATE_DECL) and a chain of
4256 parameters, find the desired type.
4258 D1 is the PTYPENAME terminal, and ARGLIST is the list of arguments.
4260 IN_DECL, if non-NULL, is the template declaration we are trying to
4263 If ENTERING_SCOPE is nonzero, we are about to enter the scope of
4264 the class we are looking up.
4266 Issue error and warning messages under control of COMPLAIN.
4268 If the template class is really a local class in a template
4269 function, then the FUNCTION_CONTEXT is the function in which it is
4272 ??? Note that this function is currently called *twice* for each
4273 template-id: the first time from the parser, while creating the
4274 incomplete type (finish_template_type), and the second type during the
4275 real instantiation (instantiate_template_class). This is surely something
4276 that we want to avoid. It also causes some problems with argument
4277 coercion (see convert_nontype_argument for more information on this). */
4280 lookup_template_class (tree d1,
4285 tsubst_flags_t complain)
4287 tree template = NULL_TREE, parmlist;
4290 timevar_push (TV_NAME_LOOKUP);
4292 if (TREE_CODE (d1) == IDENTIFIER_NODE)
4294 tree value = innermost_non_namespace_value (d1);
4295 if (value && DECL_TEMPLATE_TEMPLATE_PARM_P (value))
4300 push_decl_namespace (context);
4301 template = lookup_name (d1, /*prefer_type=*/0);
4302 template = maybe_get_template_decl_from_type_decl (template);
4304 pop_decl_namespace ();
4307 context = DECL_CONTEXT (template);
4309 else if (TREE_CODE (d1) == TYPE_DECL && IS_AGGR_TYPE (TREE_TYPE (d1)))
4311 tree type = TREE_TYPE (d1);
4313 /* If we are declaring a constructor, say A<T>::A<T>, we will get
4314 an implicit typename for the second A. Deal with it. */
4315 if (TREE_CODE (type) == TYPENAME_TYPE && TREE_TYPE (type))
4316 type = TREE_TYPE (type);
4318 if (CLASSTYPE_TEMPLATE_INFO (type))
4320 template = CLASSTYPE_TI_TEMPLATE (type);
4321 d1 = DECL_NAME (template);
4324 else if (TREE_CODE (d1) == ENUMERAL_TYPE
4325 || (TYPE_P (d1) && IS_AGGR_TYPE (d1)))
4327 template = TYPE_TI_TEMPLATE (d1);
4328 d1 = DECL_NAME (template);
4330 else if (TREE_CODE (d1) == TEMPLATE_DECL
4331 && TREE_CODE (DECL_TEMPLATE_RESULT (d1)) == TYPE_DECL)
4334 d1 = DECL_NAME (template);
4335 context = DECL_CONTEXT (template);
4338 /* Issue an error message if we didn't find a template. */
4341 if (complain & tf_error)
4342 error ("%qT is not a template", d1);
4343 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node);
4346 if (TREE_CODE (template) != TEMPLATE_DECL
4347 /* Make sure it's a user visible template, if it was named by
4349 || ((complain & tf_user) && !DECL_TEMPLATE_PARM_P (template)
4350 && !PRIMARY_TEMPLATE_P (template)))
4352 if (complain & tf_error)
4354 error ("non-template type %qT used as a template", d1);
4356 cp_error_at ("for template declaration %qD", in_decl);
4358 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node);
4361 complain &= ~tf_user;
4363 if (DECL_TEMPLATE_TEMPLATE_PARM_P (template))
4365 /* Create a new TEMPLATE_DECL and TEMPLATE_TEMPLATE_PARM node to store
4366 template arguments */
4371 parmlist = DECL_INNERMOST_TEMPLATE_PARMS (template);
4373 /* Consider an example where a template template parameter declared as
4375 template <class T, class U = std::allocator<T> > class TT
4377 The template parameter level of T and U are one level larger than
4378 of TT. To proper process the default argument of U, say when an
4379 instantiation `TT<int>' is seen, we need to build the full
4380 arguments containing {int} as the innermost level. Outer levels,
4381 available when not appearing as default template argument, can be
4382 obtained from `current_template_args ()'.
4384 Suppose that TT is later substituted with std::vector. The above
4385 instantiation is `TT<int, std::allocator<T> >' with TT at
4386 level 1, and T at level 2, while the template arguments at level 1
4387 becomes {std::vector} and the inner level 2 is {int}. */
4389 if (current_template_parms)
4390 arglist = add_to_template_args (current_template_args (), arglist);
4392 arglist2 = coerce_template_parms (parmlist, arglist, template,
4393 complain, /*require_all_args=*/1);
4394 if (arglist2 == error_mark_node
4395 || (!uses_template_parms (arglist2)
4396 && check_instantiated_args (template, arglist2, complain)))
4397 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node);
4399 parm = bind_template_template_parm (TREE_TYPE (template), arglist2);
4400 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, parm);
4404 tree template_type = TREE_TYPE (template);
4407 tree found = NULL_TREE;
4410 int is_partial_instantiation;
4412 gen_tmpl = most_general_template (template);
4413 parmlist = DECL_TEMPLATE_PARMS (gen_tmpl);
4414 parm_depth = TMPL_PARMS_DEPTH (parmlist);
4415 arg_depth = TMPL_ARGS_DEPTH (arglist);
4417 if (arg_depth == 1 && parm_depth > 1)
4419 /* We've been given an incomplete set of template arguments.
4422 template <class T> struct S1 {
4423 template <class U> struct S2 {};
4424 template <class U> struct S2<U*> {};
4427 we will be called with an ARGLIST of `U*', but the
4428 TEMPLATE will be `template <class T> template
4429 <class U> struct S1<T>::S2'. We must fill in the missing
4432 = add_outermost_template_args (TYPE_TI_ARGS (TREE_TYPE (template)),
4434 arg_depth = TMPL_ARGS_DEPTH (arglist);
4437 /* Now we should have enough arguments. */
4438 gcc_assert (parm_depth == arg_depth);
4440 /* From here on, we're only interested in the most general
4442 template = gen_tmpl;
4444 /* Calculate the BOUND_ARGS. These will be the args that are
4445 actually tsubst'd into the definition to create the
4449 /* We have multiple levels of arguments to coerce, at once. */
4451 int saved_depth = TMPL_ARGS_DEPTH (arglist);
4453 tree bound_args = make_tree_vec (parm_depth);
4455 for (i = saved_depth,
4456 t = DECL_TEMPLATE_PARMS (template);
4457 i > 0 && t != NULL_TREE;
4458 --i, t = TREE_CHAIN (t))
4460 tree a = coerce_template_parms (TREE_VALUE (t),
4462 complain, /*require_all_args=*/1);
4464 /* Don't process further if one of the levels fails. */
4465 if (a == error_mark_node)
4467 /* Restore the ARGLIST to its full size. */
4468 TREE_VEC_LENGTH (arglist) = saved_depth;
4469 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node);
4472 SET_TMPL_ARGS_LEVEL (bound_args, i, a);
4474 /* We temporarily reduce the length of the ARGLIST so
4475 that coerce_template_parms will see only the arguments
4476 corresponding to the template parameters it is
4478 TREE_VEC_LENGTH (arglist)--;
4481 /* Restore the ARGLIST to its full size. */
4482 TREE_VEC_LENGTH (arglist) = saved_depth;
4484 arglist = bound_args;
4488 = coerce_template_parms (INNERMOST_TEMPLATE_PARMS (parmlist),
4489 INNERMOST_TEMPLATE_ARGS (arglist),
4491 complain, /*require_all_args=*/1);
4493 if (arglist == error_mark_node)
4494 /* We were unable to bind the arguments. */
4495 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node);
4497 /* In the scope of a template class, explicit references to the
4498 template class refer to the type of the template, not any
4499 instantiation of it. For example, in:
4501 template <class T> class C { void f(C<T>); }
4503 the `C<T>' is just the same as `C'. Outside of the
4504 class, however, such a reference is an instantiation. */
4505 if (comp_template_args (TYPE_TI_ARGS (template_type),
4508 found = template_type;
4510 if (!entering_scope && PRIMARY_TEMPLATE_P (template))
4514 for (ctx = current_class_type;
4515 ctx && TREE_CODE (ctx) != NAMESPACE_DECL;
4517 ? TYPE_CONTEXT (ctx)
4518 : DECL_CONTEXT (ctx)))
4519 if (TYPE_P (ctx) && same_type_p (ctx, template_type))
4522 /* We're not in the scope of the class, so the
4523 TEMPLATE_TYPE is not the type we want after all. */
4529 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, found);
4531 /* If we already have this specialization, return it. */
4532 found = retrieve_specialization (template, arglist,
4533 /*class_specializations_p=*/false);
4535 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, found);
4537 /* This type is a "partial instantiation" if any of the template
4538 arguments still involve template parameters. Note that we set
4539 IS_PARTIAL_INSTANTIATION for partial specializations as
4541 is_partial_instantiation = uses_template_parms (arglist);
4543 /* If the deduced arguments are invalid, then the binding
4545 if (!is_partial_instantiation
4546 && check_instantiated_args (template,
4547 INNERMOST_TEMPLATE_ARGS (arglist),
4549 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node);
4551 if (!is_partial_instantiation
4552 && !PRIMARY_TEMPLATE_P (template)
4553 && TREE_CODE (CP_DECL_CONTEXT (template)) == NAMESPACE_DECL)
4555 found = xref_tag_from_type (TREE_TYPE (template),
4556 DECL_NAME (template),
4557 /*tag_scope=*/ts_global);
4558 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, found);
4561 context = tsubst (DECL_CONTEXT (template), arglist,
4564 context = global_namespace;
4566 /* Create the type. */
4567 if (TREE_CODE (template_type) == ENUMERAL_TYPE)
4569 if (!is_partial_instantiation)
4571 set_current_access_from_decl (TYPE_NAME (template_type));
4572 t = start_enum (TYPE_IDENTIFIER (template_type));
4575 /* We don't want to call start_enum for this type, since
4576 the values for the enumeration constants may involve
4577 template parameters. And, no one should be interested
4578 in the enumeration constants for such a type. */
4579 t = make_node (ENUMERAL_TYPE);
4583 t = make_aggr_type (TREE_CODE (template_type));
4584 CLASSTYPE_DECLARED_CLASS (t)
4585 = CLASSTYPE_DECLARED_CLASS (template_type);
4586 SET_CLASSTYPE_IMPLICIT_INSTANTIATION (t);
4587 TYPE_FOR_JAVA (t) = TYPE_FOR_JAVA (template_type);
4589 /* A local class. Make sure the decl gets registered properly. */
4590 if (context == current_function_decl)
4591 pushtag (DECL_NAME (template), t, /*tag_scope=*/ts_current);
4594 /* If we called start_enum or pushtag above, this information
4595 will already be set up. */
4598 TYPE_CONTEXT (t) = FROB_CONTEXT (context);
4600 type_decl = create_implicit_typedef (DECL_NAME (template), t);
4601 DECL_CONTEXT (type_decl) = TYPE_CONTEXT (t);
4602 TYPE_STUB_DECL (t) = type_decl;
4603 DECL_SOURCE_LOCATION (type_decl)
4604 = DECL_SOURCE_LOCATION (TYPE_STUB_DECL (template_type));
4607 type_decl = TYPE_NAME (t);
4609 TREE_PRIVATE (type_decl)
4610 = TREE_PRIVATE (TYPE_STUB_DECL (template_type));
4611 TREE_PROTECTED (type_decl)
4612 = TREE_PROTECTED (TYPE_STUB_DECL (template_type));
4613 DECL_IN_SYSTEM_HEADER (type_decl)
4614 = DECL_IN_SYSTEM_HEADER (template);
4616 /* Set up the template information. We have to figure out which
4617 template is the immediate parent if this is a full
4619 if (parm_depth == 1 || is_partial_instantiation
4620 || !PRIMARY_TEMPLATE_P (template))
4621 /* This case is easy; there are no member templates involved. */
4625 /* This is a full instantiation of a member template. Look
4626 for a partial instantiation of which this is an instance. */
4628 for (found = DECL_TEMPLATE_INSTANTIATIONS (template);
4629 found; found = TREE_CHAIN (found))
4632 tree tmpl = CLASSTYPE_TI_TEMPLATE (TREE_VALUE (found));
4634 /* We only want partial instantiations, here, not
4635 specializations or full instantiations. */
4636 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_VALUE (found))
4637 || !uses_template_parms (TREE_VALUE (found)))
4640 /* Temporarily reduce by one the number of levels in the
4641 ARGLIST and in FOUND so as to avoid comparing the
4642 last set of arguments. */
4643 TREE_VEC_LENGTH (arglist)--;
4644 TREE_VEC_LENGTH (TREE_PURPOSE (found)) --;
4646 /* See if the arguments match. If they do, then TMPL is
4647 the partial instantiation we want. */
4648 success = comp_template_args (TREE_PURPOSE (found), arglist);
4650 /* Restore the argument vectors to their full size. */
4651 TREE_VEC_LENGTH (arglist)++;
4652 TREE_VEC_LENGTH (TREE_PURPOSE (found))++;
4663 /* There was no partial instantiation. This happens
4664 where C<T> is a member template of A<T> and it's used
4667 template <typename T> struct B { A<T>::C<int> m; };
4670 Create the partial instantiation.
4672 TREE_VEC_LENGTH (arglist)--;
4673 found = tsubst (template, arglist, complain, NULL_TREE);
4674 TREE_VEC_LENGTH (arglist)++;
4678 SET_TYPE_TEMPLATE_INFO (t, tree_cons (found, arglist, NULL_TREE));
4679 DECL_TEMPLATE_INSTANTIATIONS (template)
4680 = tree_cons (arglist, t,
4681 DECL_TEMPLATE_INSTANTIATIONS (template));
4683 if (TREE_CODE (t) == ENUMERAL_TYPE
4684 && !is_partial_instantiation)
4685 /* Now that the type has been registered on the instantiations
4686 list, we set up the enumerators. Because the enumeration
4687 constants may involve the enumeration type itself, we make
4688 sure to register the type first, and then create the
4689 constants. That way, doing tsubst_expr for the enumeration
4690 constants won't result in recursive calls here; we'll find
4691 the instantiation and exit above. */
4692 tsubst_enum (template_type, t, arglist);
4694 /* Reset the name of the type, now that CLASSTYPE_TEMPLATE_INFO
4696 if (TREE_CODE (t) != ENUMERAL_TYPE)
4697 DECL_NAME (type_decl) = classtype_mangled_name (t);
4698 if (is_partial_instantiation)
4699 /* If the type makes use of template parameters, the
4700 code that generates debugging information will crash. */
4701 DECL_IGNORED_P (TYPE_STUB_DECL (t)) = 1;
4703 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, t);
4705 timevar_pop (TV_NAME_LOOKUP);
4712 struct pointer_set_t *visited;
4715 /* Called from for_each_template_parm via walk_tree. */
4718 for_each_template_parm_r (tree *tp, int *walk_subtrees, void *d)
4721 struct pair_fn_data *pfd = (struct pair_fn_data *) d;
4722 tree_fn_t fn = pfd->fn;
4723 void *data = pfd->data;
4726 && for_each_template_parm (TYPE_CONTEXT (t), fn, data, pfd->visited))
4727 return error_mark_node;
4729 switch (TREE_CODE (t))
4732 if (TYPE_PTRMEMFUNC_P (t))
4738 if (!TYPE_TEMPLATE_INFO (t))
4740 else if (for_each_template_parm (TREE_VALUE (TYPE_TEMPLATE_INFO (t)),
4741 fn, data, pfd->visited))
4742 return error_mark_node;
4746 /* Since we're not going to walk subtrees, we have to do this
4748 if (for_each_template_parm (TYPE_METHOD_BASETYPE (t), fn, data,
4750 return error_mark_node;
4754 /* Check the return type. */
4755 if (for_each_template_parm (TREE_TYPE (t), fn, data, pfd->visited))
4756 return error_mark_node;
4758 /* Check the parameter types. Since default arguments are not
4759 instantiated until they are needed, the TYPE_ARG_TYPES may
4760 contain expressions that involve template parameters. But,
4761 no-one should be looking at them yet. And, once they're
4762 instantiated, they don't contain template parameters, so
4763 there's no point in looking at them then, either. */
4767 for (parm = TYPE_ARG_TYPES (t); parm; parm = TREE_CHAIN (parm))
4768 if (for_each_template_parm (TREE_VALUE (parm), fn, data,
4770 return error_mark_node;
4772 /* Since we've already handled the TYPE_ARG_TYPES, we don't
4773 want walk_tree walking into them itself. */
4779 if (for_each_template_parm (TYPE_FIELDS (t), fn, data,
4781 return error_mark_node;
4786 if (DECL_LANG_SPECIFIC (t) && DECL_TEMPLATE_INFO (t)
4787 && for_each_template_parm (DECL_TI_ARGS (t), fn, data,
4789 return error_mark_node;
4794 if (TREE_CODE (t) == CONST_DECL && DECL_TEMPLATE_PARM_P (t)
4795 && for_each_template_parm (DECL_INITIAL (t), fn, data,
4797 return error_mark_node;
4798 if (DECL_CONTEXT (t)
4799 && for_each_template_parm (DECL_CONTEXT (t), fn, data,
4801 return error_mark_node;
4804 case BOUND_TEMPLATE_TEMPLATE_PARM:
4805 /* Record template parameters such as `T' inside `TT<T>'. */
4806 if (for_each_template_parm (TYPE_TI_ARGS (t), fn, data, pfd->visited))
4807 return error_mark_node;
4810 case TEMPLATE_TEMPLATE_PARM:
4811 case TEMPLATE_TYPE_PARM:
4812 case TEMPLATE_PARM_INDEX:
4813 if (fn && (*fn)(t, data))
4814 return error_mark_node;
4816 return error_mark_node;
4820 /* A template template parameter is encountered. */
4821 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t)
4822 && for_each_template_parm (TREE_TYPE (t), fn, data, pfd->visited))
4823 return error_mark_node;
4825 /* Already substituted template template parameter */
4831 || for_each_template_parm (TYPENAME_TYPE_FULLNAME (t), fn,
4832 data, pfd->visited))
4833 return error_mark_node;
4837 if (TREE_TYPE (t) && TYPE_PTRMEMFUNC_P (TREE_TYPE (t))
4838 && for_each_template_parm (TYPE_PTRMEMFUNC_FN_TYPE
4839 (TREE_TYPE (t)), fn, data,
4841 return error_mark_node;
4846 /* If there's no type, then this thing must be some expression
4847 involving template parameters. */
4848 if (!fn && !TREE_TYPE (t))
4849 return error_mark_node;
4854 case REINTERPRET_CAST_EXPR:
4855 case CONST_CAST_EXPR:
4856 case STATIC_CAST_EXPR:
4857 case DYNAMIC_CAST_EXPR:
4861 case PSEUDO_DTOR_EXPR:
4863 return error_mark_node;
4867 /* If we do not handle this case specially, we end up walking
4868 the BINFO hierarchy, which is circular, and therefore
4869 confuses walk_tree. */
4871 if (for_each_template_parm (BASELINK_FUNCTIONS (*tp), fn, data,
4873 return error_mark_node;
4880 /* We didn't find any template parameters we liked. */
4884 /* For each TEMPLATE_TYPE_PARM, TEMPLATE_TEMPLATE_PARM,
4885 BOUND_TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX in T,
4886 call FN with the parameter and the DATA.
4887 If FN returns nonzero, the iteration is terminated, and
4888 for_each_template_parm returns 1. Otherwise, the iteration
4889 continues. If FN never returns a nonzero value, the value
4890 returned by for_each_template_parm is 0. If FN is NULL, it is
4891 considered to be the function which always returns 1. */
4894 for_each_template_parm (tree t, tree_fn_t fn, void* data,
4895 struct pointer_set_t *visited)
4897 struct pair_fn_data pfd;
4904 /* Walk the tree. (Conceptually, we would like to walk without
4905 duplicates, but for_each_template_parm_r recursively calls
4906 for_each_template_parm, so we would need to reorganize a fair
4907 bit to use walk_tree_without_duplicates, so we keep our own
4910 pfd.visited = visited;
4912 pfd.visited = pointer_set_create ();
4913 result = walk_tree (&t,
4914 for_each_template_parm_r,
4916 pfd.visited) != NULL_TREE;
4921 pointer_set_destroy (pfd.visited);
4928 /* Returns true if T depends on any template parameter. */
4931 uses_template_parms (tree t)
4934 int saved_processing_template_decl;
4936 saved_processing_template_decl = processing_template_decl;
4937 if (!saved_processing_template_decl)
4938 processing_template_decl = 1;
4940 dependent_p = dependent_type_p (t);
4941 else if (TREE_CODE (t) == TREE_VEC)
4942 dependent_p = any_dependent_template_arguments_p (t);
4943 else if (TREE_CODE (t) == TREE_LIST)
4944 dependent_p = (uses_template_parms (TREE_VALUE (t))
4945 || uses_template_parms (TREE_CHAIN (t)));
4948 || TREE_CODE (t) == TEMPLATE_PARM_INDEX
4949 || TREE_CODE (t) == OVERLOAD
4950 || TREE_CODE (t) == BASELINK
4951 || CONSTANT_CLASS_P (t))
4952 dependent_p = (type_dependent_expression_p (t)
4953 || value_dependent_expression_p (t));
4956 gcc_assert (t == error_mark_node);
4957 dependent_p = false;
4960 processing_template_decl = saved_processing_template_decl;
4965 /* Returns true if T depends on any template parameter with level LEVEL. */
4968 uses_template_parms_level (tree t, int level)
4970 return for_each_template_parm (t, template_parm_this_level_p, &level, NULL);
4973 static int tinst_depth;
4974 extern int max_tinst_depth;
4975 #ifdef GATHER_STATISTICS
4978 static int tinst_level_tick;
4979 static int last_template_error_tick;
4981 /* We're starting to instantiate D; record the template instantiation context
4982 for diagnostics and to restore it later. */
4985 push_tinst_level (tree d)
4989 if (tinst_depth >= max_tinst_depth)
4991 /* If the instantiation in question still has unbound template parms,
4992 we don't really care if we can't instantiate it, so just return.
4993 This happens with base instantiation for implicit `typename'. */
4994 if (uses_template_parms (d))
4997 last_template_error_tick = tinst_level_tick;
4998 error ("template instantiation depth exceeds maximum of %d (use "
4999 "-ftemplate-depth-NN to increase the maximum) instantiating %qD",
5000 max_tinst_depth, d);
5002 print_instantiation_context ();
5007 new = make_node (TINST_LEVEL);
5008 TINST_DECL (new) = d;
5009 TINST_LOCATION (new) = input_location;
5010 TINST_IN_SYSTEM_HEADER_P (new) = in_system_header;
5011 TREE_CHAIN (new) = current_tinst_level;
5012 current_tinst_level = new;
5015 #ifdef GATHER_STATISTICS
5016 if (tinst_depth > depth_reached)
5017 depth_reached = tinst_depth;
5024 /* We're done instantiating this template; return to the instantiation
5028 pop_tinst_level (void)
5030 tree old = current_tinst_level;
5032 /* Restore the filename and line number stashed away when we started
5033 this instantiation. */
5034 input_location = TINST_LOCATION (old);
5035 in_system_header = TINST_IN_SYSTEM_HEADER_P (old);
5036 current_tinst_level = TREE_CHAIN (old);
5041 /* We're instantiating a deferred template; restore the template
5042 instantiation context in which the instantiation was requested, which
5043 is one step out from LEVEL. */
5046 reopen_tinst_level (tree level)
5051 for (t = level; t; t = TREE_CHAIN (t))
5054 current_tinst_level = level;
5058 /* DECL is a friend FUNCTION_DECL or TEMPLATE_DECL. ARGS is the
5059 vector of template arguments, as for tsubst.
5061 Returns an appropriate tsubst'd friend declaration. */
5064 tsubst_friend_function (tree decl, tree args)
5068 if (TREE_CODE (decl) == FUNCTION_DECL
5069 && DECL_TEMPLATE_INSTANTIATION (decl)
5070 && TREE_CODE (DECL_TI_TEMPLATE (decl)) != TEMPLATE_DECL)
5071 /* This was a friend declared with an explicit template
5072 argument list, e.g.:
5076 to indicate that f was a template instantiation, not a new
5077 function declaration. Now, we have to figure out what
5078 instantiation of what template. */
5080 tree template_id, arglist, fns;
5083 tree ns = decl_namespace_context (TYPE_MAIN_DECL (current_class_type));
5085 /* Friend functions are looked up in the containing namespace scope.
5086 We must enter that scope, to avoid finding member functions of the
5087 current cless with same name. */
5088 push_nested_namespace (ns);
5089 fns = tsubst_expr (DECL_TI_TEMPLATE (decl), args,
5090 tf_error | tf_warning, NULL_TREE);
5091 pop_nested_namespace (ns);
5092 arglist = tsubst (DECL_TI_ARGS (decl), args,
5093 tf_error | tf_warning, NULL_TREE);
5094 template_id = lookup_template_function (fns, arglist);
5096 new_friend = tsubst (decl, args, tf_error | tf_warning, NULL_TREE);
5097 tmpl = determine_specialization (template_id, new_friend,
5099 /*need_member_template=*/0,
5100 TREE_VEC_LENGTH (args));
5101 return instantiate_template (tmpl, new_args, tf_error);
5104 new_friend = tsubst (decl, args, tf_error | tf_warning, NULL_TREE);
5106 /* The NEW_FRIEND will look like an instantiation, to the
5107 compiler, but is not an instantiation from the point of view of
5108 the language. For example, we might have had:
5110 template <class T> struct S {
5111 template <class U> friend void f(T, U);
5114 Then, in S<int>, template <class U> void f(int, U) is not an
5115 instantiation of anything. */
5116 if (new_friend == error_mark_node)
5117 return error_mark_node;
5119 DECL_USE_TEMPLATE (new_friend) = 0;
5120 if (TREE_CODE (decl) == TEMPLATE_DECL)
5122 DECL_USE_TEMPLATE (DECL_TEMPLATE_RESULT (new_friend)) = 0;
5123 DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (new_friend))
5124 = DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (decl));
5127 /* The mangled name for the NEW_FRIEND is incorrect. The function
5128 is not a template instantiation and should not be mangled like
5129 one. Therefore, we forget the mangling here; we'll recompute it
5130 later if we need it. */
5131 if (TREE_CODE (new_friend) != TEMPLATE_DECL)
5133 SET_DECL_RTL (new_friend, NULL_RTX);
5134 SET_DECL_ASSEMBLER_NAME (new_friend, NULL_TREE);
5137 if (DECL_NAMESPACE_SCOPE_P (new_friend))
5140 tree new_friend_template_info;
5141 tree new_friend_result_template_info;
5143 int new_friend_is_defn;
5145 /* We must save some information from NEW_FRIEND before calling
5146 duplicate decls since that function will free NEW_FRIEND if
5148 new_friend_template_info = DECL_TEMPLATE_INFO (new_friend);
5149 new_friend_is_defn =
5150 (DECL_INITIAL (DECL_TEMPLATE_RESULT
5151 (template_for_substitution (new_friend)))
5153 if (TREE_CODE (new_friend) == TEMPLATE_DECL)
5155 /* This declaration is a `primary' template. */
5156 DECL_PRIMARY_TEMPLATE (new_friend) = new_friend;
5158 new_friend_result_template_info
5159 = DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (new_friend));
5162 new_friend_result_template_info = NULL_TREE;
5164 /* Inside pushdecl_namespace_level, we will push into the
5165 current namespace. However, the friend function should go
5166 into the namespace of the template. */
5167 ns = decl_namespace_context (new_friend);
5168 push_nested_namespace (ns);
5169 old_decl = pushdecl_namespace_level (new_friend);
5170 pop_nested_namespace (ns);
5172 if (old_decl != new_friend)
5174 /* This new friend declaration matched an existing
5175 declaration. For example, given:
5177 template <class T> void f(T);
5178 template <class U> class C {
5179 template <class T> friend void f(T) {}
5182 the friend declaration actually provides the definition
5183 of `f', once C has been instantiated for some type. So,
5184 old_decl will be the out-of-class template declaration,
5185 while new_friend is the in-class definition.
5187 But, if `f' was called before this point, the
5188 instantiation of `f' will have DECL_TI_ARGS corresponding
5189 to `T' but not to `U', references to which might appear
5190 in the definition of `f'. Previously, the most general
5191 template for an instantiation of `f' was the out-of-class
5192 version; now it is the in-class version. Therefore, we
5193 run through all specialization of `f', adding to their
5194 DECL_TI_ARGS appropriately. In particular, they need a
5195 new set of outer arguments, corresponding to the
5196 arguments for this class instantiation.
5198 The same situation can arise with something like this:
5201 template <class T> class C {
5205 when `C<int>' is instantiated. Now, `f(int)' is defined
5208 if (!new_friend_is_defn)
5209 /* On the other hand, if the in-class declaration does
5210 *not* provide a definition, then we don't want to alter
5211 existing definitions. We can just leave everything
5216 /* Overwrite whatever template info was there before, if
5217 any, with the new template information pertaining to
5219 DECL_TEMPLATE_INFO (old_decl) = new_friend_template_info;
5221 if (TREE_CODE (old_decl) != TEMPLATE_DECL)
5222 reregister_specialization (new_friend,
5223 most_general_template (old_decl),
5228 tree new_friend_args;
5230 DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (old_decl))
5231 = new_friend_result_template_info;
5233 new_friend_args = TI_ARGS (new_friend_template_info);
5234 for (t = DECL_TEMPLATE_SPECIALIZATIONS (old_decl);
5238 tree spec = TREE_VALUE (t);
5241 = add_outermost_template_args (new_friend_args,
5242 DECL_TI_ARGS (spec));
5245 /* Now, since specializations are always supposed to
5246 hang off of the most general template, we must move
5248 t = most_general_template (old_decl);
5251 DECL_TEMPLATE_SPECIALIZATIONS (t)
5252 = chainon (DECL_TEMPLATE_SPECIALIZATIONS (t),
5253 DECL_TEMPLATE_SPECIALIZATIONS (old_decl));
5254 DECL_TEMPLATE_SPECIALIZATIONS (old_decl) = NULL_TREE;
5259 /* The information from NEW_FRIEND has been merged into OLD_DECL
5260 by duplicate_decls. */
5261 new_friend = old_decl;
5266 tree context = DECL_CONTEXT (new_friend);
5270 template <class T> class C {
5271 template <class U> friend void C1<U>::f (); // case 1
5272 friend void C2<T>::f (); // case 2
5274 we only need to make sure CONTEXT is a complete type for
5275 case 2. To distinguish between the two cases, we note that
5276 CONTEXT of case 1 remains dependent type after tsubst while
5277 this isn't true for case 2. */
5278 ++processing_template_decl;
5279 dependent_p = dependent_type_p (context);
5280 --processing_template_decl;
5283 && !complete_type_or_else (context, NULL_TREE))
5284 return error_mark_node;
5286 if (COMPLETE_TYPE_P (context))
5288 /* Check to see that the declaration is really present, and,
5289 possibly obtain an improved declaration. */
5290 tree fn = check_classfn (context,
5291 new_friend, NULL_TREE);
5301 /* FRIEND_TMPL is a friend TEMPLATE_DECL. ARGS is the vector of
5302 template arguments, as for tsubst.
5304 Returns an appropriate tsubst'd friend type or error_mark_node on
5308 tsubst_friend_class (tree friend_tmpl, tree args)
5314 context = DECL_CONTEXT (friend_tmpl);
5318 if (TREE_CODE (context) == NAMESPACE_DECL)
5319 push_nested_namespace (context);
5321 push_nested_class (tsubst (context, args, tf_none, NULL_TREE));
5324 /* First, we look for a class template. */
5325 tmpl = lookup_name (DECL_NAME (friend_tmpl), /*prefer_type=*/0);
5327 /* But, if we don't find one, it might be because we're in a
5328 situation like this:
5336 Here, in the scope of (say) S<int>, `S' is bound to a TYPE_DECL
5337 for `S<int>', not the TEMPLATE_DECL. */
5338 if (!tmpl || !DECL_CLASS_TEMPLATE_P (tmpl))
5340 tmpl = lookup_name (DECL_NAME (friend_tmpl), /*prefer_type=*/1);
5341 tmpl = maybe_get_template_decl_from_type_decl (tmpl);
5344 if (tmpl && DECL_CLASS_TEMPLATE_P (tmpl))
5346 /* The friend template has already been declared. Just
5347 check to see that the declarations match, and install any new
5348 default parameters. We must tsubst the default parameters,
5349 of course. We only need the innermost template parameters
5350 because that is all that redeclare_class_template will look
5352 if (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (friend_tmpl))
5353 > TMPL_ARGS_DEPTH (args))
5356 parms = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_tmpl),
5357 args, tf_error | tf_warning);
5358 redeclare_class_template (TREE_TYPE (tmpl), parms);
5361 friend_type = TREE_TYPE (tmpl);
5365 /* The friend template has not already been declared. In this
5366 case, the instantiation of the template class will cause the
5367 injection of this template into the global scope. */
5368 tmpl = tsubst (friend_tmpl, args, tf_error | tf_warning, NULL_TREE);
5370 /* The new TMPL is not an instantiation of anything, so we
5371 forget its origins. We don't reset CLASSTYPE_TI_TEMPLATE for
5372 the new type because that is supposed to be the corresponding
5373 template decl, i.e., TMPL. */
5374 DECL_USE_TEMPLATE (tmpl) = 0;
5375 DECL_TEMPLATE_INFO (tmpl) = NULL_TREE;
5376 CLASSTYPE_USE_TEMPLATE (TREE_TYPE (tmpl)) = 0;
5377 CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl))
5378 = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl)));
5380 /* Inject this template into the global scope. */
5381 friend_type = TREE_TYPE (pushdecl_top_level (tmpl));
5386 if (TREE_CODE (context) == NAMESPACE_DECL)
5387 pop_nested_namespace (context);
5389 pop_nested_class ();
5395 /* Returns zero if TYPE cannot be completed later due to circularity.
5396 Otherwise returns one. */
5399 can_complete_type_without_circularity (tree type)
5401 if (type == NULL_TREE || type == error_mark_node)
5403 else if (COMPLETE_TYPE_P (type))
5405 else if (TREE_CODE (type) == ARRAY_TYPE && TYPE_DOMAIN (type))
5406 return can_complete_type_without_circularity (TREE_TYPE (type));
5407 else if (CLASS_TYPE_P (type)
5408 && TYPE_BEING_DEFINED (TYPE_MAIN_VARIANT (type)))
5415 instantiate_class_template (tree type)
5417 tree template, args, pattern, t, member;
5422 if (type == error_mark_node)
5423 return error_mark_node;
5425 if (TYPE_BEING_DEFINED (type)
5426 || COMPLETE_TYPE_P (type)
5427 || dependent_type_p (type))
5430 /* Figure out which template is being instantiated. */
5431 template = most_general_template (CLASSTYPE_TI_TEMPLATE (type));
5432 gcc_assert (TREE_CODE (template) == TEMPLATE_DECL);
5434 /* Figure out which arguments are being used to do the
5436 args = CLASSTYPE_TI_ARGS (type);
5438 /* Determine what specialization of the original template to
5440 t = most_specialized_class (template, args);
5441 if (t == error_mark_node)
5443 const char *str = "candidates are:";
5444 error ("ambiguous class template instantiation for %q#T", type);
5445 for (t = DECL_TEMPLATE_SPECIALIZATIONS (template); t;
5448 if (get_class_bindings (TREE_VALUE (t), TREE_PURPOSE (t), args))
5450 cp_error_at ("%s %+#T", str, TREE_TYPE (t));
5454 TYPE_BEING_DEFINED (type) = 1;
5455 return error_mark_node;
5459 pattern = TREE_TYPE (t);
5461 pattern = TREE_TYPE (template);
5463 /* If the template we're instantiating is incomplete, then clearly
5464 there's nothing we can do. */
5465 if (!COMPLETE_TYPE_P (pattern))
5468 /* If we've recursively instantiated too many templates, stop. */
5469 if (! push_tinst_level (type))
5472 /* Now we're really doing the instantiation. Mark the type as in
5473 the process of being defined. */
5474 TYPE_BEING_DEFINED (type) = 1;
5476 /* We may be in the middle of deferred access check. Disable
5478 push_deferring_access_checks (dk_no_deferred);
5480 push_to_top_level ();
5484 /* This TYPE is actually an instantiation of a partial
5485 specialization. We replace the innermost set of ARGS with
5486 the arguments appropriate for substitution. For example,
5489 template <class T> struct S {};
5490 template <class T> struct S<T*> {};
5492 and supposing that we are instantiating S<int*>, ARGS will
5493 present be {int*} but we need {int}. */
5495 = get_class_bindings (TREE_VALUE (t), TREE_PURPOSE (t),
5498 /* If there were multiple levels in ARGS, replacing the
5499 innermost level would alter CLASSTYPE_TI_ARGS, which we don't
5500 want, so we make a copy first. */
5501 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args))
5503 args = copy_node (args);
5504 SET_TMPL_ARGS_LEVEL (args, TMPL_ARGS_DEPTH (args), inner_args);
5510 SET_CLASSTYPE_INTERFACE_UNKNOWN (type);
5512 /* Set the input location to the template definition. This is needed
5513 if tsubsting causes an error. */
5514 typedecl = TYPE_MAIN_DECL (type);
5515 input_location = DECL_SOURCE_LOCATION (typedecl);
5516 in_system_header = DECL_IN_SYSTEM_HEADER (typedecl);
5518 TYPE_HAS_CONSTRUCTOR (type) = TYPE_HAS_CONSTRUCTOR (pattern);
5519 TYPE_HAS_NEW_OPERATOR (type) = TYPE_HAS_NEW_OPERATOR (pattern);
5520 TYPE_HAS_ARRAY_NEW_OPERATOR (type) = TYPE_HAS_ARRAY_NEW_OPERATOR (pattern);
5521 TYPE_GETS_DELETE (type) = TYPE_GETS_DELETE (pattern);
5522 TYPE_HAS_ASSIGN_REF (type) = TYPE_HAS_ASSIGN_REF (pattern);
5523 TYPE_HAS_CONST_ASSIGN_REF (type) = TYPE_HAS_CONST_ASSIGN_REF (pattern);
5524 TYPE_HAS_INIT_REF (type) = TYPE_HAS_INIT_REF (pattern);
5525 TYPE_HAS_CONST_INIT_REF (type) = TYPE_HAS_CONST_INIT_REF (pattern);
5526 TYPE_HAS_DEFAULT_CONSTRUCTOR (type) = TYPE_HAS_DEFAULT_CONSTRUCTOR (pattern);
5527 TYPE_HAS_CONVERSION (type) = TYPE_HAS_CONVERSION (pattern);
5528 TYPE_PACKED (type) = TYPE_PACKED (pattern);
5529 TYPE_ALIGN (type) = TYPE_ALIGN (pattern);
5530 TYPE_USER_ALIGN (type) = TYPE_USER_ALIGN (pattern);
5531 TYPE_FOR_JAVA (type) = TYPE_FOR_JAVA (pattern); /* For libjava's JArray<T> */
5532 if (ANON_AGGR_TYPE_P (pattern))
5533 SET_ANON_AGGR_TYPE_P (type);
5535 pbinfo = TYPE_BINFO (pattern);
5537 /* We should never instantiate a nested class before its enclosing
5538 class; we need to look up the nested class by name before we can
5539 instantiate it, and that lookup should instantiate the enclosing
5541 gcc_assert (!DECL_CLASS_SCOPE_P (TYPE_MAIN_DECL (pattern))
5542 || COMPLETE_TYPE_P (TYPE_CONTEXT (type))
5543 || TYPE_BEING_DEFINED (TYPE_CONTEXT (type)));
5545 base_list = NULL_TREE;
5546 if (BINFO_N_BASE_BINFOS (pbinfo))
5549 tree context = TYPE_CONTEXT (type);
5553 /* We must enter the scope containing the type, as that is where
5554 the accessibility of types named in dependent bases are
5556 pushed_scope = push_scope (context ? context : global_namespace);
5558 /* Substitute into each of the bases to determine the actual
5560 for (i = 0; BINFO_BASE_ITERATE (pbinfo, i, pbase_binfo); i++)
5563 tree access = BINFO_BASE_ACCESS (pbinfo, i);
5565 /* Substitute to figure out the base class. */
5566 base = tsubst (BINFO_TYPE (pbase_binfo), args, tf_error, NULL_TREE);
5567 if (base == error_mark_node)
5570 base_list = tree_cons (access, base, base_list);
5571 if (BINFO_VIRTUAL_P (pbase_binfo))
5572 TREE_TYPE (base_list) = integer_type_node;
5575 /* The list is now in reverse order; correct that. */
5576 base_list = nreverse (base_list);
5579 pop_scope (pushed_scope);
5581 /* Now call xref_basetypes to set up all the base-class
5583 xref_basetypes (type, base_list);
5586 /* Now that our base classes are set up, enter the scope of the
5587 class, so that name lookups into base classes, etc. will work
5588 correctly. This is precisely analogous to what we do in
5589 begin_class_definition when defining an ordinary non-template
5593 /* Now members are processed in the order of declaration. */
5594 for (member = CLASSTYPE_DECL_LIST (pattern);
5595 member; member = TREE_CHAIN (member))
5597 tree t = TREE_VALUE (member);
5599 if (TREE_PURPOSE (member))
5603 /* Build new CLASSTYPE_NESTED_UTDS. */
5606 tree name = TYPE_IDENTIFIER (tag);
5608 bool class_template_p;
5610 class_template_p = (TREE_CODE (tag) != ENUMERAL_TYPE
5611 && TYPE_LANG_SPECIFIC (tag)
5612 && CLASSTYPE_IS_TEMPLATE (tag));
5613 /* If the member is a class template, then -- even after
5614 substitution -- there may be dependent types in the
5615 template argument list for the class. We increment
5616 PROCESSING_TEMPLATE_DECL so that dependent_type_p, as
5617 that function will assume that no types are dependent
5618 when outside of a template. */
5619 if (class_template_p)
5620 ++processing_template_decl;
5621 newtag = tsubst (tag, args, tf_error, NULL_TREE);
5622 if (class_template_p)
5623 --processing_template_decl;
5624 if (newtag == error_mark_node)
5627 if (TREE_CODE (newtag) != ENUMERAL_TYPE)
5629 if (class_template_p)
5630 /* Unfortunately, lookup_template_class sets
5631 CLASSTYPE_IMPLICIT_INSTANTIATION for a partial
5632 instantiation (i.e., for the type of a member
5633 template class nested within a template class.)
5634 This behavior is required for
5635 maybe_process_partial_specialization to work
5636 correctly, but is not accurate in this case;
5637 the TAG is not an instantiation of anything.
5638 (The corresponding TEMPLATE_DECL is an
5639 instantiation, but the TYPE is not.) */
5640 CLASSTYPE_USE_TEMPLATE (newtag) = 0;
5642 /* Now, we call pushtag to put this NEWTAG into the scope of
5643 TYPE. We first set up the IDENTIFIER_TYPE_VALUE to avoid
5644 pushtag calling push_template_decl. We don't have to do
5645 this for enums because it will already have been done in
5648 SET_IDENTIFIER_TYPE_VALUE (name, newtag);
5649 pushtag (name, newtag, /*tag_scope=*/ts_current);
5652 else if (TREE_CODE (t) == FUNCTION_DECL
5653 || DECL_FUNCTION_TEMPLATE_P (t))
5655 /* Build new TYPE_METHODS. */
5658 if (TREE_CODE (t) == TEMPLATE_DECL)
5659 ++processing_template_decl;
5660 r = tsubst (t, args, tf_error, NULL_TREE);
5661 if (TREE_CODE (t) == TEMPLATE_DECL)
5662 --processing_template_decl;
5663 set_current_access_from_decl (r);
5664 grok_special_member_properties (r);
5665 finish_member_declaration (r);
5669 /* Build new TYPE_FIELDS. */
5671 if (TREE_CODE (t) != CONST_DECL)
5675 /* The the file and line for this declaration, to
5676 assist in error message reporting. Since we
5677 called push_tinst_level above, we don't need to
5679 input_location = DECL_SOURCE_LOCATION (t);
5681 if (TREE_CODE (t) == TEMPLATE_DECL)
5682 ++processing_template_decl;
5683 r = tsubst (t, args, tf_error | tf_warning, NULL_TREE);
5684 if (TREE_CODE (t) == TEMPLATE_DECL)
5685 --processing_template_decl;
5686 if (TREE_CODE (r) == VAR_DECL)
5690 if (DECL_INITIALIZED_IN_CLASS_P (r))
5691 init = tsubst_expr (DECL_INITIAL (t), args,
5692 tf_error | tf_warning, NULL_TREE);
5696 finish_static_data_member_decl
5697 (r, init, /*asmspec_tree=*/NULL_TREE, /*flags=*/0);
5699 if (DECL_INITIALIZED_IN_CLASS_P (r))
5700 check_static_variable_definition (r, TREE_TYPE (r));
5702 else if (TREE_CODE (r) == FIELD_DECL)
5704 /* Determine whether R has a valid type and can be
5705 completed later. If R is invalid, then it is
5706 replaced by error_mark_node so that it will not be
5707 added to TYPE_FIELDS. */
5708 tree rtype = TREE_TYPE (r);
5709 if (can_complete_type_without_circularity (rtype))
5710 complete_type (rtype);
5712 if (!COMPLETE_TYPE_P (rtype))
5714 cxx_incomplete_type_error (r, rtype);
5715 r = error_mark_node;
5719 /* If it is a TYPE_DECL for a class-scoped ENUMERAL_TYPE,
5720 such a thing will already have been added to the field
5721 list by tsubst_enum in finish_member_declaration in the
5722 CLASSTYPE_NESTED_UTDS case above. */
5723 if (!(TREE_CODE (r) == TYPE_DECL
5724 && TREE_CODE (TREE_TYPE (r)) == ENUMERAL_TYPE
5725 && DECL_ARTIFICIAL (r)))
5727 set_current_access_from_decl (r);
5728 finish_member_declaration (r);
5735 if (TYPE_P (t) || DECL_CLASS_TEMPLATE_P (t))
5737 /* Build new CLASSTYPE_FRIEND_CLASSES. */
5739 tree friend_type = t;
5740 bool adjust_processing_template_decl = false;
5742 if (TREE_CODE (friend_type) == TEMPLATE_DECL)
5744 /* template <class T> friend class C; */
5745 friend_type = tsubst_friend_class (friend_type, args);
5746 adjust_processing_template_decl = true;
5748 else if (TREE_CODE (friend_type) == UNBOUND_CLASS_TEMPLATE)
5750 /* template <class T> friend class C::D; */
5751 friend_type = tsubst (friend_type, args,
5752 tf_error | tf_warning, NULL_TREE);
5753 if (TREE_CODE (friend_type) == TEMPLATE_DECL)
5754 friend_type = TREE_TYPE (friend_type);
5755 adjust_processing_template_decl = true;
5757 else if (TREE_CODE (friend_type) == TYPENAME_TYPE)
5759 /* This could be either
5763 when dependent_type_p is false or
5765 template <class U> friend class T::C;
5768 friend_type = tsubst (friend_type, args,
5769 tf_error | tf_warning, NULL_TREE);
5770 /* Bump processing_template_decl for correct
5771 dependent_type_p calculation. */
5772 ++processing_template_decl;
5773 if (dependent_type_p (friend_type))
5774 adjust_processing_template_decl = true;
5775 --processing_template_decl;
5777 else if (!CLASSTYPE_USE_TEMPLATE (friend_type)
5778 && hidden_name_p (TYPE_NAME (friend_type)))
5782 where C hasn't been declared yet. Let's lookup name
5783 from namespace scope directly, bypassing any name that
5784 come from dependent base class. */
5785 tree ns = decl_namespace_context (TYPE_MAIN_DECL (friend_type));
5787 /* The call to xref_tag_from_type does injection for friend
5789 push_nested_namespace (ns);
5791 xref_tag_from_type (friend_type, NULL_TREE,
5792 /*tag_scope=*/ts_current);
5793 pop_nested_namespace (ns);
5795 else if (uses_template_parms (friend_type))
5796 /* friend class C<T>; */
5797 friend_type = tsubst (friend_type, args,
5798 tf_error | tf_warning, NULL_TREE);
5803 where C is already declared or
5805 friend class C<int>;
5807 We don't have to do anything in these cases. */
5809 if (adjust_processing_template_decl)
5810 /* Trick make_friend_class into realizing that the friend
5811 we're adding is a template, not an ordinary class. It's
5812 important that we use make_friend_class since it will
5813 perform some error-checking and output cross-reference
5815 ++processing_template_decl;
5817 if (friend_type != error_mark_node)
5818 make_friend_class (type, friend_type, /*complain=*/false);
5820 if (adjust_processing_template_decl)
5821 --processing_template_decl;
5825 /* Build new DECL_FRIENDLIST. */
5828 /* The the file and line for this declaration, to
5829 assist in error message reporting. Since we
5830 called push_tinst_level above, we don't need to
5832 input_location = DECL_SOURCE_LOCATION (t);
5834 if (TREE_CODE (t) == TEMPLATE_DECL)
5836 ++processing_template_decl;
5837 push_deferring_access_checks (dk_no_check);
5840 r = tsubst_friend_function (t, args);
5841 add_friend (type, r, /*complain=*/false);
5842 if (TREE_CODE (t) == TEMPLATE_DECL)
5844 pop_deferring_access_checks ();
5845 --processing_template_decl;
5851 /* Set the file and line number information to whatever is given for
5852 the class itself. This puts error messages involving generated
5853 implicit functions at a predictable point, and the same point
5854 that would be used for non-template classes. */
5855 input_location = DECL_SOURCE_LOCATION (typedecl);
5857 unreverse_member_declarations (type);
5858 finish_struct_1 (type);
5859 TYPE_BEING_DEFINED (type) = 0;
5861 /* Now that the class is complete, instantiate default arguments for
5862 any member functions. We don't do this earlier because the
5863 default arguments may reference members of the class. */
5864 if (!PRIMARY_TEMPLATE_P (template))
5865 for (t = TYPE_METHODS (type); t; t = TREE_CHAIN (t))
5866 if (TREE_CODE (t) == FUNCTION_DECL
5867 /* Implicitly generated member functions will not have template
5868 information; they are not instantiations, but instead are
5869 created "fresh" for each instantiation. */
5870 && DECL_TEMPLATE_INFO (t))
5871 tsubst_default_arguments (t);
5874 pop_from_top_level ();
5875 pop_deferring_access_checks ();
5878 /* The vtable for a template class can be emitted in any translation
5879 unit in which the class is instantiated. When there is no key
5880 method, however, finish_struct_1 will already have added TYPE to
5881 the keyed_classes list. */
5882 if (TYPE_CONTAINS_VPTR_P (type) && CLASSTYPE_KEY_METHOD (type))
5883 keyed_classes = tree_cons (NULL_TREE, type, keyed_classes);
5889 tsubst_template_arg (tree t, tree args, tsubst_flags_t complain, tree in_decl)
5895 else if (TYPE_P (t))
5896 r = tsubst (t, args, complain, in_decl);
5899 r = tsubst_expr (t, args, complain, in_decl);
5901 if (!uses_template_parms (r))
5903 /* Sometimes, one of the args was an expression involving a
5904 template constant parameter, like N - 1. Now that we've
5905 tsubst'd, we might have something like 2 - 1. This will
5906 confuse lookup_template_class, so we do constant folding
5907 here. We have to unset processing_template_decl, to fool
5908 tsubst_copy_and_build() into building an actual tree. */
5910 /* If the TREE_TYPE of ARG is not NULL_TREE, ARG is already
5911 as simple as it's going to get, and trying to reprocess
5912 the trees will break. Once tsubst_expr et al DTRT for
5913 non-dependent exprs, this code can go away, as the type
5914 will always be set. */
5917 int saved_processing_template_decl = processing_template_decl;
5918 processing_template_decl = 0;
5919 r = tsubst_copy_and_build (r, /*args=*/NULL_TREE,
5920 tf_error, /*in_decl=*/NULL_TREE,
5921 /*function_p=*/false);
5922 processing_template_decl = saved_processing_template_decl;
5930 /* Substitute ARGS into the vector or list of template arguments T. */
5933 tsubst_template_args (tree t, tree args, tsubst_flags_t complain, tree in_decl)
5935 int len = TREE_VEC_LENGTH (t);
5936 int need_new = 0, i;
5937 tree *elts = alloca (len * sizeof (tree));
5939 for (i = 0; i < len; i++)
5941 tree orig_arg = TREE_VEC_ELT (t, i);
5944 if (TREE_CODE (orig_arg) == TREE_VEC)
5945 new_arg = tsubst_template_args (orig_arg, args, complain, in_decl);
5947 new_arg = tsubst_template_arg (orig_arg, args, complain, in_decl);
5949 if (new_arg == error_mark_node)
5950 return error_mark_node;
5953 if (new_arg != orig_arg)
5960 t = make_tree_vec (len);
5961 for (i = 0; i < len; i++)
5962 TREE_VEC_ELT (t, i) = elts[i];
5967 /* Return the result of substituting ARGS into the template parameters
5968 given by PARMS. If there are m levels of ARGS and m + n levels of
5969 PARMS, then the result will contain n levels of PARMS. For
5970 example, if PARMS is `template <class T> template <class U>
5971 template <T*, U, class V>' and ARGS is {{int}, {double}} then the
5972 result will be `template <int*, double, class V>'. */
5975 tsubst_template_parms (tree parms, tree args, tsubst_flags_t complain)
5980 for (new_parms = &r;
5981 TMPL_PARMS_DEPTH (parms) > TMPL_ARGS_DEPTH (args);
5982 new_parms = &(TREE_CHAIN (*new_parms)),
5983 parms = TREE_CHAIN (parms))
5986 make_tree_vec (TREE_VEC_LENGTH (TREE_VALUE (parms)));
5989 for (i = 0; i < TREE_VEC_LENGTH (new_vec); ++i)
5991 tree tuple = TREE_VEC_ELT (TREE_VALUE (parms), i);
5992 tree default_value = TREE_PURPOSE (tuple);
5993 tree parm_decl = TREE_VALUE (tuple);
5995 parm_decl = tsubst (parm_decl, args, complain, NULL_TREE);
5996 default_value = tsubst_template_arg (default_value, args,
5997 complain, NULL_TREE);
5999 tuple = build_tree_list (default_value, parm_decl);
6000 TREE_VEC_ELT (new_vec, i) = tuple;
6004 tree_cons (size_int (TMPL_PARMS_DEPTH (parms)
6005 - TMPL_ARGS_DEPTH (args)),
6006 new_vec, NULL_TREE);
6012 /* Substitute the ARGS into the indicated aggregate (or enumeration)
6013 type T. If T is not an aggregate or enumeration type, it is
6014 handled as if by tsubst. IN_DECL is as for tsubst. If
6015 ENTERING_SCOPE is nonzero, T is the context for a template which
6016 we are presently tsubst'ing. Return the substituted value. */
6019 tsubst_aggr_type (tree t,
6021 tsubst_flags_t complain,
6028 switch (TREE_CODE (t))
6031 if (TYPE_PTRMEMFUNC_P (t))
6032 return tsubst (TYPE_PTRMEMFUNC_FN_TYPE (t), args, complain, in_decl);
6034 /* Else fall through. */
6037 if (TYPE_TEMPLATE_INFO (t))
6043 /* First, determine the context for the type we are looking
6045 context = TYPE_CONTEXT (t);
6047 context = tsubst_aggr_type (context, args, complain,
6048 in_decl, /*entering_scope=*/1);
6050 /* Then, figure out what arguments are appropriate for the
6051 type we are trying to find. For example, given:
6053 template <class T> struct S;
6054 template <class T, class U> void f(T, U) { S<U> su; }
6056 and supposing that we are instantiating f<int, double>,
6057 then our ARGS will be {int, double}, but, when looking up
6058 S we only want {double}. */
6059 argvec = tsubst_template_args (TYPE_TI_ARGS (t), args,
6061 if (argvec == error_mark_node)
6062 return error_mark_node;
6064 r = lookup_template_class (t, argvec, in_decl, context,
6065 entering_scope, complain);
6067 return cp_build_qualified_type_real (r, TYPE_QUALS (t), complain);
6070 /* This is not a template type, so there's nothing to do. */
6074 return tsubst (t, args, complain, in_decl);
6078 /* Substitute into the default argument ARG (a default argument for
6079 FN), which has the indicated TYPE. */
6082 tsubst_default_argument (tree fn, tree type, tree arg)
6084 tree saved_class_ptr = NULL_TREE;
6085 tree saved_class_ref = NULL_TREE;
6087 /* This default argument came from a template. Instantiate the
6088 default argument here, not in tsubst. In the case of
6097 we must be careful to do name lookup in the scope of S<T>,
6098 rather than in the current class. */
6099 push_access_scope (fn);
6100 /* The default argument expression should not be considered to be
6101 within the scope of FN. Since push_access_scope sets
6102 current_function_decl, we must explicitly clear it here. */
6103 current_function_decl = NULL_TREE;
6104 /* The "this" pointer is not valid in a default argument. */
6107 saved_class_ptr = current_class_ptr;
6108 cp_function_chain->x_current_class_ptr = NULL_TREE;
6109 saved_class_ref = current_class_ref;
6110 cp_function_chain->x_current_class_ref = NULL_TREE;
6113 push_deferring_access_checks(dk_no_deferred);
6114 arg = tsubst_expr (arg, DECL_TI_ARGS (fn),
6115 tf_error | tf_warning, NULL_TREE);
6116 pop_deferring_access_checks();
6118 /* Restore the "this" pointer. */
6121 cp_function_chain->x_current_class_ptr = saved_class_ptr;
6122 cp_function_chain->x_current_class_ref = saved_class_ref;
6125 pop_access_scope (fn);
6127 /* Make sure the default argument is reasonable. */
6128 arg = check_default_argument (type, arg);
6133 /* Substitute into all the default arguments for FN. */
6136 tsubst_default_arguments (tree fn)
6141 tmpl_args = DECL_TI_ARGS (fn);
6143 /* If this function is not yet instantiated, we certainly don't need
6144 its default arguments. */
6145 if (uses_template_parms (tmpl_args))
6148 for (arg = TYPE_ARG_TYPES (TREE_TYPE (fn));
6150 arg = TREE_CHAIN (arg))
6151 if (TREE_PURPOSE (arg))
6152 TREE_PURPOSE (arg) = tsubst_default_argument (fn,
6154 TREE_PURPOSE (arg));
6157 /* Substitute the ARGS into the T, which is a _DECL. Return the
6158 result of the substitution. Issue error and warning messages under
6159 control of COMPLAIN. */
6162 tsubst_decl (tree t, tree args, tsubst_flags_t complain)
6164 location_t saved_loc;
6168 /* Set the filename and linenumber to improve error-reporting. */
6169 saved_loc = input_location;
6170 input_location = DECL_SOURCE_LOCATION (t);
6172 switch (TREE_CODE (t))
6176 /* We can get here when processing a member function template,
6177 member class template, and template template parameter of
6178 a template class. */
6179 tree decl = DECL_TEMPLATE_RESULT (t);
6184 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t))
6186 /* Template template parameter is treated here. */
6187 tree new_type = tsubst (TREE_TYPE (t), args, complain, in_decl);
6188 if (new_type == error_mark_node)
6189 return error_mark_node;
6192 TREE_CHAIN (r) = NULL_TREE;
6193 TREE_TYPE (r) = new_type;
6194 DECL_TEMPLATE_RESULT (r)
6195 = build_decl (TYPE_DECL, DECL_NAME (decl), new_type);
6196 DECL_TEMPLATE_PARMS (r)
6197 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t), args,
6199 TYPE_NAME (new_type) = r;
6203 /* We might already have an instance of this template.
6204 The ARGS are for the surrounding class type, so the
6205 full args contain the tsubst'd args for the context,
6206 plus the innermost args from the template decl. */
6207 tmpl_args = DECL_CLASS_TEMPLATE_P (t)
6208 ? CLASSTYPE_TI_ARGS (TREE_TYPE (t))
6209 : DECL_TI_ARGS (DECL_TEMPLATE_RESULT (t));
6210 full_args = tsubst_template_args (tmpl_args, args,
6213 /* tsubst_template_args doesn't copy the vector if
6214 nothing changed. But, *something* should have
6216 gcc_assert (full_args != tmpl_args);
6218 spec = retrieve_specialization (t, full_args,
6219 /*class_specializations_p=*/true);
6220 if (spec != NULL_TREE)
6226 /* Make a new template decl. It will be similar to the
6227 original, but will record the current template arguments.
6228 We also create a new function declaration, which is just
6229 like the old one, but points to this new template, rather
6230 than the old one. */
6232 gcc_assert (DECL_LANG_SPECIFIC (r) != 0);
6233 TREE_CHAIN (r) = NULL_TREE;
6236 = tsubst_aggr_type (DECL_CONTEXT (t), args,
6238 /*entering_scope=*/1);
6239 DECL_TEMPLATE_INFO (r) = build_tree_list (t, args);
6241 if (TREE_CODE (decl) == TYPE_DECL)
6243 tree new_type = tsubst (TREE_TYPE (t), args, complain, in_decl);
6244 if (new_type == error_mark_node)
6245 return error_mark_node;
6247 TREE_TYPE (r) = new_type;
6248 CLASSTYPE_TI_TEMPLATE (new_type) = r;
6249 DECL_TEMPLATE_RESULT (r) = TYPE_MAIN_DECL (new_type);
6250 DECL_TI_ARGS (r) = CLASSTYPE_TI_ARGS (new_type);
6254 tree new_decl = tsubst (decl, args, complain, in_decl);
6255 if (new_decl == error_mark_node)
6256 return error_mark_node;
6258 DECL_TEMPLATE_RESULT (r) = new_decl;
6259 DECL_TI_TEMPLATE (new_decl) = r;
6260 TREE_TYPE (r) = TREE_TYPE (new_decl);
6261 DECL_TI_ARGS (r) = DECL_TI_ARGS (new_decl);
6264 SET_DECL_IMPLICIT_INSTANTIATION (r);
6265 DECL_TEMPLATE_INSTANTIATIONS (r) = NULL_TREE;
6266 DECL_TEMPLATE_SPECIALIZATIONS (r) = NULL_TREE;
6268 /* The template parameters for this new template are all the
6269 template parameters for the old template, except the
6270 outermost level of parameters. */
6271 DECL_TEMPLATE_PARMS (r)
6272 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t), args,
6275 if (PRIMARY_TEMPLATE_P (t))
6276 DECL_PRIMARY_TEMPLATE (r) = r;
6278 if (TREE_CODE (decl) != TYPE_DECL)
6279 /* Record this non-type partial instantiation. */
6280 register_specialization (r, t,
6281 DECL_TI_ARGS (DECL_TEMPLATE_RESULT (r)));
6288 tree argvec = NULL_TREE;
6296 /* Nobody should be tsubst'ing into non-template functions. */
6297 gcc_assert (DECL_TEMPLATE_INFO (t) != NULL_TREE);
6299 if (TREE_CODE (DECL_TI_TEMPLATE (t)) == TEMPLATE_DECL)
6304 /* If T is not dependent, just return it. We have to
6305 increment PROCESSING_TEMPLATE_DECL because
6306 value_dependent_expression_p assumes that nothing is
6307 dependent when PROCESSING_TEMPLATE_DECL is zero. */
6308 ++processing_template_decl;
6309 dependent_p = value_dependent_expression_p (t);
6310 --processing_template_decl;
6314 /* Calculate the most general template of which R is a
6315 specialization, and the complete set of arguments used to
6317 gen_tmpl = most_general_template (DECL_TI_TEMPLATE (t));
6318 argvec = tsubst_template_args (DECL_TI_ARGS
6319 (DECL_TEMPLATE_RESULT (gen_tmpl)),
6320 args, complain, in_decl);
6322 /* Check to see if we already have this specialization. */
6323 spec = retrieve_specialization (gen_tmpl, argvec,
6324 /*class_specializations_p=*/false);
6332 /* We can see more levels of arguments than parameters if
6333 there was a specialization of a member template, like
6336 template <class T> struct S { template <class U> void f(); }
6337 template <> template <class U> void S<int>::f(U);
6339 Here, we'll be substituting into the specialization,
6340 because that's where we can find the code we actually
6341 want to generate, but we'll have enough arguments for
6342 the most general template.
6344 We also deal with the peculiar case:
6346 template <class T> struct S {
6347 template <class U> friend void f();
6349 template <class U> void f() {}
6351 template void f<double>();
6353 Here, the ARGS for the instantiation of will be {int,
6354 double}. But, we only need as many ARGS as there are
6355 levels of template parameters in CODE_PATTERN. We are
6356 careful not to get fooled into reducing the ARGS in
6359 template <class T> struct S { template <class U> void f(U); }
6360 template <class T> template <> void S<T>::f(int) {}
6362 which we can spot because the pattern will be a
6363 specialization in this case. */
6364 args_depth = TMPL_ARGS_DEPTH (args);
6366 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (t)));
6367 if (args_depth > parms_depth
6368 && !DECL_TEMPLATE_SPECIALIZATION (t))
6369 args = get_innermost_template_args (args, parms_depth);
6373 /* This special case arises when we have something like this:
6375 template <class T> struct S {
6376 friend void f<int>(int, double);
6379 Here, the DECL_TI_TEMPLATE for the friend declaration
6380 will be an IDENTIFIER_NODE. We are being called from
6381 tsubst_friend_function, and we want only to create a
6382 new decl (R) with appropriate types so that we can call
6383 determine_specialization. */
6384 gen_tmpl = NULL_TREE;
6387 if (DECL_CLASS_SCOPE_P (t))
6389 if (DECL_NAME (t) == constructor_name (DECL_CONTEXT (t)))
6393 ctx = tsubst_aggr_type (DECL_CONTEXT (t), args,
6394 complain, t, /*entering_scope=*/1);
6399 ctx = DECL_CONTEXT (t);
6401 type = tsubst (TREE_TYPE (t), args, complain, in_decl);
6402 if (type == error_mark_node)
6403 return error_mark_node;
6405 /* We do NOT check for matching decls pushed separately at this
6406 point, as they may not represent instantiations of this
6407 template, and in any case are considered separate under the
6410 DECL_USE_TEMPLATE (r) = 0;
6411 TREE_TYPE (r) = type;
6412 /* Clear out the mangled name and RTL for the instantiation. */
6413 SET_DECL_ASSEMBLER_NAME (r, NULL_TREE);
6414 SET_DECL_RTL (r, NULL_RTX);
6415 DECL_INITIAL (r) = NULL_TREE;
6416 DECL_CONTEXT (r) = ctx;
6418 if (member && DECL_CONV_FN_P (r))
6419 /* Type-conversion operator. Reconstruct the name, in
6420 case it's the name of one of the template's parameters. */
6421 DECL_NAME (r) = mangle_conv_op_name_for_type (TREE_TYPE (type));
6423 DECL_ARGUMENTS (r) = tsubst (DECL_ARGUMENTS (t), args,
6425 DECL_RESULT (r) = NULL_TREE;
6427 TREE_STATIC (r) = 0;
6428 TREE_PUBLIC (r) = TREE_PUBLIC (t);
6429 DECL_EXTERNAL (r) = 1;
6430 /* If this is an instantiation of a function with internal
6431 linkage, we already know what object file linkage will be
6432 assigned to the instantiation. */
6433 DECL_INTERFACE_KNOWN (r) = !TREE_PUBLIC (r);
6434 DECL_DEFER_OUTPUT (r) = 0;
6435 TREE_CHAIN (r) = NULL_TREE;
6436 DECL_PENDING_INLINE_INFO (r) = 0;
6437 DECL_PENDING_INLINE_P (r) = 0;
6438 DECL_SAVED_TREE (r) = NULL_TREE;
6440 if (DECL_CLONED_FUNCTION (r))
6442 DECL_CLONED_FUNCTION (r) = tsubst (DECL_CLONED_FUNCTION (t),
6444 TREE_CHAIN (r) = TREE_CHAIN (DECL_CLONED_FUNCTION (r));
6445 TREE_CHAIN (DECL_CLONED_FUNCTION (r)) = r;
6448 /* Set up the DECL_TEMPLATE_INFO for R. There's no need to do
6449 this in the special friend case mentioned above where
6450 GEN_TMPL is NULL. */
6453 DECL_TEMPLATE_INFO (r)
6454 = tree_cons (gen_tmpl, argvec, NULL_TREE);
6455 SET_DECL_IMPLICIT_INSTANTIATION (r);
6456 register_specialization (r, gen_tmpl, argvec);
6458 /* We're not supposed to instantiate default arguments
6459 until they are called, for a template. But, for a
6462 template <class T> void f ()
6463 { extern void g(int i = T()); }
6465 we should do the substitution when the template is
6466 instantiated. We handle the member function case in
6467 instantiate_class_template since the default arguments
6468 might refer to other members of the class. */
6470 && !PRIMARY_TEMPLATE_P (gen_tmpl)
6471 && !uses_template_parms (argvec))
6472 tsubst_default_arguments (r);
6475 /* Copy the list of befriending classes. */
6476 for (friends = &DECL_BEFRIENDING_CLASSES (r);
6478 friends = &TREE_CHAIN (*friends))
6480 *friends = copy_node (*friends);
6481 TREE_VALUE (*friends) = tsubst (TREE_VALUE (*friends),
6486 if (DECL_CONSTRUCTOR_P (r) || DECL_DESTRUCTOR_P (r))
6488 maybe_retrofit_in_chrg (r);
6489 if (DECL_CONSTRUCTOR_P (r))
6490 grok_ctor_properties (ctx, r);
6491 /* If this is an instantiation of a member template, clone it.
6492 If it isn't, that'll be handled by
6493 clone_constructors_and_destructors. */
6494 if (PRIMARY_TEMPLATE_P (gen_tmpl))
6495 clone_function_decl (r, /*update_method_vec_p=*/0);
6497 else if (IDENTIFIER_OPNAME_P (DECL_NAME (r)))
6498 grok_op_properties (r, DECL_FRIEND_P (r),
6499 (complain & tf_error) != 0);
6501 if (DECL_FRIEND_P (t) && DECL_FRIEND_CONTEXT (t))
6502 SET_DECL_FRIEND_CONTEXT (r,
6503 tsubst (DECL_FRIEND_CONTEXT (t),
6504 args, complain, in_decl));
6513 if (DECL_TEMPLATE_PARM_P (t))
6514 SET_DECL_TEMPLATE_PARM_P (r);
6516 type = tsubst (TREE_TYPE (t), args, complain, in_decl);
6517 type = type_decays_to (type);
6518 TREE_TYPE (r) = type;
6519 cp_apply_type_quals_to_decl (cp_type_quals (type), r);
6521 if (DECL_INITIAL (r))
6523 if (TREE_CODE (DECL_INITIAL (r)) != TEMPLATE_PARM_INDEX)
6524 DECL_INITIAL (r) = TREE_TYPE (r);
6526 DECL_INITIAL (r) = tsubst (DECL_INITIAL (r), args,
6530 DECL_CONTEXT (r) = NULL_TREE;
6532 if (!DECL_TEMPLATE_PARM_P (r))
6533 DECL_ARG_TYPE (r) = type_passed_as (type);
6535 TREE_CHAIN (r) = tsubst (TREE_CHAIN (t), args,
6536 complain, TREE_CHAIN (t));
6545 type = tsubst (TREE_TYPE (t), args, complain, in_decl);
6546 if (type == error_mark_node)
6547 return error_mark_node;
6548 TREE_TYPE (r) = type;
6549 cp_apply_type_quals_to_decl (cp_type_quals (type), r);
6551 /* We don't have to set DECL_CONTEXT here; it is set by
6552 finish_member_declaration. */
6553 DECL_INITIAL (r) = tsubst_expr (DECL_INITIAL (t), args,
6555 TREE_CHAIN (r) = NULL_TREE;
6556 if (VOID_TYPE_P (type))
6557 cp_error_at ("instantiation of %qD as type %qT", r, type);
6564 /* It is not a dependent using decl any more. */
6565 TREE_TYPE (r) = void_type_node;
6567 = tsubst_copy (DECL_INITIAL (t), args, complain, in_decl);
6569 = tsubst_copy (DECL_NAME (t), args, complain, in_decl);
6570 TREE_CHAIN (r) = NULL_TREE;
6577 tree argvec = NULL_TREE;
6578 tree gen_tmpl = NULL_TREE;
6580 tree tmpl = NULL_TREE;
6582 tree type = NULL_TREE;
6585 if (TREE_CODE (t) == TYPE_DECL)
6587 type = tsubst (TREE_TYPE (t), args, complain, in_decl);
6588 if (TREE_CODE (type) == TEMPLATE_TEMPLATE_PARM
6589 || t == TYPE_MAIN_DECL (TREE_TYPE (t)))
6591 /* If this is the canonical decl, we don't have to
6592 mess with instantiations, and often we can't (for
6593 typename, template type parms and such). Note that
6594 TYPE_NAME is not correct for the above test if
6595 we've copied the type for a typedef. */
6596 r = TYPE_NAME (type);
6601 /* Assume this is a non-local variable. */
6604 if (TYPE_P (CP_DECL_CONTEXT (t)))
6605 ctx = tsubst_aggr_type (DECL_CONTEXT (t), args,
6607 in_decl, /*entering_scope=*/1);
6608 else if (DECL_NAMESPACE_SCOPE_P (t))
6609 ctx = DECL_CONTEXT (t);
6612 /* Subsequent calls to pushdecl will fill this in. */
6617 /* Check to see if we already have this specialization. */
6620 tmpl = DECL_TI_TEMPLATE (t);
6621 gen_tmpl = most_general_template (tmpl);
6622 argvec = tsubst (DECL_TI_ARGS (t), args, complain, in_decl);
6623 spec = retrieve_specialization (gen_tmpl, argvec,
6624 /*class_specializations_p=*/false);
6627 spec = retrieve_local_specialization (t);
6636 if (TREE_CODE (r) == VAR_DECL)
6638 type = tsubst (TREE_TYPE (t), args, complain, in_decl);
6639 if (type == error_mark_node)
6640 return error_mark_node;
6641 type = complete_type (type);
6642 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (r)
6643 = DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (t);
6644 type = check_var_type (DECL_NAME (r), type);
6646 else if (DECL_SELF_REFERENCE_P (t))
6647 SET_DECL_SELF_REFERENCE_P (r);
6648 TREE_TYPE (r) = type;
6649 cp_apply_type_quals_to_decl (cp_type_quals (type), r);
6650 DECL_CONTEXT (r) = ctx;
6651 /* Clear out the mangled name and RTL for the instantiation. */
6652 SET_DECL_ASSEMBLER_NAME (r, NULL_TREE);
6653 SET_DECL_RTL (r, NULL_RTX);
6655 /* Don't try to expand the initializer until someone tries to use
6656 this variable; otherwise we run into circular dependencies. */
6657 DECL_INITIAL (r) = NULL_TREE;
6658 SET_DECL_RTL (r, NULL_RTX);
6659 DECL_SIZE (r) = DECL_SIZE_UNIT (r) = 0;
6661 /* Even if the original location is out of scope, the newly
6662 substituted one is not. */
6663 if (TREE_CODE (r) == VAR_DECL)
6665 DECL_DEAD_FOR_LOCAL (r) = 0;
6666 DECL_INITIALIZED_P (r) = 0;
6671 /* A static data member declaration is always marked
6672 external when it is declared in-class, even if an
6673 initializer is present. We mimic the non-template
6675 DECL_EXTERNAL (r) = 1;
6677 register_specialization (r, gen_tmpl, argvec);
6678 DECL_TEMPLATE_INFO (r) = tree_cons (tmpl, argvec, NULL_TREE);
6679 SET_DECL_IMPLICIT_INSTANTIATION (r);
6682 register_local_specialization (r, t);
6684 TREE_CHAIN (r) = NULL_TREE;
6693 /* Restore the file and line information. */
6694 input_location = saved_loc;
6699 /* Substitute into the ARG_TYPES of a function type. */
6702 tsubst_arg_types (tree arg_types,
6704 tsubst_flags_t complain,
6707 tree remaining_arg_types;
6710 if (!arg_types || arg_types == void_list_node)
6713 remaining_arg_types = tsubst_arg_types (TREE_CHAIN (arg_types),
6714 args, complain, in_decl);
6715 if (remaining_arg_types == error_mark_node)
6716 return error_mark_node;
6718 type = tsubst (TREE_VALUE (arg_types), args, complain, in_decl);
6719 if (type == error_mark_node)
6720 return error_mark_node;
6721 if (VOID_TYPE_P (type))
6723 if (complain & tf_error)
6725 error ("invalid parameter type %qT", type);
6727 cp_error_at ("in declaration %qD", in_decl);
6729 return error_mark_node;
6732 /* Do array-to-pointer, function-to-pointer conversion, and ignore
6733 top-level qualifiers as required. */
6734 type = TYPE_MAIN_VARIANT (type_decays_to (type));
6736 /* Note that we do not substitute into default arguments here. The
6737 standard mandates that they be instantiated only when needed,
6738 which is done in build_over_call. */
6739 return hash_tree_cons (TREE_PURPOSE (arg_types), type,
6740 remaining_arg_types);
6744 /* Substitute into a FUNCTION_TYPE or METHOD_TYPE. This routine does
6745 *not* handle the exception-specification for FNTYPE, because the
6746 initial substitution of explicitly provided template parameters
6747 during argument deduction forbids substitution into the
6748 exception-specification:
6752 All references in the function type of the function template to the
6753 corresponding template parameters are replaced by the specified tem-
6754 plate argument values. If a substitution in a template parameter or
6755 in the function type of the function template results in an invalid
6756 type, type deduction fails. [Note: The equivalent substitution in
6757 exception specifications is done only when the function is instanti-
6758 ated, at which point a program is ill-formed if the substitution
6759 results in an invalid type.] */
6762 tsubst_function_type (tree t,
6764 tsubst_flags_t complain,
6771 /* The TYPE_CONTEXT is not used for function/method types. */
6772 gcc_assert (TYPE_CONTEXT (t) == NULL_TREE);
6774 /* Substitute the return type. */
6775 return_type = tsubst (TREE_TYPE (t), args, complain, in_decl);
6776 if (return_type == error_mark_node)
6777 return error_mark_node;
6778 /* The standard does not presently indicate that creation of a
6779 function type with an invalid return type is a deduction failure.
6780 However, that is clearly analogous to creating an array of "void"
6781 or a reference to a reference. This is core issue #486. */
6782 if (TREE_CODE (return_type) == ARRAY_TYPE
6783 || TREE_CODE (return_type) == FUNCTION_TYPE)
6785 if (complain & tf_error)
6787 if (TREE_CODE (return_type) == ARRAY_TYPE)
6788 error ("function returning an array");
6790 error ("function returning a function");
6792 return error_mark_node;
6795 /* Substitute the argument types. */
6796 arg_types = tsubst_arg_types (TYPE_ARG_TYPES (t), args,
6798 if (arg_types == error_mark_node)
6799 return error_mark_node;
6801 /* Construct a new type node and return it. */
6802 if (TREE_CODE (t) == FUNCTION_TYPE)
6803 fntype = build_function_type (return_type, arg_types);
6806 tree r = TREE_TYPE (TREE_VALUE (arg_types));
6807 if (! IS_AGGR_TYPE (r))
6811 Type deduction may fail for any of the following
6814 -- Attempting to create "pointer to member of T" when T
6815 is not a class type. */
6816 if (complain & tf_error)
6817 error ("creating pointer to member function of non-class type %qT",
6819 return error_mark_node;
6822 fntype = build_method_type_directly (r, return_type,
6823 TREE_CHAIN (arg_types));
6825 fntype = cp_build_qualified_type_real (fntype, TYPE_QUALS (t), complain);
6826 fntype = cp_build_type_attribute_variant (fntype, TYPE_ATTRIBUTES (t));
6831 /* FNTYPE is a FUNCTION_TYPE or METHOD_TYPE. Substitute the template
6832 ARGS into that specification, and return the substituted
6833 specification. If there is no specification, return NULL_TREE. */
6836 tsubst_exception_specification (tree fntype,
6838 tsubst_flags_t complain,
6844 specs = TYPE_RAISES_EXCEPTIONS (fntype);
6845 new_specs = NULL_TREE;
6848 if (! TREE_VALUE (specs))
6854 spec = tsubst (TREE_VALUE (specs), args, complain, in_decl);
6855 if (spec == error_mark_node)
6857 new_specs = add_exception_specifier (new_specs, spec, complain);
6858 specs = TREE_CHAIN (specs);
6864 /* Substitute into the PARMS of a call-declarator. */
6867 tsubst_call_declarator_parms (tree parms,
6869 tsubst_flags_t complain,
6876 if (!parms || parms == void_list_node)
6879 new_parms = tsubst_call_declarator_parms (TREE_CHAIN (parms),
6880 args, complain, in_decl);
6882 /* Figure out the type of this parameter. */
6883 type = tsubst (TREE_VALUE (parms), args, complain, in_decl);
6885 /* Figure out the default argument as well. Note that we use
6886 tsubst_expr since the default argument is really an expression. */
6887 defarg = tsubst_expr (TREE_PURPOSE (parms), args, complain, in_decl);
6889 /* Chain this parameter on to the front of those we have already
6890 processed. We don't use hash_tree_cons because that function
6891 doesn't check TREE_PARMLIST. */
6892 new_parms = tree_cons (defarg, type, new_parms);
6897 /* Take the tree structure T and replace template parameters used
6898 therein with the argument vector ARGS. IN_DECL is an associated
6899 decl for diagnostics. If an error occurs, returns ERROR_MARK_NODE.
6900 Issue error and warning messages under control of COMPLAIN. Note
6901 that we must be relatively non-tolerant of extensions here, in
6902 order to preserve conformance; if we allow substitutions that
6903 should not be allowed, we may allow argument deductions that should
6904 not succeed, and therefore report ambiguous overload situations
6905 where there are none. In theory, we could allow the substitution,
6906 but indicate that it should have failed, and allow our caller to
6907 make sure that the right thing happens, but we don't try to do this
6910 This function is used for dealing with types, decls and the like;
6911 for expressions, use tsubst_expr or tsubst_copy. */
6914 tsubst (tree t, tree args, tsubst_flags_t complain, tree in_decl)
6918 if (t == NULL_TREE || t == error_mark_node
6919 || t == integer_type_node
6920 || t == void_type_node
6921 || t == char_type_node
6922 || t == unknown_type_node
6923 || TREE_CODE (t) == NAMESPACE_DECL)
6927 return tsubst_decl (t, args, complain);
6929 if (TREE_CODE (t) == IDENTIFIER_NODE)
6930 type = IDENTIFIER_TYPE_VALUE (t);
6932 type = TREE_TYPE (t);
6934 gcc_assert (type != unknown_type_node);
6937 && TREE_CODE (t) != TYPENAME_TYPE
6938 && TREE_CODE (t) != IDENTIFIER_NODE
6939 && TREE_CODE (t) != FUNCTION_TYPE
6940 && TREE_CODE (t) != METHOD_TYPE)
6941 type = tsubst (type, args, complain, in_decl);
6942 if (type == error_mark_node)
6943 return error_mark_node;
6945 switch (TREE_CODE (t))
6950 return tsubst_aggr_type (t, args, complain, in_decl,
6951 /*entering_scope=*/0);
6954 case IDENTIFIER_NODE:
6966 if (t == integer_type_node)
6969 if (TREE_CODE (TYPE_MIN_VALUE (t)) == INTEGER_CST
6970 && TREE_CODE (TYPE_MAX_VALUE (t)) == INTEGER_CST)
6974 tree max, omax = TREE_OPERAND (TYPE_MAX_VALUE (t), 0);
6976 /* The array dimension behaves like a non-type template arg,
6977 in that we want to fold it as much as possible. */
6978 max = tsubst_template_arg (omax, args, complain, in_decl);
6979 max = fold_decl_constant_value (max);
6981 if (integer_zerop (omax))
6983 /* Still allow an explicit array of size zero. */
6985 pedwarn ("creating array with size zero");
6987 else if (integer_zerop (max)
6988 || (TREE_CODE (max) == INTEGER_CST
6989 && INT_CST_LT (max, integer_zero_node)))
6993 Type deduction may fail for any of the following
6996 Attempting to create an array with a size that is
6997 zero or negative. */
6998 if (complain & tf_error)
6999 error ("creating array with size zero (%qE)", max);
7001 return error_mark_node;
7004 return compute_array_index_type (NULL_TREE, max);
7007 case TEMPLATE_TYPE_PARM:
7008 case TEMPLATE_TEMPLATE_PARM:
7009 case BOUND_TEMPLATE_TEMPLATE_PARM:
7010 case TEMPLATE_PARM_INDEX:
7015 tree arg = NULL_TREE;
7019 gcc_assert (TREE_VEC_LENGTH (args) > 0);
7020 if (TREE_CODE (t) == TEMPLATE_TYPE_PARM
7021 || TREE_CODE (t) == TEMPLATE_TEMPLATE_PARM
7022 || TREE_CODE (t) == BOUND_TEMPLATE_TEMPLATE_PARM)
7024 idx = TEMPLATE_TYPE_IDX (t);
7025 level = TEMPLATE_TYPE_LEVEL (t);
7029 idx = TEMPLATE_PARM_IDX (t);
7030 level = TEMPLATE_PARM_LEVEL (t);
7033 levels = TMPL_ARGS_DEPTH (args);
7034 if (level <= levels)
7035 arg = TMPL_ARG (args, level, idx);
7037 if (arg == error_mark_node)
7038 return error_mark_node;
7039 else if (arg != NULL_TREE)
7041 if (TREE_CODE (t) == TEMPLATE_TYPE_PARM)
7043 gcc_assert (TYPE_P (arg));
7044 return cp_build_qualified_type_real
7045 (arg, cp_type_quals (arg) | cp_type_quals (t),
7046 complain | tf_ignore_bad_quals);
7048 else if (TREE_CODE (t) == BOUND_TEMPLATE_TEMPLATE_PARM)
7050 /* We are processing a type constructed from a
7051 template template parameter. */
7052 tree argvec = tsubst (TYPE_TI_ARGS (t),
7053 args, complain, in_decl);
7054 if (argvec == error_mark_node)
7055 return error_mark_node;
7057 /* We can get a TEMPLATE_TEMPLATE_PARM here when we
7058 are resolving nested-types in the signature of a
7059 member function templates. Otherwise ARG is a
7060 TEMPLATE_DECL and is the real template to be
7062 if (TREE_CODE (arg) == TEMPLATE_TEMPLATE_PARM)
7063 arg = TYPE_NAME (arg);
7065 r = lookup_template_class (arg,
7068 /*entering_scope=*/0,
7070 return cp_build_qualified_type_real
7071 (r, TYPE_QUALS (t), complain);
7074 /* TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX. */
7079 /* This can happen during the attempted tsubst'ing in
7080 unify. This means that we don't yet have any information
7081 about the template parameter in question. */
7084 /* If we get here, we must have been looking at a parm for a
7085 more deeply nested template. Make a new version of this
7086 template parameter, but with a lower level. */
7087 switch (TREE_CODE (t))
7089 case TEMPLATE_TYPE_PARM:
7090 case TEMPLATE_TEMPLATE_PARM:
7091 case BOUND_TEMPLATE_TEMPLATE_PARM:
7092 if (cp_type_quals (t))
7094 r = tsubst (TYPE_MAIN_VARIANT (t), args, complain, in_decl);
7095 r = cp_build_qualified_type_real
7096 (r, cp_type_quals (t),
7097 complain | (TREE_CODE (t) == TEMPLATE_TYPE_PARM
7098 ? tf_ignore_bad_quals : 0));
7103 TEMPLATE_TYPE_PARM_INDEX (r)
7104 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (t),
7106 TYPE_STUB_DECL (r) = TYPE_NAME (r) = TEMPLATE_TYPE_DECL (r);
7107 TYPE_MAIN_VARIANT (r) = r;
7108 TYPE_POINTER_TO (r) = NULL_TREE;
7109 TYPE_REFERENCE_TO (r) = NULL_TREE;
7111 if (TREE_CODE (t) == BOUND_TEMPLATE_TEMPLATE_PARM)
7113 tree argvec = tsubst (TYPE_TI_ARGS (t), args,
7115 if (argvec == error_mark_node)
7116 return error_mark_node;
7118 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (r)
7119 = tree_cons (TYPE_TI_TEMPLATE (t), argvec, NULL_TREE);
7124 case TEMPLATE_PARM_INDEX:
7125 r = reduce_template_parm_level (t, type, levels);
7137 tree purpose, value, chain;
7139 if (t == void_list_node)
7142 purpose = TREE_PURPOSE (t);
7145 purpose = tsubst (purpose, args, complain, in_decl);
7146 if (purpose == error_mark_node)
7147 return error_mark_node;
7149 value = TREE_VALUE (t);
7152 value = tsubst (value, args, complain, in_decl);
7153 if (value == error_mark_node)
7154 return error_mark_node;
7156 chain = TREE_CHAIN (t);
7157 if (chain && chain != void_type_node)
7159 chain = tsubst (chain, args, complain, in_decl);
7160 if (chain == error_mark_node)
7161 return error_mark_node;
7163 if (purpose == TREE_PURPOSE (t)
7164 && value == TREE_VALUE (t)
7165 && chain == TREE_CHAIN (t))
7167 return hash_tree_cons (purpose, value, chain);
7171 /* We should never be tsubsting a binfo. */
7175 /* A vector of template arguments. */
7177 return tsubst_template_args (t, args, complain, in_decl);
7180 case REFERENCE_TYPE:
7182 enum tree_code code;
7184 if (type == TREE_TYPE (t) && TREE_CODE (type) != METHOD_TYPE)
7187 code = TREE_CODE (t);
7192 Type deduction may fail for any of the following
7195 -- Attempting to create a pointer to reference type.
7196 -- Attempting to create a reference to a reference type or
7197 a reference to void. */
7198 if (TREE_CODE (type) == REFERENCE_TYPE
7199 || (code == REFERENCE_TYPE && TREE_CODE (type) == VOID_TYPE))
7201 static location_t last_loc;
7203 /* We keep track of the last time we issued this error
7204 message to avoid spewing a ton of messages during a
7205 single bad template instantiation. */
7206 if (complain & tf_error
7207 #ifdef USE_MAPPED_LOCATION
7208 && last_loc != input_location
7210 && (last_loc.line != input_line
7211 || last_loc.file != input_filename)
7215 if (TREE_CODE (type) == VOID_TYPE)
7216 error ("forming reference to void");
7218 error ("forming %s to reference type %qT",
7219 (code == POINTER_TYPE) ? "pointer" : "reference",
7221 last_loc = input_location;
7224 return error_mark_node;
7226 else if (code == POINTER_TYPE)
7228 r = build_pointer_type (type);
7229 if (TREE_CODE (type) == METHOD_TYPE)
7230 r = build_ptrmemfunc_type (r);
7233 r = build_reference_type (type);
7234 r = cp_build_qualified_type_real (r, TYPE_QUALS (t), complain);
7236 if (r != error_mark_node)
7237 /* Will this ever be needed for TYPE_..._TO values? */
7244 r = tsubst (TYPE_OFFSET_BASETYPE (t), args, complain, in_decl);
7245 if (r == error_mark_node || !IS_AGGR_TYPE (r))
7249 Type deduction may fail for any of the following
7252 -- Attempting to create "pointer to member of T" when T
7253 is not a class type. */
7254 if (complain & tf_error)
7255 error ("creating pointer to member of non-class type %qT", r);
7256 return error_mark_node;
7258 if (TREE_CODE (type) == REFERENCE_TYPE)
7260 if (complain & tf_error)
7261 error ("creating pointer to member reference type %qT", type);
7263 return error_mark_node;
7265 gcc_assert (TREE_CODE (type) != METHOD_TYPE);
7266 if (TREE_CODE (type) == FUNCTION_TYPE)
7268 /* The type of the implicit object parameter gets its
7269 cv-qualifiers from the FUNCTION_TYPE. */
7271 tree this_type = cp_build_qualified_type (TYPE_MAIN_VARIANT (r),
7272 cp_type_quals (type));
7274 method_type = build_method_type_directly (this_type,
7276 TYPE_ARG_TYPES (type));
7277 memptr = build_ptrmemfunc_type (build_pointer_type (method_type));
7278 return cp_build_qualified_type_real (memptr, cp_type_quals (t),
7282 return cp_build_qualified_type_real (build_ptrmem_type (r, type),
7291 fntype = tsubst_function_type (t, args, complain, in_decl);
7292 if (fntype == error_mark_node)
7293 return error_mark_node;
7295 /* Substitute the exception specification. */
7296 specs = tsubst_exception_specification (t, args, complain,
7299 fntype = build_exception_variant (fntype, specs);
7304 tree domain = tsubst (TYPE_DOMAIN (t), args, complain, in_decl);
7305 if (domain == error_mark_node)
7306 return error_mark_node;
7308 /* As an optimization, we avoid regenerating the array type if
7309 it will obviously be the same as T. */
7310 if (type == TREE_TYPE (t) && domain == TYPE_DOMAIN (t))
7313 /* These checks should match the ones in grokdeclarator.
7317 The deduction may fail for any of the following reasons:
7319 -- Attempting to create an array with an element type that
7320 is void, a function type, or a reference type, or [DR337]
7321 an abstract class type. */
7322 if (TREE_CODE (type) == VOID_TYPE
7323 || TREE_CODE (type) == FUNCTION_TYPE
7324 || TREE_CODE (type) == REFERENCE_TYPE)
7326 if (complain & tf_error)
7327 error ("creating array of %qT", type);
7328 return error_mark_node;
7330 if (CLASS_TYPE_P (type) && CLASSTYPE_PURE_VIRTUALS (type))
7332 if (complain & tf_error)
7333 error ("creating array of %qT, which is an abstract class type",
7335 return error_mark_node;
7338 r = build_cplus_array_type (type, domain);
7345 tree e1 = tsubst (TREE_OPERAND (t, 0), args, complain, in_decl);
7346 tree e2 = tsubst (TREE_OPERAND (t, 1), args, complain, in_decl);
7348 if (e1 == error_mark_node || e2 == error_mark_node)
7349 return error_mark_node;
7351 return fold_build2 (TREE_CODE (t), TREE_TYPE (t), e1, e2);
7357 tree e = tsubst (TREE_OPERAND (t, 0), args, complain, in_decl);
7358 if (e == error_mark_node)
7359 return error_mark_node;
7361 return fold_build1 (TREE_CODE (t), TREE_TYPE (t), e);
7366 tree ctx = tsubst_aggr_type (TYPE_CONTEXT (t), args, complain,
7367 in_decl, /*entering_scope=*/1);
7368 tree f = tsubst_copy (TYPENAME_TYPE_FULLNAME (t), args,
7371 if (ctx == error_mark_node || f == error_mark_node)
7372 return error_mark_node;
7374 if (!IS_AGGR_TYPE (ctx))
7376 if (complain & tf_error)
7377 error ("%qT is not a class, struct, or union type", ctx);
7378 return error_mark_node;
7380 else if (!uses_template_parms (ctx) && !TYPE_BEING_DEFINED (ctx))
7382 /* Normally, make_typename_type does not require that the CTX
7383 have complete type in order to allow things like:
7385 template <class T> struct S { typename S<T>::X Y; };
7387 But, such constructs have already been resolved by this
7388 point, so here CTX really should have complete type, unless
7389 it's a partial instantiation. */
7390 ctx = complete_type (ctx);
7391 if (!COMPLETE_TYPE_P (ctx))
7393 if (complain & tf_error)
7394 cxx_incomplete_type_error (NULL_TREE, ctx);
7395 return error_mark_node;
7399 f = make_typename_type (ctx, f, typename_type,
7400 (complain & tf_error) | tf_keep_type_decl);
7401 if (f == error_mark_node)
7403 if (TREE_CODE (f) == TYPE_DECL)
7405 complain |= tf_ignore_bad_quals;
7409 if (TREE_CODE (f) != TYPENAME_TYPE)
7411 if (TYPENAME_IS_ENUM_P (t) && TREE_CODE (f) != ENUMERAL_TYPE)
7412 error ("%qT resolves to %qT, which is not an enumeration type",
7414 else if (TYPENAME_IS_CLASS_P (t) && !CLASS_TYPE_P (f))
7415 error ("%qT resolves to %qT, which is is not a class type",
7419 return cp_build_qualified_type_real
7420 (f, cp_type_quals (f) | cp_type_quals (t), complain);
7423 case UNBOUND_CLASS_TEMPLATE:
7425 tree ctx = tsubst_aggr_type (TYPE_CONTEXT (t), args, complain,
7426 in_decl, /*entering_scope=*/1);
7427 tree name = TYPE_IDENTIFIER (t);
7428 tree parm_list = DECL_TEMPLATE_PARMS (TYPE_NAME (t));
7430 if (ctx == error_mark_node || name == error_mark_node)
7431 return error_mark_node;
7434 parm_list = tsubst_template_parms (parm_list, args, complain);
7435 return make_unbound_class_template (ctx, name, parm_list, complain);
7445 tree e1 = tsubst (TREE_OPERAND (t, 0), args, complain, in_decl);
7446 tree e2 = tsubst_expr (TREE_OPERAND (t, 1), args, complain, in_decl);
7447 if (e1 == error_mark_node || e2 == error_mark_node)
7448 return error_mark_node;
7450 return build_nt (ARRAY_REF, e1, e2, NULL_TREE, NULL_TREE);
7455 tree e1 = tsubst (TREE_OPERAND (t, 0), args, complain, in_decl);
7456 tree e2 = tsubst (TREE_OPERAND (t, 1), args, complain, in_decl);
7457 if (e1 == error_mark_node || e2 == error_mark_node)
7458 return error_mark_node;
7460 return build_nt (TREE_CODE (t), e1, e2);
7467 type = finish_typeof (tsubst_expr (TYPEOF_TYPE_EXPR (t), args,
7468 complain, in_decl));
7469 return cp_build_qualified_type_real (type,
7471 | cp_type_quals (type),
7476 sorry ("use of %qs in template",
7477 tree_code_name [(int) TREE_CODE (t)]);
7478 return error_mark_node;
7482 /* Like tsubst_expr for a BASELINK. OBJECT_TYPE, if non-NULL, is the
7483 type of the expression on the left-hand side of the "." or "->"
7487 tsubst_baselink (tree baselink, tree object_type,
7488 tree args, tsubst_flags_t complain, tree in_decl)
7491 tree qualifying_scope;
7493 tree template_args = 0;
7494 bool template_id_p = false;
7496 /* A baselink indicates a function from a base class. The
7497 BASELINK_ACCESS_BINFO and BASELINK_BINFO are going to have
7498 non-dependent types; otherwise, the lookup could not have
7499 succeeded. However, they may indicate bases of the template
7500 class, rather than the instantiated class.
7502 In addition, lookups that were not ambiguous before may be
7503 ambiguous now. Therefore, we perform the lookup again. */
7504 qualifying_scope = BINFO_TYPE (BASELINK_ACCESS_BINFO (baselink));
7505 fns = BASELINK_FUNCTIONS (baselink);
7506 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)
7508 template_id_p = true;
7509 template_args = TREE_OPERAND (fns, 1);
7510 fns = TREE_OPERAND (fns, 0);
7512 template_args = tsubst_template_args (template_args, args,
7515 name = DECL_NAME (get_first_fn (fns));
7516 baselink = lookup_fnfields (qualifying_scope, name, /*protect=*/1);
7518 /* If lookup found a single function, mark it as used at this
7519 point. (If it lookup found multiple functions the one selected
7520 later by overload resolution will be marked as used at that
7522 if (BASELINK_P (baselink))
7523 fns = BASELINK_FUNCTIONS (baselink);
7524 if (!template_id_p && !really_overloaded_fn (fns))
7525 mark_used (OVL_CURRENT (fns));
7527 /* Add back the template arguments, if present. */
7528 if (BASELINK_P (baselink) && template_id_p)
7529 BASELINK_FUNCTIONS (baselink)
7530 = build_nt (TEMPLATE_ID_EXPR,
7531 BASELINK_FUNCTIONS (baselink),
7535 object_type = current_class_type;
7536 return adjust_result_of_qualified_name_lookup (baselink,
7541 /* Like tsubst_expr for a SCOPE_REF, given by QUALIFIED_ID. DONE is
7542 true if the qualified-id will be a postfix-expression in-and-of
7543 itself; false if more of the postfix-expression follows the
7544 QUALIFIED_ID. ADDRESS_P is true if the qualified-id is the operand
7548 tsubst_qualified_id (tree qualified_id, tree args,
7549 tsubst_flags_t complain, tree in_decl,
7550 bool done, bool address_p)
7558 gcc_assert (TREE_CODE (qualified_id) == SCOPE_REF);
7560 /* Figure out what name to look up. */
7561 name = TREE_OPERAND (qualified_id, 1);
7562 if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
7565 template_args = TREE_OPERAND (name, 1);
7567 template_args = tsubst_template_args (template_args, args,
7569 name = TREE_OPERAND (name, 0);
7573 is_template = false;
7574 template_args = NULL_TREE;
7577 /* Substitute into the qualifying scope. When there are no ARGS, we
7578 are just trying to simplify a non-dependent expression. In that
7579 case the qualifying scope may be dependent, and, in any case,
7580 substituting will not help. */
7581 scope = TREE_OPERAND (qualified_id, 0);
7584 scope = tsubst (scope, args, complain, in_decl);
7585 expr = tsubst_copy (name, args, complain, in_decl);
7590 if (dependent_type_p (scope))
7591 return build_nt (SCOPE_REF, scope, expr);
7593 if (!BASELINK_P (name) && !DECL_P (expr))
7595 expr = lookup_qualified_name (scope, expr, /*is_type_p=*/0, false);
7596 if (TREE_CODE (TREE_CODE (expr) == TEMPLATE_DECL
7597 ? DECL_TEMPLATE_RESULT (expr) : expr) == TYPE_DECL)
7599 if (complain & tf_error)
7601 error ("dependent-name %qE is parsed as a non-type, but "
7602 "instantiation yields a type", qualified_id);
7603 inform ("say %<typename %E%> if a type is meant", qualified_id);
7605 return error_mark_node;
7611 check_accessibility_of_qualified_id (expr, /*object_type=*/NULL_TREE,
7613 /* Remember that there was a reference to this entity. */
7617 if (expr == error_mark_node || TREE_CODE (expr) == TREE_LIST)
7619 if (complain & tf_error)
7620 qualified_name_lookup_error (scope,
7621 TREE_OPERAND (qualified_id, 1),
7623 return error_mark_node;
7627 expr = lookup_template_function (expr, template_args);
7629 if (expr == error_mark_node && complain & tf_error)
7630 qualified_name_lookup_error (scope, TREE_OPERAND (qualified_id, 1),
7632 else if (TYPE_P (scope))
7634 expr = (adjust_result_of_qualified_name_lookup
7635 (expr, scope, current_class_type));
7636 expr = finish_qualified_id_expr (scope, expr, done, address_p);
7639 expr = convert_from_reference (expr);
7644 /* Like tsubst, but deals with expressions. This function just replaces
7645 template parms; to finish processing the resultant expression, use
7649 tsubst_copy (tree t, tree args, tsubst_flags_t complain, tree in_decl)
7651 enum tree_code code;
7654 if (t == NULL_TREE || t == error_mark_node)
7657 code = TREE_CODE (t);
7662 r = retrieve_local_specialization (t);
7663 gcc_assert (r != NULL);
7672 if (DECL_TEMPLATE_PARM_P (t))
7673 return tsubst_copy (DECL_INITIAL (t), args, complain, in_decl);
7674 /* There is no need to substitute into namespace-scope
7676 if (DECL_NAMESPACE_SCOPE_P (t))
7678 /* If ARGS is NULL, then T is known to be non-dependent. */
7679 if (args == NULL_TREE)
7680 return integral_constant_value (t);
7682 /* Unfortunately, we cannot just call lookup_name here.
7685 template <int I> int f() {
7687 struct S { void g() { E e = a; } };
7690 When we instantiate f<7>::S::g(), say, lookup_name is not
7691 clever enough to find f<7>::a. */
7693 = tsubst_aggr_type (TREE_TYPE (t), args, complain, in_decl,
7694 /*entering_scope=*/0);
7696 for (v = TYPE_VALUES (enum_type);
7699 if (TREE_PURPOSE (v) == DECL_NAME (t))
7700 return TREE_VALUE (v);
7702 /* We didn't find the name. That should never happen; if
7703 name-lookup found it during preliminary parsing, we
7704 should find it again here during instantiation. */
7710 if (DECL_CONTEXT (t))
7714 ctx = tsubst_aggr_type (DECL_CONTEXT (t), args, complain, in_decl,
7715 /*entering_scope=*/1);
7716 if (ctx != DECL_CONTEXT (t))
7718 tree r = lookup_field (ctx, DECL_NAME (t), 0, false);
7721 if (complain & tf_error)
7722 error ("using invalid field %qD", t);
7723 return error_mark_node;
7733 if ((DECL_LANG_SPECIFIC (t) && DECL_TEMPLATE_INFO (t))
7734 || local_variable_p (t))
7735 t = tsubst (t, args, complain, in_decl);
7740 return tsubst_baselink (t, current_class_type, args, complain, in_decl);
7743 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t))
7744 return tsubst (TREE_TYPE (DECL_TEMPLATE_RESULT (t)),
7745 args, complain, in_decl);
7746 else if (DECL_FUNCTION_TEMPLATE_P (t) && DECL_MEMBER_TEMPLATE_P (t))
7747 return tsubst (t, args, complain, in_decl);
7748 else if (DECL_CLASS_SCOPE_P (t)
7749 && uses_template_parms (DECL_CONTEXT (t)))
7751 /* Template template argument like the following example need
7754 template <template <class> class TT> struct C {};
7755 template <class T> struct D {
7756 template <class U> struct E {};
7761 We are processing the template argument `E' in #1 for
7762 the template instantiation #2. Originally, `E' is a
7763 TEMPLATE_DECL with `D<T>' as its DECL_CONTEXT. Now we
7764 have to substitute this with one having context `D<int>'. */
7766 tree context = tsubst (DECL_CONTEXT (t), args, complain, in_decl);
7767 return lookup_field (context, DECL_NAME(t), 0, false);
7770 /* Ordinary template template argument. */
7774 case REINTERPRET_CAST_EXPR:
7775 case CONST_CAST_EXPR:
7776 case STATIC_CAST_EXPR:
7777 case DYNAMIC_CAST_EXPR:
7780 (code, tsubst (TREE_TYPE (t), args, complain, in_decl),
7781 tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl));
7785 case TRUTH_NOT_EXPR:
7788 case CONVERT_EXPR: /* Unary + */
7797 (code, tsubst (TREE_TYPE (t), args, complain, in_decl),
7798 tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl));
7805 object = tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl);
7806 name = TREE_OPERAND (t, 1);
7807 if (TREE_CODE (name) == BIT_NOT_EXPR)
7809 name = tsubst_copy (TREE_OPERAND (name, 0), args,
7811 name = build1 (BIT_NOT_EXPR, NULL_TREE, name);
7813 else if (TREE_CODE (name) == SCOPE_REF
7814 && TREE_CODE (TREE_OPERAND (name, 1)) == BIT_NOT_EXPR)
7816 tree base = tsubst_copy (TREE_OPERAND (name, 0), args,
7818 name = TREE_OPERAND (name, 1);
7819 name = tsubst_copy (TREE_OPERAND (name, 0), args,
7821 name = build1 (BIT_NOT_EXPR, NULL_TREE, name);
7822 name = build_nt (SCOPE_REF, base, name);
7824 else if (TREE_CODE (name) == BASELINK)
7825 name = tsubst_baselink (name,
7826 non_reference (TREE_TYPE (object)),
7830 name = tsubst_copy (name, args, complain, in_decl);
7831 return build_nt (COMPONENT_REF, object, name, NULL_TREE);
7837 case TRUNC_DIV_EXPR:
7839 case FLOOR_DIV_EXPR:
7840 case ROUND_DIV_EXPR:
7841 case EXACT_DIV_EXPR:
7845 case TRUNC_MOD_EXPR:
7846 case FLOOR_MOD_EXPR:
7847 case TRUTH_ANDIF_EXPR:
7848 case TRUTH_ORIF_EXPR:
7849 case TRUTH_AND_EXPR:
7867 case PREDECREMENT_EXPR:
7868 case PREINCREMENT_EXPR:
7869 case POSTDECREMENT_EXPR:
7870 case POSTINCREMENT_EXPR:
7872 (code, tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl),
7873 tsubst_copy (TREE_OPERAND (t, 1), args, complain, in_decl));
7878 tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl),
7879 tsubst_copy (TREE_OPERAND (t, 1), args, complain, in_decl),
7880 NULL_TREE, NULL_TREE);
7883 return build_nt (code,
7884 tsubst_copy (TREE_OPERAND (t, 0), args,
7886 tsubst_copy (TREE_OPERAND (t, 1), args, complain,
7892 case PSEUDO_DTOR_EXPR:
7895 (code, tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl),
7896 tsubst_copy (TREE_OPERAND (t, 1), args, complain, in_decl),
7897 tsubst_copy (TREE_OPERAND (t, 2), args, complain, in_decl));
7898 TREE_NO_WARNING (r) = TREE_NO_WARNING (t);
7905 (code, tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl),
7906 tsubst_copy (TREE_OPERAND (t, 1), args, complain, in_decl),
7907 tsubst_copy (TREE_OPERAND (t, 2), args, complain, in_decl));
7908 NEW_EXPR_USE_GLOBAL (r) = NEW_EXPR_USE_GLOBAL (t);
7915 (code, tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl),
7916 tsubst_copy (TREE_OPERAND (t, 1), args, complain, in_decl));
7917 DELETE_EXPR_USE_GLOBAL (r) = DELETE_EXPR_USE_GLOBAL (t);
7918 DELETE_EXPR_USE_VEC (r) = DELETE_EXPR_USE_VEC (t);
7922 case TEMPLATE_ID_EXPR:
7924 /* Substituted template arguments */
7925 tree fn = TREE_OPERAND (t, 0);
7926 tree targs = TREE_OPERAND (t, 1);
7928 fn = tsubst_copy (fn, args, complain, in_decl);
7930 targs = tsubst_template_args (targs, args, complain, in_decl);
7932 return lookup_template_function (fn, targs);
7937 tree purpose, value, chain;
7939 if (t == void_list_node)
7942 purpose = TREE_PURPOSE (t);
7944 purpose = tsubst_copy (purpose, args, complain, in_decl);
7945 value = TREE_VALUE (t);
7947 value = tsubst_copy (value, args, complain, in_decl);
7948 chain = TREE_CHAIN (t);
7949 if (chain && chain != void_type_node)
7950 chain = tsubst_copy (chain, args, complain, in_decl);
7951 if (purpose == TREE_PURPOSE (t)
7952 && value == TREE_VALUE (t)
7953 && chain == TREE_CHAIN (t))
7955 return tree_cons (purpose, value, chain);
7962 case TEMPLATE_TYPE_PARM:
7963 case TEMPLATE_TEMPLATE_PARM:
7964 case BOUND_TEMPLATE_TEMPLATE_PARM:
7965 case TEMPLATE_PARM_INDEX:
7967 case REFERENCE_TYPE:
7973 case UNBOUND_CLASS_TEMPLATE:
7976 return tsubst (t, args, complain, in_decl);
7978 case IDENTIFIER_NODE:
7979 if (IDENTIFIER_TYPENAME_P (t))
7981 tree new_type = tsubst (TREE_TYPE (t), args, complain, in_decl);
7982 return mangle_conv_op_name_for_type (new_type);
7989 r = build_constructor
7990 (tsubst (TREE_TYPE (t), args, complain, in_decl),
7991 tsubst_copy (CONSTRUCTOR_ELTS (t), args, complain, in_decl));
7992 TREE_HAS_CONSTRUCTOR (r) = TREE_HAS_CONSTRUCTOR (t);
7997 return build_x_va_arg (tsubst_copy (TREE_OPERAND (t, 0), args, complain,
7999 tsubst (TREE_TYPE (t), args, complain, in_decl));
8001 case CLEANUP_POINT_EXPR:
8002 /* We shouldn't have built any of these during initial template
8003 generation. Instead, they should be built during instantiation
8004 in response to the saved STMT_IS_FULL_EXPR_P setting. */
8012 /* Like tsubst_copy for expressions, etc. but also does semantic
8016 tsubst_expr (tree t, tree args, tsubst_flags_t complain, tree in_decl)
8020 if (t == NULL_TREE || t == error_mark_node)
8023 if (EXPR_HAS_LOCATION (t))
8024 input_location = EXPR_LOCATION (t);
8025 if (STATEMENT_CODE_P (TREE_CODE (t)))
8026 current_stmt_tree ()->stmts_are_full_exprs_p = STMT_IS_FULL_EXPR_P (t);
8028 switch (TREE_CODE (t))
8030 case STATEMENT_LIST:
8032 tree_stmt_iterator i;
8033 for (i = tsi_start (t); !tsi_end_p (i); tsi_next (&i))
8034 tsubst_expr (tsi_stmt (i), args, complain, in_decl);
8038 case CTOR_INITIALIZER:
8039 finish_mem_initializers (tsubst_initializer_list
8040 (TREE_OPERAND (t, 0), args));
8044 finish_return_stmt (tsubst_expr (TREE_OPERAND (t, 0),
8045 args, complain, in_decl));
8049 tmp = tsubst_expr (EXPR_STMT_EXPR (t), args, complain, in_decl);
8050 if (EXPR_STMT_STMT_EXPR_RESULT (t))
8051 finish_stmt_expr_expr (tmp, cur_stmt_expr);
8053 finish_expr_stmt (tmp);
8057 do_using_directive (tsubst_expr (USING_STMT_NAMESPACE (t),
8058 args, complain, in_decl));
8066 decl = DECL_EXPR_DECL (t);
8067 if (TREE_CODE (decl) == LABEL_DECL)
8068 finish_label_decl (DECL_NAME (decl));
8069 else if (TREE_CODE (decl) == USING_DECL)
8071 tree scope = DECL_INITIAL (decl);
8072 tree name = DECL_NAME (decl);
8075 scope = tsubst_expr (scope, args, complain, in_decl);
8076 decl = lookup_qualified_name (scope, name,
8077 /*is_type_p=*/false,
8078 /*complain=*/false);
8079 if (decl == error_mark_node || TREE_CODE (decl) == TREE_LIST)
8080 qualified_name_lookup_error (scope, name, decl);
8082 do_local_using_decl (decl, scope, name);
8086 init = DECL_INITIAL (decl);
8087 decl = tsubst (decl, args, complain, in_decl);
8088 if (decl != error_mark_node)
8091 DECL_INITIAL (decl) = error_mark_node;
8092 /* By marking the declaration as instantiated, we avoid
8093 trying to instantiate it. Since instantiate_decl can't
8094 handle local variables, and since we've already done
8095 all that needs to be done, that's the right thing to
8097 if (TREE_CODE (decl) == VAR_DECL)
8098 DECL_TEMPLATE_INSTANTIATED (decl) = 1;
8099 if (TREE_CODE (decl) == VAR_DECL
8100 && ANON_AGGR_TYPE_P (TREE_TYPE (decl)))
8101 /* Anonymous aggregates are a special case. */
8102 finish_anon_union (decl);
8105 maybe_push_decl (decl);
8106 if (TREE_CODE (decl) == VAR_DECL
8107 && DECL_PRETTY_FUNCTION_P (decl))
8109 /* For __PRETTY_FUNCTION__ we have to adjust the
8111 const char *const name
8112 = cxx_printable_name (current_function_decl, 2);
8113 init = cp_fname_init (name, &TREE_TYPE (decl));
8116 init = tsubst_expr (init, args, complain, in_decl);
8117 cp_finish_decl (decl, init, NULL_TREE, 0);
8122 /* A DECL_EXPR can also be used as an expression, in the condition
8123 clause of an if/for/while construct. */
8128 stmt = begin_for_stmt ();
8129 tsubst_expr (FOR_INIT_STMT (t), args, complain, in_decl);
8130 finish_for_init_stmt (stmt);
8131 tmp = tsubst_expr (FOR_COND (t), args, complain, in_decl);
8132 finish_for_cond (tmp, stmt);
8133 tmp = tsubst_expr (FOR_EXPR (t), args, complain, in_decl);
8134 finish_for_expr (tmp, stmt);
8135 tsubst_expr (FOR_BODY (t), args, complain, in_decl);
8136 finish_for_stmt (stmt);
8140 stmt = begin_while_stmt ();
8141 tmp = tsubst_expr (WHILE_COND (t), args, complain, in_decl);
8142 finish_while_stmt_cond (tmp, stmt);
8143 tsubst_expr (WHILE_BODY (t), args, complain, in_decl);
8144 finish_while_stmt (stmt);
8148 stmt = begin_do_stmt ();
8149 tsubst_expr (DO_BODY (t), args, complain, in_decl);
8150 finish_do_body (stmt);
8151 tmp = tsubst_expr (DO_COND (t), args, complain, in_decl);
8152 finish_do_stmt (tmp, stmt);
8156 stmt = begin_if_stmt ();
8157 tmp = tsubst_expr (IF_COND (t), args, complain, in_decl);
8158 finish_if_stmt_cond (tmp, stmt);
8159 tsubst_expr (THEN_CLAUSE (t), args, complain, in_decl);
8160 finish_then_clause (stmt);
8162 if (ELSE_CLAUSE (t))
8164 begin_else_clause (stmt);
8165 tsubst_expr (ELSE_CLAUSE (t), args, complain, in_decl);
8166 finish_else_clause (stmt);
8169 finish_if_stmt (stmt);
8173 if (BIND_EXPR_BODY_BLOCK (t))
8174 stmt = begin_function_body ();
8176 stmt = begin_compound_stmt (BIND_EXPR_TRY_BLOCK (t)
8177 ? BCS_TRY_BLOCK : 0);
8179 tsubst_expr (BIND_EXPR_BODY (t), args, complain, in_decl);
8181 if (BIND_EXPR_BODY_BLOCK (t))
8182 finish_function_body (stmt);
8184 finish_compound_stmt (stmt);
8188 finish_break_stmt ();
8192 finish_continue_stmt ();
8196 stmt = begin_switch_stmt ();
8197 tmp = tsubst_expr (SWITCH_STMT_COND (t), args, complain, in_decl);
8198 finish_switch_cond (tmp, stmt);
8199 tsubst_expr (SWITCH_STMT_BODY (t), args, complain, in_decl);
8200 finish_switch_stmt (stmt);
8203 case CASE_LABEL_EXPR:
8204 finish_case_label (tsubst_expr (CASE_LOW (t), args, complain, in_decl),
8205 tsubst_expr (CASE_HIGH (t), args, complain,
8210 finish_label_stmt (DECL_NAME (LABEL_EXPR_LABEL (t)));
8214 tmp = GOTO_DESTINATION (t);
8215 if (TREE_CODE (tmp) != LABEL_DECL)
8216 /* Computed goto's must be tsubst'd into. On the other hand,
8217 non-computed gotos must not be; the identifier in question
8218 will have no binding. */
8219 tmp = tsubst_expr (tmp, args, complain, in_decl);
8221 tmp = DECL_NAME (tmp);
8222 finish_goto_stmt (tmp);
8226 tmp = finish_asm_stmt
8227 (ASM_VOLATILE_P (t),
8228 tsubst_expr (ASM_STRING (t), args, complain, in_decl),
8229 tsubst_expr (ASM_OUTPUTS (t), args, complain, in_decl),
8230 tsubst_expr (ASM_INPUTS (t), args, complain, in_decl),
8231 tsubst_expr (ASM_CLOBBERS (t), args, complain, in_decl));
8233 tree asm_expr = tmp;
8234 if (TREE_CODE (asm_expr) == CLEANUP_POINT_EXPR)
8235 asm_expr = TREE_OPERAND (asm_expr, 0);
8236 ASM_INPUT_P (asm_expr) = ASM_INPUT_P (t);
8243 stmt = begin_try_block ();
8244 tsubst_expr (TRY_STMTS (t), args, complain, in_decl);
8245 finish_cleanup_try_block (stmt);
8246 finish_cleanup (tsubst_expr (TRY_HANDLERS (t), args,
8252 if (FN_TRY_BLOCK_P (t))
8253 stmt = begin_function_try_block ();
8255 stmt = begin_try_block ();
8257 tsubst_expr (TRY_STMTS (t), args, complain, in_decl);
8259 if (FN_TRY_BLOCK_P (t))
8260 finish_function_try_block (stmt);
8262 finish_try_block (stmt);
8264 tsubst_expr (TRY_HANDLERS (t), args, complain, in_decl);
8265 if (FN_TRY_BLOCK_P (t))
8266 finish_function_handler_sequence (stmt);
8268 finish_handler_sequence (stmt);
8276 stmt = begin_handler ();
8277 if (HANDLER_PARMS (t))
8279 decl = HANDLER_PARMS (t);
8280 decl = tsubst (decl, args, complain, in_decl);
8281 /* Prevent instantiate_decl from trying to instantiate
8282 this variable. We've already done all that needs to be
8284 DECL_TEMPLATE_INSTANTIATED (decl) = 1;
8288 finish_handler_parms (decl, stmt);
8289 tsubst_expr (HANDLER_BODY (t), args, complain, in_decl);
8290 finish_handler (stmt);
8295 tsubst (TREE_TYPE (t), args, complain, NULL_TREE);
8299 gcc_assert (!STATEMENT_CODE_P (TREE_CODE (t)));
8301 return tsubst_copy_and_build (t, args, complain, in_decl,
8302 /*function_p=*/false);
8308 /* T is a postfix-expression that is not being used in a function
8309 call. Return the substituted version of T. */
8312 tsubst_non_call_postfix_expression (tree t, tree args,
8313 tsubst_flags_t complain,
8316 if (TREE_CODE (t) == SCOPE_REF)
8317 t = tsubst_qualified_id (t, args, complain, in_decl,
8318 /*done=*/false, /*address_p=*/false);
8320 t = tsubst_copy_and_build (t, args, complain, in_decl,
8321 /*function_p=*/false);
8326 /* Like tsubst but deals with expressions and performs semantic
8327 analysis. FUNCTION_P is true if T is the "F" in "F (ARGS)". */
8330 tsubst_copy_and_build (tree t,
8332 tsubst_flags_t complain,
8336 #define RECUR(NODE) \
8337 tsubst_copy_and_build (NODE, args, complain, in_decl, /*function_p=*/false)
8341 if (t == NULL_TREE || t == error_mark_node)
8344 switch (TREE_CODE (t))
8349 case IDENTIFIER_NODE:
8353 tree qualifying_class;
8354 bool non_integral_constant_expression_p;
8355 const char *error_msg;
8357 if (IDENTIFIER_TYPENAME_P (t))
8359 tree new_type = tsubst (TREE_TYPE (t), args, complain, in_decl);
8360 t = mangle_conv_op_name_for_type (new_type);
8363 /* Look up the name. */
8364 decl = lookup_name (t, 0);
8366 /* By convention, expressions use ERROR_MARK_NODE to indicate
8367 failure, not NULL_TREE. */
8368 if (decl == NULL_TREE)
8369 decl = error_mark_node;
8371 decl = finish_id_expression (t, decl, NULL_TREE,
8374 /*integral_constant_expression_p=*/false,
8375 /*allow_non_integral_constant_expression_p=*/false,
8376 &non_integral_constant_expression_p,
8380 if (!function_p && TREE_CODE (decl) == IDENTIFIER_NODE)
8381 decl = unqualified_name_lookup_error (decl);
8385 case TEMPLATE_ID_EXPR:
8388 tree template = RECUR (TREE_OPERAND (t, 0));
8389 tree targs = TREE_OPERAND (t, 1);
8392 targs = tsubst_template_args (targs, args, complain, in_decl);
8394 if (TREE_CODE (template) == COMPONENT_REF)
8396 object = TREE_OPERAND (template, 0);
8397 template = TREE_OPERAND (template, 1);
8401 template = lookup_template_function (template, targs);
8404 return build3 (COMPONENT_REF, TREE_TYPE (template),
8405 object, template, NULL_TREE);
8412 tree r = RECUR (TREE_OPERAND (t, 0));
8414 if (REFERENCE_REF_P (t))
8416 /* A type conversion to reference type will be enclosed in
8417 such an indirect ref, but the substitution of the cast
8418 will have also added such an indirect ref. */
8419 if (TREE_CODE (TREE_TYPE (r)) == REFERENCE_TYPE)
8420 r = convert_from_reference (r);
8423 r = build_x_indirect_ref (r, "unary *");
8429 (tsubst (TREE_TYPE (t), args, complain, in_decl),
8430 RECUR (TREE_OPERAND (t, 0)));
8433 return build_functional_cast
8434 (tsubst (TREE_TYPE (t), args, complain, in_decl),
8435 RECUR (TREE_OPERAND (t, 0)));
8437 case REINTERPRET_CAST_EXPR:
8438 return build_reinterpret_cast
8439 (tsubst (TREE_TYPE (t), args, complain, in_decl),
8440 RECUR (TREE_OPERAND (t, 0)));
8442 case CONST_CAST_EXPR:
8443 return build_const_cast
8444 (tsubst (TREE_TYPE (t), args, complain, in_decl),
8445 RECUR (TREE_OPERAND (t, 0)));
8447 case DYNAMIC_CAST_EXPR:
8448 return build_dynamic_cast
8449 (tsubst (TREE_TYPE (t), args, complain, in_decl),
8450 RECUR (TREE_OPERAND (t, 0)));
8452 case STATIC_CAST_EXPR:
8453 return build_static_cast
8454 (tsubst (TREE_TYPE (t), args, complain, in_decl),
8455 RECUR (TREE_OPERAND (t, 0)));
8457 case POSTDECREMENT_EXPR:
8458 case POSTINCREMENT_EXPR:
8459 op1 = tsubst_non_call_postfix_expression (TREE_OPERAND (t, 0),
8460 args, complain, in_decl);
8461 return build_x_unary_op (TREE_CODE (t), op1);
8463 case PREDECREMENT_EXPR:
8464 case PREINCREMENT_EXPR:
8468 case TRUTH_NOT_EXPR:
8469 case CONVERT_EXPR: /* Unary + */
8472 return build_x_unary_op (TREE_CODE (t), RECUR (TREE_OPERAND (t, 0)));
8475 op1 = TREE_OPERAND (t, 0);
8476 if (TREE_CODE (op1) == SCOPE_REF)
8477 op1 = tsubst_qualified_id (op1, args, complain, in_decl,
8478 /*done=*/true, /*address_p=*/true);
8480 op1 = tsubst_non_call_postfix_expression (op1, args, complain,
8482 if (TREE_CODE (op1) == LABEL_DECL)
8483 return finish_label_address_expr (DECL_NAME (op1));
8484 return build_x_unary_op (ADDR_EXPR, op1);
8489 case TRUNC_DIV_EXPR:
8491 case FLOOR_DIV_EXPR:
8492 case ROUND_DIV_EXPR:
8493 case EXACT_DIV_EXPR:
8497 case TRUNC_MOD_EXPR:
8498 case FLOOR_MOD_EXPR:
8499 case TRUTH_ANDIF_EXPR:
8500 case TRUTH_ORIF_EXPR:
8501 case TRUTH_AND_EXPR:
8517 return build_x_binary_op
8519 RECUR (TREE_OPERAND (t, 0)),
8520 RECUR (TREE_OPERAND (t, 1)),
8521 /*overloaded_p=*/NULL);
8524 return tsubst_qualified_id (t, args, complain, in_decl, /*done=*/true,
8525 /*address_p=*/false);
8527 op1 = tsubst_non_call_postfix_expression (TREE_OPERAND (t, 0),
8528 args, complain, in_decl);
8529 return build_x_binary_op (ARRAY_REF, op1, RECUR (TREE_OPERAND (t, 1)),
8530 /*overloaded_p=*/NULL);
8534 op1 = TREE_OPERAND (t, 0);
8537 /* When there are no ARGS, we are trying to evaluate a
8538 non-dependent expression from the parser. Trying to do
8539 the substitutions may not work. */
8541 op1 = TREE_TYPE (op1);
8550 return cxx_sizeof_or_alignof_type (op1, TREE_CODE (t), true);
8552 return cxx_sizeof_or_alignof_expr (op1, TREE_CODE (t));
8556 tree r = build_x_modify_expr
8557 (RECUR (TREE_OPERAND (t, 0)),
8558 TREE_CODE (TREE_OPERAND (t, 1)),
8559 RECUR (TREE_OPERAND (t, 2)));
8560 /* TREE_NO_WARNING must be set if either the expression was
8561 parenthesized or it uses an operator such as >>= rather
8562 than plain assignment. In the former case, it was already
8563 set and must be copied. In the latter case,
8564 build_x_modify_expr sets it and it must not be reset
8566 if (TREE_NO_WARNING (t))
8567 TREE_NO_WARNING (r) = TREE_NO_WARNING (t);
8572 op1 = tsubst_non_call_postfix_expression (TREE_OPERAND (t, 0),
8573 args, complain, in_decl);
8574 /* Remember that there was a reference to this entity. */
8577 return build_x_arrow (op1);
8581 (RECUR (TREE_OPERAND (t, 0)),
8582 RECUR (TREE_OPERAND (t, 1)),
8583 RECUR (TREE_OPERAND (t, 2)),
8584 RECUR (TREE_OPERAND (t, 3)),
8585 NEW_EXPR_USE_GLOBAL (t));
8588 return delete_sanity
8589 (RECUR (TREE_OPERAND (t, 0)),
8590 RECUR (TREE_OPERAND (t, 1)),
8591 DELETE_EXPR_USE_VEC (t),
8592 DELETE_EXPR_USE_GLOBAL (t));
8595 return build_x_compound_expr (RECUR (TREE_OPERAND (t, 0)),
8596 RECUR (TREE_OPERAND (t, 1)));
8605 function = TREE_OPERAND (t, 0);
8606 /* When we parsed the expression, we determined whether or
8607 not Koenig lookup should be performed. */
8608 koenig_p = KOENIG_LOOKUP_P (t);
8609 if (TREE_CODE (function) == SCOPE_REF)
8612 function = tsubst_qualified_id (function, args, complain, in_decl,
8614 /*address_p=*/false);
8618 qualified_p = (TREE_CODE (function) == COMPONENT_REF
8619 && (TREE_CODE (TREE_OPERAND (function, 1))
8621 function = tsubst_copy_and_build (function, args, complain,
8624 if (BASELINK_P (function))
8628 call_args = RECUR (TREE_OPERAND (t, 1));
8630 /* We do not perform argument-dependent lookup if normal
8631 lookup finds a non-function, in accordance with the
8632 expected resolution of DR 218. */
8634 && ((is_overloaded_fn (function)
8635 /* If lookup found a member function, the Koenig lookup is
8636 not appropriate, even if an unqualified-name was used
8637 to denote the function. */
8638 && !DECL_FUNCTION_MEMBER_P (get_first_fn (function)))
8639 || TREE_CODE (function) == IDENTIFIER_NODE))
8640 function = perform_koenig_lookup (function, call_args);
8642 if (TREE_CODE (function) == IDENTIFIER_NODE)
8644 unqualified_name_lookup_error (function);
8645 return error_mark_node;
8648 /* Remember that there was a reference to this entity. */
8649 if (DECL_P (function))
8650 mark_used (function);
8652 if (TREE_CODE (function) == OFFSET_REF)
8653 return build_offset_ref_call_from_tree (function, call_args);
8654 if (TREE_CODE (function) == COMPONENT_REF)
8656 if (!BASELINK_P (TREE_OPERAND (function, 1)))
8657 return finish_call_expr (function, call_args,
8658 /*disallow_virtual=*/false,
8659 /*koenig_p=*/false);
8661 return (build_new_method_call
8662 (TREE_OPERAND (function, 0),
8663 TREE_OPERAND (function, 1),
8664 call_args, NULL_TREE,
8665 qualified_p ? LOOKUP_NONVIRTUAL : LOOKUP_NORMAL));
8667 return finish_call_expr (function, call_args,
8668 /*disallow_virtual=*/qualified_p,
8673 return build_x_conditional_expr
8674 (RECUR (TREE_OPERAND (t, 0)),
8675 RECUR (TREE_OPERAND (t, 1)),
8676 RECUR (TREE_OPERAND (t, 2)));
8678 case PSEUDO_DTOR_EXPR:
8679 return finish_pseudo_destructor_expr
8680 (RECUR (TREE_OPERAND (t, 0)),
8681 RECUR (TREE_OPERAND (t, 1)),
8682 RECUR (TREE_OPERAND (t, 2)));
8686 tree purpose, value, chain;
8688 if (t == void_list_node)
8691 purpose = TREE_PURPOSE (t);
8693 purpose = RECUR (purpose);
8694 value = TREE_VALUE (t);
8696 value = RECUR (value);
8697 chain = TREE_CHAIN (t);
8698 if (chain && chain != void_type_node)
8699 chain = RECUR (chain);
8700 if (purpose == TREE_PURPOSE (t)
8701 && value == TREE_VALUE (t)
8702 && chain == TREE_CHAIN (t))
8704 return tree_cons (purpose, value, chain);
8712 object = tsubst_non_call_postfix_expression (TREE_OPERAND (t, 0),
8713 args, complain, in_decl);
8714 /* Remember that there was a reference to this entity. */
8715 if (DECL_P (object))
8718 member = TREE_OPERAND (t, 1);
8719 if (BASELINK_P (member))
8720 member = tsubst_baselink (member,
8721 non_reference (TREE_TYPE (object)),
8722 args, complain, in_decl);
8724 member = tsubst_copy (member, args, complain, in_decl);
8726 if (member == error_mark_node)
8727 return error_mark_node;
8728 else if (!CLASS_TYPE_P (TREE_TYPE (object)))
8730 if (TREE_CODE (member) == BIT_NOT_EXPR)
8731 return finish_pseudo_destructor_expr (object,
8733 TREE_TYPE (object));
8734 else if (TREE_CODE (member) == SCOPE_REF
8735 && (TREE_CODE (TREE_OPERAND (member, 1)) == BIT_NOT_EXPR))
8736 return finish_pseudo_destructor_expr (object,
8738 TREE_TYPE (object));
8740 else if (TREE_CODE (member) == SCOPE_REF
8741 && TREE_CODE (TREE_OPERAND (member, 1)) == TEMPLATE_ID_EXPR)
8746 /* Lookup the template functions now that we know what the
8748 tmpl = TREE_OPERAND (TREE_OPERAND (member, 1), 0);
8749 args = TREE_OPERAND (TREE_OPERAND (member, 1), 1);
8750 member = lookup_qualified_name (TREE_OPERAND (member, 0), tmpl,
8751 /*is_type_p=*/false,
8752 /*complain=*/false);
8753 if (BASELINK_P (member))
8755 BASELINK_FUNCTIONS (member)
8756 = build_nt (TEMPLATE_ID_EXPR, BASELINK_FUNCTIONS (member),
8758 member = (adjust_result_of_qualified_name_lookup
8759 (member, BINFO_TYPE (BASELINK_BINFO (member)),
8760 TREE_TYPE (object)));
8764 qualified_name_lookup_error (TREE_TYPE (object), tmpl,
8766 return error_mark_node;
8769 else if (TREE_CODE (member) == SCOPE_REF
8770 && !CLASS_TYPE_P (TREE_OPERAND (member, 0))
8771 && TREE_CODE (TREE_OPERAND (member, 0)) != NAMESPACE_DECL)
8773 if (complain & tf_error)
8775 if (TYPE_P (TREE_OPERAND (member, 0)))
8776 error ("%qT is not a class or namespace",
8777 TREE_OPERAND (member, 0));
8779 error ("%qD is not a class or namespace",
8780 TREE_OPERAND (member, 0));
8782 return error_mark_node;
8784 else if (TREE_CODE (member) == FIELD_DECL)
8785 return finish_non_static_data_member (member, object, NULL_TREE);
8787 return finish_class_member_access_expr (object, member);
8792 (RECUR (TREE_OPERAND (t, 0)));
8798 tree type = tsubst (TREE_TYPE (t), args, complain, in_decl);
8801 /* digest_init will do the wrong thing if we let it. */
8802 if (type && TYPE_PTRMEMFUNC_P (type))
8806 /* We do not want to process the purpose of aggregate
8807 initializers as they are identifier nodes which will be
8808 looked up by digest_init. */
8809 purpose_p = !(type && IS_AGGR_TYPE (type));
8810 for (elts = CONSTRUCTOR_ELTS (t);
8812 elts = TREE_CHAIN (elts))
8814 tree purpose = TREE_PURPOSE (elts);
8815 tree value = TREE_VALUE (elts);
8817 if (purpose && purpose_p)
8818 purpose = RECUR (purpose);
8819 value = RECUR (value);
8820 r = tree_cons (purpose, value, r);
8823 r = build_constructor (NULL_TREE, nreverse (r));
8824 TREE_HAS_CONSTRUCTOR (r) = TREE_HAS_CONSTRUCTOR (t);
8827 return digest_init (type, r, 0);
8833 tree operand_0 = RECUR (TREE_OPERAND (t, 0));
8834 if (TYPE_P (operand_0))
8835 return get_typeid (operand_0);
8836 return build_typeid (operand_0);
8846 tree r = tsubst_copy (t, args, complain, in_decl);
8848 if (TREE_CODE (TREE_TYPE (t)) != REFERENCE_TYPE)
8849 /* If the original type was a reference, we'll be wrapped in
8850 the appropriate INDIRECT_REF. */
8851 r = convert_from_reference (r);
8856 return build_x_va_arg (RECUR (TREE_OPERAND (t, 0)),
8857 tsubst_copy (TREE_TYPE (t), args, complain,
8861 return fold_offsetof (RECUR (TREE_OPERAND (t, 0)));
8865 tree old_stmt_expr = cur_stmt_expr;
8866 tree stmt_expr = begin_stmt_expr ();
8868 cur_stmt_expr = stmt_expr;
8869 tsubst_expr (STMT_EXPR_STMT (t), args, complain, in_decl);
8870 stmt_expr = finish_stmt_expr (stmt_expr, false);
8871 cur_stmt_expr = old_stmt_expr;
8877 t = tsubst_copy (t, args, complain, in_decl);
8878 /* As in finish_id_expression, we resolve enumeration constants
8879 to their underlying values. */
8880 if (TREE_CODE (t) == CONST_DECL)
8881 return DECL_INITIAL (t);
8885 /* Handle Objective-C++ constructs, if appropriate. */
8888 = objcp_tsubst_copy_and_build (t, args, complain,
8889 in_decl, /*function_p=*/false);
8893 return tsubst_copy (t, args, complain, in_decl);
8899 /* Verify that the instantiated ARGS are valid. For type arguments,
8900 make sure that the type's linkage is ok. For non-type arguments,
8901 make sure they are constants if they are integral or enumerations.
8902 Emit an error under control of COMPLAIN, and return TRUE on error. */
8905 check_instantiated_args (tree tmpl, tree args, tsubst_flags_t complain)
8907 int ix, len = DECL_NTPARMS (tmpl);
8908 bool result = false;
8909 bool error_p = complain & tf_error;
8911 for (ix = 0; ix != len; ix++)
8913 tree t = TREE_VEC_ELT (args, ix);
8917 /* [basic.link]: A name with no linkage (notably, the name
8918 of a class or enumeration declared in a local scope)
8919 shall not be used to declare an entity with linkage.
8920 This implies that names with no linkage cannot be used as
8921 template arguments. */
8922 tree nt = no_linkage_check (t, /*relaxed_p=*/false);
8926 if (TYPE_ANONYMOUS_P (nt))
8927 error ("%qT is/uses anonymous type", t);
8929 error ("%qT uses local type %qT", t, nt);
8933 /* In order to avoid all sorts of complications, we do not
8934 allow variably-modified types as template arguments. */
8935 else if (variably_modified_type_p (t, NULL_TREE))
8937 if (complain & tf_error)
8938 error ("%qT is a variably modified type", t);
8942 /* A non-type argument of integral or enumerated type must be a
8944 else if (TREE_TYPE (t)
8945 && INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (t))
8946 && !TREE_CONSTANT (t))
8948 if (complain & tf_error)
8949 error ("integral expression %qE is not constant", t);
8953 if (result && error_p)
8954 error (" trying to instantiate %qD", tmpl);
8958 /* Instantiate the indicated variable or function template TMPL with
8959 the template arguments in TARG_PTR. */
8962 instantiate_template (tree tmpl, tree targ_ptr, tsubst_flags_t complain)
8968 if (tmpl == error_mark_node)
8969 return error_mark_node;
8971 gcc_assert (TREE_CODE (tmpl) == TEMPLATE_DECL);
8973 /* If this function is a clone, handle it specially. */
8974 if (DECL_CLONED_FUNCTION_P (tmpl))
8979 spec = instantiate_template (DECL_CLONED_FUNCTION (tmpl), targ_ptr,
8981 if (spec == error_mark_node)
8982 return error_mark_node;
8984 /* Look for the clone. */
8985 FOR_EACH_CLONE (clone, spec)
8986 if (DECL_NAME (clone) == DECL_NAME (tmpl))
8988 /* We should always have found the clone by now. */
8993 /* Check to see if we already have this specialization. */
8994 spec = retrieve_specialization (tmpl, targ_ptr,
8995 /*class_specializations_p=*/false);
8996 if (spec != NULL_TREE)
8999 gen_tmpl = most_general_template (tmpl);
9000 if (tmpl != gen_tmpl)
9002 /* The TMPL is a partial instantiation. To get a full set of
9003 arguments we must add the arguments used to perform the
9004 partial instantiation. */
9005 targ_ptr = add_outermost_template_args (DECL_TI_ARGS (tmpl),
9008 /* Check to see if we already have this specialization. */
9009 spec = retrieve_specialization (gen_tmpl, targ_ptr,
9010 /*class_specializations_p=*/false);
9011 if (spec != NULL_TREE)
9015 if (check_instantiated_args (gen_tmpl, INNERMOST_TEMPLATE_ARGS (targ_ptr),
9017 return error_mark_node;
9019 /* We are building a FUNCTION_DECL, during which the access of its
9020 parameters and return types have to be checked. However this
9021 FUNCTION_DECL which is the desired context for access checking
9022 is not built yet. We solve this chicken-and-egg problem by
9023 deferring all checks until we have the FUNCTION_DECL. */
9024 push_deferring_access_checks (dk_deferred);
9026 /* Substitute template parameters. */
9027 fndecl = tsubst (DECL_TEMPLATE_RESULT (gen_tmpl),
9028 targ_ptr, complain, gen_tmpl);
9030 /* Now we know the specialization, compute access previously
9032 push_access_scope (fndecl);
9033 perform_deferred_access_checks ();
9034 pop_access_scope (fndecl);
9035 pop_deferring_access_checks ();
9037 /* The DECL_TI_TEMPLATE should always be the immediate parent
9038 template, not the most general template. */
9039 DECL_TI_TEMPLATE (fndecl) = tmpl;
9041 /* If we've just instantiated the main entry point for a function,
9042 instantiate all the alternate entry points as well. We do this
9043 by cloning the instantiation of the main entry point, not by
9044 instantiating the template clones. */
9045 if (TREE_CHAIN (gen_tmpl) && DECL_CLONED_FUNCTION_P (TREE_CHAIN (gen_tmpl)))
9046 clone_function_decl (fndecl, /*update_method_vec_p=*/0);
9051 /* The FN is a TEMPLATE_DECL for a function. The ARGS are the
9052 arguments that are being used when calling it. TARGS is a vector
9053 into which the deduced template arguments are placed.
9055 Return zero for success, 2 for an incomplete match that doesn't resolve
9056 all the types, and 1 for complete failure. An error message will be
9057 printed only for an incomplete match.
9059 If FN is a conversion operator, or we are trying to produce a specific
9060 specialization, RETURN_TYPE is the return type desired.
9062 The EXPLICIT_TARGS are explicit template arguments provided via a
9065 The parameter STRICT is one of:
9068 We are deducing arguments for a function call, as in
9072 We are deducing arguments for a conversion function, as in
9076 We are deducing arguments when doing an explicit instantiation
9077 as in [temp.explicit], when determining an explicit specialization
9078 as in [temp.expl.spec], or when taking the address of a function
9079 template, as in [temp.deduct.funcaddr]. */
9082 fn_type_unification (tree fn,
9083 tree explicit_targs,
9087 unification_kind_t strict)
9093 gcc_assert (TREE_CODE (fn) == TEMPLATE_DECL);
9095 fntype = TREE_TYPE (fn);
9100 The specified template arguments must match the template
9101 parameters in kind (i.e., type, nontype, template), and there
9102 must not be more arguments than there are parameters;
9103 otherwise type deduction fails.
9105 Nontype arguments must match the types of the corresponding
9106 nontype template parameters, or must be convertible to the
9107 types of the corresponding nontype parameters as specified in
9108 _temp.arg.nontype_, otherwise type deduction fails.
9110 All references in the function type of the function template
9111 to the corresponding template parameters are replaced by the
9112 specified template argument values. If a substitution in a
9113 template parameter or in the function type of the function
9114 template results in an invalid type, type deduction fails. */
9116 tree converted_args;
9119 if (explicit_targs == error_mark_node)
9123 = (coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn),
9124 explicit_targs, NULL_TREE, tf_none,
9125 /*require_all_arguments=*/0));
9126 if (converted_args == error_mark_node)
9129 /* Substitute the explicit args into the function type. This is
9130 necessary so that, for instance, explicitly declared function
9131 arguments can match null pointed constants. If we were given
9132 an incomplete set of explicit args, we must not do semantic
9133 processing during substitution as we could create partial
9135 incomplete = NUM_TMPL_ARGS (explicit_targs) != NUM_TMPL_ARGS (targs);
9136 processing_template_decl += incomplete;
9137 fntype = tsubst (fntype, converted_args, tf_none, NULL_TREE);
9138 processing_template_decl -= incomplete;
9140 if (fntype == error_mark_node)
9143 /* Place the explicitly specified arguments in TARGS. */
9144 for (i = NUM_TMPL_ARGS (converted_args); i--;)
9145 TREE_VEC_ELT (targs, i) = TREE_VEC_ELT (converted_args, i);
9148 parms = TYPE_ARG_TYPES (fntype);
9149 /* Never do unification on the 'this' parameter. */
9150 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn))
9151 parms = TREE_CHAIN (parms);
9155 /* We've been given a return type to match, prepend it. */
9156 parms = tree_cons (NULL_TREE, TREE_TYPE (fntype), parms);
9157 args = tree_cons (NULL_TREE, return_type, args);
9160 /* We allow incomplete unification without an error message here
9161 because the standard doesn't seem to explicitly prohibit it. Our
9162 callers must be ready to deal with unification failures in any
9164 result = type_unification_real (DECL_INNERMOST_TEMPLATE_PARMS (fn),
9165 targs, parms, args, /*subr=*/0,
9166 strict, /*allow_incomplete*/1);
9169 /* All is well so far. Now, check:
9173 When all template arguments have been deduced, all uses of
9174 template parameters in nondeduced contexts are replaced with
9175 the corresponding deduced argument values. If the
9176 substitution results in an invalid type, as described above,
9177 type deduction fails. */
9178 if (tsubst (TREE_TYPE (fn), targs, tf_none, NULL_TREE)
9185 /* Adjust types before performing type deduction, as described in
9186 [temp.deduct.call] and [temp.deduct.conv]. The rules in these two
9187 sections are symmetric. PARM is the type of a function parameter
9188 or the return type of the conversion function. ARG is the type of
9189 the argument passed to the call, or the type of the value
9190 initialized with the result of the conversion function. */
9193 maybe_adjust_types_for_deduction (unification_kind_t strict,
9206 /* Swap PARM and ARG throughout the remainder of this
9207 function; the handling is precisely symmetric since PARM
9208 will initialize ARG rather than vice versa. */
9216 /* There is nothing to do in this case. */
9223 if (TREE_CODE (*parm) != REFERENCE_TYPE)
9225 /* [temp.deduct.call]
9227 If P is not a reference type:
9229 --If A is an array type, the pointer type produced by the
9230 array-to-pointer standard conversion (_conv.array_) is
9231 used in place of A for type deduction; otherwise,
9233 --If A is a function type, the pointer type produced by
9234 the function-to-pointer standard conversion
9235 (_conv.func_) is used in place of A for type deduction;
9238 --If A is a cv-qualified type, the top level
9239 cv-qualifiers of A's type are ignored for type
9241 if (TREE_CODE (*arg) == ARRAY_TYPE)
9242 *arg = build_pointer_type (TREE_TYPE (*arg));
9243 else if (TREE_CODE (*arg) == FUNCTION_TYPE)
9244 *arg = build_pointer_type (*arg);
9246 *arg = TYPE_MAIN_VARIANT (*arg);
9249 /* [temp.deduct.call]
9251 If P is a cv-qualified type, the top level cv-qualifiers
9252 of P's type are ignored for type deduction. If P is a
9253 reference type, the type referred to by P is used for
9255 *parm = TYPE_MAIN_VARIANT (*parm);
9256 if (TREE_CODE (*parm) == REFERENCE_TYPE)
9258 *parm = TREE_TYPE (*parm);
9259 result |= UNIFY_ALLOW_OUTER_MORE_CV_QUAL;
9262 /* DR 322. For conversion deduction, remove a reference type on parm
9263 too (which has been swapped into ARG). */
9264 if (strict == DEDUCE_CONV && TREE_CODE (*arg) == REFERENCE_TYPE)
9265 *arg = TREE_TYPE (*arg);
9270 /* Most parms like fn_type_unification.
9272 If SUBR is 1, we're being called recursively (to unify the
9273 arguments of a function or method parameter of a function
9277 type_unification_real (tree tparms,
9282 unification_kind_t strict,
9283 int allow_incomplete)
9287 int ntparms = TREE_VEC_LENGTH (tparms);
9289 int saw_undeduced = 0;
9292 gcc_assert (TREE_CODE (tparms) == TREE_VEC);
9293 gcc_assert (xparms == NULL_TREE || TREE_CODE (xparms) == TREE_LIST);
9294 gcc_assert (!xargs || TREE_CODE (xargs) == TREE_LIST);
9295 gcc_assert (ntparms > 0);
9300 sub_strict = (UNIFY_ALLOW_OUTER_LEVEL | UNIFY_ALLOW_MORE_CV_QUAL
9301 | UNIFY_ALLOW_DERIVED);
9305 sub_strict = UNIFY_ALLOW_LESS_CV_QUAL;
9309 sub_strict = UNIFY_ALLOW_NONE;
9320 while (parms && parms != void_list_node
9321 && args && args != void_list_node)
9323 parm = TREE_VALUE (parms);
9324 parms = TREE_CHAIN (parms);
9325 arg = TREE_VALUE (args);
9326 args = TREE_CHAIN (args);
9328 if (arg == error_mark_node)
9330 if (arg == unknown_type_node)
9331 /* We can't deduce anything from this, but we might get all the
9332 template args from other function args. */
9335 /* Conversions will be performed on a function argument that
9336 corresponds with a function parameter that contains only
9337 non-deducible template parameters and explicitly specified
9338 template parameters. */
9339 if (!uses_template_parms (parm))
9344 type = TREE_TYPE (arg);
9348 if (strict == DEDUCE_EXACT)
9350 if (same_type_p (parm, type))
9354 /* It might work; we shouldn't check now, because we might
9355 get into infinite recursion. Overload resolution will
9364 gcc_assert (TREE_TYPE (arg) != NULL_TREE);
9365 if (type_unknown_p (arg))
9367 /* [temp.deduct.type] A template-argument can be deduced from
9368 a pointer to function or pointer to member function
9369 argument if the set of overloaded functions does not
9370 contain function templates and at most one of a set of
9371 overloaded functions provides a unique match. */
9373 if (resolve_overloaded_unification
9374 (tparms, targs, parm, arg, strict, sub_strict)
9379 arg = TREE_TYPE (arg);
9380 if (arg == error_mark_node)
9385 int arg_strict = sub_strict;
9388 arg_strict |= maybe_adjust_types_for_deduction (strict, &parm, &arg);
9390 if (unify (tparms, targs, parm, arg, arg_strict))
9395 /* Fail if we've reached the end of the parm list, and more args
9396 are present, and the parm list isn't variadic. */
9397 if (args && args != void_list_node && parms == void_list_node)
9399 /* Fail if parms are left and they don't have default values. */
9400 if (parms && parms != void_list_node
9401 && TREE_PURPOSE (parms) == NULL_TREE)
9405 for (i = 0; i < ntparms; i++)
9406 if (!TREE_VEC_ELT (targs, i))
9408 tree tparm = TREE_VALUE (TREE_VEC_ELT (tparms, i));
9410 /* If this is an undeduced nontype parameter that depends on
9411 a type parameter, try another pass; its type may have been
9412 deduced from a later argument than the one from which
9413 this parameter can be deduced. */
9414 if (TREE_CODE (tparm) == PARM_DECL
9415 && uses_template_parms (TREE_TYPE (tparm))
9416 && !saw_undeduced++)
9419 if (!allow_incomplete)
9420 error ("incomplete type unification");
9427 /* Subroutine of type_unification_real. Args are like the variables at the
9428 call site. ARG is an overloaded function (or template-id); we try
9429 deducing template args from each of the overloads, and if only one
9430 succeeds, we go with that. Modifies TARGS and returns 0 on success. */
9433 resolve_overloaded_unification (tree tparms,
9437 unification_kind_t strict,
9440 tree tempargs = copy_node (targs);
9444 if (TREE_CODE (arg) == ADDR_EXPR)
9446 arg = TREE_OPERAND (arg, 0);
9452 if (TREE_CODE (arg) == COMPONENT_REF)
9453 /* Handle `&x' where `x' is some static or non-static member
9455 arg = TREE_OPERAND (arg, 1);
9457 if (TREE_CODE (arg) == OFFSET_REF)
9458 arg = TREE_OPERAND (arg, 1);
9460 /* Strip baselink information. */
9461 if (BASELINK_P (arg))
9462 arg = BASELINK_FUNCTIONS (arg);
9464 if (TREE_CODE (arg) == TEMPLATE_ID_EXPR)
9466 /* If we got some explicit template args, we need to plug them into
9467 the affected templates before we try to unify, in case the
9468 explicit args will completely resolve the templates in question. */
9470 tree expl_subargs = TREE_OPERAND (arg, 1);
9471 arg = TREE_OPERAND (arg, 0);
9473 for (; arg; arg = OVL_NEXT (arg))
9475 tree fn = OVL_CURRENT (arg);
9478 if (TREE_CODE (fn) != TEMPLATE_DECL)
9481 subargs = get_bindings (fn, DECL_TEMPLATE_RESULT (fn),
9482 expl_subargs, /*check_ret=*/false);
9485 elem = tsubst (TREE_TYPE (fn), subargs, tf_none, NULL_TREE);
9486 good += try_one_overload (tparms, targs, tempargs, parm,
9487 elem, strict, sub_strict, addr_p);
9493 gcc_assert (TREE_CODE (arg) == OVERLOAD
9494 || TREE_CODE (arg) == FUNCTION_DECL);
9496 for (; arg; arg = OVL_NEXT (arg))
9497 good += try_one_overload (tparms, targs, tempargs, parm,
9498 TREE_TYPE (OVL_CURRENT (arg)),
9499 strict, sub_strict, addr_p);
9502 /* [temp.deduct.type] A template-argument can be deduced from a pointer
9503 to function or pointer to member function argument if the set of
9504 overloaded functions does not contain function templates and at most
9505 one of a set of overloaded functions provides a unique match.
9507 So if we found multiple possibilities, we return success but don't
9512 int i = TREE_VEC_LENGTH (targs);
9514 if (TREE_VEC_ELT (tempargs, i))
9515 TREE_VEC_ELT (targs, i) = TREE_VEC_ELT (tempargs, i);
9523 /* Subroutine of resolve_overloaded_unification; does deduction for a single
9524 overload. Fills TARGS with any deduced arguments, or error_mark_node if
9525 different overloads deduce different arguments for a given parm.
9526 ADDR_P is true if the expression for which deduction is being
9527 performed was of the form "& fn" rather than simply "fn".
9529 Returns 1 on success. */
9532 try_one_overload (tree tparms,
9537 unification_kind_t strict,
9545 /* [temp.deduct.type] A template-argument can be deduced from a pointer
9546 to function or pointer to member function argument if the set of
9547 overloaded functions does not contain function templates and at most
9548 one of a set of overloaded functions provides a unique match.
9550 So if this is a template, just return success. */
9552 if (uses_template_parms (arg))
9555 if (TREE_CODE (arg) == METHOD_TYPE)
9556 arg = build_ptrmemfunc_type (build_pointer_type (arg));
9558 arg = build_pointer_type (arg);
9560 sub_strict |= maybe_adjust_types_for_deduction (strict, &parm, &arg);
9562 /* We don't copy orig_targs for this because if we have already deduced
9563 some template args from previous args, unify would complain when we
9564 try to deduce a template parameter for the same argument, even though
9565 there isn't really a conflict. */
9566 nargs = TREE_VEC_LENGTH (targs);
9567 tempargs = make_tree_vec (nargs);
9569 if (unify (tparms, tempargs, parm, arg, sub_strict) != 0)
9572 /* First make sure we didn't deduce anything that conflicts with
9573 explicitly specified args. */
9574 for (i = nargs; i--; )
9576 tree elt = TREE_VEC_ELT (tempargs, i);
9577 tree oldelt = TREE_VEC_ELT (orig_targs, i);
9581 else if (uses_template_parms (elt))
9582 /* Since we're unifying against ourselves, we will fill in
9583 template args used in the function parm list with our own
9584 template parms. Discard them. */
9585 TREE_VEC_ELT (tempargs, i) = NULL_TREE;
9586 else if (oldelt && !template_args_equal (oldelt, elt))
9590 for (i = nargs; i--; )
9592 tree elt = TREE_VEC_ELT (tempargs, i);
9595 TREE_VEC_ELT (targs, i) = elt;
9601 /* Verify that nondeduce template argument agrees with the type
9602 obtained from argument deduction. Return nonzero if the
9607 struct A { typedef int X; };
9608 template <class T, class U> struct C {};
9609 template <class T> struct C<T, typename T::X> {};
9611 Then with the instantiation `C<A, int>', we can deduce that
9612 `T' is `A' but unify () does not check whether `typename T::X'
9613 is `int'. This function ensure that they agree.
9615 TARGS, PARMS are the same as the arguments of unify.
9616 ARGS contains template arguments from all levels. */
9619 verify_class_unification (tree targs, tree parms, tree args)
9621 parms = tsubst (parms, add_outermost_template_args (args, targs),
9622 tf_none, NULL_TREE);
9623 if (parms == error_mark_node)
9626 return !comp_template_args (parms, INNERMOST_TEMPLATE_ARGS (args));
9629 /* PARM is a template class (perhaps with unbound template
9630 parameters). ARG is a fully instantiated type. If ARG can be
9631 bound to PARM, return ARG, otherwise return NULL_TREE. TPARMS and
9632 TARGS are as for unify. */
9635 try_class_unification (tree tparms, tree targs, tree parm, tree arg)
9639 if (!CLASSTYPE_TEMPLATE_INFO (arg)
9640 || (most_general_template (CLASSTYPE_TI_TEMPLATE (arg))
9641 != most_general_template (CLASSTYPE_TI_TEMPLATE (parm))))
9644 /* We need to make a new template argument vector for the call to
9645 unify. If we used TARGS, we'd clutter it up with the result of
9646 the attempted unification, even if this class didn't work out.
9647 We also don't want to commit ourselves to all the unifications
9648 we've already done, since unification is supposed to be done on
9649 an argument-by-argument basis. In other words, consider the
9650 following pathological case:
9652 template <int I, int J, int K>
9655 template <int I, int J>
9656 struct S<I, J, 2> : public S<I, I, I>, S<J, J, J> {};
9658 template <int I, int J, int K>
9659 void f(S<I, J, K>, S<I, I, I>);
9668 Now, by the time we consider the unification involving `s2', we
9669 already know that we must have `f<0, 0, 0>'. But, even though
9670 `S<0, 1, 2>' is derived from `S<0, 0, 0>', the code is invalid
9671 because there are two ways to unify base classes of S<0, 1, 2>
9672 with S<I, I, I>. If we kept the already deduced knowledge, we
9673 would reject the possibility I=1. */
9674 copy_of_targs = make_tree_vec (TREE_VEC_LENGTH (targs));
9676 /* If unification failed, we're done. */
9677 if (unify (tparms, copy_of_targs, CLASSTYPE_TI_ARGS (parm),
9678 CLASSTYPE_TI_ARGS (arg), UNIFY_ALLOW_NONE))
9684 /* Given a template type PARM and a class type ARG, find the unique
9685 base type in ARG that is an instance of PARM. We do not examine
9686 ARG itself; only its base-classes. If there is not exactly one
9687 appropriate base class, return NULL_TREE. PARM may be the type of
9688 a partial specialization, as well as a plain template type. Used
9692 get_template_base (tree tparms, tree targs, tree parm, tree arg)
9694 tree rval = NULL_TREE;
9697 gcc_assert (IS_AGGR_TYPE_CODE (TREE_CODE (arg)));
9699 binfo = TYPE_BINFO (complete_type (arg));
9701 /* The type could not be completed. */
9704 /* Walk in inheritance graph order. The search order is not
9705 important, and this avoids multiple walks of virtual bases. */
9706 for (binfo = TREE_CHAIN (binfo); binfo; binfo = TREE_CHAIN (binfo))
9708 tree r = try_class_unification (tparms, targs, parm, BINFO_TYPE (binfo));
9712 /* If there is more than one satisfactory baseclass, then:
9716 If they yield more than one possible deduced A, the type
9720 if (rval && !same_type_p (r, rval))
9730 /* Returns the level of DECL, which declares a template parameter. */
9733 template_decl_level (tree decl)
9735 switch (TREE_CODE (decl))
9739 return TEMPLATE_TYPE_LEVEL (TREE_TYPE (decl));
9742 return TEMPLATE_PARM_LEVEL (DECL_INITIAL (decl));
9750 /* Decide whether ARG can be unified with PARM, considering only the
9751 cv-qualifiers of each type, given STRICT as documented for unify.
9752 Returns nonzero iff the unification is OK on that basis. */
9755 check_cv_quals_for_unify (int strict, tree arg, tree parm)
9757 int arg_quals = cp_type_quals (arg);
9758 int parm_quals = cp_type_quals (parm);
9760 if (TREE_CODE (parm) == TEMPLATE_TYPE_PARM
9761 && !(strict & UNIFY_ALLOW_OUTER_MORE_CV_QUAL))
9763 /* Although a CVR qualifier is ignored when being applied to a
9764 substituted template parameter ([8.3.2]/1 for example), that
9765 does not apply during deduction [14.8.2.4]/1, (even though
9766 that is not explicitly mentioned, [14.8.2.4]/9 indicates
9767 this). Except when we're allowing additional CV qualifiers
9768 at the outer level [14.8.2.1]/3,1st bullet. */
9769 if ((TREE_CODE (arg) == REFERENCE_TYPE
9770 || TREE_CODE (arg) == FUNCTION_TYPE
9771 || TREE_CODE (arg) == METHOD_TYPE)
9772 && (parm_quals & (TYPE_QUAL_CONST | TYPE_QUAL_VOLATILE)))
9775 if ((!POINTER_TYPE_P (arg) && TREE_CODE (arg) != TEMPLATE_TYPE_PARM)
9776 && (parm_quals & TYPE_QUAL_RESTRICT))
9780 if (!(strict & (UNIFY_ALLOW_MORE_CV_QUAL | UNIFY_ALLOW_OUTER_MORE_CV_QUAL))
9781 && (arg_quals & parm_quals) != parm_quals)
9784 if (!(strict & (UNIFY_ALLOW_LESS_CV_QUAL | UNIFY_ALLOW_OUTER_LESS_CV_QUAL))
9785 && (parm_quals & arg_quals) != arg_quals)
9791 /* Takes parameters as for type_unification. Returns 0 if the
9792 type deduction succeeds, 1 otherwise. The parameter STRICT is a
9793 bitwise or of the following flags:
9796 Require an exact match between PARM and ARG.
9797 UNIFY_ALLOW_MORE_CV_QUAL:
9798 Allow the deduced ARG to be more cv-qualified (by qualification
9799 conversion) than ARG.
9800 UNIFY_ALLOW_LESS_CV_QUAL:
9801 Allow the deduced ARG to be less cv-qualified than ARG.
9802 UNIFY_ALLOW_DERIVED:
9803 Allow the deduced ARG to be a template base class of ARG,
9804 or a pointer to a template base class of the type pointed to by
9806 UNIFY_ALLOW_INTEGER:
9807 Allow any integral type to be deduced. See the TEMPLATE_PARM_INDEX
9808 case for more information.
9809 UNIFY_ALLOW_OUTER_LEVEL:
9810 This is the outermost level of a deduction. Used to determine validity
9811 of qualification conversions. A valid qualification conversion must
9812 have const qualified pointers leading up to the inner type which
9813 requires additional CV quals, except at the outer level, where const
9814 is not required [conv.qual]. It would be normal to set this flag in
9815 addition to setting UNIFY_ALLOW_MORE_CV_QUAL.
9816 UNIFY_ALLOW_OUTER_MORE_CV_QUAL:
9817 This is the outermost level of a deduction, and PARM can be more CV
9818 qualified at this point.
9819 UNIFY_ALLOW_OUTER_LESS_CV_QUAL:
9820 This is the outermost level of a deduction, and PARM can be less CV
9821 qualified at this point. */
9824 unify (tree tparms, tree targs, tree parm, tree arg, int strict)
9829 int strict_in = strict;
9831 /* I don't think this will do the right thing with respect to types.
9832 But the only case I've seen it in so far has been array bounds, where
9833 signedness is the only information lost, and I think that will be
9835 while (TREE_CODE (parm) == NOP_EXPR)
9836 parm = TREE_OPERAND (parm, 0);
9838 if (arg == error_mark_node)
9840 if (arg == unknown_type_node)
9841 /* We can't deduce anything from this, but we might get all the
9842 template args from other function args. */
9845 /* If PARM uses template parameters, then we can't bail out here,
9846 even if ARG == PARM, since we won't record unifications for the
9847 template parameters. We might need them if we're trying to
9848 figure out which of two things is more specialized. */
9849 if (arg == parm && !uses_template_parms (parm))
9852 /* Immediately reject some pairs that won't unify because of
9853 cv-qualification mismatches. */
9854 if (TREE_CODE (arg) == TREE_CODE (parm)
9856 /* It is the elements of the array which hold the cv quals of an array
9857 type, and the elements might be template type parms. We'll check
9859 && TREE_CODE (arg) != ARRAY_TYPE
9860 /* We check the cv-qualifiers when unifying with template type
9861 parameters below. We want to allow ARG `const T' to unify with
9862 PARM `T' for example, when computing which of two templates
9863 is more specialized, for example. */
9864 && TREE_CODE (arg) != TEMPLATE_TYPE_PARM
9865 && !check_cv_quals_for_unify (strict_in, arg, parm))
9868 if (!(strict & UNIFY_ALLOW_OUTER_LEVEL)
9869 && TYPE_P (parm) && !CP_TYPE_CONST_P (parm))
9870 strict &= ~UNIFY_ALLOW_MORE_CV_QUAL;
9871 strict &= ~UNIFY_ALLOW_OUTER_LEVEL;
9872 strict &= ~UNIFY_ALLOW_DERIVED;
9873 strict &= ~UNIFY_ALLOW_OUTER_MORE_CV_QUAL;
9874 strict &= ~UNIFY_ALLOW_OUTER_LESS_CV_QUAL;
9876 switch (TREE_CODE (parm))
9880 case UNBOUND_CLASS_TEMPLATE:
9881 /* In a type which contains a nested-name-specifier, template
9882 argument values cannot be deduced for template parameters used
9883 within the nested-name-specifier. */
9886 case TEMPLATE_TYPE_PARM:
9887 case TEMPLATE_TEMPLATE_PARM:
9888 case BOUND_TEMPLATE_TEMPLATE_PARM:
9889 tparm = TREE_VALUE (TREE_VEC_ELT (tparms, 0));
9891 if (TEMPLATE_TYPE_LEVEL (parm)
9892 != template_decl_level (tparm))
9893 /* The PARM is not one we're trying to unify. Just check
9894 to see if it matches ARG. */
9895 return (TREE_CODE (arg) == TREE_CODE (parm)
9896 && same_type_p (parm, arg)) ? 0 : 1;
9897 idx = TEMPLATE_TYPE_IDX (parm);
9898 targ = TREE_VEC_ELT (targs, idx);
9899 tparm = TREE_VALUE (TREE_VEC_ELT (tparms, idx));
9901 /* Check for mixed types and values. */
9902 if ((TREE_CODE (parm) == TEMPLATE_TYPE_PARM
9903 && TREE_CODE (tparm) != TYPE_DECL)
9904 || (TREE_CODE (parm) == TEMPLATE_TEMPLATE_PARM
9905 && TREE_CODE (tparm) != TEMPLATE_DECL))
9908 if (TREE_CODE (parm) == BOUND_TEMPLATE_TEMPLATE_PARM)
9910 /* ARG must be constructed from a template class or a template
9911 template parameter. */
9912 if (TREE_CODE (arg) != BOUND_TEMPLATE_TEMPLATE_PARM
9913 && (TREE_CODE (arg) != RECORD_TYPE || !CLASSTYPE_TEMPLATE_INFO (arg)))
9917 tree parmtmpl = TYPE_TI_TEMPLATE (parm);
9918 tree parmvec = TYPE_TI_ARGS (parm);
9919 tree argvec = INNERMOST_TEMPLATE_ARGS (TYPE_TI_ARGS (arg));
9921 = DECL_INNERMOST_TEMPLATE_PARMS (TYPE_TI_TEMPLATE (arg));
9924 /* The parameter and argument roles have to be switched here
9925 in order to handle default arguments properly. For example,
9926 template<template <class> class TT> void f(TT<int>)
9927 should be able to accept vector<int> which comes from
9928 template <class T, class Allocator = allocator>
9931 if (coerce_template_parms (argtmplvec, parmvec, parmtmpl, 0, 1)
9935 /* Deduce arguments T, i from TT<T> or TT<i>.
9936 We check each element of PARMVEC and ARGVEC individually
9937 rather than the whole TREE_VEC since they can have
9938 different number of elements. */
9940 for (i = 0; i < TREE_VEC_LENGTH (parmvec); ++i)
9942 if (unify (tparms, targs,
9943 TREE_VEC_ELT (parmvec, i),
9944 TREE_VEC_ELT (argvec, i),
9949 arg = TYPE_TI_TEMPLATE (arg);
9951 /* Fall through to deduce template name. */
9954 if (TREE_CODE (parm) == TEMPLATE_TEMPLATE_PARM
9955 || TREE_CODE (parm) == BOUND_TEMPLATE_TEMPLATE_PARM)
9957 /* Deduce template name TT from TT, TT<>, TT<T> and TT<i>. */
9959 /* Simple cases: Value already set, does match or doesn't. */
9960 if (targ != NULL_TREE && template_args_equal (targ, arg))
9967 /* If PARM is `const T' and ARG is only `int', we don't have
9968 a match unless we are allowing additional qualification.
9969 If ARG is `const int' and PARM is just `T' that's OK;
9970 that binds `const int' to `T'. */
9971 if (!check_cv_quals_for_unify (strict_in | UNIFY_ALLOW_LESS_CV_QUAL,
9975 /* Consider the case where ARG is `const volatile int' and
9976 PARM is `const T'. Then, T should be `volatile int'. */
9977 arg = cp_build_qualified_type_real
9978 (arg, cp_type_quals (arg) & ~cp_type_quals (parm), tf_none);
9979 if (arg == error_mark_node)
9982 /* Simple cases: Value already set, does match or doesn't. */
9983 if (targ != NULL_TREE && same_type_p (targ, arg))
9988 /* Make sure that ARG is not a variable-sized array. (Note
9989 that were talking about variable-sized arrays (like
9990 `int[n]'), rather than arrays of unknown size (like
9991 `int[]').) We'll get very confused by such a type since
9992 the bound of the array will not be computable in an
9993 instantiation. Besides, such types are not allowed in
9994 ISO C++, so we can do as we please here. */
9995 if (variably_modified_type_p (arg, NULL_TREE))
9999 TREE_VEC_ELT (targs, idx) = arg;
10002 case TEMPLATE_PARM_INDEX:
10003 tparm = TREE_VALUE (TREE_VEC_ELT (tparms, 0));
10005 if (TEMPLATE_PARM_LEVEL (parm)
10006 != template_decl_level (tparm))
10007 /* The PARM is not one we're trying to unify. Just check
10008 to see if it matches ARG. */
10009 return !(TREE_CODE (arg) == TREE_CODE (parm)
10010 && cp_tree_equal (parm, arg));
10012 idx = TEMPLATE_PARM_IDX (parm);
10013 targ = TREE_VEC_ELT (targs, idx);
10016 return !cp_tree_equal (targ, arg);
10018 /* [temp.deduct.type] If, in the declaration of a function template
10019 with a non-type template-parameter, the non-type
10020 template-parameter is used in an expression in the function
10021 parameter-list and, if the corresponding template-argument is
10022 deduced, the template-argument type shall match the type of the
10023 template-parameter exactly, except that a template-argument
10024 deduced from an array bound may be of any integral type.
10025 The non-type parameter might use already deduced type parameters. */
10026 tparm = tsubst (TREE_TYPE (parm), targs, 0, NULL_TREE);
10027 if (!TREE_TYPE (arg))
10028 /* Template-parameter dependent expression. Just accept it for now.
10029 It will later be processed in convert_template_argument. */
10031 else if (same_type_p (TREE_TYPE (arg), tparm))
10033 else if ((strict & UNIFY_ALLOW_INTEGER)
10034 && (TREE_CODE (tparm) == INTEGER_TYPE
10035 || TREE_CODE (tparm) == BOOLEAN_TYPE))
10036 /* Convert the ARG to the type of PARM; the deduced non-type
10037 template argument must exactly match the types of the
10038 corresponding parameter. */
10039 arg = fold (build_nop (TREE_TYPE (parm), arg));
10040 else if (uses_template_parms (tparm))
10041 /* We haven't deduced the type of this parameter yet. Try again
10047 TREE_VEC_ELT (targs, idx) = arg;
10052 /* A pointer-to-member constant can be unified only with
10053 another constant. */
10054 if (TREE_CODE (arg) != PTRMEM_CST)
10057 /* Just unify the class member. It would be useless (and possibly
10058 wrong, depending on the strict flags) to unify also
10059 PTRMEM_CST_CLASS, because we want to be sure that both parm and
10060 arg refer to the same variable, even if through different
10061 classes. For instance:
10063 struct A { int x; };
10066 Unification of &A::x and &B::x must succeed. */
10067 return unify (tparms, targs, PTRMEM_CST_MEMBER (parm),
10068 PTRMEM_CST_MEMBER (arg), strict);
10073 if (TREE_CODE (arg) != POINTER_TYPE)
10076 /* [temp.deduct.call]
10078 A can be another pointer or pointer to member type that can
10079 be converted to the deduced A via a qualification
10080 conversion (_conv.qual_).
10082 We pass down STRICT here rather than UNIFY_ALLOW_NONE.
10083 This will allow for additional cv-qualification of the
10084 pointed-to types if appropriate. */
10086 if (TREE_CODE (TREE_TYPE (arg)) == RECORD_TYPE)
10087 /* The derived-to-base conversion only persists through one
10088 level of pointers. */
10089 strict |= (strict_in & UNIFY_ALLOW_DERIVED);
10091 return unify (tparms, targs, TREE_TYPE (parm),
10092 TREE_TYPE (arg), strict);
10095 case REFERENCE_TYPE:
10096 if (TREE_CODE (arg) != REFERENCE_TYPE)
10098 return unify (tparms, targs, TREE_TYPE (parm), TREE_TYPE (arg),
10099 strict & UNIFY_ALLOW_MORE_CV_QUAL);
10102 if (TREE_CODE (arg) != ARRAY_TYPE)
10104 if ((TYPE_DOMAIN (parm) == NULL_TREE)
10105 != (TYPE_DOMAIN (arg) == NULL_TREE))
10107 if (TYPE_DOMAIN (parm) != NULL_TREE)
10112 parm_max = TYPE_MAX_VALUE (TYPE_DOMAIN (parm));
10113 arg_max = TYPE_MAX_VALUE (TYPE_DOMAIN (arg));
10115 /* Our representation of array types uses "N - 1" as the
10116 TYPE_MAX_VALUE for an array with "N" elements, if "N" is
10117 not an integer constant. */
10118 if (TREE_CODE (parm_max) == MINUS_EXPR)
10120 arg_max = fold_build2 (PLUS_EXPR,
10123 TREE_OPERAND (parm_max, 1));
10124 parm_max = TREE_OPERAND (parm_max, 0);
10127 if (unify (tparms, targs, parm_max, arg_max, UNIFY_ALLOW_INTEGER))
10130 return unify (tparms, targs, TREE_TYPE (parm), TREE_TYPE (arg),
10131 strict & UNIFY_ALLOW_MORE_CV_QUAL);
10138 case ENUMERAL_TYPE:
10140 if (TREE_CODE (arg) != TREE_CODE (parm))
10143 /* We have already checked cv-qualification at the top of the
10145 if (!same_type_ignoring_top_level_qualifiers_p (arg, parm))
10148 /* As far as unification is concerned, this wins. Later checks
10149 will invalidate it if necessary. */
10152 /* Types INTEGER_CST and MINUS_EXPR can come from array bounds. */
10153 /* Type INTEGER_CST can come from ordinary constant template args. */
10155 while (TREE_CODE (arg) == NOP_EXPR)
10156 arg = TREE_OPERAND (arg, 0);
10158 if (TREE_CODE (arg) != INTEGER_CST)
10160 return !tree_int_cst_equal (parm, arg);
10165 if (TREE_CODE (arg) != TREE_VEC)
10167 if (TREE_VEC_LENGTH (parm) != TREE_VEC_LENGTH (arg))
10169 for (i = 0; i < TREE_VEC_LENGTH (parm); ++i)
10170 if (unify (tparms, targs,
10171 TREE_VEC_ELT (parm, i), TREE_VEC_ELT (arg, i),
10179 if (TREE_CODE (arg) != TREE_CODE (parm))
10182 if (TYPE_PTRMEMFUNC_P (parm))
10184 if (!TYPE_PTRMEMFUNC_P (arg))
10187 return unify (tparms, targs,
10188 TYPE_PTRMEMFUNC_FN_TYPE (parm),
10189 TYPE_PTRMEMFUNC_FN_TYPE (arg),
10193 if (CLASSTYPE_TEMPLATE_INFO (parm))
10195 tree t = NULL_TREE;
10197 if (strict_in & UNIFY_ALLOW_DERIVED)
10199 /* First, we try to unify the PARM and ARG directly. */
10200 t = try_class_unification (tparms, targs,
10205 /* Fallback to the special case allowed in
10206 [temp.deduct.call]:
10208 If P is a class, and P has the form
10209 template-id, then A can be a derived class of
10210 the deduced A. Likewise, if P is a pointer to
10211 a class of the form template-id, A can be a
10212 pointer to a derived class pointed to by the
10214 t = get_template_base (tparms, targs, parm, arg);
10220 else if (CLASSTYPE_TEMPLATE_INFO (arg)
10221 && (CLASSTYPE_TI_TEMPLATE (parm)
10222 == CLASSTYPE_TI_TEMPLATE (arg)))
10223 /* Perhaps PARM is something like S<U> and ARG is S<int>.
10224 Then, we should unify `int' and `U'. */
10227 /* There's no chance of unification succeeding. */
10230 return unify (tparms, targs, CLASSTYPE_TI_ARGS (parm),
10231 CLASSTYPE_TI_ARGS (t), UNIFY_ALLOW_NONE);
10233 else if (!same_type_ignoring_top_level_qualifiers_p (parm, arg))
10238 case FUNCTION_TYPE:
10239 if (TREE_CODE (arg) != TREE_CODE (parm))
10242 if (unify (tparms, targs, TREE_TYPE (parm),
10243 TREE_TYPE (arg), UNIFY_ALLOW_NONE))
10245 return type_unification_real (tparms, targs, TYPE_ARG_TYPES (parm),
10246 TYPE_ARG_TYPES (arg), 1,
10250 /* Unify a pointer to member with a pointer to member function, which
10251 deduces the type of the member as a function type. */
10252 if (TYPE_PTRMEMFUNC_P (arg))
10256 cp_cv_quals cv_quals;
10258 /* Check top-level cv qualifiers */
10259 if (!check_cv_quals_for_unify (UNIFY_ALLOW_NONE, arg, parm))
10262 if (unify (tparms, targs, TYPE_OFFSET_BASETYPE (parm),
10263 TYPE_PTRMEMFUNC_OBJECT_TYPE (arg), UNIFY_ALLOW_NONE))
10266 /* Determine the type of the function we are unifying against. */
10267 method_type = TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (arg));
10269 build_function_type (TREE_TYPE (method_type),
10270 TREE_CHAIN (TYPE_ARG_TYPES (method_type)));
10272 /* Extract the cv-qualifiers of the member function from the
10273 implicit object parameter and place them on the function
10274 type to be restored later. */
10276 cp_type_quals(TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (method_type))));
10277 fntype = build_qualified_type (fntype, cv_quals);
10278 return unify (tparms, targs, TREE_TYPE (parm), fntype, strict);
10281 if (TREE_CODE (arg) != OFFSET_TYPE)
10283 if (unify (tparms, targs, TYPE_OFFSET_BASETYPE (parm),
10284 TYPE_OFFSET_BASETYPE (arg), UNIFY_ALLOW_NONE))
10286 return unify (tparms, targs, TREE_TYPE (parm), TREE_TYPE (arg),
10290 if (DECL_TEMPLATE_PARM_P (parm))
10291 return unify (tparms, targs, DECL_INITIAL (parm), arg, strict);
10292 if (arg != integral_constant_value (parm))
10297 case TEMPLATE_DECL:
10298 /* Matched cases are handled by the ARG == PARM test above. */
10302 gcc_assert (EXPR_P (parm));
10304 /* We must be looking at an expression. This can happen with
10308 void foo(S<I>, S<I + 2>);
10310 This is a "nondeduced context":
10314 The nondeduced contexts are:
10316 --A type that is a template-id in which one or more of
10317 the template-arguments is an expression that references
10318 a template-parameter.
10320 In these cases, we assume deduction succeeded, but don't
10321 actually infer any unifications. */
10323 if (!uses_template_parms (parm)
10324 && !template_args_equal (parm, arg))
10331 /* Note that DECL can be defined in this translation unit, if
10335 mark_definable (tree decl)
10338 DECL_NOT_REALLY_EXTERN (decl) = 1;
10339 FOR_EACH_CLONE (clone, decl)
10340 DECL_NOT_REALLY_EXTERN (clone) = 1;
10343 /* Called if RESULT is explicitly instantiated, or is a member of an
10344 explicitly instantiated class. */
10347 mark_decl_instantiated (tree result, int extern_p)
10349 SET_DECL_EXPLICIT_INSTANTIATION (result);
10351 /* If this entity has already been written out, it's too late to
10352 make any modifications. */
10353 if (TREE_ASM_WRITTEN (result))
10356 if (TREE_CODE (result) != FUNCTION_DECL)
10357 /* The TREE_PUBLIC flag for function declarations will have been
10358 set correctly by tsubst. */
10359 TREE_PUBLIC (result) = 1;
10361 /* This might have been set by an earlier implicit instantiation. */
10362 DECL_COMDAT (result) = 0;
10365 DECL_NOT_REALLY_EXTERN (result) = 0;
10368 mark_definable (result);
10369 /* Always make artificials weak. */
10370 if (DECL_ARTIFICIAL (result) && flag_weak)
10371 comdat_linkage (result);
10372 /* For WIN32 we also want to put explicit instantiations in
10373 linkonce sections. */
10374 else if (TREE_PUBLIC (result))
10375 maybe_make_one_only (result);
10378 /* If EXTERN_P, then this function will not be emitted -- unless
10379 followed by an explicit instantiation, at which point its linkage
10380 will be adjusted. If !EXTERN_P, then this function will be
10381 emitted here. In neither circumstance do we want
10382 import_export_decl to adjust the linkage. */
10383 DECL_INTERFACE_KNOWN (result) = 1;
10386 /* Given two function templates PAT1 and PAT2, return:
10388 1 if PAT1 is more specialized than PAT2 as described in [temp.func.order].
10389 -1 if PAT2 is more specialized than PAT1.
10390 0 if neither is more specialized.
10392 LEN indicates the number of parameters we should consider
10393 (defaulted parameters should not be considered).
10395 The 1998 std underspecified function template partial ordering, and
10396 DR214 addresses the issue. We take pairs of arguments, one from
10397 each of the templates, and deduce them against each other. One of
10398 the templates will be more specialized if all the *other*
10399 template's arguments deduce against its arguments and at least one
10400 of its arguments *does* *not* deduce against the other template's
10401 corresponding argument. Deduction is done as for class templates.
10402 The arguments used in deduction have reference and top level cv
10403 qualifiers removed. Iff both arguments were originally reference
10404 types *and* deduction succeeds in both directions, the template
10405 with the more cv-qualified argument wins for that pairing (if
10406 neither is more cv-qualified, they both are equal). Unlike regular
10407 deduction, after all the arguments have been deduced in this way,
10408 we do *not* verify the deduced template argument values can be
10409 substituted into non-deduced contexts, nor do we have to verify
10410 that all template arguments have been deduced. */
10413 more_specialized_fn (tree pat1, tree pat2, int len)
10415 tree decl1 = DECL_TEMPLATE_RESULT (pat1);
10416 tree decl2 = DECL_TEMPLATE_RESULT (pat2);
10417 tree targs1 = make_tree_vec (DECL_NTPARMS (pat1));
10418 tree targs2 = make_tree_vec (DECL_NTPARMS (pat2));
10419 tree tparms1 = DECL_INNERMOST_TEMPLATE_PARMS (pat1);
10420 tree tparms2 = DECL_INNERMOST_TEMPLATE_PARMS (pat2);
10421 tree args1 = TYPE_ARG_TYPES (TREE_TYPE (decl1));
10422 tree args2 = TYPE_ARG_TYPES (TREE_TYPE (decl2));
10426 /* If only one is a member function, they are unordered. */
10427 if (DECL_FUNCTION_MEMBER_P (decl1) != DECL_FUNCTION_MEMBER_P (decl2))
10430 /* Don't consider 'this' parameter. */
10431 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl1))
10432 args1 = TREE_CHAIN (args1);
10433 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl2))
10434 args2 = TREE_CHAIN (args2);
10436 /* If only one is a conversion operator, they are unordered. */
10437 if (DECL_CONV_FN_P (decl1) != DECL_CONV_FN_P (decl2))
10440 /* Consider the return type for a conversion function */
10441 if (DECL_CONV_FN_P (decl1))
10443 args1 = tree_cons (NULL_TREE, TREE_TYPE (TREE_TYPE (decl1)), args1);
10444 args2 = tree_cons (NULL_TREE, TREE_TYPE (TREE_TYPE (decl2)), args2);
10448 processing_template_decl++;
10452 tree arg1 = TREE_VALUE (args1);
10453 tree arg2 = TREE_VALUE (args2);
10454 int deduce1, deduce2;
10458 if (TREE_CODE (arg1) == REFERENCE_TYPE)
10460 arg1 = TREE_TYPE (arg1);
10461 quals1 = cp_type_quals (arg1);
10464 if (TREE_CODE (arg2) == REFERENCE_TYPE)
10466 arg2 = TREE_TYPE (arg2);
10467 quals2 = cp_type_quals (arg2);
10470 if ((quals1 < 0) != (quals2 < 0))
10472 /* Only of the args is a reference, see if we should apply
10473 array/function pointer decay to it. This is not part of
10474 DR214, but is, IMHO, consistent with the deduction rules
10475 for the function call itself, and with our earlier
10476 implementation of the underspecified partial ordering
10477 rules. (nathan). */
10480 switch (TREE_CODE (arg1))
10483 arg1 = TREE_TYPE (arg1);
10485 case FUNCTION_TYPE:
10486 arg1 = build_pointer_type (arg1);
10495 switch (TREE_CODE (arg2))
10498 arg2 = TREE_TYPE (arg2);
10500 case FUNCTION_TYPE:
10501 arg2 = build_pointer_type (arg2);
10510 arg1 = TYPE_MAIN_VARIANT (arg1);
10511 arg2 = TYPE_MAIN_VARIANT (arg2);
10513 deduce1 = !unify (tparms1, targs1, arg1, arg2, UNIFY_ALLOW_NONE);
10514 deduce2 = !unify (tparms2, targs2, arg2, arg1, UNIFY_ALLOW_NONE);
10520 if (better1 < 0 && better2 < 0)
10521 /* We've failed to deduce something in either direction.
10522 These must be unordered. */
10525 if (deduce1 && deduce2 && quals1 >= 0 && quals2 >= 0)
10527 /* Deduces in both directions, see if quals can
10528 disambiguate. Pretend the worse one failed to deduce. */
10529 if ((quals1 & quals2) == quals2)
10531 if ((quals1 & quals2) == quals1)
10534 if (deduce1 && !deduce2 && !better2)
10536 if (deduce2 && !deduce1 && !better1)
10539 args1 = TREE_CHAIN (args1);
10540 args2 = TREE_CHAIN (args2);
10543 processing_template_decl--;
10545 return (better1 > 0) - (better2 > 0);
10548 /* Given two class template specialization list nodes PAT1 and PAT2, return:
10550 1 if PAT1 is more specialized than PAT2 as described in [temp.class.order].
10551 -1 if PAT2 is more specialized than PAT1.
10552 0 if neither is more specialized.
10554 FULL_ARGS is the full set of template arguments that triggers this
10555 partial ordering. */
10558 more_specialized_class (tree pat1, tree pat2, tree full_args)
10563 /* Just like what happens for functions, if we are ordering between
10564 different class template specializations, we may encounter dependent
10565 types in the arguments, and we need our dependency check functions
10566 to behave correctly. */
10567 ++processing_template_decl;
10568 targs = get_class_bindings (TREE_VALUE (pat1), TREE_PURPOSE (pat1),
10569 add_outermost_template_args (full_args, TREE_PURPOSE (pat2)));
10573 targs = get_class_bindings (TREE_VALUE (pat2), TREE_PURPOSE (pat2),
10574 add_outermost_template_args (full_args, TREE_PURPOSE (pat1)));
10577 --processing_template_decl;
10582 /* Return the template arguments that will produce the function signature
10583 DECL from the function template FN, with the explicit template
10584 arguments EXPLICIT_ARGS. If CHECK_RETTYPE is true, the return type must
10585 also match. Return NULL_TREE if no satisfactory arguments could be
10589 get_bindings (tree fn, tree decl, tree explicit_args, bool check_rettype)
10591 int ntparms = DECL_NTPARMS (fn);
10592 tree targs = make_tree_vec (ntparms);
10594 tree decl_arg_types;
10596 /* Substitute the explicit template arguments into the type of DECL.
10597 The call to fn_type_unification will handle substitution into the
10599 decl_type = TREE_TYPE (decl);
10600 if (explicit_args && uses_template_parms (decl_type))
10603 tree converted_args;
10605 if (DECL_TEMPLATE_INFO (decl))
10606 tmpl = DECL_TI_TEMPLATE (decl);
10608 /* We can get here for some invalid specializations. */
10612 = (coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl),
10613 explicit_args, NULL_TREE,
10614 tf_none, /*require_all_arguments=*/0));
10615 if (converted_args == error_mark_node)
10618 decl_type = tsubst (decl_type, converted_args, tf_none, NULL_TREE);
10619 if (decl_type == error_mark_node)
10623 decl_arg_types = TYPE_ARG_TYPES (decl_type);
10624 /* Never do unification on the 'this' parameter. */
10625 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl))
10626 decl_arg_types = TREE_CHAIN (decl_arg_types);
10628 if (fn_type_unification (fn, explicit_args, targs,
10630 (check_rettype || DECL_CONV_FN_P (fn)
10631 ? TREE_TYPE (decl_type) : NULL_TREE),
10638 /* Return the innermost template arguments that, when applied to a
10639 template specialization whose innermost template parameters are
10640 TPARMS, and whose specialization arguments are PARMS, yield the
10643 For example, suppose we have:
10645 template <class T, class U> struct S {};
10646 template <class T> struct S<T*, int> {};
10648 Then, suppose we want to get `S<double*, int>'. The TPARMS will be
10649 {T}, the PARMS will be {T*, int} and the ARGS will be {double*,
10650 int}. The resulting vector will be {double}, indicating that `T'
10651 is bound to `double'. */
10654 get_class_bindings (tree tparms, tree parms, tree args)
10656 int i, ntparms = TREE_VEC_LENGTH (tparms);
10657 tree vec = make_tree_vec (ntparms);
10659 if (unify (tparms, vec, parms, INNERMOST_TEMPLATE_ARGS (args),
10663 for (i = 0; i < ntparms; ++i)
10664 if (! TREE_VEC_ELT (vec, i))
10667 if (verify_class_unification (vec, parms, args))
10673 /* In INSTANTIATIONS is a list of <INSTANTIATION, TEMPLATE> pairs.
10674 Pick the most specialized template, and return the corresponding
10675 instantiation, or if there is no corresponding instantiation, the
10676 template itself. If there is no most specialized template,
10677 error_mark_node is returned. If there are no templates at all,
10678 NULL_TREE is returned. */
10681 most_specialized_instantiation (tree instantiations)
10685 if (!instantiations)
10688 ++processing_template_decl;
10690 champ = instantiations;
10691 for (fn = TREE_CHAIN (instantiations); fn; fn = TREE_CHAIN (fn))
10695 if (get_bindings (TREE_VALUE (champ),
10696 DECL_TEMPLATE_RESULT (TREE_VALUE (fn)),
10697 NULL_TREE, /*check_ret=*/false))
10700 if (get_bindings (TREE_VALUE (fn),
10701 DECL_TEMPLATE_RESULT (TREE_VALUE (champ)),
10702 NULL_TREE, /*check_ret=*/false))
10708 /* Equally specialized, move to next function. If there
10709 is no next function, nothing's most specialized. */
10710 fn = TREE_CHAIN (fn);
10716 /* Now verify that champ is better than everything earlier in the
10717 instantiation list. */
10718 for (fn = instantiations; fn != champ; fn = TREE_CHAIN (fn))
10719 if (get_bindings (TREE_VALUE (champ),
10720 DECL_TEMPLATE_RESULT (TREE_VALUE (fn)),
10721 NULL_TREE, /*check_ret=*/false)
10722 || !get_bindings (TREE_VALUE (fn),
10723 DECL_TEMPLATE_RESULT (TREE_VALUE (champ)),
10724 NULL_TREE, /*check_ret=*/false))
10730 processing_template_decl--;
10733 return error_mark_node;
10735 return TREE_PURPOSE (champ) ? TREE_PURPOSE (champ) : TREE_VALUE (champ);
10738 /* Return the most specialized of the list of templates in FNS that can
10739 produce an instantiation matching DECL, given the explicit template
10740 arguments EXPLICIT_ARGS. */
10743 most_specialized (tree fns, tree decl, tree explicit_args)
10745 tree candidates = NULL_TREE;
10748 for (fn = fns; fn; fn = TREE_CHAIN (fn))
10750 tree candidate = TREE_VALUE (fn);
10752 args = get_bindings (candidate, decl, explicit_args, /*check_ret=*/true);
10754 candidates = tree_cons (NULL_TREE, candidate, candidates);
10757 return most_specialized_instantiation (candidates);
10760 /* If DECL is a specialization of some template, return the most
10761 general such template. Otherwise, returns NULL_TREE.
10763 For example, given:
10765 template <class T> struct S { template <class U> void f(U); };
10767 if TMPL is `template <class U> void S<int>::f(U)' this will return
10768 the full template. This function will not trace past partial
10769 specializations, however. For example, given in addition:
10771 template <class T> struct S<T*> { template <class U> void f(U); };
10773 if TMPL is `template <class U> void S<int*>::f(U)' this will return
10774 `template <class T> template <class U> S<T*>::f(U)'. */
10777 most_general_template (tree decl)
10779 /* If DECL is a FUNCTION_DECL, find the TEMPLATE_DECL of which it is
10780 an immediate specialization. */
10781 if (TREE_CODE (decl) == FUNCTION_DECL)
10783 if (DECL_TEMPLATE_INFO (decl)) {
10784 decl = DECL_TI_TEMPLATE (decl);
10786 /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE for a
10787 template friend. */
10788 if (TREE_CODE (decl) != TEMPLATE_DECL)
10794 /* Look for more and more general templates. */
10795 while (DECL_TEMPLATE_INFO (decl))
10797 /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE in some cases.
10798 (See cp-tree.h for details.) */
10799 if (TREE_CODE (DECL_TI_TEMPLATE (decl)) != TEMPLATE_DECL)
10802 if (CLASS_TYPE_P (TREE_TYPE (decl))
10803 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl)))
10806 /* Stop if we run into an explicitly specialized class template. */
10807 if (!DECL_NAMESPACE_SCOPE_P (decl)
10808 && DECL_CONTEXT (decl)
10809 && CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (decl)))
10812 decl = DECL_TI_TEMPLATE (decl);
10818 /* Return the most specialized of the class template specializations
10819 of TMPL which can produce an instantiation matching ARGS, or
10820 error_mark_node if the choice is ambiguous. */
10823 most_specialized_class (tree tmpl, tree args)
10825 tree list = NULL_TREE;
10830 tmpl = most_general_template (tmpl);
10831 for (t = DECL_TEMPLATE_SPECIALIZATIONS (tmpl); t; t = TREE_CHAIN (t))
10834 = get_class_bindings (TREE_VALUE (t), TREE_PURPOSE (t), args);
10837 list = tree_cons (TREE_PURPOSE (t), TREE_VALUE (t), list);
10838 TREE_TYPE (list) = TREE_TYPE (t);
10847 t = TREE_CHAIN (t);
10848 for (; t; t = TREE_CHAIN (t))
10850 fate = more_specialized_class (champ, t, args);
10857 t = TREE_CHAIN (t);
10859 return error_mark_node;
10865 for (t = list; t && t != champ; t = TREE_CHAIN (t))
10867 fate = more_specialized_class (champ, t, args);
10869 return error_mark_node;
10875 /* Explicitly instantiate DECL. */
10878 do_decl_instantiation (tree decl, tree storage)
10880 tree result = NULL_TREE;
10884 /* An error occurred, for which grokdeclarator has already issued
10885 an appropriate message. */
10887 else if (! DECL_LANG_SPECIFIC (decl))
10889 error ("explicit instantiation of non-template %q#D", decl);
10892 else if (TREE_CODE (decl) == VAR_DECL)
10894 /* There is an asymmetry here in the way VAR_DECLs and
10895 FUNCTION_DECLs are handled by grokdeclarator. In the case of
10896 the latter, the DECL we get back will be marked as a
10897 template instantiation, and the appropriate
10898 DECL_TEMPLATE_INFO will be set up. This does not happen for
10899 VAR_DECLs so we do the lookup here. Probably, grokdeclarator
10900 should handle VAR_DECLs as it currently handles
10902 result = lookup_field (DECL_CONTEXT (decl), DECL_NAME (decl), 0, false);
10903 if (!result || TREE_CODE (result) != VAR_DECL)
10905 error ("no matching template for %qD found", decl);
10909 else if (TREE_CODE (decl) != FUNCTION_DECL)
10911 error ("explicit instantiation of %q#D", decl);
10917 /* Check for various error cases. Note that if the explicit
10918 instantiation is valid the RESULT will currently be marked as an
10919 *implicit* instantiation; DECL_EXPLICIT_INSTANTIATION is not set
10920 until we get here. */
10922 if (DECL_TEMPLATE_SPECIALIZATION (result))
10924 /* DR 259 [temp.spec].
10926 Both an explicit instantiation and a declaration of an explicit
10927 specialization shall not appear in a program unless the explicit
10928 instantiation follows a declaration of the explicit specialization.
10930 For a given set of template parameters, if an explicit
10931 instantiation of a template appears after a declaration of an
10932 explicit specialization for that template, the explicit
10933 instantiation has no effect. */
10936 else if (DECL_EXPLICIT_INSTANTIATION (result))
10940 No program shall explicitly instantiate any template more
10943 We check DECL_NOT_REALLY_EXTERN so as not to complain when
10944 the first instantiation was `extern' and the second is not,
10945 and EXTERN_P for the opposite case. */
10946 if (DECL_NOT_REALLY_EXTERN (result) && !extern_p)
10947 pedwarn ("duplicate explicit instantiation of %q#D", result);
10948 /* If an "extern" explicit instantiation follows an ordinary
10949 explicit instantiation, the template is instantiated. */
10953 else if (!DECL_IMPLICIT_INSTANTIATION (result))
10955 error ("no matching template for %qD found", result);
10958 else if (!DECL_TEMPLATE_INFO (result))
10960 pedwarn ("explicit instantiation of non-template %q#D", result);
10964 if (storage == NULL_TREE)
10966 else if (storage == ridpointers[(int) RID_EXTERN])
10968 if (pedantic && !in_system_header)
10969 pedwarn ("ISO C++ forbids the use of %<extern%> on explicit "
10974 error ("storage class %qD applied to template instantiation", storage);
10976 mark_decl_instantiated (result, extern_p);
10978 instantiate_decl (result, /*defer_ok=*/1, /*undefined_ok=*/0);
10982 mark_class_instantiated (tree t, int extern_p)
10984 SET_CLASSTYPE_EXPLICIT_INSTANTIATION (t);
10985 SET_CLASSTYPE_INTERFACE_KNOWN (t);
10986 CLASSTYPE_INTERFACE_ONLY (t) = extern_p;
10987 TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (t)) = extern_p;
10990 CLASSTYPE_DEBUG_REQUESTED (t) = 1;
10991 rest_of_type_compilation (t, 1);
10995 /* Called from do_type_instantiation through binding_table_foreach to
10996 do recursive instantiation for the type bound in ENTRY. */
10998 bt_instantiate_type_proc (binding_entry entry, void *data)
11000 tree storage = *(tree *) data;
11002 if (IS_AGGR_TYPE (entry->type)
11003 && !uses_template_parms (CLASSTYPE_TI_ARGS (entry->type)))
11004 do_type_instantiation (TYPE_MAIN_DECL (entry->type), storage, 0);
11007 /* Called from do_type_instantiation to instantiate a member
11008 (a member function or a static member variable) of an
11009 explicitly instantiated class template. */
11011 instantiate_class_member (tree decl, int extern_p)
11013 mark_decl_instantiated (decl, extern_p);
11015 instantiate_decl (decl, /*defer_ok=*/1, /* undefined_ok=*/1);
11018 /* Perform an explicit instantiation of template class T. STORAGE, if
11019 non-null, is the RID for extern, inline or static. COMPLAIN is
11020 nonzero if this is called from the parser, zero if called recursively,
11021 since the standard is unclear (as detailed below). */
11024 do_type_instantiation (tree t, tree storage, tsubst_flags_t complain)
11029 int previous_instantiation_extern_p = 0;
11031 if (TREE_CODE (t) == TYPE_DECL)
11034 if (! CLASS_TYPE_P (t) || ! CLASSTYPE_TEMPLATE_INFO (t))
11036 error ("explicit instantiation of non-template type %qT", t);
11042 if (!COMPLETE_TYPE_P (t))
11044 if (complain & tf_error)
11045 error ("explicit instantiation of %q#T before definition of template",
11050 if (storage != NULL_TREE)
11052 if (pedantic && !in_system_header)
11053 pedwarn("ISO C++ forbids the use of %qE on explicit instantiations",
11056 if (storage == ridpointers[(int) RID_INLINE])
11058 else if (storage == ridpointers[(int) RID_EXTERN])
11060 else if (storage == ridpointers[(int) RID_STATIC])
11064 error ("storage class %qD applied to template instantiation",
11070 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (t))
11072 /* DR 259 [temp.spec].
11074 Both an explicit instantiation and a declaration of an explicit
11075 specialization shall not appear in a program unless the explicit
11076 instantiation follows a declaration of the explicit specialization.
11078 For a given set of template parameters, if an explicit
11079 instantiation of a template appears after a declaration of an
11080 explicit specialization for that template, the explicit
11081 instantiation has no effect. */
11084 else if (CLASSTYPE_EXPLICIT_INSTANTIATION (t))
11088 No program shall explicitly instantiate any template more
11091 If PREVIOUS_INSTANTIATION_EXTERN_P, then the first explicit
11092 instantiation was `extern'. If EXTERN_P then the second is.
11093 These cases are OK. */
11094 previous_instantiation_extern_p = CLASSTYPE_INTERFACE_ONLY (t);
11096 if (!previous_instantiation_extern_p && !extern_p
11097 && (complain & tf_error))
11098 pedwarn ("duplicate explicit instantiation of %q#T", t);
11100 /* If we've already instantiated the template, just return now. */
11101 if (!CLASSTYPE_INTERFACE_ONLY (t))
11105 mark_class_instantiated (t, extern_p);
11113 /* In contrast to implicit instantiation, where only the
11114 declarations, and not the definitions, of members are
11115 instantiated, we have here:
11119 The explicit instantiation of a class template specialization
11120 implies the instantiation of all of its members not
11121 previously explicitly specialized in the translation unit
11122 containing the explicit instantiation.
11124 Of course, we can't instantiate member template classes, since
11125 we don't have any arguments for them. Note that the standard
11126 is unclear on whether the instantiation of the members are
11127 *explicit* instantiations or not. However, the most natural
11128 interpretation is that it should be an explicit instantiation. */
11131 for (tmp = TYPE_METHODS (t); tmp; tmp = TREE_CHAIN (tmp))
11132 if (TREE_CODE (tmp) == FUNCTION_DECL
11133 && DECL_TEMPLATE_INSTANTIATION (tmp))
11134 instantiate_class_member (tmp, extern_p);
11136 for (tmp = TYPE_FIELDS (t); tmp; tmp = TREE_CHAIN (tmp))
11137 if (TREE_CODE (tmp) == VAR_DECL && DECL_TEMPLATE_INSTANTIATION (tmp))
11138 instantiate_class_member (tmp, extern_p);
11140 if (CLASSTYPE_NESTED_UTDS (t))
11141 binding_table_foreach (CLASSTYPE_NESTED_UTDS (t),
11142 bt_instantiate_type_proc, &storage);
11146 /* Given a function DECL, which is a specialization of TMPL, modify
11147 DECL to be a re-instantiation of TMPL with the same template
11148 arguments. TMPL should be the template into which tsubst'ing
11149 should occur for DECL, not the most general template.
11151 One reason for doing this is a scenario like this:
11154 void f(const T&, int i);
11156 void g() { f(3, 7); }
11159 void f(const T& t, const int i) { }
11161 Note that when the template is first instantiated, with
11162 instantiate_template, the resulting DECL will have no name for the
11163 first parameter, and the wrong type for the second. So, when we go
11164 to instantiate the DECL, we regenerate it. */
11167 regenerate_decl_from_template (tree decl, tree tmpl)
11169 /* The arguments used to instantiate DECL, from the most general
11174 args = DECL_TI_ARGS (decl);
11175 code_pattern = DECL_TEMPLATE_RESULT (tmpl);
11177 /* Make sure that we can see identifiers, and compute access
11179 push_access_scope (decl);
11181 if (TREE_CODE (decl) == FUNCTION_DECL)
11189 args_depth = TMPL_ARGS_DEPTH (args);
11190 parms_depth = TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl));
11191 if (args_depth > parms_depth)
11192 args = get_innermost_template_args (args, parms_depth);
11194 specs = tsubst_exception_specification (TREE_TYPE (code_pattern),
11195 args, tf_error, NULL_TREE);
11197 TREE_TYPE (decl) = build_exception_variant (TREE_TYPE (decl),
11200 /* Merge parameter declarations. */
11201 decl_parm = skip_artificial_parms_for (decl,
11202 DECL_ARGUMENTS (decl));
11204 = skip_artificial_parms_for (code_pattern,
11205 DECL_ARGUMENTS (code_pattern));
11211 if (DECL_NAME (decl_parm) != DECL_NAME (pattern_parm))
11212 DECL_NAME (decl_parm) = DECL_NAME (pattern_parm);
11213 parm_type = tsubst (TREE_TYPE (pattern_parm), args, tf_error,
11215 parm_type = type_decays_to (parm_type);
11216 if (!same_type_p (TREE_TYPE (decl_parm), parm_type))
11217 TREE_TYPE (decl_parm) = parm_type;
11218 attributes = DECL_ATTRIBUTES (pattern_parm);
11219 if (DECL_ATTRIBUTES (decl_parm) != attributes)
11221 DECL_ATTRIBUTES (decl_parm) = attributes;
11222 cplus_decl_attributes (&decl_parm, attributes, /*flags=*/0);
11224 decl_parm = TREE_CHAIN (decl_parm);
11225 pattern_parm = TREE_CHAIN (pattern_parm);
11228 /* Merge additional specifiers from the CODE_PATTERN. */
11229 if (DECL_DECLARED_INLINE_P (code_pattern)
11230 && !DECL_DECLARED_INLINE_P (decl))
11231 DECL_DECLARED_INLINE_P (decl) = 1;
11232 if (DECL_INLINE (code_pattern) && !DECL_INLINE (decl))
11233 DECL_INLINE (decl) = 1;
11235 else if (TREE_CODE (decl) == VAR_DECL)
11237 if (!DECL_INITIALIZED_IN_CLASS_P (decl)
11238 && DECL_INITIAL (code_pattern))
11239 DECL_INITIAL (decl) =
11240 tsubst_expr (DECL_INITIAL (code_pattern), args,
11241 tf_error, DECL_TI_TEMPLATE (decl));
11244 gcc_unreachable ();
11246 pop_access_scope (decl);
11249 /* Return the TEMPLATE_DECL into which DECL_TI_ARGS(DECL) should be
11250 substituted to get DECL. */
11253 template_for_substitution (tree decl)
11255 tree tmpl = DECL_TI_TEMPLATE (decl);
11257 /* Set TMPL to the template whose DECL_TEMPLATE_RESULT is the pattern
11258 for the instantiation. This is not always the most general
11259 template. Consider, for example:
11262 struct S { template <class U> void f();
11263 template <> void f<int>(); };
11265 and an instantiation of S<double>::f<int>. We want TD to be the
11266 specialization S<T>::f<int>, not the more general S<T>::f<U>. */
11267 while (/* An instantiation cannot have a definition, so we need a
11268 more general template. */
11269 DECL_TEMPLATE_INSTANTIATION (tmpl)
11270 /* We must also deal with friend templates. Given:
11272 template <class T> struct S {
11273 template <class U> friend void f() {};
11276 S<int>::f<U> say, is not an instantiation of S<T>::f<U>,
11277 so far as the language is concerned, but that's still
11278 where we get the pattern for the instantiation from. On
11279 other hand, if the definition comes outside the class, say:
11281 template <class T> struct S {
11282 template <class U> friend void f();
11284 template <class U> friend void f() {}
11286 we don't need to look any further. That's what the check for
11287 DECL_INITIAL is for. */
11288 || (TREE_CODE (decl) == FUNCTION_DECL
11289 && DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (tmpl)
11290 && !DECL_INITIAL (DECL_TEMPLATE_RESULT (tmpl))))
11292 /* The present template, TD, should not be a definition. If it
11293 were a definition, we should be using it! Note that we
11294 cannot restructure the loop to just keep going until we find
11295 a template with a definition, since that might go too far if
11296 a specialization was declared, but not defined. */
11297 gcc_assert (TREE_CODE (decl) != VAR_DECL
11298 || DECL_IN_AGGR_P (DECL_TEMPLATE_RESULT (tmpl)));
11300 /* Fetch the more general template. */
11301 tmpl = DECL_TI_TEMPLATE (tmpl);
11307 /* Produce the definition of D, a _DECL generated from a template. If
11308 DEFER_OK is nonzero, then we don't have to actually do the
11309 instantiation now; we just have to do it sometime. Normally it is
11310 an error if this is an explicit instantiation but D is undefined.
11311 If UNDEFINED_OK is nonzero, then instead we treat it as an implicit
11312 instantiation. UNDEFINED_OK is nonzero only if we are being used
11313 to instantiate the members of an explicitly instantiated class
11318 instantiate_decl (tree d, int defer_ok, int undefined_ok)
11320 tree tmpl = DECL_TI_TEMPLATE (d);
11327 int pattern_defined;
11329 location_t saved_loc = input_location;
11331 /* This function should only be used to instantiate templates for
11332 functions and static member variables. */
11333 gcc_assert (TREE_CODE (d) == FUNCTION_DECL
11334 || TREE_CODE (d) == VAR_DECL);
11336 /* Variables are never deferred; if instantiation is required, they
11337 are instantiated right away. That allows for better code in the
11338 case that an expression refers to the value of the variable --
11339 if the variable has a constant value the referring expression can
11340 take advantage of that fact. */
11341 if (TREE_CODE (d) == VAR_DECL)
11344 /* Don't instantiate cloned functions. Instead, instantiate the
11345 functions they cloned. */
11346 if (TREE_CODE (d) == FUNCTION_DECL && DECL_CLONED_FUNCTION_P (d))
11347 d = DECL_CLONED_FUNCTION (d);
11349 if (DECL_TEMPLATE_INSTANTIATED (d))
11350 /* D has already been instantiated. It might seem reasonable to
11351 check whether or not D is an explicit instantiation, and, if so,
11352 stop here. But when an explicit instantiation is deferred
11353 until the end of the compilation, DECL_EXPLICIT_INSTANTIATION
11354 is set, even though we still need to do the instantiation. */
11357 /* If we already have a specialization of this declaration, then
11358 there's no reason to instantiate it. Note that
11359 retrieve_specialization gives us both instantiations and
11360 specializations, so we must explicitly check
11361 DECL_TEMPLATE_SPECIALIZATION. */
11362 gen_tmpl = most_general_template (tmpl);
11363 gen_args = DECL_TI_ARGS (d);
11364 spec = retrieve_specialization (gen_tmpl, gen_args,
11365 /*class_specializations_p=*/false);
11366 if (spec != NULL_TREE && DECL_TEMPLATE_SPECIALIZATION (spec))
11369 /* This needs to happen before any tsubsting. */
11370 if (! push_tinst_level (d))
11373 timevar_push (TV_PARSE);
11375 /* We may be in the middle of deferred access check. Disable it now. */
11376 push_deferring_access_checks (dk_no_deferred);
11378 /* Set TD to the template whose DECL_TEMPLATE_RESULT is the pattern
11379 for the instantiation. */
11380 td = template_for_substitution (d);
11381 code_pattern = DECL_TEMPLATE_RESULT (td);
11383 if ((DECL_NAMESPACE_SCOPE_P (d) && !DECL_INITIALIZED_IN_CLASS_P (d))
11384 || DECL_TEMPLATE_SPECIALIZATION (td))
11385 /* In the case of a friend template whose definition is provided
11386 outside the class, we may have too many arguments. Drop the
11387 ones we don't need. The same is true for specializations. */
11388 args = get_innermost_template_args
11389 (gen_args, TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (td)));
11393 if (TREE_CODE (d) == FUNCTION_DECL)
11394 pattern_defined = (DECL_SAVED_TREE (code_pattern) != NULL_TREE);
11396 pattern_defined = ! DECL_IN_AGGR_P (code_pattern);
11397 /* Unless an explicit instantiation directive has already determined
11398 the linkage of D, remember that a definition is available for
11400 if (pattern_defined
11401 && !DECL_INTERFACE_KNOWN (d)
11402 && !DECL_NOT_REALLY_EXTERN (d))
11403 mark_definable (d);
11405 input_location = DECL_SOURCE_LOCATION (d);
11407 if (! pattern_defined && DECL_EXPLICIT_INSTANTIATION (d) && undefined_ok)
11409 DECL_NOT_REALLY_EXTERN (d) = 0;
11410 SET_DECL_IMPLICIT_INSTANTIATION (d);
11415 /* Recheck the substitutions to obtain any warning messages
11416 about ignoring cv qualifiers. */
11417 tree gen = DECL_TEMPLATE_RESULT (gen_tmpl);
11418 tree type = TREE_TYPE (gen);
11420 /* Make sure that we can see identifiers, and compute access
11421 correctly. D is already the target FUNCTION_DECL with the
11423 push_access_scope (d);
11425 if (TREE_CODE (gen) == FUNCTION_DECL)
11427 tsubst (DECL_ARGUMENTS (gen), gen_args, tf_error | tf_warning, d);
11428 tsubst (TYPE_RAISES_EXCEPTIONS (type), gen_args,
11429 tf_error | tf_warning, d);
11430 /* Don't simply tsubst the function type, as that will give
11431 duplicate warnings about poor parameter qualifications.
11432 The function arguments are the same as the decl_arguments
11433 without the top level cv qualifiers. */
11434 type = TREE_TYPE (type);
11436 tsubst (type, gen_args, tf_error | tf_warning, d);
11438 pop_access_scope (d);
11441 /* We should have set up DECL_INITIAL in instantiate_class_template
11442 for in-class definitions of static data members. */
11443 gcc_assert (!(TREE_CODE (d) == VAR_DECL
11444 && DECL_INITIALIZED_IN_CLASS_P (d)
11445 && DECL_INITIAL (d) == NULL_TREE));
11447 /* Do not instantiate templates that we know will be defined
11449 if (DECL_INTERFACE_KNOWN (d)
11450 && DECL_REALLY_EXTERN (d)
11451 && ! (TREE_CODE (d) == FUNCTION_DECL
11452 && DECL_INLINE (d)))
11454 /* Defer all other templates, unless we have been explicitly
11455 forbidden from doing so. We restore the source position here
11456 because it's used by add_pending_template. */
11457 else if (! pattern_defined || defer_ok)
11459 input_location = saved_loc;
11461 if (at_eof && !pattern_defined
11462 && DECL_EXPLICIT_INSTANTIATION (d))
11465 The definition of a non-exported function template, a
11466 non-exported member function template, or a non-exported
11467 member function or static data member of a class template
11468 shall be present in every translation unit in which it is
11469 explicitly instantiated. */
11471 ("explicit instantiation of %qD but no definition available", d);
11473 add_pending_template (d);
11476 /* Tell the repository that D is available in this translation unit
11477 -- and see if it is supposed to be instantiated here. */
11478 if (TREE_PUBLIC (d) && !DECL_REALLY_EXTERN (d) && !repo_emit_p (d))
11480 /* In a PCH file, despite the fact that the repository hasn't
11481 requested instantiation in the PCH it is still possible that
11482 an instantiation will be required in a file that includes the
11485 add_pending_template (d);
11486 /* Instantiate inline functions so that the inliner can do its
11487 job, even though we'll not be emitting a copy of this
11489 if (!(TREE_CODE (d) == FUNCTION_DECL
11490 && flag_inline_trees
11491 && DECL_DECLARED_INLINE_P (d)))
11495 need_push = !cfun || !global_bindings_p ();
11497 push_to_top_level ();
11499 /* Mark D as instantiated so that recursive calls to
11500 instantiate_decl do not try to instantiate it again. */
11501 DECL_TEMPLATE_INSTANTIATED (d) = 1;
11503 /* Regenerate the declaration in case the template has been modified
11504 by a subsequent redeclaration. */
11505 regenerate_decl_from_template (d, td);
11507 /* We already set the file and line above. Reset them now in case
11508 they changed as a result of calling regenerate_decl_from_template. */
11509 input_location = DECL_SOURCE_LOCATION (d);
11511 if (TREE_CODE (d) == VAR_DECL)
11513 /* Clear out DECL_RTL; whatever was there before may not be right
11514 since we've reset the type of the declaration. */
11515 SET_DECL_RTL (d, NULL_RTX);
11516 DECL_IN_AGGR_P (d) = 0;
11518 /* Clear DECL_EXTERNAL so that cp_finish_decl will process the
11519 initializer. That function will defer actual emission until
11520 we have a chance to determine linkage. */
11521 DECL_EXTERNAL (d) = 0;
11523 /* Enter the scope of D so that access-checking works correctly. */
11524 push_nested_class (DECL_CONTEXT (d));
11526 (!DECL_INITIALIZED_IN_CLASS_P (d)
11527 ? DECL_INITIAL (d) : NULL_TREE),
11529 pop_nested_class ();
11531 else if (TREE_CODE (d) == FUNCTION_DECL)
11533 htab_t saved_local_specializations;
11538 /* Save away the current list, in case we are instantiating one
11539 template from within the body of another. */
11540 saved_local_specializations = local_specializations;
11542 /* Set up the list of local specializations. */
11543 local_specializations = htab_create (37,
11544 hash_local_specialization,
11545 eq_local_specializations,
11548 /* Set up context. */
11549 start_preparsed_function (d, NULL_TREE, SF_PRE_PARSED);
11551 /* Create substitution entries for the parameters. */
11552 subst_decl = DECL_TEMPLATE_RESULT (template_for_substitution (d));
11553 tmpl_parm = DECL_ARGUMENTS (subst_decl);
11554 spec_parm = DECL_ARGUMENTS (d);
11555 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (d))
11557 register_local_specialization (spec_parm, tmpl_parm);
11558 spec_parm = skip_artificial_parms_for (d, spec_parm);
11559 tmpl_parm = skip_artificial_parms_for (subst_decl, tmpl_parm);
11563 register_local_specialization (spec_parm, tmpl_parm);
11564 tmpl_parm = TREE_CHAIN (tmpl_parm);
11565 spec_parm = TREE_CHAIN (spec_parm);
11567 gcc_assert (!spec_parm);
11569 /* Substitute into the body of the function. */
11570 tsubst_expr (DECL_SAVED_TREE (code_pattern), args,
11571 tf_error | tf_warning, tmpl);
11573 /* We don't need the local specializations any more. */
11574 htab_delete (local_specializations);
11575 local_specializations = saved_local_specializations;
11577 /* Finish the function. */
11578 d = finish_function (0);
11579 expand_or_defer_fn (d);
11582 /* We're not deferring instantiation any more. */
11583 TI_PENDING_TEMPLATE_FLAG (DECL_TEMPLATE_INFO (d)) = 0;
11586 pop_from_top_level ();
11589 input_location = saved_loc;
11590 pop_deferring_access_checks ();
11591 pop_tinst_level ();
11593 timevar_pop (TV_PARSE);
11598 /* Run through the list of templates that we wish we could
11599 instantiate, and instantiate any we can. RETRIES is the
11600 number of times we retry pending template instantiation. */
11603 instantiate_pending_templates (int retries)
11606 tree last = NULL_TREE;
11608 location_t saved_loc = input_location;
11609 int saved_in_system_header = in_system_header;
11611 /* Instantiating templates may trigger vtable generation. This in turn
11612 may require further template instantiations. We place a limit here
11613 to avoid infinite loop. */
11614 if (pending_templates && retries >= max_tinst_depth)
11616 cp_error_at ("template instantiation depth exceeds maximum of %d"
11617 " (use -ftemplate-depth-NN to increase the maximum)"
11618 " instantiating %q+D, possibly from virtual table"
11620 max_tinst_depth, TREE_VALUE (pending_templates));
11628 t = &pending_templates;
11631 tree instantiation = TREE_VALUE (*t);
11633 reopen_tinst_level (TREE_PURPOSE (*t));
11635 if (TYPE_P (instantiation))
11639 if (!COMPLETE_TYPE_P (instantiation))
11641 instantiate_class_template (instantiation);
11642 if (CLASSTYPE_TEMPLATE_INSTANTIATION (instantiation))
11643 for (fn = TYPE_METHODS (instantiation);
11645 fn = TREE_CHAIN (fn))
11646 if (! DECL_ARTIFICIAL (fn))
11647 instantiate_decl (fn, /*defer_ok=*/0,
11648 /*undefined_ok=*/0);
11649 if (COMPLETE_TYPE_P (instantiation))
11653 if (COMPLETE_TYPE_P (instantiation))
11654 /* If INSTANTIATION has been instantiated, then we don't
11655 need to consider it again in the future. */
11656 *t = TREE_CHAIN (*t);
11660 t = &TREE_CHAIN (*t);
11665 if (!DECL_TEMPLATE_SPECIALIZATION (instantiation)
11666 && !DECL_TEMPLATE_INSTANTIATED (instantiation))
11668 instantiation = instantiate_decl (instantiation,
11670 /*undefined_ok=*/0);
11671 if (DECL_TEMPLATE_INSTANTIATED (instantiation))
11675 if (DECL_TEMPLATE_SPECIALIZATION (instantiation)
11676 || DECL_TEMPLATE_INSTANTIATED (instantiation))
11677 /* If INSTANTIATION has been instantiated, then we don't
11678 need to consider it again in the future. */
11679 *t = TREE_CHAIN (*t);
11683 t = &TREE_CHAIN (*t);
11687 current_tinst_level = NULL_TREE;
11689 last_pending_template = last;
11691 while (reconsider);
11693 input_location = saved_loc;
11694 in_system_header = saved_in_system_header;
11697 /* Substitute ARGVEC into T, which is a list of initializers for
11698 either base class or a non-static data member. The TREE_PURPOSEs
11699 are DECLs, and the TREE_VALUEs are the initializer values. Used by
11700 instantiate_decl. */
11703 tsubst_initializer_list (tree t, tree argvec)
11705 tree inits = NULL_TREE;
11707 for (; t; t = TREE_CHAIN (t))
11712 decl = tsubst_copy (TREE_PURPOSE (t), argvec, tf_error | tf_warning,
11714 decl = expand_member_init (decl);
11715 if (decl && !DECL_P (decl))
11716 in_base_initializer = 1;
11718 init = tsubst_expr (TREE_VALUE (t), argvec, tf_error | tf_warning,
11720 in_base_initializer = 0;
11724 init = build_tree_list (decl, init);
11725 TREE_CHAIN (init) = inits;
11732 /* Set CURRENT_ACCESS_SPECIFIER based on the protection of DECL. */
11735 set_current_access_from_decl (tree decl)
11737 if (TREE_PRIVATE (decl))
11738 current_access_specifier = access_private_node;
11739 else if (TREE_PROTECTED (decl))
11740 current_access_specifier = access_protected_node;
11742 current_access_specifier = access_public_node;
11745 /* Instantiate an enumerated type. TAG is the template type, NEWTAG
11746 is the instantiation (which should have been created with
11747 start_enum) and ARGS are the template arguments to use. */
11750 tsubst_enum (tree tag, tree newtag, tree args)
11754 for (e = TYPE_VALUES (tag); e; e = TREE_CHAIN (e))
11759 decl = TREE_VALUE (e);
11760 /* Note that in a template enum, the TREE_VALUE is the
11761 CONST_DECL, not the corresponding INTEGER_CST. */
11762 value = tsubst_expr (DECL_INITIAL (decl),
11763 args, tf_error | tf_warning,
11766 /* Give this enumeration constant the correct access. */
11767 set_current_access_from_decl (decl);
11769 /* Actually build the enumerator itself. */
11770 build_enumerator (DECL_NAME (decl), value, newtag);
11773 finish_enum (newtag);
11774 DECL_SOURCE_LOCATION (TYPE_NAME (newtag))
11775 = DECL_SOURCE_LOCATION (TYPE_NAME (tag));
11778 /* DECL is a FUNCTION_DECL that is a template specialization. Return
11779 its type -- but without substituting the innermost set of template
11780 arguments. So, innermost set of template parameters will appear in
11784 get_mostly_instantiated_function_type (tree decl)
11792 tmpl = most_general_template (DECL_TI_TEMPLATE (decl));
11793 targs = DECL_TI_ARGS (decl);
11794 tparms = DECL_TEMPLATE_PARMS (tmpl);
11795 parm_depth = TMPL_PARMS_DEPTH (tparms);
11797 /* There should be as many levels of arguments as there are levels
11799 gcc_assert (parm_depth == TMPL_ARGS_DEPTH (targs));
11801 fn_type = TREE_TYPE (tmpl);
11803 if (parm_depth == 1)
11804 /* No substitution is necessary. */
11808 int i, save_access_control;
11811 /* Replace the innermost level of the TARGS with NULL_TREEs to
11812 let tsubst know not to substitute for those parameters. */
11813 partial_args = make_tree_vec (TREE_VEC_LENGTH (targs));
11814 for (i = 1; i < TMPL_ARGS_DEPTH (targs); ++i)
11815 SET_TMPL_ARGS_LEVEL (partial_args, i,
11816 TMPL_ARGS_LEVEL (targs, i));
11817 SET_TMPL_ARGS_LEVEL (partial_args,
11818 TMPL_ARGS_DEPTH (targs),
11819 make_tree_vec (DECL_NTPARMS (tmpl)));
11821 /* Disable access control as this function is used only during
11823 save_access_control = flag_access_control;
11824 flag_access_control = 0;
11826 ++processing_template_decl;
11827 /* Now, do the (partial) substitution to figure out the
11828 appropriate function type. */
11829 fn_type = tsubst (fn_type, partial_args, tf_error, NULL_TREE);
11830 --processing_template_decl;
11832 /* Substitute into the template parameters to obtain the real
11833 innermost set of parameters. This step is important if the
11834 innermost set of template parameters contains value
11835 parameters whose types depend on outer template parameters. */
11836 TREE_VEC_LENGTH (partial_args)--;
11837 tparms = tsubst_template_parms (tparms, partial_args, tf_error);
11839 flag_access_control = save_access_control;
11845 /* Return truthvalue if we're processing a template different from
11846 the last one involved in diagnostics. */
11848 problematic_instantiation_changed (void)
11850 return last_template_error_tick != tinst_level_tick;
11853 /* Remember current template involved in diagnostics. */
11855 record_last_problematic_instantiation (void)
11857 last_template_error_tick = tinst_level_tick;
11861 current_instantiation (void)
11863 return current_tinst_level;
11866 /* [temp.param] Check that template non-type parm TYPE is of an allowable
11867 type. Return zero for ok, nonzero for disallowed. Issue error and
11868 warning messages under control of COMPLAIN. */
11871 invalid_nontype_parm_type_p (tree type, tsubst_flags_t complain)
11873 if (INTEGRAL_TYPE_P (type))
11875 else if (POINTER_TYPE_P (type))
11877 else if (TYPE_PTR_TO_MEMBER_P (type))
11879 else if (TREE_CODE (type) == TEMPLATE_TYPE_PARM)
11881 else if (TREE_CODE (type) == TYPENAME_TYPE)
11884 if (complain & tf_error)
11885 error ("%q#T is not a valid type for a template constant parameter", type);
11889 /* Returns TRUE if TYPE is dependent, in the sense of [temp.dep.type].
11890 Assumes that TYPE really is a type, and not the ERROR_MARK_NODE.*/
11893 dependent_type_p_r (tree type)
11899 A type is dependent if it is:
11901 -- a template parameter. Template template parameters are types
11902 for us (since TYPE_P holds true for them) so we handle
11904 if (TREE_CODE (type) == TEMPLATE_TYPE_PARM
11905 || TREE_CODE (type) == TEMPLATE_TEMPLATE_PARM)
11907 /* -- a qualified-id with a nested-name-specifier which contains a
11908 class-name that names a dependent type or whose unqualified-id
11909 names a dependent type. */
11910 if (TREE_CODE (type) == TYPENAME_TYPE)
11912 /* -- a cv-qualified type where the cv-unqualified type is
11914 type = TYPE_MAIN_VARIANT (type);
11915 /* -- a compound type constructed from any dependent type. */
11916 if (TYPE_PTR_TO_MEMBER_P (type))
11917 return (dependent_type_p (TYPE_PTRMEM_CLASS_TYPE (type))
11918 || dependent_type_p (TYPE_PTRMEM_POINTED_TO_TYPE
11920 else if (TREE_CODE (type) == POINTER_TYPE
11921 || TREE_CODE (type) == REFERENCE_TYPE)
11922 return dependent_type_p (TREE_TYPE (type));
11923 else if (TREE_CODE (type) == FUNCTION_TYPE
11924 || TREE_CODE (type) == METHOD_TYPE)
11928 if (dependent_type_p (TREE_TYPE (type)))
11930 for (arg_type = TYPE_ARG_TYPES (type);
11932 arg_type = TREE_CHAIN (arg_type))
11933 if (dependent_type_p (TREE_VALUE (arg_type)))
11937 /* -- an array type constructed from any dependent type or whose
11938 size is specified by a constant expression that is
11939 value-dependent. */
11940 if (TREE_CODE (type) == ARRAY_TYPE)
11942 if (TYPE_DOMAIN (type)
11943 && ((value_dependent_expression_p
11944 (TYPE_MAX_VALUE (TYPE_DOMAIN (type))))
11945 || (type_dependent_expression_p
11946 (TYPE_MAX_VALUE (TYPE_DOMAIN (type))))))
11948 return dependent_type_p (TREE_TYPE (type));
11951 /* -- a template-id in which either the template name is a template
11953 if (TREE_CODE (type) == BOUND_TEMPLATE_TEMPLATE_PARM)
11955 /* ... or any of the template arguments is a dependent type or
11956 an expression that is type-dependent or value-dependent. */
11957 else if (CLASS_TYPE_P (type) && CLASSTYPE_TEMPLATE_INFO (type)
11958 && (any_dependent_template_arguments_p
11959 (INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type)))))
11962 /* All TYPEOF_TYPEs are dependent; if the argument of the `typeof'
11963 expression is not type-dependent, then it should already been
11965 if (TREE_CODE (type) == TYPEOF_TYPE)
11968 /* The standard does not specifically mention types that are local
11969 to template functions or local classes, but they should be
11970 considered dependent too. For example:
11972 template <int I> void f() {
11977 The size of `E' cannot be known until the value of `I' has been
11978 determined. Therefore, `E' must be considered dependent. */
11979 scope = TYPE_CONTEXT (type);
11980 if (scope && TYPE_P (scope))
11981 return dependent_type_p (scope);
11982 else if (scope && TREE_CODE (scope) == FUNCTION_DECL)
11983 return type_dependent_expression_p (scope);
11985 /* Other types are non-dependent. */
11989 /* Returns TRUE if TYPE is dependent, in the sense of
11990 [temp.dep.type]. */
11993 dependent_type_p (tree type)
11995 /* If there are no template parameters in scope, then there can't be
11996 any dependent types. */
11997 if (!processing_template_decl)
12000 /* If the type is NULL, we have not computed a type for the entity
12001 in question; in that case, the type is dependent. */
12005 /* Erroneous types can be considered non-dependent. */
12006 if (type == error_mark_node)
12009 /* If we have not already computed the appropriate value for TYPE,
12011 if (!TYPE_DEPENDENT_P_VALID (type))
12013 TYPE_DEPENDENT_P (type) = dependent_type_p_r (type);
12014 TYPE_DEPENDENT_P_VALID (type) = 1;
12017 return TYPE_DEPENDENT_P (type);
12020 /* Returns TRUE if EXPRESSION is dependent, according to CRITERION. */
12023 dependent_scope_ref_p (tree expression, bool criterion (tree))
12028 gcc_assert (TREE_CODE (expression) == SCOPE_REF);
12030 if (!TYPE_P (TREE_OPERAND (expression, 0)))
12033 scope = TREE_OPERAND (expression, 0);
12034 name = TREE_OPERAND (expression, 1);
12038 An id-expression is type-dependent if it contains a
12039 nested-name-specifier that contains a class-name that names a
12041 /* The suggested resolution to Core Issue 2 implies that if the
12042 qualifying type is the current class, then we must peek
12045 && currently_open_class (scope)
12046 && !criterion (name))
12048 if (dependent_type_p (scope))
12054 /* Returns TRUE if the EXPRESSION is value-dependent, in the sense of
12055 [temp.dep.constexpr] */
12058 value_dependent_expression_p (tree expression)
12060 if (!processing_template_decl)
12063 /* A name declared with a dependent type. */
12064 if (DECL_P (expression) && type_dependent_expression_p (expression))
12067 switch (TREE_CODE (expression))
12069 case IDENTIFIER_NODE:
12070 /* A name that has not been looked up -- must be dependent. */
12073 case TEMPLATE_PARM_INDEX:
12074 /* A non-type template parm. */
12078 /* A non-type template parm. */
12079 if (DECL_TEMPLATE_PARM_P (expression))
12084 /* A constant with integral or enumeration type and is initialized
12085 with an expression that is value-dependent. */
12086 if (DECL_INITIAL (expression)
12087 && INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (expression))
12088 && value_dependent_expression_p (DECL_INITIAL (expression)))
12092 case DYNAMIC_CAST_EXPR:
12093 case STATIC_CAST_EXPR:
12094 case CONST_CAST_EXPR:
12095 case REINTERPRET_CAST_EXPR:
12097 /* These expressions are value-dependent if the type to which
12098 the cast occurs is dependent or the expression being casted
12099 is value-dependent. */
12101 tree type = TREE_TYPE (expression);
12103 if (dependent_type_p (type))
12106 /* A functional cast has a list of operands. */
12107 expression = TREE_OPERAND (expression, 0);
12110 /* If there are no operands, it must be an expression such
12111 as "int()". This should not happen for aggregate types
12112 because it would form non-constant expressions. */
12113 gcc_assert (INTEGRAL_OR_ENUMERATION_TYPE_P (type));
12118 if (TREE_CODE (expression) == TREE_LIST)
12120 for (; expression; expression = TREE_CHAIN (expression))
12121 if (value_dependent_expression_p (TREE_VALUE (expression)))
12126 return value_dependent_expression_p (expression);
12131 /* A `sizeof' expression is value-dependent if the operand is
12133 expression = TREE_OPERAND (expression, 0);
12134 if (TYPE_P (expression))
12135 return dependent_type_p (expression);
12136 return type_dependent_expression_p (expression);
12139 return dependent_scope_ref_p (expression, value_dependent_expression_p);
12141 case COMPONENT_REF:
12142 return (value_dependent_expression_p (TREE_OPERAND (expression, 0))
12143 || value_dependent_expression_p (TREE_OPERAND (expression, 1)));
12146 /* A CALL_EXPR is value-dependent if any argument is
12147 value-dependent. Why do we have to handle CALL_EXPRs in this
12148 function at all? First, some function calls, those for which
12149 value_dependent_expression_p is true, man appear in constant
12150 expressions. Second, there appear to be bugs which result in
12151 other CALL_EXPRs reaching this point. */
12153 tree function = TREE_OPERAND (expression, 0);
12154 tree args = TREE_OPERAND (expression, 1);
12156 if (value_dependent_expression_p (function))
12162 if (TREE_CODE (args) == TREE_LIST)
12164 for (; args; args = TREE_CHAIN (args))
12165 if (value_dependent_expression_p (TREE_VALUE (args)))
12170 return value_dependent_expression_p (args);
12174 /* A constant expression is value-dependent if any subexpression is
12175 value-dependent. */
12176 switch (TREE_CODE_CLASS (TREE_CODE (expression)))
12178 case tcc_reference:
12180 return (value_dependent_expression_p
12181 (TREE_OPERAND (expression, 0)));
12183 case tcc_comparison:
12185 return ((value_dependent_expression_p
12186 (TREE_OPERAND (expression, 0)))
12187 || (value_dependent_expression_p
12188 (TREE_OPERAND (expression, 1))));
12190 case tcc_expression:
12193 for (i = 0; i < TREE_CODE_LENGTH (TREE_CODE (expression)); ++i)
12194 /* In some cases, some of the operands may be missing.
12195 (For example, in the case of PREDECREMENT_EXPR, the
12196 amount to increment by may be missing.) That doesn't
12197 make the expression dependent. */
12198 if (TREE_OPERAND (expression, i)
12199 && (value_dependent_expression_p
12200 (TREE_OPERAND (expression, i))))
12210 /* The expression is not value-dependent. */
12214 /* Returns TRUE if the EXPRESSION is type-dependent, in the sense of
12215 [temp.dep.expr]. */
12218 type_dependent_expression_p (tree expression)
12220 if (!processing_template_decl)
12223 if (expression == error_mark_node)
12226 /* An unresolved name is always dependent. */
12227 if (TREE_CODE (expression) == IDENTIFIER_NODE)
12230 /* Some expression forms are never type-dependent. */
12231 if (TREE_CODE (expression) == PSEUDO_DTOR_EXPR
12232 || TREE_CODE (expression) == SIZEOF_EXPR
12233 || TREE_CODE (expression) == ALIGNOF_EXPR
12234 || TREE_CODE (expression) == TYPEID_EXPR
12235 || TREE_CODE (expression) == DELETE_EXPR
12236 || TREE_CODE (expression) == VEC_DELETE_EXPR
12237 || TREE_CODE (expression) == THROW_EXPR)
12240 /* The types of these expressions depends only on the type to which
12241 the cast occurs. */
12242 if (TREE_CODE (expression) == DYNAMIC_CAST_EXPR
12243 || TREE_CODE (expression) == STATIC_CAST_EXPR
12244 || TREE_CODE (expression) == CONST_CAST_EXPR
12245 || TREE_CODE (expression) == REINTERPRET_CAST_EXPR
12246 || TREE_CODE (expression) == CAST_EXPR)
12247 return dependent_type_p (TREE_TYPE (expression));
12249 /* The types of these expressions depends only on the type created
12250 by the expression. */
12251 if (TREE_CODE (expression) == NEW_EXPR
12252 || TREE_CODE (expression) == VEC_NEW_EXPR)
12254 /* For NEW_EXPR tree nodes created inside a template, either
12255 the object type itself or a TREE_LIST may appear as the
12257 tree type = TREE_OPERAND (expression, 1);
12258 if (TREE_CODE (type) == TREE_LIST)
12259 /* This is an array type. We need to check array dimensions
12261 return dependent_type_p (TREE_VALUE (TREE_PURPOSE (type)))
12262 || value_dependent_expression_p
12263 (TREE_OPERAND (TREE_VALUE (type), 1));
12265 return dependent_type_p (type);
12268 if (TREE_CODE (expression) == SCOPE_REF
12269 && dependent_scope_ref_p (expression,
12270 type_dependent_expression_p))
12273 if (TREE_CODE (expression) == FUNCTION_DECL
12274 && DECL_LANG_SPECIFIC (expression)
12275 && DECL_TEMPLATE_INFO (expression)
12276 && (any_dependent_template_arguments_p
12277 (INNERMOST_TEMPLATE_ARGS (DECL_TI_ARGS (expression)))))
12280 if (TREE_CODE (expression) == TEMPLATE_DECL
12281 && !DECL_TEMPLATE_TEMPLATE_PARM_P (expression))
12284 if (TREE_TYPE (expression) == unknown_type_node)
12286 if (TREE_CODE (expression) == ADDR_EXPR)
12287 return type_dependent_expression_p (TREE_OPERAND (expression, 0));
12288 if (TREE_CODE (expression) == COMPONENT_REF
12289 || TREE_CODE (expression) == OFFSET_REF)
12291 if (type_dependent_expression_p (TREE_OPERAND (expression, 0)))
12293 expression = TREE_OPERAND (expression, 1);
12294 if (TREE_CODE (expression) == IDENTIFIER_NODE)
12297 /* SCOPE_REF with non-null TREE_TYPE is always non-dependent. */
12298 if (TREE_CODE (expression) == SCOPE_REF)
12301 if (TREE_CODE (expression) == BASELINK)
12302 expression = BASELINK_FUNCTIONS (expression);
12304 if (TREE_CODE (expression) == TEMPLATE_ID_EXPR)
12306 if (any_dependent_template_arguments_p
12307 (TREE_OPERAND (expression, 1)))
12309 expression = TREE_OPERAND (expression, 0);
12311 gcc_assert (TREE_CODE (expression) == OVERLOAD);
12315 if (type_dependent_expression_p (OVL_CURRENT (expression)))
12317 expression = OVL_NEXT (expression);
12322 return (dependent_type_p (TREE_TYPE (expression)));
12325 /* Returns TRUE if ARGS (a TREE_LIST of arguments to a function call)
12326 contains a type-dependent expression. */
12329 any_type_dependent_arguments_p (tree args)
12333 tree arg = TREE_VALUE (args);
12335 if (type_dependent_expression_p (arg))
12337 args = TREE_CHAIN (args);
12342 /* Returns TRUE if the ARG (a template argument) is dependent. */
12345 dependent_template_arg_p (tree arg)
12347 if (!processing_template_decl)
12350 if (TREE_CODE (arg) == TEMPLATE_DECL
12351 || TREE_CODE (arg) == TEMPLATE_TEMPLATE_PARM)
12352 return dependent_template_p (arg);
12353 else if (TYPE_P (arg))
12354 return dependent_type_p (arg);
12356 return (type_dependent_expression_p (arg)
12357 || value_dependent_expression_p (arg));
12360 /* Returns true if ARGS (a collection of template arguments) contains
12361 any dependent arguments. */
12364 any_dependent_template_arguments_p (tree args)
12372 for (i = 0; i < TMPL_ARGS_DEPTH (args); ++i)
12374 tree level = TMPL_ARGS_LEVEL (args, i + 1);
12375 for (j = 0; j < TREE_VEC_LENGTH (level); ++j)
12376 if (dependent_template_arg_p (TREE_VEC_ELT (level, j)))
12383 /* Returns TRUE if the template TMPL is dependent. */
12386 dependent_template_p (tree tmpl)
12388 if (TREE_CODE (tmpl) == OVERLOAD)
12392 if (dependent_template_p (OVL_FUNCTION (tmpl)))
12394 tmpl = OVL_CHAIN (tmpl);
12399 /* Template template parameters are dependent. */
12400 if (DECL_TEMPLATE_TEMPLATE_PARM_P (tmpl)
12401 || TREE_CODE (tmpl) == TEMPLATE_TEMPLATE_PARM)
12403 /* So are names that have not been looked up. */
12404 if (TREE_CODE (tmpl) == SCOPE_REF
12405 || TREE_CODE (tmpl) == IDENTIFIER_NODE)
12407 /* So are member templates of dependent classes. */
12408 if (TYPE_P (CP_DECL_CONTEXT (tmpl)))
12409 return dependent_type_p (DECL_CONTEXT (tmpl));
12413 /* Returns TRUE if the specialization TMPL<ARGS> is dependent. */
12416 dependent_template_id_p (tree tmpl, tree args)
12418 return (dependent_template_p (tmpl)
12419 || any_dependent_template_arguments_p (args));
12422 /* TYPE is a TYPENAME_TYPE. Returns the ordinary TYPE to which the
12423 TYPENAME_TYPE corresponds. Returns ERROR_MARK_NODE if no such TYPE
12424 can be found. Note that this function peers inside uninstantiated
12425 templates and therefore should be used only in extremely limited
12426 situations. ONLY_CURRENT_P restricts this peering to the currently
12427 open classes hierarchy (which is required when comparing types). */
12430 resolve_typename_type (tree type, bool only_current_p)
12438 gcc_assert (TREE_CODE (type) == TYPENAME_TYPE);
12440 scope = TYPE_CONTEXT (type);
12441 name = TYPE_IDENTIFIER (type);
12443 /* If the SCOPE is itself a TYPENAME_TYPE, then we need to resolve
12444 it first before we can figure out what NAME refers to. */
12445 if (TREE_CODE (scope) == TYPENAME_TYPE)
12446 scope = resolve_typename_type (scope, only_current_p);
12447 /* If we don't know what SCOPE refers to, then we cannot resolve the
12449 if (scope == error_mark_node || TREE_CODE (scope) == TYPENAME_TYPE)
12450 return error_mark_node;
12451 /* If the SCOPE is a template type parameter, we have no way of
12452 resolving the name. */
12453 if (TREE_CODE (scope) == TEMPLATE_TYPE_PARM)
12455 /* If the SCOPE is not the current instantiation, there's no reason
12456 to look inside it. */
12457 if (only_current_p && !currently_open_class (scope))
12458 return error_mark_node;
12459 /* If SCOPE is a partial instantiation, it will not have a valid
12460 TYPE_FIELDS list, so use the original template. */
12461 scope = CLASSTYPE_PRIMARY_TEMPLATE_TYPE (scope);
12462 /* Enter the SCOPE so that name lookup will be resolved as if we
12463 were in the class definition. In particular, SCOPE will no
12464 longer be considered a dependent type. */
12465 pushed_scope = push_scope (scope);
12466 /* Look up the declaration. */
12467 decl = lookup_member (scope, name, /*protect=*/0, /*want_type=*/true);
12468 /* Obtain the set of qualifiers applied to the TYPE. */
12469 quals = cp_type_quals (type);
12470 /* For a TYPENAME_TYPE like "typename X::template Y<T>", we want to
12471 find a TEMPLATE_DECL. Otherwise, we want to find a TYPE_DECL. */
12473 type = error_mark_node;
12474 else if (TREE_CODE (TYPENAME_TYPE_FULLNAME (type)) == IDENTIFIER_NODE
12475 && TREE_CODE (decl) == TYPE_DECL)
12476 type = TREE_TYPE (decl);
12477 else if (TREE_CODE (TYPENAME_TYPE_FULLNAME (type)) == TEMPLATE_ID_EXPR
12478 && DECL_CLASS_TEMPLATE_P (decl))
12482 /* Obtain the template and the arguments. */
12483 tmpl = TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type), 0);
12484 args = TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type), 1);
12485 /* Instantiate the template. */
12486 type = lookup_template_class (tmpl, args, NULL_TREE, NULL_TREE,
12487 /*entering_scope=*/0, tf_error | tf_user);
12490 type = error_mark_node;
12491 /* Qualify the resulting type. */
12492 if (type != error_mark_node && quals)
12493 type = cp_build_qualified_type (type, quals);
12494 /* Leave the SCOPE. */
12496 pop_scope (pushed_scope);
12501 /* EXPR is an expression which is not type-dependent. Return a proxy
12502 for EXPR that can be used to compute the types of larger
12503 expressions containing EXPR. */
12506 build_non_dependent_expr (tree expr)
12510 /* Preserve null pointer constants so that the type of things like
12511 "p == 0" where "p" is a pointer can be determined. */
12512 if (null_ptr_cst_p (expr))
12514 /* Preserve OVERLOADs; the functions must be available to resolve
12516 inner_expr = (TREE_CODE (expr) == ADDR_EXPR ?
12517 TREE_OPERAND (expr, 0) : expr);
12518 if (is_overloaded_fn (inner_expr)
12519 || TREE_CODE (inner_expr) == OFFSET_REF)
12521 /* There is no need to return a proxy for a variable. */
12522 if (TREE_CODE (expr) == VAR_DECL)
12524 /* Preserve string constants; conversions from string constants to
12525 "char *" are allowed, even though normally a "const char *"
12526 cannot be used to initialize a "char *". */
12527 if (TREE_CODE (expr) == STRING_CST)
12529 /* Preserve arithmetic constants, as an optimization -- there is no
12530 reason to create a new node. */
12531 if (TREE_CODE (expr) == INTEGER_CST || TREE_CODE (expr) == REAL_CST)
12533 /* Preserve THROW_EXPRs -- all throw-expressions have type "void".
12534 There is at least one place where we want to know that a
12535 particular expression is a throw-expression: when checking a ?:
12536 expression, there are special rules if the second or third
12537 argument is a throw-expression. */
12538 if (TREE_CODE (expr) == THROW_EXPR)
12541 if (TREE_CODE (expr) == COND_EXPR)
12542 return build3 (COND_EXPR,
12544 TREE_OPERAND (expr, 0),
12545 (TREE_OPERAND (expr, 1)
12546 ? build_non_dependent_expr (TREE_OPERAND (expr, 1))
12547 : build_non_dependent_expr (TREE_OPERAND (expr, 0))),
12548 build_non_dependent_expr (TREE_OPERAND (expr, 2)));
12549 if (TREE_CODE (expr) == COMPOUND_EXPR
12550 && !COMPOUND_EXPR_OVERLOADED (expr))
12551 return build2 (COMPOUND_EXPR,
12553 TREE_OPERAND (expr, 0),
12554 build_non_dependent_expr (TREE_OPERAND (expr, 1)));
12556 /* Otherwise, build a NON_DEPENDENT_EXPR.
12558 REFERENCE_TYPEs are not stripped for expressions in templates
12559 because doing so would play havoc with mangling. Consider, for
12562 template <typename T> void f<T& g>() { g(); }
12564 In the body of "f", the expression for "g" will have
12565 REFERENCE_TYPE, even though the standard says that it should
12566 not. The reason is that we must preserve the syntactic form of
12567 the expression so that mangling (say) "f<g>" inside the body of
12568 "f" works out correctly. Therefore, the REFERENCE_TYPE is
12570 return build1 (NON_DEPENDENT_EXPR, non_reference (TREE_TYPE (expr)), expr);
12573 /* ARGS is a TREE_LIST of expressions as arguments to a function call.
12574 Return a new TREE_LIST with the various arguments replaced with
12575 equivalent non-dependent expressions. */
12578 build_non_dependent_args (tree args)
12583 new_args = NULL_TREE;
12584 for (a = args; a; a = TREE_CHAIN (a))
12585 new_args = tree_cons (NULL_TREE,
12586 build_non_dependent_expr (TREE_VALUE (a)),
12588 return nreverse (new_args);
12591 #include "gt-cp-pt.h"