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 Free Software Foundation, Inc.
4 Written by Ken Raeburn (raeburn@cygnus.com) while at Watchmaker Computing.
5 Rewritten by Jason Merrill (jason@cygnus.com).
7 This file is part of GCC.
9 GCC is free software; you can redistribute it and/or modify
10 it under the terms of the GNU General Public License as published by
11 the Free Software Foundation; either version 2, or (at your option)
14 GCC is distributed in the hope that it will be useful,
15 but WITHOUT ANY WARRANTY; without even the implied warranty of
16 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 GNU General Public License for more details.
19 You should have received a copy of the GNU General Public License
20 along with GCC; see the file COPYING. If not, write to
21 the Free Software Foundation, 59 Temple Place - Suite 330,
22 Boston, MA 02111-1307, USA. */
24 /* Known bugs or deficiencies include:
26 all methods must be provided in header files; can't use a source
27 file that contains only the method templates and "just win". */
31 #include "coretypes.h"
37 #include "tree-inline.h"
44 #include "tree-iterator.h"
46 /* The type of functions taking a tree, and some additional data, and
48 typedef int (*tree_fn_t) (tree, void*);
50 /* The PENDING_TEMPLATES is a TREE_LIST of templates whose
51 instantiations have been deferred, either because their definitions
52 were not yet available, or because we were putting off doing the work.
53 The TREE_PURPOSE of each entry is either a DECL (for a function or
54 static data member), or a TYPE (for a class) indicating what we are
55 hoping to instantiate. The TREE_VALUE is not used. */
56 static GTY(()) tree pending_templates;
57 static GTY(()) tree last_pending_template;
59 int processing_template_parmlist;
60 static int template_header_count;
62 static GTY(()) tree saved_trees;
63 static GTY(()) varray_type inline_parm_levels;
64 static size_t inline_parm_levels_used;
66 static GTY(()) tree current_tinst_level;
68 static GTY(()) tree saved_access_scope;
70 /* A map from local variable declarations in the body of the template
71 presently being instantiated to the corresponding instantiated
73 static htab_t local_specializations;
75 #define UNIFY_ALLOW_NONE 0
76 #define UNIFY_ALLOW_MORE_CV_QUAL 1
77 #define UNIFY_ALLOW_LESS_CV_QUAL 2
78 #define UNIFY_ALLOW_DERIVED 4
79 #define UNIFY_ALLOW_INTEGER 8
80 #define UNIFY_ALLOW_OUTER_LEVEL 16
81 #define UNIFY_ALLOW_OUTER_MORE_CV_QUAL 32
82 #define UNIFY_ALLOW_OUTER_LESS_CV_QUAL 64
83 #define UNIFY_ALLOW_MAX_CORRECTION 128
85 #define GTB_VIA_VIRTUAL 1 /* The base class we are examining is
86 virtual, or a base class of a virtual
88 #define GTB_IGNORE_TYPE 2 /* We don't need to try to unify the current
89 type with the desired type. */
91 static void push_access_scope (tree);
92 static void pop_access_scope (tree);
93 static int resolve_overloaded_unification (tree, tree, tree, tree,
94 unification_kind_t, int);
95 static int try_one_overload (tree, tree, tree, tree, tree,
96 unification_kind_t, int, bool);
97 static int unify (tree, tree, tree, tree, int);
98 static void add_pending_template (tree);
99 static void reopen_tinst_level (tree);
100 static tree classtype_mangled_name (tree);
101 static char* mangle_class_name_for_template (const char *, tree, tree);
102 static tree tsubst_initializer_list (tree, tree);
103 static tree get_class_bindings (tree, tree, tree);
104 static tree coerce_template_parms (tree, tree, tree, tsubst_flags_t, int);
105 static void tsubst_enum (tree, tree, tree);
106 static tree add_to_template_args (tree, tree);
107 static tree add_outermost_template_args (tree, tree);
108 static bool check_instantiated_args (tree, tree, tsubst_flags_t);
109 static int maybe_adjust_types_for_deduction (unification_kind_t, tree*, tree*);
110 static int type_unification_real (tree, tree, tree, tree,
111 int, unification_kind_t, int, int);
112 static void note_template_header (int);
113 static tree convert_nontype_argument (tree, tree);
114 static tree convert_template_argument (tree, tree, tree,
115 tsubst_flags_t, int, tree);
116 static tree get_bindings_overload (tree, tree, tree);
117 static int for_each_template_parm (tree, tree_fn_t, void*, htab_t);
118 static tree build_template_parm_index (int, int, int, tree, tree);
119 static int inline_needs_template_parms (tree);
120 static void push_inline_template_parms_recursive (tree, int);
121 static tree retrieve_specialization (tree, tree);
122 static tree retrieve_local_specialization (tree);
123 static tree register_specialization (tree, tree, tree);
124 static void register_local_specialization (tree, tree);
125 static tree reduce_template_parm_level (tree, tree, int);
126 static tree build_template_decl (tree, tree);
127 static int mark_template_parm (tree, void *);
128 static int template_parm_this_level_p (tree, void *);
129 static tree tsubst_friend_function (tree, tree);
130 static tree tsubst_friend_class (tree, tree);
131 static int can_complete_type_without_circularity (tree);
132 static tree get_bindings (tree, tree, tree);
133 static tree get_bindings_real (tree, tree, tree, int, int, int);
134 static int template_decl_level (tree);
135 static int check_cv_quals_for_unify (int, tree, tree);
136 static tree tsubst_template_arg (tree, tree, tsubst_flags_t, tree);
137 static tree tsubst_template_args (tree, tree, tsubst_flags_t, tree);
138 static tree tsubst_template_parms (tree, tree, tsubst_flags_t);
139 static void regenerate_decl_from_template (tree, tree);
140 static tree most_specialized (tree, tree, tree);
141 static tree most_specialized_class (tree, tree);
142 static int template_class_depth_real (tree, int);
143 static tree tsubst_aggr_type (tree, tree, tsubst_flags_t, tree, int);
144 static tree tsubst_decl (tree, tree, tree, tsubst_flags_t);
145 static tree tsubst_arg_types (tree, tree, tsubst_flags_t, tree);
146 static tree tsubst_function_type (tree, tree, tsubst_flags_t, tree);
147 static void check_specialization_scope (void);
148 static tree process_partial_specialization (tree);
149 static void set_current_access_from_decl (tree);
150 static void check_default_tmpl_args (tree, tree, int, int);
151 static tree tsubst_call_declarator_parms (tree, tree, tsubst_flags_t, tree);
152 static tree get_template_base_recursive (tree, tree, tree, tree, tree, int);
153 static tree get_template_base (tree, tree, tree, tree);
154 static int verify_class_unification (tree, tree, tree);
155 static tree try_class_unification (tree, tree, tree, tree);
156 static int coerce_template_template_parms (tree, tree, tsubst_flags_t,
158 static tree determine_specialization (tree, tree, tree *, int);
159 static int template_args_equal (tree, tree);
160 static void tsubst_default_arguments (tree);
161 static tree for_each_template_parm_r (tree *, int *, void *);
162 static tree copy_default_args_to_explicit_spec_1 (tree, tree);
163 static void copy_default_args_to_explicit_spec (tree);
164 static int invalid_nontype_parm_type_p (tree, tsubst_flags_t);
165 static int eq_local_specializations (const void *, const void *);
166 static bool dependent_type_p_r (tree);
167 static tree tsubst (tree, tree, tsubst_flags_t, tree);
168 static tree tsubst_expr (tree, tree, tsubst_flags_t, tree);
169 static tree tsubst_copy (tree, tree, tsubst_flags_t, tree);
171 /* Make the current scope suitable for access checking when we are
172 processing T. T can be FUNCTION_DECL for instantiated function
173 template, or VAR_DECL for static member variable (need by
174 instantiate_decl). */
177 push_access_scope (tree t)
179 my_friendly_assert (TREE_CODE (t) == FUNCTION_DECL
180 || TREE_CODE (t) == VAR_DECL,
183 if (DECL_CLASS_SCOPE_P (t))
184 push_nested_class (DECL_CONTEXT (t));
186 push_to_top_level ();
188 if (TREE_CODE (t) == FUNCTION_DECL)
190 saved_access_scope = tree_cons
191 (NULL_TREE, current_function_decl, saved_access_scope);
192 current_function_decl = t;
196 /* Restore the scope set up by push_access_scope. T is the node we
200 pop_access_scope (tree t)
202 if (TREE_CODE (t) == FUNCTION_DECL)
204 current_function_decl = TREE_VALUE (saved_access_scope);
205 saved_access_scope = TREE_CHAIN (saved_access_scope);
208 if (DECL_CLASS_SCOPE_P (t))
211 pop_from_top_level ();
214 /* Do any processing required when DECL (a member template
215 declaration) is finished. Returns the TEMPLATE_DECL corresponding
216 to DECL, unless it is a specialization, in which case the DECL
217 itself is returned. */
220 finish_member_template_decl (tree decl)
222 if (decl == error_mark_node)
223 return error_mark_node;
225 my_friendly_assert (DECL_P (decl), 20020812);
227 if (TREE_CODE (decl) == TYPE_DECL)
231 type = TREE_TYPE (decl);
232 if (IS_AGGR_TYPE (type)
233 && CLASSTYPE_TEMPLATE_INFO (type)
234 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (type))
236 tree tmpl = CLASSTYPE_TI_TEMPLATE (type);
237 check_member_template (tmpl);
242 else if (TREE_CODE (decl) == FIELD_DECL)
243 error ("data member `%D' cannot be a member template", decl);
244 else if (DECL_TEMPLATE_INFO (decl))
246 if (!DECL_TEMPLATE_SPECIALIZATION (decl))
248 check_member_template (DECL_TI_TEMPLATE (decl));
249 return DECL_TI_TEMPLATE (decl);
255 error ("invalid member template declaration `%D'", decl);
257 return error_mark_node;
260 /* Returns the template nesting level of the indicated class TYPE.
270 A<T>::B<U> has depth two, while A<T> has depth one.
271 Both A<T>::B<int> and A<int>::B<U> have depth one, if
272 COUNT_SPECIALIZATIONS is 0 or if they are instantiations, not
275 This function is guaranteed to return 0 if passed NULL_TREE so
276 that, for example, `template_class_depth (current_class_type)' is
280 template_class_depth_real (tree type, int count_specializations)
285 type && TREE_CODE (type) != NAMESPACE_DECL;
286 type = (TREE_CODE (type) == FUNCTION_DECL)
287 ? CP_DECL_CONTEXT (type) : TYPE_CONTEXT (type))
289 if (TREE_CODE (type) != FUNCTION_DECL)
291 if (CLASSTYPE_TEMPLATE_INFO (type)
292 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (type))
293 && ((count_specializations
294 && CLASSTYPE_TEMPLATE_SPECIALIZATION (type))
295 || uses_template_parms (CLASSTYPE_TI_ARGS (type))))
300 if (DECL_TEMPLATE_INFO (type)
301 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (type))
302 && ((count_specializations
303 && DECL_TEMPLATE_SPECIALIZATION (type))
304 || uses_template_parms (DECL_TI_ARGS (type))))
312 /* Returns the template nesting level of the indicated class TYPE.
313 Like template_class_depth_real, but instantiations do not count in
317 template_class_depth (tree type)
319 return template_class_depth_real (type, /*count_specializations=*/0);
322 /* Returns 1 if processing DECL as part of do_pending_inlines
323 needs us to push template parms. */
326 inline_needs_template_parms (tree decl)
328 if (! DECL_TEMPLATE_INFO (decl))
331 return (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (most_general_template (decl)))
332 > (processing_template_decl + DECL_TEMPLATE_SPECIALIZATION (decl)));
335 /* Subroutine of maybe_begin_member_template_processing.
336 Push the template parms in PARMS, starting from LEVELS steps into the
337 chain, and ending at the beginning, since template parms are listed
341 push_inline_template_parms_recursive (tree parmlist, int levels)
343 tree parms = TREE_VALUE (parmlist);
347 push_inline_template_parms_recursive (TREE_CHAIN (parmlist), levels - 1);
349 ++processing_template_decl;
350 current_template_parms
351 = tree_cons (size_int (processing_template_decl),
352 parms, current_template_parms);
353 TEMPLATE_PARMS_FOR_INLINE (current_template_parms) = 1;
355 begin_scope (TREE_VEC_LENGTH (parms) ? sk_template_parms : sk_template_spec,
357 for (i = 0; i < TREE_VEC_LENGTH (parms); ++i)
359 tree parm = TREE_VALUE (TREE_VEC_ELT (parms, i));
360 my_friendly_assert (DECL_P (parm), 0);
362 switch (TREE_CODE (parm))
371 /* Make a CONST_DECL as is done in process_template_parm.
372 It is ugly that we recreate this here; the original
373 version built in process_template_parm is no longer
375 tree decl = build_decl (CONST_DECL, DECL_NAME (parm),
377 DECL_ARTIFICIAL (decl) = 1;
378 TREE_CONSTANT (decl) = 1;
379 TREE_INVARIANT (decl) = 1;
380 TREE_READONLY (decl) = 1;
381 DECL_INITIAL (decl) = DECL_INITIAL (parm);
382 SET_DECL_TEMPLATE_PARM_P (decl);
393 /* Restore the template parameter context for a member template or
394 a friend template defined in a class definition. */
397 maybe_begin_member_template_processing (tree decl)
402 if (inline_needs_template_parms (decl))
404 parms = DECL_TEMPLATE_PARMS (most_general_template (decl));
405 levels = TMPL_PARMS_DEPTH (parms) - processing_template_decl;
407 if (DECL_TEMPLATE_SPECIALIZATION (decl))
410 parms = TREE_CHAIN (parms);
413 push_inline_template_parms_recursive (parms, levels);
416 /* Remember how many levels of template parameters we pushed so that
417 we can pop them later. */
418 if (!inline_parm_levels)
419 VARRAY_INT_INIT (inline_parm_levels, 4, "inline_parm_levels");
420 if (inline_parm_levels_used == inline_parm_levels->num_elements)
421 VARRAY_GROW (inline_parm_levels, 2 * inline_parm_levels_used);
422 VARRAY_INT (inline_parm_levels, inline_parm_levels_used) = levels;
423 ++inline_parm_levels_used;
426 /* Undo the effects of begin_member_template_processing. */
429 maybe_end_member_template_processing (void)
433 if (!inline_parm_levels_used)
436 --inline_parm_levels_used;
438 i < VARRAY_INT (inline_parm_levels, inline_parm_levels_used);
441 --processing_template_decl;
442 current_template_parms = TREE_CHAIN (current_template_parms);
447 /* Returns nonzero iff T is a member template function. We must be
450 template <class T> class C { void f(); }
452 Here, f is a template function, and a member, but not a member
453 template. This function does not concern itself with the origin of
454 T, only its present state. So if we have
456 template <class T> class C { template <class U> void f(U); }
458 then neither C<int>::f<char> nor C<T>::f<double> is considered
459 to be a member template. But, `template <class U> void
460 C<int>::f(U)' is considered a member template. */
463 is_member_template (tree t)
465 if (!DECL_FUNCTION_TEMPLATE_P (t))
466 /* Anything that isn't a function or a template function is
467 certainly not a member template. */
470 /* A local class can't have member templates. */
471 if (decl_function_context (t))
474 return (DECL_FUNCTION_MEMBER_P (DECL_TEMPLATE_RESULT (t))
475 /* If there are more levels of template parameters than
476 there are template classes surrounding the declaration,
477 then we have a member template. */
478 && (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (t)) >
479 template_class_depth (DECL_CONTEXT (t))));
483 /* Returns nonzero iff T is a member template class. See
484 is_member_template for a description of what precisely constitutes
485 a member template. */
488 is_member_template_class (tree t)
490 if (!DECL_CLASS_TEMPLATE_P (t))
491 /* Anything that isn't a class template, is certainly not a member
495 if (!DECL_CLASS_SCOPE_P (t))
496 /* Anything whose context isn't a class type is surely not a
500 /* If there are more levels of template parameters than there are
501 template classes surrounding the declaration, then we have a
503 return (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (t)) >
504 template_class_depth (DECL_CONTEXT (t)));
508 /* Return a new template argument vector which contains all of ARGS,
509 but has as its innermost set of arguments the EXTRA_ARGS. */
512 add_to_template_args (tree args, tree extra_args)
519 extra_depth = TMPL_ARGS_DEPTH (extra_args);
520 new_args = make_tree_vec (TMPL_ARGS_DEPTH (args) + extra_depth);
522 for (i = 1; i <= TMPL_ARGS_DEPTH (args); ++i)
523 SET_TMPL_ARGS_LEVEL (new_args, i, TMPL_ARGS_LEVEL (args, i));
525 for (j = 1; j <= extra_depth; ++j, ++i)
526 SET_TMPL_ARGS_LEVEL (new_args, i, TMPL_ARGS_LEVEL (extra_args, j));
531 /* Like add_to_template_args, but only the outermost ARGS are added to
532 the EXTRA_ARGS. In particular, all but TMPL_ARGS_DEPTH
533 (EXTRA_ARGS) levels are added. This function is used to combine
534 the template arguments from a partial instantiation with the
535 template arguments used to attain the full instantiation from the
536 partial instantiation. */
539 add_outermost_template_args (tree args, tree extra_args)
543 /* If there are more levels of EXTRA_ARGS than there are ARGS,
544 something very fishy is going on. */
545 my_friendly_assert (TMPL_ARGS_DEPTH (args) >= TMPL_ARGS_DEPTH (extra_args),
548 /* If *all* the new arguments will be the EXTRA_ARGS, just return
550 if (TMPL_ARGS_DEPTH (args) == TMPL_ARGS_DEPTH (extra_args))
553 /* For the moment, we make ARGS look like it contains fewer levels. */
554 TREE_VEC_LENGTH (args) -= TMPL_ARGS_DEPTH (extra_args);
556 new_args = add_to_template_args (args, extra_args);
558 /* Now, we restore ARGS to its full dimensions. */
559 TREE_VEC_LENGTH (args) += TMPL_ARGS_DEPTH (extra_args);
564 /* Return the N levels of innermost template arguments from the ARGS. */
567 get_innermost_template_args (tree args, int n)
573 my_friendly_assert (n >= 0, 20000603);
575 /* If N is 1, just return the innermost set of template arguments. */
577 return TMPL_ARGS_LEVEL (args, TMPL_ARGS_DEPTH (args));
579 /* If we're not removing anything, just return the arguments we were
581 extra_levels = TMPL_ARGS_DEPTH (args) - n;
582 my_friendly_assert (extra_levels >= 0, 20000603);
583 if (extra_levels == 0)
586 /* Make a new set of arguments, not containing the outer arguments. */
587 new_args = make_tree_vec (n);
588 for (i = 1; i <= n; ++i)
589 SET_TMPL_ARGS_LEVEL (new_args, i,
590 TMPL_ARGS_LEVEL (args, i + extra_levels));
595 /* We've got a template header coming up; push to a new level for storing
599 begin_template_parm_list (void)
601 /* We use a non-tag-transparent scope here, which causes pushtag to
602 put tags in this scope, rather than in the enclosing class or
603 namespace scope. This is the right thing, since we want
604 TEMPLATE_DECLS, and not TYPE_DECLS for template classes. For a
605 global template class, push_template_decl handles putting the
606 TEMPLATE_DECL into top-level scope. For a nested template class,
609 template <class T> struct S1 {
610 template <class T> struct S2 {};
613 pushtag contains special code to call pushdecl_with_scope on the
614 TEMPLATE_DECL for S2. */
615 begin_scope (sk_template_parms, NULL);
616 ++processing_template_decl;
617 ++processing_template_parmlist;
618 note_template_header (0);
621 /* This routine is called when a specialization is declared. If it is
622 invalid to declare a specialization here, an error is reported. */
625 check_specialization_scope (void)
627 tree scope = current_scope ();
631 An explicit specialization shall be declared in the namespace of
632 which the template is a member, or, for member templates, in the
633 namespace of which the enclosing class or enclosing class
634 template is a member. An explicit specialization of a member
635 function, member class or static data member of a class template
636 shall be declared in the namespace of which the class template
638 if (scope && TREE_CODE (scope) != NAMESPACE_DECL)
639 error ("explicit specialization in non-namespace scope `%D'",
644 In an explicit specialization declaration for a member of a class
645 template or a member template that appears in namespace scope,
646 the member template and some of its enclosing class templates may
647 remain unspecialized, except that the declaration shall not
648 explicitly specialize a class member template if its enclosing
649 class templates are not explicitly specialized as well. */
650 if (current_template_parms)
651 error ("enclosing class templates are not explicitly specialized");
654 /* We've just seen template <>. */
657 begin_specialization (void)
659 begin_scope (sk_template_spec, NULL);
660 note_template_header (1);
661 check_specialization_scope ();
664 /* Called at then end of processing a declaration preceded by
668 end_specialization (void)
671 reset_specialization ();
674 /* Any template <>'s that we have seen thus far are not referring to a
675 function specialization. */
678 reset_specialization (void)
680 processing_specialization = 0;
681 template_header_count = 0;
684 /* We've just seen a template header. If SPECIALIZATION is nonzero,
685 it was of the form template <>. */
688 note_template_header (int specialization)
690 processing_specialization = specialization;
691 template_header_count++;
694 /* We're beginning an explicit instantiation. */
697 begin_explicit_instantiation (void)
699 my_friendly_assert (!processing_explicit_instantiation, 20020913);
700 processing_explicit_instantiation = true;
705 end_explicit_instantiation (void)
707 my_friendly_assert(processing_explicit_instantiation, 20020913);
708 processing_explicit_instantiation = false;
711 /* The TYPE is being declared. If it is a template type, that means it
712 is a partial specialization. Do appropriate error-checking. */
715 maybe_process_partial_specialization (tree type)
717 /* TYPE maybe an ERROR_MARK_NODE. */
718 tree context = TYPE_P (type) ? TYPE_CONTEXT (type) : NULL_TREE;
720 if (CLASS_TYPE_P (type) && CLASSTYPE_USE_TEMPLATE (type))
722 /* This is for ordinary explicit specialization and partial
723 specialization of a template class such as:
725 template <> class C<int>;
729 template <class T> class C<T*>;
731 Make sure that `C<int>' and `C<T*>' are implicit instantiations. */
733 if (CLASSTYPE_IMPLICIT_INSTANTIATION (type)
734 && !COMPLETE_TYPE_P (type))
736 tree tpl_ns = decl_namespace_context (CLASSTYPE_TI_TEMPLATE (type));
737 if (is_associated_namespace (current_namespace, tpl_ns))
738 /* Same or super-using namespace. */;
741 pedwarn ("specializing `%#T' in different namespace", type);
742 cp_pedwarn_at (" from definition of `%#D'",
743 CLASSTYPE_TI_TEMPLATE (type));
745 SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (type);
746 if (processing_template_decl)
747 push_template_decl (TYPE_MAIN_DECL (type));
749 else if (CLASSTYPE_TEMPLATE_INSTANTIATION (type))
750 error ("specialization of `%T' after instantiation", type);
752 else if (CLASS_TYPE_P (type)
753 && !CLASSTYPE_USE_TEMPLATE (type)
754 && CLASSTYPE_TEMPLATE_INFO (type)
755 && context && CLASS_TYPE_P (context)
756 && CLASSTYPE_TEMPLATE_INFO (context))
758 /* This is for an explicit specialization of member class
759 template according to [temp.expl.spec/18]:
761 template <> template <class U> class C<int>::D;
763 The context `C<int>' must be an implicit instantiation.
764 Otherwise this is just a member class template declared
767 template <> class C<int> { template <class U> class D; };
768 template <> template <class U> class C<int>::D;
770 In the first case, `C<int>::D' is a specialization of `C<T>::D'
771 while in the second case, `C<int>::D' is a primary template
772 and `C<T>::D' may not exist. */
774 if (CLASSTYPE_IMPLICIT_INSTANTIATION (context)
775 && !COMPLETE_TYPE_P (type))
779 if (current_namespace
780 != decl_namespace_context (CLASSTYPE_TI_TEMPLATE (type)))
782 pedwarn ("specializing `%#T' in different namespace", type);
783 cp_pedwarn_at (" from definition of `%#D'",
784 CLASSTYPE_TI_TEMPLATE (type));
787 /* Check for invalid specialization after instantiation:
789 template <> template <> class C<int>::D<int>;
790 template <> template <class U> class C<int>::D; */
792 for (t = DECL_TEMPLATE_INSTANTIATIONS
793 (most_general_template (CLASSTYPE_TI_TEMPLATE (type)));
794 t; t = TREE_CHAIN (t))
795 if (TREE_VALUE (t) != type
796 && TYPE_CONTEXT (TREE_VALUE (t)) == context)
797 error ("specialization `%T' after instantiation `%T'",
798 type, TREE_VALUE (t));
800 /* Mark TYPE as a specialization. And as a result, we only
801 have one level of template argument for the innermost
803 SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (type);
804 CLASSTYPE_TI_ARGS (type)
805 = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type));
808 else if (processing_specialization)
809 error ("explicit specialization of non-template `%T'", type);
812 /* Retrieve the specialization (in the sense of [temp.spec] - a
813 specialization is either an instantiation or an explicit
814 specialization) of TMPL for the given template ARGS. If there is
815 no such specialization, return NULL_TREE. The ARGS are a vector of
816 arguments, or a vector of vectors of arguments, in the case of
817 templates with more than one level of parameters. */
820 retrieve_specialization (tree tmpl, tree args)
824 my_friendly_assert (TREE_CODE (tmpl) == TEMPLATE_DECL, 0);
826 /* There should be as many levels of arguments as there are
827 levels of parameters. */
828 my_friendly_assert (TMPL_ARGS_DEPTH (args)
829 == TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl)),
832 for (s = DECL_TEMPLATE_SPECIALIZATIONS (tmpl);
835 if (comp_template_args (TREE_PURPOSE (s), args))
836 return TREE_VALUE (s);
841 /* Like retrieve_specialization, but for local declarations. */
844 retrieve_local_specialization (tree tmpl)
846 tree spec = htab_find_with_hash (local_specializations, tmpl,
847 htab_hash_pointer (tmpl));
848 return spec ? TREE_PURPOSE (spec) : NULL_TREE;
851 /* Returns nonzero iff DECL is a specialization of TMPL. */
854 is_specialization_of (tree decl, tree tmpl)
858 if (TREE_CODE (decl) == FUNCTION_DECL)
862 t = DECL_TEMPLATE_INFO (t) ? DECL_TI_TEMPLATE (t) : NULL_TREE)
868 my_friendly_assert (TREE_CODE (decl) == TYPE_DECL, 0);
870 for (t = TREE_TYPE (decl);
872 t = CLASSTYPE_USE_TEMPLATE (t)
873 ? TREE_TYPE (CLASSTYPE_TI_TEMPLATE (t)) : NULL_TREE)
874 if (same_type_ignoring_top_level_qualifiers_p (t, TREE_TYPE (tmpl)))
881 /* Returns nonzero iff DECL is a specialization of friend declaration
882 FRIEND according to [temp.friend]. */
885 is_specialization_of_friend (tree decl, tree friend)
887 bool need_template = true;
890 my_friendly_assert (TREE_CODE (decl) == FUNCTION_DECL, 0);
892 /* For [temp.friend/6] when FRIEND is an ordinary member function
893 of a template class, we want to check if DECL is a specialization
895 if (TREE_CODE (friend) == FUNCTION_DECL
896 && DECL_TEMPLATE_INFO (friend)
897 && !DECL_USE_TEMPLATE (friend))
899 friend = DECL_TI_TEMPLATE (friend);
900 need_template = false;
903 /* There is nothing to do if this is not a template friend. */
904 if (TREE_CODE (friend) != TEMPLATE_DECL)
907 if (is_specialization_of (decl, friend))
911 A member of a class template may be declared to be a friend of a
912 non-template class. In this case, the corresponding member of
913 every specialization of the class template is a friend of the
914 class granting friendship.
916 For example, given a template friend declaration
918 template <class T> friend void A<T>::f();
920 the member function below is considered a friend
922 template <> struct A<int> {
926 For this type of template friend, TEMPLATE_DEPTH below will be
927 nonzero. To determine if DECL is a friend of FRIEND, we first
928 check if the enclosing class is a specialization of another. */
930 template_depth = template_class_depth (DECL_CONTEXT (friend));
932 && DECL_CLASS_SCOPE_P (decl)
933 && is_specialization_of (TYPE_NAME (DECL_CONTEXT (decl)),
934 CLASSTYPE_TI_TEMPLATE (DECL_CONTEXT (friend))))
936 /* Next, we check the members themselves. In order to handle
937 a few tricky cases like
939 template <class T> friend void A<T>::g(T t);
940 template <class T> template <T t> friend void A<T>::h();
942 we need to figure out what ARGS is (corresponding to `T' in above
943 examples) from DECL for later processing. */
945 tree context = DECL_CONTEXT (decl);
946 tree args = NULL_TREE;
947 int current_depth = 0;
948 while (current_depth < template_depth)
950 if (CLASSTYPE_TEMPLATE_INFO (context))
952 if (current_depth == 0)
953 args = TYPE_TI_ARGS (context);
955 args = add_to_template_args (TYPE_TI_ARGS (context), args);
958 context = TYPE_CONTEXT (context);
961 if (TREE_CODE (decl) == FUNCTION_DECL)
966 tree friend_args_type;
969 /* Make sure that both DECL and FRIEND are templates or
971 is_template = DECL_TEMPLATE_INFO (decl)
972 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl));
973 if (need_template ^ is_template)
975 else if (is_template)
977 /* If both are templates, check template parameter list. */
979 = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend),
981 if (!comp_template_parms
982 (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (decl)),
986 decl_type = TREE_TYPE (DECL_TI_TEMPLATE (decl));
989 decl_type = TREE_TYPE (decl);
991 friend_type = tsubst_function_type (TREE_TYPE (friend), args,
993 if (friend_type == error_mark_node)
996 /* Check if return types match. */
997 if (!same_type_p (TREE_TYPE (decl_type), TREE_TYPE (friend_type)))
1000 /* Check if function parameter types match, ignoring the
1001 `this' parameter. */
1002 friend_args_type = TYPE_ARG_TYPES (friend_type);
1003 decl_args_type = TYPE_ARG_TYPES (decl_type);
1004 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (friend))
1005 friend_args_type = TREE_CHAIN (friend_args_type);
1006 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl))
1007 decl_args_type = TREE_CHAIN (decl_args_type);
1008 if (compparms (decl_args_type, friend_args_type))
1015 /* Register the specialization SPEC as a specialization of TMPL with
1016 the indicated ARGS. Returns SPEC, or an equivalent prior
1017 declaration, if available. */
1020 register_specialization (tree spec, tree tmpl, tree args)
1024 my_friendly_assert (TREE_CODE (tmpl) == TEMPLATE_DECL, 0);
1026 if (TREE_CODE (spec) == FUNCTION_DECL
1027 && uses_template_parms (DECL_TI_ARGS (spec)))
1028 /* This is the FUNCTION_DECL for a partial instantiation. Don't
1029 register it; we want the corresponding TEMPLATE_DECL instead.
1030 We use `uses_template_parms (DECL_TI_ARGS (spec))' rather than
1031 the more obvious `uses_template_parms (spec)' to avoid problems
1032 with default function arguments. In particular, given
1033 something like this:
1035 template <class T> void f(T t1, T t = T())
1037 the default argument expression is not substituted for in an
1038 instantiation unless and until it is actually needed. */
1041 /* There should be as many levels of arguments as there are
1042 levels of parameters. */
1043 my_friendly_assert (TMPL_ARGS_DEPTH (args)
1044 == TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl)),
1047 for (s = DECL_TEMPLATE_SPECIALIZATIONS (tmpl);
1051 tree fn = TREE_VALUE (s);
1053 /* We can sometimes try to re-register a specialization that we've
1054 already got. In particular, regenerate_decl_from_template
1055 calls duplicate_decls which will update the specialization
1056 list. But, we'll still get called again here anyhow. It's
1057 more convenient to simply allow this than to try to prevent it. */
1060 else if (comp_template_args (TREE_PURPOSE (s), args))
1062 if (DECL_TEMPLATE_SPECIALIZATION (spec))
1064 if (DECL_TEMPLATE_INSTANTIATION (fn))
1067 || DECL_EXPLICIT_INSTANTIATION (fn))
1069 error ("specialization of %D after instantiation",
1075 /* This situation should occur only if the first
1076 specialization is an implicit instantiation,
1077 the second is an explicit specialization, and
1078 the implicit instantiation has not yet been
1079 used. That situation can occur if we have
1080 implicitly instantiated a member function and
1081 then specialized it later.
1083 We can also wind up here if a friend
1084 declaration that looked like an instantiation
1085 turns out to be a specialization:
1087 template <class T> void foo(T);
1088 class S { friend void foo<>(int) };
1089 template <> void foo(int);
1091 We transform the existing DECL in place so that
1092 any pointers to it become pointers to the
1093 updated declaration.
1095 If there was a definition for the template, but
1096 not for the specialization, we want this to
1097 look as if there were no definition, and vice
1099 DECL_INITIAL (fn) = NULL_TREE;
1100 duplicate_decls (spec, fn);
1105 else if (DECL_TEMPLATE_SPECIALIZATION (fn))
1107 if (!duplicate_decls (spec, fn) && DECL_INITIAL (spec))
1108 /* Dup decl failed, but this is a new
1109 definition. Set the line number so any errors
1110 match this new definition. */
1111 DECL_SOURCE_LOCATION (fn) = DECL_SOURCE_LOCATION (spec);
1119 DECL_TEMPLATE_SPECIALIZATIONS (tmpl)
1120 = tree_cons (args, spec, DECL_TEMPLATE_SPECIALIZATIONS (tmpl));
1125 /* Unregister the specialization SPEC as a specialization of TMPL.
1126 Replace it with NEW_SPEC, if NEW_SPEC is non-NULL. Returns true
1127 if the SPEC was listed as a specialization of TMPL. */
1130 reregister_specialization (tree spec, tree tmpl, tree new_spec)
1134 for (s = &DECL_TEMPLATE_SPECIALIZATIONS (tmpl);
1136 s = &TREE_CHAIN (*s))
1137 if (TREE_VALUE (*s) == spec)
1140 *s = TREE_CHAIN (*s);
1142 TREE_VALUE (*s) = new_spec;
1149 /* Compare an entry in the local specializations hash table P1 (which
1150 is really a pointer to a TREE_LIST) with P2 (which is really a
1154 eq_local_specializations (const void *p1, const void *p2)
1156 return TREE_VALUE ((tree) p1) == (tree) p2;
1159 /* Hash P1, an entry in the local specializations table. */
1162 hash_local_specialization (const void* p1)
1164 return htab_hash_pointer (TREE_VALUE ((tree) p1));
1167 /* Like register_specialization, but for local declarations. We are
1168 registering SPEC, an instantiation of TMPL. */
1171 register_local_specialization (tree spec, tree tmpl)
1175 slot = htab_find_slot_with_hash (local_specializations, tmpl,
1176 htab_hash_pointer (tmpl), INSERT);
1177 *slot = build_tree_list (spec, tmpl);
1180 /* Print the list of candidate FNS in an error message. */
1183 print_candidates (tree fns)
1187 const char *str = "candidates are:";
1189 for (fn = fns; fn != NULL_TREE; fn = TREE_CHAIN (fn))
1193 for (f = TREE_VALUE (fn); f; f = OVL_NEXT (f))
1194 cp_error_at ("%s %+#D", str, OVL_CURRENT (f));
1199 /* Returns the template (one of the functions given by TEMPLATE_ID)
1200 which can be specialized to match the indicated DECL with the
1201 explicit template args given in TEMPLATE_ID. The DECL may be
1202 NULL_TREE if none is available. In that case, the functions in
1203 TEMPLATE_ID are non-members.
1205 If NEED_MEMBER_TEMPLATE is nonzero the function is known to be a
1206 specialization of a member template.
1208 The template args (those explicitly specified and those deduced)
1209 are output in a newly created vector *TARGS_OUT.
1211 If it is impossible to determine the result, an error message is
1212 issued. The error_mark_node is returned to indicate failure. */
1215 determine_specialization (tree template_id,
1218 int need_member_template)
1222 tree explicit_targs;
1223 tree candidates = NULL_TREE;
1224 tree templates = NULL_TREE;
1226 *targs_out = NULL_TREE;
1228 if (template_id == error_mark_node)
1229 return error_mark_node;
1231 fns = TREE_OPERAND (template_id, 0);
1232 explicit_targs = TREE_OPERAND (template_id, 1);
1234 if (fns == error_mark_node)
1235 return error_mark_node;
1237 /* Check for baselinks. */
1238 if (BASELINK_P (fns))
1239 fns = BASELINK_FUNCTIONS (fns);
1241 if (!is_overloaded_fn (fns))
1243 error ("`%D' is not a function template", fns);
1244 return error_mark_node;
1247 for (; fns; fns = OVL_NEXT (fns))
1249 tree fn = OVL_CURRENT (fns);
1251 if (TREE_CODE (fn) == TEMPLATE_DECL)
1253 tree decl_arg_types;
1256 /* DECL might be a specialization of FN. */
1258 /* Adjust the type of DECL in case FN is a static member. */
1259 decl_arg_types = TYPE_ARG_TYPES (TREE_TYPE (decl));
1260 if (DECL_STATIC_FUNCTION_P (fn)
1261 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl))
1262 decl_arg_types = TREE_CHAIN (decl_arg_types);
1264 /* Check that the number of function parameters matches.
1266 template <class T> void f(int i = 0);
1267 template <> void f<int>();
1268 The specialization f<int> is invalid but is not caught
1269 by get_bindings below. */
1271 fn_arg_types = TYPE_ARG_TYPES (TREE_TYPE (fn));
1272 if (list_length (fn_arg_types) != list_length (decl_arg_types))
1275 /* For a non-static member function, we need to make sure that
1276 the const qualification is the same. This can be done by
1277 checking the 'this' in the argument list. */
1278 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn)
1279 && !same_type_p (TREE_VALUE (fn_arg_types),
1280 TREE_VALUE (decl_arg_types)))
1283 /* See whether this function might be a specialization of this
1285 targs = get_bindings (fn, decl, explicit_targs);
1288 /* We cannot deduce template arguments that when used to
1289 specialize TMPL will produce DECL. */
1292 /* Save this template, and the arguments deduced. */
1293 templates = tree_cons (targs, fn, templates);
1295 else if (need_member_template)
1296 /* FN is an ordinary member function, and we need a
1297 specialization of a member template. */
1299 else if (TREE_CODE (fn) != FUNCTION_DECL)
1300 /* We can get IDENTIFIER_NODEs here in certain erroneous
1303 else if (!DECL_FUNCTION_MEMBER_P (fn))
1304 /* This is just an ordinary non-member function. Nothing can
1305 be a specialization of that. */
1307 else if (DECL_ARTIFICIAL (fn))
1308 /* Cannot specialize functions that are created implicitly. */
1312 tree decl_arg_types;
1314 /* This is an ordinary member function. However, since
1315 we're here, we can assume it's enclosing class is a
1316 template class. For example,
1318 template <typename T> struct S { void f(); };
1319 template <> void S<int>::f() {}
1321 Here, S<int>::f is a non-template, but S<int> is a
1322 template class. If FN has the same type as DECL, we
1323 might be in business. */
1325 if (!DECL_TEMPLATE_INFO (fn))
1326 /* Its enclosing class is an explicit specialization
1327 of a template class. This is not a candidate. */
1330 if (!same_type_p (TREE_TYPE (TREE_TYPE (decl)),
1331 TREE_TYPE (TREE_TYPE (fn))))
1332 /* The return types differ. */
1335 /* Adjust the type of DECL in case FN is a static member. */
1336 decl_arg_types = TYPE_ARG_TYPES (TREE_TYPE (decl));
1337 if (DECL_STATIC_FUNCTION_P (fn)
1338 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl))
1339 decl_arg_types = TREE_CHAIN (decl_arg_types);
1341 if (compparms (TYPE_ARG_TYPES (TREE_TYPE (fn)),
1344 candidates = tree_cons (NULL_TREE, fn, candidates);
1348 if (templates && TREE_CHAIN (templates))
1354 It is possible for a specialization with a given function
1355 signature to be instantiated from more than one function
1356 template. In such cases, explicit specification of the
1357 template arguments must be used to uniquely identify the
1358 function template specialization being specialized.
1360 Note that here, there's no suggestion that we're supposed to
1361 determine which of the candidate templates is most
1362 specialized. However, we, also have:
1366 Partial ordering of overloaded function template
1367 declarations is used in the following contexts to select
1368 the function template to which a function template
1369 specialization refers:
1371 -- when an explicit specialization refers to a function
1374 So, we do use the partial ordering rules, at least for now.
1375 This extension can only serve to make invalid programs valid,
1376 so it's safe. And, there is strong anecdotal evidence that
1377 the committee intended the partial ordering rules to apply;
1378 the EDG front-end has that behavior, and John Spicer claims
1379 that the committee simply forgot to delete the wording in
1380 [temp.expl.spec]. */
1381 tree tmpl = most_specialized (templates, decl, explicit_targs);
1382 if (tmpl && tmpl != error_mark_node)
1384 targs = get_bindings (tmpl, decl, explicit_targs);
1385 templates = tree_cons (targs, tmpl, NULL_TREE);
1389 if (templates == NULL_TREE && candidates == NULL_TREE)
1391 cp_error_at ("template-id `%D' for `%+D' does not match any template declaration",
1393 return error_mark_node;
1395 else if ((templates && TREE_CHAIN (templates))
1396 || (candidates && TREE_CHAIN (candidates))
1397 || (templates && candidates))
1399 cp_error_at ("ambiguous template specialization `%D' for `%+D'",
1401 chainon (candidates, templates);
1402 print_candidates (candidates);
1403 return error_mark_node;
1406 /* We have one, and exactly one, match. */
1409 /* It was a specialization of an ordinary member function in a
1411 *targs_out = copy_node (DECL_TI_ARGS (TREE_VALUE (candidates)));
1412 return DECL_TI_TEMPLATE (TREE_VALUE (candidates));
1415 /* It was a specialization of a template. */
1416 targs = DECL_TI_ARGS (DECL_TEMPLATE_RESULT (TREE_VALUE (templates)));
1417 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (targs))
1419 *targs_out = copy_node (targs);
1420 SET_TMPL_ARGS_LEVEL (*targs_out,
1421 TMPL_ARGS_DEPTH (*targs_out),
1422 TREE_PURPOSE (templates));
1425 *targs_out = TREE_PURPOSE (templates);
1426 return TREE_VALUE (templates);
1429 /* Returns a chain of parameter types, exactly like the SPEC_TYPES,
1430 but with the default argument values filled in from those in the
1434 copy_default_args_to_explicit_spec_1 (tree spec_types,
1437 tree new_spec_types;
1442 if (spec_types == void_list_node)
1443 return void_list_node;
1445 /* Substitute into the rest of the list. */
1447 copy_default_args_to_explicit_spec_1 (TREE_CHAIN (spec_types),
1448 TREE_CHAIN (tmpl_types));
1450 /* Add the default argument for this parameter. */
1451 return hash_tree_cons (TREE_PURPOSE (tmpl_types),
1452 TREE_VALUE (spec_types),
1456 /* DECL is an explicit specialization. Replicate default arguments
1457 from the template it specializes. (That way, code like:
1459 template <class T> void f(T = 3);
1460 template <> void f(double);
1463 works, as required.) An alternative approach would be to look up
1464 the correct default arguments at the call-site, but this approach
1465 is consistent with how implicit instantiations are handled. */
1468 copy_default_args_to_explicit_spec (tree decl)
1473 tree new_spec_types;
1477 tree object_type = NULL_TREE;
1478 tree in_charge = NULL_TREE;
1479 tree vtt = NULL_TREE;
1481 /* See if there's anything we need to do. */
1482 tmpl = DECL_TI_TEMPLATE (decl);
1483 tmpl_types = TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (tmpl)));
1484 for (t = tmpl_types; t; t = TREE_CHAIN (t))
1485 if (TREE_PURPOSE (t))
1490 old_type = TREE_TYPE (decl);
1491 spec_types = TYPE_ARG_TYPES (old_type);
1493 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl))
1495 /* Remove the this pointer, but remember the object's type for
1497 object_type = TREE_TYPE (TREE_VALUE (spec_types));
1498 spec_types = TREE_CHAIN (spec_types);
1499 tmpl_types = TREE_CHAIN (tmpl_types);
1501 if (DECL_HAS_IN_CHARGE_PARM_P (decl))
1503 /* DECL may contain more parameters than TMPL due to the extra
1504 in-charge parameter in constructors and destructors. */
1505 in_charge = spec_types;
1506 spec_types = TREE_CHAIN (spec_types);
1508 if (DECL_HAS_VTT_PARM_P (decl))
1511 spec_types = TREE_CHAIN (spec_types);
1515 /* Compute the merged default arguments. */
1517 copy_default_args_to_explicit_spec_1 (spec_types, tmpl_types);
1519 /* Compute the new FUNCTION_TYPE. */
1523 new_spec_types = hash_tree_cons (TREE_PURPOSE (vtt),
1528 /* Put the in-charge parameter back. */
1529 new_spec_types = hash_tree_cons (TREE_PURPOSE (in_charge),
1530 TREE_VALUE (in_charge),
1533 new_type = build_method_type_directly (object_type,
1534 TREE_TYPE (old_type),
1538 new_type = build_function_type (TREE_TYPE (old_type),
1540 new_type = cp_build_type_attribute_variant (new_type,
1541 TYPE_ATTRIBUTES (old_type));
1542 new_type = build_exception_variant (new_type,
1543 TYPE_RAISES_EXCEPTIONS (old_type));
1544 TREE_TYPE (decl) = new_type;
1547 /* Check to see if the function just declared, as indicated in
1548 DECLARATOR, and in DECL, is a specialization of a function
1549 template. We may also discover that the declaration is an explicit
1550 instantiation at this point.
1552 Returns DECL, or an equivalent declaration that should be used
1553 instead if all goes well. Issues an error message if something is
1554 amiss. Returns error_mark_node if the error is not easily
1557 FLAGS is a bitmask consisting of the following flags:
1559 2: The function has a definition.
1560 4: The function is a friend.
1562 The TEMPLATE_COUNT is the number of references to qualifying
1563 template classes that appeared in the name of the function. For
1566 template <class T> struct S { void f(); };
1569 the TEMPLATE_COUNT would be 1. However, explicitly specialized
1570 classes are not counted in the TEMPLATE_COUNT, so that in
1572 template <class T> struct S {};
1573 template <> struct S<int> { void f(); }
1574 template <> void S<int>::f();
1576 the TEMPLATE_COUNT would be 0. (Note that this declaration is
1577 invalid; there should be no template <>.)
1579 If the function is a specialization, it is marked as such via
1580 DECL_TEMPLATE_SPECIALIZATION. Furthermore, its DECL_TEMPLATE_INFO
1581 is set up correctly, and it is added to the list of specializations
1582 for that template. */
1585 check_explicit_specialization (tree declarator,
1590 int have_def = flags & 2;
1591 int is_friend = flags & 4;
1592 int specialization = 0;
1593 int explicit_instantiation = 0;
1594 int member_specialization = 0;
1595 tree ctype = DECL_CLASS_CONTEXT (decl);
1596 tree dname = DECL_NAME (decl);
1599 tsk = current_tmpl_spec_kind (template_count);
1604 if (processing_specialization)
1607 SET_DECL_TEMPLATE_SPECIALIZATION (decl);
1609 else if (TREE_CODE (declarator) == TEMPLATE_ID_EXPR)
1612 /* This could be something like:
1614 template <class T> void f(T);
1615 class S { friend void f<>(int); } */
1619 /* This case handles bogus declarations like template <>
1620 template <class T> void f<int>(); */
1622 error ("template-id `%D' in declaration of primary template",
1629 case tsk_invalid_member_spec:
1630 /* The error has already been reported in
1631 check_specialization_scope. */
1632 return error_mark_node;
1634 case tsk_invalid_expl_inst:
1635 error ("template parameter list used in explicit instantiation");
1641 error ("definition provided for explicit instantiation");
1643 explicit_instantiation = 1;
1646 case tsk_excessive_parms:
1647 error ("too many template parameter lists in declaration of `%D'",
1649 return error_mark_node;
1653 SET_DECL_TEMPLATE_SPECIALIZATION (decl);
1655 member_specialization = 1;
1660 case tsk_insufficient_parms:
1661 if (template_header_count)
1663 error("too few template parameter lists in declaration of `%D'",
1667 else if (ctype != NULL_TREE
1668 && !TYPE_BEING_DEFINED (ctype)
1669 && CLASSTYPE_TEMPLATE_INSTANTIATION (ctype)
1672 /* For backwards compatibility, we accept:
1674 template <class T> struct S { void f(); };
1675 void S<int>::f() {} // Missing template <>
1677 That used to be valid C++. */
1680 ("explicit specialization not preceded by `template <>'");
1682 SET_DECL_TEMPLATE_SPECIALIZATION (decl);
1687 if (TREE_CODE (declarator) == TEMPLATE_ID_EXPR)
1689 /* This case handles bogus declarations like template <>
1690 template <class T> void f<int>(); */
1692 if (uses_template_parms (declarator))
1693 error ("function template partial specialization `%D' "
1694 "is not allowed", declarator);
1696 error ("template-id `%D' in declaration of primary template",
1701 if (ctype && CLASSTYPE_TEMPLATE_INSTANTIATION (ctype))
1702 /* This is a specialization of a member template, without
1703 specialization the containing class. Something like:
1705 template <class T> struct S {
1706 template <class U> void f (U);
1708 template <> template <class U> void S<int>::f(U) {}
1710 That's a specialization -- but of the entire template. */
1718 if (specialization || member_specialization)
1720 tree t = TYPE_ARG_TYPES (TREE_TYPE (decl));
1721 for (; t; t = TREE_CHAIN (t))
1722 if (TREE_PURPOSE (t))
1725 ("default argument specified in explicit specialization");
1728 if (current_lang_name == lang_name_c)
1729 error ("template specialization with C linkage");
1732 if (specialization || member_specialization || explicit_instantiation)
1734 tree tmpl = NULL_TREE;
1735 tree targs = NULL_TREE;
1737 /* Make sure that the declarator is a TEMPLATE_ID_EXPR. */
1738 if (TREE_CODE (declarator) != TEMPLATE_ID_EXPR)
1742 my_friendly_assert (TREE_CODE (declarator) == IDENTIFIER_NODE, 0);
1747 /* If there is no class context, the explicit instantiation
1748 must be at namespace scope. */
1749 my_friendly_assert (DECL_NAMESPACE_SCOPE_P (decl), 20030625);
1751 /* Find the namespace binding, using the declaration
1753 fns = namespace_binding (dname, CP_DECL_CONTEXT (decl));
1756 declarator = lookup_template_function (fns, NULL_TREE);
1759 if (declarator == error_mark_node)
1760 return error_mark_node;
1762 if (ctype != NULL_TREE && TYPE_BEING_DEFINED (ctype))
1764 if (!explicit_instantiation)
1765 /* A specialization in class scope. This is invalid,
1766 but the error will already have been flagged by
1767 check_specialization_scope. */
1768 return error_mark_node;
1771 /* It's not valid to write an explicit instantiation in
1774 class C { template void f(); }
1776 This case is caught by the parser. However, on
1779 template class C { void f(); };
1781 (which is invalid) we can get here. The error will be
1788 else if (ctype != NULL_TREE
1789 && (TREE_CODE (TREE_OPERAND (declarator, 0)) ==
1792 /* Find the list of functions in ctype that have the same
1793 name as the declared function. */
1794 tree name = TREE_OPERAND (declarator, 0);
1795 tree fns = NULL_TREE;
1798 if (constructor_name_p (name, ctype))
1800 int is_constructor = DECL_CONSTRUCTOR_P (decl);
1802 if (is_constructor ? !TYPE_HAS_CONSTRUCTOR (ctype)
1803 : !TYPE_HAS_DESTRUCTOR (ctype))
1805 /* From [temp.expl.spec]:
1807 If such an explicit specialization for the member
1808 of a class template names an implicitly-declared
1809 special member function (clause _special_), the
1810 program is ill-formed.
1812 Similar language is found in [temp.explicit]. */
1813 error ("specialization of implicitly-declared special member function");
1814 return error_mark_node;
1817 name = is_constructor ? ctor_identifier : dtor_identifier;
1820 if (!DECL_CONV_FN_P (decl))
1822 idx = lookup_fnfields_1 (ctype, name);
1824 fns = TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (ctype), idx);
1830 /* For a type-conversion operator, we cannot do a
1831 name-based lookup. We might be looking for `operator
1832 int' which will be a specialization of `operator T'.
1833 So, we find *all* the conversion operators, and then
1834 select from them. */
1837 methods = CLASSTYPE_METHOD_VEC (ctype);
1839 for (idx = CLASSTYPE_FIRST_CONVERSION_SLOT;
1840 idx < TREE_VEC_LENGTH (methods); ++idx)
1842 tree ovl = TREE_VEC_ELT (methods, idx);
1844 if (!ovl || !DECL_CONV_FN_P (OVL_CURRENT (ovl)))
1845 /* There are no more conversion functions. */
1848 /* Glue all these conversion functions together
1849 with those we already have. */
1850 for (; ovl; ovl = OVL_NEXT (ovl))
1851 fns = ovl_cons (OVL_CURRENT (ovl), fns);
1855 if (fns == NULL_TREE)
1857 error ("no member function `%D' declared in `%T'",
1859 return error_mark_node;
1862 TREE_OPERAND (declarator, 0) = fns;
1865 /* Figure out what exactly is being specialized at this point.
1866 Note that for an explicit instantiation, even one for a
1867 member function, we cannot tell apriori whether the
1868 instantiation is for a member template, or just a member
1869 function of a template class. Even if a member template is
1870 being instantiated, the member template arguments may be
1871 elided if they can be deduced from the rest of the
1873 tmpl = determine_specialization (declarator, decl,
1875 member_specialization);
1877 if (!tmpl || tmpl == error_mark_node)
1878 /* We couldn't figure out what this declaration was
1880 return error_mark_node;
1883 tree gen_tmpl = most_general_template (tmpl);
1885 if (explicit_instantiation)
1887 /* We don't set DECL_EXPLICIT_INSTANTIATION here; that
1888 is done by do_decl_instantiation later. */
1890 int arg_depth = TMPL_ARGS_DEPTH (targs);
1891 int parm_depth = TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl));
1893 if (arg_depth > parm_depth)
1895 /* If TMPL is not the most general template (for
1896 example, if TMPL is a friend template that is
1897 injected into namespace scope), then there will
1898 be too many levels of TARGS. Remove some of them
1903 new_targs = make_tree_vec (parm_depth);
1904 for (i = arg_depth - parm_depth; i < arg_depth; ++i)
1905 TREE_VEC_ELT (new_targs, i - (arg_depth - parm_depth))
1906 = TREE_VEC_ELT (targs, i);
1910 return instantiate_template (tmpl, targs, tf_error);
1913 /* If we thought that the DECL was a member function, but it
1914 turns out to be specializing a static member function,
1915 make DECL a static member function as well. */
1916 if (DECL_STATIC_FUNCTION_P (tmpl)
1917 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl))
1918 revert_static_member_fn (decl);
1920 /* If this is a specialization of a member template of a
1921 template class. In we want to return the TEMPLATE_DECL,
1922 not the specialization of it. */
1923 if (tsk == tsk_template)
1925 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl);
1926 DECL_INITIAL (DECL_TEMPLATE_RESULT (tmpl)) = NULL_TREE;
1929 DECL_SOURCE_LOCATION (tmpl) = DECL_SOURCE_LOCATION (decl);
1930 DECL_SOURCE_LOCATION (DECL_TEMPLATE_RESULT (tmpl))
1931 = DECL_SOURCE_LOCATION (decl);
1936 /* Set up the DECL_TEMPLATE_INFO for DECL. */
1937 DECL_TEMPLATE_INFO (decl) = tree_cons (tmpl, targs, NULL_TREE);
1939 /* Inherit default function arguments from the template
1940 DECL is specializing. */
1941 copy_default_args_to_explicit_spec (decl);
1943 /* This specialization has the same protection as the
1944 template it specializes. */
1945 TREE_PRIVATE (decl) = TREE_PRIVATE (gen_tmpl);
1946 TREE_PROTECTED (decl) = TREE_PROTECTED (gen_tmpl);
1948 if (is_friend && !have_def)
1949 /* This is not really a declaration of a specialization.
1950 It's just the name of an instantiation. But, it's not
1951 a request for an instantiation, either. */
1952 SET_DECL_IMPLICIT_INSTANTIATION (decl);
1953 else if (DECL_CONSTRUCTOR_P (decl) || DECL_DESTRUCTOR_P (decl))
1954 /* This is indeed a specialization. In case of constructors
1955 and destructors, we need in-charge and not-in-charge
1956 versions in V3 ABI. */
1957 clone_function_decl (decl, /*update_method_vec_p=*/0);
1959 /* Register this specialization so that we can find it
1961 decl = register_specialization (decl, gen_tmpl, targs);
1968 /* TYPE is being declared. Verify that the use of template headers
1969 and such is reasonable. Issue error messages if not. */
1972 maybe_check_template_type (tree type)
1974 if (template_header_count)
1976 /* We are in the scope of some `template <...>' header. */
1979 = template_class_depth_real (TYPE_CONTEXT (type),
1980 /*count_specializations=*/1);
1982 if (template_header_count <= context_depth)
1983 /* This is OK; the template headers are for the context. We
1984 are actually too lenient here; like
1985 check_explicit_specialization we should consider the number
1986 of template types included in the actual declaration. For
1989 template <class T> struct S {
1990 template <class U> template <class V>
1996 template <class T> struct S {
1997 template <class U> struct I;
2000 template <class T> template <class U.
2005 else if (template_header_count > context_depth + 1)
2006 /* There are two many template parameter lists. */
2007 error ("too many template parameter lists in declaration of `%T'", type);
2011 /* Returns 1 iff PARMS1 and PARMS2 are identical sets of template
2012 parameters. These are represented in the same format used for
2013 DECL_TEMPLATE_PARMS. */
2015 int comp_template_parms (tree parms1, tree parms2)
2020 if (parms1 == parms2)
2023 for (p1 = parms1, p2 = parms2;
2024 p1 != NULL_TREE && p2 != NULL_TREE;
2025 p1 = TREE_CHAIN (p1), p2 = TREE_CHAIN (p2))
2027 tree t1 = TREE_VALUE (p1);
2028 tree t2 = TREE_VALUE (p2);
2031 my_friendly_assert (TREE_CODE (t1) == TREE_VEC, 0);
2032 my_friendly_assert (TREE_CODE (t2) == TREE_VEC, 0);
2034 if (TREE_VEC_LENGTH (t1) != TREE_VEC_LENGTH (t2))
2037 for (i = 0; i < TREE_VEC_LENGTH (t2); ++i)
2039 tree parm1 = TREE_VALUE (TREE_VEC_ELT (t1, i));
2040 tree parm2 = TREE_VALUE (TREE_VEC_ELT (t2, i));
2042 if (TREE_CODE (parm1) != TREE_CODE (parm2))
2045 if (TREE_CODE (parm1) == TEMPLATE_TYPE_PARM)
2047 else if (!same_type_p (TREE_TYPE (parm1), TREE_TYPE (parm2)))
2052 if ((p1 != NULL_TREE) != (p2 != NULL_TREE))
2053 /* One set of parameters has more parameters lists than the
2060 /* Complain if DECL shadows a template parameter.
2062 [temp.local]: A template-parameter shall not be redeclared within its
2063 scope (including nested scopes). */
2066 check_template_shadow (tree decl)
2070 /* If we're not in a template, we can't possibly shadow a template
2072 if (!current_template_parms)
2075 /* Figure out what we're shadowing. */
2076 if (TREE_CODE (decl) == OVERLOAD)
2077 decl = OVL_CURRENT (decl);
2078 olddecl = IDENTIFIER_VALUE (DECL_NAME (decl));
2080 /* If there's no previous binding for this name, we're not shadowing
2081 anything, let alone a template parameter. */
2085 /* If we're not shadowing a template parameter, we're done. Note
2086 that OLDDECL might be an OVERLOAD (or perhaps even an
2087 ERROR_MARK), so we can't just blithely assume it to be a _DECL
2089 if (!DECL_P (olddecl) || !DECL_TEMPLATE_PARM_P (olddecl))
2092 /* We check for decl != olddecl to avoid bogus errors for using a
2093 name inside a class. We check TPFI to avoid duplicate errors for
2094 inline member templates. */
2096 || TEMPLATE_PARMS_FOR_INLINE (current_template_parms))
2099 cp_error_at ("declaration of `%#D'", decl);
2100 cp_error_at (" shadows template parm `%#D'", olddecl);
2103 /* Return a new TEMPLATE_PARM_INDEX with the indicated INDEX, LEVEL,
2104 ORIG_LEVEL, DECL, and TYPE. */
2107 build_template_parm_index (int index,
2113 tree t = make_node (TEMPLATE_PARM_INDEX);
2114 TEMPLATE_PARM_IDX (t) = index;
2115 TEMPLATE_PARM_LEVEL (t) = level;
2116 TEMPLATE_PARM_ORIG_LEVEL (t) = orig_level;
2117 TEMPLATE_PARM_DECL (t) = decl;
2118 TREE_TYPE (t) = type;
2119 TREE_CONSTANT (t) = TREE_CONSTANT (decl);
2120 TREE_INVARIANT (t) = TREE_INVARIANT (decl);
2121 TREE_READONLY (t) = TREE_READONLY (decl);
2126 /* Return a TEMPLATE_PARM_INDEX, similar to INDEX, but whose
2127 TEMPLATE_PARM_LEVEL has been decreased by LEVELS. If such a
2128 TEMPLATE_PARM_INDEX already exists, it is returned; otherwise, a
2129 new one is created. */
2132 reduce_template_parm_level (tree index, tree type, int levels)
2134 if (TEMPLATE_PARM_DESCENDANTS (index) == NULL_TREE
2135 || (TEMPLATE_PARM_LEVEL (TEMPLATE_PARM_DESCENDANTS (index))
2136 != TEMPLATE_PARM_LEVEL (index) - levels))
2138 tree orig_decl = TEMPLATE_PARM_DECL (index);
2141 decl = build_decl (TREE_CODE (orig_decl), DECL_NAME (orig_decl), type);
2142 TREE_CONSTANT (decl) = TREE_CONSTANT (orig_decl);
2143 TREE_INVARIANT (decl) = TREE_INVARIANT (orig_decl);
2144 TREE_READONLY (decl) = TREE_READONLY (orig_decl);
2145 DECL_ARTIFICIAL (decl) = 1;
2146 SET_DECL_TEMPLATE_PARM_P (decl);
2148 t = build_template_parm_index (TEMPLATE_PARM_IDX (index),
2149 TEMPLATE_PARM_LEVEL (index) - levels,
2150 TEMPLATE_PARM_ORIG_LEVEL (index),
2152 TEMPLATE_PARM_DESCENDANTS (index) = t;
2154 /* Template template parameters need this. */
2155 DECL_TEMPLATE_PARMS (decl)
2156 = DECL_TEMPLATE_PARMS (TEMPLATE_PARM_DECL (index));
2159 return TEMPLATE_PARM_DESCENDANTS (index);
2162 /* Process information from new template parameter NEXT and append it to the
2163 LIST being built. This new parameter is a non-type parameter iff
2164 IS_NON_TYPE is true. */
2167 process_template_parm (tree list, tree next, bool is_non_type)
2175 my_friendly_assert (TREE_CODE (parm) == TREE_LIST, 259);
2176 defval = TREE_PURPOSE (parm);
2180 tree p = TREE_VALUE (tree_last (list));
2182 if (TREE_CODE (p) == TYPE_DECL || TREE_CODE (p) == TEMPLATE_DECL)
2183 idx = TEMPLATE_TYPE_IDX (TREE_TYPE (p));
2185 idx = TEMPLATE_PARM_IDX (DECL_INITIAL (p));
2193 parm = TREE_VALUE (parm);
2195 SET_DECL_TEMPLATE_PARM_P (parm);
2199 The top-level cv-qualifiers on the template-parameter are
2200 ignored when determining its type. */
2201 TREE_TYPE (parm) = TYPE_MAIN_VARIANT (TREE_TYPE (parm));
2203 /* A template parameter is not modifiable. */
2204 TREE_CONSTANT (parm) = 1;
2205 TREE_INVARIANT (parm) = 1;
2206 TREE_READONLY (parm) = 1;
2207 if (invalid_nontype_parm_type_p (TREE_TYPE (parm), 1))
2208 TREE_TYPE (parm) = void_type_node;
2209 decl = build_decl (CONST_DECL, DECL_NAME (parm), TREE_TYPE (parm));
2210 TREE_CONSTANT (decl) = 1;
2211 TREE_INVARIANT (decl) = 1;
2212 TREE_READONLY (decl) = 1;
2213 DECL_INITIAL (parm) = DECL_INITIAL (decl)
2214 = build_template_parm_index (idx, processing_template_decl,
2215 processing_template_decl,
2216 decl, TREE_TYPE (parm));
2221 parm = TREE_VALUE (TREE_VALUE (parm));
2223 if (parm && TREE_CODE (parm) == TEMPLATE_DECL)
2225 t = make_aggr_type (TEMPLATE_TEMPLATE_PARM);
2226 /* This is for distinguishing between real templates and template
2227 template parameters */
2228 TREE_TYPE (parm) = t;
2229 TREE_TYPE (DECL_TEMPLATE_RESULT (parm)) = t;
2234 t = make_aggr_type (TEMPLATE_TYPE_PARM);
2235 /* parm is either IDENTIFIER_NODE or NULL_TREE. */
2236 decl = build_decl (TYPE_DECL, parm, t);
2239 TYPE_NAME (t) = decl;
2240 TYPE_STUB_DECL (t) = decl;
2242 TEMPLATE_TYPE_PARM_INDEX (t)
2243 = build_template_parm_index (idx, processing_template_decl,
2244 processing_template_decl,
2245 decl, TREE_TYPE (parm));
2247 DECL_ARTIFICIAL (decl) = 1;
2248 SET_DECL_TEMPLATE_PARM_P (decl);
2250 parm = build_tree_list (defval, parm);
2251 return chainon (list, parm);
2254 /* The end of a template parameter list has been reached. Process the
2255 tree list into a parameter vector, converting each parameter into a more
2256 useful form. Type parameters are saved as IDENTIFIER_NODEs, and others
2260 end_template_parm_list (tree parms)
2264 tree saved_parmlist = make_tree_vec (list_length (parms));
2266 current_template_parms
2267 = tree_cons (size_int (processing_template_decl),
2268 saved_parmlist, current_template_parms);
2270 for (parm = parms, nparms = 0; parm; parm = next, nparms++)
2272 next = TREE_CHAIN (parm);
2273 TREE_VEC_ELT (saved_parmlist, nparms) = parm;
2274 TREE_CHAIN (parm) = NULL_TREE;
2277 --processing_template_parmlist;
2279 return saved_parmlist;
2282 /* end_template_decl is called after a template declaration is seen. */
2285 end_template_decl (void)
2287 reset_specialization ();
2289 if (! processing_template_decl)
2292 /* This matches the pushlevel in begin_template_parm_list. */
2295 --processing_template_decl;
2296 current_template_parms = TREE_CHAIN (current_template_parms);
2299 /* Given a template argument vector containing the template PARMS.
2300 The innermost PARMS are given first. */
2303 current_template_args (void)
2306 tree args = NULL_TREE;
2307 int length = TMPL_PARMS_DEPTH (current_template_parms);
2310 /* If there is only one level of template parameters, we do not
2311 create a TREE_VEC of TREE_VECs. Instead, we return a single
2312 TREE_VEC containing the arguments. */
2314 args = make_tree_vec (length);
2316 for (header = current_template_parms; header; header = TREE_CHAIN (header))
2318 tree a = copy_node (TREE_VALUE (header));
2321 TREE_TYPE (a) = NULL_TREE;
2322 for (i = TREE_VEC_LENGTH (a) - 1; i >= 0; --i)
2324 tree t = TREE_VEC_ELT (a, i);
2326 /* T will be a list if we are called from within a
2327 begin/end_template_parm_list pair, but a vector directly
2328 if within a begin/end_member_template_processing pair. */
2329 if (TREE_CODE (t) == TREE_LIST)
2333 if (TREE_CODE (t) == TYPE_DECL
2334 || TREE_CODE (t) == TEMPLATE_DECL)
2337 t = DECL_INITIAL (t);
2338 TREE_VEC_ELT (a, i) = t;
2343 TREE_VEC_ELT (args, --l) = a;
2351 /* Return a TEMPLATE_DECL corresponding to DECL, using the indicated
2352 template PARMS. Used by push_template_decl below. */
2355 build_template_decl (tree decl, tree parms)
2357 tree tmpl = build_lang_decl (TEMPLATE_DECL, DECL_NAME (decl), NULL_TREE);
2358 DECL_TEMPLATE_PARMS (tmpl) = parms;
2359 DECL_CONTEXT (tmpl) = DECL_CONTEXT (decl);
2360 if (DECL_LANG_SPECIFIC (decl))
2362 DECL_STATIC_FUNCTION_P (tmpl) = DECL_STATIC_FUNCTION_P (decl);
2363 DECL_CONSTRUCTOR_P (tmpl) = DECL_CONSTRUCTOR_P (decl);
2364 DECL_DESTRUCTOR_P (tmpl) = DECL_DESTRUCTOR_P (decl);
2365 DECL_NONCONVERTING_P (tmpl) = DECL_NONCONVERTING_P (decl);
2366 DECL_ASSIGNMENT_OPERATOR_P (tmpl) = DECL_ASSIGNMENT_OPERATOR_P (decl);
2367 if (DECL_OVERLOADED_OPERATOR_P (decl))
2368 SET_OVERLOADED_OPERATOR_CODE (tmpl,
2369 DECL_OVERLOADED_OPERATOR_P (decl));
2375 struct template_parm_data
2377 /* The level of the template parameters we are currently
2381 /* The index of the specialization argument we are currently
2385 /* An array whose size is the number of template parameters. The
2386 elements are nonzero if the parameter has been used in any one
2387 of the arguments processed so far. */
2390 /* An array whose size is the number of template arguments. The
2391 elements are nonzero if the argument makes use of template
2392 parameters of this level. */
2393 int* arg_uses_template_parms;
2396 /* Subroutine of push_template_decl used to see if each template
2397 parameter in a partial specialization is used in the explicit
2398 argument list. If T is of the LEVEL given in DATA (which is
2399 treated as a template_parm_data*), then DATA->PARMS is marked
2403 mark_template_parm (tree t, void* data)
2407 struct template_parm_data* tpd = (struct template_parm_data*) data;
2409 if (TREE_CODE (t) == TEMPLATE_PARM_INDEX)
2411 level = TEMPLATE_PARM_LEVEL (t);
2412 idx = TEMPLATE_PARM_IDX (t);
2416 level = TEMPLATE_TYPE_LEVEL (t);
2417 idx = TEMPLATE_TYPE_IDX (t);
2420 if (level == tpd->level)
2422 tpd->parms[idx] = 1;
2423 tpd->arg_uses_template_parms[tpd->current_arg] = 1;
2426 /* Return zero so that for_each_template_parm will continue the
2427 traversal of the tree; we want to mark *every* template parm. */
2431 /* Process the partial specialization DECL. */
2434 process_partial_specialization (tree decl)
2436 tree type = TREE_TYPE (decl);
2437 tree maintmpl = CLASSTYPE_TI_TEMPLATE (type);
2438 tree specargs = CLASSTYPE_TI_ARGS (type);
2439 tree inner_args = INNERMOST_TEMPLATE_ARGS (specargs);
2440 tree inner_parms = INNERMOST_TEMPLATE_PARMS (current_template_parms);
2441 tree main_inner_parms = DECL_INNERMOST_TEMPLATE_PARMS (maintmpl);
2442 int nargs = TREE_VEC_LENGTH (inner_args);
2443 int ntparms = TREE_VEC_LENGTH (inner_parms);
2445 int did_error_intro = 0;
2446 struct template_parm_data tpd;
2447 struct template_parm_data tpd2;
2449 /* We check that each of the template parameters given in the
2450 partial specialization is used in the argument list to the
2451 specialization. For example:
2453 template <class T> struct S;
2454 template <class T> struct S<T*>;
2456 The second declaration is OK because `T*' uses the template
2457 parameter T, whereas
2459 template <class T> struct S<int>;
2461 is no good. Even trickier is:
2472 The S2<T> declaration is actually invalid; it is a
2473 full-specialization. Of course,
2476 struct S2<T (*)(U)>;
2478 or some such would have been OK. */
2479 tpd.level = TMPL_PARMS_DEPTH (current_template_parms);
2480 tpd.parms = alloca (sizeof (int) * ntparms);
2481 memset (tpd.parms, 0, sizeof (int) * ntparms);
2483 tpd.arg_uses_template_parms = alloca (sizeof (int) * nargs);
2484 memset (tpd.arg_uses_template_parms, 0, sizeof (int) * nargs);
2485 for (i = 0; i < nargs; ++i)
2487 tpd.current_arg = i;
2488 for_each_template_parm (TREE_VEC_ELT (inner_args, i),
2489 &mark_template_parm,
2493 for (i = 0; i < ntparms; ++i)
2494 if (tpd.parms[i] == 0)
2496 /* One of the template parms was not used in the
2498 if (!did_error_intro)
2500 error ("template parameters not used in partial specialization:");
2501 did_error_intro = 1;
2505 TREE_VALUE (TREE_VEC_ELT (inner_parms, i)));
2508 /* [temp.class.spec]
2510 The argument list of the specialization shall not be identical to
2511 the implicit argument list of the primary template. */
2512 if (comp_template_args
2514 INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE
2516 error ("partial specialization `%T' does not specialize any template arguments", type);
2518 /* [temp.class.spec]
2520 A partially specialized non-type argument expression shall not
2521 involve template parameters of the partial specialization except
2522 when the argument expression is a simple identifier.
2524 The type of a template parameter corresponding to a specialized
2525 non-type argument shall not be dependent on a parameter of the
2527 my_friendly_assert (nargs == DECL_NTPARMS (maintmpl), 0);
2529 for (i = 0; i < nargs; ++i)
2531 tree arg = TREE_VEC_ELT (inner_args, i);
2532 if (/* These first two lines are the `non-type' bit. */
2534 && TREE_CODE (arg) != TEMPLATE_DECL
2535 /* This next line is the `argument expression is not just a
2536 simple identifier' condition and also the `specialized
2537 non-type argument' bit. */
2538 && TREE_CODE (arg) != TEMPLATE_PARM_INDEX)
2540 if (tpd.arg_uses_template_parms[i])
2541 error ("template argument `%E' involves template parameter(s)", arg);
2544 /* Look at the corresponding template parameter,
2545 marking which template parameters its type depends
2548 TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (main_inner_parms,
2553 /* We haven't yet initialized TPD2. Do so now. */
2554 tpd2.arg_uses_template_parms
2555 = alloca (sizeof (int) * nargs);
2556 /* The number of parameters here is the number in the
2557 main template, which, as checked in the assertion
2559 tpd2.parms = alloca (sizeof (int) * nargs);
2561 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (maintmpl));
2564 /* Mark the template parameters. But this time, we're
2565 looking for the template parameters of the main
2566 template, not in the specialization. */
2567 tpd2.current_arg = i;
2568 tpd2.arg_uses_template_parms[i] = 0;
2569 memset (tpd2.parms, 0, sizeof (int) * nargs);
2570 for_each_template_parm (type,
2571 &mark_template_parm,
2575 if (tpd2.arg_uses_template_parms [i])
2577 /* The type depended on some template parameters.
2578 If they are fully specialized in the
2579 specialization, that's OK. */
2581 for (j = 0; j < nargs; ++j)
2582 if (tpd2.parms[j] != 0
2583 && tpd.arg_uses_template_parms [j])
2585 error ("type `%T' of template argument `%E' depends on template parameter(s)",
2595 if (retrieve_specialization (maintmpl, specargs))
2596 /* We've already got this specialization. */
2599 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl)
2600 = tree_cons (inner_args, inner_parms,
2601 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl));
2602 TREE_TYPE (DECL_TEMPLATE_SPECIALIZATIONS (maintmpl)) = type;
2606 /* Check that a template declaration's use of default arguments is not
2607 invalid. Here, PARMS are the template parameters. IS_PRIMARY is
2608 nonzero if DECL is the thing declared by a primary template.
2609 IS_PARTIAL is nonzero if DECL is a partial specialization. */
2612 check_default_tmpl_args (tree decl, tree parms, int is_primary, int is_partial)
2615 int last_level_to_check;
2620 A default template-argument shall not be specified in a
2621 function template declaration or a function template definition, nor
2622 in the template-parameter-list of the definition of a member of a
2625 if (TREE_CODE (CP_DECL_CONTEXT (decl)) == FUNCTION_DECL)
2626 /* You can't have a function template declaration in a local
2627 scope, nor you can you define a member of a class template in a
2631 if (current_class_type
2632 && !TYPE_BEING_DEFINED (current_class_type)
2633 && DECL_LANG_SPECIFIC (decl)
2634 /* If this is either a friend defined in the scope of the class
2635 or a member function. */
2636 && (DECL_FUNCTION_MEMBER_P (decl)
2637 ? same_type_p (DECL_CONTEXT (decl), current_class_type)
2638 : DECL_FRIEND_CONTEXT (decl)
2639 ? same_type_p (DECL_FRIEND_CONTEXT (decl), current_class_type)
2641 /* And, if it was a member function, it really was defined in
2642 the scope of the class. */
2643 && (!DECL_FUNCTION_MEMBER_P (decl)
2644 || DECL_INITIALIZED_IN_CLASS_P (decl)))
2645 /* We already checked these parameters when the template was
2646 declared, so there's no need to do it again now. This function
2647 was defined in class scope, but we're processing it's body now
2648 that the class is complete. */
2653 If a template-parameter has a default template-argument, all
2654 subsequent template-parameters shall have a default
2655 template-argument supplied. */
2656 for (parm_level = parms; parm_level; parm_level = TREE_CHAIN (parm_level))
2658 tree inner_parms = TREE_VALUE (parm_level);
2659 int ntparms = TREE_VEC_LENGTH (inner_parms);
2660 int seen_def_arg_p = 0;
2663 for (i = 0; i < ntparms; ++i)
2665 tree parm = TREE_VEC_ELT (inner_parms, i);
2666 if (TREE_PURPOSE (parm))
2668 else if (seen_def_arg_p)
2670 error ("no default argument for `%D'", TREE_VALUE (parm));
2671 /* For better subsequent error-recovery, we indicate that
2672 there should have been a default argument. */
2673 TREE_PURPOSE (parm) = error_mark_node;
2678 if (TREE_CODE (decl) != TYPE_DECL || is_partial || !is_primary)
2679 /* For an ordinary class template, default template arguments are
2680 allowed at the innermost level, e.g.:
2681 template <class T = int>
2683 but, in a partial specialization, they're not allowed even
2684 there, as we have in [temp.class.spec]:
2686 The template parameter list of a specialization shall not
2687 contain default template argument values.
2689 So, for a partial specialization, or for a function template,
2690 we look at all of them. */
2693 /* But, for a primary class template that is not a partial
2694 specialization we look at all template parameters except the
2696 parms = TREE_CHAIN (parms);
2698 /* Figure out what error message to issue. */
2699 if (TREE_CODE (decl) == FUNCTION_DECL)
2700 msg = "default template arguments may not be used in function templates";
2701 else if (is_partial)
2702 msg = "default template arguments may not be used in partial specializations";
2704 msg = "default argument for template parameter for class enclosing `%D'";
2706 if (current_class_type && TYPE_BEING_DEFINED (current_class_type))
2707 /* If we're inside a class definition, there's no need to
2708 examine the parameters to the class itself. On the one
2709 hand, they will be checked when the class is defined, and,
2710 on the other, default arguments are valid in things like:
2711 template <class T = double>
2712 struct S { template <class U> void f(U); };
2713 Here the default argument for `S' has no bearing on the
2714 declaration of `f'. */
2715 last_level_to_check = template_class_depth (current_class_type) + 1;
2717 /* Check everything. */
2718 last_level_to_check = 0;
2720 for (parm_level = parms;
2721 parm_level && TMPL_PARMS_DEPTH (parm_level) >= last_level_to_check;
2722 parm_level = TREE_CHAIN (parm_level))
2724 tree inner_parms = TREE_VALUE (parm_level);
2728 ntparms = TREE_VEC_LENGTH (inner_parms);
2729 for (i = 0; i < ntparms; ++i)
2730 if (TREE_PURPOSE (TREE_VEC_ELT (inner_parms, i)))
2738 /* Clear out the default argument so that we are not
2740 TREE_PURPOSE (TREE_VEC_ELT (inner_parms, i)) = NULL_TREE;
2743 /* At this point, if we're still interested in issuing messages,
2744 they must apply to classes surrounding the object declared. */
2746 msg = "default argument for template parameter for class enclosing `%D'";
2750 /* Worker for push_template_decl_real, called via
2751 for_each_template_parm. DATA is really an int, indicating the
2752 level of the parameters we are interested in. If T is a template
2753 parameter of that level, return nonzero. */
2756 template_parm_this_level_p (tree t, void* data)
2758 int this_level = *(int *)data;
2761 if (TREE_CODE (t) == TEMPLATE_PARM_INDEX)
2762 level = TEMPLATE_PARM_LEVEL (t);
2764 level = TEMPLATE_TYPE_LEVEL (t);
2765 return level == this_level;
2768 /* Creates a TEMPLATE_DECL for the indicated DECL using the template
2769 parameters given by current_template_args, or reuses a
2770 previously existing one, if appropriate. Returns the DECL, or an
2771 equivalent one, if it is replaced via a call to duplicate_decls.
2773 If IS_FRIEND is nonzero, DECL is a friend declaration. */
2776 push_template_decl_real (tree decl, int is_friend)
2784 int new_template_p = 0;
2786 if (decl == error_mark_node)
2789 /* See if this is a partial specialization. */
2790 is_partial = (DECL_IMPLICIT_TYPEDEF_P (decl)
2791 && TREE_CODE (TREE_TYPE (decl)) != ENUMERAL_TYPE
2792 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl)));
2794 is_friend |= (TREE_CODE (decl) == FUNCTION_DECL && DECL_FRIEND_P (decl));
2797 /* For a friend, we want the context of the friend function, not
2798 the type of which it is a friend. */
2799 ctx = DECL_CONTEXT (decl);
2800 else if (CP_DECL_CONTEXT (decl)
2801 && TREE_CODE (CP_DECL_CONTEXT (decl)) != NAMESPACE_DECL)
2802 /* In the case of a virtual function, we want the class in which
2804 ctx = CP_DECL_CONTEXT (decl);
2806 /* Otherwise, if we're currently defining some class, the DECL
2807 is assumed to be a member of the class. */
2808 ctx = current_scope ();
2810 if (ctx && TREE_CODE (ctx) == NAMESPACE_DECL)
2813 if (!DECL_CONTEXT (decl))
2814 DECL_CONTEXT (decl) = FROB_CONTEXT (current_namespace);
2816 /* See if this is a primary template. */
2817 primary = template_parm_scope_p ();
2821 if (current_lang_name == lang_name_c)
2822 error ("template with C linkage");
2823 else if (TREE_CODE (decl) == TYPE_DECL
2824 && ANON_AGGRNAME_P (DECL_NAME (decl)))
2825 error ("template class without a name");
2826 else if (TREE_CODE (decl) == FUNCTION_DECL
2827 && DECL_DESTRUCTOR_P (decl))
2831 A destructor shall not be a member template. */
2832 error ("destructor `%D' declared as member template", decl);
2833 return error_mark_node;
2835 else if ((DECL_IMPLICIT_TYPEDEF_P (decl)
2836 && CLASS_TYPE_P (TREE_TYPE (decl)))
2837 || (TREE_CODE (decl) == VAR_DECL && ctx && CLASS_TYPE_P (ctx))
2838 || TREE_CODE (decl) == FUNCTION_DECL)
2842 error ("template declaration of `%#D'", decl);
2843 return error_mark_node;
2847 /* Check to see that the rules regarding the use of default
2848 arguments are not being violated. */
2849 check_default_tmpl_args (decl, current_template_parms,
2850 primary, is_partial);
2853 return process_partial_specialization (decl);
2855 args = current_template_args ();
2858 || TREE_CODE (ctx) == FUNCTION_DECL
2859 || (CLASS_TYPE_P (ctx) && TYPE_BEING_DEFINED (ctx))
2860 || (is_friend && !DECL_TEMPLATE_INFO (decl)))
2862 if (DECL_LANG_SPECIFIC (decl)
2863 && DECL_TEMPLATE_INFO (decl)
2864 && DECL_TI_TEMPLATE (decl))
2865 tmpl = DECL_TI_TEMPLATE (decl);
2866 /* If DECL is a TYPE_DECL for a class-template, then there won't
2867 be DECL_LANG_SPECIFIC. The information equivalent to
2868 DECL_TEMPLATE_INFO is found in TYPE_TEMPLATE_INFO instead. */
2869 else if (DECL_IMPLICIT_TYPEDEF_P (decl)
2870 && TYPE_TEMPLATE_INFO (TREE_TYPE (decl))
2871 && TYPE_TI_TEMPLATE (TREE_TYPE (decl)))
2873 /* Since a template declaration already existed for this
2874 class-type, we must be redeclaring it here. Make sure
2875 that the redeclaration is valid. */
2876 redeclare_class_template (TREE_TYPE (decl),
2877 current_template_parms);
2878 /* We don't need to create a new TEMPLATE_DECL; just use the
2879 one we already had. */
2880 tmpl = TYPE_TI_TEMPLATE (TREE_TYPE (decl));
2884 tmpl = build_template_decl (decl, current_template_parms);
2887 if (DECL_LANG_SPECIFIC (decl)
2888 && DECL_TEMPLATE_SPECIALIZATION (decl))
2890 /* A specialization of a member template of a template
2892 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl);
2893 DECL_TEMPLATE_INFO (tmpl) = DECL_TEMPLATE_INFO (decl);
2894 DECL_TEMPLATE_INFO (decl) = NULL_TREE;
2900 tree a, t, current, parms;
2903 if (TREE_CODE (decl) == TYPE_DECL)
2905 if ((IS_AGGR_TYPE_CODE (TREE_CODE (TREE_TYPE (decl)))
2906 || TREE_CODE (TREE_TYPE (decl)) == ENUMERAL_TYPE)
2907 && TYPE_TEMPLATE_INFO (TREE_TYPE (decl))
2908 && TYPE_TI_TEMPLATE (TREE_TYPE (decl)))
2909 tmpl = TYPE_TI_TEMPLATE (TREE_TYPE (decl));
2912 error ("`%D' does not declare a template type", decl);
2916 else if (!DECL_LANG_SPECIFIC (decl) || !DECL_TEMPLATE_INFO (decl))
2918 error ("template definition of non-template `%#D'", decl);
2922 tmpl = DECL_TI_TEMPLATE (decl);
2924 if (DECL_FUNCTION_TEMPLATE_P (tmpl)
2925 && DECL_TEMPLATE_INFO (decl) && DECL_TI_ARGS (decl)
2926 && DECL_TEMPLATE_SPECIALIZATION (decl)
2927 && is_member_template (tmpl))
2931 /* The declaration is a specialization of a member
2932 template, declared outside the class. Therefore, the
2933 innermost template arguments will be NULL, so we
2934 replace them with the arguments determined by the
2935 earlier call to check_explicit_specialization. */
2936 args = DECL_TI_ARGS (decl);
2939 = build_template_decl (decl, current_template_parms);
2940 DECL_TEMPLATE_RESULT (new_tmpl) = decl;
2941 TREE_TYPE (new_tmpl) = TREE_TYPE (decl);
2942 DECL_TI_TEMPLATE (decl) = new_tmpl;
2943 SET_DECL_TEMPLATE_SPECIALIZATION (new_tmpl);
2944 DECL_TEMPLATE_INFO (new_tmpl)
2945 = tree_cons (tmpl, args, NULL_TREE);
2947 register_specialization (new_tmpl,
2948 most_general_template (tmpl),
2953 /* Make sure the template headers we got make sense. */
2955 parms = DECL_TEMPLATE_PARMS (tmpl);
2956 i = TMPL_PARMS_DEPTH (parms);
2957 if (TMPL_ARGS_DEPTH (args) != i)
2959 error ("expected %d levels of template parms for `%#D', got %d",
2960 i, decl, TMPL_ARGS_DEPTH (args));
2963 for (current = decl; i > 0; --i, parms = TREE_CHAIN (parms))
2965 a = TMPL_ARGS_LEVEL (args, i);
2966 t = INNERMOST_TEMPLATE_PARMS (parms);
2968 if (TREE_VEC_LENGTH (t) != TREE_VEC_LENGTH (a))
2970 if (current == decl)
2971 error ("got %d template parameters for `%#D'",
2972 TREE_VEC_LENGTH (a), decl);
2974 error ("got %d template parameters for `%#T'",
2975 TREE_VEC_LENGTH (a), current);
2976 error (" but %d required", TREE_VEC_LENGTH (t));
2979 /* Perhaps we should also check that the parms are used in the
2980 appropriate qualifying scopes in the declarator? */
2982 if (current == decl)
2985 current = TYPE_CONTEXT (current);
2989 DECL_TEMPLATE_RESULT (tmpl) = decl;
2990 TREE_TYPE (tmpl) = TREE_TYPE (decl);
2992 /* Push template declarations for global functions and types. Note
2993 that we do not try to push a global template friend declared in a
2994 template class; such a thing may well depend on the template
2995 parameters of the class. */
2996 if (new_template_p && !ctx
2997 && !(is_friend && template_class_depth (current_class_type) > 0))
2998 tmpl = pushdecl_namespace_level (tmpl);
3002 DECL_PRIMARY_TEMPLATE (tmpl) = tmpl;
3003 if (DECL_CONV_FN_P (tmpl))
3005 int depth = TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl));
3007 /* It is a conversion operator. See if the type converted to
3008 depends on innermost template operands. */
3010 if (uses_template_parms_level (TREE_TYPE (TREE_TYPE (tmpl)),
3012 DECL_TEMPLATE_CONV_FN_P (tmpl) = 1;
3016 /* The DECL_TI_ARGS of DECL contains full set of arguments referring
3017 back to its most general template. If TMPL is a specialization,
3018 ARGS may only have the innermost set of arguments. Add the missing
3019 argument levels if necessary. */
3020 if (DECL_TEMPLATE_INFO (tmpl))
3021 args = add_outermost_template_args (DECL_TI_ARGS (tmpl), args);
3023 info = tree_cons (tmpl, args, NULL_TREE);
3025 if (DECL_IMPLICIT_TYPEDEF_P (decl))
3027 SET_TYPE_TEMPLATE_INFO (TREE_TYPE (tmpl), info);
3028 if ((!ctx || TREE_CODE (ctx) != FUNCTION_DECL)
3029 && TREE_CODE (TREE_TYPE (decl)) != ENUMERAL_TYPE
3030 /* Don't change the name if we've already set it up. */
3031 && !IDENTIFIER_TEMPLATE (DECL_NAME (decl)))
3032 DECL_NAME (decl) = classtype_mangled_name (TREE_TYPE (decl));
3034 else if (DECL_LANG_SPECIFIC (decl))
3035 DECL_TEMPLATE_INFO (decl) = info;
3037 return DECL_TEMPLATE_RESULT (tmpl);
3041 push_template_decl (tree decl)
3043 return push_template_decl_real (decl, 0);
3046 /* Called when a class template TYPE is redeclared with the indicated
3047 template PARMS, e.g.:
3049 template <class T> struct S;
3050 template <class T> struct S {}; */
3053 redeclare_class_template (tree type, tree parms)
3059 if (!TYPE_TEMPLATE_INFO (type))
3061 error ("`%T' is not a template type", type);
3065 tmpl = TYPE_TI_TEMPLATE (type);
3066 if (!PRIMARY_TEMPLATE_P (tmpl))
3067 /* The type is nested in some template class. Nothing to worry
3068 about here; there are no new template parameters for the nested
3072 parms = INNERMOST_TEMPLATE_PARMS (parms);
3073 tmpl_parms = DECL_INNERMOST_TEMPLATE_PARMS (tmpl);
3075 if (TREE_VEC_LENGTH (parms) != TREE_VEC_LENGTH (tmpl_parms))
3077 cp_error_at ("previous declaration `%D'", tmpl);
3078 error ("used %d template parameter%s instead of %d",
3079 TREE_VEC_LENGTH (tmpl_parms),
3080 TREE_VEC_LENGTH (tmpl_parms) == 1 ? "" : "s",
3081 TREE_VEC_LENGTH (parms));
3085 for (i = 0; i < TREE_VEC_LENGTH (tmpl_parms); ++i)
3087 tree tmpl_parm = TREE_VALUE (TREE_VEC_ELT (tmpl_parms, i));
3088 tree parm = TREE_VALUE (TREE_VEC_ELT (parms, i));
3089 tree tmpl_default = TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms, i));
3090 tree parm_default = TREE_PURPOSE (TREE_VEC_ELT (parms, i));
3092 if (TREE_CODE (tmpl_parm) != TREE_CODE (parm))
3094 cp_error_at ("template parameter `%#D'", tmpl_parm);
3095 error ("redeclared here as `%#D'", parm);
3099 if (tmpl_default != NULL_TREE && parm_default != NULL_TREE)
3101 /* We have in [temp.param]:
3103 A template-parameter may not be given default arguments
3104 by two different declarations in the same scope. */
3105 error ("redefinition of default argument for `%#D'", parm);
3106 error ("%J original definition appeared here", tmpl_parm);
3110 if (parm_default != NULL_TREE)
3111 /* Update the previous template parameters (which are the ones
3112 that will really count) with the new default value. */
3113 TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms, i)) = parm_default;
3114 else if (tmpl_default != NULL_TREE)
3115 /* Update the new parameters, too; they'll be used as the
3116 parameters for any members. */
3117 TREE_PURPOSE (TREE_VEC_ELT (parms, i)) = tmpl_default;
3121 /* Simplify EXPR if it is a non-dependent expression. Returns the
3122 (possibly simplified) expression. */
3125 fold_non_dependent_expr (tree expr)
3127 /* If we're in a template, but EXPR isn't value dependent, simplify
3128 it. We're supposed to treat:
3130 template <typename T> void f(T[1 + 1]);
3131 template <typename T> void f(T[2]);
3133 as two declarations of the same function, for example. */
3134 if (processing_template_decl
3135 && !type_dependent_expression_p (expr)
3136 && !value_dependent_expression_p (expr))
3138 HOST_WIDE_INT saved_processing_template_decl;
3140 saved_processing_template_decl = processing_template_decl;
3141 processing_template_decl = 0;
3142 expr = tsubst_copy_and_build (expr,
3145 /*in_decl=*/NULL_TREE,
3146 /*function_p=*/false);
3147 processing_template_decl = saved_processing_template_decl;
3152 /* Attempt to convert the non-type template parameter EXPR to the
3153 indicated TYPE. If the conversion is successful, return the
3154 converted value. If the conversion is unsuccessful, return
3155 NULL_TREE if we issued an error message, or error_mark_node if we
3156 did not. We issue error messages for out-and-out bad template
3157 parameters, but not simply because the conversion failed, since we
3158 might be just trying to do argument deduction. Both TYPE and EXPR
3159 must be non-dependent. */
3162 convert_nontype_argument (tree type, tree expr)
3166 /* If we are in a template, EXPR may be non-dependent, but still
3167 have a syntactic, rather than semantic, form. For example, EXPR
3168 might be a SCOPE_REF, rather than the VAR_DECL to which the
3169 SCOPE_REF refers. Preserving the qualifying scope is necessary
3170 so that access checking can be performed when the template is
3171 instantiated -- but here we need the resolved form so that we can
3172 convert the argument. */
3173 expr = fold_non_dependent_expr (expr);
3174 expr_type = TREE_TYPE (expr);
3176 /* A template-argument for a non-type, non-template
3177 template-parameter shall be one of:
3179 --an integral constant-expression of integral or enumeration
3182 --the name of a non-type template-parameter; or
3184 --the name of an object or function with external linkage,
3185 including function templates and function template-ids but
3186 excluding non-static class members, expressed as id-expression;
3189 --the address of an object or function with external linkage,
3190 including function templates and function template-ids but
3191 excluding non-static class members, expressed as & id-expression
3192 where the & is optional if the name refers to a function or
3195 --a pointer to member expressed as described in _expr.unary.op_. */
3197 /* An integral constant-expression can include const variables or
3198 . enumerators. Simplify things by folding them to their values,
3199 unless we're about to bind the declaration to a reference
3201 if (INTEGRAL_TYPE_P (expr_type) && TREE_CODE (type) != REFERENCE_TYPE)
3204 tree const_expr = decl_constant_value (expr);
3205 /* In a template, the initializer for a VAR_DECL may not be
3206 marked as TREE_CONSTANT, in which case decl_constant_value
3207 will not return the initializer. Handle that special case
3209 if (expr == const_expr
3210 && TREE_CODE (expr) == VAR_DECL
3211 && DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (expr)
3212 && CP_TYPE_CONST_NON_VOLATILE_P (TREE_TYPE (expr))
3213 /* DECL_INITIAL can be NULL if we are processing a
3214 variable initialized to an expression involving itself.
3215 We know it is initialized to a constant -- but not what
3217 && DECL_INITIAL (expr))
3218 const_expr = DECL_INITIAL (expr);
3219 if (expr == const_expr)
3221 expr = fold_non_dependent_expr (const_expr);
3224 if (is_overloaded_fn (expr))
3225 /* OK for now. We'll check that it has external linkage later.
3226 Check this first since if expr_type is the unknown_type_node
3227 we would otherwise complain below. */
3229 else if (TYPE_PTR_TO_MEMBER_P (expr_type))
3231 if (TREE_CODE (expr) != PTRMEM_CST)
3234 else if (TYPE_PTR_P (expr_type)
3235 || TREE_CODE (expr_type) == ARRAY_TYPE
3236 || TREE_CODE (type) == REFERENCE_TYPE
3237 /* If expr is the address of an overloaded function, we
3238 will get the unknown_type_node at this point. */
3239 || expr_type == unknown_type_node)
3245 if (TREE_CODE (expr_type) == ARRAY_TYPE
3246 || (TREE_CODE (type) == REFERENCE_TYPE
3247 && TREE_CODE (e) != ADDR_EXPR))
3251 if (TREE_CODE (e) != ADDR_EXPR)
3254 error ("`%E' is not a valid template argument", expr);
3255 if (TYPE_PTR_P (expr_type))
3257 if (TREE_CODE (TREE_TYPE (expr_type)) == FUNCTION_TYPE)
3258 error ("it must be the address of a function with external linkage");
3260 error ("it must be the address of an object with external linkage");
3262 else if (TYPE_PTR_TO_MEMBER_P (expr_type))
3263 error ("it must be a pointer-to-member of the form `&X::Y'");
3268 referent = TREE_OPERAND (e, 0);
3269 STRIP_NOPS (referent);
3272 if (TREE_CODE (referent) == STRING_CST)
3274 error ("string literal %E is not a valid template argument because it is the address of an object with static linkage",
3279 if (TREE_CODE (referent) == SCOPE_REF)
3280 referent = TREE_OPERAND (referent, 1);
3282 if (is_overloaded_fn (referent))
3283 /* We'll check that it has external linkage later. */
3285 else if (TREE_CODE (referent) != VAR_DECL)
3287 else if (!DECL_EXTERNAL_LINKAGE_P (referent))
3289 error ("address of non-extern `%E' cannot be used as template argument", referent);
3290 return error_mark_node;
3293 else if (INTEGRAL_TYPE_P (expr_type) || TYPE_PTR_TO_MEMBER_P (expr_type))
3295 if (! TREE_CONSTANT (expr))
3298 error ("non-constant `%E' cannot be used as template argument",
3306 error ("type '%T' cannot be used as a value for a non-type "
3307 "template-parameter", expr);
3308 else if (DECL_P (expr))
3309 error ("invalid use of '%D' as a non-type template-argument", expr);
3311 error ("invalid use of '%E' as a non-type template-argument", expr);
3316 switch (TREE_CODE (type))
3321 /* For a non-type template-parameter of integral or enumeration
3322 type, integral promotions (_conv.prom_) and integral
3323 conversions (_conv.integral_) are applied. */
3324 if (!INTEGRAL_TYPE_P (expr_type))
3325 return error_mark_node;
3327 /* It's safe to call digest_init in this case; we know we're
3328 just converting one integral constant expression to another. */
3329 expr = digest_init (type, expr, (tree*) 0);
3331 if (TREE_CODE (expr) != INTEGER_CST)
3332 /* Curiously, some TREE_CONSTANT integral expressions do not
3333 simplify to integer constants. For example, `3 % 0',
3334 remains a TRUNC_MOD_EXPR. */
3343 /* For a non-type template-parameter of type pointer to data
3344 member, qualification conversions (_conv.qual_) are
3346 e = perform_qualification_conversions (type, expr);
3347 if (TREE_CODE (e) == NOP_EXPR)
3348 /* The call to perform_qualification_conversions will
3349 insert a NOP_EXPR over EXPR to do express conversion,
3350 if necessary. But, that will confuse us if we use
3351 this (converted) template parameter to instantiate
3352 another template; then the thing will not look like a
3353 valid template argument. So, just make a new
3354 constant, of the appropriate type. */
3355 e = make_ptrmem_cst (type, PTRMEM_CST_MEMBER (expr));
3361 tree type_pointed_to = TREE_TYPE (type);
3363 if (TREE_CODE (type_pointed_to) == FUNCTION_TYPE)
3365 /* For a non-type template-parameter of type pointer to
3366 function, only the function-to-pointer conversion
3367 (_conv.func_) is applied. If the template-argument
3368 represents a set of overloaded functions (or a pointer to
3369 such), the matching function is selected from the set
3374 if (TREE_CODE (expr) == ADDR_EXPR)
3375 fns = TREE_OPERAND (expr, 0);
3379 fn = instantiate_type (type_pointed_to, fns, tf_none);
3381 if (fn == error_mark_node)
3382 return error_mark_node;
3384 if (!DECL_EXTERNAL_LINKAGE_P (fn))
3386 if (really_overloaded_fn (fns))
3387 return error_mark_node;
3392 expr = build_unary_op (ADDR_EXPR, fn, 0);
3394 my_friendly_assert (same_type_p (type, TREE_TYPE (expr)),
3400 /* For a non-type template-parameter of type pointer to
3401 object, qualification conversions (_conv.qual_) and the
3402 array-to-pointer conversion (_conv.array_) are applied.
3403 [Note: In particular, neither the null pointer conversion
3404 (_conv.ptr_) nor the derived-to-base conversion
3405 (_conv.ptr_) are applied. Although 0 is a valid
3406 template-argument for a non-type template-parameter of
3407 integral type, it is not a valid template-argument for a
3408 non-type template-parameter of pointer type.]
3410 The call to decay_conversion performs the
3411 array-to-pointer conversion, if appropriate. */
3412 expr = decay_conversion (expr);
3414 if (expr == error_mark_node)
3415 return error_mark_node;
3417 return perform_qualification_conversions (type, expr);
3422 case REFERENCE_TYPE:
3424 tree type_referred_to = TREE_TYPE (type);
3426 /* If this expression already has reference type, get the
3427 underlying object. */
3428 if (TREE_CODE (expr_type) == REFERENCE_TYPE)
3430 if (TREE_CODE (expr) == NOP_EXPR
3431 && TREE_CODE (TREE_OPERAND (expr, 0)) == ADDR_EXPR)
3433 my_friendly_assert (TREE_CODE (expr) == ADDR_EXPR, 20000604);
3434 expr = TREE_OPERAND (expr, 0);
3435 expr_type = TREE_TYPE (expr);
3438 if (TREE_CODE (type_referred_to) == FUNCTION_TYPE)
3440 /* For a non-type template-parameter of type reference to
3441 function, no conversions apply. If the
3442 template-argument represents a set of overloaded
3443 functions, the matching function is selected from the
3444 set (_over.over_). */
3447 fn = instantiate_type (type_referred_to, expr, tf_none);
3449 if (fn == error_mark_node)
3450 return error_mark_node;
3452 if (!DECL_EXTERNAL_LINKAGE_P (fn))
3454 if (really_overloaded_fn (expr))
3455 /* Don't issue an error here; we might get a different
3456 function if the overloading had worked out
3458 return error_mark_node;
3463 my_friendly_assert (same_type_p (type_referred_to,
3471 /* For a non-type template-parameter of type reference to
3472 object, no conversions apply. The type referred to by the
3473 reference may be more cv-qualified than the (otherwise
3474 identical) type of the template-argument. The
3475 template-parameter is bound directly to the
3476 template-argument, which must be an lvalue. */
3477 if (!same_type_p (TYPE_MAIN_VARIANT (expr_type),
3478 TYPE_MAIN_VARIANT (type_referred_to))
3479 || !at_least_as_qualified_p (type_referred_to,
3481 || !real_lvalue_p (expr))
3482 return error_mark_node;
3485 cxx_mark_addressable (expr);
3486 return build_nop (type, build_address (expr));
3492 my_friendly_assert (TYPE_PTRMEMFUNC_P (type), 20010112);
3494 /* For a non-type template-parameter of type pointer to member
3495 function, no conversions apply. If the template-argument
3496 represents a set of overloaded member functions, the
3497 matching member function is selected from the set
3500 if (!TYPE_PTRMEMFUNC_P (expr_type) &&
3501 expr_type != unknown_type_node)
3502 return error_mark_node;
3504 if (TREE_CODE (expr) == PTRMEM_CST)
3506 /* A ptr-to-member constant. */
3507 if (!same_type_p (type, expr_type))
3508 return error_mark_node;
3513 if (TREE_CODE (expr) != ADDR_EXPR)
3514 return error_mark_node;
3516 expr = instantiate_type (type, expr, tf_none);
3518 if (expr == error_mark_node)
3519 return error_mark_node;
3521 if (!same_type_p (type, TREE_TYPE (expr)))
3522 return error_mark_node;
3529 /* All non-type parameters must have one of these types. */
3534 return error_mark_node;
3537 /* Return 1 if PARM_PARMS and ARG_PARMS matches using rule for
3538 template template parameters. Both PARM_PARMS and ARG_PARMS are
3539 vectors of TREE_LIST nodes containing TYPE_DECL, TEMPLATE_DECL
3542 ARG_PARMS may contain more parameters than PARM_PARMS. If this is
3543 the case, then extra parameters must have default arguments.
3545 Consider the example:
3546 template <class T, class Allocator = allocator> class vector;
3547 template<template <class U> class TT> class C;
3549 C<vector> is a valid instantiation. PARM_PARMS for the above code
3550 contains a TYPE_DECL (for U), ARG_PARMS contains two TYPE_DECLs (for
3551 T and Allocator) and OUTER_ARGS contains the argument that is used to
3552 substitute the TT parameter. */
3555 coerce_template_template_parms (tree parm_parms,
3557 tsubst_flags_t complain,
3561 int nparms, nargs, i;
3564 my_friendly_assert (TREE_CODE (parm_parms) == TREE_VEC, 0);
3565 my_friendly_assert (TREE_CODE (arg_parms) == TREE_VEC, 0);
3567 nparms = TREE_VEC_LENGTH (parm_parms);
3568 nargs = TREE_VEC_LENGTH (arg_parms);
3570 /* The rule here is opposite of coerce_template_parms. */
3573 && TREE_PURPOSE (TREE_VEC_ELT (arg_parms, nparms)) == NULL_TREE))
3576 for (i = 0; i < nparms; ++i)
3578 parm = TREE_VALUE (TREE_VEC_ELT (parm_parms, i));
3579 arg = TREE_VALUE (TREE_VEC_ELT (arg_parms, i));
3581 if (arg == NULL_TREE || arg == error_mark_node
3582 || parm == NULL_TREE || parm == error_mark_node)
3585 if (TREE_CODE (arg) != TREE_CODE (parm))
3588 switch (TREE_CODE (parm))
3594 /* We encounter instantiations of templates like
3595 template <template <template <class> class> class TT>
3598 tree parmparm = DECL_INNERMOST_TEMPLATE_PARMS (parm);
3599 tree argparm = DECL_INNERMOST_TEMPLATE_PARMS (arg);
3601 if (!coerce_template_template_parms
3602 (parmparm, argparm, complain, in_decl, outer_args))
3608 /* The tsubst call is used to handle cases such as
3609 template <class T, template <T> class TT> class D;
3610 i.e. the parameter list of TT depends on earlier parameters. */
3612 (tsubst (TREE_TYPE (parm), outer_args, complain, in_decl),
3624 /* Convert the indicated template ARG as necessary to match the
3625 indicated template PARM. Returns the converted ARG, or
3626 error_mark_node if the conversion was unsuccessful. Error and
3627 warning messages are issued under control of COMPLAIN. This
3628 conversion is for the Ith parameter in the parameter list. ARGS is
3629 the full set of template arguments deduced so far. */
3632 convert_template_argument (tree parm,
3635 tsubst_flags_t complain,
3641 int is_type, requires_type, is_tmpl_type, requires_tmpl_type;
3643 inner_args = INNERMOST_TEMPLATE_ARGS (args);
3645 if (TREE_CODE (arg) == TREE_LIST
3646 && TREE_CODE (TREE_VALUE (arg)) == OFFSET_REF)
3648 /* The template argument was the name of some
3649 member function. That's usually
3650 invalid, but static members are OK. In any
3651 case, grab the underlying fields/functions
3652 and issue an error later if required. */
3653 arg = TREE_VALUE (arg);
3654 TREE_TYPE (arg) = unknown_type_node;
3657 requires_tmpl_type = TREE_CODE (parm) == TEMPLATE_DECL;
3658 requires_type = (TREE_CODE (parm) == TYPE_DECL
3659 || requires_tmpl_type);
3661 is_tmpl_type = ((TREE_CODE (arg) == TEMPLATE_DECL
3662 && TREE_CODE (DECL_TEMPLATE_RESULT (arg)) == TYPE_DECL)
3663 || TREE_CODE (arg) == TEMPLATE_TEMPLATE_PARM
3664 || TREE_CODE (arg) == UNBOUND_CLASS_TEMPLATE);
3667 && (TREE_CODE (arg) == TEMPLATE_TEMPLATE_PARM
3668 || TREE_CODE (arg) == UNBOUND_CLASS_TEMPLATE))
3669 arg = TYPE_STUB_DECL (arg);
3671 is_type = TYPE_P (arg) || is_tmpl_type;
3673 if (requires_type && ! is_type && TREE_CODE (arg) == SCOPE_REF
3674 && TREE_CODE (TREE_OPERAND (arg, 0)) == TEMPLATE_TYPE_PARM)
3676 pedwarn ("to refer to a type member of a template parameter, use `typename %E'", arg);
3678 arg = make_typename_type (TREE_OPERAND (arg, 0),
3679 TREE_OPERAND (arg, 1),
3680 complain & tf_error);
3683 if (is_type != requires_type)
3687 if (complain & tf_error)
3689 error ("type/value mismatch at argument %d in template parameter list for `%D'",
3692 error (" expected a constant of type `%T', got `%T'",
3694 (is_tmpl_type ? DECL_NAME (arg) : arg));
3695 else if (requires_tmpl_type)
3696 error (" expected a class template, got `%E'", arg);
3698 error (" expected a type, got `%E'", arg);
3701 return error_mark_node;
3703 if (is_tmpl_type ^ requires_tmpl_type)
3705 if (in_decl && (complain & tf_error))
3707 error ("type/value mismatch at argument %d in template parameter list for `%D'",
3710 error (" expected a type, got `%T'", DECL_NAME (arg));
3712 error (" expected a class template, got `%T'", arg);
3714 return error_mark_node;
3719 if (requires_tmpl_type)
3721 if (TREE_CODE (TREE_TYPE (arg)) == UNBOUND_CLASS_TEMPLATE)
3722 /* The number of argument required is not known yet.
3723 Just accept it for now. */
3724 val = TREE_TYPE (arg);
3727 tree parmparm = DECL_INNERMOST_TEMPLATE_PARMS (parm);
3728 tree argparm = DECL_INNERMOST_TEMPLATE_PARMS (arg);
3730 if (coerce_template_template_parms (parmparm, argparm,
3736 /* TEMPLATE_TEMPLATE_PARM node is preferred over
3738 if (val != error_mark_node
3739 && DECL_TEMPLATE_TEMPLATE_PARM_P (val))
3740 val = TREE_TYPE (val);
3744 if (in_decl && (complain & tf_error))
3746 error ("type/value mismatch at argument %d in template parameter list for `%D'",
3748 error (" expected a template of type `%D', got `%D'", parm, arg);
3751 val = error_mark_node;
3760 tree t = tsubst (TREE_TYPE (parm), args, complain, in_decl);
3762 if (invalid_nontype_parm_type_p (t, complain))
3763 return error_mark_node;
3765 if (!uses_template_parms (arg) && !uses_template_parms (t))
3766 /* We used to call digest_init here. However, digest_init
3767 will report errors, which we don't want when complain
3768 is zero. More importantly, digest_init will try too
3769 hard to convert things: for example, `0' should not be
3770 converted to pointer type at this point according to
3771 the standard. Accepting this is not merely an
3772 extension, since deciding whether or not these
3773 conversions can occur is part of determining which
3774 function template to call, or whether a given explicit
3775 argument specification is valid. */
3776 val = convert_nontype_argument (t, arg);
3780 if (val == NULL_TREE)
3781 val = error_mark_node;
3782 else if (val == error_mark_node && (complain & tf_error))
3783 error ("could not convert template argument `%E' to `%T'",
3790 /* Convert all template arguments to their appropriate types, and
3791 return a vector containing the innermost resulting template
3792 arguments. If any error occurs, return error_mark_node. Error and
3793 warning messages are issued under control of COMPLAIN.
3795 If REQUIRE_ALL_ARGUMENTS is nonzero, all arguments must be
3796 provided in ARGLIST, or else trailing parameters must have default
3797 values. If REQUIRE_ALL_ARGUMENTS is zero, we will attempt argument
3798 deduction for any unspecified trailing arguments. */
3801 coerce_template_parms (tree parms,
3804 tsubst_flags_t complain,
3805 int require_all_arguments)
3807 int nparms, nargs, i, lost = 0;
3810 tree new_inner_args;
3812 inner_args = INNERMOST_TEMPLATE_ARGS (args);
3813 nargs = inner_args ? NUM_TMPL_ARGS (inner_args) : 0;
3814 nparms = TREE_VEC_LENGTH (parms);
3818 && require_all_arguments
3819 && TREE_PURPOSE (TREE_VEC_ELT (parms, nargs)) == NULL_TREE))
3821 if (complain & tf_error)
3823 error ("wrong number of template arguments (%d, should be %d)",
3827 cp_error_at ("provided for `%D'", in_decl);
3830 return error_mark_node;
3833 new_inner_args = make_tree_vec (nparms);
3834 new_args = add_outermost_template_args (args, new_inner_args);
3835 for (i = 0; i < nparms; i++)
3840 /* Get the Ith template parameter. */
3841 parm = TREE_VEC_ELT (parms, i);
3843 /* Calculate the Ith argument. */
3845 arg = TREE_VEC_ELT (inner_args, i);
3846 else if (require_all_arguments)
3847 /* There must be a default arg in this case. */
3848 arg = tsubst_template_arg (TREE_PURPOSE (parm), new_args,
3853 my_friendly_assert (arg, 20030727);
3854 if (arg == error_mark_node)
3855 error ("template argument %d is invalid", i + 1);
3857 arg = convert_template_argument (TREE_VALUE (parm),
3858 arg, new_args, complain, i,
3861 if (arg == error_mark_node)
3863 TREE_VEC_ELT (new_inner_args, i) = arg;
3867 return error_mark_node;
3869 return new_inner_args;
3872 /* Returns 1 if template args OT and NT are equivalent. */
3875 template_args_equal (tree ot, tree nt)
3880 if (TREE_CODE (nt) == TREE_VEC)
3881 /* For member templates */
3882 return TREE_CODE (ot) == TREE_VEC && comp_template_args (ot, nt);
3883 else if (TYPE_P (nt))
3884 return TYPE_P (ot) && same_type_p (ot, nt);
3885 else if (TREE_CODE (ot) == TREE_VEC || TYPE_P (ot))
3888 return cp_tree_equal (ot, nt);
3891 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets
3892 of template arguments. Returns 0 otherwise. */
3895 comp_template_args (tree oldargs, tree newargs)
3899 if (TREE_VEC_LENGTH (oldargs) != TREE_VEC_LENGTH (newargs))
3902 for (i = 0; i < TREE_VEC_LENGTH (oldargs); ++i)
3904 tree nt = TREE_VEC_ELT (newargs, i);
3905 tree ot = TREE_VEC_ELT (oldargs, i);
3907 if (! template_args_equal (ot, nt))
3913 /* Given class template name and parameter list, produce a user-friendly name
3914 for the instantiation. */
3917 mangle_class_name_for_template (const char* name, tree parms, tree arglist)
3919 static struct obstack scratch_obstack;
3920 static char *scratch_firstobj;
3923 if (!scratch_firstobj)
3924 gcc_obstack_init (&scratch_obstack);
3926 obstack_free (&scratch_obstack, scratch_firstobj);
3927 scratch_firstobj = obstack_alloc (&scratch_obstack, 1);
3929 #define ccat(C) obstack_1grow (&scratch_obstack, (C));
3930 #define cat(S) obstack_grow (&scratch_obstack, (S), strlen (S))
3934 nparms = TREE_VEC_LENGTH (parms);
3935 arglist = INNERMOST_TEMPLATE_ARGS (arglist);
3936 my_friendly_assert (nparms == TREE_VEC_LENGTH (arglist), 268);
3937 for (i = 0; i < nparms; i++)
3939 tree parm = TREE_VALUE (TREE_VEC_ELT (parms, i));
3940 tree arg = TREE_VEC_ELT (arglist, i);
3945 if (TREE_CODE (parm) == TYPE_DECL)
3947 cat (type_as_string (arg, TFF_CHASE_TYPEDEF));
3950 else if (TREE_CODE (parm) == TEMPLATE_DECL)
3952 if (TREE_CODE (arg) == TEMPLATE_DECL)
3954 /* Already substituted with real template. Just output
3955 the template name here */
3956 tree context = DECL_CONTEXT (arg);
3959 /* The template may be defined in a namespace, or
3960 may be a member template. */
3961 my_friendly_assert (TREE_CODE (context) == NAMESPACE_DECL
3962 || CLASS_TYPE_P (context),
3964 cat(decl_as_string (DECL_CONTEXT (arg), TFF_PLAIN_IDENTIFIER));
3967 cat (IDENTIFIER_POINTER (DECL_NAME (arg)));
3970 /* Output the parameter declaration. */
3971 cat (type_as_string (arg, TFF_CHASE_TYPEDEF));
3975 my_friendly_assert (TREE_CODE (parm) == PARM_DECL, 269);
3977 /* No need to check arglist against parmlist here; we did that
3978 in coerce_template_parms, called from lookup_template_class. */
3979 cat (expr_as_string (arg, TFF_PLAIN_IDENTIFIER));
3982 char *bufp = obstack_next_free (&scratch_obstack);
3984 while (bufp[offset - 1] == ' ')
3986 obstack_blank_fast (&scratch_obstack, offset);
3988 /* B<C<char> >, not B<C<char>> */
3989 if (bufp[offset - 1] == '>')
3994 return (char *) obstack_base (&scratch_obstack);
3998 classtype_mangled_name (tree t)
4000 if (CLASSTYPE_TEMPLATE_INFO (t)
4001 /* Specializations have already had their names set up in
4002 lookup_template_class. */
4003 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (t))
4005 tree tmpl = most_general_template (CLASSTYPE_TI_TEMPLATE (t));
4007 /* For non-primary templates, the template parameters are
4008 implicit from their surrounding context. */
4009 if (PRIMARY_TEMPLATE_P (tmpl))
4011 tree name = DECL_NAME (tmpl);
4012 char *mangled_name = mangle_class_name_for_template
4013 (IDENTIFIER_POINTER (name),
4014 DECL_INNERMOST_TEMPLATE_PARMS (tmpl),
4015 CLASSTYPE_TI_ARGS (t));
4016 tree id = get_identifier (mangled_name);
4017 IDENTIFIER_TEMPLATE (id) = name;
4022 return TYPE_IDENTIFIER (t);
4026 add_pending_template (tree d)
4028 tree ti = (TYPE_P (d)
4029 ? CLASSTYPE_TEMPLATE_INFO (d)
4030 : DECL_TEMPLATE_INFO (d));
4034 if (TI_PENDING_TEMPLATE_FLAG (ti))
4037 /* We are called both from instantiate_decl, where we've already had a
4038 tinst_level pushed, and instantiate_template, where we haven't.
4040 level = !(current_tinst_level && TINST_DECL (current_tinst_level) == d);
4043 push_tinst_level (d);
4045 pt = tree_cons (current_tinst_level, d, NULL_TREE);
4046 if (last_pending_template)
4047 TREE_CHAIN (last_pending_template) = pt;
4049 pending_templates = pt;
4051 last_pending_template = pt;
4053 TI_PENDING_TEMPLATE_FLAG (ti) = 1;
4060 /* Return a TEMPLATE_ID_EXPR corresponding to the indicated FNS and
4061 ARGLIST. Valid choices for FNS are given in the cp-tree.def
4062 documentation for TEMPLATE_ID_EXPR. */
4065 lookup_template_function (tree fns, tree arglist)
4069 if (fns == error_mark_node || arglist == error_mark_node)
4070 return error_mark_node;
4072 my_friendly_assert (!arglist || TREE_CODE (arglist) == TREE_VEC, 20030726);
4073 if (fns == NULL_TREE
4074 || TREE_CODE (fns) == FUNCTION_DECL)
4076 error ("non-template used as template");
4077 return error_mark_node;
4080 my_friendly_assert (TREE_CODE (fns) == TEMPLATE_DECL
4081 || TREE_CODE (fns) == OVERLOAD
4083 || TREE_CODE (fns) == IDENTIFIER_NODE,
4086 if (BASELINK_P (fns))
4088 BASELINK_FUNCTIONS (fns) = build (TEMPLATE_ID_EXPR,
4090 BASELINK_FUNCTIONS (fns),
4095 type = TREE_TYPE (fns);
4096 if (TREE_CODE (fns) == OVERLOAD || !type)
4097 type = unknown_type_node;
4099 return build (TEMPLATE_ID_EXPR, type, fns, arglist);
4102 /* Within the scope of a template class S<T>, the name S gets bound
4103 (in build_self_reference) to a TYPE_DECL for the class, not a
4104 TEMPLATE_DECL. If DECL is a TYPE_DECL for current_class_type,
4105 or one of its enclosing classes, and that type is a template,
4106 return the associated TEMPLATE_DECL. Otherwise, the original
4107 DECL is returned. */
4110 maybe_get_template_decl_from_type_decl (tree decl)
4112 return (decl != NULL_TREE
4113 && TREE_CODE (decl) == TYPE_DECL
4114 && DECL_ARTIFICIAL (decl)
4115 && CLASS_TYPE_P (TREE_TYPE (decl))
4116 && CLASSTYPE_TEMPLATE_INFO (TREE_TYPE (decl)))
4117 ? CLASSTYPE_TI_TEMPLATE (TREE_TYPE (decl)) : decl;
4120 /* Given an IDENTIFIER_NODE (type TEMPLATE_DECL) and a chain of
4121 parameters, find the desired type.
4123 D1 is the PTYPENAME terminal, and ARGLIST is the list of arguments.
4125 IN_DECL, if non-NULL, is the template declaration we are trying to
4128 If ENTERING_SCOPE is nonzero, we are about to enter the scope of
4129 the class we are looking up.
4131 Issue error and warning messages under control of COMPLAIN.
4133 If the template class is really a local class in a template
4134 function, then the FUNCTION_CONTEXT is the function in which it is
4135 being instantiated. */
4138 lookup_template_class (tree d1,
4143 tsubst_flags_t complain)
4145 tree template = NULL_TREE, parmlist;
4148 timevar_push (TV_NAME_LOOKUP);
4150 if (TREE_CODE (d1) == IDENTIFIER_NODE)
4152 if (IDENTIFIER_VALUE (d1)
4153 && DECL_TEMPLATE_TEMPLATE_PARM_P (IDENTIFIER_VALUE (d1)))
4154 template = IDENTIFIER_VALUE (d1);
4158 push_decl_namespace (context);
4159 template = lookup_name (d1, /*prefer_type=*/0);
4160 template = maybe_get_template_decl_from_type_decl (template);
4162 pop_decl_namespace ();
4165 context = DECL_CONTEXT (template);
4167 else if (TREE_CODE (d1) == TYPE_DECL && IS_AGGR_TYPE (TREE_TYPE (d1)))
4169 tree type = TREE_TYPE (d1);
4171 /* If we are declaring a constructor, say A<T>::A<T>, we will get
4172 an implicit typename for the second A. Deal with it. */
4173 if (TREE_CODE (type) == TYPENAME_TYPE && TREE_TYPE (type))
4174 type = TREE_TYPE (type);
4176 if (CLASSTYPE_TEMPLATE_INFO (type))
4178 template = CLASSTYPE_TI_TEMPLATE (type);
4179 d1 = DECL_NAME (template);
4182 else if (TREE_CODE (d1) == ENUMERAL_TYPE
4183 || (TYPE_P (d1) && IS_AGGR_TYPE (d1)))
4185 template = TYPE_TI_TEMPLATE (d1);
4186 d1 = DECL_NAME (template);
4188 else if (TREE_CODE (d1) == TEMPLATE_DECL
4189 && TREE_CODE (DECL_TEMPLATE_RESULT (d1)) == TYPE_DECL)
4192 d1 = DECL_NAME (template);
4193 context = DECL_CONTEXT (template);
4196 /* With something like `template <class T> class X class X { ... };'
4197 we could end up with D1 having nothing but an IDENTIFIER_VALUE.
4198 We don't want to do that, but we have to deal with the situation,
4199 so let's give them some syntax errors to chew on instead of a
4200 crash. Alternatively D1 might not be a template type at all. */
4203 if (complain & tf_error)
4204 error ("`%T' is not a template", d1);
4205 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node);
4208 if (TREE_CODE (template) != TEMPLATE_DECL
4209 /* Make sure it's a user visible template, if it was named by
4211 || ((complain & tf_user) && !DECL_TEMPLATE_PARM_P (template)
4212 && !PRIMARY_TEMPLATE_P (template)))
4214 if (complain & tf_error)
4216 error ("non-template type `%T' used as a template", d1);
4218 cp_error_at ("for template declaration `%D'", in_decl);
4220 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node);
4223 complain &= ~tf_user;
4225 if (DECL_TEMPLATE_TEMPLATE_PARM_P (template))
4227 /* Create a new TEMPLATE_DECL and TEMPLATE_TEMPLATE_PARM node to store
4228 template arguments */
4233 parmlist = DECL_INNERMOST_TEMPLATE_PARMS (template);
4235 /* Consider an example where a template template parameter declared as
4237 template <class T, class U = std::allocator<T> > class TT
4239 The template parameter level of T and U are one level larger than
4240 of TT. To proper process the default argument of U, say when an
4241 instantiation `TT<int>' is seen, we need to build the full
4242 arguments containing {int} as the innermost level. Outer levels,
4243 available when not appearing as default template argument, can be
4244 obtained from `current_template_args ()'.
4246 Suppose that TT is later substituted with std::vector. The above
4247 instantiation is `TT<int, std::allocator<T> >' with TT at
4248 level 1, and T at level 2, while the template arguments at level 1
4249 becomes {std::vector} and the inner level 2 is {int}. */
4251 if (current_template_parms)
4252 arglist = add_to_template_args (current_template_args (), arglist);
4254 arglist2 = coerce_template_parms (parmlist, arglist, template,
4255 complain, /*require_all_args=*/1);
4256 if (arglist2 == error_mark_node
4257 || (!uses_template_parms (arglist2)
4258 && check_instantiated_args (template, arglist2, complain)))
4259 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node);
4261 parm = bind_template_template_parm (TREE_TYPE (template), arglist2);
4262 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, parm);
4266 tree template_type = TREE_TYPE (template);
4269 tree found = NULL_TREE;
4273 int is_partial_instantiation;
4275 gen_tmpl = most_general_template (template);
4276 parmlist = DECL_TEMPLATE_PARMS (gen_tmpl);
4277 parm_depth = TMPL_PARMS_DEPTH (parmlist);
4278 arg_depth = TMPL_ARGS_DEPTH (arglist);
4280 if (arg_depth == 1 && parm_depth > 1)
4282 /* We've been given an incomplete set of template arguments.
4285 template <class T> struct S1 {
4286 template <class U> struct S2 {};
4287 template <class U> struct S2<U*> {};
4290 we will be called with an ARGLIST of `U*', but the
4291 TEMPLATE will be `template <class T> template
4292 <class U> struct S1<T>::S2'. We must fill in the missing
4295 = add_outermost_template_args (TYPE_TI_ARGS (TREE_TYPE (template)),
4297 arg_depth = TMPL_ARGS_DEPTH (arglist);
4300 /* Now we should have enough arguments. */
4301 my_friendly_assert (parm_depth == arg_depth, 0);
4303 /* From here on, we're only interested in the most general
4305 template = gen_tmpl;
4307 /* Calculate the BOUND_ARGS. These will be the args that are
4308 actually tsubst'd into the definition to create the
4312 /* We have multiple levels of arguments to coerce, at once. */
4314 int saved_depth = TMPL_ARGS_DEPTH (arglist);
4316 tree bound_args = make_tree_vec (parm_depth);
4318 for (i = saved_depth,
4319 t = DECL_TEMPLATE_PARMS (template);
4320 i > 0 && t != NULL_TREE;
4321 --i, t = TREE_CHAIN (t))
4323 tree a = coerce_template_parms (TREE_VALUE (t),
4325 complain, /*require_all_args=*/1);
4327 /* Don't process further if one of the levels fails. */
4328 if (a == error_mark_node)
4330 /* Restore the ARGLIST to its full size. */
4331 TREE_VEC_LENGTH (arglist) = saved_depth;
4332 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node);
4335 SET_TMPL_ARGS_LEVEL (bound_args, i, a);
4337 /* We temporarily reduce the length of the ARGLIST so
4338 that coerce_template_parms will see only the arguments
4339 corresponding to the template parameters it is
4341 TREE_VEC_LENGTH (arglist)--;
4344 /* Restore the ARGLIST to its full size. */
4345 TREE_VEC_LENGTH (arglist) = saved_depth;
4347 arglist = bound_args;
4351 = coerce_template_parms (INNERMOST_TEMPLATE_PARMS (parmlist),
4352 INNERMOST_TEMPLATE_ARGS (arglist),
4354 complain, /*require_all_args=*/1);
4356 if (arglist == error_mark_node)
4357 /* We were unable to bind the arguments. */
4358 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node);
4360 /* In the scope of a template class, explicit references to the
4361 template class refer to the type of the template, not any
4362 instantiation of it. For example, in:
4364 template <class T> class C { void f(C<T>); }
4366 the `C<T>' is just the same as `C'. Outside of the
4367 class, however, such a reference is an instantiation. */
4368 if (comp_template_args (TYPE_TI_ARGS (template_type),
4371 found = template_type;
4373 if (!entering_scope && PRIMARY_TEMPLATE_P (template))
4377 for (ctx = current_class_type;
4378 ctx && TREE_CODE (ctx) != NAMESPACE_DECL;
4380 ? TYPE_CONTEXT (ctx)
4381 : DECL_CONTEXT (ctx)))
4382 if (TYPE_P (ctx) && same_type_p (ctx, template_type))
4385 /* We're not in the scope of the class, so the
4386 TEMPLATE_TYPE is not the type we want after all. */
4392 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, found);
4394 for (tp = &DECL_TEMPLATE_INSTANTIATIONS (template);
4396 tp = &TREE_CHAIN (*tp))
4397 if (comp_template_args (TREE_PURPOSE (*tp), arglist))
4401 /* Use the move-to-front heuristic to speed up future
4403 *tp = TREE_CHAIN (*tp);
4405 = DECL_TEMPLATE_INSTANTIATIONS (template);
4406 DECL_TEMPLATE_INSTANTIATIONS (template) = found;
4408 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, TREE_VALUE (found));
4411 /* This type is a "partial instantiation" if any of the template
4412 arguments still involve template parameters. Note that we set
4413 IS_PARTIAL_INSTANTIATION for partial specializations as
4415 is_partial_instantiation = uses_template_parms (arglist);
4417 /* If the deduced arguments are invalid, then the binding
4419 if (!is_partial_instantiation
4420 && check_instantiated_args (template,
4421 INNERMOST_TEMPLATE_ARGS (arglist),
4423 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node);
4425 if (!is_partial_instantiation
4426 && !PRIMARY_TEMPLATE_P (template)
4427 && TREE_CODE (CP_DECL_CONTEXT (template)) == NAMESPACE_DECL)
4429 found = xref_tag_from_type (TREE_TYPE (template),
4430 DECL_NAME (template),
4432 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, found);
4435 context = tsubst (DECL_CONTEXT (template), arglist,
4438 context = global_namespace;
4440 /* Create the type. */
4441 if (TREE_CODE (template_type) == ENUMERAL_TYPE)
4443 if (!is_partial_instantiation)
4445 set_current_access_from_decl (TYPE_NAME (template_type));
4446 t = start_enum (TYPE_IDENTIFIER (template_type));
4449 /* We don't want to call start_enum for this type, since
4450 the values for the enumeration constants may involve
4451 template parameters. And, no one should be interested
4452 in the enumeration constants for such a type. */
4453 t = make_node (ENUMERAL_TYPE);
4457 t = make_aggr_type (TREE_CODE (template_type));
4458 CLASSTYPE_DECLARED_CLASS (t)
4459 = CLASSTYPE_DECLARED_CLASS (template_type);
4460 SET_CLASSTYPE_IMPLICIT_INSTANTIATION (t);
4461 TYPE_FOR_JAVA (t) = TYPE_FOR_JAVA (template_type);
4463 /* A local class. Make sure the decl gets registered properly. */
4464 if (context == current_function_decl)
4465 pushtag (DECL_NAME (template), t, 0);
4468 /* If we called start_enum or pushtag above, this information
4469 will already be set up. */
4472 TYPE_CONTEXT (t) = FROB_CONTEXT (context);
4474 type_decl = create_implicit_typedef (DECL_NAME (template), t);
4475 DECL_CONTEXT (type_decl) = TYPE_CONTEXT (t);
4476 TYPE_STUB_DECL (t) = type_decl;
4477 DECL_SOURCE_LOCATION (type_decl)
4478 = DECL_SOURCE_LOCATION (TYPE_STUB_DECL (template_type));
4481 type_decl = TYPE_NAME (t);
4483 TREE_PRIVATE (type_decl)
4484 = TREE_PRIVATE (TYPE_STUB_DECL (template_type));
4485 TREE_PROTECTED (type_decl)
4486 = TREE_PROTECTED (TYPE_STUB_DECL (template_type));
4488 /* Set up the template information. We have to figure out which
4489 template is the immediate parent if this is a full
4491 if (parm_depth == 1 || is_partial_instantiation
4492 || !PRIMARY_TEMPLATE_P (template))
4493 /* This case is easy; there are no member templates involved. */
4497 /* This is a full instantiation of a member template. Look
4498 for a partial instantiation of which this is an instance. */
4500 for (found = DECL_TEMPLATE_INSTANTIATIONS (template);
4501 found; found = TREE_CHAIN (found))
4504 tree tmpl = CLASSTYPE_TI_TEMPLATE (TREE_VALUE (found));
4506 /* We only want partial instantiations, here, not
4507 specializations or full instantiations. */
4508 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_VALUE (found))
4509 || !uses_template_parms (TREE_VALUE (found)))
4512 /* Temporarily reduce by one the number of levels in the
4513 ARGLIST and in FOUND so as to avoid comparing the
4514 last set of arguments. */
4515 TREE_VEC_LENGTH (arglist)--;
4516 TREE_VEC_LENGTH (TREE_PURPOSE (found)) --;
4518 /* See if the arguments match. If they do, then TMPL is
4519 the partial instantiation we want. */
4520 success = comp_template_args (TREE_PURPOSE (found), arglist);
4522 /* Restore the argument vectors to their full size. */
4523 TREE_VEC_LENGTH (arglist)++;
4524 TREE_VEC_LENGTH (TREE_PURPOSE (found))++;
4535 /* There was no partial instantiation. This happens
4536 where C<T> is a member template of A<T> and it's used
4539 template <typename T> struct B { A<T>::C<int> m; };
4542 Create the partial instantiation.
4544 TREE_VEC_LENGTH (arglist)--;
4545 found = tsubst (template, arglist, complain, NULL_TREE);
4546 TREE_VEC_LENGTH (arglist)++;
4550 SET_TYPE_TEMPLATE_INFO (t, tree_cons (found, arglist, NULL_TREE));
4551 DECL_TEMPLATE_INSTANTIATIONS (template)
4552 = tree_cons (arglist, t,
4553 DECL_TEMPLATE_INSTANTIATIONS (template));
4555 if (TREE_CODE (t) == ENUMERAL_TYPE
4556 && !is_partial_instantiation)
4557 /* Now that the type has been registered on the instantiations
4558 list, we set up the enumerators. Because the enumeration
4559 constants may involve the enumeration type itself, we make
4560 sure to register the type first, and then create the
4561 constants. That way, doing tsubst_expr for the enumeration
4562 constants won't result in recursive calls here; we'll find
4563 the instantiation and exit above. */
4564 tsubst_enum (template_type, t, arglist);
4566 /* Reset the name of the type, now that CLASSTYPE_TEMPLATE_INFO
4568 if (TREE_CODE (t) != ENUMERAL_TYPE)
4569 DECL_NAME (type_decl) = classtype_mangled_name (t);
4570 if (is_partial_instantiation)
4571 /* If the type makes use of template parameters, the
4572 code that generates debugging information will crash. */
4573 DECL_IGNORED_P (TYPE_STUB_DECL (t)) = 1;
4575 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, t);
4577 timevar_pop (TV_NAME_LOOKUP);
4587 /* Called from for_each_template_parm via walk_tree. */
4590 for_each_template_parm_r (tree *tp, int *walk_subtrees, void *d)
4593 struct pair_fn_data *pfd = (struct pair_fn_data *) d;
4594 tree_fn_t fn = pfd->fn;
4595 void *data = pfd->data;
4598 && for_each_template_parm (TYPE_CONTEXT (t), fn, data, pfd->visited))
4599 return error_mark_node;
4601 switch (TREE_CODE (t))
4604 if (TYPE_PTRMEMFUNC_P (t))
4610 if (!TYPE_TEMPLATE_INFO (t))
4612 else if (for_each_template_parm (TREE_VALUE (TYPE_TEMPLATE_INFO (t)),
4613 fn, data, pfd->visited))
4614 return error_mark_node;
4618 /* Since we're not going to walk subtrees, we have to do this
4620 if (for_each_template_parm (TYPE_METHOD_BASETYPE (t), fn, data,
4622 return error_mark_node;
4626 /* Check the return type. */
4627 if (for_each_template_parm (TREE_TYPE (t), fn, data, pfd->visited))
4628 return error_mark_node;
4630 /* Check the parameter types. Since default arguments are not
4631 instantiated until they are needed, the TYPE_ARG_TYPES may
4632 contain expressions that involve template parameters. But,
4633 no-one should be looking at them yet. And, once they're
4634 instantiated, they don't contain template parameters, so
4635 there's no point in looking at them then, either. */
4639 for (parm = TYPE_ARG_TYPES (t); parm; parm = TREE_CHAIN (parm))
4640 if (for_each_template_parm (TREE_VALUE (parm), fn, data,
4642 return error_mark_node;
4644 /* Since we've already handled the TYPE_ARG_TYPES, we don't
4645 want walk_tree walking into them itself. */
4651 if (for_each_template_parm (TYPE_FIELDS (t), fn, data,
4653 return error_mark_node;
4658 if (DECL_LANG_SPECIFIC (t) && DECL_TEMPLATE_INFO (t)
4659 && for_each_template_parm (DECL_TI_ARGS (t), fn, data,
4661 return error_mark_node;
4666 if (TREE_CODE (t) == CONST_DECL && DECL_TEMPLATE_PARM_P (t)
4667 && for_each_template_parm (DECL_INITIAL (t), fn, data,
4669 return error_mark_node;
4670 if (DECL_CONTEXT (t)
4671 && for_each_template_parm (DECL_CONTEXT (t), fn, data,
4673 return error_mark_node;
4676 case BOUND_TEMPLATE_TEMPLATE_PARM:
4677 /* Record template parameters such as `T' inside `TT<T>'. */
4678 if (for_each_template_parm (TYPE_TI_ARGS (t), fn, data, pfd->visited))
4679 return error_mark_node;
4682 case TEMPLATE_TEMPLATE_PARM:
4683 case TEMPLATE_TYPE_PARM:
4684 case TEMPLATE_PARM_INDEX:
4685 if (fn && (*fn)(t, data))
4686 return error_mark_node;
4688 return error_mark_node;
4692 /* A template template parameter is encountered. */
4693 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t)
4694 && for_each_template_parm (TREE_TYPE (t), fn, data, pfd->visited))
4695 return error_mark_node;
4697 /* Already substituted template template parameter */
4703 || for_each_template_parm (TYPENAME_TYPE_FULLNAME (t), fn,
4704 data, pfd->visited))
4705 return error_mark_node;
4709 if (TREE_TYPE (t) && TYPE_PTRMEMFUNC_P (TREE_TYPE (t))
4710 && for_each_template_parm (TYPE_PTRMEMFUNC_FN_TYPE
4711 (TREE_TYPE (t)), fn, data,
4713 return error_mark_node;
4718 /* If there's no type, then this thing must be some expression
4719 involving template parameters. */
4720 if (!fn && !TREE_TYPE (t))
4721 return error_mark_node;
4726 case REINTERPRET_CAST_EXPR:
4727 case CONST_CAST_EXPR:
4728 case STATIC_CAST_EXPR:
4729 case DYNAMIC_CAST_EXPR:
4733 case PSEUDO_DTOR_EXPR:
4735 return error_mark_node;
4739 /* If we do not handle this case specially, we end up walking
4740 the BINFO hierarchy, which is circular, and therefore
4741 confuses walk_tree. */
4743 if (for_each_template_parm (BASELINK_FUNCTIONS (*tp), fn, data,
4745 return error_mark_node;
4752 /* We didn't find any template parameters we liked. */
4756 /* For each TEMPLATE_TYPE_PARM, TEMPLATE_TEMPLATE_PARM,
4757 BOUND_TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX in T,
4758 call FN with the parameter and the DATA.
4759 If FN returns nonzero, the iteration is terminated, and
4760 for_each_template_parm returns 1. Otherwise, the iteration
4761 continues. If FN never returns a nonzero value, the value
4762 returned by for_each_template_parm is 0. If FN is NULL, it is
4763 considered to be the function which always returns 1. */
4766 for_each_template_parm (tree t, tree_fn_t fn, void* data, htab_t visited)
4768 struct pair_fn_data pfd;
4775 /* Walk the tree. (Conceptually, we would like to walk without
4776 duplicates, but for_each_template_parm_r recursively calls
4777 for_each_template_parm, so we would need to reorganize a fair
4778 bit to use walk_tree_without_duplicates, so we keep our own
4781 pfd.visited = visited;
4783 pfd.visited = htab_create (37, htab_hash_pointer, htab_eq_pointer,
4785 result = walk_tree (&t,
4786 for_each_template_parm_r,
4788 pfd.visited) != NULL_TREE;
4792 htab_delete (pfd.visited);
4797 /* Returns true if T depends on any template parameter. */
4800 uses_template_parms (tree t)
4803 int saved_processing_template_decl;
4805 saved_processing_template_decl = processing_template_decl;
4806 if (!saved_processing_template_decl)
4807 processing_template_decl = 1;
4809 dependent_p = dependent_type_p (t);
4810 else if (TREE_CODE (t) == TREE_VEC)
4811 dependent_p = any_dependent_template_arguments_p (t);
4812 else if (TREE_CODE (t) == TREE_LIST)
4813 dependent_p = (uses_template_parms (TREE_VALUE (t))
4814 || uses_template_parms (TREE_CHAIN (t)));
4817 || TREE_CODE (t) == TEMPLATE_PARM_INDEX
4818 || TREE_CODE (t) == OVERLOAD
4819 || TREE_CODE (t) == BASELINK
4820 || TREE_CODE_CLASS (TREE_CODE (t)) == 'c')
4821 dependent_p = (type_dependent_expression_p (t)
4822 || value_dependent_expression_p (t));
4823 else if (t == error_mark_node)
4824 dependent_p = false;
4827 processing_template_decl = saved_processing_template_decl;
4832 /* Returns true if T depends on any template parameter with level LEVEL. */
4835 uses_template_parms_level (tree t, int level)
4837 return for_each_template_parm (t, template_parm_this_level_p, &level, NULL);
4840 static int tinst_depth;
4841 extern int max_tinst_depth;
4842 #ifdef GATHER_STATISTICS
4845 static int tinst_level_tick;
4846 static int last_template_error_tick;
4848 /* We're starting to instantiate D; record the template instantiation context
4849 for diagnostics and to restore it later. */
4852 push_tinst_level (tree d)
4856 if (tinst_depth >= max_tinst_depth)
4858 /* If the instantiation in question still has unbound template parms,
4859 we don't really care if we can't instantiate it, so just return.
4860 This happens with base instantiation for implicit `typename'. */
4861 if (uses_template_parms (d))
4864 last_template_error_tick = tinst_level_tick;
4865 error ("template instantiation depth exceeds maximum of %d (use -ftemplate-depth-NN to increase the maximum) instantiating `%D'",
4866 max_tinst_depth, d);
4868 print_instantiation_context ();
4873 new = make_node (TINST_LEVEL);
4874 SET_EXPR_LOCATION (new, input_location);
4875 TINST_DECL (new) = d;
4876 TREE_CHAIN (new) = current_tinst_level;
4877 current_tinst_level = new;
4880 #ifdef GATHER_STATISTICS
4881 if (tinst_depth > depth_reached)
4882 depth_reached = tinst_depth;
4889 /* We're done instantiating this template; return to the instantiation
4893 pop_tinst_level (void)
4895 tree old = current_tinst_level;
4897 /* Restore the filename and line number stashed away when we started
4898 this instantiation. */
4899 input_location = EXPR_LOCATION (old);
4900 extract_interface_info ();
4902 current_tinst_level = TREE_CHAIN (old);
4907 /* We're instantiating a deferred template; restore the template
4908 instantiation context in which the instantiation was requested, which
4909 is one step out from LEVEL. */
4912 reopen_tinst_level (tree level)
4917 for (t = level; t; t = TREE_CHAIN (t))
4920 current_tinst_level = level;
4924 /* Return the outermost template instantiation context, for use with
4925 -falt-external-templates. */
4928 tinst_for_decl (void)
4930 tree p = current_tinst_level;
4933 for (; TREE_CHAIN (p) ; p = TREE_CHAIN (p))
4938 /* DECL is a friend FUNCTION_DECL or TEMPLATE_DECL. ARGS is the
4939 vector of template arguments, as for tsubst.
4941 Returns an appropriate tsubst'd friend declaration. */
4944 tsubst_friend_function (tree decl, tree args)
4947 location_t saved_loc = input_location;
4949 input_location = DECL_SOURCE_LOCATION (decl);
4951 if (TREE_CODE (decl) == FUNCTION_DECL
4952 && DECL_TEMPLATE_INSTANTIATION (decl)
4953 && TREE_CODE (DECL_TI_TEMPLATE (decl)) != TEMPLATE_DECL)
4954 /* This was a friend declared with an explicit template
4955 argument list, e.g.:
4959 to indicate that f was a template instantiation, not a new
4960 function declaration. Now, we have to figure out what
4961 instantiation of what template. */
4963 tree template_id, arglist, fns;
4966 tree ns = decl_namespace_context (TYPE_MAIN_DECL (current_class_type));
4968 /* Friend functions are looked up in the containing namespace scope.
4969 We must enter that scope, to avoid finding member functions of the
4970 current cless with same name. */
4971 push_nested_namespace (ns);
4972 fns = tsubst_expr (DECL_TI_TEMPLATE (decl), args,
4973 tf_error | tf_warning, NULL_TREE);
4974 pop_nested_namespace (ns);
4975 arglist = tsubst (DECL_TI_ARGS (decl), args,
4976 tf_error | tf_warning, NULL_TREE);
4977 template_id = lookup_template_function (fns, arglist);
4979 new_friend = tsubst (decl, args, tf_error | tf_warning, NULL_TREE);
4980 tmpl = determine_specialization (template_id, new_friend,
4982 /*need_member_template=*/0);
4983 new_friend = instantiate_template (tmpl, new_args, tf_error);
4987 new_friend = tsubst (decl, args, tf_error | tf_warning, NULL_TREE);
4989 /* The NEW_FRIEND will look like an instantiation, to the
4990 compiler, but is not an instantiation from the point of view of
4991 the language. For example, we might have had:
4993 template <class T> struct S {
4994 template <class U> friend void f(T, U);
4997 Then, in S<int>, template <class U> void f(int, U) is not an
4998 instantiation of anything. */
4999 if (new_friend == error_mark_node)
5000 return error_mark_node;
5002 DECL_USE_TEMPLATE (new_friend) = 0;
5003 if (TREE_CODE (decl) == TEMPLATE_DECL)
5005 DECL_USE_TEMPLATE (DECL_TEMPLATE_RESULT (new_friend)) = 0;
5006 DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (new_friend))
5007 = DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (decl));
5010 /* The mangled name for the NEW_FRIEND is incorrect. The function
5011 is not a template instantiation and should not be mangled like
5012 one. Therefore, we forget the mangling here; we'll recompute it
5013 later if we need it. */
5014 if (TREE_CODE (new_friend) != TEMPLATE_DECL)
5016 SET_DECL_RTL (new_friend, NULL_RTX);
5017 SET_DECL_ASSEMBLER_NAME (new_friend, NULL_TREE);
5020 if (DECL_NAMESPACE_SCOPE_P (new_friend))
5023 tree new_friend_template_info;
5024 tree new_friend_result_template_info;
5026 int new_friend_is_defn;
5028 /* We must save some information from NEW_FRIEND before calling
5029 duplicate decls since that function will free NEW_FRIEND if
5031 new_friend_template_info = DECL_TEMPLATE_INFO (new_friend);
5032 new_friend_is_defn =
5033 (DECL_INITIAL (DECL_TEMPLATE_RESULT
5034 (template_for_substitution (new_friend)))
5036 if (TREE_CODE (new_friend) == TEMPLATE_DECL)
5038 /* This declaration is a `primary' template. */
5039 DECL_PRIMARY_TEMPLATE (new_friend) = new_friend;
5041 new_friend_result_template_info
5042 = DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (new_friend));
5045 new_friend_result_template_info = NULL_TREE;
5047 /* Inside pushdecl_namespace_level, we will push into the
5048 current namespace. However, the friend function should go
5049 into the namespace of the template. */
5050 ns = decl_namespace_context (new_friend);
5051 push_nested_namespace (ns);
5052 old_decl = pushdecl_namespace_level (new_friend);
5053 pop_nested_namespace (ns);
5055 if (old_decl != new_friend)
5057 /* This new friend declaration matched an existing
5058 declaration. For example, given:
5060 template <class T> void f(T);
5061 template <class U> class C {
5062 template <class T> friend void f(T) {}
5065 the friend declaration actually provides the definition
5066 of `f', once C has been instantiated for some type. So,
5067 old_decl will be the out-of-class template declaration,
5068 while new_friend is the in-class definition.
5070 But, if `f' was called before this point, the
5071 instantiation of `f' will have DECL_TI_ARGS corresponding
5072 to `T' but not to `U', references to which might appear
5073 in the definition of `f'. Previously, the most general
5074 template for an instantiation of `f' was the out-of-class
5075 version; now it is the in-class version. Therefore, we
5076 run through all specialization of `f', adding to their
5077 DECL_TI_ARGS appropriately. In particular, they need a
5078 new set of outer arguments, corresponding to the
5079 arguments for this class instantiation.
5081 The same situation can arise with something like this:
5084 template <class T> class C {
5088 when `C<int>' is instantiated. Now, `f(int)' is defined
5091 if (!new_friend_is_defn)
5092 /* On the other hand, if the in-class declaration does
5093 *not* provide a definition, then we don't want to alter
5094 existing definitions. We can just leave everything
5099 /* Overwrite whatever template info was there before, if
5100 any, with the new template information pertaining to
5102 DECL_TEMPLATE_INFO (old_decl) = new_friend_template_info;
5104 if (TREE_CODE (old_decl) != TEMPLATE_DECL)
5105 reregister_specialization (new_friend,
5106 most_general_template (old_decl),
5111 tree new_friend_args;
5113 DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (old_decl))
5114 = new_friend_result_template_info;
5116 new_friend_args = TI_ARGS (new_friend_template_info);
5117 for (t = DECL_TEMPLATE_SPECIALIZATIONS (old_decl);
5121 tree spec = TREE_VALUE (t);
5124 = add_outermost_template_args (new_friend_args,
5125 DECL_TI_ARGS (spec));
5128 /* Now, since specializations are always supposed to
5129 hang off of the most general template, we must move
5131 t = most_general_template (old_decl);
5134 DECL_TEMPLATE_SPECIALIZATIONS (t)
5135 = chainon (DECL_TEMPLATE_SPECIALIZATIONS (t),
5136 DECL_TEMPLATE_SPECIALIZATIONS (old_decl));
5137 DECL_TEMPLATE_SPECIALIZATIONS (old_decl) = NULL_TREE;
5142 /* The information from NEW_FRIEND has been merged into OLD_DECL
5143 by duplicate_decls. */
5144 new_friend = old_decl;
5147 else if (COMPLETE_TYPE_P (DECL_CONTEXT (new_friend)))
5149 /* Check to see that the declaration is really present, and,
5150 possibly obtain an improved declaration. */
5151 tree fn = check_classfn (DECL_CONTEXT (new_friend),
5152 new_friend, NULL_TREE);
5159 input_location = saved_loc;
5163 /* FRIEND_TMPL is a friend TEMPLATE_DECL. ARGS is the vector of
5164 template arguments, as for tsubst.
5166 Returns an appropriate tsubst'd friend type or error_mark_node on
5170 tsubst_friend_class (tree friend_tmpl, tree args)
5176 context = DECL_CONTEXT (friend_tmpl);
5180 if (TREE_CODE (context) == NAMESPACE_DECL)
5181 push_nested_namespace (context);
5183 push_nested_class (tsubst (context, args, tf_none, NULL_TREE));
5186 /* First, we look for a class template. */
5187 tmpl = lookup_name (DECL_NAME (friend_tmpl), /*prefer_type=*/0);
5189 /* But, if we don't find one, it might be because we're in a
5190 situation like this:
5198 Here, in the scope of (say) S<int>, `S' is bound to a TYPE_DECL
5199 for `S<int>', not the TEMPLATE_DECL. */
5200 if (!tmpl || !DECL_CLASS_TEMPLATE_P (tmpl))
5202 tmpl = lookup_name (DECL_NAME (friend_tmpl), /*prefer_type=*/1);
5203 tmpl = maybe_get_template_decl_from_type_decl (tmpl);
5206 if (tmpl && DECL_CLASS_TEMPLATE_P (tmpl))
5208 /* The friend template has already been declared. Just
5209 check to see that the declarations match, and install any new
5210 default parameters. We must tsubst the default parameters,
5211 of course. We only need the innermost template parameters
5212 because that is all that redeclare_class_template will look
5214 if (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (friend_tmpl))
5215 > TMPL_ARGS_DEPTH (args))
5218 parms = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_tmpl),
5219 args, tf_error | tf_warning);
5220 redeclare_class_template (TREE_TYPE (tmpl), parms);
5223 friend_type = TREE_TYPE (tmpl);
5227 /* The friend template has not already been declared. In this
5228 case, the instantiation of the template class will cause the
5229 injection of this template into the global scope. */
5230 tmpl = tsubst (friend_tmpl, args, tf_error | tf_warning, NULL_TREE);
5232 /* The new TMPL is not an instantiation of anything, so we
5233 forget its origins. We don't reset CLASSTYPE_TI_TEMPLATE for
5234 the new type because that is supposed to be the corresponding
5235 template decl, i.e., TMPL. */
5236 DECL_USE_TEMPLATE (tmpl) = 0;
5237 DECL_TEMPLATE_INFO (tmpl) = NULL_TREE;
5238 CLASSTYPE_USE_TEMPLATE (TREE_TYPE (tmpl)) = 0;
5239 CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl))
5240 = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl)));
5242 /* Inject this template into the global scope. */
5243 friend_type = TREE_TYPE (pushdecl_top_level (tmpl));
5248 if (TREE_CODE (context) == NAMESPACE_DECL)
5249 pop_nested_namespace (context);
5251 pop_nested_class ();
5257 /* Returns zero if TYPE cannot be completed later due to circularity.
5258 Otherwise returns one. */
5261 can_complete_type_without_circularity (tree type)
5263 if (type == NULL_TREE || type == error_mark_node)
5265 else if (COMPLETE_TYPE_P (type))
5267 else if (TREE_CODE (type) == ARRAY_TYPE && TYPE_DOMAIN (type))
5268 return can_complete_type_without_circularity (TREE_TYPE (type));
5269 else if (CLASS_TYPE_P (type)
5270 && TYPE_BEING_DEFINED (TYPE_MAIN_VARIANT (type)))
5277 instantiate_class_template (tree type)
5279 tree template, args, pattern, t, member;
5283 if (type == error_mark_node)
5284 return error_mark_node;
5286 if (TYPE_BEING_DEFINED (type)
5287 || COMPLETE_TYPE_P (type)
5288 || dependent_type_p (type))
5291 /* Figure out which template is being instantiated. */
5292 template = most_general_template (CLASSTYPE_TI_TEMPLATE (type));
5293 my_friendly_assert (TREE_CODE (template) == TEMPLATE_DECL, 279);
5295 /* Figure out which arguments are being used to do the
5297 args = CLASSTYPE_TI_ARGS (type);
5299 /* Determine what specialization of the original template to
5301 t = most_specialized_class (template, args);
5302 if (t == error_mark_node)
5304 const char *str = "candidates are:";
5305 error ("ambiguous class template instantiation for `%#T'", type);
5306 for (t = DECL_TEMPLATE_SPECIALIZATIONS (template); t;
5309 if (get_class_bindings (TREE_VALUE (t), TREE_PURPOSE (t), args))
5311 cp_error_at ("%s %+#T", str, TREE_TYPE (t));
5315 TYPE_BEING_DEFINED (type) = 1;
5316 return error_mark_node;
5320 pattern = TREE_TYPE (t);
5322 pattern = TREE_TYPE (template);
5324 /* If the template we're instantiating is incomplete, then clearly
5325 there's nothing we can do. */
5326 if (!COMPLETE_TYPE_P (pattern))
5329 /* If we've recursively instantiated too many templates, stop. */
5330 if (! push_tinst_level (type))
5333 /* Now we're really doing the instantiation. Mark the type as in
5334 the process of being defined. */
5335 TYPE_BEING_DEFINED (type) = 1;
5337 /* We may be in the middle of deferred access check. Disable
5339 push_deferring_access_checks (dk_no_deferred);
5341 push_to_top_level ();
5345 /* This TYPE is actually an instantiation of a partial
5346 specialization. We replace the innermost set of ARGS with
5347 the arguments appropriate for substitution. For example,
5350 template <class T> struct S {};
5351 template <class T> struct S<T*> {};
5353 and supposing that we are instantiating S<int*>, ARGS will
5354 present be {int*} but we need {int}. */
5356 = get_class_bindings (TREE_VALUE (t), TREE_PURPOSE (t),
5359 /* If there were multiple levels in ARGS, replacing the
5360 innermost level would alter CLASSTYPE_TI_ARGS, which we don't
5361 want, so we make a copy first. */
5362 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args))
5364 args = copy_node (args);
5365 SET_TMPL_ARGS_LEVEL (args, TMPL_ARGS_DEPTH (args), inner_args);
5371 SET_CLASSTYPE_INTERFACE_UNKNOWN (type);
5373 /* Set the input location to the template definition. This is needed
5374 if tsubsting causes an error. */
5375 input_location = DECL_SOURCE_LOCATION (TYPE_NAME (pattern));
5377 TYPE_HAS_CONSTRUCTOR (type) = TYPE_HAS_CONSTRUCTOR (pattern);
5378 TYPE_HAS_DESTRUCTOR (type) = TYPE_HAS_DESTRUCTOR (pattern);
5379 TYPE_HAS_NEW_OPERATOR (type) = TYPE_HAS_NEW_OPERATOR (pattern);
5380 TYPE_HAS_ARRAY_NEW_OPERATOR (type) = TYPE_HAS_ARRAY_NEW_OPERATOR (pattern);
5381 TYPE_GETS_DELETE (type) = TYPE_GETS_DELETE (pattern);
5382 TYPE_HAS_ASSIGN_REF (type) = TYPE_HAS_ASSIGN_REF (pattern);
5383 TYPE_HAS_CONST_ASSIGN_REF (type) = TYPE_HAS_CONST_ASSIGN_REF (pattern);
5384 TYPE_HAS_ABSTRACT_ASSIGN_REF (type) = TYPE_HAS_ABSTRACT_ASSIGN_REF (pattern);
5385 TYPE_HAS_INIT_REF (type) = TYPE_HAS_INIT_REF (pattern);
5386 TYPE_HAS_CONST_INIT_REF (type) = TYPE_HAS_CONST_INIT_REF (pattern);
5387 TYPE_HAS_DEFAULT_CONSTRUCTOR (type) = TYPE_HAS_DEFAULT_CONSTRUCTOR (pattern);
5388 TYPE_HAS_CONVERSION (type) = TYPE_HAS_CONVERSION (pattern);
5389 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (type)
5390 = TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (pattern);
5391 TYPE_USES_MULTIPLE_INHERITANCE (type)
5392 = TYPE_USES_MULTIPLE_INHERITANCE (pattern);
5393 TYPE_USES_VIRTUAL_BASECLASSES (type)
5394 = TYPE_USES_VIRTUAL_BASECLASSES (pattern);
5395 TYPE_PACKED (type) = TYPE_PACKED (pattern);
5396 TYPE_ALIGN (type) = TYPE_ALIGN (pattern);
5397 TYPE_USER_ALIGN (type) = TYPE_USER_ALIGN (pattern);
5398 TYPE_FOR_JAVA (type) = TYPE_FOR_JAVA (pattern); /* For libjava's JArray<T> */
5399 if (ANON_AGGR_TYPE_P (pattern))
5400 SET_ANON_AGGR_TYPE_P (type);
5402 pbinfo = TYPE_BINFO (pattern);
5404 #ifdef ENABLE_CHECKING
5405 if (DECL_CLASS_SCOPE_P (TYPE_MAIN_DECL (pattern))
5406 && ! COMPLETE_TYPE_P (TYPE_CONTEXT (type))
5407 && ! TYPE_BEING_DEFINED (TYPE_CONTEXT (type)))
5408 /* We should never instantiate a nested class before its enclosing
5409 class; we need to look up the nested class by name before we can
5410 instantiate it, and that lookup should instantiate the enclosing
5415 if (BINFO_BASETYPES (pbinfo))
5417 tree base_list = NULL_TREE;
5418 tree pbases = BINFO_BASETYPES (pbinfo);
5419 tree paccesses = BINFO_BASEACCESSES (pbinfo);
5420 tree context = TYPE_CONTEXT (type);
5424 /* We must enter the scope containing the type, as that is where
5425 the accessibility of types named in dependent bases are
5427 pop_p = push_scope (context ? context : global_namespace);
5429 /* Substitute into each of the bases to determine the actual
5431 for (i = 0; i < TREE_VEC_LENGTH (pbases); ++i)
5437 pbase = TREE_VEC_ELT (pbases, i);
5438 access = TREE_VEC_ELT (paccesses, i);
5440 /* Substitute to figure out the base class. */
5441 base = tsubst (BINFO_TYPE (pbase), args, tf_error, NULL_TREE);
5442 if (base == error_mark_node)
5445 base_list = tree_cons (access, base, base_list);
5446 if (BINFO_VIRTUAL_P (pbase))
5447 TREE_TYPE (base_list) = integer_type_node;
5450 /* The list is now in reverse order; correct that. */
5451 base_list = nreverse (base_list);
5453 /* Now call xref_basetypes to set up all the base-class
5455 xref_basetypes (type, base_list);
5458 pop_scope (context ? context : global_namespace);
5461 /* Now that our base classes are set up, enter the scope of the
5462 class, so that name lookups into base classes, etc. will work
5463 correctly. This is precisely analogous to what we do in
5464 begin_class_definition when defining an ordinary non-template
5468 /* Now members are processed in the order of declaration. */
5469 for (member = CLASSTYPE_DECL_LIST (pattern);
5470 member; member = TREE_CHAIN (member))
5472 tree t = TREE_VALUE (member);
5474 if (TREE_PURPOSE (member))
5478 /* Build new CLASSTYPE_NESTED_UTDS. */
5481 tree name = TYPE_IDENTIFIER (tag);
5484 newtag = tsubst (tag, args, tf_error, NULL_TREE);
5485 if (newtag == error_mark_node)
5488 if (TREE_CODE (newtag) != ENUMERAL_TYPE)
5490 if (TYPE_LANG_SPECIFIC (tag) && CLASSTYPE_IS_TEMPLATE (tag))
5491 /* Unfortunately, lookup_template_class sets
5492 CLASSTYPE_IMPLICIT_INSTANTIATION for a partial
5493 instantiation (i.e., for the type of a member
5494 template class nested within a template class.)
5495 This behavior is required for
5496 maybe_process_partial_specialization to work
5497 correctly, but is not accurate in this case;
5498 the TAG is not an instantiation of anything.
5499 (The corresponding TEMPLATE_DECL is an
5500 instantiation, but the TYPE is not.) */
5501 CLASSTYPE_USE_TEMPLATE (newtag) = 0;
5503 /* Now, we call pushtag to put this NEWTAG into the scope of
5504 TYPE. We first set up the IDENTIFIER_TYPE_VALUE to avoid
5505 pushtag calling push_template_decl. We don't have to do
5506 this for enums because it will already have been done in
5509 SET_IDENTIFIER_TYPE_VALUE (name, newtag);
5510 pushtag (name, newtag, /*globalize=*/0);
5513 else if (TREE_CODE (t) == FUNCTION_DECL
5514 || DECL_FUNCTION_TEMPLATE_P (t))
5516 /* Build new TYPE_METHODS. */
5519 if (TREE_CODE (t) == TEMPLATE_DECL)
5520 ++processing_template_decl;
5521 r = tsubst (t, args, tf_error, NULL_TREE);
5522 if (TREE_CODE (t) == TEMPLATE_DECL)
5523 --processing_template_decl;
5524 set_current_access_from_decl (r);
5525 grok_special_member_properties (r);
5526 finish_member_declaration (r);
5530 /* Build new TYPE_FIELDS. */
5532 if (TREE_CODE (t) != CONST_DECL)
5536 /* The the file and line for this declaration, to
5537 assist in error message reporting. Since we
5538 called push_tinst_level above, we don't need to
5540 input_location = DECL_SOURCE_LOCATION (t);
5542 if (TREE_CODE (t) == TEMPLATE_DECL)
5543 ++processing_template_decl;
5544 r = tsubst (t, args, tf_error | tf_warning, NULL_TREE);
5545 if (TREE_CODE (t) == TEMPLATE_DECL)
5546 --processing_template_decl;
5547 if (TREE_CODE (r) == VAR_DECL)
5551 if (DECL_INITIALIZED_IN_CLASS_P (r))
5552 init = tsubst_expr (DECL_INITIAL (t), args,
5553 tf_error | tf_warning, NULL_TREE);
5557 finish_static_data_member_decl
5558 (r, init, /*asmspec_tree=*/NULL_TREE, /*flags=*/0);
5560 if (DECL_INITIALIZED_IN_CLASS_P (r))
5561 check_static_variable_definition (r, TREE_TYPE (r));
5563 else if (TREE_CODE (r) == FIELD_DECL)
5565 /* Determine whether R has a valid type and can be
5566 completed later. If R is invalid, then it is
5567 replaced by error_mark_node so that it will not be
5568 added to TYPE_FIELDS. */
5569 tree rtype = TREE_TYPE (r);
5570 if (can_complete_type_without_circularity (rtype))
5571 complete_type (rtype);
5573 if (!COMPLETE_TYPE_P (rtype))
5575 cxx_incomplete_type_error (r, rtype);
5576 r = error_mark_node;
5580 /* If it is a TYPE_DECL for a class-scoped ENUMERAL_TYPE,
5581 such a thing will already have been added to the field
5582 list by tsubst_enum in finish_member_declaration in the
5583 CLASSTYPE_NESTED_UTDS case above. */
5584 if (!(TREE_CODE (r) == TYPE_DECL
5585 && TREE_CODE (TREE_TYPE (r)) == ENUMERAL_TYPE
5586 && DECL_ARTIFICIAL (r)))
5588 set_current_access_from_decl (r);
5589 finish_member_declaration (r);
5596 if (TYPE_P (t) || DECL_CLASS_TEMPLATE_P (t))
5598 /* Build new CLASSTYPE_FRIEND_CLASSES. */
5600 tree friend_type = t;
5601 tree new_friend_type;
5603 if (TREE_CODE (friend_type) == TEMPLATE_DECL)
5604 new_friend_type = tsubst_friend_class (friend_type, args);
5605 else if (uses_template_parms (friend_type))
5606 new_friend_type = tsubst (friend_type, args,
5607 tf_error | tf_warning, NULL_TREE);
5608 else if (CLASSTYPE_USE_TEMPLATE (friend_type))
5609 new_friend_type = friend_type;
5612 tree ns = decl_namespace_context (TYPE_MAIN_DECL (friend_type));
5614 /* The call to xref_tag_from_type does injection for friend
5616 push_nested_namespace (ns);
5618 xref_tag_from_type (friend_type, NULL_TREE, 1);
5619 pop_nested_namespace (ns);
5622 if (TREE_CODE (friend_type) == TEMPLATE_DECL)
5623 /* Trick make_friend_class into realizing that the friend
5624 we're adding is a template, not an ordinary class. It's
5625 important that we use make_friend_class since it will
5626 perform some error-checking and output cross-reference
5628 ++processing_template_decl;
5630 if (new_friend_type != error_mark_node)
5631 make_friend_class (type, new_friend_type,
5632 /*complain=*/false);
5634 if (TREE_CODE (friend_type) == TEMPLATE_DECL)
5635 --processing_template_decl;
5639 /* Build new DECL_FRIENDLIST. */
5642 if (TREE_CODE (t) == TEMPLATE_DECL)
5643 ++processing_template_decl;
5644 r = tsubst_friend_function (t, args);
5645 if (TREE_CODE (t) == TEMPLATE_DECL)
5646 --processing_template_decl;
5647 add_friend (type, r, /*complain=*/false);
5652 /* Set the file and line number information to whatever is given for
5653 the class itself. This puts error messages involving generated
5654 implicit functions at a predictable point, and the same point
5655 that would be used for non-template classes. */
5656 typedecl = TYPE_MAIN_DECL (type);
5657 input_location = DECL_SOURCE_LOCATION (typedecl);
5659 unreverse_member_declarations (type);
5660 finish_struct_1 (type);
5662 /* Clear this now so repo_template_used is happy. */
5663 TYPE_BEING_DEFINED (type) = 0;
5664 repo_template_used (type);
5666 /* Now that the class is complete, instantiate default arguments for
5667 any member functions. We don't do this earlier because the
5668 default arguments may reference members of the class. */
5669 if (!PRIMARY_TEMPLATE_P (template))
5670 for (t = TYPE_METHODS (type); t; t = TREE_CHAIN (t))
5671 if (TREE_CODE (t) == FUNCTION_DECL
5672 /* Implicitly generated member functions will not have template
5673 information; they are not instantiations, but instead are
5674 created "fresh" for each instantiation. */
5675 && DECL_TEMPLATE_INFO (t))
5676 tsubst_default_arguments (t);
5679 pop_from_top_level ();
5680 pop_deferring_access_checks ();
5683 if (TYPE_CONTAINS_VPTR_P (type))
5684 keyed_classes = tree_cons (NULL_TREE, type, keyed_classes);
5690 tsubst_template_arg (tree t, tree args, tsubst_flags_t complain, tree in_decl)
5696 else if (TYPE_P (t))
5697 r = tsubst (t, args, complain, in_decl);
5700 r = tsubst_expr (t, args, complain, in_decl);
5702 if (!uses_template_parms (r))
5704 /* Sometimes, one of the args was an expression involving a
5705 template constant parameter, like N - 1. Now that we've
5706 tsubst'd, we might have something like 2 - 1. This will
5707 confuse lookup_template_class, so we do constant folding
5708 here. We have to unset processing_template_decl, to fool
5709 tsubst_copy_and_build() into building an actual tree. */
5711 /* If the TREE_TYPE of ARG is not NULL_TREE, ARG is already
5712 as simple as it's going to get, and trying to reprocess
5713 the trees will break. Once tsubst_expr et al DTRT for
5714 non-dependent exprs, this code can go away, as the type
5715 will always be set. */
5718 int saved_processing_template_decl = processing_template_decl;
5719 processing_template_decl = 0;
5720 r = tsubst_copy_and_build (r, /*args=*/NULL_TREE,
5721 tf_error, /*in_decl=*/NULL_TREE,
5722 /*function_p=*/false);
5723 processing_template_decl = saved_processing_template_decl;
5731 /* Substitute ARGS into the vector or list of template arguments T. */
5734 tsubst_template_args (tree t, tree args, tsubst_flags_t complain, tree in_decl)
5736 int len = TREE_VEC_LENGTH (t);
5737 int need_new = 0, i;
5738 tree *elts = alloca (len * sizeof (tree));
5740 for (i = 0; i < len; i++)
5742 tree orig_arg = TREE_VEC_ELT (t, i);
5745 if (TREE_CODE (orig_arg) == TREE_VEC)
5746 new_arg = tsubst_template_args (orig_arg, args, complain, in_decl);
5748 new_arg = tsubst_template_arg (orig_arg, args, complain, in_decl);
5750 if (new_arg == error_mark_node)
5751 return error_mark_node;
5754 if (new_arg != orig_arg)
5761 t = make_tree_vec (len);
5762 for (i = 0; i < len; i++)
5763 TREE_VEC_ELT (t, i) = elts[i];
5768 /* Return the result of substituting ARGS into the template parameters
5769 given by PARMS. If there are m levels of ARGS and m + n levels of
5770 PARMS, then the result will contain n levels of PARMS. For
5771 example, if PARMS is `template <class T> template <class U>
5772 template <T*, U, class V>' and ARGS is {{int}, {double}} then the
5773 result will be `template <int*, double, class V>'. */
5776 tsubst_template_parms (tree parms, tree args, tsubst_flags_t complain)
5781 for (new_parms = &r;
5782 TMPL_PARMS_DEPTH (parms) > TMPL_ARGS_DEPTH (args);
5783 new_parms = &(TREE_CHAIN (*new_parms)),
5784 parms = TREE_CHAIN (parms))
5787 make_tree_vec (TREE_VEC_LENGTH (TREE_VALUE (parms)));
5790 for (i = 0; i < TREE_VEC_LENGTH (new_vec); ++i)
5792 tree tuple = TREE_VEC_ELT (TREE_VALUE (parms), i);
5793 tree default_value = TREE_PURPOSE (tuple);
5794 tree parm_decl = TREE_VALUE (tuple);
5796 parm_decl = tsubst (parm_decl, args, complain, NULL_TREE);
5797 default_value = tsubst_template_arg (default_value, args,
5798 complain, NULL_TREE);
5800 tuple = build_tree_list (default_value, parm_decl);
5801 TREE_VEC_ELT (new_vec, i) = tuple;
5805 tree_cons (size_int (TMPL_PARMS_DEPTH (parms)
5806 - TMPL_ARGS_DEPTH (args)),
5807 new_vec, NULL_TREE);
5813 /* Substitute the ARGS into the indicated aggregate (or enumeration)
5814 type T. If T is not an aggregate or enumeration type, it is
5815 handled as if by tsubst. IN_DECL is as for tsubst. If
5816 ENTERING_SCOPE is nonzero, T is the context for a template which
5817 we are presently tsubst'ing. Return the substituted value. */
5820 tsubst_aggr_type (tree t,
5822 tsubst_flags_t complain,
5829 switch (TREE_CODE (t))
5832 if (TYPE_PTRMEMFUNC_P (t))
5833 return tsubst (TYPE_PTRMEMFUNC_FN_TYPE (t), args, complain, in_decl);
5835 /* Else fall through. */
5838 if (TYPE_TEMPLATE_INFO (t))
5844 /* First, determine the context for the type we are looking
5846 context = TYPE_CONTEXT (t);
5848 context = tsubst_aggr_type (context, args, complain,
5849 in_decl, /*entering_scope=*/1);
5851 /* Then, figure out what arguments are appropriate for the
5852 type we are trying to find. For example, given:
5854 template <class T> struct S;
5855 template <class T, class U> void f(T, U) { S<U> su; }
5857 and supposing that we are instantiating f<int, double>,
5858 then our ARGS will be {int, double}, but, when looking up
5859 S we only want {double}. */
5860 argvec = tsubst_template_args (TYPE_TI_ARGS (t), args,
5862 if (argvec == error_mark_node)
5863 return error_mark_node;
5865 r = lookup_template_class (t, argvec, in_decl, context,
5866 entering_scope, complain);
5868 return cp_build_qualified_type_real (r, TYPE_QUALS (t), complain);
5871 /* This is not a template type, so there's nothing to do. */
5875 return tsubst (t, args, complain, in_decl);
5879 /* Substitute into the default argument ARG (a default argument for
5880 FN), which has the indicated TYPE. */
5883 tsubst_default_argument (tree fn, tree type, tree arg)
5885 /* This default argument came from a template. Instantiate the
5886 default argument here, not in tsubst. In the case of
5895 we must be careful to do name lookup in the scope of S<T>,
5896 rather than in the current class. */
5897 push_access_scope (fn);
5898 /* The default argument expression should not be considered to be
5899 within the scope of FN. Since push_access_scope sets
5900 current_function_decl, we must explicitly clear it here. */
5901 current_function_decl = NULL_TREE;
5903 push_deferring_access_checks(dk_no_deferred);
5904 arg = tsubst_expr (arg, DECL_TI_ARGS (fn),
5905 tf_error | tf_warning, NULL_TREE);
5906 pop_deferring_access_checks();
5908 pop_access_scope (fn);
5910 /* Make sure the default argument is reasonable. */
5911 arg = check_default_argument (type, arg);
5916 /* Substitute into all the default arguments for FN. */
5919 tsubst_default_arguments (tree fn)
5924 tmpl_args = DECL_TI_ARGS (fn);
5926 /* If this function is not yet instantiated, we certainly don't need
5927 its default arguments. */
5928 if (uses_template_parms (tmpl_args))
5931 for (arg = TYPE_ARG_TYPES (TREE_TYPE (fn));
5933 arg = TREE_CHAIN (arg))
5934 if (TREE_PURPOSE (arg))
5935 TREE_PURPOSE (arg) = tsubst_default_argument (fn,
5937 TREE_PURPOSE (arg));
5940 /* Substitute the ARGS into the T, which is a _DECL. TYPE is the
5941 (already computed) substitution of ARGS into TREE_TYPE (T), if
5942 appropriate. Return the result of the substitution. Issue error
5943 and warning messages under control of COMPLAIN. */
5946 tsubst_decl (tree t, tree args, tree type, tsubst_flags_t complain)
5948 location_t saved_loc;
5952 /* Set the filename and linenumber to improve error-reporting. */
5953 saved_loc = input_location;
5954 input_location = DECL_SOURCE_LOCATION (t);
5956 switch (TREE_CODE (t))
5960 /* We can get here when processing a member template function
5961 of a template class. */
5962 tree decl = DECL_TEMPLATE_RESULT (t);
5964 int is_template_template_parm = DECL_TEMPLATE_TEMPLATE_PARM_P (t);
5966 if (!is_template_template_parm)
5968 /* We might already have an instance of this template.
5969 The ARGS are for the surrounding class type, so the
5970 full args contain the tsubst'd args for the context,
5971 plus the innermost args from the template decl. */
5972 tree tmpl_args = DECL_CLASS_TEMPLATE_P (t)
5973 ? CLASSTYPE_TI_ARGS (TREE_TYPE (t))
5974 : DECL_TI_ARGS (DECL_TEMPLATE_RESULT (t));
5977 full_args = tsubst_template_args (tmpl_args, args,
5980 /* tsubst_template_args doesn't copy the vector if
5981 nothing changed. But, *something* should have
5983 my_friendly_assert (full_args != tmpl_args, 0);
5985 spec = retrieve_specialization (t, full_args);
5986 if (spec != NULL_TREE)
5993 /* Make a new template decl. It will be similar to the
5994 original, but will record the current template arguments.
5995 We also create a new function declaration, which is just
5996 like the old one, but points to this new template, rather
5997 than the old one. */
5999 my_friendly_assert (DECL_LANG_SPECIFIC (r) != 0, 0);
6000 TREE_CHAIN (r) = NULL_TREE;
6002 if (is_template_template_parm)
6004 tree new_decl = tsubst (decl, args, complain, in_decl);
6005 DECL_TEMPLATE_RESULT (r) = new_decl;
6006 TREE_TYPE (r) = TREE_TYPE (new_decl);
6011 = tsubst_aggr_type (DECL_CONTEXT (t), args,
6013 /*entering_scope=*/1);
6014 DECL_TEMPLATE_INFO (r) = build_tree_list (t, args);
6016 if (TREE_CODE (decl) == TYPE_DECL)
6018 tree new_type = tsubst (TREE_TYPE (t), args, complain, in_decl);
6019 if (new_type == error_mark_node)
6020 return error_mark_node;
6022 TREE_TYPE (r) = new_type;
6023 CLASSTYPE_TI_TEMPLATE (new_type) = r;
6024 DECL_TEMPLATE_RESULT (r) = TYPE_MAIN_DECL (new_type);
6025 DECL_TI_ARGS (r) = CLASSTYPE_TI_ARGS (new_type);
6029 tree new_decl = tsubst (decl, args, complain, in_decl);
6030 if (new_decl == error_mark_node)
6031 return error_mark_node;
6033 DECL_TEMPLATE_RESULT (r) = new_decl;
6034 DECL_TI_TEMPLATE (new_decl) = r;
6035 TREE_TYPE (r) = TREE_TYPE (new_decl);
6036 DECL_TI_ARGS (r) = DECL_TI_ARGS (new_decl);
6039 SET_DECL_IMPLICIT_INSTANTIATION (r);
6040 DECL_TEMPLATE_INSTANTIATIONS (r) = NULL_TREE;
6041 DECL_TEMPLATE_SPECIALIZATIONS (r) = NULL_TREE;
6043 /* The template parameters for this new template are all the
6044 template parameters for the old template, except the
6045 outermost level of parameters. */
6046 DECL_TEMPLATE_PARMS (r)
6047 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t), args,
6050 if (PRIMARY_TEMPLATE_P (t))
6051 DECL_PRIMARY_TEMPLATE (r) = r;
6053 if (TREE_CODE (decl) != TYPE_DECL)
6054 /* Record this non-type partial instantiation. */
6055 register_specialization (r, t,
6056 DECL_TI_ARGS (DECL_TEMPLATE_RESULT (r)));
6063 tree argvec = NULL_TREE;
6070 /* Nobody should be tsubst'ing into non-template functions. */
6071 my_friendly_assert (DECL_TEMPLATE_INFO (t) != NULL_TREE, 0);
6073 if (TREE_CODE (DECL_TI_TEMPLATE (t)) == TEMPLATE_DECL)
6078 /* If T is not dependent, just return it. We have to
6079 increment PROCESSING_TEMPLATE_DECL because
6080 value_dependent_expression_p assumes that nothing is
6081 dependent when PROCESSING_TEMPLATE_DECL is zero. */
6082 ++processing_template_decl;
6083 dependent_p = value_dependent_expression_p (t);
6084 --processing_template_decl;
6088 /* Calculate the most general template of which R is a
6089 specialization, and the complete set of arguments used to
6091 gen_tmpl = most_general_template (DECL_TI_TEMPLATE (t));
6092 argvec = tsubst_template_args (DECL_TI_ARGS
6093 (DECL_TEMPLATE_RESULT (gen_tmpl)),
6094 args, complain, in_decl);
6096 /* Check to see if we already have this specialization. */
6097 spec = retrieve_specialization (gen_tmpl, argvec);
6105 /* We can see more levels of arguments than parameters if
6106 there was a specialization of a member template, like
6109 template <class T> struct S { template <class U> void f(); }
6110 template <> template <class U> void S<int>::f(U);
6112 Here, we'll be substituting into the specialization,
6113 because that's where we can find the code we actually
6114 want to generate, but we'll have enough arguments for
6115 the most general template.
6117 We also deal with the peculiar case:
6119 template <class T> struct S {
6120 template <class U> friend void f();
6122 template <class U> void f() {}
6124 template void f<double>();
6126 Here, the ARGS for the instantiation of will be {int,
6127 double}. But, we only need as many ARGS as there are
6128 levels of template parameters in CODE_PATTERN. We are
6129 careful not to get fooled into reducing the ARGS in
6132 template <class T> struct S { template <class U> void f(U); }
6133 template <class T> template <> void S<T>::f(int) {}
6135 which we can spot because the pattern will be a
6136 specialization in this case. */
6137 args_depth = TMPL_ARGS_DEPTH (args);
6139 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (t)));
6140 if (args_depth > parms_depth
6141 && !DECL_TEMPLATE_SPECIALIZATION (t))
6142 args = get_innermost_template_args (args, parms_depth);
6146 /* This special case arises when we have something like this:
6148 template <class T> struct S {
6149 friend void f<int>(int, double);
6152 Here, the DECL_TI_TEMPLATE for the friend declaration
6153 will be an IDENTIFIER_NODE. We are being called from
6154 tsubst_friend_function, and we want only to create a
6155 new decl (R) with appropriate types so that we can call
6156 determine_specialization. */
6157 gen_tmpl = NULL_TREE;
6160 if (DECL_CLASS_SCOPE_P (t))
6162 if (DECL_NAME (t) == constructor_name (DECL_CONTEXT (t)))
6166 ctx = tsubst_aggr_type (DECL_CONTEXT (t), args,
6167 complain, t, /*entering_scope=*/1);
6172 ctx = DECL_CONTEXT (t);
6174 type = tsubst (type, args, complain, in_decl);
6175 if (type == error_mark_node)
6176 return error_mark_node;
6178 /* We do NOT check for matching decls pushed separately at this
6179 point, as they may not represent instantiations of this
6180 template, and in any case are considered separate under the
6183 DECL_USE_TEMPLATE (r) = 0;
6184 TREE_TYPE (r) = type;
6185 /* Clear out the mangled name and RTL for the instantiation. */
6186 SET_DECL_ASSEMBLER_NAME (r, NULL_TREE);
6187 SET_DECL_RTL (r, NULL_RTX);
6188 DECL_INITIAL (r) = NULL_TREE;
6189 DECL_CONTEXT (r) = ctx;
6191 if (member && DECL_CONV_FN_P (r))
6192 /* Type-conversion operator. Reconstruct the name, in
6193 case it's the name of one of the template's parameters. */
6194 DECL_NAME (r) = mangle_conv_op_name_for_type (TREE_TYPE (type));
6196 DECL_ARGUMENTS (r) = tsubst (DECL_ARGUMENTS (t), args,
6198 DECL_RESULT (r) = NULL_TREE;
6200 TREE_STATIC (r) = 0;
6201 TREE_PUBLIC (r) = TREE_PUBLIC (t);
6202 DECL_EXTERNAL (r) = 1;
6203 DECL_INTERFACE_KNOWN (r) = 0;
6204 DECL_DEFER_OUTPUT (r) = 0;
6205 TREE_CHAIN (r) = NULL_TREE;
6206 DECL_PENDING_INLINE_INFO (r) = 0;
6207 DECL_PENDING_INLINE_P (r) = 0;
6208 DECL_SAVED_TREE (r) = NULL_TREE;
6210 if (DECL_CLONED_FUNCTION (r))
6212 DECL_CLONED_FUNCTION (r) = tsubst (DECL_CLONED_FUNCTION (t),
6214 TREE_CHAIN (r) = TREE_CHAIN (DECL_CLONED_FUNCTION (r));
6215 TREE_CHAIN (DECL_CLONED_FUNCTION (r)) = r;
6218 /* Set up the DECL_TEMPLATE_INFO for R. There's no need to do
6219 this in the special friend case mentioned above where
6220 GEN_TMPL is NULL. */
6223 DECL_TEMPLATE_INFO (r)
6224 = tree_cons (gen_tmpl, argvec, NULL_TREE);
6225 SET_DECL_IMPLICIT_INSTANTIATION (r);
6226 register_specialization (r, gen_tmpl, argvec);
6228 /* We're not supposed to instantiate default arguments
6229 until they are called, for a template. But, for a
6232 template <class T> void f ()
6233 { extern void g(int i = T()); }
6235 we should do the substitution when the template is
6236 instantiated. We handle the member function case in
6237 instantiate_class_template since the default arguments
6238 might refer to other members of the class. */
6240 && !PRIMARY_TEMPLATE_P (gen_tmpl)
6241 && !uses_template_parms (argvec))
6242 tsubst_default_arguments (r);
6245 /* Copy the list of befriending classes. */
6246 for (friends = &DECL_BEFRIENDING_CLASSES (r);
6248 friends = &TREE_CHAIN (*friends))
6250 *friends = copy_node (*friends);
6251 TREE_VALUE (*friends) = tsubst (TREE_VALUE (*friends),
6256 if (DECL_CONSTRUCTOR_P (r) || DECL_DESTRUCTOR_P (r))
6258 maybe_retrofit_in_chrg (r);
6259 if (DECL_CONSTRUCTOR_P (r))
6260 grok_ctor_properties (ctx, r);
6261 /* If this is an instantiation of a member template, clone it.
6262 If it isn't, that'll be handled by
6263 clone_constructors_and_destructors. */
6264 if (PRIMARY_TEMPLATE_P (gen_tmpl))
6265 clone_function_decl (r, /*update_method_vec_p=*/0);
6267 else if (IDENTIFIER_OPNAME_P (DECL_NAME (r)))
6268 grok_op_properties (r, DECL_FRIEND_P (r),
6269 (complain & tf_error) != 0);
6271 if (DECL_FRIEND_P (t) && DECL_FRIEND_CONTEXT (t))
6272 SET_DECL_FRIEND_CONTEXT (r,
6273 tsubst (DECL_FRIEND_CONTEXT (t),
6274 args, complain, in_decl));
6281 if (DECL_TEMPLATE_PARM_P (t))
6282 SET_DECL_TEMPLATE_PARM_P (r);
6284 TREE_TYPE (r) = type;
6285 c_apply_type_quals_to_decl (cp_type_quals (type), r);
6287 if (DECL_INITIAL (r))
6289 if (TREE_CODE (DECL_INITIAL (r)) != TEMPLATE_PARM_INDEX)
6290 DECL_INITIAL (r) = TREE_TYPE (r);
6292 DECL_INITIAL (r) = tsubst (DECL_INITIAL (r), args,
6296 DECL_CONTEXT (r) = NULL_TREE;
6298 if (!DECL_TEMPLATE_PARM_P (r))
6299 DECL_ARG_TYPE (r) = type_passed_as (type);
6301 TREE_CHAIN (r) = tsubst (TREE_CHAIN (t), args,
6302 complain, TREE_CHAIN (t));
6309 TREE_TYPE (r) = type;
6310 c_apply_type_quals_to_decl (cp_type_quals (type), r);
6312 /* We don't have to set DECL_CONTEXT here; it is set by
6313 finish_member_declaration. */
6314 DECL_INITIAL (r) = tsubst_expr (DECL_INITIAL (t), args,
6316 TREE_CHAIN (r) = NULL_TREE;
6317 if (VOID_TYPE_P (type))
6318 cp_error_at ("instantiation of `%D' as type `%T'", r, type);
6325 /* It is not a dependent using decl any more. */
6326 TREE_TYPE (r) = void_type_node;
6328 = tsubst_copy (DECL_INITIAL (t), args, complain, in_decl);
6330 = tsubst_copy (DECL_NAME (t), args, complain, in_decl);
6331 TREE_CHAIN (r) = NULL_TREE;
6336 if (TREE_CODE (type) == TEMPLATE_TEMPLATE_PARM
6337 || t == TYPE_MAIN_DECL (TREE_TYPE (t)))
6339 /* If this is the canonical decl, we don't have to mess with
6340 instantiations, and often we can't (for typename, template
6341 type parms and such). Note that TYPE_NAME is not correct for
6342 the above test if we've copied the type for a typedef. */
6343 r = TYPE_NAME (type);
6351 tree argvec = NULL_TREE;
6352 tree gen_tmpl = NULL_TREE;
6354 tree tmpl = NULL_TREE;
6358 /* Assume this is a non-local variable. */
6361 if (TYPE_P (CP_DECL_CONTEXT (t)))
6362 ctx = tsubst_aggr_type (DECL_CONTEXT (t), args,
6364 in_decl, /*entering_scope=*/1);
6365 else if (DECL_NAMESPACE_SCOPE_P (t))
6366 ctx = DECL_CONTEXT (t);
6369 /* Subsequent calls to pushdecl will fill this in. */
6374 /* Check to see if we already have this specialization. */
6377 tmpl = DECL_TI_TEMPLATE (t);
6378 gen_tmpl = most_general_template (tmpl);
6379 argvec = tsubst (DECL_TI_ARGS (t), args, complain, in_decl);
6380 spec = retrieve_specialization (gen_tmpl, argvec);
6383 spec = retrieve_local_specialization (t);
6392 if (TREE_CODE (r) == VAR_DECL)
6394 type = complete_type (type);
6395 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (r)
6396 = DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (t);
6398 else if (DECL_SELF_REFERENCE_P (t))
6399 SET_DECL_SELF_REFERENCE_P (r);
6400 TREE_TYPE (r) = type;
6401 c_apply_type_quals_to_decl (cp_type_quals (type), r);
6402 DECL_CONTEXT (r) = ctx;
6403 /* Clear out the mangled name and RTL for the instantiation. */
6404 SET_DECL_ASSEMBLER_NAME (r, NULL_TREE);
6405 SET_DECL_RTL (r, NULL_RTX);
6407 /* Don't try to expand the initializer until someone tries to use
6408 this variable; otherwise we run into circular dependencies. */
6409 DECL_INITIAL (r) = NULL_TREE;
6410 SET_DECL_RTL (r, NULL_RTX);
6411 DECL_SIZE (r) = DECL_SIZE_UNIT (r) = 0;
6413 /* Even if the original location is out of scope, the newly
6414 substituted one is not. */
6415 if (TREE_CODE (r) == VAR_DECL)
6417 DECL_DEAD_FOR_LOCAL (r) = 0;
6418 DECL_INITIALIZED_P (r) = 0;
6423 /* A static data member declaration is always marked
6424 external when it is declared in-class, even if an
6425 initializer is present. We mimic the non-template
6427 DECL_EXTERNAL (r) = 1;
6429 register_specialization (r, gen_tmpl, argvec);
6430 DECL_TEMPLATE_INFO (r) = tree_cons (tmpl, argvec, NULL_TREE);
6431 SET_DECL_IMPLICIT_INSTANTIATION (r);
6434 register_local_specialization (r, t);
6436 TREE_CHAIN (r) = NULL_TREE;
6437 if (TREE_CODE (r) == VAR_DECL && VOID_TYPE_P (type))
6438 cp_error_at ("instantiation of `%D' as type `%T'", r, type);
6439 /* Compute the size, alignment, etc. of R. */
6448 /* Restore the file and line information. */
6449 input_location = saved_loc;
6454 /* Substitute into the ARG_TYPES of a function type. */
6457 tsubst_arg_types (tree arg_types,
6459 tsubst_flags_t complain,
6462 tree remaining_arg_types;
6465 if (!arg_types || arg_types == void_list_node)
6468 remaining_arg_types = tsubst_arg_types (TREE_CHAIN (arg_types),
6469 args, complain, in_decl);
6470 if (remaining_arg_types == error_mark_node)
6471 return error_mark_node;
6473 type = tsubst (TREE_VALUE (arg_types), args, complain, in_decl);
6474 if (type == error_mark_node)
6475 return error_mark_node;
6476 if (VOID_TYPE_P (type))
6478 if (complain & tf_error)
6480 error ("invalid parameter type `%T'", type);
6482 cp_error_at ("in declaration `%D'", in_decl);
6484 return error_mark_node;
6487 /* Do array-to-pointer, function-to-pointer conversion, and ignore
6488 top-level qualifiers as required. */
6489 type = TYPE_MAIN_VARIANT (type_decays_to (type));
6491 /* Note that we do not substitute into default arguments here. The
6492 standard mandates that they be instantiated only when needed,
6493 which is done in build_over_call. */
6494 return hash_tree_cons (TREE_PURPOSE (arg_types), type,
6495 remaining_arg_types);
6499 /* Substitute into a FUNCTION_TYPE or METHOD_TYPE. This routine does
6500 *not* handle the exception-specification for FNTYPE, because the
6501 initial substitution of explicitly provided template parameters
6502 during argument deduction forbids substitution into the
6503 exception-specification:
6507 All references in the function type of the function template to the
6508 corresponding template parameters are replaced by the specified tem-
6509 plate argument values. If a substitution in a template parameter or
6510 in the function type of the function template results in an invalid
6511 type, type deduction fails. [Note: The equivalent substitution in
6512 exception specifications is done only when the function is instanti-
6513 ated, at which point a program is ill-formed if the substitution
6514 results in an invalid type.] */
6517 tsubst_function_type (tree t,
6519 tsubst_flags_t complain,
6526 /* The TYPE_CONTEXT is not used for function/method types. */
6527 my_friendly_assert (TYPE_CONTEXT (t) == NULL_TREE, 0);
6529 /* Substitute the return type. */
6530 return_type = tsubst (TREE_TYPE (t), args, complain, in_decl);
6531 if (return_type == error_mark_node)
6532 return error_mark_node;
6534 /* Substitute the argument types. */
6535 arg_types = tsubst_arg_types (TYPE_ARG_TYPES (t), args,
6537 if (arg_types == error_mark_node)
6538 return error_mark_node;
6540 /* Construct a new type node and return it. */
6541 if (TREE_CODE (t) == FUNCTION_TYPE)
6542 fntype = build_function_type (return_type, arg_types);
6545 tree r = TREE_TYPE (TREE_VALUE (arg_types));
6546 if (! IS_AGGR_TYPE (r))
6550 Type deduction may fail for any of the following
6553 -- Attempting to create "pointer to member of T" when T
6554 is not a class type. */
6555 if (complain & tf_error)
6556 error ("creating pointer to member function of non-class type `%T'",
6558 return error_mark_node;
6561 fntype = build_method_type_directly (r, return_type,
6562 TREE_CHAIN (arg_types));
6564 fntype = cp_build_qualified_type_real (fntype, TYPE_QUALS (t), complain);
6565 fntype = cp_build_type_attribute_variant (fntype, TYPE_ATTRIBUTES (t));
6570 /* Substitute into the PARMS of a call-declarator. */
6573 tsubst_call_declarator_parms (tree parms,
6575 tsubst_flags_t complain,
6582 if (!parms || parms == void_list_node)
6585 new_parms = tsubst_call_declarator_parms (TREE_CHAIN (parms),
6586 args, complain, in_decl);
6588 /* Figure out the type of this parameter. */
6589 type = tsubst (TREE_VALUE (parms), args, complain, in_decl);
6591 /* Figure out the default argument as well. Note that we use
6592 tsubst_expr since the default argument is really an expression. */
6593 defarg = tsubst_expr (TREE_PURPOSE (parms), args, complain, in_decl);
6595 /* Chain this parameter on to the front of those we have already
6596 processed. We don't use hash_tree_cons because that function
6597 doesn't check TREE_PARMLIST. */
6598 new_parms = tree_cons (defarg, type, new_parms);
6603 /* Take the tree structure T and replace template parameters used
6604 therein with the argument vector ARGS. IN_DECL is an associated
6605 decl for diagnostics. If an error occurs, returns ERROR_MARK_NODE.
6606 Issue error and warning messages under control of COMPLAIN. Note
6607 that we must be relatively non-tolerant of extensions here, in
6608 order to preserve conformance; if we allow substitutions that
6609 should not be allowed, we may allow argument deductions that should
6610 not succeed, and therefore report ambiguous overload situations
6611 where there are none. In theory, we could allow the substitution,
6612 but indicate that it should have failed, and allow our caller to
6613 make sure that the right thing happens, but we don't try to do this
6616 This function is used for dealing with types, decls and the like;
6617 for expressions, use tsubst_expr or tsubst_copy. */
6620 tsubst (tree t, tree args, tsubst_flags_t complain, tree in_decl)
6624 if (t == NULL_TREE || t == error_mark_node
6625 || t == integer_type_node
6626 || t == void_type_node
6627 || t == char_type_node
6628 || TREE_CODE (t) == NAMESPACE_DECL)
6631 if (TREE_CODE (t) == IDENTIFIER_NODE)
6632 type = IDENTIFIER_TYPE_VALUE (t);
6634 type = TREE_TYPE (t);
6636 my_friendly_assert (type != unknown_type_node, 20030716);
6638 if (type && TREE_CODE (t) != FUNCTION_DECL
6639 && TREE_CODE (t) != TYPENAME_TYPE
6640 && TREE_CODE (t) != TEMPLATE_DECL
6641 && TREE_CODE (t) != IDENTIFIER_NODE
6642 && TREE_CODE (t) != FUNCTION_TYPE
6643 && TREE_CODE (t) != METHOD_TYPE)
6644 type = tsubst (type, args, complain, in_decl);
6645 if (type == error_mark_node)
6646 return error_mark_node;
6649 return tsubst_decl (t, args, type, complain);
6651 switch (TREE_CODE (t))
6656 return tsubst_aggr_type (t, args, complain, in_decl,
6657 /*entering_scope=*/0);
6660 case IDENTIFIER_NODE:
6672 if (t == integer_type_node)
6675 if (TREE_CODE (TYPE_MIN_VALUE (t)) == INTEGER_CST
6676 && TREE_CODE (TYPE_MAX_VALUE (t)) == INTEGER_CST)
6680 tree max, omax = TREE_OPERAND (TYPE_MAX_VALUE (t), 0);
6682 /* The array dimension behaves like a non-type template arg,
6683 in that we want to fold it as much as possible. */
6684 max = tsubst_template_arg (omax, args, complain, in_decl);
6685 if (!processing_template_decl)
6686 max = decl_constant_value (max);
6688 if (integer_zerop (omax))
6690 /* Still allow an explicit array of size zero. */
6692 pedwarn ("creating array with size zero");
6694 else if (integer_zerop (max)
6695 || (TREE_CODE (max) == INTEGER_CST
6696 && INT_CST_LT (max, integer_zero_node)))
6700 Type deduction may fail for any of the following
6703 Attempting to create an array with a size that is
6704 zero or negative. */
6705 if (complain & tf_error)
6706 error ("creating array with size zero (`%E')", max);
6708 return error_mark_node;
6711 return compute_array_index_type (NULL_TREE, max);
6714 case TEMPLATE_TYPE_PARM:
6715 case TEMPLATE_TEMPLATE_PARM:
6716 case BOUND_TEMPLATE_TEMPLATE_PARM:
6717 case TEMPLATE_PARM_INDEX:
6725 if (TREE_CODE (t) == TEMPLATE_TYPE_PARM
6726 || TREE_CODE (t) == TEMPLATE_TEMPLATE_PARM
6727 || TREE_CODE (t) == BOUND_TEMPLATE_TEMPLATE_PARM)
6729 idx = TEMPLATE_TYPE_IDX (t);
6730 level = TEMPLATE_TYPE_LEVEL (t);
6734 idx = TEMPLATE_PARM_IDX (t);
6735 level = TEMPLATE_PARM_LEVEL (t);
6738 if (TREE_VEC_LENGTH (args) > 0)
6740 tree arg = NULL_TREE;
6742 levels = TMPL_ARGS_DEPTH (args);
6743 if (level <= levels)
6744 arg = TMPL_ARG (args, level, idx);
6746 if (arg == error_mark_node)
6747 return error_mark_node;
6748 else if (arg != NULL_TREE)
6750 if (TREE_CODE (t) == TEMPLATE_TYPE_PARM)
6752 my_friendly_assert (TYPE_P (arg), 0);
6753 return cp_build_qualified_type_real
6754 (arg, cp_type_quals (arg) | cp_type_quals (t),
6755 complain | tf_ignore_bad_quals);
6757 else if (TREE_CODE (t) == BOUND_TEMPLATE_TEMPLATE_PARM)
6759 /* We are processing a type constructed from
6760 a template template parameter. */
6761 tree argvec = tsubst (TYPE_TI_ARGS (t),
6762 args, complain, in_decl);
6763 if (argvec == error_mark_node)
6764 return error_mark_node;
6766 /* We can get a TEMPLATE_TEMPLATE_PARM here when
6767 we are resolving nested-types in the signature of
6768 a member function templates.
6769 Otherwise ARG is a TEMPLATE_DECL and is the real
6770 template to be instantiated. */
6771 if (TREE_CODE (arg) == TEMPLATE_TEMPLATE_PARM)
6772 arg = TYPE_NAME (arg);
6774 r = lookup_template_class (arg,
6777 /*entering_scope=*/0,
6779 return cp_build_qualified_type_real
6780 (r, TYPE_QUALS (t), complain);
6783 /* TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX. */
6791 /* This can happen during the attempted tsubst'ing in
6792 unify. This means that we don't yet have any information
6793 about the template parameter in question. */
6796 /* If we get here, we must have been looking at a parm for a
6797 more deeply nested template. Make a new version of this
6798 template parameter, but with a lower level. */
6799 switch (TREE_CODE (t))
6801 case TEMPLATE_TYPE_PARM:
6802 case TEMPLATE_TEMPLATE_PARM:
6803 case BOUND_TEMPLATE_TEMPLATE_PARM:
6804 if (cp_type_quals (t))
6806 r = tsubst (TYPE_MAIN_VARIANT (t), args, complain, in_decl);
6807 r = cp_build_qualified_type_real
6808 (r, cp_type_quals (t),
6809 complain | (TREE_CODE (t) == TEMPLATE_TYPE_PARM
6810 ? tf_ignore_bad_quals : 0));
6815 TEMPLATE_TYPE_PARM_INDEX (r)
6816 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (t),
6818 TYPE_STUB_DECL (r) = TYPE_NAME (r) = TEMPLATE_TYPE_DECL (r);
6819 TYPE_MAIN_VARIANT (r) = r;
6820 TYPE_POINTER_TO (r) = NULL_TREE;
6821 TYPE_REFERENCE_TO (r) = NULL_TREE;
6823 if (TREE_CODE (t) == BOUND_TEMPLATE_TEMPLATE_PARM)
6825 tree argvec = tsubst (TYPE_TI_ARGS (t), args,
6827 if (argvec == error_mark_node)
6828 return error_mark_node;
6830 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (r)
6831 = tree_cons (TYPE_TI_TEMPLATE (t), argvec, NULL_TREE);
6836 case TEMPLATE_PARM_INDEX:
6837 r = reduce_template_parm_level (t, type, levels);
6849 tree purpose, value, chain;
6851 if (t == void_list_node)
6854 purpose = TREE_PURPOSE (t);
6857 purpose = tsubst (purpose, args, complain, in_decl);
6858 if (purpose == error_mark_node)
6859 return error_mark_node;
6861 value = TREE_VALUE (t);
6864 value = tsubst (value, args, complain, in_decl);
6865 if (value == error_mark_node)
6866 return error_mark_node;
6868 chain = TREE_CHAIN (t);
6869 if (chain && chain != void_type_node)
6871 chain = tsubst (chain, args, complain, in_decl);
6872 if (chain == error_mark_node)
6873 return error_mark_node;
6875 if (purpose == TREE_PURPOSE (t)
6876 && value == TREE_VALUE (t)
6877 && chain == TREE_CHAIN (t))
6879 return hash_tree_cons (purpose, value, chain);
6883 /* A binfo node. We always need to make a copy, of the node
6884 itself and of its BINFO_BASETYPES. */
6885 my_friendly_assert (type, 20040628);
6889 /* Make sure type isn't a typedef copy. */
6890 type = BINFO_TYPE (TYPE_BINFO (type));
6892 TREE_TYPE (t) = complete_type (type);
6893 if (IS_AGGR_TYPE (type))
6895 BINFO_VTABLE (t) = TYPE_BINFO_VTABLE (type);
6896 BINFO_VIRTUALS (t) = TYPE_BINFO_VIRTUALS (type);
6897 if (TYPE_BINFO_BASETYPES (type) != NULL_TREE)
6898 BINFO_BASETYPES (t) = copy_node (TYPE_BINFO_BASETYPES (type));
6903 /* A vector of template arguments. */
6904 my_friendly_assert (!type, 20040628);
6905 return tsubst_template_args (t, args, complain, in_decl);
6908 case REFERENCE_TYPE:
6910 enum tree_code code;
6912 if (type == TREE_TYPE (t) && TREE_CODE (type) != METHOD_TYPE)
6915 code = TREE_CODE (t);
6920 Type deduction may fail for any of the following
6923 -- Attempting to create a pointer to reference type.
6924 -- Attempting to create a reference to a reference type or
6925 a reference to void. */
6926 if (TREE_CODE (type) == REFERENCE_TYPE
6927 || (code == REFERENCE_TYPE && TREE_CODE (type) == VOID_TYPE))
6929 static location_t last_loc;
6931 /* We keep track of the last time we issued this error
6932 message to avoid spewing a ton of messages during a
6933 single bad template instantiation. */
6934 if (complain & tf_error
6935 #ifdef USE_MAPPED_LOCATION
6936 && last_loc != input_location)
6938 && (last_loc.line != input_line
6939 || last_loc.file != input_filename))
6942 if (TREE_CODE (type) == VOID_TYPE)
6943 error ("forming reference to void");
6945 error ("forming %s to reference type `%T'",
6946 (code == POINTER_TYPE) ? "pointer" : "reference",
6948 last_loc = input_location;
6951 return error_mark_node;
6953 else if (code == POINTER_TYPE)
6955 r = build_pointer_type (type);
6956 if (TREE_CODE (type) == METHOD_TYPE)
6957 r = build_ptrmemfunc_type (r);
6960 r = build_reference_type (type);
6961 r = cp_build_qualified_type_real (r, TYPE_QUALS (t), complain);
6963 if (r != error_mark_node)
6964 /* Will this ever be needed for TYPE_..._TO values? */
6971 r = tsubst (TYPE_OFFSET_BASETYPE (t), args, complain, in_decl);
6972 if (r == error_mark_node || !IS_AGGR_TYPE (r))
6976 Type deduction may fail for any of the following
6979 -- Attempting to create "pointer to member of T" when T
6980 is not a class type. */
6981 if (complain & tf_error)
6982 error ("creating pointer to member of non-class type `%T'", r);
6983 return error_mark_node;
6985 if (TREE_CODE (type) == REFERENCE_TYPE)
6987 if (complain & tf_error)
6988 error ("creating pointer to member reference type `%T'", type);
6990 return error_mark_node;
6992 my_friendly_assert (TREE_CODE (type) != METHOD_TYPE, 20011231);
6993 if (TREE_CODE (type) == FUNCTION_TYPE)
6995 /* This is really a method type. The cv qualifiers of the
6996 this pointer should _not_ be determined by the cv
6997 qualifiers of the class type. They should be held
6998 somewhere in the FUNCTION_TYPE, but we don't do that at
6999 the moment. Consider
7000 typedef void (Func) () const;
7002 template <typename T1> void Foo (Func T1::*);
7007 method_type = build_method_type_directly (TYPE_MAIN_VARIANT (r),
7009 TYPE_ARG_TYPES (type));
7010 return build_ptrmemfunc_type (build_pointer_type (method_type));
7013 return cp_build_qualified_type_real (build_ptrmem_type (r, type),
7023 fntype = tsubst_function_type (t, args, complain, in_decl);
7024 if (fntype == error_mark_node)
7025 return error_mark_node;
7027 /* Substitute the exception specification. */
7028 raises = TYPE_RAISES_EXCEPTIONS (t);
7031 tree list = NULL_TREE;
7033 if (! TREE_VALUE (raises))
7036 for (; raises != NULL_TREE; raises = TREE_CHAIN (raises))
7038 tree spec = TREE_VALUE (raises);
7040 spec = tsubst (spec, args, complain, in_decl);
7041 if (spec == error_mark_node)
7043 list = add_exception_specifier (list, spec, complain);
7045 fntype = build_exception_variant (fntype, list);
7051 tree domain = tsubst (TYPE_DOMAIN (t), args, complain, in_decl);
7052 if (domain == error_mark_node)
7053 return error_mark_node;
7055 /* As an optimization, we avoid regenerating the array type if
7056 it will obviously be the same as T. */
7057 if (type == TREE_TYPE (t) && domain == TYPE_DOMAIN (t))
7060 /* These checks should match the ones in grokdeclarator.
7064 The deduction may fail for any of the following reasons:
7066 -- Attempting to create an array with an element type that
7067 is void, a function type, or a reference type, or [DR337]
7068 an abstract class type. */
7069 if (TREE_CODE (type) == VOID_TYPE
7070 || TREE_CODE (type) == FUNCTION_TYPE
7071 || TREE_CODE (type) == REFERENCE_TYPE)
7073 if (complain & tf_error)
7074 error ("creating array of `%T'", type);
7075 return error_mark_node;
7077 if (CLASS_TYPE_P (type) && CLASSTYPE_PURE_VIRTUALS (type))
7079 if (complain & tf_error)
7080 error ("creating array of `%T', which is an abstract class type",
7082 return error_mark_node;
7085 r = build_cplus_array_type (type, domain);
7092 tree e1 = tsubst (TREE_OPERAND (t, 0), args, complain, in_decl);
7093 tree e2 = tsubst (TREE_OPERAND (t, 1), args, complain, in_decl);
7095 if (e1 == error_mark_node || e2 == error_mark_node)
7096 return error_mark_node;
7098 return fold (build (TREE_CODE (t), TREE_TYPE (t), e1, e2));
7104 tree e = tsubst (TREE_OPERAND (t, 0), args, complain, in_decl);
7105 if (e == error_mark_node)
7106 return error_mark_node;
7108 return fold (build (TREE_CODE (t), TREE_TYPE (t), e));
7113 tree ctx = tsubst_aggr_type (TYPE_CONTEXT (t), args, complain,
7114 in_decl, /*entering_scope=*/1);
7115 tree f = tsubst_copy (TYPENAME_TYPE_FULLNAME (t), args,
7118 if (ctx == error_mark_node || f == error_mark_node)
7119 return error_mark_node;
7121 if (!IS_AGGR_TYPE (ctx))
7123 if (complain & tf_error)
7124 error ("`%T' is not a class, struct, or union type",
7126 return error_mark_node;
7128 else if (!uses_template_parms (ctx) && !TYPE_BEING_DEFINED (ctx))
7130 /* Normally, make_typename_type does not require that the CTX
7131 have complete type in order to allow things like:
7133 template <class T> struct S { typename S<T>::X Y; };
7135 But, such constructs have already been resolved by this
7136 point, so here CTX really should have complete type, unless
7137 it's a partial instantiation. */
7138 ctx = complete_type (ctx);
7139 if (!COMPLETE_TYPE_P (ctx))
7141 if (complain & tf_error)
7142 cxx_incomplete_type_error (NULL_TREE, ctx);
7143 return error_mark_node;
7147 f = make_typename_type (ctx, f,
7148 (complain & tf_error) | tf_keep_type_decl);
7149 if (f == error_mark_node)
7151 if (TREE_CODE (f) == TYPE_DECL)
7153 complain |= tf_ignore_bad_quals;
7157 return cp_build_qualified_type_real
7158 (f, cp_type_quals (f) | cp_type_quals (t), complain);
7161 case UNBOUND_CLASS_TEMPLATE:
7163 tree ctx = tsubst_aggr_type (TYPE_CONTEXT (t), args, complain,
7164 in_decl, /*entering_scope=*/1);
7165 tree name = TYPE_IDENTIFIER (t);
7167 if (ctx == error_mark_node || name == error_mark_node)
7168 return error_mark_node;
7170 return make_unbound_class_template (ctx, name, complain);
7180 tree e1 = tsubst (TREE_OPERAND (t, 0), args, complain, in_decl);
7181 tree e2 = tsubst_expr (TREE_OPERAND (t, 1), args, complain, in_decl);
7182 if (e1 == error_mark_node || e2 == error_mark_node)
7183 return error_mark_node;
7185 return build_nt (ARRAY_REF, e1, e2, NULL_TREE, NULL_TREE);
7190 tree e1 = tsubst (TREE_OPERAND (t, 0), args, complain, in_decl);
7191 tree e2 = tsubst (TREE_OPERAND (t, 1), args, complain, in_decl);
7192 if (e1 == error_mark_node || e2 == error_mark_node)
7193 return error_mark_node;
7195 return build_nt (TREE_CODE (t), e1, e2);
7202 type = finish_typeof (tsubst_expr (TYPEOF_TYPE_EXPR (t), args,
7203 complain, in_decl));
7204 return cp_build_qualified_type_real (type,
7206 | cp_type_quals (type),
7211 sorry ("use of `%s' in template",
7212 tree_code_name [(int) TREE_CODE (t)]);
7213 return error_mark_node;
7217 /* Like tsubst_expr for a BASELINK. OBJECT_TYPE, if non-NULL, is the
7218 type of the expression on the left-hand side of the "." or "->"
7222 tsubst_baselink (tree baselink, tree object_type,
7223 tree args, tsubst_flags_t complain, tree in_decl)
7226 tree qualifying_scope;
7228 tree template_args = 0;
7229 bool template_id_p = false;
7231 /* A baselink indicates a function from a base class. The
7232 BASELINK_ACCESS_BINFO and BASELINK_BINFO are going to have
7233 non-dependent types; otherwise, the lookup could not have
7234 succeeded. However, they may indicate bases of the template
7235 class, rather than the instantiated class.
7237 In addition, lookups that were not ambiguous before may be
7238 ambiguous now. Therefore, we perform the lookup again. */
7239 qualifying_scope = BINFO_TYPE (BASELINK_ACCESS_BINFO (baselink));
7240 fns = BASELINK_FUNCTIONS (baselink);
7241 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)
7243 template_id_p = true;
7244 template_args = TREE_OPERAND (fns, 1);
7245 fns = TREE_OPERAND (fns, 0);
7247 template_args = tsubst_template_args (template_args, args,
7250 name = DECL_NAME (get_first_fn (fns));
7251 baselink = lookup_fnfields (qualifying_scope, name, /*protect=*/1);
7252 if (BASELINK_P (baselink) && template_id_p)
7253 BASELINK_FUNCTIONS (baselink)
7254 = build_nt (TEMPLATE_ID_EXPR,
7255 BASELINK_FUNCTIONS (baselink),
7258 object_type = current_class_type;
7259 return adjust_result_of_qualified_name_lookup (baselink,
7264 /* Like tsubst_expr for a SCOPE_REF, given by QUALIFIED_ID. DONE is
7265 true if the qualified-id will be a postfix-expression in-and-of
7266 itself; false if more of the postfix-expression follows the
7267 QUALIFIED_ID. ADDRESS_P is true if the qualified-id is the operand
7271 tsubst_qualified_id (tree qualified_id, tree args,
7272 tsubst_flags_t complain, tree in_decl,
7273 bool done, bool address_p)
7281 my_friendly_assert (TREE_CODE (qualified_id) == SCOPE_REF, 20030706);
7283 /* Figure out what name to look up. */
7284 name = TREE_OPERAND (qualified_id, 1);
7285 if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
7288 template_args = TREE_OPERAND (name, 1);
7290 template_args = tsubst_template_args (template_args, args,
7292 name = TREE_OPERAND (name, 0);
7296 is_template = false;
7297 template_args = NULL_TREE;
7300 /* Substitute into the qualifying scope. When there are no ARGS, we
7301 are just trying to simplify a non-dependent expression. In that
7302 case the qualifying scope may be dependent, and, in any case,
7303 substituting will not help. */
7304 scope = TREE_OPERAND (qualified_id, 0);
7307 scope = tsubst (scope, args, complain, in_decl);
7308 expr = tsubst_copy (name, args, complain, in_decl);
7313 if (dependent_type_p (scope))
7314 return build_nt (SCOPE_REF, scope, expr);
7316 if (!BASELINK_P (name) && !DECL_P (expr))
7318 expr = lookup_qualified_name (scope, expr, /*is_type_p=*/0, false);
7319 if (TREE_CODE (TREE_CODE (expr) == TEMPLATE_DECL
7320 ? DECL_TEMPLATE_RESULT (expr) : expr) == TYPE_DECL)
7322 if (complain & tf_error)
7324 error ("dependent-name `%E' is parsed as a non-type, but "
7325 "instantiation yields a type", qualified_id);
7326 inform ("say `typename %E' if a type is meant", qualified_id);
7328 return error_mark_node;
7333 check_accessibility_of_qualified_id (expr, /*object_type=*/NULL_TREE,
7336 /* Remember that there was a reference to this entity. */
7341 expr = lookup_template_function (expr, template_args);
7343 if (expr == error_mark_node && complain & tf_error)
7344 qualified_name_lookup_error (scope, TREE_OPERAND (qualified_id, 1));
7345 else if (TYPE_P (scope))
7347 expr = (adjust_result_of_qualified_name_lookup
7348 (expr, scope, current_class_type));
7349 expr = finish_qualified_id_expr (scope, expr, done, address_p);
7355 /* Like tsubst, but deals with expressions. This function just replaces
7356 template parms; to finish processing the resultant expression, use
7360 tsubst_copy (tree t, tree args, tsubst_flags_t complain, tree in_decl)
7362 enum tree_code code;
7365 if (t == NULL_TREE || t == error_mark_node)
7368 code = TREE_CODE (t);
7373 r = retrieve_local_specialization (t);
7374 my_friendly_assert (r != NULL, 20020903);
7383 if (DECL_TEMPLATE_PARM_P (t))
7384 return tsubst_copy (DECL_INITIAL (t), args, complain, in_decl);
7385 /* There is no need to substitute into namespace-scope
7387 if (DECL_NAMESPACE_SCOPE_P (t))
7389 /* If ARGS is NULL, then T is known to be non-dependent. */
7390 if (args == NULL_TREE)
7391 return decl_constant_value (t);
7393 /* Unfortunately, we cannot just call lookup_name here.
7396 template <int I> int f() {
7398 struct S { void g() { E e = a; } };
7401 When we instantiate f<7>::S::g(), say, lookup_name is not
7402 clever enough to find f<7>::a. */
7404 = tsubst_aggr_type (TREE_TYPE (t), args, complain, in_decl,
7405 /*entering_scope=*/0);
7407 for (v = TYPE_VALUES (enum_type);
7410 if (TREE_PURPOSE (v) == DECL_NAME (t))
7411 return TREE_VALUE (v);
7413 /* We didn't find the name. That should never happen; if
7414 name-lookup found it during preliminary parsing, we
7415 should find it again here during instantiation. */
7421 if (DECL_CONTEXT (t))
7425 ctx = tsubst_aggr_type (DECL_CONTEXT (t), args, complain, in_decl,
7426 /*entering_scope=*/1);
7427 if (ctx != DECL_CONTEXT (t))
7428 return lookup_field (ctx, DECL_NAME (t), 0, false);
7434 if ((DECL_LANG_SPECIFIC (t) && DECL_TEMPLATE_INFO (t))
7435 || local_variable_p (t))
7436 t = tsubst (t, args, complain, in_decl);
7441 return tsubst_baselink (t, current_class_type, args, complain, in_decl);
7444 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t))
7445 return tsubst (TREE_TYPE (DECL_TEMPLATE_RESULT (t)),
7446 args, complain, in_decl);
7447 else if (is_member_template (t))
7448 return tsubst (t, args, complain, in_decl);
7449 else if (DECL_CLASS_SCOPE_P (t)
7450 && uses_template_parms (DECL_CONTEXT (t)))
7452 /* Template template argument like the following example need
7455 template <template <class> class TT> struct C {};
7456 template <class T> struct D {
7457 template <class U> struct E {};
7462 We are processing the template argument `E' in #1 for
7463 the template instantiation #2. Originally, `E' is a
7464 TEMPLATE_DECL with `D<T>' as its DECL_CONTEXT. Now we
7465 have to substitute this with one having context `D<int>'. */
7467 tree context = tsubst (DECL_CONTEXT (t), args, complain, in_decl);
7468 return lookup_field (context, DECL_NAME(t), 0, false);
7471 /* Ordinary template template argument. */
7475 case REINTERPRET_CAST_EXPR:
7476 case CONST_CAST_EXPR:
7477 case STATIC_CAST_EXPR:
7478 case DYNAMIC_CAST_EXPR:
7481 (code, tsubst (TREE_TYPE (t), args, complain, in_decl),
7482 tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl));
7486 case TRUTH_NOT_EXPR:
7489 case CONVERT_EXPR: /* Unary + */
7498 (code, tsubst (TREE_TYPE (t), args, complain, in_decl),
7499 tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl));
7506 object = tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl);
7507 name = TREE_OPERAND (t, 1);
7508 if (TREE_CODE (name) == BIT_NOT_EXPR)
7510 name = tsubst_copy (TREE_OPERAND (name, 0), args,
7512 name = build1 (BIT_NOT_EXPR, NULL_TREE, name);
7514 else if (TREE_CODE (name) == SCOPE_REF
7515 && TREE_CODE (TREE_OPERAND (name, 1)) == BIT_NOT_EXPR)
7517 tree base = tsubst_copy (TREE_OPERAND (name, 0), args,
7519 name = TREE_OPERAND (name, 1);
7520 name = tsubst_copy (TREE_OPERAND (name, 0), args,
7522 name = build1 (BIT_NOT_EXPR, NULL_TREE, name);
7523 name = build_nt (SCOPE_REF, base, name);
7525 else if (TREE_CODE (name) == BASELINK)
7526 name = tsubst_baselink (name,
7527 non_reference (TREE_TYPE (object)),
7531 name = tsubst_copy (name, args, complain, in_decl);
7532 return build_nt (COMPONENT_REF, object, name, NULL_TREE);
7538 case TRUNC_DIV_EXPR:
7540 case FLOOR_DIV_EXPR:
7541 case ROUND_DIV_EXPR:
7542 case EXACT_DIV_EXPR:
7546 case TRUNC_MOD_EXPR:
7547 case FLOOR_MOD_EXPR:
7548 case TRUTH_ANDIF_EXPR:
7549 case TRUTH_ORIF_EXPR:
7550 case TRUTH_AND_EXPR:
7569 case PREDECREMENT_EXPR:
7570 case PREINCREMENT_EXPR:
7571 case POSTDECREMENT_EXPR:
7572 case POSTINCREMENT_EXPR:
7574 (code, tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl),
7575 tsubst_copy (TREE_OPERAND (t, 1), args, complain, in_decl));
7578 return build_nt (code,
7579 tsubst_copy (TREE_OPERAND (t, 0), args,
7581 tsubst_copy (TREE_OPERAND (t, 1), args, complain,
7587 case PSEUDO_DTOR_EXPR:
7590 (code, tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl),
7591 tsubst_copy (TREE_OPERAND (t, 1), args, complain, in_decl),
7592 tsubst_copy (TREE_OPERAND (t, 2), args, complain, in_decl));
7599 (code, tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl),
7600 tsubst_copy (TREE_OPERAND (t, 1), args, complain, in_decl),
7601 tsubst_copy (TREE_OPERAND (t, 2), args, complain, in_decl));
7602 NEW_EXPR_USE_GLOBAL (r) = NEW_EXPR_USE_GLOBAL (t);
7609 (code, tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl),
7610 tsubst_copy (TREE_OPERAND (t, 1), args, complain, in_decl));
7611 DELETE_EXPR_USE_GLOBAL (r) = DELETE_EXPR_USE_GLOBAL (t);
7612 DELETE_EXPR_USE_VEC (r) = DELETE_EXPR_USE_VEC (t);
7616 case TEMPLATE_ID_EXPR:
7618 /* Substituted template arguments */
7619 tree fn = TREE_OPERAND (t, 0);
7620 tree targs = TREE_OPERAND (t, 1);
7622 fn = tsubst_copy (fn, args, complain, in_decl);
7624 targs = tsubst_template_args (targs, args, complain, in_decl);
7626 return lookup_template_function (fn, targs);
7631 tree purpose, value, chain;
7633 if (t == void_list_node)
7636 purpose = TREE_PURPOSE (t);
7638 purpose = tsubst_copy (purpose, args, complain, in_decl);
7639 value = TREE_VALUE (t);
7641 value = tsubst_copy (value, args, complain, in_decl);
7642 chain = TREE_CHAIN (t);
7643 if (chain && chain != void_type_node)
7644 chain = tsubst_copy (chain, args, complain, in_decl);
7645 if (purpose == TREE_PURPOSE (t)
7646 && value == TREE_VALUE (t)
7647 && chain == TREE_CHAIN (t))
7649 return tree_cons (purpose, value, chain);
7656 case TEMPLATE_TYPE_PARM:
7657 case TEMPLATE_TEMPLATE_PARM:
7658 case BOUND_TEMPLATE_TEMPLATE_PARM:
7659 case TEMPLATE_PARM_INDEX:
7661 case REFERENCE_TYPE:
7667 case UNBOUND_CLASS_TEMPLATE:
7670 return tsubst (t, args, complain, in_decl);
7672 case IDENTIFIER_NODE:
7673 if (IDENTIFIER_TYPENAME_P (t))
7675 tree new_type = tsubst (TREE_TYPE (t), args, complain, in_decl);
7676 return mangle_conv_op_name_for_type (new_type);
7683 r = build_constructor
7684 (tsubst (TREE_TYPE (t), args, complain, in_decl),
7685 tsubst_copy (CONSTRUCTOR_ELTS (t), args, complain, in_decl));
7686 TREE_HAS_CONSTRUCTOR (r) = TREE_HAS_CONSTRUCTOR (t);
7691 return build_x_va_arg (tsubst_copy (TREE_OPERAND (t, 0), args, complain,
7693 tsubst (TREE_TYPE (t), args, complain, in_decl));
7695 case CLEANUP_POINT_EXPR:
7696 /* We shouldn't have built any of these during initial template
7697 generation. Instead, they should be built during instantiation
7698 in response to the saved STMT_IS_FULL_EXPR_P setting. */
7706 /* Like tsubst_copy for expressions, etc. but also does semantic
7710 tsubst_expr (tree t, tree args, tsubst_flags_t complain, tree in_decl)
7712 /* Live only within one (recursive) call to tsubst_expr. We use
7713 this to pass the statement expression node from the STMT_EXPR
7714 to the EXPR_STMT that is its result. */
7715 static tree cur_stmt_expr;
7719 if (t == NULL_TREE || t == error_mark_node)
7722 if (EXPR_HAS_LOCATION (t))
7723 input_location = EXPR_LOCATION (t);
7724 if (STATEMENT_CODE_P (TREE_CODE (t)))
7725 current_stmt_tree ()->stmts_are_full_exprs_p = STMT_IS_FULL_EXPR_P (t);
7727 switch (TREE_CODE (t))
7729 case STATEMENT_LIST:
7731 tree_stmt_iterator i;
7732 for (i = tsi_start (t); !tsi_end_p (i); tsi_next (&i))
7733 tsubst_expr (tsi_stmt (i), args, complain, in_decl);
7737 case CTOR_INITIALIZER:
7738 finish_mem_initializers (tsubst_initializer_list
7739 (TREE_OPERAND (t, 0), args));
7743 finish_return_stmt (tsubst_expr (TREE_OPERAND (t, 0),
7744 args, complain, in_decl));
7749 tree old_stmt_expr = cur_stmt_expr;
7750 tree stmt_expr = begin_stmt_expr ();
7752 cur_stmt_expr = stmt_expr;
7753 tsubst_expr (STMT_EXPR_STMT (t), args, complain, in_decl);
7754 stmt_expr = finish_stmt_expr (stmt_expr, false);
7755 cur_stmt_expr = old_stmt_expr;
7761 tmp = tsubst_expr (EXPR_STMT_EXPR (t), args, complain, in_decl);
7762 if (EXPR_STMT_STMT_EXPR_RESULT (t))
7763 finish_stmt_expr_expr (tmp, cur_stmt_expr);
7765 finish_expr_stmt (tmp);
7769 do_using_directive (tsubst_expr (USING_STMT_NAMESPACE (t),
7770 args, complain, in_decl));
7778 decl = DECL_EXPR_DECL (t);
7779 if (TREE_CODE (decl) == LABEL_DECL)
7780 finish_label_decl (DECL_NAME (decl));
7781 else if (TREE_CODE (decl) == USING_DECL)
7783 tree scope = DECL_INITIAL (decl);
7784 tree name = DECL_NAME (decl);
7787 scope = tsubst_expr (scope, args, complain, in_decl);
7788 decl = lookup_qualified_name (scope, name,
7789 /*is_type_p=*/false,
7790 /*complain=*/false);
7791 if (decl == error_mark_node)
7792 qualified_name_lookup_error (scope, name);
7794 do_local_using_decl (decl, scope, name);
7798 init = DECL_INITIAL (decl);
7799 decl = tsubst (decl, args, complain, in_decl);
7800 if (decl != error_mark_node)
7803 DECL_INITIAL (decl) = error_mark_node;
7804 /* By marking the declaration as instantiated, we avoid
7805 trying to instantiate it. Since instantiate_decl can't
7806 handle local variables, and since we've already done
7807 all that needs to be done, that's the right thing to
7809 if (TREE_CODE (decl) == VAR_DECL)
7810 DECL_TEMPLATE_INSTANTIATED (decl) = 1;
7811 if (TREE_CODE (decl) == VAR_DECL
7812 && ANON_AGGR_TYPE_P (TREE_TYPE (decl)))
7813 /* Anonymous aggregates are a special case. */
7814 finish_anon_union (decl);
7817 maybe_push_decl (decl);
7818 if (TREE_CODE (decl) == VAR_DECL
7819 && DECL_PRETTY_FUNCTION_P (decl))
7821 /* For __PRETTY_FUNCTION__ we have to adjust the
7823 const char *const name
7824 = cxx_printable_name (current_function_decl, 2);
7825 init = cp_fname_init (name, &TREE_TYPE (decl));
7828 init = tsubst_expr (init, args, complain, in_decl);
7829 cp_finish_decl (decl, init, NULL_TREE, 0);
7834 /* A DECL_EXPR can also be used as an expression, in the condition
7835 clause of an if/for/while construct. */
7840 stmt = begin_for_stmt ();
7841 tsubst_expr (FOR_INIT_STMT (t), args, complain, in_decl);
7842 finish_for_init_stmt (stmt);
7843 tmp = tsubst_expr (FOR_COND (t), args, complain, in_decl);
7844 finish_for_cond (tmp, stmt);
7845 tmp = tsubst_expr (FOR_EXPR (t), args, complain, in_decl);
7846 finish_for_expr (tmp, stmt);
7847 tsubst_expr (FOR_BODY (t), args, complain, in_decl);
7848 finish_for_stmt (stmt);
7852 stmt = begin_while_stmt ();
7853 tmp = tsubst_expr (WHILE_COND (t), args, complain, in_decl);
7854 finish_while_stmt_cond (tmp, stmt);
7855 tsubst_expr (WHILE_BODY (t), args, complain, in_decl);
7856 finish_while_stmt (stmt);
7860 stmt = begin_do_stmt ();
7861 tsubst_expr (DO_BODY (t), args, complain, in_decl);
7862 finish_do_body (stmt);
7863 tmp = tsubst_expr (DO_COND (t), args, complain, in_decl);
7864 finish_do_stmt (tmp, stmt);
7868 stmt = begin_if_stmt ();
7869 tmp = tsubst_expr (IF_COND (t), args, complain, in_decl);
7870 finish_if_stmt_cond (tmp, stmt);
7871 tsubst_expr (THEN_CLAUSE (t), args, complain, in_decl);
7872 finish_then_clause (stmt);
7874 if (ELSE_CLAUSE (t))
7876 begin_else_clause (stmt);
7877 tsubst_expr (ELSE_CLAUSE (t), args, complain, in_decl);
7878 finish_else_clause (stmt);
7881 finish_if_stmt (stmt);
7885 if (BIND_EXPR_BODY_BLOCK (t))
7886 stmt = begin_function_body ();
7888 stmt = begin_compound_stmt (BIND_EXPR_TRY_BLOCK (t)
7889 ? BCS_TRY_BLOCK : 0);
7891 tsubst_expr (BIND_EXPR_BODY (t), args, complain, in_decl);
7893 if (BIND_EXPR_BODY_BLOCK (t))
7894 finish_function_body (stmt);
7896 finish_compound_stmt (stmt);
7900 finish_break_stmt ();
7904 finish_continue_stmt ();
7908 stmt = begin_switch_stmt ();
7909 tmp = tsubst_expr (SWITCH_COND (t), args, complain, in_decl);
7910 finish_switch_cond (tmp, stmt);
7911 tsubst_expr (SWITCH_BODY (t), args, complain, in_decl);
7912 finish_switch_stmt (stmt);
7915 case CASE_LABEL_EXPR:
7916 finish_case_label (tsubst_expr (CASE_LOW (t), args, complain, in_decl),
7917 tsubst_expr (CASE_HIGH (t), args, complain,
7922 finish_label_stmt (DECL_NAME (LABEL_EXPR_LABEL (t)));
7926 tmp = GOTO_DESTINATION (t);
7927 if (TREE_CODE (tmp) != LABEL_DECL)
7928 /* Computed goto's must be tsubst'd into. On the other hand,
7929 non-computed gotos must not be; the identifier in question
7930 will have no binding. */
7931 tmp = tsubst_expr (tmp, args, complain, in_decl);
7933 tmp = DECL_NAME (tmp);
7934 finish_goto_stmt (tmp);
7938 tmp = finish_asm_stmt
7939 (ASM_VOLATILE_P (t),
7940 tsubst_expr (ASM_STRING (t), args, complain, in_decl),
7941 tsubst_expr (ASM_OUTPUTS (t), args, complain, in_decl),
7942 tsubst_expr (ASM_INPUTS (t), args, complain, in_decl),
7943 tsubst_expr (ASM_CLOBBERS (t), args, complain, in_decl));
7944 ASM_INPUT_P (tmp) = ASM_INPUT_P (t);
7950 stmt = begin_try_block ();
7951 tsubst_expr (TRY_STMTS (t), args, complain, in_decl);
7952 finish_cleanup_try_block (stmt);
7953 finish_cleanup (tsubst_expr (TRY_HANDLERS (t), args,
7959 if (FN_TRY_BLOCK_P (t))
7960 stmt = begin_function_try_block ();
7962 stmt = begin_try_block ();
7964 tsubst_expr (TRY_STMTS (t), args, complain, in_decl);
7966 if (FN_TRY_BLOCK_P (t))
7967 finish_function_try_block (stmt);
7969 finish_try_block (stmt);
7971 tsubst_expr (TRY_HANDLERS (t), args, complain, in_decl);
7972 if (FN_TRY_BLOCK_P (t))
7973 finish_function_handler_sequence (stmt);
7975 finish_handler_sequence (stmt);
7983 stmt = begin_handler ();
7984 if (HANDLER_PARMS (t))
7986 decl = HANDLER_PARMS (t);
7987 decl = tsubst (decl, args, complain, in_decl);
7988 /* Prevent instantiate_decl from trying to instantiate
7989 this variable. We've already done all that needs to be
7991 DECL_TEMPLATE_INSTANTIATED (decl) = 1;
7995 finish_handler_parms (decl, stmt);
7996 tsubst_expr (HANDLER_BODY (t), args, complain, in_decl);
7997 finish_handler (stmt);
8002 tsubst (TREE_TYPE (t), args, complain, NULL_TREE);
8006 if (!STATEMENT_CODE_P (TREE_CODE (t)))
8007 return tsubst_copy_and_build (t, args, complain, in_decl,
8008 /*function_p=*/false);
8015 /* T is a postfix-expression that is not being used in a function
8016 call. Return the substituted version of T. */
8019 tsubst_non_call_postfix_expression (tree t, tree args,
8020 tsubst_flags_t complain,
8023 if (TREE_CODE (t) == SCOPE_REF)
8024 t = tsubst_qualified_id (t, args, complain, in_decl,
8025 /*done=*/false, /*address_p=*/false);
8027 t = tsubst_copy_and_build (t, args, complain, in_decl,
8028 /*function_p=*/false);
8033 /* Like tsubst but deals with expressions and performs semantic
8034 analysis. FUNCTION_P is true if T is the "F" in "F (ARGS)". */
8037 tsubst_copy_and_build (tree t,
8039 tsubst_flags_t complain,
8043 #define RECUR(NODE) \
8044 tsubst_copy_and_build (NODE, args, complain, in_decl, /*function_p=*/false)
8048 if (t == NULL_TREE || t == error_mark_node)
8051 switch (TREE_CODE (t))
8056 case IDENTIFIER_NODE:
8060 tree qualifying_class;
8061 bool non_integral_constant_expression_p;
8062 const char *error_msg;
8064 if (IDENTIFIER_TYPENAME_P (t))
8066 tree new_type = tsubst (TREE_TYPE (t), args, complain, in_decl);
8067 t = mangle_conv_op_name_for_type (new_type);
8070 /* Look up the name. */
8071 decl = lookup_name (t, 0);
8073 /* By convention, expressions use ERROR_MARK_NODE to indicate
8074 failure, not NULL_TREE. */
8075 if (decl == NULL_TREE)
8076 decl = error_mark_node;
8078 decl = finish_id_expression (t, decl, NULL_TREE,
8081 /*integral_constant_expression_p=*/false,
8082 /*allow_non_integral_constant_expression_p=*/false,
8083 &non_integral_constant_expression_p,
8087 if (!function_p && TREE_CODE (decl) == IDENTIFIER_NODE)
8088 decl = unqualified_name_lookup_error (decl);
8092 case TEMPLATE_ID_EXPR:
8095 tree template = RECUR (TREE_OPERAND (t, 0));
8096 tree targs = TREE_OPERAND (t, 1);
8099 targs = tsubst_template_args (targs, args, complain, in_decl);
8101 if (TREE_CODE (template) == COMPONENT_REF)
8103 object = TREE_OPERAND (template, 0);
8104 template = TREE_OPERAND (template, 1);
8108 template = lookup_template_function (template, targs);
8111 return build (COMPONENT_REF, TREE_TYPE (template),
8112 object, template, NULL_TREE);
8118 return build_x_indirect_ref (RECUR (TREE_OPERAND (t, 0)), "unary *");
8122 (tsubst (TREE_TYPE (t), args, complain, in_decl),
8123 RECUR (TREE_OPERAND (t, 0)));
8126 return build_functional_cast
8127 (tsubst (TREE_TYPE (t), args, complain, in_decl),
8128 RECUR (TREE_OPERAND (t, 0)));
8130 case REINTERPRET_CAST_EXPR:
8131 return build_reinterpret_cast
8132 (tsubst (TREE_TYPE (t), args, complain, in_decl),
8133 RECUR (TREE_OPERAND (t, 0)));
8135 case CONST_CAST_EXPR:
8136 return build_const_cast
8137 (tsubst (TREE_TYPE (t), args, complain, in_decl),
8138 RECUR (TREE_OPERAND (t, 0)));
8140 case DYNAMIC_CAST_EXPR:
8141 return build_dynamic_cast
8142 (tsubst (TREE_TYPE (t), args, complain, in_decl),
8143 RECUR (TREE_OPERAND (t, 0)));
8145 case STATIC_CAST_EXPR:
8146 return build_static_cast
8147 (tsubst (TREE_TYPE (t), args, complain, in_decl),
8148 RECUR (TREE_OPERAND (t, 0)));
8150 case POSTDECREMENT_EXPR:
8151 case POSTINCREMENT_EXPR:
8152 op1 = tsubst_non_call_postfix_expression (TREE_OPERAND (t, 0),
8153 args, complain, in_decl);
8154 return build_x_unary_op (TREE_CODE (t), op1);
8156 case PREDECREMENT_EXPR:
8157 case PREINCREMENT_EXPR:
8161 case TRUTH_NOT_EXPR:
8162 case CONVERT_EXPR: /* Unary + */
8165 return build_x_unary_op (TREE_CODE (t), RECUR (TREE_OPERAND (t, 0)));
8168 op1 = TREE_OPERAND (t, 0);
8169 if (TREE_CODE (op1) == SCOPE_REF)
8170 op1 = tsubst_qualified_id (op1, args, complain, in_decl,
8171 /*done=*/true, /*address_p=*/true);
8173 op1 = tsubst_non_call_postfix_expression (op1, args, complain,
8175 if (TREE_CODE (op1) == LABEL_DECL)
8176 return finish_label_address_expr (DECL_NAME (op1));
8177 return build_x_unary_op (ADDR_EXPR, op1);
8182 case TRUNC_DIV_EXPR:
8184 case FLOOR_DIV_EXPR:
8185 case ROUND_DIV_EXPR:
8186 case EXACT_DIV_EXPR:
8190 case TRUNC_MOD_EXPR:
8191 case FLOOR_MOD_EXPR:
8192 case TRUTH_ANDIF_EXPR:
8193 case TRUTH_ORIF_EXPR:
8194 case TRUTH_AND_EXPR:
8210 return build_x_binary_op
8212 RECUR (TREE_OPERAND (t, 0)),
8213 RECUR (TREE_OPERAND (t, 1)),
8214 /*overloaded_p=*/NULL);
8217 return tsubst_qualified_id (t, args, complain, in_decl, /*done=*/true,
8218 /*address_p=*/false);
8221 if (tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl)
8224 return build_nt (ARRAY_REF, NULL_TREE, RECUR (TREE_OPERAND (t, 1)),
8225 NULL_TREE, NULL_TREE);
8227 op1 = tsubst_non_call_postfix_expression (TREE_OPERAND (t, 0),
8228 args, complain, in_decl);
8229 /* Remember that there was a reference to this entity. */
8232 return grok_array_decl (op1, RECUR (TREE_OPERAND (t, 1)));
8236 op1 = TREE_OPERAND (t, 0);
8239 /* When there are no ARGS, we are trying to evaluate a
8240 non-dependent expression from the parser. Trying to do
8241 the substitutions may not work. */
8243 op1 = TREE_TYPE (op1);
8252 return cxx_sizeof_or_alignof_type (op1, TREE_CODE (t), true);
8254 return cxx_sizeof_or_alignof_expr (op1, TREE_CODE (t));
8257 return build_x_modify_expr
8258 (RECUR (TREE_OPERAND (t, 0)),
8259 TREE_CODE (TREE_OPERAND (t, 1)),
8260 RECUR (TREE_OPERAND (t, 2)));
8263 op1 = tsubst_non_call_postfix_expression (TREE_OPERAND (t, 0),
8264 args, complain, in_decl);
8265 /* Remember that there was a reference to this entity. */
8268 return build_x_arrow (op1);
8272 (RECUR (TREE_OPERAND (t, 0)),
8273 RECUR (TREE_OPERAND (t, 1)),
8274 RECUR (TREE_OPERAND (t, 2)),
8275 RECUR (TREE_OPERAND (t, 3)),
8276 NEW_EXPR_USE_GLOBAL (t));
8279 return delete_sanity
8280 (RECUR (TREE_OPERAND (t, 0)),
8281 RECUR (TREE_OPERAND (t, 1)),
8282 DELETE_EXPR_USE_VEC (t),
8283 DELETE_EXPR_USE_GLOBAL (t));
8286 return build_x_compound_expr (RECUR (TREE_OPERAND (t, 0)),
8287 RECUR (TREE_OPERAND (t, 1)));
8296 function = TREE_OPERAND (t, 0);
8297 /* When we parsed the expression, we determined whether or
8298 not Koenig lookup should be performed. */
8299 koenig_p = KOENIG_LOOKUP_P (t);
8300 if (TREE_CODE (function) == SCOPE_REF)
8303 function = tsubst_qualified_id (function, args, complain, in_decl,
8305 /*address_p=*/false);
8309 qualified_p = (TREE_CODE (function) == COMPONENT_REF
8310 && (TREE_CODE (TREE_OPERAND (function, 1))
8312 function = tsubst_copy_and_build (function, args, complain,
8315 if (BASELINK_P (function))
8319 call_args = RECUR (TREE_OPERAND (t, 1));
8321 /* We do not perform argument-dependent lookup if normal
8322 lookup finds a non-function, in accordance with the
8323 expected resolution of DR 218. */
8325 && (is_overloaded_fn (function)
8326 || TREE_CODE (function) == IDENTIFIER_NODE))
8327 function = perform_koenig_lookup (function, call_args);
8329 if (TREE_CODE (function) == IDENTIFIER_NODE)
8331 unqualified_name_lookup_error (function);
8332 return error_mark_node;
8335 /* Remember that there was a reference to this entity. */
8336 if (DECL_P (function))
8337 mark_used (function);
8339 function = convert_from_reference (function);
8341 if (TREE_CODE (function) == OFFSET_REF)
8342 return build_offset_ref_call_from_tree (function, call_args);
8343 if (TREE_CODE (function) == COMPONENT_REF)
8345 if (!BASELINK_P (TREE_OPERAND (function, 1)))
8346 return finish_call_expr (function, call_args,
8347 /*disallow_virtual=*/false,
8348 /*koenig_p=*/false);
8350 return (build_new_method_call
8351 (TREE_OPERAND (function, 0),
8352 TREE_OPERAND (function, 1),
8353 call_args, NULL_TREE,
8354 qualified_p ? LOOKUP_NONVIRTUAL : LOOKUP_NORMAL));
8356 return finish_call_expr (function, call_args,
8357 /*disallow_virtual=*/qualified_p,
8362 return build_x_conditional_expr
8363 (RECUR (TREE_OPERAND (t, 0)),
8364 RECUR (TREE_OPERAND (t, 1)),
8365 RECUR (TREE_OPERAND (t, 2)));
8367 case PSEUDO_DTOR_EXPR:
8368 return finish_pseudo_destructor_expr
8369 (RECUR (TREE_OPERAND (t, 0)),
8370 RECUR (TREE_OPERAND (t, 1)),
8371 RECUR (TREE_OPERAND (t, 2)));
8375 tree purpose, value, chain;
8377 if (t == void_list_node)
8380 purpose = TREE_PURPOSE (t);
8382 purpose = RECUR (purpose);
8383 value = TREE_VALUE (t);
8385 value = RECUR (value);
8386 chain = TREE_CHAIN (t);
8387 if (chain && chain != void_type_node)
8388 chain = RECUR (chain);
8389 if (purpose == TREE_PURPOSE (t)
8390 && value == TREE_VALUE (t)
8391 && chain == TREE_CHAIN (t))
8393 return tree_cons (purpose, value, chain);
8401 object = tsubst_non_call_postfix_expression (TREE_OPERAND (t, 0),
8402 args, complain, in_decl);
8403 /* Remember that there was a reference to this entity. */
8404 if (DECL_P (object))
8407 member = TREE_OPERAND (t, 1);
8408 if (BASELINK_P (member))
8409 member = tsubst_baselink (member,
8410 non_reference (TREE_TYPE (object)),
8411 args, complain, in_decl);
8413 member = tsubst_copy (member, args, complain, in_decl);
8415 if (!CLASS_TYPE_P (TREE_TYPE (object)))
8417 if (TREE_CODE (member) == BIT_NOT_EXPR)
8418 return finish_pseudo_destructor_expr (object,
8420 TREE_TYPE (object));
8421 else if (TREE_CODE (member) == SCOPE_REF
8422 && (TREE_CODE (TREE_OPERAND (member, 1)) == BIT_NOT_EXPR))
8423 return finish_pseudo_destructor_expr (object,
8425 TREE_TYPE (object));
8427 else if (TREE_CODE (member) == SCOPE_REF
8428 && TREE_CODE (TREE_OPERAND (member, 1)) == TEMPLATE_ID_EXPR)
8433 /* Lookup the template functions now that we know what the
8435 tmpl = TREE_OPERAND (TREE_OPERAND (member, 1), 0);
8436 args = TREE_OPERAND (TREE_OPERAND (member, 1), 1);
8437 member = lookup_qualified_name (TREE_OPERAND (member, 0), tmpl,
8438 /*is_type_p=*/false,
8439 /*complain=*/false);
8440 if (BASELINK_P (member))
8441 BASELINK_FUNCTIONS (member)
8442 = build_nt (TEMPLATE_ID_EXPR, BASELINK_FUNCTIONS (member),
8446 qualified_name_lookup_error (TREE_TYPE (object), tmpl);
8447 return error_mark_node;
8450 else if (TREE_CODE (member) == FIELD_DECL)
8451 return finish_non_static_data_member (member, object, NULL_TREE);
8453 return finish_class_member_access_expr (object, member);
8458 (RECUR (TREE_OPERAND (t, 0)));
8464 tree type = tsubst (TREE_TYPE (t), args, complain, in_decl);
8467 /* digest_init will do the wrong thing if we let it. */
8468 if (type && TYPE_PTRMEMFUNC_P (type))
8472 /* We do not want to process the purpose of aggregate
8473 initializers as they are identifier nodes which will be
8474 looked up by digest_init. */
8475 purpose_p = !(type && IS_AGGR_TYPE (type));
8476 for (elts = CONSTRUCTOR_ELTS (t);
8478 elts = TREE_CHAIN (elts))
8480 tree purpose = TREE_PURPOSE (elts);
8481 tree value = TREE_VALUE (elts);
8483 if (purpose && purpose_p)
8484 purpose = RECUR (purpose);
8485 value = RECUR (value);
8486 r = tree_cons (purpose, value, r);
8489 r = build_constructor (NULL_TREE, nreverse (r));
8490 TREE_HAS_CONSTRUCTOR (r) = TREE_HAS_CONSTRUCTOR (t);
8493 return digest_init (type, r, 0);
8499 tree operand_0 = RECUR (TREE_OPERAND (t, 0));
8500 if (TYPE_P (operand_0))
8501 return get_typeid (operand_0);
8502 return build_typeid (operand_0);
8506 return convert_from_reference (tsubst_copy (t, args, complain, in_decl));
8510 t = tsubst_copy (t, args, complain, in_decl);
8511 return convert_from_reference (t);
8514 return build_x_va_arg (RECUR (TREE_OPERAND (t, 0)),
8515 tsubst_copy (TREE_TYPE (t), args, complain,
8519 return tsubst_copy (t, args, complain, in_decl);
8525 /* Verify that the instantiated ARGS are valid. For type arguments,
8526 make sure that the type's linkage is ok. For non-type arguments,
8527 make sure they are constants if they are integral or enumerations.
8528 Emit an error under control of COMPLAIN, and return TRUE on error. */
8531 check_instantiated_args (tree tmpl, tree args, tsubst_flags_t complain)
8533 int ix, len = DECL_NTPARMS (tmpl);
8534 bool result = false;
8536 for (ix = 0; ix != len; ix++)
8538 tree t = TREE_VEC_ELT (args, ix);
8542 /* [basic.link]: A name with no linkage (notably, the name
8543 of a class or enumeration declared in a local scope)
8544 shall not be used to declare an entity with linkage.
8545 This implies that names with no linkage cannot be used as
8546 template arguments. */
8547 tree nt = no_linkage_check (t);
8551 if (!(complain & tf_error))
8553 else if (TYPE_ANONYMOUS_P (nt))
8554 error ("`%T' uses anonymous type", t);
8556 error ("`%T' uses local type `%T'", t, nt);
8559 /* In order to avoid all sorts of complications, we do not
8560 allow variably-modified types as template arguments. */
8561 else if (variably_modified_type_p (t, NULL_TREE))
8563 if (complain & tf_error)
8564 error ("`%T' is a variably modified type", t);
8568 /* A non-type argument of integral or enumerated type must be a
8570 else if (TREE_TYPE (t)
8571 && INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (t))
8572 && !TREE_CONSTANT (t))
8574 if (complain & tf_error)
8575 error ("integral expression `%E' is not constant", t);
8579 if (result && complain & tf_error)
8580 error (" trying to instantiate `%D'", tmpl);
8584 /* Instantiate the indicated variable or function template TMPL with
8585 the template arguments in TARG_PTR. */
8588 instantiate_template (tree tmpl, tree targ_ptr, tsubst_flags_t complain)
8594 if (tmpl == error_mark_node)
8595 return error_mark_node;
8597 my_friendly_assert (TREE_CODE (tmpl) == TEMPLATE_DECL, 283);
8599 /* If this function is a clone, handle it specially. */
8600 if (DECL_CLONED_FUNCTION_P (tmpl))
8605 spec = instantiate_template (DECL_CLONED_FUNCTION (tmpl), targ_ptr,
8607 if (spec == error_mark_node)
8608 return error_mark_node;
8610 /* Look for the clone. */
8611 for (clone = TREE_CHAIN (spec);
8612 clone && DECL_CLONED_FUNCTION_P (clone);
8613 clone = TREE_CHAIN (clone))
8614 if (DECL_NAME (clone) == DECL_NAME (tmpl))
8616 /* We should always have found the clone by now. */
8621 /* Check to see if we already have this specialization. */
8622 spec = retrieve_specialization (tmpl, targ_ptr);
8623 if (spec != NULL_TREE)
8626 gen_tmpl = most_general_template (tmpl);
8627 if (tmpl != gen_tmpl)
8629 /* The TMPL is a partial instantiation. To get a full set of
8630 arguments we must add the arguments used to perform the
8631 partial instantiation. */
8632 targ_ptr = add_outermost_template_args (DECL_TI_ARGS (tmpl),
8635 /* Check to see if we already have this specialization. */
8636 spec = retrieve_specialization (gen_tmpl, targ_ptr);
8637 if (spec != NULL_TREE)
8641 if (check_instantiated_args (gen_tmpl, INNERMOST_TEMPLATE_ARGS (targ_ptr),
8643 return error_mark_node;
8645 /* We are building a FUNCTION_DECL, during which the access of its
8646 parameters and return types have to be checked. However this
8647 FUNCTION_DECL which is the desired context for access checking
8648 is not built yet. We solve this chicken-and-egg problem by
8649 deferring all checks until we have the FUNCTION_DECL. */
8650 push_deferring_access_checks (dk_deferred);
8652 /* Substitute template parameters. */
8653 fndecl = tsubst (DECL_TEMPLATE_RESULT (gen_tmpl),
8654 targ_ptr, complain, gen_tmpl);
8656 /* Now we know the specialization, compute access previously
8658 push_access_scope (fndecl);
8659 perform_deferred_access_checks ();
8660 pop_access_scope (fndecl);
8661 pop_deferring_access_checks ();
8663 /* The DECL_TI_TEMPLATE should always be the immediate parent
8664 template, not the most general template. */
8665 DECL_TI_TEMPLATE (fndecl) = tmpl;
8667 /* If we've just instantiated the main entry point for a function,
8668 instantiate all the alternate entry points as well. We do this
8669 by cloning the instantiation of the main entry point, not by
8670 instantiating the template clones. */
8671 if (TREE_CHAIN (gen_tmpl) && DECL_CLONED_FUNCTION_P (TREE_CHAIN (gen_tmpl)))
8672 clone_function_decl (fndecl, /*update_method_vec_p=*/0);
8677 /* The FN is a TEMPLATE_DECL for a function. The ARGS are the
8678 arguments that are being used when calling it. TARGS is a vector
8679 into which the deduced template arguments are placed.
8681 Return zero for success, 2 for an incomplete match that doesn't resolve
8682 all the types, and 1 for complete failure. An error message will be
8683 printed only for an incomplete match.
8685 If FN is a conversion operator, or we are trying to produce a specific
8686 specialization, RETURN_TYPE is the return type desired.
8688 The EXPLICIT_TARGS are explicit template arguments provided via a
8691 The parameter STRICT is one of:
8694 We are deducing arguments for a function call, as in
8698 We are deducing arguments for a conversion function, as in
8702 We are deducing arguments when doing an explicit instantiation
8703 as in [temp.explicit], when determining an explicit specialization
8704 as in [temp.expl.spec], or when taking the address of a function
8705 template, as in [temp.deduct.funcaddr].
8708 We are deducing arguments when calculating the partial
8709 ordering between specializations of function or class
8710 templates, as in [temp.func.order] and [temp.class.order].
8712 LEN is the number of parms to consider before returning success, or -1
8713 for all. This is used in partial ordering to avoid comparing parms for
8714 which no actual argument was passed, since they are not considered in
8715 overload resolution (and are explicitly excluded from consideration in
8716 partial ordering in [temp.func.order]/6). */
8719 fn_type_unification (tree fn,
8720 tree explicit_targs,
8724 unification_kind_t strict,
8731 my_friendly_assert (TREE_CODE (fn) == TEMPLATE_DECL, 0);
8733 fntype = TREE_TYPE (fn);
8738 The specified template arguments must match the template
8739 parameters in kind (i.e., type, nontype, template), and there
8740 must not be more arguments than there are parameters;
8741 otherwise type deduction fails.
8743 Nontype arguments must match the types of the corresponding
8744 nontype template parameters, or must be convertible to the
8745 types of the corresponding nontype parameters as specified in
8746 _temp.arg.nontype_, otherwise type deduction fails.
8748 All references in the function type of the function template
8749 to the corresponding template parameters are replaced by the
8750 specified template argument values. If a substitution in a
8751 template parameter or in the function type of the function
8752 template results in an invalid type, type deduction fails. */
8754 tree converted_args;
8758 = (coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn),
8759 explicit_targs, NULL_TREE, tf_none,
8760 /*require_all_arguments=*/0));
8761 if (converted_args == error_mark_node)
8764 /* Substitute the explicit args into the function type. This is
8765 necessary so that, for instance, explicitly declared function
8766 arguments can match null pointed constants. If we were given
8767 an incomplete set of explicit args, we must not do semantic
8768 processing during substitution as we could create partial
8770 incomplete = NUM_TMPL_ARGS (explicit_targs) != NUM_TMPL_ARGS (targs);
8771 processing_template_decl += incomplete;
8772 fntype = tsubst (fntype, converted_args, tf_none, NULL_TREE);
8773 processing_template_decl -= incomplete;
8775 if (fntype == error_mark_node)
8778 /* Place the explicitly specified arguments in TARGS. */
8779 for (i = NUM_TMPL_ARGS (converted_args); i--;)
8780 TREE_VEC_ELT (targs, i) = TREE_VEC_ELT (converted_args, i);
8783 parms = TYPE_ARG_TYPES (fntype);
8784 /* Never do unification on the 'this' parameter. */
8785 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn))
8786 parms = TREE_CHAIN (parms);
8790 /* We've been given a return type to match, prepend it. */
8791 parms = tree_cons (NULL_TREE, TREE_TYPE (fntype), parms);
8792 args = tree_cons (NULL_TREE, return_type, args);
8797 /* We allow incomplete unification without an error message here
8798 because the standard doesn't seem to explicitly prohibit it. Our
8799 callers must be ready to deal with unification failures in any
8801 result = type_unification_real (DECL_INNERMOST_TEMPLATE_PARMS (fn),
8802 targs, parms, args, /*subr=*/0,
8803 strict, /*allow_incomplete*/1, len);
8806 /* All is well so far. Now, check:
8810 When all template arguments have been deduced, all uses of
8811 template parameters in nondeduced contexts are replaced with
8812 the corresponding deduced argument values. If the
8813 substitution results in an invalid type, as described above,
8814 type deduction fails. */
8815 if (tsubst (TREE_TYPE (fn), targs, tf_none, NULL_TREE)
8822 /* Adjust types before performing type deduction, as described in
8823 [temp.deduct.call] and [temp.deduct.conv]. The rules in these two
8824 sections are symmetric. PARM is the type of a function parameter
8825 or the return type of the conversion function. ARG is the type of
8826 the argument passed to the call, or the type of the value
8827 initialized with the result of the conversion function. */
8830 maybe_adjust_types_for_deduction (unification_kind_t strict,
8843 /* Swap PARM and ARG throughout the remainder of this
8844 function; the handling is precisely symmetric since PARM
8845 will initialize ARG rather than vice versa. */
8853 /* There is nothing to do in this case. */
8857 /* DR 214. [temp.func.order] is underspecified, and leads to no
8858 ordering between things like `T *' and `T const &' for `U *'.
8859 The former has T=U and the latter T=U*. The former looks more
8860 specialized and John Spicer considers it well-formed (the EDG
8861 compiler accepts it).
8863 John also confirms that deduction should proceed as in a function
8864 call. Which implies the usual ARG and PARM conversions as DEDUCE_CALL.
8865 However, in ordering, ARG can have REFERENCE_TYPE, but no argument
8866 to an actual call can have such a type.
8868 If both ARG and PARM are REFERENCE_TYPE, we change neither.
8869 If only ARG is a REFERENCE_TYPE, we look through that and then
8870 proceed as with DEDUCE_CALL (which could further convert it). */
8871 if (TREE_CODE (*arg) == REFERENCE_TYPE)
8873 if (TREE_CODE (*parm) == REFERENCE_TYPE)
8875 *arg = TREE_TYPE (*arg);
8882 if (TREE_CODE (*parm) != REFERENCE_TYPE)
8884 /* [temp.deduct.call]
8886 If P is not a reference type:
8888 --If A is an array type, the pointer type produced by the
8889 array-to-pointer standard conversion (_conv.array_) is
8890 used in place of A for type deduction; otherwise,
8892 --If A is a function type, the pointer type produced by
8893 the function-to-pointer standard conversion
8894 (_conv.func_) is used in place of A for type deduction;
8897 --If A is a cv-qualified type, the top level
8898 cv-qualifiers of A's type are ignored for type
8900 if (TREE_CODE (*arg) == ARRAY_TYPE)
8901 *arg = build_pointer_type (TREE_TYPE (*arg));
8902 else if (TREE_CODE (*arg) == FUNCTION_TYPE)
8903 *arg = build_pointer_type (*arg);
8905 *arg = TYPE_MAIN_VARIANT (*arg);
8908 /* [temp.deduct.call]
8910 If P is a cv-qualified type, the top level cv-qualifiers
8911 of P's type are ignored for type deduction. If P is a
8912 reference type, the type referred to by P is used for
8914 *parm = TYPE_MAIN_VARIANT (*parm);
8915 if (TREE_CODE (*parm) == REFERENCE_TYPE)
8917 *parm = TREE_TYPE (*parm);
8918 result |= UNIFY_ALLOW_OUTER_MORE_CV_QUAL;
8921 /* DR 322. For conversion deduction, remove a reference type on parm
8922 too (which has been swapped into ARG). */
8923 if (strict == DEDUCE_CONV && TREE_CODE (*arg) == REFERENCE_TYPE)
8924 *arg = TREE_TYPE (*arg);
8929 /* Most parms like fn_type_unification.
8931 If SUBR is 1, we're being called recursively (to unify the
8932 arguments of a function or method parameter of a function
8936 type_unification_real (tree tparms,
8941 unification_kind_t strict,
8942 int allow_incomplete,
8947 int ntparms = TREE_VEC_LENGTH (tparms);
8949 int saw_undeduced = 0;
8953 my_friendly_assert (TREE_CODE (tparms) == TREE_VEC, 289);
8954 my_friendly_assert (xparms == NULL_TREE
8955 || TREE_CODE (xparms) == TREE_LIST, 290);
8956 my_friendly_assert (!xargs || TREE_CODE (xargs) == TREE_LIST, 291);
8957 my_friendly_assert (ntparms > 0, 292);
8962 sub_strict = (UNIFY_ALLOW_OUTER_LEVEL | UNIFY_ALLOW_MORE_CV_QUAL
8963 | UNIFY_ALLOW_DERIVED);
8967 sub_strict = UNIFY_ALLOW_LESS_CV_QUAL;
8971 sub_strict = UNIFY_ALLOW_NONE;
8975 sub_strict = UNIFY_ALLOW_NONE;
8991 && parms != void_list_node
8993 && args != void_list_node)
8995 parm = TREE_VALUE (parms);
8996 parms = TREE_CHAIN (parms);
8997 arg = TREE_VALUE (args);
8998 args = TREE_CHAIN (args);
9000 if (arg == error_mark_node)
9002 if (arg == unknown_type_node)
9003 /* We can't deduce anything from this, but we might get all the
9004 template args from other function args. */
9007 /* Conversions will be performed on a function argument that
9008 corresponds with a function parameter that contains only
9009 non-deducible template parameters and explicitly specified
9010 template parameters. */
9011 if (!uses_template_parms (parm))
9016 type = TREE_TYPE (arg);
9020 if (strict == DEDUCE_EXACT || strict == DEDUCE_ORDER)
9022 if (same_type_p (parm, type))
9026 /* It might work; we shouldn't check now, because we might
9027 get into infinite recursion. Overload resolution will
9036 my_friendly_assert (TREE_TYPE (arg) != NULL_TREE, 293);
9037 if (type_unknown_p (arg))
9039 /* [temp.deduct.type] A template-argument can be deduced from
9040 a pointer to function or pointer to member function
9041 argument if the set of overloaded functions does not
9042 contain function templates and at most one of a set of
9043 overloaded functions provides a unique match. */
9045 if (resolve_overloaded_unification
9046 (tparms, targs, parm, arg, strict, sub_strict)
9051 arg = TREE_TYPE (arg);
9052 if (arg == error_mark_node)
9057 int arg_strict = sub_strict;
9060 arg_strict |= maybe_adjust_types_for_deduction (strict, &parm, &arg);
9062 if (unify (tparms, targs, parm, arg, arg_strict))
9066 /* Are we done with the interesting parms? */
9070 /* Fail if we've reached the end of the parm list, and more args
9071 are present, and the parm list isn't variadic. */
9072 if (args && args != void_list_node && parms == void_list_node)
9074 /* Fail if parms are left and they don't have default values. */
9076 && parms != void_list_node
9077 && TREE_PURPOSE (parms) == NULL_TREE)
9082 for (i = 0; i < ntparms; i++)
9083 if (TREE_VEC_ELT (targs, i) == NULL_TREE)
9085 tree tparm = TREE_VALUE (TREE_VEC_ELT (tparms, i));
9087 /* If this is an undeduced nontype parameter that depends on
9088 a type parameter, try another pass; its type may have been
9089 deduced from a later argument than the one from which
9090 this parameter can be deduced. */
9091 if (TREE_CODE (tparm) == PARM_DECL
9092 && uses_template_parms (TREE_TYPE (tparm))
9093 && !saw_undeduced++)
9096 if (!allow_incomplete)
9097 error ("incomplete type unification");
9103 /* Subroutine of type_unification_real. Args are like the variables at the
9104 call site. ARG is an overloaded function (or template-id); we try
9105 deducing template args from each of the overloads, and if only one
9106 succeeds, we go with that. Modifies TARGS and returns 0 on success. */
9109 resolve_overloaded_unification (tree tparms,
9113 unification_kind_t strict,
9116 tree tempargs = copy_node (targs);
9120 if (TREE_CODE (arg) == ADDR_EXPR)
9122 arg = TREE_OPERAND (arg, 0);
9128 if (TREE_CODE (arg) == COMPONENT_REF)
9129 /* Handle `&x' where `x' is some static or non-static member
9131 arg = TREE_OPERAND (arg, 1);
9133 if (TREE_CODE (arg) == OFFSET_REF)
9134 arg = TREE_OPERAND (arg, 1);
9136 /* Strip baselink information. */
9137 if (BASELINK_P (arg))
9138 arg = BASELINK_FUNCTIONS (arg);
9140 if (TREE_CODE (arg) == TEMPLATE_ID_EXPR)
9142 /* If we got some explicit template args, we need to plug them into
9143 the affected templates before we try to unify, in case the
9144 explicit args will completely resolve the templates in question. */
9146 tree expl_subargs = TREE_OPERAND (arg, 1);
9147 arg = TREE_OPERAND (arg, 0);
9149 for (; arg; arg = OVL_NEXT (arg))
9151 tree fn = OVL_CURRENT (arg);
9154 if (TREE_CODE (fn) != TEMPLATE_DECL)
9157 subargs = get_bindings_overload (fn, DECL_TEMPLATE_RESULT (fn),
9161 elem = tsubst (TREE_TYPE (fn), subargs, tf_none, NULL_TREE);
9162 good += try_one_overload (tparms, targs, tempargs, parm,
9163 elem, strict, sub_strict, addr_p);
9167 else if (TREE_CODE (arg) == OVERLOAD
9168 || TREE_CODE (arg) == FUNCTION_DECL)
9170 for (; arg; arg = OVL_NEXT (arg))
9171 good += try_one_overload (tparms, targs, tempargs, parm,
9172 TREE_TYPE (OVL_CURRENT (arg)),
9173 strict, sub_strict, addr_p);
9178 /* [temp.deduct.type] A template-argument can be deduced from a pointer
9179 to function or pointer to member function argument if the set of
9180 overloaded functions does not contain function templates and at most
9181 one of a set of overloaded functions provides a unique match.
9183 So if we found multiple possibilities, we return success but don't
9188 int i = TREE_VEC_LENGTH (targs);
9190 if (TREE_VEC_ELT (tempargs, i))
9191 TREE_VEC_ELT (targs, i) = TREE_VEC_ELT (tempargs, i);
9199 /* Subroutine of resolve_overloaded_unification; does deduction for a single
9200 overload. Fills TARGS with any deduced arguments, or error_mark_node if
9201 different overloads deduce different arguments for a given parm.
9202 ADDR_P is true if the expression for which deduction is being
9203 performed was of the form "& fn" rather than simply "fn".
9205 Returns 1 on success. */
9208 try_one_overload (tree tparms,
9213 unification_kind_t strict,
9221 /* [temp.deduct.type] A template-argument can be deduced from a pointer
9222 to function or pointer to member function argument if the set of
9223 overloaded functions does not contain function templates and at most
9224 one of a set of overloaded functions provides a unique match.
9226 So if this is a template, just return success. */
9228 if (uses_template_parms (arg))
9231 if (TREE_CODE (arg) == METHOD_TYPE)
9232 arg = build_ptrmemfunc_type (build_pointer_type (arg));
9234 arg = build_pointer_type (arg);
9236 sub_strict |= maybe_adjust_types_for_deduction (strict, &parm, &arg);
9238 /* We don't copy orig_targs for this because if we have already deduced
9239 some template args from previous args, unify would complain when we
9240 try to deduce a template parameter for the same argument, even though
9241 there isn't really a conflict. */
9242 nargs = TREE_VEC_LENGTH (targs);
9243 tempargs = make_tree_vec (nargs);
9245 if (unify (tparms, tempargs, parm, arg, sub_strict) != 0)
9248 /* First make sure we didn't deduce anything that conflicts with
9249 explicitly specified args. */
9250 for (i = nargs; i--; )
9252 tree elt = TREE_VEC_ELT (tempargs, i);
9253 tree oldelt = TREE_VEC_ELT (orig_targs, i);
9255 if (elt == NULL_TREE)
9257 else if (uses_template_parms (elt))
9259 /* Since we're unifying against ourselves, we will fill in template
9260 args used in the function parm list with our own template parms.
9262 TREE_VEC_ELT (tempargs, i) = NULL_TREE;
9265 else if (oldelt && ! template_args_equal (oldelt, elt))
9269 for (i = nargs; i--; )
9271 tree elt = TREE_VEC_ELT (tempargs, i);
9274 TREE_VEC_ELT (targs, i) = elt;
9280 /* Verify that nondeduce template argument agrees with the type
9281 obtained from argument deduction. Return nonzero if the
9286 struct A { typedef int X; };
9287 template <class T, class U> struct C {};
9288 template <class T> struct C<T, typename T::X> {};
9290 Then with the instantiation `C<A, int>', we can deduce that
9291 `T' is `A' but unify () does not check whether `typename T::X'
9292 is `int'. This function ensure that they agree.
9294 TARGS, PARMS are the same as the arguments of unify.
9295 ARGS contains template arguments from all levels. */
9298 verify_class_unification (tree targs, tree parms, tree args)
9300 parms = tsubst (parms, add_outermost_template_args (args, targs),
9301 tf_none, NULL_TREE);
9302 if (parms == error_mark_node)
9305 return !comp_template_args (parms, INNERMOST_TEMPLATE_ARGS (args));
9308 /* PARM is a template class (perhaps with unbound template
9309 parameters). ARG is a fully instantiated type. If ARG can be
9310 bound to PARM, return ARG, otherwise return NULL_TREE. TPARMS and
9311 TARGS are as for unify. */
9314 try_class_unification (tree tparms, tree targs, tree parm, tree arg)
9318 if (!CLASSTYPE_TEMPLATE_INFO (arg)
9319 || (most_general_template (CLASSTYPE_TI_TEMPLATE (arg))
9320 != most_general_template (CLASSTYPE_TI_TEMPLATE (parm))))
9323 /* We need to make a new template argument vector for the call to
9324 unify. If we used TARGS, we'd clutter it up with the result of
9325 the attempted unification, even if this class didn't work out.
9326 We also don't want to commit ourselves to all the unifications
9327 we've already done, since unification is supposed to be done on
9328 an argument-by-argument basis. In other words, consider the
9329 following pathological case:
9331 template <int I, int J, int K>
9334 template <int I, int J>
9335 struct S<I, J, 2> : public S<I, I, I>, S<J, J, J> {};
9337 template <int I, int J, int K>
9338 void f(S<I, J, K>, S<I, I, I>);
9347 Now, by the time we consider the unification involving `s2', we
9348 already know that we must have `f<0, 0, 0>'. But, even though
9349 `S<0, 1, 2>' is derived from `S<0, 0, 0>', the code is invalid
9350 because there are two ways to unify base classes of S<0, 1, 2>
9351 with S<I, I, I>. If we kept the already deduced knowledge, we
9352 would reject the possibility I=1. */
9353 copy_of_targs = make_tree_vec (TREE_VEC_LENGTH (targs));
9355 /* If unification failed, we're done. */
9356 if (unify (tparms, copy_of_targs, CLASSTYPE_TI_ARGS (parm),
9357 CLASSTYPE_TI_ARGS (arg), UNIFY_ALLOW_NONE))
9363 /* Subroutine of get_template_base. RVAL, if non-NULL, is a base we
9364 have already discovered to be satisfactory. ARG_BINFO is the binfo
9365 for the base class of ARG that we are currently examining. */
9368 get_template_base_recursive (tree tparms,
9377 tree arg = BINFO_TYPE (arg_binfo);
9379 if (!(flags & GTB_IGNORE_TYPE))
9381 tree r = try_class_unification (tparms, targs,
9384 /* If there is more than one satisfactory baseclass, then:
9388 If they yield more than one possible deduced A, the type
9392 if (r && rval && !same_type_p (r, rval))
9393 return error_mark_node;
9398 binfos = BINFO_BASETYPES (arg_binfo);
9399 n_baselinks = binfos ? TREE_VEC_LENGTH (binfos) : 0;
9401 /* Process base types. */
9402 for (i = 0; i < n_baselinks; i++)
9404 tree base_binfo = TREE_VEC_ELT (binfos, i);
9407 /* Skip this base, if we've already seen it. */
9408 if (BINFO_MARKED (base_binfo))
9412 (flags & GTB_VIA_VIRTUAL) || BINFO_VIRTUAL_P (base_binfo);
9414 /* When searching for a non-virtual, we cannot mark virtually
9417 BINFO_MARKED (base_binfo) = 1;
9419 rval = get_template_base_recursive (tparms, targs,
9423 GTB_VIA_VIRTUAL * this_virtual);
9425 /* If we discovered more than one matching base class, we can
9427 if (rval == error_mark_node)
9428 return error_mark_node;
9434 /* Given a template type PARM and a class type ARG, find the unique
9435 base type in ARG that is an instance of PARM. We do not examine
9436 ARG itself; only its base-classes. If there is no appropriate base
9437 class, return NULL_TREE. If there is more than one, return
9438 error_mark_node. PARM may be the type of a partial specialization,
9439 as well as a plain template type. Used by unify. */
9442 get_template_base (tree tparms, tree targs, tree parm, tree arg)
9447 my_friendly_assert (IS_AGGR_TYPE_CODE (TREE_CODE (arg)), 92);
9449 arg_binfo = TYPE_BINFO (complete_type (arg));
9450 rval = get_template_base_recursive (tparms, targs,
9455 /* Since get_template_base_recursive marks the bases classes, we
9456 must unmark them here. */
9457 dfs_walk (arg_binfo, dfs_unmark, markedp, 0);
9462 /* Returns the level of DECL, which declares a template parameter. */
9465 template_decl_level (tree decl)
9467 switch (TREE_CODE (decl))
9471 return TEMPLATE_TYPE_LEVEL (TREE_TYPE (decl));
9474 return TEMPLATE_PARM_LEVEL (DECL_INITIAL (decl));
9482 /* Decide whether ARG can be unified with PARM, considering only the
9483 cv-qualifiers of each type, given STRICT as documented for unify.
9484 Returns nonzero iff the unification is OK on that basis. */
9487 check_cv_quals_for_unify (int strict, tree arg, tree parm)
9489 int arg_quals = cp_type_quals (arg);
9490 int parm_quals = cp_type_quals (parm);
9492 if (TREE_CODE (parm) == TEMPLATE_TYPE_PARM
9493 && !(strict & UNIFY_ALLOW_OUTER_MORE_CV_QUAL))
9495 /* Although a CVR qualifier is ignored when being applied to a
9496 substituted template parameter ([8.3.2]/1 for example), that
9497 does not apply during deduction [14.8.2.4]/1, (even though
9498 that is not explicitly mentioned, [14.8.2.4]/9 indicates
9499 this). Except when we're allowing additional CV qualifiers
9500 at the outer level [14.8.2.1]/3,1st bullet. */
9501 if ((TREE_CODE (arg) == REFERENCE_TYPE
9502 || TREE_CODE (arg) == FUNCTION_TYPE
9503 || TREE_CODE (arg) == METHOD_TYPE)
9504 && (parm_quals & (TYPE_QUAL_CONST | TYPE_QUAL_VOLATILE)))
9507 if ((!POINTER_TYPE_P (arg) && TREE_CODE (arg) != TEMPLATE_TYPE_PARM)
9508 && (parm_quals & TYPE_QUAL_RESTRICT))
9512 if (!(strict & (UNIFY_ALLOW_MORE_CV_QUAL | UNIFY_ALLOW_OUTER_MORE_CV_QUAL))
9513 && (arg_quals & parm_quals) != parm_quals)
9516 if (!(strict & (UNIFY_ALLOW_LESS_CV_QUAL | UNIFY_ALLOW_OUTER_LESS_CV_QUAL))
9517 && (parm_quals & arg_quals) != arg_quals)
9523 /* Takes parameters as for type_unification. Returns 0 if the
9524 type deduction succeeds, 1 otherwise. The parameter STRICT is a
9525 bitwise or of the following flags:
9528 Require an exact match between PARM and ARG.
9529 UNIFY_ALLOW_MORE_CV_QUAL:
9530 Allow the deduced ARG to be more cv-qualified (by qualification
9531 conversion) than ARG.
9532 UNIFY_ALLOW_LESS_CV_QUAL:
9533 Allow the deduced ARG to be less cv-qualified than ARG.
9534 UNIFY_ALLOW_DERIVED:
9535 Allow the deduced ARG to be a template base class of ARG,
9536 or a pointer to a template base class of the type pointed to by
9538 UNIFY_ALLOW_INTEGER:
9539 Allow any integral type to be deduced. See the TEMPLATE_PARM_INDEX
9540 case for more information.
9541 UNIFY_ALLOW_OUTER_LEVEL:
9542 This is the outermost level of a deduction. Used to determine validity
9543 of qualification conversions. A valid qualification conversion must
9544 have const qualified pointers leading up to the inner type which
9545 requires additional CV quals, except at the outer level, where const
9546 is not required [conv.qual]. It would be normal to set this flag in
9547 addition to setting UNIFY_ALLOW_MORE_CV_QUAL.
9548 UNIFY_ALLOW_OUTER_MORE_CV_QUAL:
9549 This is the outermost level of a deduction, and PARM can be more CV
9550 qualified at this point.
9551 UNIFY_ALLOW_OUTER_LESS_CV_QUAL:
9552 This is the outermost level of a deduction, and PARM can be less CV
9553 qualified at this point.
9554 UNIFY_ALLOW_MAX_CORRECTION:
9555 This is an INTEGER_TYPE's maximum value. Used if the range may
9556 have been derived from a size specification, such as an array size.
9557 If the size was given by a nontype template parameter N, the maximum
9558 value will have the form N-1. The flag says that we can (and indeed
9559 must) unify N with (ARG + 1), an exception to the normal rules on
9563 unify (tree tparms, tree targs, tree parm, tree arg, int strict)
9568 int strict_in = strict;
9570 /* I don't think this will do the right thing with respect to types.
9571 But the only case I've seen it in so far has been array bounds, where
9572 signedness is the only information lost, and I think that will be
9574 while (TREE_CODE (parm) == NOP_EXPR)
9575 parm = TREE_OPERAND (parm, 0);
9577 if (arg == error_mark_node)
9579 if (arg == unknown_type_node)
9580 /* We can't deduce anything from this, but we might get all the
9581 template args from other function args. */
9584 /* If PARM uses template parameters, then we can't bail out here,
9585 even if ARG == PARM, since we won't record unifications for the
9586 template parameters. We might need them if we're trying to
9587 figure out which of two things is more specialized. */
9588 if (arg == parm && !uses_template_parms (parm))
9591 /* Immediately reject some pairs that won't unify because of
9592 cv-qualification mismatches. */
9593 if (TREE_CODE (arg) == TREE_CODE (parm)
9595 /* It is the elements of the array which hold the cv quals of an array
9596 type, and the elements might be template type parms. We'll check
9598 && TREE_CODE (arg) != ARRAY_TYPE
9599 /* We check the cv-qualifiers when unifying with template type
9600 parameters below. We want to allow ARG `const T' to unify with
9601 PARM `T' for example, when computing which of two templates
9602 is more specialized, for example. */
9603 && TREE_CODE (arg) != TEMPLATE_TYPE_PARM
9604 && !check_cv_quals_for_unify (strict_in, arg, parm))
9607 if (!(strict & UNIFY_ALLOW_OUTER_LEVEL)
9608 && TYPE_P (parm) && !CP_TYPE_CONST_P (parm))
9609 strict &= ~UNIFY_ALLOW_MORE_CV_QUAL;
9610 strict &= ~UNIFY_ALLOW_OUTER_LEVEL;
9611 strict &= ~UNIFY_ALLOW_DERIVED;
9612 strict &= ~UNIFY_ALLOW_OUTER_MORE_CV_QUAL;
9613 strict &= ~UNIFY_ALLOW_OUTER_LESS_CV_QUAL;
9614 strict &= ~UNIFY_ALLOW_MAX_CORRECTION;
9616 switch (TREE_CODE (parm))
9620 case UNBOUND_CLASS_TEMPLATE:
9621 /* In a type which contains a nested-name-specifier, template
9622 argument values cannot be deduced for template parameters used
9623 within the nested-name-specifier. */
9626 case TEMPLATE_TYPE_PARM:
9627 case TEMPLATE_TEMPLATE_PARM:
9628 case BOUND_TEMPLATE_TEMPLATE_PARM:
9629 tparm = TREE_VALUE (TREE_VEC_ELT (tparms, 0));
9631 if (TEMPLATE_TYPE_LEVEL (parm)
9632 != template_decl_level (tparm))
9633 /* The PARM is not one we're trying to unify. Just check
9634 to see if it matches ARG. */
9635 return (TREE_CODE (arg) == TREE_CODE (parm)
9636 && same_type_p (parm, arg)) ? 0 : 1;
9637 idx = TEMPLATE_TYPE_IDX (parm);
9638 targ = TREE_VEC_ELT (targs, idx);
9639 tparm = TREE_VALUE (TREE_VEC_ELT (tparms, idx));
9641 /* Check for mixed types and values. */
9642 if ((TREE_CODE (parm) == TEMPLATE_TYPE_PARM
9643 && TREE_CODE (tparm) != TYPE_DECL)
9644 || (TREE_CODE (parm) == TEMPLATE_TEMPLATE_PARM
9645 && TREE_CODE (tparm) != TEMPLATE_DECL))
9648 if (TREE_CODE (parm) == BOUND_TEMPLATE_TEMPLATE_PARM)
9650 /* ARG must be constructed from a template class or a template
9651 template parameter. */
9652 if (TREE_CODE (arg) != BOUND_TEMPLATE_TEMPLATE_PARM
9653 && (TREE_CODE (arg) != RECORD_TYPE || !CLASSTYPE_TEMPLATE_INFO (arg)))
9657 tree parmtmpl = TYPE_TI_TEMPLATE (parm);
9658 tree parmvec = TYPE_TI_ARGS (parm);
9659 tree argvec = TYPE_TI_ARGS (arg);
9661 = DECL_INNERMOST_TEMPLATE_PARMS (TYPE_TI_TEMPLATE (arg));
9664 /* The parameter and argument roles have to be switched here
9665 in order to handle default arguments properly. For example,
9666 template<template <class> class TT> void f(TT<int>)
9667 should be able to accept vector<int> which comes from
9668 template <class T, class Allocator = allocator>
9671 if (coerce_template_parms (argtmplvec, parmvec, parmtmpl, 0, 1)
9675 /* Deduce arguments T, i from TT<T> or TT<i>.
9676 We check each element of PARMVEC and ARGVEC individually
9677 rather than the whole TREE_VEC since they can have
9678 different number of elements. */
9680 for (i = 0; i < TREE_VEC_LENGTH (parmvec); ++i)
9682 tree t = TREE_VEC_ELT (parmvec, i);
9684 if (unify (tparms, targs, t,
9685 TREE_VEC_ELT (argvec, i),
9690 arg = TYPE_TI_TEMPLATE (arg);
9692 /* Fall through to deduce template name. */
9695 if (TREE_CODE (parm) == TEMPLATE_TEMPLATE_PARM
9696 || TREE_CODE (parm) == BOUND_TEMPLATE_TEMPLATE_PARM)
9698 /* Deduce template name TT from TT, TT<>, TT<T> and TT<i>. */
9700 /* Simple cases: Value already set, does match or doesn't. */
9701 if (targ != NULL_TREE && template_args_equal (targ, arg))
9708 /* If PARM is `const T' and ARG is only `int', we don't have
9709 a match unless we are allowing additional qualification.
9710 If ARG is `const int' and PARM is just `T' that's OK;
9711 that binds `const int' to `T'. */
9712 if (!check_cv_quals_for_unify (strict_in | UNIFY_ALLOW_LESS_CV_QUAL,
9716 /* Consider the case where ARG is `const volatile int' and
9717 PARM is `const T'. Then, T should be `volatile int'. */
9718 arg = cp_build_qualified_type_real
9719 (arg, cp_type_quals (arg) & ~cp_type_quals (parm), tf_none);
9720 if (arg == error_mark_node)
9723 /* Simple cases: Value already set, does match or doesn't. */
9724 if (targ != NULL_TREE && same_type_p (targ, arg))
9729 /* Make sure that ARG is not a variable-sized array. (Note
9730 that were talking about variable-sized arrays (like
9731 `int[n]'), rather than arrays of unknown size (like
9732 `int[]').) We'll get very confused by such a type since
9733 the bound of the array will not be computable in an
9734 instantiation. Besides, such types are not allowed in
9735 ISO C++, so we can do as we please here. */
9736 if (variably_modified_type_p (arg, NULL_TREE))
9740 TREE_VEC_ELT (targs, idx) = arg;
9743 case TEMPLATE_PARM_INDEX:
9744 tparm = TREE_VALUE (TREE_VEC_ELT (tparms, 0));
9746 if (TEMPLATE_PARM_LEVEL (parm)
9747 != template_decl_level (tparm))
9748 /* The PARM is not one we're trying to unify. Just check
9749 to see if it matches ARG. */
9750 return !(TREE_CODE (arg) == TREE_CODE (parm)
9751 && cp_tree_equal (parm, arg));
9753 idx = TEMPLATE_PARM_IDX (parm);
9754 targ = TREE_VEC_ELT (targs, idx);
9757 return !cp_tree_equal (targ, arg);
9759 /* [temp.deduct.type] If, in the declaration of a function template
9760 with a non-type template-parameter, the non-type
9761 template-parameter is used in an expression in the function
9762 parameter-list and, if the corresponding template-argument is
9763 deduced, the template-argument type shall match the type of the
9764 template-parameter exactly, except that a template-argument
9765 deduced from an array bound may be of any integral type.
9766 The non-type parameter might use already deduced type parameters. */
9767 tparm = tsubst (TREE_TYPE (parm), targs, 0, NULL_TREE);
9768 if (!TREE_TYPE (arg))
9769 /* Template-parameter dependent expression. Just accept it for now.
9770 It will later be processed in convert_template_argument. */
9772 else if (same_type_p (TREE_TYPE (arg), tparm))
9774 else if ((strict & UNIFY_ALLOW_INTEGER)
9775 && (TREE_CODE (tparm) == INTEGER_TYPE
9776 || TREE_CODE (tparm) == BOOLEAN_TYPE))
9778 else if (uses_template_parms (tparm))
9779 /* We haven't deduced the type of this parameter yet. Try again
9785 TREE_VEC_ELT (targs, idx) = arg;
9790 /* A pointer-to-member constant can be unified only with
9791 another constant. */
9792 if (TREE_CODE (arg) != PTRMEM_CST)
9795 /* Just unify the class member. It would be useless (and possibly
9796 wrong, depending on the strict flags) to unify also
9797 PTRMEM_CST_CLASS, because we want to be sure that both parm and
9798 arg refer to the same variable, even if through different
9799 classes. For instance:
9801 struct A { int x; };
9804 Unification of &A::x and &B::x must succeed. */
9805 return unify (tparms, targs, PTRMEM_CST_MEMBER (parm),
9806 PTRMEM_CST_MEMBER (arg), strict);
9811 if (TREE_CODE (arg) != POINTER_TYPE)
9814 /* [temp.deduct.call]
9816 A can be another pointer or pointer to member type that can
9817 be converted to the deduced A via a qualification
9818 conversion (_conv.qual_).
9820 We pass down STRICT here rather than UNIFY_ALLOW_NONE.
9821 This will allow for additional cv-qualification of the
9822 pointed-to types if appropriate. */
9824 if (TREE_CODE (TREE_TYPE (arg)) == RECORD_TYPE)
9825 /* The derived-to-base conversion only persists through one
9826 level of pointers. */
9827 strict |= (strict_in & UNIFY_ALLOW_DERIVED);
9829 return unify (tparms, targs, TREE_TYPE (parm),
9830 TREE_TYPE (arg), strict);
9833 case REFERENCE_TYPE:
9834 if (TREE_CODE (arg) != REFERENCE_TYPE)
9836 return unify (tparms, targs, TREE_TYPE (parm), TREE_TYPE (arg),
9837 strict & UNIFY_ALLOW_MORE_CV_QUAL);
9840 if (TREE_CODE (arg) != ARRAY_TYPE)
9842 if ((TYPE_DOMAIN (parm) == NULL_TREE)
9843 != (TYPE_DOMAIN (arg) == NULL_TREE))
9845 if (TYPE_DOMAIN (parm) != NULL_TREE
9846 && unify (tparms, targs, TYPE_DOMAIN (parm),
9847 TYPE_DOMAIN (arg), UNIFY_ALLOW_NONE) != 0)
9849 return unify (tparms, targs, TREE_TYPE (parm), TREE_TYPE (arg),
9850 strict & UNIFY_ALLOW_MORE_CV_QUAL);
9858 if (TREE_CODE (arg) != TREE_CODE (parm))
9861 if (TREE_CODE (parm) == INTEGER_TYPE
9862 && TREE_CODE (TYPE_MAX_VALUE (parm)) != INTEGER_CST)
9864 if (TYPE_MIN_VALUE (parm) && TYPE_MIN_VALUE (arg)
9865 && unify (tparms, targs, TYPE_MIN_VALUE (parm),
9866 TYPE_MIN_VALUE (arg), UNIFY_ALLOW_INTEGER))
9868 if (TYPE_MAX_VALUE (parm) && TYPE_MAX_VALUE (arg)
9869 && unify (tparms, targs, TYPE_MAX_VALUE (parm),
9870 TYPE_MAX_VALUE (arg),
9871 UNIFY_ALLOW_INTEGER | UNIFY_ALLOW_MAX_CORRECTION))
9874 /* We have already checked cv-qualification at the top of the
9876 else if (!same_type_ignoring_top_level_qualifiers_p (arg, parm))
9879 /* As far as unification is concerned, this wins. Later checks
9880 will invalidate it if necessary. */
9883 /* Types INTEGER_CST and MINUS_EXPR can come from array bounds. */
9884 /* Type INTEGER_CST can come from ordinary constant template args. */
9886 while (TREE_CODE (arg) == NOP_EXPR)
9887 arg = TREE_OPERAND (arg, 0);
9889 if (TREE_CODE (arg) != INTEGER_CST)
9891 return !tree_int_cst_equal (parm, arg);
9896 if (TREE_CODE (arg) != TREE_VEC)
9898 if (TREE_VEC_LENGTH (parm) != TREE_VEC_LENGTH (arg))
9900 for (i = 0; i < TREE_VEC_LENGTH (parm); ++i)
9901 if (unify (tparms, targs,
9902 TREE_VEC_ELT (parm, i), TREE_VEC_ELT (arg, i),
9910 if (TREE_CODE (arg) != TREE_CODE (parm))
9913 if (TYPE_PTRMEMFUNC_P (parm))
9915 if (!TYPE_PTRMEMFUNC_P (arg))
9918 return unify (tparms, targs,
9919 TYPE_PTRMEMFUNC_FN_TYPE (parm),
9920 TYPE_PTRMEMFUNC_FN_TYPE (arg),
9924 if (CLASSTYPE_TEMPLATE_INFO (parm))
9928 if (strict_in & UNIFY_ALLOW_DERIVED)
9930 /* First, we try to unify the PARM and ARG directly. */
9931 t = try_class_unification (tparms, targs,
9936 /* Fallback to the special case allowed in
9939 If P is a class, and P has the form
9940 template-id, then A can be a derived class of
9941 the deduced A. Likewise, if P is a pointer to
9942 a class of the form template-id, A can be a
9943 pointer to a derived class pointed to by the
9945 t = get_template_base (tparms, targs,
9948 if (! t || t == error_mark_node)
9952 else if (CLASSTYPE_TEMPLATE_INFO (arg)
9953 && (CLASSTYPE_TI_TEMPLATE (parm)
9954 == CLASSTYPE_TI_TEMPLATE (arg)))
9955 /* Perhaps PARM is something like S<U> and ARG is S<int>.
9956 Then, we should unify `int' and `U'. */
9959 /* There's no chance of unification succeeding. */
9962 return unify (tparms, targs, CLASSTYPE_TI_ARGS (parm),
9963 CLASSTYPE_TI_ARGS (t), UNIFY_ALLOW_NONE);
9965 else if (!same_type_ignoring_top_level_qualifiers_p (parm, arg))
9971 if (TREE_CODE (arg) != TREE_CODE (parm))
9974 if (unify (tparms, targs, TREE_TYPE (parm),
9975 TREE_TYPE (arg), UNIFY_ALLOW_NONE))
9977 return type_unification_real (tparms, targs, TYPE_ARG_TYPES (parm),
9978 TYPE_ARG_TYPES (arg), 1,
9979 DEDUCE_EXACT, 0, -1);
9982 if (TREE_CODE (arg) != OFFSET_TYPE)
9984 if (unify (tparms, targs, TYPE_OFFSET_BASETYPE (parm),
9985 TYPE_OFFSET_BASETYPE (arg), UNIFY_ALLOW_NONE))
9987 return unify (tparms, targs, TREE_TYPE (parm), TREE_TYPE (arg),
9991 if (DECL_TEMPLATE_PARM_P (parm))
9992 return unify (tparms, targs, DECL_INITIAL (parm), arg, strict);
9993 if (arg != decl_constant_value (parm))
9999 /* Matched cases are handled by the ARG == PARM test above. */
10003 if (tree_int_cst_equal (TREE_OPERAND (parm, 1), integer_one_node)
10004 && (strict_in & UNIFY_ALLOW_MAX_CORRECTION))
10006 /* We handle this case specially, since it comes up with
10007 arrays. In particular, something like:
10009 template <int N> void f(int (&x)[N]);
10011 Here, we are trying to unify the range type, which
10012 looks like [0 ... (N - 1)]. */
10014 t1 = TREE_OPERAND (parm, 0);
10015 t2 = TREE_OPERAND (parm, 1);
10017 t = fold (build (PLUS_EXPR, integer_type_node, arg, t2));
10019 return unify (tparms, targs, t1, t, strict);
10021 /* Else fall through. */
10024 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (parm))))
10027 /* We're looking at an expression. This can happen with
10031 void foo(S<I>, S<I + 2>);
10033 This is a "nondeduced context":
10037 The nondeduced contexts are:
10039 --A type that is a template-id in which one or more of
10040 the template-arguments is an expression that references
10041 a template-parameter.
10043 In these cases, we assume deduction succeeded, but don't
10044 actually infer any unifications. */
10046 if (!uses_template_parms (parm)
10047 && !template_args_equal (parm, arg))
10053 sorry ("use of `%s' in template type unification",
10054 tree_code_name [(int) TREE_CODE (parm)]);
10060 /* Called if RESULT is explicitly instantiated, or is a member of an
10061 explicitly instantiated class, or if using -frepo and the
10062 instantiation of RESULT has been assigned to this file. */
10065 mark_decl_instantiated (tree result, int extern_p)
10067 SET_DECL_EXPLICIT_INSTANTIATION (result);
10069 /* If this entity has already been written out, it's too late to
10070 make any modifications. */
10071 if (TREE_ASM_WRITTEN (result))
10074 if (TREE_CODE (result) != FUNCTION_DECL)
10075 /* The TREE_PUBLIC flag for function declarations will have been
10076 set correctly by tsubst. */
10077 TREE_PUBLIC (result) = 1;
10079 /* This might have been set by an earlier implicit instantiation. */
10080 DECL_COMDAT (result) = 0;
10084 DECL_INTERFACE_KNOWN (result) = 1;
10085 DECL_NOT_REALLY_EXTERN (result) = 1;
10087 /* Always make artificials weak. */
10088 if (DECL_ARTIFICIAL (result) && flag_weak)
10089 comdat_linkage (result);
10090 /* For WIN32 we also want to put explicit instantiations in
10091 linkonce sections. */
10092 else if (TREE_PUBLIC (result))
10093 maybe_make_one_only (result);
10097 /* Given two function templates PAT1 and PAT2, return:
10099 DEDUCE should be DEDUCE_EXACT or DEDUCE_ORDER.
10101 1 if PAT1 is more specialized than PAT2 as described in [temp.func.order].
10102 -1 if PAT2 is more specialized than PAT1.
10103 0 if neither is more specialized.
10105 LEN is passed through to fn_type_unification. */
10108 more_specialized (tree pat1, tree pat2, int deduce, int len)
10113 /* If template argument deduction succeeds, we substitute the
10114 resulting arguments into non-deduced contexts. While doing that,
10115 we must be aware that we may encounter dependent types. */
10116 ++processing_template_decl;
10117 targs = get_bindings_real (pat1, DECL_TEMPLATE_RESULT (pat2),
10118 NULL_TREE, 0, deduce, len);
10122 targs = get_bindings_real (pat2, DECL_TEMPLATE_RESULT (pat1),
10123 NULL_TREE, 0, deduce, len);
10126 --processing_template_decl;
10131 /* Given two class template specialization list nodes PAT1 and PAT2, return:
10133 1 if PAT1 is more specialized than PAT2 as described in [temp.class.order].
10134 -1 if PAT2 is more specialized than PAT1.
10135 0 if neither is more specialized.
10137 FULL_ARGS is the full set of template arguments that triggers this
10138 partial ordering. */
10141 more_specialized_class (tree pat1, tree pat2, tree full_args)
10146 /* Just like what happens for functions, if we are ordering between
10147 different class template specializations, we may encounter dependent
10148 types in the arguments, and we need our dependency check functions
10149 to behave correctly. */
10150 ++processing_template_decl;
10151 targs = get_class_bindings (TREE_VALUE (pat1), TREE_PURPOSE (pat1),
10152 add_outermost_template_args (full_args, TREE_PURPOSE (pat2)));
10156 targs = get_class_bindings (TREE_VALUE (pat2), TREE_PURPOSE (pat2),
10157 add_outermost_template_args (full_args, TREE_PURPOSE (pat1)));
10160 --processing_template_decl;
10165 /* Return the template arguments that will produce the function signature
10166 DECL from the function template FN, with the explicit template
10167 arguments EXPLICIT_ARGS. If CHECK_RETTYPE is 1, the return type must
10168 also match. Return NULL_TREE if no satisfactory arguments could be
10169 found. DEDUCE and LEN are passed through to fn_type_unification. */
10172 get_bindings_real (tree fn,
10174 tree explicit_args,
10179 int ntparms = DECL_NTPARMS (fn);
10180 tree targs = make_tree_vec (ntparms);
10182 tree decl_arg_types;
10185 /* Substitute the explicit template arguments into the type of DECL.
10186 The call to fn_type_unification will handle substitution into the
10188 decl_type = TREE_TYPE (decl);
10189 if (explicit_args && uses_template_parms (decl_type))
10192 tree converted_args;
10194 if (DECL_TEMPLATE_INFO (decl))
10195 tmpl = DECL_TI_TEMPLATE (decl);
10197 /* We can get here for some invalid specializations. */
10201 = (coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl),
10202 explicit_args, NULL_TREE,
10203 tf_none, /*require_all_arguments=*/0));
10204 if (converted_args == error_mark_node)
10207 decl_type = tsubst (decl_type, converted_args, tf_none, NULL_TREE);
10208 if (decl_type == error_mark_node)
10212 decl_arg_types = TYPE_ARG_TYPES (decl_type);
10213 /* Never do unification on the 'this' parameter. */
10214 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl))
10215 decl_arg_types = TREE_CHAIN (decl_arg_types);
10217 i = fn_type_unification (fn, explicit_args, targs,
10219 (check_rettype || DECL_CONV_FN_P (fn)
10220 ? TREE_TYPE (decl_type) : NULL_TREE),
10229 /* For most uses, we want to check the return type. */
10232 get_bindings (tree fn, tree decl, tree explicit_args)
10234 return get_bindings_real (fn, decl, explicit_args, 1, DEDUCE_EXACT, -1);
10237 /* But for resolve_overloaded_unification, we only care about the parameter
10241 get_bindings_overload (tree fn, tree decl, tree explicit_args)
10243 return get_bindings_real (fn, decl, explicit_args, 0, DEDUCE_EXACT, -1);
10246 /* Return the innermost template arguments that, when applied to a
10247 template specialization whose innermost template parameters are
10248 TPARMS, and whose specialization arguments are PARMS, yield the
10251 For example, suppose we have:
10253 template <class T, class U> struct S {};
10254 template <class T> struct S<T*, int> {};
10256 Then, suppose we want to get `S<double*, int>'. The TPARMS will be
10257 {T}, the PARMS will be {T*, int} and the ARGS will be {double*,
10258 int}. The resulting vector will be {double}, indicating that `T'
10259 is bound to `double'. */
10262 get_class_bindings (tree tparms, tree parms, tree args)
10264 int i, ntparms = TREE_VEC_LENGTH (tparms);
10265 tree vec = make_tree_vec (ntparms);
10267 if (unify (tparms, vec, parms, INNERMOST_TEMPLATE_ARGS (args),
10271 for (i = 0; i < ntparms; ++i)
10272 if (! TREE_VEC_ELT (vec, i))
10275 if (verify_class_unification (vec, parms, args))
10281 /* In INSTANTIATIONS is a list of <INSTANTIATION, TEMPLATE> pairs.
10282 Pick the most specialized template, and return the corresponding
10283 instantiation, or if there is no corresponding instantiation, the
10284 template itself. If there is no most specialized template,
10285 error_mark_node is returned. If there are no templates at all,
10286 NULL_TREE is returned. */
10289 most_specialized_instantiation (tree instantiations)
10294 if (!instantiations)
10297 champ = instantiations;
10298 for (fn = TREE_CHAIN (instantiations); fn; fn = TREE_CHAIN (fn))
10300 fate = more_specialized (TREE_VALUE (champ), TREE_VALUE (fn),
10308 fn = TREE_CHAIN (fn);
10310 return error_mark_node;
10316 for (fn = instantiations; fn && fn != champ; fn = TREE_CHAIN (fn))
10318 fate = more_specialized (TREE_VALUE (champ), TREE_VALUE (fn),
10321 return error_mark_node;
10324 return TREE_PURPOSE (champ) ? TREE_PURPOSE (champ) : TREE_VALUE (champ);
10327 /* Return the most specialized of the list of templates in FNS that can
10328 produce an instantiation matching DECL, given the explicit template
10329 arguments EXPLICIT_ARGS. */
10332 most_specialized (tree fns, tree decl, tree explicit_args)
10334 tree candidates = NULL_TREE;
10337 for (fn = fns; fn; fn = TREE_CHAIN (fn))
10339 tree candidate = TREE_VALUE (fn);
10341 args = get_bindings (candidate, decl, explicit_args);
10343 candidates = tree_cons (NULL_TREE, candidate, candidates);
10346 return most_specialized_instantiation (candidates);
10349 /* If DECL is a specialization of some template, return the most
10350 general such template. Otherwise, returns NULL_TREE.
10352 For example, given:
10354 template <class T> struct S { template <class U> void f(U); };
10356 if TMPL is `template <class U> void S<int>::f(U)' this will return
10357 the full template. This function will not trace past partial
10358 specializations, however. For example, given in addition:
10360 template <class T> struct S<T*> { template <class U> void f(U); };
10362 if TMPL is `template <class U> void S<int*>::f(U)' this will return
10363 `template <class T> template <class U> S<T*>::f(U)'. */
10366 most_general_template (tree decl)
10368 /* If DECL is a FUNCTION_DECL, find the TEMPLATE_DECL of which it is
10369 an immediate specialization. */
10370 if (TREE_CODE (decl) == FUNCTION_DECL)
10372 if (DECL_TEMPLATE_INFO (decl)) {
10373 decl = DECL_TI_TEMPLATE (decl);
10375 /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE for a
10376 template friend. */
10377 if (TREE_CODE (decl) != TEMPLATE_DECL)
10383 /* Look for more and more general templates. */
10384 while (DECL_TEMPLATE_INFO (decl))
10386 /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE in some cases.
10387 (See cp-tree.h for details.) */
10388 if (TREE_CODE (DECL_TI_TEMPLATE (decl)) != TEMPLATE_DECL)
10391 if (CLASS_TYPE_P (TREE_TYPE (decl))
10392 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl)))
10395 /* Stop if we run into an explicitly specialized class template. */
10396 if (!DECL_NAMESPACE_SCOPE_P (decl)
10397 && DECL_CONTEXT (decl)
10398 && CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (decl)))
10401 decl = DECL_TI_TEMPLATE (decl);
10407 /* Return the most specialized of the class template specializations
10408 of TMPL which can produce an instantiation matching ARGS, or
10409 error_mark_node if the choice is ambiguous. */
10412 most_specialized_class (tree tmpl, tree args)
10414 tree list = NULL_TREE;
10419 tmpl = most_general_template (tmpl);
10420 for (t = DECL_TEMPLATE_SPECIALIZATIONS (tmpl); t; t = TREE_CHAIN (t))
10423 = get_class_bindings (TREE_VALUE (t), TREE_PURPOSE (t), args);
10426 list = tree_cons (TREE_PURPOSE (t), TREE_VALUE (t), list);
10427 TREE_TYPE (list) = TREE_TYPE (t);
10436 t = TREE_CHAIN (t);
10437 for (; t; t = TREE_CHAIN (t))
10439 fate = more_specialized_class (champ, t, args);
10446 t = TREE_CHAIN (t);
10448 return error_mark_node;
10454 for (t = list; t && t != champ; t = TREE_CHAIN (t))
10456 fate = more_specialized_class (champ, t, args);
10458 return error_mark_node;
10464 /* Explicitly instantiate DECL. */
10467 do_decl_instantiation (tree decl, tree storage)
10469 tree result = NULL_TREE;
10473 /* An error occurred, for which grokdeclarator has already issued
10474 an appropriate message. */
10476 else if (! DECL_LANG_SPECIFIC (decl))
10478 error ("explicit instantiation of non-template `%#D'", decl);
10481 else if (TREE_CODE (decl) == VAR_DECL)
10483 /* There is an asymmetry here in the way VAR_DECLs and
10484 FUNCTION_DECLs are handled by grokdeclarator. In the case of
10485 the latter, the DECL we get back will be marked as a
10486 template instantiation, and the appropriate
10487 DECL_TEMPLATE_INFO will be set up. This does not happen for
10488 VAR_DECLs so we do the lookup here. Probably, grokdeclarator
10489 should handle VAR_DECLs as it currently handles
10491 result = lookup_field (DECL_CONTEXT (decl), DECL_NAME (decl), 0, false);
10492 if (!result || TREE_CODE (result) != VAR_DECL)
10494 error ("no matching template for `%D' found", decl);
10498 else if (TREE_CODE (decl) != FUNCTION_DECL)
10500 error ("explicit instantiation of `%#D'", decl);
10506 /* Check for various error cases. Note that if the explicit
10507 instantiation is valid the RESULT will currently be marked as an
10508 *implicit* instantiation; DECL_EXPLICIT_INSTANTIATION is not set
10509 until we get here. */
10511 if (DECL_TEMPLATE_SPECIALIZATION (result))
10513 /* DR 259 [temp.spec].
10515 Both an explicit instantiation and a declaration of an explicit
10516 specialization shall not appear in a program unless the explicit
10517 instantiation follows a declaration of the explicit specialization.
10519 For a given set of template parameters, if an explicit
10520 instantiation of a template appears after a declaration of an
10521 explicit specialization for that template, the explicit
10522 instantiation has no effect. */
10525 else if (DECL_EXPLICIT_INSTANTIATION (result))
10529 No program shall explicitly instantiate any template more
10532 We check DECL_INTERFACE_KNOWN so as not to complain when the first
10533 instantiation was `extern' and the second is not, and EXTERN_P for
10534 the opposite case. If -frepo, chances are we already got marked
10535 as an explicit instantiation because of the repo file. */
10536 if (DECL_INTERFACE_KNOWN (result) && !extern_p && !flag_use_repository)
10537 pedwarn ("duplicate explicit instantiation of `%#D'", result);
10539 /* If we've already instantiated the template, just return now. */
10540 if (DECL_INTERFACE_KNOWN (result))
10543 else if (!DECL_IMPLICIT_INSTANTIATION (result))
10545 error ("no matching template for `%D' found", result);
10548 else if (!DECL_TEMPLATE_INFO (result))
10550 pedwarn ("explicit instantiation of non-template `%#D'", result);
10554 if (storage == NULL_TREE)
10556 else if (storage == ridpointers[(int) RID_EXTERN])
10558 if (pedantic && !in_system_header)
10559 pedwarn ("ISO C++ forbids the use of `extern' on explicit instantiations");
10563 error ("storage class `%D' applied to template instantiation",
10566 mark_decl_instantiated (result, extern_p);
10567 repo_template_instantiated (result, extern_p);
10569 instantiate_decl (result, /*defer_ok=*/1, /*undefined_ok=*/0);
10573 mark_class_instantiated (tree t, int extern_p)
10575 SET_CLASSTYPE_EXPLICIT_INSTANTIATION (t);
10576 SET_CLASSTYPE_INTERFACE_KNOWN (t);
10577 CLASSTYPE_INTERFACE_ONLY (t) = extern_p;
10578 TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (t)) = extern_p;
10581 CLASSTYPE_DEBUG_REQUESTED (t) = 1;
10582 rest_of_type_compilation (t, 1);
10586 /* Called from do_type_instantiation through binding_table_foreach to
10587 do recursive instantiation for the type bound in ENTRY. */
10589 bt_instantiate_type_proc (binding_entry entry, void *data)
10591 tree storage = *(tree *) data;
10593 if (IS_AGGR_TYPE (entry->type)
10594 && !uses_template_parms (CLASSTYPE_TI_ARGS (entry->type)))
10595 do_type_instantiation (TYPE_MAIN_DECL (entry->type), storage, 0);
10598 /* Called from do_type_instantiation to instantiate a member
10599 (a member function or a static member variable) of an
10600 explicitly instantiated class template. */
10602 instantiate_class_member (tree decl, int extern_p)
10604 mark_decl_instantiated (decl, extern_p);
10605 repo_template_instantiated (decl, extern_p);
10607 instantiate_decl (decl, /*defer_ok=*/1, /* undefined_ok=*/1);
10610 /* Perform an explicit instantiation of template class T. STORAGE, if
10611 non-null, is the RID for extern, inline or static. COMPLAIN is
10612 nonzero if this is called from the parser, zero if called recursively,
10613 since the standard is unclear (as detailed below). */
10616 do_type_instantiation (tree t, tree storage, tsubst_flags_t complain)
10621 int previous_instantiation_extern_p = 0;
10623 if (TREE_CODE (t) == TYPE_DECL)
10626 if (! CLASS_TYPE_P (t) || ! CLASSTYPE_TEMPLATE_INFO (t))
10628 error ("explicit instantiation of non-template type `%T'", t);
10634 if (!COMPLETE_TYPE_P (t))
10636 if (complain & tf_error)
10637 error ("explicit instantiation of `%#T' before definition of template",
10642 if (storage != NULL_TREE)
10644 if (pedantic && !in_system_header)
10645 pedwarn("ISO C++ forbids the use of `%E' on explicit instantiations",
10648 if (storage == ridpointers[(int) RID_INLINE])
10650 else if (storage == ridpointers[(int) RID_EXTERN])
10652 else if (storage == ridpointers[(int) RID_STATIC])
10656 error ("storage class `%D' applied to template instantiation",
10662 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (t))
10664 /* DR 259 [temp.spec].
10666 Both an explicit instantiation and a declaration of an explicit
10667 specialization shall not appear in a program unless the explicit
10668 instantiation follows a declaration of the explicit specialization.
10670 For a given set of template parameters, if an explicit
10671 instantiation of a template appears after a declaration of an
10672 explicit specialization for that template, the explicit
10673 instantiation has no effect. */
10676 else if (CLASSTYPE_EXPLICIT_INSTANTIATION (t))
10680 No program shall explicitly instantiate any template more
10683 If PREVIOUS_INSTANTIATION_EXTERN_P, then the first explicit
10684 instantiation was `extern'. If EXTERN_P then the second is.
10685 If -frepo, chances are we already got marked as an explicit
10686 instantiation because of the repo file. All these cases are
10689 previous_instantiation_extern_p = CLASSTYPE_INTERFACE_ONLY (t);
10691 if (!previous_instantiation_extern_p && !extern_p
10692 && !flag_use_repository
10693 && (complain & tf_error))
10694 pedwarn ("duplicate explicit instantiation of `%#T'", t);
10696 /* If we've already instantiated the template, just return now. */
10697 if (!CLASSTYPE_INTERFACE_ONLY (t))
10701 mark_class_instantiated (t, extern_p);
10702 repo_template_instantiated (t, extern_p);
10710 /* In contrast to implicit instantiation, where only the
10711 declarations, and not the definitions, of members are
10712 instantiated, we have here:
10716 The explicit instantiation of a class template specialization
10717 implies the instantiation of all of its members not
10718 previously explicitly specialized in the translation unit
10719 containing the explicit instantiation.
10721 Of course, we can't instantiate member template classes, since
10722 we don't have any arguments for them. Note that the standard
10723 is unclear on whether the instantiation of the members are
10724 *explicit* instantiations or not. However, the most natural
10725 interpretation is that it should be an explicit instantiation. */
10728 for (tmp = TYPE_METHODS (t); tmp; tmp = TREE_CHAIN (tmp))
10729 if (TREE_CODE (tmp) == FUNCTION_DECL
10730 && DECL_TEMPLATE_INSTANTIATION (tmp))
10731 instantiate_class_member (tmp, extern_p);
10733 for (tmp = TYPE_FIELDS (t); tmp; tmp = TREE_CHAIN (tmp))
10734 if (TREE_CODE (tmp) == VAR_DECL && DECL_TEMPLATE_INSTANTIATION (tmp))
10735 instantiate_class_member (tmp, extern_p);
10737 if (CLASSTYPE_NESTED_UTDS (t))
10738 binding_table_foreach (CLASSTYPE_NESTED_UTDS (t),
10739 bt_instantiate_type_proc, &storage);
10743 /* Given a function DECL, which is a specialization of TMPL, modify
10744 DECL to be a re-instantiation of TMPL with the same template
10745 arguments. TMPL should be the template into which tsubst'ing
10746 should occur for DECL, not the most general template.
10748 One reason for doing this is a scenario like this:
10751 void f(const T&, int i);
10753 void g() { f(3, 7); }
10756 void f(const T& t, const int i) { }
10758 Note that when the template is first instantiated, with
10759 instantiate_template, the resulting DECL will have no name for the
10760 first parameter, and the wrong type for the second. So, when we go
10761 to instantiate the DECL, we regenerate it. */
10764 regenerate_decl_from_template (tree decl, tree tmpl)
10766 /* The most general version of TMPL. */
10768 /* The arguments used to instantiate DECL, from the most general
10775 args = DECL_TI_ARGS (decl);
10776 code_pattern = DECL_TEMPLATE_RESULT (tmpl);
10778 /* Unregister the specialization so that when we tsubst we will not
10779 just return DECL. We don't have to unregister DECL from TMPL
10780 because if would only be registered there if it were a partial
10781 instantiation of a specialization, which it isn't: it's a full
10783 gen_tmpl = most_general_template (tmpl);
10784 unregistered = reregister_specialization (decl, gen_tmpl,
10785 /*new_spec=*/NULL_TREE);
10787 /* If the DECL was not unregistered then something peculiar is
10788 happening: we created a specialization but did not call
10789 register_specialization for it. */
10790 my_friendly_assert (unregistered, 0);
10792 /* Make sure that we can see identifiers, and compute access
10794 push_access_scope (decl);
10796 /* Do the substitution to get the new declaration. */
10797 new_decl = tsubst (code_pattern, args, tf_error, NULL_TREE);
10799 if (TREE_CODE (decl) == VAR_DECL)
10801 /* Set up DECL_INITIAL, since tsubst doesn't. */
10802 if (!DECL_INITIALIZED_IN_CLASS_P (decl))
10803 DECL_INITIAL (new_decl) =
10804 tsubst_expr (DECL_INITIAL (code_pattern), args,
10805 tf_error, DECL_TI_TEMPLATE (decl));
10807 else if (TREE_CODE (decl) == FUNCTION_DECL)
10809 /* Convince duplicate_decls to use the DECL_ARGUMENTS from the
10811 DECL_INITIAL (new_decl) = error_mark_node;
10812 /* And don't complain about a duplicate definition. */
10813 DECL_INITIAL (decl) = NULL_TREE;
10816 pop_access_scope (decl);
10818 /* The immediate parent of the new template is still whatever it was
10819 before, even though tsubst sets DECL_TI_TEMPLATE up as the most
10820 general template. We also reset the DECL_ASSEMBLER_NAME since
10821 tsubst always calculates the name as if the function in question
10822 were really a template instance, and sometimes, with friend
10823 functions, this is not so. See tsubst_friend_function for
10825 DECL_TI_TEMPLATE (new_decl) = DECL_TI_TEMPLATE (decl);
10826 COPY_DECL_ASSEMBLER_NAME (decl, new_decl);
10827 COPY_DECL_RTL (decl, new_decl);
10828 DECL_USE_TEMPLATE (new_decl) = DECL_USE_TEMPLATE (decl);
10830 /* Call duplicate decls to merge the old and new declarations. */
10831 duplicate_decls (new_decl, decl);
10833 /* Now, re-register the specialization. */
10834 register_specialization (decl, gen_tmpl, args);
10837 /* Return the TEMPLATE_DECL into which DECL_TI_ARGS(DECL) should be
10838 substituted to get DECL. */
10841 template_for_substitution (tree decl)
10843 tree tmpl = DECL_TI_TEMPLATE (decl);
10845 /* Set TMPL to the template whose DECL_TEMPLATE_RESULT is the pattern
10846 for the instantiation. This is not always the most general
10847 template. Consider, for example:
10850 struct S { template <class U> void f();
10851 template <> void f<int>(); };
10853 and an instantiation of S<double>::f<int>. We want TD to be the
10854 specialization S<T>::f<int>, not the more general S<T>::f<U>. */
10855 while (/* An instantiation cannot have a definition, so we need a
10856 more general template. */
10857 DECL_TEMPLATE_INSTANTIATION (tmpl)
10858 /* We must also deal with friend templates. Given:
10860 template <class T> struct S {
10861 template <class U> friend void f() {};
10864 S<int>::f<U> say, is not an instantiation of S<T>::f<U>,
10865 so far as the language is concerned, but that's still
10866 where we get the pattern for the instantiation from. On
10867 other hand, if the definition comes outside the class, say:
10869 template <class T> struct S {
10870 template <class U> friend void f();
10872 template <class U> friend void f() {}
10874 we don't need to look any further. That's what the check for
10875 DECL_INITIAL is for. */
10876 || (TREE_CODE (decl) == FUNCTION_DECL
10877 && DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (tmpl)
10878 && !DECL_INITIAL (DECL_TEMPLATE_RESULT (tmpl))))
10880 /* The present template, TD, should not be a definition. If it
10881 were a definition, we should be using it! Note that we
10882 cannot restructure the loop to just keep going until we find
10883 a template with a definition, since that might go too far if
10884 a specialization was declared, but not defined. */
10885 my_friendly_assert (!(TREE_CODE (decl) == VAR_DECL
10886 && !DECL_IN_AGGR_P (DECL_TEMPLATE_RESULT (tmpl))),
10889 /* Fetch the more general template. */
10890 tmpl = DECL_TI_TEMPLATE (tmpl);
10896 /* Produce the definition of D, a _DECL generated from a template. If
10897 DEFER_OK is nonzero, then we don't have to actually do the
10898 instantiation now; we just have to do it sometime. Normally it is
10899 an error if this is an explicit instantiation but D is undefined.
10900 If UNDEFINED_OK is nonzero, then instead we treat it as an implicit
10901 instantiation. UNDEFINED_OK is nonzero only if we are being used
10902 to instantiate the members of an explicitly instantiated class
10907 instantiate_decl (tree d, int defer_ok, int undefined_ok)
10909 tree tmpl = DECL_TI_TEMPLATE (d);
10916 int pattern_defined;
10918 location_t saved_loc = input_location;
10920 /* This function should only be used to instantiate templates for
10921 functions and static member variables. */
10922 my_friendly_assert (TREE_CODE (d) == FUNCTION_DECL
10923 || TREE_CODE (d) == VAR_DECL, 0);
10925 /* Variables are never deferred; if instantiation is required, they
10926 are instantiated right away. That allows for better code in the
10927 case that an expression refers to the value of the variable --
10928 if the variable has a constant value the referring expression can
10929 take advantage of that fact. */
10930 if (TREE_CODE (d) == VAR_DECL)
10933 /* Don't instantiate cloned functions. Instead, instantiate the
10934 functions they cloned. */
10935 if (TREE_CODE (d) == FUNCTION_DECL && DECL_CLONED_FUNCTION_P (d))
10936 d = DECL_CLONED_FUNCTION (d);
10938 if (DECL_TEMPLATE_INSTANTIATED (d))
10939 /* D has already been instantiated. It might seem reasonable to
10940 check whether or not D is an explicit instantiation, and, if so,
10941 stop here. But when an explicit instantiation is deferred
10942 until the end of the compilation, DECL_EXPLICIT_INSTANTIATION
10943 is set, even though we still need to do the instantiation. */
10946 /* If we already have a specialization of this declaration, then
10947 there's no reason to instantiate it. Note that
10948 retrieve_specialization gives us both instantiations and
10949 specializations, so we must explicitly check
10950 DECL_TEMPLATE_SPECIALIZATION. */
10951 gen_tmpl = most_general_template (tmpl);
10952 gen_args = DECL_TI_ARGS (d);
10953 spec = retrieve_specialization (gen_tmpl, gen_args);
10954 if (spec != NULL_TREE && DECL_TEMPLATE_SPECIALIZATION (spec))
10957 /* This needs to happen before any tsubsting. */
10958 if (! push_tinst_level (d))
10961 timevar_push (TV_PARSE);
10963 /* We may be in the middle of deferred access check. Disable it now. */
10964 push_deferring_access_checks (dk_no_deferred);
10966 /* Set TD to the template whose DECL_TEMPLATE_RESULT is the pattern
10967 for the instantiation. */
10968 td = template_for_substitution (d);
10969 code_pattern = DECL_TEMPLATE_RESULT (td);
10971 if ((DECL_NAMESPACE_SCOPE_P (d) && !DECL_INITIALIZED_IN_CLASS_P (d))
10972 || DECL_TEMPLATE_SPECIALIZATION (td))
10973 /* In the case of a friend template whose definition is provided
10974 outside the class, we may have too many arguments. Drop the
10975 ones we don't need. The same is true for specializations. */
10976 args = get_innermost_template_args
10977 (gen_args, TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (td)));
10981 if (TREE_CODE (d) == FUNCTION_DECL)
10982 pattern_defined = (DECL_SAVED_TREE (code_pattern) != NULL_TREE);
10984 pattern_defined = ! DECL_IN_AGGR_P (code_pattern);
10986 input_location = DECL_SOURCE_LOCATION (d);
10988 if (pattern_defined)
10990 /* Let the repository code that this template definition is
10993 The repository doesn't need to know about cloned functions
10994 because they never actually show up in the object file. It
10995 does need to know about the clones; those are the symbols
10996 that the linker will be emitting error messages about. */
10997 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (d)
10998 || DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (d))
11002 for (t = TREE_CHAIN (d);
11003 t && DECL_CLONED_FUNCTION_P (t);
11004 t = TREE_CHAIN (t))
11005 repo_template_used (t);
11008 repo_template_used (d);
11011 import_export_decl (d);
11014 if (! pattern_defined && DECL_EXPLICIT_INSTANTIATION (d) && undefined_ok)
11015 SET_DECL_IMPLICIT_INSTANTIATION (d);
11019 /* Recheck the substitutions to obtain any warning messages
11020 about ignoring cv qualifiers. */
11021 tree gen = DECL_TEMPLATE_RESULT (gen_tmpl);
11022 tree type = TREE_TYPE (gen);
11024 /* Make sure that we can see identifiers, and compute access
11025 correctly. D is already the target FUNCTION_DECL with the
11027 push_access_scope (d);
11029 if (TREE_CODE (gen) == FUNCTION_DECL)
11031 tsubst (DECL_ARGUMENTS (gen), gen_args, tf_error | tf_warning, d);
11032 tsubst (TYPE_RAISES_EXCEPTIONS (type), gen_args,
11033 tf_error | tf_warning, d);
11034 /* Don't simply tsubst the function type, as that will give
11035 duplicate warnings about poor parameter qualifications.
11036 The function arguments are the same as the decl_arguments
11037 without the top level cv qualifiers. */
11038 type = TREE_TYPE (type);
11040 tsubst (type, gen_args, tf_error | tf_warning, d);
11042 pop_access_scope (d);
11045 if (TREE_CODE (d) == VAR_DECL && DECL_INITIALIZED_IN_CLASS_P (d)
11046 && DECL_INITIAL (d) == NULL_TREE)
11047 /* We should have set up DECL_INITIAL in instantiate_class_template. */
11049 /* Reject all external templates except inline functions. */
11050 else if (DECL_INTERFACE_KNOWN (d)
11051 && ! DECL_NOT_REALLY_EXTERN (d)
11052 && ! (TREE_CODE (d) == FUNCTION_DECL
11053 && DECL_INLINE (d)))
11055 /* Defer all other templates, unless we have been explicitly
11056 forbidden from doing so. We restore the source position here
11057 because it's used by add_pending_template. */
11058 else if (! pattern_defined || defer_ok)
11060 input_location = saved_loc;
11062 if (at_eof && !pattern_defined
11063 && DECL_EXPLICIT_INSTANTIATION (d))
11066 The definition of a non-exported function template, a
11067 non-exported member function template, or a non-exported
11068 member function or static data member of a class template
11069 shall be present in every translation unit in which it is
11070 explicitly instantiated. */
11072 ("explicit instantiation of `%D' but no definition available", d);
11074 add_pending_template (d);
11078 need_push = !cfun || !global_bindings_p ();
11080 push_to_top_level ();
11082 /* Mark D as instantiated so that recursive calls to
11083 instantiate_decl do not try to instantiate it again. */
11084 DECL_TEMPLATE_INSTANTIATED (d) = 1;
11086 /* Regenerate the declaration in case the template has been modified
11087 by a subsequent redeclaration. */
11088 regenerate_decl_from_template (d, td);
11090 /* We already set the file and line above. Reset them now in case
11091 they changed as a result of calling regenerate_decl_from_template. */
11092 input_location = DECL_SOURCE_LOCATION (d);
11094 if (TREE_CODE (d) == VAR_DECL)
11096 /* Clear out DECL_RTL; whatever was there before may not be right
11097 since we've reset the type of the declaration. */
11098 SET_DECL_RTL (d, NULL_RTX);
11100 DECL_IN_AGGR_P (d) = 0;
11101 import_export_decl (d);
11102 DECL_EXTERNAL (d) = ! DECL_NOT_REALLY_EXTERN (d);
11104 if (DECL_EXTERNAL (d))
11106 /* The fact that this code is executing indicates that:
11108 (1) D is a template static data member, for which a
11109 definition is available.
11111 (2) An implicit or explicit instantiation has occurred.
11113 (3) We are not going to emit a definition of the static
11114 data member at this time.
11116 This situation is peculiar, but it occurs on platforms
11117 without weak symbols when performing an implicit
11118 instantiation. There, we cannot implicitly instantiate a
11119 defined static data member in more than one translation
11120 unit, so import_export_decl marks the declaration as
11121 external; we must rely on explicit instantiation.
11123 Reset instantiated marker to make sure that later
11124 explicit instantiation will be processed. */
11125 DECL_TEMPLATE_INSTANTIATED (d) = 0;
11129 /* This is done in analogous to `start_decl'. It is
11130 required for correct access checking. */
11131 push_nested_class (DECL_CONTEXT (d));
11133 (!DECL_INITIALIZED_IN_CLASS_P (d)
11134 ? DECL_INITIAL (d) : NULL_TREE),
11136 /* Normally, pop_nested_class is called by cp_finish_decl
11137 above. But when instantiate_decl is triggered during
11138 instantiate_class_template processing, its DECL_CONTEXT
11139 is still not completed yet, and pop_nested_class isn't
11141 if (!COMPLETE_TYPE_P (DECL_CONTEXT (d)))
11142 pop_nested_class ();
11145 else if (TREE_CODE (d) == FUNCTION_DECL)
11147 htab_t saved_local_specializations;
11152 /* Mark D as instantiated so that recursive calls to
11153 instantiate_decl do not try to instantiate it again. */
11154 DECL_TEMPLATE_INSTANTIATED (d) = 1;
11156 /* Save away the current list, in case we are instantiating one
11157 template from within the body of another. */
11158 saved_local_specializations = local_specializations;
11160 /* Set up the list of local specializations. */
11161 local_specializations = htab_create (37,
11162 hash_local_specialization,
11163 eq_local_specializations,
11166 /* Set up context. */
11167 import_export_decl (d);
11168 start_preparsed_function (d, NULL_TREE, SF_PRE_PARSED);
11170 /* Create substitution entries for the parameters. */
11171 subst_decl = DECL_TEMPLATE_RESULT (template_for_substitution (d));
11172 tmpl_parm = DECL_ARGUMENTS (subst_decl);
11173 spec_parm = DECL_ARGUMENTS (d);
11174 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (d))
11176 register_local_specialization (spec_parm, tmpl_parm);
11177 spec_parm = skip_artificial_parms_for (d, spec_parm);
11178 tmpl_parm = skip_artificial_parms_for (subst_decl, tmpl_parm);
11182 register_local_specialization (spec_parm, tmpl_parm);
11183 tmpl_parm = TREE_CHAIN (tmpl_parm);
11184 spec_parm = TREE_CHAIN (spec_parm);
11186 my_friendly_assert (!spec_parm, 20020813);
11188 /* Substitute into the body of the function. */
11189 tsubst_expr (DECL_SAVED_TREE (code_pattern), args,
11190 tf_error | tf_warning, tmpl);
11192 /* We don't need the local specializations any more. */
11193 htab_delete (local_specializations);
11194 local_specializations = saved_local_specializations;
11196 /* Finish the function. */
11197 d = finish_function (0);
11198 expand_or_defer_fn (d);
11201 /* We're not deferring instantiation any more. */
11202 TI_PENDING_TEMPLATE_FLAG (DECL_TEMPLATE_INFO (d)) = 0;
11205 pop_from_top_level ();
11208 input_location = saved_loc;
11209 pop_deferring_access_checks ();
11210 pop_tinst_level ();
11212 timevar_pop (TV_PARSE);
11217 /* Run through the list of templates that we wish we could
11218 instantiate, and instantiate any we can. */
11221 instantiate_pending_templates (void)
11224 tree last = NULL_TREE;
11225 int instantiated_something = 0;
11227 location_t saved_loc = input_location;
11233 t = &pending_templates;
11236 tree instantiation = TREE_VALUE (*t);
11238 reopen_tinst_level (TREE_PURPOSE (*t));
11240 if (TYPE_P (instantiation))
11244 if (!COMPLETE_TYPE_P (instantiation))
11246 instantiate_class_template (instantiation);
11247 if (CLASSTYPE_TEMPLATE_INSTANTIATION (instantiation))
11248 for (fn = TYPE_METHODS (instantiation);
11250 fn = TREE_CHAIN (fn))
11251 if (! DECL_ARTIFICIAL (fn))
11252 instantiate_decl (fn, /*defer_ok=*/0,
11253 /*undefined_ok=*/0);
11254 if (COMPLETE_TYPE_P (instantiation))
11256 instantiated_something = 1;
11261 if (COMPLETE_TYPE_P (instantiation))
11262 /* If INSTANTIATION has been instantiated, then we don't
11263 need to consider it again in the future. */
11264 *t = TREE_CHAIN (*t);
11268 t = &TREE_CHAIN (*t);
11273 if (!DECL_TEMPLATE_SPECIALIZATION (instantiation)
11274 && !DECL_TEMPLATE_INSTANTIATED (instantiation))
11276 instantiation = instantiate_decl (instantiation,
11278 /*undefined_ok=*/0);
11279 if (DECL_TEMPLATE_INSTANTIATED (instantiation))
11281 instantiated_something = 1;
11286 if (DECL_TEMPLATE_SPECIALIZATION (instantiation)
11287 || DECL_TEMPLATE_INSTANTIATED (instantiation))
11288 /* If INSTANTIATION has been instantiated, then we don't
11289 need to consider it again in the future. */
11290 *t = TREE_CHAIN (*t);
11294 t = &TREE_CHAIN (*t);
11298 current_tinst_level = NULL_TREE;
11300 last_pending_template = last;
11302 while (reconsider);
11304 input_location = saved_loc;
11305 return instantiated_something;
11308 /* Substitute ARGVEC into T, which is a list of initializers for
11309 either base class or a non-static data member. The TREE_PURPOSEs
11310 are DECLs, and the TREE_VALUEs are the initializer values. Used by
11311 instantiate_decl. */
11314 tsubst_initializer_list (tree t, tree argvec)
11316 tree inits = NULL_TREE;
11318 for (; t; t = TREE_CHAIN (t))
11324 decl = tsubst_copy (TREE_PURPOSE (t), argvec, tf_error | tf_warning,
11326 decl = expand_member_init (decl);
11327 if (decl && !DECL_P (decl))
11328 in_base_initializer = 1;
11330 init = tsubst_expr (TREE_VALUE (t), argvec, tf_error | tf_warning,
11334 else if (TREE_CODE (init) == TREE_LIST)
11335 for (val = init; val; val = TREE_CHAIN (val))
11336 TREE_VALUE (val) = convert_from_reference (TREE_VALUE (val));
11337 else if (init != void_type_node)
11338 init = convert_from_reference (init);
11340 in_base_initializer = 0;
11344 init = build_tree_list (decl, init);
11345 TREE_CHAIN (init) = inits;
11352 /* Set CURRENT_ACCESS_SPECIFIER based on the protection of DECL. */
11355 set_current_access_from_decl (tree decl)
11357 if (TREE_PRIVATE (decl))
11358 current_access_specifier = access_private_node;
11359 else if (TREE_PROTECTED (decl))
11360 current_access_specifier = access_protected_node;
11362 current_access_specifier = access_public_node;
11365 /* Instantiate an enumerated type. TAG is the template type, NEWTAG
11366 is the instantiation (which should have been created with
11367 start_enum) and ARGS are the template arguments to use. */
11370 tsubst_enum (tree tag, tree newtag, tree args)
11374 for (e = TYPE_VALUES (tag); e; e = TREE_CHAIN (e))
11379 decl = TREE_VALUE (e);
11380 /* Note that in a template enum, the TREE_VALUE is the
11381 CONST_DECL, not the corresponding INTEGER_CST. */
11382 value = tsubst_expr (DECL_INITIAL (decl),
11383 args, tf_error | tf_warning,
11386 /* Give this enumeration constant the correct access. */
11387 set_current_access_from_decl (decl);
11389 /* Actually build the enumerator itself. */
11390 build_enumerator (DECL_NAME (decl), value, newtag);
11393 finish_enum (newtag);
11394 DECL_SOURCE_LOCATION (TYPE_NAME (newtag))
11395 = DECL_SOURCE_LOCATION (TYPE_NAME (tag));
11398 /* DECL is a FUNCTION_DECL that is a template specialization. Return
11399 its type -- but without substituting the innermost set of template
11400 arguments. So, innermost set of template parameters will appear in
11404 get_mostly_instantiated_function_type (tree decl)
11412 tmpl = most_general_template (DECL_TI_TEMPLATE (decl));
11413 targs = DECL_TI_ARGS (decl);
11414 tparms = DECL_TEMPLATE_PARMS (tmpl);
11415 parm_depth = TMPL_PARMS_DEPTH (tparms);
11417 /* There should be as many levels of arguments as there are levels
11419 my_friendly_assert (parm_depth == TMPL_ARGS_DEPTH (targs), 0);
11421 fn_type = TREE_TYPE (tmpl);
11423 if (parm_depth == 1)
11424 /* No substitution is necessary. */
11431 /* Replace the innermost level of the TARGS with NULL_TREEs to
11432 let tsubst know not to substitute for those parameters. */
11433 partial_args = make_tree_vec (TREE_VEC_LENGTH (targs));
11434 for (i = 1; i < TMPL_ARGS_DEPTH (targs); ++i)
11435 SET_TMPL_ARGS_LEVEL (partial_args, i,
11436 TMPL_ARGS_LEVEL (targs, i));
11437 SET_TMPL_ARGS_LEVEL (partial_args,
11438 TMPL_ARGS_DEPTH (targs),
11439 make_tree_vec (DECL_NTPARMS (tmpl)));
11441 /* Make sure that we can see identifiers, and compute access
11442 correctly. We can just use the context of DECL for the
11443 partial substitution here. It depends only on outer template
11444 parameters, regardless of whether the innermost level is
11445 specialized or not. */
11446 push_access_scope (decl);
11448 ++processing_template_decl;
11449 /* Now, do the (partial) substitution to figure out the
11450 appropriate function type. */
11451 fn_type = tsubst (fn_type, partial_args, tf_error, NULL_TREE);
11452 --processing_template_decl;
11454 /* Substitute into the template parameters to obtain the real
11455 innermost set of parameters. This step is important if the
11456 innermost set of template parameters contains value
11457 parameters whose types depend on outer template parameters. */
11458 TREE_VEC_LENGTH (partial_args)--;
11459 tparms = tsubst_template_parms (tparms, partial_args, tf_error);
11461 pop_access_scope (decl);
11467 /* Return truthvalue if we're processing a template different from
11468 the last one involved in diagnostics. */
11470 problematic_instantiation_changed (void)
11472 return last_template_error_tick != tinst_level_tick;
11475 /* Remember current template involved in diagnostics. */
11477 record_last_problematic_instantiation (void)
11479 last_template_error_tick = tinst_level_tick;
11483 current_instantiation (void)
11485 return current_tinst_level;
11488 /* [temp.param] Check that template non-type parm TYPE is of an allowable
11489 type. Return zero for ok, nonzero for disallowed. Issue error and
11490 warning messages under control of COMPLAIN. */
11493 invalid_nontype_parm_type_p (tree type, tsubst_flags_t complain)
11495 if (INTEGRAL_TYPE_P (type))
11497 else if (POINTER_TYPE_P (type))
11499 else if (TYPE_PTR_TO_MEMBER_P (type))
11501 else if (TREE_CODE (type) == TEMPLATE_TYPE_PARM)
11503 else if (TREE_CODE (type) == TYPENAME_TYPE)
11506 if (complain & tf_error)
11507 error ("`%#T' is not a valid type for a template constant parameter",
11512 /* Returns TRUE if TYPE is dependent, in the sense of [temp.dep.type].
11513 Assumes that TYPE really is a type, and not the ERROR_MARK_NODE.*/
11516 dependent_type_p_r (tree type)
11522 A type is dependent if it is:
11524 -- a template parameter. Template template parameters are
11525 types for us (since TYPE_P holds true for them) so we
11526 handle them here. */
11527 if (TREE_CODE (type) == TEMPLATE_TYPE_PARM
11528 || TREE_CODE (type) == TEMPLATE_TEMPLATE_PARM)
11530 /* -- a qualified-id with a nested-name-specifier which contains a
11531 class-name that names a dependent type or whose unqualified-id
11532 names a dependent type. */
11533 if (TREE_CODE (type) == TYPENAME_TYPE)
11535 /* -- a cv-qualified type where the cv-unqualified type is
11537 type = TYPE_MAIN_VARIANT (type);
11538 /* -- a compound type constructed from any dependent type. */
11539 if (TYPE_PTR_TO_MEMBER_P (type))
11540 return (dependent_type_p (TYPE_PTRMEM_CLASS_TYPE (type))
11541 || dependent_type_p (TYPE_PTRMEM_POINTED_TO_TYPE
11543 else if (TREE_CODE (type) == POINTER_TYPE
11544 || TREE_CODE (type) == REFERENCE_TYPE)
11545 return dependent_type_p (TREE_TYPE (type));
11546 else if (TREE_CODE (type) == FUNCTION_TYPE
11547 || TREE_CODE (type) == METHOD_TYPE)
11551 if (dependent_type_p (TREE_TYPE (type)))
11553 for (arg_type = TYPE_ARG_TYPES (type);
11555 arg_type = TREE_CHAIN (arg_type))
11556 if (dependent_type_p (TREE_VALUE (arg_type)))
11560 /* -- an array type constructed from any dependent type or whose
11561 size is specified by a constant expression that is
11562 value-dependent. */
11563 if (TREE_CODE (type) == ARRAY_TYPE)
11565 if (TYPE_DOMAIN (type)
11566 && ((value_dependent_expression_p
11567 (TYPE_MAX_VALUE (TYPE_DOMAIN (type))))
11568 || (type_dependent_expression_p
11569 (TYPE_MAX_VALUE (TYPE_DOMAIN (type))))))
11571 return dependent_type_p (TREE_TYPE (type));
11574 /* -- a template-id in which either the template name is a template
11576 if (TREE_CODE (type) == BOUND_TEMPLATE_TEMPLATE_PARM)
11578 /* ... or any of the template arguments is a dependent type or
11579 an expression that is type-dependent or value-dependent. */
11580 else if (CLASS_TYPE_P (type) && CLASSTYPE_TEMPLATE_INFO (type)
11581 && (any_dependent_template_arguments_p
11582 (INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type)))))
11585 /* All TYPEOF_TYPEs are dependent; if the argument of the `typeof'
11586 expression is not type-dependent, then it should already been
11588 if (TREE_CODE (type) == TYPEOF_TYPE)
11591 /* The standard does not specifically mention types that are local
11592 to template functions or local classes, but they should be
11593 considered dependent too. For example:
11595 template <int I> void f() {
11600 The size of `E' cannot be known until the value of `I' has been
11601 determined. Therefore, `E' must be considered dependent. */
11602 scope = TYPE_CONTEXT (type);
11603 if (scope && TYPE_P (scope))
11604 return dependent_type_p (scope);
11605 else if (scope && TREE_CODE (scope) == FUNCTION_DECL)
11606 return type_dependent_expression_p (scope);
11608 /* Other types are non-dependent. */
11612 /* Returns TRUE if TYPE is dependent, in the sense of
11613 [temp.dep.type]. */
11616 dependent_type_p (tree type)
11618 /* If there are no template parameters in scope, then there can't be
11619 any dependent types. */
11620 if (!processing_template_decl)
11623 /* If the type is NULL, we have not computed a type for the entity
11624 in question; in that case, the type is dependent. */
11628 /* Erroneous types can be considered non-dependent. */
11629 if (type == error_mark_node)
11632 /* If we have not already computed the appropriate value for TYPE,
11634 if (!TYPE_DEPENDENT_P_VALID (type))
11636 TYPE_DEPENDENT_P (type) = dependent_type_p_r (type);
11637 TYPE_DEPENDENT_P_VALID (type) = 1;
11640 return TYPE_DEPENDENT_P (type);
11643 /* Returns TRUE if EXPRESSION is dependent, according to CRITERION. */
11646 dependent_scope_ref_p (tree expression, bool criterion (tree))
11651 my_friendly_assert (TREE_CODE (expression) == SCOPE_REF, 20030714);
11653 if (!TYPE_P (TREE_OPERAND (expression, 0)))
11656 scope = TREE_OPERAND (expression, 0);
11657 name = TREE_OPERAND (expression, 1);
11661 An id-expression is type-dependent if it contains a
11662 nested-name-specifier that contains a class-name that names a
11664 /* The suggested resolution to Core Issue 2 implies that if the
11665 qualifying type is the current class, then we must peek
11668 && currently_open_class (scope)
11669 && !criterion (name))
11671 if (dependent_type_p (scope))
11677 /* Returns TRUE if the EXPRESSION is value-dependent, in the sense of
11678 [temp.dep.constexpr] */
11681 value_dependent_expression_p (tree expression)
11683 if (!processing_template_decl)
11686 /* A name declared with a dependent type. */
11687 if (TREE_CODE (expression) == IDENTIFIER_NODE
11688 || (DECL_P (expression)
11689 && type_dependent_expression_p (expression)))
11691 /* A non-type template parameter. */
11692 if ((TREE_CODE (expression) == CONST_DECL
11693 && DECL_TEMPLATE_PARM_P (expression))
11694 || TREE_CODE (expression) == TEMPLATE_PARM_INDEX)
11696 /* A constant with integral or enumeration type and is initialized
11697 with an expression that is value-dependent. */
11698 if (TREE_CODE (expression) == VAR_DECL
11699 && DECL_INITIAL (expression)
11700 && INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (expression))
11701 && value_dependent_expression_p (DECL_INITIAL (expression)))
11703 /* These expressions are value-dependent if the type to which the
11704 cast occurs is dependent or the expression being casted is
11705 value-dependent. */
11706 if (TREE_CODE (expression) == DYNAMIC_CAST_EXPR
11707 || TREE_CODE (expression) == STATIC_CAST_EXPR
11708 || TREE_CODE (expression) == CONST_CAST_EXPR
11709 || TREE_CODE (expression) == REINTERPRET_CAST_EXPR
11710 || TREE_CODE (expression) == CAST_EXPR)
11712 tree type = TREE_TYPE (expression);
11713 if (dependent_type_p (type))
11715 /* A functional cast has a list of operands. */
11716 expression = TREE_OPERAND (expression, 0);
11719 /* If there are no operands, it must be an expression such
11720 as "int()". This should not happen for aggregate types
11721 because it would form non-constant expressions. */
11722 my_friendly_assert (INTEGRAL_OR_ENUMERATION_TYPE_P (type),
11727 if (TREE_CODE (expression) == TREE_LIST)
11731 if (value_dependent_expression_p (TREE_VALUE (expression)))
11733 expression = TREE_CHAIN (expression);
11735 while (expression);
11739 return value_dependent_expression_p (expression);
11741 /* A `sizeof' expression is value-dependent if the operand is
11743 if (TREE_CODE (expression) == SIZEOF_EXPR
11744 || TREE_CODE (expression) == ALIGNOF_EXPR)
11746 expression = TREE_OPERAND (expression, 0);
11747 if (TYPE_P (expression))
11748 return dependent_type_p (expression);
11749 return type_dependent_expression_p (expression);
11751 if (TREE_CODE (expression) == SCOPE_REF)
11752 return dependent_scope_ref_p (expression, value_dependent_expression_p);
11753 if (TREE_CODE (expression) == COMPONENT_REF)
11754 return (value_dependent_expression_p (TREE_OPERAND (expression, 0))
11755 || value_dependent_expression_p (TREE_OPERAND (expression, 1)));
11756 /* A constant expression is value-dependent if any subexpression is
11757 value-dependent. */
11758 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (expression))))
11760 switch (TREE_CODE_CLASS (TREE_CODE (expression)))
11763 return (value_dependent_expression_p
11764 (TREE_OPERAND (expression, 0)));
11767 return ((value_dependent_expression_p
11768 (TREE_OPERAND (expression, 0)))
11769 || (value_dependent_expression_p
11770 (TREE_OPERAND (expression, 1))));
11774 for (i = 0; i < first_rtl_op (TREE_CODE (expression)); ++i)
11775 /* In some cases, some of the operands may be missing.
11776 (For example, in the case of PREDECREMENT_EXPR, the
11777 amount to increment by may be missing.) That doesn't
11778 make the expression dependent. */
11779 if (TREE_OPERAND (expression, i)
11780 && (value_dependent_expression_p
11781 (TREE_OPERAND (expression, i))))
11788 /* The expression is not value-dependent. */
11792 /* Returns TRUE if the EXPRESSION is type-dependent, in the sense of
11793 [temp.dep.expr]. */
11796 type_dependent_expression_p (tree expression)
11798 if (!processing_template_decl)
11801 if (expression == error_mark_node)
11804 /* An unresolved name is always dependent. */
11805 if (TREE_CODE (expression) == IDENTIFIER_NODE)
11808 /* Some expression forms are never type-dependent. */
11809 if (TREE_CODE (expression) == PSEUDO_DTOR_EXPR
11810 || TREE_CODE (expression) == SIZEOF_EXPR
11811 || TREE_CODE (expression) == ALIGNOF_EXPR
11812 || TREE_CODE (expression) == TYPEID_EXPR
11813 || TREE_CODE (expression) == DELETE_EXPR
11814 || TREE_CODE (expression) == VEC_DELETE_EXPR
11815 || TREE_CODE (expression) == THROW_EXPR)
11818 /* The types of these expressions depends only on the type to which
11819 the cast occurs. */
11820 if (TREE_CODE (expression) == DYNAMIC_CAST_EXPR
11821 || TREE_CODE (expression) == STATIC_CAST_EXPR
11822 || TREE_CODE (expression) == CONST_CAST_EXPR
11823 || TREE_CODE (expression) == REINTERPRET_CAST_EXPR
11824 || TREE_CODE (expression) == CAST_EXPR)
11825 return dependent_type_p (TREE_TYPE (expression));
11827 /* The types of these expressions depends only on the type created
11828 by the expression. */
11829 if (TREE_CODE (expression) == NEW_EXPR
11830 || TREE_CODE (expression) == VEC_NEW_EXPR)
11832 /* For NEW_EXPR tree nodes created inside a template, either
11833 the object type itself or a TREE_LIST may appear as the
11835 tree type = TREE_OPERAND (expression, 1);
11836 if (TREE_CODE (type) == TREE_LIST)
11837 /* This is an array type. We need to check array dimensions
11839 return dependent_type_p (TREE_VALUE (TREE_PURPOSE (type)))
11840 || value_dependent_expression_p
11841 (TREE_OPERAND (TREE_VALUE (type), 1));
11843 return dependent_type_p (type);
11846 if (TREE_CODE (expression) == SCOPE_REF
11847 && dependent_scope_ref_p (expression,
11848 type_dependent_expression_p))
11851 if (TREE_CODE (expression) == FUNCTION_DECL
11852 && DECL_LANG_SPECIFIC (expression)
11853 && DECL_TEMPLATE_INFO (expression)
11854 && (any_dependent_template_arguments_p
11855 (INNERMOST_TEMPLATE_ARGS (DECL_TI_ARGS (expression)))))
11858 if (TREE_CODE (expression) == TEMPLATE_DECL
11859 && !DECL_TEMPLATE_TEMPLATE_PARM_P (expression))
11862 if (TREE_TYPE (expression) == unknown_type_node)
11864 if (TREE_CODE (expression) == ADDR_EXPR)
11865 return type_dependent_expression_p (TREE_OPERAND (expression, 0));
11866 if (TREE_CODE (expression) == COMPONENT_REF
11867 || TREE_CODE (expression) == OFFSET_REF)
11869 if (type_dependent_expression_p (TREE_OPERAND (expression, 0)))
11871 expression = TREE_OPERAND (expression, 1);
11872 if (TREE_CODE (expression) == IDENTIFIER_NODE)
11876 if (TREE_CODE (expression) == BASELINK)
11877 expression = BASELINK_FUNCTIONS (expression);
11878 if (TREE_CODE (expression) == TEMPLATE_ID_EXPR)
11880 if (any_dependent_template_arguments_p
11881 (TREE_OPERAND (expression, 1)))
11883 expression = TREE_OPERAND (expression, 0);
11885 if (TREE_CODE (expression) == OVERLOAD)
11889 if (type_dependent_expression_p (OVL_CURRENT (expression)))
11891 expression = OVL_NEXT (expression);
11898 return (dependent_type_p (TREE_TYPE (expression)));
11901 /* Returns TRUE if ARGS (a TREE_LIST of arguments to a function call)
11902 contains a type-dependent expression. */
11905 any_type_dependent_arguments_p (tree args)
11909 tree arg = TREE_VALUE (args);
11911 if (type_dependent_expression_p (arg))
11913 args = TREE_CHAIN (args);
11918 /* Returns TRUE if the ARG (a template argument) is dependent. */
11921 dependent_template_arg_p (tree arg)
11923 if (!processing_template_decl)
11926 if (TREE_CODE (arg) == TEMPLATE_DECL
11927 || TREE_CODE (arg) == TEMPLATE_TEMPLATE_PARM)
11928 return dependent_template_p (arg);
11929 else if (TYPE_P (arg))
11930 return dependent_type_p (arg);
11932 return (type_dependent_expression_p (arg)
11933 || value_dependent_expression_p (arg));
11936 /* Returns true if ARGS (a collection of template arguments) contains
11937 any dependent arguments. */
11940 any_dependent_template_arguments_p (tree args)
11948 for (i = 0; i < TMPL_ARGS_DEPTH (args); ++i)
11950 tree level = TMPL_ARGS_LEVEL (args, i + 1);
11951 for (j = 0; j < TREE_VEC_LENGTH (level); ++j)
11952 if (dependent_template_arg_p (TREE_VEC_ELT (level, j)))
11959 /* Returns TRUE if the template TMPL is dependent. */
11962 dependent_template_p (tree tmpl)
11964 if (TREE_CODE (tmpl) == OVERLOAD)
11968 if (dependent_template_p (OVL_FUNCTION (tmpl)))
11970 tmpl = OVL_CHAIN (tmpl);
11975 /* Template template parameters are dependent. */
11976 if (DECL_TEMPLATE_TEMPLATE_PARM_P (tmpl)
11977 || TREE_CODE (tmpl) == TEMPLATE_TEMPLATE_PARM)
11979 /* So are qualified names that have not been looked up. */
11980 if (TREE_CODE (tmpl) == SCOPE_REF)
11982 /* So are member templates of dependent classes. */
11983 if (TYPE_P (CP_DECL_CONTEXT (tmpl)))
11984 return dependent_type_p (DECL_CONTEXT (tmpl));
11988 /* Returns TRUE if the specialization TMPL<ARGS> is dependent. */
11991 dependent_template_id_p (tree tmpl, tree args)
11993 return (dependent_template_p (tmpl)
11994 || any_dependent_template_arguments_p (args));
11997 /* TYPE is a TYPENAME_TYPE. Returns the ordinary TYPE to which the
11998 TYPENAME_TYPE corresponds. Returns ERROR_MARK_NODE if no such TYPE
11999 can be found. Note that this function peers inside uninstantiated
12000 templates and therefore should be used only in extremely limited
12004 resolve_typename_type (tree type, bool only_current_p)
12012 my_friendly_assert (TREE_CODE (type) == TYPENAME_TYPE,
12015 scope = TYPE_CONTEXT (type);
12016 name = TYPE_IDENTIFIER (type);
12018 /* If the SCOPE is itself a TYPENAME_TYPE, then we need to resolve
12019 it first before we can figure out what NAME refers to. */
12020 if (TREE_CODE (scope) == TYPENAME_TYPE)
12021 scope = resolve_typename_type (scope, only_current_p);
12022 /* If we don't know what SCOPE refers to, then we cannot resolve the
12024 if (scope == error_mark_node || TREE_CODE (scope) == TYPENAME_TYPE)
12025 return error_mark_node;
12026 /* If the SCOPE is a template type parameter, we have no way of
12027 resolving the name. */
12028 if (TREE_CODE (scope) == TEMPLATE_TYPE_PARM)
12030 /* If the SCOPE is not the current instantiation, there's no reason
12031 to look inside it. */
12032 if (only_current_p && !currently_open_class (scope))
12033 return error_mark_node;
12034 /* If SCOPE is a partial instantiation, it will not have a valid
12035 TYPE_FIELDS list, so use the original template. */
12036 scope = CLASSTYPE_PRIMARY_TEMPLATE_TYPE (scope);
12037 /* Enter the SCOPE so that name lookup will be resolved as if we
12038 were in the class definition. In particular, SCOPE will no
12039 longer be considered a dependent type. */
12040 pop_p = push_scope (scope);
12041 /* Look up the declaration. */
12042 decl = lookup_member (scope, name, /*protect=*/0, /*want_type=*/true);
12043 /* Obtain the set of qualifiers applied to the TYPE. */
12044 quals = cp_type_quals (type);
12045 /* For a TYPENAME_TYPE like "typename X::template Y<T>", we want to
12046 find a TEMPLATE_DECL. Otherwise, we want to find a TYPE_DECL. */
12048 type = error_mark_node;
12049 else if (TREE_CODE (TYPENAME_TYPE_FULLNAME (type)) == IDENTIFIER_NODE
12050 && TREE_CODE (decl) == TYPE_DECL)
12051 type = TREE_TYPE (decl);
12052 else if (TREE_CODE (TYPENAME_TYPE_FULLNAME (type)) == TEMPLATE_ID_EXPR
12053 && DECL_CLASS_TEMPLATE_P (decl))
12057 /* Obtain the template and the arguments. */
12058 tmpl = TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type), 0);
12059 args = TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type), 1);
12060 /* Instantiate the template. */
12061 type = lookup_template_class (tmpl, args, NULL_TREE, NULL_TREE,
12062 /*entering_scope=*/0, tf_error | tf_user);
12065 type = error_mark_node;
12066 /* Qualify the resulting type. */
12067 if (type != error_mark_node && quals)
12068 type = cp_build_qualified_type (type, quals);
12069 /* Leave the SCOPE. */
12076 /* EXPR is an expression which is not type-dependent. Return a proxy
12077 for EXPR that can be used to compute the types of larger
12078 expressions containing EXPR. */
12081 build_non_dependent_expr (tree expr)
12085 /* Preserve null pointer constants so that the type of things like
12086 "p == 0" where "p" is a pointer can be determined. */
12087 if (null_ptr_cst_p (expr))
12089 /* Preserve OVERLOADs; the functions must be available to resolve
12091 inner_expr = (TREE_CODE (expr) == ADDR_EXPR ?
12092 TREE_OPERAND (expr, 0) : expr);
12093 if (TREE_CODE (inner_expr) == OVERLOAD
12094 || TREE_CODE (inner_expr) == FUNCTION_DECL
12095 || TREE_CODE (inner_expr) == TEMPLATE_DECL
12096 || TREE_CODE (inner_expr) == TEMPLATE_ID_EXPR)
12098 /* Preserve string constants; conversions from string constants to
12099 "char *" are allowed, even though normally a "const char *"
12100 cannot be used to initialize a "char *". */
12101 if (TREE_CODE (expr) == STRING_CST)
12103 /* Preserve arithmetic constants, as an optimization -- there is no
12104 reason to create a new node. */
12105 if (TREE_CODE (expr) == INTEGER_CST || TREE_CODE (expr) == REAL_CST)
12107 /* Preserve THROW_EXPRs -- all throw-expressions have type "void".
12108 There is at least one place where we want to know that a
12109 particular expression is a throw-expression: when checking a ?:
12110 expression, there are special rules if the second or third
12111 argument is a throw-expression. */
12112 if (TREE_CODE (expr) == THROW_EXPR)
12115 if (TREE_CODE (expr) == COND_EXPR)
12116 return build (COND_EXPR,
12118 TREE_OPERAND (expr, 0),
12119 (TREE_OPERAND (expr, 1)
12120 ? build_non_dependent_expr (TREE_OPERAND (expr, 1))
12121 : build_non_dependent_expr (TREE_OPERAND (expr, 0))),
12122 build_non_dependent_expr (TREE_OPERAND (expr, 2)));
12123 if (TREE_CODE (expr) == COMPOUND_EXPR
12124 && !COMPOUND_EXPR_OVERLOADED (expr))
12125 return build (COMPOUND_EXPR,
12127 TREE_OPERAND (expr, 0),
12128 build_non_dependent_expr (TREE_OPERAND (expr, 1)));
12130 /* Otherwise, build a NON_DEPENDENT_EXPR.
12132 REFERENCE_TYPEs are not stripped for expressions in templates
12133 because doing so would play havoc with mangling. Consider, for
12136 template <typename T> void f<T& g>() { g(); }
12138 In the body of "f", the expression for "g" will have
12139 REFERENCE_TYPE, even though the standard says that it should
12140 not. The reason is that we must preserve the syntactic form of
12141 the expression so that mangling (say) "f<g>" inside the body of
12142 "f" works out correctly. Therefore, the REFERENCE_TYPE is
12144 return build1 (NON_DEPENDENT_EXPR, non_reference (TREE_TYPE (expr)), expr);
12147 /* ARGS is a TREE_LIST of expressions as arguments to a function call.
12148 Return a new TREE_LIST with the various arguments replaced with
12149 equivalent non-dependent expressions. */
12152 build_non_dependent_args (tree args)
12157 new_args = NULL_TREE;
12158 for (a = args; a; a = TREE_CHAIN (a))
12159 new_args = tree_cons (NULL_TREE,
12160 build_non_dependent_expr (TREE_VALUE (a)),
12162 return nreverse (new_args);
12165 #include "gt-cp-pt.h"