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, 2005 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"
35 #include "pointer-set.h"
38 #include "tree-inline.h"
45 #include "tree-iterator.h"
47 /* The type of functions taking a tree, and some additional data, and
49 typedef int (*tree_fn_t
) (tree
, void*);
51 /* The PENDING_TEMPLATES is a TREE_LIST of templates whose
52 instantiations have been deferred, either because their definitions
53 were not yet available, or because we were putting off doing the work.
54 The TREE_PURPOSE of each entry is either a DECL (for a function or
55 static data member), or a TYPE (for a class) indicating what we are
56 hoping to instantiate. The TREE_VALUE is not used. */
57 static GTY(()) tree pending_templates
;
58 static GTY(()) tree last_pending_template
;
60 int processing_template_parmlist
;
61 static int template_header_count
;
63 static GTY(()) tree saved_trees
;
64 static GTY(()) varray_type inline_parm_levels
;
65 static size_t inline_parm_levels_used
;
67 static GTY(()) tree current_tinst_level
;
69 static GTY(()) tree saved_access_scope
;
71 /* Live only within one (recursive) call to tsubst_expr. We use
72 this to pass the statement expression node from the STMT_EXPR
73 to the EXPR_STMT that is its result. */
74 static tree cur_stmt_expr
;
76 /* A map from local variable declarations in the body of the template
77 presently being instantiated to the corresponding instantiated
79 static htab_t local_specializations
;
81 #define UNIFY_ALLOW_NONE 0
82 #define UNIFY_ALLOW_MORE_CV_QUAL 1
83 #define UNIFY_ALLOW_LESS_CV_QUAL 2
84 #define UNIFY_ALLOW_DERIVED 4
85 #define UNIFY_ALLOW_INTEGER 8
86 #define UNIFY_ALLOW_OUTER_LEVEL 16
87 #define UNIFY_ALLOW_OUTER_MORE_CV_QUAL 32
88 #define UNIFY_ALLOW_OUTER_LESS_CV_QUAL 64
90 static void push_access_scope (tree
);
91 static void pop_access_scope (tree
);
92 static int resolve_overloaded_unification (tree
, tree
, tree
, tree
,
93 unification_kind_t
, int);
94 static int try_one_overload (tree
, tree
, tree
, tree
, tree
,
95 unification_kind_t
, int, bool);
96 static int unify (tree
, tree
, tree
, tree
, int);
97 static void add_pending_template (tree
);
98 static void reopen_tinst_level (tree
);
99 static tree
classtype_mangled_name (tree
);
100 static char* mangle_class_name_for_template (const char *, tree
, tree
);
101 static tree
tsubst_initializer_list (tree
, tree
);
102 static tree
get_class_bindings (tree
, tree
, tree
);
103 static tree
coerce_template_parms (tree
, tree
, tree
, tsubst_flags_t
, int);
104 static void tsubst_enum (tree
, tree
, tree
);
105 static tree
add_to_template_args (tree
, tree
);
106 static tree
add_outermost_template_args (tree
, tree
);
107 static bool check_instantiated_args (tree
, tree
, tsubst_flags_t
);
108 static int maybe_adjust_types_for_deduction (unification_kind_t
, tree
*, tree
*);
109 static int type_unification_real (tree
, tree
, tree
, tree
,
110 int, unification_kind_t
, int);
111 static void note_template_header (int);
112 static tree
convert_nontype_argument_function (tree
, tree
);
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 int for_each_template_parm (tree
, tree_fn_t
, void*,
117 struct pointer_set_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_local_specialization (tree
);
122 static void register_local_specialization (tree
, tree
);
123 static tree
reduce_template_parm_level (tree
, tree
, int);
124 static int mark_template_parm (tree
, void *);
125 static int template_parm_this_level_p (tree
, void *);
126 static tree
tsubst_friend_function (tree
, tree
);
127 static tree
tsubst_friend_class (tree
, tree
);
128 static int can_complete_type_without_circularity (tree
);
129 static tree
get_bindings (tree
, tree
, tree
, bool);
130 static int template_decl_level (tree
);
131 static int check_cv_quals_for_unify (int, tree
, tree
);
132 static tree
tsubst_template_arg (tree
, tree
, tsubst_flags_t
, tree
);
133 static tree
tsubst_template_args (tree
, tree
, tsubst_flags_t
, tree
);
134 static tree
tsubst_template_parms (tree
, tree
, tsubst_flags_t
);
135 static void regenerate_decl_from_template (tree
, tree
);
136 static tree
most_specialized (tree
, tree
, tree
);
137 static tree
most_specialized_class (tree
, tree
);
138 static int template_class_depth_real (tree
, int);
139 static tree
tsubst_aggr_type (tree
, tree
, tsubst_flags_t
, tree
, int);
140 static tree
tsubst_arg_types (tree
, tree
, tsubst_flags_t
, tree
);
141 static tree
tsubst_function_type (tree
, tree
, tsubst_flags_t
, tree
);
142 static void check_specialization_scope (void);
143 static tree
process_partial_specialization (tree
);
144 static void set_current_access_from_decl (tree
);
145 static void check_default_tmpl_args (tree
, tree
, int, int);
146 static tree
tsubst_call_declarator_parms (tree
, tree
, tsubst_flags_t
, tree
);
147 static tree
get_template_base (tree
, tree
, tree
, tree
);
148 static int verify_class_unification (tree
, tree
, tree
);
149 static tree
try_class_unification (tree
, tree
, tree
, tree
);
150 static int coerce_template_template_parms (tree
, tree
, tsubst_flags_t
,
152 static tree
determine_specialization (tree
, tree
, tree
*, int, int);
153 static int template_args_equal (tree
, tree
);
154 static void tsubst_default_arguments (tree
);
155 static tree
for_each_template_parm_r (tree
*, int *, void *);
156 static tree
copy_default_args_to_explicit_spec_1 (tree
, tree
);
157 static void copy_default_args_to_explicit_spec (tree
);
158 static int invalid_nontype_parm_type_p (tree
, tsubst_flags_t
);
159 static int eq_local_specializations (const void *, const void *);
160 static bool dependent_type_p_r (tree
);
161 static tree
tsubst (tree
, tree
, tsubst_flags_t
, tree
);
162 static tree
tsubst_expr (tree
, tree
, tsubst_flags_t
, tree
);
163 static tree
tsubst_copy (tree
, tree
, tsubst_flags_t
, tree
);
165 /* Make the current scope suitable for access checking when we are
166 processing T. T can be FUNCTION_DECL for instantiated function
167 template, or VAR_DECL for static member variable (need by
168 instantiate_decl). */
171 push_access_scope (tree t
)
173 gcc_assert (TREE_CODE (t
) == FUNCTION_DECL
174 || TREE_CODE (t
) == VAR_DECL
);
176 if (DECL_FRIEND_CONTEXT (t
))
177 push_nested_class (DECL_FRIEND_CONTEXT (t
));
178 else if (DECL_CLASS_SCOPE_P (t
))
179 push_nested_class (DECL_CONTEXT (t
));
181 push_to_top_level ();
183 if (TREE_CODE (t
) == FUNCTION_DECL
)
185 saved_access_scope
= tree_cons
186 (NULL_TREE
, current_function_decl
, saved_access_scope
);
187 current_function_decl
= t
;
191 /* Restore the scope set up by push_access_scope. T is the node we
195 pop_access_scope (tree t
)
197 if (TREE_CODE (t
) == FUNCTION_DECL
)
199 current_function_decl
= TREE_VALUE (saved_access_scope
);
200 saved_access_scope
= TREE_CHAIN (saved_access_scope
);
203 if (DECL_FRIEND_CONTEXT (t
) || DECL_CLASS_SCOPE_P (t
))
206 pop_from_top_level ();
209 /* Do any processing required when DECL (a member template
210 declaration) is finished. Returns the TEMPLATE_DECL corresponding
211 to DECL, unless it is a specialization, in which case the DECL
212 itself is returned. */
215 finish_member_template_decl (tree decl
)
217 if (decl
== error_mark_node
)
218 return error_mark_node
;
220 gcc_assert (DECL_P (decl
));
222 if (TREE_CODE (decl
) == TYPE_DECL
)
226 type
= TREE_TYPE (decl
);
227 if (IS_AGGR_TYPE (type
)
228 && CLASSTYPE_TEMPLATE_INFO (type
)
229 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (type
))
231 tree tmpl
= CLASSTYPE_TI_TEMPLATE (type
);
232 check_member_template (tmpl
);
237 else if (TREE_CODE (decl
) == FIELD_DECL
)
238 error ("data member %qD cannot be a member template", decl
);
239 else if (DECL_TEMPLATE_INFO (decl
))
241 if (!DECL_TEMPLATE_SPECIALIZATION (decl
))
243 check_member_template (DECL_TI_TEMPLATE (decl
));
244 return DECL_TI_TEMPLATE (decl
);
250 error ("invalid member template declaration %qD", decl
);
252 return error_mark_node
;
255 /* Returns the template nesting level of the indicated class TYPE.
265 A<T>::B<U> has depth two, while A<T> has depth one.
266 Both A<T>::B<int> and A<int>::B<U> have depth one, if
267 COUNT_SPECIALIZATIONS is 0 or if they are instantiations, not
270 This function is guaranteed to return 0 if passed NULL_TREE so
271 that, for example, `template_class_depth (current_class_type)' is
275 template_class_depth_real (tree type
, int count_specializations
)
280 type
&& TREE_CODE (type
) != NAMESPACE_DECL
;
281 type
= (TREE_CODE (type
) == FUNCTION_DECL
)
282 ? CP_DECL_CONTEXT (type
) : TYPE_CONTEXT (type
))
284 if (TREE_CODE (type
) != FUNCTION_DECL
)
286 if (CLASSTYPE_TEMPLATE_INFO (type
)
287 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (type
))
288 && ((count_specializations
289 && CLASSTYPE_TEMPLATE_SPECIALIZATION (type
))
290 || uses_template_parms (CLASSTYPE_TI_ARGS (type
))))
295 if (DECL_TEMPLATE_INFO (type
)
296 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (type
))
297 && ((count_specializations
298 && DECL_TEMPLATE_SPECIALIZATION (type
))
299 || uses_template_parms (DECL_TI_ARGS (type
))))
307 /* Returns the template nesting level of the indicated class TYPE.
308 Like template_class_depth_real, but instantiations do not count in
312 template_class_depth (tree type
)
314 return template_class_depth_real (type
, /*count_specializations=*/0);
317 /* Returns 1 if processing DECL as part of do_pending_inlines
318 needs us to push template parms. */
321 inline_needs_template_parms (tree decl
)
323 if (! DECL_TEMPLATE_INFO (decl
))
326 return (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (most_general_template (decl
)))
327 > (processing_template_decl
+ DECL_TEMPLATE_SPECIALIZATION (decl
)));
330 /* Subroutine of maybe_begin_member_template_processing.
331 Push the template parms in PARMS, starting from LEVELS steps into the
332 chain, and ending at the beginning, since template parms are listed
336 push_inline_template_parms_recursive (tree parmlist
, int levels
)
338 tree parms
= TREE_VALUE (parmlist
);
342 push_inline_template_parms_recursive (TREE_CHAIN (parmlist
), levels
- 1);
344 ++processing_template_decl
;
345 current_template_parms
346 = tree_cons (size_int (processing_template_decl
),
347 parms
, current_template_parms
);
348 TEMPLATE_PARMS_FOR_INLINE (current_template_parms
) = 1;
350 begin_scope (TREE_VEC_LENGTH (parms
) ? sk_template_parms
: sk_template_spec
,
352 for (i
= 0; i
< TREE_VEC_LENGTH (parms
); ++i
)
354 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
355 gcc_assert (DECL_P (parm
));
357 switch (TREE_CODE (parm
))
366 /* Make a CONST_DECL as is done in process_template_parm.
367 It is ugly that we recreate this here; the original
368 version built in process_template_parm is no longer
370 tree decl
= build_decl (CONST_DECL
, DECL_NAME (parm
),
372 DECL_ARTIFICIAL (decl
) = 1;
373 TREE_CONSTANT (decl
) = 1;
374 TREE_INVARIANT (decl
) = 1;
375 TREE_READONLY (decl
) = 1;
376 DECL_INITIAL (decl
) = DECL_INITIAL (parm
);
377 SET_DECL_TEMPLATE_PARM_P (decl
);
388 /* Restore the template parameter context for a member template or
389 a friend template defined in a class definition. */
392 maybe_begin_member_template_processing (tree decl
)
397 if (inline_needs_template_parms (decl
))
399 parms
= DECL_TEMPLATE_PARMS (most_general_template (decl
));
400 levels
= TMPL_PARMS_DEPTH (parms
) - processing_template_decl
;
402 if (DECL_TEMPLATE_SPECIALIZATION (decl
))
405 parms
= TREE_CHAIN (parms
);
408 push_inline_template_parms_recursive (parms
, levels
);
411 /* Remember how many levels of template parameters we pushed so that
412 we can pop them later. */
413 if (!inline_parm_levels
)
414 VARRAY_INT_INIT (inline_parm_levels
, 4, "inline_parm_levels");
415 if (inline_parm_levels_used
== inline_parm_levels
->num_elements
)
416 VARRAY_GROW (inline_parm_levels
, 2 * inline_parm_levels_used
);
417 VARRAY_INT (inline_parm_levels
, inline_parm_levels_used
) = levels
;
418 ++inline_parm_levels_used
;
421 /* Undo the effects of begin_member_template_processing. */
424 maybe_end_member_template_processing (void)
428 if (!inline_parm_levels_used
)
431 --inline_parm_levels_used
;
433 i
< VARRAY_INT (inline_parm_levels
, inline_parm_levels_used
);
436 --processing_template_decl
;
437 current_template_parms
= TREE_CHAIN (current_template_parms
);
442 /* Return a new template argument vector which contains all of ARGS,
443 but has as its innermost set of arguments the EXTRA_ARGS. */
446 add_to_template_args (tree args
, tree extra_args
)
453 extra_depth
= TMPL_ARGS_DEPTH (extra_args
);
454 new_args
= make_tree_vec (TMPL_ARGS_DEPTH (args
) + extra_depth
);
456 for (i
= 1; i
<= TMPL_ARGS_DEPTH (args
); ++i
)
457 SET_TMPL_ARGS_LEVEL (new_args
, i
, TMPL_ARGS_LEVEL (args
, i
));
459 for (j
= 1; j
<= extra_depth
; ++j
, ++i
)
460 SET_TMPL_ARGS_LEVEL (new_args
, i
, TMPL_ARGS_LEVEL (extra_args
, j
));
465 /* Like add_to_template_args, but only the outermost ARGS are added to
466 the EXTRA_ARGS. In particular, all but TMPL_ARGS_DEPTH
467 (EXTRA_ARGS) levels are added. This function is used to combine
468 the template arguments from a partial instantiation with the
469 template arguments used to attain the full instantiation from the
470 partial instantiation. */
473 add_outermost_template_args (tree args
, tree extra_args
)
477 /* If there are more levels of EXTRA_ARGS than there are ARGS,
478 something very fishy is going on. */
479 gcc_assert (TMPL_ARGS_DEPTH (args
) >= TMPL_ARGS_DEPTH (extra_args
));
481 /* If *all* the new arguments will be the EXTRA_ARGS, just return
483 if (TMPL_ARGS_DEPTH (args
) == TMPL_ARGS_DEPTH (extra_args
))
486 /* For the moment, we make ARGS look like it contains fewer levels. */
487 TREE_VEC_LENGTH (args
) -= TMPL_ARGS_DEPTH (extra_args
);
489 new_args
= add_to_template_args (args
, extra_args
);
491 /* Now, we restore ARGS to its full dimensions. */
492 TREE_VEC_LENGTH (args
) += TMPL_ARGS_DEPTH (extra_args
);
497 /* Return the N levels of innermost template arguments from the ARGS. */
500 get_innermost_template_args (tree args
, int n
)
508 /* If N is 1, just return the innermost set of template arguments. */
510 return TMPL_ARGS_LEVEL (args
, TMPL_ARGS_DEPTH (args
));
512 /* If we're not removing anything, just return the arguments we were
514 extra_levels
= TMPL_ARGS_DEPTH (args
) - n
;
515 gcc_assert (extra_levels
>= 0);
516 if (extra_levels
== 0)
519 /* Make a new set of arguments, not containing the outer arguments. */
520 new_args
= make_tree_vec (n
);
521 for (i
= 1; i
<= n
; ++i
)
522 SET_TMPL_ARGS_LEVEL (new_args
, i
,
523 TMPL_ARGS_LEVEL (args
, i
+ extra_levels
));
528 /* We've got a template header coming up; push to a new level for storing
532 begin_template_parm_list (void)
534 /* We use a non-tag-transparent scope here, which causes pushtag to
535 put tags in this scope, rather than in the enclosing class or
536 namespace scope. This is the right thing, since we want
537 TEMPLATE_DECLS, and not TYPE_DECLS for template classes. For a
538 global template class, push_template_decl handles putting the
539 TEMPLATE_DECL into top-level scope. For a nested template class,
542 template <class T> struct S1 {
543 template <class T> struct S2 {};
546 pushtag contains special code to call pushdecl_with_scope on the
547 TEMPLATE_DECL for S2. */
548 begin_scope (sk_template_parms
, NULL
);
549 ++processing_template_decl
;
550 ++processing_template_parmlist
;
551 note_template_header (0);
554 /* This routine is called when a specialization is declared. If it is
555 invalid to declare a specialization here, an error is reported. */
558 check_specialization_scope (void)
560 tree scope
= current_scope ();
564 An explicit specialization shall be declared in the namespace of
565 which the template is a member, or, for member templates, in the
566 namespace of which the enclosing class or enclosing class
567 template is a member. An explicit specialization of a member
568 function, member class or static data member of a class template
569 shall be declared in the namespace of which the class template
571 if (scope
&& TREE_CODE (scope
) != NAMESPACE_DECL
)
572 error ("explicit specialization in non-namespace scope %qD", scope
);
576 In an explicit specialization declaration for a member of a class
577 template or a member template that appears in namespace scope,
578 the member template and some of its enclosing class templates may
579 remain unspecialized, except that the declaration shall not
580 explicitly specialize a class member template if its enclosing
581 class templates are not explicitly specialized as well. */
582 if (current_template_parms
)
583 error ("enclosing class templates are not explicitly specialized");
586 /* We've just seen template <>. */
589 begin_specialization (void)
591 begin_scope (sk_template_spec
, NULL
);
592 note_template_header (1);
593 check_specialization_scope ();
596 /* Called at then end of processing a declaration preceded by
600 end_specialization (void)
603 reset_specialization ();
606 /* Any template <>'s that we have seen thus far are not referring to a
607 function specialization. */
610 reset_specialization (void)
612 processing_specialization
= 0;
613 template_header_count
= 0;
616 /* We've just seen a template header. If SPECIALIZATION is nonzero,
617 it was of the form template <>. */
620 note_template_header (int specialization
)
622 processing_specialization
= specialization
;
623 template_header_count
++;
626 /* We're beginning an explicit instantiation. */
629 begin_explicit_instantiation (void)
631 gcc_assert (!processing_explicit_instantiation
);
632 processing_explicit_instantiation
= true;
637 end_explicit_instantiation (void)
639 gcc_assert (processing_explicit_instantiation
);
640 processing_explicit_instantiation
= false;
643 /* A explicit specialization or partial specialization TMPL is being
644 declared. Check that the namespace in which the specialization is
645 occurring is permissible. Returns false iff it is invalid to
646 specialize TMPL in the current namespace. */
649 check_specialization_namespace (tree tmpl
)
651 tree tpl_ns
= decl_namespace_context (tmpl
);
655 An explicit specialization shall be declared in the namespace of
656 which the template is a member, or, for member templates, in the
657 namespace of which the enclosing class or enclosing class
658 template is a member. An explicit specialization of a member
659 function, member class or static data member of a class template
660 shall be declared in the namespace of which the class template is
662 if (is_associated_namespace (current_namespace
, tpl_ns
))
663 /* Same or super-using namespace. */
667 pedwarn ("specialization of %qD in different namespace", tmpl
);
668 cp_pedwarn_at (" from definition of %q#D", tmpl
);
673 /* The TYPE is being declared. If it is a template type, that means it
674 is a partial specialization. Do appropriate error-checking. */
677 maybe_process_partial_specialization (tree type
)
679 /* TYPE maybe an ERROR_MARK_NODE. */
680 tree context
= TYPE_P (type
) ? TYPE_CONTEXT (type
) : NULL_TREE
;
682 if (CLASS_TYPE_P (type
) && CLASSTYPE_USE_TEMPLATE (type
))
684 /* This is for ordinary explicit specialization and partial
685 specialization of a template class such as:
687 template <> class C<int>;
691 template <class T> class C<T*>;
693 Make sure that `C<int>' and `C<T*>' are implicit instantiations. */
695 if (CLASSTYPE_IMPLICIT_INSTANTIATION (type
)
696 && !COMPLETE_TYPE_P (type
))
698 check_specialization_namespace (CLASSTYPE_TI_TEMPLATE (type
));
699 SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (type
);
700 if (processing_template_decl
)
701 push_template_decl (TYPE_MAIN_DECL (type
));
703 else if (CLASSTYPE_TEMPLATE_INSTANTIATION (type
))
704 error ("specialization of %qT after instantiation", type
);
706 else if (CLASS_TYPE_P (type
)
707 && !CLASSTYPE_USE_TEMPLATE (type
)
708 && CLASSTYPE_TEMPLATE_INFO (type
)
709 && context
&& CLASS_TYPE_P (context
)
710 && CLASSTYPE_TEMPLATE_INFO (context
))
712 /* This is for an explicit specialization of member class
713 template according to [temp.expl.spec/18]:
715 template <> template <class U> class C<int>::D;
717 The context `C<int>' must be an implicit instantiation.
718 Otherwise this is just a member class template declared
721 template <> class C<int> { template <class U> class D; };
722 template <> template <class U> class C<int>::D;
724 In the first case, `C<int>::D' is a specialization of `C<T>::D'
725 while in the second case, `C<int>::D' is a primary template
726 and `C<T>::D' may not exist. */
728 if (CLASSTYPE_IMPLICIT_INSTANTIATION (context
)
729 && !COMPLETE_TYPE_P (type
))
733 if (current_namespace
734 != decl_namespace_context (CLASSTYPE_TI_TEMPLATE (type
)))
736 pedwarn ("specializing %q#T in different namespace", type
);
737 cp_pedwarn_at (" from definition of %q#D",
738 CLASSTYPE_TI_TEMPLATE (type
));
741 /* Check for invalid specialization after instantiation:
743 template <> template <> class C<int>::D<int>;
744 template <> template <class U> class C<int>::D; */
746 for (t
= DECL_TEMPLATE_INSTANTIATIONS
747 (most_general_template (CLASSTYPE_TI_TEMPLATE (type
)));
748 t
; t
= TREE_CHAIN (t
))
749 if (TREE_VALUE (t
) != type
750 && TYPE_CONTEXT (TREE_VALUE (t
)) == context
)
751 error ("specialization %qT after instantiation %qT",
752 type
, TREE_VALUE (t
));
754 /* Mark TYPE as a specialization. And as a result, we only
755 have one level of template argument for the innermost
757 SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (type
);
758 CLASSTYPE_TI_ARGS (type
)
759 = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type
));
762 else if (processing_specialization
)
763 error ("explicit specialization of non-template %qT", type
);
766 /* Returns nonzero if we can optimize the retrieval of specializations
767 for TMPL, a TEMPLATE_DECL. In particular, for such a template, we
768 do not use DECL_TEMPLATE_SPECIALIZATIONS at all. */
771 optimize_specialization_lookup_p (tree tmpl
)
773 return (DECL_FUNCTION_TEMPLATE_P (tmpl
)
774 && DECL_CLASS_SCOPE_P (tmpl
)
775 /* DECL_CLASS_SCOPE_P holds of T::f even if T is a template
777 && CLASS_TYPE_P (DECL_CONTEXT (tmpl
))
778 /* The optimized lookup depends on the fact that the
779 template arguments for the member function template apply
780 purely to the containing class, which is not true if the
781 containing class is an explicit or partial
783 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (tmpl
))
784 && !DECL_MEMBER_TEMPLATE_P (tmpl
)
785 && !DECL_CONV_FN_P (tmpl
)
786 /* It is possible to have a template that is not a member
787 template and is not a member of a template class:
789 template <typename T>
790 struct S { friend A::f(); };
792 Here, the friend function is a template, but the context does
793 not have template information. The optimized lookup relies
794 on having ARGS be the template arguments for both the class
795 and the function template. */
796 && !DECL_FRIEND_P (DECL_TEMPLATE_RESULT (tmpl
)));
799 /* Retrieve the specialization (in the sense of [temp.spec] - a
800 specialization is either an instantiation or an explicit
801 specialization) of TMPL for the given template ARGS. If there is
802 no such specialization, return NULL_TREE. The ARGS are a vector of
803 arguments, or a vector of vectors of arguments, in the case of
804 templates with more than one level of parameters.
806 If TMPL is a type template and CLASS_SPECIALIZATIONS_P is true,
807 then we search for a partial specialization matching ARGS. This
808 parameter is ignored if TMPL is not a class template. */
811 retrieve_specialization (tree tmpl
, tree args
,
812 bool class_specializations_p
)
814 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
);
816 /* There should be as many levels of arguments as there are
817 levels of parameters. */
818 gcc_assert (TMPL_ARGS_DEPTH (args
)
819 == TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
)));
821 if (optimize_specialization_lookup_p (tmpl
))
824 tree class_specialization
;
825 VEC(tree
,gc
) *methods
;
829 /* The template arguments actually apply to the containing
830 class. Find the class specialization with those
832 class_template
= CLASSTYPE_TI_TEMPLATE (DECL_CONTEXT (tmpl
));
834 = retrieve_specialization (class_template
, args
,
835 /*class_specializations_p=*/false);
836 if (!class_specialization
)
838 /* Now, find the appropriate entry in the CLASSTYPE_METHOD_VEC
839 for the specialization. */
840 idx
= class_method_index_for_fn (class_specialization
, tmpl
);
843 /* Iterate through the methods with the indicated name, looking
844 for the one that has an instance of TMPL. */
845 methods
= CLASSTYPE_METHOD_VEC (class_specialization
);
846 for (fns
= VEC_index (tree
, methods
, idx
); fns
; fns
= OVL_NEXT (fns
))
848 tree fn
= OVL_CURRENT (fns
);
849 if (DECL_TEMPLATE_INFO (fn
) && DECL_TI_TEMPLATE (fn
) == tmpl
)
859 /* Class templates store their instantiations on the
860 DECL_TEMPLATE_INSTANTIATIONS list; other templates use the
861 DECL_TEMPLATE_SPECIALIZATIONS list. */
862 if (!class_specializations_p
863 && TREE_CODE (DECL_TEMPLATE_RESULT (tmpl
)) == TYPE_DECL
)
864 sp
= &DECL_TEMPLATE_INSTANTIATIONS (tmpl
);
866 sp
= &DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
868 /* Iterate through the list until we find a matching template. */
869 while (*sp
!= NULL_TREE
)
873 if (comp_template_args (TREE_PURPOSE (spec
), args
))
875 /* Use the move-to-front heuristic to speed up future
879 *sp
= TREE_CHAIN (*sp
);
880 TREE_CHAIN (spec
) = *head
;
883 return TREE_VALUE (spec
);
885 sp
= &TREE_CHAIN (spec
);
892 /* Like retrieve_specialization, but for local declarations. */
895 retrieve_local_specialization (tree tmpl
)
897 tree spec
= htab_find_with_hash (local_specializations
, tmpl
,
898 htab_hash_pointer (tmpl
));
899 return spec
? TREE_PURPOSE (spec
) : NULL_TREE
;
902 /* Returns nonzero iff DECL is a specialization of TMPL. */
905 is_specialization_of (tree decl
, tree tmpl
)
909 if (TREE_CODE (decl
) == FUNCTION_DECL
)
913 t
= DECL_TEMPLATE_INFO (t
) ? DECL_TI_TEMPLATE (t
) : NULL_TREE
)
919 gcc_assert (TREE_CODE (decl
) == TYPE_DECL
);
921 for (t
= TREE_TYPE (decl
);
923 t
= CLASSTYPE_USE_TEMPLATE (t
)
924 ? TREE_TYPE (CLASSTYPE_TI_TEMPLATE (t
)) : NULL_TREE
)
925 if (same_type_ignoring_top_level_qualifiers_p (t
, TREE_TYPE (tmpl
)))
932 /* Returns nonzero iff DECL is a specialization of friend declaration
933 FRIEND according to [temp.friend]. */
936 is_specialization_of_friend (tree decl
, tree
friend)
938 bool need_template
= true;
941 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
942 || TREE_CODE (decl
) == TYPE_DECL
);
944 /* For [temp.friend/6] when FRIEND is an ordinary member function
945 of a template class, we want to check if DECL is a specialization
947 if (TREE_CODE (friend) == FUNCTION_DECL
948 && DECL_TEMPLATE_INFO (friend)
949 && !DECL_USE_TEMPLATE (friend))
951 /* We want a TEMPLATE_DECL for `is_specialization_of'. */
952 friend = DECL_TI_TEMPLATE (friend);
953 need_template
= false;
955 else if (TREE_CODE (friend) == TEMPLATE_DECL
956 && !PRIMARY_TEMPLATE_P (friend))
957 need_template
= false;
959 /* There is nothing to do if this is not a template friend. */
960 if (TREE_CODE (friend) != TEMPLATE_DECL
)
963 if (is_specialization_of (decl
, friend))
967 A member of a class template may be declared to be a friend of a
968 non-template class. In this case, the corresponding member of
969 every specialization of the class template is a friend of the
970 class granting friendship.
972 For example, given a template friend declaration
974 template <class T> friend void A<T>::f();
976 the member function below is considered a friend
978 template <> struct A<int> {
982 For this type of template friend, TEMPLATE_DEPTH below will be
983 nonzero. To determine if DECL is a friend of FRIEND, we first
984 check if the enclosing class is a specialization of another. */
986 template_depth
= template_class_depth (DECL_CONTEXT (friend));
988 && DECL_CLASS_SCOPE_P (decl
)
989 && is_specialization_of (TYPE_NAME (DECL_CONTEXT (decl
)),
990 CLASSTYPE_TI_TEMPLATE (DECL_CONTEXT (friend))))
992 /* Next, we check the members themselves. In order to handle
993 a few tricky cases, such as when FRIEND's are
995 template <class T> friend void A<T>::g(T t);
996 template <class T> template <T t> friend void A<T>::h();
1000 void A<int>::g(int);
1001 template <int> void A<int>::h();
1003 we need to figure out ARGS, the template arguments from
1004 the context of DECL. This is required for template substitution
1005 of `T' in the function parameter of `g' and template parameter
1006 of `h' in the above examples. Here ARGS corresponds to `int'. */
1008 tree context
= DECL_CONTEXT (decl
);
1009 tree args
= NULL_TREE
;
1010 int current_depth
= 0;
1012 while (current_depth
< template_depth
)
1014 if (CLASSTYPE_TEMPLATE_INFO (context
))
1016 if (current_depth
== 0)
1017 args
= TYPE_TI_ARGS (context
);
1019 args
= add_to_template_args (TYPE_TI_ARGS (context
), args
);
1022 context
= TYPE_CONTEXT (context
);
1025 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1030 tree friend_args_type
;
1031 tree decl_args_type
;
1033 /* Make sure that both DECL and FRIEND are templates or
1035 is_template
= DECL_TEMPLATE_INFO (decl
)
1036 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl
));
1037 if (need_template
^ is_template
)
1039 else if (is_template
)
1041 /* If both are templates, check template parameter list. */
1043 = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend),
1045 if (!comp_template_parms
1046 (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (decl
)),
1050 decl_type
= TREE_TYPE (DECL_TI_TEMPLATE (decl
));
1053 decl_type
= TREE_TYPE (decl
);
1055 friend_type
= tsubst_function_type (TREE_TYPE (friend), args
,
1056 tf_none
, NULL_TREE
);
1057 if (friend_type
== error_mark_node
)
1060 /* Check if return types match. */
1061 if (!same_type_p (TREE_TYPE (decl_type
), TREE_TYPE (friend_type
)))
1064 /* Check if function parameter types match, ignoring the
1065 `this' parameter. */
1066 friend_args_type
= TYPE_ARG_TYPES (friend_type
);
1067 decl_args_type
= TYPE_ARG_TYPES (decl_type
);
1068 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (friend))
1069 friend_args_type
= TREE_CHAIN (friend_args_type
);
1070 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
1071 decl_args_type
= TREE_CHAIN (decl_args_type
);
1073 return compparms (decl_args_type
, friend_args_type
);
1077 /* DECL is a TYPE_DECL */
1079 tree decl_type
= TREE_TYPE (decl
);
1081 /* Make sure that both DECL and FRIEND are templates or
1084 = CLASSTYPE_TEMPLATE_INFO (decl_type
)
1085 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (decl_type
));
1087 if (need_template
^ is_template
)
1089 else if (is_template
)
1092 /* If both are templates, check the name of the two
1093 TEMPLATE_DECL's first because is_friend didn't. */
1094 if (DECL_NAME (CLASSTYPE_TI_TEMPLATE (decl_type
))
1095 != DECL_NAME (friend))
1098 /* Now check template parameter list. */
1100 = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend),
1102 return comp_template_parms
1103 (DECL_TEMPLATE_PARMS (CLASSTYPE_TI_TEMPLATE (decl_type
)),
1107 return (DECL_NAME (decl
)
1108 == DECL_NAME (friend));
1114 /* Register the specialization SPEC as a specialization of TMPL with
1115 the indicated ARGS. Returns SPEC, or an equivalent prior
1116 declaration, if available. */
1119 register_specialization (tree spec
, tree tmpl
, tree args
)
1123 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
);
1125 if (TREE_CODE (spec
) == FUNCTION_DECL
1126 && uses_template_parms (DECL_TI_ARGS (spec
)))
1127 /* This is the FUNCTION_DECL for a partial instantiation. Don't
1128 register it; we want the corresponding TEMPLATE_DECL instead.
1129 We use `uses_template_parms (DECL_TI_ARGS (spec))' rather than
1130 the more obvious `uses_template_parms (spec)' to avoid problems
1131 with default function arguments. In particular, given
1132 something like this:
1134 template <class T> void f(T t1, T t = T())
1136 the default argument expression is not substituted for in an
1137 instantiation unless and until it is actually needed. */
1140 /* There should be as many levels of arguments as there are
1141 levels of parameters. */
1142 gcc_assert (TMPL_ARGS_DEPTH (args
)
1143 == TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
)));
1145 fn
= retrieve_specialization (tmpl
, args
,
1146 /*class_specializations_p=*/false);
1147 /* We can sometimes try to re-register a specialization that we've
1148 already got. In particular, regenerate_decl_from_template calls
1149 duplicate_decls which will update the specialization list. But,
1150 we'll still get called again here anyhow. It's more convenient
1151 to simply allow this than to try to prevent it. */
1154 else if (fn
&& DECL_TEMPLATE_SPECIALIZATION (spec
))
1156 if (DECL_TEMPLATE_INSTANTIATION (fn
))
1159 || DECL_EXPLICIT_INSTANTIATION (fn
))
1161 error ("specialization of %qD after instantiation",
1167 /* This situation should occur only if the first
1168 specialization is an implicit instantiation, the
1169 second is an explicit specialization, and the
1170 implicit instantiation has not yet been used. That
1171 situation can occur if we have implicitly
1172 instantiated a member function and then specialized
1175 We can also wind up here if a friend declaration that
1176 looked like an instantiation turns out to be a
1179 template <class T> void foo(T);
1180 class S { friend void foo<>(int) };
1181 template <> void foo(int);
1183 We transform the existing DECL in place so that any
1184 pointers to it become pointers to the updated
1187 If there was a definition for the template, but not
1188 for the specialization, we want this to look as if
1189 there were no definition, and vice versa. */
1190 DECL_INITIAL (fn
) = NULL_TREE
;
1191 duplicate_decls (spec
, fn
);
1196 else if (DECL_TEMPLATE_SPECIALIZATION (fn
))
1198 if (!duplicate_decls (spec
, fn
) && DECL_INITIAL (spec
))
1199 /* Dup decl failed, but this is a new definition. Set the
1200 line number so any errors match this new
1202 DECL_SOURCE_LOCATION (fn
) = DECL_SOURCE_LOCATION (spec
);
1208 /* A specialization must be declared in the same namespace as the
1209 template it is specializing. */
1210 if (DECL_TEMPLATE_SPECIALIZATION (spec
)
1211 && !check_specialization_namespace (tmpl
))
1212 DECL_CONTEXT (spec
) = decl_namespace_context (tmpl
);
1214 if (!optimize_specialization_lookup_p (tmpl
))
1215 DECL_TEMPLATE_SPECIALIZATIONS (tmpl
)
1216 = tree_cons (args
, spec
, DECL_TEMPLATE_SPECIALIZATIONS (tmpl
));
1221 /* Unregister the specialization SPEC as a specialization of TMPL.
1222 Replace it with NEW_SPEC, if NEW_SPEC is non-NULL. Returns true
1223 if the SPEC was listed as a specialization of TMPL. */
1226 reregister_specialization (tree spec
, tree tmpl
, tree new_spec
)
1230 for (s
= &DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
1232 s
= &TREE_CHAIN (*s
))
1233 if (TREE_VALUE (*s
) == spec
)
1236 *s
= TREE_CHAIN (*s
);
1238 TREE_VALUE (*s
) = new_spec
;
1245 /* Compare an entry in the local specializations hash table P1 (which
1246 is really a pointer to a TREE_LIST) with P2 (which is really a
1250 eq_local_specializations (const void *p1
, const void *p2
)
1252 return TREE_VALUE ((tree
) p1
) == (tree
) p2
;
1255 /* Hash P1, an entry in the local specializations table. */
1258 hash_local_specialization (const void* p1
)
1260 return htab_hash_pointer (TREE_VALUE ((tree
) p1
));
1263 /* Like register_specialization, but for local declarations. We are
1264 registering SPEC, an instantiation of TMPL. */
1267 register_local_specialization (tree spec
, tree tmpl
)
1271 slot
= htab_find_slot_with_hash (local_specializations
, tmpl
,
1272 htab_hash_pointer (tmpl
), INSERT
);
1273 *slot
= build_tree_list (spec
, tmpl
);
1276 /* Print the list of candidate FNS in an error message. */
1279 print_candidates (tree fns
)
1283 const char *str
= "candidates are:";
1285 for (fn
= fns
; fn
!= NULL_TREE
; fn
= TREE_CHAIN (fn
))
1289 for (f
= TREE_VALUE (fn
); f
; f
= OVL_NEXT (f
))
1290 cp_error_at ("%s %+#D", str
, OVL_CURRENT (f
));
1295 /* Returns the template (one of the functions given by TEMPLATE_ID)
1296 which can be specialized to match the indicated DECL with the
1297 explicit template args given in TEMPLATE_ID. The DECL may be
1298 NULL_TREE if none is available. In that case, the functions in
1299 TEMPLATE_ID are non-members.
1301 If NEED_MEMBER_TEMPLATE is nonzero the function is known to be a
1302 specialization of a member template.
1304 The TEMPLATE_COUNT is the number of references to qualifying
1305 template classes that appeared in the name of the function. See
1306 check_explicit_specialization for a more accurate description.
1308 The template args (those explicitly specified and those deduced)
1309 are output in a newly created vector *TARGS_OUT.
1311 If it is impossible to determine the result, an error message is
1312 issued. The error_mark_node is returned to indicate failure. */
1315 determine_specialization (tree template_id
,
1318 int need_member_template
,
1323 tree explicit_targs
;
1324 tree candidates
= NULL_TREE
;
1325 tree templates
= NULL_TREE
;
1327 struct cp_binding_level
*b
;
1329 *targs_out
= NULL_TREE
;
1331 if (template_id
== error_mark_node
)
1332 return error_mark_node
;
1334 fns
= TREE_OPERAND (template_id
, 0);
1335 explicit_targs
= TREE_OPERAND (template_id
, 1);
1337 if (fns
== error_mark_node
)
1338 return error_mark_node
;
1340 /* Check for baselinks. */
1341 if (BASELINK_P (fns
))
1342 fns
= BASELINK_FUNCTIONS (fns
);
1344 if (!is_overloaded_fn (fns
))
1346 error ("%qD is not a function template", fns
);
1347 return error_mark_node
;
1350 /* Count the number of template headers specified for this
1353 for (b
= current_binding_level
;
1354 b
->kind
== sk_template_parms
;
1358 for (; fns
; fns
= OVL_NEXT (fns
))
1360 tree fn
= OVL_CURRENT (fns
);
1362 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
1364 tree decl_arg_types
;
1367 /* DECL might be a specialization of FN. */
1369 /* Adjust the type of DECL in case FN is a static member. */
1370 decl_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
1371 if (DECL_STATIC_FUNCTION_P (fn
)
1372 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
1373 decl_arg_types
= TREE_CHAIN (decl_arg_types
);
1375 /* Check that the number of function parameters matches.
1377 template <class T> void f(int i = 0);
1378 template <> void f<int>();
1379 The specialization f<int> is invalid but is not caught
1380 by get_bindings below. */
1382 fn_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
1383 if (list_length (fn_arg_types
) != list_length (decl_arg_types
))
1386 /* For a non-static member function, we need to make sure that
1387 the const qualification is the same. This can be done by
1388 checking the 'this' in the argument list. */
1389 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
1390 && !same_type_p (TREE_VALUE (fn_arg_types
),
1391 TREE_VALUE (decl_arg_types
)))
1394 /* In case of explicit specialization, we need to check if
1395 the number of template headers appearing in the specialization
1396 is correct. This is usually done in check_explicit_specialization,
1397 but the check done there cannot be exhaustive when specializing
1398 member functions. Consider the following code:
1400 template <> void A<int>::f(int);
1401 template <> template <> void A<int>::f(int);
1403 Assuming that A<int> is not itself an explicit specialization
1404 already, the first line specializes "f" which is a non-template
1405 member function, whilst the second line specializes "f" which
1406 is a template member function. So both lines are syntactically
1407 correct, and check_explicit_specialization does not reject
1410 Here, we can do better, as we are matching the specialization
1411 against the declarations. We count the number of template
1412 headers, and we check if they match TEMPLATE_COUNT + 1
1413 (TEMPLATE_COUNT is the number of qualifying template classes,
1414 plus there must be another header for the member template
1417 Notice that if header_count is zero, this is not a
1418 specialization but rather a template instantiation, so there
1419 is no check we can perform here. */
1420 if (header_count
&& header_count
!= template_count
+ 1)
1423 /* Check that the number of template arguments at the
1424 innermost level for DECL is the same as for FN. */
1425 if (current_binding_level
->kind
== sk_template_parms
1426 && !current_binding_level
->explicit_spec_p
1427 && (TREE_VEC_LENGTH (DECL_INNERMOST_TEMPLATE_PARMS (fn
))
1428 != TREE_VEC_LENGTH (TREE_VALUE (current_template_parms
))))
1431 /* See whether this function might be a specialization of this
1433 targs
= get_bindings (fn
, decl
, explicit_targs
, /*check_ret=*/true);
1436 /* We cannot deduce template arguments that when used to
1437 specialize TMPL will produce DECL. */
1440 /* Save this template, and the arguments deduced. */
1441 templates
= tree_cons (targs
, fn
, templates
);
1443 else if (need_member_template
)
1444 /* FN is an ordinary member function, and we need a
1445 specialization of a member template. */
1447 else if (TREE_CODE (fn
) != FUNCTION_DECL
)
1448 /* We can get IDENTIFIER_NODEs here in certain erroneous
1451 else if (!DECL_FUNCTION_MEMBER_P (fn
))
1452 /* This is just an ordinary non-member function. Nothing can
1453 be a specialization of that. */
1455 else if (DECL_ARTIFICIAL (fn
))
1456 /* Cannot specialize functions that are created implicitly. */
1460 tree decl_arg_types
;
1462 /* This is an ordinary member function. However, since
1463 we're here, we can assume it's enclosing class is a
1464 template class. For example,
1466 template <typename T> struct S { void f(); };
1467 template <> void S<int>::f() {}
1469 Here, S<int>::f is a non-template, but S<int> is a
1470 template class. If FN has the same type as DECL, we
1471 might be in business. */
1473 if (!DECL_TEMPLATE_INFO (fn
))
1474 /* Its enclosing class is an explicit specialization
1475 of a template class. This is not a candidate. */
1478 if (!same_type_p (TREE_TYPE (TREE_TYPE (decl
)),
1479 TREE_TYPE (TREE_TYPE (fn
))))
1480 /* The return types differ. */
1483 /* Adjust the type of DECL in case FN is a static member. */
1484 decl_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
1485 if (DECL_STATIC_FUNCTION_P (fn
)
1486 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
1487 decl_arg_types
= TREE_CHAIN (decl_arg_types
);
1489 if (compparms (TYPE_ARG_TYPES (TREE_TYPE (fn
)),
1492 candidates
= tree_cons (NULL_TREE
, fn
, candidates
);
1496 if (templates
&& TREE_CHAIN (templates
))
1502 It is possible for a specialization with a given function
1503 signature to be instantiated from more than one function
1504 template. In such cases, explicit specification of the
1505 template arguments must be used to uniquely identify the
1506 function template specialization being specialized.
1508 Note that here, there's no suggestion that we're supposed to
1509 determine which of the candidate templates is most
1510 specialized. However, we, also have:
1514 Partial ordering of overloaded function template
1515 declarations is used in the following contexts to select
1516 the function template to which a function template
1517 specialization refers:
1519 -- when an explicit specialization refers to a function
1522 So, we do use the partial ordering rules, at least for now.
1523 This extension can only serve to make invalid programs valid,
1524 so it's safe. And, there is strong anecdotal evidence that
1525 the committee intended the partial ordering rules to apply;
1526 the EDG front-end has that behavior, and John Spicer claims
1527 that the committee simply forgot to delete the wording in
1528 [temp.expl.spec]. */
1529 tree tmpl
= most_specialized (templates
, decl
, explicit_targs
);
1530 if (tmpl
&& tmpl
!= error_mark_node
)
1532 targs
= get_bindings (tmpl
, decl
, explicit_targs
, /*check_ret=*/true);
1533 templates
= tree_cons (targs
, tmpl
, NULL_TREE
);
1537 if (templates
== NULL_TREE
&& candidates
== NULL_TREE
)
1539 cp_error_at ("template-id %qD for %q+D does not match any template "
1542 return error_mark_node
;
1544 else if ((templates
&& TREE_CHAIN (templates
))
1545 || (candidates
&& TREE_CHAIN (candidates
))
1546 || (templates
&& candidates
))
1548 cp_error_at ("ambiguous template specialization %qD for %q+D",
1550 chainon (candidates
, templates
);
1551 print_candidates (candidates
);
1552 return error_mark_node
;
1555 /* We have one, and exactly one, match. */
1558 /* It was a specialization of an ordinary member function in a
1560 *targs_out
= copy_node (DECL_TI_ARGS (TREE_VALUE (candidates
)));
1561 return DECL_TI_TEMPLATE (TREE_VALUE (candidates
));
1564 /* It was a specialization of a template. */
1565 targs
= DECL_TI_ARGS (DECL_TEMPLATE_RESULT (TREE_VALUE (templates
)));
1566 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (targs
))
1568 *targs_out
= copy_node (targs
);
1569 SET_TMPL_ARGS_LEVEL (*targs_out
,
1570 TMPL_ARGS_DEPTH (*targs_out
),
1571 TREE_PURPOSE (templates
));
1574 *targs_out
= TREE_PURPOSE (templates
);
1575 return TREE_VALUE (templates
);
1578 /* Returns a chain of parameter types, exactly like the SPEC_TYPES,
1579 but with the default argument values filled in from those in the
1583 copy_default_args_to_explicit_spec_1 (tree spec_types
,
1586 tree new_spec_types
;
1591 if (spec_types
== void_list_node
)
1592 return void_list_node
;
1594 /* Substitute into the rest of the list. */
1596 copy_default_args_to_explicit_spec_1 (TREE_CHAIN (spec_types
),
1597 TREE_CHAIN (tmpl_types
));
1599 /* Add the default argument for this parameter. */
1600 return hash_tree_cons (TREE_PURPOSE (tmpl_types
),
1601 TREE_VALUE (spec_types
),
1605 /* DECL is an explicit specialization. Replicate default arguments
1606 from the template it specializes. (That way, code like:
1608 template <class T> void f(T = 3);
1609 template <> void f(double);
1612 works, as required.) An alternative approach would be to look up
1613 the correct default arguments at the call-site, but this approach
1614 is consistent with how implicit instantiations are handled. */
1617 copy_default_args_to_explicit_spec (tree decl
)
1622 tree new_spec_types
;
1626 tree object_type
= NULL_TREE
;
1627 tree in_charge
= NULL_TREE
;
1628 tree vtt
= NULL_TREE
;
1630 /* See if there's anything we need to do. */
1631 tmpl
= DECL_TI_TEMPLATE (decl
);
1632 tmpl_types
= TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (tmpl
)));
1633 for (t
= tmpl_types
; t
; t
= TREE_CHAIN (t
))
1634 if (TREE_PURPOSE (t
))
1639 old_type
= TREE_TYPE (decl
);
1640 spec_types
= TYPE_ARG_TYPES (old_type
);
1642 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
1644 /* Remove the this pointer, but remember the object's type for
1646 object_type
= TREE_TYPE (TREE_VALUE (spec_types
));
1647 spec_types
= TREE_CHAIN (spec_types
);
1648 tmpl_types
= TREE_CHAIN (tmpl_types
);
1650 if (DECL_HAS_IN_CHARGE_PARM_P (decl
))
1652 /* DECL may contain more parameters than TMPL due to the extra
1653 in-charge parameter in constructors and destructors. */
1654 in_charge
= spec_types
;
1655 spec_types
= TREE_CHAIN (spec_types
);
1657 if (DECL_HAS_VTT_PARM_P (decl
))
1660 spec_types
= TREE_CHAIN (spec_types
);
1664 /* Compute the merged default arguments. */
1666 copy_default_args_to_explicit_spec_1 (spec_types
, tmpl_types
);
1668 /* Compute the new FUNCTION_TYPE. */
1672 new_spec_types
= hash_tree_cons (TREE_PURPOSE (vtt
),
1677 /* Put the in-charge parameter back. */
1678 new_spec_types
= hash_tree_cons (TREE_PURPOSE (in_charge
),
1679 TREE_VALUE (in_charge
),
1682 new_type
= build_method_type_directly (object_type
,
1683 TREE_TYPE (old_type
),
1687 new_type
= build_function_type (TREE_TYPE (old_type
),
1689 new_type
= cp_build_type_attribute_variant (new_type
,
1690 TYPE_ATTRIBUTES (old_type
));
1691 new_type
= build_exception_variant (new_type
,
1692 TYPE_RAISES_EXCEPTIONS (old_type
));
1693 TREE_TYPE (decl
) = new_type
;
1696 /* Check to see if the function just declared, as indicated in
1697 DECLARATOR, and in DECL, is a specialization of a function
1698 template. We may also discover that the declaration is an explicit
1699 instantiation at this point.
1701 Returns DECL, or an equivalent declaration that should be used
1702 instead if all goes well. Issues an error message if something is
1703 amiss. Returns error_mark_node if the error is not easily
1706 FLAGS is a bitmask consisting of the following flags:
1708 2: The function has a definition.
1709 4: The function is a friend.
1711 The TEMPLATE_COUNT is the number of references to qualifying
1712 template classes that appeared in the name of the function. For
1715 template <class T> struct S { void f(); };
1718 the TEMPLATE_COUNT would be 1. However, explicitly specialized
1719 classes are not counted in the TEMPLATE_COUNT, so that in
1721 template <class T> struct S {};
1722 template <> struct S<int> { void f(); }
1723 template <> void S<int>::f();
1725 the TEMPLATE_COUNT would be 0. (Note that this declaration is
1726 invalid; there should be no template <>.)
1728 If the function is a specialization, it is marked as such via
1729 DECL_TEMPLATE_SPECIALIZATION. Furthermore, its DECL_TEMPLATE_INFO
1730 is set up correctly, and it is added to the list of specializations
1731 for that template. */
1734 check_explicit_specialization (tree declarator
,
1739 int have_def
= flags
& 2;
1740 int is_friend
= flags
& 4;
1741 int specialization
= 0;
1742 int explicit_instantiation
= 0;
1743 int member_specialization
= 0;
1744 tree ctype
= DECL_CLASS_CONTEXT (decl
);
1745 tree dname
= DECL_NAME (decl
);
1750 if (!processing_specialization
)
1753 tsk
= tsk_excessive_parms
;
1756 tsk
= current_tmpl_spec_kind (template_count
);
1761 if (processing_specialization
)
1764 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
1766 else if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
1769 /* This could be something like:
1771 template <class T> void f(T);
1772 class S { friend void f<>(int); } */
1776 /* This case handles bogus declarations like template <>
1777 template <class T> void f<int>(); */
1779 error ("template-id %qD in declaration of primary template",
1786 case tsk_invalid_member_spec
:
1787 /* The error has already been reported in
1788 check_specialization_scope. */
1789 return error_mark_node
;
1791 case tsk_invalid_expl_inst
:
1792 error ("template parameter list used in explicit instantiation");
1798 error ("definition provided for explicit instantiation");
1800 explicit_instantiation
= 1;
1803 case tsk_excessive_parms
:
1804 case tsk_insufficient_parms
:
1805 if (tsk
== tsk_excessive_parms
)
1806 error ("too many template parameter lists in declaration of %qD",
1808 else if (template_header_count
)
1809 error("too few template parameter lists in declaration of %qD", decl
);
1811 error("explicit specialization of %qD must be introduced by "
1812 "%<template <>%>", decl
);
1816 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
1818 member_specialization
= 1;
1824 if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
1826 /* This case handles bogus declarations like template <>
1827 template <class T> void f<int>(); */
1829 if (uses_template_parms (declarator
))
1830 error ("function template partial specialization %qD "
1831 "is not allowed", declarator
);
1833 error ("template-id %qD in declaration of primary template",
1838 if (ctype
&& CLASSTYPE_TEMPLATE_INSTANTIATION (ctype
))
1839 /* This is a specialization of a member template, without
1840 specialization the containing class. Something like:
1842 template <class T> struct S {
1843 template <class U> void f (U);
1845 template <> template <class U> void S<int>::f(U) {}
1847 That's a specialization -- but of the entire template. */
1855 if (specialization
|| member_specialization
)
1857 tree t
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
1858 for (; t
; t
= TREE_CHAIN (t
))
1859 if (TREE_PURPOSE (t
))
1862 ("default argument specified in explicit specialization");
1865 if (current_lang_name
== lang_name_c
)
1866 error ("template specialization with C linkage");
1869 if (specialization
|| member_specialization
|| explicit_instantiation
)
1871 tree tmpl
= NULL_TREE
;
1872 tree targs
= NULL_TREE
;
1874 /* Make sure that the declarator is a TEMPLATE_ID_EXPR. */
1875 if (TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
1879 gcc_assert (TREE_CODE (declarator
) == IDENTIFIER_NODE
);
1884 /* If there is no class context, the explicit instantiation
1885 must be at namespace scope. */
1886 gcc_assert (DECL_NAMESPACE_SCOPE_P (decl
));
1888 /* Find the namespace binding, using the declaration
1890 fns
= namespace_binding (dname
, CP_DECL_CONTEXT (decl
));
1891 if (!fns
|| !is_overloaded_fn (fns
))
1893 error ("%qD is not a template function", dname
);
1894 fns
= error_mark_node
;
1898 declarator
= lookup_template_function (fns
, NULL_TREE
);
1901 if (declarator
== error_mark_node
)
1902 return error_mark_node
;
1904 if (ctype
!= NULL_TREE
&& TYPE_BEING_DEFINED (ctype
))
1906 if (!explicit_instantiation
)
1907 /* A specialization in class scope. This is invalid,
1908 but the error will already have been flagged by
1909 check_specialization_scope. */
1910 return error_mark_node
;
1913 /* It's not valid to write an explicit instantiation in
1916 class C { template void f(); }
1918 This case is caught by the parser. However, on
1921 template class C { void f(); };
1923 (which is invalid) we can get here. The error will be
1930 else if (ctype
!= NULL_TREE
1931 && (TREE_CODE (TREE_OPERAND (declarator
, 0)) ==
1934 /* Find the list of functions in ctype that have the same
1935 name as the declared function. */
1936 tree name
= TREE_OPERAND (declarator
, 0);
1937 tree fns
= NULL_TREE
;
1940 if (constructor_name_p (name
, ctype
))
1942 int is_constructor
= DECL_CONSTRUCTOR_P (decl
);
1944 if (is_constructor
? !TYPE_HAS_CONSTRUCTOR (ctype
)
1945 : !CLASSTYPE_DESTRUCTORS (ctype
))
1947 /* From [temp.expl.spec]:
1949 If such an explicit specialization for the member
1950 of a class template names an implicitly-declared
1951 special member function (clause _special_), the
1952 program is ill-formed.
1954 Similar language is found in [temp.explicit]. */
1955 error ("specialization of implicitly-declared special member function");
1956 return error_mark_node
;
1959 name
= is_constructor
? ctor_identifier
: dtor_identifier
;
1962 if (!DECL_CONV_FN_P (decl
))
1964 idx
= lookup_fnfields_1 (ctype
, name
);
1966 fns
= VEC_index (tree
, CLASSTYPE_METHOD_VEC (ctype
), idx
);
1970 VEC(tree
,gc
) *methods
;
1973 /* For a type-conversion operator, we cannot do a
1974 name-based lookup. We might be looking for `operator
1975 int' which will be a specialization of `operator T'.
1976 So, we find *all* the conversion operators, and then
1977 select from them. */
1980 methods
= CLASSTYPE_METHOD_VEC (ctype
);
1982 for (idx
= CLASSTYPE_FIRST_CONVERSION_SLOT
;
1983 VEC_iterate (tree
, methods
, idx
, ovl
);
1986 if (!DECL_CONV_FN_P (OVL_CURRENT (ovl
)))
1987 /* There are no more conversion functions. */
1990 /* Glue all these conversion functions together
1991 with those we already have. */
1992 for (; ovl
; ovl
= OVL_NEXT (ovl
))
1993 fns
= ovl_cons (OVL_CURRENT (ovl
), fns
);
1997 if (fns
== NULL_TREE
)
1999 error ("no member function %qD declared in %qT", name
, ctype
);
2000 return error_mark_node
;
2003 TREE_OPERAND (declarator
, 0) = fns
;
2006 /* Figure out what exactly is being specialized at this point.
2007 Note that for an explicit instantiation, even one for a
2008 member function, we cannot tell apriori whether the
2009 instantiation is for a member template, or just a member
2010 function of a template class. Even if a member template is
2011 being instantiated, the member template arguments may be
2012 elided if they can be deduced from the rest of the
2014 tmpl
= determine_specialization (declarator
, decl
,
2016 member_specialization
,
2019 if (!tmpl
|| tmpl
== error_mark_node
)
2020 /* We couldn't figure out what this declaration was
2022 return error_mark_node
;
2025 tree gen_tmpl
= most_general_template (tmpl
);
2027 if (explicit_instantiation
)
2029 /* We don't set DECL_EXPLICIT_INSTANTIATION here; that
2030 is done by do_decl_instantiation later. */
2032 int arg_depth
= TMPL_ARGS_DEPTH (targs
);
2033 int parm_depth
= TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
));
2035 if (arg_depth
> parm_depth
)
2037 /* If TMPL is not the most general template (for
2038 example, if TMPL is a friend template that is
2039 injected into namespace scope), then there will
2040 be too many levels of TARGS. Remove some of them
2045 new_targs
= make_tree_vec (parm_depth
);
2046 for (i
= arg_depth
- parm_depth
; i
< arg_depth
; ++i
)
2047 TREE_VEC_ELT (new_targs
, i
- (arg_depth
- parm_depth
))
2048 = TREE_VEC_ELT (targs
, i
);
2052 return instantiate_template (tmpl
, targs
, tf_error
);
2055 /* If we thought that the DECL was a member function, but it
2056 turns out to be specializing a static member function,
2057 make DECL a static member function as well. */
2058 if (DECL_STATIC_FUNCTION_P (tmpl
)
2059 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
2060 revert_static_member_fn (decl
);
2062 /* If this is a specialization of a member template of a
2063 template class. In we want to return the TEMPLATE_DECL,
2064 not the specialization of it. */
2065 if (tsk
== tsk_template
)
2067 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
2068 DECL_INITIAL (DECL_TEMPLATE_RESULT (tmpl
)) = NULL_TREE
;
2071 DECL_SOURCE_LOCATION (tmpl
) = DECL_SOURCE_LOCATION (decl
);
2072 DECL_SOURCE_LOCATION (DECL_TEMPLATE_RESULT (tmpl
))
2073 = DECL_SOURCE_LOCATION (decl
);
2074 /* We want to use the argument list specified in the
2075 definition, not in the original declaration. */
2076 DECL_ARGUMENTS (DECL_TEMPLATE_RESULT (tmpl
))
2077 = DECL_ARGUMENTS (decl
);
2082 /* Set up the DECL_TEMPLATE_INFO for DECL. */
2083 DECL_TEMPLATE_INFO (decl
) = tree_cons (tmpl
, targs
, NULL_TREE
);
2085 /* Inherit default function arguments from the template
2086 DECL is specializing. */
2087 copy_default_args_to_explicit_spec (decl
);
2089 /* This specialization has the same protection as the
2090 template it specializes. */
2091 TREE_PRIVATE (decl
) = TREE_PRIVATE (gen_tmpl
);
2092 TREE_PROTECTED (decl
) = TREE_PROTECTED (gen_tmpl
);
2094 if (is_friend
&& !have_def
)
2095 /* This is not really a declaration of a specialization.
2096 It's just the name of an instantiation. But, it's not
2097 a request for an instantiation, either. */
2098 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
2099 else if (DECL_CONSTRUCTOR_P (decl
) || DECL_DESTRUCTOR_P (decl
))
2100 /* This is indeed a specialization. In case of constructors
2101 and destructors, we need in-charge and not-in-charge
2102 versions in V3 ABI. */
2103 clone_function_decl (decl
, /*update_method_vec_p=*/0);
2105 /* Register this specialization so that we can find it
2107 decl
= register_specialization (decl
, gen_tmpl
, targs
);
2114 /* Returns 1 iff PARMS1 and PARMS2 are identical sets of template
2115 parameters. These are represented in the same format used for
2116 DECL_TEMPLATE_PARMS. */
2119 comp_template_parms (tree parms1
, tree parms2
)
2124 if (parms1
== parms2
)
2127 for (p1
= parms1
, p2
= parms2
;
2128 p1
!= NULL_TREE
&& p2
!= NULL_TREE
;
2129 p1
= TREE_CHAIN (p1
), p2
= TREE_CHAIN (p2
))
2131 tree t1
= TREE_VALUE (p1
);
2132 tree t2
= TREE_VALUE (p2
);
2135 gcc_assert (TREE_CODE (t1
) == TREE_VEC
);
2136 gcc_assert (TREE_CODE (t2
) == TREE_VEC
);
2138 if (TREE_VEC_LENGTH (t1
) != TREE_VEC_LENGTH (t2
))
2141 for (i
= 0; i
< TREE_VEC_LENGTH (t2
); ++i
)
2143 tree parm1
= TREE_VALUE (TREE_VEC_ELT (t1
, i
));
2144 tree parm2
= TREE_VALUE (TREE_VEC_ELT (t2
, i
));
2146 if (TREE_CODE (parm1
) != TREE_CODE (parm2
))
2149 if (TREE_CODE (parm1
) == TEMPLATE_TYPE_PARM
)
2151 else if (!same_type_p (TREE_TYPE (parm1
), TREE_TYPE (parm2
)))
2156 if ((p1
!= NULL_TREE
) != (p2
!= NULL_TREE
))
2157 /* One set of parameters has more parameters lists than the
2164 /* Complain if DECL shadows a template parameter.
2166 [temp.local]: A template-parameter shall not be redeclared within its
2167 scope (including nested scopes). */
2170 check_template_shadow (tree decl
)
2174 /* If we're not in a template, we can't possibly shadow a template
2176 if (!current_template_parms
)
2179 /* Figure out what we're shadowing. */
2180 if (TREE_CODE (decl
) == OVERLOAD
)
2181 decl
= OVL_CURRENT (decl
);
2182 olddecl
= innermost_non_namespace_value (DECL_NAME (decl
));
2184 /* If there's no previous binding for this name, we're not shadowing
2185 anything, let alone a template parameter. */
2189 /* If we're not shadowing a template parameter, we're done. Note
2190 that OLDDECL might be an OVERLOAD (or perhaps even an
2191 ERROR_MARK), so we can't just blithely assume it to be a _DECL
2193 if (!DECL_P (olddecl
) || !DECL_TEMPLATE_PARM_P (olddecl
))
2196 /* We check for decl != olddecl to avoid bogus errors for using a
2197 name inside a class. We check TPFI to avoid duplicate errors for
2198 inline member templates. */
2200 || TEMPLATE_PARMS_FOR_INLINE (current_template_parms
))
2203 cp_error_at ("declaration of %q#D", decl
);
2204 cp_error_at (" shadows template parm %q#D", olddecl
);
2207 /* Return a new TEMPLATE_PARM_INDEX with the indicated INDEX, LEVEL,
2208 ORIG_LEVEL, DECL, and TYPE. */
2211 build_template_parm_index (int index
,
2217 tree t
= make_node (TEMPLATE_PARM_INDEX
);
2218 TEMPLATE_PARM_IDX (t
) = index
;
2219 TEMPLATE_PARM_LEVEL (t
) = level
;
2220 TEMPLATE_PARM_ORIG_LEVEL (t
) = orig_level
;
2221 TEMPLATE_PARM_DECL (t
) = decl
;
2222 TREE_TYPE (t
) = type
;
2223 TREE_CONSTANT (t
) = TREE_CONSTANT (decl
);
2224 TREE_INVARIANT (t
) = TREE_INVARIANT (decl
);
2225 TREE_READONLY (t
) = TREE_READONLY (decl
);
2230 /* Return a TEMPLATE_PARM_INDEX, similar to INDEX, but whose
2231 TEMPLATE_PARM_LEVEL has been decreased by LEVELS. If such a
2232 TEMPLATE_PARM_INDEX already exists, it is returned; otherwise, a
2233 new one is created. */
2236 reduce_template_parm_level (tree index
, tree type
, int levels
)
2238 if (TEMPLATE_PARM_DESCENDANTS (index
) == NULL_TREE
2239 || (TEMPLATE_PARM_LEVEL (TEMPLATE_PARM_DESCENDANTS (index
))
2240 != TEMPLATE_PARM_LEVEL (index
) - levels
))
2242 tree orig_decl
= TEMPLATE_PARM_DECL (index
);
2245 decl
= build_decl (TREE_CODE (orig_decl
), DECL_NAME (orig_decl
), type
);
2246 TREE_CONSTANT (decl
) = TREE_CONSTANT (orig_decl
);
2247 TREE_INVARIANT (decl
) = TREE_INVARIANT (orig_decl
);
2248 TREE_READONLY (decl
) = TREE_READONLY (orig_decl
);
2249 DECL_ARTIFICIAL (decl
) = 1;
2250 SET_DECL_TEMPLATE_PARM_P (decl
);
2252 t
= build_template_parm_index (TEMPLATE_PARM_IDX (index
),
2253 TEMPLATE_PARM_LEVEL (index
) - levels
,
2254 TEMPLATE_PARM_ORIG_LEVEL (index
),
2256 TEMPLATE_PARM_DESCENDANTS (index
) = t
;
2258 /* Template template parameters need this. */
2259 DECL_TEMPLATE_PARMS (decl
)
2260 = DECL_TEMPLATE_PARMS (TEMPLATE_PARM_DECL (index
));
2263 return TEMPLATE_PARM_DESCENDANTS (index
);
2266 /* Process information from new template parameter NEXT and append it to the
2267 LIST being built. This new parameter is a non-type parameter iff
2268 IS_NON_TYPE is true. */
2271 process_template_parm (tree list
, tree next
, bool is_non_type
)
2279 gcc_assert (TREE_CODE (parm
) == TREE_LIST
);
2280 defval
= TREE_PURPOSE (parm
);
2284 tree p
= TREE_VALUE (tree_last (list
));
2286 if (TREE_CODE (p
) == TYPE_DECL
|| TREE_CODE (p
) == TEMPLATE_DECL
)
2287 idx
= TEMPLATE_TYPE_IDX (TREE_TYPE (p
));
2289 idx
= TEMPLATE_PARM_IDX (DECL_INITIAL (p
));
2297 parm
= TREE_VALUE (parm
);
2299 SET_DECL_TEMPLATE_PARM_P (parm
);
2303 The top-level cv-qualifiers on the template-parameter are
2304 ignored when determining its type. */
2305 TREE_TYPE (parm
) = TYPE_MAIN_VARIANT (TREE_TYPE (parm
));
2307 /* A template parameter is not modifiable. */
2308 TREE_CONSTANT (parm
) = 1;
2309 TREE_INVARIANT (parm
) = 1;
2310 TREE_READONLY (parm
) = 1;
2311 if (invalid_nontype_parm_type_p (TREE_TYPE (parm
), 1))
2312 TREE_TYPE (parm
) = void_type_node
;
2313 decl
= build_decl (CONST_DECL
, DECL_NAME (parm
), TREE_TYPE (parm
));
2314 TREE_CONSTANT (decl
) = 1;
2315 TREE_INVARIANT (decl
) = 1;
2316 TREE_READONLY (decl
) = 1;
2317 DECL_INITIAL (parm
) = DECL_INITIAL (decl
)
2318 = build_template_parm_index (idx
, processing_template_decl
,
2319 processing_template_decl
,
2320 decl
, TREE_TYPE (parm
));
2325 parm
= TREE_VALUE (TREE_VALUE (parm
));
2327 if (parm
&& TREE_CODE (parm
) == TEMPLATE_DECL
)
2329 t
= make_aggr_type (TEMPLATE_TEMPLATE_PARM
);
2330 /* This is for distinguishing between real templates and template
2331 template parameters */
2332 TREE_TYPE (parm
) = t
;
2333 TREE_TYPE (DECL_TEMPLATE_RESULT (parm
)) = t
;
2338 t
= make_aggr_type (TEMPLATE_TYPE_PARM
);
2339 /* parm is either IDENTIFIER_NODE or NULL_TREE. */
2340 decl
= build_decl (TYPE_DECL
, parm
, t
);
2343 TYPE_NAME (t
) = decl
;
2344 TYPE_STUB_DECL (t
) = decl
;
2346 TEMPLATE_TYPE_PARM_INDEX (t
)
2347 = build_template_parm_index (idx
, processing_template_decl
,
2348 processing_template_decl
,
2349 decl
, TREE_TYPE (parm
));
2351 DECL_ARTIFICIAL (decl
) = 1;
2352 SET_DECL_TEMPLATE_PARM_P (decl
);
2354 parm
= build_tree_list (defval
, parm
);
2355 return chainon (list
, parm
);
2358 /* The end of a template parameter list has been reached. Process the
2359 tree list into a parameter vector, converting each parameter into a more
2360 useful form. Type parameters are saved as IDENTIFIER_NODEs, and others
2364 end_template_parm_list (tree parms
)
2368 tree saved_parmlist
= make_tree_vec (list_length (parms
));
2370 current_template_parms
2371 = tree_cons (size_int (processing_template_decl
),
2372 saved_parmlist
, current_template_parms
);
2374 for (parm
= parms
, nparms
= 0; parm
; parm
= next
, nparms
++)
2376 next
= TREE_CHAIN (parm
);
2377 TREE_VEC_ELT (saved_parmlist
, nparms
) = parm
;
2378 TREE_CHAIN (parm
) = NULL_TREE
;
2381 --processing_template_parmlist
;
2383 return saved_parmlist
;
2386 /* end_template_decl is called after a template declaration is seen. */
2389 end_template_decl (void)
2391 reset_specialization ();
2393 if (! processing_template_decl
)
2396 /* This matches the pushlevel in begin_template_parm_list. */
2399 --processing_template_decl
;
2400 current_template_parms
= TREE_CHAIN (current_template_parms
);
2403 /* Given a template argument vector containing the template PARMS.
2404 The innermost PARMS are given first. */
2407 current_template_args (void)
2410 tree args
= NULL_TREE
;
2411 int length
= TMPL_PARMS_DEPTH (current_template_parms
);
2414 /* If there is only one level of template parameters, we do not
2415 create a TREE_VEC of TREE_VECs. Instead, we return a single
2416 TREE_VEC containing the arguments. */
2418 args
= make_tree_vec (length
);
2420 for (header
= current_template_parms
; header
; header
= TREE_CHAIN (header
))
2422 tree a
= copy_node (TREE_VALUE (header
));
2425 TREE_TYPE (a
) = NULL_TREE
;
2426 for (i
= TREE_VEC_LENGTH (a
) - 1; i
>= 0; --i
)
2428 tree t
= TREE_VEC_ELT (a
, i
);
2430 /* T will be a list if we are called from within a
2431 begin/end_template_parm_list pair, but a vector directly
2432 if within a begin/end_member_template_processing pair. */
2433 if (TREE_CODE (t
) == TREE_LIST
)
2437 if (TREE_CODE (t
) == TYPE_DECL
2438 || TREE_CODE (t
) == TEMPLATE_DECL
)
2441 t
= DECL_INITIAL (t
);
2442 TREE_VEC_ELT (a
, i
) = t
;
2447 TREE_VEC_ELT (args
, --l
) = a
;
2455 /* Return a TEMPLATE_DECL corresponding to DECL, using the indicated
2456 template PARMS. If MEMBER_TEMPLATE_P is true, the new template is
2457 a member template. Used by push_template_decl below. */
2460 build_template_decl (tree decl
, tree parms
, bool member_template_p
)
2462 tree tmpl
= build_lang_decl (TEMPLATE_DECL
, DECL_NAME (decl
), NULL_TREE
);
2463 DECL_TEMPLATE_PARMS (tmpl
) = parms
;
2464 DECL_CONTEXT (tmpl
) = DECL_CONTEXT (decl
);
2465 DECL_MEMBER_TEMPLATE_P (tmpl
) = member_template_p
;
2466 if (DECL_LANG_SPECIFIC (decl
))
2468 DECL_STATIC_FUNCTION_P (tmpl
) = DECL_STATIC_FUNCTION_P (decl
);
2469 DECL_CONSTRUCTOR_P (tmpl
) = DECL_CONSTRUCTOR_P (decl
);
2470 DECL_DESTRUCTOR_P (tmpl
) = DECL_DESTRUCTOR_P (decl
);
2471 DECL_NONCONVERTING_P (tmpl
) = DECL_NONCONVERTING_P (decl
);
2472 DECL_ASSIGNMENT_OPERATOR_P (tmpl
) = DECL_ASSIGNMENT_OPERATOR_P (decl
);
2473 if (DECL_OVERLOADED_OPERATOR_P (decl
))
2474 SET_OVERLOADED_OPERATOR_CODE (tmpl
,
2475 DECL_OVERLOADED_OPERATOR_P (decl
));
2481 struct template_parm_data
2483 /* The level of the template parameters we are currently
2487 /* The index of the specialization argument we are currently
2491 /* An array whose size is the number of template parameters. The
2492 elements are nonzero if the parameter has been used in any one
2493 of the arguments processed so far. */
2496 /* An array whose size is the number of template arguments. The
2497 elements are nonzero if the argument makes use of template
2498 parameters of this level. */
2499 int* arg_uses_template_parms
;
2502 /* Subroutine of push_template_decl used to see if each template
2503 parameter in a partial specialization is used in the explicit
2504 argument list. If T is of the LEVEL given in DATA (which is
2505 treated as a template_parm_data*), then DATA->PARMS is marked
2509 mark_template_parm (tree t
, void* data
)
2513 struct template_parm_data
* tpd
= (struct template_parm_data
*) data
;
2515 if (TREE_CODE (t
) == TEMPLATE_PARM_INDEX
)
2517 level
= TEMPLATE_PARM_LEVEL (t
);
2518 idx
= TEMPLATE_PARM_IDX (t
);
2522 level
= TEMPLATE_TYPE_LEVEL (t
);
2523 idx
= TEMPLATE_TYPE_IDX (t
);
2526 if (level
== tpd
->level
)
2528 tpd
->parms
[idx
] = 1;
2529 tpd
->arg_uses_template_parms
[tpd
->current_arg
] = 1;
2532 /* Return zero so that for_each_template_parm will continue the
2533 traversal of the tree; we want to mark *every* template parm. */
2537 /* Process the partial specialization DECL. */
2540 process_partial_specialization (tree decl
)
2542 tree type
= TREE_TYPE (decl
);
2543 tree maintmpl
= CLASSTYPE_TI_TEMPLATE (type
);
2544 tree specargs
= CLASSTYPE_TI_ARGS (type
);
2545 tree inner_args
= INNERMOST_TEMPLATE_ARGS (specargs
);
2546 tree inner_parms
= INNERMOST_TEMPLATE_PARMS (current_template_parms
);
2547 tree main_inner_parms
= DECL_INNERMOST_TEMPLATE_PARMS (maintmpl
);
2548 int nargs
= TREE_VEC_LENGTH (inner_args
);
2549 int ntparms
= TREE_VEC_LENGTH (inner_parms
);
2551 int did_error_intro
= 0;
2552 struct template_parm_data tpd
;
2553 struct template_parm_data tpd2
;
2555 /* We check that each of the template parameters given in the
2556 partial specialization is used in the argument list to the
2557 specialization. For example:
2559 template <class T> struct S;
2560 template <class T> struct S<T*>;
2562 The second declaration is OK because `T*' uses the template
2563 parameter T, whereas
2565 template <class T> struct S<int>;
2567 is no good. Even trickier is:
2578 The S2<T> declaration is actually invalid; it is a
2579 full-specialization. Of course,
2582 struct S2<T (*)(U)>;
2584 or some such would have been OK. */
2585 tpd
.level
= TMPL_PARMS_DEPTH (current_template_parms
);
2586 tpd
.parms
= alloca (sizeof (int) * ntparms
);
2587 memset (tpd
.parms
, 0, sizeof (int) * ntparms
);
2589 tpd
.arg_uses_template_parms
= alloca (sizeof (int) * nargs
);
2590 memset (tpd
.arg_uses_template_parms
, 0, sizeof (int) * nargs
);
2591 for (i
= 0; i
< nargs
; ++i
)
2593 tpd
.current_arg
= i
;
2594 for_each_template_parm (TREE_VEC_ELT (inner_args
, i
),
2595 &mark_template_parm
,
2599 for (i
= 0; i
< ntparms
; ++i
)
2600 if (tpd
.parms
[i
] == 0)
2602 /* One of the template parms was not used in the
2604 if (!did_error_intro
)
2606 error ("template parameters not used in partial specialization:");
2607 did_error_intro
= 1;
2610 error (" %qD", TREE_VALUE (TREE_VEC_ELT (inner_parms
, i
)));
2613 /* [temp.class.spec]
2615 The argument list of the specialization shall not be identical to
2616 the implicit argument list of the primary template. */
2617 if (comp_template_args
2619 INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE
2621 error ("partial specialization %qT does not specialize any template arguments", type
);
2623 /* [temp.class.spec]
2625 A partially specialized non-type argument expression shall not
2626 involve template parameters of the partial specialization except
2627 when the argument expression is a simple identifier.
2629 The type of a template parameter corresponding to a specialized
2630 non-type argument shall not be dependent on a parameter of the
2632 gcc_assert (nargs
== DECL_NTPARMS (maintmpl
));
2634 for (i
= 0; i
< nargs
; ++i
)
2636 tree arg
= TREE_VEC_ELT (inner_args
, i
);
2637 if (/* These first two lines are the `non-type' bit. */
2639 && TREE_CODE (arg
) != TEMPLATE_DECL
2640 /* This next line is the `argument expression is not just a
2641 simple identifier' condition and also the `specialized
2642 non-type argument' bit. */
2643 && TREE_CODE (arg
) != TEMPLATE_PARM_INDEX
)
2645 if (tpd
.arg_uses_template_parms
[i
])
2646 error ("template argument %qE involves template parameter(s)", arg
);
2649 /* Look at the corresponding template parameter,
2650 marking which template parameters its type depends
2653 TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (main_inner_parms
,
2658 /* We haven't yet initialized TPD2. Do so now. */
2659 tpd2
.arg_uses_template_parms
2660 = alloca (sizeof (int) * nargs
);
2661 /* The number of parameters here is the number in the
2662 main template, which, as checked in the assertion
2664 tpd2
.parms
= alloca (sizeof (int) * nargs
);
2666 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (maintmpl
));
2669 /* Mark the template parameters. But this time, we're
2670 looking for the template parameters of the main
2671 template, not in the specialization. */
2672 tpd2
.current_arg
= i
;
2673 tpd2
.arg_uses_template_parms
[i
] = 0;
2674 memset (tpd2
.parms
, 0, sizeof (int) * nargs
);
2675 for_each_template_parm (type
,
2676 &mark_template_parm
,
2680 if (tpd2
.arg_uses_template_parms
[i
])
2682 /* The type depended on some template parameters.
2683 If they are fully specialized in the
2684 specialization, that's OK. */
2686 for (j
= 0; j
< nargs
; ++j
)
2687 if (tpd2
.parms
[j
] != 0
2688 && tpd
.arg_uses_template_parms
[j
])
2690 error ("type %qT of template argument %qE depends "
2691 "on template parameter(s)",
2701 if (retrieve_specialization (maintmpl
, specargs
,
2702 /*class_specializations_p=*/true))
2703 /* We've already got this specialization. */
2706 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)
2707 = tree_cons (inner_args
, inner_parms
,
2708 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
));
2709 TREE_TYPE (DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)) = type
;
2713 /* Check that a template declaration's use of default arguments is not
2714 invalid. Here, PARMS are the template parameters. IS_PRIMARY is
2715 nonzero if DECL is the thing declared by a primary template.
2716 IS_PARTIAL is nonzero if DECL is a partial specialization. */
2719 check_default_tmpl_args (tree decl
, tree parms
, int is_primary
, int is_partial
)
2722 int last_level_to_check
;
2727 A default template-argument shall not be specified in a
2728 function template declaration or a function template definition, nor
2729 in the template-parameter-list of the definition of a member of a
2732 if (TREE_CODE (CP_DECL_CONTEXT (decl
)) == FUNCTION_DECL
)
2733 /* You can't have a function template declaration in a local
2734 scope, nor you can you define a member of a class template in a
2738 if (current_class_type
2739 && !TYPE_BEING_DEFINED (current_class_type
)
2740 && DECL_LANG_SPECIFIC (decl
)
2741 /* If this is either a friend defined in the scope of the class
2742 or a member function. */
2743 && (DECL_FUNCTION_MEMBER_P (decl
)
2744 ? same_type_p (DECL_CONTEXT (decl
), current_class_type
)
2745 : DECL_FRIEND_CONTEXT (decl
)
2746 ? same_type_p (DECL_FRIEND_CONTEXT (decl
), current_class_type
)
2748 /* And, if it was a member function, it really was defined in
2749 the scope of the class. */
2750 && (!DECL_FUNCTION_MEMBER_P (decl
)
2751 || DECL_INITIALIZED_IN_CLASS_P (decl
)))
2752 /* We already checked these parameters when the template was
2753 declared, so there's no need to do it again now. This function
2754 was defined in class scope, but we're processing it's body now
2755 that the class is complete. */
2760 If a template-parameter has a default template-argument, all
2761 subsequent template-parameters shall have a default
2762 template-argument supplied. */
2763 for (parm_level
= parms
; parm_level
; parm_level
= TREE_CHAIN (parm_level
))
2765 tree inner_parms
= TREE_VALUE (parm_level
);
2766 int ntparms
= TREE_VEC_LENGTH (inner_parms
);
2767 int seen_def_arg_p
= 0;
2770 for (i
= 0; i
< ntparms
; ++i
)
2772 tree parm
= TREE_VEC_ELT (inner_parms
, i
);
2773 if (TREE_PURPOSE (parm
))
2775 else if (seen_def_arg_p
)
2777 error ("no default argument for %qD", TREE_VALUE (parm
));
2778 /* For better subsequent error-recovery, we indicate that
2779 there should have been a default argument. */
2780 TREE_PURPOSE (parm
) = error_mark_node
;
2785 if (TREE_CODE (decl
) != TYPE_DECL
|| is_partial
|| !is_primary
)
2786 /* For an ordinary class template, default template arguments are
2787 allowed at the innermost level, e.g.:
2788 template <class T = int>
2790 but, in a partial specialization, they're not allowed even
2791 there, as we have in [temp.class.spec]:
2793 The template parameter list of a specialization shall not
2794 contain default template argument values.
2796 So, for a partial specialization, or for a function template,
2797 we look at all of them. */
2800 /* But, for a primary class template that is not a partial
2801 specialization we look at all template parameters except the
2803 parms
= TREE_CHAIN (parms
);
2805 /* Figure out what error message to issue. */
2806 if (TREE_CODE (decl
) == FUNCTION_DECL
)
2807 msg
= "default template arguments may not be used in function templates";
2808 else if (is_partial
)
2809 msg
= "default template arguments may not be used in partial specializations";
2811 msg
= "default argument for template parameter for class enclosing %qD";
2813 if (current_class_type
&& TYPE_BEING_DEFINED (current_class_type
))
2814 /* If we're inside a class definition, there's no need to
2815 examine the parameters to the class itself. On the one
2816 hand, they will be checked when the class is defined, and,
2817 on the other, default arguments are valid in things like:
2818 template <class T = double>
2819 struct S { template <class U> void f(U); };
2820 Here the default argument for `S' has no bearing on the
2821 declaration of `f'. */
2822 last_level_to_check
= template_class_depth (current_class_type
) + 1;
2824 /* Check everything. */
2825 last_level_to_check
= 0;
2827 for (parm_level
= parms
;
2828 parm_level
&& TMPL_PARMS_DEPTH (parm_level
) >= last_level_to_check
;
2829 parm_level
= TREE_CHAIN (parm_level
))
2831 tree inner_parms
= TREE_VALUE (parm_level
);
2835 ntparms
= TREE_VEC_LENGTH (inner_parms
);
2836 for (i
= 0; i
< ntparms
; ++i
)
2837 if (TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)))
2845 /* Clear out the default argument so that we are not
2847 TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)) = NULL_TREE
;
2850 /* At this point, if we're still interested in issuing messages,
2851 they must apply to classes surrounding the object declared. */
2853 msg
= "default argument for template parameter for class enclosing %qD";
2857 /* Worker for push_template_decl_real, called via
2858 for_each_template_parm. DATA is really an int, indicating the
2859 level of the parameters we are interested in. If T is a template
2860 parameter of that level, return nonzero. */
2863 template_parm_this_level_p (tree t
, void* data
)
2865 int this_level
= *(int *)data
;
2868 if (TREE_CODE (t
) == TEMPLATE_PARM_INDEX
)
2869 level
= TEMPLATE_PARM_LEVEL (t
);
2871 level
= TEMPLATE_TYPE_LEVEL (t
);
2872 return level
== this_level
;
2875 /* Creates a TEMPLATE_DECL for the indicated DECL using the template
2876 parameters given by current_template_args, or reuses a
2877 previously existing one, if appropriate. Returns the DECL, or an
2878 equivalent one, if it is replaced via a call to duplicate_decls.
2880 If IS_FRIEND is nonzero, DECL is a friend declaration. */
2883 push_template_decl_real (tree decl
, int is_friend
)
2891 int new_template_p
= 0;
2892 /* True if the template is a member template, in the sense of
2894 bool member_template_p
= false;
2896 if (decl
== error_mark_node
)
2899 /* See if this is a partial specialization. */
2900 is_partial
= (DECL_IMPLICIT_TYPEDEF_P (decl
)
2901 && TREE_CODE (TREE_TYPE (decl
)) != ENUMERAL_TYPE
2902 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl
)));
2904 is_friend
|= (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_FRIEND_P (decl
));
2907 /* For a friend, we want the context of the friend function, not
2908 the type of which it is a friend. */
2909 ctx
= DECL_CONTEXT (decl
);
2910 else if (CP_DECL_CONTEXT (decl
)
2911 && TREE_CODE (CP_DECL_CONTEXT (decl
)) != NAMESPACE_DECL
)
2912 /* In the case of a virtual function, we want the class in which
2914 ctx
= CP_DECL_CONTEXT (decl
);
2916 /* Otherwise, if we're currently defining some class, the DECL
2917 is assumed to be a member of the class. */
2918 ctx
= current_scope ();
2920 if (ctx
&& TREE_CODE (ctx
) == NAMESPACE_DECL
)
2923 if (!DECL_CONTEXT (decl
))
2924 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
2926 /* See if this is a primary template. */
2927 primary
= template_parm_scope_p ();
2931 if (DECL_CLASS_SCOPE_P (decl
))
2932 member_template_p
= true;
2933 if (current_lang_name
== lang_name_c
)
2934 error ("template with C linkage");
2935 else if (TREE_CODE (decl
) == TYPE_DECL
2936 && ANON_AGGRNAME_P (DECL_NAME (decl
)))
2937 error ("template class without a name");
2938 else if (TREE_CODE (decl
) == FUNCTION_DECL
)
2940 if (DECL_DESTRUCTOR_P (decl
))
2944 A destructor shall not be a member template. */
2945 error ("destructor %qD declared as member template", decl
);
2946 return error_mark_node
;
2948 if (NEW_DELETE_OPNAME_P (DECL_NAME (decl
))
2949 && (!TYPE_ARG_TYPES (TREE_TYPE (decl
))
2950 || TYPE_ARG_TYPES (TREE_TYPE (decl
)) == void_list_node
2951 || !TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)))
2952 || (TREE_CHAIN (TYPE_ARG_TYPES ((TREE_TYPE (decl
))))
2953 == void_list_node
)))
2955 /* [basic.stc.dynamic.allocation]
2957 An allocation function can be a function
2958 template. ... Template allocation functions shall
2959 have two or more parameters. */
2960 error ("invalid template declaration of %qD", decl
);
2964 else if ((DECL_IMPLICIT_TYPEDEF_P (decl
)
2965 && CLASS_TYPE_P (TREE_TYPE (decl
)))
2966 || (TREE_CODE (decl
) == VAR_DECL
&& ctx
&& CLASS_TYPE_P (ctx
)))
2970 error ("template declaration of %q#D", decl
);
2971 return error_mark_node
;
2975 /* Check to see that the rules regarding the use of default
2976 arguments are not being violated. */
2977 check_default_tmpl_args (decl
, current_template_parms
,
2978 primary
, is_partial
);
2981 return process_partial_specialization (decl
);
2983 args
= current_template_args ();
2986 || TREE_CODE (ctx
) == FUNCTION_DECL
2987 || (CLASS_TYPE_P (ctx
) && TYPE_BEING_DEFINED (ctx
))
2988 || (is_friend
&& !DECL_TEMPLATE_INFO (decl
)))
2990 if (DECL_LANG_SPECIFIC (decl
)
2991 && DECL_TEMPLATE_INFO (decl
)
2992 && DECL_TI_TEMPLATE (decl
))
2993 tmpl
= DECL_TI_TEMPLATE (decl
);
2994 /* If DECL is a TYPE_DECL for a class-template, then there won't
2995 be DECL_LANG_SPECIFIC. The information equivalent to
2996 DECL_TEMPLATE_INFO is found in TYPE_TEMPLATE_INFO instead. */
2997 else if (DECL_IMPLICIT_TYPEDEF_P (decl
)
2998 && TYPE_TEMPLATE_INFO (TREE_TYPE (decl
))
2999 && TYPE_TI_TEMPLATE (TREE_TYPE (decl
)))
3001 /* Since a template declaration already existed for this
3002 class-type, we must be redeclaring it here. Make sure
3003 that the redeclaration is valid. */
3004 redeclare_class_template (TREE_TYPE (decl
),
3005 current_template_parms
);
3006 /* We don't need to create a new TEMPLATE_DECL; just use the
3007 one we already had. */
3008 tmpl
= TYPE_TI_TEMPLATE (TREE_TYPE (decl
));
3012 tmpl
= build_template_decl (decl
, current_template_parms
,
3016 if (DECL_LANG_SPECIFIC (decl
)
3017 && DECL_TEMPLATE_SPECIALIZATION (decl
))
3019 /* A specialization of a member template of a template
3021 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
3022 DECL_TEMPLATE_INFO (tmpl
) = DECL_TEMPLATE_INFO (decl
);
3023 DECL_TEMPLATE_INFO (decl
) = NULL_TREE
;
3029 tree a
, t
, current
, parms
;
3032 if (TREE_CODE (decl
) == TYPE_DECL
)
3034 if ((IS_AGGR_TYPE_CODE (TREE_CODE (TREE_TYPE (decl
)))
3035 || TREE_CODE (TREE_TYPE (decl
)) == ENUMERAL_TYPE
)
3036 && TYPE_TEMPLATE_INFO (TREE_TYPE (decl
))
3037 && TYPE_TI_TEMPLATE (TREE_TYPE (decl
)))
3038 tmpl
= TYPE_TI_TEMPLATE (TREE_TYPE (decl
));
3041 error ("%qD does not declare a template type", decl
);
3045 else if (!DECL_LANG_SPECIFIC (decl
) || !DECL_TEMPLATE_INFO (decl
))
3047 error ("template definition of non-template %q#D", decl
);
3051 tmpl
= DECL_TI_TEMPLATE (decl
);
3053 if (DECL_FUNCTION_TEMPLATE_P (tmpl
)
3054 && DECL_TEMPLATE_INFO (decl
) && DECL_TI_ARGS (decl
)
3055 && DECL_TEMPLATE_SPECIALIZATION (decl
)
3056 && DECL_MEMBER_TEMPLATE_P (tmpl
))
3060 /* The declaration is a specialization of a member
3061 template, declared outside the class. Therefore, the
3062 innermost template arguments will be NULL, so we
3063 replace them with the arguments determined by the
3064 earlier call to check_explicit_specialization. */
3065 args
= DECL_TI_ARGS (decl
);
3068 = build_template_decl (decl
, current_template_parms
,
3070 DECL_TEMPLATE_RESULT (new_tmpl
) = decl
;
3071 TREE_TYPE (new_tmpl
) = TREE_TYPE (decl
);
3072 DECL_TI_TEMPLATE (decl
) = new_tmpl
;
3073 SET_DECL_TEMPLATE_SPECIALIZATION (new_tmpl
);
3074 DECL_TEMPLATE_INFO (new_tmpl
)
3075 = tree_cons (tmpl
, args
, NULL_TREE
);
3077 register_specialization (new_tmpl
,
3078 most_general_template (tmpl
),
3083 /* Make sure the template headers we got make sense. */
3085 parms
= DECL_TEMPLATE_PARMS (tmpl
);
3086 i
= TMPL_PARMS_DEPTH (parms
);
3087 if (TMPL_ARGS_DEPTH (args
) != i
)
3089 error ("expected %d levels of template parms for %q#D, got %d",
3090 i
, decl
, TMPL_ARGS_DEPTH (args
));
3093 for (current
= decl
; i
> 0; --i
, parms
= TREE_CHAIN (parms
))
3095 a
= TMPL_ARGS_LEVEL (args
, i
);
3096 t
= INNERMOST_TEMPLATE_PARMS (parms
);
3098 if (TREE_VEC_LENGTH (t
) != TREE_VEC_LENGTH (a
))
3100 if (current
== decl
)
3101 error ("got %d template parameters for %q#D",
3102 TREE_VEC_LENGTH (a
), decl
);
3104 error ("got %d template parameters for %q#T",
3105 TREE_VEC_LENGTH (a
), current
);
3106 error (" but %d required", TREE_VEC_LENGTH (t
));
3109 /* Perhaps we should also check that the parms are used in the
3110 appropriate qualifying scopes in the declarator? */
3112 if (current
== decl
)
3115 current
= TYPE_CONTEXT (current
);
3119 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
3120 TREE_TYPE (tmpl
) = TREE_TYPE (decl
);
3122 /* Push template declarations for global functions and types. Note
3123 that we do not try to push a global template friend declared in a
3124 template class; such a thing may well depend on the template
3125 parameters of the class. */
3126 if (new_template_p
&& !ctx
3127 && !(is_friend
&& template_class_depth (current_class_type
) > 0))
3129 tmpl
= pushdecl_namespace_level (tmpl
);
3130 if (tmpl
== error_mark_node
)
3131 return error_mark_node
;
3133 /* Hide template friend classes that haven't been declared yet. */
3134 if (is_friend
&& TREE_CODE (decl
) == TYPE_DECL
)
3136 DECL_ANTICIPATED (tmpl
) = 1;
3137 DECL_FRIEND_P (tmpl
) = 1;
3143 DECL_PRIMARY_TEMPLATE (tmpl
) = tmpl
;
3144 if (DECL_CONV_FN_P (tmpl
))
3146 int depth
= TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
));
3148 /* It is a conversion operator. See if the type converted to
3149 depends on innermost template operands. */
3151 if (uses_template_parms_level (TREE_TYPE (TREE_TYPE (tmpl
)),
3153 DECL_TEMPLATE_CONV_FN_P (tmpl
) = 1;
3157 /* The DECL_TI_ARGS of DECL contains full set of arguments referring
3158 back to its most general template. If TMPL is a specialization,
3159 ARGS may only have the innermost set of arguments. Add the missing
3160 argument levels if necessary. */
3161 if (DECL_TEMPLATE_INFO (tmpl
))
3162 args
= add_outermost_template_args (DECL_TI_ARGS (tmpl
), args
);
3164 info
= tree_cons (tmpl
, args
, NULL_TREE
);
3166 if (DECL_IMPLICIT_TYPEDEF_P (decl
))
3168 SET_TYPE_TEMPLATE_INFO (TREE_TYPE (tmpl
), info
);
3169 if ((!ctx
|| TREE_CODE (ctx
) != FUNCTION_DECL
)
3170 && TREE_CODE (TREE_TYPE (decl
)) != ENUMERAL_TYPE
3171 /* Don't change the name if we've already set it up. */
3172 && !IDENTIFIER_TEMPLATE (DECL_NAME (decl
)))
3173 DECL_NAME (decl
) = classtype_mangled_name (TREE_TYPE (decl
));
3175 else if (DECL_LANG_SPECIFIC (decl
))
3176 DECL_TEMPLATE_INFO (decl
) = info
;
3178 return DECL_TEMPLATE_RESULT (tmpl
);
3182 push_template_decl (tree decl
)
3184 return push_template_decl_real (decl
, 0);
3187 /* Called when a class template TYPE is redeclared with the indicated
3188 template PARMS, e.g.:
3190 template <class T> struct S;
3191 template <class T> struct S {}; */
3194 redeclare_class_template (tree type
, tree parms
)
3200 if (!TYPE_TEMPLATE_INFO (type
))
3202 error ("%qT is not a template type", type
);
3206 tmpl
= TYPE_TI_TEMPLATE (type
);
3207 if (!PRIMARY_TEMPLATE_P (tmpl
))
3208 /* The type is nested in some template class. Nothing to worry
3209 about here; there are no new template parameters for the nested
3215 error ("template specifiers not specified in declaration of %qD",
3220 parms
= INNERMOST_TEMPLATE_PARMS (parms
);
3221 tmpl_parms
= DECL_INNERMOST_TEMPLATE_PARMS (tmpl
);
3223 if (TREE_VEC_LENGTH (parms
) != TREE_VEC_LENGTH (tmpl_parms
))
3225 cp_error_at ("previous declaration %qD", tmpl
);
3226 error ("used %d template parameter%s instead of %d",
3227 TREE_VEC_LENGTH (tmpl_parms
),
3228 TREE_VEC_LENGTH (tmpl_parms
) == 1 ? "" : "s",
3229 TREE_VEC_LENGTH (parms
));
3233 for (i
= 0; i
< TREE_VEC_LENGTH (tmpl_parms
); ++i
)
3235 tree tmpl_parm
= TREE_VALUE (TREE_VEC_ELT (tmpl_parms
, i
));
3236 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
3237 tree tmpl_default
= TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
));
3238 tree parm_default
= TREE_PURPOSE (TREE_VEC_ELT (parms
, i
));
3240 /* TMPL_PARM and PARM can be either TYPE_DECL, PARM_DECL, or
3242 if (TREE_CODE (tmpl_parm
) != TREE_CODE (parm
)
3243 || (TREE_CODE (tmpl_parm
) != TYPE_DECL
3244 && !same_type_p (TREE_TYPE (tmpl_parm
), TREE_TYPE (parm
))))
3246 cp_error_at ("template parameter %q#D", tmpl_parm
);
3247 error ("redeclared here as %q#D", parm
);
3251 if (tmpl_default
!= NULL_TREE
&& parm_default
!= NULL_TREE
)
3253 /* We have in [temp.param]:
3255 A template-parameter may not be given default arguments
3256 by two different declarations in the same scope. */
3257 error ("redefinition of default argument for %q#D", parm
);
3258 error ("%J original definition appeared here", tmpl_parm
);
3262 if (parm_default
!= NULL_TREE
)
3263 /* Update the previous template parameters (which are the ones
3264 that will really count) with the new default value. */
3265 TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
)) = parm_default
;
3266 else if (tmpl_default
!= NULL_TREE
)
3267 /* Update the new parameters, too; they'll be used as the
3268 parameters for any members. */
3269 TREE_PURPOSE (TREE_VEC_ELT (parms
, i
)) = tmpl_default
;
3273 /* Simplify EXPR if it is a non-dependent expression. Returns the
3274 (possibly simplified) expression. */
3277 fold_non_dependent_expr (tree expr
)
3279 /* If we're in a template, but EXPR isn't value dependent, simplify
3280 it. We're supposed to treat:
3282 template <typename T> void f(T[1 + 1]);
3283 template <typename T> void f(T[2]);
3285 as two declarations of the same function, for example. */
3286 if (processing_template_decl
3287 && !type_dependent_expression_p (expr
)
3288 && !value_dependent_expression_p (expr
))
3290 HOST_WIDE_INT saved_processing_template_decl
;
3292 saved_processing_template_decl
= processing_template_decl
;
3293 processing_template_decl
= 0;
3294 expr
= tsubst_copy_and_build (expr
,
3297 /*in_decl=*/NULL_TREE
,
3298 /*function_p=*/false);
3299 processing_template_decl
= saved_processing_template_decl
;
3304 /* EXPR is an expression which is used in a constant-expression context.
3305 For instance, it could be a VAR_DECL with a constant initializer.
3306 Extract the innest constant expression.
3308 This is basically a more powerful version of
3309 integral_constant_value, which can be used also in templates where
3310 initializers can maintain a syntactic rather than semantic form
3311 (even if they are non-dependent, for access-checking purposes). */
3314 fold_decl_constant_value (tree expr
)
3316 tree const_expr
= expr
;
3319 expr
= fold_non_dependent_expr (const_expr
);
3320 const_expr
= integral_constant_value (expr
);
3322 while (expr
!= const_expr
);
3327 /* Subroutine of convert_nontype_argument. Converts EXPR to TYPE, which
3328 must be a function or a pointer-to-function type, as specified
3329 in [temp.arg.nontype]: disambiguate EXPR if it is an overload set,
3330 and check that the resulting function has external linkage. */
3333 convert_nontype_argument_function (tree type
, tree expr
)
3338 fn
= instantiate_type (type
, fns
, tf_none
);
3339 if (fn
== error_mark_node
)
3340 return error_mark_node
;
3343 if (TREE_CODE (fn_no_ptr
) == ADDR_EXPR
)
3344 fn_no_ptr
= TREE_OPERAND (fn_no_ptr
, 0);
3346 /* [temp.arg.nontype]/1
3348 A template-argument for a non-type, non-template template-parameter
3351 -- the address of an object or function with external linkage. */
3352 if (!DECL_EXTERNAL_LINKAGE_P (fn_no_ptr
))
3354 error ("%qE is not a valid template argument for type %qT "
3355 "because function %qD has not external linkage",
3356 expr
, type
, fn_no_ptr
);
3363 /* Attempt to convert the non-type template parameter EXPR to the
3364 indicated TYPE. If the conversion is successful, return the
3365 converted value. If the conversion is unsuccessful, return
3366 NULL_TREE if we issued an error message, or error_mark_node if we
3367 did not. We issue error messages for out-and-out bad template
3368 parameters, but not simply because the conversion failed, since we
3369 might be just trying to do argument deduction. Both TYPE and EXPR
3370 must be non-dependent.
3372 The conversion follows the special rules described in
3373 [temp.arg.nontype], and it is much more strict than an implicit
3376 This function is called twice for each template argument (see
3377 lookup_template_class for a more accurate description of this
3378 problem). This means that we need to handle expressions which
3379 are not valid in a C++ source, but can be created from the
3380 first call (for instance, casts to perform conversions). These
3381 hacks can go away after we fix the double coercion problem. */
3384 convert_nontype_argument (tree type
, tree expr
)
3388 /* Detect immediately string literals as invalid non-type argument.
3389 This special-case is not needed for correctness (we would easily
3390 catch this later), but only to provide better diagnostic for this
3391 common user mistake. As suggested by DR 100, we do not mention
3392 linkage issues in the diagnostic as this is not the point. */
3393 if (TREE_CODE (expr
) == STRING_CST
)
3395 error ("%qE is not a valid template argument for type %qT "
3396 "because string literals can never be used in this context",
3401 /* If we are in a template, EXPR may be non-dependent, but still
3402 have a syntactic, rather than semantic, form. For example, EXPR
3403 might be a SCOPE_REF, rather than the VAR_DECL to which the
3404 SCOPE_REF refers. Preserving the qualifying scope is necessary
3405 so that access checking can be performed when the template is
3406 instantiated -- but here we need the resolved form so that we can
3407 convert the argument. */
3408 expr
= fold_non_dependent_expr (expr
);
3409 expr_type
= TREE_TYPE (expr
);
3411 /* HACK: Due to double coercion, we can get a
3412 NOP_EXPR<REFERENCE_TYPE>(ADDR_EXPR<POINTER_TYPE> (arg)) here,
3413 which is the tree that we built on the first call (see
3414 below when coercing to reference to object or to reference to
3415 function). We just strip everything and get to the arg.
3416 See g++.old-deja/g++.oliva/template4.C and g++.dg/template/nontype9.C
3418 if (TREE_CODE (expr
) == NOP_EXPR
)
3420 if (TYPE_REF_OBJ_P (type
) || TYPE_REFFN_P (type
))
3422 /* ??? Maybe we could use convert_from_reference here, but we
3423 would need to relax its constraints because the NOP_EXPR
3424 could actually change the type to something more cv-qualified,
3425 and this is not folded by convert_from_reference. */
3426 tree addr
= TREE_OPERAND (expr
, 0);
3427 gcc_assert (TREE_CODE (expr_type
) == REFERENCE_TYPE
);
3428 gcc_assert (TREE_CODE (addr
) == ADDR_EXPR
);
3429 gcc_assert (TREE_CODE (TREE_TYPE (addr
)) == POINTER_TYPE
);
3430 gcc_assert (same_type_ignoring_top_level_qualifiers_p
3431 (TREE_TYPE (expr_type
),
3432 TREE_TYPE (TREE_TYPE (addr
))));
3434 expr
= TREE_OPERAND (addr
, 0);
3435 expr_type
= TREE_TYPE (expr
);
3438 /* We could also generate a NOP_EXPR(ADDR_EXPR()) when the
3439 parameter is a pointer to object, through decay and
3440 qualification conversion. Let's strip everything. */
3441 else if (TYPE_PTROBV_P (type
))
3444 gcc_assert (TREE_CODE (expr
) == ADDR_EXPR
);
3445 gcc_assert (TREE_CODE (TREE_TYPE (expr
)) == POINTER_TYPE
);
3446 /* Skip the ADDR_EXPR only if it is part of the decay for
3447 an array. Otherwise, it is part of the original argument
3448 in the source code. */
3449 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (expr
, 0))) == ARRAY_TYPE
)
3450 expr
= TREE_OPERAND (expr
, 0);
3451 expr_type
= TREE_TYPE (expr
);
3455 /* [temp.arg.nontype]/5, bullet 1
3457 For a non-type template-parameter of integral or enumeration type,
3458 integral promotions (_conv.prom_) and integral conversions
3459 (_conv.integral_) are applied. */
3460 if (INTEGRAL_TYPE_P (type
))
3462 if (!INTEGRAL_TYPE_P (expr_type
))
3463 return error_mark_node
;
3465 expr
= fold_decl_constant_value (expr
);
3466 /* Notice that there are constant expressions like '4 % 0' which
3467 do not fold into integer constants. */
3468 if (TREE_CODE (expr
) != INTEGER_CST
)
3470 error ("%qE is not a valid template argument for type %qT "
3471 "because it is a non-constant expression", expr
, type
);
3475 /* At this point, an implicit conversion does what we want,
3476 because we already know that the expression is of integral
3478 expr
= ocp_convert (type
, expr
, CONV_IMPLICIT
, LOOKUP_PROTECT
);
3479 if (expr
== error_mark_node
)
3480 return error_mark_node
;
3482 /* Conversion was allowed: fold it to a bare integer constant. */
3485 /* [temp.arg.nontype]/5, bullet 2
3487 For a non-type template-parameter of type pointer to object,
3488 qualification conversions (_conv.qual_) and the array-to-pointer
3489 conversion (_conv.array_) are applied. */
3490 else if (TYPE_PTROBV_P (type
))
3492 /* [temp.arg.nontype]/1 (TC1 version, DR 49):
3494 A template-argument for a non-type, non-template template-parameter
3495 shall be one of: [...]
3497 -- the name of a non-type template-parameter;
3498 -- the address of an object or function with external linkage, [...]
3499 expressed as "& id-expression" where the & is optional if the name
3500 refers to a function or array, or if the corresponding
3501 template-parameter is a reference.
3503 Here, we do not care about functions, as they are invalid anyway
3504 for a parameter of type pointer-to-object. */
3505 bool constant_address_p
=
3506 (TREE_CODE (expr
) == ADDR_EXPR
3507 || TREE_CODE (expr_type
) == ARRAY_TYPE
3508 || (DECL_P (expr
) && DECL_TEMPLATE_PARM_P (expr
)));
3510 expr
= decay_conversion (expr
);
3511 if (expr
== error_mark_node
)
3512 return error_mark_node
;
3514 expr
= perform_qualification_conversions (type
, expr
);
3515 if (expr
== error_mark_node
)
3516 return error_mark_node
;
3518 if (!constant_address_p
)
3520 error ("%qE is not a valid template argument for type %qT "
3521 "because it is not a constant pointer", expr
, type
);
3525 /* [temp.arg.nontype]/5, bullet 3
3527 For a non-type template-parameter of type reference to object, no
3528 conversions apply. The type referred to by the reference may be more
3529 cv-qualified than the (otherwise identical) type of the
3530 template-argument. The template-parameter is bound directly to the
3531 template-argument, which must be an lvalue. */
3532 else if (TYPE_REF_OBJ_P (type
))
3534 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type
),
3536 return error_mark_node
;
3538 if (!at_least_as_qualified_p (TREE_TYPE (type
), expr_type
))
3540 error ("%qE is not a valid template argument for type %qT "
3541 "because of conflicts in cv-qualification", expr
, type
);
3545 if (!real_lvalue_p (expr
))
3547 error ("%qE is not a valid template argument for type %qT "
3548 "because it is not a lvalue", expr
, type
);
3552 /* [temp.arg.nontype]/1
3554 A template-argument for a non-type, non-template template-parameter
3555 shall be one of: [...]
3557 -- the address of an object or function with external linkage. */
3558 if (!DECL_EXTERNAL_LINKAGE_P (expr
))
3560 error ("%qE is not a valid template argument for type %qT "
3561 "because object %qD has not external linkage",
3566 expr
= build_nop (type
, build_address (expr
));
3568 /* [temp.arg.nontype]/5, bullet 4
3570 For a non-type template-parameter of type pointer to function, only
3571 the function-to-pointer conversion (_conv.func_) is applied. If the
3572 template-argument represents a set of overloaded functions (or a
3573 pointer to such), the matching function is selected from the set
3575 else if (TYPE_PTRFN_P (type
))
3577 /* If the argument is a template-id, we might not have enough
3578 context information to decay the pointer.
3579 ??? Why static5.C requires decay and subst1.C works fine
3581 if (!type_unknown_p (expr_type
))
3583 expr
= decay_conversion (expr
);
3584 if (expr
== error_mark_node
)
3585 return error_mark_node
;
3588 expr
= convert_nontype_argument_function (type
, expr
);
3589 if (!expr
|| expr
== error_mark_node
)
3592 /* [temp.arg.nontype]/5, bullet 5
3594 For a non-type template-parameter of type reference to function, no
3595 conversions apply. If the template-argument represents a set of
3596 overloaded functions, the matching function is selected from the set
3598 else if (TYPE_REFFN_P (type
))
3600 if (TREE_CODE (expr
) == ADDR_EXPR
)
3602 error ("%qE is not a valid template argument for type %qT "
3603 "because it is a pointer", expr
, type
);
3604 inform ("try using %qE instead", TREE_OPERAND (expr
, 0));
3608 expr
= convert_nontype_argument_function (TREE_TYPE (type
), expr
);
3609 if (!expr
|| expr
== error_mark_node
)
3612 expr
= build_nop (type
, build_address (expr
));
3614 /* [temp.arg.nontype]/5, bullet 6
3616 For a non-type template-parameter of type pointer to member function,
3617 no conversions apply. If the template-argument represents a set of
3618 overloaded member functions, the matching member function is selected
3619 from the set (_over.over_). */
3620 else if (TYPE_PTRMEMFUNC_P (type
))
3622 expr
= instantiate_type (type
, expr
, tf_none
);
3623 if (expr
== error_mark_node
)
3624 return error_mark_node
;
3626 /* There is no way to disable standard conversions in
3627 resolve_address_of_overloaded_function (called by
3628 instantiate_type). It is possible that the call succeeded by
3629 converting &B::I to &D::I (where B is a base of D), so we need
3630 to reject this conversion here.
3632 Actually, even if there was a way to disable standard conversions,
3633 it would still be better to reject them here so that we can
3634 provide a superior diagnostic. */
3635 if (!same_type_p (TREE_TYPE (expr
), type
))
3637 /* Make sure we are just one standard conversion off. */
3638 gcc_assert (can_convert (type
, TREE_TYPE (expr
)));
3639 error ("%qE is not a valid template argument for type %qT "
3640 "because it is of type %qT", expr
, type
,
3642 inform ("standard conversions are not allowed in this context");
3646 /* [temp.arg.nontype]/5, bullet 7
3648 For a non-type template-parameter of type pointer to data member,
3649 qualification conversions (_conv.qual_) are applied. */
3650 else if (TYPE_PTRMEM_P (type
))
3652 expr
= perform_qualification_conversions (type
, expr
);
3653 if (expr
== error_mark_node
)
3656 /* A template non-type parameter must be one of the above. */
3660 /* Sanity check: did we actually convert the argument to the
3662 gcc_assert (same_type_p (type
, TREE_TYPE (expr
)));
3667 /* Return 1 if PARM_PARMS and ARG_PARMS matches using rule for
3668 template template parameters. Both PARM_PARMS and ARG_PARMS are
3669 vectors of TREE_LIST nodes containing TYPE_DECL, TEMPLATE_DECL
3672 ARG_PARMS may contain more parameters than PARM_PARMS. If this is
3673 the case, then extra parameters must have default arguments.
3675 Consider the example:
3676 template <class T, class Allocator = allocator> class vector;
3677 template<template <class U> class TT> class C;
3679 C<vector> is a valid instantiation. PARM_PARMS for the above code
3680 contains a TYPE_DECL (for U), ARG_PARMS contains two TYPE_DECLs (for
3681 T and Allocator) and OUTER_ARGS contains the argument that is used to
3682 substitute the TT parameter. */
3685 coerce_template_template_parms (tree parm_parms
,
3687 tsubst_flags_t complain
,
3691 int nparms
, nargs
, i
;
3694 gcc_assert (TREE_CODE (parm_parms
) == TREE_VEC
);
3695 gcc_assert (TREE_CODE (arg_parms
) == TREE_VEC
);
3697 nparms
= TREE_VEC_LENGTH (parm_parms
);
3698 nargs
= TREE_VEC_LENGTH (arg_parms
);
3700 /* The rule here is opposite of coerce_template_parms. */
3703 && TREE_PURPOSE (TREE_VEC_ELT (arg_parms
, nparms
)) == NULL_TREE
))
3706 for (i
= 0; i
< nparms
; ++i
)
3708 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, i
));
3709 arg
= TREE_VALUE (TREE_VEC_ELT (arg_parms
, i
));
3711 if (arg
== NULL_TREE
|| arg
== error_mark_node
3712 || parm
== NULL_TREE
|| parm
== error_mark_node
)
3715 if (TREE_CODE (arg
) != TREE_CODE (parm
))
3718 switch (TREE_CODE (parm
))
3724 /* We encounter instantiations of templates like
3725 template <template <template <class> class> class TT>
3728 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
3729 tree argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
3731 if (!coerce_template_template_parms
3732 (parmparm
, argparm
, complain
, in_decl
, outer_args
))
3738 /* The tsubst call is used to handle cases such as
3740 template <int> class C {};
3741 template <class T, template <T> class TT> class D {};
3744 i.e. the parameter list of TT depends on earlier parameters. */
3745 if (!dependent_type_p (TREE_TYPE (arg
))
3747 (tsubst (TREE_TYPE (parm
), outer_args
, complain
, in_decl
),
3759 /* Convert the indicated template ARG as necessary to match the
3760 indicated template PARM. Returns the converted ARG, or
3761 error_mark_node if the conversion was unsuccessful. Error and
3762 warning messages are issued under control of COMPLAIN. This
3763 conversion is for the Ith parameter in the parameter list. ARGS is
3764 the full set of template arguments deduced so far. */
3767 convert_template_argument (tree parm
,
3770 tsubst_flags_t complain
,
3776 int is_type
, requires_type
, is_tmpl_type
, requires_tmpl_type
;
3778 inner_args
= INNERMOST_TEMPLATE_ARGS (args
);
3780 if (TREE_CODE (arg
) == TREE_LIST
3781 && TREE_CODE (TREE_VALUE (arg
)) == OFFSET_REF
)
3783 /* The template argument was the name of some
3784 member function. That's usually
3785 invalid, but static members are OK. In any
3786 case, grab the underlying fields/functions
3787 and issue an error later if required. */
3788 arg
= TREE_VALUE (arg
);
3789 TREE_TYPE (arg
) = unknown_type_node
;
3792 requires_tmpl_type
= TREE_CODE (parm
) == TEMPLATE_DECL
;
3793 requires_type
= (TREE_CODE (parm
) == TYPE_DECL
3794 || requires_tmpl_type
);
3796 is_tmpl_type
= ((TREE_CODE (arg
) == TEMPLATE_DECL
3797 && TREE_CODE (DECL_TEMPLATE_RESULT (arg
)) == TYPE_DECL
)
3798 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
3799 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
);
3802 && (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
3803 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
))
3804 arg
= TYPE_STUB_DECL (arg
);
3806 is_type
= TYPE_P (arg
) || is_tmpl_type
;
3808 if (requires_type
&& ! is_type
&& TREE_CODE (arg
) == SCOPE_REF
3809 && TREE_CODE (TREE_OPERAND (arg
, 0)) == TEMPLATE_TYPE_PARM
)
3811 pedwarn ("to refer to a type member of a template parameter, "
3812 "use %<typename %E%>", arg
);
3814 arg
= make_typename_type (TREE_OPERAND (arg
, 0),
3815 TREE_OPERAND (arg
, 1),
3817 complain
& tf_error
);
3820 if (is_type
!= requires_type
)
3824 if (complain
& tf_error
)
3826 error ("type/value mismatch at argument %d in template "
3827 "parameter list for %qD",
3830 error (" expected a constant of type %qT, got %qT",
3832 (is_tmpl_type
? DECL_NAME (arg
) : arg
));
3833 else if (requires_tmpl_type
)
3834 error (" expected a class template, got %qE", arg
);
3836 error (" expected a type, got %qE", arg
);
3839 return error_mark_node
;
3841 if (is_tmpl_type
^ requires_tmpl_type
)
3843 if (in_decl
&& (complain
& tf_error
))
3845 error ("type/value mismatch at argument %d in template "
3846 "parameter list for %qD",
3849 error (" expected a type, got %qT", DECL_NAME (arg
));
3851 error (" expected a class template, got %qT", arg
);
3853 return error_mark_node
;
3858 if (requires_tmpl_type
)
3860 if (TREE_CODE (TREE_TYPE (arg
)) == UNBOUND_CLASS_TEMPLATE
)
3861 /* The number of argument required is not known yet.
3862 Just accept it for now. */
3863 val
= TREE_TYPE (arg
);
3866 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
3867 tree argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
3869 if (coerce_template_template_parms (parmparm
, argparm
,
3875 /* TEMPLATE_TEMPLATE_PARM node is preferred over
3877 if (val
!= error_mark_node
3878 && DECL_TEMPLATE_TEMPLATE_PARM_P (val
))
3879 val
= TREE_TYPE (val
);
3883 if (in_decl
&& (complain
& tf_error
))
3885 error ("type/value mismatch at argument %d in "
3886 "template parameter list for %qD",
3888 error (" expected a template of type %qD, got %qD",
3892 val
= error_mark_node
;
3901 tree t
= tsubst (TREE_TYPE (parm
), args
, complain
, in_decl
);
3903 if (invalid_nontype_parm_type_p (t
, complain
))
3904 return error_mark_node
;
3906 if (!uses_template_parms (arg
) && !uses_template_parms (t
))
3907 /* We used to call digest_init here. However, digest_init
3908 will report errors, which we don't want when complain
3909 is zero. More importantly, digest_init will try too
3910 hard to convert things: for example, `0' should not be
3911 converted to pointer type at this point according to
3912 the standard. Accepting this is not merely an
3913 extension, since deciding whether or not these
3914 conversions can occur is part of determining which
3915 function template to call, or whether a given explicit
3916 argument specification is valid. */
3917 val
= convert_nontype_argument (t
, arg
);
3921 if (val
== NULL_TREE
)
3922 val
= error_mark_node
;
3923 else if (val
== error_mark_node
&& (complain
& tf_error
))
3924 error ("could not convert template argument %qE to %qT", arg
, t
);
3930 /* Convert all template arguments to their appropriate types, and
3931 return a vector containing the innermost resulting template
3932 arguments. If any error occurs, return error_mark_node. Error and
3933 warning messages are issued under control of COMPLAIN.
3935 If REQUIRE_ALL_ARGUMENTS is nonzero, all arguments must be
3936 provided in ARGLIST, or else trailing parameters must have default
3937 values. If REQUIRE_ALL_ARGUMENTS is zero, we will attempt argument
3938 deduction for any unspecified trailing arguments. */
3941 coerce_template_parms (tree parms
,
3944 tsubst_flags_t complain
,
3945 int require_all_arguments
)
3947 int nparms
, nargs
, i
, lost
= 0;
3950 tree new_inner_args
;
3952 inner_args
= INNERMOST_TEMPLATE_ARGS (args
);
3953 nargs
= inner_args
? NUM_TMPL_ARGS (inner_args
) : 0;
3954 nparms
= TREE_VEC_LENGTH (parms
);
3958 && require_all_arguments
3959 && TREE_PURPOSE (TREE_VEC_ELT (parms
, nargs
)) == NULL_TREE
))
3961 if (complain
& tf_error
)
3963 error ("wrong number of template arguments (%d, should be %d)",
3967 cp_error_at ("provided for %qD", in_decl
);
3970 return error_mark_node
;
3973 new_inner_args
= make_tree_vec (nparms
);
3974 new_args
= add_outermost_template_args (args
, new_inner_args
);
3975 for (i
= 0; i
< nparms
; i
++)
3980 /* Get the Ith template parameter. */
3981 parm
= TREE_VEC_ELT (parms
, i
);
3983 /* Calculate the Ith argument. */
3985 arg
= TREE_VEC_ELT (inner_args
, i
);
3986 else if (require_all_arguments
)
3987 /* There must be a default arg in this case. */
3988 arg
= tsubst_template_arg (TREE_PURPOSE (parm
), new_args
,
3994 if (arg
== error_mark_node
)
3996 if (complain
& tf_error
)
3997 error ("template argument %d is invalid", i
+ 1);
4000 arg
= convert_template_argument (TREE_VALUE (parm
),
4001 arg
, new_args
, complain
, i
,
4004 if (arg
== error_mark_node
)
4006 TREE_VEC_ELT (new_inner_args
, i
) = arg
;
4010 return error_mark_node
;
4012 return new_inner_args
;
4015 /* Returns 1 if template args OT and NT are equivalent. */
4018 template_args_equal (tree ot
, tree nt
)
4023 if (TREE_CODE (nt
) == TREE_VEC
)
4024 /* For member templates */
4025 return TREE_CODE (ot
) == TREE_VEC
&& comp_template_args (ot
, nt
);
4026 else if (TYPE_P (nt
))
4027 return TYPE_P (ot
) && same_type_p (ot
, nt
);
4028 else if (TREE_CODE (ot
) == TREE_VEC
|| TYPE_P (ot
))
4031 return cp_tree_equal (ot
, nt
);
4034 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets
4035 of template arguments. Returns 0 otherwise. */
4038 comp_template_args (tree oldargs
, tree newargs
)
4042 if (TREE_VEC_LENGTH (oldargs
) != TREE_VEC_LENGTH (newargs
))
4045 for (i
= 0; i
< TREE_VEC_LENGTH (oldargs
); ++i
)
4047 tree nt
= TREE_VEC_ELT (newargs
, i
);
4048 tree ot
= TREE_VEC_ELT (oldargs
, i
);
4050 if (! template_args_equal (ot
, nt
))
4056 /* Given class template name and parameter list, produce a user-friendly name
4057 for the instantiation. */
4060 mangle_class_name_for_template (const char* name
, tree parms
, tree arglist
)
4062 static struct obstack scratch_obstack
;
4063 static char *scratch_firstobj
;
4066 if (!scratch_firstobj
)
4067 gcc_obstack_init (&scratch_obstack
);
4069 obstack_free (&scratch_obstack
, scratch_firstobj
);
4070 scratch_firstobj
= obstack_alloc (&scratch_obstack
, 1);
4072 #define ccat(C) obstack_1grow (&scratch_obstack, (C));
4073 #define cat(S) obstack_grow (&scratch_obstack, (S), strlen (S))
4077 nparms
= TREE_VEC_LENGTH (parms
);
4078 arglist
= INNERMOST_TEMPLATE_ARGS (arglist
);
4079 gcc_assert (nparms
== TREE_VEC_LENGTH (arglist
));
4080 for (i
= 0; i
< nparms
; i
++)
4082 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
4083 tree arg
= TREE_VEC_ELT (arglist
, i
);
4088 if (TREE_CODE (parm
) == TYPE_DECL
)
4090 cat (type_as_string (arg
, TFF_CHASE_TYPEDEF
));
4093 else if (TREE_CODE (parm
) == TEMPLATE_DECL
)
4095 if (TREE_CODE (arg
) == TEMPLATE_DECL
)
4097 /* Already substituted with real template. Just output
4098 the template name here */
4099 tree context
= DECL_CONTEXT (arg
);
4102 /* The template may be defined in a namespace, or
4103 may be a member template. */
4104 gcc_assert (TREE_CODE (context
) == NAMESPACE_DECL
4105 || CLASS_TYPE_P (context
));
4106 cat (decl_as_string (DECL_CONTEXT (arg
),
4107 TFF_PLAIN_IDENTIFIER
));
4110 cat (IDENTIFIER_POINTER (DECL_NAME (arg
)));
4113 /* Output the parameter declaration. */
4114 cat (type_as_string (arg
, TFF_CHASE_TYPEDEF
));
4118 gcc_assert (TREE_CODE (parm
) == PARM_DECL
);
4120 /* No need to check arglist against parmlist here; we did that
4121 in coerce_template_parms, called from lookup_template_class. */
4122 cat (expr_as_string (arg
, TFF_PLAIN_IDENTIFIER
));
4125 char *bufp
= obstack_next_free (&scratch_obstack
);
4127 while (bufp
[offset
- 1] == ' ')
4129 obstack_blank_fast (&scratch_obstack
, offset
);
4131 /* B<C<char> >, not B<C<char>> */
4132 if (bufp
[offset
- 1] == '>')
4137 return (char *) obstack_base (&scratch_obstack
);
4141 classtype_mangled_name (tree t
)
4143 if (CLASSTYPE_TEMPLATE_INFO (t
)
4144 /* Specializations have already had their names set up in
4145 lookup_template_class. */
4146 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
4148 tree tmpl
= most_general_template (CLASSTYPE_TI_TEMPLATE (t
));
4150 /* For non-primary templates, the template parameters are
4151 implicit from their surrounding context. */
4152 if (PRIMARY_TEMPLATE_P (tmpl
))
4154 tree name
= DECL_NAME (tmpl
);
4155 char *mangled_name
= mangle_class_name_for_template
4156 (IDENTIFIER_POINTER (name
),
4157 DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
4158 CLASSTYPE_TI_ARGS (t
));
4159 tree id
= get_identifier (mangled_name
);
4160 IDENTIFIER_TEMPLATE (id
) = name
;
4165 return TYPE_IDENTIFIER (t
);
4169 add_pending_template (tree d
)
4171 tree ti
= (TYPE_P (d
)
4172 ? CLASSTYPE_TEMPLATE_INFO (d
)
4173 : DECL_TEMPLATE_INFO (d
));
4177 if (TI_PENDING_TEMPLATE_FLAG (ti
))
4180 /* We are called both from instantiate_decl, where we've already had a
4181 tinst_level pushed, and instantiate_template, where we haven't.
4183 level
= !(current_tinst_level
&& TINST_DECL (current_tinst_level
) == d
);
4186 push_tinst_level (d
);
4188 pt
= tree_cons (current_tinst_level
, d
, NULL_TREE
);
4189 if (last_pending_template
)
4190 TREE_CHAIN (last_pending_template
) = pt
;
4192 pending_templates
= pt
;
4194 last_pending_template
= pt
;
4196 TI_PENDING_TEMPLATE_FLAG (ti
) = 1;
4203 /* Return a TEMPLATE_ID_EXPR corresponding to the indicated FNS and
4204 ARGLIST. Valid choices for FNS are given in the cp-tree.def
4205 documentation for TEMPLATE_ID_EXPR. */
4208 lookup_template_function (tree fns
, tree arglist
)
4212 if (fns
== error_mark_node
|| arglist
== error_mark_node
)
4213 return error_mark_node
;
4215 gcc_assert (!arglist
|| TREE_CODE (arglist
) == TREE_VEC
);
4216 gcc_assert (fns
&& (is_overloaded_fn (fns
)
4217 || TREE_CODE (fns
) == IDENTIFIER_NODE
));
4219 if (BASELINK_P (fns
))
4221 BASELINK_FUNCTIONS (fns
) = build2 (TEMPLATE_ID_EXPR
,
4223 BASELINK_FUNCTIONS (fns
),
4228 type
= TREE_TYPE (fns
);
4229 if (TREE_CODE (fns
) == OVERLOAD
|| !type
)
4230 type
= unknown_type_node
;
4232 return build2 (TEMPLATE_ID_EXPR
, type
, fns
, arglist
);
4235 /* Within the scope of a template class S<T>, the name S gets bound
4236 (in build_self_reference) to a TYPE_DECL for the class, not a
4237 TEMPLATE_DECL. If DECL is a TYPE_DECL for current_class_type,
4238 or one of its enclosing classes, and that type is a template,
4239 return the associated TEMPLATE_DECL. Otherwise, the original
4240 DECL is returned. */
4243 maybe_get_template_decl_from_type_decl (tree decl
)
4245 return (decl
!= NULL_TREE
4246 && TREE_CODE (decl
) == TYPE_DECL
4247 && DECL_ARTIFICIAL (decl
)
4248 && CLASS_TYPE_P (TREE_TYPE (decl
))
4249 && CLASSTYPE_TEMPLATE_INFO (TREE_TYPE (decl
)))
4250 ? CLASSTYPE_TI_TEMPLATE (TREE_TYPE (decl
)) : decl
;
4253 /* Given an IDENTIFIER_NODE (type TEMPLATE_DECL) and a chain of
4254 parameters, find the desired type.
4256 D1 is the PTYPENAME terminal, and ARGLIST is the list of arguments.
4258 IN_DECL, if non-NULL, is the template declaration we are trying to
4261 If ENTERING_SCOPE is nonzero, we are about to enter the scope of
4262 the class we are looking up.
4264 Issue error and warning messages under control of COMPLAIN.
4266 If the template class is really a local class in a template
4267 function, then the FUNCTION_CONTEXT is the function in which it is
4270 ??? Note that this function is currently called *twice* for each
4271 template-id: the first time from the parser, while creating the
4272 incomplete type (finish_template_type), and the second type during the
4273 real instantiation (instantiate_template_class). This is surely something
4274 that we want to avoid. It also causes some problems with argument
4275 coercion (see convert_nontype_argument for more information on this). */
4278 lookup_template_class (tree d1
,
4283 tsubst_flags_t complain
)
4285 tree
template = NULL_TREE
, parmlist
;
4288 timevar_push (TV_NAME_LOOKUP
);
4290 if (TREE_CODE (d1
) == IDENTIFIER_NODE
)
4292 tree value
= innermost_non_namespace_value (d1
);
4293 if (value
&& DECL_TEMPLATE_TEMPLATE_PARM_P (value
))
4298 push_decl_namespace (context
);
4299 template = lookup_name (d1
, /*prefer_type=*/0);
4300 template = maybe_get_template_decl_from_type_decl (template);
4302 pop_decl_namespace ();
4305 context
= DECL_CONTEXT (template);
4307 else if (TREE_CODE (d1
) == TYPE_DECL
&& IS_AGGR_TYPE (TREE_TYPE (d1
)))
4309 tree type
= TREE_TYPE (d1
);
4311 /* If we are declaring a constructor, say A<T>::A<T>, we will get
4312 an implicit typename for the second A. Deal with it. */
4313 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
4314 type
= TREE_TYPE (type
);
4316 if (CLASSTYPE_TEMPLATE_INFO (type
))
4318 template = CLASSTYPE_TI_TEMPLATE (type
);
4319 d1
= DECL_NAME (template);
4322 else if (TREE_CODE (d1
) == ENUMERAL_TYPE
4323 || (TYPE_P (d1
) && IS_AGGR_TYPE (d1
)))
4325 template = TYPE_TI_TEMPLATE (d1
);
4326 d1
= DECL_NAME (template);
4328 else if (TREE_CODE (d1
) == TEMPLATE_DECL
4329 && TREE_CODE (DECL_TEMPLATE_RESULT (d1
)) == TYPE_DECL
)
4332 d1
= DECL_NAME (template);
4333 context
= DECL_CONTEXT (template);
4336 /* Issue an error message if we didn't find a template. */
4339 if (complain
& tf_error
)
4340 error ("%qT is not a template", d1
);
4341 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP
, error_mark_node
);
4344 if (TREE_CODE (template) != TEMPLATE_DECL
4345 /* Make sure it's a user visible template, if it was named by
4347 || ((complain
& tf_user
) && !DECL_TEMPLATE_PARM_P (template)
4348 && !PRIMARY_TEMPLATE_P (template)))
4350 if (complain
& tf_error
)
4352 error ("non-template type %qT used as a template", d1
);
4354 cp_error_at ("for template declaration %qD", in_decl
);
4356 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP
, error_mark_node
);
4359 complain
&= ~tf_user
;
4361 if (DECL_TEMPLATE_TEMPLATE_PARM_P (template))
4363 /* Create a new TEMPLATE_DECL and TEMPLATE_TEMPLATE_PARM node to store
4364 template arguments */
4369 parmlist
= DECL_INNERMOST_TEMPLATE_PARMS (template);
4371 /* Consider an example where a template template parameter declared as
4373 template <class T, class U = std::allocator<T> > class TT
4375 The template parameter level of T and U are one level larger than
4376 of TT. To proper process the default argument of U, say when an
4377 instantiation `TT<int>' is seen, we need to build the full
4378 arguments containing {int} as the innermost level. Outer levels,
4379 available when not appearing as default template argument, can be
4380 obtained from `current_template_args ()'.
4382 Suppose that TT is later substituted with std::vector. The above
4383 instantiation is `TT<int, std::allocator<T> >' with TT at
4384 level 1, and T at level 2, while the template arguments at level 1
4385 becomes {std::vector} and the inner level 2 is {int}. */
4387 if (current_template_parms
)
4388 arglist
= add_to_template_args (current_template_args (), arglist
);
4390 arglist2
= coerce_template_parms (parmlist
, arglist
, template,
4391 complain
, /*require_all_args=*/1);
4392 if (arglist2
== error_mark_node
4393 || (!uses_template_parms (arglist2
)
4394 && check_instantiated_args (template, arglist2
, complain
)))
4395 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP
, error_mark_node
);
4397 parm
= bind_template_template_parm (TREE_TYPE (template), arglist2
);
4398 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP
, parm
);
4402 tree template_type
= TREE_TYPE (template);
4405 tree found
= NULL_TREE
;
4408 int is_partial_instantiation
;
4410 gen_tmpl
= most_general_template (template);
4411 parmlist
= DECL_TEMPLATE_PARMS (gen_tmpl
);
4412 parm_depth
= TMPL_PARMS_DEPTH (parmlist
);
4413 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
4415 if (arg_depth
== 1 && parm_depth
> 1)
4417 /* We've been given an incomplete set of template arguments.
4420 template <class T> struct S1 {
4421 template <class U> struct S2 {};
4422 template <class U> struct S2<U*> {};
4425 we will be called with an ARGLIST of `U*', but the
4426 TEMPLATE will be `template <class T> template
4427 <class U> struct S1<T>::S2'. We must fill in the missing
4430 = add_outermost_template_args (TYPE_TI_ARGS (TREE_TYPE (template)),
4432 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
4435 /* Now we should have enough arguments. */
4436 gcc_assert (parm_depth
== arg_depth
);
4438 /* From here on, we're only interested in the most general
4440 template = gen_tmpl
;
4442 /* Calculate the BOUND_ARGS. These will be the args that are
4443 actually tsubst'd into the definition to create the
4447 /* We have multiple levels of arguments to coerce, at once. */
4449 int saved_depth
= TMPL_ARGS_DEPTH (arglist
);
4451 tree bound_args
= make_tree_vec (parm_depth
);
4453 for (i
= saved_depth
,
4454 t
= DECL_TEMPLATE_PARMS (template);
4455 i
> 0 && t
!= NULL_TREE
;
4456 --i
, t
= TREE_CHAIN (t
))
4458 tree a
= coerce_template_parms (TREE_VALUE (t
),
4460 complain
, /*require_all_args=*/1);
4462 /* Don't process further if one of the levels fails. */
4463 if (a
== error_mark_node
)
4465 /* Restore the ARGLIST to its full size. */
4466 TREE_VEC_LENGTH (arglist
) = saved_depth
;
4467 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP
, error_mark_node
);
4470 SET_TMPL_ARGS_LEVEL (bound_args
, i
, a
);
4472 /* We temporarily reduce the length of the ARGLIST so
4473 that coerce_template_parms will see only the arguments
4474 corresponding to the template parameters it is
4476 TREE_VEC_LENGTH (arglist
)--;
4479 /* Restore the ARGLIST to its full size. */
4480 TREE_VEC_LENGTH (arglist
) = saved_depth
;
4482 arglist
= bound_args
;
4486 = coerce_template_parms (INNERMOST_TEMPLATE_PARMS (parmlist
),
4487 INNERMOST_TEMPLATE_ARGS (arglist
),
4489 complain
, /*require_all_args=*/1);
4491 if (arglist
== error_mark_node
)
4492 /* We were unable to bind the arguments. */
4493 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP
, error_mark_node
);
4495 /* In the scope of a template class, explicit references to the
4496 template class refer to the type of the template, not any
4497 instantiation of it. For example, in:
4499 template <class T> class C { void f(C<T>); }
4501 the `C<T>' is just the same as `C'. Outside of the
4502 class, however, such a reference is an instantiation. */
4503 if (comp_template_args (TYPE_TI_ARGS (template_type
),
4506 found
= template_type
;
4508 if (!entering_scope
&& PRIMARY_TEMPLATE_P (template))
4512 for (ctx
= current_class_type
;
4513 ctx
&& TREE_CODE (ctx
) != NAMESPACE_DECL
;
4515 ? TYPE_CONTEXT (ctx
)
4516 : DECL_CONTEXT (ctx
)))
4517 if (TYPE_P (ctx
) && same_type_p (ctx
, template_type
))
4520 /* We're not in the scope of the class, so the
4521 TEMPLATE_TYPE is not the type we want after all. */
4527 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP
, found
);
4529 /* If we already have this specialization, return it. */
4530 found
= retrieve_specialization (template, arglist
,
4531 /*class_specializations_p=*/false);
4533 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP
, found
);
4535 /* This type is a "partial instantiation" if any of the template
4536 arguments still involve template parameters. Note that we set
4537 IS_PARTIAL_INSTANTIATION for partial specializations as
4539 is_partial_instantiation
= uses_template_parms (arglist
);
4541 /* If the deduced arguments are invalid, then the binding
4543 if (!is_partial_instantiation
4544 && check_instantiated_args (template,
4545 INNERMOST_TEMPLATE_ARGS (arglist
),
4547 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP
, error_mark_node
);
4549 if (!is_partial_instantiation
4550 && !PRIMARY_TEMPLATE_P (template)
4551 && TREE_CODE (CP_DECL_CONTEXT (template)) == NAMESPACE_DECL
)
4553 found
= xref_tag_from_type (TREE_TYPE (template),
4554 DECL_NAME (template),
4555 /*tag_scope=*/ts_global
);
4556 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP
, found
);
4559 context
= tsubst (DECL_CONTEXT (template), arglist
,
4562 context
= global_namespace
;
4564 /* Create the type. */
4565 if (TREE_CODE (template_type
) == ENUMERAL_TYPE
)
4567 if (!is_partial_instantiation
)
4569 set_current_access_from_decl (TYPE_NAME (template_type
));
4570 t
= start_enum (TYPE_IDENTIFIER (template_type
));
4573 /* We don't want to call start_enum for this type, since
4574 the values for the enumeration constants may involve
4575 template parameters. And, no one should be interested
4576 in the enumeration constants for such a type. */
4577 t
= make_node (ENUMERAL_TYPE
);
4581 t
= make_aggr_type (TREE_CODE (template_type
));
4582 CLASSTYPE_DECLARED_CLASS (t
)
4583 = CLASSTYPE_DECLARED_CLASS (template_type
);
4584 SET_CLASSTYPE_IMPLICIT_INSTANTIATION (t
);
4585 TYPE_FOR_JAVA (t
) = TYPE_FOR_JAVA (template_type
);
4587 /* A local class. Make sure the decl gets registered properly. */
4588 if (context
== current_function_decl
)
4589 pushtag (DECL_NAME (template), t
, /*tag_scope=*/ts_current
);
4592 /* If we called start_enum or pushtag above, this information
4593 will already be set up. */
4596 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
4598 type_decl
= create_implicit_typedef (DECL_NAME (template), t
);
4599 DECL_CONTEXT (type_decl
) = TYPE_CONTEXT (t
);
4600 TYPE_STUB_DECL (t
) = type_decl
;
4601 DECL_SOURCE_LOCATION (type_decl
)
4602 = DECL_SOURCE_LOCATION (TYPE_STUB_DECL (template_type
));
4605 type_decl
= TYPE_NAME (t
);
4607 TREE_PRIVATE (type_decl
)
4608 = TREE_PRIVATE (TYPE_STUB_DECL (template_type
));
4609 TREE_PROTECTED (type_decl
)
4610 = TREE_PROTECTED (TYPE_STUB_DECL (template_type
));
4611 DECL_IN_SYSTEM_HEADER (type_decl
)
4612 = DECL_IN_SYSTEM_HEADER (template);
4614 /* Set up the template information. We have to figure out which
4615 template is the immediate parent if this is a full
4617 if (parm_depth
== 1 || is_partial_instantiation
4618 || !PRIMARY_TEMPLATE_P (template))
4619 /* This case is easy; there are no member templates involved. */
4623 /* This is a full instantiation of a member template. Look
4624 for a partial instantiation of which this is an instance. */
4626 for (found
= DECL_TEMPLATE_INSTANTIATIONS (template);
4627 found
; found
= TREE_CHAIN (found
))
4630 tree tmpl
= CLASSTYPE_TI_TEMPLATE (TREE_VALUE (found
));
4632 /* We only want partial instantiations, here, not
4633 specializations or full instantiations. */
4634 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_VALUE (found
))
4635 || !uses_template_parms (TREE_VALUE (found
)))
4638 /* Temporarily reduce by one the number of levels in the
4639 ARGLIST and in FOUND so as to avoid comparing the
4640 last set of arguments. */
4641 TREE_VEC_LENGTH (arglist
)--;
4642 TREE_VEC_LENGTH (TREE_PURPOSE (found
)) --;
4644 /* See if the arguments match. If they do, then TMPL is
4645 the partial instantiation we want. */
4646 success
= comp_template_args (TREE_PURPOSE (found
), arglist
);
4648 /* Restore the argument vectors to their full size. */
4649 TREE_VEC_LENGTH (arglist
)++;
4650 TREE_VEC_LENGTH (TREE_PURPOSE (found
))++;
4661 /* There was no partial instantiation. This happens
4662 where C<T> is a member template of A<T> and it's used
4665 template <typename T> struct B { A<T>::C<int> m; };
4668 Create the partial instantiation.
4670 TREE_VEC_LENGTH (arglist
)--;
4671 found
= tsubst (template, arglist
, complain
, NULL_TREE
);
4672 TREE_VEC_LENGTH (arglist
)++;
4676 SET_TYPE_TEMPLATE_INFO (t
, tree_cons (found
, arglist
, NULL_TREE
));
4677 DECL_TEMPLATE_INSTANTIATIONS (template)
4678 = tree_cons (arglist
, t
,
4679 DECL_TEMPLATE_INSTANTIATIONS (template));
4681 if (TREE_CODE (t
) == ENUMERAL_TYPE
4682 && !is_partial_instantiation
)
4683 /* Now that the type has been registered on the instantiations
4684 list, we set up the enumerators. Because the enumeration
4685 constants may involve the enumeration type itself, we make
4686 sure to register the type first, and then create the
4687 constants. That way, doing tsubst_expr for the enumeration
4688 constants won't result in recursive calls here; we'll find
4689 the instantiation and exit above. */
4690 tsubst_enum (template_type
, t
, arglist
);
4692 /* Reset the name of the type, now that CLASSTYPE_TEMPLATE_INFO
4694 if (TREE_CODE (t
) != ENUMERAL_TYPE
)
4695 DECL_NAME (type_decl
) = classtype_mangled_name (t
);
4696 if (is_partial_instantiation
)
4697 /* If the type makes use of template parameters, the
4698 code that generates debugging information will crash. */
4699 DECL_IGNORED_P (TYPE_STUB_DECL (t
)) = 1;
4701 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP
, t
);
4703 timevar_pop (TV_NAME_LOOKUP
);
4710 struct pointer_set_t
*visited
;
4713 /* Called from for_each_template_parm via walk_tree. */
4716 for_each_template_parm_r (tree
*tp
, int *walk_subtrees
, void *d
)
4719 struct pair_fn_data
*pfd
= (struct pair_fn_data
*) d
;
4720 tree_fn_t fn
= pfd
->fn
;
4721 void *data
= pfd
->data
;
4724 && for_each_template_parm (TYPE_CONTEXT (t
), fn
, data
, pfd
->visited
))
4725 return error_mark_node
;
4727 switch (TREE_CODE (t
))
4730 if (TYPE_PTRMEMFUNC_P (t
))
4736 if (!TYPE_TEMPLATE_INFO (t
))
4738 else if (for_each_template_parm (TREE_VALUE (TYPE_TEMPLATE_INFO (t
)),
4739 fn
, data
, pfd
->visited
))
4740 return error_mark_node
;
4744 /* Since we're not going to walk subtrees, we have to do this
4746 if (for_each_template_parm (TYPE_METHOD_BASETYPE (t
), fn
, data
,
4748 return error_mark_node
;
4752 /* Check the return type. */
4753 if (for_each_template_parm (TREE_TYPE (t
), fn
, data
, pfd
->visited
))
4754 return error_mark_node
;
4756 /* Check the parameter types. Since default arguments are not
4757 instantiated until they are needed, the TYPE_ARG_TYPES may
4758 contain expressions that involve template parameters. But,
4759 no-one should be looking at them yet. And, once they're
4760 instantiated, they don't contain template parameters, so
4761 there's no point in looking at them then, either. */
4765 for (parm
= TYPE_ARG_TYPES (t
); parm
; parm
= TREE_CHAIN (parm
))
4766 if (for_each_template_parm (TREE_VALUE (parm
), fn
, data
,
4768 return error_mark_node
;
4770 /* Since we've already handled the TYPE_ARG_TYPES, we don't
4771 want walk_tree walking into them itself. */
4777 if (for_each_template_parm (TYPE_FIELDS (t
), fn
, data
,
4779 return error_mark_node
;
4784 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
)
4785 && for_each_template_parm (DECL_TI_ARGS (t
), fn
, data
,
4787 return error_mark_node
;
4792 if (TREE_CODE (t
) == CONST_DECL
&& DECL_TEMPLATE_PARM_P (t
)
4793 && for_each_template_parm (DECL_INITIAL (t
), fn
, data
,
4795 return error_mark_node
;
4796 if (DECL_CONTEXT (t
)
4797 && for_each_template_parm (DECL_CONTEXT (t
), fn
, data
,
4799 return error_mark_node
;
4802 case BOUND_TEMPLATE_TEMPLATE_PARM
:
4803 /* Record template parameters such as `T' inside `TT<T>'. */
4804 if (for_each_template_parm (TYPE_TI_ARGS (t
), fn
, data
, pfd
->visited
))
4805 return error_mark_node
;
4808 case TEMPLATE_TEMPLATE_PARM
:
4809 case TEMPLATE_TYPE_PARM
:
4810 case TEMPLATE_PARM_INDEX
:
4811 if (fn
&& (*fn
)(t
, data
))
4812 return error_mark_node
;
4814 return error_mark_node
;
4818 /* A template template parameter is encountered. */
4819 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
)
4820 && for_each_template_parm (TREE_TYPE (t
), fn
, data
, pfd
->visited
))
4821 return error_mark_node
;
4823 /* Already substituted template template parameter */
4829 || for_each_template_parm (TYPENAME_TYPE_FULLNAME (t
), fn
,
4830 data
, pfd
->visited
))
4831 return error_mark_node
;
4835 if (TREE_TYPE (t
) && TYPE_PTRMEMFUNC_P (TREE_TYPE (t
))
4836 && for_each_template_parm (TYPE_PTRMEMFUNC_FN_TYPE
4837 (TREE_TYPE (t
)), fn
, data
,
4839 return error_mark_node
;
4844 /* If there's no type, then this thing must be some expression
4845 involving template parameters. */
4846 if (!fn
&& !TREE_TYPE (t
))
4847 return error_mark_node
;
4852 case REINTERPRET_CAST_EXPR
:
4853 case CONST_CAST_EXPR
:
4854 case STATIC_CAST_EXPR
:
4855 case DYNAMIC_CAST_EXPR
:
4859 case PSEUDO_DTOR_EXPR
:
4861 return error_mark_node
;
4865 /* If we do not handle this case specially, we end up walking
4866 the BINFO hierarchy, which is circular, and therefore
4867 confuses walk_tree. */
4869 if (for_each_template_parm (BASELINK_FUNCTIONS (*tp
), fn
, data
,
4871 return error_mark_node
;
4878 /* We didn't find any template parameters we liked. */
4882 /* For each TEMPLATE_TYPE_PARM, TEMPLATE_TEMPLATE_PARM,
4883 BOUND_TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX in T,
4884 call FN with the parameter and the DATA.
4885 If FN returns nonzero, the iteration is terminated, and
4886 for_each_template_parm returns 1. Otherwise, the iteration
4887 continues. If FN never returns a nonzero value, the value
4888 returned by for_each_template_parm is 0. If FN is NULL, it is
4889 considered to be the function which always returns 1. */
4892 for_each_template_parm (tree t
, tree_fn_t fn
, void* data
,
4893 struct pointer_set_t
*visited
)
4895 struct pair_fn_data pfd
;
4902 /* Walk the tree. (Conceptually, we would like to walk without
4903 duplicates, but for_each_template_parm_r recursively calls
4904 for_each_template_parm, so we would need to reorganize a fair
4905 bit to use walk_tree_without_duplicates, so we keep our own
4908 pfd
.visited
= visited
;
4910 pfd
.visited
= pointer_set_create ();
4911 result
= walk_tree (&t
,
4912 for_each_template_parm_r
,
4914 pfd
.visited
) != NULL_TREE
;
4919 pointer_set_destroy (pfd
.visited
);
4926 /* Returns true if T depends on any template parameter. */
4929 uses_template_parms (tree t
)
4932 int saved_processing_template_decl
;
4934 saved_processing_template_decl
= processing_template_decl
;
4935 if (!saved_processing_template_decl
)
4936 processing_template_decl
= 1;
4938 dependent_p
= dependent_type_p (t
);
4939 else if (TREE_CODE (t
) == TREE_VEC
)
4940 dependent_p
= any_dependent_template_arguments_p (t
);
4941 else if (TREE_CODE (t
) == TREE_LIST
)
4942 dependent_p
= (uses_template_parms (TREE_VALUE (t
))
4943 || uses_template_parms (TREE_CHAIN (t
)));
4946 || TREE_CODE (t
) == TEMPLATE_PARM_INDEX
4947 || TREE_CODE (t
) == OVERLOAD
4948 || TREE_CODE (t
) == BASELINK
4949 || CONSTANT_CLASS_P (t
))
4950 dependent_p
= (type_dependent_expression_p (t
)
4951 || value_dependent_expression_p (t
));
4954 gcc_assert (t
== error_mark_node
);
4955 dependent_p
= false;
4958 processing_template_decl
= saved_processing_template_decl
;
4963 /* Returns true if T depends on any template parameter with level LEVEL. */
4966 uses_template_parms_level (tree t
, int level
)
4968 return for_each_template_parm (t
, template_parm_this_level_p
, &level
, NULL
);
4971 static int tinst_depth
;
4972 extern int max_tinst_depth
;
4973 #ifdef GATHER_STATISTICS
4976 static int tinst_level_tick
;
4977 static int last_template_error_tick
;
4979 /* We're starting to instantiate D; record the template instantiation context
4980 for diagnostics and to restore it later. */
4983 push_tinst_level (tree d
)
4987 if (tinst_depth
>= max_tinst_depth
)
4989 /* If the instantiation in question still has unbound template parms,
4990 we don't really care if we can't instantiate it, so just return.
4991 This happens with base instantiation for implicit `typename'. */
4992 if (uses_template_parms (d
))
4995 last_template_error_tick
= tinst_level_tick
;
4996 error ("template instantiation depth exceeds maximum of %d (use "
4997 "-ftemplate-depth-NN to increase the maximum) instantiating %qD",
4998 max_tinst_depth
, d
);
5000 print_instantiation_context ();
5005 new = make_node (TINST_LEVEL
);
5006 TINST_DECL (new) = d
;
5007 TINST_LOCATION (new) = input_location
;
5008 TINST_IN_SYSTEM_HEADER_P (new) = in_system_header
;
5009 TREE_CHAIN (new) = current_tinst_level
;
5010 current_tinst_level
= new;
5013 #ifdef GATHER_STATISTICS
5014 if (tinst_depth
> depth_reached
)
5015 depth_reached
= tinst_depth
;
5022 /* We're done instantiating this template; return to the instantiation
5026 pop_tinst_level (void)
5028 tree old
= current_tinst_level
;
5030 /* Restore the filename and line number stashed away when we started
5031 this instantiation. */
5032 input_location
= TINST_LOCATION (old
);
5033 in_system_header
= TINST_IN_SYSTEM_HEADER_P (old
);
5034 current_tinst_level
= TREE_CHAIN (old
);
5039 /* We're instantiating a deferred template; restore the template
5040 instantiation context in which the instantiation was requested, which
5041 is one step out from LEVEL. */
5044 reopen_tinst_level (tree level
)
5049 for (t
= level
; t
; t
= TREE_CHAIN (t
))
5052 current_tinst_level
= level
;
5056 /* DECL is a friend FUNCTION_DECL or TEMPLATE_DECL. ARGS is the
5057 vector of template arguments, as for tsubst.
5059 Returns an appropriate tsubst'd friend declaration. */
5062 tsubst_friend_function (tree decl
, tree args
)
5066 if (TREE_CODE (decl
) == FUNCTION_DECL
5067 && DECL_TEMPLATE_INSTANTIATION (decl
)
5068 && TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
5069 /* This was a friend declared with an explicit template
5070 argument list, e.g.:
5074 to indicate that f was a template instantiation, not a new
5075 function declaration. Now, we have to figure out what
5076 instantiation of what template. */
5078 tree template_id
, arglist
, fns
;
5081 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (current_class_type
));
5083 /* Friend functions are looked up in the containing namespace scope.
5084 We must enter that scope, to avoid finding member functions of the
5085 current cless with same name. */
5086 push_nested_namespace (ns
);
5087 fns
= tsubst_expr (DECL_TI_TEMPLATE (decl
), args
,
5088 tf_error
| tf_warning
, NULL_TREE
);
5089 pop_nested_namespace (ns
);
5090 arglist
= tsubst (DECL_TI_ARGS (decl
), args
,
5091 tf_error
| tf_warning
, NULL_TREE
);
5092 template_id
= lookup_template_function (fns
, arglist
);
5094 new_friend
= tsubst (decl
, args
, tf_error
| tf_warning
, NULL_TREE
);
5095 tmpl
= determine_specialization (template_id
, new_friend
,
5097 /*need_member_template=*/0,
5098 TREE_VEC_LENGTH (args
));
5099 return instantiate_template (tmpl
, new_args
, tf_error
);
5102 new_friend
= tsubst (decl
, args
, tf_error
| tf_warning
, NULL_TREE
);
5104 /* The NEW_FRIEND will look like an instantiation, to the
5105 compiler, but is not an instantiation from the point of view of
5106 the language. For example, we might have had:
5108 template <class T> struct S {
5109 template <class U> friend void f(T, U);
5112 Then, in S<int>, template <class U> void f(int, U) is not an
5113 instantiation of anything. */
5114 if (new_friend
== error_mark_node
)
5115 return error_mark_node
;
5117 DECL_USE_TEMPLATE (new_friend
) = 0;
5118 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
5120 DECL_USE_TEMPLATE (DECL_TEMPLATE_RESULT (new_friend
)) = 0;
5121 DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (new_friend
))
5122 = DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (decl
));
5125 /* The mangled name for the NEW_FRIEND is incorrect. The function
5126 is not a template instantiation and should not be mangled like
5127 one. Therefore, we forget the mangling here; we'll recompute it
5128 later if we need it. */
5129 if (TREE_CODE (new_friend
) != TEMPLATE_DECL
)
5131 SET_DECL_RTL (new_friend
, NULL_RTX
);
5132 SET_DECL_ASSEMBLER_NAME (new_friend
, NULL_TREE
);
5135 if (DECL_NAMESPACE_SCOPE_P (new_friend
))
5138 tree new_friend_template_info
;
5139 tree new_friend_result_template_info
;
5141 int new_friend_is_defn
;
5143 /* We must save some information from NEW_FRIEND before calling
5144 duplicate decls since that function will free NEW_FRIEND if
5146 new_friend_template_info
= DECL_TEMPLATE_INFO (new_friend
);
5147 new_friend_is_defn
=
5148 (DECL_INITIAL (DECL_TEMPLATE_RESULT
5149 (template_for_substitution (new_friend
)))
5151 if (TREE_CODE (new_friend
) == TEMPLATE_DECL
)
5153 /* This declaration is a `primary' template. */
5154 DECL_PRIMARY_TEMPLATE (new_friend
) = new_friend
;
5156 new_friend_result_template_info
5157 = DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (new_friend
));
5160 new_friend_result_template_info
= NULL_TREE
;
5162 /* Inside pushdecl_namespace_level, we will push into the
5163 current namespace. However, the friend function should go
5164 into the namespace of the template. */
5165 ns
= decl_namespace_context (new_friend
);
5166 push_nested_namespace (ns
);
5167 old_decl
= pushdecl_namespace_level (new_friend
);
5168 pop_nested_namespace (ns
);
5170 if (old_decl
!= new_friend
)
5172 /* This new friend declaration matched an existing
5173 declaration. For example, given:
5175 template <class T> void f(T);
5176 template <class U> class C {
5177 template <class T> friend void f(T) {}
5180 the friend declaration actually provides the definition
5181 of `f', once C has been instantiated for some type. So,
5182 old_decl will be the out-of-class template declaration,
5183 while new_friend is the in-class definition.
5185 But, if `f' was called before this point, the
5186 instantiation of `f' will have DECL_TI_ARGS corresponding
5187 to `T' but not to `U', references to which might appear
5188 in the definition of `f'. Previously, the most general
5189 template for an instantiation of `f' was the out-of-class
5190 version; now it is the in-class version. Therefore, we
5191 run through all specialization of `f', adding to their
5192 DECL_TI_ARGS appropriately. In particular, they need a
5193 new set of outer arguments, corresponding to the
5194 arguments for this class instantiation.
5196 The same situation can arise with something like this:
5199 template <class T> class C {
5203 when `C<int>' is instantiated. Now, `f(int)' is defined
5206 if (!new_friend_is_defn
)
5207 /* On the other hand, if the in-class declaration does
5208 *not* provide a definition, then we don't want to alter
5209 existing definitions. We can just leave everything
5214 /* Overwrite whatever template info was there before, if
5215 any, with the new template information pertaining to
5217 DECL_TEMPLATE_INFO (old_decl
) = new_friend_template_info
;
5219 if (TREE_CODE (old_decl
) != TEMPLATE_DECL
)
5220 reregister_specialization (new_friend
,
5221 most_general_template (old_decl
),
5226 tree new_friend_args
;
5228 DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (old_decl
))
5229 = new_friend_result_template_info
;
5231 new_friend_args
= TI_ARGS (new_friend_template_info
);
5232 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (old_decl
);
5236 tree spec
= TREE_VALUE (t
);
5239 = add_outermost_template_args (new_friend_args
,
5240 DECL_TI_ARGS (spec
));
5243 /* Now, since specializations are always supposed to
5244 hang off of the most general template, we must move
5246 t
= most_general_template (old_decl
);
5249 DECL_TEMPLATE_SPECIALIZATIONS (t
)
5250 = chainon (DECL_TEMPLATE_SPECIALIZATIONS (t
),
5251 DECL_TEMPLATE_SPECIALIZATIONS (old_decl
));
5252 DECL_TEMPLATE_SPECIALIZATIONS (old_decl
) = NULL_TREE
;
5257 /* The information from NEW_FRIEND has been merged into OLD_DECL
5258 by duplicate_decls. */
5259 new_friend
= old_decl
;
5264 tree context
= DECL_CONTEXT (new_friend
);
5268 template <class T> class C {
5269 template <class U> friend void C1<U>::f (); // case 1
5270 friend void C2<T>::f (); // case 2
5272 we only need to make sure CONTEXT is a complete type for
5273 case 2. To distinguish between the two cases, we note that
5274 CONTEXT of case 1 remains dependent type after tsubst while
5275 this isn't true for case 2. */
5276 ++processing_template_decl
;
5277 dependent_p
= dependent_type_p (context
);
5278 --processing_template_decl
;
5281 && !complete_type_or_else (context
, NULL_TREE
))
5282 return error_mark_node
;
5284 if (COMPLETE_TYPE_P (context
))
5286 /* Check to see that the declaration is really present, and,
5287 possibly obtain an improved declaration. */
5288 tree fn
= check_classfn (context
,
5289 new_friend
, NULL_TREE
);
5299 /* FRIEND_TMPL is a friend TEMPLATE_DECL. ARGS is the vector of
5300 template arguments, as for tsubst.
5302 Returns an appropriate tsubst'd friend type or error_mark_node on
5306 tsubst_friend_class (tree friend_tmpl
, tree args
)
5312 context
= DECL_CONTEXT (friend_tmpl
);
5316 if (TREE_CODE (context
) == NAMESPACE_DECL
)
5317 push_nested_namespace (context
);
5319 push_nested_class (tsubst (context
, args
, tf_none
, NULL_TREE
));
5322 /* First, we look for a class template. */
5323 tmpl
= lookup_name (DECL_NAME (friend_tmpl
), /*prefer_type=*/0);
5325 /* But, if we don't find one, it might be because we're in a
5326 situation like this:
5334 Here, in the scope of (say) S<int>, `S' is bound to a TYPE_DECL
5335 for `S<int>', not the TEMPLATE_DECL. */
5336 if (!tmpl
|| !DECL_CLASS_TEMPLATE_P (tmpl
))
5338 tmpl
= lookup_name (DECL_NAME (friend_tmpl
), /*prefer_type=*/1);
5339 tmpl
= maybe_get_template_decl_from_type_decl (tmpl
);
5342 if (tmpl
&& DECL_CLASS_TEMPLATE_P (tmpl
))
5344 /* The friend template has already been declared. Just
5345 check to see that the declarations match, and install any new
5346 default parameters. We must tsubst the default parameters,
5347 of course. We only need the innermost template parameters
5348 because that is all that redeclare_class_template will look
5350 if (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (friend_tmpl
))
5351 > TMPL_ARGS_DEPTH (args
))
5354 parms
= tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_tmpl
),
5355 args
, tf_error
| tf_warning
);
5356 redeclare_class_template (TREE_TYPE (tmpl
), parms
);
5359 friend_type
= TREE_TYPE (tmpl
);
5363 /* The friend template has not already been declared. In this
5364 case, the instantiation of the template class will cause the
5365 injection of this template into the global scope. */
5366 tmpl
= tsubst (friend_tmpl
, args
, tf_error
| tf_warning
, NULL_TREE
);
5368 /* The new TMPL is not an instantiation of anything, so we
5369 forget its origins. We don't reset CLASSTYPE_TI_TEMPLATE for
5370 the new type because that is supposed to be the corresponding
5371 template decl, i.e., TMPL. */
5372 DECL_USE_TEMPLATE (tmpl
) = 0;
5373 DECL_TEMPLATE_INFO (tmpl
) = NULL_TREE
;
5374 CLASSTYPE_USE_TEMPLATE (TREE_TYPE (tmpl
)) = 0;
5375 CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl
))
5376 = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl
)));
5378 /* Inject this template into the global scope. */
5379 friend_type
= TREE_TYPE (pushdecl_top_level (tmpl
));
5384 if (TREE_CODE (context
) == NAMESPACE_DECL
)
5385 pop_nested_namespace (context
);
5387 pop_nested_class ();
5393 /* Returns zero if TYPE cannot be completed later due to circularity.
5394 Otherwise returns one. */
5397 can_complete_type_without_circularity (tree type
)
5399 if (type
== NULL_TREE
|| type
== error_mark_node
)
5401 else if (COMPLETE_TYPE_P (type
))
5403 else if (TREE_CODE (type
) == ARRAY_TYPE
&& TYPE_DOMAIN (type
))
5404 return can_complete_type_without_circularity (TREE_TYPE (type
));
5405 else if (CLASS_TYPE_P (type
)
5406 && TYPE_BEING_DEFINED (TYPE_MAIN_VARIANT (type
)))
5413 instantiate_class_template (tree type
)
5415 tree
template, args
, pattern
, t
, member
;
5420 if (type
== error_mark_node
)
5421 return error_mark_node
;
5423 if (TYPE_BEING_DEFINED (type
)
5424 || COMPLETE_TYPE_P (type
)
5425 || dependent_type_p (type
))
5428 /* Figure out which template is being instantiated. */
5429 template = most_general_template (CLASSTYPE_TI_TEMPLATE (type
));
5430 gcc_assert (TREE_CODE (template) == TEMPLATE_DECL
);
5432 /* Figure out which arguments are being used to do the
5434 args
= CLASSTYPE_TI_ARGS (type
);
5436 /* Determine what specialization of the original template to
5438 t
= most_specialized_class (template, args
);
5439 if (t
== error_mark_node
)
5441 const char *str
= "candidates are:";
5442 error ("ambiguous class template instantiation for %q#T", type
);
5443 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (template); t
;
5446 if (get_class_bindings (TREE_VALUE (t
), TREE_PURPOSE (t
), args
))
5448 cp_error_at ("%s %+#T", str
, TREE_TYPE (t
));
5452 TYPE_BEING_DEFINED (type
) = 1;
5453 return error_mark_node
;
5457 pattern
= TREE_TYPE (t
);
5459 pattern
= TREE_TYPE (template);
5461 /* If the template we're instantiating is incomplete, then clearly
5462 there's nothing we can do. */
5463 if (!COMPLETE_TYPE_P (pattern
))
5466 /* If we've recursively instantiated too many templates, stop. */
5467 if (! push_tinst_level (type
))
5470 /* Now we're really doing the instantiation. Mark the type as in
5471 the process of being defined. */
5472 TYPE_BEING_DEFINED (type
) = 1;
5474 /* We may be in the middle of deferred access check. Disable
5476 push_deferring_access_checks (dk_no_deferred
);
5478 push_to_top_level ();
5482 /* This TYPE is actually an instantiation of a partial
5483 specialization. We replace the innermost set of ARGS with
5484 the arguments appropriate for substitution. For example,
5487 template <class T> struct S {};
5488 template <class T> struct S<T*> {};
5490 and supposing that we are instantiating S<int*>, ARGS will
5491 present be {int*} but we need {int}. */
5493 = get_class_bindings (TREE_VALUE (t
), TREE_PURPOSE (t
),
5496 /* If there were multiple levels in ARGS, replacing the
5497 innermost level would alter CLASSTYPE_TI_ARGS, which we don't
5498 want, so we make a copy first. */
5499 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
5501 args
= copy_node (args
);
5502 SET_TMPL_ARGS_LEVEL (args
, TMPL_ARGS_DEPTH (args
), inner_args
);
5508 SET_CLASSTYPE_INTERFACE_UNKNOWN (type
);
5510 /* Set the input location to the template definition. This is needed
5511 if tsubsting causes an error. */
5512 typedecl
= TYPE_MAIN_DECL (type
);
5513 input_location
= DECL_SOURCE_LOCATION (typedecl
);
5514 in_system_header
= DECL_IN_SYSTEM_HEADER (typedecl
);
5516 TYPE_HAS_CONSTRUCTOR (type
) = TYPE_HAS_CONSTRUCTOR (pattern
);
5517 TYPE_HAS_NEW_OPERATOR (type
) = TYPE_HAS_NEW_OPERATOR (pattern
);
5518 TYPE_HAS_ARRAY_NEW_OPERATOR (type
) = TYPE_HAS_ARRAY_NEW_OPERATOR (pattern
);
5519 TYPE_GETS_DELETE (type
) = TYPE_GETS_DELETE (pattern
);
5520 TYPE_HAS_ASSIGN_REF (type
) = TYPE_HAS_ASSIGN_REF (pattern
);
5521 TYPE_HAS_CONST_ASSIGN_REF (type
) = TYPE_HAS_CONST_ASSIGN_REF (pattern
);
5522 TYPE_HAS_INIT_REF (type
) = TYPE_HAS_INIT_REF (pattern
);
5523 TYPE_HAS_CONST_INIT_REF (type
) = TYPE_HAS_CONST_INIT_REF (pattern
);
5524 TYPE_HAS_DEFAULT_CONSTRUCTOR (type
) = TYPE_HAS_DEFAULT_CONSTRUCTOR (pattern
);
5525 TYPE_HAS_CONVERSION (type
) = TYPE_HAS_CONVERSION (pattern
);
5526 TYPE_PACKED (type
) = TYPE_PACKED (pattern
);
5527 TYPE_ALIGN (type
) = TYPE_ALIGN (pattern
);
5528 TYPE_USER_ALIGN (type
) = TYPE_USER_ALIGN (pattern
);
5529 TYPE_FOR_JAVA (type
) = TYPE_FOR_JAVA (pattern
); /* For libjava's JArray<T> */
5530 if (ANON_AGGR_TYPE_P (pattern
))
5531 SET_ANON_AGGR_TYPE_P (type
);
5533 pbinfo
= TYPE_BINFO (pattern
);
5535 /* We should never instantiate a nested class before its enclosing
5536 class; we need to look up the nested class by name before we can
5537 instantiate it, and that lookup should instantiate the enclosing
5539 gcc_assert (!DECL_CLASS_SCOPE_P (TYPE_MAIN_DECL (pattern
))
5540 || COMPLETE_TYPE_P (TYPE_CONTEXT (type
))
5541 || TYPE_BEING_DEFINED (TYPE_CONTEXT (type
)));
5543 base_list
= NULL_TREE
;
5544 if (BINFO_N_BASE_BINFOS (pbinfo
))
5547 tree context
= TYPE_CONTEXT (type
);
5551 /* We must enter the scope containing the type, as that is where
5552 the accessibility of types named in dependent bases are
5554 pushed_scope
= push_scope (context
? context
: global_namespace
);
5556 /* Substitute into each of the bases to determine the actual
5558 for (i
= 0; BINFO_BASE_ITERATE (pbinfo
, i
, pbase_binfo
); i
++)
5561 tree access
= BINFO_BASE_ACCESS (pbinfo
, i
);
5563 /* Substitute to figure out the base class. */
5564 base
= tsubst (BINFO_TYPE (pbase_binfo
), args
, tf_error
, NULL_TREE
);
5565 if (base
== error_mark_node
)
5568 base_list
= tree_cons (access
, base
, base_list
);
5569 if (BINFO_VIRTUAL_P (pbase_binfo
))
5570 TREE_TYPE (base_list
) = integer_type_node
;
5573 /* The list is now in reverse order; correct that. */
5574 base_list
= nreverse (base_list
);
5577 pop_scope (pushed_scope
);
5579 /* Now call xref_basetypes to set up all the base-class
5581 xref_basetypes (type
, base_list
);
5584 /* Now that our base classes are set up, enter the scope of the
5585 class, so that name lookups into base classes, etc. will work
5586 correctly. This is precisely analogous to what we do in
5587 begin_class_definition when defining an ordinary non-template
5591 /* Now members are processed in the order of declaration. */
5592 for (member
= CLASSTYPE_DECL_LIST (pattern
);
5593 member
; member
= TREE_CHAIN (member
))
5595 tree t
= TREE_VALUE (member
);
5597 if (TREE_PURPOSE (member
))
5601 /* Build new CLASSTYPE_NESTED_UTDS. */
5604 tree name
= TYPE_IDENTIFIER (tag
);
5606 bool class_template_p
;
5608 class_template_p
= (TREE_CODE (tag
) != ENUMERAL_TYPE
5609 && TYPE_LANG_SPECIFIC (tag
)
5610 && CLASSTYPE_IS_TEMPLATE (tag
));
5611 /* If the member is a class template, then -- even after
5612 substitution -- there may be dependent types in the
5613 template argument list for the class. We increment
5614 PROCESSING_TEMPLATE_DECL so that dependent_type_p, as
5615 that function will assume that no types are dependent
5616 when outside of a template. */
5617 if (class_template_p
)
5618 ++processing_template_decl
;
5619 newtag
= tsubst (tag
, args
, tf_error
, NULL_TREE
);
5620 if (class_template_p
)
5621 --processing_template_decl
;
5622 if (newtag
== error_mark_node
)
5625 if (TREE_CODE (newtag
) != ENUMERAL_TYPE
)
5627 if (class_template_p
)
5628 /* Unfortunately, lookup_template_class sets
5629 CLASSTYPE_IMPLICIT_INSTANTIATION for a partial
5630 instantiation (i.e., for the type of a member
5631 template class nested within a template class.)
5632 This behavior is required for
5633 maybe_process_partial_specialization to work
5634 correctly, but is not accurate in this case;
5635 the TAG is not an instantiation of anything.
5636 (The corresponding TEMPLATE_DECL is an
5637 instantiation, but the TYPE is not.) */
5638 CLASSTYPE_USE_TEMPLATE (newtag
) = 0;
5640 /* Now, we call pushtag to put this NEWTAG into the scope of
5641 TYPE. We first set up the IDENTIFIER_TYPE_VALUE to avoid
5642 pushtag calling push_template_decl. We don't have to do
5643 this for enums because it will already have been done in
5646 SET_IDENTIFIER_TYPE_VALUE (name
, newtag
);
5647 pushtag (name
, newtag
, /*tag_scope=*/ts_current
);
5650 else if (TREE_CODE (t
) == FUNCTION_DECL
5651 || DECL_FUNCTION_TEMPLATE_P (t
))
5653 /* Build new TYPE_METHODS. */
5656 if (TREE_CODE (t
) == TEMPLATE_DECL
)
5657 ++processing_template_decl
;
5658 r
= tsubst (t
, args
, tf_error
, NULL_TREE
);
5659 if (TREE_CODE (t
) == TEMPLATE_DECL
)
5660 --processing_template_decl
;
5661 set_current_access_from_decl (r
);
5662 grok_special_member_properties (r
);
5663 finish_member_declaration (r
);
5667 /* Build new TYPE_FIELDS. */
5669 if (TREE_CODE (t
) != CONST_DECL
)
5673 /* The the file and line for this declaration, to
5674 assist in error message reporting. Since we
5675 called push_tinst_level above, we don't need to
5677 input_location
= DECL_SOURCE_LOCATION (t
);
5679 if (TREE_CODE (t
) == TEMPLATE_DECL
)
5680 ++processing_template_decl
;
5681 r
= tsubst (t
, args
, tf_error
| tf_warning
, NULL_TREE
);
5682 if (TREE_CODE (t
) == TEMPLATE_DECL
)
5683 --processing_template_decl
;
5684 if (TREE_CODE (r
) == VAR_DECL
)
5688 if (DECL_INITIALIZED_IN_CLASS_P (r
))
5689 init
= tsubst_expr (DECL_INITIAL (t
), args
,
5690 tf_error
| tf_warning
, NULL_TREE
);
5694 finish_static_data_member_decl
5695 (r
, init
, /*asmspec_tree=*/NULL_TREE
, /*flags=*/0);
5697 if (DECL_INITIALIZED_IN_CLASS_P (r
))
5698 check_static_variable_definition (r
, TREE_TYPE (r
));
5700 else if (TREE_CODE (r
) == FIELD_DECL
)
5702 /* Determine whether R has a valid type and can be
5703 completed later. If R is invalid, then it is
5704 replaced by error_mark_node so that it will not be
5705 added to TYPE_FIELDS. */
5706 tree rtype
= TREE_TYPE (r
);
5707 if (can_complete_type_without_circularity (rtype
))
5708 complete_type (rtype
);
5710 if (!COMPLETE_TYPE_P (rtype
))
5712 cxx_incomplete_type_error (r
, rtype
);
5713 r
= error_mark_node
;
5717 /* If it is a TYPE_DECL for a class-scoped ENUMERAL_TYPE,
5718 such a thing will already have been added to the field
5719 list by tsubst_enum in finish_member_declaration in the
5720 CLASSTYPE_NESTED_UTDS case above. */
5721 if (!(TREE_CODE (r
) == TYPE_DECL
5722 && TREE_CODE (TREE_TYPE (r
)) == ENUMERAL_TYPE
5723 && DECL_ARTIFICIAL (r
)))
5725 set_current_access_from_decl (r
);
5726 finish_member_declaration (r
);
5733 if (TYPE_P (t
) || DECL_CLASS_TEMPLATE_P (t
))
5735 /* Build new CLASSTYPE_FRIEND_CLASSES. */
5737 tree friend_type
= t
;
5738 bool adjust_processing_template_decl
= false;
5740 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
5742 /* template <class T> friend class C; */
5743 friend_type
= tsubst_friend_class (friend_type
, args
);
5744 adjust_processing_template_decl
= true;
5746 else if (TREE_CODE (friend_type
) == UNBOUND_CLASS_TEMPLATE
)
5748 /* template <class T> friend class C::D; */
5749 friend_type
= tsubst (friend_type
, args
,
5750 tf_error
| tf_warning
, NULL_TREE
);
5751 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
5752 friend_type
= TREE_TYPE (friend_type
);
5753 adjust_processing_template_decl
= true;
5755 else if (TREE_CODE (friend_type
) == TYPENAME_TYPE
)
5757 /* This could be either
5761 when dependent_type_p is false or
5763 template <class U> friend class T::C;
5766 friend_type
= tsubst (friend_type
, args
,
5767 tf_error
| tf_warning
, NULL_TREE
);
5768 /* Bump processing_template_decl for correct
5769 dependent_type_p calculation. */
5770 ++processing_template_decl
;
5771 if (dependent_type_p (friend_type
))
5772 adjust_processing_template_decl
= true;
5773 --processing_template_decl
;
5775 else if (!CLASSTYPE_USE_TEMPLATE (friend_type
)
5776 && hidden_name_p (TYPE_NAME (friend_type
)))
5780 where C hasn't been declared yet. Let's lookup name
5781 from namespace scope directly, bypassing any name that
5782 come from dependent base class. */
5783 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (friend_type
));
5785 /* The call to xref_tag_from_type does injection for friend
5787 push_nested_namespace (ns
);
5789 xref_tag_from_type (friend_type
, NULL_TREE
,
5790 /*tag_scope=*/ts_current
);
5791 pop_nested_namespace (ns
);
5793 else if (uses_template_parms (friend_type
))
5794 /* friend class C<T>; */
5795 friend_type
= tsubst (friend_type
, args
,
5796 tf_error
| tf_warning
, NULL_TREE
);
5801 where C is already declared or
5803 friend class C<int>;
5805 We don't have to do anything in these cases. */
5807 if (adjust_processing_template_decl
)
5808 /* Trick make_friend_class into realizing that the friend
5809 we're adding is a template, not an ordinary class. It's
5810 important that we use make_friend_class since it will
5811 perform some error-checking and output cross-reference
5813 ++processing_template_decl
;
5815 if (friend_type
!= error_mark_node
)
5816 make_friend_class (type
, friend_type
, /*complain=*/false);
5818 if (adjust_processing_template_decl
)
5819 --processing_template_decl
;
5823 /* Build new DECL_FRIENDLIST. */
5826 /* The the file and line for this declaration, to
5827 assist in error message reporting. Since we
5828 called push_tinst_level above, we don't need to
5830 input_location
= DECL_SOURCE_LOCATION (t
);
5832 if (TREE_CODE (t
) == TEMPLATE_DECL
)
5834 ++processing_template_decl
;
5835 push_deferring_access_checks (dk_no_check
);
5838 r
= tsubst_friend_function (t
, args
);
5839 add_friend (type
, r
, /*complain=*/false);
5840 if (TREE_CODE (t
) == TEMPLATE_DECL
)
5842 pop_deferring_access_checks ();
5843 --processing_template_decl
;
5849 /* Set the file and line number information to whatever is given for
5850 the class itself. This puts error messages involving generated
5851 implicit functions at a predictable point, and the same point
5852 that would be used for non-template classes. */
5853 input_location
= DECL_SOURCE_LOCATION (typedecl
);
5855 unreverse_member_declarations (type
);
5856 finish_struct_1 (type
);
5857 TYPE_BEING_DEFINED (type
) = 0;
5859 /* Now that the class is complete, instantiate default arguments for
5860 any member functions. We don't do this earlier because the
5861 default arguments may reference members of the class. */
5862 if (!PRIMARY_TEMPLATE_P (template))
5863 for (t
= TYPE_METHODS (type
); t
; t
= TREE_CHAIN (t
))
5864 if (TREE_CODE (t
) == FUNCTION_DECL
5865 /* Implicitly generated member functions will not have template
5866 information; they are not instantiations, but instead are
5867 created "fresh" for each instantiation. */
5868 && DECL_TEMPLATE_INFO (t
))
5869 tsubst_default_arguments (t
);
5872 pop_from_top_level ();
5873 pop_deferring_access_checks ();
5876 /* The vtable for a template class can be emitted in any translation
5877 unit in which the class is instantiated. When there is no key
5878 method, however, finish_struct_1 will already have added TYPE to
5879 the keyed_classes list. */
5880 if (TYPE_CONTAINS_VPTR_P (type
) && CLASSTYPE_KEY_METHOD (type
))
5881 keyed_classes
= tree_cons (NULL_TREE
, type
, keyed_classes
);
5887 tsubst_template_arg (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
5893 else if (TYPE_P (t
))
5894 r
= tsubst (t
, args
, complain
, in_decl
);
5897 r
= tsubst_expr (t
, args
, complain
, in_decl
);
5899 if (!uses_template_parms (r
))
5901 /* Sometimes, one of the args was an expression involving a
5902 template constant parameter, like N - 1. Now that we've
5903 tsubst'd, we might have something like 2 - 1. This will
5904 confuse lookup_template_class, so we do constant folding
5905 here. We have to unset processing_template_decl, to fool
5906 tsubst_copy_and_build() into building an actual tree. */
5908 /* If the TREE_TYPE of ARG is not NULL_TREE, ARG is already
5909 as simple as it's going to get, and trying to reprocess
5910 the trees will break. Once tsubst_expr et al DTRT for
5911 non-dependent exprs, this code can go away, as the type
5912 will always be set. */
5915 int saved_processing_template_decl
= processing_template_decl
;
5916 processing_template_decl
= 0;
5917 r
= tsubst_copy_and_build (r
, /*args=*/NULL_TREE
,
5918 tf_error
, /*in_decl=*/NULL_TREE
,
5919 /*function_p=*/false);
5920 processing_template_decl
= saved_processing_template_decl
;
5928 /* Substitute ARGS into the vector or list of template arguments T. */
5931 tsubst_template_args (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
5933 int len
= TREE_VEC_LENGTH (t
);
5934 int need_new
= 0, i
;
5935 tree
*elts
= alloca (len
* sizeof (tree
));
5937 for (i
= 0; i
< len
; i
++)
5939 tree orig_arg
= TREE_VEC_ELT (t
, i
);
5942 if (TREE_CODE (orig_arg
) == TREE_VEC
)
5943 new_arg
= tsubst_template_args (orig_arg
, args
, complain
, in_decl
);
5945 new_arg
= tsubst_template_arg (orig_arg
, args
, complain
, in_decl
);
5947 if (new_arg
== error_mark_node
)
5948 return error_mark_node
;
5951 if (new_arg
!= orig_arg
)
5958 t
= make_tree_vec (len
);
5959 for (i
= 0; i
< len
; i
++)
5960 TREE_VEC_ELT (t
, i
) = elts
[i
];
5965 /* Return the result of substituting ARGS into the template parameters
5966 given by PARMS. If there are m levels of ARGS and m + n levels of
5967 PARMS, then the result will contain n levels of PARMS. For
5968 example, if PARMS is `template <class T> template <class U>
5969 template <T*, U, class V>' and ARGS is {{int}, {double}} then the
5970 result will be `template <int*, double, class V>'. */
5973 tsubst_template_parms (tree parms
, tree args
, tsubst_flags_t complain
)
5978 for (new_parms
= &r
;
5979 TMPL_PARMS_DEPTH (parms
) > TMPL_ARGS_DEPTH (args
);
5980 new_parms
= &(TREE_CHAIN (*new_parms
)),
5981 parms
= TREE_CHAIN (parms
))
5984 make_tree_vec (TREE_VEC_LENGTH (TREE_VALUE (parms
)));
5987 for (i
= 0; i
< TREE_VEC_LENGTH (new_vec
); ++i
)
5989 tree tuple
= TREE_VEC_ELT (TREE_VALUE (parms
), i
);
5990 tree default_value
= TREE_PURPOSE (tuple
);
5991 tree parm_decl
= TREE_VALUE (tuple
);
5993 parm_decl
= tsubst (parm_decl
, args
, complain
, NULL_TREE
);
5994 default_value
= tsubst_template_arg (default_value
, args
,
5995 complain
, NULL_TREE
);
5997 tuple
= build_tree_list (default_value
, parm_decl
);
5998 TREE_VEC_ELT (new_vec
, i
) = tuple
;
6002 tree_cons (size_int (TMPL_PARMS_DEPTH (parms
)
6003 - TMPL_ARGS_DEPTH (args
)),
6004 new_vec
, NULL_TREE
);
6010 /* Substitute the ARGS into the indicated aggregate (or enumeration)
6011 type T. If T is not an aggregate or enumeration type, it is
6012 handled as if by tsubst. IN_DECL is as for tsubst. If
6013 ENTERING_SCOPE is nonzero, T is the context for a template which
6014 we are presently tsubst'ing. Return the substituted value. */
6017 tsubst_aggr_type (tree t
,
6019 tsubst_flags_t complain
,
6026 switch (TREE_CODE (t
))
6029 if (TYPE_PTRMEMFUNC_P (t
))
6030 return tsubst (TYPE_PTRMEMFUNC_FN_TYPE (t
), args
, complain
, in_decl
);
6032 /* Else fall through. */
6035 if (TYPE_TEMPLATE_INFO (t
))
6041 /* First, determine the context for the type we are looking
6043 context
= TYPE_CONTEXT (t
);
6045 context
= tsubst_aggr_type (context
, args
, complain
,
6046 in_decl
, /*entering_scope=*/1);
6048 /* Then, figure out what arguments are appropriate for the
6049 type we are trying to find. For example, given:
6051 template <class T> struct S;
6052 template <class T, class U> void f(T, U) { S<U> su; }
6054 and supposing that we are instantiating f<int, double>,
6055 then our ARGS will be {int, double}, but, when looking up
6056 S we only want {double}. */
6057 argvec
= tsubst_template_args (TYPE_TI_ARGS (t
), args
,
6059 if (argvec
== error_mark_node
)
6060 return error_mark_node
;
6062 r
= lookup_template_class (t
, argvec
, in_decl
, context
,
6063 entering_scope
, complain
);
6065 return cp_build_qualified_type_real (r
, TYPE_QUALS (t
), complain
);
6068 /* This is not a template type, so there's nothing to do. */
6072 return tsubst (t
, args
, complain
, in_decl
);
6076 /* Substitute into the default argument ARG (a default argument for
6077 FN), which has the indicated TYPE. */
6080 tsubst_default_argument (tree fn
, tree type
, tree arg
)
6082 tree saved_class_ptr
= NULL_TREE
;
6083 tree saved_class_ref
= NULL_TREE
;
6085 /* This default argument came from a template. Instantiate the
6086 default argument here, not in tsubst. In the case of
6095 we must be careful to do name lookup in the scope of S<T>,
6096 rather than in the current class. */
6097 push_access_scope (fn
);
6098 /* The default argument expression should not be considered to be
6099 within the scope of FN. Since push_access_scope sets
6100 current_function_decl, we must explicitly clear it here. */
6101 current_function_decl
= NULL_TREE
;
6102 /* The "this" pointer is not valid in a default argument. */
6105 saved_class_ptr
= current_class_ptr
;
6106 cp_function_chain
->x_current_class_ptr
= NULL_TREE
;
6107 saved_class_ref
= current_class_ref
;
6108 cp_function_chain
->x_current_class_ref
= NULL_TREE
;
6111 push_deferring_access_checks(dk_no_deferred
);
6112 arg
= tsubst_expr (arg
, DECL_TI_ARGS (fn
),
6113 tf_error
| tf_warning
, NULL_TREE
);
6114 pop_deferring_access_checks();
6116 /* Restore the "this" pointer. */
6119 cp_function_chain
->x_current_class_ptr
= saved_class_ptr
;
6120 cp_function_chain
->x_current_class_ref
= saved_class_ref
;
6123 pop_access_scope (fn
);
6125 /* Make sure the default argument is reasonable. */
6126 arg
= check_default_argument (type
, arg
);
6131 /* Substitute into all the default arguments for FN. */
6134 tsubst_default_arguments (tree fn
)
6139 tmpl_args
= DECL_TI_ARGS (fn
);
6141 /* If this function is not yet instantiated, we certainly don't need
6142 its default arguments. */
6143 if (uses_template_parms (tmpl_args
))
6146 for (arg
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
6148 arg
= TREE_CHAIN (arg
))
6149 if (TREE_PURPOSE (arg
))
6150 TREE_PURPOSE (arg
) = tsubst_default_argument (fn
,
6152 TREE_PURPOSE (arg
));
6155 /* Substitute the ARGS into the T, which is a _DECL. Return the
6156 result of the substitution. Issue error and warning messages under
6157 control of COMPLAIN. */
6160 tsubst_decl (tree t
, tree args
, tsubst_flags_t complain
)
6162 location_t saved_loc
;
6166 /* Set the filename and linenumber to improve error-reporting. */
6167 saved_loc
= input_location
;
6168 input_location
= DECL_SOURCE_LOCATION (t
);
6170 switch (TREE_CODE (t
))
6174 /* We can get here when processing a member function template,
6175 member class template, and template template parameter of
6176 a template class. */
6177 tree decl
= DECL_TEMPLATE_RESULT (t
);
6182 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
6184 /* Template template parameter is treated here. */
6185 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
6186 if (new_type
== error_mark_node
)
6187 return error_mark_node
;
6190 TREE_CHAIN (r
) = NULL_TREE
;
6191 TREE_TYPE (r
) = new_type
;
6192 DECL_TEMPLATE_RESULT (r
)
6193 = build_decl (TYPE_DECL
, DECL_NAME (decl
), new_type
);
6194 DECL_TEMPLATE_PARMS (r
)
6195 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t
), args
,
6197 TYPE_NAME (new_type
) = r
;
6201 /* We might already have an instance of this template.
6202 The ARGS are for the surrounding class type, so the
6203 full args contain the tsubst'd args for the context,
6204 plus the innermost args from the template decl. */
6205 tmpl_args
= DECL_CLASS_TEMPLATE_P (t
)
6206 ? CLASSTYPE_TI_ARGS (TREE_TYPE (t
))
6207 : DECL_TI_ARGS (DECL_TEMPLATE_RESULT (t
));
6208 full_args
= tsubst_template_args (tmpl_args
, args
,
6211 /* tsubst_template_args doesn't copy the vector if
6212 nothing changed. But, *something* should have
6214 gcc_assert (full_args
!= tmpl_args
);
6216 spec
= retrieve_specialization (t
, full_args
,
6217 /*class_specializations_p=*/true);
6218 if (spec
!= NULL_TREE
)
6224 /* Make a new template decl. It will be similar to the
6225 original, but will record the current template arguments.
6226 We also create a new function declaration, which is just
6227 like the old one, but points to this new template, rather
6228 than the old one. */
6230 gcc_assert (DECL_LANG_SPECIFIC (r
) != 0);
6231 TREE_CHAIN (r
) = NULL_TREE
;
6234 = tsubst_aggr_type (DECL_CONTEXT (t
), args
,
6236 /*entering_scope=*/1);
6237 DECL_TEMPLATE_INFO (r
) = build_tree_list (t
, args
);
6239 if (TREE_CODE (decl
) == TYPE_DECL
)
6241 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
6242 if (new_type
== error_mark_node
)
6243 return error_mark_node
;
6245 TREE_TYPE (r
) = new_type
;
6246 CLASSTYPE_TI_TEMPLATE (new_type
) = r
;
6247 DECL_TEMPLATE_RESULT (r
) = TYPE_MAIN_DECL (new_type
);
6248 DECL_TI_ARGS (r
) = CLASSTYPE_TI_ARGS (new_type
);
6252 tree new_decl
= tsubst (decl
, args
, complain
, in_decl
);
6253 if (new_decl
== error_mark_node
)
6254 return error_mark_node
;
6256 DECL_TEMPLATE_RESULT (r
) = new_decl
;
6257 DECL_TI_TEMPLATE (new_decl
) = r
;
6258 TREE_TYPE (r
) = TREE_TYPE (new_decl
);
6259 DECL_TI_ARGS (r
) = DECL_TI_ARGS (new_decl
);
6262 SET_DECL_IMPLICIT_INSTANTIATION (r
);
6263 DECL_TEMPLATE_INSTANTIATIONS (r
) = NULL_TREE
;
6264 DECL_TEMPLATE_SPECIALIZATIONS (r
) = NULL_TREE
;
6266 /* The template parameters for this new template are all the
6267 template parameters for the old template, except the
6268 outermost level of parameters. */
6269 DECL_TEMPLATE_PARMS (r
)
6270 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t
), args
,
6273 if (PRIMARY_TEMPLATE_P (t
))
6274 DECL_PRIMARY_TEMPLATE (r
) = r
;
6276 if (TREE_CODE (decl
) != TYPE_DECL
)
6277 /* Record this non-type partial instantiation. */
6278 register_specialization (r
, t
,
6279 DECL_TI_ARGS (DECL_TEMPLATE_RESULT (r
)));
6286 tree argvec
= NULL_TREE
;
6294 /* Nobody should be tsubst'ing into non-template functions. */
6295 gcc_assert (DECL_TEMPLATE_INFO (t
) != NULL_TREE
);
6297 if (TREE_CODE (DECL_TI_TEMPLATE (t
)) == TEMPLATE_DECL
)
6302 /* If T is not dependent, just return it. We have to
6303 increment PROCESSING_TEMPLATE_DECL because
6304 value_dependent_expression_p assumes that nothing is
6305 dependent when PROCESSING_TEMPLATE_DECL is zero. */
6306 ++processing_template_decl
;
6307 dependent_p
= value_dependent_expression_p (t
);
6308 --processing_template_decl
;
6312 /* Calculate the most general template of which R is a
6313 specialization, and the complete set of arguments used to
6315 gen_tmpl
= most_general_template (DECL_TI_TEMPLATE (t
));
6316 argvec
= tsubst_template_args (DECL_TI_ARGS
6317 (DECL_TEMPLATE_RESULT (gen_tmpl
)),
6318 args
, complain
, in_decl
);
6320 /* Check to see if we already have this specialization. */
6321 spec
= retrieve_specialization (gen_tmpl
, argvec
,
6322 /*class_specializations_p=*/false);
6330 /* We can see more levels of arguments than parameters if
6331 there was a specialization of a member template, like
6334 template <class T> struct S { template <class U> void f(); }
6335 template <> template <class U> void S<int>::f(U);
6337 Here, we'll be substituting into the specialization,
6338 because that's where we can find the code we actually
6339 want to generate, but we'll have enough arguments for
6340 the most general template.
6342 We also deal with the peculiar case:
6344 template <class T> struct S {
6345 template <class U> friend void f();
6347 template <class U> void f() {}
6349 template void f<double>();
6351 Here, the ARGS for the instantiation of will be {int,
6352 double}. But, we only need as many ARGS as there are
6353 levels of template parameters in CODE_PATTERN. We are
6354 careful not to get fooled into reducing the ARGS in
6357 template <class T> struct S { template <class U> void f(U); }
6358 template <class T> template <> void S<T>::f(int) {}
6360 which we can spot because the pattern will be a
6361 specialization in this case. */
6362 args_depth
= TMPL_ARGS_DEPTH (args
);
6364 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (t
)));
6365 if (args_depth
> parms_depth
6366 && !DECL_TEMPLATE_SPECIALIZATION (t
))
6367 args
= get_innermost_template_args (args
, parms_depth
);
6371 /* This special case arises when we have something like this:
6373 template <class T> struct S {
6374 friend void f<int>(int, double);
6377 Here, the DECL_TI_TEMPLATE for the friend declaration
6378 will be an IDENTIFIER_NODE. We are being called from
6379 tsubst_friend_function, and we want only to create a
6380 new decl (R) with appropriate types so that we can call
6381 determine_specialization. */
6382 gen_tmpl
= NULL_TREE
;
6385 if (DECL_CLASS_SCOPE_P (t
))
6387 if (DECL_NAME (t
) == constructor_name (DECL_CONTEXT (t
)))
6391 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
,
6392 complain
, t
, /*entering_scope=*/1);
6397 ctx
= DECL_CONTEXT (t
);
6399 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
6400 if (type
== error_mark_node
)
6401 return error_mark_node
;
6403 /* We do NOT check for matching decls pushed separately at this
6404 point, as they may not represent instantiations of this
6405 template, and in any case are considered separate under the
6408 DECL_USE_TEMPLATE (r
) = 0;
6409 TREE_TYPE (r
) = type
;
6410 /* Clear out the mangled name and RTL for the instantiation. */
6411 SET_DECL_ASSEMBLER_NAME (r
, NULL_TREE
);
6412 SET_DECL_RTL (r
, NULL_RTX
);
6413 DECL_INITIAL (r
) = NULL_TREE
;
6414 DECL_CONTEXT (r
) = ctx
;
6416 if (member
&& DECL_CONV_FN_P (r
))
6417 /* Type-conversion operator. Reconstruct the name, in
6418 case it's the name of one of the template's parameters. */
6419 DECL_NAME (r
) = mangle_conv_op_name_for_type (TREE_TYPE (type
));
6421 DECL_ARGUMENTS (r
) = tsubst (DECL_ARGUMENTS (t
), args
,
6423 DECL_RESULT (r
) = NULL_TREE
;
6425 TREE_STATIC (r
) = 0;
6426 TREE_PUBLIC (r
) = TREE_PUBLIC (t
);
6427 DECL_EXTERNAL (r
) = 1;
6428 /* If this is an instantiation of a function with internal
6429 linkage, we already know what object file linkage will be
6430 assigned to the instantiation. */
6431 DECL_INTERFACE_KNOWN (r
) = !TREE_PUBLIC (r
);
6432 DECL_DEFER_OUTPUT (r
) = 0;
6433 TREE_CHAIN (r
) = NULL_TREE
;
6434 DECL_PENDING_INLINE_INFO (r
) = 0;
6435 DECL_PENDING_INLINE_P (r
) = 0;
6436 DECL_SAVED_TREE (r
) = NULL_TREE
;
6438 if (DECL_CLONED_FUNCTION (r
))
6440 DECL_CLONED_FUNCTION (r
) = tsubst (DECL_CLONED_FUNCTION (t
),
6442 TREE_CHAIN (r
) = TREE_CHAIN (DECL_CLONED_FUNCTION (r
));
6443 TREE_CHAIN (DECL_CLONED_FUNCTION (r
)) = r
;
6446 /* Set up the DECL_TEMPLATE_INFO for R. There's no need to do
6447 this in the special friend case mentioned above where
6448 GEN_TMPL is NULL. */
6451 DECL_TEMPLATE_INFO (r
)
6452 = tree_cons (gen_tmpl
, argvec
, NULL_TREE
);
6453 SET_DECL_IMPLICIT_INSTANTIATION (r
);
6454 register_specialization (r
, gen_tmpl
, argvec
);
6456 /* We're not supposed to instantiate default arguments
6457 until they are called, for a template. But, for a
6460 template <class T> void f ()
6461 { extern void g(int i = T()); }
6463 we should do the substitution when the template is
6464 instantiated. We handle the member function case in
6465 instantiate_class_template since the default arguments
6466 might refer to other members of the class. */
6468 && !PRIMARY_TEMPLATE_P (gen_tmpl
)
6469 && !uses_template_parms (argvec
))
6470 tsubst_default_arguments (r
);
6473 /* Copy the list of befriending classes. */
6474 for (friends
= &DECL_BEFRIENDING_CLASSES (r
);
6476 friends
= &TREE_CHAIN (*friends
))
6478 *friends
= copy_node (*friends
);
6479 TREE_VALUE (*friends
) = tsubst (TREE_VALUE (*friends
),
6484 if (DECL_CONSTRUCTOR_P (r
) || DECL_DESTRUCTOR_P (r
))
6486 maybe_retrofit_in_chrg (r
);
6487 if (DECL_CONSTRUCTOR_P (r
))
6488 grok_ctor_properties (ctx
, r
);
6489 /* If this is an instantiation of a member template, clone it.
6490 If it isn't, that'll be handled by
6491 clone_constructors_and_destructors. */
6492 if (PRIMARY_TEMPLATE_P (gen_tmpl
))
6493 clone_function_decl (r
, /*update_method_vec_p=*/0);
6495 else if (IDENTIFIER_OPNAME_P (DECL_NAME (r
)))
6496 grok_op_properties (r
, DECL_FRIEND_P (r
),
6497 (complain
& tf_error
) != 0);
6499 if (DECL_FRIEND_P (t
) && DECL_FRIEND_CONTEXT (t
))
6500 SET_DECL_FRIEND_CONTEXT (r
,
6501 tsubst (DECL_FRIEND_CONTEXT (t
),
6502 args
, complain
, in_decl
));
6511 if (DECL_TEMPLATE_PARM_P (t
))
6512 SET_DECL_TEMPLATE_PARM_P (r
);
6514 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
6515 type
= type_decays_to (type
);
6516 TREE_TYPE (r
) = type
;
6517 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
6519 if (DECL_INITIAL (r
))
6521 if (TREE_CODE (DECL_INITIAL (r
)) != TEMPLATE_PARM_INDEX
)
6522 DECL_INITIAL (r
) = TREE_TYPE (r
);
6524 DECL_INITIAL (r
) = tsubst (DECL_INITIAL (r
), args
,
6528 DECL_CONTEXT (r
) = NULL_TREE
;
6530 if (!DECL_TEMPLATE_PARM_P (r
))
6531 DECL_ARG_TYPE (r
) = type_passed_as (type
);
6533 TREE_CHAIN (r
) = tsubst (TREE_CHAIN (t
), args
,
6534 complain
, TREE_CHAIN (t
));
6543 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
6544 if (type
== error_mark_node
)
6545 return error_mark_node
;
6546 TREE_TYPE (r
) = type
;
6547 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
6549 /* We don't have to set DECL_CONTEXT here; it is set by
6550 finish_member_declaration. */
6551 DECL_INITIAL (r
) = tsubst_expr (DECL_INITIAL (t
), args
,
6553 TREE_CHAIN (r
) = NULL_TREE
;
6554 if (VOID_TYPE_P (type
))
6555 cp_error_at ("instantiation of %qD as type %qT", r
, type
);
6562 /* It is not a dependent using decl any more. */
6563 TREE_TYPE (r
) = void_type_node
;
6565 = tsubst_copy (DECL_INITIAL (t
), args
, complain
, in_decl
);
6567 = tsubst_copy (DECL_NAME (t
), args
, complain
, in_decl
);
6568 TREE_CHAIN (r
) = NULL_TREE
;
6575 tree argvec
= NULL_TREE
;
6576 tree gen_tmpl
= NULL_TREE
;
6578 tree tmpl
= NULL_TREE
;
6580 tree type
= NULL_TREE
;
6583 if (TREE_CODE (t
) == TYPE_DECL
)
6585 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
6586 if (TREE_CODE (type
) == TEMPLATE_TEMPLATE_PARM
6587 || t
== TYPE_MAIN_DECL (TREE_TYPE (t
)))
6589 /* If this is the canonical decl, we don't have to
6590 mess with instantiations, and often we can't (for
6591 typename, template type parms and such). Note that
6592 TYPE_NAME is not correct for the above test if
6593 we've copied the type for a typedef. */
6594 r
= TYPE_NAME (type
);
6599 /* Assume this is a non-local variable. */
6602 if (TYPE_P (CP_DECL_CONTEXT (t
)))
6603 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
,
6605 in_decl
, /*entering_scope=*/1);
6606 else if (DECL_NAMESPACE_SCOPE_P (t
))
6607 ctx
= DECL_CONTEXT (t
);
6610 /* Subsequent calls to pushdecl will fill this in. */
6615 /* Check to see if we already have this specialization. */
6618 tmpl
= DECL_TI_TEMPLATE (t
);
6619 gen_tmpl
= most_general_template (tmpl
);
6620 argvec
= tsubst (DECL_TI_ARGS (t
), args
, complain
, in_decl
);
6621 spec
= retrieve_specialization (gen_tmpl
, argvec
,
6622 /*class_specializations_p=*/false);
6625 spec
= retrieve_local_specialization (t
);
6634 if (TREE_CODE (r
) == VAR_DECL
)
6636 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
6637 if (type
== error_mark_node
)
6638 return error_mark_node
;
6639 type
= complete_type (type
);
6640 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (r
)
6641 = DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (t
);
6642 type
= check_var_type (DECL_NAME (r
), type
);
6644 else if (DECL_SELF_REFERENCE_P (t
))
6645 SET_DECL_SELF_REFERENCE_P (r
);
6646 TREE_TYPE (r
) = type
;
6647 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
6648 DECL_CONTEXT (r
) = ctx
;
6649 /* Clear out the mangled name and RTL for the instantiation. */
6650 SET_DECL_ASSEMBLER_NAME (r
, NULL_TREE
);
6651 SET_DECL_RTL (r
, NULL_RTX
);
6653 /* Don't try to expand the initializer until someone tries to use
6654 this variable; otherwise we run into circular dependencies. */
6655 DECL_INITIAL (r
) = NULL_TREE
;
6656 SET_DECL_RTL (r
, NULL_RTX
);
6657 DECL_SIZE (r
) = DECL_SIZE_UNIT (r
) = 0;
6659 /* Even if the original location is out of scope, the newly
6660 substituted one is not. */
6661 if (TREE_CODE (r
) == VAR_DECL
)
6663 DECL_DEAD_FOR_LOCAL (r
) = 0;
6664 DECL_INITIALIZED_P (r
) = 0;
6669 /* A static data member declaration is always marked
6670 external when it is declared in-class, even if an
6671 initializer is present. We mimic the non-template
6673 DECL_EXTERNAL (r
) = 1;
6675 register_specialization (r
, gen_tmpl
, argvec
);
6676 DECL_TEMPLATE_INFO (r
) = tree_cons (tmpl
, argvec
, NULL_TREE
);
6677 SET_DECL_IMPLICIT_INSTANTIATION (r
);
6680 register_local_specialization (r
, t
);
6682 TREE_CHAIN (r
) = NULL_TREE
;
6691 /* Restore the file and line information. */
6692 input_location
= saved_loc
;
6697 /* Substitute into the ARG_TYPES of a function type. */
6700 tsubst_arg_types (tree arg_types
,
6702 tsubst_flags_t complain
,
6705 tree remaining_arg_types
;
6708 if (!arg_types
|| arg_types
== void_list_node
)
6711 remaining_arg_types
= tsubst_arg_types (TREE_CHAIN (arg_types
),
6712 args
, complain
, in_decl
);
6713 if (remaining_arg_types
== error_mark_node
)
6714 return error_mark_node
;
6716 type
= tsubst (TREE_VALUE (arg_types
), args
, complain
, in_decl
);
6717 if (type
== error_mark_node
)
6718 return error_mark_node
;
6719 if (VOID_TYPE_P (type
))
6721 if (complain
& tf_error
)
6723 error ("invalid parameter type %qT", type
);
6725 cp_error_at ("in declaration %qD", in_decl
);
6727 return error_mark_node
;
6730 /* Do array-to-pointer, function-to-pointer conversion, and ignore
6731 top-level qualifiers as required. */
6732 type
= TYPE_MAIN_VARIANT (type_decays_to (type
));
6734 /* Note that we do not substitute into default arguments here. The
6735 standard mandates that they be instantiated only when needed,
6736 which is done in build_over_call. */
6737 return hash_tree_cons (TREE_PURPOSE (arg_types
), type
,
6738 remaining_arg_types
);
6742 /* Substitute into a FUNCTION_TYPE or METHOD_TYPE. This routine does
6743 *not* handle the exception-specification for FNTYPE, because the
6744 initial substitution of explicitly provided template parameters
6745 during argument deduction forbids substitution into the
6746 exception-specification:
6750 All references in the function type of the function template to the
6751 corresponding template parameters are replaced by the specified tem-
6752 plate argument values. If a substitution in a template parameter or
6753 in the function type of the function template results in an invalid
6754 type, type deduction fails. [Note: The equivalent substitution in
6755 exception specifications is done only when the function is instanti-
6756 ated, at which point a program is ill-formed if the substitution
6757 results in an invalid type.] */
6760 tsubst_function_type (tree t
,
6762 tsubst_flags_t complain
,
6769 /* The TYPE_CONTEXT is not used for function/method types. */
6770 gcc_assert (TYPE_CONTEXT (t
) == NULL_TREE
);
6772 /* Substitute the return type. */
6773 return_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
6774 if (return_type
== error_mark_node
)
6775 return error_mark_node
;
6776 /* The standard does not presently indicate that creation of a
6777 function type with an invalid return type is a deduction failure.
6778 However, that is clearly analogous to creating an array of "void"
6779 or a reference to a reference. This is core issue #486. */
6780 if (TREE_CODE (return_type
) == ARRAY_TYPE
6781 || TREE_CODE (return_type
) == FUNCTION_TYPE
)
6783 if (complain
& tf_error
)
6785 if (TREE_CODE (return_type
) == ARRAY_TYPE
)
6786 error ("function returning an array");
6788 error ("function returning a function");
6790 return error_mark_node
;
6793 /* Substitute the argument types. */
6794 arg_types
= tsubst_arg_types (TYPE_ARG_TYPES (t
), args
,
6796 if (arg_types
== error_mark_node
)
6797 return error_mark_node
;
6799 /* Construct a new type node and return it. */
6800 if (TREE_CODE (t
) == FUNCTION_TYPE
)
6801 fntype
= build_function_type (return_type
, arg_types
);
6804 tree r
= TREE_TYPE (TREE_VALUE (arg_types
));
6805 if (! IS_AGGR_TYPE (r
))
6809 Type deduction may fail for any of the following
6812 -- Attempting to create "pointer to member of T" when T
6813 is not a class type. */
6814 if (complain
& tf_error
)
6815 error ("creating pointer to member function of non-class type %qT",
6817 return error_mark_node
;
6820 fntype
= build_method_type_directly (r
, return_type
,
6821 TREE_CHAIN (arg_types
));
6823 fntype
= cp_build_qualified_type_real (fntype
, TYPE_QUALS (t
), complain
);
6824 fntype
= cp_build_type_attribute_variant (fntype
, TYPE_ATTRIBUTES (t
));
6829 /* FNTYPE is a FUNCTION_TYPE or METHOD_TYPE. Substitute the template
6830 ARGS into that specification, and return the substituted
6831 specification. If there is no specification, return NULL_TREE. */
6834 tsubst_exception_specification (tree fntype
,
6836 tsubst_flags_t complain
,
6842 specs
= TYPE_RAISES_EXCEPTIONS (fntype
);
6843 new_specs
= NULL_TREE
;
6846 if (! TREE_VALUE (specs
))
6852 spec
= tsubst (TREE_VALUE (specs
), args
, complain
, in_decl
);
6853 if (spec
== error_mark_node
)
6855 new_specs
= add_exception_specifier (new_specs
, spec
, complain
);
6856 specs
= TREE_CHAIN (specs
);
6862 /* Substitute into the PARMS of a call-declarator. */
6865 tsubst_call_declarator_parms (tree parms
,
6867 tsubst_flags_t complain
,
6874 if (!parms
|| parms
== void_list_node
)
6877 new_parms
= tsubst_call_declarator_parms (TREE_CHAIN (parms
),
6878 args
, complain
, in_decl
);
6880 /* Figure out the type of this parameter. */
6881 type
= tsubst (TREE_VALUE (parms
), args
, complain
, in_decl
);
6883 /* Figure out the default argument as well. Note that we use
6884 tsubst_expr since the default argument is really an expression. */
6885 defarg
= tsubst_expr (TREE_PURPOSE (parms
), args
, complain
, in_decl
);
6887 /* Chain this parameter on to the front of those we have already
6888 processed. We don't use hash_tree_cons because that function
6889 doesn't check TREE_PARMLIST. */
6890 new_parms
= tree_cons (defarg
, type
, new_parms
);
6895 /* Take the tree structure T and replace template parameters used
6896 therein with the argument vector ARGS. IN_DECL is an associated
6897 decl for diagnostics. If an error occurs, returns ERROR_MARK_NODE.
6898 Issue error and warning messages under control of COMPLAIN. Note
6899 that we must be relatively non-tolerant of extensions here, in
6900 order to preserve conformance; if we allow substitutions that
6901 should not be allowed, we may allow argument deductions that should
6902 not succeed, and therefore report ambiguous overload situations
6903 where there are none. In theory, we could allow the substitution,
6904 but indicate that it should have failed, and allow our caller to
6905 make sure that the right thing happens, but we don't try to do this
6908 This function is used for dealing with types, decls and the like;
6909 for expressions, use tsubst_expr or tsubst_copy. */
6912 tsubst (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
6916 if (t
== NULL_TREE
|| t
== error_mark_node
6917 || t
== integer_type_node
6918 || t
== void_type_node
6919 || t
== char_type_node
6920 || t
== unknown_type_node
6921 || TREE_CODE (t
) == NAMESPACE_DECL
)
6925 return tsubst_decl (t
, args
, complain
);
6927 if (TREE_CODE (t
) == IDENTIFIER_NODE
)
6928 type
= IDENTIFIER_TYPE_VALUE (t
);
6930 type
= TREE_TYPE (t
);
6932 gcc_assert (type
!= unknown_type_node
);
6935 && TREE_CODE (t
) != TYPENAME_TYPE
6936 && TREE_CODE (t
) != IDENTIFIER_NODE
6937 && TREE_CODE (t
) != FUNCTION_TYPE
6938 && TREE_CODE (t
) != METHOD_TYPE
)
6939 type
= tsubst (type
, args
, complain
, in_decl
);
6940 if (type
== error_mark_node
)
6941 return error_mark_node
;
6943 switch (TREE_CODE (t
))
6948 return tsubst_aggr_type (t
, args
, complain
, in_decl
,
6949 /*entering_scope=*/0);
6952 case IDENTIFIER_NODE
:
6964 if (t
== integer_type_node
)
6967 if (TREE_CODE (TYPE_MIN_VALUE (t
)) == INTEGER_CST
6968 && TREE_CODE (TYPE_MAX_VALUE (t
)) == INTEGER_CST
)
6972 tree max
, omax
= TREE_OPERAND (TYPE_MAX_VALUE (t
), 0);
6974 /* The array dimension behaves like a non-type template arg,
6975 in that we want to fold it as much as possible. */
6976 max
= tsubst_template_arg (omax
, args
, complain
, in_decl
);
6977 max
= fold_decl_constant_value (max
);
6979 if (integer_zerop (omax
))
6981 /* Still allow an explicit array of size zero. */
6983 pedwarn ("creating array with size zero");
6985 else if (integer_zerop (max
)
6986 || (TREE_CODE (max
) == INTEGER_CST
6987 && INT_CST_LT (max
, integer_zero_node
)))
6991 Type deduction may fail for any of the following
6994 Attempting to create an array with a size that is
6995 zero or negative. */
6996 if (complain
& tf_error
)
6997 error ("creating array with size zero (%qE)", max
);
6999 return error_mark_node
;
7002 return compute_array_index_type (NULL_TREE
, max
);
7005 case TEMPLATE_TYPE_PARM
:
7006 case TEMPLATE_TEMPLATE_PARM
:
7007 case BOUND_TEMPLATE_TEMPLATE_PARM
:
7008 case TEMPLATE_PARM_INDEX
:
7013 tree arg
= NULL_TREE
;
7017 gcc_assert (TREE_VEC_LENGTH (args
) > 0);
7018 if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
7019 || TREE_CODE (t
) == TEMPLATE_TEMPLATE_PARM
7020 || TREE_CODE (t
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
7022 idx
= TEMPLATE_TYPE_IDX (t
);
7023 level
= TEMPLATE_TYPE_LEVEL (t
);
7027 idx
= TEMPLATE_PARM_IDX (t
);
7028 level
= TEMPLATE_PARM_LEVEL (t
);
7031 levels
= TMPL_ARGS_DEPTH (args
);
7032 if (level
<= levels
)
7033 arg
= TMPL_ARG (args
, level
, idx
);
7035 if (arg
== error_mark_node
)
7036 return error_mark_node
;
7037 else if (arg
!= NULL_TREE
)
7039 if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
7041 gcc_assert (TYPE_P (arg
));
7042 return cp_build_qualified_type_real
7043 (arg
, cp_type_quals (arg
) | cp_type_quals (t
),
7044 complain
| tf_ignore_bad_quals
);
7046 else if (TREE_CODE (t
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
7048 /* We are processing a type constructed from a
7049 template template parameter. */
7050 tree argvec
= tsubst (TYPE_TI_ARGS (t
),
7051 args
, complain
, in_decl
);
7052 if (argvec
== error_mark_node
)
7053 return error_mark_node
;
7055 /* We can get a TEMPLATE_TEMPLATE_PARM here when we
7056 are resolving nested-types in the signature of a
7057 member function templates. Otherwise ARG is a
7058 TEMPLATE_DECL and is the real template to be
7060 if (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
7061 arg
= TYPE_NAME (arg
);
7063 r
= lookup_template_class (arg
,
7066 /*entering_scope=*/0,
7068 return cp_build_qualified_type_real
7069 (r
, TYPE_QUALS (t
), complain
);
7072 /* TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX. */
7077 /* This can happen during the attempted tsubst'ing in
7078 unify. This means that we don't yet have any information
7079 about the template parameter in question. */
7082 /* If we get here, we must have been looking at a parm for a
7083 more deeply nested template. Make a new version of this
7084 template parameter, but with a lower level. */
7085 switch (TREE_CODE (t
))
7087 case TEMPLATE_TYPE_PARM
:
7088 case TEMPLATE_TEMPLATE_PARM
:
7089 case BOUND_TEMPLATE_TEMPLATE_PARM
:
7090 if (cp_type_quals (t
))
7092 r
= tsubst (TYPE_MAIN_VARIANT (t
), args
, complain
, in_decl
);
7093 r
= cp_build_qualified_type_real
7094 (r
, cp_type_quals (t
),
7095 complain
| (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
7096 ? tf_ignore_bad_quals
: 0));
7101 TEMPLATE_TYPE_PARM_INDEX (r
)
7102 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (t
),
7104 TYPE_STUB_DECL (r
) = TYPE_NAME (r
) = TEMPLATE_TYPE_DECL (r
);
7105 TYPE_MAIN_VARIANT (r
) = r
;
7106 TYPE_POINTER_TO (r
) = NULL_TREE
;
7107 TYPE_REFERENCE_TO (r
) = NULL_TREE
;
7109 if (TREE_CODE (t
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
7111 tree argvec
= tsubst (TYPE_TI_ARGS (t
), args
,
7113 if (argvec
== error_mark_node
)
7114 return error_mark_node
;
7116 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (r
)
7117 = tree_cons (TYPE_TI_TEMPLATE (t
), argvec
, NULL_TREE
);
7122 case TEMPLATE_PARM_INDEX
:
7123 r
= reduce_template_parm_level (t
, type
, levels
);
7135 tree purpose
, value
, chain
;
7137 if (t
== void_list_node
)
7140 purpose
= TREE_PURPOSE (t
);
7143 purpose
= tsubst (purpose
, args
, complain
, in_decl
);
7144 if (purpose
== error_mark_node
)
7145 return error_mark_node
;
7147 value
= TREE_VALUE (t
);
7150 value
= tsubst (value
, args
, complain
, in_decl
);
7151 if (value
== error_mark_node
)
7152 return error_mark_node
;
7154 chain
= TREE_CHAIN (t
);
7155 if (chain
&& chain
!= void_type_node
)
7157 chain
= tsubst (chain
, args
, complain
, in_decl
);
7158 if (chain
== error_mark_node
)
7159 return error_mark_node
;
7161 if (purpose
== TREE_PURPOSE (t
)
7162 && value
== TREE_VALUE (t
)
7163 && chain
== TREE_CHAIN (t
))
7165 return hash_tree_cons (purpose
, value
, chain
);
7169 /* We should never be tsubsting a binfo. */
7173 /* A vector of template arguments. */
7175 return tsubst_template_args (t
, args
, complain
, in_decl
);
7178 case REFERENCE_TYPE
:
7180 enum tree_code code
;
7182 if (type
== TREE_TYPE (t
) && TREE_CODE (type
) != METHOD_TYPE
)
7185 code
= TREE_CODE (t
);
7190 Type deduction may fail for any of the following
7193 -- Attempting to create a pointer to reference type.
7194 -- Attempting to create a reference to a reference type or
7195 a reference to void. */
7196 if (TREE_CODE (type
) == REFERENCE_TYPE
7197 || (code
== REFERENCE_TYPE
&& TREE_CODE (type
) == VOID_TYPE
))
7199 static location_t last_loc
;
7201 /* We keep track of the last time we issued this error
7202 message to avoid spewing a ton of messages during a
7203 single bad template instantiation. */
7204 if (complain
& tf_error
7205 #ifdef USE_MAPPED_LOCATION
7206 && last_loc
!= input_location
7208 && (last_loc
.line
!= input_line
7209 || last_loc
.file
!= input_filename
)
7213 if (TREE_CODE (type
) == VOID_TYPE
)
7214 error ("forming reference to void");
7216 error ("forming %s to reference type %qT",
7217 (code
== POINTER_TYPE
) ? "pointer" : "reference",
7219 last_loc
= input_location
;
7222 return error_mark_node
;
7224 else if (code
== POINTER_TYPE
)
7226 r
= build_pointer_type (type
);
7227 if (TREE_CODE (type
) == METHOD_TYPE
)
7228 r
= build_ptrmemfunc_type (r
);
7231 r
= build_reference_type (type
);
7232 r
= cp_build_qualified_type_real (r
, TYPE_QUALS (t
), complain
);
7234 if (r
!= error_mark_node
)
7235 /* Will this ever be needed for TYPE_..._TO values? */
7242 r
= tsubst (TYPE_OFFSET_BASETYPE (t
), args
, complain
, in_decl
);
7243 if (r
== error_mark_node
|| !IS_AGGR_TYPE (r
))
7247 Type deduction may fail for any of the following
7250 -- Attempting to create "pointer to member of T" when T
7251 is not a class type. */
7252 if (complain
& tf_error
)
7253 error ("creating pointer to member of non-class type %qT", r
);
7254 return error_mark_node
;
7256 if (TREE_CODE (type
) == REFERENCE_TYPE
)
7258 if (complain
& tf_error
)
7259 error ("creating pointer to member reference type %qT", type
);
7261 return error_mark_node
;
7263 gcc_assert (TREE_CODE (type
) != METHOD_TYPE
);
7264 if (TREE_CODE (type
) == FUNCTION_TYPE
)
7266 /* The type of the implicit object parameter gets its
7267 cv-qualifiers from the FUNCTION_TYPE. */
7269 tree this_type
= cp_build_qualified_type (TYPE_MAIN_VARIANT (r
),
7270 cp_type_quals (type
));
7272 method_type
= build_method_type_directly (this_type
,
7274 TYPE_ARG_TYPES (type
));
7275 memptr
= build_ptrmemfunc_type (build_pointer_type (method_type
));
7276 return cp_build_qualified_type_real (memptr
, cp_type_quals (t
),
7280 return cp_build_qualified_type_real (build_ptrmem_type (r
, type
),
7289 fntype
= tsubst_function_type (t
, args
, complain
, in_decl
);
7290 if (fntype
== error_mark_node
)
7291 return error_mark_node
;
7293 /* Substitute the exception specification. */
7294 specs
= tsubst_exception_specification (t
, args
, complain
,
7297 fntype
= build_exception_variant (fntype
, specs
);
7302 tree domain
= tsubst (TYPE_DOMAIN (t
), args
, complain
, in_decl
);
7303 if (domain
== error_mark_node
)
7304 return error_mark_node
;
7306 /* As an optimization, we avoid regenerating the array type if
7307 it will obviously be the same as T. */
7308 if (type
== TREE_TYPE (t
) && domain
== TYPE_DOMAIN (t
))
7311 /* These checks should match the ones in grokdeclarator.
7315 The deduction may fail for any of the following reasons:
7317 -- Attempting to create an array with an element type that
7318 is void, a function type, or a reference type, or [DR337]
7319 an abstract class type. */
7320 if (TREE_CODE (type
) == VOID_TYPE
7321 || TREE_CODE (type
) == FUNCTION_TYPE
7322 || TREE_CODE (type
) == REFERENCE_TYPE
)
7324 if (complain
& tf_error
)
7325 error ("creating array of %qT", type
);
7326 return error_mark_node
;
7328 if (CLASS_TYPE_P (type
) && CLASSTYPE_PURE_VIRTUALS (type
))
7330 if (complain
& tf_error
)
7331 error ("creating array of %qT, which is an abstract class type",
7333 return error_mark_node
;
7336 r
= build_cplus_array_type (type
, domain
);
7343 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
7344 tree e2
= tsubst (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
7346 if (e1
== error_mark_node
|| e2
== error_mark_node
)
7347 return error_mark_node
;
7349 return fold_build2 (TREE_CODE (t
), TREE_TYPE (t
), e1
, e2
);
7355 tree e
= tsubst (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
7356 if (e
== error_mark_node
)
7357 return error_mark_node
;
7359 return fold_build1 (TREE_CODE (t
), TREE_TYPE (t
), e
);
7364 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
7365 in_decl
, /*entering_scope=*/1);
7366 tree f
= tsubst_copy (TYPENAME_TYPE_FULLNAME (t
), args
,
7369 if (ctx
== error_mark_node
|| f
== error_mark_node
)
7370 return error_mark_node
;
7372 if (!IS_AGGR_TYPE (ctx
))
7374 if (complain
& tf_error
)
7375 error ("%qT is not a class, struct, or union type", ctx
);
7376 return error_mark_node
;
7378 else if (!uses_template_parms (ctx
) && !TYPE_BEING_DEFINED (ctx
))
7380 /* Normally, make_typename_type does not require that the CTX
7381 have complete type in order to allow things like:
7383 template <class T> struct S { typename S<T>::X Y; };
7385 But, such constructs have already been resolved by this
7386 point, so here CTX really should have complete type, unless
7387 it's a partial instantiation. */
7388 ctx
= complete_type (ctx
);
7389 if (!COMPLETE_TYPE_P (ctx
))
7391 if (complain
& tf_error
)
7392 cxx_incomplete_type_error (NULL_TREE
, ctx
);
7393 return error_mark_node
;
7397 f
= make_typename_type (ctx
, f
, typename_type
,
7398 (complain
& tf_error
) | tf_keep_type_decl
);
7399 if (f
== error_mark_node
)
7401 if (TREE_CODE (f
) == TYPE_DECL
)
7403 complain
|= tf_ignore_bad_quals
;
7407 if (TREE_CODE (f
) != TYPENAME_TYPE
)
7409 if (TYPENAME_IS_ENUM_P (t
) && TREE_CODE (f
) != ENUMERAL_TYPE
)
7410 error ("%qT resolves to %qT, which is not an enumeration type",
7412 else if (TYPENAME_IS_CLASS_P (t
) && !CLASS_TYPE_P (f
))
7413 error ("%qT resolves to %qT, which is is not a class type",
7417 return cp_build_qualified_type_real
7418 (f
, cp_type_quals (f
) | cp_type_quals (t
), complain
);
7421 case UNBOUND_CLASS_TEMPLATE
:
7423 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
7424 in_decl
, /*entering_scope=*/1);
7425 tree name
= TYPE_IDENTIFIER (t
);
7426 tree parm_list
= DECL_TEMPLATE_PARMS (TYPE_NAME (t
));
7428 if (ctx
== error_mark_node
|| name
== error_mark_node
)
7429 return error_mark_node
;
7432 parm_list
= tsubst_template_parms (parm_list
, args
, complain
);
7433 return make_unbound_class_template (ctx
, name
, parm_list
, complain
);
7443 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
7444 tree e2
= tsubst_expr (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
7445 if (e1
== error_mark_node
|| e2
== error_mark_node
)
7446 return error_mark_node
;
7448 return build_nt (ARRAY_REF
, e1
, e2
, NULL_TREE
, NULL_TREE
);
7453 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
7454 tree e2
= tsubst (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
7455 if (e1
== error_mark_node
|| e2
== error_mark_node
)
7456 return error_mark_node
;
7458 return build_nt (TREE_CODE (t
), e1
, e2
);
7465 type
= finish_typeof (tsubst_expr (TYPEOF_TYPE_EXPR (t
), args
,
7466 complain
, in_decl
));
7467 return cp_build_qualified_type_real (type
,
7469 | cp_type_quals (type
),
7474 sorry ("use of %qs in template",
7475 tree_code_name
[(int) TREE_CODE (t
)]);
7476 return error_mark_node
;
7480 /* Like tsubst_expr for a BASELINK. OBJECT_TYPE, if non-NULL, is the
7481 type of the expression on the left-hand side of the "." or "->"
7485 tsubst_baselink (tree baselink
, tree object_type
,
7486 tree args
, tsubst_flags_t complain
, tree in_decl
)
7489 tree qualifying_scope
;
7491 tree template_args
= 0;
7492 bool template_id_p
= false;
7494 /* A baselink indicates a function from a base class. The
7495 BASELINK_ACCESS_BINFO and BASELINK_BINFO are going to have
7496 non-dependent types; otherwise, the lookup could not have
7497 succeeded. However, they may indicate bases of the template
7498 class, rather than the instantiated class.
7500 In addition, lookups that were not ambiguous before may be
7501 ambiguous now. Therefore, we perform the lookup again. */
7502 qualifying_scope
= BINFO_TYPE (BASELINK_ACCESS_BINFO (baselink
));
7503 fns
= BASELINK_FUNCTIONS (baselink
);
7504 if (TREE_CODE (fns
) == TEMPLATE_ID_EXPR
)
7506 template_id_p
= true;
7507 template_args
= TREE_OPERAND (fns
, 1);
7508 fns
= TREE_OPERAND (fns
, 0);
7510 template_args
= tsubst_template_args (template_args
, args
,
7513 name
= DECL_NAME (get_first_fn (fns
));
7514 baselink
= lookup_fnfields (qualifying_scope
, name
, /*protect=*/1);
7516 /* If lookup found a single function, mark it as used at this
7517 point. (If it lookup found multiple functions the one selected
7518 later by overload resolution will be marked as used at that
7520 if (BASELINK_P (baselink
))
7521 fns
= BASELINK_FUNCTIONS (baselink
);
7522 if (!template_id_p
&& !really_overloaded_fn (fns
))
7523 mark_used (OVL_CURRENT (fns
));
7525 /* Add back the template arguments, if present. */
7526 if (BASELINK_P (baselink
) && template_id_p
)
7527 BASELINK_FUNCTIONS (baselink
)
7528 = build_nt (TEMPLATE_ID_EXPR
,
7529 BASELINK_FUNCTIONS (baselink
),
7533 object_type
= current_class_type
;
7534 return adjust_result_of_qualified_name_lookup (baselink
,
7539 /* Like tsubst_expr for a SCOPE_REF, given by QUALIFIED_ID. DONE is
7540 true if the qualified-id will be a postfix-expression in-and-of
7541 itself; false if more of the postfix-expression follows the
7542 QUALIFIED_ID. ADDRESS_P is true if the qualified-id is the operand
7546 tsubst_qualified_id (tree qualified_id
, tree args
,
7547 tsubst_flags_t complain
, tree in_decl
,
7548 bool done
, bool address_p
)
7556 gcc_assert (TREE_CODE (qualified_id
) == SCOPE_REF
);
7558 /* Figure out what name to look up. */
7559 name
= TREE_OPERAND (qualified_id
, 1);
7560 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
7563 template_args
= TREE_OPERAND (name
, 1);
7565 template_args
= tsubst_template_args (template_args
, args
,
7567 name
= TREE_OPERAND (name
, 0);
7571 is_template
= false;
7572 template_args
= NULL_TREE
;
7575 /* Substitute into the qualifying scope. When there are no ARGS, we
7576 are just trying to simplify a non-dependent expression. In that
7577 case the qualifying scope may be dependent, and, in any case,
7578 substituting will not help. */
7579 scope
= TREE_OPERAND (qualified_id
, 0);
7582 scope
= tsubst (scope
, args
, complain
, in_decl
);
7583 expr
= tsubst_copy (name
, args
, complain
, in_decl
);
7588 if (dependent_type_p (scope
))
7589 return build_nt (SCOPE_REF
, scope
, expr
);
7591 if (!BASELINK_P (name
) && !DECL_P (expr
))
7593 expr
= lookup_qualified_name (scope
, expr
, /*is_type_p=*/0, false);
7594 if (TREE_CODE (TREE_CODE (expr
) == TEMPLATE_DECL
7595 ? DECL_TEMPLATE_RESULT (expr
) : expr
) == TYPE_DECL
)
7597 if (complain
& tf_error
)
7599 error ("dependent-name %qE is parsed as a non-type, but "
7600 "instantiation yields a type", qualified_id
);
7601 inform ("say %<typename %E%> if a type is meant", qualified_id
);
7603 return error_mark_node
;
7609 check_accessibility_of_qualified_id (expr
, /*object_type=*/NULL_TREE
,
7611 /* Remember that there was a reference to this entity. */
7615 if (expr
== error_mark_node
|| TREE_CODE (expr
) == TREE_LIST
)
7617 if (complain
& tf_error
)
7618 qualified_name_lookup_error (scope
,
7619 TREE_OPERAND (qualified_id
, 1),
7621 return error_mark_node
;
7625 expr
= lookup_template_function (expr
, template_args
);
7627 if (expr
== error_mark_node
&& complain
& tf_error
)
7628 qualified_name_lookup_error (scope
, TREE_OPERAND (qualified_id
, 1),
7630 else if (TYPE_P (scope
))
7632 expr
= (adjust_result_of_qualified_name_lookup
7633 (expr
, scope
, current_class_type
));
7634 expr
= finish_qualified_id_expr (scope
, expr
, done
, address_p
);
7637 expr
= convert_from_reference (expr
);
7642 /* Like tsubst, but deals with expressions. This function just replaces
7643 template parms; to finish processing the resultant expression, use
7647 tsubst_copy (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
7649 enum tree_code code
;
7652 if (t
== NULL_TREE
|| t
== error_mark_node
)
7655 code
= TREE_CODE (t
);
7660 r
= retrieve_local_specialization (t
);
7661 gcc_assert (r
!= NULL
);
7670 if (DECL_TEMPLATE_PARM_P (t
))
7671 return tsubst_copy (DECL_INITIAL (t
), args
, complain
, in_decl
);
7672 /* There is no need to substitute into namespace-scope
7674 if (DECL_NAMESPACE_SCOPE_P (t
))
7676 /* If ARGS is NULL, then T is known to be non-dependent. */
7677 if (args
== NULL_TREE
)
7678 return integral_constant_value (t
);
7680 /* Unfortunately, we cannot just call lookup_name here.
7683 template <int I> int f() {
7685 struct S { void g() { E e = a; } };
7688 When we instantiate f<7>::S::g(), say, lookup_name is not
7689 clever enough to find f<7>::a. */
7691 = tsubst_aggr_type (TREE_TYPE (t
), args
, complain
, in_decl
,
7692 /*entering_scope=*/0);
7694 for (v
= TYPE_VALUES (enum_type
);
7697 if (TREE_PURPOSE (v
) == DECL_NAME (t
))
7698 return TREE_VALUE (v
);
7700 /* We didn't find the name. That should never happen; if
7701 name-lookup found it during preliminary parsing, we
7702 should find it again here during instantiation. */
7708 if (DECL_CONTEXT (t
))
7712 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
7713 /*entering_scope=*/1);
7714 if (ctx
!= DECL_CONTEXT (t
))
7716 tree r
= lookup_field (ctx
, DECL_NAME (t
), 0, false);
7719 if (complain
& tf_error
)
7720 error ("using invalid field %qD", t
);
7721 return error_mark_node
;
7731 if ((DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
))
7732 || local_variable_p (t
))
7733 t
= tsubst (t
, args
, complain
, in_decl
);
7738 return tsubst_baselink (t
, current_class_type
, args
, complain
, in_decl
);
7741 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
7742 return tsubst (TREE_TYPE (DECL_TEMPLATE_RESULT (t
)),
7743 args
, complain
, in_decl
);
7744 else if (DECL_FUNCTION_TEMPLATE_P (t
) && DECL_MEMBER_TEMPLATE_P (t
))
7745 return tsubst (t
, args
, complain
, in_decl
);
7746 else if (DECL_CLASS_SCOPE_P (t
)
7747 && uses_template_parms (DECL_CONTEXT (t
)))
7749 /* Template template argument like the following example need
7752 template <template <class> class TT> struct C {};
7753 template <class T> struct D {
7754 template <class U> struct E {};
7759 We are processing the template argument `E' in #1 for
7760 the template instantiation #2. Originally, `E' is a
7761 TEMPLATE_DECL with `D<T>' as its DECL_CONTEXT. Now we
7762 have to substitute this with one having context `D<int>'. */
7764 tree context
= tsubst (DECL_CONTEXT (t
), args
, complain
, in_decl
);
7765 return lookup_field (context
, DECL_NAME(t
), 0, false);
7768 /* Ordinary template template argument. */
7772 case REINTERPRET_CAST_EXPR
:
7773 case CONST_CAST_EXPR
:
7774 case STATIC_CAST_EXPR
:
7775 case DYNAMIC_CAST_EXPR
:
7778 (code
, tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
7779 tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
));
7783 case TRUTH_NOT_EXPR
:
7786 case CONVERT_EXPR
: /* Unary + */
7795 (code
, tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
7796 tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
));
7803 object
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
7804 name
= TREE_OPERAND (t
, 1);
7805 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
7807 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
7809 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
7811 else if (TREE_CODE (name
) == SCOPE_REF
7812 && TREE_CODE (TREE_OPERAND (name
, 1)) == BIT_NOT_EXPR
)
7814 tree base
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
7816 name
= TREE_OPERAND (name
, 1);
7817 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
7819 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
7820 name
= build_nt (SCOPE_REF
, base
, name
);
7822 else if (TREE_CODE (name
) == BASELINK
)
7823 name
= tsubst_baselink (name
,
7824 non_reference (TREE_TYPE (object
)),
7828 name
= tsubst_copy (name
, args
, complain
, in_decl
);
7829 return build_nt (COMPONENT_REF
, object
, name
, NULL_TREE
);
7835 case TRUNC_DIV_EXPR
:
7837 case FLOOR_DIV_EXPR
:
7838 case ROUND_DIV_EXPR
:
7839 case EXACT_DIV_EXPR
:
7843 case TRUNC_MOD_EXPR
:
7844 case FLOOR_MOD_EXPR
:
7845 case TRUTH_ANDIF_EXPR
:
7846 case TRUTH_ORIF_EXPR
:
7847 case TRUTH_AND_EXPR
:
7865 case PREDECREMENT_EXPR
:
7866 case PREINCREMENT_EXPR
:
7867 case POSTDECREMENT_EXPR
:
7868 case POSTINCREMENT_EXPR
:
7870 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
7871 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
));
7876 tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
7877 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
),
7878 NULL_TREE
, NULL_TREE
);
7881 return build_nt (code
,
7882 tsubst_copy (TREE_OPERAND (t
, 0), args
,
7884 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
,
7890 case PSEUDO_DTOR_EXPR
:
7893 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
7894 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
),
7895 tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
));
7896 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
7903 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
7904 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
),
7905 tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
));
7906 NEW_EXPR_USE_GLOBAL (r
) = NEW_EXPR_USE_GLOBAL (t
);
7913 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
7914 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
));
7915 DELETE_EXPR_USE_GLOBAL (r
) = DELETE_EXPR_USE_GLOBAL (t
);
7916 DELETE_EXPR_USE_VEC (r
) = DELETE_EXPR_USE_VEC (t
);
7920 case TEMPLATE_ID_EXPR
:
7922 /* Substituted template arguments */
7923 tree fn
= TREE_OPERAND (t
, 0);
7924 tree targs
= TREE_OPERAND (t
, 1);
7926 fn
= tsubst_copy (fn
, args
, complain
, in_decl
);
7928 targs
= tsubst_template_args (targs
, args
, complain
, in_decl
);
7930 return lookup_template_function (fn
, targs
);
7935 tree purpose
, value
, chain
;
7937 if (t
== void_list_node
)
7940 purpose
= TREE_PURPOSE (t
);
7942 purpose
= tsubst_copy (purpose
, args
, complain
, in_decl
);
7943 value
= TREE_VALUE (t
);
7945 value
= tsubst_copy (value
, args
, complain
, in_decl
);
7946 chain
= TREE_CHAIN (t
);
7947 if (chain
&& chain
!= void_type_node
)
7948 chain
= tsubst_copy (chain
, args
, complain
, in_decl
);
7949 if (purpose
== TREE_PURPOSE (t
)
7950 && value
== TREE_VALUE (t
)
7951 && chain
== TREE_CHAIN (t
))
7953 return tree_cons (purpose
, value
, chain
);
7960 case TEMPLATE_TYPE_PARM
:
7961 case TEMPLATE_TEMPLATE_PARM
:
7962 case BOUND_TEMPLATE_TEMPLATE_PARM
:
7963 case TEMPLATE_PARM_INDEX
:
7965 case REFERENCE_TYPE
:
7971 case UNBOUND_CLASS_TEMPLATE
:
7974 return tsubst (t
, args
, complain
, in_decl
);
7976 case IDENTIFIER_NODE
:
7977 if (IDENTIFIER_TYPENAME_P (t
))
7979 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
7980 return mangle_conv_op_name_for_type (new_type
);
7987 r
= build_constructor
7988 (tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
7989 tsubst_copy (CONSTRUCTOR_ELTS (t
), args
, complain
, in_decl
));
7990 TREE_HAS_CONSTRUCTOR (r
) = TREE_HAS_CONSTRUCTOR (t
);
7995 return build_x_va_arg (tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
,
7997 tsubst (TREE_TYPE (t
), args
, complain
, in_decl
));
7999 case CLEANUP_POINT_EXPR
:
8000 /* We shouldn't have built any of these during initial template
8001 generation. Instead, they should be built during instantiation
8002 in response to the saved STMT_IS_FULL_EXPR_P setting. */
8010 /* Like tsubst_copy for expressions, etc. but also does semantic
8014 tsubst_expr (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
8018 if (t
== NULL_TREE
|| t
== error_mark_node
)
8021 if (EXPR_HAS_LOCATION (t
))
8022 input_location
= EXPR_LOCATION (t
);
8023 if (STATEMENT_CODE_P (TREE_CODE (t
)))
8024 current_stmt_tree ()->stmts_are_full_exprs_p
= STMT_IS_FULL_EXPR_P (t
);
8026 switch (TREE_CODE (t
))
8028 case STATEMENT_LIST
:
8030 tree_stmt_iterator i
;
8031 for (i
= tsi_start (t
); !tsi_end_p (i
); tsi_next (&i
))
8032 tsubst_expr (tsi_stmt (i
), args
, complain
, in_decl
);
8036 case CTOR_INITIALIZER
:
8037 finish_mem_initializers (tsubst_initializer_list
8038 (TREE_OPERAND (t
, 0), args
));
8042 finish_return_stmt (tsubst_expr (TREE_OPERAND (t
, 0),
8043 args
, complain
, in_decl
));
8047 tmp
= tsubst_expr (EXPR_STMT_EXPR (t
), args
, complain
, in_decl
);
8048 if (EXPR_STMT_STMT_EXPR_RESULT (t
))
8049 finish_stmt_expr_expr (tmp
, cur_stmt_expr
);
8051 finish_expr_stmt (tmp
);
8055 do_using_directive (tsubst_expr (USING_STMT_NAMESPACE (t
),
8056 args
, complain
, in_decl
));
8064 decl
= DECL_EXPR_DECL (t
);
8065 if (TREE_CODE (decl
) == LABEL_DECL
)
8066 finish_label_decl (DECL_NAME (decl
));
8067 else if (TREE_CODE (decl
) == USING_DECL
)
8069 tree scope
= DECL_INITIAL (decl
);
8070 tree name
= DECL_NAME (decl
);
8073 scope
= tsubst_expr (scope
, args
, complain
, in_decl
);
8074 decl
= lookup_qualified_name (scope
, name
,
8075 /*is_type_p=*/false,
8076 /*complain=*/false);
8077 if (decl
== error_mark_node
|| TREE_CODE (decl
) == TREE_LIST
)
8078 qualified_name_lookup_error (scope
, name
, decl
);
8080 do_local_using_decl (decl
, scope
, name
);
8084 init
= DECL_INITIAL (decl
);
8085 decl
= tsubst (decl
, args
, complain
, in_decl
);
8086 if (decl
!= error_mark_node
)
8089 DECL_INITIAL (decl
) = error_mark_node
;
8090 /* By marking the declaration as instantiated, we avoid
8091 trying to instantiate it. Since instantiate_decl can't
8092 handle local variables, and since we've already done
8093 all that needs to be done, that's the right thing to
8095 if (TREE_CODE (decl
) == VAR_DECL
)
8096 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
8097 if (TREE_CODE (decl
) == VAR_DECL
8098 && ANON_AGGR_TYPE_P (TREE_TYPE (decl
)))
8099 /* Anonymous aggregates are a special case. */
8100 finish_anon_union (decl
);
8103 maybe_push_decl (decl
);
8104 if (TREE_CODE (decl
) == VAR_DECL
8105 && DECL_PRETTY_FUNCTION_P (decl
))
8107 /* For __PRETTY_FUNCTION__ we have to adjust the
8109 const char *const name
8110 = cxx_printable_name (current_function_decl
, 2);
8111 init
= cp_fname_init (name
, &TREE_TYPE (decl
));
8114 init
= tsubst_expr (init
, args
, complain
, in_decl
);
8115 cp_finish_decl (decl
, init
, NULL_TREE
, 0);
8120 /* A DECL_EXPR can also be used as an expression, in the condition
8121 clause of an if/for/while construct. */
8126 stmt
= begin_for_stmt ();
8127 tsubst_expr (FOR_INIT_STMT (t
), args
, complain
, in_decl
);
8128 finish_for_init_stmt (stmt
);
8129 tmp
= tsubst_expr (FOR_COND (t
), args
, complain
, in_decl
);
8130 finish_for_cond (tmp
, stmt
);
8131 tmp
= tsubst_expr (FOR_EXPR (t
), args
, complain
, in_decl
);
8132 finish_for_expr (tmp
, stmt
);
8133 tsubst_expr (FOR_BODY (t
), args
, complain
, in_decl
);
8134 finish_for_stmt (stmt
);
8138 stmt
= begin_while_stmt ();
8139 tmp
= tsubst_expr (WHILE_COND (t
), args
, complain
, in_decl
);
8140 finish_while_stmt_cond (tmp
, stmt
);
8141 tsubst_expr (WHILE_BODY (t
), args
, complain
, in_decl
);
8142 finish_while_stmt (stmt
);
8146 stmt
= begin_do_stmt ();
8147 tsubst_expr (DO_BODY (t
), args
, complain
, in_decl
);
8148 finish_do_body (stmt
);
8149 tmp
= tsubst_expr (DO_COND (t
), args
, complain
, in_decl
);
8150 finish_do_stmt (tmp
, stmt
);
8154 stmt
= begin_if_stmt ();
8155 tmp
= tsubst_expr (IF_COND (t
), args
, complain
, in_decl
);
8156 finish_if_stmt_cond (tmp
, stmt
);
8157 tsubst_expr (THEN_CLAUSE (t
), args
, complain
, in_decl
);
8158 finish_then_clause (stmt
);
8160 if (ELSE_CLAUSE (t
))
8162 begin_else_clause (stmt
);
8163 tsubst_expr (ELSE_CLAUSE (t
), args
, complain
, in_decl
);
8164 finish_else_clause (stmt
);
8167 finish_if_stmt (stmt
);
8171 if (BIND_EXPR_BODY_BLOCK (t
))
8172 stmt
= begin_function_body ();
8174 stmt
= begin_compound_stmt (BIND_EXPR_TRY_BLOCK (t
)
8175 ? BCS_TRY_BLOCK
: 0);
8177 tsubst_expr (BIND_EXPR_BODY (t
), args
, complain
, in_decl
);
8179 if (BIND_EXPR_BODY_BLOCK (t
))
8180 finish_function_body (stmt
);
8182 finish_compound_stmt (stmt
);
8186 finish_break_stmt ();
8190 finish_continue_stmt ();
8194 stmt
= begin_switch_stmt ();
8195 tmp
= tsubst_expr (SWITCH_STMT_COND (t
), args
, complain
, in_decl
);
8196 finish_switch_cond (tmp
, stmt
);
8197 tsubst_expr (SWITCH_STMT_BODY (t
), args
, complain
, in_decl
);
8198 finish_switch_stmt (stmt
);
8201 case CASE_LABEL_EXPR
:
8202 finish_case_label (tsubst_expr (CASE_LOW (t
), args
, complain
, in_decl
),
8203 tsubst_expr (CASE_HIGH (t
), args
, complain
,
8208 finish_label_stmt (DECL_NAME (LABEL_EXPR_LABEL (t
)));
8212 tmp
= GOTO_DESTINATION (t
);
8213 if (TREE_CODE (tmp
) != LABEL_DECL
)
8214 /* Computed goto's must be tsubst'd into. On the other hand,
8215 non-computed gotos must not be; the identifier in question
8216 will have no binding. */
8217 tmp
= tsubst_expr (tmp
, args
, complain
, in_decl
);
8219 tmp
= DECL_NAME (tmp
);
8220 finish_goto_stmt (tmp
);
8224 tmp
= finish_asm_stmt
8225 (ASM_VOLATILE_P (t
),
8226 tsubst_expr (ASM_STRING (t
), args
, complain
, in_decl
),
8227 tsubst_expr (ASM_OUTPUTS (t
), args
, complain
, in_decl
),
8228 tsubst_expr (ASM_INPUTS (t
), args
, complain
, in_decl
),
8229 tsubst_expr (ASM_CLOBBERS (t
), args
, complain
, in_decl
));
8231 tree asm_expr
= tmp
;
8232 if (TREE_CODE (asm_expr
) == CLEANUP_POINT_EXPR
)
8233 asm_expr
= TREE_OPERAND (asm_expr
, 0);
8234 ASM_INPUT_P (asm_expr
) = ASM_INPUT_P (t
);
8241 stmt
= begin_try_block ();
8242 tsubst_expr (TRY_STMTS (t
), args
, complain
, in_decl
);
8243 finish_cleanup_try_block (stmt
);
8244 finish_cleanup (tsubst_expr (TRY_HANDLERS (t
), args
,
8250 if (FN_TRY_BLOCK_P (t
))
8251 stmt
= begin_function_try_block ();
8253 stmt
= begin_try_block ();
8255 tsubst_expr (TRY_STMTS (t
), args
, complain
, in_decl
);
8257 if (FN_TRY_BLOCK_P (t
))
8258 finish_function_try_block (stmt
);
8260 finish_try_block (stmt
);
8262 tsubst_expr (TRY_HANDLERS (t
), args
, complain
, in_decl
);
8263 if (FN_TRY_BLOCK_P (t
))
8264 finish_function_handler_sequence (stmt
);
8266 finish_handler_sequence (stmt
);
8274 stmt
= begin_handler ();
8275 if (HANDLER_PARMS (t
))
8277 decl
= HANDLER_PARMS (t
);
8278 decl
= tsubst (decl
, args
, complain
, in_decl
);
8279 /* Prevent instantiate_decl from trying to instantiate
8280 this variable. We've already done all that needs to be
8282 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
8286 finish_handler_parms (decl
, stmt
);
8287 tsubst_expr (HANDLER_BODY (t
), args
, complain
, in_decl
);
8288 finish_handler (stmt
);
8293 tsubst (TREE_TYPE (t
), args
, complain
, NULL_TREE
);
8297 gcc_assert (!STATEMENT_CODE_P (TREE_CODE (t
)));
8299 return tsubst_copy_and_build (t
, args
, complain
, in_decl
,
8300 /*function_p=*/false);
8306 /* T is a postfix-expression that is not being used in a function
8307 call. Return the substituted version of T. */
8310 tsubst_non_call_postfix_expression (tree t
, tree args
,
8311 tsubst_flags_t complain
,
8314 if (TREE_CODE (t
) == SCOPE_REF
)
8315 t
= tsubst_qualified_id (t
, args
, complain
, in_decl
,
8316 /*done=*/false, /*address_p=*/false);
8318 t
= tsubst_copy_and_build (t
, args
, complain
, in_decl
,
8319 /*function_p=*/false);
8324 /* Like tsubst but deals with expressions and performs semantic
8325 analysis. FUNCTION_P is true if T is the "F" in "F (ARGS)". */
8328 tsubst_copy_and_build (tree t
,
8330 tsubst_flags_t complain
,
8334 #define RECUR(NODE) \
8335 tsubst_copy_and_build (NODE, args, complain, in_decl, /*function_p=*/false)
8339 if (t
== NULL_TREE
|| t
== error_mark_node
)
8342 switch (TREE_CODE (t
))
8347 case IDENTIFIER_NODE
:
8351 tree qualifying_class
;
8352 bool non_integral_constant_expression_p
;
8353 const char *error_msg
;
8355 if (IDENTIFIER_TYPENAME_P (t
))
8357 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
8358 t
= mangle_conv_op_name_for_type (new_type
);
8361 /* Look up the name. */
8362 decl
= lookup_name (t
, 0);
8364 /* By convention, expressions use ERROR_MARK_NODE to indicate
8365 failure, not NULL_TREE. */
8366 if (decl
== NULL_TREE
)
8367 decl
= error_mark_node
;
8369 decl
= finish_id_expression (t
, decl
, NULL_TREE
,
8372 /*integral_constant_expression_p=*/false,
8373 /*allow_non_integral_constant_expression_p=*/false,
8374 &non_integral_constant_expression_p
,
8378 if (!function_p
&& TREE_CODE (decl
) == IDENTIFIER_NODE
)
8379 decl
= unqualified_name_lookup_error (decl
);
8383 case TEMPLATE_ID_EXPR
:
8386 tree
template = RECUR (TREE_OPERAND (t
, 0));
8387 tree targs
= TREE_OPERAND (t
, 1);
8390 targs
= tsubst_template_args (targs
, args
, complain
, in_decl
);
8392 if (TREE_CODE (template) == COMPONENT_REF
)
8394 object
= TREE_OPERAND (template, 0);
8395 template = TREE_OPERAND (template, 1);
8399 template = lookup_template_function (template, targs
);
8402 return build3 (COMPONENT_REF
, TREE_TYPE (template),
8403 object
, template, NULL_TREE
);
8410 tree r
= RECUR (TREE_OPERAND (t
, 0));
8412 if (REFERENCE_REF_P (t
))
8414 /* A type conversion to reference type will be enclosed in
8415 such an indirect ref, but the substitution of the cast
8416 will have also added such an indirect ref. */
8417 if (TREE_CODE (TREE_TYPE (r
)) == REFERENCE_TYPE
)
8418 r
= convert_from_reference (r
);
8421 r
= build_x_indirect_ref (r
, "unary *");
8427 (tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
8428 RECUR (TREE_OPERAND (t
, 0)));
8431 return build_functional_cast
8432 (tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
8433 RECUR (TREE_OPERAND (t
, 0)));
8435 case REINTERPRET_CAST_EXPR
:
8436 return build_reinterpret_cast
8437 (tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
8438 RECUR (TREE_OPERAND (t
, 0)));
8440 case CONST_CAST_EXPR
:
8441 return build_const_cast
8442 (tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
8443 RECUR (TREE_OPERAND (t
, 0)));
8445 case DYNAMIC_CAST_EXPR
:
8446 return build_dynamic_cast
8447 (tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
8448 RECUR (TREE_OPERAND (t
, 0)));
8450 case STATIC_CAST_EXPR
:
8451 return build_static_cast
8452 (tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
8453 RECUR (TREE_OPERAND (t
, 0)));
8455 case POSTDECREMENT_EXPR
:
8456 case POSTINCREMENT_EXPR
:
8457 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
8458 args
, complain
, in_decl
);
8459 return build_x_unary_op (TREE_CODE (t
), op1
);
8461 case PREDECREMENT_EXPR
:
8462 case PREINCREMENT_EXPR
:
8466 case TRUTH_NOT_EXPR
:
8467 case CONVERT_EXPR
: /* Unary + */
8470 return build_x_unary_op (TREE_CODE (t
), RECUR (TREE_OPERAND (t
, 0)));
8473 op1
= TREE_OPERAND (t
, 0);
8474 if (TREE_CODE (op1
) == SCOPE_REF
)
8475 op1
= tsubst_qualified_id (op1
, args
, complain
, in_decl
,
8476 /*done=*/true, /*address_p=*/true);
8478 op1
= tsubst_non_call_postfix_expression (op1
, args
, complain
,
8480 if (TREE_CODE (op1
) == LABEL_DECL
)
8481 return finish_label_address_expr (DECL_NAME (op1
));
8482 return build_x_unary_op (ADDR_EXPR
, op1
);
8487 case TRUNC_DIV_EXPR
:
8489 case FLOOR_DIV_EXPR
:
8490 case ROUND_DIV_EXPR
:
8491 case EXACT_DIV_EXPR
:
8495 case TRUNC_MOD_EXPR
:
8496 case FLOOR_MOD_EXPR
:
8497 case TRUTH_ANDIF_EXPR
:
8498 case TRUTH_ORIF_EXPR
:
8499 case TRUTH_AND_EXPR
:
8515 return build_x_binary_op
8517 RECUR (TREE_OPERAND (t
, 0)),
8518 RECUR (TREE_OPERAND (t
, 1)),
8519 /*overloaded_p=*/NULL
);
8522 return tsubst_qualified_id (t
, args
, complain
, in_decl
, /*done=*/true,
8523 /*address_p=*/false);
8525 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
8526 args
, complain
, in_decl
);
8527 return build_x_binary_op (ARRAY_REF
, op1
, RECUR (TREE_OPERAND (t
, 1)),
8528 /*overloaded_p=*/NULL
);
8532 op1
= TREE_OPERAND (t
, 0);
8535 /* When there are no ARGS, we are trying to evaluate a
8536 non-dependent expression from the parser. Trying to do
8537 the substitutions may not work. */
8539 op1
= TREE_TYPE (op1
);
8548 return cxx_sizeof_or_alignof_type (op1
, TREE_CODE (t
), true);
8550 return cxx_sizeof_or_alignof_expr (op1
, TREE_CODE (t
));
8554 tree r
= build_x_modify_expr
8555 (RECUR (TREE_OPERAND (t
, 0)),
8556 TREE_CODE (TREE_OPERAND (t
, 1)),
8557 RECUR (TREE_OPERAND (t
, 2)));
8558 /* TREE_NO_WARNING must be set if either the expression was
8559 parenthesized or it uses an operator such as >>= rather
8560 than plain assignment. In the former case, it was already
8561 set and must be copied. In the latter case,
8562 build_x_modify_expr sets it and it must not be reset
8564 if (TREE_NO_WARNING (t
))
8565 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
8570 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
8571 args
, complain
, in_decl
);
8572 /* Remember that there was a reference to this entity. */
8575 return build_x_arrow (op1
);
8579 (RECUR (TREE_OPERAND (t
, 0)),
8580 RECUR (TREE_OPERAND (t
, 1)),
8581 RECUR (TREE_OPERAND (t
, 2)),
8582 RECUR (TREE_OPERAND (t
, 3)),
8583 NEW_EXPR_USE_GLOBAL (t
));
8586 return delete_sanity
8587 (RECUR (TREE_OPERAND (t
, 0)),
8588 RECUR (TREE_OPERAND (t
, 1)),
8589 DELETE_EXPR_USE_VEC (t
),
8590 DELETE_EXPR_USE_GLOBAL (t
));
8593 return build_x_compound_expr (RECUR (TREE_OPERAND (t
, 0)),
8594 RECUR (TREE_OPERAND (t
, 1)));
8603 function
= TREE_OPERAND (t
, 0);
8604 /* When we parsed the expression, we determined whether or
8605 not Koenig lookup should be performed. */
8606 koenig_p
= KOENIG_LOOKUP_P (t
);
8607 if (TREE_CODE (function
) == SCOPE_REF
)
8610 function
= tsubst_qualified_id (function
, args
, complain
, in_decl
,
8612 /*address_p=*/false);
8616 qualified_p
= (TREE_CODE (function
) == COMPONENT_REF
8617 && (TREE_CODE (TREE_OPERAND (function
, 1))
8619 function
= tsubst_copy_and_build (function
, args
, complain
,
8622 if (BASELINK_P (function
))
8626 call_args
= RECUR (TREE_OPERAND (t
, 1));
8628 /* We do not perform argument-dependent lookup if normal
8629 lookup finds a non-function, in accordance with the
8630 expected resolution of DR 218. */
8632 && ((is_overloaded_fn (function
)
8633 /* If lookup found a member function, the Koenig lookup is
8634 not appropriate, even if an unqualified-name was used
8635 to denote the function. */
8636 && !DECL_FUNCTION_MEMBER_P (get_first_fn (function
)))
8637 || TREE_CODE (function
) == IDENTIFIER_NODE
))
8638 function
= perform_koenig_lookup (function
, call_args
);
8640 if (TREE_CODE (function
) == IDENTIFIER_NODE
)
8642 unqualified_name_lookup_error (function
);
8643 return error_mark_node
;
8646 /* Remember that there was a reference to this entity. */
8647 if (DECL_P (function
))
8648 mark_used (function
);
8650 if (TREE_CODE (function
) == OFFSET_REF
)
8651 return build_offset_ref_call_from_tree (function
, call_args
);
8652 if (TREE_CODE (function
) == COMPONENT_REF
)
8654 if (!BASELINK_P (TREE_OPERAND (function
, 1)))
8655 return finish_call_expr (function
, call_args
,
8656 /*disallow_virtual=*/false,
8657 /*koenig_p=*/false);
8659 return (build_new_method_call
8660 (TREE_OPERAND (function
, 0),
8661 TREE_OPERAND (function
, 1),
8662 call_args
, NULL_TREE
,
8663 qualified_p
? LOOKUP_NONVIRTUAL
: LOOKUP_NORMAL
));
8665 return finish_call_expr (function
, call_args
,
8666 /*disallow_virtual=*/qualified_p
,
8671 return build_x_conditional_expr
8672 (RECUR (TREE_OPERAND (t
, 0)),
8673 RECUR (TREE_OPERAND (t
, 1)),
8674 RECUR (TREE_OPERAND (t
, 2)));
8676 case PSEUDO_DTOR_EXPR
:
8677 return finish_pseudo_destructor_expr
8678 (RECUR (TREE_OPERAND (t
, 0)),
8679 RECUR (TREE_OPERAND (t
, 1)),
8680 RECUR (TREE_OPERAND (t
, 2)));
8684 tree purpose
, value
, chain
;
8686 if (t
== void_list_node
)
8689 purpose
= TREE_PURPOSE (t
);
8691 purpose
= RECUR (purpose
);
8692 value
= TREE_VALUE (t
);
8694 value
= RECUR (value
);
8695 chain
= TREE_CHAIN (t
);
8696 if (chain
&& chain
!= void_type_node
)
8697 chain
= RECUR (chain
);
8698 if (purpose
== TREE_PURPOSE (t
)
8699 && value
== TREE_VALUE (t
)
8700 && chain
== TREE_CHAIN (t
))
8702 return tree_cons (purpose
, value
, chain
);
8710 object
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
8711 args
, complain
, in_decl
);
8712 /* Remember that there was a reference to this entity. */
8713 if (DECL_P (object
))
8716 member
= TREE_OPERAND (t
, 1);
8717 if (BASELINK_P (member
))
8718 member
= tsubst_baselink (member
,
8719 non_reference (TREE_TYPE (object
)),
8720 args
, complain
, in_decl
);
8722 member
= tsubst_copy (member
, args
, complain
, in_decl
);
8724 if (member
== error_mark_node
)
8725 return error_mark_node
;
8726 else if (!CLASS_TYPE_P (TREE_TYPE (object
)))
8728 if (TREE_CODE (member
) == BIT_NOT_EXPR
)
8729 return finish_pseudo_destructor_expr (object
,
8731 TREE_TYPE (object
));
8732 else if (TREE_CODE (member
) == SCOPE_REF
8733 && (TREE_CODE (TREE_OPERAND (member
, 1)) == BIT_NOT_EXPR
))
8734 return finish_pseudo_destructor_expr (object
,
8736 TREE_TYPE (object
));
8738 else if (TREE_CODE (member
) == SCOPE_REF
8739 && TREE_CODE (TREE_OPERAND (member
, 1)) == TEMPLATE_ID_EXPR
)
8744 /* Lookup the template functions now that we know what the
8746 tmpl
= TREE_OPERAND (TREE_OPERAND (member
, 1), 0);
8747 args
= TREE_OPERAND (TREE_OPERAND (member
, 1), 1);
8748 member
= lookup_qualified_name (TREE_OPERAND (member
, 0), tmpl
,
8749 /*is_type_p=*/false,
8750 /*complain=*/false);
8751 if (BASELINK_P (member
))
8753 BASELINK_FUNCTIONS (member
)
8754 = build_nt (TEMPLATE_ID_EXPR
, BASELINK_FUNCTIONS (member
),
8756 member
= (adjust_result_of_qualified_name_lookup
8757 (member
, BINFO_TYPE (BASELINK_BINFO (member
)),
8758 TREE_TYPE (object
)));
8762 qualified_name_lookup_error (TREE_TYPE (object
), tmpl
,
8764 return error_mark_node
;
8767 else if (TREE_CODE (member
) == SCOPE_REF
8768 && !CLASS_TYPE_P (TREE_OPERAND (member
, 0))
8769 && TREE_CODE (TREE_OPERAND (member
, 0)) != NAMESPACE_DECL
)
8771 if (complain
& tf_error
)
8773 if (TYPE_P (TREE_OPERAND (member
, 0)))
8774 error ("%qT is not a class or namespace",
8775 TREE_OPERAND (member
, 0));
8777 error ("%qD is not a class or namespace",
8778 TREE_OPERAND (member
, 0));
8780 return error_mark_node
;
8782 else if (TREE_CODE (member
) == FIELD_DECL
)
8783 return finish_non_static_data_member (member
, object
, NULL_TREE
);
8785 return finish_class_member_access_expr (object
, member
);
8790 (RECUR (TREE_OPERAND (t
, 0)));
8796 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
8799 /* digest_init will do the wrong thing if we let it. */
8800 if (type
&& TYPE_PTRMEMFUNC_P (type
))
8804 /* We do not want to process the purpose of aggregate
8805 initializers as they are identifier nodes which will be
8806 looked up by digest_init. */
8807 purpose_p
= !(type
&& IS_AGGR_TYPE (type
));
8808 for (elts
= CONSTRUCTOR_ELTS (t
);
8810 elts
= TREE_CHAIN (elts
))
8812 tree purpose
= TREE_PURPOSE (elts
);
8813 tree value
= TREE_VALUE (elts
);
8815 if (purpose
&& purpose_p
)
8816 purpose
= RECUR (purpose
);
8817 value
= RECUR (value
);
8818 r
= tree_cons (purpose
, value
, r
);
8821 r
= build_constructor (NULL_TREE
, nreverse (r
));
8822 TREE_HAS_CONSTRUCTOR (r
) = TREE_HAS_CONSTRUCTOR (t
);
8825 return digest_init (type
, r
, 0);
8831 tree operand_0
= RECUR (TREE_OPERAND (t
, 0));
8832 if (TYPE_P (operand_0
))
8833 return get_typeid (operand_0
);
8834 return build_typeid (operand_0
);
8844 tree r
= tsubst_copy (t
, args
, complain
, in_decl
);
8846 if (TREE_CODE (TREE_TYPE (t
)) != REFERENCE_TYPE
)
8847 /* If the original type was a reference, we'll be wrapped in
8848 the appropriate INDIRECT_REF. */
8849 r
= convert_from_reference (r
);
8854 return build_x_va_arg (RECUR (TREE_OPERAND (t
, 0)),
8855 tsubst_copy (TREE_TYPE (t
), args
, complain
,
8859 return fold_offsetof (RECUR (TREE_OPERAND (t
, 0)));
8863 tree old_stmt_expr
= cur_stmt_expr
;
8864 tree stmt_expr
= begin_stmt_expr ();
8866 cur_stmt_expr
= stmt_expr
;
8867 tsubst_expr (STMT_EXPR_STMT (t
), args
, complain
, in_decl
);
8868 stmt_expr
= finish_stmt_expr (stmt_expr
, false);
8869 cur_stmt_expr
= old_stmt_expr
;
8875 t
= tsubst_copy (t
, args
, complain
, in_decl
);
8876 /* As in finish_id_expression, we resolve enumeration constants
8877 to their underlying values. */
8878 if (TREE_CODE (t
) == CONST_DECL
)
8879 return DECL_INITIAL (t
);
8883 return tsubst_copy (t
, args
, complain
, in_decl
);
8889 /* Verify that the instantiated ARGS are valid. For type arguments,
8890 make sure that the type's linkage is ok. For non-type arguments,
8891 make sure they are constants if they are integral or enumerations.
8892 Emit an error under control of COMPLAIN, and return TRUE on error. */
8895 check_instantiated_args (tree tmpl
, tree args
, tsubst_flags_t complain
)
8897 int ix
, len
= DECL_NTPARMS (tmpl
);
8898 bool result
= false;
8899 bool error_p
= complain
& tf_error
;
8901 for (ix
= 0; ix
!= len
; ix
++)
8903 tree t
= TREE_VEC_ELT (args
, ix
);
8907 /* [basic.link]: A name with no linkage (notably, the name
8908 of a class or enumeration declared in a local scope)
8909 shall not be used to declare an entity with linkage.
8910 This implies that names with no linkage cannot be used as
8911 template arguments. */
8912 tree nt
= no_linkage_check (t
, /*relaxed_p=*/false);
8916 if (TYPE_ANONYMOUS_P (nt
))
8917 error ("%qT is/uses anonymous type", t
);
8919 error ("%qT uses local type %qT", t
, nt
);
8923 /* In order to avoid all sorts of complications, we do not
8924 allow variably-modified types as template arguments. */
8925 else if (variably_modified_type_p (t
, NULL_TREE
))
8927 if (complain
& tf_error
)
8928 error ("%qT is a variably modified type", t
);
8932 /* A non-type argument of integral or enumerated type must be a
8934 else if (TREE_TYPE (t
)
8935 && INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (t
))
8936 && !TREE_CONSTANT (t
))
8938 if (complain
& tf_error
)
8939 error ("integral expression %qE is not constant", t
);
8943 if (result
&& error_p
)
8944 error (" trying to instantiate %qD", tmpl
);
8948 /* Instantiate the indicated variable or function template TMPL with
8949 the template arguments in TARG_PTR. */
8952 instantiate_template (tree tmpl
, tree targ_ptr
, tsubst_flags_t complain
)
8958 if (tmpl
== error_mark_node
)
8959 return error_mark_node
;
8961 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
);
8963 /* If this function is a clone, handle it specially. */
8964 if (DECL_CLONED_FUNCTION_P (tmpl
))
8969 spec
= instantiate_template (DECL_CLONED_FUNCTION (tmpl
), targ_ptr
,
8971 if (spec
== error_mark_node
)
8972 return error_mark_node
;
8974 /* Look for the clone. */
8975 FOR_EACH_CLONE (clone
, spec
)
8976 if (DECL_NAME (clone
) == DECL_NAME (tmpl
))
8978 /* We should always have found the clone by now. */
8983 /* Check to see if we already have this specialization. */
8984 spec
= retrieve_specialization (tmpl
, targ_ptr
,
8985 /*class_specializations_p=*/false);
8986 if (spec
!= NULL_TREE
)
8989 gen_tmpl
= most_general_template (tmpl
);
8990 if (tmpl
!= gen_tmpl
)
8992 /* The TMPL is a partial instantiation. To get a full set of
8993 arguments we must add the arguments used to perform the
8994 partial instantiation. */
8995 targ_ptr
= add_outermost_template_args (DECL_TI_ARGS (tmpl
),
8998 /* Check to see if we already have this specialization. */
8999 spec
= retrieve_specialization (gen_tmpl
, targ_ptr
,
9000 /*class_specializations_p=*/false);
9001 if (spec
!= NULL_TREE
)
9005 if (check_instantiated_args (gen_tmpl
, INNERMOST_TEMPLATE_ARGS (targ_ptr
),
9007 return error_mark_node
;
9009 /* We are building a FUNCTION_DECL, during which the access of its
9010 parameters and return types have to be checked. However this
9011 FUNCTION_DECL which is the desired context for access checking
9012 is not built yet. We solve this chicken-and-egg problem by
9013 deferring all checks until we have the FUNCTION_DECL. */
9014 push_deferring_access_checks (dk_deferred
);
9016 /* Substitute template parameters. */
9017 fndecl
= tsubst (DECL_TEMPLATE_RESULT (gen_tmpl
),
9018 targ_ptr
, complain
, gen_tmpl
);
9020 /* Now we know the specialization, compute access previously
9022 push_access_scope (fndecl
);
9023 perform_deferred_access_checks ();
9024 pop_access_scope (fndecl
);
9025 pop_deferring_access_checks ();
9027 /* The DECL_TI_TEMPLATE should always be the immediate parent
9028 template, not the most general template. */
9029 DECL_TI_TEMPLATE (fndecl
) = tmpl
;
9031 /* If we've just instantiated the main entry point for a function,
9032 instantiate all the alternate entry points as well. We do this
9033 by cloning the instantiation of the main entry point, not by
9034 instantiating the template clones. */
9035 if (TREE_CHAIN (gen_tmpl
) && DECL_CLONED_FUNCTION_P (TREE_CHAIN (gen_tmpl
)))
9036 clone_function_decl (fndecl
, /*update_method_vec_p=*/0);
9041 /* The FN is a TEMPLATE_DECL for a function. The ARGS are the
9042 arguments that are being used when calling it. TARGS is a vector
9043 into which the deduced template arguments are placed.
9045 Return zero for success, 2 for an incomplete match that doesn't resolve
9046 all the types, and 1 for complete failure. An error message will be
9047 printed only for an incomplete match.
9049 If FN is a conversion operator, or we are trying to produce a specific
9050 specialization, RETURN_TYPE is the return type desired.
9052 The EXPLICIT_TARGS are explicit template arguments provided via a
9055 The parameter STRICT is one of:
9058 We are deducing arguments for a function call, as in
9062 We are deducing arguments for a conversion function, as in
9066 We are deducing arguments when doing an explicit instantiation
9067 as in [temp.explicit], when determining an explicit specialization
9068 as in [temp.expl.spec], or when taking the address of a function
9069 template, as in [temp.deduct.funcaddr]. */
9072 fn_type_unification (tree fn
,
9073 tree explicit_targs
,
9077 unification_kind_t strict
)
9083 gcc_assert (TREE_CODE (fn
) == TEMPLATE_DECL
);
9085 fntype
= TREE_TYPE (fn
);
9090 The specified template arguments must match the template
9091 parameters in kind (i.e., type, nontype, template), and there
9092 must not be more arguments than there are parameters;
9093 otherwise type deduction fails.
9095 Nontype arguments must match the types of the corresponding
9096 nontype template parameters, or must be convertible to the
9097 types of the corresponding nontype parameters as specified in
9098 _temp.arg.nontype_, otherwise type deduction fails.
9100 All references in the function type of the function template
9101 to the corresponding template parameters are replaced by the
9102 specified template argument values. If a substitution in a
9103 template parameter or in the function type of the function
9104 template results in an invalid type, type deduction fails. */
9106 tree converted_args
;
9109 if (explicit_targs
== error_mark_node
)
9113 = (coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
9114 explicit_targs
, NULL_TREE
, tf_none
,
9115 /*require_all_arguments=*/0));
9116 if (converted_args
== error_mark_node
)
9119 /* Substitute the explicit args into the function type. This is
9120 necessary so that, for instance, explicitly declared function
9121 arguments can match null pointed constants. If we were given
9122 an incomplete set of explicit args, we must not do semantic
9123 processing during substitution as we could create partial
9125 incomplete
= NUM_TMPL_ARGS (explicit_targs
) != NUM_TMPL_ARGS (targs
);
9126 processing_template_decl
+= incomplete
;
9127 fntype
= tsubst (fntype
, converted_args
, tf_none
, NULL_TREE
);
9128 processing_template_decl
-= incomplete
;
9130 if (fntype
== error_mark_node
)
9133 /* Place the explicitly specified arguments in TARGS. */
9134 for (i
= NUM_TMPL_ARGS (converted_args
); i
--;)
9135 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (converted_args
, i
);
9138 parms
= TYPE_ARG_TYPES (fntype
);
9139 /* Never do unification on the 'this' parameter. */
9140 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
))
9141 parms
= TREE_CHAIN (parms
);
9145 /* We've been given a return type to match, prepend it. */
9146 parms
= tree_cons (NULL_TREE
, TREE_TYPE (fntype
), parms
);
9147 args
= tree_cons (NULL_TREE
, return_type
, args
);
9150 /* We allow incomplete unification without an error message here
9151 because the standard doesn't seem to explicitly prohibit it. Our
9152 callers must be ready to deal with unification failures in any
9154 result
= type_unification_real (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
9155 targs
, parms
, args
, /*subr=*/0,
9156 strict
, /*allow_incomplete*/1);
9159 /* All is well so far. Now, check:
9163 When all template arguments have been deduced, all uses of
9164 template parameters in nondeduced contexts are replaced with
9165 the corresponding deduced argument values. If the
9166 substitution results in an invalid type, as described above,
9167 type deduction fails. */
9168 if (tsubst (TREE_TYPE (fn
), targs
, tf_none
, NULL_TREE
)
9175 /* Adjust types before performing type deduction, as described in
9176 [temp.deduct.call] and [temp.deduct.conv]. The rules in these two
9177 sections are symmetric. PARM is the type of a function parameter
9178 or the return type of the conversion function. ARG is the type of
9179 the argument passed to the call, or the type of the value
9180 initialized with the result of the conversion function. */
9183 maybe_adjust_types_for_deduction (unification_kind_t strict
,
9196 /* Swap PARM and ARG throughout the remainder of this
9197 function; the handling is precisely symmetric since PARM
9198 will initialize ARG rather than vice versa. */
9206 /* There is nothing to do in this case. */
9213 if (TREE_CODE (*parm
) != REFERENCE_TYPE
)
9215 /* [temp.deduct.call]
9217 If P is not a reference type:
9219 --If A is an array type, the pointer type produced by the
9220 array-to-pointer standard conversion (_conv.array_) is
9221 used in place of A for type deduction; otherwise,
9223 --If A is a function type, the pointer type produced by
9224 the function-to-pointer standard conversion
9225 (_conv.func_) is used in place of A for type deduction;
9228 --If A is a cv-qualified type, the top level
9229 cv-qualifiers of A's type are ignored for type
9231 if (TREE_CODE (*arg
) == ARRAY_TYPE
)
9232 *arg
= build_pointer_type (TREE_TYPE (*arg
));
9233 else if (TREE_CODE (*arg
) == FUNCTION_TYPE
)
9234 *arg
= build_pointer_type (*arg
);
9236 *arg
= TYPE_MAIN_VARIANT (*arg
);
9239 /* [temp.deduct.call]
9241 If P is a cv-qualified type, the top level cv-qualifiers
9242 of P's type are ignored for type deduction. If P is a
9243 reference type, the type referred to by P is used for
9245 *parm
= TYPE_MAIN_VARIANT (*parm
);
9246 if (TREE_CODE (*parm
) == REFERENCE_TYPE
)
9248 *parm
= TREE_TYPE (*parm
);
9249 result
|= UNIFY_ALLOW_OUTER_MORE_CV_QUAL
;
9252 /* DR 322. For conversion deduction, remove a reference type on parm
9253 too (which has been swapped into ARG). */
9254 if (strict
== DEDUCE_CONV
&& TREE_CODE (*arg
) == REFERENCE_TYPE
)
9255 *arg
= TREE_TYPE (*arg
);
9260 /* Most parms like fn_type_unification.
9262 If SUBR is 1, we're being called recursively (to unify the
9263 arguments of a function or method parameter of a function
9267 type_unification_real (tree tparms
,
9272 unification_kind_t strict
,
9273 int allow_incomplete
)
9277 int ntparms
= TREE_VEC_LENGTH (tparms
);
9279 int saw_undeduced
= 0;
9282 gcc_assert (TREE_CODE (tparms
) == TREE_VEC
);
9283 gcc_assert (xparms
== NULL_TREE
|| TREE_CODE (xparms
) == TREE_LIST
);
9284 gcc_assert (!xargs
|| TREE_CODE (xargs
) == TREE_LIST
);
9285 gcc_assert (ntparms
> 0);
9290 sub_strict
= (UNIFY_ALLOW_OUTER_LEVEL
| UNIFY_ALLOW_MORE_CV_QUAL
9291 | UNIFY_ALLOW_DERIVED
);
9295 sub_strict
= UNIFY_ALLOW_LESS_CV_QUAL
;
9299 sub_strict
= UNIFY_ALLOW_NONE
;
9310 while (parms
&& parms
!= void_list_node
9311 && args
&& args
!= void_list_node
)
9313 parm
= TREE_VALUE (parms
);
9314 parms
= TREE_CHAIN (parms
);
9315 arg
= TREE_VALUE (args
);
9316 args
= TREE_CHAIN (args
);
9318 if (arg
== error_mark_node
)
9320 if (arg
== unknown_type_node
)
9321 /* We can't deduce anything from this, but we might get all the
9322 template args from other function args. */
9325 /* Conversions will be performed on a function argument that
9326 corresponds with a function parameter that contains only
9327 non-deducible template parameters and explicitly specified
9328 template parameters. */
9329 if (!uses_template_parms (parm
))
9334 type
= TREE_TYPE (arg
);
9338 if (strict
== DEDUCE_EXACT
)
9340 if (same_type_p (parm
, type
))
9344 /* It might work; we shouldn't check now, because we might
9345 get into infinite recursion. Overload resolution will
9354 gcc_assert (TREE_TYPE (arg
) != NULL_TREE
);
9355 if (type_unknown_p (arg
))
9357 /* [temp.deduct.type] A template-argument can be deduced from
9358 a pointer to function or pointer to member function
9359 argument if the set of overloaded functions does not
9360 contain function templates and at most one of a set of
9361 overloaded functions provides a unique match. */
9363 if (resolve_overloaded_unification
9364 (tparms
, targs
, parm
, arg
, strict
, sub_strict
)
9369 arg
= TREE_TYPE (arg
);
9370 if (arg
== error_mark_node
)
9375 int arg_strict
= sub_strict
;
9378 arg_strict
|= maybe_adjust_types_for_deduction (strict
, &parm
, &arg
);
9380 if (unify (tparms
, targs
, parm
, arg
, arg_strict
))
9385 /* Fail if we've reached the end of the parm list, and more args
9386 are present, and the parm list isn't variadic. */
9387 if (args
&& args
!= void_list_node
&& parms
== void_list_node
)
9389 /* Fail if parms are left and they don't have default values. */
9390 if (parms
&& parms
!= void_list_node
9391 && TREE_PURPOSE (parms
) == NULL_TREE
)
9395 for (i
= 0; i
< ntparms
; i
++)
9396 if (!TREE_VEC_ELT (targs
, i
))
9398 tree tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, i
));
9400 /* If this is an undeduced nontype parameter that depends on
9401 a type parameter, try another pass; its type may have been
9402 deduced from a later argument than the one from which
9403 this parameter can be deduced. */
9404 if (TREE_CODE (tparm
) == PARM_DECL
9405 && uses_template_parms (TREE_TYPE (tparm
))
9406 && !saw_undeduced
++)
9409 if (!allow_incomplete
)
9410 error ("incomplete type unification");
9417 /* Subroutine of type_unification_real. Args are like the variables at the
9418 call site. ARG is an overloaded function (or template-id); we try
9419 deducing template args from each of the overloads, and if only one
9420 succeeds, we go with that. Modifies TARGS and returns 0 on success. */
9423 resolve_overloaded_unification (tree tparms
,
9427 unification_kind_t strict
,
9430 tree tempargs
= copy_node (targs
);
9434 if (TREE_CODE (arg
) == ADDR_EXPR
)
9436 arg
= TREE_OPERAND (arg
, 0);
9442 if (TREE_CODE (arg
) == COMPONENT_REF
)
9443 /* Handle `&x' where `x' is some static or non-static member
9445 arg
= TREE_OPERAND (arg
, 1);
9447 if (TREE_CODE (arg
) == OFFSET_REF
)
9448 arg
= TREE_OPERAND (arg
, 1);
9450 /* Strip baselink information. */
9451 if (BASELINK_P (arg
))
9452 arg
= BASELINK_FUNCTIONS (arg
);
9454 if (TREE_CODE (arg
) == TEMPLATE_ID_EXPR
)
9456 /* If we got some explicit template args, we need to plug them into
9457 the affected templates before we try to unify, in case the
9458 explicit args will completely resolve the templates in question. */
9460 tree expl_subargs
= TREE_OPERAND (arg
, 1);
9461 arg
= TREE_OPERAND (arg
, 0);
9463 for (; arg
; arg
= OVL_NEXT (arg
))
9465 tree fn
= OVL_CURRENT (arg
);
9468 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
9471 subargs
= get_bindings (fn
, DECL_TEMPLATE_RESULT (fn
),
9472 expl_subargs
, /*check_ret=*/false);
9475 elem
= tsubst (TREE_TYPE (fn
), subargs
, tf_none
, NULL_TREE
);
9476 good
+= try_one_overload (tparms
, targs
, tempargs
, parm
,
9477 elem
, strict
, sub_strict
, addr_p
);
9483 gcc_assert (TREE_CODE (arg
) == OVERLOAD
9484 || TREE_CODE (arg
) == FUNCTION_DECL
);
9486 for (; arg
; arg
= OVL_NEXT (arg
))
9487 good
+= try_one_overload (tparms
, targs
, tempargs
, parm
,
9488 TREE_TYPE (OVL_CURRENT (arg
)),
9489 strict
, sub_strict
, addr_p
);
9492 /* [temp.deduct.type] A template-argument can be deduced from a pointer
9493 to function or pointer to member function argument if the set of
9494 overloaded functions does not contain function templates and at most
9495 one of a set of overloaded functions provides a unique match.
9497 So if we found multiple possibilities, we return success but don't
9502 int i
= TREE_VEC_LENGTH (targs
);
9504 if (TREE_VEC_ELT (tempargs
, i
))
9505 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (tempargs
, i
);
9513 /* Subroutine of resolve_overloaded_unification; does deduction for a single
9514 overload. Fills TARGS with any deduced arguments, or error_mark_node if
9515 different overloads deduce different arguments for a given parm.
9516 ADDR_P is true if the expression for which deduction is being
9517 performed was of the form "& fn" rather than simply "fn".
9519 Returns 1 on success. */
9522 try_one_overload (tree tparms
,
9527 unification_kind_t strict
,
9535 /* [temp.deduct.type] A template-argument can be deduced from a pointer
9536 to function or pointer to member function argument if the set of
9537 overloaded functions does not contain function templates and at most
9538 one of a set of overloaded functions provides a unique match.
9540 So if this is a template, just return success. */
9542 if (uses_template_parms (arg
))
9545 if (TREE_CODE (arg
) == METHOD_TYPE
)
9546 arg
= build_ptrmemfunc_type (build_pointer_type (arg
));
9548 arg
= build_pointer_type (arg
);
9550 sub_strict
|= maybe_adjust_types_for_deduction (strict
, &parm
, &arg
);
9552 /* We don't copy orig_targs for this because if we have already deduced
9553 some template args from previous args, unify would complain when we
9554 try to deduce a template parameter for the same argument, even though
9555 there isn't really a conflict. */
9556 nargs
= TREE_VEC_LENGTH (targs
);
9557 tempargs
= make_tree_vec (nargs
);
9559 if (unify (tparms
, tempargs
, parm
, arg
, sub_strict
) != 0)
9562 /* First make sure we didn't deduce anything that conflicts with
9563 explicitly specified args. */
9564 for (i
= nargs
; i
--; )
9566 tree elt
= TREE_VEC_ELT (tempargs
, i
);
9567 tree oldelt
= TREE_VEC_ELT (orig_targs
, i
);
9571 else if (uses_template_parms (elt
))
9572 /* Since we're unifying against ourselves, we will fill in
9573 template args used in the function parm list with our own
9574 template parms. Discard them. */
9575 TREE_VEC_ELT (tempargs
, i
) = NULL_TREE
;
9576 else if (oldelt
&& !template_args_equal (oldelt
, elt
))
9580 for (i
= nargs
; i
--; )
9582 tree elt
= TREE_VEC_ELT (tempargs
, i
);
9585 TREE_VEC_ELT (targs
, i
) = elt
;
9591 /* Verify that nondeduce template argument agrees with the type
9592 obtained from argument deduction. Return nonzero if the
9597 struct A { typedef int X; };
9598 template <class T, class U> struct C {};
9599 template <class T> struct C<T, typename T::X> {};
9601 Then with the instantiation `C<A, int>', we can deduce that
9602 `T' is `A' but unify () does not check whether `typename T::X'
9603 is `int'. This function ensure that they agree.
9605 TARGS, PARMS are the same as the arguments of unify.
9606 ARGS contains template arguments from all levels. */
9609 verify_class_unification (tree targs
, tree parms
, tree args
)
9611 parms
= tsubst (parms
, add_outermost_template_args (args
, targs
),
9612 tf_none
, NULL_TREE
);
9613 if (parms
== error_mark_node
)
9616 return !comp_template_args (parms
, INNERMOST_TEMPLATE_ARGS (args
));
9619 /* PARM is a template class (perhaps with unbound template
9620 parameters). ARG is a fully instantiated type. If ARG can be
9621 bound to PARM, return ARG, otherwise return NULL_TREE. TPARMS and
9622 TARGS are as for unify. */
9625 try_class_unification (tree tparms
, tree targs
, tree parm
, tree arg
)
9629 if (!CLASSTYPE_TEMPLATE_INFO (arg
)
9630 || (most_general_template (CLASSTYPE_TI_TEMPLATE (arg
))
9631 != most_general_template (CLASSTYPE_TI_TEMPLATE (parm
))))
9634 /* We need to make a new template argument vector for the call to
9635 unify. If we used TARGS, we'd clutter it up with the result of
9636 the attempted unification, even if this class didn't work out.
9637 We also don't want to commit ourselves to all the unifications
9638 we've already done, since unification is supposed to be done on
9639 an argument-by-argument basis. In other words, consider the
9640 following pathological case:
9642 template <int I, int J, int K>
9645 template <int I, int J>
9646 struct S<I, J, 2> : public S<I, I, I>, S<J, J, J> {};
9648 template <int I, int J, int K>
9649 void f(S<I, J, K>, S<I, I, I>);
9658 Now, by the time we consider the unification involving `s2', we
9659 already know that we must have `f<0, 0, 0>'. But, even though
9660 `S<0, 1, 2>' is derived from `S<0, 0, 0>', the code is invalid
9661 because there are two ways to unify base classes of S<0, 1, 2>
9662 with S<I, I, I>. If we kept the already deduced knowledge, we
9663 would reject the possibility I=1. */
9664 copy_of_targs
= make_tree_vec (TREE_VEC_LENGTH (targs
));
9666 /* If unification failed, we're done. */
9667 if (unify (tparms
, copy_of_targs
, CLASSTYPE_TI_ARGS (parm
),
9668 CLASSTYPE_TI_ARGS (arg
), UNIFY_ALLOW_NONE
))
9674 /* Given a template type PARM and a class type ARG, find the unique
9675 base type in ARG that is an instance of PARM. We do not examine
9676 ARG itself; only its base-classes. If there is not exactly one
9677 appropriate base class, return NULL_TREE. PARM may be the type of
9678 a partial specialization, as well as a plain template type. Used
9682 get_template_base (tree tparms
, tree targs
, tree parm
, tree arg
)
9684 tree rval
= NULL_TREE
;
9687 gcc_assert (IS_AGGR_TYPE_CODE (TREE_CODE (arg
)));
9689 binfo
= TYPE_BINFO (complete_type (arg
));
9691 /* The type could not be completed. */
9694 /* Walk in inheritance graph order. The search order is not
9695 important, and this avoids multiple walks of virtual bases. */
9696 for (binfo
= TREE_CHAIN (binfo
); binfo
; binfo
= TREE_CHAIN (binfo
))
9698 tree r
= try_class_unification (tparms
, targs
, parm
, BINFO_TYPE (binfo
));
9702 /* If there is more than one satisfactory baseclass, then:
9706 If they yield more than one possible deduced A, the type
9710 if (rval
&& !same_type_p (r
, rval
))
9720 /* Returns the level of DECL, which declares a template parameter. */
9723 template_decl_level (tree decl
)
9725 switch (TREE_CODE (decl
))
9729 return TEMPLATE_TYPE_LEVEL (TREE_TYPE (decl
));
9732 return TEMPLATE_PARM_LEVEL (DECL_INITIAL (decl
));
9740 /* Decide whether ARG can be unified with PARM, considering only the
9741 cv-qualifiers of each type, given STRICT as documented for unify.
9742 Returns nonzero iff the unification is OK on that basis. */
9745 check_cv_quals_for_unify (int strict
, tree arg
, tree parm
)
9747 int arg_quals
= cp_type_quals (arg
);
9748 int parm_quals
= cp_type_quals (parm
);
9750 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
9751 && !(strict
& UNIFY_ALLOW_OUTER_MORE_CV_QUAL
))
9753 /* Although a CVR qualifier is ignored when being applied to a
9754 substituted template parameter ([8.3.2]/1 for example), that
9755 does not apply during deduction [14.8.2.4]/1, (even though
9756 that is not explicitly mentioned, [14.8.2.4]/9 indicates
9757 this). Except when we're allowing additional CV qualifiers
9758 at the outer level [14.8.2.1]/3,1st bullet. */
9759 if ((TREE_CODE (arg
) == REFERENCE_TYPE
9760 || TREE_CODE (arg
) == FUNCTION_TYPE
9761 || TREE_CODE (arg
) == METHOD_TYPE
)
9762 && (parm_quals
& (TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
)))
9765 if ((!POINTER_TYPE_P (arg
) && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
)
9766 && (parm_quals
& TYPE_QUAL_RESTRICT
))
9770 if (!(strict
& (UNIFY_ALLOW_MORE_CV_QUAL
| UNIFY_ALLOW_OUTER_MORE_CV_QUAL
))
9771 && (arg_quals
& parm_quals
) != parm_quals
)
9774 if (!(strict
& (UNIFY_ALLOW_LESS_CV_QUAL
| UNIFY_ALLOW_OUTER_LESS_CV_QUAL
))
9775 && (parm_quals
& arg_quals
) != arg_quals
)
9781 /* Takes parameters as for type_unification. Returns 0 if the
9782 type deduction succeeds, 1 otherwise. The parameter STRICT is a
9783 bitwise or of the following flags:
9786 Require an exact match between PARM and ARG.
9787 UNIFY_ALLOW_MORE_CV_QUAL:
9788 Allow the deduced ARG to be more cv-qualified (by qualification
9789 conversion) than ARG.
9790 UNIFY_ALLOW_LESS_CV_QUAL:
9791 Allow the deduced ARG to be less cv-qualified than ARG.
9792 UNIFY_ALLOW_DERIVED:
9793 Allow the deduced ARG to be a template base class of ARG,
9794 or a pointer to a template base class of the type pointed to by
9796 UNIFY_ALLOW_INTEGER:
9797 Allow any integral type to be deduced. See the TEMPLATE_PARM_INDEX
9798 case for more information.
9799 UNIFY_ALLOW_OUTER_LEVEL:
9800 This is the outermost level of a deduction. Used to determine validity
9801 of qualification conversions. A valid qualification conversion must
9802 have const qualified pointers leading up to the inner type which
9803 requires additional CV quals, except at the outer level, where const
9804 is not required [conv.qual]. It would be normal to set this flag in
9805 addition to setting UNIFY_ALLOW_MORE_CV_QUAL.
9806 UNIFY_ALLOW_OUTER_MORE_CV_QUAL:
9807 This is the outermost level of a deduction, and PARM can be more CV
9808 qualified at this point.
9809 UNIFY_ALLOW_OUTER_LESS_CV_QUAL:
9810 This is the outermost level of a deduction, and PARM can be less CV
9811 qualified at this point. */
9814 unify (tree tparms
, tree targs
, tree parm
, tree arg
, int strict
)
9819 int strict_in
= strict
;
9821 /* I don't think this will do the right thing with respect to types.
9822 But the only case I've seen it in so far has been array bounds, where
9823 signedness is the only information lost, and I think that will be
9825 while (TREE_CODE (parm
) == NOP_EXPR
)
9826 parm
= TREE_OPERAND (parm
, 0);
9828 if (arg
== error_mark_node
)
9830 if (arg
== unknown_type_node
)
9831 /* We can't deduce anything from this, but we might get all the
9832 template args from other function args. */
9835 /* If PARM uses template parameters, then we can't bail out here,
9836 even if ARG == PARM, since we won't record unifications for the
9837 template parameters. We might need them if we're trying to
9838 figure out which of two things is more specialized. */
9839 if (arg
== parm
&& !uses_template_parms (parm
))
9842 /* Immediately reject some pairs that won't unify because of
9843 cv-qualification mismatches. */
9844 if (TREE_CODE (arg
) == TREE_CODE (parm
)
9846 /* It is the elements of the array which hold the cv quals of an array
9847 type, and the elements might be template type parms. We'll check
9849 && TREE_CODE (arg
) != ARRAY_TYPE
9850 /* We check the cv-qualifiers when unifying with template type
9851 parameters below. We want to allow ARG `const T' to unify with
9852 PARM `T' for example, when computing which of two templates
9853 is more specialized, for example. */
9854 && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
9855 && !check_cv_quals_for_unify (strict_in
, arg
, parm
))
9858 if (!(strict
& UNIFY_ALLOW_OUTER_LEVEL
)
9859 && TYPE_P (parm
) && !CP_TYPE_CONST_P (parm
))
9860 strict
&= ~UNIFY_ALLOW_MORE_CV_QUAL
;
9861 strict
&= ~UNIFY_ALLOW_OUTER_LEVEL
;
9862 strict
&= ~UNIFY_ALLOW_DERIVED
;
9863 strict
&= ~UNIFY_ALLOW_OUTER_MORE_CV_QUAL
;
9864 strict
&= ~UNIFY_ALLOW_OUTER_LESS_CV_QUAL
;
9866 switch (TREE_CODE (parm
))
9870 case UNBOUND_CLASS_TEMPLATE
:
9871 /* In a type which contains a nested-name-specifier, template
9872 argument values cannot be deduced for template parameters used
9873 within the nested-name-specifier. */
9876 case TEMPLATE_TYPE_PARM
:
9877 case TEMPLATE_TEMPLATE_PARM
:
9878 case BOUND_TEMPLATE_TEMPLATE_PARM
:
9879 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
9881 if (TEMPLATE_TYPE_LEVEL (parm
)
9882 != template_decl_level (tparm
))
9883 /* The PARM is not one we're trying to unify. Just check
9884 to see if it matches ARG. */
9885 return (TREE_CODE (arg
) == TREE_CODE (parm
)
9886 && same_type_p (parm
, arg
)) ? 0 : 1;
9887 idx
= TEMPLATE_TYPE_IDX (parm
);
9888 targ
= TREE_VEC_ELT (targs
, idx
);
9889 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, idx
));
9891 /* Check for mixed types and values. */
9892 if ((TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
9893 && TREE_CODE (tparm
) != TYPE_DECL
)
9894 || (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
9895 && TREE_CODE (tparm
) != TEMPLATE_DECL
))
9898 if (TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
9900 /* ARG must be constructed from a template class or a template
9901 template parameter. */
9902 if (TREE_CODE (arg
) != BOUND_TEMPLATE_TEMPLATE_PARM
9903 && (TREE_CODE (arg
) != RECORD_TYPE
|| !CLASSTYPE_TEMPLATE_INFO (arg
)))
9907 tree parmtmpl
= TYPE_TI_TEMPLATE (parm
);
9908 tree parmvec
= TYPE_TI_ARGS (parm
);
9909 tree argvec
= INNERMOST_TEMPLATE_ARGS (TYPE_TI_ARGS (arg
));
9911 = DECL_INNERMOST_TEMPLATE_PARMS (TYPE_TI_TEMPLATE (arg
));
9914 /* The parameter and argument roles have to be switched here
9915 in order to handle default arguments properly. For example,
9916 template<template <class> class TT> void f(TT<int>)
9917 should be able to accept vector<int> which comes from
9918 template <class T, class Allocator = allocator>
9921 if (coerce_template_parms (argtmplvec
, parmvec
, parmtmpl
, 0, 1)
9925 /* Deduce arguments T, i from TT<T> or TT<i>.
9926 We check each element of PARMVEC and ARGVEC individually
9927 rather than the whole TREE_VEC since they can have
9928 different number of elements. */
9930 for (i
= 0; i
< TREE_VEC_LENGTH (parmvec
); ++i
)
9932 if (unify (tparms
, targs
,
9933 TREE_VEC_ELT (parmvec
, i
),
9934 TREE_VEC_ELT (argvec
, i
),
9939 arg
= TYPE_TI_TEMPLATE (arg
);
9941 /* Fall through to deduce template name. */
9944 if (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
9945 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
9947 /* Deduce template name TT from TT, TT<>, TT<T> and TT<i>. */
9949 /* Simple cases: Value already set, does match or doesn't. */
9950 if (targ
!= NULL_TREE
&& template_args_equal (targ
, arg
))
9957 /* If PARM is `const T' and ARG is only `int', we don't have
9958 a match unless we are allowing additional qualification.
9959 If ARG is `const int' and PARM is just `T' that's OK;
9960 that binds `const int' to `T'. */
9961 if (!check_cv_quals_for_unify (strict_in
| UNIFY_ALLOW_LESS_CV_QUAL
,
9965 /* Consider the case where ARG is `const volatile int' and
9966 PARM is `const T'. Then, T should be `volatile int'. */
9967 arg
= cp_build_qualified_type_real
9968 (arg
, cp_type_quals (arg
) & ~cp_type_quals (parm
), tf_none
);
9969 if (arg
== error_mark_node
)
9972 /* Simple cases: Value already set, does match or doesn't. */
9973 if (targ
!= NULL_TREE
&& same_type_p (targ
, arg
))
9978 /* Make sure that ARG is not a variable-sized array. (Note
9979 that were talking about variable-sized arrays (like
9980 `int[n]'), rather than arrays of unknown size (like
9981 `int[]').) We'll get very confused by such a type since
9982 the bound of the array will not be computable in an
9983 instantiation. Besides, such types are not allowed in
9984 ISO C++, so we can do as we please here. */
9985 if (variably_modified_type_p (arg
, NULL_TREE
))
9989 TREE_VEC_ELT (targs
, idx
) = arg
;
9992 case TEMPLATE_PARM_INDEX
:
9993 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
9995 if (TEMPLATE_PARM_LEVEL (parm
)
9996 != template_decl_level (tparm
))
9997 /* The PARM is not one we're trying to unify. Just check
9998 to see if it matches ARG. */
9999 return !(TREE_CODE (arg
) == TREE_CODE (parm
)
10000 && cp_tree_equal (parm
, arg
));
10002 idx
= TEMPLATE_PARM_IDX (parm
);
10003 targ
= TREE_VEC_ELT (targs
, idx
);
10006 return !cp_tree_equal (targ
, arg
);
10008 /* [temp.deduct.type] If, in the declaration of a function template
10009 with a non-type template-parameter, the non-type
10010 template-parameter is used in an expression in the function
10011 parameter-list and, if the corresponding template-argument is
10012 deduced, the template-argument type shall match the type of the
10013 template-parameter exactly, except that a template-argument
10014 deduced from an array bound may be of any integral type.
10015 The non-type parameter might use already deduced type parameters. */
10016 tparm
= tsubst (TREE_TYPE (parm
), targs
, 0, NULL_TREE
);
10017 if (!TREE_TYPE (arg
))
10018 /* Template-parameter dependent expression. Just accept it for now.
10019 It will later be processed in convert_template_argument. */
10021 else if (same_type_p (TREE_TYPE (arg
), tparm
))
10023 else if ((strict
& UNIFY_ALLOW_INTEGER
)
10024 && (TREE_CODE (tparm
) == INTEGER_TYPE
10025 || TREE_CODE (tparm
) == BOOLEAN_TYPE
))
10026 /* Convert the ARG to the type of PARM; the deduced non-type
10027 template argument must exactly match the types of the
10028 corresponding parameter. */
10029 arg
= fold (build_nop (TREE_TYPE (parm
), arg
));
10030 else if (uses_template_parms (tparm
))
10031 /* We haven't deduced the type of this parameter yet. Try again
10037 TREE_VEC_ELT (targs
, idx
) = arg
;
10042 /* A pointer-to-member constant can be unified only with
10043 another constant. */
10044 if (TREE_CODE (arg
) != PTRMEM_CST
)
10047 /* Just unify the class member. It would be useless (and possibly
10048 wrong, depending on the strict flags) to unify also
10049 PTRMEM_CST_CLASS, because we want to be sure that both parm and
10050 arg refer to the same variable, even if through different
10051 classes. For instance:
10053 struct A { int x; };
10056 Unification of &A::x and &B::x must succeed. */
10057 return unify (tparms
, targs
, PTRMEM_CST_MEMBER (parm
),
10058 PTRMEM_CST_MEMBER (arg
), strict
);
10063 if (TREE_CODE (arg
) != POINTER_TYPE
)
10066 /* [temp.deduct.call]
10068 A can be another pointer or pointer to member type that can
10069 be converted to the deduced A via a qualification
10070 conversion (_conv.qual_).
10072 We pass down STRICT here rather than UNIFY_ALLOW_NONE.
10073 This will allow for additional cv-qualification of the
10074 pointed-to types if appropriate. */
10076 if (TREE_CODE (TREE_TYPE (arg
)) == RECORD_TYPE
)
10077 /* The derived-to-base conversion only persists through one
10078 level of pointers. */
10079 strict
|= (strict_in
& UNIFY_ALLOW_DERIVED
);
10081 return unify (tparms
, targs
, TREE_TYPE (parm
),
10082 TREE_TYPE (arg
), strict
);
10085 case REFERENCE_TYPE
:
10086 if (TREE_CODE (arg
) != REFERENCE_TYPE
)
10088 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
10089 strict
& UNIFY_ALLOW_MORE_CV_QUAL
);
10092 if (TREE_CODE (arg
) != ARRAY_TYPE
)
10094 if ((TYPE_DOMAIN (parm
) == NULL_TREE
)
10095 != (TYPE_DOMAIN (arg
) == NULL_TREE
))
10097 if (TYPE_DOMAIN (parm
) != NULL_TREE
)
10102 parm_max
= TYPE_MAX_VALUE (TYPE_DOMAIN (parm
));
10103 arg_max
= TYPE_MAX_VALUE (TYPE_DOMAIN (arg
));
10105 /* Our representation of array types uses "N - 1" as the
10106 TYPE_MAX_VALUE for an array with "N" elements, if "N" is
10107 not an integer constant. */
10108 if (TREE_CODE (parm_max
) == MINUS_EXPR
)
10110 arg_max
= fold_build2 (PLUS_EXPR
,
10113 TREE_OPERAND (parm_max
, 1));
10114 parm_max
= TREE_OPERAND (parm_max
, 0);
10117 if (unify (tparms
, targs
, parm_max
, arg_max
, UNIFY_ALLOW_INTEGER
))
10120 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
10121 strict
& UNIFY_ALLOW_MORE_CV_QUAL
);
10128 case ENUMERAL_TYPE
:
10130 if (TREE_CODE (arg
) != TREE_CODE (parm
))
10133 /* We have already checked cv-qualification at the top of the
10135 if (!same_type_ignoring_top_level_qualifiers_p (arg
, parm
))
10138 /* As far as unification is concerned, this wins. Later checks
10139 will invalidate it if necessary. */
10142 /* Types INTEGER_CST and MINUS_EXPR can come from array bounds. */
10143 /* Type INTEGER_CST can come from ordinary constant template args. */
10145 while (TREE_CODE (arg
) == NOP_EXPR
)
10146 arg
= TREE_OPERAND (arg
, 0);
10148 if (TREE_CODE (arg
) != INTEGER_CST
)
10150 return !tree_int_cst_equal (parm
, arg
);
10155 if (TREE_CODE (arg
) != TREE_VEC
)
10157 if (TREE_VEC_LENGTH (parm
) != TREE_VEC_LENGTH (arg
))
10159 for (i
= 0; i
< TREE_VEC_LENGTH (parm
); ++i
)
10160 if (unify (tparms
, targs
,
10161 TREE_VEC_ELT (parm
, i
), TREE_VEC_ELT (arg
, i
),
10169 if (TREE_CODE (arg
) != TREE_CODE (parm
))
10172 if (TYPE_PTRMEMFUNC_P (parm
))
10174 if (!TYPE_PTRMEMFUNC_P (arg
))
10177 return unify (tparms
, targs
,
10178 TYPE_PTRMEMFUNC_FN_TYPE (parm
),
10179 TYPE_PTRMEMFUNC_FN_TYPE (arg
),
10183 if (CLASSTYPE_TEMPLATE_INFO (parm
))
10185 tree t
= NULL_TREE
;
10187 if (strict_in
& UNIFY_ALLOW_DERIVED
)
10189 /* First, we try to unify the PARM and ARG directly. */
10190 t
= try_class_unification (tparms
, targs
,
10195 /* Fallback to the special case allowed in
10196 [temp.deduct.call]:
10198 If P is a class, and P has the form
10199 template-id, then A can be a derived class of
10200 the deduced A. Likewise, if P is a pointer to
10201 a class of the form template-id, A can be a
10202 pointer to a derived class pointed to by the
10204 t
= get_template_base (tparms
, targs
, parm
, arg
);
10210 else if (CLASSTYPE_TEMPLATE_INFO (arg
)
10211 && (CLASSTYPE_TI_TEMPLATE (parm
)
10212 == CLASSTYPE_TI_TEMPLATE (arg
)))
10213 /* Perhaps PARM is something like S<U> and ARG is S<int>.
10214 Then, we should unify `int' and `U'. */
10217 /* There's no chance of unification succeeding. */
10220 return unify (tparms
, targs
, CLASSTYPE_TI_ARGS (parm
),
10221 CLASSTYPE_TI_ARGS (t
), UNIFY_ALLOW_NONE
);
10223 else if (!same_type_ignoring_top_level_qualifiers_p (parm
, arg
))
10228 case FUNCTION_TYPE
:
10229 if (TREE_CODE (arg
) != TREE_CODE (parm
))
10232 if (unify (tparms
, targs
, TREE_TYPE (parm
),
10233 TREE_TYPE (arg
), UNIFY_ALLOW_NONE
))
10235 return type_unification_real (tparms
, targs
, TYPE_ARG_TYPES (parm
),
10236 TYPE_ARG_TYPES (arg
), 1,
10240 /* Unify a pointer to member with a pointer to member function, which
10241 deduces the type of the member as a function type. */
10242 if (TYPE_PTRMEMFUNC_P (arg
))
10246 cp_cv_quals cv_quals
;
10248 /* Check top-level cv qualifiers */
10249 if (!check_cv_quals_for_unify (UNIFY_ALLOW_NONE
, arg
, parm
))
10252 if (unify (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
10253 TYPE_PTRMEMFUNC_OBJECT_TYPE (arg
), UNIFY_ALLOW_NONE
))
10256 /* Determine the type of the function we are unifying against. */
10257 method_type
= TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (arg
));
10259 build_function_type (TREE_TYPE (method_type
),
10260 TREE_CHAIN (TYPE_ARG_TYPES (method_type
)));
10262 /* Extract the cv-qualifiers of the member function from the
10263 implicit object parameter and place them on the function
10264 type to be restored later. */
10266 cp_type_quals(TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (method_type
))));
10267 fntype
= build_qualified_type (fntype
, cv_quals
);
10268 return unify (tparms
, targs
, TREE_TYPE (parm
), fntype
, strict
);
10271 if (TREE_CODE (arg
) != OFFSET_TYPE
)
10273 if (unify (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
10274 TYPE_OFFSET_BASETYPE (arg
), UNIFY_ALLOW_NONE
))
10276 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
10280 if (DECL_TEMPLATE_PARM_P (parm
))
10281 return unify (tparms
, targs
, DECL_INITIAL (parm
), arg
, strict
);
10282 if (arg
!= integral_constant_value (parm
))
10287 case TEMPLATE_DECL
:
10288 /* Matched cases are handled by the ARG == PARM test above. */
10292 gcc_assert (EXPR_P (parm
));
10294 /* We must be looking at an expression. This can happen with
10298 void foo(S<I>, S<I + 2>);
10300 This is a "nondeduced context":
10304 The nondeduced contexts are:
10306 --A type that is a template-id in which one or more of
10307 the template-arguments is an expression that references
10308 a template-parameter.
10310 In these cases, we assume deduction succeeded, but don't
10311 actually infer any unifications. */
10313 if (!uses_template_parms (parm
)
10314 && !template_args_equal (parm
, arg
))
10321 /* Note that DECL can be defined in this translation unit, if
10325 mark_definable (tree decl
)
10328 DECL_NOT_REALLY_EXTERN (decl
) = 1;
10329 FOR_EACH_CLONE (clone
, decl
)
10330 DECL_NOT_REALLY_EXTERN (clone
) = 1;
10333 /* Called if RESULT is explicitly instantiated, or is a member of an
10334 explicitly instantiated class. */
10337 mark_decl_instantiated (tree result
, int extern_p
)
10339 SET_DECL_EXPLICIT_INSTANTIATION (result
);
10341 /* If this entity has already been written out, it's too late to
10342 make any modifications. */
10343 if (TREE_ASM_WRITTEN (result
))
10346 if (TREE_CODE (result
) != FUNCTION_DECL
)
10347 /* The TREE_PUBLIC flag for function declarations will have been
10348 set correctly by tsubst. */
10349 TREE_PUBLIC (result
) = 1;
10351 /* This might have been set by an earlier implicit instantiation. */
10352 DECL_COMDAT (result
) = 0;
10355 DECL_NOT_REALLY_EXTERN (result
) = 0;
10358 mark_definable (result
);
10359 /* Always make artificials weak. */
10360 if (DECL_ARTIFICIAL (result
) && flag_weak
)
10361 comdat_linkage (result
);
10362 /* For WIN32 we also want to put explicit instantiations in
10363 linkonce sections. */
10364 else if (TREE_PUBLIC (result
))
10365 maybe_make_one_only (result
);
10368 /* If EXTERN_P, then this function will not be emitted -- unless
10369 followed by an explicit instantiation, at which point its linkage
10370 will be adjusted. If !EXTERN_P, then this function will be
10371 emitted here. In neither circumstance do we want
10372 import_export_decl to adjust the linkage. */
10373 DECL_INTERFACE_KNOWN (result
) = 1;
10376 /* Given two function templates PAT1 and PAT2, return:
10378 1 if PAT1 is more specialized than PAT2 as described in [temp.func.order].
10379 -1 if PAT2 is more specialized than PAT1.
10380 0 if neither is more specialized.
10382 LEN indicates the number of parameters we should consider
10383 (defaulted parameters should not be considered).
10385 The 1998 std underspecified function template partial ordering, and
10386 DR214 addresses the issue. We take pairs of arguments, one from
10387 each of the templates, and deduce them against each other. One of
10388 the templates will be more specialized if all the *other*
10389 template's arguments deduce against its arguments and at least one
10390 of its arguments *does* *not* deduce against the other template's
10391 corresponding argument. Deduction is done as for class templates.
10392 The arguments used in deduction have reference and top level cv
10393 qualifiers removed. Iff both arguments were originally reference
10394 types *and* deduction succeeds in both directions, the template
10395 with the more cv-qualified argument wins for that pairing (if
10396 neither is more cv-qualified, they both are equal). Unlike regular
10397 deduction, after all the arguments have been deduced in this way,
10398 we do *not* verify the deduced template argument values can be
10399 substituted into non-deduced contexts, nor do we have to verify
10400 that all template arguments have been deduced. */
10403 more_specialized_fn (tree pat1
, tree pat2
, int len
)
10405 tree decl1
= DECL_TEMPLATE_RESULT (pat1
);
10406 tree decl2
= DECL_TEMPLATE_RESULT (pat2
);
10407 tree targs1
= make_tree_vec (DECL_NTPARMS (pat1
));
10408 tree targs2
= make_tree_vec (DECL_NTPARMS (pat2
));
10409 tree tparms1
= DECL_INNERMOST_TEMPLATE_PARMS (pat1
);
10410 tree tparms2
= DECL_INNERMOST_TEMPLATE_PARMS (pat2
);
10411 tree args1
= TYPE_ARG_TYPES (TREE_TYPE (decl1
));
10412 tree args2
= TYPE_ARG_TYPES (TREE_TYPE (decl2
));
10416 /* If only one is a member function, they are unordered. */
10417 if (DECL_FUNCTION_MEMBER_P (decl1
) != DECL_FUNCTION_MEMBER_P (decl2
))
10420 /* Don't consider 'this' parameter. */
10421 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl1
))
10422 args1
= TREE_CHAIN (args1
);
10423 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl2
))
10424 args2
= TREE_CHAIN (args2
);
10426 /* If only one is a conversion operator, they are unordered. */
10427 if (DECL_CONV_FN_P (decl1
) != DECL_CONV_FN_P (decl2
))
10430 /* Consider the return type for a conversion function */
10431 if (DECL_CONV_FN_P (decl1
))
10433 args1
= tree_cons (NULL_TREE
, TREE_TYPE (TREE_TYPE (decl1
)), args1
);
10434 args2
= tree_cons (NULL_TREE
, TREE_TYPE (TREE_TYPE (decl2
)), args2
);
10438 processing_template_decl
++;
10442 tree arg1
= TREE_VALUE (args1
);
10443 tree arg2
= TREE_VALUE (args2
);
10444 int deduce1
, deduce2
;
10448 if (TREE_CODE (arg1
) == REFERENCE_TYPE
)
10450 arg1
= TREE_TYPE (arg1
);
10451 quals1
= cp_type_quals (arg1
);
10454 if (TREE_CODE (arg2
) == REFERENCE_TYPE
)
10456 arg2
= TREE_TYPE (arg2
);
10457 quals2
= cp_type_quals (arg2
);
10460 if ((quals1
< 0) != (quals2
< 0))
10462 /* Only of the args is a reference, see if we should apply
10463 array/function pointer decay to it. This is not part of
10464 DR214, but is, IMHO, consistent with the deduction rules
10465 for the function call itself, and with our earlier
10466 implementation of the underspecified partial ordering
10467 rules. (nathan). */
10470 switch (TREE_CODE (arg1
))
10473 arg1
= TREE_TYPE (arg1
);
10475 case FUNCTION_TYPE
:
10476 arg1
= build_pointer_type (arg1
);
10485 switch (TREE_CODE (arg2
))
10488 arg2
= TREE_TYPE (arg2
);
10490 case FUNCTION_TYPE
:
10491 arg2
= build_pointer_type (arg2
);
10500 arg1
= TYPE_MAIN_VARIANT (arg1
);
10501 arg2
= TYPE_MAIN_VARIANT (arg2
);
10503 deduce1
= !unify (tparms1
, targs1
, arg1
, arg2
, UNIFY_ALLOW_NONE
);
10504 deduce2
= !unify (tparms2
, targs2
, arg2
, arg1
, UNIFY_ALLOW_NONE
);
10510 if (better1
< 0 && better2
< 0)
10511 /* We've failed to deduce something in either direction.
10512 These must be unordered. */
10515 if (deduce1
&& deduce2
&& quals1
>= 0 && quals2
>= 0)
10517 /* Deduces in both directions, see if quals can
10518 disambiguate. Pretend the worse one failed to deduce. */
10519 if ((quals1
& quals2
) == quals2
)
10521 if ((quals1
& quals2
) == quals1
)
10524 if (deduce1
&& !deduce2
&& !better2
)
10526 if (deduce2
&& !deduce1
&& !better1
)
10529 args1
= TREE_CHAIN (args1
);
10530 args2
= TREE_CHAIN (args2
);
10533 processing_template_decl
--;
10535 return (better1
> 0) - (better2
> 0);
10538 /* Given two class template specialization list nodes PAT1 and PAT2, return:
10540 1 if PAT1 is more specialized than PAT2 as described in [temp.class.order].
10541 -1 if PAT2 is more specialized than PAT1.
10542 0 if neither is more specialized.
10544 FULL_ARGS is the full set of template arguments that triggers this
10545 partial ordering. */
10548 more_specialized_class (tree pat1
, tree pat2
, tree full_args
)
10553 /* Just like what happens for functions, if we are ordering between
10554 different class template specializations, we may encounter dependent
10555 types in the arguments, and we need our dependency check functions
10556 to behave correctly. */
10557 ++processing_template_decl
;
10558 targs
= get_class_bindings (TREE_VALUE (pat1
), TREE_PURPOSE (pat1
),
10559 add_outermost_template_args (full_args
, TREE_PURPOSE (pat2
)));
10563 targs
= get_class_bindings (TREE_VALUE (pat2
), TREE_PURPOSE (pat2
),
10564 add_outermost_template_args (full_args
, TREE_PURPOSE (pat1
)));
10567 --processing_template_decl
;
10572 /* Return the template arguments that will produce the function signature
10573 DECL from the function template FN, with the explicit template
10574 arguments EXPLICIT_ARGS. If CHECK_RETTYPE is true, the return type must
10575 also match. Return NULL_TREE if no satisfactory arguments could be
10579 get_bindings (tree fn
, tree decl
, tree explicit_args
, bool check_rettype
)
10581 int ntparms
= DECL_NTPARMS (fn
);
10582 tree targs
= make_tree_vec (ntparms
);
10584 tree decl_arg_types
;
10586 /* Substitute the explicit template arguments into the type of DECL.
10587 The call to fn_type_unification will handle substitution into the
10589 decl_type
= TREE_TYPE (decl
);
10590 if (explicit_args
&& uses_template_parms (decl_type
))
10593 tree converted_args
;
10595 if (DECL_TEMPLATE_INFO (decl
))
10596 tmpl
= DECL_TI_TEMPLATE (decl
);
10598 /* We can get here for some invalid specializations. */
10602 = (coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
10603 explicit_args
, NULL_TREE
,
10604 tf_none
, /*require_all_arguments=*/0));
10605 if (converted_args
== error_mark_node
)
10608 decl_type
= tsubst (decl_type
, converted_args
, tf_none
, NULL_TREE
);
10609 if (decl_type
== error_mark_node
)
10613 decl_arg_types
= TYPE_ARG_TYPES (decl_type
);
10614 /* Never do unification on the 'this' parameter. */
10615 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
10616 decl_arg_types
= TREE_CHAIN (decl_arg_types
);
10618 if (fn_type_unification (fn
, explicit_args
, targs
,
10620 (check_rettype
|| DECL_CONV_FN_P (fn
)
10621 ? TREE_TYPE (decl_type
) : NULL_TREE
),
10628 /* Return the innermost template arguments that, when applied to a
10629 template specialization whose innermost template parameters are
10630 TPARMS, and whose specialization arguments are PARMS, yield the
10633 For example, suppose we have:
10635 template <class T, class U> struct S {};
10636 template <class T> struct S<T*, int> {};
10638 Then, suppose we want to get `S<double*, int>'. The TPARMS will be
10639 {T}, the PARMS will be {T*, int} and the ARGS will be {double*,
10640 int}. The resulting vector will be {double}, indicating that `T'
10641 is bound to `double'. */
10644 get_class_bindings (tree tparms
, tree parms
, tree args
)
10646 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
10647 tree vec
= make_tree_vec (ntparms
);
10649 if (unify (tparms
, vec
, parms
, INNERMOST_TEMPLATE_ARGS (args
),
10653 for (i
= 0; i
< ntparms
; ++i
)
10654 if (! TREE_VEC_ELT (vec
, i
))
10657 if (verify_class_unification (vec
, parms
, args
))
10663 /* In INSTANTIATIONS is a list of <INSTANTIATION, TEMPLATE> pairs.
10664 Pick the most specialized template, and return the corresponding
10665 instantiation, or if there is no corresponding instantiation, the
10666 template itself. If there is no most specialized template,
10667 error_mark_node is returned. If there are no templates at all,
10668 NULL_TREE is returned. */
10671 most_specialized_instantiation (tree instantiations
)
10675 if (!instantiations
)
10678 ++processing_template_decl
;
10680 champ
= instantiations
;
10681 for (fn
= TREE_CHAIN (instantiations
); fn
; fn
= TREE_CHAIN (fn
))
10685 if (get_bindings (TREE_VALUE (champ
),
10686 DECL_TEMPLATE_RESULT (TREE_VALUE (fn
)),
10687 NULL_TREE
, /*check_ret=*/false))
10690 if (get_bindings (TREE_VALUE (fn
),
10691 DECL_TEMPLATE_RESULT (TREE_VALUE (champ
)),
10692 NULL_TREE
, /*check_ret=*/false))
10698 /* Equally specialized, move to next function. If there
10699 is no next function, nothing's most specialized. */
10700 fn
= TREE_CHAIN (fn
);
10706 /* Now verify that champ is better than everything earlier in the
10707 instantiation list. */
10708 for (fn
= instantiations
; fn
!= champ
; fn
= TREE_CHAIN (fn
))
10709 if (get_bindings (TREE_VALUE (champ
),
10710 DECL_TEMPLATE_RESULT (TREE_VALUE (fn
)),
10711 NULL_TREE
, /*check_ret=*/false)
10712 || !get_bindings (TREE_VALUE (fn
),
10713 DECL_TEMPLATE_RESULT (TREE_VALUE (champ
)),
10714 NULL_TREE
, /*check_ret=*/false))
10720 processing_template_decl
--;
10723 return error_mark_node
;
10725 return TREE_PURPOSE (champ
) ? TREE_PURPOSE (champ
) : TREE_VALUE (champ
);
10728 /* Return the most specialized of the list of templates in FNS that can
10729 produce an instantiation matching DECL, given the explicit template
10730 arguments EXPLICIT_ARGS. */
10733 most_specialized (tree fns
, tree decl
, tree explicit_args
)
10735 tree candidates
= NULL_TREE
;
10738 for (fn
= fns
; fn
; fn
= TREE_CHAIN (fn
))
10740 tree candidate
= TREE_VALUE (fn
);
10742 args
= get_bindings (candidate
, decl
, explicit_args
, /*check_ret=*/true);
10744 candidates
= tree_cons (NULL_TREE
, candidate
, candidates
);
10747 return most_specialized_instantiation (candidates
);
10750 /* If DECL is a specialization of some template, return the most
10751 general such template. Otherwise, returns NULL_TREE.
10753 For example, given:
10755 template <class T> struct S { template <class U> void f(U); };
10757 if TMPL is `template <class U> void S<int>::f(U)' this will return
10758 the full template. This function will not trace past partial
10759 specializations, however. For example, given in addition:
10761 template <class T> struct S<T*> { template <class U> void f(U); };
10763 if TMPL is `template <class U> void S<int*>::f(U)' this will return
10764 `template <class T> template <class U> S<T*>::f(U)'. */
10767 most_general_template (tree decl
)
10769 /* If DECL is a FUNCTION_DECL, find the TEMPLATE_DECL of which it is
10770 an immediate specialization. */
10771 if (TREE_CODE (decl
) == FUNCTION_DECL
)
10773 if (DECL_TEMPLATE_INFO (decl
)) {
10774 decl
= DECL_TI_TEMPLATE (decl
);
10776 /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE for a
10777 template friend. */
10778 if (TREE_CODE (decl
) != TEMPLATE_DECL
)
10784 /* Look for more and more general templates. */
10785 while (DECL_TEMPLATE_INFO (decl
))
10787 /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE in some cases.
10788 (See cp-tree.h for details.) */
10789 if (TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
10792 if (CLASS_TYPE_P (TREE_TYPE (decl
))
10793 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl
)))
10796 /* Stop if we run into an explicitly specialized class template. */
10797 if (!DECL_NAMESPACE_SCOPE_P (decl
)
10798 && DECL_CONTEXT (decl
)
10799 && CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (decl
)))
10802 decl
= DECL_TI_TEMPLATE (decl
);
10808 /* Return the most specialized of the class template specializations
10809 of TMPL which can produce an instantiation matching ARGS, or
10810 error_mark_node if the choice is ambiguous. */
10813 most_specialized_class (tree tmpl
, tree args
)
10815 tree list
= NULL_TREE
;
10820 tmpl
= most_general_template (tmpl
);
10821 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
); t
; t
= TREE_CHAIN (t
))
10824 = get_class_bindings (TREE_VALUE (t
), TREE_PURPOSE (t
), args
);
10827 list
= tree_cons (TREE_PURPOSE (t
), TREE_VALUE (t
), list
);
10828 TREE_TYPE (list
) = TREE_TYPE (t
);
10837 t
= TREE_CHAIN (t
);
10838 for (; t
; t
= TREE_CHAIN (t
))
10840 fate
= more_specialized_class (champ
, t
, args
);
10847 t
= TREE_CHAIN (t
);
10849 return error_mark_node
;
10855 for (t
= list
; t
&& t
!= champ
; t
= TREE_CHAIN (t
))
10857 fate
= more_specialized_class (champ
, t
, args
);
10859 return error_mark_node
;
10865 /* Explicitly instantiate DECL. */
10868 do_decl_instantiation (tree decl
, tree storage
)
10870 tree result
= NULL_TREE
;
10874 /* An error occurred, for which grokdeclarator has already issued
10875 an appropriate message. */
10877 else if (! DECL_LANG_SPECIFIC (decl
))
10879 error ("explicit instantiation of non-template %q#D", decl
);
10882 else if (TREE_CODE (decl
) == VAR_DECL
)
10884 /* There is an asymmetry here in the way VAR_DECLs and
10885 FUNCTION_DECLs are handled by grokdeclarator. In the case of
10886 the latter, the DECL we get back will be marked as a
10887 template instantiation, and the appropriate
10888 DECL_TEMPLATE_INFO will be set up. This does not happen for
10889 VAR_DECLs so we do the lookup here. Probably, grokdeclarator
10890 should handle VAR_DECLs as it currently handles
10892 result
= lookup_field (DECL_CONTEXT (decl
), DECL_NAME (decl
), 0, false);
10893 if (!result
|| TREE_CODE (result
) != VAR_DECL
)
10895 error ("no matching template for %qD found", decl
);
10899 else if (TREE_CODE (decl
) != FUNCTION_DECL
)
10901 error ("explicit instantiation of %q#D", decl
);
10907 /* Check for various error cases. Note that if the explicit
10908 instantiation is valid the RESULT will currently be marked as an
10909 *implicit* instantiation; DECL_EXPLICIT_INSTANTIATION is not set
10910 until we get here. */
10912 if (DECL_TEMPLATE_SPECIALIZATION (result
))
10914 /* DR 259 [temp.spec].
10916 Both an explicit instantiation and a declaration of an explicit
10917 specialization shall not appear in a program unless the explicit
10918 instantiation follows a declaration of the explicit specialization.
10920 For a given set of template parameters, if an explicit
10921 instantiation of a template appears after a declaration of an
10922 explicit specialization for that template, the explicit
10923 instantiation has no effect. */
10926 else if (DECL_EXPLICIT_INSTANTIATION (result
))
10930 No program shall explicitly instantiate any template more
10933 We check DECL_NOT_REALLY_EXTERN so as not to complain when
10934 the first instantiation was `extern' and the second is not,
10935 and EXTERN_P for the opposite case. */
10936 if (DECL_NOT_REALLY_EXTERN (result
) && !extern_p
)
10937 pedwarn ("duplicate explicit instantiation of %q#D", result
);
10938 /* If an "extern" explicit instantiation follows an ordinary
10939 explicit instantiation, the template is instantiated. */
10943 else if (!DECL_IMPLICIT_INSTANTIATION (result
))
10945 error ("no matching template for %qD found", result
);
10948 else if (!DECL_TEMPLATE_INFO (result
))
10950 pedwarn ("explicit instantiation of non-template %q#D", result
);
10954 if (storage
== NULL_TREE
)
10956 else if (storage
== ridpointers
[(int) RID_EXTERN
])
10958 if (pedantic
&& !in_system_header
)
10959 pedwarn ("ISO C++ forbids the use of %<extern%> on explicit "
10964 error ("storage class %qD applied to template instantiation", storage
);
10966 mark_decl_instantiated (result
, extern_p
);
10968 instantiate_decl (result
, /*defer_ok=*/1, /*undefined_ok=*/0);
10972 mark_class_instantiated (tree t
, int extern_p
)
10974 SET_CLASSTYPE_EXPLICIT_INSTANTIATION (t
);
10975 SET_CLASSTYPE_INTERFACE_KNOWN (t
);
10976 CLASSTYPE_INTERFACE_ONLY (t
) = extern_p
;
10977 TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (t
)) = extern_p
;
10980 CLASSTYPE_DEBUG_REQUESTED (t
) = 1;
10981 rest_of_type_compilation (t
, 1);
10985 /* Called from do_type_instantiation through binding_table_foreach to
10986 do recursive instantiation for the type bound in ENTRY. */
10988 bt_instantiate_type_proc (binding_entry entry
, void *data
)
10990 tree storage
= *(tree
*) data
;
10992 if (IS_AGGR_TYPE (entry
->type
)
10993 && !uses_template_parms (CLASSTYPE_TI_ARGS (entry
->type
)))
10994 do_type_instantiation (TYPE_MAIN_DECL (entry
->type
), storage
, 0);
10997 /* Called from do_type_instantiation to instantiate a member
10998 (a member function or a static member variable) of an
10999 explicitly instantiated class template. */
11001 instantiate_class_member (tree decl
, int extern_p
)
11003 mark_decl_instantiated (decl
, extern_p
);
11005 instantiate_decl (decl
, /*defer_ok=*/1, /* undefined_ok=*/1);
11008 /* Perform an explicit instantiation of template class T. STORAGE, if
11009 non-null, is the RID for extern, inline or static. COMPLAIN is
11010 nonzero if this is called from the parser, zero if called recursively,
11011 since the standard is unclear (as detailed below). */
11014 do_type_instantiation (tree t
, tree storage
, tsubst_flags_t complain
)
11019 int previous_instantiation_extern_p
= 0;
11021 if (TREE_CODE (t
) == TYPE_DECL
)
11024 if (! CLASS_TYPE_P (t
) || ! CLASSTYPE_TEMPLATE_INFO (t
))
11026 error ("explicit instantiation of non-template type %qT", t
);
11032 if (!COMPLETE_TYPE_P (t
))
11034 if (complain
& tf_error
)
11035 error ("explicit instantiation of %q#T before definition of template",
11040 if (storage
!= NULL_TREE
)
11042 if (pedantic
&& !in_system_header
)
11043 pedwarn("ISO C++ forbids the use of %qE on explicit instantiations",
11046 if (storage
== ridpointers
[(int) RID_INLINE
])
11048 else if (storage
== ridpointers
[(int) RID_EXTERN
])
11050 else if (storage
== ridpointers
[(int) RID_STATIC
])
11054 error ("storage class %qD applied to template instantiation",
11060 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
11062 /* DR 259 [temp.spec].
11064 Both an explicit instantiation and a declaration of an explicit
11065 specialization shall not appear in a program unless the explicit
11066 instantiation follows a declaration of the explicit specialization.
11068 For a given set of template parameters, if an explicit
11069 instantiation of a template appears after a declaration of an
11070 explicit specialization for that template, the explicit
11071 instantiation has no effect. */
11074 else if (CLASSTYPE_EXPLICIT_INSTANTIATION (t
))
11078 No program shall explicitly instantiate any template more
11081 If PREVIOUS_INSTANTIATION_EXTERN_P, then the first explicit
11082 instantiation was `extern'. If EXTERN_P then the second is.
11083 These cases are OK. */
11084 previous_instantiation_extern_p
= CLASSTYPE_INTERFACE_ONLY (t
);
11086 if (!previous_instantiation_extern_p
&& !extern_p
11087 && (complain
& tf_error
))
11088 pedwarn ("duplicate explicit instantiation of %q#T", t
);
11090 /* If we've already instantiated the template, just return now. */
11091 if (!CLASSTYPE_INTERFACE_ONLY (t
))
11095 mark_class_instantiated (t
, extern_p
);
11103 /* In contrast to implicit instantiation, where only the
11104 declarations, and not the definitions, of members are
11105 instantiated, we have here:
11109 The explicit instantiation of a class template specialization
11110 implies the instantiation of all of its members not
11111 previously explicitly specialized in the translation unit
11112 containing the explicit instantiation.
11114 Of course, we can't instantiate member template classes, since
11115 we don't have any arguments for them. Note that the standard
11116 is unclear on whether the instantiation of the members are
11117 *explicit* instantiations or not. However, the most natural
11118 interpretation is that it should be an explicit instantiation. */
11121 for (tmp
= TYPE_METHODS (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
11122 if (TREE_CODE (tmp
) == FUNCTION_DECL
11123 && DECL_TEMPLATE_INSTANTIATION (tmp
))
11124 instantiate_class_member (tmp
, extern_p
);
11126 for (tmp
= TYPE_FIELDS (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
11127 if (TREE_CODE (tmp
) == VAR_DECL
&& DECL_TEMPLATE_INSTANTIATION (tmp
))
11128 instantiate_class_member (tmp
, extern_p
);
11130 if (CLASSTYPE_NESTED_UTDS (t
))
11131 binding_table_foreach (CLASSTYPE_NESTED_UTDS (t
),
11132 bt_instantiate_type_proc
, &storage
);
11136 /* Given a function DECL, which is a specialization of TMPL, modify
11137 DECL to be a re-instantiation of TMPL with the same template
11138 arguments. TMPL should be the template into which tsubst'ing
11139 should occur for DECL, not the most general template.
11141 One reason for doing this is a scenario like this:
11144 void f(const T&, int i);
11146 void g() { f(3, 7); }
11149 void f(const T& t, const int i) { }
11151 Note that when the template is first instantiated, with
11152 instantiate_template, the resulting DECL will have no name for the
11153 first parameter, and the wrong type for the second. So, when we go
11154 to instantiate the DECL, we regenerate it. */
11157 regenerate_decl_from_template (tree decl
, tree tmpl
)
11159 /* The arguments used to instantiate DECL, from the most general
11164 args
= DECL_TI_ARGS (decl
);
11165 code_pattern
= DECL_TEMPLATE_RESULT (tmpl
);
11167 /* Make sure that we can see identifiers, and compute access
11169 push_access_scope (decl
);
11171 if (TREE_CODE (decl
) == FUNCTION_DECL
)
11179 args_depth
= TMPL_ARGS_DEPTH (args
);
11180 parms_depth
= TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
));
11181 if (args_depth
> parms_depth
)
11182 args
= get_innermost_template_args (args
, parms_depth
);
11184 specs
= tsubst_exception_specification (TREE_TYPE (code_pattern
),
11185 args
, tf_error
, NULL_TREE
);
11187 TREE_TYPE (decl
) = build_exception_variant (TREE_TYPE (decl
),
11190 /* Merge parameter declarations. */
11191 decl_parm
= skip_artificial_parms_for (decl
,
11192 DECL_ARGUMENTS (decl
));
11194 = skip_artificial_parms_for (code_pattern
,
11195 DECL_ARGUMENTS (code_pattern
));
11201 if (DECL_NAME (decl_parm
) != DECL_NAME (pattern_parm
))
11202 DECL_NAME (decl_parm
) = DECL_NAME (pattern_parm
);
11203 parm_type
= tsubst (TREE_TYPE (pattern_parm
), args
, tf_error
,
11205 parm_type
= type_decays_to (parm_type
);
11206 if (!same_type_p (TREE_TYPE (decl_parm
), parm_type
))
11207 TREE_TYPE (decl_parm
) = parm_type
;
11208 attributes
= DECL_ATTRIBUTES (pattern_parm
);
11209 if (DECL_ATTRIBUTES (decl_parm
) != attributes
)
11211 DECL_ATTRIBUTES (decl_parm
) = attributes
;
11212 cplus_decl_attributes (&decl_parm
, attributes
, /*flags=*/0);
11214 decl_parm
= TREE_CHAIN (decl_parm
);
11215 pattern_parm
= TREE_CHAIN (pattern_parm
);
11218 /* Merge additional specifiers from the CODE_PATTERN. */
11219 if (DECL_DECLARED_INLINE_P (code_pattern
)
11220 && !DECL_DECLARED_INLINE_P (decl
))
11221 DECL_DECLARED_INLINE_P (decl
) = 1;
11222 if (DECL_INLINE (code_pattern
) && !DECL_INLINE (decl
))
11223 DECL_INLINE (decl
) = 1;
11225 else if (TREE_CODE (decl
) == VAR_DECL
)
11227 if (!DECL_INITIALIZED_IN_CLASS_P (decl
)
11228 && DECL_INITIAL (code_pattern
))
11229 DECL_INITIAL (decl
) =
11230 tsubst_expr (DECL_INITIAL (code_pattern
), args
,
11231 tf_error
, DECL_TI_TEMPLATE (decl
));
11234 gcc_unreachable ();
11236 pop_access_scope (decl
);
11239 /* Return the TEMPLATE_DECL into which DECL_TI_ARGS(DECL) should be
11240 substituted to get DECL. */
11243 template_for_substitution (tree decl
)
11245 tree tmpl
= DECL_TI_TEMPLATE (decl
);
11247 /* Set TMPL to the template whose DECL_TEMPLATE_RESULT is the pattern
11248 for the instantiation. This is not always the most general
11249 template. Consider, for example:
11252 struct S { template <class U> void f();
11253 template <> void f<int>(); };
11255 and an instantiation of S<double>::f<int>. We want TD to be the
11256 specialization S<T>::f<int>, not the more general S<T>::f<U>. */
11257 while (/* An instantiation cannot have a definition, so we need a
11258 more general template. */
11259 DECL_TEMPLATE_INSTANTIATION (tmpl
)
11260 /* We must also deal with friend templates. Given:
11262 template <class T> struct S {
11263 template <class U> friend void f() {};
11266 S<int>::f<U> say, is not an instantiation of S<T>::f<U>,
11267 so far as the language is concerned, but that's still
11268 where we get the pattern for the instantiation from. On
11269 other hand, if the definition comes outside the class, say:
11271 template <class T> struct S {
11272 template <class U> friend void f();
11274 template <class U> friend void f() {}
11276 we don't need to look any further. That's what the check for
11277 DECL_INITIAL is for. */
11278 || (TREE_CODE (decl
) == FUNCTION_DECL
11279 && DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (tmpl
)
11280 && !DECL_INITIAL (DECL_TEMPLATE_RESULT (tmpl
))))
11282 /* The present template, TD, should not be a definition. If it
11283 were a definition, we should be using it! Note that we
11284 cannot restructure the loop to just keep going until we find
11285 a template with a definition, since that might go too far if
11286 a specialization was declared, but not defined. */
11287 gcc_assert (TREE_CODE (decl
) != VAR_DECL
11288 || DECL_IN_AGGR_P (DECL_TEMPLATE_RESULT (tmpl
)));
11290 /* Fetch the more general template. */
11291 tmpl
= DECL_TI_TEMPLATE (tmpl
);
11297 /* Produce the definition of D, a _DECL generated from a template. If
11298 DEFER_OK is nonzero, then we don't have to actually do the
11299 instantiation now; we just have to do it sometime. Normally it is
11300 an error if this is an explicit instantiation but D is undefined.
11301 If UNDEFINED_OK is nonzero, then instead we treat it as an implicit
11302 instantiation. UNDEFINED_OK is nonzero only if we are being used
11303 to instantiate the members of an explicitly instantiated class
11308 instantiate_decl (tree d
, int defer_ok
, int undefined_ok
)
11310 tree tmpl
= DECL_TI_TEMPLATE (d
);
11317 int pattern_defined
;
11319 location_t saved_loc
= input_location
;
11321 /* This function should only be used to instantiate templates for
11322 functions and static member variables. */
11323 gcc_assert (TREE_CODE (d
) == FUNCTION_DECL
11324 || TREE_CODE (d
) == VAR_DECL
);
11326 /* Variables are never deferred; if instantiation is required, they
11327 are instantiated right away. That allows for better code in the
11328 case that an expression refers to the value of the variable --
11329 if the variable has a constant value the referring expression can
11330 take advantage of that fact. */
11331 if (TREE_CODE (d
) == VAR_DECL
)
11334 /* Don't instantiate cloned functions. Instead, instantiate the
11335 functions they cloned. */
11336 if (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_CLONED_FUNCTION_P (d
))
11337 d
= DECL_CLONED_FUNCTION (d
);
11339 if (DECL_TEMPLATE_INSTANTIATED (d
))
11340 /* D has already been instantiated. It might seem reasonable to
11341 check whether or not D is an explicit instantiation, and, if so,
11342 stop here. But when an explicit instantiation is deferred
11343 until the end of the compilation, DECL_EXPLICIT_INSTANTIATION
11344 is set, even though we still need to do the instantiation. */
11347 /* If we already have a specialization of this declaration, then
11348 there's no reason to instantiate it. Note that
11349 retrieve_specialization gives us both instantiations and
11350 specializations, so we must explicitly check
11351 DECL_TEMPLATE_SPECIALIZATION. */
11352 gen_tmpl
= most_general_template (tmpl
);
11353 gen_args
= DECL_TI_ARGS (d
);
11354 spec
= retrieve_specialization (gen_tmpl
, gen_args
,
11355 /*class_specializations_p=*/false);
11356 if (spec
!= NULL_TREE
&& DECL_TEMPLATE_SPECIALIZATION (spec
))
11359 /* This needs to happen before any tsubsting. */
11360 if (! push_tinst_level (d
))
11363 timevar_push (TV_PARSE
);
11365 /* We may be in the middle of deferred access check. Disable it now. */
11366 push_deferring_access_checks (dk_no_deferred
);
11368 /* Set TD to the template whose DECL_TEMPLATE_RESULT is the pattern
11369 for the instantiation. */
11370 td
= template_for_substitution (d
);
11371 code_pattern
= DECL_TEMPLATE_RESULT (td
);
11373 if ((DECL_NAMESPACE_SCOPE_P (d
) && !DECL_INITIALIZED_IN_CLASS_P (d
))
11374 || DECL_TEMPLATE_SPECIALIZATION (td
))
11375 /* In the case of a friend template whose definition is provided
11376 outside the class, we may have too many arguments. Drop the
11377 ones we don't need. The same is true for specializations. */
11378 args
= get_innermost_template_args
11379 (gen_args
, TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (td
)));
11383 if (TREE_CODE (d
) == FUNCTION_DECL
)
11384 pattern_defined
= (DECL_SAVED_TREE (code_pattern
) != NULL_TREE
);
11386 pattern_defined
= ! DECL_IN_AGGR_P (code_pattern
);
11387 /* Unless an explicit instantiation directive has already determined
11388 the linkage of D, remember that a definition is available for
11390 if (pattern_defined
11391 && !DECL_INTERFACE_KNOWN (d
)
11392 && !DECL_NOT_REALLY_EXTERN (d
))
11393 mark_definable (d
);
11395 input_location
= DECL_SOURCE_LOCATION (d
);
11397 if (! pattern_defined
&& DECL_EXPLICIT_INSTANTIATION (d
) && undefined_ok
)
11399 DECL_NOT_REALLY_EXTERN (d
) = 0;
11400 SET_DECL_IMPLICIT_INSTANTIATION (d
);
11405 /* Recheck the substitutions to obtain any warning messages
11406 about ignoring cv qualifiers. */
11407 tree gen
= DECL_TEMPLATE_RESULT (gen_tmpl
);
11408 tree type
= TREE_TYPE (gen
);
11410 /* Make sure that we can see identifiers, and compute access
11411 correctly. D is already the target FUNCTION_DECL with the
11413 push_access_scope (d
);
11415 if (TREE_CODE (gen
) == FUNCTION_DECL
)
11417 tsubst (DECL_ARGUMENTS (gen
), gen_args
, tf_error
| tf_warning
, d
);
11418 tsubst (TYPE_RAISES_EXCEPTIONS (type
), gen_args
,
11419 tf_error
| tf_warning
, d
);
11420 /* Don't simply tsubst the function type, as that will give
11421 duplicate warnings about poor parameter qualifications.
11422 The function arguments are the same as the decl_arguments
11423 without the top level cv qualifiers. */
11424 type
= TREE_TYPE (type
);
11426 tsubst (type
, gen_args
, tf_error
| tf_warning
, d
);
11428 pop_access_scope (d
);
11431 /* We should have set up DECL_INITIAL in instantiate_class_template
11432 for in-class definitions of static data members. */
11433 gcc_assert (!(TREE_CODE (d
) == VAR_DECL
11434 && DECL_INITIALIZED_IN_CLASS_P (d
)
11435 && DECL_INITIAL (d
) == NULL_TREE
));
11437 /* Do not instantiate templates that we know will be defined
11439 if (DECL_INTERFACE_KNOWN (d
)
11440 && DECL_REALLY_EXTERN (d
)
11441 && ! (TREE_CODE (d
) == FUNCTION_DECL
11442 && DECL_INLINE (d
)))
11444 /* Defer all other templates, unless we have been explicitly
11445 forbidden from doing so. We restore the source position here
11446 because it's used by add_pending_template. */
11447 else if (! pattern_defined
|| defer_ok
)
11449 input_location
= saved_loc
;
11451 if (at_eof
&& !pattern_defined
11452 && DECL_EXPLICIT_INSTANTIATION (d
))
11455 The definition of a non-exported function template, a
11456 non-exported member function template, or a non-exported
11457 member function or static data member of a class template
11458 shall be present in every translation unit in which it is
11459 explicitly instantiated. */
11461 ("explicit instantiation of %qD but no definition available", d
);
11463 add_pending_template (d
);
11466 /* Tell the repository that D is available in this translation unit
11467 -- and see if it is supposed to be instantiated here. */
11468 if (TREE_PUBLIC (d
) && !DECL_REALLY_EXTERN (d
) && !repo_emit_p (d
))
11470 /* In a PCH file, despite the fact that the repository hasn't
11471 requested instantiation in the PCH it is still possible that
11472 an instantiation will be required in a file that includes the
11475 add_pending_template (d
);
11476 /* Instantiate inline functions so that the inliner can do its
11477 job, even though we'll not be emitting a copy of this
11479 if (!(TREE_CODE (d
) == FUNCTION_DECL
11480 && flag_inline_trees
11481 && DECL_DECLARED_INLINE_P (d
)))
11485 need_push
= !cfun
|| !global_bindings_p ();
11487 push_to_top_level ();
11489 /* Mark D as instantiated so that recursive calls to
11490 instantiate_decl do not try to instantiate it again. */
11491 DECL_TEMPLATE_INSTANTIATED (d
) = 1;
11493 /* Regenerate the declaration in case the template has been modified
11494 by a subsequent redeclaration. */
11495 regenerate_decl_from_template (d
, td
);
11497 /* We already set the file and line above. Reset them now in case
11498 they changed as a result of calling regenerate_decl_from_template. */
11499 input_location
= DECL_SOURCE_LOCATION (d
);
11501 if (TREE_CODE (d
) == VAR_DECL
)
11503 /* Clear out DECL_RTL; whatever was there before may not be right
11504 since we've reset the type of the declaration. */
11505 SET_DECL_RTL (d
, NULL_RTX
);
11506 DECL_IN_AGGR_P (d
) = 0;
11508 /* Clear DECL_EXTERNAL so that cp_finish_decl will process the
11509 initializer. That function will defer actual emission until
11510 we have a chance to determine linkage. */
11511 DECL_EXTERNAL (d
) = 0;
11513 /* Enter the scope of D so that access-checking works correctly. */
11514 push_nested_class (DECL_CONTEXT (d
));
11516 (!DECL_INITIALIZED_IN_CLASS_P (d
)
11517 ? DECL_INITIAL (d
) : NULL_TREE
),
11519 pop_nested_class ();
11521 else if (TREE_CODE (d
) == FUNCTION_DECL
)
11523 htab_t saved_local_specializations
;
11528 /* Save away the current list, in case we are instantiating one
11529 template from within the body of another. */
11530 saved_local_specializations
= local_specializations
;
11532 /* Set up the list of local specializations. */
11533 local_specializations
= htab_create (37,
11534 hash_local_specialization
,
11535 eq_local_specializations
,
11538 /* Set up context. */
11539 start_preparsed_function (d
, NULL_TREE
, SF_PRE_PARSED
);
11541 /* Create substitution entries for the parameters. */
11542 subst_decl
= DECL_TEMPLATE_RESULT (template_for_substitution (d
));
11543 tmpl_parm
= DECL_ARGUMENTS (subst_decl
);
11544 spec_parm
= DECL_ARGUMENTS (d
);
11545 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (d
))
11547 register_local_specialization (spec_parm
, tmpl_parm
);
11548 spec_parm
= skip_artificial_parms_for (d
, spec_parm
);
11549 tmpl_parm
= skip_artificial_parms_for (subst_decl
, tmpl_parm
);
11553 register_local_specialization (spec_parm
, tmpl_parm
);
11554 tmpl_parm
= TREE_CHAIN (tmpl_parm
);
11555 spec_parm
= TREE_CHAIN (spec_parm
);
11557 gcc_assert (!spec_parm
);
11559 /* Substitute into the body of the function. */
11560 tsubst_expr (DECL_SAVED_TREE (code_pattern
), args
,
11561 tf_error
| tf_warning
, tmpl
);
11563 /* We don't need the local specializations any more. */
11564 htab_delete (local_specializations
);
11565 local_specializations
= saved_local_specializations
;
11567 /* Finish the function. */
11568 d
= finish_function (0);
11569 expand_or_defer_fn (d
);
11572 /* We're not deferring instantiation any more. */
11573 TI_PENDING_TEMPLATE_FLAG (DECL_TEMPLATE_INFO (d
)) = 0;
11576 pop_from_top_level ();
11579 input_location
= saved_loc
;
11580 pop_deferring_access_checks ();
11581 pop_tinst_level ();
11583 timevar_pop (TV_PARSE
);
11588 /* Run through the list of templates that we wish we could
11589 instantiate, and instantiate any we can. RETRIES is the
11590 number of times we retry pending template instantiation. */
11593 instantiate_pending_templates (int retries
)
11596 tree last
= NULL_TREE
;
11598 location_t saved_loc
= input_location
;
11599 int saved_in_system_header
= in_system_header
;
11601 /* Instantiating templates may trigger vtable generation. This in turn
11602 may require further template instantiations. We place a limit here
11603 to avoid infinite loop. */
11604 if (pending_templates
&& retries
>= max_tinst_depth
)
11606 cp_error_at ("template instantiation depth exceeds maximum of %d"
11607 " (use -ftemplate-depth-NN to increase the maximum)"
11608 " instantiating %q+D, possibly from virtual table"
11610 max_tinst_depth
, TREE_VALUE (pending_templates
));
11618 t
= &pending_templates
;
11621 tree instantiation
= TREE_VALUE (*t
);
11623 reopen_tinst_level (TREE_PURPOSE (*t
));
11625 if (TYPE_P (instantiation
))
11629 if (!COMPLETE_TYPE_P (instantiation
))
11631 instantiate_class_template (instantiation
);
11632 if (CLASSTYPE_TEMPLATE_INSTANTIATION (instantiation
))
11633 for (fn
= TYPE_METHODS (instantiation
);
11635 fn
= TREE_CHAIN (fn
))
11636 if (! DECL_ARTIFICIAL (fn
))
11637 instantiate_decl (fn
, /*defer_ok=*/0,
11638 /*undefined_ok=*/0);
11639 if (COMPLETE_TYPE_P (instantiation
))
11643 if (COMPLETE_TYPE_P (instantiation
))
11644 /* If INSTANTIATION has been instantiated, then we don't
11645 need to consider it again in the future. */
11646 *t
= TREE_CHAIN (*t
);
11650 t
= &TREE_CHAIN (*t
);
11655 if (!DECL_TEMPLATE_SPECIALIZATION (instantiation
)
11656 && !DECL_TEMPLATE_INSTANTIATED (instantiation
))
11658 instantiation
= instantiate_decl (instantiation
,
11660 /*undefined_ok=*/0);
11661 if (DECL_TEMPLATE_INSTANTIATED (instantiation
))
11665 if (DECL_TEMPLATE_SPECIALIZATION (instantiation
)
11666 || DECL_TEMPLATE_INSTANTIATED (instantiation
))
11667 /* If INSTANTIATION has been instantiated, then we don't
11668 need to consider it again in the future. */
11669 *t
= TREE_CHAIN (*t
);
11673 t
= &TREE_CHAIN (*t
);
11677 current_tinst_level
= NULL_TREE
;
11679 last_pending_template
= last
;
11681 while (reconsider
);
11683 input_location
= saved_loc
;
11684 in_system_header
= saved_in_system_header
;
11687 /* Substitute ARGVEC into T, which is a list of initializers for
11688 either base class or a non-static data member. The TREE_PURPOSEs
11689 are DECLs, and the TREE_VALUEs are the initializer values. Used by
11690 instantiate_decl. */
11693 tsubst_initializer_list (tree t
, tree argvec
)
11695 tree inits
= NULL_TREE
;
11697 for (; t
; t
= TREE_CHAIN (t
))
11702 decl
= tsubst_copy (TREE_PURPOSE (t
), argvec
, tf_error
| tf_warning
,
11704 decl
= expand_member_init (decl
);
11705 if (decl
&& !DECL_P (decl
))
11706 in_base_initializer
= 1;
11708 init
= tsubst_expr (TREE_VALUE (t
), argvec
, tf_error
| tf_warning
,
11710 in_base_initializer
= 0;
11714 init
= build_tree_list (decl
, init
);
11715 TREE_CHAIN (init
) = inits
;
11722 /* Set CURRENT_ACCESS_SPECIFIER based on the protection of DECL. */
11725 set_current_access_from_decl (tree decl
)
11727 if (TREE_PRIVATE (decl
))
11728 current_access_specifier
= access_private_node
;
11729 else if (TREE_PROTECTED (decl
))
11730 current_access_specifier
= access_protected_node
;
11732 current_access_specifier
= access_public_node
;
11735 /* Instantiate an enumerated type. TAG is the template type, NEWTAG
11736 is the instantiation (which should have been created with
11737 start_enum) and ARGS are the template arguments to use. */
11740 tsubst_enum (tree tag
, tree newtag
, tree args
)
11744 for (e
= TYPE_VALUES (tag
); e
; e
= TREE_CHAIN (e
))
11749 decl
= TREE_VALUE (e
);
11750 /* Note that in a template enum, the TREE_VALUE is the
11751 CONST_DECL, not the corresponding INTEGER_CST. */
11752 value
= tsubst_expr (DECL_INITIAL (decl
),
11753 args
, tf_error
| tf_warning
,
11756 /* Give this enumeration constant the correct access. */
11757 set_current_access_from_decl (decl
);
11759 /* Actually build the enumerator itself. */
11760 build_enumerator (DECL_NAME (decl
), value
, newtag
);
11763 finish_enum (newtag
);
11764 DECL_SOURCE_LOCATION (TYPE_NAME (newtag
))
11765 = DECL_SOURCE_LOCATION (TYPE_NAME (tag
));
11768 /* DECL is a FUNCTION_DECL that is a template specialization. Return
11769 its type -- but without substituting the innermost set of template
11770 arguments. So, innermost set of template parameters will appear in
11774 get_mostly_instantiated_function_type (tree decl
)
11782 tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
11783 targs
= DECL_TI_ARGS (decl
);
11784 tparms
= DECL_TEMPLATE_PARMS (tmpl
);
11785 parm_depth
= TMPL_PARMS_DEPTH (tparms
);
11787 /* There should be as many levels of arguments as there are levels
11789 gcc_assert (parm_depth
== TMPL_ARGS_DEPTH (targs
));
11791 fn_type
= TREE_TYPE (tmpl
);
11793 if (parm_depth
== 1)
11794 /* No substitution is necessary. */
11798 int i
, save_access_control
;
11801 /* Replace the innermost level of the TARGS with NULL_TREEs to
11802 let tsubst know not to substitute for those parameters. */
11803 partial_args
= make_tree_vec (TREE_VEC_LENGTH (targs
));
11804 for (i
= 1; i
< TMPL_ARGS_DEPTH (targs
); ++i
)
11805 SET_TMPL_ARGS_LEVEL (partial_args
, i
,
11806 TMPL_ARGS_LEVEL (targs
, i
));
11807 SET_TMPL_ARGS_LEVEL (partial_args
,
11808 TMPL_ARGS_DEPTH (targs
),
11809 make_tree_vec (DECL_NTPARMS (tmpl
)));
11811 /* Disable access control as this function is used only during
11813 save_access_control
= flag_access_control
;
11814 flag_access_control
= 0;
11816 ++processing_template_decl
;
11817 /* Now, do the (partial) substitution to figure out the
11818 appropriate function type. */
11819 fn_type
= tsubst (fn_type
, partial_args
, tf_error
, NULL_TREE
);
11820 --processing_template_decl
;
11822 /* Substitute into the template parameters to obtain the real
11823 innermost set of parameters. This step is important if the
11824 innermost set of template parameters contains value
11825 parameters whose types depend on outer template parameters. */
11826 TREE_VEC_LENGTH (partial_args
)--;
11827 tparms
= tsubst_template_parms (tparms
, partial_args
, tf_error
);
11829 flag_access_control
= save_access_control
;
11835 /* Return truthvalue if we're processing a template different from
11836 the last one involved in diagnostics. */
11838 problematic_instantiation_changed (void)
11840 return last_template_error_tick
!= tinst_level_tick
;
11843 /* Remember current template involved in diagnostics. */
11845 record_last_problematic_instantiation (void)
11847 last_template_error_tick
= tinst_level_tick
;
11851 current_instantiation (void)
11853 return current_tinst_level
;
11856 /* [temp.param] Check that template non-type parm TYPE is of an allowable
11857 type. Return zero for ok, nonzero for disallowed. Issue error and
11858 warning messages under control of COMPLAIN. */
11861 invalid_nontype_parm_type_p (tree type
, tsubst_flags_t complain
)
11863 if (INTEGRAL_TYPE_P (type
))
11865 else if (POINTER_TYPE_P (type
))
11867 else if (TYPE_PTR_TO_MEMBER_P (type
))
11869 else if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
)
11871 else if (TREE_CODE (type
) == TYPENAME_TYPE
)
11874 if (complain
& tf_error
)
11875 error ("%q#T is not a valid type for a template constant parameter", type
);
11879 /* Returns TRUE if TYPE is dependent, in the sense of [temp.dep.type].
11880 Assumes that TYPE really is a type, and not the ERROR_MARK_NODE.*/
11883 dependent_type_p_r (tree type
)
11889 A type is dependent if it is:
11891 -- a template parameter. Template template parameters are types
11892 for us (since TYPE_P holds true for them) so we handle
11894 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
11895 || TREE_CODE (type
) == TEMPLATE_TEMPLATE_PARM
)
11897 /* -- a qualified-id with a nested-name-specifier which contains a
11898 class-name that names a dependent type or whose unqualified-id
11899 names a dependent type. */
11900 if (TREE_CODE (type
) == TYPENAME_TYPE
)
11902 /* -- a cv-qualified type where the cv-unqualified type is
11904 type
= TYPE_MAIN_VARIANT (type
);
11905 /* -- a compound type constructed from any dependent type. */
11906 if (TYPE_PTR_TO_MEMBER_P (type
))
11907 return (dependent_type_p (TYPE_PTRMEM_CLASS_TYPE (type
))
11908 || dependent_type_p (TYPE_PTRMEM_POINTED_TO_TYPE
11910 else if (TREE_CODE (type
) == POINTER_TYPE
11911 || TREE_CODE (type
) == REFERENCE_TYPE
)
11912 return dependent_type_p (TREE_TYPE (type
));
11913 else if (TREE_CODE (type
) == FUNCTION_TYPE
11914 || TREE_CODE (type
) == METHOD_TYPE
)
11918 if (dependent_type_p (TREE_TYPE (type
)))
11920 for (arg_type
= TYPE_ARG_TYPES (type
);
11922 arg_type
= TREE_CHAIN (arg_type
))
11923 if (dependent_type_p (TREE_VALUE (arg_type
)))
11927 /* -- an array type constructed from any dependent type or whose
11928 size is specified by a constant expression that is
11929 value-dependent. */
11930 if (TREE_CODE (type
) == ARRAY_TYPE
)
11932 if (TYPE_DOMAIN (type
)
11933 && ((value_dependent_expression_p
11934 (TYPE_MAX_VALUE (TYPE_DOMAIN (type
))))
11935 || (type_dependent_expression_p
11936 (TYPE_MAX_VALUE (TYPE_DOMAIN (type
))))))
11938 return dependent_type_p (TREE_TYPE (type
));
11941 /* -- a template-id in which either the template name is a template
11943 if (TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
11945 /* ... or any of the template arguments is a dependent type or
11946 an expression that is type-dependent or value-dependent. */
11947 else if (CLASS_TYPE_P (type
) && CLASSTYPE_TEMPLATE_INFO (type
)
11948 && (any_dependent_template_arguments_p
11949 (INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type
)))))
11952 /* All TYPEOF_TYPEs are dependent; if the argument of the `typeof'
11953 expression is not type-dependent, then it should already been
11955 if (TREE_CODE (type
) == TYPEOF_TYPE
)
11958 /* The standard does not specifically mention types that are local
11959 to template functions or local classes, but they should be
11960 considered dependent too. For example:
11962 template <int I> void f() {
11967 The size of `E' cannot be known until the value of `I' has been
11968 determined. Therefore, `E' must be considered dependent. */
11969 scope
= TYPE_CONTEXT (type
);
11970 if (scope
&& TYPE_P (scope
))
11971 return dependent_type_p (scope
);
11972 else if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
)
11973 return type_dependent_expression_p (scope
);
11975 /* Other types are non-dependent. */
11979 /* Returns TRUE if TYPE is dependent, in the sense of
11980 [temp.dep.type]. */
11983 dependent_type_p (tree type
)
11985 /* If there are no template parameters in scope, then there can't be
11986 any dependent types. */
11987 if (!processing_template_decl
)
11990 /* If the type is NULL, we have not computed a type for the entity
11991 in question; in that case, the type is dependent. */
11995 /* Erroneous types can be considered non-dependent. */
11996 if (type
== error_mark_node
)
11999 /* If we have not already computed the appropriate value for TYPE,
12001 if (!TYPE_DEPENDENT_P_VALID (type
))
12003 TYPE_DEPENDENT_P (type
) = dependent_type_p_r (type
);
12004 TYPE_DEPENDENT_P_VALID (type
) = 1;
12007 return TYPE_DEPENDENT_P (type
);
12010 /* Returns TRUE if EXPRESSION is dependent, according to CRITERION. */
12013 dependent_scope_ref_p (tree expression
, bool criterion (tree
))
12018 gcc_assert (TREE_CODE (expression
) == SCOPE_REF
);
12020 if (!TYPE_P (TREE_OPERAND (expression
, 0)))
12023 scope
= TREE_OPERAND (expression
, 0);
12024 name
= TREE_OPERAND (expression
, 1);
12028 An id-expression is type-dependent if it contains a
12029 nested-name-specifier that contains a class-name that names a
12031 /* The suggested resolution to Core Issue 2 implies that if the
12032 qualifying type is the current class, then we must peek
12035 && currently_open_class (scope
)
12036 && !criterion (name
))
12038 if (dependent_type_p (scope
))
12044 /* Returns TRUE if the EXPRESSION is value-dependent, in the sense of
12045 [temp.dep.constexpr] */
12048 value_dependent_expression_p (tree expression
)
12050 if (!processing_template_decl
)
12053 /* A name declared with a dependent type. */
12054 if (DECL_P (expression
) && type_dependent_expression_p (expression
))
12057 switch (TREE_CODE (expression
))
12059 case IDENTIFIER_NODE
:
12060 /* A name that has not been looked up -- must be dependent. */
12063 case TEMPLATE_PARM_INDEX
:
12064 /* A non-type template parm. */
12068 /* A non-type template parm. */
12069 if (DECL_TEMPLATE_PARM_P (expression
))
12074 /* A constant with integral or enumeration type and is initialized
12075 with an expression that is value-dependent. */
12076 if (DECL_INITIAL (expression
)
12077 && INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (expression
))
12078 && value_dependent_expression_p (DECL_INITIAL (expression
)))
12082 case DYNAMIC_CAST_EXPR
:
12083 case STATIC_CAST_EXPR
:
12084 case CONST_CAST_EXPR
:
12085 case REINTERPRET_CAST_EXPR
:
12087 /* These expressions are value-dependent if the type to which
12088 the cast occurs is dependent or the expression being casted
12089 is value-dependent. */
12091 tree type
= TREE_TYPE (expression
);
12093 if (dependent_type_p (type
))
12096 /* A functional cast has a list of operands. */
12097 expression
= TREE_OPERAND (expression
, 0);
12100 /* If there are no operands, it must be an expression such
12101 as "int()". This should not happen for aggregate types
12102 because it would form non-constant expressions. */
12103 gcc_assert (INTEGRAL_OR_ENUMERATION_TYPE_P (type
));
12108 if (TREE_CODE (expression
) == TREE_LIST
)
12110 for (; expression
; expression
= TREE_CHAIN (expression
))
12111 if (value_dependent_expression_p (TREE_VALUE (expression
)))
12116 return value_dependent_expression_p (expression
);
12121 /* A `sizeof' expression is value-dependent if the operand is
12123 expression
= TREE_OPERAND (expression
, 0);
12124 if (TYPE_P (expression
))
12125 return dependent_type_p (expression
);
12126 return type_dependent_expression_p (expression
);
12129 return dependent_scope_ref_p (expression
, value_dependent_expression_p
);
12131 case COMPONENT_REF
:
12132 return (value_dependent_expression_p (TREE_OPERAND (expression
, 0))
12133 || value_dependent_expression_p (TREE_OPERAND (expression
, 1)));
12136 /* A CALL_EXPR is value-dependent if any argument is
12137 value-dependent. Why do we have to handle CALL_EXPRs in this
12138 function at all? First, some function calls, those for which
12139 value_dependent_expression_p is true, man appear in constant
12140 expressions. Second, there appear to be bugs which result in
12141 other CALL_EXPRs reaching this point. */
12143 tree function
= TREE_OPERAND (expression
, 0);
12144 tree args
= TREE_OPERAND (expression
, 1);
12146 if (value_dependent_expression_p (function
))
12152 if (TREE_CODE (args
) == TREE_LIST
)
12154 for (; args
; args
= TREE_CHAIN (args
))
12155 if (value_dependent_expression_p (TREE_VALUE (args
)))
12160 return value_dependent_expression_p (args
);
12164 /* A constant expression is value-dependent if any subexpression is
12165 value-dependent. */
12166 switch (TREE_CODE_CLASS (TREE_CODE (expression
)))
12168 case tcc_reference
:
12170 return (value_dependent_expression_p
12171 (TREE_OPERAND (expression
, 0)));
12173 case tcc_comparison
:
12175 return ((value_dependent_expression_p
12176 (TREE_OPERAND (expression
, 0)))
12177 || (value_dependent_expression_p
12178 (TREE_OPERAND (expression
, 1))));
12180 case tcc_expression
:
12183 for (i
= 0; i
< TREE_CODE_LENGTH (TREE_CODE (expression
)); ++i
)
12184 /* In some cases, some of the operands may be missing.
12185 (For example, in the case of PREDECREMENT_EXPR, the
12186 amount to increment by may be missing.) That doesn't
12187 make the expression dependent. */
12188 if (TREE_OPERAND (expression
, i
)
12189 && (value_dependent_expression_p
12190 (TREE_OPERAND (expression
, i
))))
12200 /* The expression is not value-dependent. */
12204 /* Returns TRUE if the EXPRESSION is type-dependent, in the sense of
12205 [temp.dep.expr]. */
12208 type_dependent_expression_p (tree expression
)
12210 if (!processing_template_decl
)
12213 if (expression
== error_mark_node
)
12216 /* An unresolved name is always dependent. */
12217 if (TREE_CODE (expression
) == IDENTIFIER_NODE
)
12220 /* Some expression forms are never type-dependent. */
12221 if (TREE_CODE (expression
) == PSEUDO_DTOR_EXPR
12222 || TREE_CODE (expression
) == SIZEOF_EXPR
12223 || TREE_CODE (expression
) == ALIGNOF_EXPR
12224 || TREE_CODE (expression
) == TYPEID_EXPR
12225 || TREE_CODE (expression
) == DELETE_EXPR
12226 || TREE_CODE (expression
) == VEC_DELETE_EXPR
12227 || TREE_CODE (expression
) == THROW_EXPR
)
12230 /* The types of these expressions depends only on the type to which
12231 the cast occurs. */
12232 if (TREE_CODE (expression
) == DYNAMIC_CAST_EXPR
12233 || TREE_CODE (expression
) == STATIC_CAST_EXPR
12234 || TREE_CODE (expression
) == CONST_CAST_EXPR
12235 || TREE_CODE (expression
) == REINTERPRET_CAST_EXPR
12236 || TREE_CODE (expression
) == CAST_EXPR
)
12237 return dependent_type_p (TREE_TYPE (expression
));
12239 /* The types of these expressions depends only on the type created
12240 by the expression. */
12241 if (TREE_CODE (expression
) == NEW_EXPR
12242 || TREE_CODE (expression
) == VEC_NEW_EXPR
)
12244 /* For NEW_EXPR tree nodes created inside a template, either
12245 the object type itself or a TREE_LIST may appear as the
12247 tree type
= TREE_OPERAND (expression
, 1);
12248 if (TREE_CODE (type
) == TREE_LIST
)
12249 /* This is an array type. We need to check array dimensions
12251 return dependent_type_p (TREE_VALUE (TREE_PURPOSE (type
)))
12252 || value_dependent_expression_p
12253 (TREE_OPERAND (TREE_VALUE (type
), 1));
12255 return dependent_type_p (type
);
12258 if (TREE_CODE (expression
) == SCOPE_REF
12259 && dependent_scope_ref_p (expression
,
12260 type_dependent_expression_p
))
12263 if (TREE_CODE (expression
) == FUNCTION_DECL
12264 && DECL_LANG_SPECIFIC (expression
)
12265 && DECL_TEMPLATE_INFO (expression
)
12266 && (any_dependent_template_arguments_p
12267 (INNERMOST_TEMPLATE_ARGS (DECL_TI_ARGS (expression
)))))
12270 if (TREE_CODE (expression
) == TEMPLATE_DECL
12271 && !DECL_TEMPLATE_TEMPLATE_PARM_P (expression
))
12274 if (TREE_TYPE (expression
) == unknown_type_node
)
12276 if (TREE_CODE (expression
) == ADDR_EXPR
)
12277 return type_dependent_expression_p (TREE_OPERAND (expression
, 0));
12278 if (TREE_CODE (expression
) == COMPONENT_REF
12279 || TREE_CODE (expression
) == OFFSET_REF
)
12281 if (type_dependent_expression_p (TREE_OPERAND (expression
, 0)))
12283 expression
= TREE_OPERAND (expression
, 1);
12284 if (TREE_CODE (expression
) == IDENTIFIER_NODE
)
12287 /* SCOPE_REF with non-null TREE_TYPE is always non-dependent. */
12288 if (TREE_CODE (expression
) == SCOPE_REF
)
12291 if (TREE_CODE (expression
) == BASELINK
)
12292 expression
= BASELINK_FUNCTIONS (expression
);
12294 if (TREE_CODE (expression
) == TEMPLATE_ID_EXPR
)
12296 if (any_dependent_template_arguments_p
12297 (TREE_OPERAND (expression
, 1)))
12299 expression
= TREE_OPERAND (expression
, 0);
12301 gcc_assert (TREE_CODE (expression
) == OVERLOAD
);
12305 if (type_dependent_expression_p (OVL_CURRENT (expression
)))
12307 expression
= OVL_NEXT (expression
);
12312 return (dependent_type_p (TREE_TYPE (expression
)));
12315 /* Returns TRUE if ARGS (a TREE_LIST of arguments to a function call)
12316 contains a type-dependent expression. */
12319 any_type_dependent_arguments_p (tree args
)
12323 tree arg
= TREE_VALUE (args
);
12325 if (type_dependent_expression_p (arg
))
12327 args
= TREE_CHAIN (args
);
12332 /* Returns TRUE if the ARG (a template argument) is dependent. */
12335 dependent_template_arg_p (tree arg
)
12337 if (!processing_template_decl
)
12340 if (TREE_CODE (arg
) == TEMPLATE_DECL
12341 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
12342 return dependent_template_p (arg
);
12343 else if (TYPE_P (arg
))
12344 return dependent_type_p (arg
);
12346 return (type_dependent_expression_p (arg
)
12347 || value_dependent_expression_p (arg
));
12350 /* Returns true if ARGS (a collection of template arguments) contains
12351 any dependent arguments. */
12354 any_dependent_template_arguments_p (tree args
)
12362 for (i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
12364 tree level
= TMPL_ARGS_LEVEL (args
, i
+ 1);
12365 for (j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
12366 if (dependent_template_arg_p (TREE_VEC_ELT (level
, j
)))
12373 /* Returns TRUE if the template TMPL is dependent. */
12376 dependent_template_p (tree tmpl
)
12378 if (TREE_CODE (tmpl
) == OVERLOAD
)
12382 if (dependent_template_p (OVL_FUNCTION (tmpl
)))
12384 tmpl
= OVL_CHAIN (tmpl
);
12389 /* Template template parameters are dependent. */
12390 if (DECL_TEMPLATE_TEMPLATE_PARM_P (tmpl
)
12391 || TREE_CODE (tmpl
) == TEMPLATE_TEMPLATE_PARM
)
12393 /* So are names that have not been looked up. */
12394 if (TREE_CODE (tmpl
) == SCOPE_REF
12395 || TREE_CODE (tmpl
) == IDENTIFIER_NODE
)
12397 /* So are member templates of dependent classes. */
12398 if (TYPE_P (CP_DECL_CONTEXT (tmpl
)))
12399 return dependent_type_p (DECL_CONTEXT (tmpl
));
12403 /* Returns TRUE if the specialization TMPL<ARGS> is dependent. */
12406 dependent_template_id_p (tree tmpl
, tree args
)
12408 return (dependent_template_p (tmpl
)
12409 || any_dependent_template_arguments_p (args
));
12412 /* TYPE is a TYPENAME_TYPE. Returns the ordinary TYPE to which the
12413 TYPENAME_TYPE corresponds. Returns ERROR_MARK_NODE if no such TYPE
12414 can be found. Note that this function peers inside uninstantiated
12415 templates and therefore should be used only in extremely limited
12416 situations. ONLY_CURRENT_P restricts this peering to the currently
12417 open classes hierarchy (which is required when comparing types). */
12420 resolve_typename_type (tree type
, bool only_current_p
)
12428 gcc_assert (TREE_CODE (type
) == TYPENAME_TYPE
);
12430 scope
= TYPE_CONTEXT (type
);
12431 name
= TYPE_IDENTIFIER (type
);
12433 /* If the SCOPE is itself a TYPENAME_TYPE, then we need to resolve
12434 it first before we can figure out what NAME refers to. */
12435 if (TREE_CODE (scope
) == TYPENAME_TYPE
)
12436 scope
= resolve_typename_type (scope
, only_current_p
);
12437 /* If we don't know what SCOPE refers to, then we cannot resolve the
12439 if (scope
== error_mark_node
|| TREE_CODE (scope
) == TYPENAME_TYPE
)
12440 return error_mark_node
;
12441 /* If the SCOPE is a template type parameter, we have no way of
12442 resolving the name. */
12443 if (TREE_CODE (scope
) == TEMPLATE_TYPE_PARM
)
12445 /* If the SCOPE is not the current instantiation, there's no reason
12446 to look inside it. */
12447 if (only_current_p
&& !currently_open_class (scope
))
12448 return error_mark_node
;
12449 /* If SCOPE is a partial instantiation, it will not have a valid
12450 TYPE_FIELDS list, so use the original template. */
12451 scope
= CLASSTYPE_PRIMARY_TEMPLATE_TYPE (scope
);
12452 /* Enter the SCOPE so that name lookup will be resolved as if we
12453 were in the class definition. In particular, SCOPE will no
12454 longer be considered a dependent type. */
12455 pushed_scope
= push_scope (scope
);
12456 /* Look up the declaration. */
12457 decl
= lookup_member (scope
, name
, /*protect=*/0, /*want_type=*/true);
12458 /* Obtain the set of qualifiers applied to the TYPE. */
12459 quals
= cp_type_quals (type
);
12460 /* For a TYPENAME_TYPE like "typename X::template Y<T>", we want to
12461 find a TEMPLATE_DECL. Otherwise, we want to find a TYPE_DECL. */
12463 type
= error_mark_node
;
12464 else if (TREE_CODE (TYPENAME_TYPE_FULLNAME (type
)) == IDENTIFIER_NODE
12465 && TREE_CODE (decl
) == TYPE_DECL
)
12466 type
= TREE_TYPE (decl
);
12467 else if (TREE_CODE (TYPENAME_TYPE_FULLNAME (type
)) == TEMPLATE_ID_EXPR
12468 && DECL_CLASS_TEMPLATE_P (decl
))
12472 /* Obtain the template and the arguments. */
12473 tmpl
= TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type
), 0);
12474 args
= TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type
), 1);
12475 /* Instantiate the template. */
12476 type
= lookup_template_class (tmpl
, args
, NULL_TREE
, NULL_TREE
,
12477 /*entering_scope=*/0, tf_error
| tf_user
);
12480 type
= error_mark_node
;
12481 /* Qualify the resulting type. */
12482 if (type
!= error_mark_node
&& quals
)
12483 type
= cp_build_qualified_type (type
, quals
);
12484 /* Leave the SCOPE. */
12486 pop_scope (pushed_scope
);
12491 /* EXPR is an expression which is not type-dependent. Return a proxy
12492 for EXPR that can be used to compute the types of larger
12493 expressions containing EXPR. */
12496 build_non_dependent_expr (tree expr
)
12500 /* Preserve null pointer constants so that the type of things like
12501 "p == 0" where "p" is a pointer can be determined. */
12502 if (null_ptr_cst_p (expr
))
12504 /* Preserve OVERLOADs; the functions must be available to resolve
12506 inner_expr
= (TREE_CODE (expr
) == ADDR_EXPR
?
12507 TREE_OPERAND (expr
, 0) : expr
);
12508 if (TREE_CODE (inner_expr
) == OVERLOAD
12509 || TREE_CODE (inner_expr
) == FUNCTION_DECL
12510 || TREE_CODE (inner_expr
) == TEMPLATE_DECL
12511 || TREE_CODE (inner_expr
) == TEMPLATE_ID_EXPR
12512 || TREE_CODE (inner_expr
) == OFFSET_REF
)
12514 /* There is no need to return a proxy for a variable. */
12515 if (TREE_CODE (expr
) == VAR_DECL
)
12517 /* Preserve string constants; conversions from string constants to
12518 "char *" are allowed, even though normally a "const char *"
12519 cannot be used to initialize a "char *". */
12520 if (TREE_CODE (expr
) == STRING_CST
)
12522 /* Preserve arithmetic constants, as an optimization -- there is no
12523 reason to create a new node. */
12524 if (TREE_CODE (expr
) == INTEGER_CST
|| TREE_CODE (expr
) == REAL_CST
)
12526 /* Preserve THROW_EXPRs -- all throw-expressions have type "void".
12527 There is at least one place where we want to know that a
12528 particular expression is a throw-expression: when checking a ?:
12529 expression, there are special rules if the second or third
12530 argument is a throw-expression. */
12531 if (TREE_CODE (expr
) == THROW_EXPR
)
12534 if (TREE_CODE (expr
) == COND_EXPR
)
12535 return build3 (COND_EXPR
,
12537 TREE_OPERAND (expr
, 0),
12538 (TREE_OPERAND (expr
, 1)
12539 ? build_non_dependent_expr (TREE_OPERAND (expr
, 1))
12540 : build_non_dependent_expr (TREE_OPERAND (expr
, 0))),
12541 build_non_dependent_expr (TREE_OPERAND (expr
, 2)));
12542 if (TREE_CODE (expr
) == COMPOUND_EXPR
12543 && !COMPOUND_EXPR_OVERLOADED (expr
))
12544 return build2 (COMPOUND_EXPR
,
12546 TREE_OPERAND (expr
, 0),
12547 build_non_dependent_expr (TREE_OPERAND (expr
, 1)));
12549 /* Otherwise, build a NON_DEPENDENT_EXPR.
12551 REFERENCE_TYPEs are not stripped for expressions in templates
12552 because doing so would play havoc with mangling. Consider, for
12555 template <typename T> void f<T& g>() { g(); }
12557 In the body of "f", the expression for "g" will have
12558 REFERENCE_TYPE, even though the standard says that it should
12559 not. The reason is that we must preserve the syntactic form of
12560 the expression so that mangling (say) "f<g>" inside the body of
12561 "f" works out correctly. Therefore, the REFERENCE_TYPE is
12563 return build1 (NON_DEPENDENT_EXPR
, non_reference (TREE_TYPE (expr
)), expr
);
12566 /* ARGS is a TREE_LIST of expressions as arguments to a function call.
12567 Return a new TREE_LIST with the various arguments replaced with
12568 equivalent non-dependent expressions. */
12571 build_non_dependent_args (tree args
)
12576 new_args
= NULL_TREE
;
12577 for (a
= args
; a
; a
= TREE_CHAIN (a
))
12578 new_args
= tree_cons (NULL_TREE
,
12579 build_non_dependent_expr (TREE_VALUE (a
)),
12581 return nreverse (new_args
);
12584 #include "gt-cp-pt.h"