1 /* Handle parameterized types (templates) for GNU C++.
2 Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
3 2001, 2002, 2003, 2004, 2005 Free Software Foundation, Inc.
4 Written by Ken Raeburn (raeburn@cygnus.com) while at Watchmaker Computing.
5 Rewritten by Jason Merrill (jason@cygnus.com).
7 This file is part of GCC.
9 GCC is free software; you can redistribute it and/or modify
10 it under the terms of the GNU General Public License as published by
11 the Free Software Foundation; either version 2, or (at your option)
14 GCC is distributed in the hope that it will be useful,
15 but WITHOUT ANY WARRANTY; without even the implied warranty of
16 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 GNU General Public License for more details.
19 You should have received a copy of the GNU General Public License
20 along with GCC; see the file COPYING. If not, write to
21 the Free Software Foundation, 51 Franklin Street, Fifth Floor,
22 Boston, MA 02110-1301, USA. */
24 /* Known bugs or deficiencies include:
26 all methods must be provided in header files; can't use a source
27 file that contains only the method templates and "just win". */
31 #include "coretypes.h"
35 #include "pointer-set.h"
39 #include "cp-objcp-common.h"
40 #include "tree-inline.h"
47 #include "tree-iterator.h"
49 /* The type of functions taking a tree, and some additional data, and
51 typedef int (*tree_fn_t) (tree, void*);
53 /* The PENDING_TEMPLATES is a TREE_LIST of templates whose
54 instantiations have been deferred, either because their definitions
55 were not yet available, or because we were putting off doing the work.
56 The TREE_PURPOSE of each entry is either a DECL (for a function or
57 static data member), or a TYPE (for a class) indicating what we are
58 hoping to instantiate. The TREE_VALUE is not used. */
59 static GTY(()) tree pending_templates;
60 static GTY(()) tree last_pending_template;
62 int processing_template_parmlist;
63 static int template_header_count;
65 static GTY(()) tree saved_trees;
66 static GTY(()) varray_type inline_parm_levels;
67 static size_t inline_parm_levels_used;
69 static GTY(()) tree current_tinst_level;
71 static GTY(()) tree saved_access_scope;
73 /* Live only within one (recursive) call to tsubst_expr. We use
74 this to pass the statement expression node from the STMT_EXPR
75 to the EXPR_STMT that is its result. */
76 static tree cur_stmt_expr;
78 /* A map from local variable declarations in the body of the template
79 presently being instantiated to the corresponding instantiated
81 static htab_t local_specializations;
83 #define UNIFY_ALLOW_NONE 0
84 #define UNIFY_ALLOW_MORE_CV_QUAL 1
85 #define UNIFY_ALLOW_LESS_CV_QUAL 2
86 #define UNIFY_ALLOW_DERIVED 4
87 #define UNIFY_ALLOW_INTEGER 8
88 #define UNIFY_ALLOW_OUTER_LEVEL 16
89 #define UNIFY_ALLOW_OUTER_MORE_CV_QUAL 32
90 #define UNIFY_ALLOW_OUTER_LESS_CV_QUAL 64
92 static void push_access_scope (tree);
93 static void pop_access_scope (tree);
94 static int resolve_overloaded_unification (tree, tree, tree, tree,
95 unification_kind_t, int);
96 static int try_one_overload (tree, tree, tree, tree, tree,
97 unification_kind_t, int, bool);
98 static int unify (tree, tree, tree, tree, int);
99 static void add_pending_template (tree);
100 static void reopen_tinst_level (tree);
101 static tree classtype_mangled_name (tree);
102 static char* mangle_class_name_for_template (const char *, tree, tree);
103 static tree tsubst_initializer_list (tree, tree);
104 static tree get_class_bindings (tree, tree, tree);
105 static tree coerce_template_parms (tree, tree, tree, tsubst_flags_t, int);
106 static void tsubst_enum (tree, tree, tree);
107 static tree add_to_template_args (tree, tree);
108 static tree add_outermost_template_args (tree, tree);
109 static bool check_instantiated_args (tree, tree, tsubst_flags_t);
110 static int maybe_adjust_types_for_deduction (unification_kind_t, tree*, tree*);
111 static int type_unification_real (tree, tree, tree, tree,
112 int, unification_kind_t, int);
113 static void note_template_header (int);
114 static tree convert_nontype_argument_function (tree, tree);
115 static tree convert_nontype_argument (tree, tree);
116 static tree convert_template_argument (tree, tree, tree,
117 tsubst_flags_t, int, tree);
118 static int for_each_template_parm (tree, tree_fn_t, void*,
119 struct pointer_set_t*);
120 static tree build_template_parm_index (int, int, int, tree, tree);
121 static int inline_needs_template_parms (tree);
122 static void push_inline_template_parms_recursive (tree, int);
123 static tree retrieve_local_specialization (tree);
124 static void register_local_specialization (tree, tree);
125 static tree reduce_template_parm_level (tree, tree, int);
126 static int mark_template_parm (tree, void *);
127 static int template_parm_this_level_p (tree, void *);
128 static tree tsubst_friend_function (tree, tree);
129 static tree tsubst_friend_class (tree, tree);
130 static int can_complete_type_without_circularity (tree);
131 static tree get_bindings (tree, tree, tree, bool);
132 static int template_decl_level (tree);
133 static int check_cv_quals_for_unify (int, tree, tree);
134 static tree tsubst_template_arg (tree, tree, tsubst_flags_t, tree);
135 static tree tsubst_template_args (tree, tree, tsubst_flags_t, tree);
136 static tree tsubst_template_parms (tree, tree, tsubst_flags_t);
137 static void regenerate_decl_from_template (tree, tree);
138 static tree most_specialized (tree, tree, tree);
139 static tree most_specialized_class (tree, tree);
140 static 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 /* An 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 pedwarn (" from definition of %q+#D", tmpl);
675 /* SPEC is an explicit instantiation. Check that it is valid to
676 perform this explicit instantiation in the current namespace. */
679 check_explicit_instantiation_namespace (tree spec)
683 /* DR 275: An explicit instantiation shall appear in an enclosing
684 namespace of its template. */
685 ns = decl_namespace_context (spec);
686 if (!is_ancestor (current_namespace, ns))
687 pedwarn ("explicit instantiation of %qD in namespace %qD "
688 "(which does not enclose namespace %qD)",
689 spec, current_namespace, ns);
692 /* The TYPE is being declared. If it is a template type, that means it
693 is a partial specialization. Do appropriate error-checking. */
696 maybe_process_partial_specialization (tree type)
698 /* TYPE maybe an ERROR_MARK_NODE. */
699 tree context = TYPE_P (type) ? TYPE_CONTEXT (type) : NULL_TREE;
701 if (CLASS_TYPE_P (type) && CLASSTYPE_USE_TEMPLATE (type))
703 /* This is for ordinary explicit specialization and partial
704 specialization of a template class such as:
706 template <> class C<int>;
710 template <class T> class C<T*>;
712 Make sure that `C<int>' and `C<T*>' are implicit instantiations. */
714 if (CLASSTYPE_IMPLICIT_INSTANTIATION (type)
715 && !COMPLETE_TYPE_P (type))
717 check_specialization_namespace (CLASSTYPE_TI_TEMPLATE (type));
718 SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (type);
719 if (processing_template_decl)
720 push_template_decl (TYPE_MAIN_DECL (type));
722 else if (CLASSTYPE_TEMPLATE_INSTANTIATION (type))
723 error ("specialization of %qT after instantiation", type);
725 else if (CLASS_TYPE_P (type)
726 && !CLASSTYPE_USE_TEMPLATE (type)
727 && CLASSTYPE_TEMPLATE_INFO (type)
728 && context && CLASS_TYPE_P (context)
729 && CLASSTYPE_TEMPLATE_INFO (context))
731 /* This is for an explicit specialization of member class
732 template according to [temp.expl.spec/18]:
734 template <> template <class U> class C<int>::D;
736 The context `C<int>' must be an implicit instantiation.
737 Otherwise this is just a member class template declared
740 template <> class C<int> { template <class U> class D; };
741 template <> template <class U> class C<int>::D;
743 In the first case, `C<int>::D' is a specialization of `C<T>::D'
744 while in the second case, `C<int>::D' is a primary template
745 and `C<T>::D' may not exist. */
747 if (CLASSTYPE_IMPLICIT_INSTANTIATION (context)
748 && !COMPLETE_TYPE_P (type))
752 if (current_namespace
753 != decl_namespace_context (CLASSTYPE_TI_TEMPLATE (type)))
755 pedwarn ("specializing %q#T in different namespace", type);
756 pedwarn (" from definition of %q+#D",
757 CLASSTYPE_TI_TEMPLATE (type));
760 /* Check for invalid specialization after instantiation:
762 template <> template <> class C<int>::D<int>;
763 template <> template <class U> class C<int>::D; */
765 for (t = DECL_TEMPLATE_INSTANTIATIONS
766 (most_general_template (CLASSTYPE_TI_TEMPLATE (type)));
767 t; t = TREE_CHAIN (t))
768 if (TREE_VALUE (t) != type
769 && TYPE_CONTEXT (TREE_VALUE (t)) == context)
770 error ("specialization %qT after instantiation %qT",
771 type, TREE_VALUE (t));
773 /* Mark TYPE as a specialization. And as a result, we only
774 have one level of template argument for the innermost
776 SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (type);
777 CLASSTYPE_TI_ARGS (type)
778 = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type));
781 else if (processing_specialization)
782 error ("explicit specialization of non-template %qT", type);
785 /* Returns nonzero if we can optimize the retrieval of specializations
786 for TMPL, a TEMPLATE_DECL. In particular, for such a template, we
787 do not use DECL_TEMPLATE_SPECIALIZATIONS at all. */
790 optimize_specialization_lookup_p (tree tmpl)
792 return (DECL_FUNCTION_TEMPLATE_P (tmpl)
793 && DECL_CLASS_SCOPE_P (tmpl)
794 /* DECL_CLASS_SCOPE_P holds of T::f even if T is a template
796 && CLASS_TYPE_P (DECL_CONTEXT (tmpl))
797 /* The optimized lookup depends on the fact that the
798 template arguments for the member function template apply
799 purely to the containing class, which is not true if the
800 containing class is an explicit or partial
802 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (tmpl))
803 && !DECL_MEMBER_TEMPLATE_P (tmpl)
804 && !DECL_CONV_FN_P (tmpl)
805 /* It is possible to have a template that is not a member
806 template and is not a member of a template class:
808 template <typename T>
809 struct S { friend A::f(); };
811 Here, the friend function is a template, but the context does
812 not have template information. The optimized lookup relies
813 on having ARGS be the template arguments for both the class
814 and the function template. */
815 && !DECL_FRIEND_P (DECL_TEMPLATE_RESULT (tmpl)));
818 /* Retrieve the specialization (in the sense of [temp.spec] - a
819 specialization is either an instantiation or an explicit
820 specialization) of TMPL for the given template ARGS. If there is
821 no such specialization, return NULL_TREE. The ARGS are a vector of
822 arguments, or a vector of vectors of arguments, in the case of
823 templates with more than one level of parameters.
825 If TMPL is a type template and CLASS_SPECIALIZATIONS_P is true,
826 then we search for a partial specialization matching ARGS. This
827 parameter is ignored if TMPL is not a class template. */
830 retrieve_specialization (tree tmpl, tree args,
831 bool class_specializations_p)
833 gcc_assert (TREE_CODE (tmpl) == TEMPLATE_DECL);
835 /* There should be as many levels of arguments as there are
836 levels of parameters. */
837 gcc_assert (TMPL_ARGS_DEPTH (args)
838 == TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl)));
840 if (optimize_specialization_lookup_p (tmpl))
843 tree class_specialization;
844 VEC(tree,gc) *methods;
848 /* The template arguments actually apply to the containing
849 class. Find the class specialization with those
851 class_template = CLASSTYPE_TI_TEMPLATE (DECL_CONTEXT (tmpl));
853 = retrieve_specialization (class_template, args,
854 /*class_specializations_p=*/false);
855 if (!class_specialization)
857 /* Now, find the appropriate entry in the CLASSTYPE_METHOD_VEC
858 for the specialization. */
859 idx = class_method_index_for_fn (class_specialization, tmpl);
862 /* Iterate through the methods with the indicated name, looking
863 for the one that has an instance of TMPL. */
864 methods = CLASSTYPE_METHOD_VEC (class_specialization);
865 for (fns = VEC_index (tree, methods, idx); fns; fns = OVL_NEXT (fns))
867 tree fn = OVL_CURRENT (fns);
868 if (DECL_TEMPLATE_INFO (fn) && DECL_TI_TEMPLATE (fn) == tmpl)
878 /* Class templates store their instantiations on the
879 DECL_TEMPLATE_INSTANTIATIONS list; other templates use the
880 DECL_TEMPLATE_SPECIALIZATIONS list. */
881 if (!class_specializations_p
882 && TREE_CODE (DECL_TEMPLATE_RESULT (tmpl)) == TYPE_DECL)
883 sp = &DECL_TEMPLATE_INSTANTIATIONS (tmpl);
885 sp = &DECL_TEMPLATE_SPECIALIZATIONS (tmpl);
887 /* Iterate through the list until we find a matching template. */
888 while (*sp != NULL_TREE)
892 if (comp_template_args (TREE_PURPOSE (spec), args))
894 /* Use the move-to-front heuristic to speed up future
898 *sp = TREE_CHAIN (*sp);
899 TREE_CHAIN (spec) = *head;
902 return TREE_VALUE (spec);
904 sp = &TREE_CHAIN (spec);
911 /* Like retrieve_specialization, but for local declarations. */
914 retrieve_local_specialization (tree tmpl)
916 tree spec = htab_find_with_hash (local_specializations, tmpl,
917 htab_hash_pointer (tmpl));
918 return spec ? TREE_PURPOSE (spec) : NULL_TREE;
921 /* Returns nonzero iff DECL is a specialization of TMPL. */
924 is_specialization_of (tree decl, tree tmpl)
928 if (TREE_CODE (decl) == FUNCTION_DECL)
932 t = DECL_TEMPLATE_INFO (t) ? DECL_TI_TEMPLATE (t) : NULL_TREE)
938 gcc_assert (TREE_CODE (decl) == TYPE_DECL);
940 for (t = TREE_TYPE (decl);
942 t = CLASSTYPE_USE_TEMPLATE (t)
943 ? TREE_TYPE (CLASSTYPE_TI_TEMPLATE (t)) : NULL_TREE)
944 if (same_type_ignoring_top_level_qualifiers_p (t, TREE_TYPE (tmpl)))
951 /* Returns nonzero iff DECL is a specialization of friend declaration
952 FRIEND according to [temp.friend]. */
955 is_specialization_of_friend (tree decl, tree friend)
957 bool need_template = true;
960 gcc_assert (TREE_CODE (decl) == FUNCTION_DECL
961 || TREE_CODE (decl) == TYPE_DECL);
963 /* For [temp.friend/6] when FRIEND is an ordinary member function
964 of a template class, we want to check if DECL is a specialization
966 if (TREE_CODE (friend) == FUNCTION_DECL
967 && DECL_TEMPLATE_INFO (friend)
968 && !DECL_USE_TEMPLATE (friend))
970 /* We want a TEMPLATE_DECL for `is_specialization_of'. */
971 friend = DECL_TI_TEMPLATE (friend);
972 need_template = false;
974 else if (TREE_CODE (friend) == TEMPLATE_DECL
975 && !PRIMARY_TEMPLATE_P (friend))
976 need_template = false;
978 /* There is nothing to do if this is not a template friend. */
979 if (TREE_CODE (friend) != TEMPLATE_DECL)
982 if (is_specialization_of (decl, friend))
986 A member of a class template may be declared to be a friend of a
987 non-template class. In this case, the corresponding member of
988 every specialization of the class template is a friend of the
989 class granting friendship.
991 For example, given a template friend declaration
993 template <class T> friend void A<T>::f();
995 the member function below is considered a friend
997 template <> struct A<int> {
1001 For this type of template friend, TEMPLATE_DEPTH below will be
1002 nonzero. To determine if DECL is a friend of FRIEND, we first
1003 check if the enclosing class is a specialization of another. */
1005 template_depth = template_class_depth (DECL_CONTEXT (friend));
1007 && DECL_CLASS_SCOPE_P (decl)
1008 && is_specialization_of (TYPE_NAME (DECL_CONTEXT (decl)),
1009 CLASSTYPE_TI_TEMPLATE (DECL_CONTEXT (friend))))
1011 /* Next, we check the members themselves. In order to handle
1012 a few tricky cases, such as when FRIEND's are
1014 template <class T> friend void A<T>::g(T t);
1015 template <class T> template <T t> friend void A<T>::h();
1019 void A<int>::g(int);
1020 template <int> void A<int>::h();
1022 we need to figure out ARGS, the template arguments from
1023 the context of DECL. This is required for template substitution
1024 of `T' in the function parameter of `g' and template parameter
1025 of `h' in the above examples. Here ARGS corresponds to `int'. */
1027 tree context = DECL_CONTEXT (decl);
1028 tree args = NULL_TREE;
1029 int current_depth = 0;
1031 while (current_depth < template_depth)
1033 if (CLASSTYPE_TEMPLATE_INFO (context))
1035 if (current_depth == 0)
1036 args = TYPE_TI_ARGS (context);
1038 args = add_to_template_args (TYPE_TI_ARGS (context), args);
1041 context = TYPE_CONTEXT (context);
1044 if (TREE_CODE (decl) == FUNCTION_DECL)
1049 tree friend_args_type;
1050 tree decl_args_type;
1052 /* Make sure that both DECL and FRIEND are templates or
1054 is_template = DECL_TEMPLATE_INFO (decl)
1055 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl));
1056 if (need_template ^ is_template)
1058 else if (is_template)
1060 /* If both are templates, check template parameter list. */
1062 = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend),
1064 if (!comp_template_parms
1065 (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (decl)),
1069 decl_type = TREE_TYPE (DECL_TI_TEMPLATE (decl));
1072 decl_type = TREE_TYPE (decl);
1074 friend_type = tsubst_function_type (TREE_TYPE (friend), args,
1075 tf_none, NULL_TREE);
1076 if (friend_type == error_mark_node)
1079 /* Check if return types match. */
1080 if (!same_type_p (TREE_TYPE (decl_type), TREE_TYPE (friend_type)))
1083 /* Check if function parameter types match, ignoring the
1084 `this' parameter. */
1085 friend_args_type = TYPE_ARG_TYPES (friend_type);
1086 decl_args_type = TYPE_ARG_TYPES (decl_type);
1087 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (friend))
1088 friend_args_type = TREE_CHAIN (friend_args_type);
1089 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl))
1090 decl_args_type = TREE_CHAIN (decl_args_type);
1092 return compparms (decl_args_type, friend_args_type);
1096 /* DECL is a TYPE_DECL */
1098 tree decl_type = TREE_TYPE (decl);
1100 /* Make sure that both DECL and FRIEND are templates or
1103 = CLASSTYPE_TEMPLATE_INFO (decl_type)
1104 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (decl_type));
1106 if (need_template ^ is_template)
1108 else if (is_template)
1111 /* If both are templates, check the name of the two
1112 TEMPLATE_DECL's first because is_friend didn't. */
1113 if (DECL_NAME (CLASSTYPE_TI_TEMPLATE (decl_type))
1114 != DECL_NAME (friend))
1117 /* Now check template parameter list. */
1119 = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend),
1121 return comp_template_parms
1122 (DECL_TEMPLATE_PARMS (CLASSTYPE_TI_TEMPLATE (decl_type)),
1126 return (DECL_NAME (decl)
1127 == DECL_NAME (friend));
1133 /* Register the specialization SPEC as a specialization of TMPL with
1134 the indicated ARGS. IS_FRIEND indicates whether the specialization
1135 is actually just a friend declaration. Returns SPEC, or an
1136 equivalent prior declaration, if available. */
1139 register_specialization (tree spec, tree tmpl, tree args, bool is_friend)
1143 gcc_assert (TREE_CODE (tmpl) == TEMPLATE_DECL);
1145 if (TREE_CODE (spec) == FUNCTION_DECL
1146 && uses_template_parms (DECL_TI_ARGS (spec)))
1147 /* This is the FUNCTION_DECL for a partial instantiation. Don't
1148 register it; we want the corresponding TEMPLATE_DECL instead.
1149 We use `uses_template_parms (DECL_TI_ARGS (spec))' rather than
1150 the more obvious `uses_template_parms (spec)' to avoid problems
1151 with default function arguments. In particular, given
1152 something like this:
1154 template <class T> void f(T t1, T t = T())
1156 the default argument expression is not substituted for in an
1157 instantiation unless and until it is actually needed. */
1160 fn = retrieve_specialization (tmpl, args,
1161 /*class_specializations_p=*/false);
1162 /* We can sometimes try to re-register a specialization that we've
1163 already got. In particular, regenerate_decl_from_template calls
1164 duplicate_decls which will update the specialization list. But,
1165 we'll still get called again here anyhow. It's more convenient
1166 to simply allow this than to try to prevent it. */
1169 else if (fn && DECL_TEMPLATE_SPECIALIZATION (spec))
1171 if (DECL_TEMPLATE_INSTANTIATION (fn))
1174 || DECL_EXPLICIT_INSTANTIATION (fn))
1176 error ("specialization of %qD after instantiation",
1183 /* This situation should occur only if the first
1184 specialization is an implicit instantiation, the
1185 second is an explicit specialization, and the
1186 implicit instantiation has not yet been used. That
1187 situation can occur if we have implicitly
1188 instantiated a member function and then specialized
1191 We can also wind up here if a friend declaration that
1192 looked like an instantiation turns out to be a
1195 template <class T> void foo(T);
1196 class S { friend void foo<>(int) };
1197 template <> void foo(int);
1199 We transform the existing DECL in place so that any
1200 pointers to it become pointers to the updated
1203 If there was a definition for the template, but not
1204 for the specialization, we want this to look as if
1205 there were no definition, and vice versa. */
1206 DECL_INITIAL (fn) = NULL_TREE;
1207 duplicate_decls (spec, fn, is_friend);
1208 /* The call to duplicate_decls will have applied
1211 An explicit specialization of a function template
1212 is inline only if it is explicitly declared to be,
1213 and independently of whether its function tempalte
1216 to the primary function; now copy the inline bits to
1217 the various clones. */
1218 FOR_EACH_CLONE (clone, fn)
1220 DECL_DECLARED_INLINE_P (clone)
1221 = DECL_DECLARED_INLINE_P (fn);
1225 check_specialization_namespace (fn);
1230 else if (DECL_TEMPLATE_SPECIALIZATION (fn))
1232 if (!duplicate_decls (spec, fn, is_friend) && DECL_INITIAL (spec))
1233 /* Dup decl failed, but this is a new definition. Set the
1234 line number so any errors match this new
1236 DECL_SOURCE_LOCATION (fn) = DECL_SOURCE_LOCATION (spec);
1242 /* A specialization must be declared in the same namespace as the
1243 template it is specializing. */
1244 if (DECL_TEMPLATE_SPECIALIZATION (spec)
1245 && !check_specialization_namespace (tmpl))
1246 DECL_CONTEXT (spec) = decl_namespace_context (tmpl);
1248 if (!optimize_specialization_lookup_p (tmpl))
1249 DECL_TEMPLATE_SPECIALIZATIONS (tmpl)
1250 = tree_cons (args, spec, DECL_TEMPLATE_SPECIALIZATIONS (tmpl));
1255 /* Unregister the specialization SPEC as a specialization of TMPL.
1256 Replace it with NEW_SPEC, if NEW_SPEC is non-NULL. Returns true
1257 if the SPEC was listed as a specialization of TMPL. */
1260 reregister_specialization (tree spec, tree tmpl, tree new_spec)
1264 for (s = &DECL_TEMPLATE_SPECIALIZATIONS (tmpl);
1266 s = &TREE_CHAIN (*s))
1267 if (TREE_VALUE (*s) == spec)
1270 *s = TREE_CHAIN (*s);
1272 TREE_VALUE (*s) = new_spec;
1279 /* Compare an entry in the local specializations hash table P1 (which
1280 is really a pointer to a TREE_LIST) with P2 (which is really a
1284 eq_local_specializations (const void *p1, const void *p2)
1286 return TREE_VALUE ((tree) p1) == (tree) p2;
1289 /* Hash P1, an entry in the local specializations table. */
1292 hash_local_specialization (const void* p1)
1294 return htab_hash_pointer (TREE_VALUE ((tree) p1));
1297 /* Like register_specialization, but for local declarations. We are
1298 registering SPEC, an instantiation of TMPL. */
1301 register_local_specialization (tree spec, tree tmpl)
1305 slot = htab_find_slot_with_hash (local_specializations, tmpl,
1306 htab_hash_pointer (tmpl), INSERT);
1307 *slot = build_tree_list (spec, tmpl);
1310 /* Print the list of candidate FNS in an error message. */
1313 print_candidates (tree fns)
1317 const char *str = "candidates are:";
1319 for (fn = fns; fn != NULL_TREE; fn = TREE_CHAIN (fn))
1323 for (f = TREE_VALUE (fn); f; f = OVL_NEXT (f))
1324 error ("%s %+#D", str, OVL_CURRENT (f));
1329 /* Returns the template (one of the functions given by TEMPLATE_ID)
1330 which can be specialized to match the indicated DECL with the
1331 explicit template args given in TEMPLATE_ID. The DECL may be
1332 NULL_TREE if none is available. In that case, the functions in
1333 TEMPLATE_ID are non-members.
1335 If NEED_MEMBER_TEMPLATE is nonzero the function is known to be a
1336 specialization of a member template.
1338 The TEMPLATE_COUNT is the number of references to qualifying
1339 template classes that appeared in the name of the function. See
1340 check_explicit_specialization for a more accurate description.
1342 The template args (those explicitly specified and those deduced)
1343 are output in a newly created vector *TARGS_OUT.
1345 If it is impossible to determine the result, an error message is
1346 issued. The error_mark_node is returned to indicate failure. */
1349 determine_specialization (tree template_id,
1352 int need_member_template,
1357 tree explicit_targs;
1358 tree candidates = NULL_TREE;
1359 tree templates = NULL_TREE;
1361 struct cp_binding_level *b;
1363 *targs_out = NULL_TREE;
1365 if (template_id == error_mark_node)
1366 return error_mark_node;
1368 fns = TREE_OPERAND (template_id, 0);
1369 explicit_targs = TREE_OPERAND (template_id, 1);
1371 if (fns == error_mark_node)
1372 return error_mark_node;
1374 /* Check for baselinks. */
1375 if (BASELINK_P (fns))
1376 fns = BASELINK_FUNCTIONS (fns);
1378 if (!is_overloaded_fn (fns))
1380 error ("%qD is not a function template", fns);
1381 return error_mark_node;
1384 /* Count the number of template headers specified for this
1387 for (b = current_binding_level;
1388 b->kind == sk_template_parms;
1392 for (; fns; fns = OVL_NEXT (fns))
1394 tree fn = OVL_CURRENT (fns);
1396 if (TREE_CODE (fn) == TEMPLATE_DECL)
1398 tree decl_arg_types;
1401 /* DECL might be a specialization of FN. */
1403 /* Adjust the type of DECL in case FN is a static member. */
1404 decl_arg_types = TYPE_ARG_TYPES (TREE_TYPE (decl));
1405 if (DECL_STATIC_FUNCTION_P (fn)
1406 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl))
1407 decl_arg_types = TREE_CHAIN (decl_arg_types);
1409 /* Check that the number of function parameters matches.
1411 template <class T> void f(int i = 0);
1412 template <> void f<int>();
1413 The specialization f<int> is invalid but is not caught
1414 by get_bindings below. */
1416 fn_arg_types = TYPE_ARG_TYPES (TREE_TYPE (fn));
1417 if (list_length (fn_arg_types) != list_length (decl_arg_types))
1420 /* For a non-static member function, we need to make sure that
1421 the const qualification is the same. This can be done by
1422 checking the 'this' in the argument list. */
1423 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn)
1424 && !same_type_p (TREE_VALUE (fn_arg_types),
1425 TREE_VALUE (decl_arg_types)))
1428 /* In case of explicit specialization, we need to check if
1429 the number of template headers appearing in the specialization
1430 is correct. This is usually done in check_explicit_specialization,
1431 but the check done there cannot be exhaustive when specializing
1432 member functions. Consider the following code:
1434 template <> void A<int>::f(int);
1435 template <> template <> void A<int>::f(int);
1437 Assuming that A<int> is not itself an explicit specialization
1438 already, the first line specializes "f" which is a non-template
1439 member function, whilst the second line specializes "f" which
1440 is a template member function. So both lines are syntactically
1441 correct, and check_explicit_specialization does not reject
1444 Here, we can do better, as we are matching the specialization
1445 against the declarations. We count the number of template
1446 headers, and we check if they match TEMPLATE_COUNT + 1
1447 (TEMPLATE_COUNT is the number of qualifying template classes,
1448 plus there must be another header for the member template
1451 Notice that if header_count is zero, this is not a
1452 specialization but rather a template instantiation, so there
1453 is no check we can perform here. */
1454 if (header_count && header_count != template_count + 1)
1457 /* Check that the number of template arguments at the
1458 innermost level for DECL is the same as for FN. */
1459 if (current_binding_level->kind == sk_template_parms
1460 && !current_binding_level->explicit_spec_p
1461 && (TREE_VEC_LENGTH (DECL_INNERMOST_TEMPLATE_PARMS (fn))
1462 != TREE_VEC_LENGTH (TREE_VALUE (current_template_parms))))
1465 /* See whether this function might be a specialization of this
1467 targs = get_bindings (fn, decl, explicit_targs, /*check_ret=*/true);
1470 /* We cannot deduce template arguments that when used to
1471 specialize TMPL will produce DECL. */
1474 /* Save this template, and the arguments deduced. */
1475 templates = tree_cons (targs, fn, templates);
1477 else if (need_member_template)
1478 /* FN is an ordinary member function, and we need a
1479 specialization of a member template. */
1481 else if (TREE_CODE (fn) != FUNCTION_DECL)
1482 /* We can get IDENTIFIER_NODEs here in certain erroneous
1485 else if (!DECL_FUNCTION_MEMBER_P (fn))
1486 /* This is just an ordinary non-member function. Nothing can
1487 be a specialization of that. */
1489 else if (DECL_ARTIFICIAL (fn))
1490 /* Cannot specialize functions that are created implicitly. */
1494 tree decl_arg_types;
1496 /* This is an ordinary member function. However, since
1497 we're here, we can assume it's enclosing class is a
1498 template class. For example,
1500 template <typename T> struct S { void f(); };
1501 template <> void S<int>::f() {}
1503 Here, S<int>::f is a non-template, but S<int> is a
1504 template class. If FN has the same type as DECL, we
1505 might be in business. */
1507 if (!DECL_TEMPLATE_INFO (fn))
1508 /* Its enclosing class is an explicit specialization
1509 of a template class. This is not a candidate. */
1512 if (!same_type_p (TREE_TYPE (TREE_TYPE (decl)),
1513 TREE_TYPE (TREE_TYPE (fn))))
1514 /* The return types differ. */
1517 /* Adjust the type of DECL in case FN is a static member. */
1518 decl_arg_types = TYPE_ARG_TYPES (TREE_TYPE (decl));
1519 if (DECL_STATIC_FUNCTION_P (fn)
1520 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl))
1521 decl_arg_types = TREE_CHAIN (decl_arg_types);
1523 if (compparms (TYPE_ARG_TYPES (TREE_TYPE (fn)),
1526 candidates = tree_cons (NULL_TREE, fn, candidates);
1530 if (templates && TREE_CHAIN (templates))
1536 It is possible for a specialization with a given function
1537 signature to be instantiated from more than one function
1538 template. In such cases, explicit specification of the
1539 template arguments must be used to uniquely identify the
1540 function template specialization being specialized.
1542 Note that here, there's no suggestion that we're supposed to
1543 determine which of the candidate templates is most
1544 specialized. However, we, also have:
1548 Partial ordering of overloaded function template
1549 declarations is used in the following contexts to select
1550 the function template to which a function template
1551 specialization refers:
1553 -- when an explicit specialization refers to a function
1556 So, we do use the partial ordering rules, at least for now.
1557 This extension can only serve to make invalid programs valid,
1558 so it's safe. And, there is strong anecdotal evidence that
1559 the committee intended the partial ordering rules to apply;
1560 the EDG front-end has that behavior, and John Spicer claims
1561 that the committee simply forgot to delete the wording in
1562 [temp.expl.spec]. */
1563 tree tmpl = most_specialized (templates, decl, explicit_targs);
1564 if (tmpl && tmpl != error_mark_node)
1566 targs = get_bindings (tmpl, decl, explicit_targs, /*check_ret=*/true);
1567 templates = tree_cons (targs, tmpl, NULL_TREE);
1571 if (templates == NULL_TREE && candidates == NULL_TREE)
1573 error ("template-id %qD for %q+D does not match any template "
1574 "declaration", template_id, decl);
1575 return error_mark_node;
1577 else if ((templates && TREE_CHAIN (templates))
1578 || (candidates && TREE_CHAIN (candidates))
1579 || (templates && candidates))
1581 error ("ambiguous template specialization %qD for %q+D",
1583 chainon (candidates, templates);
1584 print_candidates (candidates);
1585 return error_mark_node;
1588 /* We have one, and exactly one, match. */
1591 /* It was a specialization of an ordinary member function in a
1593 *targs_out = copy_node (DECL_TI_ARGS (TREE_VALUE (candidates)));
1594 return DECL_TI_TEMPLATE (TREE_VALUE (candidates));
1597 /* It was a specialization of a template. */
1598 targs = DECL_TI_ARGS (DECL_TEMPLATE_RESULT (TREE_VALUE (templates)));
1599 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (targs))
1601 *targs_out = copy_node (targs);
1602 SET_TMPL_ARGS_LEVEL (*targs_out,
1603 TMPL_ARGS_DEPTH (*targs_out),
1604 TREE_PURPOSE (templates));
1607 *targs_out = TREE_PURPOSE (templates);
1608 return TREE_VALUE (templates);
1611 /* Returns a chain of parameter types, exactly like the SPEC_TYPES,
1612 but with the default argument values filled in from those in the
1616 copy_default_args_to_explicit_spec_1 (tree spec_types,
1619 tree new_spec_types;
1624 if (spec_types == void_list_node)
1625 return void_list_node;
1627 /* Substitute into the rest of the list. */
1629 copy_default_args_to_explicit_spec_1 (TREE_CHAIN (spec_types),
1630 TREE_CHAIN (tmpl_types));
1632 /* Add the default argument for this parameter. */
1633 return hash_tree_cons (TREE_PURPOSE (tmpl_types),
1634 TREE_VALUE (spec_types),
1638 /* DECL is an explicit specialization. Replicate default arguments
1639 from the template it specializes. (That way, code like:
1641 template <class T> void f(T = 3);
1642 template <> void f(double);
1645 works, as required.) An alternative approach would be to look up
1646 the correct default arguments at the call-site, but this approach
1647 is consistent with how implicit instantiations are handled. */
1650 copy_default_args_to_explicit_spec (tree decl)
1655 tree new_spec_types;
1659 tree object_type = NULL_TREE;
1660 tree in_charge = NULL_TREE;
1661 tree vtt = NULL_TREE;
1663 /* See if there's anything we need to do. */
1664 tmpl = DECL_TI_TEMPLATE (decl);
1665 tmpl_types = TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (tmpl)));
1666 for (t = tmpl_types; t; t = TREE_CHAIN (t))
1667 if (TREE_PURPOSE (t))
1672 old_type = TREE_TYPE (decl);
1673 spec_types = TYPE_ARG_TYPES (old_type);
1675 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl))
1677 /* Remove the this pointer, but remember the object's type for
1679 object_type = TREE_TYPE (TREE_VALUE (spec_types));
1680 spec_types = TREE_CHAIN (spec_types);
1681 tmpl_types = TREE_CHAIN (tmpl_types);
1683 if (DECL_HAS_IN_CHARGE_PARM_P (decl))
1685 /* DECL may contain more parameters than TMPL due to the extra
1686 in-charge parameter in constructors and destructors. */
1687 in_charge = spec_types;
1688 spec_types = TREE_CHAIN (spec_types);
1690 if (DECL_HAS_VTT_PARM_P (decl))
1693 spec_types = TREE_CHAIN (spec_types);
1697 /* Compute the merged default arguments. */
1699 copy_default_args_to_explicit_spec_1 (spec_types, tmpl_types);
1701 /* Compute the new FUNCTION_TYPE. */
1705 new_spec_types = hash_tree_cons (TREE_PURPOSE (vtt),
1710 /* Put the in-charge parameter back. */
1711 new_spec_types = hash_tree_cons (TREE_PURPOSE (in_charge),
1712 TREE_VALUE (in_charge),
1715 new_type = build_method_type_directly (object_type,
1716 TREE_TYPE (old_type),
1720 new_type = build_function_type (TREE_TYPE (old_type),
1722 new_type = cp_build_type_attribute_variant (new_type,
1723 TYPE_ATTRIBUTES (old_type));
1724 new_type = build_exception_variant (new_type,
1725 TYPE_RAISES_EXCEPTIONS (old_type));
1726 TREE_TYPE (decl) = new_type;
1729 /* Check to see if the function just declared, as indicated in
1730 DECLARATOR, and in DECL, is a specialization of a function
1731 template. We may also discover that the declaration is an explicit
1732 instantiation at this point.
1734 Returns DECL, or an equivalent declaration that should be used
1735 instead if all goes well. Issues an error message if something is
1736 amiss. Returns error_mark_node if the error is not easily
1739 FLAGS is a bitmask consisting of the following flags:
1741 2: The function has a definition.
1742 4: The function is a friend.
1744 The TEMPLATE_COUNT is the number of references to qualifying
1745 template classes that appeared in the name of the function. For
1748 template <class T> struct S { void f(); };
1751 the TEMPLATE_COUNT would be 1. However, explicitly specialized
1752 classes are not counted in the TEMPLATE_COUNT, so that in
1754 template <class T> struct S {};
1755 template <> struct S<int> { void f(); }
1756 template <> void S<int>::f();
1758 the TEMPLATE_COUNT would be 0. (Note that this declaration is
1759 invalid; there should be no template <>.)
1761 If the function is a specialization, it is marked as such via
1762 DECL_TEMPLATE_SPECIALIZATION. Furthermore, its DECL_TEMPLATE_INFO
1763 is set up correctly, and it is added to the list of specializations
1764 for that template. */
1767 check_explicit_specialization (tree declarator,
1772 int have_def = flags & 2;
1773 int is_friend = flags & 4;
1774 int specialization = 0;
1775 int explicit_instantiation = 0;
1776 int member_specialization = 0;
1777 tree ctype = DECL_CLASS_CONTEXT (decl);
1778 tree dname = DECL_NAME (decl);
1783 if (!processing_specialization)
1786 tsk = tsk_excessive_parms;
1789 tsk = current_tmpl_spec_kind (template_count);
1794 if (processing_specialization)
1797 SET_DECL_TEMPLATE_SPECIALIZATION (decl);
1799 else if (TREE_CODE (declarator) == TEMPLATE_ID_EXPR)
1802 /* This could be something like:
1804 template <class T> void f(T);
1805 class S { friend void f<>(int); } */
1809 /* This case handles bogus declarations like template <>
1810 template <class T> void f<int>(); */
1812 error ("template-id %qD in declaration of primary template",
1819 case tsk_invalid_member_spec:
1820 /* The error has already been reported in
1821 check_specialization_scope. */
1822 return error_mark_node;
1824 case tsk_invalid_expl_inst:
1825 error ("template parameter list used in explicit instantiation");
1831 error ("definition provided for explicit instantiation");
1833 explicit_instantiation = 1;
1836 case tsk_excessive_parms:
1837 case tsk_insufficient_parms:
1838 if (tsk == tsk_excessive_parms)
1839 error ("too many template parameter lists in declaration of %qD",
1841 else if (template_header_count)
1842 error("too few template parameter lists in declaration of %qD", decl);
1844 error("explicit specialization of %qD must be introduced by "
1845 "%<template <>%>", decl);
1849 SET_DECL_TEMPLATE_SPECIALIZATION (decl);
1851 member_specialization = 1;
1857 if (TREE_CODE (declarator) == TEMPLATE_ID_EXPR)
1859 /* This case handles bogus declarations like template <>
1860 template <class T> void f<int>(); */
1862 if (uses_template_parms (declarator))
1863 error ("function template partial specialization %qD "
1864 "is not allowed", declarator);
1866 error ("template-id %qD in declaration of primary template",
1871 if (ctype && CLASSTYPE_TEMPLATE_INSTANTIATION (ctype))
1872 /* This is a specialization of a member template, without
1873 specialization the containing class. Something like:
1875 template <class T> struct S {
1876 template <class U> void f (U);
1878 template <> template <class U> void S<int>::f(U) {}
1880 That's a specialization -- but of the entire template. */
1888 if (specialization || member_specialization)
1890 tree t = TYPE_ARG_TYPES (TREE_TYPE (decl));
1891 for (; t; t = TREE_CHAIN (t))
1892 if (TREE_PURPOSE (t))
1895 ("default argument specified in explicit specialization");
1898 if (current_lang_name == lang_name_c)
1899 error ("template specialization with C linkage");
1902 if (specialization || member_specialization || explicit_instantiation)
1904 tree tmpl = NULL_TREE;
1905 tree targs = NULL_TREE;
1907 /* Make sure that the declarator is a TEMPLATE_ID_EXPR. */
1908 if (TREE_CODE (declarator) != TEMPLATE_ID_EXPR)
1912 gcc_assert (TREE_CODE (declarator) == IDENTIFIER_NODE);
1917 /* If there is no class context, the explicit instantiation
1918 must be at namespace scope. */
1919 gcc_assert (DECL_NAMESPACE_SCOPE_P (decl));
1921 /* Find the namespace binding, using the declaration
1923 fns = namespace_binding (dname, CP_DECL_CONTEXT (decl));
1924 if (!fns || !is_overloaded_fn (fns))
1926 error ("%qD is not a template function", dname);
1927 fns = error_mark_node;
1931 declarator = lookup_template_function (fns, NULL_TREE);
1934 if (declarator == error_mark_node)
1935 return error_mark_node;
1937 if (ctype != NULL_TREE && TYPE_BEING_DEFINED (ctype))
1939 if (!explicit_instantiation)
1940 /* A specialization in class scope. This is invalid,
1941 but the error will already have been flagged by
1942 check_specialization_scope. */
1943 return error_mark_node;
1946 /* It's not valid to write an explicit instantiation in
1949 class C { template void f(); }
1951 This case is caught by the parser. However, on
1954 template class C { void f(); };
1956 (which is invalid) we can get here. The error will be
1963 else if (ctype != NULL_TREE
1964 && (TREE_CODE (TREE_OPERAND (declarator, 0)) ==
1967 /* Find the list of functions in ctype that have the same
1968 name as the declared function. */
1969 tree name = TREE_OPERAND (declarator, 0);
1970 tree fns = NULL_TREE;
1973 if (constructor_name_p (name, ctype))
1975 int is_constructor = DECL_CONSTRUCTOR_P (decl);
1977 if (is_constructor ? !TYPE_HAS_CONSTRUCTOR (ctype)
1978 : !CLASSTYPE_DESTRUCTORS (ctype))
1980 /* From [temp.expl.spec]:
1982 If such an explicit specialization for the member
1983 of a class template names an implicitly-declared
1984 special member function (clause _special_), the
1985 program is ill-formed.
1987 Similar language is found in [temp.explicit]. */
1988 error ("specialization of implicitly-declared special member function");
1989 return error_mark_node;
1992 name = is_constructor ? ctor_identifier : dtor_identifier;
1995 if (!DECL_CONV_FN_P (decl))
1997 idx = lookup_fnfields_1 (ctype, name);
1999 fns = VEC_index (tree, CLASSTYPE_METHOD_VEC (ctype), idx);
2003 VEC(tree,gc) *methods;
2006 /* For a type-conversion operator, we cannot do a
2007 name-based lookup. We might be looking for `operator
2008 int' which will be a specialization of `operator T'.
2009 So, we find *all* the conversion operators, and then
2010 select from them. */
2013 methods = CLASSTYPE_METHOD_VEC (ctype);
2015 for (idx = CLASSTYPE_FIRST_CONVERSION_SLOT;
2016 VEC_iterate (tree, methods, idx, ovl);
2019 if (!DECL_CONV_FN_P (OVL_CURRENT (ovl)))
2020 /* There are no more conversion functions. */
2023 /* Glue all these conversion functions together
2024 with those we already have. */
2025 for (; ovl; ovl = OVL_NEXT (ovl))
2026 fns = ovl_cons (OVL_CURRENT (ovl), fns);
2030 if (fns == NULL_TREE)
2032 error ("no member function %qD declared in %qT", name, ctype);
2033 return error_mark_node;
2036 TREE_OPERAND (declarator, 0) = fns;
2039 /* Figure out what exactly is being specialized at this point.
2040 Note that for an explicit instantiation, even one for a
2041 member function, we cannot tell apriori whether the
2042 instantiation is for a member template, or just a member
2043 function of a template class. Even if a member template is
2044 being instantiated, the member template arguments may be
2045 elided if they can be deduced from the rest of the
2047 tmpl = determine_specialization (declarator, decl,
2049 member_specialization,
2052 if (!tmpl || tmpl == error_mark_node)
2053 /* We couldn't figure out what this declaration was
2055 return error_mark_node;
2058 tree gen_tmpl = most_general_template (tmpl);
2060 if (explicit_instantiation)
2062 /* We don't set DECL_EXPLICIT_INSTANTIATION here; that
2063 is done by do_decl_instantiation later. */
2065 int arg_depth = TMPL_ARGS_DEPTH (targs);
2066 int parm_depth = TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl));
2068 if (arg_depth > parm_depth)
2070 /* If TMPL is not the most general template (for
2071 example, if TMPL is a friend template that is
2072 injected into namespace scope), then there will
2073 be too many levels of TARGS. Remove some of them
2078 new_targs = make_tree_vec (parm_depth);
2079 for (i = arg_depth - parm_depth; i < arg_depth; ++i)
2080 TREE_VEC_ELT (new_targs, i - (arg_depth - parm_depth))
2081 = TREE_VEC_ELT (targs, i);
2085 return instantiate_template (tmpl, targs, tf_error);
2088 /* If we thought that the DECL was a member function, but it
2089 turns out to be specializing a static member function,
2090 make DECL a static member function as well. */
2091 if (DECL_STATIC_FUNCTION_P (tmpl)
2092 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl))
2093 revert_static_member_fn (decl);
2095 /* If this is a specialization of a member template of a
2096 template class. In we want to return the TEMPLATE_DECL,
2097 not the specialization of it. */
2098 if (tsk == tsk_template)
2100 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl);
2101 DECL_INITIAL (DECL_TEMPLATE_RESULT (tmpl)) = NULL_TREE;
2104 DECL_SOURCE_LOCATION (tmpl) = DECL_SOURCE_LOCATION (decl);
2105 DECL_SOURCE_LOCATION (DECL_TEMPLATE_RESULT (tmpl))
2106 = DECL_SOURCE_LOCATION (decl);
2107 /* We want to use the argument list specified in the
2108 definition, not in the original declaration. */
2109 DECL_ARGUMENTS (DECL_TEMPLATE_RESULT (tmpl))
2110 = DECL_ARGUMENTS (decl);
2115 /* Set up the DECL_TEMPLATE_INFO for DECL. */
2116 DECL_TEMPLATE_INFO (decl) = tree_cons (tmpl, targs, NULL_TREE);
2118 /* Inherit default function arguments from the template
2119 DECL is specializing. */
2120 copy_default_args_to_explicit_spec (decl);
2122 /* This specialization has the same protection as the
2123 template it specializes. */
2124 TREE_PRIVATE (decl) = TREE_PRIVATE (gen_tmpl);
2125 TREE_PROTECTED (decl) = TREE_PROTECTED (gen_tmpl);
2126 /* The specialization has the same visibility as the
2127 template it specializes. */
2128 if (DECL_VISIBILITY_SPECIFIED (gen_tmpl))
2130 DECL_VISIBILITY_SPECIFIED (decl) = 1;
2131 DECL_VISIBILITY (decl) = DECL_VISIBILITY (gen_tmpl);
2133 /* If DECL is a friend declaration, declared using an
2134 unqualified name, the namespace associated with DECL may
2135 have been set incorrectly. For example, in:
2137 template <typename T> void f(T);
2139 struct S { friend void f<int>(int); }
2142 we will have set the DECL_CONTEXT for the friend
2143 declaration to N, rather than to the global namespace. */
2144 if (DECL_NAMESPACE_SCOPE_P (decl))
2145 DECL_CONTEXT (decl) = DECL_CONTEXT (tmpl);
2147 if (is_friend && !have_def)
2148 /* This is not really a declaration of a specialization.
2149 It's just the name of an instantiation. But, it's not
2150 a request for an instantiation, either. */
2151 SET_DECL_IMPLICIT_INSTANTIATION (decl);
2152 else if (DECL_CONSTRUCTOR_P (decl) || DECL_DESTRUCTOR_P (decl))
2153 /* This is indeed a specialization. In case of constructors
2154 and destructors, we need in-charge and not-in-charge
2155 versions in V3 ABI. */
2156 clone_function_decl (decl, /*update_method_vec_p=*/0);
2158 /* Register this specialization so that we can find it
2160 decl = register_specialization (decl, gen_tmpl, targs, is_friend);
2167 /* Returns 1 iff PARMS1 and PARMS2 are identical sets of template
2168 parameters. These are represented in the same format used for
2169 DECL_TEMPLATE_PARMS. */
2172 comp_template_parms (tree parms1, tree parms2)
2177 if (parms1 == parms2)
2180 for (p1 = parms1, p2 = parms2;
2181 p1 != NULL_TREE && p2 != NULL_TREE;
2182 p1 = TREE_CHAIN (p1), p2 = TREE_CHAIN (p2))
2184 tree t1 = TREE_VALUE (p1);
2185 tree t2 = TREE_VALUE (p2);
2188 gcc_assert (TREE_CODE (t1) == TREE_VEC);
2189 gcc_assert (TREE_CODE (t2) == TREE_VEC);
2191 if (TREE_VEC_LENGTH (t1) != TREE_VEC_LENGTH (t2))
2194 for (i = 0; i < TREE_VEC_LENGTH (t2); ++i)
2196 tree parm1 = TREE_VALUE (TREE_VEC_ELT (t1, i));
2197 tree parm2 = TREE_VALUE (TREE_VEC_ELT (t2, i));
2199 if (TREE_CODE (parm1) != TREE_CODE (parm2))
2202 if (TREE_CODE (parm1) == TEMPLATE_TYPE_PARM)
2204 else if (!same_type_p (TREE_TYPE (parm1), TREE_TYPE (parm2)))
2209 if ((p1 != NULL_TREE) != (p2 != NULL_TREE))
2210 /* One set of parameters has more parameters lists than the
2217 /* Complain if DECL shadows a template parameter.
2219 [temp.local]: A template-parameter shall not be redeclared within its
2220 scope (including nested scopes). */
2223 check_template_shadow (tree decl)
2227 /* If we're not in a template, we can't possibly shadow a template
2229 if (!current_template_parms)
2232 /* Figure out what we're shadowing. */
2233 if (TREE_CODE (decl) == OVERLOAD)
2234 decl = OVL_CURRENT (decl);
2235 olddecl = innermost_non_namespace_value (DECL_NAME (decl));
2237 /* If there's no previous binding for this name, we're not shadowing
2238 anything, let alone a template parameter. */
2242 /* If we're not shadowing a template parameter, we're done. Note
2243 that OLDDECL might be an OVERLOAD (or perhaps even an
2244 ERROR_MARK), so we can't just blithely assume it to be a _DECL
2246 if (!DECL_P (olddecl) || !DECL_TEMPLATE_PARM_P (olddecl))
2249 /* We check for decl != olddecl to avoid bogus errors for using a
2250 name inside a class. We check TPFI to avoid duplicate errors for
2251 inline member templates. */
2253 || TEMPLATE_PARMS_FOR_INLINE (current_template_parms))
2256 error ("declaration of %q+#D", decl);
2257 error (" shadows template parm %q+#D", olddecl);
2260 /* Return a new TEMPLATE_PARM_INDEX with the indicated INDEX, LEVEL,
2261 ORIG_LEVEL, DECL, and TYPE. */
2264 build_template_parm_index (int index,
2270 tree t = make_node (TEMPLATE_PARM_INDEX);
2271 TEMPLATE_PARM_IDX (t) = index;
2272 TEMPLATE_PARM_LEVEL (t) = level;
2273 TEMPLATE_PARM_ORIG_LEVEL (t) = orig_level;
2274 TEMPLATE_PARM_DECL (t) = decl;
2275 TREE_TYPE (t) = type;
2276 TREE_CONSTANT (t) = TREE_CONSTANT (decl);
2277 TREE_INVARIANT (t) = TREE_INVARIANT (decl);
2278 TREE_READONLY (t) = TREE_READONLY (decl);
2283 /* Return a TEMPLATE_PARM_INDEX, similar to INDEX, but whose
2284 TEMPLATE_PARM_LEVEL has been decreased by LEVELS. If such a
2285 TEMPLATE_PARM_INDEX already exists, it is returned; otherwise, a
2286 new one is created. */
2289 reduce_template_parm_level (tree index, tree type, int levels)
2291 if (TEMPLATE_PARM_DESCENDANTS (index) == NULL_TREE
2292 || (TEMPLATE_PARM_LEVEL (TEMPLATE_PARM_DESCENDANTS (index))
2293 != TEMPLATE_PARM_LEVEL (index) - levels))
2295 tree orig_decl = TEMPLATE_PARM_DECL (index);
2298 decl = build_decl (TREE_CODE (orig_decl), DECL_NAME (orig_decl), type);
2299 TREE_CONSTANT (decl) = TREE_CONSTANT (orig_decl);
2300 TREE_INVARIANT (decl) = TREE_INVARIANT (orig_decl);
2301 TREE_READONLY (decl) = TREE_READONLY (orig_decl);
2302 DECL_ARTIFICIAL (decl) = 1;
2303 SET_DECL_TEMPLATE_PARM_P (decl);
2305 t = build_template_parm_index (TEMPLATE_PARM_IDX (index),
2306 TEMPLATE_PARM_LEVEL (index) - levels,
2307 TEMPLATE_PARM_ORIG_LEVEL (index),
2309 TEMPLATE_PARM_DESCENDANTS (index) = t;
2311 /* Template template parameters need this. */
2312 if (TREE_CODE (decl) != CONST_DECL)
2313 DECL_TEMPLATE_PARMS (decl)
2314 = DECL_TEMPLATE_PARMS (TEMPLATE_PARM_DECL (index));
2317 return TEMPLATE_PARM_DESCENDANTS (index);
2320 /* Process information from new template parameter NEXT and append it to the
2321 LIST being built. This new parameter is a non-type parameter iff
2322 IS_NON_TYPE is true. */
2325 process_template_parm (tree list, tree next, bool is_non_type)
2333 gcc_assert (TREE_CODE (parm) == TREE_LIST);
2334 defval = TREE_PURPOSE (parm);
2338 tree p = TREE_VALUE (tree_last (list));
2340 if (TREE_CODE (p) == TYPE_DECL || TREE_CODE (p) == TEMPLATE_DECL)
2341 idx = TEMPLATE_TYPE_IDX (TREE_TYPE (p));
2343 idx = TEMPLATE_PARM_IDX (DECL_INITIAL (p));
2351 parm = TREE_VALUE (parm);
2353 SET_DECL_TEMPLATE_PARM_P (parm);
2357 The top-level cv-qualifiers on the template-parameter are
2358 ignored when determining its type. */
2359 TREE_TYPE (parm) = TYPE_MAIN_VARIANT (TREE_TYPE (parm));
2361 /* A template parameter is not modifiable. */
2362 TREE_CONSTANT (parm) = 1;
2363 TREE_INVARIANT (parm) = 1;
2364 TREE_READONLY (parm) = 1;
2365 if (invalid_nontype_parm_type_p (TREE_TYPE (parm), 1))
2366 TREE_TYPE (parm) = void_type_node;
2367 decl = build_decl (CONST_DECL, DECL_NAME (parm), TREE_TYPE (parm));
2368 TREE_CONSTANT (decl) = 1;
2369 TREE_INVARIANT (decl) = 1;
2370 TREE_READONLY (decl) = 1;
2371 DECL_INITIAL (parm) = DECL_INITIAL (decl)
2372 = build_template_parm_index (idx, processing_template_decl,
2373 processing_template_decl,
2374 decl, TREE_TYPE (parm));
2379 parm = TREE_VALUE (TREE_VALUE (parm));
2381 if (parm && TREE_CODE (parm) == TEMPLATE_DECL)
2383 t = make_aggr_type (TEMPLATE_TEMPLATE_PARM);
2384 /* This is for distinguishing between real templates and template
2385 template parameters */
2386 TREE_TYPE (parm) = t;
2387 TREE_TYPE (DECL_TEMPLATE_RESULT (parm)) = t;
2392 t = make_aggr_type (TEMPLATE_TYPE_PARM);
2393 /* parm is either IDENTIFIER_NODE or NULL_TREE. */
2394 decl = build_decl (TYPE_DECL, parm, t);
2397 TYPE_NAME (t) = decl;
2398 TYPE_STUB_DECL (t) = decl;
2400 TEMPLATE_TYPE_PARM_INDEX (t)
2401 = build_template_parm_index (idx, processing_template_decl,
2402 processing_template_decl,
2403 decl, TREE_TYPE (parm));
2405 DECL_ARTIFICIAL (decl) = 1;
2406 SET_DECL_TEMPLATE_PARM_P (decl);
2408 parm = build_tree_list (defval, parm);
2409 return chainon (list, parm);
2412 /* The end of a template parameter list has been reached. Process the
2413 tree list into a parameter vector, converting each parameter into a more
2414 useful form. Type parameters are saved as IDENTIFIER_NODEs, and others
2418 end_template_parm_list (tree parms)
2422 tree saved_parmlist = make_tree_vec (list_length (parms));
2424 current_template_parms
2425 = tree_cons (size_int (processing_template_decl),
2426 saved_parmlist, current_template_parms);
2428 for (parm = parms, nparms = 0; parm; parm = next, nparms++)
2430 next = TREE_CHAIN (parm);
2431 TREE_VEC_ELT (saved_parmlist, nparms) = parm;
2432 TREE_CHAIN (parm) = NULL_TREE;
2435 --processing_template_parmlist;
2437 return saved_parmlist;
2440 /* end_template_decl is called after a template declaration is seen. */
2443 end_template_decl (void)
2445 reset_specialization ();
2447 if (! processing_template_decl)
2450 /* This matches the pushlevel in begin_template_parm_list. */
2453 --processing_template_decl;
2454 current_template_parms = TREE_CHAIN (current_template_parms);
2457 /* Given a template argument vector containing the template PARMS.
2458 The innermost PARMS are given first. */
2461 current_template_args (void)
2464 tree args = NULL_TREE;
2465 int length = TMPL_PARMS_DEPTH (current_template_parms);
2468 /* If there is only one level of template parameters, we do not
2469 create a TREE_VEC of TREE_VECs. Instead, we return a single
2470 TREE_VEC containing the arguments. */
2472 args = make_tree_vec (length);
2474 for (header = current_template_parms; header; header = TREE_CHAIN (header))
2476 tree a = copy_node (TREE_VALUE (header));
2479 TREE_TYPE (a) = NULL_TREE;
2480 for (i = TREE_VEC_LENGTH (a) - 1; i >= 0; --i)
2482 tree t = TREE_VEC_ELT (a, i);
2484 /* T will be a list if we are called from within a
2485 begin/end_template_parm_list pair, but a vector directly
2486 if within a begin/end_member_template_processing pair. */
2487 if (TREE_CODE (t) == TREE_LIST)
2491 if (TREE_CODE (t) == TYPE_DECL
2492 || TREE_CODE (t) == TEMPLATE_DECL)
2495 t = DECL_INITIAL (t);
2496 TREE_VEC_ELT (a, i) = t;
2501 TREE_VEC_ELT (args, --l) = a;
2509 /* Return a TEMPLATE_DECL corresponding to DECL, using the indicated
2510 template PARMS. If MEMBER_TEMPLATE_P is true, the new template is
2511 a member template. Used by push_template_decl below. */
2514 build_template_decl (tree decl, tree parms, bool member_template_p)
2516 tree tmpl = build_lang_decl (TEMPLATE_DECL, DECL_NAME (decl), NULL_TREE);
2517 DECL_TEMPLATE_PARMS (tmpl) = parms;
2518 DECL_CONTEXT (tmpl) = DECL_CONTEXT (decl);
2519 DECL_MEMBER_TEMPLATE_P (tmpl) = member_template_p;
2520 if (DECL_LANG_SPECIFIC (decl))
2522 DECL_STATIC_FUNCTION_P (tmpl) = DECL_STATIC_FUNCTION_P (decl);
2523 DECL_CONSTRUCTOR_P (tmpl) = DECL_CONSTRUCTOR_P (decl);
2524 DECL_DESTRUCTOR_P (tmpl) = DECL_DESTRUCTOR_P (decl);
2525 DECL_NONCONVERTING_P (tmpl) = DECL_NONCONVERTING_P (decl);
2526 DECL_ASSIGNMENT_OPERATOR_P (tmpl) = DECL_ASSIGNMENT_OPERATOR_P (decl);
2527 if (DECL_OVERLOADED_OPERATOR_P (decl))
2528 SET_OVERLOADED_OPERATOR_CODE (tmpl,
2529 DECL_OVERLOADED_OPERATOR_P (decl));
2535 struct template_parm_data
2537 /* The level of the template parameters we are currently
2541 /* The index of the specialization argument we are currently
2545 /* An array whose size is the number of template parameters. The
2546 elements are nonzero if the parameter has been used in any one
2547 of the arguments processed so far. */
2550 /* An array whose size is the number of template arguments. The
2551 elements are nonzero if the argument makes use of template
2552 parameters of this level. */
2553 int* arg_uses_template_parms;
2556 /* Subroutine of push_template_decl used to see if each template
2557 parameter in a partial specialization is used in the explicit
2558 argument list. If T is of the LEVEL given in DATA (which is
2559 treated as a template_parm_data*), then DATA->PARMS is marked
2563 mark_template_parm (tree t, void* data)
2567 struct template_parm_data* tpd = (struct template_parm_data*) data;
2569 if (TREE_CODE (t) == TEMPLATE_PARM_INDEX)
2571 level = TEMPLATE_PARM_LEVEL (t);
2572 idx = TEMPLATE_PARM_IDX (t);
2576 level = TEMPLATE_TYPE_LEVEL (t);
2577 idx = TEMPLATE_TYPE_IDX (t);
2580 if (level == tpd->level)
2582 tpd->parms[idx] = 1;
2583 tpd->arg_uses_template_parms[tpd->current_arg] = 1;
2586 /* Return zero so that for_each_template_parm will continue the
2587 traversal of the tree; we want to mark *every* template parm. */
2591 /* Process the partial specialization DECL. */
2594 process_partial_specialization (tree decl)
2596 tree type = TREE_TYPE (decl);
2597 tree maintmpl = CLASSTYPE_TI_TEMPLATE (type);
2598 tree specargs = CLASSTYPE_TI_ARGS (type);
2599 tree inner_args = INNERMOST_TEMPLATE_ARGS (specargs);
2600 tree inner_parms = INNERMOST_TEMPLATE_PARMS (current_template_parms);
2601 tree main_inner_parms = DECL_INNERMOST_TEMPLATE_PARMS (maintmpl);
2602 int nargs = TREE_VEC_LENGTH (inner_args);
2603 int ntparms = TREE_VEC_LENGTH (inner_parms);
2605 int did_error_intro = 0;
2606 struct template_parm_data tpd;
2607 struct template_parm_data tpd2;
2609 /* We check that each of the template parameters given in the
2610 partial specialization is used in the argument list to the
2611 specialization. For example:
2613 template <class T> struct S;
2614 template <class T> struct S<T*>;
2616 The second declaration is OK because `T*' uses the template
2617 parameter T, whereas
2619 template <class T> struct S<int>;
2621 is no good. Even trickier is:
2632 The S2<T> declaration is actually invalid; it is a
2633 full-specialization. Of course,
2636 struct S2<T (*)(U)>;
2638 or some such would have been OK. */
2639 tpd.level = TMPL_PARMS_DEPTH (current_template_parms);
2640 tpd.parms = alloca (sizeof (int) * ntparms);
2641 memset (tpd.parms, 0, sizeof (int) * ntparms);
2643 tpd.arg_uses_template_parms = alloca (sizeof (int) * nargs);
2644 memset (tpd.arg_uses_template_parms, 0, sizeof (int) * nargs);
2645 for (i = 0; i < nargs; ++i)
2647 tpd.current_arg = i;
2648 for_each_template_parm (TREE_VEC_ELT (inner_args, i),
2649 &mark_template_parm,
2653 for (i = 0; i < ntparms; ++i)
2654 if (tpd.parms[i] == 0)
2656 /* One of the template parms was not used in the
2658 if (!did_error_intro)
2660 error ("template parameters not used in partial specialization:");
2661 did_error_intro = 1;
2664 error (" %qD", TREE_VALUE (TREE_VEC_ELT (inner_parms, i)));
2667 /* [temp.class.spec]
2669 The argument list of the specialization shall not be identical to
2670 the implicit argument list of the primary template. */
2671 if (comp_template_args
2673 INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE
2675 error ("partial specialization %qT does not specialize any template arguments", type);
2677 /* [temp.class.spec]
2679 A partially specialized non-type argument expression shall not
2680 involve template parameters of the partial specialization except
2681 when the argument expression is a simple identifier.
2683 The type of a template parameter corresponding to a specialized
2684 non-type argument shall not be dependent on a parameter of the
2686 gcc_assert (nargs == DECL_NTPARMS (maintmpl));
2688 for (i = 0; i < nargs; ++i)
2690 tree arg = TREE_VEC_ELT (inner_args, i);
2691 if (/* These first two lines are the `non-type' bit. */
2693 && TREE_CODE (arg) != TEMPLATE_DECL
2694 /* This next line is the `argument expression is not just a
2695 simple identifier' condition and also the `specialized
2696 non-type argument' bit. */
2697 && TREE_CODE (arg) != TEMPLATE_PARM_INDEX)
2699 if (tpd.arg_uses_template_parms[i])
2700 error ("template argument %qE involves template parameter(s)", arg);
2703 /* Look at the corresponding template parameter,
2704 marking which template parameters its type depends
2707 TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (main_inner_parms,
2712 /* We haven't yet initialized TPD2. Do so now. */
2713 tpd2.arg_uses_template_parms
2714 = alloca (sizeof (int) * nargs);
2715 /* The number of parameters here is the number in the
2716 main template, which, as checked in the assertion
2718 tpd2.parms = alloca (sizeof (int) * nargs);
2720 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (maintmpl));
2723 /* Mark the template parameters. But this time, we're
2724 looking for the template parameters of the main
2725 template, not in the specialization. */
2726 tpd2.current_arg = i;
2727 tpd2.arg_uses_template_parms[i] = 0;
2728 memset (tpd2.parms, 0, sizeof (int) * nargs);
2729 for_each_template_parm (type,
2730 &mark_template_parm,
2734 if (tpd2.arg_uses_template_parms [i])
2736 /* The type depended on some template parameters.
2737 If they are fully specialized in the
2738 specialization, that's OK. */
2740 for (j = 0; j < nargs; ++j)
2741 if (tpd2.parms[j] != 0
2742 && tpd.arg_uses_template_parms [j])
2744 error ("type %qT of template argument %qE depends "
2745 "on template parameter(s)",
2755 if (retrieve_specialization (maintmpl, specargs,
2756 /*class_specializations_p=*/true))
2757 /* We've already got this specialization. */
2760 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl)
2761 = tree_cons (inner_args, inner_parms,
2762 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl));
2763 TREE_TYPE (DECL_TEMPLATE_SPECIALIZATIONS (maintmpl)) = type;
2767 /* Check that a template declaration's use of default arguments is not
2768 invalid. Here, PARMS are the template parameters. IS_PRIMARY is
2769 nonzero if DECL is the thing declared by a primary template.
2770 IS_PARTIAL is nonzero if DECL is a partial specialization. */
2773 check_default_tmpl_args (tree decl, tree parms, int is_primary, int is_partial)
2776 int last_level_to_check;
2781 A default template-argument shall not be specified in a
2782 function template declaration or a function template definition, nor
2783 in the template-parameter-list of the definition of a member of a
2786 if (TREE_CODE (CP_DECL_CONTEXT (decl)) == FUNCTION_DECL)
2787 /* You can't have a function template declaration in a local
2788 scope, nor you can you define a member of a class template in a
2792 if (current_class_type
2793 && !TYPE_BEING_DEFINED (current_class_type)
2794 && DECL_LANG_SPECIFIC (decl)
2795 /* If this is either a friend defined in the scope of the class
2796 or a member function. */
2797 && (DECL_FUNCTION_MEMBER_P (decl)
2798 ? same_type_p (DECL_CONTEXT (decl), current_class_type)
2799 : DECL_FRIEND_CONTEXT (decl)
2800 ? same_type_p (DECL_FRIEND_CONTEXT (decl), current_class_type)
2802 /* And, if it was a member function, it really was defined in
2803 the scope of the class. */
2804 && (!DECL_FUNCTION_MEMBER_P (decl)
2805 || DECL_INITIALIZED_IN_CLASS_P (decl)))
2806 /* We already checked these parameters when the template was
2807 declared, so there's no need to do it again now. This function
2808 was defined in class scope, but we're processing it's body now
2809 that the class is complete. */
2814 If a template-parameter has a default template-argument, all
2815 subsequent template-parameters shall have a default
2816 template-argument supplied. */
2817 for (parm_level = parms; parm_level; parm_level = TREE_CHAIN (parm_level))
2819 tree inner_parms = TREE_VALUE (parm_level);
2820 int ntparms = TREE_VEC_LENGTH (inner_parms);
2821 int seen_def_arg_p = 0;
2824 for (i = 0; i < ntparms; ++i)
2826 tree parm = TREE_VEC_ELT (inner_parms, i);
2827 if (TREE_PURPOSE (parm))
2829 else if (seen_def_arg_p)
2831 error ("no default argument for %qD", TREE_VALUE (parm));
2832 /* For better subsequent error-recovery, we indicate that
2833 there should have been a default argument. */
2834 TREE_PURPOSE (parm) = error_mark_node;
2839 if (TREE_CODE (decl) != TYPE_DECL || is_partial || !is_primary)
2840 /* For an ordinary class template, default template arguments are
2841 allowed at the innermost level, e.g.:
2842 template <class T = int>
2844 but, in a partial specialization, they're not allowed even
2845 there, as we have in [temp.class.spec]:
2847 The template parameter list of a specialization shall not
2848 contain default template argument values.
2850 So, for a partial specialization, or for a function template,
2851 we look at all of them. */
2854 /* But, for a primary class template that is not a partial
2855 specialization we look at all template parameters except the
2857 parms = TREE_CHAIN (parms);
2859 /* Figure out what error message to issue. */
2860 if (TREE_CODE (decl) == FUNCTION_DECL)
2861 msg = "default template arguments may not be used in function templates";
2862 else if (is_partial)
2863 msg = "default template arguments may not be used in partial specializations";
2865 msg = "default argument for template parameter for class enclosing %qD";
2867 if (current_class_type && TYPE_BEING_DEFINED (current_class_type))
2868 /* If we're inside a class definition, there's no need to
2869 examine the parameters to the class itself. On the one
2870 hand, they will be checked when the class is defined, and,
2871 on the other, default arguments are valid in things like:
2872 template <class T = double>
2873 struct S { template <class U> void f(U); };
2874 Here the default argument for `S' has no bearing on the
2875 declaration of `f'. */
2876 last_level_to_check = template_class_depth (current_class_type) + 1;
2878 /* Check everything. */
2879 last_level_to_check = 0;
2881 for (parm_level = parms;
2882 parm_level && TMPL_PARMS_DEPTH (parm_level) >= last_level_to_check;
2883 parm_level = TREE_CHAIN (parm_level))
2885 tree inner_parms = TREE_VALUE (parm_level);
2889 ntparms = TREE_VEC_LENGTH (inner_parms);
2890 for (i = 0; i < ntparms; ++i)
2891 if (TREE_PURPOSE (TREE_VEC_ELT (inner_parms, i)))
2899 /* Clear out the default argument so that we are not
2901 TREE_PURPOSE (TREE_VEC_ELT (inner_parms, i)) = NULL_TREE;
2904 /* At this point, if we're still interested in issuing messages,
2905 they must apply to classes surrounding the object declared. */
2907 msg = "default argument for template parameter for class enclosing %qD";
2911 /* Worker for push_template_decl_real, called via
2912 for_each_template_parm. DATA is really an int, indicating the
2913 level of the parameters we are interested in. If T is a template
2914 parameter of that level, return nonzero. */
2917 template_parm_this_level_p (tree t, void* data)
2919 int this_level = *(int *)data;
2922 if (TREE_CODE (t) == TEMPLATE_PARM_INDEX)
2923 level = TEMPLATE_PARM_LEVEL (t);
2925 level = TEMPLATE_TYPE_LEVEL (t);
2926 return level == this_level;
2929 /* Creates a TEMPLATE_DECL for the indicated DECL using the template
2930 parameters given by current_template_args, or reuses a
2931 previously existing one, if appropriate. Returns the DECL, or an
2932 equivalent one, if it is replaced via a call to duplicate_decls.
2934 If IS_FRIEND is true, DECL is a friend declaration. */
2937 push_template_decl_real (tree decl, bool is_friend)
2945 int new_template_p = 0;
2946 /* True if the template is a member template, in the sense of
2948 bool member_template_p = false;
2950 if (decl == error_mark_node)
2953 /* See if this is a partial specialization. */
2954 is_partial = (DECL_IMPLICIT_TYPEDEF_P (decl)
2955 && TREE_CODE (TREE_TYPE (decl)) != ENUMERAL_TYPE
2956 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl)));
2958 if (TREE_CODE (decl) == FUNCTION_DECL && DECL_FRIEND_P (decl))
2962 /* For a friend, we want the context of the friend function, not
2963 the type of which it is a friend. */
2964 ctx = DECL_CONTEXT (decl);
2965 else if (CP_DECL_CONTEXT (decl)
2966 && TREE_CODE (CP_DECL_CONTEXT (decl)) != NAMESPACE_DECL)
2967 /* In the case of a virtual function, we want the class in which
2969 ctx = CP_DECL_CONTEXT (decl);
2971 /* Otherwise, if we're currently defining some class, the DECL
2972 is assumed to be a member of the class. */
2973 ctx = current_scope ();
2975 if (ctx && TREE_CODE (ctx) == NAMESPACE_DECL)
2978 if (!DECL_CONTEXT (decl))
2979 DECL_CONTEXT (decl) = FROB_CONTEXT (current_namespace);
2981 /* See if this is a primary template. */
2982 primary = template_parm_scope_p ();
2986 if (DECL_CLASS_SCOPE_P (decl))
2987 member_template_p = true;
2988 if (current_lang_name == lang_name_c)
2989 error ("template with C linkage");
2990 else if (TREE_CODE (decl) == TYPE_DECL
2991 && ANON_AGGRNAME_P (DECL_NAME (decl)))
2992 error ("template class without a name");
2993 else if (TREE_CODE (decl) == FUNCTION_DECL)
2995 if (DECL_DESTRUCTOR_P (decl))
2999 A destructor shall not be a member template. */
3000 error ("destructor %qD declared as member template", decl);
3001 return error_mark_node;
3003 if (NEW_DELETE_OPNAME_P (DECL_NAME (decl))
3004 && (!TYPE_ARG_TYPES (TREE_TYPE (decl))
3005 || TYPE_ARG_TYPES (TREE_TYPE (decl)) == void_list_node
3006 || !TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl)))
3007 || (TREE_CHAIN (TYPE_ARG_TYPES ((TREE_TYPE (decl))))
3008 == void_list_node)))
3010 /* [basic.stc.dynamic.allocation]
3012 An allocation function can be a function
3013 template. ... Template allocation functions shall
3014 have two or more parameters. */
3015 error ("invalid template declaration of %qD", decl);
3019 else if (DECL_IMPLICIT_TYPEDEF_P (decl)
3020 && CLASS_TYPE_P (TREE_TYPE (decl)))
3024 error ("template declaration of %q#D", decl);
3025 return error_mark_node;
3029 /* Check to see that the rules regarding the use of default
3030 arguments are not being violated. */
3031 check_default_tmpl_args (decl, current_template_parms,
3032 primary, is_partial);
3035 return process_partial_specialization (decl);
3037 args = current_template_args ();
3040 || TREE_CODE (ctx) == FUNCTION_DECL
3041 || (CLASS_TYPE_P (ctx) && TYPE_BEING_DEFINED (ctx))
3042 || (is_friend && !DECL_TEMPLATE_INFO (decl)))
3044 if (DECL_LANG_SPECIFIC (decl)
3045 && DECL_TEMPLATE_INFO (decl)
3046 && DECL_TI_TEMPLATE (decl))
3047 tmpl = DECL_TI_TEMPLATE (decl);
3048 /* If DECL is a TYPE_DECL for a class-template, then there won't
3049 be DECL_LANG_SPECIFIC. The information equivalent to
3050 DECL_TEMPLATE_INFO is found in TYPE_TEMPLATE_INFO instead. */
3051 else if (DECL_IMPLICIT_TYPEDEF_P (decl)
3052 && TYPE_TEMPLATE_INFO (TREE_TYPE (decl))
3053 && TYPE_TI_TEMPLATE (TREE_TYPE (decl)))
3055 /* Since a template declaration already existed for this
3056 class-type, we must be redeclaring it here. Make sure
3057 that the redeclaration is valid. */
3058 redeclare_class_template (TREE_TYPE (decl),
3059 current_template_parms);
3060 /* We don't need to create a new TEMPLATE_DECL; just use the
3061 one we already had. */
3062 tmpl = TYPE_TI_TEMPLATE (TREE_TYPE (decl));
3066 tmpl = build_template_decl (decl, current_template_parms,
3070 if (DECL_LANG_SPECIFIC (decl)
3071 && DECL_TEMPLATE_SPECIALIZATION (decl))
3073 /* A specialization of a member template of a template
3075 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl);
3076 DECL_TEMPLATE_INFO (tmpl) = DECL_TEMPLATE_INFO (decl);
3077 DECL_TEMPLATE_INFO (decl) = NULL_TREE;
3083 tree a, t, current, parms;
3086 if (TREE_CODE (decl) == TYPE_DECL)
3088 if ((IS_AGGR_TYPE_CODE (TREE_CODE (TREE_TYPE (decl)))
3089 || TREE_CODE (TREE_TYPE (decl)) == ENUMERAL_TYPE)
3090 && TYPE_TEMPLATE_INFO (TREE_TYPE (decl))
3091 && TYPE_TI_TEMPLATE (TREE_TYPE (decl)))
3092 tmpl = TYPE_TI_TEMPLATE (TREE_TYPE (decl));
3095 error ("%qD does not declare a template type", decl);
3099 else if (!DECL_LANG_SPECIFIC (decl) || !DECL_TEMPLATE_INFO (decl))
3101 error ("template definition of non-template %q#D", decl);
3105 tmpl = DECL_TI_TEMPLATE (decl);
3107 if (DECL_FUNCTION_TEMPLATE_P (tmpl)
3108 && DECL_TEMPLATE_INFO (decl) && DECL_TI_ARGS (decl)
3109 && DECL_TEMPLATE_SPECIALIZATION (decl)
3110 && DECL_MEMBER_TEMPLATE_P (tmpl))
3114 /* The declaration is a specialization of a member
3115 template, declared outside the class. Therefore, the
3116 innermost template arguments will be NULL, so we
3117 replace them with the arguments determined by the
3118 earlier call to check_explicit_specialization. */
3119 args = DECL_TI_ARGS (decl);
3122 = build_template_decl (decl, current_template_parms,
3124 DECL_TEMPLATE_RESULT (new_tmpl) = decl;
3125 TREE_TYPE (new_tmpl) = TREE_TYPE (decl);
3126 DECL_TI_TEMPLATE (decl) = new_tmpl;
3127 SET_DECL_TEMPLATE_SPECIALIZATION (new_tmpl);
3128 DECL_TEMPLATE_INFO (new_tmpl)
3129 = tree_cons (tmpl, args, NULL_TREE);
3131 register_specialization (new_tmpl,
3132 most_general_template (tmpl),
3138 /* Make sure the template headers we got make sense. */
3140 parms = DECL_TEMPLATE_PARMS (tmpl);
3141 i = TMPL_PARMS_DEPTH (parms);
3142 if (TMPL_ARGS_DEPTH (args) != i)
3144 error ("expected %d levels of template parms for %q#D, got %d",
3145 i, decl, TMPL_ARGS_DEPTH (args));
3148 for (current = decl; i > 0; --i, parms = TREE_CHAIN (parms))
3150 a = TMPL_ARGS_LEVEL (args, i);
3151 t = INNERMOST_TEMPLATE_PARMS (parms);
3153 if (TREE_VEC_LENGTH (t) != TREE_VEC_LENGTH (a))
3155 if (current == decl)
3156 error ("got %d template parameters for %q#D",
3157 TREE_VEC_LENGTH (a), decl);
3159 error ("got %d template parameters for %q#T",
3160 TREE_VEC_LENGTH (a), current);
3161 error (" but %d required", TREE_VEC_LENGTH (t));
3162 return error_mark_node;
3165 /* Perhaps we should also check that the parms are used in the
3166 appropriate qualifying scopes in the declarator? */
3168 if (current == decl)
3171 current = TYPE_CONTEXT (current);
3175 DECL_TEMPLATE_RESULT (tmpl) = decl;
3176 TREE_TYPE (tmpl) = TREE_TYPE (decl);
3178 /* Push template declarations for global functions and types. Note
3179 that we do not try to push a global template friend declared in a
3180 template class; such a thing may well depend on the template
3181 parameters of the class. */
3182 if (new_template_p && !ctx
3183 && !(is_friend && template_class_depth (current_class_type) > 0))
3185 tmpl = pushdecl_namespace_level (tmpl, is_friend);
3186 if (tmpl == error_mark_node)
3187 return error_mark_node;
3189 /* Hide template friend classes that haven't been declared yet. */
3190 if (is_friend && TREE_CODE (decl) == TYPE_DECL)
3192 DECL_ANTICIPATED (tmpl) = 1;
3193 DECL_FRIEND_P (tmpl) = 1;
3199 DECL_PRIMARY_TEMPLATE (tmpl) = tmpl;
3200 if (DECL_CONV_FN_P (tmpl))
3202 int depth = TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl));
3204 /* It is a conversion operator. See if the type converted to
3205 depends on innermost template operands. */
3207 if (uses_template_parms_level (TREE_TYPE (TREE_TYPE (tmpl)),
3209 DECL_TEMPLATE_CONV_FN_P (tmpl) = 1;
3213 /* The DECL_TI_ARGS of DECL contains full set of arguments referring
3214 back to its most general template. If TMPL is a specialization,
3215 ARGS may only have the innermost set of arguments. Add the missing
3216 argument levels if necessary. */
3217 if (DECL_TEMPLATE_INFO (tmpl))
3218 args = add_outermost_template_args (DECL_TI_ARGS (tmpl), args);
3220 info = tree_cons (tmpl, args, NULL_TREE);
3222 if (DECL_IMPLICIT_TYPEDEF_P (decl))
3224 SET_TYPE_TEMPLATE_INFO (TREE_TYPE (tmpl), info);
3225 if ((!ctx || TREE_CODE (ctx) != FUNCTION_DECL)
3226 && TREE_CODE (TREE_TYPE (decl)) != ENUMERAL_TYPE
3227 /* Don't change the name if we've already set it up. */
3228 && !IDENTIFIER_TEMPLATE (DECL_NAME (decl)))
3229 DECL_NAME (decl) = classtype_mangled_name (TREE_TYPE (decl));
3231 else if (DECL_LANG_SPECIFIC (decl))
3232 DECL_TEMPLATE_INFO (decl) = info;
3234 return DECL_TEMPLATE_RESULT (tmpl);
3238 push_template_decl (tree decl)
3240 return push_template_decl_real (decl, false);
3243 /* Called when a class template TYPE is redeclared with the indicated
3244 template PARMS, e.g.:
3246 template <class T> struct S;
3247 template <class T> struct S {}; */
3250 redeclare_class_template (tree type, tree parms)
3256 if (!TYPE_TEMPLATE_INFO (type))
3258 error ("%qT is not a template type", type);
3262 tmpl = TYPE_TI_TEMPLATE (type);
3263 if (!PRIMARY_TEMPLATE_P (tmpl))
3264 /* The type is nested in some template class. Nothing to worry
3265 about here; there are no new template parameters for the nested
3271 error ("template specifiers not specified in declaration of %qD",
3276 parms = INNERMOST_TEMPLATE_PARMS (parms);
3277 tmpl_parms = DECL_INNERMOST_TEMPLATE_PARMS (tmpl);
3279 if (TREE_VEC_LENGTH (parms) != TREE_VEC_LENGTH (tmpl_parms))
3281 error ("previous declaration %q+D", tmpl);
3282 error ("used %d template parameter(s) instead of %d",
3283 TREE_VEC_LENGTH (tmpl_parms),
3284 TREE_VEC_LENGTH (parms));
3288 for (i = 0; i < TREE_VEC_LENGTH (tmpl_parms); ++i)
3290 tree tmpl_parm = TREE_VALUE (TREE_VEC_ELT (tmpl_parms, i));
3291 tree parm = TREE_VALUE (TREE_VEC_ELT (parms, i));
3292 tree tmpl_default = TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms, i));
3293 tree parm_default = TREE_PURPOSE (TREE_VEC_ELT (parms, i));
3295 /* TMPL_PARM and PARM can be either TYPE_DECL, PARM_DECL, or
3297 if (TREE_CODE (tmpl_parm) != TREE_CODE (parm)
3298 || (TREE_CODE (tmpl_parm) != TYPE_DECL
3299 && !same_type_p (TREE_TYPE (tmpl_parm), TREE_TYPE (parm))))
3301 error ("template parameter %q+#D", tmpl_parm);
3302 error ("redeclared here as %q#D", parm);
3306 if (tmpl_default != NULL_TREE && parm_default != NULL_TREE)
3308 /* We have in [temp.param]:
3310 A template-parameter may not be given default arguments
3311 by two different declarations in the same scope. */
3312 error ("redefinition of default argument for %q#D", parm);
3313 error ("%J original definition appeared here", tmpl_parm);
3317 if (parm_default != NULL_TREE)
3318 /* Update the previous template parameters (which are the ones
3319 that will really count) with the new default value. */
3320 TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms, i)) = parm_default;
3321 else if (tmpl_default != NULL_TREE)
3322 /* Update the new parameters, too; they'll be used as the
3323 parameters for any members. */
3324 TREE_PURPOSE (TREE_VEC_ELT (parms, i)) = tmpl_default;
3328 /* Simplify EXPR if it is a non-dependent expression. Returns the
3329 (possibly simplified) expression. */
3332 fold_non_dependent_expr (tree expr)
3334 /* If we're in a template, but EXPR isn't value dependent, simplify
3335 it. We're supposed to treat:
3337 template <typename T> void f(T[1 + 1]);
3338 template <typename T> void f(T[2]);
3340 as two declarations of the same function, for example. */
3341 if (processing_template_decl
3342 && !type_dependent_expression_p (expr)
3343 && !value_dependent_expression_p (expr))
3345 HOST_WIDE_INT saved_processing_template_decl;
3347 saved_processing_template_decl = processing_template_decl;
3348 processing_template_decl = 0;
3349 expr = tsubst_copy_and_build (expr,
3352 /*in_decl=*/NULL_TREE,
3353 /*function_p=*/false);
3354 processing_template_decl = saved_processing_template_decl;
3359 /* EXPR is an expression which is used in a constant-expression context.
3360 For instance, it could be a VAR_DECL with a constant initializer.
3361 Extract the innest constant expression.
3363 This is basically a more powerful version of
3364 integral_constant_value, which can be used also in templates where
3365 initializers can maintain a syntactic rather than semantic form
3366 (even if they are non-dependent, for access-checking purposes). */
3369 fold_decl_constant_value (tree expr)
3371 tree const_expr = expr;
3374 expr = fold_non_dependent_expr (const_expr);
3375 const_expr = integral_constant_value (expr);
3377 while (expr != const_expr);
3382 /* Subroutine of convert_nontype_argument. Converts EXPR to TYPE, which
3383 must be a function or a pointer-to-function type, as specified
3384 in [temp.arg.nontype]: disambiguate EXPR if it is an overload set,
3385 and check that the resulting function has external linkage. */
3388 convert_nontype_argument_function (tree type, tree expr)
3393 fn = instantiate_type (type, fns, tf_none);
3394 if (fn == error_mark_node)
3395 return error_mark_node;
3398 if (TREE_CODE (fn_no_ptr) == ADDR_EXPR)
3399 fn_no_ptr = TREE_OPERAND (fn_no_ptr, 0);
3401 /* [temp.arg.nontype]/1
3403 A template-argument for a non-type, non-template template-parameter
3406 -- the address of an object or function with external linkage. */
3407 if (!DECL_EXTERNAL_LINKAGE_P (fn_no_ptr))
3409 error ("%qE is not a valid template argument for type %qT "
3410 "because function %qD has not external linkage",
3411 expr, type, fn_no_ptr);
3418 /* Attempt to convert the non-type template parameter EXPR to the
3419 indicated TYPE. If the conversion is successful, return the
3420 converted value. If the conversion is unsuccessful, return
3421 NULL_TREE if we issued an error message, or error_mark_node if we
3422 did not. We issue error messages for out-and-out bad template
3423 parameters, but not simply because the conversion failed, since we
3424 might be just trying to do argument deduction. Both TYPE and EXPR
3425 must be non-dependent.
3427 The conversion follows the special rules described in
3428 [temp.arg.nontype], and it is much more strict than an implicit
3431 This function is called twice for each template argument (see
3432 lookup_template_class for a more accurate description of this
3433 problem). This means that we need to handle expressions which
3434 are not valid in a C++ source, but can be created from the
3435 first call (for instance, casts to perform conversions). These
3436 hacks can go away after we fix the double coercion problem. */
3439 convert_nontype_argument (tree type, tree expr)
3443 /* Detect immediately string literals as invalid non-type argument.
3444 This special-case is not needed for correctness (we would easily
3445 catch this later), but only to provide better diagnostic for this
3446 common user mistake. As suggested by DR 100, we do not mention
3447 linkage issues in the diagnostic as this is not the point. */
3448 if (TREE_CODE (expr) == STRING_CST)
3450 error ("%qE is not a valid template argument for type %qT "
3451 "because string literals can never be used in this context",
3456 /* If we are in a template, EXPR may be non-dependent, but still
3457 have a syntactic, rather than semantic, form. For example, EXPR
3458 might be a SCOPE_REF, rather than the VAR_DECL to which the
3459 SCOPE_REF refers. Preserving the qualifying scope is necessary
3460 so that access checking can be performed when the template is
3461 instantiated -- but here we need the resolved form so that we can
3462 convert the argument. */
3463 expr = fold_non_dependent_expr (expr);
3464 expr_type = TREE_TYPE (expr);
3466 /* HACK: Due to double coercion, we can get a
3467 NOP_EXPR<REFERENCE_TYPE>(ADDR_EXPR<POINTER_TYPE> (arg)) here,
3468 which is the tree that we built on the first call (see
3469 below when coercing to reference to object or to reference to
3470 function). We just strip everything and get to the arg.
3471 See g++.old-deja/g++.oliva/template4.C and g++.dg/template/nontype9.C
3473 if (TREE_CODE (expr) == NOP_EXPR)
3475 if (TYPE_REF_OBJ_P (type) || TYPE_REFFN_P (type))
3477 /* ??? Maybe we could use convert_from_reference here, but we
3478 would need to relax its constraints because the NOP_EXPR
3479 could actually change the type to something more cv-qualified,
3480 and this is not folded by convert_from_reference. */
3481 tree addr = TREE_OPERAND (expr, 0);
3482 gcc_assert (TREE_CODE (expr_type) == REFERENCE_TYPE);
3483 gcc_assert (TREE_CODE (addr) == ADDR_EXPR);
3484 gcc_assert (TREE_CODE (TREE_TYPE (addr)) == POINTER_TYPE);
3485 gcc_assert (same_type_ignoring_top_level_qualifiers_p
3486 (TREE_TYPE (expr_type),
3487 TREE_TYPE (TREE_TYPE (addr))));
3489 expr = TREE_OPERAND (addr, 0);
3490 expr_type = TREE_TYPE (expr);
3493 /* We could also generate a NOP_EXPR(ADDR_EXPR()) when the
3494 parameter is a pointer to object, through decay and
3495 qualification conversion. Let's strip everything. */
3496 else if (TYPE_PTROBV_P (type))
3499 gcc_assert (TREE_CODE (expr) == ADDR_EXPR);
3500 gcc_assert (TREE_CODE (TREE_TYPE (expr)) == POINTER_TYPE);
3501 /* Skip the ADDR_EXPR only if it is part of the decay for
3502 an array. Otherwise, it is part of the original argument
3503 in the source code. */
3504 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (expr, 0))) == ARRAY_TYPE)
3505 expr = TREE_OPERAND (expr, 0);
3506 expr_type = TREE_TYPE (expr);
3510 /* [temp.arg.nontype]/5, bullet 1
3512 For a non-type template-parameter of integral or enumeration type,
3513 integral promotions (_conv.prom_) and integral conversions
3514 (_conv.integral_) are applied. */
3515 if (INTEGRAL_TYPE_P (type))
3517 if (!INTEGRAL_TYPE_P (expr_type))
3518 return error_mark_node;
3520 expr = fold_decl_constant_value (expr);
3521 /* Notice that there are constant expressions like '4 % 0' which
3522 do not fold into integer constants. */
3523 if (TREE_CODE (expr) != INTEGER_CST)
3525 error ("%qE is not a valid template argument for type %qT "
3526 "because it is a non-constant expression", expr, type);
3530 /* At this point, an implicit conversion does what we want,
3531 because we already know that the expression is of integral
3533 expr = ocp_convert (type, expr, CONV_IMPLICIT, LOOKUP_PROTECT);
3534 if (expr == error_mark_node)
3535 return error_mark_node;
3537 /* Conversion was allowed: fold it to a bare integer constant. */
3540 /* [temp.arg.nontype]/5, bullet 2
3542 For a non-type template-parameter of type pointer to object,
3543 qualification conversions (_conv.qual_) and the array-to-pointer
3544 conversion (_conv.array_) are applied. */
3545 else if (TYPE_PTROBV_P (type))
3547 /* [temp.arg.nontype]/1 (TC1 version, DR 49):
3549 A template-argument for a non-type, non-template template-parameter
3550 shall be one of: [...]
3552 -- the name of a non-type template-parameter;
3553 -- the address of an object or function with external linkage, [...]
3554 expressed as "& id-expression" where the & is optional if the name
3555 refers to a function or array, or if the corresponding
3556 template-parameter is a reference.
3558 Here, we do not care about functions, as they are invalid anyway
3559 for a parameter of type pointer-to-object. */
3560 bool constant_address_p =
3561 (TREE_CODE (expr) == ADDR_EXPR
3562 || TREE_CODE (expr_type) == ARRAY_TYPE
3563 || (DECL_P (expr) && DECL_TEMPLATE_PARM_P (expr)));
3565 expr = decay_conversion (expr);
3566 if (expr == error_mark_node)
3567 return error_mark_node;
3569 expr = perform_qualification_conversions (type, expr);
3570 if (expr == error_mark_node)
3571 return error_mark_node;
3573 if (!constant_address_p)
3575 error ("%qE is not a valid template argument for type %qT "
3576 "because it is not a constant pointer", expr, type);
3580 /* [temp.arg.nontype]/5, bullet 3
3582 For a non-type template-parameter of type reference to object, no
3583 conversions apply. The type referred to by the reference may be more
3584 cv-qualified than the (otherwise identical) type of the
3585 template-argument. The template-parameter is bound directly to the
3586 template-argument, which must be an lvalue. */
3587 else if (TYPE_REF_OBJ_P (type))
3589 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type),
3591 return error_mark_node;
3593 if (!at_least_as_qualified_p (TREE_TYPE (type), expr_type))
3595 error ("%qE is not a valid template argument for type %qT "
3596 "because of conflicts in cv-qualification", expr, type);
3600 if (!real_lvalue_p (expr))
3602 error ("%qE is not a valid template argument for type %qT "
3603 "because it is not a lvalue", expr, type);
3607 /* [temp.arg.nontype]/1
3609 A template-argument for a non-type, non-template template-parameter
3610 shall be one of: [...]
3612 -- the address of an object or function with external linkage. */
3613 if (!DECL_EXTERNAL_LINKAGE_P (expr))
3615 error ("%qE is not a valid template argument for type %qT "
3616 "because object %qD has not external linkage",
3621 expr = build_nop (type, build_address (expr));
3623 /* [temp.arg.nontype]/5, bullet 4
3625 For a non-type template-parameter of type pointer to function, only
3626 the function-to-pointer conversion (_conv.func_) is applied. If the
3627 template-argument represents a set of overloaded functions (or a
3628 pointer to such), the matching function is selected from the set
3630 else if (TYPE_PTRFN_P (type))
3632 /* If the argument is a template-id, we might not have enough
3633 context information to decay the pointer. */
3634 if (!type_unknown_p (expr_type))
3636 expr = decay_conversion (expr);
3637 if (expr == error_mark_node)
3638 return error_mark_node;
3641 expr = convert_nontype_argument_function (type, expr);
3642 if (!expr || expr == error_mark_node)
3645 /* [temp.arg.nontype]/5, bullet 5
3647 For a non-type template-parameter of type reference to function, no
3648 conversions apply. If the template-argument represents a set of
3649 overloaded functions, the matching function is selected from the set
3651 else if (TYPE_REFFN_P (type))
3653 if (TREE_CODE (expr) == ADDR_EXPR)
3655 error ("%qE is not a valid template argument for type %qT "
3656 "because it is a pointer", expr, type);
3657 inform ("try using %qE instead", TREE_OPERAND (expr, 0));
3661 expr = convert_nontype_argument_function (TREE_TYPE (type), expr);
3662 if (!expr || expr == error_mark_node)
3665 expr = build_nop (type, build_address (expr));
3667 /* [temp.arg.nontype]/5, bullet 6
3669 For a non-type template-parameter of type pointer to member function,
3670 no conversions apply. If the template-argument represents a set of
3671 overloaded member functions, the matching member function is selected
3672 from the set (_over.over_). */
3673 else if (TYPE_PTRMEMFUNC_P (type))
3675 expr = instantiate_type (type, expr, tf_none);
3676 if (expr == error_mark_node)
3677 return error_mark_node;
3679 /* There is no way to disable standard conversions in
3680 resolve_address_of_overloaded_function (called by
3681 instantiate_type). It is possible that the call succeeded by
3682 converting &B::I to &D::I (where B is a base of D), so we need
3683 to reject this conversion here.
3685 Actually, even if there was a way to disable standard conversions,
3686 it would still be better to reject them here so that we can
3687 provide a superior diagnostic. */
3688 if (!same_type_p (TREE_TYPE (expr), type))
3690 /* Make sure we are just one standard conversion off. */
3691 gcc_assert (can_convert (type, TREE_TYPE (expr)));
3692 error ("%qE is not a valid template argument for type %qT "
3693 "because it is of type %qT", expr, type,
3695 inform ("standard conversions are not allowed in this context");
3699 /* [temp.arg.nontype]/5, bullet 7
3701 For a non-type template-parameter of type pointer to data member,
3702 qualification conversions (_conv.qual_) are applied. */
3703 else if (TYPE_PTRMEM_P (type))
3705 expr = perform_qualification_conversions (type, expr);
3706 if (expr == error_mark_node)
3709 /* A template non-type parameter must be one of the above. */
3713 /* Sanity check: did we actually convert the argument to the
3715 gcc_assert (same_type_p (type, TREE_TYPE (expr)));
3720 /* Return 1 if PARM_PARMS and ARG_PARMS matches using rule for
3721 template template parameters. Both PARM_PARMS and ARG_PARMS are
3722 vectors of TREE_LIST nodes containing TYPE_DECL, TEMPLATE_DECL
3725 ARG_PARMS may contain more parameters than PARM_PARMS. If this is
3726 the case, then extra parameters must have default arguments.
3728 Consider the example:
3729 template <class T, class Allocator = allocator> class vector;
3730 template<template <class U> class TT> class C;
3732 C<vector> is a valid instantiation. PARM_PARMS for the above code
3733 contains a TYPE_DECL (for U), ARG_PARMS contains two TYPE_DECLs (for
3734 T and Allocator) and OUTER_ARGS contains the argument that is used to
3735 substitute the TT parameter. */
3738 coerce_template_template_parms (tree parm_parms,
3740 tsubst_flags_t complain,
3744 int nparms, nargs, i;
3747 gcc_assert (TREE_CODE (parm_parms) == TREE_VEC);
3748 gcc_assert (TREE_CODE (arg_parms) == TREE_VEC);
3750 nparms = TREE_VEC_LENGTH (parm_parms);
3751 nargs = TREE_VEC_LENGTH (arg_parms);
3753 /* The rule here is opposite of coerce_template_parms. */
3756 && TREE_PURPOSE (TREE_VEC_ELT (arg_parms, nparms)) == NULL_TREE))
3759 for (i = 0; i < nparms; ++i)
3761 parm = TREE_VALUE (TREE_VEC_ELT (parm_parms, i));
3762 arg = TREE_VALUE (TREE_VEC_ELT (arg_parms, i));
3764 if (arg == NULL_TREE || arg == error_mark_node
3765 || parm == NULL_TREE || parm == error_mark_node)
3768 if (TREE_CODE (arg) != TREE_CODE (parm))
3771 switch (TREE_CODE (parm))
3777 /* We encounter instantiations of templates like
3778 template <template <template <class> class> class TT>
3781 tree parmparm = DECL_INNERMOST_TEMPLATE_PARMS (parm);
3782 tree argparm = DECL_INNERMOST_TEMPLATE_PARMS (arg);
3784 if (!coerce_template_template_parms
3785 (parmparm, argparm, complain, in_decl, outer_args))
3791 /* The tsubst call is used to handle cases such as
3793 template <int> class C {};
3794 template <class T, template <T> class TT> class D {};
3797 i.e. the parameter list of TT depends on earlier parameters. */
3798 if (!dependent_type_p (TREE_TYPE (arg))
3800 (tsubst (TREE_TYPE (parm), outer_args, complain, in_decl),
3812 /* Convert the indicated template ARG as necessary to match the
3813 indicated template PARM. Returns the converted ARG, or
3814 error_mark_node if the conversion was unsuccessful. Error and
3815 warning messages are issued under control of COMPLAIN. This
3816 conversion is for the Ith parameter in the parameter list. ARGS is
3817 the full set of template arguments deduced so far. */
3820 convert_template_argument (tree parm,
3823 tsubst_flags_t complain,
3829 int is_type, requires_type, is_tmpl_type, requires_tmpl_type;
3831 inner_args = INNERMOST_TEMPLATE_ARGS (args);
3833 if (TREE_CODE (arg) == TREE_LIST
3834 && TREE_CODE (TREE_VALUE (arg)) == OFFSET_REF)
3836 /* The template argument was the name of some
3837 member function. That's usually
3838 invalid, but static members are OK. In any
3839 case, grab the underlying fields/functions
3840 and issue an error later if required. */
3841 arg = TREE_VALUE (arg);
3842 TREE_TYPE (arg) = unknown_type_node;
3845 requires_tmpl_type = TREE_CODE (parm) == TEMPLATE_DECL;
3846 requires_type = (TREE_CODE (parm) == TYPE_DECL
3847 || requires_tmpl_type);
3849 is_tmpl_type = ((TREE_CODE (arg) == TEMPLATE_DECL
3850 && TREE_CODE (DECL_TEMPLATE_RESULT (arg)) == TYPE_DECL)
3851 || TREE_CODE (arg) == TEMPLATE_TEMPLATE_PARM
3852 || TREE_CODE (arg) == UNBOUND_CLASS_TEMPLATE);
3855 && (TREE_CODE (arg) == TEMPLATE_TEMPLATE_PARM
3856 || TREE_CODE (arg) == UNBOUND_CLASS_TEMPLATE))
3857 arg = TYPE_STUB_DECL (arg);
3859 is_type = TYPE_P (arg) || is_tmpl_type;
3861 if (requires_type && ! is_type && TREE_CODE (arg) == SCOPE_REF
3862 && TREE_CODE (TREE_OPERAND (arg, 0)) == TEMPLATE_TYPE_PARM)
3864 pedwarn ("to refer to a type member of a template parameter, "
3865 "use %<typename %E%>", arg);
3867 arg = make_typename_type (TREE_OPERAND (arg, 0),
3868 TREE_OPERAND (arg, 1),
3870 complain & tf_error);
3873 if (is_type != requires_type)
3877 if (complain & tf_error)
3879 error ("type/value mismatch at argument %d in template "
3880 "parameter list for %qD",
3883 error (" expected a constant of type %qT, got %qT",
3885 (is_tmpl_type ? DECL_NAME (arg) : arg));
3886 else if (requires_tmpl_type)
3887 error (" expected a class template, got %qE", arg);
3889 error (" expected a type, got %qE", arg);
3892 return error_mark_node;
3894 if (is_tmpl_type ^ requires_tmpl_type)
3896 if (in_decl && (complain & tf_error))
3898 error ("type/value mismatch at argument %d in template "
3899 "parameter list for %qD",
3902 error (" expected a type, got %qT", DECL_NAME (arg));
3904 error (" expected a class template, got %qT", arg);
3906 return error_mark_node;
3911 if (requires_tmpl_type)
3913 if (TREE_CODE (TREE_TYPE (arg)) == UNBOUND_CLASS_TEMPLATE)
3914 /* The number of argument required is not known yet.
3915 Just accept it for now. */
3916 val = TREE_TYPE (arg);
3919 tree parmparm = DECL_INNERMOST_TEMPLATE_PARMS (parm);
3920 tree argparm = DECL_INNERMOST_TEMPLATE_PARMS (arg);
3922 if (coerce_template_template_parms (parmparm, argparm,
3928 /* TEMPLATE_TEMPLATE_PARM node is preferred over
3930 if (val != error_mark_node
3931 && DECL_TEMPLATE_TEMPLATE_PARM_P (val))
3932 val = TREE_TYPE (val);
3936 if (in_decl && (complain & tf_error))
3938 error ("type/value mismatch at argument %d in "
3939 "template parameter list for %qD",
3941 error (" expected a template of type %qD, got %qD",
3945 val = error_mark_node;
3951 /* We only form one instance of each template specialization.
3952 Therefore, if we use a non-canonical variant (i.e., a
3953 typedef), any future messages referring to the type will use
3954 the typedef, which is confusing if those future uses do not
3955 themselves also use the typedef. */
3957 val = canonical_type_variant (val);
3961 tree t = tsubst (TREE_TYPE (parm), args, complain, in_decl);
3963 if (invalid_nontype_parm_type_p (t, complain))
3964 return error_mark_node;
3966 if (!uses_template_parms (arg) && !uses_template_parms (t))
3967 /* We used to call digest_init here. However, digest_init
3968 will report errors, which we don't want when complain
3969 is zero. More importantly, digest_init will try too
3970 hard to convert things: for example, `0' should not be
3971 converted to pointer type at this point according to
3972 the standard. Accepting this is not merely an
3973 extension, since deciding whether or not these
3974 conversions can occur is part of determining which
3975 function template to call, or whether a given explicit
3976 argument specification is valid. */
3977 val = convert_nontype_argument (t, arg);
3981 if (val == NULL_TREE)
3982 val = error_mark_node;
3983 else if (val == error_mark_node && (complain & tf_error))
3984 error ("could not convert template argument %qE to %qT", arg, t);
3990 /* Convert all template arguments to their appropriate types, and
3991 return a vector containing the innermost resulting template
3992 arguments. If any error occurs, return error_mark_node. Error and
3993 warning messages are issued under control of COMPLAIN.
3995 If REQUIRE_ALL_ARGUMENTS is nonzero, all arguments must be
3996 provided in ARGLIST, or else trailing parameters must have default
3997 values. If REQUIRE_ALL_ARGUMENTS is zero, we will attempt argument
3998 deduction for any unspecified trailing arguments. */
4001 coerce_template_parms (tree parms,
4004 tsubst_flags_t complain,
4005 int require_all_arguments)
4007 int nparms, nargs, i, lost = 0;
4010 tree new_inner_args;
4012 inner_args = INNERMOST_TEMPLATE_ARGS (args);
4013 nargs = inner_args ? NUM_TMPL_ARGS (inner_args) : 0;
4014 nparms = TREE_VEC_LENGTH (parms);
4018 && require_all_arguments
4019 && TREE_PURPOSE (TREE_VEC_ELT (parms, nargs)) == NULL_TREE))
4021 if (complain & tf_error)
4023 error ("wrong number of template arguments (%d, should be %d)",
4027 error ("provided for %q+D", in_decl);
4030 return error_mark_node;
4033 new_inner_args = make_tree_vec (nparms);
4034 new_args = add_outermost_template_args (args, new_inner_args);
4035 for (i = 0; i < nparms; i++)
4040 /* Get the Ith template parameter. */
4041 parm = TREE_VEC_ELT (parms, i);
4043 /* Calculate the Ith argument. */
4045 arg = TREE_VEC_ELT (inner_args, i);
4046 else if (require_all_arguments)
4047 /* There must be a default arg in this case. */
4048 arg = tsubst_template_arg (TREE_PURPOSE (parm), new_args,
4054 if (arg == error_mark_node)
4056 if (complain & tf_error)
4057 error ("template argument %d is invalid", i + 1);
4060 arg = convert_template_argument (TREE_VALUE (parm),
4061 arg, new_args, complain, i,
4064 if (arg == error_mark_node)
4066 TREE_VEC_ELT (new_inner_args, i) = arg;
4070 return error_mark_node;
4072 return new_inner_args;
4075 /* Returns 1 if template args OT and NT are equivalent. */
4078 template_args_equal (tree ot, tree nt)
4083 if (TREE_CODE (nt) == TREE_VEC)
4084 /* For member templates */
4085 return TREE_CODE (ot) == TREE_VEC && comp_template_args (ot, nt);
4086 else if (TYPE_P (nt))
4087 return TYPE_P (ot) && same_type_p (ot, nt);
4088 else if (TREE_CODE (ot) == TREE_VEC || TYPE_P (ot))
4091 return cp_tree_equal (ot, nt);
4094 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets
4095 of template arguments. Returns 0 otherwise. */
4098 comp_template_args (tree oldargs, tree newargs)
4102 if (TREE_VEC_LENGTH (oldargs) != TREE_VEC_LENGTH (newargs))
4105 for (i = 0; i < TREE_VEC_LENGTH (oldargs); ++i)
4107 tree nt = TREE_VEC_ELT (newargs, i);
4108 tree ot = TREE_VEC_ELT (oldargs, i);
4110 if (! template_args_equal (ot, nt))
4116 /* Given class template name and parameter list, produce a user-friendly name
4117 for the instantiation. */
4120 mangle_class_name_for_template (const char* name, tree parms, tree arglist)
4122 static struct obstack scratch_obstack;
4123 static char *scratch_firstobj;
4126 if (!scratch_firstobj)
4127 gcc_obstack_init (&scratch_obstack);
4129 obstack_free (&scratch_obstack, scratch_firstobj);
4130 scratch_firstobj = obstack_alloc (&scratch_obstack, 1);
4132 #define ccat(C) obstack_1grow (&scratch_obstack, (C));
4133 #define cat(S) obstack_grow (&scratch_obstack, (S), strlen (S))
4137 nparms = TREE_VEC_LENGTH (parms);
4138 arglist = INNERMOST_TEMPLATE_ARGS (arglist);
4139 gcc_assert (nparms == TREE_VEC_LENGTH (arglist));
4140 for (i = 0; i < nparms; i++)
4142 tree parm = TREE_VALUE (TREE_VEC_ELT (parms, i));
4143 tree arg = TREE_VEC_ELT (arglist, i);
4148 if (TREE_CODE (parm) == TYPE_DECL)
4150 cat (type_as_string (arg, TFF_CHASE_TYPEDEF));
4153 else if (TREE_CODE (parm) == TEMPLATE_DECL)
4155 if (TREE_CODE (arg) == TEMPLATE_DECL)
4157 /* Already substituted with real template. Just output
4158 the template name here */
4159 tree context = DECL_CONTEXT (arg);
4162 /* The template may be defined in a namespace, or
4163 may be a member template. */
4164 gcc_assert (TREE_CODE (context) == NAMESPACE_DECL
4165 || CLASS_TYPE_P (context));
4166 cat (decl_as_string (DECL_CONTEXT (arg),
4167 TFF_PLAIN_IDENTIFIER));
4170 cat (IDENTIFIER_POINTER (DECL_NAME (arg)));
4173 /* Output the parameter declaration. */
4174 cat (type_as_string (arg, TFF_CHASE_TYPEDEF));
4178 gcc_assert (TREE_CODE (parm) == PARM_DECL);
4180 /* No need to check arglist against parmlist here; we did that
4181 in coerce_template_parms, called from lookup_template_class. */
4182 cat (expr_as_string (arg, TFF_PLAIN_IDENTIFIER));
4185 char *bufp = obstack_next_free (&scratch_obstack);
4187 while (bufp[offset - 1] == ' ')
4189 obstack_blank_fast (&scratch_obstack, offset);
4191 /* B<C<char> >, not B<C<char>> */
4192 if (bufp[offset - 1] == '>')
4197 return (char *) obstack_base (&scratch_obstack);
4201 classtype_mangled_name (tree t)
4203 if (CLASSTYPE_TEMPLATE_INFO (t)
4204 /* Specializations have already had their names set up in
4205 lookup_template_class. */
4206 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (t))
4208 tree tmpl = most_general_template (CLASSTYPE_TI_TEMPLATE (t));
4210 /* For non-primary templates, the template parameters are
4211 implicit from their surrounding context. */
4212 if (PRIMARY_TEMPLATE_P (tmpl))
4214 tree name = DECL_NAME (tmpl);
4215 char *mangled_name = mangle_class_name_for_template
4216 (IDENTIFIER_POINTER (name),
4217 DECL_INNERMOST_TEMPLATE_PARMS (tmpl),
4218 CLASSTYPE_TI_ARGS (t));
4219 tree id = get_identifier (mangled_name);
4220 IDENTIFIER_TEMPLATE (id) = name;
4225 return TYPE_IDENTIFIER (t);
4229 add_pending_template (tree d)
4231 tree ti = (TYPE_P (d)
4232 ? CLASSTYPE_TEMPLATE_INFO (d)
4233 : DECL_TEMPLATE_INFO (d));
4237 if (TI_PENDING_TEMPLATE_FLAG (ti))
4240 /* We are called both from instantiate_decl, where we've already had a
4241 tinst_level pushed, and instantiate_template, where we haven't.
4243 level = !(current_tinst_level && TINST_DECL (current_tinst_level) == d);
4246 push_tinst_level (d);
4248 pt = tree_cons (current_tinst_level, d, NULL_TREE);
4249 if (last_pending_template)
4250 TREE_CHAIN (last_pending_template) = pt;
4252 pending_templates = pt;
4254 last_pending_template = pt;
4256 TI_PENDING_TEMPLATE_FLAG (ti) = 1;
4263 /* Return a TEMPLATE_ID_EXPR corresponding to the indicated FNS and
4264 ARGLIST. Valid choices for FNS are given in the cp-tree.def
4265 documentation for TEMPLATE_ID_EXPR. */
4268 lookup_template_function (tree fns, tree arglist)
4272 if (fns == error_mark_node || arglist == error_mark_node)
4273 return error_mark_node;
4275 gcc_assert (!arglist || TREE_CODE (arglist) == TREE_VEC);
4276 gcc_assert (fns && (is_overloaded_fn (fns)
4277 || TREE_CODE (fns) == IDENTIFIER_NODE));
4279 if (BASELINK_P (fns))
4281 BASELINK_FUNCTIONS (fns) = build2 (TEMPLATE_ID_EXPR,
4283 BASELINK_FUNCTIONS (fns),
4288 type = TREE_TYPE (fns);
4289 if (TREE_CODE (fns) == OVERLOAD || !type)
4290 type = unknown_type_node;
4292 return build2 (TEMPLATE_ID_EXPR, type, fns, arglist);
4295 /* Within the scope of a template class S<T>, the name S gets bound
4296 (in build_self_reference) to a TYPE_DECL for the class, not a
4297 TEMPLATE_DECL. If DECL is a TYPE_DECL for current_class_type,
4298 or one of its enclosing classes, and that type is a template,
4299 return the associated TEMPLATE_DECL. Otherwise, the original
4300 DECL is returned. */
4303 maybe_get_template_decl_from_type_decl (tree decl)
4305 return (decl != NULL_TREE
4306 && TREE_CODE (decl) == TYPE_DECL
4307 && DECL_ARTIFICIAL (decl)
4308 && CLASS_TYPE_P (TREE_TYPE (decl))
4309 && CLASSTYPE_TEMPLATE_INFO (TREE_TYPE (decl)))
4310 ? CLASSTYPE_TI_TEMPLATE (TREE_TYPE (decl)) : decl;
4313 /* Given an IDENTIFIER_NODE (type TEMPLATE_DECL) and a chain of
4314 parameters, find the desired type.
4316 D1 is the PTYPENAME terminal, and ARGLIST is the list of arguments.
4318 IN_DECL, if non-NULL, is the template declaration we are trying to
4321 If ENTERING_SCOPE is nonzero, we are about to enter the scope of
4322 the class we are looking up.
4324 Issue error and warning messages under control of COMPLAIN.
4326 If the template class is really a local class in a template
4327 function, then the FUNCTION_CONTEXT is the function in which it is
4330 ??? Note that this function is currently called *twice* for each
4331 template-id: the first time from the parser, while creating the
4332 incomplete type (finish_template_type), and the second type during the
4333 real instantiation (instantiate_template_class). This is surely something
4334 that we want to avoid. It also causes some problems with argument
4335 coercion (see convert_nontype_argument for more information on this). */
4338 lookup_template_class (tree d1,
4343 tsubst_flags_t complain)
4345 tree template = NULL_TREE, parmlist;
4348 timevar_push (TV_NAME_LOOKUP);
4350 if (TREE_CODE (d1) == IDENTIFIER_NODE)
4352 tree value = innermost_non_namespace_value (d1);
4353 if (value && DECL_TEMPLATE_TEMPLATE_PARM_P (value))
4358 push_decl_namespace (context);
4359 template = lookup_name (d1, /*prefer_type=*/0);
4360 template = maybe_get_template_decl_from_type_decl (template);
4362 pop_decl_namespace ();
4365 context = DECL_CONTEXT (template);
4367 else if (TREE_CODE (d1) == TYPE_DECL && IS_AGGR_TYPE (TREE_TYPE (d1)))
4369 tree type = TREE_TYPE (d1);
4371 /* If we are declaring a constructor, say A<T>::A<T>, we will get
4372 an implicit typename for the second A. Deal with it. */
4373 if (TREE_CODE (type) == TYPENAME_TYPE && TREE_TYPE (type))
4374 type = TREE_TYPE (type);
4376 if (CLASSTYPE_TEMPLATE_INFO (type))
4378 template = CLASSTYPE_TI_TEMPLATE (type);
4379 d1 = DECL_NAME (template);
4382 else if (TREE_CODE (d1) == ENUMERAL_TYPE
4383 || (TYPE_P (d1) && IS_AGGR_TYPE (d1)))
4385 template = TYPE_TI_TEMPLATE (d1);
4386 d1 = DECL_NAME (template);
4388 else if (TREE_CODE (d1) == TEMPLATE_DECL
4389 && TREE_CODE (DECL_TEMPLATE_RESULT (d1)) == TYPE_DECL)
4392 d1 = DECL_NAME (template);
4393 context = DECL_CONTEXT (template);
4396 /* Issue an error message if we didn't find a template. */
4399 if (complain & tf_error)
4400 error ("%qT is not a template", d1);
4401 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node);
4404 if (TREE_CODE (template) != TEMPLATE_DECL
4405 /* Make sure it's a user visible template, if it was named by
4407 || ((complain & tf_user) && !DECL_TEMPLATE_PARM_P (template)
4408 && !PRIMARY_TEMPLATE_P (template)))
4410 if (complain & tf_error)
4412 error ("non-template type %qT used as a template", d1);
4414 error ("for template declaration %q+D", in_decl);
4416 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node);
4419 complain &= ~tf_user;
4421 if (DECL_TEMPLATE_TEMPLATE_PARM_P (template))
4423 /* Create a new TEMPLATE_DECL and TEMPLATE_TEMPLATE_PARM node to store
4424 template arguments */
4429 parmlist = DECL_INNERMOST_TEMPLATE_PARMS (template);
4431 /* Consider an example where a template template parameter declared as
4433 template <class T, class U = std::allocator<T> > class TT
4435 The template parameter level of T and U are one level larger than
4436 of TT. To proper process the default argument of U, say when an
4437 instantiation `TT<int>' is seen, we need to build the full
4438 arguments containing {int} as the innermost level. Outer levels,
4439 available when not appearing as default template argument, can be
4440 obtained from `current_template_args ()'.
4442 Suppose that TT is later substituted with std::vector. The above
4443 instantiation is `TT<int, std::allocator<T> >' with TT at
4444 level 1, and T at level 2, while the template arguments at level 1
4445 becomes {std::vector} and the inner level 2 is {int}. */
4447 if (current_template_parms)
4448 arglist = add_to_template_args (current_template_args (), arglist);
4450 arglist2 = coerce_template_parms (parmlist, arglist, template,
4451 complain, /*require_all_args=*/1);
4452 if (arglist2 == error_mark_node
4453 || (!uses_template_parms (arglist2)
4454 && check_instantiated_args (template, arglist2, complain)))
4455 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node);
4457 parm = bind_template_template_parm (TREE_TYPE (template), arglist2);
4458 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, parm);
4462 tree template_type = TREE_TYPE (template);
4465 tree found = NULL_TREE;
4468 int is_partial_instantiation;
4470 gen_tmpl = most_general_template (template);
4471 parmlist = DECL_TEMPLATE_PARMS (gen_tmpl);
4472 parm_depth = TMPL_PARMS_DEPTH (parmlist);
4473 arg_depth = TMPL_ARGS_DEPTH (arglist);
4475 if (arg_depth == 1 && parm_depth > 1)
4477 /* We've been given an incomplete set of template arguments.
4480 template <class T> struct S1 {
4481 template <class U> struct S2 {};
4482 template <class U> struct S2<U*> {};
4485 we will be called with an ARGLIST of `U*', but the
4486 TEMPLATE will be `template <class T> template
4487 <class U> struct S1<T>::S2'. We must fill in the missing
4490 = add_outermost_template_args (TYPE_TI_ARGS (TREE_TYPE (template)),
4492 arg_depth = TMPL_ARGS_DEPTH (arglist);
4495 /* Now we should have enough arguments. */
4496 gcc_assert (parm_depth == arg_depth);
4498 /* From here on, we're only interested in the most general
4500 template = gen_tmpl;
4502 /* Calculate the BOUND_ARGS. These will be the args that are
4503 actually tsubst'd into the definition to create the
4507 /* We have multiple levels of arguments to coerce, at once. */
4509 int saved_depth = TMPL_ARGS_DEPTH (arglist);
4511 tree bound_args = make_tree_vec (parm_depth);
4513 for (i = saved_depth,
4514 t = DECL_TEMPLATE_PARMS (template);
4515 i > 0 && t != NULL_TREE;
4516 --i, t = TREE_CHAIN (t))
4518 tree a = coerce_template_parms (TREE_VALUE (t),
4520 complain, /*require_all_args=*/1);
4522 /* Don't process further if one of the levels fails. */
4523 if (a == error_mark_node)
4525 /* Restore the ARGLIST to its full size. */
4526 TREE_VEC_LENGTH (arglist) = saved_depth;
4527 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node);
4530 SET_TMPL_ARGS_LEVEL (bound_args, i, a);
4532 /* We temporarily reduce the length of the ARGLIST so
4533 that coerce_template_parms will see only the arguments
4534 corresponding to the template parameters it is
4536 TREE_VEC_LENGTH (arglist)--;
4539 /* Restore the ARGLIST to its full size. */
4540 TREE_VEC_LENGTH (arglist) = saved_depth;
4542 arglist = bound_args;
4546 = coerce_template_parms (INNERMOST_TEMPLATE_PARMS (parmlist),
4547 INNERMOST_TEMPLATE_ARGS (arglist),
4549 complain, /*require_all_args=*/1);
4551 if (arglist == error_mark_node)
4552 /* We were unable to bind the arguments. */
4553 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node);
4555 /* In the scope of a template class, explicit references to the
4556 template class refer to the type of the template, not any
4557 instantiation of it. For example, in:
4559 template <class T> class C { void f(C<T>); }
4561 the `C<T>' is just the same as `C'. Outside of the
4562 class, however, such a reference is an instantiation. */
4563 if (comp_template_args (TYPE_TI_ARGS (template_type),
4566 found = template_type;
4568 if (!entering_scope && PRIMARY_TEMPLATE_P (template))
4572 for (ctx = current_class_type;
4573 ctx && TREE_CODE (ctx) != NAMESPACE_DECL;
4575 ? TYPE_CONTEXT (ctx)
4576 : DECL_CONTEXT (ctx)))
4577 if (TYPE_P (ctx) && same_type_p (ctx, template_type))
4580 /* We're not in the scope of the class, so the
4581 TEMPLATE_TYPE is not the type we want after all. */
4587 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, found);
4589 /* If we already have this specialization, return it. */
4590 found = retrieve_specialization (template, arglist,
4591 /*class_specializations_p=*/false);
4593 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, found);
4595 /* This type is a "partial instantiation" if any of the template
4596 arguments still involve template parameters. Note that we set
4597 IS_PARTIAL_INSTANTIATION for partial specializations as
4599 is_partial_instantiation = uses_template_parms (arglist);
4601 /* If the deduced arguments are invalid, then the binding
4603 if (!is_partial_instantiation
4604 && check_instantiated_args (template,
4605 INNERMOST_TEMPLATE_ARGS (arglist),
4607 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node);
4609 if (!is_partial_instantiation
4610 && !PRIMARY_TEMPLATE_P (template)
4611 && TREE_CODE (CP_DECL_CONTEXT (template)) == NAMESPACE_DECL)
4613 found = xref_tag_from_type (TREE_TYPE (template),
4614 DECL_NAME (template),
4615 /*tag_scope=*/ts_global);
4616 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, found);
4619 context = tsubst (DECL_CONTEXT (template), arglist,
4622 context = global_namespace;
4624 /* Create the type. */
4625 if (TREE_CODE (template_type) == ENUMERAL_TYPE)
4627 if (!is_partial_instantiation)
4629 set_current_access_from_decl (TYPE_NAME (template_type));
4630 t = start_enum (TYPE_IDENTIFIER (template_type));
4633 /* We don't want to call start_enum for this type, since
4634 the values for the enumeration constants may involve
4635 template parameters. And, no one should be interested
4636 in the enumeration constants for such a type. */
4637 t = make_node (ENUMERAL_TYPE);
4641 t = make_aggr_type (TREE_CODE (template_type));
4642 CLASSTYPE_DECLARED_CLASS (t)
4643 = CLASSTYPE_DECLARED_CLASS (template_type);
4644 SET_CLASSTYPE_IMPLICIT_INSTANTIATION (t);
4645 TYPE_FOR_JAVA (t) = TYPE_FOR_JAVA (template_type);
4647 /* A local class. Make sure the decl gets registered properly. */
4648 if (context == current_function_decl)
4649 pushtag (DECL_NAME (template), t, /*tag_scope=*/ts_current);
4652 /* If we called start_enum or pushtag above, this information
4653 will already be set up. */
4656 TYPE_CONTEXT (t) = FROB_CONTEXT (context);
4658 type_decl = create_implicit_typedef (DECL_NAME (template), t);
4659 DECL_CONTEXT (type_decl) = TYPE_CONTEXT (t);
4660 TYPE_STUB_DECL (t) = type_decl;
4661 DECL_SOURCE_LOCATION (type_decl)
4662 = DECL_SOURCE_LOCATION (TYPE_STUB_DECL (template_type));
4665 type_decl = TYPE_NAME (t);
4667 TREE_PRIVATE (type_decl)
4668 = TREE_PRIVATE (TYPE_STUB_DECL (template_type));
4669 TREE_PROTECTED (type_decl)
4670 = TREE_PROTECTED (TYPE_STUB_DECL (template_type));
4671 DECL_IN_SYSTEM_HEADER (type_decl)
4672 = DECL_IN_SYSTEM_HEADER (template);
4673 if (CLASSTYPE_VISIBILITY_SPECIFIED (template_type))
4675 DECL_VISIBILITY_SPECIFIED (type_decl) = 1;
4676 DECL_VISIBILITY (type_decl) = CLASSTYPE_VISIBILITY (template_type);
4679 /* Set up the template information. We have to figure out which
4680 template is the immediate parent if this is a full
4682 if (parm_depth == 1 || is_partial_instantiation
4683 || !PRIMARY_TEMPLATE_P (template))
4684 /* This case is easy; there are no member templates involved. */
4688 /* This is a full instantiation of a member template. Look
4689 for a partial instantiation of which this is an instance. */
4691 for (found = DECL_TEMPLATE_INSTANTIATIONS (template);
4692 found; found = TREE_CHAIN (found))
4695 tree tmpl = CLASSTYPE_TI_TEMPLATE (TREE_VALUE (found));
4697 /* We only want partial instantiations, here, not
4698 specializations or full instantiations. */
4699 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_VALUE (found))
4700 || !uses_template_parms (TREE_VALUE (found)))
4703 /* Temporarily reduce by one the number of levels in the
4704 ARGLIST and in FOUND so as to avoid comparing the
4705 last set of arguments. */
4706 TREE_VEC_LENGTH (arglist)--;
4707 TREE_VEC_LENGTH (TREE_PURPOSE (found)) --;
4709 /* See if the arguments match. If they do, then TMPL is
4710 the partial instantiation we want. */
4711 success = comp_template_args (TREE_PURPOSE (found), arglist);
4713 /* Restore the argument vectors to their full size. */
4714 TREE_VEC_LENGTH (arglist)++;
4715 TREE_VEC_LENGTH (TREE_PURPOSE (found))++;
4726 /* There was no partial instantiation. This happens
4727 where C<T> is a member template of A<T> and it's used
4730 template <typename T> struct B { A<T>::C<int> m; };
4733 Create the partial instantiation.
4735 TREE_VEC_LENGTH (arglist)--;
4736 found = tsubst (template, arglist, complain, NULL_TREE);
4737 TREE_VEC_LENGTH (arglist)++;
4741 SET_TYPE_TEMPLATE_INFO (t, tree_cons (found, arglist, NULL_TREE));
4742 DECL_TEMPLATE_INSTANTIATIONS (template)
4743 = tree_cons (arglist, t,
4744 DECL_TEMPLATE_INSTANTIATIONS (template));
4746 if (TREE_CODE (t) == ENUMERAL_TYPE
4747 && !is_partial_instantiation)
4748 /* Now that the type has been registered on the instantiations
4749 list, we set up the enumerators. Because the enumeration
4750 constants may involve the enumeration type itself, we make
4751 sure to register the type first, and then create the
4752 constants. That way, doing tsubst_expr for the enumeration
4753 constants won't result in recursive calls here; we'll find
4754 the instantiation and exit above. */
4755 tsubst_enum (template_type, t, arglist);
4757 /* Reset the name of the type, now that CLASSTYPE_TEMPLATE_INFO
4759 if (TREE_CODE (t) != ENUMERAL_TYPE)
4760 DECL_NAME (type_decl) = classtype_mangled_name (t);
4761 if (is_partial_instantiation)
4762 /* If the type makes use of template parameters, the
4763 code that generates debugging information will crash. */
4764 DECL_IGNORED_P (TYPE_STUB_DECL (t)) = 1;
4766 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, t);
4768 timevar_pop (TV_NAME_LOOKUP);
4775 struct pointer_set_t *visited;
4778 /* Called from for_each_template_parm via walk_tree. */
4781 for_each_template_parm_r (tree *tp, int *walk_subtrees, void *d)
4784 struct pair_fn_data *pfd = (struct pair_fn_data *) d;
4785 tree_fn_t fn = pfd->fn;
4786 void *data = pfd->data;
4789 && for_each_template_parm (TYPE_CONTEXT (t), fn, data, pfd->visited))
4790 return error_mark_node;
4792 switch (TREE_CODE (t))
4795 if (TYPE_PTRMEMFUNC_P (t))
4801 if (!TYPE_TEMPLATE_INFO (t))
4803 else if (for_each_template_parm (TREE_VALUE (TYPE_TEMPLATE_INFO (t)),
4804 fn, data, pfd->visited))
4805 return error_mark_node;
4809 /* Since we're not going to walk subtrees, we have to do this
4811 if (for_each_template_parm (TYPE_METHOD_BASETYPE (t), fn, data,
4813 return error_mark_node;
4817 /* Check the return type. */
4818 if (for_each_template_parm (TREE_TYPE (t), fn, data, pfd->visited))
4819 return error_mark_node;
4821 /* Check the parameter types. Since default arguments are not
4822 instantiated until they are needed, the TYPE_ARG_TYPES may
4823 contain expressions that involve template parameters. But,
4824 no-one should be looking at them yet. And, once they're
4825 instantiated, they don't contain template parameters, so
4826 there's no point in looking at them then, either. */
4830 for (parm = TYPE_ARG_TYPES (t); parm; parm = TREE_CHAIN (parm))
4831 if (for_each_template_parm (TREE_VALUE (parm), fn, data,
4833 return error_mark_node;
4835 /* Since we've already handled the TYPE_ARG_TYPES, we don't
4836 want walk_tree walking into them itself. */
4842 if (for_each_template_parm (TYPE_FIELDS (t), fn, data,
4844 return error_mark_node;
4849 if (DECL_LANG_SPECIFIC (t) && DECL_TEMPLATE_INFO (t)
4850 && for_each_template_parm (DECL_TI_ARGS (t), fn, data,
4852 return error_mark_node;
4857 if (TREE_CODE (t) == CONST_DECL && DECL_TEMPLATE_PARM_P (t)
4858 && for_each_template_parm (DECL_INITIAL (t), fn, data,
4860 return error_mark_node;
4861 if (DECL_CONTEXT (t)
4862 && for_each_template_parm (DECL_CONTEXT (t), fn, data,
4864 return error_mark_node;
4867 case BOUND_TEMPLATE_TEMPLATE_PARM:
4868 /* Record template parameters such as `T' inside `TT<T>'. */
4869 if (for_each_template_parm (TYPE_TI_ARGS (t), fn, data, pfd->visited))
4870 return error_mark_node;
4873 case TEMPLATE_TEMPLATE_PARM:
4874 case TEMPLATE_TYPE_PARM:
4875 case TEMPLATE_PARM_INDEX:
4876 if (fn && (*fn)(t, data))
4877 return error_mark_node;
4879 return error_mark_node;
4883 /* A template template parameter is encountered. */
4884 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t)
4885 && for_each_template_parm (TREE_TYPE (t), fn, data, pfd->visited))
4886 return error_mark_node;
4888 /* Already substituted template template parameter */
4894 || for_each_template_parm (TYPENAME_TYPE_FULLNAME (t), fn,
4895 data, pfd->visited))
4896 return error_mark_node;
4900 if (TREE_TYPE (t) && TYPE_PTRMEMFUNC_P (TREE_TYPE (t))
4901 && for_each_template_parm (TYPE_PTRMEMFUNC_FN_TYPE
4902 (TREE_TYPE (t)), fn, data,
4904 return error_mark_node;
4909 /* If there's no type, then this thing must be some expression
4910 involving template parameters. */
4911 if (!fn && !TREE_TYPE (t))
4912 return error_mark_node;
4917 case REINTERPRET_CAST_EXPR:
4918 case CONST_CAST_EXPR:
4919 case STATIC_CAST_EXPR:
4920 case DYNAMIC_CAST_EXPR:
4924 case PSEUDO_DTOR_EXPR:
4926 return error_mark_node;
4930 /* If we do not handle this case specially, we end up walking
4931 the BINFO hierarchy, which is circular, and therefore
4932 confuses walk_tree. */
4934 if (for_each_template_parm (BASELINK_FUNCTIONS (*tp), fn, data,
4936 return error_mark_node;
4943 /* We didn't find any template parameters we liked. */
4947 /* For each TEMPLATE_TYPE_PARM, TEMPLATE_TEMPLATE_PARM,
4948 BOUND_TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX in T,
4949 call FN with the parameter and the DATA.
4950 If FN returns nonzero, the iteration is terminated, and
4951 for_each_template_parm returns 1. Otherwise, the iteration
4952 continues. If FN never returns a nonzero value, the value
4953 returned by for_each_template_parm is 0. If FN is NULL, it is
4954 considered to be the function which always returns 1. */
4957 for_each_template_parm (tree t, tree_fn_t fn, void* data,
4958 struct pointer_set_t *visited)
4960 struct pair_fn_data pfd;
4967 /* Walk the tree. (Conceptually, we would like to walk without
4968 duplicates, but for_each_template_parm_r recursively calls
4969 for_each_template_parm, so we would need to reorganize a fair
4970 bit to use walk_tree_without_duplicates, so we keep our own
4973 pfd.visited = visited;
4975 pfd.visited = pointer_set_create ();
4976 result = walk_tree (&t,
4977 for_each_template_parm_r,
4979 pfd.visited) != NULL_TREE;
4984 pointer_set_destroy (pfd.visited);
4991 /* Returns true if T depends on any template parameter. */
4994 uses_template_parms (tree t)
4997 int saved_processing_template_decl;
4999 saved_processing_template_decl = processing_template_decl;
5000 if (!saved_processing_template_decl)
5001 processing_template_decl = 1;
5003 dependent_p = dependent_type_p (t);
5004 else if (TREE_CODE (t) == TREE_VEC)
5005 dependent_p = any_dependent_template_arguments_p (t);
5006 else if (TREE_CODE (t) == TREE_LIST)
5007 dependent_p = (uses_template_parms (TREE_VALUE (t))
5008 || uses_template_parms (TREE_CHAIN (t)));
5009 else if (TREE_CODE (t) == TYPE_DECL)
5010 dependent_p = dependent_type_p (TREE_TYPE (t));
5013 || TREE_CODE (t) == TEMPLATE_PARM_INDEX
5014 || TREE_CODE (t) == OVERLOAD
5015 || TREE_CODE (t) == BASELINK
5016 || TREE_CODE (t) == IDENTIFIER_NODE
5017 || CONSTANT_CLASS_P (t))
5018 dependent_p = (type_dependent_expression_p (t)
5019 || value_dependent_expression_p (t));
5022 gcc_assert (t == error_mark_node);
5023 dependent_p = false;
5026 processing_template_decl = saved_processing_template_decl;
5031 /* Returns true if T depends on any template parameter with level LEVEL. */
5034 uses_template_parms_level (tree t, int level)
5036 return for_each_template_parm (t, template_parm_this_level_p, &level, NULL);
5039 static int tinst_depth;
5040 extern int max_tinst_depth;
5041 #ifdef GATHER_STATISTICS
5044 static int tinst_level_tick;
5045 static int last_template_error_tick;
5047 /* We're starting to instantiate D; record the template instantiation context
5048 for diagnostics and to restore it later. */
5051 push_tinst_level (tree d)
5055 if (tinst_depth >= max_tinst_depth)
5057 /* If the instantiation in question still has unbound template parms,
5058 we don't really care if we can't instantiate it, so just return.
5059 This happens with base instantiation for implicit `typename'. */
5060 if (uses_template_parms (d))
5063 last_template_error_tick = tinst_level_tick;
5064 error ("template instantiation depth exceeds maximum of %d (use "
5065 "-ftemplate-depth-NN to increase the maximum) instantiating %qD",
5066 max_tinst_depth, d);
5068 print_instantiation_context ();
5073 new = make_node (TINST_LEVEL);
5074 TINST_DECL (new) = d;
5075 TINST_LOCATION (new) = input_location;
5076 TINST_IN_SYSTEM_HEADER_P (new) = in_system_header;
5077 TREE_CHAIN (new) = current_tinst_level;
5078 current_tinst_level = new;
5081 #ifdef GATHER_STATISTICS
5082 if (tinst_depth > depth_reached)
5083 depth_reached = tinst_depth;
5090 /* We're done instantiating this template; return to the instantiation
5094 pop_tinst_level (void)
5096 tree old = current_tinst_level;
5098 /* Restore the filename and line number stashed away when we started
5099 this instantiation. */
5100 input_location = TINST_LOCATION (old);
5101 in_system_header = TINST_IN_SYSTEM_HEADER_P (old);
5102 current_tinst_level = TREE_CHAIN (old);
5107 /* We're instantiating a deferred template; restore the template
5108 instantiation context in which the instantiation was requested, which
5109 is one step out from LEVEL. */
5112 reopen_tinst_level (tree level)
5117 for (t = level; t; t = TREE_CHAIN (t))
5120 current_tinst_level = level;
5124 /* DECL is a friend FUNCTION_DECL or TEMPLATE_DECL. ARGS is the
5125 vector of template arguments, as for tsubst.
5127 Returns an appropriate tsubst'd friend declaration. */
5130 tsubst_friend_function (tree decl, tree args)
5134 if (TREE_CODE (decl) == FUNCTION_DECL
5135 && DECL_TEMPLATE_INSTANTIATION (decl)
5136 && TREE_CODE (DECL_TI_TEMPLATE (decl)) != TEMPLATE_DECL)
5137 /* This was a friend declared with an explicit template
5138 argument list, e.g.:
5142 to indicate that f was a template instantiation, not a new
5143 function declaration. Now, we have to figure out what
5144 instantiation of what template. */
5146 tree template_id, arglist, fns;
5149 tree ns = decl_namespace_context (TYPE_MAIN_DECL (current_class_type));
5151 /* Friend functions are looked up in the containing namespace scope.
5152 We must enter that scope, to avoid finding member functions of the
5153 current cless with same name. */
5154 push_nested_namespace (ns);
5155 fns = tsubst_expr (DECL_TI_TEMPLATE (decl), args,
5156 tf_error | tf_warning, NULL_TREE);
5157 pop_nested_namespace (ns);
5158 arglist = tsubst (DECL_TI_ARGS (decl), args,
5159 tf_error | tf_warning, NULL_TREE);
5160 template_id = lookup_template_function (fns, arglist);
5162 new_friend = tsubst (decl, args, tf_error | tf_warning, NULL_TREE);
5163 tmpl = determine_specialization (template_id, new_friend,
5165 /*need_member_template=*/0,
5166 TREE_VEC_LENGTH (args));
5167 return instantiate_template (tmpl, new_args, tf_error);
5170 new_friend = tsubst (decl, args, tf_error | tf_warning, NULL_TREE);
5172 /* The NEW_FRIEND will look like an instantiation, to the
5173 compiler, but is not an instantiation from the point of view of
5174 the language. For example, we might have had:
5176 template <class T> struct S {
5177 template <class U> friend void f(T, U);
5180 Then, in S<int>, template <class U> void f(int, U) is not an
5181 instantiation of anything. */
5182 if (new_friend == error_mark_node)
5183 return error_mark_node;
5185 DECL_USE_TEMPLATE (new_friend) = 0;
5186 if (TREE_CODE (decl) == TEMPLATE_DECL)
5188 DECL_USE_TEMPLATE (DECL_TEMPLATE_RESULT (new_friend)) = 0;
5189 DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (new_friend))
5190 = DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (decl));
5193 /* The mangled name for the NEW_FRIEND is incorrect. The function
5194 is not a template instantiation and should not be mangled like
5195 one. Therefore, we forget the mangling here; we'll recompute it
5196 later if we need it. */
5197 if (TREE_CODE (new_friend) != TEMPLATE_DECL)
5199 SET_DECL_RTL (new_friend, NULL_RTX);
5200 SET_DECL_ASSEMBLER_NAME (new_friend, NULL_TREE);
5203 if (DECL_NAMESPACE_SCOPE_P (new_friend))
5206 tree new_friend_template_info;
5207 tree new_friend_result_template_info;
5209 int new_friend_is_defn;
5211 /* We must save some information from NEW_FRIEND before calling
5212 duplicate decls since that function will free NEW_FRIEND if
5214 new_friend_template_info = DECL_TEMPLATE_INFO (new_friend);
5215 new_friend_is_defn =
5216 (DECL_INITIAL (DECL_TEMPLATE_RESULT
5217 (template_for_substitution (new_friend)))
5219 if (TREE_CODE (new_friend) == TEMPLATE_DECL)
5221 /* This declaration is a `primary' template. */
5222 DECL_PRIMARY_TEMPLATE (new_friend) = new_friend;
5224 new_friend_result_template_info
5225 = DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (new_friend));
5228 new_friend_result_template_info = NULL_TREE;
5230 /* Inside pushdecl_namespace_level, we will push into the
5231 current namespace. However, the friend function should go
5232 into the namespace of the template. */
5233 ns = decl_namespace_context (new_friend);
5234 push_nested_namespace (ns);
5235 old_decl = pushdecl_namespace_level (new_friend, /*is_friend=*/true);
5236 pop_nested_namespace (ns);
5238 if (old_decl != new_friend)
5240 /* This new friend declaration matched an existing
5241 declaration. For example, given:
5243 template <class T> void f(T);
5244 template <class U> class C {
5245 template <class T> friend void f(T) {}
5248 the friend declaration actually provides the definition
5249 of `f', once C has been instantiated for some type. So,
5250 old_decl will be the out-of-class template declaration,
5251 while new_friend is the in-class definition.
5253 But, if `f' was called before this point, the
5254 instantiation of `f' will have DECL_TI_ARGS corresponding
5255 to `T' but not to `U', references to which might appear
5256 in the definition of `f'. Previously, the most general
5257 template for an instantiation of `f' was the out-of-class
5258 version; now it is the in-class version. Therefore, we
5259 run through all specialization of `f', adding to their
5260 DECL_TI_ARGS appropriately. In particular, they need a
5261 new set of outer arguments, corresponding to the
5262 arguments for this class instantiation.
5264 The same situation can arise with something like this:
5267 template <class T> class C {
5271 when `C<int>' is instantiated. Now, `f(int)' is defined
5274 if (!new_friend_is_defn)
5275 /* On the other hand, if the in-class declaration does
5276 *not* provide a definition, then we don't want to alter
5277 existing definitions. We can just leave everything
5282 /* Overwrite whatever template info was there before, if
5283 any, with the new template information pertaining to
5285 DECL_TEMPLATE_INFO (old_decl) = new_friend_template_info;
5287 if (TREE_CODE (old_decl) != TEMPLATE_DECL)
5288 reregister_specialization (new_friend,
5289 most_general_template (old_decl),
5294 tree new_friend_args;
5296 DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (old_decl))
5297 = new_friend_result_template_info;
5299 new_friend_args = TI_ARGS (new_friend_template_info);
5300 for (t = DECL_TEMPLATE_SPECIALIZATIONS (old_decl);
5304 tree spec = TREE_VALUE (t);
5307 = add_outermost_template_args (new_friend_args,
5308 DECL_TI_ARGS (spec));
5311 /* Now, since specializations are always supposed to
5312 hang off of the most general template, we must move
5314 t = most_general_template (old_decl);
5317 DECL_TEMPLATE_SPECIALIZATIONS (t)
5318 = chainon (DECL_TEMPLATE_SPECIALIZATIONS (t),
5319 DECL_TEMPLATE_SPECIALIZATIONS (old_decl));
5320 DECL_TEMPLATE_SPECIALIZATIONS (old_decl) = NULL_TREE;
5325 /* The information from NEW_FRIEND has been merged into OLD_DECL
5326 by duplicate_decls. */
5327 new_friend = old_decl;
5332 tree context = DECL_CONTEXT (new_friend);
5336 template <class T> class C {
5337 template <class U> friend void C1<U>::f (); // case 1
5338 friend void C2<T>::f (); // case 2
5340 we only need to make sure CONTEXT is a complete type for
5341 case 2. To distinguish between the two cases, we note that
5342 CONTEXT of case 1 remains dependent type after tsubst while
5343 this isn't true for case 2. */
5344 ++processing_template_decl;
5345 dependent_p = dependent_type_p (context);
5346 --processing_template_decl;
5349 && !complete_type_or_else (context, NULL_TREE))
5350 return error_mark_node;
5352 if (COMPLETE_TYPE_P (context))
5354 /* Check to see that the declaration is really present, and,
5355 possibly obtain an improved declaration. */
5356 tree fn = check_classfn (context,
5357 new_friend, NULL_TREE);
5367 /* FRIEND_TMPL is a friend TEMPLATE_DECL. ARGS is the vector of
5368 template arguments, as for tsubst.
5370 Returns an appropriate tsubst'd friend type or error_mark_node on
5374 tsubst_friend_class (tree friend_tmpl, tree args)
5380 context = DECL_CONTEXT (friend_tmpl);
5384 if (TREE_CODE (context) == NAMESPACE_DECL)
5385 push_nested_namespace (context);
5387 push_nested_class (tsubst (context, args, tf_none, NULL_TREE));
5390 /* First, we look for a class template. */
5391 tmpl = lookup_name (DECL_NAME (friend_tmpl), /*prefer_type=*/0);
5393 /* But, if we don't find one, it might be because we're in a
5394 situation like this:
5402 Here, in the scope of (say) S<int>, `S' is bound to a TYPE_DECL
5403 for `S<int>', not the TEMPLATE_DECL. */
5404 if (!tmpl || !DECL_CLASS_TEMPLATE_P (tmpl))
5406 tmpl = lookup_name (DECL_NAME (friend_tmpl), /*prefer_type=*/1);
5407 tmpl = maybe_get_template_decl_from_type_decl (tmpl);
5410 if (tmpl && DECL_CLASS_TEMPLATE_P (tmpl))
5412 /* The friend template has already been declared. Just
5413 check to see that the declarations match, and install any new
5414 default parameters. We must tsubst the default parameters,
5415 of course. We only need the innermost template parameters
5416 because that is all that redeclare_class_template will look
5418 if (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (friend_tmpl))
5419 > TMPL_ARGS_DEPTH (args))
5422 parms = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_tmpl),
5423 args, tf_error | tf_warning);
5424 redeclare_class_template (TREE_TYPE (tmpl), parms);
5427 friend_type = TREE_TYPE (tmpl);
5431 /* The friend template has not already been declared. In this
5432 case, the instantiation of the template class will cause the
5433 injection of this template into the global scope. */
5434 tmpl = tsubst (friend_tmpl, args, tf_error | tf_warning, NULL_TREE);
5436 /* The new TMPL is not an instantiation of anything, so we
5437 forget its origins. We don't reset CLASSTYPE_TI_TEMPLATE for
5438 the new type because that is supposed to be the corresponding
5439 template decl, i.e., TMPL. */
5440 DECL_USE_TEMPLATE (tmpl) = 0;
5441 DECL_TEMPLATE_INFO (tmpl) = NULL_TREE;
5442 CLASSTYPE_USE_TEMPLATE (TREE_TYPE (tmpl)) = 0;
5443 CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl))
5444 = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl)));
5446 /* Inject this template into the global scope. */
5447 friend_type = TREE_TYPE (pushdecl_top_level_maybe_friend (tmpl, true));
5452 if (TREE_CODE (context) == NAMESPACE_DECL)
5453 pop_nested_namespace (context);
5455 pop_nested_class ();
5461 /* Returns zero if TYPE cannot be completed later due to circularity.
5462 Otherwise returns one. */
5465 can_complete_type_without_circularity (tree type)
5467 if (type == NULL_TREE || type == error_mark_node)
5469 else if (COMPLETE_TYPE_P (type))
5471 else if (TREE_CODE (type) == ARRAY_TYPE && TYPE_DOMAIN (type))
5472 return can_complete_type_without_circularity (TREE_TYPE (type));
5473 else if (CLASS_TYPE_P (type)
5474 && TYPE_BEING_DEFINED (TYPE_MAIN_VARIANT (type)))
5481 instantiate_class_template (tree type)
5483 tree template, args, pattern, t, member;
5488 if (type == error_mark_node)
5489 return error_mark_node;
5491 if (TYPE_BEING_DEFINED (type)
5492 || COMPLETE_TYPE_P (type)
5493 || dependent_type_p (type))
5496 /* Figure out which template is being instantiated. */
5497 template = most_general_template (CLASSTYPE_TI_TEMPLATE (type));
5498 gcc_assert (TREE_CODE (template) == TEMPLATE_DECL);
5500 /* Figure out which arguments are being used to do the
5502 args = CLASSTYPE_TI_ARGS (type);
5504 /* Determine what specialization of the original template to
5506 t = most_specialized_class (template, args);
5507 if (t == error_mark_node)
5509 const char *str = "candidates are:";
5510 error ("ambiguous class template instantiation for %q#T", type);
5511 for (t = DECL_TEMPLATE_SPECIALIZATIONS (template); t;
5514 if (get_class_bindings (TREE_VALUE (t), TREE_PURPOSE (t), args))
5516 error ("%s %+#T", str, TREE_TYPE (t));
5520 TYPE_BEING_DEFINED (type) = 1;
5521 return error_mark_node;
5525 pattern = TREE_TYPE (t);
5527 pattern = TREE_TYPE (template);
5529 /* If the template we're instantiating is incomplete, then clearly
5530 there's nothing we can do. */
5531 if (!COMPLETE_TYPE_P (pattern))
5534 /* If we've recursively instantiated too many templates, stop. */
5535 if (! push_tinst_level (type))
5538 /* Now we're really doing the instantiation. Mark the type as in
5539 the process of being defined. */
5540 TYPE_BEING_DEFINED (type) = 1;
5542 /* We may be in the middle of deferred access check. Disable
5544 push_deferring_access_checks (dk_no_deferred);
5546 push_to_top_level ();
5550 /* This TYPE is actually an instantiation of a partial
5551 specialization. We replace the innermost set of ARGS with
5552 the arguments appropriate for substitution. For example,
5555 template <class T> struct S {};
5556 template <class T> struct S<T*> {};
5558 and supposing that we are instantiating S<int*>, ARGS will
5559 present be {int*} but we need {int}. */
5561 = get_class_bindings (TREE_VALUE (t), TREE_PURPOSE (t),
5564 /* If there were multiple levels in ARGS, replacing the
5565 innermost level would alter CLASSTYPE_TI_ARGS, which we don't
5566 want, so we make a copy first. */
5567 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args))
5569 args = copy_node (args);
5570 SET_TMPL_ARGS_LEVEL (args, TMPL_ARGS_DEPTH (args), inner_args);
5576 SET_CLASSTYPE_INTERFACE_UNKNOWN (type);
5578 /* Set the input location to the template definition. This is needed
5579 if tsubsting causes an error. */
5580 typedecl = TYPE_MAIN_DECL (type);
5581 input_location = DECL_SOURCE_LOCATION (typedecl);
5582 in_system_header = DECL_IN_SYSTEM_HEADER (typedecl);
5584 TYPE_HAS_CONSTRUCTOR (type) = TYPE_HAS_CONSTRUCTOR (pattern);
5585 TYPE_HAS_NEW_OPERATOR (type) = TYPE_HAS_NEW_OPERATOR (pattern);
5586 TYPE_HAS_ARRAY_NEW_OPERATOR (type) = TYPE_HAS_ARRAY_NEW_OPERATOR (pattern);
5587 TYPE_GETS_DELETE (type) = TYPE_GETS_DELETE (pattern);
5588 TYPE_HAS_ASSIGN_REF (type) = TYPE_HAS_ASSIGN_REF (pattern);
5589 TYPE_HAS_CONST_ASSIGN_REF (type) = TYPE_HAS_CONST_ASSIGN_REF (pattern);
5590 TYPE_HAS_INIT_REF (type) = TYPE_HAS_INIT_REF (pattern);
5591 TYPE_HAS_CONST_INIT_REF (type) = TYPE_HAS_CONST_INIT_REF (pattern);
5592 TYPE_HAS_DEFAULT_CONSTRUCTOR (type) = TYPE_HAS_DEFAULT_CONSTRUCTOR (pattern);
5593 TYPE_HAS_CONVERSION (type) = TYPE_HAS_CONVERSION (pattern);
5594 TYPE_PACKED (type) = TYPE_PACKED (pattern);
5595 TYPE_ALIGN (type) = TYPE_ALIGN (pattern);
5596 TYPE_USER_ALIGN (type) = TYPE_USER_ALIGN (pattern);
5597 TYPE_FOR_JAVA (type) = TYPE_FOR_JAVA (pattern); /* For libjava's JArray<T> */
5598 if (ANON_AGGR_TYPE_P (pattern))
5599 SET_ANON_AGGR_TYPE_P (type);
5600 if (CLASSTYPE_VISIBILITY_SPECIFIED (pattern))
5602 CLASSTYPE_VISIBILITY_SPECIFIED (type) = 1;
5603 CLASSTYPE_VISIBILITY (type) = CLASSTYPE_VISIBILITY (pattern);
5606 pbinfo = TYPE_BINFO (pattern);
5608 /* We should never instantiate a nested class before its enclosing
5609 class; we need to look up the nested class by name before we can
5610 instantiate it, and that lookup should instantiate the enclosing
5612 gcc_assert (!DECL_CLASS_SCOPE_P (TYPE_MAIN_DECL (pattern))
5613 || COMPLETE_TYPE_P (TYPE_CONTEXT (type))
5614 || TYPE_BEING_DEFINED (TYPE_CONTEXT (type)));
5616 base_list = NULL_TREE;
5617 if (BINFO_N_BASE_BINFOS (pbinfo))
5620 tree context = TYPE_CONTEXT (type);
5624 /* We must enter the scope containing the type, as that is where
5625 the accessibility of types named in dependent bases are
5627 pushed_scope = push_scope (context ? context : global_namespace);
5629 /* Substitute into each of the bases to determine the actual
5631 for (i = 0; BINFO_BASE_ITERATE (pbinfo, i, pbase_binfo); i++)
5634 tree access = BINFO_BASE_ACCESS (pbinfo, i);
5636 /* Substitute to figure out the base class. */
5637 base = tsubst (BINFO_TYPE (pbase_binfo), args, tf_error, NULL_TREE);
5638 if (base == error_mark_node)
5641 base_list = tree_cons (access, base, base_list);
5642 if (BINFO_VIRTUAL_P (pbase_binfo))
5643 TREE_TYPE (base_list) = integer_type_node;
5646 /* The list is now in reverse order; correct that. */
5647 base_list = nreverse (base_list);
5650 pop_scope (pushed_scope);
5652 /* Now call xref_basetypes to set up all the base-class
5654 xref_basetypes (type, base_list);
5657 /* Now that our base classes are set up, enter the scope of the
5658 class, so that name lookups into base classes, etc. will work
5659 correctly. This is precisely analogous to what we do in
5660 begin_class_definition when defining an ordinary non-template
5664 /* Now members are processed in the order of declaration. */
5665 for (member = CLASSTYPE_DECL_LIST (pattern);
5666 member; member = TREE_CHAIN (member))
5668 tree t = TREE_VALUE (member);
5670 if (TREE_PURPOSE (member))
5674 /* Build new CLASSTYPE_NESTED_UTDS. */
5677 tree name = TYPE_IDENTIFIER (tag);
5679 bool class_template_p;
5681 class_template_p = (TREE_CODE (tag) != ENUMERAL_TYPE
5682 && TYPE_LANG_SPECIFIC (tag)
5683 && CLASSTYPE_IS_TEMPLATE (tag));
5684 /* If the member is a class template, then -- even after
5685 substitution -- there may be dependent types in the
5686 template argument list for the class. We increment
5687 PROCESSING_TEMPLATE_DECL so that dependent_type_p, as
5688 that function will assume that no types are dependent
5689 when outside of a template. */
5690 if (class_template_p)
5691 ++processing_template_decl;
5692 newtag = tsubst (tag, args, tf_error, NULL_TREE);
5693 if (class_template_p)
5694 --processing_template_decl;
5695 if (newtag == error_mark_node)
5698 if (TREE_CODE (newtag) != ENUMERAL_TYPE)
5700 if (class_template_p)
5701 /* Unfortunately, lookup_template_class sets
5702 CLASSTYPE_IMPLICIT_INSTANTIATION for a partial
5703 instantiation (i.e., for the type of a member
5704 template class nested within a template class.)
5705 This behavior is required for
5706 maybe_process_partial_specialization to work
5707 correctly, but is not accurate in this case;
5708 the TAG is not an instantiation of anything.
5709 (The corresponding TEMPLATE_DECL is an
5710 instantiation, but the TYPE is not.) */
5711 CLASSTYPE_USE_TEMPLATE (newtag) = 0;
5713 /* Now, we call pushtag to put this NEWTAG into the scope of
5714 TYPE. We first set up the IDENTIFIER_TYPE_VALUE to avoid
5715 pushtag calling push_template_decl. We don't have to do
5716 this for enums because it will already have been done in
5719 SET_IDENTIFIER_TYPE_VALUE (name, newtag);
5720 pushtag (name, newtag, /*tag_scope=*/ts_current);
5723 else if (TREE_CODE (t) == FUNCTION_DECL
5724 || DECL_FUNCTION_TEMPLATE_P (t))
5726 /* Build new TYPE_METHODS. */
5729 if (TREE_CODE (t) == TEMPLATE_DECL)
5730 ++processing_template_decl;
5731 r = tsubst (t, args, tf_error, NULL_TREE);
5732 if (TREE_CODE (t) == TEMPLATE_DECL)
5733 --processing_template_decl;
5734 set_current_access_from_decl (r);
5735 grok_special_member_properties (r);
5736 finish_member_declaration (r);
5740 /* Build new TYPE_FIELDS. */
5742 if (TREE_CODE (t) != CONST_DECL)
5746 /* The the file and line for this declaration, to
5747 assist in error message reporting. Since we
5748 called push_tinst_level above, we don't need to
5750 input_location = DECL_SOURCE_LOCATION (t);
5752 if (TREE_CODE (t) == TEMPLATE_DECL)
5753 ++processing_template_decl;
5754 r = tsubst (t, args, tf_error | tf_warning, NULL_TREE);
5755 if (TREE_CODE (t) == TEMPLATE_DECL)
5756 --processing_template_decl;
5757 if (TREE_CODE (r) == VAR_DECL)
5761 [t]he initialization (and any associated
5762 side-effects) of a static data member does
5763 not occur unless the static data member is
5764 itself used in a way that requires the
5765 definition of the static data member to
5768 Therefore, we do not substitute into the
5769 initialized for the static data member here. */
5770 finish_static_data_member_decl
5773 /*asmspec_tree=*/NULL_TREE,
5775 if (DECL_INITIALIZED_IN_CLASS_P (r))
5776 check_static_variable_definition (r, TREE_TYPE (r));
5778 else if (TREE_CODE (r) == FIELD_DECL)
5780 /* Determine whether R has a valid type and can be
5781 completed later. If R is invalid, then it is
5782 replaced by error_mark_node so that it will not be
5783 added to TYPE_FIELDS. */
5784 tree rtype = TREE_TYPE (r);
5785 if (can_complete_type_without_circularity (rtype))
5786 complete_type (rtype);
5788 if (!COMPLETE_TYPE_P (rtype))
5790 cxx_incomplete_type_error (r, rtype);
5791 r = error_mark_node;
5795 /* If it is a TYPE_DECL for a class-scoped ENUMERAL_TYPE,
5796 such a thing will already have been added to the field
5797 list by tsubst_enum in finish_member_declaration in the
5798 CLASSTYPE_NESTED_UTDS case above. */
5799 if (!(TREE_CODE (r) == TYPE_DECL
5800 && TREE_CODE (TREE_TYPE (r)) == ENUMERAL_TYPE
5801 && DECL_ARTIFICIAL (r)))
5803 set_current_access_from_decl (r);
5804 finish_member_declaration (r);
5811 if (TYPE_P (t) || DECL_CLASS_TEMPLATE_P (t))
5813 /* Build new CLASSTYPE_FRIEND_CLASSES. */
5815 tree friend_type = t;
5816 bool adjust_processing_template_decl = false;
5818 if (TREE_CODE (friend_type) == TEMPLATE_DECL)
5820 /* template <class T> friend class C; */
5821 friend_type = tsubst_friend_class (friend_type, args);
5822 adjust_processing_template_decl = true;
5824 else if (TREE_CODE (friend_type) == UNBOUND_CLASS_TEMPLATE)
5826 /* template <class T> friend class C::D; */
5827 friend_type = tsubst (friend_type, args,
5828 tf_error | tf_warning, NULL_TREE);
5829 if (TREE_CODE (friend_type) == TEMPLATE_DECL)
5830 friend_type = TREE_TYPE (friend_type);
5831 adjust_processing_template_decl = true;
5833 else if (TREE_CODE (friend_type) == TYPENAME_TYPE)
5835 /* This could be either
5839 when dependent_type_p is false or
5841 template <class U> friend class T::C;
5844 friend_type = tsubst (friend_type, args,
5845 tf_error | tf_warning, NULL_TREE);
5846 /* Bump processing_template_decl for correct
5847 dependent_type_p calculation. */
5848 ++processing_template_decl;
5849 if (dependent_type_p (friend_type))
5850 adjust_processing_template_decl = true;
5851 --processing_template_decl;
5853 else if (!CLASSTYPE_USE_TEMPLATE (friend_type)
5854 && hidden_name_p (TYPE_NAME (friend_type)))
5858 where C hasn't been declared yet. Let's lookup name
5859 from namespace scope directly, bypassing any name that
5860 come from dependent base class. */
5861 tree ns = decl_namespace_context (TYPE_MAIN_DECL (friend_type));
5863 /* The call to xref_tag_from_type does injection for friend
5865 push_nested_namespace (ns);
5867 xref_tag_from_type (friend_type, NULL_TREE,
5868 /*tag_scope=*/ts_current);
5869 pop_nested_namespace (ns);
5871 else if (uses_template_parms (friend_type))
5872 /* friend class C<T>; */
5873 friend_type = tsubst (friend_type, args,
5874 tf_error | tf_warning, NULL_TREE);
5879 where C is already declared or
5881 friend class C<int>;
5883 We don't have to do anything in these cases. */
5885 if (adjust_processing_template_decl)
5886 /* Trick make_friend_class into realizing that the friend
5887 we're adding is a template, not an ordinary class. It's
5888 important that we use make_friend_class since it will
5889 perform some error-checking and output cross-reference
5891 ++processing_template_decl;
5893 if (friend_type != error_mark_node)
5894 make_friend_class (type, friend_type, /*complain=*/false);
5896 if (adjust_processing_template_decl)
5897 --processing_template_decl;
5901 /* Build new DECL_FRIENDLIST. */
5904 /* The the file and line for this declaration, to
5905 assist in error message reporting. Since we
5906 called push_tinst_level above, we don't need to
5908 input_location = DECL_SOURCE_LOCATION (t);
5910 if (TREE_CODE (t) == TEMPLATE_DECL)
5912 ++processing_template_decl;
5913 push_deferring_access_checks (dk_no_check);
5916 r = tsubst_friend_function (t, args);
5917 add_friend (type, r, /*complain=*/false);
5918 if (TREE_CODE (t) == TEMPLATE_DECL)
5920 pop_deferring_access_checks ();
5921 --processing_template_decl;
5927 /* Set the file and line number information to whatever is given for
5928 the class itself. This puts error messages involving generated
5929 implicit functions at a predictable point, and the same point
5930 that would be used for non-template classes. */
5931 input_location = DECL_SOURCE_LOCATION (typedecl);
5933 unreverse_member_declarations (type);
5934 finish_struct_1 (type);
5935 TYPE_BEING_DEFINED (type) = 0;
5937 /* Now that the class is complete, instantiate default arguments for
5938 any member functions. We don't do this earlier because the
5939 default arguments may reference members of the class. */
5940 if (!PRIMARY_TEMPLATE_P (template))
5941 for (t = TYPE_METHODS (type); t; t = TREE_CHAIN (t))
5942 if (TREE_CODE (t) == FUNCTION_DECL
5943 /* Implicitly generated member functions will not have template
5944 information; they are not instantiations, but instead are
5945 created "fresh" for each instantiation. */
5946 && DECL_TEMPLATE_INFO (t))
5947 tsubst_default_arguments (t);
5950 pop_from_top_level ();
5951 pop_deferring_access_checks ();
5954 /* The vtable for a template class can be emitted in any translation
5955 unit in which the class is instantiated. When there is no key
5956 method, however, finish_struct_1 will already have added TYPE to
5957 the keyed_classes list. */
5958 if (TYPE_CONTAINS_VPTR_P (type) && CLASSTYPE_KEY_METHOD (type))
5959 keyed_classes = tree_cons (NULL_TREE, type, keyed_classes);
5965 tsubst_template_arg (tree t, tree args, tsubst_flags_t complain, tree in_decl)
5971 else if (TYPE_P (t))
5972 r = tsubst (t, args, complain, in_decl);
5975 r = tsubst_expr (t, args, complain, in_decl);
5976 r = fold_non_dependent_expr (r);
5981 /* Substitute ARGS into the vector or list of template arguments T. */
5984 tsubst_template_args (tree t, tree args, tsubst_flags_t complain, tree in_decl)
5986 int len = TREE_VEC_LENGTH (t);
5987 int need_new = 0, i;
5988 tree *elts = alloca (len * sizeof (tree));
5990 for (i = 0; i < len; i++)
5992 tree orig_arg = TREE_VEC_ELT (t, i);
5995 if (TREE_CODE (orig_arg) == TREE_VEC)
5996 new_arg = tsubst_template_args (orig_arg, args, complain, in_decl);
5998 new_arg = tsubst_template_arg (orig_arg, args, complain, in_decl);
6000 if (new_arg == error_mark_node)
6001 return error_mark_node;
6004 if (new_arg != orig_arg)
6011 t = make_tree_vec (len);
6012 for (i = 0; i < len; i++)
6013 TREE_VEC_ELT (t, i) = elts[i];
6018 /* Return the result of substituting ARGS into the template parameters
6019 given by PARMS. If there are m levels of ARGS and m + n levels of
6020 PARMS, then the result will contain n levels of PARMS. For
6021 example, if PARMS is `template <class T> template <class U>
6022 template <T*, U, class V>' and ARGS is {{int}, {double}} then the
6023 result will be `template <int*, double, class V>'. */
6026 tsubst_template_parms (tree parms, tree args, tsubst_flags_t complain)
6031 /* When substituting into a template, we must set
6032 PROCESSING_TEMPLATE_DECL as the template parameters may be
6033 dependent if they are based on one-another, and the dependency
6034 predicates are short-circuit outside of templates. */
6035 ++processing_template_decl;
6037 for (new_parms = &r;
6038 TMPL_PARMS_DEPTH (parms) > TMPL_ARGS_DEPTH (args);
6039 new_parms = &(TREE_CHAIN (*new_parms)),
6040 parms = TREE_CHAIN (parms))
6043 make_tree_vec (TREE_VEC_LENGTH (TREE_VALUE (parms)));
6046 for (i = 0; i < TREE_VEC_LENGTH (new_vec); ++i)
6048 tree tuple = TREE_VEC_ELT (TREE_VALUE (parms), i);
6049 tree default_value = TREE_PURPOSE (tuple);
6050 tree parm_decl = TREE_VALUE (tuple);
6052 parm_decl = tsubst (parm_decl, args, complain, NULL_TREE);
6053 if (TREE_CODE (parm_decl) == PARM_DECL
6054 && invalid_nontype_parm_type_p (TREE_TYPE (parm_decl), complain))
6055 parm_decl = error_mark_node;
6056 default_value = tsubst_template_arg (default_value, args,
6057 complain, NULL_TREE);
6059 tuple = build_tree_list (default_value, parm_decl);
6060 TREE_VEC_ELT (new_vec, i) = tuple;
6064 tree_cons (size_int (TMPL_PARMS_DEPTH (parms)
6065 - TMPL_ARGS_DEPTH (args)),
6066 new_vec, NULL_TREE);
6069 --processing_template_decl;
6074 /* Substitute the ARGS into the indicated aggregate (or enumeration)
6075 type T. If T is not an aggregate or enumeration type, it is
6076 handled as if by tsubst. IN_DECL is as for tsubst. If
6077 ENTERING_SCOPE is nonzero, T is the context for a template which
6078 we are presently tsubst'ing. Return the substituted value. */
6081 tsubst_aggr_type (tree t,
6083 tsubst_flags_t complain,
6090 switch (TREE_CODE (t))
6093 if (TYPE_PTRMEMFUNC_P (t))
6094 return tsubst (TYPE_PTRMEMFUNC_FN_TYPE (t), args, complain, in_decl);
6096 /* Else fall through. */
6099 if (TYPE_TEMPLATE_INFO (t))
6104 bool saved_skip_evaluation;
6106 /* In "sizeof(X<I>)" we need to evaluate "I". */
6107 saved_skip_evaluation = skip_evaluation;
6108 skip_evaluation = false;
6110 /* First, determine the context for the type we are looking
6112 context = TYPE_CONTEXT (t);
6114 context = tsubst_aggr_type (context, args, complain,
6115 in_decl, /*entering_scope=*/1);
6117 /* Then, figure out what arguments are appropriate for the
6118 type we are trying to find. For example, given:
6120 template <class T> struct S;
6121 template <class T, class U> void f(T, U) { S<U> su; }
6123 and supposing that we are instantiating f<int, double>,
6124 then our ARGS will be {int, double}, but, when looking up
6125 S we only want {double}. */
6126 argvec = tsubst_template_args (TYPE_TI_ARGS (t), args,
6128 if (argvec == error_mark_node)
6129 r = error_mark_node;
6132 r = lookup_template_class (t, argvec, in_decl, context,
6133 entering_scope, complain);
6134 r = cp_build_qualified_type_real (r, TYPE_QUALS (t), complain);
6137 skip_evaluation = saved_skip_evaluation;
6142 /* This is not a template type, so there's nothing to do. */
6146 return tsubst (t, args, complain, in_decl);
6150 /* Substitute into the default argument ARG (a default argument for
6151 FN), which has the indicated TYPE. */
6154 tsubst_default_argument (tree fn, tree type, tree arg)
6156 tree saved_class_ptr = NULL_TREE;
6157 tree saved_class_ref = NULL_TREE;
6159 /* This default argument came from a template. Instantiate the
6160 default argument here, not in tsubst. In the case of
6169 we must be careful to do name lookup in the scope of S<T>,
6170 rather than in the current class. */
6171 push_access_scope (fn);
6172 /* The "this" pointer is not valid in a default argument. */
6175 saved_class_ptr = current_class_ptr;
6176 cp_function_chain->x_current_class_ptr = NULL_TREE;
6177 saved_class_ref = current_class_ref;
6178 cp_function_chain->x_current_class_ref = NULL_TREE;
6181 push_deferring_access_checks(dk_no_deferred);
6182 arg = tsubst_expr (arg, DECL_TI_ARGS (fn),
6183 tf_error | tf_warning, NULL_TREE);
6184 pop_deferring_access_checks();
6186 /* Restore the "this" pointer. */
6189 cp_function_chain->x_current_class_ptr = saved_class_ptr;
6190 cp_function_chain->x_current_class_ref = saved_class_ref;
6193 pop_access_scope (fn);
6195 /* Make sure the default argument is reasonable. */
6196 arg = check_default_argument (type, arg);
6201 /* Substitute into all the default arguments for FN. */
6204 tsubst_default_arguments (tree fn)
6209 tmpl_args = DECL_TI_ARGS (fn);
6211 /* If this function is not yet instantiated, we certainly don't need
6212 its default arguments. */
6213 if (uses_template_parms (tmpl_args))
6216 for (arg = TYPE_ARG_TYPES (TREE_TYPE (fn));
6218 arg = TREE_CHAIN (arg))
6219 if (TREE_PURPOSE (arg))
6220 TREE_PURPOSE (arg) = tsubst_default_argument (fn,
6222 TREE_PURPOSE (arg));
6225 /* Substitute the ARGS into the T, which is a _DECL. Return the
6226 result of the substitution. Issue error and warning messages under
6227 control of COMPLAIN. */
6230 tsubst_decl (tree t, tree args, tsubst_flags_t complain)
6232 location_t saved_loc;
6236 /* Set the filename and linenumber to improve error-reporting. */
6237 saved_loc = input_location;
6238 input_location = DECL_SOURCE_LOCATION (t);
6240 switch (TREE_CODE (t))
6244 /* We can get here when processing a member function template,
6245 member class template, and template template parameter of
6246 a template class. */
6247 tree decl = DECL_TEMPLATE_RESULT (t);
6252 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t))
6254 /* Template template parameter is treated here. */
6255 tree new_type = tsubst (TREE_TYPE (t), args, complain, in_decl);
6256 if (new_type == error_mark_node)
6257 return error_mark_node;
6260 TREE_CHAIN (r) = NULL_TREE;
6261 TREE_TYPE (r) = new_type;
6262 DECL_TEMPLATE_RESULT (r)
6263 = build_decl (TYPE_DECL, DECL_NAME (decl), new_type);
6264 DECL_TEMPLATE_PARMS (r)
6265 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t), args,
6267 TYPE_NAME (new_type) = r;
6271 /* We might already have an instance of this template.
6272 The ARGS are for the surrounding class type, so the
6273 full args contain the tsubst'd args for the context,
6274 plus the innermost args from the template decl. */
6275 tmpl_args = DECL_CLASS_TEMPLATE_P (t)
6276 ? CLASSTYPE_TI_ARGS (TREE_TYPE (t))
6277 : DECL_TI_ARGS (DECL_TEMPLATE_RESULT (t));
6278 /* Because this is a template, the arguments will still be
6279 dependent, even after substitution. If
6280 PROCESSING_TEMPLATE_DECL is not set, the dependency
6281 predicates will short-circuit. */
6282 ++processing_template_decl;
6283 full_args = tsubst_template_args (tmpl_args, args,
6285 --processing_template_decl;
6286 if (full_args == error_mark_node)
6287 return error_mark_node;
6289 /* tsubst_template_args doesn't copy the vector if
6290 nothing changed. But, *something* should have
6292 gcc_assert (full_args != tmpl_args);
6294 spec = retrieve_specialization (t, full_args,
6295 /*class_specializations_p=*/true);
6296 if (spec != NULL_TREE)
6302 /* Make a new template decl. It will be similar to the
6303 original, but will record the current template arguments.
6304 We also create a new function declaration, which is just
6305 like the old one, but points to this new template, rather
6306 than the old one. */
6308 gcc_assert (DECL_LANG_SPECIFIC (r) != 0);
6309 TREE_CHAIN (r) = NULL_TREE;
6311 DECL_TEMPLATE_INFO (r) = build_tree_list (t, args);
6313 if (TREE_CODE (decl) == TYPE_DECL)
6316 ++processing_template_decl;
6317 new_type = tsubst (TREE_TYPE (t), args, complain, in_decl);
6318 --processing_template_decl;
6319 if (new_type == error_mark_node)
6320 return error_mark_node;
6322 TREE_TYPE (r) = new_type;
6323 CLASSTYPE_TI_TEMPLATE (new_type) = r;
6324 DECL_TEMPLATE_RESULT (r) = TYPE_MAIN_DECL (new_type);
6325 DECL_TI_ARGS (r) = CLASSTYPE_TI_ARGS (new_type);
6326 DECL_CONTEXT (r) = TYPE_CONTEXT (new_type);
6331 ++processing_template_decl;
6332 new_decl = tsubst (decl, args, complain, in_decl);
6333 --processing_template_decl;
6334 if (new_decl == error_mark_node)
6335 return error_mark_node;
6337 DECL_TEMPLATE_RESULT (r) = new_decl;
6338 DECL_TI_TEMPLATE (new_decl) = r;
6339 TREE_TYPE (r) = TREE_TYPE (new_decl);
6340 DECL_TI_ARGS (r) = DECL_TI_ARGS (new_decl);
6341 DECL_CONTEXT (r) = DECL_CONTEXT (new_decl);
6344 SET_DECL_IMPLICIT_INSTANTIATION (r);
6345 DECL_TEMPLATE_INSTANTIATIONS (r) = NULL_TREE;
6346 DECL_TEMPLATE_SPECIALIZATIONS (r) = NULL_TREE;
6348 /* The template parameters for this new template are all the
6349 template parameters for the old template, except the
6350 outermost level of parameters. */
6351 DECL_TEMPLATE_PARMS (r)
6352 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t), args,
6355 if (PRIMARY_TEMPLATE_P (t))
6356 DECL_PRIMARY_TEMPLATE (r) = r;
6358 if (TREE_CODE (decl) != TYPE_DECL)
6359 /* Record this non-type partial instantiation. */
6360 register_specialization (r, t,
6361 DECL_TI_ARGS (DECL_TEMPLATE_RESULT (r)),
6369 tree argvec = NULL_TREE;
6377 /* Nobody should be tsubst'ing into non-template functions. */
6378 gcc_assert (DECL_TEMPLATE_INFO (t) != NULL_TREE);
6380 if (TREE_CODE (DECL_TI_TEMPLATE (t)) == TEMPLATE_DECL)
6385 /* If T is not dependent, just return it. We have to
6386 increment PROCESSING_TEMPLATE_DECL because
6387 value_dependent_expression_p assumes that nothing is
6388 dependent when PROCESSING_TEMPLATE_DECL is zero. */
6389 ++processing_template_decl;
6390 dependent_p = value_dependent_expression_p (t);
6391 --processing_template_decl;
6395 /* Calculate the most general template of which R is a
6396 specialization, and the complete set of arguments used to
6398 gen_tmpl = most_general_template (DECL_TI_TEMPLATE (t));
6399 argvec = tsubst_template_args (DECL_TI_ARGS
6400 (DECL_TEMPLATE_RESULT (gen_tmpl)),
6401 args, complain, in_decl);
6403 /* Check to see if we already have this specialization. */
6404 spec = retrieve_specialization (gen_tmpl, argvec,
6405 /*class_specializations_p=*/false);
6413 /* We can see more levels of arguments than parameters if
6414 there was a specialization of a member template, like
6417 template <class T> struct S { template <class U> void f(); }
6418 template <> template <class U> void S<int>::f(U);
6420 Here, we'll be substituting into the specialization,
6421 because that's where we can find the code we actually
6422 want to generate, but we'll have enough arguments for
6423 the most general template.
6425 We also deal with the peculiar case:
6427 template <class T> struct S {
6428 template <class U> friend void f();
6430 template <class U> void f() {}
6432 template void f<double>();
6434 Here, the ARGS for the instantiation of will be {int,
6435 double}. But, we only need as many ARGS as there are
6436 levels of template parameters in CODE_PATTERN. We are
6437 careful not to get fooled into reducing the ARGS in
6440 template <class T> struct S { template <class U> void f(U); }
6441 template <class T> template <> void S<T>::f(int) {}
6443 which we can spot because the pattern will be a
6444 specialization in this case. */
6445 args_depth = TMPL_ARGS_DEPTH (args);
6447 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (t)));
6448 if (args_depth > parms_depth
6449 && !DECL_TEMPLATE_SPECIALIZATION (t))
6450 args = get_innermost_template_args (args, parms_depth);
6454 /* This special case arises when we have something like this:
6456 template <class T> struct S {
6457 friend void f<int>(int, double);
6460 Here, the DECL_TI_TEMPLATE for the friend declaration
6461 will be an IDENTIFIER_NODE. We are being called from
6462 tsubst_friend_function, and we want only to create a
6463 new decl (R) with appropriate types so that we can call
6464 determine_specialization. */
6465 gen_tmpl = NULL_TREE;
6468 if (DECL_CLASS_SCOPE_P (t))
6470 if (DECL_NAME (t) == constructor_name (DECL_CONTEXT (t)))
6474 ctx = tsubst_aggr_type (DECL_CONTEXT (t), args,
6475 complain, t, /*entering_scope=*/1);
6480 ctx = DECL_CONTEXT (t);
6482 type = tsubst (TREE_TYPE (t), args, complain, in_decl);
6483 if (type == error_mark_node)
6484 return error_mark_node;
6486 /* We do NOT check for matching decls pushed separately at this
6487 point, as they may not represent instantiations of this
6488 template, and in any case are considered separate under the
6491 DECL_USE_TEMPLATE (r) = 0;
6492 TREE_TYPE (r) = type;
6493 /* Clear out the mangled name and RTL for the instantiation. */
6494 SET_DECL_ASSEMBLER_NAME (r, NULL_TREE);
6495 SET_DECL_RTL (r, NULL_RTX);
6496 DECL_INITIAL (r) = NULL_TREE;
6497 DECL_CONTEXT (r) = ctx;
6499 if (member && DECL_CONV_FN_P (r))
6500 /* Type-conversion operator. Reconstruct the name, in
6501 case it's the name of one of the template's parameters. */
6502 DECL_NAME (r) = mangle_conv_op_name_for_type (TREE_TYPE (type));
6504 DECL_ARGUMENTS (r) = tsubst (DECL_ARGUMENTS (t), args,
6506 DECL_RESULT (r) = NULL_TREE;
6508 TREE_STATIC (r) = 0;
6509 TREE_PUBLIC (r) = TREE_PUBLIC (t);
6510 DECL_EXTERNAL (r) = 1;
6511 /* If this is an instantiation of a function with internal
6512 linkage, we already know what object file linkage will be
6513 assigned to the instantiation. */
6514 DECL_INTERFACE_KNOWN (r) = !TREE_PUBLIC (r);
6515 DECL_DEFER_OUTPUT (r) = 0;
6516 TREE_CHAIN (r) = NULL_TREE;
6517 DECL_PENDING_INLINE_INFO (r) = 0;
6518 DECL_PENDING_INLINE_P (r) = 0;
6519 DECL_SAVED_TREE (r) = NULL_TREE;
6521 if (DECL_CLONED_FUNCTION (r))
6523 DECL_CLONED_FUNCTION (r) = tsubst (DECL_CLONED_FUNCTION (t),
6525 TREE_CHAIN (r) = TREE_CHAIN (DECL_CLONED_FUNCTION (r));
6526 TREE_CHAIN (DECL_CLONED_FUNCTION (r)) = r;
6529 /* Set up the DECL_TEMPLATE_INFO for R. There's no need to do
6530 this in the special friend case mentioned above where
6531 GEN_TMPL is NULL. */
6534 DECL_TEMPLATE_INFO (r)
6535 = tree_cons (gen_tmpl, argvec, NULL_TREE);
6536 SET_DECL_IMPLICIT_INSTANTIATION (r);
6537 register_specialization (r, gen_tmpl, argvec, false);
6539 /* We're not supposed to instantiate default arguments
6540 until they are called, for a template. But, for a
6543 template <class T> void f ()
6544 { extern void g(int i = T()); }
6546 we should do the substitution when the template is
6547 instantiated. We handle the member function case in
6548 instantiate_class_template since the default arguments
6549 might refer to other members of the class. */
6551 && !PRIMARY_TEMPLATE_P (gen_tmpl)
6552 && !uses_template_parms (argvec))
6553 tsubst_default_arguments (r);
6556 DECL_TEMPLATE_INFO (r) = NULL_TREE;
6558 /* Copy the list of befriending classes. */
6559 for (friends = &DECL_BEFRIENDING_CLASSES (r);
6561 friends = &TREE_CHAIN (*friends))
6563 *friends = copy_node (*friends);
6564 TREE_VALUE (*friends) = tsubst (TREE_VALUE (*friends),
6569 if (DECL_CONSTRUCTOR_P (r) || DECL_DESTRUCTOR_P (r))
6571 maybe_retrofit_in_chrg (r);
6572 if (DECL_CONSTRUCTOR_P (r))
6573 grok_ctor_properties (ctx, r);
6574 /* If this is an instantiation of a member template, clone it.
6575 If it isn't, that'll be handled by
6576 clone_constructors_and_destructors. */
6577 if (PRIMARY_TEMPLATE_P (gen_tmpl))
6578 clone_function_decl (r, /*update_method_vec_p=*/0);
6580 else if (IDENTIFIER_OPNAME_P (DECL_NAME (r)))
6581 grok_op_properties (r, (complain & tf_error) != 0);
6583 if (DECL_FRIEND_P (t) && DECL_FRIEND_CONTEXT (t))
6584 SET_DECL_FRIEND_CONTEXT (r,
6585 tsubst (DECL_FRIEND_CONTEXT (t),
6586 args, complain, in_decl));
6595 if (DECL_TEMPLATE_PARM_P (t))
6596 SET_DECL_TEMPLATE_PARM_P (r);
6598 type = tsubst (TREE_TYPE (t), args, complain, in_decl);
6599 type = type_decays_to (type);
6600 TREE_TYPE (r) = type;
6601 cp_apply_type_quals_to_decl (cp_type_quals (type), r);
6603 if (DECL_INITIAL (r))
6605 if (TREE_CODE (DECL_INITIAL (r)) != TEMPLATE_PARM_INDEX)
6606 DECL_INITIAL (r) = TREE_TYPE (r);
6608 DECL_INITIAL (r) = tsubst (DECL_INITIAL (r), args,
6612 DECL_CONTEXT (r) = NULL_TREE;
6614 if (!DECL_TEMPLATE_PARM_P (r))
6615 DECL_ARG_TYPE (r) = type_passed_as (type);
6617 TREE_CHAIN (r) = tsubst (TREE_CHAIN (t), args,
6618 complain, TREE_CHAIN (t));
6627 type = tsubst (TREE_TYPE (t), args, complain, in_decl);
6628 if (type == error_mark_node)
6629 return error_mark_node;
6630 TREE_TYPE (r) = type;
6631 cp_apply_type_quals_to_decl (cp_type_quals (type), r);
6633 /* We don't have to set DECL_CONTEXT here; it is set by
6634 finish_member_declaration. */
6635 DECL_INITIAL (r) = tsubst_expr (DECL_INITIAL (t), args,
6637 TREE_CHAIN (r) = NULL_TREE;
6638 if (VOID_TYPE_P (type))
6639 error ("instantiation of %q+D as type %qT", r, type);
6644 /* We reach here only for member using decls. */
6645 if (DECL_DEPENDENT_P (t))
6647 r = do_class_using_decl
6648 (tsubst_copy (USING_DECL_SCOPE (t), args, complain, in_decl),
6649 tsubst_copy (DECL_NAME (t), args, complain, in_decl));
6651 r = error_mark_node;
6656 TREE_CHAIN (r) = NULL_TREE;
6663 tree argvec = NULL_TREE;
6664 tree gen_tmpl = NULL_TREE;
6666 tree tmpl = NULL_TREE;
6668 tree type = NULL_TREE;
6671 if (TREE_CODE (t) == TYPE_DECL)
6673 type = tsubst (TREE_TYPE (t), args, complain, in_decl);
6674 if (TREE_CODE (type) == TEMPLATE_TEMPLATE_PARM
6675 || t == TYPE_MAIN_DECL (TREE_TYPE (t)))
6677 /* If this is the canonical decl, we don't have to
6678 mess with instantiations, and often we can't (for
6679 typename, template type parms and such). Note that
6680 TYPE_NAME is not correct for the above test if
6681 we've copied the type for a typedef. */
6682 r = TYPE_NAME (type);
6687 /* Assume this is a non-local variable. */
6690 if (TYPE_P (CP_DECL_CONTEXT (t)))
6691 ctx = tsubst_aggr_type (DECL_CONTEXT (t), args,
6693 in_decl, /*entering_scope=*/1);
6694 else if (DECL_NAMESPACE_SCOPE_P (t))
6695 ctx = DECL_CONTEXT (t);
6698 /* Subsequent calls to pushdecl will fill this in. */
6703 /* Check to see if we already have this specialization. */
6706 tmpl = DECL_TI_TEMPLATE (t);
6707 gen_tmpl = most_general_template (tmpl);
6708 argvec = tsubst (DECL_TI_ARGS (t), args, complain, in_decl);
6709 spec = retrieve_specialization (gen_tmpl, argvec,
6710 /*class_specializations_p=*/false);
6713 spec = retrieve_local_specialization (t);
6722 if (TREE_CODE (r) == VAR_DECL)
6724 /* Even if the original location is out of scope, the
6725 newly substituted one is not. */
6726 DECL_DEAD_FOR_LOCAL (r) = 0;
6727 DECL_INITIALIZED_P (r) = 0;
6728 DECL_TEMPLATE_INSTANTIATED (r) = 0;
6729 type = tsubst (TREE_TYPE (t), args, complain, in_decl);
6730 if (type == error_mark_node)
6731 return error_mark_node;
6732 type = complete_type (type);
6733 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (r)
6734 = DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (t);
6735 type = check_var_type (DECL_NAME (r), type);
6737 if (DECL_HAS_VALUE_EXPR_P (t))
6739 tree ve = DECL_VALUE_EXPR (t);
6740 ve = tsubst_expr (ve, args, complain, in_decl);
6741 SET_DECL_VALUE_EXPR (r, ve);
6744 else if (DECL_SELF_REFERENCE_P (t))
6745 SET_DECL_SELF_REFERENCE_P (r);
6746 TREE_TYPE (r) = type;
6747 cp_apply_type_quals_to_decl (cp_type_quals (type), r);
6748 DECL_CONTEXT (r) = ctx;
6749 /* Clear out the mangled name and RTL for the instantiation. */
6750 SET_DECL_ASSEMBLER_NAME (r, NULL_TREE);
6751 if (CODE_CONTAINS_STRUCT (TREE_CODE (t), TS_DECL_WRTL))
6752 SET_DECL_RTL (r, NULL_RTX);
6753 /* The initializer must not be expanded until it is required;
6755 DECL_INITIAL (r) = NULL_TREE;
6756 if (CODE_CONTAINS_STRUCT (TREE_CODE (t), TS_DECL_WRTL))
6757 SET_DECL_RTL (r, NULL_RTX);
6758 DECL_SIZE (r) = DECL_SIZE_UNIT (r) = 0;
6762 /* A static data member declaration is always marked
6763 external when it is declared in-class, even if an
6764 initializer is present. We mimic the non-template
6766 DECL_EXTERNAL (r) = 1;
6768 register_specialization (r, gen_tmpl, argvec, false);
6769 DECL_TEMPLATE_INFO (r) = tree_cons (tmpl, argvec, NULL_TREE);
6770 SET_DECL_IMPLICIT_INSTANTIATION (r);
6773 register_local_specialization (r, t);
6775 TREE_CHAIN (r) = NULL_TREE;
6784 /* Restore the file and line information. */
6785 input_location = saved_loc;
6790 /* Substitute into the ARG_TYPES of a function type. */
6793 tsubst_arg_types (tree arg_types,
6795 tsubst_flags_t complain,
6798 tree remaining_arg_types;
6801 tree result = NULL_TREE;
6803 if (!arg_types || arg_types == void_list_node)
6806 remaining_arg_types = tsubst_arg_types (TREE_CHAIN (arg_types),
6807 args, complain, in_decl);
6808 if (remaining_arg_types == error_mark_node)
6809 return error_mark_node;
6811 type = tsubst (TREE_VALUE (arg_types), args, complain, in_decl);
6812 if (type == error_mark_node)
6813 return error_mark_node;
6814 if (VOID_TYPE_P (type))
6816 if (complain & tf_error)
6818 error ("invalid parameter type %qT", type);
6820 error ("in declaration %q+D", in_decl);
6822 return error_mark_node;
6825 /* Do array-to-pointer, function-to-pointer conversion, and ignore
6826 top-level qualifiers as required. */
6827 type = TYPE_MAIN_VARIANT (type_decays_to (type));
6829 /* We do not substitute into default arguments here. The standard
6830 mandates that they be instantiated only when needed, which is
6831 done in build_over_call. */
6832 default_arg = TREE_PURPOSE (arg_types);
6834 if (default_arg && TREE_CODE (default_arg) == DEFAULT_ARG)
6836 /* We've instantiated a template before its default arguments
6837 have been parsed. This can happen for a nested template
6838 class, and is not an error unless we require the default
6839 argument in a call of this function. */
6840 result = tree_cons (default_arg, type, remaining_arg_types);
6841 VEC_safe_push (tree, gc, DEFARG_INSTANTIATIONS (default_arg), result);
6844 result = hash_tree_cons (default_arg, type, remaining_arg_types);
6849 /* Substitute into a FUNCTION_TYPE or METHOD_TYPE. This routine does
6850 *not* handle the exception-specification for FNTYPE, because the
6851 initial substitution of explicitly provided template parameters
6852 during argument deduction forbids substitution into the
6853 exception-specification:
6857 All references in the function type of the function template to the
6858 corresponding template parameters are replaced by the specified tem-
6859 plate argument values. If a substitution in a template parameter or
6860 in the function type of the function template results in an invalid
6861 type, type deduction fails. [Note: The equivalent substitution in
6862 exception specifications is done only when the function is instanti-
6863 ated, at which point a program is ill-formed if the substitution
6864 results in an invalid type.] */
6867 tsubst_function_type (tree t,
6869 tsubst_flags_t complain,
6876 /* The TYPE_CONTEXT is not used for function/method types. */
6877 gcc_assert (TYPE_CONTEXT (t) == NULL_TREE);
6879 /* Substitute the return type. */
6880 return_type = tsubst (TREE_TYPE (t), args, complain, in_decl);
6881 if (return_type == error_mark_node)
6882 return error_mark_node;
6883 /* The standard does not presently indicate that creation of a
6884 function type with an invalid return type is a deduction failure.
6885 However, that is clearly analogous to creating an array of "void"
6886 or a reference to a reference. This is core issue #486. */
6887 if (TREE_CODE (return_type) == ARRAY_TYPE
6888 || TREE_CODE (return_type) == FUNCTION_TYPE)
6890 if (complain & tf_error)
6892 if (TREE_CODE (return_type) == ARRAY_TYPE)
6893 error ("function returning an array");
6895 error ("function returning a function");
6897 return error_mark_node;
6900 /* Substitute the argument types. */
6901 arg_types = tsubst_arg_types (TYPE_ARG_TYPES (t), args,
6903 if (arg_types == error_mark_node)
6904 return error_mark_node;
6906 /* Construct a new type node and return it. */
6907 if (TREE_CODE (t) == FUNCTION_TYPE)
6908 fntype = build_function_type (return_type, arg_types);
6911 tree r = TREE_TYPE (TREE_VALUE (arg_types));
6912 if (! IS_AGGR_TYPE (r))
6916 Type deduction may fail for any of the following
6919 -- Attempting to create "pointer to member of T" when T
6920 is not a class type. */
6921 if (complain & tf_error)
6922 error ("creating pointer to member function of non-class type %qT",
6924 return error_mark_node;
6927 fntype = build_method_type_directly (r, return_type,
6928 TREE_CHAIN (arg_types));
6930 fntype = cp_build_qualified_type_real (fntype, TYPE_QUALS (t), complain);
6931 fntype = cp_build_type_attribute_variant (fntype, TYPE_ATTRIBUTES (t));
6936 /* FNTYPE is a FUNCTION_TYPE or METHOD_TYPE. Substitute the template
6937 ARGS into that specification, and return the substituted
6938 specification. If there is no specification, return NULL_TREE. */
6941 tsubst_exception_specification (tree fntype,
6943 tsubst_flags_t complain,
6949 specs = TYPE_RAISES_EXCEPTIONS (fntype);
6950 new_specs = NULL_TREE;
6953 if (! TREE_VALUE (specs))
6959 spec = tsubst (TREE_VALUE (specs), args, complain, in_decl);
6960 if (spec == error_mark_node)
6962 new_specs = add_exception_specifier (new_specs, spec, complain);
6963 specs = TREE_CHAIN (specs);
6969 /* Substitute into the PARMS of a call-declarator. */
6972 tsubst_call_declarator_parms (tree parms,
6974 tsubst_flags_t complain,
6981 if (!parms || parms == void_list_node)
6984 new_parms = tsubst_call_declarator_parms (TREE_CHAIN (parms),
6985 args, complain, in_decl);
6987 /* Figure out the type of this parameter. */
6988 type = tsubst (TREE_VALUE (parms), args, complain, in_decl);
6990 /* Figure out the default argument as well. Note that we use
6991 tsubst_expr since the default argument is really an expression. */
6992 defarg = tsubst_expr (TREE_PURPOSE (parms), args, complain, in_decl);
6994 /* Chain this parameter on to the front of those we have already
6995 processed. We don't use hash_tree_cons because that function
6996 doesn't check TREE_PARMLIST. */
6997 new_parms = tree_cons (defarg, type, new_parms);
7002 /* Take the tree structure T and replace template parameters used
7003 therein with the argument vector ARGS. IN_DECL is an associated
7004 decl for diagnostics. If an error occurs, returns ERROR_MARK_NODE.
7005 Issue error and warning messages under control of COMPLAIN. Note
7006 that we must be relatively non-tolerant of extensions here, in
7007 order to preserve conformance; if we allow substitutions that
7008 should not be allowed, we may allow argument deductions that should
7009 not succeed, and therefore report ambiguous overload situations
7010 where there are none. In theory, we could allow the substitution,
7011 but indicate that it should have failed, and allow our caller to
7012 make sure that the right thing happens, but we don't try to do this
7015 This function is used for dealing with types, decls and the like;
7016 for expressions, use tsubst_expr or tsubst_copy. */
7019 tsubst (tree t, tree args, tsubst_flags_t complain, tree in_decl)
7023 if (t == NULL_TREE || t == error_mark_node
7024 || t == integer_type_node
7025 || t == void_type_node
7026 || t == char_type_node
7027 || t == unknown_type_node
7028 || TREE_CODE (t) == NAMESPACE_DECL)
7032 return tsubst_decl (t, args, complain);
7034 if (TREE_CODE (t) == IDENTIFIER_NODE)
7035 type = IDENTIFIER_TYPE_VALUE (t);
7037 type = TREE_TYPE (t);
7039 gcc_assert (type != unknown_type_node);
7042 && TREE_CODE (t) != TYPENAME_TYPE
7043 && TREE_CODE (t) != IDENTIFIER_NODE
7044 && TREE_CODE (t) != FUNCTION_TYPE
7045 && TREE_CODE (t) != METHOD_TYPE)
7046 type = tsubst (type, args, complain, in_decl);
7047 if (type == error_mark_node)
7048 return error_mark_node;
7050 switch (TREE_CODE (t))
7055 return tsubst_aggr_type (t, args, complain, in_decl,
7056 /*entering_scope=*/0);
7059 case IDENTIFIER_NODE:
7071 if (t == integer_type_node)
7074 if (TREE_CODE (TYPE_MIN_VALUE (t)) == INTEGER_CST
7075 && TREE_CODE (TYPE_MAX_VALUE (t)) == INTEGER_CST)
7079 tree max, omax = TREE_OPERAND (TYPE_MAX_VALUE (t), 0);
7081 /* The array dimension behaves like a non-type template arg,
7082 in that we want to fold it as much as possible. */
7083 max = tsubst_template_arg (omax, args, complain, in_decl);
7084 max = fold_decl_constant_value (max);
7088 Type deduction may fail for any of the following
7091 Attempting to create an array with a size that is
7092 zero or negative. */
7093 if (integer_zerop (max) && !(complain & tf_error))
7094 /* We must fail if performing argument deduction (as
7095 indicated by the state of complain), so that
7096 another substitution can be found. */
7097 return error_mark_node;
7099 else if (TREE_CODE (max) == INTEGER_CST
7100 && INT_CST_LT (max, integer_zero_node))
7102 if (complain & tf_error)
7103 error ("creating array with negative size (%qE)", max);
7105 return error_mark_node;
7108 return compute_array_index_type (NULL_TREE, max);
7111 case TEMPLATE_TYPE_PARM:
7112 case TEMPLATE_TEMPLATE_PARM:
7113 case BOUND_TEMPLATE_TEMPLATE_PARM:
7114 case TEMPLATE_PARM_INDEX:
7119 tree arg = NULL_TREE;
7123 gcc_assert (TREE_VEC_LENGTH (args) > 0);
7124 if (TREE_CODE (t) == TEMPLATE_TYPE_PARM
7125 || TREE_CODE (t) == TEMPLATE_TEMPLATE_PARM
7126 || TREE_CODE (t) == BOUND_TEMPLATE_TEMPLATE_PARM)
7128 idx = TEMPLATE_TYPE_IDX (t);
7129 level = TEMPLATE_TYPE_LEVEL (t);
7133 idx = TEMPLATE_PARM_IDX (t);
7134 level = TEMPLATE_PARM_LEVEL (t);
7137 levels = TMPL_ARGS_DEPTH (args);
7138 if (level <= levels)
7139 arg = TMPL_ARG (args, level, idx);
7141 if (arg == error_mark_node)
7142 return error_mark_node;
7143 else if (arg != NULL_TREE)
7145 if (TREE_CODE (t) == TEMPLATE_TYPE_PARM)
7147 gcc_assert (TYPE_P (arg));
7148 return cp_build_qualified_type_real
7149 (arg, cp_type_quals (arg) | cp_type_quals (t),
7150 complain | tf_ignore_bad_quals);
7152 else if (TREE_CODE (t) == BOUND_TEMPLATE_TEMPLATE_PARM)
7154 /* We are processing a type constructed from a
7155 template template parameter. */
7156 tree argvec = tsubst (TYPE_TI_ARGS (t),
7157 args, complain, in_decl);
7158 if (argvec == error_mark_node)
7159 return error_mark_node;
7161 /* We can get a TEMPLATE_TEMPLATE_PARM here when we
7162 are resolving nested-types in the signature of a
7163 member function templates. Otherwise ARG is a
7164 TEMPLATE_DECL and is the real template to be
7166 if (TREE_CODE (arg) == TEMPLATE_TEMPLATE_PARM)
7167 arg = TYPE_NAME (arg);
7169 r = lookup_template_class (arg,
7172 /*entering_scope=*/0,
7174 return cp_build_qualified_type_real
7175 (r, TYPE_QUALS (t), complain);
7178 /* TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX. */
7183 /* This can happen during the attempted tsubst'ing in
7184 unify. This means that we don't yet have any information
7185 about the template parameter in question. */
7188 /* If we get here, we must have been looking at a parm for a
7189 more deeply nested template. Make a new version of this
7190 template parameter, but with a lower level. */
7191 switch (TREE_CODE (t))
7193 case TEMPLATE_TYPE_PARM:
7194 case TEMPLATE_TEMPLATE_PARM:
7195 case BOUND_TEMPLATE_TEMPLATE_PARM:
7196 if (cp_type_quals (t))
7198 r = tsubst (TYPE_MAIN_VARIANT (t), args, complain, in_decl);
7199 r = cp_build_qualified_type_real
7200 (r, cp_type_quals (t),
7201 complain | (TREE_CODE (t) == TEMPLATE_TYPE_PARM
7202 ? tf_ignore_bad_quals : 0));
7207 TEMPLATE_TYPE_PARM_INDEX (r)
7208 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (t),
7210 TYPE_STUB_DECL (r) = TYPE_NAME (r) = TEMPLATE_TYPE_DECL (r);
7211 TYPE_MAIN_VARIANT (r) = r;
7212 TYPE_POINTER_TO (r) = NULL_TREE;
7213 TYPE_REFERENCE_TO (r) = NULL_TREE;
7215 if (TREE_CODE (t) == BOUND_TEMPLATE_TEMPLATE_PARM)
7217 tree argvec = tsubst (TYPE_TI_ARGS (t), args,
7219 if (argvec == error_mark_node)
7220 return error_mark_node;
7222 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (r)
7223 = tree_cons (TYPE_TI_TEMPLATE (t), argvec, NULL_TREE);
7228 case TEMPLATE_PARM_INDEX:
7229 r = reduce_template_parm_level (t, type, levels);
7241 tree purpose, value, chain;
7243 if (t == void_list_node)
7246 purpose = TREE_PURPOSE (t);
7249 purpose = tsubst (purpose, args, complain, in_decl);
7250 if (purpose == error_mark_node)
7251 return error_mark_node;
7253 value = TREE_VALUE (t);
7256 value = tsubst (value, args, complain, in_decl);
7257 if (value == error_mark_node)
7258 return error_mark_node;
7260 chain = TREE_CHAIN (t);
7261 if (chain && chain != void_type_node)
7263 chain = tsubst (chain, args, complain, in_decl);
7264 if (chain == error_mark_node)
7265 return error_mark_node;
7267 if (purpose == TREE_PURPOSE (t)
7268 && value == TREE_VALUE (t)
7269 && chain == TREE_CHAIN (t))
7271 return hash_tree_cons (purpose, value, chain);
7275 /* We should never be tsubsting a binfo. */
7279 /* A vector of template arguments. */
7281 return tsubst_template_args (t, args, complain, in_decl);
7284 case REFERENCE_TYPE:
7286 enum tree_code code;
7288 if (type == TREE_TYPE (t) && TREE_CODE (type) != METHOD_TYPE)
7291 code = TREE_CODE (t);
7296 Type deduction may fail for any of the following
7299 -- Attempting to create a pointer to reference type.
7300 -- Attempting to create a reference to a reference type or
7301 a reference to void. */
7302 if (TREE_CODE (type) == REFERENCE_TYPE
7303 || (code == REFERENCE_TYPE && TREE_CODE (type) == VOID_TYPE))
7305 static location_t last_loc;
7307 /* We keep track of the last time we issued this error
7308 message to avoid spewing a ton of messages during a
7309 single bad template instantiation. */
7310 if (complain & tf_error
7311 #ifdef USE_MAPPED_LOCATION
7312 && last_loc != input_location
7314 && (last_loc.line != input_line
7315 || last_loc.file != input_filename)
7319 if (TREE_CODE (type) == VOID_TYPE)
7320 error ("forming reference to void");
7322 error ("forming %s to reference type %qT",
7323 (code == POINTER_TYPE) ? "pointer" : "reference",
7325 last_loc = input_location;
7328 return error_mark_node;
7330 else if (code == POINTER_TYPE)
7332 r = build_pointer_type (type);
7333 if (TREE_CODE (type) == METHOD_TYPE)
7334 r = build_ptrmemfunc_type (r);
7337 r = build_reference_type (type);
7338 r = cp_build_qualified_type_real (r, TYPE_QUALS (t), complain);
7340 if (r != error_mark_node)
7341 /* Will this ever be needed for TYPE_..._TO values? */
7348 r = tsubst (TYPE_OFFSET_BASETYPE (t), args, complain, in_decl);
7349 if (r == error_mark_node || !IS_AGGR_TYPE (r))
7353 Type deduction may fail for any of the following
7356 -- Attempting to create "pointer to member of T" when T
7357 is not a class type. */
7358 if (complain & tf_error)
7359 error ("creating pointer to member of non-class type %qT", r);
7360 return error_mark_node;
7362 if (TREE_CODE (type) == REFERENCE_TYPE)
7364 if (complain & tf_error)
7365 error ("creating pointer to member reference type %qT", type);
7366 return error_mark_node;
7368 if (TREE_CODE (type) == VOID_TYPE)
7370 if (complain & tf_error)
7371 error ("creating pointer to member of type void");
7372 return error_mark_node;
7374 gcc_assert (TREE_CODE (type) != METHOD_TYPE);
7375 if (TREE_CODE (type) == FUNCTION_TYPE)
7377 /* The type of the implicit object parameter gets its
7378 cv-qualifiers from the FUNCTION_TYPE. */
7380 tree this_type = cp_build_qualified_type (TYPE_MAIN_VARIANT (r),
7381 cp_type_quals (type));
7383 method_type = build_method_type_directly (this_type,
7385 TYPE_ARG_TYPES (type));
7386 memptr = build_ptrmemfunc_type (build_pointer_type (method_type));
7387 return cp_build_qualified_type_real (memptr, cp_type_quals (t),
7391 return cp_build_qualified_type_real (build_ptrmem_type (r, type),
7400 fntype = tsubst_function_type (t, args, complain, in_decl);
7401 if (fntype == error_mark_node)
7402 return error_mark_node;
7404 /* Substitute the exception specification. */
7405 specs = tsubst_exception_specification (t, args, complain,
7407 if (specs == error_mark_node)
7408 return error_mark_node;
7410 fntype = build_exception_variant (fntype, specs);
7415 tree domain = tsubst (TYPE_DOMAIN (t), args, complain, in_decl);
7416 if (domain == error_mark_node)
7417 return error_mark_node;
7419 /* As an optimization, we avoid regenerating the array type if
7420 it will obviously be the same as T. */
7421 if (type == TREE_TYPE (t) && domain == TYPE_DOMAIN (t))
7424 /* These checks should match the ones in grokdeclarator.
7428 The deduction may fail for any of the following reasons:
7430 -- Attempting to create an array with an element type that
7431 is void, a function type, or a reference type, or [DR337]
7432 an abstract class type. */
7433 if (TREE_CODE (type) == VOID_TYPE
7434 || TREE_CODE (type) == FUNCTION_TYPE
7435 || TREE_CODE (type) == REFERENCE_TYPE)
7437 if (complain & tf_error)
7438 error ("creating array of %qT", type);
7439 return error_mark_node;
7441 if (CLASS_TYPE_P (type) && CLASSTYPE_PURE_VIRTUALS (type))
7443 if (complain & tf_error)
7444 error ("creating array of %qT, which is an abstract class type",
7446 return error_mark_node;
7449 r = build_cplus_array_type (type, domain);
7456 tree e1 = tsubst (TREE_OPERAND (t, 0), args, complain, in_decl);
7457 tree e2 = tsubst (TREE_OPERAND (t, 1), args, complain, in_decl);
7459 if (e1 == error_mark_node || e2 == error_mark_node)
7460 return error_mark_node;
7462 return fold_build2 (TREE_CODE (t), TREE_TYPE (t), e1, e2);
7468 tree e = tsubst (TREE_OPERAND (t, 0), args, complain, in_decl);
7469 if (e == error_mark_node)
7470 return error_mark_node;
7472 return fold_build1 (TREE_CODE (t), TREE_TYPE (t), e);
7477 tree ctx = tsubst_aggr_type (TYPE_CONTEXT (t), args, complain,
7478 in_decl, /*entering_scope=*/1);
7479 tree f = tsubst_copy (TYPENAME_TYPE_FULLNAME (t), args,
7482 if (ctx == error_mark_node || f == error_mark_node)
7483 return error_mark_node;
7485 if (!IS_AGGR_TYPE (ctx))
7487 if (complain & tf_error)
7488 error ("%qT is not a class, struct, or union type", ctx);
7489 return error_mark_node;
7491 else if (!uses_template_parms (ctx) && !TYPE_BEING_DEFINED (ctx))
7493 /* Normally, make_typename_type does not require that the CTX
7494 have complete type in order to allow things like:
7496 template <class T> struct S { typename S<T>::X Y; };
7498 But, such constructs have already been resolved by this
7499 point, so here CTX really should have complete type, unless
7500 it's a partial instantiation. */
7501 ctx = complete_type (ctx);
7502 if (!COMPLETE_TYPE_P (ctx))
7504 if (complain & tf_error)
7505 cxx_incomplete_type_error (NULL_TREE, ctx);
7506 return error_mark_node;
7510 f = make_typename_type (ctx, f, typename_type,
7511 (complain & tf_error) | tf_keep_type_decl);
7512 if (f == error_mark_node)
7514 if (TREE_CODE (f) == TYPE_DECL)
7516 complain |= tf_ignore_bad_quals;
7520 if (TREE_CODE (f) != TYPENAME_TYPE)
7522 if (TYPENAME_IS_ENUM_P (t) && TREE_CODE (f) != ENUMERAL_TYPE)
7523 error ("%qT resolves to %qT, which is not an enumeration type",
7525 else if (TYPENAME_IS_CLASS_P (t) && !CLASS_TYPE_P (f))
7526 error ("%qT resolves to %qT, which is is not a class type",
7530 return cp_build_qualified_type_real
7531 (f, cp_type_quals (f) | cp_type_quals (t), complain);
7534 case UNBOUND_CLASS_TEMPLATE:
7536 tree ctx = tsubst_aggr_type (TYPE_CONTEXT (t), args, complain,
7537 in_decl, /*entering_scope=*/1);
7538 tree name = TYPE_IDENTIFIER (t);
7539 tree parm_list = DECL_TEMPLATE_PARMS (TYPE_NAME (t));
7541 if (ctx == error_mark_node || name == error_mark_node)
7542 return error_mark_node;
7545 parm_list = tsubst_template_parms (parm_list, args, complain);
7546 return make_unbound_class_template (ctx, name, parm_list, complain);
7556 tree e1 = tsubst (TREE_OPERAND (t, 0), args, complain, in_decl);
7557 tree e2 = tsubst_expr (TREE_OPERAND (t, 1), args, complain, in_decl);
7558 if (e1 == error_mark_node || e2 == error_mark_node)
7559 return error_mark_node;
7561 return build_nt (ARRAY_REF, e1, e2, NULL_TREE, NULL_TREE);
7566 tree e1 = tsubst (TREE_OPERAND (t, 0), args, complain, in_decl);
7567 tree e2 = tsubst (TREE_OPERAND (t, 1), args, complain, in_decl);
7568 if (e1 == error_mark_node || e2 == error_mark_node)
7569 return error_mark_node;
7571 return build_qualified_name (/*type=*/NULL_TREE,
7572 e1, e2, QUALIFIED_NAME_IS_TEMPLATE (t));
7579 type = finish_typeof (tsubst_expr (TYPEOF_TYPE_EXPR (t), args,
7580 complain, in_decl));
7581 return cp_build_qualified_type_real (type,
7583 | cp_type_quals (type),
7588 sorry ("use of %qs in template",
7589 tree_code_name [(int) TREE_CODE (t)]);
7590 return error_mark_node;
7594 /* Like tsubst_expr for a BASELINK. OBJECT_TYPE, if non-NULL, is the
7595 type of the expression on the left-hand side of the "." or "->"
7599 tsubst_baselink (tree baselink, tree object_type,
7600 tree args, tsubst_flags_t complain, tree in_decl)
7603 tree qualifying_scope;
7605 tree template_args = 0;
7606 bool template_id_p = false;
7608 /* A baselink indicates a function from a base class. The
7609 BASELINK_ACCESS_BINFO and BASELINK_BINFO are going to have
7610 non-dependent types; otherwise, the lookup could not have
7611 succeeded. However, they may indicate bases of the template
7612 class, rather than the instantiated class.
7614 In addition, lookups that were not ambiguous before may be
7615 ambiguous now. Therefore, we perform the lookup again. */
7616 qualifying_scope = BINFO_TYPE (BASELINK_ACCESS_BINFO (baselink));
7617 fns = BASELINK_FUNCTIONS (baselink);
7618 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)
7620 template_id_p = true;
7621 template_args = TREE_OPERAND (fns, 1);
7622 fns = TREE_OPERAND (fns, 0);
7624 template_args = tsubst_template_args (template_args, args,
7627 name = DECL_NAME (get_first_fn (fns));
7628 baselink = lookup_fnfields (qualifying_scope, name, /*protect=*/1);
7630 /* If lookup found a single function, mark it as used at this
7631 point. (If it lookup found multiple functions the one selected
7632 later by overload resolution will be marked as used at that
7634 if (BASELINK_P (baselink))
7635 fns = BASELINK_FUNCTIONS (baselink);
7636 if (!template_id_p && !really_overloaded_fn (fns))
7637 mark_used (OVL_CURRENT (fns));
7639 /* Add back the template arguments, if present. */
7640 if (BASELINK_P (baselink) && template_id_p)
7641 BASELINK_FUNCTIONS (baselink)
7642 = build_nt (TEMPLATE_ID_EXPR,
7643 BASELINK_FUNCTIONS (baselink),
7647 object_type = current_class_type;
7648 return adjust_result_of_qualified_name_lookup (baselink,
7653 /* Like tsubst_expr for a SCOPE_REF, given by QUALIFIED_ID. DONE is
7654 true if the qualified-id will be a postfix-expression in-and-of
7655 itself; false if more of the postfix-expression follows the
7656 QUALIFIED_ID. ADDRESS_P is true if the qualified-id is the operand
7660 tsubst_qualified_id (tree qualified_id, tree args,
7661 tsubst_flags_t complain, tree in_decl,
7662 bool done, bool address_p)
7670 gcc_assert (TREE_CODE (qualified_id) == SCOPE_REF);
7672 /* Figure out what name to look up. */
7673 name = TREE_OPERAND (qualified_id, 1);
7674 if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
7677 template_args = TREE_OPERAND (name, 1);
7679 template_args = tsubst_template_args (template_args, args,
7681 name = TREE_OPERAND (name, 0);
7685 is_template = false;
7686 template_args = NULL_TREE;
7689 /* Substitute into the qualifying scope. When there are no ARGS, we
7690 are just trying to simplify a non-dependent expression. In that
7691 case the qualifying scope may be dependent, and, in any case,
7692 substituting will not help. */
7693 scope = TREE_OPERAND (qualified_id, 0);
7696 scope = tsubst (scope, args, complain, in_decl);
7697 expr = tsubst_copy (name, args, complain, in_decl);
7702 if (dependent_type_p (scope))
7703 return build_qualified_name (/*type=*/NULL_TREE,
7705 QUALIFIED_NAME_IS_TEMPLATE (qualified_id));
7707 if (!BASELINK_P (name) && !DECL_P (expr))
7709 if (TREE_CODE (expr) == BIT_NOT_EXPR)
7710 /* If this were actually a destructor call, it would have been
7711 parsed as such by the parser. */
7712 expr = error_mark_node;
7714 expr = lookup_qualified_name (scope, expr, /*is_type_p=*/0, false);
7715 if (TREE_CODE (TREE_CODE (expr) == TEMPLATE_DECL
7716 ? DECL_TEMPLATE_RESULT (expr) : expr) == TYPE_DECL)
7718 if (complain & tf_error)
7720 error ("dependent-name %qE is parsed as a non-type, but "
7721 "instantiation yields a type", qualified_id);
7722 inform ("say %<typename %E%> if a type is meant", qualified_id);
7724 return error_mark_node;
7730 check_accessibility_of_qualified_id (expr, /*object_type=*/NULL_TREE,
7732 /* Remember that there was a reference to this entity. */
7736 if (expr == error_mark_node || TREE_CODE (expr) == TREE_LIST)
7738 if (complain & tf_error)
7739 qualified_name_lookup_error (scope,
7740 TREE_OPERAND (qualified_id, 1),
7742 return error_mark_node;
7746 expr = lookup_template_function (expr, template_args);
7748 if (expr == error_mark_node && complain & tf_error)
7749 qualified_name_lookup_error (scope, TREE_OPERAND (qualified_id, 1),
7751 else if (TYPE_P (scope))
7753 expr = (adjust_result_of_qualified_name_lookup
7754 (expr, scope, current_class_type));
7755 expr = (finish_qualified_id_expr
7756 (scope, expr, done, address_p,
7757 QUALIFIED_NAME_IS_TEMPLATE (qualified_id),
7758 /*template_arg_p=*/false));
7761 if (TREE_CODE (expr) != SCOPE_REF)
7762 expr = convert_from_reference (expr);
7767 /* Like tsubst, but deals with expressions. This function just replaces
7768 template parms; to finish processing the resultant expression, use
7772 tsubst_copy (tree t, tree args, tsubst_flags_t complain, tree in_decl)
7774 enum tree_code code;
7777 if (t == NULL_TREE || t == error_mark_node)
7780 code = TREE_CODE (t);
7785 r = retrieve_local_specialization (t);
7786 gcc_assert (r != NULL);
7795 if (DECL_TEMPLATE_PARM_P (t))
7796 return tsubst_copy (DECL_INITIAL (t), args, complain, in_decl);
7797 /* There is no need to substitute into namespace-scope
7799 if (DECL_NAMESPACE_SCOPE_P (t))
7801 /* If ARGS is NULL, then T is known to be non-dependent. */
7802 if (args == NULL_TREE)
7803 return integral_constant_value (t);
7805 /* Unfortunately, we cannot just call lookup_name here.
7808 template <int I> int f() {
7810 struct S { void g() { E e = a; } };
7813 When we instantiate f<7>::S::g(), say, lookup_name is not
7814 clever enough to find f<7>::a. */
7816 = tsubst_aggr_type (TREE_TYPE (t), args, complain, in_decl,
7817 /*entering_scope=*/0);
7819 for (v = TYPE_VALUES (enum_type);
7822 if (TREE_PURPOSE (v) == DECL_NAME (t))
7823 return TREE_VALUE (v);
7825 /* We didn't find the name. That should never happen; if
7826 name-lookup found it during preliminary parsing, we
7827 should find it again here during instantiation. */
7833 if (DECL_CONTEXT (t))
7837 ctx = tsubst_aggr_type (DECL_CONTEXT (t), args, complain, in_decl,
7838 /*entering_scope=*/1);
7839 if (ctx != DECL_CONTEXT (t))
7841 tree r = lookup_field (ctx, DECL_NAME (t), 0, false);
7844 if (complain & tf_error)
7845 error ("using invalid field %qD", t);
7846 return error_mark_node;
7856 if ((DECL_LANG_SPECIFIC (t) && DECL_TEMPLATE_INFO (t))
7857 || local_variable_p (t))
7858 t = tsubst (t, args, complain, in_decl);
7863 return tsubst_baselink (t, current_class_type, args, complain, in_decl);
7866 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t))
7867 return tsubst (TREE_TYPE (DECL_TEMPLATE_RESULT (t)),
7868 args, complain, in_decl);
7869 else if (DECL_FUNCTION_TEMPLATE_P (t) && DECL_MEMBER_TEMPLATE_P (t))
7870 return tsubst (t, args, complain, in_decl);
7871 else if (DECL_CLASS_SCOPE_P (t)
7872 && uses_template_parms (DECL_CONTEXT (t)))
7874 /* Template template argument like the following example need
7877 template <template <class> class TT> struct C {};
7878 template <class T> struct D {
7879 template <class U> struct E {};
7884 We are processing the template argument `E' in #1 for
7885 the template instantiation #2. Originally, `E' is a
7886 TEMPLATE_DECL with `D<T>' as its DECL_CONTEXT. Now we
7887 have to substitute this with one having context `D<int>'. */
7889 tree context = tsubst (DECL_CONTEXT (t), args, complain, in_decl);
7890 return lookup_field (context, DECL_NAME(t), 0, false);
7893 /* Ordinary template template argument. */
7897 case REINTERPRET_CAST_EXPR:
7898 case CONST_CAST_EXPR:
7899 case STATIC_CAST_EXPR:
7900 case DYNAMIC_CAST_EXPR:
7903 (code, tsubst (TREE_TYPE (t), args, complain, in_decl),
7904 tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl));
7908 case TRUTH_NOT_EXPR:
7911 case UNARY_PLUS_EXPR: /* Unary + */
7920 (code, tsubst (TREE_TYPE (t), args, complain, in_decl),
7921 tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl));
7928 object = tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl);
7929 name = TREE_OPERAND (t, 1);
7930 if (TREE_CODE (name) == BIT_NOT_EXPR)
7932 name = tsubst_copy (TREE_OPERAND (name, 0), args,
7934 name = build1 (BIT_NOT_EXPR, NULL_TREE, name);
7936 else if (TREE_CODE (name) == SCOPE_REF
7937 && TREE_CODE (TREE_OPERAND (name, 1)) == BIT_NOT_EXPR)
7939 tree base = tsubst_copy (TREE_OPERAND (name, 0), args,
7941 name = TREE_OPERAND (name, 1);
7942 name = tsubst_copy (TREE_OPERAND (name, 0), args,
7944 name = build1 (BIT_NOT_EXPR, NULL_TREE, name);
7945 name = build_qualified_name (/*type=*/NULL_TREE,
7947 /*template_p=*/false);
7949 else if (TREE_CODE (name) == BASELINK)
7950 name = tsubst_baselink (name,
7951 non_reference (TREE_TYPE (object)),
7955 name = tsubst_copy (name, args, complain, in_decl);
7956 return build_nt (COMPONENT_REF, object, name, NULL_TREE);
7962 case TRUNC_DIV_EXPR:
7964 case FLOOR_DIV_EXPR:
7965 case ROUND_DIV_EXPR:
7966 case EXACT_DIV_EXPR:
7970 case TRUNC_MOD_EXPR:
7971 case FLOOR_MOD_EXPR:
7972 case TRUTH_ANDIF_EXPR:
7973 case TRUTH_ORIF_EXPR:
7974 case TRUTH_AND_EXPR:
7991 case PREDECREMENT_EXPR:
7992 case PREINCREMENT_EXPR:
7993 case POSTDECREMENT_EXPR:
7994 case POSTINCREMENT_EXPR:
7996 (code, tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl),
7997 tsubst_copy (TREE_OPERAND (t, 1), args, complain, in_decl));
8000 return build_qualified_name (/*type=*/NULL_TREE,
8001 tsubst_copy (TREE_OPERAND (t, 0),
8002 args, complain, in_decl),
8003 tsubst_copy (TREE_OPERAND (t, 1),
8004 args, complain, in_decl),
8005 QUALIFIED_NAME_IS_TEMPLATE (t));
8010 tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl),
8011 tsubst_copy (TREE_OPERAND (t, 1), args, complain, in_decl),
8012 NULL_TREE, NULL_TREE);
8015 return build_nt (code,
8016 tsubst_copy (TREE_OPERAND (t, 0), args,
8018 tsubst_copy (TREE_OPERAND (t, 1), args, complain,
8024 case PSEUDO_DTOR_EXPR:
8027 (code, tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl),
8028 tsubst_copy (TREE_OPERAND (t, 1), args, complain, in_decl),
8029 tsubst_copy (TREE_OPERAND (t, 2), args, complain, in_decl));
8030 TREE_NO_WARNING (r) = TREE_NO_WARNING (t);
8037 (code, tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl),
8038 tsubst_copy (TREE_OPERAND (t, 1), args, complain, in_decl),
8039 tsubst_copy (TREE_OPERAND (t, 2), args, complain, in_decl));
8040 NEW_EXPR_USE_GLOBAL (r) = NEW_EXPR_USE_GLOBAL (t);
8047 (code, tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl),
8048 tsubst_copy (TREE_OPERAND (t, 1), args, complain, in_decl));
8049 DELETE_EXPR_USE_GLOBAL (r) = DELETE_EXPR_USE_GLOBAL (t);
8050 DELETE_EXPR_USE_VEC (r) = DELETE_EXPR_USE_VEC (t);
8054 case TEMPLATE_ID_EXPR:
8056 /* Substituted template arguments */
8057 tree fn = TREE_OPERAND (t, 0);
8058 tree targs = TREE_OPERAND (t, 1);
8060 fn = tsubst_copy (fn, args, complain, in_decl);
8062 targs = tsubst_template_args (targs, args, complain, in_decl);
8064 return lookup_template_function (fn, targs);
8069 tree purpose, value, chain;
8071 if (t == void_list_node)
8074 purpose = TREE_PURPOSE (t);
8076 purpose = tsubst_copy (purpose, args, complain, in_decl);
8077 value = TREE_VALUE (t);
8079 value = tsubst_copy (value, args, complain, in_decl);
8080 chain = TREE_CHAIN (t);
8081 if (chain && chain != void_type_node)
8082 chain = tsubst_copy (chain, args, complain, in_decl);
8083 if (purpose == TREE_PURPOSE (t)
8084 && value == TREE_VALUE (t)
8085 && chain == TREE_CHAIN (t))
8087 return tree_cons (purpose, value, chain);
8094 case TEMPLATE_TYPE_PARM:
8095 case TEMPLATE_TEMPLATE_PARM:
8096 case BOUND_TEMPLATE_TEMPLATE_PARM:
8097 case TEMPLATE_PARM_INDEX:
8099 case REFERENCE_TYPE:
8105 case UNBOUND_CLASS_TEMPLATE:
8108 return tsubst (t, args, complain, in_decl);
8110 case IDENTIFIER_NODE:
8111 if (IDENTIFIER_TYPENAME_P (t))
8113 tree new_type = tsubst (TREE_TYPE (t), args, complain, in_decl);
8114 return mangle_conv_op_name_for_type (new_type);
8120 /* This is handled by tsubst_copy_and_build. */
8124 return build_x_va_arg (tsubst_copy (TREE_OPERAND (t, 0), args, complain,
8126 tsubst (TREE_TYPE (t), args, complain, in_decl));
8128 case CLEANUP_POINT_EXPR:
8129 /* We shouldn't have built any of these during initial template
8130 generation. Instead, they should be built during instantiation
8131 in response to the saved STMT_IS_FULL_EXPR_P setting. */
8139 /* Like tsubst_copy_and_build, but unshare TREE_LIST nodes. */
8142 tsubst_copy_asm_operands (tree t, tree args, tsubst_flags_t complain,
8145 #define RECUR(t) tsubst_copy_asm_operands (t, args, complain, in_decl)
8147 tree purpose, value, chain;
8152 if (TREE_CODE (t) != TREE_LIST)
8153 return tsubst_copy_and_build (t, args, complain, in_decl,
8154 /*function_p=*/false);
8156 if (t == void_list_node)
8159 purpose = TREE_PURPOSE (t);
8161 purpose = RECUR (purpose);
8162 value = TREE_VALUE (t);
8164 value = RECUR (value);
8165 chain = TREE_CHAIN (t);
8166 if (chain && chain != void_type_node)
8167 chain = RECUR (chain);
8168 return tree_cons (purpose, value, chain);
8172 /* Like tsubst_copy for expressions, etc. but also does semantic
8176 tsubst_expr (tree t, tree args, tsubst_flags_t complain, tree in_decl)
8180 if (t == NULL_TREE || t == error_mark_node)
8183 if (EXPR_HAS_LOCATION (t))
8184 input_location = EXPR_LOCATION (t);
8185 if (STATEMENT_CODE_P (TREE_CODE (t)))
8186 current_stmt_tree ()->stmts_are_full_exprs_p = STMT_IS_FULL_EXPR_P (t);
8188 switch (TREE_CODE (t))
8190 case STATEMENT_LIST:
8192 tree_stmt_iterator i;
8193 for (i = tsi_start (t); !tsi_end_p (i); tsi_next (&i))
8194 tsubst_expr (tsi_stmt (i), args, complain, in_decl);
8198 case CTOR_INITIALIZER:
8199 finish_mem_initializers (tsubst_initializer_list
8200 (TREE_OPERAND (t, 0), args));
8204 finish_return_stmt (tsubst_expr (TREE_OPERAND (t, 0),
8205 args, complain, in_decl));
8209 tmp = tsubst_expr (EXPR_STMT_EXPR (t), args, complain, in_decl);
8210 if (EXPR_STMT_STMT_EXPR_RESULT (t))
8211 finish_stmt_expr_expr (tmp, cur_stmt_expr);
8213 finish_expr_stmt (tmp);
8217 do_using_directive (tsubst_expr (USING_STMT_NAMESPACE (t),
8218 args, complain, in_decl));
8226 decl = DECL_EXPR_DECL (t);
8227 if (TREE_CODE (decl) == LABEL_DECL)
8228 finish_label_decl (DECL_NAME (decl));
8229 else if (TREE_CODE (decl) == USING_DECL)
8231 tree scope = USING_DECL_SCOPE (decl);
8232 tree name = DECL_NAME (decl);
8235 scope = tsubst_expr (scope, args, complain, in_decl);
8236 decl = lookup_qualified_name (scope, name,
8237 /*is_type_p=*/false,
8238 /*complain=*/false);
8239 if (decl == error_mark_node || TREE_CODE (decl) == TREE_LIST)
8240 qualified_name_lookup_error (scope, name, decl);
8242 do_local_using_decl (decl, scope, name);
8246 init = DECL_INITIAL (decl);
8247 decl = tsubst (decl, args, complain, in_decl);
8248 if (decl != error_mark_node)
8251 DECL_INITIAL (decl) = error_mark_node;
8252 /* By marking the declaration as instantiated, we avoid
8253 trying to instantiate it. Since instantiate_decl can't
8254 handle local variables, and since we've already done
8255 all that needs to be done, that's the right thing to
8257 if (TREE_CODE (decl) == VAR_DECL)
8258 DECL_TEMPLATE_INSTANTIATED (decl) = 1;
8259 if (TREE_CODE (decl) == VAR_DECL
8260 && ANON_AGGR_TYPE_P (TREE_TYPE (decl)))
8261 /* Anonymous aggregates are a special case. */
8262 finish_anon_union (decl);
8265 maybe_push_decl (decl);
8266 if (TREE_CODE (decl) == VAR_DECL
8267 && DECL_PRETTY_FUNCTION_P (decl))
8269 /* For __PRETTY_FUNCTION__ we have to adjust the
8271 const char *const name
8272 = cxx_printable_name (current_function_decl, 2);
8273 init = cp_fname_init (name, &TREE_TYPE (decl));
8276 init = tsubst_expr (init, args, complain, in_decl);
8277 cp_finish_decl (decl, init, NULL_TREE, 0);
8282 /* A DECL_EXPR can also be used as an expression, in the condition
8283 clause of an if/for/while construct. */
8288 stmt = begin_for_stmt ();
8289 tsubst_expr (FOR_INIT_STMT (t), args, complain, in_decl);
8290 finish_for_init_stmt (stmt);
8291 tmp = tsubst_expr (FOR_COND (t), args, complain, in_decl);
8292 finish_for_cond (tmp, stmt);
8293 tmp = tsubst_expr (FOR_EXPR (t), args, complain, in_decl);
8294 finish_for_expr (tmp, stmt);
8295 tsubst_expr (FOR_BODY (t), args, complain, in_decl);
8296 finish_for_stmt (stmt);
8300 stmt = begin_while_stmt ();
8301 tmp = tsubst_expr (WHILE_COND (t), args, complain, in_decl);
8302 finish_while_stmt_cond (tmp, stmt);
8303 tsubst_expr (WHILE_BODY (t), args, complain, in_decl);
8304 finish_while_stmt (stmt);
8308 stmt = begin_do_stmt ();
8309 tsubst_expr (DO_BODY (t), args, complain, in_decl);
8310 finish_do_body (stmt);
8311 tmp = tsubst_expr (DO_COND (t), args, complain, in_decl);
8312 finish_do_stmt (tmp, stmt);
8316 stmt = begin_if_stmt ();
8317 tmp = tsubst_expr (IF_COND (t), args, complain, in_decl);
8318 finish_if_stmt_cond (tmp, stmt);
8319 tsubst_expr (THEN_CLAUSE (t), args, complain, in_decl);
8320 finish_then_clause (stmt);
8322 if (ELSE_CLAUSE (t))
8324 begin_else_clause (stmt);
8325 tsubst_expr (ELSE_CLAUSE (t), args, complain, in_decl);
8326 finish_else_clause (stmt);
8329 finish_if_stmt (stmt);
8333 if (BIND_EXPR_BODY_BLOCK (t))
8334 stmt = begin_function_body ();
8336 stmt = begin_compound_stmt (BIND_EXPR_TRY_BLOCK (t)
8337 ? BCS_TRY_BLOCK : 0);
8339 tsubst_expr (BIND_EXPR_BODY (t), args, complain, in_decl);
8341 if (BIND_EXPR_BODY_BLOCK (t))
8342 finish_function_body (stmt);
8344 finish_compound_stmt (stmt);
8348 finish_break_stmt ();
8352 finish_continue_stmt ();
8356 stmt = begin_switch_stmt ();
8357 tmp = tsubst_expr (SWITCH_STMT_COND (t), args, complain, in_decl);
8358 finish_switch_cond (tmp, stmt);
8359 tsubst_expr (SWITCH_STMT_BODY (t), args, complain, in_decl);
8360 finish_switch_stmt (stmt);
8363 case CASE_LABEL_EXPR:
8364 finish_case_label (tsubst_expr (CASE_LOW (t), args, complain, in_decl),
8365 tsubst_expr (CASE_HIGH (t), args, complain,
8370 finish_label_stmt (DECL_NAME (LABEL_EXPR_LABEL (t)));
8374 tmp = GOTO_DESTINATION (t);
8375 if (TREE_CODE (tmp) != LABEL_DECL)
8376 /* Computed goto's must be tsubst'd into. On the other hand,
8377 non-computed gotos must not be; the identifier in question
8378 will have no binding. */
8379 tmp = tsubst_expr (tmp, args, complain, in_decl);
8381 tmp = DECL_NAME (tmp);
8382 finish_goto_stmt (tmp);
8386 tmp = finish_asm_stmt
8387 (ASM_VOLATILE_P (t),
8388 tsubst_expr (ASM_STRING (t), args, complain, in_decl),
8389 tsubst_copy_asm_operands (ASM_OUTPUTS (t), args, complain, in_decl),
8390 tsubst_copy_asm_operands (ASM_INPUTS (t), args, complain, in_decl),
8391 tsubst_copy_asm_operands (ASM_CLOBBERS (t), args, complain, in_decl));
8393 tree asm_expr = tmp;
8394 if (TREE_CODE (asm_expr) == CLEANUP_POINT_EXPR)
8395 asm_expr = TREE_OPERAND (asm_expr, 0);
8396 ASM_INPUT_P (asm_expr) = ASM_INPUT_P (t);
8403 stmt = begin_try_block ();
8404 tsubst_expr (TRY_STMTS (t), args, complain, in_decl);
8405 finish_cleanup_try_block (stmt);
8406 finish_cleanup (tsubst_expr (TRY_HANDLERS (t), args,
8412 if (FN_TRY_BLOCK_P (t))
8413 stmt = begin_function_try_block ();
8415 stmt = begin_try_block ();
8417 tsubst_expr (TRY_STMTS (t), args, complain, in_decl);
8419 if (FN_TRY_BLOCK_P (t))
8420 finish_function_try_block (stmt);
8422 finish_try_block (stmt);
8424 tsubst_expr (TRY_HANDLERS (t), args, complain, in_decl);
8425 if (FN_TRY_BLOCK_P (t))
8426 finish_function_handler_sequence (stmt);
8428 finish_handler_sequence (stmt);
8436 stmt = begin_handler ();
8437 if (HANDLER_PARMS (t))
8439 decl = HANDLER_PARMS (t);
8440 decl = tsubst (decl, args, complain, in_decl);
8441 /* Prevent instantiate_decl from trying to instantiate
8442 this variable. We've already done all that needs to be
8444 DECL_TEMPLATE_INSTANTIATED (decl) = 1;
8448 finish_handler_parms (decl, stmt);
8449 tsubst_expr (HANDLER_BODY (t), args, complain, in_decl);
8450 finish_handler (stmt);
8455 tsubst (TREE_TYPE (t), args, complain, NULL_TREE);
8459 gcc_assert (!STATEMENT_CODE_P (TREE_CODE (t)));
8461 return tsubst_copy_and_build (t, args, complain, in_decl,
8462 /*function_p=*/false);
8468 /* T is a postfix-expression that is not being used in a function
8469 call. Return the substituted version of T. */
8472 tsubst_non_call_postfix_expression (tree t, tree args,
8473 tsubst_flags_t complain,
8476 if (TREE_CODE (t) == SCOPE_REF)
8477 t = tsubst_qualified_id (t, args, complain, in_decl,
8478 /*done=*/false, /*address_p=*/false);
8480 t = tsubst_copy_and_build (t, args, complain, in_decl,
8481 /*function_p=*/false);
8486 /* Like tsubst but deals with expressions and performs semantic
8487 analysis. FUNCTION_P is true if T is the "F" in "F (ARGS)". */
8490 tsubst_copy_and_build (tree t,
8492 tsubst_flags_t complain,
8496 #define RECUR(NODE) \
8497 tsubst_copy_and_build (NODE, args, complain, in_decl, /*function_p=*/false)
8501 if (t == NULL_TREE || t == error_mark_node)
8504 switch (TREE_CODE (t))
8509 case IDENTIFIER_NODE:
8513 bool non_integral_constant_expression_p;
8514 const char *error_msg;
8516 if (IDENTIFIER_TYPENAME_P (t))
8518 tree new_type = tsubst (TREE_TYPE (t), args, complain, in_decl);
8519 t = mangle_conv_op_name_for_type (new_type);
8522 /* Look up the name. */
8523 decl = lookup_name (t, 0);
8525 /* By convention, expressions use ERROR_MARK_NODE to indicate
8526 failure, not NULL_TREE. */
8527 if (decl == NULL_TREE)
8528 decl = error_mark_node;
8530 decl = finish_id_expression (t, decl, NULL_TREE,
8532 /*integral_constant_expression_p=*/false,
8533 /*allow_non_integral_constant_expression_p=*/false,
8534 &non_integral_constant_expression_p,
8535 /*template_p=*/false,
8537 /*address_p=*/false,
8538 /*template_arg_p=*/false,
8542 if (!function_p && TREE_CODE (decl) == IDENTIFIER_NODE)
8543 decl = unqualified_name_lookup_error (decl);
8547 case TEMPLATE_ID_EXPR:
8550 tree template = RECUR (TREE_OPERAND (t, 0));
8551 tree targs = TREE_OPERAND (t, 1);
8554 targs = tsubst_template_args (targs, args, complain, in_decl);
8556 if (TREE_CODE (template) == COMPONENT_REF)
8558 object = TREE_OPERAND (template, 0);
8559 template = TREE_OPERAND (template, 1);
8563 template = lookup_template_function (template, targs);
8566 return build3 (COMPONENT_REF, TREE_TYPE (template),
8567 object, template, NULL_TREE);
8574 tree r = RECUR (TREE_OPERAND (t, 0));
8576 if (REFERENCE_REF_P (t))
8578 /* A type conversion to reference type will be enclosed in
8579 such an indirect ref, but the substitution of the cast
8580 will have also added such an indirect ref. */
8581 if (TREE_CODE (TREE_TYPE (r)) == REFERENCE_TYPE)
8582 r = convert_from_reference (r);
8585 r = build_x_indirect_ref (r, "unary *");
8591 (tsubst (TREE_TYPE (t), args, complain, in_decl),
8592 RECUR (TREE_OPERAND (t, 0)));
8595 return build_functional_cast
8596 (tsubst (TREE_TYPE (t), args, complain, in_decl),
8597 RECUR (TREE_OPERAND (t, 0)));
8599 case REINTERPRET_CAST_EXPR:
8600 return build_reinterpret_cast
8601 (tsubst (TREE_TYPE (t), args, complain, in_decl),
8602 RECUR (TREE_OPERAND (t, 0)));
8604 case CONST_CAST_EXPR:
8605 return build_const_cast
8606 (tsubst (TREE_TYPE (t), args, complain, in_decl),
8607 RECUR (TREE_OPERAND (t, 0)));
8609 case DYNAMIC_CAST_EXPR:
8610 return build_dynamic_cast
8611 (tsubst (TREE_TYPE (t), args, complain, in_decl),
8612 RECUR (TREE_OPERAND (t, 0)));
8614 case STATIC_CAST_EXPR:
8615 return build_static_cast
8616 (tsubst (TREE_TYPE (t), args, complain, in_decl),
8617 RECUR (TREE_OPERAND (t, 0)));
8619 case POSTDECREMENT_EXPR:
8620 case POSTINCREMENT_EXPR:
8621 op1 = tsubst_non_call_postfix_expression (TREE_OPERAND (t, 0),
8622 args, complain, in_decl);
8623 return build_x_unary_op (TREE_CODE (t), op1);
8625 case PREDECREMENT_EXPR:
8626 case PREINCREMENT_EXPR:
8630 case TRUTH_NOT_EXPR:
8631 case UNARY_PLUS_EXPR: /* Unary + */
8634 return build_x_unary_op (TREE_CODE (t), RECUR (TREE_OPERAND (t, 0)));
8637 op1 = TREE_OPERAND (t, 0);
8638 if (TREE_CODE (op1) == SCOPE_REF)
8639 op1 = tsubst_qualified_id (op1, args, complain, in_decl,
8640 /*done=*/true, /*address_p=*/true);
8642 op1 = tsubst_non_call_postfix_expression (op1, args, complain,
8644 if (TREE_CODE (op1) == LABEL_DECL)
8645 return finish_label_address_expr (DECL_NAME (op1));
8646 return build_x_unary_op (ADDR_EXPR, op1);
8651 case TRUNC_DIV_EXPR:
8653 case FLOOR_DIV_EXPR:
8654 case ROUND_DIV_EXPR:
8655 case EXACT_DIV_EXPR:
8659 case TRUNC_MOD_EXPR:
8660 case FLOOR_MOD_EXPR:
8661 case TRUTH_ANDIF_EXPR:
8662 case TRUTH_ORIF_EXPR:
8663 case TRUTH_AND_EXPR:
8679 return build_x_binary_op
8681 RECUR (TREE_OPERAND (t, 0)),
8682 RECUR (TREE_OPERAND (t, 1)),
8683 /*overloaded_p=*/NULL);
8686 return tsubst_qualified_id (t, args, complain, in_decl, /*done=*/true,
8687 /*address_p=*/false);
8689 op1 = tsubst_non_call_postfix_expression (TREE_OPERAND (t, 0),
8690 args, complain, in_decl);
8691 return build_x_binary_op (ARRAY_REF, op1, RECUR (TREE_OPERAND (t, 1)),
8692 /*overloaded_p=*/NULL);
8696 op1 = TREE_OPERAND (t, 0);
8699 /* When there are no ARGS, we are trying to evaluate a
8700 non-dependent expression from the parser. Trying to do
8701 the substitutions may not work. */
8703 op1 = TREE_TYPE (op1);
8712 return cxx_sizeof_or_alignof_type (op1, TREE_CODE (t), true);
8714 return cxx_sizeof_or_alignof_expr (op1, TREE_CODE (t));
8718 tree r = build_x_modify_expr
8719 (RECUR (TREE_OPERAND (t, 0)),
8720 TREE_CODE (TREE_OPERAND (t, 1)),
8721 RECUR (TREE_OPERAND (t, 2)));
8722 /* TREE_NO_WARNING must be set if either the expression was
8723 parenthesized or it uses an operator such as >>= rather
8724 than plain assignment. In the former case, it was already
8725 set and must be copied. In the latter case,
8726 build_x_modify_expr sets it and it must not be reset
8728 if (TREE_NO_WARNING (t))
8729 TREE_NO_WARNING (r) = TREE_NO_WARNING (t);
8734 op1 = tsubst_non_call_postfix_expression (TREE_OPERAND (t, 0),
8735 args, complain, in_decl);
8736 /* Remember that there was a reference to this entity. */
8739 return build_x_arrow (op1);
8743 (RECUR (TREE_OPERAND (t, 0)),
8744 RECUR (TREE_OPERAND (t, 1)),
8745 RECUR (TREE_OPERAND (t, 2)),
8746 RECUR (TREE_OPERAND (t, 3)),
8747 NEW_EXPR_USE_GLOBAL (t));
8750 return delete_sanity
8751 (RECUR (TREE_OPERAND (t, 0)),
8752 RECUR (TREE_OPERAND (t, 1)),
8753 DELETE_EXPR_USE_VEC (t),
8754 DELETE_EXPR_USE_GLOBAL (t));
8757 return build_x_compound_expr (RECUR (TREE_OPERAND (t, 0)),
8758 RECUR (TREE_OPERAND (t, 1)));
8767 function = TREE_OPERAND (t, 0);
8768 /* When we parsed the expression, we determined whether or
8769 not Koenig lookup should be performed. */
8770 koenig_p = KOENIG_LOOKUP_P (t);
8771 if (TREE_CODE (function) == SCOPE_REF)
8774 function = tsubst_qualified_id (function, args, complain, in_decl,
8776 /*address_p=*/false);
8780 if (TREE_CODE (function) == COMPONENT_REF)
8782 tree op = TREE_OPERAND (function, 1);
8784 qualified_p = (TREE_CODE (op) == SCOPE_REF
8786 && BASELINK_QUALIFIED_P (op)));
8789 qualified_p = false;
8791 function = tsubst_copy_and_build (function, args, complain,
8794 if (BASELINK_P (function))
8798 call_args = RECUR (TREE_OPERAND (t, 1));
8800 /* We do not perform argument-dependent lookup if normal
8801 lookup finds a non-function, in accordance with the
8802 expected resolution of DR 218. */
8804 && ((is_overloaded_fn (function)
8805 /* If lookup found a member function, the Koenig lookup is
8806 not appropriate, even if an unqualified-name was used
8807 to denote the function. */
8808 && !DECL_FUNCTION_MEMBER_P (get_first_fn (function)))
8809 || TREE_CODE (function) == IDENTIFIER_NODE))
8810 function = perform_koenig_lookup (function, call_args);
8812 if (TREE_CODE (function) == IDENTIFIER_NODE)
8814 unqualified_name_lookup_error (function);
8815 return error_mark_node;
8818 /* Remember that there was a reference to this entity. */
8819 if (DECL_P (function))
8820 mark_used (function);
8822 if (TREE_CODE (function) == OFFSET_REF)
8823 return build_offset_ref_call_from_tree (function, call_args);
8824 if (TREE_CODE (function) == COMPONENT_REF)
8826 if (!BASELINK_P (TREE_OPERAND (function, 1)))
8827 return finish_call_expr (function, call_args,
8828 /*disallow_virtual=*/false,
8829 /*koenig_p=*/false);
8831 return (build_new_method_call
8832 (TREE_OPERAND (function, 0),
8833 TREE_OPERAND (function, 1),
8834 call_args, NULL_TREE,
8835 qualified_p ? LOOKUP_NONVIRTUAL : LOOKUP_NORMAL));
8837 return finish_call_expr (function, call_args,
8838 /*disallow_virtual=*/qualified_p,
8843 return build_x_conditional_expr
8844 (RECUR (TREE_OPERAND (t, 0)),
8845 RECUR (TREE_OPERAND (t, 1)),
8846 RECUR (TREE_OPERAND (t, 2)));
8848 case PSEUDO_DTOR_EXPR:
8849 return finish_pseudo_destructor_expr
8850 (RECUR (TREE_OPERAND (t, 0)),
8851 RECUR (TREE_OPERAND (t, 1)),
8852 RECUR (TREE_OPERAND (t, 2)));
8856 tree purpose, value, chain;
8858 if (t == void_list_node)
8861 purpose = TREE_PURPOSE (t);
8863 purpose = RECUR (purpose);
8864 value = TREE_VALUE (t);
8866 value = RECUR (value);
8867 chain = TREE_CHAIN (t);
8868 if (chain && chain != void_type_node)
8869 chain = RECUR (chain);
8870 if (purpose == TREE_PURPOSE (t)
8871 && value == TREE_VALUE (t)
8872 && chain == TREE_CHAIN (t))
8874 return tree_cons (purpose, value, chain);
8882 object = tsubst_non_call_postfix_expression (TREE_OPERAND (t, 0),
8883 args, complain, in_decl);
8884 /* Remember that there was a reference to this entity. */
8885 if (DECL_P (object))
8888 member = TREE_OPERAND (t, 1);
8889 if (BASELINK_P (member))
8890 member = tsubst_baselink (member,
8891 non_reference (TREE_TYPE (object)),
8892 args, complain, in_decl);
8894 member = tsubst_copy (member, args, complain, in_decl);
8896 if (member == error_mark_node)
8897 return error_mark_node;
8898 else if (!CLASS_TYPE_P (TREE_TYPE (object)))
8900 if (TREE_CODE (member) == BIT_NOT_EXPR)
8901 return finish_pseudo_destructor_expr (object,
8903 TREE_TYPE (object));
8904 else if (TREE_CODE (member) == SCOPE_REF
8905 && (TREE_CODE (TREE_OPERAND (member, 1)) == BIT_NOT_EXPR))
8906 return finish_pseudo_destructor_expr (object,
8908 TREE_TYPE (object));
8910 else if (TREE_CODE (member) == SCOPE_REF
8911 && TREE_CODE (TREE_OPERAND (member, 1)) == TEMPLATE_ID_EXPR)
8916 /* Lookup the template functions now that we know what the
8918 tmpl = TREE_OPERAND (TREE_OPERAND (member, 1), 0);
8919 args = TREE_OPERAND (TREE_OPERAND (member, 1), 1);
8920 member = lookup_qualified_name (TREE_OPERAND (member, 0), tmpl,
8921 /*is_type_p=*/false,
8922 /*complain=*/false);
8923 if (BASELINK_P (member))
8925 BASELINK_FUNCTIONS (member)
8926 = build_nt (TEMPLATE_ID_EXPR, BASELINK_FUNCTIONS (member),
8928 member = (adjust_result_of_qualified_name_lookup
8929 (member, BINFO_TYPE (BASELINK_BINFO (member)),
8930 TREE_TYPE (object)));
8934 qualified_name_lookup_error (TREE_TYPE (object), tmpl,
8936 return error_mark_node;
8939 else if (TREE_CODE (member) == SCOPE_REF
8940 && !CLASS_TYPE_P (TREE_OPERAND (member, 0))
8941 && TREE_CODE (TREE_OPERAND (member, 0)) != NAMESPACE_DECL)
8943 if (complain & tf_error)
8945 if (TYPE_P (TREE_OPERAND (member, 0)))
8946 error ("%qT is not a class or namespace",
8947 TREE_OPERAND (member, 0));
8949 error ("%qD is not a class or namespace",
8950 TREE_OPERAND (member, 0));
8952 return error_mark_node;
8954 else if (TREE_CODE (member) == FIELD_DECL)
8955 return finish_non_static_data_member (member, object, NULL_TREE);
8957 return finish_class_member_access_expr (object, member,
8958 /*template_p=*/false);
8963 (RECUR (TREE_OPERAND (t, 0)));
8967 VEC(constructor_elt,gc) *n;
8968 constructor_elt *ce;
8969 unsigned HOST_WIDE_INT idx;
8971 tree type = tsubst (TREE_TYPE (t), args, complain, in_decl);
8972 bool process_index_p;
8974 /* digest_init will do the wrong thing if we let it. */
8975 if (type && TYPE_PTRMEMFUNC_P (type))
8978 /* We do not want to process the index of aggregate
8979 initializers as they are identifier nodes which will be
8980 looked up by digest_init. */
8981 process_index_p = !(type && IS_AGGR_TYPE (type));
8983 n = VEC_copy (constructor_elt, gc, CONSTRUCTOR_ELTS (t));
8984 for (idx = 0; VEC_iterate (constructor_elt, n, idx, ce); idx++)
8986 if (ce->index && process_index_p)
8987 ce->index = RECUR (ce->index);
8988 ce->value = RECUR (ce->value);
8991 r = build_constructor (NULL_TREE, n);
8992 TREE_HAS_CONSTRUCTOR (r) = TREE_HAS_CONSTRUCTOR (t);
8995 return digest_init (type, r);
9001 tree operand_0 = RECUR (TREE_OPERAND (t, 0));
9002 if (TYPE_P (operand_0))
9003 return get_typeid (operand_0);
9004 return build_typeid (operand_0);
9014 tree r = tsubst_copy (t, args, complain, in_decl);
9016 if (TREE_CODE (TREE_TYPE (t)) != REFERENCE_TYPE)
9017 /* If the original type was a reference, we'll be wrapped in
9018 the appropriate INDIRECT_REF. */
9019 r = convert_from_reference (r);
9024 return build_x_va_arg (RECUR (TREE_OPERAND (t, 0)),
9025 tsubst_copy (TREE_TYPE (t), args, complain,
9029 return fold_offsetof (RECUR (TREE_OPERAND (t, 0)));
9033 tree old_stmt_expr = cur_stmt_expr;
9034 tree stmt_expr = begin_stmt_expr ();
9036 cur_stmt_expr = stmt_expr;
9037 tsubst_expr (STMT_EXPR_STMT (t), args, complain, in_decl);
9038 stmt_expr = finish_stmt_expr (stmt_expr, false);
9039 cur_stmt_expr = old_stmt_expr;
9045 t = tsubst_copy (t, args, complain, in_decl);
9046 /* As in finish_id_expression, we resolve enumeration constants
9047 to their underlying values. */
9048 if (TREE_CODE (t) == CONST_DECL)
9049 return DECL_INITIAL (t);
9053 /* Handle Objective-C++ constructs, if appropriate. */
9056 = objcp_tsubst_copy_and_build (t, args, complain,
9057 in_decl, /*function_p=*/false);
9061 return tsubst_copy (t, args, complain, in_decl);
9067 /* Verify that the instantiated ARGS are valid. For type arguments,
9068 make sure that the type's linkage is ok. For non-type arguments,
9069 make sure they are constants if they are integral or enumerations.
9070 Emit an error under control of COMPLAIN, and return TRUE on error. */
9073 check_instantiated_args (tree tmpl, tree args, tsubst_flags_t complain)
9075 int ix, len = DECL_NTPARMS (tmpl);
9076 bool result = false;
9078 for (ix = 0; ix != len; ix++)
9080 tree t = TREE_VEC_ELT (args, ix);
9084 /* [basic.link]: A name with no linkage (notably, the name
9085 of a class or enumeration declared in a local scope)
9086 shall not be used to declare an entity with linkage.
9087 This implies that names with no linkage cannot be used as
9088 template arguments. */
9089 tree nt = no_linkage_check (t, /*relaxed_p=*/false);
9093 /* DR 488 makes use of a type with no linkage cause
9094 type deduction to fail. */
9095 if (complain & tf_error)
9097 if (TYPE_ANONYMOUS_P (nt))
9098 error ("%qT is/uses anonymous type", t);
9100 error ("%qT uses local type %qT", t, nt);
9104 /* In order to avoid all sorts of complications, we do not
9105 allow variably-modified types as template arguments. */
9106 else if (variably_modified_type_p (t, NULL_TREE))
9108 if (complain & tf_error)
9109 error ("%qT is a variably modified type", t);
9113 /* A non-type argument of integral or enumerated type must be a
9115 else if (TREE_TYPE (t)
9116 && INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (t))
9117 && !TREE_CONSTANT (t))
9119 if (complain & tf_error)
9120 error ("integral expression %qE is not constant", t);
9124 if (result && (complain & tf_error))
9125 error (" trying to instantiate %qD", tmpl);
9129 /* Instantiate the indicated variable or function template TMPL with
9130 the template arguments in TARG_PTR. */
9133 instantiate_template (tree tmpl, tree targ_ptr, tsubst_flags_t complain)
9139 if (tmpl == error_mark_node)
9140 return error_mark_node;
9142 gcc_assert (TREE_CODE (tmpl) == TEMPLATE_DECL);
9144 /* If this function is a clone, handle it specially. */
9145 if (DECL_CLONED_FUNCTION_P (tmpl))
9150 spec = instantiate_template (DECL_CLONED_FUNCTION (tmpl), targ_ptr,
9152 if (spec == error_mark_node)
9153 return error_mark_node;
9155 /* Look for the clone. */
9156 FOR_EACH_CLONE (clone, spec)
9157 if (DECL_NAME (clone) == DECL_NAME (tmpl))
9159 /* We should always have found the clone by now. */
9164 /* Check to see if we already have this specialization. */
9165 spec = retrieve_specialization (tmpl, targ_ptr,
9166 /*class_specializations_p=*/false);
9167 if (spec != NULL_TREE)
9170 gen_tmpl = most_general_template (tmpl);
9171 if (tmpl != gen_tmpl)
9173 /* The TMPL is a partial instantiation. To get a full set of
9174 arguments we must add the arguments used to perform the
9175 partial instantiation. */
9176 targ_ptr = add_outermost_template_args (DECL_TI_ARGS (tmpl),
9179 /* Check to see if we already have this specialization. */
9180 spec = retrieve_specialization (gen_tmpl, targ_ptr,
9181 /*class_specializations_p=*/false);
9182 if (spec != NULL_TREE)
9186 if (check_instantiated_args (gen_tmpl, INNERMOST_TEMPLATE_ARGS (targ_ptr),
9188 return error_mark_node;
9190 /* We are building a FUNCTION_DECL, during which the access of its
9191 parameters and return types have to be checked. However this
9192 FUNCTION_DECL which is the desired context for access checking
9193 is not built yet. We solve this chicken-and-egg problem by
9194 deferring all checks until we have the FUNCTION_DECL. */
9195 push_deferring_access_checks (dk_deferred);
9197 /* Substitute template parameters. */
9198 fndecl = tsubst (DECL_TEMPLATE_RESULT (gen_tmpl),
9199 targ_ptr, complain, gen_tmpl);
9201 /* Now we know the specialization, compute access previously
9203 push_access_scope (fndecl);
9204 perform_deferred_access_checks ();
9205 pop_access_scope (fndecl);
9206 pop_deferring_access_checks ();
9208 /* The DECL_TI_TEMPLATE should always be the immediate parent
9209 template, not the most general template. */
9210 DECL_TI_TEMPLATE (fndecl) = tmpl;
9212 /* If we've just instantiated the main entry point for a function,
9213 instantiate all the alternate entry points as well. We do this
9214 by cloning the instantiation of the main entry point, not by
9215 instantiating the template clones. */
9216 if (TREE_CHAIN (gen_tmpl) && DECL_CLONED_FUNCTION_P (TREE_CHAIN (gen_tmpl)))
9217 clone_function_decl (fndecl, /*update_method_vec_p=*/0);
9222 /* The FN is a TEMPLATE_DECL for a function. The ARGS are the
9223 arguments that are being used when calling it. TARGS is a vector
9224 into which the deduced template arguments are placed.
9226 Return zero for success, 2 for an incomplete match that doesn't resolve
9227 all the types, and 1 for complete failure. An error message will be
9228 printed only for an incomplete match.
9230 If FN is a conversion operator, or we are trying to produce a specific
9231 specialization, RETURN_TYPE is the return type desired.
9233 The EXPLICIT_TARGS are explicit template arguments provided via a
9236 The parameter STRICT is one of:
9239 We are deducing arguments for a function call, as in
9243 We are deducing arguments for a conversion function, as in
9247 We are deducing arguments when doing an explicit instantiation
9248 as in [temp.explicit], when determining an explicit specialization
9249 as in [temp.expl.spec], or when taking the address of a function
9250 template, as in [temp.deduct.funcaddr]. */
9253 fn_type_unification (tree fn,
9254 tree explicit_targs,
9258 unification_kind_t strict,
9265 gcc_assert (TREE_CODE (fn) == TEMPLATE_DECL);
9267 fntype = TREE_TYPE (fn);
9272 The specified template arguments must match the template
9273 parameters in kind (i.e., type, nontype, template), and there
9274 must not be more arguments than there are parameters;
9275 otherwise type deduction fails.
9277 Nontype arguments must match the types of the corresponding
9278 nontype template parameters, or must be convertible to the
9279 types of the corresponding nontype parameters as specified in
9280 _temp.arg.nontype_, otherwise type deduction fails.
9282 All references in the function type of the function template
9283 to the corresponding template parameters are replaced by the
9284 specified template argument values. If a substitution in a
9285 template parameter or in the function type of the function
9286 template results in an invalid type, type deduction fails. */
9288 tree converted_args;
9291 if (explicit_targs == error_mark_node)
9295 = (coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn),
9296 explicit_targs, NULL_TREE, tf_none,
9297 /*require_all_arguments=*/0));
9298 if (converted_args == error_mark_node)
9301 /* Substitute the explicit args into the function type. This is
9302 necessary so that, for instance, explicitly declared function
9303 arguments can match null pointed constants. If we were given
9304 an incomplete set of explicit args, we must not do semantic
9305 processing during substitution as we could create partial
9307 incomplete = NUM_TMPL_ARGS (explicit_targs) != NUM_TMPL_ARGS (targs);
9308 processing_template_decl += incomplete;
9309 fntype = tsubst (fntype, converted_args, tf_none, NULL_TREE);
9310 processing_template_decl -= incomplete;
9312 if (fntype == error_mark_node)
9315 /* Place the explicitly specified arguments in TARGS. */
9316 for (i = NUM_TMPL_ARGS (converted_args); i--;)
9317 TREE_VEC_ELT (targs, i) = TREE_VEC_ELT (converted_args, i);
9320 parms = TYPE_ARG_TYPES (fntype);
9321 /* Never do unification on the 'this' parameter. */
9322 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn))
9323 parms = TREE_CHAIN (parms);
9327 parms = tree_cons (NULL_TREE, TREE_TYPE (fntype), parms);
9328 args = tree_cons (NULL_TREE, return_type, args);
9331 /* We allow incomplete unification without an error message here
9332 because the standard doesn't seem to explicitly prohibit it. Our
9333 callers must be ready to deal with unification failures in any
9335 result = type_unification_real (DECL_INNERMOST_TEMPLATE_PARMS (fn),
9336 targs, parms, args, /*subr=*/0,
9340 /* All is well so far. Now, check:
9344 When all template arguments have been deduced, all uses of
9345 template parameters in nondeduced contexts are replaced with
9346 the corresponding deduced argument values. If the
9347 substitution results in an invalid type, as described above,
9348 type deduction fails. */
9349 if (tsubst (TREE_TYPE (fn), targs, tf_none, NULL_TREE)
9356 /* Adjust types before performing type deduction, as described in
9357 [temp.deduct.call] and [temp.deduct.conv]. The rules in these two
9358 sections are symmetric. PARM is the type of a function parameter
9359 or the return type of the conversion function. ARG is the type of
9360 the argument passed to the call, or the type of the value
9361 initialized with the result of the conversion function. */
9364 maybe_adjust_types_for_deduction (unification_kind_t strict,
9377 /* Swap PARM and ARG throughout the remainder of this
9378 function; the handling is precisely symmetric since PARM
9379 will initialize ARG rather than vice versa. */
9387 /* There is nothing to do in this case. */
9394 if (TREE_CODE (*parm) != REFERENCE_TYPE)
9396 /* [temp.deduct.call]
9398 If P is not a reference type:
9400 --If A is an array type, the pointer type produced by the
9401 array-to-pointer standard conversion (_conv.array_) is
9402 used in place of A for type deduction; otherwise,
9404 --If A is a function type, the pointer type produced by
9405 the function-to-pointer standard conversion
9406 (_conv.func_) is used in place of A for type deduction;
9409 --If A is a cv-qualified type, the top level
9410 cv-qualifiers of A's type are ignored for type
9412 if (TREE_CODE (*arg) == ARRAY_TYPE)
9413 *arg = build_pointer_type (TREE_TYPE (*arg));
9414 else if (TREE_CODE (*arg) == FUNCTION_TYPE)
9415 *arg = build_pointer_type (*arg);
9417 *arg = TYPE_MAIN_VARIANT (*arg);
9420 /* [temp.deduct.call]
9422 If P is a cv-qualified type, the top level cv-qualifiers
9423 of P's type are ignored for type deduction. If P is a
9424 reference type, the type referred to by P is used for
9426 *parm = TYPE_MAIN_VARIANT (*parm);
9427 if (TREE_CODE (*parm) == REFERENCE_TYPE)
9429 *parm = TREE_TYPE (*parm);
9430 result |= UNIFY_ALLOW_OUTER_MORE_CV_QUAL;
9433 /* DR 322. For conversion deduction, remove a reference type on parm
9434 too (which has been swapped into ARG). */
9435 if (strict == DEDUCE_CONV && TREE_CODE (*arg) == REFERENCE_TYPE)
9436 *arg = TREE_TYPE (*arg);
9441 /* Most parms like fn_type_unification.
9443 If SUBR is 1, we're being called recursively (to unify the
9444 arguments of a function or method parameter of a function
9448 type_unification_real (tree tparms,
9453 unification_kind_t strict,
9458 int ntparms = TREE_VEC_LENGTH (tparms);
9460 int saw_undeduced = 0;
9463 gcc_assert (TREE_CODE (tparms) == TREE_VEC);
9464 gcc_assert (xparms == NULL_TREE || TREE_CODE (xparms) == TREE_LIST);
9465 gcc_assert (!xargs || TREE_CODE (xargs) == TREE_LIST);
9466 gcc_assert (ntparms > 0);
9471 sub_strict = (UNIFY_ALLOW_OUTER_LEVEL | UNIFY_ALLOW_MORE_CV_QUAL
9472 | UNIFY_ALLOW_DERIVED);
9476 sub_strict = UNIFY_ALLOW_LESS_CV_QUAL;
9480 sub_strict = UNIFY_ALLOW_NONE;
9491 while (parms && parms != void_list_node
9492 && args && args != void_list_node)
9494 parm = TREE_VALUE (parms);
9495 parms = TREE_CHAIN (parms);
9496 arg = TREE_VALUE (args);
9497 args = TREE_CHAIN (args);
9499 if (arg == error_mark_node)
9501 if (arg == unknown_type_node)
9502 /* We can't deduce anything from this, but we might get all the
9503 template args from other function args. */
9506 /* Conversions will be performed on a function argument that
9507 corresponds with a function parameter that contains only
9508 non-deducible template parameters and explicitly specified
9509 template parameters. */
9510 if (!uses_template_parms (parm))
9515 type = TREE_TYPE (arg);
9519 if (same_type_p (parm, type))
9521 if (strict != DEDUCE_EXACT
9522 && can_convert_arg (parm, type, TYPE_P (arg) ? NULL_TREE : arg,
9531 gcc_assert (TREE_TYPE (arg) != NULL_TREE);
9532 if (type_unknown_p (arg))
9534 /* [temp.deduct.type] A template-argument can be deduced from
9535 a pointer to function or pointer to member function
9536 argument if the set of overloaded functions does not
9537 contain function templates and at most one of a set of
9538 overloaded functions provides a unique match. */
9540 if (resolve_overloaded_unification
9541 (tparms, targs, parm, arg, strict, sub_strict)
9546 arg = TREE_TYPE (arg);
9547 if (arg == error_mark_node)
9552 int arg_strict = sub_strict;
9555 arg_strict |= maybe_adjust_types_for_deduction (strict, &parm, &arg);
9557 if (unify (tparms, targs, parm, arg, arg_strict))
9562 /* Fail if we've reached the end of the parm list, and more args
9563 are present, and the parm list isn't variadic. */
9564 if (args && args != void_list_node && parms == void_list_node)
9566 /* Fail if parms are left and they don't have default values. */
9567 if (parms && parms != void_list_node
9568 && TREE_PURPOSE (parms) == NULL_TREE)
9572 for (i = 0; i < ntparms; i++)
9573 if (!TREE_VEC_ELT (targs, i))
9575 tree tparm = TREE_VALUE (TREE_VEC_ELT (tparms, i));
9577 /* If this is an undeduced nontype parameter that depends on
9578 a type parameter, try another pass; its type may have been
9579 deduced from a later argument than the one from which
9580 this parameter can be deduced. */
9581 if (TREE_CODE (tparm) == PARM_DECL
9582 && uses_template_parms (TREE_TYPE (tparm))
9583 && !saw_undeduced++)
9592 /* Subroutine of type_unification_real. Args are like the variables at the
9593 call site. ARG is an overloaded function (or template-id); we try
9594 deducing template args from each of the overloads, and if only one
9595 succeeds, we go with that. Modifies TARGS and returns 0 on success. */
9598 resolve_overloaded_unification (tree tparms,
9602 unification_kind_t strict,
9605 tree tempargs = copy_node (targs);
9609 if (TREE_CODE (arg) == ADDR_EXPR)
9611 arg = TREE_OPERAND (arg, 0);
9617 if (TREE_CODE (arg) == COMPONENT_REF)
9618 /* Handle `&x' where `x' is some static or non-static member
9620 arg = TREE_OPERAND (arg, 1);
9622 if (TREE_CODE (arg) == OFFSET_REF)
9623 arg = TREE_OPERAND (arg, 1);
9625 /* Strip baselink information. */
9626 if (BASELINK_P (arg))
9627 arg = BASELINK_FUNCTIONS (arg);
9629 if (TREE_CODE (arg) == TEMPLATE_ID_EXPR)
9631 /* If we got some explicit template args, we need to plug them into
9632 the affected templates before we try to unify, in case the
9633 explicit args will completely resolve the templates in question. */
9635 tree expl_subargs = TREE_OPERAND (arg, 1);
9636 arg = TREE_OPERAND (arg, 0);
9638 for (; arg; arg = OVL_NEXT (arg))
9640 tree fn = OVL_CURRENT (arg);
9643 if (TREE_CODE (fn) != TEMPLATE_DECL)
9646 subargs = get_bindings (fn, DECL_TEMPLATE_RESULT (fn),
9647 expl_subargs, /*check_ret=*/false);
9650 elem = tsubst (TREE_TYPE (fn), subargs, tf_none, NULL_TREE);
9651 good += try_one_overload (tparms, targs, tempargs, parm,
9652 elem, strict, sub_strict, addr_p);
9658 gcc_assert (TREE_CODE (arg) == OVERLOAD
9659 || TREE_CODE (arg) == FUNCTION_DECL);
9661 for (; arg; arg = OVL_NEXT (arg))
9662 good += try_one_overload (tparms, targs, tempargs, parm,
9663 TREE_TYPE (OVL_CURRENT (arg)),
9664 strict, sub_strict, addr_p);
9667 /* [temp.deduct.type] A template-argument can be deduced from a pointer
9668 to function or pointer to member function argument if the set of
9669 overloaded functions does not contain function templates and at most
9670 one of a set of overloaded functions provides a unique match.
9672 So if we found multiple possibilities, we return success but don't
9677 int i = TREE_VEC_LENGTH (targs);
9679 if (TREE_VEC_ELT (tempargs, i))
9680 TREE_VEC_ELT (targs, i) = TREE_VEC_ELT (tempargs, i);
9688 /* Subroutine of resolve_overloaded_unification; does deduction for a single
9689 overload. Fills TARGS with any deduced arguments, or error_mark_node if
9690 different overloads deduce different arguments for a given parm.
9691 ADDR_P is true if the expression for which deduction is being
9692 performed was of the form "& fn" rather than simply "fn".
9694 Returns 1 on success. */
9697 try_one_overload (tree tparms,
9702 unification_kind_t strict,
9710 /* [temp.deduct.type] A template-argument can be deduced from a pointer
9711 to function or pointer to member function argument if the set of
9712 overloaded functions does not contain function templates and at most
9713 one of a set of overloaded functions provides a unique match.
9715 So if this is a template, just return success. */
9717 if (uses_template_parms (arg))
9720 if (TREE_CODE (arg) == METHOD_TYPE)
9721 arg = build_ptrmemfunc_type (build_pointer_type (arg));
9723 arg = build_pointer_type (arg);
9725 sub_strict |= maybe_adjust_types_for_deduction (strict, &parm, &arg);
9727 /* We don't copy orig_targs for this because if we have already deduced
9728 some template args from previous args, unify would complain when we
9729 try to deduce a template parameter for the same argument, even though
9730 there isn't really a conflict. */
9731 nargs = TREE_VEC_LENGTH (targs);
9732 tempargs = make_tree_vec (nargs);
9734 if (unify (tparms, tempargs, parm, arg, sub_strict) != 0)
9737 /* First make sure we didn't deduce anything that conflicts with
9738 explicitly specified args. */
9739 for (i = nargs; i--; )
9741 tree elt = TREE_VEC_ELT (tempargs, i);
9742 tree oldelt = TREE_VEC_ELT (orig_targs, i);
9746 else if (uses_template_parms (elt))
9747 /* Since we're unifying against ourselves, we will fill in
9748 template args used in the function parm list with our own
9749 template parms. Discard them. */
9750 TREE_VEC_ELT (tempargs, i) = NULL_TREE;
9751 else if (oldelt && !template_args_equal (oldelt, elt))
9755 for (i = nargs; i--; )
9757 tree elt = TREE_VEC_ELT (tempargs, i);
9760 TREE_VEC_ELT (targs, i) = elt;
9766 /* Verify that nondeduce template argument agrees with the type
9767 obtained from argument deduction. Return nonzero if the
9772 struct A { typedef int X; };
9773 template <class T, class U> struct C {};
9774 template <class T> struct C<T, typename T::X> {};
9776 Then with the instantiation `C<A, int>', we can deduce that
9777 `T' is `A' but unify () does not check whether `typename T::X'
9778 is `int'. This function ensure that they agree.
9780 TARGS, PARMS are the same as the arguments of unify.
9781 ARGS contains template arguments from all levels. */
9784 verify_class_unification (tree targs, tree parms, tree args)
9786 parms = tsubst (parms, add_outermost_template_args (args, targs),
9787 tf_none, NULL_TREE);
9788 if (parms == error_mark_node)
9791 return !comp_template_args (parms, INNERMOST_TEMPLATE_ARGS (args));
9794 /* PARM is a template class (perhaps with unbound template
9795 parameters). ARG is a fully instantiated type. If ARG can be
9796 bound to PARM, return ARG, otherwise return NULL_TREE. TPARMS and
9797 TARGS are as for unify. */
9800 try_class_unification (tree tparms, tree targs, tree parm, tree arg)
9804 if (!CLASSTYPE_TEMPLATE_INFO (arg)
9805 || (most_general_template (CLASSTYPE_TI_TEMPLATE (arg))
9806 != most_general_template (CLASSTYPE_TI_TEMPLATE (parm))))
9809 /* We need to make a new template argument vector for the call to
9810 unify. If we used TARGS, we'd clutter it up with the result of
9811 the attempted unification, even if this class didn't work out.
9812 We also don't want to commit ourselves to all the unifications
9813 we've already done, since unification is supposed to be done on
9814 an argument-by-argument basis. In other words, consider the
9815 following pathological case:
9817 template <int I, int J, int K>
9820 template <int I, int J>
9821 struct S<I, J, 2> : public S<I, I, I>, S<J, J, J> {};
9823 template <int I, int J, int K>
9824 void f(S<I, J, K>, S<I, I, I>);
9833 Now, by the time we consider the unification involving `s2', we
9834 already know that we must have `f<0, 0, 0>'. But, even though
9835 `S<0, 1, 2>' is derived from `S<0, 0, 0>', the code is invalid
9836 because there are two ways to unify base classes of S<0, 1, 2>
9837 with S<I, I, I>. If we kept the already deduced knowledge, we
9838 would reject the possibility I=1. */
9839 copy_of_targs = make_tree_vec (TREE_VEC_LENGTH (targs));
9841 /* If unification failed, we're done. */
9842 if (unify (tparms, copy_of_targs, CLASSTYPE_TI_ARGS (parm),
9843 CLASSTYPE_TI_ARGS (arg), UNIFY_ALLOW_NONE))
9849 /* Given a template type PARM and a class type ARG, find the unique
9850 base type in ARG that is an instance of PARM. We do not examine
9851 ARG itself; only its base-classes. If there is not exactly one
9852 appropriate base class, return NULL_TREE. PARM may be the type of
9853 a partial specialization, as well as a plain template type. Used
9857 get_template_base (tree tparms, tree targs, tree parm, tree arg)
9859 tree rval = NULL_TREE;
9862 gcc_assert (IS_AGGR_TYPE_CODE (TREE_CODE (arg)));
9864 binfo = TYPE_BINFO (complete_type (arg));
9866 /* The type could not be completed. */
9869 /* Walk in inheritance graph order. The search order is not
9870 important, and this avoids multiple walks of virtual bases. */
9871 for (binfo = TREE_CHAIN (binfo); binfo; binfo = TREE_CHAIN (binfo))
9873 tree r = try_class_unification (tparms, targs, parm, BINFO_TYPE (binfo));
9877 /* If there is more than one satisfactory baseclass, then:
9881 If they yield more than one possible deduced A, the type
9885 if (rval && !same_type_p (r, rval))
9895 /* Returns the level of DECL, which declares a template parameter. */
9898 template_decl_level (tree decl)
9900 switch (TREE_CODE (decl))
9904 return TEMPLATE_TYPE_LEVEL (TREE_TYPE (decl));
9907 return TEMPLATE_PARM_LEVEL (DECL_INITIAL (decl));
9915 /* Decide whether ARG can be unified with PARM, considering only the
9916 cv-qualifiers of each type, given STRICT as documented for unify.
9917 Returns nonzero iff the unification is OK on that basis. */
9920 check_cv_quals_for_unify (int strict, tree arg, tree parm)
9922 int arg_quals = cp_type_quals (arg);
9923 int parm_quals = cp_type_quals (parm);
9925 if (TREE_CODE (parm) == TEMPLATE_TYPE_PARM
9926 && !(strict & UNIFY_ALLOW_OUTER_MORE_CV_QUAL))
9928 /* Although a CVR qualifier is ignored when being applied to a
9929 substituted template parameter ([8.3.2]/1 for example), that
9930 does not apply during deduction [14.8.2.4]/1, (even though
9931 that is not explicitly mentioned, [14.8.2.4]/9 indicates
9932 this). Except when we're allowing additional CV qualifiers
9933 at the outer level [14.8.2.1]/3,1st bullet. */
9934 if ((TREE_CODE (arg) == REFERENCE_TYPE
9935 || TREE_CODE (arg) == FUNCTION_TYPE
9936 || TREE_CODE (arg) == METHOD_TYPE)
9937 && (parm_quals & (TYPE_QUAL_CONST | TYPE_QUAL_VOLATILE)))
9940 if ((!POINTER_TYPE_P (arg) && TREE_CODE (arg) != TEMPLATE_TYPE_PARM)
9941 && (parm_quals & TYPE_QUAL_RESTRICT))
9945 if (!(strict & (UNIFY_ALLOW_MORE_CV_QUAL | UNIFY_ALLOW_OUTER_MORE_CV_QUAL))
9946 && (arg_quals & parm_quals) != parm_quals)
9949 if (!(strict & (UNIFY_ALLOW_LESS_CV_QUAL | UNIFY_ALLOW_OUTER_LESS_CV_QUAL))
9950 && (parm_quals & arg_quals) != arg_quals)
9956 /* Takes parameters as for type_unification. Returns 0 if the
9957 type deduction succeeds, 1 otherwise. The parameter STRICT is a
9958 bitwise or of the following flags:
9961 Require an exact match between PARM and ARG.
9962 UNIFY_ALLOW_MORE_CV_QUAL:
9963 Allow the deduced ARG to be more cv-qualified (by qualification
9964 conversion) than ARG.
9965 UNIFY_ALLOW_LESS_CV_QUAL:
9966 Allow the deduced ARG to be less cv-qualified than ARG.
9967 UNIFY_ALLOW_DERIVED:
9968 Allow the deduced ARG to be a template base class of ARG,
9969 or a pointer to a template base class of the type pointed to by
9971 UNIFY_ALLOW_INTEGER:
9972 Allow any integral type to be deduced. See the TEMPLATE_PARM_INDEX
9973 case for more information.
9974 UNIFY_ALLOW_OUTER_LEVEL:
9975 This is the outermost level of a deduction. Used to determine validity
9976 of qualification conversions. A valid qualification conversion must
9977 have const qualified pointers leading up to the inner type which
9978 requires additional CV quals, except at the outer level, where const
9979 is not required [conv.qual]. It would be normal to set this flag in
9980 addition to setting UNIFY_ALLOW_MORE_CV_QUAL.
9981 UNIFY_ALLOW_OUTER_MORE_CV_QUAL:
9982 This is the outermost level of a deduction, and PARM can be more CV
9983 qualified at this point.
9984 UNIFY_ALLOW_OUTER_LESS_CV_QUAL:
9985 This is the outermost level of a deduction, and PARM can be less CV
9986 qualified at this point. */
9989 unify (tree tparms, tree targs, tree parm, tree arg, int strict)
9994 int strict_in = strict;
9996 /* I don't think this will do the right thing with respect to types.
9997 But the only case I've seen it in so far has been array bounds, where
9998 signedness is the only information lost, and I think that will be
10000 while (TREE_CODE (parm) == NOP_EXPR)
10001 parm = TREE_OPERAND (parm, 0);
10003 if (arg == error_mark_node)
10005 if (arg == unknown_type_node)
10006 /* We can't deduce anything from this, but we might get all the
10007 template args from other function args. */
10010 /* If PARM uses template parameters, then we can't bail out here,
10011 even if ARG == PARM, since we won't record unifications for the
10012 template parameters. We might need them if we're trying to
10013 figure out which of two things is more specialized. */
10014 if (arg == parm && !uses_template_parms (parm))
10017 /* Immediately reject some pairs that won't unify because of
10018 cv-qualification mismatches. */
10019 if (TREE_CODE (arg) == TREE_CODE (parm)
10021 /* It is the elements of the array which hold the cv quals of an array
10022 type, and the elements might be template type parms. We'll check
10023 when we recurse. */
10024 && TREE_CODE (arg) != ARRAY_TYPE
10025 /* We check the cv-qualifiers when unifying with template type
10026 parameters below. We want to allow ARG `const T' to unify with
10027 PARM `T' for example, when computing which of two templates
10028 is more specialized, for example. */
10029 && TREE_CODE (arg) != TEMPLATE_TYPE_PARM
10030 && !check_cv_quals_for_unify (strict_in, arg, parm))
10033 if (!(strict & UNIFY_ALLOW_OUTER_LEVEL)
10034 && TYPE_P (parm) && !CP_TYPE_CONST_P (parm))
10035 strict &= ~UNIFY_ALLOW_MORE_CV_QUAL;
10036 strict &= ~UNIFY_ALLOW_OUTER_LEVEL;
10037 strict &= ~UNIFY_ALLOW_DERIVED;
10038 strict &= ~UNIFY_ALLOW_OUTER_MORE_CV_QUAL;
10039 strict &= ~UNIFY_ALLOW_OUTER_LESS_CV_QUAL;
10041 switch (TREE_CODE (parm))
10043 case TYPENAME_TYPE:
10045 case UNBOUND_CLASS_TEMPLATE:
10046 /* In a type which contains a nested-name-specifier, template
10047 argument values cannot be deduced for template parameters used
10048 within the nested-name-specifier. */
10051 case TEMPLATE_TYPE_PARM:
10052 case TEMPLATE_TEMPLATE_PARM:
10053 case BOUND_TEMPLATE_TEMPLATE_PARM:
10054 tparm = TREE_VALUE (TREE_VEC_ELT (tparms, 0));
10056 if (TEMPLATE_TYPE_LEVEL (parm)
10057 != template_decl_level (tparm))
10058 /* The PARM is not one we're trying to unify. Just check
10059 to see if it matches ARG. */
10060 return (TREE_CODE (arg) == TREE_CODE (parm)
10061 && same_type_p (parm, arg)) ? 0 : 1;
10062 idx = TEMPLATE_TYPE_IDX (parm);
10063 targ = TREE_VEC_ELT (targs, idx);
10064 tparm = TREE_VALUE (TREE_VEC_ELT (tparms, idx));
10066 /* Check for mixed types and values. */
10067 if ((TREE_CODE (parm) == TEMPLATE_TYPE_PARM
10068 && TREE_CODE (tparm) != TYPE_DECL)
10069 || (TREE_CODE (parm) == TEMPLATE_TEMPLATE_PARM
10070 && TREE_CODE (tparm) != TEMPLATE_DECL))
10073 if (TREE_CODE (parm) == BOUND_TEMPLATE_TEMPLATE_PARM)
10075 /* ARG must be constructed from a template class or a template
10076 template parameter. */
10077 if (TREE_CODE (arg) != BOUND_TEMPLATE_TEMPLATE_PARM
10078 && (TREE_CODE (arg) != RECORD_TYPE || !CLASSTYPE_TEMPLATE_INFO (arg)))
10082 tree parmtmpl = TYPE_TI_TEMPLATE (parm);
10083 tree parmvec = TYPE_TI_ARGS (parm);
10084 tree argvec = INNERMOST_TEMPLATE_ARGS (TYPE_TI_ARGS (arg));
10086 = DECL_INNERMOST_TEMPLATE_PARMS (TYPE_TI_TEMPLATE (arg));
10089 /* The parameter and argument roles have to be switched here
10090 in order to handle default arguments properly. For example,
10091 template<template <class> class TT> void f(TT<int>)
10092 should be able to accept vector<int> which comes from
10093 template <class T, class Allocator = allocator>
10096 if (coerce_template_parms (argtmplvec, parmvec, parmtmpl, 0, 1)
10097 == error_mark_node)
10100 /* Deduce arguments T, i from TT<T> or TT<i>.
10101 We check each element of PARMVEC and ARGVEC individually
10102 rather than the whole TREE_VEC since they can have
10103 different number of elements. */
10105 for (i = 0; i < TREE_VEC_LENGTH (parmvec); ++i)
10107 if (unify (tparms, targs,
10108 TREE_VEC_ELT (parmvec, i),
10109 TREE_VEC_ELT (argvec, i),
10114 arg = TYPE_TI_TEMPLATE (arg);
10116 /* Fall through to deduce template name. */
10119 if (TREE_CODE (parm) == TEMPLATE_TEMPLATE_PARM
10120 || TREE_CODE (parm) == BOUND_TEMPLATE_TEMPLATE_PARM)
10122 /* Deduce template name TT from TT, TT<>, TT<T> and TT<i>. */
10124 /* Simple cases: Value already set, does match or doesn't. */
10125 if (targ != NULL_TREE && template_args_equal (targ, arg))
10132 /* If PARM is `const T' and ARG is only `int', we don't have
10133 a match unless we are allowing additional qualification.
10134 If ARG is `const int' and PARM is just `T' that's OK;
10135 that binds `const int' to `T'. */
10136 if (!check_cv_quals_for_unify (strict_in | UNIFY_ALLOW_LESS_CV_QUAL,
10140 /* Consider the case where ARG is `const volatile int' and
10141 PARM is `const T'. Then, T should be `volatile int'. */
10142 arg = cp_build_qualified_type_real
10143 (arg, cp_type_quals (arg) & ~cp_type_quals (parm), tf_none);
10144 if (arg == error_mark_node)
10147 /* Simple cases: Value already set, does match or doesn't. */
10148 if (targ != NULL_TREE && same_type_p (targ, arg))
10153 /* Make sure that ARG is not a variable-sized array. (Note
10154 that were talking about variable-sized arrays (like
10155 `int[n]'), rather than arrays of unknown size (like
10156 `int[]').) We'll get very confused by such a type since
10157 the bound of the array will not be computable in an
10158 instantiation. Besides, such types are not allowed in
10159 ISO C++, so we can do as we please here. */
10160 if (variably_modified_type_p (arg, NULL_TREE))
10164 TREE_VEC_ELT (targs, idx) = arg;
10167 case TEMPLATE_PARM_INDEX:
10168 tparm = TREE_VALUE (TREE_VEC_ELT (tparms, 0));
10170 if (TEMPLATE_PARM_LEVEL (parm)
10171 != template_decl_level (tparm))
10172 /* The PARM is not one we're trying to unify. Just check
10173 to see if it matches ARG. */
10174 return !(TREE_CODE (arg) == TREE_CODE (parm)
10175 && cp_tree_equal (parm, arg));
10177 idx = TEMPLATE_PARM_IDX (parm);
10178 targ = TREE_VEC_ELT (targs, idx);
10181 return !cp_tree_equal (targ, arg);
10183 /* [temp.deduct.type] If, in the declaration of a function template
10184 with a non-type template-parameter, the non-type
10185 template-parameter is used in an expression in the function
10186 parameter-list and, if the corresponding template-argument is
10187 deduced, the template-argument type shall match the type of the
10188 template-parameter exactly, except that a template-argument
10189 deduced from an array bound may be of any integral type.
10190 The non-type parameter might use already deduced type parameters. */
10191 tparm = tsubst (TREE_TYPE (parm), targs, 0, NULL_TREE);
10192 if (!TREE_TYPE (arg))
10193 /* Template-parameter dependent expression. Just accept it for now.
10194 It will later be processed in convert_template_argument. */
10196 else if (same_type_p (TREE_TYPE (arg), tparm))
10198 else if ((strict & UNIFY_ALLOW_INTEGER)
10199 && (TREE_CODE (tparm) == INTEGER_TYPE
10200 || TREE_CODE (tparm) == BOOLEAN_TYPE))
10201 /* Convert the ARG to the type of PARM; the deduced non-type
10202 template argument must exactly match the types of the
10203 corresponding parameter. */
10204 arg = fold (build_nop (TREE_TYPE (parm), arg));
10205 else if (uses_template_parms (tparm))
10206 /* We haven't deduced the type of this parameter yet. Try again
10212 TREE_VEC_ELT (targs, idx) = arg;
10217 /* A pointer-to-member constant can be unified only with
10218 another constant. */
10219 if (TREE_CODE (arg) != PTRMEM_CST)
10222 /* Just unify the class member. It would be useless (and possibly
10223 wrong, depending on the strict flags) to unify also
10224 PTRMEM_CST_CLASS, because we want to be sure that both parm and
10225 arg refer to the same variable, even if through different
10226 classes. For instance:
10228 struct A { int x; };
10231 Unification of &A::x and &B::x must succeed. */
10232 return unify (tparms, targs, PTRMEM_CST_MEMBER (parm),
10233 PTRMEM_CST_MEMBER (arg), strict);
10238 if (TREE_CODE (arg) != POINTER_TYPE)
10241 /* [temp.deduct.call]
10243 A can be another pointer or pointer to member type that can
10244 be converted to the deduced A via a qualification
10245 conversion (_conv.qual_).
10247 We pass down STRICT here rather than UNIFY_ALLOW_NONE.
10248 This will allow for additional cv-qualification of the
10249 pointed-to types if appropriate. */
10251 if (TREE_CODE (TREE_TYPE (arg)) == RECORD_TYPE)
10252 /* The derived-to-base conversion only persists through one
10253 level of pointers. */
10254 strict |= (strict_in & UNIFY_ALLOW_DERIVED);
10256 return unify (tparms, targs, TREE_TYPE (parm),
10257 TREE_TYPE (arg), strict);
10260 case REFERENCE_TYPE:
10261 if (TREE_CODE (arg) != REFERENCE_TYPE)
10263 return unify (tparms, targs, TREE_TYPE (parm), TREE_TYPE (arg),
10264 strict & UNIFY_ALLOW_MORE_CV_QUAL);
10267 if (TREE_CODE (arg) != ARRAY_TYPE)
10269 if ((TYPE_DOMAIN (parm) == NULL_TREE)
10270 != (TYPE_DOMAIN (arg) == NULL_TREE))
10272 if (TYPE_DOMAIN (parm) != NULL_TREE)
10277 parm_max = TYPE_MAX_VALUE (TYPE_DOMAIN (parm));
10278 arg_max = TYPE_MAX_VALUE (TYPE_DOMAIN (arg));
10280 /* Our representation of array types uses "N - 1" as the
10281 TYPE_MAX_VALUE for an array with "N" elements, if "N" is
10282 not an integer constant. */
10283 if (TREE_CODE (parm_max) == MINUS_EXPR)
10285 arg_max = fold_build2 (PLUS_EXPR,
10288 TREE_OPERAND (parm_max, 1));
10289 parm_max = TREE_OPERAND (parm_max, 0);
10292 if (unify (tparms, targs, parm_max, arg_max, UNIFY_ALLOW_INTEGER))
10295 return unify (tparms, targs, TREE_TYPE (parm), TREE_TYPE (arg),
10296 strict & UNIFY_ALLOW_MORE_CV_QUAL);
10303 case ENUMERAL_TYPE:
10305 if (TREE_CODE (arg) != TREE_CODE (parm))
10308 /* We have already checked cv-qualification at the top of the
10310 if (!same_type_ignoring_top_level_qualifiers_p (arg, parm))
10313 /* As far as unification is concerned, this wins. Later checks
10314 will invalidate it if necessary. */
10317 /* Types INTEGER_CST and MINUS_EXPR can come from array bounds. */
10318 /* Type INTEGER_CST can come from ordinary constant template args. */
10320 while (TREE_CODE (arg) == NOP_EXPR)
10321 arg = TREE_OPERAND (arg, 0);
10323 if (TREE_CODE (arg) != INTEGER_CST)
10325 return !tree_int_cst_equal (parm, arg);
10330 if (TREE_CODE (arg) != TREE_VEC)
10332 if (TREE_VEC_LENGTH (parm) != TREE_VEC_LENGTH (arg))
10334 for (i = 0; i < TREE_VEC_LENGTH (parm); ++i)
10335 if (unify (tparms, targs,
10336 TREE_VEC_ELT (parm, i), TREE_VEC_ELT (arg, i),
10344 if (TREE_CODE (arg) != TREE_CODE (parm))
10347 if (TYPE_PTRMEMFUNC_P (parm))
10349 if (!TYPE_PTRMEMFUNC_P (arg))
10352 return unify (tparms, targs,
10353 TYPE_PTRMEMFUNC_FN_TYPE (parm),
10354 TYPE_PTRMEMFUNC_FN_TYPE (arg),
10358 if (CLASSTYPE_TEMPLATE_INFO (parm))
10360 tree t = NULL_TREE;
10362 if (strict_in & UNIFY_ALLOW_DERIVED)
10364 /* First, we try to unify the PARM and ARG directly. */
10365 t = try_class_unification (tparms, targs,
10370 /* Fallback to the special case allowed in
10371 [temp.deduct.call]:
10373 If P is a class, and P has the form
10374 template-id, then A can be a derived class of
10375 the deduced A. Likewise, if P is a pointer to
10376 a class of the form template-id, A can be a
10377 pointer to a derived class pointed to by the
10379 t = get_template_base (tparms, targs, parm, arg);
10385 else if (CLASSTYPE_TEMPLATE_INFO (arg)
10386 && (CLASSTYPE_TI_TEMPLATE (parm)
10387 == CLASSTYPE_TI_TEMPLATE (arg)))
10388 /* Perhaps PARM is something like S<U> and ARG is S<int>.
10389 Then, we should unify `int' and `U'. */
10392 /* There's no chance of unification succeeding. */
10395 return unify (tparms, targs, CLASSTYPE_TI_ARGS (parm),
10396 CLASSTYPE_TI_ARGS (t), UNIFY_ALLOW_NONE);
10398 else if (!same_type_ignoring_top_level_qualifiers_p (parm, arg))
10403 case FUNCTION_TYPE:
10404 if (TREE_CODE (arg) != TREE_CODE (parm))
10407 /* CV qualifications for methods can never be deduced, they must
10408 match exactly. We need to check them explicitly here,
10409 because type_unification_real treats them as any other
10410 cvqualified parameter. */
10411 if (TREE_CODE (parm) == METHOD_TYPE
10412 && (!check_cv_quals_for_unify
10414 TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (arg))),
10415 TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (parm))))))
10418 if (unify (tparms, targs, TREE_TYPE (parm),
10419 TREE_TYPE (arg), UNIFY_ALLOW_NONE))
10421 return type_unification_real (tparms, targs, TYPE_ARG_TYPES (parm),
10422 TYPE_ARG_TYPES (arg), 1, DEDUCE_EXACT,
10426 /* Unify a pointer to member with a pointer to member function, which
10427 deduces the type of the member as a function type. */
10428 if (TYPE_PTRMEMFUNC_P (arg))
10432 cp_cv_quals cv_quals;
10434 /* Check top-level cv qualifiers */
10435 if (!check_cv_quals_for_unify (UNIFY_ALLOW_NONE, arg, parm))
10438 if (unify (tparms, targs, TYPE_OFFSET_BASETYPE (parm),
10439 TYPE_PTRMEMFUNC_OBJECT_TYPE (arg), UNIFY_ALLOW_NONE))
10442 /* Determine the type of the function we are unifying against. */
10443 method_type = TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (arg));
10445 build_function_type (TREE_TYPE (method_type),
10446 TREE_CHAIN (TYPE_ARG_TYPES (method_type)));
10448 /* Extract the cv-qualifiers of the member function from the
10449 implicit object parameter and place them on the function
10450 type to be restored later. */
10452 cp_type_quals(TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (method_type))));
10453 fntype = build_qualified_type (fntype, cv_quals);
10454 return unify (tparms, targs, TREE_TYPE (parm), fntype, strict);
10457 if (TREE_CODE (arg) != OFFSET_TYPE)
10459 if (unify (tparms, targs, TYPE_OFFSET_BASETYPE (parm),
10460 TYPE_OFFSET_BASETYPE (arg), UNIFY_ALLOW_NONE))
10462 return unify (tparms, targs, TREE_TYPE (parm), TREE_TYPE (arg),
10466 if (DECL_TEMPLATE_PARM_P (parm))
10467 return unify (tparms, targs, DECL_INITIAL (parm), arg, strict);
10468 if (arg != integral_constant_value (parm))
10473 case TEMPLATE_DECL:
10474 /* Matched cases are handled by the ARG == PARM test above. */
10478 gcc_assert (EXPR_P (parm));
10480 /* We must be looking at an expression. This can happen with
10484 void foo(S<I>, S<I + 2>);
10486 This is a "nondeduced context":
10490 The nondeduced contexts are:
10492 --A type that is a template-id in which one or more of
10493 the template-arguments is an expression that references
10494 a template-parameter.
10496 In these cases, we assume deduction succeeded, but don't
10497 actually infer any unifications. */
10499 if (!uses_template_parms (parm)
10500 && !template_args_equal (parm, arg))
10507 /* Note that DECL can be defined in this translation unit, if
10511 mark_definable (tree decl)
10514 DECL_NOT_REALLY_EXTERN (decl) = 1;
10515 FOR_EACH_CLONE (clone, decl)
10516 DECL_NOT_REALLY_EXTERN (clone) = 1;
10519 /* Called if RESULT is explicitly instantiated, or is a member of an
10520 explicitly instantiated class. */
10523 mark_decl_instantiated (tree result, int extern_p)
10525 SET_DECL_EXPLICIT_INSTANTIATION (result);
10527 /* If this entity has already been written out, it's too late to
10528 make any modifications. */
10529 if (TREE_ASM_WRITTEN (result))
10532 if (TREE_CODE (result) != FUNCTION_DECL)
10533 /* The TREE_PUBLIC flag for function declarations will have been
10534 set correctly by tsubst. */
10535 TREE_PUBLIC (result) = 1;
10537 /* This might have been set by an earlier implicit instantiation. */
10538 DECL_COMDAT (result) = 0;
10541 DECL_NOT_REALLY_EXTERN (result) = 0;
10544 mark_definable (result);
10545 /* Always make artificials weak. */
10546 if (DECL_ARTIFICIAL (result) && flag_weak)
10547 comdat_linkage (result);
10548 /* For WIN32 we also want to put explicit instantiations in
10549 linkonce sections. */
10550 else if (TREE_PUBLIC (result))
10551 maybe_make_one_only (result);
10554 /* If EXTERN_P, then this function will not be emitted -- unless
10555 followed by an explicit instantiation, at which point its linkage
10556 will be adjusted. If !EXTERN_P, then this function will be
10557 emitted here. In neither circumstance do we want
10558 import_export_decl to adjust the linkage. */
10559 DECL_INTERFACE_KNOWN (result) = 1;
10562 /* Given two function templates PAT1 and PAT2, return:
10564 1 if PAT1 is more specialized than PAT2 as described in [temp.func.order].
10565 -1 if PAT2 is more specialized than PAT1.
10566 0 if neither is more specialized.
10568 LEN indicates the number of parameters we should consider
10569 (defaulted parameters should not be considered).
10571 The 1998 std underspecified function template partial ordering, and
10572 DR214 addresses the issue. We take pairs of arguments, one from
10573 each of the templates, and deduce them against each other. One of
10574 the templates will be more specialized if all the *other*
10575 template's arguments deduce against its arguments and at least one
10576 of its arguments *does* *not* deduce against the other template's
10577 corresponding argument. Deduction is done as for class templates.
10578 The arguments used in deduction have reference and top level cv
10579 qualifiers removed. Iff both arguments were originally reference
10580 types *and* deduction succeeds in both directions, the template
10581 with the more cv-qualified argument wins for that pairing (if
10582 neither is more cv-qualified, they both are equal). Unlike regular
10583 deduction, after all the arguments have been deduced in this way,
10584 we do *not* verify the deduced template argument values can be
10585 substituted into non-deduced contexts, nor do we have to verify
10586 that all template arguments have been deduced. */
10589 more_specialized_fn (tree pat1, tree pat2, int len)
10591 tree decl1 = DECL_TEMPLATE_RESULT (pat1);
10592 tree decl2 = DECL_TEMPLATE_RESULT (pat2);
10593 tree targs1 = make_tree_vec (DECL_NTPARMS (pat1));
10594 tree targs2 = make_tree_vec (DECL_NTPARMS (pat2));
10595 tree tparms1 = DECL_INNERMOST_TEMPLATE_PARMS (pat1);
10596 tree tparms2 = DECL_INNERMOST_TEMPLATE_PARMS (pat2);
10597 tree args1 = TYPE_ARG_TYPES (TREE_TYPE (decl1));
10598 tree args2 = TYPE_ARG_TYPES (TREE_TYPE (decl2));
10602 /* Remove the this parameter from non-static member functions. If
10603 one is a non-static member function and the other is not a static
10604 member function, remove the first parameter from that function
10605 also. This situation occurs for operator functions where we
10606 locate both a member function (with this pointer) and non-member
10607 operator (with explicit first operand). */
10608 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl1))
10610 len--; /* LEN is the number of significant arguments for DECL1 */
10611 args1 = TREE_CHAIN (args1);
10612 if (!DECL_STATIC_FUNCTION_P (decl2))
10613 args2 = TREE_CHAIN (args2);
10615 else if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl2))
10617 args2 = TREE_CHAIN (args2);
10618 if (!DECL_STATIC_FUNCTION_P (decl1))
10621 args1 = TREE_CHAIN (args1);
10625 /* If only one is a conversion operator, they are unordered. */
10626 if (DECL_CONV_FN_P (decl1) != DECL_CONV_FN_P (decl2))
10629 /* Consider the return type for a conversion function */
10630 if (DECL_CONV_FN_P (decl1))
10632 args1 = tree_cons (NULL_TREE, TREE_TYPE (TREE_TYPE (decl1)), args1);
10633 args2 = tree_cons (NULL_TREE, TREE_TYPE (TREE_TYPE (decl2)), args2);
10637 processing_template_decl++;
10641 tree arg1 = TREE_VALUE (args1);
10642 tree arg2 = TREE_VALUE (args2);
10643 int deduce1, deduce2;
10647 if (TREE_CODE (arg1) == REFERENCE_TYPE)
10649 arg1 = TREE_TYPE (arg1);
10650 quals1 = cp_type_quals (arg1);
10653 if (TREE_CODE (arg2) == REFERENCE_TYPE)
10655 arg2 = TREE_TYPE (arg2);
10656 quals2 = cp_type_quals (arg2);
10659 if ((quals1 < 0) != (quals2 < 0))
10661 /* Only of the args is a reference, see if we should apply
10662 array/function pointer decay to it. This is not part of
10663 DR214, but is, IMHO, consistent with the deduction rules
10664 for the function call itself, and with our earlier
10665 implementation of the underspecified partial ordering
10666 rules. (nathan). */
10669 switch (TREE_CODE (arg1))
10672 arg1 = TREE_TYPE (arg1);
10674 case FUNCTION_TYPE:
10675 arg1 = build_pointer_type (arg1);
10684 switch (TREE_CODE (arg2))
10687 arg2 = TREE_TYPE (arg2);
10689 case FUNCTION_TYPE:
10690 arg2 = build_pointer_type (arg2);
10699 arg1 = TYPE_MAIN_VARIANT (arg1);
10700 arg2 = TYPE_MAIN_VARIANT (arg2);
10702 deduce1 = !unify (tparms1, targs1, arg1, arg2, UNIFY_ALLOW_NONE);
10703 deduce2 = !unify (tparms2, targs2, arg2, arg1, UNIFY_ALLOW_NONE);
10709 if (better1 < 0 && better2 < 0)
10710 /* We've failed to deduce something in either direction.
10711 These must be unordered. */
10714 if (deduce1 && deduce2 && quals1 >= 0 && quals2 >= 0)
10716 /* Deduces in both directions, see if quals can
10717 disambiguate. Pretend the worse one failed to deduce. */
10718 if ((quals1 & quals2) == quals2)
10720 if ((quals1 & quals2) == quals1)
10723 if (deduce1 && !deduce2 && !better2)
10725 if (deduce2 && !deduce1 && !better1)
10728 args1 = TREE_CHAIN (args1);
10729 args2 = TREE_CHAIN (args2);
10732 processing_template_decl--;
10734 return (better1 > 0) - (better2 > 0);
10737 /* Given two class template specialization list nodes PAT1 and PAT2, return:
10739 1 if PAT1 is more specialized than PAT2 as described in [temp.class.order].
10740 -1 if PAT2 is more specialized than PAT1.
10741 0 if neither is more specialized.
10743 FULL_ARGS is the full set of template arguments that triggers this
10744 partial ordering. */
10747 more_specialized_class (tree pat1, tree pat2, tree full_args)
10752 /* Just like what happens for functions, if we are ordering between
10753 different class template specializations, we may encounter dependent
10754 types in the arguments, and we need our dependency check functions
10755 to behave correctly. */
10756 ++processing_template_decl;
10757 targs = get_class_bindings (TREE_VALUE (pat1), TREE_PURPOSE (pat1),
10758 add_outermost_template_args (full_args, TREE_PURPOSE (pat2)));
10762 targs = get_class_bindings (TREE_VALUE (pat2), TREE_PURPOSE (pat2),
10763 add_outermost_template_args (full_args, TREE_PURPOSE (pat1)));
10766 --processing_template_decl;
10771 /* Return the template arguments that will produce the function signature
10772 DECL from the function template FN, with the explicit template
10773 arguments EXPLICIT_ARGS. If CHECK_RETTYPE is true, the return type must
10774 also match. Return NULL_TREE if no satisfactory arguments could be
10778 get_bindings (tree fn, tree decl, tree explicit_args, bool check_rettype)
10780 int ntparms = DECL_NTPARMS (fn);
10781 tree targs = make_tree_vec (ntparms);
10783 tree decl_arg_types;
10785 /* Substitute the explicit template arguments into the type of DECL.
10786 The call to fn_type_unification will handle substitution into the
10788 decl_type = TREE_TYPE (decl);
10789 if (explicit_args && uses_template_parms (decl_type))
10792 tree converted_args;
10794 if (DECL_TEMPLATE_INFO (decl))
10795 tmpl = DECL_TI_TEMPLATE (decl);
10797 /* We can get here for some invalid specializations. */
10801 = (coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl),
10802 explicit_args, NULL_TREE,
10803 tf_none, /*require_all_arguments=*/0));
10804 if (converted_args == error_mark_node)
10807 decl_type = tsubst (decl_type, converted_args, tf_none, NULL_TREE);
10808 if (decl_type == error_mark_node)
10812 decl_arg_types = TYPE_ARG_TYPES (decl_type);
10813 /* Never do unification on the 'this' parameter. */
10814 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl))
10815 decl_arg_types = TREE_CHAIN (decl_arg_types);
10817 if (fn_type_unification (fn, explicit_args, targs,
10819 (check_rettype || DECL_CONV_FN_P (fn)
10820 ? TREE_TYPE (decl_type) : NULL_TREE),
10821 DEDUCE_EXACT, LOOKUP_NORMAL))
10827 /* Return the innermost template arguments that, when applied to a
10828 template specialization whose innermost template parameters are
10829 TPARMS, and whose specialization arguments are PARMS, yield the
10832 For example, suppose we have:
10834 template <class T, class U> struct S {};
10835 template <class T> struct S<T*, int> {};
10837 Then, suppose we want to get `S<double*, int>'. The TPARMS will be
10838 {T}, the PARMS will be {T*, int} and the ARGS will be {double*,
10839 int}. The resulting vector will be {double}, indicating that `T'
10840 is bound to `double'. */
10843 get_class_bindings (tree tparms, tree parms, tree args)
10845 int i, ntparms = TREE_VEC_LENGTH (tparms);
10846 tree vec = make_tree_vec (ntparms);
10848 if (unify (tparms, vec, parms, INNERMOST_TEMPLATE_ARGS (args),
10852 for (i = 0; i < ntparms; ++i)
10853 if (! TREE_VEC_ELT (vec, i))
10856 if (verify_class_unification (vec, parms, args))
10862 /* In INSTANTIATIONS is a list of <INSTANTIATION, TEMPLATE> pairs.
10863 Pick the most specialized template, and return the corresponding
10864 instantiation, or if there is no corresponding instantiation, the
10865 template itself. If there is no most specialized template,
10866 error_mark_node is returned. If there are no templates at all,
10867 NULL_TREE is returned. */
10870 most_specialized_instantiation (tree instantiations)
10874 if (!instantiations)
10877 ++processing_template_decl;
10879 champ = instantiations;
10880 for (fn = TREE_CHAIN (instantiations); fn; fn = TREE_CHAIN (fn))
10884 if (get_bindings (TREE_VALUE (champ),
10885 DECL_TEMPLATE_RESULT (TREE_VALUE (fn)),
10886 NULL_TREE, /*check_ret=*/false))
10889 if (get_bindings (TREE_VALUE (fn),
10890 DECL_TEMPLATE_RESULT (TREE_VALUE (champ)),
10891 NULL_TREE, /*check_ret=*/false))
10898 /* Equally specialized, move to next function. If there
10899 is no next function, nothing's most specialized. */
10900 fn = TREE_CHAIN (fn);
10907 /* Now verify that champ is better than everything earlier in the
10908 instantiation list. */
10909 for (fn = instantiations; fn != champ; fn = TREE_CHAIN (fn))
10910 if (get_bindings (TREE_VALUE (champ),
10911 DECL_TEMPLATE_RESULT (TREE_VALUE (fn)),
10912 NULL_TREE, /*check_ret=*/false)
10913 || !get_bindings (TREE_VALUE (fn),
10914 DECL_TEMPLATE_RESULT (TREE_VALUE (champ)),
10915 NULL_TREE, /*check_ret=*/false))
10921 processing_template_decl--;
10924 return error_mark_node;
10926 return TREE_PURPOSE (champ) ? TREE_PURPOSE (champ) : TREE_VALUE (champ);
10929 /* Return the most specialized of the list of templates in FNS that can
10930 produce an instantiation matching DECL, given the explicit template
10931 arguments EXPLICIT_ARGS. */
10934 most_specialized (tree fns, tree decl, tree explicit_args)
10936 tree candidates = NULL_TREE;
10939 for (fn = fns; fn; fn = TREE_CHAIN (fn))
10941 tree candidate = TREE_VALUE (fn);
10943 args = get_bindings (candidate, decl, explicit_args, /*check_ret=*/true);
10945 candidates = tree_cons (NULL_TREE, candidate, candidates);
10948 return most_specialized_instantiation (candidates);
10951 /* If DECL is a specialization of some template, return the most
10952 general such template. Otherwise, returns NULL_TREE.
10954 For example, given:
10956 template <class T> struct S { template <class U> void f(U); };
10958 if TMPL is `template <class U> void S<int>::f(U)' this will return
10959 the full template. This function will not trace past partial
10960 specializations, however. For example, given in addition:
10962 template <class T> struct S<T*> { template <class U> void f(U); };
10964 if TMPL is `template <class U> void S<int*>::f(U)' this will return
10965 `template <class T> template <class U> S<T*>::f(U)'. */
10968 most_general_template (tree decl)
10970 /* If DECL is a FUNCTION_DECL, find the TEMPLATE_DECL of which it is
10971 an immediate specialization. */
10972 if (TREE_CODE (decl) == FUNCTION_DECL)
10974 if (DECL_TEMPLATE_INFO (decl)) {
10975 decl = DECL_TI_TEMPLATE (decl);
10977 /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE for a
10978 template friend. */
10979 if (TREE_CODE (decl) != TEMPLATE_DECL)
10985 /* Look for more and more general templates. */
10986 while (DECL_TEMPLATE_INFO (decl))
10988 /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE in some cases.
10989 (See cp-tree.h for details.) */
10990 if (TREE_CODE (DECL_TI_TEMPLATE (decl)) != TEMPLATE_DECL)
10993 if (CLASS_TYPE_P (TREE_TYPE (decl))
10994 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl)))
10997 /* Stop if we run into an explicitly specialized class template. */
10998 if (!DECL_NAMESPACE_SCOPE_P (decl)
10999 && DECL_CONTEXT (decl)
11000 && CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (decl)))
11003 decl = DECL_TI_TEMPLATE (decl);
11009 /* Return the most specialized of the class template specializations
11010 of TMPL which can produce an instantiation matching ARGS, or
11011 error_mark_node if the choice is ambiguous. */
11014 most_specialized_class (tree tmpl, tree args)
11016 tree list = NULL_TREE;
11021 tmpl = most_general_template (tmpl);
11022 for (t = DECL_TEMPLATE_SPECIALIZATIONS (tmpl); t; t = TREE_CHAIN (t))
11025 = get_class_bindings (TREE_VALUE (t), TREE_PURPOSE (t), args);
11028 list = tree_cons (TREE_PURPOSE (t), TREE_VALUE (t), list);
11029 TREE_TYPE (list) = TREE_TYPE (t);
11038 t = TREE_CHAIN (t);
11039 for (; t; t = TREE_CHAIN (t))
11041 fate = more_specialized_class (champ, t, args);
11048 t = TREE_CHAIN (t);
11050 return error_mark_node;
11056 for (t = list; t && t != champ; t = TREE_CHAIN (t))
11058 fate = more_specialized_class (champ, t, args);
11060 return error_mark_node;
11066 /* Explicitly instantiate DECL. */
11069 do_decl_instantiation (tree decl, tree storage)
11071 tree result = NULL_TREE;
11075 /* An error occurred, for which grokdeclarator has already issued
11076 an appropriate message. */
11078 else if (! DECL_LANG_SPECIFIC (decl))
11080 error ("explicit instantiation of non-template %q#D", decl);
11083 else if (TREE_CODE (decl) == VAR_DECL)
11085 /* There is an asymmetry here in the way VAR_DECLs and
11086 FUNCTION_DECLs are handled by grokdeclarator. In the case of
11087 the latter, the DECL we get back will be marked as a
11088 template instantiation, and the appropriate
11089 DECL_TEMPLATE_INFO will be set up. This does not happen for
11090 VAR_DECLs so we do the lookup here. Probably, grokdeclarator
11091 should handle VAR_DECLs as it currently handles
11093 result = lookup_field (DECL_CONTEXT (decl), DECL_NAME (decl), 0, false);
11094 if (!result || TREE_CODE (result) != VAR_DECL)
11096 error ("no matching template for %qD found", decl);
11100 else if (TREE_CODE (decl) != FUNCTION_DECL)
11102 error ("explicit instantiation of %q#D", decl);
11108 /* Check for various error cases. Note that if the explicit
11109 instantiation is valid the RESULT will currently be marked as an
11110 *implicit* instantiation; DECL_EXPLICIT_INSTANTIATION is not set
11111 until we get here. */
11113 if (DECL_TEMPLATE_SPECIALIZATION (result))
11115 /* DR 259 [temp.spec].
11117 Both an explicit instantiation and a declaration of an explicit
11118 specialization shall not appear in a program unless the explicit
11119 instantiation follows a declaration of the explicit specialization.
11121 For a given set of template parameters, if an explicit
11122 instantiation of a template appears after a declaration of an
11123 explicit specialization for that template, the explicit
11124 instantiation has no effect. */
11127 else if (DECL_EXPLICIT_INSTANTIATION (result))
11131 No program shall explicitly instantiate any template more
11134 We check DECL_NOT_REALLY_EXTERN so as not to complain when
11135 the first instantiation was `extern' and the second is not,
11136 and EXTERN_P for the opposite case. */
11137 if (DECL_NOT_REALLY_EXTERN (result) && !extern_p)
11138 pedwarn ("duplicate explicit instantiation of %q#D", result);
11139 /* If an "extern" explicit instantiation follows an ordinary
11140 explicit instantiation, the template is instantiated. */
11144 else if (!DECL_IMPLICIT_INSTANTIATION (result))
11146 error ("no matching template for %qD found", result);
11149 else if (!DECL_TEMPLATE_INFO (result))
11151 pedwarn ("explicit instantiation of non-template %q#D", result);
11155 if (storage == NULL_TREE)
11157 else if (storage == ridpointers[(int) RID_EXTERN])
11159 if (pedantic && !in_system_header)
11160 pedwarn ("ISO C++ forbids the use of %<extern%> on explicit "
11165 error ("storage class %qD applied to template instantiation", storage);
11167 check_explicit_instantiation_namespace (result);
11168 mark_decl_instantiated (result, extern_p);
11170 instantiate_decl (result, /*defer_ok=*/1,
11171 /*expl_inst_class_mem_p=*/false);
11175 mark_class_instantiated (tree t, int extern_p)
11177 SET_CLASSTYPE_EXPLICIT_INSTANTIATION (t);
11178 SET_CLASSTYPE_INTERFACE_KNOWN (t);
11179 CLASSTYPE_INTERFACE_ONLY (t) = extern_p;
11180 TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (t)) = extern_p;
11183 CLASSTYPE_DEBUG_REQUESTED (t) = 1;
11184 rest_of_type_compilation (t, 1);
11188 /* Called from do_type_instantiation through binding_table_foreach to
11189 do recursive instantiation for the type bound in ENTRY. */
11191 bt_instantiate_type_proc (binding_entry entry, void *data)
11193 tree storage = *(tree *) data;
11195 if (IS_AGGR_TYPE (entry->type)
11196 && !uses_template_parms (CLASSTYPE_TI_ARGS (entry->type)))
11197 do_type_instantiation (TYPE_MAIN_DECL (entry->type), storage, 0);
11200 /* Called from do_type_instantiation to instantiate a member
11201 (a member function or a static member variable) of an
11202 explicitly instantiated class template. */
11204 instantiate_class_member (tree decl, int extern_p)
11206 mark_decl_instantiated (decl, extern_p);
11208 instantiate_decl (decl, /*defer_ok=*/1,
11209 /*expl_inst_class_mem_p=*/true);
11212 /* Perform an explicit instantiation of template class T. STORAGE, if
11213 non-null, is the RID for extern, inline or static. COMPLAIN is
11214 nonzero if this is called from the parser, zero if called recursively,
11215 since the standard is unclear (as detailed below). */
11218 do_type_instantiation (tree t, tree storage, tsubst_flags_t complain)
11223 int previous_instantiation_extern_p = 0;
11225 if (TREE_CODE (t) == TYPE_DECL)
11228 if (! CLASS_TYPE_P (t) || ! CLASSTYPE_TEMPLATE_INFO (t))
11230 error ("explicit instantiation of non-template type %qT", t);
11236 if (!COMPLETE_TYPE_P (t))
11238 if (complain & tf_error)
11239 error ("explicit instantiation of %q#T before definition of template",
11244 if (storage != NULL_TREE)
11246 if (pedantic && !in_system_header)
11247 pedwarn("ISO C++ forbids the use of %qE on explicit instantiations",
11250 if (storage == ridpointers[(int) RID_INLINE])
11252 else if (storage == ridpointers[(int) RID_EXTERN])
11254 else if (storage == ridpointers[(int) RID_STATIC])
11258 error ("storage class %qD applied to template instantiation",
11264 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (t))
11266 /* DR 259 [temp.spec].
11268 Both an explicit instantiation and a declaration of an explicit
11269 specialization shall not appear in a program unless the explicit
11270 instantiation follows a declaration of the explicit specialization.
11272 For a given set of template parameters, if an explicit
11273 instantiation of a template appears after a declaration of an
11274 explicit specialization for that template, the explicit
11275 instantiation has no effect. */
11278 else if (CLASSTYPE_EXPLICIT_INSTANTIATION (t))
11282 No program shall explicitly instantiate any template more
11285 If PREVIOUS_INSTANTIATION_EXTERN_P, then the first explicit
11286 instantiation was `extern'. If EXTERN_P then the second is.
11287 These cases are OK. */
11288 previous_instantiation_extern_p = CLASSTYPE_INTERFACE_ONLY (t);
11290 if (!previous_instantiation_extern_p && !extern_p
11291 && (complain & tf_error))
11292 pedwarn ("duplicate explicit instantiation of %q#T", t);
11294 /* If we've already instantiated the template, just return now. */
11295 if (!CLASSTYPE_INTERFACE_ONLY (t))
11299 check_explicit_instantiation_namespace (TYPE_NAME (t));
11300 mark_class_instantiated (t, extern_p);
11308 /* In contrast to implicit instantiation, where only the
11309 declarations, and not the definitions, of members are
11310 instantiated, we have here:
11314 The explicit instantiation of a class template specialization
11315 implies the instantiation of all of its members not
11316 previously explicitly specialized in the translation unit
11317 containing the explicit instantiation.
11319 Of course, we can't instantiate member template classes, since
11320 we don't have any arguments for them. Note that the standard
11321 is unclear on whether the instantiation of the members are
11322 *explicit* instantiations or not. However, the most natural
11323 interpretation is that it should be an explicit instantiation. */
11326 for (tmp = TYPE_METHODS (t); tmp; tmp = TREE_CHAIN (tmp))
11327 if (TREE_CODE (tmp) == FUNCTION_DECL
11328 && DECL_TEMPLATE_INSTANTIATION (tmp))
11329 instantiate_class_member (tmp, extern_p);
11331 for (tmp = TYPE_FIELDS (t); tmp; tmp = TREE_CHAIN (tmp))
11332 if (TREE_CODE (tmp) == VAR_DECL && DECL_TEMPLATE_INSTANTIATION (tmp))
11333 instantiate_class_member (tmp, extern_p);
11335 if (CLASSTYPE_NESTED_UTDS (t))
11336 binding_table_foreach (CLASSTYPE_NESTED_UTDS (t),
11337 bt_instantiate_type_proc, &storage);
11341 /* Given a function DECL, which is a specialization of TMPL, modify
11342 DECL to be a re-instantiation of TMPL with the same template
11343 arguments. TMPL should be the template into which tsubst'ing
11344 should occur for DECL, not the most general template.
11346 One reason for doing this is a scenario like this:
11349 void f(const T&, int i);
11351 void g() { f(3, 7); }
11354 void f(const T& t, const int i) { }
11356 Note that when the template is first instantiated, with
11357 instantiate_template, the resulting DECL will have no name for the
11358 first parameter, and the wrong type for the second. So, when we go
11359 to instantiate the DECL, we regenerate it. */
11362 regenerate_decl_from_template (tree decl, tree tmpl)
11364 /* The arguments used to instantiate DECL, from the most general
11369 args = DECL_TI_ARGS (decl);
11370 code_pattern = DECL_TEMPLATE_RESULT (tmpl);
11372 /* Make sure that we can see identifiers, and compute access
11374 push_access_scope (decl);
11376 if (TREE_CODE (decl) == FUNCTION_DECL)
11384 args_depth = TMPL_ARGS_DEPTH (args);
11385 parms_depth = TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl));
11386 if (args_depth > parms_depth)
11387 args = get_innermost_template_args (args, parms_depth);
11389 specs = tsubst_exception_specification (TREE_TYPE (code_pattern),
11390 args, tf_error, NULL_TREE);
11392 TREE_TYPE (decl) = build_exception_variant (TREE_TYPE (decl),
11395 /* Merge parameter declarations. */
11396 decl_parm = skip_artificial_parms_for (decl,
11397 DECL_ARGUMENTS (decl));
11399 = skip_artificial_parms_for (code_pattern,
11400 DECL_ARGUMENTS (code_pattern));
11406 if (DECL_NAME (decl_parm) != DECL_NAME (pattern_parm))
11407 DECL_NAME (decl_parm) = DECL_NAME (pattern_parm);
11408 parm_type = tsubst (TREE_TYPE (pattern_parm), args, tf_error,
11410 parm_type = type_decays_to (parm_type);
11411 if (!same_type_p (TREE_TYPE (decl_parm), parm_type))
11412 TREE_TYPE (decl_parm) = parm_type;
11413 attributes = DECL_ATTRIBUTES (pattern_parm);
11414 if (DECL_ATTRIBUTES (decl_parm) != attributes)
11416 DECL_ATTRIBUTES (decl_parm) = attributes;
11417 cplus_decl_attributes (&decl_parm, attributes, /*flags=*/0);
11419 decl_parm = TREE_CHAIN (decl_parm);
11420 pattern_parm = TREE_CHAIN (pattern_parm);
11423 /* Merge additional specifiers from the CODE_PATTERN. */
11424 if (DECL_DECLARED_INLINE_P (code_pattern)
11425 && !DECL_DECLARED_INLINE_P (decl))
11426 DECL_DECLARED_INLINE_P (decl) = 1;
11427 if (DECL_INLINE (code_pattern) && !DECL_INLINE (decl))
11428 DECL_INLINE (decl) = 1;
11430 else if (TREE_CODE (decl) == VAR_DECL)
11431 DECL_INITIAL (decl) =
11432 tsubst_expr (DECL_INITIAL (code_pattern), args,
11433 tf_error, DECL_TI_TEMPLATE (decl));
11435 gcc_unreachable ();
11437 pop_access_scope (decl);
11440 /* Return the TEMPLATE_DECL into which DECL_TI_ARGS(DECL) should be
11441 substituted to get DECL. */
11444 template_for_substitution (tree decl)
11446 tree tmpl = DECL_TI_TEMPLATE (decl);
11448 /* Set TMPL to the template whose DECL_TEMPLATE_RESULT is the pattern
11449 for the instantiation. This is not always the most general
11450 template. Consider, for example:
11453 struct S { template <class U> void f();
11454 template <> void f<int>(); };
11456 and an instantiation of S<double>::f<int>. We want TD to be the
11457 specialization S<T>::f<int>, not the more general S<T>::f<U>. */
11458 while (/* An instantiation cannot have a definition, so we need a
11459 more general template. */
11460 DECL_TEMPLATE_INSTANTIATION (tmpl)
11461 /* We must also deal with friend templates. Given:
11463 template <class T> struct S {
11464 template <class U> friend void f() {};
11467 S<int>::f<U> say, is not an instantiation of S<T>::f<U>,
11468 so far as the language is concerned, but that's still
11469 where we get the pattern for the instantiation from. On
11470 other hand, if the definition comes outside the class, say:
11472 template <class T> struct S {
11473 template <class U> friend void f();
11475 template <class U> friend void f() {}
11477 we don't need to look any further. That's what the check for
11478 DECL_INITIAL is for. */
11479 || (TREE_CODE (decl) == FUNCTION_DECL
11480 && DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (tmpl)
11481 && !DECL_INITIAL (DECL_TEMPLATE_RESULT (tmpl))))
11483 /* The present template, TD, should not be a definition. If it
11484 were a definition, we should be using it! Note that we
11485 cannot restructure the loop to just keep going until we find
11486 a template with a definition, since that might go too far if
11487 a specialization was declared, but not defined. */
11488 gcc_assert (TREE_CODE (decl) != VAR_DECL
11489 || DECL_IN_AGGR_P (DECL_TEMPLATE_RESULT (tmpl)));
11491 /* Fetch the more general template. */
11492 tmpl = DECL_TI_TEMPLATE (tmpl);
11498 /* Produce the definition of D, a _DECL generated from a template. If
11499 DEFER_OK is nonzero, then we don't have to actually do the
11500 instantiation now; we just have to do it sometime. Normally it is
11501 an error if this is an explicit instantiation but D is undefined.
11502 EXPL_INST_CLASS_MEM_P is true iff D is a member of an
11503 explicitly instantiated class template. */
11506 instantiate_decl (tree d, int defer_ok,
11507 bool expl_inst_class_mem_p)
11509 tree tmpl = DECL_TI_TEMPLATE (d);
11516 bool pattern_defined;
11518 location_t saved_loc = input_location;
11521 /* This function should only be used to instantiate templates for
11522 functions and static member variables. */
11523 gcc_assert (TREE_CODE (d) == FUNCTION_DECL
11524 || TREE_CODE (d) == VAR_DECL);
11526 /* Variables are never deferred; if instantiation is required, they
11527 are instantiated right away. That allows for better code in the
11528 case that an expression refers to the value of the variable --
11529 if the variable has a constant value the referring expression can
11530 take advantage of that fact. */
11531 if (TREE_CODE (d) == VAR_DECL)
11534 /* Don't instantiate cloned functions. Instead, instantiate the
11535 functions they cloned. */
11536 if (TREE_CODE (d) == FUNCTION_DECL && DECL_CLONED_FUNCTION_P (d))
11537 d = DECL_CLONED_FUNCTION (d);
11539 if (DECL_TEMPLATE_INSTANTIATED (d))
11540 /* D has already been instantiated. It might seem reasonable to
11541 check whether or not D is an explicit instantiation, and, if so,
11542 stop here. But when an explicit instantiation is deferred
11543 until the end of the compilation, DECL_EXPLICIT_INSTANTIATION
11544 is set, even though we still need to do the instantiation. */
11547 /* If we already have a specialization of this declaration, then
11548 there's no reason to instantiate it. Note that
11549 retrieve_specialization gives us both instantiations and
11550 specializations, so we must explicitly check
11551 DECL_TEMPLATE_SPECIALIZATION. */
11552 gen_tmpl = most_general_template (tmpl);
11553 gen_args = DECL_TI_ARGS (d);
11554 spec = retrieve_specialization (gen_tmpl, gen_args,
11555 /*class_specializations_p=*/false);
11556 if (spec != NULL_TREE && DECL_TEMPLATE_SPECIALIZATION (spec))
11559 /* This needs to happen before any tsubsting. */
11560 if (! push_tinst_level (d))
11563 timevar_push (TV_PARSE);
11565 /* Set TD to the template whose DECL_TEMPLATE_RESULT is the pattern
11566 for the instantiation. */
11567 td = template_for_substitution (d);
11568 code_pattern = DECL_TEMPLATE_RESULT (td);
11570 /* We should never be trying to instantiate a member of a class
11571 template or partial specialization. */
11572 gcc_assert (d != code_pattern);
11574 if ((DECL_NAMESPACE_SCOPE_P (d) && !DECL_INITIALIZED_IN_CLASS_P (d))
11575 || DECL_TEMPLATE_SPECIALIZATION (td))
11576 /* In the case of a friend template whose definition is provided
11577 outside the class, we may have too many arguments. Drop the
11578 ones we don't need. The same is true for specializations. */
11579 args = get_innermost_template_args
11580 (gen_args, TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (td)));
11584 if (TREE_CODE (d) == FUNCTION_DECL)
11585 pattern_defined = (DECL_SAVED_TREE (code_pattern) != NULL_TREE);
11587 pattern_defined = ! DECL_IN_AGGR_P (code_pattern);
11589 /* We may be in the middle of deferred access check. Disable it now. */
11590 push_deferring_access_checks (dk_no_deferred);
11592 /* Unless an explicit instantiation directive has already determined
11593 the linkage of D, remember that a definition is available for
11595 if (pattern_defined
11596 && !DECL_INTERFACE_KNOWN (d)
11597 && !DECL_NOT_REALLY_EXTERN (d))
11598 mark_definable (d);
11600 input_location = DECL_SOURCE_LOCATION (d);
11602 /* If D is a member of an explicitly instantiated class template,
11603 and no definition is available, treat it like an implicit
11605 if (!pattern_defined && expl_inst_class_mem_p
11606 && DECL_EXPLICIT_INSTANTIATION (d))
11608 DECL_NOT_REALLY_EXTERN (d) = 0;
11609 DECL_INTERFACE_KNOWN (d) = 0;
11610 SET_DECL_IMPLICIT_INSTANTIATION (d);
11615 /* Recheck the substitutions to obtain any warning messages
11616 about ignoring cv qualifiers. */
11617 tree gen = DECL_TEMPLATE_RESULT (gen_tmpl);
11618 tree type = TREE_TYPE (gen);
11620 /* Make sure that we can see identifiers, and compute access
11621 correctly. D is already the target FUNCTION_DECL with the
11623 push_access_scope (d);
11625 if (TREE_CODE (gen) == FUNCTION_DECL)
11627 tsubst (DECL_ARGUMENTS (gen), gen_args, tf_error | tf_warning, d);
11628 tsubst (TYPE_RAISES_EXCEPTIONS (type), gen_args,
11629 tf_error | tf_warning, d);
11630 /* Don't simply tsubst the function type, as that will give
11631 duplicate warnings about poor parameter qualifications.
11632 The function arguments are the same as the decl_arguments
11633 without the top level cv qualifiers. */
11634 type = TREE_TYPE (type);
11636 tsubst (type, gen_args, tf_error | tf_warning, d);
11638 pop_access_scope (d);
11641 /* Check to see whether we know that this template will be
11642 instantiated in some other file, as with "extern template"
11644 external_p = (DECL_INTERFACE_KNOWN (d) && DECL_REALLY_EXTERN (d));
11645 /* In general, we do not instantiate such templates... */
11647 /* ... but we instantiate inline functions so that we can inline
11649 && ! (TREE_CODE (d) == FUNCTION_DECL && DECL_INLINE (d))
11650 /* ... we instantiate static data members whose values are
11651 needed in integral constant expressions. */
11652 && ! (TREE_CODE (d) == VAR_DECL
11653 && DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (d)))
11655 /* Defer all other templates, unless we have been explicitly
11656 forbidden from doing so. */
11657 if (/* If there is no definition, we cannot instantiate the
11660 /* If it's OK to postpone instantiation, do so. */
11662 /* If this is a static data member that will be defined
11663 elsewhere, we don't want to instantiate the entire data
11664 member, but we do want to instantiate the initializer so that
11665 we can substitute that elsewhere. */
11666 || (external_p && TREE_CODE (d) == VAR_DECL))
11668 /* The definition of the static data member is now required so
11669 we must substitute the initializer. */
11670 if (TREE_CODE (d) == VAR_DECL
11671 && !DECL_INITIAL (d)
11672 && DECL_INITIAL (code_pattern))
11677 ns = decl_namespace_context (d);
11678 push_nested_namespace (ns);
11679 push_nested_class (DECL_CONTEXT (d));
11680 init = tsubst_expr (DECL_INITIAL (code_pattern),
11682 tf_error | tf_warning, NULL_TREE);
11683 DECL_INITIAL (d) = init;
11684 cp_finish_decl (d, init, /*asmspec_tree=*/NULL_TREE,
11685 LOOKUP_ONLYCONVERTING);
11686 pop_nested_class ();
11687 pop_nested_namespace (ns);
11690 /* We restore the source position here because it's used by
11691 add_pending_template. */
11692 input_location = saved_loc;
11694 if (at_eof && !pattern_defined
11695 && DECL_EXPLICIT_INSTANTIATION (d))
11698 The definition of a non-exported function template, a
11699 non-exported member function template, or a non-exported
11700 member function or static data member of a class template
11701 shall be present in every translation unit in which it is
11702 explicitly instantiated. */
11704 ("explicit instantiation of %qD but no definition available", d);
11706 /* ??? Historically, we have instantiated inline functions, even
11707 when marked as "extern template". */
11708 if (!(external_p && TREE_CODE (d) == VAR_DECL))
11709 add_pending_template (d);
11712 /* Tell the repository that D is available in this translation unit
11713 -- and see if it is supposed to be instantiated here. */
11714 if (TREE_PUBLIC (d) && !DECL_REALLY_EXTERN (d) && !repo_emit_p (d))
11716 /* In a PCH file, despite the fact that the repository hasn't
11717 requested instantiation in the PCH it is still possible that
11718 an instantiation will be required in a file that includes the
11721 add_pending_template (d);
11722 /* Instantiate inline functions so that the inliner can do its
11723 job, even though we'll not be emitting a copy of this
11725 if (!(TREE_CODE (d) == FUNCTION_DECL
11726 && flag_inline_trees
11727 && DECL_DECLARED_INLINE_P (d)))
11731 need_push = !cfun || !global_bindings_p ();
11733 push_to_top_level ();
11735 /* Mark D as instantiated so that recursive calls to
11736 instantiate_decl do not try to instantiate it again. */
11737 DECL_TEMPLATE_INSTANTIATED (d) = 1;
11739 /* Regenerate the declaration in case the template has been modified
11740 by a subsequent redeclaration. */
11741 regenerate_decl_from_template (d, td);
11743 /* We already set the file and line above. Reset them now in case
11744 they changed as a result of calling regenerate_decl_from_template. */
11745 input_location = DECL_SOURCE_LOCATION (d);
11747 if (TREE_CODE (d) == VAR_DECL)
11749 /* Clear out DECL_RTL; whatever was there before may not be right
11750 since we've reset the type of the declaration. */
11751 SET_DECL_RTL (d, NULL_RTX);
11752 DECL_IN_AGGR_P (d) = 0;
11754 /* Clear DECL_EXTERNAL so that cp_finish_decl will process the
11755 initializer. That function will defer actual emission until
11756 we have a chance to determine linkage. */
11757 DECL_EXTERNAL (d) = 0;
11759 /* Enter the scope of D so that access-checking works correctly. */
11760 push_nested_class (DECL_CONTEXT (d));
11761 cp_finish_decl (d, DECL_INITIAL (d), NULL_TREE, 0);
11762 pop_nested_class ();
11764 else if (TREE_CODE (d) == FUNCTION_DECL)
11766 htab_t saved_local_specializations;
11771 /* Save away the current list, in case we are instantiating one
11772 template from within the body of another. */
11773 saved_local_specializations = local_specializations;
11775 /* Set up the list of local specializations. */
11776 local_specializations = htab_create (37,
11777 hash_local_specialization,
11778 eq_local_specializations,
11781 /* Set up context. */
11782 start_preparsed_function (d, NULL_TREE, SF_PRE_PARSED);
11784 /* Create substitution entries for the parameters. */
11785 subst_decl = DECL_TEMPLATE_RESULT (template_for_substitution (d));
11786 tmpl_parm = DECL_ARGUMENTS (subst_decl);
11787 spec_parm = DECL_ARGUMENTS (d);
11788 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (d))
11790 register_local_specialization (spec_parm, tmpl_parm);
11791 spec_parm = skip_artificial_parms_for (d, spec_parm);
11792 tmpl_parm = skip_artificial_parms_for (subst_decl, tmpl_parm);
11796 register_local_specialization (spec_parm, tmpl_parm);
11797 tmpl_parm = TREE_CHAIN (tmpl_parm);
11798 spec_parm = TREE_CHAIN (spec_parm);
11800 gcc_assert (!spec_parm);
11802 /* Substitute into the body of the function. */
11803 tsubst_expr (DECL_SAVED_TREE (code_pattern), args,
11804 tf_error | tf_warning, tmpl);
11806 /* We don't need the local specializations any more. */
11807 htab_delete (local_specializations);
11808 local_specializations = saved_local_specializations;
11810 /* Finish the function. */
11811 d = finish_function (0);
11812 expand_or_defer_fn (d);
11815 /* We're not deferring instantiation any more. */
11816 TI_PENDING_TEMPLATE_FLAG (DECL_TEMPLATE_INFO (d)) = 0;
11819 pop_from_top_level ();
11822 input_location = saved_loc;
11823 pop_deferring_access_checks ();
11824 pop_tinst_level ();
11826 timevar_pop (TV_PARSE);
11831 /* Run through the list of templates that we wish we could
11832 instantiate, and instantiate any we can. RETRIES is the
11833 number of times we retry pending template instantiation. */
11836 instantiate_pending_templates (int retries)
11839 tree last = NULL_TREE;
11841 location_t saved_loc = input_location;
11842 int saved_in_system_header = in_system_header;
11844 /* Instantiating templates may trigger vtable generation. This in turn
11845 may require further template instantiations. We place a limit here
11846 to avoid infinite loop. */
11847 if (pending_templates && retries >= max_tinst_depth)
11849 tree decl = TREE_VALUE (pending_templates);
11851 error ("template instantiation depth exceeds maximum of %d"
11852 " instantiating %q+D, possibly from virtual table generation"
11853 " (use -ftemplate-depth-NN to increase the maximum)",
11854 max_tinst_depth, decl);
11855 if (TREE_CODE (decl) == FUNCTION_DECL)
11856 /* Pretend that we defined it. */
11857 DECL_INITIAL (decl) = error_mark_node;
11865 t = &pending_templates;
11868 tree instantiation = TREE_VALUE (*t);
11870 reopen_tinst_level (TREE_PURPOSE (*t));
11872 if (TYPE_P (instantiation))
11876 if (!COMPLETE_TYPE_P (instantiation))
11878 instantiate_class_template (instantiation);
11879 if (CLASSTYPE_TEMPLATE_INSTANTIATION (instantiation))
11880 for (fn = TYPE_METHODS (instantiation);
11882 fn = TREE_CHAIN (fn))
11883 if (! DECL_ARTIFICIAL (fn))
11884 instantiate_decl (fn,
11886 /*expl_inst_class_mem_p=*/false);
11887 if (COMPLETE_TYPE_P (instantiation))
11891 if (COMPLETE_TYPE_P (instantiation))
11892 /* If INSTANTIATION has been instantiated, then we don't
11893 need to consider it again in the future. */
11894 *t = TREE_CHAIN (*t);
11898 t = &TREE_CHAIN (*t);
11903 if (!DECL_TEMPLATE_SPECIALIZATION (instantiation)
11904 && !DECL_TEMPLATE_INSTANTIATED (instantiation))
11907 = instantiate_decl (instantiation,
11909 /*expl_inst_class_mem_p=*/false);
11910 if (DECL_TEMPLATE_INSTANTIATED (instantiation))
11914 if (DECL_TEMPLATE_SPECIALIZATION (instantiation)
11915 || DECL_TEMPLATE_INSTANTIATED (instantiation))
11916 /* If INSTANTIATION has been instantiated, then we don't
11917 need to consider it again in the future. */
11918 *t = TREE_CHAIN (*t);
11922 t = &TREE_CHAIN (*t);
11926 current_tinst_level = NULL_TREE;
11928 last_pending_template = last;
11930 while (reconsider);
11932 input_location = saved_loc;
11933 in_system_header = saved_in_system_header;
11936 /* Substitute ARGVEC into T, which is a list of initializers for
11937 either base class or a non-static data member. The TREE_PURPOSEs
11938 are DECLs, and the TREE_VALUEs are the initializer values. Used by
11939 instantiate_decl. */
11942 tsubst_initializer_list (tree t, tree argvec)
11944 tree inits = NULL_TREE;
11946 for (; t; t = TREE_CHAIN (t))
11951 decl = tsubst_copy (TREE_PURPOSE (t), argvec, tf_error | tf_warning,
11953 decl = expand_member_init (decl);
11954 if (decl && !DECL_P (decl))
11955 in_base_initializer = 1;
11957 init = tsubst_expr (TREE_VALUE (t), argvec, tf_error | tf_warning,
11959 in_base_initializer = 0;
11963 init = build_tree_list (decl, init);
11964 TREE_CHAIN (init) = inits;
11971 /* Set CURRENT_ACCESS_SPECIFIER based on the protection of DECL. */
11974 set_current_access_from_decl (tree decl)
11976 if (TREE_PRIVATE (decl))
11977 current_access_specifier = access_private_node;
11978 else if (TREE_PROTECTED (decl))
11979 current_access_specifier = access_protected_node;
11981 current_access_specifier = access_public_node;
11984 /* Instantiate an enumerated type. TAG is the template type, NEWTAG
11985 is the instantiation (which should have been created with
11986 start_enum) and ARGS are the template arguments to use. */
11989 tsubst_enum (tree tag, tree newtag, tree args)
11993 for (e = TYPE_VALUES (tag); e; e = TREE_CHAIN (e))
11998 decl = TREE_VALUE (e);
11999 /* Note that in a template enum, the TREE_VALUE is the
12000 CONST_DECL, not the corresponding INTEGER_CST. */
12001 value = tsubst_expr (DECL_INITIAL (decl),
12002 args, tf_error | tf_warning,
12005 /* Give this enumeration constant the correct access. */
12006 set_current_access_from_decl (decl);
12008 /* Actually build the enumerator itself. */
12009 build_enumerator (DECL_NAME (decl), value, newtag);
12012 finish_enum (newtag);
12013 DECL_SOURCE_LOCATION (TYPE_NAME (newtag))
12014 = DECL_SOURCE_LOCATION (TYPE_NAME (tag));
12017 /* DECL is a FUNCTION_DECL that is a template specialization. Return
12018 its type -- but without substituting the innermost set of template
12019 arguments. So, innermost set of template parameters will appear in
12023 get_mostly_instantiated_function_type (tree decl)
12031 tmpl = most_general_template (DECL_TI_TEMPLATE (decl));
12032 targs = DECL_TI_ARGS (decl);
12033 tparms = DECL_TEMPLATE_PARMS (tmpl);
12034 parm_depth = TMPL_PARMS_DEPTH (tparms);
12036 /* There should be as many levels of arguments as there are levels
12038 gcc_assert (parm_depth == TMPL_ARGS_DEPTH (targs));
12040 fn_type = TREE_TYPE (tmpl);
12042 if (parm_depth == 1)
12043 /* No substitution is necessary. */
12047 int i, save_access_control;
12050 /* Replace the innermost level of the TARGS with NULL_TREEs to
12051 let tsubst know not to substitute for those parameters. */
12052 partial_args = make_tree_vec (TREE_VEC_LENGTH (targs));
12053 for (i = 1; i < TMPL_ARGS_DEPTH (targs); ++i)
12054 SET_TMPL_ARGS_LEVEL (partial_args, i,
12055 TMPL_ARGS_LEVEL (targs, i));
12056 SET_TMPL_ARGS_LEVEL (partial_args,
12057 TMPL_ARGS_DEPTH (targs),
12058 make_tree_vec (DECL_NTPARMS (tmpl)));
12060 /* Disable access control as this function is used only during
12062 save_access_control = flag_access_control;
12063 flag_access_control = 0;
12065 ++processing_template_decl;
12066 /* Now, do the (partial) substitution to figure out the
12067 appropriate function type. */
12068 fn_type = tsubst (fn_type, partial_args, tf_error, NULL_TREE);
12069 --processing_template_decl;
12071 /* Substitute into the template parameters to obtain the real
12072 innermost set of parameters. This step is important if the
12073 innermost set of template parameters contains value
12074 parameters whose types depend on outer template parameters. */
12075 TREE_VEC_LENGTH (partial_args)--;
12076 tparms = tsubst_template_parms (tparms, partial_args, tf_error);
12078 flag_access_control = save_access_control;
12084 /* Return truthvalue if we're processing a template different from
12085 the last one involved in diagnostics. */
12087 problematic_instantiation_changed (void)
12089 return last_template_error_tick != tinst_level_tick;
12092 /* Remember current template involved in diagnostics. */
12094 record_last_problematic_instantiation (void)
12096 last_template_error_tick = tinst_level_tick;
12100 current_instantiation (void)
12102 return current_tinst_level;
12105 /* [temp.param] Check that template non-type parm TYPE is of an allowable
12106 type. Return zero for ok, nonzero for disallowed. Issue error and
12107 warning messages under control of COMPLAIN. */
12110 invalid_nontype_parm_type_p (tree type, tsubst_flags_t complain)
12112 if (INTEGRAL_TYPE_P (type))
12114 else if (POINTER_TYPE_P (type))
12116 else if (TYPE_PTR_TO_MEMBER_P (type))
12118 else if (TREE_CODE (type) == TEMPLATE_TYPE_PARM)
12120 else if (TREE_CODE (type) == TYPENAME_TYPE)
12123 if (complain & tf_error)
12124 error ("%q#T is not a valid type for a template constant parameter", type);
12128 /* Returns TRUE if TYPE is dependent, in the sense of [temp.dep.type].
12129 Assumes that TYPE really is a type, and not the ERROR_MARK_NODE.*/
12132 dependent_type_p_r (tree type)
12138 A type is dependent if it is:
12140 -- a template parameter. Template template parameters are types
12141 for us (since TYPE_P holds true for them) so we handle
12143 if (TREE_CODE (type) == TEMPLATE_TYPE_PARM
12144 || TREE_CODE (type) == TEMPLATE_TEMPLATE_PARM)
12146 /* -- a qualified-id with a nested-name-specifier which contains a
12147 class-name that names a dependent type or whose unqualified-id
12148 names a dependent type. */
12149 if (TREE_CODE (type) == TYPENAME_TYPE)
12151 /* -- a cv-qualified type where the cv-unqualified type is
12153 type = TYPE_MAIN_VARIANT (type);
12154 /* -- a compound type constructed from any dependent type. */
12155 if (TYPE_PTR_TO_MEMBER_P (type))
12156 return (dependent_type_p (TYPE_PTRMEM_CLASS_TYPE (type))
12157 || dependent_type_p (TYPE_PTRMEM_POINTED_TO_TYPE
12159 else if (TREE_CODE (type) == POINTER_TYPE
12160 || TREE_CODE (type) == REFERENCE_TYPE)
12161 return dependent_type_p (TREE_TYPE (type));
12162 else if (TREE_CODE (type) == FUNCTION_TYPE
12163 || TREE_CODE (type) == METHOD_TYPE)
12167 if (dependent_type_p (TREE_TYPE (type)))
12169 for (arg_type = TYPE_ARG_TYPES (type);
12171 arg_type = TREE_CHAIN (arg_type))
12172 if (dependent_type_p (TREE_VALUE (arg_type)))
12176 /* -- an array type constructed from any dependent type or whose
12177 size is specified by a constant expression that is
12178 value-dependent. */
12179 if (TREE_CODE (type) == ARRAY_TYPE)
12181 if (TYPE_DOMAIN (type)
12182 && ((value_dependent_expression_p
12183 (TYPE_MAX_VALUE (TYPE_DOMAIN (type))))
12184 || (type_dependent_expression_p
12185 (TYPE_MAX_VALUE (TYPE_DOMAIN (type))))))
12187 return dependent_type_p (TREE_TYPE (type));
12190 /* -- a template-id in which either the template name is a template
12192 if (TREE_CODE (type) == BOUND_TEMPLATE_TEMPLATE_PARM)
12194 /* ... or any of the template arguments is a dependent type or
12195 an expression that is type-dependent or value-dependent. */
12196 else if (CLASS_TYPE_P (type) && CLASSTYPE_TEMPLATE_INFO (type)
12197 && (any_dependent_template_arguments_p
12198 (INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type)))))
12201 /* All TYPEOF_TYPEs are dependent; if the argument of the `typeof'
12202 expression is not type-dependent, then it should already been
12204 if (TREE_CODE (type) == TYPEOF_TYPE)
12207 /* The standard does not specifically mention types that are local
12208 to template functions or local classes, but they should be
12209 considered dependent too. For example:
12211 template <int I> void f() {
12216 The size of `E' cannot be known until the value of `I' has been
12217 determined. Therefore, `E' must be considered dependent. */
12218 scope = TYPE_CONTEXT (type);
12219 if (scope && TYPE_P (scope))
12220 return dependent_type_p (scope);
12221 else if (scope && TREE_CODE (scope) == FUNCTION_DECL)
12222 return type_dependent_expression_p (scope);
12224 /* Other types are non-dependent. */
12228 /* Returns TRUE if TYPE is dependent, in the sense of
12229 [temp.dep.type]. */
12232 dependent_type_p (tree type)
12234 /* If there are no template parameters in scope, then there can't be
12235 any dependent types. */
12236 if (!processing_template_decl)
12239 /* If the type is NULL, we have not computed a type for the entity
12240 in question; in that case, the type is dependent. */
12244 /* Erroneous types can be considered non-dependent. */
12245 if (type == error_mark_node)
12248 /* If we have not already computed the appropriate value for TYPE,
12250 if (!TYPE_DEPENDENT_P_VALID (type))
12252 TYPE_DEPENDENT_P (type) = dependent_type_p_r (type);
12253 TYPE_DEPENDENT_P_VALID (type) = 1;
12256 return TYPE_DEPENDENT_P (type);
12259 /* Returns TRUE if EXPRESSION is dependent, according to CRITERION. */
12262 dependent_scope_ref_p (tree expression, bool criterion (tree))
12267 gcc_assert (TREE_CODE (expression) == SCOPE_REF);
12269 if (!TYPE_P (TREE_OPERAND (expression, 0)))
12272 scope = TREE_OPERAND (expression, 0);
12273 name = TREE_OPERAND (expression, 1);
12277 An id-expression is type-dependent if it contains a
12278 nested-name-specifier that contains a class-name that names a
12280 /* The suggested resolution to Core Issue 2 implies that if the
12281 qualifying type is the current class, then we must peek
12284 && currently_open_class (scope)
12285 && !criterion (name))
12287 if (dependent_type_p (scope))
12293 /* Returns TRUE if the EXPRESSION is value-dependent, in the sense of
12294 [temp.dep.constexpr] */
12297 value_dependent_expression_p (tree expression)
12299 if (!processing_template_decl)
12302 /* A name declared with a dependent type. */
12303 if (DECL_P (expression) && type_dependent_expression_p (expression))
12306 switch (TREE_CODE (expression))
12308 case IDENTIFIER_NODE:
12309 /* A name that has not been looked up -- must be dependent. */
12312 case TEMPLATE_PARM_INDEX:
12313 /* A non-type template parm. */
12317 /* A non-type template parm. */
12318 if (DECL_TEMPLATE_PARM_P (expression))
12323 /* A constant with integral or enumeration type and is initialized
12324 with an expression that is value-dependent. */
12325 if (DECL_INITIAL (expression)
12326 && INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (expression))
12327 && value_dependent_expression_p (DECL_INITIAL (expression)))
12331 case DYNAMIC_CAST_EXPR:
12332 case STATIC_CAST_EXPR:
12333 case CONST_CAST_EXPR:
12334 case REINTERPRET_CAST_EXPR:
12336 /* These expressions are value-dependent if the type to which
12337 the cast occurs is dependent or the expression being casted
12338 is value-dependent. */
12340 tree type = TREE_TYPE (expression);
12342 if (dependent_type_p (type))
12345 /* A functional cast has a list of operands. */
12346 expression = TREE_OPERAND (expression, 0);
12349 /* If there are no operands, it must be an expression such
12350 as "int()". This should not happen for aggregate types
12351 because it would form non-constant expressions. */
12352 gcc_assert (INTEGRAL_OR_ENUMERATION_TYPE_P (type));
12357 if (TREE_CODE (expression) == TREE_LIST)
12359 for (; expression; expression = TREE_CHAIN (expression))
12360 if (value_dependent_expression_p (TREE_VALUE (expression)))
12365 return value_dependent_expression_p (expression);
12370 /* A `sizeof' expression is value-dependent if the operand is
12372 expression = TREE_OPERAND (expression, 0);
12373 if (TYPE_P (expression))
12374 return dependent_type_p (expression);
12375 return type_dependent_expression_p (expression);
12378 return dependent_scope_ref_p (expression, value_dependent_expression_p);
12380 case COMPONENT_REF:
12381 return (value_dependent_expression_p (TREE_OPERAND (expression, 0))
12382 || value_dependent_expression_p (TREE_OPERAND (expression, 1)));
12385 /* A CALL_EXPR is value-dependent if any argument is
12386 value-dependent. Why do we have to handle CALL_EXPRs in this
12387 function at all? First, some function calls, those for which
12388 value_dependent_expression_p is true, man appear in constant
12389 expressions. Second, there appear to be bugs which result in
12390 other CALL_EXPRs reaching this point. */
12392 tree function = TREE_OPERAND (expression, 0);
12393 tree args = TREE_OPERAND (expression, 1);
12395 if (value_dependent_expression_p (function))
12401 if (TREE_CODE (args) == TREE_LIST)
12403 for (; args; args = TREE_CHAIN (args))
12404 if (value_dependent_expression_p (TREE_VALUE (args)))
12409 return value_dependent_expression_p (args);
12413 /* A constant expression is value-dependent if any subexpression is
12414 value-dependent. */
12415 switch (TREE_CODE_CLASS (TREE_CODE (expression)))
12417 case tcc_reference:
12419 return (value_dependent_expression_p
12420 (TREE_OPERAND (expression, 0)));
12422 case tcc_comparison:
12424 return ((value_dependent_expression_p
12425 (TREE_OPERAND (expression, 0)))
12426 || (value_dependent_expression_p
12427 (TREE_OPERAND (expression, 1))));
12429 case tcc_expression:
12432 for (i = 0; i < TREE_CODE_LENGTH (TREE_CODE (expression)); ++i)
12433 /* In some cases, some of the operands may be missing.
12434 (For example, in the case of PREDECREMENT_EXPR, the
12435 amount to increment by may be missing.) That doesn't
12436 make the expression dependent. */
12437 if (TREE_OPERAND (expression, i)
12438 && (value_dependent_expression_p
12439 (TREE_OPERAND (expression, i))))
12449 /* The expression is not value-dependent. */
12453 /* Returns TRUE if the EXPRESSION is type-dependent, in the sense of
12454 [temp.dep.expr]. */
12457 type_dependent_expression_p (tree expression)
12459 if (!processing_template_decl)
12462 if (expression == error_mark_node)
12465 /* An unresolved name is always dependent. */
12466 if (TREE_CODE (expression) == IDENTIFIER_NODE)
12469 /* Some expression forms are never type-dependent. */
12470 if (TREE_CODE (expression) == PSEUDO_DTOR_EXPR
12471 || TREE_CODE (expression) == SIZEOF_EXPR
12472 || TREE_CODE (expression) == ALIGNOF_EXPR
12473 || TREE_CODE (expression) == TYPEID_EXPR
12474 || TREE_CODE (expression) == DELETE_EXPR
12475 || TREE_CODE (expression) == VEC_DELETE_EXPR
12476 || TREE_CODE (expression) == THROW_EXPR)
12479 /* The types of these expressions depends only on the type to which
12480 the cast occurs. */
12481 if (TREE_CODE (expression) == DYNAMIC_CAST_EXPR
12482 || TREE_CODE (expression) == STATIC_CAST_EXPR
12483 || TREE_CODE (expression) == CONST_CAST_EXPR
12484 || TREE_CODE (expression) == REINTERPRET_CAST_EXPR
12485 || TREE_CODE (expression) == CAST_EXPR)
12486 return dependent_type_p (TREE_TYPE (expression));
12488 /* The types of these expressions depends only on the type created
12489 by the expression. */
12490 if (TREE_CODE (expression) == NEW_EXPR
12491 || TREE_CODE (expression) == VEC_NEW_EXPR)
12493 /* For NEW_EXPR tree nodes created inside a template, either
12494 the object type itself or a TREE_LIST may appear as the
12496 tree type = TREE_OPERAND (expression, 1);
12497 if (TREE_CODE (type) == TREE_LIST)
12498 /* This is an array type. We need to check array dimensions
12500 return dependent_type_p (TREE_VALUE (TREE_PURPOSE (type)))
12501 || value_dependent_expression_p
12502 (TREE_OPERAND (TREE_VALUE (type), 1));
12504 return dependent_type_p (type);
12507 if (TREE_CODE (expression) == SCOPE_REF
12508 && dependent_scope_ref_p (expression,
12509 type_dependent_expression_p))
12512 if (TREE_CODE (expression) == FUNCTION_DECL
12513 && DECL_LANG_SPECIFIC (expression)
12514 && DECL_TEMPLATE_INFO (expression)
12515 && (any_dependent_template_arguments_p
12516 (INNERMOST_TEMPLATE_ARGS (DECL_TI_ARGS (expression)))))
12519 if (TREE_CODE (expression) == TEMPLATE_DECL
12520 && !DECL_TEMPLATE_TEMPLATE_PARM_P (expression))
12523 if (TREE_TYPE (expression) == unknown_type_node)
12525 if (TREE_CODE (expression) == ADDR_EXPR)
12526 return type_dependent_expression_p (TREE_OPERAND (expression, 0));
12527 if (TREE_CODE (expression) == COMPONENT_REF
12528 || TREE_CODE (expression) == OFFSET_REF)
12530 if (type_dependent_expression_p (TREE_OPERAND (expression, 0)))
12532 expression = TREE_OPERAND (expression, 1);
12533 if (TREE_CODE (expression) == IDENTIFIER_NODE)
12536 /* SCOPE_REF with non-null TREE_TYPE is always non-dependent. */
12537 if (TREE_CODE (expression) == SCOPE_REF)
12540 if (TREE_CODE (expression) == BASELINK)
12541 expression = BASELINK_FUNCTIONS (expression);
12543 if (TREE_CODE (expression) == TEMPLATE_ID_EXPR)
12545 if (any_dependent_template_arguments_p
12546 (TREE_OPERAND (expression, 1)))
12548 expression = TREE_OPERAND (expression, 0);
12550 gcc_assert (TREE_CODE (expression) == OVERLOAD
12551 || TREE_CODE (expression) == FUNCTION_DECL);
12555 if (type_dependent_expression_p (OVL_CURRENT (expression)))
12557 expression = OVL_NEXT (expression);
12562 gcc_assert (TREE_CODE (expression) != TYPE_DECL);
12564 return (dependent_type_p (TREE_TYPE (expression)));
12567 /* Returns TRUE if ARGS (a TREE_LIST of arguments to a function call)
12568 contains a type-dependent expression. */
12571 any_type_dependent_arguments_p (tree args)
12575 tree arg = TREE_VALUE (args);
12577 if (type_dependent_expression_p (arg))
12579 args = TREE_CHAIN (args);
12584 /* Returns TRUE if the ARG (a template argument) is dependent. */
12587 dependent_template_arg_p (tree arg)
12589 if (!processing_template_decl)
12592 if (TREE_CODE (arg) == TEMPLATE_DECL
12593 || TREE_CODE (arg) == TEMPLATE_TEMPLATE_PARM)
12594 return dependent_template_p (arg);
12595 else if (TYPE_P (arg))
12596 return dependent_type_p (arg);
12598 return (type_dependent_expression_p (arg)
12599 || value_dependent_expression_p (arg));
12602 /* Returns true if ARGS (a collection of template arguments) contains
12603 any dependent arguments. */
12606 any_dependent_template_arguments_p (tree args)
12614 for (i = 0; i < TMPL_ARGS_DEPTH (args); ++i)
12616 tree level = TMPL_ARGS_LEVEL (args, i + 1);
12617 for (j = 0; j < TREE_VEC_LENGTH (level); ++j)
12618 if (dependent_template_arg_p (TREE_VEC_ELT (level, j)))
12625 /* Returns TRUE if the template TMPL is dependent. */
12628 dependent_template_p (tree tmpl)
12630 if (TREE_CODE (tmpl) == OVERLOAD)
12634 if (dependent_template_p (OVL_FUNCTION (tmpl)))
12636 tmpl = OVL_CHAIN (tmpl);
12641 /* Template template parameters are dependent. */
12642 if (DECL_TEMPLATE_TEMPLATE_PARM_P (tmpl)
12643 || TREE_CODE (tmpl) == TEMPLATE_TEMPLATE_PARM)
12645 /* So are names that have not been looked up. */
12646 if (TREE_CODE (tmpl) == SCOPE_REF
12647 || TREE_CODE (tmpl) == IDENTIFIER_NODE)
12649 /* So are member templates of dependent classes. */
12650 if (TYPE_P (CP_DECL_CONTEXT (tmpl)))
12651 return dependent_type_p (DECL_CONTEXT (tmpl));
12655 /* Returns TRUE if the specialization TMPL<ARGS> is dependent. */
12658 dependent_template_id_p (tree tmpl, tree args)
12660 return (dependent_template_p (tmpl)
12661 || any_dependent_template_arguments_p (args));
12664 /* TYPE is a TYPENAME_TYPE. Returns the ordinary TYPE to which the
12665 TYPENAME_TYPE corresponds. Returns ERROR_MARK_NODE if no such TYPE
12666 can be found. Note that this function peers inside uninstantiated
12667 templates and therefore should be used only in extremely limited
12668 situations. ONLY_CURRENT_P restricts this peering to the currently
12669 open classes hierarchy (which is required when comparing types). */
12672 resolve_typename_type (tree type, bool only_current_p)
12680 gcc_assert (TREE_CODE (type) == TYPENAME_TYPE);
12682 scope = TYPE_CONTEXT (type);
12683 name = TYPE_IDENTIFIER (type);
12685 /* If the SCOPE is itself a TYPENAME_TYPE, then we need to resolve
12686 it first before we can figure out what NAME refers to. */
12687 if (TREE_CODE (scope) == TYPENAME_TYPE)
12688 scope = resolve_typename_type (scope, only_current_p);
12689 /* If we don't know what SCOPE refers to, then we cannot resolve the
12691 if (scope == error_mark_node || TREE_CODE (scope) == TYPENAME_TYPE)
12692 return error_mark_node;
12693 /* If the SCOPE is a template type parameter, we have no way of
12694 resolving the name. */
12695 if (TREE_CODE (scope) == TEMPLATE_TYPE_PARM)
12697 /* If the SCOPE is not the current instantiation, there's no reason
12698 to look inside it. */
12699 if (only_current_p && !currently_open_class (scope))
12700 return error_mark_node;
12701 /* If SCOPE is a partial instantiation, it will not have a valid
12702 TYPE_FIELDS list, so use the original template. */
12703 scope = CLASSTYPE_PRIMARY_TEMPLATE_TYPE (scope);
12704 /* Enter the SCOPE so that name lookup will be resolved as if we
12705 were in the class definition. In particular, SCOPE will no
12706 longer be considered a dependent type. */
12707 pushed_scope = push_scope (scope);
12708 /* Look up the declaration. */
12709 decl = lookup_member (scope, name, /*protect=*/0, /*want_type=*/true);
12710 /* Obtain the set of qualifiers applied to the TYPE. */
12711 quals = cp_type_quals (type);
12712 /* For a TYPENAME_TYPE like "typename X::template Y<T>", we want to
12713 find a TEMPLATE_DECL. Otherwise, we want to find a TYPE_DECL. */
12715 type = error_mark_node;
12716 else if (TREE_CODE (TYPENAME_TYPE_FULLNAME (type)) == IDENTIFIER_NODE
12717 && TREE_CODE (decl) == TYPE_DECL)
12718 type = TREE_TYPE (decl);
12719 else if (TREE_CODE (TYPENAME_TYPE_FULLNAME (type)) == TEMPLATE_ID_EXPR
12720 && DECL_CLASS_TEMPLATE_P (decl))
12724 /* Obtain the template and the arguments. */
12725 tmpl = TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type), 0);
12726 args = TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type), 1);
12727 /* Instantiate the template. */
12728 type = lookup_template_class (tmpl, args, NULL_TREE, NULL_TREE,
12729 /*entering_scope=*/0, tf_error | tf_user);
12732 type = error_mark_node;
12733 /* Qualify the resulting type. */
12734 if (type != error_mark_node && quals)
12735 type = cp_build_qualified_type (type, quals);
12736 /* Leave the SCOPE. */
12738 pop_scope (pushed_scope);
12743 /* EXPR is an expression which is not type-dependent. Return a proxy
12744 for EXPR that can be used to compute the types of larger
12745 expressions containing EXPR. */
12748 build_non_dependent_expr (tree expr)
12752 /* Preserve null pointer constants so that the type of things like
12753 "p == 0" where "p" is a pointer can be determined. */
12754 if (null_ptr_cst_p (expr))
12756 /* Preserve OVERLOADs; the functions must be available to resolve
12758 inner_expr = (TREE_CODE (expr) == ADDR_EXPR ?
12759 TREE_OPERAND (expr, 0) :
12760 TREE_CODE (expr) == COMPONENT_REF ?
12761 TREE_OPERAND (expr, 1) : expr);
12762 if (is_overloaded_fn (inner_expr)
12763 || TREE_CODE (inner_expr) == OFFSET_REF)
12765 /* There is no need to return a proxy for a variable. */
12766 if (TREE_CODE (expr) == VAR_DECL)
12768 /* Preserve string constants; conversions from string constants to
12769 "char *" are allowed, even though normally a "const char *"
12770 cannot be used to initialize a "char *". */
12771 if (TREE_CODE (expr) == STRING_CST)
12773 /* Preserve arithmetic constants, as an optimization -- there is no
12774 reason to create a new node. */
12775 if (TREE_CODE (expr) == INTEGER_CST || TREE_CODE (expr) == REAL_CST)
12777 /* Preserve THROW_EXPRs -- all throw-expressions have type "void".
12778 There is at least one place where we want to know that a
12779 particular expression is a throw-expression: when checking a ?:
12780 expression, there are special rules if the second or third
12781 argument is a throw-expression. */
12782 if (TREE_CODE (expr) == THROW_EXPR)
12785 if (TREE_CODE (expr) == COND_EXPR)
12786 return build3 (COND_EXPR,
12788 TREE_OPERAND (expr, 0),
12789 (TREE_OPERAND (expr, 1)
12790 ? build_non_dependent_expr (TREE_OPERAND (expr, 1))
12791 : build_non_dependent_expr (TREE_OPERAND (expr, 0))),
12792 build_non_dependent_expr (TREE_OPERAND (expr, 2)));
12793 if (TREE_CODE (expr) == COMPOUND_EXPR
12794 && !COMPOUND_EXPR_OVERLOADED (expr))
12795 return build2 (COMPOUND_EXPR,
12797 TREE_OPERAND (expr, 0),
12798 build_non_dependent_expr (TREE_OPERAND (expr, 1)));
12800 /* If the type is unknown, it can't really be non-dependent */
12801 gcc_assert (TREE_TYPE (expr) != unknown_type_node);
12803 /* Otherwise, build a NON_DEPENDENT_EXPR.
12805 REFERENCE_TYPEs are not stripped for expressions in templates
12806 because doing so would play havoc with mangling. Consider, for
12809 template <typename T> void f<T& g>() { g(); }
12811 In the body of "f", the expression for "g" will have
12812 REFERENCE_TYPE, even though the standard says that it should
12813 not. The reason is that we must preserve the syntactic form of
12814 the expression so that mangling (say) "f<g>" inside the body of
12815 "f" works out correctly. Therefore, the REFERENCE_TYPE is
12817 return build1 (NON_DEPENDENT_EXPR, non_reference (TREE_TYPE (expr)), expr);
12820 /* ARGS is a TREE_LIST of expressions as arguments to a function call.
12821 Return a new TREE_LIST with the various arguments replaced with
12822 equivalent non-dependent expressions. */
12825 build_non_dependent_args (tree args)
12830 new_args = NULL_TREE;
12831 for (a = args; a; a = TREE_CHAIN (a))
12832 new_args = tree_cons (NULL_TREE,
12833 build_non_dependent_expr (TREE_VALUE (a)),
12835 return nreverse (new_args);
12838 #include "gt-cp-pt.h"