1 /* Handle parameterized types (templates) for GNU C++.
2 Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
3 2001, 2002, 2003 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) = TREE_READONLY (decl) = 1;
379 DECL_INITIAL (decl) = DECL_INITIAL (parm);
380 SET_DECL_TEMPLATE_PARM_P (decl);
391 /* Restore the template parameter context for a member template or
392 a friend template defined in a class definition. */
395 maybe_begin_member_template_processing (tree decl)
400 if (inline_needs_template_parms (decl))
402 parms = DECL_TEMPLATE_PARMS (most_general_template (decl));
403 levels = TMPL_PARMS_DEPTH (parms) - processing_template_decl;
405 if (DECL_TEMPLATE_SPECIALIZATION (decl))
408 parms = TREE_CHAIN (parms);
411 push_inline_template_parms_recursive (parms, levels);
414 /* Remember how many levels of template parameters we pushed so that
415 we can pop them later. */
416 if (!inline_parm_levels)
417 VARRAY_INT_INIT (inline_parm_levels, 4, "inline_parm_levels");
418 if (inline_parm_levels_used == inline_parm_levels->num_elements)
419 VARRAY_GROW (inline_parm_levels, 2 * inline_parm_levels_used);
420 VARRAY_INT (inline_parm_levels, inline_parm_levels_used) = levels;
421 ++inline_parm_levels_used;
424 /* Undo the effects of begin_member_template_processing. */
427 maybe_end_member_template_processing (void)
431 if (!inline_parm_levels_used)
434 --inline_parm_levels_used;
436 i < VARRAY_INT (inline_parm_levels, inline_parm_levels_used);
439 --processing_template_decl;
440 current_template_parms = TREE_CHAIN (current_template_parms);
445 /* Returns nonzero iff T is a member template function. We must be
448 template <class T> class C { void f(); }
450 Here, f is a template function, and a member, but not a member
451 template. This function does not concern itself with the origin of
452 T, only its present state. So if we have
454 template <class T> class C { template <class U> void f(U); }
456 then neither C<int>::f<char> nor C<T>::f<double> is considered
457 to be a member template. But, `template <class U> void
458 C<int>::f(U)' is considered a member template. */
461 is_member_template (tree t)
463 if (!DECL_FUNCTION_TEMPLATE_P (t))
464 /* Anything that isn't a function or a template function is
465 certainly not a member template. */
468 /* A local class can't have member templates. */
469 if (decl_function_context (t))
472 return (DECL_FUNCTION_MEMBER_P (DECL_TEMPLATE_RESULT (t))
473 /* If there are more levels of template parameters than
474 there are template classes surrounding the declaration,
475 then we have a member template. */
476 && (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (t)) >
477 template_class_depth (DECL_CONTEXT (t))));
481 /* Returns nonzero iff T is a member template class. See
482 is_member_template for a description of what precisely constitutes
483 a member template. */
486 is_member_template_class (tree t)
488 if (!DECL_CLASS_TEMPLATE_P (t))
489 /* Anything that isn't a class template, is certainly not a member
493 if (!DECL_CLASS_SCOPE_P (t))
494 /* Anything whose context isn't a class type is surely not a
498 /* If there are more levels of template parameters than there are
499 template classes surrounding the declaration, then we have a
501 return (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (t)) >
502 template_class_depth (DECL_CONTEXT (t)));
506 /* Return a new template argument vector which contains all of ARGS,
507 but has as its innermost set of arguments the EXTRA_ARGS. */
510 add_to_template_args (tree args, tree extra_args)
517 extra_depth = TMPL_ARGS_DEPTH (extra_args);
518 new_args = make_tree_vec (TMPL_ARGS_DEPTH (args) + extra_depth);
520 for (i = 1; i <= TMPL_ARGS_DEPTH (args); ++i)
521 SET_TMPL_ARGS_LEVEL (new_args, i, TMPL_ARGS_LEVEL (args, i));
523 for (j = 1; j <= extra_depth; ++j, ++i)
524 SET_TMPL_ARGS_LEVEL (new_args, i, TMPL_ARGS_LEVEL (extra_args, j));
529 /* Like add_to_template_args, but only the outermost ARGS are added to
530 the EXTRA_ARGS. In particular, all but TMPL_ARGS_DEPTH
531 (EXTRA_ARGS) levels are added. This function is used to combine
532 the template arguments from a partial instantiation with the
533 template arguments used to attain the full instantiation from the
534 partial instantiation. */
537 add_outermost_template_args (tree args, tree extra_args)
541 /* If there are more levels of EXTRA_ARGS than there are ARGS,
542 something very fishy is going on. */
543 my_friendly_assert (TMPL_ARGS_DEPTH (args) >= TMPL_ARGS_DEPTH (extra_args),
546 /* If *all* the new arguments will be the EXTRA_ARGS, just return
548 if (TMPL_ARGS_DEPTH (args) == TMPL_ARGS_DEPTH (extra_args))
551 /* For the moment, we make ARGS look like it contains fewer levels. */
552 TREE_VEC_LENGTH (args) -= TMPL_ARGS_DEPTH (extra_args);
554 new_args = add_to_template_args (args, extra_args);
556 /* Now, we restore ARGS to its full dimensions. */
557 TREE_VEC_LENGTH (args) += TMPL_ARGS_DEPTH (extra_args);
562 /* Return the N levels of innermost template arguments from the ARGS. */
565 get_innermost_template_args (tree args, int n)
571 my_friendly_assert (n >= 0, 20000603);
573 /* If N is 1, just return the innermost set of template arguments. */
575 return TMPL_ARGS_LEVEL (args, TMPL_ARGS_DEPTH (args));
577 /* If we're not removing anything, just return the arguments we were
579 extra_levels = TMPL_ARGS_DEPTH (args) - n;
580 my_friendly_assert (extra_levels >= 0, 20000603);
581 if (extra_levels == 0)
584 /* Make a new set of arguments, not containing the outer arguments. */
585 new_args = make_tree_vec (n);
586 for (i = 1; i <= n; ++i)
587 SET_TMPL_ARGS_LEVEL (new_args, i,
588 TMPL_ARGS_LEVEL (args, i + extra_levels));
593 /* We've got a template header coming up; push to a new level for storing
597 begin_template_parm_list (void)
599 /* We use a non-tag-transparent scope here, which causes pushtag to
600 put tags in this scope, rather than in the enclosing class or
601 namespace scope. This is the right thing, since we want
602 TEMPLATE_DECLS, and not TYPE_DECLS for template classes. For a
603 global template class, push_template_decl handles putting the
604 TEMPLATE_DECL into top-level scope. For a nested template class,
607 template <class T> struct S1 {
608 template <class T> struct S2 {};
611 pushtag contains special code to call pushdecl_with_scope on the
612 TEMPLATE_DECL for S2. */
613 begin_scope (sk_template_parms, NULL);
614 ++processing_template_decl;
615 ++processing_template_parmlist;
616 note_template_header (0);
619 /* This routine is called when a specialization is declared. If it is
620 invalid to declare a specialization here, an error is reported. */
623 check_specialization_scope (void)
625 tree scope = current_scope ();
629 An explicit specialization shall be declared in the namespace of
630 which the template is a member, or, for member templates, in the
631 namespace of which the enclosing class or enclosing class
632 template is a member. An explicit specialization of a member
633 function, member class or static data member of a class template
634 shall be declared in the namespace of which the class template
636 if (scope && TREE_CODE (scope) != NAMESPACE_DECL)
637 error ("explicit specialization in non-namespace scope `%D'",
642 In an explicit specialization declaration for a member of a class
643 template or a member template that appears in namespace scope,
644 the member template and some of its enclosing class templates may
645 remain unspecialized, except that the declaration shall not
646 explicitly specialize a class member template if its enclosing
647 class templates are not explicitly specialized as well. */
648 if (current_template_parms)
649 error ("enclosing class templates are not explicitly specialized");
652 /* We've just seen template <>. */
655 begin_specialization (void)
657 begin_scope (sk_template_spec, NULL);
658 note_template_header (1);
659 check_specialization_scope ();
662 /* Called at then end of processing a declaration preceded by
666 end_specialization (void)
669 reset_specialization ();
672 /* Any template <>'s that we have seen thus far are not referring to a
673 function specialization. */
676 reset_specialization (void)
678 processing_specialization = 0;
679 template_header_count = 0;
682 /* We've just seen a template header. If SPECIALIZATION is nonzero,
683 it was of the form template <>. */
686 note_template_header (int specialization)
688 processing_specialization = specialization;
689 template_header_count++;
692 /* We're beginning an explicit instantiation. */
695 begin_explicit_instantiation (void)
697 my_friendly_assert (!processing_explicit_instantiation, 20020913);
698 processing_explicit_instantiation = true;
703 end_explicit_instantiation (void)
705 my_friendly_assert(processing_explicit_instantiation, 20020913);
706 processing_explicit_instantiation = false;
709 /* The TYPE is being declared. If it is a template type, that means it
710 is a partial specialization. Do appropriate error-checking. */
713 maybe_process_partial_specialization (tree type)
715 /* TYPE maybe an ERROR_MARK_NODE. */
716 tree context = TYPE_P (type) ? TYPE_CONTEXT (type) : NULL_TREE;
718 if (CLASS_TYPE_P (type) && CLASSTYPE_USE_TEMPLATE (type))
720 /* This is for ordinary explicit specialization and partial
721 specialization of a template class such as:
723 template <> class C<int>;
727 template <class T> class C<T*>;
729 Make sure that `C<int>' and `C<T*>' are implicit instantiations. */
731 if (CLASSTYPE_IMPLICIT_INSTANTIATION (type)
732 && !COMPLETE_TYPE_P (type))
734 tree tpl_ns = decl_namespace_context (CLASSTYPE_TI_TEMPLATE (type));
735 if (is_associated_namespace (current_namespace, tpl_ns))
736 /* Same or super-using namespace. */;
739 pedwarn ("specializing `%#T' in different namespace", type);
740 cp_pedwarn_at (" from definition of `%#D'",
741 CLASSTYPE_TI_TEMPLATE (type));
743 SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (type);
744 if (processing_template_decl)
745 push_template_decl (TYPE_MAIN_DECL (type));
747 else if (CLASSTYPE_TEMPLATE_INSTANTIATION (type))
748 error ("specialization of `%T' after instantiation", type);
750 else if (CLASS_TYPE_P (type)
751 && !CLASSTYPE_USE_TEMPLATE (type)
752 && CLASSTYPE_TEMPLATE_INFO (type)
753 && context && CLASS_TYPE_P (context)
754 && CLASSTYPE_TEMPLATE_INFO (context))
756 /* This is for an explicit specialization of member class
757 template according to [temp.expl.spec/18]:
759 template <> template <class U> class C<int>::D;
761 The context `C<int>' must be an implicit instantiation.
762 Otherwise this is just a member class template declared
765 template <> class C<int> { template <class U> class D; };
766 template <> template <class U> class C<int>::D;
768 In the first case, `C<int>::D' is a specialization of `C<T>::D'
769 while in the second case, `C<int>::D' is a primary template
770 and `C<T>::D' may not exist. */
772 if (CLASSTYPE_IMPLICIT_INSTANTIATION (context)
773 && !COMPLETE_TYPE_P (type))
777 if (current_namespace
778 != decl_namespace_context (CLASSTYPE_TI_TEMPLATE (type)))
780 pedwarn ("specializing `%#T' in different namespace", type);
781 cp_pedwarn_at (" from definition of `%#D'",
782 CLASSTYPE_TI_TEMPLATE (type));
785 /* Check for invalid specialization after instantiation:
787 template <> template <> class C<int>::D<int>;
788 template <> template <class U> class C<int>::D; */
790 for (t = DECL_TEMPLATE_INSTANTIATIONS
791 (most_general_template (CLASSTYPE_TI_TEMPLATE (type)));
792 t; t = TREE_CHAIN (t))
793 if (TREE_VALUE (t) != type
794 && TYPE_CONTEXT (TREE_VALUE (t)) == context)
795 error ("specialization `%T' after instantiation `%T'",
796 type, TREE_VALUE (t));
798 /* Mark TYPE as a specialization. And as a result, we only
799 have one level of template argument for the innermost
801 SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (type);
802 CLASSTYPE_TI_ARGS (type)
803 = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type));
806 else if (processing_specialization)
807 error ("explicit specialization of non-template `%T'", type);
810 /* Retrieve the specialization (in the sense of [temp.spec] - a
811 specialization is either an instantiation or an explicit
812 specialization) of TMPL for the given template ARGS. If there is
813 no such specialization, return NULL_TREE. The ARGS are a vector of
814 arguments, or a vector of vectors of arguments, in the case of
815 templates with more than one level of parameters. */
818 retrieve_specialization (tree tmpl, tree args)
822 my_friendly_assert (TREE_CODE (tmpl) == TEMPLATE_DECL, 0);
824 /* There should be as many levels of arguments as there are
825 levels of parameters. */
826 my_friendly_assert (TMPL_ARGS_DEPTH (args)
827 == TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl)),
830 for (s = DECL_TEMPLATE_SPECIALIZATIONS (tmpl);
833 if (comp_template_args (TREE_PURPOSE (s), args))
834 return TREE_VALUE (s);
839 /* Like retrieve_specialization, but for local declarations. */
842 retrieve_local_specialization (tree tmpl)
844 tree spec = htab_find_with_hash (local_specializations, tmpl,
845 htab_hash_pointer (tmpl));
846 return spec ? TREE_PURPOSE (spec) : NULL_TREE;
849 /* Returns nonzero iff DECL is a specialization of TMPL. */
852 is_specialization_of (tree decl, tree tmpl)
856 if (TREE_CODE (decl) == FUNCTION_DECL)
860 t = DECL_TEMPLATE_INFO (t) ? DECL_TI_TEMPLATE (t) : NULL_TREE)
866 my_friendly_assert (TREE_CODE (decl) == TYPE_DECL, 0);
868 for (t = TREE_TYPE (decl);
870 t = CLASSTYPE_USE_TEMPLATE (t)
871 ? TREE_TYPE (CLASSTYPE_TI_TEMPLATE (t)) : NULL_TREE)
872 if (same_type_ignoring_top_level_qualifiers_p (t, TREE_TYPE (tmpl)))
879 /* Returns nonzero iff DECL is a specialization of friend declaration
880 FRIEND according to [temp.friend]. */
883 is_specialization_of_friend (tree decl, tree friend)
885 bool need_template = true;
888 my_friendly_assert (TREE_CODE (decl) == FUNCTION_DECL, 0);
890 /* For [temp.friend/6] when FRIEND is an ordinary member function
891 of a template class, we want to check if DECL is a specialization
893 if (TREE_CODE (friend) == FUNCTION_DECL
894 && DECL_TEMPLATE_INFO (friend)
895 && !DECL_USE_TEMPLATE (friend))
897 friend = DECL_TI_TEMPLATE (friend);
898 need_template = false;
901 /* There is nothing to do if this is not a template friend. */
902 if (TREE_CODE (friend) != TEMPLATE_DECL)
905 if (is_specialization_of (decl, friend))
909 A member of a class template may be declared to be a friend of a
910 non-template class. In this case, the corresponding member of
911 every specialization of the class template is a friend of the
912 class granting friendship.
914 For example, given a template friend declaration
916 template <class T> friend void A<T>::f();
918 the member function below is considered a friend
920 template <> struct A<int> {
924 For this type of template friend, TEMPLATE_DEPTH below will be
925 non-zero. To determine if DECL is a friend of FRIEND, we first
926 check if the enclosing class is a specialization of another. */
928 template_depth = template_class_depth (DECL_CONTEXT (friend));
930 && DECL_CLASS_SCOPE_P (decl)
931 && is_specialization_of (TYPE_NAME (DECL_CONTEXT (decl)),
932 CLASSTYPE_TI_TEMPLATE (DECL_CONTEXT (friend))))
934 /* Next, we check the members themselves. In order to handle
935 a few tricky cases like
937 template <class T> friend void A<T>::g(T t);
938 template <class T> template <T t> friend void A<T>::h();
940 we need to figure out what ARGS is (corresponding to `T' in above
941 examples) from DECL for later processing. */
943 tree context = DECL_CONTEXT (decl);
944 tree args = NULL_TREE;
945 int current_depth = 0;
946 while (current_depth < template_depth)
948 if (CLASSTYPE_TEMPLATE_INFO (context))
950 if (current_depth == 0)
951 args = TYPE_TI_ARGS (context);
953 args = add_to_template_args (TYPE_TI_ARGS (context), args);
956 context = TYPE_CONTEXT (context);
959 if (TREE_CODE (decl) == FUNCTION_DECL)
964 tree friend_args_type;
967 /* Make sure that both DECL and FRIEND are templates or
969 is_template = DECL_TEMPLATE_INFO (decl)
970 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl));
971 if (need_template ^ is_template)
973 else if (is_template)
975 /* If both are templates, check template paramter list. */
977 = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend),
979 if (!comp_template_parms
980 (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (decl)),
984 decl_type = TREE_TYPE (DECL_TI_TEMPLATE (decl));
987 decl_type = TREE_TYPE (decl);
989 friend_type = tsubst_function_type (TREE_TYPE (friend), args,
991 if (friend_type == error_mark_node)
994 /* Check if return types match. */
995 if (!same_type_p (TREE_TYPE (decl_type), TREE_TYPE (friend_type)))
998 /* Check if function parameter types match, ignoring the
1000 friend_args_type = TYPE_ARG_TYPES (friend_type);
1001 decl_args_type = TYPE_ARG_TYPES (decl_type);
1002 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (friend))
1003 friend_args_type = TREE_CHAIN (friend_args_type);
1004 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl))
1005 decl_args_type = TREE_CHAIN (decl_args_type);
1006 if (compparms (decl_args_type, friend_args_type))
1013 /* Register the specialization SPEC as a specialization of TMPL with
1014 the indicated ARGS. Returns SPEC, or an equivalent prior
1015 declaration, if available. */
1018 register_specialization (tree spec, tree tmpl, tree args)
1022 my_friendly_assert (TREE_CODE (tmpl) == TEMPLATE_DECL, 0);
1024 if (TREE_CODE (spec) == FUNCTION_DECL
1025 && uses_template_parms (DECL_TI_ARGS (spec)))
1026 /* This is the FUNCTION_DECL for a partial instantiation. Don't
1027 register it; we want the corresponding TEMPLATE_DECL instead.
1028 We use `uses_template_parms (DECL_TI_ARGS (spec))' rather than
1029 the more obvious `uses_template_parms (spec)' to avoid problems
1030 with default function arguments. In particular, given
1031 something like this:
1033 template <class T> void f(T t1, T t = T())
1035 the default argument expression is not substituted for in an
1036 instantiation unless and until it is actually needed. */
1039 /* There should be as many levels of arguments as there are
1040 levels of parameters. */
1041 my_friendly_assert (TMPL_ARGS_DEPTH (args)
1042 == TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl)),
1045 for (s = DECL_TEMPLATE_SPECIALIZATIONS (tmpl);
1049 tree fn = TREE_VALUE (s);
1051 /* We can sometimes try to re-register a specialization that we've
1052 already got. In particular, regenerate_decl_from_template
1053 calls duplicate_decls which will update the specialization
1054 list. But, we'll still get called again here anyhow. It's
1055 more convenient to simply allow this than to try to prevent it. */
1058 else if (comp_template_args (TREE_PURPOSE (s), args))
1060 if (DECL_TEMPLATE_SPECIALIZATION (spec))
1062 if (DECL_TEMPLATE_INSTANTIATION (fn))
1065 || DECL_EXPLICIT_INSTANTIATION (fn))
1067 error ("specialization of %D after instantiation",
1073 /* This situation should occur only if the first
1074 specialization is an implicit instantiation,
1075 the second is an explicit specialization, and
1076 the implicit instantiation has not yet been
1077 used. That situation can occur if we have
1078 implicitly instantiated a member function and
1079 then specialized it later.
1081 We can also wind up here if a friend
1082 declaration that looked like an instantiation
1083 turns out to be a specialization:
1085 template <class T> void foo(T);
1086 class S { friend void foo<>(int) };
1087 template <> void foo(int);
1089 We transform the existing DECL in place so that
1090 any pointers to it become pointers to the
1091 updated declaration.
1093 If there was a definition for the template, but
1094 not for the specialization, we want this to
1095 look as if there is no definition, and vice
1097 DECL_INITIAL (fn) = NULL_TREE;
1098 duplicate_decls (spec, fn);
1103 else if (DECL_TEMPLATE_SPECIALIZATION (fn))
1105 if (!duplicate_decls (spec, fn) && DECL_INITIAL (spec))
1106 /* Dup decl failed, but this is a new
1107 definition. Set the line number so any errors
1108 match this new definition. */
1109 DECL_SOURCE_LOCATION (fn) = DECL_SOURCE_LOCATION (spec);
1117 DECL_TEMPLATE_SPECIALIZATIONS (tmpl)
1118 = tree_cons (args, spec, DECL_TEMPLATE_SPECIALIZATIONS (tmpl));
1123 /* Unregister the specialization SPEC as a specialization of TMPL.
1124 Replace it with NEW_SPEC, if NEW_SPEC is non-NULL. Returns true
1125 if the SPEC was listed as a specialization of TMPL. */
1128 reregister_specialization (tree spec, tree tmpl, tree new_spec)
1132 for (s = &DECL_TEMPLATE_SPECIALIZATIONS (tmpl);
1134 s = &TREE_CHAIN (*s))
1135 if (TREE_VALUE (*s) == spec)
1138 *s = TREE_CHAIN (*s);
1140 TREE_VALUE (*s) = new_spec;
1147 /* Compare an entry in the local specializations hash table P1 (which
1148 is really a pointer to a TREE_LIST) with P2 (which is really a
1152 eq_local_specializations (const void *p1, const void *p2)
1154 return TREE_VALUE ((tree) p1) == (tree) p2;
1157 /* Hash P1, an entry in the local specializations table. */
1160 hash_local_specialization (const void* p1)
1162 return htab_hash_pointer (TREE_VALUE ((tree) p1));
1165 /* Like register_specialization, but for local declarations. We are
1166 registering SPEC, an instantiation of TMPL. */
1169 register_local_specialization (tree spec, tree tmpl)
1173 slot = htab_find_slot_with_hash (local_specializations, tmpl,
1174 htab_hash_pointer (tmpl), INSERT);
1175 *slot = build_tree_list (spec, tmpl);
1178 /* Print the list of candidate FNS in an error message. */
1181 print_candidates (tree fns)
1185 const char *str = "candidates are:";
1187 for (fn = fns; fn != NULL_TREE; fn = TREE_CHAIN (fn))
1191 for (f = TREE_VALUE (fn); f; f = OVL_NEXT (f))
1192 cp_error_at ("%s %+#D", str, OVL_CURRENT (f));
1197 /* Returns the template (one of the functions given by TEMPLATE_ID)
1198 which can be specialized to match the indicated DECL with the
1199 explicit template args given in TEMPLATE_ID. The DECL may be
1200 NULL_TREE if none is available. In that case, the functions in
1201 TEMPLATE_ID are non-members.
1203 If NEED_MEMBER_TEMPLATE is nonzero the function is known to be a
1204 specialization of a member template.
1206 The template args (those explicitly specified and those deduced)
1207 are output in a newly created vector *TARGS_OUT.
1209 If it is impossible to determine the result, an error message is
1210 issued. The error_mark_node is returned to indicate failure. */
1213 determine_specialization (tree template_id,
1216 int need_member_template)
1220 tree explicit_targs;
1221 tree candidates = NULL_TREE;
1222 tree templates = NULL_TREE;
1224 *targs_out = NULL_TREE;
1226 if (template_id == error_mark_node)
1227 return error_mark_node;
1229 fns = TREE_OPERAND (template_id, 0);
1230 explicit_targs = TREE_OPERAND (template_id, 1);
1232 if (fns == error_mark_node)
1233 return error_mark_node;
1235 /* Check for baselinks. */
1236 if (BASELINK_P (fns))
1237 fns = BASELINK_FUNCTIONS (fns);
1239 if (!is_overloaded_fn (fns))
1241 error ("`%D' is not a function template", fns);
1242 return error_mark_node;
1245 for (; fns; fns = OVL_NEXT (fns))
1247 tree fn = OVL_CURRENT (fns);
1249 if (TREE_CODE (fn) == TEMPLATE_DECL)
1251 tree decl_arg_types;
1253 /* DECL might be a specialization of FN. */
1255 /* Adjust the type of DECL in case FN is a static member. */
1256 decl_arg_types = TYPE_ARG_TYPES (TREE_TYPE (decl));
1257 if (DECL_STATIC_FUNCTION_P (fn)
1258 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl))
1259 decl_arg_types = TREE_CHAIN (decl_arg_types);
1261 /* Check that the number of function parameters matches.
1263 template <class T> void f(int i = 0);
1264 template <> void f<int>();
1265 The specialization f<int> is invalid but is not caught
1266 by get_bindings below. */
1268 if (list_length (TYPE_ARG_TYPES (TREE_TYPE (fn)))
1269 != list_length (decl_arg_types))
1272 /* See whether this function might be a specialization of this
1274 targs = get_bindings (fn, decl, explicit_targs);
1277 /* We cannot deduce template arguments that when used to
1278 specialize TMPL will produce DECL. */
1281 /* Save this template, and the arguments deduced. */
1282 templates = tree_cons (targs, fn, templates);
1284 else if (need_member_template)
1285 /* FN is an ordinary member function, and we need a
1286 specialization of a member template. */
1288 else if (TREE_CODE (fn) != FUNCTION_DECL)
1289 /* We can get IDENTIFIER_NODEs here in certain erroneous
1292 else if (!DECL_FUNCTION_MEMBER_P (fn))
1293 /* This is just an ordinary non-member function. Nothing can
1294 be a specialization of that. */
1296 else if (DECL_ARTIFICIAL (fn))
1297 /* Cannot specialize functions that are created implicitly. */
1301 tree decl_arg_types;
1303 /* This is an ordinary member function. However, since
1304 we're here, we can assume it's enclosing class is a
1305 template class. For example,
1307 template <typename T> struct S { void f(); };
1308 template <> void S<int>::f() {}
1310 Here, S<int>::f is a non-template, but S<int> is a
1311 template class. If FN has the same type as DECL, we
1312 might be in business. */
1314 if (!DECL_TEMPLATE_INFO (fn))
1315 /* Its enclosing class is an explicit specialization
1316 of a template class. This is not a candidate. */
1319 if (!same_type_p (TREE_TYPE (TREE_TYPE (decl)),
1320 TREE_TYPE (TREE_TYPE (fn))))
1321 /* The return types differ. */
1324 /* Adjust the type of DECL in case FN is a static member. */
1325 decl_arg_types = TYPE_ARG_TYPES (TREE_TYPE (decl));
1326 if (DECL_STATIC_FUNCTION_P (fn)
1327 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl))
1328 decl_arg_types = TREE_CHAIN (decl_arg_types);
1330 if (compparms (TYPE_ARG_TYPES (TREE_TYPE (fn)),
1333 candidates = tree_cons (NULL_TREE, fn, candidates);
1337 if (templates && TREE_CHAIN (templates))
1343 It is possible for a specialization with a given function
1344 signature to be instantiated from more than one function
1345 template. In such cases, explicit specification of the
1346 template arguments must be used to uniquely identify the
1347 function template specialization being specialized.
1349 Note that here, there's no suggestion that we're supposed to
1350 determine which of the candidate templates is most
1351 specialized. However, we, also have:
1355 Partial ordering of overloaded function template
1356 declarations is used in the following contexts to select
1357 the function template to which a function template
1358 specialization refers:
1360 -- when an explicit specialization refers to a function
1363 So, we do use the partial ordering rules, at least for now.
1364 This extension can only serve to make invalid programs valid,
1365 so it's safe. And, there is strong anecdotal evidence that
1366 the committee intended the partial ordering rules to apply;
1367 the EDG front-end has that behavior, and John Spicer claims
1368 that the committee simply forgot to delete the wording in
1369 [temp.expl.spec]. */
1370 tree tmpl = most_specialized (templates, decl, explicit_targs);
1371 if (tmpl && tmpl != error_mark_node)
1373 targs = get_bindings (tmpl, decl, explicit_targs);
1374 templates = tree_cons (targs, tmpl, NULL_TREE);
1378 if (templates == NULL_TREE && candidates == NULL_TREE)
1380 cp_error_at ("template-id `%D' for `%+D' does not match any template declaration",
1382 return error_mark_node;
1384 else if ((templates && TREE_CHAIN (templates))
1385 || (candidates && TREE_CHAIN (candidates))
1386 || (templates && candidates))
1388 cp_error_at ("ambiguous template specialization `%D' for `%+D'",
1390 chainon (candidates, templates);
1391 print_candidates (candidates);
1392 return error_mark_node;
1395 /* We have one, and exactly one, match. */
1398 /* It was a specialization of an ordinary member function in a
1400 *targs_out = copy_node (DECL_TI_ARGS (TREE_VALUE (candidates)));
1401 return DECL_TI_TEMPLATE (TREE_VALUE (candidates));
1404 /* It was a specialization of a template. */
1405 targs = DECL_TI_ARGS (DECL_TEMPLATE_RESULT (TREE_VALUE (templates)));
1406 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (targs))
1408 *targs_out = copy_node (targs);
1409 SET_TMPL_ARGS_LEVEL (*targs_out,
1410 TMPL_ARGS_DEPTH (*targs_out),
1411 TREE_PURPOSE (templates));
1414 *targs_out = TREE_PURPOSE (templates);
1415 return TREE_VALUE (templates);
1418 /* Returns a chain of parameter types, exactly like the SPEC_TYPES,
1419 but with the default argument values filled in from those in the
1423 copy_default_args_to_explicit_spec_1 (tree spec_types,
1426 tree new_spec_types;
1431 if (spec_types == void_list_node)
1432 return void_list_node;
1434 /* Substitute into the rest of the list. */
1436 copy_default_args_to_explicit_spec_1 (TREE_CHAIN (spec_types),
1437 TREE_CHAIN (tmpl_types));
1439 /* Add the default argument for this parameter. */
1440 return hash_tree_cons (TREE_PURPOSE (tmpl_types),
1441 TREE_VALUE (spec_types),
1445 /* DECL is an explicit specialization. Replicate default arguments
1446 from the template it specializes. (That way, code like:
1448 template <class T> void f(T = 3);
1449 template <> void f(double);
1452 works, as required.) An alternative approach would be to look up
1453 the correct default arguments at the call-site, but this approach
1454 is consistent with how implicit instantiations are handled. */
1457 copy_default_args_to_explicit_spec (tree decl)
1462 tree new_spec_types;
1466 tree object_type = NULL_TREE;
1467 tree in_charge = NULL_TREE;
1468 tree vtt = NULL_TREE;
1470 /* See if there's anything we need to do. */
1471 tmpl = DECL_TI_TEMPLATE (decl);
1472 tmpl_types = TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (tmpl)));
1473 for (t = tmpl_types; t; t = TREE_CHAIN (t))
1474 if (TREE_PURPOSE (t))
1479 old_type = TREE_TYPE (decl);
1480 spec_types = TYPE_ARG_TYPES (old_type);
1482 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl))
1484 /* Remove the this pointer, but remember the object's type for
1486 object_type = TREE_TYPE (TREE_VALUE (spec_types));
1487 spec_types = TREE_CHAIN (spec_types);
1488 tmpl_types = TREE_CHAIN (tmpl_types);
1490 if (DECL_HAS_IN_CHARGE_PARM_P (decl))
1492 /* DECL may contain more parameters than TMPL due to the extra
1493 in-charge parameter in constructors and destructors. */
1494 in_charge = spec_types;
1495 spec_types = TREE_CHAIN (spec_types);
1497 if (DECL_HAS_VTT_PARM_P (decl))
1500 spec_types = TREE_CHAIN (spec_types);
1504 /* Compute the merged default arguments. */
1506 copy_default_args_to_explicit_spec_1 (spec_types, tmpl_types);
1508 /* Compute the new FUNCTION_TYPE. */
1512 new_spec_types = hash_tree_cons (TREE_PURPOSE (vtt),
1517 /* Put the in-charge parameter back. */
1518 new_spec_types = hash_tree_cons (TREE_PURPOSE (in_charge),
1519 TREE_VALUE (in_charge),
1522 new_type = build_method_type_directly (object_type,
1523 TREE_TYPE (old_type),
1527 new_type = build_function_type (TREE_TYPE (old_type),
1529 new_type = build_type_attribute_variant (new_type,
1530 TYPE_ATTRIBUTES (old_type));
1531 new_type = build_exception_variant (new_type,
1532 TYPE_RAISES_EXCEPTIONS (old_type));
1533 TREE_TYPE (decl) = new_type;
1536 /* Check to see if the function just declared, as indicated in
1537 DECLARATOR, and in DECL, is a specialization of a function
1538 template. We may also discover that the declaration is an explicit
1539 instantiation at this point.
1541 Returns DECL, or an equivalent declaration that should be used
1542 instead if all goes well. Issues an error message if something is
1543 amiss. Returns error_mark_node if the error is not easily
1546 FLAGS is a bitmask consisting of the following flags:
1548 2: The function has a definition.
1549 4: The function is a friend.
1551 The TEMPLATE_COUNT is the number of references to qualifying
1552 template classes that appeared in the name of the function. For
1555 template <class T> struct S { void f(); };
1558 the TEMPLATE_COUNT would be 1. However, explicitly specialized
1559 classes are not counted in the TEMPLATE_COUNT, so that in
1561 template <class T> struct S {};
1562 template <> struct S<int> { void f(); }
1563 template <> void S<int>::f();
1565 the TEMPLATE_COUNT would be 0. (Note that this declaration is
1566 invalid; there should be no template <>.)
1568 If the function is a specialization, it is marked as such via
1569 DECL_TEMPLATE_SPECIALIZATION. Furthermore, its DECL_TEMPLATE_INFO
1570 is set up correctly, and it is added to the list of specializations
1571 for that template. */
1574 check_explicit_specialization (tree declarator,
1579 int have_def = flags & 2;
1580 int is_friend = flags & 4;
1581 int specialization = 0;
1582 int explicit_instantiation = 0;
1583 int member_specialization = 0;
1584 tree ctype = DECL_CLASS_CONTEXT (decl);
1585 tree dname = DECL_NAME (decl);
1588 tsk = current_tmpl_spec_kind (template_count);
1593 if (processing_specialization)
1596 SET_DECL_TEMPLATE_SPECIALIZATION (decl);
1598 else if (TREE_CODE (declarator) == TEMPLATE_ID_EXPR)
1601 /* This could be something like:
1603 template <class T> void f(T);
1604 class S { friend void f<>(int); } */
1608 /* This case handles bogus declarations like template <>
1609 template <class T> void f<int>(); */
1611 error ("template-id `%D' in declaration of primary template",
1618 case tsk_invalid_member_spec:
1619 /* The error has already been reported in
1620 check_specialization_scope. */
1621 return error_mark_node;
1623 case tsk_invalid_expl_inst:
1624 error ("template parameter list used in explicit instantiation");
1630 error ("definition provided for explicit instantiation");
1632 explicit_instantiation = 1;
1635 case tsk_excessive_parms:
1636 error ("too many template parameter lists in declaration of `%D'",
1638 return error_mark_node;
1642 SET_DECL_TEMPLATE_SPECIALIZATION (decl);
1644 member_specialization = 1;
1649 case tsk_insufficient_parms:
1650 if (template_header_count)
1652 error("too few template parameter lists in declaration of `%D'",
1656 else if (ctype != NULL_TREE
1657 && !TYPE_BEING_DEFINED (ctype)
1658 && CLASSTYPE_TEMPLATE_INSTANTIATION (ctype)
1661 /* For backwards compatibility, we accept:
1663 template <class T> struct S { void f(); };
1664 void S<int>::f() {} // Missing template <>
1666 That used to be valid C++. */
1669 ("explicit specialization not preceded by `template <>'");
1671 SET_DECL_TEMPLATE_SPECIALIZATION (decl);
1676 if (TREE_CODE (declarator) == TEMPLATE_ID_EXPR)
1678 /* This case handles bogus declarations like template <>
1679 template <class T> void f<int>(); */
1681 if (uses_template_parms (declarator))
1682 error ("partial specialization `%D' of function template",
1685 error ("template-id `%D' in declaration of primary template",
1690 if (ctype && CLASSTYPE_TEMPLATE_INSTANTIATION (ctype))
1691 /* This is a specialization of a member template, without
1692 specialization the containing class. Something like:
1694 template <class T> struct S {
1695 template <class U> void f (U);
1697 template <> template <class U> void S<int>::f(U) {}
1699 That's a specialization -- but of the entire template. */
1707 if (specialization || member_specialization)
1709 tree t = TYPE_ARG_TYPES (TREE_TYPE (decl));
1710 for (; t; t = TREE_CHAIN (t))
1711 if (TREE_PURPOSE (t))
1714 ("default argument specified in explicit specialization");
1717 if (current_lang_name == lang_name_c)
1718 error ("template specialization with C linkage");
1721 if (specialization || member_specialization || explicit_instantiation)
1723 tree tmpl = NULL_TREE;
1724 tree targs = NULL_TREE;
1726 /* Make sure that the declarator is a TEMPLATE_ID_EXPR. */
1727 if (TREE_CODE (declarator) != TEMPLATE_ID_EXPR)
1731 my_friendly_assert (TREE_CODE (declarator) == IDENTIFIER_NODE, 0);
1736 /* If there is no class context, the explicit instantiation
1737 must be at namespace scope. */
1738 my_friendly_assert (DECL_NAMESPACE_SCOPE_P (decl), 20030625);
1740 /* Find the namespace binding, using the declaration
1742 fns = namespace_binding (dname, CP_DECL_CONTEXT (decl));
1745 declarator = lookup_template_function (fns, NULL_TREE);
1748 if (declarator == error_mark_node)
1749 return error_mark_node;
1751 if (ctype != NULL_TREE && TYPE_BEING_DEFINED (ctype))
1753 if (!explicit_instantiation)
1754 /* A specialization in class scope. This is invalid,
1755 but the error will already have been flagged by
1756 check_specialization_scope. */
1757 return error_mark_node;
1760 /* It's not valid to write an explicit instantiation in
1763 class C { template void f(); }
1765 This case is caught by the parser. However, on
1768 template class C { void f(); };
1770 (which is invalid) we can get here. The error will be
1777 else if (ctype != NULL_TREE
1778 && (TREE_CODE (TREE_OPERAND (declarator, 0)) ==
1781 /* Find the list of functions in ctype that have the same
1782 name as the declared function. */
1783 tree name = TREE_OPERAND (declarator, 0);
1784 tree fns = NULL_TREE;
1787 if (constructor_name_p (name, ctype))
1789 int is_constructor = DECL_CONSTRUCTOR_P (decl);
1791 if (is_constructor ? !TYPE_HAS_CONSTRUCTOR (ctype)
1792 : !TYPE_HAS_DESTRUCTOR (ctype))
1794 /* From [temp.expl.spec]:
1796 If such an explicit specialization for the member
1797 of a class template names an implicitly-declared
1798 special member function (clause _special_), the
1799 program is ill-formed.
1801 Similar language is found in [temp.explicit]. */
1802 error ("specialization of implicitly-declared special member function");
1803 return error_mark_node;
1806 name = is_constructor ? ctor_identifier : dtor_identifier;
1809 if (!DECL_CONV_FN_P (decl))
1811 idx = lookup_fnfields_1 (ctype, name);
1813 fns = TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (ctype), idx);
1819 /* For a type-conversion operator, we cannot do a
1820 name-based lookup. We might be looking for `operator
1821 int' which will be a specialization of `operator T'.
1822 So, we find *all* the conversion operators, and then
1823 select from them. */
1826 methods = CLASSTYPE_METHOD_VEC (ctype);
1828 for (idx = CLASSTYPE_FIRST_CONVERSION_SLOT;
1829 idx < TREE_VEC_LENGTH (methods); ++idx)
1831 tree ovl = TREE_VEC_ELT (methods, idx);
1833 if (!ovl || !DECL_CONV_FN_P (OVL_CURRENT (ovl)))
1834 /* There are no more conversion functions. */
1837 /* Glue all these conversion functions together
1838 with those we already have. */
1839 for (; ovl; ovl = OVL_NEXT (ovl))
1840 fns = ovl_cons (OVL_CURRENT (ovl), fns);
1844 if (fns == NULL_TREE)
1846 error ("no member function `%D' declared in `%T'",
1848 return error_mark_node;
1851 TREE_OPERAND (declarator, 0) = fns;
1854 /* Figure out what exactly is being specialized at this point.
1855 Note that for an explicit instantiation, even one for a
1856 member function, we cannot tell apriori whether the
1857 instantiation is for a member template, or just a member
1858 function of a template class. Even if a member template is
1859 being instantiated, the member template arguments may be
1860 elided if they can be deduced from the rest of the
1862 tmpl = determine_specialization (declarator, decl,
1864 member_specialization);
1866 if (!tmpl || tmpl == error_mark_node)
1867 /* We couldn't figure out what this declaration was
1869 return error_mark_node;
1872 tree gen_tmpl = most_general_template (tmpl);
1874 if (explicit_instantiation)
1876 /* We don't set DECL_EXPLICIT_INSTANTIATION here; that
1877 is done by do_decl_instantiation later. */
1879 int arg_depth = TMPL_ARGS_DEPTH (targs);
1880 int parm_depth = TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl));
1882 if (arg_depth > parm_depth)
1884 /* If TMPL is not the most general template (for
1885 example, if TMPL is a friend template that is
1886 injected into namespace scope), then there will
1887 be too many levels of TARGS. Remove some of them
1892 new_targs = make_tree_vec (parm_depth);
1893 for (i = arg_depth - parm_depth; i < arg_depth; ++i)
1894 TREE_VEC_ELT (new_targs, i - (arg_depth - parm_depth))
1895 = TREE_VEC_ELT (targs, i);
1899 return instantiate_template (tmpl, targs, tf_error);
1902 /* If we thought that the DECL was a member function, but it
1903 turns out to be specializing a static member function,
1904 make DECL a static member function as well. We also have
1905 to adjust last_function_parms to avoid confusing
1906 start_function later. */
1907 if (DECL_STATIC_FUNCTION_P (tmpl)
1908 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl))
1910 revert_static_member_fn (decl);
1911 last_function_parms = TREE_CHAIN (last_function_parms);
1914 /* If this is a specialization of a member template of a
1915 template class. In we want to return the TEMPLATE_DECL,
1916 not the specialization of it. */
1917 if (tsk == tsk_template)
1919 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl);
1920 DECL_INITIAL (DECL_TEMPLATE_RESULT (tmpl)) = NULL_TREE;
1923 DECL_SOURCE_LOCATION (tmpl) = DECL_SOURCE_LOCATION (decl);
1924 DECL_SOURCE_LOCATION (DECL_TEMPLATE_RESULT (tmpl))
1925 = DECL_SOURCE_LOCATION (decl);
1930 /* Set up the DECL_TEMPLATE_INFO for DECL. */
1931 DECL_TEMPLATE_INFO (decl) = tree_cons (tmpl, targs, NULL_TREE);
1933 /* Inherit default function arguments from the template
1934 DECL is specializing. */
1935 copy_default_args_to_explicit_spec (decl);
1937 /* This specialization has the same protection as the
1938 template it specializes. */
1939 TREE_PRIVATE (decl) = TREE_PRIVATE (gen_tmpl);
1940 TREE_PROTECTED (decl) = TREE_PROTECTED (gen_tmpl);
1942 if (is_friend && !have_def)
1943 /* This is not really a declaration of a specialization.
1944 It's just the name of an instantiation. But, it's not
1945 a request for an instantiation, either. */
1946 SET_DECL_IMPLICIT_INSTANTIATION (decl);
1947 else if (DECL_CONSTRUCTOR_P (decl) || DECL_DESTRUCTOR_P (decl))
1948 /* This is indeed a specialization. In case of constructors
1949 and destructors, we need in-charge and not-in-charge
1950 versions in V3 ABI. */
1951 clone_function_decl (decl, /*update_method_vec_p=*/0);
1953 /* Register this specialization so that we can find it
1955 decl = register_specialization (decl, gen_tmpl, targs);
1962 /* TYPE is being declared. Verify that the use of template headers
1963 and such is reasonable. Issue error messages if not. */
1966 maybe_check_template_type (tree type)
1968 if (template_header_count)
1970 /* We are in the scope of some `template <...>' header. */
1973 = template_class_depth_real (TYPE_CONTEXT (type),
1974 /*count_specializations=*/1);
1976 if (template_header_count <= context_depth)
1977 /* This is OK; the template headers are for the context. We
1978 are actually too lenient here; like
1979 check_explicit_specialization we should consider the number
1980 of template types included in the actual declaration. For
1983 template <class T> struct S {
1984 template <class U> template <class V>
1990 template <class T> struct S {
1991 template <class U> struct I;
1994 template <class T> template <class U.
1999 else if (template_header_count > context_depth + 1)
2000 /* There are two many template parameter lists. */
2001 error ("too many template parameter lists in declaration of `%T'", type);
2005 /* Returns 1 iff PARMS1 and PARMS2 are identical sets of template
2006 parameters. These are represented in the same format used for
2007 DECL_TEMPLATE_PARMS. */
2009 int comp_template_parms (tree parms1, tree parms2)
2014 if (parms1 == parms2)
2017 for (p1 = parms1, p2 = parms2;
2018 p1 != NULL_TREE && p2 != NULL_TREE;
2019 p1 = TREE_CHAIN (p1), p2 = TREE_CHAIN (p2))
2021 tree t1 = TREE_VALUE (p1);
2022 tree t2 = TREE_VALUE (p2);
2025 my_friendly_assert (TREE_CODE (t1) == TREE_VEC, 0);
2026 my_friendly_assert (TREE_CODE (t2) == TREE_VEC, 0);
2028 if (TREE_VEC_LENGTH (t1) != TREE_VEC_LENGTH (t2))
2031 for (i = 0; i < TREE_VEC_LENGTH (t2); ++i)
2033 tree parm1 = TREE_VALUE (TREE_VEC_ELT (t1, i));
2034 tree parm2 = TREE_VALUE (TREE_VEC_ELT (t2, i));
2036 if (TREE_CODE (parm1) != TREE_CODE (parm2))
2039 if (TREE_CODE (parm1) == TEMPLATE_TYPE_PARM)
2041 else if (!same_type_p (TREE_TYPE (parm1), TREE_TYPE (parm2)))
2046 if ((p1 != NULL_TREE) != (p2 != NULL_TREE))
2047 /* One set of parameters has more parameters lists than the
2054 /* Complain if DECL shadows a template parameter.
2056 [temp.local]: A template-parameter shall not be redeclared within its
2057 scope (including nested scopes). */
2060 check_template_shadow (tree decl)
2064 /* If we're not in a template, we can't possibly shadow a template
2066 if (!current_template_parms)
2069 /* Figure out what we're shadowing. */
2070 if (TREE_CODE (decl) == OVERLOAD)
2071 decl = OVL_CURRENT (decl);
2072 olddecl = IDENTIFIER_VALUE (DECL_NAME (decl));
2074 /* If there's no previous binding for this name, we're not shadowing
2075 anything, let alone a template parameter. */
2079 /* If we're not shadowing a template parameter, we're done. Note
2080 that OLDDECL might be an OVERLOAD (or perhaps even an
2081 ERROR_MARK), so we can't just blithely assume it to be a _DECL
2083 if (!DECL_P (olddecl) || !DECL_TEMPLATE_PARM_P (olddecl))
2086 /* We check for decl != olddecl to avoid bogus errors for using a
2087 name inside a class. We check TPFI to avoid duplicate errors for
2088 inline member templates. */
2090 || TEMPLATE_PARMS_FOR_INLINE (current_template_parms))
2093 cp_error_at ("declaration of `%#D'", decl);
2094 cp_error_at (" shadows template parm `%#D'", olddecl);
2097 /* Return a new TEMPLATE_PARM_INDEX with the indicated INDEX, LEVEL,
2098 ORIG_LEVEL, DECL, and TYPE. */
2101 build_template_parm_index (int index,
2107 tree t = make_node (TEMPLATE_PARM_INDEX);
2108 TEMPLATE_PARM_IDX (t) = index;
2109 TEMPLATE_PARM_LEVEL (t) = level;
2110 TEMPLATE_PARM_ORIG_LEVEL (t) = orig_level;
2111 TEMPLATE_PARM_DECL (t) = decl;
2112 TREE_TYPE (t) = type;
2113 TREE_CONSTANT (t) = TREE_CONSTANT (decl);
2114 TREE_READONLY (t) = TREE_READONLY (decl);
2119 /* Return a TEMPLATE_PARM_INDEX, similar to INDEX, but whose
2120 TEMPLATE_PARM_LEVEL has been decreased by LEVELS. If such a
2121 TEMPLATE_PARM_INDEX already exists, it is returned; otherwise, a
2122 new one is created. */
2125 reduce_template_parm_level (tree index, tree type, int levels)
2127 if (TEMPLATE_PARM_DESCENDANTS (index) == NULL_TREE
2128 || (TEMPLATE_PARM_LEVEL (TEMPLATE_PARM_DESCENDANTS (index))
2129 != TEMPLATE_PARM_LEVEL (index) - levels))
2131 tree orig_decl = TEMPLATE_PARM_DECL (index);
2134 decl = build_decl (TREE_CODE (orig_decl), DECL_NAME (orig_decl), type);
2135 TREE_CONSTANT (decl) = TREE_CONSTANT (orig_decl);
2136 TREE_READONLY (decl) = TREE_READONLY (orig_decl);
2137 DECL_ARTIFICIAL (decl) = 1;
2138 SET_DECL_TEMPLATE_PARM_P (decl);
2140 t = build_template_parm_index (TEMPLATE_PARM_IDX (index),
2141 TEMPLATE_PARM_LEVEL (index) - levels,
2142 TEMPLATE_PARM_ORIG_LEVEL (index),
2144 TEMPLATE_PARM_DESCENDANTS (index) = t;
2146 /* Template template parameters need this. */
2147 DECL_TEMPLATE_PARMS (decl)
2148 = DECL_TEMPLATE_PARMS (TEMPLATE_PARM_DECL (index));
2151 return TEMPLATE_PARM_DESCENDANTS (index);
2154 /* Process information from new template parameter NEXT and append it to the
2155 LIST being built. */
2158 process_template_parm (tree list, tree next)
2166 my_friendly_assert (TREE_CODE (parm) == TREE_LIST, 259);
2167 defval = TREE_PURPOSE (parm);
2168 parm = TREE_VALUE (parm);
2169 is_type = TREE_PURPOSE (parm) == class_type_node;
2173 tree p = TREE_VALUE (tree_last (list));
2175 if (TREE_CODE (p) == TYPE_DECL || TREE_CODE (p) == TEMPLATE_DECL)
2176 idx = TEMPLATE_TYPE_IDX (TREE_TYPE (p));
2178 idx = TEMPLATE_PARM_IDX (DECL_INITIAL (p));
2186 my_friendly_assert (TREE_CODE (TREE_PURPOSE (parm)) == TREE_LIST, 260);
2187 /* is a const-param */
2188 parm = grokdeclarator (TREE_VALUE (parm), TREE_PURPOSE (parm),
2190 SET_DECL_TEMPLATE_PARM_P (parm);
2194 The top-level cv-qualifiers on the template-parameter are
2195 ignored when determining its type. */
2196 TREE_TYPE (parm) = TYPE_MAIN_VARIANT (TREE_TYPE (parm));
2198 /* A template parameter is not modifiable. */
2199 TREE_READONLY (parm) = TREE_CONSTANT (parm) = 1;
2200 if (invalid_nontype_parm_type_p (TREE_TYPE (parm), 1))
2201 TREE_TYPE (parm) = void_type_node;
2202 decl = build_decl (CONST_DECL, DECL_NAME (parm), TREE_TYPE (parm));
2203 TREE_CONSTANT (decl) = TREE_READONLY (decl) = 1;
2204 DECL_INITIAL (parm) = DECL_INITIAL (decl)
2205 = build_template_parm_index (idx, processing_template_decl,
2206 processing_template_decl,
2207 decl, TREE_TYPE (parm));
2212 parm = TREE_VALUE (parm);
2214 if (parm && TREE_CODE (parm) == TEMPLATE_DECL)
2216 t = make_aggr_type (TEMPLATE_TEMPLATE_PARM);
2217 /* This is for distinguishing between real templates and template
2218 template parameters */
2219 TREE_TYPE (parm) = t;
2220 TREE_TYPE (DECL_TEMPLATE_RESULT (parm)) = t;
2225 t = make_aggr_type (TEMPLATE_TYPE_PARM);
2226 /* parm is either IDENTIFIER_NODE or NULL_TREE */
2227 decl = build_decl (TYPE_DECL, parm, t);
2230 TYPE_NAME (t) = decl;
2231 TYPE_STUB_DECL (t) = decl;
2233 TEMPLATE_TYPE_PARM_INDEX (t)
2234 = build_template_parm_index (idx, processing_template_decl,
2235 processing_template_decl,
2236 decl, TREE_TYPE (parm));
2238 DECL_ARTIFICIAL (decl) = 1;
2239 SET_DECL_TEMPLATE_PARM_P (decl);
2241 parm = build_tree_list (defval, parm);
2242 return chainon (list, parm);
2245 /* The end of a template parameter list has been reached. Process the
2246 tree list into a parameter vector, converting each parameter into a more
2247 useful form. Type parameters are saved as IDENTIFIER_NODEs, and others
2251 end_template_parm_list (tree parms)
2255 tree saved_parmlist = make_tree_vec (list_length (parms));
2257 current_template_parms
2258 = tree_cons (size_int (processing_template_decl),
2259 saved_parmlist, current_template_parms);
2261 for (parm = parms, nparms = 0; parm; parm = next, nparms++)
2263 next = TREE_CHAIN (parm);
2264 TREE_VEC_ELT (saved_parmlist, nparms) = parm;
2265 TREE_CHAIN (parm) = NULL_TREE;
2268 --processing_template_parmlist;
2270 return saved_parmlist;
2273 /* end_template_decl is called after a template declaration is seen. */
2276 end_template_decl (void)
2278 reset_specialization ();
2280 if (! processing_template_decl)
2283 /* This matches the pushlevel in begin_template_parm_list. */
2286 --processing_template_decl;
2287 current_template_parms = TREE_CHAIN (current_template_parms);
2290 /* Given a template argument vector containing the template PARMS.
2291 The innermost PARMS are given first. */
2294 current_template_args (void)
2297 tree args = NULL_TREE;
2298 int length = TMPL_PARMS_DEPTH (current_template_parms);
2301 /* If there is only one level of template parameters, we do not
2302 create a TREE_VEC of TREE_VECs. Instead, we return a single
2303 TREE_VEC containing the arguments. */
2305 args = make_tree_vec (length);
2307 for (header = current_template_parms; header; header = TREE_CHAIN (header))
2309 tree a = copy_node (TREE_VALUE (header));
2312 TREE_TYPE (a) = NULL_TREE;
2313 for (i = TREE_VEC_LENGTH (a) - 1; i >= 0; --i)
2315 tree t = TREE_VEC_ELT (a, i);
2317 /* T will be a list if we are called from within a
2318 begin/end_template_parm_list pair, but a vector directly
2319 if within a begin/end_member_template_processing pair. */
2320 if (TREE_CODE (t) == TREE_LIST)
2324 if (TREE_CODE (t) == TYPE_DECL
2325 || TREE_CODE (t) == TEMPLATE_DECL)
2328 t = DECL_INITIAL (t);
2329 TREE_VEC_ELT (a, i) = t;
2334 TREE_VEC_ELT (args, --l) = a;
2342 /* Return a TEMPLATE_DECL corresponding to DECL, using the indicated
2343 template PARMS. Used by push_template_decl below. */
2346 build_template_decl (tree decl, tree parms)
2348 tree tmpl = build_lang_decl (TEMPLATE_DECL, DECL_NAME (decl), NULL_TREE);
2349 DECL_TEMPLATE_PARMS (tmpl) = parms;
2350 DECL_CONTEXT (tmpl) = DECL_CONTEXT (decl);
2351 if (DECL_LANG_SPECIFIC (decl))
2353 DECL_STATIC_FUNCTION_P (tmpl) = DECL_STATIC_FUNCTION_P (decl);
2354 DECL_CONSTRUCTOR_P (tmpl) = DECL_CONSTRUCTOR_P (decl);
2355 DECL_DESTRUCTOR_P (tmpl) = DECL_DESTRUCTOR_P (decl);
2356 DECL_NONCONVERTING_P (tmpl) = DECL_NONCONVERTING_P (decl);
2357 DECL_ASSIGNMENT_OPERATOR_P (tmpl) = DECL_ASSIGNMENT_OPERATOR_P (decl);
2358 if (DECL_OVERLOADED_OPERATOR_P (decl))
2359 SET_OVERLOADED_OPERATOR_CODE (tmpl,
2360 DECL_OVERLOADED_OPERATOR_P (decl));
2366 struct template_parm_data
2368 /* The level of the template parameters we are currently
2372 /* The index of the specialization argument we are currently
2376 /* An array whose size is the number of template parameters. The
2377 elements are nonzero if the parameter has been used in any one
2378 of the arguments processed so far. */
2381 /* An array whose size is the number of template arguments. The
2382 elements are nonzero if the argument makes use of template
2383 parameters of this level. */
2384 int* arg_uses_template_parms;
2387 /* Subroutine of push_template_decl used to see if each template
2388 parameter in a partial specialization is used in the explicit
2389 argument list. If T is of the LEVEL given in DATA (which is
2390 treated as a template_parm_data*), then DATA->PARMS is marked
2394 mark_template_parm (tree t, void* data)
2398 struct template_parm_data* tpd = (struct template_parm_data*) data;
2400 if (TREE_CODE (t) == TEMPLATE_PARM_INDEX)
2402 level = TEMPLATE_PARM_LEVEL (t);
2403 idx = TEMPLATE_PARM_IDX (t);
2407 level = TEMPLATE_TYPE_LEVEL (t);
2408 idx = TEMPLATE_TYPE_IDX (t);
2411 if (level == tpd->level)
2413 tpd->parms[idx] = 1;
2414 tpd->arg_uses_template_parms[tpd->current_arg] = 1;
2417 /* Return zero so that for_each_template_parm will continue the
2418 traversal of the tree; we want to mark *every* template parm. */
2422 /* Process the partial specialization DECL. */
2425 process_partial_specialization (tree decl)
2427 tree type = TREE_TYPE (decl);
2428 tree maintmpl = CLASSTYPE_TI_TEMPLATE (type);
2429 tree specargs = CLASSTYPE_TI_ARGS (type);
2430 tree inner_args = INNERMOST_TEMPLATE_ARGS (specargs);
2431 tree inner_parms = INNERMOST_TEMPLATE_PARMS (current_template_parms);
2432 tree main_inner_parms = DECL_INNERMOST_TEMPLATE_PARMS (maintmpl);
2433 int nargs = TREE_VEC_LENGTH (inner_args);
2434 int ntparms = TREE_VEC_LENGTH (inner_parms);
2436 int did_error_intro = 0;
2437 struct template_parm_data tpd;
2438 struct template_parm_data tpd2;
2440 /* We check that each of the template parameters given in the
2441 partial specialization is used in the argument list to the
2442 specialization. For example:
2444 template <class T> struct S;
2445 template <class T> struct S<T*>;
2447 The second declaration is OK because `T*' uses the template
2448 parameter T, whereas
2450 template <class T> struct S<int>;
2452 is no good. Even trickier is:
2463 The S2<T> declaration is actually invalid; it is a
2464 full-specialization. Of course,
2467 struct S2<T (*)(U)>;
2469 or some such would have been OK. */
2470 tpd.level = TMPL_PARMS_DEPTH (current_template_parms);
2471 tpd.parms = alloca (sizeof (int) * ntparms);
2472 memset (tpd.parms, 0, sizeof (int) * ntparms);
2474 tpd.arg_uses_template_parms = alloca (sizeof (int) * nargs);
2475 memset (tpd.arg_uses_template_parms, 0, sizeof (int) * nargs);
2476 for (i = 0; i < nargs; ++i)
2478 tpd.current_arg = i;
2479 for_each_template_parm (TREE_VEC_ELT (inner_args, i),
2480 &mark_template_parm,
2484 for (i = 0; i < ntparms; ++i)
2485 if (tpd.parms[i] == 0)
2487 /* One of the template parms was not used in the
2489 if (!did_error_intro)
2491 error ("template parameters not used in partial specialization:");
2492 did_error_intro = 1;
2496 TREE_VALUE (TREE_VEC_ELT (inner_parms, i)));
2499 /* [temp.class.spec]
2501 The argument list of the specialization shall not be identical to
2502 the implicit argument list of the primary template. */
2503 if (comp_template_args
2505 INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE
2507 error ("partial specialization `%T' does not specialize any template arguments", type);
2509 /* [temp.class.spec]
2511 A partially specialized non-type argument expression shall not
2512 involve template parameters of the partial specialization except
2513 when the argument expression is a simple identifier.
2515 The type of a template parameter corresponding to a specialized
2516 non-type argument shall not be dependent on a parameter of the
2518 my_friendly_assert (nargs == DECL_NTPARMS (maintmpl), 0);
2520 for (i = 0; i < nargs; ++i)
2522 tree arg = TREE_VEC_ELT (inner_args, i);
2523 if (/* These first two lines are the `non-type' bit. */
2525 && TREE_CODE (arg) != TEMPLATE_DECL
2526 /* This next line is the `argument expression is not just a
2527 simple identifier' condition and also the `specialized
2528 non-type argument' bit. */
2529 && TREE_CODE (arg) != TEMPLATE_PARM_INDEX)
2531 if (tpd.arg_uses_template_parms[i])
2532 error ("template argument `%E' involves template parameter(s)", arg);
2535 /* Look at the corresponding template parameter,
2536 marking which template parameters its type depends
2539 TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (main_inner_parms,
2544 /* We haven't yet initialized TPD2. Do so now. */
2545 tpd2.arg_uses_template_parms
2546 = alloca (sizeof (int) * nargs);
2547 /* The number of parameters here is the number in the
2548 main template, which, as checked in the assertion
2550 tpd2.parms = alloca (sizeof (int) * nargs);
2552 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (maintmpl));
2555 /* Mark the template parameters. But this time, we're
2556 looking for the template parameters of the main
2557 template, not in the specialization. */
2558 tpd2.current_arg = i;
2559 tpd2.arg_uses_template_parms[i] = 0;
2560 memset (tpd2.parms, 0, sizeof (int) * nargs);
2561 for_each_template_parm (type,
2562 &mark_template_parm,
2566 if (tpd2.arg_uses_template_parms [i])
2568 /* The type depended on some template parameters.
2569 If they are fully specialized in the
2570 specialization, that's OK. */
2572 for (j = 0; j < nargs; ++j)
2573 if (tpd2.parms[j] != 0
2574 && tpd.arg_uses_template_parms [j])
2576 error ("type `%T' of template argument `%E' depends on template parameter(s)",
2586 if (retrieve_specialization (maintmpl, specargs))
2587 /* We've already got this specialization. */
2590 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl)
2591 = tree_cons (inner_args, inner_parms,
2592 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl));
2593 TREE_TYPE (DECL_TEMPLATE_SPECIALIZATIONS (maintmpl)) = type;
2597 /* Check that a template declaration's use of default arguments is not
2598 invalid. Here, PARMS are the template parameters. IS_PRIMARY is
2599 nonzero if DECL is the thing declared by a primary template.
2600 IS_PARTIAL is nonzero if DECL is a partial specialization. */
2603 check_default_tmpl_args (tree decl, tree parms, int is_primary, int is_partial)
2606 int last_level_to_check;
2611 A default template-argument shall not be specified in a
2612 function template declaration or a function template definition, nor
2613 in the template-parameter-list of the definition of a member of a
2616 if (TREE_CODE (CP_DECL_CONTEXT (decl)) == FUNCTION_DECL)
2617 /* You can't have a function template declaration in a local
2618 scope, nor you can you define a member of a class template in a
2622 if (current_class_type
2623 && !TYPE_BEING_DEFINED (current_class_type)
2624 && DECL_LANG_SPECIFIC (decl)
2625 /* If this is either a friend defined in the scope of the class
2626 or a member function. */
2627 && (DECL_FUNCTION_MEMBER_P (decl)
2628 ? same_type_p (DECL_CONTEXT (decl), current_class_type)
2629 : DECL_FRIEND_CONTEXT (decl)
2630 ? same_type_p (DECL_FRIEND_CONTEXT (decl), current_class_type)
2632 /* And, if it was a member function, it really was defined in
2633 the scope of the class. */
2634 && (!DECL_FUNCTION_MEMBER_P (decl)
2635 || DECL_INITIALIZED_IN_CLASS_P (decl)))
2636 /* We already checked these parameters when the template was
2637 declared, so there's no need to do it again now. This function
2638 was defined in class scope, but we're processing it's body now
2639 that the class is complete. */
2644 If a template-parameter has a default template-argument, all
2645 subsequent template-parameters shall have a default
2646 template-argument supplied. */
2647 for (parm_level = parms; parm_level; parm_level = TREE_CHAIN (parm_level))
2649 tree inner_parms = TREE_VALUE (parm_level);
2650 int ntparms = TREE_VEC_LENGTH (inner_parms);
2651 int seen_def_arg_p = 0;
2654 for (i = 0; i < ntparms; ++i)
2656 tree parm = TREE_VEC_ELT (inner_parms, i);
2657 if (TREE_PURPOSE (parm))
2659 else if (seen_def_arg_p)
2661 error ("no default argument for `%D'", TREE_VALUE (parm));
2662 /* For better subsequent error-recovery, we indicate that
2663 there should have been a default argument. */
2664 TREE_PURPOSE (parm) = error_mark_node;
2669 if (TREE_CODE (decl) != TYPE_DECL || is_partial || !is_primary)
2670 /* For an ordinary class template, default template arguments are
2671 allowed at the innermost level, e.g.:
2672 template <class T = int>
2674 but, in a partial specialization, they're not allowed even
2675 there, as we have in [temp.class.spec]:
2677 The template parameter list of a specialization shall not
2678 contain default template argument values.
2680 So, for a partial specialization, or for a function template,
2681 we look at all of them. */
2684 /* But, for a primary class template that is not a partial
2685 specialization we look at all template parameters except the
2687 parms = TREE_CHAIN (parms);
2689 /* Figure out what error message to issue. */
2690 if (TREE_CODE (decl) == FUNCTION_DECL)
2691 msg = "default template arguments may not be used in function templates";
2692 else if (is_partial)
2693 msg = "default template arguments may not be used in partial specializations";
2695 msg = "default argument for template parameter for class enclosing `%D'";
2697 if (current_class_type && TYPE_BEING_DEFINED (current_class_type))
2698 /* If we're inside a class definition, there's no need to
2699 examine the parameters to the class itself. On the one
2700 hand, they will be checked when the class is defined, and,
2701 on the other, default arguments are valid in things like:
2702 template <class T = double>
2703 struct S { template <class U> void f(U); };
2704 Here the default argument for `S' has no bearing on the
2705 declaration of `f'. */
2706 last_level_to_check = template_class_depth (current_class_type) + 1;
2708 /* Check everything. */
2709 last_level_to_check = 0;
2711 for (parm_level = parms;
2712 parm_level && TMPL_PARMS_DEPTH (parm_level) >= last_level_to_check;
2713 parm_level = TREE_CHAIN (parm_level))
2715 tree inner_parms = TREE_VALUE (parm_level);
2719 ntparms = TREE_VEC_LENGTH (inner_parms);
2720 for (i = 0; i < ntparms; ++i)
2721 if (TREE_PURPOSE (TREE_VEC_ELT (inner_parms, i)))
2729 /* Clear out the default argument so that we are not
2731 TREE_PURPOSE (TREE_VEC_ELT (inner_parms, i)) = NULL_TREE;
2734 /* At this point, if we're still interested in issuing messages,
2735 they must apply to classes surrounding the object declared. */
2737 msg = "default argument for template parameter for class enclosing `%D'";
2741 /* Worker for push_template_decl_real, called via
2742 for_each_template_parm. DATA is really an int, indicating the
2743 level of the parameters we are interested in. If T is a template
2744 parameter of that level, return nonzero. */
2747 template_parm_this_level_p (tree t, void* data)
2749 int this_level = *(int *)data;
2752 if (TREE_CODE (t) == TEMPLATE_PARM_INDEX)
2753 level = TEMPLATE_PARM_LEVEL (t);
2755 level = TEMPLATE_TYPE_LEVEL (t);
2756 return level == this_level;
2759 /* Creates a TEMPLATE_DECL for the indicated DECL using the template
2760 parameters given by current_template_args, or reuses a
2761 previously existing one, if appropriate. Returns the DECL, or an
2762 equivalent one, if it is replaced via a call to duplicate_decls.
2764 If IS_FRIEND is nonzero, DECL is a friend declaration. */
2767 push_template_decl_real (tree decl, int is_friend)
2775 int new_template_p = 0;
2777 /* See if this is a partial specialization. */
2778 is_partial = (DECL_IMPLICIT_TYPEDEF_P (decl)
2779 && TREE_CODE (TREE_TYPE (decl)) != ENUMERAL_TYPE
2780 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl)));
2782 is_friend |= (TREE_CODE (decl) == FUNCTION_DECL && DECL_FRIEND_P (decl));
2785 /* For a friend, we want the context of the friend function, not
2786 the type of which it is a friend. */
2787 ctx = DECL_CONTEXT (decl);
2788 else if (CP_DECL_CONTEXT (decl)
2789 && TREE_CODE (CP_DECL_CONTEXT (decl)) != NAMESPACE_DECL)
2790 /* In the case of a virtual function, we want the class in which
2792 ctx = CP_DECL_CONTEXT (decl);
2794 /* Otherwise, if we're currently defining some class, the DECL
2795 is assumed to be a member of the class. */
2796 ctx = current_scope ();
2798 if (ctx && TREE_CODE (ctx) == NAMESPACE_DECL)
2801 if (!DECL_CONTEXT (decl))
2802 DECL_CONTEXT (decl) = FROB_CONTEXT (current_namespace);
2804 /* See if this is a primary template. */
2805 primary = template_parm_scope_p ();
2809 if (current_lang_name == lang_name_c)
2810 error ("template with C linkage");
2811 else if (TREE_CODE (decl) == TYPE_DECL
2812 && ANON_AGGRNAME_P (DECL_NAME (decl)))
2813 error ("template class without a name");
2814 else if (TREE_CODE (decl) == FUNCTION_DECL
2815 && DECL_DESTRUCTOR_P (decl))
2819 A destructor shall not be a member template. */
2820 error ("destructor `%D' declared as member template", decl);
2821 return error_mark_node;
2823 else if ((DECL_IMPLICIT_TYPEDEF_P (decl)
2824 && CLASS_TYPE_P (TREE_TYPE (decl)))
2825 || (TREE_CODE (decl) == VAR_DECL && ctx && CLASS_TYPE_P (ctx))
2826 || TREE_CODE (decl) == FUNCTION_DECL)
2830 error ("template declaration of `%#D'", decl);
2831 return error_mark_node;
2835 /* Check to see that the rules regarding the use of default
2836 arguments are not being violated. */
2837 check_default_tmpl_args (decl, current_template_parms,
2838 primary, is_partial);
2841 return process_partial_specialization (decl);
2843 args = current_template_args ();
2846 || TREE_CODE (ctx) == FUNCTION_DECL
2847 || (CLASS_TYPE_P (ctx) && TYPE_BEING_DEFINED (ctx))
2848 || (is_friend && !DECL_TEMPLATE_INFO (decl)))
2850 if (DECL_LANG_SPECIFIC (decl)
2851 && DECL_TEMPLATE_INFO (decl)
2852 && DECL_TI_TEMPLATE (decl))
2853 tmpl = DECL_TI_TEMPLATE (decl);
2854 /* If DECL is a TYPE_DECL for a class-template, then there won't
2855 be DECL_LANG_SPECIFIC. The information equivalent to
2856 DECL_TEMPLATE_INFO is found in TYPE_TEMPLATE_INFO instead. */
2857 else if (DECL_IMPLICIT_TYPEDEF_P (decl)
2858 && TYPE_TEMPLATE_INFO (TREE_TYPE (decl))
2859 && TYPE_TI_TEMPLATE (TREE_TYPE (decl)))
2861 /* Since a template declaration already existed for this
2862 class-type, we must be redeclaring it here. Make sure
2863 that the redeclaration is valid. */
2864 redeclare_class_template (TREE_TYPE (decl),
2865 current_template_parms);
2866 /* We don't need to create a new TEMPLATE_DECL; just use the
2867 one we already had. */
2868 tmpl = TYPE_TI_TEMPLATE (TREE_TYPE (decl));
2872 tmpl = build_template_decl (decl, current_template_parms);
2875 if (DECL_LANG_SPECIFIC (decl)
2876 && DECL_TEMPLATE_SPECIALIZATION (decl))
2878 /* A specialization of a member template of a template
2880 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl);
2881 DECL_TEMPLATE_INFO (tmpl) = DECL_TEMPLATE_INFO (decl);
2882 DECL_TEMPLATE_INFO (decl) = NULL_TREE;
2888 tree a, t, current, parms;
2891 if (TREE_CODE (decl) == TYPE_DECL)
2893 if ((IS_AGGR_TYPE_CODE (TREE_CODE (TREE_TYPE (decl)))
2894 || TREE_CODE (TREE_TYPE (decl)) == ENUMERAL_TYPE)
2895 && TYPE_TEMPLATE_INFO (TREE_TYPE (decl))
2896 && TYPE_TI_TEMPLATE (TREE_TYPE (decl)))
2897 tmpl = TYPE_TI_TEMPLATE (TREE_TYPE (decl));
2900 error ("`%D' does not declare a template type", decl);
2904 else if (!DECL_LANG_SPECIFIC (decl) || !DECL_TEMPLATE_INFO (decl))
2906 error ("template definition of non-template `%#D'", decl);
2910 tmpl = DECL_TI_TEMPLATE (decl);
2912 if (is_member_template (tmpl)
2913 && DECL_FUNCTION_TEMPLATE_P (tmpl)
2914 && DECL_TEMPLATE_INFO (decl) && DECL_TI_ARGS (decl)
2915 && DECL_TEMPLATE_SPECIALIZATION (decl))
2919 /* The declaration is a specialization of a member
2920 template, declared outside the class. Therefore, the
2921 innermost template arguments will be NULL, so we
2922 replace them with the arguments determined by the
2923 earlier call to check_explicit_specialization. */
2924 args = DECL_TI_ARGS (decl);
2927 = build_template_decl (decl, current_template_parms);
2928 DECL_TEMPLATE_RESULT (new_tmpl) = decl;
2929 TREE_TYPE (new_tmpl) = TREE_TYPE (decl);
2930 DECL_TI_TEMPLATE (decl) = new_tmpl;
2931 SET_DECL_TEMPLATE_SPECIALIZATION (new_tmpl);
2932 DECL_TEMPLATE_INFO (new_tmpl)
2933 = tree_cons (tmpl, args, NULL_TREE);
2935 register_specialization (new_tmpl,
2936 most_general_template (tmpl),
2941 /* Make sure the template headers we got make sense. */
2943 parms = DECL_TEMPLATE_PARMS (tmpl);
2944 i = TMPL_PARMS_DEPTH (parms);
2945 if (TMPL_ARGS_DEPTH (args) != i)
2947 error ("expected %d levels of template parms for `%#D', got %d",
2948 i, decl, TMPL_ARGS_DEPTH (args));
2951 for (current = decl; i > 0; --i, parms = TREE_CHAIN (parms))
2953 a = TMPL_ARGS_LEVEL (args, i);
2954 t = INNERMOST_TEMPLATE_PARMS (parms);
2956 if (TREE_VEC_LENGTH (t) != TREE_VEC_LENGTH (a))
2958 if (current == decl)
2959 error ("got %d template parameters for `%#D'",
2960 TREE_VEC_LENGTH (a), decl);
2962 error ("got %d template parameters for `%#T'",
2963 TREE_VEC_LENGTH (a), current);
2964 error (" but %d required", TREE_VEC_LENGTH (t));
2967 /* Perhaps we should also check that the parms are used in the
2968 appropriate qualifying scopes in the declarator? */
2970 if (current == decl)
2973 current = TYPE_CONTEXT (current);
2977 DECL_TEMPLATE_RESULT (tmpl) = decl;
2978 TREE_TYPE (tmpl) = TREE_TYPE (decl);
2980 /* Push template declarations for global functions and types. Note
2981 that we do not try to push a global template friend declared in a
2982 template class; such a thing may well depend on the template
2983 parameters of the class. */
2984 if (new_template_p && !ctx
2985 && !(is_friend && template_class_depth (current_class_type) > 0))
2986 tmpl = pushdecl_namespace_level (tmpl);
2990 DECL_PRIMARY_TEMPLATE (tmpl) = tmpl;
2991 if (DECL_CONV_FN_P (tmpl))
2993 int depth = TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl));
2995 /* It is a conversion operator. See if the type converted to
2996 depends on innermost template operands. */
2998 if (uses_template_parms_level (TREE_TYPE (TREE_TYPE (tmpl)),
3000 DECL_TEMPLATE_CONV_FN_P (tmpl) = 1;
3004 info = tree_cons (tmpl, args, NULL_TREE);
3006 if (DECL_IMPLICIT_TYPEDEF_P (decl))
3008 SET_TYPE_TEMPLATE_INFO (TREE_TYPE (tmpl), info);
3009 if ((!ctx || TREE_CODE (ctx) != FUNCTION_DECL)
3010 && TREE_CODE (TREE_TYPE (decl)) != ENUMERAL_TYPE
3011 /* Don't change the name if we've already set it up. */
3012 && !IDENTIFIER_TEMPLATE (DECL_NAME (decl)))
3013 DECL_NAME (decl) = classtype_mangled_name (TREE_TYPE (decl));
3015 else if (DECL_LANG_SPECIFIC (decl))
3016 DECL_TEMPLATE_INFO (decl) = info;
3018 return DECL_TEMPLATE_RESULT (tmpl);
3022 push_template_decl (tree decl)
3024 return push_template_decl_real (decl, 0);
3027 /* Called when a class template TYPE is redeclared with the indicated
3028 template PARMS, e.g.:
3030 template <class T> struct S;
3031 template <class T> struct S {}; */
3034 redeclare_class_template (tree type, tree parms)
3040 if (!TYPE_TEMPLATE_INFO (type))
3042 error ("`%T' is not a template type", type);
3046 tmpl = TYPE_TI_TEMPLATE (type);
3047 if (!PRIMARY_TEMPLATE_P (tmpl))
3048 /* The type is nested in some template class. Nothing to worry
3049 about here; there are no new template parameters for the nested
3053 parms = INNERMOST_TEMPLATE_PARMS (parms);
3054 tmpl_parms = DECL_INNERMOST_TEMPLATE_PARMS (tmpl);
3056 if (TREE_VEC_LENGTH (parms) != TREE_VEC_LENGTH (tmpl_parms))
3058 cp_error_at ("previous declaration `%D'", tmpl);
3059 error ("used %d template parameter%s instead of %d",
3060 TREE_VEC_LENGTH (tmpl_parms),
3061 TREE_VEC_LENGTH (tmpl_parms) == 1 ? "" : "s",
3062 TREE_VEC_LENGTH (parms));
3066 for (i = 0; i < TREE_VEC_LENGTH (tmpl_parms); ++i)
3068 tree tmpl_parm = TREE_VALUE (TREE_VEC_ELT (tmpl_parms, i));
3069 tree parm = TREE_VALUE (TREE_VEC_ELT (parms, i));
3070 tree tmpl_default = TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms, i));
3071 tree parm_default = TREE_PURPOSE (TREE_VEC_ELT (parms, i));
3073 if (TREE_CODE (tmpl_parm) != TREE_CODE (parm))
3075 cp_error_at ("template parameter `%#D'", tmpl_parm);
3076 error ("redeclared here as `%#D'", parm);
3080 if (tmpl_default != NULL_TREE && parm_default != NULL_TREE)
3082 /* We have in [temp.param]:
3084 A template-parameter may not be given default arguments
3085 by two different declarations in the same scope. */
3086 error ("redefinition of default argument for `%#D'", parm);
3087 error ("%J original definition appeared here", tmpl_parm);
3091 if (parm_default != NULL_TREE)
3092 /* Update the previous template parameters (which are the ones
3093 that will really count) with the new default value. */
3094 TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms, i)) = parm_default;
3095 else if (tmpl_default != NULL_TREE)
3096 /* Update the new parameters, too; they'll be used as the
3097 parameters for any members. */
3098 TREE_PURPOSE (TREE_VEC_ELT (parms, i)) = tmpl_default;
3102 /* Attempt to convert the non-type template parameter EXPR to the
3103 indicated TYPE. If the conversion is successful, return the
3104 converted value. If the conversion is unsuccessful, return
3105 NULL_TREE if we issued an error message, or error_mark_node if we
3106 did not. We issue error messages for out-and-out bad template
3107 parameters, but not simply because the conversion failed, since we
3108 might be just trying to do argument deduction. By the time this
3109 function is called, neither TYPE nor EXPR may make use of template
3113 convert_nontype_argument (tree type, tree expr)
3115 tree expr_type = TREE_TYPE (expr);
3117 /* A template-argument for a non-type, non-template
3118 template-parameter shall be one of:
3120 --an integral constant-expression of integral or enumeration
3123 --the name of a non-type template-parameter; or
3125 --the name of an object or function with external linkage,
3126 including function templates and function template-ids but
3127 excluding non-static class members, expressed as id-expression;
3130 --the address of an object or function with external linkage,
3131 including function templates and function template-ids but
3132 excluding non-static class members, expressed as & id-expression
3133 where the & is optional if the name refers to a function or
3136 --a pointer to member expressed as described in _expr.unary.op_. */
3138 /* An integral constant-expression can include const variables or
3139 enumerators. Simplify things by folding them to their values,
3140 unless we're about to bind the declaration to a reference
3142 if (INTEGRAL_TYPE_P (expr_type)
3143 && TREE_CODE (type) != REFERENCE_TYPE)
3144 expr = decl_constant_value (expr);
3146 if (is_overloaded_fn (expr))
3147 /* OK for now. We'll check that it has external linkage later.
3148 Check this first since if expr_type is the unknown_type_node
3149 we would otherwise complain below. */
3151 else if (TYPE_PTR_TO_MEMBER_P (expr_type))
3153 if (TREE_CODE (expr) != PTRMEM_CST)
3156 else if (TYPE_PTR_P (expr_type)
3157 || TREE_CODE (expr_type) == ARRAY_TYPE
3158 || TREE_CODE (type) == REFERENCE_TYPE
3159 /* If expr is the address of an overloaded function, we
3160 will get the unknown_type_node at this point. */
3161 || expr_type == unknown_type_node)
3167 if (TREE_CODE (expr_type) == ARRAY_TYPE
3168 || (TREE_CODE (type) == REFERENCE_TYPE
3169 && TREE_CODE (e) != ADDR_EXPR))
3173 if (TREE_CODE (e) != ADDR_EXPR)
3176 error ("`%E' is not a valid template argument", expr);
3177 if (TYPE_PTR_P (expr_type))
3179 if (TREE_CODE (TREE_TYPE (expr_type)) == FUNCTION_TYPE)
3180 error ("it must be the address of a function with external linkage");
3182 error ("it must be the address of an object with external linkage");
3184 else if (TYPE_PTR_TO_MEMBER_P (expr_type))
3185 error ("it must be a pointer-to-member of the form `&X::Y'");
3190 referent = TREE_OPERAND (e, 0);
3191 STRIP_NOPS (referent);
3194 if (TREE_CODE (referent) == STRING_CST)
3196 error ("string literal %E is not a valid template argument because it is the address of an object with static linkage",
3201 if (TREE_CODE (referent) == SCOPE_REF)
3202 referent = TREE_OPERAND (referent, 1);
3204 if (is_overloaded_fn (referent))
3205 /* We'll check that it has external linkage later. */
3207 else if (TREE_CODE (referent) != VAR_DECL)
3209 else if (!DECL_EXTERNAL_LINKAGE_P (referent))
3211 error ("address of non-extern `%E' cannot be used as template argument", referent);
3212 return error_mark_node;
3215 else if (INTEGRAL_TYPE_P (expr_type) || TYPE_PTR_TO_MEMBER_P (expr_type))
3217 if (! TREE_CONSTANT (expr))
3220 error ("non-constant `%E' cannot be used as template argument",
3228 error ("type '%T' cannot be used as a value for a non-type "
3229 "template-parameter", expr);
3230 else if (DECL_P (expr))
3231 error ("invalid use of '%D' as a non-type template-argument", expr);
3233 error ("invalid use of '%E' as a non-type template-argument", expr);
3238 switch (TREE_CODE (type))
3243 /* For a non-type template-parameter of integral or enumeration
3244 type, integral promotions (_conv.prom_) and integral
3245 conversions (_conv.integral_) are applied. */
3246 if (!INTEGRAL_TYPE_P (expr_type))
3247 return error_mark_node;
3249 /* It's safe to call digest_init in this case; we know we're
3250 just converting one integral constant expression to another. */
3251 expr = digest_init (type, expr, (tree*) 0);
3253 if (TREE_CODE (expr) != INTEGER_CST)
3254 /* Curiously, some TREE_CONSTANT integral expressions do not
3255 simplify to integer constants. For example, `3 % 0',
3256 remains a TRUNC_MOD_EXPR. */
3265 /* For a non-type template-parameter of type pointer to data
3266 member, qualification conversions (_conv.qual_) are
3268 e = perform_qualification_conversions (type, expr);
3269 if (TREE_CODE (e) == NOP_EXPR)
3270 /* The call to perform_qualification_conversions will
3271 insert a NOP_EXPR over EXPR to do express conversion,
3272 if necessary. But, that will confuse us if we use
3273 this (converted) template parameter to instantiate
3274 another template; then the thing will not look like a
3275 valid template argument. So, just make a new
3276 constant, of the appropriate type. */
3277 e = make_ptrmem_cst (type, PTRMEM_CST_MEMBER (expr));
3283 tree type_pointed_to = TREE_TYPE (type);
3285 if (TREE_CODE (type_pointed_to) == FUNCTION_TYPE)
3287 /* For a non-type template-parameter of type pointer to
3288 function, only the function-to-pointer conversion
3289 (_conv.func_) is applied. If the template-argument
3290 represents a set of overloaded functions (or a pointer to
3291 such), the matching function is selected from the set
3296 if (TREE_CODE (expr) == ADDR_EXPR)
3297 fns = TREE_OPERAND (expr, 0);
3301 fn = instantiate_type (type_pointed_to, fns, tf_none);
3303 if (fn == error_mark_node)
3304 return error_mark_node;
3306 if (!DECL_EXTERNAL_LINKAGE_P (fn))
3308 if (really_overloaded_fn (fns))
3309 return error_mark_node;
3314 expr = build_unary_op (ADDR_EXPR, fn, 0);
3316 my_friendly_assert (same_type_p (type, TREE_TYPE (expr)),
3322 /* For a non-type template-parameter of type pointer to
3323 object, qualification conversions (_conv.qual_) and the
3324 array-to-pointer conversion (_conv.array_) are applied.
3325 [Note: In particular, neither the null pointer conversion
3326 (_conv.ptr_) nor the derived-to-base conversion
3327 (_conv.ptr_) are applied. Although 0 is a valid
3328 template-argument for a non-type template-parameter of
3329 integral type, it is not a valid template-argument for a
3330 non-type template-parameter of pointer type.]
3332 The call to decay_conversion performs the
3333 array-to-pointer conversion, if appropriate. */
3334 expr = decay_conversion (expr);
3336 if (expr == error_mark_node)
3337 return error_mark_node;
3339 return perform_qualification_conversions (type, expr);
3344 case REFERENCE_TYPE:
3346 tree type_referred_to = TREE_TYPE (type);
3348 /* If this expression already has reference type, get the
3349 underlying object. */
3350 if (TREE_CODE (expr_type) == REFERENCE_TYPE)
3352 if (TREE_CODE (expr) == NOP_EXPR
3353 && TREE_CODE (TREE_OPERAND (expr, 0)) == ADDR_EXPR)
3355 my_friendly_assert (TREE_CODE (expr) == ADDR_EXPR, 20000604);
3356 expr = TREE_OPERAND (expr, 0);
3357 expr_type = TREE_TYPE (expr);
3360 if (TREE_CODE (type_referred_to) == FUNCTION_TYPE)
3362 /* For a non-type template-parameter of type reference to
3363 function, no conversions apply. If the
3364 template-argument represents a set of overloaded
3365 functions, the matching function is selected from the
3366 set (_over.over_). */
3369 fn = instantiate_type (type_referred_to, expr, tf_none);
3371 if (fn == error_mark_node)
3372 return error_mark_node;
3374 if (!DECL_EXTERNAL_LINKAGE_P (fn))
3376 if (really_overloaded_fn (expr))
3377 /* Don't issue an error here; we might get a different
3378 function if the overloading had worked out
3380 return error_mark_node;
3385 my_friendly_assert (same_type_p (type_referred_to,
3393 /* For a non-type template-parameter of type reference to
3394 object, no conversions apply. The type referred to by the
3395 reference may be more cv-qualified than the (otherwise
3396 identical) type of the template-argument. The
3397 template-parameter is bound directly to the
3398 template-argument, which must be an lvalue. */
3399 if (!same_type_p (TYPE_MAIN_VARIANT (expr_type),
3400 TYPE_MAIN_VARIANT (type_referred_to))
3401 || !at_least_as_qualified_p (type_referred_to,
3403 || !real_lvalue_p (expr))
3404 return error_mark_node;
3407 cxx_mark_addressable (expr);
3408 return build_nop (type, build_address (expr));
3414 my_friendly_assert (TYPE_PTRMEMFUNC_P (type), 20010112);
3416 /* For a non-type template-parameter of type pointer to member
3417 function, no conversions apply. If the template-argument
3418 represents a set of overloaded member functions, the
3419 matching member function is selected from the set
3422 if (!TYPE_PTRMEMFUNC_P (expr_type) &&
3423 expr_type != unknown_type_node)
3424 return error_mark_node;
3426 if (TREE_CODE (expr) == PTRMEM_CST)
3428 /* A ptr-to-member constant. */
3429 if (!same_type_p (type, expr_type))
3430 return error_mark_node;
3435 if (TREE_CODE (expr) != ADDR_EXPR)
3436 return error_mark_node;
3438 expr = instantiate_type (type, expr, tf_none);
3440 if (expr == error_mark_node)
3441 return error_mark_node;
3443 my_friendly_assert (same_type_p (type, TREE_TYPE (expr)),
3450 /* All non-type parameters must have one of these types. */
3455 return error_mark_node;
3458 /* Return 1 if PARM_PARMS and ARG_PARMS matches using rule for
3459 template template parameters. Both PARM_PARMS and ARG_PARMS are
3460 vectors of TREE_LIST nodes containing TYPE_DECL, TEMPLATE_DECL
3463 ARG_PARMS may contain more parameters than PARM_PARMS. If this is
3464 the case, then extra parameters must have default arguments.
3466 Consider the example:
3467 template <class T, class Allocator = allocator> class vector;
3468 template<template <class U> class TT> class C;
3470 C<vector> is a valid instantiation. PARM_PARMS for the above code
3471 contains a TYPE_DECL (for U), ARG_PARMS contains two TYPE_DECLs (for
3472 T and Allocator) and OUTER_ARGS contains the argument that is used to
3473 substitute the TT parameter. */
3476 coerce_template_template_parms (tree parm_parms,
3478 tsubst_flags_t complain,
3482 int nparms, nargs, i;
3485 my_friendly_assert (TREE_CODE (parm_parms) == TREE_VEC, 0);
3486 my_friendly_assert (TREE_CODE (arg_parms) == TREE_VEC, 0);
3488 nparms = TREE_VEC_LENGTH (parm_parms);
3489 nargs = TREE_VEC_LENGTH (arg_parms);
3491 /* The rule here is opposite of coerce_template_parms. */
3494 && TREE_PURPOSE (TREE_VEC_ELT (arg_parms, nparms)) == NULL_TREE))
3497 for (i = 0; i < nparms; ++i)
3499 parm = TREE_VALUE (TREE_VEC_ELT (parm_parms, i));
3500 arg = TREE_VALUE (TREE_VEC_ELT (arg_parms, i));
3502 if (arg == NULL_TREE || arg == error_mark_node
3503 || parm == NULL_TREE || parm == error_mark_node)
3506 if (TREE_CODE (arg) != TREE_CODE (parm))
3509 switch (TREE_CODE (parm))
3515 /* We encounter instantiations of templates like
3516 template <template <template <class> class> class TT>
3519 tree parmparm = DECL_INNERMOST_TEMPLATE_PARMS (parm);
3520 tree argparm = DECL_INNERMOST_TEMPLATE_PARMS (arg);
3522 if (!coerce_template_template_parms
3523 (parmparm, argparm, complain, in_decl, outer_args))
3529 /* The tsubst call is used to handle cases such as
3530 template <class T, template <T> class TT> class D;
3531 i.e. the parameter list of TT depends on earlier parameters. */
3533 (tsubst (TREE_TYPE (parm), outer_args, complain, in_decl),
3545 /* Convert the indicated template ARG as necessary to match the
3546 indicated template PARM. Returns the converted ARG, or
3547 error_mark_node if the conversion was unsuccessful. Error and
3548 warning messages are issued under control of COMPLAIN. This
3549 conversion is for the Ith parameter in the parameter list. ARGS is
3550 the full set of template arguments deduced so far. */
3553 convert_template_argument (tree parm,
3556 tsubst_flags_t complain,
3562 int is_type, requires_type, is_tmpl_type, requires_tmpl_type;
3564 inner_args = INNERMOST_TEMPLATE_ARGS (args);
3566 if (TREE_CODE (arg) == TREE_LIST
3567 && TREE_CODE (TREE_VALUE (arg)) == OFFSET_REF)
3569 /* The template argument was the name of some
3570 member function. That's usually
3571 invalid, but static members are OK. In any
3572 case, grab the underlying fields/functions
3573 and issue an error later if required. */
3574 arg = TREE_VALUE (arg);
3575 TREE_TYPE (arg) = unknown_type_node;
3578 requires_tmpl_type = TREE_CODE (parm) == TEMPLATE_DECL;
3579 requires_type = (TREE_CODE (parm) == TYPE_DECL
3580 || requires_tmpl_type);
3582 is_tmpl_type = ((TREE_CODE (arg) == TEMPLATE_DECL
3583 && TREE_CODE (DECL_TEMPLATE_RESULT (arg)) == TYPE_DECL)
3584 || TREE_CODE (arg) == TEMPLATE_TEMPLATE_PARM
3585 || TREE_CODE (arg) == UNBOUND_CLASS_TEMPLATE);
3588 && (TREE_CODE (arg) == TEMPLATE_TEMPLATE_PARM
3589 || TREE_CODE (arg) == UNBOUND_CLASS_TEMPLATE))
3590 arg = TYPE_STUB_DECL (arg);
3592 is_type = TYPE_P (arg) || is_tmpl_type;
3594 if (requires_type && ! is_type && TREE_CODE (arg) == SCOPE_REF
3595 && TREE_CODE (TREE_OPERAND (arg, 0)) == TEMPLATE_TYPE_PARM)
3597 pedwarn ("to refer to a type member of a template parameter, use `typename %E'", arg);
3599 arg = make_typename_type (TREE_OPERAND (arg, 0),
3600 TREE_OPERAND (arg, 1),
3601 complain & tf_error);
3604 if (is_type != requires_type)
3608 if (complain & tf_error)
3610 error ("type/value mismatch at argument %d in template parameter list for `%D'",
3613 error (" expected a constant of type `%T', got `%T'",
3615 (is_tmpl_type ? DECL_NAME (arg) : arg));
3616 else if (requires_tmpl_type)
3617 error (" expected a class template, got `%E'", arg);
3619 error (" expected a type, got `%E'", arg);
3622 return error_mark_node;
3624 if (is_tmpl_type ^ requires_tmpl_type)
3626 if (in_decl && (complain & tf_error))
3628 error ("type/value mismatch at argument %d in template parameter list for `%D'",
3631 error (" expected a type, got `%T'", DECL_NAME (arg));
3633 error (" expected a class template, got `%T'", arg);
3635 return error_mark_node;
3640 if (requires_tmpl_type)
3642 if (TREE_CODE (TREE_TYPE (arg)) == UNBOUND_CLASS_TEMPLATE)
3643 /* The number of argument required is not known yet.
3644 Just accept it for now. */
3645 val = TREE_TYPE (arg);
3648 tree parmparm = DECL_INNERMOST_TEMPLATE_PARMS (parm);
3649 tree argparm = DECL_INNERMOST_TEMPLATE_PARMS (arg);
3651 if (coerce_template_template_parms (parmparm, argparm,
3657 /* TEMPLATE_TEMPLATE_PARM node is preferred over
3659 if (val != error_mark_node
3660 && DECL_TEMPLATE_TEMPLATE_PARM_P (val))
3661 val = TREE_TYPE (val);
3665 if (in_decl && (complain & tf_error))
3667 error ("type/value mismatch at argument %d in template parameter list for `%D'",
3669 error (" expected a template of type `%D', got `%D'", parm, arg);
3672 val = error_mark_node;
3677 val = groktypename (arg);
3681 tree t = tsubst (TREE_TYPE (parm), args, complain, in_decl);
3683 if (invalid_nontype_parm_type_p (t, complain))
3684 return error_mark_node;
3686 if (!uses_template_parms (arg) && !uses_template_parms (t))
3687 /* We used to call digest_init here. However, digest_init
3688 will report errors, which we don't want when complain
3689 is zero. More importantly, digest_init will try too
3690 hard to convert things: for example, `0' should not be
3691 converted to pointer type at this point according to
3692 the standard. Accepting this is not merely an
3693 extension, since deciding whether or not these
3694 conversions can occur is part of determining which
3695 function template to call, or whether a given explicit
3696 argument specification is valid. */
3697 val = convert_nontype_argument (t, arg);
3701 if (val == NULL_TREE)
3702 val = error_mark_node;
3703 else if (val == error_mark_node && (complain & tf_error))
3704 error ("could not convert template argument `%E' to `%T'",
3711 /* Convert all template arguments to their appropriate types, and
3712 return a vector containing the innermost resulting template
3713 arguments. If any error occurs, return error_mark_node. Error and
3714 warning messages are issued under control of COMPLAIN.
3716 If REQUIRE_ALL_ARGUMENTS is nonzero, all arguments must be
3717 provided in ARGLIST, or else trailing parameters must have default
3718 values. If REQUIRE_ALL_ARGUMENTS is zero, we will attempt argument
3719 deduction for any unspecified trailing arguments. */
3722 coerce_template_parms (tree parms,
3725 tsubst_flags_t complain,
3726 int require_all_arguments)
3728 int nparms, nargs, i, lost = 0;
3731 tree new_inner_args;
3733 inner_args = INNERMOST_TEMPLATE_ARGS (args);
3734 nargs = inner_args ? NUM_TMPL_ARGS (inner_args) : 0;
3735 nparms = TREE_VEC_LENGTH (parms);
3739 && require_all_arguments
3740 && TREE_PURPOSE (TREE_VEC_ELT (parms, nargs)) == NULL_TREE))
3742 if (complain & tf_error)
3744 error ("wrong number of template arguments (%d, should be %d)",
3748 cp_error_at ("provided for `%D'", in_decl);
3751 return error_mark_node;
3754 new_inner_args = make_tree_vec (nparms);
3755 new_args = add_outermost_template_args (args, new_inner_args);
3756 for (i = 0; i < nparms; i++)
3761 /* Get the Ith template parameter. */
3762 parm = TREE_VEC_ELT (parms, i);
3764 /* Calculate the Ith argument. */
3766 arg = TREE_VEC_ELT (inner_args, i);
3767 else if (require_all_arguments)
3768 /* There must be a default arg in this case. */
3769 arg = tsubst_template_arg (TREE_PURPOSE (parm), new_args,
3774 my_friendly_assert (arg, 20030727);
3775 if (arg == error_mark_node)
3776 error ("template argument %d is invalid", i + 1);
3778 arg = convert_template_argument (TREE_VALUE (parm),
3779 arg, new_args, complain, i,
3782 if (arg == error_mark_node)
3784 TREE_VEC_ELT (new_inner_args, i) = arg;
3788 return error_mark_node;
3790 return new_inner_args;
3793 /* Returns 1 if template args OT and NT are equivalent. */
3796 template_args_equal (tree ot, tree nt)
3801 if (TREE_CODE (nt) == TREE_VEC)
3802 /* For member templates */
3803 return TREE_CODE (ot) == TREE_VEC && comp_template_args (ot, nt);
3804 else if (TYPE_P (nt))
3805 return TYPE_P (ot) && same_type_p (ot, nt);
3806 else if (TREE_CODE (ot) == TREE_VEC || TYPE_P (ot))
3809 return cp_tree_equal (ot, nt);
3812 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets
3813 of template arguments. Returns 0 otherwise. */
3816 comp_template_args (tree oldargs, tree newargs)
3820 if (TREE_VEC_LENGTH (oldargs) != TREE_VEC_LENGTH (newargs))
3823 for (i = 0; i < TREE_VEC_LENGTH (oldargs); ++i)
3825 tree nt = TREE_VEC_ELT (newargs, i);
3826 tree ot = TREE_VEC_ELT (oldargs, i);
3828 if (! template_args_equal (ot, nt))
3834 /* Given class template name and parameter list, produce a user-friendly name
3835 for the instantiation. */
3838 mangle_class_name_for_template (const char* name, tree parms, tree arglist)
3840 static struct obstack scratch_obstack;
3841 static char *scratch_firstobj;
3844 if (!scratch_firstobj)
3845 gcc_obstack_init (&scratch_obstack);
3847 obstack_free (&scratch_obstack, scratch_firstobj);
3848 scratch_firstobj = obstack_alloc (&scratch_obstack, 1);
3850 #define ccat(C) obstack_1grow (&scratch_obstack, (C));
3851 #define cat(S) obstack_grow (&scratch_obstack, (S), strlen (S))
3855 nparms = TREE_VEC_LENGTH (parms);
3856 arglist = INNERMOST_TEMPLATE_ARGS (arglist);
3857 my_friendly_assert (nparms == TREE_VEC_LENGTH (arglist), 268);
3858 for (i = 0; i < nparms; i++)
3860 tree parm = TREE_VALUE (TREE_VEC_ELT (parms, i));
3861 tree arg = TREE_VEC_ELT (arglist, i);
3866 if (TREE_CODE (parm) == TYPE_DECL)
3868 cat (type_as_string (arg, TFF_CHASE_TYPEDEF));
3871 else if (TREE_CODE (parm) == TEMPLATE_DECL)
3873 if (TREE_CODE (arg) == TEMPLATE_DECL)
3875 /* Already substituted with real template. Just output
3876 the template name here */
3877 tree context = DECL_CONTEXT (arg);
3880 /* The template may be defined in a namespace, or
3881 may be a member template. */
3882 my_friendly_assert (TREE_CODE (context) == NAMESPACE_DECL
3883 || CLASS_TYPE_P (context),
3885 cat(decl_as_string (DECL_CONTEXT (arg), TFF_PLAIN_IDENTIFIER));
3888 cat (IDENTIFIER_POINTER (DECL_NAME (arg)));
3891 /* Output the parameter declaration */
3892 cat (type_as_string (arg, TFF_CHASE_TYPEDEF));
3896 my_friendly_assert (TREE_CODE (parm) == PARM_DECL, 269);
3898 /* No need to check arglist against parmlist here; we did that
3899 in coerce_template_parms, called from lookup_template_class. */
3900 cat (expr_as_string (arg, TFF_PLAIN_IDENTIFIER));
3903 char *bufp = obstack_next_free (&scratch_obstack);
3905 while (bufp[offset - 1] == ' ')
3907 obstack_blank_fast (&scratch_obstack, offset);
3909 /* B<C<char> >, not B<C<char>> */
3910 if (bufp[offset - 1] == '>')
3915 return (char *) obstack_base (&scratch_obstack);
3919 classtype_mangled_name (tree t)
3921 if (CLASSTYPE_TEMPLATE_INFO (t)
3922 /* Specializations have already had their names set up in
3923 lookup_template_class. */
3924 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (t))
3926 tree tmpl = most_general_template (CLASSTYPE_TI_TEMPLATE (t));
3928 /* For non-primary templates, the template parameters are
3929 implicit from their surrounding context. */
3930 if (PRIMARY_TEMPLATE_P (tmpl))
3932 tree name = DECL_NAME (tmpl);
3933 char *mangled_name = mangle_class_name_for_template
3934 (IDENTIFIER_POINTER (name),
3935 DECL_INNERMOST_TEMPLATE_PARMS (tmpl),
3936 CLASSTYPE_TI_ARGS (t));
3937 tree id = get_identifier (mangled_name);
3938 IDENTIFIER_TEMPLATE (id) = name;
3943 return TYPE_IDENTIFIER (t);
3947 add_pending_template (tree d)
3949 tree ti = (TYPE_P (d)
3950 ? CLASSTYPE_TEMPLATE_INFO (d)
3951 : DECL_TEMPLATE_INFO (d));
3955 if (TI_PENDING_TEMPLATE_FLAG (ti))
3958 /* We are called both from instantiate_decl, where we've already had a
3959 tinst_level pushed, and instantiate_template, where we haven't.
3961 level = !(current_tinst_level && TINST_DECL (current_tinst_level) == d);
3964 push_tinst_level (d);
3966 pt = tree_cons (current_tinst_level, d, NULL_TREE);
3967 if (last_pending_template)
3968 TREE_CHAIN (last_pending_template) = pt;
3970 pending_templates = pt;
3972 last_pending_template = pt;
3974 TI_PENDING_TEMPLATE_FLAG (ti) = 1;
3981 /* Return a TEMPLATE_ID_EXPR corresponding to the indicated FNS and
3982 ARGLIST. Valid choices for FNS are given in the cp-tree.def
3983 documentation for TEMPLATE_ID_EXPR. */
3986 lookup_template_function (tree fns, tree arglist)
3990 if (fns == error_mark_node || arglist == error_mark_node)
3991 return error_mark_node;
3993 my_friendly_assert (!arglist || TREE_CODE (arglist) == TREE_VEC, 20030726);
3994 if (fns == NULL_TREE
3995 || TREE_CODE (fns) == FUNCTION_DECL)
3997 error ("non-template used as template");
3998 return error_mark_node;
4001 my_friendly_assert (TREE_CODE (fns) == TEMPLATE_DECL
4002 || TREE_CODE (fns) == OVERLOAD
4004 || TREE_CODE (fns) == IDENTIFIER_NODE,
4007 if (BASELINK_P (fns))
4009 BASELINK_FUNCTIONS (fns) = build (TEMPLATE_ID_EXPR,
4011 BASELINK_FUNCTIONS (fns),
4016 type = TREE_TYPE (fns);
4017 if (TREE_CODE (fns) == OVERLOAD || !type)
4018 type = unknown_type_node;
4020 return build (TEMPLATE_ID_EXPR, type, fns, arglist);
4023 /* Within the scope of a template class S<T>, the name S gets bound
4024 (in build_self_reference) to a TYPE_DECL for the class, not a
4025 TEMPLATE_DECL. If DECL is a TYPE_DECL for current_class_type,
4026 or one of its enclosing classes, and that type is a template,
4027 return the associated TEMPLATE_DECL. Otherwise, the original
4028 DECL is returned. */
4031 maybe_get_template_decl_from_type_decl (tree decl)
4033 return (decl != NULL_TREE
4034 && TREE_CODE (decl) == TYPE_DECL
4035 && DECL_ARTIFICIAL (decl)
4036 && CLASS_TYPE_P (TREE_TYPE (decl))
4037 && CLASSTYPE_TEMPLATE_INFO (TREE_TYPE (decl)))
4038 ? CLASSTYPE_TI_TEMPLATE (TREE_TYPE (decl)) : decl;
4041 /* Given an IDENTIFIER_NODE (type TEMPLATE_DECL) and a chain of
4042 parameters, find the desired type.
4044 D1 is the PTYPENAME terminal, and ARGLIST is the list of arguments.
4046 IN_DECL, if non-NULL, is the template declaration we are trying to
4049 If ENTERING_SCOPE is nonzero, we are about to enter the scope of
4050 the class we are looking up.
4052 Issue error and warning messages under control of COMPLAIN.
4054 If the template class is really a local class in a template
4055 function, then the FUNCTION_CONTEXT is the function in which it is
4056 being instantiated. */
4059 lookup_template_class (tree d1,
4064 tsubst_flags_t complain)
4066 tree template = NULL_TREE, parmlist;
4069 timevar_push (TV_NAME_LOOKUP);
4071 if (TREE_CODE (d1) == IDENTIFIER_NODE)
4073 if (IDENTIFIER_VALUE (d1)
4074 && DECL_TEMPLATE_TEMPLATE_PARM_P (IDENTIFIER_VALUE (d1)))
4075 template = IDENTIFIER_VALUE (d1);
4079 push_decl_namespace (context);
4080 template = lookup_name (d1, /*prefer_type=*/0);
4081 template = maybe_get_template_decl_from_type_decl (template);
4083 pop_decl_namespace ();
4086 context = DECL_CONTEXT (template);
4088 else if (TREE_CODE (d1) == TYPE_DECL && IS_AGGR_TYPE (TREE_TYPE (d1)))
4090 tree type = TREE_TYPE (d1);
4092 /* If we are declaring a constructor, say A<T>::A<T>, we will get
4093 an implicit typename for the second A. Deal with it. */
4094 if (TREE_CODE (type) == TYPENAME_TYPE && TREE_TYPE (type))
4095 type = TREE_TYPE (type);
4097 if (CLASSTYPE_TEMPLATE_INFO (type))
4099 template = CLASSTYPE_TI_TEMPLATE (type);
4100 d1 = DECL_NAME (template);
4103 else if (TREE_CODE (d1) == ENUMERAL_TYPE
4104 || (TYPE_P (d1) && IS_AGGR_TYPE (d1)))
4106 template = TYPE_TI_TEMPLATE (d1);
4107 d1 = DECL_NAME (template);
4109 else if (TREE_CODE (d1) == TEMPLATE_DECL
4110 && TREE_CODE (DECL_TEMPLATE_RESULT (d1)) == TYPE_DECL)
4113 d1 = DECL_NAME (template);
4114 context = DECL_CONTEXT (template);
4117 /* With something like `template <class T> class X class X { ... };'
4118 we could end up with D1 having nothing but an IDENTIFIER_VALUE.
4119 We don't want to do that, but we have to deal with the situation,
4120 so let's give them some syntax errors to chew on instead of a
4121 crash. Alternatively D1 might not be a template type at all. */
4124 if (complain & tf_error)
4125 error ("`%T' is not a template", d1);
4126 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node);
4129 if (TREE_CODE (template) != TEMPLATE_DECL
4130 /* Make sure it's a user visible template, if it was named by
4132 || ((complain & tf_user) && !DECL_TEMPLATE_PARM_P (template)
4133 && !PRIMARY_TEMPLATE_P (template)))
4135 if (complain & tf_error)
4137 error ("non-template type `%T' used as a template", d1);
4139 cp_error_at ("for template declaration `%D'", in_decl);
4141 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node);
4144 complain &= ~tf_user;
4146 if (DECL_TEMPLATE_TEMPLATE_PARM_P (template))
4148 /* Create a new TEMPLATE_DECL and TEMPLATE_TEMPLATE_PARM node to store
4149 template arguments */
4154 parmlist = DECL_INNERMOST_TEMPLATE_PARMS (template);
4156 /* Consider an example where a template template parameter declared as
4158 template <class T, class U = std::allocator<T> > class TT
4160 The template parameter level of T and U are one level larger than
4161 of TT. To proper process the default argument of U, say when an
4162 instantiation `TT<int>' is seen, we need to build the full
4163 arguments containing {int} as the innermost level. Outer levels,
4164 available when not appearing as default template argument, can be
4165 obtained from `current_template_args ()'.
4167 Suppose that TT is later substituted with std::vector. The above
4168 instantiation is `TT<int, std::allocator<T> >' with TT at
4169 level 1, and T at level 2, while the template arguments at level 1
4170 becomes {std::vector} and the inner level 2 is {int}. */
4172 if (current_template_parms)
4173 arglist = add_to_template_args (current_template_args (), arglist);
4175 arglist2 = coerce_template_parms (parmlist, arglist, template,
4176 complain, /*require_all_args=*/1);
4177 if (arglist2 == error_mark_node
4178 || (!uses_template_parms (arglist2)
4179 && check_instantiated_args (template, arglist2, complain)))
4180 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node);
4182 parm = bind_template_template_parm (TREE_TYPE (template), arglist2);
4183 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, parm);
4187 tree template_type = TREE_TYPE (template);
4190 tree found = NULL_TREE;
4194 int is_partial_instantiation;
4196 gen_tmpl = most_general_template (template);
4197 parmlist = DECL_TEMPLATE_PARMS (gen_tmpl);
4198 parm_depth = TMPL_PARMS_DEPTH (parmlist);
4199 arg_depth = TMPL_ARGS_DEPTH (arglist);
4201 if (arg_depth == 1 && parm_depth > 1)
4203 /* We've been given an incomplete set of template arguments.
4206 template <class T> struct S1 {
4207 template <class U> struct S2 {};
4208 template <class U> struct S2<U*> {};
4211 we will be called with an ARGLIST of `U*', but the
4212 TEMPLATE will be `template <class T> template
4213 <class U> struct S1<T>::S2'. We must fill in the missing
4216 = add_outermost_template_args (TYPE_TI_ARGS (TREE_TYPE (template)),
4218 arg_depth = TMPL_ARGS_DEPTH (arglist);
4221 /* Now we should have enough arguments. */
4222 my_friendly_assert (parm_depth == arg_depth, 0);
4224 /* From here on, we're only interested in the most general
4226 template = gen_tmpl;
4228 /* Calculate the BOUND_ARGS. These will be the args that are
4229 actually tsubst'd into the definition to create the
4233 /* We have multiple levels of arguments to coerce, at once. */
4235 int saved_depth = TMPL_ARGS_DEPTH (arglist);
4237 tree bound_args = make_tree_vec (parm_depth);
4239 for (i = saved_depth,
4240 t = DECL_TEMPLATE_PARMS (template);
4241 i > 0 && t != NULL_TREE;
4242 --i, t = TREE_CHAIN (t))
4244 tree a = coerce_template_parms (TREE_VALUE (t),
4246 complain, /*require_all_args=*/1);
4248 /* Don't process further if one of the levels fails. */
4249 if (a == error_mark_node)
4251 /* Restore the ARGLIST to its full size. */
4252 TREE_VEC_LENGTH (arglist) = saved_depth;
4253 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node);
4256 SET_TMPL_ARGS_LEVEL (bound_args, i, a);
4258 /* We temporarily reduce the length of the ARGLIST so
4259 that coerce_template_parms will see only the arguments
4260 corresponding to the template parameters it is
4262 TREE_VEC_LENGTH (arglist)--;
4265 /* Restore the ARGLIST to its full size. */
4266 TREE_VEC_LENGTH (arglist) = saved_depth;
4268 arglist = bound_args;
4272 = coerce_template_parms (INNERMOST_TEMPLATE_PARMS (parmlist),
4273 INNERMOST_TEMPLATE_ARGS (arglist),
4275 complain, /*require_all_args=*/1);
4277 if (arglist == error_mark_node
4278 || (!uses_template_parms (INNERMOST_TEMPLATE_ARGS (arglist))
4279 && check_instantiated_args (template,
4280 INNERMOST_TEMPLATE_ARGS (arglist),
4282 /* We were unable to bind the arguments. */
4283 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node);
4285 /* In the scope of a template class, explicit references to the
4286 template class refer to the type of the template, not any
4287 instantiation of it. For example, in:
4289 template <class T> class C { void f(C<T>); }
4291 the `C<T>' is just the same as `C'. Outside of the
4292 class, however, such a reference is an instantiation. */
4293 if (comp_template_args (TYPE_TI_ARGS (template_type),
4296 found = template_type;
4298 if (!entering_scope && PRIMARY_TEMPLATE_P (template))
4302 for (ctx = current_class_type;
4303 ctx && TREE_CODE (ctx) != NAMESPACE_DECL;
4305 ? TYPE_CONTEXT (ctx)
4306 : DECL_CONTEXT (ctx)))
4307 if (TYPE_P (ctx) && same_type_p (ctx, template_type))
4310 /* We're not in the scope of the class, so the
4311 TEMPLATE_TYPE is not the type we want after all. */
4317 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, found);
4319 for (tp = &DECL_TEMPLATE_INSTANTIATIONS (template);
4321 tp = &TREE_CHAIN (*tp))
4322 if (comp_template_args (TREE_PURPOSE (*tp), arglist))
4326 /* Use the move-to-front heuristic to speed up future
4328 *tp = TREE_CHAIN (*tp);
4330 = DECL_TEMPLATE_INSTANTIATIONS (template);
4331 DECL_TEMPLATE_INSTANTIATIONS (template) = found;
4333 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, TREE_VALUE (found));
4336 /* This type is a "partial instantiation" if any of the template
4337 arguments still involve template parameters. Note that we set
4338 IS_PARTIAL_INSTANTIATION for partial specializations as
4340 is_partial_instantiation = uses_template_parms (arglist);
4342 if (!is_partial_instantiation
4343 && !PRIMARY_TEMPLATE_P (template)
4344 && TREE_CODE (CP_DECL_CONTEXT (template)) == NAMESPACE_DECL)
4346 found = xref_tag_from_type (TREE_TYPE (template),
4347 DECL_NAME (template),
4349 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, found);
4352 context = tsubst (DECL_CONTEXT (template), arglist,
4355 context = global_namespace;
4357 /* Create the type. */
4358 if (TREE_CODE (template_type) == ENUMERAL_TYPE)
4360 if (!is_partial_instantiation)
4362 set_current_access_from_decl (TYPE_NAME (template_type));
4363 t = start_enum (TYPE_IDENTIFIER (template_type));
4366 /* We don't want to call start_enum for this type, since
4367 the values for the enumeration constants may involve
4368 template parameters. And, no one should be interested
4369 in the enumeration constants for such a type. */
4370 t = make_node (ENUMERAL_TYPE);
4374 t = make_aggr_type (TREE_CODE (template_type));
4375 CLASSTYPE_DECLARED_CLASS (t)
4376 = CLASSTYPE_DECLARED_CLASS (template_type);
4377 SET_CLASSTYPE_IMPLICIT_INSTANTIATION (t);
4378 TYPE_FOR_JAVA (t) = TYPE_FOR_JAVA (template_type);
4380 /* A local class. Make sure the decl gets registered properly. */
4381 if (context == current_function_decl)
4382 pushtag (DECL_NAME (template), t, 0);
4385 /* If we called start_enum or pushtag above, this information
4386 will already be set up. */
4389 TYPE_CONTEXT (t) = FROB_CONTEXT (context);
4391 type_decl = create_implicit_typedef (DECL_NAME (template), t);
4392 DECL_CONTEXT (type_decl) = TYPE_CONTEXT (t);
4393 TYPE_STUB_DECL (t) = type_decl;
4394 DECL_SOURCE_LOCATION (type_decl)
4395 = DECL_SOURCE_LOCATION (TYPE_STUB_DECL (template_type));
4398 type_decl = TYPE_NAME (t);
4400 TREE_PRIVATE (type_decl)
4401 = TREE_PRIVATE (TYPE_STUB_DECL (template_type));
4402 TREE_PROTECTED (type_decl)
4403 = TREE_PROTECTED (TYPE_STUB_DECL (template_type));
4405 /* Set up the template information. We have to figure out which
4406 template is the immediate parent if this is a full
4408 if (parm_depth == 1 || is_partial_instantiation
4409 || !PRIMARY_TEMPLATE_P (template))
4410 /* This case is easy; there are no member templates involved. */
4414 /* This is a full instantiation of a member template. Look
4415 for a partial instantiation of which this is an instance. */
4417 for (found = DECL_TEMPLATE_INSTANTIATIONS (template);
4418 found; found = TREE_CHAIN (found))
4421 tree tmpl = CLASSTYPE_TI_TEMPLATE (TREE_VALUE (found));
4423 /* We only want partial instantiations, here, not
4424 specializations or full instantiations. */
4425 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_VALUE (found))
4426 || !uses_template_parms (TREE_VALUE (found)))
4429 /* Temporarily reduce by one the number of levels in the
4430 ARGLIST and in FOUND so as to avoid comparing the
4431 last set of arguments. */
4432 TREE_VEC_LENGTH (arglist)--;
4433 TREE_VEC_LENGTH (TREE_PURPOSE (found)) --;
4435 /* See if the arguments match. If they do, then TMPL is
4436 the partial instantiation we want. */
4437 success = comp_template_args (TREE_PURPOSE (found), arglist);
4439 /* Restore the argument vectors to their full size. */
4440 TREE_VEC_LENGTH (arglist)++;
4441 TREE_VEC_LENGTH (TREE_PURPOSE (found))++;
4452 /* There was no partial instantiation. This happens
4453 where C<T> is a member template of A<T> and it's used
4456 template <typename T> struct B { A<T>::C<int> m; };
4459 Create the partial instantiation.
4461 TREE_VEC_LENGTH (arglist)--;
4462 found = tsubst (template, arglist, complain, NULL_TREE);
4463 TREE_VEC_LENGTH (arglist)++;
4467 SET_TYPE_TEMPLATE_INFO (t, tree_cons (found, arglist, NULL_TREE));
4468 DECL_TEMPLATE_INSTANTIATIONS (template)
4469 = tree_cons (arglist, t,
4470 DECL_TEMPLATE_INSTANTIATIONS (template));
4472 if (TREE_CODE (t) == ENUMERAL_TYPE
4473 && !is_partial_instantiation)
4474 /* Now that the type has been registered on the instantiations
4475 list, we set up the enumerators. Because the enumeration
4476 constants may involve the enumeration type itself, we make
4477 sure to register the type first, and then create the
4478 constants. That way, doing tsubst_expr for the enumeration
4479 constants won't result in recursive calls here; we'll find
4480 the instantiation and exit above. */
4481 tsubst_enum (template_type, t, arglist);
4483 /* Reset the name of the type, now that CLASSTYPE_TEMPLATE_INFO
4485 if (TREE_CODE (t) != ENUMERAL_TYPE)
4486 DECL_NAME (type_decl) = classtype_mangled_name (t);
4487 if (!is_partial_instantiation)
4489 /* For backwards compatibility; code that uses
4490 -fexternal-templates expects looking up a template to
4491 instantiate it. I think DDD still relies on this.
4492 (jason 8/20/1998) */
4493 if (TREE_CODE (t) != ENUMERAL_TYPE
4494 && flag_external_templates
4495 && CLASSTYPE_INTERFACE_KNOWN (TREE_TYPE (template))
4496 && ! CLASSTYPE_INTERFACE_ONLY (TREE_TYPE (template)))
4497 add_pending_template (t);
4500 /* If the type makes use of template parameters, the
4501 code that generates debugging information will crash. */
4502 DECL_IGNORED_P (TYPE_STUB_DECL (t)) = 1;
4504 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, t);
4506 timevar_pop (TV_NAME_LOOKUP);
4516 /* Called from for_each_template_parm via walk_tree. */
4519 for_each_template_parm_r (tree* tp, int* walk_subtrees, void* d)
4522 struct pair_fn_data *pfd = (struct pair_fn_data *) d;
4523 tree_fn_t fn = pfd->fn;
4524 void *data = pfd->data;
4527 /* If we have already visited this tree, there's no need to walk
4528 subtrees. Otherwise, add it to the visited table. */
4529 slot = htab_find_slot (pfd->visited, *tp, INSERT);
4538 && for_each_template_parm (TYPE_CONTEXT (t), fn, data, pfd->visited))
4539 return error_mark_node;
4541 switch (TREE_CODE (t))
4544 if (TYPE_PTRMEMFUNC_P (t))
4550 if (!TYPE_TEMPLATE_INFO (t))
4552 else if (for_each_template_parm (TREE_VALUE (TYPE_TEMPLATE_INFO (t)),
4553 fn, data, pfd->visited))
4554 return error_mark_node;
4558 /* Since we're not going to walk subtrees, we have to do this
4560 if (for_each_template_parm (TYPE_METHOD_BASETYPE (t), fn, data,
4562 return error_mark_node;
4566 /* Check the return type. */
4567 if (for_each_template_parm (TREE_TYPE (t), fn, data, pfd->visited))
4568 return error_mark_node;
4570 /* Check the parameter types. Since default arguments are not
4571 instantiated until they are needed, the TYPE_ARG_TYPES may
4572 contain expressions that involve template parameters. But,
4573 no-one should be looking at them yet. And, once they're
4574 instantiated, they don't contain template parameters, so
4575 there's no point in looking at them then, either. */
4579 for (parm = TYPE_ARG_TYPES (t); parm; parm = TREE_CHAIN (parm))
4580 if (for_each_template_parm (TREE_VALUE (parm), fn, data,
4582 return error_mark_node;
4584 /* Since we've already handled the TYPE_ARG_TYPES, we don't
4585 want walk_tree walking into them itself. */
4591 if (for_each_template_parm (TYPE_FIELDS (t), fn, data,
4593 return error_mark_node;
4598 if (DECL_LANG_SPECIFIC (t) && DECL_TEMPLATE_INFO (t)
4599 && for_each_template_parm (DECL_TI_ARGS (t), fn, data,
4601 return error_mark_node;
4606 if (TREE_CODE (t) == CONST_DECL && DECL_TEMPLATE_PARM_P (t)
4607 && for_each_template_parm (DECL_INITIAL (t), fn, data,
4609 return error_mark_node;
4610 if (DECL_CONTEXT (t)
4611 && for_each_template_parm (DECL_CONTEXT (t), fn, data,
4613 return error_mark_node;
4616 case BOUND_TEMPLATE_TEMPLATE_PARM:
4617 /* Record template parameters such as `T' inside `TT<T>'. */
4618 if (for_each_template_parm (TYPE_TI_ARGS (t), fn, data, pfd->visited))
4619 return error_mark_node;
4622 case TEMPLATE_TEMPLATE_PARM:
4623 case TEMPLATE_TYPE_PARM:
4624 case TEMPLATE_PARM_INDEX:
4625 if (fn && (*fn)(t, data))
4626 return error_mark_node;
4628 return error_mark_node;
4632 /* A template template parameter is encountered */
4633 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t)
4634 && for_each_template_parm (TREE_TYPE (t), fn, data, pfd->visited))
4635 return error_mark_node;
4637 /* Already substituted template template parameter */
4643 || for_each_template_parm (TYPENAME_TYPE_FULLNAME (t), fn,
4644 data, pfd->visited))
4645 return error_mark_node;
4649 if (TREE_TYPE (t) && TYPE_PTRMEMFUNC_P (TREE_TYPE (t))
4650 && for_each_template_parm (TYPE_PTRMEMFUNC_FN_TYPE
4651 (TREE_TYPE (t)), fn, data,
4653 return error_mark_node;
4658 /* If there's no type, then this thing must be some expression
4659 involving template parameters. */
4660 if (!fn && !TREE_TYPE (t))
4661 return error_mark_node;
4666 case REINTERPRET_CAST_EXPR:
4667 case CONST_CAST_EXPR:
4668 case STATIC_CAST_EXPR:
4669 case DYNAMIC_CAST_EXPR:
4673 case PSEUDO_DTOR_EXPR:
4675 return error_mark_node;
4679 /* If we do not handle this case specially, we end up walking
4680 the BINFO hierarchy, which is circular, and therefore
4681 confuses walk_tree. */
4683 if (for_each_template_parm (BASELINK_FUNCTIONS (*tp), fn, data,
4685 return error_mark_node;
4692 /* We didn't find any template parameters we liked. */
4696 /* For each TEMPLATE_TYPE_PARM, TEMPLATE_TEMPLATE_PARM,
4697 BOUND_TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX in T,
4698 call FN with the parameter and the DATA.
4699 If FN returns nonzero, the iteration is terminated, and
4700 for_each_template_parm returns 1. Otherwise, the iteration
4701 continues. If FN never returns a nonzero value, the value
4702 returned by for_each_template_parm is 0. If FN is NULL, it is
4703 considered to be the function which always returns 1. */
4706 for_each_template_parm (tree t, tree_fn_t fn, void* data, htab_t visited)
4708 struct pair_fn_data pfd;
4715 /* Walk the tree. (Conceptually, we would like to walk without
4716 duplicates, but for_each_template_parm_r recursively calls
4717 for_each_template_parm, so we would need to reorganize a fair
4718 bit to use walk_tree_without_duplicates, so we keep our own
4721 pfd.visited = visited;
4723 pfd.visited = htab_create (37, htab_hash_pointer, htab_eq_pointer,
4725 result = walk_tree (&t,
4726 for_each_template_parm_r,
4732 htab_delete (pfd.visited);
4737 /* Returns true if T depends on any template parameter. */
4740 uses_template_parms (tree t)
4742 return for_each_template_parm (t, 0, 0, NULL);
4745 /* Returns true if T depends on any template parameter with level LEVEL. */
4748 uses_template_parms_level (tree t, int level)
4750 return for_each_template_parm (t, template_parm_this_level_p, &level, NULL);
4753 static int tinst_depth;
4754 extern int max_tinst_depth;
4755 #ifdef GATHER_STATISTICS
4758 static int tinst_level_tick;
4759 static int last_template_error_tick;
4761 /* We're starting to instantiate D; record the template instantiation context
4762 for diagnostics and to restore it later. */
4765 push_tinst_level (tree d)
4769 if (tinst_depth >= max_tinst_depth)
4771 /* If the instantiation in question still has unbound template parms,
4772 we don't really care if we can't instantiate it, so just return.
4773 This happens with base instantiation for implicit `typename'. */
4774 if (uses_template_parms (d))
4777 last_template_error_tick = tinst_level_tick;
4778 error ("template instantiation depth exceeds maximum of %d (use -ftemplate-depth-NN to increase the maximum) instantiating `%D'",
4779 max_tinst_depth, d);
4781 print_instantiation_context ();
4786 new = build_expr_wfl (d, input_filename, input_line, 0);
4787 TREE_CHAIN (new) = current_tinst_level;
4788 current_tinst_level = new;
4791 #ifdef GATHER_STATISTICS
4792 if (tinst_depth > depth_reached)
4793 depth_reached = tinst_depth;
4800 /* We're done instantiating this template; return to the instantiation
4804 pop_tinst_level (void)
4806 tree old = current_tinst_level;
4808 /* Restore the filename and line number stashed away when we started
4809 this instantiation. */
4810 input_line = TINST_LINE (old);
4811 input_filename = TINST_FILE (old);
4812 extract_interface_info ();
4814 current_tinst_level = TREE_CHAIN (old);
4819 /* We're instantiating a deferred template; restore the template
4820 instantiation context in which the instantiation was requested, which
4821 is one step out from LEVEL. */
4824 reopen_tinst_level (tree level)
4829 for (t = level; t; t = TREE_CHAIN (t))
4832 current_tinst_level = level;
4836 /* Return the outermost template instantiation context, for use with
4837 -falt-external-templates. */
4840 tinst_for_decl (void)
4842 tree p = current_tinst_level;
4845 for (; TREE_CHAIN (p) ; p = TREE_CHAIN (p))
4850 /* DECL is a friend FUNCTION_DECL or TEMPLATE_DECL. ARGS is the
4851 vector of template arguments, as for tsubst.
4853 Returns an appropriate tsubst'd friend declaration. */
4856 tsubst_friend_function (tree decl, tree args)
4859 location_t saved_loc = input_location;
4861 input_location = DECL_SOURCE_LOCATION (decl);
4863 if (TREE_CODE (decl) == FUNCTION_DECL
4864 && DECL_TEMPLATE_INSTANTIATION (decl)
4865 && TREE_CODE (DECL_TI_TEMPLATE (decl)) != TEMPLATE_DECL)
4866 /* This was a friend declared with an explicit template
4867 argument list, e.g.:
4871 to indicate that f was a template instantiation, not a new
4872 function declaration. Now, we have to figure out what
4873 instantiation of what template. */
4875 tree template_id, arglist, fns;
4878 tree ns = decl_namespace_context (TYPE_MAIN_DECL (current_class_type));
4880 /* Friend functions are looked up in the containing namespace scope.
4881 We must enter that scope, to avoid finding member functions of the
4882 current cless with same name. */
4883 push_nested_namespace (ns);
4884 fns = tsubst_expr (DECL_TI_TEMPLATE (decl), args,
4885 tf_error | tf_warning, NULL_TREE);
4886 pop_nested_namespace (ns);
4887 arglist = tsubst (DECL_TI_ARGS (decl), args,
4888 tf_error | tf_warning, NULL_TREE);
4889 template_id = lookup_template_function (fns, arglist);
4891 new_friend = tsubst (decl, args, tf_error | tf_warning, NULL_TREE);
4892 tmpl = determine_specialization (template_id, new_friend,
4894 /*need_member_template=*/0);
4895 new_friend = instantiate_template (tmpl, new_args, tf_error);
4899 new_friend = tsubst (decl, args, tf_error | tf_warning, NULL_TREE);
4901 /* The NEW_FRIEND will look like an instantiation, to the
4902 compiler, but is not an instantiation from the point of view of
4903 the language. For example, we might have had:
4905 template <class T> struct S {
4906 template <class U> friend void f(T, U);
4909 Then, in S<int>, template <class U> void f(int, U) is not an
4910 instantiation of anything. */
4911 DECL_USE_TEMPLATE (new_friend) = 0;
4912 if (TREE_CODE (decl) == TEMPLATE_DECL)
4914 DECL_USE_TEMPLATE (DECL_TEMPLATE_RESULT (new_friend)) = 0;
4915 DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (new_friend))
4916 = DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (decl));
4919 /* The mangled name for the NEW_FRIEND is incorrect. The function
4920 is not a template instantiation and should not be mangled like
4921 one. Therefore, we forget the mangling here; we'll recompute it
4922 later if we need it. */
4923 if (TREE_CODE (new_friend) != TEMPLATE_DECL)
4925 SET_DECL_RTL (new_friend, NULL_RTX);
4926 SET_DECL_ASSEMBLER_NAME (new_friend, NULL_TREE);
4929 if (DECL_NAMESPACE_SCOPE_P (new_friend))
4932 tree new_friend_template_info;
4933 tree new_friend_result_template_info;
4935 int new_friend_is_defn;
4937 /* We must save some information from NEW_FRIEND before calling
4938 duplicate decls since that function will free NEW_FRIEND if
4940 new_friend_template_info = DECL_TEMPLATE_INFO (new_friend);
4941 if (TREE_CODE (new_friend) == TEMPLATE_DECL)
4943 /* This declaration is a `primary' template. */
4944 DECL_PRIMARY_TEMPLATE (new_friend) = new_friend;
4947 = DECL_INITIAL (DECL_TEMPLATE_RESULT (new_friend)) != NULL_TREE;
4948 new_friend_result_template_info
4949 = DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (new_friend));
4953 new_friend_is_defn = DECL_INITIAL (new_friend) != NULL_TREE;
4954 new_friend_result_template_info = NULL_TREE;
4957 /* Inside pushdecl_namespace_level, we will push into the
4958 current namespace. However, the friend function should go
4959 into the namespace of the template. */
4960 ns = decl_namespace_context (new_friend);
4961 push_nested_namespace (ns);
4962 old_decl = pushdecl_namespace_level (new_friend);
4963 pop_nested_namespace (ns);
4965 if (old_decl != new_friend)
4967 /* This new friend declaration matched an existing
4968 declaration. For example, given:
4970 template <class T> void f(T);
4971 template <class U> class C {
4972 template <class T> friend void f(T) {}
4975 the friend declaration actually provides the definition
4976 of `f', once C has been instantiated for some type. So,
4977 old_decl will be the out-of-class template declaration,
4978 while new_friend is the in-class definition.
4980 But, if `f' was called before this point, the
4981 instantiation of `f' will have DECL_TI_ARGS corresponding
4982 to `T' but not to `U', references to which might appear
4983 in the definition of `f'. Previously, the most general
4984 template for an instantiation of `f' was the out-of-class
4985 version; now it is the in-class version. Therefore, we
4986 run through all specialization of `f', adding to their
4987 DECL_TI_ARGS appropriately. In particular, they need a
4988 new set of outer arguments, corresponding to the
4989 arguments for this class instantiation.
4991 The same situation can arise with something like this:
4994 template <class T> class C {
4998 when `C<int>' is instantiated. Now, `f(int)' is defined
5001 if (!new_friend_is_defn)
5002 /* On the other hand, if the in-class declaration does
5003 *not* provide a definition, then we don't want to alter
5004 existing definitions. We can just leave everything
5009 /* Overwrite whatever template info was there before, if
5010 any, with the new template information pertaining to
5012 DECL_TEMPLATE_INFO (old_decl) = new_friend_template_info;
5014 if (TREE_CODE (old_decl) != TEMPLATE_DECL)
5015 reregister_specialization (new_friend,
5016 most_general_template (old_decl),
5021 tree new_friend_args;
5023 DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (old_decl))
5024 = new_friend_result_template_info;
5026 new_friend_args = TI_ARGS (new_friend_template_info);
5027 for (t = DECL_TEMPLATE_SPECIALIZATIONS (old_decl);
5031 tree spec = TREE_VALUE (t);
5034 = add_outermost_template_args (new_friend_args,
5035 DECL_TI_ARGS (spec));
5038 /* Now, since specializations are always supposed to
5039 hang off of the most general template, we must move
5041 t = most_general_template (old_decl);
5044 DECL_TEMPLATE_SPECIALIZATIONS (t)
5045 = chainon (DECL_TEMPLATE_SPECIALIZATIONS (t),
5046 DECL_TEMPLATE_SPECIALIZATIONS (old_decl));
5047 DECL_TEMPLATE_SPECIALIZATIONS (old_decl) = NULL_TREE;
5052 /* The information from NEW_FRIEND has been merged into OLD_DECL
5053 by duplicate_decls. */
5054 new_friend = old_decl;
5057 else if (COMPLETE_TYPE_P (DECL_CONTEXT (new_friend)))
5059 /* Check to see that the declaration is really present, and,
5060 possibly obtain an improved declaration. */
5061 tree fn = check_classfn (DECL_CONTEXT (new_friend),
5069 input_location = saved_loc;
5073 /* FRIEND_TMPL is a friend TEMPLATE_DECL. ARGS is the vector of
5074 template arguments, as for tsubst.
5076 Returns an appropriate tsubst'd friend type or error_mark_node on
5080 tsubst_friend_class (tree friend_tmpl, tree args)
5086 context = DECL_CONTEXT (friend_tmpl);
5090 if (TREE_CODE (context) == NAMESPACE_DECL)
5091 push_nested_namespace (context);
5093 push_nested_class (tsubst (context, args, tf_none, NULL_TREE));
5096 /* First, we look for a class template. */
5097 tmpl = lookup_name (DECL_NAME (friend_tmpl), /*prefer_type=*/0);
5099 /* But, if we don't find one, it might be because we're in a
5100 situation like this:
5108 Here, in the scope of (say) S<int>, `S' is bound to a TYPE_DECL
5109 for `S<int>', not the TEMPLATE_DECL. */
5110 if (!tmpl || !DECL_CLASS_TEMPLATE_P (tmpl))
5112 tmpl = lookup_name (DECL_NAME (friend_tmpl), /*prefer_type=*/1);
5113 tmpl = maybe_get_template_decl_from_type_decl (tmpl);
5116 if (tmpl && DECL_CLASS_TEMPLATE_P (tmpl))
5118 /* The friend template has already been declared. Just
5119 check to see that the declarations match, and install any new
5120 default parameters. We must tsubst the default parameters,
5121 of course. We only need the innermost template parameters
5122 because that is all that redeclare_class_template will look
5124 if (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (friend_tmpl))
5125 > TMPL_ARGS_DEPTH (args))
5128 parms = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_tmpl),
5129 args, tf_error | tf_warning);
5130 redeclare_class_template (TREE_TYPE (tmpl), parms);
5133 friend_type = TREE_TYPE (tmpl);
5137 /* The friend template has not already been declared. In this
5138 case, the instantiation of the template class will cause the
5139 injection of this template into the global scope. */
5140 tmpl = tsubst (friend_tmpl, args, tf_error | tf_warning, NULL_TREE);
5142 /* The new TMPL is not an instantiation of anything, so we
5143 forget its origins. We don't reset CLASSTYPE_TI_TEMPLATE for
5144 the new type because that is supposed to be the corresponding
5145 template decl, i.e., TMPL. */
5146 DECL_USE_TEMPLATE (tmpl) = 0;
5147 DECL_TEMPLATE_INFO (tmpl) = NULL_TREE;
5148 CLASSTYPE_USE_TEMPLATE (TREE_TYPE (tmpl)) = 0;
5149 CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl))
5150 = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl)));
5152 /* Inject this template into the global scope. */
5153 friend_type = TREE_TYPE (pushdecl_top_level (tmpl));
5158 if (TREE_CODE (context) == NAMESPACE_DECL)
5159 pop_nested_namespace (context);
5161 pop_nested_class ();
5167 /* Returns zero if TYPE cannot be completed later due to circularity.
5168 Otherwise returns one. */
5171 can_complete_type_without_circularity (tree type)
5173 if (type == NULL_TREE || type == error_mark_node)
5175 else if (COMPLETE_TYPE_P (type))
5177 else if (TREE_CODE (type) == ARRAY_TYPE && TYPE_DOMAIN (type))
5178 return can_complete_type_without_circularity (TREE_TYPE (type));
5179 else if (CLASS_TYPE_P (type)
5180 && TYPE_BEING_DEFINED (TYPE_MAIN_VARIANT (type)))
5187 instantiate_class_template (tree type)
5189 tree template, args, pattern, t, member;
5193 if (type == error_mark_node)
5194 return error_mark_node;
5196 if (TYPE_BEING_DEFINED (type)
5197 || COMPLETE_TYPE_P (type)
5198 || dependent_type_p (type))
5201 /* Figure out which template is being instantiated. */
5202 template = most_general_template (CLASSTYPE_TI_TEMPLATE (type));
5203 my_friendly_assert (TREE_CODE (template) == TEMPLATE_DECL, 279);
5205 /* Figure out which arguments are being used to do the
5207 args = CLASSTYPE_TI_ARGS (type);
5209 /* Determine what specialization of the original template to
5211 t = most_specialized_class (template, args);
5212 if (t == error_mark_node)
5214 const char *str = "candidates are:";
5215 error ("ambiguous class template instantiation for `%#T'", type);
5216 for (t = DECL_TEMPLATE_SPECIALIZATIONS (template); t;
5219 if (get_class_bindings (TREE_VALUE (t), TREE_PURPOSE (t), args))
5221 cp_error_at ("%s %+#T", str, TREE_TYPE (t));
5225 TYPE_BEING_DEFINED (type) = 1;
5226 return error_mark_node;
5230 pattern = TREE_TYPE (t);
5232 pattern = TREE_TYPE (template);
5234 /* If the template we're instantiating is incomplete, then clearly
5235 there's nothing we can do. */
5236 if (!COMPLETE_TYPE_P (pattern))
5239 /* If we've recursively instantiated too many templates, stop. */
5240 if (! push_tinst_level (type))
5243 /* Now we're really doing the instantiation. Mark the type as in
5244 the process of being defined. */
5245 TYPE_BEING_DEFINED (type) = 1;
5247 /* We may be in the middle of deferred access check. Disable
5249 push_deferring_access_checks (dk_no_deferred);
5251 maybe_push_to_top_level (uses_template_parms (type));
5255 /* This TYPE is actually an instantiation of a partial
5256 specialization. We replace the innermost set of ARGS with
5257 the arguments appropriate for substitution. For example,
5260 template <class T> struct S {};
5261 template <class T> struct S<T*> {};
5263 and supposing that we are instantiating S<int*>, ARGS will
5264 present be {int*} but we need {int}. */
5266 = get_class_bindings (TREE_VALUE (t), TREE_PURPOSE (t),
5269 /* If there were multiple levels in ARGS, replacing the
5270 innermost level would alter CLASSTYPE_TI_ARGS, which we don't
5271 want, so we make a copy first. */
5272 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args))
5274 args = copy_node (args);
5275 SET_TMPL_ARGS_LEVEL (args, TMPL_ARGS_DEPTH (args), inner_args);
5281 if (flag_external_templates)
5283 if (flag_alt_external_templates)
5285 CLASSTYPE_INTERFACE_ONLY (type) = interface_only;
5286 SET_CLASSTYPE_INTERFACE_UNKNOWN_X (type, interface_unknown);
5290 CLASSTYPE_INTERFACE_ONLY (type) = CLASSTYPE_INTERFACE_ONLY (pattern);
5291 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
5292 (type, CLASSTYPE_INTERFACE_UNKNOWN (pattern));
5297 SET_CLASSTYPE_INTERFACE_UNKNOWN (type);
5300 /* Set the input location to the template definition. This is needed
5301 if tsubsting causes an error. */
5302 input_location = DECL_SOURCE_LOCATION (TYPE_NAME (pattern));
5304 TYPE_HAS_CONSTRUCTOR (type) = TYPE_HAS_CONSTRUCTOR (pattern);
5305 TYPE_HAS_DESTRUCTOR (type) = TYPE_HAS_DESTRUCTOR (pattern);
5306 TYPE_HAS_NEW_OPERATOR (type) = TYPE_HAS_NEW_OPERATOR (pattern);
5307 TYPE_HAS_ARRAY_NEW_OPERATOR (type) = TYPE_HAS_ARRAY_NEW_OPERATOR (pattern);
5308 TYPE_GETS_DELETE (type) = TYPE_GETS_DELETE (pattern);
5309 TYPE_HAS_ASSIGN_REF (type) = TYPE_HAS_ASSIGN_REF (pattern);
5310 TYPE_HAS_CONST_ASSIGN_REF (type) = TYPE_HAS_CONST_ASSIGN_REF (pattern);
5311 TYPE_HAS_ABSTRACT_ASSIGN_REF (type) = TYPE_HAS_ABSTRACT_ASSIGN_REF (pattern);
5312 TYPE_HAS_INIT_REF (type) = TYPE_HAS_INIT_REF (pattern);
5313 TYPE_HAS_CONST_INIT_REF (type) = TYPE_HAS_CONST_INIT_REF (pattern);
5314 TYPE_HAS_DEFAULT_CONSTRUCTOR (type) = TYPE_HAS_DEFAULT_CONSTRUCTOR (pattern);
5315 TYPE_HAS_CONVERSION (type) = TYPE_HAS_CONVERSION (pattern);
5316 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (type)
5317 = TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (pattern);
5318 TYPE_USES_MULTIPLE_INHERITANCE (type)
5319 = TYPE_USES_MULTIPLE_INHERITANCE (pattern);
5320 TYPE_USES_VIRTUAL_BASECLASSES (type)
5321 = TYPE_USES_VIRTUAL_BASECLASSES (pattern);
5322 TYPE_PACKED (type) = TYPE_PACKED (pattern);
5323 TYPE_ALIGN (type) = TYPE_ALIGN (pattern);
5324 TYPE_USER_ALIGN (type) = TYPE_USER_ALIGN (pattern);
5325 TYPE_FOR_JAVA (type) = TYPE_FOR_JAVA (pattern); /* For libjava's JArray<T> */
5326 if (ANON_AGGR_TYPE_P (pattern))
5327 SET_ANON_AGGR_TYPE_P (type);
5329 pbinfo = TYPE_BINFO (pattern);
5331 #ifdef ENABLE_CHECKING
5332 if (DECL_CLASS_SCOPE_P (TYPE_MAIN_DECL (pattern))
5333 && ! COMPLETE_TYPE_P (TYPE_CONTEXT (type))
5334 && ! TYPE_BEING_DEFINED (TYPE_CONTEXT (type)))
5335 /* We should never instantiate a nested class before its enclosing
5336 class; we need to look up the nested class by name before we can
5337 instantiate it, and that lookup should instantiate the enclosing
5342 if (BINFO_BASETYPES (pbinfo))
5344 tree base_list = NULL_TREE;
5345 tree pbases = BINFO_BASETYPES (pbinfo);
5346 tree paccesses = BINFO_BASEACCESSES (pbinfo);
5347 tree context = TYPE_CONTEXT (type);
5350 /* We must enter the scope containing the type, as that is where
5351 the accessibility of types named in dependent bases are
5353 push_scope (context ? context : global_namespace);
5355 /* Substitute into each of the bases to determine the actual
5357 for (i = 0; i < TREE_VEC_LENGTH (pbases); ++i)
5363 pbase = TREE_VEC_ELT (pbases, i);
5364 access = TREE_VEC_ELT (paccesses, i);
5366 /* Substitute to figure out the base class. */
5367 base = tsubst (BINFO_TYPE (pbase), args, tf_error, NULL_TREE);
5368 if (base == error_mark_node)
5371 base_list = tree_cons (access, base, base_list);
5372 TREE_VIA_VIRTUAL (base_list) = TREE_VIA_VIRTUAL (pbase);
5375 /* The list is now in reverse order; correct that. */
5376 base_list = nreverse (base_list);
5378 /* Now call xref_basetypes to set up all the base-class
5380 xref_basetypes (type, base_list);
5382 pop_scope (context ? context : global_namespace);
5385 /* Now that our base classes are set up, enter the scope of the
5386 class, so that name lookups into base classes, etc. will work
5387 correctly. This is precisely analogous to what we do in
5388 begin_class_definition when defining an ordinary non-template
5392 /* Now members are processed in the order of declaration. */
5393 for (member = CLASSTYPE_DECL_LIST (pattern);
5394 member; member = TREE_CHAIN (member))
5396 tree t = TREE_VALUE (member);
5398 if (TREE_PURPOSE (member))
5402 /* Build new CLASSTYPE_NESTED_UTDS. */
5405 tree name = TYPE_IDENTIFIER (tag);
5408 newtag = tsubst (tag, args, tf_error, NULL_TREE);
5409 my_friendly_assert (newtag != error_mark_node, 20010206);
5410 if (TREE_CODE (newtag) != ENUMERAL_TYPE)
5412 if (TYPE_LANG_SPECIFIC (tag) && CLASSTYPE_IS_TEMPLATE (tag))
5413 /* Unfortunately, lookup_template_class sets
5414 CLASSTYPE_IMPLICIT_INSTANTIATION for a partial
5415 instantiation (i.e., for the type of a member
5416 template class nested within a template class.)
5417 This behavior is required for
5418 maybe_process_partial_specialization to work
5419 correctly, but is not accurate in this case;
5420 the TAG is not an instantiation of anything.
5421 (The corresponding TEMPLATE_DECL is an
5422 instantiation, but the TYPE is not.) */
5423 CLASSTYPE_USE_TEMPLATE (newtag) = 0;
5425 /* Now, we call pushtag to put this NEWTAG into the scope of
5426 TYPE. We first set up the IDENTIFIER_TYPE_VALUE to avoid
5427 pushtag calling push_template_decl. We don't have to do
5428 this for enums because it will already have been done in
5431 SET_IDENTIFIER_TYPE_VALUE (name, newtag);
5432 pushtag (name, newtag, /*globalize=*/0);
5435 else if (TREE_CODE (t) == FUNCTION_DECL
5436 || DECL_FUNCTION_TEMPLATE_P (t))
5438 /* Build new TYPE_METHODS. */
5441 if (TREE_CODE (t) == TEMPLATE_DECL)
5442 ++processing_template_decl;
5443 r = tsubst (t, args, tf_error, NULL_TREE);
5444 if (TREE_CODE (t) == TEMPLATE_DECL)
5445 --processing_template_decl;
5446 set_current_access_from_decl (r);
5447 grok_special_member_properties (r);
5448 finish_member_declaration (r);
5452 /* Build new TYPE_FIELDS. */
5454 if (TREE_CODE (t) != CONST_DECL)
5458 /* The the file and line for this declaration, to
5459 assist in error message reporting. Since we
5460 called push_tinst_level above, we don't need to
5462 input_location = DECL_SOURCE_LOCATION (t);
5464 if (TREE_CODE (t) == TEMPLATE_DECL)
5465 ++processing_template_decl;
5466 r = tsubst (t, args, tf_error | tf_warning, NULL_TREE);
5467 if (TREE_CODE (t) == TEMPLATE_DECL)
5468 --processing_template_decl;
5469 if (TREE_CODE (r) == VAR_DECL)
5473 if (DECL_INITIALIZED_IN_CLASS_P (r))
5474 init = tsubst_expr (DECL_INITIAL (t), args,
5475 tf_error | tf_warning, NULL_TREE);
5479 finish_static_data_member_decl
5480 (r, init, /*asmspec_tree=*/NULL_TREE, /*flags=*/0);
5482 if (DECL_INITIALIZED_IN_CLASS_P (r))
5483 check_static_variable_definition (r, TREE_TYPE (r));
5485 else if (TREE_CODE (r) == FIELD_DECL)
5487 /* Determine whether R has a valid type and can be
5488 completed later. If R is invalid, then it is
5489 replaced by error_mark_node so that it will not be
5490 added to TYPE_FIELDS. */
5491 tree rtype = TREE_TYPE (r);
5492 if (can_complete_type_without_circularity (rtype))
5493 complete_type (rtype);
5495 if (!COMPLETE_TYPE_P (rtype))
5497 cxx_incomplete_type_error (r, rtype);
5498 r = error_mark_node;
5502 /* If it is a TYPE_DECL for a class-scoped ENUMERAL_TYPE,
5503 such a thing will already have been added to the field
5504 list by tsubst_enum in finish_member_declaration in the
5505 CLASSTYPE_NESTED_UTDS case above. */
5506 if (!(TREE_CODE (r) == TYPE_DECL
5507 && TREE_CODE (TREE_TYPE (r)) == ENUMERAL_TYPE
5508 && DECL_ARTIFICIAL (r)))
5510 set_current_access_from_decl (r);
5511 finish_member_declaration (r);
5518 if (TYPE_P (t) || DECL_CLASS_TEMPLATE_P (t))
5520 /* Build new CLASSTYPE_FRIEND_CLASSES. */
5522 tree friend_type = t;
5523 tree new_friend_type;
5525 if (TREE_CODE (friend_type) == TEMPLATE_DECL)
5526 new_friend_type = tsubst_friend_class (friend_type, args);
5527 else if (uses_template_parms (friend_type))
5528 new_friend_type = tsubst (friend_type, args,
5529 tf_error | tf_warning, NULL_TREE);
5530 else if (CLASSTYPE_USE_TEMPLATE (friend_type))
5531 new_friend_type = friend_type;
5534 tree ns = decl_namespace_context (TYPE_MAIN_DECL (friend_type));
5536 /* The call to xref_tag_from_type does injection for friend
5538 push_nested_namespace (ns);
5540 xref_tag_from_type (friend_type, NULL_TREE, 1);
5541 pop_nested_namespace (ns);
5544 if (TREE_CODE (friend_type) == TEMPLATE_DECL)
5545 /* Trick make_friend_class into realizing that the friend
5546 we're adding is a template, not an ordinary class. It's
5547 important that we use make_friend_class since it will
5548 perform some error-checking and output cross-reference
5550 ++processing_template_decl;
5552 if (new_friend_type != error_mark_node)
5553 make_friend_class (type, new_friend_type,
5554 /*complain=*/false);
5556 if (TREE_CODE (friend_type) == TEMPLATE_DECL)
5557 --processing_template_decl;
5561 /* Build new DECL_FRIENDLIST. */
5564 if (TREE_CODE (t) == TEMPLATE_DECL)
5565 ++processing_template_decl;
5566 r = tsubst_friend_function (t, args);
5567 if (TREE_CODE (t) == TEMPLATE_DECL)
5568 --processing_template_decl;
5569 add_friend (type, r, /*complain=*/false);
5574 /* Set the file and line number information to whatever is given for
5575 the class itself. This puts error messages involving generated
5576 implicit functions at a predictable point, and the same point
5577 that would be used for non-template classes. */
5578 typedecl = TYPE_MAIN_DECL (type);
5579 input_location = DECL_SOURCE_LOCATION (typedecl);
5581 unreverse_member_declarations (type);
5582 finish_struct_1 (type);
5584 /* Clear this now so repo_template_used is happy. */
5585 TYPE_BEING_DEFINED (type) = 0;
5586 repo_template_used (type);
5588 /* Now that the class is complete, instantiate default arguments for
5589 any member functions. We don't do this earlier because the
5590 default arguments may reference members of the class. */
5591 if (!PRIMARY_TEMPLATE_P (template))
5592 for (t = TYPE_METHODS (type); t; t = TREE_CHAIN (t))
5593 if (TREE_CODE (t) == FUNCTION_DECL
5594 /* Implicitly generated member functions will not have template
5595 information; they are not instantiations, but instead are
5596 created "fresh" for each instantiation. */
5597 && DECL_TEMPLATE_INFO (t))
5598 tsubst_default_arguments (t);
5601 pop_from_top_level ();
5602 pop_deferring_access_checks ();
5605 if (TYPE_CONTAINS_VPTR_P (type))
5606 keyed_classes = tree_cons (NULL_TREE, type, keyed_classes);
5612 tsubst_template_arg (tree t, tree args, tsubst_flags_t complain, tree in_decl)
5618 else if (TYPE_P (t))
5619 r = tsubst (t, args, complain, in_decl);
5622 r = tsubst_expr (t, args, complain, in_decl);
5624 if (!uses_template_parms (r))
5626 /* Sometimes, one of the args was an expression involving a
5627 template constant parameter, like N - 1. Now that we've
5628 tsubst'd, we might have something like 2 - 1. This will
5629 confuse lookup_template_class, so we do constant folding
5630 here. We have to unset processing_template_decl, to fool
5631 tsubst_copy_and_build() into building an actual tree. */
5633 /* If the TREE_TYPE of ARG is not NULL_TREE, ARG is already
5634 as simple as it's going to get, and trying to reprocess
5635 the trees will break. Once tsubst_expr et al DTRT for
5636 non-dependent exprs, this code can go away, as the type
5637 will always be set. */
5640 int saved_processing_template_decl = processing_template_decl;
5641 processing_template_decl = 0;
5642 r = tsubst_copy_and_build (r, /*args=*/NULL_TREE,
5643 tf_error, /*in_decl=*/NULL_TREE,
5644 /*function_p=*/false);
5645 processing_template_decl = saved_processing_template_decl;
5653 /* Substitute ARGS into the vector or list of template arguments T. */
5656 tsubst_template_args (tree t, tree args, tsubst_flags_t complain, tree in_decl)
5658 int len = TREE_VEC_LENGTH (t);
5659 int need_new = 0, i;
5660 tree *elts = alloca (len * sizeof (tree));
5662 for (i = 0; i < len; i++)
5664 tree orig_arg = TREE_VEC_ELT (t, i);
5667 if (TREE_CODE (orig_arg) == TREE_VEC)
5668 new_arg = tsubst_template_args (orig_arg, args, complain, in_decl);
5670 new_arg = tsubst_template_arg (orig_arg, args, complain, in_decl);
5672 if (new_arg == error_mark_node)
5673 return error_mark_node;
5676 if (new_arg != orig_arg)
5683 t = make_tree_vec (len);
5684 for (i = 0; i < len; i++)
5685 TREE_VEC_ELT (t, i) = elts[i];
5690 /* Return the result of substituting ARGS into the template parameters
5691 given by PARMS. If there are m levels of ARGS and m + n levels of
5692 PARMS, then the result will contain n levels of PARMS. For
5693 example, if PARMS is `template <class T> template <class U>
5694 template <T*, U, class V>' and ARGS is {{int}, {double}} then the
5695 result will be `template <int*, double, class V>'. */
5698 tsubst_template_parms (tree parms, tree args, tsubst_flags_t complain)
5703 for (new_parms = &r;
5704 TMPL_PARMS_DEPTH (parms) > TMPL_ARGS_DEPTH (args);
5705 new_parms = &(TREE_CHAIN (*new_parms)),
5706 parms = TREE_CHAIN (parms))
5709 make_tree_vec (TREE_VEC_LENGTH (TREE_VALUE (parms)));
5712 for (i = 0; i < TREE_VEC_LENGTH (new_vec); ++i)
5714 tree tuple = TREE_VEC_ELT (TREE_VALUE (parms), i);
5715 tree default_value = TREE_PURPOSE (tuple);
5716 tree parm_decl = TREE_VALUE (tuple);
5718 parm_decl = tsubst (parm_decl, args, complain, NULL_TREE);
5719 default_value = tsubst_template_arg (default_value, args,
5720 complain, NULL_TREE);
5722 tuple = build_tree_list (default_value, parm_decl);
5723 TREE_VEC_ELT (new_vec, i) = tuple;
5727 tree_cons (size_int (TMPL_PARMS_DEPTH (parms)
5728 - TMPL_ARGS_DEPTH (args)),
5729 new_vec, NULL_TREE);
5735 /* Substitute the ARGS into the indicated aggregate (or enumeration)
5736 type T. If T is not an aggregate or enumeration type, it is
5737 handled as if by tsubst. IN_DECL is as for tsubst. If
5738 ENTERING_SCOPE is nonzero, T is the context for a template which
5739 we are presently tsubst'ing. Return the substituted value. */
5742 tsubst_aggr_type (tree t,
5744 tsubst_flags_t complain,
5751 switch (TREE_CODE (t))
5754 if (TYPE_PTRMEMFUNC_P (t))
5755 return tsubst (TYPE_PTRMEMFUNC_FN_TYPE (t), args, complain, in_decl);
5757 /* else fall through */
5760 if (TYPE_TEMPLATE_INFO (t))
5766 /* First, determine the context for the type we are looking
5768 context = TYPE_CONTEXT (t);
5770 context = tsubst_aggr_type (context, args, complain,
5771 in_decl, /*entering_scope=*/1);
5773 /* Then, figure out what arguments are appropriate for the
5774 type we are trying to find. For example, given:
5776 template <class T> struct S;
5777 template <class T, class U> void f(T, U) { S<U> su; }
5779 and supposing that we are instantiating f<int, double>,
5780 then our ARGS will be {int, double}, but, when looking up
5781 S we only want {double}. */
5782 argvec = tsubst_template_args (TYPE_TI_ARGS (t), args,
5784 if (argvec == error_mark_node)
5785 return error_mark_node;
5787 r = lookup_template_class (t, argvec, in_decl, context,
5788 entering_scope, complain);
5790 return cp_build_qualified_type_real (r, TYPE_QUALS (t), complain);
5793 /* This is not a template type, so there's nothing to do. */
5797 return tsubst (t, args, complain, in_decl);
5801 /* Substitute into the default argument ARG (a default argument for
5802 FN), which has the indicated TYPE. */
5805 tsubst_default_argument (tree fn, tree type, tree arg)
5807 /* This default argument came from a template. Instantiate the
5808 default argument here, not in tsubst. In the case of
5817 we must be careful to do name lookup in the scope of S<T>,
5818 rather than in the current class.
5820 ??? current_class_type affects a lot more than name lookup. This is
5821 very fragile. Fortunately, it will go away when we do 2-phase name
5822 binding properly. */
5824 /* FN is already the desired FUNCTION_DECL. */
5825 push_access_scope (fn);
5827 arg = tsubst_expr (arg, DECL_TI_ARGS (fn),
5828 tf_error | tf_warning, NULL_TREE);
5830 pop_access_scope (fn);
5832 /* Make sure the default argument is reasonable. */
5833 arg = check_default_argument (type, arg);
5838 /* Substitute into all the default arguments for FN. */
5841 tsubst_default_arguments (tree fn)
5846 tmpl_args = DECL_TI_ARGS (fn);
5848 /* If this function is not yet instantiated, we certainly don't need
5849 its default arguments. */
5850 if (uses_template_parms (tmpl_args))
5853 for (arg = TYPE_ARG_TYPES (TREE_TYPE (fn));
5855 arg = TREE_CHAIN (arg))
5856 if (TREE_PURPOSE (arg))
5857 TREE_PURPOSE (arg) = tsubst_default_argument (fn,
5859 TREE_PURPOSE (arg));
5862 /* Substitute the ARGS into the T, which is a _DECL. TYPE is the
5863 (already computed) substitution of ARGS into TREE_TYPE (T), if
5864 appropriate. Return the result of the substitution. Issue error
5865 and warning messages under control of COMPLAIN. */
5868 tsubst_decl (tree t, tree args, tree type, tsubst_flags_t complain)
5870 location_t saved_loc;
5874 /* Set the filename and linenumber to improve error-reporting. */
5875 saved_loc = input_location;
5876 input_location = DECL_SOURCE_LOCATION (t);
5878 switch (TREE_CODE (t))
5882 /* We can get here when processing a member template function
5883 of a template class. */
5884 tree decl = DECL_TEMPLATE_RESULT (t);
5886 int is_template_template_parm = DECL_TEMPLATE_TEMPLATE_PARM_P (t);
5888 if (!is_template_template_parm)
5890 /* We might already have an instance of this template.
5891 The ARGS are for the surrounding class type, so the
5892 full args contain the tsubst'd args for the context,
5893 plus the innermost args from the template decl. */
5894 tree tmpl_args = DECL_CLASS_TEMPLATE_P (t)
5895 ? CLASSTYPE_TI_ARGS (TREE_TYPE (t))
5896 : DECL_TI_ARGS (DECL_TEMPLATE_RESULT (t));
5899 full_args = tsubst_template_args (tmpl_args, args,
5902 /* tsubst_template_args doesn't copy the vector if
5903 nothing changed. But, *something* should have
5905 my_friendly_assert (full_args != tmpl_args, 0);
5907 spec = retrieve_specialization (t, full_args);
5908 if (spec != NULL_TREE)
5915 /* Make a new template decl. It will be similar to the
5916 original, but will record the current template arguments.
5917 We also create a new function declaration, which is just
5918 like the old one, but points to this new template, rather
5919 than the old one. */
5921 my_friendly_assert (DECL_LANG_SPECIFIC (r) != 0, 0);
5922 TREE_CHAIN (r) = NULL_TREE;
5924 if (is_template_template_parm)
5926 tree new_decl = tsubst (decl, args, complain, in_decl);
5927 DECL_TEMPLATE_RESULT (r) = new_decl;
5928 TREE_TYPE (r) = TREE_TYPE (new_decl);
5933 = tsubst_aggr_type (DECL_CONTEXT (t), args,
5935 /*entering_scope=*/1);
5936 DECL_TEMPLATE_INFO (r) = build_tree_list (t, args);
5938 if (TREE_CODE (decl) == TYPE_DECL)
5940 tree new_type = tsubst (TREE_TYPE (t), args, complain, in_decl);
5941 TREE_TYPE (r) = new_type;
5942 CLASSTYPE_TI_TEMPLATE (new_type) = r;
5943 DECL_TEMPLATE_RESULT (r) = TYPE_MAIN_DECL (new_type);
5944 DECL_TI_ARGS (r) = CLASSTYPE_TI_ARGS (new_type);
5948 tree new_decl = tsubst (decl, args, complain, in_decl);
5949 if (new_decl == error_mark_node)
5950 return error_mark_node;
5952 DECL_TEMPLATE_RESULT (r) = new_decl;
5953 DECL_TI_TEMPLATE (new_decl) = r;
5954 TREE_TYPE (r) = TREE_TYPE (new_decl);
5955 DECL_TI_ARGS (r) = DECL_TI_ARGS (new_decl);
5958 SET_DECL_IMPLICIT_INSTANTIATION (r);
5959 DECL_TEMPLATE_INSTANTIATIONS (r) = NULL_TREE;
5960 DECL_TEMPLATE_SPECIALIZATIONS (r) = NULL_TREE;
5962 /* The template parameters for this new template are all the
5963 template parameters for the old template, except the
5964 outermost level of parameters. */
5965 DECL_TEMPLATE_PARMS (r)
5966 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t), args,
5969 if (PRIMARY_TEMPLATE_P (t))
5970 DECL_PRIMARY_TEMPLATE (r) = r;
5972 if (TREE_CODE (decl) != TYPE_DECL)
5973 /* Record this non-type partial instantiation. */
5974 register_specialization (r, t,
5975 DECL_TI_ARGS (DECL_TEMPLATE_RESULT (r)));
5982 tree argvec = NULL_TREE;
5989 /* Nobody should be tsubst'ing into non-template functions. */
5990 my_friendly_assert (DECL_TEMPLATE_INFO (t) != NULL_TREE, 0);
5992 if (TREE_CODE (DECL_TI_TEMPLATE (t)) == TEMPLATE_DECL)
5997 /* If T is not dependent, just return it. We have to
5998 increment PROCESSING_TEMPLATE_DECL because
5999 value_dependent_expression_p assumes that nothing is
6000 dependent when PROCESSING_TEMPLATE_DECL is zero. */
6001 ++processing_template_decl;
6002 dependent_p = value_dependent_expression_p (t);
6003 --processing_template_decl;
6007 /* Calculate the most general template of which R is a
6008 specialization, and the complete set of arguments used to
6010 gen_tmpl = most_general_template (DECL_TI_TEMPLATE (t));
6011 argvec = tsubst_template_args (DECL_TI_ARGS
6012 (DECL_TEMPLATE_RESULT (gen_tmpl)),
6013 args, complain, in_decl);
6015 /* Check to see if we already have this specialization. */
6016 spec = retrieve_specialization (gen_tmpl, argvec);
6024 /* We can see more levels of arguments than parameters if
6025 there was a specialization of a member template, like
6028 template <class T> struct S { template <class U> void f(); }
6029 template <> template <class U> void S<int>::f(U);
6031 Here, we'll be substituting into the specialization,
6032 because that's where we can find the code we actually
6033 want to generate, but we'll have enough arguments for
6034 the most general template.
6036 We also deal with the peculiar case:
6038 template <class T> struct S {
6039 template <class U> friend void f();
6041 template <class U> void f() {}
6043 template void f<double>();
6045 Here, the ARGS for the instantiation of will be {int,
6046 double}. But, we only need as many ARGS as there are
6047 levels of template parameters in CODE_PATTERN. We are
6048 careful not to get fooled into reducing the ARGS in
6051 template <class T> struct S { template <class U> void f(U); }
6052 template <class T> template <> void S<T>::f(int) {}
6054 which we can spot because the pattern will be a
6055 specialization in this case. */
6056 args_depth = TMPL_ARGS_DEPTH (args);
6058 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (t)));
6059 if (args_depth > parms_depth
6060 && !DECL_TEMPLATE_SPECIALIZATION (t))
6061 args = get_innermost_template_args (args, parms_depth);
6065 /* This special case arises when we have something like this:
6067 template <class T> struct S {
6068 friend void f<int>(int, double);
6071 Here, the DECL_TI_TEMPLATE for the friend declaration
6072 will be an IDENTIFIER_NODE. We are being called from
6073 tsubst_friend_function, and we want only to create a
6074 new decl (R) with appropriate types so that we can call
6075 determine_specialization. */
6076 gen_tmpl = NULL_TREE;
6079 if (DECL_CLASS_SCOPE_P (t))
6081 if (DECL_NAME (t) == constructor_name (DECL_CONTEXT (t)))
6085 ctx = tsubst_aggr_type (DECL_CONTEXT (t), args,
6086 complain, t, /*entering_scope=*/1);
6091 ctx = DECL_CONTEXT (t);
6093 type = tsubst (type, args, complain, in_decl);
6094 if (type == error_mark_node)
6095 return error_mark_node;
6097 /* We do NOT check for matching decls pushed separately at this
6098 point, as they may not represent instantiations of this
6099 template, and in any case are considered separate under the
6102 DECL_USE_TEMPLATE (r) = 0;
6103 TREE_TYPE (r) = type;
6104 /* Clear out the mangled name and RTL for the instantiation. */
6105 SET_DECL_ASSEMBLER_NAME (r, NULL_TREE);
6106 SET_DECL_RTL (r, NULL_RTX);
6108 DECL_CONTEXT (r) = ctx;
6110 if (member && DECL_CONV_FN_P (r))
6111 /* Type-conversion operator. Reconstruct the name, in
6112 case it's the name of one of the template's parameters. */
6113 DECL_NAME (r) = mangle_conv_op_name_for_type (TREE_TYPE (type));
6115 DECL_ARGUMENTS (r) = tsubst (DECL_ARGUMENTS (t), args,
6117 DECL_RESULT (r) = NULL_TREE;
6119 TREE_STATIC (r) = 0;
6120 TREE_PUBLIC (r) = TREE_PUBLIC (t);
6121 DECL_EXTERNAL (r) = 1;
6122 DECL_INTERFACE_KNOWN (r) = 0;
6123 DECL_DEFER_OUTPUT (r) = 0;
6124 TREE_CHAIN (r) = NULL_TREE;
6125 DECL_PENDING_INLINE_INFO (r) = 0;
6126 DECL_PENDING_INLINE_P (r) = 0;
6127 DECL_SAVED_TREE (r) = NULL_TREE;
6129 if (DECL_CLONED_FUNCTION (r))
6131 DECL_CLONED_FUNCTION (r) = tsubst (DECL_CLONED_FUNCTION (t),
6133 TREE_CHAIN (r) = TREE_CHAIN (DECL_CLONED_FUNCTION (r));
6134 TREE_CHAIN (DECL_CLONED_FUNCTION (r)) = r;
6137 /* Set up the DECL_TEMPLATE_INFO for R. There's no need to do
6138 this in the special friend case mentioned above where
6139 GEN_TMPL is NULL. */
6142 DECL_TEMPLATE_INFO (r)
6143 = tree_cons (gen_tmpl, argvec, NULL_TREE);
6144 SET_DECL_IMPLICIT_INSTANTIATION (r);
6145 register_specialization (r, gen_tmpl, argvec);
6147 /* We're not supposed to instantiate default arguments
6148 until they are called, for a template. But, for a
6151 template <class T> void f ()
6152 { extern void g(int i = T()); }
6154 we should do the substitution when the template is
6155 instantiated. We handle the member function case in
6156 instantiate_class_template since the default arguments
6157 might refer to other members of the class. */
6159 && !PRIMARY_TEMPLATE_P (gen_tmpl)
6160 && !uses_template_parms (argvec))
6161 tsubst_default_arguments (r);
6164 /* Copy the list of befriending classes. */
6165 for (friends = &DECL_BEFRIENDING_CLASSES (r);
6167 friends = &TREE_CHAIN (*friends))
6169 *friends = copy_node (*friends);
6170 TREE_VALUE (*friends) = tsubst (TREE_VALUE (*friends),
6175 if (DECL_CONSTRUCTOR_P (r) || DECL_DESTRUCTOR_P (r))
6177 maybe_retrofit_in_chrg (r);
6178 if (DECL_CONSTRUCTOR_P (r))
6179 grok_ctor_properties (ctx, r);
6180 /* If this is an instantiation of a member template, clone it.
6181 If it isn't, that'll be handled by
6182 clone_constructors_and_destructors. */
6183 if (PRIMARY_TEMPLATE_P (gen_tmpl))
6184 clone_function_decl (r, /*update_method_vec_p=*/0);
6186 else if (IDENTIFIER_OPNAME_P (DECL_NAME (r)))
6187 grok_op_properties (r, DECL_FRIEND_P (r),
6188 (complain & tf_error) != 0);
6195 if (DECL_TEMPLATE_PARM_P (t))
6196 SET_DECL_TEMPLATE_PARM_P (r);
6198 TREE_TYPE (r) = type;
6199 c_apply_type_quals_to_decl (cp_type_quals (type), r);
6201 if (DECL_INITIAL (r))
6203 if (TREE_CODE (DECL_INITIAL (r)) != TEMPLATE_PARM_INDEX)
6204 DECL_INITIAL (r) = TREE_TYPE (r);
6206 DECL_INITIAL (r) = tsubst (DECL_INITIAL (r), args,
6210 DECL_CONTEXT (r) = NULL_TREE;
6212 if (!DECL_TEMPLATE_PARM_P (r))
6213 DECL_ARG_TYPE (r) = type_passed_as (type);
6215 TREE_CHAIN (r) = tsubst (TREE_CHAIN (t), args,
6216 complain, TREE_CHAIN (t));
6223 TREE_TYPE (r) = type;
6224 c_apply_type_quals_to_decl (cp_type_quals (type), r);
6226 /* We don't have to set DECL_CONTEXT here; it is set by
6227 finish_member_declaration. */
6228 DECL_INITIAL (r) = tsubst_expr (DECL_INITIAL (t), args,
6230 TREE_CHAIN (r) = NULL_TREE;
6231 if (VOID_TYPE_P (type))
6232 cp_error_at ("instantiation of `%D' as type `%T'", r, type);
6239 /* It is not a dependent using decl any more. */
6240 TREE_TYPE (r) = void_type_node;
6242 = tsubst_copy (DECL_INITIAL (t), args, complain, in_decl);
6244 = tsubst_copy (DECL_NAME (t), args, complain, in_decl);
6245 TREE_CHAIN (r) = NULL_TREE;
6250 if (TREE_CODE (type) == TEMPLATE_TEMPLATE_PARM
6251 || t == TYPE_MAIN_DECL (TREE_TYPE (t)))
6253 /* If this is the canonical decl, we don't have to mess with
6254 instantiations, and often we can't (for typename, template
6255 type parms and such). Note that TYPE_NAME is not correct for
6256 the above test if we've copied the type for a typedef. */
6257 r = TYPE_NAME (type);
6265 tree argvec = NULL_TREE;
6266 tree gen_tmpl = NULL_TREE;
6268 tree tmpl = NULL_TREE;
6272 /* Assume this is a non-local variable. */
6275 if (TYPE_P (CP_DECL_CONTEXT (t)))
6276 ctx = tsubst_aggr_type (DECL_CONTEXT (t), args,
6278 in_decl, /*entering_scope=*/1);
6279 else if (DECL_NAMESPACE_SCOPE_P (t))
6280 ctx = DECL_CONTEXT (t);
6283 /* Subsequent calls to pushdecl will fill this in. */
6288 /* Check to see if we already have this specialization. */
6291 tmpl = DECL_TI_TEMPLATE (t);
6292 gen_tmpl = most_general_template (tmpl);
6293 argvec = tsubst (DECL_TI_ARGS (t), args, complain, in_decl);
6294 spec = retrieve_specialization (gen_tmpl, argvec);
6297 spec = retrieve_local_specialization (t);
6306 if (TREE_CODE (r) == VAR_DECL)
6308 type = complete_type (type);
6309 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (r)
6310 = DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (t);
6312 else if (DECL_SELF_REFERENCE_P (t))
6313 SET_DECL_SELF_REFERENCE_P (r);
6314 TREE_TYPE (r) = type;
6315 c_apply_type_quals_to_decl (cp_type_quals (type), r);
6316 DECL_CONTEXT (r) = ctx;
6317 /* Clear out the mangled name and RTL for the instantiation. */
6318 SET_DECL_ASSEMBLER_NAME (r, NULL_TREE);
6319 SET_DECL_RTL (r, NULL_RTX);
6321 /* Don't try to expand the initializer until someone tries to use
6322 this variable; otherwise we run into circular dependencies. */
6323 DECL_INITIAL (r) = NULL_TREE;
6324 SET_DECL_RTL (r, NULL_RTX);
6325 DECL_SIZE (r) = DECL_SIZE_UNIT (r) = 0;
6327 /* Even if the original location is out of scope, the newly
6328 substituted one is not. */
6329 if (TREE_CODE (r) == VAR_DECL)
6331 DECL_DEAD_FOR_LOCAL (r) = 0;
6332 DECL_INITIALIZED_P (r) = 0;
6337 /* A static data member declaration is always marked
6338 external when it is declared in-class, even if an
6339 initializer is present. We mimic the non-template
6341 DECL_EXTERNAL (r) = 1;
6343 register_specialization (r, gen_tmpl, argvec);
6344 DECL_TEMPLATE_INFO (r) = tree_cons (tmpl, argvec, NULL_TREE);
6345 SET_DECL_IMPLICIT_INSTANTIATION (r);
6348 register_local_specialization (r, t);
6350 TREE_CHAIN (r) = NULL_TREE;
6351 if (TREE_CODE (r) == VAR_DECL && VOID_TYPE_P (type))
6352 cp_error_at ("instantiation of `%D' as type `%T'", r, type);
6353 /* Compute the size, alignment, etc. of R. */
6362 /* Restore the file and line information. */
6363 input_location = saved_loc;
6368 /* Substitute into the ARG_TYPES of a function type. */
6371 tsubst_arg_types (tree arg_types,
6373 tsubst_flags_t complain,
6376 tree remaining_arg_types;
6379 if (!arg_types || arg_types == void_list_node)
6382 remaining_arg_types = tsubst_arg_types (TREE_CHAIN (arg_types),
6383 args, complain, in_decl);
6384 if (remaining_arg_types == error_mark_node)
6385 return error_mark_node;
6387 type = tsubst (TREE_VALUE (arg_types), args, complain, in_decl);
6388 if (type == error_mark_node)
6389 return error_mark_node;
6390 if (VOID_TYPE_P (type))
6392 if (complain & tf_error)
6394 error ("invalid parameter type `%T'", type);
6396 cp_error_at ("in declaration `%D'", in_decl);
6398 return error_mark_node;
6401 /* Do array-to-pointer, function-to-pointer conversion, and ignore
6402 top-level qualifiers as required. */
6403 type = TYPE_MAIN_VARIANT (type_decays_to (type));
6405 /* Note that we do not substitute into default arguments here. The
6406 standard mandates that they be instantiated only when needed,
6407 which is done in build_over_call. */
6408 return hash_tree_cons (TREE_PURPOSE (arg_types), type,
6409 remaining_arg_types);
6413 /* Substitute into a FUNCTION_TYPE or METHOD_TYPE. This routine does
6414 *not* handle the exception-specification for FNTYPE, because the
6415 initial substitution of explicitly provided template parameters
6416 during argument deduction forbids substitution into the
6417 exception-specification:
6421 All references in the function type of the function template to the
6422 corresponding template parameters are replaced by the specified tem-
6423 plate argument values. If a substitution in a template parameter or
6424 in the function type of the function template results in an invalid
6425 type, type deduction fails. [Note: The equivalent substitution in
6426 exception specifications is done only when the function is instanti-
6427 ated, at which point a program is ill-formed if the substitution
6428 results in an invalid type.] */
6431 tsubst_function_type (tree t,
6433 tsubst_flags_t complain,
6440 /* The TYPE_CONTEXT is not used for function/method types. */
6441 my_friendly_assert (TYPE_CONTEXT (t) == NULL_TREE, 0);
6443 /* Substitute the return type. */
6444 return_type = tsubst (TREE_TYPE (t), args, complain, in_decl);
6445 if (return_type == error_mark_node)
6446 return error_mark_node;
6448 /* Substitute the argument types. */
6449 arg_types = tsubst_arg_types (TYPE_ARG_TYPES (t), args,
6451 if (arg_types == error_mark_node)
6452 return error_mark_node;
6454 /* Construct a new type node and return it. */
6455 if (TREE_CODE (t) == FUNCTION_TYPE)
6456 fntype = build_function_type (return_type, arg_types);
6459 tree r = TREE_TYPE (TREE_VALUE (arg_types));
6460 if (! IS_AGGR_TYPE (r))
6464 Type deduction may fail for any of the following
6467 -- Attempting to create "pointer to member of T" when T
6468 is not a class type. */
6469 if (complain & tf_error)
6470 error ("creating pointer to member function of non-class type `%T'",
6472 return error_mark_node;
6475 fntype = build_method_type_directly (r, return_type,
6476 TREE_CHAIN (arg_types));
6478 fntype = cp_build_qualified_type_real (fntype, TYPE_QUALS (t), complain);
6479 fntype = build_type_attribute_variant (fntype, TYPE_ATTRIBUTES (t));
6484 /* Substitute into the PARMS of a call-declarator. */
6487 tsubst_call_declarator_parms (tree parms,
6489 tsubst_flags_t complain,
6496 if (!parms || parms == void_list_node)
6499 new_parms = tsubst_call_declarator_parms (TREE_CHAIN (parms),
6500 args, complain, in_decl);
6502 /* Figure out the type of this parameter. */
6503 type = tsubst (TREE_VALUE (parms), args, complain, in_decl);
6505 /* Figure out the default argument as well. Note that we use
6506 tsubst_expr since the default argument is really an expression. */
6507 defarg = tsubst_expr (TREE_PURPOSE (parms), args, complain, in_decl);
6509 /* Chain this parameter on to the front of those we have already
6510 processed. We don't use hash_tree_cons because that function
6511 doesn't check TREE_PARMLIST. */
6512 new_parms = tree_cons (defarg, type, new_parms);
6514 /* And note that these are parameters. */
6515 TREE_PARMLIST (new_parms) = 1;
6520 /* Take the tree structure T and replace template parameters used
6521 therein with the argument vector ARGS. IN_DECL is an associated
6522 decl for diagnostics. If an error occurs, returns ERROR_MARK_NODE.
6523 Issue error and warning messages under control of COMPLAIN. Note
6524 that we must be relatively non-tolerant of extensions here, in
6525 order to preserve conformance; if we allow substitutions that
6526 should not be allowed, we may allow argument deductions that should
6527 not succeed, and therefore report ambiguous overload situations
6528 where there are none. In theory, we could allow the substitution,
6529 but indicate that it should have failed, and allow our caller to
6530 make sure that the right thing happens, but we don't try to do this
6533 This function is used for dealing with types, decls and the like;
6534 for expressions, use tsubst_expr or tsubst_copy. */
6537 tsubst (tree t, tree args, tsubst_flags_t complain, tree in_decl)
6541 if (t == NULL_TREE || t == error_mark_node
6542 || t == integer_type_node
6543 || t == void_type_node
6544 || t == char_type_node
6545 || TREE_CODE (t) == NAMESPACE_DECL)
6548 if (TREE_CODE (t) == IDENTIFIER_NODE)
6549 type = IDENTIFIER_TYPE_VALUE (t);
6551 type = TREE_TYPE (t);
6553 my_friendly_assert (type != unknown_type_node, 20030716);
6555 if (type && TREE_CODE (t) != FUNCTION_DECL
6556 && TREE_CODE (t) != TYPENAME_TYPE
6557 && TREE_CODE (t) != TEMPLATE_DECL
6558 && TREE_CODE (t) != IDENTIFIER_NODE
6559 && TREE_CODE (t) != FUNCTION_TYPE
6560 && TREE_CODE (t) != METHOD_TYPE)
6561 type = tsubst (type, args, complain, in_decl);
6562 if (type == error_mark_node)
6563 return error_mark_node;
6566 return tsubst_decl (t, args, type, complain);
6568 switch (TREE_CODE (t))
6573 return tsubst_aggr_type (t, args, complain, in_decl,
6574 /*entering_scope=*/0);
6577 case IDENTIFIER_NODE:
6589 if (t == integer_type_node)
6592 if (TREE_CODE (TYPE_MIN_VALUE (t)) == INTEGER_CST
6593 && TREE_CODE (TYPE_MAX_VALUE (t)) == INTEGER_CST)
6597 tree max, omax = TREE_OPERAND (TYPE_MAX_VALUE (t), 0);
6599 /* The array dimension behaves like a non-type template arg,
6600 in that we want to fold it as much as possible. */
6601 max = tsubst_template_arg (omax, args, complain, in_decl);
6602 if (!processing_template_decl)
6603 max = decl_constant_value (max);
6605 if (processing_template_decl
6606 /* When providing explicit arguments to a template
6607 function, but leaving some arguments for subsequent
6608 deduction, MAX may be template-dependent even if we're
6609 not PROCESSING_TEMPLATE_DECL. We still need to check for
6610 template parms, though; MAX won't be an INTEGER_CST for
6611 dynamic arrays, either. */
6612 || (TREE_CODE (max) != INTEGER_CST
6613 && uses_template_parms (max)))
6615 tree itype = make_node (INTEGER_TYPE);
6616 TYPE_MIN_VALUE (itype) = size_zero_node;
6617 TYPE_MAX_VALUE (itype) = build_min (MINUS_EXPR, sizetype, max,
6622 if (integer_zerop (omax))
6624 /* Still allow an explicit array of size zero. */
6626 pedwarn ("creating array with size zero");
6628 else if (integer_zerop (max)
6629 || (TREE_CODE (max) == INTEGER_CST
6630 && INT_CST_LT (max, integer_zero_node)))
6634 Type deduction may fail for any of the following
6637 Attempting to create an array with a size that is
6638 zero or negative. */
6639 if (complain & tf_error)
6640 error ("creating array with size zero (`%E')", max);
6642 return error_mark_node;
6645 return compute_array_index_type (NULL_TREE, max);
6648 case TEMPLATE_TYPE_PARM:
6649 case TEMPLATE_TEMPLATE_PARM:
6650 case BOUND_TEMPLATE_TEMPLATE_PARM:
6651 case TEMPLATE_PARM_INDEX:
6659 if (TREE_CODE (t) == TEMPLATE_TYPE_PARM
6660 || TREE_CODE (t) == TEMPLATE_TEMPLATE_PARM
6661 || TREE_CODE (t) == BOUND_TEMPLATE_TEMPLATE_PARM)
6663 idx = TEMPLATE_TYPE_IDX (t);
6664 level = TEMPLATE_TYPE_LEVEL (t);
6668 idx = TEMPLATE_PARM_IDX (t);
6669 level = TEMPLATE_PARM_LEVEL (t);
6672 if (TREE_VEC_LENGTH (args) > 0)
6674 tree arg = NULL_TREE;
6676 levels = TMPL_ARGS_DEPTH (args);
6677 if (level <= levels)
6678 arg = TMPL_ARG (args, level, idx);
6680 if (arg == error_mark_node)
6681 return error_mark_node;
6682 else if (arg != NULL_TREE)
6684 if (TREE_CODE (t) == TEMPLATE_TYPE_PARM)
6686 my_friendly_assert (TYPE_P (arg), 0);
6687 return cp_build_qualified_type_real
6688 (arg, cp_type_quals (arg) | cp_type_quals (t),
6689 complain | tf_ignore_bad_quals);
6691 else if (TREE_CODE (t) == BOUND_TEMPLATE_TEMPLATE_PARM)
6693 /* We are processing a type constructed from
6694 a template template parameter */
6695 tree argvec = tsubst (TYPE_TI_ARGS (t),
6696 args, complain, in_decl);
6697 if (argvec == error_mark_node)
6698 return error_mark_node;
6700 /* We can get a TEMPLATE_TEMPLATE_PARM here when
6701 we are resolving nested-types in the signature of
6702 a member function templates.
6703 Otherwise ARG is a TEMPLATE_DECL and is the real
6704 template to be instantiated. */
6705 if (TREE_CODE (arg) == TEMPLATE_TEMPLATE_PARM)
6706 arg = TYPE_NAME (arg);
6708 r = lookup_template_class (arg,
6711 /*entering_scope=*/0,
6713 return cp_build_qualified_type_real
6714 (r, TYPE_QUALS (t), complain);
6717 /* TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX. */
6725 /* This can happen during the attempted tsubst'ing in
6726 unify. This means that we don't yet have any information
6727 about the template parameter in question. */
6730 /* If we get here, we must have been looking at a parm for a
6731 more deeply nested template. Make a new version of this
6732 template parameter, but with a lower level. */
6733 switch (TREE_CODE (t))
6735 case TEMPLATE_TYPE_PARM:
6736 case TEMPLATE_TEMPLATE_PARM:
6737 case BOUND_TEMPLATE_TEMPLATE_PARM:
6738 if (cp_type_quals (t))
6740 r = tsubst (TYPE_MAIN_VARIANT (t), args, complain, in_decl);
6741 r = cp_build_qualified_type_real
6742 (r, cp_type_quals (t),
6743 complain | (TREE_CODE (t) == TEMPLATE_TYPE_PARM
6744 ? tf_ignore_bad_quals : 0));
6749 TEMPLATE_TYPE_PARM_INDEX (r)
6750 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (t),
6752 TYPE_STUB_DECL (r) = TYPE_NAME (r) = TEMPLATE_TYPE_DECL (r);
6753 TYPE_MAIN_VARIANT (r) = r;
6754 TYPE_POINTER_TO (r) = NULL_TREE;
6755 TYPE_REFERENCE_TO (r) = NULL_TREE;
6757 if (TREE_CODE (t) == BOUND_TEMPLATE_TEMPLATE_PARM)
6759 tree argvec = tsubst (TYPE_TI_ARGS (t), args,
6761 if (argvec == error_mark_node)
6762 return error_mark_node;
6764 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (r)
6765 = tree_cons (TYPE_TI_TEMPLATE (t), argvec, NULL_TREE);
6770 case TEMPLATE_PARM_INDEX:
6771 r = reduce_template_parm_level (t, type, levels);
6783 tree purpose, value, chain, result;
6785 if (t == void_list_node)
6788 purpose = TREE_PURPOSE (t);
6791 purpose = tsubst (purpose, args, complain, in_decl);
6792 if (purpose == error_mark_node)
6793 return error_mark_node;
6795 value = TREE_VALUE (t);
6798 value = tsubst (value, args, complain, in_decl);
6799 if (value == error_mark_node)
6800 return error_mark_node;
6802 chain = TREE_CHAIN (t);
6803 if (chain && chain != void_type_node)
6805 chain = tsubst (chain, args, complain, in_decl);
6806 if (chain == error_mark_node)
6807 return error_mark_node;
6809 if (purpose == TREE_PURPOSE (t)
6810 && value == TREE_VALUE (t)
6811 && chain == TREE_CHAIN (t))
6813 if (TREE_PARMLIST (t))
6815 result = tree_cons (purpose, value, chain);
6816 TREE_PARMLIST (result) = 1;
6819 result = hash_tree_cons (purpose, value, chain);
6823 if (type != NULL_TREE)
6825 /* A binfo node. We always need to make a copy, of the node
6826 itself and of its BINFO_BASETYPES. */
6830 /* Make sure type isn't a typedef copy. */
6831 type = BINFO_TYPE (TYPE_BINFO (type));
6833 TREE_TYPE (t) = complete_type (type);
6834 if (IS_AGGR_TYPE (type))
6836 BINFO_VTABLE (t) = TYPE_BINFO_VTABLE (type);
6837 BINFO_VIRTUALS (t) = TYPE_BINFO_VIRTUALS (type);
6838 if (TYPE_BINFO_BASETYPES (type) != NULL_TREE)
6839 BINFO_BASETYPES (t) = copy_node (TYPE_BINFO_BASETYPES (type));
6844 /* Otherwise, a vector of template arguments. */
6845 return tsubst_template_args (t, args, complain, in_decl);
6848 case REFERENCE_TYPE:
6850 enum tree_code code;
6852 if (type == TREE_TYPE (t) && TREE_CODE (type) != METHOD_TYPE)
6855 code = TREE_CODE (t);
6860 Type deduction may fail for any of the following
6863 -- Attempting to create a pointer to reference type.
6864 -- Attempting to create a reference to a reference type or
6865 a reference to void. */
6866 if (TREE_CODE (type) == REFERENCE_TYPE
6867 || (code == REFERENCE_TYPE && TREE_CODE (type) == VOID_TYPE))
6869 static location_t last_loc;
6871 /* We keep track of the last time we issued this error
6872 message to avoid spewing a ton of messages during a
6873 single bad template instantiation. */
6874 if (complain & tf_error
6875 && (last_loc.line != input_line
6876 || last_loc.file != input_filename))
6878 if (TREE_CODE (type) == VOID_TYPE)
6879 error ("forming reference to void");
6881 error ("forming %s to reference type `%T'",
6882 (code == POINTER_TYPE) ? "pointer" : "reference",
6884 last_loc = input_location;
6887 return error_mark_node;
6889 else if (code == POINTER_TYPE)
6891 r = build_pointer_type (type);
6892 if (TREE_CODE (type) == METHOD_TYPE)
6893 r = build_ptrmemfunc_type (r);
6896 r = build_reference_type (type);
6897 r = cp_build_qualified_type_real (r, TYPE_QUALS (t), complain);
6899 if (r != error_mark_node)
6900 /* Will this ever be needed for TYPE_..._TO values? */
6907 r = tsubst (TYPE_OFFSET_BASETYPE (t), args, complain, in_decl);
6908 if (r == error_mark_node || !IS_AGGR_TYPE (r))
6912 Type deduction may fail for any of the following
6915 -- Attempting to create "pointer to member of T" when T
6916 is not a class type. */
6917 if (complain & tf_error)
6918 error ("creating pointer to member of non-class type `%T'", r);
6919 return error_mark_node;
6921 if (TREE_CODE (type) == REFERENCE_TYPE)
6923 if (complain & tf_error)
6924 error ("creating pointer to member reference type `%T'", type);
6926 return error_mark_node;
6928 my_friendly_assert (TREE_CODE (type) != METHOD_TYPE, 20011231);
6929 if (TREE_CODE (type) == FUNCTION_TYPE)
6931 /* This is really a method type. The cv qualifiers of the
6932 this pointer should _not_ be determined by the cv
6933 qualifiers of the class type. They should be held
6934 somewhere in the FUNCTION_TYPE, but we don't do that at
6935 the moment. Consider
6936 typedef void (Func) () const;
6938 template <typename T1> void Foo (Func T1::*);
6943 method_type = build_method_type_directly (TYPE_MAIN_VARIANT (r),
6945 TYPE_ARG_TYPES (type));
6946 return build_ptrmemfunc_type (build_pointer_type (method_type));
6949 return cp_build_qualified_type_real (build_ptrmem_type (r, type),
6959 fntype = tsubst_function_type (t, args, complain, in_decl);
6960 if (fntype == error_mark_node)
6961 return error_mark_node;
6963 /* Substitute the exception specification. */
6964 raises = TYPE_RAISES_EXCEPTIONS (t);
6967 tree list = NULL_TREE;
6969 if (! TREE_VALUE (raises))
6972 for (; raises != NULL_TREE; raises = TREE_CHAIN (raises))
6974 tree spec = TREE_VALUE (raises);
6976 spec = tsubst (spec, args, complain, in_decl);
6977 if (spec == error_mark_node)
6979 list = add_exception_specifier (list, spec, complain);
6981 fntype = build_exception_variant (fntype, list);
6987 tree domain = tsubst (TYPE_DOMAIN (t), args, complain, in_decl);
6988 if (domain == error_mark_node)
6989 return error_mark_node;
6991 /* As an optimization, we avoid regenerating the array type if
6992 it will obviously be the same as T. */
6993 if (type == TREE_TYPE (t) && domain == TYPE_DOMAIN (t))
6996 /* These checks should match the ones in grokdeclarator.
7000 The deduction may fail for any of the following reasons:
7002 -- Attempting to create an array with an element type that
7003 is void, a function type, or a reference type. */
7004 if (TREE_CODE (type) == VOID_TYPE
7005 || TREE_CODE (type) == FUNCTION_TYPE
7006 || TREE_CODE (type) == REFERENCE_TYPE)
7008 if (complain & tf_error)
7009 error ("creating array of `%T'", type);
7010 return error_mark_node;
7013 r = build_cplus_array_type (type, domain);
7020 tree e1 = tsubst (TREE_OPERAND (t, 0), args, complain, in_decl);
7021 tree e2 = tsubst (TREE_OPERAND (t, 1), args, complain, in_decl);
7023 if (e1 == error_mark_node || e2 == error_mark_node)
7024 return error_mark_node;
7026 return fold (build (TREE_CODE (t), TREE_TYPE (t), e1, e2));
7032 tree e = tsubst (TREE_OPERAND (t, 0), args, complain, in_decl);
7033 if (e == error_mark_node)
7034 return error_mark_node;
7036 return fold (build (TREE_CODE (t), TREE_TYPE (t), e));
7041 tree ctx = tsubst_aggr_type (TYPE_CONTEXT (t), args, complain,
7042 in_decl, /*entering_scope=*/1);
7043 tree f = tsubst_copy (TYPENAME_TYPE_FULLNAME (t), args,
7046 if (ctx == error_mark_node || f == error_mark_node)
7047 return error_mark_node;
7049 if (!IS_AGGR_TYPE (ctx))
7051 if (complain & tf_error)
7052 error ("`%T' is not a class, struct, or union type",
7054 return error_mark_node;
7056 else if (!uses_template_parms (ctx) && !TYPE_BEING_DEFINED (ctx))
7058 /* Normally, make_typename_type does not require that the CTX
7059 have complete type in order to allow things like:
7061 template <class T> struct S { typename S<T>::X Y; };
7063 But, such constructs have already been resolved by this
7064 point, so here CTX really should have complete type, unless
7065 it's a partial instantiation. */
7066 ctx = complete_type (ctx);
7067 if (!COMPLETE_TYPE_P (ctx))
7069 if (complain & tf_error)
7070 cxx_incomplete_type_error (NULL_TREE, ctx);
7071 return error_mark_node;
7075 f = make_typename_type (ctx, f,
7076 (complain & tf_error) | tf_keep_type_decl);
7077 if (f == error_mark_node)
7079 if (TREE_CODE (f) == TYPE_DECL)
7081 complain |= tf_ignore_bad_quals;
7085 return cp_build_qualified_type_real
7086 (f, cp_type_quals (f) | cp_type_quals (t), complain);
7089 case UNBOUND_CLASS_TEMPLATE:
7091 tree ctx = tsubst_aggr_type (TYPE_CONTEXT (t), args, complain,
7092 in_decl, /*entering_scope=*/1);
7093 tree name = TYPE_IDENTIFIER (t);
7095 if (ctx == error_mark_node || name == error_mark_node)
7096 return error_mark_node;
7098 return make_unbound_class_template (ctx, name, complain);
7103 tree e = tsubst (TREE_OPERAND (t, 0), args, complain, in_decl);
7104 if (e == error_mark_node)
7105 return error_mark_node;
7106 return make_pointer_declarator (type, e);
7111 tree e = tsubst (TREE_OPERAND (t, 0), args, complain, in_decl);
7112 if (e == error_mark_node)
7113 return error_mark_node;
7114 return make_reference_declarator (type, e);
7119 tree e1 = tsubst (TREE_OPERAND (t, 0), args, complain, in_decl);
7120 tree e2 = tsubst_expr (TREE_OPERAND (t, 1), args, complain, in_decl);
7121 if (e1 == error_mark_node || e2 == error_mark_node)
7122 return error_mark_node;
7124 return build_nt (ARRAY_REF, e1, e2, tsubst_expr);
7129 tree e1 = tsubst (TREE_OPERAND (t, 0), args, complain, in_decl);
7130 tree e2 = (tsubst_call_declarator_parms
7131 (CALL_DECLARATOR_PARMS (t), args, complain, in_decl));
7132 tree e3 = tsubst (CALL_DECLARATOR_EXCEPTION_SPEC (t), args,
7135 if (e1 == error_mark_node || e2 == error_mark_node
7136 || e3 == error_mark_node)
7137 return error_mark_node;
7139 return make_call_declarator (e1, e2, CALL_DECLARATOR_QUALS (t), e3);
7144 tree e1 = tsubst (TREE_OPERAND (t, 0), args, complain, in_decl);
7145 tree e2 = tsubst (TREE_OPERAND (t, 1), args, complain, in_decl);
7146 if (e1 == error_mark_node || e2 == error_mark_node)
7147 return error_mark_node;
7149 return build_nt (TREE_CODE (t), e1, e2);
7154 tree e1 = tsubst_expr (TYPE_FIELDS (t), args, complain, in_decl);
7155 if (e1 == error_mark_node)
7156 return error_mark_node;
7158 return cp_build_qualified_type_real (TREE_TYPE (e1),
7160 | cp_type_quals (TREE_TYPE (e1)),
7165 sorry ("use of `%s' in template",
7166 tree_code_name [(int) TREE_CODE (t)]);
7167 return error_mark_node;
7171 /* Like tsubst_expr for a BASELINK. OBJECT_TYPE, if non-NULL, is the
7172 type of the expression on the left-hand side of the "." or "->"
7176 tsubst_baselink (tree baselink, tree object_type,
7177 tree args, tsubst_flags_t complain, tree in_decl)
7180 tree qualifying_scope;
7182 tree template_args = 0;
7183 bool template_id_p = false;
7185 /* A baselink indicates a function from a base class. The
7186 BASELINK_ACCESS_BINFO and BASELINK_BINFO are going to have
7187 non-dependent types; otherwise, the lookup could not have
7188 succeeded. However, they may indicate bases of the template
7189 class, rather than the instantiated class.
7191 In addition, lookups that were not ambiguous before may be
7192 ambiguous now. Therefore, we perform the lookup again. */
7193 qualifying_scope = BINFO_TYPE (BASELINK_ACCESS_BINFO (baselink));
7194 fns = BASELINK_FUNCTIONS (baselink);
7195 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)
7197 template_id_p = true;
7198 template_args = TREE_OPERAND (fns, 1);
7199 fns = TREE_OPERAND (fns, 0);
7201 template_args = tsubst_template_args (template_args, args,
7204 name = DECL_NAME (get_first_fn (fns));
7205 baselink = lookup_fnfields (qualifying_scope, name, /*protect=*/1);
7206 if (BASELINK_P (baselink) && template_id_p)
7207 BASELINK_FUNCTIONS (baselink)
7208 = build_nt (TEMPLATE_ID_EXPR,
7209 BASELINK_FUNCTIONS (baselink),
7212 object_type = current_class_type;
7213 return adjust_result_of_qualified_name_lookup (baselink,
7218 /* Like tsubst_expr for a SCOPE_REF, given by QUALIFIED_ID. DONE is
7219 true if the qualified-id will be a postfix-expression in-and-of
7220 itself; false if more of the postfix-expression follows the
7221 QUALIFIED_ID. ADDRESS_P is true if the qualified-id is the operand
7225 tsubst_qualified_id (tree qualified_id, tree args,
7226 tsubst_flags_t complain, tree in_decl,
7227 bool done, bool address_p)
7235 my_friendly_assert (TREE_CODE (qualified_id) == SCOPE_REF, 20030706);
7237 /* Figure out what name to look up. */
7238 name = TREE_OPERAND (qualified_id, 1);
7239 if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
7242 template_args = TREE_OPERAND (name, 1);
7244 template_args = tsubst_template_args (template_args, args,
7246 name = TREE_OPERAND (name, 0);
7250 is_template = false;
7251 template_args = NULL_TREE;
7254 /* Substitute into the qualifying scope. When there are no ARGS, we
7255 are just trying to simplify a non-dependent expression. In that
7256 case the qualifying scope may be dependent, and, in any case,
7257 substituting will not help. */
7258 scope = TREE_OPERAND (qualified_id, 0);
7261 scope = tsubst (scope, args, complain, in_decl);
7262 expr = tsubst_copy (name, args, complain, in_decl);
7267 my_friendly_assert (!dependent_type_p (scope), 20030729);
7269 if (!BASELINK_P (name) && !DECL_P (expr))
7271 expr = lookup_qualified_name (scope, expr, /*is_type_p=*/0, false);
7272 if (TREE_CODE (TREE_CODE (expr) == TEMPLATE_DECL
7273 ? DECL_TEMPLATE_RESULT (expr) : expr) == TYPE_DECL)
7275 if (complain & tf_error)
7276 error ("`%E' names a type, but a non-type is expected",
7278 return error_mark_node;
7283 check_accessibility_of_qualified_id (expr, /*object_type=*/NULL_TREE,
7286 /* Remember that there was a reference to this entity. */
7290 if (!args && TREE_CODE (expr) == VAR_DECL)
7291 expr = DECL_INITIAL (expr);
7295 expr = lookup_template_function (expr, template_args);
7297 if (expr == error_mark_node && complain & tf_error)
7298 qualified_name_lookup_error (scope, TREE_OPERAND (qualified_id, 1));
7299 else if (TYPE_P (scope))
7301 expr = (adjust_result_of_qualified_name_lookup
7302 (expr, scope, current_class_type));
7303 expr = finish_qualified_id_expr (scope, expr, done, address_p);
7309 /* Like tsubst, but deals with expressions. This function just replaces
7310 template parms; to finish processing the resultant expression, use
7314 tsubst_copy (tree t, tree args, tsubst_flags_t complain, tree in_decl)
7316 enum tree_code code;
7319 if (t == NULL_TREE || t == error_mark_node)
7322 code = TREE_CODE (t);
7327 r = retrieve_local_specialization (t);
7328 my_friendly_assert (r != NULL, 20020903);
7336 if (DECL_TEMPLATE_PARM_P (t))
7337 return tsubst_copy (DECL_INITIAL (t), args, complain, in_decl);
7338 /* There is no need to substitute into namespace-scope
7340 if (DECL_NAMESPACE_SCOPE_P (t))
7343 /* Unfortunately, we cannot just call lookup_name here.
7346 template <int I> int f() {
7348 struct S { void g() { E e = a; } };
7351 When we instantiate f<7>::S::g(), say, lookup_name is not
7352 clever enough to find f<7>::a. */
7354 = tsubst_aggr_type (TREE_TYPE (t), args, complain, in_decl,
7355 /*entering_scope=*/0);
7357 for (v = TYPE_VALUES (enum_type);
7360 if (TREE_PURPOSE (v) == DECL_NAME (t))
7361 return TREE_VALUE (v);
7363 /* We didn't find the name. That should never happen; if
7364 name-lookup found it during preliminary parsing, we
7365 should find it again here during instantiation. */
7371 if (DECL_CONTEXT (t))
7375 ctx = tsubst_aggr_type (DECL_CONTEXT (t), args, complain, in_decl,
7376 /*entering_scope=*/1);
7377 if (ctx != DECL_CONTEXT (t))
7378 return lookup_field (ctx, DECL_NAME (t), 0, false);
7384 if ((DECL_LANG_SPECIFIC (t) && DECL_TEMPLATE_INFO (t))
7385 || local_variable_p (t))
7386 t = tsubst (t, args, complain, in_decl);
7391 return tsubst_baselink (t, current_class_type, args, complain, in_decl);
7394 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t))
7395 return tsubst (TREE_TYPE (DECL_TEMPLATE_RESULT (t)),
7396 args, complain, in_decl);
7397 else if (is_member_template (t))
7398 return tsubst (t, args, complain, in_decl);
7399 else if (DECL_CLASS_SCOPE_P (t)
7400 && uses_template_parms (DECL_CONTEXT (t)))
7402 /* Template template argument like the following example need
7405 template <template <class> class TT> struct C {};
7406 template <class T> struct D {
7407 template <class U> struct E {};
7412 We are processing the template argument `E' in #1 for
7413 the template instantiation #2. Originally, `E' is a
7414 TEMPLATE_DECL with `D<T>' as its DECL_CONTEXT. Now we
7415 have to substitute this with one having context `D<int>'. */
7417 tree context = tsubst (DECL_CONTEXT (t), args, complain, in_decl);
7418 return lookup_field (context, DECL_NAME(t), 0, false);
7421 /* Ordinary template template argument. */
7425 case REINTERPRET_CAST_EXPR:
7426 case CONST_CAST_EXPR:
7427 case STATIC_CAST_EXPR:
7428 case DYNAMIC_CAST_EXPR:
7431 (code, tsubst (TREE_TYPE (t), args, complain, in_decl),
7432 tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl));
7436 case TRUTH_NOT_EXPR:
7439 case CONVERT_EXPR: /* Unary + */
7448 (code, tsubst (TREE_TYPE (t), args, complain, in_decl),
7449 tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl));
7456 object = tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl);
7457 name = TREE_OPERAND (t, 1);
7458 if (TREE_CODE (name) == BIT_NOT_EXPR)
7460 name = tsubst_copy (TREE_OPERAND (name, 0), args,
7462 name = build1 (BIT_NOT_EXPR, NULL_TREE, name);
7464 else if (TREE_CODE (name) == SCOPE_REF
7465 && TREE_CODE (TREE_OPERAND (name, 1)) == BIT_NOT_EXPR)
7467 tree base = tsubst_copy (TREE_OPERAND (name, 0), args,
7469 name = TREE_OPERAND (name, 1);
7470 name = tsubst_copy (TREE_OPERAND (name, 0), args,
7472 name = build1 (BIT_NOT_EXPR, NULL_TREE, name);
7473 name = build_nt (SCOPE_REF, base, name);
7475 else if (TREE_CODE (name) == BASELINK)
7476 name = tsubst_baselink (name,
7477 non_reference (TREE_TYPE (object)),
7481 name = tsubst_copy (name, args, complain, in_decl);
7482 return build_nt (COMPONENT_REF, object, name);
7488 case TRUNC_DIV_EXPR:
7490 case FLOOR_DIV_EXPR:
7491 case ROUND_DIV_EXPR:
7492 case EXACT_DIV_EXPR:
7496 case TRUNC_MOD_EXPR:
7497 case FLOOR_MOD_EXPR:
7498 case TRUTH_ANDIF_EXPR:
7499 case TRUTH_ORIF_EXPR:
7500 case TRUTH_AND_EXPR:
7519 case PREDECREMENT_EXPR:
7520 case PREINCREMENT_EXPR:
7521 case POSTDECREMENT_EXPR:
7522 case POSTINCREMENT_EXPR:
7524 (code, tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl),
7525 tsubst_copy (TREE_OPERAND (t, 1), args, complain, in_decl));
7528 return build_nt (code,
7529 tsubst_copy (TREE_OPERAND (t, 0), args,
7531 tsubst_copy (TREE_OPERAND (t, 1), args, complain,
7536 /* This processing should really occur in tsubst_expr. However,
7537 tsubst_expr does not recurse into expressions, since it
7538 assumes that there aren't any statements inside them. So, we
7539 need to expand the STMT_EXPR here. */
7540 if (!processing_template_decl)
7542 tree stmt_expr = begin_stmt_expr ();
7544 tsubst_expr (STMT_EXPR_STMT (t), args,
7545 complain | tf_stmt_expr_cmpd, in_decl);
7546 return finish_stmt_expr (stmt_expr, false);
7553 case PSEUDO_DTOR_EXPR:
7556 (code, tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl),
7557 tsubst_copy (TREE_OPERAND (t, 1), args, complain, in_decl),
7558 tsubst_copy (TREE_OPERAND (t, 2), args, complain, in_decl));
7565 (code, tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl),
7566 tsubst_copy (TREE_OPERAND (t, 1), args, complain, in_decl),
7567 tsubst_copy (TREE_OPERAND (t, 2), args, complain, in_decl));
7568 NEW_EXPR_USE_GLOBAL (r) = NEW_EXPR_USE_GLOBAL (t);
7575 (code, tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl),
7576 tsubst_copy (TREE_OPERAND (t, 1), args, complain, in_decl));
7577 DELETE_EXPR_USE_GLOBAL (r) = DELETE_EXPR_USE_GLOBAL (t);
7578 DELETE_EXPR_USE_VEC (r) = DELETE_EXPR_USE_VEC (t);
7582 case TEMPLATE_ID_EXPR:
7584 /* Substituted template arguments */
7585 tree fn = TREE_OPERAND (t, 0);
7586 tree targs = TREE_OPERAND (t, 1);
7588 fn = tsubst_copy (fn, args, complain, in_decl);
7590 targs = tsubst_template_args (targs, args, complain, in_decl);
7592 return lookup_template_function (fn, targs);
7597 tree purpose, value, chain;
7599 if (t == void_list_node)
7602 purpose = TREE_PURPOSE (t);
7604 purpose = tsubst_copy (purpose, args, complain, in_decl);
7605 value = TREE_VALUE (t);
7607 value = tsubst_copy (value, args, complain, in_decl);
7608 chain = TREE_CHAIN (t);
7609 if (chain && chain != void_type_node)
7610 chain = tsubst_copy (chain, args, complain, in_decl);
7611 if (purpose == TREE_PURPOSE (t)
7612 && value == TREE_VALUE (t)
7613 && chain == TREE_CHAIN (t))
7615 return tree_cons (purpose, value, chain);
7622 case TEMPLATE_TYPE_PARM:
7623 case TEMPLATE_TEMPLATE_PARM:
7624 case BOUND_TEMPLATE_TEMPLATE_PARM:
7625 case TEMPLATE_PARM_INDEX:
7627 case REFERENCE_TYPE:
7633 case UNBOUND_CLASS_TEMPLATE:
7636 return tsubst (t, args, complain, in_decl);
7638 case IDENTIFIER_NODE:
7639 if (IDENTIFIER_TYPENAME_P (t))
7641 tree new_type = tsubst (TREE_TYPE (t), args, complain, in_decl);
7642 return mangle_conv_op_name_for_type (new_type);
7649 r = build_constructor
7650 (tsubst (TREE_TYPE (t), args, complain, in_decl),
7651 tsubst_copy (CONSTRUCTOR_ELTS (t), args, complain, in_decl));
7652 TREE_HAS_CONSTRUCTOR (r) = TREE_HAS_CONSTRUCTOR (t);
7657 return build_x_va_arg (tsubst_copy (TREE_OPERAND (t, 0), args, complain,
7659 tsubst (TREE_TYPE (t), args, complain, in_decl));
7666 /* Like tsubst_copy for expressions, etc. but also does semantic
7670 tsubst_expr (tree t, tree args, tsubst_flags_t complain, tree in_decl)
7673 tsubst_flags_t stmt_expr
7674 = complain & (tf_stmt_expr_cmpd | tf_stmt_expr_body);
7676 complain ^= stmt_expr;
7677 if (t == NULL_TREE || t == error_mark_node)
7680 if (processing_template_decl)
7681 return tsubst_copy (t, args, complain, in_decl);
7683 if (!STATEMENT_CODE_P (TREE_CODE (t)))
7684 return tsubst_copy_and_build (t, args, complain, in_decl,
7685 /*function_p=*/false);
7687 switch (TREE_CODE (t))
7689 case CTOR_INITIALIZER:
7691 finish_mem_initializers (tsubst_initializer_list
7692 (TREE_OPERAND (t, 0), args));
7697 finish_return_stmt (tsubst_expr (RETURN_STMT_EXPR (t),
7698 args, complain, in_decl));
7707 r = tsubst_expr (EXPR_STMT_EXPR (t), args, complain, in_decl);
7708 if (stmt_expr & tf_stmt_expr_body && !TREE_CHAIN (t))
7709 finish_stmt_expr_expr (r);
7711 finish_expr_stmt (r);
7717 do_using_directive (tsubst_expr (USING_STMT_NAMESPACE (t),
7718 args, complain, in_decl));
7727 decl = DECL_STMT_DECL (t);
7728 if (TREE_CODE (decl) == LABEL_DECL)
7729 finish_label_decl (DECL_NAME (decl));
7730 else if (TREE_CODE (decl) == USING_DECL)
7732 tree scope = DECL_INITIAL (decl);
7733 tree name = DECL_NAME (decl);
7736 scope = tsubst_expr (scope, args, complain, in_decl);
7737 decl = lookup_qualified_name (scope, name,
7738 /*is_type_p=*/false,
7739 /*complain=*/false);
7740 if (decl == error_mark_node)
7741 qualified_name_lookup_error (scope, name);
7743 do_local_using_decl (decl);
7747 init = DECL_INITIAL (decl);
7748 decl = tsubst (decl, args, complain, in_decl);
7749 if (decl != error_mark_node)
7752 DECL_INITIAL (decl) = error_mark_node;
7753 /* By marking the declaration as instantiated, we avoid
7754 trying to instantiate it. Since instantiate_decl can't
7755 handle local variables, and since we've already done
7756 all that needs to be done, that's the right thing to
7758 if (TREE_CODE (decl) == VAR_DECL)
7759 DECL_TEMPLATE_INSTANTIATED (decl) = 1;
7760 if (TREE_CODE (decl) == VAR_DECL
7761 && ANON_AGGR_TYPE_P (TREE_TYPE (decl)))
7762 /* Anonymous aggregates are a special case. */
7763 finish_anon_union (decl);
7766 maybe_push_decl (decl);
7767 if (TREE_CODE (decl) == VAR_DECL
7768 && DECL_PRETTY_FUNCTION_P (decl))
7770 /* For __PRETTY_FUNCTION__ we have to adjust the
7772 const char *const name
7773 = cxx_printable_name (current_function_decl, 2);
7774 init = cp_fname_init (name, &TREE_TYPE (decl));
7777 init = tsubst_expr (init, args, complain, in_decl);
7778 cp_finish_decl (decl, init, NULL_TREE, 0);
7783 /* A DECL_STMT can also be used as an expression, in the condition
7784 clause of an if/for/while construct. If we aren't followed by
7785 another statement, return our decl. */
7786 if (TREE_CHAIN (t) == NULL_TREE)
7795 stmt = begin_for_stmt ();
7796 tsubst_expr (FOR_INIT_STMT (t), args, complain, in_decl);
7797 finish_for_init_stmt (stmt);
7798 finish_for_cond (tsubst_expr (FOR_COND (t),
7799 args, complain, in_decl),
7801 tmp = tsubst_expr (FOR_EXPR (t), args, complain, in_decl);
7802 finish_for_expr (tmp, stmt);
7803 tsubst_expr (FOR_BODY (t), args, complain, in_decl);
7804 finish_for_stmt (stmt);
7811 stmt = begin_while_stmt ();
7812 finish_while_stmt_cond (tsubst_expr (WHILE_COND (t),
7813 args, complain, in_decl),
7815 tsubst_expr (WHILE_BODY (t), args, complain, in_decl);
7816 finish_while_stmt (stmt);
7823 stmt = begin_do_stmt ();
7824 tsubst_expr (DO_BODY (t), args, complain, in_decl);
7825 finish_do_body (stmt);
7826 finish_do_stmt (tsubst_expr (DO_COND (t),
7827 args, complain, in_decl),
7835 stmt = begin_if_stmt ();
7836 finish_if_stmt_cond (tsubst_expr (IF_COND (t),
7837 args, complain, in_decl),
7840 if (tmp = THEN_CLAUSE (t), tmp)
7842 tsubst_expr (tmp, args, complain, in_decl);
7843 finish_then_clause (stmt);
7846 if (tmp = ELSE_CLAUSE (t), tmp)
7848 begin_else_clause ();
7849 tsubst_expr (tmp, args, complain, in_decl);
7850 finish_else_clause (stmt);
7860 if (COMPOUND_STMT_BODY_BLOCK (t))
7861 stmt = begin_function_body ();
7863 stmt = begin_compound_stmt (COMPOUND_STMT_NO_SCOPE (t));
7865 tsubst_expr (COMPOUND_BODY (t), args,
7866 complain | ((stmt_expr & tf_stmt_expr_cmpd) << 1),
7869 if (COMPOUND_STMT_BODY_BLOCK (t))
7870 finish_function_body (stmt);
7872 finish_compound_stmt (stmt);
7878 finish_break_stmt ();
7883 finish_continue_stmt ();
7891 stmt = begin_switch_stmt ();
7892 val = tsubst_expr (SWITCH_COND (t), args, complain, in_decl);
7893 finish_switch_cond (val, stmt);
7894 tsubst_expr (SWITCH_BODY (t), args, complain, in_decl);
7895 finish_switch_stmt (stmt);
7901 finish_case_label (tsubst_expr (CASE_LOW (t), args, complain, in_decl),
7902 tsubst_expr (CASE_HIGH (t), args, complain,
7907 input_line = STMT_LINENO (t);
7908 finish_label_stmt (DECL_NAME (LABEL_STMT_LABEL (t)));
7912 input_filename = FILE_STMT_FILENAME (t);
7913 add_stmt (build_nt (FILE_STMT, FILE_STMT_FILENAME_NODE (t)));
7918 tmp = GOTO_DESTINATION (t);
7919 if (TREE_CODE (tmp) != LABEL_DECL)
7920 /* Computed goto's must be tsubst'd into. On the other hand,
7921 non-computed gotos must not be; the identifier in question
7922 will have no binding. */
7923 tmp = tsubst_expr (tmp, args, complain, in_decl);
7925 tmp = DECL_NAME (tmp);
7926 finish_goto_stmt (tmp);
7931 tmp = finish_asm_stmt
7933 tsubst_expr (ASM_STRING (t), args, complain, in_decl),
7934 tsubst_expr (ASM_OUTPUTS (t), args, complain, in_decl),
7935 tsubst_expr (ASM_INPUTS (t), args, complain, in_decl),
7936 tsubst_expr (ASM_CLOBBERS (t), args, complain, in_decl));
7937 ASM_INPUT_P (tmp) = ASM_INPUT_P (t);
7944 stmt = begin_try_block ();
7945 tsubst_expr (TRY_STMTS (t), args, complain, in_decl);
7946 finish_cleanup_try_block (stmt);
7947 finish_cleanup (tsubst_expr (TRY_HANDLERS (t), args,
7953 if (FN_TRY_BLOCK_P (t))
7954 stmt = begin_function_try_block ();
7956 stmt = begin_try_block ();
7958 tsubst_expr (TRY_STMTS (t), args, complain, in_decl);
7960 if (FN_TRY_BLOCK_P (t))
7961 finish_function_try_block (stmt);
7963 finish_try_block (stmt);
7965 tsubst_expr (TRY_HANDLERS (t), args, complain, in_decl);
7966 if (FN_TRY_BLOCK_P (t))
7967 finish_function_handler_sequence (stmt);
7969 finish_handler_sequence (stmt);
7978 stmt = begin_handler ();
7979 if (HANDLER_PARMS (t))
7981 decl = DECL_STMT_DECL (HANDLER_PARMS (t));
7982 decl = tsubst (decl, args, complain, in_decl);
7983 /* Prevent instantiate_decl from trying to instantiate
7984 this variable. We've already done all that needs to be
7986 DECL_TEMPLATE_INSTANTIATED (decl) = 1;
7990 finish_handler_parms (decl, stmt);
7991 tsubst_expr (HANDLER_BODY (t), args, complain, in_decl);
7992 finish_handler (stmt);
7998 tsubst (TREE_TYPE (t), args, complain, NULL_TREE);
8005 return tsubst_expr (TREE_CHAIN (t), args, complain | stmt_expr, in_decl);
8008 /* T is a postfix-expression that is not being used in a function
8009 call. Return the substituted version of T. */
8012 tsubst_non_call_postfix_expression (tree t, tree args,
8013 tsubst_flags_t complain,
8016 if (TREE_CODE (t) == SCOPE_REF)
8017 t = tsubst_qualified_id (t, args, complain, in_decl,
8018 /*done=*/false, /*address_p=*/false);
8020 t = tsubst_copy_and_build (t, args, complain, in_decl,
8021 /*function_p=*/false);
8026 /* Like tsubst but deals with expressions and performs semantic
8027 analysis. FUNCTION_P is true if T is the "F" in "F (ARGS)". */
8030 tsubst_copy_and_build (tree t,
8032 tsubst_flags_t complain,
8036 #define RECUR(NODE) \
8037 tsubst_copy_and_build (NODE, args, complain, in_decl, /*function_p=*/false)
8041 if (t == NULL_TREE || t == error_mark_node)
8044 switch (TREE_CODE (t))
8049 case IDENTIFIER_NODE:
8053 tree qualifying_class;
8054 bool non_constant_expression_p;
8055 const char *error_msg;
8057 if (IDENTIFIER_TYPENAME_P (t))
8059 tree new_type = tsubst (TREE_TYPE (t), args, complain, in_decl);
8060 t = mangle_conv_op_name_for_type (new_type);
8063 /* Look up the name. */
8064 decl = lookup_name (t, 0);
8066 /* By convention, expressions use ERROR_MARK_NODE to indicate
8067 failure, not NULL_TREE. */
8068 if (decl == NULL_TREE)
8069 decl = error_mark_node;
8071 decl = finish_id_expression (t, decl, NULL_TREE,
8074 /*constant_expression_p=*/false,
8075 /*allow_non_constant_expression_p=*/false,
8076 &non_constant_expression_p,
8080 if (!function_p && TREE_CODE (decl) == IDENTIFIER_NODE)
8081 decl = unqualified_name_lookup_error (decl);
8085 case TEMPLATE_ID_EXPR:
8088 tree template = RECUR (TREE_OPERAND (t, 0));
8089 tree targs = TREE_OPERAND (t, 1);
8092 targs = tsubst_template_args (targs, args, complain, in_decl);
8094 if (TREE_CODE (template) == COMPONENT_REF)
8096 object = TREE_OPERAND (template, 0);
8097 template = TREE_OPERAND (template, 1);
8101 template = lookup_template_function (template, targs);
8104 return build (COMPONENT_REF, TREE_TYPE (template),
8111 return build_x_indirect_ref (RECUR (TREE_OPERAND (t, 0)), "unary *");
8114 return build_functional_cast
8115 (tsubst (TREE_TYPE (t), args, complain, in_decl),
8116 RECUR (TREE_OPERAND (t, 0)));
8118 case REINTERPRET_CAST_EXPR:
8119 return build_reinterpret_cast
8120 (tsubst (TREE_TYPE (t), args, complain, in_decl),
8121 RECUR (TREE_OPERAND (t, 0)));
8123 case CONST_CAST_EXPR:
8124 return build_const_cast
8125 (tsubst (TREE_TYPE (t), args, complain, in_decl),
8126 RECUR (TREE_OPERAND (t, 0)));
8128 case DYNAMIC_CAST_EXPR:
8129 return build_dynamic_cast
8130 (tsubst (TREE_TYPE (t), args, complain, in_decl),
8131 RECUR (TREE_OPERAND (t, 0)));
8133 case STATIC_CAST_EXPR:
8134 return build_static_cast
8135 (tsubst (TREE_TYPE (t), args, complain, in_decl),
8136 RECUR (TREE_OPERAND (t, 0)));
8138 case POSTDECREMENT_EXPR:
8139 case POSTINCREMENT_EXPR:
8140 op1 = tsubst_non_call_postfix_expression (TREE_OPERAND (t, 0),
8141 args, complain, in_decl);
8142 return build_x_unary_op (TREE_CODE (t), op1);
8144 case PREDECREMENT_EXPR:
8145 case PREINCREMENT_EXPR:
8149 case TRUTH_NOT_EXPR:
8150 case CONVERT_EXPR: /* Unary + */
8153 return build_x_unary_op (TREE_CODE (t), RECUR (TREE_OPERAND (t, 0)));
8156 op1 = TREE_OPERAND (t, 0);
8157 if (TREE_CODE (op1) == SCOPE_REF)
8158 op1 = tsubst_qualified_id (op1, args, complain, in_decl,
8159 /*done=*/true, /*address_p=*/true);
8161 op1 = tsubst_non_call_postfix_expression (op1, args, complain,
8163 if (TREE_CODE (op1) == LABEL_DECL)
8164 return finish_label_address_expr (DECL_NAME (op1));
8165 return build_x_unary_op (ADDR_EXPR, op1);
8170 case TRUNC_DIV_EXPR:
8172 case FLOOR_DIV_EXPR:
8173 case ROUND_DIV_EXPR:
8174 case EXACT_DIV_EXPR:
8178 case TRUNC_MOD_EXPR:
8179 case FLOOR_MOD_EXPR:
8180 case TRUTH_ANDIF_EXPR:
8181 case TRUTH_ORIF_EXPR:
8182 case TRUTH_AND_EXPR:
8198 return build_x_binary_op
8200 RECUR (TREE_OPERAND (t, 0)),
8201 RECUR (TREE_OPERAND (t, 1)));
8204 return tsubst_qualified_id (t, args, complain, in_decl, /*done=*/true,
8205 /*address_p=*/false);
8208 if (tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl)
8211 return build_nt (ARRAY_REF, NULL_TREE, RECUR (TREE_OPERAND (t, 1)));
8213 op1 = tsubst_non_call_postfix_expression (TREE_OPERAND (t, 0),
8214 args, complain, in_decl);
8215 /* Remember that there was a reference to this entity. */
8218 return grok_array_decl (op1, RECUR (TREE_OPERAND (t, 1)));
8222 op1 = TREE_OPERAND (t, 0);
8225 /* When there are no ARGS, we are trying to evaluate a
8226 non-dependent expression from the parser. Trying to do
8227 the substitutions may not work. */
8229 op1 = TREE_TYPE (op1);
8238 return cxx_sizeof_or_alignof_type (op1, TREE_CODE (t), true);
8240 return cxx_sizeof_or_alignof_expr (op1, TREE_CODE (t));
8243 return build_x_modify_expr
8244 (RECUR (TREE_OPERAND (t, 0)),
8245 TREE_CODE (TREE_OPERAND (t, 1)),
8246 RECUR (TREE_OPERAND (t, 2)));
8249 op1 = tsubst_non_call_postfix_expression (TREE_OPERAND (t, 0),
8250 args, complain, in_decl);
8251 /* Remember that there was a reference to this entity. */
8254 return build_x_arrow (op1);
8258 (RECUR (TREE_OPERAND (t, 0)),
8259 RECUR (TREE_OPERAND (t, 1)),
8260 RECUR (TREE_OPERAND (t, 2)),
8261 NEW_EXPR_USE_GLOBAL (t));
8264 return delete_sanity
8265 (RECUR (TREE_OPERAND (t, 0)),
8266 RECUR (TREE_OPERAND (t, 1)),
8267 DELETE_EXPR_USE_VEC (t),
8268 DELETE_EXPR_USE_GLOBAL (t));
8271 return build_x_compound_expr (RECUR (TREE_OPERAND (t, 0)),
8272 RECUR (TREE_OPERAND (t, 1)));
8281 function = TREE_OPERAND (t, 0);
8282 /* When we parsed the expression, we determined whether or
8283 not Koenig lookup should be performed. */
8284 koenig_p = KOENIG_LOOKUP_P (t);
8285 if (TREE_CODE (function) == SCOPE_REF)
8288 function = tsubst_qualified_id (function, args, complain, in_decl,
8290 /*address_p=*/false);
8294 qualified_p = (TREE_CODE (function) == COMPONENT_REF
8295 && (TREE_CODE (TREE_OPERAND (function, 1))
8297 function = tsubst_copy_and_build (function, args, complain,
8300 if (BASELINK_P (function))
8304 call_args = RECUR (TREE_OPERAND (t, 1));
8307 && (is_overloaded_fn (function)
8308 || DECL_P (function)
8309 || TREE_CODE (function) == IDENTIFIER_NODE))
8310 function = perform_koenig_lookup (function, call_args);
8312 if (TREE_CODE (function) == IDENTIFIER_NODE)
8314 unqualified_name_lookup_error (function);
8315 return error_mark_node;
8318 /* Remember that there was a reference to this entity. */
8319 if (DECL_P (function))
8320 mark_used (function);
8322 function = convert_from_reference (function);
8324 if (TREE_CODE (function) == OFFSET_REF)
8325 return build_offset_ref_call_from_tree (function, call_args);
8326 if (TREE_CODE (function) == COMPONENT_REF)
8327 return (build_new_method_call
8328 (TREE_OPERAND (function, 0),
8329 TREE_OPERAND (function, 1),
8330 call_args, NULL_TREE,
8331 qualified_p ? LOOKUP_NONVIRTUAL : LOOKUP_NORMAL));
8332 return finish_call_expr (function, call_args,
8333 /*disallow_virtual=*/qualified_p,
8338 return build_x_conditional_expr
8339 (RECUR (TREE_OPERAND (t, 0)),
8340 RECUR (TREE_OPERAND (t, 1)),
8341 RECUR (TREE_OPERAND (t, 2)));
8343 case PSEUDO_DTOR_EXPR:
8344 return finish_pseudo_destructor_expr
8345 (RECUR (TREE_OPERAND (t, 0)),
8346 RECUR (TREE_OPERAND (t, 1)),
8347 RECUR (TREE_OPERAND (t, 2)));
8351 tree purpose, value, chain;
8353 if (t == void_list_node)
8356 purpose = TREE_PURPOSE (t);
8358 purpose = RECUR (purpose);
8359 value = TREE_VALUE (t);
8361 value = RECUR (value);
8362 chain = TREE_CHAIN (t);
8363 if (chain && chain != void_type_node)
8364 chain = RECUR (chain);
8365 if (purpose == TREE_PURPOSE (t)
8366 && value == TREE_VALUE (t)
8367 && chain == TREE_CHAIN (t))
8369 return tree_cons (purpose, value, chain);
8377 object = tsubst_non_call_postfix_expression (TREE_OPERAND (t, 0),
8378 args, complain, in_decl);
8379 /* Remember that there was a reference to this entity. */
8380 if (DECL_P (object))
8383 member = TREE_OPERAND (t, 1);
8384 if (BASELINK_P (member))
8385 member = tsubst_baselink (member,
8386 non_reference (TREE_TYPE (object)),
8387 args, complain, in_decl);
8389 member = tsubst_copy (member, args, complain, in_decl);
8391 if (!CLASS_TYPE_P (TREE_TYPE (object)))
8393 if (TREE_CODE (member) == BIT_NOT_EXPR)
8394 return finish_pseudo_destructor_expr (object,
8396 TREE_TYPE (object));
8397 else if (TREE_CODE (member) == SCOPE_REF
8398 && (TREE_CODE (TREE_OPERAND (member, 1)) == BIT_NOT_EXPR))
8399 return finish_pseudo_destructor_expr (object,
8401 TREE_TYPE (object));
8403 else if (TREE_CODE (member) == SCOPE_REF
8404 && TREE_CODE (TREE_OPERAND (member, 1)) == TEMPLATE_ID_EXPR)
8409 /* Lookup the template functions now that we know what the
8411 tmpl = TREE_OPERAND (TREE_OPERAND (member, 1), 0);
8412 args = TREE_OPERAND (TREE_OPERAND (member, 1), 1);
8413 member = lookup_qualified_name (TREE_OPERAND (member, 0), tmpl,
8414 /*is_type_p=*/false,
8415 /*complain=*/false);
8416 if (BASELINK_P (member))
8417 BASELINK_FUNCTIONS (member)
8418 = build_nt (TEMPLATE_ID_EXPR, BASELINK_FUNCTIONS (member),
8422 qualified_name_lookup_error (TREE_TYPE (object), tmpl);
8423 return error_mark_node;
8426 else if (TREE_CODE (member) == FIELD_DECL)
8427 return finish_non_static_data_member (member, object, NULL_TREE);
8429 return finish_class_member_access_expr (object, member);
8434 (RECUR (TREE_OPERAND (t, 0)));
8440 tree type = tsubst (TREE_TYPE (t), args, complain, in_decl);
8443 /* digest_init will do the wrong thing if we let it. */
8444 if (type && TYPE_PTRMEMFUNC_P (type))
8448 /* We do not want to process the purpose of aggregate
8449 initializers as they are identifier nodes which will be
8450 looked up by digest_init. */
8451 purpose_p = !(type && IS_AGGR_TYPE (type));
8452 for (elts = CONSTRUCTOR_ELTS (t);
8454 elts = TREE_CHAIN (elts))
8456 tree purpose = TREE_PURPOSE (elts);
8457 tree value = TREE_VALUE (elts);
8459 if (purpose && purpose_p)
8460 purpose = RECUR (purpose);
8461 value = RECUR (value);
8462 r = tree_cons (purpose, value, r);
8465 r = build_constructor (NULL_TREE, nreverse (r));
8466 TREE_HAS_CONSTRUCTOR (r) = TREE_HAS_CONSTRUCTOR (t);
8469 return digest_init (type, r, 0);
8475 tree operand_0 = RECUR (TREE_OPERAND (t, 0));
8476 if (TYPE_P (operand_0))
8477 return get_typeid (operand_0);
8478 return build_typeid (operand_0);
8482 return convert_from_reference (tsubst_copy (t, args, complain, in_decl));
8486 t = tsubst_copy (t, args, complain, in_decl);
8488 /* If there are no ARGS, then we are evaluating a
8489 non-dependent expression. If the expression is
8490 non-dependent, the variable must be a constant. */
8491 t = DECL_INITIAL (t);
8492 return convert_from_reference (t);
8495 return build_x_va_arg (RECUR (TREE_OPERAND (t, 0)),
8496 tsubst_copy (TREE_TYPE (t), args, complain,
8500 return tsubst_copy (t, args, complain, in_decl);
8506 /* Verify that the instantiated ARGS are valid. For type arguments,
8507 make sure that the type's linkage is ok. For non-type arguments,
8508 make sure they are constants if they are integral or enumerations.
8509 Emit an error under control of COMPLAIN, and return TRUE on error. */
8512 check_instantiated_args (tree tmpl, tree args, tsubst_flags_t complain)
8514 int ix, len = DECL_NTPARMS (tmpl);
8515 bool result = false;
8517 for (ix = 0; ix != len; ix++)
8519 tree t = TREE_VEC_ELT (args, ix);
8523 /* [basic.link]: A name with no linkage (notably, the name
8524 of a class or enumeration declared in a local scope)
8525 shall not be used to declare an entity with linkage.
8526 This implies that names with no linkage cannot be used as
8527 template arguments. */
8528 tree nt = no_linkage_check (t);
8532 if (!(complain & tf_error))
8534 else if (TYPE_ANONYMOUS_P (nt))
8535 error ("`%T' uses anonymous type", t);
8537 error ("`%T' uses local type `%T'", t, nt);
8540 /* In order to avoid all sorts of complications, we do not
8541 allow variably-modified types as template arguments. */
8542 else if (variably_modified_type_p (t))
8544 if (complain & tf_error)
8545 error ("`%T' is a variably modified type", t);
8549 /* A non-type argument of integral or enumerated type must be a
8551 else if (TREE_TYPE (t)
8552 && INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (t))
8553 && !TREE_CONSTANT (t))
8555 if (complain & tf_error)
8556 error ("integral expression `%E' is not constant", t);
8560 if (result && complain & tf_error)
8561 error (" trying to instantiate `%D'", tmpl);
8565 /* Instantiate the indicated variable or function template TMPL with
8566 the template arguments in TARG_PTR. */
8569 instantiate_template (tree tmpl, tree targ_ptr, tsubst_flags_t complain)
8575 if (tmpl == error_mark_node)
8576 return error_mark_node;
8578 my_friendly_assert (TREE_CODE (tmpl) == TEMPLATE_DECL, 283);
8580 /* If this function is a clone, handle it specially. */
8581 if (DECL_CLONED_FUNCTION_P (tmpl))
8583 tree spec = instantiate_template (DECL_CLONED_FUNCTION (tmpl), targ_ptr,
8587 /* Look for the clone. */
8588 for (clone = TREE_CHAIN (spec);
8589 clone && DECL_CLONED_FUNCTION_P (clone);
8590 clone = TREE_CHAIN (clone))
8591 if (DECL_NAME (clone) == DECL_NAME (tmpl))
8593 /* We should always have found the clone by now. */
8598 /* Check to see if we already have this specialization. */
8599 spec = retrieve_specialization (tmpl, targ_ptr);
8600 if (spec != NULL_TREE)
8603 gen_tmpl = most_general_template (tmpl);
8604 if (tmpl != gen_tmpl)
8606 /* The TMPL is a partial instantiation. To get a full set of
8607 arguments we must add the arguments used to perform the
8608 partial instantiation. */
8609 targ_ptr = add_outermost_template_args (DECL_TI_ARGS (tmpl),
8612 /* Check to see if we already have this specialization. */
8613 spec = retrieve_specialization (gen_tmpl, targ_ptr);
8614 if (spec != NULL_TREE)
8618 if (check_instantiated_args (gen_tmpl, INNERMOST_TEMPLATE_ARGS (targ_ptr),
8620 return error_mark_node;
8622 /* We are building a FUNCTION_DECL, during which the access of its
8623 parameters and return types have to be checked. However this
8624 FUNCTION_DECL which is the desired context for access checking
8625 is not built yet. We solve this chicken-and-egg problem by
8626 deferring all checks until we have the FUNCTION_DECL. */
8627 push_deferring_access_checks (dk_deferred);
8629 /* substitute template parameters */
8630 fndecl = tsubst (DECL_TEMPLATE_RESULT (gen_tmpl),
8631 targ_ptr, complain, gen_tmpl);
8633 /* Now we know the specialization, compute access previously
8635 push_access_scope (fndecl);
8636 perform_deferred_access_checks ();
8637 pop_access_scope (fndecl);
8638 pop_deferring_access_checks ();
8640 /* The DECL_TI_TEMPLATE should always be the immediate parent
8641 template, not the most general template. */
8642 DECL_TI_TEMPLATE (fndecl) = tmpl;
8644 if (flag_external_templates)
8645 add_pending_template (fndecl);
8647 /* If we've just instantiated the main entry point for a function,
8648 instantiate all the alternate entry points as well. We do this
8649 by cloning the instantiation of the main entry point, not by
8650 instantiating the template clones. */
8651 if (TREE_CHAIN (gen_tmpl) && DECL_CLONED_FUNCTION_P (TREE_CHAIN (gen_tmpl)))
8652 clone_function_decl (fndecl, /*update_method_vec_p=*/0);
8657 /* The FN is a TEMPLATE_DECL for a function. The ARGS are the
8658 arguments that are being used when calling it. TARGS is a vector
8659 into which the deduced template arguments are placed.
8661 Return zero for success, 2 for an incomplete match that doesn't resolve
8662 all the types, and 1 for complete failure. An error message will be
8663 printed only for an incomplete match.
8665 If FN is a conversion operator, or we are trying to produce a specific
8666 specialization, RETURN_TYPE is the return type desired.
8668 The EXPLICIT_TARGS are explicit template arguments provided via a
8671 The parameter STRICT is one of:
8674 We are deducing arguments for a function call, as in
8678 We are deducing arguments for a conversion function, as in
8682 We are deducing arguments when doing an explicit instantiation
8683 as in [temp.explicit], when determining an explicit specialization
8684 as in [temp.expl.spec], or when taking the address of a function
8685 template, as in [temp.deduct.funcaddr].
8688 We are deducing arguments when calculating the partial
8689 ordering between specializations of function or class
8690 templates, as in [temp.func.order] and [temp.class.order].
8692 LEN is the number of parms to consider before returning success, or -1
8693 for all. This is used in partial ordering to avoid comparing parms for
8694 which no actual argument was passed, since they are not considered in
8695 overload resolution (and are explicitly excluded from consideration in
8696 partial ordering in [temp.func.order]/6). */
8699 fn_type_unification (tree fn,
8700 tree explicit_targs,
8704 unification_kind_t strict,
8711 my_friendly_assert (TREE_CODE (fn) == TEMPLATE_DECL, 0);
8713 fntype = TREE_TYPE (fn);
8718 The specified template arguments must match the template
8719 parameters in kind (i.e., type, nontype, template), and there
8720 must not be more arguments than there are parameters;
8721 otherwise type deduction fails.
8723 Nontype arguments must match the types of the corresponding
8724 nontype template parameters, or must be convertible to the
8725 types of the corresponding nontype parameters as specified in
8726 _temp.arg.nontype_, otherwise type deduction fails.
8728 All references in the function type of the function template
8729 to the corresponding template parameters are replaced by the
8730 specified template argument values. If a substitution in a
8731 template parameter or in the function type of the function
8732 template results in an invalid type, type deduction fails. */
8734 tree converted_args;
8738 = (coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn),
8739 explicit_targs, NULL_TREE, tf_none,
8740 /*require_all_arguments=*/0));
8741 if (converted_args == error_mark_node)
8744 /* Substitute the explicit args into the function type. This is
8745 necessary so that, for instance, explicitly declared function
8746 arguments can match null pointed constants. If we were given
8747 an incomplete set of explicit args, we must not do semantic
8748 processing during substitution as we could create partial
8750 incomplete = NUM_TMPL_ARGS (explicit_targs) != NUM_TMPL_ARGS (targs);
8751 processing_template_decl += incomplete;
8752 fntype = tsubst (fntype, converted_args, tf_none, NULL_TREE);
8753 processing_template_decl -= incomplete;
8755 if (fntype == error_mark_node)
8758 /* Place the explicitly specified arguments in TARGS. */
8759 for (i = NUM_TMPL_ARGS (converted_args); i--;)
8760 TREE_VEC_ELT (targs, i) = TREE_VEC_ELT (converted_args, i);
8763 parms = TYPE_ARG_TYPES (fntype);
8764 /* Never do unification on the 'this' parameter. */
8765 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn))
8766 parms = TREE_CHAIN (parms);
8770 /* We've been given a return type to match, prepend it. */
8771 parms = tree_cons (NULL_TREE, TREE_TYPE (fntype), parms);
8772 args = tree_cons (NULL_TREE, return_type, args);
8777 /* We allow incomplete unification without an error message here
8778 because the standard doesn't seem to explicitly prohibit it. Our
8779 callers must be ready to deal with unification failures in any
8781 result = type_unification_real (DECL_INNERMOST_TEMPLATE_PARMS (fn),
8782 targs, parms, args, /*subr=*/0,
8783 strict, /*allow_incomplete*/1, len);
8786 /* All is well so far. Now, check:
8790 When all template arguments have been deduced, all uses of
8791 template parameters in nondeduced contexts are replaced with
8792 the corresponding deduced argument values. If the
8793 substitution results in an invalid type, as described above,
8794 type deduction fails. */
8795 if (tsubst (TREE_TYPE (fn), targs, tf_none, NULL_TREE)
8802 /* Adjust types before performing type deduction, as described in
8803 [temp.deduct.call] and [temp.deduct.conv]. The rules in these two
8804 sections are symmetric. PARM is the type of a function parameter
8805 or the return type of the conversion function. ARG is the type of
8806 the argument passed to the call, or the type of the value
8807 initialized with the result of the conversion function. */
8810 maybe_adjust_types_for_deduction (unification_kind_t strict,
8823 /* Swap PARM and ARG throughout the remainder of this
8824 function; the handling is precisely symmetric since PARM
8825 will initialize ARG rather than vice versa. */
8833 /* There is nothing to do in this case. */
8837 /* DR 214. [temp.func.order] is underspecified, and leads to no
8838 ordering between things like `T *' and `T const &' for `U *'.
8839 The former has T=U and the latter T=U*. The former looks more
8840 specialized and John Spicer considers it well-formed (the EDG
8841 compiler accepts it).
8843 John also confirms that deduction should proceed as in a function
8844 call. Which implies the usual ARG and PARM conversions as DEDUCE_CALL.
8845 However, in ordering, ARG can have REFERENCE_TYPE, but no argument
8846 to an actual call can have such a type.
8848 If both ARG and PARM are REFERENCE_TYPE, we change neither.
8849 If only ARG is a REFERENCE_TYPE, we look through that and then
8850 proceed as with DEDUCE_CALL (which could further convert it). */
8851 if (TREE_CODE (*arg) == REFERENCE_TYPE)
8853 if (TREE_CODE (*parm) == REFERENCE_TYPE)
8855 *arg = TREE_TYPE (*arg);
8862 if (TREE_CODE (*parm) != REFERENCE_TYPE)
8864 /* [temp.deduct.call]
8866 If P is not a reference type:
8868 --If A is an array type, the pointer type produced by the
8869 array-to-pointer standard conversion (_conv.array_) is
8870 used in place of A for type deduction; otherwise,
8872 --If A is a function type, the pointer type produced by
8873 the function-to-pointer standard conversion
8874 (_conv.func_) is used in place of A for type deduction;
8877 --If A is a cv-qualified type, the top level
8878 cv-qualifiers of A's type are ignored for type
8880 if (TREE_CODE (*arg) == ARRAY_TYPE)
8881 *arg = build_pointer_type (TREE_TYPE (*arg));
8882 else if (TREE_CODE (*arg) == FUNCTION_TYPE)
8883 *arg = build_pointer_type (*arg);
8885 *arg = TYPE_MAIN_VARIANT (*arg);
8888 /* [temp.deduct.call]
8890 If P is a cv-qualified type, the top level cv-qualifiers
8891 of P's type are ignored for type deduction. If P is a
8892 reference type, the type referred to by P is used for
8894 *parm = TYPE_MAIN_VARIANT (*parm);
8895 if (TREE_CODE (*parm) == REFERENCE_TYPE)
8897 *parm = TREE_TYPE (*parm);
8898 result |= UNIFY_ALLOW_OUTER_MORE_CV_QUAL;
8901 /* DR 322. For conversion deduction, remove a reference type on parm
8902 too (which has been swapped into ARG). */
8903 if (strict == DEDUCE_CONV && TREE_CODE (*arg) == REFERENCE_TYPE)
8904 *arg = TREE_TYPE (*arg);
8909 /* Most parms like fn_type_unification.
8911 If SUBR is 1, we're being called recursively (to unify the
8912 arguments of a function or method parameter of a function
8916 type_unification_real (tree tparms,
8921 unification_kind_t strict,
8922 int allow_incomplete,
8927 int ntparms = TREE_VEC_LENGTH (tparms);
8929 int saw_undeduced = 0;
8933 my_friendly_assert (TREE_CODE (tparms) == TREE_VEC, 289);
8934 my_friendly_assert (xparms == NULL_TREE
8935 || TREE_CODE (xparms) == TREE_LIST, 290);
8936 my_friendly_assert (!xargs || TREE_CODE (xargs) == TREE_LIST, 291);
8937 my_friendly_assert (ntparms > 0, 292);
8942 sub_strict = (UNIFY_ALLOW_OUTER_LEVEL | UNIFY_ALLOW_MORE_CV_QUAL
8943 | UNIFY_ALLOW_DERIVED);
8947 sub_strict = UNIFY_ALLOW_LESS_CV_QUAL;
8951 sub_strict = UNIFY_ALLOW_NONE;
8955 sub_strict = UNIFY_ALLOW_NONE;
8971 && parms != void_list_node
8973 && args != void_list_node)
8975 parm = TREE_VALUE (parms);
8976 parms = TREE_CHAIN (parms);
8977 arg = TREE_VALUE (args);
8978 args = TREE_CHAIN (args);
8980 if (arg == error_mark_node)
8982 if (arg == unknown_type_node)
8983 /* We can't deduce anything from this, but we might get all the
8984 template args from other function args. */
8987 /* Conversions will be performed on a function argument that
8988 corresponds with a function parameter that contains only
8989 non-deducible template parameters and explicitly specified
8990 template parameters. */
8991 if (! uses_template_parms (parm))
8996 type = TREE_TYPE (arg);
9003 if (strict == DEDUCE_EXACT || strict == DEDUCE_ORDER)
9005 if (same_type_p (parm, type))
9009 /* It might work; we shouldn't check now, because we might
9010 get into infinite recursion. Overload resolution will
9019 my_friendly_assert (TREE_TYPE (arg) != NULL_TREE, 293);
9020 if (type_unknown_p (arg))
9022 /* [temp.deduct.type] A template-argument can be deduced from
9023 a pointer to function or pointer to member function
9024 argument if the set of overloaded functions does not
9025 contain function templates and at most one of a set of
9026 overloaded functions provides a unique match. */
9028 if (resolve_overloaded_unification
9029 (tparms, targs, parm, arg, strict, sub_strict)
9034 arg = TREE_TYPE (arg);
9035 if (arg == error_mark_node)
9040 int arg_strict = sub_strict;
9043 arg_strict |= maybe_adjust_types_for_deduction (strict, &parm, &arg);
9045 if (unify (tparms, targs, parm, arg, arg_strict))
9049 /* Are we done with the interesting parms? */
9053 /* Fail if we've reached the end of the parm list, and more args
9054 are present, and the parm list isn't variadic. */
9055 if (args && args != void_list_node && parms == void_list_node)
9057 /* Fail if parms are left and they don't have default values. */
9059 && parms != void_list_node
9060 && TREE_PURPOSE (parms) == NULL_TREE)
9065 for (i = 0; i < ntparms; i++)
9066 if (TREE_VEC_ELT (targs, i) == NULL_TREE)
9068 tree tparm = TREE_VALUE (TREE_VEC_ELT (tparms, i));
9070 /* If this is an undeduced nontype parameter that depends on
9071 a type parameter, try another pass; its type may have been
9072 deduced from a later argument than the one from which
9073 this parameter can be deduced. */
9074 if (TREE_CODE (tparm) == PARM_DECL
9075 && uses_template_parms (TREE_TYPE (tparm))
9076 && !saw_undeduced++)
9079 if (!allow_incomplete)
9080 error ("incomplete type unification");
9086 /* Subroutine of type_unification_real. Args are like the variables at the
9087 call site. ARG is an overloaded function (or template-id); we try
9088 deducing template args from each of the overloads, and if only one
9089 succeeds, we go with that. Modifies TARGS and returns 0 on success. */
9092 resolve_overloaded_unification (tree tparms,
9096 unification_kind_t strict,
9099 tree tempargs = copy_node (targs);
9103 if (TREE_CODE (arg) == ADDR_EXPR)
9105 arg = TREE_OPERAND (arg, 0);
9111 if (TREE_CODE (arg) == COMPONENT_REF)
9112 /* Handle `&x' where `x' is some static or non-static member
9114 arg = TREE_OPERAND (arg, 1);
9116 if (TREE_CODE (arg) == OFFSET_REF)
9117 arg = TREE_OPERAND (arg, 1);
9119 /* Strip baselink information. */
9120 if (BASELINK_P (arg))
9121 arg = BASELINK_FUNCTIONS (arg);
9123 if (TREE_CODE (arg) == TEMPLATE_ID_EXPR)
9125 /* If we got some explicit template args, we need to plug them into
9126 the affected templates before we try to unify, in case the
9127 explicit args will completely resolve the templates in question. */
9129 tree expl_subargs = TREE_OPERAND (arg, 1);
9130 arg = TREE_OPERAND (arg, 0);
9132 for (; arg; arg = OVL_NEXT (arg))
9134 tree fn = OVL_CURRENT (arg);
9137 if (TREE_CODE (fn) != TEMPLATE_DECL)
9140 subargs = get_bindings_overload (fn, DECL_TEMPLATE_RESULT (fn),
9144 elem = tsubst (TREE_TYPE (fn), subargs, tf_none, NULL_TREE);
9145 good += try_one_overload (tparms, targs, tempargs, parm,
9146 elem, strict, sub_strict, addr_p);
9150 else if (TREE_CODE (arg) == OVERLOAD
9151 || TREE_CODE (arg) == FUNCTION_DECL)
9153 for (; arg; arg = OVL_NEXT (arg))
9154 good += try_one_overload (tparms, targs, tempargs, parm,
9155 TREE_TYPE (OVL_CURRENT (arg)),
9156 strict, sub_strict, addr_p);
9161 /* [temp.deduct.type] A template-argument can be deduced from a pointer
9162 to function or pointer to member function argument if the set of
9163 overloaded functions does not contain function templates and at most
9164 one of a set of overloaded functions provides a unique match.
9166 So if we found multiple possibilities, we return success but don't
9171 int i = TREE_VEC_LENGTH (targs);
9173 if (TREE_VEC_ELT (tempargs, i))
9174 TREE_VEC_ELT (targs, i) = TREE_VEC_ELT (tempargs, i);
9182 /* Subroutine of resolve_overloaded_unification; does deduction for a single
9183 overload. Fills TARGS with any deduced arguments, or error_mark_node if
9184 different overloads deduce different arguments for a given parm.
9185 ADDR_P is true if the expression for which deduction is being
9186 performed was of the form "& fn" rather than simply "fn".
9188 Returns 1 on success. */
9191 try_one_overload (tree tparms,
9196 unification_kind_t strict,
9204 /* [temp.deduct.type] A template-argument can be deduced from a pointer
9205 to function or pointer to member function argument if the set of
9206 overloaded functions does not contain function templates and at most
9207 one of a set of overloaded functions provides a unique match.
9209 So if this is a template, just return success. */
9211 if (uses_template_parms (arg))
9214 if (TREE_CODE (arg) == METHOD_TYPE)
9215 arg = build_ptrmemfunc_type (build_pointer_type (arg));
9217 arg = build_pointer_type (arg);
9219 sub_strict |= maybe_adjust_types_for_deduction (strict, &parm, &arg);
9221 /* We don't copy orig_targs for this because if we have already deduced
9222 some template args from previous args, unify would complain when we
9223 try to deduce a template parameter for the same argument, even though
9224 there isn't really a conflict. */
9225 nargs = TREE_VEC_LENGTH (targs);
9226 tempargs = make_tree_vec (nargs);
9228 if (unify (tparms, tempargs, parm, arg, sub_strict) != 0)
9231 /* First make sure we didn't deduce anything that conflicts with
9232 explicitly specified args. */
9233 for (i = nargs; i--; )
9235 tree elt = TREE_VEC_ELT (tempargs, i);
9236 tree oldelt = TREE_VEC_ELT (orig_targs, i);
9238 if (elt == NULL_TREE)
9240 else if (uses_template_parms (elt))
9242 /* Since we're unifying against ourselves, we will fill in template
9243 args used in the function parm list with our own template parms.
9245 TREE_VEC_ELT (tempargs, i) = NULL_TREE;
9248 else if (oldelt && ! template_args_equal (oldelt, elt))
9252 for (i = nargs; i--; )
9254 tree elt = TREE_VEC_ELT (tempargs, i);
9257 TREE_VEC_ELT (targs, i) = elt;
9263 /* Verify that nondeduce template argument agrees with the type
9264 obtained from argument deduction. Return nonzero if the
9269 struct A { typedef int X; };
9270 template <class T, class U> struct C {};
9271 template <class T> struct C<T, typename T::X> {};
9273 Then with the instantiation `C<A, int>', we can deduce that
9274 `T' is `A' but unify () does not check whether `typename T::X'
9275 is `int'. This function ensure that they agree.
9277 TARGS, PARMS are the same as the arguments of unify.
9278 ARGS contains template arguments from all levels. */
9281 verify_class_unification (tree targs, tree parms, tree args)
9283 parms = tsubst (parms, add_outermost_template_args (args, targs),
9284 tf_none, NULL_TREE);
9285 if (parms == error_mark_node)
9288 return !comp_template_args (parms, INNERMOST_TEMPLATE_ARGS (args));
9291 /* PARM is a template class (perhaps with unbound template
9292 parameters). ARG is a fully instantiated type. If ARG can be
9293 bound to PARM, return ARG, otherwise return NULL_TREE. TPARMS and
9294 TARGS are as for unify. */
9297 try_class_unification (tree tparms, tree targs, tree parm, tree arg)
9301 if (!CLASSTYPE_TEMPLATE_INFO (arg)
9302 || (most_general_template (CLASSTYPE_TI_TEMPLATE (arg))
9303 != most_general_template (CLASSTYPE_TI_TEMPLATE (parm))))
9306 /* We need to make a new template argument vector for the call to
9307 unify. If we used TARGS, we'd clutter it up with the result of
9308 the attempted unification, even if this class didn't work out.
9309 We also don't want to commit ourselves to all the unifications
9310 we've already done, since unification is supposed to be done on
9311 an argument-by-argument basis. In other words, consider the
9312 following pathological case:
9314 template <int I, int J, int K>
9317 template <int I, int J>
9318 struct S<I, J, 2> : public S<I, I, I>, S<J, J, J> {};
9320 template <int I, int J, int K>
9321 void f(S<I, J, K>, S<I, I, I>);
9330 Now, by the time we consider the unification involving `s2', we
9331 already know that we must have `f<0, 0, 0>'. But, even though
9332 `S<0, 1, 2>' is derived from `S<0, 0, 0>', the code is invalid
9333 because there are two ways to unify base classes of S<0, 1, 2>
9334 with S<I, I, I>. If we kept the already deduced knowledge, we
9335 would reject the possibility I=1. */
9336 copy_of_targs = make_tree_vec (TREE_VEC_LENGTH (targs));
9338 /* If unification failed, we're done. */
9339 if (unify (tparms, copy_of_targs, CLASSTYPE_TI_ARGS (parm),
9340 CLASSTYPE_TI_ARGS (arg), UNIFY_ALLOW_NONE))
9346 /* Subroutine of get_template_base. RVAL, if non-NULL, is a base we
9347 have already discovered to be satisfactory. ARG_BINFO is the binfo
9348 for the base class of ARG that we are currently examining. */
9351 get_template_base_recursive (tree tparms,
9360 tree arg = BINFO_TYPE (arg_binfo);
9362 if (!(flags & GTB_IGNORE_TYPE))
9364 tree r = try_class_unification (tparms, targs,
9367 /* If there is more than one satisfactory baseclass, then:
9371 If they yield more than one possible deduced A, the type
9375 if (r && rval && !same_type_p (r, rval))
9376 return error_mark_node;
9381 binfos = BINFO_BASETYPES (arg_binfo);
9382 n_baselinks = binfos ? TREE_VEC_LENGTH (binfos) : 0;
9384 /* Process base types. */
9385 for (i = 0; i < n_baselinks; i++)
9387 tree base_binfo = TREE_VEC_ELT (binfos, i);
9390 /* Skip this base, if we've already seen it. */
9391 if (BINFO_MARKED (base_binfo))
9395 (flags & GTB_VIA_VIRTUAL) || TREE_VIA_VIRTUAL (base_binfo);
9397 /* When searching for a non-virtual, we cannot mark virtually
9400 BINFO_MARKED (base_binfo) = 1;
9402 rval = get_template_base_recursive (tparms, targs,
9406 GTB_VIA_VIRTUAL * this_virtual);
9408 /* If we discovered more than one matching base class, we can
9410 if (rval == error_mark_node)
9411 return error_mark_node;
9417 /* Given a template type PARM and a class type ARG, find the unique
9418 base type in ARG that is an instance of PARM. We do not examine
9419 ARG itself; only its base-classes. If there is no appropriate base
9420 class, return NULL_TREE. If there is more than one, return
9421 error_mark_node. PARM may be the type of a partial specialization,
9422 as well as a plain template type. Used by unify. */
9425 get_template_base (tree tparms, tree targs, tree parm, tree arg)
9430 my_friendly_assert (IS_AGGR_TYPE_CODE (TREE_CODE (arg)), 92);
9432 arg_binfo = TYPE_BINFO (complete_type (arg));
9433 rval = get_template_base_recursive (tparms, targs,
9438 /* Since get_template_base_recursive marks the bases classes, we
9439 must unmark them here. */
9440 dfs_walk (arg_binfo, dfs_unmark, markedp, 0);
9445 /* Returns the level of DECL, which declares a template parameter. */
9448 template_decl_level (tree decl)
9450 switch (TREE_CODE (decl))
9454 return TEMPLATE_TYPE_LEVEL (TREE_TYPE (decl));
9457 return TEMPLATE_PARM_LEVEL (DECL_INITIAL (decl));
9465 /* Decide whether ARG can be unified with PARM, considering only the
9466 cv-qualifiers of each type, given STRICT as documented for unify.
9467 Returns nonzero iff the unification is OK on that basis.*/
9470 check_cv_quals_for_unify (int strict, tree arg, tree parm)
9472 int arg_quals = cp_type_quals (arg);
9473 int parm_quals = cp_type_quals (parm);
9475 if (TREE_CODE (parm) == TEMPLATE_TYPE_PARM)
9477 /* If the cvr quals of parm will not unify with ARG, they'll be
9478 ignored in instantiation, so we have to do the same here. */
9479 if (TREE_CODE (arg) == REFERENCE_TYPE)
9480 parm_quals &= ~(TYPE_QUAL_CONST | TYPE_QUAL_VOLATILE);
9481 if (!POINTER_TYPE_P (arg) &&
9482 TREE_CODE (arg) != TEMPLATE_TYPE_PARM)
9483 parm_quals &= ~TYPE_QUAL_RESTRICT;
9486 if (!(strict & (UNIFY_ALLOW_MORE_CV_QUAL | UNIFY_ALLOW_OUTER_MORE_CV_QUAL))
9487 && (arg_quals & parm_quals) != parm_quals)
9490 if (!(strict & (UNIFY_ALLOW_LESS_CV_QUAL | UNIFY_ALLOW_OUTER_LESS_CV_QUAL))
9491 && (parm_quals & arg_quals) != arg_quals)
9497 /* Takes parameters as for type_unification. Returns 0 if the
9498 type deduction succeeds, 1 otherwise. The parameter STRICT is a
9499 bitwise or of the following flags:
9502 Require an exact match between PARM and ARG.
9503 UNIFY_ALLOW_MORE_CV_QUAL:
9504 Allow the deduced ARG to be more cv-qualified (by qualification
9505 conversion) than ARG.
9506 UNIFY_ALLOW_LESS_CV_QUAL:
9507 Allow the deduced ARG to be less cv-qualified than ARG.
9508 UNIFY_ALLOW_DERIVED:
9509 Allow the deduced ARG to be a template base class of ARG,
9510 or a pointer to a template base class of the type pointed to by
9512 UNIFY_ALLOW_INTEGER:
9513 Allow any integral type to be deduced. See the TEMPLATE_PARM_INDEX
9514 case for more information.
9515 UNIFY_ALLOW_OUTER_LEVEL:
9516 This is the outermost level of a deduction. Used to determine validity
9517 of qualification conversions. A valid qualification conversion must
9518 have const qualified pointers leading up to the inner type which
9519 requires additional CV quals, except at the outer level, where const
9520 is not required [conv.qual]. It would be normal to set this flag in
9521 addition to setting UNIFY_ALLOW_MORE_CV_QUAL.
9522 UNIFY_ALLOW_OUTER_MORE_CV_QUAL:
9523 This is the outermost level of a deduction, and PARM can be more CV
9524 qualified at this point.
9525 UNIFY_ALLOW_OUTER_LESS_CV_QUAL:
9526 This is the outermost level of a deduction, and PARM can be less CV
9527 qualified at this point.
9528 UNIFY_ALLOW_MAX_CORRECTION:
9529 This is an INTEGER_TYPE's maximum value. Used if the range may
9530 have been derived from a size specification, such as an array size.
9531 If the size was given by a nontype template parameter N, the maximum
9532 value will have the form N-1. The flag says that we can (and indeed
9533 must) unify N with (ARG + 1), an exception to the normal rules on
9537 unify (tree tparms, tree targs, tree parm, tree arg, int strict)
9542 int strict_in = strict;
9544 /* I don't think this will do the right thing with respect to types.
9545 But the only case I've seen it in so far has been array bounds, where
9546 signedness is the only information lost, and I think that will be
9548 while (TREE_CODE (parm) == NOP_EXPR)
9549 parm = TREE_OPERAND (parm, 0);
9551 if (arg == error_mark_node)
9553 if (arg == unknown_type_node)
9554 /* We can't deduce anything from this, but we might get all the
9555 template args from other function args. */
9558 /* If PARM uses template parameters, then we can't bail out here,
9559 even if ARG == PARM, since we won't record unifications for the
9560 template parameters. We might need them if we're trying to
9561 figure out which of two things is more specialized. */
9562 if (arg == parm && !uses_template_parms (parm))
9565 /* Immediately reject some pairs that won't unify because of
9566 cv-qualification mismatches. */
9567 if (TREE_CODE (arg) == TREE_CODE (parm)
9569 /* It is the elements of the array which hold the cv quals of an array
9570 type, and the elements might be template type parms. We'll check
9572 && TREE_CODE (arg) != ARRAY_TYPE
9573 /* We check the cv-qualifiers when unifying with template type
9574 parameters below. We want to allow ARG `const T' to unify with
9575 PARM `T' for example, when computing which of two templates
9576 is more specialized, for example. */
9577 && TREE_CODE (arg) != TEMPLATE_TYPE_PARM
9578 && !check_cv_quals_for_unify (strict_in, arg, parm))
9581 if (!(strict & UNIFY_ALLOW_OUTER_LEVEL)
9582 && TYPE_P (parm) && !CP_TYPE_CONST_P (parm))
9583 strict &= ~UNIFY_ALLOW_MORE_CV_QUAL;
9584 strict &= ~UNIFY_ALLOW_OUTER_LEVEL;
9585 strict &= ~UNIFY_ALLOW_DERIVED;
9586 strict &= ~UNIFY_ALLOW_OUTER_MORE_CV_QUAL;
9587 strict &= ~UNIFY_ALLOW_OUTER_LESS_CV_QUAL;
9588 strict &= ~UNIFY_ALLOW_MAX_CORRECTION;
9590 switch (TREE_CODE (parm))
9594 case UNBOUND_CLASS_TEMPLATE:
9595 /* In a type which contains a nested-name-specifier, template
9596 argument values cannot be deduced for template parameters used
9597 within the nested-name-specifier. */
9600 case TEMPLATE_TYPE_PARM:
9601 case TEMPLATE_TEMPLATE_PARM:
9602 case BOUND_TEMPLATE_TEMPLATE_PARM:
9603 tparm = TREE_VALUE (TREE_VEC_ELT (tparms, 0));
9605 if (TEMPLATE_TYPE_LEVEL (parm)
9606 != template_decl_level (tparm))
9607 /* The PARM is not one we're trying to unify. Just check
9608 to see if it matches ARG. */
9609 return (TREE_CODE (arg) == TREE_CODE (parm)
9610 && same_type_p (parm, arg)) ? 0 : 1;
9611 idx = TEMPLATE_TYPE_IDX (parm);
9612 targ = TREE_VEC_ELT (targs, idx);
9613 tparm = TREE_VALUE (TREE_VEC_ELT (tparms, idx));
9615 /* Check for mixed types and values. */
9616 if ((TREE_CODE (parm) == TEMPLATE_TYPE_PARM
9617 && TREE_CODE (tparm) != TYPE_DECL)
9618 || (TREE_CODE (parm) == TEMPLATE_TEMPLATE_PARM
9619 && TREE_CODE (tparm) != TEMPLATE_DECL))
9622 if (TREE_CODE (parm) == BOUND_TEMPLATE_TEMPLATE_PARM)
9624 /* ARG must be constructed from a template class or a template
9625 template parameter. */
9626 if (TREE_CODE (arg) != BOUND_TEMPLATE_TEMPLATE_PARM
9627 && (TREE_CODE (arg) != RECORD_TYPE || !CLASSTYPE_TEMPLATE_INFO (arg)))
9631 tree parmtmpl = TYPE_TI_TEMPLATE (parm);
9632 tree parmvec = TYPE_TI_ARGS (parm);
9633 tree argvec = TYPE_TI_ARGS (arg);
9635 = DECL_INNERMOST_TEMPLATE_PARMS (TYPE_TI_TEMPLATE (arg));
9638 /* The parameter and argument roles have to be switched here
9639 in order to handle default arguments properly. For example,
9640 template<template <class> class TT> void f(TT<int>)
9641 should be able to accept vector<int> which comes from
9642 template <class T, class Allocator = allocator>
9645 if (coerce_template_parms (argtmplvec, parmvec, parmtmpl, 0, 1)
9649 /* Deduce arguments T, i from TT<T> or TT<i>.
9650 We check each element of PARMVEC and ARGVEC individually
9651 rather than the whole TREE_VEC since they can have
9652 different number of elements. */
9654 for (i = 0; i < TREE_VEC_LENGTH (parmvec); ++i)
9656 tree t = TREE_VEC_ELT (parmvec, i);
9658 if (unify (tparms, targs, t,
9659 TREE_VEC_ELT (argvec, i),
9664 arg = TYPE_TI_TEMPLATE (arg);
9666 /* Fall through to deduce template name. */
9669 if (TREE_CODE (parm) == TEMPLATE_TEMPLATE_PARM
9670 || TREE_CODE (parm) == BOUND_TEMPLATE_TEMPLATE_PARM)
9672 /* Deduce template name TT from TT, TT<>, TT<T> and TT<i>. */
9674 /* Simple cases: Value already set, does match or doesn't. */
9675 if (targ != NULL_TREE && template_args_equal (targ, arg))
9682 /* If PARM is `const T' and ARG is only `int', we don't have
9683 a match unless we are allowing additional qualification.
9684 If ARG is `const int' and PARM is just `T' that's OK;
9685 that binds `const int' to `T'. */
9686 if (!check_cv_quals_for_unify (strict_in | UNIFY_ALLOW_LESS_CV_QUAL,
9690 /* Consider the case where ARG is `const volatile int' and
9691 PARM is `const T'. Then, T should be `volatile int'. */
9692 arg = cp_build_qualified_type_real
9693 (arg, cp_type_quals (arg) & ~cp_type_quals (parm), tf_none);
9694 if (arg == error_mark_node)
9697 /* Simple cases: Value already set, does match or doesn't. */
9698 if (targ != NULL_TREE && same_type_p (targ, arg))
9703 /* Make sure that ARG is not a variable-sized array. (Note
9704 that were talking about variable-sized arrays (like
9705 `int[n]'), rather than arrays of unknown size (like
9706 `int[]').) We'll get very confused by such a type since
9707 the bound of the array will not be computable in an
9708 instantiation. Besides, such types are not allowed in
9709 ISO C++, so we can do as we please here. */
9710 if (variably_modified_type_p (arg))
9714 TREE_VEC_ELT (targs, idx) = arg;
9717 case TEMPLATE_PARM_INDEX:
9718 tparm = TREE_VALUE (TREE_VEC_ELT (tparms, 0));
9720 if (TEMPLATE_PARM_LEVEL (parm)
9721 != template_decl_level (tparm))
9722 /* The PARM is not one we're trying to unify. Just check
9723 to see if it matches ARG. */
9724 return !(TREE_CODE (arg) == TREE_CODE (parm)
9725 && cp_tree_equal (parm, arg));
9727 idx = TEMPLATE_PARM_IDX (parm);
9728 targ = TREE_VEC_ELT (targs, idx);
9731 return !cp_tree_equal (targ, arg);
9733 /* [temp.deduct.type] If, in the declaration of a function template
9734 with a non-type template-parameter, the non-type
9735 template-parameter is used in an expression in the function
9736 parameter-list and, if the corresponding template-argument is
9737 deduced, the template-argument type shall match the type of the
9738 template-parameter exactly, except that a template-argument
9739 deduced from an array bound may be of any integral type.
9740 The non-type parameter might use already deduced type parameters. */
9741 tparm = tsubst (TREE_TYPE (parm), targs, 0, NULL_TREE);
9742 if (!TREE_TYPE (arg))
9743 /* Template-parameter dependent expression. Just accept it for now.
9744 It will later be processed in convert_template_argument. */
9746 else if (same_type_p (TREE_TYPE (arg), tparm))
9748 else if ((strict & UNIFY_ALLOW_INTEGER)
9749 && (TREE_CODE (tparm) == INTEGER_TYPE
9750 || TREE_CODE (tparm) == BOOLEAN_TYPE))
9752 else if (uses_template_parms (tparm))
9753 /* We haven't deduced the type of this parameter yet. Try again
9759 TREE_VEC_ELT (targs, idx) = arg;
9764 /* A pointer-to-member constant can be unified only with
9765 another constant. */
9766 if (TREE_CODE (arg) != PTRMEM_CST)
9769 /* Just unify the class member. It would be useless (and possibly
9770 wrong, depending on the strict flags) to unify also
9771 PTRMEM_CST_CLASS, because we want to be sure that both parm and
9772 arg refer to the same variable, even if through different
9773 classes. For instance:
9775 struct A { int x; };
9778 Unification of &A::x and &B::x must succeed. */
9779 return unify (tparms, targs, PTRMEM_CST_MEMBER (parm),
9780 PTRMEM_CST_MEMBER (arg), strict);
9785 if (TREE_CODE (arg) != POINTER_TYPE)
9788 /* [temp.deduct.call]
9790 A can be another pointer or pointer to member type that can
9791 be converted to the deduced A via a qualification
9792 conversion (_conv.qual_).
9794 We pass down STRICT here rather than UNIFY_ALLOW_NONE.
9795 This will allow for additional cv-qualification of the
9796 pointed-to types if appropriate. */
9798 if (TREE_CODE (TREE_TYPE (arg)) == RECORD_TYPE)
9799 /* The derived-to-base conversion only persists through one
9800 level of pointers. */
9801 strict |= (strict_in & UNIFY_ALLOW_DERIVED);
9803 return unify (tparms, targs, TREE_TYPE (parm),
9804 TREE_TYPE (arg), strict);
9807 case REFERENCE_TYPE:
9808 if (TREE_CODE (arg) != REFERENCE_TYPE)
9810 return unify (tparms, targs, TREE_TYPE (parm), TREE_TYPE (arg),
9811 strict & UNIFY_ALLOW_MORE_CV_QUAL);
9814 if (TREE_CODE (arg) != ARRAY_TYPE)
9816 if ((TYPE_DOMAIN (parm) == NULL_TREE)
9817 != (TYPE_DOMAIN (arg) == NULL_TREE))
9819 if (TYPE_DOMAIN (parm) != NULL_TREE
9820 && unify (tparms, targs, TYPE_DOMAIN (parm),
9821 TYPE_DOMAIN (arg), UNIFY_ALLOW_NONE) != 0)
9823 return unify (tparms, targs, TREE_TYPE (parm), TREE_TYPE (arg),
9824 strict & UNIFY_ALLOW_MORE_CV_QUAL);
9832 if (TREE_CODE (arg) != TREE_CODE (parm))
9835 if (TREE_CODE (parm) == INTEGER_TYPE
9836 && TREE_CODE (TYPE_MAX_VALUE (parm)) != INTEGER_CST)
9838 if (TYPE_MIN_VALUE (parm) && TYPE_MIN_VALUE (arg)
9839 && unify (tparms, targs, TYPE_MIN_VALUE (parm),
9840 TYPE_MIN_VALUE (arg), UNIFY_ALLOW_INTEGER))
9842 if (TYPE_MAX_VALUE (parm) && TYPE_MAX_VALUE (arg)
9843 && unify (tparms, targs, TYPE_MAX_VALUE (parm),
9844 TYPE_MAX_VALUE (arg),
9845 UNIFY_ALLOW_INTEGER | UNIFY_ALLOW_MAX_CORRECTION))
9848 /* We have already checked cv-qualification at the top of the
9850 else if (!same_type_ignoring_top_level_qualifiers_p (arg, parm))
9853 /* As far as unification is concerned, this wins. Later checks
9854 will invalidate it if necessary. */
9857 /* Types INTEGER_CST and MINUS_EXPR can come from array bounds. */
9858 /* Type INTEGER_CST can come from ordinary constant template args. */
9860 while (TREE_CODE (arg) == NOP_EXPR)
9861 arg = TREE_OPERAND (arg, 0);
9863 if (TREE_CODE (arg) != INTEGER_CST)
9865 return !tree_int_cst_equal (parm, arg);
9870 if (TREE_CODE (arg) != TREE_VEC)
9872 if (TREE_VEC_LENGTH (parm) != TREE_VEC_LENGTH (arg))
9874 for (i = 0; i < TREE_VEC_LENGTH (parm); ++i)
9875 if (unify (tparms, targs,
9876 TREE_VEC_ELT (parm, i), TREE_VEC_ELT (arg, i),
9884 if (TREE_CODE (arg) != TREE_CODE (parm))
9887 if (TYPE_PTRMEMFUNC_P (parm))
9889 if (!TYPE_PTRMEMFUNC_P (arg))
9892 return unify (tparms, targs,
9893 TYPE_PTRMEMFUNC_FN_TYPE (parm),
9894 TYPE_PTRMEMFUNC_FN_TYPE (arg),
9898 if (CLASSTYPE_TEMPLATE_INFO (parm))
9902 if (strict_in & UNIFY_ALLOW_DERIVED)
9904 /* First, we try to unify the PARM and ARG directly. */
9905 t = try_class_unification (tparms, targs,
9910 /* Fallback to the special case allowed in
9913 If P is a class, and P has the form
9914 template-id, then A can be a derived class of
9915 the deduced A. Likewise, if P is a pointer to
9916 a class of the form template-id, A can be a
9917 pointer to a derived class pointed to by the
9919 t = get_template_base (tparms, targs,
9922 if (! t || t == error_mark_node)
9926 else if (CLASSTYPE_TEMPLATE_INFO (arg)
9927 && (CLASSTYPE_TI_TEMPLATE (parm)
9928 == CLASSTYPE_TI_TEMPLATE (arg)))
9929 /* Perhaps PARM is something like S<U> and ARG is S<int>.
9930 Then, we should unify `int' and `U'. */
9933 /* There's no chance of unification succeeding. */
9936 return unify (tparms, targs, CLASSTYPE_TI_ARGS (parm),
9937 CLASSTYPE_TI_ARGS (t), UNIFY_ALLOW_NONE);
9939 else if (!same_type_ignoring_top_level_qualifiers_p (parm, arg))
9945 if (TREE_CODE (arg) != TREE_CODE (parm))
9948 if (unify (tparms, targs, TREE_TYPE (parm),
9949 TREE_TYPE (arg), UNIFY_ALLOW_NONE))
9951 return type_unification_real (tparms, targs, TYPE_ARG_TYPES (parm),
9952 TYPE_ARG_TYPES (arg), 1,
9953 DEDUCE_EXACT, 0, -1);
9956 if (TREE_CODE (arg) != OFFSET_TYPE)
9958 if (unify (tparms, targs, TYPE_OFFSET_BASETYPE (parm),
9959 TYPE_OFFSET_BASETYPE (arg), UNIFY_ALLOW_NONE))
9961 return unify (tparms, targs, TREE_TYPE (parm), TREE_TYPE (arg),
9965 if (DECL_TEMPLATE_PARM_P (parm))
9966 return unify (tparms, targs, DECL_INITIAL (parm), arg, strict);
9967 if (arg != decl_constant_value (parm))
9973 /* Matched cases are handled by the ARG == PARM test above. */
9977 if (tree_int_cst_equal (TREE_OPERAND (parm, 1), integer_one_node)
9978 && (strict_in & UNIFY_ALLOW_MAX_CORRECTION))
9980 /* We handle this case specially, since it comes up with
9981 arrays. In particular, something like:
9983 template <int N> void f(int (&x)[N]);
9985 Here, we are trying to unify the range type, which
9986 looks like [0 ... (N - 1)]. */
9988 t1 = TREE_OPERAND (parm, 0);
9989 t2 = TREE_OPERAND (parm, 1);
9991 t = fold (build (PLUS_EXPR, integer_type_node, arg, t2));
9993 return unify (tparms, targs, t1, t, strict);
9995 /* else fall through */
9998 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (parm))))
10001 /* We're looking at an expression. This can happen with
10005 void foo(S<I>, S<I + 2>);
10007 This is a "nondeduced context":
10011 The nondeduced contexts are:
10013 --A type that is a template-id in which one or more of
10014 the template-arguments is an expression that references
10015 a template-parameter.
10017 In these cases, we assume deduction succeeded, but don't
10018 actually infer any unifications. */
10020 if (!uses_template_parms (parm)
10021 && !template_args_equal (parm, arg))
10027 sorry ("use of `%s' in template type unification",
10028 tree_code_name [(int) TREE_CODE (parm)]);
10034 /* Called if RESULT is explicitly instantiated, or is a member of an
10035 explicitly instantiated class, or if using -frepo and the
10036 instantiation of RESULT has been assigned to this file. */
10039 mark_decl_instantiated (tree result, int extern_p)
10041 /* We used to set this unconditionally; we moved that to
10042 do_decl_instantiation so it wouldn't get set on members of
10043 explicit class template instantiations. But we still need to set
10044 it here for the 'extern template' case in order to suppress
10045 implicit instantiations. */
10047 SET_DECL_EXPLICIT_INSTANTIATION (result);
10049 /* If this entity has already been written out, it's too late to
10050 make any modifications. */
10051 if (TREE_ASM_WRITTEN (result))
10054 if (TREE_CODE (result) != FUNCTION_DECL)
10055 /* The TREE_PUBLIC flag for function declarations will have been
10056 set correctly by tsubst. */
10057 TREE_PUBLIC (result) = 1;
10059 /* This might have been set by an earlier implicit instantiation. */
10060 DECL_COMDAT (result) = 0;
10064 DECL_INTERFACE_KNOWN (result) = 1;
10065 DECL_NOT_REALLY_EXTERN (result) = 1;
10067 /* Always make artificials weak. */
10068 if (DECL_ARTIFICIAL (result) && flag_weak)
10069 comdat_linkage (result);
10070 /* For WIN32 we also want to put explicit instantiations in
10071 linkonce sections. */
10072 else if (TREE_PUBLIC (result))
10073 maybe_make_one_only (result);
10076 if (TREE_CODE (result) == FUNCTION_DECL)
10080 /* Given two function templates PAT1 and PAT2, return:
10082 DEDUCE should be DEDUCE_EXACT or DEDUCE_ORDER.
10084 1 if PAT1 is more specialized than PAT2 as described in [temp.func.order].
10085 -1 if PAT2 is more specialized than PAT1.
10086 0 if neither is more specialized.
10088 LEN is passed through to fn_type_unification. */
10091 more_specialized (tree pat1, tree pat2, int deduce, int len)
10096 /* If template argument deduction succeeds, we substitute the
10097 resulting arguments into non-deduced contexts. While doing that,
10098 we must be aware that we may encounter dependent types. */
10099 ++processing_template_decl;
10100 targs = get_bindings_real (pat1, DECL_TEMPLATE_RESULT (pat2),
10101 NULL_TREE, 0, deduce, len);
10105 targs = get_bindings_real (pat2, DECL_TEMPLATE_RESULT (pat1),
10106 NULL_TREE, 0, deduce, len);
10109 --processing_template_decl;
10114 /* Given two class template specialization list nodes PAT1 and PAT2, return:
10116 1 if PAT1 is more specialized than PAT2 as described in [temp.class.order].
10117 -1 if PAT2 is more specialized than PAT1.
10118 0 if neither is more specialized.
10120 FULL_ARGS is the full set of template arguments that triggers this
10121 partial ordering. */
10124 more_specialized_class (tree pat1, tree pat2, tree full_args)
10129 targs = get_class_bindings (TREE_VALUE (pat1), TREE_PURPOSE (pat1),
10130 add_outermost_template_args (full_args, TREE_PURPOSE (pat2)));
10134 targs = get_class_bindings (TREE_VALUE (pat2), TREE_PURPOSE (pat2),
10135 add_outermost_template_args (full_args, TREE_PURPOSE (pat1)));
10142 /* Return the template arguments that will produce the function signature
10143 DECL from the function template FN, with the explicit template
10144 arguments EXPLICIT_ARGS. If CHECK_RETTYPE is 1, the return type must
10145 also match. Return NULL_TREE if no satisfactory arguments could be
10146 found. DEDUCE and LEN are passed through to fn_type_unification. */
10149 get_bindings_real (tree fn,
10151 tree explicit_args,
10156 int ntparms = DECL_NTPARMS (fn);
10157 tree targs = make_tree_vec (ntparms);
10159 tree decl_arg_types;
10162 /* Substitute the explicit template arguments into the type of DECL.
10163 The call to fn_type_unification will handle substitution into the
10165 decl_type = TREE_TYPE (decl);
10166 if (explicit_args && uses_template_parms (decl_type))
10169 tree converted_args;
10171 if (DECL_TEMPLATE_INFO (decl))
10172 tmpl = DECL_TI_TEMPLATE (decl);
10174 /* We can get here for some invalid specializations. */
10178 = (coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl),
10179 explicit_args, NULL_TREE,
10180 tf_none, /*require_all_arguments=*/0));
10181 if (converted_args == error_mark_node)
10184 decl_type = tsubst (decl_type, converted_args, tf_none, NULL_TREE);
10185 if (decl_type == error_mark_node)
10189 decl_arg_types = TYPE_ARG_TYPES (decl_type);
10190 /* Never do unification on the 'this' parameter. */
10191 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl))
10192 decl_arg_types = TREE_CHAIN (decl_arg_types);
10194 i = fn_type_unification (fn, explicit_args, targs,
10196 (check_rettype || DECL_CONV_FN_P (fn)
10197 ? TREE_TYPE (decl_type) : NULL_TREE),
10206 /* For most uses, we want to check the return type. */
10209 get_bindings (tree fn, tree decl, tree explicit_args)
10211 return get_bindings_real (fn, decl, explicit_args, 1, DEDUCE_EXACT, -1);
10214 /* But for resolve_overloaded_unification, we only care about the parameter
10218 get_bindings_overload (tree fn, tree decl, tree explicit_args)
10220 return get_bindings_real (fn, decl, explicit_args, 0, DEDUCE_EXACT, -1);
10223 /* Return the innermost template arguments that, when applied to a
10224 template specialization whose innermost template parameters are
10225 TPARMS, and whose specialization arguments are PARMS, yield the
10228 For example, suppose we have:
10230 template <class T, class U> struct S {};
10231 template <class T> struct S<T*, int> {};
10233 Then, suppose we want to get `S<double*, int>'. The TPARMS will be
10234 {T}, the PARMS will be {T*, int} and the ARGS will be {double*,
10235 int}. The resulting vector will be {double}, indicating that `T'
10236 is bound to `double'. */
10239 get_class_bindings (tree tparms, tree parms, tree args)
10241 int i, ntparms = TREE_VEC_LENGTH (tparms);
10242 tree vec = make_tree_vec (ntparms);
10244 if (unify (tparms, vec, parms, INNERMOST_TEMPLATE_ARGS (args),
10248 for (i = 0; i < ntparms; ++i)
10249 if (! TREE_VEC_ELT (vec, i))
10252 if (verify_class_unification (vec, parms, args))
10258 /* In INSTANTIATIONS is a list of <INSTANTIATION, TEMPLATE> pairs.
10259 Pick the most specialized template, and return the corresponding
10260 instantiation, or if there is no corresponding instantiation, the
10261 template itself. If there is no most specialized template,
10262 error_mark_node is returned. If there are no templates at all,
10263 NULL_TREE is returned. */
10266 most_specialized_instantiation (tree instantiations)
10271 if (!instantiations)
10274 champ = instantiations;
10275 for (fn = TREE_CHAIN (instantiations); fn; fn = TREE_CHAIN (fn))
10277 fate = more_specialized (TREE_VALUE (champ), TREE_VALUE (fn),
10285 fn = TREE_CHAIN (fn);
10287 return error_mark_node;
10293 for (fn = instantiations; fn && fn != champ; fn = TREE_CHAIN (fn))
10295 fate = more_specialized (TREE_VALUE (champ), TREE_VALUE (fn),
10298 return error_mark_node;
10301 return TREE_PURPOSE (champ) ? TREE_PURPOSE (champ) : TREE_VALUE (champ);
10304 /* Return the most specialized of the list of templates in FNS that can
10305 produce an instantiation matching DECL, given the explicit template
10306 arguments EXPLICIT_ARGS. */
10309 most_specialized (tree fns, tree decl, tree explicit_args)
10311 tree candidates = NULL_TREE;
10314 for (fn = fns; fn; fn = TREE_CHAIN (fn))
10316 tree candidate = TREE_VALUE (fn);
10318 args = get_bindings (candidate, decl, explicit_args);
10320 candidates = tree_cons (NULL_TREE, candidate, candidates);
10323 return most_specialized_instantiation (candidates);
10326 /* If DECL is a specialization of some template, return the most
10327 general such template. Otherwise, returns NULL_TREE.
10329 For example, given:
10331 template <class T> struct S { template <class U> void f(U); };
10333 if TMPL is `template <class U> void S<int>::f(U)' this will return
10334 the full template. This function will not trace past partial
10335 specializations, however. For example, given in addition:
10337 template <class T> struct S<T*> { template <class U> void f(U); };
10339 if TMPL is `template <class U> void S<int*>::f(U)' this will return
10340 `template <class T> template <class U> S<T*>::f(U)'. */
10343 most_general_template (tree decl)
10345 /* If DECL is a FUNCTION_DECL, find the TEMPLATE_DECL of which it is
10346 an immediate specialization. */
10347 if (TREE_CODE (decl) == FUNCTION_DECL)
10349 if (DECL_TEMPLATE_INFO (decl)) {
10350 decl = DECL_TI_TEMPLATE (decl);
10352 /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE for a
10353 template friend. */
10354 if (TREE_CODE (decl) != TEMPLATE_DECL)
10360 /* Look for more and more general templates. */
10361 while (DECL_TEMPLATE_INFO (decl))
10363 /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE in some cases.
10364 (See cp-tree.h for details.) */
10365 if (TREE_CODE (DECL_TI_TEMPLATE (decl)) != TEMPLATE_DECL)
10368 if (CLASS_TYPE_P (TREE_TYPE (decl))
10369 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl)))
10372 /* Stop if we run into an explicitly specialized class template. */
10373 if (!DECL_NAMESPACE_SCOPE_P (decl)
10374 && DECL_CONTEXT (decl)
10375 && CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (decl)))
10378 decl = DECL_TI_TEMPLATE (decl);
10384 /* Return the most specialized of the class template specializations
10385 of TMPL which can produce an instantiation matching ARGS, or
10386 error_mark_node if the choice is ambiguous. */
10389 most_specialized_class (tree tmpl, tree args)
10391 tree list = NULL_TREE;
10396 tmpl = most_general_template (tmpl);
10397 for (t = DECL_TEMPLATE_SPECIALIZATIONS (tmpl); t; t = TREE_CHAIN (t))
10400 = get_class_bindings (TREE_VALUE (t), TREE_PURPOSE (t), args);
10403 list = tree_cons (TREE_PURPOSE (t), TREE_VALUE (t), list);
10404 TREE_TYPE (list) = TREE_TYPE (t);
10413 t = TREE_CHAIN (t);
10414 for (; t; t = TREE_CHAIN (t))
10416 fate = more_specialized_class (champ, t, args);
10423 t = TREE_CHAIN (t);
10425 return error_mark_node;
10431 for (t = list; t && t != champ; t = TREE_CHAIN (t))
10433 fate = more_specialized_class (champ, t, args);
10435 return error_mark_node;
10441 /* Explicitly instantiate DECL. */
10444 do_decl_instantiation (tree decl, tree storage)
10446 tree result = NULL_TREE;
10450 /* An error occurred, for which grokdeclarator has already issued
10451 an appropriate message. */
10453 else if (! DECL_LANG_SPECIFIC (decl))
10455 error ("explicit instantiation of non-template `%#D'", decl);
10458 else if (TREE_CODE (decl) == VAR_DECL)
10460 /* There is an asymmetry here in the way VAR_DECLs and
10461 FUNCTION_DECLs are handled by grokdeclarator. In the case of
10462 the latter, the DECL we get back will be marked as a
10463 template instantiation, and the appropriate
10464 DECL_TEMPLATE_INFO will be set up. This does not happen for
10465 VAR_DECLs so we do the lookup here. Probably, grokdeclarator
10466 should handle VAR_DECLs as it currently handles
10468 result = lookup_field (DECL_CONTEXT (decl), DECL_NAME (decl), 0, false);
10469 if (!result || TREE_CODE (result) != VAR_DECL)
10471 error ("no matching template for `%D' found", decl);
10475 else if (TREE_CODE (decl) != FUNCTION_DECL)
10477 error ("explicit instantiation of `%#D'", decl);
10483 /* Check for various error cases. Note that if the explicit
10484 instantiation is valid the RESULT will currently be marked as an
10485 *implicit* instantiation; DECL_EXPLICIT_INSTANTIATION is not set
10486 until we get here. */
10488 if (DECL_TEMPLATE_SPECIALIZATION (result))
10490 /* DR 259 [temp.spec].
10492 Both an explicit instantiation and a declaration of an explicit
10493 specialization shall not appear in a program unless the explicit
10494 instantiation follows a declaration of the explicit specialization.
10496 For a given set of template parameters, if an explicit
10497 instantiation of a template appears after a declaration of an
10498 explicit specialization for that template, the explicit
10499 instantiation has no effect. */
10502 else if (DECL_EXPLICIT_INSTANTIATION (result))
10506 No program shall explicitly instantiate any template more
10509 We check DECL_INTERFACE_KNOWN so as not to complain when the first
10510 instantiation was `extern' and the second is not, and EXTERN_P for
10511 the opposite case. If -frepo, chances are we already got marked
10512 as an explicit instantiation because of the repo file. */
10513 if (DECL_INTERFACE_KNOWN (result) && !extern_p && !flag_use_repository)
10514 pedwarn ("duplicate explicit instantiation of `%#D'", result);
10516 /* If we've already instantiated the template, just return now. */
10517 if (DECL_INTERFACE_KNOWN (result))
10520 else if (!DECL_IMPLICIT_INSTANTIATION (result))
10522 error ("no matching template for `%D' found", result);
10525 else if (!DECL_TEMPLATE_INFO (result))
10527 pedwarn ("explicit instantiation of non-template `%#D'", result);
10531 if (flag_external_templates)
10534 if (storage == NULL_TREE)
10536 else if (storage == ridpointers[(int) RID_EXTERN])
10538 if (pedantic && !in_system_header)
10539 pedwarn ("ISO C++ forbids the use of `extern' on explicit instantiations");
10543 error ("storage class `%D' applied to template instantiation",
10546 SET_DECL_EXPLICIT_INSTANTIATION (result);
10547 mark_decl_instantiated (result, extern_p);
10548 repo_template_instantiated (result, extern_p);
10550 instantiate_decl (result, /*defer_ok=*/1);
10554 mark_class_instantiated (tree t, int extern_p)
10556 SET_CLASSTYPE_EXPLICIT_INSTANTIATION (t);
10557 SET_CLASSTYPE_INTERFACE_KNOWN (t);
10558 CLASSTYPE_INTERFACE_ONLY (t) = extern_p;
10559 TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (t)) = extern_p;
10562 CLASSTYPE_DEBUG_REQUESTED (t) = 1;
10563 rest_of_type_compilation (t, 1);
10567 /* Called from do_type_instantiation through binding_table_foreach to
10568 do recursive instantiation for the type bound in ENTRY. */
10570 bt_instantiate_type_proc (binding_entry entry, void *data)
10572 tree storage = *(tree *) data;
10574 if (IS_AGGR_TYPE (entry->type)
10575 && !uses_template_parms (CLASSTYPE_TI_ARGS (entry->type)))
10576 do_type_instantiation (TYPE_MAIN_DECL (entry->type), storage, 0);
10579 /* Perform an explicit instantiation of template class T. STORAGE, if
10580 non-null, is the RID for extern, inline or static. COMPLAIN is
10581 nonzero if this is called from the parser, zero if called recursively,
10582 since the standard is unclear (as detailed below). */
10585 do_type_instantiation (tree t, tree storage, tsubst_flags_t complain)
10591 if (TREE_CODE (t) == TYPE_DECL)
10594 if (! CLASS_TYPE_P (t) || ! CLASSTYPE_TEMPLATE_INFO (t))
10596 error ("explicit instantiation of non-template type `%T'", t);
10602 /* With -fexternal-templates, explicit instantiations are treated the same
10603 as implicit ones. */
10604 if (flag_external_templates)
10607 if (!COMPLETE_TYPE_P (t))
10609 if (complain & tf_error)
10610 error ("explicit instantiation of `%#T' before definition of template",
10615 if (storage != NULL_TREE)
10617 if (pedantic && !in_system_header)
10618 pedwarn("ISO C++ forbids the use of `%s' on explicit instantiations",
10619 IDENTIFIER_POINTER (storage));
10621 if (storage == ridpointers[(int) RID_INLINE])
10623 else if (storage == ridpointers[(int) RID_EXTERN])
10625 else if (storage == ridpointers[(int) RID_STATIC])
10629 error ("storage class `%D' applied to template instantiation",
10635 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (t))
10637 /* DR 259 [temp.spec].
10639 Both an explicit instantiation and a declaration of an explicit
10640 specialization shall not appear in a program unless the explicit
10641 instantiation follows a declaration of the explicit specialization.
10643 For a given set of template parameters, if an explicit
10644 instantiation of a template appears after a declaration of an
10645 explicit specialization for that template, the explicit
10646 instantiation has no effect. */
10649 else if (CLASSTYPE_EXPLICIT_INSTANTIATION (t))
10653 No program shall explicitly instantiate any template more
10656 If CLASSTYPE_INTERFACE_ONLY, then the first explicit instantiation
10657 was `extern'. If EXTERN_P then the second is. If -frepo, chances
10658 are we already got marked as an explicit instantiation because of the
10659 repo file. All these cases are OK. */
10660 if (!CLASSTYPE_INTERFACE_ONLY (t) && !extern_p && !flag_use_repository
10661 && (complain & tf_error))
10662 pedwarn ("duplicate explicit instantiation of `%#T'", t);
10664 /* If we've already instantiated the template, just return now. */
10665 if (!CLASSTYPE_INTERFACE_ONLY (t))
10669 mark_class_instantiated (t, extern_p);
10670 repo_template_instantiated (t, extern_p);
10678 /* In contrast to implicit instantiation, where only the
10679 declarations, and not the definitions, of members are
10680 instantiated, we have here:
10684 The explicit instantiation of a class template specialization
10685 implies the instantiation of all of its members not
10686 previously explicitly specialized in the translation unit
10687 containing the explicit instantiation.
10689 Of course, we can't instantiate member template classes, since
10690 we don't have any arguments for them. Note that the standard
10691 is unclear on whether the instantiation of the members are
10692 *explicit* instantiations or not. We choose to be generous,
10693 and not set DECL_EXPLICIT_INSTANTIATION. Therefore, we allow
10694 the explicit instantiation of a class where some of the members
10695 have no definition in the current translation unit. */
10698 for (tmp = TYPE_METHODS (t); tmp; tmp = TREE_CHAIN (tmp))
10699 if (TREE_CODE (tmp) == FUNCTION_DECL
10700 && DECL_TEMPLATE_INSTANTIATION (tmp))
10702 mark_decl_instantiated (tmp, extern_p);
10703 repo_template_instantiated (tmp, extern_p);
10705 instantiate_decl (tmp, /*defer_ok=*/1);
10708 for (tmp = TYPE_FIELDS (t); tmp; tmp = TREE_CHAIN (tmp))
10709 if (TREE_CODE (tmp) == VAR_DECL && DECL_TEMPLATE_INSTANTIATION (tmp))
10711 mark_decl_instantiated (tmp, extern_p);
10712 repo_template_instantiated (tmp, extern_p);
10714 instantiate_decl (tmp, /*defer_ok=*/1);
10717 if (CLASSTYPE_NESTED_UTDS (t))
10718 binding_table_foreach (CLASSTYPE_NESTED_UTDS (t),
10719 bt_instantiate_type_proc, &storage);
10723 /* Given a function DECL, which is a specialization of TMPL, modify
10724 DECL to be a re-instantiation of TMPL with the same template
10725 arguments. TMPL should be the template into which tsubst'ing
10726 should occur for DECL, not the most general template.
10728 One reason for doing this is a scenario like this:
10731 void f(const T&, int i);
10733 void g() { f(3, 7); }
10736 void f(const T& t, const int i) { }
10738 Note that when the template is first instantiated, with
10739 instantiate_template, the resulting DECL will have no name for the
10740 first parameter, and the wrong type for the second. So, when we go
10741 to instantiate the DECL, we regenerate it. */
10744 regenerate_decl_from_template (tree decl, tree tmpl)
10746 /* The most general version of TMPL. */
10748 /* The arguments used to instantiate DECL, from the most general
10755 args = DECL_TI_ARGS (decl);
10756 code_pattern = DECL_TEMPLATE_RESULT (tmpl);
10758 /* Unregister the specialization so that when we tsubst we will not
10759 just return DECL. We don't have to unregister DECL from TMPL
10760 because if would only be registered there if it were a partial
10761 instantiation of a specialization, which it isn't: it's a full
10763 gen_tmpl = most_general_template (tmpl);
10764 unregistered = reregister_specialization (decl, gen_tmpl,
10765 /*new_spec=*/NULL_TREE);
10767 /* If the DECL was not unregistered then something peculiar is
10768 happening: we created a specialization but did not call
10769 register_specialization for it. */
10770 my_friendly_assert (unregistered, 0);
10772 /* Make sure that we can see identifiers, and compute access
10774 push_access_scope (decl);
10776 /* Do the substitution to get the new declaration. */
10777 new_decl = tsubst (code_pattern, args, tf_error, NULL_TREE);
10779 if (TREE_CODE (decl) == VAR_DECL)
10781 /* Set up DECL_INITIAL, since tsubst doesn't. */
10782 if (!DECL_INITIALIZED_IN_CLASS_P (decl))
10783 DECL_INITIAL (new_decl) =
10784 tsubst_expr (DECL_INITIAL (code_pattern), args,
10785 tf_error, DECL_TI_TEMPLATE (decl));
10787 else if (TREE_CODE (decl) == FUNCTION_DECL)
10789 /* Convince duplicate_decls to use the DECL_ARGUMENTS from the
10791 DECL_INITIAL (new_decl) = error_mark_node;
10792 /* And don't complain about a duplicate definition. */
10793 DECL_INITIAL (decl) = NULL_TREE;
10796 pop_access_scope (decl);
10798 /* The immediate parent of the new template is still whatever it was
10799 before, even though tsubst sets DECL_TI_TEMPLATE up as the most
10800 general template. We also reset the DECL_ASSEMBLER_NAME since
10801 tsubst always calculates the name as if the function in question
10802 were really a template instance, and sometimes, with friend
10803 functions, this is not so. See tsubst_friend_function for
10805 DECL_TI_TEMPLATE (new_decl) = DECL_TI_TEMPLATE (decl);
10806 COPY_DECL_ASSEMBLER_NAME (decl, new_decl);
10807 COPY_DECL_RTL (decl, new_decl);
10808 DECL_USE_TEMPLATE (new_decl) = DECL_USE_TEMPLATE (decl);
10810 /* Call duplicate decls to merge the old and new declarations. */
10811 duplicate_decls (new_decl, decl);
10813 /* Now, re-register the specialization. */
10814 register_specialization (decl, gen_tmpl, args);
10817 /* Return the TEMPLATE_DECL into which DECL_TI_ARGS(DECL) should be
10818 substituted to get DECL. */
10821 template_for_substitution (tree decl)
10823 tree tmpl = DECL_TI_TEMPLATE (decl);
10825 /* Set TMPL to the template whose DECL_TEMPLATE_RESULT is the pattern
10826 for the instantiation. This is not always the most general
10827 template. Consider, for example:
10830 struct S { template <class U> void f();
10831 template <> void f<int>(); };
10833 and an instantiation of S<double>::f<int>. We want TD to be the
10834 specialization S<T>::f<int>, not the more general S<T>::f<U>. */
10835 while (/* An instantiation cannot have a definition, so we need a
10836 more general template. */
10837 DECL_TEMPLATE_INSTANTIATION (tmpl)
10838 /* We must also deal with friend templates. Given:
10840 template <class T> struct S {
10841 template <class U> friend void f() {};
10844 S<int>::f<U> say, is not an instantiation of S<T>::f<U>,
10845 so far as the language is concerned, but that's still
10846 where we get the pattern for the instantiation from. On
10847 other hand, if the definition comes outside the class, say:
10849 template <class T> struct S {
10850 template <class U> friend void f();
10852 template <class U> friend void f() {}
10854 we don't need to look any further. That's what the check for
10855 DECL_INITIAL is for. */
10856 || (TREE_CODE (decl) == FUNCTION_DECL
10857 && DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (tmpl)
10858 && !DECL_INITIAL (DECL_TEMPLATE_RESULT (tmpl))))
10860 /* The present template, TD, should not be a definition. If it
10861 were a definition, we should be using it! Note that we
10862 cannot restructure the loop to just keep going until we find
10863 a template with a definition, since that might go too far if
10864 a specialization was declared, but not defined. */
10865 my_friendly_assert (!(TREE_CODE (decl) == VAR_DECL
10866 && !DECL_IN_AGGR_P (DECL_TEMPLATE_RESULT (tmpl))),
10869 /* Fetch the more general template. */
10870 tmpl = DECL_TI_TEMPLATE (tmpl);
10876 /* Produce the definition of D, a _DECL generated from a template. If
10877 DEFER_OK is nonzero, then we don't have to actually do the
10878 instantiation now; we just have to do it sometime. */
10881 instantiate_decl (tree d, int defer_ok)
10883 tree tmpl = DECL_TI_TEMPLATE (d);
10890 int pattern_defined;
10892 location_t saved_loc = input_location;
10894 /* This function should only be used to instantiate templates for
10895 functions and static member variables. */
10896 my_friendly_assert (TREE_CODE (d) == FUNCTION_DECL
10897 || TREE_CODE (d) == VAR_DECL, 0);
10899 /* Variables are never deferred; if instantiation is required, they
10900 are instantiated right away. That allows for better code in the
10901 case that an expression refers to the value of the variable --
10902 if the variable has a constant value the referring expression can
10903 take advantage of that fact. */
10904 if (TREE_CODE (d) == VAR_DECL)
10907 /* Don't instantiate cloned functions. Instead, instantiate the
10908 functions they cloned. */
10909 if (TREE_CODE (d) == FUNCTION_DECL && DECL_CLONED_FUNCTION_P (d))
10910 d = DECL_CLONED_FUNCTION (d);
10912 if (DECL_TEMPLATE_INSTANTIATED (d))
10913 /* D has already been instantiated. It might seem reasonable to
10914 check whether or not D is an explicit instantiation, and, if so,
10915 stop here. But when an explicit instantiation is deferred
10916 until the end of the compilation, DECL_EXPLICIT_INSTANTIATION
10917 is set, even though we still need to do the instantiation. */
10920 /* If we already have a specialization of this declaration, then
10921 there's no reason to instantiate it. Note that
10922 retrieve_specialization gives us both instantiations and
10923 specializations, so we must explicitly check
10924 DECL_TEMPLATE_SPECIALIZATION. */
10925 gen_tmpl = most_general_template (tmpl);
10926 gen_args = DECL_TI_ARGS (d);
10927 spec = retrieve_specialization (gen_tmpl, gen_args);
10928 if (spec != NULL_TREE && DECL_TEMPLATE_SPECIALIZATION (spec))
10931 /* This needs to happen before any tsubsting. */
10932 if (! push_tinst_level (d))
10935 timevar_push (TV_PARSE);
10937 /* We may be in the middle of deferred access check. Disable it now. */
10938 push_deferring_access_checks (dk_no_deferred);
10940 /* Our caller does not expect collection to happen, which it might if
10941 we decide to compile the function to rtl now. Arrange for a new
10942 gc context to be created if so. */
10945 /* Set TD to the template whose DECL_TEMPLATE_RESULT is the pattern
10946 for the instantiation. */
10947 td = template_for_substitution (d);
10948 code_pattern = DECL_TEMPLATE_RESULT (td);
10950 if ((DECL_NAMESPACE_SCOPE_P (d) && !DECL_INITIALIZED_IN_CLASS_P (d))
10951 || DECL_TEMPLATE_SPECIALIZATION (td))
10952 /* In the case of a friend template whose definition is provided
10953 outside the class, we may have too many arguments. Drop the
10954 ones we don't need. The same is true for specializations. */
10955 args = get_innermost_template_args
10956 (gen_args, TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (td)));
10960 if (TREE_CODE (d) == FUNCTION_DECL)
10961 pattern_defined = (DECL_SAVED_TREE (code_pattern) != NULL_TREE);
10963 pattern_defined = ! DECL_IN_AGGR_P (code_pattern);
10965 input_location = DECL_SOURCE_LOCATION (d);
10967 if (pattern_defined)
10969 /* Let the repository code that this template definition is
10972 The repository doesn't need to know about cloned functions
10973 because they never actually show up in the object file. It
10974 does need to know about the clones; those are the symbols
10975 that the linker will be emitting error messages about. */
10976 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (d)
10977 || DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (d))
10981 for (t = TREE_CHAIN (d);
10982 t && DECL_CLONED_FUNCTION_P (t);
10983 t = TREE_CHAIN (t))
10984 repo_template_used (t);
10987 repo_template_used (d);
10989 if (flag_external_templates && ! DECL_INTERFACE_KNOWN (d))
10991 if (flag_alt_external_templates)
10993 if (interface_unknown)
10994 warn_if_unknown_interface (d);
10996 else if (DECL_INTERFACE_KNOWN (code_pattern))
10998 DECL_INTERFACE_KNOWN (d) = 1;
10999 DECL_NOT_REALLY_EXTERN (d) = ! DECL_EXTERNAL (code_pattern);
11002 warn_if_unknown_interface (code_pattern);
11006 import_export_decl (d);
11011 /* Recheck the substitutions to obtain any warning messages
11012 about ignoring cv qualifiers. */
11013 tree gen = DECL_TEMPLATE_RESULT (gen_tmpl);
11014 tree type = TREE_TYPE (gen);
11016 /* Make sure that we can see identifiers, and compute access
11017 correctly. D is already the target FUNCTION_DECL with the
11019 push_access_scope (d);
11021 if (TREE_CODE (gen) == FUNCTION_DECL)
11023 tsubst (DECL_ARGUMENTS (gen), gen_args, tf_error | tf_warning, d);
11024 tsubst (TYPE_RAISES_EXCEPTIONS (type), gen_args,
11025 tf_error | tf_warning, d);
11026 /* Don't simply tsubst the function type, as that will give
11027 duplicate warnings about poor parameter qualifications.
11028 The function arguments are the same as the decl_arguments
11029 without the top level cv qualifiers. */
11030 type = TREE_TYPE (type);
11032 tsubst (type, gen_args, tf_error | tf_warning, d);
11034 pop_access_scope (d);
11037 if (TREE_CODE (d) == VAR_DECL && DECL_INITIALIZED_IN_CLASS_P (d)
11038 && DECL_INITIAL (d) == NULL_TREE)
11039 /* We should have set up DECL_INITIAL in instantiate_class_template. */
11041 /* Reject all external templates except inline functions. */
11042 else if (DECL_INTERFACE_KNOWN (d)
11043 && ! DECL_NOT_REALLY_EXTERN (d)
11044 && ! (TREE_CODE (d) == FUNCTION_DECL
11045 && DECL_INLINE (d)))
11047 /* Defer all other templates, unless we have been explicitly
11048 forbidden from doing so. We restore the source position here
11049 because it's used by add_pending_template. */
11050 else if (! pattern_defined || defer_ok)
11052 input_location = saved_loc;
11054 if (at_eof && !pattern_defined
11055 && DECL_EXPLICIT_INSTANTIATION (d))
11058 The definition of a non-exported function template, a
11059 non-exported member function template, or a non-exported
11060 member function or static data member of a class template
11061 shall be present in every translation unit in which it is
11062 explicitly instantiated. */
11064 ("explicit instantiation of `%D' but no definition available", d);
11066 add_pending_template (d);
11070 need_push = !global_bindings_p ();
11072 push_to_top_level ();
11074 /* Regenerate the declaration in case the template has been modified
11075 by a subsequent redeclaration. */
11076 regenerate_decl_from_template (d, td);
11078 /* We already set the file and line above. Reset them now in case
11079 they changed as a result of calling
11080 regenerate_decl_from_template. */
11081 input_location = DECL_SOURCE_LOCATION (d);
11083 if (TREE_CODE (d) == VAR_DECL)
11085 /* Clear out DECL_RTL; whatever was there before may not be right
11086 since we've reset the type of the declaration. */
11087 SET_DECL_RTL (d, NULL_RTX);
11089 DECL_IN_AGGR_P (d) = 0;
11090 import_export_decl (d);
11091 DECL_EXTERNAL (d) = ! DECL_NOT_REALLY_EXTERN (d);
11093 if (DECL_EXTERNAL (d))
11095 /* The fact that this code is executing indicates that:
11097 (1) D is a template static data member, for which a
11098 definition is available.
11100 (2) An implicit or explicit instantiation has occurred.
11102 (3) We are not going to emit a definition of the static
11103 data member at this time.
11105 This situation is peculiar, but it occurs on platforms
11106 without weak symbols when performing an implicit
11107 instantiation. There, we cannot implicitly instantiate a
11108 defined static data member in more than one translation
11109 unit, so import_export_decl marks the declaration as
11110 external; we must rely on explicit instantiation. */
11114 /* Mark D as instantiated so that recursive calls to
11115 instantiate_decl do not try to instantiate it again. */
11116 DECL_TEMPLATE_INSTANTIATED (d) = 1;
11118 (!DECL_INITIALIZED_IN_CLASS_P (d)
11119 ? DECL_INITIAL (d) : NULL_TREE),
11123 else if (TREE_CODE (d) == FUNCTION_DECL)
11125 htab_t saved_local_specializations;
11130 /* Mark D as instantiated so that recursive calls to
11131 instantiate_decl do not try to instantiate it again. */
11132 DECL_TEMPLATE_INSTANTIATED (d) = 1;
11134 /* Save away the current list, in case we are instantiating one
11135 template from within the body of another. */
11136 saved_local_specializations = local_specializations;
11138 /* Set up the list of local specializations. */
11139 local_specializations = htab_create (37,
11140 hash_local_specialization,
11141 eq_local_specializations,
11144 /* Set up context. */
11145 import_export_decl (d);
11146 start_function (NULL_TREE, d, NULL_TREE, SF_PRE_PARSED);
11148 /* Create substitution entries for the parameters. */
11149 subst_decl = DECL_TEMPLATE_RESULT (template_for_substitution (d));
11150 tmpl_parm = DECL_ARGUMENTS (subst_decl);
11151 spec_parm = DECL_ARGUMENTS (d);
11152 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (d))
11154 register_local_specialization (spec_parm, tmpl_parm);
11155 spec_parm = skip_artificial_parms_for (d, spec_parm);
11156 tmpl_parm = skip_artificial_parms_for (subst_decl, tmpl_parm);
11160 register_local_specialization (spec_parm, tmpl_parm);
11161 tmpl_parm = TREE_CHAIN (tmpl_parm);
11162 spec_parm = TREE_CHAIN (spec_parm);
11164 my_friendly_assert (!spec_parm, 20020813);
11166 /* Substitute into the body of the function. */
11167 tsubst_expr (DECL_SAVED_TREE (code_pattern), args,
11168 tf_error | tf_warning, tmpl);
11170 /* We don't need the local specializations any more. */
11171 htab_delete (local_specializations);
11172 local_specializations = saved_local_specializations;
11174 /* Finish the function. */
11175 d = finish_function (0);
11176 expand_or_defer_fn (d);
11179 /* We're not deferring instantiation any more. */
11180 TI_PENDING_TEMPLATE_FLAG (DECL_TEMPLATE_INFO (d)) = 0;
11183 pop_from_top_level ();
11186 input_location = saved_loc;
11187 pop_deferring_access_checks ();
11188 pop_tinst_level ();
11191 timevar_pop (TV_PARSE);
11196 /* Run through the list of templates that we wish we could
11197 instantiate, and instantiate any we can. */
11200 instantiate_pending_templates (void)
11203 tree last = NULL_TREE;
11204 int instantiated_something = 0;
11206 location_t saved_loc = input_location;
11212 t = &pending_templates;
11215 tree instantiation = TREE_VALUE (*t);
11217 reopen_tinst_level (TREE_PURPOSE (*t));
11219 if (TYPE_P (instantiation))
11223 if (!COMPLETE_TYPE_P (instantiation))
11225 instantiate_class_template (instantiation);
11226 if (CLASSTYPE_TEMPLATE_INSTANTIATION (instantiation))
11227 for (fn = TYPE_METHODS (instantiation);
11229 fn = TREE_CHAIN (fn))
11230 if (! DECL_ARTIFICIAL (fn))
11231 instantiate_decl (fn, /*defer_ok=*/0);
11232 if (COMPLETE_TYPE_P (instantiation))
11234 instantiated_something = 1;
11239 if (COMPLETE_TYPE_P (instantiation))
11240 /* If INSTANTIATION has been instantiated, then we don't
11241 need to consider it again in the future. */
11242 *t = TREE_CHAIN (*t);
11246 t = &TREE_CHAIN (*t);
11251 if (!DECL_TEMPLATE_SPECIALIZATION (instantiation)
11252 && !DECL_TEMPLATE_INSTANTIATED (instantiation))
11254 instantiation = instantiate_decl (instantiation,
11256 if (DECL_TEMPLATE_INSTANTIATED (instantiation))
11258 instantiated_something = 1;
11263 if (DECL_TEMPLATE_SPECIALIZATION (instantiation)
11264 || DECL_TEMPLATE_INSTANTIATED (instantiation))
11265 /* If INSTANTIATION has been instantiated, then we don't
11266 need to consider it again in the future. */
11267 *t = TREE_CHAIN (*t);
11271 t = &TREE_CHAIN (*t);
11275 current_tinst_level = NULL_TREE;
11277 last_pending_template = last;
11279 while (reconsider);
11281 input_location = saved_loc;
11282 return instantiated_something;
11285 /* Substitute ARGVEC into T, which is a list of initializers for
11286 either base class or a non-static data member. The TREE_PURPOSEs
11287 are DECLs, and the TREE_VALUEs are the initializer values. Used by
11288 instantiate_decl. */
11291 tsubst_initializer_list (tree t, tree argvec)
11293 tree inits = NULL_TREE;
11295 for (; t; t = TREE_CHAIN (t))
11301 decl = tsubst_copy (TREE_PURPOSE (t), argvec, tf_error | tf_warning,
11303 decl = expand_member_init (decl);
11304 if (decl && !DECL_P (decl))
11305 in_base_initializer = 1;
11307 init = tsubst_expr (TREE_VALUE (t), argvec, tf_error | tf_warning,
11311 else if (TREE_CODE (init) == TREE_LIST)
11312 for (val = init; val; val = TREE_CHAIN (val))
11313 TREE_VALUE (val) = convert_from_reference (TREE_VALUE (val));
11314 else if (init != void_type_node)
11315 init = convert_from_reference (init);
11317 in_base_initializer = 0;
11321 init = build_tree_list (decl, init);
11322 TREE_CHAIN (init) = inits;
11329 /* Set CURRENT_ACCESS_SPECIFIER based on the protection of DECL. */
11332 set_current_access_from_decl (tree decl)
11334 if (TREE_PRIVATE (decl))
11335 current_access_specifier = access_private_node;
11336 else if (TREE_PROTECTED (decl))
11337 current_access_specifier = access_protected_node;
11339 current_access_specifier = access_public_node;
11342 /* Instantiate an enumerated type. TAG is the template type, NEWTAG
11343 is the instantiation (which should have been created with
11344 start_enum) and ARGS are the template arguments to use. */
11347 tsubst_enum (tree tag, tree newtag, tree args)
11351 for (e = TYPE_VALUES (tag); e; e = TREE_CHAIN (e))
11356 decl = TREE_VALUE (e);
11357 /* Note that in a template enum, the TREE_VALUE is the
11358 CONST_DECL, not the corresponding INTEGER_CST. */
11359 value = tsubst_expr (DECL_INITIAL (decl),
11360 args, tf_error | tf_warning,
11363 /* Give this enumeration constant the correct access. */
11364 set_current_access_from_decl (decl);
11366 /* Actually build the enumerator itself. */
11367 build_enumerator (DECL_NAME (decl), value, newtag);
11370 finish_enum (newtag);
11371 DECL_SOURCE_LOCATION (TYPE_NAME (newtag))
11372 = DECL_SOURCE_LOCATION (TYPE_NAME (tag));
11375 /* DECL is a FUNCTION_DECL that is a template specialization. Return
11376 its type -- but without substituting the innermost set of template
11377 arguments. So, innermost set of template parameters will appear in
11381 get_mostly_instantiated_function_type (tree decl)
11389 tmpl = most_general_template (DECL_TI_TEMPLATE (decl));
11390 targs = DECL_TI_ARGS (decl);
11391 tparms = DECL_TEMPLATE_PARMS (tmpl);
11392 parm_depth = TMPL_PARMS_DEPTH (tparms);
11394 /* There should be as many levels of arguments as there are levels
11396 my_friendly_assert (parm_depth == TMPL_ARGS_DEPTH (targs), 0);
11398 fn_type = TREE_TYPE (tmpl);
11400 if (parm_depth == 1)
11401 /* No substitution is necessary. */
11408 /* Replace the innermost level of the TARGS with NULL_TREEs to
11409 let tsubst know not to substitute for those parameters. */
11410 partial_args = make_tree_vec (TREE_VEC_LENGTH (targs));
11411 for (i = 1; i < TMPL_ARGS_DEPTH (targs); ++i)
11412 SET_TMPL_ARGS_LEVEL (partial_args, i,
11413 TMPL_ARGS_LEVEL (targs, i));
11414 SET_TMPL_ARGS_LEVEL (partial_args,
11415 TMPL_ARGS_DEPTH (targs),
11416 make_tree_vec (DECL_NTPARMS (tmpl)));
11418 /* Make sure that we can see identifiers, and compute access
11419 correctly. We can just use the context of DECL for the
11420 partial substitution here. It depends only on outer template
11421 parameters, regardless of whether the innermost level is
11422 specialized or not. */
11423 push_access_scope (decl);
11425 ++processing_template_decl;
11426 /* Now, do the (partial) substitution to figure out the
11427 appropriate function type. */
11428 fn_type = tsubst (fn_type, partial_args, tf_error, NULL_TREE);
11429 --processing_template_decl;
11431 /* Substitute into the template parameters to obtain the real
11432 innermost set of parameters. This step is important if the
11433 innermost set of template parameters contains value
11434 parameters whose types depend on outer template parameters. */
11435 TREE_VEC_LENGTH (partial_args)--;
11436 tparms = tsubst_template_parms (tparms, partial_args, tf_error);
11438 pop_access_scope (decl);
11444 /* Return truthvalue if we're processing a template different from
11445 the last one involved in diagnostics. */
11447 problematic_instantiation_changed (void)
11449 return last_template_error_tick != tinst_level_tick;
11452 /* Remember current template involved in diagnostics. */
11454 record_last_problematic_instantiation (void)
11456 last_template_error_tick = tinst_level_tick;
11460 current_instantiation (void)
11462 return current_tinst_level;
11465 /* [temp.param] Check that template non-type parm TYPE is of an allowable
11466 type. Return zero for ok, nonzero for disallowed. Issue error and
11467 warning messages under control of COMPLAIN. */
11470 invalid_nontype_parm_type_p (tree type, tsubst_flags_t complain)
11472 if (INTEGRAL_TYPE_P (type))
11474 else if (POINTER_TYPE_P (type))
11476 else if (TYPE_PTR_TO_MEMBER_P (type))
11478 else if (TREE_CODE (type) == TEMPLATE_TYPE_PARM)
11480 else if (TREE_CODE (type) == TYPENAME_TYPE)
11483 if (complain & tf_error)
11484 error ("`%#T' is not a valid type for a template constant parameter",
11489 /* Returns TRUE if TYPE is dependent, in the sense of [temp.dep.type].
11490 Assumes that TYPE really is a type, and not the ERROR_MARK_NODE.*/
11493 dependent_type_p_r (tree type)
11499 A type is dependent if it is:
11501 -- a template parameter. */
11502 if (TREE_CODE (type) == TEMPLATE_TYPE_PARM)
11504 /* -- a qualified-id with a nested-name-specifier which contains a
11505 class-name that names a dependent type or whose unqualified-id
11506 names a dependent type. */
11507 if (TREE_CODE (type) == TYPENAME_TYPE)
11509 /* -- a cv-qualified type where the cv-unqualified type is
11511 type = TYPE_MAIN_VARIANT (type);
11512 /* -- a compound type constructed from any dependent type. */
11513 if (TYPE_PTR_TO_MEMBER_P (type))
11514 return (dependent_type_p (TYPE_PTRMEM_CLASS_TYPE (type))
11515 || dependent_type_p (TYPE_PTRMEM_POINTED_TO_TYPE
11517 else if (TREE_CODE (type) == POINTER_TYPE
11518 || TREE_CODE (type) == REFERENCE_TYPE)
11519 return dependent_type_p (TREE_TYPE (type));
11520 else if (TREE_CODE (type) == FUNCTION_TYPE
11521 || TREE_CODE (type) == METHOD_TYPE)
11525 if (dependent_type_p (TREE_TYPE (type)))
11527 for (arg_type = TYPE_ARG_TYPES (type);
11529 arg_type = TREE_CHAIN (arg_type))
11530 if (dependent_type_p (TREE_VALUE (arg_type)))
11534 /* -- an array type constructed from any dependent type or whose
11535 size is specified by a constant expression that is
11536 value-dependent. */
11537 if (TREE_CODE (type) == ARRAY_TYPE)
11539 if (TYPE_DOMAIN (type)
11540 && ((value_dependent_expression_p
11541 (TYPE_MAX_VALUE (TYPE_DOMAIN (type))))
11542 || (type_dependent_expression_p
11543 (TYPE_MAX_VALUE (TYPE_DOMAIN (type))))))
11545 return dependent_type_p (TREE_TYPE (type));
11548 /* -- a template-id in which either the template name is a template
11550 if (TREE_CODE (type) == BOUND_TEMPLATE_TEMPLATE_PARM)
11552 /* ... or any of the template arguments is a dependent type or
11553 an expression that is type-dependent or value-dependent. */
11554 else if (CLASS_TYPE_P (type) && CLASSTYPE_TEMPLATE_INFO (type)
11555 && (any_dependent_template_arguments_p
11556 (INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type)))))
11559 /* All TYPEOF_TYPEs are dependent; if the argument of the `typeof'
11560 expression is not type-dependent, then it should already been
11562 if (TREE_CODE (type) == TYPEOF_TYPE)
11565 /* The standard does not specifically mention types that are local
11566 to template functions or local classes, but they should be
11567 considered dependent too. For example:
11569 template <int I> void f() {
11574 The size of `E' cannot be known until the value of `I' has been
11575 determined. Therefore, `E' must be considered dependent. */
11576 scope = TYPE_CONTEXT (type);
11577 if (scope && TYPE_P (scope))
11578 return dependent_type_p (scope);
11579 else if (scope && TREE_CODE (scope) == FUNCTION_DECL)
11580 return type_dependent_expression_p (scope);
11582 /* Other types are non-dependent. */
11586 /* Returns TRUE if TYPE is dependent, in the sense of
11587 [temp.dep.type]. */
11590 dependent_type_p (tree type)
11592 /* If there are no template parameters in scope, then there can't be
11593 any dependent types. */
11594 if (!processing_template_decl)
11597 /* If the type is NULL, we have not computed a type for the entity
11598 in question; in that case, the type is dependent. */
11602 /* Erroneous types can be considered non-dependent. */
11603 if (type == error_mark_node)
11606 /* If we have not already computed the appropriate value for TYPE,
11608 if (!TYPE_DEPENDENT_P_VALID (type))
11610 TYPE_DEPENDENT_P (type) = dependent_type_p_r (type);
11611 TYPE_DEPENDENT_P_VALID (type) = 1;
11614 return TYPE_DEPENDENT_P (type);
11617 /* Returns TRUE if EXPRESSION is dependent, according to CRITERION. */
11620 dependent_scope_ref_p (tree expression, bool criterion (tree))
11625 my_friendly_assert (TREE_CODE (expression) == SCOPE_REF, 20030714);
11627 if (!TYPE_P (TREE_OPERAND (expression, 0)))
11630 scope = TREE_OPERAND (expression, 0);
11631 name = TREE_OPERAND (expression, 1);
11635 An id-expression is type-dependent if it contains a
11636 nested-name-specifier that contains a class-name that names a
11638 /* The suggested resolution to Core Issue 2 implies that if the
11639 qualifying type is the current class, then we must peek
11642 && currently_open_class (scope)
11643 && !criterion (name))
11645 if (dependent_type_p (scope))
11651 /* Returns TRUE if the EXPRESSION is value-dependent, in the sense of
11652 [temp.dep.constexpr] */
11655 value_dependent_expression_p (tree expression)
11657 if (!processing_template_decl)
11660 /* A name declared with a dependent type. */
11661 if (TREE_CODE (expression) == IDENTIFIER_NODE
11662 || (DECL_P (expression)
11663 && type_dependent_expression_p (expression)))
11665 /* A non-type template parameter. */
11666 if ((TREE_CODE (expression) == CONST_DECL
11667 && DECL_TEMPLATE_PARM_P (expression))
11668 || TREE_CODE (expression) == TEMPLATE_PARM_INDEX)
11670 /* A constant with integral or enumeration type and is initialized
11671 with an expression that is value-dependent. */
11672 if (TREE_CODE (expression) == VAR_DECL
11673 && DECL_INITIAL (expression)
11674 && INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (expression))
11675 && value_dependent_expression_p (DECL_INITIAL (expression)))
11677 /* These expressions are value-dependent if the type to which the
11678 cast occurs is dependent or the expression being casted is
11679 value-dependent. */
11680 if (TREE_CODE (expression) == DYNAMIC_CAST_EXPR
11681 || TREE_CODE (expression) == STATIC_CAST_EXPR
11682 || TREE_CODE (expression) == CONST_CAST_EXPR
11683 || TREE_CODE (expression) == REINTERPRET_CAST_EXPR
11684 || TREE_CODE (expression) == CAST_EXPR)
11686 if (dependent_type_p (TREE_TYPE (expression)))
11688 /* A functional cast has a list of operands. */
11689 expression = TREE_OPERAND (expression, 0);
11690 if (TREE_CODE (expression) == TREE_LIST)
11694 if (value_dependent_expression_p (TREE_VALUE (expression)))
11696 expression = TREE_CHAIN (expression);
11698 while (expression);
11702 return value_dependent_expression_p (expression);
11704 /* A `sizeof' expression is value-dependent if the operand is
11706 if (TREE_CODE (expression) == SIZEOF_EXPR
11707 || TREE_CODE (expression) == ALIGNOF_EXPR)
11709 expression = TREE_OPERAND (expression, 0);
11710 if (TYPE_P (expression))
11711 return dependent_type_p (expression);
11712 return type_dependent_expression_p (expression);
11714 if (TREE_CODE (expression) == SCOPE_REF)
11715 return dependent_scope_ref_p (expression, value_dependent_expression_p);
11716 /* A constant expression is value-dependent if any subexpression is
11717 value-dependent. */
11718 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (expression))))
11720 switch (TREE_CODE_CLASS (TREE_CODE (expression)))
11723 return (value_dependent_expression_p
11724 (TREE_OPERAND (expression, 0)));
11727 return ((value_dependent_expression_p
11728 (TREE_OPERAND (expression, 0)))
11729 || (value_dependent_expression_p
11730 (TREE_OPERAND (expression, 1))));
11734 for (i = 0; i < first_rtl_op (TREE_CODE (expression)); ++i)
11735 /* In some cases, some of the operands may be missing.
11736 (For example, in the case of PREDECREMENT_EXPR, the
11737 amount to increment by may be missing.) That doesn't
11738 make the expression dependent. */
11739 if (TREE_OPERAND (expression, i)
11740 && (value_dependent_expression_p
11741 (TREE_OPERAND (expression, i))))
11748 /* The expression is not value-dependent. */
11752 /* Returns TRUE if the EXPRESSION is type-dependent, in the sense of
11753 [temp.dep.expr]. */
11756 type_dependent_expression_p (tree expression)
11758 if (!processing_template_decl)
11761 if (expression == error_mark_node)
11764 /* An unresolved name is always dependent. */
11765 if (TREE_CODE (expression) == IDENTIFIER_NODE)
11768 /* Some expression forms are never type-dependent. */
11769 if (TREE_CODE (expression) == PSEUDO_DTOR_EXPR
11770 || TREE_CODE (expression) == SIZEOF_EXPR
11771 || TREE_CODE (expression) == ALIGNOF_EXPR
11772 || TREE_CODE (expression) == TYPEID_EXPR
11773 || TREE_CODE (expression) == DELETE_EXPR
11774 || TREE_CODE (expression) == VEC_DELETE_EXPR
11775 || TREE_CODE (expression) == THROW_EXPR)
11778 /* The types of these expressions depends only on the type to which
11779 the cast occurs. */
11780 if (TREE_CODE (expression) == DYNAMIC_CAST_EXPR
11781 || TREE_CODE (expression) == STATIC_CAST_EXPR
11782 || TREE_CODE (expression) == CONST_CAST_EXPR
11783 || TREE_CODE (expression) == REINTERPRET_CAST_EXPR
11784 || TREE_CODE (expression) == CAST_EXPR)
11785 return dependent_type_p (TREE_TYPE (expression));
11787 /* The types of these expressions depends only on the type created
11788 by the expression. */
11789 if (TREE_CODE (expression) == NEW_EXPR
11790 || TREE_CODE (expression) == VEC_NEW_EXPR)
11792 /* For NEW_EXPR tree nodes created inside a template, either
11793 the object type itself or a TREE_LIST may appear as the
11795 tree type = TREE_OPERAND (expression, 1);
11796 if (TREE_CODE (type) == TREE_LIST)
11797 /* This is an array type. We need to check array dimensions
11799 return dependent_type_p (TREE_VALUE (TREE_PURPOSE (type)))
11800 || value_dependent_expression_p
11801 (TREE_OPERAND (TREE_VALUE (type), 1));
11803 return dependent_type_p (type);
11806 if (TREE_CODE (expression) == SCOPE_REF
11807 && dependent_scope_ref_p (expression,
11808 type_dependent_expression_p))
11811 if (TREE_CODE (expression) == FUNCTION_DECL
11812 && DECL_LANG_SPECIFIC (expression)
11813 && DECL_TEMPLATE_INFO (expression)
11814 && (any_dependent_template_arguments_p
11815 (INNERMOST_TEMPLATE_ARGS (DECL_TI_ARGS (expression)))))
11818 if (TREE_TYPE (expression) == unknown_type_node)
11820 if (TREE_CODE (expression) == ADDR_EXPR)
11821 return type_dependent_expression_p (TREE_OPERAND (expression, 0));
11822 if (TREE_CODE (expression) == COMPONENT_REF)
11824 if (type_dependent_expression_p (TREE_OPERAND (expression, 0)))
11826 expression = TREE_OPERAND (expression, 1);
11827 if (TREE_CODE (expression) == IDENTIFIER_NODE)
11831 if (TREE_CODE (expression) == BASELINK)
11832 expression = BASELINK_FUNCTIONS (expression);
11833 if (TREE_CODE (expression) == TEMPLATE_ID_EXPR)
11835 if (any_dependent_template_arguments_p
11836 (TREE_OPERAND (expression, 1)))
11838 expression = TREE_OPERAND (expression, 0);
11840 if (TREE_CODE (expression) == OVERLOAD)
11844 if (type_dependent_expression_p (OVL_CURRENT (expression)))
11846 expression = OVL_NEXT (expression);
11853 return (dependent_type_p (TREE_TYPE (expression)));
11856 /* Returns TRUE if ARGS (a TREE_LIST of arguments to a function call)
11857 contains a type-dependent expression. */
11860 any_type_dependent_arguments_p (tree args)
11864 tree arg = TREE_VALUE (args);
11866 if (type_dependent_expression_p (arg))
11868 args = TREE_CHAIN (args);
11873 /* Returns TRUE if the ARG (a template argument) is dependent. */
11876 dependent_template_arg_p (tree arg)
11878 if (!processing_template_decl)
11881 if (TREE_CODE (arg) == TEMPLATE_DECL
11882 || TREE_CODE (arg) == TEMPLATE_TEMPLATE_PARM)
11883 return dependent_template_p (arg);
11884 else if (TYPE_P (arg))
11885 return dependent_type_p (arg);
11887 return (type_dependent_expression_p (arg)
11888 || value_dependent_expression_p (arg));
11891 /* Returns true if ARGS (a collection of template arguments) contains
11892 any dependent arguments. */
11895 any_dependent_template_arguments_p (tree args)
11902 for (i = 0; i < TREE_VEC_LENGTH (args); ++i)
11903 if (dependent_template_arg_p (TREE_VEC_ELT (args, i)))
11909 /* Returns TRUE if the template TMPL is dependent. */
11912 dependent_template_p (tree tmpl)
11914 /* Template template parameters are dependent. */
11915 if (DECL_TEMPLATE_TEMPLATE_PARM_P (tmpl)
11916 || TREE_CODE (tmpl) == TEMPLATE_TEMPLATE_PARM)
11918 /* So are qualified names that have not been looked up. */
11919 if (TREE_CODE (tmpl) == SCOPE_REF)
11921 /* So are member templates of dependent classes. */
11922 if (TYPE_P (CP_DECL_CONTEXT (tmpl)))
11923 return dependent_type_p (DECL_CONTEXT (tmpl));
11927 /* Returns TRUE if the specialization TMPL<ARGS> is dependent. */
11930 dependent_template_id_p (tree tmpl, tree args)
11932 return (dependent_template_p (tmpl)
11933 || any_dependent_template_arguments_p (args));
11936 /* TYPE is a TYPENAME_TYPE. Returns the ordinary TYPE to which the
11937 TYPENAME_TYPE corresponds. Returns ERROR_MARK_NODE if no such TYPE
11938 can be found. Note that this function peers inside uninstantiated
11939 templates and therefore should be used only in extremely limited
11943 resolve_typename_type (tree type, bool only_current_p)
11950 my_friendly_assert (TREE_CODE (type) == TYPENAME_TYPE,
11953 scope = TYPE_CONTEXT (type);
11954 name = TYPE_IDENTIFIER (type);
11956 /* If the SCOPE is itself a TYPENAME_TYPE, then we need to resolve
11957 it first before we can figure out what NAME refers to. */
11958 if (TREE_CODE (scope) == TYPENAME_TYPE)
11959 scope = resolve_typename_type (scope, only_current_p);
11960 /* If we don't know what SCOPE refers to, then we cannot resolve the
11962 if (scope == error_mark_node || TREE_CODE (scope) == TYPENAME_TYPE)
11963 return error_mark_node;
11964 /* If the SCOPE is a template type parameter, we have no way of
11965 resolving the name. */
11966 if (TREE_CODE (scope) == TEMPLATE_TYPE_PARM)
11968 /* If the SCOPE is not the current instantiation, there's no reason
11969 to look inside it. */
11970 if (only_current_p && !currently_open_class (scope))
11971 return error_mark_node;
11972 /* If SCOPE is a partial instantiation, it will not have a valid
11973 TYPE_FIELDS list, so use the original template. */
11974 scope = CLASSTYPE_PRIMARY_TEMPLATE_TYPE (scope);
11975 /* Enter the SCOPE so that name lookup will be resolved as if we
11976 were in the class definition. In particular, SCOPE will no
11977 longer be considered a dependent type. */
11978 push_scope (scope);
11979 /* Look up the declaration. */
11980 decl = lookup_member (scope, name, /*protect=*/0, /*want_type=*/true);
11981 /* Obtain the set of qualifiers applied to the TYPE. */
11982 quals = cp_type_quals (type);
11983 /* For a TYPENAME_TYPE like "typename X::template Y<T>", we want to
11984 find a TEMPLATE_DECL. Otherwise, we want to find a TYPE_DECL. */
11986 type = error_mark_node;
11987 else if (TREE_CODE (TYPENAME_TYPE_FULLNAME (type)) == IDENTIFIER_NODE
11988 && TREE_CODE (decl) == TYPE_DECL)
11989 type = TREE_TYPE (decl);
11990 else if (TREE_CODE (TYPENAME_TYPE_FULLNAME (type)) == TEMPLATE_ID_EXPR
11991 && DECL_CLASS_TEMPLATE_P (decl))
11995 /* Obtain the template and the arguments. */
11996 tmpl = TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type), 0);
11997 args = TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type), 1);
11998 /* Instantiate the template. */
11999 type = lookup_template_class (tmpl, args, NULL_TREE, NULL_TREE,
12000 /*entering_scope=*/0, tf_error | tf_user);
12003 type = error_mark_node;
12004 /* Qualify the resulting type. */
12005 if (type != error_mark_node && quals)
12006 type = cp_build_qualified_type (type, quals);
12007 /* Leave the SCOPE. */
12013 /* EXPR is an expression which is not type-dependent. Return a proxy
12014 for EXPR that can be used to compute the types of larger
12015 expressions containing EXPR. */
12018 build_non_dependent_expr (tree expr)
12020 /* Preserve null pointer constants so that the type of things like
12021 "p == 0" where "p" is a pointer can be determined. */
12022 if (null_ptr_cst_p (expr))
12024 /* Preserve OVERLOADs; the functions must be available to resolve
12026 if (TREE_CODE (expr) == OVERLOAD)
12028 /* Preserve string constants; conversions from string constants to
12029 "char *" are allowed, even though normally a "const char *"
12030 cannot be used to initialize a "char *". */
12031 if (TREE_CODE (expr) == STRING_CST)
12034 if (TREE_CODE (expr) == COND_EXPR)
12035 return build (COND_EXPR,
12037 TREE_OPERAND (expr, 0),
12038 (TREE_OPERAND (expr, 1)
12039 ? build_non_dependent_expr (TREE_OPERAND (expr, 1))
12040 : build_non_dependent_expr (TREE_OPERAND (expr, 0))),
12041 build_non_dependent_expr (TREE_OPERAND (expr, 2)));
12042 if (TREE_CODE (expr) == COMPOUND_EXPR
12043 && !COMPOUND_EXPR_OVERLOADED (expr))
12044 return build (COMPOUND_EXPR,
12046 TREE_OPERAND (expr, 0),
12047 build_non_dependent_expr (TREE_OPERAND (expr, 1)));
12049 /* Otherwise, build a NON_DEPENDENT_EXPR.
12051 REFERENCE_TYPEs are not stripped for expressions in templates
12052 because doing so would play havoc with mangling. Consider, for
12055 template <typename T> void f<T& g>() { g(); }
12057 In the body of "f", the expression for "g" will have
12058 REFERENCE_TYPE, even though the standard says that it should
12059 not. The reason is that we must preserve the syntactic form of
12060 the expression so that mangling (say) "f<g>" inside the body of
12061 "f" works out correctly. Therefore, the REFERENCE_TYPE is
12063 return build1 (NON_DEPENDENT_EXPR, non_reference (TREE_TYPE (expr)), expr);
12066 /* ARGS is a TREE_LIST of expressions as arguments to a function call.
12067 Return a new TREE_LIST with the various arguments replaced with
12068 equivalent non-dependent expressions. */
12071 build_non_dependent_args (tree args)
12076 new_args = NULL_TREE;
12077 for (a = args; a; a = TREE_CHAIN (a))
12078 new_args = tree_cons (NULL_TREE,
12079 build_non_dependent_expr (TREE_VALUE (a)),
12081 return nreverse (new_args);
12084 #include "gt-cp-pt.h"