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"
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 ("partial specialization `%D' of function template",
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. */
2166 process_template_parm (tree list, tree next)
2174 my_friendly_assert (TREE_CODE (parm) == TREE_LIST, 259);
2175 defval = TREE_PURPOSE (parm);
2176 parm = TREE_VALUE (parm);
2177 is_type = TREE_PURPOSE (parm) == class_type_node;
2181 tree p = TREE_VALUE (tree_last (list));
2183 if (TREE_CODE (p) == TYPE_DECL || TREE_CODE (p) == TEMPLATE_DECL)
2184 idx = TEMPLATE_TYPE_IDX (TREE_TYPE (p));
2186 idx = TEMPLATE_PARM_IDX (DECL_INITIAL (p));
2194 my_friendly_assert (TREE_CODE (TREE_PURPOSE (parm)) == TREE_LIST, 260);
2195 /* is a const-param */
2196 parm = grokdeclarator (TREE_VALUE (parm), TREE_PURPOSE (parm),
2198 SET_DECL_TEMPLATE_PARM_P (parm);
2202 The top-level cv-qualifiers on the template-parameter are
2203 ignored when determining its type. */
2204 TREE_TYPE (parm) = TYPE_MAIN_VARIANT (TREE_TYPE (parm));
2206 /* A template parameter is not modifiable. */
2207 TREE_CONSTANT (parm) = 1;
2208 TREE_INVARIANT (parm) = 1;
2209 TREE_READONLY (parm) = 1;
2210 if (invalid_nontype_parm_type_p (TREE_TYPE (parm), 1))
2211 TREE_TYPE (parm) = void_type_node;
2212 decl = build_decl (CONST_DECL, DECL_NAME (parm), TREE_TYPE (parm));
2213 TREE_CONSTANT (decl) = 1;
2214 TREE_INVARIANT (decl) = 1;
2215 TREE_READONLY (decl) = 1;
2216 DECL_INITIAL (parm) = DECL_INITIAL (decl)
2217 = build_template_parm_index (idx, processing_template_decl,
2218 processing_template_decl,
2219 decl, TREE_TYPE (parm));
2224 parm = TREE_VALUE (parm);
2226 if (parm && TREE_CODE (parm) == TEMPLATE_DECL)
2228 t = make_aggr_type (TEMPLATE_TEMPLATE_PARM);
2229 /* This is for distinguishing between real templates and template
2230 template parameters */
2231 TREE_TYPE (parm) = t;
2232 TREE_TYPE (DECL_TEMPLATE_RESULT (parm)) = t;
2237 t = make_aggr_type (TEMPLATE_TYPE_PARM);
2238 /* parm is either IDENTIFIER_NODE or NULL_TREE. */
2239 decl = build_decl (TYPE_DECL, parm, t);
2242 TYPE_NAME (t) = decl;
2243 TYPE_STUB_DECL (t) = decl;
2245 TEMPLATE_TYPE_PARM_INDEX (t)
2246 = build_template_parm_index (idx, processing_template_decl,
2247 processing_template_decl,
2248 decl, TREE_TYPE (parm));
2250 DECL_ARTIFICIAL (decl) = 1;
2251 SET_DECL_TEMPLATE_PARM_P (decl);
2253 parm = build_tree_list (defval, parm);
2254 return chainon (list, parm);
2257 /* The end of a template parameter list has been reached. Process the
2258 tree list into a parameter vector, converting each parameter into a more
2259 useful form. Type parameters are saved as IDENTIFIER_NODEs, and others
2263 end_template_parm_list (tree parms)
2267 tree saved_parmlist = make_tree_vec (list_length (parms));
2269 current_template_parms
2270 = tree_cons (size_int (processing_template_decl),
2271 saved_parmlist, current_template_parms);
2273 for (parm = parms, nparms = 0; parm; parm = next, nparms++)
2275 next = TREE_CHAIN (parm);
2276 TREE_VEC_ELT (saved_parmlist, nparms) = parm;
2277 TREE_CHAIN (parm) = NULL_TREE;
2280 --processing_template_parmlist;
2282 return saved_parmlist;
2285 /* end_template_decl is called after a template declaration is seen. */
2288 end_template_decl (void)
2290 reset_specialization ();
2292 if (! processing_template_decl)
2295 /* This matches the pushlevel in begin_template_parm_list. */
2298 --processing_template_decl;
2299 current_template_parms = TREE_CHAIN (current_template_parms);
2302 /* Given a template argument vector containing the template PARMS.
2303 The innermost PARMS are given first. */
2306 current_template_args (void)
2309 tree args = NULL_TREE;
2310 int length = TMPL_PARMS_DEPTH (current_template_parms);
2313 /* If there is only one level of template parameters, we do not
2314 create a TREE_VEC of TREE_VECs. Instead, we return a single
2315 TREE_VEC containing the arguments. */
2317 args = make_tree_vec (length);
2319 for (header = current_template_parms; header; header = TREE_CHAIN (header))
2321 tree a = copy_node (TREE_VALUE (header));
2324 TREE_TYPE (a) = NULL_TREE;
2325 for (i = TREE_VEC_LENGTH (a) - 1; i >= 0; --i)
2327 tree t = TREE_VEC_ELT (a, i);
2329 /* T will be a list if we are called from within a
2330 begin/end_template_parm_list pair, but a vector directly
2331 if within a begin/end_member_template_processing pair. */
2332 if (TREE_CODE (t) == TREE_LIST)
2336 if (TREE_CODE (t) == TYPE_DECL
2337 || TREE_CODE (t) == TEMPLATE_DECL)
2340 t = DECL_INITIAL (t);
2341 TREE_VEC_ELT (a, i) = t;
2346 TREE_VEC_ELT (args, --l) = a;
2354 /* Return a TEMPLATE_DECL corresponding to DECL, using the indicated
2355 template PARMS. Used by push_template_decl below. */
2358 build_template_decl (tree decl, tree parms)
2360 tree tmpl = build_lang_decl (TEMPLATE_DECL, DECL_NAME (decl), NULL_TREE);
2361 DECL_TEMPLATE_PARMS (tmpl) = parms;
2362 DECL_CONTEXT (tmpl) = DECL_CONTEXT (decl);
2363 if (DECL_LANG_SPECIFIC (decl))
2365 DECL_STATIC_FUNCTION_P (tmpl) = DECL_STATIC_FUNCTION_P (decl);
2366 DECL_CONSTRUCTOR_P (tmpl) = DECL_CONSTRUCTOR_P (decl);
2367 DECL_DESTRUCTOR_P (tmpl) = DECL_DESTRUCTOR_P (decl);
2368 DECL_NONCONVERTING_P (tmpl) = DECL_NONCONVERTING_P (decl);
2369 DECL_ASSIGNMENT_OPERATOR_P (tmpl) = DECL_ASSIGNMENT_OPERATOR_P (decl);
2370 if (DECL_OVERLOADED_OPERATOR_P (decl))
2371 SET_OVERLOADED_OPERATOR_CODE (tmpl,
2372 DECL_OVERLOADED_OPERATOR_P (decl));
2378 struct template_parm_data
2380 /* The level of the template parameters we are currently
2384 /* The index of the specialization argument we are currently
2388 /* An array whose size is the number of template parameters. The
2389 elements are nonzero if the parameter has been used in any one
2390 of the arguments processed so far. */
2393 /* An array whose size is the number of template arguments. The
2394 elements are nonzero if the argument makes use of template
2395 parameters of this level. */
2396 int* arg_uses_template_parms;
2399 /* Subroutine of push_template_decl used to see if each template
2400 parameter in a partial specialization is used in the explicit
2401 argument list. If T is of the LEVEL given in DATA (which is
2402 treated as a template_parm_data*), then DATA->PARMS is marked
2406 mark_template_parm (tree t, void* data)
2410 struct template_parm_data* tpd = (struct template_parm_data*) data;
2412 if (TREE_CODE (t) == TEMPLATE_PARM_INDEX)
2414 level = TEMPLATE_PARM_LEVEL (t);
2415 idx = TEMPLATE_PARM_IDX (t);
2419 level = TEMPLATE_TYPE_LEVEL (t);
2420 idx = TEMPLATE_TYPE_IDX (t);
2423 if (level == tpd->level)
2425 tpd->parms[idx] = 1;
2426 tpd->arg_uses_template_parms[tpd->current_arg] = 1;
2429 /* Return zero so that for_each_template_parm will continue the
2430 traversal of the tree; we want to mark *every* template parm. */
2434 /* Process the partial specialization DECL. */
2437 process_partial_specialization (tree decl)
2439 tree type = TREE_TYPE (decl);
2440 tree maintmpl = CLASSTYPE_TI_TEMPLATE (type);
2441 tree specargs = CLASSTYPE_TI_ARGS (type);
2442 tree inner_args = INNERMOST_TEMPLATE_ARGS (specargs);
2443 tree inner_parms = INNERMOST_TEMPLATE_PARMS (current_template_parms);
2444 tree main_inner_parms = DECL_INNERMOST_TEMPLATE_PARMS (maintmpl);
2445 int nargs = TREE_VEC_LENGTH (inner_args);
2446 int ntparms = TREE_VEC_LENGTH (inner_parms);
2448 int did_error_intro = 0;
2449 struct template_parm_data tpd;
2450 struct template_parm_data tpd2;
2452 /* We check that each of the template parameters given in the
2453 partial specialization is used in the argument list to the
2454 specialization. For example:
2456 template <class T> struct S;
2457 template <class T> struct S<T*>;
2459 The second declaration is OK because `T*' uses the template
2460 parameter T, whereas
2462 template <class T> struct S<int>;
2464 is no good. Even trickier is:
2475 The S2<T> declaration is actually invalid; it is a
2476 full-specialization. Of course,
2479 struct S2<T (*)(U)>;
2481 or some such would have been OK. */
2482 tpd.level = TMPL_PARMS_DEPTH (current_template_parms);
2483 tpd.parms = alloca (sizeof (int) * ntparms);
2484 memset (tpd.parms, 0, sizeof (int) * ntparms);
2486 tpd.arg_uses_template_parms = alloca (sizeof (int) * nargs);
2487 memset (tpd.arg_uses_template_parms, 0, sizeof (int) * nargs);
2488 for (i = 0; i < nargs; ++i)
2490 tpd.current_arg = i;
2491 for_each_template_parm (TREE_VEC_ELT (inner_args, i),
2492 &mark_template_parm,
2496 for (i = 0; i < ntparms; ++i)
2497 if (tpd.parms[i] == 0)
2499 /* One of the template parms was not used in the
2501 if (!did_error_intro)
2503 error ("template parameters not used in partial specialization:");
2504 did_error_intro = 1;
2508 TREE_VALUE (TREE_VEC_ELT (inner_parms, i)));
2511 /* [temp.class.spec]
2513 The argument list of the specialization shall not be identical to
2514 the implicit argument list of the primary template. */
2515 if (comp_template_args
2517 INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE
2519 error ("partial specialization `%T' does not specialize any template arguments", type);
2521 /* [temp.class.spec]
2523 A partially specialized non-type argument expression shall not
2524 involve template parameters of the partial specialization except
2525 when the argument expression is a simple identifier.
2527 The type of a template parameter corresponding to a specialized
2528 non-type argument shall not be dependent on a parameter of the
2530 my_friendly_assert (nargs == DECL_NTPARMS (maintmpl), 0);
2532 for (i = 0; i < nargs; ++i)
2534 tree arg = TREE_VEC_ELT (inner_args, i);
2535 if (/* These first two lines are the `non-type' bit. */
2537 && TREE_CODE (arg) != TEMPLATE_DECL
2538 /* This next line is the `argument expression is not just a
2539 simple identifier' condition and also the `specialized
2540 non-type argument' bit. */
2541 && TREE_CODE (arg) != TEMPLATE_PARM_INDEX)
2543 if (tpd.arg_uses_template_parms[i])
2544 error ("template argument `%E' involves template parameter(s)", arg);
2547 /* Look at the corresponding template parameter,
2548 marking which template parameters its type depends
2551 TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (main_inner_parms,
2556 /* We haven't yet initialized TPD2. Do so now. */
2557 tpd2.arg_uses_template_parms
2558 = alloca (sizeof (int) * nargs);
2559 /* The number of parameters here is the number in the
2560 main template, which, as checked in the assertion
2562 tpd2.parms = alloca (sizeof (int) * nargs);
2564 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (maintmpl));
2567 /* Mark the template parameters. But this time, we're
2568 looking for the template parameters of the main
2569 template, not in the specialization. */
2570 tpd2.current_arg = i;
2571 tpd2.arg_uses_template_parms[i] = 0;
2572 memset (tpd2.parms, 0, sizeof (int) * nargs);
2573 for_each_template_parm (type,
2574 &mark_template_parm,
2578 if (tpd2.arg_uses_template_parms [i])
2580 /* The type depended on some template parameters.
2581 If they are fully specialized in the
2582 specialization, that's OK. */
2584 for (j = 0; j < nargs; ++j)
2585 if (tpd2.parms[j] != 0
2586 && tpd.arg_uses_template_parms [j])
2588 error ("type `%T' of template argument `%E' depends on template parameter(s)",
2598 if (retrieve_specialization (maintmpl, specargs))
2599 /* We've already got this specialization. */
2602 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl)
2603 = tree_cons (inner_args, inner_parms,
2604 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl));
2605 TREE_TYPE (DECL_TEMPLATE_SPECIALIZATIONS (maintmpl)) = type;
2609 /* Check that a template declaration's use of default arguments is not
2610 invalid. Here, PARMS are the template parameters. IS_PRIMARY is
2611 nonzero if DECL is the thing declared by a primary template.
2612 IS_PARTIAL is nonzero if DECL is a partial specialization. */
2615 check_default_tmpl_args (tree decl, tree parms, int is_primary, int is_partial)
2618 int last_level_to_check;
2623 A default template-argument shall not be specified in a
2624 function template declaration or a function template definition, nor
2625 in the template-parameter-list of the definition of a member of a
2628 if (TREE_CODE (CP_DECL_CONTEXT (decl)) == FUNCTION_DECL)
2629 /* You can't have a function template declaration in a local
2630 scope, nor you can you define a member of a class template in a
2634 if (current_class_type
2635 && !TYPE_BEING_DEFINED (current_class_type)
2636 && DECL_LANG_SPECIFIC (decl)
2637 /* If this is either a friend defined in the scope of the class
2638 or a member function. */
2639 && (DECL_FUNCTION_MEMBER_P (decl)
2640 ? same_type_p (DECL_CONTEXT (decl), current_class_type)
2641 : DECL_FRIEND_CONTEXT (decl)
2642 ? same_type_p (DECL_FRIEND_CONTEXT (decl), current_class_type)
2644 /* And, if it was a member function, it really was defined in
2645 the scope of the class. */
2646 && (!DECL_FUNCTION_MEMBER_P (decl)
2647 || DECL_INITIALIZED_IN_CLASS_P (decl)))
2648 /* We already checked these parameters when the template was
2649 declared, so there's no need to do it again now. This function
2650 was defined in class scope, but we're processing it's body now
2651 that the class is complete. */
2656 If a template-parameter has a default template-argument, all
2657 subsequent template-parameters shall have a default
2658 template-argument supplied. */
2659 for (parm_level = parms; parm_level; parm_level = TREE_CHAIN (parm_level))
2661 tree inner_parms = TREE_VALUE (parm_level);
2662 int ntparms = TREE_VEC_LENGTH (inner_parms);
2663 int seen_def_arg_p = 0;
2666 for (i = 0; i < ntparms; ++i)
2668 tree parm = TREE_VEC_ELT (inner_parms, i);
2669 if (TREE_PURPOSE (parm))
2671 else if (seen_def_arg_p)
2673 error ("no default argument for `%D'", TREE_VALUE (parm));
2674 /* For better subsequent error-recovery, we indicate that
2675 there should have been a default argument. */
2676 TREE_PURPOSE (parm) = error_mark_node;
2681 if (TREE_CODE (decl) != TYPE_DECL || is_partial || !is_primary)
2682 /* For an ordinary class template, default template arguments are
2683 allowed at the innermost level, e.g.:
2684 template <class T = int>
2686 but, in a partial specialization, they're not allowed even
2687 there, as we have in [temp.class.spec]:
2689 The template parameter list of a specialization shall not
2690 contain default template argument values.
2692 So, for a partial specialization, or for a function template,
2693 we look at all of them. */
2696 /* But, for a primary class template that is not a partial
2697 specialization we look at all template parameters except the
2699 parms = TREE_CHAIN (parms);
2701 /* Figure out what error message to issue. */
2702 if (TREE_CODE (decl) == FUNCTION_DECL)
2703 msg = "default template arguments may not be used in function templates";
2704 else if (is_partial)
2705 msg = "default template arguments may not be used in partial specializations";
2707 msg = "default argument for template parameter for class enclosing `%D'";
2709 if (current_class_type && TYPE_BEING_DEFINED (current_class_type))
2710 /* If we're inside a class definition, there's no need to
2711 examine the parameters to the class itself. On the one
2712 hand, they will be checked when the class is defined, and,
2713 on the other, default arguments are valid in things like:
2714 template <class T = double>
2715 struct S { template <class U> void f(U); };
2716 Here the default argument for `S' has no bearing on the
2717 declaration of `f'. */
2718 last_level_to_check = template_class_depth (current_class_type) + 1;
2720 /* Check everything. */
2721 last_level_to_check = 0;
2723 for (parm_level = parms;
2724 parm_level && TMPL_PARMS_DEPTH (parm_level) >= last_level_to_check;
2725 parm_level = TREE_CHAIN (parm_level))
2727 tree inner_parms = TREE_VALUE (parm_level);
2731 ntparms = TREE_VEC_LENGTH (inner_parms);
2732 for (i = 0; i < ntparms; ++i)
2733 if (TREE_PURPOSE (TREE_VEC_ELT (inner_parms, i)))
2741 /* Clear out the default argument so that we are not
2743 TREE_PURPOSE (TREE_VEC_ELT (inner_parms, i)) = NULL_TREE;
2746 /* At this point, if we're still interested in issuing messages,
2747 they must apply to classes surrounding the object declared. */
2749 msg = "default argument for template parameter for class enclosing `%D'";
2753 /* Worker for push_template_decl_real, called via
2754 for_each_template_parm. DATA is really an int, indicating the
2755 level of the parameters we are interested in. If T is a template
2756 parameter of that level, return nonzero. */
2759 template_parm_this_level_p (tree t, void* data)
2761 int this_level = *(int *)data;
2764 if (TREE_CODE (t) == TEMPLATE_PARM_INDEX)
2765 level = TEMPLATE_PARM_LEVEL (t);
2767 level = TEMPLATE_TYPE_LEVEL (t);
2768 return level == this_level;
2771 /* Creates a TEMPLATE_DECL for the indicated DECL using the template
2772 parameters given by current_template_args, or reuses a
2773 previously existing one, if appropriate. Returns the DECL, or an
2774 equivalent one, if it is replaced via a call to duplicate_decls.
2776 If IS_FRIEND is nonzero, DECL is a friend declaration. */
2779 push_template_decl_real (tree decl, int is_friend)
2787 int new_template_p = 0;
2789 if (decl == error_mark_node)
2792 /* See if this is a partial specialization. */
2793 is_partial = (DECL_IMPLICIT_TYPEDEF_P (decl)
2794 && TREE_CODE (TREE_TYPE (decl)) != ENUMERAL_TYPE
2795 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl)));
2797 is_friend |= (TREE_CODE (decl) == FUNCTION_DECL && DECL_FRIEND_P (decl));
2800 /* For a friend, we want the context of the friend function, not
2801 the type of which it is a friend. */
2802 ctx = DECL_CONTEXT (decl);
2803 else if (CP_DECL_CONTEXT (decl)
2804 && TREE_CODE (CP_DECL_CONTEXT (decl)) != NAMESPACE_DECL)
2805 /* In the case of a virtual function, we want the class in which
2807 ctx = CP_DECL_CONTEXT (decl);
2809 /* Otherwise, if we're currently defining some class, the DECL
2810 is assumed to be a member of the class. */
2811 ctx = current_scope ();
2813 if (ctx && TREE_CODE (ctx) == NAMESPACE_DECL)
2816 if (!DECL_CONTEXT (decl))
2817 DECL_CONTEXT (decl) = FROB_CONTEXT (current_namespace);
2819 /* See if this is a primary template. */
2820 primary = template_parm_scope_p ();
2824 if (current_lang_name == lang_name_c)
2825 error ("template with C linkage");
2826 else if (TREE_CODE (decl) == TYPE_DECL
2827 && ANON_AGGRNAME_P (DECL_NAME (decl)))
2828 error ("template class without a name");
2829 else if (TREE_CODE (decl) == FUNCTION_DECL
2830 && DECL_DESTRUCTOR_P (decl))
2834 A destructor shall not be a member template. */
2835 error ("destructor `%D' declared as member template", decl);
2836 return error_mark_node;
2838 else if ((DECL_IMPLICIT_TYPEDEF_P (decl)
2839 && CLASS_TYPE_P (TREE_TYPE (decl)))
2840 || (TREE_CODE (decl) == VAR_DECL && ctx && CLASS_TYPE_P (ctx))
2841 || TREE_CODE (decl) == FUNCTION_DECL)
2845 error ("template declaration of `%#D'", decl);
2846 return error_mark_node;
2850 /* Check to see that the rules regarding the use of default
2851 arguments are not being violated. */
2852 check_default_tmpl_args (decl, current_template_parms,
2853 primary, is_partial);
2856 return process_partial_specialization (decl);
2858 args = current_template_args ();
2861 || TREE_CODE (ctx) == FUNCTION_DECL
2862 || (CLASS_TYPE_P (ctx) && TYPE_BEING_DEFINED (ctx))
2863 || (is_friend && !DECL_TEMPLATE_INFO (decl)))
2865 if (DECL_LANG_SPECIFIC (decl)
2866 && DECL_TEMPLATE_INFO (decl)
2867 && DECL_TI_TEMPLATE (decl))
2868 tmpl = DECL_TI_TEMPLATE (decl);
2869 /* If DECL is a TYPE_DECL for a class-template, then there won't
2870 be DECL_LANG_SPECIFIC. The information equivalent to
2871 DECL_TEMPLATE_INFO is found in TYPE_TEMPLATE_INFO instead. */
2872 else if (DECL_IMPLICIT_TYPEDEF_P (decl)
2873 && TYPE_TEMPLATE_INFO (TREE_TYPE (decl))
2874 && TYPE_TI_TEMPLATE (TREE_TYPE (decl)))
2876 /* Since a template declaration already existed for this
2877 class-type, we must be redeclaring it here. Make sure
2878 that the redeclaration is valid. */
2879 redeclare_class_template (TREE_TYPE (decl),
2880 current_template_parms);
2881 /* We don't need to create a new TEMPLATE_DECL; just use the
2882 one we already had. */
2883 tmpl = TYPE_TI_TEMPLATE (TREE_TYPE (decl));
2887 tmpl = build_template_decl (decl, current_template_parms);
2890 if (DECL_LANG_SPECIFIC (decl)
2891 && DECL_TEMPLATE_SPECIALIZATION (decl))
2893 /* A specialization of a member template of a template
2895 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl);
2896 DECL_TEMPLATE_INFO (tmpl) = DECL_TEMPLATE_INFO (decl);
2897 DECL_TEMPLATE_INFO (decl) = NULL_TREE;
2903 tree a, t, current, parms;
2906 if (TREE_CODE (decl) == TYPE_DECL)
2908 if ((IS_AGGR_TYPE_CODE (TREE_CODE (TREE_TYPE (decl)))
2909 || TREE_CODE (TREE_TYPE (decl)) == ENUMERAL_TYPE)
2910 && TYPE_TEMPLATE_INFO (TREE_TYPE (decl))
2911 && TYPE_TI_TEMPLATE (TREE_TYPE (decl)))
2912 tmpl = TYPE_TI_TEMPLATE (TREE_TYPE (decl));
2915 error ("`%D' does not declare a template type", decl);
2919 else if (!DECL_LANG_SPECIFIC (decl) || !DECL_TEMPLATE_INFO (decl))
2921 error ("template definition of non-template `%#D'", decl);
2925 tmpl = DECL_TI_TEMPLATE (decl);
2927 if (DECL_FUNCTION_TEMPLATE_P (tmpl)
2928 && DECL_TEMPLATE_INFO (decl) && DECL_TI_ARGS (decl)
2929 && DECL_TEMPLATE_SPECIALIZATION (decl)
2930 && is_member_template (tmpl))
2934 /* The declaration is a specialization of a member
2935 template, declared outside the class. Therefore, the
2936 innermost template arguments will be NULL, so we
2937 replace them with the arguments determined by the
2938 earlier call to check_explicit_specialization. */
2939 args = DECL_TI_ARGS (decl);
2942 = build_template_decl (decl, current_template_parms);
2943 DECL_TEMPLATE_RESULT (new_tmpl) = decl;
2944 TREE_TYPE (new_tmpl) = TREE_TYPE (decl);
2945 DECL_TI_TEMPLATE (decl) = new_tmpl;
2946 SET_DECL_TEMPLATE_SPECIALIZATION (new_tmpl);
2947 DECL_TEMPLATE_INFO (new_tmpl)
2948 = tree_cons (tmpl, args, NULL_TREE);
2950 register_specialization (new_tmpl,
2951 most_general_template (tmpl),
2956 /* Make sure the template headers we got make sense. */
2958 parms = DECL_TEMPLATE_PARMS (tmpl);
2959 i = TMPL_PARMS_DEPTH (parms);
2960 if (TMPL_ARGS_DEPTH (args) != i)
2962 error ("expected %d levels of template parms for `%#D', got %d",
2963 i, decl, TMPL_ARGS_DEPTH (args));
2966 for (current = decl; i > 0; --i, parms = TREE_CHAIN (parms))
2968 a = TMPL_ARGS_LEVEL (args, i);
2969 t = INNERMOST_TEMPLATE_PARMS (parms);
2971 if (TREE_VEC_LENGTH (t) != TREE_VEC_LENGTH (a))
2973 if (current == decl)
2974 error ("got %d template parameters for `%#D'",
2975 TREE_VEC_LENGTH (a), decl);
2977 error ("got %d template parameters for `%#T'",
2978 TREE_VEC_LENGTH (a), current);
2979 error (" but %d required", TREE_VEC_LENGTH (t));
2982 /* Perhaps we should also check that the parms are used in the
2983 appropriate qualifying scopes in the declarator? */
2985 if (current == decl)
2988 current = TYPE_CONTEXT (current);
2992 DECL_TEMPLATE_RESULT (tmpl) = decl;
2993 TREE_TYPE (tmpl) = TREE_TYPE (decl);
2995 /* Push template declarations for global functions and types. Note
2996 that we do not try to push a global template friend declared in a
2997 template class; such a thing may well depend on the template
2998 parameters of the class. */
2999 if (new_template_p && !ctx
3000 && !(is_friend && template_class_depth (current_class_type) > 0))
3001 tmpl = pushdecl_namespace_level (tmpl);
3005 DECL_PRIMARY_TEMPLATE (tmpl) = tmpl;
3006 if (DECL_CONV_FN_P (tmpl))
3008 int depth = TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl));
3010 /* It is a conversion operator. See if the type converted to
3011 depends on innermost template operands. */
3013 if (uses_template_parms_level (TREE_TYPE (TREE_TYPE (tmpl)),
3015 DECL_TEMPLATE_CONV_FN_P (tmpl) = 1;
3019 /* The DECL_TI_ARGS of DECL contains full set of arguments referring
3020 back to its most general template. If TMPL is a specialization,
3021 ARGS may only have the innermost set of arguments. Add the missing
3022 argument levels if necessary. */
3023 if (DECL_TEMPLATE_INFO (tmpl))
3024 args = add_outermost_template_args (DECL_TI_ARGS (tmpl), args);
3026 info = tree_cons (tmpl, args, NULL_TREE);
3028 if (DECL_IMPLICIT_TYPEDEF_P (decl))
3030 SET_TYPE_TEMPLATE_INFO (TREE_TYPE (tmpl), info);
3031 if ((!ctx || TREE_CODE (ctx) != FUNCTION_DECL)
3032 && TREE_CODE (TREE_TYPE (decl)) != ENUMERAL_TYPE
3033 /* Don't change the name if we've already set it up. */
3034 && !IDENTIFIER_TEMPLATE (DECL_NAME (decl)))
3035 DECL_NAME (decl) = classtype_mangled_name (TREE_TYPE (decl));
3037 else if (DECL_LANG_SPECIFIC (decl))
3038 DECL_TEMPLATE_INFO (decl) = info;
3040 return DECL_TEMPLATE_RESULT (tmpl);
3044 push_template_decl (tree decl)
3046 return push_template_decl_real (decl, 0);
3049 /* Called when a class template TYPE is redeclared with the indicated
3050 template PARMS, e.g.:
3052 template <class T> struct S;
3053 template <class T> struct S {}; */
3056 redeclare_class_template (tree type, tree parms)
3062 if (!TYPE_TEMPLATE_INFO (type))
3064 error ("`%T' is not a template type", type);
3068 tmpl = TYPE_TI_TEMPLATE (type);
3069 if (!PRIMARY_TEMPLATE_P (tmpl))
3070 /* The type is nested in some template class. Nothing to worry
3071 about here; there are no new template parameters for the nested
3075 parms = INNERMOST_TEMPLATE_PARMS (parms);
3076 tmpl_parms = DECL_INNERMOST_TEMPLATE_PARMS (tmpl);
3078 if (TREE_VEC_LENGTH (parms) != TREE_VEC_LENGTH (tmpl_parms))
3080 cp_error_at ("previous declaration `%D'", tmpl);
3081 error ("used %d template parameter%s instead of %d",
3082 TREE_VEC_LENGTH (tmpl_parms),
3083 TREE_VEC_LENGTH (tmpl_parms) == 1 ? "" : "s",
3084 TREE_VEC_LENGTH (parms));
3088 for (i = 0; i < TREE_VEC_LENGTH (tmpl_parms); ++i)
3090 tree tmpl_parm = TREE_VALUE (TREE_VEC_ELT (tmpl_parms, i));
3091 tree parm = TREE_VALUE (TREE_VEC_ELT (parms, i));
3092 tree tmpl_default = TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms, i));
3093 tree parm_default = TREE_PURPOSE (TREE_VEC_ELT (parms, i));
3095 if (TREE_CODE (tmpl_parm) != TREE_CODE (parm))
3097 cp_error_at ("template parameter `%#D'", tmpl_parm);
3098 error ("redeclared here as `%#D'", parm);
3102 if (tmpl_default != NULL_TREE && parm_default != NULL_TREE)
3104 /* We have in [temp.param]:
3106 A template-parameter may not be given default arguments
3107 by two different declarations in the same scope. */
3108 error ("redefinition of default argument for `%#D'", parm);
3109 error ("%J original definition appeared here", tmpl_parm);
3113 if (parm_default != NULL_TREE)
3114 /* Update the previous template parameters (which are the ones
3115 that will really count) with the new default value. */
3116 TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms, i)) = parm_default;
3117 else if (tmpl_default != NULL_TREE)
3118 /* Update the new parameters, too; they'll be used as the
3119 parameters for any members. */
3120 TREE_PURPOSE (TREE_VEC_ELT (parms, i)) = tmpl_default;
3124 /* Simplify EXPR if it is a non-dependent expression. Returns the
3125 (possibly simplified) expression. */
3128 fold_non_dependent_expr (tree expr)
3130 /* If we're in a template, but EXPR isn't value dependent, simplify
3131 it. We're supposed to treat:
3133 template <typename T> void f(T[1 + 1]);
3134 template <typename T> void f(T[2]);
3136 as two declarations of the same function, for example. */
3137 if (processing_template_decl
3138 && !type_dependent_expression_p (expr)
3139 && !value_dependent_expression_p (expr))
3141 HOST_WIDE_INT saved_processing_template_decl;
3143 saved_processing_template_decl = processing_template_decl;
3144 processing_template_decl = 0;
3145 expr = tsubst_copy_and_build (expr,
3148 /*in_decl=*/NULL_TREE,
3149 /*function_p=*/false);
3150 processing_template_decl = saved_processing_template_decl;
3155 /* Attempt to convert the non-type template parameter EXPR to the
3156 indicated TYPE. If the conversion is successful, return the
3157 converted value. If the conversion is unsuccessful, return
3158 NULL_TREE if we issued an error message, or error_mark_node if we
3159 did not. We issue error messages for out-and-out bad template
3160 parameters, but not simply because the conversion failed, since we
3161 might be just trying to do argument deduction. Both TYPE and EXPR
3162 must be non-dependent. */
3165 convert_nontype_argument (tree type, tree expr)
3169 /* If we are in a template, EXPR may be non-dependent, but still
3170 have a syntactic, rather than semantic, form. For example, EXPR
3171 might be a SCOPE_REF, rather than the VAR_DECL to which the
3172 SCOPE_REF refers. Preserving the qualifying scope is necessary
3173 so that access checking can be performed when the template is
3174 instantiated -- but here we need the resolved form so that we can
3175 convert the argument. */
3176 expr = fold_non_dependent_expr (expr);
3177 expr_type = TREE_TYPE (expr);
3179 /* A template-argument for a non-type, non-template
3180 template-parameter shall be one of:
3182 --an integral constant-expression of integral or enumeration
3185 --the name of a non-type template-parameter; or
3187 --the name of an object or function with external linkage,
3188 including function templates and function template-ids but
3189 excluding non-static class members, expressed as id-expression;
3192 --the address of an object or function with external linkage,
3193 including function templates and function template-ids but
3194 excluding non-static class members, expressed as & id-expression
3195 where the & is optional if the name refers to a function or
3198 --a pointer to member expressed as described in _expr.unary.op_. */
3200 /* An integral constant-expression can include const variables or
3201 . enumerators. Simplify things by folding them to their values,
3202 unless we're about to bind the declaration to a reference
3204 if (INTEGRAL_TYPE_P (expr_type) && TREE_CODE (type) != REFERENCE_TYPE)
3207 tree const_expr = decl_constant_value (expr);
3208 /* In a template, the initializer for a VAR_DECL may not be
3209 marked as TREE_CONSTANT, in which case decl_constant_value
3210 will not return the initializer. Handle that special case
3212 if (expr == const_expr
3213 && TREE_CODE (expr) == VAR_DECL
3214 && DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (expr)
3215 && CP_TYPE_CONST_NON_VOLATILE_P (TREE_TYPE (expr))
3216 /* DECL_INITIAL can be NULL if we are processing a
3217 variable initialized to an expression involving itself.
3218 We know it is initialized to a constant -- but not what
3220 && DECL_INITIAL (expr))
3221 const_expr = DECL_INITIAL (expr);
3222 if (expr == const_expr)
3224 expr = fold_non_dependent_expr (const_expr);
3227 if (is_overloaded_fn (expr))
3228 /* OK for now. We'll check that it has external linkage later.
3229 Check this first since if expr_type is the unknown_type_node
3230 we would otherwise complain below. */
3232 else if (TYPE_PTR_TO_MEMBER_P (expr_type))
3234 if (TREE_CODE (expr) != PTRMEM_CST)
3237 else if (TYPE_PTR_P (expr_type)
3238 || TREE_CODE (expr_type) == ARRAY_TYPE
3239 || TREE_CODE (type) == REFERENCE_TYPE
3240 /* If expr is the address of an overloaded function, we
3241 will get the unknown_type_node at this point. */
3242 || expr_type == unknown_type_node)
3248 if (TREE_CODE (expr_type) == ARRAY_TYPE
3249 || (TREE_CODE (type) == REFERENCE_TYPE
3250 && TREE_CODE (e) != ADDR_EXPR))
3254 if (TREE_CODE (e) != ADDR_EXPR)
3257 error ("`%E' is not a valid template argument", expr);
3258 if (TYPE_PTR_P (expr_type))
3260 if (TREE_CODE (TREE_TYPE (expr_type)) == FUNCTION_TYPE)
3261 error ("it must be the address of a function with external linkage");
3263 error ("it must be the address of an object with external linkage");
3265 else if (TYPE_PTR_TO_MEMBER_P (expr_type))
3266 error ("it must be a pointer-to-member of the form `&X::Y'");
3271 referent = TREE_OPERAND (e, 0);
3272 STRIP_NOPS (referent);
3275 if (TREE_CODE (referent) == STRING_CST)
3277 error ("string literal %E is not a valid template argument because it is the address of an object with static linkage",
3282 if (TREE_CODE (referent) == SCOPE_REF)
3283 referent = TREE_OPERAND (referent, 1);
3285 if (is_overloaded_fn (referent))
3286 /* We'll check that it has external linkage later. */
3288 else if (TREE_CODE (referent) != VAR_DECL)
3290 else if (!DECL_EXTERNAL_LINKAGE_P (referent))
3292 error ("address of non-extern `%E' cannot be used as template argument", referent);
3293 return error_mark_node;
3296 else if (INTEGRAL_TYPE_P (expr_type) || TYPE_PTR_TO_MEMBER_P (expr_type))
3298 if (! TREE_CONSTANT (expr))
3301 error ("non-constant `%E' cannot be used as template argument",
3309 error ("type '%T' cannot be used as a value for a non-type "
3310 "template-parameter", expr);
3311 else if (DECL_P (expr))
3312 error ("invalid use of '%D' as a non-type template-argument", expr);
3314 error ("invalid use of '%E' as a non-type template-argument", expr);
3319 switch (TREE_CODE (type))
3324 /* For a non-type template-parameter of integral or enumeration
3325 type, integral promotions (_conv.prom_) and integral
3326 conversions (_conv.integral_) are applied. */
3327 if (!INTEGRAL_TYPE_P (expr_type))
3328 return error_mark_node;
3330 /* It's safe to call digest_init in this case; we know we're
3331 just converting one integral constant expression to another. */
3332 expr = digest_init (type, expr, (tree*) 0);
3334 if (TREE_CODE (expr) != INTEGER_CST)
3335 /* Curiously, some TREE_CONSTANT integral expressions do not
3336 simplify to integer constants. For example, `3 % 0',
3337 remains a TRUNC_MOD_EXPR. */
3346 /* For a non-type template-parameter of type pointer to data
3347 member, qualification conversions (_conv.qual_) are
3349 e = perform_qualification_conversions (type, expr);
3350 if (TREE_CODE (e) == NOP_EXPR)
3351 /* The call to perform_qualification_conversions will
3352 insert a NOP_EXPR over EXPR to do express conversion,
3353 if necessary. But, that will confuse us if we use
3354 this (converted) template parameter to instantiate
3355 another template; then the thing will not look like a
3356 valid template argument. So, just make a new
3357 constant, of the appropriate type. */
3358 e = make_ptrmem_cst (type, PTRMEM_CST_MEMBER (expr));
3364 tree type_pointed_to = TREE_TYPE (type);
3366 if (TREE_CODE (type_pointed_to) == FUNCTION_TYPE)
3368 /* For a non-type template-parameter of type pointer to
3369 function, only the function-to-pointer conversion
3370 (_conv.func_) is applied. If the template-argument
3371 represents a set of overloaded functions (or a pointer to
3372 such), the matching function is selected from the set
3377 if (TREE_CODE (expr) == ADDR_EXPR)
3378 fns = TREE_OPERAND (expr, 0);
3382 fn = instantiate_type (type_pointed_to, fns, tf_none);
3384 if (fn == error_mark_node)
3385 return error_mark_node;
3387 if (!DECL_EXTERNAL_LINKAGE_P (fn))
3389 if (really_overloaded_fn (fns))
3390 return error_mark_node;
3395 expr = build_unary_op (ADDR_EXPR, fn, 0);
3397 my_friendly_assert (same_type_p (type, TREE_TYPE (expr)),
3403 /* For a non-type template-parameter of type pointer to
3404 object, qualification conversions (_conv.qual_) and the
3405 array-to-pointer conversion (_conv.array_) are applied.
3406 [Note: In particular, neither the null pointer conversion
3407 (_conv.ptr_) nor the derived-to-base conversion
3408 (_conv.ptr_) are applied. Although 0 is a valid
3409 template-argument for a non-type template-parameter of
3410 integral type, it is not a valid template-argument for a
3411 non-type template-parameter of pointer type.]
3413 The call to decay_conversion performs the
3414 array-to-pointer conversion, if appropriate. */
3415 expr = decay_conversion (expr);
3417 if (expr == error_mark_node)
3418 return error_mark_node;
3420 return perform_qualification_conversions (type, expr);
3425 case REFERENCE_TYPE:
3427 tree type_referred_to = TREE_TYPE (type);
3429 /* If this expression already has reference type, get the
3430 underlying object. */
3431 if (TREE_CODE (expr_type) == REFERENCE_TYPE)
3433 if (TREE_CODE (expr) == NOP_EXPR
3434 && TREE_CODE (TREE_OPERAND (expr, 0)) == ADDR_EXPR)
3436 my_friendly_assert (TREE_CODE (expr) == ADDR_EXPR, 20000604);
3437 expr = TREE_OPERAND (expr, 0);
3438 expr_type = TREE_TYPE (expr);
3441 if (TREE_CODE (type_referred_to) == FUNCTION_TYPE)
3443 /* For a non-type template-parameter of type reference to
3444 function, no conversions apply. If the
3445 template-argument represents a set of overloaded
3446 functions, the matching function is selected from the
3447 set (_over.over_). */
3450 fn = instantiate_type (type_referred_to, expr, tf_none);
3452 if (fn == error_mark_node)
3453 return error_mark_node;
3455 if (!DECL_EXTERNAL_LINKAGE_P (fn))
3457 if (really_overloaded_fn (expr))
3458 /* Don't issue an error here; we might get a different
3459 function if the overloading had worked out
3461 return error_mark_node;
3466 my_friendly_assert (same_type_p (type_referred_to,
3474 /* For a non-type template-parameter of type reference to
3475 object, no conversions apply. The type referred to by the
3476 reference may be more cv-qualified than the (otherwise
3477 identical) type of the template-argument. The
3478 template-parameter is bound directly to the
3479 template-argument, which must be an lvalue. */
3480 if (!same_type_p (TYPE_MAIN_VARIANT (expr_type),
3481 TYPE_MAIN_VARIANT (type_referred_to))
3482 || !at_least_as_qualified_p (type_referred_to,
3484 || !real_lvalue_p (expr))
3485 return error_mark_node;
3488 cxx_mark_addressable (expr);
3489 return build_nop (type, build_address (expr));
3495 my_friendly_assert (TYPE_PTRMEMFUNC_P (type), 20010112);
3497 /* For a non-type template-parameter of type pointer to member
3498 function, no conversions apply. If the template-argument
3499 represents a set of overloaded member functions, the
3500 matching member function is selected from the set
3503 if (!TYPE_PTRMEMFUNC_P (expr_type) &&
3504 expr_type != unknown_type_node)
3505 return error_mark_node;
3507 if (TREE_CODE (expr) == PTRMEM_CST)
3509 /* A ptr-to-member constant. */
3510 if (!same_type_p (type, expr_type))
3511 return error_mark_node;
3516 if (TREE_CODE (expr) != ADDR_EXPR)
3517 return error_mark_node;
3519 expr = instantiate_type (type, expr, tf_none);
3521 if (expr == error_mark_node)
3522 return error_mark_node;
3524 if (!same_type_p (type, TREE_TYPE (expr)))
3525 return error_mark_node;
3532 /* All non-type parameters must have one of these types. */
3537 return error_mark_node;
3540 /* Return 1 if PARM_PARMS and ARG_PARMS matches using rule for
3541 template template parameters. Both PARM_PARMS and ARG_PARMS are
3542 vectors of TREE_LIST nodes containing TYPE_DECL, TEMPLATE_DECL
3545 ARG_PARMS may contain more parameters than PARM_PARMS. If this is
3546 the case, then extra parameters must have default arguments.
3548 Consider the example:
3549 template <class T, class Allocator = allocator> class vector;
3550 template<template <class U> class TT> class C;
3552 C<vector> is a valid instantiation. PARM_PARMS for the above code
3553 contains a TYPE_DECL (for U), ARG_PARMS contains two TYPE_DECLs (for
3554 T and Allocator) and OUTER_ARGS contains the argument that is used to
3555 substitute the TT parameter. */
3558 coerce_template_template_parms (tree parm_parms,
3560 tsubst_flags_t complain,
3564 int nparms, nargs, i;
3567 my_friendly_assert (TREE_CODE (parm_parms) == TREE_VEC, 0);
3568 my_friendly_assert (TREE_CODE (arg_parms) == TREE_VEC, 0);
3570 nparms = TREE_VEC_LENGTH (parm_parms);
3571 nargs = TREE_VEC_LENGTH (arg_parms);
3573 /* The rule here is opposite of coerce_template_parms. */
3576 && TREE_PURPOSE (TREE_VEC_ELT (arg_parms, nparms)) == NULL_TREE))
3579 for (i = 0; i < nparms; ++i)
3581 parm = TREE_VALUE (TREE_VEC_ELT (parm_parms, i));
3582 arg = TREE_VALUE (TREE_VEC_ELT (arg_parms, i));
3584 if (arg == NULL_TREE || arg == error_mark_node
3585 || parm == NULL_TREE || parm == error_mark_node)
3588 if (TREE_CODE (arg) != TREE_CODE (parm))
3591 switch (TREE_CODE (parm))
3597 /* We encounter instantiations of templates like
3598 template <template <template <class> class> class TT>
3601 tree parmparm = DECL_INNERMOST_TEMPLATE_PARMS (parm);
3602 tree argparm = DECL_INNERMOST_TEMPLATE_PARMS (arg);
3604 if (!coerce_template_template_parms
3605 (parmparm, argparm, complain, in_decl, outer_args))
3611 /* The tsubst call is used to handle cases such as
3612 template <class T, template <T> class TT> class D;
3613 i.e. the parameter list of TT depends on earlier parameters. */
3615 (tsubst (TREE_TYPE (parm), outer_args, complain, in_decl),
3627 /* Convert the indicated template ARG as necessary to match the
3628 indicated template PARM. Returns the converted ARG, or
3629 error_mark_node if the conversion was unsuccessful. Error and
3630 warning messages are issued under control of COMPLAIN. This
3631 conversion is for the Ith parameter in the parameter list. ARGS is
3632 the full set of template arguments deduced so far. */
3635 convert_template_argument (tree parm,
3638 tsubst_flags_t complain,
3644 int is_type, requires_type, is_tmpl_type, requires_tmpl_type;
3646 inner_args = INNERMOST_TEMPLATE_ARGS (args);
3648 if (TREE_CODE (arg) == TREE_LIST
3649 && TREE_CODE (TREE_VALUE (arg)) == OFFSET_REF)
3651 /* The template argument was the name of some
3652 member function. That's usually
3653 invalid, but static members are OK. In any
3654 case, grab the underlying fields/functions
3655 and issue an error later if required. */
3656 arg = TREE_VALUE (arg);
3657 TREE_TYPE (arg) = unknown_type_node;
3660 requires_tmpl_type = TREE_CODE (parm) == TEMPLATE_DECL;
3661 requires_type = (TREE_CODE (parm) == TYPE_DECL
3662 || requires_tmpl_type);
3664 is_tmpl_type = ((TREE_CODE (arg) == TEMPLATE_DECL
3665 && TREE_CODE (DECL_TEMPLATE_RESULT (arg)) == TYPE_DECL)
3666 || TREE_CODE (arg) == TEMPLATE_TEMPLATE_PARM
3667 || TREE_CODE (arg) == UNBOUND_CLASS_TEMPLATE);
3670 && (TREE_CODE (arg) == TEMPLATE_TEMPLATE_PARM
3671 || TREE_CODE (arg) == UNBOUND_CLASS_TEMPLATE))
3672 arg = TYPE_STUB_DECL (arg);
3674 is_type = TYPE_P (arg) || is_tmpl_type;
3676 if (requires_type && ! is_type && TREE_CODE (arg) == SCOPE_REF
3677 && TREE_CODE (TREE_OPERAND (arg, 0)) == TEMPLATE_TYPE_PARM)
3679 pedwarn ("to refer to a type member of a template parameter, use `typename %E'", arg);
3681 arg = make_typename_type (TREE_OPERAND (arg, 0),
3682 TREE_OPERAND (arg, 1),
3683 complain & tf_error);
3686 if (is_type != requires_type)
3690 if (complain & tf_error)
3692 error ("type/value mismatch at argument %d in template parameter list for `%D'",
3695 error (" expected a constant of type `%T', got `%T'",
3697 (is_tmpl_type ? DECL_NAME (arg) : arg));
3698 else if (requires_tmpl_type)
3699 error (" expected a class template, got `%E'", arg);
3701 error (" expected a type, got `%E'", arg);
3704 return error_mark_node;
3706 if (is_tmpl_type ^ requires_tmpl_type)
3708 if (in_decl && (complain & tf_error))
3710 error ("type/value mismatch at argument %d in template parameter list for `%D'",
3713 error (" expected a type, got `%T'", DECL_NAME (arg));
3715 error (" expected a class template, got `%T'", arg);
3717 return error_mark_node;
3722 if (requires_tmpl_type)
3724 if (TREE_CODE (TREE_TYPE (arg)) == UNBOUND_CLASS_TEMPLATE)
3725 /* The number of argument required is not known yet.
3726 Just accept it for now. */
3727 val = TREE_TYPE (arg);
3730 tree parmparm = DECL_INNERMOST_TEMPLATE_PARMS (parm);
3731 tree argparm = DECL_INNERMOST_TEMPLATE_PARMS (arg);
3733 if (coerce_template_template_parms (parmparm, argparm,
3739 /* TEMPLATE_TEMPLATE_PARM node is preferred over
3741 if (val != error_mark_node
3742 && DECL_TEMPLATE_TEMPLATE_PARM_P (val))
3743 val = TREE_TYPE (val);
3747 if (in_decl && (complain & tf_error))
3749 error ("type/value mismatch at argument %d in template parameter list for `%D'",
3751 error (" expected a template of type `%D', got `%D'", parm, arg);
3754 val = error_mark_node;
3759 val = groktypename (arg);
3763 tree t = tsubst (TREE_TYPE (parm), args, complain, in_decl);
3765 if (invalid_nontype_parm_type_p (t, complain))
3766 return error_mark_node;
3768 if (!uses_template_parms (arg) && !uses_template_parms (t))
3769 /* We used to call digest_init here. However, digest_init
3770 will report errors, which we don't want when complain
3771 is zero. More importantly, digest_init will try too
3772 hard to convert things: for example, `0' should not be
3773 converted to pointer type at this point according to
3774 the standard. Accepting this is not merely an
3775 extension, since deciding whether or not these
3776 conversions can occur is part of determining which
3777 function template to call, or whether a given explicit
3778 argument specification is valid. */
3779 val = convert_nontype_argument (t, arg);
3783 if (val == NULL_TREE)
3784 val = error_mark_node;
3785 else if (val == error_mark_node && (complain & tf_error))
3786 error ("could not convert template argument `%E' to `%T'",
3793 /* Convert all template arguments to their appropriate types, and
3794 return a vector containing the innermost resulting template
3795 arguments. If any error occurs, return error_mark_node. Error and
3796 warning messages are issued under control of COMPLAIN.
3798 If REQUIRE_ALL_ARGUMENTS is nonzero, all arguments must be
3799 provided in ARGLIST, or else trailing parameters must have default
3800 values. If REQUIRE_ALL_ARGUMENTS is zero, we will attempt argument
3801 deduction for any unspecified trailing arguments. */
3804 coerce_template_parms (tree parms,
3807 tsubst_flags_t complain,
3808 int require_all_arguments)
3810 int nparms, nargs, i, lost = 0;
3813 tree new_inner_args;
3815 inner_args = INNERMOST_TEMPLATE_ARGS (args);
3816 nargs = inner_args ? NUM_TMPL_ARGS (inner_args) : 0;
3817 nparms = TREE_VEC_LENGTH (parms);
3821 && require_all_arguments
3822 && TREE_PURPOSE (TREE_VEC_ELT (parms, nargs)) == NULL_TREE))
3824 if (complain & tf_error)
3826 error ("wrong number of template arguments (%d, should be %d)",
3830 cp_error_at ("provided for `%D'", in_decl);
3833 return error_mark_node;
3836 new_inner_args = make_tree_vec (nparms);
3837 new_args = add_outermost_template_args (args, new_inner_args);
3838 for (i = 0; i < nparms; i++)
3843 /* Get the Ith template parameter. */
3844 parm = TREE_VEC_ELT (parms, i);
3846 /* Calculate the Ith argument. */
3848 arg = TREE_VEC_ELT (inner_args, i);
3849 else if (require_all_arguments)
3850 /* There must be a default arg in this case. */
3851 arg = tsubst_template_arg (TREE_PURPOSE (parm), new_args,
3856 my_friendly_assert (arg, 20030727);
3857 if (arg == error_mark_node)
3858 error ("template argument %d is invalid", i + 1);
3860 arg = convert_template_argument (TREE_VALUE (parm),
3861 arg, new_args, complain, i,
3864 if (arg == error_mark_node)
3866 TREE_VEC_ELT (new_inner_args, i) = arg;
3870 return error_mark_node;
3872 return new_inner_args;
3875 /* Returns 1 if template args OT and NT are equivalent. */
3878 template_args_equal (tree ot, tree nt)
3883 if (TREE_CODE (nt) == TREE_VEC)
3884 /* For member templates */
3885 return TREE_CODE (ot) == TREE_VEC && comp_template_args (ot, nt);
3886 else if (TYPE_P (nt))
3887 return TYPE_P (ot) && same_type_p (ot, nt);
3888 else if (TREE_CODE (ot) == TREE_VEC || TYPE_P (ot))
3891 return cp_tree_equal (ot, nt);
3894 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets
3895 of template arguments. Returns 0 otherwise. */
3898 comp_template_args (tree oldargs, tree newargs)
3902 if (TREE_VEC_LENGTH (oldargs) != TREE_VEC_LENGTH (newargs))
3905 for (i = 0; i < TREE_VEC_LENGTH (oldargs); ++i)
3907 tree nt = TREE_VEC_ELT (newargs, i);
3908 tree ot = TREE_VEC_ELT (oldargs, i);
3910 if (! template_args_equal (ot, nt))
3916 /* Given class template name and parameter list, produce a user-friendly name
3917 for the instantiation. */
3920 mangle_class_name_for_template (const char* name, tree parms, tree arglist)
3922 static struct obstack scratch_obstack;
3923 static char *scratch_firstobj;
3926 if (!scratch_firstobj)
3927 gcc_obstack_init (&scratch_obstack);
3929 obstack_free (&scratch_obstack, scratch_firstobj);
3930 scratch_firstobj = obstack_alloc (&scratch_obstack, 1);
3932 #define ccat(C) obstack_1grow (&scratch_obstack, (C));
3933 #define cat(S) obstack_grow (&scratch_obstack, (S), strlen (S))
3937 nparms = TREE_VEC_LENGTH (parms);
3938 arglist = INNERMOST_TEMPLATE_ARGS (arglist);
3939 my_friendly_assert (nparms == TREE_VEC_LENGTH (arglist), 268);
3940 for (i = 0; i < nparms; i++)
3942 tree parm = TREE_VALUE (TREE_VEC_ELT (parms, i));
3943 tree arg = TREE_VEC_ELT (arglist, i);
3948 if (TREE_CODE (parm) == TYPE_DECL)
3950 cat (type_as_string (arg, TFF_CHASE_TYPEDEF));
3953 else if (TREE_CODE (parm) == TEMPLATE_DECL)
3955 if (TREE_CODE (arg) == TEMPLATE_DECL)
3957 /* Already substituted with real template. Just output
3958 the template name here */
3959 tree context = DECL_CONTEXT (arg);
3962 /* The template may be defined in a namespace, or
3963 may be a member template. */
3964 my_friendly_assert (TREE_CODE (context) == NAMESPACE_DECL
3965 || CLASS_TYPE_P (context),
3967 cat(decl_as_string (DECL_CONTEXT (arg), TFF_PLAIN_IDENTIFIER));
3970 cat (IDENTIFIER_POINTER (DECL_NAME (arg)));
3973 /* Output the parameter declaration. */
3974 cat (type_as_string (arg, TFF_CHASE_TYPEDEF));
3978 my_friendly_assert (TREE_CODE (parm) == PARM_DECL, 269);
3980 /* No need to check arglist against parmlist here; we did that
3981 in coerce_template_parms, called from lookup_template_class. */
3982 cat (expr_as_string (arg, TFF_PLAIN_IDENTIFIER));
3985 char *bufp = obstack_next_free (&scratch_obstack);
3987 while (bufp[offset - 1] == ' ')
3989 obstack_blank_fast (&scratch_obstack, offset);
3991 /* B<C<char> >, not B<C<char>> */
3992 if (bufp[offset - 1] == '>')
3997 return (char *) obstack_base (&scratch_obstack);
4001 classtype_mangled_name (tree t)
4003 if (CLASSTYPE_TEMPLATE_INFO (t)
4004 /* Specializations have already had their names set up in
4005 lookup_template_class. */
4006 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (t))
4008 tree tmpl = most_general_template (CLASSTYPE_TI_TEMPLATE (t));
4010 /* For non-primary templates, the template parameters are
4011 implicit from their surrounding context. */
4012 if (PRIMARY_TEMPLATE_P (tmpl))
4014 tree name = DECL_NAME (tmpl);
4015 char *mangled_name = mangle_class_name_for_template
4016 (IDENTIFIER_POINTER (name),
4017 DECL_INNERMOST_TEMPLATE_PARMS (tmpl),
4018 CLASSTYPE_TI_ARGS (t));
4019 tree id = get_identifier (mangled_name);
4020 IDENTIFIER_TEMPLATE (id) = name;
4025 return TYPE_IDENTIFIER (t);
4029 add_pending_template (tree d)
4031 tree ti = (TYPE_P (d)
4032 ? CLASSTYPE_TEMPLATE_INFO (d)
4033 : DECL_TEMPLATE_INFO (d));
4037 if (TI_PENDING_TEMPLATE_FLAG (ti))
4040 /* We are called both from instantiate_decl, where we've already had a
4041 tinst_level pushed, and instantiate_template, where we haven't.
4043 level = !(current_tinst_level && TINST_DECL (current_tinst_level) == d);
4046 push_tinst_level (d);
4048 pt = tree_cons (current_tinst_level, d, NULL_TREE);
4049 if (last_pending_template)
4050 TREE_CHAIN (last_pending_template) = pt;
4052 pending_templates = pt;
4054 last_pending_template = pt;
4056 TI_PENDING_TEMPLATE_FLAG (ti) = 1;
4063 /* Return a TEMPLATE_ID_EXPR corresponding to the indicated FNS and
4064 ARGLIST. Valid choices for FNS are given in the cp-tree.def
4065 documentation for TEMPLATE_ID_EXPR. */
4068 lookup_template_function (tree fns, tree arglist)
4072 if (fns == error_mark_node || arglist == error_mark_node)
4073 return error_mark_node;
4075 my_friendly_assert (!arglist || TREE_CODE (arglist) == TREE_VEC, 20030726);
4076 if (fns == NULL_TREE
4077 || TREE_CODE (fns) == FUNCTION_DECL)
4079 error ("non-template used as template");
4080 return error_mark_node;
4083 my_friendly_assert (TREE_CODE (fns) == TEMPLATE_DECL
4084 || TREE_CODE (fns) == OVERLOAD
4086 || TREE_CODE (fns) == IDENTIFIER_NODE,
4089 if (BASELINK_P (fns))
4091 BASELINK_FUNCTIONS (fns) = build (TEMPLATE_ID_EXPR,
4093 BASELINK_FUNCTIONS (fns),
4098 type = TREE_TYPE (fns);
4099 if (TREE_CODE (fns) == OVERLOAD || !type)
4100 type = unknown_type_node;
4102 return build (TEMPLATE_ID_EXPR, type, fns, arglist);
4105 /* Within the scope of a template class S<T>, the name S gets bound
4106 (in build_self_reference) to a TYPE_DECL for the class, not a
4107 TEMPLATE_DECL. If DECL is a TYPE_DECL for current_class_type,
4108 or one of its enclosing classes, and that type is a template,
4109 return the associated TEMPLATE_DECL. Otherwise, the original
4110 DECL is returned. */
4113 maybe_get_template_decl_from_type_decl (tree decl)
4115 return (decl != NULL_TREE
4116 && TREE_CODE (decl) == TYPE_DECL
4117 && DECL_ARTIFICIAL (decl)
4118 && CLASS_TYPE_P (TREE_TYPE (decl))
4119 && CLASSTYPE_TEMPLATE_INFO (TREE_TYPE (decl)))
4120 ? CLASSTYPE_TI_TEMPLATE (TREE_TYPE (decl)) : decl;
4123 /* Given an IDENTIFIER_NODE (type TEMPLATE_DECL) and a chain of
4124 parameters, find the desired type.
4126 D1 is the PTYPENAME terminal, and ARGLIST is the list of arguments.
4128 IN_DECL, if non-NULL, is the template declaration we are trying to
4131 If ENTERING_SCOPE is nonzero, we are about to enter the scope of
4132 the class we are looking up.
4134 Issue error and warning messages under control of COMPLAIN.
4136 If the template class is really a local class in a template
4137 function, then the FUNCTION_CONTEXT is the function in which it is
4138 being instantiated. */
4141 lookup_template_class (tree d1,
4146 tsubst_flags_t complain)
4148 tree template = NULL_TREE, parmlist;
4151 timevar_push (TV_NAME_LOOKUP);
4153 if (TREE_CODE (d1) == IDENTIFIER_NODE)
4155 if (IDENTIFIER_VALUE (d1)
4156 && DECL_TEMPLATE_TEMPLATE_PARM_P (IDENTIFIER_VALUE (d1)))
4157 template = IDENTIFIER_VALUE (d1);
4161 push_decl_namespace (context);
4162 template = lookup_name (d1, /*prefer_type=*/0);
4163 template = maybe_get_template_decl_from_type_decl (template);
4165 pop_decl_namespace ();
4168 context = DECL_CONTEXT (template);
4170 else if (TREE_CODE (d1) == TYPE_DECL && IS_AGGR_TYPE (TREE_TYPE (d1)))
4172 tree type = TREE_TYPE (d1);
4174 /* If we are declaring a constructor, say A<T>::A<T>, we will get
4175 an implicit typename for the second A. Deal with it. */
4176 if (TREE_CODE (type) == TYPENAME_TYPE && TREE_TYPE (type))
4177 type = TREE_TYPE (type);
4179 if (CLASSTYPE_TEMPLATE_INFO (type))
4181 template = CLASSTYPE_TI_TEMPLATE (type);
4182 d1 = DECL_NAME (template);
4185 else if (TREE_CODE (d1) == ENUMERAL_TYPE
4186 || (TYPE_P (d1) && IS_AGGR_TYPE (d1)))
4188 template = TYPE_TI_TEMPLATE (d1);
4189 d1 = DECL_NAME (template);
4191 else if (TREE_CODE (d1) == TEMPLATE_DECL
4192 && TREE_CODE (DECL_TEMPLATE_RESULT (d1)) == TYPE_DECL)
4195 d1 = DECL_NAME (template);
4196 context = DECL_CONTEXT (template);
4199 /* With something like `template <class T> class X class X { ... };'
4200 we could end up with D1 having nothing but an IDENTIFIER_VALUE.
4201 We don't want to do that, but we have to deal with the situation,
4202 so let's give them some syntax errors to chew on instead of a
4203 crash. Alternatively D1 might not be a template type at all. */
4206 if (complain & tf_error)
4207 error ("`%T' is not a template", d1);
4208 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node);
4211 if (TREE_CODE (template) != TEMPLATE_DECL
4212 /* Make sure it's a user visible template, if it was named by
4214 || ((complain & tf_user) && !DECL_TEMPLATE_PARM_P (template)
4215 && !PRIMARY_TEMPLATE_P (template)))
4217 if (complain & tf_error)
4219 error ("non-template type `%T' used as a template", d1);
4221 cp_error_at ("for template declaration `%D'", in_decl);
4223 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node);
4226 complain &= ~tf_user;
4228 if (DECL_TEMPLATE_TEMPLATE_PARM_P (template))
4230 /* Create a new TEMPLATE_DECL and TEMPLATE_TEMPLATE_PARM node to store
4231 template arguments */
4236 parmlist = DECL_INNERMOST_TEMPLATE_PARMS (template);
4238 /* Consider an example where a template template parameter declared as
4240 template <class T, class U = std::allocator<T> > class TT
4242 The template parameter level of T and U are one level larger than
4243 of TT. To proper process the default argument of U, say when an
4244 instantiation `TT<int>' is seen, we need to build the full
4245 arguments containing {int} as the innermost level. Outer levels,
4246 available when not appearing as default template argument, can be
4247 obtained from `current_template_args ()'.
4249 Suppose that TT is later substituted with std::vector. The above
4250 instantiation is `TT<int, std::allocator<T> >' with TT at
4251 level 1, and T at level 2, while the template arguments at level 1
4252 becomes {std::vector} and the inner level 2 is {int}. */
4254 if (current_template_parms)
4255 arglist = add_to_template_args (current_template_args (), arglist);
4257 arglist2 = coerce_template_parms (parmlist, arglist, template,
4258 complain, /*require_all_args=*/1);
4259 if (arglist2 == error_mark_node
4260 || (!uses_template_parms (arglist2)
4261 && check_instantiated_args (template, arglist2, complain)))
4262 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node);
4264 parm = bind_template_template_parm (TREE_TYPE (template), arglist2);
4265 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, parm);
4269 tree template_type = TREE_TYPE (template);
4272 tree found = NULL_TREE;
4276 int is_partial_instantiation;
4278 gen_tmpl = most_general_template (template);
4279 parmlist = DECL_TEMPLATE_PARMS (gen_tmpl);
4280 parm_depth = TMPL_PARMS_DEPTH (parmlist);
4281 arg_depth = TMPL_ARGS_DEPTH (arglist);
4283 if (arg_depth == 1 && parm_depth > 1)
4285 /* We've been given an incomplete set of template arguments.
4288 template <class T> struct S1 {
4289 template <class U> struct S2 {};
4290 template <class U> struct S2<U*> {};
4293 we will be called with an ARGLIST of `U*', but the
4294 TEMPLATE will be `template <class T> template
4295 <class U> struct S1<T>::S2'. We must fill in the missing
4298 = add_outermost_template_args (TYPE_TI_ARGS (TREE_TYPE (template)),
4300 arg_depth = TMPL_ARGS_DEPTH (arglist);
4303 /* Now we should have enough arguments. */
4304 my_friendly_assert (parm_depth == arg_depth, 0);
4306 /* From here on, we're only interested in the most general
4308 template = gen_tmpl;
4310 /* Calculate the BOUND_ARGS. These will be the args that are
4311 actually tsubst'd into the definition to create the
4315 /* We have multiple levels of arguments to coerce, at once. */
4317 int saved_depth = TMPL_ARGS_DEPTH (arglist);
4319 tree bound_args = make_tree_vec (parm_depth);
4321 for (i = saved_depth,
4322 t = DECL_TEMPLATE_PARMS (template);
4323 i > 0 && t != NULL_TREE;
4324 --i, t = TREE_CHAIN (t))
4326 tree a = coerce_template_parms (TREE_VALUE (t),
4328 complain, /*require_all_args=*/1);
4330 /* Don't process further if one of the levels fails. */
4331 if (a == error_mark_node)
4333 /* Restore the ARGLIST to its full size. */
4334 TREE_VEC_LENGTH (arglist) = saved_depth;
4335 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node);
4338 SET_TMPL_ARGS_LEVEL (bound_args, i, a);
4340 /* We temporarily reduce the length of the ARGLIST so
4341 that coerce_template_parms will see only the arguments
4342 corresponding to the template parameters it is
4344 TREE_VEC_LENGTH (arglist)--;
4347 /* Restore the ARGLIST to its full size. */
4348 TREE_VEC_LENGTH (arglist) = saved_depth;
4350 arglist = bound_args;
4354 = coerce_template_parms (INNERMOST_TEMPLATE_PARMS (parmlist),
4355 INNERMOST_TEMPLATE_ARGS (arglist),
4357 complain, /*require_all_args=*/1);
4359 if (arglist == error_mark_node)
4360 /* We were unable to bind the arguments. */
4361 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node);
4363 /* In the scope of a template class, explicit references to the
4364 template class refer to the type of the template, not any
4365 instantiation of it. For example, in:
4367 template <class T> class C { void f(C<T>); }
4369 the `C<T>' is just the same as `C'. Outside of the
4370 class, however, such a reference is an instantiation. */
4371 if (comp_template_args (TYPE_TI_ARGS (template_type),
4374 found = template_type;
4376 if (!entering_scope && PRIMARY_TEMPLATE_P (template))
4380 for (ctx = current_class_type;
4381 ctx && TREE_CODE (ctx) != NAMESPACE_DECL;
4383 ? TYPE_CONTEXT (ctx)
4384 : DECL_CONTEXT (ctx)))
4385 if (TYPE_P (ctx) && same_type_p (ctx, template_type))
4388 /* We're not in the scope of the class, so the
4389 TEMPLATE_TYPE is not the type we want after all. */
4395 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, found);
4397 for (tp = &DECL_TEMPLATE_INSTANTIATIONS (template);
4399 tp = &TREE_CHAIN (*tp))
4400 if (comp_template_args (TREE_PURPOSE (*tp), arglist))
4404 /* Use the move-to-front heuristic to speed up future
4406 *tp = TREE_CHAIN (*tp);
4408 = DECL_TEMPLATE_INSTANTIATIONS (template);
4409 DECL_TEMPLATE_INSTANTIATIONS (template) = found;
4411 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, TREE_VALUE (found));
4414 /* This type is a "partial instantiation" if any of the template
4415 arguments still involve template parameters. Note that we set
4416 IS_PARTIAL_INSTANTIATION for partial specializations as
4418 is_partial_instantiation = uses_template_parms (arglist);
4420 /* If the deduced arguments are invalid, then the binding
4422 if (!is_partial_instantiation
4423 && check_instantiated_args (template,
4424 INNERMOST_TEMPLATE_ARGS (arglist),
4426 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node);
4428 if (!is_partial_instantiation
4429 && !PRIMARY_TEMPLATE_P (template)
4430 && TREE_CODE (CP_DECL_CONTEXT (template)) == NAMESPACE_DECL)
4432 found = xref_tag_from_type (TREE_TYPE (template),
4433 DECL_NAME (template),
4435 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, found);
4438 context = tsubst (DECL_CONTEXT (template), arglist,
4441 context = global_namespace;
4443 /* Create the type. */
4444 if (TREE_CODE (template_type) == ENUMERAL_TYPE)
4446 if (!is_partial_instantiation)
4448 set_current_access_from_decl (TYPE_NAME (template_type));
4449 t = start_enum (TYPE_IDENTIFIER (template_type));
4452 /* We don't want to call start_enum for this type, since
4453 the values for the enumeration constants may involve
4454 template parameters. And, no one should be interested
4455 in the enumeration constants for such a type. */
4456 t = make_node (ENUMERAL_TYPE);
4460 t = make_aggr_type (TREE_CODE (template_type));
4461 CLASSTYPE_DECLARED_CLASS (t)
4462 = CLASSTYPE_DECLARED_CLASS (template_type);
4463 SET_CLASSTYPE_IMPLICIT_INSTANTIATION (t);
4464 TYPE_FOR_JAVA (t) = TYPE_FOR_JAVA (template_type);
4466 /* A local class. Make sure the decl gets registered properly. */
4467 if (context == current_function_decl)
4468 pushtag (DECL_NAME (template), t, 0);
4471 /* If we called start_enum or pushtag above, this information
4472 will already be set up. */
4475 TYPE_CONTEXT (t) = FROB_CONTEXT (context);
4477 type_decl = create_implicit_typedef (DECL_NAME (template), t);
4478 DECL_CONTEXT (type_decl) = TYPE_CONTEXT (t);
4479 TYPE_STUB_DECL (t) = type_decl;
4480 DECL_SOURCE_LOCATION (type_decl)
4481 = DECL_SOURCE_LOCATION (TYPE_STUB_DECL (template_type));
4484 type_decl = TYPE_NAME (t);
4486 TREE_PRIVATE (type_decl)
4487 = TREE_PRIVATE (TYPE_STUB_DECL (template_type));
4488 TREE_PROTECTED (type_decl)
4489 = TREE_PROTECTED (TYPE_STUB_DECL (template_type));
4491 /* Set up the template information. We have to figure out which
4492 template is the immediate parent if this is a full
4494 if (parm_depth == 1 || is_partial_instantiation
4495 || !PRIMARY_TEMPLATE_P (template))
4496 /* This case is easy; there are no member templates involved. */
4500 /* This is a full instantiation of a member template. Look
4501 for a partial instantiation of which this is an instance. */
4503 for (found = DECL_TEMPLATE_INSTANTIATIONS (template);
4504 found; found = TREE_CHAIN (found))
4507 tree tmpl = CLASSTYPE_TI_TEMPLATE (TREE_VALUE (found));
4509 /* We only want partial instantiations, here, not
4510 specializations or full instantiations. */
4511 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_VALUE (found))
4512 || !uses_template_parms (TREE_VALUE (found)))
4515 /* Temporarily reduce by one the number of levels in the
4516 ARGLIST and in FOUND so as to avoid comparing the
4517 last set of arguments. */
4518 TREE_VEC_LENGTH (arglist)--;
4519 TREE_VEC_LENGTH (TREE_PURPOSE (found)) --;
4521 /* See if the arguments match. If they do, then TMPL is
4522 the partial instantiation we want. */
4523 success = comp_template_args (TREE_PURPOSE (found), arglist);
4525 /* Restore the argument vectors to their full size. */
4526 TREE_VEC_LENGTH (arglist)++;
4527 TREE_VEC_LENGTH (TREE_PURPOSE (found))++;
4538 /* There was no partial instantiation. This happens
4539 where C<T> is a member template of A<T> and it's used
4542 template <typename T> struct B { A<T>::C<int> m; };
4545 Create the partial instantiation.
4547 TREE_VEC_LENGTH (arglist)--;
4548 found = tsubst (template, arglist, complain, NULL_TREE);
4549 TREE_VEC_LENGTH (arglist)++;
4553 SET_TYPE_TEMPLATE_INFO (t, tree_cons (found, arglist, NULL_TREE));
4554 DECL_TEMPLATE_INSTANTIATIONS (template)
4555 = tree_cons (arglist, t,
4556 DECL_TEMPLATE_INSTANTIATIONS (template));
4558 if (TREE_CODE (t) == ENUMERAL_TYPE
4559 && !is_partial_instantiation)
4560 /* Now that the type has been registered on the instantiations
4561 list, we set up the enumerators. Because the enumeration
4562 constants may involve the enumeration type itself, we make
4563 sure to register the type first, and then create the
4564 constants. That way, doing tsubst_expr for the enumeration
4565 constants won't result in recursive calls here; we'll find
4566 the instantiation and exit above. */
4567 tsubst_enum (template_type, t, arglist);
4569 /* Reset the name of the type, now that CLASSTYPE_TEMPLATE_INFO
4571 if (TREE_CODE (t) != ENUMERAL_TYPE)
4572 DECL_NAME (type_decl) = classtype_mangled_name (t);
4573 if (is_partial_instantiation)
4574 /* If the type makes use of template parameters, the
4575 code that generates debugging information will crash. */
4576 DECL_IGNORED_P (TYPE_STUB_DECL (t)) = 1;
4578 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, t);
4580 timevar_pop (TV_NAME_LOOKUP);
4590 /* Called from for_each_template_parm via walk_tree. */
4593 for_each_template_parm_r (tree* tp, int* walk_subtrees, void* d)
4596 struct pair_fn_data *pfd = (struct pair_fn_data *) d;
4597 tree_fn_t fn = pfd->fn;
4598 void *data = pfd->data;
4601 && for_each_template_parm (TYPE_CONTEXT (t), fn, data, pfd->visited))
4602 return error_mark_node;
4604 switch (TREE_CODE (t))
4607 if (TYPE_PTRMEMFUNC_P (t))
4613 if (!TYPE_TEMPLATE_INFO (t))
4615 else if (for_each_template_parm (TREE_VALUE (TYPE_TEMPLATE_INFO (t)),
4616 fn, data, pfd->visited))
4617 return error_mark_node;
4621 /* Since we're not going to walk subtrees, we have to do this
4623 if (for_each_template_parm (TYPE_METHOD_BASETYPE (t), fn, data,
4625 return error_mark_node;
4629 /* Check the return type. */
4630 if (for_each_template_parm (TREE_TYPE (t), fn, data, pfd->visited))
4631 return error_mark_node;
4633 /* Check the parameter types. Since default arguments are not
4634 instantiated until they are needed, the TYPE_ARG_TYPES may
4635 contain expressions that involve template parameters. But,
4636 no-one should be looking at them yet. And, once they're
4637 instantiated, they don't contain template parameters, so
4638 there's no point in looking at them then, either. */
4642 for (parm = TYPE_ARG_TYPES (t); parm; parm = TREE_CHAIN (parm))
4643 if (for_each_template_parm (TREE_VALUE (parm), fn, data,
4645 return error_mark_node;
4647 /* Since we've already handled the TYPE_ARG_TYPES, we don't
4648 want walk_tree walking into them itself. */
4654 if (for_each_template_parm (TYPE_FIELDS (t), fn, data,
4656 return error_mark_node;
4661 if (DECL_LANG_SPECIFIC (t) && DECL_TEMPLATE_INFO (t)
4662 && for_each_template_parm (DECL_TI_ARGS (t), fn, data,
4664 return error_mark_node;
4669 if (TREE_CODE (t) == CONST_DECL && DECL_TEMPLATE_PARM_P (t)
4670 && for_each_template_parm (DECL_INITIAL (t), fn, data,
4672 return error_mark_node;
4673 if (DECL_CONTEXT (t)
4674 && for_each_template_parm (DECL_CONTEXT (t), fn, data,
4676 return error_mark_node;
4679 case BOUND_TEMPLATE_TEMPLATE_PARM:
4680 /* Record template parameters such as `T' inside `TT<T>'. */
4681 if (for_each_template_parm (TYPE_TI_ARGS (t), fn, data, pfd->visited))
4682 return error_mark_node;
4685 case TEMPLATE_TEMPLATE_PARM:
4686 case TEMPLATE_TYPE_PARM:
4687 case TEMPLATE_PARM_INDEX:
4688 if (fn && (*fn)(t, data))
4689 return error_mark_node;
4691 return error_mark_node;
4695 /* A template template parameter is encountered. */
4696 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t)
4697 && for_each_template_parm (TREE_TYPE (t), fn, data, pfd->visited))
4698 return error_mark_node;
4700 /* Already substituted template template parameter */
4706 || for_each_template_parm (TYPENAME_TYPE_FULLNAME (t), fn,
4707 data, pfd->visited))
4708 return error_mark_node;
4712 if (TREE_TYPE (t) && TYPE_PTRMEMFUNC_P (TREE_TYPE (t))
4713 && for_each_template_parm (TYPE_PTRMEMFUNC_FN_TYPE
4714 (TREE_TYPE (t)), fn, data,
4716 return error_mark_node;
4721 /* If there's no type, then this thing must be some expression
4722 involving template parameters. */
4723 if (!fn && !TREE_TYPE (t))
4724 return error_mark_node;
4729 case REINTERPRET_CAST_EXPR:
4730 case CONST_CAST_EXPR:
4731 case STATIC_CAST_EXPR:
4732 case DYNAMIC_CAST_EXPR:
4736 case PSEUDO_DTOR_EXPR:
4738 return error_mark_node;
4742 /* If we do not handle this case specially, we end up walking
4743 the BINFO hierarchy, which is circular, and therefore
4744 confuses walk_tree. */
4746 if (for_each_template_parm (BASELINK_FUNCTIONS (*tp), fn, data,
4748 return error_mark_node;
4755 /* We didn't find any template parameters we liked. */
4759 /* For each TEMPLATE_TYPE_PARM, TEMPLATE_TEMPLATE_PARM,
4760 BOUND_TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX in T,
4761 call FN with the parameter and the DATA.
4762 If FN returns nonzero, the iteration is terminated, and
4763 for_each_template_parm returns 1. Otherwise, the iteration
4764 continues. If FN never returns a nonzero value, the value
4765 returned by for_each_template_parm is 0. If FN is NULL, it is
4766 considered to be the function which always returns 1. */
4769 for_each_template_parm (tree t, tree_fn_t fn, void* data, htab_t visited)
4771 struct pair_fn_data pfd;
4778 /* Walk the tree. (Conceptually, we would like to walk without
4779 duplicates, but for_each_template_parm_r recursively calls
4780 for_each_template_parm, so we would need to reorganize a fair
4781 bit to use walk_tree_without_duplicates, so we keep our own
4784 pfd.visited = visited;
4786 pfd.visited = htab_create (37, htab_hash_pointer, htab_eq_pointer,
4788 result = walk_tree (&t,
4789 for_each_template_parm_r,
4791 pfd.visited) != NULL_TREE;
4795 htab_delete (pfd.visited);
4800 /* Returns true if T depends on any template parameter. */
4803 uses_template_parms (tree t)
4806 int saved_processing_template_decl;
4808 saved_processing_template_decl = processing_template_decl;
4809 if (!saved_processing_template_decl)
4810 processing_template_decl = 1;
4812 dependent_p = dependent_type_p (t);
4813 else if (TREE_CODE (t) == TREE_VEC)
4814 dependent_p = any_dependent_template_arguments_p (t);
4815 else if (TREE_CODE (t) == TREE_LIST)
4816 dependent_p = (uses_template_parms (TREE_VALUE (t))
4817 || uses_template_parms (TREE_CHAIN (t)));
4820 || TREE_CODE (t) == TEMPLATE_PARM_INDEX
4821 || TREE_CODE (t) == OVERLOAD
4822 || TREE_CODE (t) == BASELINK
4823 || TREE_CODE_CLASS (TREE_CODE (t)) == 'c')
4824 dependent_p = (type_dependent_expression_p (t)
4825 || value_dependent_expression_p (t));
4826 else if (t == error_mark_node)
4827 dependent_p = false;
4830 processing_template_decl = saved_processing_template_decl;
4835 /* Returns true if T depends on any template parameter with level LEVEL. */
4838 uses_template_parms_level (tree t, int level)
4840 return for_each_template_parm (t, template_parm_this_level_p, &level, NULL);
4843 static int tinst_depth;
4844 extern int max_tinst_depth;
4845 #ifdef GATHER_STATISTICS
4848 static int tinst_level_tick;
4849 static int last_template_error_tick;
4851 /* We're starting to instantiate D; record the template instantiation context
4852 for diagnostics and to restore it later. */
4855 push_tinst_level (tree d)
4859 if (tinst_depth >= max_tinst_depth)
4861 /* If the instantiation in question still has unbound template parms,
4862 we don't really care if we can't instantiate it, so just return.
4863 This happens with base instantiation for implicit `typename'. */
4864 if (uses_template_parms (d))
4867 last_template_error_tick = tinst_level_tick;
4868 error ("template instantiation depth exceeds maximum of %d (use -ftemplate-depth-NN to increase the maximum) instantiating `%D'",
4869 max_tinst_depth, d);
4871 print_instantiation_context ();
4876 new = make_node (TINST_LEVEL);
4877 annotate_with_locus (new, input_location);
4878 TINST_DECL (new) = d;
4879 TREE_CHAIN (new) = current_tinst_level;
4880 current_tinst_level = new;
4883 #ifdef GATHER_STATISTICS
4884 if (tinst_depth > depth_reached)
4885 depth_reached = tinst_depth;
4892 /* We're done instantiating this template; return to the instantiation
4896 pop_tinst_level (void)
4898 tree old = current_tinst_level;
4900 /* Restore the filename and line number stashed away when we started
4901 this instantiation. */
4902 input_location = *EXPR_LOCUS (old);
4903 extract_interface_info ();
4905 current_tinst_level = TREE_CHAIN (old);
4910 /* We're instantiating a deferred template; restore the template
4911 instantiation context in which the instantiation was requested, which
4912 is one step out from LEVEL. */
4915 reopen_tinst_level (tree level)
4920 for (t = level; t; t = TREE_CHAIN (t))
4923 current_tinst_level = level;
4927 /* Return the outermost template instantiation context, for use with
4928 -falt-external-templates. */
4931 tinst_for_decl (void)
4933 tree p = current_tinst_level;
4936 for (; TREE_CHAIN (p) ; p = TREE_CHAIN (p))
4941 /* DECL is a friend FUNCTION_DECL or TEMPLATE_DECL. ARGS is the
4942 vector of template arguments, as for tsubst.
4944 Returns an appropriate tsubst'd friend declaration. */
4947 tsubst_friend_function (tree decl, tree args)
4950 location_t saved_loc = input_location;
4952 input_location = DECL_SOURCE_LOCATION (decl);
4954 if (TREE_CODE (decl) == FUNCTION_DECL
4955 && DECL_TEMPLATE_INSTANTIATION (decl)
4956 && TREE_CODE (DECL_TI_TEMPLATE (decl)) != TEMPLATE_DECL)
4957 /* This was a friend declared with an explicit template
4958 argument list, e.g.:
4962 to indicate that f was a template instantiation, not a new
4963 function declaration. Now, we have to figure out what
4964 instantiation of what template. */
4966 tree template_id, arglist, fns;
4969 tree ns = decl_namespace_context (TYPE_MAIN_DECL (current_class_type));
4971 /* Friend functions are looked up in the containing namespace scope.
4972 We must enter that scope, to avoid finding member functions of the
4973 current cless with same name. */
4974 push_nested_namespace (ns);
4975 fns = tsubst_expr (DECL_TI_TEMPLATE (decl), args,
4976 tf_error | tf_warning, NULL_TREE);
4977 pop_nested_namespace (ns);
4978 arglist = tsubst (DECL_TI_ARGS (decl), args,
4979 tf_error | tf_warning, NULL_TREE);
4980 template_id = lookup_template_function (fns, arglist);
4982 new_friend = tsubst (decl, args, tf_error | tf_warning, NULL_TREE);
4983 tmpl = determine_specialization (template_id, new_friend,
4985 /*need_member_template=*/0);
4986 new_friend = instantiate_template (tmpl, new_args, tf_error);
4990 new_friend = tsubst (decl, args, tf_error | tf_warning, NULL_TREE);
4992 /* The NEW_FRIEND will look like an instantiation, to the
4993 compiler, but is not an instantiation from the point of view of
4994 the language. For example, we might have had:
4996 template <class T> struct S {
4997 template <class U> friend void f(T, U);
5000 Then, in S<int>, template <class U> void f(int, U) is not an
5001 instantiation of anything. */
5002 if (new_friend == error_mark_node)
5003 return error_mark_node;
5005 DECL_USE_TEMPLATE (new_friend) = 0;
5006 if (TREE_CODE (decl) == TEMPLATE_DECL)
5008 DECL_USE_TEMPLATE (DECL_TEMPLATE_RESULT (new_friend)) = 0;
5009 DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (new_friend))
5010 = DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (decl));
5013 /* The mangled name for the NEW_FRIEND is incorrect. The function
5014 is not a template instantiation and should not be mangled like
5015 one. Therefore, we forget the mangling here; we'll recompute it
5016 later if we need it. */
5017 if (TREE_CODE (new_friend) != TEMPLATE_DECL)
5019 SET_DECL_RTL (new_friend, NULL_RTX);
5020 SET_DECL_ASSEMBLER_NAME (new_friend, NULL_TREE);
5023 if (DECL_NAMESPACE_SCOPE_P (new_friend))
5026 tree new_friend_template_info;
5027 tree new_friend_result_template_info;
5029 int new_friend_is_defn;
5031 /* We must save some information from NEW_FRIEND before calling
5032 duplicate decls since that function will free NEW_FRIEND if
5034 new_friend_template_info = DECL_TEMPLATE_INFO (new_friend);
5035 new_friend_is_defn =
5036 (DECL_INITIAL (DECL_TEMPLATE_RESULT
5037 (template_for_substitution (new_friend)))
5039 if (TREE_CODE (new_friend) == TEMPLATE_DECL)
5041 /* This declaration is a `primary' template. */
5042 DECL_PRIMARY_TEMPLATE (new_friend) = new_friend;
5044 new_friend_result_template_info
5045 = DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (new_friend));
5048 new_friend_result_template_info = NULL_TREE;
5050 /* Inside pushdecl_namespace_level, we will push into the
5051 current namespace. However, the friend function should go
5052 into the namespace of the template. */
5053 ns = decl_namespace_context (new_friend);
5054 push_nested_namespace (ns);
5055 old_decl = pushdecl_namespace_level (new_friend);
5056 pop_nested_namespace (ns);
5058 if (old_decl != new_friend)
5060 /* This new friend declaration matched an existing
5061 declaration. For example, given:
5063 template <class T> void f(T);
5064 template <class U> class C {
5065 template <class T> friend void f(T) {}
5068 the friend declaration actually provides the definition
5069 of `f', once C has been instantiated for some type. So,
5070 old_decl will be the out-of-class template declaration,
5071 while new_friend is the in-class definition.
5073 But, if `f' was called before this point, the
5074 instantiation of `f' will have DECL_TI_ARGS corresponding
5075 to `T' but not to `U', references to which might appear
5076 in the definition of `f'. Previously, the most general
5077 template for an instantiation of `f' was the out-of-class
5078 version; now it is the in-class version. Therefore, we
5079 run through all specialization of `f', adding to their
5080 DECL_TI_ARGS appropriately. In particular, they need a
5081 new set of outer arguments, corresponding to the
5082 arguments for this class instantiation.
5084 The same situation can arise with something like this:
5087 template <class T> class C {
5091 when `C<int>' is instantiated. Now, `f(int)' is defined
5094 if (!new_friend_is_defn)
5095 /* On the other hand, if the in-class declaration does
5096 *not* provide a definition, then we don't want to alter
5097 existing definitions. We can just leave everything
5102 /* Overwrite whatever template info was there before, if
5103 any, with the new template information pertaining to
5105 DECL_TEMPLATE_INFO (old_decl) = new_friend_template_info;
5107 if (TREE_CODE (old_decl) != TEMPLATE_DECL)
5108 reregister_specialization (new_friend,
5109 most_general_template (old_decl),
5114 tree new_friend_args;
5116 DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (old_decl))
5117 = new_friend_result_template_info;
5119 new_friend_args = TI_ARGS (new_friend_template_info);
5120 for (t = DECL_TEMPLATE_SPECIALIZATIONS (old_decl);
5124 tree spec = TREE_VALUE (t);
5127 = add_outermost_template_args (new_friend_args,
5128 DECL_TI_ARGS (spec));
5131 /* Now, since specializations are always supposed to
5132 hang off of the most general template, we must move
5134 t = most_general_template (old_decl);
5137 DECL_TEMPLATE_SPECIALIZATIONS (t)
5138 = chainon (DECL_TEMPLATE_SPECIALIZATIONS (t),
5139 DECL_TEMPLATE_SPECIALIZATIONS (old_decl));
5140 DECL_TEMPLATE_SPECIALIZATIONS (old_decl) = NULL_TREE;
5145 /* The information from NEW_FRIEND has been merged into OLD_DECL
5146 by duplicate_decls. */
5147 new_friend = old_decl;
5150 else if (COMPLETE_TYPE_P (DECL_CONTEXT (new_friend)))
5152 /* Check to see that the declaration is really present, and,
5153 possibly obtain an improved declaration. */
5154 tree fn = check_classfn (DECL_CONTEXT (new_friend),
5155 new_friend, NULL_TREE);
5162 input_location = saved_loc;
5166 /* FRIEND_TMPL is a friend TEMPLATE_DECL. ARGS is the vector of
5167 template arguments, as for tsubst.
5169 Returns an appropriate tsubst'd friend type or error_mark_node on
5173 tsubst_friend_class (tree friend_tmpl, tree args)
5179 context = DECL_CONTEXT (friend_tmpl);
5183 if (TREE_CODE (context) == NAMESPACE_DECL)
5184 push_nested_namespace (context);
5186 push_nested_class (tsubst (context, args, tf_none, NULL_TREE));
5189 /* First, we look for a class template. */
5190 tmpl = lookup_name (DECL_NAME (friend_tmpl), /*prefer_type=*/0);
5192 /* But, if we don't find one, it might be because we're in a
5193 situation like this:
5201 Here, in the scope of (say) S<int>, `S' is bound to a TYPE_DECL
5202 for `S<int>', not the TEMPLATE_DECL. */
5203 if (!tmpl || !DECL_CLASS_TEMPLATE_P (tmpl))
5205 tmpl = lookup_name (DECL_NAME (friend_tmpl), /*prefer_type=*/1);
5206 tmpl = maybe_get_template_decl_from_type_decl (tmpl);
5209 if (tmpl && DECL_CLASS_TEMPLATE_P (tmpl))
5211 /* The friend template has already been declared. Just
5212 check to see that the declarations match, and install any new
5213 default parameters. We must tsubst the default parameters,
5214 of course. We only need the innermost template parameters
5215 because that is all that redeclare_class_template will look
5217 if (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (friend_tmpl))
5218 > TMPL_ARGS_DEPTH (args))
5221 parms = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_tmpl),
5222 args, tf_error | tf_warning);
5223 redeclare_class_template (TREE_TYPE (tmpl), parms);
5226 friend_type = TREE_TYPE (tmpl);
5230 /* The friend template has not already been declared. In this
5231 case, the instantiation of the template class will cause the
5232 injection of this template into the global scope. */
5233 tmpl = tsubst (friend_tmpl, args, tf_error | tf_warning, NULL_TREE);
5235 /* The new TMPL is not an instantiation of anything, so we
5236 forget its origins. We don't reset CLASSTYPE_TI_TEMPLATE for
5237 the new type because that is supposed to be the corresponding
5238 template decl, i.e., TMPL. */
5239 DECL_USE_TEMPLATE (tmpl) = 0;
5240 DECL_TEMPLATE_INFO (tmpl) = NULL_TREE;
5241 CLASSTYPE_USE_TEMPLATE (TREE_TYPE (tmpl)) = 0;
5242 CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl))
5243 = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl)));
5245 /* Inject this template into the global scope. */
5246 friend_type = TREE_TYPE (pushdecl_top_level (tmpl));
5251 if (TREE_CODE (context) == NAMESPACE_DECL)
5252 pop_nested_namespace (context);
5254 pop_nested_class ();
5260 /* Returns zero if TYPE cannot be completed later due to circularity.
5261 Otherwise returns one. */
5264 can_complete_type_without_circularity (tree type)
5266 if (type == NULL_TREE || type == error_mark_node)
5268 else if (COMPLETE_TYPE_P (type))
5270 else if (TREE_CODE (type) == ARRAY_TYPE && TYPE_DOMAIN (type))
5271 return can_complete_type_without_circularity (TREE_TYPE (type));
5272 else if (CLASS_TYPE_P (type)
5273 && TYPE_BEING_DEFINED (TYPE_MAIN_VARIANT (type)))
5280 instantiate_class_template (tree type)
5282 tree template, args, pattern, t, member;
5286 if (type == error_mark_node)
5287 return error_mark_node;
5289 if (TYPE_BEING_DEFINED (type)
5290 || COMPLETE_TYPE_P (type)
5291 || dependent_type_p (type))
5294 /* Figure out which template is being instantiated. */
5295 template = most_general_template (CLASSTYPE_TI_TEMPLATE (type));
5296 my_friendly_assert (TREE_CODE (template) == TEMPLATE_DECL, 279);
5298 /* Figure out which arguments are being used to do the
5300 args = CLASSTYPE_TI_ARGS (type);
5302 /* Determine what specialization of the original template to
5304 t = most_specialized_class (template, args);
5305 if (t == error_mark_node)
5307 const char *str = "candidates are:";
5308 error ("ambiguous class template instantiation for `%#T'", type);
5309 for (t = DECL_TEMPLATE_SPECIALIZATIONS (template); t;
5312 if (get_class_bindings (TREE_VALUE (t), TREE_PURPOSE (t), args))
5314 cp_error_at ("%s %+#T", str, TREE_TYPE (t));
5318 TYPE_BEING_DEFINED (type) = 1;
5319 return error_mark_node;
5323 pattern = TREE_TYPE (t);
5325 pattern = TREE_TYPE (template);
5327 /* If the template we're instantiating is incomplete, then clearly
5328 there's nothing we can do. */
5329 if (!COMPLETE_TYPE_P (pattern))
5332 /* If we've recursively instantiated too many templates, stop. */
5333 if (! push_tinst_level (type))
5336 /* Now we're really doing the instantiation. Mark the type as in
5337 the process of being defined. */
5338 TYPE_BEING_DEFINED (type) = 1;
5340 /* We may be in the middle of deferred access check. Disable
5342 push_deferring_access_checks (dk_no_deferred);
5344 push_to_top_level ();
5348 /* This TYPE is actually an instantiation of a partial
5349 specialization. We replace the innermost set of ARGS with
5350 the arguments appropriate for substitution. For example,
5353 template <class T> struct S {};
5354 template <class T> struct S<T*> {};
5356 and supposing that we are instantiating S<int*>, ARGS will
5357 present be {int*} but we need {int}. */
5359 = get_class_bindings (TREE_VALUE (t), TREE_PURPOSE (t),
5362 /* If there were multiple levels in ARGS, replacing the
5363 innermost level would alter CLASSTYPE_TI_ARGS, which we don't
5364 want, so we make a copy first. */
5365 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args))
5367 args = copy_node (args);
5368 SET_TMPL_ARGS_LEVEL (args, TMPL_ARGS_DEPTH (args), inner_args);
5374 SET_CLASSTYPE_INTERFACE_UNKNOWN (type);
5376 /* Set the input location to the template definition. This is needed
5377 if tsubsting causes an error. */
5378 input_location = DECL_SOURCE_LOCATION (TYPE_NAME (pattern));
5380 TYPE_HAS_CONSTRUCTOR (type) = TYPE_HAS_CONSTRUCTOR (pattern);
5381 TYPE_HAS_DESTRUCTOR (type) = TYPE_HAS_DESTRUCTOR (pattern);
5382 TYPE_HAS_NEW_OPERATOR (type) = TYPE_HAS_NEW_OPERATOR (pattern);
5383 TYPE_HAS_ARRAY_NEW_OPERATOR (type) = TYPE_HAS_ARRAY_NEW_OPERATOR (pattern);
5384 TYPE_GETS_DELETE (type) = TYPE_GETS_DELETE (pattern);
5385 TYPE_HAS_ASSIGN_REF (type) = TYPE_HAS_ASSIGN_REF (pattern);
5386 TYPE_HAS_CONST_ASSIGN_REF (type) = TYPE_HAS_CONST_ASSIGN_REF (pattern);
5387 TYPE_HAS_ABSTRACT_ASSIGN_REF (type) = TYPE_HAS_ABSTRACT_ASSIGN_REF (pattern);
5388 TYPE_HAS_INIT_REF (type) = TYPE_HAS_INIT_REF (pattern);
5389 TYPE_HAS_CONST_INIT_REF (type) = TYPE_HAS_CONST_INIT_REF (pattern);
5390 TYPE_HAS_DEFAULT_CONSTRUCTOR (type) = TYPE_HAS_DEFAULT_CONSTRUCTOR (pattern);
5391 TYPE_HAS_CONVERSION (type) = TYPE_HAS_CONVERSION (pattern);
5392 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (type)
5393 = TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (pattern);
5394 TYPE_USES_MULTIPLE_INHERITANCE (type)
5395 = TYPE_USES_MULTIPLE_INHERITANCE (pattern);
5396 TYPE_USES_VIRTUAL_BASECLASSES (type)
5397 = TYPE_USES_VIRTUAL_BASECLASSES (pattern);
5398 TYPE_PACKED (type) = TYPE_PACKED (pattern);
5399 TYPE_ALIGN (type) = TYPE_ALIGN (pattern);
5400 TYPE_USER_ALIGN (type) = TYPE_USER_ALIGN (pattern);
5401 TYPE_FOR_JAVA (type) = TYPE_FOR_JAVA (pattern); /* For libjava's JArray<T> */
5402 if (ANON_AGGR_TYPE_P (pattern))
5403 SET_ANON_AGGR_TYPE_P (type);
5405 pbinfo = TYPE_BINFO (pattern);
5407 #ifdef ENABLE_CHECKING
5408 if (DECL_CLASS_SCOPE_P (TYPE_MAIN_DECL (pattern))
5409 && ! COMPLETE_TYPE_P (TYPE_CONTEXT (type))
5410 && ! TYPE_BEING_DEFINED (TYPE_CONTEXT (type)))
5411 /* We should never instantiate a nested class before its enclosing
5412 class; we need to look up the nested class by name before we can
5413 instantiate it, and that lookup should instantiate the enclosing
5418 if (BINFO_BASETYPES (pbinfo))
5420 tree base_list = NULL_TREE;
5421 tree pbases = BINFO_BASETYPES (pbinfo);
5422 tree paccesses = BINFO_BASEACCESSES (pbinfo);
5423 tree context = TYPE_CONTEXT (type);
5427 /* We must enter the scope containing the type, as that is where
5428 the accessibility of types named in dependent bases are
5430 pop_p = push_scope (context ? context : global_namespace);
5432 /* Substitute into each of the bases to determine the actual
5434 for (i = 0; i < TREE_VEC_LENGTH (pbases); ++i)
5440 pbase = TREE_VEC_ELT (pbases, i);
5441 access = TREE_VEC_ELT (paccesses, i);
5443 /* Substitute to figure out the base class. */
5444 base = tsubst (BINFO_TYPE (pbase), args, tf_error, NULL_TREE);
5445 if (base == error_mark_node)
5448 base_list = tree_cons (access, base, base_list);
5449 TREE_VIA_VIRTUAL (base_list) = TREE_VIA_VIRTUAL (pbase);
5452 /* The list is now in reverse order; correct that. */
5453 base_list = nreverse (base_list);
5455 /* Now call xref_basetypes to set up all the base-class
5457 xref_basetypes (type, base_list);
5460 pop_scope (context ? context : global_namespace);
5463 /* Now that our base classes are set up, enter the scope of the
5464 class, so that name lookups into base classes, etc. will work
5465 correctly. This is precisely analogous to what we do in
5466 begin_class_definition when defining an ordinary non-template
5470 /* Now members are processed in the order of declaration. */
5471 for (member = CLASSTYPE_DECL_LIST (pattern);
5472 member; member = TREE_CHAIN (member))
5474 tree t = TREE_VALUE (member);
5476 if (TREE_PURPOSE (member))
5480 /* Build new CLASSTYPE_NESTED_UTDS. */
5483 tree name = TYPE_IDENTIFIER (tag);
5486 newtag = tsubst (tag, args, tf_error, NULL_TREE);
5487 if (newtag == error_mark_node)
5490 if (TREE_CODE (newtag) != ENUMERAL_TYPE)
5492 if (TYPE_LANG_SPECIFIC (tag) && CLASSTYPE_IS_TEMPLATE (tag))
5493 /* Unfortunately, lookup_template_class sets
5494 CLASSTYPE_IMPLICIT_INSTANTIATION for a partial
5495 instantiation (i.e., for the type of a member
5496 template class nested within a template class.)
5497 This behavior is required for
5498 maybe_process_partial_specialization to work
5499 correctly, but is not accurate in this case;
5500 the TAG is not an instantiation of anything.
5501 (The corresponding TEMPLATE_DECL is an
5502 instantiation, but the TYPE is not.) */
5503 CLASSTYPE_USE_TEMPLATE (newtag) = 0;
5505 /* Now, we call pushtag to put this NEWTAG into the scope of
5506 TYPE. We first set up the IDENTIFIER_TYPE_VALUE to avoid
5507 pushtag calling push_template_decl. We don't have to do
5508 this for enums because it will already have been done in
5511 SET_IDENTIFIER_TYPE_VALUE (name, newtag);
5512 pushtag (name, newtag, /*globalize=*/0);
5515 else if (TREE_CODE (t) == FUNCTION_DECL
5516 || DECL_FUNCTION_TEMPLATE_P (t))
5518 /* Build new TYPE_METHODS. */
5521 if (TREE_CODE (t) == TEMPLATE_DECL)
5522 ++processing_template_decl;
5523 r = tsubst (t, args, tf_error, NULL_TREE);
5524 if (TREE_CODE (t) == TEMPLATE_DECL)
5525 --processing_template_decl;
5526 set_current_access_from_decl (r);
5527 grok_special_member_properties (r);
5528 finish_member_declaration (r);
5532 /* Build new TYPE_FIELDS. */
5534 if (TREE_CODE (t) != CONST_DECL)
5538 /* The the file and line for this declaration, to
5539 assist in error message reporting. Since we
5540 called push_tinst_level above, we don't need to
5542 input_location = DECL_SOURCE_LOCATION (t);
5544 if (TREE_CODE (t) == TEMPLATE_DECL)
5545 ++processing_template_decl;
5546 r = tsubst (t, args, tf_error | tf_warning, NULL_TREE);
5547 if (TREE_CODE (t) == TEMPLATE_DECL)
5548 --processing_template_decl;
5549 if (TREE_CODE (r) == VAR_DECL)
5553 if (DECL_INITIALIZED_IN_CLASS_P (r))
5554 init = tsubst_expr (DECL_INITIAL (t), args,
5555 tf_error | tf_warning, NULL_TREE);
5559 finish_static_data_member_decl
5560 (r, init, /*asmspec_tree=*/NULL_TREE, /*flags=*/0);
5562 if (DECL_INITIALIZED_IN_CLASS_P (r))
5563 check_static_variable_definition (r, TREE_TYPE (r));
5565 else if (TREE_CODE (r) == FIELD_DECL)
5567 /* Determine whether R has a valid type and can be
5568 completed later. If R is invalid, then it is
5569 replaced by error_mark_node so that it will not be
5570 added to TYPE_FIELDS. */
5571 tree rtype = TREE_TYPE (r);
5572 if (can_complete_type_without_circularity (rtype))
5573 complete_type (rtype);
5575 if (!COMPLETE_TYPE_P (rtype))
5577 cxx_incomplete_type_error (r, rtype);
5578 r = error_mark_node;
5582 /* If it is a TYPE_DECL for a class-scoped ENUMERAL_TYPE,
5583 such a thing will already have been added to the field
5584 list by tsubst_enum in finish_member_declaration in the
5585 CLASSTYPE_NESTED_UTDS case above. */
5586 if (!(TREE_CODE (r) == TYPE_DECL
5587 && TREE_CODE (TREE_TYPE (r)) == ENUMERAL_TYPE
5588 && DECL_ARTIFICIAL (r)))
5590 set_current_access_from_decl (r);
5591 finish_member_declaration (r);
5598 if (TYPE_P (t) || DECL_CLASS_TEMPLATE_P (t))
5600 /* Build new CLASSTYPE_FRIEND_CLASSES. */
5602 tree friend_type = t;
5603 tree new_friend_type;
5605 if (TREE_CODE (friend_type) == TEMPLATE_DECL)
5606 new_friend_type = tsubst_friend_class (friend_type, args);
5607 else if (uses_template_parms (friend_type))
5608 new_friend_type = tsubst (friend_type, args,
5609 tf_error | tf_warning, NULL_TREE);
5610 else if (CLASSTYPE_USE_TEMPLATE (friend_type))
5611 new_friend_type = friend_type;
5614 tree ns = decl_namespace_context (TYPE_MAIN_DECL (friend_type));
5616 /* The call to xref_tag_from_type does injection for friend
5618 push_nested_namespace (ns);
5620 xref_tag_from_type (friend_type, NULL_TREE, 1);
5621 pop_nested_namespace (ns);
5624 if (TREE_CODE (friend_type) == TEMPLATE_DECL)
5625 /* Trick make_friend_class into realizing that the friend
5626 we're adding is a template, not an ordinary class. It's
5627 important that we use make_friend_class since it will
5628 perform some error-checking and output cross-reference
5630 ++processing_template_decl;
5632 if (new_friend_type != error_mark_node)
5633 make_friend_class (type, new_friend_type,
5634 /*complain=*/false);
5636 if (TREE_CODE (friend_type) == TEMPLATE_DECL)
5637 --processing_template_decl;
5641 /* Build new DECL_FRIENDLIST. */
5644 if (TREE_CODE (t) == TEMPLATE_DECL)
5645 ++processing_template_decl;
5646 r = tsubst_friend_function (t, args);
5647 if (TREE_CODE (t) == TEMPLATE_DECL)
5648 --processing_template_decl;
5649 add_friend (type, r, /*complain=*/false);
5654 /* Set the file and line number information to whatever is given for
5655 the class itself. This puts error messages involving generated
5656 implicit functions at a predictable point, and the same point
5657 that would be used for non-template classes. */
5658 typedecl = TYPE_MAIN_DECL (type);
5659 input_location = DECL_SOURCE_LOCATION (typedecl);
5661 unreverse_member_declarations (type);
5662 finish_struct_1 (type);
5664 /* Clear this now so repo_template_used is happy. */
5665 TYPE_BEING_DEFINED (type) = 0;
5666 repo_template_used (type);
5668 /* Now that the class is complete, instantiate default arguments for
5669 any member functions. We don't do this earlier because the
5670 default arguments may reference members of the class. */
5671 if (!PRIMARY_TEMPLATE_P (template))
5672 for (t = TYPE_METHODS (type); t; t = TREE_CHAIN (t))
5673 if (TREE_CODE (t) == FUNCTION_DECL
5674 /* Implicitly generated member functions will not have template
5675 information; they are not instantiations, but instead are
5676 created "fresh" for each instantiation. */
5677 && DECL_TEMPLATE_INFO (t))
5678 tsubst_default_arguments (t);
5681 pop_from_top_level ();
5682 pop_deferring_access_checks ();
5685 if (TYPE_CONTAINS_VPTR_P (type))
5686 keyed_classes = tree_cons (NULL_TREE, type, keyed_classes);
5692 tsubst_template_arg (tree t, tree args, tsubst_flags_t complain, tree in_decl)
5698 else if (TYPE_P (t))
5699 r = tsubst (t, args, complain, in_decl);
5702 r = tsubst_expr (t, args, complain, in_decl);
5704 if (!uses_template_parms (r))
5706 /* Sometimes, one of the args was an expression involving a
5707 template constant parameter, like N - 1. Now that we've
5708 tsubst'd, we might have something like 2 - 1. This will
5709 confuse lookup_template_class, so we do constant folding
5710 here. We have to unset processing_template_decl, to fool
5711 tsubst_copy_and_build() into building an actual tree. */
5713 /* If the TREE_TYPE of ARG is not NULL_TREE, ARG is already
5714 as simple as it's going to get, and trying to reprocess
5715 the trees will break. Once tsubst_expr et al DTRT for
5716 non-dependent exprs, this code can go away, as the type
5717 will always be set. */
5720 int saved_processing_template_decl = processing_template_decl;
5721 processing_template_decl = 0;
5722 r = tsubst_copy_and_build (r, /*args=*/NULL_TREE,
5723 tf_error, /*in_decl=*/NULL_TREE,
5724 /*function_p=*/false);
5725 processing_template_decl = saved_processing_template_decl;
5733 /* Substitute ARGS into the vector or list of template arguments T. */
5736 tsubst_template_args (tree t, tree args, tsubst_flags_t complain, tree in_decl)
5738 int len = TREE_VEC_LENGTH (t);
5739 int need_new = 0, i;
5740 tree *elts = alloca (len * sizeof (tree));
5742 for (i = 0; i < len; i++)
5744 tree orig_arg = TREE_VEC_ELT (t, i);
5747 if (TREE_CODE (orig_arg) == TREE_VEC)
5748 new_arg = tsubst_template_args (orig_arg, args, complain, in_decl);
5750 new_arg = tsubst_template_arg (orig_arg, args, complain, in_decl);
5752 if (new_arg == error_mark_node)
5753 return error_mark_node;
5756 if (new_arg != orig_arg)
5763 t = make_tree_vec (len);
5764 for (i = 0; i < len; i++)
5765 TREE_VEC_ELT (t, i) = elts[i];
5770 /* Return the result of substituting ARGS into the template parameters
5771 given by PARMS. If there are m levels of ARGS and m + n levels of
5772 PARMS, then the result will contain n levels of PARMS. For
5773 example, if PARMS is `template <class T> template <class U>
5774 template <T*, U, class V>' and ARGS is {{int}, {double}} then the
5775 result will be `template <int*, double, class V>'. */
5778 tsubst_template_parms (tree parms, tree args, tsubst_flags_t complain)
5783 for (new_parms = &r;
5784 TMPL_PARMS_DEPTH (parms) > TMPL_ARGS_DEPTH (args);
5785 new_parms = &(TREE_CHAIN (*new_parms)),
5786 parms = TREE_CHAIN (parms))
5789 make_tree_vec (TREE_VEC_LENGTH (TREE_VALUE (parms)));
5792 for (i = 0; i < TREE_VEC_LENGTH (new_vec); ++i)
5794 tree tuple = TREE_VEC_ELT (TREE_VALUE (parms), i);
5795 tree default_value = TREE_PURPOSE (tuple);
5796 tree parm_decl = TREE_VALUE (tuple);
5798 parm_decl = tsubst (parm_decl, args, complain, NULL_TREE);
5799 default_value = tsubst_template_arg (default_value, args,
5800 complain, NULL_TREE);
5802 tuple = build_tree_list (default_value, parm_decl);
5803 TREE_VEC_ELT (new_vec, i) = tuple;
5807 tree_cons (size_int (TMPL_PARMS_DEPTH (parms)
5808 - TMPL_ARGS_DEPTH (args)),
5809 new_vec, NULL_TREE);
5815 /* Substitute the ARGS into the indicated aggregate (or enumeration)
5816 type T. If T is not an aggregate or enumeration type, it is
5817 handled as if by tsubst. IN_DECL is as for tsubst. If
5818 ENTERING_SCOPE is nonzero, T is the context for a template which
5819 we are presently tsubst'ing. Return the substituted value. */
5822 tsubst_aggr_type (tree t,
5824 tsubst_flags_t complain,
5831 switch (TREE_CODE (t))
5834 if (TYPE_PTRMEMFUNC_P (t))
5835 return tsubst (TYPE_PTRMEMFUNC_FN_TYPE (t), args, complain, in_decl);
5837 /* Else fall through. */
5840 if (TYPE_TEMPLATE_INFO (t))
5846 /* First, determine the context for the type we are looking
5848 context = TYPE_CONTEXT (t);
5850 context = tsubst_aggr_type (context, args, complain,
5851 in_decl, /*entering_scope=*/1);
5853 /* Then, figure out what arguments are appropriate for the
5854 type we are trying to find. For example, given:
5856 template <class T> struct S;
5857 template <class T, class U> void f(T, U) { S<U> su; }
5859 and supposing that we are instantiating f<int, double>,
5860 then our ARGS will be {int, double}, but, when looking up
5861 S we only want {double}. */
5862 argvec = tsubst_template_args (TYPE_TI_ARGS (t), args,
5864 if (argvec == error_mark_node)
5865 return error_mark_node;
5867 r = lookup_template_class (t, argvec, in_decl, context,
5868 entering_scope, complain);
5870 return cp_build_qualified_type_real (r, TYPE_QUALS (t), complain);
5873 /* This is not a template type, so there's nothing to do. */
5877 return tsubst (t, args, complain, in_decl);
5881 /* Substitute into the default argument ARG (a default argument for
5882 FN), which has the indicated TYPE. */
5885 tsubst_default_argument (tree fn, tree type, tree arg)
5887 /* This default argument came from a template. Instantiate the
5888 default argument here, not in tsubst. In the case of
5897 we must be careful to do name lookup in the scope of S<T>,
5898 rather than in the current class.
5900 ??? current_class_type affects a lot more than name lookup. This is
5901 very fragile. Fortunately, it will go away when we do 2-phase name
5902 binding properly. */
5904 /* FN is already the desired FUNCTION_DECL. */
5905 push_access_scope (fn);
5906 /* The default argument expression should not be considered to be
5907 within the scope of FN. Since push_access_scope sets
5908 current_function_decl, we must explicitly clear it here. */
5909 current_function_decl = NULL_TREE;
5911 arg = tsubst_expr (arg, DECL_TI_ARGS (fn),
5912 tf_error | tf_warning, NULL_TREE);
5914 pop_access_scope (fn);
5916 /* Make sure the default argument is reasonable. */
5917 arg = check_default_argument (type, arg);
5922 /* Substitute into all the default arguments for FN. */
5925 tsubst_default_arguments (tree fn)
5930 tmpl_args = DECL_TI_ARGS (fn);
5932 /* If this function is not yet instantiated, we certainly don't need
5933 its default arguments. */
5934 if (uses_template_parms (tmpl_args))
5937 for (arg = TYPE_ARG_TYPES (TREE_TYPE (fn));
5939 arg = TREE_CHAIN (arg))
5940 if (TREE_PURPOSE (arg))
5941 TREE_PURPOSE (arg) = tsubst_default_argument (fn,
5943 TREE_PURPOSE (arg));
5946 /* Substitute the ARGS into the T, which is a _DECL. TYPE is the
5947 (already computed) substitution of ARGS into TREE_TYPE (T), if
5948 appropriate. Return the result of the substitution. Issue error
5949 and warning messages under control of COMPLAIN. */
5952 tsubst_decl (tree t, tree args, tree type, tsubst_flags_t complain)
5954 location_t saved_loc;
5958 /* Set the filename and linenumber to improve error-reporting. */
5959 saved_loc = input_location;
5960 input_location = DECL_SOURCE_LOCATION (t);
5962 switch (TREE_CODE (t))
5966 /* We can get here when processing a member template function
5967 of a template class. */
5968 tree decl = DECL_TEMPLATE_RESULT (t);
5970 int is_template_template_parm = DECL_TEMPLATE_TEMPLATE_PARM_P (t);
5972 if (!is_template_template_parm)
5974 /* We might already have an instance of this template.
5975 The ARGS are for the surrounding class type, so the
5976 full args contain the tsubst'd args for the context,
5977 plus the innermost args from the template decl. */
5978 tree tmpl_args = DECL_CLASS_TEMPLATE_P (t)
5979 ? CLASSTYPE_TI_ARGS (TREE_TYPE (t))
5980 : DECL_TI_ARGS (DECL_TEMPLATE_RESULT (t));
5983 full_args = tsubst_template_args (tmpl_args, args,
5986 /* tsubst_template_args doesn't copy the vector if
5987 nothing changed. But, *something* should have
5989 my_friendly_assert (full_args != tmpl_args, 0);
5991 spec = retrieve_specialization (t, full_args);
5992 if (spec != NULL_TREE)
5999 /* Make a new template decl. It will be similar to the
6000 original, but will record the current template arguments.
6001 We also create a new function declaration, which is just
6002 like the old one, but points to this new template, rather
6003 than the old one. */
6005 my_friendly_assert (DECL_LANG_SPECIFIC (r) != 0, 0);
6006 TREE_CHAIN (r) = NULL_TREE;
6008 if (is_template_template_parm)
6010 tree new_decl = tsubst (decl, args, complain, in_decl);
6011 DECL_TEMPLATE_RESULT (r) = new_decl;
6012 TREE_TYPE (r) = TREE_TYPE (new_decl);
6017 = tsubst_aggr_type (DECL_CONTEXT (t), args,
6019 /*entering_scope=*/1);
6020 DECL_TEMPLATE_INFO (r) = build_tree_list (t, args);
6022 if (TREE_CODE (decl) == TYPE_DECL)
6024 tree new_type = tsubst (TREE_TYPE (t), args, complain, in_decl);
6025 if (new_type == error_mark_node)
6026 return error_mark_node;
6028 TREE_TYPE (r) = new_type;
6029 CLASSTYPE_TI_TEMPLATE (new_type) = r;
6030 DECL_TEMPLATE_RESULT (r) = TYPE_MAIN_DECL (new_type);
6031 DECL_TI_ARGS (r) = CLASSTYPE_TI_ARGS (new_type);
6035 tree new_decl = tsubst (decl, args, complain, in_decl);
6036 if (new_decl == error_mark_node)
6037 return error_mark_node;
6039 DECL_TEMPLATE_RESULT (r) = new_decl;
6040 DECL_TI_TEMPLATE (new_decl) = r;
6041 TREE_TYPE (r) = TREE_TYPE (new_decl);
6042 DECL_TI_ARGS (r) = DECL_TI_ARGS (new_decl);
6045 SET_DECL_IMPLICIT_INSTANTIATION (r);
6046 DECL_TEMPLATE_INSTANTIATIONS (r) = NULL_TREE;
6047 DECL_TEMPLATE_SPECIALIZATIONS (r) = NULL_TREE;
6049 /* The template parameters for this new template are all the
6050 template parameters for the old template, except the
6051 outermost level of parameters. */
6052 DECL_TEMPLATE_PARMS (r)
6053 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t), args,
6056 if (PRIMARY_TEMPLATE_P (t))
6057 DECL_PRIMARY_TEMPLATE (r) = r;
6059 if (TREE_CODE (decl) != TYPE_DECL)
6060 /* Record this non-type partial instantiation. */
6061 register_specialization (r, t,
6062 DECL_TI_ARGS (DECL_TEMPLATE_RESULT (r)));
6069 tree argvec = NULL_TREE;
6076 /* Nobody should be tsubst'ing into non-template functions. */
6077 my_friendly_assert (DECL_TEMPLATE_INFO (t) != NULL_TREE, 0);
6079 if (TREE_CODE (DECL_TI_TEMPLATE (t)) == TEMPLATE_DECL)
6084 /* If T is not dependent, just return it. We have to
6085 increment PROCESSING_TEMPLATE_DECL because
6086 value_dependent_expression_p assumes that nothing is
6087 dependent when PROCESSING_TEMPLATE_DECL is zero. */
6088 ++processing_template_decl;
6089 dependent_p = value_dependent_expression_p (t);
6090 --processing_template_decl;
6094 /* Calculate the most general template of which R is a
6095 specialization, and the complete set of arguments used to
6097 gen_tmpl = most_general_template (DECL_TI_TEMPLATE (t));
6098 argvec = tsubst_template_args (DECL_TI_ARGS
6099 (DECL_TEMPLATE_RESULT (gen_tmpl)),
6100 args, complain, in_decl);
6102 /* Check to see if we already have this specialization. */
6103 spec = retrieve_specialization (gen_tmpl, argvec);
6111 /* We can see more levels of arguments than parameters if
6112 there was a specialization of a member template, like
6115 template <class T> struct S { template <class U> void f(); }
6116 template <> template <class U> void S<int>::f(U);
6118 Here, we'll be substituting into the specialization,
6119 because that's where we can find the code we actually
6120 want to generate, but we'll have enough arguments for
6121 the most general template.
6123 We also deal with the peculiar case:
6125 template <class T> struct S {
6126 template <class U> friend void f();
6128 template <class U> void f() {}
6130 template void f<double>();
6132 Here, the ARGS for the instantiation of will be {int,
6133 double}. But, we only need as many ARGS as there are
6134 levels of template parameters in CODE_PATTERN. We are
6135 careful not to get fooled into reducing the ARGS in
6138 template <class T> struct S { template <class U> void f(U); }
6139 template <class T> template <> void S<T>::f(int) {}
6141 which we can spot because the pattern will be a
6142 specialization in this case. */
6143 args_depth = TMPL_ARGS_DEPTH (args);
6145 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (t)));
6146 if (args_depth > parms_depth
6147 && !DECL_TEMPLATE_SPECIALIZATION (t))
6148 args = get_innermost_template_args (args, parms_depth);
6152 /* This special case arises when we have something like this:
6154 template <class T> struct S {
6155 friend void f<int>(int, double);
6158 Here, the DECL_TI_TEMPLATE for the friend declaration
6159 will be an IDENTIFIER_NODE. We are being called from
6160 tsubst_friend_function, and we want only to create a
6161 new decl (R) with appropriate types so that we can call
6162 determine_specialization. */
6163 gen_tmpl = NULL_TREE;
6166 if (DECL_CLASS_SCOPE_P (t))
6168 if (DECL_NAME (t) == constructor_name (DECL_CONTEXT (t)))
6172 ctx = tsubst_aggr_type (DECL_CONTEXT (t), args,
6173 complain, t, /*entering_scope=*/1);
6178 ctx = DECL_CONTEXT (t);
6180 type = tsubst (type, args, complain, in_decl);
6181 if (type == error_mark_node)
6182 return error_mark_node;
6184 /* We do NOT check for matching decls pushed separately at this
6185 point, as they may not represent instantiations of this
6186 template, and in any case are considered separate under the
6189 DECL_USE_TEMPLATE (r) = 0;
6190 TREE_TYPE (r) = type;
6191 /* Clear out the mangled name and RTL for the instantiation. */
6192 SET_DECL_ASSEMBLER_NAME (r, NULL_TREE);
6193 SET_DECL_RTL (r, NULL_RTX);
6194 DECL_INITIAL (r) = NULL_TREE;
6195 DECL_CONTEXT (r) = ctx;
6197 if (member && DECL_CONV_FN_P (r))
6198 /* Type-conversion operator. Reconstruct the name, in
6199 case it's the name of one of the template's parameters. */
6200 DECL_NAME (r) = mangle_conv_op_name_for_type (TREE_TYPE (type));
6202 DECL_ARGUMENTS (r) = tsubst (DECL_ARGUMENTS (t), args,
6204 DECL_RESULT (r) = NULL_TREE;
6206 TREE_STATIC (r) = 0;
6207 TREE_PUBLIC (r) = TREE_PUBLIC (t);
6208 DECL_EXTERNAL (r) = 1;
6209 DECL_INTERFACE_KNOWN (r) = 0;
6210 DECL_DEFER_OUTPUT (r) = 0;
6211 TREE_CHAIN (r) = NULL_TREE;
6212 DECL_PENDING_INLINE_INFO (r) = 0;
6213 DECL_PENDING_INLINE_P (r) = 0;
6214 DECL_SAVED_TREE (r) = NULL_TREE;
6216 if (DECL_CLONED_FUNCTION (r))
6218 DECL_CLONED_FUNCTION (r) = tsubst (DECL_CLONED_FUNCTION (t),
6220 TREE_CHAIN (r) = TREE_CHAIN (DECL_CLONED_FUNCTION (r));
6221 TREE_CHAIN (DECL_CLONED_FUNCTION (r)) = r;
6224 /* Set up the DECL_TEMPLATE_INFO for R. There's no need to do
6225 this in the special friend case mentioned above where
6226 GEN_TMPL is NULL. */
6229 DECL_TEMPLATE_INFO (r)
6230 = tree_cons (gen_tmpl, argvec, NULL_TREE);
6231 SET_DECL_IMPLICIT_INSTANTIATION (r);
6232 register_specialization (r, gen_tmpl, argvec);
6234 /* We're not supposed to instantiate default arguments
6235 until they are called, for a template. But, for a
6238 template <class T> void f ()
6239 { extern void g(int i = T()); }
6241 we should do the substitution when the template is
6242 instantiated. We handle the member function case in
6243 instantiate_class_template since the default arguments
6244 might refer to other members of the class. */
6246 && !PRIMARY_TEMPLATE_P (gen_tmpl)
6247 && !uses_template_parms (argvec))
6248 tsubst_default_arguments (r);
6251 /* Copy the list of befriending classes. */
6252 for (friends = &DECL_BEFRIENDING_CLASSES (r);
6254 friends = &TREE_CHAIN (*friends))
6256 *friends = copy_node (*friends);
6257 TREE_VALUE (*friends) = tsubst (TREE_VALUE (*friends),
6262 if (DECL_CONSTRUCTOR_P (r) || DECL_DESTRUCTOR_P (r))
6264 maybe_retrofit_in_chrg (r);
6265 if (DECL_CONSTRUCTOR_P (r))
6266 grok_ctor_properties (ctx, r);
6267 /* If this is an instantiation of a member template, clone it.
6268 If it isn't, that'll be handled by
6269 clone_constructors_and_destructors. */
6270 if (PRIMARY_TEMPLATE_P (gen_tmpl))
6271 clone_function_decl (r, /*update_method_vec_p=*/0);
6273 else if (IDENTIFIER_OPNAME_P (DECL_NAME (r)))
6274 grok_op_properties (r, DECL_FRIEND_P (r),
6275 (complain & tf_error) != 0);
6282 if (DECL_TEMPLATE_PARM_P (t))
6283 SET_DECL_TEMPLATE_PARM_P (r);
6285 TREE_TYPE (r) = type;
6286 c_apply_type_quals_to_decl (cp_type_quals (type), r);
6288 if (DECL_INITIAL (r))
6290 if (TREE_CODE (DECL_INITIAL (r)) != TEMPLATE_PARM_INDEX)
6291 DECL_INITIAL (r) = TREE_TYPE (r);
6293 DECL_INITIAL (r) = tsubst (DECL_INITIAL (r), args,
6297 DECL_CONTEXT (r) = NULL_TREE;
6299 if (!DECL_TEMPLATE_PARM_P (r))
6300 DECL_ARG_TYPE (r) = type_passed_as (type);
6302 TREE_CHAIN (r) = tsubst (TREE_CHAIN (t), args,
6303 complain, TREE_CHAIN (t));
6310 TREE_TYPE (r) = type;
6311 c_apply_type_quals_to_decl (cp_type_quals (type), r);
6313 /* We don't have to set DECL_CONTEXT here; it is set by
6314 finish_member_declaration. */
6315 DECL_INITIAL (r) = tsubst_expr (DECL_INITIAL (t), args,
6317 TREE_CHAIN (r) = NULL_TREE;
6318 if (VOID_TYPE_P (type))
6319 cp_error_at ("instantiation of `%D' as type `%T'", r, type);
6326 /* It is not a dependent using decl any more. */
6327 TREE_TYPE (r) = void_type_node;
6329 = tsubst_copy (DECL_INITIAL (t), args, complain, in_decl);
6331 = tsubst_copy (DECL_NAME (t), args, complain, in_decl);
6332 TREE_CHAIN (r) = NULL_TREE;
6337 if (TREE_CODE (type) == TEMPLATE_TEMPLATE_PARM
6338 || t == TYPE_MAIN_DECL (TREE_TYPE (t)))
6340 /* If this is the canonical decl, we don't have to mess with
6341 instantiations, and often we can't (for typename, template
6342 type parms and such). Note that TYPE_NAME is not correct for
6343 the above test if we've copied the type for a typedef. */
6344 r = TYPE_NAME (type);
6352 tree argvec = NULL_TREE;
6353 tree gen_tmpl = NULL_TREE;
6355 tree tmpl = NULL_TREE;
6359 /* Assume this is a non-local variable. */
6362 if (TYPE_P (CP_DECL_CONTEXT (t)))
6363 ctx = tsubst_aggr_type (DECL_CONTEXT (t), args,
6365 in_decl, /*entering_scope=*/1);
6366 else if (DECL_NAMESPACE_SCOPE_P (t))
6367 ctx = DECL_CONTEXT (t);
6370 /* Subsequent calls to pushdecl will fill this in. */
6375 /* Check to see if we already have this specialization. */
6378 tmpl = DECL_TI_TEMPLATE (t);
6379 gen_tmpl = most_general_template (tmpl);
6380 argvec = tsubst (DECL_TI_ARGS (t), args, complain, in_decl);
6381 spec = retrieve_specialization (gen_tmpl, argvec);
6384 spec = retrieve_local_specialization (t);
6393 if (TREE_CODE (r) == VAR_DECL)
6395 type = complete_type (type);
6396 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (r)
6397 = DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (t);
6399 else if (DECL_SELF_REFERENCE_P (t))
6400 SET_DECL_SELF_REFERENCE_P (r);
6401 TREE_TYPE (r) = type;
6402 c_apply_type_quals_to_decl (cp_type_quals (type), r);
6403 DECL_CONTEXT (r) = ctx;
6404 /* Clear out the mangled name and RTL for the instantiation. */
6405 SET_DECL_ASSEMBLER_NAME (r, NULL_TREE);
6406 SET_DECL_RTL (r, NULL_RTX);
6408 /* Don't try to expand the initializer until someone tries to use
6409 this variable; otherwise we run into circular dependencies. */
6410 DECL_INITIAL (r) = NULL_TREE;
6411 SET_DECL_RTL (r, NULL_RTX);
6412 DECL_SIZE (r) = DECL_SIZE_UNIT (r) = 0;
6414 /* Even if the original location is out of scope, the newly
6415 substituted one is not. */
6416 if (TREE_CODE (r) == VAR_DECL)
6418 DECL_DEAD_FOR_LOCAL (r) = 0;
6419 DECL_INITIALIZED_P (r) = 0;
6424 /* A static data member declaration is always marked
6425 external when it is declared in-class, even if an
6426 initializer is present. We mimic the non-template
6428 DECL_EXTERNAL (r) = 1;
6430 register_specialization (r, gen_tmpl, argvec);
6431 DECL_TEMPLATE_INFO (r) = tree_cons (tmpl, argvec, NULL_TREE);
6432 SET_DECL_IMPLICIT_INSTANTIATION (r);
6435 register_local_specialization (r, t);
6437 TREE_CHAIN (r) = NULL_TREE;
6438 if (TREE_CODE (r) == VAR_DECL && VOID_TYPE_P (type))
6439 cp_error_at ("instantiation of `%D' as type `%T'", r, type);
6440 /* Compute the size, alignment, etc. of R. */
6449 /* Restore the file and line information. */
6450 input_location = saved_loc;
6455 /* Substitute into the ARG_TYPES of a function type. */
6458 tsubst_arg_types (tree arg_types,
6460 tsubst_flags_t complain,
6463 tree remaining_arg_types;
6466 if (!arg_types || arg_types == void_list_node)
6469 remaining_arg_types = tsubst_arg_types (TREE_CHAIN (arg_types),
6470 args, complain, in_decl);
6471 if (remaining_arg_types == error_mark_node)
6472 return error_mark_node;
6474 type = tsubst (TREE_VALUE (arg_types), args, complain, in_decl);
6475 if (type == error_mark_node)
6476 return error_mark_node;
6477 if (VOID_TYPE_P (type))
6479 if (complain & tf_error)
6481 error ("invalid parameter type `%T'", type);
6483 cp_error_at ("in declaration `%D'", in_decl);
6485 return error_mark_node;
6488 /* Do array-to-pointer, function-to-pointer conversion, and ignore
6489 top-level qualifiers as required. */
6490 type = TYPE_MAIN_VARIANT (type_decays_to (type));
6492 /* Note that we do not substitute into default arguments here. The
6493 standard mandates that they be instantiated only when needed,
6494 which is done in build_over_call. */
6495 return hash_tree_cons (TREE_PURPOSE (arg_types), type,
6496 remaining_arg_types);
6500 /* Substitute into a FUNCTION_TYPE or METHOD_TYPE. This routine does
6501 *not* handle the exception-specification for FNTYPE, because the
6502 initial substitution of explicitly provided template parameters
6503 during argument deduction forbids substitution into the
6504 exception-specification:
6508 All references in the function type of the function template to the
6509 corresponding template parameters are replaced by the specified tem-
6510 plate argument values. If a substitution in a template parameter or
6511 in the function type of the function template results in an invalid
6512 type, type deduction fails. [Note: The equivalent substitution in
6513 exception specifications is done only when the function is instanti-
6514 ated, at which point a program is ill-formed if the substitution
6515 results in an invalid type.] */
6518 tsubst_function_type (tree t,
6520 tsubst_flags_t complain,
6527 /* The TYPE_CONTEXT is not used for function/method types. */
6528 my_friendly_assert (TYPE_CONTEXT (t) == NULL_TREE, 0);
6530 /* Substitute the return type. */
6531 return_type = tsubst (TREE_TYPE (t), args, complain, in_decl);
6532 if (return_type == error_mark_node)
6533 return error_mark_node;
6535 /* Substitute the argument types. */
6536 arg_types = tsubst_arg_types (TYPE_ARG_TYPES (t), args,
6538 if (arg_types == error_mark_node)
6539 return error_mark_node;
6541 /* Construct a new type node and return it. */
6542 if (TREE_CODE (t) == FUNCTION_TYPE)
6543 fntype = build_function_type (return_type, arg_types);
6546 tree r = TREE_TYPE (TREE_VALUE (arg_types));
6547 if (! IS_AGGR_TYPE (r))
6551 Type deduction may fail for any of the following
6554 -- Attempting to create "pointer to member of T" when T
6555 is not a class type. */
6556 if (complain & tf_error)
6557 error ("creating pointer to member function of non-class type `%T'",
6559 return error_mark_node;
6562 fntype = build_method_type_directly (r, return_type,
6563 TREE_CHAIN (arg_types));
6565 fntype = cp_build_qualified_type_real (fntype, TYPE_QUALS (t), complain);
6566 fntype = cp_build_type_attribute_variant (fntype, TYPE_ATTRIBUTES (t));
6571 /* Substitute into the PARMS of a call-declarator. */
6574 tsubst_call_declarator_parms (tree parms,
6576 tsubst_flags_t complain,
6583 if (!parms || parms == void_list_node)
6586 new_parms = tsubst_call_declarator_parms (TREE_CHAIN (parms),
6587 args, complain, in_decl);
6589 /* Figure out the type of this parameter. */
6590 type = tsubst (TREE_VALUE (parms), args, complain, in_decl);
6592 /* Figure out the default argument as well. Note that we use
6593 tsubst_expr since the default argument is really an expression. */
6594 defarg = tsubst_expr (TREE_PURPOSE (parms), args, complain, in_decl);
6596 /* Chain this parameter on to the front of those we have already
6597 processed. We don't use hash_tree_cons because that function
6598 doesn't check TREE_PARMLIST. */
6599 new_parms = tree_cons (defarg, type, new_parms);
6601 /* And note that these are parameters. */
6602 TREE_PARMLIST (new_parms) = 1;
6607 /* Take the tree structure T and replace template parameters used
6608 therein with the argument vector ARGS. IN_DECL is an associated
6609 decl for diagnostics. If an error occurs, returns ERROR_MARK_NODE.
6610 Issue error and warning messages under control of COMPLAIN. Note
6611 that we must be relatively non-tolerant of extensions here, in
6612 order to preserve conformance; if we allow substitutions that
6613 should not be allowed, we may allow argument deductions that should
6614 not succeed, and therefore report ambiguous overload situations
6615 where there are none. In theory, we could allow the substitution,
6616 but indicate that it should have failed, and allow our caller to
6617 make sure that the right thing happens, but we don't try to do this
6620 This function is used for dealing with types, decls and the like;
6621 for expressions, use tsubst_expr or tsubst_copy. */
6624 tsubst (tree t, tree args, tsubst_flags_t complain, tree in_decl)
6628 if (t == NULL_TREE || t == error_mark_node
6629 || t == integer_type_node
6630 || t == void_type_node
6631 || t == char_type_node
6632 || TREE_CODE (t) == NAMESPACE_DECL)
6635 if (TREE_CODE (t) == IDENTIFIER_NODE)
6636 type = IDENTIFIER_TYPE_VALUE (t);
6638 type = TREE_TYPE (t);
6640 my_friendly_assert (type != unknown_type_node, 20030716);
6642 if (type && TREE_CODE (t) != FUNCTION_DECL
6643 && TREE_CODE (t) != TYPENAME_TYPE
6644 && TREE_CODE (t) != TEMPLATE_DECL
6645 && TREE_CODE (t) != IDENTIFIER_NODE
6646 && TREE_CODE (t) != FUNCTION_TYPE
6647 && TREE_CODE (t) != METHOD_TYPE)
6648 type = tsubst (type, args, complain, in_decl);
6649 if (type == error_mark_node)
6650 return error_mark_node;
6653 return tsubst_decl (t, args, type, complain);
6655 switch (TREE_CODE (t))
6660 return tsubst_aggr_type (t, args, complain, in_decl,
6661 /*entering_scope=*/0);
6664 case IDENTIFIER_NODE:
6676 if (t == integer_type_node)
6679 if (TREE_CODE (TYPE_MIN_VALUE (t)) == INTEGER_CST
6680 && TREE_CODE (TYPE_MAX_VALUE (t)) == INTEGER_CST)
6684 tree max, omax = TREE_OPERAND (TYPE_MAX_VALUE (t), 0);
6686 /* The array dimension behaves like a non-type template arg,
6687 in that we want to fold it as much as possible. */
6688 max = tsubst_template_arg (omax, args, complain, in_decl);
6689 if (!processing_template_decl)
6690 max = decl_constant_value (max);
6692 if (integer_zerop (omax))
6694 /* Still allow an explicit array of size zero. */
6696 pedwarn ("creating array with size zero");
6698 else if (integer_zerop (max)
6699 || (TREE_CODE (max) == INTEGER_CST
6700 && INT_CST_LT (max, integer_zero_node)))
6704 Type deduction may fail for any of the following
6707 Attempting to create an array with a size that is
6708 zero or negative. */
6709 if (complain & tf_error)
6710 error ("creating array with size zero (`%E')", max);
6712 return error_mark_node;
6715 return compute_array_index_type (NULL_TREE, max);
6718 case TEMPLATE_TYPE_PARM:
6719 case TEMPLATE_TEMPLATE_PARM:
6720 case BOUND_TEMPLATE_TEMPLATE_PARM:
6721 case TEMPLATE_PARM_INDEX:
6729 if (TREE_CODE (t) == TEMPLATE_TYPE_PARM
6730 || TREE_CODE (t) == TEMPLATE_TEMPLATE_PARM
6731 || TREE_CODE (t) == BOUND_TEMPLATE_TEMPLATE_PARM)
6733 idx = TEMPLATE_TYPE_IDX (t);
6734 level = TEMPLATE_TYPE_LEVEL (t);
6738 idx = TEMPLATE_PARM_IDX (t);
6739 level = TEMPLATE_PARM_LEVEL (t);
6742 if (TREE_VEC_LENGTH (args) > 0)
6744 tree arg = NULL_TREE;
6746 levels = TMPL_ARGS_DEPTH (args);
6747 if (level <= levels)
6748 arg = TMPL_ARG (args, level, idx);
6750 if (arg == error_mark_node)
6751 return error_mark_node;
6752 else if (arg != NULL_TREE)
6754 if (TREE_CODE (t) == TEMPLATE_TYPE_PARM)
6756 my_friendly_assert (TYPE_P (arg), 0);
6757 return cp_build_qualified_type_real
6758 (arg, cp_type_quals (arg) | cp_type_quals (t),
6759 complain | tf_ignore_bad_quals);
6761 else if (TREE_CODE (t) == BOUND_TEMPLATE_TEMPLATE_PARM)
6763 /* We are processing a type constructed from
6764 a template template parameter. */
6765 tree argvec = tsubst (TYPE_TI_ARGS (t),
6766 args, complain, in_decl);
6767 if (argvec == error_mark_node)
6768 return error_mark_node;
6770 /* We can get a TEMPLATE_TEMPLATE_PARM here when
6771 we are resolving nested-types in the signature of
6772 a member function templates.
6773 Otherwise ARG is a TEMPLATE_DECL and is the real
6774 template to be instantiated. */
6775 if (TREE_CODE (arg) == TEMPLATE_TEMPLATE_PARM)
6776 arg = TYPE_NAME (arg);
6778 r = lookup_template_class (arg,
6781 /*entering_scope=*/0,
6783 return cp_build_qualified_type_real
6784 (r, TYPE_QUALS (t), complain);
6787 /* TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX. */
6795 /* This can happen during the attempted tsubst'ing in
6796 unify. This means that we don't yet have any information
6797 about the template parameter in question. */
6800 /* If we get here, we must have been looking at a parm for a
6801 more deeply nested template. Make a new version of this
6802 template parameter, but with a lower level. */
6803 switch (TREE_CODE (t))
6805 case TEMPLATE_TYPE_PARM:
6806 case TEMPLATE_TEMPLATE_PARM:
6807 case BOUND_TEMPLATE_TEMPLATE_PARM:
6808 if (cp_type_quals (t))
6810 r = tsubst (TYPE_MAIN_VARIANT (t), args, complain, in_decl);
6811 r = cp_build_qualified_type_real
6812 (r, cp_type_quals (t),
6813 complain | (TREE_CODE (t) == TEMPLATE_TYPE_PARM
6814 ? tf_ignore_bad_quals : 0));
6819 TEMPLATE_TYPE_PARM_INDEX (r)
6820 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (t),
6822 TYPE_STUB_DECL (r) = TYPE_NAME (r) = TEMPLATE_TYPE_DECL (r);
6823 TYPE_MAIN_VARIANT (r) = r;
6824 TYPE_POINTER_TO (r) = NULL_TREE;
6825 TYPE_REFERENCE_TO (r) = NULL_TREE;
6827 if (TREE_CODE (t) == BOUND_TEMPLATE_TEMPLATE_PARM)
6829 tree argvec = tsubst (TYPE_TI_ARGS (t), args,
6831 if (argvec == error_mark_node)
6832 return error_mark_node;
6834 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (r)
6835 = tree_cons (TYPE_TI_TEMPLATE (t), argvec, NULL_TREE);
6840 case TEMPLATE_PARM_INDEX:
6841 r = reduce_template_parm_level (t, type, levels);
6853 tree purpose, value, chain, result;
6855 if (t == void_list_node)
6858 purpose = TREE_PURPOSE (t);
6861 purpose = tsubst (purpose, args, complain, in_decl);
6862 if (purpose == error_mark_node)
6863 return error_mark_node;
6865 value = TREE_VALUE (t);
6868 value = tsubst (value, args, complain, in_decl);
6869 if (value == error_mark_node)
6870 return error_mark_node;
6872 chain = TREE_CHAIN (t);
6873 if (chain && chain != void_type_node)
6875 chain = tsubst (chain, args, complain, in_decl);
6876 if (chain == error_mark_node)
6877 return error_mark_node;
6879 if (purpose == TREE_PURPOSE (t)
6880 && value == TREE_VALUE (t)
6881 && chain == TREE_CHAIN (t))
6883 if (TREE_PARMLIST (t))
6885 result = tree_cons (purpose, value, chain);
6886 TREE_PARMLIST (result) = 1;
6889 result = hash_tree_cons (purpose, value, chain);
6893 if (type != NULL_TREE)
6895 /* A binfo node. We always need to make a copy, of the node
6896 itself and of its BINFO_BASETYPES. */
6900 /* Make sure type isn't a typedef copy. */
6901 type = BINFO_TYPE (TYPE_BINFO (type));
6903 TREE_TYPE (t) = complete_type (type);
6904 if (IS_AGGR_TYPE (type))
6906 BINFO_VTABLE (t) = TYPE_BINFO_VTABLE (type);
6907 BINFO_VIRTUALS (t) = TYPE_BINFO_VIRTUALS (type);
6908 if (TYPE_BINFO_BASETYPES (type) != NULL_TREE)
6909 BINFO_BASETYPES (t) = copy_node (TYPE_BINFO_BASETYPES (type));
6914 /* Otherwise, a vector of template arguments. */
6915 return tsubst_template_args (t, args, complain, in_decl);
6918 case REFERENCE_TYPE:
6920 enum tree_code code;
6922 if (type == TREE_TYPE (t) && TREE_CODE (type) != METHOD_TYPE)
6925 code = TREE_CODE (t);
6930 Type deduction may fail for any of the following
6933 -- Attempting to create a pointer to reference type.
6934 -- Attempting to create a reference to a reference type or
6935 a reference to void. */
6936 if (TREE_CODE (type) == REFERENCE_TYPE
6937 || (code == REFERENCE_TYPE && TREE_CODE (type) == VOID_TYPE))
6939 static location_t last_loc;
6941 /* We keep track of the last time we issued this error
6942 message to avoid spewing a ton of messages during a
6943 single bad template instantiation. */
6944 if (complain & tf_error
6945 && (last_loc.line != input_line
6946 || last_loc.file != input_filename))
6948 if (TREE_CODE (type) == VOID_TYPE)
6949 error ("forming reference to void");
6951 error ("forming %s to reference type `%T'",
6952 (code == POINTER_TYPE) ? "pointer" : "reference",
6954 last_loc = input_location;
6957 return error_mark_node;
6959 else if (code == POINTER_TYPE)
6961 r = build_pointer_type (type);
6962 if (TREE_CODE (type) == METHOD_TYPE)
6963 r = build_ptrmemfunc_type (r);
6966 r = build_reference_type (type);
6967 r = cp_build_qualified_type_real (r, TYPE_QUALS (t), complain);
6969 if (r != error_mark_node)
6970 /* Will this ever be needed for TYPE_..._TO values? */
6977 r = tsubst (TYPE_OFFSET_BASETYPE (t), args, complain, in_decl);
6978 if (r == error_mark_node || !IS_AGGR_TYPE (r))
6982 Type deduction may fail for any of the following
6985 -- Attempting to create "pointer to member of T" when T
6986 is not a class type. */
6987 if (complain & tf_error)
6988 error ("creating pointer to member of non-class type `%T'", r);
6989 return error_mark_node;
6991 if (TREE_CODE (type) == REFERENCE_TYPE)
6993 if (complain & tf_error)
6994 error ("creating pointer to member reference type `%T'", type);
6996 return error_mark_node;
6998 my_friendly_assert (TREE_CODE (type) != METHOD_TYPE, 20011231);
6999 if (TREE_CODE (type) == FUNCTION_TYPE)
7001 /* This is really a method type. The cv qualifiers of the
7002 this pointer should _not_ be determined by the cv
7003 qualifiers of the class type. They should be held
7004 somewhere in the FUNCTION_TYPE, but we don't do that at
7005 the moment. Consider
7006 typedef void (Func) () const;
7008 template <typename T1> void Foo (Func T1::*);
7013 method_type = build_method_type_directly (TYPE_MAIN_VARIANT (r),
7015 TYPE_ARG_TYPES (type));
7016 return build_ptrmemfunc_type (build_pointer_type (method_type));
7019 return cp_build_qualified_type_real (build_ptrmem_type (r, type),
7029 fntype = tsubst_function_type (t, args, complain, in_decl);
7030 if (fntype == error_mark_node)
7031 return error_mark_node;
7033 /* Substitute the exception specification. */
7034 raises = TYPE_RAISES_EXCEPTIONS (t);
7037 tree list = NULL_TREE;
7039 if (! TREE_VALUE (raises))
7042 for (; raises != NULL_TREE; raises = TREE_CHAIN (raises))
7044 tree spec = TREE_VALUE (raises);
7046 spec = tsubst (spec, args, complain, in_decl);
7047 if (spec == error_mark_node)
7049 list = add_exception_specifier (list, spec, complain);
7051 fntype = build_exception_variant (fntype, list);
7057 tree domain = tsubst (TYPE_DOMAIN (t), args, complain, in_decl);
7058 if (domain == error_mark_node)
7059 return error_mark_node;
7061 /* As an optimization, we avoid regenerating the array type if
7062 it will obviously be the same as T. */
7063 if (type == TREE_TYPE (t) && domain == TYPE_DOMAIN (t))
7066 /* These checks should match the ones in grokdeclarator.
7070 The deduction may fail for any of the following reasons:
7072 -- Attempting to create an array with an element type that
7073 is void, a function type, or a reference type, or [DR337]
7074 an abstract class type. */
7075 if (TREE_CODE (type) == VOID_TYPE
7076 || TREE_CODE (type) == FUNCTION_TYPE
7077 || TREE_CODE (type) == REFERENCE_TYPE)
7079 if (complain & tf_error)
7080 error ("creating array of `%T'", type);
7081 return error_mark_node;
7083 if (CLASS_TYPE_P (type) && CLASSTYPE_PURE_VIRTUALS (type))
7085 if (complain & tf_error)
7086 error ("creating array of `%T', which is an abstract class type",
7088 return error_mark_node;
7091 r = build_cplus_array_type (type, domain);
7098 tree e1 = tsubst (TREE_OPERAND (t, 0), args, complain, in_decl);
7099 tree e2 = tsubst (TREE_OPERAND (t, 1), args, complain, in_decl);
7101 if (e1 == error_mark_node || e2 == error_mark_node)
7102 return error_mark_node;
7104 return fold (build (TREE_CODE (t), TREE_TYPE (t), e1, e2));
7110 tree e = tsubst (TREE_OPERAND (t, 0), args, complain, in_decl);
7111 if (e == error_mark_node)
7112 return error_mark_node;
7114 return fold (build (TREE_CODE (t), TREE_TYPE (t), e));
7119 tree ctx = tsubst_aggr_type (TYPE_CONTEXT (t), args, complain,
7120 in_decl, /*entering_scope=*/1);
7121 tree f = tsubst_copy (TYPENAME_TYPE_FULLNAME (t), args,
7124 if (ctx == error_mark_node || f == error_mark_node)
7125 return error_mark_node;
7127 if (!IS_AGGR_TYPE (ctx))
7129 if (complain & tf_error)
7130 error ("`%T' is not a class, struct, or union type",
7132 return error_mark_node;
7134 else if (!uses_template_parms (ctx) && !TYPE_BEING_DEFINED (ctx))
7136 /* Normally, make_typename_type does not require that the CTX
7137 have complete type in order to allow things like:
7139 template <class T> struct S { typename S<T>::X Y; };
7141 But, such constructs have already been resolved by this
7142 point, so here CTX really should have complete type, unless
7143 it's a partial instantiation. */
7144 ctx = complete_type (ctx);
7145 if (!COMPLETE_TYPE_P (ctx))
7147 if (complain & tf_error)
7148 cxx_incomplete_type_error (NULL_TREE, ctx);
7149 return error_mark_node;
7153 f = make_typename_type (ctx, f,
7154 (complain & tf_error) | tf_keep_type_decl);
7155 if (f == error_mark_node)
7157 if (TREE_CODE (f) == TYPE_DECL)
7159 complain |= tf_ignore_bad_quals;
7163 return cp_build_qualified_type_real
7164 (f, cp_type_quals (f) | cp_type_quals (t), complain);
7167 case UNBOUND_CLASS_TEMPLATE:
7169 tree ctx = tsubst_aggr_type (TYPE_CONTEXT (t), args, complain,
7170 in_decl, /*entering_scope=*/1);
7171 tree name = TYPE_IDENTIFIER (t);
7173 if (ctx == error_mark_node || name == error_mark_node)
7174 return error_mark_node;
7176 return make_unbound_class_template (ctx, name, complain);
7181 tree e = tsubst (TREE_OPERAND (t, 0), args, complain, in_decl);
7182 if (e == error_mark_node)
7183 return error_mark_node;
7184 return make_pointer_declarator (type, e);
7189 tree e = tsubst (TREE_OPERAND (t, 0), args, complain, in_decl);
7190 if (e == error_mark_node)
7191 return error_mark_node;
7192 return make_reference_declarator (type, e);
7197 tree e1 = tsubst (TREE_OPERAND (t, 0), args, complain, in_decl);
7198 tree e2 = tsubst_expr (TREE_OPERAND (t, 1), args, complain, in_decl);
7199 if (e1 == error_mark_node || e2 == error_mark_node)
7200 return error_mark_node;
7202 return build_nt (ARRAY_REF, e1, e2);
7207 tree e1 = tsubst (TREE_OPERAND (t, 0), args, complain, in_decl);
7208 tree e2 = (tsubst_call_declarator_parms
7209 (CALL_DECLARATOR_PARMS (t), args, complain, in_decl));
7210 tree e3 = tsubst (CALL_DECLARATOR_EXCEPTION_SPEC (t), args,
7213 if (e1 == error_mark_node || e2 == error_mark_node
7214 || e3 == error_mark_node)
7215 return error_mark_node;
7217 return make_call_declarator (e1, e2, CALL_DECLARATOR_QUALS (t), e3);
7222 tree e1 = tsubst (TREE_OPERAND (t, 0), args, complain, in_decl);
7223 tree e2 = tsubst (TREE_OPERAND (t, 1), args, complain, in_decl);
7224 if (e1 == error_mark_node || e2 == error_mark_node)
7225 return error_mark_node;
7227 return build_nt (TREE_CODE (t), e1, e2);
7234 type = finish_typeof (tsubst_expr (TYPEOF_TYPE_EXPR (t), args,
7235 complain, in_decl));
7236 return cp_build_qualified_type_real (type,
7238 | cp_type_quals (type),
7243 sorry ("use of `%s' in template",
7244 tree_code_name [(int) TREE_CODE (t)]);
7245 return error_mark_node;
7249 /* Like tsubst_expr for a BASELINK. OBJECT_TYPE, if non-NULL, is the
7250 type of the expression on the left-hand side of the "." or "->"
7254 tsubst_baselink (tree baselink, tree object_type,
7255 tree args, tsubst_flags_t complain, tree in_decl)
7258 tree qualifying_scope;
7260 tree template_args = 0;
7261 bool template_id_p = false;
7263 /* A baselink indicates a function from a base class. The
7264 BASELINK_ACCESS_BINFO and BASELINK_BINFO are going to have
7265 non-dependent types; otherwise, the lookup could not have
7266 succeeded. However, they may indicate bases of the template
7267 class, rather than the instantiated class.
7269 In addition, lookups that were not ambiguous before may be
7270 ambiguous now. Therefore, we perform the lookup again. */
7271 qualifying_scope = BINFO_TYPE (BASELINK_ACCESS_BINFO (baselink));
7272 fns = BASELINK_FUNCTIONS (baselink);
7273 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)
7275 template_id_p = true;
7276 template_args = TREE_OPERAND (fns, 1);
7277 fns = TREE_OPERAND (fns, 0);
7279 template_args = tsubst_template_args (template_args, args,
7282 name = DECL_NAME (get_first_fn (fns));
7283 baselink = lookup_fnfields (qualifying_scope, name, /*protect=*/1);
7284 if (BASELINK_P (baselink) && template_id_p)
7285 BASELINK_FUNCTIONS (baselink)
7286 = build_nt (TEMPLATE_ID_EXPR,
7287 BASELINK_FUNCTIONS (baselink),
7290 object_type = current_class_type;
7291 return adjust_result_of_qualified_name_lookup (baselink,
7296 /* Like tsubst_expr for a SCOPE_REF, given by QUALIFIED_ID. DONE is
7297 true if the qualified-id will be a postfix-expression in-and-of
7298 itself; false if more of the postfix-expression follows the
7299 QUALIFIED_ID. ADDRESS_P is true if the qualified-id is the operand
7303 tsubst_qualified_id (tree qualified_id, tree args,
7304 tsubst_flags_t complain, tree in_decl,
7305 bool done, bool address_p)
7313 my_friendly_assert (TREE_CODE (qualified_id) == SCOPE_REF, 20030706);
7315 /* Figure out what name to look up. */
7316 name = TREE_OPERAND (qualified_id, 1);
7317 if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
7320 template_args = TREE_OPERAND (name, 1);
7322 template_args = tsubst_template_args (template_args, args,
7324 name = TREE_OPERAND (name, 0);
7328 is_template = false;
7329 template_args = NULL_TREE;
7332 /* Substitute into the qualifying scope. When there are no ARGS, we
7333 are just trying to simplify a non-dependent expression. In that
7334 case the qualifying scope may be dependent, and, in any case,
7335 substituting will not help. */
7336 scope = TREE_OPERAND (qualified_id, 0);
7339 scope = tsubst (scope, args, complain, in_decl);
7340 expr = tsubst_copy (name, args, complain, in_decl);
7345 if (dependent_type_p (scope))
7346 return build_nt (SCOPE_REF, scope, expr);
7348 if (!BASELINK_P (name) && !DECL_P (expr))
7350 expr = lookup_qualified_name (scope, expr, /*is_type_p=*/0, false);
7351 if (TREE_CODE (TREE_CODE (expr) == TEMPLATE_DECL
7352 ? DECL_TEMPLATE_RESULT (expr) : expr) == TYPE_DECL)
7354 if (complain & tf_error)
7356 error ("dependent-name `%E' is parsed as a non-type, but "
7357 "instantiation yields a type", qualified_id);
7358 inform ("say `typename %E' if a type is meant", qualified_id);
7360 return error_mark_node;
7365 check_accessibility_of_qualified_id (expr, /*object_type=*/NULL_TREE,
7368 /* Remember that there was a reference to this entity. */
7373 expr = lookup_template_function (expr, template_args);
7375 if (expr == error_mark_node && complain & tf_error)
7376 qualified_name_lookup_error (scope, TREE_OPERAND (qualified_id, 1));
7377 else if (TYPE_P (scope))
7379 expr = (adjust_result_of_qualified_name_lookup
7380 (expr, scope, current_class_type));
7381 expr = finish_qualified_id_expr (scope, expr, done, address_p);
7387 /* Like tsubst, but deals with expressions. This function just replaces
7388 template parms; to finish processing the resultant expression, use
7392 tsubst_copy (tree t, tree args, tsubst_flags_t complain, tree in_decl)
7394 enum tree_code code;
7397 if (t == NULL_TREE || t == error_mark_node)
7400 code = TREE_CODE (t);
7405 r = retrieve_local_specialization (t);
7406 my_friendly_assert (r != NULL, 20020903);
7415 if (DECL_TEMPLATE_PARM_P (t))
7416 return tsubst_copy (DECL_INITIAL (t), args, complain, in_decl);
7417 /* There is no need to substitute into namespace-scope
7419 if (DECL_NAMESPACE_SCOPE_P (t))
7422 /* Unfortunately, we cannot just call lookup_name here.
7425 template <int I> int f() {
7427 struct S { void g() { E e = a; } };
7430 When we instantiate f<7>::S::g(), say, lookup_name is not
7431 clever enough to find f<7>::a. */
7433 = tsubst_aggr_type (TREE_TYPE (t), args, complain, in_decl,
7434 /*entering_scope=*/0);
7436 for (v = TYPE_VALUES (enum_type);
7439 if (TREE_PURPOSE (v) == DECL_NAME (t))
7440 return TREE_VALUE (v);
7442 /* We didn't find the name. That should never happen; if
7443 name-lookup found it during preliminary parsing, we
7444 should find it again here during instantiation. */
7450 if (DECL_CONTEXT (t))
7454 ctx = tsubst_aggr_type (DECL_CONTEXT (t), args, complain, in_decl,
7455 /*entering_scope=*/1);
7456 if (ctx != DECL_CONTEXT (t))
7457 return lookup_field (ctx, DECL_NAME (t), 0, false);
7463 if ((DECL_LANG_SPECIFIC (t) && DECL_TEMPLATE_INFO (t))
7464 || local_variable_p (t))
7465 t = tsubst (t, args, complain, in_decl);
7470 return tsubst_baselink (t, current_class_type, args, complain, in_decl);
7473 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t))
7474 return tsubst (TREE_TYPE (DECL_TEMPLATE_RESULT (t)),
7475 args, complain, in_decl);
7476 else if (is_member_template (t))
7477 return tsubst (t, args, complain, in_decl);
7478 else if (DECL_CLASS_SCOPE_P (t)
7479 && uses_template_parms (DECL_CONTEXT (t)))
7481 /* Template template argument like the following example need
7484 template <template <class> class TT> struct C {};
7485 template <class T> struct D {
7486 template <class U> struct E {};
7491 We are processing the template argument `E' in #1 for
7492 the template instantiation #2. Originally, `E' is a
7493 TEMPLATE_DECL with `D<T>' as its DECL_CONTEXT. Now we
7494 have to substitute this with one having context `D<int>'. */
7496 tree context = tsubst (DECL_CONTEXT (t), args, complain, in_decl);
7497 return lookup_field (context, DECL_NAME(t), 0, false);
7500 /* Ordinary template template argument. */
7504 case REINTERPRET_CAST_EXPR:
7505 case CONST_CAST_EXPR:
7506 case STATIC_CAST_EXPR:
7507 case DYNAMIC_CAST_EXPR:
7510 (code, tsubst (TREE_TYPE (t), args, complain, in_decl),
7511 tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl));
7515 case TRUTH_NOT_EXPR:
7518 case CONVERT_EXPR: /* Unary + */
7527 (code, tsubst (TREE_TYPE (t), args, complain, in_decl),
7528 tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl));
7535 object = tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl);
7536 name = TREE_OPERAND (t, 1);
7537 if (TREE_CODE (name) == BIT_NOT_EXPR)
7539 name = tsubst_copy (TREE_OPERAND (name, 0), args,
7541 name = build1 (BIT_NOT_EXPR, NULL_TREE, name);
7543 else if (TREE_CODE (name) == SCOPE_REF
7544 && TREE_CODE (TREE_OPERAND (name, 1)) == BIT_NOT_EXPR)
7546 tree base = tsubst_copy (TREE_OPERAND (name, 0), args,
7548 name = TREE_OPERAND (name, 1);
7549 name = tsubst_copy (TREE_OPERAND (name, 0), args,
7551 name = build1 (BIT_NOT_EXPR, NULL_TREE, name);
7552 name = build_nt (SCOPE_REF, base, name);
7554 else if (TREE_CODE (name) == BASELINK)
7555 name = tsubst_baselink (name,
7556 non_reference (TREE_TYPE (object)),
7560 name = tsubst_copy (name, args, complain, in_decl);
7561 return build_nt (COMPONENT_REF, object, name);
7567 case TRUNC_DIV_EXPR:
7569 case FLOOR_DIV_EXPR:
7570 case ROUND_DIV_EXPR:
7571 case EXACT_DIV_EXPR:
7575 case TRUNC_MOD_EXPR:
7576 case FLOOR_MOD_EXPR:
7577 case TRUTH_ANDIF_EXPR:
7578 case TRUTH_ORIF_EXPR:
7579 case TRUTH_AND_EXPR:
7598 case PREDECREMENT_EXPR:
7599 case PREINCREMENT_EXPR:
7600 case POSTDECREMENT_EXPR:
7601 case POSTINCREMENT_EXPR:
7603 (code, tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl),
7604 tsubst_copy (TREE_OPERAND (t, 1), args, complain, in_decl));
7607 return build_nt (code,
7608 tsubst_copy (TREE_OPERAND (t, 0), args,
7610 tsubst_copy (TREE_OPERAND (t, 1), args, complain,
7615 /* This processing should really occur in tsubst_expr. However,
7616 tsubst_expr does not recurse into expressions, since it
7617 assumes that there aren't any statements inside them. So, we
7618 need to expand the STMT_EXPR here. */
7619 if (!processing_template_decl)
7621 tree stmt_expr = begin_stmt_expr ();
7623 tsubst_expr (STMT_EXPR_STMT (t), args,
7624 complain | tf_stmt_expr_cmpd, in_decl);
7625 return finish_stmt_expr (stmt_expr, false);
7632 case PSEUDO_DTOR_EXPR:
7635 (code, tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl),
7636 tsubst_copy (TREE_OPERAND (t, 1), args, complain, in_decl),
7637 tsubst_copy (TREE_OPERAND (t, 2), args, complain, in_decl));
7644 (code, tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl),
7645 tsubst_copy (TREE_OPERAND (t, 1), args, complain, in_decl),
7646 tsubst_copy (TREE_OPERAND (t, 2), args, complain, in_decl));
7647 NEW_EXPR_USE_GLOBAL (r) = NEW_EXPR_USE_GLOBAL (t);
7654 (code, tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl),
7655 tsubst_copy (TREE_OPERAND (t, 1), args, complain, in_decl));
7656 DELETE_EXPR_USE_GLOBAL (r) = DELETE_EXPR_USE_GLOBAL (t);
7657 DELETE_EXPR_USE_VEC (r) = DELETE_EXPR_USE_VEC (t);
7661 case TEMPLATE_ID_EXPR:
7663 /* Substituted template arguments */
7664 tree fn = TREE_OPERAND (t, 0);
7665 tree targs = TREE_OPERAND (t, 1);
7667 fn = tsubst_copy (fn, args, complain, in_decl);
7669 targs = tsubst_template_args (targs, args, complain, in_decl);
7671 return lookup_template_function (fn, targs);
7676 tree purpose, value, chain;
7678 if (t == void_list_node)
7681 purpose = TREE_PURPOSE (t);
7683 purpose = tsubst_copy (purpose, args, complain, in_decl);
7684 value = TREE_VALUE (t);
7686 value = tsubst_copy (value, args, complain, in_decl);
7687 chain = TREE_CHAIN (t);
7688 if (chain && chain != void_type_node)
7689 chain = tsubst_copy (chain, args, complain, in_decl);
7690 if (purpose == TREE_PURPOSE (t)
7691 && value == TREE_VALUE (t)
7692 && chain == TREE_CHAIN (t))
7694 return tree_cons (purpose, value, chain);
7701 case TEMPLATE_TYPE_PARM:
7702 case TEMPLATE_TEMPLATE_PARM:
7703 case BOUND_TEMPLATE_TEMPLATE_PARM:
7704 case TEMPLATE_PARM_INDEX:
7706 case REFERENCE_TYPE:
7712 case UNBOUND_CLASS_TEMPLATE:
7715 return tsubst (t, args, complain, in_decl);
7717 case IDENTIFIER_NODE:
7718 if (IDENTIFIER_TYPENAME_P (t))
7720 tree new_type = tsubst (TREE_TYPE (t), args, complain, in_decl);
7721 return mangle_conv_op_name_for_type (new_type);
7728 r = build_constructor
7729 (tsubst (TREE_TYPE (t), args, complain, in_decl),
7730 tsubst_copy (CONSTRUCTOR_ELTS (t), args, complain, in_decl));
7731 TREE_HAS_CONSTRUCTOR (r) = TREE_HAS_CONSTRUCTOR (t);
7736 return build_x_va_arg (tsubst_copy (TREE_OPERAND (t, 0), args, complain,
7738 tsubst (TREE_TYPE (t), args, complain, in_decl));
7745 /* Like tsubst_copy for expressions, etc. but also does semantic
7749 tsubst_expr (tree t, tree args, tsubst_flags_t complain, tree in_decl)
7752 tsubst_flags_t stmt_expr
7753 = complain & (tf_stmt_expr_cmpd | tf_stmt_expr_body);
7755 complain ^= stmt_expr;
7756 if (t == NULL_TREE || t == error_mark_node)
7759 if (!STATEMENT_CODE_P (TREE_CODE (t)))
7760 return tsubst_copy_and_build (t, args, complain, in_decl,
7761 /*function_p=*/false);
7763 switch (TREE_CODE (t))
7765 case CTOR_INITIALIZER:
7767 finish_mem_initializers (tsubst_initializer_list
7768 (TREE_OPERAND (t, 0), args));
7773 finish_return_stmt (tsubst_expr (RETURN_STMT_EXPR (t),
7774 args, complain, in_decl));
7783 r = tsubst_expr (EXPR_STMT_EXPR (t), args, complain, in_decl);
7784 if (stmt_expr & tf_stmt_expr_body && !TREE_CHAIN (t))
7785 finish_stmt_expr_expr (r);
7787 finish_expr_stmt (r);
7793 do_using_directive (tsubst_expr (USING_STMT_NAMESPACE (t),
7794 args, complain, in_decl));
7803 decl = DECL_STMT_DECL (t);
7804 if (TREE_CODE (decl) == LABEL_DECL)
7805 finish_label_decl (DECL_NAME (decl));
7806 else if (TREE_CODE (decl) == USING_DECL)
7808 tree scope = DECL_INITIAL (decl);
7809 tree name = DECL_NAME (decl);
7812 scope = tsubst_expr (scope, args, complain, in_decl);
7813 decl = lookup_qualified_name (scope, name,
7814 /*is_type_p=*/false,
7815 /*complain=*/false);
7816 if (decl == error_mark_node)
7817 qualified_name_lookup_error (scope, name);
7819 do_local_using_decl (decl, scope, name);
7823 init = DECL_INITIAL (decl);
7824 decl = tsubst (decl, args, complain, in_decl);
7825 if (decl != error_mark_node)
7828 DECL_INITIAL (decl) = error_mark_node;
7829 /* By marking the declaration as instantiated, we avoid
7830 trying to instantiate it. Since instantiate_decl can't
7831 handle local variables, and since we've already done
7832 all that needs to be done, that's the right thing to
7834 if (TREE_CODE (decl) == VAR_DECL)
7835 DECL_TEMPLATE_INSTANTIATED (decl) = 1;
7836 if (TREE_CODE (decl) == VAR_DECL
7837 && ANON_AGGR_TYPE_P (TREE_TYPE (decl)))
7838 /* Anonymous aggregates are a special case. */
7839 finish_anon_union (decl);
7842 maybe_push_decl (decl);
7843 if (TREE_CODE (decl) == VAR_DECL
7844 && DECL_PRETTY_FUNCTION_P (decl))
7846 /* For __PRETTY_FUNCTION__ we have to adjust the
7848 const char *const name
7849 = cxx_printable_name (current_function_decl, 2);
7850 init = cp_fname_init (name, &TREE_TYPE (decl));
7853 init = tsubst_expr (init, args, complain, in_decl);
7854 cp_finish_decl (decl, init, NULL_TREE, 0);
7859 /* A DECL_STMT can also be used as an expression, in the condition
7860 clause of an if/for/while construct. If we aren't followed by
7861 another statement, return our decl. */
7862 if (TREE_CHAIN (t) == NULL_TREE)
7871 stmt = begin_for_stmt ();
7872 tsubst_expr (FOR_INIT_STMT (t), args, complain, in_decl);
7873 finish_for_init_stmt (stmt);
7874 finish_for_cond (tsubst_expr (FOR_COND (t),
7875 args, complain, in_decl),
7877 tmp = tsubst_expr (FOR_EXPR (t), args, complain, in_decl);
7878 finish_for_expr (tmp, stmt);
7879 tsubst_expr (FOR_BODY (t), args, complain, in_decl);
7880 finish_for_stmt (stmt);
7887 stmt = begin_while_stmt ();
7888 finish_while_stmt_cond (tsubst_expr (WHILE_COND (t),
7889 args, complain, in_decl),
7891 tsubst_expr (WHILE_BODY (t), args, complain, in_decl);
7892 finish_while_stmt (stmt);
7899 stmt = begin_do_stmt ();
7900 tsubst_expr (DO_BODY (t), args, complain, in_decl);
7901 finish_do_body (stmt);
7902 finish_do_stmt (tsubst_expr (DO_COND (t),
7903 args, complain, in_decl),
7911 stmt = begin_if_stmt ();
7912 finish_if_stmt_cond (tsubst_expr (IF_COND (t),
7913 args, complain, in_decl),
7916 if (tmp = THEN_CLAUSE (t), tmp)
7918 tsubst_expr (tmp, args, complain, in_decl);
7919 finish_then_clause (stmt);
7922 if (tmp = ELSE_CLAUSE (t), tmp)
7924 begin_else_clause ();
7925 tsubst_expr (tmp, args, complain, in_decl);
7926 finish_else_clause (stmt);
7936 if (COMPOUND_STMT_BODY_BLOCK (t))
7937 stmt = begin_function_body ();
7939 stmt = begin_compound_stmt (COMPOUND_STMT_NO_SCOPE (t));
7941 tsubst_expr (COMPOUND_BODY (t), args,
7942 complain | ((stmt_expr & tf_stmt_expr_cmpd) << 1),
7945 if (COMPOUND_STMT_BODY_BLOCK (t))
7946 finish_function_body (stmt);
7948 finish_compound_stmt (stmt);
7954 finish_break_stmt ();
7959 finish_continue_stmt ();
7967 stmt = begin_switch_stmt ();
7968 val = tsubst_expr (SWITCH_COND (t), args, complain, in_decl);
7969 finish_switch_cond (val, stmt);
7970 tsubst_expr (SWITCH_BODY (t), args, complain, in_decl);
7971 finish_switch_stmt (stmt);
7977 finish_case_label (tsubst_expr (CASE_LOW (t), args, complain, in_decl),
7978 tsubst_expr (CASE_HIGH (t), args, complain,
7984 finish_label_stmt (DECL_NAME (LABEL_STMT_LABEL (t)));
7989 tmp = GOTO_DESTINATION (t);
7990 if (TREE_CODE (tmp) != LABEL_DECL)
7991 /* Computed goto's must be tsubst'd into. On the other hand,
7992 non-computed gotos must not be; the identifier in question
7993 will have no binding. */
7994 tmp = tsubst_expr (tmp, args, complain, in_decl);
7996 tmp = DECL_NAME (tmp);
7997 finish_goto_stmt (tmp);
8002 tmp = finish_asm_stmt
8003 (ASM_VOLATILE_P (t),
8004 tsubst_expr (ASM_STRING (t), args, complain, in_decl),
8005 tsubst_expr (ASM_OUTPUTS (t), args, complain, in_decl),
8006 tsubst_expr (ASM_INPUTS (t), args, complain, in_decl),
8007 tsubst_expr (ASM_CLOBBERS (t), args, complain, in_decl));
8008 ASM_INPUT_P (tmp) = ASM_INPUT_P (t);
8015 stmt = begin_try_block ();
8016 tsubst_expr (TRY_STMTS (t), args, complain, in_decl);
8017 finish_cleanup_try_block (stmt);
8018 finish_cleanup (tsubst_expr (TRY_HANDLERS (t), args,
8024 if (FN_TRY_BLOCK_P (t))
8025 stmt = begin_function_try_block ();
8027 stmt = begin_try_block ();
8029 tsubst_expr (TRY_STMTS (t), args, complain, in_decl);
8031 if (FN_TRY_BLOCK_P (t))
8032 finish_function_try_block (stmt);
8034 finish_try_block (stmt);
8036 tsubst_expr (TRY_HANDLERS (t), args, complain, in_decl);
8037 if (FN_TRY_BLOCK_P (t))
8038 finish_function_handler_sequence (stmt);
8040 finish_handler_sequence (stmt);
8049 stmt = begin_handler ();
8050 if (HANDLER_PARMS (t))
8052 decl = DECL_STMT_DECL (HANDLER_PARMS (t));
8053 decl = tsubst (decl, args, complain, in_decl);
8054 /* Prevent instantiate_decl from trying to instantiate
8055 this variable. We've already done all that needs to be
8057 DECL_TEMPLATE_INSTANTIATED (decl) = 1;
8061 finish_handler_parms (decl, stmt);
8062 tsubst_expr (HANDLER_BODY (t), args, complain, in_decl);
8063 finish_handler (stmt);
8069 tsubst (TREE_TYPE (t), args, complain, NULL_TREE);
8076 return tsubst_expr (TREE_CHAIN (t), args, complain | stmt_expr, in_decl);
8079 /* T is a postfix-expression that is not being used in a function
8080 call. Return the substituted version of T. */
8083 tsubst_non_call_postfix_expression (tree t, tree args,
8084 tsubst_flags_t complain,
8087 if (TREE_CODE (t) == SCOPE_REF)
8088 t = tsubst_qualified_id (t, args, complain, in_decl,
8089 /*done=*/false, /*address_p=*/false);
8091 t = tsubst_copy_and_build (t, args, complain, in_decl,
8092 /*function_p=*/false);
8097 /* Like tsubst but deals with expressions and performs semantic
8098 analysis. FUNCTION_P is true if T is the "F" in "F (ARGS)". */
8101 tsubst_copy_and_build (tree t,
8103 tsubst_flags_t complain,
8107 #define RECUR(NODE) \
8108 tsubst_copy_and_build (NODE, args, complain, in_decl, /*function_p=*/false)
8112 if (t == NULL_TREE || t == error_mark_node)
8115 switch (TREE_CODE (t))
8120 case IDENTIFIER_NODE:
8124 tree qualifying_class;
8125 bool non_integral_constant_expression_p;
8126 const char *error_msg;
8128 if (IDENTIFIER_TYPENAME_P (t))
8130 tree new_type = tsubst (TREE_TYPE (t), args, complain, in_decl);
8131 t = mangle_conv_op_name_for_type (new_type);
8134 /* Look up the name. */
8135 decl = lookup_name (t, 0);
8137 /* By convention, expressions use ERROR_MARK_NODE to indicate
8138 failure, not NULL_TREE. */
8139 if (decl == NULL_TREE)
8140 decl = error_mark_node;
8142 decl = finish_id_expression (t, decl, NULL_TREE,
8145 /*integral_constant_expression_p=*/false,
8146 /*allow_non_integral_constant_expression_p=*/false,
8147 &non_integral_constant_expression_p,
8151 if (!function_p && TREE_CODE (decl) == IDENTIFIER_NODE)
8152 decl = unqualified_name_lookup_error (decl);
8156 case TEMPLATE_ID_EXPR:
8159 tree template = RECUR (TREE_OPERAND (t, 0));
8160 tree targs = TREE_OPERAND (t, 1);
8163 targs = tsubst_template_args (targs, args, complain, in_decl);
8165 if (TREE_CODE (template) == COMPONENT_REF)
8167 object = TREE_OPERAND (template, 0);
8168 template = TREE_OPERAND (template, 1);
8172 template = lookup_template_function (template, targs);
8175 return build (COMPONENT_REF, TREE_TYPE (template),
8182 return build_x_indirect_ref (RECUR (TREE_OPERAND (t, 0)), "unary *");
8186 (tsubst (TREE_TYPE (t), args, complain, in_decl),
8187 RECUR (TREE_OPERAND (t, 0)));
8190 return build_functional_cast
8191 (tsubst (TREE_TYPE (t), args, complain, in_decl),
8192 RECUR (TREE_OPERAND (t, 0)));
8194 case REINTERPRET_CAST_EXPR:
8195 return build_reinterpret_cast
8196 (tsubst (TREE_TYPE (t), args, complain, in_decl),
8197 RECUR (TREE_OPERAND (t, 0)));
8199 case CONST_CAST_EXPR:
8200 return build_const_cast
8201 (tsubst (TREE_TYPE (t), args, complain, in_decl),
8202 RECUR (TREE_OPERAND (t, 0)));
8204 case DYNAMIC_CAST_EXPR:
8205 return build_dynamic_cast
8206 (tsubst (TREE_TYPE (t), args, complain, in_decl),
8207 RECUR (TREE_OPERAND (t, 0)));
8209 case STATIC_CAST_EXPR:
8210 return build_static_cast
8211 (tsubst (TREE_TYPE (t), args, complain, in_decl),
8212 RECUR (TREE_OPERAND (t, 0)));
8214 case POSTDECREMENT_EXPR:
8215 case POSTINCREMENT_EXPR:
8216 op1 = tsubst_non_call_postfix_expression (TREE_OPERAND (t, 0),
8217 args, complain, in_decl);
8218 return build_x_unary_op (TREE_CODE (t), op1);
8220 case PREDECREMENT_EXPR:
8221 case PREINCREMENT_EXPR:
8225 case TRUTH_NOT_EXPR:
8226 case CONVERT_EXPR: /* Unary + */
8229 return build_x_unary_op (TREE_CODE (t), RECUR (TREE_OPERAND (t, 0)));
8232 op1 = TREE_OPERAND (t, 0);
8233 if (TREE_CODE (op1) == SCOPE_REF)
8234 op1 = tsubst_qualified_id (op1, args, complain, in_decl,
8235 /*done=*/true, /*address_p=*/true);
8237 op1 = tsubst_non_call_postfix_expression (op1, args, complain,
8239 if (TREE_CODE (op1) == LABEL_DECL)
8240 return finish_label_address_expr (DECL_NAME (op1));
8241 return build_x_unary_op (ADDR_EXPR, op1);
8246 case TRUNC_DIV_EXPR:
8248 case FLOOR_DIV_EXPR:
8249 case ROUND_DIV_EXPR:
8250 case EXACT_DIV_EXPR:
8254 case TRUNC_MOD_EXPR:
8255 case FLOOR_MOD_EXPR:
8256 case TRUTH_ANDIF_EXPR:
8257 case TRUTH_ORIF_EXPR:
8258 case TRUTH_AND_EXPR:
8274 return build_x_binary_op
8276 RECUR (TREE_OPERAND (t, 0)),
8277 RECUR (TREE_OPERAND (t, 1)),
8278 /*overloaded_p=*/NULL);
8281 return tsubst_qualified_id (t, args, complain, in_decl, /*done=*/true,
8282 /*address_p=*/false);
8285 if (tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl)
8288 return build_nt (ARRAY_REF, NULL_TREE, RECUR (TREE_OPERAND (t, 1)));
8290 op1 = tsubst_non_call_postfix_expression (TREE_OPERAND (t, 0),
8291 args, complain, in_decl);
8292 /* Remember that there was a reference to this entity. */
8295 return grok_array_decl (op1, RECUR (TREE_OPERAND (t, 1)));
8299 op1 = TREE_OPERAND (t, 0);
8302 /* When there are no ARGS, we are trying to evaluate a
8303 non-dependent expression from the parser. Trying to do
8304 the substitutions may not work. */
8306 op1 = TREE_TYPE (op1);
8315 return cxx_sizeof_or_alignof_type (op1, TREE_CODE (t), true);
8317 return cxx_sizeof_or_alignof_expr (op1, TREE_CODE (t));
8320 return build_x_modify_expr
8321 (RECUR (TREE_OPERAND (t, 0)),
8322 TREE_CODE (TREE_OPERAND (t, 1)),
8323 RECUR (TREE_OPERAND (t, 2)));
8326 op1 = tsubst_non_call_postfix_expression (TREE_OPERAND (t, 0),
8327 args, complain, in_decl);
8328 /* Remember that there was a reference to this entity. */
8331 return build_x_arrow (op1);
8335 (RECUR (TREE_OPERAND (t, 0)),
8336 RECUR (TREE_OPERAND (t, 1)),
8337 RECUR (TREE_OPERAND (t, 2)),
8338 NEW_EXPR_USE_GLOBAL (t));
8341 return delete_sanity
8342 (RECUR (TREE_OPERAND (t, 0)),
8343 RECUR (TREE_OPERAND (t, 1)),
8344 DELETE_EXPR_USE_VEC (t),
8345 DELETE_EXPR_USE_GLOBAL (t));
8348 return build_x_compound_expr (RECUR (TREE_OPERAND (t, 0)),
8349 RECUR (TREE_OPERAND (t, 1)));
8358 function = TREE_OPERAND (t, 0);
8359 /* When we parsed the expression, we determined whether or
8360 not Koenig lookup should be performed. */
8361 koenig_p = KOENIG_LOOKUP_P (t);
8362 if (TREE_CODE (function) == SCOPE_REF)
8365 function = tsubst_qualified_id (function, args, complain, in_decl,
8367 /*address_p=*/false);
8371 qualified_p = (TREE_CODE (function) == COMPONENT_REF
8372 && (TREE_CODE (TREE_OPERAND (function, 1))
8374 function = tsubst_copy_and_build (function, args, complain,
8377 if (BASELINK_P (function))
8381 call_args = RECUR (TREE_OPERAND (t, 1));
8383 /* We do not perform argument-dependent lookup if normal
8384 lookup finds a non-function, in accordance with the
8385 expected resolution of DR 218. */
8387 && (is_overloaded_fn (function)
8388 || TREE_CODE (function) == IDENTIFIER_NODE))
8389 function = perform_koenig_lookup (function, call_args);
8391 if (TREE_CODE (function) == IDENTIFIER_NODE)
8393 unqualified_name_lookup_error (function);
8394 return error_mark_node;
8397 /* Remember that there was a reference to this entity. */
8398 if (DECL_P (function))
8399 mark_used (function);
8401 function = convert_from_reference (function);
8403 if (TREE_CODE (function) == OFFSET_REF)
8404 return build_offset_ref_call_from_tree (function, call_args);
8405 if (TREE_CODE (function) == COMPONENT_REF)
8407 if (!BASELINK_P (TREE_OPERAND (function, 1)))
8408 return finish_call_expr (function, call_args,
8409 /*disallow_virtual=*/false,
8410 /*koenig_p=*/false);
8412 return (build_new_method_call
8413 (TREE_OPERAND (function, 0),
8414 TREE_OPERAND (function, 1),
8415 call_args, NULL_TREE,
8416 qualified_p ? LOOKUP_NONVIRTUAL : LOOKUP_NORMAL));
8418 return finish_call_expr (function, call_args,
8419 /*disallow_virtual=*/qualified_p,
8424 return build_x_conditional_expr
8425 (RECUR (TREE_OPERAND (t, 0)),
8426 RECUR (TREE_OPERAND (t, 1)),
8427 RECUR (TREE_OPERAND (t, 2)));
8429 case PSEUDO_DTOR_EXPR:
8430 return finish_pseudo_destructor_expr
8431 (RECUR (TREE_OPERAND (t, 0)),
8432 RECUR (TREE_OPERAND (t, 1)),
8433 RECUR (TREE_OPERAND (t, 2)));
8437 tree purpose, value, chain;
8439 if (t == void_list_node)
8442 purpose = TREE_PURPOSE (t);
8444 purpose = RECUR (purpose);
8445 value = TREE_VALUE (t);
8447 value = RECUR (value);
8448 chain = TREE_CHAIN (t);
8449 if (chain && chain != void_type_node)
8450 chain = RECUR (chain);
8451 if (purpose == TREE_PURPOSE (t)
8452 && value == TREE_VALUE (t)
8453 && chain == TREE_CHAIN (t))
8455 return tree_cons (purpose, value, chain);
8463 object = tsubst_non_call_postfix_expression (TREE_OPERAND (t, 0),
8464 args, complain, in_decl);
8465 /* Remember that there was a reference to this entity. */
8466 if (DECL_P (object))
8469 member = TREE_OPERAND (t, 1);
8470 if (BASELINK_P (member))
8471 member = tsubst_baselink (member,
8472 non_reference (TREE_TYPE (object)),
8473 args, complain, in_decl);
8475 member = tsubst_copy (member, args, complain, in_decl);
8477 if (!CLASS_TYPE_P (TREE_TYPE (object)))
8479 if (TREE_CODE (member) == BIT_NOT_EXPR)
8480 return finish_pseudo_destructor_expr (object,
8482 TREE_TYPE (object));
8483 else if (TREE_CODE (member) == SCOPE_REF
8484 && (TREE_CODE (TREE_OPERAND (member, 1)) == BIT_NOT_EXPR))
8485 return finish_pseudo_destructor_expr (object,
8487 TREE_TYPE (object));
8489 else if (TREE_CODE (member) == SCOPE_REF
8490 && TREE_CODE (TREE_OPERAND (member, 1)) == TEMPLATE_ID_EXPR)
8495 /* Lookup the template functions now that we know what the
8497 tmpl = TREE_OPERAND (TREE_OPERAND (member, 1), 0);
8498 args = TREE_OPERAND (TREE_OPERAND (member, 1), 1);
8499 member = lookup_qualified_name (TREE_OPERAND (member, 0), tmpl,
8500 /*is_type_p=*/false,
8501 /*complain=*/false);
8502 if (BASELINK_P (member))
8503 BASELINK_FUNCTIONS (member)
8504 = build_nt (TEMPLATE_ID_EXPR, BASELINK_FUNCTIONS (member),
8508 qualified_name_lookup_error (TREE_TYPE (object), tmpl);
8509 return error_mark_node;
8512 else if (TREE_CODE (member) == FIELD_DECL)
8513 return finish_non_static_data_member (member, object, NULL_TREE);
8515 return finish_class_member_access_expr (object, member);
8520 (RECUR (TREE_OPERAND (t, 0)));
8526 tree type = tsubst (TREE_TYPE (t), args, complain, in_decl);
8529 /* digest_init will do the wrong thing if we let it. */
8530 if (type && TYPE_PTRMEMFUNC_P (type))
8534 /* We do not want to process the purpose of aggregate
8535 initializers as they are identifier nodes which will be
8536 looked up by digest_init. */
8537 purpose_p = !(type && IS_AGGR_TYPE (type));
8538 for (elts = CONSTRUCTOR_ELTS (t);
8540 elts = TREE_CHAIN (elts))
8542 tree purpose = TREE_PURPOSE (elts);
8543 tree value = TREE_VALUE (elts);
8545 if (purpose && purpose_p)
8546 purpose = RECUR (purpose);
8547 value = RECUR (value);
8548 r = tree_cons (purpose, value, r);
8551 r = build_constructor (NULL_TREE, nreverse (r));
8552 TREE_HAS_CONSTRUCTOR (r) = TREE_HAS_CONSTRUCTOR (t);
8555 return digest_init (type, r, 0);
8561 tree operand_0 = RECUR (TREE_OPERAND (t, 0));
8562 if (TYPE_P (operand_0))
8563 return get_typeid (operand_0);
8564 return build_typeid (operand_0);
8568 return convert_from_reference (tsubst_copy (t, args, complain, in_decl));
8572 t = tsubst_copy (t, args, complain, in_decl);
8573 return convert_from_reference (t);
8576 return build_x_va_arg (RECUR (TREE_OPERAND (t, 0)),
8577 tsubst_copy (TREE_TYPE (t), args, complain,
8581 return tsubst_copy (t, args, complain, in_decl);
8587 /* Verify that the instantiated ARGS are valid. For type arguments,
8588 make sure that the type's linkage is ok. For non-type arguments,
8589 make sure they are constants if they are integral or enumerations.
8590 Emit an error under control of COMPLAIN, and return TRUE on error. */
8593 check_instantiated_args (tree tmpl, tree args, tsubst_flags_t complain)
8595 int ix, len = DECL_NTPARMS (tmpl);
8596 bool result = false;
8598 for (ix = 0; ix != len; ix++)
8600 tree t = TREE_VEC_ELT (args, ix);
8604 /* [basic.link]: A name with no linkage (notably, the name
8605 of a class or enumeration declared in a local scope)
8606 shall not be used to declare an entity with linkage.
8607 This implies that names with no linkage cannot be used as
8608 template arguments. */
8609 tree nt = no_linkage_check (t);
8613 if (!(complain & tf_error))
8615 else if (TYPE_ANONYMOUS_P (nt))
8616 error ("`%T' uses anonymous type", t);
8618 error ("`%T' uses local type `%T'", t, nt);
8621 /* In order to avoid all sorts of complications, we do not
8622 allow variably-modified types as template arguments. */
8623 else if (variably_modified_type_p (t))
8625 if (complain & tf_error)
8626 error ("`%T' is a variably modified type", t);
8630 /* A non-type argument of integral or enumerated type must be a
8632 else if (TREE_TYPE (t)
8633 && INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (t))
8634 && !TREE_CONSTANT (t))
8636 if (complain & tf_error)
8637 error ("integral expression `%E' is not constant", t);
8641 if (result && complain & tf_error)
8642 error (" trying to instantiate `%D'", tmpl);
8646 /* Instantiate the indicated variable or function template TMPL with
8647 the template arguments in TARG_PTR. */
8650 instantiate_template (tree tmpl, tree targ_ptr, tsubst_flags_t complain)
8656 if (tmpl == error_mark_node)
8657 return error_mark_node;
8659 my_friendly_assert (TREE_CODE (tmpl) == TEMPLATE_DECL, 283);
8661 /* If this function is a clone, handle it specially. */
8662 if (DECL_CLONED_FUNCTION_P (tmpl))
8667 spec = instantiate_template (DECL_CLONED_FUNCTION (tmpl), targ_ptr,
8669 if (spec == error_mark_node)
8670 return error_mark_node;
8672 /* Look for the clone. */
8673 for (clone = TREE_CHAIN (spec);
8674 clone && DECL_CLONED_FUNCTION_P (clone);
8675 clone = TREE_CHAIN (clone))
8676 if (DECL_NAME (clone) == DECL_NAME (tmpl))
8678 /* We should always have found the clone by now. */
8683 /* Check to see if we already have this specialization. */
8684 spec = retrieve_specialization (tmpl, targ_ptr);
8685 if (spec != NULL_TREE)
8688 gen_tmpl = most_general_template (tmpl);
8689 if (tmpl != gen_tmpl)
8691 /* The TMPL is a partial instantiation. To get a full set of
8692 arguments we must add the arguments used to perform the
8693 partial instantiation. */
8694 targ_ptr = add_outermost_template_args (DECL_TI_ARGS (tmpl),
8697 /* Check to see if we already have this specialization. */
8698 spec = retrieve_specialization (gen_tmpl, targ_ptr);
8699 if (spec != NULL_TREE)
8703 if (check_instantiated_args (gen_tmpl, INNERMOST_TEMPLATE_ARGS (targ_ptr),
8705 return error_mark_node;
8707 /* We are building a FUNCTION_DECL, during which the access of its
8708 parameters and return types have to be checked. However this
8709 FUNCTION_DECL which is the desired context for access checking
8710 is not built yet. We solve this chicken-and-egg problem by
8711 deferring all checks until we have the FUNCTION_DECL. */
8712 push_deferring_access_checks (dk_deferred);
8714 /* Substitute template parameters. */
8715 fndecl = tsubst (DECL_TEMPLATE_RESULT (gen_tmpl),
8716 targ_ptr, complain, gen_tmpl);
8718 /* Now we know the specialization, compute access previously
8720 push_access_scope (fndecl);
8721 perform_deferred_access_checks ();
8722 pop_access_scope (fndecl);
8723 pop_deferring_access_checks ();
8725 /* The DECL_TI_TEMPLATE should always be the immediate parent
8726 template, not the most general template. */
8727 DECL_TI_TEMPLATE (fndecl) = tmpl;
8729 /* If we've just instantiated the main entry point for a function,
8730 instantiate all the alternate entry points as well. We do this
8731 by cloning the instantiation of the main entry point, not by
8732 instantiating the template clones. */
8733 if (TREE_CHAIN (gen_tmpl) && DECL_CLONED_FUNCTION_P (TREE_CHAIN (gen_tmpl)))
8734 clone_function_decl (fndecl, /*update_method_vec_p=*/0);
8739 /* The FN is a TEMPLATE_DECL for a function. The ARGS are the
8740 arguments that are being used when calling it. TARGS is a vector
8741 into which the deduced template arguments are placed.
8743 Return zero for success, 2 for an incomplete match that doesn't resolve
8744 all the types, and 1 for complete failure. An error message will be
8745 printed only for an incomplete match.
8747 If FN is a conversion operator, or we are trying to produce a specific
8748 specialization, RETURN_TYPE is the return type desired.
8750 The EXPLICIT_TARGS are explicit template arguments provided via a
8753 The parameter STRICT is one of:
8756 We are deducing arguments for a function call, as in
8760 We are deducing arguments for a conversion function, as in
8764 We are deducing arguments when doing an explicit instantiation
8765 as in [temp.explicit], when determining an explicit specialization
8766 as in [temp.expl.spec], or when taking the address of a function
8767 template, as in [temp.deduct.funcaddr].
8770 We are deducing arguments when calculating the partial
8771 ordering between specializations of function or class
8772 templates, as in [temp.func.order] and [temp.class.order].
8774 LEN is the number of parms to consider before returning success, or -1
8775 for all. This is used in partial ordering to avoid comparing parms for
8776 which no actual argument was passed, since they are not considered in
8777 overload resolution (and are explicitly excluded from consideration in
8778 partial ordering in [temp.func.order]/6). */
8781 fn_type_unification (tree fn,
8782 tree explicit_targs,
8786 unification_kind_t strict,
8793 my_friendly_assert (TREE_CODE (fn) == TEMPLATE_DECL, 0);
8795 fntype = TREE_TYPE (fn);
8800 The specified template arguments must match the template
8801 parameters in kind (i.e., type, nontype, template), and there
8802 must not be more arguments than there are parameters;
8803 otherwise type deduction fails.
8805 Nontype arguments must match the types of the corresponding
8806 nontype template parameters, or must be convertible to the
8807 types of the corresponding nontype parameters as specified in
8808 _temp.arg.nontype_, otherwise type deduction fails.
8810 All references in the function type of the function template
8811 to the corresponding template parameters are replaced by the
8812 specified template argument values. If a substitution in a
8813 template parameter or in the function type of the function
8814 template results in an invalid type, type deduction fails. */
8816 tree converted_args;
8820 = (coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn),
8821 explicit_targs, NULL_TREE, tf_none,
8822 /*require_all_arguments=*/0));
8823 if (converted_args == error_mark_node)
8826 /* Substitute the explicit args into the function type. This is
8827 necessary so that, for instance, explicitly declared function
8828 arguments can match null pointed constants. If we were given
8829 an incomplete set of explicit args, we must not do semantic
8830 processing during substitution as we could create partial
8832 incomplete = NUM_TMPL_ARGS (explicit_targs) != NUM_TMPL_ARGS (targs);
8833 processing_template_decl += incomplete;
8834 fntype = tsubst (fntype, converted_args, tf_none, NULL_TREE);
8835 processing_template_decl -= incomplete;
8837 if (fntype == error_mark_node)
8840 /* Place the explicitly specified arguments in TARGS. */
8841 for (i = NUM_TMPL_ARGS (converted_args); i--;)
8842 TREE_VEC_ELT (targs, i) = TREE_VEC_ELT (converted_args, i);
8845 parms = TYPE_ARG_TYPES (fntype);
8846 /* Never do unification on the 'this' parameter. */
8847 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn))
8848 parms = TREE_CHAIN (parms);
8852 /* We've been given a return type to match, prepend it. */
8853 parms = tree_cons (NULL_TREE, TREE_TYPE (fntype), parms);
8854 args = tree_cons (NULL_TREE, return_type, args);
8859 /* We allow incomplete unification without an error message here
8860 because the standard doesn't seem to explicitly prohibit it. Our
8861 callers must be ready to deal with unification failures in any
8863 result = type_unification_real (DECL_INNERMOST_TEMPLATE_PARMS (fn),
8864 targs, parms, args, /*subr=*/0,
8865 strict, /*allow_incomplete*/1, len);
8868 /* All is well so far. Now, check:
8872 When all template arguments have been deduced, all uses of
8873 template parameters in nondeduced contexts are replaced with
8874 the corresponding deduced argument values. If the
8875 substitution results in an invalid type, as described above,
8876 type deduction fails. */
8877 if (tsubst (TREE_TYPE (fn), targs, tf_none, NULL_TREE)
8884 /* Adjust types before performing type deduction, as described in
8885 [temp.deduct.call] and [temp.deduct.conv]. The rules in these two
8886 sections are symmetric. PARM is the type of a function parameter
8887 or the return type of the conversion function. ARG is the type of
8888 the argument passed to the call, or the type of the value
8889 initialized with the result of the conversion function. */
8892 maybe_adjust_types_for_deduction (unification_kind_t strict,
8905 /* Swap PARM and ARG throughout the remainder of this
8906 function; the handling is precisely symmetric since PARM
8907 will initialize ARG rather than vice versa. */
8915 /* There is nothing to do in this case. */
8919 /* DR 214. [temp.func.order] is underspecified, and leads to no
8920 ordering between things like `T *' and `T const &' for `U *'.
8921 The former has T=U and the latter T=U*. The former looks more
8922 specialized and John Spicer considers it well-formed (the EDG
8923 compiler accepts it).
8925 John also confirms that deduction should proceed as in a function
8926 call. Which implies the usual ARG and PARM conversions as DEDUCE_CALL.
8927 However, in ordering, ARG can have REFERENCE_TYPE, but no argument
8928 to an actual call can have such a type.
8930 If both ARG and PARM are REFERENCE_TYPE, we change neither.
8931 If only ARG is a REFERENCE_TYPE, we look through that and then
8932 proceed as with DEDUCE_CALL (which could further convert it). */
8933 if (TREE_CODE (*arg) == REFERENCE_TYPE)
8935 if (TREE_CODE (*parm) == REFERENCE_TYPE)
8937 *arg = TREE_TYPE (*arg);
8944 if (TREE_CODE (*parm) != REFERENCE_TYPE)
8946 /* [temp.deduct.call]
8948 If P is not a reference type:
8950 --If A is an array type, the pointer type produced by the
8951 array-to-pointer standard conversion (_conv.array_) is
8952 used in place of A for type deduction; otherwise,
8954 --If A is a function type, the pointer type produced by
8955 the function-to-pointer standard conversion
8956 (_conv.func_) is used in place of A for type deduction;
8959 --If A is a cv-qualified type, the top level
8960 cv-qualifiers of A's type are ignored for type
8962 if (TREE_CODE (*arg) == ARRAY_TYPE)
8963 *arg = build_pointer_type (TREE_TYPE (*arg));
8964 else if (TREE_CODE (*arg) == FUNCTION_TYPE)
8965 *arg = build_pointer_type (*arg);
8967 *arg = TYPE_MAIN_VARIANT (*arg);
8970 /* [temp.deduct.call]
8972 If P is a cv-qualified type, the top level cv-qualifiers
8973 of P's type are ignored for type deduction. If P is a
8974 reference type, the type referred to by P is used for
8976 *parm = TYPE_MAIN_VARIANT (*parm);
8977 if (TREE_CODE (*parm) == REFERENCE_TYPE)
8979 *parm = TREE_TYPE (*parm);
8980 result |= UNIFY_ALLOW_OUTER_MORE_CV_QUAL;
8983 /* DR 322. For conversion deduction, remove a reference type on parm
8984 too (which has been swapped into ARG). */
8985 if (strict == DEDUCE_CONV && TREE_CODE (*arg) == REFERENCE_TYPE)
8986 *arg = TREE_TYPE (*arg);
8991 /* Most parms like fn_type_unification.
8993 If SUBR is 1, we're being called recursively (to unify the
8994 arguments of a function or method parameter of a function
8998 type_unification_real (tree tparms,
9003 unification_kind_t strict,
9004 int allow_incomplete,
9009 int ntparms = TREE_VEC_LENGTH (tparms);
9011 int saw_undeduced = 0;
9015 my_friendly_assert (TREE_CODE (tparms) == TREE_VEC, 289);
9016 my_friendly_assert (xparms == NULL_TREE
9017 || TREE_CODE (xparms) == TREE_LIST, 290);
9018 my_friendly_assert (!xargs || TREE_CODE (xargs) == TREE_LIST, 291);
9019 my_friendly_assert (ntparms > 0, 292);
9024 sub_strict = (UNIFY_ALLOW_OUTER_LEVEL | UNIFY_ALLOW_MORE_CV_QUAL
9025 | UNIFY_ALLOW_DERIVED);
9029 sub_strict = UNIFY_ALLOW_LESS_CV_QUAL;
9033 sub_strict = UNIFY_ALLOW_NONE;
9037 sub_strict = UNIFY_ALLOW_NONE;
9053 && parms != void_list_node
9055 && args != void_list_node)
9057 parm = TREE_VALUE (parms);
9058 parms = TREE_CHAIN (parms);
9059 arg = TREE_VALUE (args);
9060 args = TREE_CHAIN (args);
9062 if (arg == error_mark_node)
9064 if (arg == unknown_type_node)
9065 /* We can't deduce anything from this, but we might get all the
9066 template args from other function args. */
9069 /* Conversions will be performed on a function argument that
9070 corresponds with a function parameter that contains only
9071 non-deducible template parameters and explicitly specified
9072 template parameters. */
9073 if (!uses_template_parms (parm))
9078 type = TREE_TYPE (arg);
9082 if (strict == DEDUCE_EXACT || strict == DEDUCE_ORDER)
9084 if (same_type_p (parm, type))
9088 /* It might work; we shouldn't check now, because we might
9089 get into infinite recursion. Overload resolution will
9098 my_friendly_assert (TREE_TYPE (arg) != NULL_TREE, 293);
9099 if (type_unknown_p (arg))
9101 /* [temp.deduct.type] A template-argument can be deduced from
9102 a pointer to function or pointer to member function
9103 argument if the set of overloaded functions does not
9104 contain function templates and at most one of a set of
9105 overloaded functions provides a unique match. */
9107 if (resolve_overloaded_unification
9108 (tparms, targs, parm, arg, strict, sub_strict)
9113 arg = TREE_TYPE (arg);
9114 if (arg == error_mark_node)
9119 int arg_strict = sub_strict;
9122 arg_strict |= maybe_adjust_types_for_deduction (strict, &parm, &arg);
9124 if (unify (tparms, targs, parm, arg, arg_strict))
9128 /* Are we done with the interesting parms? */
9132 /* Fail if we've reached the end of the parm list, and more args
9133 are present, and the parm list isn't variadic. */
9134 if (args && args != void_list_node && parms == void_list_node)
9136 /* Fail if parms are left and they don't have default values. */
9138 && parms != void_list_node
9139 && TREE_PURPOSE (parms) == NULL_TREE)
9144 for (i = 0; i < ntparms; i++)
9145 if (TREE_VEC_ELT (targs, i) == NULL_TREE)
9147 tree tparm = TREE_VALUE (TREE_VEC_ELT (tparms, i));
9149 /* If this is an undeduced nontype parameter that depends on
9150 a type parameter, try another pass; its type may have been
9151 deduced from a later argument than the one from which
9152 this parameter can be deduced. */
9153 if (TREE_CODE (tparm) == PARM_DECL
9154 && uses_template_parms (TREE_TYPE (tparm))
9155 && !saw_undeduced++)
9158 if (!allow_incomplete)
9159 error ("incomplete type unification");
9165 /* Subroutine of type_unification_real. Args are like the variables at the
9166 call site. ARG is an overloaded function (or template-id); we try
9167 deducing template args from each of the overloads, and if only one
9168 succeeds, we go with that. Modifies TARGS and returns 0 on success. */
9171 resolve_overloaded_unification (tree tparms,
9175 unification_kind_t strict,
9178 tree tempargs = copy_node (targs);
9182 if (TREE_CODE (arg) == ADDR_EXPR)
9184 arg = TREE_OPERAND (arg, 0);
9190 if (TREE_CODE (arg) == COMPONENT_REF)
9191 /* Handle `&x' where `x' is some static or non-static member
9193 arg = TREE_OPERAND (arg, 1);
9195 if (TREE_CODE (arg) == OFFSET_REF)
9196 arg = TREE_OPERAND (arg, 1);
9198 /* Strip baselink information. */
9199 if (BASELINK_P (arg))
9200 arg = BASELINK_FUNCTIONS (arg);
9202 if (TREE_CODE (arg) == TEMPLATE_ID_EXPR)
9204 /* If we got some explicit template args, we need to plug them into
9205 the affected templates before we try to unify, in case the
9206 explicit args will completely resolve the templates in question. */
9208 tree expl_subargs = TREE_OPERAND (arg, 1);
9209 arg = TREE_OPERAND (arg, 0);
9211 for (; arg; arg = OVL_NEXT (arg))
9213 tree fn = OVL_CURRENT (arg);
9216 if (TREE_CODE (fn) != TEMPLATE_DECL)
9219 subargs = get_bindings_overload (fn, DECL_TEMPLATE_RESULT (fn),
9223 elem = tsubst (TREE_TYPE (fn), subargs, tf_none, NULL_TREE);
9224 good += try_one_overload (tparms, targs, tempargs, parm,
9225 elem, strict, sub_strict, addr_p);
9229 else if (TREE_CODE (arg) == OVERLOAD
9230 || TREE_CODE (arg) == FUNCTION_DECL)
9232 for (; arg; arg = OVL_NEXT (arg))
9233 good += try_one_overload (tparms, targs, tempargs, parm,
9234 TREE_TYPE (OVL_CURRENT (arg)),
9235 strict, sub_strict, addr_p);
9240 /* [temp.deduct.type] A template-argument can be deduced from a pointer
9241 to function or pointer to member function argument if the set of
9242 overloaded functions does not contain function templates and at most
9243 one of a set of overloaded functions provides a unique match.
9245 So if we found multiple possibilities, we return success but don't
9250 int i = TREE_VEC_LENGTH (targs);
9252 if (TREE_VEC_ELT (tempargs, i))
9253 TREE_VEC_ELT (targs, i) = TREE_VEC_ELT (tempargs, i);
9261 /* Subroutine of resolve_overloaded_unification; does deduction for a single
9262 overload. Fills TARGS with any deduced arguments, or error_mark_node if
9263 different overloads deduce different arguments for a given parm.
9264 ADDR_P is true if the expression for which deduction is being
9265 performed was of the form "& fn" rather than simply "fn".
9267 Returns 1 on success. */
9270 try_one_overload (tree tparms,
9275 unification_kind_t strict,
9283 /* [temp.deduct.type] A template-argument can be deduced from a pointer
9284 to function or pointer to member function argument if the set of
9285 overloaded functions does not contain function templates and at most
9286 one of a set of overloaded functions provides a unique match.
9288 So if this is a template, just return success. */
9290 if (uses_template_parms (arg))
9293 if (TREE_CODE (arg) == METHOD_TYPE)
9294 arg = build_ptrmemfunc_type (build_pointer_type (arg));
9296 arg = build_pointer_type (arg);
9298 sub_strict |= maybe_adjust_types_for_deduction (strict, &parm, &arg);
9300 /* We don't copy orig_targs for this because if we have already deduced
9301 some template args from previous args, unify would complain when we
9302 try to deduce a template parameter for the same argument, even though
9303 there isn't really a conflict. */
9304 nargs = TREE_VEC_LENGTH (targs);
9305 tempargs = make_tree_vec (nargs);
9307 if (unify (tparms, tempargs, parm, arg, sub_strict) != 0)
9310 /* First make sure we didn't deduce anything that conflicts with
9311 explicitly specified args. */
9312 for (i = nargs; i--; )
9314 tree elt = TREE_VEC_ELT (tempargs, i);
9315 tree oldelt = TREE_VEC_ELT (orig_targs, i);
9317 if (elt == NULL_TREE)
9319 else if (uses_template_parms (elt))
9321 /* Since we're unifying against ourselves, we will fill in template
9322 args used in the function parm list with our own template parms.
9324 TREE_VEC_ELT (tempargs, i) = NULL_TREE;
9327 else if (oldelt && ! template_args_equal (oldelt, elt))
9331 for (i = nargs; i--; )
9333 tree elt = TREE_VEC_ELT (tempargs, i);
9336 TREE_VEC_ELT (targs, i) = elt;
9342 /* Verify that nondeduce template argument agrees with the type
9343 obtained from argument deduction. Return nonzero if the
9348 struct A { typedef int X; };
9349 template <class T, class U> struct C {};
9350 template <class T> struct C<T, typename T::X> {};
9352 Then with the instantiation `C<A, int>', we can deduce that
9353 `T' is `A' but unify () does not check whether `typename T::X'
9354 is `int'. This function ensure that they agree.
9356 TARGS, PARMS are the same as the arguments of unify.
9357 ARGS contains template arguments from all levels. */
9360 verify_class_unification (tree targs, tree parms, tree args)
9362 parms = tsubst (parms, add_outermost_template_args (args, targs),
9363 tf_none, NULL_TREE);
9364 if (parms == error_mark_node)
9367 return !comp_template_args (parms, INNERMOST_TEMPLATE_ARGS (args));
9370 /* PARM is a template class (perhaps with unbound template
9371 parameters). ARG is a fully instantiated type. If ARG can be
9372 bound to PARM, return ARG, otherwise return NULL_TREE. TPARMS and
9373 TARGS are as for unify. */
9376 try_class_unification (tree tparms, tree targs, tree parm, tree arg)
9380 if (!CLASSTYPE_TEMPLATE_INFO (arg)
9381 || (most_general_template (CLASSTYPE_TI_TEMPLATE (arg))
9382 != most_general_template (CLASSTYPE_TI_TEMPLATE (parm))))
9385 /* We need to make a new template argument vector for the call to
9386 unify. If we used TARGS, we'd clutter it up with the result of
9387 the attempted unification, even if this class didn't work out.
9388 We also don't want to commit ourselves to all the unifications
9389 we've already done, since unification is supposed to be done on
9390 an argument-by-argument basis. In other words, consider the
9391 following pathological case:
9393 template <int I, int J, int K>
9396 template <int I, int J>
9397 struct S<I, J, 2> : public S<I, I, I>, S<J, J, J> {};
9399 template <int I, int J, int K>
9400 void f(S<I, J, K>, S<I, I, I>);
9409 Now, by the time we consider the unification involving `s2', we
9410 already know that we must have `f<0, 0, 0>'. But, even though
9411 `S<0, 1, 2>' is derived from `S<0, 0, 0>', the code is invalid
9412 because there are two ways to unify base classes of S<0, 1, 2>
9413 with S<I, I, I>. If we kept the already deduced knowledge, we
9414 would reject the possibility I=1. */
9415 copy_of_targs = make_tree_vec (TREE_VEC_LENGTH (targs));
9417 /* If unification failed, we're done. */
9418 if (unify (tparms, copy_of_targs, CLASSTYPE_TI_ARGS (parm),
9419 CLASSTYPE_TI_ARGS (arg), UNIFY_ALLOW_NONE))
9425 /* Subroutine of get_template_base. RVAL, if non-NULL, is a base we
9426 have already discovered to be satisfactory. ARG_BINFO is the binfo
9427 for the base class of ARG that we are currently examining. */
9430 get_template_base_recursive (tree tparms,
9439 tree arg = BINFO_TYPE (arg_binfo);
9441 if (!(flags & GTB_IGNORE_TYPE))
9443 tree r = try_class_unification (tparms, targs,
9446 /* If there is more than one satisfactory baseclass, then:
9450 If they yield more than one possible deduced A, the type
9454 if (r && rval && !same_type_p (r, rval))
9455 return error_mark_node;
9460 binfos = BINFO_BASETYPES (arg_binfo);
9461 n_baselinks = binfos ? TREE_VEC_LENGTH (binfos) : 0;
9463 /* Process base types. */
9464 for (i = 0; i < n_baselinks; i++)
9466 tree base_binfo = TREE_VEC_ELT (binfos, i);
9469 /* Skip this base, if we've already seen it. */
9470 if (BINFO_MARKED (base_binfo))
9474 (flags & GTB_VIA_VIRTUAL) || TREE_VIA_VIRTUAL (base_binfo);
9476 /* When searching for a non-virtual, we cannot mark virtually
9479 BINFO_MARKED (base_binfo) = 1;
9481 rval = get_template_base_recursive (tparms, targs,
9485 GTB_VIA_VIRTUAL * this_virtual);
9487 /* If we discovered more than one matching base class, we can
9489 if (rval == error_mark_node)
9490 return error_mark_node;
9496 /* Given a template type PARM and a class type ARG, find the unique
9497 base type in ARG that is an instance of PARM. We do not examine
9498 ARG itself; only its base-classes. If there is no appropriate base
9499 class, return NULL_TREE. If there is more than one, return
9500 error_mark_node. PARM may be the type of a partial specialization,
9501 as well as a plain template type. Used by unify. */
9504 get_template_base (tree tparms, tree targs, tree parm, tree arg)
9509 my_friendly_assert (IS_AGGR_TYPE_CODE (TREE_CODE (arg)), 92);
9511 arg_binfo = TYPE_BINFO (complete_type (arg));
9512 rval = get_template_base_recursive (tparms, targs,
9517 /* Since get_template_base_recursive marks the bases classes, we
9518 must unmark them here. */
9519 dfs_walk (arg_binfo, dfs_unmark, markedp, 0);
9524 /* Returns the level of DECL, which declares a template parameter. */
9527 template_decl_level (tree decl)
9529 switch (TREE_CODE (decl))
9533 return TEMPLATE_TYPE_LEVEL (TREE_TYPE (decl));
9536 return TEMPLATE_PARM_LEVEL (DECL_INITIAL (decl));
9544 /* Decide whether ARG can be unified with PARM, considering only the
9545 cv-qualifiers of each type, given STRICT as documented for unify.
9546 Returns nonzero iff the unification is OK on that basis. */
9549 check_cv_quals_for_unify (int strict, tree arg, tree parm)
9551 int arg_quals = cp_type_quals (arg);
9552 int parm_quals = cp_type_quals (parm);
9554 if (TREE_CODE (parm) == TEMPLATE_TYPE_PARM
9555 && !(strict & UNIFY_ALLOW_OUTER_MORE_CV_QUAL))
9557 /* Although a CVR qualifier is ignored when being applied to a
9558 substituted template parameter ([8.3.2]/1 for example), that
9559 does not apply during deduction [14.8.2.4]/1, (even though
9560 that is not explicitly mentioned, [14.8.2.4]/9 indicates
9561 this). Except when we're allowing additional CV qualifiers
9562 at the outer level [14.8.2.1]/3,1st bullet. */
9563 if ((TREE_CODE (arg) == REFERENCE_TYPE
9564 || TREE_CODE (arg) == FUNCTION_TYPE
9565 || TREE_CODE (arg) == METHOD_TYPE)
9566 && (parm_quals & (TYPE_QUAL_CONST | TYPE_QUAL_VOLATILE)))
9569 if ((!POINTER_TYPE_P (arg) && TREE_CODE (arg) != TEMPLATE_TYPE_PARM)
9570 && (parm_quals & TYPE_QUAL_RESTRICT))
9574 if (!(strict & (UNIFY_ALLOW_MORE_CV_QUAL | UNIFY_ALLOW_OUTER_MORE_CV_QUAL))
9575 && (arg_quals & parm_quals) != parm_quals)
9578 if (!(strict & (UNIFY_ALLOW_LESS_CV_QUAL | UNIFY_ALLOW_OUTER_LESS_CV_QUAL))
9579 && (parm_quals & arg_quals) != arg_quals)
9585 /* Takes parameters as for type_unification. Returns 0 if the
9586 type deduction succeeds, 1 otherwise. The parameter STRICT is a
9587 bitwise or of the following flags:
9590 Require an exact match between PARM and ARG.
9591 UNIFY_ALLOW_MORE_CV_QUAL:
9592 Allow the deduced ARG to be more cv-qualified (by qualification
9593 conversion) than ARG.
9594 UNIFY_ALLOW_LESS_CV_QUAL:
9595 Allow the deduced ARG to be less cv-qualified than ARG.
9596 UNIFY_ALLOW_DERIVED:
9597 Allow the deduced ARG to be a template base class of ARG,
9598 or a pointer to a template base class of the type pointed to by
9600 UNIFY_ALLOW_INTEGER:
9601 Allow any integral type to be deduced. See the TEMPLATE_PARM_INDEX
9602 case for more information.
9603 UNIFY_ALLOW_OUTER_LEVEL:
9604 This is the outermost level of a deduction. Used to determine validity
9605 of qualification conversions. A valid qualification conversion must
9606 have const qualified pointers leading up to the inner type which
9607 requires additional CV quals, except at the outer level, where const
9608 is not required [conv.qual]. It would be normal to set this flag in
9609 addition to setting UNIFY_ALLOW_MORE_CV_QUAL.
9610 UNIFY_ALLOW_OUTER_MORE_CV_QUAL:
9611 This is the outermost level of a deduction, and PARM can be more CV
9612 qualified at this point.
9613 UNIFY_ALLOW_OUTER_LESS_CV_QUAL:
9614 This is the outermost level of a deduction, and PARM can be less CV
9615 qualified at this point.
9616 UNIFY_ALLOW_MAX_CORRECTION:
9617 This is an INTEGER_TYPE's maximum value. Used if the range may
9618 have been derived from a size specification, such as an array size.
9619 If the size was given by a nontype template parameter N, the maximum
9620 value will have the form N-1. The flag says that we can (and indeed
9621 must) unify N with (ARG + 1), an exception to the normal rules on
9625 unify (tree tparms, tree targs, tree parm, tree arg, int strict)
9630 int strict_in = strict;
9632 /* I don't think this will do the right thing with respect to types.
9633 But the only case I've seen it in so far has been array bounds, where
9634 signedness is the only information lost, and I think that will be
9636 while (TREE_CODE (parm) == NOP_EXPR)
9637 parm = TREE_OPERAND (parm, 0);
9639 if (arg == error_mark_node)
9641 if (arg == unknown_type_node)
9642 /* We can't deduce anything from this, but we might get all the
9643 template args from other function args. */
9646 /* If PARM uses template parameters, then we can't bail out here,
9647 even if ARG == PARM, since we won't record unifications for the
9648 template parameters. We might need them if we're trying to
9649 figure out which of two things is more specialized. */
9650 if (arg == parm && !uses_template_parms (parm))
9653 /* Immediately reject some pairs that won't unify because of
9654 cv-qualification mismatches. */
9655 if (TREE_CODE (arg) == TREE_CODE (parm)
9657 /* It is the elements of the array which hold the cv quals of an array
9658 type, and the elements might be template type parms. We'll check
9660 && TREE_CODE (arg) != ARRAY_TYPE
9661 /* We check the cv-qualifiers when unifying with template type
9662 parameters below. We want to allow ARG `const T' to unify with
9663 PARM `T' for example, when computing which of two templates
9664 is more specialized, for example. */
9665 && TREE_CODE (arg) != TEMPLATE_TYPE_PARM
9666 && !check_cv_quals_for_unify (strict_in, arg, parm))
9669 if (!(strict & UNIFY_ALLOW_OUTER_LEVEL)
9670 && TYPE_P (parm) && !CP_TYPE_CONST_P (parm))
9671 strict &= ~UNIFY_ALLOW_MORE_CV_QUAL;
9672 strict &= ~UNIFY_ALLOW_OUTER_LEVEL;
9673 strict &= ~UNIFY_ALLOW_DERIVED;
9674 strict &= ~UNIFY_ALLOW_OUTER_MORE_CV_QUAL;
9675 strict &= ~UNIFY_ALLOW_OUTER_LESS_CV_QUAL;
9676 strict &= ~UNIFY_ALLOW_MAX_CORRECTION;
9678 switch (TREE_CODE (parm))
9682 case UNBOUND_CLASS_TEMPLATE:
9683 /* In a type which contains a nested-name-specifier, template
9684 argument values cannot be deduced for template parameters used
9685 within the nested-name-specifier. */
9688 case TEMPLATE_TYPE_PARM:
9689 case TEMPLATE_TEMPLATE_PARM:
9690 case BOUND_TEMPLATE_TEMPLATE_PARM:
9691 tparm = TREE_VALUE (TREE_VEC_ELT (tparms, 0));
9693 if (TEMPLATE_TYPE_LEVEL (parm)
9694 != template_decl_level (tparm))
9695 /* The PARM is not one we're trying to unify. Just check
9696 to see if it matches ARG. */
9697 return (TREE_CODE (arg) == TREE_CODE (parm)
9698 && same_type_p (parm, arg)) ? 0 : 1;
9699 idx = TEMPLATE_TYPE_IDX (parm);
9700 targ = TREE_VEC_ELT (targs, idx);
9701 tparm = TREE_VALUE (TREE_VEC_ELT (tparms, idx));
9703 /* Check for mixed types and values. */
9704 if ((TREE_CODE (parm) == TEMPLATE_TYPE_PARM
9705 && TREE_CODE (tparm) != TYPE_DECL)
9706 || (TREE_CODE (parm) == TEMPLATE_TEMPLATE_PARM
9707 && TREE_CODE (tparm) != TEMPLATE_DECL))
9710 if (TREE_CODE (parm) == BOUND_TEMPLATE_TEMPLATE_PARM)
9712 /* ARG must be constructed from a template class or a template
9713 template parameter. */
9714 if (TREE_CODE (arg) != BOUND_TEMPLATE_TEMPLATE_PARM
9715 && (TREE_CODE (arg) != RECORD_TYPE || !CLASSTYPE_TEMPLATE_INFO (arg)))
9719 tree parmtmpl = TYPE_TI_TEMPLATE (parm);
9720 tree parmvec = TYPE_TI_ARGS (parm);
9721 tree argvec = TYPE_TI_ARGS (arg);
9723 = DECL_INNERMOST_TEMPLATE_PARMS (TYPE_TI_TEMPLATE (arg));
9726 /* The parameter and argument roles have to be switched here
9727 in order to handle default arguments properly. For example,
9728 template<template <class> class TT> void f(TT<int>)
9729 should be able to accept vector<int> which comes from
9730 template <class T, class Allocator = allocator>
9733 if (coerce_template_parms (argtmplvec, parmvec, parmtmpl, 0, 1)
9737 /* Deduce arguments T, i from TT<T> or TT<i>.
9738 We check each element of PARMVEC and ARGVEC individually
9739 rather than the whole TREE_VEC since they can have
9740 different number of elements. */
9742 for (i = 0; i < TREE_VEC_LENGTH (parmvec); ++i)
9744 tree t = TREE_VEC_ELT (parmvec, i);
9746 if (unify (tparms, targs, t,
9747 TREE_VEC_ELT (argvec, i),
9752 arg = TYPE_TI_TEMPLATE (arg);
9754 /* Fall through to deduce template name. */
9757 if (TREE_CODE (parm) == TEMPLATE_TEMPLATE_PARM
9758 || TREE_CODE (parm) == BOUND_TEMPLATE_TEMPLATE_PARM)
9760 /* Deduce template name TT from TT, TT<>, TT<T> and TT<i>. */
9762 /* Simple cases: Value already set, does match or doesn't. */
9763 if (targ != NULL_TREE && template_args_equal (targ, arg))
9770 /* If PARM is `const T' and ARG is only `int', we don't have
9771 a match unless we are allowing additional qualification.
9772 If ARG is `const int' and PARM is just `T' that's OK;
9773 that binds `const int' to `T'. */
9774 if (!check_cv_quals_for_unify (strict_in | UNIFY_ALLOW_LESS_CV_QUAL,
9778 /* Consider the case where ARG is `const volatile int' and
9779 PARM is `const T'. Then, T should be `volatile int'. */
9780 arg = cp_build_qualified_type_real
9781 (arg, cp_type_quals (arg) & ~cp_type_quals (parm), tf_none);
9782 if (arg == error_mark_node)
9785 /* Simple cases: Value already set, does match or doesn't. */
9786 if (targ != NULL_TREE && same_type_p (targ, arg))
9791 /* Make sure that ARG is not a variable-sized array. (Note
9792 that were talking about variable-sized arrays (like
9793 `int[n]'), rather than arrays of unknown size (like
9794 `int[]').) We'll get very confused by such a type since
9795 the bound of the array will not be computable in an
9796 instantiation. Besides, such types are not allowed in
9797 ISO C++, so we can do as we please here. */
9798 if (variably_modified_type_p (arg))
9802 TREE_VEC_ELT (targs, idx) = arg;
9805 case TEMPLATE_PARM_INDEX:
9806 tparm = TREE_VALUE (TREE_VEC_ELT (tparms, 0));
9808 if (TEMPLATE_PARM_LEVEL (parm)
9809 != template_decl_level (tparm))
9810 /* The PARM is not one we're trying to unify. Just check
9811 to see if it matches ARG. */
9812 return !(TREE_CODE (arg) == TREE_CODE (parm)
9813 && cp_tree_equal (parm, arg));
9815 idx = TEMPLATE_PARM_IDX (parm);
9816 targ = TREE_VEC_ELT (targs, idx);
9819 return !cp_tree_equal (targ, arg);
9821 /* [temp.deduct.type] If, in the declaration of a function template
9822 with a non-type template-parameter, the non-type
9823 template-parameter is used in an expression in the function
9824 parameter-list and, if the corresponding template-argument is
9825 deduced, the template-argument type shall match the type of the
9826 template-parameter exactly, except that a template-argument
9827 deduced from an array bound may be of any integral type.
9828 The non-type parameter might use already deduced type parameters. */
9829 tparm = tsubst (TREE_TYPE (parm), targs, 0, NULL_TREE);
9830 if (!TREE_TYPE (arg))
9831 /* Template-parameter dependent expression. Just accept it for now.
9832 It will later be processed in convert_template_argument. */
9834 else if (same_type_p (TREE_TYPE (arg), tparm))
9836 else if ((strict & UNIFY_ALLOW_INTEGER)
9837 && (TREE_CODE (tparm) == INTEGER_TYPE
9838 || TREE_CODE (tparm) == BOOLEAN_TYPE))
9840 else if (uses_template_parms (tparm))
9841 /* We haven't deduced the type of this parameter yet. Try again
9847 TREE_VEC_ELT (targs, idx) = arg;
9852 /* A pointer-to-member constant can be unified only with
9853 another constant. */
9854 if (TREE_CODE (arg) != PTRMEM_CST)
9857 /* Just unify the class member. It would be useless (and possibly
9858 wrong, depending on the strict flags) to unify also
9859 PTRMEM_CST_CLASS, because we want to be sure that both parm and
9860 arg refer to the same variable, even if through different
9861 classes. For instance:
9863 struct A { int x; };
9866 Unification of &A::x and &B::x must succeed. */
9867 return unify (tparms, targs, PTRMEM_CST_MEMBER (parm),
9868 PTRMEM_CST_MEMBER (arg), strict);
9873 if (TREE_CODE (arg) != POINTER_TYPE)
9876 /* [temp.deduct.call]
9878 A can be another pointer or pointer to member type that can
9879 be converted to the deduced A via a qualification
9880 conversion (_conv.qual_).
9882 We pass down STRICT here rather than UNIFY_ALLOW_NONE.
9883 This will allow for additional cv-qualification of the
9884 pointed-to types if appropriate. */
9886 if (TREE_CODE (TREE_TYPE (arg)) == RECORD_TYPE)
9887 /* The derived-to-base conversion only persists through one
9888 level of pointers. */
9889 strict |= (strict_in & UNIFY_ALLOW_DERIVED);
9891 return unify (tparms, targs, TREE_TYPE (parm),
9892 TREE_TYPE (arg), strict);
9895 case REFERENCE_TYPE:
9896 if (TREE_CODE (arg) != REFERENCE_TYPE)
9898 return unify (tparms, targs, TREE_TYPE (parm), TREE_TYPE (arg),
9899 strict & UNIFY_ALLOW_MORE_CV_QUAL);
9902 if (TREE_CODE (arg) != ARRAY_TYPE)
9904 if ((TYPE_DOMAIN (parm) == NULL_TREE)
9905 != (TYPE_DOMAIN (arg) == NULL_TREE))
9907 if (TYPE_DOMAIN (parm) != NULL_TREE
9908 && unify (tparms, targs, TYPE_DOMAIN (parm),
9909 TYPE_DOMAIN (arg), UNIFY_ALLOW_NONE) != 0)
9911 return unify (tparms, targs, TREE_TYPE (parm), TREE_TYPE (arg),
9912 strict & UNIFY_ALLOW_MORE_CV_QUAL);
9920 if (TREE_CODE (arg) != TREE_CODE (parm))
9923 if (TREE_CODE (parm) == INTEGER_TYPE
9924 && TREE_CODE (TYPE_MAX_VALUE (parm)) != INTEGER_CST)
9926 if (TYPE_MIN_VALUE (parm) && TYPE_MIN_VALUE (arg)
9927 && unify (tparms, targs, TYPE_MIN_VALUE (parm),
9928 TYPE_MIN_VALUE (arg), UNIFY_ALLOW_INTEGER))
9930 if (TYPE_MAX_VALUE (parm) && TYPE_MAX_VALUE (arg)
9931 && unify (tparms, targs, TYPE_MAX_VALUE (parm),
9932 TYPE_MAX_VALUE (arg),
9933 UNIFY_ALLOW_INTEGER | UNIFY_ALLOW_MAX_CORRECTION))
9936 /* We have already checked cv-qualification at the top of the
9938 else if (!same_type_ignoring_top_level_qualifiers_p (arg, parm))
9941 /* As far as unification is concerned, this wins. Later checks
9942 will invalidate it if necessary. */
9945 /* Types INTEGER_CST and MINUS_EXPR can come from array bounds. */
9946 /* Type INTEGER_CST can come from ordinary constant template args. */
9948 while (TREE_CODE (arg) == NOP_EXPR)
9949 arg = TREE_OPERAND (arg, 0);
9951 if (TREE_CODE (arg) != INTEGER_CST)
9953 return !tree_int_cst_equal (parm, arg);
9958 if (TREE_CODE (arg) != TREE_VEC)
9960 if (TREE_VEC_LENGTH (parm) != TREE_VEC_LENGTH (arg))
9962 for (i = 0; i < TREE_VEC_LENGTH (parm); ++i)
9963 if (unify (tparms, targs,
9964 TREE_VEC_ELT (parm, i), TREE_VEC_ELT (arg, i),
9972 if (TREE_CODE (arg) != TREE_CODE (parm))
9975 if (TYPE_PTRMEMFUNC_P (parm))
9977 if (!TYPE_PTRMEMFUNC_P (arg))
9980 return unify (tparms, targs,
9981 TYPE_PTRMEMFUNC_FN_TYPE (parm),
9982 TYPE_PTRMEMFUNC_FN_TYPE (arg),
9986 if (CLASSTYPE_TEMPLATE_INFO (parm))
9990 if (strict_in & UNIFY_ALLOW_DERIVED)
9992 /* First, we try to unify the PARM and ARG directly. */
9993 t = try_class_unification (tparms, targs,
9998 /* Fallback to the special case allowed in
10001 If P is a class, and P has the form
10002 template-id, then A can be a derived class of
10003 the deduced A. Likewise, if P is a pointer to
10004 a class of the form template-id, A can be a
10005 pointer to a derived class pointed to by the
10007 t = get_template_base (tparms, targs,
10010 if (! t || t == error_mark_node)
10014 else if (CLASSTYPE_TEMPLATE_INFO (arg)
10015 && (CLASSTYPE_TI_TEMPLATE (parm)
10016 == CLASSTYPE_TI_TEMPLATE (arg)))
10017 /* Perhaps PARM is something like S<U> and ARG is S<int>.
10018 Then, we should unify `int' and `U'. */
10021 /* There's no chance of unification succeeding. */
10024 return unify (tparms, targs, CLASSTYPE_TI_ARGS (parm),
10025 CLASSTYPE_TI_ARGS (t), UNIFY_ALLOW_NONE);
10027 else if (!same_type_ignoring_top_level_qualifiers_p (parm, arg))
10032 case FUNCTION_TYPE:
10033 if (TREE_CODE (arg) != TREE_CODE (parm))
10036 if (unify (tparms, targs, TREE_TYPE (parm),
10037 TREE_TYPE (arg), UNIFY_ALLOW_NONE))
10039 return type_unification_real (tparms, targs, TYPE_ARG_TYPES (parm),
10040 TYPE_ARG_TYPES (arg), 1,
10041 DEDUCE_EXACT, 0, -1);
10044 if (TREE_CODE (arg) != OFFSET_TYPE)
10046 if (unify (tparms, targs, TYPE_OFFSET_BASETYPE (parm),
10047 TYPE_OFFSET_BASETYPE (arg), UNIFY_ALLOW_NONE))
10049 return unify (tparms, targs, TREE_TYPE (parm), TREE_TYPE (arg),
10053 if (DECL_TEMPLATE_PARM_P (parm))
10054 return unify (tparms, targs, DECL_INITIAL (parm), arg, strict);
10055 if (arg != decl_constant_value (parm))
10060 case TEMPLATE_DECL:
10061 /* Matched cases are handled by the ARG == PARM test above. */
10065 if (tree_int_cst_equal (TREE_OPERAND (parm, 1), integer_one_node)
10066 && (strict_in & UNIFY_ALLOW_MAX_CORRECTION))
10068 /* We handle this case specially, since it comes up with
10069 arrays. In particular, something like:
10071 template <int N> void f(int (&x)[N]);
10073 Here, we are trying to unify the range type, which
10074 looks like [0 ... (N - 1)]. */
10076 t1 = TREE_OPERAND (parm, 0);
10077 t2 = TREE_OPERAND (parm, 1);
10079 t = fold (build (PLUS_EXPR, integer_type_node, arg, t2));
10081 return unify (tparms, targs, t1, t, strict);
10083 /* Else fall through. */
10086 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (parm))))
10089 /* We're looking at an expression. This can happen with
10093 void foo(S<I>, S<I + 2>);
10095 This is a "nondeduced context":
10099 The nondeduced contexts are:
10101 --A type that is a template-id in which one or more of
10102 the template-arguments is an expression that references
10103 a template-parameter.
10105 In these cases, we assume deduction succeeded, but don't
10106 actually infer any unifications. */
10108 if (!uses_template_parms (parm)
10109 && !template_args_equal (parm, arg))
10115 sorry ("use of `%s' in template type unification",
10116 tree_code_name [(int) TREE_CODE (parm)]);
10122 /* Called if RESULT is explicitly instantiated, or is a member of an
10123 explicitly instantiated class, or if using -frepo and the
10124 instantiation of RESULT has been assigned to this file. */
10127 mark_decl_instantiated (tree result, int extern_p)
10129 /* We used to set this unconditionally; we moved that to
10130 do_decl_instantiation so it wouldn't get set on members of
10131 explicit class template instantiations. But we still need to set
10132 it here for the 'extern template' case in order to suppress
10133 implicit instantiations. */
10135 SET_DECL_EXPLICIT_INSTANTIATION (result);
10137 /* If this entity has already been written out, it's too late to
10138 make any modifications. */
10139 if (TREE_ASM_WRITTEN (result))
10142 if (TREE_CODE (result) != FUNCTION_DECL)
10143 /* The TREE_PUBLIC flag for function declarations will have been
10144 set correctly by tsubst. */
10145 TREE_PUBLIC (result) = 1;
10147 /* This might have been set by an earlier implicit instantiation. */
10148 DECL_COMDAT (result) = 0;
10152 DECL_INTERFACE_KNOWN (result) = 1;
10153 DECL_NOT_REALLY_EXTERN (result) = 1;
10155 /* Always make artificials weak. */
10156 if (DECL_ARTIFICIAL (result) && flag_weak)
10157 comdat_linkage (result);
10158 /* For WIN32 we also want to put explicit instantiations in
10159 linkonce sections. */
10160 else if (TREE_PUBLIC (result))
10161 maybe_make_one_only (result);
10164 if (TREE_CODE (result) == FUNCTION_DECL
10165 && (DECL_ARTIFICIAL (result)
10166 || (DECL_DECLARED_INLINE_P (result) && TREE_USED (result))))
10170 /* Given two function templates PAT1 and PAT2, return:
10172 DEDUCE should be DEDUCE_EXACT or DEDUCE_ORDER.
10174 1 if PAT1 is more specialized than PAT2 as described in [temp.func.order].
10175 -1 if PAT2 is more specialized than PAT1.
10176 0 if neither is more specialized.
10178 LEN is passed through to fn_type_unification. */
10181 more_specialized (tree pat1, tree pat2, int deduce, int len)
10186 /* If template argument deduction succeeds, we substitute the
10187 resulting arguments into non-deduced contexts. While doing that,
10188 we must be aware that we may encounter dependent types. */
10189 ++processing_template_decl;
10190 targs = get_bindings_real (pat1, DECL_TEMPLATE_RESULT (pat2),
10191 NULL_TREE, 0, deduce, len);
10195 targs = get_bindings_real (pat2, DECL_TEMPLATE_RESULT (pat1),
10196 NULL_TREE, 0, deduce, len);
10199 --processing_template_decl;
10204 /* Given two class template specialization list nodes PAT1 and PAT2, return:
10206 1 if PAT1 is more specialized than PAT2 as described in [temp.class.order].
10207 -1 if PAT2 is more specialized than PAT1.
10208 0 if neither is more specialized.
10210 FULL_ARGS is the full set of template arguments that triggers this
10211 partial ordering. */
10214 more_specialized_class (tree pat1, tree pat2, tree full_args)
10219 /* Just like what happens for functions, if we are ordering between
10220 different class template specializations, we may encounter dependent
10221 types in the arguments, and we need our dependency check functions
10222 to behave correctly. */
10223 ++processing_template_decl;
10224 targs = get_class_bindings (TREE_VALUE (pat1), TREE_PURPOSE (pat1),
10225 add_outermost_template_args (full_args, TREE_PURPOSE (pat2)));
10229 targs = get_class_bindings (TREE_VALUE (pat2), TREE_PURPOSE (pat2),
10230 add_outermost_template_args (full_args, TREE_PURPOSE (pat1)));
10233 --processing_template_decl;
10238 /* Return the template arguments that will produce the function signature
10239 DECL from the function template FN, with the explicit template
10240 arguments EXPLICIT_ARGS. If CHECK_RETTYPE is 1, the return type must
10241 also match. Return NULL_TREE if no satisfactory arguments could be
10242 found. DEDUCE and LEN are passed through to fn_type_unification. */
10245 get_bindings_real (tree fn,
10247 tree explicit_args,
10252 int ntparms = DECL_NTPARMS (fn);
10253 tree targs = make_tree_vec (ntparms);
10255 tree decl_arg_types;
10258 /* Substitute the explicit template arguments into the type of DECL.
10259 The call to fn_type_unification will handle substitution into the
10261 decl_type = TREE_TYPE (decl);
10262 if (explicit_args && uses_template_parms (decl_type))
10265 tree converted_args;
10267 if (DECL_TEMPLATE_INFO (decl))
10268 tmpl = DECL_TI_TEMPLATE (decl);
10270 /* We can get here for some invalid specializations. */
10274 = (coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl),
10275 explicit_args, NULL_TREE,
10276 tf_none, /*require_all_arguments=*/0));
10277 if (converted_args == error_mark_node)
10280 decl_type = tsubst (decl_type, converted_args, tf_none, NULL_TREE);
10281 if (decl_type == error_mark_node)
10285 decl_arg_types = TYPE_ARG_TYPES (decl_type);
10286 /* Never do unification on the 'this' parameter. */
10287 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl))
10288 decl_arg_types = TREE_CHAIN (decl_arg_types);
10290 i = fn_type_unification (fn, explicit_args, targs,
10292 (check_rettype || DECL_CONV_FN_P (fn)
10293 ? TREE_TYPE (decl_type) : NULL_TREE),
10302 /* For most uses, we want to check the return type. */
10305 get_bindings (tree fn, tree decl, tree explicit_args)
10307 return get_bindings_real (fn, decl, explicit_args, 1, DEDUCE_EXACT, -1);
10310 /* But for resolve_overloaded_unification, we only care about the parameter
10314 get_bindings_overload (tree fn, tree decl, tree explicit_args)
10316 return get_bindings_real (fn, decl, explicit_args, 0, DEDUCE_EXACT, -1);
10319 /* Return the innermost template arguments that, when applied to a
10320 template specialization whose innermost template parameters are
10321 TPARMS, and whose specialization arguments are PARMS, yield the
10324 For example, suppose we have:
10326 template <class T, class U> struct S {};
10327 template <class T> struct S<T*, int> {};
10329 Then, suppose we want to get `S<double*, int>'. The TPARMS will be
10330 {T}, the PARMS will be {T*, int} and the ARGS will be {double*,
10331 int}. The resulting vector will be {double}, indicating that `T'
10332 is bound to `double'. */
10335 get_class_bindings (tree tparms, tree parms, tree args)
10337 int i, ntparms = TREE_VEC_LENGTH (tparms);
10338 tree vec = make_tree_vec (ntparms);
10340 if (unify (tparms, vec, parms, INNERMOST_TEMPLATE_ARGS (args),
10344 for (i = 0; i < ntparms; ++i)
10345 if (! TREE_VEC_ELT (vec, i))
10348 if (verify_class_unification (vec, parms, args))
10354 /* In INSTANTIATIONS is a list of <INSTANTIATION, TEMPLATE> pairs.
10355 Pick the most specialized template, and return the corresponding
10356 instantiation, or if there is no corresponding instantiation, the
10357 template itself. If there is no most specialized template,
10358 error_mark_node is returned. If there are no templates at all,
10359 NULL_TREE is returned. */
10362 most_specialized_instantiation (tree instantiations)
10367 if (!instantiations)
10370 champ = instantiations;
10371 for (fn = TREE_CHAIN (instantiations); fn; fn = TREE_CHAIN (fn))
10373 fate = more_specialized (TREE_VALUE (champ), TREE_VALUE (fn),
10381 fn = TREE_CHAIN (fn);
10383 return error_mark_node;
10389 for (fn = instantiations; fn && fn != champ; fn = TREE_CHAIN (fn))
10391 fate = more_specialized (TREE_VALUE (champ), TREE_VALUE (fn),
10394 return error_mark_node;
10397 return TREE_PURPOSE (champ) ? TREE_PURPOSE (champ) : TREE_VALUE (champ);
10400 /* Return the most specialized of the list of templates in FNS that can
10401 produce an instantiation matching DECL, given the explicit template
10402 arguments EXPLICIT_ARGS. */
10405 most_specialized (tree fns, tree decl, tree explicit_args)
10407 tree candidates = NULL_TREE;
10410 for (fn = fns; fn; fn = TREE_CHAIN (fn))
10412 tree candidate = TREE_VALUE (fn);
10414 args = get_bindings (candidate, decl, explicit_args);
10416 candidates = tree_cons (NULL_TREE, candidate, candidates);
10419 return most_specialized_instantiation (candidates);
10422 /* If DECL is a specialization of some template, return the most
10423 general such template. Otherwise, returns NULL_TREE.
10425 For example, given:
10427 template <class T> struct S { template <class U> void f(U); };
10429 if TMPL is `template <class U> void S<int>::f(U)' this will return
10430 the full template. This function will not trace past partial
10431 specializations, however. For example, given in addition:
10433 template <class T> struct S<T*> { template <class U> void f(U); };
10435 if TMPL is `template <class U> void S<int*>::f(U)' this will return
10436 `template <class T> template <class U> S<T*>::f(U)'. */
10439 most_general_template (tree decl)
10441 /* If DECL is a FUNCTION_DECL, find the TEMPLATE_DECL of which it is
10442 an immediate specialization. */
10443 if (TREE_CODE (decl) == FUNCTION_DECL)
10445 if (DECL_TEMPLATE_INFO (decl)) {
10446 decl = DECL_TI_TEMPLATE (decl);
10448 /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE for a
10449 template friend. */
10450 if (TREE_CODE (decl) != TEMPLATE_DECL)
10456 /* Look for more and more general templates. */
10457 while (DECL_TEMPLATE_INFO (decl))
10459 /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE in some cases.
10460 (See cp-tree.h for details.) */
10461 if (TREE_CODE (DECL_TI_TEMPLATE (decl)) != TEMPLATE_DECL)
10464 if (CLASS_TYPE_P (TREE_TYPE (decl))
10465 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl)))
10468 /* Stop if we run into an explicitly specialized class template. */
10469 if (!DECL_NAMESPACE_SCOPE_P (decl)
10470 && DECL_CONTEXT (decl)
10471 && CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (decl)))
10474 decl = DECL_TI_TEMPLATE (decl);
10480 /* Return the most specialized of the class template specializations
10481 of TMPL which can produce an instantiation matching ARGS, or
10482 error_mark_node if the choice is ambiguous. */
10485 most_specialized_class (tree tmpl, tree args)
10487 tree list = NULL_TREE;
10492 tmpl = most_general_template (tmpl);
10493 for (t = DECL_TEMPLATE_SPECIALIZATIONS (tmpl); t; t = TREE_CHAIN (t))
10496 = get_class_bindings (TREE_VALUE (t), TREE_PURPOSE (t), args);
10499 list = tree_cons (TREE_PURPOSE (t), TREE_VALUE (t), list);
10500 TREE_TYPE (list) = TREE_TYPE (t);
10509 t = TREE_CHAIN (t);
10510 for (; t; t = TREE_CHAIN (t))
10512 fate = more_specialized_class (champ, t, args);
10519 t = TREE_CHAIN (t);
10521 return error_mark_node;
10527 for (t = list; t && t != champ; t = TREE_CHAIN (t))
10529 fate = more_specialized_class (champ, t, args);
10531 return error_mark_node;
10537 /* Explicitly instantiate DECL. */
10540 do_decl_instantiation (tree decl, tree storage)
10542 tree result = NULL_TREE;
10546 /* An error occurred, for which grokdeclarator has already issued
10547 an appropriate message. */
10549 else if (! DECL_LANG_SPECIFIC (decl))
10551 error ("explicit instantiation of non-template `%#D'", decl);
10554 else if (TREE_CODE (decl) == VAR_DECL)
10556 /* There is an asymmetry here in the way VAR_DECLs and
10557 FUNCTION_DECLs are handled by grokdeclarator. In the case of
10558 the latter, the DECL we get back will be marked as a
10559 template instantiation, and the appropriate
10560 DECL_TEMPLATE_INFO will be set up. This does not happen for
10561 VAR_DECLs so we do the lookup here. Probably, grokdeclarator
10562 should handle VAR_DECLs as it currently handles
10564 result = lookup_field (DECL_CONTEXT (decl), DECL_NAME (decl), 0, false);
10565 if (!result || TREE_CODE (result) != VAR_DECL)
10567 error ("no matching template for `%D' found", decl);
10571 else if (TREE_CODE (decl) != FUNCTION_DECL)
10573 error ("explicit instantiation of `%#D'", decl);
10579 /* Check for various error cases. Note that if the explicit
10580 instantiation is valid the RESULT will currently be marked as an
10581 *implicit* instantiation; DECL_EXPLICIT_INSTANTIATION is not set
10582 until we get here. */
10584 if (DECL_TEMPLATE_SPECIALIZATION (result))
10586 /* DR 259 [temp.spec].
10588 Both an explicit instantiation and a declaration of an explicit
10589 specialization shall not appear in a program unless the explicit
10590 instantiation follows a declaration of the explicit specialization.
10592 For a given set of template parameters, if an explicit
10593 instantiation of a template appears after a declaration of an
10594 explicit specialization for that template, the explicit
10595 instantiation has no effect. */
10598 else if (DECL_EXPLICIT_INSTANTIATION (result))
10602 No program shall explicitly instantiate any template more
10605 We check DECL_INTERFACE_KNOWN so as not to complain when the first
10606 instantiation was `extern' and the second is not, and EXTERN_P for
10607 the opposite case. If -frepo, chances are we already got marked
10608 as an explicit instantiation because of the repo file. */
10609 if (DECL_INTERFACE_KNOWN (result) && !extern_p && !flag_use_repository)
10610 pedwarn ("duplicate explicit instantiation of `%#D'", result);
10612 /* If we've already instantiated the template, just return now. */
10613 if (DECL_INTERFACE_KNOWN (result))
10616 else if (!DECL_IMPLICIT_INSTANTIATION (result))
10618 error ("no matching template for `%D' found", result);
10621 else if (!DECL_TEMPLATE_INFO (result))
10623 pedwarn ("explicit instantiation of non-template `%#D'", result);
10627 if (storage == NULL_TREE)
10629 else if (storage == ridpointers[(int) RID_EXTERN])
10631 if (pedantic && !in_system_header)
10632 pedwarn ("ISO C++ forbids the use of `extern' on explicit instantiations");
10636 error ("storage class `%D' applied to template instantiation",
10639 SET_DECL_EXPLICIT_INSTANTIATION (result);
10640 mark_decl_instantiated (result, extern_p);
10641 repo_template_instantiated (result, extern_p);
10643 instantiate_decl (result, /*defer_ok=*/1);
10647 mark_class_instantiated (tree t, int extern_p)
10649 SET_CLASSTYPE_EXPLICIT_INSTANTIATION (t);
10650 SET_CLASSTYPE_INTERFACE_KNOWN (t);
10651 CLASSTYPE_INTERFACE_ONLY (t) = extern_p;
10652 TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (t)) = extern_p;
10655 CLASSTYPE_DEBUG_REQUESTED (t) = 1;
10656 rest_of_type_compilation (t, 1);
10660 /* Called from do_type_instantiation through binding_table_foreach to
10661 do recursive instantiation for the type bound in ENTRY. */
10663 bt_instantiate_type_proc (binding_entry entry, void *data)
10665 tree storage = *(tree *) data;
10667 if (IS_AGGR_TYPE (entry->type)
10668 && !uses_template_parms (CLASSTYPE_TI_ARGS (entry->type)))
10669 do_type_instantiation (TYPE_MAIN_DECL (entry->type), storage, 0);
10672 /* Perform an explicit instantiation of template class T. STORAGE, if
10673 non-null, is the RID for extern, inline or static. COMPLAIN is
10674 nonzero if this is called from the parser, zero if called recursively,
10675 since the standard is unclear (as detailed below). */
10678 do_type_instantiation (tree t, tree storage, tsubst_flags_t complain)
10683 int previous_instantiation_extern_p = 0;
10685 if (TREE_CODE (t) == TYPE_DECL)
10688 if (! CLASS_TYPE_P (t) || ! CLASSTYPE_TEMPLATE_INFO (t))
10690 error ("explicit instantiation of non-template type `%T'", t);
10696 if (!COMPLETE_TYPE_P (t))
10698 if (complain & tf_error)
10699 error ("explicit instantiation of `%#T' before definition of template",
10704 if (storage != NULL_TREE)
10706 if (pedantic && !in_system_header)
10707 pedwarn("ISO C++ forbids the use of `%E' on explicit instantiations",
10710 if (storage == ridpointers[(int) RID_INLINE])
10712 else if (storage == ridpointers[(int) RID_EXTERN])
10714 else if (storage == ridpointers[(int) RID_STATIC])
10718 error ("storage class `%D' applied to template instantiation",
10724 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (t))
10726 /* DR 259 [temp.spec].
10728 Both an explicit instantiation and a declaration of an explicit
10729 specialization shall not appear in a program unless the explicit
10730 instantiation follows a declaration of the explicit specialization.
10732 For a given set of template parameters, if an explicit
10733 instantiation of a template appears after a declaration of an
10734 explicit specialization for that template, the explicit
10735 instantiation has no effect. */
10738 else if (CLASSTYPE_EXPLICIT_INSTANTIATION (t))
10742 No program shall explicitly instantiate any template more
10745 If PREVIOUS_INSTANTIATION_EXTERN_P, then the first explicit
10746 instantiation was `extern'. If EXTERN_P then the second is.
10747 If -frepo, chances are we already got marked as an explicit
10748 instantiation because of the repo file. All these cases are
10751 previous_instantiation_extern_p = CLASSTYPE_INTERFACE_ONLY (t);
10753 if (!previous_instantiation_extern_p && !extern_p
10754 && !flag_use_repository
10755 && (complain & tf_error))
10756 pedwarn ("duplicate explicit instantiation of `%#T'", t);
10758 /* If we've already instantiated the template, just return now. */
10759 if (!CLASSTYPE_INTERFACE_ONLY (t))
10763 mark_class_instantiated (t, extern_p);
10764 repo_template_instantiated (t, extern_p);
10771 int explicitly_instantiate_members = 0;
10773 /* In contrast to implicit instantiation, where only the
10774 declarations, and not the definitions, of members are
10775 instantiated, we have here:
10779 The explicit instantiation of a class template specialization
10780 implies the instantiation of all of its members not
10781 previously explicitly specialized in the translation unit
10782 containing the explicit instantiation.
10784 Of course, we can't instantiate member template classes, since
10785 we don't have any arguments for them. Note that the standard
10786 is unclear on whether the instantiation of the members are
10787 *explicit* instantiations or not. We choose to be generous,
10788 and not set DECL_EXPLICIT_INSTANTIATION. Therefore, we allow
10789 the explicit instantiation of a class where some of the members
10790 have no definition in the current translation unit. Exception:
10791 on some targets (e.g. Darwin), weak symbols do not get put in
10792 a static archive's TOC. The problematic case is if we're doing
10793 a non-extern explicit instantiation of an extern template: we
10794 have to put member functions in the TOC in that case, or we'll
10795 get unresolved symbols at link time. */
10797 explicitly_instantiate_members =
10798 TARGET_EXPLICIT_INSTANTIATIONS_ONE_ONLY
10799 && previous_instantiation_extern_p && ! extern_p
10800 && ! TYPE_FOR_JAVA (t);
10803 for (tmp = TYPE_METHODS (t); tmp; tmp = TREE_CHAIN (tmp))
10804 if (TREE_CODE (tmp) == FUNCTION_DECL
10805 && DECL_TEMPLATE_INSTANTIATION (tmp))
10807 if (explicitly_instantiate_members)
10808 do_decl_instantiation (tmp, NULL_TREE);
10811 mark_decl_instantiated (tmp, extern_p);
10812 repo_template_instantiated (tmp, extern_p);
10814 instantiate_decl (tmp, /*defer_ok=*/1);
10818 for (tmp = TYPE_FIELDS (t); tmp; tmp = TREE_CHAIN (tmp))
10819 if (TREE_CODE (tmp) == VAR_DECL && DECL_TEMPLATE_INSTANTIATION (tmp))
10821 if (explicitly_instantiate_members)
10822 do_decl_instantiation (tmp, NULL_TREE);
10825 mark_decl_instantiated (tmp, extern_p);
10826 repo_template_instantiated (tmp, extern_p);
10828 instantiate_decl (tmp, /*defer_ok=*/1);
10832 if (CLASSTYPE_NESTED_UTDS (t))
10833 binding_table_foreach (CLASSTYPE_NESTED_UTDS (t),
10834 bt_instantiate_type_proc, &storage);
10838 /* Given a function DECL, which is a specialization of TMPL, modify
10839 DECL to be a re-instantiation of TMPL with the same template
10840 arguments. TMPL should be the template into which tsubst'ing
10841 should occur for DECL, not the most general template.
10843 One reason for doing this is a scenario like this:
10846 void f(const T&, int i);
10848 void g() { f(3, 7); }
10851 void f(const T& t, const int i) { }
10853 Note that when the template is first instantiated, with
10854 instantiate_template, the resulting DECL will have no name for the
10855 first parameter, and the wrong type for the second. So, when we go
10856 to instantiate the DECL, we regenerate it. */
10859 regenerate_decl_from_template (tree decl, tree tmpl)
10861 /* The most general version of TMPL. */
10863 /* The arguments used to instantiate DECL, from the most general
10870 args = DECL_TI_ARGS (decl);
10871 code_pattern = DECL_TEMPLATE_RESULT (tmpl);
10873 /* Unregister the specialization so that when we tsubst we will not
10874 just return DECL. We don't have to unregister DECL from TMPL
10875 because if would only be registered there if it were a partial
10876 instantiation of a specialization, which it isn't: it's a full
10878 gen_tmpl = most_general_template (tmpl);
10879 unregistered = reregister_specialization (decl, gen_tmpl,
10880 /*new_spec=*/NULL_TREE);
10882 /* If the DECL was not unregistered then something peculiar is
10883 happening: we created a specialization but did not call
10884 register_specialization for it. */
10885 my_friendly_assert (unregistered, 0);
10887 /* Make sure that we can see identifiers, and compute access
10889 push_access_scope (decl);
10891 /* Do the substitution to get the new declaration. */
10892 new_decl = tsubst (code_pattern, args, tf_error, NULL_TREE);
10894 if (TREE_CODE (decl) == VAR_DECL)
10896 /* Set up DECL_INITIAL, since tsubst doesn't. */
10897 if (!DECL_INITIALIZED_IN_CLASS_P (decl))
10898 DECL_INITIAL (new_decl) =
10899 tsubst_expr (DECL_INITIAL (code_pattern), args,
10900 tf_error, DECL_TI_TEMPLATE (decl));
10902 else if (TREE_CODE (decl) == FUNCTION_DECL)
10904 /* Convince duplicate_decls to use the DECL_ARGUMENTS from the
10906 DECL_INITIAL (new_decl) = error_mark_node;
10907 /* And don't complain about a duplicate definition. */
10908 DECL_INITIAL (decl) = NULL_TREE;
10911 pop_access_scope (decl);
10913 /* The immediate parent of the new template is still whatever it was
10914 before, even though tsubst sets DECL_TI_TEMPLATE up as the most
10915 general template. We also reset the DECL_ASSEMBLER_NAME since
10916 tsubst always calculates the name as if the function in question
10917 were really a template instance, and sometimes, with friend
10918 functions, this is not so. See tsubst_friend_function for
10920 DECL_TI_TEMPLATE (new_decl) = DECL_TI_TEMPLATE (decl);
10921 COPY_DECL_ASSEMBLER_NAME (decl, new_decl);
10922 COPY_DECL_RTL (decl, new_decl);
10923 DECL_USE_TEMPLATE (new_decl) = DECL_USE_TEMPLATE (decl);
10925 /* Call duplicate decls to merge the old and new declarations. */
10926 duplicate_decls (new_decl, decl);
10928 /* Now, re-register the specialization. */
10929 register_specialization (decl, gen_tmpl, args);
10932 /* Return the TEMPLATE_DECL into which DECL_TI_ARGS(DECL) should be
10933 substituted to get DECL. */
10936 template_for_substitution (tree decl)
10938 tree tmpl = DECL_TI_TEMPLATE (decl);
10940 /* Set TMPL to the template whose DECL_TEMPLATE_RESULT is the pattern
10941 for the instantiation. This is not always the most general
10942 template. Consider, for example:
10945 struct S { template <class U> void f();
10946 template <> void f<int>(); };
10948 and an instantiation of S<double>::f<int>. We want TD to be the
10949 specialization S<T>::f<int>, not the more general S<T>::f<U>. */
10950 while (/* An instantiation cannot have a definition, so we need a
10951 more general template. */
10952 DECL_TEMPLATE_INSTANTIATION (tmpl)
10953 /* We must also deal with friend templates. Given:
10955 template <class T> struct S {
10956 template <class U> friend void f() {};
10959 S<int>::f<U> say, is not an instantiation of S<T>::f<U>,
10960 so far as the language is concerned, but that's still
10961 where we get the pattern for the instantiation from. On
10962 other hand, if the definition comes outside the class, say:
10964 template <class T> struct S {
10965 template <class U> friend void f();
10967 template <class U> friend void f() {}
10969 we don't need to look any further. That's what the check for
10970 DECL_INITIAL is for. */
10971 || (TREE_CODE (decl) == FUNCTION_DECL
10972 && DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (tmpl)
10973 && !DECL_INITIAL (DECL_TEMPLATE_RESULT (tmpl))))
10975 /* The present template, TD, should not be a definition. If it
10976 were a definition, we should be using it! Note that we
10977 cannot restructure the loop to just keep going until we find
10978 a template with a definition, since that might go too far if
10979 a specialization was declared, but not defined. */
10980 my_friendly_assert (!(TREE_CODE (decl) == VAR_DECL
10981 && !DECL_IN_AGGR_P (DECL_TEMPLATE_RESULT (tmpl))),
10984 /* Fetch the more general template. */
10985 tmpl = DECL_TI_TEMPLATE (tmpl);
10991 /* Produce the definition of D, a _DECL generated from a template. If
10992 DEFER_OK is nonzero, then we don't have to actually do the
10993 instantiation now; we just have to do it sometime. */
10996 instantiate_decl (tree d, int defer_ok)
10998 tree tmpl = DECL_TI_TEMPLATE (d);
11005 int pattern_defined;
11007 location_t saved_loc = input_location;
11009 /* This function should only be used to instantiate templates for
11010 functions and static member variables. */
11011 my_friendly_assert (TREE_CODE (d) == FUNCTION_DECL
11012 || TREE_CODE (d) == VAR_DECL, 0);
11014 /* Variables are never deferred; if instantiation is required, they
11015 are instantiated right away. That allows for better code in the
11016 case that an expression refers to the value of the variable --
11017 if the variable has a constant value the referring expression can
11018 take advantage of that fact. */
11019 if (TREE_CODE (d) == VAR_DECL)
11022 /* Don't instantiate cloned functions. Instead, instantiate the
11023 functions they cloned. */
11024 if (TREE_CODE (d) == FUNCTION_DECL && DECL_CLONED_FUNCTION_P (d))
11025 d = DECL_CLONED_FUNCTION (d);
11027 if (DECL_TEMPLATE_INSTANTIATED (d))
11028 /* D has already been instantiated. It might seem reasonable to
11029 check whether or not D is an explicit instantiation, and, if so,
11030 stop here. But when an explicit instantiation is deferred
11031 until the end of the compilation, DECL_EXPLICIT_INSTANTIATION
11032 is set, even though we still need to do the instantiation. */
11035 /* If we already have a specialization of this declaration, then
11036 there's no reason to instantiate it. Note that
11037 retrieve_specialization gives us both instantiations and
11038 specializations, so we must explicitly check
11039 DECL_TEMPLATE_SPECIALIZATION. */
11040 gen_tmpl = most_general_template (tmpl);
11041 gen_args = DECL_TI_ARGS (d);
11042 spec = retrieve_specialization (gen_tmpl, gen_args);
11043 if (spec != NULL_TREE && DECL_TEMPLATE_SPECIALIZATION (spec))
11046 /* This needs to happen before any tsubsting. */
11047 if (! push_tinst_level (d))
11050 timevar_push (TV_PARSE);
11052 /* We may be in the middle of deferred access check. Disable it now. */
11053 push_deferring_access_checks (dk_no_deferred);
11055 /* Set TD to the template whose DECL_TEMPLATE_RESULT is the pattern
11056 for the instantiation. */
11057 td = template_for_substitution (d);
11058 code_pattern = DECL_TEMPLATE_RESULT (td);
11060 if ((DECL_NAMESPACE_SCOPE_P (d) && !DECL_INITIALIZED_IN_CLASS_P (d))
11061 || DECL_TEMPLATE_SPECIALIZATION (td))
11062 /* In the case of a friend template whose definition is provided
11063 outside the class, we may have too many arguments. Drop the
11064 ones we don't need. The same is true for specializations. */
11065 args = get_innermost_template_args
11066 (gen_args, TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (td)));
11070 if (TREE_CODE (d) == FUNCTION_DECL)
11071 pattern_defined = (DECL_SAVED_TREE (code_pattern) != NULL_TREE);
11073 pattern_defined = ! DECL_IN_AGGR_P (code_pattern);
11075 input_location = DECL_SOURCE_LOCATION (d);
11077 if (pattern_defined)
11079 /* Let the repository code that this template definition is
11082 The repository doesn't need to know about cloned functions
11083 because they never actually show up in the object file. It
11084 does need to know about the clones; those are the symbols
11085 that the linker will be emitting error messages about. */
11086 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (d)
11087 || DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (d))
11091 for (t = TREE_CHAIN (d);
11092 t && DECL_CLONED_FUNCTION_P (t);
11093 t = TREE_CHAIN (t))
11094 repo_template_used (t);
11097 repo_template_used (d);
11100 import_export_decl (d);
11105 /* Recheck the substitutions to obtain any warning messages
11106 about ignoring cv qualifiers. */
11107 tree gen = DECL_TEMPLATE_RESULT (gen_tmpl);
11108 tree type = TREE_TYPE (gen);
11110 /* Make sure that we can see identifiers, and compute access
11111 correctly. D is already the target FUNCTION_DECL with the
11113 push_access_scope (d);
11115 if (TREE_CODE (gen) == FUNCTION_DECL)
11117 tsubst (DECL_ARGUMENTS (gen), gen_args, tf_error | tf_warning, d);
11118 tsubst (TYPE_RAISES_EXCEPTIONS (type), gen_args,
11119 tf_error | tf_warning, d);
11120 /* Don't simply tsubst the function type, as that will give
11121 duplicate warnings about poor parameter qualifications.
11122 The function arguments are the same as the decl_arguments
11123 without the top level cv qualifiers. */
11124 type = TREE_TYPE (type);
11126 tsubst (type, gen_args, tf_error | tf_warning, d);
11128 pop_access_scope (d);
11131 if (TREE_CODE (d) == VAR_DECL && DECL_INITIALIZED_IN_CLASS_P (d)
11132 && DECL_INITIAL (d) == NULL_TREE)
11133 /* We should have set up DECL_INITIAL in instantiate_class_template. */
11135 /* Reject all external templates except inline functions. */
11136 else if (DECL_INTERFACE_KNOWN (d)
11137 && ! DECL_NOT_REALLY_EXTERN (d)
11138 && ! (TREE_CODE (d) == FUNCTION_DECL
11139 && DECL_INLINE (d)))
11141 /* Defer all other templates, unless we have been explicitly
11142 forbidden from doing so. We restore the source position here
11143 because it's used by add_pending_template. */
11144 else if (! pattern_defined || defer_ok)
11146 input_location = saved_loc;
11148 if (at_eof && !pattern_defined
11149 && DECL_EXPLICIT_INSTANTIATION (d))
11152 The definition of a non-exported function template, a
11153 non-exported member function template, or a non-exported
11154 member function or static data member of a class template
11155 shall be present in every translation unit in which it is
11156 explicitly instantiated. */
11158 ("explicit instantiation of `%D' but no definition available", d);
11160 add_pending_template (d);
11164 need_push = !cfun || !global_bindings_p ();
11166 push_to_top_level ();
11168 /* Mark D as instantiated so that recursive calls to
11169 instantiate_decl do not try to instantiate it again. */
11170 DECL_TEMPLATE_INSTANTIATED (d) = 1;
11172 /* Regenerate the declaration in case the template has been modified
11173 by a subsequent redeclaration. */
11174 regenerate_decl_from_template (d, td);
11176 /* We already set the file and line above. Reset them now in case
11177 they changed as a result of calling regenerate_decl_from_template. */
11178 input_location = DECL_SOURCE_LOCATION (d);
11180 if (TREE_CODE (d) == VAR_DECL)
11182 /* Clear out DECL_RTL; whatever was there before may not be right
11183 since we've reset the type of the declaration. */
11184 SET_DECL_RTL (d, NULL_RTX);
11186 DECL_IN_AGGR_P (d) = 0;
11187 import_export_decl (d);
11188 DECL_EXTERNAL (d) = ! DECL_NOT_REALLY_EXTERN (d);
11190 if (DECL_EXTERNAL (d))
11192 /* The fact that this code is executing indicates that:
11194 (1) D is a template static data member, for which a
11195 definition is available.
11197 (2) An implicit or explicit instantiation has occurred.
11199 (3) We are not going to emit a definition of the static
11200 data member at this time.
11202 This situation is peculiar, but it occurs on platforms
11203 without weak symbols when performing an implicit
11204 instantiation. There, we cannot implicitly instantiate a
11205 defined static data member in more than one translation
11206 unit, so import_export_decl marks the declaration as
11207 external; we must rely on explicit instantiation.
11209 Reset instantiated marker to make sure that later
11210 explicit instantiation will be processed. */
11211 DECL_TEMPLATE_INSTANTIATED (d) = 0;
11215 /* This is done in analogous to `start_decl'. It is
11216 required for correct access checking. */
11217 push_nested_class (DECL_CONTEXT (d));
11219 (!DECL_INITIALIZED_IN_CLASS_P (d)
11220 ? DECL_INITIAL (d) : NULL_TREE),
11222 /* Normally, pop_nested_class is called by cp_finish_decl
11223 above. But when instantiate_decl is triggered during
11224 instantiate_class_template processing, its DECL_CONTEXT
11225 is still not completed yet, and pop_nested_class isn't
11227 if (!COMPLETE_TYPE_P (DECL_CONTEXT (d)))
11228 pop_nested_class ();
11231 else if (TREE_CODE (d) == FUNCTION_DECL)
11233 htab_t saved_local_specializations;
11238 /* Mark D as instantiated so that recursive calls to
11239 instantiate_decl do not try to instantiate it again. */
11240 DECL_TEMPLATE_INSTANTIATED (d) = 1;
11242 /* Save away the current list, in case we are instantiating one
11243 template from within the body of another. */
11244 saved_local_specializations = local_specializations;
11246 /* Set up the list of local specializations. */
11247 local_specializations = htab_create (37,
11248 hash_local_specialization,
11249 eq_local_specializations,
11252 /* Set up context. */
11253 import_export_decl (d);
11254 start_function (NULL_TREE, d, NULL_TREE, SF_PRE_PARSED);
11256 /* Create substitution entries for the parameters. */
11257 subst_decl = DECL_TEMPLATE_RESULT (template_for_substitution (d));
11258 tmpl_parm = DECL_ARGUMENTS (subst_decl);
11259 spec_parm = DECL_ARGUMENTS (d);
11260 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (d))
11262 register_local_specialization (spec_parm, tmpl_parm);
11263 spec_parm = skip_artificial_parms_for (d, spec_parm);
11264 tmpl_parm = skip_artificial_parms_for (subst_decl, tmpl_parm);
11268 register_local_specialization (spec_parm, tmpl_parm);
11269 tmpl_parm = TREE_CHAIN (tmpl_parm);
11270 spec_parm = TREE_CHAIN (spec_parm);
11272 my_friendly_assert (!spec_parm, 20020813);
11274 /* Substitute into the body of the function. */
11275 tsubst_expr (DECL_SAVED_TREE (code_pattern), args,
11276 tf_error | tf_warning, tmpl);
11278 /* We don't need the local specializations any more. */
11279 htab_delete (local_specializations);
11280 local_specializations = saved_local_specializations;
11282 /* Finish the function. */
11283 d = finish_function (0);
11284 expand_or_defer_fn (d);
11287 /* We're not deferring instantiation any more. */
11288 TI_PENDING_TEMPLATE_FLAG (DECL_TEMPLATE_INFO (d)) = 0;
11291 pop_from_top_level ();
11294 input_location = saved_loc;
11295 pop_deferring_access_checks ();
11296 pop_tinst_level ();
11298 timevar_pop (TV_PARSE);
11303 /* Run through the list of templates that we wish we could
11304 instantiate, and instantiate any we can. */
11307 instantiate_pending_templates (void)
11310 tree last = NULL_TREE;
11311 int instantiated_something = 0;
11313 location_t saved_loc = input_location;
11319 t = &pending_templates;
11322 tree instantiation = TREE_VALUE (*t);
11324 reopen_tinst_level (TREE_PURPOSE (*t));
11326 if (TYPE_P (instantiation))
11330 if (!COMPLETE_TYPE_P (instantiation))
11332 instantiate_class_template (instantiation);
11333 if (CLASSTYPE_TEMPLATE_INSTANTIATION (instantiation))
11334 for (fn = TYPE_METHODS (instantiation);
11336 fn = TREE_CHAIN (fn))
11337 if (! DECL_ARTIFICIAL (fn))
11338 instantiate_decl (fn, /*defer_ok=*/0);
11339 if (COMPLETE_TYPE_P (instantiation))
11341 instantiated_something = 1;
11346 if (COMPLETE_TYPE_P (instantiation))
11347 /* If INSTANTIATION has been instantiated, then we don't
11348 need to consider it again in the future. */
11349 *t = TREE_CHAIN (*t);
11353 t = &TREE_CHAIN (*t);
11358 if (!DECL_TEMPLATE_SPECIALIZATION (instantiation)
11359 && !DECL_TEMPLATE_INSTANTIATED (instantiation))
11361 instantiation = instantiate_decl (instantiation,
11363 if (DECL_TEMPLATE_INSTANTIATED (instantiation))
11365 instantiated_something = 1;
11370 if (DECL_TEMPLATE_SPECIALIZATION (instantiation)
11371 || DECL_TEMPLATE_INSTANTIATED (instantiation))
11372 /* If INSTANTIATION has been instantiated, then we don't
11373 need to consider it again in the future. */
11374 *t = TREE_CHAIN (*t);
11378 t = &TREE_CHAIN (*t);
11382 current_tinst_level = NULL_TREE;
11384 last_pending_template = last;
11386 while (reconsider);
11388 input_location = saved_loc;
11389 return instantiated_something;
11392 /* Substitute ARGVEC into T, which is a list of initializers for
11393 either base class or a non-static data member. The TREE_PURPOSEs
11394 are DECLs, and the TREE_VALUEs are the initializer values. Used by
11395 instantiate_decl. */
11398 tsubst_initializer_list (tree t, tree argvec)
11400 tree inits = NULL_TREE;
11402 for (; t; t = TREE_CHAIN (t))
11408 decl = tsubst_copy (TREE_PURPOSE (t), argvec, tf_error | tf_warning,
11410 decl = expand_member_init (decl);
11411 if (decl && !DECL_P (decl))
11412 in_base_initializer = 1;
11414 init = tsubst_expr (TREE_VALUE (t), argvec, tf_error | tf_warning,
11418 else if (TREE_CODE (init) == TREE_LIST)
11419 for (val = init; val; val = TREE_CHAIN (val))
11420 TREE_VALUE (val) = convert_from_reference (TREE_VALUE (val));
11421 else if (init != void_type_node)
11422 init = convert_from_reference (init);
11424 in_base_initializer = 0;
11428 init = build_tree_list (decl, init);
11429 TREE_CHAIN (init) = inits;
11436 /* Set CURRENT_ACCESS_SPECIFIER based on the protection of DECL. */
11439 set_current_access_from_decl (tree decl)
11441 if (TREE_PRIVATE (decl))
11442 current_access_specifier = access_private_node;
11443 else if (TREE_PROTECTED (decl))
11444 current_access_specifier = access_protected_node;
11446 current_access_specifier = access_public_node;
11449 /* Instantiate an enumerated type. TAG is the template type, NEWTAG
11450 is the instantiation (which should have been created with
11451 start_enum) and ARGS are the template arguments to use. */
11454 tsubst_enum (tree tag, tree newtag, tree args)
11458 for (e = TYPE_VALUES (tag); e; e = TREE_CHAIN (e))
11463 decl = TREE_VALUE (e);
11464 /* Note that in a template enum, the TREE_VALUE is the
11465 CONST_DECL, not the corresponding INTEGER_CST. */
11466 value = tsubst_expr (DECL_INITIAL (decl),
11467 args, tf_error | tf_warning,
11470 /* Give this enumeration constant the correct access. */
11471 set_current_access_from_decl (decl);
11473 /* Actually build the enumerator itself. */
11474 build_enumerator (DECL_NAME (decl), value, newtag);
11477 finish_enum (newtag);
11478 DECL_SOURCE_LOCATION (TYPE_NAME (newtag))
11479 = DECL_SOURCE_LOCATION (TYPE_NAME (tag));
11482 /* DECL is a FUNCTION_DECL that is a template specialization. Return
11483 its type -- but without substituting the innermost set of template
11484 arguments. So, innermost set of template parameters will appear in
11488 get_mostly_instantiated_function_type (tree decl)
11496 tmpl = most_general_template (DECL_TI_TEMPLATE (decl));
11497 targs = DECL_TI_ARGS (decl);
11498 tparms = DECL_TEMPLATE_PARMS (tmpl);
11499 parm_depth = TMPL_PARMS_DEPTH (tparms);
11501 /* There should be as many levels of arguments as there are levels
11503 my_friendly_assert (parm_depth == TMPL_ARGS_DEPTH (targs), 0);
11505 fn_type = TREE_TYPE (tmpl);
11507 if (parm_depth == 1)
11508 /* No substitution is necessary. */
11515 /* Replace the innermost level of the TARGS with NULL_TREEs to
11516 let tsubst know not to substitute for those parameters. */
11517 partial_args = make_tree_vec (TREE_VEC_LENGTH (targs));
11518 for (i = 1; i < TMPL_ARGS_DEPTH (targs); ++i)
11519 SET_TMPL_ARGS_LEVEL (partial_args, i,
11520 TMPL_ARGS_LEVEL (targs, i));
11521 SET_TMPL_ARGS_LEVEL (partial_args,
11522 TMPL_ARGS_DEPTH (targs),
11523 make_tree_vec (DECL_NTPARMS (tmpl)));
11525 /* Make sure that we can see identifiers, and compute access
11526 correctly. We can just use the context of DECL for the
11527 partial substitution here. It depends only on outer template
11528 parameters, regardless of whether the innermost level is
11529 specialized or not. */
11530 push_access_scope (decl);
11532 ++processing_template_decl;
11533 /* Now, do the (partial) substitution to figure out the
11534 appropriate function type. */
11535 fn_type = tsubst (fn_type, partial_args, tf_error, NULL_TREE);
11536 --processing_template_decl;
11538 /* Substitute into the template parameters to obtain the real
11539 innermost set of parameters. This step is important if the
11540 innermost set of template parameters contains value
11541 parameters whose types depend on outer template parameters. */
11542 TREE_VEC_LENGTH (partial_args)--;
11543 tparms = tsubst_template_parms (tparms, partial_args, tf_error);
11545 pop_access_scope (decl);
11551 /* Return truthvalue if we're processing a template different from
11552 the last one involved in diagnostics. */
11554 problematic_instantiation_changed (void)
11556 return last_template_error_tick != tinst_level_tick;
11559 /* Remember current template involved in diagnostics. */
11561 record_last_problematic_instantiation (void)
11563 last_template_error_tick = tinst_level_tick;
11567 current_instantiation (void)
11569 return current_tinst_level;
11572 /* [temp.param] Check that template non-type parm TYPE is of an allowable
11573 type. Return zero for ok, nonzero for disallowed. Issue error and
11574 warning messages under control of COMPLAIN. */
11577 invalid_nontype_parm_type_p (tree type, tsubst_flags_t complain)
11579 if (INTEGRAL_TYPE_P (type))
11581 else if (POINTER_TYPE_P (type))
11583 else if (TYPE_PTR_TO_MEMBER_P (type))
11585 else if (TREE_CODE (type) == TEMPLATE_TYPE_PARM)
11587 else if (TREE_CODE (type) == TYPENAME_TYPE)
11590 if (complain & tf_error)
11591 error ("`%#T' is not a valid type for a template constant parameter",
11596 /* Returns TRUE if TYPE is dependent, in the sense of [temp.dep.type].
11597 Assumes that TYPE really is a type, and not the ERROR_MARK_NODE.*/
11600 dependent_type_p_r (tree type)
11606 A type is dependent if it is:
11608 -- a template parameter. Template template parameters are
11609 types for us (since TYPE_P holds true for them) so we
11610 handle them here. */
11611 if (TREE_CODE (type) == TEMPLATE_TYPE_PARM
11612 || TREE_CODE (type) == TEMPLATE_TEMPLATE_PARM)
11614 /* -- a qualified-id with a nested-name-specifier which contains a
11615 class-name that names a dependent type or whose unqualified-id
11616 names a dependent type. */
11617 if (TREE_CODE (type) == TYPENAME_TYPE)
11619 /* -- a cv-qualified type where the cv-unqualified type is
11621 type = TYPE_MAIN_VARIANT (type);
11622 /* -- a compound type constructed from any dependent type. */
11623 if (TYPE_PTR_TO_MEMBER_P (type))
11624 return (dependent_type_p (TYPE_PTRMEM_CLASS_TYPE (type))
11625 || dependent_type_p (TYPE_PTRMEM_POINTED_TO_TYPE
11627 else if (TREE_CODE (type) == POINTER_TYPE
11628 || TREE_CODE (type) == REFERENCE_TYPE)
11629 return dependent_type_p (TREE_TYPE (type));
11630 else if (TREE_CODE (type) == FUNCTION_TYPE
11631 || TREE_CODE (type) == METHOD_TYPE)
11635 if (dependent_type_p (TREE_TYPE (type)))
11637 for (arg_type = TYPE_ARG_TYPES (type);
11639 arg_type = TREE_CHAIN (arg_type))
11640 if (dependent_type_p (TREE_VALUE (arg_type)))
11644 /* -- an array type constructed from any dependent type or whose
11645 size is specified by a constant expression that is
11646 value-dependent. */
11647 if (TREE_CODE (type) == ARRAY_TYPE)
11649 if (TYPE_DOMAIN (type)
11650 && ((value_dependent_expression_p
11651 (TYPE_MAX_VALUE (TYPE_DOMAIN (type))))
11652 || (type_dependent_expression_p
11653 (TYPE_MAX_VALUE (TYPE_DOMAIN (type))))))
11655 return dependent_type_p (TREE_TYPE (type));
11658 /* -- a template-id in which either the template name is a template
11660 if (TREE_CODE (type) == BOUND_TEMPLATE_TEMPLATE_PARM)
11662 /* ... or any of the template arguments is a dependent type or
11663 an expression that is type-dependent or value-dependent. */
11664 else if (CLASS_TYPE_P (type) && CLASSTYPE_TEMPLATE_INFO (type)
11665 && (any_dependent_template_arguments_p
11666 (INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type)))))
11669 /* All TYPEOF_TYPEs are dependent; if the argument of the `typeof'
11670 expression is not type-dependent, then it should already been
11672 if (TREE_CODE (type) == TYPEOF_TYPE)
11675 /* The standard does not specifically mention types that are local
11676 to template functions or local classes, but they should be
11677 considered dependent too. For example:
11679 template <int I> void f() {
11684 The size of `E' cannot be known until the value of `I' has been
11685 determined. Therefore, `E' must be considered dependent. */
11686 scope = TYPE_CONTEXT (type);
11687 if (scope && TYPE_P (scope))
11688 return dependent_type_p (scope);
11689 else if (scope && TREE_CODE (scope) == FUNCTION_DECL)
11690 return type_dependent_expression_p (scope);
11692 /* Other types are non-dependent. */
11696 /* Returns TRUE if TYPE is dependent, in the sense of
11697 [temp.dep.type]. */
11700 dependent_type_p (tree type)
11702 /* If there are no template parameters in scope, then there can't be
11703 any dependent types. */
11704 if (!processing_template_decl)
11707 /* If the type is NULL, we have not computed a type for the entity
11708 in question; in that case, the type is dependent. */
11712 /* Erroneous types can be considered non-dependent. */
11713 if (type == error_mark_node)
11716 /* If we have not already computed the appropriate value for TYPE,
11718 if (!TYPE_DEPENDENT_P_VALID (type))
11720 TYPE_DEPENDENT_P (type) = dependent_type_p_r (type);
11721 TYPE_DEPENDENT_P_VALID (type) = 1;
11724 return TYPE_DEPENDENT_P (type);
11727 /* Returns TRUE if EXPRESSION is dependent, according to CRITERION. */
11730 dependent_scope_ref_p (tree expression, bool criterion (tree))
11735 my_friendly_assert (TREE_CODE (expression) == SCOPE_REF, 20030714);
11737 if (!TYPE_P (TREE_OPERAND (expression, 0)))
11740 scope = TREE_OPERAND (expression, 0);
11741 name = TREE_OPERAND (expression, 1);
11745 An id-expression is type-dependent if it contains a
11746 nested-name-specifier that contains a class-name that names a
11748 /* The suggested resolution to Core Issue 2 implies that if the
11749 qualifying type is the current class, then we must peek
11752 && currently_open_class (scope)
11753 && !criterion (name))
11755 if (dependent_type_p (scope))
11761 /* Returns TRUE if the EXPRESSION is value-dependent, in the sense of
11762 [temp.dep.constexpr] */
11765 value_dependent_expression_p (tree expression)
11767 if (!processing_template_decl)
11770 /* A name declared with a dependent type. */
11771 if (TREE_CODE (expression) == IDENTIFIER_NODE
11772 || (DECL_P (expression)
11773 && type_dependent_expression_p (expression)))
11775 /* A non-type template parameter. */
11776 if ((TREE_CODE (expression) == CONST_DECL
11777 && DECL_TEMPLATE_PARM_P (expression))
11778 || TREE_CODE (expression) == TEMPLATE_PARM_INDEX)
11780 /* A constant with integral or enumeration type and is initialized
11781 with an expression that is value-dependent. */
11782 if (TREE_CODE (expression) == VAR_DECL
11783 && DECL_INITIAL (expression)
11784 && INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (expression))
11785 && value_dependent_expression_p (DECL_INITIAL (expression)))
11787 /* These expressions are value-dependent if the type to which the
11788 cast occurs is dependent or the expression being casted is
11789 value-dependent. */
11790 if (TREE_CODE (expression) == DYNAMIC_CAST_EXPR
11791 || TREE_CODE (expression) == STATIC_CAST_EXPR
11792 || TREE_CODE (expression) == CONST_CAST_EXPR
11793 || TREE_CODE (expression) == REINTERPRET_CAST_EXPR
11794 || TREE_CODE (expression) == CAST_EXPR)
11796 tree type = TREE_TYPE (expression);
11797 if (dependent_type_p (type))
11799 /* A functional cast has a list of operands. */
11800 expression = TREE_OPERAND (expression, 0);
11803 /* If there are no operands, it must be an expression such
11804 as "int()". This should not happen for aggregate types
11805 because it would form non-constant expressions. */
11806 my_friendly_assert (INTEGRAL_OR_ENUMERATION_TYPE_P (type),
11811 if (TREE_CODE (expression) == TREE_LIST)
11815 if (value_dependent_expression_p (TREE_VALUE (expression)))
11817 expression = TREE_CHAIN (expression);
11819 while (expression);
11823 return value_dependent_expression_p (expression);
11825 /* A `sizeof' expression is value-dependent if the operand is
11827 if (TREE_CODE (expression) == SIZEOF_EXPR
11828 || TREE_CODE (expression) == ALIGNOF_EXPR)
11830 expression = TREE_OPERAND (expression, 0);
11831 if (TYPE_P (expression))
11832 return dependent_type_p (expression);
11833 return type_dependent_expression_p (expression);
11835 if (TREE_CODE (expression) == SCOPE_REF)
11836 return dependent_scope_ref_p (expression, value_dependent_expression_p);
11837 if (TREE_CODE (expression) == COMPONENT_REF)
11838 return (value_dependent_expression_p (TREE_OPERAND (expression, 0))
11839 || value_dependent_expression_p (TREE_OPERAND (expression, 1)));
11840 /* A constant expression is value-dependent if any subexpression is
11841 value-dependent. */
11842 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (expression))))
11844 switch (TREE_CODE_CLASS (TREE_CODE (expression)))
11847 return (value_dependent_expression_p
11848 (TREE_OPERAND (expression, 0)));
11851 return ((value_dependent_expression_p
11852 (TREE_OPERAND (expression, 0)))
11853 || (value_dependent_expression_p
11854 (TREE_OPERAND (expression, 1))));
11858 for (i = 0; i < first_rtl_op (TREE_CODE (expression)); ++i)
11859 /* In some cases, some of the operands may be missing.
11860 (For example, in the case of PREDECREMENT_EXPR, the
11861 amount to increment by may be missing.) That doesn't
11862 make the expression dependent. */
11863 if (TREE_OPERAND (expression, i)
11864 && (value_dependent_expression_p
11865 (TREE_OPERAND (expression, i))))
11872 /* The expression is not value-dependent. */
11876 /* Returns TRUE if the EXPRESSION is type-dependent, in the sense of
11877 [temp.dep.expr]. */
11880 type_dependent_expression_p (tree expression)
11882 if (!processing_template_decl)
11885 if (expression == error_mark_node)
11888 /* An unresolved name is always dependent. */
11889 if (TREE_CODE (expression) == IDENTIFIER_NODE)
11892 /* Some expression forms are never type-dependent. */
11893 if (TREE_CODE (expression) == PSEUDO_DTOR_EXPR
11894 || TREE_CODE (expression) == SIZEOF_EXPR
11895 || TREE_CODE (expression) == ALIGNOF_EXPR
11896 || TREE_CODE (expression) == TYPEID_EXPR
11897 || TREE_CODE (expression) == DELETE_EXPR
11898 || TREE_CODE (expression) == VEC_DELETE_EXPR
11899 || TREE_CODE (expression) == THROW_EXPR)
11902 /* The types of these expressions depends only on the type to which
11903 the cast occurs. */
11904 if (TREE_CODE (expression) == DYNAMIC_CAST_EXPR
11905 || TREE_CODE (expression) == STATIC_CAST_EXPR
11906 || TREE_CODE (expression) == CONST_CAST_EXPR
11907 || TREE_CODE (expression) == REINTERPRET_CAST_EXPR
11908 || TREE_CODE (expression) == CAST_EXPR)
11909 return dependent_type_p (TREE_TYPE (expression));
11911 /* The types of these expressions depends only on the type created
11912 by the expression. */
11913 if (TREE_CODE (expression) == NEW_EXPR
11914 || TREE_CODE (expression) == VEC_NEW_EXPR)
11916 /* For NEW_EXPR tree nodes created inside a template, either
11917 the object type itself or a TREE_LIST may appear as the
11919 tree type = TREE_OPERAND (expression, 1);
11920 if (TREE_CODE (type) == TREE_LIST)
11921 /* This is an array type. We need to check array dimensions
11923 return dependent_type_p (TREE_VALUE (TREE_PURPOSE (type)))
11924 || value_dependent_expression_p
11925 (TREE_OPERAND (TREE_VALUE (type), 1));
11927 return dependent_type_p (type);
11930 if (TREE_CODE (expression) == SCOPE_REF
11931 && dependent_scope_ref_p (expression,
11932 type_dependent_expression_p))
11935 if (TREE_CODE (expression) == FUNCTION_DECL
11936 && DECL_LANG_SPECIFIC (expression)
11937 && DECL_TEMPLATE_INFO (expression)
11938 && (any_dependent_template_arguments_p
11939 (INNERMOST_TEMPLATE_ARGS (DECL_TI_ARGS (expression)))))
11942 if (TREE_CODE (expression) == TEMPLATE_DECL
11943 && !DECL_TEMPLATE_TEMPLATE_PARM_P (expression))
11946 if (TREE_TYPE (expression) == unknown_type_node)
11948 if (TREE_CODE (expression) == ADDR_EXPR)
11949 return type_dependent_expression_p (TREE_OPERAND (expression, 0));
11950 if (TREE_CODE (expression) == COMPONENT_REF
11951 || TREE_CODE (expression) == OFFSET_REF)
11953 if (type_dependent_expression_p (TREE_OPERAND (expression, 0)))
11955 expression = TREE_OPERAND (expression, 1);
11956 if (TREE_CODE (expression) == IDENTIFIER_NODE)
11960 if (TREE_CODE (expression) == BASELINK)
11961 expression = BASELINK_FUNCTIONS (expression);
11962 if (TREE_CODE (expression) == TEMPLATE_ID_EXPR)
11964 if (any_dependent_template_arguments_p
11965 (TREE_OPERAND (expression, 1)))
11967 expression = TREE_OPERAND (expression, 0);
11969 if (TREE_CODE (expression) == OVERLOAD)
11973 if (type_dependent_expression_p (OVL_CURRENT (expression)))
11975 expression = OVL_NEXT (expression);
11982 return (dependent_type_p (TREE_TYPE (expression)));
11985 /* Returns TRUE if ARGS (a TREE_LIST of arguments to a function call)
11986 contains a type-dependent expression. */
11989 any_type_dependent_arguments_p (tree args)
11993 tree arg = TREE_VALUE (args);
11995 if (type_dependent_expression_p (arg))
11997 args = TREE_CHAIN (args);
12002 /* Returns TRUE if the ARG (a template argument) is dependent. */
12005 dependent_template_arg_p (tree arg)
12007 if (!processing_template_decl)
12010 if (TREE_CODE (arg) == TEMPLATE_DECL
12011 || TREE_CODE (arg) == TEMPLATE_TEMPLATE_PARM)
12012 return dependent_template_p (arg);
12013 else if (TYPE_P (arg))
12014 return dependent_type_p (arg);
12016 return (type_dependent_expression_p (arg)
12017 || value_dependent_expression_p (arg));
12020 /* Returns true if ARGS (a collection of template arguments) contains
12021 any dependent arguments. */
12024 any_dependent_template_arguments_p (tree args)
12032 for (i = 0; i < TMPL_ARGS_DEPTH (args); ++i)
12034 tree level = TMPL_ARGS_LEVEL (args, i + 1);
12035 for (j = 0; j < TREE_VEC_LENGTH (level); ++j)
12036 if (dependent_template_arg_p (TREE_VEC_ELT (level, j)))
12043 /* Returns TRUE if the template TMPL is dependent. */
12046 dependent_template_p (tree tmpl)
12048 if (TREE_CODE (tmpl) == OVERLOAD)
12052 if (dependent_template_p (OVL_FUNCTION (tmpl)))
12054 tmpl = OVL_CHAIN (tmpl);
12059 /* Template template parameters are dependent. */
12060 if (DECL_TEMPLATE_TEMPLATE_PARM_P (tmpl)
12061 || TREE_CODE (tmpl) == TEMPLATE_TEMPLATE_PARM)
12063 /* So are qualified names that have not been looked up. */
12064 if (TREE_CODE (tmpl) == SCOPE_REF)
12066 /* So are member templates of dependent classes. */
12067 if (TYPE_P (CP_DECL_CONTEXT (tmpl)))
12068 return dependent_type_p (DECL_CONTEXT (tmpl));
12072 /* Returns TRUE if the specialization TMPL<ARGS> is dependent. */
12075 dependent_template_id_p (tree tmpl, tree args)
12077 return (dependent_template_p (tmpl)
12078 || any_dependent_template_arguments_p (args));
12081 /* TYPE is a TYPENAME_TYPE. Returns the ordinary TYPE to which the
12082 TYPENAME_TYPE corresponds. Returns ERROR_MARK_NODE if no such TYPE
12083 can be found. Note that this function peers inside uninstantiated
12084 templates and therefore should be used only in extremely limited
12088 resolve_typename_type (tree type, bool only_current_p)
12096 my_friendly_assert (TREE_CODE (type) == TYPENAME_TYPE,
12099 scope = TYPE_CONTEXT (type);
12100 name = TYPE_IDENTIFIER (type);
12102 /* If the SCOPE is itself a TYPENAME_TYPE, then we need to resolve
12103 it first before we can figure out what NAME refers to. */
12104 if (TREE_CODE (scope) == TYPENAME_TYPE)
12105 scope = resolve_typename_type (scope, only_current_p);
12106 /* If we don't know what SCOPE refers to, then we cannot resolve the
12108 if (scope == error_mark_node || TREE_CODE (scope) == TYPENAME_TYPE)
12109 return error_mark_node;
12110 /* If the SCOPE is a template type parameter, we have no way of
12111 resolving the name. */
12112 if (TREE_CODE (scope) == TEMPLATE_TYPE_PARM)
12114 /* If the SCOPE is not the current instantiation, there's no reason
12115 to look inside it. */
12116 if (only_current_p && !currently_open_class (scope))
12117 return error_mark_node;
12118 /* If SCOPE is a partial instantiation, it will not have a valid
12119 TYPE_FIELDS list, so use the original template. */
12120 scope = CLASSTYPE_PRIMARY_TEMPLATE_TYPE (scope);
12121 /* Enter the SCOPE so that name lookup will be resolved as if we
12122 were in the class definition. In particular, SCOPE will no
12123 longer be considered a dependent type. */
12124 pop_p = push_scope (scope);
12125 /* Look up the declaration. */
12126 decl = lookup_member (scope, name, /*protect=*/0, /*want_type=*/true);
12127 /* Obtain the set of qualifiers applied to the TYPE. */
12128 quals = cp_type_quals (type);
12129 /* For a TYPENAME_TYPE like "typename X::template Y<T>", we want to
12130 find a TEMPLATE_DECL. Otherwise, we want to find a TYPE_DECL. */
12132 type = error_mark_node;
12133 else if (TREE_CODE (TYPENAME_TYPE_FULLNAME (type)) == IDENTIFIER_NODE
12134 && TREE_CODE (decl) == TYPE_DECL)
12135 type = TREE_TYPE (decl);
12136 else if (TREE_CODE (TYPENAME_TYPE_FULLNAME (type)) == TEMPLATE_ID_EXPR
12137 && DECL_CLASS_TEMPLATE_P (decl))
12141 /* Obtain the template and the arguments. */
12142 tmpl = TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type), 0);
12143 args = TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type), 1);
12144 /* Instantiate the template. */
12145 type = lookup_template_class (tmpl, args, NULL_TREE, NULL_TREE,
12146 /*entering_scope=*/0, tf_error | tf_user);
12149 type = error_mark_node;
12150 /* Qualify the resulting type. */
12151 if (type != error_mark_node && quals)
12152 type = cp_build_qualified_type (type, quals);
12153 /* Leave the SCOPE. */
12160 /* EXPR is an expression which is not type-dependent. Return a proxy
12161 for EXPR that can be used to compute the types of larger
12162 expressions containing EXPR. */
12165 build_non_dependent_expr (tree expr)
12169 /* Preserve null pointer constants so that the type of things like
12170 "p == 0" where "p" is a pointer can be determined. */
12171 if (null_ptr_cst_p (expr))
12173 /* Preserve OVERLOADs; the functions must be available to resolve
12175 inner_expr = (TREE_CODE (expr) == ADDR_EXPR ?
12176 TREE_OPERAND (expr, 0) : expr);
12177 if (TREE_CODE (inner_expr) == OVERLOAD
12178 || TREE_CODE (inner_expr) == FUNCTION_DECL
12179 || TREE_CODE (inner_expr) == TEMPLATE_DECL
12180 || TREE_CODE (inner_expr) == TEMPLATE_ID_EXPR)
12182 /* Preserve string constants; conversions from string constants to
12183 "char *" are allowed, even though normally a "const char *"
12184 cannot be used to initialize a "char *". */
12185 if (TREE_CODE (expr) == STRING_CST)
12187 /* Preserve arithmetic constants, as an optimization -- there is no
12188 reason to create a new node. */
12189 if (TREE_CODE (expr) == INTEGER_CST || TREE_CODE (expr) == REAL_CST)
12191 /* Preserve THROW_EXPRs -- all throw-expressions have type "void".
12192 There is at least one place where we want to know that a
12193 particular expression is a throw-expression: when checking a ?:
12194 expression, there are special rules if the second or third
12195 argument is a throw-expression. */
12196 if (TREE_CODE (expr) == THROW_EXPR)
12199 if (TREE_CODE (expr) == COND_EXPR)
12200 return build (COND_EXPR,
12202 TREE_OPERAND (expr, 0),
12203 (TREE_OPERAND (expr, 1)
12204 ? build_non_dependent_expr (TREE_OPERAND (expr, 1))
12205 : build_non_dependent_expr (TREE_OPERAND (expr, 0))),
12206 build_non_dependent_expr (TREE_OPERAND (expr, 2)));
12207 if (TREE_CODE (expr) == COMPOUND_EXPR
12208 && !COMPOUND_EXPR_OVERLOADED (expr))
12209 return build (COMPOUND_EXPR,
12211 TREE_OPERAND (expr, 0),
12212 build_non_dependent_expr (TREE_OPERAND (expr, 1)));
12214 /* Otherwise, build a NON_DEPENDENT_EXPR.
12216 REFERENCE_TYPEs are not stripped for expressions in templates
12217 because doing so would play havoc with mangling. Consider, for
12220 template <typename T> void f<T& g>() { g(); }
12222 In the body of "f", the expression for "g" will have
12223 REFERENCE_TYPE, even though the standard says that it should
12224 not. The reason is that we must preserve the syntactic form of
12225 the expression so that mangling (say) "f<g>" inside the body of
12226 "f" works out correctly. Therefore, the REFERENCE_TYPE is
12228 return build1 (NON_DEPENDENT_EXPR, non_reference (TREE_TYPE (expr)), expr);
12231 /* ARGS is a TREE_LIST of expressions as arguments to a function call.
12232 Return a new TREE_LIST with the various arguments replaced with
12233 equivalent non-dependent expressions. */
12236 build_non_dependent_args (tree args)
12241 new_args = NULL_TREE;
12242 for (a = args; a; a = TREE_CHAIN (a))
12243 new_args = tree_cons (NULL_TREE,
12244 build_non_dependent_expr (TREE_VALUE (a)),
12246 return nreverse (new_args);
12249 #include "gt-cp-pt.h"