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);
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 int list_eq (tree, tree);
104 static tree get_class_bindings (tree, tree, tree);
105 static tree coerce_template_parms (tree, tree, tree, tsubst_flags_t, int);
106 static void tsubst_enum (tree, tree, tree);
107 static tree add_to_template_args (tree, tree);
108 static tree add_outermost_template_args (tree, tree);
109 static bool check_instantiated_args (tree, tree, tsubst_flags_t);
110 static int maybe_adjust_types_for_deduction (unification_kind_t, tree*, tree*);
111 static int type_unification_real (tree, tree, tree, tree,
112 int, unification_kind_t, int, int);
113 static void note_template_header (int);
114 static tree convert_nontype_argument (tree, tree);
115 static tree convert_template_argument (tree, tree, tree,
116 tsubst_flags_t, int, tree);
117 static tree get_bindings_overload (tree, tree, tree);
118 static int for_each_template_parm (tree, tree_fn_t, void*, htab_t);
119 static tree build_template_parm_index (int, int, int, tree, tree);
120 static int inline_needs_template_parms (tree);
121 static void push_inline_template_parms_recursive (tree, int);
122 static tree retrieve_specialization (tree, tree);
123 static tree retrieve_local_specialization (tree);
124 static tree register_specialization (tree, tree, tree);
125 static void register_local_specialization (tree, tree);
126 static tree reduce_template_parm_level (tree, tree, int);
127 static tree build_template_decl (tree, tree);
128 static int mark_template_parm (tree, void *);
129 static int template_parm_this_level_p (tree, void *);
130 static tree tsubst_friend_function (tree, tree);
131 static tree tsubst_friend_class (tree, tree);
132 static int can_complete_type_without_circularity (tree);
133 static tree get_bindings (tree, tree, tree);
134 static tree get_bindings_real (tree, tree, tree, int, int, int);
135 static int template_decl_level (tree);
136 static int check_cv_quals_for_unify (int, tree, tree);
137 static tree tsubst_template_arg (tree, tree, tsubst_flags_t, tree);
138 static tree tsubst_template_args (tree, tree, tsubst_flags_t, tree);
139 static tree tsubst_template_parms (tree, tree, tsubst_flags_t);
140 static void regenerate_decl_from_template (tree, tree);
141 static tree most_specialized (tree, tree, tree);
142 static tree most_specialized_class (tree, tree);
143 static int template_class_depth_real (tree, int);
144 static tree tsubst_aggr_type (tree, tree, tsubst_flags_t, tree, int);
145 static tree tsubst_decl (tree, tree, tree, tsubst_flags_t);
146 static tree tsubst_arg_types (tree, tree, tsubst_flags_t, tree);
147 static tree tsubst_function_type (tree, tree, tsubst_flags_t, tree);
148 static void check_specialization_scope (void);
149 static tree process_partial_specialization (tree);
150 static void set_current_access_from_decl (tree);
151 static void check_default_tmpl_args (tree, tree, int, int);
152 static tree tsubst_call_declarator_parms (tree, tree, tsubst_flags_t, tree);
153 static tree get_template_base_recursive (tree, tree, tree, tree, tree, int);
154 static tree get_template_base (tree, tree, tree, tree);
155 static int verify_class_unification (tree, tree, tree);
156 static tree try_class_unification (tree, tree, tree, tree);
157 static int coerce_template_template_parms (tree, tree, tsubst_flags_t,
159 static tree determine_specialization (tree, tree, tree *, int);
160 static int template_args_equal (tree, tree);
161 static void tsubst_default_arguments (tree);
162 static tree for_each_template_parm_r (tree *, int *, void *);
163 static tree copy_default_args_to_explicit_spec_1 (tree, tree);
164 static void copy_default_args_to_explicit_spec (tree);
165 static int invalid_nontype_parm_type_p (tree, tsubst_flags_t);
166 static int eq_local_specializations (const void *, const void *);
167 static bool dependent_type_p_r (tree);
168 static tree tsubst (tree, tree, tsubst_flags_t, tree);
169 static tree tsubst_expr (tree, tree, tsubst_flags_t, tree);
170 static tree tsubst_copy (tree, tree, tsubst_flags_t, tree);
172 /* Make the current scope suitable for access checking when we are
173 processing T. T can be FUNCTION_DECL for instantiated function
174 template, or VAR_DECL for static member variable (need by
175 instantiate_decl). */
178 push_access_scope (tree t)
180 my_friendly_assert (TREE_CODE (t) == FUNCTION_DECL
181 || TREE_CODE (t) == VAR_DECL,
184 if (DECL_CLASS_SCOPE_P (t))
185 push_nested_class (DECL_CONTEXT (t));
187 push_to_top_level ();
189 if (TREE_CODE (t) == FUNCTION_DECL)
191 saved_access_scope = tree_cons
192 (NULL_TREE, current_function_decl, saved_access_scope);
193 current_function_decl = t;
197 /* Restore the scope set up by push_access_scope. T is the node we
201 pop_access_scope (tree t)
203 if (TREE_CODE (t) == FUNCTION_DECL)
205 current_function_decl = TREE_VALUE (saved_access_scope);
206 saved_access_scope = TREE_CHAIN (saved_access_scope);
209 if (DECL_CLASS_SCOPE_P (t))
212 pop_from_top_level ();
215 /* Do any processing required when DECL (a member template
216 declaration) is finished. Returns the TEMPLATE_DECL corresponding
217 to DECL, unless it is a specialization, in which case the DECL
218 itself is returned. */
221 finish_member_template_decl (tree decl)
223 if (decl == error_mark_node)
224 return error_mark_node;
226 my_friendly_assert (DECL_P (decl), 20020812);
228 if (TREE_CODE (decl) == TYPE_DECL)
232 type = TREE_TYPE (decl);
233 if (IS_AGGR_TYPE (type)
234 && CLASSTYPE_TEMPLATE_INFO (type)
235 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (type))
237 tree tmpl = CLASSTYPE_TI_TEMPLATE (type);
238 check_member_template (tmpl);
243 else if (TREE_CODE (decl) == FIELD_DECL)
244 error ("data member `%D' cannot be a member template", decl);
245 else if (DECL_TEMPLATE_INFO (decl))
247 if (!DECL_TEMPLATE_SPECIALIZATION (decl))
249 check_member_template (DECL_TI_TEMPLATE (decl));
250 return DECL_TI_TEMPLATE (decl);
256 error ("invalid member template declaration `%D'", decl);
258 return error_mark_node;
261 /* Returns the template nesting level of the indicated class TYPE.
271 A<T>::B<U> has depth two, while A<T> has depth one.
272 Both A<T>::B<int> and A<int>::B<U> have depth one, if
273 COUNT_SPECIALIZATIONS is 0 or if they are instantiations, not
276 This function is guaranteed to return 0 if passed NULL_TREE so
277 that, for example, `template_class_depth (current_class_type)' is
281 template_class_depth_real (tree type, int count_specializations)
286 type && TREE_CODE (type) != NAMESPACE_DECL;
287 type = (TREE_CODE (type) == FUNCTION_DECL)
288 ? CP_DECL_CONTEXT (type) : TYPE_CONTEXT (type))
290 if (TREE_CODE (type) != FUNCTION_DECL)
292 if (CLASSTYPE_TEMPLATE_INFO (type)
293 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (type))
294 && ((count_specializations
295 && CLASSTYPE_TEMPLATE_SPECIALIZATION (type))
296 || uses_template_parms (CLASSTYPE_TI_ARGS (type))))
301 if (DECL_TEMPLATE_INFO (type)
302 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (type))
303 && ((count_specializations
304 && DECL_TEMPLATE_SPECIALIZATION (type))
305 || uses_template_parms (DECL_TI_ARGS (type))))
313 /* Returns the template nesting level of the indicated class TYPE.
314 Like template_class_depth_real, but instantiations do not count in
318 template_class_depth (tree type)
320 return template_class_depth_real (type, /*count_specializations=*/0);
323 /* Returns 1 if processing DECL as part of do_pending_inlines
324 needs us to push template parms. */
327 inline_needs_template_parms (tree decl)
329 if (! DECL_TEMPLATE_INFO (decl))
332 return (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (most_general_template (decl)))
333 > (processing_template_decl + DECL_TEMPLATE_SPECIALIZATION (decl)));
336 /* Subroutine of maybe_begin_member_template_processing.
337 Push the template parms in PARMS, starting from LEVELS steps into the
338 chain, and ending at the beginning, since template parms are listed
342 push_inline_template_parms_recursive (tree parmlist, int levels)
344 tree parms = TREE_VALUE (parmlist);
348 push_inline_template_parms_recursive (TREE_CHAIN (parmlist), levels - 1);
350 ++processing_template_decl;
351 current_template_parms
352 = tree_cons (size_int (processing_template_decl),
353 parms, current_template_parms);
354 TEMPLATE_PARMS_FOR_INLINE (current_template_parms) = 1;
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);
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);
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 if (current_namespace
735 != decl_namespace_context (CLASSTYPE_TI_TEMPLATE (type)))
737 pedwarn ("specializing `%#T' in different namespace", type);
738 cp_pedwarn_at (" from definition of `%#D'",
739 CLASSTYPE_TI_TEMPLATE (type));
741 SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (type);
742 if (processing_template_decl)
743 push_template_decl (TYPE_MAIN_DECL (type));
745 else if (CLASSTYPE_TEMPLATE_INSTANTIATION (type))
746 error ("specialization of `%T' after instantiation", type);
748 else if (CLASS_TYPE_P (type)
749 && !CLASSTYPE_USE_TEMPLATE (type)
750 && CLASSTYPE_TEMPLATE_INFO (type)
751 && context && CLASS_TYPE_P (context)
752 && CLASSTYPE_TEMPLATE_INFO (context))
754 /* This is for an explicit specialization of member class
755 template according to [temp.expl.spec/18]:
757 template <> template <class U> class C<int>::D;
759 The context `C<int>' must be an implicit instantiation.
760 Otherwise this is just a member class template declared
763 template <> class C<int> { template <class U> class D; };
764 template <> template <class U> class C<int>::D;
766 In the first case, `C<int>::D' is a specialization of `C<T>::D'
767 while in the second case, `C<int>::D' is a primary template
768 and `C<T>::D' may not exist. */
770 if (CLASSTYPE_IMPLICIT_INSTANTIATION (context)
771 && !COMPLETE_TYPE_P (type))
775 if (current_namespace
776 != decl_namespace_context (CLASSTYPE_TI_TEMPLATE (type)))
778 pedwarn ("specializing `%#T' in different namespace", type);
779 cp_pedwarn_at (" from definition of `%#D'",
780 CLASSTYPE_TI_TEMPLATE (type));
783 /* Check for invalid specialization after instantiation:
785 template <> template <> class C<int>::D<int>;
786 template <> template <class U> class C<int>::D; */
788 for (t = DECL_TEMPLATE_INSTANTIATIONS
789 (most_general_template (CLASSTYPE_TI_TEMPLATE (type)));
790 t; t = TREE_CHAIN (t))
791 if (TREE_VALUE (t) != type
792 && TYPE_CONTEXT (TREE_VALUE (t)) == context)
793 error ("specialization `%T' after instantiation `%T'",
794 type, TREE_VALUE (t));
796 /* Mark TYPE as a specialization. And as a result, we only
797 have one level of template argument for the innermost
799 SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (type);
800 CLASSTYPE_TI_ARGS (type)
801 = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type));
804 else if (processing_specialization)
805 error ("explicit specialization of non-template `%T'", type);
808 /* Retrieve the specialization (in the sense of [temp.spec] - a
809 specialization is either an instantiation or an explicit
810 specialization) of TMPL for the given template ARGS. If there is
811 no such specialization, return NULL_TREE. The ARGS are a vector of
812 arguments, or a vector of vectors of arguments, in the case of
813 templates with more than one level of parameters. */
816 retrieve_specialization (tree tmpl, tree args)
820 my_friendly_assert (TREE_CODE (tmpl) == TEMPLATE_DECL, 0);
822 /* There should be as many levels of arguments as there are
823 levels of parameters. */
824 my_friendly_assert (TMPL_ARGS_DEPTH (args)
825 == TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl)),
828 for (s = DECL_TEMPLATE_SPECIALIZATIONS (tmpl);
831 if (comp_template_args (TREE_PURPOSE (s), args))
832 return TREE_VALUE (s);
837 /* Like retrieve_specialization, but for local declarations. */
840 retrieve_local_specialization (tree tmpl)
842 tree spec = htab_find_with_hash (local_specializations, tmpl,
843 htab_hash_pointer (tmpl));
844 return spec ? TREE_PURPOSE (spec) : NULL_TREE;
847 /* Returns nonzero iff DECL is a specialization of TMPL. */
850 is_specialization_of (tree decl, tree tmpl)
854 if (TREE_CODE (decl) == FUNCTION_DECL)
858 t = DECL_TEMPLATE_INFO (t) ? DECL_TI_TEMPLATE (t) : NULL_TREE)
864 my_friendly_assert (TREE_CODE (decl) == TYPE_DECL, 0);
866 for (t = TREE_TYPE (decl);
868 t = CLASSTYPE_USE_TEMPLATE (t)
869 ? TREE_TYPE (CLASSTYPE_TI_TEMPLATE (t)) : NULL_TREE)
870 if (same_type_ignoring_top_level_qualifiers_p (t, TREE_TYPE (tmpl)))
877 /* Register the specialization SPEC as a specialization of TMPL with
878 the indicated ARGS. Returns SPEC, or an equivalent prior
879 declaration, if available. */
882 register_specialization (tree spec, tree tmpl, tree args)
886 my_friendly_assert (TREE_CODE (tmpl) == TEMPLATE_DECL, 0);
888 if (TREE_CODE (spec) == FUNCTION_DECL
889 && uses_template_parms (DECL_TI_ARGS (spec)))
890 /* This is the FUNCTION_DECL for a partial instantiation. Don't
891 register it; we want the corresponding TEMPLATE_DECL instead.
892 We use `uses_template_parms (DECL_TI_ARGS (spec))' rather than
893 the more obvious `uses_template_parms (spec)' to avoid problems
894 with default function arguments. In particular, given
897 template <class T> void f(T t1, T t = T())
899 the default argument expression is not substituted for in an
900 instantiation unless and until it is actually needed. */
903 /* There should be as many levels of arguments as there are
904 levels of parameters. */
905 my_friendly_assert (TMPL_ARGS_DEPTH (args)
906 == TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl)),
909 for (s = DECL_TEMPLATE_SPECIALIZATIONS (tmpl);
913 tree fn = TREE_VALUE (s);
915 /* We can sometimes try to re-register a specialization that we've
916 already got. In particular, regenerate_decl_from_template
917 calls duplicate_decls which will update the specialization
918 list. But, we'll still get called again here anyhow. It's
919 more convenient to simply allow this than to try to prevent it. */
922 else if (comp_template_args (TREE_PURPOSE (s), args))
924 if (DECL_TEMPLATE_SPECIALIZATION (spec))
926 if (DECL_TEMPLATE_INSTANTIATION (fn))
929 || DECL_EXPLICIT_INSTANTIATION (fn))
931 error ("specialization of %D after instantiation",
937 /* This situation should occur only if the first
938 specialization is an implicit instantiation,
939 the second is an explicit specialization, and
940 the implicit instantiation has not yet been
941 used. That situation can occur if we have
942 implicitly instantiated a member function and
943 then specialized it later.
945 We can also wind up here if a friend
946 declaration that looked like an instantiation
947 turns out to be a specialization:
949 template <class T> void foo(T);
950 class S { friend void foo<>(int) };
951 template <> void foo(int);
953 We transform the existing DECL in place so that
954 any pointers to it become pointers to the
957 If there was a definition for the template, but
958 not for the specialization, we want this to
959 look as if there is no definition, and vice
961 DECL_INITIAL (fn) = NULL_TREE;
962 duplicate_decls (spec, fn);
967 else if (DECL_TEMPLATE_SPECIALIZATION (fn))
969 if (!duplicate_decls (spec, fn) && DECL_INITIAL (spec))
970 /* Dup decl failed, but this is a new
971 definition. Set the line number so any errors
972 match this new definition. */
973 DECL_SOURCE_LOCATION (fn) = DECL_SOURCE_LOCATION (spec);
981 DECL_TEMPLATE_SPECIALIZATIONS (tmpl)
982 = tree_cons (args, spec, DECL_TEMPLATE_SPECIALIZATIONS (tmpl));
987 /* Unregister the specialization SPEC as a specialization of TMPL.
988 Replace it with NEW_SPEC, if NEW_SPEC is non-NULL. Returns true
989 if the SPEC was listed as a specialization of TMPL. */
992 reregister_specialization (tree spec, tree tmpl, tree new_spec)
996 for (s = &DECL_TEMPLATE_SPECIALIZATIONS (tmpl);
998 s = &TREE_CHAIN (*s))
999 if (TREE_VALUE (*s) == spec)
1002 *s = TREE_CHAIN (*s);
1004 TREE_VALUE (*s) = new_spec;
1011 /* Compare an entry in the local specializations hash table P1 (which
1012 is really a pointer to a TREE_LIST) with P2 (which is really a
1016 eq_local_specializations (const void *p1, const void *p2)
1018 return TREE_VALUE ((tree) p1) == (tree) p2;
1021 /* Hash P1, an entry in the local specializations table. */
1024 hash_local_specialization (const void* p1)
1026 return htab_hash_pointer (TREE_VALUE ((tree) p1));
1029 /* Like register_specialization, but for local declarations. We are
1030 registering SPEC, an instantiation of TMPL. */
1033 register_local_specialization (tree spec, tree tmpl)
1037 slot = htab_find_slot_with_hash (local_specializations, tmpl,
1038 htab_hash_pointer (tmpl), INSERT);
1039 *slot = build_tree_list (spec, tmpl);
1042 /* Print the list of candidate FNS in an error message. */
1045 print_candidates (tree fns)
1049 const char *str = "candidates are:";
1051 for (fn = fns; fn != NULL_TREE; fn = TREE_CHAIN (fn))
1055 for (f = TREE_VALUE (fn); f; f = OVL_NEXT (f))
1056 cp_error_at ("%s %+#D", str, OVL_CURRENT (f));
1061 /* Returns the template (one of the functions given by TEMPLATE_ID)
1062 which can be specialized to match the indicated DECL with the
1063 explicit template args given in TEMPLATE_ID. The DECL may be
1064 NULL_TREE if none is available. In that case, the functions in
1065 TEMPLATE_ID are non-members.
1067 If NEED_MEMBER_TEMPLATE is nonzero the function is known to be a
1068 specialization of a member template.
1070 The template args (those explicitly specified and those deduced)
1071 are output in a newly created vector *TARGS_OUT.
1073 If it is impossible to determine the result, an error message is
1074 issued. The error_mark_node is returned to indicate failure. */
1077 determine_specialization (tree template_id,
1080 int need_member_template)
1084 tree explicit_targs;
1085 tree candidates = NULL_TREE;
1086 tree templates = NULL_TREE;
1088 *targs_out = NULL_TREE;
1090 if (template_id == error_mark_node)
1091 return error_mark_node;
1093 fns = TREE_OPERAND (template_id, 0);
1094 explicit_targs = TREE_OPERAND (template_id, 1);
1096 if (fns == error_mark_node)
1097 return error_mark_node;
1099 /* Check for baselinks. */
1100 if (BASELINK_P (fns))
1101 fns = BASELINK_FUNCTIONS (fns);
1103 if (!is_overloaded_fn (fns))
1105 error ("`%D' is not a function template", fns);
1106 return error_mark_node;
1109 for (; fns; fns = OVL_NEXT (fns))
1111 tree fn = OVL_CURRENT (fns);
1113 if (TREE_CODE (fn) == TEMPLATE_DECL)
1115 tree decl_arg_types;
1117 /* DECL might be a specialization of FN. */
1119 /* Adjust the type of DECL in case FN is a static member. */
1120 decl_arg_types = TYPE_ARG_TYPES (TREE_TYPE (decl));
1121 if (DECL_STATIC_FUNCTION_P (fn)
1122 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl))
1123 decl_arg_types = TREE_CHAIN (decl_arg_types);
1125 /* Check that the number of function parameters matches.
1127 template <class T> void f(int i = 0);
1128 template <> void f<int>();
1129 The specialization f<int> is invalid but is not caught
1130 by get_bindings below. */
1132 if (list_length (TYPE_ARG_TYPES (TREE_TYPE (fn)))
1133 != list_length (decl_arg_types))
1136 /* See whether this function might be a specialization of this
1138 targs = get_bindings (fn, decl, explicit_targs);
1141 /* We cannot deduce template arguments that when used to
1142 specialize TMPL will produce DECL. */
1145 /* Save this template, and the arguments deduced. */
1146 templates = tree_cons (targs, fn, templates);
1148 else if (need_member_template)
1149 /* FN is an ordinary member function, and we need a
1150 specialization of a member template. */
1152 else if (TREE_CODE (fn) != FUNCTION_DECL)
1153 /* We can get IDENTIFIER_NODEs here in certain erroneous
1156 else if (!DECL_FUNCTION_MEMBER_P (fn))
1157 /* This is just an ordinary non-member function. Nothing can
1158 be a specialization of that. */
1160 else if (DECL_ARTIFICIAL (fn))
1161 /* Cannot specialize functions that are created implicitly. */
1165 tree decl_arg_types;
1167 /* This is an ordinary member function. However, since
1168 we're here, we can assume it's enclosing class is a
1169 template class. For example,
1171 template <typename T> struct S { void f(); };
1172 template <> void S<int>::f() {}
1174 Here, S<int>::f is a non-template, but S<int> is a
1175 template class. If FN has the same type as DECL, we
1176 might be in business. */
1178 if (!DECL_TEMPLATE_INFO (fn))
1179 /* Its enclosing class is an explicit specialization
1180 of a template class. This is not a candidate. */
1183 if (!same_type_p (TREE_TYPE (TREE_TYPE (decl)),
1184 TREE_TYPE (TREE_TYPE (fn))))
1185 /* The return types differ. */
1188 /* Adjust the type of DECL in case FN is a static member. */
1189 decl_arg_types = TYPE_ARG_TYPES (TREE_TYPE (decl));
1190 if (DECL_STATIC_FUNCTION_P (fn)
1191 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl))
1192 decl_arg_types = TREE_CHAIN (decl_arg_types);
1194 if (compparms (TYPE_ARG_TYPES (TREE_TYPE (fn)),
1197 candidates = tree_cons (NULL_TREE, fn, candidates);
1201 if (templates && TREE_CHAIN (templates))
1207 It is possible for a specialization with a given function
1208 signature to be instantiated from more than one function
1209 template. In such cases, explicit specification of the
1210 template arguments must be used to uniquely identify the
1211 function template specialization being specialized.
1213 Note that here, there's no suggestion that we're supposed to
1214 determine which of the candidate templates is most
1215 specialized. However, we, also have:
1219 Partial ordering of overloaded function template
1220 declarations is used in the following contexts to select
1221 the function template to which a function template
1222 specialization refers:
1224 -- when an explicit specialization refers to a function
1227 So, we do use the partial ordering rules, at least for now.
1228 This extension can only serve to make invalid programs valid,
1229 so it's safe. And, there is strong anecdotal evidence that
1230 the committee intended the partial ordering rules to apply;
1231 the EDG front-end has that behavior, and John Spicer claims
1232 that the committee simply forgot to delete the wording in
1233 [temp.expl.spec]. */
1234 tree tmpl = most_specialized (templates, decl, explicit_targs);
1235 if (tmpl && tmpl != error_mark_node)
1237 targs = get_bindings (tmpl, decl, explicit_targs);
1238 templates = tree_cons (targs, tmpl, NULL_TREE);
1242 if (templates == NULL_TREE && candidates == NULL_TREE)
1244 cp_error_at ("template-id `%D' for `%+D' does not match any template declaration",
1246 return error_mark_node;
1248 else if ((templates && TREE_CHAIN (templates))
1249 || (candidates && TREE_CHAIN (candidates))
1250 || (templates && candidates))
1252 cp_error_at ("ambiguous template specialization `%D' for `%+D'",
1254 chainon (candidates, templates);
1255 print_candidates (candidates);
1256 return error_mark_node;
1259 /* We have one, and exactly one, match. */
1262 /* It was a specialization of an ordinary member function in a
1264 *targs_out = copy_node (DECL_TI_ARGS (TREE_VALUE (candidates)));
1265 return DECL_TI_TEMPLATE (TREE_VALUE (candidates));
1268 /* It was a specialization of a template. */
1269 targs = DECL_TI_ARGS (DECL_TEMPLATE_RESULT (TREE_VALUE (templates)));
1270 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (targs))
1272 *targs_out = copy_node (targs);
1273 SET_TMPL_ARGS_LEVEL (*targs_out,
1274 TMPL_ARGS_DEPTH (*targs_out),
1275 TREE_PURPOSE (templates));
1278 *targs_out = TREE_PURPOSE (templates);
1279 return TREE_VALUE (templates);
1282 /* Returns a chain of parameter types, exactly like the SPEC_TYPES,
1283 but with the default argument values filled in from those in the
1287 copy_default_args_to_explicit_spec_1 (tree spec_types,
1290 tree new_spec_types;
1295 if (spec_types == void_list_node)
1296 return void_list_node;
1298 /* Substitute into the rest of the list. */
1300 copy_default_args_to_explicit_spec_1 (TREE_CHAIN (spec_types),
1301 TREE_CHAIN (tmpl_types));
1303 /* Add the default argument for this parameter. */
1304 return hash_tree_cons (TREE_PURPOSE (tmpl_types),
1305 TREE_VALUE (spec_types),
1309 /* DECL is an explicit specialization. Replicate default arguments
1310 from the template it specializes. (That way, code like:
1312 template <class T> void f(T = 3);
1313 template <> void f(double);
1316 works, as required.) An alternative approach would be to look up
1317 the correct default arguments at the call-site, but this approach
1318 is consistent with how implicit instantiations are handled. */
1321 copy_default_args_to_explicit_spec (tree decl)
1326 tree new_spec_types;
1330 tree object_type = NULL_TREE;
1331 tree in_charge = NULL_TREE;
1332 tree vtt = NULL_TREE;
1334 /* See if there's anything we need to do. */
1335 tmpl = DECL_TI_TEMPLATE (decl);
1336 tmpl_types = TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (tmpl)));
1337 for (t = tmpl_types; t; t = TREE_CHAIN (t))
1338 if (TREE_PURPOSE (t))
1343 old_type = TREE_TYPE (decl);
1344 spec_types = TYPE_ARG_TYPES (old_type);
1346 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl))
1348 /* Remove the this pointer, but remember the object's type for
1350 object_type = TREE_TYPE (TREE_VALUE (spec_types));
1351 spec_types = TREE_CHAIN (spec_types);
1352 tmpl_types = TREE_CHAIN (tmpl_types);
1354 if (DECL_HAS_IN_CHARGE_PARM_P (decl))
1356 /* DECL may contain more parameters than TMPL due to the extra
1357 in-charge parameter in constructors and destructors. */
1358 in_charge = spec_types;
1359 spec_types = TREE_CHAIN (spec_types);
1361 if (DECL_HAS_VTT_PARM_P (decl))
1364 spec_types = TREE_CHAIN (spec_types);
1368 /* Compute the merged default arguments. */
1370 copy_default_args_to_explicit_spec_1 (spec_types, tmpl_types);
1372 /* Compute the new FUNCTION_TYPE. */
1376 new_spec_types = hash_tree_cons (TREE_PURPOSE (vtt),
1381 /* Put the in-charge parameter back. */
1382 new_spec_types = hash_tree_cons (TREE_PURPOSE (in_charge),
1383 TREE_VALUE (in_charge),
1386 new_type = build_cplus_method_type (object_type,
1387 TREE_TYPE (old_type),
1391 new_type = build_function_type (TREE_TYPE (old_type),
1393 new_type = build_type_attribute_variant (new_type,
1394 TYPE_ATTRIBUTES (old_type));
1395 new_type = build_exception_variant (new_type,
1396 TYPE_RAISES_EXCEPTIONS (old_type));
1397 TREE_TYPE (decl) = new_type;
1400 /* Check to see if the function just declared, as indicated in
1401 DECLARATOR, and in DECL, is a specialization of a function
1402 template. We may also discover that the declaration is an explicit
1403 instantiation at this point.
1405 Returns DECL, or an equivalent declaration that should be used
1406 instead if all goes well. Issues an error message if something is
1407 amiss. Returns error_mark_node if the error is not easily
1410 FLAGS is a bitmask consisting of the following flags:
1412 2: The function has a definition.
1413 4: The function is a friend.
1415 The TEMPLATE_COUNT is the number of references to qualifying
1416 template classes that appeared in the name of the function. For
1419 template <class T> struct S { void f(); };
1422 the TEMPLATE_COUNT would be 1. However, explicitly specialized
1423 classes are not counted in the TEMPLATE_COUNT, so that in
1425 template <class T> struct S {};
1426 template <> struct S<int> { void f(); }
1427 template <> void S<int>::f();
1429 the TEMPLATE_COUNT would be 0. (Note that this declaration is
1430 invalid; there should be no template <>.)
1432 If the function is a specialization, it is marked as such via
1433 DECL_TEMPLATE_SPECIALIZATION. Furthermore, its DECL_TEMPLATE_INFO
1434 is set up correctly, and it is added to the list of specializations
1435 for that template. */
1438 check_explicit_specialization (tree declarator,
1443 int have_def = flags & 2;
1444 int is_friend = flags & 4;
1445 int specialization = 0;
1446 int explicit_instantiation = 0;
1447 int member_specialization = 0;
1448 tree ctype = DECL_CLASS_CONTEXT (decl);
1449 tree dname = DECL_NAME (decl);
1452 tsk = current_tmpl_spec_kind (template_count);
1457 if (processing_specialization)
1460 SET_DECL_TEMPLATE_SPECIALIZATION (decl);
1462 else if (TREE_CODE (declarator) == TEMPLATE_ID_EXPR)
1465 /* This could be something like:
1467 template <class T> void f(T);
1468 class S { friend void f<>(int); } */
1472 /* This case handles bogus declarations like template <>
1473 template <class T> void f<int>(); */
1475 error ("template-id `%D' in declaration of primary template",
1482 case tsk_invalid_member_spec:
1483 /* The error has already been reported in
1484 check_specialization_scope. */
1485 return error_mark_node;
1487 case tsk_invalid_expl_inst:
1488 error ("template parameter list used in explicit instantiation");
1494 error ("definition provided for explicit instantiation");
1496 explicit_instantiation = 1;
1499 case tsk_excessive_parms:
1500 error ("too many template parameter lists in declaration of `%D'",
1502 return error_mark_node;
1506 SET_DECL_TEMPLATE_SPECIALIZATION (decl);
1508 member_specialization = 1;
1513 case tsk_insufficient_parms:
1514 if (template_header_count)
1516 error("too few template parameter lists in declaration of `%D'",
1520 else if (ctype != NULL_TREE
1521 && !TYPE_BEING_DEFINED (ctype)
1522 && CLASSTYPE_TEMPLATE_INSTANTIATION (ctype)
1525 /* For backwards compatibility, we accept:
1527 template <class T> struct S { void f(); };
1528 void S<int>::f() {} // Missing template <>
1530 That used to be valid C++. */
1533 ("explicit specialization not preceded by `template <>'");
1535 SET_DECL_TEMPLATE_SPECIALIZATION (decl);
1540 if (TREE_CODE (declarator) == TEMPLATE_ID_EXPR)
1542 /* This case handles bogus declarations like template <>
1543 template <class T> void f<int>(); */
1545 if (uses_template_parms (declarator))
1546 error ("partial specialization `%D' of function template",
1549 error ("template-id `%D' in declaration of primary template",
1554 if (ctype && CLASSTYPE_TEMPLATE_INSTANTIATION (ctype))
1555 /* This is a specialization of a member template, without
1556 specialization the containing class. Something like:
1558 template <class T> struct S {
1559 template <class U> void f (U);
1561 template <> template <class U> void S<int>::f(U) {}
1563 That's a specialization -- but of the entire template. */
1571 if (specialization || member_specialization)
1573 tree t = TYPE_ARG_TYPES (TREE_TYPE (decl));
1574 for (; t; t = TREE_CHAIN (t))
1575 if (TREE_PURPOSE (t))
1578 ("default argument specified in explicit specialization");
1581 if (current_lang_name == lang_name_c)
1582 error ("template specialization with C linkage");
1585 if (specialization || member_specialization || explicit_instantiation)
1587 tree tmpl = NULL_TREE;
1588 tree targs = NULL_TREE;
1590 /* Make sure that the declarator is a TEMPLATE_ID_EXPR. */
1591 if (TREE_CODE (declarator) != TEMPLATE_ID_EXPR)
1595 my_friendly_assert (TREE_CODE (declarator) == IDENTIFIER_NODE, 0);
1600 /* If there is no class context, the explicit instantiation
1601 must be at namespace scope. */
1602 my_friendly_assert (DECL_NAMESPACE_SCOPE_P (decl), 20030625);
1604 /* Find the namespace binding, using the declaration
1606 fns = namespace_binding (dname, CP_DECL_CONTEXT (decl));
1609 declarator = lookup_template_function (fns, NULL_TREE);
1612 if (declarator == error_mark_node)
1613 return error_mark_node;
1615 if (ctype != NULL_TREE && TYPE_BEING_DEFINED (ctype))
1617 if (!explicit_instantiation)
1618 /* A specialization in class scope. This is invalid,
1619 but the error will already have been flagged by
1620 check_specialization_scope. */
1621 return error_mark_node;
1624 /* It's not valid to write an explicit instantiation in
1627 class C { template void f(); }
1629 This case is caught by the parser. However, on
1632 template class C { void f(); };
1634 (which is invalid) we can get here. The error will be
1641 else if (ctype != NULL_TREE
1642 && (TREE_CODE (TREE_OPERAND (declarator, 0)) ==
1645 /* Find the list of functions in ctype that have the same
1646 name as the declared function. */
1647 tree name = TREE_OPERAND (declarator, 0);
1648 tree fns = NULL_TREE;
1651 if (constructor_name_p (name, ctype))
1653 int is_constructor = DECL_CONSTRUCTOR_P (decl);
1655 if (is_constructor ? !TYPE_HAS_CONSTRUCTOR (ctype)
1656 : !TYPE_HAS_DESTRUCTOR (ctype))
1658 /* From [temp.expl.spec]:
1660 If such an explicit specialization for the member
1661 of a class template names an implicitly-declared
1662 special member function (clause _special_), the
1663 program is ill-formed.
1665 Similar language is found in [temp.explicit]. */
1666 error ("specialization of implicitly-declared special member function");
1667 return error_mark_node;
1670 name = is_constructor ? ctor_identifier : dtor_identifier;
1673 if (!DECL_CONV_FN_P (decl))
1675 idx = lookup_fnfields_1 (ctype, name);
1677 fns = TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (ctype), idx);
1683 /* For a type-conversion operator, we cannot do a
1684 name-based lookup. We might be looking for `operator
1685 int' which will be a specialization of `operator T'.
1686 So, we find *all* the conversion operators, and then
1687 select from them. */
1690 methods = CLASSTYPE_METHOD_VEC (ctype);
1692 for (idx = CLASSTYPE_FIRST_CONVERSION_SLOT;
1693 idx < TREE_VEC_LENGTH (methods); ++idx)
1695 tree ovl = TREE_VEC_ELT (methods, idx);
1697 if (!ovl || !DECL_CONV_FN_P (OVL_CURRENT (ovl)))
1698 /* There are no more conversion functions. */
1701 /* Glue all these conversion functions together
1702 with those we already have. */
1703 for (; ovl; ovl = OVL_NEXT (ovl))
1704 fns = ovl_cons (OVL_CURRENT (ovl), fns);
1708 if (fns == NULL_TREE)
1710 error ("no member function `%D' declared in `%T'",
1712 return error_mark_node;
1715 TREE_OPERAND (declarator, 0) = fns;
1718 /* Figure out what exactly is being specialized at this point.
1719 Note that for an explicit instantiation, even one for a
1720 member function, we cannot tell apriori whether the
1721 instantiation is for a member template, or just a member
1722 function of a template class. Even if a member template is
1723 being instantiated, the member template arguments may be
1724 elided if they can be deduced from the rest of the
1726 tmpl = determine_specialization (declarator, decl,
1728 member_specialization);
1730 if (!tmpl || tmpl == error_mark_node)
1731 /* We couldn't figure out what this declaration was
1733 return error_mark_node;
1736 tree gen_tmpl = most_general_template (tmpl);
1738 if (explicit_instantiation)
1740 /* We don't set DECL_EXPLICIT_INSTANTIATION here; that
1741 is done by do_decl_instantiation later. */
1743 int arg_depth = TMPL_ARGS_DEPTH (targs);
1744 int parm_depth = TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl));
1746 if (arg_depth > parm_depth)
1748 /* If TMPL is not the most general template (for
1749 example, if TMPL is a friend template that is
1750 injected into namespace scope), then there will
1751 be too many levels of TARGS. Remove some of them
1756 new_targs = make_tree_vec (parm_depth);
1757 for (i = arg_depth - parm_depth; i < arg_depth; ++i)
1758 TREE_VEC_ELT (new_targs, i - (arg_depth - parm_depth))
1759 = TREE_VEC_ELT (targs, i);
1763 return instantiate_template (tmpl, targs, tf_error);
1766 /* If we thought that the DECL was a member function, but it
1767 turns out to be specializing a static member function,
1768 make DECL a static member function as well. We also have
1769 to adjust last_function_parms to avoid confusing
1770 start_function later. */
1771 if (DECL_STATIC_FUNCTION_P (tmpl)
1772 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl))
1774 revert_static_member_fn (decl);
1775 last_function_parms = TREE_CHAIN (last_function_parms);
1778 /* If this is a specialization of a member template of a
1779 template class. In we want to return the TEMPLATE_DECL,
1780 not the specialization of it. */
1781 if (tsk == tsk_template)
1783 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl);
1784 DECL_INITIAL (DECL_TEMPLATE_RESULT (tmpl)) = NULL_TREE;
1787 DECL_SOURCE_LOCATION (tmpl) = DECL_SOURCE_LOCATION (decl);
1788 DECL_SOURCE_LOCATION (DECL_TEMPLATE_RESULT (tmpl))
1789 = DECL_SOURCE_LOCATION (decl);
1794 /* Set up the DECL_TEMPLATE_INFO for DECL. */
1795 DECL_TEMPLATE_INFO (decl) = tree_cons (tmpl, targs, NULL_TREE);
1797 /* Inherit default function arguments from the template
1798 DECL is specializing. */
1799 copy_default_args_to_explicit_spec (decl);
1801 /* This specialization has the same protection as the
1802 template it specializes. */
1803 TREE_PRIVATE (decl) = TREE_PRIVATE (gen_tmpl);
1804 TREE_PROTECTED (decl) = TREE_PROTECTED (gen_tmpl);
1806 if (is_friend && !have_def)
1807 /* This is not really a declaration of a specialization.
1808 It's just the name of an instantiation. But, it's not
1809 a request for an instantiation, either. */
1810 SET_DECL_IMPLICIT_INSTANTIATION (decl);
1811 else if (DECL_CONSTRUCTOR_P (decl) || DECL_DESTRUCTOR_P (decl))
1812 /* This is indeed a specialization. In case of constructors
1813 and destructors, we need in-charge and not-in-charge
1814 versions in V3 ABI. */
1815 clone_function_decl (decl, /*update_method_vec_p=*/0);
1817 /* Register this specialization so that we can find it
1819 decl = register_specialization (decl, gen_tmpl, targs);
1826 /* TYPE is being declared. Verify that the use of template headers
1827 and such is reasonable. Issue error messages if not. */
1830 maybe_check_template_type (tree type)
1832 if (template_header_count)
1834 /* We are in the scope of some `template <...>' header. */
1837 = template_class_depth_real (TYPE_CONTEXT (type),
1838 /*count_specializations=*/1);
1840 if (template_header_count <= context_depth)
1841 /* This is OK; the template headers are for the context. We
1842 are actually too lenient here; like
1843 check_explicit_specialization we should consider the number
1844 of template types included in the actual declaration. For
1847 template <class T> struct S {
1848 template <class U> template <class V>
1854 template <class T> struct S {
1855 template <class U> struct I;
1858 template <class T> template <class U.
1863 else if (template_header_count > context_depth + 1)
1864 /* There are two many template parameter lists. */
1865 error ("too many template parameter lists in declaration of `%T'", type);
1869 /* Returns 1 iff PARMS1 and PARMS2 are identical sets of template
1870 parameters. These are represented in the same format used for
1871 DECL_TEMPLATE_PARMS. */
1873 int comp_template_parms (tree parms1, tree parms2)
1878 if (parms1 == parms2)
1881 for (p1 = parms1, p2 = parms2;
1882 p1 != NULL_TREE && p2 != NULL_TREE;
1883 p1 = TREE_CHAIN (p1), p2 = TREE_CHAIN (p2))
1885 tree t1 = TREE_VALUE (p1);
1886 tree t2 = TREE_VALUE (p2);
1889 my_friendly_assert (TREE_CODE (t1) == TREE_VEC, 0);
1890 my_friendly_assert (TREE_CODE (t2) == TREE_VEC, 0);
1892 if (TREE_VEC_LENGTH (t1) != TREE_VEC_LENGTH (t2))
1895 for (i = 0; i < TREE_VEC_LENGTH (t2); ++i)
1897 tree parm1 = TREE_VALUE (TREE_VEC_ELT (t1, i));
1898 tree parm2 = TREE_VALUE (TREE_VEC_ELT (t2, i));
1900 if (TREE_CODE (parm1) != TREE_CODE (parm2))
1903 if (TREE_CODE (parm1) == TEMPLATE_TYPE_PARM)
1905 else if (!same_type_p (TREE_TYPE (parm1), TREE_TYPE (parm2)))
1910 if ((p1 != NULL_TREE) != (p2 != NULL_TREE))
1911 /* One set of parameters has more parameters lists than the
1918 /* Complain if DECL shadows a template parameter.
1920 [temp.local]: A template-parameter shall not be redeclared within its
1921 scope (including nested scopes). */
1924 check_template_shadow (tree decl)
1928 /* If we're not in a template, we can't possibly shadow a template
1930 if (!current_template_parms)
1933 /* Figure out what we're shadowing. */
1934 if (TREE_CODE (decl) == OVERLOAD)
1935 decl = OVL_CURRENT (decl);
1936 olddecl = IDENTIFIER_VALUE (DECL_NAME (decl));
1938 /* If there's no previous binding for this name, we're not shadowing
1939 anything, let alone a template parameter. */
1943 /* If we're not shadowing a template parameter, we're done. Note
1944 that OLDDECL might be an OVERLOAD (or perhaps even an
1945 ERROR_MARK), so we can't just blithely assume it to be a _DECL
1947 if (!DECL_P (olddecl) || !DECL_TEMPLATE_PARM_P (olddecl))
1950 /* We check for decl != olddecl to avoid bogus errors for using a
1951 name inside a class. We check TPFI to avoid duplicate errors for
1952 inline member templates. */
1954 || TEMPLATE_PARMS_FOR_INLINE (current_template_parms))
1957 cp_error_at ("declaration of `%#D'", decl);
1958 cp_error_at (" shadows template parm `%#D'", olddecl);
1961 /* Return a new TEMPLATE_PARM_INDEX with the indicated INDEX, LEVEL,
1962 ORIG_LEVEL, DECL, and TYPE. */
1965 build_template_parm_index (int index,
1971 tree t = make_node (TEMPLATE_PARM_INDEX);
1972 TEMPLATE_PARM_IDX (t) = index;
1973 TEMPLATE_PARM_LEVEL (t) = level;
1974 TEMPLATE_PARM_ORIG_LEVEL (t) = orig_level;
1975 TEMPLATE_PARM_DECL (t) = decl;
1976 TREE_TYPE (t) = type;
1977 TREE_CONSTANT (t) = TREE_CONSTANT (decl);
1978 TREE_READONLY (t) = TREE_READONLY (decl);
1983 /* Return a TEMPLATE_PARM_INDEX, similar to INDEX, but whose
1984 TEMPLATE_PARM_LEVEL has been decreased by LEVELS. If such a
1985 TEMPLATE_PARM_INDEX already exists, it is returned; otherwise, a
1986 new one is created. */
1989 reduce_template_parm_level (tree index, tree type, int levels)
1991 if (TEMPLATE_PARM_DESCENDANTS (index) == NULL_TREE
1992 || (TEMPLATE_PARM_LEVEL (TEMPLATE_PARM_DESCENDANTS (index))
1993 != TEMPLATE_PARM_LEVEL (index) - levels))
1995 tree orig_decl = TEMPLATE_PARM_DECL (index);
1998 decl = build_decl (TREE_CODE (orig_decl), DECL_NAME (orig_decl), type);
1999 TREE_CONSTANT (decl) = TREE_CONSTANT (orig_decl);
2000 TREE_READONLY (decl) = TREE_READONLY (orig_decl);
2001 DECL_ARTIFICIAL (decl) = 1;
2002 SET_DECL_TEMPLATE_PARM_P (decl);
2004 t = build_template_parm_index (TEMPLATE_PARM_IDX (index),
2005 TEMPLATE_PARM_LEVEL (index) - levels,
2006 TEMPLATE_PARM_ORIG_LEVEL (index),
2008 TEMPLATE_PARM_DESCENDANTS (index) = t;
2010 /* Template template parameters need this. */
2011 DECL_TEMPLATE_PARMS (decl)
2012 = DECL_TEMPLATE_PARMS (TEMPLATE_PARM_DECL (index));
2015 return TEMPLATE_PARM_DESCENDANTS (index);
2018 /* Process information from new template parameter NEXT and append it to the
2019 LIST being built. */
2022 process_template_parm (tree list, tree next)
2030 my_friendly_assert (TREE_CODE (parm) == TREE_LIST, 259);
2031 defval = TREE_PURPOSE (parm);
2032 parm = TREE_VALUE (parm);
2033 is_type = TREE_PURPOSE (parm) == class_type_node;
2037 tree p = TREE_VALUE (tree_last (list));
2039 if (TREE_CODE (p) == TYPE_DECL || TREE_CODE (p) == TEMPLATE_DECL)
2040 idx = TEMPLATE_TYPE_IDX (TREE_TYPE (p));
2042 idx = TEMPLATE_PARM_IDX (DECL_INITIAL (p));
2050 my_friendly_assert (TREE_CODE (TREE_PURPOSE (parm)) == TREE_LIST, 260);
2051 /* is a const-param */
2052 parm = grokdeclarator (TREE_VALUE (parm), TREE_PURPOSE (parm),
2054 SET_DECL_TEMPLATE_PARM_P (parm);
2058 The top-level cv-qualifiers on the template-parameter are
2059 ignored when determining its type. */
2060 TREE_TYPE (parm) = TYPE_MAIN_VARIANT (TREE_TYPE (parm));
2062 /* A template parameter is not modifiable. */
2063 TREE_READONLY (parm) = TREE_CONSTANT (parm) = 1;
2064 if (invalid_nontype_parm_type_p (TREE_TYPE (parm), 1))
2065 TREE_TYPE (parm) = void_type_node;
2066 decl = build_decl (CONST_DECL, DECL_NAME (parm), TREE_TYPE (parm));
2067 TREE_CONSTANT (decl) = TREE_READONLY (decl) = 1;
2068 DECL_INITIAL (parm) = DECL_INITIAL (decl)
2069 = build_template_parm_index (idx, processing_template_decl,
2070 processing_template_decl,
2071 decl, TREE_TYPE (parm));
2076 parm = TREE_VALUE (parm);
2078 if (parm && TREE_CODE (parm) == TEMPLATE_DECL)
2080 t = make_aggr_type (TEMPLATE_TEMPLATE_PARM);
2081 /* This is for distinguishing between real templates and template
2082 template parameters */
2083 TREE_TYPE (parm) = t;
2084 TREE_TYPE (DECL_TEMPLATE_RESULT (parm)) = t;
2089 t = make_aggr_type (TEMPLATE_TYPE_PARM);
2090 /* parm is either IDENTIFIER_NODE or NULL_TREE */
2091 decl = build_decl (TYPE_DECL, parm, t);
2094 TYPE_NAME (t) = decl;
2095 TYPE_STUB_DECL (t) = decl;
2097 TEMPLATE_TYPE_PARM_INDEX (t)
2098 = build_template_parm_index (idx, processing_template_decl,
2099 processing_template_decl,
2100 decl, TREE_TYPE (parm));
2102 DECL_ARTIFICIAL (decl) = 1;
2103 SET_DECL_TEMPLATE_PARM_P (decl);
2105 parm = build_tree_list (defval, parm);
2106 return chainon (list, parm);
2109 /* The end of a template parameter list has been reached. Process the
2110 tree list into a parameter vector, converting each parameter into a more
2111 useful form. Type parameters are saved as IDENTIFIER_NODEs, and others
2115 end_template_parm_list (tree parms)
2119 tree saved_parmlist = make_tree_vec (list_length (parms));
2121 current_template_parms
2122 = tree_cons (size_int (processing_template_decl),
2123 saved_parmlist, current_template_parms);
2125 for (parm = parms, nparms = 0; parm; parm = next, nparms++)
2127 next = TREE_CHAIN (parm);
2128 TREE_VEC_ELT (saved_parmlist, nparms) = parm;
2129 TREE_CHAIN (parm) = NULL_TREE;
2132 --processing_template_parmlist;
2134 return saved_parmlist;
2137 /* end_template_decl is called after a template declaration is seen. */
2140 end_template_decl (void)
2142 reset_specialization ();
2144 if (! processing_template_decl)
2147 /* This matches the pushlevel in begin_template_parm_list. */
2150 --processing_template_decl;
2151 current_template_parms = TREE_CHAIN (current_template_parms);
2154 /* Given a template argument vector containing the template PARMS.
2155 The innermost PARMS are given first. */
2158 current_template_args (void)
2161 tree args = NULL_TREE;
2162 int length = TMPL_PARMS_DEPTH (current_template_parms);
2165 /* If there is only one level of template parameters, we do not
2166 create a TREE_VEC of TREE_VECs. Instead, we return a single
2167 TREE_VEC containing the arguments. */
2169 args = make_tree_vec (length);
2171 for (header = current_template_parms; header; header = TREE_CHAIN (header))
2173 tree a = copy_node (TREE_VALUE (header));
2176 TREE_TYPE (a) = NULL_TREE;
2177 for (i = TREE_VEC_LENGTH (a) - 1; i >= 0; --i)
2179 tree t = TREE_VEC_ELT (a, i);
2181 /* T will be a list if we are called from within a
2182 begin/end_template_parm_list pair, but a vector directly
2183 if within a begin/end_member_template_processing pair. */
2184 if (TREE_CODE (t) == TREE_LIST)
2188 if (TREE_CODE (t) == TYPE_DECL
2189 || TREE_CODE (t) == TEMPLATE_DECL)
2192 t = DECL_INITIAL (t);
2193 TREE_VEC_ELT (a, i) = t;
2198 TREE_VEC_ELT (args, --l) = a;
2206 /* Return a TEMPLATE_DECL corresponding to DECL, using the indicated
2207 template PARMS. Used by push_template_decl below. */
2210 build_template_decl (tree decl, tree parms)
2212 tree tmpl = build_lang_decl (TEMPLATE_DECL, DECL_NAME (decl), NULL_TREE);
2213 DECL_TEMPLATE_PARMS (tmpl) = parms;
2214 DECL_CONTEXT (tmpl) = DECL_CONTEXT (decl);
2215 if (DECL_LANG_SPECIFIC (decl))
2217 DECL_STATIC_FUNCTION_P (tmpl) = DECL_STATIC_FUNCTION_P (decl);
2218 DECL_CONSTRUCTOR_P (tmpl) = DECL_CONSTRUCTOR_P (decl);
2219 DECL_DESTRUCTOR_P (tmpl) = DECL_DESTRUCTOR_P (decl);
2220 DECL_NONCONVERTING_P (tmpl) = DECL_NONCONVERTING_P (decl);
2221 DECL_ASSIGNMENT_OPERATOR_P (tmpl) = DECL_ASSIGNMENT_OPERATOR_P (decl);
2222 if (DECL_OVERLOADED_OPERATOR_P (decl))
2223 SET_OVERLOADED_OPERATOR_CODE (tmpl,
2224 DECL_OVERLOADED_OPERATOR_P (decl));
2230 struct template_parm_data
2232 /* The level of the template parameters we are currently
2236 /* The index of the specialization argument we are currently
2240 /* An array whose size is the number of template parameters. The
2241 elements are nonzero if the parameter has been used in any one
2242 of the arguments processed so far. */
2245 /* An array whose size is the number of template arguments. The
2246 elements are nonzero if the argument makes use of template
2247 parameters of this level. */
2248 int* arg_uses_template_parms;
2251 /* Subroutine of push_template_decl used to see if each template
2252 parameter in a partial specialization is used in the explicit
2253 argument list. If T is of the LEVEL given in DATA (which is
2254 treated as a template_parm_data*), then DATA->PARMS is marked
2258 mark_template_parm (tree t, void* data)
2262 struct template_parm_data* tpd = (struct template_parm_data*) data;
2264 if (TREE_CODE (t) == TEMPLATE_PARM_INDEX)
2266 level = TEMPLATE_PARM_LEVEL (t);
2267 idx = TEMPLATE_PARM_IDX (t);
2271 level = TEMPLATE_TYPE_LEVEL (t);
2272 idx = TEMPLATE_TYPE_IDX (t);
2275 if (level == tpd->level)
2277 tpd->parms[idx] = 1;
2278 tpd->arg_uses_template_parms[tpd->current_arg] = 1;
2281 /* Return zero so that for_each_template_parm will continue the
2282 traversal of the tree; we want to mark *every* template parm. */
2286 /* Process the partial specialization DECL. */
2289 process_partial_specialization (tree decl)
2291 tree type = TREE_TYPE (decl);
2292 tree maintmpl = CLASSTYPE_TI_TEMPLATE (type);
2293 tree specargs = CLASSTYPE_TI_ARGS (type);
2294 tree inner_args = INNERMOST_TEMPLATE_ARGS (specargs);
2295 tree inner_parms = INNERMOST_TEMPLATE_PARMS (current_template_parms);
2296 tree main_inner_parms = DECL_INNERMOST_TEMPLATE_PARMS (maintmpl);
2297 int nargs = TREE_VEC_LENGTH (inner_args);
2298 int ntparms = TREE_VEC_LENGTH (inner_parms);
2300 int did_error_intro = 0;
2301 struct template_parm_data tpd;
2302 struct template_parm_data tpd2;
2304 /* We check that each of the template parameters given in the
2305 partial specialization is used in the argument list to the
2306 specialization. For example:
2308 template <class T> struct S;
2309 template <class T> struct S<T*>;
2311 The second declaration is OK because `T*' uses the template
2312 parameter T, whereas
2314 template <class T> struct S<int>;
2316 is no good. Even trickier is:
2327 The S2<T> declaration is actually invalid; it is a
2328 full-specialization. Of course,
2331 struct S2<T (*)(U)>;
2333 or some such would have been OK. */
2334 tpd.level = TMPL_PARMS_DEPTH (current_template_parms);
2335 tpd.parms = alloca (sizeof (int) * ntparms);
2336 memset (tpd.parms, 0, sizeof (int) * ntparms);
2338 tpd.arg_uses_template_parms = alloca (sizeof (int) * nargs);
2339 memset (tpd.arg_uses_template_parms, 0, sizeof (int) * nargs);
2340 for (i = 0; i < nargs; ++i)
2342 tpd.current_arg = i;
2343 for_each_template_parm (TREE_VEC_ELT (inner_args, i),
2344 &mark_template_parm,
2348 for (i = 0; i < ntparms; ++i)
2349 if (tpd.parms[i] == 0)
2351 /* One of the template parms was not used in the
2353 if (!did_error_intro)
2355 error ("template parameters not used in partial specialization:");
2356 did_error_intro = 1;
2360 TREE_VALUE (TREE_VEC_ELT (inner_parms, i)));
2363 /* [temp.class.spec]
2365 The argument list of the specialization shall not be identical to
2366 the implicit argument list of the primary template. */
2367 if (comp_template_args
2369 INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE
2371 error ("partial specialization `%T' does not specialize any template arguments", type);
2373 /* [temp.class.spec]
2375 A partially specialized non-type argument expression shall not
2376 involve template parameters of the partial specialization except
2377 when the argument expression is a simple identifier.
2379 The type of a template parameter corresponding to a specialized
2380 non-type argument shall not be dependent on a parameter of the
2382 my_friendly_assert (nargs == DECL_NTPARMS (maintmpl), 0);
2384 for (i = 0; i < nargs; ++i)
2386 tree arg = TREE_VEC_ELT (inner_args, i);
2387 if (/* These first two lines are the `non-type' bit. */
2389 && TREE_CODE (arg) != TEMPLATE_DECL
2390 /* This next line is the `argument expression is not just a
2391 simple identifier' condition and also the `specialized
2392 non-type argument' bit. */
2393 && TREE_CODE (arg) != TEMPLATE_PARM_INDEX)
2395 if (tpd.arg_uses_template_parms[i])
2396 error ("template argument `%E' involves template parameter(s)", arg);
2399 /* Look at the corresponding template parameter,
2400 marking which template parameters its type depends
2403 TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (main_inner_parms,
2408 /* We haven't yet initialized TPD2. Do so now. */
2409 tpd2.arg_uses_template_parms
2410 = alloca (sizeof (int) * nargs);
2411 /* The number of parameters here is the number in the
2412 main template, which, as checked in the assertion
2414 tpd2.parms = alloca (sizeof (int) * nargs);
2416 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (maintmpl));
2419 /* Mark the template parameters. But this time, we're
2420 looking for the template parameters of the main
2421 template, not in the specialization. */
2422 tpd2.current_arg = i;
2423 tpd2.arg_uses_template_parms[i] = 0;
2424 memset (tpd2.parms, 0, sizeof (int) * nargs);
2425 for_each_template_parm (type,
2426 &mark_template_parm,
2430 if (tpd2.arg_uses_template_parms [i])
2432 /* The type depended on some template parameters.
2433 If they are fully specialized in the
2434 specialization, that's OK. */
2436 for (j = 0; j < nargs; ++j)
2437 if (tpd2.parms[j] != 0
2438 && tpd.arg_uses_template_parms [j])
2440 error ("type `%T' of template argument `%E' depends on template parameter(s)",
2450 if (retrieve_specialization (maintmpl, specargs))
2451 /* We've already got this specialization. */
2454 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl)
2455 = tree_cons (inner_args, inner_parms,
2456 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl));
2457 TREE_TYPE (DECL_TEMPLATE_SPECIALIZATIONS (maintmpl)) = type;
2461 /* Check that a template declaration's use of default arguments is not
2462 invalid. Here, PARMS are the template parameters. IS_PRIMARY is
2463 nonzero if DECL is the thing declared by a primary template.
2464 IS_PARTIAL is nonzero if DECL is a partial specialization. */
2467 check_default_tmpl_args (tree decl, tree parms, int is_primary, int is_partial)
2470 int last_level_to_check;
2475 A default template-argument shall not be specified in a
2476 function template declaration or a function template definition, nor
2477 in the template-parameter-list of the definition of a member of a
2480 if (TREE_CODE (CP_DECL_CONTEXT (decl)) == FUNCTION_DECL)
2481 /* You can't have a function template declaration in a local
2482 scope, nor you can you define a member of a class template in a
2486 if (current_class_type
2487 && !TYPE_BEING_DEFINED (current_class_type)
2488 && DECL_LANG_SPECIFIC (decl)
2489 /* If this is either a friend defined in the scope of the class
2490 or a member function. */
2491 && (DECL_FUNCTION_MEMBER_P (decl)
2492 ? same_type_p (DECL_CONTEXT (decl), current_class_type)
2493 : DECL_FRIEND_CONTEXT (decl)
2494 ? same_type_p (DECL_FRIEND_CONTEXT (decl), current_class_type)
2496 /* And, if it was a member function, it really was defined in
2497 the scope of the class. */
2498 && (!DECL_FUNCTION_MEMBER_P (decl)
2499 || DECL_INITIALIZED_IN_CLASS_P (decl)))
2500 /* We already checked these parameters when the template was
2501 declared, so there's no need to do it again now. This function
2502 was defined in class scope, but we're processing it's body now
2503 that the class is complete. */
2508 If a template-parameter has a default template-argument, all
2509 subsequent template-parameters shall have a default
2510 template-argument supplied. */
2511 for (parm_level = parms; parm_level; parm_level = TREE_CHAIN (parm_level))
2513 tree inner_parms = TREE_VALUE (parm_level);
2514 int ntparms = TREE_VEC_LENGTH (inner_parms);
2515 int seen_def_arg_p = 0;
2518 for (i = 0; i < ntparms; ++i)
2520 tree parm = TREE_VEC_ELT (inner_parms, i);
2521 if (TREE_PURPOSE (parm))
2523 else if (seen_def_arg_p)
2525 error ("no default argument for `%D'", TREE_VALUE (parm));
2526 /* For better subsequent error-recovery, we indicate that
2527 there should have been a default argument. */
2528 TREE_PURPOSE (parm) = error_mark_node;
2533 if (TREE_CODE (decl) != TYPE_DECL || is_partial || !is_primary)
2534 /* For an ordinary class template, default template arguments are
2535 allowed at the innermost level, e.g.:
2536 template <class T = int>
2538 but, in a partial specialization, they're not allowed even
2539 there, as we have in [temp.class.spec]:
2541 The template parameter list of a specialization shall not
2542 contain default template argument values.
2544 So, for a partial specialization, or for a function template,
2545 we look at all of them. */
2548 /* But, for a primary class template that is not a partial
2549 specialization we look at all template parameters except the
2551 parms = TREE_CHAIN (parms);
2553 /* Figure out what error message to issue. */
2554 if (TREE_CODE (decl) == FUNCTION_DECL)
2555 msg = "default template arguments may not be used in function templates";
2556 else if (is_partial)
2557 msg = "default template arguments may not be used in partial specializations";
2559 msg = "default argument for template parameter for class enclosing `%D'";
2561 if (current_class_type && TYPE_BEING_DEFINED (current_class_type))
2562 /* If we're inside a class definition, there's no need to
2563 examine the parameters to the class itself. On the one
2564 hand, they will be checked when the class is defined, and,
2565 on the other, default arguments are valid in things like:
2566 template <class T = double>
2567 struct S { template <class U> void f(U); };
2568 Here the default argument for `S' has no bearing on the
2569 declaration of `f'. */
2570 last_level_to_check = template_class_depth (current_class_type) + 1;
2572 /* Check everything. */
2573 last_level_to_check = 0;
2575 for (parm_level = parms;
2576 parm_level && TMPL_PARMS_DEPTH (parm_level) >= last_level_to_check;
2577 parm_level = TREE_CHAIN (parm_level))
2579 tree inner_parms = TREE_VALUE (parm_level);
2583 ntparms = TREE_VEC_LENGTH (inner_parms);
2584 for (i = 0; i < ntparms; ++i)
2585 if (TREE_PURPOSE (TREE_VEC_ELT (inner_parms, i)))
2593 /* Clear out the default argument so that we are not
2595 TREE_PURPOSE (TREE_VEC_ELT (inner_parms, i)) = NULL_TREE;
2598 /* At this point, if we're still interested in issuing messages,
2599 they must apply to classes surrounding the object declared. */
2601 msg = "default argument for template parameter for class enclosing `%D'";
2605 /* Worker for push_template_decl_real, called via
2606 for_each_template_parm. DATA is really an int, indicating the
2607 level of the parameters we are interested in. If T is a template
2608 parameter of that level, return nonzero. */
2611 template_parm_this_level_p (tree t, void* data)
2613 int this_level = *(int *)data;
2616 if (TREE_CODE (t) == TEMPLATE_PARM_INDEX)
2617 level = TEMPLATE_PARM_LEVEL (t);
2619 level = TEMPLATE_TYPE_LEVEL (t);
2620 return level == this_level;
2623 /* Creates a TEMPLATE_DECL for the indicated DECL using the template
2624 parameters given by current_template_args, or reuses a
2625 previously existing one, if appropriate. Returns the DECL, or an
2626 equivalent one, if it is replaced via a call to duplicate_decls.
2628 If IS_FRIEND is nonzero, DECL is a friend declaration. */
2631 push_template_decl_real (tree decl, int is_friend)
2639 int new_template_p = 0;
2641 /* See if this is a partial specialization. */
2642 is_partial = (DECL_IMPLICIT_TYPEDEF_P (decl)
2643 && TREE_CODE (TREE_TYPE (decl)) != ENUMERAL_TYPE
2644 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl)));
2646 is_friend |= (TREE_CODE (decl) == FUNCTION_DECL && DECL_FRIEND_P (decl));
2649 /* For a friend, we want the context of the friend function, not
2650 the type of which it is a friend. */
2651 ctx = DECL_CONTEXT (decl);
2652 else if (CP_DECL_CONTEXT (decl)
2653 && TREE_CODE (CP_DECL_CONTEXT (decl)) != NAMESPACE_DECL)
2654 /* In the case of a virtual function, we want the class in which
2656 ctx = CP_DECL_CONTEXT (decl);
2658 /* Otherwise, if we're currently defining some class, the DECL
2659 is assumed to be a member of the class. */
2660 ctx = current_scope ();
2662 if (ctx && TREE_CODE (ctx) == NAMESPACE_DECL)
2665 if (!DECL_CONTEXT (decl))
2666 DECL_CONTEXT (decl) = FROB_CONTEXT (current_namespace);
2668 /* See if this is a primary template. */
2669 primary = template_parm_scope_p ();
2673 if (current_lang_name == lang_name_c)
2674 error ("template with C linkage");
2675 else if (TREE_CODE (decl) == TYPE_DECL
2676 && ANON_AGGRNAME_P (DECL_NAME (decl)))
2677 error ("template class without a name");
2678 else if ((DECL_IMPLICIT_TYPEDEF_P (decl)
2679 && CLASS_TYPE_P (TREE_TYPE (decl)))
2680 || (TREE_CODE (decl) == VAR_DECL && ctx && CLASS_TYPE_P (ctx))
2681 || TREE_CODE (decl) == FUNCTION_DECL)
2684 error ("template declaration of `%#D'", decl);
2687 /* Check to see that the rules regarding the use of default
2688 arguments are not being violated. */
2689 check_default_tmpl_args (decl, current_template_parms,
2690 primary, is_partial);
2693 return process_partial_specialization (decl);
2695 args = current_template_args ();
2698 || TREE_CODE (ctx) == FUNCTION_DECL
2699 || (CLASS_TYPE_P (ctx) && TYPE_BEING_DEFINED (ctx))
2700 || (is_friend && !DECL_TEMPLATE_INFO (decl)))
2702 if (DECL_LANG_SPECIFIC (decl)
2703 && DECL_TEMPLATE_INFO (decl)
2704 && DECL_TI_TEMPLATE (decl))
2705 tmpl = DECL_TI_TEMPLATE (decl);
2706 /* If DECL is a TYPE_DECL for a class-template, then there won't
2707 be DECL_LANG_SPECIFIC. The information equivalent to
2708 DECL_TEMPLATE_INFO is found in TYPE_TEMPLATE_INFO instead. */
2709 else if (DECL_IMPLICIT_TYPEDEF_P (decl)
2710 && TYPE_TEMPLATE_INFO (TREE_TYPE (decl))
2711 && TYPE_TI_TEMPLATE (TREE_TYPE (decl)))
2713 /* Since a template declaration already existed for this
2714 class-type, we must be redeclaring it here. Make sure
2715 that the redeclaration is valid. */
2716 redeclare_class_template (TREE_TYPE (decl),
2717 current_template_parms);
2718 /* We don't need to create a new TEMPLATE_DECL; just use the
2719 one we already had. */
2720 tmpl = TYPE_TI_TEMPLATE (TREE_TYPE (decl));
2724 tmpl = build_template_decl (decl, current_template_parms);
2727 if (DECL_LANG_SPECIFIC (decl)
2728 && DECL_TEMPLATE_SPECIALIZATION (decl))
2730 /* A specialization of a member template of a template
2732 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl);
2733 DECL_TEMPLATE_INFO (tmpl) = DECL_TEMPLATE_INFO (decl);
2734 DECL_TEMPLATE_INFO (decl) = NULL_TREE;
2740 tree a, t, current, parms;
2743 if (TREE_CODE (decl) == TYPE_DECL)
2745 if ((IS_AGGR_TYPE_CODE (TREE_CODE (TREE_TYPE (decl)))
2746 || TREE_CODE (TREE_TYPE (decl)) == ENUMERAL_TYPE)
2747 && TYPE_TEMPLATE_INFO (TREE_TYPE (decl))
2748 && TYPE_TI_TEMPLATE (TREE_TYPE (decl)))
2749 tmpl = TYPE_TI_TEMPLATE (TREE_TYPE (decl));
2752 error ("`%D' does not declare a template type", decl);
2756 else if (!DECL_LANG_SPECIFIC (decl) || !DECL_TEMPLATE_INFO (decl))
2758 error ("template definition of non-template `%#D'", decl);
2762 tmpl = DECL_TI_TEMPLATE (decl);
2764 if (is_member_template (tmpl)
2765 && DECL_FUNCTION_TEMPLATE_P (tmpl)
2766 && DECL_TEMPLATE_INFO (decl) && DECL_TI_ARGS (decl)
2767 && DECL_TEMPLATE_SPECIALIZATION (decl))
2771 /* The declaration is a specialization of a member
2772 template, declared outside the class. Therefore, the
2773 innermost template arguments will be NULL, so we
2774 replace them with the arguments determined by the
2775 earlier call to check_explicit_specialization. */
2776 args = DECL_TI_ARGS (decl);
2779 = build_template_decl (decl, current_template_parms);
2780 DECL_TEMPLATE_RESULT (new_tmpl) = decl;
2781 TREE_TYPE (new_tmpl) = TREE_TYPE (decl);
2782 DECL_TI_TEMPLATE (decl) = new_tmpl;
2783 SET_DECL_TEMPLATE_SPECIALIZATION (new_tmpl);
2784 DECL_TEMPLATE_INFO (new_tmpl)
2785 = tree_cons (tmpl, args, NULL_TREE);
2787 register_specialization (new_tmpl,
2788 most_general_template (tmpl),
2793 /* Make sure the template headers we got make sense. */
2795 parms = DECL_TEMPLATE_PARMS (tmpl);
2796 i = TMPL_PARMS_DEPTH (parms);
2797 if (TMPL_ARGS_DEPTH (args) != i)
2799 error ("expected %d levels of template parms for `%#D', got %d",
2800 i, decl, TMPL_ARGS_DEPTH (args));
2803 for (current = decl; i > 0; --i, parms = TREE_CHAIN (parms))
2805 a = TMPL_ARGS_LEVEL (args, i);
2806 t = INNERMOST_TEMPLATE_PARMS (parms);
2808 if (TREE_VEC_LENGTH (t) != TREE_VEC_LENGTH (a))
2810 if (current == decl)
2811 error ("got %d template parameters for `%#D'",
2812 TREE_VEC_LENGTH (a), decl);
2814 error ("got %d template parameters for `%#T'",
2815 TREE_VEC_LENGTH (a), current);
2816 error (" but %d required", TREE_VEC_LENGTH (t));
2819 /* Perhaps we should also check that the parms are used in the
2820 appropriate qualifying scopes in the declarator? */
2822 if (current == decl)
2825 current = TYPE_CONTEXT (current);
2829 DECL_TEMPLATE_RESULT (tmpl) = decl;
2830 TREE_TYPE (tmpl) = TREE_TYPE (decl);
2832 /* Push template declarations for global functions and types. Note
2833 that we do not try to push a global template friend declared in a
2834 template class; such a thing may well depend on the template
2835 parameters of the class. */
2836 if (new_template_p && !ctx
2837 && !(is_friend && template_class_depth (current_class_type) > 0))
2838 tmpl = pushdecl_namespace_level (tmpl);
2842 DECL_PRIMARY_TEMPLATE (tmpl) = tmpl;
2843 if (DECL_CONV_FN_P (tmpl))
2845 int depth = TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl));
2847 /* It is a conversion operator. See if the type converted to
2848 depends on innermost template operands. */
2850 if (for_each_template_parm (TREE_TYPE (TREE_TYPE (tmpl)),
2851 template_parm_this_level_p,
2854 DECL_TEMPLATE_CONV_FN_P (tmpl) = 1;
2858 info = tree_cons (tmpl, args, NULL_TREE);
2860 if (DECL_IMPLICIT_TYPEDEF_P (decl))
2862 SET_TYPE_TEMPLATE_INFO (TREE_TYPE (tmpl), info);
2863 if ((!ctx || TREE_CODE (ctx) != FUNCTION_DECL)
2864 && TREE_CODE (TREE_TYPE (decl)) != ENUMERAL_TYPE
2865 /* Don't change the name if we've already set it up. */
2866 && !IDENTIFIER_TEMPLATE (DECL_NAME (decl)))
2867 DECL_NAME (decl) = classtype_mangled_name (TREE_TYPE (decl));
2869 else if (DECL_LANG_SPECIFIC (decl))
2870 DECL_TEMPLATE_INFO (decl) = info;
2872 return DECL_TEMPLATE_RESULT (tmpl);
2876 push_template_decl (tree decl)
2878 return push_template_decl_real (decl, 0);
2881 /* Called when a class template TYPE is redeclared with the indicated
2882 template PARMS, e.g.:
2884 template <class T> struct S;
2885 template <class T> struct S {}; */
2888 redeclare_class_template (tree type, tree parms)
2894 if (!TYPE_TEMPLATE_INFO (type))
2896 error ("`%T' is not a template type", type);
2900 tmpl = TYPE_TI_TEMPLATE (type);
2901 if (!PRIMARY_TEMPLATE_P (tmpl))
2902 /* The type is nested in some template class. Nothing to worry
2903 about here; there are no new template parameters for the nested
2907 parms = INNERMOST_TEMPLATE_PARMS (parms);
2908 tmpl_parms = DECL_INNERMOST_TEMPLATE_PARMS (tmpl);
2910 if (TREE_VEC_LENGTH (parms) != TREE_VEC_LENGTH (tmpl_parms))
2912 cp_error_at ("previous declaration `%D'", tmpl);
2913 error ("used %d template parameter%s instead of %d",
2914 TREE_VEC_LENGTH (tmpl_parms),
2915 TREE_VEC_LENGTH (tmpl_parms) == 1 ? "" : "s",
2916 TREE_VEC_LENGTH (parms));
2920 for (i = 0; i < TREE_VEC_LENGTH (tmpl_parms); ++i)
2922 tree tmpl_parm = TREE_VALUE (TREE_VEC_ELT (tmpl_parms, i));
2923 tree parm = TREE_VALUE (TREE_VEC_ELT (parms, i));
2924 tree tmpl_default = TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms, i));
2925 tree parm_default = TREE_PURPOSE (TREE_VEC_ELT (parms, i));
2927 if (TREE_CODE (tmpl_parm) != TREE_CODE (parm))
2929 cp_error_at ("template parameter `%#D'", tmpl_parm);
2930 error ("redeclared here as `%#D'", parm);
2934 if (tmpl_default != NULL_TREE && parm_default != NULL_TREE)
2936 /* We have in [temp.param]:
2938 A template-parameter may not be given default arguments
2939 by two different declarations in the same scope. */
2940 error ("redefinition of default argument for `%#D'", parm);
2941 error ("%H original definition appeared here",
2942 &DECL_SOURCE_LOCATION (tmpl_parm));
2946 if (parm_default != NULL_TREE)
2947 /* Update the previous template parameters (which are the ones
2948 that will really count) with the new default value. */
2949 TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms, i)) = parm_default;
2950 else if (tmpl_default != NULL_TREE)
2951 /* Update the new parameters, too; they'll be used as the
2952 parameters for any members. */
2953 TREE_PURPOSE (TREE_VEC_ELT (parms, i)) = tmpl_default;
2957 /* Attempt to convert the non-type template parameter EXPR to the
2958 indicated TYPE. If the conversion is successful, return the
2959 converted value. If the conversion is unsuccessful, return
2960 NULL_TREE if we issued an error message, or error_mark_node if we
2961 did not. We issue error messages for out-and-out bad template
2962 parameters, but not simply because the conversion failed, since we
2963 might be just trying to do argument deduction. By the time this
2964 function is called, neither TYPE nor EXPR may make use of template
2968 convert_nontype_argument (tree type, tree expr)
2970 tree expr_type = TREE_TYPE (expr);
2972 /* A template-argument for a non-type, non-template
2973 template-parameter shall be one of:
2975 --an integral constant-expression of integral or enumeration
2978 --the name of a non-type template-parameter; or
2980 --the name of an object or function with external linkage,
2981 including function templates and function template-ids but
2982 excluding non-static class members, expressed as id-expression;
2985 --the address of an object or function with external linkage,
2986 including function templates and function template-ids but
2987 excluding non-static class members, expressed as & id-expression
2988 where the & is optional if the name refers to a function or
2991 --a pointer to member expressed as described in _expr.unary.op_. */
2993 /* An integral constant-expression can include const variables or
2994 enumerators. Simplify things by folding them to their values,
2995 unless we're about to bind the declaration to a reference
2997 if (INTEGRAL_TYPE_P (expr_type)
2998 && TREE_CODE (type) != REFERENCE_TYPE)
2999 expr = decl_constant_value (expr);
3001 if (is_overloaded_fn (expr))
3002 /* OK for now. We'll check that it has external linkage later.
3003 Check this first since if expr_type is the unknown_type_node
3004 we would otherwise complain below. */
3006 else if (TYPE_PTR_TO_MEMBER_P (expr_type))
3008 if (TREE_CODE (expr) != PTRMEM_CST)
3011 else if (TYPE_PTR_P (expr_type)
3012 || TREE_CODE (expr_type) == ARRAY_TYPE
3013 || TREE_CODE (type) == REFERENCE_TYPE
3014 /* If expr is the address of an overloaded function, we
3015 will get the unknown_type_node at this point. */
3016 || expr_type == unknown_type_node)
3022 if (TREE_CODE (expr_type) == ARRAY_TYPE
3023 || (TREE_CODE (type) == REFERENCE_TYPE
3024 && TREE_CODE (e) != ADDR_EXPR))
3028 if (TREE_CODE (e) != ADDR_EXPR)
3031 error ("`%E' is not a valid template argument", expr);
3032 if (TYPE_PTR_P (expr_type))
3034 if (TREE_CODE (TREE_TYPE (expr_type)) == FUNCTION_TYPE)
3035 error ("it must be the address of a function with external linkage");
3037 error ("it must be the address of an object with external linkage");
3039 else if (TYPE_PTR_TO_MEMBER_P (expr_type))
3040 error ("it must be a pointer-to-member of the form `&X::Y'");
3045 referent = TREE_OPERAND (e, 0);
3046 STRIP_NOPS (referent);
3049 if (TREE_CODE (referent) == STRING_CST)
3051 error ("string literal %E is not a valid template argument because it is the address of an object with static linkage",
3056 if (TREE_CODE (referent) == SCOPE_REF)
3057 referent = TREE_OPERAND (referent, 1);
3059 if (is_overloaded_fn (referent))
3060 /* We'll check that it has external linkage later. */
3062 else if (TREE_CODE (referent) != VAR_DECL)
3064 else if (!DECL_EXTERNAL_LINKAGE_P (referent))
3066 error ("address of non-extern `%E' cannot be used as template argument", referent);
3067 return error_mark_node;
3070 else if (INTEGRAL_TYPE_P (expr_type) || TYPE_PTR_TO_MEMBER_P (expr_type))
3072 if (! TREE_CONSTANT (expr))
3075 error ("non-constant `%E' cannot be used as template argument",
3083 error ("type '%T' cannot be used as a value for a non-type "
3084 "template-parameter", expr);
3085 else if (DECL_P (expr))
3086 error ("invalid use of '%D' as a non-type template-argument", expr);
3088 error ("invalid use of '%E' as a non-type template-argument", expr);
3093 switch (TREE_CODE (type))
3098 /* For a non-type template-parameter of integral or enumeration
3099 type, integral promotions (_conv.prom_) and integral
3100 conversions (_conv.integral_) are applied. */
3101 if (!INTEGRAL_TYPE_P (expr_type))
3102 return error_mark_node;
3104 /* It's safe to call digest_init in this case; we know we're
3105 just converting one integral constant expression to another. */
3106 expr = digest_init (type, expr, (tree*) 0);
3108 if (TREE_CODE (expr) != INTEGER_CST)
3109 /* Curiously, some TREE_CONSTANT integral expressions do not
3110 simplify to integer constants. For example, `3 % 0',
3111 remains a TRUNC_MOD_EXPR. */
3120 /* For a non-type template-parameter of type pointer to data
3121 member, qualification conversions (_conv.qual_) are
3123 e = perform_qualification_conversions (type, expr);
3124 if (TREE_CODE (e) == NOP_EXPR)
3125 /* The call to perform_qualification_conversions will
3126 insert a NOP_EXPR over EXPR to do express conversion,
3127 if necessary. But, that will confuse us if we use
3128 this (converted) template parameter to instantiate
3129 another template; then the thing will not look like a
3130 valid template argument. So, just make a new
3131 constant, of the appropriate type. */
3132 e = make_ptrmem_cst (type, PTRMEM_CST_MEMBER (expr));
3138 tree type_pointed_to = TREE_TYPE (type);
3140 if (TREE_CODE (type_pointed_to) == FUNCTION_TYPE)
3142 /* For a non-type template-parameter of type pointer to
3143 function, only the function-to-pointer conversion
3144 (_conv.func_) is applied. If the template-argument
3145 represents a set of overloaded functions (or a pointer to
3146 such), the matching function is selected from the set
3151 if (TREE_CODE (expr) == ADDR_EXPR)
3152 fns = TREE_OPERAND (expr, 0);
3156 fn = instantiate_type (type_pointed_to, fns, tf_none);
3158 if (fn == error_mark_node)
3159 return error_mark_node;
3161 if (!DECL_EXTERNAL_LINKAGE_P (fn))
3163 if (really_overloaded_fn (fns))
3164 return error_mark_node;
3169 expr = build_unary_op (ADDR_EXPR, fn, 0);
3171 my_friendly_assert (same_type_p (type, TREE_TYPE (expr)),
3177 /* For a non-type template-parameter of type pointer to
3178 object, qualification conversions (_conv.qual_) and the
3179 array-to-pointer conversion (_conv.array_) are applied.
3180 [Note: In particular, neither the null pointer conversion
3181 (_conv.ptr_) nor the derived-to-base conversion
3182 (_conv.ptr_) are applied. Although 0 is a valid
3183 template-argument for a non-type template-parameter of
3184 integral type, it is not a valid template-argument for a
3185 non-type template-parameter of pointer type.]
3187 The call to decay_conversion performs the
3188 array-to-pointer conversion, if appropriate. */
3189 expr = decay_conversion (expr);
3191 if (expr == error_mark_node)
3192 return error_mark_node;
3194 return perform_qualification_conversions (type, expr);
3199 case REFERENCE_TYPE:
3201 tree type_referred_to = TREE_TYPE (type);
3203 /* If this expression already has reference type, get the
3204 underling object. */
3205 if (TREE_CODE (expr_type) == REFERENCE_TYPE)
3207 my_friendly_assert (TREE_CODE (expr) == ADDR_EXPR, 20000604);
3208 expr = TREE_OPERAND (expr, 0);
3209 expr_type = TREE_TYPE (expr);
3212 if (TREE_CODE (type_referred_to) == FUNCTION_TYPE)
3214 /* For a non-type template-parameter of type reference to
3215 function, no conversions apply. If the
3216 template-argument represents a set of overloaded
3217 functions, the matching function is selected from the
3218 set (_over.over_). */
3221 fn = instantiate_type (type_referred_to, expr, tf_none);
3223 if (fn == error_mark_node)
3224 return error_mark_node;
3226 if (!DECL_EXTERNAL_LINKAGE_P (fn))
3228 if (really_overloaded_fn (expr))
3229 /* Don't issue an error here; we might get a different
3230 function if the overloading had worked out
3232 return error_mark_node;
3237 my_friendly_assert (same_type_p (type_referred_to,
3245 /* For a non-type template-parameter of type reference to
3246 object, no conversions apply. The type referred to by the
3247 reference may be more cv-qualified than the (otherwise
3248 identical) type of the template-argument. The
3249 template-parameter is bound directly to the
3250 template-argument, which must be an lvalue. */
3251 if (!same_type_p (TYPE_MAIN_VARIANT (expr_type),
3252 TYPE_MAIN_VARIANT (type_referred_to))
3253 || !at_least_as_qualified_p (type_referred_to,
3255 || !real_lvalue_p (expr))
3256 return error_mark_node;
3259 cxx_mark_addressable (expr);
3260 return build1 (ADDR_EXPR, type, expr);
3266 my_friendly_assert (TYPE_PTRMEMFUNC_P (type), 20010112);
3268 /* For a non-type template-parameter of type pointer to member
3269 function, no conversions apply. If the template-argument
3270 represents a set of overloaded member functions, the
3271 matching member function is selected from the set
3274 if (!TYPE_PTRMEMFUNC_P (expr_type) &&
3275 expr_type != unknown_type_node)
3276 return error_mark_node;
3278 if (TREE_CODE (expr) == PTRMEM_CST)
3280 /* A ptr-to-member constant. */
3281 if (!same_type_p (type, expr_type))
3282 return error_mark_node;
3287 if (TREE_CODE (expr) != ADDR_EXPR)
3288 return error_mark_node;
3290 expr = instantiate_type (type, expr, tf_none);
3292 if (expr == error_mark_node)
3293 return error_mark_node;
3295 my_friendly_assert (same_type_p (type, TREE_TYPE (expr)),
3302 /* All non-type parameters must have one of these types. */
3307 return error_mark_node;
3310 /* Return 1 if PARM_PARMS and ARG_PARMS matches using rule for
3311 template template parameters. Both PARM_PARMS and ARG_PARMS are
3312 vectors of TREE_LIST nodes containing TYPE_DECL, TEMPLATE_DECL
3315 ARG_PARMS may contain more parameters than PARM_PARMS. If this is
3316 the case, then extra parameters must have default arguments.
3318 Consider the example:
3319 template <class T, class Allocator = allocator> class vector;
3320 template<template <class U> class TT> class C;
3322 C<vector> is a valid instantiation. PARM_PARMS for the above code
3323 contains a TYPE_DECL (for U), ARG_PARMS contains two TYPE_DECLs (for
3324 T and Allocator) and OUTER_ARGS contains the argument that is used to
3325 substitute the TT parameter. */
3328 coerce_template_template_parms (tree parm_parms,
3330 tsubst_flags_t complain,
3334 int nparms, nargs, i;
3337 my_friendly_assert (TREE_CODE (parm_parms) == TREE_VEC, 0);
3338 my_friendly_assert (TREE_CODE (arg_parms) == TREE_VEC, 0);
3340 nparms = TREE_VEC_LENGTH (parm_parms);
3341 nargs = TREE_VEC_LENGTH (arg_parms);
3343 /* The rule here is opposite of coerce_template_parms. */
3346 && TREE_PURPOSE (TREE_VEC_ELT (arg_parms, nparms)) == NULL_TREE))
3349 for (i = 0; i < nparms; ++i)
3351 parm = TREE_VALUE (TREE_VEC_ELT (parm_parms, i));
3352 arg = TREE_VALUE (TREE_VEC_ELT (arg_parms, i));
3354 if (arg == NULL_TREE || arg == error_mark_node
3355 || parm == NULL_TREE || parm == error_mark_node)
3358 if (TREE_CODE (arg) != TREE_CODE (parm))
3361 switch (TREE_CODE (parm))
3367 /* We encounter instantiations of templates like
3368 template <template <template <class> class> class TT>
3371 tree parmparm = DECL_INNERMOST_TEMPLATE_PARMS (parm);
3372 tree argparm = DECL_INNERMOST_TEMPLATE_PARMS (arg);
3374 if (!coerce_template_template_parms (parmparm, argparm,
3382 /* The tsubst call is used to handle cases such as
3383 template <class T, template <T> class TT> class D;
3384 i.e. the parameter list of TT depends on earlier parameters. */
3385 if (!same_type_p (tsubst (TREE_TYPE (parm), outer_args,
3398 /* Convert the indicated template ARG as necessary to match the
3399 indicated template PARM. Returns the converted ARG, or
3400 error_mark_node if the conversion was unsuccessful. Error and
3401 warning messages are issued under control of COMPLAIN. This
3402 conversion is for the Ith parameter in the parameter list. ARGS is
3403 the full set of template arguments deduced so far. */
3406 convert_template_argument (tree parm,
3409 tsubst_flags_t complain,
3415 int is_type, requires_type, is_tmpl_type, requires_tmpl_type;
3417 inner_args = INNERMOST_TEMPLATE_ARGS (args);
3419 if (TREE_CODE (arg) == TREE_LIST
3420 && TREE_CODE (TREE_VALUE (arg)) == OFFSET_REF)
3422 /* The template argument was the name of some
3423 member function. That's usually
3424 invalid, but static members are OK. In any
3425 case, grab the underlying fields/functions
3426 and issue an error later if required. */
3427 arg = TREE_VALUE (arg);
3428 TREE_TYPE (arg) = unknown_type_node;
3431 requires_tmpl_type = TREE_CODE (parm) == TEMPLATE_DECL;
3432 requires_type = (TREE_CODE (parm) == TYPE_DECL
3433 || requires_tmpl_type);
3435 if (TREE_CODE (arg) != RECORD_TYPE)
3436 is_tmpl_type = ((TREE_CODE (arg) == TEMPLATE_DECL
3437 && TREE_CODE (DECL_TEMPLATE_RESULT (arg)) == TYPE_DECL)
3438 || TREE_CODE (arg) == TEMPLATE_TEMPLATE_PARM
3439 || TREE_CODE (arg) == UNBOUND_CLASS_TEMPLATE);
3440 else if (CLASSTYPE_TEMPLATE_INFO (arg) && !CLASSTYPE_USE_TEMPLATE (arg)
3441 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (arg)))
3443 if (is_base_of_enclosing_class (arg, current_class_type))
3444 /* This is a template name used within the scope of the
3445 template. It could be the template, or it could be the
3446 instantiation. Choose whichever makes sense. */
3447 is_tmpl_type = requires_tmpl_type;
3452 /* It is a non-template class, or a specialization of a template
3453 class, or a non-template member of a template class. */
3457 && (TREE_CODE (arg) == TEMPLATE_TEMPLATE_PARM
3458 || TREE_CODE (arg) == UNBOUND_CLASS_TEMPLATE))
3459 arg = TYPE_STUB_DECL (arg);
3460 else if (is_tmpl_type && TREE_CODE (arg) == RECORD_TYPE)
3461 arg = CLASSTYPE_TI_TEMPLATE (arg);
3463 is_type = TYPE_P (arg) || is_tmpl_type;
3465 if (requires_type && ! is_type && TREE_CODE (arg) == SCOPE_REF
3466 && TREE_CODE (TREE_OPERAND (arg, 0)) == TEMPLATE_TYPE_PARM)
3468 pedwarn ("to refer to a type member of a template parameter, use `typename %E'", arg);
3470 arg = make_typename_type (TREE_OPERAND (arg, 0),
3471 TREE_OPERAND (arg, 1),
3472 complain & tf_error);
3475 if (is_type != requires_type)
3479 if (complain & tf_error)
3481 error ("type/value mismatch at argument %d in template parameter list for `%D'",
3484 error (" expected a constant of type `%T', got `%T'",
3486 (is_tmpl_type ? DECL_NAME (arg) : arg));
3487 else if (requires_tmpl_type)
3488 error (" expected a class template, got `%E'", arg);
3490 error (" expected a type, got `%E'", arg);
3493 return error_mark_node;
3495 if (is_tmpl_type ^ requires_tmpl_type)
3497 if (in_decl && (complain & tf_error))
3499 error ("type/value mismatch at argument %d in template parameter list for `%D'",
3502 error (" expected a type, got `%T'", DECL_NAME (arg));
3504 error (" expected a class template, got `%T'", arg);
3506 return error_mark_node;
3511 if (requires_tmpl_type)
3513 if (TREE_CODE (TREE_TYPE (arg)) == UNBOUND_CLASS_TEMPLATE)
3514 /* The number of argument required is not known yet.
3515 Just accept it for now. */
3516 val = TREE_TYPE (arg);
3519 tree parmparm = DECL_INNERMOST_TEMPLATE_PARMS (parm);
3520 tree argparm = DECL_INNERMOST_TEMPLATE_PARMS (arg);
3522 if (coerce_template_template_parms (parmparm, argparm,
3528 /* TEMPLATE_TEMPLATE_PARM node is preferred over
3530 if (val != error_mark_node
3531 && DECL_TEMPLATE_TEMPLATE_PARM_P (val))
3532 val = TREE_TYPE (val);
3536 if (in_decl && (complain & tf_error))
3538 error ("type/value mismatch at argument %d in template parameter list for `%D'",
3540 error (" expected a template of type `%D', got `%D'", parm, arg);
3543 val = error_mark_node;
3548 val = groktypename (arg);
3552 tree t = tsubst (TREE_TYPE (parm), args, complain, in_decl);
3554 if (invalid_nontype_parm_type_p (t, complain))
3555 return error_mark_node;
3557 if (!uses_template_parms (arg) && !uses_template_parms (t))
3558 /* We used to call digest_init here. However, digest_init
3559 will report errors, which we don't want when complain
3560 is zero. More importantly, digest_init will try too
3561 hard to convert things: for example, `0' should not be
3562 converted to pointer type at this point according to
3563 the standard. Accepting this is not merely an
3564 extension, since deciding whether or not these
3565 conversions can occur is part of determining which
3566 function template to call, or whether a given explicit
3567 argument specification is valid. */
3568 val = convert_nontype_argument (t, arg);
3572 if (val == NULL_TREE)
3573 val = error_mark_node;
3574 else if (val == error_mark_node && (complain & tf_error))
3575 error ("could not convert template argument `%E' to `%T'",
3582 /* Convert all template arguments to their appropriate types, and
3583 return a vector containing the innermost resulting template
3584 arguments. If any error occurs, return error_mark_node. Error and
3585 warning messages are issued under control of COMPLAIN.
3587 If REQUIRE_ALL_ARGUMENTS is nonzero, all arguments must be
3588 provided in ARGLIST, or else trailing parameters must have default
3589 values. If REQUIRE_ALL_ARGUMENTS is zero, we will attempt argument
3590 deduction for any unspecified trailing arguments. */
3593 coerce_template_parms (tree parms,
3596 tsubst_flags_t complain,
3597 int require_all_arguments)
3599 int nparms, nargs, i, lost = 0;
3602 tree new_inner_args;
3604 inner_args = INNERMOST_TEMPLATE_ARGS (args);
3605 nargs = NUM_TMPL_ARGS (inner_args);
3606 nparms = TREE_VEC_LENGTH (parms);
3610 && require_all_arguments
3611 && TREE_PURPOSE (TREE_VEC_ELT (parms, nargs)) == NULL_TREE))
3613 if (complain & tf_error)
3615 error ("wrong number of template arguments (%d, should be %d)",
3619 cp_error_at ("provided for `%D'", in_decl);
3622 return error_mark_node;
3625 new_inner_args = make_tree_vec (nparms);
3626 new_args = add_outermost_template_args (args, new_inner_args);
3627 for (i = 0; i < nparms; i++)
3632 /* Get the Ith template parameter. */
3633 parm = TREE_VEC_ELT (parms, i);
3635 /* Calculate the Ith argument. */
3636 if (inner_args && TREE_CODE (inner_args) == TREE_LIST)
3638 arg = TREE_VALUE (inner_args);
3639 inner_args = TREE_CHAIN (inner_args);
3642 arg = TREE_VEC_ELT (inner_args, i);
3644 /* If no template argument was supplied, look for a default
3646 arg = tsubst_template_arg (TREE_PURPOSE (parm), new_args,
3649 /* Now, convert the Ith argument, as necessary. */
3650 if (arg == NULL_TREE)
3651 /* We're out of arguments. */
3653 my_friendly_assert (!require_all_arguments, 0);
3656 else if (arg == error_mark_node)
3658 error ("template argument %d is invalid", i + 1);
3659 arg = error_mark_node;
3662 arg = convert_template_argument (TREE_VALUE (parm),
3663 arg, new_args, complain, i,
3666 if (arg == error_mark_node)
3668 TREE_VEC_ELT (new_inner_args, i) = arg;
3672 return error_mark_node;
3674 return new_inner_args;
3677 /* Returns 1 if template args OT and NT are equivalent. */
3680 template_args_equal (tree ot, tree nt)
3685 if (TREE_CODE (nt) == TREE_VEC)
3686 /* For member templates */
3687 return TREE_CODE (ot) == TREE_VEC && comp_template_args (ot, nt);
3688 else if (TYPE_P (nt))
3689 return TYPE_P (ot) && same_type_p (ot, nt);
3690 else if (TREE_CODE (ot) == TREE_VEC || TYPE_P (ot))
3693 return cp_tree_equal (ot, nt);
3696 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets
3697 of template arguments. Returns 0 otherwise. */
3700 comp_template_args (tree oldargs, tree newargs)
3704 if (TREE_VEC_LENGTH (oldargs) != TREE_VEC_LENGTH (newargs))
3707 for (i = 0; i < TREE_VEC_LENGTH (oldargs); ++i)
3709 tree nt = TREE_VEC_ELT (newargs, i);
3710 tree ot = TREE_VEC_ELT (oldargs, i);
3712 if (! template_args_equal (ot, nt))
3718 /* Given class template name and parameter list, produce a user-friendly name
3719 for the instantiation. */
3722 mangle_class_name_for_template (const char* name, tree parms, tree arglist)
3724 static struct obstack scratch_obstack;
3725 static char *scratch_firstobj;
3728 if (!scratch_firstobj)
3729 gcc_obstack_init (&scratch_obstack);
3731 obstack_free (&scratch_obstack, scratch_firstobj);
3732 scratch_firstobj = obstack_alloc (&scratch_obstack, 1);
3734 #define ccat(C) obstack_1grow (&scratch_obstack, (C));
3735 #define cat(S) obstack_grow (&scratch_obstack, (S), strlen (S))
3739 nparms = TREE_VEC_LENGTH (parms);
3740 arglist = INNERMOST_TEMPLATE_ARGS (arglist);
3741 my_friendly_assert (nparms == TREE_VEC_LENGTH (arglist), 268);
3742 for (i = 0; i < nparms; i++)
3744 tree parm = TREE_VALUE (TREE_VEC_ELT (parms, i));
3745 tree arg = TREE_VEC_ELT (arglist, i);
3750 if (TREE_CODE (parm) == TYPE_DECL)
3752 cat (type_as_string (arg, TFF_CHASE_TYPEDEF));
3755 else if (TREE_CODE (parm) == TEMPLATE_DECL)
3757 if (TREE_CODE (arg) == TEMPLATE_DECL)
3759 /* Already substituted with real template. Just output
3760 the template name here */
3761 tree context = DECL_CONTEXT (arg);
3764 /* The template may be defined in a namespace, or
3765 may be a member template. */
3766 my_friendly_assert (TREE_CODE (context) == NAMESPACE_DECL
3767 || CLASS_TYPE_P (context),
3769 cat(decl_as_string (DECL_CONTEXT (arg), TFF_PLAIN_IDENTIFIER));
3772 cat (IDENTIFIER_POINTER (DECL_NAME (arg)));
3775 /* Output the parameter declaration */
3776 cat (type_as_string (arg, TFF_CHASE_TYPEDEF));
3780 my_friendly_assert (TREE_CODE (parm) == PARM_DECL, 269);
3782 if (TREE_CODE (arg) == TREE_LIST)
3784 /* New list cell was built because old chain link was in
3786 my_friendly_assert (TREE_PURPOSE (arg) == NULL_TREE, 270);
3787 arg = TREE_VALUE (arg);
3789 /* No need to check arglist against parmlist here; we did that
3790 in coerce_template_parms, called from lookup_template_class. */
3791 cat (expr_as_string (arg, TFF_PLAIN_IDENTIFIER));
3794 char *bufp = obstack_next_free (&scratch_obstack);
3796 while (bufp[offset - 1] == ' ')
3798 obstack_blank_fast (&scratch_obstack, offset);
3800 /* B<C<char> >, not B<C<char>> */
3801 if (bufp[offset - 1] == '>')
3806 return (char *) obstack_base (&scratch_obstack);
3810 classtype_mangled_name (tree t)
3812 if (CLASSTYPE_TEMPLATE_INFO (t)
3813 /* Specializations have already had their names set up in
3814 lookup_template_class. */
3815 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (t))
3817 tree tmpl = most_general_template (CLASSTYPE_TI_TEMPLATE (t));
3819 /* For non-primary templates, the template parameters are
3820 implicit from their surrounding context. */
3821 if (PRIMARY_TEMPLATE_P (tmpl))
3823 tree name = DECL_NAME (tmpl);
3824 char *mangled_name = mangle_class_name_for_template
3825 (IDENTIFIER_POINTER (name),
3826 DECL_INNERMOST_TEMPLATE_PARMS (tmpl),
3827 CLASSTYPE_TI_ARGS (t));
3828 tree id = get_identifier (mangled_name);
3829 IDENTIFIER_TEMPLATE (id) = name;
3834 return TYPE_IDENTIFIER (t);
3838 add_pending_template (tree d)
3840 tree ti = (TYPE_P (d)
3841 ? CLASSTYPE_TEMPLATE_INFO (d)
3842 : DECL_TEMPLATE_INFO (d));
3846 if (TI_PENDING_TEMPLATE_FLAG (ti))
3849 /* We are called both from instantiate_decl, where we've already had a
3850 tinst_level pushed, and instantiate_template, where we haven't.
3852 level = !(current_tinst_level && TINST_DECL (current_tinst_level) == d);
3855 push_tinst_level (d);
3857 pt = tree_cons (current_tinst_level, d, NULL_TREE);
3858 if (last_pending_template)
3859 TREE_CHAIN (last_pending_template) = pt;
3861 pending_templates = pt;
3863 last_pending_template = pt;
3865 TI_PENDING_TEMPLATE_FLAG (ti) = 1;
3872 /* Return a TEMPLATE_ID_EXPR corresponding to the indicated FNS and
3873 ARGLIST. Valid choices for FNS are given in the cp-tree.def
3874 documentation for TEMPLATE_ID_EXPR. */
3877 lookup_template_function (tree fns, tree arglist)
3881 if (fns == error_mark_node || arglist == error_mark_node)
3882 return error_mark_node;
3884 if (fns == NULL_TREE)
3886 error ("non-template used as template");
3887 return error_mark_node;
3890 my_friendly_assert (TREE_CODE (fns) == TEMPLATE_DECL
3891 || TREE_CODE (fns) == OVERLOAD
3893 || TREE_CODE (fns) == IDENTIFIER_NODE,
3896 if (BASELINK_P (fns))
3898 BASELINK_FUNCTIONS (fns) = build (TEMPLATE_ID_EXPR,
3900 BASELINK_FUNCTIONS (fns),
3905 type = TREE_TYPE (fns);
3906 if (TREE_CODE (fns) == OVERLOAD || !type)
3907 type = unknown_type_node;
3909 return build (TEMPLATE_ID_EXPR, type, fns, arglist);
3912 /* Within the scope of a template class S<T>, the name S gets bound
3913 (in build_self_reference) to a TYPE_DECL for the class, not a
3914 TEMPLATE_DECL. If DECL is a TYPE_DECL for current_class_type,
3915 or one of its enclosing classes, and that type is a template,
3916 return the associated TEMPLATE_DECL. Otherwise, the original
3917 DECL is returned. */
3920 maybe_get_template_decl_from_type_decl (tree decl)
3922 return (decl != NULL_TREE
3923 && TREE_CODE (decl) == TYPE_DECL
3924 && DECL_ARTIFICIAL (decl)
3925 && CLASS_TYPE_P (TREE_TYPE (decl))
3926 && CLASSTYPE_TEMPLATE_INFO (TREE_TYPE (decl)))
3927 ? CLASSTYPE_TI_TEMPLATE (TREE_TYPE (decl)) : decl;
3930 /* Given an IDENTIFIER_NODE (type TEMPLATE_DECL) and a chain of
3931 parameters, find the desired type.
3933 D1 is the PTYPENAME terminal, and ARGLIST is the list of arguments.
3934 (Actually ARGLIST may be either a TREE_LIST or a TREE_VEC. It will
3935 be a TREE_LIST if called directly from the parser, and a TREE_VEC
3938 IN_DECL, if non-NULL, is the template declaration we are trying to
3941 If ENTERING_SCOPE is nonzero, we are about to enter the scope of
3942 the class we are looking up.
3944 Issue error and warning messages under control of COMPLAIN.
3946 If the template class is really a local class in a template
3947 function, then the FUNCTION_CONTEXT is the function in which it is
3948 being instantiated. */
3951 lookup_template_class (tree d1,
3956 tsubst_flags_t complain)
3958 tree template = NULL_TREE, parmlist;
3961 timevar_push (TV_NAME_LOOKUP);
3962 my_friendly_assert ((!arglist || TREE_CODE (arglist) == TREE_LIST)
3963 == ((complain & tf_user) != 0), 20030724);
3965 if (TREE_CODE (d1) == IDENTIFIER_NODE)
3967 if (IDENTIFIER_VALUE (d1)
3968 && DECL_TEMPLATE_TEMPLATE_PARM_P (IDENTIFIER_VALUE (d1)))
3969 template = IDENTIFIER_VALUE (d1);
3973 push_decl_namespace (context);
3974 template = lookup_name (d1, /*prefer_type=*/0);
3975 template = maybe_get_template_decl_from_type_decl (template);
3977 pop_decl_namespace ();
3980 context = DECL_CONTEXT (template);
3982 else if (TREE_CODE (d1) == TYPE_DECL && IS_AGGR_TYPE (TREE_TYPE (d1)))
3984 tree type = TREE_TYPE (d1);
3986 /* If we are declaring a constructor, say A<T>::A<T>, we will get
3987 an implicit typename for the second A. Deal with it. */
3988 if (TREE_CODE (type) == TYPENAME_TYPE && TREE_TYPE (type))
3989 type = TREE_TYPE (type);
3991 if (CLASSTYPE_TEMPLATE_INFO (type))
3993 template = CLASSTYPE_TI_TEMPLATE (type);
3994 d1 = DECL_NAME (template);
3997 else if (TREE_CODE (d1) == ENUMERAL_TYPE
3998 || (TYPE_P (d1) && IS_AGGR_TYPE (d1)))
4000 template = TYPE_TI_TEMPLATE (d1);
4001 d1 = DECL_NAME (template);
4003 else if (TREE_CODE (d1) == TEMPLATE_DECL
4004 && TREE_CODE (DECL_TEMPLATE_RESULT (d1)) == TYPE_DECL)
4007 d1 = DECL_NAME (template);
4008 context = DECL_CONTEXT (template);
4011 /* With something like `template <class T> class X class X { ... };'
4012 we could end up with D1 having nothing but an IDENTIFIER_VALUE.
4013 We don't want to do that, but we have to deal with the situation,
4014 so let's give them some syntax errors to chew on instead of a
4015 crash. Alternatively D1 might not be a template type at all. */
4018 if (complain & tf_error)
4019 error ("`%T' is not a template", d1);
4020 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node);
4023 if (TREE_CODE (template) != TEMPLATE_DECL
4024 /* Make sure it's a user visible template, if it was named by
4026 || ((complain & tf_user) && !DECL_TEMPLATE_PARM_P (template)
4027 && !PRIMARY_TEMPLATE_P (template)))
4029 if (complain & tf_error)
4031 error ("non-template type `%T' used as a template", d1);
4033 cp_error_at ("for template declaration `%D'", in_decl);
4035 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node);
4038 complain &= ~tf_user;
4040 if (DECL_TEMPLATE_TEMPLATE_PARM_P (template))
4042 /* Create a new TEMPLATE_DECL and TEMPLATE_TEMPLATE_PARM node to store
4043 template arguments */
4048 parmlist = DECL_INNERMOST_TEMPLATE_PARMS (template);
4050 /* Consider an example where a template template parameter declared as
4052 template <class T, class U = std::allocator<T> > class TT
4054 The template parameter level of T and U are one level larger than
4055 of TT. To proper process the default argument of U, say when an
4056 instantiation `TT<int>' is seen, we need to build the full
4057 arguments containing {int} as the innermost level. Outer levels,
4058 available when not appearing as default template argument, can be
4059 obtained from `current_template_args ()'.
4061 Suppose that TT is later substituted with std::vector. The above
4062 instantiation is `TT<int, std::allocator<T> >' with TT at
4063 level 1, and T at level 2, while the template arguments at level 1
4064 becomes {std::vector} and the inner level 2 is {int}. */
4066 if (current_template_parms)
4067 arglist = add_to_template_args (current_template_args (), arglist);
4069 arglist2 = coerce_template_parms (parmlist, arglist, template,
4070 complain, /*require_all_args=*/1);
4071 if (arglist2 == error_mark_node
4072 || (!uses_template_parms (arglist2)
4073 && check_instantiated_args (template, arglist2, complain)))
4074 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node);
4076 parm = bind_template_template_parm (TREE_TYPE (template), arglist2);
4077 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, parm);
4081 tree template_type = TREE_TYPE (template);
4084 tree found = NULL_TREE;
4088 int is_partial_instantiation;
4090 gen_tmpl = most_general_template (template);
4091 parmlist = DECL_TEMPLATE_PARMS (gen_tmpl);
4092 parm_depth = TMPL_PARMS_DEPTH (parmlist);
4093 arg_depth = TMPL_ARGS_DEPTH (arglist);
4095 if (arg_depth == 1 && parm_depth > 1)
4097 /* We've been given an incomplete set of template arguments.
4100 template <class T> struct S1 {
4101 template <class U> struct S2 {};
4102 template <class U> struct S2<U*> {};
4105 we will be called with an ARGLIST of `U*', but the
4106 TEMPLATE will be `template <class T> template
4107 <class U> struct S1<T>::S2'. We must fill in the missing
4110 = add_outermost_template_args (TYPE_TI_ARGS (TREE_TYPE (template)),
4112 arg_depth = TMPL_ARGS_DEPTH (arglist);
4115 /* Now we should have enough arguments. */
4116 my_friendly_assert (parm_depth == arg_depth, 0);
4118 /* From here on, we're only interested in the most general
4120 template = gen_tmpl;
4122 /* Calculate the BOUND_ARGS. These will be the args that are
4123 actually tsubst'd into the definition to create the
4127 /* We have multiple levels of arguments to coerce, at once. */
4129 int saved_depth = TMPL_ARGS_DEPTH (arglist);
4131 tree bound_args = make_tree_vec (parm_depth);
4133 for (i = saved_depth,
4134 t = DECL_TEMPLATE_PARMS (template);
4135 i > 0 && t != NULL_TREE;
4136 --i, t = TREE_CHAIN (t))
4138 tree a = coerce_template_parms (TREE_VALUE (t),
4140 complain, /*require_all_args=*/1);
4142 /* Don't process further if one of the levels fails. */
4143 if (a == error_mark_node)
4145 /* Restore the ARGLIST to its full size. */
4146 TREE_VEC_LENGTH (arglist) = saved_depth;
4147 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node);
4150 SET_TMPL_ARGS_LEVEL (bound_args, i, a);
4152 /* We temporarily reduce the length of the ARGLIST so
4153 that coerce_template_parms will see only the arguments
4154 corresponding to the template parameters it is
4156 TREE_VEC_LENGTH (arglist)--;
4159 /* Restore the ARGLIST to its full size. */
4160 TREE_VEC_LENGTH (arglist) = saved_depth;
4162 arglist = bound_args;
4166 = coerce_template_parms (INNERMOST_TEMPLATE_PARMS (parmlist),
4167 INNERMOST_TEMPLATE_ARGS (arglist),
4169 complain, /*require_all_args=*/1);
4171 if (arglist == error_mark_node
4172 || (!uses_template_parms (INNERMOST_TEMPLATE_ARGS (arglist))
4173 && check_instantiated_args (template,
4174 INNERMOST_TEMPLATE_ARGS (arglist),
4176 /* We were unable to bind the arguments. */
4177 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node);
4179 /* In the scope of a template class, explicit references to the
4180 template class refer to the type of the template, not any
4181 instantiation of it. For example, in:
4183 template <class T> class C { void f(C<T>); }
4185 the `C<T>' is just the same as `C'. Outside of the
4186 class, however, such a reference is an instantiation. */
4187 if (comp_template_args (TYPE_TI_ARGS (template_type),
4190 found = template_type;
4192 if (!entering_scope && PRIMARY_TEMPLATE_P (template))
4196 for (ctx = current_class_type;
4198 ctx = TYPE_CONTEXT (ctx))
4200 if (TREE_CODE (ctx) == NAMESPACE_DECL)
4202 if (same_type_p (ctx, template_type))
4206 /* We're not in the scope of the class, so the
4207 TEMPLATE_TYPE is not the type we want after all. */
4213 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, found);
4215 for (tp = &DECL_TEMPLATE_INSTANTIATIONS (template);
4217 tp = &TREE_CHAIN (*tp))
4218 if (comp_template_args (TREE_PURPOSE (*tp), arglist))
4222 /* Use the move-to-front heuristic to speed up future
4224 *tp = TREE_CHAIN (*tp);
4226 = DECL_TEMPLATE_INSTANTIATIONS (template);
4227 DECL_TEMPLATE_INSTANTIATIONS (template) = found;
4229 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, TREE_VALUE (found));
4232 /* This type is a "partial instantiation" if any of the template
4233 arguments still involve template parameters. Note that we set
4234 IS_PARTIAL_INSTANTIATION for partial specializations as
4236 is_partial_instantiation = uses_template_parms (arglist);
4238 if (!is_partial_instantiation
4239 && !PRIMARY_TEMPLATE_P (template)
4240 && TREE_CODE (CP_DECL_CONTEXT (template)) == NAMESPACE_DECL)
4242 found = xref_tag_from_type (TREE_TYPE (template),
4243 DECL_NAME (template),
4245 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, found);
4248 context = tsubst (DECL_CONTEXT (template), arglist,
4251 context = global_namespace;
4253 /* Create the type. */
4254 if (TREE_CODE (template_type) == ENUMERAL_TYPE)
4256 if (!is_partial_instantiation)
4258 set_current_access_from_decl (TYPE_NAME (template_type));
4259 t = start_enum (TYPE_IDENTIFIER (template_type));
4262 /* We don't want to call start_enum for this type, since
4263 the values for the enumeration constants may involve
4264 template parameters. And, no one should be interested
4265 in the enumeration constants for such a type. */
4266 t = make_node (ENUMERAL_TYPE);
4270 t = make_aggr_type (TREE_CODE (template_type));
4271 CLASSTYPE_DECLARED_CLASS (t)
4272 = CLASSTYPE_DECLARED_CLASS (template_type);
4273 CLASSTYPE_GOT_SEMICOLON (t) = 1;
4274 SET_CLASSTYPE_IMPLICIT_INSTANTIATION (t);
4275 TYPE_FOR_JAVA (t) = TYPE_FOR_JAVA (template_type);
4277 /* A local class. Make sure the decl gets registered properly. */
4278 if (context == current_function_decl)
4279 pushtag (DECL_NAME (template), t, 0);
4282 /* If we called start_enum or pushtag above, this information
4283 will already be set up. */
4286 TYPE_CONTEXT (t) = FROB_CONTEXT (context);
4288 type_decl = create_implicit_typedef (DECL_NAME (template), t);
4289 DECL_CONTEXT (type_decl) = TYPE_CONTEXT (t);
4290 TYPE_STUB_DECL (t) = type_decl;
4291 DECL_SOURCE_LOCATION (type_decl)
4292 = DECL_SOURCE_LOCATION (TYPE_STUB_DECL (template_type));
4295 type_decl = TYPE_NAME (t);
4297 TREE_PRIVATE (type_decl)
4298 = TREE_PRIVATE (TYPE_STUB_DECL (template_type));
4299 TREE_PROTECTED (type_decl)
4300 = TREE_PROTECTED (TYPE_STUB_DECL (template_type));
4302 /* Set up the template information. We have to figure out which
4303 template is the immediate parent if this is a full
4305 if (parm_depth == 1 || is_partial_instantiation
4306 || !PRIMARY_TEMPLATE_P (template))
4307 /* This case is easy; there are no member templates involved. */
4311 /* This is a full instantiation of a member template. Look
4312 for a partial instantiation of which this is an instance. */
4314 for (found = DECL_TEMPLATE_INSTANTIATIONS (template);
4315 found; found = TREE_CHAIN (found))
4318 tree tmpl = CLASSTYPE_TI_TEMPLATE (TREE_VALUE (found));
4320 /* We only want partial instantiations, here, not
4321 specializations or full instantiations. */
4322 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_VALUE (found))
4323 || !uses_template_parms (TREE_VALUE (found)))
4326 /* Temporarily reduce by one the number of levels in the
4327 ARGLIST and in FOUND so as to avoid comparing the
4328 last set of arguments. */
4329 TREE_VEC_LENGTH (arglist)--;
4330 TREE_VEC_LENGTH (TREE_PURPOSE (found)) --;
4332 /* See if the arguments match. If they do, then TMPL is
4333 the partial instantiation we want. */
4334 success = comp_template_args (TREE_PURPOSE (found), arglist);
4336 /* Restore the argument vectors to their full size. */
4337 TREE_VEC_LENGTH (arglist)++;
4338 TREE_VEC_LENGTH (TREE_PURPOSE (found))++;
4349 /* There was no partial instantiation. This happens
4350 where C<T> is a member template of A<T> and it's used
4353 template <typename T> struct B { A<T>::C<int> m; };
4356 Create the partial instantiation.
4358 TREE_VEC_LENGTH (arglist)--;
4359 found = tsubst (template, arglist, complain, NULL_TREE);
4360 TREE_VEC_LENGTH (arglist)++;
4364 SET_TYPE_TEMPLATE_INFO (t, tree_cons (found, arglist, NULL_TREE));
4365 DECL_TEMPLATE_INSTANTIATIONS (template)
4366 = tree_cons (arglist, t,
4367 DECL_TEMPLATE_INSTANTIATIONS (template));
4369 if (TREE_CODE (t) == ENUMERAL_TYPE
4370 && !is_partial_instantiation)
4371 /* Now that the type has been registered on the instantiations
4372 list, we set up the enumerators. Because the enumeration
4373 constants may involve the enumeration type itself, we make
4374 sure to register the type first, and then create the
4375 constants. That way, doing tsubst_expr for the enumeration
4376 constants won't result in recursive calls here; we'll find
4377 the instantiation and exit above. */
4378 tsubst_enum (template_type, t, arglist);
4380 /* Reset the name of the type, now that CLASSTYPE_TEMPLATE_INFO
4382 if (TREE_CODE (t) != ENUMERAL_TYPE)
4383 DECL_NAME (type_decl) = classtype_mangled_name (t);
4384 if (!is_partial_instantiation)
4386 /* For backwards compatibility; code that uses
4387 -fexternal-templates expects looking up a template to
4388 instantiate it. I think DDD still relies on this.
4389 (jason 8/20/1998) */
4390 if (TREE_CODE (t) != ENUMERAL_TYPE
4391 && flag_external_templates
4392 && CLASSTYPE_INTERFACE_KNOWN (TREE_TYPE (template))
4393 && ! CLASSTYPE_INTERFACE_ONLY (TREE_TYPE (template)))
4394 add_pending_template (t);
4397 /* If the type makes use of template parameters, the
4398 code that generates debugging information will crash. */
4399 DECL_IGNORED_P (TYPE_STUB_DECL (t)) = 1;
4401 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, t);
4403 timevar_pop (TV_NAME_LOOKUP);
4413 /* Called from for_each_template_parm via walk_tree. */
4416 for_each_template_parm_r (tree* tp, int* walk_subtrees, void* d)
4419 struct pair_fn_data *pfd = (struct pair_fn_data *) d;
4420 tree_fn_t fn = pfd->fn;
4421 void *data = pfd->data;
4424 /* If we have already visited this tree, there's no need to walk
4425 subtrees. Otherwise, add it to the visited table. */
4426 slot = htab_find_slot (pfd->visited, *tp, INSERT);
4435 && for_each_template_parm (TYPE_CONTEXT (t), fn, data, pfd->visited))
4436 return error_mark_node;
4438 switch (TREE_CODE (t))
4441 if (TYPE_PTRMEMFUNC_P (t))
4447 if (!TYPE_TEMPLATE_INFO (t))
4449 else if (for_each_template_parm (TREE_VALUE (TYPE_TEMPLATE_INFO (t)),
4450 fn, data, pfd->visited))
4451 return error_mark_node;
4455 /* Since we're not going to walk subtrees, we have to do this
4457 if (for_each_template_parm (TYPE_METHOD_BASETYPE (t), fn, data,
4459 return error_mark_node;
4463 /* Check the return type. */
4464 if (for_each_template_parm (TREE_TYPE (t), fn, data, pfd->visited))
4465 return error_mark_node;
4467 /* Check the parameter types. Since default arguments are not
4468 instantiated until they are needed, the TYPE_ARG_TYPES may
4469 contain expressions that involve template parameters. But,
4470 no-one should be looking at them yet. And, once they're
4471 instantiated, they don't contain template parameters, so
4472 there's no point in looking at them then, either. */
4476 for (parm = TYPE_ARG_TYPES (t); parm; parm = TREE_CHAIN (parm))
4477 if (for_each_template_parm (TREE_VALUE (parm), fn, data,
4479 return error_mark_node;
4481 /* Since we've already handled the TYPE_ARG_TYPES, we don't
4482 want walk_tree walking into them itself. */
4488 if (for_each_template_parm (TYPE_FIELDS (t), fn, data,
4490 return error_mark_node;
4495 if (DECL_LANG_SPECIFIC (t) && DECL_TEMPLATE_INFO (t)
4496 && for_each_template_parm (DECL_TI_ARGS (t), fn, data,
4498 return error_mark_node;
4503 if (TREE_CODE (t) == CONST_DECL && DECL_TEMPLATE_PARM_P (t)
4504 && for_each_template_parm (DECL_INITIAL (t), fn, data,
4506 return error_mark_node;
4507 if (DECL_CONTEXT (t)
4508 && for_each_template_parm (DECL_CONTEXT (t), fn, data,
4510 return error_mark_node;
4513 case BOUND_TEMPLATE_TEMPLATE_PARM:
4514 /* Record template parameters such as `T' inside `TT<T>'. */
4515 if (for_each_template_parm (TYPE_TI_ARGS (t), fn, data, pfd->visited))
4516 return error_mark_node;
4519 case TEMPLATE_TEMPLATE_PARM:
4520 case TEMPLATE_TYPE_PARM:
4521 case TEMPLATE_PARM_INDEX:
4522 if (fn && (*fn)(t, data))
4523 return error_mark_node;
4525 return error_mark_node;
4529 /* A template template parameter is encountered */
4530 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t)
4531 && for_each_template_parm (TREE_TYPE (t), fn, data, pfd->visited))
4532 return error_mark_node;
4534 /* Already substituted template template parameter */
4540 || for_each_template_parm (TYPENAME_TYPE_FULLNAME (t), fn,
4541 data, pfd->visited))
4542 return error_mark_node;
4546 if (TREE_TYPE (t) && TYPE_PTRMEMFUNC_P (TREE_TYPE (t))
4547 && for_each_template_parm (TYPE_PTRMEMFUNC_FN_TYPE
4548 (TREE_TYPE (t)), fn, data,
4550 return error_mark_node;
4555 /* If there's no type, then this thing must be some expression
4556 involving template parameters. */
4557 if (!fn && !TREE_TYPE (t))
4558 return error_mark_node;
4563 case REINTERPRET_CAST_EXPR:
4564 case CONST_CAST_EXPR:
4565 case STATIC_CAST_EXPR:
4566 case DYNAMIC_CAST_EXPR:
4570 case PSEUDO_DTOR_EXPR:
4572 return error_mark_node;
4576 /* If we do not handle this case specially, we end up walking
4577 the BINFO hierarchy, which is circular, and therefore
4578 confuses walk_tree. */
4580 if (for_each_template_parm (BASELINK_FUNCTIONS (*tp), fn, data,
4582 return error_mark_node;
4589 /* We didn't find any template parameters we liked. */
4593 /* For each TEMPLATE_TYPE_PARM, TEMPLATE_TEMPLATE_PARM,
4594 BOUND_TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX in T,
4595 call FN with the parameter and the DATA.
4596 If FN returns nonzero, the iteration is terminated, and
4597 for_each_template_parm returns 1. Otherwise, the iteration
4598 continues. If FN never returns a nonzero value, the value
4599 returned by for_each_template_parm is 0. If FN is NULL, it is
4600 considered to be the function which always returns 1. */
4603 for_each_template_parm (tree t, tree_fn_t fn, void* data, htab_t visited)
4605 struct pair_fn_data pfd;
4612 /* Walk the tree. (Conceptually, we would like to walk without
4613 duplicates, but for_each_template_parm_r recursively calls
4614 for_each_template_parm, so we would need to reorganize a fair
4615 bit to use walk_tree_without_duplicates, so we keep our own
4618 pfd.visited = visited;
4620 pfd.visited = htab_create (37, htab_hash_pointer, htab_eq_pointer,
4622 result = walk_tree (&t,
4623 for_each_template_parm_r,
4629 htab_delete (pfd.visited);
4635 uses_template_parms (tree t)
4637 return for_each_template_parm (t, 0, 0, NULL);
4640 static int tinst_depth;
4641 extern int max_tinst_depth;
4642 #ifdef GATHER_STATISTICS
4645 static int tinst_level_tick;
4646 static int last_template_error_tick;
4648 /* We're starting to instantiate D; record the template instantiation context
4649 for diagnostics and to restore it later. */
4652 push_tinst_level (tree d)
4656 if (tinst_depth >= max_tinst_depth)
4658 /* If the instantiation in question still has unbound template parms,
4659 we don't really care if we can't instantiate it, so just return.
4660 This happens with base instantiation for implicit `typename'. */
4661 if (uses_template_parms (d))
4664 last_template_error_tick = tinst_level_tick;
4665 error ("template instantiation depth exceeds maximum of %d (use -ftemplate-depth-NN to increase the maximum) instantiating `%D'",
4666 max_tinst_depth, d);
4668 print_instantiation_context ();
4673 new = build_expr_wfl (d, input_filename, input_line, 0);
4674 TREE_CHAIN (new) = current_tinst_level;
4675 current_tinst_level = new;
4678 #ifdef GATHER_STATISTICS
4679 if (tinst_depth > depth_reached)
4680 depth_reached = tinst_depth;
4687 /* We're done instantiating this template; return to the instantiation
4691 pop_tinst_level (void)
4693 tree old = current_tinst_level;
4695 /* Restore the filename and line number stashed away when we started
4696 this instantiation. */
4697 input_line = TINST_LINE (old);
4698 input_filename = TINST_FILE (old);
4699 extract_interface_info ();
4701 current_tinst_level = TREE_CHAIN (old);
4706 /* We're instantiating a deferred template; restore the template
4707 instantiation context in which the instantiation was requested, which
4708 is one step out from LEVEL. */
4711 reopen_tinst_level (tree level)
4716 for (t = level; t; t = TREE_CHAIN (t))
4719 current_tinst_level = level;
4723 /* Return the outermost template instantiation context, for use with
4724 -falt-external-templates. */
4727 tinst_for_decl (void)
4729 tree p = current_tinst_level;
4732 for (; TREE_CHAIN (p) ; p = TREE_CHAIN (p))
4737 /* DECL is a friend FUNCTION_DECL or TEMPLATE_DECL. ARGS is the
4738 vector of template arguments, as for tsubst.
4740 Returns an appropriate tsubst'd friend declaration. */
4743 tsubst_friend_function (tree decl, tree args)
4746 location_t saved_loc = input_location;
4748 input_location = DECL_SOURCE_LOCATION (decl);
4750 if (TREE_CODE (decl) == FUNCTION_DECL
4751 && DECL_TEMPLATE_INSTANTIATION (decl)
4752 && TREE_CODE (DECL_TI_TEMPLATE (decl)) != TEMPLATE_DECL)
4753 /* This was a friend declared with an explicit template
4754 argument list, e.g.:
4758 to indicate that f was a template instantiation, not a new
4759 function declaration. Now, we have to figure out what
4760 instantiation of what template. */
4762 tree template_id, arglist, fns;
4765 tree ns = decl_namespace_context (TYPE_MAIN_DECL (current_class_type));
4767 /* Friend functions are looked up in the containing namespace scope.
4768 We must enter that scope, to avoid finding member functions of the
4769 current cless with same name. */
4770 push_nested_namespace (ns);
4771 fns = tsubst_expr (DECL_TI_TEMPLATE (decl), args,
4772 tf_error | tf_warning, NULL_TREE);
4773 pop_nested_namespace (ns);
4774 arglist = tsubst (DECL_TI_ARGS (decl), args,
4775 tf_error | tf_warning, NULL_TREE);
4776 template_id = lookup_template_function (fns, arglist);
4778 new_friend = tsubst (decl, args, tf_error | tf_warning, NULL_TREE);
4779 tmpl = determine_specialization (template_id, new_friend,
4781 /*need_member_template=*/0);
4782 new_friend = instantiate_template (tmpl, new_args, tf_error);
4786 new_friend = tsubst (decl, args, tf_error | tf_warning, NULL_TREE);
4788 /* The NEW_FRIEND will look like an instantiation, to the
4789 compiler, but is not an instantiation from the point of view of
4790 the language. For example, we might have had:
4792 template <class T> struct S {
4793 template <class U> friend void f(T, U);
4796 Then, in S<int>, template <class U> void f(int, U) is not an
4797 instantiation of anything. */
4798 DECL_USE_TEMPLATE (new_friend) = 0;
4799 if (TREE_CODE (decl) == TEMPLATE_DECL)
4801 DECL_USE_TEMPLATE (DECL_TEMPLATE_RESULT (new_friend)) = 0;
4802 DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (new_friend))
4803 = DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (decl));
4806 /* The mangled name for the NEW_FRIEND is incorrect. The function
4807 is not a template instantiation and should not be mangled like
4808 one. Therefore, we forget the mangling here; we'll recompute it
4809 later if we need it. */
4810 if (TREE_CODE (new_friend) != TEMPLATE_DECL)
4812 SET_DECL_RTL (new_friend, NULL_RTX);
4813 SET_DECL_ASSEMBLER_NAME (new_friend, NULL_TREE);
4816 if (DECL_NAMESPACE_SCOPE_P (new_friend))
4819 tree new_friend_template_info;
4820 tree new_friend_result_template_info;
4822 int new_friend_is_defn;
4824 /* We must save some information from NEW_FRIEND before calling
4825 duplicate decls since that function will free NEW_FRIEND if
4827 new_friend_template_info = DECL_TEMPLATE_INFO (new_friend);
4828 if (TREE_CODE (new_friend) == TEMPLATE_DECL)
4830 /* This declaration is a `primary' template. */
4831 DECL_PRIMARY_TEMPLATE (new_friend) = new_friend;
4834 = DECL_INITIAL (DECL_TEMPLATE_RESULT (new_friend)) != NULL_TREE;
4835 new_friend_result_template_info
4836 = DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (new_friend));
4840 new_friend_is_defn = DECL_INITIAL (new_friend) != NULL_TREE;
4841 new_friend_result_template_info = NULL_TREE;
4844 /* Inside pushdecl_namespace_level, we will push into the
4845 current namespace. However, the friend function should go
4846 into the namespace of the template. */
4847 ns = decl_namespace_context (new_friend);
4848 push_nested_namespace (ns);
4849 old_decl = pushdecl_namespace_level (new_friend);
4850 pop_nested_namespace (ns);
4852 if (old_decl != new_friend)
4854 /* This new friend declaration matched an existing
4855 declaration. For example, given:
4857 template <class T> void f(T);
4858 template <class U> class C {
4859 template <class T> friend void f(T) {}
4862 the friend declaration actually provides the definition
4863 of `f', once C has been instantiated for some type. So,
4864 old_decl will be the out-of-class template declaration,
4865 while new_friend is the in-class definition.
4867 But, if `f' was called before this point, the
4868 instantiation of `f' will have DECL_TI_ARGS corresponding
4869 to `T' but not to `U', references to which might appear
4870 in the definition of `f'. Previously, the most general
4871 template for an instantiation of `f' was the out-of-class
4872 version; now it is the in-class version. Therefore, we
4873 run through all specialization of `f', adding to their
4874 DECL_TI_ARGS appropriately. In particular, they need a
4875 new set of outer arguments, corresponding to the
4876 arguments for this class instantiation.
4878 The same situation can arise with something like this:
4881 template <class T> class C {
4885 when `C<int>' is instantiated. Now, `f(int)' is defined
4888 if (!new_friend_is_defn)
4889 /* On the other hand, if the in-class declaration does
4890 *not* provide a definition, then we don't want to alter
4891 existing definitions. We can just leave everything
4896 /* Overwrite whatever template info was there before, if
4897 any, with the new template information pertaining to
4899 DECL_TEMPLATE_INFO (old_decl) = new_friend_template_info;
4901 if (TREE_CODE (old_decl) != TEMPLATE_DECL)
4902 reregister_specialization (new_friend,
4903 most_general_template (old_decl),
4908 tree new_friend_args;
4910 DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (old_decl))
4911 = new_friend_result_template_info;
4913 new_friend_args = TI_ARGS (new_friend_template_info);
4914 for (t = DECL_TEMPLATE_SPECIALIZATIONS (old_decl);
4918 tree spec = TREE_VALUE (t);
4921 = add_outermost_template_args (new_friend_args,
4922 DECL_TI_ARGS (spec));
4925 /* Now, since specializations are always supposed to
4926 hang off of the most general template, we must move
4928 t = most_general_template (old_decl);
4931 DECL_TEMPLATE_SPECIALIZATIONS (t)
4932 = chainon (DECL_TEMPLATE_SPECIALIZATIONS (t),
4933 DECL_TEMPLATE_SPECIALIZATIONS (old_decl));
4934 DECL_TEMPLATE_SPECIALIZATIONS (old_decl) = NULL_TREE;
4939 /* The information from NEW_FRIEND has been merged into OLD_DECL
4940 by duplicate_decls. */
4941 new_friend = old_decl;
4944 else if (COMPLETE_TYPE_P (DECL_CONTEXT (new_friend)))
4946 /* Check to see that the declaration is really present, and,
4947 possibly obtain an improved declaration. */
4948 tree fn = check_classfn (DECL_CONTEXT (new_friend),
4956 input_location = saved_loc;
4960 /* FRIEND_TMPL is a friend TEMPLATE_DECL. ARGS is the vector of
4961 template arguments, as for tsubst.
4963 Returns an appropriate tsubst'd friend type or error_mark_node on
4967 tsubst_friend_class (tree friend_tmpl, tree args)
4973 context = DECL_CONTEXT (friend_tmpl);
4977 if (TREE_CODE (context) == NAMESPACE_DECL)
4978 push_nested_namespace (context);
4980 push_nested_class (tsubst (context, args, tf_none, NULL_TREE));
4983 /* First, we look for a class template. */
4984 tmpl = lookup_name (DECL_NAME (friend_tmpl), /*prefer_type=*/0);
4986 /* But, if we don't find one, it might be because we're in a
4987 situation like this:
4995 Here, in the scope of (say) S<int>, `S' is bound to a TYPE_DECL
4996 for `S<int>', not the TEMPLATE_DECL. */
4997 if (!tmpl || !DECL_CLASS_TEMPLATE_P (tmpl))
4999 tmpl = lookup_name (DECL_NAME (friend_tmpl), /*prefer_type=*/1);
5000 tmpl = maybe_get_template_decl_from_type_decl (tmpl);
5003 if (tmpl && DECL_CLASS_TEMPLATE_P (tmpl))
5005 /* The friend template has already been declared. Just
5006 check to see that the declarations match, and install any new
5007 default parameters. We must tsubst the default parameters,
5008 of course. We only need the innermost template parameters
5009 because that is all that redeclare_class_template will look
5011 if (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (friend_tmpl))
5012 > TMPL_ARGS_DEPTH (args))
5015 parms = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_tmpl),
5016 args, tf_error | tf_warning);
5017 redeclare_class_template (TREE_TYPE (tmpl), parms);
5020 friend_type = TREE_TYPE (tmpl);
5024 /* The friend template has not already been declared. In this
5025 case, the instantiation of the template class will cause the
5026 injection of this template into the global scope. */
5027 tmpl = tsubst (friend_tmpl, args, tf_error | tf_warning, NULL_TREE);
5029 /* The new TMPL is not an instantiation of anything, so we
5030 forget its origins. We don't reset CLASSTYPE_TI_TEMPLATE for
5031 the new type because that is supposed to be the corresponding
5032 template decl, i.e., TMPL. */
5033 DECL_USE_TEMPLATE (tmpl) = 0;
5034 DECL_TEMPLATE_INFO (tmpl) = NULL_TREE;
5035 CLASSTYPE_USE_TEMPLATE (TREE_TYPE (tmpl)) = 0;
5037 /* Inject this template into the global scope. */
5038 friend_type = TREE_TYPE (pushdecl_top_level (tmpl));
5043 if (TREE_CODE (context) == NAMESPACE_DECL)
5044 pop_nested_namespace (context);
5046 pop_nested_class ();
5052 /* Returns zero if TYPE cannot be completed later due to circularity.
5053 Otherwise returns one. */
5056 can_complete_type_without_circularity (tree type)
5058 if (type == NULL_TREE || type == error_mark_node)
5060 else if (COMPLETE_TYPE_P (type))
5062 else if (TREE_CODE (type) == ARRAY_TYPE && TYPE_DOMAIN (type))
5063 return can_complete_type_without_circularity (TREE_TYPE (type));
5064 else if (CLASS_TYPE_P (type) && TYPE_BEING_DEFINED (TYPE_MAIN_VARIANT (type)))
5071 instantiate_class_template (tree type)
5073 tree template, args, pattern, t, member;
5077 if (type == error_mark_node)
5078 return error_mark_node;
5080 if (TYPE_BEING_DEFINED (type)
5081 || COMPLETE_TYPE_P (type)
5082 || dependent_type_p (type))
5085 /* Figure out which template is being instantiated. */
5086 template = most_general_template (CLASSTYPE_TI_TEMPLATE (type));
5087 my_friendly_assert (TREE_CODE (template) == TEMPLATE_DECL, 279);
5089 /* Figure out which arguments are being used to do the
5091 args = CLASSTYPE_TI_ARGS (type);
5093 /* Determine what specialization of the original template to
5095 t = most_specialized_class (template, args);
5096 if (t == error_mark_node)
5098 const char *str = "candidates are:";
5099 error ("ambiguous class template instantiation for `%#T'", type);
5100 for (t = DECL_TEMPLATE_SPECIALIZATIONS (template); t;
5103 if (get_class_bindings (TREE_VALUE (t), TREE_PURPOSE (t),
5106 cp_error_at ("%s %+#T", str, TREE_TYPE (t));
5110 TYPE_BEING_DEFINED (type) = 1;
5111 return error_mark_node;
5115 pattern = TREE_TYPE (t);
5117 pattern = TREE_TYPE (template);
5119 /* If the template we're instantiating is incomplete, then clearly
5120 there's nothing we can do. */
5121 if (!COMPLETE_TYPE_P (pattern))
5124 /* If we've recursively instantiated too many templates, stop. */
5125 if (! push_tinst_level (type))
5128 /* Now we're really doing the instantiation. Mark the type as in
5129 the process of being defined. */
5130 TYPE_BEING_DEFINED (type) = 1;
5132 /* We may be in the middle of deferred access check. Disable
5134 push_deferring_access_checks (dk_no_deferred);
5136 maybe_push_to_top_level (uses_template_parms (type));
5140 /* This TYPE is actually an instantiation of a partial
5141 specialization. We replace the innermost set of ARGS with
5142 the arguments appropriate for substitution. For example,
5145 template <class T> struct S {};
5146 template <class T> struct S<T*> {};
5148 and supposing that we are instantiating S<int*>, ARGS will
5149 present be {int*} but we need {int}. */
5151 = get_class_bindings (TREE_VALUE (t), TREE_PURPOSE (t),
5154 /* If there were multiple levels in ARGS, replacing the
5155 innermost level would alter CLASSTYPE_TI_ARGS, which we don't
5156 want, so we make a copy first. */
5157 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args))
5159 args = copy_node (args);
5160 SET_TMPL_ARGS_LEVEL (args, TMPL_ARGS_DEPTH (args), inner_args);
5166 if (flag_external_templates)
5168 if (flag_alt_external_templates)
5170 CLASSTYPE_INTERFACE_ONLY (type) = interface_only;
5171 SET_CLASSTYPE_INTERFACE_UNKNOWN_X (type, interface_unknown);
5175 CLASSTYPE_INTERFACE_ONLY (type) = CLASSTYPE_INTERFACE_ONLY (pattern);
5176 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
5177 (type, CLASSTYPE_INTERFACE_UNKNOWN (pattern));
5182 SET_CLASSTYPE_INTERFACE_UNKNOWN (type);
5185 TYPE_HAS_CONSTRUCTOR (type) = TYPE_HAS_CONSTRUCTOR (pattern);
5186 TYPE_HAS_DESTRUCTOR (type) = TYPE_HAS_DESTRUCTOR (pattern);
5187 TYPE_OVERLOADS_CALL_EXPR (type) = TYPE_OVERLOADS_CALL_EXPR (pattern);
5188 TYPE_OVERLOADS_ARRAY_REF (type) = TYPE_OVERLOADS_ARRAY_REF (pattern);
5189 TYPE_OVERLOADS_ARROW (type) = TYPE_OVERLOADS_ARROW (pattern);
5190 TYPE_HAS_NEW_OPERATOR (type) = TYPE_HAS_NEW_OPERATOR (pattern);
5191 TYPE_HAS_ARRAY_NEW_OPERATOR (type) = TYPE_HAS_ARRAY_NEW_OPERATOR (pattern);
5192 TYPE_GETS_DELETE (type) = TYPE_GETS_DELETE (pattern);
5193 TYPE_HAS_ASSIGN_REF (type) = TYPE_HAS_ASSIGN_REF (pattern);
5194 TYPE_HAS_CONST_ASSIGN_REF (type) = TYPE_HAS_CONST_ASSIGN_REF (pattern);
5195 TYPE_HAS_ABSTRACT_ASSIGN_REF (type) = TYPE_HAS_ABSTRACT_ASSIGN_REF (pattern);
5196 TYPE_HAS_INIT_REF (type) = TYPE_HAS_INIT_REF (pattern);
5197 TYPE_HAS_CONST_INIT_REF (type) = TYPE_HAS_CONST_INIT_REF (pattern);
5198 TYPE_HAS_DEFAULT_CONSTRUCTOR (type) = TYPE_HAS_DEFAULT_CONSTRUCTOR (pattern);
5199 TYPE_HAS_CONVERSION (type) = TYPE_HAS_CONVERSION (pattern);
5200 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (type)
5201 = TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (pattern);
5202 TYPE_USES_MULTIPLE_INHERITANCE (type)
5203 = TYPE_USES_MULTIPLE_INHERITANCE (pattern);
5204 TYPE_USES_VIRTUAL_BASECLASSES (type)
5205 = TYPE_USES_VIRTUAL_BASECLASSES (pattern);
5206 TYPE_PACKED (type) = TYPE_PACKED (pattern);
5207 TYPE_ALIGN (type) = TYPE_ALIGN (pattern);
5208 TYPE_USER_ALIGN (type) = TYPE_USER_ALIGN (pattern);
5209 TYPE_FOR_JAVA (type) = TYPE_FOR_JAVA (pattern); /* For libjava's JArray<T> */
5210 if (ANON_AGGR_TYPE_P (pattern))
5211 SET_ANON_AGGR_TYPE_P (type);
5213 pbinfo = TYPE_BINFO (pattern);
5215 if (BINFO_BASETYPES (pbinfo))
5217 tree base_list = NULL_TREE;
5218 tree pbases = BINFO_BASETYPES (pbinfo);
5219 tree paccesses = BINFO_BASEACCESSES (pbinfo);
5222 /* Substitute into each of the bases to determine the actual
5224 for (i = 0; i < TREE_VEC_LENGTH (pbases); ++i)
5230 pbase = TREE_VEC_ELT (pbases, i);
5231 access = TREE_VEC_ELT (paccesses, i);
5233 /* Substitute to figure out the base class. */
5234 base = tsubst (BINFO_TYPE (pbase), args, tf_error, NULL_TREE);
5235 if (base == error_mark_node)
5238 base_list = tree_cons (access, base, base_list);
5239 TREE_VIA_VIRTUAL (base_list) = TREE_VIA_VIRTUAL (pbase);
5242 /* The list is now in reverse order; correct that. */
5243 base_list = nreverse (base_list);
5245 /* Now call xref_basetypes to set up all the base-class
5247 xref_basetypes (type, base_list);
5250 /* Now that our base classes are set up, enter the scope of the
5251 class, so that name lookups into base classes, etc. will work
5252 correctly. This is precisely analogous to what we do in
5253 begin_class_definition when defining an ordinary non-template
5255 pushclass (type, true);
5257 /* Now members are processed in the order of declaration. */
5258 for (member = CLASSTYPE_DECL_LIST (pattern); member; member = TREE_CHAIN (member))
5260 tree t = TREE_VALUE (member);
5262 if (TREE_PURPOSE (member))
5266 /* Build new CLASSTYPE_NESTED_UTDS. */
5269 tree name = TYPE_IDENTIFIER (tag);
5272 newtag = tsubst (tag, args, tf_error, NULL_TREE);
5273 my_friendly_assert (newtag != error_mark_node, 20010206);
5274 if (TREE_CODE (newtag) != ENUMERAL_TYPE)
5276 if (TYPE_LANG_SPECIFIC (tag) && CLASSTYPE_IS_TEMPLATE (tag))
5277 /* Unfortunately, lookup_template_class sets
5278 CLASSTYPE_IMPLICIT_INSTANTIATION for a partial
5279 instantiation (i.e., for the type of a member template
5280 class nested within a template class.) This behavior is
5281 required for maybe_process_partial_specialization to work
5282 correctly, but is not accurate in this case; the TAG is not
5283 an instantiation of anything. (The corresponding
5284 TEMPLATE_DECL is an instantiation, but the TYPE is not.) */
5285 CLASSTYPE_USE_TEMPLATE (newtag) = 0;
5287 /* Now, we call pushtag to put this NEWTAG into the scope of
5288 TYPE. We first set up the IDENTIFIER_TYPE_VALUE to avoid
5289 pushtag calling push_template_decl. We don't have to do
5290 this for enums because it will already have been done in
5293 SET_IDENTIFIER_TYPE_VALUE (name, newtag);
5294 pushtag (name, newtag, /*globalize=*/0);
5297 else if (TREE_CODE (t) == FUNCTION_DECL
5298 || DECL_FUNCTION_TEMPLATE_P (t))
5300 /* Build new TYPE_METHODS. */
5302 tree r = tsubst (t, args, tf_error, NULL_TREE);
5303 set_current_access_from_decl (r);
5304 grok_special_member_properties (r);
5305 finish_member_declaration (r);
5309 /* Build new TYPE_FIELDS. */
5311 if (TREE_CODE (t) != CONST_DECL)
5315 /* The the file and line for this declaration, to
5316 assist in error message reporting. Since we
5317 called push_tinst_level above, we don't need to
5319 input_location = DECL_SOURCE_LOCATION (t);
5321 r = tsubst (t, args, tf_error | tf_warning, NULL_TREE);
5322 if (TREE_CODE (r) == VAR_DECL)
5326 if (DECL_INITIALIZED_IN_CLASS_P (r))
5327 init = tsubst_expr (DECL_INITIAL (t), args,
5328 tf_error | tf_warning, NULL_TREE);
5332 finish_static_data_member_decl (r, init,
5333 /*asmspec_tree=*/NULL_TREE,
5336 if (DECL_INITIALIZED_IN_CLASS_P (r))
5337 check_static_variable_definition (r, TREE_TYPE (r));
5339 else if (TREE_CODE (r) == FIELD_DECL)
5341 /* Determine whether R has a valid type and can be
5342 completed later. If R is invalid, then it is
5343 replaced by error_mark_node so that it will not be
5344 added to TYPE_FIELDS. */
5345 tree rtype = TREE_TYPE (r);
5346 if (can_complete_type_without_circularity (rtype))
5347 complete_type (rtype);
5349 if (!COMPLETE_TYPE_P (rtype))
5351 cxx_incomplete_type_error (r, rtype);
5352 r = error_mark_node;
5356 /* If it is a TYPE_DECL for a class-scoped ENUMERAL_TYPE,
5357 such a thing will already have been added to the field
5358 list by tsubst_enum in finish_member_declaration in the
5359 CLASSTYPE_NESTED_UTDS case above. */
5360 if (!(TREE_CODE (r) == TYPE_DECL
5361 && TREE_CODE (TREE_TYPE (r)) == ENUMERAL_TYPE
5362 && DECL_ARTIFICIAL (r)))
5364 set_current_access_from_decl (r);
5365 finish_member_declaration (r);
5372 if (TYPE_P (t) || DECL_CLASS_TEMPLATE_P (t))
5374 /* Build new CLASSTYPE_FRIEND_CLASSES. */
5376 tree friend_type = t;
5377 tree new_friend_type;
5379 if (TREE_CODE (friend_type) == TEMPLATE_DECL)
5380 new_friend_type = tsubst_friend_class (friend_type, args);
5381 else if (uses_template_parms (friend_type))
5382 new_friend_type = tsubst (friend_type, args,
5383 tf_error | tf_warning, NULL_TREE);
5384 else if (CLASSTYPE_USE_TEMPLATE (friend_type))
5385 new_friend_type = friend_type;
5388 tree ns = decl_namespace_context (TYPE_MAIN_DECL (friend_type));
5390 /* The call to xref_tag_from_type does injection for friend
5392 push_nested_namespace (ns);
5394 xref_tag_from_type (friend_type, NULL_TREE, 1);
5395 pop_nested_namespace (ns);
5398 if (TREE_CODE (friend_type) == TEMPLATE_DECL)
5399 /* Trick make_friend_class into realizing that the friend
5400 we're adding is a template, not an ordinary class. It's
5401 important that we use make_friend_class since it will
5402 perform some error-checking and output cross-reference
5404 ++processing_template_decl;
5406 if (new_friend_type != error_mark_node)
5407 make_friend_class (type, new_friend_type);
5409 if (TREE_CODE (friend_type) == TEMPLATE_DECL)
5410 --processing_template_decl;
5413 /* Build new DECL_FRIENDLIST. */
5414 add_friend (type, tsubst_friend_function (t, args));
5418 /* Set the file and line number information to whatever is given for
5419 the class itself. This puts error messages involving generated
5420 implicit functions at a predictable point, and the same point
5421 that would be used for non-template classes. */
5422 typedecl = TYPE_MAIN_DECL (type);
5423 input_location = DECL_SOURCE_LOCATION (typedecl);
5425 unreverse_member_declarations (type);
5426 finish_struct_1 (type);
5427 CLASSTYPE_GOT_SEMICOLON (type) = 1;
5429 /* Clear this now so repo_template_used is happy. */
5430 TYPE_BEING_DEFINED (type) = 0;
5431 repo_template_used (type);
5433 /* Now that the class is complete, instantiate default arguments for
5434 any member functions. We don't do this earlier because the
5435 default arguments may reference members of the class. */
5436 if (!PRIMARY_TEMPLATE_P (template))
5437 for (t = TYPE_METHODS (type); t; t = TREE_CHAIN (t))
5438 if (TREE_CODE (t) == FUNCTION_DECL
5439 /* Implicitly generated member functions will not have template
5440 information; they are not instantiations, but instead are
5441 created "fresh" for each instantiation. */
5442 && DECL_TEMPLATE_INFO (t))
5443 tsubst_default_arguments (t);
5446 pop_from_top_level ();
5447 pop_deferring_access_checks ();
5450 if (TYPE_CONTAINS_VPTR_P (type))
5451 keyed_classes = tree_cons (NULL_TREE, type, keyed_classes);
5457 list_eq (tree t1, tree t2)
5459 if (t1 == NULL_TREE)
5460 return t2 == NULL_TREE;
5461 if (t2 == NULL_TREE)
5463 /* Don't care if one declares its arg const and the other doesn't -- the
5464 main variant of the arg type is all that matters. */
5465 if (TYPE_MAIN_VARIANT (TREE_VALUE (t1))
5466 != TYPE_MAIN_VARIANT (TREE_VALUE (t2)))
5468 return list_eq (TREE_CHAIN (t1), TREE_CHAIN (t2));
5472 tsubst_template_arg (tree t, tree args, tsubst_flags_t complain, tree in_decl)
5478 else if (TYPE_P (t))
5479 r = tsubst (t, args, complain, in_decl);
5482 r = tsubst_expr (t, args, complain, in_decl);
5484 if (!uses_template_parms (r))
5486 /* Sometimes, one of the args was an expression involving a
5487 template constant parameter, like N - 1. Now that we've
5488 tsubst'd, we might have something like 2 - 1. This will
5489 confuse lookup_template_class, so we do constant folding
5490 here. We have to unset processing_template_decl, to fool
5491 tsubst_copy_and_build() into building an actual tree. */
5493 /* If the TREE_TYPE of ARG is not NULL_TREE, ARG is already
5494 as simple as it's going to get, and trying to reprocess
5495 the trees will break. Once tsubst_expr et al DTRT for
5496 non-dependent exprs, this code can go away, as the type
5497 will always be set. */
5500 int saved_processing_template_decl = processing_template_decl;
5501 processing_template_decl = 0;
5502 r = tsubst_copy_and_build (r, /*args=*/NULL_TREE,
5503 tf_error, /*in_decl=*/NULL_TREE,
5504 /*function_p=*/false);
5505 processing_template_decl = saved_processing_template_decl;
5513 /* Substitute ARGS into the vector or list of template arguments T. */
5516 tsubst_template_args (tree t, tree args, tsubst_flags_t complain, tree in_decl)
5518 int is_list = !(t && TREE_CODE (t) == TREE_VEC);
5519 int len = is_list ? list_length (t) : TREE_VEC_LENGTH (t);
5520 int need_new = 0, i;
5522 tree *elts = alloca (len * sizeof (tree));
5524 for (i = 0; i < len; i++)
5527 tree new_arg = NULL_TREE;
5531 orig_arg = TREE_VALUE (position);
5532 position = TREE_CHAIN (position);
5536 orig_arg = TREE_VEC_ELT (t, i);
5537 if (TREE_CODE (orig_arg) == TREE_VEC)
5538 new_arg = tsubst_template_args (orig_arg, args, complain, in_decl);
5542 new_arg = tsubst_template_arg (orig_arg, args, complain, in_decl);
5544 if (new_arg == error_mark_node)
5545 return error_mark_node;
5548 if (new_arg != orig_arg)
5560 t = tree_cons (NULL_TREE, elts[i], t);
5564 t = make_tree_vec (len);
5565 for (i = 0; i < len; i++)
5566 TREE_VEC_ELT (t, i) = elts[i];
5572 /* Return the result of substituting ARGS into the template parameters
5573 given by PARMS. If there are m levels of ARGS and m + n levels of
5574 PARMS, then the result will contain n levels of PARMS. For
5575 example, if PARMS is `template <class T> template <class U>
5576 template <T*, U, class V>' and ARGS is {{int}, {double}} then the
5577 result will be `template <int*, double, class V>'. */
5580 tsubst_template_parms (tree parms, tree args, tsubst_flags_t complain)
5585 for (new_parms = &r;
5586 TMPL_PARMS_DEPTH (parms) > TMPL_ARGS_DEPTH (args);
5587 new_parms = &(TREE_CHAIN (*new_parms)),
5588 parms = TREE_CHAIN (parms))
5591 make_tree_vec (TREE_VEC_LENGTH (TREE_VALUE (parms)));
5594 for (i = 0; i < TREE_VEC_LENGTH (new_vec); ++i)
5596 tree tuple = TREE_VEC_ELT (TREE_VALUE (parms), i);
5597 tree default_value = TREE_PURPOSE (tuple);
5598 tree parm_decl = TREE_VALUE (tuple);
5600 parm_decl = tsubst (parm_decl, args, complain, NULL_TREE);
5601 default_value = tsubst_template_arg (default_value, args,
5602 complain, NULL_TREE);
5604 tuple = build_tree_list (default_value, parm_decl);
5605 TREE_VEC_ELT (new_vec, i) = tuple;
5609 tree_cons (size_int (TMPL_PARMS_DEPTH (parms)
5610 - TMPL_ARGS_DEPTH (args)),
5611 new_vec, NULL_TREE);
5617 /* Substitute the ARGS into the indicated aggregate (or enumeration)
5618 type T. If T is not an aggregate or enumeration type, it is
5619 handled as if by tsubst. IN_DECL is as for tsubst. If
5620 ENTERING_SCOPE is nonzero, T is the context for a template which
5621 we are presently tsubst'ing. Return the substituted value. */
5624 tsubst_aggr_type (tree t,
5626 tsubst_flags_t complain,
5633 switch (TREE_CODE (t))
5636 if (TYPE_PTRMEMFUNC_P (t))
5637 return tsubst (TYPE_PTRMEMFUNC_FN_TYPE (t), args, complain, in_decl);
5639 /* else fall through */
5642 if (TYPE_TEMPLATE_INFO (t))
5648 /* First, determine the context for the type we are looking
5650 if (TYPE_CONTEXT (t) != NULL_TREE)
5651 context = tsubst_aggr_type (TYPE_CONTEXT (t), args,
5653 in_decl, /*entering_scope=*/1);
5655 context = NULL_TREE;
5657 /* Then, figure out what arguments are appropriate for the
5658 type we are trying to find. For example, given:
5660 template <class T> struct S;
5661 template <class T, class U> void f(T, U) { S<U> su; }
5663 and supposing that we are instantiating f<int, double>,
5664 then our ARGS will be {int, double}, but, when looking up
5665 S we only want {double}. */
5666 argvec = tsubst_template_args (TYPE_TI_ARGS (t), args,
5668 if (argvec == error_mark_node)
5669 return error_mark_node;
5671 r = lookup_template_class (t, argvec, in_decl, context,
5672 entering_scope, complain);
5674 return cp_build_qualified_type_real (r, TYPE_QUALS (t), complain);
5677 /* This is not a template type, so there's nothing to do. */
5681 return tsubst (t, args, complain, in_decl);
5685 /* Substitute into the default argument ARG (a default argument for
5686 FN), which has the indicated TYPE. */
5689 tsubst_default_argument (tree fn, tree type, tree arg)
5691 /* This default argument came from a template. Instantiate the
5692 default argument here, not in tsubst. In the case of
5701 we must be careful to do name lookup in the scope of S<T>,
5702 rather than in the current class.
5704 ??? current_class_type affects a lot more than name lookup. This is
5705 very fragile. Fortunately, it will go away when we do 2-phase name
5706 binding properly. */
5708 /* FN is already the desired FUNCTION_DECL. */
5709 push_access_scope (fn);
5711 arg = tsubst_expr (arg, DECL_TI_ARGS (fn),
5712 tf_error | tf_warning, NULL_TREE);
5714 pop_access_scope (fn);
5716 /* Make sure the default argument is reasonable. */
5717 arg = check_default_argument (type, arg);
5722 /* Substitute into all the default arguments for FN. */
5725 tsubst_default_arguments (tree fn)
5730 tmpl_args = DECL_TI_ARGS (fn);
5732 /* If this function is not yet instantiated, we certainly don't need
5733 its default arguments. */
5734 if (uses_template_parms (tmpl_args))
5737 for (arg = TYPE_ARG_TYPES (TREE_TYPE (fn));
5739 arg = TREE_CHAIN (arg))
5740 if (TREE_PURPOSE (arg))
5741 TREE_PURPOSE (arg) = tsubst_default_argument (fn,
5743 TREE_PURPOSE (arg));
5746 /* Substitute the ARGS into the T, which is a _DECL. TYPE is the
5747 (already computed) substitution of ARGS into TREE_TYPE (T), if
5748 appropriate. Return the result of the substitution. Issue error
5749 and warning messages under control of COMPLAIN. */
5752 tsubst_decl (tree t, tree args, tree type, tsubst_flags_t complain)
5754 location_t saved_loc;
5758 /* Set the filename and linenumber to improve error-reporting. */
5759 saved_loc = input_location;
5760 input_location = DECL_SOURCE_LOCATION (t);
5762 switch (TREE_CODE (t))
5766 /* We can get here when processing a member template function
5767 of a template class. */
5768 tree decl = DECL_TEMPLATE_RESULT (t);
5770 int is_template_template_parm = DECL_TEMPLATE_TEMPLATE_PARM_P (t);
5772 if (!is_template_template_parm)
5774 /* We might already have an instance of this template.
5775 The ARGS are for the surrounding class type, so the
5776 full args contain the tsubst'd args for the context,
5777 plus the innermost args from the template decl. */
5778 tree tmpl_args = DECL_CLASS_TEMPLATE_P (t)
5779 ? CLASSTYPE_TI_ARGS (TREE_TYPE (t))
5780 : DECL_TI_ARGS (DECL_TEMPLATE_RESULT (t));
5783 full_args = tsubst_template_args (tmpl_args, args,
5786 /* tsubst_template_args doesn't copy the vector if
5787 nothing changed. But, *something* should have
5789 my_friendly_assert (full_args != tmpl_args, 0);
5791 spec = retrieve_specialization (t, full_args);
5792 if (spec != NULL_TREE)
5799 /* Make a new template decl. It will be similar to the
5800 original, but will record the current template arguments.
5801 We also create a new function declaration, which is just
5802 like the old one, but points to this new template, rather
5803 than the old one. */
5805 my_friendly_assert (DECL_LANG_SPECIFIC (r) != 0, 0);
5806 TREE_CHAIN (r) = NULL_TREE;
5808 if (is_template_template_parm)
5810 tree new_decl = tsubst (decl, args, complain, in_decl);
5811 DECL_TEMPLATE_RESULT (r) = new_decl;
5812 TREE_TYPE (r) = TREE_TYPE (new_decl);
5817 = tsubst_aggr_type (DECL_CONTEXT (t), args,
5819 /*entering_scope=*/1);
5820 DECL_TEMPLATE_INFO (r) = build_tree_list (t, args);
5822 if (TREE_CODE (decl) == TYPE_DECL)
5824 tree new_type = tsubst (TREE_TYPE (t), args, complain, in_decl);
5825 TREE_TYPE (r) = new_type;
5826 CLASSTYPE_TI_TEMPLATE (new_type) = r;
5827 DECL_TEMPLATE_RESULT (r) = TYPE_MAIN_DECL (new_type);
5828 DECL_TI_ARGS (r) = CLASSTYPE_TI_ARGS (new_type);
5832 tree new_decl = tsubst (decl, args, complain, in_decl);
5833 if (new_decl == error_mark_node)
5834 return error_mark_node;
5836 DECL_TEMPLATE_RESULT (r) = new_decl;
5837 DECL_TI_TEMPLATE (new_decl) = r;
5838 TREE_TYPE (r) = TREE_TYPE (new_decl);
5839 DECL_TI_ARGS (r) = DECL_TI_ARGS (new_decl);
5842 SET_DECL_IMPLICIT_INSTANTIATION (r);
5843 DECL_TEMPLATE_INSTANTIATIONS (r) = NULL_TREE;
5844 DECL_TEMPLATE_SPECIALIZATIONS (r) = NULL_TREE;
5846 /* The template parameters for this new template are all the
5847 template parameters for the old template, except the
5848 outermost level of parameters. */
5849 DECL_TEMPLATE_PARMS (r)
5850 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t), args,
5853 if (PRIMARY_TEMPLATE_P (t))
5854 DECL_PRIMARY_TEMPLATE (r) = r;
5856 /* We don't partially instantiate partial specializations. */
5857 if (TREE_CODE (decl) == TYPE_DECL)
5860 /* Record this partial instantiation. */
5861 register_specialization (r, t,
5862 DECL_TI_ARGS (DECL_TEMPLATE_RESULT (r)));
5870 tree argvec = NULL_TREE;
5877 /* Nobody should be tsubst'ing into non-template functions. */
5878 my_friendly_assert (DECL_TEMPLATE_INFO (t) != NULL_TREE, 0);
5880 if (TREE_CODE (DECL_TI_TEMPLATE (t)) == TEMPLATE_DECL)
5885 /* If T is not dependent, just return it. We have to
5886 increment PROCESSING_TEMPLATE_DECL because
5887 value_dependent_expression_p assumes that nothing is
5888 dependent when PROCESSING_TEMPLATE_DECL is zero. */
5889 ++processing_template_decl;
5890 dependent_p = value_dependent_expression_p (t);
5891 --processing_template_decl;
5895 /* Calculate the most general template of which R is a
5896 specialization, and the complete set of arguments used to
5898 gen_tmpl = most_general_template (DECL_TI_TEMPLATE (t));
5899 argvec = tsubst_template_args (DECL_TI_ARGS
5900 (DECL_TEMPLATE_RESULT (gen_tmpl)),
5901 args, complain, in_decl);
5903 /* Check to see if we already have this specialization. */
5904 spec = retrieve_specialization (gen_tmpl, argvec);
5912 /* We can see more levels of arguments than parameters if
5913 there was a specialization of a member template, like
5916 template <class T> struct S { template <class U> void f(); }
5917 template <> template <class U> void S<int>::f(U);
5919 Here, we'll be substituting into the specialization,
5920 because that's where we can find the code we actually
5921 want to generate, but we'll have enough arguments for
5922 the most general template.
5924 We also deal with the peculiar case:
5926 template <class T> struct S {
5927 template <class U> friend void f();
5929 template <class U> void f() {}
5931 template void f<double>();
5933 Here, the ARGS for the instantiation of will be {int,
5934 double}. But, we only need as many ARGS as there are
5935 levels of template parameters in CODE_PATTERN. We are
5936 careful not to get fooled into reducing the ARGS in
5939 template <class T> struct S { template <class U> void f(U); }
5940 template <class T> template <> void S<T>::f(int) {}
5942 which we can spot because the pattern will be a
5943 specialization in this case. */
5944 args_depth = TMPL_ARGS_DEPTH (args);
5946 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (t)));
5947 if (args_depth > parms_depth
5948 && !DECL_TEMPLATE_SPECIALIZATION (t))
5949 args = get_innermost_template_args (args, parms_depth);
5953 /* This special case arises when we have something like this:
5955 template <class T> struct S {
5956 friend void f<int>(int, double);
5959 Here, the DECL_TI_TEMPLATE for the friend declaration
5960 will be an IDENTIFIER_NODE. We are being called from
5961 tsubst_friend_function, and we want only to create a
5962 new decl (R) with appropriate types so that we can call
5963 determine_specialization. */
5964 gen_tmpl = NULL_TREE;
5967 if (DECL_CLASS_SCOPE_P (t))
5969 if (DECL_NAME (t) == constructor_name (DECL_CONTEXT (t)))
5973 ctx = tsubst_aggr_type (DECL_CONTEXT (t), args,
5975 /*entering_scope=*/1);
5980 ctx = DECL_CONTEXT (t);
5982 type = tsubst (type, args, complain, in_decl);
5983 if (type == error_mark_node)
5984 return error_mark_node;
5986 /* We do NOT check for matching decls pushed separately at this
5987 point, as they may not represent instantiations of this
5988 template, and in any case are considered separate under the
5991 DECL_USE_TEMPLATE (r) = 0;
5992 TREE_TYPE (r) = type;
5993 /* Clear out the mangled name and RTL for the instantiation. */
5994 SET_DECL_ASSEMBLER_NAME (r, NULL_TREE);
5995 SET_DECL_RTL (r, NULL_RTX);
5997 DECL_CONTEXT (r) = ctx;
5999 if (member && DECL_CONV_FN_P (r))
6000 /* Type-conversion operator. Reconstruct the name, in
6001 case it's the name of one of the template's parameters. */
6002 DECL_NAME (r) = mangle_conv_op_name_for_type (TREE_TYPE (type));
6004 DECL_ARGUMENTS (r) = tsubst (DECL_ARGUMENTS (t), args,
6006 DECL_RESULT (r) = NULL_TREE;
6008 TREE_STATIC (r) = 0;
6009 TREE_PUBLIC (r) = TREE_PUBLIC (t);
6010 DECL_EXTERNAL (r) = 1;
6011 DECL_INTERFACE_KNOWN (r) = 0;
6012 DECL_DEFER_OUTPUT (r) = 0;
6013 TREE_CHAIN (r) = NULL_TREE;
6014 DECL_PENDING_INLINE_INFO (r) = 0;
6015 DECL_PENDING_INLINE_P (r) = 0;
6016 DECL_SAVED_TREE (r) = NULL_TREE;
6018 if (DECL_CLONED_FUNCTION (r))
6020 DECL_CLONED_FUNCTION (r) = tsubst (DECL_CLONED_FUNCTION (t),
6022 TREE_CHAIN (r) = TREE_CHAIN (DECL_CLONED_FUNCTION (r));
6023 TREE_CHAIN (DECL_CLONED_FUNCTION (r)) = r;
6026 /* Set up the DECL_TEMPLATE_INFO for R. There's no need to do
6027 this in the special friend case mentioned above where
6028 GEN_TMPL is NULL. */
6031 DECL_TEMPLATE_INFO (r)
6032 = tree_cons (gen_tmpl, argvec, NULL_TREE);
6033 SET_DECL_IMPLICIT_INSTANTIATION (r);
6034 register_specialization (r, gen_tmpl, argvec);
6036 /* We're not supposed to instantiate default arguments
6037 until they are called, for a template. But, for a
6040 template <class T> void f ()
6041 { extern void g(int i = T()); }
6043 we should do the substitution when the template is
6044 instantiated. We handle the member function case in
6045 instantiate_class_template since the default arguments
6046 might refer to other members of the class. */
6048 && !PRIMARY_TEMPLATE_P (gen_tmpl)
6049 && !uses_template_parms (argvec))
6050 tsubst_default_arguments (r);
6053 /* Copy the list of befriending classes. */
6054 for (friends = &DECL_BEFRIENDING_CLASSES (r);
6056 friends = &TREE_CHAIN (*friends))
6058 *friends = copy_node (*friends);
6059 TREE_VALUE (*friends) = tsubst (TREE_VALUE (*friends),
6064 if (DECL_CONSTRUCTOR_P (r) || DECL_DESTRUCTOR_P (r))
6066 maybe_retrofit_in_chrg (r);
6067 if (DECL_CONSTRUCTOR_P (r))
6068 grok_ctor_properties (ctx, r);
6069 /* If this is an instantiation of a member template, clone it.
6070 If it isn't, that'll be handled by
6071 clone_constructors_and_destructors. */
6072 if (PRIMARY_TEMPLATE_P (gen_tmpl))
6073 clone_function_decl (r, /*update_method_vec_p=*/0);
6075 else if (IDENTIFIER_OPNAME_P (DECL_NAME (r)))
6076 grok_op_properties (r, DECL_FRIEND_P (r));
6083 if (DECL_TEMPLATE_PARM_P (t))
6084 SET_DECL_TEMPLATE_PARM_P (r);
6086 TREE_TYPE (r) = type;
6087 c_apply_type_quals_to_decl (cp_type_quals (type), r);
6089 if (TREE_CODE (DECL_INITIAL (r)) != TEMPLATE_PARM_INDEX)
6090 DECL_INITIAL (r) = TREE_TYPE (r);
6092 DECL_INITIAL (r) = tsubst (DECL_INITIAL (r), args,
6095 DECL_CONTEXT (r) = NULL_TREE;
6097 if (!DECL_TEMPLATE_PARM_P (r))
6098 DECL_ARG_TYPE (r) = type_passed_as (type);
6100 TREE_CHAIN (r) = tsubst (TREE_CHAIN (t), args,
6101 complain, TREE_CHAIN (t));
6108 TREE_TYPE (r) = type;
6109 c_apply_type_quals_to_decl (cp_type_quals (type), r);
6111 /* We don't have to set DECL_CONTEXT here; it is set by
6112 finish_member_declaration. */
6113 DECL_INITIAL (r) = tsubst_expr (DECL_INITIAL (t), args,
6115 TREE_CHAIN (r) = NULL_TREE;
6116 if (VOID_TYPE_P (type))
6117 cp_error_at ("instantiation of `%D' as type `%T'", r, type);
6125 = tsubst_copy (DECL_INITIAL (t), args, complain, in_decl);
6126 TREE_CHAIN (r) = NULL_TREE;
6131 if (TREE_CODE (type) == TEMPLATE_TEMPLATE_PARM
6132 || t == TYPE_MAIN_DECL (TREE_TYPE (t)))
6134 /* If this is the canonical decl, we don't have to mess with
6135 instantiations, and often we can't (for typename, template
6136 type parms and such). Note that TYPE_NAME is not correct for
6137 the above test if we've copied the type for a typedef. */
6138 r = TYPE_NAME (type);
6146 tree argvec = NULL_TREE;
6147 tree gen_tmpl = NULL_TREE;
6149 tree tmpl = NULL_TREE;
6153 /* Assume this is a non-local variable. */
6156 if (TYPE_P (CP_DECL_CONTEXT (t)))
6157 ctx = tsubst_aggr_type (DECL_CONTEXT (t), args,
6159 in_decl, /*entering_scope=*/1);
6160 else if (DECL_NAMESPACE_SCOPE_P (t))
6161 ctx = DECL_CONTEXT (t);
6164 /* Subsequent calls to pushdecl will fill this in. */
6169 /* Check to see if we already have this specialization. */
6172 tmpl = DECL_TI_TEMPLATE (t);
6173 gen_tmpl = most_general_template (tmpl);
6174 argvec = tsubst (DECL_TI_ARGS (t), args, complain, in_decl);
6175 spec = retrieve_specialization (gen_tmpl, argvec);
6178 spec = retrieve_local_specialization (t);
6187 if (TREE_CODE (r) == VAR_DECL)
6189 type = complete_type (type);
6190 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (r)
6191 = DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (t);
6193 else if (DECL_SELF_REFERENCE_P (t))
6194 SET_DECL_SELF_REFERENCE_P (r);
6195 TREE_TYPE (r) = type;
6196 c_apply_type_quals_to_decl (cp_type_quals (type), r);
6197 DECL_CONTEXT (r) = ctx;
6198 /* Clear out the mangled name and RTL for the instantiation. */
6199 SET_DECL_ASSEMBLER_NAME (r, NULL_TREE);
6200 SET_DECL_RTL (r, NULL_RTX);
6202 /* Don't try to expand the initializer until someone tries to use
6203 this variable; otherwise we run into circular dependencies. */
6204 DECL_INITIAL (r) = NULL_TREE;
6205 SET_DECL_RTL (r, NULL_RTX);
6206 DECL_SIZE (r) = DECL_SIZE_UNIT (r) = 0;
6208 /* Even if the original location is out of scope, the newly
6209 substituted one is not. */
6210 if (TREE_CODE (r) == VAR_DECL)
6212 DECL_DEAD_FOR_LOCAL (r) = 0;
6213 DECL_INITIALIZED_P (r) = 0;
6218 /* A static data member declaration is always marked
6219 external when it is declared in-class, even if an
6220 initializer is present. We mimic the non-template
6222 DECL_EXTERNAL (r) = 1;
6224 register_specialization (r, gen_tmpl, argvec);
6225 DECL_TEMPLATE_INFO (r) = tree_cons (tmpl, argvec, NULL_TREE);
6226 SET_DECL_IMPLICIT_INSTANTIATION (r);
6229 register_local_specialization (r, t);
6231 TREE_CHAIN (r) = NULL_TREE;
6232 if (TREE_CODE (r) == VAR_DECL && VOID_TYPE_P (type))
6233 cp_error_at ("instantiation of `%D' as type `%T'", r, type);
6234 /* Compute the size, alignment, etc. of R. */
6243 /* Restore the file and line information. */
6244 input_location = saved_loc;
6249 /* Substitute into the ARG_TYPES of a function type. */
6252 tsubst_arg_types (tree arg_types,
6254 tsubst_flags_t complain,
6257 tree remaining_arg_types;
6260 if (!arg_types || arg_types == void_list_node)
6263 remaining_arg_types = tsubst_arg_types (TREE_CHAIN (arg_types),
6264 args, complain, in_decl);
6265 if (remaining_arg_types == error_mark_node)
6266 return error_mark_node;
6268 type = tsubst (TREE_VALUE (arg_types), args, complain, in_decl);
6269 if (type == error_mark_node)
6270 return error_mark_node;
6271 if (VOID_TYPE_P (type))
6273 if (complain & tf_error)
6275 error ("invalid parameter type `%T'", type);
6277 cp_error_at ("in declaration `%D'", in_decl);
6279 return error_mark_node;
6282 /* Do array-to-pointer, function-to-pointer conversion, and ignore
6283 top-level qualifiers as required. */
6284 type = TYPE_MAIN_VARIANT (type_decays_to (type));
6286 /* Note that we do not substitute into default arguments here. The
6287 standard mandates that they be instantiated only when needed,
6288 which is done in build_over_call. */
6289 return hash_tree_cons (TREE_PURPOSE (arg_types), type,
6290 remaining_arg_types);
6294 /* Substitute into a FUNCTION_TYPE or METHOD_TYPE. This routine does
6295 *not* handle the exception-specification for FNTYPE, because the
6296 initial substitution of explicitly provided template parameters
6297 during argument deduction forbids substitution into the
6298 exception-specification:
6302 All references in the function type of the function template to the
6303 corresponding template parameters are replaced by the specified tem-
6304 plate argument values. If a substitution in a template parameter or
6305 in the function type of the function template results in an invalid
6306 type, type deduction fails. [Note: The equivalent substitution in
6307 exception specifications is done only when the function is instanti-
6308 ated, at which point a program is ill-formed if the substitution
6309 results in an invalid type.] */
6312 tsubst_function_type (tree t,
6314 tsubst_flags_t complain,
6321 /* The TYPE_CONTEXT is not used for function/method types. */
6322 my_friendly_assert (TYPE_CONTEXT (t) == NULL_TREE, 0);
6324 /* Substitute the return type. */
6325 return_type = tsubst (TREE_TYPE (t), args, complain, in_decl);
6326 if (return_type == error_mark_node)
6327 return error_mark_node;
6329 /* Substitute the argument types. */
6330 arg_types = tsubst_arg_types (TYPE_ARG_TYPES (t), args,
6332 if (arg_types == error_mark_node)
6333 return error_mark_node;
6335 /* Construct a new type node and return it. */
6336 if (TREE_CODE (t) == FUNCTION_TYPE)
6337 fntype = build_function_type (return_type, arg_types);
6340 tree r = TREE_TYPE (TREE_VALUE (arg_types));
6341 if (! IS_AGGR_TYPE (r))
6345 Type deduction may fail for any of the following
6348 -- Attempting to create "pointer to member of T" when T
6349 is not a class type. */
6350 if (complain & tf_error)
6351 error ("creating pointer to member function of non-class type `%T'",
6353 return error_mark_node;
6356 fntype = build_cplus_method_type (r, return_type, TREE_CHAIN
6359 fntype = cp_build_qualified_type_real (fntype, TYPE_QUALS (t), complain);
6360 fntype = build_type_attribute_variant (fntype, TYPE_ATTRIBUTES (t));
6365 /* Substitute into the PARMS of a call-declarator. */
6368 tsubst_call_declarator_parms (tree parms,
6370 tsubst_flags_t complain,
6377 if (!parms || parms == void_list_node)
6380 new_parms = tsubst_call_declarator_parms (TREE_CHAIN (parms),
6381 args, complain, in_decl);
6383 /* Figure out the type of this parameter. */
6384 type = tsubst (TREE_VALUE (parms), args, complain, in_decl);
6386 /* Figure out the default argument as well. Note that we use
6387 tsubst_expr since the default argument is really an expression. */
6388 defarg = tsubst_expr (TREE_PURPOSE (parms), args, complain, in_decl);
6390 /* Chain this parameter on to the front of those we have already
6391 processed. We don't use hash_tree_cons because that function
6392 doesn't check TREE_PARMLIST. */
6393 new_parms = tree_cons (defarg, type, new_parms);
6395 /* And note that these are parameters. */
6396 TREE_PARMLIST (new_parms) = 1;
6401 /* Take the tree structure T and replace template parameters used
6402 therein with the argument vector ARGS. IN_DECL is an associated
6403 decl for diagnostics. If an error occurs, returns ERROR_MARK_NODE.
6404 Issue error and warning messages under control of COMPLAIN. Note
6405 that we must be relatively non-tolerant of extensions here, in
6406 order to preserve conformance; if we allow substitutions that
6407 should not be allowed, we may allow argument deductions that should
6408 not succeed, and therefore report ambiguous overload situations
6409 where there are none. In theory, we could allow the substitution,
6410 but indicate that it should have failed, and allow our caller to
6411 make sure that the right thing happens, but we don't try to do this
6414 This function is used for dealing with types, decls and the like;
6415 for expressions, use tsubst_expr or tsubst_copy. */
6418 tsubst (tree t, tree args, tsubst_flags_t complain, tree in_decl)
6422 if (t == NULL_TREE || t == error_mark_node
6423 || t == integer_type_node
6424 || t == void_type_node
6425 || t == char_type_node
6426 || TREE_CODE (t) == NAMESPACE_DECL)
6429 if (TREE_CODE (t) == IDENTIFIER_NODE)
6430 type = IDENTIFIER_TYPE_VALUE (t);
6432 type = TREE_TYPE (t);
6433 if (type == unknown_type_node)
6436 if (type && TREE_CODE (t) != FUNCTION_DECL
6437 && TREE_CODE (t) != TYPENAME_TYPE
6438 && TREE_CODE (t) != TEMPLATE_DECL
6439 && TREE_CODE (t) != IDENTIFIER_NODE
6440 && TREE_CODE (t) != FUNCTION_TYPE
6441 && TREE_CODE (t) != METHOD_TYPE)
6442 type = tsubst (type, args, complain, in_decl);
6443 if (type == error_mark_node)
6444 return error_mark_node;
6447 return tsubst_decl (t, args, type, complain);
6449 switch (TREE_CODE (t))
6454 return tsubst_aggr_type (t, args, complain, in_decl,
6455 /*entering_scope=*/0);
6458 case IDENTIFIER_NODE:
6470 if (t == integer_type_node)
6473 if (TREE_CODE (TYPE_MIN_VALUE (t)) == INTEGER_CST
6474 && TREE_CODE (TYPE_MAX_VALUE (t)) == INTEGER_CST)
6478 tree max, omax = TREE_OPERAND (TYPE_MAX_VALUE (t), 0);
6480 /* The array dimension behaves like a non-type template arg,
6481 in that we want to fold it as much as possible. */
6482 max = tsubst_template_arg (omax, args, complain, in_decl);
6483 if (!processing_template_decl)
6484 max = decl_constant_value (max);
6486 if (processing_template_decl
6487 /* When providing explicit arguments to a template
6488 function, but leaving some arguments for subsequent
6489 deduction, MAX may be template-dependent even if we're
6490 not PROCESSING_TEMPLATE_DECL. We still need to check for
6491 template parms, though; MAX won't be an INTEGER_CST for
6492 dynamic arrays, either. */
6493 || (TREE_CODE (max) != INTEGER_CST
6494 && uses_template_parms (max)))
6496 tree itype = make_node (INTEGER_TYPE);
6497 TYPE_MIN_VALUE (itype) = size_zero_node;
6498 TYPE_MAX_VALUE (itype) = build_min (MINUS_EXPR, sizetype, max,
6503 if (integer_zerop (omax))
6505 /* Still allow an explicit array of size zero. */
6507 pedwarn ("creating array with size zero");
6509 else if (integer_zerop (max)
6510 || (TREE_CODE (max) == INTEGER_CST
6511 && INT_CST_LT (max, integer_zero_node)))
6515 Type deduction may fail for any of the following
6518 Attempting to create an array with a size that is
6519 zero or negative. */
6520 if (complain & tf_error)
6521 error ("creating array with size zero (`%E')", max);
6523 return error_mark_node;
6526 return compute_array_index_type (NULL_TREE, max);
6529 case TEMPLATE_TYPE_PARM:
6530 case TEMPLATE_TEMPLATE_PARM:
6531 case BOUND_TEMPLATE_TEMPLATE_PARM:
6532 case TEMPLATE_PARM_INDEX:
6540 if (TREE_CODE (t) == TEMPLATE_TYPE_PARM
6541 || TREE_CODE (t) == TEMPLATE_TEMPLATE_PARM
6542 || TREE_CODE (t) == BOUND_TEMPLATE_TEMPLATE_PARM)
6544 idx = TEMPLATE_TYPE_IDX (t);
6545 level = TEMPLATE_TYPE_LEVEL (t);
6549 idx = TEMPLATE_PARM_IDX (t);
6550 level = TEMPLATE_PARM_LEVEL (t);
6553 if (TREE_VEC_LENGTH (args) > 0)
6555 tree arg = NULL_TREE;
6557 levels = TMPL_ARGS_DEPTH (args);
6558 if (level <= levels)
6559 arg = TMPL_ARG (args, level, idx);
6561 if (arg == error_mark_node)
6562 return error_mark_node;
6563 else if (arg != NULL_TREE)
6565 if (TREE_CODE (t) == TEMPLATE_TYPE_PARM)
6567 my_friendly_assert (TYPE_P (arg), 0);
6568 return cp_build_qualified_type_real
6569 (arg, cp_type_quals (arg) | cp_type_quals (t),
6570 complain | tf_ignore_bad_quals);
6572 else if (TREE_CODE (t) == BOUND_TEMPLATE_TEMPLATE_PARM)
6574 /* We are processing a type constructed from
6575 a template template parameter */
6576 tree argvec = tsubst (TYPE_TI_ARGS (t),
6577 args, complain, in_decl);
6578 if (argvec == error_mark_node)
6579 return error_mark_node;
6581 /* We can get a TEMPLATE_TEMPLATE_PARM here when
6582 we are resolving nested-types in the signature of
6583 a member function templates.
6584 Otherwise ARG is a TEMPLATE_DECL and is the real
6585 template to be instantiated. */
6586 if (TREE_CODE (arg) == TEMPLATE_TEMPLATE_PARM)
6587 arg = TYPE_NAME (arg);
6589 r = lookup_template_class (arg,
6592 /*entering_scope=*/0,
6594 return cp_build_qualified_type_real
6595 (r, TYPE_QUALS (t), complain);
6598 /* TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX. */
6606 /* This can happen during the attempted tsubst'ing in
6607 unify. This means that we don't yet have any information
6608 about the template parameter in question. */
6611 /* If we get here, we must have been looking at a parm for a
6612 more deeply nested template. Make a new version of this
6613 template parameter, but with a lower level. */
6614 switch (TREE_CODE (t))
6616 case TEMPLATE_TYPE_PARM:
6617 case TEMPLATE_TEMPLATE_PARM:
6618 case BOUND_TEMPLATE_TEMPLATE_PARM:
6619 if (cp_type_quals (t))
6621 r = tsubst (TYPE_MAIN_VARIANT (t), args, complain, in_decl);
6622 r = cp_build_qualified_type_real
6623 (r, cp_type_quals (t),
6624 complain | (TREE_CODE (t) == TEMPLATE_TYPE_PARM
6625 ? tf_ignore_bad_quals : 0));
6630 TEMPLATE_TYPE_PARM_INDEX (r)
6631 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (t),
6633 TYPE_STUB_DECL (r) = TYPE_NAME (r) = TEMPLATE_TYPE_DECL (r);
6634 TYPE_MAIN_VARIANT (r) = r;
6635 TYPE_POINTER_TO (r) = NULL_TREE;
6636 TYPE_REFERENCE_TO (r) = NULL_TREE;
6638 if (TREE_CODE (t) == BOUND_TEMPLATE_TEMPLATE_PARM)
6640 tree argvec = tsubst (TYPE_TI_ARGS (t), args,
6642 if (argvec == error_mark_node)
6643 return error_mark_node;
6645 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (r)
6646 = tree_cons (TYPE_TI_TEMPLATE (t), argvec, NULL_TREE);
6651 case TEMPLATE_PARM_INDEX:
6652 r = reduce_template_parm_level (t, type, levels);
6664 tree purpose, value, chain, result;
6666 if (t == void_list_node)
6669 purpose = TREE_PURPOSE (t);
6672 purpose = tsubst (purpose, args, complain, in_decl);
6673 if (purpose == error_mark_node)
6674 return error_mark_node;
6676 value = TREE_VALUE (t);
6679 value = tsubst (value, args, complain, in_decl);
6680 if (value == error_mark_node)
6681 return error_mark_node;
6683 chain = TREE_CHAIN (t);
6684 if (chain && chain != void_type_node)
6686 chain = tsubst (chain, args, complain, in_decl);
6687 if (chain == error_mark_node)
6688 return error_mark_node;
6690 if (purpose == TREE_PURPOSE (t)
6691 && value == TREE_VALUE (t)
6692 && chain == TREE_CHAIN (t))
6694 if (TREE_PARMLIST (t))
6696 result = tree_cons (purpose, value, chain);
6697 TREE_PARMLIST (result) = 1;
6700 result = hash_tree_cons (purpose, value, chain);
6704 if (type != NULL_TREE)
6706 /* A binfo node. We always need to make a copy, of the node
6707 itself and of its BINFO_BASETYPES. */
6711 /* Make sure type isn't a typedef copy. */
6712 type = BINFO_TYPE (TYPE_BINFO (type));
6714 TREE_TYPE (t) = complete_type (type);
6715 if (IS_AGGR_TYPE (type))
6717 BINFO_VTABLE (t) = TYPE_BINFO_VTABLE (type);
6718 BINFO_VIRTUALS (t) = TYPE_BINFO_VIRTUALS (type);
6719 if (TYPE_BINFO_BASETYPES (type) != NULL_TREE)
6720 BINFO_BASETYPES (t) = copy_node (TYPE_BINFO_BASETYPES (type));
6725 /* Otherwise, a vector of template arguments. */
6726 return tsubst_template_args (t, args, complain, in_decl);
6729 case REFERENCE_TYPE:
6731 enum tree_code code;
6733 if (type == TREE_TYPE (t) && TREE_CODE (type) != METHOD_TYPE)
6736 code = TREE_CODE (t);
6741 Type deduction may fail for any of the following
6744 -- Attempting to create a pointer to reference type.
6745 -- Attempting to create a reference to a reference type or
6746 a reference to void. */
6747 if (TREE_CODE (type) == REFERENCE_TYPE
6748 || (code == REFERENCE_TYPE && TREE_CODE (type) == VOID_TYPE))
6750 static location_t last_loc;
6752 /* We keep track of the last time we issued this error
6753 message to avoid spewing a ton of messages during a
6754 single bad template instantiation. */
6755 if (complain & tf_error
6756 && (last_loc.line != input_line
6757 || last_loc.file != input_filename))
6759 if (TREE_CODE (type) == VOID_TYPE)
6760 error ("forming reference to void");
6762 error ("forming %s to reference type `%T'",
6763 (code == POINTER_TYPE) ? "pointer" : "reference",
6765 last_loc = input_location;
6768 return error_mark_node;
6770 else if (code == POINTER_TYPE)
6772 r = build_pointer_type (type);
6773 if (TREE_CODE (type) == METHOD_TYPE)
6774 r = build_ptrmemfunc_type (r);
6777 r = build_reference_type (type);
6778 r = cp_build_qualified_type_real (r, TYPE_QUALS (t), complain);
6780 if (r != error_mark_node)
6781 /* Will this ever be needed for TYPE_..._TO values? */
6788 r = tsubst (TYPE_OFFSET_BASETYPE (t), args, complain, in_decl);
6789 if (r == error_mark_node || !IS_AGGR_TYPE (r))
6793 Type deduction may fail for any of the following
6796 -- Attempting to create "pointer to member of T" when T
6797 is not a class type. */
6798 if (complain & tf_error)
6799 error ("creating pointer to member of non-class type `%T'", r);
6800 return error_mark_node;
6802 if (TREE_CODE (type) == REFERENCE_TYPE)
6804 if (complain & tf_error)
6805 error ("creating pointer to member reference type `%T'", type);
6807 return error_mark_node;
6809 my_friendly_assert (TREE_CODE (type) != METHOD_TYPE, 20011231);
6810 if (TREE_CODE (type) == FUNCTION_TYPE)
6812 /* This is really a method type. The cv qualifiers of the
6813 this pointer should _not_ be determined by the cv
6814 qualifiers of the class type. They should be held
6815 somewhere in the FUNCTION_TYPE, but we don't do that at
6816 the moment. Consider
6817 typedef void (Func) () const;
6819 template <typename T1> void Foo (Func T1::*);
6824 method_type = build_cplus_method_type (TYPE_MAIN_VARIANT (r),
6826 TYPE_ARG_TYPES (type));
6827 return build_ptrmemfunc_type (build_pointer_type (method_type));
6830 return cp_build_qualified_type_real (build_ptrmem_type (r, type),
6840 fntype = tsubst_function_type (t, args, complain, in_decl);
6841 if (fntype == error_mark_node)
6842 return error_mark_node;
6844 /* Substitute the exception specification. */
6845 raises = TYPE_RAISES_EXCEPTIONS (t);
6848 tree list = NULL_TREE;
6850 if (! TREE_VALUE (raises))
6853 for (; raises != NULL_TREE; raises = TREE_CHAIN (raises))
6855 tree spec = TREE_VALUE (raises);
6857 spec = tsubst (spec, args, complain, in_decl);
6858 if (spec == error_mark_node)
6860 list = add_exception_specifier (list, spec, complain);
6862 fntype = build_exception_variant (fntype, list);
6868 tree domain = tsubst (TYPE_DOMAIN (t), args, complain, in_decl);
6869 if (domain == error_mark_node)
6870 return error_mark_node;
6872 /* As an optimization, we avoid regenerating the array type if
6873 it will obviously be the same as T. */
6874 if (type == TREE_TYPE (t) && domain == TYPE_DOMAIN (t))
6877 /* These checks should match the ones in grokdeclarator.
6881 The deduction may fail for any of the following reasons:
6883 -- Attempting to create an array with an element type that
6884 is void, a function type, or a reference type. */
6885 if (TREE_CODE (type) == VOID_TYPE
6886 || TREE_CODE (type) == FUNCTION_TYPE
6887 || TREE_CODE (type) == REFERENCE_TYPE)
6889 if (complain & tf_error)
6890 error ("creating array of `%T'", type);
6891 return error_mark_node;
6894 r = build_cplus_array_type (type, domain);
6901 tree e1 = tsubst (TREE_OPERAND (t, 0), args, complain, in_decl);
6902 tree e2 = tsubst (TREE_OPERAND (t, 1), args, complain, in_decl);
6904 if (e1 == error_mark_node || e2 == error_mark_node)
6905 return error_mark_node;
6907 return fold (build (TREE_CODE (t), TREE_TYPE (t), e1, e2));
6913 tree e = tsubst (TREE_OPERAND (t, 0), args, complain, in_decl);
6914 if (e == error_mark_node)
6915 return error_mark_node;
6917 return fold (build (TREE_CODE (t), TREE_TYPE (t), e));
6922 tree ctx = tsubst_aggr_type (TYPE_CONTEXT (t), args, complain,
6923 in_decl, /*entering_scope=*/1);
6924 tree f = tsubst_copy (TYPENAME_TYPE_FULLNAME (t), args,
6927 if (ctx == error_mark_node || f == error_mark_node)
6928 return error_mark_node;
6930 if (!IS_AGGR_TYPE (ctx))
6932 if (complain & tf_error)
6933 error ("`%T' is not a class, struct, or union type",
6935 return error_mark_node;
6937 else if (!uses_template_parms (ctx) && !TYPE_BEING_DEFINED (ctx))
6939 /* Normally, make_typename_type does not require that the CTX
6940 have complete type in order to allow things like:
6942 template <class T> struct S { typename S<T>::X Y; };
6944 But, such constructs have already been resolved by this
6945 point, so here CTX really should have complete type, unless
6946 it's a partial instantiation. */
6947 ctx = complete_type (ctx);
6948 if (!COMPLETE_TYPE_P (ctx))
6950 if (complain & tf_error)
6951 cxx_incomplete_type_error (NULL_TREE, ctx);
6952 return error_mark_node;
6956 f = make_typename_type (ctx, f,
6957 (complain & tf_error) | tf_keep_type_decl);
6958 if (f == error_mark_node)
6960 if (TREE_CODE (f) == TYPE_DECL)
6962 complain |= tf_ignore_bad_quals;
6966 return cp_build_qualified_type_real
6967 (f, cp_type_quals (f) | cp_type_quals (t), complain);
6970 case UNBOUND_CLASS_TEMPLATE:
6972 tree ctx = tsubst_aggr_type (TYPE_CONTEXT (t), args, complain,
6973 in_decl, /*entering_scope=*/1);
6974 tree name = TYPE_IDENTIFIER (t);
6976 if (ctx == error_mark_node || name == error_mark_node)
6977 return error_mark_node;
6979 return make_unbound_class_template (ctx, name, complain);
6984 tree e = tsubst (TREE_OPERAND (t, 0), args, complain, in_decl);
6985 if (e == error_mark_node)
6986 return error_mark_node;
6987 return make_pointer_declarator (type, e);
6992 tree e = tsubst (TREE_OPERAND (t, 0), args, complain, in_decl);
6993 if (e == error_mark_node)
6994 return error_mark_node;
6995 return make_reference_declarator (type, e);
7000 tree e1 = tsubst (TREE_OPERAND (t, 0), args, complain, in_decl);
7001 tree e2 = tsubst_expr (TREE_OPERAND (t, 1), args, complain, in_decl);
7002 if (e1 == error_mark_node || e2 == error_mark_node)
7003 return error_mark_node;
7005 return build_nt (ARRAY_REF, e1, e2, tsubst_expr);
7010 tree e1 = tsubst (TREE_OPERAND (t, 0), args, complain, in_decl);
7011 tree e2 = (tsubst_call_declarator_parms
7012 (CALL_DECLARATOR_PARMS (t), args, complain, in_decl));
7013 tree e3 = tsubst (CALL_DECLARATOR_EXCEPTION_SPEC (t), args,
7016 if (e1 == error_mark_node || e2 == error_mark_node
7017 || e3 == error_mark_node)
7018 return error_mark_node;
7020 return make_call_declarator (e1, e2, CALL_DECLARATOR_QUALS (t), e3);
7025 tree e1 = tsubst (TREE_OPERAND (t, 0), args, complain, in_decl);
7026 tree e2 = tsubst (TREE_OPERAND (t, 1), args, complain, in_decl);
7027 if (e1 == error_mark_node || e2 == error_mark_node)
7028 return error_mark_node;
7030 return build_nt (TREE_CODE (t), e1, e2);
7035 tree e1 = tsubst_expr (TYPE_FIELDS (t), args, complain, in_decl);
7036 if (e1 == error_mark_node)
7037 return error_mark_node;
7039 return cp_build_qualified_type_real (TREE_TYPE (e1),
7041 | cp_type_quals (TREE_TYPE (e1)),
7046 sorry ("use of `%s' in template",
7047 tree_code_name [(int) TREE_CODE (t)]);
7048 return error_mark_node;
7052 /* Like tsubst_expr for a BASELINK. OBJECT_TYPE, if non-NULL, is the
7053 type of the expression on the left-hand side of the "." or "->"
7057 tsubst_baselink (tree baselink, tree object_type,
7058 tree args, tsubst_flags_t complain, tree in_decl)
7061 tree qualifying_scope;
7063 tree template_args = 0;
7064 bool template_id_p = false;
7066 /* A baselink indicates a function from a base class. The
7067 BASELINK_ACCESS_BINFO and BASELINK_BINFO are going to have
7068 non-dependent types; otherwise, the lookup could not have
7069 succeeded. However, they may indicate bases of the template
7070 class, rather than the instantiated class.
7072 In addition, lookups that were not ambiguous before may be
7073 ambiguous now. Therefore, we perform the lookup again. */
7074 qualifying_scope = BINFO_TYPE (BASELINK_ACCESS_BINFO (baselink));
7075 fns = BASELINK_FUNCTIONS (baselink);
7076 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)
7078 template_id_p = true;
7079 template_args = TREE_OPERAND (fns, 1);
7080 fns = TREE_OPERAND (fns, 0);
7081 template_args = tsubst_copy_and_build (template_args, args,
7083 /*function_p=*/false);
7085 name = DECL_NAME (get_first_fn (fns));
7086 baselink = lookup_fnfields (qualifying_scope, name, /*protect=*/1);
7087 if (BASELINK_P (baselink) && template_id_p)
7088 BASELINK_FUNCTIONS (baselink)
7089 = build_nt (TEMPLATE_ID_EXPR,
7090 BASELINK_FUNCTIONS (baselink),
7093 object_type = current_class_type;
7094 return adjust_result_of_qualified_name_lookup (baselink,
7099 /* Like tsubst_expr for a SCOPE_REF, given by QUALIFIED_ID. DONE is
7100 true if the qualified-id will be a postfix-expression in-and-of
7101 itself; false if more of the postfix-expression follows the
7102 QUALIFIED_ID. ADDRESS_P is true if the qualified-id is the operand
7106 tsubst_qualified_id (tree qualified_id, tree args,
7107 tsubst_flags_t complain, tree in_decl,
7108 bool done, bool address_p)
7116 my_friendly_assert (TREE_CODE (qualified_id) == SCOPE_REF, 20030706);
7118 /* Figure out what name to look up. */
7119 name = TREE_OPERAND (qualified_id, 1);
7120 if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
7123 template_args = tsubst_copy_and_build (TREE_OPERAND (name, 1),
7124 args, complain, in_decl,
7125 /*function_p=*/false);
7126 name = TREE_OPERAND (name, 0);
7130 is_template = false;
7131 template_args = NULL_TREE;
7134 /* Substitute into the qualifying scope. When there are no ARGS, we
7135 are just trying to simplify a non-dependent expression. In that
7136 case the qualifying scope may be dependent, and, in any case,
7137 substituting will not help. */
7138 scope = TREE_OPERAND (qualified_id, 0);
7141 scope = tsubst (scope, args, complain, in_decl);
7142 expr = tsubst_copy (name, args, complain, in_decl);
7147 /* This case can occur while determining which of two templates is
7148 the more specialized. After performing argument deduction, we
7149 check that no invalid types are created. During that phase, we
7150 may seem uninstantiated template parameters. */
7151 if (TREE_CODE (scope) == BOUND_TEMPLATE_TEMPLATE_PARM)
7154 expr = lookup_template_function (expr, template_args);
7155 return build_nt (SCOPE_REF, scope, expr);
7158 if (!BASELINK_P (name) && !DECL_P (expr))
7159 expr = lookup_qualified_name (scope, expr, /*is_type_p=*/0, false);
7161 check_accessibility_of_qualified_id (expr,
7162 /*object_type=*/NULL_TREE,
7165 /* Remember that there was a reference to this entity. */
7169 if (!args && TREE_CODE (expr) == VAR_DECL)
7170 expr = DECL_INITIAL (expr);
7174 expr = lookup_template_function (expr, template_args);
7176 if (expr == error_mark_node && complain & tf_error)
7177 qualified_name_lookup_error (scope, TREE_OPERAND (qualified_id, 1));
7178 else if (TYPE_P (scope))
7180 expr = (adjust_result_of_qualified_name_lookup
7181 (expr, scope, current_class_type));
7182 expr = finish_qualified_id_expr (scope, expr, done, address_p);
7188 /* Like tsubst, but deals with expressions. This function just replaces
7189 template parms; to finish processing the resultant expression, use
7193 tsubst_copy (tree t, tree args, tsubst_flags_t complain, tree in_decl)
7195 enum tree_code code;
7198 if (t == NULL_TREE || t == error_mark_node)
7201 code = TREE_CODE (t);
7206 r = retrieve_local_specialization (t);
7207 my_friendly_assert (r != NULL, 20020903);
7215 if (DECL_TEMPLATE_PARM_P (t))
7216 return tsubst_copy (DECL_INITIAL (t), args, complain, in_decl);
7217 if (!DECL_CONTEXT (t))
7218 /* This is a global enumeration constant. */
7221 /* Unfortunately, we cannot just call lookup_name here.
7224 template <int I> int f() {
7226 struct S { void g() { E e = a; } };
7229 When we instantiate f<7>::S::g(), say, lookup_name is not
7230 clever enough to find f<7>::a. */
7232 = tsubst_aggr_type (TREE_TYPE (t), args, complain, in_decl,
7233 /*entering_scope=*/0);
7235 for (v = TYPE_VALUES (enum_type);
7238 if (TREE_PURPOSE (v) == DECL_NAME (t))
7239 return TREE_VALUE (v);
7241 /* We didn't find the name. That should never happen; if
7242 name-lookup found it during preliminary parsing, we
7243 should find it again here during instantiation. */
7249 if (DECL_CONTEXT (t))
7253 ctx = tsubst_aggr_type (DECL_CONTEXT (t), args, complain, in_decl,
7254 /*entering_scope=*/1);
7255 if (ctx != DECL_CONTEXT (t))
7256 return lookup_field (ctx, DECL_NAME (t), 0, false);
7262 if ((DECL_LANG_SPECIFIC (t) && DECL_TEMPLATE_INFO (t))
7263 || local_variable_p (t))
7264 t = tsubst (t, args, complain, in_decl);
7269 return tsubst_baselink (t, current_class_type, args, complain, in_decl);
7272 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t))
7273 return tsubst (TREE_TYPE (DECL_TEMPLATE_RESULT (t)),
7274 args, complain, in_decl);
7275 else if (is_member_template (t))
7276 return tsubst (t, args, complain, in_decl);
7277 else if (DECL_CLASS_SCOPE_P (t)
7278 && uses_template_parms (DECL_CONTEXT (t)))
7280 /* Template template argument like the following example need
7283 template <template <class> class TT> struct C {};
7284 template <class T> struct D {
7285 template <class U> struct E {};
7290 We are processing the template argument `E' in #1 for
7291 the template instantiation #2. Originally, `E' is a
7292 TEMPLATE_DECL with `D<T>' as its DECL_CONTEXT. Now we
7293 have to substitute this with one having context `D<int>'. */
7295 tree context = tsubst (DECL_CONTEXT (t), args, complain, in_decl);
7296 return lookup_field (context, DECL_NAME(t), 0, false);
7299 /* Ordinary template template argument. */
7303 case REINTERPRET_CAST_EXPR:
7304 case CONST_CAST_EXPR:
7305 case STATIC_CAST_EXPR:
7306 case DYNAMIC_CAST_EXPR:
7309 (code, tsubst (TREE_TYPE (t), args, complain, in_decl),
7310 tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl));
7314 case TRUTH_NOT_EXPR:
7317 case CONVERT_EXPR: /* Unary + */
7326 (code, tsubst (TREE_TYPE (t), args, complain, in_decl),
7327 tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl));
7334 object = tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl);
7335 name = TREE_OPERAND (t, 1);
7336 if (TREE_CODE (name) == BIT_NOT_EXPR)
7338 name = tsubst_copy (TREE_OPERAND (name, 0), args,
7340 name = build1 (BIT_NOT_EXPR, NULL_TREE, name);
7342 else if (TREE_CODE (name) == SCOPE_REF
7343 && TREE_CODE (TREE_OPERAND (name, 1)) == BIT_NOT_EXPR)
7345 tree base = tsubst_copy (TREE_OPERAND (name, 0), args,
7347 name = TREE_OPERAND (name, 1);
7348 name = tsubst_copy (TREE_OPERAND (name, 0), args,
7350 name = build1 (BIT_NOT_EXPR, NULL_TREE, name);
7351 name = build_nt (SCOPE_REF, base, name);
7353 else if (TREE_CODE (name) == BASELINK)
7354 name = tsubst_baselink (name,
7355 non_reference (TREE_TYPE (object)),
7359 name = tsubst_copy (name, args, complain, in_decl);
7360 return build_nt (COMPONENT_REF, object, name);
7366 case TRUNC_DIV_EXPR:
7368 case FLOOR_DIV_EXPR:
7369 case ROUND_DIV_EXPR:
7370 case EXACT_DIV_EXPR:
7372 case BIT_ANDTC_EXPR:
7375 case TRUNC_MOD_EXPR:
7376 case FLOOR_MOD_EXPR:
7377 case TRUTH_ANDIF_EXPR:
7378 case TRUTH_ORIF_EXPR:
7379 case TRUTH_AND_EXPR:
7398 case PREDECREMENT_EXPR:
7399 case PREINCREMENT_EXPR:
7400 case POSTDECREMENT_EXPR:
7401 case POSTINCREMENT_EXPR:
7403 (code, tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl),
7404 tsubst_copy (TREE_OPERAND (t, 1), args, complain, in_decl));
7407 return build_nt (code,
7408 tsubst_copy (TREE_OPERAND (t, 0), args,
7410 tsubst_copy (TREE_OPERAND (t, 1), args, complain,
7415 /* This processing should really occur in tsubst_expr. However,
7416 tsubst_expr does not recurse into expressions, since it
7417 assumes that there aren't any statements inside them. So, we
7418 need to expand the STMT_EXPR here. */
7419 if (!processing_template_decl)
7421 tree stmt_expr = begin_stmt_expr ();
7422 tsubst_expr (STMT_EXPR_STMT (t), args, complain, in_decl);
7423 return finish_stmt_expr (stmt_expr);
7430 case PSEUDO_DTOR_EXPR:
7433 (code, tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl),
7434 tsubst_copy (TREE_OPERAND (t, 1), args, complain, in_decl),
7435 tsubst_copy (TREE_OPERAND (t, 2), args, complain, in_decl));
7442 (code, tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl),
7443 tsubst_copy (TREE_OPERAND (t, 1), args, complain, in_decl),
7444 tsubst_copy (TREE_OPERAND (t, 2), args, complain, in_decl));
7445 NEW_EXPR_USE_GLOBAL (r) = NEW_EXPR_USE_GLOBAL (t);
7452 (code, tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl),
7453 tsubst_copy (TREE_OPERAND (t, 1), args, complain, in_decl));
7454 DELETE_EXPR_USE_GLOBAL (r) = DELETE_EXPR_USE_GLOBAL (t);
7455 DELETE_EXPR_USE_VEC (r) = DELETE_EXPR_USE_VEC (t);
7459 case TEMPLATE_ID_EXPR:
7461 /* Substituted template arguments */
7462 tree fn = TREE_OPERAND (t, 0);
7463 tree targs = TREE_OPERAND (t, 1);
7465 fn = tsubst_copy (fn, args, complain, in_decl);
7466 targs = tsubst_template_args (targs, args, complain, in_decl);
7468 return lookup_template_function (fn, targs);
7473 tree purpose, value, chain;
7475 if (t == void_list_node)
7478 purpose = TREE_PURPOSE (t);
7480 purpose = tsubst_copy (purpose, args, complain, in_decl);
7481 value = TREE_VALUE (t);
7483 value = tsubst_copy (value, args, complain, in_decl);
7484 chain = TREE_CHAIN (t);
7485 if (chain && chain != void_type_node)
7486 chain = tsubst_copy (chain, args, complain, in_decl);
7487 if (purpose == TREE_PURPOSE (t)
7488 && value == TREE_VALUE (t)
7489 && chain == TREE_CHAIN (t))
7491 return tree_cons (purpose, value, chain);
7498 case TEMPLATE_TYPE_PARM:
7499 case TEMPLATE_TEMPLATE_PARM:
7500 case BOUND_TEMPLATE_TEMPLATE_PARM:
7501 case TEMPLATE_PARM_INDEX:
7503 case REFERENCE_TYPE:
7509 case UNBOUND_CLASS_TEMPLATE:
7512 return tsubst (t, args, complain, in_decl);
7514 case IDENTIFIER_NODE:
7515 if (IDENTIFIER_TYPENAME_P (t))
7517 tree new_type = tsubst (TREE_TYPE (t), args, complain, in_decl);
7518 return mangle_conv_op_name_for_type (new_type);
7525 r = build_constructor
7526 (tsubst (TREE_TYPE (t), args, complain, in_decl),
7527 tsubst_copy (CONSTRUCTOR_ELTS (t), args, complain, in_decl));
7528 TREE_HAS_CONSTRUCTOR (r) = TREE_HAS_CONSTRUCTOR (t);
7533 return build_x_va_arg (tsubst_copy (TREE_OPERAND (t, 0), args, complain,
7535 tsubst (TREE_TYPE (t), args, complain, in_decl));
7542 /* Like tsubst_copy for expressions, etc. but also does semantic
7546 tsubst_expr (tree t, tree args, tsubst_flags_t complain, tree in_decl)
7550 if (t == NULL_TREE || t == error_mark_node)
7553 if (processing_template_decl)
7554 return tsubst_copy (t, args, complain, in_decl);
7556 if (!STATEMENT_CODE_P (TREE_CODE (t)))
7557 return tsubst_copy_and_build (t, args, complain, in_decl,
7558 /*function_p=*/false);
7560 switch (TREE_CODE (t))
7562 case CTOR_INITIALIZER:
7564 finish_mem_initializers (tsubst_initializer_list
7565 (TREE_OPERAND (t, 0), args));
7570 finish_return_stmt (tsubst_expr (RETURN_STMT_EXPR (t),
7571 args, complain, in_decl));
7576 finish_expr_stmt (tsubst_expr (EXPR_STMT_EXPR (t),
7577 args, complain, in_decl));
7582 do_using_directive (tsubst_expr (USING_STMT_NAMESPACE (t),
7583 args, complain, in_decl));
7592 decl = DECL_STMT_DECL (t);
7593 if (TREE_CODE (decl) == LABEL_DECL)
7594 finish_label_decl (DECL_NAME (decl));
7595 else if (TREE_CODE (decl) == USING_DECL)
7597 tree scope = DECL_INITIAL (decl);
7598 tree name = DECL_NAME (decl);
7601 scope = tsubst_expr (scope, args, complain, in_decl);
7602 decl = lookup_qualified_name (scope, name,
7603 /*is_type_p=*/0, /*complain=*/false);
7604 if (decl == error_mark_node)
7605 qualified_name_lookup_error (scope, name);
7607 do_local_using_decl (decl);
7611 init = DECL_INITIAL (decl);
7612 decl = tsubst (decl, args, complain, in_decl);
7613 if (decl != error_mark_node)
7616 DECL_INITIAL (decl) = error_mark_node;
7617 /* By marking the declaration as instantiated, we avoid
7618 trying to instantiate it. Since instantiate_decl can't
7619 handle local variables, and since we've already done
7620 all that needs to be done, that's the right thing to
7622 if (TREE_CODE (decl) == VAR_DECL)
7623 DECL_TEMPLATE_INSTANTIATED (decl) = 1;
7624 if (TREE_CODE (decl) == VAR_DECL
7625 && ANON_AGGR_TYPE_P (TREE_TYPE (decl)))
7626 /* Anonymous aggregates are a special case. */
7627 finish_anon_union (decl);
7630 maybe_push_decl (decl);
7631 if (TREE_CODE (decl) == VAR_DECL
7632 && DECL_PRETTY_FUNCTION_P (decl))
7634 /* For __PRETTY_FUNCTION__ we have to adjust the
7636 const char *const name
7637 = cxx_printable_name (current_function_decl, 2);
7638 init = cp_fname_init (name);
7639 TREE_TYPE (decl) = TREE_TYPE (init);
7642 init = tsubst_expr (init, args, complain, in_decl);
7643 cp_finish_decl (decl, init, NULL_TREE, 0);
7648 /* A DECL_STMT can also be used as an expression, in the condition
7649 clause of an if/for/while construct. If we aren't followed by
7650 another statement, return our decl. */
7651 if (TREE_CHAIN (t) == NULL_TREE)
7660 stmt = begin_for_stmt ();
7661 tsubst_expr (FOR_INIT_STMT (t), args, complain, in_decl);
7662 finish_for_init_stmt (stmt);
7663 finish_for_cond (tsubst_expr (FOR_COND (t),
7664 args, complain, in_decl),
7666 tmp = tsubst_expr (FOR_EXPR (t), args, complain, in_decl);
7667 finish_for_expr (tmp, stmt);
7668 tsubst_expr (FOR_BODY (t), args, complain, in_decl);
7669 finish_for_stmt (stmt);
7676 stmt = begin_while_stmt ();
7677 finish_while_stmt_cond (tsubst_expr (WHILE_COND (t),
7678 args, complain, in_decl),
7680 tsubst_expr (WHILE_BODY (t), args, complain, in_decl);
7681 finish_while_stmt (stmt);
7688 stmt = begin_do_stmt ();
7689 tsubst_expr (DO_BODY (t), args, complain, in_decl);
7690 finish_do_body (stmt);
7691 finish_do_stmt (tsubst_expr (DO_COND (t),
7692 args, complain, in_decl),
7700 stmt = begin_if_stmt ();
7701 finish_if_stmt_cond (tsubst_expr (IF_COND (t),
7702 args, complain, in_decl),
7705 if (tmp = THEN_CLAUSE (t), tmp)
7707 tsubst_expr (tmp, args, complain, in_decl);
7708 finish_then_clause (stmt);
7711 if (tmp = ELSE_CLAUSE (t), tmp)
7713 begin_else_clause ();
7714 tsubst_expr (tmp, args, complain, in_decl);
7715 finish_else_clause (stmt);
7725 if (COMPOUND_STMT_BODY_BLOCK (t))
7726 stmt = begin_function_body ();
7728 stmt = begin_compound_stmt (COMPOUND_STMT_NO_SCOPE (t));
7730 tsubst_expr (COMPOUND_BODY (t), args, complain, in_decl);
7732 if (COMPOUND_STMT_BODY_BLOCK (t))
7733 finish_function_body (stmt);
7735 finish_compound_stmt (stmt);
7741 finish_break_stmt ();
7746 finish_continue_stmt ();
7754 stmt = begin_switch_stmt ();
7755 val = tsubst_expr (SWITCH_COND (t), args, complain, in_decl);
7756 finish_switch_cond (val, stmt);
7757 tsubst_expr (SWITCH_BODY (t), args, complain, in_decl);
7758 finish_switch_stmt (stmt);
7764 finish_case_label (tsubst_expr (CASE_LOW (t), args, complain, in_decl),
7765 tsubst_expr (CASE_HIGH (t), args, complain,
7770 input_line = STMT_LINENO (t);
7771 finish_label_stmt (DECL_NAME (LABEL_STMT_LABEL (t)));
7775 input_filename = FILE_STMT_FILENAME (t);
7776 add_stmt (build_nt (FILE_STMT, FILE_STMT_FILENAME_NODE (t)));
7781 tmp = GOTO_DESTINATION (t);
7782 if (TREE_CODE (tmp) != LABEL_DECL)
7783 /* Computed goto's must be tsubst'd into. On the other hand,
7784 non-computed gotos must not be; the identifier in question
7785 will have no binding. */
7786 tmp = tsubst_expr (tmp, args, complain, in_decl);
7788 tmp = DECL_NAME (tmp);
7789 finish_goto_stmt (tmp);
7794 tmp = finish_asm_stmt
7796 tsubst_expr (ASM_STRING (t), args, complain, in_decl),
7797 tsubst_expr (ASM_OUTPUTS (t), args, complain, in_decl),
7798 tsubst_expr (ASM_INPUTS (t), args, complain, in_decl),
7799 tsubst_expr (ASM_CLOBBERS (t), args, complain, in_decl));
7800 ASM_INPUT_P (tmp) = ASM_INPUT_P (t);
7807 stmt = begin_try_block ();
7808 tsubst_expr (TRY_STMTS (t), args, complain, in_decl);
7809 finish_cleanup_try_block (stmt);
7810 finish_cleanup (tsubst_expr (TRY_HANDLERS (t), args,
7816 if (FN_TRY_BLOCK_P (t))
7817 stmt = begin_function_try_block ();
7819 stmt = begin_try_block ();
7821 tsubst_expr (TRY_STMTS (t), args, complain, in_decl);
7823 if (FN_TRY_BLOCK_P (t))
7824 finish_function_try_block (stmt);
7826 finish_try_block (stmt);
7828 tsubst_expr (TRY_HANDLERS (t), args, complain, in_decl);
7829 if (FN_TRY_BLOCK_P (t))
7830 finish_function_handler_sequence (stmt);
7832 finish_handler_sequence (stmt);
7841 stmt = begin_handler ();
7842 if (HANDLER_PARMS (t))
7844 decl = DECL_STMT_DECL (HANDLER_PARMS (t));
7845 decl = tsubst (decl, args, complain, in_decl);
7846 /* Prevent instantiate_decl from trying to instantiate
7847 this variable. We've already done all that needs to be
7849 DECL_TEMPLATE_INSTANTIATED (decl) = 1;
7853 finish_handler_parms (decl, stmt);
7854 tsubst_expr (HANDLER_BODY (t), args, complain, in_decl);
7855 finish_handler (stmt);
7861 tsubst (TREE_TYPE (t), args, complain, NULL_TREE);
7868 return tsubst_expr (TREE_CHAIN (t), args, complain, in_decl);
7871 /* T is a postfix-expression that is not being used in a function
7872 call. Return the substituted version of T. */
7875 tsubst_non_call_postfix_expression (tree t, tree args,
7876 tsubst_flags_t complain,
7879 if (TREE_CODE (t) == SCOPE_REF)
7880 t = tsubst_qualified_id (t, args, complain, in_decl,
7881 /*done=*/false, /*address_p=*/false);
7883 t = tsubst_copy_and_build (t, args, complain, in_decl,
7884 /*function_p=*/false);
7889 /* Like tsubst but deals with expressions and performs semantic
7890 analysis. FUNCTION_P is true if T is the "F" in "F (ARGS)". */
7893 tsubst_copy_and_build (tree t,
7895 tsubst_flags_t complain,
7899 #define RECUR(NODE) \
7900 tsubst_copy_and_build (NODE, args, complain, in_decl, /*function_p=*/false)
7904 if (t == NULL_TREE || t == error_mark_node)
7907 switch (TREE_CODE (t))
7909 case IDENTIFIER_NODE:
7913 tree qualifying_class;
7914 bool non_constant_expression_p;
7915 const char *error_msg;
7917 if (IDENTIFIER_TYPENAME_P (t))
7919 tree new_type = tsubst (TREE_TYPE (t), args, complain, in_decl);
7920 t = mangle_conv_op_name_for_type (new_type);
7923 /* Look up the name. */
7924 decl = lookup_name (t, 0);
7926 /* By convention, expressions use ERROR_MARK_NODE to indicate
7927 failure, not NULL_TREE. */
7928 if (decl == NULL_TREE)
7929 decl = error_mark_node;
7931 decl = finish_id_expression (t, decl, NULL_TREE,
7934 /*constant_expression_p=*/false,
7935 /*allow_non_constant_expression_p=*/false,
7936 &non_constant_expression_p,
7940 if (!function_p && TREE_CODE (decl) == IDENTIFIER_NODE)
7941 decl = unqualified_name_lookup_error (decl);
7945 case TEMPLATE_ID_EXPR:
7948 tree template = RECUR (TREE_OPERAND (t, 0));
7949 tree targs = RECUR (TREE_OPERAND (t, 1));
7951 if (TREE_CODE (template) == COMPONENT_REF)
7953 object = TREE_OPERAND (template, 0);
7954 template = TREE_OPERAND (template, 1);
7958 template = lookup_template_function (template, targs);
7961 return build (COMPONENT_REF, TREE_TYPE (template),
7968 return build_x_indirect_ref (RECUR (TREE_OPERAND (t, 0)), "unary *");
7971 return build_functional_cast
7972 (tsubst (TREE_TYPE (t), args, complain, in_decl),
7973 RECUR (TREE_OPERAND (t, 0)));
7975 case REINTERPRET_CAST_EXPR:
7976 return build_reinterpret_cast
7977 (tsubst (TREE_TYPE (t), args, complain, in_decl),
7978 RECUR (TREE_OPERAND (t, 0)));
7980 case CONST_CAST_EXPR:
7981 return build_const_cast
7982 (tsubst (TREE_TYPE (t), args, complain, in_decl),
7983 RECUR (TREE_OPERAND (t, 0)));
7985 case DYNAMIC_CAST_EXPR:
7986 return build_dynamic_cast
7987 (tsubst (TREE_TYPE (t), args, complain, in_decl),
7988 RECUR (TREE_OPERAND (t, 0)));
7990 case STATIC_CAST_EXPR:
7991 return build_static_cast
7992 (tsubst (TREE_TYPE (t), args, complain, in_decl),
7993 RECUR (TREE_OPERAND (t, 0)));
7995 case POSTDECREMENT_EXPR:
7996 case POSTINCREMENT_EXPR:
7997 op1 = tsubst_non_call_postfix_expression (TREE_OPERAND (t, 0),
7998 args, complain, in_decl);
7999 return build_x_unary_op (TREE_CODE (t), op1);
8001 case PREDECREMENT_EXPR:
8002 case PREINCREMENT_EXPR:
8006 case TRUTH_NOT_EXPR:
8007 case CONVERT_EXPR: /* Unary + */
8010 return build_x_unary_op (TREE_CODE (t), RECUR (TREE_OPERAND (t, 0)));
8013 op1 = TREE_OPERAND (t, 0);
8014 if (TREE_CODE (op1) == SCOPE_REF)
8015 op1 = tsubst_qualified_id (op1, args, complain, in_decl,
8016 /*done=*/true, /*address_p=*/true);
8018 op1 = tsubst_non_call_postfix_expression (op1, args, complain,
8020 return build_x_unary_op (ADDR_EXPR, op1);
8025 case TRUNC_DIV_EXPR:
8027 case FLOOR_DIV_EXPR:
8028 case ROUND_DIV_EXPR:
8029 case EXACT_DIV_EXPR:
8031 case BIT_ANDTC_EXPR:
8034 case TRUNC_MOD_EXPR:
8035 case FLOOR_MOD_EXPR:
8036 case TRUTH_ANDIF_EXPR:
8037 case TRUTH_ORIF_EXPR:
8038 case TRUTH_AND_EXPR:
8054 return build_x_binary_op
8056 RECUR (TREE_OPERAND (t, 0)),
8057 RECUR (TREE_OPERAND (t, 1)));
8060 return tsubst_qualified_id (t, args, complain, in_decl, /*done=*/true,
8061 /*address_p=*/false);
8064 if (tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl)
8067 return build_nt (ARRAY_REF, NULL_TREE, RECUR (TREE_OPERAND (t, 1)));
8069 op1 = tsubst_non_call_postfix_expression (TREE_OPERAND (t, 0),
8070 args, complain, in_decl);
8071 /* Remember that there was a reference to this entity. */
8074 return grok_array_decl (op1, RECUR (TREE_OPERAND (t, 1)));
8078 op1 = TREE_OPERAND (t, 0);
8081 /* When there are no ARGS, we are trying to evaluate a
8082 non-dependent expression from the parser. Trying to do
8083 the substitutions may not work. */
8085 op1 = TREE_TYPE (op1);
8093 if (TREE_CODE (t) == SIZEOF_EXPR)
8094 return finish_sizeof (op1);
8096 return finish_alignof (op1);
8099 return build_x_modify_expr
8100 (RECUR (TREE_OPERAND (t, 0)),
8101 TREE_CODE (TREE_OPERAND (t, 1)),
8102 RECUR (TREE_OPERAND (t, 2)));
8105 op1 = tsubst_non_call_postfix_expression (TREE_OPERAND (t, 0),
8106 args, complain, in_decl);
8107 /* Remember that there was a reference to this entity. */
8110 return build_x_arrow (op1);
8114 (RECUR (TREE_OPERAND (t, 0)),
8115 RECUR (TREE_OPERAND (t, 1)),
8116 RECUR (TREE_OPERAND (t, 2)),
8117 NEW_EXPR_USE_GLOBAL (t));
8120 return delete_sanity
8121 (RECUR (TREE_OPERAND (t, 0)),
8122 RECUR (TREE_OPERAND (t, 1)),
8123 DELETE_EXPR_USE_VEC (t),
8124 DELETE_EXPR_USE_GLOBAL (t));
8127 return build_x_compound_expr (RECUR (TREE_OPERAND (t, 0)),
8128 RECUR (TREE_OPERAND (t, 1)));
8136 function = TREE_OPERAND (t, 0);
8137 if (TREE_CODE (function) == SCOPE_REF)
8140 function = tsubst_qualified_id (function, args, complain, in_decl,
8142 /*address_p=*/false);
8146 qualified_p = (TREE_CODE (function) == COMPONENT_REF
8147 && (TREE_CODE (TREE_OPERAND (function, 1))
8149 function = tsubst_copy_and_build (function, args, complain,
8154 call_args = RECUR (TREE_OPERAND (t, 1));
8156 if (BASELINK_P (function))
8160 && TREE_CODE (function) != TEMPLATE_ID_EXPR
8161 && (is_overloaded_fn (function)
8162 || DECL_P (function)
8163 || TREE_CODE (function) == IDENTIFIER_NODE))
8166 function = perform_koenig_lookup (function, call_args);
8167 else if (TREE_CODE (function) == IDENTIFIER_NODE)
8168 function = unqualified_name_lookup_error (function);
8171 /* Remember that there was a reference to this entity. */
8172 if (DECL_P (function))
8173 mark_used (function);
8175 function = convert_from_reference (function);
8177 if (TREE_CODE (function) == OFFSET_REF)
8178 return build_offset_ref_call_from_tree (function, call_args);
8179 if (TREE_CODE (function) == COMPONENT_REF)
8180 return (build_new_method_call
8181 (TREE_OPERAND (function, 0),
8182 TREE_OPERAND (function, 1),
8183 call_args, NULL_TREE,
8184 qualified_p ? LOOKUP_NONVIRTUAL : LOOKUP_NORMAL));
8185 return finish_call_expr (function, call_args,
8186 /*disallow_virtual=*/qualified_p);
8190 return build_x_conditional_expr
8191 (RECUR (TREE_OPERAND (t, 0)),
8192 RECUR (TREE_OPERAND (t, 1)),
8193 RECUR (TREE_OPERAND (t, 2)));
8195 case PSEUDO_DTOR_EXPR:
8196 return finish_pseudo_destructor_expr
8197 (RECUR (TREE_OPERAND (t, 0)),
8198 RECUR (TREE_OPERAND (t, 1)),
8199 RECUR (TREE_OPERAND (t, 2)));
8203 tree purpose, value, chain;
8205 if (t == void_list_node)
8208 purpose = TREE_PURPOSE (t);
8210 purpose = RECUR (purpose);
8211 value = TREE_VALUE (t);
8213 value = RECUR (value);
8214 chain = TREE_CHAIN (t);
8215 if (chain && chain != void_type_node)
8216 chain = RECUR (chain);
8217 if (purpose == TREE_PURPOSE (t)
8218 && value == TREE_VALUE (t)
8219 && chain == TREE_CHAIN (t))
8221 return tree_cons (purpose, value, chain);
8229 object = tsubst_non_call_postfix_expression (TREE_OPERAND (t, 0),
8230 args, complain, in_decl);
8231 /* Remember that there was a reference to this entity. */
8232 if (DECL_P (object))
8235 member = TREE_OPERAND (t, 1);
8236 if (BASELINK_P (member))
8237 member = tsubst_baselink (member,
8238 non_reference (TREE_TYPE (object)),
8239 args, complain, in_decl);
8241 member = tsubst_copy (member, args, complain, in_decl);
8243 if (!CLASS_TYPE_P (TREE_TYPE (object)))
8245 if (TREE_CODE (member) == BIT_NOT_EXPR)
8246 return finish_pseudo_destructor_expr (object,
8248 TREE_TYPE (object));
8249 else if (TREE_CODE (member) == SCOPE_REF
8250 && (TREE_CODE (TREE_OPERAND (member, 1)) == BIT_NOT_EXPR))
8251 return finish_pseudo_destructor_expr (object,
8253 TREE_TYPE (object));
8255 else if (TREE_CODE (member) == SCOPE_REF
8256 && TREE_CODE (TREE_OPERAND (member, 1)) == TEMPLATE_ID_EXPR)
8261 /* Lookup the template functions now that we know what the
8263 tmpl = TREE_OPERAND (TREE_OPERAND (member, 1), 0);
8264 args = TREE_OPERAND (TREE_OPERAND (member, 1), 1);
8265 member = lookup_qualified_name (TREE_OPERAND (member, 0), tmpl,
8266 /*is_type=*/0, /*complain=*/false);
8267 if (BASELINK_P (member))
8268 BASELINK_FUNCTIONS (member)
8269 = build_nt (TEMPLATE_ID_EXPR, BASELINK_FUNCTIONS (member),
8273 qualified_name_lookup_error (TREE_TYPE (object), tmpl);
8274 return error_mark_node;
8277 else if (TREE_CODE (member) == FIELD_DECL)
8278 return finish_non_static_data_member (member, object, NULL_TREE);
8280 return finish_class_member_access_expr (object, member);
8285 (RECUR (TREE_OPERAND (t, 0)));
8291 tree type = tsubst (TREE_TYPE (t), args, complain, in_decl);
8294 /* digest_init will do the wrong thing if we let it. */
8295 if (type && TYPE_PTRMEMFUNC_P (type))
8299 /* We do not want to process the purpose of aggregate
8300 initializers as they are identifier nodes which will be
8301 looked up by digest_init. */
8302 purpose_p = !(type && IS_AGGR_TYPE (type));
8303 for (elts = CONSTRUCTOR_ELTS (t);
8305 elts = TREE_CHAIN (elts))
8307 tree purpose = TREE_PURPOSE (elts);
8308 tree value = TREE_VALUE (elts);
8310 if (purpose && purpose_p)
8311 purpose = RECUR (purpose);
8312 value = RECUR (value);
8313 r = tree_cons (purpose, value, r);
8316 r = build_constructor (NULL_TREE, nreverse (r));
8317 TREE_HAS_CONSTRUCTOR (r) = TREE_HAS_CONSTRUCTOR (t);
8320 return digest_init (type, r, 0);
8326 tree operand_0 = RECUR (TREE_OPERAND (t, 0));
8327 if (TYPE_P (operand_0))
8328 return get_typeid (operand_0);
8329 return build_typeid (operand_0);
8333 return convert_from_reference (tsubst_copy (t, args, complain, in_decl));
8337 t = tsubst_copy (t, args, complain, in_decl);
8339 /* If there are no ARGS, then we are evaluating a
8340 non-dependent expression. If the expression is
8341 non-dependent, the variable must be a constant. */
8342 t = DECL_INITIAL (t);
8343 return convert_from_reference (t);
8346 return build_x_va_arg (RECUR (TREE_OPERAND (t, 0)),
8347 tsubst_copy (TREE_TYPE (t), args, complain,
8351 return tsubst_copy (t, args, complain, in_decl);
8357 /* Verify that the instantiated ARGS are valid. For type arguments,
8358 make sure that the type's linkage is ok. For non-type arguments,
8359 make sure they are constants if they are integral or enumerations.
8360 Emit an error under control of COMPLAIN, and return TRUE on error. */
8363 check_instantiated_args (tree tmpl, tree args, tsubst_flags_t complain)
8365 int ix, len = DECL_NTPARMS (tmpl);
8366 bool result = false;
8368 for (ix = 0; ix != len; ix++)
8370 tree t = TREE_VEC_ELT (args, ix);
8374 /* [basic.link]: A name with no linkage (notably, the name
8375 of a class or enumeration declared in a local scope)
8376 shall not be used to declare an entity with linkage.
8377 This implies that names with no linkage cannot be used as
8378 template arguments. */
8379 tree nt = no_linkage_check (t);
8383 if (!(complain & tf_error))
8385 else if (TYPE_ANONYMOUS_P (nt))
8386 error ("`%T' uses anonymous type", t);
8388 error ("`%T' uses local type `%T'", t, nt);
8391 /* In order to avoid all sorts of complications, we do not
8392 allow variably-modified types as template arguments. */
8393 else if (variably_modified_type_p (t))
8395 if (complain & tf_error)
8396 error ("`%T' is a variably modified type", t);
8400 /* A non-type argument of integral or enumerated type must be a
8402 else if (TREE_TYPE (t)
8403 && INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (t))
8404 && !TREE_CONSTANT (t))
8406 if (complain & tf_error)
8407 error ("integral expression `%E' is not constant", t);
8411 if (result && complain & tf_error)
8412 error (" trying to instantiate `%D'", tmpl);
8416 /* Instantiate the indicated variable or function template TMPL with
8417 the template arguments in TARG_PTR. */
8420 instantiate_template (tree tmpl, tree targ_ptr, tsubst_flags_t complain)
8426 if (tmpl == error_mark_node)
8427 return error_mark_node;
8429 my_friendly_assert (TREE_CODE (tmpl) == TEMPLATE_DECL, 283);
8431 /* If this function is a clone, handle it specially. */
8432 if (DECL_CLONED_FUNCTION_P (tmpl))
8434 tree spec = instantiate_template (DECL_CLONED_FUNCTION (tmpl), targ_ptr,
8438 /* Look for the clone. */
8439 for (clone = TREE_CHAIN (spec);
8440 clone && DECL_CLONED_FUNCTION_P (clone);
8441 clone = TREE_CHAIN (clone))
8442 if (DECL_NAME (clone) == DECL_NAME (tmpl))
8444 /* We should always have found the clone by now. */
8449 /* Check to see if we already have this specialization. */
8450 spec = retrieve_specialization (tmpl, targ_ptr);
8451 if (spec != NULL_TREE)
8454 gen_tmpl = most_general_template (tmpl);
8455 if (tmpl != gen_tmpl)
8457 /* The TMPL is a partial instantiation. To get a full set of
8458 arguments we must add the arguments used to perform the
8459 partial instantiation. */
8460 targ_ptr = add_outermost_template_args (DECL_TI_ARGS (tmpl),
8463 /* Check to see if we already have this specialization. */
8464 spec = retrieve_specialization (gen_tmpl, targ_ptr);
8465 if (spec != NULL_TREE)
8469 if (check_instantiated_args (gen_tmpl, INNERMOST_TEMPLATE_ARGS (targ_ptr),
8471 return error_mark_node;
8473 /* We are building a FUNCTION_DECL, during which the access of its
8474 parameters and return types have to be checked. However this
8475 FUNCTION_DECL which is the desired context for access checking
8476 is not built yet. We solve this chicken-and-egg problem by
8477 deferring all checks until we have the FUNCTION_DECL. */
8478 push_deferring_access_checks (dk_deferred);
8480 /* substitute template parameters */
8481 fndecl = tsubst (DECL_TEMPLATE_RESULT (gen_tmpl),
8482 targ_ptr, complain, gen_tmpl);
8484 /* Now we know the specialization, compute access previously
8486 push_access_scope (fndecl);
8487 perform_deferred_access_checks ();
8488 pop_access_scope (fndecl);
8489 pop_deferring_access_checks ();
8491 /* The DECL_TI_TEMPLATE should always be the immediate parent
8492 template, not the most general template. */
8493 DECL_TI_TEMPLATE (fndecl) = tmpl;
8495 if (flag_external_templates)
8496 add_pending_template (fndecl);
8498 /* If we've just instantiated the main entry point for a function,
8499 instantiate all the alternate entry points as well. We do this
8500 by cloning the instantiation of the main entry point, not by
8501 instantiating the template clones. */
8502 if (TREE_CHAIN (gen_tmpl) && DECL_CLONED_FUNCTION_P (TREE_CHAIN (gen_tmpl)))
8503 clone_function_decl (fndecl, /*update_method_vec_p=*/0);
8508 /* The FN is a TEMPLATE_DECL for a function. The ARGS are the
8509 arguments that are being used when calling it. TARGS is a vector
8510 into which the deduced template arguments are placed.
8512 Return zero for success, 2 for an incomplete match that doesn't resolve
8513 all the types, and 1 for complete failure. An error message will be
8514 printed only for an incomplete match.
8516 If FN is a conversion operator, or we are trying to produce a specific
8517 specialization, RETURN_TYPE is the return type desired.
8519 The EXPLICIT_TARGS are explicit template arguments provided via a
8522 The parameter STRICT is one of:
8525 We are deducing arguments for a function call, as in
8529 We are deducing arguments for a conversion function, as in
8533 We are deducing arguments when doing an explicit instantiation
8534 as in [temp.explicit], when determining an explicit specialization
8535 as in [temp.expl.spec], or when taking the address of a function
8536 template, as in [temp.deduct.funcaddr].
8539 We are deducing arguments when calculating the partial
8540 ordering between specializations of function or class
8541 templates, as in [temp.func.order] and [temp.class.order].
8543 LEN is the number of parms to consider before returning success, or -1
8544 for all. This is used in partial ordering to avoid comparing parms for
8545 which no actual argument was passed, since they are not considered in
8546 overload resolution (and are explicitly excluded from consideration in
8547 partial ordering in [temp.func.order]/6). */
8550 fn_type_unification (tree fn,
8551 tree explicit_targs,
8555 unification_kind_t strict,
8562 my_friendly_assert (TREE_CODE (fn) == TEMPLATE_DECL, 0);
8564 fntype = TREE_TYPE (fn);
8569 The specified template arguments must match the template
8570 parameters in kind (i.e., type, nontype, template), and there
8571 must not be more arguments than there are parameters;
8572 otherwise type deduction fails.
8574 Nontype arguments must match the types of the corresponding
8575 nontype template parameters, or must be convertible to the
8576 types of the corresponding nontype parameters as specified in
8577 _temp.arg.nontype_, otherwise type deduction fails.
8579 All references in the function type of the function template
8580 to the corresponding template parameters are replaced by the
8581 specified template argument values. If a substitution in a
8582 template parameter or in the function type of the function
8583 template results in an invalid type, type deduction fails. */
8585 tree converted_args;
8588 = (coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn),
8589 explicit_targs, NULL_TREE, tf_none,
8590 /*require_all_arguments=*/0));
8591 if (converted_args == error_mark_node)
8594 fntype = tsubst (fntype, converted_args, tf_none, NULL_TREE);
8595 if (fntype == error_mark_node)
8598 /* Place the explicitly specified arguments in TARGS. */
8599 for (i = 0; i < TREE_VEC_LENGTH (targs); i++)
8600 TREE_VEC_ELT (targs, i) = TREE_VEC_ELT (converted_args, i);
8603 parms = TYPE_ARG_TYPES (fntype);
8604 /* Never do unification on the 'this' parameter. */
8605 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn))
8606 parms = TREE_CHAIN (parms);
8610 /* We've been given a return type to match, prepend it. */
8611 parms = tree_cons (NULL_TREE, TREE_TYPE (fntype), parms);
8612 args = tree_cons (NULL_TREE, return_type, args);
8617 /* We allow incomplete unification without an error message here
8618 because the standard doesn't seem to explicitly prohibit it. Our
8619 callers must be ready to deal with unification failures in any
8621 result = type_unification_real (DECL_INNERMOST_TEMPLATE_PARMS (fn),
8622 targs, parms, args, /*subr=*/0,
8623 strict, /*allow_incomplete*/1, len);
8626 /* All is well so far. Now, check:
8630 When all template arguments have been deduced, all uses of
8631 template parameters in nondeduced contexts are replaced with
8632 the corresponding deduced argument values. If the
8633 substitution results in an invalid type, as described above,
8634 type deduction fails. */
8635 if (tsubst (TREE_TYPE (fn), targs, tf_none, NULL_TREE)
8642 /* Adjust types before performing type deduction, as described in
8643 [temp.deduct.call] and [temp.deduct.conv]. The rules in these two
8644 sections are symmetric. PARM is the type of a function parameter
8645 or the return type of the conversion function. ARG is the type of
8646 the argument passed to the call, or the type of the value
8647 initialized with the result of the conversion function. */
8650 maybe_adjust_types_for_deduction (unification_kind_t strict,
8663 /* Swap PARM and ARG throughout the remainder of this
8664 function; the handling is precisely symmetric since PARM
8665 will initialize ARG rather than vice versa. */
8673 /* There is nothing to do in this case. */
8677 /* DR 214. [temp.func.order] is underspecified, and leads to no
8678 ordering between things like `T *' and `T const &' for `U *'.
8679 The former has T=U and the latter T=U*. The former looks more
8680 specialized and John Spicer considers it well-formed (the EDG
8681 compiler accepts it).
8683 John also confirms that deduction should proceed as in a function
8684 call. Which implies the usual ARG and PARM conversions as DEDUCE_CALL.
8685 However, in ordering, ARG can have REFERENCE_TYPE, but no argument
8686 to an actual call can have such a type.
8688 If both ARG and PARM are REFERENCE_TYPE, we change neither.
8689 If only ARG is a REFERENCE_TYPE, we look through that and then
8690 proceed as with DEDUCE_CALL (which could further convert it). */
8691 if (TREE_CODE (*arg) == REFERENCE_TYPE)
8693 if (TREE_CODE (*parm) == REFERENCE_TYPE)
8695 *arg = TREE_TYPE (*arg);
8702 if (TREE_CODE (*parm) != REFERENCE_TYPE)
8704 /* [temp.deduct.call]
8706 If P is not a reference type:
8708 --If A is an array type, the pointer type produced by the
8709 array-to-pointer standard conversion (_conv.array_) is
8710 used in place of A for type deduction; otherwise,
8712 --If A is a function type, the pointer type produced by
8713 the function-to-pointer standard conversion
8714 (_conv.func_) is used in place of A for type deduction;
8717 --If A is a cv-qualified type, the top level
8718 cv-qualifiers of A's type are ignored for type
8720 if (TREE_CODE (*arg) == ARRAY_TYPE)
8721 *arg = build_pointer_type (TREE_TYPE (*arg));
8722 else if (TREE_CODE (*arg) == FUNCTION_TYPE)
8723 *arg = build_pointer_type (*arg);
8725 *arg = TYPE_MAIN_VARIANT (*arg);
8728 /* [temp.deduct.call]
8730 If P is a cv-qualified type, the top level cv-qualifiers
8731 of P's type are ignored for type deduction. If P is a
8732 reference type, the type referred to by P is used for
8734 *parm = TYPE_MAIN_VARIANT (*parm);
8735 if (TREE_CODE (*parm) == REFERENCE_TYPE)
8737 *parm = TREE_TYPE (*parm);
8738 result |= UNIFY_ALLOW_OUTER_MORE_CV_QUAL;
8741 /* DR 322. For conversion deduction, remove a reference type on parm
8742 too (which has been swapped into ARG). */
8743 if (strict == DEDUCE_CONV && TREE_CODE (*arg) == REFERENCE_TYPE)
8744 *arg = TREE_TYPE (*arg);
8749 /* Most parms like fn_type_unification.
8751 If SUBR is 1, we're being called recursively (to unify the
8752 arguments of a function or method parameter of a function
8756 type_unification_real (tree tparms,
8761 unification_kind_t strict,
8762 int allow_incomplete,
8767 int ntparms = TREE_VEC_LENGTH (tparms);
8769 int saw_undeduced = 0;
8773 my_friendly_assert (TREE_CODE (tparms) == TREE_VEC, 289);
8774 my_friendly_assert (xparms == NULL_TREE
8775 || TREE_CODE (xparms) == TREE_LIST, 290);
8776 /* ARGS could be NULL. */
8778 my_friendly_assert (TREE_CODE (xargs) == TREE_LIST, 291);
8779 my_friendly_assert (ntparms > 0, 292);
8784 sub_strict = (UNIFY_ALLOW_OUTER_LEVEL | UNIFY_ALLOW_MORE_CV_QUAL
8785 | UNIFY_ALLOW_DERIVED);
8789 sub_strict = UNIFY_ALLOW_LESS_CV_QUAL;
8793 sub_strict = UNIFY_ALLOW_NONE;
8797 sub_strict = UNIFY_ALLOW_NONE;
8813 && parms != void_list_node
8815 && args != void_list_node)
8817 parm = TREE_VALUE (parms);
8818 parms = TREE_CHAIN (parms);
8819 arg = TREE_VALUE (args);
8820 args = TREE_CHAIN (args);
8822 if (arg == error_mark_node)
8824 if (arg == unknown_type_node)
8825 /* We can't deduce anything from this, but we might get all the
8826 template args from other function args. */
8829 /* Conversions will be performed on a function argument that
8830 corresponds with a function parameter that contains only
8831 non-deducible template parameters and explicitly specified
8832 template parameters. */
8833 if (! uses_template_parms (parm))
8838 type = TREE_TYPE (arg);
8845 if (strict == DEDUCE_EXACT || strict == DEDUCE_ORDER)
8847 if (same_type_p (parm, type))
8851 /* It might work; we shouldn't check now, because we might
8852 get into infinite recursion. Overload resolution will
8861 my_friendly_assert (TREE_TYPE (arg) != NULL_TREE, 293);
8862 if (type_unknown_p (arg))
8864 /* [temp.deduct.type] A template-argument can be deduced from
8865 a pointer to function or pointer to member function
8866 argument if the set of overloaded functions does not
8867 contain function templates and at most one of a set of
8868 overloaded functions provides a unique match. */
8870 if (resolve_overloaded_unification
8871 (tparms, targs, parm, arg, strict, sub_strict)
8876 arg = TREE_TYPE (arg);
8877 if (arg == error_mark_node)
8882 int arg_strict = sub_strict;
8885 arg_strict |= maybe_adjust_types_for_deduction (strict, &parm, &arg);
8887 if (unify (tparms, targs, parm, arg, arg_strict))
8891 /* Are we done with the interesting parms? */
8895 /* Fail if we've reached the end of the parm list, and more args
8896 are present, and the parm list isn't variadic. */
8897 if (args && args != void_list_node && parms == void_list_node)
8899 /* Fail if parms are left and they don't have default values. */
8901 && parms != void_list_node
8902 && TREE_PURPOSE (parms) == NULL_TREE)
8907 for (i = 0; i < ntparms; i++)
8908 if (TREE_VEC_ELT (targs, i) == NULL_TREE)
8910 tree tparm = TREE_VALUE (TREE_VEC_ELT (tparms, i));
8912 /* If this is an undeduced nontype parameter that depends on
8913 a type parameter, try another pass; its type may have been
8914 deduced from a later argument than the one from which
8915 this parameter can be deduced. */
8916 if (TREE_CODE (tparm) == PARM_DECL
8917 && uses_template_parms (TREE_TYPE (tparm))
8918 && !saw_undeduced++)
8921 if (!allow_incomplete)
8922 error ("incomplete type unification");
8928 /* Subroutine of type_unification_real. Args are like the variables at the
8929 call site. ARG is an overloaded function (or template-id); we try
8930 deducing template args from each of the overloads, and if only one
8931 succeeds, we go with that. Modifies TARGS and returns 0 on success. */
8934 resolve_overloaded_unification (tree tparms,
8938 unification_kind_t strict,
8941 tree tempargs = copy_node (targs);
8944 if (TREE_CODE (arg) == ADDR_EXPR)
8945 arg = TREE_OPERAND (arg, 0);
8947 if (TREE_CODE (arg) == COMPONENT_REF)
8948 /* Handle `&x' where `x' is some static or non-static member
8950 arg = TREE_OPERAND (arg, 1);
8952 if (TREE_CODE (arg) == OFFSET_REF)
8953 arg = TREE_OPERAND (arg, 1);
8955 /* Strip baselink information. */
8956 if (BASELINK_P (arg))
8957 arg = BASELINK_FUNCTIONS (arg);
8959 if (TREE_CODE (arg) == TEMPLATE_ID_EXPR)
8961 /* If we got some explicit template args, we need to plug them into
8962 the affected templates before we try to unify, in case the
8963 explicit args will completely resolve the templates in question. */
8965 tree expl_subargs = TREE_OPERAND (arg, 1);
8966 arg = TREE_OPERAND (arg, 0);
8968 for (; arg; arg = OVL_NEXT (arg))
8970 tree fn = OVL_CURRENT (arg);
8973 if (TREE_CODE (fn) != TEMPLATE_DECL)
8976 subargs = get_bindings_overload (fn, DECL_TEMPLATE_RESULT (fn),
8980 elem = tsubst (TREE_TYPE (fn), subargs, tf_none, NULL_TREE);
8981 if (TREE_CODE (elem) == METHOD_TYPE)
8982 elem = build_ptrmemfunc_type (build_pointer_type (elem));
8983 good += try_one_overload (tparms, targs, tempargs, parm, elem,
8984 strict, sub_strict);
8988 else if (TREE_CODE (arg) == OVERLOAD
8989 || TREE_CODE (arg) == FUNCTION_DECL)
8991 for (; arg; arg = OVL_NEXT (arg))
8993 tree type = TREE_TYPE (OVL_CURRENT (arg));
8994 if (TREE_CODE (type) == METHOD_TYPE)
8995 type = build_ptrmemfunc_type (build_pointer_type (type));
8996 good += try_one_overload (tparms, targs, tempargs, parm,
8998 strict, sub_strict);
9004 /* [temp.deduct.type] A template-argument can be deduced from a pointer
9005 to function or pointer to member function argument if the set of
9006 overloaded functions does not contain function templates and at most
9007 one of a set of overloaded functions provides a unique match.
9009 So if we found multiple possibilities, we return success but don't
9014 int i = TREE_VEC_LENGTH (targs);
9016 if (TREE_VEC_ELT (tempargs, i))
9017 TREE_VEC_ELT (targs, i) = TREE_VEC_ELT (tempargs, i);
9025 /* Subroutine of resolve_overloaded_unification; does deduction for a single
9026 overload. Fills TARGS with any deduced arguments, or error_mark_node if
9027 different overloads deduce different arguments for a given parm.
9028 Returns 1 on success. */
9031 try_one_overload (tree tparms,
9036 unification_kind_t strict,
9043 /* [temp.deduct.type] A template-argument can be deduced from a pointer
9044 to function or pointer to member function argument if the set of
9045 overloaded functions does not contain function templates and at most
9046 one of a set of overloaded functions provides a unique match.
9048 So if this is a template, just return success. */
9050 if (uses_template_parms (arg))
9053 sub_strict |= maybe_adjust_types_for_deduction (strict, &parm, &arg);
9055 /* We don't copy orig_targs for this because if we have already deduced
9056 some template args from previous args, unify would complain when we
9057 try to deduce a template parameter for the same argument, even though
9058 there isn't really a conflict. */
9059 nargs = TREE_VEC_LENGTH (targs);
9060 tempargs = make_tree_vec (nargs);
9062 if (unify (tparms, tempargs, parm, arg, sub_strict) != 0)
9065 /* First make sure we didn't deduce anything that conflicts with
9066 explicitly specified args. */
9067 for (i = nargs; i--; )
9069 tree elt = TREE_VEC_ELT (tempargs, i);
9070 tree oldelt = TREE_VEC_ELT (orig_targs, i);
9072 if (elt == NULL_TREE)
9074 else if (uses_template_parms (elt))
9076 /* Since we're unifying against ourselves, we will fill in template
9077 args used in the function parm list with our own template parms.
9079 TREE_VEC_ELT (tempargs, i) = NULL_TREE;
9082 else if (oldelt && ! template_args_equal (oldelt, elt))
9086 for (i = nargs; i--; )
9088 tree elt = TREE_VEC_ELT (tempargs, i);
9091 TREE_VEC_ELT (targs, i) = elt;
9097 /* Verify that nondeduce template argument agrees with the type
9098 obtained from argument deduction. Return nonzero if the
9103 struct A { typedef int X; };
9104 template <class T, class U> struct C {};
9105 template <class T> struct C<T, typename T::X> {};
9107 Then with the instantiation `C<A, int>', we can deduce that
9108 `T' is `A' but unify () does not check whether `typename T::X'
9109 is `int'. This function ensure that they agree.
9111 TARGS, PARMS are the same as the arguments of unify.
9112 ARGS contains template arguments from all levels. */
9115 verify_class_unification (tree targs, tree parms, tree args)
9117 parms = tsubst (parms, add_outermost_template_args (args, targs),
9118 tf_none, NULL_TREE);
9119 if (parms == error_mark_node)
9122 return !comp_template_args (parms, INNERMOST_TEMPLATE_ARGS (args));
9125 /* PARM is a template class (perhaps with unbound template
9126 parameters). ARG is a fully instantiated type. If ARG can be
9127 bound to PARM, return ARG, otherwise return NULL_TREE. TPARMS and
9128 TARGS are as for unify. */
9131 try_class_unification (tree tparms, tree targs, tree parm, tree arg)
9135 if (!CLASSTYPE_TEMPLATE_INFO (arg)
9136 || (most_general_template (CLASSTYPE_TI_TEMPLATE (arg))
9137 != most_general_template (CLASSTYPE_TI_TEMPLATE (parm))))
9140 /* We need to make a new template argument vector for the call to
9141 unify. If we used TARGS, we'd clutter it up with the result of
9142 the attempted unification, even if this class didn't work out.
9143 We also don't want to commit ourselves to all the unifications
9144 we've already done, since unification is supposed to be done on
9145 an argument-by-argument basis. In other words, consider the
9146 following pathological case:
9148 template <int I, int J, int K>
9151 template <int I, int J>
9152 struct S<I, J, 2> : public S<I, I, I>, S<J, J, J> {};
9154 template <int I, int J, int K>
9155 void f(S<I, J, K>, S<I, I, I>);
9164 Now, by the time we consider the unification involving `s2', we
9165 already know that we must have `f<0, 0, 0>'. But, even though
9166 `S<0, 1, 2>' is derived from `S<0, 0, 0>', the code is invalid
9167 because there are two ways to unify base classes of S<0, 1, 2>
9168 with S<I, I, I>. If we kept the already deduced knowledge, we
9169 would reject the possibility I=1. */
9170 copy_of_targs = make_tree_vec (TREE_VEC_LENGTH (targs));
9172 /* If unification failed, we're done. */
9173 if (unify (tparms, copy_of_targs, CLASSTYPE_TI_ARGS (parm),
9174 CLASSTYPE_TI_ARGS (arg), UNIFY_ALLOW_NONE))
9180 /* Subroutine of get_template_base. RVAL, if non-NULL, is a base we
9181 have already discovered to be satisfactory. ARG_BINFO is the binfo
9182 for the base class of ARG that we are currently examining. */
9185 get_template_base_recursive (tree tparms,
9194 tree arg = BINFO_TYPE (arg_binfo);
9196 if (!(flags & GTB_IGNORE_TYPE))
9198 tree r = try_class_unification (tparms, targs,
9201 /* If there is more than one satisfactory baseclass, then:
9205 If they yield more than one possible deduced A, the type
9209 if (r && rval && !same_type_p (r, rval))
9210 return error_mark_node;
9215 binfos = BINFO_BASETYPES (arg_binfo);
9216 n_baselinks = binfos ? TREE_VEC_LENGTH (binfos) : 0;
9218 /* Process base types. */
9219 for (i = 0; i < n_baselinks; i++)
9221 tree base_binfo = TREE_VEC_ELT (binfos, i);
9224 /* Skip this base, if we've already seen it. */
9225 if (BINFO_MARKED (base_binfo))
9229 (flags & GTB_VIA_VIRTUAL) || TREE_VIA_VIRTUAL (base_binfo);
9231 /* When searching for a non-virtual, we cannot mark virtually
9234 BINFO_MARKED (base_binfo) = 1;
9236 rval = get_template_base_recursive (tparms, targs,
9240 GTB_VIA_VIRTUAL * this_virtual);
9242 /* If we discovered more than one matching base class, we can
9244 if (rval == error_mark_node)
9245 return error_mark_node;
9251 /* Given a template type PARM and a class type ARG, find the unique
9252 base type in ARG that is an instance of PARM. We do not examine
9253 ARG itself; only its base-classes. If there is no appropriate base
9254 class, return NULL_TREE. If there is more than one, return
9255 error_mark_node. PARM may be the type of a partial specialization,
9256 as well as a plain template type. Used by unify. */
9259 get_template_base (tree tparms, tree targs, tree parm, tree arg)
9264 my_friendly_assert (IS_AGGR_TYPE_CODE (TREE_CODE (arg)), 92);
9266 arg_binfo = TYPE_BINFO (complete_type (arg));
9267 rval = get_template_base_recursive (tparms, targs,
9272 /* Since get_template_base_recursive marks the bases classes, we
9273 must unmark them here. */
9274 dfs_walk (arg_binfo, dfs_unmark, markedp, 0);
9279 /* Returns the level of DECL, which declares a template parameter. */
9282 template_decl_level (tree decl)
9284 switch (TREE_CODE (decl))
9288 return TEMPLATE_TYPE_LEVEL (TREE_TYPE (decl));
9291 return TEMPLATE_PARM_LEVEL (DECL_INITIAL (decl));
9299 /* Decide whether ARG can be unified with PARM, considering only the
9300 cv-qualifiers of each type, given STRICT as documented for unify.
9301 Returns nonzero iff the unification is OK on that basis.*/
9304 check_cv_quals_for_unify (int strict, tree arg, tree parm)
9306 int arg_quals = cp_type_quals (arg);
9307 int parm_quals = cp_type_quals (parm);
9309 if (TREE_CODE (parm) == TEMPLATE_TYPE_PARM)
9311 /* If the cvr quals of parm will not unify with ARG, they'll be
9312 ignored in instantiation, so we have to do the same here. */
9313 if (TREE_CODE (arg) == REFERENCE_TYPE)
9314 parm_quals &= ~(TYPE_QUAL_CONST | TYPE_QUAL_VOLATILE);
9315 if (!POINTER_TYPE_P (arg) &&
9316 TREE_CODE (arg) != TEMPLATE_TYPE_PARM)
9317 parm_quals &= ~TYPE_QUAL_RESTRICT;
9320 if (!(strict & (UNIFY_ALLOW_MORE_CV_QUAL | UNIFY_ALLOW_OUTER_MORE_CV_QUAL))
9321 && (arg_quals & parm_quals) != parm_quals)
9324 if (!(strict & (UNIFY_ALLOW_LESS_CV_QUAL | UNIFY_ALLOW_OUTER_LESS_CV_QUAL))
9325 && (parm_quals & arg_quals) != arg_quals)
9331 /* Takes parameters as for type_unification. Returns 0 if the
9332 type deduction succeeds, 1 otherwise. The parameter STRICT is a
9333 bitwise or of the following flags:
9336 Require an exact match between PARM and ARG.
9337 UNIFY_ALLOW_MORE_CV_QUAL:
9338 Allow the deduced ARG to be more cv-qualified (by qualification
9339 conversion) than ARG.
9340 UNIFY_ALLOW_LESS_CV_QUAL:
9341 Allow the deduced ARG to be less cv-qualified than ARG.
9342 UNIFY_ALLOW_DERIVED:
9343 Allow the deduced ARG to be a template base class of ARG,
9344 or a pointer to a template base class of the type pointed to by
9346 UNIFY_ALLOW_INTEGER:
9347 Allow any integral type to be deduced. See the TEMPLATE_PARM_INDEX
9348 case for more information.
9349 UNIFY_ALLOW_OUTER_LEVEL:
9350 This is the outermost level of a deduction. Used to determine validity
9351 of qualification conversions. A valid qualification conversion must
9352 have const qualified pointers leading up to the inner type which
9353 requires additional CV quals, except at the outer level, where const
9354 is not required [conv.qual]. It would be normal to set this flag in
9355 addition to setting UNIFY_ALLOW_MORE_CV_QUAL.
9356 UNIFY_ALLOW_OUTER_MORE_CV_QUAL:
9357 This is the outermost level of a deduction, and PARM can be more CV
9358 qualified at this point.
9359 UNIFY_ALLOW_OUTER_LESS_CV_QUAL:
9360 This is the outermost level of a deduction, and PARM can be less CV
9361 qualified at this point.
9362 UNIFY_ALLOW_MAX_CORRECTION:
9363 This is an INTEGER_TYPE's maximum value. Used if the range may
9364 have been derived from a size specification, such as an array size.
9365 If the size was given by a nontype template parameter N, the maximum
9366 value will have the form N-1. The flag says that we can (and indeed
9367 must) unify N with (ARG + 1), an exception to the normal rules on
9371 unify (tree tparms, tree targs, tree parm, tree arg, int strict)
9376 int strict_in = strict;
9378 /* I don't think this will do the right thing with respect to types.
9379 But the only case I've seen it in so far has been array bounds, where
9380 signedness is the only information lost, and I think that will be
9382 while (TREE_CODE (parm) == NOP_EXPR)
9383 parm = TREE_OPERAND (parm, 0);
9385 if (arg == error_mark_node)
9387 if (arg == unknown_type_node)
9388 /* We can't deduce anything from this, but we might get all the
9389 template args from other function args. */
9392 /* If PARM uses template parameters, then we can't bail out here,
9393 even if ARG == PARM, since we won't record unifications for the
9394 template parameters. We might need them if we're trying to
9395 figure out which of two things is more specialized. */
9396 if (arg == parm && !uses_template_parms (parm))
9399 /* Immediately reject some pairs that won't unify because of
9400 cv-qualification mismatches. */
9401 if (TREE_CODE (arg) == TREE_CODE (parm)
9403 /* It is the elements of the array which hold the cv quals of an array
9404 type, and the elements might be template type parms. We'll check
9406 && TREE_CODE (arg) != ARRAY_TYPE
9407 /* We check the cv-qualifiers when unifying with template type
9408 parameters below. We want to allow ARG `const T' to unify with
9409 PARM `T' for example, when computing which of two templates
9410 is more specialized, for example. */
9411 && TREE_CODE (arg) != TEMPLATE_TYPE_PARM
9412 && !check_cv_quals_for_unify (strict_in, arg, parm))
9415 if (!(strict & UNIFY_ALLOW_OUTER_LEVEL)
9416 && TYPE_P (parm) && !CP_TYPE_CONST_P (parm))
9417 strict &= ~UNIFY_ALLOW_MORE_CV_QUAL;
9418 strict &= ~UNIFY_ALLOW_OUTER_LEVEL;
9419 strict &= ~UNIFY_ALLOW_DERIVED;
9420 strict &= ~UNIFY_ALLOW_OUTER_MORE_CV_QUAL;
9421 strict &= ~UNIFY_ALLOW_OUTER_LESS_CV_QUAL;
9422 strict &= ~UNIFY_ALLOW_MAX_CORRECTION;
9424 switch (TREE_CODE (parm))
9428 case UNBOUND_CLASS_TEMPLATE:
9429 /* In a type which contains a nested-name-specifier, template
9430 argument values cannot be deduced for template parameters used
9431 within the nested-name-specifier. */
9434 case TEMPLATE_TYPE_PARM:
9435 case TEMPLATE_TEMPLATE_PARM:
9436 case BOUND_TEMPLATE_TEMPLATE_PARM:
9437 tparm = TREE_VALUE (TREE_VEC_ELT (tparms, 0));
9439 if (TEMPLATE_TYPE_LEVEL (parm)
9440 != template_decl_level (tparm))
9441 /* The PARM is not one we're trying to unify. Just check
9442 to see if it matches ARG. */
9443 return (TREE_CODE (arg) == TREE_CODE (parm)
9444 && same_type_p (parm, arg)) ? 0 : 1;
9445 idx = TEMPLATE_TYPE_IDX (parm);
9446 targ = TREE_VEC_ELT (targs, idx);
9447 tparm = TREE_VALUE (TREE_VEC_ELT (tparms, idx));
9449 /* Check for mixed types and values. */
9450 if ((TREE_CODE (parm) == TEMPLATE_TYPE_PARM
9451 && TREE_CODE (tparm) != TYPE_DECL)
9452 || (TREE_CODE (parm) == TEMPLATE_TEMPLATE_PARM
9453 && TREE_CODE (tparm) != TEMPLATE_DECL))
9456 if (TREE_CODE (parm) == BOUND_TEMPLATE_TEMPLATE_PARM)
9458 /* ARG must be constructed from a template class or a template
9459 template parameter. */
9460 if (TREE_CODE (arg) != BOUND_TEMPLATE_TEMPLATE_PARM
9461 && (TREE_CODE (arg) != RECORD_TYPE || !CLASSTYPE_TEMPLATE_INFO (arg)))
9465 tree parmtmpl = TYPE_TI_TEMPLATE (parm);
9466 tree parmvec = TYPE_TI_ARGS (parm);
9467 tree argvec = TYPE_TI_ARGS (arg);
9469 = DECL_INNERMOST_TEMPLATE_PARMS (TYPE_TI_TEMPLATE (arg));
9472 /* The parameter and argument roles have to be switched here
9473 in order to handle default arguments properly. For example,
9474 template<template <class> class TT> void f(TT<int>)
9475 should be able to accept vector<int> which comes from
9476 template <class T, class Allocator = allocator>
9479 if (coerce_template_parms (argtmplvec, parmvec, parmtmpl, 0, 1)
9483 /* Deduce arguments T, i from TT<T> or TT<i>.
9484 We check each element of PARMVEC and ARGVEC individually
9485 rather than the whole TREE_VEC since they can have
9486 different number of elements. */
9488 for (i = 0; i < TREE_VEC_LENGTH (parmvec); ++i)
9490 tree t = TREE_VEC_ELT (parmvec, i);
9492 if (unify (tparms, targs, t,
9493 TREE_VEC_ELT (argvec, i),
9498 arg = TYPE_TI_TEMPLATE (arg);
9500 /* Fall through to deduce template name. */
9503 if (TREE_CODE (parm) == TEMPLATE_TEMPLATE_PARM
9504 || TREE_CODE (parm) == BOUND_TEMPLATE_TEMPLATE_PARM)
9506 /* Deduce template name TT from TT, TT<>, TT<T> and TT<i>. */
9508 /* Simple cases: Value already set, does match or doesn't. */
9509 if (targ != NULL_TREE && template_args_equal (targ, arg))
9516 /* If PARM is `const T' and ARG is only `int', we don't have
9517 a match unless we are allowing additional qualification.
9518 If ARG is `const int' and PARM is just `T' that's OK;
9519 that binds `const int' to `T'. */
9520 if (!check_cv_quals_for_unify (strict_in | UNIFY_ALLOW_LESS_CV_QUAL,
9524 /* Consider the case where ARG is `const volatile int' and
9525 PARM is `const T'. Then, T should be `volatile int'. */
9526 arg = cp_build_qualified_type_real
9527 (arg, cp_type_quals (arg) & ~cp_type_quals (parm), tf_none);
9528 if (arg == error_mark_node)
9531 /* Simple cases: Value already set, does match or doesn't. */
9532 if (targ != NULL_TREE && same_type_p (targ, arg))
9537 /* Make sure that ARG is not a variable-sized array. (Note
9538 that were talking about variable-sized arrays (like
9539 `int[n]'), rather than arrays of unknown size (like
9540 `int[]').) We'll get very confused by such a type since
9541 the bound of the array will not be computable in an
9542 instantiation. Besides, such types are not allowed in
9543 ISO C++, so we can do as we please here. */
9544 if (variably_modified_type_p (arg))
9548 TREE_VEC_ELT (targs, idx) = arg;
9551 case TEMPLATE_PARM_INDEX:
9552 tparm = TREE_VALUE (TREE_VEC_ELT (tparms, 0));
9554 if (TEMPLATE_PARM_LEVEL (parm)
9555 != template_decl_level (tparm))
9556 /* The PARM is not one we're trying to unify. Just check
9557 to see if it matches ARG. */
9558 return !(TREE_CODE (arg) == TREE_CODE (parm)
9559 && cp_tree_equal (parm, arg));
9561 idx = TEMPLATE_PARM_IDX (parm);
9562 targ = TREE_VEC_ELT (targs, idx);
9565 return !cp_tree_equal (targ, arg);
9567 /* [temp.deduct.type] If, in the declaration of a function template
9568 with a non-type template-parameter, the non-type
9569 template-parameter is used in an expression in the function
9570 parameter-list and, if the corresponding template-argument is
9571 deduced, the template-argument type shall match the type of the
9572 template-parameter exactly, except that a template-argument
9573 deduced from an array bound may be of any integral type.
9574 The non-type parameter might use already deduced type parameters. */
9575 tparm = tsubst (TREE_TYPE (parm), targs, 0, NULL_TREE);
9576 if (!TREE_TYPE (arg))
9577 /* Template-parameter dependent expression. Just accept it for now.
9578 It will later be processed in convert_template_argument. */
9580 else if (same_type_p (TREE_TYPE (arg), tparm))
9582 else if ((strict & UNIFY_ALLOW_INTEGER)
9583 && (TREE_CODE (tparm) == INTEGER_TYPE
9584 || TREE_CODE (tparm) == BOOLEAN_TYPE))
9586 else if (uses_template_parms (tparm))
9587 /* We haven't deduced the type of this parameter yet. Try again
9593 TREE_VEC_ELT (targs, idx) = arg;
9598 if (TREE_CODE (arg) != POINTER_TYPE)
9601 /* [temp.deduct.call]
9603 A can be another pointer or pointer to member type that can
9604 be converted to the deduced A via a qualification
9605 conversion (_conv.qual_).
9607 We pass down STRICT here rather than UNIFY_ALLOW_NONE.
9608 This will allow for additional cv-qualification of the
9609 pointed-to types if appropriate. */
9611 if (TREE_CODE (TREE_TYPE (arg)) == RECORD_TYPE)
9612 /* The derived-to-base conversion only persists through one
9613 level of pointers. */
9614 strict |= (strict_in & UNIFY_ALLOW_DERIVED);
9616 return unify (tparms, targs, TREE_TYPE (parm),
9617 TREE_TYPE (arg), strict);
9620 case REFERENCE_TYPE:
9621 if (TREE_CODE (arg) != REFERENCE_TYPE)
9623 return unify (tparms, targs, TREE_TYPE (parm), TREE_TYPE (arg),
9624 strict & UNIFY_ALLOW_MORE_CV_QUAL);
9627 if (TREE_CODE (arg) != ARRAY_TYPE)
9629 if ((TYPE_DOMAIN (parm) == NULL_TREE)
9630 != (TYPE_DOMAIN (arg) == NULL_TREE))
9632 if (TYPE_DOMAIN (parm) != NULL_TREE
9633 && unify (tparms, targs, TYPE_DOMAIN (parm),
9634 TYPE_DOMAIN (arg), UNIFY_ALLOW_NONE) != 0)
9636 return unify (tparms, targs, TREE_TYPE (parm), TREE_TYPE (arg),
9637 strict & UNIFY_ALLOW_MORE_CV_QUAL);
9645 if (TREE_CODE (arg) != TREE_CODE (parm))
9648 if (TREE_CODE (parm) == INTEGER_TYPE
9649 && TREE_CODE (TYPE_MAX_VALUE (parm)) != INTEGER_CST)
9651 if (TYPE_MIN_VALUE (parm) && TYPE_MIN_VALUE (arg)
9652 && unify (tparms, targs, TYPE_MIN_VALUE (parm),
9653 TYPE_MIN_VALUE (arg), UNIFY_ALLOW_INTEGER))
9655 if (TYPE_MAX_VALUE (parm) && TYPE_MAX_VALUE (arg)
9656 && unify (tparms, targs, TYPE_MAX_VALUE (parm),
9657 TYPE_MAX_VALUE (arg),
9658 UNIFY_ALLOW_INTEGER | UNIFY_ALLOW_MAX_CORRECTION))
9661 /* We have already checked cv-qualification at the top of the
9663 else if (!same_type_ignoring_top_level_qualifiers_p (arg, parm))
9666 /* As far as unification is concerned, this wins. Later checks
9667 will invalidate it if necessary. */
9670 /* Types INTEGER_CST and MINUS_EXPR can come from array bounds. */
9671 /* Type INTEGER_CST can come from ordinary constant template args. */
9673 while (TREE_CODE (arg) == NOP_EXPR)
9674 arg = TREE_OPERAND (arg, 0);
9676 if (TREE_CODE (arg) != INTEGER_CST)
9678 return !tree_int_cst_equal (parm, arg);
9683 if (TREE_CODE (arg) != TREE_VEC)
9685 if (TREE_VEC_LENGTH (parm) != TREE_VEC_LENGTH (arg))
9687 for (i = 0; i < TREE_VEC_LENGTH (parm); ++i)
9688 if (unify (tparms, targs,
9689 TREE_VEC_ELT (parm, i), TREE_VEC_ELT (arg, i),
9697 if (TREE_CODE (arg) != TREE_CODE (parm))
9700 if (TYPE_PTRMEMFUNC_P (parm))
9702 if (!TYPE_PTRMEMFUNC_P (arg))
9705 return unify (tparms, targs,
9706 TYPE_PTRMEMFUNC_FN_TYPE (parm),
9707 TYPE_PTRMEMFUNC_FN_TYPE (arg),
9711 if (CLASSTYPE_TEMPLATE_INFO (parm))
9715 if (strict_in & UNIFY_ALLOW_DERIVED)
9717 /* First, we try to unify the PARM and ARG directly. */
9718 t = try_class_unification (tparms, targs,
9723 /* Fallback to the special case allowed in
9726 If P is a class, and P has the form
9727 template-id, then A can be a derived class of
9728 the deduced A. Likewise, if P is a pointer to
9729 a class of the form template-id, A can be a
9730 pointer to a derived class pointed to by the
9732 t = get_template_base (tparms, targs,
9735 if (! t || t == error_mark_node)
9739 else if (CLASSTYPE_TEMPLATE_INFO (arg)
9740 && (CLASSTYPE_TI_TEMPLATE (parm)
9741 == CLASSTYPE_TI_TEMPLATE (arg)))
9742 /* Perhaps PARM is something like S<U> and ARG is S<int>.
9743 Then, we should unify `int' and `U'. */
9746 /* There's no chance of unification succeeding. */
9749 return unify (tparms, targs, CLASSTYPE_TI_ARGS (parm),
9750 CLASSTYPE_TI_ARGS (t), UNIFY_ALLOW_NONE);
9752 else if (!same_type_ignoring_top_level_qualifiers_p (parm, arg))
9758 if (TREE_CODE (arg) != TREE_CODE (parm))
9761 if (unify (tparms, targs, TREE_TYPE (parm),
9762 TREE_TYPE (arg), UNIFY_ALLOW_NONE))
9764 return type_unification_real (tparms, targs, TYPE_ARG_TYPES (parm),
9765 TYPE_ARG_TYPES (arg), 1,
9766 DEDUCE_EXACT, 0, -1);
9769 if (TREE_CODE (arg) != OFFSET_TYPE)
9771 if (unify (tparms, targs, TYPE_OFFSET_BASETYPE (parm),
9772 TYPE_OFFSET_BASETYPE (arg), UNIFY_ALLOW_NONE))
9774 return unify (tparms, targs, TREE_TYPE (parm), TREE_TYPE (arg),
9778 if (DECL_TEMPLATE_PARM_P (parm))
9779 return unify (tparms, targs, DECL_INITIAL (parm), arg, strict);
9780 if (arg != decl_constant_value (parm))
9785 /* Matched cases are handled by the ARG == PARM test above. */
9789 if (tree_int_cst_equal (TREE_OPERAND (parm, 1), integer_one_node)
9790 && (strict_in & UNIFY_ALLOW_MAX_CORRECTION))
9792 /* We handle this case specially, since it comes up with
9793 arrays. In particular, something like:
9795 template <int N> void f(int (&x)[N]);
9797 Here, we are trying to unify the range type, which
9798 looks like [0 ... (N - 1)]. */
9800 t1 = TREE_OPERAND (parm, 0);
9801 t2 = TREE_OPERAND (parm, 1);
9803 t = fold (build (PLUS_EXPR, integer_type_node, arg, t2));
9805 return unify (tparms, targs, t1, t, strict);
9807 /* else fall through */
9810 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (parm))))
9813 /* We're looking at an expression. This can happen with
9817 void foo(S<I>, S<I + 2>);
9819 This is a "nondeduced context":
9823 The nondeduced contexts are:
9825 --A type that is a template-id in which one or more of
9826 the template-arguments is an expression that references
9827 a template-parameter.
9829 In these cases, we assume deduction succeeded, but don't
9830 actually infer any unifications. */
9832 if (!uses_template_parms (parm)
9833 && !template_args_equal (parm, arg))
9839 sorry ("use of `%s' in template type unification",
9840 tree_code_name [(int) TREE_CODE (parm)]);
9846 /* Called if RESULT is explicitly instantiated, or is a member of an
9847 explicitly instantiated class, or if using -frepo and the
9848 instantiation of RESULT has been assigned to this file. */
9851 mark_decl_instantiated (tree result, int extern_p)
9853 /* We used to set this unconditionally; we moved that to
9854 do_decl_instantiation so it wouldn't get set on members of
9855 explicit class template instantiations. But we still need to set
9856 it here for the 'extern template' case in order to suppress
9857 implicit instantiations. */
9859 SET_DECL_EXPLICIT_INSTANTIATION (result);
9861 /* If this entity has already been written out, it's too late to
9862 make any modifications. */
9863 if (TREE_ASM_WRITTEN (result))
9866 if (TREE_CODE (result) != FUNCTION_DECL)
9867 /* The TREE_PUBLIC flag for function declarations will have been
9868 set correctly by tsubst. */
9869 TREE_PUBLIC (result) = 1;
9871 /* This might have been set by an earlier implicit instantiation. */
9872 DECL_COMDAT (result) = 0;
9876 DECL_INTERFACE_KNOWN (result) = 1;
9877 DECL_NOT_REALLY_EXTERN (result) = 1;
9879 /* Always make artificials weak. */
9880 if (DECL_ARTIFICIAL (result) && flag_weak)
9881 comdat_linkage (result);
9882 /* For WIN32 we also want to put explicit instantiations in
9883 linkonce sections. */
9884 else if (TREE_PUBLIC (result))
9885 maybe_make_one_only (result);
9888 if (TREE_CODE (result) == FUNCTION_DECL)
9892 /* Given two function templates PAT1 and PAT2, return:
9894 DEDUCE should be DEDUCE_EXACT or DEDUCE_ORDER.
9896 1 if PAT1 is more specialized than PAT2 as described in [temp.func.order].
9897 -1 if PAT2 is more specialized than PAT1.
9898 0 if neither is more specialized.
9900 LEN is passed through to fn_type_unification. */
9903 more_specialized (tree pat1, tree pat2, int deduce, int len)
9908 targs = get_bindings_real (pat1, DECL_TEMPLATE_RESULT (pat2),
9909 NULL_TREE, 0, deduce, len);
9913 targs = get_bindings_real (pat2, DECL_TEMPLATE_RESULT (pat1),
9914 NULL_TREE, 0, deduce, len);
9921 /* Given two class template specialization list nodes PAT1 and PAT2, return:
9923 1 if PAT1 is more specialized than PAT2 as described in [temp.class.order].
9924 -1 if PAT2 is more specialized than PAT1.
9925 0 if neither is more specialized.
9927 FULL_ARGS is the full set of template arguments that triggers this
9928 partial ordering. */
9931 more_specialized_class (tree pat1, tree pat2, tree full_args)
9936 targs = get_class_bindings (TREE_VALUE (pat1), TREE_PURPOSE (pat1),
9937 add_outermost_template_args (full_args, TREE_PURPOSE (pat2)));
9941 targs = get_class_bindings (TREE_VALUE (pat2), TREE_PURPOSE (pat2),
9942 add_outermost_template_args (full_args, TREE_PURPOSE (pat1)));
9949 /* Return the template arguments that will produce the function signature
9950 DECL from the function template FN, with the explicit template
9951 arguments EXPLICIT_ARGS. If CHECK_RETTYPE is 1, the return type must
9952 also match. Return NULL_TREE if no satisfactory arguments could be
9953 found. DEDUCE and LEN are passed through to fn_type_unification. */
9956 get_bindings_real (tree fn,
9963 int ntparms = DECL_NTPARMS (fn);
9964 tree targs = make_tree_vec (ntparms);
9966 tree decl_arg_types;
9969 /* Substitute the explicit template arguments into the type of DECL.
9970 The call to fn_type_unification will handle substitution into the
9972 decl_type = TREE_TYPE (decl);
9973 if (explicit_args && uses_template_parms (decl_type))
9976 tree converted_args;
9978 if (DECL_TEMPLATE_INFO (decl))
9979 tmpl = DECL_TI_TEMPLATE (decl);
9981 /* We can get here for some invalid specializations. */
9985 = (coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl),
9986 explicit_args, NULL_TREE,
9987 tf_none, /*require_all_arguments=*/0));
9988 if (converted_args == error_mark_node)
9991 decl_type = tsubst (decl_type, converted_args, tf_none, NULL_TREE);
9992 if (decl_type == error_mark_node)
9996 decl_arg_types = TYPE_ARG_TYPES (decl_type);
9997 /* Never do unification on the 'this' parameter. */
9998 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl))
9999 decl_arg_types = TREE_CHAIN (decl_arg_types);
10001 i = fn_type_unification (fn, explicit_args, targs,
10003 (check_rettype || DECL_CONV_FN_P (fn)
10004 ? TREE_TYPE (decl_type) : NULL_TREE),
10013 /* For most uses, we want to check the return type. */
10016 get_bindings (tree fn, tree decl, tree explicit_args)
10018 return get_bindings_real (fn, decl, explicit_args, 1, DEDUCE_EXACT, -1);
10021 /* But for resolve_overloaded_unification, we only care about the parameter
10025 get_bindings_overload (tree fn, tree decl, tree explicit_args)
10027 return get_bindings_real (fn, decl, explicit_args, 0, DEDUCE_EXACT, -1);
10030 /* Return the innermost template arguments that, when applied to a
10031 template specialization whose innermost template parameters are
10032 TPARMS, and whose specialization arguments are PARMS, yield the
10035 For example, suppose we have:
10037 template <class T, class U> struct S {};
10038 template <class T> struct S<T*, int> {};
10040 Then, suppose we want to get `S<double*, int>'. The TPARMS will be
10041 {T}, the PARMS will be {T*, int} and the ARGS will be {double*,
10042 int}. The resulting vector will be {double}, indicating that `T'
10043 is bound to `double'. */
10046 get_class_bindings (tree tparms, tree parms, tree args)
10048 int i, ntparms = TREE_VEC_LENGTH (tparms);
10049 tree vec = make_tree_vec (ntparms);
10051 if (unify (tparms, vec, parms, INNERMOST_TEMPLATE_ARGS (args),
10055 for (i = 0; i < ntparms; ++i)
10056 if (! TREE_VEC_ELT (vec, i))
10059 if (verify_class_unification (vec, parms, args))
10065 /* In INSTANTIATIONS is a list of <INSTANTIATION, TEMPLATE> pairs.
10066 Pick the most specialized template, and return the corresponding
10067 instantiation, or if there is no corresponding instantiation, the
10068 template itself. If there is no most specialized template,
10069 error_mark_node is returned. If there are no templates at all,
10070 NULL_TREE is returned. */
10073 most_specialized_instantiation (tree instantiations)
10078 if (!instantiations)
10081 champ = instantiations;
10082 for (fn = TREE_CHAIN (instantiations); fn; fn = TREE_CHAIN (fn))
10084 fate = more_specialized (TREE_VALUE (champ), TREE_VALUE (fn),
10092 fn = TREE_CHAIN (fn);
10094 return error_mark_node;
10100 for (fn = instantiations; fn && fn != champ; fn = TREE_CHAIN (fn))
10102 fate = more_specialized (TREE_VALUE (champ), TREE_VALUE (fn),
10105 return error_mark_node;
10108 return TREE_PURPOSE (champ) ? TREE_PURPOSE (champ) : TREE_VALUE (champ);
10111 /* Return the most specialized of the list of templates in FNS that can
10112 produce an instantiation matching DECL, given the explicit template
10113 arguments EXPLICIT_ARGS. */
10116 most_specialized (tree fns, tree decl, tree explicit_args)
10118 tree candidates = NULL_TREE;
10121 for (fn = fns; fn; fn = TREE_CHAIN (fn))
10123 tree candidate = TREE_VALUE (fn);
10125 args = get_bindings (candidate, decl, explicit_args);
10127 candidates = tree_cons (NULL_TREE, candidate, candidates);
10130 return most_specialized_instantiation (candidates);
10133 /* If DECL is a specialization of some template, return the most
10134 general such template. Otherwise, returns NULL_TREE.
10136 For example, given:
10138 template <class T> struct S { template <class U> void f(U); };
10140 if TMPL is `template <class U> void S<int>::f(U)' this will return
10141 the full template. This function will not trace past partial
10142 specializations, however. For example, given in addition:
10144 template <class T> struct S<T*> { template <class U> void f(U); };
10146 if TMPL is `template <class U> void S<int*>::f(U)' this will return
10147 `template <class T> template <class U> S<T*>::f(U)'. */
10150 most_general_template (tree decl)
10152 /* If DECL is a FUNCTION_DECL, find the TEMPLATE_DECL of which it is
10153 an immediate specialization. */
10154 if (TREE_CODE (decl) == FUNCTION_DECL)
10156 if (DECL_TEMPLATE_INFO (decl)) {
10157 decl = DECL_TI_TEMPLATE (decl);
10159 /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE for a
10160 template friend. */
10161 if (TREE_CODE (decl) != TEMPLATE_DECL)
10167 /* Look for more and more general templates. */
10168 while (DECL_TEMPLATE_INFO (decl))
10170 /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE in some cases.
10171 (See cp-tree.h for details.) */
10172 if (TREE_CODE (DECL_TI_TEMPLATE (decl)) != TEMPLATE_DECL)
10175 if (CLASS_TYPE_P (TREE_TYPE (decl))
10176 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl)))
10179 /* Stop if we run into an explicitly specialized class template. */
10180 if (!DECL_NAMESPACE_SCOPE_P (decl)
10181 && DECL_CONTEXT (decl)
10182 && CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (decl)))
10185 decl = DECL_TI_TEMPLATE (decl);
10191 /* Return the most specialized of the class template specializations
10192 of TMPL which can produce an instantiation matching ARGS, or
10193 error_mark_node if the choice is ambiguous. */
10196 most_specialized_class (tree tmpl, tree args)
10198 tree list = NULL_TREE;
10203 tmpl = most_general_template (tmpl);
10204 for (t = DECL_TEMPLATE_SPECIALIZATIONS (tmpl); t; t = TREE_CHAIN (t))
10207 = get_class_bindings (TREE_VALUE (t), TREE_PURPOSE (t), args);
10210 list = tree_cons (TREE_PURPOSE (t), TREE_VALUE (t), list);
10211 TREE_TYPE (list) = TREE_TYPE (t);
10220 t = TREE_CHAIN (t);
10221 for (; t; t = TREE_CHAIN (t))
10223 fate = more_specialized_class (champ, t, args);
10230 t = TREE_CHAIN (t);
10232 return error_mark_node;
10238 for (t = list; t && t != champ; t = TREE_CHAIN (t))
10240 fate = more_specialized_class (champ, t, args);
10242 return error_mark_node;
10248 /* Explicitly instantiate DECL. */
10251 do_decl_instantiation (tree decl, tree storage)
10253 tree result = NULL_TREE;
10257 /* An error occurred, for which grokdeclarator has already issued
10258 an appropriate message. */
10260 else if (! DECL_LANG_SPECIFIC (decl))
10262 error ("explicit instantiation of non-template `%#D'", decl);
10265 else if (TREE_CODE (decl) == VAR_DECL)
10267 /* There is an asymmetry here in the way VAR_DECLs and
10268 FUNCTION_DECLs are handled by grokdeclarator. In the case of
10269 the latter, the DECL we get back will be marked as a
10270 template instantiation, and the appropriate
10271 DECL_TEMPLATE_INFO will be set up. This does not happen for
10272 VAR_DECLs so we do the lookup here. Probably, grokdeclarator
10273 should handle VAR_DECLs as it currently handles
10275 result = lookup_field (DECL_CONTEXT (decl), DECL_NAME (decl), 0, false);
10276 if (!result || TREE_CODE (result) != VAR_DECL)
10278 error ("no matching template for `%D' found", decl);
10282 else if (TREE_CODE (decl) != FUNCTION_DECL)
10284 error ("explicit instantiation of `%#D'", decl);
10290 /* Check for various error cases. Note that if the explicit
10291 instantiation is valid the RESULT will currently be marked as an
10292 *implicit* instantiation; DECL_EXPLICIT_INSTANTIATION is not set
10293 until we get here. */
10295 if (DECL_TEMPLATE_SPECIALIZATION (result))
10297 /* DR 259 [temp.spec].
10299 Both an explicit instantiation and a declaration of an explicit
10300 specialization shall not appear in a program unless the explicit
10301 instantiation follows a declaration of the explicit specialization.
10303 For a given set of template parameters, if an explicit
10304 instantiation of a template appears after a declaration of an
10305 explicit specialization for that template, the explicit
10306 instantiation has no effect. */
10309 else if (DECL_EXPLICIT_INSTANTIATION (result))
10313 No program shall explicitly instantiate any template more
10316 We check DECL_INTERFACE_KNOWN so as not to complain when the first
10317 instantiation was `extern' and the second is not, and EXTERN_P for
10318 the opposite case. If -frepo, chances are we already got marked
10319 as an explicit instantiation because of the repo file. */
10320 if (DECL_INTERFACE_KNOWN (result) && !extern_p && !flag_use_repository)
10321 pedwarn ("duplicate explicit instantiation of `%#D'", result);
10323 /* If we've already instantiated the template, just return now. */
10324 if (DECL_INTERFACE_KNOWN (result))
10327 else if (!DECL_IMPLICIT_INSTANTIATION (result))
10329 error ("no matching template for `%D' found", result);
10332 else if (!DECL_TEMPLATE_INFO (result))
10334 pedwarn ("explicit instantiation of non-template `%#D'", result);
10338 if (flag_external_templates)
10341 if (storage == NULL_TREE)
10343 else if (storage == ridpointers[(int) RID_EXTERN])
10345 if (pedantic && !in_system_header)
10346 pedwarn ("ISO C++ forbids the use of `extern' on explicit instantiations");
10350 error ("storage class `%D' applied to template instantiation",
10353 SET_DECL_EXPLICIT_INSTANTIATION (result);
10354 mark_decl_instantiated (result, extern_p);
10355 repo_template_instantiated (result, extern_p);
10357 instantiate_decl (result, /*defer_ok=*/1);
10361 mark_class_instantiated (tree t, int extern_p)
10363 SET_CLASSTYPE_EXPLICIT_INSTANTIATION (t);
10364 SET_CLASSTYPE_INTERFACE_KNOWN (t);
10365 CLASSTYPE_INTERFACE_ONLY (t) = extern_p;
10366 TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (t)) = extern_p;
10369 CLASSTYPE_DEBUG_REQUESTED (t) = 1;
10370 rest_of_type_compilation (t, 1);
10374 /* Called from do_type_instantiation through binding_table_foreach to
10375 do recursive instantiation for the type bound in ENTRY. */
10377 bt_instantiate_type_proc (binding_entry entry, void *data)
10379 tree storage = *(tree *) data;
10381 if (IS_AGGR_TYPE (entry->type)
10382 && !uses_template_parms (CLASSTYPE_TI_ARGS (entry->type)))
10383 do_type_instantiation (TYPE_MAIN_DECL (entry->type), storage, 0);
10386 /* Perform an explicit instantiation of template class T. STORAGE, if
10387 non-null, is the RID for extern, inline or static. COMPLAIN is
10388 nonzero if this is called from the parser, zero if called recursively,
10389 since the standard is unclear (as detailed below). */
10392 do_type_instantiation (tree t, tree storage, tsubst_flags_t complain)
10398 if (TREE_CODE (t) == TYPE_DECL)
10401 if (! CLASS_TYPE_P (t) || ! CLASSTYPE_TEMPLATE_INFO (t))
10403 error ("explicit instantiation of non-template type `%T'", t);
10409 /* With -fexternal-templates, explicit instantiations are treated the same
10410 as implicit ones. */
10411 if (flag_external_templates)
10414 if (!COMPLETE_TYPE_P (t))
10416 if (complain & tf_error)
10417 error ("explicit instantiation of `%#T' before definition of template",
10422 if (storage != NULL_TREE)
10424 if (pedantic && !in_system_header)
10425 pedwarn("ISO C++ forbids the use of `%s' on explicit instantiations",
10426 IDENTIFIER_POINTER (storage));
10428 if (storage == ridpointers[(int) RID_INLINE])
10430 else if (storage == ridpointers[(int) RID_EXTERN])
10432 else if (storage == ridpointers[(int) RID_STATIC])
10436 error ("storage class `%D' applied to template instantiation",
10442 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (t))
10444 /* DR 259 [temp.spec].
10446 Both an explicit instantiation and a declaration of an explicit
10447 specialization shall not appear in a program unless the explicit
10448 instantiation follows a declaration of the explicit specialization.
10450 For a given set of template parameters, if an explicit
10451 instantiation of a template appears after a declaration of an
10452 explicit specialization for that template, the explicit
10453 instantiation has no effect. */
10456 else if (CLASSTYPE_EXPLICIT_INSTANTIATION (t))
10460 No program shall explicitly instantiate any template more
10463 If CLASSTYPE_INTERFACE_ONLY, then the first explicit instantiation
10464 was `extern'. If EXTERN_P then the second is. If -frepo, chances
10465 are we already got marked as an explicit instantiation because of the
10466 repo file. All these cases are OK. */
10467 if (!CLASSTYPE_INTERFACE_ONLY (t) && !extern_p && !flag_use_repository
10468 && (complain & tf_error))
10469 pedwarn ("duplicate explicit instantiation of `%#T'", t);
10471 /* If we've already instantiated the template, just return now. */
10472 if (!CLASSTYPE_INTERFACE_ONLY (t))
10476 mark_class_instantiated (t, extern_p);
10477 repo_template_instantiated (t, extern_p);
10485 /* In contrast to implicit instantiation, where only the
10486 declarations, and not the definitions, of members are
10487 instantiated, we have here:
10491 The explicit instantiation of a class template specialization
10492 implies the instantiation of all of its members not
10493 previously explicitly specialized in the translation unit
10494 containing the explicit instantiation.
10496 Of course, we can't instantiate member template classes, since
10497 we don't have any arguments for them. Note that the standard
10498 is unclear on whether the instantiation of the members are
10499 *explicit* instantiations or not. We choose to be generous,
10500 and not set DECL_EXPLICIT_INSTANTIATION. Therefore, we allow
10501 the explicit instantiation of a class where some of the members
10502 have no definition in the current translation unit. */
10505 for (tmp = TYPE_METHODS (t); tmp; tmp = TREE_CHAIN (tmp))
10506 if (TREE_CODE (tmp) == FUNCTION_DECL
10507 && DECL_TEMPLATE_INSTANTIATION (tmp))
10509 mark_decl_instantiated (tmp, extern_p);
10510 repo_template_instantiated (tmp, extern_p);
10512 instantiate_decl (tmp, /*defer_ok=*/1);
10515 for (tmp = TYPE_FIELDS (t); tmp; tmp = TREE_CHAIN (tmp))
10516 if (TREE_CODE (tmp) == VAR_DECL && DECL_TEMPLATE_INSTANTIATION (tmp))
10518 mark_decl_instantiated (tmp, extern_p);
10519 repo_template_instantiated (tmp, extern_p);
10521 instantiate_decl (tmp, /*defer_ok=*/1);
10524 if (CLASSTYPE_NESTED_UTDS (t))
10525 binding_table_foreach (CLASSTYPE_NESTED_UTDS (t),
10526 bt_instantiate_type_proc, &storage);
10530 /* Given a function DECL, which is a specialization of TMPL, modify
10531 DECL to be a re-instantiation of TMPL with the same template
10532 arguments. TMPL should be the template into which tsubst'ing
10533 should occur for DECL, not the most general template.
10535 One reason for doing this is a scenario like this:
10538 void f(const T&, int i);
10540 void g() { f(3, 7); }
10543 void f(const T& t, const int i) { }
10545 Note that when the template is first instantiated, with
10546 instantiate_template, the resulting DECL will have no name for the
10547 first parameter, and the wrong type for the second. So, when we go
10548 to instantiate the DECL, we regenerate it. */
10551 regenerate_decl_from_template (tree decl, tree tmpl)
10553 /* The most general version of TMPL. */
10555 /* The arguments used to instantiate DECL, from the most general
10562 args = DECL_TI_ARGS (decl);
10563 code_pattern = DECL_TEMPLATE_RESULT (tmpl);
10565 /* Unregister the specialization so that when we tsubst we will not
10566 just return DECL. We don't have to unregister DECL from TMPL
10567 because if would only be registered there if it were a partial
10568 instantiation of a specialization, which it isn't: it's a full
10570 gen_tmpl = most_general_template (tmpl);
10571 unregistered = reregister_specialization (decl, gen_tmpl,
10572 /*new_spec=*/NULL_TREE);
10574 /* If the DECL was not unregistered then something peculiar is
10575 happening: we created a specialization but did not call
10576 register_specialization for it. */
10577 my_friendly_assert (unregistered, 0);
10579 /* Make sure that we can see identifiers, and compute access
10581 push_access_scope (decl);
10583 /* Do the substitution to get the new declaration. */
10584 new_decl = tsubst (code_pattern, args, tf_error, NULL_TREE);
10586 if (TREE_CODE (decl) == VAR_DECL)
10588 /* Set up DECL_INITIAL, since tsubst doesn't. */
10589 if (!DECL_INITIALIZED_IN_CLASS_P (decl))
10590 DECL_INITIAL (new_decl) =
10591 tsubst_expr (DECL_INITIAL (code_pattern), args,
10592 tf_error, DECL_TI_TEMPLATE (decl));
10594 else if (TREE_CODE (decl) == FUNCTION_DECL)
10596 /* Convince duplicate_decls to use the DECL_ARGUMENTS from the
10598 DECL_INITIAL (new_decl) = error_mark_node;
10599 /* And don't complain about a duplicate definition. */
10600 DECL_INITIAL (decl) = NULL_TREE;
10603 pop_access_scope (decl);
10605 /* The immediate parent of the new template is still whatever it was
10606 before, even though tsubst sets DECL_TI_TEMPLATE up as the most
10607 general template. We also reset the DECL_ASSEMBLER_NAME since
10608 tsubst always calculates the name as if the function in question
10609 were really a template instance, and sometimes, with friend
10610 functions, this is not so. See tsubst_friend_function for
10612 DECL_TI_TEMPLATE (new_decl) = DECL_TI_TEMPLATE (decl);
10613 COPY_DECL_ASSEMBLER_NAME (decl, new_decl);
10614 COPY_DECL_RTL (decl, new_decl);
10615 DECL_USE_TEMPLATE (new_decl) = DECL_USE_TEMPLATE (decl);
10617 /* Call duplicate decls to merge the old and new declarations. */
10618 duplicate_decls (new_decl, decl);
10620 /* Now, re-register the specialization. */
10621 register_specialization (decl, gen_tmpl, args);
10624 /* Return the TEMPLATE_DECL into which DECL_TI_ARGS(DECL) should be
10625 substituted to get DECL. */
10628 template_for_substitution (tree decl)
10630 tree tmpl = DECL_TI_TEMPLATE (decl);
10632 /* Set TMPL to the template whose DECL_TEMPLATE_RESULT is the pattern
10633 for the instantiation. This is not always the most general
10634 template. Consider, for example:
10637 struct S { template <class U> void f();
10638 template <> void f<int>(); };
10640 and an instantiation of S<double>::f<int>. We want TD to be the
10641 specialization S<T>::f<int>, not the more general S<T>::f<U>. */
10642 while (/* An instantiation cannot have a definition, so we need a
10643 more general template. */
10644 DECL_TEMPLATE_INSTANTIATION (tmpl)
10645 /* We must also deal with friend templates. Given:
10647 template <class T> struct S {
10648 template <class U> friend void f() {};
10651 S<int>::f<U> say, is not an instantiation of S<T>::f<U>,
10652 so far as the language is concerned, but that's still
10653 where we get the pattern for the instantiation from. On
10654 other hand, if the definition comes outside the class, say:
10656 template <class T> struct S {
10657 template <class U> friend void f();
10659 template <class U> friend void f() {}
10661 we don't need to look any further. That's what the check for
10662 DECL_INITIAL is for. */
10663 || (TREE_CODE (decl) == FUNCTION_DECL
10664 && DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (tmpl)
10665 && !DECL_INITIAL (DECL_TEMPLATE_RESULT (tmpl))))
10667 /* The present template, TD, should not be a definition. If it
10668 were a definition, we should be using it! Note that we
10669 cannot restructure the loop to just keep going until we find
10670 a template with a definition, since that might go too far if
10671 a specialization was declared, but not defined. */
10672 my_friendly_assert (!(TREE_CODE (decl) == VAR_DECL
10673 && !DECL_IN_AGGR_P (DECL_TEMPLATE_RESULT (tmpl))),
10676 /* Fetch the more general template. */
10677 tmpl = DECL_TI_TEMPLATE (tmpl);
10683 /* Produce the definition of D, a _DECL generated from a template. If
10684 DEFER_OK is nonzero, then we don't have to actually do the
10685 instantiation now; we just have to do it sometime. */
10688 instantiate_decl (tree d, int defer_ok)
10690 tree tmpl = DECL_TI_TEMPLATE (d);
10697 int pattern_defined;
10699 location_t saved_loc = input_location;
10701 /* This function should only be used to instantiate templates for
10702 functions and static member variables. */
10703 my_friendly_assert (TREE_CODE (d) == FUNCTION_DECL
10704 || TREE_CODE (d) == VAR_DECL, 0);
10706 /* Variables are never deferred; if instantiation is required, they
10707 are instantiated right away. That allows for better code in the
10708 case that an expression refers to the value of the variable --
10709 if the variable has a constant value the referring expression can
10710 take advantage of that fact. */
10711 if (TREE_CODE (d) == VAR_DECL)
10714 /* Don't instantiate cloned functions. Instead, instantiate the
10715 functions they cloned. */
10716 if (TREE_CODE (d) == FUNCTION_DECL && DECL_CLONED_FUNCTION_P (d))
10717 d = DECL_CLONED_FUNCTION (d);
10719 if (DECL_TEMPLATE_INSTANTIATED (d))
10720 /* D has already been instantiated. It might seem reasonable to
10721 check whether or not D is an explicit instantiation, and, if so,
10722 stop here. But when an explicit instantiation is deferred
10723 until the end of the compilation, DECL_EXPLICIT_INSTANTIATION
10724 is set, even though we still need to do the instantiation. */
10727 /* If we already have a specialization of this declaration, then
10728 there's no reason to instantiate it. Note that
10729 retrieve_specialization gives us both instantiations and
10730 specializations, so we must explicitly check
10731 DECL_TEMPLATE_SPECIALIZATION. */
10732 gen_tmpl = most_general_template (tmpl);
10733 gen_args = DECL_TI_ARGS (d);
10734 spec = retrieve_specialization (gen_tmpl, gen_args);
10735 if (spec != NULL_TREE && DECL_TEMPLATE_SPECIALIZATION (spec))
10738 /* This needs to happen before any tsubsting. */
10739 if (! push_tinst_level (d))
10742 timevar_push (TV_PARSE);
10744 /* We may be in the middle of deferred access check. Disable
10746 push_deferring_access_checks (dk_no_deferred);
10748 /* Set TD to the template whose DECL_TEMPLATE_RESULT is the pattern
10749 for the instantiation. */
10750 td = template_for_substitution (d);
10751 code_pattern = DECL_TEMPLATE_RESULT (td);
10753 if ((DECL_NAMESPACE_SCOPE_P (d) && !DECL_INITIALIZED_IN_CLASS_P (d))
10754 || DECL_TEMPLATE_SPECIALIZATION (td))
10755 /* In the case of a friend template whose definition is provided
10756 outside the class, we may have too many arguments. Drop the
10757 ones we don't need. The same is true for specializations. */
10758 args = get_innermost_template_args
10759 (gen_args, TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (td)));
10763 if (TREE_CODE (d) == FUNCTION_DECL)
10764 pattern_defined = (DECL_SAVED_TREE (code_pattern) != NULL_TREE);
10766 pattern_defined = ! DECL_IN_AGGR_P (code_pattern);
10768 input_location = DECL_SOURCE_LOCATION (d);
10770 if (pattern_defined)
10772 /* Let the repository code that this template definition is
10775 The repository doesn't need to know about cloned functions
10776 because they never actually show up in the object file. It
10777 does need to know about the clones; those are the symbols
10778 that the linker will be emitting error messages about. */
10779 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (d)
10780 || DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (d))
10784 for (t = TREE_CHAIN (d);
10785 t && DECL_CLONED_FUNCTION_P (t);
10786 t = TREE_CHAIN (t))
10787 repo_template_used (t);
10790 repo_template_used (d);
10792 if (flag_external_templates && ! DECL_INTERFACE_KNOWN (d))
10794 if (flag_alt_external_templates)
10796 if (interface_unknown)
10797 warn_if_unknown_interface (d);
10799 else if (DECL_INTERFACE_KNOWN (code_pattern))
10801 DECL_INTERFACE_KNOWN (d) = 1;
10802 DECL_NOT_REALLY_EXTERN (d) = ! DECL_EXTERNAL (code_pattern);
10805 warn_if_unknown_interface (code_pattern);
10809 import_export_decl (d);
10814 /* Recheck the substitutions to obtain any warning messages
10815 about ignoring cv qualifiers. */
10816 tree gen = DECL_TEMPLATE_RESULT (gen_tmpl);
10817 tree type = TREE_TYPE (gen);
10819 /* Make sure that we can see identifiers, and compute access
10820 correctly. D is already the target FUNCTION_DECL with the
10822 push_access_scope (d);
10824 if (TREE_CODE (gen) == FUNCTION_DECL)
10826 tsubst (DECL_ARGUMENTS (gen), gen_args, tf_error | tf_warning, d);
10827 tsubst (TYPE_RAISES_EXCEPTIONS (type), gen_args,
10828 tf_error | tf_warning, d);
10829 /* Don't simply tsubst the function type, as that will give
10830 duplicate warnings about poor parameter qualifications.
10831 The function arguments are the same as the decl_arguments
10832 without the top level cv qualifiers. */
10833 type = TREE_TYPE (type);
10835 tsubst (type, gen_args, tf_error | tf_warning, d);
10837 pop_access_scope (d);
10840 if (TREE_CODE (d) == VAR_DECL && DECL_INITIALIZED_IN_CLASS_P (d)
10841 && DECL_INITIAL (d) == NULL_TREE)
10842 /* We should have set up DECL_INITIAL in instantiate_class_template. */
10844 /* Reject all external templates except inline functions. */
10845 else if (DECL_INTERFACE_KNOWN (d)
10846 && ! DECL_NOT_REALLY_EXTERN (d)
10847 && ! (TREE_CODE (d) == FUNCTION_DECL
10848 && DECL_INLINE (d)))
10850 /* Defer all other templates, unless we have been explicitly
10851 forbidden from doing so. We restore the source position here
10852 because it's used by add_pending_template. */
10853 else if (! pattern_defined || defer_ok)
10855 input_location = saved_loc;
10857 if (at_eof && !pattern_defined
10858 && DECL_EXPLICIT_INSTANTIATION (d))
10861 The definition of a non-exported function template, a
10862 non-exported member function template, or a non-exported
10863 member function or static data member of a class template
10864 shall be present in every translation unit in which it is
10865 explicitly instantiated. */
10867 ("explicit instantiation of `%D' but no definition available", d);
10869 add_pending_template (d);
10873 need_push = !global_bindings_p ();
10875 push_to_top_level ();
10877 /* Regenerate the declaration in case the template has been modified
10878 by a subsequent redeclaration. */
10879 regenerate_decl_from_template (d, td);
10881 /* We already set the file and line above. Reset them now in case
10882 they changed as a result of calling
10883 regenerate_decl_from_template. */
10884 input_location = DECL_SOURCE_LOCATION (d);
10886 if (TREE_CODE (d) == VAR_DECL)
10888 /* Clear out DECL_RTL; whatever was there before may not be right
10889 since we've reset the type of the declaration. */
10890 SET_DECL_RTL (d, NULL_RTX);
10892 DECL_IN_AGGR_P (d) = 0;
10893 import_export_decl (d);
10894 DECL_EXTERNAL (d) = ! DECL_NOT_REALLY_EXTERN (d);
10896 if (DECL_EXTERNAL (d))
10898 /* The fact that this code is executing indicates that:
10900 (1) D is a template static data member, for which a
10901 definition is available.
10903 (2) An implicit or explicit instantiation has occurred.
10905 (3) We are not going to emit a definition of the static
10906 data member at this time.
10908 This situation is peculiar, but it occurs on platforms
10909 without weak symbols when performing an implicit
10910 instantiation. There, we cannot implicitly instantiate a
10911 defined static data member in more than one translation
10912 unit, so import_export_decl marks the declaration as
10913 external; we must rely on explicit instantiation. */
10917 /* Mark D as instantiated so that recursive calls to
10918 instantiate_decl do not try to instantiate it again. */
10919 DECL_TEMPLATE_INSTANTIATED (d) = 1;
10921 (!DECL_INITIALIZED_IN_CLASS_P (d)
10922 ? DECL_INITIAL (d) : NULL_TREE),
10926 else if (TREE_CODE (d) == FUNCTION_DECL)
10928 htab_t saved_local_specializations;
10933 /* Mark D as instantiated so that recursive calls to
10934 instantiate_decl do not try to instantiate it again. */
10935 DECL_TEMPLATE_INSTANTIATED (d) = 1;
10937 /* Save away the current list, in case we are instantiating one
10938 template from within the body of another. */
10939 saved_local_specializations = local_specializations;
10941 /* Set up the list of local specializations. */
10942 local_specializations = htab_create (37,
10943 hash_local_specialization,
10944 eq_local_specializations,
10947 /* Set up context. */
10948 import_export_decl (d);
10949 start_function (NULL_TREE, d, NULL_TREE, SF_PRE_PARSED);
10951 /* Create substitution entries for the parameters. */
10952 subst_decl = DECL_TEMPLATE_RESULT (template_for_substitution (d));
10953 tmpl_parm = DECL_ARGUMENTS (subst_decl);
10954 spec_parm = DECL_ARGUMENTS (d);
10955 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (d))
10957 register_local_specialization (spec_parm, tmpl_parm);
10958 spec_parm = skip_artificial_parms_for (d, spec_parm);
10959 tmpl_parm = skip_artificial_parms_for (subst_decl, tmpl_parm);
10963 register_local_specialization (spec_parm, tmpl_parm);
10964 tmpl_parm = TREE_CHAIN (tmpl_parm);
10965 spec_parm = TREE_CHAIN (spec_parm);
10967 my_friendly_assert (!spec_parm, 20020813);
10969 /* Substitute into the body of the function. */
10970 tsubst_expr (DECL_SAVED_TREE (code_pattern), args,
10971 tf_error | tf_warning, tmpl);
10973 /* We don't need the local specializations any more. */
10974 htab_delete (local_specializations);
10975 local_specializations = saved_local_specializations;
10977 /* Finish the function. */
10978 d = finish_function (0);
10979 expand_or_defer_fn (d);
10982 /* We're not deferring instantiation any more. */
10983 TI_PENDING_TEMPLATE_FLAG (DECL_TEMPLATE_INFO (d)) = 0;
10986 pop_from_top_level ();
10989 input_location = saved_loc;
10990 pop_deferring_access_checks ();
10991 pop_tinst_level ();
10993 timevar_pop (TV_PARSE);
10998 /* Run through the list of templates that we wish we could
10999 instantiate, and instantiate any we can. */
11002 instantiate_pending_templates (void)
11005 tree last = NULL_TREE;
11006 int instantiated_something = 0;
11013 t = &pending_templates;
11016 tree instantiation = TREE_VALUE (*t);
11018 reopen_tinst_level (TREE_PURPOSE (*t));
11020 if (TYPE_P (instantiation))
11024 if (!COMPLETE_TYPE_P (instantiation))
11026 instantiate_class_template (instantiation);
11027 if (CLASSTYPE_TEMPLATE_INSTANTIATION (instantiation))
11028 for (fn = TYPE_METHODS (instantiation);
11030 fn = TREE_CHAIN (fn))
11031 if (! DECL_ARTIFICIAL (fn))
11032 instantiate_decl (fn, /*defer_ok=*/0);
11033 if (COMPLETE_TYPE_P (instantiation))
11035 instantiated_something = 1;
11040 if (COMPLETE_TYPE_P (instantiation))
11041 /* If INSTANTIATION has been instantiated, then we don't
11042 need to consider it again in the future. */
11043 *t = TREE_CHAIN (*t);
11047 t = &TREE_CHAIN (*t);
11052 if (!DECL_TEMPLATE_SPECIALIZATION (instantiation)
11053 && !DECL_TEMPLATE_INSTANTIATED (instantiation))
11055 instantiation = instantiate_decl (instantiation,
11057 if (DECL_TEMPLATE_INSTANTIATED (instantiation))
11059 instantiated_something = 1;
11064 if (DECL_TEMPLATE_SPECIALIZATION (instantiation)
11065 || DECL_TEMPLATE_INSTANTIATED (instantiation))
11066 /* If INSTANTIATION has been instantiated, then we don't
11067 need to consider it again in the future. */
11068 *t = TREE_CHAIN (*t);
11072 t = &TREE_CHAIN (*t);
11076 current_tinst_level = NULL_TREE;
11078 last_pending_template = last;
11080 while (reconsider);
11082 return instantiated_something;
11085 /* Substitute ARGVEC into T, which is a list of initializers for
11086 either base class or a non-static data member. The TREE_PURPOSEs
11087 are DECLs, and the TREE_VALUEs are the initializer values. Used by
11088 instantiate_decl. */
11091 tsubst_initializer_list (tree t, tree argvec)
11093 tree inits = NULL_TREE;
11095 for (; t; t = TREE_CHAIN (t))
11101 decl = tsubst_copy (TREE_PURPOSE (t), argvec, tf_error | tf_warning,
11103 decl = expand_member_init (decl);
11104 if (decl && !DECL_P (decl))
11105 in_base_initializer = 1;
11107 init = tsubst_expr (TREE_VALUE (t), argvec, tf_error | tf_warning,
11111 else if (TREE_CODE (init) == TREE_LIST)
11112 for (val = init; val; val = TREE_CHAIN (val))
11113 TREE_VALUE (val) = convert_from_reference (TREE_VALUE (val));
11114 else if (init != void_type_node)
11115 init = convert_from_reference (init);
11117 in_base_initializer = 0;
11121 init = build_tree_list (decl, init);
11122 TREE_CHAIN (init) = inits;
11129 /* Set CURRENT_ACCESS_SPECIFIER based on the protection of DECL. */
11132 set_current_access_from_decl (tree decl)
11134 if (TREE_PRIVATE (decl))
11135 current_access_specifier = access_private_node;
11136 else if (TREE_PROTECTED (decl))
11137 current_access_specifier = access_protected_node;
11139 current_access_specifier = access_public_node;
11142 /* Instantiate an enumerated type. TAG is the template type, NEWTAG
11143 is the instantiation (which should have been created with
11144 start_enum) and ARGS are the template arguments to use. */
11147 tsubst_enum (tree tag, tree newtag, tree args)
11151 for (e = TYPE_VALUES (tag); e; e = TREE_CHAIN (e))
11155 /* Note that in a template enum, the TREE_VALUE is the
11156 CONST_DECL, not the corresponding INTEGER_CST. */
11157 value = tsubst_expr (DECL_INITIAL (TREE_VALUE (e)),
11158 args, tf_error | tf_warning,
11161 /* Give this enumeration constant the correct access. */
11162 set_current_access_from_decl (TREE_VALUE (e));
11164 /* Actually build the enumerator itself. */
11165 build_enumerator (TREE_PURPOSE (e), value, newtag);
11168 finish_enum (newtag);
11169 DECL_SOURCE_LOCATION (TYPE_NAME (newtag))
11170 = DECL_SOURCE_LOCATION (TYPE_NAME (tag));
11173 /* DECL is a FUNCTION_DECL that is a template specialization. Return
11174 its type -- but without substituting the innermost set of template
11175 arguments. So, innermost set of template parameters will appear in
11179 get_mostly_instantiated_function_type (tree decl)
11187 tmpl = most_general_template (DECL_TI_TEMPLATE (decl));
11188 targs = DECL_TI_ARGS (decl);
11189 tparms = DECL_TEMPLATE_PARMS (tmpl);
11190 parm_depth = TMPL_PARMS_DEPTH (tparms);
11192 /* There should be as many levels of arguments as there are levels
11194 my_friendly_assert (parm_depth == TMPL_ARGS_DEPTH (targs), 0);
11196 fn_type = TREE_TYPE (tmpl);
11198 if (parm_depth == 1)
11199 /* No substitution is necessary. */
11206 /* Replace the innermost level of the TARGS with NULL_TREEs to
11207 let tsubst know not to substitute for those parameters. */
11208 partial_args = make_tree_vec (TREE_VEC_LENGTH (targs));
11209 for (i = 1; i < TMPL_ARGS_DEPTH (targs); ++i)
11210 SET_TMPL_ARGS_LEVEL (partial_args, i,
11211 TMPL_ARGS_LEVEL (targs, i));
11212 SET_TMPL_ARGS_LEVEL (partial_args,
11213 TMPL_ARGS_DEPTH (targs),
11214 make_tree_vec (DECL_NTPARMS (tmpl)));
11216 /* Make sure that we can see identifiers, and compute access
11217 correctly. We can just use the context of DECL for the
11218 partial substitution here. It depends only on outer template
11219 parameters, regardless of whether the innermost level is
11220 specialized or not. */
11221 push_access_scope (decl);
11223 /* Now, do the (partial) substitution to figure out the
11224 appropriate function type. */
11225 fn_type = tsubst (fn_type, partial_args, tf_error, NULL_TREE);
11227 /* Substitute into the template parameters to obtain the real
11228 innermost set of parameters. This step is important if the
11229 innermost set of template parameters contains value
11230 parameters whose types depend on outer template parameters. */
11231 TREE_VEC_LENGTH (partial_args)--;
11232 tparms = tsubst_template_parms (tparms, partial_args, tf_error);
11234 pop_access_scope (decl);
11240 /* Return truthvalue if we're processing a template different from
11241 the last one involved in diagnostics. */
11243 problematic_instantiation_changed (void)
11245 return last_template_error_tick != tinst_level_tick;
11248 /* Remember current template involved in diagnostics. */
11250 record_last_problematic_instantiation (void)
11252 last_template_error_tick = tinst_level_tick;
11256 current_instantiation (void)
11258 return current_tinst_level;
11261 /* [temp.param] Check that template non-type parm TYPE is of an allowable
11262 type. Return zero for ok, nonzero for disallowed. Issue error and
11263 warning messages under control of COMPLAIN. */
11266 invalid_nontype_parm_type_p (tree type, tsubst_flags_t complain)
11268 if (INTEGRAL_TYPE_P (type))
11270 else if (POINTER_TYPE_P (type))
11272 else if (TYPE_PTR_TO_MEMBER_P (type))
11274 else if (TREE_CODE (type) == TEMPLATE_TYPE_PARM)
11276 else if (TREE_CODE (type) == TYPENAME_TYPE)
11279 if (complain & tf_error)
11280 error ("`%#T' is not a valid type for a template constant parameter",
11285 /* Returns TRUE if TYPE is dependent, in the sense of [temp.dep.type].
11286 Assumes that TYPE really is a type, and not the ERROR_MARK_NODE.*/
11289 dependent_type_p_r (tree type)
11295 A type is dependent if it is:
11297 -- a template parameter. */
11298 if (TREE_CODE (type) == TEMPLATE_TYPE_PARM)
11300 /* -- a qualified-id with a nested-name-specifier which contains a
11301 class-name that names a dependent type or whose unqualified-id
11302 names a dependent type. */
11303 if (TREE_CODE (type) == TYPENAME_TYPE)
11305 /* -- a cv-qualified type where the cv-unqualified type is
11307 type = TYPE_MAIN_VARIANT (type);
11308 /* -- a compound type constructed from any dependent type. */
11309 if (TYPE_PTR_TO_MEMBER_P (type))
11310 return (dependent_type_p (TYPE_PTRMEM_CLASS_TYPE (type))
11311 || dependent_type_p (TYPE_PTRMEM_POINTED_TO_TYPE
11313 else if (TREE_CODE (type) == POINTER_TYPE
11314 || TREE_CODE (type) == REFERENCE_TYPE)
11315 return dependent_type_p (TREE_TYPE (type));
11316 else if (TREE_CODE (type) == FUNCTION_TYPE
11317 || TREE_CODE (type) == METHOD_TYPE)
11321 if (dependent_type_p (TREE_TYPE (type)))
11323 for (arg_type = TYPE_ARG_TYPES (type);
11325 arg_type = TREE_CHAIN (arg_type))
11326 if (dependent_type_p (TREE_VALUE (arg_type)))
11330 /* -- an array type constructed from any dependent type or whose
11331 size is specified by a constant expression that is
11332 value-dependent. */
11333 if (TREE_CODE (type) == ARRAY_TYPE)
11335 if (TYPE_DOMAIN (type)
11336 && ((value_dependent_expression_p
11337 (TYPE_MAX_VALUE (TYPE_DOMAIN (type))))
11338 || (type_dependent_expression_p
11339 (TYPE_MAX_VALUE (TYPE_DOMAIN (type))))))
11341 return dependent_type_p (TREE_TYPE (type));
11343 /* -- a template-id in which either the template name is a template
11344 parameter or any of the template arguments is a dependent type or
11345 an expression that is type-dependent or value-dependent.
11347 This language seems somewhat confused; for example, it does not
11348 discuss template template arguments. Therefore, we use the
11349 definition for dependent template arguments in [temp.dep.temp]. */
11350 if (CLASS_TYPE_P (type) && CLASSTYPE_TEMPLATE_INFO (type)
11351 && (dependent_template_id_p
11352 (CLASSTYPE_TI_TEMPLATE (type),
11353 CLASSTYPE_TI_ARGS (type))))
11355 else if (TREE_CODE (type) == BOUND_TEMPLATE_TEMPLATE_PARM)
11357 /* All TYPEOF_TYPEs are dependent; if the argument of the `typeof'
11358 expression is not type-dependent, then it should already been
11360 if (TREE_CODE (type) == TYPEOF_TYPE)
11362 /* The standard does not specifically mention types that are local
11363 to template functions or local classes, but they should be
11364 considered dependent too. For example:
11366 template <int I> void f() {
11371 The size of `E' cannot be known until the value of `I' has been
11372 determined. Therefore, `E' must be considered dependent. */
11373 scope = TYPE_CONTEXT (type);
11374 if (scope && TYPE_P (scope))
11375 return dependent_type_p (scope);
11376 else if (scope && TREE_CODE (scope) == FUNCTION_DECL)
11377 return type_dependent_expression_p (scope);
11379 /* Other types are non-dependent. */
11383 /* Returns TRUE if TYPE is dependent, in the sense of
11384 [temp.dep.type]. */
11387 dependent_type_p (tree type)
11389 /* If there are no template parameters in scope, then there can't be
11390 any dependent types. */
11391 if (!processing_template_decl)
11394 /* If the type is NULL, we have not computed a type for the entity
11395 in question; in that case, the type is dependent. */
11399 /* Erroneous types can be considered non-dependent. */
11400 if (type == error_mark_node)
11403 /* If we have not already computed the appropriate value for TYPE,
11405 if (!TYPE_DEPENDENT_P_VALID (type))
11407 TYPE_DEPENDENT_P (type) = dependent_type_p_r (type);
11408 TYPE_DEPENDENT_P_VALID (type) = 1;
11411 return TYPE_DEPENDENT_P (type);
11414 /* Returns TRUE if EXPRESSION is dependent, according to CRITERION. */
11417 dependent_scope_ref_p (tree expression, bool criterion (tree))
11422 my_friendly_assert (TREE_CODE (expression) == SCOPE_REF, 20030714);
11424 if (!TYPE_P (TREE_OPERAND (expression, 0)))
11427 scope = TREE_OPERAND (expression, 0);
11428 name = TREE_OPERAND (expression, 1);
11432 An id-expression is type-dependent if it contains a
11433 nested-name-specifier that contains a class-name that names a
11435 /* The suggested resolution to Core Issue 2 implies that if the
11436 qualifying type is the current class, then we must peek
11439 && currently_open_class (scope)
11440 && !criterion (name))
11442 if (dependent_type_p (scope))
11448 /* Returns TRUE if the EXPRESSION is value-dependent, in the sense of
11449 [temp.dep.constexpr] */
11452 value_dependent_expression_p (tree expression)
11454 if (!processing_template_decl)
11457 /* A name declared with a dependent type. */
11458 if (TREE_CODE (expression) == IDENTIFIER_NODE
11459 || (DECL_P (expression)
11460 && type_dependent_expression_p (expression)))
11462 /* A non-type template parameter. */
11463 if ((TREE_CODE (expression) == CONST_DECL
11464 && DECL_TEMPLATE_PARM_P (expression))
11465 || TREE_CODE (expression) == TEMPLATE_PARM_INDEX)
11467 /* A constant with integral or enumeration type and is initialized
11468 with an expression that is value-dependent. */
11469 if (TREE_CODE (expression) == VAR_DECL
11470 && DECL_INITIAL (expression)
11471 && INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (expression))
11472 && value_dependent_expression_p (DECL_INITIAL (expression)))
11474 /* These expressions are value-dependent if the type to which the
11475 cast occurs is dependent or the expression being casted is
11476 value-dependent. */
11477 if (TREE_CODE (expression) == DYNAMIC_CAST_EXPR
11478 || TREE_CODE (expression) == STATIC_CAST_EXPR
11479 || TREE_CODE (expression) == CONST_CAST_EXPR
11480 || TREE_CODE (expression) == REINTERPRET_CAST_EXPR
11481 || TREE_CODE (expression) == CAST_EXPR)
11483 if (dependent_type_p (TREE_TYPE (expression)))
11485 /* A functional cast has a list of operands. */
11486 expression = TREE_OPERAND (expression, 0);
11487 if (TREE_CODE (expression) == TREE_LIST)
11491 if (value_dependent_expression_p (TREE_VALUE (expression)))
11493 expression = TREE_CHAIN (expression);
11495 while (expression);
11499 return value_dependent_expression_p (expression);
11501 /* A `sizeof' expression is value-dependent if the operand is
11503 if (TREE_CODE (expression) == SIZEOF_EXPR
11504 || TREE_CODE (expression) == ALIGNOF_EXPR)
11506 expression = TREE_OPERAND (expression, 0);
11507 if (TYPE_P (expression))
11508 return dependent_type_p (expression);
11509 return type_dependent_expression_p (expression);
11511 if (TREE_CODE (expression) == SCOPE_REF)
11512 return dependent_scope_ref_p (expression, value_dependent_expression_p);
11513 /* A constant expression is value-dependent if any subexpression is
11514 value-dependent. */
11515 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (expression))))
11517 switch (TREE_CODE_CLASS (TREE_CODE (expression)))
11520 return (value_dependent_expression_p
11521 (TREE_OPERAND (expression, 0)));
11524 return ((value_dependent_expression_p
11525 (TREE_OPERAND (expression, 0)))
11526 || (value_dependent_expression_p
11527 (TREE_OPERAND (expression, 1))));
11531 for (i = 0; i < first_rtl_op (TREE_CODE (expression)); ++i)
11532 /* In some cases, some of the operands may be missing.
11533 (For example, in the case of PREDECREMENT_EXPR, the
11534 amount to increment by may be missing.) That doesn't
11535 make the expression dependent. */
11536 if (TREE_OPERAND (expression, i)
11537 && (value_dependent_expression_p
11538 (TREE_OPERAND (expression, i))))
11545 /* The expression is not value-dependent. */
11549 /* Returns TRUE if the EXPRESSION is type-dependent, in the sense of
11550 [temp.dep.expr]. */
11553 type_dependent_expression_p (tree expression)
11555 if (!processing_template_decl)
11558 if (expression == error_mark_node)
11561 /* An unresolved name is always dependent. */
11562 if (TREE_CODE (expression) == IDENTIFIER_NODE)
11565 /* Some expression forms are never type-dependent. */
11566 if (TREE_CODE (expression) == PSEUDO_DTOR_EXPR
11567 || TREE_CODE (expression) == SIZEOF_EXPR
11568 || TREE_CODE (expression) == ALIGNOF_EXPR
11569 || TREE_CODE (expression) == TYPEID_EXPR
11570 || TREE_CODE (expression) == DELETE_EXPR
11571 || TREE_CODE (expression) == VEC_DELETE_EXPR
11572 || TREE_CODE (expression) == THROW_EXPR)
11575 /* The types of these expressions depends only on the type to which
11576 the cast occurs. */
11577 if (TREE_CODE (expression) == DYNAMIC_CAST_EXPR
11578 || TREE_CODE (expression) == STATIC_CAST_EXPR
11579 || TREE_CODE (expression) == CONST_CAST_EXPR
11580 || TREE_CODE (expression) == REINTERPRET_CAST_EXPR
11581 || TREE_CODE (expression) == CAST_EXPR)
11582 return dependent_type_p (TREE_TYPE (expression));
11584 /* The types of these expressions depends only on the type created
11585 by the expression. */
11586 if (TREE_CODE (expression) == NEW_EXPR
11587 || TREE_CODE (expression) == VEC_NEW_EXPR)
11589 /* For NEW_EXPR tree nodes created inside a template, either
11590 the object type itself or a TREE_LIST may appear as the
11592 tree type = TREE_OPERAND (expression, 1);
11593 if (TREE_CODE (type) == TREE_LIST)
11594 /* This is an array type. We need to check array dimensions
11596 return dependent_type_p (TREE_VALUE (TREE_PURPOSE (type)))
11597 || value_dependent_expression_p
11598 (TREE_OPERAND (TREE_VALUE (type), 1));
11600 return dependent_type_p (type);
11603 if (TREE_CODE (expression) == SCOPE_REF
11604 && dependent_scope_ref_p (expression,
11605 type_dependent_expression_p))
11608 if (TREE_CODE (expression) == FUNCTION_DECL
11609 && DECL_LANG_SPECIFIC (expression)
11610 && DECL_TEMPLATE_INFO (expression)
11611 && (dependent_template_id_p
11612 (DECL_TI_TEMPLATE (expression),
11613 INNERMOST_TEMPLATE_ARGS (DECL_TI_ARGS (expression)))))
11616 if (TREE_TYPE (expression) == unknown_type_node)
11618 if (TREE_CODE (expression) == ADDR_EXPR)
11619 return type_dependent_expression_p (TREE_OPERAND (expression, 0));
11620 if (TREE_CODE (expression) == BASELINK)
11621 expression = BASELINK_FUNCTIONS (expression);
11622 if (TREE_CODE (expression) == TEMPLATE_ID_EXPR)
11624 if (any_dependent_template_arguments_p (TREE_OPERAND (expression,
11627 expression = TREE_OPERAND (expression, 0);
11629 if (TREE_CODE (expression) == OVERLOAD)
11633 if (type_dependent_expression_p (OVL_CURRENT (expression)))
11635 expression = OVL_NEXT (expression);
11642 return (dependent_type_p (TREE_TYPE (expression)));
11645 /* Returns TRUE if ARGS (a TREE_LIST of arguments to a function call)
11646 contains a type-dependent expression. */
11649 any_type_dependent_arguments_p (tree args)
11653 tree arg = TREE_VALUE (args);
11655 if (type_dependent_expression_p (arg))
11657 args = TREE_CHAIN (args);
11662 /* Returns TRUE if the ARG (a template argument) is dependent. */
11665 dependent_template_arg_p (tree arg)
11667 if (!processing_template_decl)
11670 if (TREE_CODE (arg) == TEMPLATE_DECL
11671 || TREE_CODE (arg) == TEMPLATE_TEMPLATE_PARM)
11672 return dependent_template_p (arg);
11673 else if (TYPE_P (arg))
11674 return dependent_type_p (arg);
11676 return (type_dependent_expression_p (arg)
11677 || value_dependent_expression_p (arg));
11680 /* Returns true if ARGS (a collection of template arguments) contains
11681 any dependent arguments. */
11684 any_dependent_template_arguments_p (tree args)
11689 my_friendly_assert (TREE_CODE (args) == TREE_LIST
11690 || TREE_CODE (args) == TREE_VEC,
11693 if (TREE_CODE (args) == TREE_LIST)
11697 if (dependent_template_arg_p (TREE_VALUE (args)))
11699 args = TREE_CHAIN (args);
11705 for (i = 0; i < TREE_VEC_LENGTH (args); ++i)
11706 if (dependent_template_arg_p (TREE_VEC_ELT (args, i)))
11713 /* Returns TRUE if the template TMPL is dependent. */
11716 dependent_template_p (tree tmpl)
11718 /* Template template parameters are dependent. */
11719 if (DECL_TEMPLATE_TEMPLATE_PARM_P (tmpl)
11720 || TREE_CODE (tmpl) == TEMPLATE_TEMPLATE_PARM)
11722 /* So are qualified names that have not been looked up. */
11723 if (TREE_CODE (tmpl) == SCOPE_REF)
11725 /* So are member templates of dependent classes. */
11726 if (TYPE_P (CP_DECL_CONTEXT (tmpl)))
11727 return dependent_type_p (DECL_CONTEXT (tmpl));
11731 /* Returns TRUE if the specialization TMPL<ARGS> is dependent. */
11734 dependent_template_id_p (tree tmpl, tree args)
11736 return (dependent_template_p (tmpl)
11737 || any_dependent_template_arguments_p (args));
11740 /* TYPE is a TYPENAME_TYPE. Returns the ordinary TYPE to which the
11741 TYPENAME_TYPE corresponds. Returns ERROR_MARK_NODE if no such TYPE
11742 can be found. Note that this function peers inside uninstantiated
11743 templates and therefore should be used only in extremely limited
11747 resolve_typename_type (tree type, bool only_current_p)
11754 my_friendly_assert (TREE_CODE (type) == TYPENAME_TYPE,
11757 scope = TYPE_CONTEXT (type);
11758 name = TYPE_IDENTIFIER (type);
11760 /* If the SCOPE is itself a TYPENAME_TYPE, then we need to resolve
11761 it first before we can figure out what NAME refers to. */
11762 if (TREE_CODE (scope) == TYPENAME_TYPE)
11763 scope = resolve_typename_type (scope, only_current_p);
11764 /* If we don't know what SCOPE refers to, then we cannot resolve the
11766 if (scope == error_mark_node || TREE_CODE (scope) == TYPENAME_TYPE)
11767 return error_mark_node;
11768 /* If the SCOPE is a template type parameter, we have no way of
11769 resolving the name. */
11770 if (TREE_CODE (scope) == TEMPLATE_TYPE_PARM)
11772 /* If the SCOPE is not the current instantiation, there's no reason
11773 to look inside it. */
11774 if (only_current_p && !currently_open_class (scope))
11775 return error_mark_node;
11776 /* If SCOPE is a partial instantiation, it will not have a valid
11777 TYPE_FIELDS list, so use the original template. */
11778 scope = CLASSTYPE_PRIMARY_TEMPLATE_TYPE (scope);
11779 /* Enter the SCOPE so that name lookup will be resolved as if we
11780 were in the class definition. In particular, SCOPE will no
11781 longer be considered a dependent type. */
11782 push_scope (scope);
11783 /* Look up the declaration. */
11784 decl = lookup_member (scope, name, /*protect=*/0, /*want_type=*/true);
11785 /* Obtain the set of qualifiers applied to the TYPE. */
11786 quals = cp_type_quals (type);
11787 /* For a TYPENAME_TYPE like "typename X::template Y<T>", we want to
11788 find a TEMPLATE_DECL. Otherwise, we want to find a TYPE_DECL. */
11790 type = error_mark_node;
11791 else if (TREE_CODE (TYPENAME_TYPE_FULLNAME (type)) == IDENTIFIER_NODE
11792 && TREE_CODE (decl) == TYPE_DECL)
11793 type = TREE_TYPE (decl);
11794 else if (TREE_CODE (TYPENAME_TYPE_FULLNAME (type)) == TEMPLATE_ID_EXPR
11795 && DECL_CLASS_TEMPLATE_P (decl))
11799 /* Obtain the template and the arguments. */
11800 tmpl = TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type), 0);
11801 args = TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type), 1);
11802 /* Instantiate the template. */
11803 type = lookup_template_class (tmpl, args, NULL_TREE, NULL_TREE,
11804 /*entering_scope=*/0, tf_error | tf_user);
11807 type = error_mark_node;
11808 /* Qualify the resulting type. */
11809 if (type != error_mark_node && quals)
11810 type = cp_build_qualified_type (type, quals);
11811 /* Leave the SCOPE. */
11817 /* EXPR is an expression which is not type-dependent. Return a proxy
11818 for EXPR that can be used to compute the types of larger
11819 expressions containing EXPR. */
11822 build_non_dependent_expr (tree expr)
11824 /* Preserve null pointer constants so that the type of things like
11825 "p == 0" where "p" is a pointer can be determined. */
11826 if (null_ptr_cst_p (expr))
11828 /* Preserve OVERLOADs; the functions must be available to resolve
11830 if (TREE_CODE (expr) == OVERLOAD)
11832 /* Otherwise, build a NON_DEPENDENT_EXPR.
11834 REFERENCE_TYPEs are not stripped for expressions in templates
11835 because doing so would play havoc with mangling. Consider, for
11838 template <typename T> void f<T& g>() { g(); }
11840 In the body of "f", the expression for "g" will have
11841 REFERENCE_TYPE, even though the standard says that it should
11842 not. The reason is that we must preserve the syntactic form of
11843 the expression so that mangling (say) "f<g>" inside the body of
11844 "f" works out correctly. Therefore, the REFERENCE_TYPE is
11846 return build (NON_DEPENDENT_EXPR, non_reference (TREE_TYPE (expr)));
11849 /* ARGS is a TREE_LIST of expressions as arguments to a function call.
11850 Return a new TREE_LIST with the various arguments replaced with
11851 equivalent non-dependent expressions. */
11854 build_non_dependent_args (tree args)
11859 new_args = NULL_TREE;
11860 for (a = args; a; a = TREE_CHAIN (a))
11861 new_args = tree_cons (NULL_TREE,
11862 build_non_dependent_expr (TREE_VALUE (a)),
11864 return nreverse (new_args);
11867 #include "gt-cp-pt.h"