1 /* Handle parameterized types (templates) for GNU C++.
2 Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
3 2001, 2002, 2003, 2004 Free Software Foundation, Inc.
4 Written by Ken Raeburn (raeburn@cygnus.com) while at Watchmaker Computing.
5 Rewritten by Jason Merrill (jason@cygnus.com).
7 This file is part of GCC.
9 GCC is free software; you can redistribute it and/or modify
10 it under the terms of the GNU General Public License as published by
11 the Free Software Foundation; either version 2, or (at your option)
14 GCC is distributed in the hope that it will be useful,
15 but WITHOUT ANY WARRANTY; without even the implied warranty of
16 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 GNU General Public License for more details.
19 You should have received a copy of the GNU General Public License
20 along with GCC; see the file COPYING. If not, write to
21 the Free Software Foundation, 59 Temple Place - Suite 330,
22 Boston, MA 02111-1307, USA. */
24 /* Known bugs or deficiencies include:
26 all methods must be provided in header files; can't use a source
27 file that contains only the method templates and "just win". */
31 #include "coretypes.h"
37 #include "tree-inline.h"
46 /* The type of functions taking a tree, and some additional data, and
48 typedef int (*tree_fn_t) (tree, void*);
50 /* The PENDING_TEMPLATES is a TREE_LIST of templates whose
51 instantiations have been deferred, either because their definitions
52 were not yet available, or because we were putting off doing the work.
53 The TREE_PURPOSE of each entry is either a DECL (for a function or
54 static data member), or a TYPE (for a class) indicating what we are
55 hoping to instantiate. The TREE_VALUE is not used. */
56 static GTY(()) tree pending_templates;
57 static GTY(()) tree last_pending_template;
59 int processing_template_parmlist;
60 static int template_header_count;
62 static GTY(()) tree saved_trees;
63 static GTY(()) varray_type inline_parm_levels;
64 static size_t inline_parm_levels_used;
66 static GTY(()) tree current_tinst_level;
68 static GTY(()) tree saved_access_scope;
70 /* A map from local variable declarations in the body of the template
71 presently being instantiated to the corresponding instantiated
73 static htab_t local_specializations;
75 #define UNIFY_ALLOW_NONE 0
76 #define UNIFY_ALLOW_MORE_CV_QUAL 1
77 #define UNIFY_ALLOW_LESS_CV_QUAL 2
78 #define UNIFY_ALLOW_DERIVED 4
79 #define UNIFY_ALLOW_INTEGER 8
80 #define UNIFY_ALLOW_OUTER_LEVEL 16
81 #define UNIFY_ALLOW_OUTER_MORE_CV_QUAL 32
82 #define UNIFY_ALLOW_OUTER_LESS_CV_QUAL 64
83 #define UNIFY_ALLOW_MAX_CORRECTION 128
85 #define GTB_VIA_VIRTUAL 1 /* The base class we are examining is
86 virtual, or a base class of a virtual
88 #define GTB_IGNORE_TYPE 2 /* We don't need to try to unify the current
89 type with the desired type. */
91 static void push_access_scope (tree);
92 static void pop_access_scope (tree);
93 static int resolve_overloaded_unification (tree, tree, tree, tree,
94 unification_kind_t, int);
95 static int try_one_overload (tree, tree, tree, tree, tree,
96 unification_kind_t, int, bool);
97 static int unify (tree, tree, tree, tree, int);
98 static void add_pending_template (tree);
99 static void reopen_tinst_level (tree);
100 static tree classtype_mangled_name (tree);
101 static char* mangle_class_name_for_template (const char *, tree, tree);
102 static tree tsubst_initializer_list (tree, tree);
103 static tree get_class_bindings (tree, tree, tree);
104 static tree coerce_template_parms (tree, tree, tree, tsubst_flags_t, int);
105 static void tsubst_enum (tree, tree, tree);
106 static tree add_to_template_args (tree, tree);
107 static tree add_outermost_template_args (tree, tree);
108 static bool check_instantiated_args (tree, tree, tsubst_flags_t);
109 static int maybe_adjust_types_for_deduction (unification_kind_t, tree*, tree*);
110 static int type_unification_real (tree, tree, tree, tree,
111 int, unification_kind_t, int, int);
112 static void note_template_header (int);
113 static tree convert_nontype_argument (tree, tree);
114 static tree convert_template_argument (tree, tree, tree,
115 tsubst_flags_t, int, tree);
116 static tree get_bindings_overload (tree, tree, tree);
117 static int for_each_template_parm (tree, tree_fn_t, void*, htab_t);
118 static tree build_template_parm_index (int, int, int, tree, tree);
119 static int inline_needs_template_parms (tree);
120 static void push_inline_template_parms_recursive (tree, int);
121 static tree retrieve_specialization (tree, tree);
122 static tree retrieve_local_specialization (tree);
123 static tree register_specialization (tree, tree, tree);
124 static void register_local_specialization (tree, tree);
125 static tree reduce_template_parm_level (tree, tree, int);
126 static tree build_template_decl (tree, tree);
127 static int mark_template_parm (tree, void *);
128 static int template_parm_this_level_p (tree, void *);
129 static tree tsubst_friend_function (tree, tree);
130 static tree tsubst_friend_class (tree, tree);
131 static int can_complete_type_without_circularity (tree);
132 static tree get_bindings (tree, tree, tree);
133 static tree get_bindings_real (tree, tree, tree, int, int, int);
134 static int template_decl_level (tree);
135 static int check_cv_quals_for_unify (int, tree, tree);
136 static tree tsubst_template_arg (tree, tree, tsubst_flags_t, tree);
137 static tree tsubst_template_args (tree, tree, tsubst_flags_t, tree);
138 static tree tsubst_template_parms (tree, tree, tsubst_flags_t);
139 static void regenerate_decl_from_template (tree, tree);
140 static tree most_specialized (tree, tree, tree);
141 static tree most_specialized_class (tree, tree);
142 static int template_class_depth_real (tree, int);
143 static tree tsubst_aggr_type (tree, tree, tsubst_flags_t, tree, int);
144 static tree tsubst_decl (tree, tree, tree, tsubst_flags_t);
145 static tree tsubst_arg_types (tree, tree, tsubst_flags_t, tree);
146 static tree tsubst_function_type (tree, tree, tsubst_flags_t, tree);
147 static void check_specialization_scope (void);
148 static tree process_partial_specialization (tree);
149 static void set_current_access_from_decl (tree);
150 static void check_default_tmpl_args (tree, tree, int, int);
151 static tree tsubst_call_declarator_parms (tree, tree, tsubst_flags_t, tree);
152 static tree get_template_base_recursive (tree, tree, tree, tree, tree, int);
153 static tree get_template_base (tree, tree, tree, tree);
154 static int verify_class_unification (tree, tree, tree);
155 static tree try_class_unification (tree, tree, tree, tree);
156 static int coerce_template_template_parms (tree, tree, tsubst_flags_t,
158 static tree determine_specialization (tree, tree, tree *, int);
159 static int template_args_equal (tree, tree);
160 static void tsubst_default_arguments (tree);
161 static tree for_each_template_parm_r (tree *, int *, void *);
162 static tree copy_default_args_to_explicit_spec_1 (tree, tree);
163 static void copy_default_args_to_explicit_spec (tree);
164 static int invalid_nontype_parm_type_p (tree, tsubst_flags_t);
165 static int eq_local_specializations (const void *, const void *);
166 static bool dependent_type_p_r (tree);
167 static tree tsubst (tree, tree, tsubst_flags_t, tree);
168 static tree tsubst_expr (tree, tree, tsubst_flags_t, tree);
169 static tree tsubst_copy (tree, tree, tsubst_flags_t, tree);
171 /* Make the current scope suitable for access checking when we are
172 processing T. T can be FUNCTION_DECL for instantiated function
173 template, or VAR_DECL for static member variable (need by
174 instantiate_decl). */
177 push_access_scope (tree t)
179 my_friendly_assert (TREE_CODE (t) == FUNCTION_DECL
180 || TREE_CODE (t) == VAR_DECL,
183 if (DECL_CLASS_SCOPE_P (t))
184 push_nested_class (DECL_CONTEXT (t));
186 push_to_top_level ();
188 if (TREE_CODE (t) == FUNCTION_DECL)
190 saved_access_scope = tree_cons
191 (NULL_TREE, current_function_decl, saved_access_scope);
192 current_function_decl = t;
196 /* Restore the scope set up by push_access_scope. T is the node we
200 pop_access_scope (tree t)
202 if (TREE_CODE (t) == FUNCTION_DECL)
204 current_function_decl = TREE_VALUE (saved_access_scope);
205 saved_access_scope = TREE_CHAIN (saved_access_scope);
208 if (DECL_CLASS_SCOPE_P (t))
211 pop_from_top_level ();
214 /* Do any processing required when DECL (a member template
215 declaration) is finished. Returns the TEMPLATE_DECL corresponding
216 to DECL, unless it is a specialization, in which case the DECL
217 itself is returned. */
220 finish_member_template_decl (tree decl)
222 if (decl == error_mark_node)
223 return error_mark_node;
225 my_friendly_assert (DECL_P (decl), 20020812);
227 if (TREE_CODE (decl) == TYPE_DECL)
231 type = TREE_TYPE (decl);
232 if (IS_AGGR_TYPE (type)
233 && CLASSTYPE_TEMPLATE_INFO (type)
234 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (type))
236 tree tmpl = CLASSTYPE_TI_TEMPLATE (type);
237 check_member_template (tmpl);
242 else if (TREE_CODE (decl) == FIELD_DECL)
243 error ("data member `%D' cannot be a member template", decl);
244 else if (DECL_TEMPLATE_INFO (decl))
246 if (!DECL_TEMPLATE_SPECIALIZATION (decl))
248 check_member_template (DECL_TI_TEMPLATE (decl));
249 return DECL_TI_TEMPLATE (decl);
255 error ("invalid member template declaration `%D'", decl);
257 return error_mark_node;
260 /* Returns the template nesting level of the indicated class TYPE.
270 A<T>::B<U> has depth two, while A<T> has depth one.
271 Both A<T>::B<int> and A<int>::B<U> have depth one, if
272 COUNT_SPECIALIZATIONS is 0 or if they are instantiations, not
275 This function is guaranteed to return 0 if passed NULL_TREE so
276 that, for example, `template_class_depth (current_class_type)' is
280 template_class_depth_real (tree type, int count_specializations)
285 type && TREE_CODE (type) != NAMESPACE_DECL;
286 type = (TREE_CODE (type) == FUNCTION_DECL)
287 ? CP_DECL_CONTEXT (type) : TYPE_CONTEXT (type))
289 if (TREE_CODE (type) != FUNCTION_DECL)
291 if (CLASSTYPE_TEMPLATE_INFO (type)
292 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (type))
293 && ((count_specializations
294 && CLASSTYPE_TEMPLATE_SPECIALIZATION (type))
295 || uses_template_parms (CLASSTYPE_TI_ARGS (type))))
300 if (DECL_TEMPLATE_INFO (type)
301 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (type))
302 && ((count_specializations
303 && DECL_TEMPLATE_SPECIALIZATION (type))
304 || uses_template_parms (DECL_TI_ARGS (type))))
312 /* Returns the template nesting level of the indicated class TYPE.
313 Like template_class_depth_real, but instantiations do not count in
317 template_class_depth (tree type)
319 return template_class_depth_real (type, /*count_specializations=*/0);
322 /* Returns 1 if processing DECL as part of do_pending_inlines
323 needs us to push template parms. */
326 inline_needs_template_parms (tree decl)
328 if (! DECL_TEMPLATE_INFO (decl))
331 return (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (most_general_template (decl)))
332 > (processing_template_decl + DECL_TEMPLATE_SPECIALIZATION (decl)));
335 /* Subroutine of maybe_begin_member_template_processing.
336 Push the template parms in PARMS, starting from LEVELS steps into the
337 chain, and ending at the beginning, since template parms are listed
341 push_inline_template_parms_recursive (tree parmlist, int levels)
343 tree parms = TREE_VALUE (parmlist);
347 push_inline_template_parms_recursive (TREE_CHAIN (parmlist), levels - 1);
349 ++processing_template_decl;
350 current_template_parms
351 = tree_cons (size_int (processing_template_decl),
352 parms, current_template_parms);
353 TEMPLATE_PARMS_FOR_INLINE (current_template_parms) = 1;
355 begin_scope (TREE_VEC_LENGTH (parms) ? sk_template_parms : sk_template_spec,
357 for (i = 0; i < TREE_VEC_LENGTH (parms); ++i)
359 tree parm = TREE_VALUE (TREE_VEC_ELT (parms, i));
360 my_friendly_assert (DECL_P (parm), 0);
362 switch (TREE_CODE (parm))
371 /* Make a CONST_DECL as is done in process_template_parm.
372 It is ugly that we recreate this here; the original
373 version built in process_template_parm is no longer
375 tree decl = build_decl (CONST_DECL, DECL_NAME (parm),
377 DECL_ARTIFICIAL (decl) = 1;
378 TREE_CONSTANT (decl) = TREE_READONLY (decl) = 1;
379 DECL_INITIAL (decl) = DECL_INITIAL (parm);
380 SET_DECL_TEMPLATE_PARM_P (decl);
391 /* Restore the template parameter context for a member template or
392 a friend template defined in a class definition. */
395 maybe_begin_member_template_processing (tree decl)
400 if (inline_needs_template_parms (decl))
402 parms = DECL_TEMPLATE_PARMS (most_general_template (decl));
403 levels = TMPL_PARMS_DEPTH (parms) - processing_template_decl;
405 if (DECL_TEMPLATE_SPECIALIZATION (decl))
408 parms = TREE_CHAIN (parms);
411 push_inline_template_parms_recursive (parms, levels);
414 /* Remember how many levels of template parameters we pushed so that
415 we can pop them later. */
416 if (!inline_parm_levels)
417 VARRAY_INT_INIT (inline_parm_levels, 4, "inline_parm_levels");
418 if (inline_parm_levels_used == inline_parm_levels->num_elements)
419 VARRAY_GROW (inline_parm_levels, 2 * inline_parm_levels_used);
420 VARRAY_INT (inline_parm_levels, inline_parm_levels_used) = levels;
421 ++inline_parm_levels_used;
424 /* Undo the effects of begin_member_template_processing. */
427 maybe_end_member_template_processing (void)
431 if (!inline_parm_levels_used)
434 --inline_parm_levels_used;
436 i < VARRAY_INT (inline_parm_levels, inline_parm_levels_used);
439 --processing_template_decl;
440 current_template_parms = TREE_CHAIN (current_template_parms);
445 /* Returns nonzero iff T is a member template function. We must be
448 template <class T> class C { void f(); }
450 Here, f is a template function, and a member, but not a member
451 template. This function does not concern itself with the origin of
452 T, only its present state. So if we have
454 template <class T> class C { template <class U> void f(U); }
456 then neither C<int>::f<char> nor C<T>::f<double> is considered
457 to be a member template. But, `template <class U> void
458 C<int>::f(U)' is considered a member template. */
461 is_member_template (tree t)
463 if (!DECL_FUNCTION_TEMPLATE_P (t))
464 /* Anything that isn't a function or a template function is
465 certainly not a member template. */
468 /* A local class can't have member templates. */
469 if (decl_function_context (t))
472 return (DECL_FUNCTION_MEMBER_P (DECL_TEMPLATE_RESULT (t))
473 /* If there are more levels of template parameters than
474 there are template classes surrounding the declaration,
475 then we have a member template. */
476 && (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (t)) >
477 template_class_depth (DECL_CONTEXT (t))));
481 /* Returns nonzero iff T is a member template class. See
482 is_member_template for a description of what precisely constitutes
483 a member template. */
486 is_member_template_class (tree t)
488 if (!DECL_CLASS_TEMPLATE_P (t))
489 /* Anything that isn't a class template, is certainly not a member
493 if (!DECL_CLASS_SCOPE_P (t))
494 /* Anything whose context isn't a class type is surely not a
498 /* If there are more levels of template parameters than there are
499 template classes surrounding the declaration, then we have a
501 return (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (t)) >
502 template_class_depth (DECL_CONTEXT (t)));
506 /* Return a new template argument vector which contains all of ARGS,
507 but has as its innermost set of arguments the EXTRA_ARGS. */
510 add_to_template_args (tree args, tree extra_args)
517 extra_depth = TMPL_ARGS_DEPTH (extra_args);
518 new_args = make_tree_vec (TMPL_ARGS_DEPTH (args) + extra_depth);
520 for (i = 1; i <= TMPL_ARGS_DEPTH (args); ++i)
521 SET_TMPL_ARGS_LEVEL (new_args, i, TMPL_ARGS_LEVEL (args, i));
523 for (j = 1; j <= extra_depth; ++j, ++i)
524 SET_TMPL_ARGS_LEVEL (new_args, i, TMPL_ARGS_LEVEL (extra_args, j));
529 /* Like add_to_template_args, but only the outermost ARGS are added to
530 the EXTRA_ARGS. In particular, all but TMPL_ARGS_DEPTH
531 (EXTRA_ARGS) levels are added. This function is used to combine
532 the template arguments from a partial instantiation with the
533 template arguments used to attain the full instantiation from the
534 partial instantiation. */
537 add_outermost_template_args (tree args, tree extra_args)
541 /* If there are more levels of EXTRA_ARGS than there are ARGS,
542 something very fishy is going on. */
543 my_friendly_assert (TMPL_ARGS_DEPTH (args) >= TMPL_ARGS_DEPTH (extra_args),
546 /* If *all* the new arguments will be the EXTRA_ARGS, just return
548 if (TMPL_ARGS_DEPTH (args) == TMPL_ARGS_DEPTH (extra_args))
551 /* For the moment, we make ARGS look like it contains fewer levels. */
552 TREE_VEC_LENGTH (args) -= TMPL_ARGS_DEPTH (extra_args);
554 new_args = add_to_template_args (args, extra_args);
556 /* Now, we restore ARGS to its full dimensions. */
557 TREE_VEC_LENGTH (args) += TMPL_ARGS_DEPTH (extra_args);
562 /* Return the N levels of innermost template arguments from the ARGS. */
565 get_innermost_template_args (tree args, int n)
571 my_friendly_assert (n >= 0, 20000603);
573 /* If N is 1, just return the innermost set of template arguments. */
575 return TMPL_ARGS_LEVEL (args, TMPL_ARGS_DEPTH (args));
577 /* If we're not removing anything, just return the arguments we were
579 extra_levels = TMPL_ARGS_DEPTH (args) - n;
580 my_friendly_assert (extra_levels >= 0, 20000603);
581 if (extra_levels == 0)
584 /* Make a new set of arguments, not containing the outer arguments. */
585 new_args = make_tree_vec (n);
586 for (i = 1; i <= n; ++i)
587 SET_TMPL_ARGS_LEVEL (new_args, i,
588 TMPL_ARGS_LEVEL (args, i + extra_levels));
593 /* We've got a template header coming up; push to a new level for storing
597 begin_template_parm_list (void)
599 /* We use a non-tag-transparent scope here, which causes pushtag to
600 put tags in this scope, rather than in the enclosing class or
601 namespace scope. This is the right thing, since we want
602 TEMPLATE_DECLS, and not TYPE_DECLS for template classes. For a
603 global template class, push_template_decl handles putting the
604 TEMPLATE_DECL into top-level scope. For a nested template class,
607 template <class T> struct S1 {
608 template <class T> struct S2 {};
611 pushtag contains special code to call pushdecl_with_scope on the
612 TEMPLATE_DECL for S2. */
613 begin_scope (sk_template_parms, NULL);
614 ++processing_template_decl;
615 ++processing_template_parmlist;
616 note_template_header (0);
619 /* This routine is called when a specialization is declared. If it is
620 invalid to declare a specialization here, an error is reported. */
623 check_specialization_scope (void)
625 tree scope = current_scope ();
629 An explicit specialization shall be declared in the namespace of
630 which the template is a member, or, for member templates, in the
631 namespace of which the enclosing class or enclosing class
632 template is a member. An explicit specialization of a member
633 function, member class or static data member of a class template
634 shall be declared in the namespace of which the class template
636 if (scope && TREE_CODE (scope) != NAMESPACE_DECL)
637 error ("explicit specialization in non-namespace scope `%D'",
642 In an explicit specialization declaration for a member of a class
643 template or a member template that appears in namespace scope,
644 the member template and some of its enclosing class templates may
645 remain unspecialized, except that the declaration shall not
646 explicitly specialize a class member template if its enclosing
647 class templates are not explicitly specialized as well. */
648 if (current_template_parms)
649 error ("enclosing class templates are not explicitly specialized");
652 /* We've just seen template <>. */
655 begin_specialization (void)
657 begin_scope (sk_template_spec, NULL);
658 note_template_header (1);
659 check_specialization_scope ();
662 /* Called at then end of processing a declaration preceded by
666 end_specialization (void)
669 reset_specialization ();
672 /* Any template <>'s that we have seen thus far are not referring to a
673 function specialization. */
676 reset_specialization (void)
678 processing_specialization = 0;
679 template_header_count = 0;
682 /* We've just seen a template header. If SPECIALIZATION is nonzero,
683 it was of the form template <>. */
686 note_template_header (int specialization)
688 processing_specialization = specialization;
689 template_header_count++;
692 /* We're beginning an explicit instantiation. */
695 begin_explicit_instantiation (void)
697 my_friendly_assert (!processing_explicit_instantiation, 20020913);
698 processing_explicit_instantiation = true;
703 end_explicit_instantiation (void)
705 my_friendly_assert(processing_explicit_instantiation, 20020913);
706 processing_explicit_instantiation = false;
709 /* The TYPE is being declared. If it is a template type, that means it
710 is a partial specialization. Do appropriate error-checking. */
713 maybe_process_partial_specialization (tree type)
715 /* TYPE maybe an ERROR_MARK_NODE. */
716 tree context = TYPE_P (type) ? TYPE_CONTEXT (type) : NULL_TREE;
718 if (CLASS_TYPE_P (type) && CLASSTYPE_USE_TEMPLATE (type))
720 /* This is for ordinary explicit specialization and partial
721 specialization of a template class such as:
723 template <> class C<int>;
727 template <class T> class C<T*>;
729 Make sure that `C<int>' and `C<T*>' are implicit instantiations. */
731 if (CLASSTYPE_IMPLICIT_INSTANTIATION (type)
732 && !COMPLETE_TYPE_P (type))
734 tree tpl_ns = decl_namespace_context (CLASSTYPE_TI_TEMPLATE (type));
735 if (is_associated_namespace (current_namespace, tpl_ns))
736 /* Same or super-using namespace. */;
739 pedwarn ("specializing `%#T' in different namespace", type);
740 cp_pedwarn_at (" from definition of `%#D'",
741 CLASSTYPE_TI_TEMPLATE (type));
743 SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (type);
744 if (processing_template_decl)
745 push_template_decl (TYPE_MAIN_DECL (type));
747 else if (CLASSTYPE_TEMPLATE_INSTANTIATION (type))
748 error ("specialization of `%T' after instantiation", type);
750 else if (CLASS_TYPE_P (type)
751 && !CLASSTYPE_USE_TEMPLATE (type)
752 && CLASSTYPE_TEMPLATE_INFO (type)
753 && context && CLASS_TYPE_P (context)
754 && CLASSTYPE_TEMPLATE_INFO (context))
756 /* This is for an explicit specialization of member class
757 template according to [temp.expl.spec/18]:
759 template <> template <class U> class C<int>::D;
761 The context `C<int>' must be an implicit instantiation.
762 Otherwise this is just a member class template declared
765 template <> class C<int> { template <class U> class D; };
766 template <> template <class U> class C<int>::D;
768 In the first case, `C<int>::D' is a specialization of `C<T>::D'
769 while in the second case, `C<int>::D' is a primary template
770 and `C<T>::D' may not exist. */
772 if (CLASSTYPE_IMPLICIT_INSTANTIATION (context)
773 && !COMPLETE_TYPE_P (type))
777 if (current_namespace
778 != decl_namespace_context (CLASSTYPE_TI_TEMPLATE (type)))
780 pedwarn ("specializing `%#T' in different namespace", type);
781 cp_pedwarn_at (" from definition of `%#D'",
782 CLASSTYPE_TI_TEMPLATE (type));
785 /* Check for invalid specialization after instantiation:
787 template <> template <> class C<int>::D<int>;
788 template <> template <class U> class C<int>::D; */
790 for (t = DECL_TEMPLATE_INSTANTIATIONS
791 (most_general_template (CLASSTYPE_TI_TEMPLATE (type)));
792 t; t = TREE_CHAIN (t))
793 if (TREE_VALUE (t) != type
794 && TYPE_CONTEXT (TREE_VALUE (t)) == context)
795 error ("specialization `%T' after instantiation `%T'",
796 type, TREE_VALUE (t));
798 /* Mark TYPE as a specialization. And as a result, we only
799 have one level of template argument for the innermost
801 SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (type);
802 CLASSTYPE_TI_ARGS (type)
803 = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type));
806 else if (processing_specialization)
807 error ("explicit specialization of non-template `%T'", type);
810 /* Retrieve the specialization (in the sense of [temp.spec] - a
811 specialization is either an instantiation or an explicit
812 specialization) of TMPL for the given template ARGS. If there is
813 no such specialization, return NULL_TREE. The ARGS are a vector of
814 arguments, or a vector of vectors of arguments, in the case of
815 templates with more than one level of parameters. */
818 retrieve_specialization (tree tmpl, tree args)
822 my_friendly_assert (TREE_CODE (tmpl) == TEMPLATE_DECL, 0);
824 /* There should be as many levels of arguments as there are
825 levels of parameters. */
826 my_friendly_assert (TMPL_ARGS_DEPTH (args)
827 == TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl)),
830 for (s = DECL_TEMPLATE_SPECIALIZATIONS (tmpl);
833 if (comp_template_args (TREE_PURPOSE (s), args))
834 return TREE_VALUE (s);
839 /* Like retrieve_specialization, but for local declarations. */
842 retrieve_local_specialization (tree tmpl)
844 tree spec = htab_find_with_hash (local_specializations, tmpl,
845 htab_hash_pointer (tmpl));
846 return spec ? TREE_PURPOSE (spec) : NULL_TREE;
849 /* Returns nonzero iff DECL is a specialization of TMPL. */
852 is_specialization_of (tree decl, tree tmpl)
856 if (TREE_CODE (decl) == FUNCTION_DECL)
860 t = DECL_TEMPLATE_INFO (t) ? DECL_TI_TEMPLATE (t) : NULL_TREE)
866 my_friendly_assert (TREE_CODE (decl) == TYPE_DECL, 0);
868 for (t = TREE_TYPE (decl);
870 t = CLASSTYPE_USE_TEMPLATE (t)
871 ? TREE_TYPE (CLASSTYPE_TI_TEMPLATE (t)) : NULL_TREE)
872 if (same_type_ignoring_top_level_qualifiers_p (t, TREE_TYPE (tmpl)))
879 /* Returns nonzero iff DECL is a specialization of friend declaration
880 FRIEND according to [temp.friend]. */
883 is_specialization_of_friend (tree decl, tree friend)
885 bool need_template = true;
888 my_friendly_assert (TREE_CODE (decl) == FUNCTION_DECL, 0);
890 /* For [temp.friend/6] when FRIEND is an ordinary member function
891 of a template class, we want to check if DECL is a specialization
893 if (TREE_CODE (friend) == FUNCTION_DECL
894 && DECL_TEMPLATE_INFO (friend)
895 && !DECL_USE_TEMPLATE (friend))
897 friend = DECL_TI_TEMPLATE (friend);
898 need_template = false;
901 /* There is nothing to do if this is not a template friend. */
902 if (TREE_CODE (friend) != TEMPLATE_DECL)
905 if (is_specialization_of (decl, friend))
909 A member of a class template may be declared to be a friend of a
910 non-template class. In this case, the corresponding member of
911 every specialization of the class template is a friend of the
912 class granting friendship.
914 For example, given a template friend declaration
916 template <class T> friend void A<T>::f();
918 the member function below is considered a friend
920 template <> struct A<int> {
924 For this type of template friend, TEMPLATE_DEPTH below will be
925 nonzero. To determine if DECL is a friend of FRIEND, we first
926 check if the enclosing class is a specialization of another. */
928 template_depth = template_class_depth (DECL_CONTEXT (friend));
930 && DECL_CLASS_SCOPE_P (decl)
931 && is_specialization_of (TYPE_NAME (DECL_CONTEXT (decl)),
932 CLASSTYPE_TI_TEMPLATE (DECL_CONTEXT (friend))))
934 /* Next, we check the members themselves. In order to handle
935 a few tricky cases like
937 template <class T> friend void A<T>::g(T t);
938 template <class T> template <T t> friend void A<T>::h();
940 we need to figure out what ARGS is (corresponding to `T' in above
941 examples) from DECL for later processing. */
943 tree context = DECL_CONTEXT (decl);
944 tree args = NULL_TREE;
945 int current_depth = 0;
946 while (current_depth < template_depth)
948 if (CLASSTYPE_TEMPLATE_INFO (context))
950 if (current_depth == 0)
951 args = TYPE_TI_ARGS (context);
953 args = add_to_template_args (TYPE_TI_ARGS (context), args);
956 context = TYPE_CONTEXT (context);
959 if (TREE_CODE (decl) == FUNCTION_DECL)
964 tree friend_args_type;
967 /* Make sure that both DECL and FRIEND are templates or
969 is_template = DECL_TEMPLATE_INFO (decl)
970 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl));
971 if (need_template ^ is_template)
973 else if (is_template)
975 /* If both are templates, check template parameter list. */
977 = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend),
979 if (!comp_template_parms
980 (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (decl)),
984 decl_type = TREE_TYPE (DECL_TI_TEMPLATE (decl));
987 decl_type = TREE_TYPE (decl);
989 friend_type = tsubst_function_type (TREE_TYPE (friend), args,
991 if (friend_type == error_mark_node)
994 /* Check if return types match. */
995 if (!same_type_p (TREE_TYPE (decl_type), TREE_TYPE (friend_type)))
998 /* Check if function parameter types match, ignoring the
1000 friend_args_type = TYPE_ARG_TYPES (friend_type);
1001 decl_args_type = TYPE_ARG_TYPES (decl_type);
1002 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (friend))
1003 friend_args_type = TREE_CHAIN (friend_args_type);
1004 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl))
1005 decl_args_type = TREE_CHAIN (decl_args_type);
1006 if (compparms (decl_args_type, friend_args_type))
1013 /* Register the specialization SPEC as a specialization of TMPL with
1014 the indicated ARGS. Returns SPEC, or an equivalent prior
1015 declaration, if available. */
1018 register_specialization (tree spec, tree tmpl, tree args)
1022 my_friendly_assert (TREE_CODE (tmpl) == TEMPLATE_DECL, 0);
1024 if (TREE_CODE (spec) == FUNCTION_DECL
1025 && uses_template_parms (DECL_TI_ARGS (spec)))
1026 /* This is the FUNCTION_DECL for a partial instantiation. Don't
1027 register it; we want the corresponding TEMPLATE_DECL instead.
1028 We use `uses_template_parms (DECL_TI_ARGS (spec))' rather than
1029 the more obvious `uses_template_parms (spec)' to avoid problems
1030 with default function arguments. In particular, given
1031 something like this:
1033 template <class T> void f(T t1, T t = T())
1035 the default argument expression is not substituted for in an
1036 instantiation unless and until it is actually needed. */
1039 /* There should be as many levels of arguments as there are
1040 levels of parameters. */
1041 my_friendly_assert (TMPL_ARGS_DEPTH (args)
1042 == TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl)),
1045 for (s = DECL_TEMPLATE_SPECIALIZATIONS (tmpl);
1049 tree fn = TREE_VALUE (s);
1051 /* We can sometimes try to re-register a specialization that we've
1052 already got. In particular, regenerate_decl_from_template
1053 calls duplicate_decls which will update the specialization
1054 list. But, we'll still get called again here anyhow. It's
1055 more convenient to simply allow this than to try to prevent it. */
1058 else if (comp_template_args (TREE_PURPOSE (s), args))
1060 if (DECL_TEMPLATE_SPECIALIZATION (spec))
1062 if (DECL_TEMPLATE_INSTANTIATION (fn))
1065 || DECL_EXPLICIT_INSTANTIATION (fn))
1067 error ("specialization of %D after instantiation",
1073 /* This situation should occur only if the first
1074 specialization is an implicit instantiation,
1075 the second is an explicit specialization, and
1076 the implicit instantiation has not yet been
1077 used. That situation can occur if we have
1078 implicitly instantiated a member function and
1079 then specialized it later.
1081 We can also wind up here if a friend
1082 declaration that looked like an instantiation
1083 turns out to be a specialization:
1085 template <class T> void foo(T);
1086 class S { friend void foo<>(int) };
1087 template <> void foo(int);
1089 We transform the existing DECL in place so that
1090 any pointers to it become pointers to the
1091 updated declaration.
1093 If there was a definition for the template, but
1094 not for the specialization, we want this to
1095 look as if there were no definition, and vice
1097 DECL_INITIAL (fn) = NULL_TREE;
1098 duplicate_decls (spec, fn);
1103 else if (DECL_TEMPLATE_SPECIALIZATION (fn))
1105 if (!duplicate_decls (spec, fn) && DECL_INITIAL (spec))
1106 /* Dup decl failed, but this is a new
1107 definition. Set the line number so any errors
1108 match this new definition. */
1109 DECL_SOURCE_LOCATION (fn) = DECL_SOURCE_LOCATION (spec);
1117 DECL_TEMPLATE_SPECIALIZATIONS (tmpl)
1118 = tree_cons (args, spec, DECL_TEMPLATE_SPECIALIZATIONS (tmpl));
1123 /* Unregister the specialization SPEC as a specialization of TMPL.
1124 Replace it with NEW_SPEC, if NEW_SPEC is non-NULL. Returns true
1125 if the SPEC was listed as a specialization of TMPL. */
1128 reregister_specialization (tree spec, tree tmpl, tree new_spec)
1132 for (s = &DECL_TEMPLATE_SPECIALIZATIONS (tmpl);
1134 s = &TREE_CHAIN (*s))
1135 if (TREE_VALUE (*s) == spec)
1138 *s = TREE_CHAIN (*s);
1140 TREE_VALUE (*s) = new_spec;
1147 /* Compare an entry in the local specializations hash table P1 (which
1148 is really a pointer to a TREE_LIST) with P2 (which is really a
1152 eq_local_specializations (const void *p1, const void *p2)
1154 return TREE_VALUE ((tree) p1) == (tree) p2;
1157 /* Hash P1, an entry in the local specializations table. */
1160 hash_local_specialization (const void* p1)
1162 return htab_hash_pointer (TREE_VALUE ((tree) p1));
1165 /* Like register_specialization, but for local declarations. We are
1166 registering SPEC, an instantiation of TMPL. */
1169 register_local_specialization (tree spec, tree tmpl)
1173 slot = htab_find_slot_with_hash (local_specializations, tmpl,
1174 htab_hash_pointer (tmpl), INSERT);
1175 *slot = build_tree_list (spec, tmpl);
1178 /* Print the list of candidate FNS in an error message. */
1181 print_candidates (tree fns)
1185 const char *str = "candidates are:";
1187 for (fn = fns; fn != NULL_TREE; fn = TREE_CHAIN (fn))
1191 for (f = TREE_VALUE (fn); f; f = OVL_NEXT (f))
1192 cp_error_at ("%s %+#D", str, OVL_CURRENT (f));
1197 /* Returns the template (one of the functions given by TEMPLATE_ID)
1198 which can be specialized to match the indicated DECL with the
1199 explicit template args given in TEMPLATE_ID. The DECL may be
1200 NULL_TREE if none is available. In that case, the functions in
1201 TEMPLATE_ID are non-members.
1203 If NEED_MEMBER_TEMPLATE is nonzero the function is known to be a
1204 specialization of a member template.
1206 The template args (those explicitly specified and those deduced)
1207 are output in a newly created vector *TARGS_OUT.
1209 If it is impossible to determine the result, an error message is
1210 issued. The error_mark_node is returned to indicate failure. */
1213 determine_specialization (tree template_id,
1216 int need_member_template)
1220 tree explicit_targs;
1221 tree candidates = NULL_TREE;
1222 tree templates = NULL_TREE;
1224 *targs_out = NULL_TREE;
1226 if (template_id == error_mark_node)
1227 return error_mark_node;
1229 fns = TREE_OPERAND (template_id, 0);
1230 explicit_targs = TREE_OPERAND (template_id, 1);
1232 if (fns == error_mark_node)
1233 return error_mark_node;
1235 /* Check for baselinks. */
1236 if (BASELINK_P (fns))
1237 fns = BASELINK_FUNCTIONS (fns);
1239 if (!is_overloaded_fn (fns))
1241 error ("`%D' is not a function template", fns);
1242 return error_mark_node;
1245 for (; fns; fns = OVL_NEXT (fns))
1247 tree fn = OVL_CURRENT (fns);
1249 if (TREE_CODE (fn) == TEMPLATE_DECL)
1251 tree decl_arg_types;
1254 /* DECL might be a specialization of FN. */
1256 /* Adjust the type of DECL in case FN is a static member. */
1257 decl_arg_types = TYPE_ARG_TYPES (TREE_TYPE (decl));
1258 if (DECL_STATIC_FUNCTION_P (fn)
1259 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl))
1260 decl_arg_types = TREE_CHAIN (decl_arg_types);
1262 /* Check that the number of function parameters matches.
1264 template <class T> void f(int i = 0);
1265 template <> void f<int>();
1266 The specialization f<int> is invalid but is not caught
1267 by get_bindings below. */
1269 fn_arg_types = TYPE_ARG_TYPES (TREE_TYPE (fn));
1270 if (list_length (fn_arg_types) != list_length (decl_arg_types))
1273 /* For a non-static member function, we need to make sure that
1274 the const qualification is the same. This can be done by
1275 checking the 'this' in the argument list. */
1276 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn)
1277 && !same_type_p (TREE_VALUE (fn_arg_types),
1278 TREE_VALUE (decl_arg_types)))
1281 /* See whether this function might be a specialization of this
1283 targs = get_bindings (fn, decl, explicit_targs);
1286 /* We cannot deduce template arguments that when used to
1287 specialize TMPL will produce DECL. */
1290 /* Save this template, and the arguments deduced. */
1291 templates = tree_cons (targs, fn, templates);
1293 else if (need_member_template)
1294 /* FN is an ordinary member function, and we need a
1295 specialization of a member template. */
1297 else if (TREE_CODE (fn) != FUNCTION_DECL)
1298 /* We can get IDENTIFIER_NODEs here in certain erroneous
1301 else if (!DECL_FUNCTION_MEMBER_P (fn))
1302 /* This is just an ordinary non-member function. Nothing can
1303 be a specialization of that. */
1305 else if (DECL_ARTIFICIAL (fn))
1306 /* Cannot specialize functions that are created implicitly. */
1310 tree decl_arg_types;
1312 /* This is an ordinary member function. However, since
1313 we're here, we can assume it's enclosing class is a
1314 template class. For example,
1316 template <typename T> struct S { void f(); };
1317 template <> void S<int>::f() {}
1319 Here, S<int>::f is a non-template, but S<int> is a
1320 template class. If FN has the same type as DECL, we
1321 might be in business. */
1323 if (!DECL_TEMPLATE_INFO (fn))
1324 /* Its enclosing class is an explicit specialization
1325 of a template class. This is not a candidate. */
1328 if (!same_type_p (TREE_TYPE (TREE_TYPE (decl)),
1329 TREE_TYPE (TREE_TYPE (fn))))
1330 /* The return types differ. */
1333 /* Adjust the type of DECL in case FN is a static member. */
1334 decl_arg_types = TYPE_ARG_TYPES (TREE_TYPE (decl));
1335 if (DECL_STATIC_FUNCTION_P (fn)
1336 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl))
1337 decl_arg_types = TREE_CHAIN (decl_arg_types);
1339 if (compparms (TYPE_ARG_TYPES (TREE_TYPE (fn)),
1342 candidates = tree_cons (NULL_TREE, fn, candidates);
1346 if (templates && TREE_CHAIN (templates))
1352 It is possible for a specialization with a given function
1353 signature to be instantiated from more than one function
1354 template. In such cases, explicit specification of the
1355 template arguments must be used to uniquely identify the
1356 function template specialization being specialized.
1358 Note that here, there's no suggestion that we're supposed to
1359 determine which of the candidate templates is most
1360 specialized. However, we, also have:
1364 Partial ordering of overloaded function template
1365 declarations is used in the following contexts to select
1366 the function template to which a function template
1367 specialization refers:
1369 -- when an explicit specialization refers to a function
1372 So, we do use the partial ordering rules, at least for now.
1373 This extension can only serve to make invalid programs valid,
1374 so it's safe. And, there is strong anecdotal evidence that
1375 the committee intended the partial ordering rules to apply;
1376 the EDG front-end has that behavior, and John Spicer claims
1377 that the committee simply forgot to delete the wording in
1378 [temp.expl.spec]. */
1379 tree tmpl = most_specialized (templates, decl, explicit_targs);
1380 if (tmpl && tmpl != error_mark_node)
1382 targs = get_bindings (tmpl, decl, explicit_targs);
1383 templates = tree_cons (targs, tmpl, NULL_TREE);
1387 if (templates == NULL_TREE && candidates == NULL_TREE)
1389 cp_error_at ("template-id `%D' for `%+D' does not match any template declaration",
1391 return error_mark_node;
1393 else if ((templates && TREE_CHAIN (templates))
1394 || (candidates && TREE_CHAIN (candidates))
1395 || (templates && candidates))
1397 cp_error_at ("ambiguous template specialization `%D' for `%+D'",
1399 chainon (candidates, templates);
1400 print_candidates (candidates);
1401 return error_mark_node;
1404 /* We have one, and exactly one, match. */
1407 /* It was a specialization of an ordinary member function in a
1409 *targs_out = copy_node (DECL_TI_ARGS (TREE_VALUE (candidates)));
1410 return DECL_TI_TEMPLATE (TREE_VALUE (candidates));
1413 /* It was a specialization of a template. */
1414 targs = DECL_TI_ARGS (DECL_TEMPLATE_RESULT (TREE_VALUE (templates)));
1415 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (targs))
1417 *targs_out = copy_node (targs);
1418 SET_TMPL_ARGS_LEVEL (*targs_out,
1419 TMPL_ARGS_DEPTH (*targs_out),
1420 TREE_PURPOSE (templates));
1423 *targs_out = TREE_PURPOSE (templates);
1424 return TREE_VALUE (templates);
1427 /* Returns a chain of parameter types, exactly like the SPEC_TYPES,
1428 but with the default argument values filled in from those in the
1432 copy_default_args_to_explicit_spec_1 (tree spec_types,
1435 tree new_spec_types;
1440 if (spec_types == void_list_node)
1441 return void_list_node;
1443 /* Substitute into the rest of the list. */
1445 copy_default_args_to_explicit_spec_1 (TREE_CHAIN (spec_types),
1446 TREE_CHAIN (tmpl_types));
1448 /* Add the default argument for this parameter. */
1449 return hash_tree_cons (TREE_PURPOSE (tmpl_types),
1450 TREE_VALUE (spec_types),
1454 /* DECL is an explicit specialization. Replicate default arguments
1455 from the template it specializes. (That way, code like:
1457 template <class T> void f(T = 3);
1458 template <> void f(double);
1461 works, as required.) An alternative approach would be to look up
1462 the correct default arguments at the call-site, but this approach
1463 is consistent with how implicit instantiations are handled. */
1466 copy_default_args_to_explicit_spec (tree decl)
1471 tree new_spec_types;
1475 tree object_type = NULL_TREE;
1476 tree in_charge = NULL_TREE;
1477 tree vtt = NULL_TREE;
1479 /* See if there's anything we need to do. */
1480 tmpl = DECL_TI_TEMPLATE (decl);
1481 tmpl_types = TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (tmpl)));
1482 for (t = tmpl_types; t; t = TREE_CHAIN (t))
1483 if (TREE_PURPOSE (t))
1488 old_type = TREE_TYPE (decl);
1489 spec_types = TYPE_ARG_TYPES (old_type);
1491 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl))
1493 /* Remove the this pointer, but remember the object's type for
1495 object_type = TREE_TYPE (TREE_VALUE (spec_types));
1496 spec_types = TREE_CHAIN (spec_types);
1497 tmpl_types = TREE_CHAIN (tmpl_types);
1499 if (DECL_HAS_IN_CHARGE_PARM_P (decl))
1501 /* DECL may contain more parameters than TMPL due to the extra
1502 in-charge parameter in constructors and destructors. */
1503 in_charge = spec_types;
1504 spec_types = TREE_CHAIN (spec_types);
1506 if (DECL_HAS_VTT_PARM_P (decl))
1509 spec_types = TREE_CHAIN (spec_types);
1513 /* Compute the merged default arguments. */
1515 copy_default_args_to_explicit_spec_1 (spec_types, tmpl_types);
1517 /* Compute the new FUNCTION_TYPE. */
1521 new_spec_types = hash_tree_cons (TREE_PURPOSE (vtt),
1526 /* Put the in-charge parameter back. */
1527 new_spec_types = hash_tree_cons (TREE_PURPOSE (in_charge),
1528 TREE_VALUE (in_charge),
1531 new_type = build_method_type_directly (object_type,
1532 TREE_TYPE (old_type),
1536 new_type = build_function_type (TREE_TYPE (old_type),
1538 new_type = cp_build_type_attribute_variant (new_type,
1539 TYPE_ATTRIBUTES (old_type));
1540 new_type = build_exception_variant (new_type,
1541 TYPE_RAISES_EXCEPTIONS (old_type));
1542 TREE_TYPE (decl) = new_type;
1545 /* Check to see if the function just declared, as indicated in
1546 DECLARATOR, and in DECL, is a specialization of a function
1547 template. We may also discover that the declaration is an explicit
1548 instantiation at this point.
1550 Returns DECL, or an equivalent declaration that should be used
1551 instead if all goes well. Issues an error message if something is
1552 amiss. Returns error_mark_node if the error is not easily
1555 FLAGS is a bitmask consisting of the following flags:
1557 2: The function has a definition.
1558 4: The function is a friend.
1560 The TEMPLATE_COUNT is the number of references to qualifying
1561 template classes that appeared in the name of the function. For
1564 template <class T> struct S { void f(); };
1567 the TEMPLATE_COUNT would be 1. However, explicitly specialized
1568 classes are not counted in the TEMPLATE_COUNT, so that in
1570 template <class T> struct S {};
1571 template <> struct S<int> { void f(); }
1572 template <> void S<int>::f();
1574 the TEMPLATE_COUNT would be 0. (Note that this declaration is
1575 invalid; there should be no template <>.)
1577 If the function is a specialization, it is marked as such via
1578 DECL_TEMPLATE_SPECIALIZATION. Furthermore, its DECL_TEMPLATE_INFO
1579 is set up correctly, and it is added to the list of specializations
1580 for that template. */
1583 check_explicit_specialization (tree declarator,
1588 int have_def = flags & 2;
1589 int is_friend = flags & 4;
1590 int specialization = 0;
1591 int explicit_instantiation = 0;
1592 int member_specialization = 0;
1593 tree ctype = DECL_CLASS_CONTEXT (decl);
1594 tree dname = DECL_NAME (decl);
1597 tsk = current_tmpl_spec_kind (template_count);
1602 if (processing_specialization)
1605 SET_DECL_TEMPLATE_SPECIALIZATION (decl);
1607 else if (TREE_CODE (declarator) == TEMPLATE_ID_EXPR)
1610 /* This could be something like:
1612 template <class T> void f(T);
1613 class S { friend void f<>(int); } */
1617 /* This case handles bogus declarations like template <>
1618 template <class T> void f<int>(); */
1620 error ("template-id `%D' in declaration of primary template",
1627 case tsk_invalid_member_spec:
1628 /* The error has already been reported in
1629 check_specialization_scope. */
1630 return error_mark_node;
1632 case tsk_invalid_expl_inst:
1633 error ("template parameter list used in explicit instantiation");
1639 error ("definition provided for explicit instantiation");
1641 explicit_instantiation = 1;
1644 case tsk_excessive_parms:
1645 error ("too many template parameter lists in declaration of `%D'",
1647 return error_mark_node;
1651 SET_DECL_TEMPLATE_SPECIALIZATION (decl);
1653 member_specialization = 1;
1658 case tsk_insufficient_parms:
1659 if (template_header_count)
1661 error("too few template parameter lists in declaration of `%D'",
1665 else if (ctype != NULL_TREE
1666 && !TYPE_BEING_DEFINED (ctype)
1667 && CLASSTYPE_TEMPLATE_INSTANTIATION (ctype)
1670 /* For backwards compatibility, we accept:
1672 template <class T> struct S { void f(); };
1673 void S<int>::f() {} // Missing template <>
1675 That used to be valid C++. */
1678 ("explicit specialization not preceded by `template <>'");
1680 SET_DECL_TEMPLATE_SPECIALIZATION (decl);
1685 if (TREE_CODE (declarator) == TEMPLATE_ID_EXPR)
1687 /* This case handles bogus declarations like template <>
1688 template <class T> void f<int>(); */
1690 if (uses_template_parms (declarator))
1691 error ("partial specialization `%D' of function template",
1694 error ("template-id `%D' in declaration of primary template",
1699 if (ctype && CLASSTYPE_TEMPLATE_INSTANTIATION (ctype))
1700 /* This is a specialization of a member template, without
1701 specialization the containing class. Something like:
1703 template <class T> struct S {
1704 template <class U> void f (U);
1706 template <> template <class U> void S<int>::f(U) {}
1708 That's a specialization -- but of the entire template. */
1716 if (specialization || member_specialization)
1718 tree t = TYPE_ARG_TYPES (TREE_TYPE (decl));
1719 for (; t; t = TREE_CHAIN (t))
1720 if (TREE_PURPOSE (t))
1723 ("default argument specified in explicit specialization");
1726 if (current_lang_name == lang_name_c)
1727 error ("template specialization with C linkage");
1730 if (specialization || member_specialization || explicit_instantiation)
1732 tree tmpl = NULL_TREE;
1733 tree targs = NULL_TREE;
1735 /* Make sure that the declarator is a TEMPLATE_ID_EXPR. */
1736 if (TREE_CODE (declarator) != TEMPLATE_ID_EXPR)
1740 my_friendly_assert (TREE_CODE (declarator) == IDENTIFIER_NODE, 0);
1745 /* If there is no class context, the explicit instantiation
1746 must be at namespace scope. */
1747 my_friendly_assert (DECL_NAMESPACE_SCOPE_P (decl), 20030625);
1749 /* Find the namespace binding, using the declaration
1751 fns = namespace_binding (dname, CP_DECL_CONTEXT (decl));
1754 declarator = lookup_template_function (fns, NULL_TREE);
1757 if (declarator == error_mark_node)
1758 return error_mark_node;
1760 if (ctype != NULL_TREE && TYPE_BEING_DEFINED (ctype))
1762 if (!explicit_instantiation)
1763 /* A specialization in class scope. This is invalid,
1764 but the error will already have been flagged by
1765 check_specialization_scope. */
1766 return error_mark_node;
1769 /* It's not valid to write an explicit instantiation in
1772 class C { template void f(); }
1774 This case is caught by the parser. However, on
1777 template class C { void f(); };
1779 (which is invalid) we can get here. The error will be
1786 else if (ctype != NULL_TREE
1787 && (TREE_CODE (TREE_OPERAND (declarator, 0)) ==
1790 /* Find the list of functions in ctype that have the same
1791 name as the declared function. */
1792 tree name = TREE_OPERAND (declarator, 0);
1793 tree fns = NULL_TREE;
1796 if (constructor_name_p (name, ctype))
1798 int is_constructor = DECL_CONSTRUCTOR_P (decl);
1800 if (is_constructor ? !TYPE_HAS_CONSTRUCTOR (ctype)
1801 : !TYPE_HAS_DESTRUCTOR (ctype))
1803 /* From [temp.expl.spec]:
1805 If such an explicit specialization for the member
1806 of a class template names an implicitly-declared
1807 special member function (clause _special_), the
1808 program is ill-formed.
1810 Similar language is found in [temp.explicit]. */
1811 error ("specialization of implicitly-declared special member function");
1812 return error_mark_node;
1815 name = is_constructor ? ctor_identifier : dtor_identifier;
1818 if (!DECL_CONV_FN_P (decl))
1820 idx = lookup_fnfields_1 (ctype, name);
1822 fns = TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (ctype), idx);
1828 /* For a type-conversion operator, we cannot do a
1829 name-based lookup. We might be looking for `operator
1830 int' which will be a specialization of `operator T'.
1831 So, we find *all* the conversion operators, and then
1832 select from them. */
1835 methods = CLASSTYPE_METHOD_VEC (ctype);
1837 for (idx = CLASSTYPE_FIRST_CONVERSION_SLOT;
1838 idx < TREE_VEC_LENGTH (methods); ++idx)
1840 tree ovl = TREE_VEC_ELT (methods, idx);
1842 if (!ovl || !DECL_CONV_FN_P (OVL_CURRENT (ovl)))
1843 /* There are no more conversion functions. */
1846 /* Glue all these conversion functions together
1847 with those we already have. */
1848 for (; ovl; ovl = OVL_NEXT (ovl))
1849 fns = ovl_cons (OVL_CURRENT (ovl), fns);
1853 if (fns == NULL_TREE)
1855 error ("no member function `%D' declared in `%T'",
1857 return error_mark_node;
1860 TREE_OPERAND (declarator, 0) = fns;
1863 /* Figure out what exactly is being specialized at this point.
1864 Note that for an explicit instantiation, even one for a
1865 member function, we cannot tell apriori whether the
1866 instantiation is for a member template, or just a member
1867 function of a template class. Even if a member template is
1868 being instantiated, the member template arguments may be
1869 elided if they can be deduced from the rest of the
1871 tmpl = determine_specialization (declarator, decl,
1873 member_specialization);
1875 if (!tmpl || tmpl == error_mark_node)
1876 /* We couldn't figure out what this declaration was
1878 return error_mark_node;
1881 tree gen_tmpl = most_general_template (tmpl);
1883 if (explicit_instantiation)
1885 /* We don't set DECL_EXPLICIT_INSTANTIATION here; that
1886 is done by do_decl_instantiation later. */
1888 int arg_depth = TMPL_ARGS_DEPTH (targs);
1889 int parm_depth = TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl));
1891 if (arg_depth > parm_depth)
1893 /* If TMPL is not the most general template (for
1894 example, if TMPL is a friend template that is
1895 injected into namespace scope), then there will
1896 be too many levels of TARGS. Remove some of them
1901 new_targs = make_tree_vec (parm_depth);
1902 for (i = arg_depth - parm_depth; i < arg_depth; ++i)
1903 TREE_VEC_ELT (new_targs, i - (arg_depth - parm_depth))
1904 = TREE_VEC_ELT (targs, i);
1908 return instantiate_template (tmpl, targs, tf_error);
1911 /* If we thought that the DECL was a member function, but it
1912 turns out to be specializing a static member function,
1913 make DECL a static member function as well. We also have
1914 to adjust last_function_parms to avoid confusing
1915 start_function later. */
1916 if (DECL_STATIC_FUNCTION_P (tmpl)
1917 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl))
1919 revert_static_member_fn (decl);
1920 last_function_parms = TREE_CHAIN (last_function_parms);
1923 /* If this is a specialization of a member template of a
1924 template class. In we want to return the TEMPLATE_DECL,
1925 not the specialization of it. */
1926 if (tsk == tsk_template)
1928 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl);
1929 DECL_INITIAL (DECL_TEMPLATE_RESULT (tmpl)) = NULL_TREE;
1932 DECL_SOURCE_LOCATION (tmpl) = DECL_SOURCE_LOCATION (decl);
1933 DECL_SOURCE_LOCATION (DECL_TEMPLATE_RESULT (tmpl))
1934 = DECL_SOURCE_LOCATION (decl);
1939 /* Set up the DECL_TEMPLATE_INFO for DECL. */
1940 DECL_TEMPLATE_INFO (decl) = tree_cons (tmpl, targs, NULL_TREE);
1942 /* Inherit default function arguments from the template
1943 DECL is specializing. */
1944 copy_default_args_to_explicit_spec (decl);
1946 /* This specialization has the same protection as the
1947 template it specializes. */
1948 TREE_PRIVATE (decl) = TREE_PRIVATE (gen_tmpl);
1949 TREE_PROTECTED (decl) = TREE_PROTECTED (gen_tmpl);
1951 if (is_friend && !have_def)
1952 /* This is not really a declaration of a specialization.
1953 It's just the name of an instantiation. But, it's not
1954 a request for an instantiation, either. */
1955 SET_DECL_IMPLICIT_INSTANTIATION (decl);
1956 else if (DECL_CONSTRUCTOR_P (decl) || DECL_DESTRUCTOR_P (decl))
1957 /* This is indeed a specialization. In case of constructors
1958 and destructors, we need in-charge and not-in-charge
1959 versions in V3 ABI. */
1960 clone_function_decl (decl, /*update_method_vec_p=*/0);
1962 /* Register this specialization so that we can find it
1964 decl = register_specialization (decl, gen_tmpl, targs);
1971 /* TYPE is being declared. Verify that the use of template headers
1972 and such is reasonable. Issue error messages if not. */
1975 maybe_check_template_type (tree type)
1977 if (template_header_count)
1979 /* We are in the scope of some `template <...>' header. */
1982 = template_class_depth_real (TYPE_CONTEXT (type),
1983 /*count_specializations=*/1);
1985 if (template_header_count <= context_depth)
1986 /* This is OK; the template headers are for the context. We
1987 are actually too lenient here; like
1988 check_explicit_specialization we should consider the number
1989 of template types included in the actual declaration. For
1992 template <class T> struct S {
1993 template <class U> template <class V>
1999 template <class T> struct S {
2000 template <class U> struct I;
2003 template <class T> template <class U.
2008 else if (template_header_count > context_depth + 1)
2009 /* There are two many template parameter lists. */
2010 error ("too many template parameter lists in declaration of `%T'", type);
2014 /* Returns 1 iff PARMS1 and PARMS2 are identical sets of template
2015 parameters. These are represented in the same format used for
2016 DECL_TEMPLATE_PARMS. */
2018 int comp_template_parms (tree parms1, tree parms2)
2023 if (parms1 == parms2)
2026 for (p1 = parms1, p2 = parms2;
2027 p1 != NULL_TREE && p2 != NULL_TREE;
2028 p1 = TREE_CHAIN (p1), p2 = TREE_CHAIN (p2))
2030 tree t1 = TREE_VALUE (p1);
2031 tree t2 = TREE_VALUE (p2);
2034 my_friendly_assert (TREE_CODE (t1) == TREE_VEC, 0);
2035 my_friendly_assert (TREE_CODE (t2) == TREE_VEC, 0);
2037 if (TREE_VEC_LENGTH (t1) != TREE_VEC_LENGTH (t2))
2040 for (i = 0; i < TREE_VEC_LENGTH (t2); ++i)
2042 tree parm1 = TREE_VALUE (TREE_VEC_ELT (t1, i));
2043 tree parm2 = TREE_VALUE (TREE_VEC_ELT (t2, i));
2045 if (TREE_CODE (parm1) != TREE_CODE (parm2))
2048 if (TREE_CODE (parm1) == TEMPLATE_TYPE_PARM)
2050 else if (!same_type_p (TREE_TYPE (parm1), TREE_TYPE (parm2)))
2055 if ((p1 != NULL_TREE) != (p2 != NULL_TREE))
2056 /* One set of parameters has more parameters lists than the
2063 /* Complain if DECL shadows a template parameter.
2065 [temp.local]: A template-parameter shall not be redeclared within its
2066 scope (including nested scopes). */
2069 check_template_shadow (tree decl)
2073 /* If we're not in a template, we can't possibly shadow a template
2075 if (!current_template_parms)
2078 /* Figure out what we're shadowing. */
2079 if (TREE_CODE (decl) == OVERLOAD)
2080 decl = OVL_CURRENT (decl);
2081 olddecl = IDENTIFIER_VALUE (DECL_NAME (decl));
2083 /* If there's no previous binding for this name, we're not shadowing
2084 anything, let alone a template parameter. */
2088 /* If we're not shadowing a template parameter, we're done. Note
2089 that OLDDECL might be an OVERLOAD (or perhaps even an
2090 ERROR_MARK), so we can't just blithely assume it to be a _DECL
2092 if (!DECL_P (olddecl) || !DECL_TEMPLATE_PARM_P (olddecl))
2095 /* We check for decl != olddecl to avoid bogus errors for using a
2096 name inside a class. We check TPFI to avoid duplicate errors for
2097 inline member templates. */
2099 || TEMPLATE_PARMS_FOR_INLINE (current_template_parms))
2102 cp_error_at ("declaration of `%#D'", decl);
2103 cp_error_at (" shadows template parm `%#D'", olddecl);
2106 /* Return a new TEMPLATE_PARM_INDEX with the indicated INDEX, LEVEL,
2107 ORIG_LEVEL, DECL, and TYPE. */
2110 build_template_parm_index (int index,
2116 tree t = make_node (TEMPLATE_PARM_INDEX);
2117 TEMPLATE_PARM_IDX (t) = index;
2118 TEMPLATE_PARM_LEVEL (t) = level;
2119 TEMPLATE_PARM_ORIG_LEVEL (t) = orig_level;
2120 TEMPLATE_PARM_DECL (t) = decl;
2121 TREE_TYPE (t) = type;
2122 TREE_CONSTANT (t) = TREE_CONSTANT (decl);
2123 TREE_READONLY (t) = TREE_READONLY (decl);
2128 /* Return a TEMPLATE_PARM_INDEX, similar to INDEX, but whose
2129 TEMPLATE_PARM_LEVEL has been decreased by LEVELS. If such a
2130 TEMPLATE_PARM_INDEX already exists, it is returned; otherwise, a
2131 new one is created. */
2134 reduce_template_parm_level (tree index, tree type, int levels)
2136 if (TEMPLATE_PARM_DESCENDANTS (index) == NULL_TREE
2137 || (TEMPLATE_PARM_LEVEL (TEMPLATE_PARM_DESCENDANTS (index))
2138 != TEMPLATE_PARM_LEVEL (index) - levels))
2140 tree orig_decl = TEMPLATE_PARM_DECL (index);
2143 decl = build_decl (TREE_CODE (orig_decl), DECL_NAME (orig_decl), type);
2144 TREE_CONSTANT (decl) = TREE_CONSTANT (orig_decl);
2145 TREE_READONLY (decl) = TREE_READONLY (orig_decl);
2146 DECL_ARTIFICIAL (decl) = 1;
2147 SET_DECL_TEMPLATE_PARM_P (decl);
2149 t = build_template_parm_index (TEMPLATE_PARM_IDX (index),
2150 TEMPLATE_PARM_LEVEL (index) - levels,
2151 TEMPLATE_PARM_ORIG_LEVEL (index),
2153 TEMPLATE_PARM_DESCENDANTS (index) = t;
2155 /* Template template parameters need this. */
2156 DECL_TEMPLATE_PARMS (decl)
2157 = DECL_TEMPLATE_PARMS (TEMPLATE_PARM_DECL (index));
2160 return TEMPLATE_PARM_DESCENDANTS (index);
2163 /* Process information from new template parameter NEXT and append it to the
2164 LIST being built. */
2167 process_template_parm (tree list, tree next)
2175 my_friendly_assert (TREE_CODE (parm) == TREE_LIST, 259);
2176 defval = TREE_PURPOSE (parm);
2177 parm = TREE_VALUE (parm);
2178 is_type = TREE_PURPOSE (parm) == class_type_node;
2182 tree p = TREE_VALUE (tree_last (list));
2184 if (TREE_CODE (p) == TYPE_DECL || TREE_CODE (p) == TEMPLATE_DECL)
2185 idx = TEMPLATE_TYPE_IDX (TREE_TYPE (p));
2187 idx = TEMPLATE_PARM_IDX (DECL_INITIAL (p));
2195 my_friendly_assert (TREE_CODE (TREE_PURPOSE (parm)) == TREE_LIST, 260);
2196 /* is a const-param */
2197 parm = grokdeclarator (TREE_VALUE (parm), TREE_PURPOSE (parm),
2199 SET_DECL_TEMPLATE_PARM_P (parm);
2203 The top-level cv-qualifiers on the template-parameter are
2204 ignored when determining its type. */
2205 TREE_TYPE (parm) = TYPE_MAIN_VARIANT (TREE_TYPE (parm));
2207 /* A template parameter is not modifiable. */
2208 TREE_READONLY (parm) = TREE_CONSTANT (parm) = 1;
2209 if (invalid_nontype_parm_type_p (TREE_TYPE (parm), 1))
2210 TREE_TYPE (parm) = void_type_node;
2211 decl = build_decl (CONST_DECL, DECL_NAME (parm), TREE_TYPE (parm));
2212 TREE_CONSTANT (decl) = TREE_READONLY (decl) = 1;
2213 DECL_INITIAL (parm) = DECL_INITIAL (decl)
2214 = build_template_parm_index (idx, processing_template_decl,
2215 processing_template_decl,
2216 decl, TREE_TYPE (parm));
2221 parm = TREE_VALUE (parm);
2223 if (parm && TREE_CODE (parm) == TEMPLATE_DECL)
2225 t = make_aggr_type (TEMPLATE_TEMPLATE_PARM);
2226 /* This is for distinguishing between real templates and template
2227 template parameters */
2228 TREE_TYPE (parm) = t;
2229 TREE_TYPE (DECL_TEMPLATE_RESULT (parm)) = t;
2234 t = make_aggr_type (TEMPLATE_TYPE_PARM);
2235 /* parm is either IDENTIFIER_NODE or NULL_TREE. */
2236 decl = build_decl (TYPE_DECL, parm, t);
2239 TYPE_NAME (t) = decl;
2240 TYPE_STUB_DECL (t) = decl;
2242 TEMPLATE_TYPE_PARM_INDEX (t)
2243 = build_template_parm_index (idx, processing_template_decl,
2244 processing_template_decl,
2245 decl, TREE_TYPE (parm));
2247 DECL_ARTIFICIAL (decl) = 1;
2248 SET_DECL_TEMPLATE_PARM_P (decl);
2250 parm = build_tree_list (defval, parm);
2251 return chainon (list, parm);
2254 /* The end of a template parameter list has been reached. Process the
2255 tree list into a parameter vector, converting each parameter into a more
2256 useful form. Type parameters are saved as IDENTIFIER_NODEs, and others
2260 end_template_parm_list (tree parms)
2264 tree saved_parmlist = make_tree_vec (list_length (parms));
2266 current_template_parms
2267 = tree_cons (size_int (processing_template_decl),
2268 saved_parmlist, current_template_parms);
2270 for (parm = parms, nparms = 0; parm; parm = next, nparms++)
2272 next = TREE_CHAIN (parm);
2273 TREE_VEC_ELT (saved_parmlist, nparms) = parm;
2274 TREE_CHAIN (parm) = NULL_TREE;
2277 --processing_template_parmlist;
2279 return saved_parmlist;
2282 /* end_template_decl is called after a template declaration is seen. */
2285 end_template_decl (void)
2287 reset_specialization ();
2289 if (! processing_template_decl)
2292 /* This matches the pushlevel in begin_template_parm_list. */
2295 --processing_template_decl;
2296 current_template_parms = TREE_CHAIN (current_template_parms);
2299 /* Given a template argument vector containing the template PARMS.
2300 The innermost PARMS are given first. */
2303 current_template_args (void)
2306 tree args = NULL_TREE;
2307 int length = TMPL_PARMS_DEPTH (current_template_parms);
2310 /* If there is only one level of template parameters, we do not
2311 create a TREE_VEC of TREE_VECs. Instead, we return a single
2312 TREE_VEC containing the arguments. */
2314 args = make_tree_vec (length);
2316 for (header = current_template_parms; header; header = TREE_CHAIN (header))
2318 tree a = copy_node (TREE_VALUE (header));
2321 TREE_TYPE (a) = NULL_TREE;
2322 for (i = TREE_VEC_LENGTH (a) - 1; i >= 0; --i)
2324 tree t = TREE_VEC_ELT (a, i);
2326 /* T will be a list if we are called from within a
2327 begin/end_template_parm_list pair, but a vector directly
2328 if within a begin/end_member_template_processing pair. */
2329 if (TREE_CODE (t) == TREE_LIST)
2333 if (TREE_CODE (t) == TYPE_DECL
2334 || TREE_CODE (t) == TEMPLATE_DECL)
2337 t = DECL_INITIAL (t);
2338 TREE_VEC_ELT (a, i) = t;
2343 TREE_VEC_ELT (args, --l) = a;
2351 /* Return a TEMPLATE_DECL corresponding to DECL, using the indicated
2352 template PARMS. Used by push_template_decl below. */
2355 build_template_decl (tree decl, tree parms)
2357 tree tmpl = build_lang_decl (TEMPLATE_DECL, DECL_NAME (decl), NULL_TREE);
2358 DECL_TEMPLATE_PARMS (tmpl) = parms;
2359 DECL_CONTEXT (tmpl) = DECL_CONTEXT (decl);
2360 if (DECL_LANG_SPECIFIC (decl))
2362 DECL_STATIC_FUNCTION_P (tmpl) = DECL_STATIC_FUNCTION_P (decl);
2363 DECL_CONSTRUCTOR_P (tmpl) = DECL_CONSTRUCTOR_P (decl);
2364 DECL_DESTRUCTOR_P (tmpl) = DECL_DESTRUCTOR_P (decl);
2365 DECL_NONCONVERTING_P (tmpl) = DECL_NONCONVERTING_P (decl);
2366 DECL_ASSIGNMENT_OPERATOR_P (tmpl) = DECL_ASSIGNMENT_OPERATOR_P (decl);
2367 if (DECL_OVERLOADED_OPERATOR_P (decl))
2368 SET_OVERLOADED_OPERATOR_CODE (tmpl,
2369 DECL_OVERLOADED_OPERATOR_P (decl));
2375 struct template_parm_data
2377 /* The level of the template parameters we are currently
2381 /* The index of the specialization argument we are currently
2385 /* An array whose size is the number of template parameters. The
2386 elements are nonzero if the parameter has been used in any one
2387 of the arguments processed so far. */
2390 /* An array whose size is the number of template arguments. The
2391 elements are nonzero if the argument makes use of template
2392 parameters of this level. */
2393 int* arg_uses_template_parms;
2396 /* Subroutine of push_template_decl used to see if each template
2397 parameter in a partial specialization is used in the explicit
2398 argument list. If T is of the LEVEL given in DATA (which is
2399 treated as a template_parm_data*), then DATA->PARMS is marked
2403 mark_template_parm (tree t, void* data)
2407 struct template_parm_data* tpd = (struct template_parm_data*) data;
2409 if (TREE_CODE (t) == TEMPLATE_PARM_INDEX)
2411 level = TEMPLATE_PARM_LEVEL (t);
2412 idx = TEMPLATE_PARM_IDX (t);
2416 level = TEMPLATE_TYPE_LEVEL (t);
2417 idx = TEMPLATE_TYPE_IDX (t);
2420 if (level == tpd->level)
2422 tpd->parms[idx] = 1;
2423 tpd->arg_uses_template_parms[tpd->current_arg] = 1;
2426 /* Return zero so that for_each_template_parm will continue the
2427 traversal of the tree; we want to mark *every* template parm. */
2431 /* Process the partial specialization DECL. */
2434 process_partial_specialization (tree decl)
2436 tree type = TREE_TYPE (decl);
2437 tree maintmpl = CLASSTYPE_TI_TEMPLATE (type);
2438 tree specargs = CLASSTYPE_TI_ARGS (type);
2439 tree inner_args = INNERMOST_TEMPLATE_ARGS (specargs);
2440 tree inner_parms = INNERMOST_TEMPLATE_PARMS (current_template_parms);
2441 tree main_inner_parms = DECL_INNERMOST_TEMPLATE_PARMS (maintmpl);
2442 int nargs = TREE_VEC_LENGTH (inner_args);
2443 int ntparms = TREE_VEC_LENGTH (inner_parms);
2445 int did_error_intro = 0;
2446 struct template_parm_data tpd;
2447 struct template_parm_data tpd2;
2449 /* We check that each of the template parameters given in the
2450 partial specialization is used in the argument list to the
2451 specialization. For example:
2453 template <class T> struct S;
2454 template <class T> struct S<T*>;
2456 The second declaration is OK because `T*' uses the template
2457 parameter T, whereas
2459 template <class T> struct S<int>;
2461 is no good. Even trickier is:
2472 The S2<T> declaration is actually invalid; it is a
2473 full-specialization. Of course,
2476 struct S2<T (*)(U)>;
2478 or some such would have been OK. */
2479 tpd.level = TMPL_PARMS_DEPTH (current_template_parms);
2480 tpd.parms = alloca (sizeof (int) * ntparms);
2481 memset (tpd.parms, 0, sizeof (int) * ntparms);
2483 tpd.arg_uses_template_parms = alloca (sizeof (int) * nargs);
2484 memset (tpd.arg_uses_template_parms, 0, sizeof (int) * nargs);
2485 for (i = 0; i < nargs; ++i)
2487 tpd.current_arg = i;
2488 for_each_template_parm (TREE_VEC_ELT (inner_args, i),
2489 &mark_template_parm,
2493 for (i = 0; i < ntparms; ++i)
2494 if (tpd.parms[i] == 0)
2496 /* One of the template parms was not used in the
2498 if (!did_error_intro)
2500 error ("template parameters not used in partial specialization:");
2501 did_error_intro = 1;
2505 TREE_VALUE (TREE_VEC_ELT (inner_parms, i)));
2508 /* [temp.class.spec]
2510 The argument list of the specialization shall not be identical to
2511 the implicit argument list of the primary template. */
2512 if (comp_template_args
2514 INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE
2516 error ("partial specialization `%T' does not specialize any template arguments", type);
2518 /* [temp.class.spec]
2520 A partially specialized non-type argument expression shall not
2521 involve template parameters of the partial specialization except
2522 when the argument expression is a simple identifier.
2524 The type of a template parameter corresponding to a specialized
2525 non-type argument shall not be dependent on a parameter of the
2527 my_friendly_assert (nargs == DECL_NTPARMS (maintmpl), 0);
2529 for (i = 0; i < nargs; ++i)
2531 tree arg = TREE_VEC_ELT (inner_args, i);
2532 if (/* These first two lines are the `non-type' bit. */
2534 && TREE_CODE (arg) != TEMPLATE_DECL
2535 /* This next line is the `argument expression is not just a
2536 simple identifier' condition and also the `specialized
2537 non-type argument' bit. */
2538 && TREE_CODE (arg) != TEMPLATE_PARM_INDEX)
2540 if (tpd.arg_uses_template_parms[i])
2541 error ("template argument `%E' involves template parameter(s)", arg);
2544 /* Look at the corresponding template parameter,
2545 marking which template parameters its type depends
2548 TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (main_inner_parms,
2553 /* We haven't yet initialized TPD2. Do so now. */
2554 tpd2.arg_uses_template_parms
2555 = alloca (sizeof (int) * nargs);
2556 /* The number of parameters here is the number in the
2557 main template, which, as checked in the assertion
2559 tpd2.parms = alloca (sizeof (int) * nargs);
2561 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (maintmpl));
2564 /* Mark the template parameters. But this time, we're
2565 looking for the template parameters of the main
2566 template, not in the specialization. */
2567 tpd2.current_arg = i;
2568 tpd2.arg_uses_template_parms[i] = 0;
2569 memset (tpd2.parms, 0, sizeof (int) * nargs);
2570 for_each_template_parm (type,
2571 &mark_template_parm,
2575 if (tpd2.arg_uses_template_parms [i])
2577 /* The type depended on some template parameters.
2578 If they are fully specialized in the
2579 specialization, that's OK. */
2581 for (j = 0; j < nargs; ++j)
2582 if (tpd2.parms[j] != 0
2583 && tpd.arg_uses_template_parms [j])
2585 error ("type `%T' of template argument `%E' depends on template parameter(s)",
2595 if (retrieve_specialization (maintmpl, specargs))
2596 /* We've already got this specialization. */
2599 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl)
2600 = tree_cons (inner_args, inner_parms,
2601 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl));
2602 TREE_TYPE (DECL_TEMPLATE_SPECIALIZATIONS (maintmpl)) = type;
2606 /* Check that a template declaration's use of default arguments is not
2607 invalid. Here, PARMS are the template parameters. IS_PRIMARY is
2608 nonzero if DECL is the thing declared by a primary template.
2609 IS_PARTIAL is nonzero if DECL is a partial specialization. */
2612 check_default_tmpl_args (tree decl, tree parms, int is_primary, int is_partial)
2615 int last_level_to_check;
2620 A default template-argument shall not be specified in a
2621 function template declaration or a function template definition, nor
2622 in the template-parameter-list of the definition of a member of a
2625 if (TREE_CODE (CP_DECL_CONTEXT (decl)) == FUNCTION_DECL)
2626 /* You can't have a function template declaration in a local
2627 scope, nor you can you define a member of a class template in a
2631 if (current_class_type
2632 && !TYPE_BEING_DEFINED (current_class_type)
2633 && DECL_LANG_SPECIFIC (decl)
2634 /* If this is either a friend defined in the scope of the class
2635 or a member function. */
2636 && (DECL_FUNCTION_MEMBER_P (decl)
2637 ? same_type_p (DECL_CONTEXT (decl), current_class_type)
2638 : DECL_FRIEND_CONTEXT (decl)
2639 ? same_type_p (DECL_FRIEND_CONTEXT (decl), current_class_type)
2641 /* And, if it was a member function, it really was defined in
2642 the scope of the class. */
2643 && (!DECL_FUNCTION_MEMBER_P (decl)
2644 || DECL_INITIALIZED_IN_CLASS_P (decl)))
2645 /* We already checked these parameters when the template was
2646 declared, so there's no need to do it again now. This function
2647 was defined in class scope, but we're processing it's body now
2648 that the class is complete. */
2653 If a template-parameter has a default template-argument, all
2654 subsequent template-parameters shall have a default
2655 template-argument supplied. */
2656 for (parm_level = parms; parm_level; parm_level = TREE_CHAIN (parm_level))
2658 tree inner_parms = TREE_VALUE (parm_level);
2659 int ntparms = TREE_VEC_LENGTH (inner_parms);
2660 int seen_def_arg_p = 0;
2663 for (i = 0; i < ntparms; ++i)
2665 tree parm = TREE_VEC_ELT (inner_parms, i);
2666 if (TREE_PURPOSE (parm))
2668 else if (seen_def_arg_p)
2670 error ("no default argument for `%D'", TREE_VALUE (parm));
2671 /* For better subsequent error-recovery, we indicate that
2672 there should have been a default argument. */
2673 TREE_PURPOSE (parm) = error_mark_node;
2678 if (TREE_CODE (decl) != TYPE_DECL || is_partial || !is_primary)
2679 /* For an ordinary class template, default template arguments are
2680 allowed at the innermost level, e.g.:
2681 template <class T = int>
2683 but, in a partial specialization, they're not allowed even
2684 there, as we have in [temp.class.spec]:
2686 The template parameter list of a specialization shall not
2687 contain default template argument values.
2689 So, for a partial specialization, or for a function template,
2690 we look at all of them. */
2693 /* But, for a primary class template that is not a partial
2694 specialization we look at all template parameters except the
2696 parms = TREE_CHAIN (parms);
2698 /* Figure out what error message to issue. */
2699 if (TREE_CODE (decl) == FUNCTION_DECL)
2700 msg = "default template arguments may not be used in function templates";
2701 else if (is_partial)
2702 msg = "default template arguments may not be used in partial specializations";
2704 msg = "default argument for template parameter for class enclosing `%D'";
2706 if (current_class_type && TYPE_BEING_DEFINED (current_class_type))
2707 /* If we're inside a class definition, there's no need to
2708 examine the parameters to the class itself. On the one
2709 hand, they will be checked when the class is defined, and,
2710 on the other, default arguments are valid in things like:
2711 template <class T = double>
2712 struct S { template <class U> void f(U); };
2713 Here the default argument for `S' has no bearing on the
2714 declaration of `f'. */
2715 last_level_to_check = template_class_depth (current_class_type) + 1;
2717 /* Check everything. */
2718 last_level_to_check = 0;
2720 for (parm_level = parms;
2721 parm_level && TMPL_PARMS_DEPTH (parm_level) >= last_level_to_check;
2722 parm_level = TREE_CHAIN (parm_level))
2724 tree inner_parms = TREE_VALUE (parm_level);
2728 ntparms = TREE_VEC_LENGTH (inner_parms);
2729 for (i = 0; i < ntparms; ++i)
2730 if (TREE_PURPOSE (TREE_VEC_ELT (inner_parms, i)))
2738 /* Clear out the default argument so that we are not
2740 TREE_PURPOSE (TREE_VEC_ELT (inner_parms, i)) = NULL_TREE;
2743 /* At this point, if we're still interested in issuing messages,
2744 they must apply to classes surrounding the object declared. */
2746 msg = "default argument for template parameter for class enclosing `%D'";
2750 /* Worker for push_template_decl_real, called via
2751 for_each_template_parm. DATA is really an int, indicating the
2752 level of the parameters we are interested in. If T is a template
2753 parameter of that level, return nonzero. */
2756 template_parm_this_level_p (tree t, void* data)
2758 int this_level = *(int *)data;
2761 if (TREE_CODE (t) == TEMPLATE_PARM_INDEX)
2762 level = TEMPLATE_PARM_LEVEL (t);
2764 level = TEMPLATE_TYPE_LEVEL (t);
2765 return level == this_level;
2768 /* Creates a TEMPLATE_DECL for the indicated DECL using the template
2769 parameters given by current_template_args, or reuses a
2770 previously existing one, if appropriate. Returns the DECL, or an
2771 equivalent one, if it is replaced via a call to duplicate_decls.
2773 If IS_FRIEND is nonzero, DECL is a friend declaration. */
2776 push_template_decl_real (tree decl, int is_friend)
2784 int new_template_p = 0;
2786 if (decl == error_mark_node)
2789 /* See if this is a partial specialization. */
2790 is_partial = (DECL_IMPLICIT_TYPEDEF_P (decl)
2791 && TREE_CODE (TREE_TYPE (decl)) != ENUMERAL_TYPE
2792 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl)));
2794 is_friend |= (TREE_CODE (decl) == FUNCTION_DECL && DECL_FRIEND_P (decl));
2797 /* For a friend, we want the context of the friend function, not
2798 the type of which it is a friend. */
2799 ctx = DECL_CONTEXT (decl);
2800 else if (CP_DECL_CONTEXT (decl)
2801 && TREE_CODE (CP_DECL_CONTEXT (decl)) != NAMESPACE_DECL)
2802 /* In the case of a virtual function, we want the class in which
2804 ctx = CP_DECL_CONTEXT (decl);
2806 /* Otherwise, if we're currently defining some class, the DECL
2807 is assumed to be a member of the class. */
2808 ctx = current_scope ();
2810 if (ctx && TREE_CODE (ctx) == NAMESPACE_DECL)
2813 if (!DECL_CONTEXT (decl))
2814 DECL_CONTEXT (decl) = FROB_CONTEXT (current_namespace);
2816 /* See if this is a primary template. */
2817 primary = template_parm_scope_p ();
2821 if (current_lang_name == lang_name_c)
2822 error ("template with C linkage");
2823 else if (TREE_CODE (decl) == TYPE_DECL
2824 && ANON_AGGRNAME_P (DECL_NAME (decl)))
2825 error ("template class without a name");
2826 else if (TREE_CODE (decl) == FUNCTION_DECL
2827 && DECL_DESTRUCTOR_P (decl))
2831 A destructor shall not be a member template. */
2832 error ("destructor `%D' declared as member template", decl);
2833 return error_mark_node;
2835 else if ((DECL_IMPLICIT_TYPEDEF_P (decl)
2836 && CLASS_TYPE_P (TREE_TYPE (decl)))
2837 || (TREE_CODE (decl) == VAR_DECL && ctx && CLASS_TYPE_P (ctx))
2838 || TREE_CODE (decl) == FUNCTION_DECL)
2842 error ("template declaration of `%#D'", decl);
2843 return error_mark_node;
2847 /* Check to see that the rules regarding the use of default
2848 arguments are not being violated. */
2849 check_default_tmpl_args (decl, current_template_parms,
2850 primary, is_partial);
2853 return process_partial_specialization (decl);
2855 args = current_template_args ();
2858 || TREE_CODE (ctx) == FUNCTION_DECL
2859 || (CLASS_TYPE_P (ctx) && TYPE_BEING_DEFINED (ctx))
2860 || (is_friend && !DECL_TEMPLATE_INFO (decl)))
2862 if (DECL_LANG_SPECIFIC (decl)
2863 && DECL_TEMPLATE_INFO (decl)
2864 && DECL_TI_TEMPLATE (decl))
2865 tmpl = DECL_TI_TEMPLATE (decl);
2866 /* If DECL is a TYPE_DECL for a class-template, then there won't
2867 be DECL_LANG_SPECIFIC. The information equivalent to
2868 DECL_TEMPLATE_INFO is found in TYPE_TEMPLATE_INFO instead. */
2869 else if (DECL_IMPLICIT_TYPEDEF_P (decl)
2870 && TYPE_TEMPLATE_INFO (TREE_TYPE (decl))
2871 && TYPE_TI_TEMPLATE (TREE_TYPE (decl)))
2873 /* Since a template declaration already existed for this
2874 class-type, we must be redeclaring it here. Make sure
2875 that the redeclaration is valid. */
2876 redeclare_class_template (TREE_TYPE (decl),
2877 current_template_parms);
2878 /* We don't need to create a new TEMPLATE_DECL; just use the
2879 one we already had. */
2880 tmpl = TYPE_TI_TEMPLATE (TREE_TYPE (decl));
2884 tmpl = build_template_decl (decl, current_template_parms);
2887 if (DECL_LANG_SPECIFIC (decl)
2888 && DECL_TEMPLATE_SPECIALIZATION (decl))
2890 /* A specialization of a member template of a template
2892 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl);
2893 DECL_TEMPLATE_INFO (tmpl) = DECL_TEMPLATE_INFO (decl);
2894 DECL_TEMPLATE_INFO (decl) = NULL_TREE;
2900 tree a, t, current, parms;
2903 if (TREE_CODE (decl) == TYPE_DECL)
2905 if ((IS_AGGR_TYPE_CODE (TREE_CODE (TREE_TYPE (decl)))
2906 || TREE_CODE (TREE_TYPE (decl)) == ENUMERAL_TYPE)
2907 && TYPE_TEMPLATE_INFO (TREE_TYPE (decl))
2908 && TYPE_TI_TEMPLATE (TREE_TYPE (decl)))
2909 tmpl = TYPE_TI_TEMPLATE (TREE_TYPE (decl));
2912 error ("`%D' does not declare a template type", decl);
2916 else if (!DECL_LANG_SPECIFIC (decl) || !DECL_TEMPLATE_INFO (decl))
2918 error ("template definition of non-template `%#D'", decl);
2922 tmpl = DECL_TI_TEMPLATE (decl);
2924 if (DECL_FUNCTION_TEMPLATE_P (tmpl)
2925 && DECL_TEMPLATE_INFO (decl) && DECL_TI_ARGS (decl)
2926 && DECL_TEMPLATE_SPECIALIZATION (decl)
2927 && is_member_template (tmpl))
2931 /* The declaration is a specialization of a member
2932 template, declared outside the class. Therefore, the
2933 innermost template arguments will be NULL, so we
2934 replace them with the arguments determined by the
2935 earlier call to check_explicit_specialization. */
2936 args = DECL_TI_ARGS (decl);
2939 = build_template_decl (decl, current_template_parms);
2940 DECL_TEMPLATE_RESULT (new_tmpl) = decl;
2941 TREE_TYPE (new_tmpl) = TREE_TYPE (decl);
2942 DECL_TI_TEMPLATE (decl) = new_tmpl;
2943 SET_DECL_TEMPLATE_SPECIALIZATION (new_tmpl);
2944 DECL_TEMPLATE_INFO (new_tmpl)
2945 = tree_cons (tmpl, args, NULL_TREE);
2947 register_specialization (new_tmpl,
2948 most_general_template (tmpl),
2953 /* Make sure the template headers we got make sense. */
2955 parms = DECL_TEMPLATE_PARMS (tmpl);
2956 i = TMPL_PARMS_DEPTH (parms);
2957 if (TMPL_ARGS_DEPTH (args) != i)
2959 error ("expected %d levels of template parms for `%#D', got %d",
2960 i, decl, TMPL_ARGS_DEPTH (args));
2963 for (current = decl; i > 0; --i, parms = TREE_CHAIN (parms))
2965 a = TMPL_ARGS_LEVEL (args, i);
2966 t = INNERMOST_TEMPLATE_PARMS (parms);
2968 if (TREE_VEC_LENGTH (t) != TREE_VEC_LENGTH (a))
2970 if (current == decl)
2971 error ("got %d template parameters for `%#D'",
2972 TREE_VEC_LENGTH (a), decl);
2974 error ("got %d template parameters for `%#T'",
2975 TREE_VEC_LENGTH (a), current);
2976 error (" but %d required", TREE_VEC_LENGTH (t));
2979 /* Perhaps we should also check that the parms are used in the
2980 appropriate qualifying scopes in the declarator? */
2982 if (current == decl)
2985 current = TYPE_CONTEXT (current);
2989 DECL_TEMPLATE_RESULT (tmpl) = decl;
2990 TREE_TYPE (tmpl) = TREE_TYPE (decl);
2992 /* Push template declarations for global functions and types. Note
2993 that we do not try to push a global template friend declared in a
2994 template class; such a thing may well depend on the template
2995 parameters of the class. */
2996 if (new_template_p && !ctx
2997 && !(is_friend && template_class_depth (current_class_type) > 0))
2998 tmpl = pushdecl_namespace_level (tmpl);
3002 DECL_PRIMARY_TEMPLATE (tmpl) = tmpl;
3003 if (DECL_CONV_FN_P (tmpl))
3005 int depth = TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl));
3007 /* It is a conversion operator. See if the type converted to
3008 depends on innermost template operands. */
3010 if (uses_template_parms_level (TREE_TYPE (TREE_TYPE (tmpl)),
3012 DECL_TEMPLATE_CONV_FN_P (tmpl) = 1;
3016 /* The DECL_TI_ARGS of DECL contains full set of arguments refering
3017 back to its most general template. If TMPL is a specialization,
3018 ARGS may only have the innermost set of arguments. Add the missing
3019 argument levels if necessary. */
3020 if (DECL_TEMPLATE_INFO (tmpl))
3021 args = add_outermost_template_args (DECL_TI_ARGS (tmpl), args);
3023 info = tree_cons (tmpl, args, NULL_TREE);
3025 if (DECL_IMPLICIT_TYPEDEF_P (decl))
3027 SET_TYPE_TEMPLATE_INFO (TREE_TYPE (tmpl), info);
3028 if ((!ctx || TREE_CODE (ctx) != FUNCTION_DECL)
3029 && TREE_CODE (TREE_TYPE (decl)) != ENUMERAL_TYPE
3030 /* Don't change the name if we've already set it up. */
3031 && !IDENTIFIER_TEMPLATE (DECL_NAME (decl)))
3032 DECL_NAME (decl) = classtype_mangled_name (TREE_TYPE (decl));
3034 else if (DECL_LANG_SPECIFIC (decl))
3035 DECL_TEMPLATE_INFO (decl) = info;
3037 return DECL_TEMPLATE_RESULT (tmpl);
3041 push_template_decl (tree decl)
3043 return push_template_decl_real (decl, 0);
3046 /* Called when a class template TYPE is redeclared with the indicated
3047 template PARMS, e.g.:
3049 template <class T> struct S;
3050 template <class T> struct S {}; */
3053 redeclare_class_template (tree type, tree parms)
3059 if (!TYPE_TEMPLATE_INFO (type))
3061 error ("`%T' is not a template type", type);
3065 tmpl = TYPE_TI_TEMPLATE (type);
3066 if (!PRIMARY_TEMPLATE_P (tmpl))
3067 /* The type is nested in some template class. Nothing to worry
3068 about here; there are no new template parameters for the nested
3072 parms = INNERMOST_TEMPLATE_PARMS (parms);
3073 tmpl_parms = DECL_INNERMOST_TEMPLATE_PARMS (tmpl);
3075 if (TREE_VEC_LENGTH (parms) != TREE_VEC_LENGTH (tmpl_parms))
3077 cp_error_at ("previous declaration `%D'", tmpl);
3078 error ("used %d template parameter%s instead of %d",
3079 TREE_VEC_LENGTH (tmpl_parms),
3080 TREE_VEC_LENGTH (tmpl_parms) == 1 ? "" : "s",
3081 TREE_VEC_LENGTH (parms));
3085 for (i = 0; i < TREE_VEC_LENGTH (tmpl_parms); ++i)
3087 tree tmpl_parm = TREE_VALUE (TREE_VEC_ELT (tmpl_parms, i));
3088 tree parm = TREE_VALUE (TREE_VEC_ELT (parms, i));
3089 tree tmpl_default = TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms, i));
3090 tree parm_default = TREE_PURPOSE (TREE_VEC_ELT (parms, i));
3092 if (TREE_CODE (tmpl_parm) != TREE_CODE (parm))
3094 cp_error_at ("template parameter `%#D'", tmpl_parm);
3095 error ("redeclared here as `%#D'", parm);
3099 if (tmpl_default != NULL_TREE && parm_default != NULL_TREE)
3101 /* We have in [temp.param]:
3103 A template-parameter may not be given default arguments
3104 by two different declarations in the same scope. */
3105 error ("redefinition of default argument for `%#D'", parm);
3106 error ("%J original definition appeared here", tmpl_parm);
3110 if (parm_default != NULL_TREE)
3111 /* Update the previous template parameters (which are the ones
3112 that will really count) with the new default value. */
3113 TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms, i)) = parm_default;
3114 else if (tmpl_default != NULL_TREE)
3115 /* Update the new parameters, too; they'll be used as the
3116 parameters for any members. */
3117 TREE_PURPOSE (TREE_VEC_ELT (parms, i)) = tmpl_default;
3121 /* Simplify EXPR if it is a non-dependent expression. Returns the
3122 (possibly simplified) expression. */
3125 fold_non_dependent_expr (tree expr)
3127 /* If we're in a template, but EXPR isn't value dependent, simplify
3128 it. We're supposed to treat:
3130 template <typename T> void f(T[1 + 1]);
3131 template <typename T> void f(T[2]);
3133 as two declarations of the same function, for example. */
3134 if (processing_template_decl
3135 && !type_dependent_expression_p (expr)
3136 && !value_dependent_expression_p (expr))
3138 HOST_WIDE_INT saved_processing_template_decl;
3140 saved_processing_template_decl = processing_template_decl;
3141 processing_template_decl = 0;
3142 expr = tsubst_copy_and_build (expr,
3145 /*in_decl=*/NULL_TREE,
3146 /*function_p=*/false);
3147 processing_template_decl = saved_processing_template_decl;
3152 /* Attempt to convert the non-type template parameter EXPR to the
3153 indicated TYPE. If the conversion is successful, return the
3154 converted value. If the conversion is unsuccessful, return
3155 NULL_TREE if we issued an error message, or error_mark_node if we
3156 did not. We issue error messages for out-and-out bad template
3157 parameters, but not simply because the conversion failed, since we
3158 might be just trying to do argument deduction. Both TYPE and EXPR
3159 must be non-dependent. */
3162 convert_nontype_argument (tree type, tree expr)
3166 /* If we are in a template, EXPR may be non-dependent, but still
3167 have a syntactic, rather than semantic, form. For example, EXPR
3168 might be a SCOPE_REF, rather than the VAR_DECL to which the
3169 SCOPE_REF refers. Preserving the qualifying scope is necessary
3170 so that access checking can be performed when the template is
3171 instantiated -- but here we need the resolved form so that we can
3172 convert the argument. */
3173 expr = fold_non_dependent_expr (expr);
3174 expr_type = TREE_TYPE (expr);
3176 /* A template-argument for a non-type, non-template
3177 template-parameter shall be one of:
3179 --an integral constant-expression of integral or enumeration
3182 --the name of a non-type template-parameter; or
3184 --the name of an object or function with external linkage,
3185 including function templates and function template-ids but
3186 excluding non-static class members, expressed as id-expression;
3189 --the address of an object or function with external linkage,
3190 including function templates and function template-ids but
3191 excluding non-static class members, expressed as & id-expression
3192 where the & is optional if the name refers to a function or
3195 --a pointer to member expressed as described in _expr.unary.op_. */
3197 /* An integral constant-expression can include const variables or
3198 . enumerators. Simplify things by folding them to their values,
3199 unless we're about to bind the declaration to a reference
3201 if (INTEGRAL_TYPE_P (expr_type) && TREE_CODE (type) != REFERENCE_TYPE)
3204 tree const_expr = decl_constant_value (expr);
3205 /* In a template, the initializer for a VAR_DECL may not be
3206 marked as TREE_CONSTANT, in which case decl_constant_value
3207 will not return the initializer. Handle that special case
3209 if (expr == const_expr
3210 && TREE_CODE (expr) == VAR_DECL
3211 && DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (expr)
3212 && CP_TYPE_CONST_NON_VOLATILE_P (TREE_TYPE (expr))
3213 /* DECL_INITIAL can be NULL if we are processing a
3214 variable initialized to an expression involving itself.
3215 We know it is initialized to a constant -- but not what
3217 && DECL_INITIAL (expr))
3218 const_expr = DECL_INITIAL (expr);
3219 if (expr == const_expr)
3221 expr = fold_non_dependent_expr (const_expr);
3224 if (is_overloaded_fn (expr))
3225 /* OK for now. We'll check that it has external linkage later.
3226 Check this first since if expr_type is the unknown_type_node
3227 we would otherwise complain below. */
3229 else if (TYPE_PTR_TO_MEMBER_P (expr_type))
3231 if (TREE_CODE (expr) != PTRMEM_CST)
3234 else if (TYPE_PTR_P (expr_type)
3235 || TREE_CODE (expr_type) == ARRAY_TYPE
3236 || TREE_CODE (type) == REFERENCE_TYPE
3237 /* If expr is the address of an overloaded function, we
3238 will get the unknown_type_node at this point. */
3239 || expr_type == unknown_type_node)
3245 if (TREE_CODE (expr_type) == ARRAY_TYPE
3246 || (TREE_CODE (type) == REFERENCE_TYPE
3247 && TREE_CODE (e) != ADDR_EXPR))
3251 if (TREE_CODE (e) != ADDR_EXPR)
3254 error ("`%E' is not a valid template argument", expr);
3255 if (TYPE_PTR_P (expr_type))
3257 if (TREE_CODE (TREE_TYPE (expr_type)) == FUNCTION_TYPE)
3258 error ("it must be the address of a function with external linkage");
3260 error ("it must be the address of an object with external linkage");
3262 else if (TYPE_PTR_TO_MEMBER_P (expr_type))
3263 error ("it must be a pointer-to-member of the form `&X::Y'");
3268 referent = TREE_OPERAND (e, 0);
3269 STRIP_NOPS (referent);
3272 if (TREE_CODE (referent) == STRING_CST)
3274 error ("string literal %E is not a valid template argument because it is the address of an object with static linkage",
3279 if (TREE_CODE (referent) == SCOPE_REF)
3280 referent = TREE_OPERAND (referent, 1);
3282 if (is_overloaded_fn (referent))
3283 /* We'll check that it has external linkage later. */
3285 else if (TREE_CODE (referent) != VAR_DECL)
3287 else if (!DECL_EXTERNAL_LINKAGE_P (referent))
3289 error ("address of non-extern `%E' cannot be used as template argument", referent);
3290 return error_mark_node;
3293 else if (INTEGRAL_TYPE_P (expr_type) || TYPE_PTR_TO_MEMBER_P (expr_type))
3295 if (! TREE_CONSTANT (expr))
3298 error ("non-constant `%E' cannot be used as template argument",
3306 error ("type '%T' cannot be used as a value for a non-type "
3307 "template-parameter", expr);
3308 else if (DECL_P (expr))
3309 error ("invalid use of '%D' as a non-type template-argument", expr);
3311 error ("invalid use of '%E' as a non-type template-argument", expr);
3316 switch (TREE_CODE (type))
3321 /* For a non-type template-parameter of integral or enumeration
3322 type, integral promotions (_conv.prom_) and integral
3323 conversions (_conv.integral_) are applied. */
3324 if (!INTEGRAL_TYPE_P (expr_type))
3325 return error_mark_node;
3327 /* It's safe to call digest_init in this case; we know we're
3328 just converting one integral constant expression to another. */
3329 expr = digest_init (type, expr, (tree*) 0);
3331 if (TREE_CODE (expr) != INTEGER_CST)
3332 /* Curiously, some TREE_CONSTANT integral expressions do not
3333 simplify to integer constants. For example, `3 % 0',
3334 remains a TRUNC_MOD_EXPR. */
3343 /* For a non-type template-parameter of type pointer to data
3344 member, qualification conversions (_conv.qual_) are
3346 e = perform_qualification_conversions (type, expr);
3347 if (TREE_CODE (e) == NOP_EXPR)
3348 /* The call to perform_qualification_conversions will
3349 insert a NOP_EXPR over EXPR to do express conversion,
3350 if necessary. But, that will confuse us if we use
3351 this (converted) template parameter to instantiate
3352 another template; then the thing will not look like a
3353 valid template argument. So, just make a new
3354 constant, of the appropriate type. */
3355 e = make_ptrmem_cst (type, PTRMEM_CST_MEMBER (expr));
3361 tree type_pointed_to = TREE_TYPE (type);
3363 if (TREE_CODE (type_pointed_to) == FUNCTION_TYPE)
3365 /* For a non-type template-parameter of type pointer to
3366 function, only the function-to-pointer conversion
3367 (_conv.func_) is applied. If the template-argument
3368 represents a set of overloaded functions (or a pointer to
3369 such), the matching function is selected from the set
3374 if (TREE_CODE (expr) == ADDR_EXPR)
3375 fns = TREE_OPERAND (expr, 0);
3379 fn = instantiate_type (type_pointed_to, fns, tf_none);
3381 if (fn == error_mark_node)
3382 return error_mark_node;
3384 if (!DECL_EXTERNAL_LINKAGE_P (fn))
3386 if (really_overloaded_fn (fns))
3387 return error_mark_node;
3392 expr = build_unary_op (ADDR_EXPR, fn, 0);
3394 my_friendly_assert (same_type_p (type, TREE_TYPE (expr)),
3400 /* For a non-type template-parameter of type pointer to
3401 object, qualification conversions (_conv.qual_) and the
3402 array-to-pointer conversion (_conv.array_) are applied.
3403 [Note: In particular, neither the null pointer conversion
3404 (_conv.ptr_) nor the derived-to-base conversion
3405 (_conv.ptr_) are applied. Although 0 is a valid
3406 template-argument for a non-type template-parameter of
3407 integral type, it is not a valid template-argument for a
3408 non-type template-parameter of pointer type.]
3410 The call to decay_conversion performs the
3411 array-to-pointer conversion, if appropriate. */
3412 expr = decay_conversion (expr);
3414 if (expr == error_mark_node)
3415 return error_mark_node;
3417 return perform_qualification_conversions (type, expr);
3422 case REFERENCE_TYPE:
3424 tree type_referred_to = TREE_TYPE (type);
3426 /* If this expression already has reference type, get the
3427 underlying object. */
3428 if (TREE_CODE (expr_type) == REFERENCE_TYPE)
3430 if (TREE_CODE (expr) == NOP_EXPR
3431 && TREE_CODE (TREE_OPERAND (expr, 0)) == ADDR_EXPR)
3433 my_friendly_assert (TREE_CODE (expr) == ADDR_EXPR, 20000604);
3434 expr = TREE_OPERAND (expr, 0);
3435 expr_type = TREE_TYPE (expr);
3438 if (TREE_CODE (type_referred_to) == FUNCTION_TYPE)
3440 /* For a non-type template-parameter of type reference to
3441 function, no conversions apply. If the
3442 template-argument represents a set of overloaded
3443 functions, the matching function is selected from the
3444 set (_over.over_). */
3447 fn = instantiate_type (type_referred_to, expr, tf_none);
3449 if (fn == error_mark_node)
3450 return error_mark_node;
3452 if (!DECL_EXTERNAL_LINKAGE_P (fn))
3454 if (really_overloaded_fn (expr))
3455 /* Don't issue an error here; we might get a different
3456 function if the overloading had worked out
3458 return error_mark_node;
3463 my_friendly_assert (same_type_p (type_referred_to,
3471 /* For a non-type template-parameter of type reference to
3472 object, no conversions apply. The type referred to by the
3473 reference may be more cv-qualified than the (otherwise
3474 identical) type of the template-argument. The
3475 template-parameter is bound directly to the
3476 template-argument, which must be an lvalue. */
3477 if (!same_type_p (TYPE_MAIN_VARIANT (expr_type),
3478 TYPE_MAIN_VARIANT (type_referred_to))
3479 || !at_least_as_qualified_p (type_referred_to,
3481 || !real_lvalue_p (expr))
3482 return error_mark_node;
3485 cxx_mark_addressable (expr);
3486 return build_nop (type, build_address (expr));
3492 my_friendly_assert (TYPE_PTRMEMFUNC_P (type), 20010112);
3494 /* For a non-type template-parameter of type pointer to member
3495 function, no conversions apply. If the template-argument
3496 represents a set of overloaded member functions, the
3497 matching member function is selected from the set
3500 if (!TYPE_PTRMEMFUNC_P (expr_type) &&
3501 expr_type != unknown_type_node)
3502 return error_mark_node;
3504 if (TREE_CODE (expr) == PTRMEM_CST)
3506 /* A ptr-to-member constant. */
3507 if (!same_type_p (type, expr_type))
3508 return error_mark_node;
3513 if (TREE_CODE (expr) != ADDR_EXPR)
3514 return error_mark_node;
3516 expr = instantiate_type (type, expr, tf_none);
3518 if (expr == error_mark_node)
3519 return error_mark_node;
3521 if (!same_type_p (type, TREE_TYPE (expr)))
3522 return error_mark_node;
3529 /* All non-type parameters must have one of these types. */
3534 return error_mark_node;
3537 /* Return 1 if PARM_PARMS and ARG_PARMS matches using rule for
3538 template template parameters. Both PARM_PARMS and ARG_PARMS are
3539 vectors of TREE_LIST nodes containing TYPE_DECL, TEMPLATE_DECL
3542 ARG_PARMS may contain more parameters than PARM_PARMS. If this is
3543 the case, then extra parameters must have default arguments.
3545 Consider the example:
3546 template <class T, class Allocator = allocator> class vector;
3547 template<template <class U> class TT> class C;
3549 C<vector> is a valid instantiation. PARM_PARMS for the above code
3550 contains a TYPE_DECL (for U), ARG_PARMS contains two TYPE_DECLs (for
3551 T and Allocator) and OUTER_ARGS contains the argument that is used to
3552 substitute the TT parameter. */
3555 coerce_template_template_parms (tree parm_parms,
3557 tsubst_flags_t complain,
3561 int nparms, nargs, i;
3564 my_friendly_assert (TREE_CODE (parm_parms) == TREE_VEC, 0);
3565 my_friendly_assert (TREE_CODE (arg_parms) == TREE_VEC, 0);
3567 nparms = TREE_VEC_LENGTH (parm_parms);
3568 nargs = TREE_VEC_LENGTH (arg_parms);
3570 /* The rule here is opposite of coerce_template_parms. */
3573 && TREE_PURPOSE (TREE_VEC_ELT (arg_parms, nparms)) == NULL_TREE))
3576 for (i = 0; i < nparms; ++i)
3578 parm = TREE_VALUE (TREE_VEC_ELT (parm_parms, i));
3579 arg = TREE_VALUE (TREE_VEC_ELT (arg_parms, i));
3581 if (arg == NULL_TREE || arg == error_mark_node
3582 || parm == NULL_TREE || parm == error_mark_node)
3585 if (TREE_CODE (arg) != TREE_CODE (parm))
3588 switch (TREE_CODE (parm))
3594 /* We encounter instantiations of templates like
3595 template <template <template <class> class> class TT>
3598 tree parmparm = DECL_INNERMOST_TEMPLATE_PARMS (parm);
3599 tree argparm = DECL_INNERMOST_TEMPLATE_PARMS (arg);
3601 if (!coerce_template_template_parms
3602 (parmparm, argparm, complain, in_decl, outer_args))
3608 /* The tsubst call is used to handle cases such as
3609 template <class T, template <T> class TT> class D;
3610 i.e. the parameter list of TT depends on earlier parameters. */
3612 (tsubst (TREE_TYPE (parm), outer_args, complain, in_decl),
3624 /* Convert the indicated template ARG as necessary to match the
3625 indicated template PARM. Returns the converted ARG, or
3626 error_mark_node if the conversion was unsuccessful. Error and
3627 warning messages are issued under control of COMPLAIN. This
3628 conversion is for the Ith parameter in the parameter list. ARGS is
3629 the full set of template arguments deduced so far. */
3632 convert_template_argument (tree parm,
3635 tsubst_flags_t complain,
3641 int is_type, requires_type, is_tmpl_type, requires_tmpl_type;
3643 inner_args = INNERMOST_TEMPLATE_ARGS (args);
3645 if (TREE_CODE (arg) == TREE_LIST
3646 && TREE_CODE (TREE_VALUE (arg)) == OFFSET_REF)
3648 /* The template argument was the name of some
3649 member function. That's usually
3650 invalid, but static members are OK. In any
3651 case, grab the underlying fields/functions
3652 and issue an error later if required. */
3653 arg = TREE_VALUE (arg);
3654 TREE_TYPE (arg) = unknown_type_node;
3657 requires_tmpl_type = TREE_CODE (parm) == TEMPLATE_DECL;
3658 requires_type = (TREE_CODE (parm) == TYPE_DECL
3659 || requires_tmpl_type);
3661 is_tmpl_type = ((TREE_CODE (arg) == TEMPLATE_DECL
3662 && TREE_CODE (DECL_TEMPLATE_RESULT (arg)) == TYPE_DECL)
3663 || TREE_CODE (arg) == TEMPLATE_TEMPLATE_PARM
3664 || TREE_CODE (arg) == UNBOUND_CLASS_TEMPLATE);
3667 && (TREE_CODE (arg) == TEMPLATE_TEMPLATE_PARM
3668 || TREE_CODE (arg) == UNBOUND_CLASS_TEMPLATE))
3669 arg = TYPE_STUB_DECL (arg);
3671 is_type = TYPE_P (arg) || is_tmpl_type;
3673 if (requires_type && ! is_type && TREE_CODE (arg) == SCOPE_REF
3674 && TREE_CODE (TREE_OPERAND (arg, 0)) == TEMPLATE_TYPE_PARM)
3676 pedwarn ("to refer to a type member of a template parameter, use `typename %E'", arg);
3678 arg = make_typename_type (TREE_OPERAND (arg, 0),
3679 TREE_OPERAND (arg, 1),
3680 complain & tf_error);
3683 if (is_type != requires_type)
3687 if (complain & tf_error)
3689 error ("type/value mismatch at argument %d in template parameter list for `%D'",
3692 error (" expected a constant of type `%T', got `%T'",
3694 (is_tmpl_type ? DECL_NAME (arg) : arg));
3695 else if (requires_tmpl_type)
3696 error (" expected a class template, got `%E'", arg);
3698 error (" expected a type, got `%E'", arg);
3701 return error_mark_node;
3703 if (is_tmpl_type ^ requires_tmpl_type)
3705 if (in_decl && (complain & tf_error))
3707 error ("type/value mismatch at argument %d in template parameter list for `%D'",
3710 error (" expected a type, got `%T'", DECL_NAME (arg));
3712 error (" expected a class template, got `%T'", arg);
3714 return error_mark_node;
3719 if (requires_tmpl_type)
3721 if (TREE_CODE (TREE_TYPE (arg)) == UNBOUND_CLASS_TEMPLATE)
3722 /* The number of argument required is not known yet.
3723 Just accept it for now. */
3724 val = TREE_TYPE (arg);
3727 tree parmparm = DECL_INNERMOST_TEMPLATE_PARMS (parm);
3728 tree argparm = DECL_INNERMOST_TEMPLATE_PARMS (arg);
3730 if (coerce_template_template_parms (parmparm, argparm,
3736 /* TEMPLATE_TEMPLATE_PARM node is preferred over
3738 if (val != error_mark_node
3739 && DECL_TEMPLATE_TEMPLATE_PARM_P (val))
3740 val = TREE_TYPE (val);
3744 if (in_decl && (complain & tf_error))
3746 error ("type/value mismatch at argument %d in template parameter list for `%D'",
3748 error (" expected a template of type `%D', got `%D'", parm, arg);
3751 val = error_mark_node;
3756 val = groktypename (arg);
3760 tree t = tsubst (TREE_TYPE (parm), args, complain, in_decl);
3762 if (invalid_nontype_parm_type_p (t, complain))
3763 return error_mark_node;
3765 if (!uses_template_parms (arg) && !uses_template_parms (t))
3766 /* We used to call digest_init here. However, digest_init
3767 will report errors, which we don't want when complain
3768 is zero. More importantly, digest_init will try too
3769 hard to convert things: for example, `0' should not be
3770 converted to pointer type at this point according to
3771 the standard. Accepting this is not merely an
3772 extension, since deciding whether or not these
3773 conversions can occur is part of determining which
3774 function template to call, or whether a given explicit
3775 argument specification is valid. */
3776 val = convert_nontype_argument (t, arg);
3780 if (val == NULL_TREE)
3781 val = error_mark_node;
3782 else if (val == error_mark_node && (complain & tf_error))
3783 error ("could not convert template argument `%E' to `%T'",
3790 /* Convert all template arguments to their appropriate types, and
3791 return a vector containing the innermost resulting template
3792 arguments. If any error occurs, return error_mark_node. Error and
3793 warning messages are issued under control of COMPLAIN.
3795 If REQUIRE_ALL_ARGUMENTS is nonzero, all arguments must be
3796 provided in ARGLIST, or else trailing parameters must have default
3797 values. If REQUIRE_ALL_ARGUMENTS is zero, we will attempt argument
3798 deduction for any unspecified trailing arguments. */
3801 coerce_template_parms (tree parms,
3804 tsubst_flags_t complain,
3805 int require_all_arguments)
3807 int nparms, nargs, i, lost = 0;
3810 tree new_inner_args;
3812 inner_args = INNERMOST_TEMPLATE_ARGS (args);
3813 nargs = inner_args ? NUM_TMPL_ARGS (inner_args) : 0;
3814 nparms = TREE_VEC_LENGTH (parms);
3818 && require_all_arguments
3819 && TREE_PURPOSE (TREE_VEC_ELT (parms, nargs)) == NULL_TREE))
3821 if (complain & tf_error)
3823 error ("wrong number of template arguments (%d, should be %d)",
3827 cp_error_at ("provided for `%D'", in_decl);
3830 return error_mark_node;
3833 new_inner_args = make_tree_vec (nparms);
3834 new_args = add_outermost_template_args (args, new_inner_args);
3835 for (i = 0; i < nparms; i++)
3840 /* Get the Ith template parameter. */
3841 parm = TREE_VEC_ELT (parms, i);
3843 /* Calculate the Ith argument. */
3845 arg = TREE_VEC_ELT (inner_args, i);
3846 else if (require_all_arguments)
3847 /* There must be a default arg in this case. */
3848 arg = tsubst_template_arg (TREE_PURPOSE (parm), new_args,
3853 my_friendly_assert (arg, 20030727);
3854 if (arg == error_mark_node)
3855 error ("template argument %d is invalid", i + 1);
3857 arg = convert_template_argument (TREE_VALUE (parm),
3858 arg, new_args, complain, i,
3861 if (arg == error_mark_node)
3863 TREE_VEC_ELT (new_inner_args, i) = arg;
3867 return error_mark_node;
3869 return new_inner_args;
3872 /* Returns 1 if template args OT and NT are equivalent. */
3875 template_args_equal (tree ot, tree nt)
3880 if (TREE_CODE (nt) == TREE_VEC)
3881 /* For member templates */
3882 return TREE_CODE (ot) == TREE_VEC && comp_template_args (ot, nt);
3883 else if (TYPE_P (nt))
3884 return TYPE_P (ot) && same_type_p (ot, nt);
3885 else if (TREE_CODE (ot) == TREE_VEC || TYPE_P (ot))
3888 return cp_tree_equal (ot, nt);
3891 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets
3892 of template arguments. Returns 0 otherwise. */
3895 comp_template_args (tree oldargs, tree newargs)
3899 if (TREE_VEC_LENGTH (oldargs) != TREE_VEC_LENGTH (newargs))
3902 for (i = 0; i < TREE_VEC_LENGTH (oldargs); ++i)
3904 tree nt = TREE_VEC_ELT (newargs, i);
3905 tree ot = TREE_VEC_ELT (oldargs, i);
3907 if (! template_args_equal (ot, nt))
3913 /* Given class template name and parameter list, produce a user-friendly name
3914 for the instantiation. */
3917 mangle_class_name_for_template (const char* name, tree parms, tree arglist)
3919 static struct obstack scratch_obstack;
3920 static char *scratch_firstobj;
3923 if (!scratch_firstobj)
3924 gcc_obstack_init (&scratch_obstack);
3926 obstack_free (&scratch_obstack, scratch_firstobj);
3927 scratch_firstobj = obstack_alloc (&scratch_obstack, 1);
3929 #define ccat(C) obstack_1grow (&scratch_obstack, (C));
3930 #define cat(S) obstack_grow (&scratch_obstack, (S), strlen (S))
3934 nparms = TREE_VEC_LENGTH (parms);
3935 arglist = INNERMOST_TEMPLATE_ARGS (arglist);
3936 my_friendly_assert (nparms == TREE_VEC_LENGTH (arglist), 268);
3937 for (i = 0; i < nparms; i++)
3939 tree parm = TREE_VALUE (TREE_VEC_ELT (parms, i));
3940 tree arg = TREE_VEC_ELT (arglist, i);
3945 if (TREE_CODE (parm) == TYPE_DECL)
3947 cat (type_as_string (arg, TFF_CHASE_TYPEDEF));
3950 else if (TREE_CODE (parm) == TEMPLATE_DECL)
3952 if (TREE_CODE (arg) == TEMPLATE_DECL)
3954 /* Already substituted with real template. Just output
3955 the template name here */
3956 tree context = DECL_CONTEXT (arg);
3959 /* The template may be defined in a namespace, or
3960 may be a member template. */
3961 my_friendly_assert (TREE_CODE (context) == NAMESPACE_DECL
3962 || CLASS_TYPE_P (context),
3964 cat(decl_as_string (DECL_CONTEXT (arg), TFF_PLAIN_IDENTIFIER));
3967 cat (IDENTIFIER_POINTER (DECL_NAME (arg)));
3970 /* Output the parameter declaration. */
3971 cat (type_as_string (arg, TFF_CHASE_TYPEDEF));
3975 my_friendly_assert (TREE_CODE (parm) == PARM_DECL, 269);
3977 /* No need to check arglist against parmlist here; we did that
3978 in coerce_template_parms, called from lookup_template_class. */
3979 cat (expr_as_string (arg, TFF_PLAIN_IDENTIFIER));
3982 char *bufp = obstack_next_free (&scratch_obstack);
3984 while (bufp[offset - 1] == ' ')
3986 obstack_blank_fast (&scratch_obstack, offset);
3988 /* B<C<char> >, not B<C<char>> */
3989 if (bufp[offset - 1] == '>')
3994 return (char *) obstack_base (&scratch_obstack);
3998 classtype_mangled_name (tree t)
4000 if (CLASSTYPE_TEMPLATE_INFO (t)
4001 /* Specializations have already had their names set up in
4002 lookup_template_class. */
4003 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (t))
4005 tree tmpl = most_general_template (CLASSTYPE_TI_TEMPLATE (t));
4007 /* For non-primary templates, the template parameters are
4008 implicit from their surrounding context. */
4009 if (PRIMARY_TEMPLATE_P (tmpl))
4011 tree name = DECL_NAME (tmpl);
4012 char *mangled_name = mangle_class_name_for_template
4013 (IDENTIFIER_POINTER (name),
4014 DECL_INNERMOST_TEMPLATE_PARMS (tmpl),
4015 CLASSTYPE_TI_ARGS (t));
4016 tree id = get_identifier (mangled_name);
4017 IDENTIFIER_TEMPLATE (id) = name;
4022 return TYPE_IDENTIFIER (t);
4026 add_pending_template (tree d)
4028 tree ti = (TYPE_P (d)
4029 ? CLASSTYPE_TEMPLATE_INFO (d)
4030 : DECL_TEMPLATE_INFO (d));
4034 if (TI_PENDING_TEMPLATE_FLAG (ti))
4037 /* We are called both from instantiate_decl, where we've already had a
4038 tinst_level pushed, and instantiate_template, where we haven't.
4040 level = !(current_tinst_level && TINST_DECL (current_tinst_level) == d);
4043 push_tinst_level (d);
4045 pt = tree_cons (current_tinst_level, d, NULL_TREE);
4046 if (last_pending_template)
4047 TREE_CHAIN (last_pending_template) = pt;
4049 pending_templates = pt;
4051 last_pending_template = pt;
4053 TI_PENDING_TEMPLATE_FLAG (ti) = 1;
4060 /* Return a TEMPLATE_ID_EXPR corresponding to the indicated FNS and
4061 ARGLIST. Valid choices for FNS are given in the cp-tree.def
4062 documentation for TEMPLATE_ID_EXPR. */
4065 lookup_template_function (tree fns, tree arglist)
4069 if (fns == error_mark_node || arglist == error_mark_node)
4070 return error_mark_node;
4072 my_friendly_assert (!arglist || TREE_CODE (arglist) == TREE_VEC, 20030726);
4073 if (fns == NULL_TREE
4074 || TREE_CODE (fns) == FUNCTION_DECL)
4076 error ("non-template used as template");
4077 return error_mark_node;
4080 my_friendly_assert (TREE_CODE (fns) == TEMPLATE_DECL
4081 || TREE_CODE (fns) == OVERLOAD
4083 || TREE_CODE (fns) == IDENTIFIER_NODE,
4086 if (BASELINK_P (fns))
4088 BASELINK_FUNCTIONS (fns) = build (TEMPLATE_ID_EXPR,
4090 BASELINK_FUNCTIONS (fns),
4095 type = TREE_TYPE (fns);
4096 if (TREE_CODE (fns) == OVERLOAD || !type)
4097 type = unknown_type_node;
4099 return build (TEMPLATE_ID_EXPR, type, fns, arglist);
4102 /* Within the scope of a template class S<T>, the name S gets bound
4103 (in build_self_reference) to a TYPE_DECL for the class, not a
4104 TEMPLATE_DECL. If DECL is a TYPE_DECL for current_class_type,
4105 or one of its enclosing classes, and that type is a template,
4106 return the associated TEMPLATE_DECL. Otherwise, the original
4107 DECL is returned. */
4110 maybe_get_template_decl_from_type_decl (tree decl)
4112 return (decl != NULL_TREE
4113 && TREE_CODE (decl) == TYPE_DECL
4114 && DECL_ARTIFICIAL (decl)
4115 && CLASS_TYPE_P (TREE_TYPE (decl))
4116 && CLASSTYPE_TEMPLATE_INFO (TREE_TYPE (decl)))
4117 ? CLASSTYPE_TI_TEMPLATE (TREE_TYPE (decl)) : decl;
4120 /* Given an IDENTIFIER_NODE (type TEMPLATE_DECL) and a chain of
4121 parameters, find the desired type.
4123 D1 is the PTYPENAME terminal, and ARGLIST is the list of arguments.
4125 IN_DECL, if non-NULL, is the template declaration we are trying to
4128 If ENTERING_SCOPE is nonzero, we are about to enter the scope of
4129 the class we are looking up.
4131 Issue error and warning messages under control of COMPLAIN.
4133 If the template class is really a local class in a template
4134 function, then the FUNCTION_CONTEXT is the function in which it is
4135 being instantiated. */
4138 lookup_template_class (tree d1,
4143 tsubst_flags_t complain)
4145 tree template = NULL_TREE, parmlist;
4148 timevar_push (TV_NAME_LOOKUP);
4150 if (TREE_CODE (d1) == IDENTIFIER_NODE)
4152 if (IDENTIFIER_VALUE (d1)
4153 && DECL_TEMPLATE_TEMPLATE_PARM_P (IDENTIFIER_VALUE (d1)))
4154 template = IDENTIFIER_VALUE (d1);
4158 push_decl_namespace (context);
4159 template = lookup_name (d1, /*prefer_type=*/0);
4160 template = maybe_get_template_decl_from_type_decl (template);
4162 pop_decl_namespace ();
4165 context = DECL_CONTEXT (template);
4167 else if (TREE_CODE (d1) == TYPE_DECL && IS_AGGR_TYPE (TREE_TYPE (d1)))
4169 tree type = TREE_TYPE (d1);
4171 /* If we are declaring a constructor, say A<T>::A<T>, we will get
4172 an implicit typename for the second A. Deal with it. */
4173 if (TREE_CODE (type) == TYPENAME_TYPE && TREE_TYPE (type))
4174 type = TREE_TYPE (type);
4176 if (CLASSTYPE_TEMPLATE_INFO (type))
4178 template = CLASSTYPE_TI_TEMPLATE (type);
4179 d1 = DECL_NAME (template);
4182 else if (TREE_CODE (d1) == ENUMERAL_TYPE
4183 || (TYPE_P (d1) && IS_AGGR_TYPE (d1)))
4185 template = TYPE_TI_TEMPLATE (d1);
4186 d1 = DECL_NAME (template);
4188 else if (TREE_CODE (d1) == TEMPLATE_DECL
4189 && TREE_CODE (DECL_TEMPLATE_RESULT (d1)) == TYPE_DECL)
4192 d1 = DECL_NAME (template);
4193 context = DECL_CONTEXT (template);
4196 /* With something like `template <class T> class X class X { ... };'
4197 we could end up with D1 having nothing but an IDENTIFIER_VALUE.
4198 We don't want to do that, but we have to deal with the situation,
4199 so let's give them some syntax errors to chew on instead of a
4200 crash. Alternatively D1 might not be a template type at all. */
4203 if (complain & tf_error)
4204 error ("`%T' is not a template", d1);
4205 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node);
4208 if (TREE_CODE (template) != TEMPLATE_DECL
4209 /* Make sure it's a user visible template, if it was named by
4211 || ((complain & tf_user) && !DECL_TEMPLATE_PARM_P (template)
4212 && !PRIMARY_TEMPLATE_P (template)))
4214 if (complain & tf_error)
4216 error ("non-template type `%T' used as a template", d1);
4218 cp_error_at ("for template declaration `%D'", in_decl);
4220 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node);
4223 complain &= ~tf_user;
4225 if (DECL_TEMPLATE_TEMPLATE_PARM_P (template))
4227 /* Create a new TEMPLATE_DECL and TEMPLATE_TEMPLATE_PARM node to store
4228 template arguments */
4233 parmlist = DECL_INNERMOST_TEMPLATE_PARMS (template);
4235 /* Consider an example where a template template parameter declared as
4237 template <class T, class U = std::allocator<T> > class TT
4239 The template parameter level of T and U are one level larger than
4240 of TT. To proper process the default argument of U, say when an
4241 instantiation `TT<int>' is seen, we need to build the full
4242 arguments containing {int} as the innermost level. Outer levels,
4243 available when not appearing as default template argument, can be
4244 obtained from `current_template_args ()'.
4246 Suppose that TT is later substituted with std::vector. The above
4247 instantiation is `TT<int, std::allocator<T> >' with TT at
4248 level 1, and T at level 2, while the template arguments at level 1
4249 becomes {std::vector} and the inner level 2 is {int}. */
4251 if (current_template_parms)
4252 arglist = add_to_template_args (current_template_args (), arglist);
4254 arglist2 = coerce_template_parms (parmlist, arglist, template,
4255 complain, /*require_all_args=*/1);
4256 if (arglist2 == error_mark_node
4257 || (!uses_template_parms (arglist2)
4258 && check_instantiated_args (template, arglist2, complain)))
4259 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node);
4261 parm = bind_template_template_parm (TREE_TYPE (template), arglist2);
4262 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, parm);
4266 tree template_type = TREE_TYPE (template);
4269 tree found = NULL_TREE;
4273 int is_partial_instantiation;
4275 gen_tmpl = most_general_template (template);
4276 parmlist = DECL_TEMPLATE_PARMS (gen_tmpl);
4277 parm_depth = TMPL_PARMS_DEPTH (parmlist);
4278 arg_depth = TMPL_ARGS_DEPTH (arglist);
4280 if (arg_depth == 1 && parm_depth > 1)
4282 /* We've been given an incomplete set of template arguments.
4285 template <class T> struct S1 {
4286 template <class U> struct S2 {};
4287 template <class U> struct S2<U*> {};
4290 we will be called with an ARGLIST of `U*', but the
4291 TEMPLATE will be `template <class T> template
4292 <class U> struct S1<T>::S2'. We must fill in the missing
4295 = add_outermost_template_args (TYPE_TI_ARGS (TREE_TYPE (template)),
4297 arg_depth = TMPL_ARGS_DEPTH (arglist);
4300 /* Now we should have enough arguments. */
4301 my_friendly_assert (parm_depth == arg_depth, 0);
4303 /* From here on, we're only interested in the most general
4305 template = gen_tmpl;
4307 /* Calculate the BOUND_ARGS. These will be the args that are
4308 actually tsubst'd into the definition to create the
4312 /* We have multiple levels of arguments to coerce, at once. */
4314 int saved_depth = TMPL_ARGS_DEPTH (arglist);
4316 tree bound_args = make_tree_vec (parm_depth);
4318 for (i = saved_depth,
4319 t = DECL_TEMPLATE_PARMS (template);
4320 i > 0 && t != NULL_TREE;
4321 --i, t = TREE_CHAIN (t))
4323 tree a = coerce_template_parms (TREE_VALUE (t),
4325 complain, /*require_all_args=*/1);
4327 /* Don't process further if one of the levels fails. */
4328 if (a == error_mark_node)
4330 /* Restore the ARGLIST to its full size. */
4331 TREE_VEC_LENGTH (arglist) = saved_depth;
4332 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node);
4335 SET_TMPL_ARGS_LEVEL (bound_args, i, a);
4337 /* We temporarily reduce the length of the ARGLIST so
4338 that coerce_template_parms will see only the arguments
4339 corresponding to the template parameters it is
4341 TREE_VEC_LENGTH (arglist)--;
4344 /* Restore the ARGLIST to its full size. */
4345 TREE_VEC_LENGTH (arglist) = saved_depth;
4347 arglist = bound_args;
4351 = coerce_template_parms (INNERMOST_TEMPLATE_PARMS (parmlist),
4352 INNERMOST_TEMPLATE_ARGS (arglist),
4354 complain, /*require_all_args=*/1);
4356 if (arglist == error_mark_node)
4357 /* We were unable to bind the arguments. */
4358 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node);
4360 /* In the scope of a template class, explicit references to the
4361 template class refer to the type of the template, not any
4362 instantiation of it. For example, in:
4364 template <class T> class C { void f(C<T>); }
4366 the `C<T>' is just the same as `C'. Outside of the
4367 class, however, such a reference is an instantiation. */
4368 if (comp_template_args (TYPE_TI_ARGS (template_type),
4371 found = template_type;
4373 if (!entering_scope && PRIMARY_TEMPLATE_P (template))
4377 for (ctx = current_class_type;
4378 ctx && TREE_CODE (ctx) != NAMESPACE_DECL;
4380 ? TYPE_CONTEXT (ctx)
4381 : DECL_CONTEXT (ctx)))
4382 if (TYPE_P (ctx) && same_type_p (ctx, template_type))
4385 /* We're not in the scope of the class, so the
4386 TEMPLATE_TYPE is not the type we want after all. */
4392 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, found);
4394 for (tp = &DECL_TEMPLATE_INSTANTIATIONS (template);
4396 tp = &TREE_CHAIN (*tp))
4397 if (comp_template_args (TREE_PURPOSE (*tp), arglist))
4401 /* Use the move-to-front heuristic to speed up future
4403 *tp = TREE_CHAIN (*tp);
4405 = DECL_TEMPLATE_INSTANTIATIONS (template);
4406 DECL_TEMPLATE_INSTANTIATIONS (template) = found;
4408 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, TREE_VALUE (found));
4411 /* This type is a "partial instantiation" if any of the template
4412 arguments still involve template parameters. Note that we set
4413 IS_PARTIAL_INSTANTIATION for partial specializations as
4415 is_partial_instantiation = uses_template_parms (arglist);
4417 /* If the deduced arguments are invalid, then the binding
4419 if (!is_partial_instantiation
4420 && check_instantiated_args (template,
4421 INNERMOST_TEMPLATE_ARGS (arglist),
4423 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node);
4425 if (!is_partial_instantiation
4426 && !PRIMARY_TEMPLATE_P (template)
4427 && TREE_CODE (CP_DECL_CONTEXT (template)) == NAMESPACE_DECL)
4429 found = xref_tag_from_type (TREE_TYPE (template),
4430 DECL_NAME (template),
4432 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, found);
4435 context = tsubst (DECL_CONTEXT (template), arglist,
4438 context = global_namespace;
4440 /* Create the type. */
4441 if (TREE_CODE (template_type) == ENUMERAL_TYPE)
4443 if (!is_partial_instantiation)
4445 set_current_access_from_decl (TYPE_NAME (template_type));
4446 t = start_enum (TYPE_IDENTIFIER (template_type));
4449 /* We don't want to call start_enum for this type, since
4450 the values for the enumeration constants may involve
4451 template parameters. And, no one should be interested
4452 in the enumeration constants for such a type. */
4453 t = make_node (ENUMERAL_TYPE);
4457 t = make_aggr_type (TREE_CODE (template_type));
4458 CLASSTYPE_DECLARED_CLASS (t)
4459 = CLASSTYPE_DECLARED_CLASS (template_type);
4460 SET_CLASSTYPE_IMPLICIT_INSTANTIATION (t);
4461 TYPE_FOR_JAVA (t) = TYPE_FOR_JAVA (template_type);
4463 /* A local class. Make sure the decl gets registered properly. */
4464 if (context == current_function_decl)
4465 pushtag (DECL_NAME (template), t, 0);
4468 /* If we called start_enum or pushtag above, this information
4469 will already be set up. */
4472 TYPE_CONTEXT (t) = FROB_CONTEXT (context);
4474 type_decl = create_implicit_typedef (DECL_NAME (template), t);
4475 DECL_CONTEXT (type_decl) = TYPE_CONTEXT (t);
4476 TYPE_STUB_DECL (t) = type_decl;
4477 DECL_SOURCE_LOCATION (type_decl)
4478 = DECL_SOURCE_LOCATION (TYPE_STUB_DECL (template_type));
4481 type_decl = TYPE_NAME (t);
4483 TREE_PRIVATE (type_decl)
4484 = TREE_PRIVATE (TYPE_STUB_DECL (template_type));
4485 TREE_PROTECTED (type_decl)
4486 = TREE_PROTECTED (TYPE_STUB_DECL (template_type));
4488 /* Set up the template information. We have to figure out which
4489 template is the immediate parent if this is a full
4491 if (parm_depth == 1 || is_partial_instantiation
4492 || !PRIMARY_TEMPLATE_P (template))
4493 /* This case is easy; there are no member templates involved. */
4497 /* This is a full instantiation of a member template. Look
4498 for a partial instantiation of which this is an instance. */
4500 for (found = DECL_TEMPLATE_INSTANTIATIONS (template);
4501 found; found = TREE_CHAIN (found))
4504 tree tmpl = CLASSTYPE_TI_TEMPLATE (TREE_VALUE (found));
4506 /* We only want partial instantiations, here, not
4507 specializations or full instantiations. */
4508 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_VALUE (found))
4509 || !uses_template_parms (TREE_VALUE (found)))
4512 /* Temporarily reduce by one the number of levels in the
4513 ARGLIST and in FOUND so as to avoid comparing the
4514 last set of arguments. */
4515 TREE_VEC_LENGTH (arglist)--;
4516 TREE_VEC_LENGTH (TREE_PURPOSE (found)) --;
4518 /* See if the arguments match. If they do, then TMPL is
4519 the partial instantiation we want. */
4520 success = comp_template_args (TREE_PURPOSE (found), arglist);
4522 /* Restore the argument vectors to their full size. */
4523 TREE_VEC_LENGTH (arglist)++;
4524 TREE_VEC_LENGTH (TREE_PURPOSE (found))++;
4535 /* There was no partial instantiation. This happens
4536 where C<T> is a member template of A<T> and it's used
4539 template <typename T> struct B { A<T>::C<int> m; };
4542 Create the partial instantiation.
4544 TREE_VEC_LENGTH (arglist)--;
4545 found = tsubst (template, arglist, complain, NULL_TREE);
4546 TREE_VEC_LENGTH (arglist)++;
4550 SET_TYPE_TEMPLATE_INFO (t, tree_cons (found, arglist, NULL_TREE));
4551 DECL_TEMPLATE_INSTANTIATIONS (template)
4552 = tree_cons (arglist, t,
4553 DECL_TEMPLATE_INSTANTIATIONS (template));
4555 if (TREE_CODE (t) == ENUMERAL_TYPE
4556 && !is_partial_instantiation)
4557 /* Now that the type has been registered on the instantiations
4558 list, we set up the enumerators. Because the enumeration
4559 constants may involve the enumeration type itself, we make
4560 sure to register the type first, and then create the
4561 constants. That way, doing tsubst_expr for the enumeration
4562 constants won't result in recursive calls here; we'll find
4563 the instantiation and exit above. */
4564 tsubst_enum (template_type, t, arglist);
4566 /* Reset the name of the type, now that CLASSTYPE_TEMPLATE_INFO
4568 if (TREE_CODE (t) != ENUMERAL_TYPE)
4569 DECL_NAME (type_decl) = classtype_mangled_name (t);
4570 if (is_partial_instantiation)
4571 /* If the type makes use of template parameters, the
4572 code that generates debugging information will crash. */
4573 DECL_IGNORED_P (TYPE_STUB_DECL (t)) = 1;
4575 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, t);
4577 timevar_pop (TV_NAME_LOOKUP);
4587 /* Called from for_each_template_parm via walk_tree. */
4590 for_each_template_parm_r (tree* tp, int* walk_subtrees, void* d)
4593 struct pair_fn_data *pfd = (struct pair_fn_data *) d;
4594 tree_fn_t fn = pfd->fn;
4595 void *data = pfd->data;
4598 && for_each_template_parm (TYPE_CONTEXT (t), fn, data, pfd->visited))
4599 return error_mark_node;
4601 switch (TREE_CODE (t))
4604 if (TYPE_PTRMEMFUNC_P (t))
4610 if (!TYPE_TEMPLATE_INFO (t))
4612 else if (for_each_template_parm (TREE_VALUE (TYPE_TEMPLATE_INFO (t)),
4613 fn, data, pfd->visited))
4614 return error_mark_node;
4618 /* Since we're not going to walk subtrees, we have to do this
4620 if (for_each_template_parm (TYPE_METHOD_BASETYPE (t), fn, data,
4622 return error_mark_node;
4626 /* Check the return type. */
4627 if (for_each_template_parm (TREE_TYPE (t), fn, data, pfd->visited))
4628 return error_mark_node;
4630 /* Check the parameter types. Since default arguments are not
4631 instantiated until they are needed, the TYPE_ARG_TYPES may
4632 contain expressions that involve template parameters. But,
4633 no-one should be looking at them yet. And, once they're
4634 instantiated, they don't contain template parameters, so
4635 there's no point in looking at them then, either. */
4639 for (parm = TYPE_ARG_TYPES (t); parm; parm = TREE_CHAIN (parm))
4640 if (for_each_template_parm (TREE_VALUE (parm), fn, data,
4642 return error_mark_node;
4644 /* Since we've already handled the TYPE_ARG_TYPES, we don't
4645 want walk_tree walking into them itself. */
4651 if (for_each_template_parm (TYPE_FIELDS (t), fn, data,
4653 return error_mark_node;
4658 if (DECL_LANG_SPECIFIC (t) && DECL_TEMPLATE_INFO (t)
4659 && for_each_template_parm (DECL_TI_ARGS (t), fn, data,
4661 return error_mark_node;
4666 if (TREE_CODE (t) == CONST_DECL && DECL_TEMPLATE_PARM_P (t)
4667 && for_each_template_parm (DECL_INITIAL (t), fn, data,
4669 return error_mark_node;
4670 if (DECL_CONTEXT (t)
4671 && for_each_template_parm (DECL_CONTEXT (t), fn, data,
4673 return error_mark_node;
4676 case BOUND_TEMPLATE_TEMPLATE_PARM:
4677 /* Record template parameters such as `T' inside `TT<T>'. */
4678 if (for_each_template_parm (TYPE_TI_ARGS (t), fn, data, pfd->visited))
4679 return error_mark_node;
4682 case TEMPLATE_TEMPLATE_PARM:
4683 case TEMPLATE_TYPE_PARM:
4684 case TEMPLATE_PARM_INDEX:
4685 if (fn && (*fn)(t, data))
4686 return error_mark_node;
4688 return error_mark_node;
4692 /* A template template parameter is encountered. */
4693 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t)
4694 && for_each_template_parm (TREE_TYPE (t), fn, data, pfd->visited))
4695 return error_mark_node;
4697 /* Already substituted template template parameter */
4703 || for_each_template_parm (TYPENAME_TYPE_FULLNAME (t), fn,
4704 data, pfd->visited))
4705 return error_mark_node;
4709 if (TREE_TYPE (t) && TYPE_PTRMEMFUNC_P (TREE_TYPE (t))
4710 && for_each_template_parm (TYPE_PTRMEMFUNC_FN_TYPE
4711 (TREE_TYPE (t)), fn, data,
4713 return error_mark_node;
4718 /* If there's no type, then this thing must be some expression
4719 involving template parameters. */
4720 if (!fn && !TREE_TYPE (t))
4721 return error_mark_node;
4726 case REINTERPRET_CAST_EXPR:
4727 case CONST_CAST_EXPR:
4728 case STATIC_CAST_EXPR:
4729 case DYNAMIC_CAST_EXPR:
4733 case PSEUDO_DTOR_EXPR:
4735 return error_mark_node;
4739 /* If we do not handle this case specially, we end up walking
4740 the BINFO hierarchy, which is circular, and therefore
4741 confuses walk_tree. */
4743 if (for_each_template_parm (BASELINK_FUNCTIONS (*tp), fn, data,
4745 return error_mark_node;
4752 /* We didn't find any template parameters we liked. */
4756 /* For each TEMPLATE_TYPE_PARM, TEMPLATE_TEMPLATE_PARM,
4757 BOUND_TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX in T,
4758 call FN with the parameter and the DATA.
4759 If FN returns nonzero, the iteration is terminated, and
4760 for_each_template_parm returns 1. Otherwise, the iteration
4761 continues. If FN never returns a nonzero value, the value
4762 returned by for_each_template_parm is 0. If FN is NULL, it is
4763 considered to be the function which always returns 1. */
4766 for_each_template_parm (tree t, tree_fn_t fn, void* data, htab_t visited)
4768 struct pair_fn_data pfd;
4775 /* Walk the tree. (Conceptually, we would like to walk without
4776 duplicates, but for_each_template_parm_r recursively calls
4777 for_each_template_parm, so we would need to reorganize a fair
4778 bit to use walk_tree_without_duplicates, so we keep our own
4781 pfd.visited = visited;
4783 pfd.visited = htab_create (37, htab_hash_pointer, htab_eq_pointer,
4785 result = walk_tree (&t,
4786 for_each_template_parm_r,
4788 pfd.visited) != NULL_TREE;
4792 htab_delete (pfd.visited);
4797 /* Returns true if T depends on any template parameter. */
4800 uses_template_parms (tree t)
4803 int saved_processing_template_decl;
4805 saved_processing_template_decl = processing_template_decl;
4806 if (!saved_processing_template_decl)
4807 processing_template_decl = 1;
4809 dependent_p = dependent_type_p (t);
4810 else if (TREE_CODE (t) == TREE_VEC)
4811 dependent_p = any_dependent_template_arguments_p (t);
4812 else if (TREE_CODE (t) == TREE_LIST)
4813 dependent_p = (uses_template_parms (TREE_VALUE (t))
4814 || uses_template_parms (TREE_CHAIN (t)));
4817 || TREE_CODE (t) == TEMPLATE_PARM_INDEX
4818 || TREE_CODE (t) == OVERLOAD
4819 || TREE_CODE (t) == BASELINK
4820 || TREE_CODE_CLASS (TREE_CODE (t)) == 'c')
4821 dependent_p = (type_dependent_expression_p (t)
4822 || value_dependent_expression_p (t));
4823 else if (t == error_mark_node)
4824 dependent_p = false;
4827 processing_template_decl = saved_processing_template_decl;
4832 /* Returns true if T depends on any template parameter with level LEVEL. */
4835 uses_template_parms_level (tree t, int level)
4837 return for_each_template_parm (t, template_parm_this_level_p, &level, NULL);
4840 static int tinst_depth;
4841 extern int max_tinst_depth;
4842 #ifdef GATHER_STATISTICS
4845 static int tinst_level_tick;
4846 static int last_template_error_tick;
4848 /* We're starting to instantiate D; record the template instantiation context
4849 for diagnostics and to restore it later. */
4852 push_tinst_level (tree d)
4856 if (tinst_depth >= max_tinst_depth)
4858 /* If the instantiation in question still has unbound template parms,
4859 we don't really care if we can't instantiate it, so just return.
4860 This happens with base instantiation for implicit `typename'. */
4861 if (uses_template_parms (d))
4864 last_template_error_tick = tinst_level_tick;
4865 error ("template instantiation depth exceeds maximum of %d (use -ftemplate-depth-NN to increase the maximum) instantiating `%D'",
4866 max_tinst_depth, d);
4868 print_instantiation_context ();
4873 new = build_expr_wfl (d, input_filename, input_line, 0);
4874 TREE_CHAIN (new) = current_tinst_level;
4875 current_tinst_level = new;
4878 #ifdef GATHER_STATISTICS
4879 if (tinst_depth > depth_reached)
4880 depth_reached = tinst_depth;
4887 /* We're done instantiating this template; return to the instantiation
4891 pop_tinst_level (void)
4893 tree old = current_tinst_level;
4895 /* Restore the filename and line number stashed away when we started
4896 this instantiation. */
4897 input_line = TINST_LINE (old);
4898 input_filename = TINST_FILE (old);
4899 extract_interface_info ();
4901 current_tinst_level = TREE_CHAIN (old);
4906 /* We're instantiating a deferred template; restore the template
4907 instantiation context in which the instantiation was requested, which
4908 is one step out from LEVEL. */
4911 reopen_tinst_level (tree level)
4916 for (t = level; t; t = TREE_CHAIN (t))
4919 current_tinst_level = level;
4923 /* Return the outermost template instantiation context, for use with
4924 -falt-external-templates. */
4927 tinst_for_decl (void)
4929 tree p = current_tinst_level;
4932 for (; TREE_CHAIN (p) ; p = TREE_CHAIN (p))
4937 /* DECL is a friend FUNCTION_DECL or TEMPLATE_DECL. ARGS is the
4938 vector of template arguments, as for tsubst.
4940 Returns an appropriate tsubst'd friend declaration. */
4943 tsubst_friend_function (tree decl, tree args)
4946 location_t saved_loc = input_location;
4948 input_location = DECL_SOURCE_LOCATION (decl);
4950 if (TREE_CODE (decl) == FUNCTION_DECL
4951 && DECL_TEMPLATE_INSTANTIATION (decl)
4952 && TREE_CODE (DECL_TI_TEMPLATE (decl)) != TEMPLATE_DECL)
4953 /* This was a friend declared with an explicit template
4954 argument list, e.g.:
4958 to indicate that f was a template instantiation, not a new
4959 function declaration. Now, we have to figure out what
4960 instantiation of what template. */
4962 tree template_id, arglist, fns;
4965 tree ns = decl_namespace_context (TYPE_MAIN_DECL (current_class_type));
4967 /* Friend functions are looked up in the containing namespace scope.
4968 We must enter that scope, to avoid finding member functions of the
4969 current cless with same name. */
4970 push_nested_namespace (ns);
4971 fns = tsubst_expr (DECL_TI_TEMPLATE (decl), args,
4972 tf_error | tf_warning, NULL_TREE);
4973 pop_nested_namespace (ns);
4974 arglist = tsubst (DECL_TI_ARGS (decl), args,
4975 tf_error | tf_warning, NULL_TREE);
4976 template_id = lookup_template_function (fns, arglist);
4978 new_friend = tsubst (decl, args, tf_error | tf_warning, NULL_TREE);
4979 tmpl = determine_specialization (template_id, new_friend,
4981 /*need_member_template=*/0);
4982 new_friend = instantiate_template (tmpl, new_args, tf_error);
4986 new_friend = tsubst (decl, args, tf_error | tf_warning, NULL_TREE);
4988 /* The NEW_FRIEND will look like an instantiation, to the
4989 compiler, but is not an instantiation from the point of view of
4990 the language. For example, we might have had:
4992 template <class T> struct S {
4993 template <class U> friend void f(T, U);
4996 Then, in S<int>, template <class U> void f(int, U) is not an
4997 instantiation of anything. */
4998 if (new_friend == error_mark_node)
4999 return error_mark_node;
5001 DECL_USE_TEMPLATE (new_friend) = 0;
5002 if (TREE_CODE (decl) == TEMPLATE_DECL)
5004 DECL_USE_TEMPLATE (DECL_TEMPLATE_RESULT (new_friend)) = 0;
5005 DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (new_friend))
5006 = DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (decl));
5009 /* The mangled name for the NEW_FRIEND is incorrect. The function
5010 is not a template instantiation and should not be mangled like
5011 one. Therefore, we forget the mangling here; we'll recompute it
5012 later if we need it. */
5013 if (TREE_CODE (new_friend) != TEMPLATE_DECL)
5015 SET_DECL_RTL (new_friend, NULL_RTX);
5016 SET_DECL_ASSEMBLER_NAME (new_friend, NULL_TREE);
5019 if (DECL_NAMESPACE_SCOPE_P (new_friend))
5022 tree new_friend_template_info;
5023 tree new_friend_result_template_info;
5025 int new_friend_is_defn;
5027 /* We must save some information from NEW_FRIEND before calling
5028 duplicate decls since that function will free NEW_FRIEND if
5030 new_friend_template_info = DECL_TEMPLATE_INFO (new_friend);
5031 new_friend_is_defn =
5032 (DECL_INITIAL (DECL_TEMPLATE_RESULT
5033 (template_for_substitution (new_friend)))
5035 if (TREE_CODE (new_friend) == TEMPLATE_DECL)
5037 /* This declaration is a `primary' template. */
5038 DECL_PRIMARY_TEMPLATE (new_friend) = new_friend;
5040 new_friend_result_template_info
5041 = DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (new_friend));
5044 new_friend_result_template_info = NULL_TREE;
5046 /* Inside pushdecl_namespace_level, we will push into the
5047 current namespace. However, the friend function should go
5048 into the namespace of the template. */
5049 ns = decl_namespace_context (new_friend);
5050 push_nested_namespace (ns);
5051 old_decl = pushdecl_namespace_level (new_friend);
5052 pop_nested_namespace (ns);
5054 if (old_decl != new_friend)
5056 /* This new friend declaration matched an existing
5057 declaration. For example, given:
5059 template <class T> void f(T);
5060 template <class U> class C {
5061 template <class T> friend void f(T) {}
5064 the friend declaration actually provides the definition
5065 of `f', once C has been instantiated for some type. So,
5066 old_decl will be the out-of-class template declaration,
5067 while new_friend is the in-class definition.
5069 But, if `f' was called before this point, the
5070 instantiation of `f' will have DECL_TI_ARGS corresponding
5071 to `T' but not to `U', references to which might appear
5072 in the definition of `f'. Previously, the most general
5073 template for an instantiation of `f' was the out-of-class
5074 version; now it is the in-class version. Therefore, we
5075 run through all specialization of `f', adding to their
5076 DECL_TI_ARGS appropriately. In particular, they need a
5077 new set of outer arguments, corresponding to the
5078 arguments for this class instantiation.
5080 The same situation can arise with something like this:
5083 template <class T> class C {
5087 when `C<int>' is instantiated. Now, `f(int)' is defined
5090 if (!new_friend_is_defn)
5091 /* On the other hand, if the in-class declaration does
5092 *not* provide a definition, then we don't want to alter
5093 existing definitions. We can just leave everything
5098 /* Overwrite whatever template info was there before, if
5099 any, with the new template information pertaining to
5101 DECL_TEMPLATE_INFO (old_decl) = new_friend_template_info;
5103 if (TREE_CODE (old_decl) != TEMPLATE_DECL)
5104 reregister_specialization (new_friend,
5105 most_general_template (old_decl),
5110 tree new_friend_args;
5112 DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (old_decl))
5113 = new_friend_result_template_info;
5115 new_friend_args = TI_ARGS (new_friend_template_info);
5116 for (t = DECL_TEMPLATE_SPECIALIZATIONS (old_decl);
5120 tree spec = TREE_VALUE (t);
5123 = add_outermost_template_args (new_friend_args,
5124 DECL_TI_ARGS (spec));
5127 /* Now, since specializations are always supposed to
5128 hang off of the most general template, we must move
5130 t = most_general_template (old_decl);
5133 DECL_TEMPLATE_SPECIALIZATIONS (t)
5134 = chainon (DECL_TEMPLATE_SPECIALIZATIONS (t),
5135 DECL_TEMPLATE_SPECIALIZATIONS (old_decl));
5136 DECL_TEMPLATE_SPECIALIZATIONS (old_decl) = NULL_TREE;
5141 /* The information from NEW_FRIEND has been merged into OLD_DECL
5142 by duplicate_decls. */
5143 new_friend = old_decl;
5146 else if (COMPLETE_TYPE_P (DECL_CONTEXT (new_friend)))
5148 /* Check to see that the declaration is really present, and,
5149 possibly obtain an improved declaration. */
5150 tree fn = check_classfn (DECL_CONTEXT (new_friend),
5158 input_location = saved_loc;
5162 /* FRIEND_TMPL is a friend TEMPLATE_DECL. ARGS is the vector of
5163 template arguments, as for tsubst.
5165 Returns an appropriate tsubst'd friend type or error_mark_node on
5169 tsubst_friend_class (tree friend_tmpl, tree args)
5175 context = DECL_CONTEXT (friend_tmpl);
5179 if (TREE_CODE (context) == NAMESPACE_DECL)
5180 push_nested_namespace (context);
5182 push_nested_class (tsubst (context, args, tf_none, NULL_TREE));
5185 /* First, we look for a class template. */
5186 tmpl = lookup_name (DECL_NAME (friend_tmpl), /*prefer_type=*/0);
5188 /* But, if we don't find one, it might be because we're in a
5189 situation like this:
5197 Here, in the scope of (say) S<int>, `S' is bound to a TYPE_DECL
5198 for `S<int>', not the TEMPLATE_DECL. */
5199 if (!tmpl || !DECL_CLASS_TEMPLATE_P (tmpl))
5201 tmpl = lookup_name (DECL_NAME (friend_tmpl), /*prefer_type=*/1);
5202 tmpl = maybe_get_template_decl_from_type_decl (tmpl);
5205 if (tmpl && DECL_CLASS_TEMPLATE_P (tmpl))
5207 /* The friend template has already been declared. Just
5208 check to see that the declarations match, and install any new
5209 default parameters. We must tsubst the default parameters,
5210 of course. We only need the innermost template parameters
5211 because that is all that redeclare_class_template will look
5213 if (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (friend_tmpl))
5214 > TMPL_ARGS_DEPTH (args))
5217 parms = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_tmpl),
5218 args, tf_error | tf_warning);
5219 redeclare_class_template (TREE_TYPE (tmpl), parms);
5222 friend_type = TREE_TYPE (tmpl);
5226 /* The friend template has not already been declared. In this
5227 case, the instantiation of the template class will cause the
5228 injection of this template into the global scope. */
5229 tmpl = tsubst (friend_tmpl, args, tf_error | tf_warning, NULL_TREE);
5231 /* The new TMPL is not an instantiation of anything, so we
5232 forget its origins. We don't reset CLASSTYPE_TI_TEMPLATE for
5233 the new type because that is supposed to be the corresponding
5234 template decl, i.e., TMPL. */
5235 DECL_USE_TEMPLATE (tmpl) = 0;
5236 DECL_TEMPLATE_INFO (tmpl) = NULL_TREE;
5237 CLASSTYPE_USE_TEMPLATE (TREE_TYPE (tmpl)) = 0;
5238 CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl))
5239 = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl)));
5241 /* Inject this template into the global scope. */
5242 friend_type = TREE_TYPE (pushdecl_top_level (tmpl));
5247 if (TREE_CODE (context) == NAMESPACE_DECL)
5248 pop_nested_namespace (context);
5250 pop_nested_class ();
5256 /* Returns zero if TYPE cannot be completed later due to circularity.
5257 Otherwise returns one. */
5260 can_complete_type_without_circularity (tree type)
5262 if (type == NULL_TREE || type == error_mark_node)
5264 else if (COMPLETE_TYPE_P (type))
5266 else if (TREE_CODE (type) == ARRAY_TYPE && TYPE_DOMAIN (type))
5267 return can_complete_type_without_circularity (TREE_TYPE (type));
5268 else if (CLASS_TYPE_P (type)
5269 && TYPE_BEING_DEFINED (TYPE_MAIN_VARIANT (type)))
5276 instantiate_class_template (tree type)
5278 tree template, args, pattern, t, member;
5282 if (type == error_mark_node)
5283 return error_mark_node;
5285 if (TYPE_BEING_DEFINED (type)
5286 || COMPLETE_TYPE_P (type)
5287 || dependent_type_p (type))
5290 /* Figure out which template is being instantiated. */
5291 template = most_general_template (CLASSTYPE_TI_TEMPLATE (type));
5292 my_friendly_assert (TREE_CODE (template) == TEMPLATE_DECL, 279);
5294 /* Figure out which arguments are being used to do the
5296 args = CLASSTYPE_TI_ARGS (type);
5298 /* Determine what specialization of the original template to
5300 t = most_specialized_class (template, args);
5301 if (t == error_mark_node)
5303 const char *str = "candidates are:";
5304 error ("ambiguous class template instantiation for `%#T'", type);
5305 for (t = DECL_TEMPLATE_SPECIALIZATIONS (template); t;
5308 if (get_class_bindings (TREE_VALUE (t), TREE_PURPOSE (t), args))
5310 cp_error_at ("%s %+#T", str, TREE_TYPE (t));
5314 TYPE_BEING_DEFINED (type) = 1;
5315 return error_mark_node;
5319 pattern = TREE_TYPE (t);
5321 pattern = TREE_TYPE (template);
5323 /* If the template we're instantiating is incomplete, then clearly
5324 there's nothing we can do. */
5325 if (!COMPLETE_TYPE_P (pattern))
5328 /* If we've recursively instantiated too many templates, stop. */
5329 if (! push_tinst_level (type))
5332 /* Now we're really doing the instantiation. Mark the type as in
5333 the process of being defined. */
5334 TYPE_BEING_DEFINED (type) = 1;
5336 /* We may be in the middle of deferred access check. Disable
5338 push_deferring_access_checks (dk_no_deferred);
5340 push_to_top_level ();
5344 /* This TYPE is actually an instantiation of a partial
5345 specialization. We replace the innermost set of ARGS with
5346 the arguments appropriate for substitution. For example,
5349 template <class T> struct S {};
5350 template <class T> struct S<T*> {};
5352 and supposing that we are instantiating S<int*>, ARGS will
5353 present be {int*} but we need {int}. */
5355 = get_class_bindings (TREE_VALUE (t), TREE_PURPOSE (t),
5358 /* If there were multiple levels in ARGS, replacing the
5359 innermost level would alter CLASSTYPE_TI_ARGS, which we don't
5360 want, so we make a copy first. */
5361 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args))
5363 args = copy_node (args);
5364 SET_TMPL_ARGS_LEVEL (args, TMPL_ARGS_DEPTH (args), inner_args);
5370 SET_CLASSTYPE_INTERFACE_UNKNOWN (type);
5372 /* Set the input location to the template definition. This is needed
5373 if tsubsting causes an error. */
5374 input_location = DECL_SOURCE_LOCATION (TYPE_NAME (pattern));
5376 TYPE_HAS_CONSTRUCTOR (type) = TYPE_HAS_CONSTRUCTOR (pattern);
5377 TYPE_HAS_DESTRUCTOR (type) = TYPE_HAS_DESTRUCTOR (pattern);
5378 TYPE_HAS_NEW_OPERATOR (type) = TYPE_HAS_NEW_OPERATOR (pattern);
5379 TYPE_HAS_ARRAY_NEW_OPERATOR (type) = TYPE_HAS_ARRAY_NEW_OPERATOR (pattern);
5380 TYPE_GETS_DELETE (type) = TYPE_GETS_DELETE (pattern);
5381 TYPE_HAS_ASSIGN_REF (type) = TYPE_HAS_ASSIGN_REF (pattern);
5382 TYPE_HAS_CONST_ASSIGN_REF (type) = TYPE_HAS_CONST_ASSIGN_REF (pattern);
5383 TYPE_HAS_ABSTRACT_ASSIGN_REF (type) = TYPE_HAS_ABSTRACT_ASSIGN_REF (pattern);
5384 TYPE_HAS_INIT_REF (type) = TYPE_HAS_INIT_REF (pattern);
5385 TYPE_HAS_CONST_INIT_REF (type) = TYPE_HAS_CONST_INIT_REF (pattern);
5386 TYPE_HAS_DEFAULT_CONSTRUCTOR (type) = TYPE_HAS_DEFAULT_CONSTRUCTOR (pattern);
5387 TYPE_HAS_CONVERSION (type) = TYPE_HAS_CONVERSION (pattern);
5388 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (type)
5389 = TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (pattern);
5390 TYPE_USES_MULTIPLE_INHERITANCE (type)
5391 = TYPE_USES_MULTIPLE_INHERITANCE (pattern);
5392 TYPE_USES_VIRTUAL_BASECLASSES (type)
5393 = TYPE_USES_VIRTUAL_BASECLASSES (pattern);
5394 TYPE_PACKED (type) = TYPE_PACKED (pattern);
5395 TYPE_ALIGN (type) = TYPE_ALIGN (pattern);
5396 TYPE_USER_ALIGN (type) = TYPE_USER_ALIGN (pattern);
5397 TYPE_FOR_JAVA (type) = TYPE_FOR_JAVA (pattern); /* For libjava's JArray<T> */
5398 if (ANON_AGGR_TYPE_P (pattern))
5399 SET_ANON_AGGR_TYPE_P (type);
5401 pbinfo = TYPE_BINFO (pattern);
5403 #ifdef ENABLE_CHECKING
5404 if (DECL_CLASS_SCOPE_P (TYPE_MAIN_DECL (pattern))
5405 && ! COMPLETE_TYPE_P (TYPE_CONTEXT (type))
5406 && ! TYPE_BEING_DEFINED (TYPE_CONTEXT (type)))
5407 /* We should never instantiate a nested class before its enclosing
5408 class; we need to look up the nested class by name before we can
5409 instantiate it, and that lookup should instantiate the enclosing
5414 if (BINFO_BASETYPES (pbinfo))
5416 tree base_list = NULL_TREE;
5417 tree pbases = BINFO_BASETYPES (pbinfo);
5418 tree paccesses = BINFO_BASEACCESSES (pbinfo);
5419 tree context = TYPE_CONTEXT (type);
5423 /* We must enter the scope containing the type, as that is where
5424 the accessibility of types named in dependent bases are
5426 pop_p = push_scope (context ? context : global_namespace);
5428 /* Substitute into each of the bases to determine the actual
5430 for (i = 0; i < TREE_VEC_LENGTH (pbases); ++i)
5436 pbase = TREE_VEC_ELT (pbases, i);
5437 access = TREE_VEC_ELT (paccesses, i);
5439 /* Substitute to figure out the base class. */
5440 base = tsubst (BINFO_TYPE (pbase), args, tf_error, NULL_TREE);
5441 if (base == error_mark_node)
5444 base_list = tree_cons (access, base, base_list);
5445 TREE_VIA_VIRTUAL (base_list) = TREE_VIA_VIRTUAL (pbase);
5448 /* The list is now in reverse order; correct that. */
5449 base_list = nreverse (base_list);
5451 /* Now call xref_basetypes to set up all the base-class
5453 xref_basetypes (type, base_list);
5456 pop_scope (context ? context : global_namespace);
5459 /* Now that our base classes are set up, enter the scope of the
5460 class, so that name lookups into base classes, etc. will work
5461 correctly. This is precisely analogous to what we do in
5462 begin_class_definition when defining an ordinary non-template
5466 /* Now members are processed in the order of declaration. */
5467 for (member = CLASSTYPE_DECL_LIST (pattern);
5468 member; member = TREE_CHAIN (member))
5470 tree t = TREE_VALUE (member);
5472 if (TREE_PURPOSE (member))
5476 /* Build new CLASSTYPE_NESTED_UTDS. */
5479 tree name = TYPE_IDENTIFIER (tag);
5482 newtag = tsubst (tag, args, tf_error, NULL_TREE);
5483 if (newtag == error_mark_node)
5486 if (TREE_CODE (newtag) != ENUMERAL_TYPE)
5488 if (TYPE_LANG_SPECIFIC (tag) && CLASSTYPE_IS_TEMPLATE (tag))
5489 /* Unfortunately, lookup_template_class sets
5490 CLASSTYPE_IMPLICIT_INSTANTIATION for a partial
5491 instantiation (i.e., for the type of a member
5492 template class nested within a template class.)
5493 This behavior is required for
5494 maybe_process_partial_specialization to work
5495 correctly, but is not accurate in this case;
5496 the TAG is not an instantiation of anything.
5497 (The corresponding TEMPLATE_DECL is an
5498 instantiation, but the TYPE is not.) */
5499 CLASSTYPE_USE_TEMPLATE (newtag) = 0;
5501 /* Now, we call pushtag to put this NEWTAG into the scope of
5502 TYPE. We first set up the IDENTIFIER_TYPE_VALUE to avoid
5503 pushtag calling push_template_decl. We don't have to do
5504 this for enums because it will already have been done in
5507 SET_IDENTIFIER_TYPE_VALUE (name, newtag);
5508 pushtag (name, newtag, /*globalize=*/0);
5511 else if (TREE_CODE (t) == FUNCTION_DECL
5512 || DECL_FUNCTION_TEMPLATE_P (t))
5514 /* Build new TYPE_METHODS. */
5517 if (TREE_CODE (t) == TEMPLATE_DECL)
5518 ++processing_template_decl;
5519 r = tsubst (t, args, tf_error, NULL_TREE);
5520 if (TREE_CODE (t) == TEMPLATE_DECL)
5521 --processing_template_decl;
5522 set_current_access_from_decl (r);
5523 grok_special_member_properties (r);
5524 finish_member_declaration (r);
5528 /* Build new TYPE_FIELDS. */
5530 if (TREE_CODE (t) != CONST_DECL)
5534 /* The the file and line for this declaration, to
5535 assist in error message reporting. Since we
5536 called push_tinst_level above, we don't need to
5538 input_location = DECL_SOURCE_LOCATION (t);
5540 if (TREE_CODE (t) == TEMPLATE_DECL)
5541 ++processing_template_decl;
5542 r = tsubst (t, args, tf_error | tf_warning, NULL_TREE);
5543 if (TREE_CODE (t) == TEMPLATE_DECL)
5544 --processing_template_decl;
5545 if (TREE_CODE (r) == VAR_DECL)
5549 if (DECL_INITIALIZED_IN_CLASS_P (r))
5550 init = tsubst_expr (DECL_INITIAL (t), args,
5551 tf_error | tf_warning, NULL_TREE);
5555 finish_static_data_member_decl
5556 (r, init, /*asmspec_tree=*/NULL_TREE, /*flags=*/0);
5558 if (DECL_INITIALIZED_IN_CLASS_P (r))
5559 check_static_variable_definition (r, TREE_TYPE (r));
5561 else if (TREE_CODE (r) == FIELD_DECL)
5563 /* Determine whether R has a valid type and can be
5564 completed later. If R is invalid, then it is
5565 replaced by error_mark_node so that it will not be
5566 added to TYPE_FIELDS. */
5567 tree rtype = TREE_TYPE (r);
5568 if (can_complete_type_without_circularity (rtype))
5569 complete_type (rtype);
5571 if (!COMPLETE_TYPE_P (rtype))
5573 cxx_incomplete_type_error (r, rtype);
5574 r = error_mark_node;
5578 /* If it is a TYPE_DECL for a class-scoped ENUMERAL_TYPE,
5579 such a thing will already have been added to the field
5580 list by tsubst_enum in finish_member_declaration in the
5581 CLASSTYPE_NESTED_UTDS case above. */
5582 if (!(TREE_CODE (r) == TYPE_DECL
5583 && TREE_CODE (TREE_TYPE (r)) == ENUMERAL_TYPE
5584 && DECL_ARTIFICIAL (r)))
5586 set_current_access_from_decl (r);
5587 finish_member_declaration (r);
5594 if (TYPE_P (t) || DECL_CLASS_TEMPLATE_P (t))
5596 /* Build new CLASSTYPE_FRIEND_CLASSES. */
5598 tree friend_type = t;
5599 tree new_friend_type;
5601 if (TREE_CODE (friend_type) == TEMPLATE_DECL)
5602 new_friend_type = tsubst_friend_class (friend_type, args);
5603 else if (uses_template_parms (friend_type))
5604 new_friend_type = tsubst (friend_type, args,
5605 tf_error | tf_warning, NULL_TREE);
5606 else if (CLASSTYPE_USE_TEMPLATE (friend_type))
5607 new_friend_type = friend_type;
5610 tree ns = decl_namespace_context (TYPE_MAIN_DECL (friend_type));
5612 /* The call to xref_tag_from_type does injection for friend
5614 push_nested_namespace (ns);
5616 xref_tag_from_type (friend_type, NULL_TREE, 1);
5617 pop_nested_namespace (ns);
5620 if (TREE_CODE (friend_type) == TEMPLATE_DECL)
5621 /* Trick make_friend_class into realizing that the friend
5622 we're adding is a template, not an ordinary class. It's
5623 important that we use make_friend_class since it will
5624 perform some error-checking and output cross-reference
5626 ++processing_template_decl;
5628 if (new_friend_type != error_mark_node)
5629 make_friend_class (type, new_friend_type,
5630 /*complain=*/false);
5632 if (TREE_CODE (friend_type) == TEMPLATE_DECL)
5633 --processing_template_decl;
5637 /* Build new DECL_FRIENDLIST. */
5640 if (TREE_CODE (t) == TEMPLATE_DECL)
5641 ++processing_template_decl;
5642 r = tsubst_friend_function (t, args);
5643 if (TREE_CODE (t) == TEMPLATE_DECL)
5644 --processing_template_decl;
5645 add_friend (type, r, /*complain=*/false);
5650 /* Set the file and line number information to whatever is given for
5651 the class itself. This puts error messages involving generated
5652 implicit functions at a predictable point, and the same point
5653 that would be used for non-template classes. */
5654 typedecl = TYPE_MAIN_DECL (type);
5655 input_location = DECL_SOURCE_LOCATION (typedecl);
5657 unreverse_member_declarations (type);
5658 finish_struct_1 (type);
5660 /* Clear this now so repo_template_used is happy. */
5661 TYPE_BEING_DEFINED (type) = 0;
5662 repo_template_used (type);
5664 /* Now that the class is complete, instantiate default arguments for
5665 any member functions. We don't do this earlier because the
5666 default arguments may reference members of the class. */
5667 if (!PRIMARY_TEMPLATE_P (template))
5668 for (t = TYPE_METHODS (type); t; t = TREE_CHAIN (t))
5669 if (TREE_CODE (t) == FUNCTION_DECL
5670 /* Implicitly generated member functions will not have template
5671 information; they are not instantiations, but instead are
5672 created "fresh" for each instantiation. */
5673 && DECL_TEMPLATE_INFO (t))
5674 tsubst_default_arguments (t);
5677 pop_from_top_level ();
5678 pop_deferring_access_checks ();
5681 if (TYPE_CONTAINS_VPTR_P (type))
5682 keyed_classes = tree_cons (NULL_TREE, type, keyed_classes);
5688 tsubst_template_arg (tree t, tree args, tsubst_flags_t complain, tree in_decl)
5694 else if (TYPE_P (t))
5695 r = tsubst (t, args, complain, in_decl);
5698 r = tsubst_expr (t, args, complain, in_decl);
5700 if (!uses_template_parms (r))
5702 /* Sometimes, one of the args was an expression involving a
5703 template constant parameter, like N - 1. Now that we've
5704 tsubst'd, we might have something like 2 - 1. This will
5705 confuse lookup_template_class, so we do constant folding
5706 here. We have to unset processing_template_decl, to fool
5707 tsubst_copy_and_build() into building an actual tree. */
5709 /* If the TREE_TYPE of ARG is not NULL_TREE, ARG is already
5710 as simple as it's going to get, and trying to reprocess
5711 the trees will break. Once tsubst_expr et al DTRT for
5712 non-dependent exprs, this code can go away, as the type
5713 will always be set. */
5716 int saved_processing_template_decl = processing_template_decl;
5717 processing_template_decl = 0;
5718 r = tsubst_copy_and_build (r, /*args=*/NULL_TREE,
5719 tf_error, /*in_decl=*/NULL_TREE,
5720 /*function_p=*/false);
5721 processing_template_decl = saved_processing_template_decl;
5729 /* Substitute ARGS into the vector or list of template arguments T. */
5732 tsubst_template_args (tree t, tree args, tsubst_flags_t complain, tree in_decl)
5734 int len = TREE_VEC_LENGTH (t);
5735 int need_new = 0, i;
5736 tree *elts = alloca (len * sizeof (tree));
5738 for (i = 0; i < len; i++)
5740 tree orig_arg = TREE_VEC_ELT (t, i);
5743 if (TREE_CODE (orig_arg) == TREE_VEC)
5744 new_arg = tsubst_template_args (orig_arg, args, complain, in_decl);
5746 new_arg = tsubst_template_arg (orig_arg, args, complain, in_decl);
5748 if (new_arg == error_mark_node)
5749 return error_mark_node;
5752 if (new_arg != orig_arg)
5759 t = make_tree_vec (len);
5760 for (i = 0; i < len; i++)
5761 TREE_VEC_ELT (t, i) = elts[i];
5766 /* Return the result of substituting ARGS into the template parameters
5767 given by PARMS. If there are m levels of ARGS and m + n levels of
5768 PARMS, then the result will contain n levels of PARMS. For
5769 example, if PARMS is `template <class T> template <class U>
5770 template <T*, U, class V>' and ARGS is {{int}, {double}} then the
5771 result will be `template <int*, double, class V>'. */
5774 tsubst_template_parms (tree parms, tree args, tsubst_flags_t complain)
5779 for (new_parms = &r;
5780 TMPL_PARMS_DEPTH (parms) > TMPL_ARGS_DEPTH (args);
5781 new_parms = &(TREE_CHAIN (*new_parms)),
5782 parms = TREE_CHAIN (parms))
5785 make_tree_vec (TREE_VEC_LENGTH (TREE_VALUE (parms)));
5788 for (i = 0; i < TREE_VEC_LENGTH (new_vec); ++i)
5790 tree tuple = TREE_VEC_ELT (TREE_VALUE (parms), i);
5791 tree default_value = TREE_PURPOSE (tuple);
5792 tree parm_decl = TREE_VALUE (tuple);
5794 parm_decl = tsubst (parm_decl, args, complain, NULL_TREE);
5795 default_value = tsubst_template_arg (default_value, args,
5796 complain, NULL_TREE);
5798 tuple = build_tree_list (default_value, parm_decl);
5799 TREE_VEC_ELT (new_vec, i) = tuple;
5803 tree_cons (size_int (TMPL_PARMS_DEPTH (parms)
5804 - TMPL_ARGS_DEPTH (args)),
5805 new_vec, NULL_TREE);
5811 /* Substitute the ARGS into the indicated aggregate (or enumeration)
5812 type T. If T is not an aggregate or enumeration type, it is
5813 handled as if by tsubst. IN_DECL is as for tsubst. If
5814 ENTERING_SCOPE is nonzero, T is the context for a template which
5815 we are presently tsubst'ing. Return the substituted value. */
5818 tsubst_aggr_type (tree t,
5820 tsubst_flags_t complain,
5827 switch (TREE_CODE (t))
5830 if (TYPE_PTRMEMFUNC_P (t))
5831 return tsubst (TYPE_PTRMEMFUNC_FN_TYPE (t), args, complain, in_decl);
5833 /* Else fall through. */
5836 if (TYPE_TEMPLATE_INFO (t))
5842 /* First, determine the context for the type we are looking
5844 context = TYPE_CONTEXT (t);
5846 context = tsubst_aggr_type (context, args, complain,
5847 in_decl, /*entering_scope=*/1);
5849 /* Then, figure out what arguments are appropriate for the
5850 type we are trying to find. For example, given:
5852 template <class T> struct S;
5853 template <class T, class U> void f(T, U) { S<U> su; }
5855 and supposing that we are instantiating f<int, double>,
5856 then our ARGS will be {int, double}, but, when looking up
5857 S we only want {double}. */
5858 argvec = tsubst_template_args (TYPE_TI_ARGS (t), args,
5860 if (argvec == error_mark_node)
5861 return error_mark_node;
5863 r = lookup_template_class (t, argvec, in_decl, context,
5864 entering_scope, complain);
5866 return cp_build_qualified_type_real (r, TYPE_QUALS (t), complain);
5869 /* This is not a template type, so there's nothing to do. */
5873 return tsubst (t, args, complain, in_decl);
5877 /* Substitute into the default argument ARG (a default argument for
5878 FN), which has the indicated TYPE. */
5881 tsubst_default_argument (tree fn, tree type, tree arg)
5883 /* This default argument came from a template. Instantiate the
5884 default argument here, not in tsubst. In the case of
5893 we must be careful to do name lookup in the scope of S<T>,
5894 rather than in the current class.
5896 ??? current_class_type affects a lot more than name lookup. This is
5897 very fragile. Fortunately, it will go away when we do 2-phase name
5898 binding properly. */
5900 /* FN is already the desired FUNCTION_DECL. */
5901 push_access_scope (fn);
5903 arg = tsubst_expr (arg, DECL_TI_ARGS (fn),
5904 tf_error | tf_warning, NULL_TREE);
5906 pop_access_scope (fn);
5908 /* Make sure the default argument is reasonable. */
5909 arg = check_default_argument (type, arg);
5914 /* Substitute into all the default arguments for FN. */
5917 tsubst_default_arguments (tree fn)
5922 tmpl_args = DECL_TI_ARGS (fn);
5924 /* If this function is not yet instantiated, we certainly don't need
5925 its default arguments. */
5926 if (uses_template_parms (tmpl_args))
5929 for (arg = TYPE_ARG_TYPES (TREE_TYPE (fn));
5931 arg = TREE_CHAIN (arg))
5932 if (TREE_PURPOSE (arg))
5933 TREE_PURPOSE (arg) = tsubst_default_argument (fn,
5935 TREE_PURPOSE (arg));
5938 /* Substitute the ARGS into the T, which is a _DECL. TYPE is the
5939 (already computed) substitution of ARGS into TREE_TYPE (T), if
5940 appropriate. Return the result of the substitution. Issue error
5941 and warning messages under control of COMPLAIN. */
5944 tsubst_decl (tree t, tree args, tree type, tsubst_flags_t complain)
5946 location_t saved_loc;
5950 /* Set the filename and linenumber to improve error-reporting. */
5951 saved_loc = input_location;
5952 input_location = DECL_SOURCE_LOCATION (t);
5954 switch (TREE_CODE (t))
5958 /* We can get here when processing a member template function
5959 of a template class. */
5960 tree decl = DECL_TEMPLATE_RESULT (t);
5962 int is_template_template_parm = DECL_TEMPLATE_TEMPLATE_PARM_P (t);
5964 if (!is_template_template_parm)
5966 /* We might already have an instance of this template.
5967 The ARGS are for the surrounding class type, so the
5968 full args contain the tsubst'd args for the context,
5969 plus the innermost args from the template decl. */
5970 tree tmpl_args = DECL_CLASS_TEMPLATE_P (t)
5971 ? CLASSTYPE_TI_ARGS (TREE_TYPE (t))
5972 : DECL_TI_ARGS (DECL_TEMPLATE_RESULT (t));
5975 full_args = tsubst_template_args (tmpl_args, args,
5978 /* tsubst_template_args doesn't copy the vector if
5979 nothing changed. But, *something* should have
5981 my_friendly_assert (full_args != tmpl_args, 0);
5983 spec = retrieve_specialization (t, full_args);
5984 if (spec != NULL_TREE)
5991 /* Make a new template decl. It will be similar to the
5992 original, but will record the current template arguments.
5993 We also create a new function declaration, which is just
5994 like the old one, but points to this new template, rather
5995 than the old one. */
5997 my_friendly_assert (DECL_LANG_SPECIFIC (r) != 0, 0);
5998 TREE_CHAIN (r) = NULL_TREE;
6000 if (is_template_template_parm)
6002 tree new_decl = tsubst (decl, args, complain, in_decl);
6003 DECL_TEMPLATE_RESULT (r) = new_decl;
6004 TREE_TYPE (r) = TREE_TYPE (new_decl);
6009 = tsubst_aggr_type (DECL_CONTEXT (t), args,
6011 /*entering_scope=*/1);
6012 DECL_TEMPLATE_INFO (r) = build_tree_list (t, args);
6014 if (TREE_CODE (decl) == TYPE_DECL)
6016 tree new_type = tsubst (TREE_TYPE (t), args, complain, in_decl);
6017 if (new_type == error_mark_node)
6018 return error_mark_node;
6020 TREE_TYPE (r) = new_type;
6021 CLASSTYPE_TI_TEMPLATE (new_type) = r;
6022 DECL_TEMPLATE_RESULT (r) = TYPE_MAIN_DECL (new_type);
6023 DECL_TI_ARGS (r) = CLASSTYPE_TI_ARGS (new_type);
6027 tree new_decl = tsubst (decl, args, complain, in_decl);
6028 if (new_decl == error_mark_node)
6029 return error_mark_node;
6031 DECL_TEMPLATE_RESULT (r) = new_decl;
6032 DECL_TI_TEMPLATE (new_decl) = r;
6033 TREE_TYPE (r) = TREE_TYPE (new_decl);
6034 DECL_TI_ARGS (r) = DECL_TI_ARGS (new_decl);
6037 SET_DECL_IMPLICIT_INSTANTIATION (r);
6038 DECL_TEMPLATE_INSTANTIATIONS (r) = NULL_TREE;
6039 DECL_TEMPLATE_SPECIALIZATIONS (r) = NULL_TREE;
6041 /* The template parameters for this new template are all the
6042 template parameters for the old template, except the
6043 outermost level of parameters. */
6044 DECL_TEMPLATE_PARMS (r)
6045 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t), args,
6048 if (PRIMARY_TEMPLATE_P (t))
6049 DECL_PRIMARY_TEMPLATE (r) = r;
6051 if (TREE_CODE (decl) != TYPE_DECL)
6052 /* Record this non-type partial instantiation. */
6053 register_specialization (r, t,
6054 DECL_TI_ARGS (DECL_TEMPLATE_RESULT (r)));
6061 tree argvec = NULL_TREE;
6068 /* Nobody should be tsubst'ing into non-template functions. */
6069 my_friendly_assert (DECL_TEMPLATE_INFO (t) != NULL_TREE, 0);
6071 if (TREE_CODE (DECL_TI_TEMPLATE (t)) == TEMPLATE_DECL)
6076 /* If T is not dependent, just return it. We have to
6077 increment PROCESSING_TEMPLATE_DECL because
6078 value_dependent_expression_p assumes that nothing is
6079 dependent when PROCESSING_TEMPLATE_DECL is zero. */
6080 ++processing_template_decl;
6081 dependent_p = value_dependent_expression_p (t);
6082 --processing_template_decl;
6086 /* Calculate the most general template of which R is a
6087 specialization, and the complete set of arguments used to
6089 gen_tmpl = most_general_template (DECL_TI_TEMPLATE (t));
6090 argvec = tsubst_template_args (DECL_TI_ARGS
6091 (DECL_TEMPLATE_RESULT (gen_tmpl)),
6092 args, complain, in_decl);
6094 /* Check to see if we already have this specialization. */
6095 spec = retrieve_specialization (gen_tmpl, argvec);
6103 /* We can see more levels of arguments than parameters if
6104 there was a specialization of a member template, like
6107 template <class T> struct S { template <class U> void f(); }
6108 template <> template <class U> void S<int>::f(U);
6110 Here, we'll be substituting into the specialization,
6111 because that's where we can find the code we actually
6112 want to generate, but we'll have enough arguments for
6113 the most general template.
6115 We also deal with the peculiar case:
6117 template <class T> struct S {
6118 template <class U> friend void f();
6120 template <class U> void f() {}
6122 template void f<double>();
6124 Here, the ARGS for the instantiation of will be {int,
6125 double}. But, we only need as many ARGS as there are
6126 levels of template parameters in CODE_PATTERN. We are
6127 careful not to get fooled into reducing the ARGS in
6130 template <class T> struct S { template <class U> void f(U); }
6131 template <class T> template <> void S<T>::f(int) {}
6133 which we can spot because the pattern will be a
6134 specialization in this case. */
6135 args_depth = TMPL_ARGS_DEPTH (args);
6137 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (t)));
6138 if (args_depth > parms_depth
6139 && !DECL_TEMPLATE_SPECIALIZATION (t))
6140 args = get_innermost_template_args (args, parms_depth);
6144 /* This special case arises when we have something like this:
6146 template <class T> struct S {
6147 friend void f<int>(int, double);
6150 Here, the DECL_TI_TEMPLATE for the friend declaration
6151 will be an IDENTIFIER_NODE. We are being called from
6152 tsubst_friend_function, and we want only to create a
6153 new decl (R) with appropriate types so that we can call
6154 determine_specialization. */
6155 gen_tmpl = NULL_TREE;
6158 if (DECL_CLASS_SCOPE_P (t))
6160 if (DECL_NAME (t) == constructor_name (DECL_CONTEXT (t)))
6164 ctx = tsubst_aggr_type (DECL_CONTEXT (t), args,
6165 complain, t, /*entering_scope=*/1);
6170 ctx = DECL_CONTEXT (t);
6172 type = tsubst (type, args, complain, in_decl);
6173 if (type == error_mark_node)
6174 return error_mark_node;
6176 /* We do NOT check for matching decls pushed separately at this
6177 point, as they may not represent instantiations of this
6178 template, and in any case are considered separate under the
6181 DECL_USE_TEMPLATE (r) = 0;
6182 TREE_TYPE (r) = type;
6183 /* Clear out the mangled name and RTL for the instantiation. */
6184 SET_DECL_ASSEMBLER_NAME (r, NULL_TREE);
6185 SET_DECL_RTL (r, NULL_RTX);
6186 DECL_INITIAL (r) = NULL_TREE;
6187 DECL_CONTEXT (r) = ctx;
6189 if (member && DECL_CONV_FN_P (r))
6190 /* Type-conversion operator. Reconstruct the name, in
6191 case it's the name of one of the template's parameters. */
6192 DECL_NAME (r) = mangle_conv_op_name_for_type (TREE_TYPE (type));
6194 DECL_ARGUMENTS (r) = tsubst (DECL_ARGUMENTS (t), args,
6196 DECL_RESULT (r) = NULL_TREE;
6198 TREE_STATIC (r) = 0;
6199 TREE_PUBLIC (r) = TREE_PUBLIC (t);
6200 DECL_EXTERNAL (r) = 1;
6201 DECL_INTERFACE_KNOWN (r) = 0;
6202 DECL_DEFER_OUTPUT (r) = 0;
6203 TREE_CHAIN (r) = NULL_TREE;
6204 DECL_PENDING_INLINE_INFO (r) = 0;
6205 DECL_PENDING_INLINE_P (r) = 0;
6206 DECL_SAVED_TREE (r) = NULL_TREE;
6208 if (DECL_CLONED_FUNCTION (r))
6210 DECL_CLONED_FUNCTION (r) = tsubst (DECL_CLONED_FUNCTION (t),
6212 TREE_CHAIN (r) = TREE_CHAIN (DECL_CLONED_FUNCTION (r));
6213 TREE_CHAIN (DECL_CLONED_FUNCTION (r)) = r;
6216 /* Set up the DECL_TEMPLATE_INFO for R. There's no need to do
6217 this in the special friend case mentioned above where
6218 GEN_TMPL is NULL. */
6221 DECL_TEMPLATE_INFO (r)
6222 = tree_cons (gen_tmpl, argvec, NULL_TREE);
6223 SET_DECL_IMPLICIT_INSTANTIATION (r);
6224 register_specialization (r, gen_tmpl, argvec);
6226 /* We're not supposed to instantiate default arguments
6227 until they are called, for a template. But, for a
6230 template <class T> void f ()
6231 { extern void g(int i = T()); }
6233 we should do the substitution when the template is
6234 instantiated. We handle the member function case in
6235 instantiate_class_template since the default arguments
6236 might refer to other members of the class. */
6238 && !PRIMARY_TEMPLATE_P (gen_tmpl)
6239 && !uses_template_parms (argvec))
6240 tsubst_default_arguments (r);
6243 /* Copy the list of befriending classes. */
6244 for (friends = &DECL_BEFRIENDING_CLASSES (r);
6246 friends = &TREE_CHAIN (*friends))
6248 *friends = copy_node (*friends);
6249 TREE_VALUE (*friends) = tsubst (TREE_VALUE (*friends),
6254 if (DECL_CONSTRUCTOR_P (r) || DECL_DESTRUCTOR_P (r))
6256 maybe_retrofit_in_chrg (r);
6257 if (DECL_CONSTRUCTOR_P (r))
6258 grok_ctor_properties (ctx, r);
6259 /* If this is an instantiation of a member template, clone it.
6260 If it isn't, that'll be handled by
6261 clone_constructors_and_destructors. */
6262 if (PRIMARY_TEMPLATE_P (gen_tmpl))
6263 clone_function_decl (r, /*update_method_vec_p=*/0);
6265 else if (IDENTIFIER_OPNAME_P (DECL_NAME (r)))
6266 grok_op_properties (r, DECL_FRIEND_P (r),
6267 (complain & tf_error) != 0);
6274 if (DECL_TEMPLATE_PARM_P (t))
6275 SET_DECL_TEMPLATE_PARM_P (r);
6277 TREE_TYPE (r) = type;
6278 c_apply_type_quals_to_decl (cp_type_quals (type), r);
6280 if (DECL_INITIAL (r))
6282 if (TREE_CODE (DECL_INITIAL (r)) != TEMPLATE_PARM_INDEX)
6283 DECL_INITIAL (r) = TREE_TYPE (r);
6285 DECL_INITIAL (r) = tsubst (DECL_INITIAL (r), args,
6289 DECL_CONTEXT (r) = NULL_TREE;
6291 if (!DECL_TEMPLATE_PARM_P (r))
6292 DECL_ARG_TYPE (r) = type_passed_as (type);
6294 TREE_CHAIN (r) = tsubst (TREE_CHAIN (t), args,
6295 complain, TREE_CHAIN (t));
6302 TREE_TYPE (r) = type;
6303 c_apply_type_quals_to_decl (cp_type_quals (type), r);
6305 /* We don't have to set DECL_CONTEXT here; it is set by
6306 finish_member_declaration. */
6307 DECL_INITIAL (r) = tsubst_expr (DECL_INITIAL (t), args,
6309 TREE_CHAIN (r) = NULL_TREE;
6310 if (VOID_TYPE_P (type))
6311 cp_error_at ("instantiation of `%D' as type `%T'", r, type);
6318 /* It is not a dependent using decl any more. */
6319 TREE_TYPE (r) = void_type_node;
6321 = tsubst_copy (DECL_INITIAL (t), args, complain, in_decl);
6323 = tsubst_copy (DECL_NAME (t), args, complain, in_decl);
6324 TREE_CHAIN (r) = NULL_TREE;
6329 if (TREE_CODE (type) == TEMPLATE_TEMPLATE_PARM
6330 || t == TYPE_MAIN_DECL (TREE_TYPE (t)))
6332 /* If this is the canonical decl, we don't have to mess with
6333 instantiations, and often we can't (for typename, template
6334 type parms and such). Note that TYPE_NAME is not correct for
6335 the above test if we've copied the type for a typedef. */
6336 r = TYPE_NAME (type);
6344 tree argvec = NULL_TREE;
6345 tree gen_tmpl = NULL_TREE;
6347 tree tmpl = NULL_TREE;
6351 /* Assume this is a non-local variable. */
6354 if (TYPE_P (CP_DECL_CONTEXT (t)))
6355 ctx = tsubst_aggr_type (DECL_CONTEXT (t), args,
6357 in_decl, /*entering_scope=*/1);
6358 else if (DECL_NAMESPACE_SCOPE_P (t))
6359 ctx = DECL_CONTEXT (t);
6362 /* Subsequent calls to pushdecl will fill this in. */
6367 /* Check to see if we already have this specialization. */
6370 tmpl = DECL_TI_TEMPLATE (t);
6371 gen_tmpl = most_general_template (tmpl);
6372 argvec = tsubst (DECL_TI_ARGS (t), args, complain, in_decl);
6373 spec = retrieve_specialization (gen_tmpl, argvec);
6376 spec = retrieve_local_specialization (t);
6385 if (TREE_CODE (r) == VAR_DECL)
6387 type = complete_type (type);
6388 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (r)
6389 = DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (t);
6391 else if (DECL_SELF_REFERENCE_P (t))
6392 SET_DECL_SELF_REFERENCE_P (r);
6393 TREE_TYPE (r) = type;
6394 c_apply_type_quals_to_decl (cp_type_quals (type), r);
6395 DECL_CONTEXT (r) = ctx;
6396 /* Clear out the mangled name and RTL for the instantiation. */
6397 SET_DECL_ASSEMBLER_NAME (r, NULL_TREE);
6398 SET_DECL_RTL (r, NULL_RTX);
6400 /* Don't try to expand the initializer until someone tries to use
6401 this variable; otherwise we run into circular dependencies. */
6402 DECL_INITIAL (r) = NULL_TREE;
6403 SET_DECL_RTL (r, NULL_RTX);
6404 DECL_SIZE (r) = DECL_SIZE_UNIT (r) = 0;
6406 /* Even if the original location is out of scope, the newly
6407 substituted one is not. */
6408 if (TREE_CODE (r) == VAR_DECL)
6410 DECL_DEAD_FOR_LOCAL (r) = 0;
6411 DECL_INITIALIZED_P (r) = 0;
6416 /* A static data member declaration is always marked
6417 external when it is declared in-class, even if an
6418 initializer is present. We mimic the non-template
6420 DECL_EXTERNAL (r) = 1;
6422 register_specialization (r, gen_tmpl, argvec);
6423 DECL_TEMPLATE_INFO (r) = tree_cons (tmpl, argvec, NULL_TREE);
6424 SET_DECL_IMPLICIT_INSTANTIATION (r);
6427 register_local_specialization (r, t);
6429 TREE_CHAIN (r) = NULL_TREE;
6430 if (TREE_CODE (r) == VAR_DECL && VOID_TYPE_P (type))
6431 cp_error_at ("instantiation of `%D' as type `%T'", r, type);
6432 /* Compute the size, alignment, etc. of R. */
6441 /* Restore the file and line information. */
6442 input_location = saved_loc;
6447 /* Substitute into the ARG_TYPES of a function type. */
6450 tsubst_arg_types (tree arg_types,
6452 tsubst_flags_t complain,
6455 tree remaining_arg_types;
6458 if (!arg_types || arg_types == void_list_node)
6461 remaining_arg_types = tsubst_arg_types (TREE_CHAIN (arg_types),
6462 args, complain, in_decl);
6463 if (remaining_arg_types == error_mark_node)
6464 return error_mark_node;
6466 type = tsubst (TREE_VALUE (arg_types), args, complain, in_decl);
6467 if (type == error_mark_node)
6468 return error_mark_node;
6469 if (VOID_TYPE_P (type))
6471 if (complain & tf_error)
6473 error ("invalid parameter type `%T'", type);
6475 cp_error_at ("in declaration `%D'", in_decl);
6477 return error_mark_node;
6480 /* Do array-to-pointer, function-to-pointer conversion, and ignore
6481 top-level qualifiers as required. */
6482 type = TYPE_MAIN_VARIANT (type_decays_to (type));
6484 /* Note that we do not substitute into default arguments here. The
6485 standard mandates that they be instantiated only when needed,
6486 which is done in build_over_call. */
6487 return hash_tree_cons (TREE_PURPOSE (arg_types), type,
6488 remaining_arg_types);
6492 /* Substitute into a FUNCTION_TYPE or METHOD_TYPE. This routine does
6493 *not* handle the exception-specification for FNTYPE, because the
6494 initial substitution of explicitly provided template parameters
6495 during argument deduction forbids substitution into the
6496 exception-specification:
6500 All references in the function type of the function template to the
6501 corresponding template parameters are replaced by the specified tem-
6502 plate argument values. If a substitution in a template parameter or
6503 in the function type of the function template results in an invalid
6504 type, type deduction fails. [Note: The equivalent substitution in
6505 exception specifications is done only when the function is instanti-
6506 ated, at which point a program is ill-formed if the substitution
6507 results in an invalid type.] */
6510 tsubst_function_type (tree t,
6512 tsubst_flags_t complain,
6519 /* The TYPE_CONTEXT is not used for function/method types. */
6520 my_friendly_assert (TYPE_CONTEXT (t) == NULL_TREE, 0);
6522 /* Substitute the return type. */
6523 return_type = tsubst (TREE_TYPE (t), args, complain, in_decl);
6524 if (return_type == error_mark_node)
6525 return error_mark_node;
6527 /* Substitute the argument types. */
6528 arg_types = tsubst_arg_types (TYPE_ARG_TYPES (t), args,
6530 if (arg_types == error_mark_node)
6531 return error_mark_node;
6533 /* Construct a new type node and return it. */
6534 if (TREE_CODE (t) == FUNCTION_TYPE)
6535 fntype = build_function_type (return_type, arg_types);
6538 tree r = TREE_TYPE (TREE_VALUE (arg_types));
6539 if (! IS_AGGR_TYPE (r))
6543 Type deduction may fail for any of the following
6546 -- Attempting to create "pointer to member of T" when T
6547 is not a class type. */
6548 if (complain & tf_error)
6549 error ("creating pointer to member function of non-class type `%T'",
6551 return error_mark_node;
6554 fntype = build_method_type_directly (r, return_type,
6555 TREE_CHAIN (arg_types));
6557 fntype = cp_build_qualified_type_real (fntype, TYPE_QUALS (t), complain);
6558 fntype = cp_build_type_attribute_variant (fntype, TYPE_ATTRIBUTES (t));
6563 /* Substitute into the PARMS of a call-declarator. */
6566 tsubst_call_declarator_parms (tree parms,
6568 tsubst_flags_t complain,
6575 if (!parms || parms == void_list_node)
6578 new_parms = tsubst_call_declarator_parms (TREE_CHAIN (parms),
6579 args, complain, in_decl);
6581 /* Figure out the type of this parameter. */
6582 type = tsubst (TREE_VALUE (parms), args, complain, in_decl);
6584 /* Figure out the default argument as well. Note that we use
6585 tsubst_expr since the default argument is really an expression. */
6586 defarg = tsubst_expr (TREE_PURPOSE (parms), args, complain, in_decl);
6588 /* Chain this parameter on to the front of those we have already
6589 processed. We don't use hash_tree_cons because that function
6590 doesn't check TREE_PARMLIST. */
6591 new_parms = tree_cons (defarg, type, new_parms);
6593 /* And note that these are parameters. */
6594 TREE_PARMLIST (new_parms) = 1;
6599 /* Take the tree structure T and replace template parameters used
6600 therein with the argument vector ARGS. IN_DECL is an associated
6601 decl for diagnostics. If an error occurs, returns ERROR_MARK_NODE.
6602 Issue error and warning messages under control of COMPLAIN. Note
6603 that we must be relatively non-tolerant of extensions here, in
6604 order to preserve conformance; if we allow substitutions that
6605 should not be allowed, we may allow argument deductions that should
6606 not succeed, and therefore report ambiguous overload situations
6607 where there are none. In theory, we could allow the substitution,
6608 but indicate that it should have failed, and allow our caller to
6609 make sure that the right thing happens, but we don't try to do this
6612 This function is used for dealing with types, decls and the like;
6613 for expressions, use tsubst_expr or tsubst_copy. */
6616 tsubst (tree t, tree args, tsubst_flags_t complain, tree in_decl)
6620 if (t == NULL_TREE || t == error_mark_node
6621 || t == integer_type_node
6622 || t == void_type_node
6623 || t == char_type_node
6624 || TREE_CODE (t) == NAMESPACE_DECL)
6627 if (TREE_CODE (t) == IDENTIFIER_NODE)
6628 type = IDENTIFIER_TYPE_VALUE (t);
6630 type = TREE_TYPE (t);
6632 my_friendly_assert (type != unknown_type_node, 20030716);
6634 if (type && TREE_CODE (t) != FUNCTION_DECL
6635 && TREE_CODE (t) != TYPENAME_TYPE
6636 && TREE_CODE (t) != TEMPLATE_DECL
6637 && TREE_CODE (t) != IDENTIFIER_NODE
6638 && TREE_CODE (t) != FUNCTION_TYPE
6639 && TREE_CODE (t) != METHOD_TYPE)
6640 type = tsubst (type, args, complain, in_decl);
6641 if (type == error_mark_node)
6642 return error_mark_node;
6645 return tsubst_decl (t, args, type, complain);
6647 switch (TREE_CODE (t))
6652 return tsubst_aggr_type (t, args, complain, in_decl,
6653 /*entering_scope=*/0);
6656 case IDENTIFIER_NODE:
6668 if (t == integer_type_node)
6671 if (TREE_CODE (TYPE_MIN_VALUE (t)) == INTEGER_CST
6672 && TREE_CODE (TYPE_MAX_VALUE (t)) == INTEGER_CST)
6676 tree max, omax = TREE_OPERAND (TYPE_MAX_VALUE (t), 0);
6678 /* The array dimension behaves like a non-type template arg,
6679 in that we want to fold it as much as possible. */
6680 max = tsubst_template_arg (omax, args, complain, in_decl);
6681 if (!processing_template_decl)
6682 max = decl_constant_value (max);
6684 if (integer_zerop (omax))
6686 /* Still allow an explicit array of size zero. */
6688 pedwarn ("creating array with size zero");
6690 else if (integer_zerop (max)
6691 || (TREE_CODE (max) == INTEGER_CST
6692 && INT_CST_LT (max, integer_zero_node)))
6696 Type deduction may fail for any of the following
6699 Attempting to create an array with a size that is
6700 zero or negative. */
6701 if (complain & tf_error)
6702 error ("creating array with size zero (`%E')", max);
6704 return error_mark_node;
6707 return compute_array_index_type (NULL_TREE, max);
6710 case TEMPLATE_TYPE_PARM:
6711 case TEMPLATE_TEMPLATE_PARM:
6712 case BOUND_TEMPLATE_TEMPLATE_PARM:
6713 case TEMPLATE_PARM_INDEX:
6721 if (TREE_CODE (t) == TEMPLATE_TYPE_PARM
6722 || TREE_CODE (t) == TEMPLATE_TEMPLATE_PARM
6723 || TREE_CODE (t) == BOUND_TEMPLATE_TEMPLATE_PARM)
6725 idx = TEMPLATE_TYPE_IDX (t);
6726 level = TEMPLATE_TYPE_LEVEL (t);
6730 idx = TEMPLATE_PARM_IDX (t);
6731 level = TEMPLATE_PARM_LEVEL (t);
6734 if (TREE_VEC_LENGTH (args) > 0)
6736 tree arg = NULL_TREE;
6738 levels = TMPL_ARGS_DEPTH (args);
6739 if (level <= levels)
6740 arg = TMPL_ARG (args, level, idx);
6742 if (arg == error_mark_node)
6743 return error_mark_node;
6744 else if (arg != NULL_TREE)
6746 if (TREE_CODE (t) == TEMPLATE_TYPE_PARM)
6748 my_friendly_assert (TYPE_P (arg), 0);
6749 return cp_build_qualified_type_real
6750 (arg, cp_type_quals (arg) | cp_type_quals (t),
6751 complain | tf_ignore_bad_quals);
6753 else if (TREE_CODE (t) == BOUND_TEMPLATE_TEMPLATE_PARM)
6755 /* We are processing a type constructed from
6756 a template template parameter. */
6757 tree argvec = tsubst (TYPE_TI_ARGS (t),
6758 args, complain, in_decl);
6759 if (argvec == error_mark_node)
6760 return error_mark_node;
6762 /* We can get a TEMPLATE_TEMPLATE_PARM here when
6763 we are resolving nested-types in the signature of
6764 a member function templates.
6765 Otherwise ARG is a TEMPLATE_DECL and is the real
6766 template to be instantiated. */
6767 if (TREE_CODE (arg) == TEMPLATE_TEMPLATE_PARM)
6768 arg = TYPE_NAME (arg);
6770 r = lookup_template_class (arg,
6773 /*entering_scope=*/0,
6775 return cp_build_qualified_type_real
6776 (r, TYPE_QUALS (t), complain);
6779 /* TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX. */
6787 /* This can happen during the attempted tsubst'ing in
6788 unify. This means that we don't yet have any information
6789 about the template parameter in question. */
6792 /* If we get here, we must have been looking at a parm for a
6793 more deeply nested template. Make a new version of this
6794 template parameter, but with a lower level. */
6795 switch (TREE_CODE (t))
6797 case TEMPLATE_TYPE_PARM:
6798 case TEMPLATE_TEMPLATE_PARM:
6799 case BOUND_TEMPLATE_TEMPLATE_PARM:
6800 if (cp_type_quals (t))
6802 r = tsubst (TYPE_MAIN_VARIANT (t), args, complain, in_decl);
6803 r = cp_build_qualified_type_real
6804 (r, cp_type_quals (t),
6805 complain | (TREE_CODE (t) == TEMPLATE_TYPE_PARM
6806 ? tf_ignore_bad_quals : 0));
6811 TEMPLATE_TYPE_PARM_INDEX (r)
6812 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (t),
6814 TYPE_STUB_DECL (r) = TYPE_NAME (r) = TEMPLATE_TYPE_DECL (r);
6815 TYPE_MAIN_VARIANT (r) = r;
6816 TYPE_POINTER_TO (r) = NULL_TREE;
6817 TYPE_REFERENCE_TO (r) = NULL_TREE;
6819 if (TREE_CODE (t) == BOUND_TEMPLATE_TEMPLATE_PARM)
6821 tree argvec = tsubst (TYPE_TI_ARGS (t), args,
6823 if (argvec == error_mark_node)
6824 return error_mark_node;
6826 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (r)
6827 = tree_cons (TYPE_TI_TEMPLATE (t), argvec, NULL_TREE);
6832 case TEMPLATE_PARM_INDEX:
6833 r = reduce_template_parm_level (t, type, levels);
6845 tree purpose, value, chain, result;
6847 if (t == void_list_node)
6850 purpose = TREE_PURPOSE (t);
6853 purpose = tsubst (purpose, args, complain, in_decl);
6854 if (purpose == error_mark_node)
6855 return error_mark_node;
6857 value = TREE_VALUE (t);
6860 value = tsubst (value, args, complain, in_decl);
6861 if (value == error_mark_node)
6862 return error_mark_node;
6864 chain = TREE_CHAIN (t);
6865 if (chain && chain != void_type_node)
6867 chain = tsubst (chain, args, complain, in_decl);
6868 if (chain == error_mark_node)
6869 return error_mark_node;
6871 if (purpose == TREE_PURPOSE (t)
6872 && value == TREE_VALUE (t)
6873 && chain == TREE_CHAIN (t))
6875 if (TREE_PARMLIST (t))
6877 result = tree_cons (purpose, value, chain);
6878 TREE_PARMLIST (result) = 1;
6881 result = hash_tree_cons (purpose, value, chain);
6885 if (type != NULL_TREE)
6887 /* A binfo node. We always need to make a copy, of the node
6888 itself and of its BINFO_BASETYPES. */
6892 /* Make sure type isn't a typedef copy. */
6893 type = BINFO_TYPE (TYPE_BINFO (type));
6895 TREE_TYPE (t) = complete_type (type);
6896 if (IS_AGGR_TYPE (type))
6898 BINFO_VTABLE (t) = TYPE_BINFO_VTABLE (type);
6899 BINFO_VIRTUALS (t) = TYPE_BINFO_VIRTUALS (type);
6900 if (TYPE_BINFO_BASETYPES (type) != NULL_TREE)
6901 BINFO_BASETYPES (t) = copy_node (TYPE_BINFO_BASETYPES (type));
6906 /* Otherwise, a vector of template arguments. */
6907 return tsubst_template_args (t, args, complain, in_decl);
6910 case REFERENCE_TYPE:
6912 enum tree_code code;
6914 if (type == TREE_TYPE (t) && TREE_CODE (type) != METHOD_TYPE)
6917 code = TREE_CODE (t);
6922 Type deduction may fail for any of the following
6925 -- Attempting to create a pointer to reference type.
6926 -- Attempting to create a reference to a reference type or
6927 a reference to void. */
6928 if (TREE_CODE (type) == REFERENCE_TYPE
6929 || (code == REFERENCE_TYPE && TREE_CODE (type) == VOID_TYPE))
6931 static location_t last_loc;
6933 /* We keep track of the last time we issued this error
6934 message to avoid spewing a ton of messages during a
6935 single bad template instantiation. */
6936 if (complain & tf_error
6937 && (last_loc.line != input_line
6938 || last_loc.file != input_filename))
6940 if (TREE_CODE (type) == VOID_TYPE)
6941 error ("forming reference to void");
6943 error ("forming %s to reference type `%T'",
6944 (code == POINTER_TYPE) ? "pointer" : "reference",
6946 last_loc = input_location;
6949 return error_mark_node;
6951 else if (code == POINTER_TYPE)
6953 r = build_pointer_type (type);
6954 if (TREE_CODE (type) == METHOD_TYPE)
6955 r = build_ptrmemfunc_type (r);
6958 r = build_reference_type (type);
6959 r = cp_build_qualified_type_real (r, TYPE_QUALS (t), complain);
6961 if (r != error_mark_node)
6962 /* Will this ever be needed for TYPE_..._TO values? */
6969 r = tsubst (TYPE_OFFSET_BASETYPE (t), args, complain, in_decl);
6970 if (r == error_mark_node || !IS_AGGR_TYPE (r))
6974 Type deduction may fail for any of the following
6977 -- Attempting to create "pointer to member of T" when T
6978 is not a class type. */
6979 if (complain & tf_error)
6980 error ("creating pointer to member of non-class type `%T'", r);
6981 return error_mark_node;
6983 if (TREE_CODE (type) == REFERENCE_TYPE)
6985 if (complain & tf_error)
6986 error ("creating pointer to member reference type `%T'", type);
6988 return error_mark_node;
6990 my_friendly_assert (TREE_CODE (type) != METHOD_TYPE, 20011231);
6991 if (TREE_CODE (type) == FUNCTION_TYPE)
6993 /* This is really a method type. The cv qualifiers of the
6994 this pointer should _not_ be determined by the cv
6995 qualifiers of the class type. They should be held
6996 somewhere in the FUNCTION_TYPE, but we don't do that at
6997 the moment. Consider
6998 typedef void (Func) () const;
7000 template <typename T1> void Foo (Func T1::*);
7005 method_type = build_method_type_directly (TYPE_MAIN_VARIANT (r),
7007 TYPE_ARG_TYPES (type));
7008 return build_ptrmemfunc_type (build_pointer_type (method_type));
7011 return cp_build_qualified_type_real (build_ptrmem_type (r, type),
7021 fntype = tsubst_function_type (t, args, complain, in_decl);
7022 if (fntype == error_mark_node)
7023 return error_mark_node;
7025 /* Substitute the exception specification. */
7026 raises = TYPE_RAISES_EXCEPTIONS (t);
7029 tree list = NULL_TREE;
7031 if (! TREE_VALUE (raises))
7034 for (; raises != NULL_TREE; raises = TREE_CHAIN (raises))
7036 tree spec = TREE_VALUE (raises);
7038 spec = tsubst (spec, args, complain, in_decl);
7039 if (spec == error_mark_node)
7041 list = add_exception_specifier (list, spec, complain);
7043 fntype = build_exception_variant (fntype, list);
7049 tree domain = tsubst (TYPE_DOMAIN (t), args, complain, in_decl);
7050 if (domain == error_mark_node)
7051 return error_mark_node;
7053 /* As an optimization, we avoid regenerating the array type if
7054 it will obviously be the same as T. */
7055 if (type == TREE_TYPE (t) && domain == TYPE_DOMAIN (t))
7058 /* These checks should match the ones in grokdeclarator.
7062 The deduction may fail for any of the following reasons:
7064 -- Attempting to create an array with an element type that
7065 is void, a function type, or a reference type, or [DR337]
7066 an abstract class type. */
7067 if (TREE_CODE (type) == VOID_TYPE
7068 || TREE_CODE (type) == FUNCTION_TYPE
7069 || TREE_CODE (type) == REFERENCE_TYPE)
7071 if (complain & tf_error)
7072 error ("creating array of `%T'", type);
7073 return error_mark_node;
7075 if (CLASS_TYPE_P (type) && CLASSTYPE_PURE_VIRTUALS (type))
7077 if (complain & tf_error)
7078 error ("creating array of `%T', which is an abstract class type",
7080 return error_mark_node;
7083 r = build_cplus_array_type (type, domain);
7090 tree e1 = tsubst (TREE_OPERAND (t, 0), args, complain, in_decl);
7091 tree e2 = tsubst (TREE_OPERAND (t, 1), args, complain, in_decl);
7093 if (e1 == error_mark_node || e2 == error_mark_node)
7094 return error_mark_node;
7096 return fold (build (TREE_CODE (t), TREE_TYPE (t), e1, e2));
7102 tree e = tsubst (TREE_OPERAND (t, 0), args, complain, in_decl);
7103 if (e == error_mark_node)
7104 return error_mark_node;
7106 return fold (build (TREE_CODE (t), TREE_TYPE (t), e));
7111 tree ctx = tsubst_aggr_type (TYPE_CONTEXT (t), args, complain,
7112 in_decl, /*entering_scope=*/1);
7113 tree f = tsubst_copy (TYPENAME_TYPE_FULLNAME (t), args,
7116 if (ctx == error_mark_node || f == error_mark_node)
7117 return error_mark_node;
7119 if (!IS_AGGR_TYPE (ctx))
7121 if (complain & tf_error)
7122 error ("`%T' is not a class, struct, or union type",
7124 return error_mark_node;
7126 else if (!uses_template_parms (ctx) && !TYPE_BEING_DEFINED (ctx))
7128 /* Normally, make_typename_type does not require that the CTX
7129 have complete type in order to allow things like:
7131 template <class T> struct S { typename S<T>::X Y; };
7133 But, such constructs have already been resolved by this
7134 point, so here CTX really should have complete type, unless
7135 it's a partial instantiation. */
7136 ctx = complete_type (ctx);
7137 if (!COMPLETE_TYPE_P (ctx))
7139 if (complain & tf_error)
7140 cxx_incomplete_type_error (NULL_TREE, ctx);
7141 return error_mark_node;
7145 f = make_typename_type (ctx, f,
7146 (complain & tf_error) | tf_keep_type_decl);
7147 if (f == error_mark_node)
7149 if (TREE_CODE (f) == TYPE_DECL)
7151 complain |= tf_ignore_bad_quals;
7155 return cp_build_qualified_type_real
7156 (f, cp_type_quals (f) | cp_type_quals (t), complain);
7159 case UNBOUND_CLASS_TEMPLATE:
7161 tree ctx = tsubst_aggr_type (TYPE_CONTEXT (t), args, complain,
7162 in_decl, /*entering_scope=*/1);
7163 tree name = TYPE_IDENTIFIER (t);
7165 if (ctx == error_mark_node || name == error_mark_node)
7166 return error_mark_node;
7168 return make_unbound_class_template (ctx, name, complain);
7173 tree e = tsubst (TREE_OPERAND (t, 0), args, complain, in_decl);
7174 if (e == error_mark_node)
7175 return error_mark_node;
7176 return make_pointer_declarator (type, e);
7181 tree e = tsubst (TREE_OPERAND (t, 0), args, complain, in_decl);
7182 if (e == error_mark_node)
7183 return error_mark_node;
7184 return make_reference_declarator (type, e);
7189 tree e1 = tsubst (TREE_OPERAND (t, 0), args, complain, in_decl);
7190 tree e2 = tsubst_expr (TREE_OPERAND (t, 1), args, complain, in_decl);
7191 if (e1 == error_mark_node || e2 == error_mark_node)
7192 return error_mark_node;
7194 return build_nt (ARRAY_REF, e1, e2);
7199 tree e1 = tsubst (TREE_OPERAND (t, 0), args, complain, in_decl);
7200 tree e2 = (tsubst_call_declarator_parms
7201 (CALL_DECLARATOR_PARMS (t), args, complain, in_decl));
7202 tree e3 = tsubst (CALL_DECLARATOR_EXCEPTION_SPEC (t), args,
7205 if (e1 == error_mark_node || e2 == error_mark_node
7206 || e3 == error_mark_node)
7207 return error_mark_node;
7209 return make_call_declarator (e1, e2, CALL_DECLARATOR_QUALS (t), e3);
7214 tree e1 = tsubst (TREE_OPERAND (t, 0), args, complain, in_decl);
7215 tree e2 = tsubst (TREE_OPERAND (t, 1), args, complain, in_decl);
7216 if (e1 == error_mark_node || e2 == error_mark_node)
7217 return error_mark_node;
7219 return build_nt (TREE_CODE (t), e1, e2);
7226 type = finish_typeof (tsubst_expr (TYPEOF_TYPE_EXPR (t), args,
7227 complain, in_decl));
7228 return cp_build_qualified_type_real (type,
7230 | cp_type_quals (type),
7235 sorry ("use of `%s' in template",
7236 tree_code_name [(int) TREE_CODE (t)]);
7237 return error_mark_node;
7241 /* Like tsubst_expr for a BASELINK. OBJECT_TYPE, if non-NULL, is the
7242 type of the expression on the left-hand side of the "." or "->"
7246 tsubst_baselink (tree baselink, tree object_type,
7247 tree args, tsubst_flags_t complain, tree in_decl)
7250 tree qualifying_scope;
7252 tree template_args = 0;
7253 bool template_id_p = false;
7255 /* A baselink indicates a function from a base class. The
7256 BASELINK_ACCESS_BINFO and BASELINK_BINFO are going to have
7257 non-dependent types; otherwise, the lookup could not have
7258 succeeded. However, they may indicate bases of the template
7259 class, rather than the instantiated class.
7261 In addition, lookups that were not ambiguous before may be
7262 ambiguous now. Therefore, we perform the lookup again. */
7263 qualifying_scope = BINFO_TYPE (BASELINK_ACCESS_BINFO (baselink));
7264 fns = BASELINK_FUNCTIONS (baselink);
7265 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)
7267 template_id_p = true;
7268 template_args = TREE_OPERAND (fns, 1);
7269 fns = TREE_OPERAND (fns, 0);
7271 template_args = tsubst_template_args (template_args, args,
7274 name = DECL_NAME (get_first_fn (fns));
7275 baselink = lookup_fnfields (qualifying_scope, name, /*protect=*/1);
7276 if (BASELINK_P (baselink) && template_id_p)
7277 BASELINK_FUNCTIONS (baselink)
7278 = build_nt (TEMPLATE_ID_EXPR,
7279 BASELINK_FUNCTIONS (baselink),
7282 object_type = current_class_type;
7283 return adjust_result_of_qualified_name_lookup (baselink,
7288 /* Like tsubst_expr for a SCOPE_REF, given by QUALIFIED_ID. DONE is
7289 true if the qualified-id will be a postfix-expression in-and-of
7290 itself; false if more of the postfix-expression follows the
7291 QUALIFIED_ID. ADDRESS_P is true if the qualified-id is the operand
7295 tsubst_qualified_id (tree qualified_id, tree args,
7296 tsubst_flags_t complain, tree in_decl,
7297 bool done, bool address_p)
7305 my_friendly_assert (TREE_CODE (qualified_id) == SCOPE_REF, 20030706);
7307 /* Figure out what name to look up. */
7308 name = TREE_OPERAND (qualified_id, 1);
7309 if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
7312 template_args = TREE_OPERAND (name, 1);
7314 template_args = tsubst_template_args (template_args, args,
7316 name = TREE_OPERAND (name, 0);
7320 is_template = false;
7321 template_args = NULL_TREE;
7324 /* Substitute into the qualifying scope. When there are no ARGS, we
7325 are just trying to simplify a non-dependent expression. In that
7326 case the qualifying scope may be dependent, and, in any case,
7327 substituting will not help. */
7328 scope = TREE_OPERAND (qualified_id, 0);
7331 scope = tsubst (scope, args, complain, in_decl);
7332 expr = tsubst_copy (name, args, complain, in_decl);
7337 if (dependent_type_p (scope))
7338 return build_nt (SCOPE_REF, scope, expr);
7340 if (!BASELINK_P (name) && !DECL_P (expr))
7342 expr = lookup_qualified_name (scope, expr, /*is_type_p=*/0, false);
7343 if (TREE_CODE (TREE_CODE (expr) == TEMPLATE_DECL
7344 ? DECL_TEMPLATE_RESULT (expr) : expr) == TYPE_DECL)
7346 if (complain & tf_error)
7348 error ("dependent-name `%E' is parsed as a non-type, but "
7349 "instantiation yields a type", qualified_id);
7350 inform ("say `typename %E' if a type is meant", qualified_id);
7352 return error_mark_node;
7357 check_accessibility_of_qualified_id (expr, /*object_type=*/NULL_TREE,
7360 /* Remember that there was a reference to this entity. */
7365 expr = lookup_template_function (expr, template_args);
7367 if (expr == error_mark_node && complain & tf_error)
7368 qualified_name_lookup_error (scope, TREE_OPERAND (qualified_id, 1));
7369 else if (TYPE_P (scope))
7371 expr = (adjust_result_of_qualified_name_lookup
7372 (expr, scope, current_class_type));
7373 expr = finish_qualified_id_expr (scope, expr, done, address_p);
7379 /* Like tsubst, but deals with expressions. This function just replaces
7380 template parms; to finish processing the resultant expression, use
7384 tsubst_copy (tree t, tree args, tsubst_flags_t complain, tree in_decl)
7386 enum tree_code code;
7389 if (t == NULL_TREE || t == error_mark_node)
7392 code = TREE_CODE (t);
7397 r = retrieve_local_specialization (t);
7398 my_friendly_assert (r != NULL, 20020903);
7407 if (DECL_TEMPLATE_PARM_P (t))
7408 return tsubst_copy (DECL_INITIAL (t), args, complain, in_decl);
7409 /* There is no need to substitute into namespace-scope
7411 if (DECL_NAMESPACE_SCOPE_P (t))
7414 /* Unfortunately, we cannot just call lookup_name here.
7417 template <int I> int f() {
7419 struct S { void g() { E e = a; } };
7422 When we instantiate f<7>::S::g(), say, lookup_name is not
7423 clever enough to find f<7>::a. */
7425 = tsubst_aggr_type (TREE_TYPE (t), args, complain, in_decl,
7426 /*entering_scope=*/0);
7428 for (v = TYPE_VALUES (enum_type);
7431 if (TREE_PURPOSE (v) == DECL_NAME (t))
7432 return TREE_VALUE (v);
7434 /* We didn't find the name. That should never happen; if
7435 name-lookup found it during preliminary parsing, we
7436 should find it again here during instantiation. */
7442 if (DECL_CONTEXT (t))
7446 ctx = tsubst_aggr_type (DECL_CONTEXT (t), args, complain, in_decl,
7447 /*entering_scope=*/1);
7448 if (ctx != DECL_CONTEXT (t))
7449 return lookup_field (ctx, DECL_NAME (t), 0, false);
7455 if ((DECL_LANG_SPECIFIC (t) && DECL_TEMPLATE_INFO (t))
7456 || local_variable_p (t))
7457 t = tsubst (t, args, complain, in_decl);
7462 return tsubst_baselink (t, current_class_type, args, complain, in_decl);
7465 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t))
7466 return tsubst (TREE_TYPE (DECL_TEMPLATE_RESULT (t)),
7467 args, complain, in_decl);
7468 else if (is_member_template (t))
7469 return tsubst (t, args, complain, in_decl);
7470 else if (DECL_CLASS_SCOPE_P (t)
7471 && uses_template_parms (DECL_CONTEXT (t)))
7473 /* Template template argument like the following example need
7476 template <template <class> class TT> struct C {};
7477 template <class T> struct D {
7478 template <class U> struct E {};
7483 We are processing the template argument `E' in #1 for
7484 the template instantiation #2. Originally, `E' is a
7485 TEMPLATE_DECL with `D<T>' as its DECL_CONTEXT. Now we
7486 have to substitute this with one having context `D<int>'. */
7488 tree context = tsubst (DECL_CONTEXT (t), args, complain, in_decl);
7489 return lookup_field (context, DECL_NAME(t), 0, false);
7492 /* Ordinary template template argument. */
7496 case REINTERPRET_CAST_EXPR:
7497 case CONST_CAST_EXPR:
7498 case STATIC_CAST_EXPR:
7499 case DYNAMIC_CAST_EXPR:
7502 (code, tsubst (TREE_TYPE (t), args, complain, in_decl),
7503 tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl));
7507 case TRUTH_NOT_EXPR:
7510 case CONVERT_EXPR: /* Unary + */
7519 (code, tsubst (TREE_TYPE (t), args, complain, in_decl),
7520 tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl));
7527 object = tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl);
7528 name = TREE_OPERAND (t, 1);
7529 if (TREE_CODE (name) == BIT_NOT_EXPR)
7531 name = tsubst_copy (TREE_OPERAND (name, 0), args,
7533 name = build1 (BIT_NOT_EXPR, NULL_TREE, name);
7535 else if (TREE_CODE (name) == SCOPE_REF
7536 && TREE_CODE (TREE_OPERAND (name, 1)) == BIT_NOT_EXPR)
7538 tree base = tsubst_copy (TREE_OPERAND (name, 0), args,
7540 name = TREE_OPERAND (name, 1);
7541 name = tsubst_copy (TREE_OPERAND (name, 0), args,
7543 name = build1 (BIT_NOT_EXPR, NULL_TREE, name);
7544 name = build_nt (SCOPE_REF, base, name);
7546 else if (TREE_CODE (name) == BASELINK)
7547 name = tsubst_baselink (name,
7548 non_reference (TREE_TYPE (object)),
7552 name = tsubst_copy (name, args, complain, in_decl);
7553 return build_nt (COMPONENT_REF, object, name);
7559 case TRUNC_DIV_EXPR:
7561 case FLOOR_DIV_EXPR:
7562 case ROUND_DIV_EXPR:
7563 case EXACT_DIV_EXPR:
7567 case TRUNC_MOD_EXPR:
7568 case FLOOR_MOD_EXPR:
7569 case TRUTH_ANDIF_EXPR:
7570 case TRUTH_ORIF_EXPR:
7571 case TRUTH_AND_EXPR:
7590 case PREDECREMENT_EXPR:
7591 case PREINCREMENT_EXPR:
7592 case POSTDECREMENT_EXPR:
7593 case POSTINCREMENT_EXPR:
7595 (code, tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl),
7596 tsubst_copy (TREE_OPERAND (t, 1), args, complain, in_decl));
7599 return build_nt (code,
7600 tsubst_copy (TREE_OPERAND (t, 0), args,
7602 tsubst_copy (TREE_OPERAND (t, 1), args, complain,
7607 /* This processing should really occur in tsubst_expr. However,
7608 tsubst_expr does not recurse into expressions, since it
7609 assumes that there aren't any statements inside them. So, we
7610 need to expand the STMT_EXPR here. */
7611 if (!processing_template_decl)
7613 tree stmt_expr = begin_stmt_expr ();
7615 tsubst_expr (STMT_EXPR_STMT (t), args,
7616 complain | tf_stmt_expr_cmpd, in_decl);
7617 return finish_stmt_expr (stmt_expr, false);
7624 case PSEUDO_DTOR_EXPR:
7627 (code, tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl),
7628 tsubst_copy (TREE_OPERAND (t, 1), args, complain, in_decl),
7629 tsubst_copy (TREE_OPERAND (t, 2), args, complain, in_decl));
7636 (code, tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl),
7637 tsubst_copy (TREE_OPERAND (t, 1), args, complain, in_decl),
7638 tsubst_copy (TREE_OPERAND (t, 2), args, complain, in_decl));
7639 NEW_EXPR_USE_GLOBAL (r) = NEW_EXPR_USE_GLOBAL (t);
7646 (code, tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl),
7647 tsubst_copy (TREE_OPERAND (t, 1), args, complain, in_decl));
7648 DELETE_EXPR_USE_GLOBAL (r) = DELETE_EXPR_USE_GLOBAL (t);
7649 DELETE_EXPR_USE_VEC (r) = DELETE_EXPR_USE_VEC (t);
7653 case TEMPLATE_ID_EXPR:
7655 /* Substituted template arguments */
7656 tree fn = TREE_OPERAND (t, 0);
7657 tree targs = TREE_OPERAND (t, 1);
7659 fn = tsubst_copy (fn, args, complain, in_decl);
7661 targs = tsubst_template_args (targs, args, complain, in_decl);
7663 return lookup_template_function (fn, targs);
7668 tree purpose, value, chain;
7670 if (t == void_list_node)
7673 purpose = TREE_PURPOSE (t);
7675 purpose = tsubst_copy (purpose, args, complain, in_decl);
7676 value = TREE_VALUE (t);
7678 value = tsubst_copy (value, args, complain, in_decl);
7679 chain = TREE_CHAIN (t);
7680 if (chain && chain != void_type_node)
7681 chain = tsubst_copy (chain, args, complain, in_decl);
7682 if (purpose == TREE_PURPOSE (t)
7683 && value == TREE_VALUE (t)
7684 && chain == TREE_CHAIN (t))
7686 return tree_cons (purpose, value, chain);
7693 case TEMPLATE_TYPE_PARM:
7694 case TEMPLATE_TEMPLATE_PARM:
7695 case BOUND_TEMPLATE_TEMPLATE_PARM:
7696 case TEMPLATE_PARM_INDEX:
7698 case REFERENCE_TYPE:
7704 case UNBOUND_CLASS_TEMPLATE:
7707 return tsubst (t, args, complain, in_decl);
7709 case IDENTIFIER_NODE:
7710 if (IDENTIFIER_TYPENAME_P (t))
7712 tree new_type = tsubst (TREE_TYPE (t), args, complain, in_decl);
7713 return mangle_conv_op_name_for_type (new_type);
7720 r = build_constructor
7721 (tsubst (TREE_TYPE (t), args, complain, in_decl),
7722 tsubst_copy (CONSTRUCTOR_ELTS (t), args, complain, in_decl));
7723 TREE_HAS_CONSTRUCTOR (r) = TREE_HAS_CONSTRUCTOR (t);
7728 return build_x_va_arg (tsubst_copy (TREE_OPERAND (t, 0), args, complain,
7730 tsubst (TREE_TYPE (t), args, complain, in_decl));
7737 /* Like tsubst_copy for expressions, etc. but also does semantic
7741 tsubst_expr (tree t, tree args, tsubst_flags_t complain, tree in_decl)
7744 tsubst_flags_t stmt_expr
7745 = complain & (tf_stmt_expr_cmpd | tf_stmt_expr_body);
7747 complain ^= stmt_expr;
7748 if (t == NULL_TREE || t == error_mark_node)
7751 if (!STATEMENT_CODE_P (TREE_CODE (t)))
7752 return tsubst_copy_and_build (t, args, complain, in_decl,
7753 /*function_p=*/false);
7755 switch (TREE_CODE (t))
7757 case CTOR_INITIALIZER:
7759 finish_mem_initializers (tsubst_initializer_list
7760 (TREE_OPERAND (t, 0), args));
7765 finish_return_stmt (tsubst_expr (RETURN_STMT_EXPR (t),
7766 args, complain, in_decl));
7775 r = tsubst_expr (EXPR_STMT_EXPR (t), args, complain, in_decl);
7776 if (stmt_expr & tf_stmt_expr_body && !TREE_CHAIN (t))
7777 finish_stmt_expr_expr (r);
7779 finish_expr_stmt (r);
7785 do_using_directive (tsubst_expr (USING_STMT_NAMESPACE (t),
7786 args, complain, in_decl));
7795 decl = DECL_STMT_DECL (t);
7796 if (TREE_CODE (decl) == LABEL_DECL)
7797 finish_label_decl (DECL_NAME (decl));
7798 else if (TREE_CODE (decl) == USING_DECL)
7800 tree scope = DECL_INITIAL (decl);
7801 tree name = DECL_NAME (decl);
7804 scope = tsubst_expr (scope, args, complain, in_decl);
7805 decl = lookup_qualified_name (scope, name,
7806 /*is_type_p=*/false,
7807 /*complain=*/false);
7808 if (decl == error_mark_node)
7809 qualified_name_lookup_error (scope, name);
7811 do_local_using_decl (decl, scope, name);
7815 init = DECL_INITIAL (decl);
7816 decl = tsubst (decl, args, complain, in_decl);
7817 if (decl != error_mark_node)
7820 DECL_INITIAL (decl) = error_mark_node;
7821 /* By marking the declaration as instantiated, we avoid
7822 trying to instantiate it. Since instantiate_decl can't
7823 handle local variables, and since we've already done
7824 all that needs to be done, that's the right thing to
7826 if (TREE_CODE (decl) == VAR_DECL)
7827 DECL_TEMPLATE_INSTANTIATED (decl) = 1;
7828 if (TREE_CODE (decl) == VAR_DECL
7829 && ANON_AGGR_TYPE_P (TREE_TYPE (decl)))
7830 /* Anonymous aggregates are a special case. */
7831 finish_anon_union (decl);
7834 maybe_push_decl (decl);
7835 if (TREE_CODE (decl) == VAR_DECL
7836 && DECL_PRETTY_FUNCTION_P (decl))
7838 /* For __PRETTY_FUNCTION__ we have to adjust the
7840 const char *const name
7841 = cxx_printable_name (current_function_decl, 2);
7842 init = cp_fname_init (name, &TREE_TYPE (decl));
7845 init = tsubst_expr (init, args, complain, in_decl);
7846 cp_finish_decl (decl, init, NULL_TREE, 0);
7851 /* A DECL_STMT can also be used as an expression, in the condition
7852 clause of an if/for/while construct. If we aren't followed by
7853 another statement, return our decl. */
7854 if (TREE_CHAIN (t) == NULL_TREE)
7863 stmt = begin_for_stmt ();
7864 tsubst_expr (FOR_INIT_STMT (t), args, complain, in_decl);
7865 finish_for_init_stmt (stmt);
7866 finish_for_cond (tsubst_expr (FOR_COND (t),
7867 args, complain, in_decl),
7869 tmp = tsubst_expr (FOR_EXPR (t), args, complain, in_decl);
7870 finish_for_expr (tmp, stmt);
7871 tsubst_expr (FOR_BODY (t), args, complain, in_decl);
7872 finish_for_stmt (stmt);
7879 stmt = begin_while_stmt ();
7880 finish_while_stmt_cond (tsubst_expr (WHILE_COND (t),
7881 args, complain, in_decl),
7883 tsubst_expr (WHILE_BODY (t), args, complain, in_decl);
7884 finish_while_stmt (stmt);
7891 stmt = begin_do_stmt ();
7892 tsubst_expr (DO_BODY (t), args, complain, in_decl);
7893 finish_do_body (stmt);
7894 finish_do_stmt (tsubst_expr (DO_COND (t),
7895 args, complain, in_decl),
7903 stmt = begin_if_stmt ();
7904 finish_if_stmt_cond (tsubst_expr (IF_COND (t),
7905 args, complain, in_decl),
7908 if (tmp = THEN_CLAUSE (t), tmp)
7910 tsubst_expr (tmp, args, complain, in_decl);
7911 finish_then_clause (stmt);
7914 if (tmp = ELSE_CLAUSE (t), tmp)
7916 begin_else_clause ();
7917 tsubst_expr (tmp, args, complain, in_decl);
7918 finish_else_clause (stmt);
7928 if (COMPOUND_STMT_BODY_BLOCK (t))
7929 stmt = begin_function_body ();
7931 stmt = begin_compound_stmt (COMPOUND_STMT_NO_SCOPE (t));
7933 tsubst_expr (COMPOUND_BODY (t), args,
7934 complain | ((stmt_expr & tf_stmt_expr_cmpd) << 1),
7937 if (COMPOUND_STMT_BODY_BLOCK (t))
7938 finish_function_body (stmt);
7940 finish_compound_stmt (stmt);
7946 finish_break_stmt ();
7951 finish_continue_stmt ();
7959 stmt = begin_switch_stmt ();
7960 val = tsubst_expr (SWITCH_COND (t), args, complain, in_decl);
7961 finish_switch_cond (val, stmt);
7962 tsubst_expr (SWITCH_BODY (t), args, complain, in_decl);
7963 finish_switch_stmt (stmt);
7969 finish_case_label (tsubst_expr (CASE_LOW (t), args, complain, in_decl),
7970 tsubst_expr (CASE_HIGH (t), args, complain,
7975 input_line = STMT_LINENO (t);
7976 finish_label_stmt (DECL_NAME (LABEL_STMT_LABEL (t)));
7980 input_filename = FILE_STMT_FILENAME (t);
7981 add_stmt (build_nt (FILE_STMT, FILE_STMT_FILENAME_NODE (t)));
7986 tmp = GOTO_DESTINATION (t);
7987 if (TREE_CODE (tmp) != LABEL_DECL)
7988 /* Computed goto's must be tsubst'd into. On the other hand,
7989 non-computed gotos must not be; the identifier in question
7990 will have no binding. */
7991 tmp = tsubst_expr (tmp, args, complain, in_decl);
7993 tmp = DECL_NAME (tmp);
7994 finish_goto_stmt (tmp);
7999 tmp = finish_asm_stmt
8001 tsubst_expr (ASM_STRING (t), args, complain, in_decl),
8002 tsubst_expr (ASM_OUTPUTS (t), args, complain, in_decl),
8003 tsubst_expr (ASM_INPUTS (t), args, complain, in_decl),
8004 tsubst_expr (ASM_CLOBBERS (t), args, complain, in_decl));
8005 ASM_INPUT_P (tmp) = ASM_INPUT_P (t);
8012 stmt = begin_try_block ();
8013 tsubst_expr (TRY_STMTS (t), args, complain, in_decl);
8014 finish_cleanup_try_block (stmt);
8015 finish_cleanup (tsubst_expr (TRY_HANDLERS (t), args,
8021 if (FN_TRY_BLOCK_P (t))
8022 stmt = begin_function_try_block ();
8024 stmt = begin_try_block ();
8026 tsubst_expr (TRY_STMTS (t), args, complain, in_decl);
8028 if (FN_TRY_BLOCK_P (t))
8029 finish_function_try_block (stmt);
8031 finish_try_block (stmt);
8033 tsubst_expr (TRY_HANDLERS (t), args, complain, in_decl);
8034 if (FN_TRY_BLOCK_P (t))
8035 finish_function_handler_sequence (stmt);
8037 finish_handler_sequence (stmt);
8046 stmt = begin_handler ();
8047 if (HANDLER_PARMS (t))
8049 decl = DECL_STMT_DECL (HANDLER_PARMS (t));
8050 decl = tsubst (decl, args, complain, in_decl);
8051 /* Prevent instantiate_decl from trying to instantiate
8052 this variable. We've already done all that needs to be
8054 DECL_TEMPLATE_INSTANTIATED (decl) = 1;
8058 finish_handler_parms (decl, stmt);
8059 tsubst_expr (HANDLER_BODY (t), args, complain, in_decl);
8060 finish_handler (stmt);
8066 tsubst (TREE_TYPE (t), args, complain, NULL_TREE);
8073 return tsubst_expr (TREE_CHAIN (t), args, complain | stmt_expr, in_decl);
8076 /* T is a postfix-expression that is not being used in a function
8077 call. Return the substituted version of T. */
8080 tsubst_non_call_postfix_expression (tree t, tree args,
8081 tsubst_flags_t complain,
8084 if (TREE_CODE (t) == SCOPE_REF)
8085 t = tsubst_qualified_id (t, args, complain, in_decl,
8086 /*done=*/false, /*address_p=*/false);
8088 t = tsubst_copy_and_build (t, args, complain, in_decl,
8089 /*function_p=*/false);
8094 /* Like tsubst but deals with expressions and performs semantic
8095 analysis. FUNCTION_P is true if T is the "F" in "F (ARGS)". */
8098 tsubst_copy_and_build (tree t,
8100 tsubst_flags_t complain,
8104 #define RECUR(NODE) \
8105 tsubst_copy_and_build (NODE, args, complain, in_decl, /*function_p=*/false)
8109 if (t == NULL_TREE || t == error_mark_node)
8112 switch (TREE_CODE (t))
8117 case IDENTIFIER_NODE:
8121 tree qualifying_class;
8122 bool non_integral_constant_expression_p;
8123 const char *error_msg;
8125 if (IDENTIFIER_TYPENAME_P (t))
8127 tree new_type = tsubst (TREE_TYPE (t), args, complain, in_decl);
8128 t = mangle_conv_op_name_for_type (new_type);
8131 /* Look up the name. */
8132 decl = lookup_name (t, 0);
8134 /* By convention, expressions use ERROR_MARK_NODE to indicate
8135 failure, not NULL_TREE. */
8136 if (decl == NULL_TREE)
8137 decl = error_mark_node;
8139 decl = finish_id_expression (t, decl, NULL_TREE,
8142 /*integral_constant_expression_p=*/false,
8143 /*allow_non_integral_constant_expression_p=*/false,
8144 &non_integral_constant_expression_p,
8148 if (!function_p && TREE_CODE (decl) == IDENTIFIER_NODE)
8149 decl = unqualified_name_lookup_error (decl);
8153 case TEMPLATE_ID_EXPR:
8156 tree template = RECUR (TREE_OPERAND (t, 0));
8157 tree targs = TREE_OPERAND (t, 1);
8160 targs = tsubst_template_args (targs, args, complain, in_decl);
8162 if (TREE_CODE (template) == COMPONENT_REF)
8164 object = TREE_OPERAND (template, 0);
8165 template = TREE_OPERAND (template, 1);
8169 template = lookup_template_function (template, targs);
8172 return build (COMPONENT_REF, TREE_TYPE (template),
8179 return build_x_indirect_ref (RECUR (TREE_OPERAND (t, 0)), "unary *");
8183 (tsubst (TREE_TYPE (t), args, complain, in_decl),
8184 RECUR (TREE_OPERAND (t, 0)));
8187 return build_functional_cast
8188 (tsubst (TREE_TYPE (t), args, complain, in_decl),
8189 RECUR (TREE_OPERAND (t, 0)));
8191 case REINTERPRET_CAST_EXPR:
8192 return build_reinterpret_cast
8193 (tsubst (TREE_TYPE (t), args, complain, in_decl),
8194 RECUR (TREE_OPERAND (t, 0)));
8196 case CONST_CAST_EXPR:
8197 return build_const_cast
8198 (tsubst (TREE_TYPE (t), args, complain, in_decl),
8199 RECUR (TREE_OPERAND (t, 0)));
8201 case DYNAMIC_CAST_EXPR:
8202 return build_dynamic_cast
8203 (tsubst (TREE_TYPE (t), args, complain, in_decl),
8204 RECUR (TREE_OPERAND (t, 0)));
8206 case STATIC_CAST_EXPR:
8207 return build_static_cast
8208 (tsubst (TREE_TYPE (t), args, complain, in_decl),
8209 RECUR (TREE_OPERAND (t, 0)));
8211 case POSTDECREMENT_EXPR:
8212 case POSTINCREMENT_EXPR:
8213 op1 = tsubst_non_call_postfix_expression (TREE_OPERAND (t, 0),
8214 args, complain, in_decl);
8215 return build_x_unary_op (TREE_CODE (t), op1);
8217 case PREDECREMENT_EXPR:
8218 case PREINCREMENT_EXPR:
8222 case TRUTH_NOT_EXPR:
8223 case CONVERT_EXPR: /* Unary + */
8226 return build_x_unary_op (TREE_CODE (t), RECUR (TREE_OPERAND (t, 0)));
8229 op1 = TREE_OPERAND (t, 0);
8230 if (TREE_CODE (op1) == SCOPE_REF)
8231 op1 = tsubst_qualified_id (op1, args, complain, in_decl,
8232 /*done=*/true, /*address_p=*/true);
8234 op1 = tsubst_non_call_postfix_expression (op1, args, complain,
8236 if (TREE_CODE (op1) == LABEL_DECL)
8237 return finish_label_address_expr (DECL_NAME (op1));
8238 return build_x_unary_op (ADDR_EXPR, op1);
8243 case TRUNC_DIV_EXPR:
8245 case FLOOR_DIV_EXPR:
8246 case ROUND_DIV_EXPR:
8247 case EXACT_DIV_EXPR:
8251 case TRUNC_MOD_EXPR:
8252 case FLOOR_MOD_EXPR:
8253 case TRUTH_ANDIF_EXPR:
8254 case TRUTH_ORIF_EXPR:
8255 case TRUTH_AND_EXPR:
8271 return build_x_binary_op
8273 RECUR (TREE_OPERAND (t, 0)),
8274 RECUR (TREE_OPERAND (t, 1)),
8275 /*overloaded_p=*/NULL);
8278 return tsubst_qualified_id (t, args, complain, in_decl, /*done=*/true,
8279 /*address_p=*/false);
8282 if (tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl)
8285 return build_nt (ARRAY_REF, NULL_TREE, RECUR (TREE_OPERAND (t, 1)));
8287 op1 = tsubst_non_call_postfix_expression (TREE_OPERAND (t, 0),
8288 args, complain, in_decl);
8289 /* Remember that there was a reference to this entity. */
8292 return grok_array_decl (op1, RECUR (TREE_OPERAND (t, 1)));
8296 op1 = TREE_OPERAND (t, 0);
8299 /* When there are no ARGS, we are trying to evaluate a
8300 non-dependent expression from the parser. Trying to do
8301 the substitutions may not work. */
8303 op1 = TREE_TYPE (op1);
8312 return cxx_sizeof_or_alignof_type (op1, TREE_CODE (t), true);
8314 return cxx_sizeof_or_alignof_expr (op1, TREE_CODE (t));
8317 return build_x_modify_expr
8318 (RECUR (TREE_OPERAND (t, 0)),
8319 TREE_CODE (TREE_OPERAND (t, 1)),
8320 RECUR (TREE_OPERAND (t, 2)));
8323 op1 = tsubst_non_call_postfix_expression (TREE_OPERAND (t, 0),
8324 args, complain, in_decl);
8325 /* Remember that there was a reference to this entity. */
8328 return build_x_arrow (op1);
8332 (RECUR (TREE_OPERAND (t, 0)),
8333 RECUR (TREE_OPERAND (t, 1)),
8334 RECUR (TREE_OPERAND (t, 2)),
8335 NEW_EXPR_USE_GLOBAL (t));
8338 return delete_sanity
8339 (RECUR (TREE_OPERAND (t, 0)),
8340 RECUR (TREE_OPERAND (t, 1)),
8341 DELETE_EXPR_USE_VEC (t),
8342 DELETE_EXPR_USE_GLOBAL (t));
8345 return build_x_compound_expr (RECUR (TREE_OPERAND (t, 0)),
8346 RECUR (TREE_OPERAND (t, 1)));
8355 function = TREE_OPERAND (t, 0);
8356 /* When we parsed the expression, we determined whether or
8357 not Koenig lookup should be performed. */
8358 koenig_p = KOENIG_LOOKUP_P (t);
8359 if (TREE_CODE (function) == SCOPE_REF)
8362 function = tsubst_qualified_id (function, args, complain, in_decl,
8364 /*address_p=*/false);
8368 qualified_p = (TREE_CODE (function) == COMPONENT_REF
8369 && (TREE_CODE (TREE_OPERAND (function, 1))
8371 function = tsubst_copy_and_build (function, args, complain,
8374 if (BASELINK_P (function))
8378 call_args = RECUR (TREE_OPERAND (t, 1));
8380 /* We do not perform argument-dependent lookup if normal
8381 lookup finds a non-function, in accordance with the
8382 expected resolution of DR 218. */
8384 && (is_overloaded_fn (function)
8385 || TREE_CODE (function) == IDENTIFIER_NODE))
8386 function = perform_koenig_lookup (function, call_args);
8388 if (TREE_CODE (function) == IDENTIFIER_NODE)
8390 unqualified_name_lookup_error (function);
8391 return error_mark_node;
8394 /* Remember that there was a reference to this entity. */
8395 if (DECL_P (function))
8396 mark_used (function);
8398 function = convert_from_reference (function);
8400 if (TREE_CODE (function) == OFFSET_REF)
8401 return build_offset_ref_call_from_tree (function, call_args);
8402 if (TREE_CODE (function) == COMPONENT_REF)
8404 if (!BASELINK_P (TREE_OPERAND (function, 1)))
8405 return finish_call_expr (function, call_args,
8406 /*disallow_virtual=*/false,
8407 /*koenig_p=*/false);
8409 return (build_new_method_call
8410 (TREE_OPERAND (function, 0),
8411 TREE_OPERAND (function, 1),
8412 call_args, NULL_TREE,
8413 qualified_p ? LOOKUP_NONVIRTUAL : LOOKUP_NORMAL));
8415 return finish_call_expr (function, call_args,
8416 /*disallow_virtual=*/qualified_p,
8421 return build_x_conditional_expr
8422 (RECUR (TREE_OPERAND (t, 0)),
8423 RECUR (TREE_OPERAND (t, 1)),
8424 RECUR (TREE_OPERAND (t, 2)));
8426 case PSEUDO_DTOR_EXPR:
8427 return finish_pseudo_destructor_expr
8428 (RECUR (TREE_OPERAND (t, 0)),
8429 RECUR (TREE_OPERAND (t, 1)),
8430 RECUR (TREE_OPERAND (t, 2)));
8434 tree purpose, value, chain;
8436 if (t == void_list_node)
8439 purpose = TREE_PURPOSE (t);
8441 purpose = RECUR (purpose);
8442 value = TREE_VALUE (t);
8444 value = RECUR (value);
8445 chain = TREE_CHAIN (t);
8446 if (chain && chain != void_type_node)
8447 chain = RECUR (chain);
8448 if (purpose == TREE_PURPOSE (t)
8449 && value == TREE_VALUE (t)
8450 && chain == TREE_CHAIN (t))
8452 return tree_cons (purpose, value, chain);
8460 object = tsubst_non_call_postfix_expression (TREE_OPERAND (t, 0),
8461 args, complain, in_decl);
8462 /* Remember that there was a reference to this entity. */
8463 if (DECL_P (object))
8466 member = TREE_OPERAND (t, 1);
8467 if (BASELINK_P (member))
8468 member = tsubst_baselink (member,
8469 non_reference (TREE_TYPE (object)),
8470 args, complain, in_decl);
8472 member = tsubst_copy (member, args, complain, in_decl);
8474 if (!CLASS_TYPE_P (TREE_TYPE (object)))
8476 if (TREE_CODE (member) == BIT_NOT_EXPR)
8477 return finish_pseudo_destructor_expr (object,
8479 TREE_TYPE (object));
8480 else if (TREE_CODE (member) == SCOPE_REF
8481 && (TREE_CODE (TREE_OPERAND (member, 1)) == BIT_NOT_EXPR))
8482 return finish_pseudo_destructor_expr (object,
8484 TREE_TYPE (object));
8486 else if (TREE_CODE (member) == SCOPE_REF
8487 && TREE_CODE (TREE_OPERAND (member, 1)) == TEMPLATE_ID_EXPR)
8492 /* Lookup the template functions now that we know what the
8494 tmpl = TREE_OPERAND (TREE_OPERAND (member, 1), 0);
8495 args = TREE_OPERAND (TREE_OPERAND (member, 1), 1);
8496 member = lookup_qualified_name (TREE_OPERAND (member, 0), tmpl,
8497 /*is_type_p=*/false,
8498 /*complain=*/false);
8499 if (BASELINK_P (member))
8500 BASELINK_FUNCTIONS (member)
8501 = build_nt (TEMPLATE_ID_EXPR, BASELINK_FUNCTIONS (member),
8505 qualified_name_lookup_error (TREE_TYPE (object), tmpl);
8506 return error_mark_node;
8509 else if (TREE_CODE (member) == FIELD_DECL)
8510 return finish_non_static_data_member (member, object, NULL_TREE);
8512 return finish_class_member_access_expr (object, member);
8517 (RECUR (TREE_OPERAND (t, 0)));
8523 tree type = tsubst (TREE_TYPE (t), args, complain, in_decl);
8526 /* digest_init will do the wrong thing if we let it. */
8527 if (type && TYPE_PTRMEMFUNC_P (type))
8531 /* We do not want to process the purpose of aggregate
8532 initializers as they are identifier nodes which will be
8533 looked up by digest_init. */
8534 purpose_p = !(type && IS_AGGR_TYPE (type));
8535 for (elts = CONSTRUCTOR_ELTS (t);
8537 elts = TREE_CHAIN (elts))
8539 tree purpose = TREE_PURPOSE (elts);
8540 tree value = TREE_VALUE (elts);
8542 if (purpose && purpose_p)
8543 purpose = RECUR (purpose);
8544 value = RECUR (value);
8545 r = tree_cons (purpose, value, r);
8548 r = build_constructor (NULL_TREE, nreverse (r));
8549 TREE_HAS_CONSTRUCTOR (r) = TREE_HAS_CONSTRUCTOR (t);
8552 return digest_init (type, r, 0);
8558 tree operand_0 = RECUR (TREE_OPERAND (t, 0));
8559 if (TYPE_P (operand_0))
8560 return get_typeid (operand_0);
8561 return build_typeid (operand_0);
8565 return convert_from_reference (tsubst_copy (t, args, complain, in_decl));
8569 t = tsubst_copy (t, args, complain, in_decl);
8570 return convert_from_reference (t);
8573 return build_x_va_arg (RECUR (TREE_OPERAND (t, 0)),
8574 tsubst_copy (TREE_TYPE (t), args, complain,
8578 return tsubst_copy (t, args, complain, in_decl);
8584 /* Verify that the instantiated ARGS are valid. For type arguments,
8585 make sure that the type's linkage is ok. For non-type arguments,
8586 make sure they are constants if they are integral or enumerations.
8587 Emit an error under control of COMPLAIN, and return TRUE on error. */
8590 check_instantiated_args (tree tmpl, tree args, tsubst_flags_t complain)
8592 int ix, len = DECL_NTPARMS (tmpl);
8593 bool result = false;
8595 for (ix = 0; ix != len; ix++)
8597 tree t = TREE_VEC_ELT (args, ix);
8601 /* [basic.link]: A name with no linkage (notably, the name
8602 of a class or enumeration declared in a local scope)
8603 shall not be used to declare an entity with linkage.
8604 This implies that names with no linkage cannot be used as
8605 template arguments. */
8606 tree nt = no_linkage_check (t);
8610 if (!(complain & tf_error))
8612 else if (TYPE_ANONYMOUS_P (nt))
8613 error ("`%T' uses anonymous type", t);
8615 error ("`%T' uses local type `%T'", t, nt);
8618 /* In order to avoid all sorts of complications, we do not
8619 allow variably-modified types as template arguments. */
8620 else if (variably_modified_type_p (t))
8622 if (complain & tf_error)
8623 error ("`%T' is a variably modified type", t);
8627 /* A non-type argument of integral or enumerated type must be a
8629 else if (TREE_TYPE (t)
8630 && INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (t))
8631 && !TREE_CONSTANT (t))
8633 if (complain & tf_error)
8634 error ("integral expression `%E' is not constant", t);
8638 if (result && complain & tf_error)
8639 error (" trying to instantiate `%D'", tmpl);
8643 /* Instantiate the indicated variable or function template TMPL with
8644 the template arguments in TARG_PTR. */
8647 instantiate_template (tree tmpl, tree targ_ptr, tsubst_flags_t complain)
8653 if (tmpl == error_mark_node)
8654 return error_mark_node;
8656 my_friendly_assert (TREE_CODE (tmpl) == TEMPLATE_DECL, 283);
8658 /* If this function is a clone, handle it specially. */
8659 if (DECL_CLONED_FUNCTION_P (tmpl))
8661 tree spec = instantiate_template (DECL_CLONED_FUNCTION (tmpl), targ_ptr,
8665 /* Look for the clone. */
8666 for (clone = TREE_CHAIN (spec);
8667 clone && DECL_CLONED_FUNCTION_P (clone);
8668 clone = TREE_CHAIN (clone))
8669 if (DECL_NAME (clone) == DECL_NAME (tmpl))
8671 /* We should always have found the clone by now. */
8676 /* Check to see if we already have this specialization. */
8677 spec = retrieve_specialization (tmpl, targ_ptr);
8678 if (spec != NULL_TREE)
8681 gen_tmpl = most_general_template (tmpl);
8682 if (tmpl != gen_tmpl)
8684 /* The TMPL is a partial instantiation. To get a full set of
8685 arguments we must add the arguments used to perform the
8686 partial instantiation. */
8687 targ_ptr = add_outermost_template_args (DECL_TI_ARGS (tmpl),
8690 /* Check to see if we already have this specialization. */
8691 spec = retrieve_specialization (gen_tmpl, targ_ptr);
8692 if (spec != NULL_TREE)
8696 if (check_instantiated_args (gen_tmpl, INNERMOST_TEMPLATE_ARGS (targ_ptr),
8698 return error_mark_node;
8700 /* We are building a FUNCTION_DECL, during which the access of its
8701 parameters and return types have to be checked. However this
8702 FUNCTION_DECL which is the desired context for access checking
8703 is not built yet. We solve this chicken-and-egg problem by
8704 deferring all checks until we have the FUNCTION_DECL. */
8705 push_deferring_access_checks (dk_deferred);
8707 /* Substitute template parameters. */
8708 fndecl = tsubst (DECL_TEMPLATE_RESULT (gen_tmpl),
8709 targ_ptr, complain, gen_tmpl);
8711 /* Now we know the specialization, compute access previously
8713 push_access_scope (fndecl);
8714 perform_deferred_access_checks ();
8715 pop_access_scope (fndecl);
8716 pop_deferring_access_checks ();
8718 /* The DECL_TI_TEMPLATE should always be the immediate parent
8719 template, not the most general template. */
8720 DECL_TI_TEMPLATE (fndecl) = tmpl;
8722 /* If we've just instantiated the main entry point for a function,
8723 instantiate all the alternate entry points as well. We do this
8724 by cloning the instantiation of the main entry point, not by
8725 instantiating the template clones. */
8726 if (TREE_CHAIN (gen_tmpl) && DECL_CLONED_FUNCTION_P (TREE_CHAIN (gen_tmpl)))
8727 clone_function_decl (fndecl, /*update_method_vec_p=*/0);
8732 /* The FN is a TEMPLATE_DECL for a function. The ARGS are the
8733 arguments that are being used when calling it. TARGS is a vector
8734 into which the deduced template arguments are placed.
8736 Return zero for success, 2 for an incomplete match that doesn't resolve
8737 all the types, and 1 for complete failure. An error message will be
8738 printed only for an incomplete match.
8740 If FN is a conversion operator, or we are trying to produce a specific
8741 specialization, RETURN_TYPE is the return type desired.
8743 The EXPLICIT_TARGS are explicit template arguments provided via a
8746 The parameter STRICT is one of:
8749 We are deducing arguments for a function call, as in
8753 We are deducing arguments for a conversion function, as in
8757 We are deducing arguments when doing an explicit instantiation
8758 as in [temp.explicit], when determining an explicit specialization
8759 as in [temp.expl.spec], or when taking the address of a function
8760 template, as in [temp.deduct.funcaddr].
8763 We are deducing arguments when calculating the partial
8764 ordering between specializations of function or class
8765 templates, as in [temp.func.order] and [temp.class.order].
8767 LEN is the number of parms to consider before returning success, or -1
8768 for all. This is used in partial ordering to avoid comparing parms for
8769 which no actual argument was passed, since they are not considered in
8770 overload resolution (and are explicitly excluded from consideration in
8771 partial ordering in [temp.func.order]/6). */
8774 fn_type_unification (tree fn,
8775 tree explicit_targs,
8779 unification_kind_t strict,
8786 my_friendly_assert (TREE_CODE (fn) == TEMPLATE_DECL, 0);
8788 fntype = TREE_TYPE (fn);
8793 The specified template arguments must match the template
8794 parameters in kind (i.e., type, nontype, template), and there
8795 must not be more arguments than there are parameters;
8796 otherwise type deduction fails.
8798 Nontype arguments must match the types of the corresponding
8799 nontype template parameters, or must be convertible to the
8800 types of the corresponding nontype parameters as specified in
8801 _temp.arg.nontype_, otherwise type deduction fails.
8803 All references in the function type of the function template
8804 to the corresponding template parameters are replaced by the
8805 specified template argument values. If a substitution in a
8806 template parameter or in the function type of the function
8807 template results in an invalid type, type deduction fails. */
8809 tree converted_args;
8813 = (coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn),
8814 explicit_targs, NULL_TREE, tf_none,
8815 /*require_all_arguments=*/0));
8816 if (converted_args == error_mark_node)
8819 /* Substitute the explicit args into the function type. This is
8820 necessary so that, for instance, explicitly declared function
8821 arguments can match null pointed constants. If we were given
8822 an incomplete set of explicit args, we must not do semantic
8823 processing during substitution as we could create partial
8825 incomplete = NUM_TMPL_ARGS (explicit_targs) != NUM_TMPL_ARGS (targs);
8826 processing_template_decl += incomplete;
8827 fntype = tsubst (fntype, converted_args, tf_none, NULL_TREE);
8828 processing_template_decl -= incomplete;
8830 if (fntype == error_mark_node)
8833 /* Place the explicitly specified arguments in TARGS. */
8834 for (i = NUM_TMPL_ARGS (converted_args); i--;)
8835 TREE_VEC_ELT (targs, i) = TREE_VEC_ELT (converted_args, i);
8838 parms = TYPE_ARG_TYPES (fntype);
8839 /* Never do unification on the 'this' parameter. */
8840 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn))
8841 parms = TREE_CHAIN (parms);
8845 /* We've been given a return type to match, prepend it. */
8846 parms = tree_cons (NULL_TREE, TREE_TYPE (fntype), parms);
8847 args = tree_cons (NULL_TREE, return_type, args);
8852 /* We allow incomplete unification without an error message here
8853 because the standard doesn't seem to explicitly prohibit it. Our
8854 callers must be ready to deal with unification failures in any
8856 result = type_unification_real (DECL_INNERMOST_TEMPLATE_PARMS (fn),
8857 targs, parms, args, /*subr=*/0,
8858 strict, /*allow_incomplete*/1, len);
8861 /* All is well so far. Now, check:
8865 When all template arguments have been deduced, all uses of
8866 template parameters in nondeduced contexts are replaced with
8867 the corresponding deduced argument values. If the
8868 substitution results in an invalid type, as described above,
8869 type deduction fails. */
8870 if (tsubst (TREE_TYPE (fn), targs, tf_none, NULL_TREE)
8877 /* Adjust types before performing type deduction, as described in
8878 [temp.deduct.call] and [temp.deduct.conv]. The rules in these two
8879 sections are symmetric. PARM is the type of a function parameter
8880 or the return type of the conversion function. ARG is the type of
8881 the argument passed to the call, or the type of the value
8882 initialized with the result of the conversion function. */
8885 maybe_adjust_types_for_deduction (unification_kind_t strict,
8898 /* Swap PARM and ARG throughout the remainder of this
8899 function; the handling is precisely symmetric since PARM
8900 will initialize ARG rather than vice versa. */
8908 /* There is nothing to do in this case. */
8912 /* DR 214. [temp.func.order] is underspecified, and leads to no
8913 ordering between things like `T *' and `T const &' for `U *'.
8914 The former has T=U and the latter T=U*. The former looks more
8915 specialized and John Spicer considers it well-formed (the EDG
8916 compiler accepts it).
8918 John also confirms that deduction should proceed as in a function
8919 call. Which implies the usual ARG and PARM conversions as DEDUCE_CALL.
8920 However, in ordering, ARG can have REFERENCE_TYPE, but no argument
8921 to an actual call can have such a type.
8923 If both ARG and PARM are REFERENCE_TYPE, we change neither.
8924 If only ARG is a REFERENCE_TYPE, we look through that and then
8925 proceed as with DEDUCE_CALL (which could further convert it). */
8926 if (TREE_CODE (*arg) == REFERENCE_TYPE)
8928 if (TREE_CODE (*parm) == REFERENCE_TYPE)
8930 *arg = TREE_TYPE (*arg);
8937 if (TREE_CODE (*parm) != REFERENCE_TYPE)
8939 /* [temp.deduct.call]
8941 If P is not a reference type:
8943 --If A is an array type, the pointer type produced by the
8944 array-to-pointer standard conversion (_conv.array_) is
8945 used in place of A for type deduction; otherwise,
8947 --If A is a function type, the pointer type produced by
8948 the function-to-pointer standard conversion
8949 (_conv.func_) is used in place of A for type deduction;
8952 --If A is a cv-qualified type, the top level
8953 cv-qualifiers of A's type are ignored for type
8955 if (TREE_CODE (*arg) == ARRAY_TYPE)
8956 *arg = build_pointer_type (TREE_TYPE (*arg));
8957 else if (TREE_CODE (*arg) == FUNCTION_TYPE)
8958 *arg = build_pointer_type (*arg);
8960 *arg = TYPE_MAIN_VARIANT (*arg);
8963 /* [temp.deduct.call]
8965 If P is a cv-qualified type, the top level cv-qualifiers
8966 of P's type are ignored for type deduction. If P is a
8967 reference type, the type referred to by P is used for
8969 *parm = TYPE_MAIN_VARIANT (*parm);
8970 if (TREE_CODE (*parm) == REFERENCE_TYPE)
8972 *parm = TREE_TYPE (*parm);
8973 result |= UNIFY_ALLOW_OUTER_MORE_CV_QUAL;
8976 /* DR 322. For conversion deduction, remove a reference type on parm
8977 too (which has been swapped into ARG). */
8978 if (strict == DEDUCE_CONV && TREE_CODE (*arg) == REFERENCE_TYPE)
8979 *arg = TREE_TYPE (*arg);
8984 /* Most parms like fn_type_unification.
8986 If SUBR is 1, we're being called recursively (to unify the
8987 arguments of a function or method parameter of a function
8991 type_unification_real (tree tparms,
8996 unification_kind_t strict,
8997 int allow_incomplete,
9002 int ntparms = TREE_VEC_LENGTH (tparms);
9004 int saw_undeduced = 0;
9008 my_friendly_assert (TREE_CODE (tparms) == TREE_VEC, 289);
9009 my_friendly_assert (xparms == NULL_TREE
9010 || TREE_CODE (xparms) == TREE_LIST, 290);
9011 my_friendly_assert (!xargs || TREE_CODE (xargs) == TREE_LIST, 291);
9012 my_friendly_assert (ntparms > 0, 292);
9017 sub_strict = (UNIFY_ALLOW_OUTER_LEVEL | UNIFY_ALLOW_MORE_CV_QUAL
9018 | UNIFY_ALLOW_DERIVED);
9022 sub_strict = UNIFY_ALLOW_LESS_CV_QUAL;
9026 sub_strict = UNIFY_ALLOW_NONE;
9030 sub_strict = UNIFY_ALLOW_NONE;
9046 && parms != void_list_node
9048 && args != void_list_node)
9050 parm = TREE_VALUE (parms);
9051 parms = TREE_CHAIN (parms);
9052 arg = TREE_VALUE (args);
9053 args = TREE_CHAIN (args);
9055 if (arg == error_mark_node)
9057 if (arg == unknown_type_node)
9058 /* We can't deduce anything from this, but we might get all the
9059 template args from other function args. */
9062 /* Conversions will be performed on a function argument that
9063 corresponds with a function parameter that contains only
9064 non-deducible template parameters and explicitly specified
9065 template parameters. */
9066 if (!uses_template_parms (parm))
9071 type = TREE_TYPE (arg);
9075 if (strict == DEDUCE_EXACT || strict == DEDUCE_ORDER)
9077 if (same_type_p (parm, type))
9081 /* It might work; we shouldn't check now, because we might
9082 get into infinite recursion. Overload resolution will
9091 my_friendly_assert (TREE_TYPE (arg) != NULL_TREE, 293);
9092 if (type_unknown_p (arg))
9094 /* [temp.deduct.type] A template-argument can be deduced from
9095 a pointer to function or pointer to member function
9096 argument if the set of overloaded functions does not
9097 contain function templates and at most one of a set of
9098 overloaded functions provides a unique match. */
9100 if (resolve_overloaded_unification
9101 (tparms, targs, parm, arg, strict, sub_strict)
9106 arg = TREE_TYPE (arg);
9107 if (arg == error_mark_node)
9112 int arg_strict = sub_strict;
9115 arg_strict |= maybe_adjust_types_for_deduction (strict, &parm, &arg);
9117 if (unify (tparms, targs, parm, arg, arg_strict))
9121 /* Are we done with the interesting parms? */
9125 /* Fail if we've reached the end of the parm list, and more args
9126 are present, and the parm list isn't variadic. */
9127 if (args && args != void_list_node && parms == void_list_node)
9129 /* Fail if parms are left and they don't have default values. */
9131 && parms != void_list_node
9132 && TREE_PURPOSE (parms) == NULL_TREE)
9137 for (i = 0; i < ntparms; i++)
9138 if (TREE_VEC_ELT (targs, i) == NULL_TREE)
9140 tree tparm = TREE_VALUE (TREE_VEC_ELT (tparms, i));
9142 /* If this is an undeduced nontype parameter that depends on
9143 a type parameter, try another pass; its type may have been
9144 deduced from a later argument than the one from which
9145 this parameter can be deduced. */
9146 if (TREE_CODE (tparm) == PARM_DECL
9147 && uses_template_parms (TREE_TYPE (tparm))
9148 && !saw_undeduced++)
9151 if (!allow_incomplete)
9152 error ("incomplete type unification");
9158 /* Subroutine of type_unification_real. Args are like the variables at the
9159 call site. ARG is an overloaded function (or template-id); we try
9160 deducing template args from each of the overloads, and if only one
9161 succeeds, we go with that. Modifies TARGS and returns 0 on success. */
9164 resolve_overloaded_unification (tree tparms,
9168 unification_kind_t strict,
9171 tree tempargs = copy_node (targs);
9175 if (TREE_CODE (arg) == ADDR_EXPR)
9177 arg = TREE_OPERAND (arg, 0);
9183 if (TREE_CODE (arg) == COMPONENT_REF)
9184 /* Handle `&x' where `x' is some static or non-static member
9186 arg = TREE_OPERAND (arg, 1);
9188 if (TREE_CODE (arg) == OFFSET_REF)
9189 arg = TREE_OPERAND (arg, 1);
9191 /* Strip baselink information. */
9192 if (BASELINK_P (arg))
9193 arg = BASELINK_FUNCTIONS (arg);
9195 if (TREE_CODE (arg) == TEMPLATE_ID_EXPR)
9197 /* If we got some explicit template args, we need to plug them into
9198 the affected templates before we try to unify, in case the
9199 explicit args will completely resolve the templates in question. */
9201 tree expl_subargs = TREE_OPERAND (arg, 1);
9202 arg = TREE_OPERAND (arg, 0);
9204 for (; arg; arg = OVL_NEXT (arg))
9206 tree fn = OVL_CURRENT (arg);
9209 if (TREE_CODE (fn) != TEMPLATE_DECL)
9212 subargs = get_bindings_overload (fn, DECL_TEMPLATE_RESULT (fn),
9216 elem = tsubst (TREE_TYPE (fn), subargs, tf_none, NULL_TREE);
9217 good += try_one_overload (tparms, targs, tempargs, parm,
9218 elem, strict, sub_strict, addr_p);
9222 else if (TREE_CODE (arg) == OVERLOAD
9223 || TREE_CODE (arg) == FUNCTION_DECL)
9225 for (; arg; arg = OVL_NEXT (arg))
9226 good += try_one_overload (tparms, targs, tempargs, parm,
9227 TREE_TYPE (OVL_CURRENT (arg)),
9228 strict, sub_strict, addr_p);
9233 /* [temp.deduct.type] A template-argument can be deduced from a pointer
9234 to function or pointer to member function argument if the set of
9235 overloaded functions does not contain function templates and at most
9236 one of a set of overloaded functions provides a unique match.
9238 So if we found multiple possibilities, we return success but don't
9243 int i = TREE_VEC_LENGTH (targs);
9245 if (TREE_VEC_ELT (tempargs, i))
9246 TREE_VEC_ELT (targs, i) = TREE_VEC_ELT (tempargs, i);
9254 /* Subroutine of resolve_overloaded_unification; does deduction for a single
9255 overload. Fills TARGS with any deduced arguments, or error_mark_node if
9256 different overloads deduce different arguments for a given parm.
9257 ADDR_P is true if the expression for which deduction is being
9258 performed was of the form "& fn" rather than simply "fn".
9260 Returns 1 on success. */
9263 try_one_overload (tree tparms,
9268 unification_kind_t strict,
9276 /* [temp.deduct.type] A template-argument can be deduced from a pointer
9277 to function or pointer to member function argument if the set of
9278 overloaded functions does not contain function templates and at most
9279 one of a set of overloaded functions provides a unique match.
9281 So if this is a template, just return success. */
9283 if (uses_template_parms (arg))
9286 if (TREE_CODE (arg) == METHOD_TYPE)
9287 arg = build_ptrmemfunc_type (build_pointer_type (arg));
9289 arg = build_pointer_type (arg);
9291 sub_strict |= maybe_adjust_types_for_deduction (strict, &parm, &arg);
9293 /* We don't copy orig_targs for this because if we have already deduced
9294 some template args from previous args, unify would complain when we
9295 try to deduce a template parameter for the same argument, even though
9296 there isn't really a conflict. */
9297 nargs = TREE_VEC_LENGTH (targs);
9298 tempargs = make_tree_vec (nargs);
9300 if (unify (tparms, tempargs, parm, arg, sub_strict) != 0)
9303 /* First make sure we didn't deduce anything that conflicts with
9304 explicitly specified args. */
9305 for (i = nargs; i--; )
9307 tree elt = TREE_VEC_ELT (tempargs, i);
9308 tree oldelt = TREE_VEC_ELT (orig_targs, i);
9310 if (elt == NULL_TREE)
9312 else if (uses_template_parms (elt))
9314 /* Since we're unifying against ourselves, we will fill in template
9315 args used in the function parm list with our own template parms.
9317 TREE_VEC_ELT (tempargs, i) = NULL_TREE;
9320 else if (oldelt && ! template_args_equal (oldelt, elt))
9324 for (i = nargs; i--; )
9326 tree elt = TREE_VEC_ELT (tempargs, i);
9329 TREE_VEC_ELT (targs, i) = elt;
9335 /* Verify that nondeduce template argument agrees with the type
9336 obtained from argument deduction. Return nonzero if the
9341 struct A { typedef int X; };
9342 template <class T, class U> struct C {};
9343 template <class T> struct C<T, typename T::X> {};
9345 Then with the instantiation `C<A, int>', we can deduce that
9346 `T' is `A' but unify () does not check whether `typename T::X'
9347 is `int'. This function ensure that they agree.
9349 TARGS, PARMS are the same as the arguments of unify.
9350 ARGS contains template arguments from all levels. */
9353 verify_class_unification (tree targs, tree parms, tree args)
9355 parms = tsubst (parms, add_outermost_template_args (args, targs),
9356 tf_none, NULL_TREE);
9357 if (parms == error_mark_node)
9360 return !comp_template_args (parms, INNERMOST_TEMPLATE_ARGS (args));
9363 /* PARM is a template class (perhaps with unbound template
9364 parameters). ARG is a fully instantiated type. If ARG can be
9365 bound to PARM, return ARG, otherwise return NULL_TREE. TPARMS and
9366 TARGS are as for unify. */
9369 try_class_unification (tree tparms, tree targs, tree parm, tree arg)
9373 if (!CLASSTYPE_TEMPLATE_INFO (arg)
9374 || (most_general_template (CLASSTYPE_TI_TEMPLATE (arg))
9375 != most_general_template (CLASSTYPE_TI_TEMPLATE (parm))))
9378 /* We need to make a new template argument vector for the call to
9379 unify. If we used TARGS, we'd clutter it up with the result of
9380 the attempted unification, even if this class didn't work out.
9381 We also don't want to commit ourselves to all the unifications
9382 we've already done, since unification is supposed to be done on
9383 an argument-by-argument basis. In other words, consider the
9384 following pathological case:
9386 template <int I, int J, int K>
9389 template <int I, int J>
9390 struct S<I, J, 2> : public S<I, I, I>, S<J, J, J> {};
9392 template <int I, int J, int K>
9393 void f(S<I, J, K>, S<I, I, I>);
9402 Now, by the time we consider the unification involving `s2', we
9403 already know that we must have `f<0, 0, 0>'. But, even though
9404 `S<0, 1, 2>' is derived from `S<0, 0, 0>', the code is invalid
9405 because there are two ways to unify base classes of S<0, 1, 2>
9406 with S<I, I, I>. If we kept the already deduced knowledge, we
9407 would reject the possibility I=1. */
9408 copy_of_targs = make_tree_vec (TREE_VEC_LENGTH (targs));
9410 /* If unification failed, we're done. */
9411 if (unify (tparms, copy_of_targs, CLASSTYPE_TI_ARGS (parm),
9412 CLASSTYPE_TI_ARGS (arg), UNIFY_ALLOW_NONE))
9418 /* Subroutine of get_template_base. RVAL, if non-NULL, is a base we
9419 have already discovered to be satisfactory. ARG_BINFO is the binfo
9420 for the base class of ARG that we are currently examining. */
9423 get_template_base_recursive (tree tparms,
9432 tree arg = BINFO_TYPE (arg_binfo);
9434 if (!(flags & GTB_IGNORE_TYPE))
9436 tree r = try_class_unification (tparms, targs,
9439 /* If there is more than one satisfactory baseclass, then:
9443 If they yield more than one possible deduced A, the type
9447 if (r && rval && !same_type_p (r, rval))
9448 return error_mark_node;
9453 binfos = BINFO_BASETYPES (arg_binfo);
9454 n_baselinks = binfos ? TREE_VEC_LENGTH (binfos) : 0;
9456 /* Process base types. */
9457 for (i = 0; i < n_baselinks; i++)
9459 tree base_binfo = TREE_VEC_ELT (binfos, i);
9462 /* Skip this base, if we've already seen it. */
9463 if (BINFO_MARKED (base_binfo))
9467 (flags & GTB_VIA_VIRTUAL) || TREE_VIA_VIRTUAL (base_binfo);
9469 /* When searching for a non-virtual, we cannot mark virtually
9472 BINFO_MARKED (base_binfo) = 1;
9474 rval = get_template_base_recursive (tparms, targs,
9478 GTB_VIA_VIRTUAL * this_virtual);
9480 /* If we discovered more than one matching base class, we can
9482 if (rval == error_mark_node)
9483 return error_mark_node;
9489 /* Given a template type PARM and a class type ARG, find the unique
9490 base type in ARG that is an instance of PARM. We do not examine
9491 ARG itself; only its base-classes. If there is no appropriate base
9492 class, return NULL_TREE. If there is more than one, return
9493 error_mark_node. PARM may be the type of a partial specialization,
9494 as well as a plain template type. Used by unify. */
9497 get_template_base (tree tparms, tree targs, tree parm, tree arg)
9502 my_friendly_assert (IS_AGGR_TYPE_CODE (TREE_CODE (arg)), 92);
9504 arg_binfo = TYPE_BINFO (complete_type (arg));
9505 rval = get_template_base_recursive (tparms, targs,
9510 /* Since get_template_base_recursive marks the bases classes, we
9511 must unmark them here. */
9512 dfs_walk (arg_binfo, dfs_unmark, markedp, 0);
9517 /* Returns the level of DECL, which declares a template parameter. */
9520 template_decl_level (tree decl)
9522 switch (TREE_CODE (decl))
9526 return TEMPLATE_TYPE_LEVEL (TREE_TYPE (decl));
9529 return TEMPLATE_PARM_LEVEL (DECL_INITIAL (decl));
9537 /* Decide whether ARG can be unified with PARM, considering only the
9538 cv-qualifiers of each type, given STRICT as documented for unify.
9539 Returns nonzero iff the unification is OK on that basis.*/
9542 check_cv_quals_for_unify (int strict, tree arg, tree parm)
9544 int arg_quals = cp_type_quals (arg);
9545 int parm_quals = cp_type_quals (parm);
9547 if (TREE_CODE (parm) == TEMPLATE_TYPE_PARM)
9549 /* If the cvr quals of parm will not unify with ARG, they'll be
9550 ignored in instantiation, so we have to do the same here. */
9551 if (TREE_CODE (arg) == REFERENCE_TYPE)
9552 parm_quals &= ~(TYPE_QUAL_CONST | TYPE_QUAL_VOLATILE);
9553 if (!POINTER_TYPE_P (arg) &&
9554 TREE_CODE (arg) != TEMPLATE_TYPE_PARM)
9555 parm_quals &= ~TYPE_QUAL_RESTRICT;
9558 if (!(strict & (UNIFY_ALLOW_MORE_CV_QUAL | UNIFY_ALLOW_OUTER_MORE_CV_QUAL))
9559 && (arg_quals & parm_quals) != parm_quals)
9562 if (!(strict & (UNIFY_ALLOW_LESS_CV_QUAL | UNIFY_ALLOW_OUTER_LESS_CV_QUAL))
9563 && (parm_quals & arg_quals) != arg_quals)
9569 /* Takes parameters as for type_unification. Returns 0 if the
9570 type deduction succeeds, 1 otherwise. The parameter STRICT is a
9571 bitwise or of the following flags:
9574 Require an exact match between PARM and ARG.
9575 UNIFY_ALLOW_MORE_CV_QUAL:
9576 Allow the deduced ARG to be more cv-qualified (by qualification
9577 conversion) than ARG.
9578 UNIFY_ALLOW_LESS_CV_QUAL:
9579 Allow the deduced ARG to be less cv-qualified than ARG.
9580 UNIFY_ALLOW_DERIVED:
9581 Allow the deduced ARG to be a template base class of ARG,
9582 or a pointer to a template base class of the type pointed to by
9584 UNIFY_ALLOW_INTEGER:
9585 Allow any integral type to be deduced. See the TEMPLATE_PARM_INDEX
9586 case for more information.
9587 UNIFY_ALLOW_OUTER_LEVEL:
9588 This is the outermost level of a deduction. Used to determine validity
9589 of qualification conversions. A valid qualification conversion must
9590 have const qualified pointers leading up to the inner type which
9591 requires additional CV quals, except at the outer level, where const
9592 is not required [conv.qual]. It would be normal to set this flag in
9593 addition to setting UNIFY_ALLOW_MORE_CV_QUAL.
9594 UNIFY_ALLOW_OUTER_MORE_CV_QUAL:
9595 This is the outermost level of a deduction, and PARM can be more CV
9596 qualified at this point.
9597 UNIFY_ALLOW_OUTER_LESS_CV_QUAL:
9598 This is the outermost level of a deduction, and PARM can be less CV
9599 qualified at this point.
9600 UNIFY_ALLOW_MAX_CORRECTION:
9601 This is an INTEGER_TYPE's maximum value. Used if the range may
9602 have been derived from a size specification, such as an array size.
9603 If the size was given by a nontype template parameter N, the maximum
9604 value will have the form N-1. The flag says that we can (and indeed
9605 must) unify N with (ARG + 1), an exception to the normal rules on
9609 unify (tree tparms, tree targs, tree parm, tree arg, int strict)
9614 int strict_in = strict;
9616 /* I don't think this will do the right thing with respect to types.
9617 But the only case I've seen it in so far has been array bounds, where
9618 signedness is the only information lost, and I think that will be
9620 while (TREE_CODE (parm) == NOP_EXPR)
9621 parm = TREE_OPERAND (parm, 0);
9623 if (arg == error_mark_node)
9625 if (arg == unknown_type_node)
9626 /* We can't deduce anything from this, but we might get all the
9627 template args from other function args. */
9630 /* If PARM uses template parameters, then we can't bail out here,
9631 even if ARG == PARM, since we won't record unifications for the
9632 template parameters. We might need them if we're trying to
9633 figure out which of two things is more specialized. */
9634 if (arg == parm && !uses_template_parms (parm))
9637 /* Immediately reject some pairs that won't unify because of
9638 cv-qualification mismatches. */
9639 if (TREE_CODE (arg) == TREE_CODE (parm)
9641 /* It is the elements of the array which hold the cv quals of an array
9642 type, and the elements might be template type parms. We'll check
9644 && TREE_CODE (arg) != ARRAY_TYPE
9645 /* We check the cv-qualifiers when unifying with template type
9646 parameters below. We want to allow ARG `const T' to unify with
9647 PARM `T' for example, when computing which of two templates
9648 is more specialized, for example. */
9649 && TREE_CODE (arg) != TEMPLATE_TYPE_PARM
9650 && !check_cv_quals_for_unify (strict_in, arg, parm))
9653 if (!(strict & UNIFY_ALLOW_OUTER_LEVEL)
9654 && TYPE_P (parm) && !CP_TYPE_CONST_P (parm))
9655 strict &= ~UNIFY_ALLOW_MORE_CV_QUAL;
9656 strict &= ~UNIFY_ALLOW_OUTER_LEVEL;
9657 strict &= ~UNIFY_ALLOW_DERIVED;
9658 strict &= ~UNIFY_ALLOW_OUTER_MORE_CV_QUAL;
9659 strict &= ~UNIFY_ALLOW_OUTER_LESS_CV_QUAL;
9660 strict &= ~UNIFY_ALLOW_MAX_CORRECTION;
9662 switch (TREE_CODE (parm))
9666 case UNBOUND_CLASS_TEMPLATE:
9667 /* In a type which contains a nested-name-specifier, template
9668 argument values cannot be deduced for template parameters used
9669 within the nested-name-specifier. */
9672 case TEMPLATE_TYPE_PARM:
9673 case TEMPLATE_TEMPLATE_PARM:
9674 case BOUND_TEMPLATE_TEMPLATE_PARM:
9675 tparm = TREE_VALUE (TREE_VEC_ELT (tparms, 0));
9677 if (TEMPLATE_TYPE_LEVEL (parm)
9678 != template_decl_level (tparm))
9679 /* The PARM is not one we're trying to unify. Just check
9680 to see if it matches ARG. */
9681 return (TREE_CODE (arg) == TREE_CODE (parm)
9682 && same_type_p (parm, arg)) ? 0 : 1;
9683 idx = TEMPLATE_TYPE_IDX (parm);
9684 targ = TREE_VEC_ELT (targs, idx);
9685 tparm = TREE_VALUE (TREE_VEC_ELT (tparms, idx));
9687 /* Check for mixed types and values. */
9688 if ((TREE_CODE (parm) == TEMPLATE_TYPE_PARM
9689 && TREE_CODE (tparm) != TYPE_DECL)
9690 || (TREE_CODE (parm) == TEMPLATE_TEMPLATE_PARM
9691 && TREE_CODE (tparm) != TEMPLATE_DECL))
9694 if (TREE_CODE (parm) == BOUND_TEMPLATE_TEMPLATE_PARM)
9696 /* ARG must be constructed from a template class or a template
9697 template parameter. */
9698 if (TREE_CODE (arg) != BOUND_TEMPLATE_TEMPLATE_PARM
9699 && (TREE_CODE (arg) != RECORD_TYPE || !CLASSTYPE_TEMPLATE_INFO (arg)))
9703 tree parmtmpl = TYPE_TI_TEMPLATE (parm);
9704 tree parmvec = TYPE_TI_ARGS (parm);
9705 tree argvec = TYPE_TI_ARGS (arg);
9707 = DECL_INNERMOST_TEMPLATE_PARMS (TYPE_TI_TEMPLATE (arg));
9710 /* The parameter and argument roles have to be switched here
9711 in order to handle default arguments properly. For example,
9712 template<template <class> class TT> void f(TT<int>)
9713 should be able to accept vector<int> which comes from
9714 template <class T, class Allocator = allocator>
9717 if (coerce_template_parms (argtmplvec, parmvec, parmtmpl, 0, 1)
9721 /* Deduce arguments T, i from TT<T> or TT<i>.
9722 We check each element of PARMVEC and ARGVEC individually
9723 rather than the whole TREE_VEC since they can have
9724 different number of elements. */
9726 for (i = 0; i < TREE_VEC_LENGTH (parmvec); ++i)
9728 tree t = TREE_VEC_ELT (parmvec, i);
9730 if (unify (tparms, targs, t,
9731 TREE_VEC_ELT (argvec, i),
9736 arg = TYPE_TI_TEMPLATE (arg);
9738 /* Fall through to deduce template name. */
9741 if (TREE_CODE (parm) == TEMPLATE_TEMPLATE_PARM
9742 || TREE_CODE (parm) == BOUND_TEMPLATE_TEMPLATE_PARM)
9744 /* Deduce template name TT from TT, TT<>, TT<T> and TT<i>. */
9746 /* Simple cases: Value already set, does match or doesn't. */
9747 if (targ != NULL_TREE && template_args_equal (targ, arg))
9754 /* If PARM is `const T' and ARG is only `int', we don't have
9755 a match unless we are allowing additional qualification.
9756 If ARG is `const int' and PARM is just `T' that's OK;
9757 that binds `const int' to `T'. */
9758 if (!check_cv_quals_for_unify (strict_in | UNIFY_ALLOW_LESS_CV_QUAL,
9762 /* Consider the case where ARG is `const volatile int' and
9763 PARM is `const T'. Then, T should be `volatile int'. */
9764 arg = cp_build_qualified_type_real
9765 (arg, cp_type_quals (arg) & ~cp_type_quals (parm), tf_none);
9766 if (arg == error_mark_node)
9769 /* Simple cases: Value already set, does match or doesn't. */
9770 if (targ != NULL_TREE && same_type_p (targ, arg))
9775 /* Make sure that ARG is not a variable-sized array. (Note
9776 that were talking about variable-sized arrays (like
9777 `int[n]'), rather than arrays of unknown size (like
9778 `int[]').) We'll get very confused by such a type since
9779 the bound of the array will not be computable in an
9780 instantiation. Besides, such types are not allowed in
9781 ISO C++, so we can do as we please here. */
9782 if (variably_modified_type_p (arg))
9786 TREE_VEC_ELT (targs, idx) = arg;
9789 case TEMPLATE_PARM_INDEX:
9790 tparm = TREE_VALUE (TREE_VEC_ELT (tparms, 0));
9792 if (TEMPLATE_PARM_LEVEL (parm)
9793 != template_decl_level (tparm))
9794 /* The PARM is not one we're trying to unify. Just check
9795 to see if it matches ARG. */
9796 return !(TREE_CODE (arg) == TREE_CODE (parm)
9797 && cp_tree_equal (parm, arg));
9799 idx = TEMPLATE_PARM_IDX (parm);
9800 targ = TREE_VEC_ELT (targs, idx);
9803 return !cp_tree_equal (targ, arg);
9805 /* [temp.deduct.type] If, in the declaration of a function template
9806 with a non-type template-parameter, the non-type
9807 template-parameter is used in an expression in the function
9808 parameter-list and, if the corresponding template-argument is
9809 deduced, the template-argument type shall match the type of the
9810 template-parameter exactly, except that a template-argument
9811 deduced from an array bound may be of any integral type.
9812 The non-type parameter might use already deduced type parameters. */
9813 tparm = tsubst (TREE_TYPE (parm), targs, 0, NULL_TREE);
9814 if (!TREE_TYPE (arg))
9815 /* Template-parameter dependent expression. Just accept it for now.
9816 It will later be processed in convert_template_argument. */
9818 else if (same_type_p (TREE_TYPE (arg), tparm))
9820 else if ((strict & UNIFY_ALLOW_INTEGER)
9821 && (TREE_CODE (tparm) == INTEGER_TYPE
9822 || TREE_CODE (tparm) == BOOLEAN_TYPE))
9824 else if (uses_template_parms (tparm))
9825 /* We haven't deduced the type of this parameter yet. Try again
9831 TREE_VEC_ELT (targs, idx) = arg;
9836 /* A pointer-to-member constant can be unified only with
9837 another constant. */
9838 if (TREE_CODE (arg) != PTRMEM_CST)
9841 /* Just unify the class member. It would be useless (and possibly
9842 wrong, depending on the strict flags) to unify also
9843 PTRMEM_CST_CLASS, because we want to be sure that both parm and
9844 arg refer to the same variable, even if through different
9845 classes. For instance:
9847 struct A { int x; };
9850 Unification of &A::x and &B::x must succeed. */
9851 return unify (tparms, targs, PTRMEM_CST_MEMBER (parm),
9852 PTRMEM_CST_MEMBER (arg), strict);
9857 if (TREE_CODE (arg) != POINTER_TYPE)
9860 /* [temp.deduct.call]
9862 A can be another pointer or pointer to member type that can
9863 be converted to the deduced A via a qualification
9864 conversion (_conv.qual_).
9866 We pass down STRICT here rather than UNIFY_ALLOW_NONE.
9867 This will allow for additional cv-qualification of the
9868 pointed-to types if appropriate. */
9870 if (TREE_CODE (TREE_TYPE (arg)) == RECORD_TYPE)
9871 /* The derived-to-base conversion only persists through one
9872 level of pointers. */
9873 strict |= (strict_in & UNIFY_ALLOW_DERIVED);
9875 return unify (tparms, targs, TREE_TYPE (parm),
9876 TREE_TYPE (arg), strict);
9879 case REFERENCE_TYPE:
9880 if (TREE_CODE (arg) != REFERENCE_TYPE)
9882 return unify (tparms, targs, TREE_TYPE (parm), TREE_TYPE (arg),
9883 strict & UNIFY_ALLOW_MORE_CV_QUAL);
9886 if (TREE_CODE (arg) != ARRAY_TYPE)
9888 if ((TYPE_DOMAIN (parm) == NULL_TREE)
9889 != (TYPE_DOMAIN (arg) == NULL_TREE))
9891 if (TYPE_DOMAIN (parm) != NULL_TREE
9892 && unify (tparms, targs, TYPE_DOMAIN (parm),
9893 TYPE_DOMAIN (arg), UNIFY_ALLOW_NONE) != 0)
9895 return unify (tparms, targs, TREE_TYPE (parm), TREE_TYPE (arg),
9896 strict & UNIFY_ALLOW_MORE_CV_QUAL);
9904 if (TREE_CODE (arg) != TREE_CODE (parm))
9907 if (TREE_CODE (parm) == INTEGER_TYPE
9908 && TREE_CODE (TYPE_MAX_VALUE (parm)) != INTEGER_CST)
9910 if (TYPE_MIN_VALUE (parm) && TYPE_MIN_VALUE (arg)
9911 && unify (tparms, targs, TYPE_MIN_VALUE (parm),
9912 TYPE_MIN_VALUE (arg), UNIFY_ALLOW_INTEGER))
9914 if (TYPE_MAX_VALUE (parm) && TYPE_MAX_VALUE (arg)
9915 && unify (tparms, targs, TYPE_MAX_VALUE (parm),
9916 TYPE_MAX_VALUE (arg),
9917 UNIFY_ALLOW_INTEGER | UNIFY_ALLOW_MAX_CORRECTION))
9920 /* We have already checked cv-qualification at the top of the
9922 else if (!same_type_ignoring_top_level_qualifiers_p (arg, parm))
9925 /* As far as unification is concerned, this wins. Later checks
9926 will invalidate it if necessary. */
9929 /* Types INTEGER_CST and MINUS_EXPR can come from array bounds. */
9930 /* Type INTEGER_CST can come from ordinary constant template args. */
9932 while (TREE_CODE (arg) == NOP_EXPR)
9933 arg = TREE_OPERAND (arg, 0);
9935 if (TREE_CODE (arg) != INTEGER_CST)
9937 return !tree_int_cst_equal (parm, arg);
9942 if (TREE_CODE (arg) != TREE_VEC)
9944 if (TREE_VEC_LENGTH (parm) != TREE_VEC_LENGTH (arg))
9946 for (i = 0; i < TREE_VEC_LENGTH (parm); ++i)
9947 if (unify (tparms, targs,
9948 TREE_VEC_ELT (parm, i), TREE_VEC_ELT (arg, i),
9956 if (TREE_CODE (arg) != TREE_CODE (parm))
9959 if (TYPE_PTRMEMFUNC_P (parm))
9961 if (!TYPE_PTRMEMFUNC_P (arg))
9964 return unify (tparms, targs,
9965 TYPE_PTRMEMFUNC_FN_TYPE (parm),
9966 TYPE_PTRMEMFUNC_FN_TYPE (arg),
9970 if (CLASSTYPE_TEMPLATE_INFO (parm))
9974 if (strict_in & UNIFY_ALLOW_DERIVED)
9976 /* First, we try to unify the PARM and ARG directly. */
9977 t = try_class_unification (tparms, targs,
9982 /* Fallback to the special case allowed in
9985 If P is a class, and P has the form
9986 template-id, then A can be a derived class of
9987 the deduced A. Likewise, if P is a pointer to
9988 a class of the form template-id, A can be a
9989 pointer to a derived class pointed to by the
9991 t = get_template_base (tparms, targs,
9994 if (! t || t == error_mark_node)
9998 else if (CLASSTYPE_TEMPLATE_INFO (arg)
9999 && (CLASSTYPE_TI_TEMPLATE (parm)
10000 == CLASSTYPE_TI_TEMPLATE (arg)))
10001 /* Perhaps PARM is something like S<U> and ARG is S<int>.
10002 Then, we should unify `int' and `U'. */
10005 /* There's no chance of unification succeeding. */
10008 return unify (tparms, targs, CLASSTYPE_TI_ARGS (parm),
10009 CLASSTYPE_TI_ARGS (t), UNIFY_ALLOW_NONE);
10011 else if (!same_type_ignoring_top_level_qualifiers_p (parm, arg))
10016 case FUNCTION_TYPE:
10017 if (TREE_CODE (arg) != TREE_CODE (parm))
10020 if (unify (tparms, targs, TREE_TYPE (parm),
10021 TREE_TYPE (arg), UNIFY_ALLOW_NONE))
10023 return type_unification_real (tparms, targs, TYPE_ARG_TYPES (parm),
10024 TYPE_ARG_TYPES (arg), 1,
10025 DEDUCE_EXACT, 0, -1);
10028 if (TREE_CODE (arg) != OFFSET_TYPE)
10030 if (unify (tparms, targs, TYPE_OFFSET_BASETYPE (parm),
10031 TYPE_OFFSET_BASETYPE (arg), UNIFY_ALLOW_NONE))
10033 return unify (tparms, targs, TREE_TYPE (parm), TREE_TYPE (arg),
10037 if (DECL_TEMPLATE_PARM_P (parm))
10038 return unify (tparms, targs, DECL_INITIAL (parm), arg, strict);
10039 if (arg != decl_constant_value (parm))
10044 case TEMPLATE_DECL:
10045 /* Matched cases are handled by the ARG == PARM test above. */
10049 if (tree_int_cst_equal (TREE_OPERAND (parm, 1), integer_one_node)
10050 && (strict_in & UNIFY_ALLOW_MAX_CORRECTION))
10052 /* We handle this case specially, since it comes up with
10053 arrays. In particular, something like:
10055 template <int N> void f(int (&x)[N]);
10057 Here, we are trying to unify the range type, which
10058 looks like [0 ... (N - 1)]. */
10060 t1 = TREE_OPERAND (parm, 0);
10061 t2 = TREE_OPERAND (parm, 1);
10063 t = fold (build (PLUS_EXPR, integer_type_node, arg, t2));
10065 return unify (tparms, targs, t1, t, strict);
10067 /* Else fall through. */
10070 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (parm))))
10073 /* We're looking at an expression. This can happen with
10077 void foo(S<I>, S<I + 2>);
10079 This is a "nondeduced context":
10083 The nondeduced contexts are:
10085 --A type that is a template-id in which one or more of
10086 the template-arguments is an expression that references
10087 a template-parameter.
10089 In these cases, we assume deduction succeeded, but don't
10090 actually infer any unifications. */
10092 if (!uses_template_parms (parm)
10093 && !template_args_equal (parm, arg))
10099 sorry ("use of `%s' in template type unification",
10100 tree_code_name [(int) TREE_CODE (parm)]);
10106 /* Called if RESULT is explicitly instantiated, or is a member of an
10107 explicitly instantiated class, or if using -frepo and the
10108 instantiation of RESULT has been assigned to this file. */
10111 mark_decl_instantiated (tree result, int extern_p)
10113 /* We used to set this unconditionally; we moved that to
10114 do_decl_instantiation so it wouldn't get set on members of
10115 explicit class template instantiations. But we still need to set
10116 it here for the 'extern template' case in order to suppress
10117 implicit instantiations. */
10119 SET_DECL_EXPLICIT_INSTANTIATION (result);
10121 /* If this entity has already been written out, it's too late to
10122 make any modifications. */
10123 if (TREE_ASM_WRITTEN (result))
10126 if (TREE_CODE (result) != FUNCTION_DECL)
10127 /* The TREE_PUBLIC flag for function declarations will have been
10128 set correctly by tsubst. */
10129 TREE_PUBLIC (result) = 1;
10131 /* This might have been set by an earlier implicit instantiation. */
10132 DECL_COMDAT (result) = 0;
10136 DECL_INTERFACE_KNOWN (result) = 1;
10137 DECL_NOT_REALLY_EXTERN (result) = 1;
10139 /* Always make artificials weak. */
10140 if (DECL_ARTIFICIAL (result) && flag_weak)
10141 comdat_linkage (result);
10142 /* For WIN32 we also want to put explicit instantiations in
10143 linkonce sections. */
10144 else if (TREE_PUBLIC (result))
10145 maybe_make_one_only (result);
10148 if (TREE_CODE (result) == FUNCTION_DECL)
10152 /* Given two function templates PAT1 and PAT2, return:
10154 DEDUCE should be DEDUCE_EXACT or DEDUCE_ORDER.
10156 1 if PAT1 is more specialized than PAT2 as described in [temp.func.order].
10157 -1 if PAT2 is more specialized than PAT1.
10158 0 if neither is more specialized.
10160 LEN is passed through to fn_type_unification. */
10163 more_specialized (tree pat1, tree pat2, int deduce, int len)
10168 /* If template argument deduction succeeds, we substitute the
10169 resulting arguments into non-deduced contexts. While doing that,
10170 we must be aware that we may encounter dependent types. */
10171 ++processing_template_decl;
10172 targs = get_bindings_real (pat1, DECL_TEMPLATE_RESULT (pat2),
10173 NULL_TREE, 0, deduce, len);
10177 targs = get_bindings_real (pat2, DECL_TEMPLATE_RESULT (pat1),
10178 NULL_TREE, 0, deduce, len);
10181 --processing_template_decl;
10186 /* Given two class template specialization list nodes PAT1 and PAT2, return:
10188 1 if PAT1 is more specialized than PAT2 as described in [temp.class.order].
10189 -1 if PAT2 is more specialized than PAT1.
10190 0 if neither is more specialized.
10192 FULL_ARGS is the full set of template arguments that triggers this
10193 partial ordering. */
10196 more_specialized_class (tree pat1, tree pat2, tree full_args)
10201 /* Just like what happens for functions, if we are ordering between
10202 different class template specializations, we may encounter dependent
10203 types in the arguments, and we need our dependency check functions
10204 to behave correctly. */
10205 ++processing_template_decl;
10206 targs = get_class_bindings (TREE_VALUE (pat1), TREE_PURPOSE (pat1),
10207 add_outermost_template_args (full_args, TREE_PURPOSE (pat2)));
10211 targs = get_class_bindings (TREE_VALUE (pat2), TREE_PURPOSE (pat2),
10212 add_outermost_template_args (full_args, TREE_PURPOSE (pat1)));
10215 --processing_template_decl;
10220 /* Return the template arguments that will produce the function signature
10221 DECL from the function template FN, with the explicit template
10222 arguments EXPLICIT_ARGS. If CHECK_RETTYPE is 1, the return type must
10223 also match. Return NULL_TREE if no satisfactory arguments could be
10224 found. DEDUCE and LEN are passed through to fn_type_unification. */
10227 get_bindings_real (tree fn,
10229 tree explicit_args,
10234 int ntparms = DECL_NTPARMS (fn);
10235 tree targs = make_tree_vec (ntparms);
10237 tree decl_arg_types;
10240 /* Substitute the explicit template arguments into the type of DECL.
10241 The call to fn_type_unification will handle substitution into the
10243 decl_type = TREE_TYPE (decl);
10244 if (explicit_args && uses_template_parms (decl_type))
10247 tree converted_args;
10249 if (DECL_TEMPLATE_INFO (decl))
10250 tmpl = DECL_TI_TEMPLATE (decl);
10252 /* We can get here for some invalid specializations. */
10256 = (coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl),
10257 explicit_args, NULL_TREE,
10258 tf_none, /*require_all_arguments=*/0));
10259 if (converted_args == error_mark_node)
10262 decl_type = tsubst (decl_type, converted_args, tf_none, NULL_TREE);
10263 if (decl_type == error_mark_node)
10267 decl_arg_types = TYPE_ARG_TYPES (decl_type);
10268 /* Never do unification on the 'this' parameter. */
10269 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl))
10270 decl_arg_types = TREE_CHAIN (decl_arg_types);
10272 i = fn_type_unification (fn, explicit_args, targs,
10274 (check_rettype || DECL_CONV_FN_P (fn)
10275 ? TREE_TYPE (decl_type) : NULL_TREE),
10284 /* For most uses, we want to check the return type. */
10287 get_bindings (tree fn, tree decl, tree explicit_args)
10289 return get_bindings_real (fn, decl, explicit_args, 1, DEDUCE_EXACT, -1);
10292 /* But for resolve_overloaded_unification, we only care about the parameter
10296 get_bindings_overload (tree fn, tree decl, tree explicit_args)
10298 return get_bindings_real (fn, decl, explicit_args, 0, DEDUCE_EXACT, -1);
10301 /* Return the innermost template arguments that, when applied to a
10302 template specialization whose innermost template parameters are
10303 TPARMS, and whose specialization arguments are PARMS, yield the
10306 For example, suppose we have:
10308 template <class T, class U> struct S {};
10309 template <class T> struct S<T*, int> {};
10311 Then, suppose we want to get `S<double*, int>'. The TPARMS will be
10312 {T}, the PARMS will be {T*, int} and the ARGS will be {double*,
10313 int}. The resulting vector will be {double}, indicating that `T'
10314 is bound to `double'. */
10317 get_class_bindings (tree tparms, tree parms, tree args)
10319 int i, ntparms = TREE_VEC_LENGTH (tparms);
10320 tree vec = make_tree_vec (ntparms);
10322 if (unify (tparms, vec, parms, INNERMOST_TEMPLATE_ARGS (args),
10326 for (i = 0; i < ntparms; ++i)
10327 if (! TREE_VEC_ELT (vec, i))
10330 if (verify_class_unification (vec, parms, args))
10336 /* In INSTANTIATIONS is a list of <INSTANTIATION, TEMPLATE> pairs.
10337 Pick the most specialized template, and return the corresponding
10338 instantiation, or if there is no corresponding instantiation, the
10339 template itself. If there is no most specialized template,
10340 error_mark_node is returned. If there are no templates at all,
10341 NULL_TREE is returned. */
10344 most_specialized_instantiation (tree instantiations)
10349 if (!instantiations)
10352 champ = instantiations;
10353 for (fn = TREE_CHAIN (instantiations); fn; fn = TREE_CHAIN (fn))
10355 fate = more_specialized (TREE_VALUE (champ), TREE_VALUE (fn),
10363 fn = TREE_CHAIN (fn);
10365 return error_mark_node;
10371 for (fn = instantiations; fn && fn != champ; fn = TREE_CHAIN (fn))
10373 fate = more_specialized (TREE_VALUE (champ), TREE_VALUE (fn),
10376 return error_mark_node;
10379 return TREE_PURPOSE (champ) ? TREE_PURPOSE (champ) : TREE_VALUE (champ);
10382 /* Return the most specialized of the list of templates in FNS that can
10383 produce an instantiation matching DECL, given the explicit template
10384 arguments EXPLICIT_ARGS. */
10387 most_specialized (tree fns, tree decl, tree explicit_args)
10389 tree candidates = NULL_TREE;
10392 for (fn = fns; fn; fn = TREE_CHAIN (fn))
10394 tree candidate = TREE_VALUE (fn);
10396 args = get_bindings (candidate, decl, explicit_args);
10398 candidates = tree_cons (NULL_TREE, candidate, candidates);
10401 return most_specialized_instantiation (candidates);
10404 /* If DECL is a specialization of some template, return the most
10405 general such template. Otherwise, returns NULL_TREE.
10407 For example, given:
10409 template <class T> struct S { template <class U> void f(U); };
10411 if TMPL is `template <class U> void S<int>::f(U)' this will return
10412 the full template. This function will not trace past partial
10413 specializations, however. For example, given in addition:
10415 template <class T> struct S<T*> { template <class U> void f(U); };
10417 if TMPL is `template <class U> void S<int*>::f(U)' this will return
10418 `template <class T> template <class U> S<T*>::f(U)'. */
10421 most_general_template (tree decl)
10423 /* If DECL is a FUNCTION_DECL, find the TEMPLATE_DECL of which it is
10424 an immediate specialization. */
10425 if (TREE_CODE (decl) == FUNCTION_DECL)
10427 if (DECL_TEMPLATE_INFO (decl)) {
10428 decl = DECL_TI_TEMPLATE (decl);
10430 /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE for a
10431 template friend. */
10432 if (TREE_CODE (decl) != TEMPLATE_DECL)
10438 /* Look for more and more general templates. */
10439 while (DECL_TEMPLATE_INFO (decl))
10441 /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE in some cases.
10442 (See cp-tree.h for details.) */
10443 if (TREE_CODE (DECL_TI_TEMPLATE (decl)) != TEMPLATE_DECL)
10446 if (CLASS_TYPE_P (TREE_TYPE (decl))
10447 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl)))
10450 /* Stop if we run into an explicitly specialized class template. */
10451 if (!DECL_NAMESPACE_SCOPE_P (decl)
10452 && DECL_CONTEXT (decl)
10453 && CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (decl)))
10456 decl = DECL_TI_TEMPLATE (decl);
10462 /* Return the most specialized of the class template specializations
10463 of TMPL which can produce an instantiation matching ARGS, or
10464 error_mark_node if the choice is ambiguous. */
10467 most_specialized_class (tree tmpl, tree args)
10469 tree list = NULL_TREE;
10474 tmpl = most_general_template (tmpl);
10475 for (t = DECL_TEMPLATE_SPECIALIZATIONS (tmpl); t; t = TREE_CHAIN (t))
10478 = get_class_bindings (TREE_VALUE (t), TREE_PURPOSE (t), args);
10481 list = tree_cons (TREE_PURPOSE (t), TREE_VALUE (t), list);
10482 TREE_TYPE (list) = TREE_TYPE (t);
10491 t = TREE_CHAIN (t);
10492 for (; t; t = TREE_CHAIN (t))
10494 fate = more_specialized_class (champ, t, args);
10501 t = TREE_CHAIN (t);
10503 return error_mark_node;
10509 for (t = list; t && t != champ; t = TREE_CHAIN (t))
10511 fate = more_specialized_class (champ, t, args);
10513 return error_mark_node;
10519 /* Explicitly instantiate DECL. */
10522 do_decl_instantiation (tree decl, tree storage)
10524 tree result = NULL_TREE;
10528 /* An error occurred, for which grokdeclarator has already issued
10529 an appropriate message. */
10531 else if (! DECL_LANG_SPECIFIC (decl))
10533 error ("explicit instantiation of non-template `%#D'", decl);
10536 else if (TREE_CODE (decl) == VAR_DECL)
10538 /* There is an asymmetry here in the way VAR_DECLs and
10539 FUNCTION_DECLs are handled by grokdeclarator. In the case of
10540 the latter, the DECL we get back will be marked as a
10541 template instantiation, and the appropriate
10542 DECL_TEMPLATE_INFO will be set up. This does not happen for
10543 VAR_DECLs so we do the lookup here. Probably, grokdeclarator
10544 should handle VAR_DECLs as it currently handles
10546 result = lookup_field (DECL_CONTEXT (decl), DECL_NAME (decl), 0, false);
10547 if (!result || TREE_CODE (result) != VAR_DECL)
10549 error ("no matching template for `%D' found", decl);
10553 else if (TREE_CODE (decl) != FUNCTION_DECL)
10555 error ("explicit instantiation of `%#D'", decl);
10561 /* Check for various error cases. Note that if the explicit
10562 instantiation is valid the RESULT will currently be marked as an
10563 *implicit* instantiation; DECL_EXPLICIT_INSTANTIATION is not set
10564 until we get here. */
10566 if (DECL_TEMPLATE_SPECIALIZATION (result))
10568 /* DR 259 [temp.spec].
10570 Both an explicit instantiation and a declaration of an explicit
10571 specialization shall not appear in a program unless the explicit
10572 instantiation follows a declaration of the explicit specialization.
10574 For a given set of template parameters, if an explicit
10575 instantiation of a template appears after a declaration of an
10576 explicit specialization for that template, the explicit
10577 instantiation has no effect. */
10580 else if (DECL_EXPLICIT_INSTANTIATION (result))
10584 No program shall explicitly instantiate any template more
10587 We check DECL_INTERFACE_KNOWN so as not to complain when the first
10588 instantiation was `extern' and the second is not, and EXTERN_P for
10589 the opposite case. If -frepo, chances are we already got marked
10590 as an explicit instantiation because of the repo file. */
10591 if (DECL_INTERFACE_KNOWN (result) && !extern_p && !flag_use_repository)
10592 pedwarn ("duplicate explicit instantiation of `%#D'", result);
10594 /* If we've already instantiated the template, just return now. */
10595 if (DECL_INTERFACE_KNOWN (result))
10598 else if (!DECL_IMPLICIT_INSTANTIATION (result))
10600 error ("no matching template for `%D' found", result);
10603 else if (!DECL_TEMPLATE_INFO (result))
10605 pedwarn ("explicit instantiation of non-template `%#D'", result);
10609 if (storage == NULL_TREE)
10611 else if (storage == ridpointers[(int) RID_EXTERN])
10613 if (pedantic && !in_system_header)
10614 pedwarn ("ISO C++ forbids the use of `extern' on explicit instantiations");
10618 error ("storage class `%D' applied to template instantiation",
10621 SET_DECL_EXPLICIT_INSTANTIATION (result);
10622 mark_decl_instantiated (result, extern_p);
10623 repo_template_instantiated (result, extern_p);
10625 instantiate_decl (result, /*defer_ok=*/1);
10629 mark_class_instantiated (tree t, int extern_p)
10631 SET_CLASSTYPE_EXPLICIT_INSTANTIATION (t);
10632 SET_CLASSTYPE_INTERFACE_KNOWN (t);
10633 CLASSTYPE_INTERFACE_ONLY (t) = extern_p;
10634 TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (t)) = extern_p;
10637 CLASSTYPE_DEBUG_REQUESTED (t) = 1;
10638 rest_of_type_compilation (t, 1);
10642 /* Called from do_type_instantiation through binding_table_foreach to
10643 do recursive instantiation for the type bound in ENTRY. */
10645 bt_instantiate_type_proc (binding_entry entry, void *data)
10647 tree storage = *(tree *) data;
10649 if (IS_AGGR_TYPE (entry->type)
10650 && !uses_template_parms (CLASSTYPE_TI_ARGS (entry->type)))
10651 do_type_instantiation (TYPE_MAIN_DECL (entry->type), storage, 0);
10654 /* Perform an explicit instantiation of template class T. STORAGE, if
10655 non-null, is the RID for extern, inline or static. COMPLAIN is
10656 nonzero if this is called from the parser, zero if called recursively,
10657 since the standard is unclear (as detailed below). */
10660 do_type_instantiation (tree t, tree storage, tsubst_flags_t complain)
10665 int previous_instantiation_extern_p = 0;
10667 if (TREE_CODE (t) == TYPE_DECL)
10670 if (! CLASS_TYPE_P (t) || ! CLASSTYPE_TEMPLATE_INFO (t))
10672 error ("explicit instantiation of non-template type `%T'", t);
10678 if (!COMPLETE_TYPE_P (t))
10680 if (complain & tf_error)
10681 error ("explicit instantiation of `%#T' before definition of template",
10686 if (storage != NULL_TREE)
10688 if (pedantic && !in_system_header)
10689 pedwarn("ISO C++ forbids the use of `%s' on explicit instantiations",
10690 IDENTIFIER_POINTER (storage));
10692 if (storage == ridpointers[(int) RID_INLINE])
10694 else if (storage == ridpointers[(int) RID_EXTERN])
10696 else if (storage == ridpointers[(int) RID_STATIC])
10700 error ("storage class `%D' applied to template instantiation",
10706 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (t))
10708 /* DR 259 [temp.spec].
10710 Both an explicit instantiation and a declaration of an explicit
10711 specialization shall not appear in a program unless the explicit
10712 instantiation follows a declaration of the explicit specialization.
10714 For a given set of template parameters, if an explicit
10715 instantiation of a template appears after a declaration of an
10716 explicit specialization for that template, the explicit
10717 instantiation has no effect. */
10720 else if (CLASSTYPE_EXPLICIT_INSTANTIATION (t))
10724 No program shall explicitly instantiate any template more
10727 If PREVIOUS_INSTANTIATION_EXTERN_P, then the first explicit
10728 instantiation was `extern'. If EXTERN_P then the second is.
10729 If -frepo, chances are we already got marked as an explicit
10730 instantiation because of the repo file. All these cases are
10733 previous_instantiation_extern_p = CLASSTYPE_INTERFACE_ONLY (t);
10735 if (!previous_instantiation_extern_p && !extern_p
10736 && !flag_use_repository
10737 && (complain & tf_error))
10738 pedwarn ("duplicate explicit instantiation of `%#T'", t);
10740 /* If we've already instantiated the template, just return now. */
10741 if (!CLASSTYPE_INTERFACE_ONLY (t))
10745 mark_class_instantiated (t, extern_p);
10746 repo_template_instantiated (t, extern_p);
10753 int explicitly_instantiate_members = 0;
10755 /* In contrast to implicit instantiation, where only the
10756 declarations, and not the definitions, of members are
10757 instantiated, we have here:
10761 The explicit instantiation of a class template specialization
10762 implies the instantiation of all of its members not
10763 previously explicitly specialized in the translation unit
10764 containing the explicit instantiation.
10766 Of course, we can't instantiate member template classes, since
10767 we don't have any arguments for them. Note that the standard
10768 is unclear on whether the instantiation of the members are
10769 *explicit* instantiations or not. We choose to be generous,
10770 and not set DECL_EXPLICIT_INSTANTIATION. Therefore, we allow
10771 the explicit instantiation of a class where some of the members
10772 have no definition in the current translation unit. Exception:
10773 on some targets (e.g. Darwin), weak symbols do not get put in
10774 a static archive's TOC. The problematic case is if we're doing
10775 a non-extern explicit instantiation of an extern template: we
10776 have to put member functions in the TOC in that case, or we'll
10777 get unresolved symbols at link time. */
10779 explicitly_instantiate_members =
10780 TARGET_EXPLICIT_INSTANTIATIONS_ONE_ONLY
10781 && previous_instantiation_extern_p && ! extern_p
10782 && ! TYPE_FOR_JAVA (t);
10785 for (tmp = TYPE_METHODS (t); tmp; tmp = TREE_CHAIN (tmp))
10786 if (TREE_CODE (tmp) == FUNCTION_DECL
10787 && DECL_TEMPLATE_INSTANTIATION (tmp))
10789 if (explicitly_instantiate_members)
10790 do_decl_instantiation (tmp, NULL_TREE);
10793 mark_decl_instantiated (tmp, extern_p);
10794 repo_template_instantiated (tmp, extern_p);
10796 instantiate_decl (tmp, /*defer_ok=*/1);
10800 for (tmp = TYPE_FIELDS (t); tmp; tmp = TREE_CHAIN (tmp))
10801 if (TREE_CODE (tmp) == VAR_DECL && DECL_TEMPLATE_INSTANTIATION (tmp))
10803 if (explicitly_instantiate_members)
10804 do_decl_instantiation (tmp, NULL_TREE);
10807 mark_decl_instantiated (tmp, extern_p);
10808 repo_template_instantiated (tmp, extern_p);
10810 instantiate_decl (tmp, /*defer_ok=*/1);
10814 if (CLASSTYPE_NESTED_UTDS (t))
10815 binding_table_foreach (CLASSTYPE_NESTED_UTDS (t),
10816 bt_instantiate_type_proc, &storage);
10820 /* Given a function DECL, which is a specialization of TMPL, modify
10821 DECL to be a re-instantiation of TMPL with the same template
10822 arguments. TMPL should be the template into which tsubst'ing
10823 should occur for DECL, not the most general template.
10825 One reason for doing this is a scenario like this:
10828 void f(const T&, int i);
10830 void g() { f(3, 7); }
10833 void f(const T& t, const int i) { }
10835 Note that when the template is first instantiated, with
10836 instantiate_template, the resulting DECL will have no name for the
10837 first parameter, and the wrong type for the second. So, when we go
10838 to instantiate the DECL, we regenerate it. */
10841 regenerate_decl_from_template (tree decl, tree tmpl)
10843 /* The most general version of TMPL. */
10845 /* The arguments used to instantiate DECL, from the most general
10852 args = DECL_TI_ARGS (decl);
10853 code_pattern = DECL_TEMPLATE_RESULT (tmpl);
10855 /* Unregister the specialization so that when we tsubst we will not
10856 just return DECL. We don't have to unregister DECL from TMPL
10857 because if would only be registered there if it were a partial
10858 instantiation of a specialization, which it isn't: it's a full
10860 gen_tmpl = most_general_template (tmpl);
10861 unregistered = reregister_specialization (decl, gen_tmpl,
10862 /*new_spec=*/NULL_TREE);
10864 /* If the DECL was not unregistered then something peculiar is
10865 happening: we created a specialization but did not call
10866 register_specialization for it. */
10867 my_friendly_assert (unregistered, 0);
10869 /* Make sure that we can see identifiers, and compute access
10871 push_access_scope (decl);
10873 /* Do the substitution to get the new declaration. */
10874 new_decl = tsubst (code_pattern, args, tf_error, NULL_TREE);
10876 if (TREE_CODE (decl) == VAR_DECL)
10878 /* Set up DECL_INITIAL, since tsubst doesn't. */
10879 if (!DECL_INITIALIZED_IN_CLASS_P (decl))
10880 DECL_INITIAL (new_decl) =
10881 tsubst_expr (DECL_INITIAL (code_pattern), args,
10882 tf_error, DECL_TI_TEMPLATE (decl));
10884 else if (TREE_CODE (decl) == FUNCTION_DECL)
10886 /* Convince duplicate_decls to use the DECL_ARGUMENTS from the
10888 DECL_INITIAL (new_decl) = error_mark_node;
10889 /* And don't complain about a duplicate definition. */
10890 DECL_INITIAL (decl) = NULL_TREE;
10893 pop_access_scope (decl);
10895 /* The immediate parent of the new template is still whatever it was
10896 before, even though tsubst sets DECL_TI_TEMPLATE up as the most
10897 general template. We also reset the DECL_ASSEMBLER_NAME since
10898 tsubst always calculates the name as if the function in question
10899 were really a template instance, and sometimes, with friend
10900 functions, this is not so. See tsubst_friend_function for
10902 DECL_TI_TEMPLATE (new_decl) = DECL_TI_TEMPLATE (decl);
10903 COPY_DECL_ASSEMBLER_NAME (decl, new_decl);
10904 COPY_DECL_RTL (decl, new_decl);
10905 DECL_USE_TEMPLATE (new_decl) = DECL_USE_TEMPLATE (decl);
10907 /* Call duplicate decls to merge the old and new declarations. */
10908 duplicate_decls (new_decl, decl);
10910 /* Now, re-register the specialization. */
10911 register_specialization (decl, gen_tmpl, args);
10914 /* Return the TEMPLATE_DECL into which DECL_TI_ARGS(DECL) should be
10915 substituted to get DECL. */
10918 template_for_substitution (tree decl)
10920 tree tmpl = DECL_TI_TEMPLATE (decl);
10922 /* Set TMPL to the template whose DECL_TEMPLATE_RESULT is the pattern
10923 for the instantiation. This is not always the most general
10924 template. Consider, for example:
10927 struct S { template <class U> void f();
10928 template <> void f<int>(); };
10930 and an instantiation of S<double>::f<int>. We want TD to be the
10931 specialization S<T>::f<int>, not the more general S<T>::f<U>. */
10932 while (/* An instantiation cannot have a definition, so we need a
10933 more general template. */
10934 DECL_TEMPLATE_INSTANTIATION (tmpl)
10935 /* We must also deal with friend templates. Given:
10937 template <class T> struct S {
10938 template <class U> friend void f() {};
10941 S<int>::f<U> say, is not an instantiation of S<T>::f<U>,
10942 so far as the language is concerned, but that's still
10943 where we get the pattern for the instantiation from. On
10944 other hand, if the definition comes outside the class, say:
10946 template <class T> struct S {
10947 template <class U> friend void f();
10949 template <class U> friend void f() {}
10951 we don't need to look any further. That's what the check for
10952 DECL_INITIAL is for. */
10953 || (TREE_CODE (decl) == FUNCTION_DECL
10954 && DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (tmpl)
10955 && !DECL_INITIAL (DECL_TEMPLATE_RESULT (tmpl))))
10957 /* The present template, TD, should not be a definition. If it
10958 were a definition, we should be using it! Note that we
10959 cannot restructure the loop to just keep going until we find
10960 a template with a definition, since that might go too far if
10961 a specialization was declared, but not defined. */
10962 my_friendly_assert (!(TREE_CODE (decl) == VAR_DECL
10963 && !DECL_IN_AGGR_P (DECL_TEMPLATE_RESULT (tmpl))),
10966 /* Fetch the more general template. */
10967 tmpl = DECL_TI_TEMPLATE (tmpl);
10973 /* Produce the definition of D, a _DECL generated from a template. If
10974 DEFER_OK is nonzero, then we don't have to actually do the
10975 instantiation now; we just have to do it sometime. */
10978 instantiate_decl (tree d, int defer_ok)
10980 tree tmpl = DECL_TI_TEMPLATE (d);
10987 int pattern_defined;
10989 location_t saved_loc = input_location;
10991 /* This function should only be used to instantiate templates for
10992 functions and static member variables. */
10993 my_friendly_assert (TREE_CODE (d) == FUNCTION_DECL
10994 || TREE_CODE (d) == VAR_DECL, 0);
10996 /* Variables are never deferred; if instantiation is required, they
10997 are instantiated right away. That allows for better code in the
10998 case that an expression refers to the value of the variable --
10999 if the variable has a constant value the referring expression can
11000 take advantage of that fact. */
11001 if (TREE_CODE (d) == VAR_DECL)
11004 /* Don't instantiate cloned functions. Instead, instantiate the
11005 functions they cloned. */
11006 if (TREE_CODE (d) == FUNCTION_DECL && DECL_CLONED_FUNCTION_P (d))
11007 d = DECL_CLONED_FUNCTION (d);
11009 if (DECL_TEMPLATE_INSTANTIATED (d))
11010 /* D has already been instantiated. It might seem reasonable to
11011 check whether or not D is an explicit instantiation, and, if so,
11012 stop here. But when an explicit instantiation is deferred
11013 until the end of the compilation, DECL_EXPLICIT_INSTANTIATION
11014 is set, even though we still need to do the instantiation. */
11017 /* If we already have a specialization of this declaration, then
11018 there's no reason to instantiate it. Note that
11019 retrieve_specialization gives us both instantiations and
11020 specializations, so we must explicitly check
11021 DECL_TEMPLATE_SPECIALIZATION. */
11022 gen_tmpl = most_general_template (tmpl);
11023 gen_args = DECL_TI_ARGS (d);
11024 spec = retrieve_specialization (gen_tmpl, gen_args);
11025 if (spec != NULL_TREE && DECL_TEMPLATE_SPECIALIZATION (spec))
11028 /* This needs to happen before any tsubsting. */
11029 if (! push_tinst_level (d))
11032 timevar_push (TV_PARSE);
11034 /* We may be in the middle of deferred access check. Disable it now. */
11035 push_deferring_access_checks (dk_no_deferred);
11037 /* Set TD to the template whose DECL_TEMPLATE_RESULT is the pattern
11038 for the instantiation. */
11039 td = template_for_substitution (d);
11040 code_pattern = DECL_TEMPLATE_RESULT (td);
11042 if ((DECL_NAMESPACE_SCOPE_P (d) && !DECL_INITIALIZED_IN_CLASS_P (d))
11043 || DECL_TEMPLATE_SPECIALIZATION (td))
11044 /* In the case of a friend template whose definition is provided
11045 outside the class, we may have too many arguments. Drop the
11046 ones we don't need. The same is true for specializations. */
11047 args = get_innermost_template_args
11048 (gen_args, TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (td)));
11052 if (TREE_CODE (d) == FUNCTION_DECL)
11053 pattern_defined = (DECL_SAVED_TREE (code_pattern) != NULL_TREE);
11055 pattern_defined = ! DECL_IN_AGGR_P (code_pattern);
11057 input_location = DECL_SOURCE_LOCATION (d);
11059 if (pattern_defined)
11061 /* Let the repository code that this template definition is
11064 The repository doesn't need to know about cloned functions
11065 because they never actually show up in the object file. It
11066 does need to know about the clones; those are the symbols
11067 that the linker will be emitting error messages about. */
11068 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (d)
11069 || DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (d))
11073 for (t = TREE_CHAIN (d);
11074 t && DECL_CLONED_FUNCTION_P (t);
11075 t = TREE_CHAIN (t))
11076 repo_template_used (t);
11079 repo_template_used (d);
11082 import_export_decl (d);
11087 /* Recheck the substitutions to obtain any warning messages
11088 about ignoring cv qualifiers. */
11089 tree gen = DECL_TEMPLATE_RESULT (gen_tmpl);
11090 tree type = TREE_TYPE (gen);
11092 /* Make sure that we can see identifiers, and compute access
11093 correctly. D is already the target FUNCTION_DECL with the
11095 push_access_scope (d);
11097 if (TREE_CODE (gen) == FUNCTION_DECL)
11099 tsubst (DECL_ARGUMENTS (gen), gen_args, tf_error | tf_warning, d);
11100 tsubst (TYPE_RAISES_EXCEPTIONS (type), gen_args,
11101 tf_error | tf_warning, d);
11102 /* Don't simply tsubst the function type, as that will give
11103 duplicate warnings about poor parameter qualifications.
11104 The function arguments are the same as the decl_arguments
11105 without the top level cv qualifiers. */
11106 type = TREE_TYPE (type);
11108 tsubst (type, gen_args, tf_error | tf_warning, d);
11110 pop_access_scope (d);
11113 if (TREE_CODE (d) == VAR_DECL && DECL_INITIALIZED_IN_CLASS_P (d)
11114 && DECL_INITIAL (d) == NULL_TREE)
11115 /* We should have set up DECL_INITIAL in instantiate_class_template. */
11117 /* Reject all external templates except inline functions. */
11118 else if (DECL_INTERFACE_KNOWN (d)
11119 && ! DECL_NOT_REALLY_EXTERN (d)
11120 && ! (TREE_CODE (d) == FUNCTION_DECL
11121 && DECL_INLINE (d)))
11123 /* Defer all other templates, unless we have been explicitly
11124 forbidden from doing so. We restore the source position here
11125 because it's used by add_pending_template. */
11126 else if (! pattern_defined || defer_ok)
11128 input_location = saved_loc;
11130 if (at_eof && !pattern_defined
11131 && DECL_EXPLICIT_INSTANTIATION (d))
11134 The definition of a non-exported function template, a
11135 non-exported member function template, or a non-exported
11136 member function or static data member of a class template
11137 shall be present in every translation unit in which it is
11138 explicitly instantiated. */
11140 ("explicit instantiation of `%D' but no definition available", d);
11142 add_pending_template (d);
11146 need_push = !global_bindings_p ();
11148 push_to_top_level ();
11150 /* Mark D as instantiated so that recursive calls to
11151 instantiate_decl do not try to instantiate it again. */
11152 DECL_TEMPLATE_INSTANTIATED (d) = 1;
11154 /* Regenerate the declaration in case the template has been modified
11155 by a subsequent redeclaration. */
11156 regenerate_decl_from_template (d, td);
11158 /* We already set the file and line above. Reset them now in case
11159 they changed as a result of calling
11160 regenerate_decl_from_template. */
11161 input_location = DECL_SOURCE_LOCATION (d);
11163 if (TREE_CODE (d) == VAR_DECL)
11165 /* Clear out DECL_RTL; whatever was there before may not be right
11166 since we've reset the type of the declaration. */
11167 SET_DECL_RTL (d, NULL_RTX);
11169 DECL_IN_AGGR_P (d) = 0;
11170 import_export_decl (d);
11171 DECL_EXTERNAL (d) = ! DECL_NOT_REALLY_EXTERN (d);
11173 if (DECL_EXTERNAL (d))
11175 /* The fact that this code is executing indicates that:
11177 (1) D is a template static data member, for which a
11178 definition is available.
11180 (2) An implicit or explicit instantiation has occurred.
11182 (3) We are not going to emit a definition of the static
11183 data member at this time.
11185 This situation is peculiar, but it occurs on platforms
11186 without weak symbols when performing an implicit
11187 instantiation. There, we cannot implicitly instantiate a
11188 defined static data member in more than one translation
11189 unit, so import_export_decl marks the declaration as
11190 external; we must rely on explicit instantiation.
11192 Reset instantiated marker to make sure that later
11193 explicit instantiation will be processed. */
11194 DECL_TEMPLATE_INSTANTIATED (d) = 0;
11198 /* This is done in analogous to `start_decl'. It is
11199 required for correct access checking. */
11200 push_nested_class (DECL_CONTEXT (d));
11202 (!DECL_INITIALIZED_IN_CLASS_P (d)
11203 ? DECL_INITIAL (d) : NULL_TREE),
11205 /* Normally, pop_nested_class is called by cp_finish_decl
11206 above. But when instantiate_decl is triggered during
11207 instantiate_class_template processing, its DECL_CONTEXT
11208 is still not completed yet, and pop_nested_class isn't
11210 if (!COMPLETE_TYPE_P (DECL_CONTEXT (d)))
11211 pop_nested_class ();
11214 else if (TREE_CODE (d) == FUNCTION_DECL)
11216 htab_t saved_local_specializations;
11221 /* Mark D as instantiated so that recursive calls to
11222 instantiate_decl do not try to instantiate it again. */
11223 DECL_TEMPLATE_INSTANTIATED (d) = 1;
11225 /* Save away the current list, in case we are instantiating one
11226 template from within the body of another. */
11227 saved_local_specializations = local_specializations;
11229 /* Set up the list of local specializations. */
11230 local_specializations = htab_create (37,
11231 hash_local_specialization,
11232 eq_local_specializations,
11235 /* Set up context. */
11236 import_export_decl (d);
11237 start_function (NULL_TREE, d, NULL_TREE, SF_PRE_PARSED);
11239 /* Create substitution entries for the parameters. */
11240 subst_decl = DECL_TEMPLATE_RESULT (template_for_substitution (d));
11241 tmpl_parm = DECL_ARGUMENTS (subst_decl);
11242 spec_parm = DECL_ARGUMENTS (d);
11243 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (d))
11245 register_local_specialization (spec_parm, tmpl_parm);
11246 spec_parm = skip_artificial_parms_for (d, spec_parm);
11247 tmpl_parm = skip_artificial_parms_for (subst_decl, tmpl_parm);
11251 register_local_specialization (spec_parm, tmpl_parm);
11252 tmpl_parm = TREE_CHAIN (tmpl_parm);
11253 spec_parm = TREE_CHAIN (spec_parm);
11255 my_friendly_assert (!spec_parm, 20020813);
11257 /* Substitute into the body of the function. */
11258 tsubst_expr (DECL_SAVED_TREE (code_pattern), args,
11259 tf_error | tf_warning, tmpl);
11261 /* We don't need the local specializations any more. */
11262 htab_delete (local_specializations);
11263 local_specializations = saved_local_specializations;
11265 /* Finish the function. */
11266 d = finish_function (0);
11267 expand_or_defer_fn (d);
11270 /* We're not deferring instantiation any more. */
11271 TI_PENDING_TEMPLATE_FLAG (DECL_TEMPLATE_INFO (d)) = 0;
11274 pop_from_top_level ();
11277 input_location = saved_loc;
11278 pop_deferring_access_checks ();
11279 pop_tinst_level ();
11281 timevar_pop (TV_PARSE);
11286 /* Run through the list of templates that we wish we could
11287 instantiate, and instantiate any we can. */
11290 instantiate_pending_templates (void)
11293 tree last = NULL_TREE;
11294 int instantiated_something = 0;
11296 location_t saved_loc = input_location;
11302 t = &pending_templates;
11305 tree instantiation = TREE_VALUE (*t);
11307 reopen_tinst_level (TREE_PURPOSE (*t));
11309 if (TYPE_P (instantiation))
11313 if (!COMPLETE_TYPE_P (instantiation))
11315 instantiate_class_template (instantiation);
11316 if (CLASSTYPE_TEMPLATE_INSTANTIATION (instantiation))
11317 for (fn = TYPE_METHODS (instantiation);
11319 fn = TREE_CHAIN (fn))
11320 if (! DECL_ARTIFICIAL (fn))
11321 instantiate_decl (fn, /*defer_ok=*/0);
11322 if (COMPLETE_TYPE_P (instantiation))
11324 instantiated_something = 1;
11329 if (COMPLETE_TYPE_P (instantiation))
11330 /* If INSTANTIATION has been instantiated, then we don't
11331 need to consider it again in the future. */
11332 *t = TREE_CHAIN (*t);
11336 t = &TREE_CHAIN (*t);
11341 if (!DECL_TEMPLATE_SPECIALIZATION (instantiation)
11342 && !DECL_TEMPLATE_INSTANTIATED (instantiation))
11344 instantiation = instantiate_decl (instantiation,
11346 if (DECL_TEMPLATE_INSTANTIATED (instantiation))
11348 instantiated_something = 1;
11353 if (DECL_TEMPLATE_SPECIALIZATION (instantiation)
11354 || DECL_TEMPLATE_INSTANTIATED (instantiation))
11355 /* If INSTANTIATION has been instantiated, then we don't
11356 need to consider it again in the future. */
11357 *t = TREE_CHAIN (*t);
11361 t = &TREE_CHAIN (*t);
11365 current_tinst_level = NULL_TREE;
11367 last_pending_template = last;
11369 while (reconsider);
11371 input_location = saved_loc;
11372 return instantiated_something;
11375 /* Substitute ARGVEC into T, which is a list of initializers for
11376 either base class or a non-static data member. The TREE_PURPOSEs
11377 are DECLs, and the TREE_VALUEs are the initializer values. Used by
11378 instantiate_decl. */
11381 tsubst_initializer_list (tree t, tree argvec)
11383 tree inits = NULL_TREE;
11385 for (; t; t = TREE_CHAIN (t))
11391 decl = tsubst_copy (TREE_PURPOSE (t), argvec, tf_error | tf_warning,
11393 decl = expand_member_init (decl);
11394 if (decl && !DECL_P (decl))
11395 in_base_initializer = 1;
11397 init = tsubst_expr (TREE_VALUE (t), argvec, tf_error | tf_warning,
11401 else if (TREE_CODE (init) == TREE_LIST)
11402 for (val = init; val; val = TREE_CHAIN (val))
11403 TREE_VALUE (val) = convert_from_reference (TREE_VALUE (val));
11404 else if (init != void_type_node)
11405 init = convert_from_reference (init);
11407 in_base_initializer = 0;
11411 init = build_tree_list (decl, init);
11412 TREE_CHAIN (init) = inits;
11419 /* Set CURRENT_ACCESS_SPECIFIER based on the protection of DECL. */
11422 set_current_access_from_decl (tree decl)
11424 if (TREE_PRIVATE (decl))
11425 current_access_specifier = access_private_node;
11426 else if (TREE_PROTECTED (decl))
11427 current_access_specifier = access_protected_node;
11429 current_access_specifier = access_public_node;
11432 /* Instantiate an enumerated type. TAG is the template type, NEWTAG
11433 is the instantiation (which should have been created with
11434 start_enum) and ARGS are the template arguments to use. */
11437 tsubst_enum (tree tag, tree newtag, tree args)
11441 for (e = TYPE_VALUES (tag); e; e = TREE_CHAIN (e))
11446 decl = TREE_VALUE (e);
11447 /* Note that in a template enum, the TREE_VALUE is the
11448 CONST_DECL, not the corresponding INTEGER_CST. */
11449 value = tsubst_expr (DECL_INITIAL (decl),
11450 args, tf_error | tf_warning,
11453 /* Give this enumeration constant the correct access. */
11454 set_current_access_from_decl (decl);
11456 /* Actually build the enumerator itself. */
11457 build_enumerator (DECL_NAME (decl), value, newtag);
11460 finish_enum (newtag);
11461 DECL_SOURCE_LOCATION (TYPE_NAME (newtag))
11462 = DECL_SOURCE_LOCATION (TYPE_NAME (tag));
11465 /* DECL is a FUNCTION_DECL that is a template specialization. Return
11466 its type -- but without substituting the innermost set of template
11467 arguments. So, innermost set of template parameters will appear in
11471 get_mostly_instantiated_function_type (tree decl)
11479 tmpl = most_general_template (DECL_TI_TEMPLATE (decl));
11480 targs = DECL_TI_ARGS (decl);
11481 tparms = DECL_TEMPLATE_PARMS (tmpl);
11482 parm_depth = TMPL_PARMS_DEPTH (tparms);
11484 /* There should be as many levels of arguments as there are levels
11486 my_friendly_assert (parm_depth == TMPL_ARGS_DEPTH (targs), 0);
11488 fn_type = TREE_TYPE (tmpl);
11490 if (parm_depth == 1)
11491 /* No substitution is necessary. */
11498 /* Replace the innermost level of the TARGS with NULL_TREEs to
11499 let tsubst know not to substitute for those parameters. */
11500 partial_args = make_tree_vec (TREE_VEC_LENGTH (targs));
11501 for (i = 1; i < TMPL_ARGS_DEPTH (targs); ++i)
11502 SET_TMPL_ARGS_LEVEL (partial_args, i,
11503 TMPL_ARGS_LEVEL (targs, i));
11504 SET_TMPL_ARGS_LEVEL (partial_args,
11505 TMPL_ARGS_DEPTH (targs),
11506 make_tree_vec (DECL_NTPARMS (tmpl)));
11508 /* Make sure that we can see identifiers, and compute access
11509 correctly. We can just use the context of DECL for the
11510 partial substitution here. It depends only on outer template
11511 parameters, regardless of whether the innermost level is
11512 specialized or not. */
11513 push_access_scope (decl);
11515 ++processing_template_decl;
11516 /* Now, do the (partial) substitution to figure out the
11517 appropriate function type. */
11518 fn_type = tsubst (fn_type, partial_args, tf_error, NULL_TREE);
11519 --processing_template_decl;
11521 /* Substitute into the template parameters to obtain the real
11522 innermost set of parameters. This step is important if the
11523 innermost set of template parameters contains value
11524 parameters whose types depend on outer template parameters. */
11525 TREE_VEC_LENGTH (partial_args)--;
11526 tparms = tsubst_template_parms (tparms, partial_args, tf_error);
11528 pop_access_scope (decl);
11534 /* Return truthvalue if we're processing a template different from
11535 the last one involved in diagnostics. */
11537 problematic_instantiation_changed (void)
11539 return last_template_error_tick != tinst_level_tick;
11542 /* Remember current template involved in diagnostics. */
11544 record_last_problematic_instantiation (void)
11546 last_template_error_tick = tinst_level_tick;
11550 current_instantiation (void)
11552 return current_tinst_level;
11555 /* [temp.param] Check that template non-type parm TYPE is of an allowable
11556 type. Return zero for ok, nonzero for disallowed. Issue error and
11557 warning messages under control of COMPLAIN. */
11560 invalid_nontype_parm_type_p (tree type, tsubst_flags_t complain)
11562 if (INTEGRAL_TYPE_P (type))
11564 else if (POINTER_TYPE_P (type))
11566 else if (TYPE_PTR_TO_MEMBER_P (type))
11568 else if (TREE_CODE (type) == TEMPLATE_TYPE_PARM)
11570 else if (TREE_CODE (type) == TYPENAME_TYPE)
11573 if (complain & tf_error)
11574 error ("`%#T' is not a valid type for a template constant parameter",
11579 /* Returns TRUE if TYPE is dependent, in the sense of [temp.dep.type].
11580 Assumes that TYPE really is a type, and not the ERROR_MARK_NODE.*/
11583 dependent_type_p_r (tree type)
11589 A type is dependent if it is:
11591 -- a template parameter. Template template parameters are
11592 types for us (since TYPE_P holds true for them) so we
11593 handle them here. */
11594 if (TREE_CODE (type) == TEMPLATE_TYPE_PARM
11595 || TREE_CODE (type) == TEMPLATE_TEMPLATE_PARM)
11597 /* -- a qualified-id with a nested-name-specifier which contains a
11598 class-name that names a dependent type or whose unqualified-id
11599 names a dependent type. */
11600 if (TREE_CODE (type) == TYPENAME_TYPE)
11602 /* -- a cv-qualified type where the cv-unqualified type is
11604 type = TYPE_MAIN_VARIANT (type);
11605 /* -- a compound type constructed from any dependent type. */
11606 if (TYPE_PTR_TO_MEMBER_P (type))
11607 return (dependent_type_p (TYPE_PTRMEM_CLASS_TYPE (type))
11608 || dependent_type_p (TYPE_PTRMEM_POINTED_TO_TYPE
11610 else if (TREE_CODE (type) == POINTER_TYPE
11611 || TREE_CODE (type) == REFERENCE_TYPE)
11612 return dependent_type_p (TREE_TYPE (type));
11613 else if (TREE_CODE (type) == FUNCTION_TYPE
11614 || TREE_CODE (type) == METHOD_TYPE)
11618 if (dependent_type_p (TREE_TYPE (type)))
11620 for (arg_type = TYPE_ARG_TYPES (type);
11622 arg_type = TREE_CHAIN (arg_type))
11623 if (dependent_type_p (TREE_VALUE (arg_type)))
11627 /* -- an array type constructed from any dependent type or whose
11628 size is specified by a constant expression that is
11629 value-dependent. */
11630 if (TREE_CODE (type) == ARRAY_TYPE)
11632 if (TYPE_DOMAIN (type)
11633 && ((value_dependent_expression_p
11634 (TYPE_MAX_VALUE (TYPE_DOMAIN (type))))
11635 || (type_dependent_expression_p
11636 (TYPE_MAX_VALUE (TYPE_DOMAIN (type))))))
11638 return dependent_type_p (TREE_TYPE (type));
11641 /* -- a template-id in which either the template name is a template
11643 if (TREE_CODE (type) == BOUND_TEMPLATE_TEMPLATE_PARM)
11645 /* ... or any of the template arguments is a dependent type or
11646 an expression that is type-dependent or value-dependent. */
11647 else if (CLASS_TYPE_P (type) && CLASSTYPE_TEMPLATE_INFO (type)
11648 && (any_dependent_template_arguments_p
11649 (INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type)))))
11652 /* All TYPEOF_TYPEs are dependent; if the argument of the `typeof'
11653 expression is not type-dependent, then it should already been
11655 if (TREE_CODE (type) == TYPEOF_TYPE)
11658 /* The standard does not specifically mention types that are local
11659 to template functions or local classes, but they should be
11660 considered dependent too. For example:
11662 template <int I> void f() {
11667 The size of `E' cannot be known until the value of `I' has been
11668 determined. Therefore, `E' must be considered dependent. */
11669 scope = TYPE_CONTEXT (type);
11670 if (scope && TYPE_P (scope))
11671 return dependent_type_p (scope);
11672 else if (scope && TREE_CODE (scope) == FUNCTION_DECL)
11673 return type_dependent_expression_p (scope);
11675 /* Other types are non-dependent. */
11679 /* Returns TRUE if TYPE is dependent, in the sense of
11680 [temp.dep.type]. */
11683 dependent_type_p (tree type)
11685 /* If there are no template parameters in scope, then there can't be
11686 any dependent types. */
11687 if (!processing_template_decl)
11690 /* If the type is NULL, we have not computed a type for the entity
11691 in question; in that case, the type is dependent. */
11695 /* Erroneous types can be considered non-dependent. */
11696 if (type == error_mark_node)
11699 /* If we have not already computed the appropriate value for TYPE,
11701 if (!TYPE_DEPENDENT_P_VALID (type))
11703 TYPE_DEPENDENT_P (type) = dependent_type_p_r (type);
11704 TYPE_DEPENDENT_P_VALID (type) = 1;
11707 return TYPE_DEPENDENT_P (type);
11710 /* Returns TRUE if EXPRESSION is dependent, according to CRITERION. */
11713 dependent_scope_ref_p (tree expression, bool criterion (tree))
11718 my_friendly_assert (TREE_CODE (expression) == SCOPE_REF, 20030714);
11720 if (!TYPE_P (TREE_OPERAND (expression, 0)))
11723 scope = TREE_OPERAND (expression, 0);
11724 name = TREE_OPERAND (expression, 1);
11728 An id-expression is type-dependent if it contains a
11729 nested-name-specifier that contains a class-name that names a
11731 /* The suggested resolution to Core Issue 2 implies that if the
11732 qualifying type is the current class, then we must peek
11735 && currently_open_class (scope)
11736 && !criterion (name))
11738 if (dependent_type_p (scope))
11744 /* Returns TRUE if the EXPRESSION is value-dependent, in the sense of
11745 [temp.dep.constexpr] */
11748 value_dependent_expression_p (tree expression)
11750 if (!processing_template_decl)
11753 /* A name declared with a dependent type. */
11754 if (TREE_CODE (expression) == IDENTIFIER_NODE
11755 || (DECL_P (expression)
11756 && type_dependent_expression_p (expression)))
11758 /* A non-type template parameter. */
11759 if ((TREE_CODE (expression) == CONST_DECL
11760 && DECL_TEMPLATE_PARM_P (expression))
11761 || TREE_CODE (expression) == TEMPLATE_PARM_INDEX)
11763 /* A constant with integral or enumeration type and is initialized
11764 with an expression that is value-dependent. */
11765 if (TREE_CODE (expression) == VAR_DECL
11766 && DECL_INITIAL (expression)
11767 && INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (expression))
11768 && value_dependent_expression_p (DECL_INITIAL (expression)))
11770 /* These expressions are value-dependent if the type to which the
11771 cast occurs is dependent or the expression being casted is
11772 value-dependent. */
11773 if (TREE_CODE (expression) == DYNAMIC_CAST_EXPR
11774 || TREE_CODE (expression) == STATIC_CAST_EXPR
11775 || TREE_CODE (expression) == CONST_CAST_EXPR
11776 || TREE_CODE (expression) == REINTERPRET_CAST_EXPR
11777 || TREE_CODE (expression) == CAST_EXPR)
11779 tree type = TREE_TYPE (expression);
11780 if (dependent_type_p (type))
11782 /* A functional cast has a list of operands. */
11783 expression = TREE_OPERAND (expression, 0);
11786 /* If there are no operands, it must be an expression such
11787 as "int()". This should not happen for aggregate types
11788 because it would form non-constant expressions. */
11789 my_friendly_assert (INTEGRAL_OR_ENUMERATION_TYPE_P (type),
11794 if (TREE_CODE (expression) == TREE_LIST)
11798 if (value_dependent_expression_p (TREE_VALUE (expression)))
11800 expression = TREE_CHAIN (expression);
11802 while (expression);
11806 return value_dependent_expression_p (expression);
11808 /* A `sizeof' expression is value-dependent if the operand is
11810 if (TREE_CODE (expression) == SIZEOF_EXPR
11811 || TREE_CODE (expression) == ALIGNOF_EXPR)
11813 expression = TREE_OPERAND (expression, 0);
11814 if (TYPE_P (expression))
11815 return dependent_type_p (expression);
11816 return type_dependent_expression_p (expression);
11818 if (TREE_CODE (expression) == SCOPE_REF)
11819 return dependent_scope_ref_p (expression, value_dependent_expression_p);
11820 if (TREE_CODE (expression) == COMPONENT_REF)
11821 return (value_dependent_expression_p (TREE_OPERAND (expression, 0))
11822 || value_dependent_expression_p (TREE_OPERAND (expression, 1)));
11823 /* A constant expression is value-dependent if any subexpression is
11824 value-dependent. */
11825 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (expression))))
11827 switch (TREE_CODE_CLASS (TREE_CODE (expression)))
11830 return (value_dependent_expression_p
11831 (TREE_OPERAND (expression, 0)));
11834 return ((value_dependent_expression_p
11835 (TREE_OPERAND (expression, 0)))
11836 || (value_dependent_expression_p
11837 (TREE_OPERAND (expression, 1))));
11841 for (i = 0; i < first_rtl_op (TREE_CODE (expression)); ++i)
11842 /* In some cases, some of the operands may be missing.
11843 (For example, in the case of PREDECREMENT_EXPR, the
11844 amount to increment by may be missing.) That doesn't
11845 make the expression dependent. */
11846 if (TREE_OPERAND (expression, i)
11847 && (value_dependent_expression_p
11848 (TREE_OPERAND (expression, i))))
11855 /* The expression is not value-dependent. */
11859 /* Returns TRUE if the EXPRESSION is type-dependent, in the sense of
11860 [temp.dep.expr]. */
11863 type_dependent_expression_p (tree expression)
11865 if (!processing_template_decl)
11868 if (expression == error_mark_node)
11871 /* An unresolved name is always dependent. */
11872 if (TREE_CODE (expression) == IDENTIFIER_NODE)
11875 /* Some expression forms are never type-dependent. */
11876 if (TREE_CODE (expression) == PSEUDO_DTOR_EXPR
11877 || TREE_CODE (expression) == SIZEOF_EXPR
11878 || TREE_CODE (expression) == ALIGNOF_EXPR
11879 || TREE_CODE (expression) == TYPEID_EXPR
11880 || TREE_CODE (expression) == DELETE_EXPR
11881 || TREE_CODE (expression) == VEC_DELETE_EXPR
11882 || TREE_CODE (expression) == THROW_EXPR)
11885 /* The types of these expressions depends only on the type to which
11886 the cast occurs. */
11887 if (TREE_CODE (expression) == DYNAMIC_CAST_EXPR
11888 || TREE_CODE (expression) == STATIC_CAST_EXPR
11889 || TREE_CODE (expression) == CONST_CAST_EXPR
11890 || TREE_CODE (expression) == REINTERPRET_CAST_EXPR
11891 || TREE_CODE (expression) == CAST_EXPR)
11892 return dependent_type_p (TREE_TYPE (expression));
11894 /* The types of these expressions depends only on the type created
11895 by the expression. */
11896 if (TREE_CODE (expression) == NEW_EXPR
11897 || TREE_CODE (expression) == VEC_NEW_EXPR)
11899 /* For NEW_EXPR tree nodes created inside a template, either
11900 the object type itself or a TREE_LIST may appear as the
11902 tree type = TREE_OPERAND (expression, 1);
11903 if (TREE_CODE (type) == TREE_LIST)
11904 /* This is an array type. We need to check array dimensions
11906 return dependent_type_p (TREE_VALUE (TREE_PURPOSE (type)))
11907 || value_dependent_expression_p
11908 (TREE_OPERAND (TREE_VALUE (type), 1));
11910 return dependent_type_p (type);
11913 if (TREE_CODE (expression) == SCOPE_REF
11914 && dependent_scope_ref_p (expression,
11915 type_dependent_expression_p))
11918 if (TREE_CODE (expression) == FUNCTION_DECL
11919 && DECL_LANG_SPECIFIC (expression)
11920 && DECL_TEMPLATE_INFO (expression)
11921 && (any_dependent_template_arguments_p
11922 (INNERMOST_TEMPLATE_ARGS (DECL_TI_ARGS (expression)))))
11925 if (TREE_CODE (expression) == TEMPLATE_DECL
11926 && !DECL_TEMPLATE_TEMPLATE_PARM_P (expression))
11929 if (TREE_TYPE (expression) == unknown_type_node)
11931 if (TREE_CODE (expression) == ADDR_EXPR)
11932 return type_dependent_expression_p (TREE_OPERAND (expression, 0));
11933 if (TREE_CODE (expression) == COMPONENT_REF
11934 || TREE_CODE (expression) == OFFSET_REF)
11936 if (type_dependent_expression_p (TREE_OPERAND (expression, 0)))
11938 expression = TREE_OPERAND (expression, 1);
11939 if (TREE_CODE (expression) == IDENTIFIER_NODE)
11943 if (TREE_CODE (expression) == BASELINK)
11944 expression = BASELINK_FUNCTIONS (expression);
11945 if (TREE_CODE (expression) == TEMPLATE_ID_EXPR)
11947 if (any_dependent_template_arguments_p
11948 (TREE_OPERAND (expression, 1)))
11950 expression = TREE_OPERAND (expression, 0);
11952 if (TREE_CODE (expression) == OVERLOAD)
11956 if (type_dependent_expression_p (OVL_CURRENT (expression)))
11958 expression = OVL_NEXT (expression);
11965 return (dependent_type_p (TREE_TYPE (expression)));
11968 /* Returns TRUE if ARGS (a TREE_LIST of arguments to a function call)
11969 contains a type-dependent expression. */
11972 any_type_dependent_arguments_p (tree args)
11976 tree arg = TREE_VALUE (args);
11978 if (type_dependent_expression_p (arg))
11980 args = TREE_CHAIN (args);
11985 /* Returns TRUE if the ARG (a template argument) is dependent. */
11988 dependent_template_arg_p (tree arg)
11990 if (!processing_template_decl)
11993 if (TREE_CODE (arg) == TEMPLATE_DECL
11994 || TREE_CODE (arg) == TEMPLATE_TEMPLATE_PARM)
11995 return dependent_template_p (arg);
11996 else if (TYPE_P (arg))
11997 return dependent_type_p (arg);
11999 return (type_dependent_expression_p (arg)
12000 || value_dependent_expression_p (arg));
12003 /* Returns true if ARGS (a collection of template arguments) contains
12004 any dependent arguments. */
12007 any_dependent_template_arguments_p (tree args)
12015 for (i = 0; i < TMPL_ARGS_DEPTH (args); ++i)
12017 tree level = TMPL_ARGS_LEVEL (args, i + 1);
12018 for (j = 0; j < TREE_VEC_LENGTH (level); ++j)
12019 if (dependent_template_arg_p (TREE_VEC_ELT (level, j)))
12026 /* Returns TRUE if the template TMPL is dependent. */
12029 dependent_template_p (tree tmpl)
12031 if (TREE_CODE (tmpl) == OVERLOAD)
12035 if (dependent_template_p (OVL_FUNCTION (tmpl)))
12037 tmpl = OVL_CHAIN (tmpl);
12042 /* Template template parameters are dependent. */
12043 if (DECL_TEMPLATE_TEMPLATE_PARM_P (tmpl)
12044 || TREE_CODE (tmpl) == TEMPLATE_TEMPLATE_PARM)
12046 /* So are qualified names that have not been looked up. */
12047 if (TREE_CODE (tmpl) == SCOPE_REF)
12049 /* So are member templates of dependent classes. */
12050 if (TYPE_P (CP_DECL_CONTEXT (tmpl)))
12051 return dependent_type_p (DECL_CONTEXT (tmpl));
12055 /* Returns TRUE if the specialization TMPL<ARGS> is dependent. */
12058 dependent_template_id_p (tree tmpl, tree args)
12060 return (dependent_template_p (tmpl)
12061 || any_dependent_template_arguments_p (args));
12064 /* TYPE is a TYPENAME_TYPE. Returns the ordinary TYPE to which the
12065 TYPENAME_TYPE corresponds. Returns ERROR_MARK_NODE if no such TYPE
12066 can be found. Note that this function peers inside uninstantiated
12067 templates and therefore should be used only in extremely limited
12071 resolve_typename_type (tree type, bool only_current_p)
12079 my_friendly_assert (TREE_CODE (type) == TYPENAME_TYPE,
12082 scope = TYPE_CONTEXT (type);
12083 name = TYPE_IDENTIFIER (type);
12085 /* If the SCOPE is itself a TYPENAME_TYPE, then we need to resolve
12086 it first before we can figure out what NAME refers to. */
12087 if (TREE_CODE (scope) == TYPENAME_TYPE)
12088 scope = resolve_typename_type (scope, only_current_p);
12089 /* If we don't know what SCOPE refers to, then we cannot resolve the
12091 if (scope == error_mark_node || TREE_CODE (scope) == TYPENAME_TYPE)
12092 return error_mark_node;
12093 /* If the SCOPE is a template type parameter, we have no way of
12094 resolving the name. */
12095 if (TREE_CODE (scope) == TEMPLATE_TYPE_PARM)
12097 /* If the SCOPE is not the current instantiation, there's no reason
12098 to look inside it. */
12099 if (only_current_p && !currently_open_class (scope))
12100 return error_mark_node;
12101 /* If SCOPE is a partial instantiation, it will not have a valid
12102 TYPE_FIELDS list, so use the original template. */
12103 scope = CLASSTYPE_PRIMARY_TEMPLATE_TYPE (scope);
12104 /* Enter the SCOPE so that name lookup will be resolved as if we
12105 were in the class definition. In particular, SCOPE will no
12106 longer be considered a dependent type. */
12107 pop_p = push_scope (scope);
12108 /* Look up the declaration. */
12109 decl = lookup_member (scope, name, /*protect=*/0, /*want_type=*/true);
12110 /* Obtain the set of qualifiers applied to the TYPE. */
12111 quals = cp_type_quals (type);
12112 /* For a TYPENAME_TYPE like "typename X::template Y<T>", we want to
12113 find a TEMPLATE_DECL. Otherwise, we want to find a TYPE_DECL. */
12115 type = error_mark_node;
12116 else if (TREE_CODE (TYPENAME_TYPE_FULLNAME (type)) == IDENTIFIER_NODE
12117 && TREE_CODE (decl) == TYPE_DECL)
12118 type = TREE_TYPE (decl);
12119 else if (TREE_CODE (TYPENAME_TYPE_FULLNAME (type)) == TEMPLATE_ID_EXPR
12120 && DECL_CLASS_TEMPLATE_P (decl))
12124 /* Obtain the template and the arguments. */
12125 tmpl = TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type), 0);
12126 args = TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type), 1);
12127 /* Instantiate the template. */
12128 type = lookup_template_class (tmpl, args, NULL_TREE, NULL_TREE,
12129 /*entering_scope=*/0, tf_error | tf_user);
12132 type = error_mark_node;
12133 /* Qualify the resulting type. */
12134 if (type != error_mark_node && quals)
12135 type = cp_build_qualified_type (type, quals);
12136 /* Leave the SCOPE. */
12143 /* EXPR is an expression which is not type-dependent. Return a proxy
12144 for EXPR that can be used to compute the types of larger
12145 expressions containing EXPR. */
12148 build_non_dependent_expr (tree expr)
12150 /* Preserve null pointer constants so that the type of things like
12151 "p == 0" where "p" is a pointer can be determined. */
12152 if (null_ptr_cst_p (expr))
12154 /* Preserve OVERLOADs; the functions must be available to resolve
12156 if (TREE_CODE (expr) == OVERLOAD
12157 || TREE_CODE (expr) == FUNCTION_DECL
12158 || TREE_CODE (expr) == TEMPLATE_DECL)
12160 /* Preserve string constants; conversions from string constants to
12161 "char *" are allowed, even though normally a "const char *"
12162 cannot be used to initialize a "char *". */
12163 if (TREE_CODE (expr) == STRING_CST)
12165 /* Preserve arithmetic constants, as an optimization -- there is no
12166 reason to create a new node. */
12167 if (TREE_CODE (expr) == INTEGER_CST || TREE_CODE (expr) == REAL_CST)
12169 /* Preserve THROW_EXPRs -- all throw-expressions have type "void".
12170 There is at least one place where we want to know that a
12171 particular expression is a throw-expression: when checking a ?:
12172 expression, there are special rules if the second or third
12173 argument is a throw-expression. */
12174 if (TREE_CODE (expr) == THROW_EXPR)
12177 if (TREE_CODE (expr) == COND_EXPR)
12178 return build (COND_EXPR,
12180 TREE_OPERAND (expr, 0),
12181 (TREE_OPERAND (expr, 1)
12182 ? build_non_dependent_expr (TREE_OPERAND (expr, 1))
12183 : build_non_dependent_expr (TREE_OPERAND (expr, 0))),
12184 build_non_dependent_expr (TREE_OPERAND (expr, 2)));
12185 if (TREE_CODE (expr) == COMPOUND_EXPR
12186 && !COMPOUND_EXPR_OVERLOADED (expr))
12187 return build (COMPOUND_EXPR,
12189 TREE_OPERAND (expr, 0),
12190 build_non_dependent_expr (TREE_OPERAND (expr, 1)));
12192 /* Otherwise, build a NON_DEPENDENT_EXPR.
12194 REFERENCE_TYPEs are not stripped for expressions in templates
12195 because doing so would play havoc with mangling. Consider, for
12198 template <typename T> void f<T& g>() { g(); }
12200 In the body of "f", the expression for "g" will have
12201 REFERENCE_TYPE, even though the standard says that it should
12202 not. The reason is that we must preserve the syntactic form of
12203 the expression so that mangling (say) "f<g>" inside the body of
12204 "f" works out correctly. Therefore, the REFERENCE_TYPE is
12206 return build1 (NON_DEPENDENT_EXPR, non_reference (TREE_TYPE (expr)), expr);
12209 /* ARGS is a TREE_LIST of expressions as arguments to a function call.
12210 Return a new TREE_LIST with the various arguments replaced with
12211 equivalent non-dependent expressions. */
12214 build_non_dependent_args (tree args)
12219 new_args = NULL_TREE;
12220 for (a = args; a; a = TREE_CHAIN (a))
12221 new_args = tree_cons (NULL_TREE,
12222 build_non_dependent_expr (TREE_VALUE (a)),
12224 return nreverse (new_args);
12227 #include "gt-cp-pt.h"