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
89 #define UNIFY_ALLOW_MAX_CORRECTION 128
91 static void push_access_scope (tree
);
92 static void pop_access_scope (tree
);
93 static int resolve_overloaded_unification (tree
, tree
, tree
, tree
,
94 unification_kind_t
, int);
95 static int try_one_overload (tree
, tree
, tree
, tree
, tree
,
96 unification_kind_t
, int, bool);
97 static int unify (tree
, tree
, tree
, tree
, int);
98 static void add_pending_template (tree
);
99 static void reopen_tinst_level (tree
);
100 static tree
classtype_mangled_name (tree
);
101 static char* mangle_class_name_for_template (const char *, tree
, tree
);
102 static tree
tsubst_initializer_list (tree
, tree
);
103 static tree
get_class_bindings (tree
, tree
, tree
);
104 static tree
coerce_template_parms (tree
, tree
, tree
, tsubst_flags_t
, int);
105 static void tsubst_enum (tree
, tree
, tree
);
106 static tree
add_to_template_args (tree
, tree
);
107 static tree
add_outermost_template_args (tree
, tree
);
108 static bool check_instantiated_args (tree
, tree
, tsubst_flags_t
);
109 static int maybe_adjust_types_for_deduction (unification_kind_t
, tree
*, tree
*);
110 static int type_unification_real (tree
, tree
, tree
, tree
,
111 int, unification_kind_t
, int, int);
112 static void note_template_header (int);
113 static tree
convert_nontype_argument_function (tree
, tree
);
114 static tree
convert_nontype_argument (tree
, tree
);
115 static tree
convert_template_argument (tree
, tree
, tree
,
116 tsubst_flags_t
, int, tree
);
117 static tree
get_bindings_overload (tree
, tree
, tree
);
118 static int for_each_template_parm (tree
, tree_fn_t
, void*,
119 struct pointer_set_t
*);
120 static tree
build_template_parm_index (int, int, int, tree
, tree
);
121 static int inline_needs_template_parms (tree
);
122 static void push_inline_template_parms_recursive (tree
, int);
123 static tree
retrieve_local_specialization (tree
);
124 static void register_local_specialization (tree
, tree
);
125 static tree
reduce_template_parm_level (tree
, tree
, int);
126 static int mark_template_parm (tree
, void *);
127 static int template_parm_this_level_p (tree
, void *);
128 static tree
tsubst_friend_function (tree
, tree
);
129 static tree
tsubst_friend_class (tree
, tree
);
130 static int can_complete_type_without_circularity (tree
);
131 static tree
get_bindings (tree
, tree
, tree
);
132 static tree
get_bindings_real (tree
, tree
, tree
, int, int, int);
133 static int template_decl_level (tree
);
134 static int check_cv_quals_for_unify (int, tree
, tree
);
135 static tree
tsubst_template_arg (tree
, tree
, tsubst_flags_t
, tree
);
136 static tree
tsubst_template_args (tree
, tree
, tsubst_flags_t
, tree
);
137 static tree
tsubst_template_parms (tree
, tree
, tsubst_flags_t
);
138 static void regenerate_decl_from_template (tree
, tree
);
139 static tree
most_specialized (tree
, tree
, tree
);
140 static tree
most_specialized_class (tree
, tree
);
141 static int template_class_depth_real (tree
, int);
142 static tree
tsubst_aggr_type (tree
, tree
, tsubst_flags_t
, tree
, int);
143 static tree
tsubst_arg_types (tree
, tree
, tsubst_flags_t
, tree
);
144 static tree
tsubst_function_type (tree
, tree
, tsubst_flags_t
, tree
);
145 static void check_specialization_scope (void);
146 static tree
process_partial_specialization (tree
);
147 static void set_current_access_from_decl (tree
);
148 static void check_default_tmpl_args (tree
, tree
, int, int);
149 static tree
tsubst_call_declarator_parms (tree
, tree
, tsubst_flags_t
, tree
);
150 static tree
get_template_base (tree
, tree
, tree
, tree
);
151 static int verify_class_unification (tree
, tree
, tree
);
152 static tree
try_class_unification (tree
, tree
, tree
, tree
);
153 static int coerce_template_template_parms (tree
, tree
, tsubst_flags_t
,
155 static tree
determine_specialization (tree
, tree
, tree
*, int, int);
156 static int template_args_equal (tree
, tree
);
157 static void tsubst_default_arguments (tree
);
158 static tree
for_each_template_parm_r (tree
*, int *, void *);
159 static tree
copy_default_args_to_explicit_spec_1 (tree
, tree
);
160 static void copy_default_args_to_explicit_spec (tree
);
161 static int invalid_nontype_parm_type_p (tree
, tsubst_flags_t
);
162 static int eq_local_specializations (const void *, const void *);
163 static bool dependent_type_p_r (tree
);
164 static tree
tsubst (tree
, tree
, tsubst_flags_t
, tree
);
165 static tree
tsubst_expr (tree
, tree
, tsubst_flags_t
, tree
);
166 static tree
tsubst_copy (tree
, tree
, tsubst_flags_t
, tree
);
168 /* Make the current scope suitable for access checking when we are
169 processing T. T can be FUNCTION_DECL for instantiated function
170 template, or VAR_DECL for static member variable (need by
171 instantiate_decl). */
174 push_access_scope (tree t
)
176 gcc_assert (TREE_CODE (t
) == FUNCTION_DECL
177 || TREE_CODE (t
) == VAR_DECL
);
179 if (DECL_FRIEND_CONTEXT (t
))
180 push_nested_class (DECL_FRIEND_CONTEXT (t
));
181 else if (DECL_CLASS_SCOPE_P (t
))
182 push_nested_class (DECL_CONTEXT (t
));
184 push_to_top_level ();
186 if (TREE_CODE (t
) == FUNCTION_DECL
)
188 saved_access_scope
= tree_cons
189 (NULL_TREE
, current_function_decl
, saved_access_scope
);
190 current_function_decl
= t
;
194 /* Restore the scope set up by push_access_scope. T is the node we
198 pop_access_scope (tree t
)
200 if (TREE_CODE (t
) == FUNCTION_DECL
)
202 current_function_decl
= TREE_VALUE (saved_access_scope
);
203 saved_access_scope
= TREE_CHAIN (saved_access_scope
);
206 if (DECL_FRIEND_CONTEXT (t
) || DECL_CLASS_SCOPE_P (t
))
209 pop_from_top_level ();
212 /* Do any processing required when DECL (a member template
213 declaration) is finished. Returns the TEMPLATE_DECL corresponding
214 to DECL, unless it is a specialization, in which case the DECL
215 itself is returned. */
218 finish_member_template_decl (tree decl
)
220 if (decl
== error_mark_node
)
221 return error_mark_node
;
223 gcc_assert (DECL_P (decl
));
225 if (TREE_CODE (decl
) == TYPE_DECL
)
229 type
= TREE_TYPE (decl
);
230 if (IS_AGGR_TYPE (type
)
231 && CLASSTYPE_TEMPLATE_INFO (type
)
232 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (type
))
234 tree tmpl
= CLASSTYPE_TI_TEMPLATE (type
);
235 check_member_template (tmpl
);
240 else if (TREE_CODE (decl
) == FIELD_DECL
)
241 error ("data member %qD cannot be a member template", decl
);
242 else if (DECL_TEMPLATE_INFO (decl
))
244 if (!DECL_TEMPLATE_SPECIALIZATION (decl
))
246 check_member_template (DECL_TI_TEMPLATE (decl
));
247 return DECL_TI_TEMPLATE (decl
);
253 error ("invalid member template declaration %qD", decl
);
255 return error_mark_node
;
258 /* Returns the template nesting level of the indicated class TYPE.
268 A<T>::B<U> has depth two, while A<T> has depth one.
269 Both A<T>::B<int> and A<int>::B<U> have depth one, if
270 COUNT_SPECIALIZATIONS is 0 or if they are instantiations, not
273 This function is guaranteed to return 0 if passed NULL_TREE so
274 that, for example, `template_class_depth (current_class_type)' is
278 template_class_depth_real (tree type
, int count_specializations
)
283 type
&& TREE_CODE (type
) != NAMESPACE_DECL
;
284 type
= (TREE_CODE (type
) == FUNCTION_DECL
)
285 ? CP_DECL_CONTEXT (type
) : TYPE_CONTEXT (type
))
287 if (TREE_CODE (type
) != FUNCTION_DECL
)
289 if (CLASSTYPE_TEMPLATE_INFO (type
)
290 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (type
))
291 && ((count_specializations
292 && CLASSTYPE_TEMPLATE_SPECIALIZATION (type
))
293 || uses_template_parms (CLASSTYPE_TI_ARGS (type
))))
298 if (DECL_TEMPLATE_INFO (type
)
299 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (type
))
300 && ((count_specializations
301 && DECL_TEMPLATE_SPECIALIZATION (type
))
302 || uses_template_parms (DECL_TI_ARGS (type
))))
310 /* Returns the template nesting level of the indicated class TYPE.
311 Like template_class_depth_real, but instantiations do not count in
315 template_class_depth (tree type
)
317 return template_class_depth_real (type
, /*count_specializations=*/0);
320 /* Returns 1 if processing DECL as part of do_pending_inlines
321 needs us to push template parms. */
324 inline_needs_template_parms (tree decl
)
326 if (! DECL_TEMPLATE_INFO (decl
))
329 return (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (most_general_template (decl
)))
330 > (processing_template_decl
+ DECL_TEMPLATE_SPECIALIZATION (decl
)));
333 /* Subroutine of maybe_begin_member_template_processing.
334 Push the template parms in PARMS, starting from LEVELS steps into the
335 chain, and ending at the beginning, since template parms are listed
339 push_inline_template_parms_recursive (tree parmlist
, int levels
)
341 tree parms
= TREE_VALUE (parmlist
);
345 push_inline_template_parms_recursive (TREE_CHAIN (parmlist
), levels
- 1);
347 ++processing_template_decl
;
348 current_template_parms
349 = tree_cons (size_int (processing_template_decl
),
350 parms
, current_template_parms
);
351 TEMPLATE_PARMS_FOR_INLINE (current_template_parms
) = 1;
353 begin_scope (TREE_VEC_LENGTH (parms
) ? sk_template_parms
: sk_template_spec
,
355 for (i
= 0; i
< TREE_VEC_LENGTH (parms
); ++i
)
357 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
358 gcc_assert (DECL_P (parm
));
360 switch (TREE_CODE (parm
))
369 /* Make a CONST_DECL as is done in process_template_parm.
370 It is ugly that we recreate this here; the original
371 version built in process_template_parm is no longer
373 tree decl
= build_decl (CONST_DECL
, DECL_NAME (parm
),
375 DECL_ARTIFICIAL (decl
) = 1;
376 TREE_CONSTANT (decl
) = 1;
377 TREE_INVARIANT (decl
) = 1;
378 TREE_READONLY (decl
) = 1;
379 DECL_INITIAL (decl
) = DECL_INITIAL (parm
);
380 SET_DECL_TEMPLATE_PARM_P (decl
);
391 /* Restore the template parameter context for a member template or
392 a friend template defined in a class definition. */
395 maybe_begin_member_template_processing (tree decl
)
400 if (inline_needs_template_parms (decl
))
402 parms
= DECL_TEMPLATE_PARMS (most_general_template (decl
));
403 levels
= TMPL_PARMS_DEPTH (parms
) - processing_template_decl
;
405 if (DECL_TEMPLATE_SPECIALIZATION (decl
))
408 parms
= TREE_CHAIN (parms
);
411 push_inline_template_parms_recursive (parms
, levels
);
414 /* Remember how many levels of template parameters we pushed so that
415 we can pop them later. */
416 if (!inline_parm_levels
)
417 VARRAY_INT_INIT (inline_parm_levels
, 4, "inline_parm_levels");
418 if (inline_parm_levels_used
== inline_parm_levels
->num_elements
)
419 VARRAY_GROW (inline_parm_levels
, 2 * inline_parm_levels_used
);
420 VARRAY_INT (inline_parm_levels
, inline_parm_levels_used
) = levels
;
421 ++inline_parm_levels_used
;
424 /* Undo the effects of begin_member_template_processing. */
427 maybe_end_member_template_processing (void)
431 if (!inline_parm_levels_used
)
434 --inline_parm_levels_used
;
436 i
< VARRAY_INT (inline_parm_levels
, inline_parm_levels_used
);
439 --processing_template_decl
;
440 current_template_parms
= TREE_CHAIN (current_template_parms
);
445 /* Return a new template argument vector which contains all of ARGS,
446 but has as its innermost set of arguments the EXTRA_ARGS. */
449 add_to_template_args (tree args
, tree extra_args
)
456 extra_depth
= TMPL_ARGS_DEPTH (extra_args
);
457 new_args
= make_tree_vec (TMPL_ARGS_DEPTH (args
) + extra_depth
);
459 for (i
= 1; i
<= TMPL_ARGS_DEPTH (args
); ++i
)
460 SET_TMPL_ARGS_LEVEL (new_args
, i
, TMPL_ARGS_LEVEL (args
, i
));
462 for (j
= 1; j
<= extra_depth
; ++j
, ++i
)
463 SET_TMPL_ARGS_LEVEL (new_args
, i
, TMPL_ARGS_LEVEL (extra_args
, j
));
468 /* Like add_to_template_args, but only the outermost ARGS are added to
469 the EXTRA_ARGS. In particular, all but TMPL_ARGS_DEPTH
470 (EXTRA_ARGS) levels are added. This function is used to combine
471 the template arguments from a partial instantiation with the
472 template arguments used to attain the full instantiation from the
473 partial instantiation. */
476 add_outermost_template_args (tree args
, tree extra_args
)
480 /* If there are more levels of EXTRA_ARGS than there are ARGS,
481 something very fishy is going on. */
482 gcc_assert (TMPL_ARGS_DEPTH (args
) >= TMPL_ARGS_DEPTH (extra_args
));
484 /* If *all* the new arguments will be the EXTRA_ARGS, just return
486 if (TMPL_ARGS_DEPTH (args
) == TMPL_ARGS_DEPTH (extra_args
))
489 /* For the moment, we make ARGS look like it contains fewer levels. */
490 TREE_VEC_LENGTH (args
) -= TMPL_ARGS_DEPTH (extra_args
);
492 new_args
= add_to_template_args (args
, extra_args
);
494 /* Now, we restore ARGS to its full dimensions. */
495 TREE_VEC_LENGTH (args
) += TMPL_ARGS_DEPTH (extra_args
);
500 /* Return the N levels of innermost template arguments from the ARGS. */
503 get_innermost_template_args (tree args
, int n
)
511 /* If N is 1, just return the innermost set of template arguments. */
513 return TMPL_ARGS_LEVEL (args
, TMPL_ARGS_DEPTH (args
));
515 /* If we're not removing anything, just return the arguments we were
517 extra_levels
= TMPL_ARGS_DEPTH (args
) - n
;
518 gcc_assert (extra_levels
>= 0);
519 if (extra_levels
== 0)
522 /* Make a new set of arguments, not containing the outer arguments. */
523 new_args
= make_tree_vec (n
);
524 for (i
= 1; i
<= n
; ++i
)
525 SET_TMPL_ARGS_LEVEL (new_args
, i
,
526 TMPL_ARGS_LEVEL (args
, i
+ extra_levels
));
531 /* We've got a template header coming up; push to a new level for storing
535 begin_template_parm_list (void)
537 /* We use a non-tag-transparent scope here, which causes pushtag to
538 put tags in this scope, rather than in the enclosing class or
539 namespace scope. This is the right thing, since we want
540 TEMPLATE_DECLS, and not TYPE_DECLS for template classes. For a
541 global template class, push_template_decl handles putting the
542 TEMPLATE_DECL into top-level scope. For a nested template class,
545 template <class T> struct S1 {
546 template <class T> struct S2 {};
549 pushtag contains special code to call pushdecl_with_scope on the
550 TEMPLATE_DECL for S2. */
551 begin_scope (sk_template_parms
, NULL
);
552 ++processing_template_decl
;
553 ++processing_template_parmlist
;
554 note_template_header (0);
557 /* This routine is called when a specialization is declared. If it is
558 invalid to declare a specialization here, an error is reported. */
561 check_specialization_scope (void)
563 tree scope
= current_scope ();
567 An explicit specialization shall be declared in the namespace of
568 which the template is a member, or, for member templates, in the
569 namespace of which the enclosing class or enclosing class
570 template is a member. An explicit specialization of a member
571 function, member class or static data member of a class template
572 shall be declared in the namespace of which the class template
574 if (scope
&& TREE_CODE (scope
) != NAMESPACE_DECL
)
575 error ("explicit specialization in non-namespace scope %qD", scope
);
579 In an explicit specialization declaration for a member of a class
580 template or a member template that appears in namespace scope,
581 the member template and some of its enclosing class templates may
582 remain unspecialized, except that the declaration shall not
583 explicitly specialize a class member template if its enclosing
584 class templates are not explicitly specialized as well. */
585 if (current_template_parms
)
586 error ("enclosing class templates are not explicitly specialized");
589 /* We've just seen template <>. */
592 begin_specialization (void)
594 begin_scope (sk_template_spec
, NULL
);
595 note_template_header (1);
596 check_specialization_scope ();
599 /* Called at then end of processing a declaration preceded by
603 end_specialization (void)
606 reset_specialization ();
609 /* Any template <>'s that we have seen thus far are not referring to a
610 function specialization. */
613 reset_specialization (void)
615 processing_specialization
= 0;
616 template_header_count
= 0;
619 /* We've just seen a template header. If SPECIALIZATION is nonzero,
620 it was of the form template <>. */
623 note_template_header (int specialization
)
625 processing_specialization
= specialization
;
626 template_header_count
++;
629 /* We're beginning an explicit instantiation. */
632 begin_explicit_instantiation (void)
634 gcc_assert (!processing_explicit_instantiation
);
635 processing_explicit_instantiation
= true;
640 end_explicit_instantiation (void)
642 gcc_assert (processing_explicit_instantiation
);
643 processing_explicit_instantiation
= false;
646 /* A explicit specialization or partial specialization TMPL is being
647 declared. Check that the namespace in which the specialization is
648 occurring is permissible. Returns false iff it is invalid to
649 specialize TMPL in the current namespace. */
652 check_specialization_namespace (tree tmpl
)
654 tree tpl_ns
= decl_namespace_context (tmpl
);
658 An explicit specialization shall be declared in the namespace of
659 which the template is a member, or, for member templates, in the
660 namespace of which the enclosing class or enclosing class
661 template is a member. An explicit specialization of a member
662 function, member class or static data member of a class template
663 shall be declared in the namespace of which the class template is
665 if (is_associated_namespace (current_namespace
, tpl_ns
))
666 /* Same or super-using namespace. */
670 pedwarn ("specialization of %qD in different namespace", tmpl
);
671 cp_pedwarn_at (" from definition of %q#D", tmpl
);
676 /* The TYPE is being declared. If it is a template type, that means it
677 is a partial specialization. Do appropriate error-checking. */
680 maybe_process_partial_specialization (tree type
)
682 /* TYPE maybe an ERROR_MARK_NODE. */
683 tree context
= TYPE_P (type
) ? TYPE_CONTEXT (type
) : NULL_TREE
;
685 if (CLASS_TYPE_P (type
) && CLASSTYPE_USE_TEMPLATE (type
))
687 /* This is for ordinary explicit specialization and partial
688 specialization of a template class such as:
690 template <> class C<int>;
694 template <class T> class C<T*>;
696 Make sure that `C<int>' and `C<T*>' are implicit instantiations. */
698 if (CLASSTYPE_IMPLICIT_INSTANTIATION (type
)
699 && !COMPLETE_TYPE_P (type
))
701 check_specialization_namespace (CLASSTYPE_TI_TEMPLATE (type
));
702 SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (type
);
703 if (processing_template_decl
)
704 push_template_decl (TYPE_MAIN_DECL (type
));
706 else if (CLASSTYPE_TEMPLATE_INSTANTIATION (type
))
707 error ("specialization of %qT after instantiation", type
);
709 else if (CLASS_TYPE_P (type
)
710 && !CLASSTYPE_USE_TEMPLATE (type
)
711 && CLASSTYPE_TEMPLATE_INFO (type
)
712 && context
&& CLASS_TYPE_P (context
)
713 && CLASSTYPE_TEMPLATE_INFO (context
))
715 /* This is for an explicit specialization of member class
716 template according to [temp.expl.spec/18]:
718 template <> template <class U> class C<int>::D;
720 The context `C<int>' must be an implicit instantiation.
721 Otherwise this is just a member class template declared
724 template <> class C<int> { template <class U> class D; };
725 template <> template <class U> class C<int>::D;
727 In the first case, `C<int>::D' is a specialization of `C<T>::D'
728 while in the second case, `C<int>::D' is a primary template
729 and `C<T>::D' may not exist. */
731 if (CLASSTYPE_IMPLICIT_INSTANTIATION (context
)
732 && !COMPLETE_TYPE_P (type
))
736 if (current_namespace
737 != decl_namespace_context (CLASSTYPE_TI_TEMPLATE (type
)))
739 pedwarn ("specializing %q#T in different namespace", type
);
740 cp_pedwarn_at (" from definition of %q#D",
741 CLASSTYPE_TI_TEMPLATE (type
));
744 /* Check for invalid specialization after instantiation:
746 template <> template <> class C<int>::D<int>;
747 template <> template <class U> class C<int>::D; */
749 for (t
= DECL_TEMPLATE_INSTANTIATIONS
750 (most_general_template (CLASSTYPE_TI_TEMPLATE (type
)));
751 t
; t
= TREE_CHAIN (t
))
752 if (TREE_VALUE (t
) != type
753 && TYPE_CONTEXT (TREE_VALUE (t
)) == context
)
754 error ("specialization %qT after instantiation %qT",
755 type
, TREE_VALUE (t
));
757 /* Mark TYPE as a specialization. And as a result, we only
758 have one level of template argument for the innermost
760 SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (type
);
761 CLASSTYPE_TI_ARGS (type
)
762 = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type
));
765 else if (processing_specialization
)
766 error ("explicit specialization of non-template %qT", type
);
769 /* Returns nonzero if we can optimize the retrieval of specializations
770 for TMPL, a TEMPLATE_DECL. In particular, for such a template, we
771 do not use DECL_TEMPLATE_SPECIALIZATIONS at all. */
774 optimize_specialization_lookup_p (tree tmpl
)
776 return (DECL_FUNCTION_TEMPLATE_P (tmpl
)
777 && DECL_CLASS_SCOPE_P (tmpl
)
778 /* DECL_CLASS_SCOPE_P holds of T::f even if T is a template
780 && CLASS_TYPE_P (DECL_CONTEXT (tmpl
))
781 /* The optimized lookup depends on the fact that the
782 template arguments for the member function template apply
783 purely to the containing class, which is not true if the
784 containing class is an explicit or partial
786 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (tmpl
))
787 && !DECL_MEMBER_TEMPLATE_P (tmpl
)
788 && !DECL_CONV_FN_P (tmpl
)
789 /* It is possible to have a template that is not a member
790 template and is not a member of a template class:
792 template <typename T>
793 struct S { friend A::f(); };
795 Here, the friend function is a template, but the context does
796 not have template information. The optimized lookup relies
797 on having ARGS be the template arguments for both the class
798 and the function template. */
799 && !DECL_FRIEND_P (DECL_TEMPLATE_RESULT (tmpl
)));
802 /* Retrieve the specialization (in the sense of [temp.spec] - a
803 specialization is either an instantiation or an explicit
804 specialization) of TMPL for the given template ARGS. If there is
805 no such specialization, return NULL_TREE. The ARGS are a vector of
806 arguments, or a vector of vectors of arguments, in the case of
807 templates with more than one level of parameters.
809 If TMPL is a type template and CLASS_SPECIALIZATIONS_P is true,
810 then we search for a partial specialization matching ARGS. This
811 parameter is ignored if TMPL is not a class template. */
814 retrieve_specialization (tree tmpl
, tree args
,
815 bool class_specializations_p
)
817 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
);
819 /* There should be as many levels of arguments as there are
820 levels of parameters. */
821 gcc_assert (TMPL_ARGS_DEPTH (args
)
822 == TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
)));
824 if (optimize_specialization_lookup_p (tmpl
))
827 tree class_specialization
;
832 /* The template arguments actually apply to the containing
833 class. Find the class specialization with those
835 class_template
= CLASSTYPE_TI_TEMPLATE (DECL_CONTEXT (tmpl
));
837 = retrieve_specialization (class_template
, args
,
838 /*class_specializations_p=*/false);
839 if (!class_specialization
)
841 /* Now, find the appropriate entry in the CLASSTYPE_METHOD_VEC
842 for the specialization. */
843 idx
= class_method_index_for_fn (class_specialization
, tmpl
);
846 /* Iterate through the methods with the indicated name, looking
847 for the one that has an instance of TMPL. */
848 methods
= CLASSTYPE_METHOD_VEC (class_specialization
);
849 for (fns
= VEC_index (tree
, methods
, idx
); fns
; fns
= OVL_NEXT (fns
))
851 tree fn
= OVL_CURRENT (fns
);
852 if (DECL_TEMPLATE_INFO (fn
) && DECL_TI_TEMPLATE (fn
) == tmpl
)
862 /* Class templates store their instantiations on the
863 DECL_TEMPLATE_INSTANTIATIONS list; other templates use the
864 DECL_TEMPLATE_SPECIALIZATIONS list. */
865 if (!class_specializations_p
866 && TREE_CODE (DECL_TEMPLATE_RESULT (tmpl
)) == TYPE_DECL
)
867 sp
= &DECL_TEMPLATE_INSTANTIATIONS (tmpl
);
869 sp
= &DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
871 /* Iterate through the list until we find a matching template. */
872 while (*sp
!= NULL_TREE
)
876 if (comp_template_args (TREE_PURPOSE (spec
), args
))
878 /* Use the move-to-front heuristic to speed up future
882 *sp
= TREE_CHAIN (*sp
);
883 TREE_CHAIN (spec
) = *head
;
886 return TREE_VALUE (spec
);
888 sp
= &TREE_CHAIN (spec
);
895 /* Like retrieve_specialization, but for local declarations. */
898 retrieve_local_specialization (tree tmpl
)
900 tree spec
= htab_find_with_hash (local_specializations
, tmpl
,
901 htab_hash_pointer (tmpl
));
902 return spec
? TREE_PURPOSE (spec
) : NULL_TREE
;
905 /* Returns nonzero iff DECL is a specialization of TMPL. */
908 is_specialization_of (tree decl
, tree tmpl
)
912 if (TREE_CODE (decl
) == FUNCTION_DECL
)
916 t
= DECL_TEMPLATE_INFO (t
) ? DECL_TI_TEMPLATE (t
) : NULL_TREE
)
922 gcc_assert (TREE_CODE (decl
) == TYPE_DECL
);
924 for (t
= TREE_TYPE (decl
);
926 t
= CLASSTYPE_USE_TEMPLATE (t
)
927 ? TREE_TYPE (CLASSTYPE_TI_TEMPLATE (t
)) : NULL_TREE
)
928 if (same_type_ignoring_top_level_qualifiers_p (t
, TREE_TYPE (tmpl
)))
935 /* Returns nonzero iff DECL is a specialization of friend declaration
936 FRIEND according to [temp.friend]. */
939 is_specialization_of_friend (tree decl
, tree
friend)
941 bool need_template
= true;
944 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
945 || TREE_CODE (decl
) == TYPE_DECL
);
947 /* For [temp.friend/6] when FRIEND is an ordinary member function
948 of a template class, we want to check if DECL is a specialization
950 if (TREE_CODE (friend) == FUNCTION_DECL
951 && DECL_TEMPLATE_INFO (friend)
952 && !DECL_USE_TEMPLATE (friend))
954 /* We want a TEMPLATE_DECL for `is_specialization_of'. */
955 friend = DECL_TI_TEMPLATE (friend);
956 need_template
= false;
958 else if (TREE_CODE (friend) == TEMPLATE_DECL
959 && !PRIMARY_TEMPLATE_P (friend))
960 need_template
= false;
962 /* There is nothing to do if this is not a template friend. */
963 if (TREE_CODE (friend) != TEMPLATE_DECL
)
966 if (is_specialization_of (decl
, friend))
970 A member of a class template may be declared to be a friend of a
971 non-template class. In this case, the corresponding member of
972 every specialization of the class template is a friend of the
973 class granting friendship.
975 For example, given a template friend declaration
977 template <class T> friend void A<T>::f();
979 the member function below is considered a friend
981 template <> struct A<int> {
985 For this type of template friend, TEMPLATE_DEPTH below will be
986 nonzero. To determine if DECL is a friend of FRIEND, we first
987 check if the enclosing class is a specialization of another. */
989 template_depth
= template_class_depth (DECL_CONTEXT (friend));
991 && DECL_CLASS_SCOPE_P (decl
)
992 && is_specialization_of (TYPE_NAME (DECL_CONTEXT (decl
)),
993 CLASSTYPE_TI_TEMPLATE (DECL_CONTEXT (friend))))
995 /* Next, we check the members themselves. In order to handle
996 a few tricky cases, such as when FRIEND's are
998 template <class T> friend void A<T>::g(T t);
999 template <class T> template <T t> friend void A<T>::h();
1003 void A<int>::g(int);
1004 template <int> void A<int>::h();
1006 we need to figure out ARGS, the template arguments from
1007 the context of DECL. This is required for template substitution
1008 of `T' in the function parameter of `g' and template parameter
1009 of `h' in the above examples. Here ARGS corresponds to `int'. */
1011 tree context
= DECL_CONTEXT (decl
);
1012 tree args
= NULL_TREE
;
1013 int current_depth
= 0;
1015 while (current_depth
< template_depth
)
1017 if (CLASSTYPE_TEMPLATE_INFO (context
))
1019 if (current_depth
== 0)
1020 args
= TYPE_TI_ARGS (context
);
1022 args
= add_to_template_args (TYPE_TI_ARGS (context
), args
);
1025 context
= TYPE_CONTEXT (context
);
1028 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1033 tree friend_args_type
;
1034 tree decl_args_type
;
1036 /* Make sure that both DECL and FRIEND are templates or
1038 is_template
= DECL_TEMPLATE_INFO (decl
)
1039 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl
));
1040 if (need_template
^ is_template
)
1042 else if (is_template
)
1044 /* If both are templates, check template parameter list. */
1046 = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend),
1048 if (!comp_template_parms
1049 (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (decl
)),
1053 decl_type
= TREE_TYPE (DECL_TI_TEMPLATE (decl
));
1056 decl_type
= TREE_TYPE (decl
);
1058 friend_type
= tsubst_function_type (TREE_TYPE (friend), args
,
1059 tf_none
, NULL_TREE
);
1060 if (friend_type
== error_mark_node
)
1063 /* Check if return types match. */
1064 if (!same_type_p (TREE_TYPE (decl_type
), TREE_TYPE (friend_type
)))
1067 /* Check if function parameter types match, ignoring the
1068 `this' parameter. */
1069 friend_args_type
= TYPE_ARG_TYPES (friend_type
);
1070 decl_args_type
= TYPE_ARG_TYPES (decl_type
);
1071 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (friend))
1072 friend_args_type
= TREE_CHAIN (friend_args_type
);
1073 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
1074 decl_args_type
= TREE_CHAIN (decl_args_type
);
1076 return compparms (decl_args_type
, friend_args_type
);
1080 /* DECL is a TYPE_DECL */
1082 tree decl_type
= TREE_TYPE (decl
);
1084 /* Make sure that both DECL and FRIEND are templates or
1087 = CLASSTYPE_TEMPLATE_INFO (decl_type
)
1088 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (decl_type
));
1090 if (need_template
^ is_template
)
1092 else if (is_template
)
1095 /* If both are templates, check the name of the two
1096 TEMPLATE_DECL's first because is_friend didn't. */
1097 if (DECL_NAME (CLASSTYPE_TI_TEMPLATE (decl_type
))
1098 != DECL_NAME (friend))
1101 /* Now check template parameter list. */
1103 = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend),
1105 return comp_template_parms
1106 (DECL_TEMPLATE_PARMS (CLASSTYPE_TI_TEMPLATE (decl_type
)),
1110 return (DECL_NAME (decl
)
1111 == DECL_NAME (friend));
1117 /* Register the specialization SPEC as a specialization of TMPL with
1118 the indicated ARGS. Returns SPEC, or an equivalent prior
1119 declaration, if available. */
1122 register_specialization (tree spec
, tree tmpl
, tree args
)
1126 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
);
1128 if (TREE_CODE (spec
) == FUNCTION_DECL
1129 && uses_template_parms (DECL_TI_ARGS (spec
)))
1130 /* This is the FUNCTION_DECL for a partial instantiation. Don't
1131 register it; we want the corresponding TEMPLATE_DECL instead.
1132 We use `uses_template_parms (DECL_TI_ARGS (spec))' rather than
1133 the more obvious `uses_template_parms (spec)' to avoid problems
1134 with default function arguments. In particular, given
1135 something like this:
1137 template <class T> void f(T t1, T t = T())
1139 the default argument expression is not substituted for in an
1140 instantiation unless and until it is actually needed. */
1143 /* There should be as many levels of arguments as there are
1144 levels of parameters. */
1145 gcc_assert (TMPL_ARGS_DEPTH (args
)
1146 == TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
)));
1148 fn
= retrieve_specialization (tmpl
, args
,
1149 /*class_specializations_p=*/false);
1150 /* We can sometimes try to re-register a specialization that we've
1151 already got. In particular, regenerate_decl_from_template calls
1152 duplicate_decls which will update the specialization list. But,
1153 we'll still get called again here anyhow. It's more convenient
1154 to simply allow this than to try to prevent it. */
1157 else if (fn
&& DECL_TEMPLATE_SPECIALIZATION (spec
))
1159 if (DECL_TEMPLATE_INSTANTIATION (fn
))
1162 || DECL_EXPLICIT_INSTANTIATION (fn
))
1164 error ("specialization of %qD after instantiation",
1170 /* This situation should occur only if the first
1171 specialization is an implicit instantiation, the
1172 second is an explicit specialization, and the
1173 implicit instantiation has not yet been used. That
1174 situation can occur if we have implicitly
1175 instantiated a member function and then specialized
1178 We can also wind up here if a friend declaration that
1179 looked like an instantiation turns out to be a
1182 template <class T> void foo(T);
1183 class S { friend void foo<>(int) };
1184 template <> void foo(int);
1186 We transform the existing DECL in place so that any
1187 pointers to it become pointers to the updated
1190 If there was a definition for the template, but not
1191 for the specialization, we want this to look as if
1192 there were no definition, and vice versa. */
1193 DECL_INITIAL (fn
) = NULL_TREE
;
1194 duplicate_decls (spec
, fn
);
1199 else if (DECL_TEMPLATE_SPECIALIZATION (fn
))
1201 if (!duplicate_decls (spec
, fn
) && DECL_INITIAL (spec
))
1202 /* Dup decl failed, but this is a new definition. Set the
1203 line number so any errors match this new
1205 DECL_SOURCE_LOCATION (fn
) = DECL_SOURCE_LOCATION (spec
);
1211 /* A specialization must be declared in the same namespace as the
1212 template it is specializing. */
1213 if (DECL_TEMPLATE_SPECIALIZATION (spec
)
1214 && !check_specialization_namespace (tmpl
))
1215 DECL_CONTEXT (spec
) = decl_namespace_context (tmpl
);
1217 if (!optimize_specialization_lookup_p (tmpl
))
1218 DECL_TEMPLATE_SPECIALIZATIONS (tmpl
)
1219 = tree_cons (args
, spec
, DECL_TEMPLATE_SPECIALIZATIONS (tmpl
));
1224 /* Unregister the specialization SPEC as a specialization of TMPL.
1225 Replace it with NEW_SPEC, if NEW_SPEC is non-NULL. Returns true
1226 if the SPEC was listed as a specialization of TMPL. */
1229 reregister_specialization (tree spec
, tree tmpl
, tree new_spec
)
1233 for (s
= &DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
1235 s
= &TREE_CHAIN (*s
))
1236 if (TREE_VALUE (*s
) == spec
)
1239 *s
= TREE_CHAIN (*s
);
1241 TREE_VALUE (*s
) = new_spec
;
1248 /* Compare an entry in the local specializations hash table P1 (which
1249 is really a pointer to a TREE_LIST) with P2 (which is really a
1253 eq_local_specializations (const void *p1
, const void *p2
)
1255 return TREE_VALUE ((tree
) p1
) == (tree
) p2
;
1258 /* Hash P1, an entry in the local specializations table. */
1261 hash_local_specialization (const void* p1
)
1263 return htab_hash_pointer (TREE_VALUE ((tree
) p1
));
1266 /* Like register_specialization, but for local declarations. We are
1267 registering SPEC, an instantiation of TMPL. */
1270 register_local_specialization (tree spec
, tree tmpl
)
1274 slot
= htab_find_slot_with_hash (local_specializations
, tmpl
,
1275 htab_hash_pointer (tmpl
), INSERT
);
1276 *slot
= build_tree_list (spec
, tmpl
);
1279 /* Print the list of candidate FNS in an error message. */
1282 print_candidates (tree fns
)
1286 const char *str
= "candidates are:";
1288 for (fn
= fns
; fn
!= NULL_TREE
; fn
= TREE_CHAIN (fn
))
1292 for (f
= TREE_VALUE (fn
); f
; f
= OVL_NEXT (f
))
1293 cp_error_at ("%s %+#D", str
, OVL_CURRENT (f
));
1298 /* Returns the template (one of the functions given by TEMPLATE_ID)
1299 which can be specialized to match the indicated DECL with the
1300 explicit template args given in TEMPLATE_ID. The DECL may be
1301 NULL_TREE if none is available. In that case, the functions in
1302 TEMPLATE_ID are non-members.
1304 If NEED_MEMBER_TEMPLATE is nonzero the function is known to be a
1305 specialization of a member template.
1307 The TEMPLATE_COUNT is the number of references to qualifying
1308 template classes that appeared in the name of the function. See
1309 check_explicit_specialization for a more accurate description.
1311 The template args (those explicitly specified and those deduced)
1312 are output in a newly created vector *TARGS_OUT.
1314 If it is impossible to determine the result, an error message is
1315 issued. The error_mark_node is returned to indicate failure. */
1318 determine_specialization (tree template_id
,
1321 int need_member_template
,
1326 tree explicit_targs
;
1327 tree candidates
= NULL_TREE
;
1328 tree templates
= NULL_TREE
;
1330 struct cp_binding_level
*b
;
1332 *targs_out
= NULL_TREE
;
1334 if (template_id
== error_mark_node
)
1335 return error_mark_node
;
1337 fns
= TREE_OPERAND (template_id
, 0);
1338 explicit_targs
= TREE_OPERAND (template_id
, 1);
1340 if (fns
== error_mark_node
)
1341 return error_mark_node
;
1343 /* Check for baselinks. */
1344 if (BASELINK_P (fns
))
1345 fns
= BASELINK_FUNCTIONS (fns
);
1347 if (!is_overloaded_fn (fns
))
1349 error ("%qD is not a function template", fns
);
1350 return error_mark_node
;
1353 /* Count the number of template headers specified for this
1356 for (b
= current_binding_level
;
1357 b
->kind
== sk_template_parms
;
1361 for (; fns
; fns
= OVL_NEXT (fns
))
1363 tree fn
= OVL_CURRENT (fns
);
1365 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
1367 tree decl_arg_types
;
1370 /* DECL might be a specialization of FN. */
1372 /* Adjust the type of DECL in case FN is a static member. */
1373 decl_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
1374 if (DECL_STATIC_FUNCTION_P (fn
)
1375 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
1376 decl_arg_types
= TREE_CHAIN (decl_arg_types
);
1378 /* Check that the number of function parameters matches.
1380 template <class T> void f(int i = 0);
1381 template <> void f<int>();
1382 The specialization f<int> is invalid but is not caught
1383 by get_bindings below. */
1385 fn_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
1386 if (list_length (fn_arg_types
) != list_length (decl_arg_types
))
1389 /* For a non-static member function, we need to make sure that
1390 the const qualification is the same. This can be done by
1391 checking the 'this' in the argument list. */
1392 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
1393 && !same_type_p (TREE_VALUE (fn_arg_types
),
1394 TREE_VALUE (decl_arg_types
)))
1397 /* In case of explicit specialization, we need to check if
1398 the number of template headers appearing in the specialization
1399 is correct. This is usually done in check_explicit_specialization,
1400 but the check done there cannot be exhaustive when specializing
1401 member functions. Consider the following code:
1403 template <> void A<int>::f(int);
1404 template <> template <> void A<int>::f(int);
1406 Assuming that A<int> is not itself an explicit specialization
1407 already, the first line specializes "f" which is a non-template
1408 member function, whilst the second line specializes "f" which
1409 is a template member function. So both lines are syntactically
1410 correct, and check_explicit_specialization does not reject
1413 Here, we can do better, as we are matching the specialization
1414 against the declarations. We count the number of template
1415 headers, and we check if they match TEMPLATE_COUNT + 1
1416 (TEMPLATE_COUNT is the number of qualifying template classes,
1417 plus there must be another header for the member template
1420 Notice that if header_count is zero, this is not a
1421 specialization but rather a template instantiation, so there
1422 is no check we can perform here. */
1423 if (header_count
&& header_count
!= template_count
+ 1)
1426 /* Check that the number of template arguments at the
1427 innermost level for DECL is the same as for FN. */
1428 if (current_binding_level
->kind
== sk_template_parms
1429 && !current_binding_level
->explicit_spec_p
1430 && (TREE_VEC_LENGTH (DECL_INNERMOST_TEMPLATE_PARMS (fn
))
1431 != TREE_VEC_LENGTH (TREE_VALUE (current_template_parms
))))
1434 /* See whether this function might be a specialization of this
1436 targs
= get_bindings (fn
, decl
, explicit_targs
);
1439 /* We cannot deduce template arguments that when used to
1440 specialize TMPL will produce DECL. */
1443 /* Save this template, and the arguments deduced. */
1444 templates
= tree_cons (targs
, fn
, templates
);
1446 else if (need_member_template
)
1447 /* FN is an ordinary member function, and we need a
1448 specialization of a member template. */
1450 else if (TREE_CODE (fn
) != FUNCTION_DECL
)
1451 /* We can get IDENTIFIER_NODEs here in certain erroneous
1454 else if (!DECL_FUNCTION_MEMBER_P (fn
))
1455 /* This is just an ordinary non-member function. Nothing can
1456 be a specialization of that. */
1458 else if (DECL_ARTIFICIAL (fn
))
1459 /* Cannot specialize functions that are created implicitly. */
1463 tree decl_arg_types
;
1465 /* This is an ordinary member function. However, since
1466 we're here, we can assume it's enclosing class is a
1467 template class. For example,
1469 template <typename T> struct S { void f(); };
1470 template <> void S<int>::f() {}
1472 Here, S<int>::f is a non-template, but S<int> is a
1473 template class. If FN has the same type as DECL, we
1474 might be in business. */
1476 if (!DECL_TEMPLATE_INFO (fn
))
1477 /* Its enclosing class is an explicit specialization
1478 of a template class. This is not a candidate. */
1481 if (!same_type_p (TREE_TYPE (TREE_TYPE (decl
)),
1482 TREE_TYPE (TREE_TYPE (fn
))))
1483 /* The return types differ. */
1486 /* Adjust the type of DECL in case FN is a static member. */
1487 decl_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
1488 if (DECL_STATIC_FUNCTION_P (fn
)
1489 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
1490 decl_arg_types
= TREE_CHAIN (decl_arg_types
);
1492 if (compparms (TYPE_ARG_TYPES (TREE_TYPE (fn
)),
1495 candidates
= tree_cons (NULL_TREE
, fn
, candidates
);
1499 if (templates
&& TREE_CHAIN (templates
))
1505 It is possible for a specialization with a given function
1506 signature to be instantiated from more than one function
1507 template. In such cases, explicit specification of the
1508 template arguments must be used to uniquely identify the
1509 function template specialization being specialized.
1511 Note that here, there's no suggestion that we're supposed to
1512 determine which of the candidate templates is most
1513 specialized. However, we, also have:
1517 Partial ordering of overloaded function template
1518 declarations is used in the following contexts to select
1519 the function template to which a function template
1520 specialization refers:
1522 -- when an explicit specialization refers to a function
1525 So, we do use the partial ordering rules, at least for now.
1526 This extension can only serve to make invalid programs valid,
1527 so it's safe. And, there is strong anecdotal evidence that
1528 the committee intended the partial ordering rules to apply;
1529 the EDG front-end has that behavior, and John Spicer claims
1530 that the committee simply forgot to delete the wording in
1531 [temp.expl.spec]. */
1532 tree tmpl
= most_specialized (templates
, decl
, explicit_targs
);
1533 if (tmpl
&& tmpl
!= error_mark_node
)
1535 targs
= get_bindings (tmpl
, decl
, explicit_targs
);
1536 templates
= tree_cons (targs
, tmpl
, NULL_TREE
);
1540 if (templates
== NULL_TREE
&& candidates
== NULL_TREE
)
1542 cp_error_at ("template-id %qD for %q+D does not match any template "
1545 return error_mark_node
;
1547 else if ((templates
&& TREE_CHAIN (templates
))
1548 || (candidates
&& TREE_CHAIN (candidates
))
1549 || (templates
&& candidates
))
1551 cp_error_at ("ambiguous template specialization %qD for %q+D",
1553 chainon (candidates
, templates
);
1554 print_candidates (candidates
);
1555 return error_mark_node
;
1558 /* We have one, and exactly one, match. */
1561 /* It was a specialization of an ordinary member function in a
1563 *targs_out
= copy_node (DECL_TI_ARGS (TREE_VALUE (candidates
)));
1564 return DECL_TI_TEMPLATE (TREE_VALUE (candidates
));
1567 /* It was a specialization of a template. */
1568 targs
= DECL_TI_ARGS (DECL_TEMPLATE_RESULT (TREE_VALUE (templates
)));
1569 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (targs
))
1571 *targs_out
= copy_node (targs
);
1572 SET_TMPL_ARGS_LEVEL (*targs_out
,
1573 TMPL_ARGS_DEPTH (*targs_out
),
1574 TREE_PURPOSE (templates
));
1577 *targs_out
= TREE_PURPOSE (templates
);
1578 return TREE_VALUE (templates
);
1581 /* Returns a chain of parameter types, exactly like the SPEC_TYPES,
1582 but with the default argument values filled in from those in the
1586 copy_default_args_to_explicit_spec_1 (tree spec_types
,
1589 tree new_spec_types
;
1594 if (spec_types
== void_list_node
)
1595 return void_list_node
;
1597 /* Substitute into the rest of the list. */
1599 copy_default_args_to_explicit_spec_1 (TREE_CHAIN (spec_types
),
1600 TREE_CHAIN (tmpl_types
));
1602 /* Add the default argument for this parameter. */
1603 return hash_tree_cons (TREE_PURPOSE (tmpl_types
),
1604 TREE_VALUE (spec_types
),
1608 /* DECL is an explicit specialization. Replicate default arguments
1609 from the template it specializes. (That way, code like:
1611 template <class T> void f(T = 3);
1612 template <> void f(double);
1615 works, as required.) An alternative approach would be to look up
1616 the correct default arguments at the call-site, but this approach
1617 is consistent with how implicit instantiations are handled. */
1620 copy_default_args_to_explicit_spec (tree decl
)
1625 tree new_spec_types
;
1629 tree object_type
= NULL_TREE
;
1630 tree in_charge
= NULL_TREE
;
1631 tree vtt
= NULL_TREE
;
1633 /* See if there's anything we need to do. */
1634 tmpl
= DECL_TI_TEMPLATE (decl
);
1635 tmpl_types
= TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (tmpl
)));
1636 for (t
= tmpl_types
; t
; t
= TREE_CHAIN (t
))
1637 if (TREE_PURPOSE (t
))
1642 old_type
= TREE_TYPE (decl
);
1643 spec_types
= TYPE_ARG_TYPES (old_type
);
1645 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
1647 /* Remove the this pointer, but remember the object's type for
1649 object_type
= TREE_TYPE (TREE_VALUE (spec_types
));
1650 spec_types
= TREE_CHAIN (spec_types
);
1651 tmpl_types
= TREE_CHAIN (tmpl_types
);
1653 if (DECL_HAS_IN_CHARGE_PARM_P (decl
))
1655 /* DECL may contain more parameters than TMPL due to the extra
1656 in-charge parameter in constructors and destructors. */
1657 in_charge
= spec_types
;
1658 spec_types
= TREE_CHAIN (spec_types
);
1660 if (DECL_HAS_VTT_PARM_P (decl
))
1663 spec_types
= TREE_CHAIN (spec_types
);
1667 /* Compute the merged default arguments. */
1669 copy_default_args_to_explicit_spec_1 (spec_types
, tmpl_types
);
1671 /* Compute the new FUNCTION_TYPE. */
1675 new_spec_types
= hash_tree_cons (TREE_PURPOSE (vtt
),
1680 /* Put the in-charge parameter back. */
1681 new_spec_types
= hash_tree_cons (TREE_PURPOSE (in_charge
),
1682 TREE_VALUE (in_charge
),
1685 new_type
= build_method_type_directly (object_type
,
1686 TREE_TYPE (old_type
),
1690 new_type
= build_function_type (TREE_TYPE (old_type
),
1692 new_type
= cp_build_type_attribute_variant (new_type
,
1693 TYPE_ATTRIBUTES (old_type
));
1694 new_type
= build_exception_variant (new_type
,
1695 TYPE_RAISES_EXCEPTIONS (old_type
));
1696 TREE_TYPE (decl
) = new_type
;
1699 /* Check to see if the function just declared, as indicated in
1700 DECLARATOR, and in DECL, is a specialization of a function
1701 template. We may also discover that the declaration is an explicit
1702 instantiation at this point.
1704 Returns DECL, or an equivalent declaration that should be used
1705 instead if all goes well. Issues an error message if something is
1706 amiss. Returns error_mark_node if the error is not easily
1709 FLAGS is a bitmask consisting of the following flags:
1711 2: The function has a definition.
1712 4: The function is a friend.
1714 The TEMPLATE_COUNT is the number of references to qualifying
1715 template classes that appeared in the name of the function. For
1718 template <class T> struct S { void f(); };
1721 the TEMPLATE_COUNT would be 1. However, explicitly specialized
1722 classes are not counted in the TEMPLATE_COUNT, so that in
1724 template <class T> struct S {};
1725 template <> struct S<int> { void f(); }
1726 template <> void S<int>::f();
1728 the TEMPLATE_COUNT would be 0. (Note that this declaration is
1729 invalid; there should be no template <>.)
1731 If the function is a specialization, it is marked as such via
1732 DECL_TEMPLATE_SPECIALIZATION. Furthermore, its DECL_TEMPLATE_INFO
1733 is set up correctly, and it is added to the list of specializations
1734 for that template. */
1737 check_explicit_specialization (tree declarator
,
1742 int have_def
= flags
& 2;
1743 int is_friend
= flags
& 4;
1744 int specialization
= 0;
1745 int explicit_instantiation
= 0;
1746 int member_specialization
= 0;
1747 tree ctype
= DECL_CLASS_CONTEXT (decl
);
1748 tree dname
= DECL_NAME (decl
);
1753 if (!processing_specialization
)
1756 tsk
= tsk_excessive_parms
;
1759 tsk
= current_tmpl_spec_kind (template_count
);
1764 if (processing_specialization
)
1767 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
1769 else if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
1772 /* This could be something like:
1774 template <class T> void f(T);
1775 class S { friend void f<>(int); } */
1779 /* This case handles bogus declarations like template <>
1780 template <class T> void f<int>(); */
1782 error ("template-id %qD in declaration of primary template",
1789 case tsk_invalid_member_spec
:
1790 /* The error has already been reported in
1791 check_specialization_scope. */
1792 return error_mark_node
;
1794 case tsk_invalid_expl_inst
:
1795 error ("template parameter list used in explicit instantiation");
1801 error ("definition provided for explicit instantiation");
1803 explicit_instantiation
= 1;
1806 case tsk_excessive_parms
:
1807 case tsk_insufficient_parms
:
1808 if (tsk
== tsk_excessive_parms
)
1809 error ("too many template parameter lists in declaration of %qD",
1811 else if (template_header_count
)
1812 error("too few template parameter lists in declaration of %qD", decl
);
1814 error("explicit specialization of %qD must be introduced by "
1815 "%<template <>%>", decl
);
1819 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
1821 member_specialization
= 1;
1827 if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
1829 /* This case handles bogus declarations like template <>
1830 template <class T> void f<int>(); */
1832 if (uses_template_parms (declarator
))
1833 error ("function template partial specialization %qD "
1834 "is not allowed", declarator
);
1836 error ("template-id %qD in declaration of primary template",
1841 if (ctype
&& CLASSTYPE_TEMPLATE_INSTANTIATION (ctype
))
1842 /* This is a specialization of a member template, without
1843 specialization the containing class. Something like:
1845 template <class T> struct S {
1846 template <class U> void f (U);
1848 template <> template <class U> void S<int>::f(U) {}
1850 That's a specialization -- but of the entire template. */
1858 if (specialization
|| member_specialization
)
1860 tree t
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
1861 for (; t
; t
= TREE_CHAIN (t
))
1862 if (TREE_PURPOSE (t
))
1865 ("default argument specified in explicit specialization");
1868 if (current_lang_name
== lang_name_c
)
1869 error ("template specialization with C linkage");
1872 if (specialization
|| member_specialization
|| explicit_instantiation
)
1874 tree tmpl
= NULL_TREE
;
1875 tree targs
= NULL_TREE
;
1877 /* Make sure that the declarator is a TEMPLATE_ID_EXPR. */
1878 if (TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
1882 gcc_assert (TREE_CODE (declarator
) == IDENTIFIER_NODE
);
1887 /* If there is no class context, the explicit instantiation
1888 must be at namespace scope. */
1889 gcc_assert (DECL_NAMESPACE_SCOPE_P (decl
));
1891 /* Find the namespace binding, using the declaration
1893 fns
= namespace_binding (dname
, CP_DECL_CONTEXT (decl
));
1894 if (!fns
|| !is_overloaded_fn (fns
))
1896 error ("%qD is not a template function", dname
);
1897 fns
= error_mark_node
;
1901 declarator
= lookup_template_function (fns
, NULL_TREE
);
1904 if (declarator
== error_mark_node
)
1905 return error_mark_node
;
1907 if (ctype
!= NULL_TREE
&& TYPE_BEING_DEFINED (ctype
))
1909 if (!explicit_instantiation
)
1910 /* A specialization in class scope. This is invalid,
1911 but the error will already have been flagged by
1912 check_specialization_scope. */
1913 return error_mark_node
;
1916 /* It's not valid to write an explicit instantiation in
1919 class C { template void f(); }
1921 This case is caught by the parser. However, on
1924 template class C { void f(); };
1926 (which is invalid) we can get here. The error will be
1933 else if (ctype
!= NULL_TREE
1934 && (TREE_CODE (TREE_OPERAND (declarator
, 0)) ==
1937 /* Find the list of functions in ctype that have the same
1938 name as the declared function. */
1939 tree name
= TREE_OPERAND (declarator
, 0);
1940 tree fns
= NULL_TREE
;
1943 if (constructor_name_p (name
, ctype
))
1945 int is_constructor
= DECL_CONSTRUCTOR_P (decl
);
1947 if (is_constructor
? !TYPE_HAS_CONSTRUCTOR (ctype
)
1948 : !CLASSTYPE_DESTRUCTORS (ctype
))
1950 /* From [temp.expl.spec]:
1952 If such an explicit specialization for the member
1953 of a class template names an implicitly-declared
1954 special member function (clause _special_), the
1955 program is ill-formed.
1957 Similar language is found in [temp.explicit]. */
1958 error ("specialization of implicitly-declared special member function");
1959 return error_mark_node
;
1962 name
= is_constructor
? ctor_identifier
: dtor_identifier
;
1965 if (!DECL_CONV_FN_P (decl
))
1967 idx
= lookup_fnfields_1 (ctype
, name
);
1969 fns
= VEC_index (tree
, CLASSTYPE_METHOD_VEC (ctype
), idx
);
1976 /* For a type-conversion operator, we cannot do a
1977 name-based lookup. We might be looking for `operator
1978 int' which will be a specialization of `operator T'.
1979 So, we find *all* the conversion operators, and then
1980 select from them. */
1983 methods
= CLASSTYPE_METHOD_VEC (ctype
);
1985 for (idx
= CLASSTYPE_FIRST_CONVERSION_SLOT
;
1986 VEC_iterate (tree
, methods
, idx
, ovl
);
1989 if (!DECL_CONV_FN_P (OVL_CURRENT (ovl
)))
1990 /* There are no more conversion functions. */
1993 /* Glue all these conversion functions together
1994 with those we already have. */
1995 for (; ovl
; ovl
= OVL_NEXT (ovl
))
1996 fns
= ovl_cons (OVL_CURRENT (ovl
), fns
);
2000 if (fns
== NULL_TREE
)
2002 error ("no member function %qD declared in %qT", name
, ctype
);
2003 return error_mark_node
;
2006 TREE_OPERAND (declarator
, 0) = fns
;
2009 /* Figure out what exactly is being specialized at this point.
2010 Note that for an explicit instantiation, even one for a
2011 member function, we cannot tell apriori whether the
2012 instantiation is for a member template, or just a member
2013 function of a template class. Even if a member template is
2014 being instantiated, the member template arguments may be
2015 elided if they can be deduced from the rest of the
2017 tmpl
= determine_specialization (declarator
, decl
,
2019 member_specialization
,
2022 if (!tmpl
|| tmpl
== error_mark_node
)
2023 /* We couldn't figure out what this declaration was
2025 return error_mark_node
;
2028 tree gen_tmpl
= most_general_template (tmpl
);
2030 if (explicit_instantiation
)
2032 /* We don't set DECL_EXPLICIT_INSTANTIATION here; that
2033 is done by do_decl_instantiation later. */
2035 int arg_depth
= TMPL_ARGS_DEPTH (targs
);
2036 int parm_depth
= TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
));
2038 if (arg_depth
> parm_depth
)
2040 /* If TMPL is not the most general template (for
2041 example, if TMPL is a friend template that is
2042 injected into namespace scope), then there will
2043 be too many levels of TARGS. Remove some of them
2048 new_targs
= make_tree_vec (parm_depth
);
2049 for (i
= arg_depth
- parm_depth
; i
< arg_depth
; ++i
)
2050 TREE_VEC_ELT (new_targs
, i
- (arg_depth
- parm_depth
))
2051 = TREE_VEC_ELT (targs
, i
);
2055 return instantiate_template (tmpl
, targs
, tf_error
);
2058 /* If we thought that the DECL was a member function, but it
2059 turns out to be specializing a static member function,
2060 make DECL a static member function as well. */
2061 if (DECL_STATIC_FUNCTION_P (tmpl
)
2062 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
2063 revert_static_member_fn (decl
);
2065 /* If this is a specialization of a member template of a
2066 template class. In we want to return the TEMPLATE_DECL,
2067 not the specialization of it. */
2068 if (tsk
== tsk_template
)
2070 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
2071 DECL_INITIAL (DECL_TEMPLATE_RESULT (tmpl
)) = NULL_TREE
;
2074 DECL_SOURCE_LOCATION (tmpl
) = DECL_SOURCE_LOCATION (decl
);
2075 DECL_SOURCE_LOCATION (DECL_TEMPLATE_RESULT (tmpl
))
2076 = DECL_SOURCE_LOCATION (decl
);
2077 /* We want to use the argument list specified in the
2078 definition, not in the original declaration. */
2079 DECL_ARGUMENTS (DECL_TEMPLATE_RESULT (tmpl
))
2080 = DECL_ARGUMENTS (decl
);
2085 /* Set up the DECL_TEMPLATE_INFO for DECL. */
2086 DECL_TEMPLATE_INFO (decl
) = tree_cons (tmpl
, targs
, NULL_TREE
);
2088 /* Inherit default function arguments from the template
2089 DECL is specializing. */
2090 copy_default_args_to_explicit_spec (decl
);
2092 /* This specialization has the same protection as the
2093 template it specializes. */
2094 TREE_PRIVATE (decl
) = TREE_PRIVATE (gen_tmpl
);
2095 TREE_PROTECTED (decl
) = TREE_PROTECTED (gen_tmpl
);
2097 if (is_friend
&& !have_def
)
2098 /* This is not really a declaration of a specialization.
2099 It's just the name of an instantiation. But, it's not
2100 a request for an instantiation, either. */
2101 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
2102 else if (DECL_CONSTRUCTOR_P (decl
) || DECL_DESTRUCTOR_P (decl
))
2103 /* This is indeed a specialization. In case of constructors
2104 and destructors, we need in-charge and not-in-charge
2105 versions in V3 ABI. */
2106 clone_function_decl (decl
, /*update_method_vec_p=*/0);
2108 /* Register this specialization so that we can find it
2110 decl
= register_specialization (decl
, gen_tmpl
, targs
);
2117 /* Returns 1 iff PARMS1 and PARMS2 are identical sets of template
2118 parameters. These are represented in the same format used for
2119 DECL_TEMPLATE_PARMS. */
2122 comp_template_parms (tree parms1
, tree parms2
)
2127 if (parms1
== parms2
)
2130 for (p1
= parms1
, p2
= parms2
;
2131 p1
!= NULL_TREE
&& p2
!= NULL_TREE
;
2132 p1
= TREE_CHAIN (p1
), p2
= TREE_CHAIN (p2
))
2134 tree t1
= TREE_VALUE (p1
);
2135 tree t2
= TREE_VALUE (p2
);
2138 gcc_assert (TREE_CODE (t1
) == TREE_VEC
);
2139 gcc_assert (TREE_CODE (t2
) == TREE_VEC
);
2141 if (TREE_VEC_LENGTH (t1
) != TREE_VEC_LENGTH (t2
))
2144 for (i
= 0; i
< TREE_VEC_LENGTH (t2
); ++i
)
2146 tree parm1
= TREE_VALUE (TREE_VEC_ELT (t1
, i
));
2147 tree parm2
= TREE_VALUE (TREE_VEC_ELT (t2
, i
));
2149 if (TREE_CODE (parm1
) != TREE_CODE (parm2
))
2152 if (TREE_CODE (parm1
) == TEMPLATE_TYPE_PARM
)
2154 else if (!same_type_p (TREE_TYPE (parm1
), TREE_TYPE (parm2
)))
2159 if ((p1
!= NULL_TREE
) != (p2
!= NULL_TREE
))
2160 /* One set of parameters has more parameters lists than the
2167 /* Complain if DECL shadows a template parameter.
2169 [temp.local]: A template-parameter shall not be redeclared within its
2170 scope (including nested scopes). */
2173 check_template_shadow (tree decl
)
2177 /* If we're not in a template, we can't possibly shadow a template
2179 if (!current_template_parms
)
2182 /* Figure out what we're shadowing. */
2183 if (TREE_CODE (decl
) == OVERLOAD
)
2184 decl
= OVL_CURRENT (decl
);
2185 olddecl
= innermost_non_namespace_value (DECL_NAME (decl
));
2187 /* If there's no previous binding for this name, we're not shadowing
2188 anything, let alone a template parameter. */
2192 /* If we're not shadowing a template parameter, we're done. Note
2193 that OLDDECL might be an OVERLOAD (or perhaps even an
2194 ERROR_MARK), so we can't just blithely assume it to be a _DECL
2196 if (!DECL_P (olddecl
) || !DECL_TEMPLATE_PARM_P (olddecl
))
2199 /* We check for decl != olddecl to avoid bogus errors for using a
2200 name inside a class. We check TPFI to avoid duplicate errors for
2201 inline member templates. */
2203 || TEMPLATE_PARMS_FOR_INLINE (current_template_parms
))
2206 cp_error_at ("declaration of %q#D", decl
);
2207 cp_error_at (" shadows template parm %q#D", olddecl
);
2210 /* Return a new TEMPLATE_PARM_INDEX with the indicated INDEX, LEVEL,
2211 ORIG_LEVEL, DECL, and TYPE. */
2214 build_template_parm_index (int index
,
2220 tree t
= make_node (TEMPLATE_PARM_INDEX
);
2221 TEMPLATE_PARM_IDX (t
) = index
;
2222 TEMPLATE_PARM_LEVEL (t
) = level
;
2223 TEMPLATE_PARM_ORIG_LEVEL (t
) = orig_level
;
2224 TEMPLATE_PARM_DECL (t
) = decl
;
2225 TREE_TYPE (t
) = type
;
2226 TREE_CONSTANT (t
) = TREE_CONSTANT (decl
);
2227 TREE_INVARIANT (t
) = TREE_INVARIANT (decl
);
2228 TREE_READONLY (t
) = TREE_READONLY (decl
);
2233 /* Return a TEMPLATE_PARM_INDEX, similar to INDEX, but whose
2234 TEMPLATE_PARM_LEVEL has been decreased by LEVELS. If such a
2235 TEMPLATE_PARM_INDEX already exists, it is returned; otherwise, a
2236 new one is created. */
2239 reduce_template_parm_level (tree index
, tree type
, int levels
)
2241 if (TEMPLATE_PARM_DESCENDANTS (index
) == NULL_TREE
2242 || (TEMPLATE_PARM_LEVEL (TEMPLATE_PARM_DESCENDANTS (index
))
2243 != TEMPLATE_PARM_LEVEL (index
) - levels
))
2245 tree orig_decl
= TEMPLATE_PARM_DECL (index
);
2248 decl
= build_decl (TREE_CODE (orig_decl
), DECL_NAME (orig_decl
), type
);
2249 TREE_CONSTANT (decl
) = TREE_CONSTANT (orig_decl
);
2250 TREE_INVARIANT (decl
) = TREE_INVARIANT (orig_decl
);
2251 TREE_READONLY (decl
) = TREE_READONLY (orig_decl
);
2252 DECL_ARTIFICIAL (decl
) = 1;
2253 SET_DECL_TEMPLATE_PARM_P (decl
);
2255 t
= build_template_parm_index (TEMPLATE_PARM_IDX (index
),
2256 TEMPLATE_PARM_LEVEL (index
) - levels
,
2257 TEMPLATE_PARM_ORIG_LEVEL (index
),
2259 TEMPLATE_PARM_DESCENDANTS (index
) = t
;
2261 /* Template template parameters need this. */
2262 DECL_TEMPLATE_PARMS (decl
)
2263 = DECL_TEMPLATE_PARMS (TEMPLATE_PARM_DECL (index
));
2266 return TEMPLATE_PARM_DESCENDANTS (index
);
2269 /* Process information from new template parameter NEXT and append it to the
2270 LIST being built. This new parameter is a non-type parameter iff
2271 IS_NON_TYPE is true. */
2274 process_template_parm (tree list
, tree next
, bool is_non_type
)
2282 gcc_assert (TREE_CODE (parm
) == TREE_LIST
);
2283 defval
= TREE_PURPOSE (parm
);
2287 tree p
= TREE_VALUE (tree_last (list
));
2289 if (TREE_CODE (p
) == TYPE_DECL
|| TREE_CODE (p
) == TEMPLATE_DECL
)
2290 idx
= TEMPLATE_TYPE_IDX (TREE_TYPE (p
));
2292 idx
= TEMPLATE_PARM_IDX (DECL_INITIAL (p
));
2300 parm
= TREE_VALUE (parm
);
2302 SET_DECL_TEMPLATE_PARM_P (parm
);
2306 The top-level cv-qualifiers on the template-parameter are
2307 ignored when determining its type. */
2308 TREE_TYPE (parm
) = TYPE_MAIN_VARIANT (TREE_TYPE (parm
));
2310 /* A template parameter is not modifiable. */
2311 TREE_CONSTANT (parm
) = 1;
2312 TREE_INVARIANT (parm
) = 1;
2313 TREE_READONLY (parm
) = 1;
2314 if (invalid_nontype_parm_type_p (TREE_TYPE (parm
), 1))
2315 TREE_TYPE (parm
) = void_type_node
;
2316 decl
= build_decl (CONST_DECL
, DECL_NAME (parm
), TREE_TYPE (parm
));
2317 TREE_CONSTANT (decl
) = 1;
2318 TREE_INVARIANT (decl
) = 1;
2319 TREE_READONLY (decl
) = 1;
2320 DECL_INITIAL (parm
) = DECL_INITIAL (decl
)
2321 = build_template_parm_index (idx
, processing_template_decl
,
2322 processing_template_decl
,
2323 decl
, TREE_TYPE (parm
));
2328 parm
= TREE_VALUE (TREE_VALUE (parm
));
2330 if (parm
&& TREE_CODE (parm
) == TEMPLATE_DECL
)
2332 t
= make_aggr_type (TEMPLATE_TEMPLATE_PARM
);
2333 /* This is for distinguishing between real templates and template
2334 template parameters */
2335 TREE_TYPE (parm
) = t
;
2336 TREE_TYPE (DECL_TEMPLATE_RESULT (parm
)) = t
;
2341 t
= make_aggr_type (TEMPLATE_TYPE_PARM
);
2342 /* parm is either IDENTIFIER_NODE or NULL_TREE. */
2343 decl
= build_decl (TYPE_DECL
, parm
, t
);
2346 TYPE_NAME (t
) = decl
;
2347 TYPE_STUB_DECL (t
) = decl
;
2349 TEMPLATE_TYPE_PARM_INDEX (t
)
2350 = build_template_parm_index (idx
, processing_template_decl
,
2351 processing_template_decl
,
2352 decl
, TREE_TYPE (parm
));
2354 DECL_ARTIFICIAL (decl
) = 1;
2355 SET_DECL_TEMPLATE_PARM_P (decl
);
2357 parm
= build_tree_list (defval
, parm
);
2358 return chainon (list
, parm
);
2361 /* The end of a template parameter list has been reached. Process the
2362 tree list into a parameter vector, converting each parameter into a more
2363 useful form. Type parameters are saved as IDENTIFIER_NODEs, and others
2367 end_template_parm_list (tree parms
)
2371 tree saved_parmlist
= make_tree_vec (list_length (parms
));
2373 current_template_parms
2374 = tree_cons (size_int (processing_template_decl
),
2375 saved_parmlist
, current_template_parms
);
2377 for (parm
= parms
, nparms
= 0; parm
; parm
= next
, nparms
++)
2379 next
= TREE_CHAIN (parm
);
2380 TREE_VEC_ELT (saved_parmlist
, nparms
) = parm
;
2381 TREE_CHAIN (parm
) = NULL_TREE
;
2384 --processing_template_parmlist
;
2386 return saved_parmlist
;
2389 /* end_template_decl is called after a template declaration is seen. */
2392 end_template_decl (void)
2394 reset_specialization ();
2396 if (! processing_template_decl
)
2399 /* This matches the pushlevel in begin_template_parm_list. */
2402 --processing_template_decl
;
2403 current_template_parms
= TREE_CHAIN (current_template_parms
);
2406 /* Given a template argument vector containing the template PARMS.
2407 The innermost PARMS are given first. */
2410 current_template_args (void)
2413 tree args
= NULL_TREE
;
2414 int length
= TMPL_PARMS_DEPTH (current_template_parms
);
2417 /* If there is only one level of template parameters, we do not
2418 create a TREE_VEC of TREE_VECs. Instead, we return a single
2419 TREE_VEC containing the arguments. */
2421 args
= make_tree_vec (length
);
2423 for (header
= current_template_parms
; header
; header
= TREE_CHAIN (header
))
2425 tree a
= copy_node (TREE_VALUE (header
));
2428 TREE_TYPE (a
) = NULL_TREE
;
2429 for (i
= TREE_VEC_LENGTH (a
) - 1; i
>= 0; --i
)
2431 tree t
= TREE_VEC_ELT (a
, i
);
2433 /* T will be a list if we are called from within a
2434 begin/end_template_parm_list pair, but a vector directly
2435 if within a begin/end_member_template_processing pair. */
2436 if (TREE_CODE (t
) == TREE_LIST
)
2440 if (TREE_CODE (t
) == TYPE_DECL
2441 || TREE_CODE (t
) == TEMPLATE_DECL
)
2444 t
= DECL_INITIAL (t
);
2445 TREE_VEC_ELT (a
, i
) = t
;
2450 TREE_VEC_ELT (args
, --l
) = a
;
2458 /* Return a TEMPLATE_DECL corresponding to DECL, using the indicated
2459 template PARMS. If MEMBER_TEMPLATE_P is true, the new template is
2460 a member template. Used by push_template_decl below. */
2463 build_template_decl (tree decl
, tree parms
, bool member_template_p
)
2465 tree tmpl
= build_lang_decl (TEMPLATE_DECL
, DECL_NAME (decl
), NULL_TREE
);
2466 DECL_TEMPLATE_PARMS (tmpl
) = parms
;
2467 DECL_CONTEXT (tmpl
) = DECL_CONTEXT (decl
);
2468 DECL_MEMBER_TEMPLATE_P (tmpl
) = member_template_p
;
2469 if (DECL_LANG_SPECIFIC (decl
))
2471 DECL_STATIC_FUNCTION_P (tmpl
) = DECL_STATIC_FUNCTION_P (decl
);
2472 DECL_CONSTRUCTOR_P (tmpl
) = DECL_CONSTRUCTOR_P (decl
);
2473 DECL_DESTRUCTOR_P (tmpl
) = DECL_DESTRUCTOR_P (decl
);
2474 DECL_NONCONVERTING_P (tmpl
) = DECL_NONCONVERTING_P (decl
);
2475 DECL_ASSIGNMENT_OPERATOR_P (tmpl
) = DECL_ASSIGNMENT_OPERATOR_P (decl
);
2476 if (DECL_OVERLOADED_OPERATOR_P (decl
))
2477 SET_OVERLOADED_OPERATOR_CODE (tmpl
,
2478 DECL_OVERLOADED_OPERATOR_P (decl
));
2484 struct template_parm_data
2486 /* The level of the template parameters we are currently
2490 /* The index of the specialization argument we are currently
2494 /* An array whose size is the number of template parameters. The
2495 elements are nonzero if the parameter has been used in any one
2496 of the arguments processed so far. */
2499 /* An array whose size is the number of template arguments. The
2500 elements are nonzero if the argument makes use of template
2501 parameters of this level. */
2502 int* arg_uses_template_parms
;
2505 /* Subroutine of push_template_decl used to see if each template
2506 parameter in a partial specialization is used in the explicit
2507 argument list. If T is of the LEVEL given in DATA (which is
2508 treated as a template_parm_data*), then DATA->PARMS is marked
2512 mark_template_parm (tree t
, void* data
)
2516 struct template_parm_data
* tpd
= (struct template_parm_data
*) data
;
2518 if (TREE_CODE (t
) == TEMPLATE_PARM_INDEX
)
2520 level
= TEMPLATE_PARM_LEVEL (t
);
2521 idx
= TEMPLATE_PARM_IDX (t
);
2525 level
= TEMPLATE_TYPE_LEVEL (t
);
2526 idx
= TEMPLATE_TYPE_IDX (t
);
2529 if (level
== tpd
->level
)
2531 tpd
->parms
[idx
] = 1;
2532 tpd
->arg_uses_template_parms
[tpd
->current_arg
] = 1;
2535 /* Return zero so that for_each_template_parm will continue the
2536 traversal of the tree; we want to mark *every* template parm. */
2540 /* Process the partial specialization DECL. */
2543 process_partial_specialization (tree decl
)
2545 tree type
= TREE_TYPE (decl
);
2546 tree maintmpl
= CLASSTYPE_TI_TEMPLATE (type
);
2547 tree specargs
= CLASSTYPE_TI_ARGS (type
);
2548 tree inner_args
= INNERMOST_TEMPLATE_ARGS (specargs
);
2549 tree inner_parms
= INNERMOST_TEMPLATE_PARMS (current_template_parms
);
2550 tree main_inner_parms
= DECL_INNERMOST_TEMPLATE_PARMS (maintmpl
);
2551 int nargs
= TREE_VEC_LENGTH (inner_args
);
2552 int ntparms
= TREE_VEC_LENGTH (inner_parms
);
2554 int did_error_intro
= 0;
2555 struct template_parm_data tpd
;
2556 struct template_parm_data tpd2
;
2558 /* We check that each of the template parameters given in the
2559 partial specialization is used in the argument list to the
2560 specialization. For example:
2562 template <class T> struct S;
2563 template <class T> struct S<T*>;
2565 The second declaration is OK because `T*' uses the template
2566 parameter T, whereas
2568 template <class T> struct S<int>;
2570 is no good. Even trickier is:
2581 The S2<T> declaration is actually invalid; it is a
2582 full-specialization. Of course,
2585 struct S2<T (*)(U)>;
2587 or some such would have been OK. */
2588 tpd
.level
= TMPL_PARMS_DEPTH (current_template_parms
);
2589 tpd
.parms
= alloca (sizeof (int) * ntparms
);
2590 memset (tpd
.parms
, 0, sizeof (int) * ntparms
);
2592 tpd
.arg_uses_template_parms
= alloca (sizeof (int) * nargs
);
2593 memset (tpd
.arg_uses_template_parms
, 0, sizeof (int) * nargs
);
2594 for (i
= 0; i
< nargs
; ++i
)
2596 tpd
.current_arg
= i
;
2597 for_each_template_parm (TREE_VEC_ELT (inner_args
, i
),
2598 &mark_template_parm
,
2602 for (i
= 0; i
< ntparms
; ++i
)
2603 if (tpd
.parms
[i
] == 0)
2605 /* One of the template parms was not used in the
2607 if (!did_error_intro
)
2609 error ("template parameters not used in partial specialization:");
2610 did_error_intro
= 1;
2613 error (" %qD", TREE_VALUE (TREE_VEC_ELT (inner_parms
, i
)));
2616 /* [temp.class.spec]
2618 The argument list of the specialization shall not be identical to
2619 the implicit argument list of the primary template. */
2620 if (comp_template_args
2622 INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE
2624 error ("partial specialization %qT does not specialize any template arguments", type
);
2626 /* [temp.class.spec]
2628 A partially specialized non-type argument expression shall not
2629 involve template parameters of the partial specialization except
2630 when the argument expression is a simple identifier.
2632 The type of a template parameter corresponding to a specialized
2633 non-type argument shall not be dependent on a parameter of the
2635 gcc_assert (nargs
== DECL_NTPARMS (maintmpl
));
2637 for (i
= 0; i
< nargs
; ++i
)
2639 tree arg
= TREE_VEC_ELT (inner_args
, i
);
2640 if (/* These first two lines are the `non-type' bit. */
2642 && TREE_CODE (arg
) != TEMPLATE_DECL
2643 /* This next line is the `argument expression is not just a
2644 simple identifier' condition and also the `specialized
2645 non-type argument' bit. */
2646 && TREE_CODE (arg
) != TEMPLATE_PARM_INDEX
)
2648 if (tpd
.arg_uses_template_parms
[i
])
2649 error ("template argument %qE involves template parameter(s)", arg
);
2652 /* Look at the corresponding template parameter,
2653 marking which template parameters its type depends
2656 TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (main_inner_parms
,
2661 /* We haven't yet initialized TPD2. Do so now. */
2662 tpd2
.arg_uses_template_parms
2663 = alloca (sizeof (int) * nargs
);
2664 /* The number of parameters here is the number in the
2665 main template, which, as checked in the assertion
2667 tpd2
.parms
= alloca (sizeof (int) * nargs
);
2669 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (maintmpl
));
2672 /* Mark the template parameters. But this time, we're
2673 looking for the template parameters of the main
2674 template, not in the specialization. */
2675 tpd2
.current_arg
= i
;
2676 tpd2
.arg_uses_template_parms
[i
] = 0;
2677 memset (tpd2
.parms
, 0, sizeof (int) * nargs
);
2678 for_each_template_parm (type
,
2679 &mark_template_parm
,
2683 if (tpd2
.arg_uses_template_parms
[i
])
2685 /* The type depended on some template parameters.
2686 If they are fully specialized in the
2687 specialization, that's OK. */
2689 for (j
= 0; j
< nargs
; ++j
)
2690 if (tpd2
.parms
[j
] != 0
2691 && tpd
.arg_uses_template_parms
[j
])
2693 error ("type %qT of template argument %qE depends "
2694 "on template parameter(s)",
2704 if (retrieve_specialization (maintmpl
, specargs
,
2705 /*class_specializations_p=*/true))
2706 /* We've already got this specialization. */
2709 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)
2710 = tree_cons (inner_args
, inner_parms
,
2711 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
));
2712 TREE_TYPE (DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)) = type
;
2716 /* Check that a template declaration's use of default arguments is not
2717 invalid. Here, PARMS are the template parameters. IS_PRIMARY is
2718 nonzero if DECL is the thing declared by a primary template.
2719 IS_PARTIAL is nonzero if DECL is a partial specialization. */
2722 check_default_tmpl_args (tree decl
, tree parms
, int is_primary
, int is_partial
)
2725 int last_level_to_check
;
2730 A default template-argument shall not be specified in a
2731 function template declaration or a function template definition, nor
2732 in the template-parameter-list of the definition of a member of a
2735 if (TREE_CODE (CP_DECL_CONTEXT (decl
)) == FUNCTION_DECL
)
2736 /* You can't have a function template declaration in a local
2737 scope, nor you can you define a member of a class template in a
2741 if (current_class_type
2742 && !TYPE_BEING_DEFINED (current_class_type
)
2743 && DECL_LANG_SPECIFIC (decl
)
2744 /* If this is either a friend defined in the scope of the class
2745 or a member function. */
2746 && (DECL_FUNCTION_MEMBER_P (decl
)
2747 ? same_type_p (DECL_CONTEXT (decl
), current_class_type
)
2748 : DECL_FRIEND_CONTEXT (decl
)
2749 ? same_type_p (DECL_FRIEND_CONTEXT (decl
), current_class_type
)
2751 /* And, if it was a member function, it really was defined in
2752 the scope of the class. */
2753 && (!DECL_FUNCTION_MEMBER_P (decl
)
2754 || DECL_INITIALIZED_IN_CLASS_P (decl
)))
2755 /* We already checked these parameters when the template was
2756 declared, so there's no need to do it again now. This function
2757 was defined in class scope, but we're processing it's body now
2758 that the class is complete. */
2763 If a template-parameter has a default template-argument, all
2764 subsequent template-parameters shall have a default
2765 template-argument supplied. */
2766 for (parm_level
= parms
; parm_level
; parm_level
= TREE_CHAIN (parm_level
))
2768 tree inner_parms
= TREE_VALUE (parm_level
);
2769 int ntparms
= TREE_VEC_LENGTH (inner_parms
);
2770 int seen_def_arg_p
= 0;
2773 for (i
= 0; i
< ntparms
; ++i
)
2775 tree parm
= TREE_VEC_ELT (inner_parms
, i
);
2776 if (TREE_PURPOSE (parm
))
2778 else if (seen_def_arg_p
)
2780 error ("no default argument for %qD", TREE_VALUE (parm
));
2781 /* For better subsequent error-recovery, we indicate that
2782 there should have been a default argument. */
2783 TREE_PURPOSE (parm
) = error_mark_node
;
2788 if (TREE_CODE (decl
) != TYPE_DECL
|| is_partial
|| !is_primary
)
2789 /* For an ordinary class template, default template arguments are
2790 allowed at the innermost level, e.g.:
2791 template <class T = int>
2793 but, in a partial specialization, they're not allowed even
2794 there, as we have in [temp.class.spec]:
2796 The template parameter list of a specialization shall not
2797 contain default template argument values.
2799 So, for a partial specialization, or for a function template,
2800 we look at all of them. */
2803 /* But, for a primary class template that is not a partial
2804 specialization we look at all template parameters except the
2806 parms
= TREE_CHAIN (parms
);
2808 /* Figure out what error message to issue. */
2809 if (TREE_CODE (decl
) == FUNCTION_DECL
)
2810 msg
= "default template arguments may not be used in function templates";
2811 else if (is_partial
)
2812 msg
= "default template arguments may not be used in partial specializations";
2814 msg
= "default argument for template parameter for class enclosing %qD";
2816 if (current_class_type
&& TYPE_BEING_DEFINED (current_class_type
))
2817 /* If we're inside a class definition, there's no need to
2818 examine the parameters to the class itself. On the one
2819 hand, they will be checked when the class is defined, and,
2820 on the other, default arguments are valid in things like:
2821 template <class T = double>
2822 struct S { template <class U> void f(U); };
2823 Here the default argument for `S' has no bearing on the
2824 declaration of `f'. */
2825 last_level_to_check
= template_class_depth (current_class_type
) + 1;
2827 /* Check everything. */
2828 last_level_to_check
= 0;
2830 for (parm_level
= parms
;
2831 parm_level
&& TMPL_PARMS_DEPTH (parm_level
) >= last_level_to_check
;
2832 parm_level
= TREE_CHAIN (parm_level
))
2834 tree inner_parms
= TREE_VALUE (parm_level
);
2838 ntparms
= TREE_VEC_LENGTH (inner_parms
);
2839 for (i
= 0; i
< ntparms
; ++i
)
2840 if (TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)))
2848 /* Clear out the default argument so that we are not
2850 TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)) = NULL_TREE
;
2853 /* At this point, if we're still interested in issuing messages,
2854 they must apply to classes surrounding the object declared. */
2856 msg
= "default argument for template parameter for class enclosing %qD";
2860 /* Worker for push_template_decl_real, called via
2861 for_each_template_parm. DATA is really an int, indicating the
2862 level of the parameters we are interested in. If T is a template
2863 parameter of that level, return nonzero. */
2866 template_parm_this_level_p (tree t
, void* data
)
2868 int this_level
= *(int *)data
;
2871 if (TREE_CODE (t
) == TEMPLATE_PARM_INDEX
)
2872 level
= TEMPLATE_PARM_LEVEL (t
);
2874 level
= TEMPLATE_TYPE_LEVEL (t
);
2875 return level
== this_level
;
2878 /* Creates a TEMPLATE_DECL for the indicated DECL using the template
2879 parameters given by current_template_args, or reuses a
2880 previously existing one, if appropriate. Returns the DECL, or an
2881 equivalent one, if it is replaced via a call to duplicate_decls.
2883 If IS_FRIEND is nonzero, DECL is a friend declaration. */
2886 push_template_decl_real (tree decl
, int is_friend
)
2894 int new_template_p
= 0;
2895 /* True if the template is a member template, in the sense of
2897 bool member_template_p
= false;
2899 if (decl
== error_mark_node
)
2902 /* See if this is a partial specialization. */
2903 is_partial
= (DECL_IMPLICIT_TYPEDEF_P (decl
)
2904 && TREE_CODE (TREE_TYPE (decl
)) != ENUMERAL_TYPE
2905 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl
)));
2907 is_friend
|= (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_FRIEND_P (decl
));
2910 /* For a friend, we want the context of the friend function, not
2911 the type of which it is a friend. */
2912 ctx
= DECL_CONTEXT (decl
);
2913 else if (CP_DECL_CONTEXT (decl
)
2914 && TREE_CODE (CP_DECL_CONTEXT (decl
)) != NAMESPACE_DECL
)
2915 /* In the case of a virtual function, we want the class in which
2917 ctx
= CP_DECL_CONTEXT (decl
);
2919 /* Otherwise, if we're currently defining some class, the DECL
2920 is assumed to be a member of the class. */
2921 ctx
= current_scope ();
2923 if (ctx
&& TREE_CODE (ctx
) == NAMESPACE_DECL
)
2926 if (!DECL_CONTEXT (decl
))
2927 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
2929 /* See if this is a primary template. */
2930 primary
= template_parm_scope_p ();
2934 if (DECL_CLASS_SCOPE_P (decl
))
2935 member_template_p
= true;
2936 if (current_lang_name
== lang_name_c
)
2937 error ("template with C linkage");
2938 else if (TREE_CODE (decl
) == TYPE_DECL
2939 && ANON_AGGRNAME_P (DECL_NAME (decl
)))
2940 error ("template class without a name");
2941 else if (TREE_CODE (decl
) == FUNCTION_DECL
)
2943 if (DECL_DESTRUCTOR_P (decl
))
2947 A destructor shall not be a member template. */
2948 error ("destructor %qD declared as member template", decl
);
2949 return error_mark_node
;
2951 if (NEW_DELETE_OPNAME_P (DECL_NAME (decl
))
2952 && (!TYPE_ARG_TYPES (TREE_TYPE (decl
))
2953 || TYPE_ARG_TYPES (TREE_TYPE (decl
)) == void_list_node
2954 || !TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)))
2955 || (TREE_CHAIN (TYPE_ARG_TYPES ((TREE_TYPE (decl
))))
2956 == void_list_node
)))
2958 /* [basic.stc.dynamic.allocation]
2960 An allocation function can be a function
2961 template. ... Template allocation functions shall
2962 have two or more parameters. */
2963 error ("invalid template declaration of %qD", decl
);
2967 else if ((DECL_IMPLICIT_TYPEDEF_P (decl
)
2968 && CLASS_TYPE_P (TREE_TYPE (decl
)))
2969 || (TREE_CODE (decl
) == VAR_DECL
&& ctx
&& CLASS_TYPE_P (ctx
)))
2973 error ("template declaration of %q#D", decl
);
2974 return error_mark_node
;
2978 /* Check to see that the rules regarding the use of default
2979 arguments are not being violated. */
2980 check_default_tmpl_args (decl
, current_template_parms
,
2981 primary
, is_partial
);
2984 return process_partial_specialization (decl
);
2986 args
= current_template_args ();
2989 || TREE_CODE (ctx
) == FUNCTION_DECL
2990 || (CLASS_TYPE_P (ctx
) && TYPE_BEING_DEFINED (ctx
))
2991 || (is_friend
&& !DECL_TEMPLATE_INFO (decl
)))
2993 if (DECL_LANG_SPECIFIC (decl
)
2994 && DECL_TEMPLATE_INFO (decl
)
2995 && DECL_TI_TEMPLATE (decl
))
2996 tmpl
= DECL_TI_TEMPLATE (decl
);
2997 /* If DECL is a TYPE_DECL for a class-template, then there won't
2998 be DECL_LANG_SPECIFIC. The information equivalent to
2999 DECL_TEMPLATE_INFO is found in TYPE_TEMPLATE_INFO instead. */
3000 else if (DECL_IMPLICIT_TYPEDEF_P (decl
)
3001 && TYPE_TEMPLATE_INFO (TREE_TYPE (decl
))
3002 && TYPE_TI_TEMPLATE (TREE_TYPE (decl
)))
3004 /* Since a template declaration already existed for this
3005 class-type, we must be redeclaring it here. Make sure
3006 that the redeclaration is valid. */
3007 redeclare_class_template (TREE_TYPE (decl
),
3008 current_template_parms
);
3009 /* We don't need to create a new TEMPLATE_DECL; just use the
3010 one we already had. */
3011 tmpl
= TYPE_TI_TEMPLATE (TREE_TYPE (decl
));
3015 tmpl
= build_template_decl (decl
, current_template_parms
,
3019 if (DECL_LANG_SPECIFIC (decl
)
3020 && DECL_TEMPLATE_SPECIALIZATION (decl
))
3022 /* A specialization of a member template of a template
3024 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
3025 DECL_TEMPLATE_INFO (tmpl
) = DECL_TEMPLATE_INFO (decl
);
3026 DECL_TEMPLATE_INFO (decl
) = NULL_TREE
;
3032 tree a
, t
, current
, parms
;
3035 if (TREE_CODE (decl
) == TYPE_DECL
)
3037 if ((IS_AGGR_TYPE_CODE (TREE_CODE (TREE_TYPE (decl
)))
3038 || TREE_CODE (TREE_TYPE (decl
)) == ENUMERAL_TYPE
)
3039 && TYPE_TEMPLATE_INFO (TREE_TYPE (decl
))
3040 && TYPE_TI_TEMPLATE (TREE_TYPE (decl
)))
3041 tmpl
= TYPE_TI_TEMPLATE (TREE_TYPE (decl
));
3044 error ("%qD does not declare a template type", decl
);
3048 else if (!DECL_LANG_SPECIFIC (decl
) || !DECL_TEMPLATE_INFO (decl
))
3050 error ("template definition of non-template %q#D", decl
);
3054 tmpl
= DECL_TI_TEMPLATE (decl
);
3056 if (DECL_FUNCTION_TEMPLATE_P (tmpl
)
3057 && DECL_TEMPLATE_INFO (decl
) && DECL_TI_ARGS (decl
)
3058 && DECL_TEMPLATE_SPECIALIZATION (decl
)
3059 && DECL_MEMBER_TEMPLATE_P (tmpl
))
3063 /* The declaration is a specialization of a member
3064 template, declared outside the class. Therefore, the
3065 innermost template arguments will be NULL, so we
3066 replace them with the arguments determined by the
3067 earlier call to check_explicit_specialization. */
3068 args
= DECL_TI_ARGS (decl
);
3071 = build_template_decl (decl
, current_template_parms
,
3073 DECL_TEMPLATE_RESULT (new_tmpl
) = decl
;
3074 TREE_TYPE (new_tmpl
) = TREE_TYPE (decl
);
3075 DECL_TI_TEMPLATE (decl
) = new_tmpl
;
3076 SET_DECL_TEMPLATE_SPECIALIZATION (new_tmpl
);
3077 DECL_TEMPLATE_INFO (new_tmpl
)
3078 = tree_cons (tmpl
, args
, NULL_TREE
);
3080 register_specialization (new_tmpl
,
3081 most_general_template (tmpl
),
3086 /* Make sure the template headers we got make sense. */
3088 parms
= DECL_TEMPLATE_PARMS (tmpl
);
3089 i
= TMPL_PARMS_DEPTH (parms
);
3090 if (TMPL_ARGS_DEPTH (args
) != i
)
3092 error ("expected %d levels of template parms for %q#D, got %d",
3093 i
, decl
, TMPL_ARGS_DEPTH (args
));
3096 for (current
= decl
; i
> 0; --i
, parms
= TREE_CHAIN (parms
))
3098 a
= TMPL_ARGS_LEVEL (args
, i
);
3099 t
= INNERMOST_TEMPLATE_PARMS (parms
);
3101 if (TREE_VEC_LENGTH (t
) != TREE_VEC_LENGTH (a
))
3103 if (current
== decl
)
3104 error ("got %d template parameters for %q#D",
3105 TREE_VEC_LENGTH (a
), decl
);
3107 error ("got %d template parameters for %q#T",
3108 TREE_VEC_LENGTH (a
), current
);
3109 error (" but %d required", TREE_VEC_LENGTH (t
));
3112 /* Perhaps we should also check that the parms are used in the
3113 appropriate qualifying scopes in the declarator? */
3115 if (current
== decl
)
3118 current
= TYPE_CONTEXT (current
);
3122 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
3123 TREE_TYPE (tmpl
) = TREE_TYPE (decl
);
3125 /* Push template declarations for global functions and types. Note
3126 that we do not try to push a global template friend declared in a
3127 template class; such a thing may well depend on the template
3128 parameters of the class. */
3129 if (new_template_p
&& !ctx
3130 && !(is_friend
&& template_class_depth (current_class_type
) > 0))
3132 tmpl
= pushdecl_namespace_level (tmpl
);
3133 if (tmpl
== error_mark_node
)
3134 return error_mark_node
;
3136 /* Hide template friend classes that haven't been declared yet. */
3137 if (is_friend
&& TREE_CODE (decl
) == TYPE_DECL
)
3139 DECL_ANTICIPATED (tmpl
) = 1;
3140 DECL_FRIEND_P (tmpl
) = 1;
3146 DECL_PRIMARY_TEMPLATE (tmpl
) = tmpl
;
3147 if (DECL_CONV_FN_P (tmpl
))
3149 int depth
= TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
));
3151 /* It is a conversion operator. See if the type converted to
3152 depends on innermost template operands. */
3154 if (uses_template_parms_level (TREE_TYPE (TREE_TYPE (tmpl
)),
3156 DECL_TEMPLATE_CONV_FN_P (tmpl
) = 1;
3160 /* The DECL_TI_ARGS of DECL contains full set of arguments referring
3161 back to its most general template. If TMPL is a specialization,
3162 ARGS may only have the innermost set of arguments. Add the missing
3163 argument levels if necessary. */
3164 if (DECL_TEMPLATE_INFO (tmpl
))
3165 args
= add_outermost_template_args (DECL_TI_ARGS (tmpl
), args
);
3167 info
= tree_cons (tmpl
, args
, NULL_TREE
);
3169 if (DECL_IMPLICIT_TYPEDEF_P (decl
))
3171 SET_TYPE_TEMPLATE_INFO (TREE_TYPE (tmpl
), info
);
3172 if ((!ctx
|| TREE_CODE (ctx
) != FUNCTION_DECL
)
3173 && TREE_CODE (TREE_TYPE (decl
)) != ENUMERAL_TYPE
3174 /* Don't change the name if we've already set it up. */
3175 && !IDENTIFIER_TEMPLATE (DECL_NAME (decl
)))
3176 DECL_NAME (decl
) = classtype_mangled_name (TREE_TYPE (decl
));
3178 else if (DECL_LANG_SPECIFIC (decl
))
3179 DECL_TEMPLATE_INFO (decl
) = info
;
3181 return DECL_TEMPLATE_RESULT (tmpl
);
3185 push_template_decl (tree decl
)
3187 return push_template_decl_real (decl
, 0);
3190 /* Called when a class template TYPE is redeclared with the indicated
3191 template PARMS, e.g.:
3193 template <class T> struct S;
3194 template <class T> struct S {}; */
3197 redeclare_class_template (tree type
, tree parms
)
3203 if (!TYPE_TEMPLATE_INFO (type
))
3205 error ("%qT is not a template type", type
);
3209 tmpl
= TYPE_TI_TEMPLATE (type
);
3210 if (!PRIMARY_TEMPLATE_P (tmpl
))
3211 /* The type is nested in some template class. Nothing to worry
3212 about here; there are no new template parameters for the nested
3218 error ("template specifiers not specified in declaration of %qD",
3223 parms
= INNERMOST_TEMPLATE_PARMS (parms
);
3224 tmpl_parms
= DECL_INNERMOST_TEMPLATE_PARMS (tmpl
);
3226 if (TREE_VEC_LENGTH (parms
) != TREE_VEC_LENGTH (tmpl_parms
))
3228 cp_error_at ("previous declaration %qD", tmpl
);
3229 error ("used %d template parameter%s instead of %d",
3230 TREE_VEC_LENGTH (tmpl_parms
),
3231 TREE_VEC_LENGTH (tmpl_parms
) == 1 ? "" : "s",
3232 TREE_VEC_LENGTH (parms
));
3236 for (i
= 0; i
< TREE_VEC_LENGTH (tmpl_parms
); ++i
)
3238 tree tmpl_parm
= TREE_VALUE (TREE_VEC_ELT (tmpl_parms
, i
));
3239 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
3240 tree tmpl_default
= TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
));
3241 tree parm_default
= TREE_PURPOSE (TREE_VEC_ELT (parms
, i
));
3243 /* TMPL_PARM and PARM can be either TYPE_DECL, PARM_DECL, or
3245 if (TREE_CODE (tmpl_parm
) != TREE_CODE (parm
)
3246 || (TREE_CODE (tmpl_parm
) != TYPE_DECL
3247 && !same_type_p (TREE_TYPE (tmpl_parm
), TREE_TYPE (parm
))))
3249 cp_error_at ("template parameter %q#D", tmpl_parm
);
3250 error ("redeclared here as %q#D", parm
);
3254 if (tmpl_default
!= NULL_TREE
&& parm_default
!= NULL_TREE
)
3256 /* We have in [temp.param]:
3258 A template-parameter may not be given default arguments
3259 by two different declarations in the same scope. */
3260 error ("redefinition of default argument for %q#D", parm
);
3261 error ("%J original definition appeared here", tmpl_parm
);
3265 if (parm_default
!= NULL_TREE
)
3266 /* Update the previous template parameters (which are the ones
3267 that will really count) with the new default value. */
3268 TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
)) = parm_default
;
3269 else if (tmpl_default
!= NULL_TREE
)
3270 /* Update the new parameters, too; they'll be used as the
3271 parameters for any members. */
3272 TREE_PURPOSE (TREE_VEC_ELT (parms
, i
)) = tmpl_default
;
3276 /* Simplify EXPR if it is a non-dependent expression. Returns the
3277 (possibly simplified) expression. */
3280 fold_non_dependent_expr (tree expr
)
3282 /* If we're in a template, but EXPR isn't value dependent, simplify
3283 it. We're supposed to treat:
3285 template <typename T> void f(T[1 + 1]);
3286 template <typename T> void f(T[2]);
3288 as two declarations of the same function, for example. */
3289 if (processing_template_decl
3290 && !type_dependent_expression_p (expr
)
3291 && !value_dependent_expression_p (expr
))
3293 HOST_WIDE_INT saved_processing_template_decl
;
3295 saved_processing_template_decl
= processing_template_decl
;
3296 processing_template_decl
= 0;
3297 expr
= tsubst_copy_and_build (expr
,
3300 /*in_decl=*/NULL_TREE
,
3301 /*function_p=*/false);
3302 processing_template_decl
= saved_processing_template_decl
;
3307 /* EXPR is an expression which is used in a constant-expression context.
3308 For instance, it could be a VAR_DECL with a constant initializer.
3309 Extract the innest constant expression.
3311 This is basically a more powerful version of
3312 integral_constant_value, which can be used also in templates where
3313 initializers can maintain a syntactic rather than semantic form
3314 (even if they are non-dependent, for access-checking purposes). */
3317 fold_decl_constant_value (tree expr
)
3319 tree const_expr
= expr
;
3322 expr
= fold_non_dependent_expr (const_expr
);
3323 const_expr
= integral_constant_value (expr
);
3325 while (expr
!= const_expr
);
3330 /* Subroutine of convert_nontype_argument. Converts EXPR to TYPE, which
3331 must be a function or a pointer-to-function type, as specified
3332 in [temp.arg.nontype]: disambiguate EXPR if it is an overload set,
3333 and check that the resulting function has external linkage. */
3336 convert_nontype_argument_function (tree type
, tree expr
)
3341 fn
= instantiate_type (type
, fns
, tf_none
);
3342 if (fn
== error_mark_node
)
3343 return error_mark_node
;
3346 if (TREE_CODE (fn_no_ptr
) == ADDR_EXPR
)
3347 fn_no_ptr
= TREE_OPERAND (fn_no_ptr
, 0);
3349 /* [temp.arg.nontype]/1
3351 A template-argument for a non-type, non-template template-parameter
3354 -- the address of an object or function with external linkage. */
3355 if (!DECL_EXTERNAL_LINKAGE_P (fn_no_ptr
))
3357 error ("%qE is not a valid template argument for type %qT "
3358 "because function %qD has not external linkage",
3359 expr
, type
, fn_no_ptr
);
3366 /* Attempt to convert the non-type template parameter EXPR to the
3367 indicated TYPE. If the conversion is successful, return the
3368 converted value. If the conversion is unsuccessful, return
3369 NULL_TREE if we issued an error message, or error_mark_node if we
3370 did not. We issue error messages for out-and-out bad template
3371 parameters, but not simply because the conversion failed, since we
3372 might be just trying to do argument deduction. Both TYPE and EXPR
3373 must be non-dependent.
3375 The conversion follows the special rules described in
3376 [temp.arg.nontype], and it is much more strict than an implicit
3379 This function is called twice for each template argument (see
3380 lookup_template_class for a more accurate description of this
3381 problem). This means that we need to handle expressions which
3382 are not valid in a C++ source, but can be created from the
3383 first call (for instance, casts to perform conversions). These
3384 hacks can go away after we fix the double coercion problem. */
3387 convert_nontype_argument (tree type
, tree expr
)
3391 /* Detect immediately string literals as invalid non-type argument.
3392 This special-case is not needed for correctness (we would easily
3393 catch this later), but only to provide better diagnostic for this
3394 common user mistake. As suggested by DR 100, we do not mention
3395 linkage issues in the diagnostic as this is not the point. */
3396 if (TREE_CODE (expr
) == STRING_CST
)
3398 error ("%qE is not a valid template argument for type %qT "
3399 "because string literals can never be used in this context",
3404 /* If we are in a template, EXPR may be non-dependent, but still
3405 have a syntactic, rather than semantic, form. For example, EXPR
3406 might be a SCOPE_REF, rather than the VAR_DECL to which the
3407 SCOPE_REF refers. Preserving the qualifying scope is necessary
3408 so that access checking can be performed when the template is
3409 instantiated -- but here we need the resolved form so that we can
3410 convert the argument. */
3411 expr
= fold_non_dependent_expr (expr
);
3412 expr_type
= TREE_TYPE (expr
);
3414 /* HACK: Due to double coercion, we can get a
3415 NOP_EXPR<REFERENCE_TYPE>(ADDR_EXPR<POINTER_TYPE> (arg)) here,
3416 which is the tree that we built on the first call (see
3417 below when coercing to reference to object or to reference to
3418 function). We just strip everything and get to the arg.
3419 See g++.old-deja/g++.oliva/template4.C and g++.dg/template/nontype9.C
3421 if (TREE_CODE (expr
) == NOP_EXPR
)
3423 if (TYPE_REF_OBJ_P (type
) || TYPE_REFFN_P (type
))
3425 /* ??? Maybe we could use convert_from_reference here, but we
3426 would need to relax its constraints because the NOP_EXPR
3427 could actually change the type to something more cv-qualified,
3428 and this is not folded by convert_from_reference. */
3429 tree addr
= TREE_OPERAND (expr
, 0);
3430 gcc_assert (TREE_CODE (expr_type
) == REFERENCE_TYPE
);
3431 gcc_assert (TREE_CODE (addr
) == ADDR_EXPR
);
3432 gcc_assert (TREE_CODE (TREE_TYPE (addr
)) == POINTER_TYPE
);
3433 gcc_assert (same_type_ignoring_top_level_qualifiers_p
3434 (TREE_TYPE (expr_type
),
3435 TREE_TYPE (TREE_TYPE (addr
))));
3437 expr
= TREE_OPERAND (addr
, 0);
3438 expr_type
= TREE_TYPE (expr
);
3441 /* We could also generate a NOP_EXPR(ADDR_EXPR()) when the
3442 parameter is a pointer to object, through decay and
3443 qualification conversion. Let's strip everything. */
3444 else if (TYPE_PTROBV_P (type
))
3447 gcc_assert (TREE_CODE (expr
) == ADDR_EXPR
);
3448 gcc_assert (TREE_CODE (TREE_TYPE (expr
)) == POINTER_TYPE
);
3449 /* Skip the ADDR_EXPR only if it is part of the decay for
3450 an array. Otherwise, it is part of the original argument
3451 in the source code. */
3452 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (expr
, 0))) == ARRAY_TYPE
)
3453 expr
= TREE_OPERAND (expr
, 0);
3454 expr_type
= TREE_TYPE (expr
);
3458 /* [temp.arg.nontype]/5, bullet 1
3460 For a non-type template-parameter of integral or enumeration type,
3461 integral promotions (_conv.prom_) and integral conversions
3462 (_conv.integral_) are applied. */
3463 if (INTEGRAL_TYPE_P (type
))
3465 if (!INTEGRAL_TYPE_P (expr_type
))
3466 return error_mark_node
;
3468 expr
= fold_decl_constant_value (expr
);
3469 /* Notice that there are constant expressions like '4 % 0' which
3470 do not fold into integer constants. */
3471 if (TREE_CODE (expr
) != INTEGER_CST
)
3473 error ("%qE is not a valid template argument for type %qT "
3474 "because it is a non-constant expression", expr
, type
);
3478 /* At this point, an implicit conversion does what we want,
3479 because we already know that the expression is of integral
3481 expr
= ocp_convert (type
, expr
, CONV_IMPLICIT
, LOOKUP_PROTECT
);
3482 if (expr
== error_mark_node
)
3483 return error_mark_node
;
3485 /* Conversion was allowed: fold it to a bare integer constant. */
3488 /* [temp.arg.nontype]/5, bullet 2
3490 For a non-type template-parameter of type pointer to object,
3491 qualification conversions (_conv.qual_) and the array-to-pointer
3492 conversion (_conv.array_) are applied. */
3493 else if (TYPE_PTROBV_P (type
))
3495 /* [temp.arg.nontype]/1 (TC1 version, DR 49):
3497 A template-argument for a non-type, non-template template-parameter
3498 shall be one of: [...]
3500 -- the name of a non-type template-parameter;
3501 -- the address of an object or function with external linkage, [...]
3502 expressed as "& id-expression" where the & is optional if the name
3503 refers to a function or array, or if the corresponding
3504 template-parameter is a reference.
3506 Here, we do not care about functions, as they are invalid anyway
3507 for a parameter of type pointer-to-object. */
3508 bool constant_address_p
=
3509 (TREE_CODE (expr
) == ADDR_EXPR
3510 || TREE_CODE (expr_type
) == ARRAY_TYPE
3511 || (DECL_P (expr
) && DECL_TEMPLATE_PARM_P (expr
)));
3513 expr
= decay_conversion (expr
);
3514 if (expr
== error_mark_node
)
3515 return error_mark_node
;
3517 expr
= perform_qualification_conversions (type
, expr
);
3518 if (expr
== error_mark_node
)
3519 return error_mark_node
;
3521 if (!constant_address_p
)
3523 error ("%qE is not a valid template argument for type %qT "
3524 "because it is not a constant pointer", expr
, type
);
3528 /* [temp.arg.nontype]/5, bullet 3
3530 For a non-type template-parameter of type reference to object, no
3531 conversions apply. The type referred to by the reference may be more
3532 cv-qualified than the (otherwise identical) type of the
3533 template-argument. The template-parameter is bound directly to the
3534 template-argument, which must be an lvalue. */
3535 else if (TYPE_REF_OBJ_P (type
))
3537 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type
),
3539 return error_mark_node
;
3541 if (!at_least_as_qualified_p (TREE_TYPE (type
), expr_type
))
3543 error ("%qE is not a valid template argument for type %qT "
3544 "because of conflicts in cv-qualification", expr
, type
);
3548 if (!real_lvalue_p (expr
))
3550 error ("%qE is not a valid template argument for type %qT "
3551 "because it is not a lvalue", expr
, type
);
3555 /* [temp.arg.nontype]/1
3557 A template-argument for a non-type, non-template template-parameter
3558 shall be one of: [...]
3560 -- the address of an object or function with external linkage. */
3561 if (!DECL_EXTERNAL_LINKAGE_P (expr
))
3563 error ("%qE is not a valid template argument for type %qT "
3564 "because object %qD has not external linkage",
3569 expr
= build_nop (type
, build_address (expr
));
3571 /* [temp.arg.nontype]/5, bullet 4
3573 For a non-type template-parameter of type pointer to function, only
3574 the function-to-pointer conversion (_conv.func_) is applied. If the
3575 template-argument represents a set of overloaded functions (or a
3576 pointer to such), the matching function is selected from the set
3578 else if (TYPE_PTRFN_P (type
))
3580 /* If the argument is a template-id, we might not have enough
3581 context information to decay the pointer.
3582 ??? Why static5.C requires decay and subst1.C works fine
3584 if (!type_unknown_p (expr_type
))
3586 expr
= decay_conversion (expr
);
3587 if (expr
== error_mark_node
)
3588 return error_mark_node
;
3591 expr
= convert_nontype_argument_function (type
, expr
);
3592 if (!expr
|| expr
== error_mark_node
)
3595 /* [temp.arg.nontype]/5, bullet 5
3597 For a non-type template-parameter of type reference to function, no
3598 conversions apply. If the template-argument represents a set of
3599 overloaded functions, the matching function is selected from the set
3601 else if (TYPE_REFFN_P (type
))
3603 if (TREE_CODE (expr
) == ADDR_EXPR
)
3605 error ("%qE is not a valid template argument for type %qT "
3606 "because it is a pointer", expr
, type
);
3607 inform ("try using %qE instead", TREE_OPERAND (expr
, 0));
3611 expr
= convert_nontype_argument_function (TREE_TYPE (type
), expr
);
3612 if (!expr
|| expr
== error_mark_node
)
3615 expr
= build_nop (type
, build_address (expr
));
3617 /* [temp.arg.nontype]/5, bullet 6
3619 For a non-type template-parameter of type pointer to member function,
3620 no conversions apply. If the template-argument represents a set of
3621 overloaded member functions, the matching member function is selected
3622 from the set (_over.over_). */
3623 else if (TYPE_PTRMEMFUNC_P (type
))
3625 expr
= instantiate_type (type
, expr
, tf_none
);
3626 if (expr
== error_mark_node
)
3627 return error_mark_node
;
3629 /* There is no way to disable standard conversions in
3630 resolve_address_of_overloaded_function (called by
3631 instantiate_type). It is possible that the call succeeded by
3632 converting &B::I to &D::I (where B is a base of D), so we need
3633 to reject this conversion here.
3635 Actually, even if there was a way to disable standard conversions,
3636 it would still be better to reject them here so that we can
3637 provide a superior diagnostic. */
3638 if (!same_type_p (TREE_TYPE (expr
), type
))
3640 /* Make sure we are just one standard conversion off. */
3641 gcc_assert (can_convert (type
, TREE_TYPE (expr
)));
3642 error ("%qE is not a valid template argument for type %qT "
3643 "because it is of type %qT", expr
, type
,
3645 inform ("standard conversions are not allowed in this context");
3649 /* [temp.arg.nontype]/5, bullet 7
3651 For a non-type template-parameter of type pointer to data member,
3652 qualification conversions (_conv.qual_) are applied. */
3653 else if (TYPE_PTRMEM_P (type
))
3655 expr
= perform_qualification_conversions (type
, expr
);
3656 if (expr
== error_mark_node
)
3659 /* A template non-type parameter must be one of the above. */
3663 /* Sanity check: did we actually convert the argument to the
3665 gcc_assert (same_type_p (type
, TREE_TYPE (expr
)));
3670 /* Return 1 if PARM_PARMS and ARG_PARMS matches using rule for
3671 template template parameters. Both PARM_PARMS and ARG_PARMS are
3672 vectors of TREE_LIST nodes containing TYPE_DECL, TEMPLATE_DECL
3675 ARG_PARMS may contain more parameters than PARM_PARMS. If this is
3676 the case, then extra parameters must have default arguments.
3678 Consider the example:
3679 template <class T, class Allocator = allocator> class vector;
3680 template<template <class U> class TT> class C;
3682 C<vector> is a valid instantiation. PARM_PARMS for the above code
3683 contains a TYPE_DECL (for U), ARG_PARMS contains two TYPE_DECLs (for
3684 T and Allocator) and OUTER_ARGS contains the argument that is used to
3685 substitute the TT parameter. */
3688 coerce_template_template_parms (tree parm_parms
,
3690 tsubst_flags_t complain
,
3694 int nparms
, nargs
, i
;
3697 gcc_assert (TREE_CODE (parm_parms
) == TREE_VEC
);
3698 gcc_assert (TREE_CODE (arg_parms
) == TREE_VEC
);
3700 nparms
= TREE_VEC_LENGTH (parm_parms
);
3701 nargs
= TREE_VEC_LENGTH (arg_parms
);
3703 /* The rule here is opposite of coerce_template_parms. */
3706 && TREE_PURPOSE (TREE_VEC_ELT (arg_parms
, nparms
)) == NULL_TREE
))
3709 for (i
= 0; i
< nparms
; ++i
)
3711 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, i
));
3712 arg
= TREE_VALUE (TREE_VEC_ELT (arg_parms
, i
));
3714 if (arg
== NULL_TREE
|| arg
== error_mark_node
3715 || parm
== NULL_TREE
|| parm
== error_mark_node
)
3718 if (TREE_CODE (arg
) != TREE_CODE (parm
))
3721 switch (TREE_CODE (parm
))
3727 /* We encounter instantiations of templates like
3728 template <template <template <class> class> class TT>
3731 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
3732 tree argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
3734 if (!coerce_template_template_parms
3735 (parmparm
, argparm
, complain
, in_decl
, outer_args
))
3741 /* The tsubst call is used to handle cases such as
3743 template <int> class C {};
3744 template <class T, template <T> class TT> class D {};
3747 i.e. the parameter list of TT depends on earlier parameters. */
3748 if (!dependent_type_p (TREE_TYPE (arg
))
3750 (tsubst (TREE_TYPE (parm
), outer_args
, complain
, in_decl
),
3762 /* Convert the indicated template ARG as necessary to match the
3763 indicated template PARM. Returns the converted ARG, or
3764 error_mark_node if the conversion was unsuccessful. Error and
3765 warning messages are issued under control of COMPLAIN. This
3766 conversion is for the Ith parameter in the parameter list. ARGS is
3767 the full set of template arguments deduced so far. */
3770 convert_template_argument (tree parm
,
3773 tsubst_flags_t complain
,
3779 int is_type
, requires_type
, is_tmpl_type
, requires_tmpl_type
;
3781 inner_args
= INNERMOST_TEMPLATE_ARGS (args
);
3783 if (TREE_CODE (arg
) == TREE_LIST
3784 && TREE_CODE (TREE_VALUE (arg
)) == OFFSET_REF
)
3786 /* The template argument was the name of some
3787 member function. That's usually
3788 invalid, but static members are OK. In any
3789 case, grab the underlying fields/functions
3790 and issue an error later if required. */
3791 arg
= TREE_VALUE (arg
);
3792 TREE_TYPE (arg
) = unknown_type_node
;
3795 requires_tmpl_type
= TREE_CODE (parm
) == TEMPLATE_DECL
;
3796 requires_type
= (TREE_CODE (parm
) == TYPE_DECL
3797 || requires_tmpl_type
);
3799 is_tmpl_type
= ((TREE_CODE (arg
) == TEMPLATE_DECL
3800 && TREE_CODE (DECL_TEMPLATE_RESULT (arg
)) == TYPE_DECL
)
3801 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
3802 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
);
3805 && (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
3806 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
))
3807 arg
= TYPE_STUB_DECL (arg
);
3809 is_type
= TYPE_P (arg
) || is_tmpl_type
;
3811 if (requires_type
&& ! is_type
&& TREE_CODE (arg
) == SCOPE_REF
3812 && TREE_CODE (TREE_OPERAND (arg
, 0)) == TEMPLATE_TYPE_PARM
)
3814 pedwarn ("to refer to a type member of a template parameter, "
3815 "use %<typename %E%>", arg
);
3817 arg
= make_typename_type (TREE_OPERAND (arg
, 0),
3818 TREE_OPERAND (arg
, 1),
3820 complain
& tf_error
);
3823 if (is_type
!= requires_type
)
3827 if (complain
& tf_error
)
3829 error ("type/value mismatch at argument %d in template "
3830 "parameter list for %qD",
3833 error (" expected a constant of type %qT, got %qT",
3835 (is_tmpl_type
? DECL_NAME (arg
) : arg
));
3836 else if (requires_tmpl_type
)
3837 error (" expected a class template, got %qE", arg
);
3839 error (" expected a type, got %qE", arg
);
3842 return error_mark_node
;
3844 if (is_tmpl_type
^ requires_tmpl_type
)
3846 if (in_decl
&& (complain
& tf_error
))
3848 error ("type/value mismatch at argument %d in template "
3849 "parameter list for %qD",
3852 error (" expected a type, got %qT", DECL_NAME (arg
));
3854 error (" expected a class template, got %qT", arg
);
3856 return error_mark_node
;
3861 if (requires_tmpl_type
)
3863 if (TREE_CODE (TREE_TYPE (arg
)) == UNBOUND_CLASS_TEMPLATE
)
3864 /* The number of argument required is not known yet.
3865 Just accept it for now. */
3866 val
= TREE_TYPE (arg
);
3869 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
3870 tree argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
3872 if (coerce_template_template_parms (parmparm
, argparm
,
3878 /* TEMPLATE_TEMPLATE_PARM node is preferred over
3880 if (val
!= error_mark_node
3881 && DECL_TEMPLATE_TEMPLATE_PARM_P (val
))
3882 val
= TREE_TYPE (val
);
3886 if (in_decl
&& (complain
& tf_error
))
3888 error ("type/value mismatch at argument %d in "
3889 "template parameter list for %qD",
3891 error (" expected a template of type %qD, got %qD",
3895 val
= error_mark_node
;
3904 tree t
= tsubst (TREE_TYPE (parm
), args
, complain
, in_decl
);
3906 if (invalid_nontype_parm_type_p (t
, complain
))
3907 return error_mark_node
;
3909 if (!uses_template_parms (arg
) && !uses_template_parms (t
))
3910 /* We used to call digest_init here. However, digest_init
3911 will report errors, which we don't want when complain
3912 is zero. More importantly, digest_init will try too
3913 hard to convert things: for example, `0' should not be
3914 converted to pointer type at this point according to
3915 the standard. Accepting this is not merely an
3916 extension, since deciding whether or not these
3917 conversions can occur is part of determining which
3918 function template to call, or whether a given explicit
3919 argument specification is valid. */
3920 val
= convert_nontype_argument (t
, arg
);
3924 if (val
== NULL_TREE
)
3925 val
= error_mark_node
;
3926 else if (val
== error_mark_node
&& (complain
& tf_error
))
3927 error ("could not convert template argument %qE to %qT", arg
, t
);
3933 /* Convert all template arguments to their appropriate types, and
3934 return a vector containing the innermost resulting template
3935 arguments. If any error occurs, return error_mark_node. Error and
3936 warning messages are issued under control of COMPLAIN.
3938 If REQUIRE_ALL_ARGUMENTS is nonzero, all arguments must be
3939 provided in ARGLIST, or else trailing parameters must have default
3940 values. If REQUIRE_ALL_ARGUMENTS is zero, we will attempt argument
3941 deduction for any unspecified trailing arguments. */
3944 coerce_template_parms (tree parms
,
3947 tsubst_flags_t complain
,
3948 int require_all_arguments
)
3950 int nparms
, nargs
, i
, lost
= 0;
3953 tree new_inner_args
;
3955 inner_args
= INNERMOST_TEMPLATE_ARGS (args
);
3956 nargs
= inner_args
? NUM_TMPL_ARGS (inner_args
) : 0;
3957 nparms
= TREE_VEC_LENGTH (parms
);
3961 && require_all_arguments
3962 && TREE_PURPOSE (TREE_VEC_ELT (parms
, nargs
)) == NULL_TREE
))
3964 if (complain
& tf_error
)
3966 error ("wrong number of template arguments (%d, should be %d)",
3970 cp_error_at ("provided for %qD", in_decl
);
3973 return error_mark_node
;
3976 new_inner_args
= make_tree_vec (nparms
);
3977 new_args
= add_outermost_template_args (args
, new_inner_args
);
3978 for (i
= 0; i
< nparms
; i
++)
3983 /* Get the Ith template parameter. */
3984 parm
= TREE_VEC_ELT (parms
, i
);
3986 /* Calculate the Ith argument. */
3988 arg
= TREE_VEC_ELT (inner_args
, i
);
3989 else if (require_all_arguments
)
3990 /* There must be a default arg in this case. */
3991 arg
= tsubst_template_arg (TREE_PURPOSE (parm
), new_args
,
3997 if (arg
== error_mark_node
)
3999 if (complain
& tf_error
)
4000 error ("template argument %d is invalid", i
+ 1);
4003 arg
= convert_template_argument (TREE_VALUE (parm
),
4004 arg
, new_args
, complain
, i
,
4007 if (arg
== error_mark_node
)
4009 TREE_VEC_ELT (new_inner_args
, i
) = arg
;
4013 return error_mark_node
;
4015 return new_inner_args
;
4018 /* Returns 1 if template args OT and NT are equivalent. */
4021 template_args_equal (tree ot
, tree nt
)
4026 if (TREE_CODE (nt
) == TREE_VEC
)
4027 /* For member templates */
4028 return TREE_CODE (ot
) == TREE_VEC
&& comp_template_args (ot
, nt
);
4029 else if (TYPE_P (nt
))
4030 return TYPE_P (ot
) && same_type_p (ot
, nt
);
4031 else if (TREE_CODE (ot
) == TREE_VEC
|| TYPE_P (ot
))
4034 return cp_tree_equal (ot
, nt
);
4037 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets
4038 of template arguments. Returns 0 otherwise. */
4041 comp_template_args (tree oldargs
, tree newargs
)
4045 if (TREE_VEC_LENGTH (oldargs
) != TREE_VEC_LENGTH (newargs
))
4048 for (i
= 0; i
< TREE_VEC_LENGTH (oldargs
); ++i
)
4050 tree nt
= TREE_VEC_ELT (newargs
, i
);
4051 tree ot
= TREE_VEC_ELT (oldargs
, i
);
4053 if (! template_args_equal (ot
, nt
))
4059 /* Given class template name and parameter list, produce a user-friendly name
4060 for the instantiation. */
4063 mangle_class_name_for_template (const char* name
, tree parms
, tree arglist
)
4065 static struct obstack scratch_obstack
;
4066 static char *scratch_firstobj
;
4069 if (!scratch_firstobj
)
4070 gcc_obstack_init (&scratch_obstack
);
4072 obstack_free (&scratch_obstack
, scratch_firstobj
);
4073 scratch_firstobj
= obstack_alloc (&scratch_obstack
, 1);
4075 #define ccat(C) obstack_1grow (&scratch_obstack, (C));
4076 #define cat(S) obstack_grow (&scratch_obstack, (S), strlen (S))
4080 nparms
= TREE_VEC_LENGTH (parms
);
4081 arglist
= INNERMOST_TEMPLATE_ARGS (arglist
);
4082 gcc_assert (nparms
== TREE_VEC_LENGTH (arglist
));
4083 for (i
= 0; i
< nparms
; i
++)
4085 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
4086 tree arg
= TREE_VEC_ELT (arglist
, i
);
4091 if (TREE_CODE (parm
) == TYPE_DECL
)
4093 cat (type_as_string (arg
, TFF_CHASE_TYPEDEF
));
4096 else if (TREE_CODE (parm
) == TEMPLATE_DECL
)
4098 if (TREE_CODE (arg
) == TEMPLATE_DECL
)
4100 /* Already substituted with real template. Just output
4101 the template name here */
4102 tree context
= DECL_CONTEXT (arg
);
4105 /* The template may be defined in a namespace, or
4106 may be a member template. */
4107 gcc_assert (TREE_CODE (context
) == NAMESPACE_DECL
4108 || CLASS_TYPE_P (context
));
4109 cat (decl_as_string (DECL_CONTEXT (arg
),
4110 TFF_PLAIN_IDENTIFIER
));
4113 cat (IDENTIFIER_POINTER (DECL_NAME (arg
)));
4116 /* Output the parameter declaration. */
4117 cat (type_as_string (arg
, TFF_CHASE_TYPEDEF
));
4121 gcc_assert (TREE_CODE (parm
) == PARM_DECL
);
4123 /* No need to check arglist against parmlist here; we did that
4124 in coerce_template_parms, called from lookup_template_class. */
4125 cat (expr_as_string (arg
, TFF_PLAIN_IDENTIFIER
));
4128 char *bufp
= obstack_next_free (&scratch_obstack
);
4130 while (bufp
[offset
- 1] == ' ')
4132 obstack_blank_fast (&scratch_obstack
, offset
);
4134 /* B<C<char> >, not B<C<char>> */
4135 if (bufp
[offset
- 1] == '>')
4140 return (char *) obstack_base (&scratch_obstack
);
4144 classtype_mangled_name (tree t
)
4146 if (CLASSTYPE_TEMPLATE_INFO (t
)
4147 /* Specializations have already had their names set up in
4148 lookup_template_class. */
4149 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
4151 tree tmpl
= most_general_template (CLASSTYPE_TI_TEMPLATE (t
));
4153 /* For non-primary templates, the template parameters are
4154 implicit from their surrounding context. */
4155 if (PRIMARY_TEMPLATE_P (tmpl
))
4157 tree name
= DECL_NAME (tmpl
);
4158 char *mangled_name
= mangle_class_name_for_template
4159 (IDENTIFIER_POINTER (name
),
4160 DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
4161 CLASSTYPE_TI_ARGS (t
));
4162 tree id
= get_identifier (mangled_name
);
4163 IDENTIFIER_TEMPLATE (id
) = name
;
4168 return TYPE_IDENTIFIER (t
);
4172 add_pending_template (tree d
)
4174 tree ti
= (TYPE_P (d
)
4175 ? CLASSTYPE_TEMPLATE_INFO (d
)
4176 : DECL_TEMPLATE_INFO (d
));
4180 if (TI_PENDING_TEMPLATE_FLAG (ti
))
4183 /* We are called both from instantiate_decl, where we've already had a
4184 tinst_level pushed, and instantiate_template, where we haven't.
4186 level
= !(current_tinst_level
&& TINST_DECL (current_tinst_level
) == d
);
4189 push_tinst_level (d
);
4191 pt
= tree_cons (current_tinst_level
, d
, NULL_TREE
);
4192 if (last_pending_template
)
4193 TREE_CHAIN (last_pending_template
) = pt
;
4195 pending_templates
= pt
;
4197 last_pending_template
= pt
;
4199 TI_PENDING_TEMPLATE_FLAG (ti
) = 1;
4206 /* Return a TEMPLATE_ID_EXPR corresponding to the indicated FNS and
4207 ARGLIST. Valid choices for FNS are given in the cp-tree.def
4208 documentation for TEMPLATE_ID_EXPR. */
4211 lookup_template_function (tree fns
, tree arglist
)
4215 if (fns
== error_mark_node
|| arglist
== error_mark_node
)
4216 return error_mark_node
;
4218 gcc_assert (!arglist
|| TREE_CODE (arglist
) == TREE_VEC
);
4219 gcc_assert (fns
&& (is_overloaded_fn (fns
)
4220 || TREE_CODE (fns
) == IDENTIFIER_NODE
));
4222 if (BASELINK_P (fns
))
4224 BASELINK_FUNCTIONS (fns
) = build2 (TEMPLATE_ID_EXPR
,
4226 BASELINK_FUNCTIONS (fns
),
4231 type
= TREE_TYPE (fns
);
4232 if (TREE_CODE (fns
) == OVERLOAD
|| !type
)
4233 type
= unknown_type_node
;
4235 return build2 (TEMPLATE_ID_EXPR
, type
, fns
, arglist
);
4238 /* Within the scope of a template class S<T>, the name S gets bound
4239 (in build_self_reference) to a TYPE_DECL for the class, not a
4240 TEMPLATE_DECL. If DECL is a TYPE_DECL for current_class_type,
4241 or one of its enclosing classes, and that type is a template,
4242 return the associated TEMPLATE_DECL. Otherwise, the original
4243 DECL is returned. */
4246 maybe_get_template_decl_from_type_decl (tree decl
)
4248 return (decl
!= NULL_TREE
4249 && TREE_CODE (decl
) == TYPE_DECL
4250 && DECL_ARTIFICIAL (decl
)
4251 && CLASS_TYPE_P (TREE_TYPE (decl
))
4252 && CLASSTYPE_TEMPLATE_INFO (TREE_TYPE (decl
)))
4253 ? CLASSTYPE_TI_TEMPLATE (TREE_TYPE (decl
)) : decl
;
4256 /* Given an IDENTIFIER_NODE (type TEMPLATE_DECL) and a chain of
4257 parameters, find the desired type.
4259 D1 is the PTYPENAME terminal, and ARGLIST is the list of arguments.
4261 IN_DECL, if non-NULL, is the template declaration we are trying to
4264 If ENTERING_SCOPE is nonzero, we are about to enter the scope of
4265 the class we are looking up.
4267 Issue error and warning messages under control of COMPLAIN.
4269 If the template class is really a local class in a template
4270 function, then the FUNCTION_CONTEXT is the function in which it is
4273 ??? Note that this function is currently called *twice* for each
4274 template-id: the first time from the parser, while creating the
4275 incomplete type (finish_template_type), and the second type during the
4276 real instantiation (instantiate_template_class). This is surely something
4277 that we want to avoid. It also causes some problems with argument
4278 coercion (see convert_nontype_argument for more information on this). */
4281 lookup_template_class (tree d1
,
4286 tsubst_flags_t complain
)
4288 tree
template = NULL_TREE
, parmlist
;
4291 timevar_push (TV_NAME_LOOKUP
);
4293 if (TREE_CODE (d1
) == IDENTIFIER_NODE
)
4295 tree value
= innermost_non_namespace_value (d1
);
4296 if (value
&& DECL_TEMPLATE_TEMPLATE_PARM_P (value
))
4301 push_decl_namespace (context
);
4302 template = lookup_name (d1
, /*prefer_type=*/0);
4303 template = maybe_get_template_decl_from_type_decl (template);
4305 pop_decl_namespace ();
4308 context
= DECL_CONTEXT (template);
4310 else if (TREE_CODE (d1
) == TYPE_DECL
&& IS_AGGR_TYPE (TREE_TYPE (d1
)))
4312 tree type
= TREE_TYPE (d1
);
4314 /* If we are declaring a constructor, say A<T>::A<T>, we will get
4315 an implicit typename for the second A. Deal with it. */
4316 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
4317 type
= TREE_TYPE (type
);
4319 if (CLASSTYPE_TEMPLATE_INFO (type
))
4321 template = CLASSTYPE_TI_TEMPLATE (type
);
4322 d1
= DECL_NAME (template);
4325 else if (TREE_CODE (d1
) == ENUMERAL_TYPE
4326 || (TYPE_P (d1
) && IS_AGGR_TYPE (d1
)))
4328 template = TYPE_TI_TEMPLATE (d1
);
4329 d1
= DECL_NAME (template);
4331 else if (TREE_CODE (d1
) == TEMPLATE_DECL
4332 && TREE_CODE (DECL_TEMPLATE_RESULT (d1
)) == TYPE_DECL
)
4335 d1
= DECL_NAME (template);
4336 context
= DECL_CONTEXT (template);
4339 /* Issue an error message if we didn't find a template. */
4342 if (complain
& tf_error
)
4343 error ("%qT is not a template", d1
);
4344 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP
, error_mark_node
);
4347 if (TREE_CODE (template) != TEMPLATE_DECL
4348 /* Make sure it's a user visible template, if it was named by
4350 || ((complain
& tf_user
) && !DECL_TEMPLATE_PARM_P (template)
4351 && !PRIMARY_TEMPLATE_P (template)))
4353 if (complain
& tf_error
)
4355 error ("non-template type %qT used as a template", d1
);
4357 cp_error_at ("for template declaration %qD", in_decl
);
4359 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP
, error_mark_node
);
4362 complain
&= ~tf_user
;
4364 if (DECL_TEMPLATE_TEMPLATE_PARM_P (template))
4366 /* Create a new TEMPLATE_DECL and TEMPLATE_TEMPLATE_PARM node to store
4367 template arguments */
4372 parmlist
= DECL_INNERMOST_TEMPLATE_PARMS (template);
4374 /* Consider an example where a template template parameter declared as
4376 template <class T, class U = std::allocator<T> > class TT
4378 The template parameter level of T and U are one level larger than
4379 of TT. To proper process the default argument of U, say when an
4380 instantiation `TT<int>' is seen, we need to build the full
4381 arguments containing {int} as the innermost level. Outer levels,
4382 available when not appearing as default template argument, can be
4383 obtained from `current_template_args ()'.
4385 Suppose that TT is later substituted with std::vector. The above
4386 instantiation is `TT<int, std::allocator<T> >' with TT at
4387 level 1, and T at level 2, while the template arguments at level 1
4388 becomes {std::vector} and the inner level 2 is {int}. */
4390 if (current_template_parms
)
4391 arglist
= add_to_template_args (current_template_args (), arglist
);
4393 arglist2
= coerce_template_parms (parmlist
, arglist
, template,
4394 complain
, /*require_all_args=*/1);
4395 if (arglist2
== error_mark_node
4396 || (!uses_template_parms (arglist2
)
4397 && check_instantiated_args (template, arglist2
, complain
)))
4398 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP
, error_mark_node
);
4400 parm
= bind_template_template_parm (TREE_TYPE (template), arglist2
);
4401 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP
, parm
);
4405 tree template_type
= TREE_TYPE (template);
4408 tree found
= NULL_TREE
;
4411 int is_partial_instantiation
;
4413 gen_tmpl
= most_general_template (template);
4414 parmlist
= DECL_TEMPLATE_PARMS (gen_tmpl
);
4415 parm_depth
= TMPL_PARMS_DEPTH (parmlist
);
4416 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
4418 if (arg_depth
== 1 && parm_depth
> 1)
4420 /* We've been given an incomplete set of template arguments.
4423 template <class T> struct S1 {
4424 template <class U> struct S2 {};
4425 template <class U> struct S2<U*> {};
4428 we will be called with an ARGLIST of `U*', but the
4429 TEMPLATE will be `template <class T> template
4430 <class U> struct S1<T>::S2'. We must fill in the missing
4433 = add_outermost_template_args (TYPE_TI_ARGS (TREE_TYPE (template)),
4435 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
4438 /* Now we should have enough arguments. */
4439 gcc_assert (parm_depth
== arg_depth
);
4441 /* From here on, we're only interested in the most general
4443 template = gen_tmpl
;
4445 /* Calculate the BOUND_ARGS. These will be the args that are
4446 actually tsubst'd into the definition to create the
4450 /* We have multiple levels of arguments to coerce, at once. */
4452 int saved_depth
= TMPL_ARGS_DEPTH (arglist
);
4454 tree bound_args
= make_tree_vec (parm_depth
);
4456 for (i
= saved_depth
,
4457 t
= DECL_TEMPLATE_PARMS (template);
4458 i
> 0 && t
!= NULL_TREE
;
4459 --i
, t
= TREE_CHAIN (t
))
4461 tree a
= coerce_template_parms (TREE_VALUE (t
),
4463 complain
, /*require_all_args=*/1);
4465 /* Don't process further if one of the levels fails. */
4466 if (a
== error_mark_node
)
4468 /* Restore the ARGLIST to its full size. */
4469 TREE_VEC_LENGTH (arglist
) = saved_depth
;
4470 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP
, error_mark_node
);
4473 SET_TMPL_ARGS_LEVEL (bound_args
, i
, a
);
4475 /* We temporarily reduce the length of the ARGLIST so
4476 that coerce_template_parms will see only the arguments
4477 corresponding to the template parameters it is
4479 TREE_VEC_LENGTH (arglist
)--;
4482 /* Restore the ARGLIST to its full size. */
4483 TREE_VEC_LENGTH (arglist
) = saved_depth
;
4485 arglist
= bound_args
;
4489 = coerce_template_parms (INNERMOST_TEMPLATE_PARMS (parmlist
),
4490 INNERMOST_TEMPLATE_ARGS (arglist
),
4492 complain
, /*require_all_args=*/1);
4494 if (arglist
== error_mark_node
)
4495 /* We were unable to bind the arguments. */
4496 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP
, error_mark_node
);
4498 /* In the scope of a template class, explicit references to the
4499 template class refer to the type of the template, not any
4500 instantiation of it. For example, in:
4502 template <class T> class C { void f(C<T>); }
4504 the `C<T>' is just the same as `C'. Outside of the
4505 class, however, such a reference is an instantiation. */
4506 if (comp_template_args (TYPE_TI_ARGS (template_type
),
4509 found
= template_type
;
4511 if (!entering_scope
&& PRIMARY_TEMPLATE_P (template))
4515 for (ctx
= current_class_type
;
4516 ctx
&& TREE_CODE (ctx
) != NAMESPACE_DECL
;
4518 ? TYPE_CONTEXT (ctx
)
4519 : DECL_CONTEXT (ctx
)))
4520 if (TYPE_P (ctx
) && same_type_p (ctx
, template_type
))
4523 /* We're not in the scope of the class, so the
4524 TEMPLATE_TYPE is not the type we want after all. */
4530 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP
, found
);
4532 /* If we already have this specialization, return it. */
4533 found
= retrieve_specialization (template, arglist
,
4534 /*class_specializations_p=*/false);
4536 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP
, found
);
4538 /* This type is a "partial instantiation" if any of the template
4539 arguments still involve template parameters. Note that we set
4540 IS_PARTIAL_INSTANTIATION for partial specializations as
4542 is_partial_instantiation
= uses_template_parms (arglist
);
4544 /* If the deduced arguments are invalid, then the binding
4546 if (!is_partial_instantiation
4547 && check_instantiated_args (template,
4548 INNERMOST_TEMPLATE_ARGS (arglist
),
4550 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP
, error_mark_node
);
4552 if (!is_partial_instantiation
4553 && !PRIMARY_TEMPLATE_P (template)
4554 && TREE_CODE (CP_DECL_CONTEXT (template)) == NAMESPACE_DECL
)
4556 found
= xref_tag_from_type (TREE_TYPE (template),
4557 DECL_NAME (template),
4558 /*tag_scope=*/ts_global
);
4559 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP
, found
);
4562 context
= tsubst (DECL_CONTEXT (template), arglist
,
4565 context
= global_namespace
;
4567 /* Create the type. */
4568 if (TREE_CODE (template_type
) == ENUMERAL_TYPE
)
4570 if (!is_partial_instantiation
)
4572 set_current_access_from_decl (TYPE_NAME (template_type
));
4573 t
= start_enum (TYPE_IDENTIFIER (template_type
));
4576 /* We don't want to call start_enum for this type, since
4577 the values for the enumeration constants may involve
4578 template parameters. And, no one should be interested
4579 in the enumeration constants for such a type. */
4580 t
= make_node (ENUMERAL_TYPE
);
4584 t
= make_aggr_type (TREE_CODE (template_type
));
4585 CLASSTYPE_DECLARED_CLASS (t
)
4586 = CLASSTYPE_DECLARED_CLASS (template_type
);
4587 SET_CLASSTYPE_IMPLICIT_INSTANTIATION (t
);
4588 TYPE_FOR_JAVA (t
) = TYPE_FOR_JAVA (template_type
);
4590 /* A local class. Make sure the decl gets registered properly. */
4591 if (context
== current_function_decl
)
4592 pushtag (DECL_NAME (template), t
, /*tag_scope=*/ts_current
);
4595 /* If we called start_enum or pushtag above, this information
4596 will already be set up. */
4599 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
4601 type_decl
= create_implicit_typedef (DECL_NAME (template), t
);
4602 DECL_CONTEXT (type_decl
) = TYPE_CONTEXT (t
);
4603 TYPE_STUB_DECL (t
) = type_decl
;
4604 DECL_SOURCE_LOCATION (type_decl
)
4605 = DECL_SOURCE_LOCATION (TYPE_STUB_DECL (template_type
));
4608 type_decl
= TYPE_NAME (t
);
4610 TREE_PRIVATE (type_decl
)
4611 = TREE_PRIVATE (TYPE_STUB_DECL (template_type
));
4612 TREE_PROTECTED (type_decl
)
4613 = TREE_PROTECTED (TYPE_STUB_DECL (template_type
));
4615 /* Set up the template information. We have to figure out which
4616 template is the immediate parent if this is a full
4618 if (parm_depth
== 1 || is_partial_instantiation
4619 || !PRIMARY_TEMPLATE_P (template))
4620 /* This case is easy; there are no member templates involved. */
4624 /* This is a full instantiation of a member template. Look
4625 for a partial instantiation of which this is an instance. */
4627 for (found
= DECL_TEMPLATE_INSTANTIATIONS (template);
4628 found
; found
= TREE_CHAIN (found
))
4631 tree tmpl
= CLASSTYPE_TI_TEMPLATE (TREE_VALUE (found
));
4633 /* We only want partial instantiations, here, not
4634 specializations or full instantiations. */
4635 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_VALUE (found
))
4636 || !uses_template_parms (TREE_VALUE (found
)))
4639 /* Temporarily reduce by one the number of levels in the
4640 ARGLIST and in FOUND so as to avoid comparing the
4641 last set of arguments. */
4642 TREE_VEC_LENGTH (arglist
)--;
4643 TREE_VEC_LENGTH (TREE_PURPOSE (found
)) --;
4645 /* See if the arguments match. If they do, then TMPL is
4646 the partial instantiation we want. */
4647 success
= comp_template_args (TREE_PURPOSE (found
), arglist
);
4649 /* Restore the argument vectors to their full size. */
4650 TREE_VEC_LENGTH (arglist
)++;
4651 TREE_VEC_LENGTH (TREE_PURPOSE (found
))++;
4662 /* There was no partial instantiation. This happens
4663 where C<T> is a member template of A<T> and it's used
4666 template <typename T> struct B { A<T>::C<int> m; };
4669 Create the partial instantiation.
4671 TREE_VEC_LENGTH (arglist
)--;
4672 found
= tsubst (template, arglist
, complain
, NULL_TREE
);
4673 TREE_VEC_LENGTH (arglist
)++;
4677 SET_TYPE_TEMPLATE_INFO (t
, tree_cons (found
, arglist
, NULL_TREE
));
4678 DECL_TEMPLATE_INSTANTIATIONS (template)
4679 = tree_cons (arglist
, t
,
4680 DECL_TEMPLATE_INSTANTIATIONS (template));
4682 if (TREE_CODE (t
) == ENUMERAL_TYPE
4683 && !is_partial_instantiation
)
4684 /* Now that the type has been registered on the instantiations
4685 list, we set up the enumerators. Because the enumeration
4686 constants may involve the enumeration type itself, we make
4687 sure to register the type first, and then create the
4688 constants. That way, doing tsubst_expr for the enumeration
4689 constants won't result in recursive calls here; we'll find
4690 the instantiation and exit above. */
4691 tsubst_enum (template_type
, t
, arglist
);
4693 /* Reset the name of the type, now that CLASSTYPE_TEMPLATE_INFO
4695 if (TREE_CODE (t
) != ENUMERAL_TYPE
)
4696 DECL_NAME (type_decl
) = classtype_mangled_name (t
);
4697 if (is_partial_instantiation
)
4698 /* If the type makes use of template parameters, the
4699 code that generates debugging information will crash. */
4700 DECL_IGNORED_P (TYPE_STUB_DECL (t
)) = 1;
4702 POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP
, t
);
4704 timevar_pop (TV_NAME_LOOKUP
);
4711 struct pointer_set_t
*visited
;
4714 /* Called from for_each_template_parm via walk_tree. */
4717 for_each_template_parm_r (tree
*tp
, int *walk_subtrees
, void *d
)
4720 struct pair_fn_data
*pfd
= (struct pair_fn_data
*) d
;
4721 tree_fn_t fn
= pfd
->fn
;
4722 void *data
= pfd
->data
;
4725 && for_each_template_parm (TYPE_CONTEXT (t
), fn
, data
, pfd
->visited
))
4726 return error_mark_node
;
4728 switch (TREE_CODE (t
))
4731 if (TYPE_PTRMEMFUNC_P (t
))
4737 if (!TYPE_TEMPLATE_INFO (t
))
4739 else if (for_each_template_parm (TREE_VALUE (TYPE_TEMPLATE_INFO (t
)),
4740 fn
, data
, pfd
->visited
))
4741 return error_mark_node
;
4745 /* Since we're not going to walk subtrees, we have to do this
4747 if (for_each_template_parm (TYPE_METHOD_BASETYPE (t
), fn
, data
,
4749 return error_mark_node
;
4753 /* Check the return type. */
4754 if (for_each_template_parm (TREE_TYPE (t
), fn
, data
, pfd
->visited
))
4755 return error_mark_node
;
4757 /* Check the parameter types. Since default arguments are not
4758 instantiated until they are needed, the TYPE_ARG_TYPES may
4759 contain expressions that involve template parameters. But,
4760 no-one should be looking at them yet. And, once they're
4761 instantiated, they don't contain template parameters, so
4762 there's no point in looking at them then, either. */
4766 for (parm
= TYPE_ARG_TYPES (t
); parm
; parm
= TREE_CHAIN (parm
))
4767 if (for_each_template_parm (TREE_VALUE (parm
), fn
, data
,
4769 return error_mark_node
;
4771 /* Since we've already handled the TYPE_ARG_TYPES, we don't
4772 want walk_tree walking into them itself. */
4778 if (for_each_template_parm (TYPE_FIELDS (t
), fn
, data
,
4780 return error_mark_node
;
4785 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
)
4786 && for_each_template_parm (DECL_TI_ARGS (t
), fn
, data
,
4788 return error_mark_node
;
4793 if (TREE_CODE (t
) == CONST_DECL
&& DECL_TEMPLATE_PARM_P (t
)
4794 && for_each_template_parm (DECL_INITIAL (t
), fn
, data
,
4796 return error_mark_node
;
4797 if (DECL_CONTEXT (t
)
4798 && for_each_template_parm (DECL_CONTEXT (t
), fn
, data
,
4800 return error_mark_node
;
4803 case BOUND_TEMPLATE_TEMPLATE_PARM
:
4804 /* Record template parameters such as `T' inside `TT<T>'. */
4805 if (for_each_template_parm (TYPE_TI_ARGS (t
), fn
, data
, pfd
->visited
))
4806 return error_mark_node
;
4809 case TEMPLATE_TEMPLATE_PARM
:
4810 case TEMPLATE_TYPE_PARM
:
4811 case TEMPLATE_PARM_INDEX
:
4812 if (fn
&& (*fn
)(t
, data
))
4813 return error_mark_node
;
4815 return error_mark_node
;
4819 /* A template template parameter is encountered. */
4820 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
)
4821 && for_each_template_parm (TREE_TYPE (t
), fn
, data
, pfd
->visited
))
4822 return error_mark_node
;
4824 /* Already substituted template template parameter */
4830 || for_each_template_parm (TYPENAME_TYPE_FULLNAME (t
), fn
,
4831 data
, pfd
->visited
))
4832 return error_mark_node
;
4836 if (TREE_TYPE (t
) && TYPE_PTRMEMFUNC_P (TREE_TYPE (t
))
4837 && for_each_template_parm (TYPE_PTRMEMFUNC_FN_TYPE
4838 (TREE_TYPE (t
)), fn
, data
,
4840 return error_mark_node
;
4845 /* If there's no type, then this thing must be some expression
4846 involving template parameters. */
4847 if (!fn
&& !TREE_TYPE (t
))
4848 return error_mark_node
;
4853 case REINTERPRET_CAST_EXPR
:
4854 case CONST_CAST_EXPR
:
4855 case STATIC_CAST_EXPR
:
4856 case DYNAMIC_CAST_EXPR
:
4860 case PSEUDO_DTOR_EXPR
:
4862 return error_mark_node
;
4866 /* If we do not handle this case specially, we end up walking
4867 the BINFO hierarchy, which is circular, and therefore
4868 confuses walk_tree. */
4870 if (for_each_template_parm (BASELINK_FUNCTIONS (*tp
), fn
, data
,
4872 return error_mark_node
;
4879 /* We didn't find any template parameters we liked. */
4883 /* For each TEMPLATE_TYPE_PARM, TEMPLATE_TEMPLATE_PARM,
4884 BOUND_TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX in T,
4885 call FN with the parameter and the DATA.
4886 If FN returns nonzero, the iteration is terminated, and
4887 for_each_template_parm returns 1. Otherwise, the iteration
4888 continues. If FN never returns a nonzero value, the value
4889 returned by for_each_template_parm is 0. If FN is NULL, it is
4890 considered to be the function which always returns 1. */
4893 for_each_template_parm (tree t
, tree_fn_t fn
, void* data
,
4894 struct pointer_set_t
*visited
)
4896 struct pair_fn_data pfd
;
4903 /* Walk the tree. (Conceptually, we would like to walk without
4904 duplicates, but for_each_template_parm_r recursively calls
4905 for_each_template_parm, so we would need to reorganize a fair
4906 bit to use walk_tree_without_duplicates, so we keep our own
4909 pfd
.visited
= visited
;
4911 pfd
.visited
= pointer_set_create ();
4912 result
= walk_tree (&t
,
4913 for_each_template_parm_r
,
4915 pfd
.visited
) != NULL_TREE
;
4920 pointer_set_destroy (pfd
.visited
);
4927 /* Returns true if T depends on any template parameter. */
4930 uses_template_parms (tree t
)
4933 int saved_processing_template_decl
;
4935 saved_processing_template_decl
= processing_template_decl
;
4936 if (!saved_processing_template_decl
)
4937 processing_template_decl
= 1;
4939 dependent_p
= dependent_type_p (t
);
4940 else if (TREE_CODE (t
) == TREE_VEC
)
4941 dependent_p
= any_dependent_template_arguments_p (t
);
4942 else if (TREE_CODE (t
) == TREE_LIST
)
4943 dependent_p
= (uses_template_parms (TREE_VALUE (t
))
4944 || uses_template_parms (TREE_CHAIN (t
)));
4947 || TREE_CODE (t
) == TEMPLATE_PARM_INDEX
4948 || TREE_CODE (t
) == OVERLOAD
4949 || TREE_CODE (t
) == BASELINK
4950 || CONSTANT_CLASS_P (t
))
4951 dependent_p
= (type_dependent_expression_p (t
)
4952 || value_dependent_expression_p (t
));
4955 gcc_assert (t
== error_mark_node
);
4956 dependent_p
= false;
4959 processing_template_decl
= saved_processing_template_decl
;
4964 /* Returns true if T depends on any template parameter with level LEVEL. */
4967 uses_template_parms_level (tree t
, int level
)
4969 return for_each_template_parm (t
, template_parm_this_level_p
, &level
, NULL
);
4972 static int tinst_depth
;
4973 extern int max_tinst_depth
;
4974 #ifdef GATHER_STATISTICS
4977 static int tinst_level_tick
;
4978 static int last_template_error_tick
;
4980 /* We're starting to instantiate D; record the template instantiation context
4981 for diagnostics and to restore it later. */
4984 push_tinst_level (tree d
)
4988 if (tinst_depth
>= max_tinst_depth
)
4990 /* If the instantiation in question still has unbound template parms,
4991 we don't really care if we can't instantiate it, so just return.
4992 This happens with base instantiation for implicit `typename'. */
4993 if (uses_template_parms (d
))
4996 last_template_error_tick
= tinst_level_tick
;
4997 error ("template instantiation depth exceeds maximum of %d (use "
4998 "-ftemplate-depth-NN to increase the maximum) instantiating %qD",
4999 max_tinst_depth
, d
);
5001 print_instantiation_context ();
5006 new = make_tinst_level (d
, input_location
);
5007 TREE_CHAIN (new) = current_tinst_level
;
5008 current_tinst_level
= new;
5011 #ifdef GATHER_STATISTICS
5012 if (tinst_depth
> depth_reached
)
5013 depth_reached
= tinst_depth
;
5020 /* We're done instantiating this template; return to the instantiation
5024 pop_tinst_level (void)
5026 tree old
= current_tinst_level
;
5028 /* Restore the filename and line number stashed away when we started
5029 this instantiation. */
5030 input_location
= TINST_LOCATION (old
);
5031 current_tinst_level
= TREE_CHAIN (old
);
5036 /* We're instantiating a deferred template; restore the template
5037 instantiation context in which the instantiation was requested, which
5038 is one step out from LEVEL. */
5041 reopen_tinst_level (tree level
)
5046 for (t
= level
; t
; t
= TREE_CHAIN (t
))
5049 current_tinst_level
= level
;
5053 /* DECL is a friend FUNCTION_DECL or TEMPLATE_DECL. ARGS is the
5054 vector of template arguments, as for tsubst.
5056 Returns an appropriate tsubst'd friend declaration. */
5059 tsubst_friend_function (tree decl
, tree args
)
5063 if (TREE_CODE (decl
) == FUNCTION_DECL
5064 && DECL_TEMPLATE_INSTANTIATION (decl
)
5065 && TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
5066 /* This was a friend declared with an explicit template
5067 argument list, e.g.:
5071 to indicate that f was a template instantiation, not a new
5072 function declaration. Now, we have to figure out what
5073 instantiation of what template. */
5075 tree template_id
, arglist
, fns
;
5078 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (current_class_type
));
5080 /* Friend functions are looked up in the containing namespace scope.
5081 We must enter that scope, to avoid finding member functions of the
5082 current cless with same name. */
5083 push_nested_namespace (ns
);
5084 fns
= tsubst_expr (DECL_TI_TEMPLATE (decl
), args
,
5085 tf_error
| tf_warning
, NULL_TREE
);
5086 pop_nested_namespace (ns
);
5087 arglist
= tsubst (DECL_TI_ARGS (decl
), args
,
5088 tf_error
| tf_warning
, NULL_TREE
);
5089 template_id
= lookup_template_function (fns
, arglist
);
5091 new_friend
= tsubst (decl
, args
, tf_error
| tf_warning
, NULL_TREE
);
5092 tmpl
= determine_specialization (template_id
, new_friend
,
5094 /*need_member_template=*/0,
5095 TREE_VEC_LENGTH (args
));
5096 return instantiate_template (tmpl
, new_args
, tf_error
);
5099 new_friend
= tsubst (decl
, args
, tf_error
| tf_warning
, NULL_TREE
);
5101 /* The NEW_FRIEND will look like an instantiation, to the
5102 compiler, but is not an instantiation from the point of view of
5103 the language. For example, we might have had:
5105 template <class T> struct S {
5106 template <class U> friend void f(T, U);
5109 Then, in S<int>, template <class U> void f(int, U) is not an
5110 instantiation of anything. */
5111 if (new_friend
== error_mark_node
)
5112 return error_mark_node
;
5114 DECL_USE_TEMPLATE (new_friend
) = 0;
5115 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
5117 DECL_USE_TEMPLATE (DECL_TEMPLATE_RESULT (new_friend
)) = 0;
5118 DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (new_friend
))
5119 = DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (decl
));
5122 /* The mangled name for the NEW_FRIEND is incorrect. The function
5123 is not a template instantiation and should not be mangled like
5124 one. Therefore, we forget the mangling here; we'll recompute it
5125 later if we need it. */
5126 if (TREE_CODE (new_friend
) != TEMPLATE_DECL
)
5128 SET_DECL_RTL (new_friend
, NULL_RTX
);
5129 SET_DECL_ASSEMBLER_NAME (new_friend
, NULL_TREE
);
5132 if (DECL_NAMESPACE_SCOPE_P (new_friend
))
5135 tree new_friend_template_info
;
5136 tree new_friend_result_template_info
;
5138 int new_friend_is_defn
;
5140 /* We must save some information from NEW_FRIEND before calling
5141 duplicate decls since that function will free NEW_FRIEND if
5143 new_friend_template_info
= DECL_TEMPLATE_INFO (new_friend
);
5144 new_friend_is_defn
=
5145 (DECL_INITIAL (DECL_TEMPLATE_RESULT
5146 (template_for_substitution (new_friend
)))
5148 if (TREE_CODE (new_friend
) == TEMPLATE_DECL
)
5150 /* This declaration is a `primary' template. */
5151 DECL_PRIMARY_TEMPLATE (new_friend
) = new_friend
;
5153 new_friend_result_template_info
5154 = DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (new_friend
));
5157 new_friend_result_template_info
= NULL_TREE
;
5159 /* Inside pushdecl_namespace_level, we will push into the
5160 current namespace. However, the friend function should go
5161 into the namespace of the template. */
5162 ns
= decl_namespace_context (new_friend
);
5163 push_nested_namespace (ns
);
5164 old_decl
= pushdecl_namespace_level (new_friend
);
5165 pop_nested_namespace (ns
);
5167 if (old_decl
!= new_friend
)
5169 /* This new friend declaration matched an existing
5170 declaration. For example, given:
5172 template <class T> void f(T);
5173 template <class U> class C {
5174 template <class T> friend void f(T) {}
5177 the friend declaration actually provides the definition
5178 of `f', once C has been instantiated for some type. So,
5179 old_decl will be the out-of-class template declaration,
5180 while new_friend is the in-class definition.
5182 But, if `f' was called before this point, the
5183 instantiation of `f' will have DECL_TI_ARGS corresponding
5184 to `T' but not to `U', references to which might appear
5185 in the definition of `f'. Previously, the most general
5186 template for an instantiation of `f' was the out-of-class
5187 version; now it is the in-class version. Therefore, we
5188 run through all specialization of `f', adding to their
5189 DECL_TI_ARGS appropriately. In particular, they need a
5190 new set of outer arguments, corresponding to the
5191 arguments for this class instantiation.
5193 The same situation can arise with something like this:
5196 template <class T> class C {
5200 when `C<int>' is instantiated. Now, `f(int)' is defined
5203 if (!new_friend_is_defn
)
5204 /* On the other hand, if the in-class declaration does
5205 *not* provide a definition, then we don't want to alter
5206 existing definitions. We can just leave everything
5211 /* Overwrite whatever template info was there before, if
5212 any, with the new template information pertaining to
5214 DECL_TEMPLATE_INFO (old_decl
) = new_friend_template_info
;
5216 if (TREE_CODE (old_decl
) != TEMPLATE_DECL
)
5217 reregister_specialization (new_friend
,
5218 most_general_template (old_decl
),
5223 tree new_friend_args
;
5225 DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (old_decl
))
5226 = new_friend_result_template_info
;
5228 new_friend_args
= TI_ARGS (new_friend_template_info
);
5229 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (old_decl
);
5233 tree spec
= TREE_VALUE (t
);
5236 = add_outermost_template_args (new_friend_args
,
5237 DECL_TI_ARGS (spec
));
5240 /* Now, since specializations are always supposed to
5241 hang off of the most general template, we must move
5243 t
= most_general_template (old_decl
);
5246 DECL_TEMPLATE_SPECIALIZATIONS (t
)
5247 = chainon (DECL_TEMPLATE_SPECIALIZATIONS (t
),
5248 DECL_TEMPLATE_SPECIALIZATIONS (old_decl
));
5249 DECL_TEMPLATE_SPECIALIZATIONS (old_decl
) = NULL_TREE
;
5254 /* The information from NEW_FRIEND has been merged into OLD_DECL
5255 by duplicate_decls. */
5256 new_friend
= old_decl
;
5261 tree context
= DECL_CONTEXT (new_friend
);
5265 template <class T> class C {
5266 template <class U> friend void C1<U>::f (); // case 1
5267 friend void C2<T>::f (); // case 2
5269 we only need to make sure CONTEXT is a complete type for
5270 case 2. To distinguish between the two cases, we note that
5271 CONTEXT of case 1 remains dependent type after tsubst while
5272 this isn't true for case 2. */
5273 ++processing_template_decl
;
5274 dependent_p
= dependent_type_p (context
);
5275 --processing_template_decl
;
5278 && !complete_type_or_else (context
, NULL_TREE
))
5279 return error_mark_node
;
5281 if (COMPLETE_TYPE_P (context
))
5283 /* Check to see that the declaration is really present, and,
5284 possibly obtain an improved declaration. */
5285 tree fn
= check_classfn (context
,
5286 new_friend
, NULL_TREE
);
5296 /* FRIEND_TMPL is a friend TEMPLATE_DECL. ARGS is the vector of
5297 template arguments, as for tsubst.
5299 Returns an appropriate tsubst'd friend type or error_mark_node on
5303 tsubst_friend_class (tree friend_tmpl
, tree args
)
5309 context
= DECL_CONTEXT (friend_tmpl
);
5313 if (TREE_CODE (context
) == NAMESPACE_DECL
)
5314 push_nested_namespace (context
);
5316 push_nested_class (tsubst (context
, args
, tf_none
, NULL_TREE
));
5319 /* First, we look for a class template. */
5320 tmpl
= lookup_name (DECL_NAME (friend_tmpl
), /*prefer_type=*/0);
5322 /* But, if we don't find one, it might be because we're in a
5323 situation like this:
5331 Here, in the scope of (say) S<int>, `S' is bound to a TYPE_DECL
5332 for `S<int>', not the TEMPLATE_DECL. */
5333 if (!tmpl
|| !DECL_CLASS_TEMPLATE_P (tmpl
))
5335 tmpl
= lookup_name (DECL_NAME (friend_tmpl
), /*prefer_type=*/1);
5336 tmpl
= maybe_get_template_decl_from_type_decl (tmpl
);
5339 if (tmpl
&& DECL_CLASS_TEMPLATE_P (tmpl
))
5341 /* The friend template has already been declared. Just
5342 check to see that the declarations match, and install any new
5343 default parameters. We must tsubst the default parameters,
5344 of course. We only need the innermost template parameters
5345 because that is all that redeclare_class_template will look
5347 if (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (friend_tmpl
))
5348 > TMPL_ARGS_DEPTH (args
))
5351 parms
= tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_tmpl
),
5352 args
, tf_error
| tf_warning
);
5353 redeclare_class_template (TREE_TYPE (tmpl
), parms
);
5356 friend_type
= TREE_TYPE (tmpl
);
5360 /* The friend template has not already been declared. In this
5361 case, the instantiation of the template class will cause the
5362 injection of this template into the global scope. */
5363 tmpl
= tsubst (friend_tmpl
, args
, tf_error
| tf_warning
, NULL_TREE
);
5365 /* The new TMPL is not an instantiation of anything, so we
5366 forget its origins. We don't reset CLASSTYPE_TI_TEMPLATE for
5367 the new type because that is supposed to be the corresponding
5368 template decl, i.e., TMPL. */
5369 DECL_USE_TEMPLATE (tmpl
) = 0;
5370 DECL_TEMPLATE_INFO (tmpl
) = NULL_TREE
;
5371 CLASSTYPE_USE_TEMPLATE (TREE_TYPE (tmpl
)) = 0;
5372 CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl
))
5373 = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl
)));
5375 /* Inject this template into the global scope. */
5376 friend_type
= TREE_TYPE (pushdecl_top_level (tmpl
));
5381 if (TREE_CODE (context
) == NAMESPACE_DECL
)
5382 pop_nested_namespace (context
);
5384 pop_nested_class ();
5390 /* Returns zero if TYPE cannot be completed later due to circularity.
5391 Otherwise returns one. */
5394 can_complete_type_without_circularity (tree type
)
5396 if (type
== NULL_TREE
|| type
== error_mark_node
)
5398 else if (COMPLETE_TYPE_P (type
))
5400 else if (TREE_CODE (type
) == ARRAY_TYPE
&& TYPE_DOMAIN (type
))
5401 return can_complete_type_without_circularity (TREE_TYPE (type
));
5402 else if (CLASS_TYPE_P (type
)
5403 && TYPE_BEING_DEFINED (TYPE_MAIN_VARIANT (type
)))
5410 instantiate_class_template (tree type
)
5412 tree
template, args
, pattern
, t
, member
;
5417 if (type
== error_mark_node
)
5418 return error_mark_node
;
5420 if (TYPE_BEING_DEFINED (type
)
5421 || COMPLETE_TYPE_P (type
)
5422 || dependent_type_p (type
))
5425 /* Figure out which template is being instantiated. */
5426 template = most_general_template (CLASSTYPE_TI_TEMPLATE (type
));
5427 gcc_assert (TREE_CODE (template) == TEMPLATE_DECL
);
5429 /* Figure out which arguments are being used to do the
5431 args
= CLASSTYPE_TI_ARGS (type
);
5433 /* Determine what specialization of the original template to
5435 t
= most_specialized_class (template, args
);
5436 if (t
== error_mark_node
)
5438 const char *str
= "candidates are:";
5439 error ("ambiguous class template instantiation for %q#T", type
);
5440 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (template); t
;
5443 if (get_class_bindings (TREE_VALUE (t
), TREE_PURPOSE (t
), args
))
5445 cp_error_at ("%s %+#T", str
, TREE_TYPE (t
));
5449 TYPE_BEING_DEFINED (type
) = 1;
5450 return error_mark_node
;
5454 pattern
= TREE_TYPE (t
);
5456 pattern
= TREE_TYPE (template);
5458 /* If the template we're instantiating is incomplete, then clearly
5459 there's nothing we can do. */
5460 if (!COMPLETE_TYPE_P (pattern
))
5463 /* If we've recursively instantiated too many templates, stop. */
5464 if (! push_tinst_level (type
))
5467 /* Now we're really doing the instantiation. Mark the type as in
5468 the process of being defined. */
5469 TYPE_BEING_DEFINED (type
) = 1;
5471 /* We may be in the middle of deferred access check. Disable
5473 push_deferring_access_checks (dk_no_deferred
);
5475 push_to_top_level ();
5479 /* This TYPE is actually an instantiation of a partial
5480 specialization. We replace the innermost set of ARGS with
5481 the arguments appropriate for substitution. For example,
5484 template <class T> struct S {};
5485 template <class T> struct S<T*> {};
5487 and supposing that we are instantiating S<int*>, ARGS will
5488 present be {int*} but we need {int}. */
5490 = get_class_bindings (TREE_VALUE (t
), TREE_PURPOSE (t
),
5493 /* If there were multiple levels in ARGS, replacing the
5494 innermost level would alter CLASSTYPE_TI_ARGS, which we don't
5495 want, so we make a copy first. */
5496 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
5498 args
= copy_node (args
);
5499 SET_TMPL_ARGS_LEVEL (args
, TMPL_ARGS_DEPTH (args
), inner_args
);
5505 SET_CLASSTYPE_INTERFACE_UNKNOWN (type
);
5507 /* Set the input location to the template definition. This is needed
5508 if tsubsting causes an error. */
5509 input_location
= DECL_SOURCE_LOCATION (TYPE_NAME (pattern
));
5511 TYPE_HAS_CONSTRUCTOR (type
) = TYPE_HAS_CONSTRUCTOR (pattern
);
5512 TYPE_HAS_NEW_OPERATOR (type
) = TYPE_HAS_NEW_OPERATOR (pattern
);
5513 TYPE_HAS_ARRAY_NEW_OPERATOR (type
) = TYPE_HAS_ARRAY_NEW_OPERATOR (pattern
);
5514 TYPE_GETS_DELETE (type
) = TYPE_GETS_DELETE (pattern
);
5515 TYPE_HAS_ASSIGN_REF (type
) = TYPE_HAS_ASSIGN_REF (pattern
);
5516 TYPE_HAS_CONST_ASSIGN_REF (type
) = TYPE_HAS_CONST_ASSIGN_REF (pattern
);
5517 TYPE_HAS_INIT_REF (type
) = TYPE_HAS_INIT_REF (pattern
);
5518 TYPE_HAS_CONST_INIT_REF (type
) = TYPE_HAS_CONST_INIT_REF (pattern
);
5519 TYPE_HAS_DEFAULT_CONSTRUCTOR (type
) = TYPE_HAS_DEFAULT_CONSTRUCTOR (pattern
);
5520 TYPE_HAS_CONVERSION (type
) = TYPE_HAS_CONVERSION (pattern
);
5521 TYPE_PACKED (type
) = TYPE_PACKED (pattern
);
5522 TYPE_ALIGN (type
) = TYPE_ALIGN (pattern
);
5523 TYPE_USER_ALIGN (type
) = TYPE_USER_ALIGN (pattern
);
5524 TYPE_FOR_JAVA (type
) = TYPE_FOR_JAVA (pattern
); /* For libjava's JArray<T> */
5525 if (ANON_AGGR_TYPE_P (pattern
))
5526 SET_ANON_AGGR_TYPE_P (type
);
5528 pbinfo
= TYPE_BINFO (pattern
);
5530 /* We should never instantiate a nested class before its enclosing
5531 class; we need to look up the nested class by name before we can
5532 instantiate it, and that lookup should instantiate the enclosing
5534 gcc_assert (!DECL_CLASS_SCOPE_P (TYPE_MAIN_DECL (pattern
))
5535 || COMPLETE_TYPE_P (TYPE_CONTEXT (type
))
5536 || TYPE_BEING_DEFINED (TYPE_CONTEXT (type
)));
5538 base_list
= NULL_TREE
;
5539 if (BINFO_N_BASE_BINFOS (pbinfo
))
5542 tree context
= TYPE_CONTEXT (type
);
5546 /* We must enter the scope containing the type, as that is where
5547 the accessibility of types named in dependent bases are
5549 pushed_scope
= push_scope (context
? context
: global_namespace
);
5551 /* Substitute into each of the bases to determine the actual
5553 for (i
= 0; BINFO_BASE_ITERATE (pbinfo
, i
, pbase_binfo
); i
++)
5556 tree access
= BINFO_BASE_ACCESS (pbinfo
, i
);
5558 /* Substitute to figure out the base class. */
5559 base
= tsubst (BINFO_TYPE (pbase_binfo
), args
, tf_error
, NULL_TREE
);
5560 if (base
== error_mark_node
)
5563 base_list
= tree_cons (access
, base
, base_list
);
5564 if (BINFO_VIRTUAL_P (pbase_binfo
))
5565 TREE_TYPE (base_list
) = integer_type_node
;
5568 /* The list is now in reverse order; correct that. */
5569 base_list
= nreverse (base_list
);
5572 pop_scope (pushed_scope
);
5574 /* Now call xref_basetypes to set up all the base-class
5576 xref_basetypes (type
, base_list
);
5579 /* Now that our base classes are set up, enter the scope of the
5580 class, so that name lookups into base classes, etc. will work
5581 correctly. This is precisely analogous to what we do in
5582 begin_class_definition when defining an ordinary non-template
5586 /* Now members are processed in the order of declaration. */
5587 for (member
= CLASSTYPE_DECL_LIST (pattern
);
5588 member
; member
= TREE_CHAIN (member
))
5590 tree t
= TREE_VALUE (member
);
5592 if (TREE_PURPOSE (member
))
5596 /* Build new CLASSTYPE_NESTED_UTDS. */
5599 tree name
= TYPE_IDENTIFIER (tag
);
5601 bool class_template_p
;
5603 class_template_p
= (TREE_CODE (tag
) != ENUMERAL_TYPE
5604 && TYPE_LANG_SPECIFIC (tag
)
5605 && CLASSTYPE_IS_TEMPLATE (tag
));
5606 /* If the member is a class template, then -- even after
5607 substitution -- there may be dependent types in the
5608 template argument list for the class. We increment
5609 PROCESSING_TEMPLATE_DECL so that dependent_type_p, as
5610 that function will assume that no types are dependent
5611 when outside of a template. */
5612 if (class_template_p
)
5613 ++processing_template_decl
;
5614 newtag
= tsubst (tag
, args
, tf_error
, NULL_TREE
);
5615 if (class_template_p
)
5616 --processing_template_decl
;
5617 if (newtag
== error_mark_node
)
5620 if (TREE_CODE (newtag
) != ENUMERAL_TYPE
)
5622 if (class_template_p
)
5623 /* Unfortunately, lookup_template_class sets
5624 CLASSTYPE_IMPLICIT_INSTANTIATION for a partial
5625 instantiation (i.e., for the type of a member
5626 template class nested within a template class.)
5627 This behavior is required for
5628 maybe_process_partial_specialization to work
5629 correctly, but is not accurate in this case;
5630 the TAG is not an instantiation of anything.
5631 (The corresponding TEMPLATE_DECL is an
5632 instantiation, but the TYPE is not.) */
5633 CLASSTYPE_USE_TEMPLATE (newtag
) = 0;
5635 /* Now, we call pushtag to put this NEWTAG into the scope of
5636 TYPE. We first set up the IDENTIFIER_TYPE_VALUE to avoid
5637 pushtag calling push_template_decl. We don't have to do
5638 this for enums because it will already have been done in
5641 SET_IDENTIFIER_TYPE_VALUE (name
, newtag
);
5642 pushtag (name
, newtag
, /*tag_scope=*/ts_current
);
5645 else if (TREE_CODE (t
) == FUNCTION_DECL
5646 || DECL_FUNCTION_TEMPLATE_P (t
))
5648 /* Build new TYPE_METHODS. */
5651 if (TREE_CODE (t
) == TEMPLATE_DECL
)
5652 ++processing_template_decl
;
5653 r
= tsubst (t
, args
, tf_error
, NULL_TREE
);
5654 if (TREE_CODE (t
) == TEMPLATE_DECL
)
5655 --processing_template_decl
;
5656 set_current_access_from_decl (r
);
5657 grok_special_member_properties (r
);
5658 finish_member_declaration (r
);
5662 /* Build new TYPE_FIELDS. */
5664 if (TREE_CODE (t
) != CONST_DECL
)
5668 /* The the file and line for this declaration, to
5669 assist in error message reporting. Since we
5670 called push_tinst_level above, we don't need to
5672 input_location
= DECL_SOURCE_LOCATION (t
);
5674 if (TREE_CODE (t
) == TEMPLATE_DECL
)
5675 ++processing_template_decl
;
5676 r
= tsubst (t
, args
, tf_error
| tf_warning
, NULL_TREE
);
5677 if (TREE_CODE (t
) == TEMPLATE_DECL
)
5678 --processing_template_decl
;
5679 if (TREE_CODE (r
) == VAR_DECL
)
5683 if (DECL_INITIALIZED_IN_CLASS_P (r
))
5684 init
= tsubst_expr (DECL_INITIAL (t
), args
,
5685 tf_error
| tf_warning
, NULL_TREE
);
5689 finish_static_data_member_decl
5690 (r
, init
, /*asmspec_tree=*/NULL_TREE
, /*flags=*/0);
5692 if (DECL_INITIALIZED_IN_CLASS_P (r
))
5693 check_static_variable_definition (r
, TREE_TYPE (r
));
5695 else if (TREE_CODE (r
) == FIELD_DECL
)
5697 /* Determine whether R has a valid type and can be
5698 completed later. If R is invalid, then it is
5699 replaced by error_mark_node so that it will not be
5700 added to TYPE_FIELDS. */
5701 tree rtype
= TREE_TYPE (r
);
5702 if (can_complete_type_without_circularity (rtype
))
5703 complete_type (rtype
);
5705 if (!COMPLETE_TYPE_P (rtype
))
5707 cxx_incomplete_type_error (r
, rtype
);
5708 r
= error_mark_node
;
5712 /* If it is a TYPE_DECL for a class-scoped ENUMERAL_TYPE,
5713 such a thing will already have been added to the field
5714 list by tsubst_enum in finish_member_declaration in the
5715 CLASSTYPE_NESTED_UTDS case above. */
5716 if (!(TREE_CODE (r
) == TYPE_DECL
5717 && TREE_CODE (TREE_TYPE (r
)) == ENUMERAL_TYPE
5718 && DECL_ARTIFICIAL (r
)))
5720 set_current_access_from_decl (r
);
5721 finish_member_declaration (r
);
5728 if (TYPE_P (t
) || DECL_CLASS_TEMPLATE_P (t
))
5730 /* Build new CLASSTYPE_FRIEND_CLASSES. */
5732 tree friend_type
= t
;
5733 bool adjust_processing_template_decl
= false;
5735 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
5737 /* template <class T> friend class C; */
5738 friend_type
= tsubst_friend_class (friend_type
, args
);
5739 adjust_processing_template_decl
= true;
5741 else if (TREE_CODE (friend_type
) == UNBOUND_CLASS_TEMPLATE
)
5743 /* template <class T> friend class C::D; */
5744 friend_type
= tsubst (friend_type
, args
,
5745 tf_error
| tf_warning
, NULL_TREE
);
5746 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
5747 friend_type
= TREE_TYPE (friend_type
);
5748 adjust_processing_template_decl
= true;
5750 else if (TREE_CODE (friend_type
) == TYPENAME_TYPE
)
5752 /* This could be either
5756 when dependent_type_p is false or
5758 template <class U> friend class T::C;
5761 friend_type
= tsubst (friend_type
, args
,
5762 tf_error
| tf_warning
, NULL_TREE
);
5763 /* Bump processing_template_decl for correct
5764 dependent_type_p calculation. */
5765 ++processing_template_decl
;
5766 if (dependent_type_p (friend_type
))
5767 adjust_processing_template_decl
= true;
5768 --processing_template_decl
;
5770 else if (!CLASSTYPE_USE_TEMPLATE (friend_type
)
5771 && hidden_name_p (TYPE_NAME (friend_type
)))
5775 where C hasn't been declared yet. Let's lookup name
5776 from namespace scope directly, bypassing any name that
5777 come from dependent base class. */
5778 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (friend_type
));
5780 /* The call to xref_tag_from_type does injection for friend
5782 push_nested_namespace (ns
);
5784 xref_tag_from_type (friend_type
, NULL_TREE
,
5785 /*tag_scope=*/ts_current
);
5786 pop_nested_namespace (ns
);
5788 else if (uses_template_parms (friend_type
))
5789 /* friend class C<T>; */
5790 friend_type
= tsubst (friend_type
, args
,
5791 tf_error
| tf_warning
, NULL_TREE
);
5796 where C is already declared or
5798 friend class C<int>;
5800 We don't have to do anything in these cases. */
5802 if (adjust_processing_template_decl
)
5803 /* Trick make_friend_class into realizing that the friend
5804 we're adding is a template, not an ordinary class. It's
5805 important that we use make_friend_class since it will
5806 perform some error-checking and output cross-reference
5808 ++processing_template_decl
;
5810 if (friend_type
!= error_mark_node
)
5811 make_friend_class (type
, friend_type
, /*complain=*/false);
5813 if (adjust_processing_template_decl
)
5814 --processing_template_decl
;
5818 /* Build new DECL_FRIENDLIST. */
5821 /* The the file and line for this declaration, to
5822 assist in error message reporting. Since we
5823 called push_tinst_level above, we don't need to
5825 input_location
= DECL_SOURCE_LOCATION (t
);
5827 if (TREE_CODE (t
) == TEMPLATE_DECL
)
5829 ++processing_template_decl
;
5830 push_deferring_access_checks (dk_no_check
);
5833 r
= tsubst_friend_function (t
, args
);
5834 add_friend (type
, r
, /*complain=*/false);
5835 if (TREE_CODE (t
) == TEMPLATE_DECL
)
5837 pop_deferring_access_checks ();
5838 --processing_template_decl
;
5844 /* Set the file and line number information to whatever is given for
5845 the class itself. This puts error messages involving generated
5846 implicit functions at a predictable point, and the same point
5847 that would be used for non-template classes. */
5848 typedecl
= TYPE_MAIN_DECL (type
);
5849 input_location
= DECL_SOURCE_LOCATION (typedecl
);
5851 unreverse_member_declarations (type
);
5852 finish_struct_1 (type
);
5853 TYPE_BEING_DEFINED (type
) = 0;
5855 /* Now that the class is complete, instantiate default arguments for
5856 any member functions. We don't do this earlier because the
5857 default arguments may reference members of the class. */
5858 if (!PRIMARY_TEMPLATE_P (template))
5859 for (t
= TYPE_METHODS (type
); t
; t
= TREE_CHAIN (t
))
5860 if (TREE_CODE (t
) == FUNCTION_DECL
5861 /* Implicitly generated member functions will not have template
5862 information; they are not instantiations, but instead are
5863 created "fresh" for each instantiation. */
5864 && DECL_TEMPLATE_INFO (t
))
5865 tsubst_default_arguments (t
);
5868 pop_from_top_level ();
5869 pop_deferring_access_checks ();
5872 /* The vtable for a template class can be emitted in any translation
5873 unit in which the class is instantiated. When there is no key
5874 method, however, finish_struct_1 will already have added TYPE to
5875 the keyed_classes list. */
5876 if (TYPE_CONTAINS_VPTR_P (type
) && CLASSTYPE_KEY_METHOD (type
))
5877 keyed_classes
= tree_cons (NULL_TREE
, type
, keyed_classes
);
5883 tsubst_template_arg (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
5889 else if (TYPE_P (t
))
5890 r
= tsubst (t
, args
, complain
, in_decl
);
5893 r
= tsubst_expr (t
, args
, complain
, in_decl
);
5895 if (!uses_template_parms (r
))
5897 /* Sometimes, one of the args was an expression involving a
5898 template constant parameter, like N - 1. Now that we've
5899 tsubst'd, we might have something like 2 - 1. This will
5900 confuse lookup_template_class, so we do constant folding
5901 here. We have to unset processing_template_decl, to fool
5902 tsubst_copy_and_build() into building an actual tree. */
5904 /* If the TREE_TYPE of ARG is not NULL_TREE, ARG is already
5905 as simple as it's going to get, and trying to reprocess
5906 the trees will break. Once tsubst_expr et al DTRT for
5907 non-dependent exprs, this code can go away, as the type
5908 will always be set. */
5911 int saved_processing_template_decl
= processing_template_decl
;
5912 processing_template_decl
= 0;
5913 r
= tsubst_copy_and_build (r
, /*args=*/NULL_TREE
,
5914 tf_error
, /*in_decl=*/NULL_TREE
,
5915 /*function_p=*/false);
5916 processing_template_decl
= saved_processing_template_decl
;
5924 /* Substitute ARGS into the vector or list of template arguments T. */
5927 tsubst_template_args (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
5929 int len
= TREE_VEC_LENGTH (t
);
5930 int need_new
= 0, i
;
5931 tree
*elts
= alloca (len
* sizeof (tree
));
5933 for (i
= 0; i
< len
; i
++)
5935 tree orig_arg
= TREE_VEC_ELT (t
, i
);
5938 if (TREE_CODE (orig_arg
) == TREE_VEC
)
5939 new_arg
= tsubst_template_args (orig_arg
, args
, complain
, in_decl
);
5941 new_arg
= tsubst_template_arg (orig_arg
, args
, complain
, in_decl
);
5943 if (new_arg
== error_mark_node
)
5944 return error_mark_node
;
5947 if (new_arg
!= orig_arg
)
5954 t
= make_tree_vec (len
);
5955 for (i
= 0; i
< len
; i
++)
5956 TREE_VEC_ELT (t
, i
) = elts
[i
];
5961 /* Return the result of substituting ARGS into the template parameters
5962 given by PARMS. If there are m levels of ARGS and m + n levels of
5963 PARMS, then the result will contain n levels of PARMS. For
5964 example, if PARMS is `template <class T> template <class U>
5965 template <T*, U, class V>' and ARGS is {{int}, {double}} then the
5966 result will be `template <int*, double, class V>'. */
5969 tsubst_template_parms (tree parms
, tree args
, tsubst_flags_t complain
)
5974 for (new_parms
= &r
;
5975 TMPL_PARMS_DEPTH (parms
) > TMPL_ARGS_DEPTH (args
);
5976 new_parms
= &(TREE_CHAIN (*new_parms
)),
5977 parms
= TREE_CHAIN (parms
))
5980 make_tree_vec (TREE_VEC_LENGTH (TREE_VALUE (parms
)));
5983 for (i
= 0; i
< TREE_VEC_LENGTH (new_vec
); ++i
)
5985 tree tuple
= TREE_VEC_ELT (TREE_VALUE (parms
), i
);
5986 tree default_value
= TREE_PURPOSE (tuple
);
5987 tree parm_decl
= TREE_VALUE (tuple
);
5989 parm_decl
= tsubst (parm_decl
, args
, complain
, NULL_TREE
);
5990 default_value
= tsubst_template_arg (default_value
, args
,
5991 complain
, NULL_TREE
);
5993 tuple
= build_tree_list (default_value
, parm_decl
);
5994 TREE_VEC_ELT (new_vec
, i
) = tuple
;
5998 tree_cons (size_int (TMPL_PARMS_DEPTH (parms
)
5999 - TMPL_ARGS_DEPTH (args
)),
6000 new_vec
, NULL_TREE
);
6006 /* Substitute the ARGS into the indicated aggregate (or enumeration)
6007 type T. If T is not an aggregate or enumeration type, it is
6008 handled as if by tsubst. IN_DECL is as for tsubst. If
6009 ENTERING_SCOPE is nonzero, T is the context for a template which
6010 we are presently tsubst'ing. Return the substituted value. */
6013 tsubst_aggr_type (tree t
,
6015 tsubst_flags_t complain
,
6022 switch (TREE_CODE (t
))
6025 if (TYPE_PTRMEMFUNC_P (t
))
6026 return tsubst (TYPE_PTRMEMFUNC_FN_TYPE (t
), args
, complain
, in_decl
);
6028 /* Else fall through. */
6031 if (TYPE_TEMPLATE_INFO (t
))
6037 /* First, determine the context for the type we are looking
6039 context
= TYPE_CONTEXT (t
);
6041 context
= tsubst_aggr_type (context
, args
, complain
,
6042 in_decl
, /*entering_scope=*/1);
6044 /* Then, figure out what arguments are appropriate for the
6045 type we are trying to find. For example, given:
6047 template <class T> struct S;
6048 template <class T, class U> void f(T, U) { S<U> su; }
6050 and supposing that we are instantiating f<int, double>,
6051 then our ARGS will be {int, double}, but, when looking up
6052 S we only want {double}. */
6053 argvec
= tsubst_template_args (TYPE_TI_ARGS (t
), args
,
6055 if (argvec
== error_mark_node
)
6056 return error_mark_node
;
6058 r
= lookup_template_class (t
, argvec
, in_decl
, context
,
6059 entering_scope
, complain
);
6061 return cp_build_qualified_type_real (r
, TYPE_QUALS (t
), complain
);
6064 /* This is not a template type, so there's nothing to do. */
6068 return tsubst (t
, args
, complain
, in_decl
);
6072 /* Substitute into the default argument ARG (a default argument for
6073 FN), which has the indicated TYPE. */
6076 tsubst_default_argument (tree fn
, tree type
, tree arg
)
6078 tree saved_class_ptr
= NULL_TREE
;
6079 tree saved_class_ref
= NULL_TREE
;
6081 /* This default argument came from a template. Instantiate the
6082 default argument here, not in tsubst. In the case of
6091 we must be careful to do name lookup in the scope of S<T>,
6092 rather than in the current class. */
6093 push_access_scope (fn
);
6094 /* The default argument expression should not be considered to be
6095 within the scope of FN. Since push_access_scope sets
6096 current_function_decl, we must explicitly clear it here. */
6097 current_function_decl
= NULL_TREE
;
6098 /* The "this" pointer is not valid in a default argument. */
6101 saved_class_ptr
= current_class_ptr
;
6102 cp_function_chain
->x_current_class_ptr
= NULL_TREE
;
6103 saved_class_ref
= current_class_ref
;
6104 cp_function_chain
->x_current_class_ref
= NULL_TREE
;
6107 push_deferring_access_checks(dk_no_deferred
);
6108 arg
= tsubst_expr (arg
, DECL_TI_ARGS (fn
),
6109 tf_error
| tf_warning
, NULL_TREE
);
6110 pop_deferring_access_checks();
6112 /* Restore the "this" pointer. */
6115 cp_function_chain
->x_current_class_ptr
= saved_class_ptr
;
6116 cp_function_chain
->x_current_class_ref
= saved_class_ref
;
6119 pop_access_scope (fn
);
6121 /* Make sure the default argument is reasonable. */
6122 arg
= check_default_argument (type
, arg
);
6127 /* Substitute into all the default arguments for FN. */
6130 tsubst_default_arguments (tree fn
)
6135 tmpl_args
= DECL_TI_ARGS (fn
);
6137 /* If this function is not yet instantiated, we certainly don't need
6138 its default arguments. */
6139 if (uses_template_parms (tmpl_args
))
6142 for (arg
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
6144 arg
= TREE_CHAIN (arg
))
6145 if (TREE_PURPOSE (arg
))
6146 TREE_PURPOSE (arg
) = tsubst_default_argument (fn
,
6148 TREE_PURPOSE (arg
));
6151 /* Substitute the ARGS into the T, which is a _DECL. Return the
6152 result of the substitution. Issue error and warning messages under
6153 control of COMPLAIN. */
6156 tsubst_decl (tree t
, tree args
, tsubst_flags_t complain
)
6158 location_t saved_loc
;
6162 /* Set the filename and linenumber to improve error-reporting. */
6163 saved_loc
= input_location
;
6164 input_location
= DECL_SOURCE_LOCATION (t
);
6166 switch (TREE_CODE (t
))
6170 /* We can get here when processing a member function template,
6171 member class template, and template template parameter of
6172 a template class. */
6173 tree decl
= DECL_TEMPLATE_RESULT (t
);
6178 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
6180 /* Template template parameter is treated here. */
6181 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
6182 if (new_type
== error_mark_node
)
6183 return error_mark_node
;
6186 TREE_CHAIN (r
) = NULL_TREE
;
6187 TREE_TYPE (r
) = new_type
;
6188 DECL_TEMPLATE_RESULT (r
)
6189 = build_decl (TYPE_DECL
, DECL_NAME (decl
), new_type
);
6190 DECL_TEMPLATE_PARMS (r
)
6191 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t
), args
,
6193 TYPE_NAME (new_type
) = r
;
6197 /* We might already have an instance of this template.
6198 The ARGS are for the surrounding class type, so the
6199 full args contain the tsubst'd args for the context,
6200 plus the innermost args from the template decl. */
6201 tmpl_args
= DECL_CLASS_TEMPLATE_P (t
)
6202 ? CLASSTYPE_TI_ARGS (TREE_TYPE (t
))
6203 : DECL_TI_ARGS (DECL_TEMPLATE_RESULT (t
));
6204 full_args
= tsubst_template_args (tmpl_args
, args
,
6207 /* tsubst_template_args doesn't copy the vector if
6208 nothing changed. But, *something* should have
6210 gcc_assert (full_args
!= tmpl_args
);
6212 spec
= retrieve_specialization (t
, full_args
,
6213 /*class_specializations_p=*/true);
6214 if (spec
!= NULL_TREE
)
6220 /* Make a new template decl. It will be similar to the
6221 original, but will record the current template arguments.
6222 We also create a new function declaration, which is just
6223 like the old one, but points to this new template, rather
6224 than the old one. */
6226 gcc_assert (DECL_LANG_SPECIFIC (r
) != 0);
6227 TREE_CHAIN (r
) = NULL_TREE
;
6230 = tsubst_aggr_type (DECL_CONTEXT (t
), args
,
6232 /*entering_scope=*/1);
6233 DECL_TEMPLATE_INFO (r
) = build_tree_list (t
, args
);
6235 if (TREE_CODE (decl
) == TYPE_DECL
)
6237 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
6238 if (new_type
== error_mark_node
)
6239 return error_mark_node
;
6241 TREE_TYPE (r
) = new_type
;
6242 CLASSTYPE_TI_TEMPLATE (new_type
) = r
;
6243 DECL_TEMPLATE_RESULT (r
) = TYPE_MAIN_DECL (new_type
);
6244 DECL_TI_ARGS (r
) = CLASSTYPE_TI_ARGS (new_type
);
6248 tree new_decl
= tsubst (decl
, args
, complain
, in_decl
);
6249 if (new_decl
== error_mark_node
)
6250 return error_mark_node
;
6252 DECL_TEMPLATE_RESULT (r
) = new_decl
;
6253 DECL_TI_TEMPLATE (new_decl
) = r
;
6254 TREE_TYPE (r
) = TREE_TYPE (new_decl
);
6255 DECL_TI_ARGS (r
) = DECL_TI_ARGS (new_decl
);
6258 SET_DECL_IMPLICIT_INSTANTIATION (r
);
6259 DECL_TEMPLATE_INSTANTIATIONS (r
) = NULL_TREE
;
6260 DECL_TEMPLATE_SPECIALIZATIONS (r
) = NULL_TREE
;
6262 /* The template parameters for this new template are all the
6263 template parameters for the old template, except the
6264 outermost level of parameters. */
6265 DECL_TEMPLATE_PARMS (r
)
6266 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t
), args
,
6269 if (PRIMARY_TEMPLATE_P (t
))
6270 DECL_PRIMARY_TEMPLATE (r
) = r
;
6272 if (TREE_CODE (decl
) != TYPE_DECL
)
6273 /* Record this non-type partial instantiation. */
6274 register_specialization (r
, t
,
6275 DECL_TI_ARGS (DECL_TEMPLATE_RESULT (r
)));
6282 tree argvec
= NULL_TREE
;
6290 /* Nobody should be tsubst'ing into non-template functions. */
6291 gcc_assert (DECL_TEMPLATE_INFO (t
) != NULL_TREE
);
6293 if (TREE_CODE (DECL_TI_TEMPLATE (t
)) == TEMPLATE_DECL
)
6298 /* If T is not dependent, just return it. We have to
6299 increment PROCESSING_TEMPLATE_DECL because
6300 value_dependent_expression_p assumes that nothing is
6301 dependent when PROCESSING_TEMPLATE_DECL is zero. */
6302 ++processing_template_decl
;
6303 dependent_p
= value_dependent_expression_p (t
);
6304 --processing_template_decl
;
6308 /* Calculate the most general template of which R is a
6309 specialization, and the complete set of arguments used to
6311 gen_tmpl
= most_general_template (DECL_TI_TEMPLATE (t
));
6312 argvec
= tsubst_template_args (DECL_TI_ARGS
6313 (DECL_TEMPLATE_RESULT (gen_tmpl
)),
6314 args
, complain
, in_decl
);
6316 /* Check to see if we already have this specialization. */
6317 spec
= retrieve_specialization (gen_tmpl
, argvec
,
6318 /*class_specializations_p=*/false);
6326 /* We can see more levels of arguments than parameters if
6327 there was a specialization of a member template, like
6330 template <class T> struct S { template <class U> void f(); }
6331 template <> template <class U> void S<int>::f(U);
6333 Here, we'll be substituting into the specialization,
6334 because that's where we can find the code we actually
6335 want to generate, but we'll have enough arguments for
6336 the most general template.
6338 We also deal with the peculiar case:
6340 template <class T> struct S {
6341 template <class U> friend void f();
6343 template <class U> void f() {}
6345 template void f<double>();
6347 Here, the ARGS for the instantiation of will be {int,
6348 double}. But, we only need as many ARGS as there are
6349 levels of template parameters in CODE_PATTERN. We are
6350 careful not to get fooled into reducing the ARGS in
6353 template <class T> struct S { template <class U> void f(U); }
6354 template <class T> template <> void S<T>::f(int) {}
6356 which we can spot because the pattern will be a
6357 specialization in this case. */
6358 args_depth
= TMPL_ARGS_DEPTH (args
);
6360 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (t
)));
6361 if (args_depth
> parms_depth
6362 && !DECL_TEMPLATE_SPECIALIZATION (t
))
6363 args
= get_innermost_template_args (args
, parms_depth
);
6367 /* This special case arises when we have something like this:
6369 template <class T> struct S {
6370 friend void f<int>(int, double);
6373 Here, the DECL_TI_TEMPLATE for the friend declaration
6374 will be an IDENTIFIER_NODE. We are being called from
6375 tsubst_friend_function, and we want only to create a
6376 new decl (R) with appropriate types so that we can call
6377 determine_specialization. */
6378 gen_tmpl
= NULL_TREE
;
6381 if (DECL_CLASS_SCOPE_P (t
))
6383 if (DECL_NAME (t
) == constructor_name (DECL_CONTEXT (t
)))
6387 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
,
6388 complain
, t
, /*entering_scope=*/1);
6393 ctx
= DECL_CONTEXT (t
);
6395 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
6396 if (type
== error_mark_node
)
6397 return error_mark_node
;
6399 /* We do NOT check for matching decls pushed separately at this
6400 point, as they may not represent instantiations of this
6401 template, and in any case are considered separate under the
6404 DECL_USE_TEMPLATE (r
) = 0;
6405 TREE_TYPE (r
) = type
;
6406 /* Clear out the mangled name and RTL for the instantiation. */
6407 SET_DECL_ASSEMBLER_NAME (r
, NULL_TREE
);
6408 SET_DECL_RTL (r
, NULL_RTX
);
6409 DECL_INITIAL (r
) = NULL_TREE
;
6410 DECL_CONTEXT (r
) = ctx
;
6412 if (member
&& DECL_CONV_FN_P (r
))
6413 /* Type-conversion operator. Reconstruct the name, in
6414 case it's the name of one of the template's parameters. */
6415 DECL_NAME (r
) = mangle_conv_op_name_for_type (TREE_TYPE (type
));
6417 DECL_ARGUMENTS (r
) = tsubst (DECL_ARGUMENTS (t
), args
,
6419 DECL_RESULT (r
) = NULL_TREE
;
6421 TREE_STATIC (r
) = 0;
6422 TREE_PUBLIC (r
) = TREE_PUBLIC (t
);
6423 DECL_EXTERNAL (r
) = 1;
6424 /* If this is an instantiation of a function with internal
6425 linkage, we already know what object file linkage will be
6426 assigned to the instantiation. */
6427 DECL_INTERFACE_KNOWN (r
) = !TREE_PUBLIC (r
);
6428 DECL_DEFER_OUTPUT (r
) = 0;
6429 TREE_CHAIN (r
) = NULL_TREE
;
6430 DECL_PENDING_INLINE_INFO (r
) = 0;
6431 DECL_PENDING_INLINE_P (r
) = 0;
6432 DECL_SAVED_TREE (r
) = NULL_TREE
;
6434 if (DECL_CLONED_FUNCTION (r
))
6436 DECL_CLONED_FUNCTION (r
) = tsubst (DECL_CLONED_FUNCTION (t
),
6438 TREE_CHAIN (r
) = TREE_CHAIN (DECL_CLONED_FUNCTION (r
));
6439 TREE_CHAIN (DECL_CLONED_FUNCTION (r
)) = r
;
6442 /* Set up the DECL_TEMPLATE_INFO for R. There's no need to do
6443 this in the special friend case mentioned above where
6444 GEN_TMPL is NULL. */
6447 DECL_TEMPLATE_INFO (r
)
6448 = tree_cons (gen_tmpl
, argvec
, NULL_TREE
);
6449 SET_DECL_IMPLICIT_INSTANTIATION (r
);
6450 register_specialization (r
, gen_tmpl
, argvec
);
6452 /* We're not supposed to instantiate default arguments
6453 until they are called, for a template. But, for a
6456 template <class T> void f ()
6457 { extern void g(int i = T()); }
6459 we should do the substitution when the template is
6460 instantiated. We handle the member function case in
6461 instantiate_class_template since the default arguments
6462 might refer to other members of the class. */
6464 && !PRIMARY_TEMPLATE_P (gen_tmpl
)
6465 && !uses_template_parms (argvec
))
6466 tsubst_default_arguments (r
);
6469 /* Copy the list of befriending classes. */
6470 for (friends
= &DECL_BEFRIENDING_CLASSES (r
);
6472 friends
= &TREE_CHAIN (*friends
))
6474 *friends
= copy_node (*friends
);
6475 TREE_VALUE (*friends
) = tsubst (TREE_VALUE (*friends
),
6480 if (DECL_CONSTRUCTOR_P (r
) || DECL_DESTRUCTOR_P (r
))
6482 maybe_retrofit_in_chrg (r
);
6483 if (DECL_CONSTRUCTOR_P (r
))
6484 grok_ctor_properties (ctx
, r
);
6485 /* If this is an instantiation of a member template, clone it.
6486 If it isn't, that'll be handled by
6487 clone_constructors_and_destructors. */
6488 if (PRIMARY_TEMPLATE_P (gen_tmpl
))
6489 clone_function_decl (r
, /*update_method_vec_p=*/0);
6491 else if (IDENTIFIER_OPNAME_P (DECL_NAME (r
)))
6492 grok_op_properties (r
, DECL_FRIEND_P (r
),
6493 (complain
& tf_error
) != 0);
6495 if (DECL_FRIEND_P (t
) && DECL_FRIEND_CONTEXT (t
))
6496 SET_DECL_FRIEND_CONTEXT (r
,
6497 tsubst (DECL_FRIEND_CONTEXT (t
),
6498 args
, complain
, in_decl
));
6507 if (DECL_TEMPLATE_PARM_P (t
))
6508 SET_DECL_TEMPLATE_PARM_P (r
);
6510 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
6511 type
= type_decays_to (type
);
6512 TREE_TYPE (r
) = type
;
6513 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
6515 if (DECL_INITIAL (r
))
6517 if (TREE_CODE (DECL_INITIAL (r
)) != TEMPLATE_PARM_INDEX
)
6518 DECL_INITIAL (r
) = TREE_TYPE (r
);
6520 DECL_INITIAL (r
) = tsubst (DECL_INITIAL (r
), args
,
6524 DECL_CONTEXT (r
) = NULL_TREE
;
6526 if (!DECL_TEMPLATE_PARM_P (r
))
6527 DECL_ARG_TYPE (r
) = type_passed_as (type
);
6529 TREE_CHAIN (r
) = tsubst (TREE_CHAIN (t
), args
,
6530 complain
, TREE_CHAIN (t
));
6539 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
6540 if (type
== error_mark_node
)
6541 return error_mark_node
;
6542 TREE_TYPE (r
) = type
;
6543 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
6545 /* We don't have to set DECL_CONTEXT here; it is set by
6546 finish_member_declaration. */
6547 DECL_INITIAL (r
) = tsubst_expr (DECL_INITIAL (t
), args
,
6549 TREE_CHAIN (r
) = NULL_TREE
;
6550 if (VOID_TYPE_P (type
))
6551 cp_error_at ("instantiation of %qD as type %qT", r
, type
);
6558 /* It is not a dependent using decl any more. */
6559 TREE_TYPE (r
) = void_type_node
;
6561 = tsubst_copy (DECL_INITIAL (t
), args
, complain
, in_decl
);
6563 = tsubst_copy (DECL_NAME (t
), args
, complain
, in_decl
);
6564 TREE_CHAIN (r
) = NULL_TREE
;
6571 tree argvec
= NULL_TREE
;
6572 tree gen_tmpl
= NULL_TREE
;
6574 tree tmpl
= NULL_TREE
;
6576 tree type
= NULL_TREE
;
6579 if (TREE_CODE (t
) == TYPE_DECL
)
6581 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
6582 if (TREE_CODE (type
) == TEMPLATE_TEMPLATE_PARM
6583 || t
== TYPE_MAIN_DECL (TREE_TYPE (t
)))
6585 /* If this is the canonical decl, we don't have to
6586 mess with instantiations, and often we can't (for
6587 typename, template type parms and such). Note that
6588 TYPE_NAME is not correct for the above test if
6589 we've copied the type for a typedef. */
6590 r
= TYPE_NAME (type
);
6595 /* Assume this is a non-local variable. */
6598 if (TYPE_P (CP_DECL_CONTEXT (t
)))
6599 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
,
6601 in_decl
, /*entering_scope=*/1);
6602 else if (DECL_NAMESPACE_SCOPE_P (t
))
6603 ctx
= DECL_CONTEXT (t
);
6606 /* Subsequent calls to pushdecl will fill this in. */
6611 /* Check to see if we already have this specialization. */
6614 tmpl
= DECL_TI_TEMPLATE (t
);
6615 gen_tmpl
= most_general_template (tmpl
);
6616 argvec
= tsubst (DECL_TI_ARGS (t
), args
, complain
, in_decl
);
6617 spec
= retrieve_specialization (gen_tmpl
, argvec
,
6618 /*class_specializations_p=*/false);
6621 spec
= retrieve_local_specialization (t
);
6630 if (TREE_CODE (r
) == VAR_DECL
)
6632 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
6633 if (type
== error_mark_node
)
6634 return error_mark_node
;
6635 type
= complete_type (type
);
6636 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (r
)
6637 = DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (t
);
6638 type
= check_var_type (DECL_NAME (r
), type
);
6640 else if (DECL_SELF_REFERENCE_P (t
))
6641 SET_DECL_SELF_REFERENCE_P (r
);
6642 TREE_TYPE (r
) = type
;
6643 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
6644 DECL_CONTEXT (r
) = ctx
;
6645 /* Clear out the mangled name and RTL for the instantiation. */
6646 SET_DECL_ASSEMBLER_NAME (r
, NULL_TREE
);
6647 SET_DECL_RTL (r
, NULL_RTX
);
6649 /* Don't try to expand the initializer until someone tries to use
6650 this variable; otherwise we run into circular dependencies. */
6651 DECL_INITIAL (r
) = NULL_TREE
;
6652 SET_DECL_RTL (r
, NULL_RTX
);
6653 DECL_SIZE (r
) = DECL_SIZE_UNIT (r
) = 0;
6655 /* Even if the original location is out of scope, the newly
6656 substituted one is not. */
6657 if (TREE_CODE (r
) == VAR_DECL
)
6659 DECL_DEAD_FOR_LOCAL (r
) = 0;
6660 DECL_INITIALIZED_P (r
) = 0;
6665 /* A static data member declaration is always marked
6666 external when it is declared in-class, even if an
6667 initializer is present. We mimic the non-template
6669 DECL_EXTERNAL (r
) = 1;
6671 register_specialization (r
, gen_tmpl
, argvec
);
6672 DECL_TEMPLATE_INFO (r
) = tree_cons (tmpl
, argvec
, NULL_TREE
);
6673 SET_DECL_IMPLICIT_INSTANTIATION (r
);
6676 register_local_specialization (r
, t
);
6678 TREE_CHAIN (r
) = NULL_TREE
;
6687 /* Restore the file and line information. */
6688 input_location
= saved_loc
;
6693 /* Substitute into the ARG_TYPES of a function type. */
6696 tsubst_arg_types (tree arg_types
,
6698 tsubst_flags_t complain
,
6701 tree remaining_arg_types
;
6704 if (!arg_types
|| arg_types
== void_list_node
)
6707 remaining_arg_types
= tsubst_arg_types (TREE_CHAIN (arg_types
),
6708 args
, complain
, in_decl
);
6709 if (remaining_arg_types
== error_mark_node
)
6710 return error_mark_node
;
6712 type
= tsubst (TREE_VALUE (arg_types
), args
, complain
, in_decl
);
6713 if (type
== error_mark_node
)
6714 return error_mark_node
;
6715 if (VOID_TYPE_P (type
))
6717 if (complain
& tf_error
)
6719 error ("invalid parameter type %qT", type
);
6721 cp_error_at ("in declaration %qD", in_decl
);
6723 return error_mark_node
;
6726 /* Do array-to-pointer, function-to-pointer conversion, and ignore
6727 top-level qualifiers as required. */
6728 type
= TYPE_MAIN_VARIANT (type_decays_to (type
));
6730 /* Note that we do not substitute into default arguments here. The
6731 standard mandates that they be instantiated only when needed,
6732 which is done in build_over_call. */
6733 return hash_tree_cons (TREE_PURPOSE (arg_types
), type
,
6734 remaining_arg_types
);
6738 /* Substitute into a FUNCTION_TYPE or METHOD_TYPE. This routine does
6739 *not* handle the exception-specification for FNTYPE, because the
6740 initial substitution of explicitly provided template parameters
6741 during argument deduction forbids substitution into the
6742 exception-specification:
6746 All references in the function type of the function template to the
6747 corresponding template parameters are replaced by the specified tem-
6748 plate argument values. If a substitution in a template parameter or
6749 in the function type of the function template results in an invalid
6750 type, type deduction fails. [Note: The equivalent substitution in
6751 exception specifications is done only when the function is instanti-
6752 ated, at which point a program is ill-formed if the substitution
6753 results in an invalid type.] */
6756 tsubst_function_type (tree t
,
6758 tsubst_flags_t complain
,
6765 /* The TYPE_CONTEXT is not used for function/method types. */
6766 gcc_assert (TYPE_CONTEXT (t
) == NULL_TREE
);
6768 /* Substitute the return type. */
6769 return_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
6770 if (return_type
== error_mark_node
)
6771 return error_mark_node
;
6772 /* The standard does not presently indicate that creation of a
6773 function type with an invalid return type is a deduction failure.
6774 However, that is clearly analogous to creating an array of "void"
6775 or a reference to a reference. This is core issue #486. */
6776 if (TREE_CODE (return_type
) == ARRAY_TYPE
6777 || TREE_CODE (return_type
) == FUNCTION_TYPE
)
6779 if (complain
& tf_error
)
6781 if (TREE_CODE (return_type
) == ARRAY_TYPE
)
6782 error ("function returning an array");
6784 error ("function returning a function");
6786 return error_mark_node
;
6789 /* Substitute the argument types. */
6790 arg_types
= tsubst_arg_types (TYPE_ARG_TYPES (t
), args
,
6792 if (arg_types
== error_mark_node
)
6793 return error_mark_node
;
6795 /* Construct a new type node and return it. */
6796 if (TREE_CODE (t
) == FUNCTION_TYPE
)
6797 fntype
= build_function_type (return_type
, arg_types
);
6800 tree r
= TREE_TYPE (TREE_VALUE (arg_types
));
6801 if (! IS_AGGR_TYPE (r
))
6805 Type deduction may fail for any of the following
6808 -- Attempting to create "pointer to member of T" when T
6809 is not a class type. */
6810 if (complain
& tf_error
)
6811 error ("creating pointer to member function of non-class type %qT",
6813 return error_mark_node
;
6816 fntype
= build_method_type_directly (r
, return_type
,
6817 TREE_CHAIN (arg_types
));
6819 fntype
= cp_build_qualified_type_real (fntype
, TYPE_QUALS (t
), complain
);
6820 fntype
= cp_build_type_attribute_variant (fntype
, TYPE_ATTRIBUTES (t
));
6825 /* FNTYPE is a FUNCTION_TYPE or METHOD_TYPE. Substitute the template
6826 ARGS into that specification, and return the substituted
6827 specification. If there is no specification, return NULL_TREE. */
6830 tsubst_exception_specification (tree fntype
,
6832 tsubst_flags_t complain
,
6838 specs
= TYPE_RAISES_EXCEPTIONS (fntype
);
6839 new_specs
= NULL_TREE
;
6842 if (! TREE_VALUE (specs
))
6848 spec
= tsubst (TREE_VALUE (specs
), args
, complain
, in_decl
);
6849 if (spec
== error_mark_node
)
6851 new_specs
= add_exception_specifier (new_specs
, spec
, complain
);
6852 specs
= TREE_CHAIN (specs
);
6858 /* Substitute into the PARMS of a call-declarator. */
6861 tsubst_call_declarator_parms (tree parms
,
6863 tsubst_flags_t complain
,
6870 if (!parms
|| parms
== void_list_node
)
6873 new_parms
= tsubst_call_declarator_parms (TREE_CHAIN (parms
),
6874 args
, complain
, in_decl
);
6876 /* Figure out the type of this parameter. */
6877 type
= tsubst (TREE_VALUE (parms
), args
, complain
, in_decl
);
6879 /* Figure out the default argument as well. Note that we use
6880 tsubst_expr since the default argument is really an expression. */
6881 defarg
= tsubst_expr (TREE_PURPOSE (parms
), args
, complain
, in_decl
);
6883 /* Chain this parameter on to the front of those we have already
6884 processed. We don't use hash_tree_cons because that function
6885 doesn't check TREE_PARMLIST. */
6886 new_parms
= tree_cons (defarg
, type
, new_parms
);
6891 /* Take the tree structure T and replace template parameters used
6892 therein with the argument vector ARGS. IN_DECL is an associated
6893 decl for diagnostics. If an error occurs, returns ERROR_MARK_NODE.
6894 Issue error and warning messages under control of COMPLAIN. Note
6895 that we must be relatively non-tolerant of extensions here, in
6896 order to preserve conformance; if we allow substitutions that
6897 should not be allowed, we may allow argument deductions that should
6898 not succeed, and therefore report ambiguous overload situations
6899 where there are none. In theory, we could allow the substitution,
6900 but indicate that it should have failed, and allow our caller to
6901 make sure that the right thing happens, but we don't try to do this
6904 This function is used for dealing with types, decls and the like;
6905 for expressions, use tsubst_expr or tsubst_copy. */
6908 tsubst (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
6912 if (t
== NULL_TREE
|| t
== error_mark_node
6913 || t
== integer_type_node
6914 || t
== void_type_node
6915 || t
== char_type_node
6916 || t
== unknown_type_node
6917 || TREE_CODE (t
) == NAMESPACE_DECL
)
6921 return tsubst_decl (t
, args
, complain
);
6923 if (TREE_CODE (t
) == IDENTIFIER_NODE
)
6924 type
= IDENTIFIER_TYPE_VALUE (t
);
6926 type
= TREE_TYPE (t
);
6928 gcc_assert (type
!= unknown_type_node
);
6931 && TREE_CODE (t
) != TYPENAME_TYPE
6932 && TREE_CODE (t
) != IDENTIFIER_NODE
6933 && TREE_CODE (t
) != FUNCTION_TYPE
6934 && TREE_CODE (t
) != METHOD_TYPE
)
6935 type
= tsubst (type
, args
, complain
, in_decl
);
6936 if (type
== error_mark_node
)
6937 return error_mark_node
;
6939 switch (TREE_CODE (t
))
6944 return tsubst_aggr_type (t
, args
, complain
, in_decl
,
6945 /*entering_scope=*/0);
6948 case IDENTIFIER_NODE
:
6960 if (t
== integer_type_node
)
6963 if (TREE_CODE (TYPE_MIN_VALUE (t
)) == INTEGER_CST
6964 && TREE_CODE (TYPE_MAX_VALUE (t
)) == INTEGER_CST
)
6968 tree max
, omax
= TREE_OPERAND (TYPE_MAX_VALUE (t
), 0);
6970 /* The array dimension behaves like a non-type template arg,
6971 in that we want to fold it as much as possible. */
6972 max
= tsubst_template_arg (omax
, args
, complain
, in_decl
);
6973 max
= fold_decl_constant_value (max
);
6975 if (integer_zerop (omax
))
6977 /* Still allow an explicit array of size zero. */
6979 pedwarn ("creating array with size zero");
6981 else if (integer_zerop (max
)
6982 || (TREE_CODE (max
) == INTEGER_CST
6983 && INT_CST_LT (max
, integer_zero_node
)))
6987 Type deduction may fail for any of the following
6990 Attempting to create an array with a size that is
6991 zero or negative. */
6992 if (complain
& tf_error
)
6993 error ("creating array with size zero (%qE)", max
);
6995 return error_mark_node
;
6998 return compute_array_index_type (NULL_TREE
, max
);
7001 case TEMPLATE_TYPE_PARM
:
7002 case TEMPLATE_TEMPLATE_PARM
:
7003 case BOUND_TEMPLATE_TEMPLATE_PARM
:
7004 case TEMPLATE_PARM_INDEX
:
7009 tree arg
= NULL_TREE
;
7013 gcc_assert (TREE_VEC_LENGTH (args
) > 0);
7014 if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
7015 || TREE_CODE (t
) == TEMPLATE_TEMPLATE_PARM
7016 || TREE_CODE (t
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
7018 idx
= TEMPLATE_TYPE_IDX (t
);
7019 level
= TEMPLATE_TYPE_LEVEL (t
);
7023 idx
= TEMPLATE_PARM_IDX (t
);
7024 level
= TEMPLATE_PARM_LEVEL (t
);
7027 levels
= TMPL_ARGS_DEPTH (args
);
7028 if (level
<= levels
)
7029 arg
= TMPL_ARG (args
, level
, idx
);
7031 if (arg
== error_mark_node
)
7032 return error_mark_node
;
7033 else if (arg
!= NULL_TREE
)
7035 if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
7037 gcc_assert (TYPE_P (arg
));
7038 return cp_build_qualified_type_real
7039 (arg
, cp_type_quals (arg
) | cp_type_quals (t
),
7040 complain
| tf_ignore_bad_quals
);
7042 else if (TREE_CODE (t
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
7044 /* We are processing a type constructed from a
7045 template template parameter. */
7046 tree argvec
= tsubst (TYPE_TI_ARGS (t
),
7047 args
, complain
, in_decl
);
7048 if (argvec
== error_mark_node
)
7049 return error_mark_node
;
7051 /* We can get a TEMPLATE_TEMPLATE_PARM here when we
7052 are resolving nested-types in the signature of a
7053 member function templates. Otherwise ARG is a
7054 TEMPLATE_DECL and is the real template to be
7056 if (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
7057 arg
= TYPE_NAME (arg
);
7059 r
= lookup_template_class (arg
,
7062 /*entering_scope=*/0,
7064 return cp_build_qualified_type_real
7065 (r
, TYPE_QUALS (t
), complain
);
7068 /* TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX. */
7073 /* This can happen during the attempted tsubst'ing in
7074 unify. This means that we don't yet have any information
7075 about the template parameter in question. */
7078 /* If we get here, we must have been looking at a parm for a
7079 more deeply nested template. Make a new version of this
7080 template parameter, but with a lower level. */
7081 switch (TREE_CODE (t
))
7083 case TEMPLATE_TYPE_PARM
:
7084 case TEMPLATE_TEMPLATE_PARM
:
7085 case BOUND_TEMPLATE_TEMPLATE_PARM
:
7086 if (cp_type_quals (t
))
7088 r
= tsubst (TYPE_MAIN_VARIANT (t
), args
, complain
, in_decl
);
7089 r
= cp_build_qualified_type_real
7090 (r
, cp_type_quals (t
),
7091 complain
| (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
7092 ? tf_ignore_bad_quals
: 0));
7097 TEMPLATE_TYPE_PARM_INDEX (r
)
7098 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (t
),
7100 TYPE_STUB_DECL (r
) = TYPE_NAME (r
) = TEMPLATE_TYPE_DECL (r
);
7101 TYPE_MAIN_VARIANT (r
) = r
;
7102 TYPE_POINTER_TO (r
) = NULL_TREE
;
7103 TYPE_REFERENCE_TO (r
) = NULL_TREE
;
7105 if (TREE_CODE (t
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
7107 tree argvec
= tsubst (TYPE_TI_ARGS (t
), args
,
7109 if (argvec
== error_mark_node
)
7110 return error_mark_node
;
7112 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (r
)
7113 = tree_cons (TYPE_TI_TEMPLATE (t
), argvec
, NULL_TREE
);
7118 case TEMPLATE_PARM_INDEX
:
7119 r
= reduce_template_parm_level (t
, type
, levels
);
7131 tree purpose
, value
, chain
;
7133 if (t
== void_list_node
)
7136 purpose
= TREE_PURPOSE (t
);
7139 purpose
= tsubst (purpose
, args
, complain
, in_decl
);
7140 if (purpose
== error_mark_node
)
7141 return error_mark_node
;
7143 value
= TREE_VALUE (t
);
7146 value
= tsubst (value
, args
, complain
, in_decl
);
7147 if (value
== error_mark_node
)
7148 return error_mark_node
;
7150 chain
= TREE_CHAIN (t
);
7151 if (chain
&& chain
!= void_type_node
)
7153 chain
= tsubst (chain
, args
, complain
, in_decl
);
7154 if (chain
== error_mark_node
)
7155 return error_mark_node
;
7157 if (purpose
== TREE_PURPOSE (t
)
7158 && value
== TREE_VALUE (t
)
7159 && chain
== TREE_CHAIN (t
))
7161 return hash_tree_cons (purpose
, value
, chain
);
7165 /* We should never be tsubsting a binfo. */
7169 /* A vector of template arguments. */
7171 return tsubst_template_args (t
, args
, complain
, in_decl
);
7174 case REFERENCE_TYPE
:
7176 enum tree_code code
;
7178 if (type
== TREE_TYPE (t
) && TREE_CODE (type
) != METHOD_TYPE
)
7181 code
= TREE_CODE (t
);
7186 Type deduction may fail for any of the following
7189 -- Attempting to create a pointer to reference type.
7190 -- Attempting to create a reference to a reference type or
7191 a reference to void. */
7192 if (TREE_CODE (type
) == REFERENCE_TYPE
7193 || (code
== REFERENCE_TYPE
&& TREE_CODE (type
) == VOID_TYPE
))
7195 static location_t last_loc
;
7197 /* We keep track of the last time we issued this error
7198 message to avoid spewing a ton of messages during a
7199 single bad template instantiation. */
7200 if (complain
& tf_error
7201 #ifdef USE_MAPPED_LOCATION
7202 && last_loc
!= input_location
7204 && (last_loc
.line
!= input_line
7205 || last_loc
.file
!= input_filename
)
7209 if (TREE_CODE (type
) == VOID_TYPE
)
7210 error ("forming reference to void");
7212 error ("forming %s to reference type %qT",
7213 (code
== POINTER_TYPE
) ? "pointer" : "reference",
7215 last_loc
= input_location
;
7218 return error_mark_node
;
7220 else if (code
== POINTER_TYPE
)
7222 r
= build_pointer_type (type
);
7223 if (TREE_CODE (type
) == METHOD_TYPE
)
7224 r
= build_ptrmemfunc_type (r
);
7227 r
= build_reference_type (type
);
7228 r
= cp_build_qualified_type_real (r
, TYPE_QUALS (t
), complain
);
7230 if (r
!= error_mark_node
)
7231 /* Will this ever be needed for TYPE_..._TO values? */
7238 r
= tsubst (TYPE_OFFSET_BASETYPE (t
), args
, complain
, in_decl
);
7239 if (r
== error_mark_node
|| !IS_AGGR_TYPE (r
))
7243 Type deduction may fail for any of the following
7246 -- Attempting to create "pointer to member of T" when T
7247 is not a class type. */
7248 if (complain
& tf_error
)
7249 error ("creating pointer to member of non-class type %qT", r
);
7250 return error_mark_node
;
7252 if (TREE_CODE (type
) == REFERENCE_TYPE
)
7254 if (complain
& tf_error
)
7255 error ("creating pointer to member reference type %qT", type
);
7257 return error_mark_node
;
7259 gcc_assert (TREE_CODE (type
) != METHOD_TYPE
);
7260 if (TREE_CODE (type
) == FUNCTION_TYPE
)
7262 /* The type of the implicit object parameter gets its
7263 cv-qualifiers from the FUNCTION_TYPE. */
7265 tree this_type
= cp_build_qualified_type (TYPE_MAIN_VARIANT (r
),
7266 cp_type_quals (type
));
7268 method_type
= build_method_type_directly (this_type
,
7270 TYPE_ARG_TYPES (type
));
7271 memptr
= build_ptrmemfunc_type (build_pointer_type (method_type
));
7272 return cp_build_qualified_type_real (memptr
, cp_type_quals (t
),
7276 return cp_build_qualified_type_real (build_ptrmem_type (r
, type
),
7285 fntype
= tsubst_function_type (t
, args
, complain
, in_decl
);
7286 if (fntype
== error_mark_node
)
7287 return error_mark_node
;
7289 /* Substitute the exception specification. */
7290 specs
= tsubst_exception_specification (t
, args
, complain
,
7293 fntype
= build_exception_variant (fntype
, specs
);
7298 tree domain
= tsubst (TYPE_DOMAIN (t
), args
, complain
, in_decl
);
7299 if (domain
== error_mark_node
)
7300 return error_mark_node
;
7302 /* As an optimization, we avoid regenerating the array type if
7303 it will obviously be the same as T. */
7304 if (type
== TREE_TYPE (t
) && domain
== TYPE_DOMAIN (t
))
7307 /* These checks should match the ones in grokdeclarator.
7311 The deduction may fail for any of the following reasons:
7313 -- Attempting to create an array with an element type that
7314 is void, a function type, or a reference type, or [DR337]
7315 an abstract class type. */
7316 if (TREE_CODE (type
) == VOID_TYPE
7317 || TREE_CODE (type
) == FUNCTION_TYPE
7318 || TREE_CODE (type
) == REFERENCE_TYPE
)
7320 if (complain
& tf_error
)
7321 error ("creating array of %qT", type
);
7322 return error_mark_node
;
7324 if (CLASS_TYPE_P (type
) && CLASSTYPE_PURE_VIRTUALS (type
))
7326 if (complain
& tf_error
)
7327 error ("creating array of %qT, which is an abstract class type",
7329 return error_mark_node
;
7332 r
= build_cplus_array_type (type
, domain
);
7339 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
7340 tree e2
= tsubst (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
7342 if (e1
== error_mark_node
|| e2
== error_mark_node
)
7343 return error_mark_node
;
7345 return fold_build2 (TREE_CODE (t
), TREE_TYPE (t
), e1
, e2
);
7351 tree e
= tsubst (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
7352 if (e
== error_mark_node
)
7353 return error_mark_node
;
7355 return fold_build1 (TREE_CODE (t
), TREE_TYPE (t
), e
);
7360 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
7361 in_decl
, /*entering_scope=*/1);
7362 tree f
= tsubst_copy (TYPENAME_TYPE_FULLNAME (t
), args
,
7365 if (ctx
== error_mark_node
|| f
== error_mark_node
)
7366 return error_mark_node
;
7368 if (!IS_AGGR_TYPE (ctx
))
7370 if (complain
& tf_error
)
7371 error ("%qT is not a class, struct, or union type", ctx
);
7372 return error_mark_node
;
7374 else if (!uses_template_parms (ctx
) && !TYPE_BEING_DEFINED (ctx
))
7376 /* Normally, make_typename_type does not require that the CTX
7377 have complete type in order to allow things like:
7379 template <class T> struct S { typename S<T>::X Y; };
7381 But, such constructs have already been resolved by this
7382 point, so here CTX really should have complete type, unless
7383 it's a partial instantiation. */
7384 ctx
= complete_type (ctx
);
7385 if (!COMPLETE_TYPE_P (ctx
))
7387 if (complain
& tf_error
)
7388 cxx_incomplete_type_error (NULL_TREE
, ctx
);
7389 return error_mark_node
;
7393 f
= make_typename_type (ctx
, f
, typename_type
,
7394 (complain
& tf_error
) | tf_keep_type_decl
);
7395 if (f
== error_mark_node
)
7397 if (TREE_CODE (f
) == TYPE_DECL
)
7399 complain
|= tf_ignore_bad_quals
;
7403 if (TREE_CODE (f
) != TYPENAME_TYPE
)
7405 if (TYPENAME_IS_ENUM_P (t
) && TREE_CODE (f
) != ENUMERAL_TYPE
)
7406 error ("%qT resolves to %qT, which is not an enumeration type",
7408 else if (TYPENAME_IS_CLASS_P (t
) && !CLASS_TYPE_P (f
))
7409 error ("%qT resolves to %qT, which is is not a class type",
7413 return cp_build_qualified_type_real
7414 (f
, cp_type_quals (f
) | cp_type_quals (t
), complain
);
7417 case UNBOUND_CLASS_TEMPLATE
:
7419 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
7420 in_decl
, /*entering_scope=*/1);
7421 tree name
= TYPE_IDENTIFIER (t
);
7422 tree parm_list
= DECL_TEMPLATE_PARMS (TYPE_NAME (t
));
7424 if (ctx
== error_mark_node
|| name
== error_mark_node
)
7425 return error_mark_node
;
7428 parm_list
= tsubst_template_parms (parm_list
, args
, complain
);
7429 return make_unbound_class_template (ctx
, name
, parm_list
, complain
);
7439 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
7440 tree e2
= tsubst_expr (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
7441 if (e1
== error_mark_node
|| e2
== error_mark_node
)
7442 return error_mark_node
;
7444 return build_nt (ARRAY_REF
, e1
, e2
, NULL_TREE
, NULL_TREE
);
7449 tree e1
= tsubst (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
7450 tree e2
= tsubst (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
7451 if (e1
== error_mark_node
|| e2
== error_mark_node
)
7452 return error_mark_node
;
7454 return build_nt (TREE_CODE (t
), e1
, e2
);
7461 type
= finish_typeof (tsubst_expr (TYPEOF_TYPE_EXPR (t
), args
,
7462 complain
, in_decl
));
7463 return cp_build_qualified_type_real (type
,
7465 | cp_type_quals (type
),
7470 sorry ("use of %qs in template",
7471 tree_code_name
[(int) TREE_CODE (t
)]);
7472 return error_mark_node
;
7476 /* Like tsubst_expr for a BASELINK. OBJECT_TYPE, if non-NULL, is the
7477 type of the expression on the left-hand side of the "." or "->"
7481 tsubst_baselink (tree baselink
, tree object_type
,
7482 tree args
, tsubst_flags_t complain
, tree in_decl
)
7485 tree qualifying_scope
;
7487 tree template_args
= 0;
7488 bool template_id_p
= false;
7490 /* A baselink indicates a function from a base class. The
7491 BASELINK_ACCESS_BINFO and BASELINK_BINFO are going to have
7492 non-dependent types; otherwise, the lookup could not have
7493 succeeded. However, they may indicate bases of the template
7494 class, rather than the instantiated class.
7496 In addition, lookups that were not ambiguous before may be
7497 ambiguous now. Therefore, we perform the lookup again. */
7498 qualifying_scope
= BINFO_TYPE (BASELINK_ACCESS_BINFO (baselink
));
7499 fns
= BASELINK_FUNCTIONS (baselink
);
7500 if (TREE_CODE (fns
) == TEMPLATE_ID_EXPR
)
7502 template_id_p
= true;
7503 template_args
= TREE_OPERAND (fns
, 1);
7504 fns
= TREE_OPERAND (fns
, 0);
7506 template_args
= tsubst_template_args (template_args
, args
,
7509 name
= DECL_NAME (get_first_fn (fns
));
7510 baselink
= lookup_fnfields (qualifying_scope
, name
, /*protect=*/1);
7512 /* If lookup found a single function, mark it as used at this
7513 point. (If it lookup found multiple functions the one selected
7514 later by overload resolution will be marked as used at that
7516 if (BASELINK_P (baselink
))
7517 fns
= BASELINK_FUNCTIONS (baselink
);
7518 if (!template_id_p
&& !really_overloaded_fn (fns
))
7519 mark_used (OVL_CURRENT (fns
));
7521 /* Add back the template arguments, if present. */
7522 if (BASELINK_P (baselink
) && template_id_p
)
7523 BASELINK_FUNCTIONS (baselink
)
7524 = build_nt (TEMPLATE_ID_EXPR
,
7525 BASELINK_FUNCTIONS (baselink
),
7529 object_type
= current_class_type
;
7530 return adjust_result_of_qualified_name_lookup (baselink
,
7535 /* Like tsubst_expr for a SCOPE_REF, given by QUALIFIED_ID. DONE is
7536 true if the qualified-id will be a postfix-expression in-and-of
7537 itself; false if more of the postfix-expression follows the
7538 QUALIFIED_ID. ADDRESS_P is true if the qualified-id is the operand
7542 tsubst_qualified_id (tree qualified_id
, tree args
,
7543 tsubst_flags_t complain
, tree in_decl
,
7544 bool done
, bool address_p
)
7552 gcc_assert (TREE_CODE (qualified_id
) == SCOPE_REF
);
7554 /* Figure out what name to look up. */
7555 name
= TREE_OPERAND (qualified_id
, 1);
7556 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
7559 template_args
= TREE_OPERAND (name
, 1);
7561 template_args
= tsubst_template_args (template_args
, args
,
7563 name
= TREE_OPERAND (name
, 0);
7567 is_template
= false;
7568 template_args
= NULL_TREE
;
7571 /* Substitute into the qualifying scope. When there are no ARGS, we
7572 are just trying to simplify a non-dependent expression. In that
7573 case the qualifying scope may be dependent, and, in any case,
7574 substituting will not help. */
7575 scope
= TREE_OPERAND (qualified_id
, 0);
7578 scope
= tsubst (scope
, args
, complain
, in_decl
);
7579 expr
= tsubst_copy (name
, args
, complain
, in_decl
);
7584 if (dependent_type_p (scope
))
7585 return build_nt (SCOPE_REF
, scope
, expr
);
7587 if (!BASELINK_P (name
) && !DECL_P (expr
))
7589 expr
= lookup_qualified_name (scope
, expr
, /*is_type_p=*/0, false);
7590 if (TREE_CODE (TREE_CODE (expr
) == TEMPLATE_DECL
7591 ? DECL_TEMPLATE_RESULT (expr
) : expr
) == TYPE_DECL
)
7593 if (complain
& tf_error
)
7595 error ("dependent-name %qE is parsed as a non-type, but "
7596 "instantiation yields a type", qualified_id
);
7597 inform ("say %<typename %E%> if a type is meant", qualified_id
);
7599 return error_mark_node
;
7605 check_accessibility_of_qualified_id (expr
, /*object_type=*/NULL_TREE
,
7607 /* Remember that there was a reference to this entity. */
7611 if (expr
== error_mark_node
|| TREE_CODE (expr
) == TREE_LIST
)
7613 if (complain
& tf_error
)
7614 qualified_name_lookup_error (scope
,
7615 TREE_OPERAND (qualified_id
, 1),
7617 return error_mark_node
;
7621 expr
= lookup_template_function (expr
, template_args
);
7623 if (expr
== error_mark_node
&& complain
& tf_error
)
7624 qualified_name_lookup_error (scope
, TREE_OPERAND (qualified_id
, 1),
7626 else if (TYPE_P (scope
))
7628 expr
= (adjust_result_of_qualified_name_lookup
7629 (expr
, scope
, current_class_type
));
7630 expr
= finish_qualified_id_expr (scope
, expr
, done
, address_p
);
7633 expr
= convert_from_reference (expr
);
7638 /* Like tsubst, but deals with expressions. This function just replaces
7639 template parms; to finish processing the resultant expression, use
7643 tsubst_copy (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
7645 enum tree_code code
;
7648 if (t
== NULL_TREE
|| t
== error_mark_node
)
7651 code
= TREE_CODE (t
);
7656 r
= retrieve_local_specialization (t
);
7657 gcc_assert (r
!= NULL
);
7666 if (DECL_TEMPLATE_PARM_P (t
))
7667 return tsubst_copy (DECL_INITIAL (t
), args
, complain
, in_decl
);
7668 /* There is no need to substitute into namespace-scope
7670 if (DECL_NAMESPACE_SCOPE_P (t
))
7672 /* If ARGS is NULL, then T is known to be non-dependent. */
7673 if (args
== NULL_TREE
)
7674 return integral_constant_value (t
);
7676 /* Unfortunately, we cannot just call lookup_name here.
7679 template <int I> int f() {
7681 struct S { void g() { E e = a; } };
7684 When we instantiate f<7>::S::g(), say, lookup_name is not
7685 clever enough to find f<7>::a. */
7687 = tsubst_aggr_type (TREE_TYPE (t
), args
, complain
, in_decl
,
7688 /*entering_scope=*/0);
7690 for (v
= TYPE_VALUES (enum_type
);
7693 if (TREE_PURPOSE (v
) == DECL_NAME (t
))
7694 return TREE_VALUE (v
);
7696 /* We didn't find the name. That should never happen; if
7697 name-lookup found it during preliminary parsing, we
7698 should find it again here during instantiation. */
7704 if (DECL_CONTEXT (t
))
7708 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
7709 /*entering_scope=*/1);
7710 if (ctx
!= DECL_CONTEXT (t
))
7712 tree r
= lookup_field (ctx
, DECL_NAME (t
), 0, false);
7715 if (complain
& tf_error
)
7716 error ("using invalid field %qD", t
);
7717 return error_mark_node
;
7727 if ((DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
))
7728 || local_variable_p (t
))
7729 t
= tsubst (t
, args
, complain
, in_decl
);
7734 return tsubst_baselink (t
, current_class_type
, args
, complain
, in_decl
);
7737 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
7738 return tsubst (TREE_TYPE (DECL_TEMPLATE_RESULT (t
)),
7739 args
, complain
, in_decl
);
7740 else if (DECL_FUNCTION_TEMPLATE_P (t
) && DECL_MEMBER_TEMPLATE_P (t
))
7741 return tsubst (t
, args
, complain
, in_decl
);
7742 else if (DECL_CLASS_SCOPE_P (t
)
7743 && uses_template_parms (DECL_CONTEXT (t
)))
7745 /* Template template argument like the following example need
7748 template <template <class> class TT> struct C {};
7749 template <class T> struct D {
7750 template <class U> struct E {};
7755 We are processing the template argument `E' in #1 for
7756 the template instantiation #2. Originally, `E' is a
7757 TEMPLATE_DECL with `D<T>' as its DECL_CONTEXT. Now we
7758 have to substitute this with one having context `D<int>'. */
7760 tree context
= tsubst (DECL_CONTEXT (t
), args
, complain
, in_decl
);
7761 return lookup_field (context
, DECL_NAME(t
), 0, false);
7764 /* Ordinary template template argument. */
7768 case REINTERPRET_CAST_EXPR
:
7769 case CONST_CAST_EXPR
:
7770 case STATIC_CAST_EXPR
:
7771 case DYNAMIC_CAST_EXPR
:
7774 (code
, tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
7775 tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
));
7779 case TRUTH_NOT_EXPR
:
7782 case CONVERT_EXPR
: /* Unary + */
7791 (code
, tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
7792 tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
));
7799 object
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
7800 name
= TREE_OPERAND (t
, 1);
7801 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
7803 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
7805 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
7807 else if (TREE_CODE (name
) == SCOPE_REF
7808 && TREE_CODE (TREE_OPERAND (name
, 1)) == BIT_NOT_EXPR
)
7810 tree base
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
7812 name
= TREE_OPERAND (name
, 1);
7813 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
7815 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
7816 name
= build_nt (SCOPE_REF
, base
, name
);
7818 else if (TREE_CODE (name
) == BASELINK
)
7819 name
= tsubst_baselink (name
,
7820 non_reference (TREE_TYPE (object
)),
7824 name
= tsubst_copy (name
, args
, complain
, in_decl
);
7825 return build_nt (COMPONENT_REF
, object
, name
, NULL_TREE
);
7831 case TRUNC_DIV_EXPR
:
7833 case FLOOR_DIV_EXPR
:
7834 case ROUND_DIV_EXPR
:
7835 case EXACT_DIV_EXPR
:
7839 case TRUNC_MOD_EXPR
:
7840 case FLOOR_MOD_EXPR
:
7841 case TRUTH_ANDIF_EXPR
:
7842 case TRUTH_ORIF_EXPR
:
7843 case TRUTH_AND_EXPR
:
7861 case PREDECREMENT_EXPR
:
7862 case PREINCREMENT_EXPR
:
7863 case POSTDECREMENT_EXPR
:
7864 case POSTINCREMENT_EXPR
:
7866 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
7867 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
));
7872 tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
7873 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
),
7874 NULL_TREE
, NULL_TREE
);
7877 return build_nt (code
,
7878 tsubst_copy (TREE_OPERAND (t
, 0), args
,
7880 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
,
7886 case PSEUDO_DTOR_EXPR
:
7889 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
7890 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
),
7891 tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
));
7892 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
7899 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
7900 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
),
7901 tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
));
7902 NEW_EXPR_USE_GLOBAL (r
) = NEW_EXPR_USE_GLOBAL (t
);
7909 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
7910 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
));
7911 DELETE_EXPR_USE_GLOBAL (r
) = DELETE_EXPR_USE_GLOBAL (t
);
7912 DELETE_EXPR_USE_VEC (r
) = DELETE_EXPR_USE_VEC (t
);
7916 case TEMPLATE_ID_EXPR
:
7918 /* Substituted template arguments */
7919 tree fn
= TREE_OPERAND (t
, 0);
7920 tree targs
= TREE_OPERAND (t
, 1);
7922 fn
= tsubst_copy (fn
, args
, complain
, in_decl
);
7924 targs
= tsubst_template_args (targs
, args
, complain
, in_decl
);
7926 return lookup_template_function (fn
, targs
);
7931 tree purpose
, value
, chain
;
7933 if (t
== void_list_node
)
7936 purpose
= TREE_PURPOSE (t
);
7938 purpose
= tsubst_copy (purpose
, args
, complain
, in_decl
);
7939 value
= TREE_VALUE (t
);
7941 value
= tsubst_copy (value
, args
, complain
, in_decl
);
7942 chain
= TREE_CHAIN (t
);
7943 if (chain
&& chain
!= void_type_node
)
7944 chain
= tsubst_copy (chain
, args
, complain
, in_decl
);
7945 if (purpose
== TREE_PURPOSE (t
)
7946 && value
== TREE_VALUE (t
)
7947 && chain
== TREE_CHAIN (t
))
7949 return tree_cons (purpose
, value
, chain
);
7956 case TEMPLATE_TYPE_PARM
:
7957 case TEMPLATE_TEMPLATE_PARM
:
7958 case BOUND_TEMPLATE_TEMPLATE_PARM
:
7959 case TEMPLATE_PARM_INDEX
:
7961 case REFERENCE_TYPE
:
7967 case UNBOUND_CLASS_TEMPLATE
:
7970 return tsubst (t
, args
, complain
, in_decl
);
7972 case IDENTIFIER_NODE
:
7973 if (IDENTIFIER_TYPENAME_P (t
))
7975 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
7976 return mangle_conv_op_name_for_type (new_type
);
7983 r
= build_constructor
7984 (tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
7985 tsubst_copy (CONSTRUCTOR_ELTS (t
), args
, complain
, in_decl
));
7986 TREE_HAS_CONSTRUCTOR (r
) = TREE_HAS_CONSTRUCTOR (t
);
7991 return build_x_va_arg (tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
,
7993 tsubst (TREE_TYPE (t
), args
, complain
, in_decl
));
7995 case CLEANUP_POINT_EXPR
:
7996 /* We shouldn't have built any of these during initial template
7997 generation. Instead, they should be built during instantiation
7998 in response to the saved STMT_IS_FULL_EXPR_P setting. */
8006 /* Like tsubst_copy for expressions, etc. but also does semantic
8010 tsubst_expr (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
8014 if (t
== NULL_TREE
|| t
== error_mark_node
)
8017 if (EXPR_HAS_LOCATION (t
))
8018 input_location
= EXPR_LOCATION (t
);
8019 if (STATEMENT_CODE_P (TREE_CODE (t
)))
8020 current_stmt_tree ()->stmts_are_full_exprs_p
= STMT_IS_FULL_EXPR_P (t
);
8022 switch (TREE_CODE (t
))
8024 case STATEMENT_LIST
:
8026 tree_stmt_iterator i
;
8027 for (i
= tsi_start (t
); !tsi_end_p (i
); tsi_next (&i
))
8028 tsubst_expr (tsi_stmt (i
), args
, complain
, in_decl
);
8032 case CTOR_INITIALIZER
:
8033 finish_mem_initializers (tsubst_initializer_list
8034 (TREE_OPERAND (t
, 0), args
));
8038 finish_return_stmt (tsubst_expr (TREE_OPERAND (t
, 0),
8039 args
, complain
, in_decl
));
8043 tmp
= tsubst_expr (EXPR_STMT_EXPR (t
), args
, complain
, in_decl
);
8044 if (EXPR_STMT_STMT_EXPR_RESULT (t
))
8045 finish_stmt_expr_expr (tmp
, cur_stmt_expr
);
8047 finish_expr_stmt (tmp
);
8051 do_using_directive (tsubst_expr (USING_STMT_NAMESPACE (t
),
8052 args
, complain
, in_decl
));
8060 decl
= DECL_EXPR_DECL (t
);
8061 if (TREE_CODE (decl
) == LABEL_DECL
)
8062 finish_label_decl (DECL_NAME (decl
));
8063 else if (TREE_CODE (decl
) == USING_DECL
)
8065 tree scope
= DECL_INITIAL (decl
);
8066 tree name
= DECL_NAME (decl
);
8069 scope
= tsubst_expr (scope
, args
, complain
, in_decl
);
8070 decl
= lookup_qualified_name (scope
, name
,
8071 /*is_type_p=*/false,
8072 /*complain=*/false);
8073 if (decl
== error_mark_node
|| TREE_CODE (decl
) == TREE_LIST
)
8074 qualified_name_lookup_error (scope
, name
, decl
);
8076 do_local_using_decl (decl
, scope
, name
);
8080 init
= DECL_INITIAL (decl
);
8081 decl
= tsubst (decl
, args
, complain
, in_decl
);
8082 if (decl
!= error_mark_node
)
8085 DECL_INITIAL (decl
) = error_mark_node
;
8086 /* By marking the declaration as instantiated, we avoid
8087 trying to instantiate it. Since instantiate_decl can't
8088 handle local variables, and since we've already done
8089 all that needs to be done, that's the right thing to
8091 if (TREE_CODE (decl
) == VAR_DECL
)
8092 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
8093 if (TREE_CODE (decl
) == VAR_DECL
8094 && ANON_AGGR_TYPE_P (TREE_TYPE (decl
)))
8095 /* Anonymous aggregates are a special case. */
8096 finish_anon_union (decl
);
8099 maybe_push_decl (decl
);
8100 if (TREE_CODE (decl
) == VAR_DECL
8101 && DECL_PRETTY_FUNCTION_P (decl
))
8103 /* For __PRETTY_FUNCTION__ we have to adjust the
8105 const char *const name
8106 = cxx_printable_name (current_function_decl
, 2);
8107 init
= cp_fname_init (name
, &TREE_TYPE (decl
));
8110 init
= tsubst_expr (init
, args
, complain
, in_decl
);
8111 cp_finish_decl (decl
, init
, NULL_TREE
, 0);
8116 /* A DECL_EXPR can also be used as an expression, in the condition
8117 clause of an if/for/while construct. */
8122 stmt
= begin_for_stmt ();
8123 tsubst_expr (FOR_INIT_STMT (t
), args
, complain
, in_decl
);
8124 finish_for_init_stmt (stmt
);
8125 tmp
= tsubst_expr (FOR_COND (t
), args
, complain
, in_decl
);
8126 finish_for_cond (tmp
, stmt
);
8127 tmp
= tsubst_expr (FOR_EXPR (t
), args
, complain
, in_decl
);
8128 finish_for_expr (tmp
, stmt
);
8129 tsubst_expr (FOR_BODY (t
), args
, complain
, in_decl
);
8130 finish_for_stmt (stmt
);
8134 stmt
= begin_while_stmt ();
8135 tmp
= tsubst_expr (WHILE_COND (t
), args
, complain
, in_decl
);
8136 finish_while_stmt_cond (tmp
, stmt
);
8137 tsubst_expr (WHILE_BODY (t
), args
, complain
, in_decl
);
8138 finish_while_stmt (stmt
);
8142 stmt
= begin_do_stmt ();
8143 tsubst_expr (DO_BODY (t
), args
, complain
, in_decl
);
8144 finish_do_body (stmt
);
8145 tmp
= tsubst_expr (DO_COND (t
), args
, complain
, in_decl
);
8146 finish_do_stmt (tmp
, stmt
);
8150 stmt
= begin_if_stmt ();
8151 tmp
= tsubst_expr (IF_COND (t
), args
, complain
, in_decl
);
8152 finish_if_stmt_cond (tmp
, stmt
);
8153 tsubst_expr (THEN_CLAUSE (t
), args
, complain
, in_decl
);
8154 finish_then_clause (stmt
);
8156 if (ELSE_CLAUSE (t
))
8158 begin_else_clause (stmt
);
8159 tsubst_expr (ELSE_CLAUSE (t
), args
, complain
, in_decl
);
8160 finish_else_clause (stmt
);
8163 finish_if_stmt (stmt
);
8167 if (BIND_EXPR_BODY_BLOCK (t
))
8168 stmt
= begin_function_body ();
8170 stmt
= begin_compound_stmt (BIND_EXPR_TRY_BLOCK (t
)
8171 ? BCS_TRY_BLOCK
: 0);
8173 tsubst_expr (BIND_EXPR_BODY (t
), args
, complain
, in_decl
);
8175 if (BIND_EXPR_BODY_BLOCK (t
))
8176 finish_function_body (stmt
);
8178 finish_compound_stmt (stmt
);
8182 finish_break_stmt ();
8186 finish_continue_stmt ();
8190 stmt
= begin_switch_stmt ();
8191 tmp
= tsubst_expr (SWITCH_STMT_COND (t
), args
, complain
, in_decl
);
8192 finish_switch_cond (tmp
, stmt
);
8193 tsubst_expr (SWITCH_STMT_BODY (t
), args
, complain
, in_decl
);
8194 finish_switch_stmt (stmt
);
8197 case CASE_LABEL_EXPR
:
8198 finish_case_label (tsubst_expr (CASE_LOW (t
), args
, complain
, in_decl
),
8199 tsubst_expr (CASE_HIGH (t
), args
, complain
,
8204 finish_label_stmt (DECL_NAME (LABEL_EXPR_LABEL (t
)));
8208 tmp
= GOTO_DESTINATION (t
);
8209 if (TREE_CODE (tmp
) != LABEL_DECL
)
8210 /* Computed goto's must be tsubst'd into. On the other hand,
8211 non-computed gotos must not be; the identifier in question
8212 will have no binding. */
8213 tmp
= tsubst_expr (tmp
, args
, complain
, in_decl
);
8215 tmp
= DECL_NAME (tmp
);
8216 finish_goto_stmt (tmp
);
8220 tmp
= finish_asm_stmt
8221 (ASM_VOLATILE_P (t
),
8222 tsubst_expr (ASM_STRING (t
), args
, complain
, in_decl
),
8223 tsubst_expr (ASM_OUTPUTS (t
), args
, complain
, in_decl
),
8224 tsubst_expr (ASM_INPUTS (t
), args
, complain
, in_decl
),
8225 tsubst_expr (ASM_CLOBBERS (t
), args
, complain
, in_decl
));
8227 tree asm_expr
= tmp
;
8228 if (TREE_CODE (asm_expr
) == CLEANUP_POINT_EXPR
)
8229 asm_expr
= TREE_OPERAND (asm_expr
, 0);
8230 ASM_INPUT_P (asm_expr
) = ASM_INPUT_P (t
);
8237 stmt
= begin_try_block ();
8238 tsubst_expr (TRY_STMTS (t
), args
, complain
, in_decl
);
8239 finish_cleanup_try_block (stmt
);
8240 finish_cleanup (tsubst_expr (TRY_HANDLERS (t
), args
,
8246 if (FN_TRY_BLOCK_P (t
))
8247 stmt
= begin_function_try_block ();
8249 stmt
= begin_try_block ();
8251 tsubst_expr (TRY_STMTS (t
), args
, complain
, in_decl
);
8253 if (FN_TRY_BLOCK_P (t
))
8254 finish_function_try_block (stmt
);
8256 finish_try_block (stmt
);
8258 tsubst_expr (TRY_HANDLERS (t
), args
, complain
, in_decl
);
8259 if (FN_TRY_BLOCK_P (t
))
8260 finish_function_handler_sequence (stmt
);
8262 finish_handler_sequence (stmt
);
8270 stmt
= begin_handler ();
8271 if (HANDLER_PARMS (t
))
8273 decl
= HANDLER_PARMS (t
);
8274 decl
= tsubst (decl
, args
, complain
, in_decl
);
8275 /* Prevent instantiate_decl from trying to instantiate
8276 this variable. We've already done all that needs to be
8278 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
8282 finish_handler_parms (decl
, stmt
);
8283 tsubst_expr (HANDLER_BODY (t
), args
, complain
, in_decl
);
8284 finish_handler (stmt
);
8289 tsubst (TREE_TYPE (t
), args
, complain
, NULL_TREE
);
8293 gcc_assert (!STATEMENT_CODE_P (TREE_CODE (t
)));
8295 return tsubst_copy_and_build (t
, args
, complain
, in_decl
,
8296 /*function_p=*/false);
8302 /* T is a postfix-expression that is not being used in a function
8303 call. Return the substituted version of T. */
8306 tsubst_non_call_postfix_expression (tree t
, tree args
,
8307 tsubst_flags_t complain
,
8310 if (TREE_CODE (t
) == SCOPE_REF
)
8311 t
= tsubst_qualified_id (t
, args
, complain
, in_decl
,
8312 /*done=*/false, /*address_p=*/false);
8314 t
= tsubst_copy_and_build (t
, args
, complain
, in_decl
,
8315 /*function_p=*/false);
8320 /* Like tsubst but deals with expressions and performs semantic
8321 analysis. FUNCTION_P is true if T is the "F" in "F (ARGS)". */
8324 tsubst_copy_and_build (tree t
,
8326 tsubst_flags_t complain
,
8330 #define RECUR(NODE) \
8331 tsubst_copy_and_build (NODE, args, complain, in_decl, /*function_p=*/false)
8335 if (t
== NULL_TREE
|| t
== error_mark_node
)
8338 switch (TREE_CODE (t
))
8343 case IDENTIFIER_NODE
:
8347 tree qualifying_class
;
8348 bool non_integral_constant_expression_p
;
8349 const char *error_msg
;
8351 if (IDENTIFIER_TYPENAME_P (t
))
8353 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
8354 t
= mangle_conv_op_name_for_type (new_type
);
8357 /* Look up the name. */
8358 decl
= lookup_name (t
, 0);
8360 /* By convention, expressions use ERROR_MARK_NODE to indicate
8361 failure, not NULL_TREE. */
8362 if (decl
== NULL_TREE
)
8363 decl
= error_mark_node
;
8365 decl
= finish_id_expression (t
, decl
, NULL_TREE
,
8368 /*integral_constant_expression_p=*/false,
8369 /*allow_non_integral_constant_expression_p=*/false,
8370 &non_integral_constant_expression_p
,
8374 if (!function_p
&& TREE_CODE (decl
) == IDENTIFIER_NODE
)
8375 decl
= unqualified_name_lookup_error (decl
);
8379 case TEMPLATE_ID_EXPR
:
8382 tree
template = RECUR (TREE_OPERAND (t
, 0));
8383 tree targs
= TREE_OPERAND (t
, 1);
8386 targs
= tsubst_template_args (targs
, args
, complain
, in_decl
);
8388 if (TREE_CODE (template) == COMPONENT_REF
)
8390 object
= TREE_OPERAND (template, 0);
8391 template = TREE_OPERAND (template, 1);
8395 template = lookup_template_function (template, targs
);
8398 return build3 (COMPONENT_REF
, TREE_TYPE (template),
8399 object
, template, NULL_TREE
);
8406 tree r
= RECUR (TREE_OPERAND (t
, 0));
8408 if (REFERENCE_REF_P (t
))
8410 /* A type conversion to reference type will be enclosed in
8411 such an indirect ref, but the substitution of the cast
8412 will have also added such an indirect ref. */
8413 if (TREE_CODE (TREE_TYPE (r
)) == REFERENCE_TYPE
)
8414 r
= convert_from_reference (r
);
8417 r
= build_x_indirect_ref (r
, "unary *");
8423 (tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
8424 RECUR (TREE_OPERAND (t
, 0)));
8427 return build_functional_cast
8428 (tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
8429 RECUR (TREE_OPERAND (t
, 0)));
8431 case REINTERPRET_CAST_EXPR
:
8432 return build_reinterpret_cast
8433 (tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
8434 RECUR (TREE_OPERAND (t
, 0)));
8436 case CONST_CAST_EXPR
:
8437 return build_const_cast
8438 (tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
8439 RECUR (TREE_OPERAND (t
, 0)));
8441 case DYNAMIC_CAST_EXPR
:
8442 return build_dynamic_cast
8443 (tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
8444 RECUR (TREE_OPERAND (t
, 0)));
8446 case STATIC_CAST_EXPR
:
8447 return build_static_cast
8448 (tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
8449 RECUR (TREE_OPERAND (t
, 0)));
8451 case POSTDECREMENT_EXPR
:
8452 case POSTINCREMENT_EXPR
:
8453 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
8454 args
, complain
, in_decl
);
8455 return build_x_unary_op (TREE_CODE (t
), op1
);
8457 case PREDECREMENT_EXPR
:
8458 case PREINCREMENT_EXPR
:
8462 case TRUTH_NOT_EXPR
:
8463 case CONVERT_EXPR
: /* Unary + */
8466 return build_x_unary_op (TREE_CODE (t
), RECUR (TREE_OPERAND (t
, 0)));
8469 op1
= TREE_OPERAND (t
, 0);
8470 if (TREE_CODE (op1
) == SCOPE_REF
)
8471 op1
= tsubst_qualified_id (op1
, args
, complain
, in_decl
,
8472 /*done=*/true, /*address_p=*/true);
8474 op1
= tsubst_non_call_postfix_expression (op1
, args
, complain
,
8476 if (TREE_CODE (op1
) == LABEL_DECL
)
8477 return finish_label_address_expr (DECL_NAME (op1
));
8478 return build_x_unary_op (ADDR_EXPR
, op1
);
8483 case TRUNC_DIV_EXPR
:
8485 case FLOOR_DIV_EXPR
:
8486 case ROUND_DIV_EXPR
:
8487 case EXACT_DIV_EXPR
:
8491 case TRUNC_MOD_EXPR
:
8492 case FLOOR_MOD_EXPR
:
8493 case TRUTH_ANDIF_EXPR
:
8494 case TRUTH_ORIF_EXPR
:
8495 case TRUTH_AND_EXPR
:
8511 return build_x_binary_op
8513 RECUR (TREE_OPERAND (t
, 0)),
8514 RECUR (TREE_OPERAND (t
, 1)),
8515 /*overloaded_p=*/NULL
);
8518 return tsubst_qualified_id (t
, args
, complain
, in_decl
, /*done=*/true,
8519 /*address_p=*/false);
8521 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
8522 args
, complain
, in_decl
);
8523 return build_x_binary_op (ARRAY_REF
, op1
, RECUR (TREE_OPERAND (t
, 1)),
8524 /*overloaded_p=*/NULL
);
8528 op1
= TREE_OPERAND (t
, 0);
8531 /* When there are no ARGS, we are trying to evaluate a
8532 non-dependent expression from the parser. Trying to do
8533 the substitutions may not work. */
8535 op1
= TREE_TYPE (op1
);
8544 return cxx_sizeof_or_alignof_type (op1
, TREE_CODE (t
), true);
8546 return cxx_sizeof_or_alignof_expr (op1
, TREE_CODE (t
));
8550 tree r
= build_x_modify_expr
8551 (RECUR (TREE_OPERAND (t
, 0)),
8552 TREE_CODE (TREE_OPERAND (t
, 1)),
8553 RECUR (TREE_OPERAND (t
, 2)));
8554 /* TREE_NO_WARNING must be set if either the expression was
8555 parenthesized or it uses an operator such as >>= rather
8556 than plain assignment. In the former case, it was already
8557 set and must be copied. In the latter case,
8558 build_x_modify_expr sets it and it must not be reset
8560 if (TREE_NO_WARNING (t
))
8561 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
8566 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
8567 args
, complain
, in_decl
);
8568 /* Remember that there was a reference to this entity. */
8571 return build_x_arrow (op1
);
8575 (RECUR (TREE_OPERAND (t
, 0)),
8576 RECUR (TREE_OPERAND (t
, 1)),
8577 RECUR (TREE_OPERAND (t
, 2)),
8578 RECUR (TREE_OPERAND (t
, 3)),
8579 NEW_EXPR_USE_GLOBAL (t
));
8582 return delete_sanity
8583 (RECUR (TREE_OPERAND (t
, 0)),
8584 RECUR (TREE_OPERAND (t
, 1)),
8585 DELETE_EXPR_USE_VEC (t
),
8586 DELETE_EXPR_USE_GLOBAL (t
));
8589 return build_x_compound_expr (RECUR (TREE_OPERAND (t
, 0)),
8590 RECUR (TREE_OPERAND (t
, 1)));
8599 function
= TREE_OPERAND (t
, 0);
8600 /* When we parsed the expression, we determined whether or
8601 not Koenig lookup should be performed. */
8602 koenig_p
= KOENIG_LOOKUP_P (t
);
8603 if (TREE_CODE (function
) == SCOPE_REF
)
8606 function
= tsubst_qualified_id (function
, args
, complain
, in_decl
,
8608 /*address_p=*/false);
8612 qualified_p
= (TREE_CODE (function
) == COMPONENT_REF
8613 && (TREE_CODE (TREE_OPERAND (function
, 1))
8615 function
= tsubst_copy_and_build (function
, args
, complain
,
8618 if (BASELINK_P (function
))
8622 call_args
= RECUR (TREE_OPERAND (t
, 1));
8624 /* We do not perform argument-dependent lookup if normal
8625 lookup finds a non-function, in accordance with the
8626 expected resolution of DR 218. */
8628 && ((is_overloaded_fn (function
)
8629 /* If lookup found a member function, the Koenig lookup is
8630 not appropriate, even if an unqualified-name was used
8631 to denote the function. */
8632 && !DECL_FUNCTION_MEMBER_P (get_first_fn (function
)))
8633 || TREE_CODE (function
) == IDENTIFIER_NODE
))
8634 function
= perform_koenig_lookup (function
, call_args
);
8636 if (TREE_CODE (function
) == IDENTIFIER_NODE
)
8638 unqualified_name_lookup_error (function
);
8639 return error_mark_node
;
8642 /* Remember that there was a reference to this entity. */
8643 if (DECL_P (function
))
8644 mark_used (function
);
8646 if (TREE_CODE (function
) == OFFSET_REF
)
8647 return build_offset_ref_call_from_tree (function
, call_args
);
8648 if (TREE_CODE (function
) == COMPONENT_REF
)
8650 if (!BASELINK_P (TREE_OPERAND (function
, 1)))
8651 return finish_call_expr (function
, call_args
,
8652 /*disallow_virtual=*/false,
8653 /*koenig_p=*/false);
8655 return (build_new_method_call
8656 (TREE_OPERAND (function
, 0),
8657 TREE_OPERAND (function
, 1),
8658 call_args
, NULL_TREE
,
8659 qualified_p
? LOOKUP_NONVIRTUAL
: LOOKUP_NORMAL
));
8661 return finish_call_expr (function
, call_args
,
8662 /*disallow_virtual=*/qualified_p
,
8667 return build_x_conditional_expr
8668 (RECUR (TREE_OPERAND (t
, 0)),
8669 RECUR (TREE_OPERAND (t
, 1)),
8670 RECUR (TREE_OPERAND (t
, 2)));
8672 case PSEUDO_DTOR_EXPR
:
8673 return finish_pseudo_destructor_expr
8674 (RECUR (TREE_OPERAND (t
, 0)),
8675 RECUR (TREE_OPERAND (t
, 1)),
8676 RECUR (TREE_OPERAND (t
, 2)));
8680 tree purpose
, value
, chain
;
8682 if (t
== void_list_node
)
8685 purpose
= TREE_PURPOSE (t
);
8687 purpose
= RECUR (purpose
);
8688 value
= TREE_VALUE (t
);
8690 value
= RECUR (value
);
8691 chain
= TREE_CHAIN (t
);
8692 if (chain
&& chain
!= void_type_node
)
8693 chain
= RECUR (chain
);
8694 if (purpose
== TREE_PURPOSE (t
)
8695 && value
== TREE_VALUE (t
)
8696 && chain
== TREE_CHAIN (t
))
8698 return tree_cons (purpose
, value
, chain
);
8706 object
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
8707 args
, complain
, in_decl
);
8708 /* Remember that there was a reference to this entity. */
8709 if (DECL_P (object
))
8712 member
= TREE_OPERAND (t
, 1);
8713 if (BASELINK_P (member
))
8714 member
= tsubst_baselink (member
,
8715 non_reference (TREE_TYPE (object
)),
8716 args
, complain
, in_decl
);
8718 member
= tsubst_copy (member
, args
, complain
, in_decl
);
8720 if (member
== error_mark_node
)
8721 return error_mark_node
;
8722 else if (!CLASS_TYPE_P (TREE_TYPE (object
)))
8724 if (TREE_CODE (member
) == BIT_NOT_EXPR
)
8725 return finish_pseudo_destructor_expr (object
,
8727 TREE_TYPE (object
));
8728 else if (TREE_CODE (member
) == SCOPE_REF
8729 && (TREE_CODE (TREE_OPERAND (member
, 1)) == BIT_NOT_EXPR
))
8730 return finish_pseudo_destructor_expr (object
,
8732 TREE_TYPE (object
));
8734 else if (TREE_CODE (member
) == SCOPE_REF
8735 && TREE_CODE (TREE_OPERAND (member
, 1)) == TEMPLATE_ID_EXPR
)
8740 /* Lookup the template functions now that we know what the
8742 tmpl
= TREE_OPERAND (TREE_OPERAND (member
, 1), 0);
8743 args
= TREE_OPERAND (TREE_OPERAND (member
, 1), 1);
8744 member
= lookup_qualified_name (TREE_OPERAND (member
, 0), tmpl
,
8745 /*is_type_p=*/false,
8746 /*complain=*/false);
8747 if (BASELINK_P (member
))
8749 BASELINK_FUNCTIONS (member
)
8750 = build_nt (TEMPLATE_ID_EXPR
, BASELINK_FUNCTIONS (member
),
8752 member
= (adjust_result_of_qualified_name_lookup
8753 (member
, BINFO_TYPE (BASELINK_BINFO (member
)),
8754 TREE_TYPE (object
)));
8758 qualified_name_lookup_error (TREE_TYPE (object
), tmpl
,
8760 return error_mark_node
;
8763 else if (TREE_CODE (member
) == SCOPE_REF
8764 && !CLASS_TYPE_P (TREE_OPERAND (member
, 0))
8765 && TREE_CODE (TREE_OPERAND (member
, 0)) != NAMESPACE_DECL
)
8767 if (complain
& tf_error
)
8769 if (TYPE_P (TREE_OPERAND (member
, 0)))
8770 error ("%qT is not a class or namespace",
8771 TREE_OPERAND (member
, 0));
8773 error ("%qD is not a class or namespace",
8774 TREE_OPERAND (member
, 0));
8776 return error_mark_node
;
8778 else if (TREE_CODE (member
) == FIELD_DECL
)
8779 return finish_non_static_data_member (member
, object
, NULL_TREE
);
8781 return finish_class_member_access_expr (object
, member
);
8786 (RECUR (TREE_OPERAND (t
, 0)));
8792 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
8795 /* digest_init will do the wrong thing if we let it. */
8796 if (type
&& TYPE_PTRMEMFUNC_P (type
))
8800 /* We do not want to process the purpose of aggregate
8801 initializers as they are identifier nodes which will be
8802 looked up by digest_init. */
8803 purpose_p
= !(type
&& IS_AGGR_TYPE (type
));
8804 for (elts
= CONSTRUCTOR_ELTS (t
);
8806 elts
= TREE_CHAIN (elts
))
8808 tree purpose
= TREE_PURPOSE (elts
);
8809 tree value
= TREE_VALUE (elts
);
8811 if (purpose
&& purpose_p
)
8812 purpose
= RECUR (purpose
);
8813 value
= RECUR (value
);
8814 r
= tree_cons (purpose
, value
, r
);
8817 r
= build_constructor (NULL_TREE
, nreverse (r
));
8818 TREE_HAS_CONSTRUCTOR (r
) = TREE_HAS_CONSTRUCTOR (t
);
8821 return digest_init (type
, r
, 0);
8827 tree operand_0
= RECUR (TREE_OPERAND (t
, 0));
8828 if (TYPE_P (operand_0
))
8829 return get_typeid (operand_0
);
8830 return build_typeid (operand_0
);
8840 tree r
= tsubst_copy (t
, args
, complain
, in_decl
);
8842 if (TREE_CODE (TREE_TYPE (t
)) != REFERENCE_TYPE
)
8843 /* If the original type was a reference, we'll be wrapped in
8844 the appropriate INDIRECT_REF. */
8845 r
= convert_from_reference (r
);
8850 return build_x_va_arg (RECUR (TREE_OPERAND (t
, 0)),
8851 tsubst_copy (TREE_TYPE (t
), args
, complain
,
8855 return fold_offsetof (RECUR (TREE_OPERAND (t
, 0)));
8859 tree old_stmt_expr
= cur_stmt_expr
;
8860 tree stmt_expr
= begin_stmt_expr ();
8862 cur_stmt_expr
= stmt_expr
;
8863 tsubst_expr (STMT_EXPR_STMT (t
), args
, complain
, in_decl
);
8864 stmt_expr
= finish_stmt_expr (stmt_expr
, false);
8865 cur_stmt_expr
= old_stmt_expr
;
8871 t
= tsubst_copy (t
, args
, complain
, in_decl
);
8872 /* As in finish_id_expression, we resolve enumeration constants
8873 to their underlying values. */
8874 if (TREE_CODE (t
) == CONST_DECL
)
8875 return DECL_INITIAL (t
);
8879 return tsubst_copy (t
, args
, complain
, in_decl
);
8885 /* Verify that the instantiated ARGS are valid. For type arguments,
8886 make sure that the type's linkage is ok. For non-type arguments,
8887 make sure they are constants if they are integral or enumerations.
8888 Emit an error under control of COMPLAIN, and return TRUE on error. */
8891 check_instantiated_args (tree tmpl
, tree args
, tsubst_flags_t complain
)
8893 int ix
, len
= DECL_NTPARMS (tmpl
);
8894 bool result
= false;
8895 bool error_p
= complain
& tf_error
;
8897 for (ix
= 0; ix
!= len
; ix
++)
8899 tree t
= TREE_VEC_ELT (args
, ix
);
8903 /* [basic.link]: A name with no linkage (notably, the name
8904 of a class or enumeration declared in a local scope)
8905 shall not be used to declare an entity with linkage.
8906 This implies that names with no linkage cannot be used as
8907 template arguments. */
8908 tree nt
= no_linkage_check (t
, /*relaxed_p=*/false);
8912 if (TYPE_ANONYMOUS_P (nt
))
8913 error ("%qT is/uses anonymous type", t
);
8915 error ("%qT uses local type %qT", t
, nt
);
8919 /* In order to avoid all sorts of complications, we do not
8920 allow variably-modified types as template arguments. */
8921 else if (variably_modified_type_p (t
, NULL_TREE
))
8923 if (complain
& tf_error
)
8924 error ("%qT is a variably modified type", t
);
8928 /* A non-type argument of integral or enumerated type must be a
8930 else if (TREE_TYPE (t
)
8931 && INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (t
))
8932 && !TREE_CONSTANT (t
))
8934 if (complain
& tf_error
)
8935 error ("integral expression %qE is not constant", t
);
8939 if (result
&& error_p
)
8940 error (" trying to instantiate %qD", tmpl
);
8944 /* Instantiate the indicated variable or function template TMPL with
8945 the template arguments in TARG_PTR. */
8948 instantiate_template (tree tmpl
, tree targ_ptr
, tsubst_flags_t complain
)
8954 if (tmpl
== error_mark_node
)
8955 return error_mark_node
;
8957 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
);
8959 /* If this function is a clone, handle it specially. */
8960 if (DECL_CLONED_FUNCTION_P (tmpl
))
8965 spec
= instantiate_template (DECL_CLONED_FUNCTION (tmpl
), targ_ptr
,
8967 if (spec
== error_mark_node
)
8968 return error_mark_node
;
8970 /* Look for the clone. */
8971 FOR_EACH_CLONE (clone
, spec
)
8972 if (DECL_NAME (clone
) == DECL_NAME (tmpl
))
8974 /* We should always have found the clone by now. */
8979 /* Check to see if we already have this specialization. */
8980 spec
= retrieve_specialization (tmpl
, targ_ptr
,
8981 /*class_specializations_p=*/false);
8982 if (spec
!= NULL_TREE
)
8985 gen_tmpl
= most_general_template (tmpl
);
8986 if (tmpl
!= gen_tmpl
)
8988 /* The TMPL is a partial instantiation. To get a full set of
8989 arguments we must add the arguments used to perform the
8990 partial instantiation. */
8991 targ_ptr
= add_outermost_template_args (DECL_TI_ARGS (tmpl
),
8994 /* Check to see if we already have this specialization. */
8995 spec
= retrieve_specialization (gen_tmpl
, targ_ptr
,
8996 /*class_specializations_p=*/false);
8997 if (spec
!= NULL_TREE
)
9001 if (check_instantiated_args (gen_tmpl
, INNERMOST_TEMPLATE_ARGS (targ_ptr
),
9003 return error_mark_node
;
9005 /* We are building a FUNCTION_DECL, during which the access of its
9006 parameters and return types have to be checked. However this
9007 FUNCTION_DECL which is the desired context for access checking
9008 is not built yet. We solve this chicken-and-egg problem by
9009 deferring all checks until we have the FUNCTION_DECL. */
9010 push_deferring_access_checks (dk_deferred
);
9012 /* Substitute template parameters. */
9013 fndecl
= tsubst (DECL_TEMPLATE_RESULT (gen_tmpl
),
9014 targ_ptr
, complain
, gen_tmpl
);
9016 /* Now we know the specialization, compute access previously
9018 push_access_scope (fndecl
);
9019 perform_deferred_access_checks ();
9020 pop_access_scope (fndecl
);
9021 pop_deferring_access_checks ();
9023 /* The DECL_TI_TEMPLATE should always be the immediate parent
9024 template, not the most general template. */
9025 DECL_TI_TEMPLATE (fndecl
) = tmpl
;
9027 /* If we've just instantiated the main entry point for a function,
9028 instantiate all the alternate entry points as well. We do this
9029 by cloning the instantiation of the main entry point, not by
9030 instantiating the template clones. */
9031 if (TREE_CHAIN (gen_tmpl
) && DECL_CLONED_FUNCTION_P (TREE_CHAIN (gen_tmpl
)))
9032 clone_function_decl (fndecl
, /*update_method_vec_p=*/0);
9037 /* The FN is a TEMPLATE_DECL for a function. The ARGS are the
9038 arguments that are being used when calling it. TARGS is a vector
9039 into which the deduced template arguments are placed.
9041 Return zero for success, 2 for an incomplete match that doesn't resolve
9042 all the types, and 1 for complete failure. An error message will be
9043 printed only for an incomplete match.
9045 If FN is a conversion operator, or we are trying to produce a specific
9046 specialization, RETURN_TYPE is the return type desired.
9048 The EXPLICIT_TARGS are explicit template arguments provided via a
9051 The parameter STRICT is one of:
9054 We are deducing arguments for a function call, as in
9058 We are deducing arguments for a conversion function, as in
9062 We are deducing arguments when doing an explicit instantiation
9063 as in [temp.explicit], when determining an explicit specialization
9064 as in [temp.expl.spec], or when taking the address of a function
9065 template, as in [temp.deduct.funcaddr].
9068 We are deducing arguments when calculating the partial
9069 ordering between specializations of function or class
9070 templates, as in [temp.func.order] and [temp.class.order].
9072 LEN is the number of parms to consider before returning success, or -1
9073 for all. This is used in partial ordering to avoid comparing parms for
9074 which no actual argument was passed, since they are not considered in
9075 overload resolution (and are explicitly excluded from consideration in
9076 partial ordering in [temp.func.order]/6). */
9079 fn_type_unification (tree fn
,
9080 tree explicit_targs
,
9084 unification_kind_t strict
,
9091 gcc_assert (TREE_CODE (fn
) == TEMPLATE_DECL
);
9093 fntype
= TREE_TYPE (fn
);
9098 The specified template arguments must match the template
9099 parameters in kind (i.e., type, nontype, template), and there
9100 must not be more arguments than there are parameters;
9101 otherwise type deduction fails.
9103 Nontype arguments must match the types of the corresponding
9104 nontype template parameters, or must be convertible to the
9105 types of the corresponding nontype parameters as specified in
9106 _temp.arg.nontype_, otherwise type deduction fails.
9108 All references in the function type of the function template
9109 to the corresponding template parameters are replaced by the
9110 specified template argument values. If a substitution in a
9111 template parameter or in the function type of the function
9112 template results in an invalid type, type deduction fails. */
9114 tree converted_args
;
9117 if (explicit_targs
== error_mark_node
)
9121 = (coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
9122 explicit_targs
, NULL_TREE
, tf_none
,
9123 /*require_all_arguments=*/0));
9124 if (converted_args
== error_mark_node
)
9127 /* Substitute the explicit args into the function type. This is
9128 necessary so that, for instance, explicitly declared function
9129 arguments can match null pointed constants. If we were given
9130 an incomplete set of explicit args, we must not do semantic
9131 processing during substitution as we could create partial
9133 incomplete
= NUM_TMPL_ARGS (explicit_targs
) != NUM_TMPL_ARGS (targs
);
9134 processing_template_decl
+= incomplete
;
9135 fntype
= tsubst (fntype
, converted_args
, tf_none
, NULL_TREE
);
9136 processing_template_decl
-= incomplete
;
9138 if (fntype
== error_mark_node
)
9141 /* Place the explicitly specified arguments in TARGS. */
9142 for (i
= NUM_TMPL_ARGS (converted_args
); i
--;)
9143 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (converted_args
, i
);
9146 parms
= TYPE_ARG_TYPES (fntype
);
9147 /* Never do unification on the 'this' parameter. */
9148 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
))
9149 parms
= TREE_CHAIN (parms
);
9153 /* We've been given a return type to match, prepend it. */
9154 parms
= tree_cons (NULL_TREE
, TREE_TYPE (fntype
), parms
);
9155 args
= tree_cons (NULL_TREE
, return_type
, args
);
9160 /* We allow incomplete unification without an error message here
9161 because the standard doesn't seem to explicitly prohibit it. Our
9162 callers must be ready to deal with unification failures in any
9164 result
= type_unification_real (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
9165 targs
, parms
, args
, /*subr=*/0,
9166 strict
, /*allow_incomplete*/1, len
);
9169 /* All is well so far. Now, check:
9173 When all template arguments have been deduced, all uses of
9174 template parameters in nondeduced contexts are replaced with
9175 the corresponding deduced argument values. If the
9176 substitution results in an invalid type, as described above,
9177 type deduction fails. */
9178 if (tsubst (TREE_TYPE (fn
), targs
, tf_none
, NULL_TREE
)
9185 /* Adjust types before performing type deduction, as described in
9186 [temp.deduct.call] and [temp.deduct.conv]. The rules in these two
9187 sections are symmetric. PARM is the type of a function parameter
9188 or the return type of the conversion function. ARG is the type of
9189 the argument passed to the call, or the type of the value
9190 initialized with the result of the conversion function. */
9193 maybe_adjust_types_for_deduction (unification_kind_t strict
,
9206 /* Swap PARM and ARG throughout the remainder of this
9207 function; the handling is precisely symmetric since PARM
9208 will initialize ARG rather than vice versa. */
9216 /* There is nothing to do in this case. */
9220 /* DR 214. [temp.func.order] is underspecified, and leads to no
9221 ordering between things like `T *' and `T const &' for `U *'.
9222 The former has T=U and the latter T=U*. The former looks more
9223 specialized and John Spicer considers it well-formed (the EDG
9224 compiler accepts it).
9226 John also confirms that deduction should proceed as in a function
9227 call. Which implies the usual ARG and PARM conversions as DEDUCE_CALL.
9228 However, in ordering, ARG can have REFERENCE_TYPE, but no argument
9229 to an actual call can have such a type.
9231 If both ARG and PARM are REFERENCE_TYPE, we change neither.
9232 If only ARG is a REFERENCE_TYPE, we look through that and then
9233 proceed as with DEDUCE_CALL (which could further convert it). */
9234 if (TREE_CODE (*arg
) == REFERENCE_TYPE
)
9236 if (TREE_CODE (*parm
) == REFERENCE_TYPE
)
9238 *arg
= TREE_TYPE (*arg
);
9245 if (TREE_CODE (*parm
) != REFERENCE_TYPE
)
9247 /* [temp.deduct.call]
9249 If P is not a reference type:
9251 --If A is an array type, the pointer type produced by the
9252 array-to-pointer standard conversion (_conv.array_) is
9253 used in place of A for type deduction; otherwise,
9255 --If A is a function type, the pointer type produced by
9256 the function-to-pointer standard conversion
9257 (_conv.func_) is used in place of A for type deduction;
9260 --If A is a cv-qualified type, the top level
9261 cv-qualifiers of A's type are ignored for type
9263 if (TREE_CODE (*arg
) == ARRAY_TYPE
)
9264 *arg
= build_pointer_type (TREE_TYPE (*arg
));
9265 else if (TREE_CODE (*arg
) == FUNCTION_TYPE
)
9266 *arg
= build_pointer_type (*arg
);
9268 *arg
= TYPE_MAIN_VARIANT (*arg
);
9271 /* [temp.deduct.call]
9273 If P is a cv-qualified type, the top level cv-qualifiers
9274 of P's type are ignored for type deduction. If P is a
9275 reference type, the type referred to by P is used for
9277 *parm
= TYPE_MAIN_VARIANT (*parm
);
9278 if (TREE_CODE (*parm
) == REFERENCE_TYPE
)
9280 *parm
= TREE_TYPE (*parm
);
9281 result
|= UNIFY_ALLOW_OUTER_MORE_CV_QUAL
;
9284 /* DR 322. For conversion deduction, remove a reference type on parm
9285 too (which has been swapped into ARG). */
9286 if (strict
== DEDUCE_CONV
&& TREE_CODE (*arg
) == REFERENCE_TYPE
)
9287 *arg
= TREE_TYPE (*arg
);
9292 /* Most parms like fn_type_unification.
9294 If SUBR is 1, we're being called recursively (to unify the
9295 arguments of a function or method parameter of a function
9299 type_unification_real (tree tparms
,
9304 unification_kind_t strict
,
9305 int allow_incomplete
,
9310 int ntparms
= TREE_VEC_LENGTH (tparms
);
9312 int saw_undeduced
= 0;
9316 gcc_assert (TREE_CODE (tparms
) == TREE_VEC
);
9317 gcc_assert (xparms
== NULL_TREE
|| TREE_CODE (xparms
) == TREE_LIST
);
9318 gcc_assert (!xargs
|| TREE_CODE (xargs
) == TREE_LIST
);
9319 gcc_assert (ntparms
> 0);
9324 sub_strict
= (UNIFY_ALLOW_OUTER_LEVEL
| UNIFY_ALLOW_MORE_CV_QUAL
9325 | UNIFY_ALLOW_DERIVED
);
9329 sub_strict
= UNIFY_ALLOW_LESS_CV_QUAL
;
9333 sub_strict
= UNIFY_ALLOW_NONE
;
9337 sub_strict
= UNIFY_ALLOW_NONE
;
9353 && parms
!= void_list_node
9355 && args
!= void_list_node
)
9357 parm
= TREE_VALUE (parms
);
9358 parms
= TREE_CHAIN (parms
);
9359 arg
= TREE_VALUE (args
);
9360 args
= TREE_CHAIN (args
);
9362 if (arg
== error_mark_node
)
9364 if (arg
== unknown_type_node
)
9365 /* We can't deduce anything from this, but we might get all the
9366 template args from other function args. */
9369 /* Conversions will be performed on a function argument that
9370 corresponds with a function parameter that contains only
9371 non-deducible template parameters and explicitly specified
9372 template parameters. */
9373 if (!uses_template_parms (parm
))
9378 type
= TREE_TYPE (arg
);
9382 if (strict
== DEDUCE_EXACT
|| strict
== DEDUCE_ORDER
)
9384 if (same_type_p (parm
, type
))
9388 /* It might work; we shouldn't check now, because we might
9389 get into infinite recursion. Overload resolution will
9398 gcc_assert (TREE_TYPE (arg
) != NULL_TREE
);
9399 if (type_unknown_p (arg
))
9401 /* [temp.deduct.type] A template-argument can be deduced from
9402 a pointer to function or pointer to member function
9403 argument if the set of overloaded functions does not
9404 contain function templates and at most one of a set of
9405 overloaded functions provides a unique match. */
9407 if (resolve_overloaded_unification
9408 (tparms
, targs
, parm
, arg
, strict
, sub_strict
)
9413 arg
= TREE_TYPE (arg
);
9414 if (arg
== error_mark_node
)
9419 int arg_strict
= sub_strict
;
9422 arg_strict
|= maybe_adjust_types_for_deduction (strict
, &parm
, &arg
);
9424 if (unify (tparms
, targs
, parm
, arg
, arg_strict
))
9428 /* Are we done with the interesting parms? */
9432 /* Fail if we've reached the end of the parm list, and more args
9433 are present, and the parm list isn't variadic. */
9434 if (args
&& args
!= void_list_node
&& parms
== void_list_node
)
9436 /* Fail if parms are left and they don't have default values. */
9438 && parms
!= void_list_node
9439 && TREE_PURPOSE (parms
) == NULL_TREE
)
9444 for (i
= 0; i
< ntparms
; i
++)
9445 if (TREE_VEC_ELT (targs
, i
) == NULL_TREE
)
9447 tree tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, i
));
9449 /* If this is an undeduced nontype parameter that depends on
9450 a type parameter, try another pass; its type may have been
9451 deduced from a later argument than the one from which
9452 this parameter can be deduced. */
9453 if (TREE_CODE (tparm
) == PARM_DECL
9454 && uses_template_parms (TREE_TYPE (tparm
))
9455 && !saw_undeduced
++)
9458 if (!allow_incomplete
)
9459 error ("incomplete type unification");
9465 /* Subroutine of type_unification_real. Args are like the variables at the
9466 call site. ARG is an overloaded function (or template-id); we try
9467 deducing template args from each of the overloads, and if only one
9468 succeeds, we go with that. Modifies TARGS and returns 0 on success. */
9471 resolve_overloaded_unification (tree tparms
,
9475 unification_kind_t strict
,
9478 tree tempargs
= copy_node (targs
);
9482 if (TREE_CODE (arg
) == ADDR_EXPR
)
9484 arg
= TREE_OPERAND (arg
, 0);
9490 if (TREE_CODE (arg
) == COMPONENT_REF
)
9491 /* Handle `&x' where `x' is some static or non-static member
9493 arg
= TREE_OPERAND (arg
, 1);
9495 if (TREE_CODE (arg
) == OFFSET_REF
)
9496 arg
= TREE_OPERAND (arg
, 1);
9498 /* Strip baselink information. */
9499 if (BASELINK_P (arg
))
9500 arg
= BASELINK_FUNCTIONS (arg
);
9502 if (TREE_CODE (arg
) == TEMPLATE_ID_EXPR
)
9504 /* If we got some explicit template args, we need to plug them into
9505 the affected templates before we try to unify, in case the
9506 explicit args will completely resolve the templates in question. */
9508 tree expl_subargs
= TREE_OPERAND (arg
, 1);
9509 arg
= TREE_OPERAND (arg
, 0);
9511 for (; arg
; arg
= OVL_NEXT (arg
))
9513 tree fn
= OVL_CURRENT (arg
);
9516 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
9519 subargs
= get_bindings_overload (fn
, DECL_TEMPLATE_RESULT (fn
),
9523 elem
= tsubst (TREE_TYPE (fn
), subargs
, tf_none
, NULL_TREE
);
9524 good
+= try_one_overload (tparms
, targs
, tempargs
, parm
,
9525 elem
, strict
, sub_strict
, addr_p
);
9531 gcc_assert (TREE_CODE (arg
) == OVERLOAD
9532 || TREE_CODE (arg
) == FUNCTION_DECL
);
9534 for (; arg
; arg
= OVL_NEXT (arg
))
9535 good
+= try_one_overload (tparms
, targs
, tempargs
, parm
,
9536 TREE_TYPE (OVL_CURRENT (arg
)),
9537 strict
, sub_strict
, addr_p
);
9540 /* [temp.deduct.type] A template-argument can be deduced from a pointer
9541 to function or pointer to member function argument if the set of
9542 overloaded functions does not contain function templates and at most
9543 one of a set of overloaded functions provides a unique match.
9545 So if we found multiple possibilities, we return success but don't
9550 int i
= TREE_VEC_LENGTH (targs
);
9552 if (TREE_VEC_ELT (tempargs
, i
))
9553 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (tempargs
, i
);
9561 /* Subroutine of resolve_overloaded_unification; does deduction for a single
9562 overload. Fills TARGS with any deduced arguments, or error_mark_node if
9563 different overloads deduce different arguments for a given parm.
9564 ADDR_P is true if the expression for which deduction is being
9565 performed was of the form "& fn" rather than simply "fn".
9567 Returns 1 on success. */
9570 try_one_overload (tree tparms
,
9575 unification_kind_t strict
,
9583 /* [temp.deduct.type] A template-argument can be deduced from a pointer
9584 to function or pointer to member function argument if the set of
9585 overloaded functions does not contain function templates and at most
9586 one of a set of overloaded functions provides a unique match.
9588 So if this is a template, just return success. */
9590 if (uses_template_parms (arg
))
9593 if (TREE_CODE (arg
) == METHOD_TYPE
)
9594 arg
= build_ptrmemfunc_type (build_pointer_type (arg
));
9596 arg
= build_pointer_type (arg
);
9598 sub_strict
|= maybe_adjust_types_for_deduction (strict
, &parm
, &arg
);
9600 /* We don't copy orig_targs for this because if we have already deduced
9601 some template args from previous args, unify would complain when we
9602 try to deduce a template parameter for the same argument, even though
9603 there isn't really a conflict. */
9604 nargs
= TREE_VEC_LENGTH (targs
);
9605 tempargs
= make_tree_vec (nargs
);
9607 if (unify (tparms
, tempargs
, parm
, arg
, sub_strict
) != 0)
9610 /* First make sure we didn't deduce anything that conflicts with
9611 explicitly specified args. */
9612 for (i
= nargs
; i
--; )
9614 tree elt
= TREE_VEC_ELT (tempargs
, i
);
9615 tree oldelt
= TREE_VEC_ELT (orig_targs
, i
);
9617 if (elt
== NULL_TREE
)
9619 else if (uses_template_parms (elt
))
9621 /* Since we're unifying against ourselves, we will fill in template
9622 args used in the function parm list with our own template parms.
9624 TREE_VEC_ELT (tempargs
, i
) = NULL_TREE
;
9627 else if (oldelt
&& ! template_args_equal (oldelt
, elt
))
9631 for (i
= nargs
; i
--; )
9633 tree elt
= TREE_VEC_ELT (tempargs
, i
);
9636 TREE_VEC_ELT (targs
, i
) = elt
;
9642 /* Verify that nondeduce template argument agrees with the type
9643 obtained from argument deduction. Return nonzero if the
9648 struct A { typedef int X; };
9649 template <class T, class U> struct C {};
9650 template <class T> struct C<T, typename T::X> {};
9652 Then with the instantiation `C<A, int>', we can deduce that
9653 `T' is `A' but unify () does not check whether `typename T::X'
9654 is `int'. This function ensure that they agree.
9656 TARGS, PARMS are the same as the arguments of unify.
9657 ARGS contains template arguments from all levels. */
9660 verify_class_unification (tree targs
, tree parms
, tree args
)
9662 parms
= tsubst (parms
, add_outermost_template_args (args
, targs
),
9663 tf_none
, NULL_TREE
);
9664 if (parms
== error_mark_node
)
9667 return !comp_template_args (parms
, INNERMOST_TEMPLATE_ARGS (args
));
9670 /* PARM is a template class (perhaps with unbound template
9671 parameters). ARG is a fully instantiated type. If ARG can be
9672 bound to PARM, return ARG, otherwise return NULL_TREE. TPARMS and
9673 TARGS are as for unify. */
9676 try_class_unification (tree tparms
, tree targs
, tree parm
, tree arg
)
9680 if (!CLASSTYPE_TEMPLATE_INFO (arg
)
9681 || (most_general_template (CLASSTYPE_TI_TEMPLATE (arg
))
9682 != most_general_template (CLASSTYPE_TI_TEMPLATE (parm
))))
9685 /* We need to make a new template argument vector for the call to
9686 unify. If we used TARGS, we'd clutter it up with the result of
9687 the attempted unification, even if this class didn't work out.
9688 We also don't want to commit ourselves to all the unifications
9689 we've already done, since unification is supposed to be done on
9690 an argument-by-argument basis. In other words, consider the
9691 following pathological case:
9693 template <int I, int J, int K>
9696 template <int I, int J>
9697 struct S<I, J, 2> : public S<I, I, I>, S<J, J, J> {};
9699 template <int I, int J, int K>
9700 void f(S<I, J, K>, S<I, I, I>);
9709 Now, by the time we consider the unification involving `s2', we
9710 already know that we must have `f<0, 0, 0>'. But, even though
9711 `S<0, 1, 2>' is derived from `S<0, 0, 0>', the code is invalid
9712 because there are two ways to unify base classes of S<0, 1, 2>
9713 with S<I, I, I>. If we kept the already deduced knowledge, we
9714 would reject the possibility I=1. */
9715 copy_of_targs
= make_tree_vec (TREE_VEC_LENGTH (targs
));
9717 /* If unification failed, we're done. */
9718 if (unify (tparms
, copy_of_targs
, CLASSTYPE_TI_ARGS (parm
),
9719 CLASSTYPE_TI_ARGS (arg
), UNIFY_ALLOW_NONE
))
9725 /* Given a template type PARM and a class type ARG, find the unique
9726 base type in ARG that is an instance of PARM. We do not examine
9727 ARG itself; only its base-classes. If there is not exactly one
9728 appropriate base class, return NULL_TREE. PARM may be the type of
9729 a partial specialization, as well as a plain template type. Used
9733 get_template_base (tree tparms
, tree targs
, tree parm
, tree arg
)
9735 tree rval
= NULL_TREE
;
9738 gcc_assert (IS_AGGR_TYPE_CODE (TREE_CODE (arg
)));
9740 binfo
= TYPE_BINFO (complete_type (arg
));
9742 /* The type could not be completed. */
9745 /* Walk in inheritance graph order. The search order is not
9746 important, and this avoids multiple walks of virtual bases. */
9747 for (binfo
= TREE_CHAIN (binfo
); binfo
; binfo
= TREE_CHAIN (binfo
))
9749 tree r
= try_class_unification (tparms
, targs
, parm
, BINFO_TYPE (binfo
));
9753 /* If there is more than one satisfactory baseclass, then:
9757 If they yield more than one possible deduced A, the type
9761 if (rval
&& !same_type_p (r
, rval
))
9771 /* Returns the level of DECL, which declares a template parameter. */
9774 template_decl_level (tree decl
)
9776 switch (TREE_CODE (decl
))
9780 return TEMPLATE_TYPE_LEVEL (TREE_TYPE (decl
));
9783 return TEMPLATE_PARM_LEVEL (DECL_INITIAL (decl
));
9791 /* Decide whether ARG can be unified with PARM, considering only the
9792 cv-qualifiers of each type, given STRICT as documented for unify.
9793 Returns nonzero iff the unification is OK on that basis. */
9796 check_cv_quals_for_unify (int strict
, tree arg
, tree parm
)
9798 int arg_quals
= cp_type_quals (arg
);
9799 int parm_quals
= cp_type_quals (parm
);
9801 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
9802 && !(strict
& UNIFY_ALLOW_OUTER_MORE_CV_QUAL
))
9804 /* Although a CVR qualifier is ignored when being applied to a
9805 substituted template parameter ([8.3.2]/1 for example), that
9806 does not apply during deduction [14.8.2.4]/1, (even though
9807 that is not explicitly mentioned, [14.8.2.4]/9 indicates
9808 this). Except when we're allowing additional CV qualifiers
9809 at the outer level [14.8.2.1]/3,1st bullet. */
9810 if ((TREE_CODE (arg
) == REFERENCE_TYPE
9811 || TREE_CODE (arg
) == FUNCTION_TYPE
9812 || TREE_CODE (arg
) == METHOD_TYPE
)
9813 && (parm_quals
& (TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
)))
9816 if ((!POINTER_TYPE_P (arg
) && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
)
9817 && (parm_quals
& TYPE_QUAL_RESTRICT
))
9821 if (!(strict
& (UNIFY_ALLOW_MORE_CV_QUAL
| UNIFY_ALLOW_OUTER_MORE_CV_QUAL
))
9822 && (arg_quals
& parm_quals
) != parm_quals
)
9825 if (!(strict
& (UNIFY_ALLOW_LESS_CV_QUAL
| UNIFY_ALLOW_OUTER_LESS_CV_QUAL
))
9826 && (parm_quals
& arg_quals
) != arg_quals
)
9832 /* Takes parameters as for type_unification. Returns 0 if the
9833 type deduction succeeds, 1 otherwise. The parameter STRICT is a
9834 bitwise or of the following flags:
9837 Require an exact match between PARM and ARG.
9838 UNIFY_ALLOW_MORE_CV_QUAL:
9839 Allow the deduced ARG to be more cv-qualified (by qualification
9840 conversion) than ARG.
9841 UNIFY_ALLOW_LESS_CV_QUAL:
9842 Allow the deduced ARG to be less cv-qualified than ARG.
9843 UNIFY_ALLOW_DERIVED:
9844 Allow the deduced ARG to be a template base class of ARG,
9845 or a pointer to a template base class of the type pointed to by
9847 UNIFY_ALLOW_INTEGER:
9848 Allow any integral type to be deduced. See the TEMPLATE_PARM_INDEX
9849 case for more information.
9850 UNIFY_ALLOW_OUTER_LEVEL:
9851 This is the outermost level of a deduction. Used to determine validity
9852 of qualification conversions. A valid qualification conversion must
9853 have const qualified pointers leading up to the inner type which
9854 requires additional CV quals, except at the outer level, where const
9855 is not required [conv.qual]. It would be normal to set this flag in
9856 addition to setting UNIFY_ALLOW_MORE_CV_QUAL.
9857 UNIFY_ALLOW_OUTER_MORE_CV_QUAL:
9858 This is the outermost level of a deduction, and PARM can be more CV
9859 qualified at this point.
9860 UNIFY_ALLOW_OUTER_LESS_CV_QUAL:
9861 This is the outermost level of a deduction, and PARM can be less CV
9862 qualified at this point. */
9865 unify (tree tparms
, tree targs
, tree parm
, tree arg
, int strict
)
9870 int strict_in
= strict
;
9872 /* I don't think this will do the right thing with respect to types.
9873 But the only case I've seen it in so far has been array bounds, where
9874 signedness is the only information lost, and I think that will be
9876 while (TREE_CODE (parm
) == NOP_EXPR
)
9877 parm
= TREE_OPERAND (parm
, 0);
9879 if (arg
== error_mark_node
)
9881 if (arg
== unknown_type_node
)
9882 /* We can't deduce anything from this, but we might get all the
9883 template args from other function args. */
9886 /* If PARM uses template parameters, then we can't bail out here,
9887 even if ARG == PARM, since we won't record unifications for the
9888 template parameters. We might need them if we're trying to
9889 figure out which of two things is more specialized. */
9890 if (arg
== parm
&& !uses_template_parms (parm
))
9893 /* Immediately reject some pairs that won't unify because of
9894 cv-qualification mismatches. */
9895 if (TREE_CODE (arg
) == TREE_CODE (parm
)
9897 /* It is the elements of the array which hold the cv quals of an array
9898 type, and the elements might be template type parms. We'll check
9900 && TREE_CODE (arg
) != ARRAY_TYPE
9901 /* We check the cv-qualifiers when unifying with template type
9902 parameters below. We want to allow ARG `const T' to unify with
9903 PARM `T' for example, when computing which of two templates
9904 is more specialized, for example. */
9905 && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
9906 && !check_cv_quals_for_unify (strict_in
, arg
, parm
))
9909 if (!(strict
& UNIFY_ALLOW_OUTER_LEVEL
)
9910 && TYPE_P (parm
) && !CP_TYPE_CONST_P (parm
))
9911 strict
&= ~UNIFY_ALLOW_MORE_CV_QUAL
;
9912 strict
&= ~UNIFY_ALLOW_OUTER_LEVEL
;
9913 strict
&= ~UNIFY_ALLOW_DERIVED
;
9914 strict
&= ~UNIFY_ALLOW_OUTER_MORE_CV_QUAL
;
9915 strict
&= ~UNIFY_ALLOW_OUTER_LESS_CV_QUAL
;
9917 switch (TREE_CODE (parm
))
9921 case UNBOUND_CLASS_TEMPLATE
:
9922 /* In a type which contains a nested-name-specifier, template
9923 argument values cannot be deduced for template parameters used
9924 within the nested-name-specifier. */
9927 case TEMPLATE_TYPE_PARM
:
9928 case TEMPLATE_TEMPLATE_PARM
:
9929 case BOUND_TEMPLATE_TEMPLATE_PARM
:
9930 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
9932 if (TEMPLATE_TYPE_LEVEL (parm
)
9933 != template_decl_level (tparm
))
9934 /* The PARM is not one we're trying to unify. Just check
9935 to see if it matches ARG. */
9936 return (TREE_CODE (arg
) == TREE_CODE (parm
)
9937 && same_type_p (parm
, arg
)) ? 0 : 1;
9938 idx
= TEMPLATE_TYPE_IDX (parm
);
9939 targ
= TREE_VEC_ELT (targs
, idx
);
9940 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, idx
));
9942 /* Check for mixed types and values. */
9943 if ((TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
9944 && TREE_CODE (tparm
) != TYPE_DECL
)
9945 || (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
9946 && TREE_CODE (tparm
) != TEMPLATE_DECL
))
9949 if (TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
9951 /* ARG must be constructed from a template class or a template
9952 template parameter. */
9953 if (TREE_CODE (arg
) != BOUND_TEMPLATE_TEMPLATE_PARM
9954 && (TREE_CODE (arg
) != RECORD_TYPE
|| !CLASSTYPE_TEMPLATE_INFO (arg
)))
9958 tree parmtmpl
= TYPE_TI_TEMPLATE (parm
);
9959 tree parmvec
= TYPE_TI_ARGS (parm
);
9960 tree argvec
= INNERMOST_TEMPLATE_ARGS (TYPE_TI_ARGS (arg
));
9962 = DECL_INNERMOST_TEMPLATE_PARMS (TYPE_TI_TEMPLATE (arg
));
9965 /* The parameter and argument roles have to be switched here
9966 in order to handle default arguments properly. For example,
9967 template<template <class> class TT> void f(TT<int>)
9968 should be able to accept vector<int> which comes from
9969 template <class T, class Allocator = allocator>
9972 if (coerce_template_parms (argtmplvec
, parmvec
, parmtmpl
, 0, 1)
9976 /* Deduce arguments T, i from TT<T> or TT<i>.
9977 We check each element of PARMVEC and ARGVEC individually
9978 rather than the whole TREE_VEC since they can have
9979 different number of elements. */
9981 for (i
= 0; i
< TREE_VEC_LENGTH (parmvec
); ++i
)
9983 if (unify (tparms
, targs
,
9984 TREE_VEC_ELT (parmvec
, i
),
9985 TREE_VEC_ELT (argvec
, i
),
9990 arg
= TYPE_TI_TEMPLATE (arg
);
9992 /* Fall through to deduce template name. */
9995 if (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
9996 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
9998 /* Deduce template name TT from TT, TT<>, TT<T> and TT<i>. */
10000 /* Simple cases: Value already set, does match or doesn't. */
10001 if (targ
!= NULL_TREE
&& template_args_equal (targ
, arg
))
10008 /* If PARM is `const T' and ARG is only `int', we don't have
10009 a match unless we are allowing additional qualification.
10010 If ARG is `const int' and PARM is just `T' that's OK;
10011 that binds `const int' to `T'. */
10012 if (!check_cv_quals_for_unify (strict_in
| UNIFY_ALLOW_LESS_CV_QUAL
,
10016 /* Consider the case where ARG is `const volatile int' and
10017 PARM is `const T'. Then, T should be `volatile int'. */
10018 arg
= cp_build_qualified_type_real
10019 (arg
, cp_type_quals (arg
) & ~cp_type_quals (parm
), tf_none
);
10020 if (arg
== error_mark_node
)
10023 /* Simple cases: Value already set, does match or doesn't. */
10024 if (targ
!= NULL_TREE
&& same_type_p (targ
, arg
))
10029 /* Make sure that ARG is not a variable-sized array. (Note
10030 that were talking about variable-sized arrays (like
10031 `int[n]'), rather than arrays of unknown size (like
10032 `int[]').) We'll get very confused by such a type since
10033 the bound of the array will not be computable in an
10034 instantiation. Besides, such types are not allowed in
10035 ISO C++, so we can do as we please here. */
10036 if (variably_modified_type_p (arg
, NULL_TREE
))
10040 TREE_VEC_ELT (targs
, idx
) = arg
;
10043 case TEMPLATE_PARM_INDEX
:
10044 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
10046 if (TEMPLATE_PARM_LEVEL (parm
)
10047 != template_decl_level (tparm
))
10048 /* The PARM is not one we're trying to unify. Just check
10049 to see if it matches ARG. */
10050 return !(TREE_CODE (arg
) == TREE_CODE (parm
)
10051 && cp_tree_equal (parm
, arg
));
10053 idx
= TEMPLATE_PARM_IDX (parm
);
10054 targ
= TREE_VEC_ELT (targs
, idx
);
10057 return !cp_tree_equal (targ
, arg
);
10059 /* [temp.deduct.type] If, in the declaration of a function template
10060 with a non-type template-parameter, the non-type
10061 template-parameter is used in an expression in the function
10062 parameter-list and, if the corresponding template-argument is
10063 deduced, the template-argument type shall match the type of the
10064 template-parameter exactly, except that a template-argument
10065 deduced from an array bound may be of any integral type.
10066 The non-type parameter might use already deduced type parameters. */
10067 tparm
= tsubst (TREE_TYPE (parm
), targs
, 0, NULL_TREE
);
10068 if (!TREE_TYPE (arg
))
10069 /* Template-parameter dependent expression. Just accept it for now.
10070 It will later be processed in convert_template_argument. */
10072 else if (same_type_p (TREE_TYPE (arg
), tparm
))
10074 else if ((strict
& UNIFY_ALLOW_INTEGER
)
10075 && (TREE_CODE (tparm
) == INTEGER_TYPE
10076 || TREE_CODE (tparm
) == BOOLEAN_TYPE
))
10077 /* Convert the ARG to the type of PARM; the deduced non-type
10078 template argument must exactly match the types of the
10079 corresponding parameter. */
10080 arg
= fold (build_nop (TREE_TYPE (parm
), arg
));
10081 else if (uses_template_parms (tparm
))
10082 /* We haven't deduced the type of this parameter yet. Try again
10088 TREE_VEC_ELT (targs
, idx
) = arg
;
10093 /* A pointer-to-member constant can be unified only with
10094 another constant. */
10095 if (TREE_CODE (arg
) != PTRMEM_CST
)
10098 /* Just unify the class member. It would be useless (and possibly
10099 wrong, depending on the strict flags) to unify also
10100 PTRMEM_CST_CLASS, because we want to be sure that both parm and
10101 arg refer to the same variable, even if through different
10102 classes. For instance:
10104 struct A { int x; };
10107 Unification of &A::x and &B::x must succeed. */
10108 return unify (tparms
, targs
, PTRMEM_CST_MEMBER (parm
),
10109 PTRMEM_CST_MEMBER (arg
), strict
);
10114 if (TREE_CODE (arg
) != POINTER_TYPE
)
10117 /* [temp.deduct.call]
10119 A can be another pointer or pointer to member type that can
10120 be converted to the deduced A via a qualification
10121 conversion (_conv.qual_).
10123 We pass down STRICT here rather than UNIFY_ALLOW_NONE.
10124 This will allow for additional cv-qualification of the
10125 pointed-to types if appropriate. */
10127 if (TREE_CODE (TREE_TYPE (arg
)) == RECORD_TYPE
)
10128 /* The derived-to-base conversion only persists through one
10129 level of pointers. */
10130 strict
|= (strict_in
& UNIFY_ALLOW_DERIVED
);
10132 return unify (tparms
, targs
, TREE_TYPE (parm
),
10133 TREE_TYPE (arg
), strict
);
10136 case REFERENCE_TYPE
:
10137 if (TREE_CODE (arg
) != REFERENCE_TYPE
)
10139 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
10140 strict
& UNIFY_ALLOW_MORE_CV_QUAL
);
10143 if (TREE_CODE (arg
) != ARRAY_TYPE
)
10145 if ((TYPE_DOMAIN (parm
) == NULL_TREE
)
10146 != (TYPE_DOMAIN (arg
) == NULL_TREE
))
10148 if (TYPE_DOMAIN (parm
) != NULL_TREE
)
10153 parm_max
= TYPE_MAX_VALUE (TYPE_DOMAIN (parm
));
10154 arg_max
= TYPE_MAX_VALUE (TYPE_DOMAIN (arg
));
10156 /* Our representation of array types uses "N - 1" as the
10157 TYPE_MAX_VALUE for an array with "N" elements, if "N" is
10158 not an integer constant. */
10159 if (TREE_CODE (parm_max
) == MINUS_EXPR
)
10161 arg_max
= fold_build2 (PLUS_EXPR
,
10164 TREE_OPERAND (parm_max
, 1));
10165 parm_max
= TREE_OPERAND (parm_max
, 0);
10168 if (unify (tparms
, targs
, parm_max
, arg_max
, UNIFY_ALLOW_INTEGER
))
10171 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
10172 strict
& UNIFY_ALLOW_MORE_CV_QUAL
);
10179 case ENUMERAL_TYPE
:
10181 if (TREE_CODE (arg
) != TREE_CODE (parm
))
10184 /* We have already checked cv-qualification at the top of the
10186 if (!same_type_ignoring_top_level_qualifiers_p (arg
, parm
))
10189 /* As far as unification is concerned, this wins. Later checks
10190 will invalidate it if necessary. */
10193 /* Types INTEGER_CST and MINUS_EXPR can come from array bounds. */
10194 /* Type INTEGER_CST can come from ordinary constant template args. */
10196 while (TREE_CODE (arg
) == NOP_EXPR
)
10197 arg
= TREE_OPERAND (arg
, 0);
10199 if (TREE_CODE (arg
) != INTEGER_CST
)
10201 return !tree_int_cst_equal (parm
, arg
);
10206 if (TREE_CODE (arg
) != TREE_VEC
)
10208 if (TREE_VEC_LENGTH (parm
) != TREE_VEC_LENGTH (arg
))
10210 for (i
= 0; i
< TREE_VEC_LENGTH (parm
); ++i
)
10211 if (unify (tparms
, targs
,
10212 TREE_VEC_ELT (parm
, i
), TREE_VEC_ELT (arg
, i
),
10220 if (TREE_CODE (arg
) != TREE_CODE (parm
))
10223 if (TYPE_PTRMEMFUNC_P (parm
))
10225 if (!TYPE_PTRMEMFUNC_P (arg
))
10228 return unify (tparms
, targs
,
10229 TYPE_PTRMEMFUNC_FN_TYPE (parm
),
10230 TYPE_PTRMEMFUNC_FN_TYPE (arg
),
10234 if (CLASSTYPE_TEMPLATE_INFO (parm
))
10236 tree t
= NULL_TREE
;
10238 if (strict_in
& UNIFY_ALLOW_DERIVED
)
10240 /* First, we try to unify the PARM and ARG directly. */
10241 t
= try_class_unification (tparms
, targs
,
10246 /* Fallback to the special case allowed in
10247 [temp.deduct.call]:
10249 If P is a class, and P has the form
10250 template-id, then A can be a derived class of
10251 the deduced A. Likewise, if P is a pointer to
10252 a class of the form template-id, A can be a
10253 pointer to a derived class pointed to by the
10255 t
= get_template_base (tparms
, targs
, parm
, arg
);
10261 else if (CLASSTYPE_TEMPLATE_INFO (arg
)
10262 && (CLASSTYPE_TI_TEMPLATE (parm
)
10263 == CLASSTYPE_TI_TEMPLATE (arg
)))
10264 /* Perhaps PARM is something like S<U> and ARG is S<int>.
10265 Then, we should unify `int' and `U'. */
10268 /* There's no chance of unification succeeding. */
10271 return unify (tparms
, targs
, CLASSTYPE_TI_ARGS (parm
),
10272 CLASSTYPE_TI_ARGS (t
), UNIFY_ALLOW_NONE
);
10274 else if (!same_type_ignoring_top_level_qualifiers_p (parm
, arg
))
10279 case FUNCTION_TYPE
:
10280 if (TREE_CODE (arg
) != TREE_CODE (parm
))
10283 if (unify (tparms
, targs
, TREE_TYPE (parm
),
10284 TREE_TYPE (arg
), UNIFY_ALLOW_NONE
))
10286 return type_unification_real (tparms
, targs
, TYPE_ARG_TYPES (parm
),
10287 TYPE_ARG_TYPES (arg
), 1,
10288 DEDUCE_EXACT
, 0, -1);
10291 /* Unify a pointer to member with a pointer to member function, which
10292 deduces the type of the member as a function type. */
10293 if (TYPE_PTRMEMFUNC_P (arg
))
10297 cp_cv_quals cv_quals
;
10299 /* Check top-level cv qualifiers */
10300 if (!check_cv_quals_for_unify (UNIFY_ALLOW_NONE
, arg
, parm
))
10303 if (unify (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
10304 TYPE_PTRMEMFUNC_OBJECT_TYPE (arg
), UNIFY_ALLOW_NONE
))
10307 /* Determine the type of the function we are unifying against. */
10308 method_type
= TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (arg
));
10310 build_function_type (TREE_TYPE (method_type
),
10311 TREE_CHAIN (TYPE_ARG_TYPES (method_type
)));
10313 /* Extract the cv-qualifiers of the member function from the
10314 implicit object parameter and place them on the function
10315 type to be restored later. */
10317 cp_type_quals(TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (method_type
))));
10318 fntype
= build_qualified_type (fntype
, cv_quals
);
10319 return unify (tparms
, targs
, TREE_TYPE (parm
), fntype
, strict
);
10322 if (TREE_CODE (arg
) != OFFSET_TYPE
)
10324 if (unify (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
10325 TYPE_OFFSET_BASETYPE (arg
), UNIFY_ALLOW_NONE
))
10327 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
10331 if (DECL_TEMPLATE_PARM_P (parm
))
10332 return unify (tparms
, targs
, DECL_INITIAL (parm
), arg
, strict
);
10333 if (arg
!= integral_constant_value (parm
))
10338 case TEMPLATE_DECL
:
10339 /* Matched cases are handled by the ARG == PARM test above. */
10343 gcc_assert (EXPR_P (parm
));
10345 /* We must be looking at an expression. This can happen with
10349 void foo(S<I>, S<I + 2>);
10351 This is a "nondeduced context":
10355 The nondeduced contexts are:
10357 --A type that is a template-id in which one or more of
10358 the template-arguments is an expression that references
10359 a template-parameter.
10361 In these cases, we assume deduction succeeded, but don't
10362 actually infer any unifications. */
10364 if (!uses_template_parms (parm
)
10365 && !template_args_equal (parm
, arg
))
10372 /* Note that DECL can be defined in this translation unit, if
10376 mark_definable (tree decl
)
10379 DECL_NOT_REALLY_EXTERN (decl
) = 1;
10380 FOR_EACH_CLONE (clone
, decl
)
10381 DECL_NOT_REALLY_EXTERN (clone
) = 1;
10384 /* Called if RESULT is explicitly instantiated, or is a member of an
10385 explicitly instantiated class. */
10388 mark_decl_instantiated (tree result
, int extern_p
)
10390 SET_DECL_EXPLICIT_INSTANTIATION (result
);
10392 /* If this entity has already been written out, it's too late to
10393 make any modifications. */
10394 if (TREE_ASM_WRITTEN (result
))
10397 if (TREE_CODE (result
) != FUNCTION_DECL
)
10398 /* The TREE_PUBLIC flag for function declarations will have been
10399 set correctly by tsubst. */
10400 TREE_PUBLIC (result
) = 1;
10402 /* This might have been set by an earlier implicit instantiation. */
10403 DECL_COMDAT (result
) = 0;
10406 DECL_NOT_REALLY_EXTERN (result
) = 0;
10409 mark_definable (result
);
10410 /* Always make artificials weak. */
10411 if (DECL_ARTIFICIAL (result
) && flag_weak
)
10412 comdat_linkage (result
);
10413 /* For WIN32 we also want to put explicit instantiations in
10414 linkonce sections. */
10415 else if (TREE_PUBLIC (result
))
10416 maybe_make_one_only (result
);
10419 /* If EXTERN_P, then this function will not be emitted -- unless
10420 followed by an explicit instantiation, at which point its linkage
10421 will be adjusted. If !EXTERN_P, then this function will be
10422 emitted here. In neither circumstance do we want
10423 import_export_decl to adjust the linkage. */
10424 DECL_INTERFACE_KNOWN (result
) = 1;
10427 /* Given two function templates PAT1 and PAT2, return:
10429 DEDUCE should be DEDUCE_EXACT or DEDUCE_ORDER.
10431 1 if PAT1 is more specialized than PAT2 as described in [temp.func.order].
10432 -1 if PAT2 is more specialized than PAT1.
10433 0 if neither is more specialized.
10435 LEN is passed through to fn_type_unification. */
10438 more_specialized (tree pat1
, tree pat2
, int deduce
, int len
)
10443 /* If template argument deduction succeeds, we substitute the
10444 resulting arguments into non-deduced contexts. While doing that,
10445 we must be aware that we may encounter dependent types. */
10446 ++processing_template_decl
;
10447 targs
= get_bindings_real (pat1
, DECL_TEMPLATE_RESULT (pat2
),
10448 NULL_TREE
, 0, deduce
, len
);
10452 targs
= get_bindings_real (pat2
, DECL_TEMPLATE_RESULT (pat1
),
10453 NULL_TREE
, 0, deduce
, len
);
10456 --processing_template_decl
;
10461 /* Given two class template specialization list nodes PAT1 and PAT2, return:
10463 1 if PAT1 is more specialized than PAT2 as described in [temp.class.order].
10464 -1 if PAT2 is more specialized than PAT1.
10465 0 if neither is more specialized.
10467 FULL_ARGS is the full set of template arguments that triggers this
10468 partial ordering. */
10471 more_specialized_class (tree pat1
, tree pat2
, tree full_args
)
10476 /* Just like what happens for functions, if we are ordering between
10477 different class template specializations, we may encounter dependent
10478 types in the arguments, and we need our dependency check functions
10479 to behave correctly. */
10480 ++processing_template_decl
;
10481 targs
= get_class_bindings (TREE_VALUE (pat1
), TREE_PURPOSE (pat1
),
10482 add_outermost_template_args (full_args
, TREE_PURPOSE (pat2
)));
10486 targs
= get_class_bindings (TREE_VALUE (pat2
), TREE_PURPOSE (pat2
),
10487 add_outermost_template_args (full_args
, TREE_PURPOSE (pat1
)));
10490 --processing_template_decl
;
10495 /* Return the template arguments that will produce the function signature
10496 DECL from the function template FN, with the explicit template
10497 arguments EXPLICIT_ARGS. If CHECK_RETTYPE is 1, the return type must
10498 also match. Return NULL_TREE if no satisfactory arguments could be
10499 found. DEDUCE and LEN are passed through to fn_type_unification. */
10502 get_bindings_real (tree fn
,
10504 tree explicit_args
,
10509 int ntparms
= DECL_NTPARMS (fn
);
10510 tree targs
= make_tree_vec (ntparms
);
10512 tree decl_arg_types
;
10515 /* Substitute the explicit template arguments into the type of DECL.
10516 The call to fn_type_unification will handle substitution into the
10518 decl_type
= TREE_TYPE (decl
);
10519 if (explicit_args
&& uses_template_parms (decl_type
))
10522 tree converted_args
;
10524 if (DECL_TEMPLATE_INFO (decl
))
10525 tmpl
= DECL_TI_TEMPLATE (decl
);
10527 /* We can get here for some invalid specializations. */
10531 = (coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
10532 explicit_args
, NULL_TREE
,
10533 tf_none
, /*require_all_arguments=*/0));
10534 if (converted_args
== error_mark_node
)
10537 decl_type
= tsubst (decl_type
, converted_args
, tf_none
, NULL_TREE
);
10538 if (decl_type
== error_mark_node
)
10542 decl_arg_types
= TYPE_ARG_TYPES (decl_type
);
10543 /* Never do unification on the 'this' parameter. */
10544 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
10545 decl_arg_types
= TREE_CHAIN (decl_arg_types
);
10547 i
= fn_type_unification (fn
, explicit_args
, targs
,
10549 (check_rettype
|| DECL_CONV_FN_P (fn
)
10550 ? TREE_TYPE (decl_type
) : NULL_TREE
),
10559 /* For most uses, we want to check the return type. */
10562 get_bindings (tree fn
, tree decl
, tree explicit_args
)
10564 return get_bindings_real (fn
, decl
, explicit_args
, 1, DEDUCE_EXACT
, -1);
10567 /* But for resolve_overloaded_unification, we only care about the parameter
10571 get_bindings_overload (tree fn
, tree decl
, tree explicit_args
)
10573 return get_bindings_real (fn
, decl
, explicit_args
, 0, DEDUCE_EXACT
, -1);
10576 /* Return the innermost template arguments that, when applied to a
10577 template specialization whose innermost template parameters are
10578 TPARMS, and whose specialization arguments are PARMS, yield the
10581 For example, suppose we have:
10583 template <class T, class U> struct S {};
10584 template <class T> struct S<T*, int> {};
10586 Then, suppose we want to get `S<double*, int>'. The TPARMS will be
10587 {T}, the PARMS will be {T*, int} and the ARGS will be {double*,
10588 int}. The resulting vector will be {double}, indicating that `T'
10589 is bound to `double'. */
10592 get_class_bindings (tree tparms
, tree parms
, tree args
)
10594 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
10595 tree vec
= make_tree_vec (ntparms
);
10597 if (unify (tparms
, vec
, parms
, INNERMOST_TEMPLATE_ARGS (args
),
10601 for (i
= 0; i
< ntparms
; ++i
)
10602 if (! TREE_VEC_ELT (vec
, i
))
10605 if (verify_class_unification (vec
, parms
, args
))
10611 /* In INSTANTIATIONS is a list of <INSTANTIATION, TEMPLATE> pairs.
10612 Pick the most specialized template, and return the corresponding
10613 instantiation, or if there is no corresponding instantiation, the
10614 template itself. If there is no most specialized template,
10615 error_mark_node is returned. If there are no templates at all,
10616 NULL_TREE is returned. */
10619 most_specialized_instantiation (tree instantiations
)
10624 if (!instantiations
)
10627 champ
= instantiations
;
10628 for (fn
= TREE_CHAIN (instantiations
); fn
; fn
= TREE_CHAIN (fn
))
10630 fate
= more_specialized (TREE_VALUE (champ
), TREE_VALUE (fn
),
10638 fn
= TREE_CHAIN (fn
);
10640 return error_mark_node
;
10646 for (fn
= instantiations
; fn
&& fn
!= champ
; fn
= TREE_CHAIN (fn
))
10648 fate
= more_specialized (TREE_VALUE (champ
), TREE_VALUE (fn
),
10651 return error_mark_node
;
10654 return TREE_PURPOSE (champ
) ? TREE_PURPOSE (champ
) : TREE_VALUE (champ
);
10657 /* Return the most specialized of the list of templates in FNS that can
10658 produce an instantiation matching DECL, given the explicit template
10659 arguments EXPLICIT_ARGS. */
10662 most_specialized (tree fns
, tree decl
, tree explicit_args
)
10664 tree candidates
= NULL_TREE
;
10667 for (fn
= fns
; fn
; fn
= TREE_CHAIN (fn
))
10669 tree candidate
= TREE_VALUE (fn
);
10671 args
= get_bindings (candidate
, decl
, explicit_args
);
10673 candidates
= tree_cons (NULL_TREE
, candidate
, candidates
);
10676 return most_specialized_instantiation (candidates
);
10679 /* If DECL is a specialization of some template, return the most
10680 general such template. Otherwise, returns NULL_TREE.
10682 For example, given:
10684 template <class T> struct S { template <class U> void f(U); };
10686 if TMPL is `template <class U> void S<int>::f(U)' this will return
10687 the full template. This function will not trace past partial
10688 specializations, however. For example, given in addition:
10690 template <class T> struct S<T*> { template <class U> void f(U); };
10692 if TMPL is `template <class U> void S<int*>::f(U)' this will return
10693 `template <class T> template <class U> S<T*>::f(U)'. */
10696 most_general_template (tree decl
)
10698 /* If DECL is a FUNCTION_DECL, find the TEMPLATE_DECL of which it is
10699 an immediate specialization. */
10700 if (TREE_CODE (decl
) == FUNCTION_DECL
)
10702 if (DECL_TEMPLATE_INFO (decl
)) {
10703 decl
= DECL_TI_TEMPLATE (decl
);
10705 /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE for a
10706 template friend. */
10707 if (TREE_CODE (decl
) != TEMPLATE_DECL
)
10713 /* Look for more and more general templates. */
10714 while (DECL_TEMPLATE_INFO (decl
))
10716 /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE in some cases.
10717 (See cp-tree.h for details.) */
10718 if (TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
10721 if (CLASS_TYPE_P (TREE_TYPE (decl
))
10722 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl
)))
10725 /* Stop if we run into an explicitly specialized class template. */
10726 if (!DECL_NAMESPACE_SCOPE_P (decl
)
10727 && DECL_CONTEXT (decl
)
10728 && CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (decl
)))
10731 decl
= DECL_TI_TEMPLATE (decl
);
10737 /* Return the most specialized of the class template specializations
10738 of TMPL which can produce an instantiation matching ARGS, or
10739 error_mark_node if the choice is ambiguous. */
10742 most_specialized_class (tree tmpl
, tree args
)
10744 tree list
= NULL_TREE
;
10749 tmpl
= most_general_template (tmpl
);
10750 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
); t
; t
= TREE_CHAIN (t
))
10753 = get_class_bindings (TREE_VALUE (t
), TREE_PURPOSE (t
), args
);
10756 list
= tree_cons (TREE_PURPOSE (t
), TREE_VALUE (t
), list
);
10757 TREE_TYPE (list
) = TREE_TYPE (t
);
10766 t
= TREE_CHAIN (t
);
10767 for (; t
; t
= TREE_CHAIN (t
))
10769 fate
= more_specialized_class (champ
, t
, args
);
10776 t
= TREE_CHAIN (t
);
10778 return error_mark_node
;
10784 for (t
= list
; t
&& t
!= champ
; t
= TREE_CHAIN (t
))
10786 fate
= more_specialized_class (champ
, t
, args
);
10788 return error_mark_node
;
10794 /* Explicitly instantiate DECL. */
10797 do_decl_instantiation (tree decl
, tree storage
)
10799 tree result
= NULL_TREE
;
10803 /* An error occurred, for which grokdeclarator has already issued
10804 an appropriate message. */
10806 else if (! DECL_LANG_SPECIFIC (decl
))
10808 error ("explicit instantiation of non-template %q#D", decl
);
10811 else if (TREE_CODE (decl
) == VAR_DECL
)
10813 /* There is an asymmetry here in the way VAR_DECLs and
10814 FUNCTION_DECLs are handled by grokdeclarator. In the case of
10815 the latter, the DECL we get back will be marked as a
10816 template instantiation, and the appropriate
10817 DECL_TEMPLATE_INFO will be set up. This does not happen for
10818 VAR_DECLs so we do the lookup here. Probably, grokdeclarator
10819 should handle VAR_DECLs as it currently handles
10821 result
= lookup_field (DECL_CONTEXT (decl
), DECL_NAME (decl
), 0, false);
10822 if (!result
|| TREE_CODE (result
) != VAR_DECL
)
10824 error ("no matching template for %qD found", decl
);
10828 else if (TREE_CODE (decl
) != FUNCTION_DECL
)
10830 error ("explicit instantiation of %q#D", decl
);
10836 /* Check for various error cases. Note that if the explicit
10837 instantiation is valid the RESULT will currently be marked as an
10838 *implicit* instantiation; DECL_EXPLICIT_INSTANTIATION is not set
10839 until we get here. */
10841 if (DECL_TEMPLATE_SPECIALIZATION (result
))
10843 /* DR 259 [temp.spec].
10845 Both an explicit instantiation and a declaration of an explicit
10846 specialization shall not appear in a program unless the explicit
10847 instantiation follows a declaration of the explicit specialization.
10849 For a given set of template parameters, if an explicit
10850 instantiation of a template appears after a declaration of an
10851 explicit specialization for that template, the explicit
10852 instantiation has no effect. */
10855 else if (DECL_EXPLICIT_INSTANTIATION (result
))
10859 No program shall explicitly instantiate any template more
10862 We check DECL_NOT_REALLY_EXTERN so as not to complain when
10863 the first instantiation was `extern' and the second is not,
10864 and EXTERN_P for the opposite case. */
10865 if (DECL_NOT_REALLY_EXTERN (result
) && !extern_p
)
10866 pedwarn ("duplicate explicit instantiation of %q#D", result
);
10867 /* If an "extern" explicit instantiation follows an ordinary
10868 explicit instantiation, the template is instantiated. */
10872 else if (!DECL_IMPLICIT_INSTANTIATION (result
))
10874 error ("no matching template for %qD found", result
);
10877 else if (!DECL_TEMPLATE_INFO (result
))
10879 pedwarn ("explicit instantiation of non-template %q#D", result
);
10883 if (storage
== NULL_TREE
)
10885 else if (storage
== ridpointers
[(int) RID_EXTERN
])
10887 if (pedantic
&& !in_system_header
)
10888 pedwarn ("ISO C++ forbids the use of %<extern%> on explicit "
10893 error ("storage class %qD applied to template instantiation", storage
);
10895 mark_decl_instantiated (result
, extern_p
);
10897 instantiate_decl (result
, /*defer_ok=*/1, /*undefined_ok=*/0);
10901 mark_class_instantiated (tree t
, int extern_p
)
10903 SET_CLASSTYPE_EXPLICIT_INSTANTIATION (t
);
10904 SET_CLASSTYPE_INTERFACE_KNOWN (t
);
10905 CLASSTYPE_INTERFACE_ONLY (t
) = extern_p
;
10906 TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (t
)) = extern_p
;
10909 CLASSTYPE_DEBUG_REQUESTED (t
) = 1;
10910 rest_of_type_compilation (t
, 1);
10914 /* Called from do_type_instantiation through binding_table_foreach to
10915 do recursive instantiation for the type bound in ENTRY. */
10917 bt_instantiate_type_proc (binding_entry entry
, void *data
)
10919 tree storage
= *(tree
*) data
;
10921 if (IS_AGGR_TYPE (entry
->type
)
10922 && !uses_template_parms (CLASSTYPE_TI_ARGS (entry
->type
)))
10923 do_type_instantiation (TYPE_MAIN_DECL (entry
->type
), storage
, 0);
10926 /* Called from do_type_instantiation to instantiate a member
10927 (a member function or a static member variable) of an
10928 explicitly instantiated class template. */
10930 instantiate_class_member (tree decl
, int extern_p
)
10932 mark_decl_instantiated (decl
, extern_p
);
10934 instantiate_decl (decl
, /*defer_ok=*/1, /* undefined_ok=*/1);
10937 /* Perform an explicit instantiation of template class T. STORAGE, if
10938 non-null, is the RID for extern, inline or static. COMPLAIN is
10939 nonzero if this is called from the parser, zero if called recursively,
10940 since the standard is unclear (as detailed below). */
10943 do_type_instantiation (tree t
, tree storage
, tsubst_flags_t complain
)
10948 int previous_instantiation_extern_p
= 0;
10950 if (TREE_CODE (t
) == TYPE_DECL
)
10953 if (! CLASS_TYPE_P (t
) || ! CLASSTYPE_TEMPLATE_INFO (t
))
10955 error ("explicit instantiation of non-template type %qT", t
);
10961 if (!COMPLETE_TYPE_P (t
))
10963 if (complain
& tf_error
)
10964 error ("explicit instantiation of %q#T before definition of template",
10969 if (storage
!= NULL_TREE
)
10971 if (pedantic
&& !in_system_header
)
10972 pedwarn("ISO C++ forbids the use of %qE on explicit instantiations",
10975 if (storage
== ridpointers
[(int) RID_INLINE
])
10977 else if (storage
== ridpointers
[(int) RID_EXTERN
])
10979 else if (storage
== ridpointers
[(int) RID_STATIC
])
10983 error ("storage class %qD applied to template instantiation",
10989 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
10991 /* DR 259 [temp.spec].
10993 Both an explicit instantiation and a declaration of an explicit
10994 specialization shall not appear in a program unless the explicit
10995 instantiation follows a declaration of the explicit specialization.
10997 For a given set of template parameters, if an explicit
10998 instantiation of a template appears after a declaration of an
10999 explicit specialization for that template, the explicit
11000 instantiation has no effect. */
11003 else if (CLASSTYPE_EXPLICIT_INSTANTIATION (t
))
11007 No program shall explicitly instantiate any template more
11010 If PREVIOUS_INSTANTIATION_EXTERN_P, then the first explicit
11011 instantiation was `extern'. If EXTERN_P then the second is.
11012 These cases are OK. */
11013 previous_instantiation_extern_p
= CLASSTYPE_INTERFACE_ONLY (t
);
11015 if (!previous_instantiation_extern_p
&& !extern_p
11016 && (complain
& tf_error
))
11017 pedwarn ("duplicate explicit instantiation of %q#T", t
);
11019 /* If we've already instantiated the template, just return now. */
11020 if (!CLASSTYPE_INTERFACE_ONLY (t
))
11024 mark_class_instantiated (t
, extern_p
);
11032 /* In contrast to implicit instantiation, where only the
11033 declarations, and not the definitions, of members are
11034 instantiated, we have here:
11038 The explicit instantiation of a class template specialization
11039 implies the instantiation of all of its members not
11040 previously explicitly specialized in the translation unit
11041 containing the explicit instantiation.
11043 Of course, we can't instantiate member template classes, since
11044 we don't have any arguments for them. Note that the standard
11045 is unclear on whether the instantiation of the members are
11046 *explicit* instantiations or not. However, the most natural
11047 interpretation is that it should be an explicit instantiation. */
11050 for (tmp
= TYPE_METHODS (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
11051 if (TREE_CODE (tmp
) == FUNCTION_DECL
11052 && DECL_TEMPLATE_INSTANTIATION (tmp
))
11053 instantiate_class_member (tmp
, extern_p
);
11055 for (tmp
= TYPE_FIELDS (t
); tmp
; tmp
= TREE_CHAIN (tmp
))
11056 if (TREE_CODE (tmp
) == VAR_DECL
&& DECL_TEMPLATE_INSTANTIATION (tmp
))
11057 instantiate_class_member (tmp
, extern_p
);
11059 if (CLASSTYPE_NESTED_UTDS (t
))
11060 binding_table_foreach (CLASSTYPE_NESTED_UTDS (t
),
11061 bt_instantiate_type_proc
, &storage
);
11065 /* Given a function DECL, which is a specialization of TMPL, modify
11066 DECL to be a re-instantiation of TMPL with the same template
11067 arguments. TMPL should be the template into which tsubst'ing
11068 should occur for DECL, not the most general template.
11070 One reason for doing this is a scenario like this:
11073 void f(const T&, int i);
11075 void g() { f(3, 7); }
11078 void f(const T& t, const int i) { }
11080 Note that when the template is first instantiated, with
11081 instantiate_template, the resulting DECL will have no name for the
11082 first parameter, and the wrong type for the second. So, when we go
11083 to instantiate the DECL, we regenerate it. */
11086 regenerate_decl_from_template (tree decl
, tree tmpl
)
11088 /* The arguments used to instantiate DECL, from the most general
11093 args
= DECL_TI_ARGS (decl
);
11094 code_pattern
= DECL_TEMPLATE_RESULT (tmpl
);
11096 /* Make sure that we can see identifiers, and compute access
11098 push_access_scope (decl
);
11100 if (TREE_CODE (decl
) == FUNCTION_DECL
)
11108 args_depth
= TMPL_ARGS_DEPTH (args
);
11109 parms_depth
= TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
));
11110 if (args_depth
> parms_depth
)
11111 args
= get_innermost_template_args (args
, parms_depth
);
11113 specs
= tsubst_exception_specification (TREE_TYPE (code_pattern
),
11114 args
, tf_error
, NULL_TREE
);
11116 TREE_TYPE (decl
) = build_exception_variant (TREE_TYPE (decl
),
11119 /* Merge parameter declarations. */
11120 decl_parm
= skip_artificial_parms_for (decl
,
11121 DECL_ARGUMENTS (decl
));
11123 = skip_artificial_parms_for (code_pattern
,
11124 DECL_ARGUMENTS (code_pattern
));
11129 if (DECL_NAME (decl_parm
) != DECL_NAME (pattern_parm
))
11130 DECL_NAME (decl_parm
) = DECL_NAME (pattern_parm
);
11131 parm_type
= tsubst (TREE_TYPE (pattern_parm
), args
, tf_error
,
11133 parm_type
= type_decays_to (parm_type
);
11134 if (!same_type_p (TREE_TYPE (decl_parm
), parm_type
))
11135 TREE_TYPE (decl_parm
) = parm_type
;
11136 decl_parm
= TREE_CHAIN (decl_parm
);
11137 pattern_parm
= TREE_CHAIN (pattern_parm
);
11140 /* Merge additional specifiers from the CODE_PATTERN. */
11141 if (DECL_DECLARED_INLINE_P (code_pattern
)
11142 && !DECL_DECLARED_INLINE_P (decl
))
11143 DECL_DECLARED_INLINE_P (decl
) = 1;
11144 if (DECL_INLINE (code_pattern
) && !DECL_INLINE (decl
))
11145 DECL_INLINE (decl
) = 1;
11147 else if (TREE_CODE (decl
) == VAR_DECL
)
11149 if (!DECL_INITIALIZED_IN_CLASS_P (decl
)
11150 && DECL_INITIAL (code_pattern
))
11151 DECL_INITIAL (decl
) =
11152 tsubst_expr (DECL_INITIAL (code_pattern
), args
,
11153 tf_error
, DECL_TI_TEMPLATE (decl
));
11156 gcc_unreachable ();
11158 pop_access_scope (decl
);
11161 /* Return the TEMPLATE_DECL into which DECL_TI_ARGS(DECL) should be
11162 substituted to get DECL. */
11165 template_for_substitution (tree decl
)
11167 tree tmpl
= DECL_TI_TEMPLATE (decl
);
11169 /* Set TMPL to the template whose DECL_TEMPLATE_RESULT is the pattern
11170 for the instantiation. This is not always the most general
11171 template. Consider, for example:
11174 struct S { template <class U> void f();
11175 template <> void f<int>(); };
11177 and an instantiation of S<double>::f<int>. We want TD to be the
11178 specialization S<T>::f<int>, not the more general S<T>::f<U>. */
11179 while (/* An instantiation cannot have a definition, so we need a
11180 more general template. */
11181 DECL_TEMPLATE_INSTANTIATION (tmpl
)
11182 /* We must also deal with friend templates. Given:
11184 template <class T> struct S {
11185 template <class U> friend void f() {};
11188 S<int>::f<U> say, is not an instantiation of S<T>::f<U>,
11189 so far as the language is concerned, but that's still
11190 where we get the pattern for the instantiation from. On
11191 other hand, if the definition comes outside the class, say:
11193 template <class T> struct S {
11194 template <class U> friend void f();
11196 template <class U> friend void f() {}
11198 we don't need to look any further. That's what the check for
11199 DECL_INITIAL is for. */
11200 || (TREE_CODE (decl
) == FUNCTION_DECL
11201 && DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (tmpl
)
11202 && !DECL_INITIAL (DECL_TEMPLATE_RESULT (tmpl
))))
11204 /* The present template, TD, should not be a definition. If it
11205 were a definition, we should be using it! Note that we
11206 cannot restructure the loop to just keep going until we find
11207 a template with a definition, since that might go too far if
11208 a specialization was declared, but not defined. */
11209 gcc_assert (TREE_CODE (decl
) != VAR_DECL
11210 || DECL_IN_AGGR_P (DECL_TEMPLATE_RESULT (tmpl
)));
11212 /* Fetch the more general template. */
11213 tmpl
= DECL_TI_TEMPLATE (tmpl
);
11219 /* Produce the definition of D, a _DECL generated from a template. If
11220 DEFER_OK is nonzero, then we don't have to actually do the
11221 instantiation now; we just have to do it sometime. Normally it is
11222 an error if this is an explicit instantiation but D is undefined.
11223 If UNDEFINED_OK is nonzero, then instead we treat it as an implicit
11224 instantiation. UNDEFINED_OK is nonzero only if we are being used
11225 to instantiate the members of an explicitly instantiated class
11230 instantiate_decl (tree d
, int defer_ok
, int undefined_ok
)
11232 tree tmpl
= DECL_TI_TEMPLATE (d
);
11239 int pattern_defined
;
11241 location_t saved_loc
= input_location
;
11243 /* This function should only be used to instantiate templates for
11244 functions and static member variables. */
11245 gcc_assert (TREE_CODE (d
) == FUNCTION_DECL
11246 || TREE_CODE (d
) == VAR_DECL
);
11248 /* Variables are never deferred; if instantiation is required, they
11249 are instantiated right away. That allows for better code in the
11250 case that an expression refers to the value of the variable --
11251 if the variable has a constant value the referring expression can
11252 take advantage of that fact. */
11253 if (TREE_CODE (d
) == VAR_DECL
)
11256 /* Don't instantiate cloned functions. Instead, instantiate the
11257 functions they cloned. */
11258 if (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_CLONED_FUNCTION_P (d
))
11259 d
= DECL_CLONED_FUNCTION (d
);
11261 if (DECL_TEMPLATE_INSTANTIATED (d
))
11262 /* D has already been instantiated. It might seem reasonable to
11263 check whether or not D is an explicit instantiation, and, if so,
11264 stop here. But when an explicit instantiation is deferred
11265 until the end of the compilation, DECL_EXPLICIT_INSTANTIATION
11266 is set, even though we still need to do the instantiation. */
11269 /* If we already have a specialization of this declaration, then
11270 there's no reason to instantiate it. Note that
11271 retrieve_specialization gives us both instantiations and
11272 specializations, so we must explicitly check
11273 DECL_TEMPLATE_SPECIALIZATION. */
11274 gen_tmpl
= most_general_template (tmpl
);
11275 gen_args
= DECL_TI_ARGS (d
);
11276 spec
= retrieve_specialization (gen_tmpl
, gen_args
,
11277 /*class_specializations_p=*/false);
11278 if (spec
!= NULL_TREE
&& DECL_TEMPLATE_SPECIALIZATION (spec
))
11281 /* This needs to happen before any tsubsting. */
11282 if (! push_tinst_level (d
))
11285 timevar_push (TV_PARSE
);
11287 /* We may be in the middle of deferred access check. Disable it now. */
11288 push_deferring_access_checks (dk_no_deferred
);
11290 /* Set TD to the template whose DECL_TEMPLATE_RESULT is the pattern
11291 for the instantiation. */
11292 td
= template_for_substitution (d
);
11293 code_pattern
= DECL_TEMPLATE_RESULT (td
);
11295 if ((DECL_NAMESPACE_SCOPE_P (d
) && !DECL_INITIALIZED_IN_CLASS_P (d
))
11296 || DECL_TEMPLATE_SPECIALIZATION (td
))
11297 /* In the case of a friend template whose definition is provided
11298 outside the class, we may have too many arguments. Drop the
11299 ones we don't need. The same is true for specializations. */
11300 args
= get_innermost_template_args
11301 (gen_args
, TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (td
)));
11305 if (TREE_CODE (d
) == FUNCTION_DECL
)
11306 pattern_defined
= (DECL_SAVED_TREE (code_pattern
) != NULL_TREE
);
11308 pattern_defined
= ! DECL_IN_AGGR_P (code_pattern
);
11309 /* Unless an explicit instantiation directive has already determined
11310 the linkage of D, remember that a definition is available for
11312 if (pattern_defined
11313 && !DECL_INTERFACE_KNOWN (d
)
11314 && !DECL_NOT_REALLY_EXTERN (d
))
11315 mark_definable (d
);
11317 input_location
= DECL_SOURCE_LOCATION (d
);
11319 if (! pattern_defined
&& DECL_EXPLICIT_INSTANTIATION (d
) && undefined_ok
)
11321 DECL_NOT_REALLY_EXTERN (d
) = 0;
11322 SET_DECL_IMPLICIT_INSTANTIATION (d
);
11327 /* Recheck the substitutions to obtain any warning messages
11328 about ignoring cv qualifiers. */
11329 tree gen
= DECL_TEMPLATE_RESULT (gen_tmpl
);
11330 tree type
= TREE_TYPE (gen
);
11332 /* Make sure that we can see identifiers, and compute access
11333 correctly. D is already the target FUNCTION_DECL with the
11335 push_access_scope (d
);
11337 if (TREE_CODE (gen
) == FUNCTION_DECL
)
11339 tsubst (DECL_ARGUMENTS (gen
), gen_args
, tf_error
| tf_warning
, d
);
11340 tsubst (TYPE_RAISES_EXCEPTIONS (type
), gen_args
,
11341 tf_error
| tf_warning
, d
);
11342 /* Don't simply tsubst the function type, as that will give
11343 duplicate warnings about poor parameter qualifications.
11344 The function arguments are the same as the decl_arguments
11345 without the top level cv qualifiers. */
11346 type
= TREE_TYPE (type
);
11348 tsubst (type
, gen_args
, tf_error
| tf_warning
, d
);
11350 pop_access_scope (d
);
11353 /* We should have set up DECL_INITIAL in instantiate_class_template
11354 for in-class definitions of static data members. */
11355 gcc_assert (!(TREE_CODE (d
) == VAR_DECL
11356 && DECL_INITIALIZED_IN_CLASS_P (d
)
11357 && DECL_INITIAL (d
) == NULL_TREE
));
11359 /* Do not instantiate templates that we know will be defined
11361 if (DECL_INTERFACE_KNOWN (d
)
11362 && DECL_REALLY_EXTERN (d
)
11363 && ! (TREE_CODE (d
) == FUNCTION_DECL
11364 && DECL_INLINE (d
)))
11366 /* Defer all other templates, unless we have been explicitly
11367 forbidden from doing so. We restore the source position here
11368 because it's used by add_pending_template. */
11369 else if (! pattern_defined
|| defer_ok
)
11371 input_location
= saved_loc
;
11373 if (at_eof
&& !pattern_defined
11374 && DECL_EXPLICIT_INSTANTIATION (d
))
11377 The definition of a non-exported function template, a
11378 non-exported member function template, or a non-exported
11379 member function or static data member of a class template
11380 shall be present in every translation unit in which it is
11381 explicitly instantiated. */
11383 ("explicit instantiation of %qD but no definition available", d
);
11385 add_pending_template (d
);
11388 /* Tell the repository that D is available in this translation unit
11389 -- and see if it is supposed to be instantiated here. */
11390 if (TREE_PUBLIC (d
) && !DECL_REALLY_EXTERN (d
) && !repo_emit_p (d
))
11392 /* In a PCH file, despite the fact that the repository hasn't
11393 requested instantiation in the PCH it is still possible that
11394 an instantiation will be required in a file that includes the
11397 add_pending_template (d
);
11398 /* Instantiate inline functions so that the inliner can do its
11399 job, even though we'll not be emitting a copy of this
11401 if (!(TREE_CODE (d
) == FUNCTION_DECL
11402 && flag_inline_trees
11403 && DECL_DECLARED_INLINE_P (d
)))
11407 need_push
= !cfun
|| !global_bindings_p ();
11409 push_to_top_level ();
11411 /* Mark D as instantiated so that recursive calls to
11412 instantiate_decl do not try to instantiate it again. */
11413 DECL_TEMPLATE_INSTANTIATED (d
) = 1;
11415 /* Regenerate the declaration in case the template has been modified
11416 by a subsequent redeclaration. */
11417 regenerate_decl_from_template (d
, td
);
11419 /* We already set the file and line above. Reset them now in case
11420 they changed as a result of calling regenerate_decl_from_template. */
11421 input_location
= DECL_SOURCE_LOCATION (d
);
11423 if (TREE_CODE (d
) == VAR_DECL
)
11425 /* Clear out DECL_RTL; whatever was there before may not be right
11426 since we've reset the type of the declaration. */
11427 SET_DECL_RTL (d
, NULL_RTX
);
11428 DECL_IN_AGGR_P (d
) = 0;
11430 /* Clear DECL_EXTERNAL so that cp_finish_decl will process the
11431 initializer. That function will defer actual emission until
11432 we have a chance to determine linkage. */
11433 DECL_EXTERNAL (d
) = 0;
11435 /* Enter the scope of D so that access-checking works correctly. */
11436 push_nested_class (DECL_CONTEXT (d
));
11438 (!DECL_INITIALIZED_IN_CLASS_P (d
)
11439 ? DECL_INITIAL (d
) : NULL_TREE
),
11441 pop_nested_class ();
11443 else if (TREE_CODE (d
) == FUNCTION_DECL
)
11445 htab_t saved_local_specializations
;
11450 /* Save away the current list, in case we are instantiating one
11451 template from within the body of another. */
11452 saved_local_specializations
= local_specializations
;
11454 /* Set up the list of local specializations. */
11455 local_specializations
= htab_create (37,
11456 hash_local_specialization
,
11457 eq_local_specializations
,
11460 /* Set up context. */
11461 start_preparsed_function (d
, NULL_TREE
, SF_PRE_PARSED
);
11463 /* Create substitution entries for the parameters. */
11464 subst_decl
= DECL_TEMPLATE_RESULT (template_for_substitution (d
));
11465 tmpl_parm
= DECL_ARGUMENTS (subst_decl
);
11466 spec_parm
= DECL_ARGUMENTS (d
);
11467 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (d
))
11469 register_local_specialization (spec_parm
, tmpl_parm
);
11470 spec_parm
= skip_artificial_parms_for (d
, spec_parm
);
11471 tmpl_parm
= skip_artificial_parms_for (subst_decl
, tmpl_parm
);
11475 register_local_specialization (spec_parm
, tmpl_parm
);
11476 tmpl_parm
= TREE_CHAIN (tmpl_parm
);
11477 spec_parm
= TREE_CHAIN (spec_parm
);
11479 gcc_assert (!spec_parm
);
11481 /* Substitute into the body of the function. */
11482 tsubst_expr (DECL_SAVED_TREE (code_pattern
), args
,
11483 tf_error
| tf_warning
, tmpl
);
11485 /* We don't need the local specializations any more. */
11486 htab_delete (local_specializations
);
11487 local_specializations
= saved_local_specializations
;
11489 /* Finish the function. */
11490 d
= finish_function (0);
11491 expand_or_defer_fn (d
);
11494 /* We're not deferring instantiation any more. */
11495 TI_PENDING_TEMPLATE_FLAG (DECL_TEMPLATE_INFO (d
)) = 0;
11498 pop_from_top_level ();
11501 input_location
= saved_loc
;
11502 pop_deferring_access_checks ();
11503 pop_tinst_level ();
11505 timevar_pop (TV_PARSE
);
11510 /* Run through the list of templates that we wish we could
11511 instantiate, and instantiate any we can. RETRIES is the
11512 number of times we retry pending template instantiation. */
11515 instantiate_pending_templates (int retries
)
11518 tree last
= NULL_TREE
;
11520 location_t saved_loc
= input_location
;
11522 /* Instantiating templates may trigger vtable generation. This in turn
11523 may require further template instantiations. We place a limit here
11524 to avoid infinite loop. */
11525 if (pending_templates
&& retries
>= max_tinst_depth
)
11527 cp_error_at ("template instantiation depth exceeds maximum of %d"
11528 " (use -ftemplate-depth-NN to increase the maximum)"
11529 " instantiating %q+D, possibly from virtual table"
11531 max_tinst_depth
, TREE_VALUE (pending_templates
));
11539 t
= &pending_templates
;
11542 tree instantiation
= TREE_VALUE (*t
);
11544 reopen_tinst_level (TREE_PURPOSE (*t
));
11546 if (TYPE_P (instantiation
))
11550 if (!COMPLETE_TYPE_P (instantiation
))
11552 instantiate_class_template (instantiation
);
11553 if (CLASSTYPE_TEMPLATE_INSTANTIATION (instantiation
))
11554 for (fn
= TYPE_METHODS (instantiation
);
11556 fn
= TREE_CHAIN (fn
))
11557 if (! DECL_ARTIFICIAL (fn
))
11558 instantiate_decl (fn
, /*defer_ok=*/0,
11559 /*undefined_ok=*/0);
11560 if (COMPLETE_TYPE_P (instantiation
))
11564 if (COMPLETE_TYPE_P (instantiation
))
11565 /* If INSTANTIATION has been instantiated, then we don't
11566 need to consider it again in the future. */
11567 *t
= TREE_CHAIN (*t
);
11571 t
= &TREE_CHAIN (*t
);
11576 if (!DECL_TEMPLATE_SPECIALIZATION (instantiation
)
11577 && !DECL_TEMPLATE_INSTANTIATED (instantiation
))
11579 instantiation
= instantiate_decl (instantiation
,
11581 /*undefined_ok=*/0);
11582 if (DECL_TEMPLATE_INSTANTIATED (instantiation
))
11586 if (DECL_TEMPLATE_SPECIALIZATION (instantiation
)
11587 || DECL_TEMPLATE_INSTANTIATED (instantiation
))
11588 /* If INSTANTIATION has been instantiated, then we don't
11589 need to consider it again in the future. */
11590 *t
= TREE_CHAIN (*t
);
11594 t
= &TREE_CHAIN (*t
);
11598 current_tinst_level
= NULL_TREE
;
11600 last_pending_template
= last
;
11602 while (reconsider
);
11604 input_location
= saved_loc
;
11607 /* Substitute ARGVEC into T, which is a list of initializers for
11608 either base class or a non-static data member. The TREE_PURPOSEs
11609 are DECLs, and the TREE_VALUEs are the initializer values. Used by
11610 instantiate_decl. */
11613 tsubst_initializer_list (tree t
, tree argvec
)
11615 tree inits
= NULL_TREE
;
11617 for (; t
; t
= TREE_CHAIN (t
))
11622 decl
= tsubst_copy (TREE_PURPOSE (t
), argvec
, tf_error
| tf_warning
,
11624 decl
= expand_member_init (decl
);
11625 if (decl
&& !DECL_P (decl
))
11626 in_base_initializer
= 1;
11628 init
= tsubst_expr (TREE_VALUE (t
), argvec
, tf_error
| tf_warning
,
11630 in_base_initializer
= 0;
11634 init
= build_tree_list (decl
, init
);
11635 TREE_CHAIN (init
) = inits
;
11642 /* Set CURRENT_ACCESS_SPECIFIER based on the protection of DECL. */
11645 set_current_access_from_decl (tree decl
)
11647 if (TREE_PRIVATE (decl
))
11648 current_access_specifier
= access_private_node
;
11649 else if (TREE_PROTECTED (decl
))
11650 current_access_specifier
= access_protected_node
;
11652 current_access_specifier
= access_public_node
;
11655 /* Instantiate an enumerated type. TAG is the template type, NEWTAG
11656 is the instantiation (which should have been created with
11657 start_enum) and ARGS are the template arguments to use. */
11660 tsubst_enum (tree tag
, tree newtag
, tree args
)
11664 for (e
= TYPE_VALUES (tag
); e
; e
= TREE_CHAIN (e
))
11669 decl
= TREE_VALUE (e
);
11670 /* Note that in a template enum, the TREE_VALUE is the
11671 CONST_DECL, not the corresponding INTEGER_CST. */
11672 value
= tsubst_expr (DECL_INITIAL (decl
),
11673 args
, tf_error
| tf_warning
,
11676 /* Give this enumeration constant the correct access. */
11677 set_current_access_from_decl (decl
);
11679 /* Actually build the enumerator itself. */
11680 build_enumerator (DECL_NAME (decl
), value
, newtag
);
11683 finish_enum (newtag
);
11684 DECL_SOURCE_LOCATION (TYPE_NAME (newtag
))
11685 = DECL_SOURCE_LOCATION (TYPE_NAME (tag
));
11688 /* DECL is a FUNCTION_DECL that is a template specialization. Return
11689 its type -- but without substituting the innermost set of template
11690 arguments. So, innermost set of template parameters will appear in
11694 get_mostly_instantiated_function_type (tree decl
)
11702 tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
11703 targs
= DECL_TI_ARGS (decl
);
11704 tparms
= DECL_TEMPLATE_PARMS (tmpl
);
11705 parm_depth
= TMPL_PARMS_DEPTH (tparms
);
11707 /* There should be as many levels of arguments as there are levels
11709 gcc_assert (parm_depth
== TMPL_ARGS_DEPTH (targs
));
11711 fn_type
= TREE_TYPE (tmpl
);
11713 if (parm_depth
== 1)
11714 /* No substitution is necessary. */
11718 int i
, save_access_control
;
11721 /* Replace the innermost level of the TARGS with NULL_TREEs to
11722 let tsubst know not to substitute for those parameters. */
11723 partial_args
= make_tree_vec (TREE_VEC_LENGTH (targs
));
11724 for (i
= 1; i
< TMPL_ARGS_DEPTH (targs
); ++i
)
11725 SET_TMPL_ARGS_LEVEL (partial_args
, i
,
11726 TMPL_ARGS_LEVEL (targs
, i
));
11727 SET_TMPL_ARGS_LEVEL (partial_args
,
11728 TMPL_ARGS_DEPTH (targs
),
11729 make_tree_vec (DECL_NTPARMS (tmpl
)));
11731 /* Disable access control as this function is used only during
11733 save_access_control
= flag_access_control
;
11734 flag_access_control
= 0;
11736 ++processing_template_decl
;
11737 /* Now, do the (partial) substitution to figure out the
11738 appropriate function type. */
11739 fn_type
= tsubst (fn_type
, partial_args
, tf_error
, NULL_TREE
);
11740 --processing_template_decl
;
11742 /* Substitute into the template parameters to obtain the real
11743 innermost set of parameters. This step is important if the
11744 innermost set of template parameters contains value
11745 parameters whose types depend on outer template parameters. */
11746 TREE_VEC_LENGTH (partial_args
)--;
11747 tparms
= tsubst_template_parms (tparms
, partial_args
, tf_error
);
11749 flag_access_control
= save_access_control
;
11755 /* Return truthvalue if we're processing a template different from
11756 the last one involved in diagnostics. */
11758 problematic_instantiation_changed (void)
11760 return last_template_error_tick
!= tinst_level_tick
;
11763 /* Remember current template involved in diagnostics. */
11765 record_last_problematic_instantiation (void)
11767 last_template_error_tick
= tinst_level_tick
;
11771 current_instantiation (void)
11773 return current_tinst_level
;
11776 /* [temp.param] Check that template non-type parm TYPE is of an allowable
11777 type. Return zero for ok, nonzero for disallowed. Issue error and
11778 warning messages under control of COMPLAIN. */
11781 invalid_nontype_parm_type_p (tree type
, tsubst_flags_t complain
)
11783 if (INTEGRAL_TYPE_P (type
))
11785 else if (POINTER_TYPE_P (type
))
11787 else if (TYPE_PTR_TO_MEMBER_P (type
))
11789 else if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
)
11791 else if (TREE_CODE (type
) == TYPENAME_TYPE
)
11794 if (complain
& tf_error
)
11795 error ("%q#T is not a valid type for a template constant parameter", type
);
11799 /* Returns TRUE if TYPE is dependent, in the sense of [temp.dep.type].
11800 Assumes that TYPE really is a type, and not the ERROR_MARK_NODE.*/
11803 dependent_type_p_r (tree type
)
11809 A type is dependent if it is:
11811 -- a template parameter. Template template parameters are types
11812 for us (since TYPE_P holds true for them) so we handle
11814 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
11815 || TREE_CODE (type
) == TEMPLATE_TEMPLATE_PARM
)
11817 /* -- a qualified-id with a nested-name-specifier which contains a
11818 class-name that names a dependent type or whose unqualified-id
11819 names a dependent type. */
11820 if (TREE_CODE (type
) == TYPENAME_TYPE
)
11822 /* -- a cv-qualified type where the cv-unqualified type is
11824 type
= TYPE_MAIN_VARIANT (type
);
11825 /* -- a compound type constructed from any dependent type. */
11826 if (TYPE_PTR_TO_MEMBER_P (type
))
11827 return (dependent_type_p (TYPE_PTRMEM_CLASS_TYPE (type
))
11828 || dependent_type_p (TYPE_PTRMEM_POINTED_TO_TYPE
11830 else if (TREE_CODE (type
) == POINTER_TYPE
11831 || TREE_CODE (type
) == REFERENCE_TYPE
)
11832 return dependent_type_p (TREE_TYPE (type
));
11833 else if (TREE_CODE (type
) == FUNCTION_TYPE
11834 || TREE_CODE (type
) == METHOD_TYPE
)
11838 if (dependent_type_p (TREE_TYPE (type
)))
11840 for (arg_type
= TYPE_ARG_TYPES (type
);
11842 arg_type
= TREE_CHAIN (arg_type
))
11843 if (dependent_type_p (TREE_VALUE (arg_type
)))
11847 /* -- an array type constructed from any dependent type or whose
11848 size is specified by a constant expression that is
11849 value-dependent. */
11850 if (TREE_CODE (type
) == ARRAY_TYPE
)
11852 if (TYPE_DOMAIN (type
)
11853 && ((value_dependent_expression_p
11854 (TYPE_MAX_VALUE (TYPE_DOMAIN (type
))))
11855 || (type_dependent_expression_p
11856 (TYPE_MAX_VALUE (TYPE_DOMAIN (type
))))))
11858 return dependent_type_p (TREE_TYPE (type
));
11861 /* -- a template-id in which either the template name is a template
11863 if (TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
11865 /* ... or any of the template arguments is a dependent type or
11866 an expression that is type-dependent or value-dependent. */
11867 else if (CLASS_TYPE_P (type
) && CLASSTYPE_TEMPLATE_INFO (type
)
11868 && (any_dependent_template_arguments_p
11869 (INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type
)))))
11872 /* All TYPEOF_TYPEs are dependent; if the argument of the `typeof'
11873 expression is not type-dependent, then it should already been
11875 if (TREE_CODE (type
) == TYPEOF_TYPE
)
11878 /* The standard does not specifically mention types that are local
11879 to template functions or local classes, but they should be
11880 considered dependent too. For example:
11882 template <int I> void f() {
11887 The size of `E' cannot be known until the value of `I' has been
11888 determined. Therefore, `E' must be considered dependent. */
11889 scope
= TYPE_CONTEXT (type
);
11890 if (scope
&& TYPE_P (scope
))
11891 return dependent_type_p (scope
);
11892 else if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
)
11893 return type_dependent_expression_p (scope
);
11895 /* Other types are non-dependent. */
11899 /* Returns TRUE if TYPE is dependent, in the sense of
11900 [temp.dep.type]. */
11903 dependent_type_p (tree type
)
11905 /* If there are no template parameters in scope, then there can't be
11906 any dependent types. */
11907 if (!processing_template_decl
)
11910 /* If the type is NULL, we have not computed a type for the entity
11911 in question; in that case, the type is dependent. */
11915 /* Erroneous types can be considered non-dependent. */
11916 if (type
== error_mark_node
)
11919 /* If we have not already computed the appropriate value for TYPE,
11921 if (!TYPE_DEPENDENT_P_VALID (type
))
11923 TYPE_DEPENDENT_P (type
) = dependent_type_p_r (type
);
11924 TYPE_DEPENDENT_P_VALID (type
) = 1;
11927 return TYPE_DEPENDENT_P (type
);
11930 /* Returns TRUE if EXPRESSION is dependent, according to CRITERION. */
11933 dependent_scope_ref_p (tree expression
, bool criterion (tree
))
11938 gcc_assert (TREE_CODE (expression
) == SCOPE_REF
);
11940 if (!TYPE_P (TREE_OPERAND (expression
, 0)))
11943 scope
= TREE_OPERAND (expression
, 0);
11944 name
= TREE_OPERAND (expression
, 1);
11948 An id-expression is type-dependent if it contains a
11949 nested-name-specifier that contains a class-name that names a
11951 /* The suggested resolution to Core Issue 2 implies that if the
11952 qualifying type is the current class, then we must peek
11955 && currently_open_class (scope
)
11956 && !criterion (name
))
11958 if (dependent_type_p (scope
))
11964 /* Returns TRUE if the EXPRESSION is value-dependent, in the sense of
11965 [temp.dep.constexpr] */
11968 value_dependent_expression_p (tree expression
)
11970 if (!processing_template_decl
)
11973 /* A name declared with a dependent type. */
11974 if (DECL_P (expression
) && type_dependent_expression_p (expression
))
11977 switch (TREE_CODE (expression
))
11979 case IDENTIFIER_NODE
:
11980 /* A name that has not been looked up -- must be dependent. */
11983 case TEMPLATE_PARM_INDEX
:
11984 /* A non-type template parm. */
11988 /* A non-type template parm. */
11989 if (DECL_TEMPLATE_PARM_P (expression
))
11994 /* A constant with integral or enumeration type and is initialized
11995 with an expression that is value-dependent. */
11996 if (DECL_INITIAL (expression
)
11997 && INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (expression
))
11998 && value_dependent_expression_p (DECL_INITIAL (expression
)))
12002 case DYNAMIC_CAST_EXPR
:
12003 case STATIC_CAST_EXPR
:
12004 case CONST_CAST_EXPR
:
12005 case REINTERPRET_CAST_EXPR
:
12007 /* These expressions are value-dependent if the type to which
12008 the cast occurs is dependent or the expression being casted
12009 is value-dependent. */
12011 tree type
= TREE_TYPE (expression
);
12013 if (dependent_type_p (type
))
12016 /* A functional cast has a list of operands. */
12017 expression
= TREE_OPERAND (expression
, 0);
12020 /* If there are no operands, it must be an expression such
12021 as "int()". This should not happen for aggregate types
12022 because it would form non-constant expressions. */
12023 gcc_assert (INTEGRAL_OR_ENUMERATION_TYPE_P (type
));
12028 if (TREE_CODE (expression
) == TREE_LIST
)
12030 for (; expression
; expression
= TREE_CHAIN (expression
))
12031 if (value_dependent_expression_p (TREE_VALUE (expression
)))
12036 return value_dependent_expression_p (expression
);
12041 /* A `sizeof' expression is value-dependent if the operand is
12043 expression
= TREE_OPERAND (expression
, 0);
12044 if (TYPE_P (expression
))
12045 return dependent_type_p (expression
);
12046 return type_dependent_expression_p (expression
);
12049 return dependent_scope_ref_p (expression
, value_dependent_expression_p
);
12051 case COMPONENT_REF
:
12052 return (value_dependent_expression_p (TREE_OPERAND (expression
, 0))
12053 || value_dependent_expression_p (TREE_OPERAND (expression
, 1)));
12056 /* A CALL_EXPR is value-dependent if any argument is
12057 value-dependent. Why do we have to handle CALL_EXPRs in this
12058 function at all? First, some function calls, those for which
12059 value_dependent_expression_p is true, man appear in constant
12060 expressions. Second, there appear to be bugs which result in
12061 other CALL_EXPRs reaching this point. */
12063 tree function
= TREE_OPERAND (expression
, 0);
12064 tree args
= TREE_OPERAND (expression
, 1);
12066 if (value_dependent_expression_p (function
))
12072 if (TREE_CODE (args
) == TREE_LIST
)
12074 for (; args
; args
= TREE_CHAIN (args
))
12075 if (value_dependent_expression_p (TREE_VALUE (args
)))
12080 return value_dependent_expression_p (args
);
12084 /* A constant expression is value-dependent if any subexpression is
12085 value-dependent. */
12086 switch (TREE_CODE_CLASS (TREE_CODE (expression
)))
12088 case tcc_reference
:
12090 return (value_dependent_expression_p
12091 (TREE_OPERAND (expression
, 0)));
12093 case tcc_comparison
:
12095 return ((value_dependent_expression_p
12096 (TREE_OPERAND (expression
, 0)))
12097 || (value_dependent_expression_p
12098 (TREE_OPERAND (expression
, 1))));
12100 case tcc_expression
:
12103 for (i
= 0; i
< TREE_CODE_LENGTH (TREE_CODE (expression
)); ++i
)
12104 /* In some cases, some of the operands may be missing.
12105 (For example, in the case of PREDECREMENT_EXPR, the
12106 amount to increment by may be missing.) That doesn't
12107 make the expression dependent. */
12108 if (TREE_OPERAND (expression
, i
)
12109 && (value_dependent_expression_p
12110 (TREE_OPERAND (expression
, i
))))
12120 /* The expression is not value-dependent. */
12124 /* Returns TRUE if the EXPRESSION is type-dependent, in the sense of
12125 [temp.dep.expr]. */
12128 type_dependent_expression_p (tree expression
)
12130 if (!processing_template_decl
)
12133 if (expression
== error_mark_node
)
12136 /* An unresolved name is always dependent. */
12137 if (TREE_CODE (expression
) == IDENTIFIER_NODE
)
12140 /* Some expression forms are never type-dependent. */
12141 if (TREE_CODE (expression
) == PSEUDO_DTOR_EXPR
12142 || TREE_CODE (expression
) == SIZEOF_EXPR
12143 || TREE_CODE (expression
) == ALIGNOF_EXPR
12144 || TREE_CODE (expression
) == TYPEID_EXPR
12145 || TREE_CODE (expression
) == DELETE_EXPR
12146 || TREE_CODE (expression
) == VEC_DELETE_EXPR
12147 || TREE_CODE (expression
) == THROW_EXPR
)
12150 /* The types of these expressions depends only on the type to which
12151 the cast occurs. */
12152 if (TREE_CODE (expression
) == DYNAMIC_CAST_EXPR
12153 || TREE_CODE (expression
) == STATIC_CAST_EXPR
12154 || TREE_CODE (expression
) == CONST_CAST_EXPR
12155 || TREE_CODE (expression
) == REINTERPRET_CAST_EXPR
12156 || TREE_CODE (expression
) == CAST_EXPR
)
12157 return dependent_type_p (TREE_TYPE (expression
));
12159 /* The types of these expressions depends only on the type created
12160 by the expression. */
12161 if (TREE_CODE (expression
) == NEW_EXPR
12162 || TREE_CODE (expression
) == VEC_NEW_EXPR
)
12164 /* For NEW_EXPR tree nodes created inside a template, either
12165 the object type itself or a TREE_LIST may appear as the
12167 tree type
= TREE_OPERAND (expression
, 1);
12168 if (TREE_CODE (type
) == TREE_LIST
)
12169 /* This is an array type. We need to check array dimensions
12171 return dependent_type_p (TREE_VALUE (TREE_PURPOSE (type
)))
12172 || value_dependent_expression_p
12173 (TREE_OPERAND (TREE_VALUE (type
), 1));
12175 return dependent_type_p (type
);
12178 if (TREE_CODE (expression
) == SCOPE_REF
12179 && dependent_scope_ref_p (expression
,
12180 type_dependent_expression_p
))
12183 if (TREE_CODE (expression
) == FUNCTION_DECL
12184 && DECL_LANG_SPECIFIC (expression
)
12185 && DECL_TEMPLATE_INFO (expression
)
12186 && (any_dependent_template_arguments_p
12187 (INNERMOST_TEMPLATE_ARGS (DECL_TI_ARGS (expression
)))))
12190 if (TREE_CODE (expression
) == TEMPLATE_DECL
12191 && !DECL_TEMPLATE_TEMPLATE_PARM_P (expression
))
12194 if (TREE_TYPE (expression
) == unknown_type_node
)
12196 if (TREE_CODE (expression
) == ADDR_EXPR
)
12197 return type_dependent_expression_p (TREE_OPERAND (expression
, 0));
12198 if (TREE_CODE (expression
) == COMPONENT_REF
12199 || TREE_CODE (expression
) == OFFSET_REF
)
12201 if (type_dependent_expression_p (TREE_OPERAND (expression
, 0)))
12203 expression
= TREE_OPERAND (expression
, 1);
12204 if (TREE_CODE (expression
) == IDENTIFIER_NODE
)
12207 /* SCOPE_REF with non-null TREE_TYPE is always non-dependent. */
12208 if (TREE_CODE (expression
) == SCOPE_REF
)
12211 if (TREE_CODE (expression
) == BASELINK
)
12212 expression
= BASELINK_FUNCTIONS (expression
);
12214 if (TREE_CODE (expression
) == TEMPLATE_ID_EXPR
)
12216 if (any_dependent_template_arguments_p
12217 (TREE_OPERAND (expression
, 1)))
12219 expression
= TREE_OPERAND (expression
, 0);
12221 gcc_assert (TREE_CODE (expression
) == OVERLOAD
);
12225 if (type_dependent_expression_p (OVL_CURRENT (expression
)))
12227 expression
= OVL_NEXT (expression
);
12232 return (dependent_type_p (TREE_TYPE (expression
)));
12235 /* Returns TRUE if ARGS (a TREE_LIST of arguments to a function call)
12236 contains a type-dependent expression. */
12239 any_type_dependent_arguments_p (tree args
)
12243 tree arg
= TREE_VALUE (args
);
12245 if (type_dependent_expression_p (arg
))
12247 args
= TREE_CHAIN (args
);
12252 /* Returns TRUE if the ARG (a template argument) is dependent. */
12255 dependent_template_arg_p (tree arg
)
12257 if (!processing_template_decl
)
12260 if (TREE_CODE (arg
) == TEMPLATE_DECL
12261 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
12262 return dependent_template_p (arg
);
12263 else if (TYPE_P (arg
))
12264 return dependent_type_p (arg
);
12266 return (type_dependent_expression_p (arg
)
12267 || value_dependent_expression_p (arg
));
12270 /* Returns true if ARGS (a collection of template arguments) contains
12271 any dependent arguments. */
12274 any_dependent_template_arguments_p (tree args
)
12282 for (i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
12284 tree level
= TMPL_ARGS_LEVEL (args
, i
+ 1);
12285 for (j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
12286 if (dependent_template_arg_p (TREE_VEC_ELT (level
, j
)))
12293 /* Returns TRUE if the template TMPL is dependent. */
12296 dependent_template_p (tree tmpl
)
12298 if (TREE_CODE (tmpl
) == OVERLOAD
)
12302 if (dependent_template_p (OVL_FUNCTION (tmpl
)))
12304 tmpl
= OVL_CHAIN (tmpl
);
12309 /* Template template parameters are dependent. */
12310 if (DECL_TEMPLATE_TEMPLATE_PARM_P (tmpl
)
12311 || TREE_CODE (tmpl
) == TEMPLATE_TEMPLATE_PARM
)
12313 /* So are names that have not been looked up. */
12314 if (TREE_CODE (tmpl
) == SCOPE_REF
12315 || TREE_CODE (tmpl
) == IDENTIFIER_NODE
)
12317 /* So are member templates of dependent classes. */
12318 if (TYPE_P (CP_DECL_CONTEXT (tmpl
)))
12319 return dependent_type_p (DECL_CONTEXT (tmpl
));
12323 /* Returns TRUE if the specialization TMPL<ARGS> is dependent. */
12326 dependent_template_id_p (tree tmpl
, tree args
)
12328 return (dependent_template_p (tmpl
)
12329 || any_dependent_template_arguments_p (args
));
12332 /* TYPE is a TYPENAME_TYPE. Returns the ordinary TYPE to which the
12333 TYPENAME_TYPE corresponds. Returns ERROR_MARK_NODE if no such TYPE
12334 can be found. Note that this function peers inside uninstantiated
12335 templates and therefore should be used only in extremely limited
12339 resolve_typename_type (tree type
, bool only_current_p
)
12347 gcc_assert (TREE_CODE (type
) == TYPENAME_TYPE
);
12349 scope
= TYPE_CONTEXT (type
);
12350 name
= TYPE_IDENTIFIER (type
);
12352 /* If the SCOPE is itself a TYPENAME_TYPE, then we need to resolve
12353 it first before we can figure out what NAME refers to. */
12354 if (TREE_CODE (scope
) == TYPENAME_TYPE
)
12355 scope
= resolve_typename_type (scope
, only_current_p
);
12356 /* If we don't know what SCOPE refers to, then we cannot resolve the
12358 if (scope
== error_mark_node
|| TREE_CODE (scope
) == TYPENAME_TYPE
)
12359 return error_mark_node
;
12360 /* If the SCOPE is a template type parameter, we have no way of
12361 resolving the name. */
12362 if (TREE_CODE (scope
) == TEMPLATE_TYPE_PARM
)
12364 /* If the SCOPE is not the current instantiation, there's no reason
12365 to look inside it. */
12366 if (only_current_p
&& !currently_open_class (scope
))
12367 return error_mark_node
;
12368 /* If SCOPE is a partial instantiation, it will not have a valid
12369 TYPE_FIELDS list, so use the original template. */
12370 scope
= CLASSTYPE_PRIMARY_TEMPLATE_TYPE (scope
);
12371 /* Enter the SCOPE so that name lookup will be resolved as if we
12372 were in the class definition. In particular, SCOPE will no
12373 longer be considered a dependent type. */
12374 pushed_scope
= push_scope (scope
);
12375 /* Look up the declaration. */
12376 decl
= lookup_member (scope
, name
, /*protect=*/0, /*want_type=*/true);
12377 /* Obtain the set of qualifiers applied to the TYPE. */
12378 quals
= cp_type_quals (type
);
12379 /* For a TYPENAME_TYPE like "typename X::template Y<T>", we want to
12380 find a TEMPLATE_DECL. Otherwise, we want to find a TYPE_DECL. */
12382 type
= error_mark_node
;
12383 else if (TREE_CODE (TYPENAME_TYPE_FULLNAME (type
)) == IDENTIFIER_NODE
12384 && TREE_CODE (decl
) == TYPE_DECL
)
12385 type
= TREE_TYPE (decl
);
12386 else if (TREE_CODE (TYPENAME_TYPE_FULLNAME (type
)) == TEMPLATE_ID_EXPR
12387 && DECL_CLASS_TEMPLATE_P (decl
))
12391 /* Obtain the template and the arguments. */
12392 tmpl
= TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type
), 0);
12393 args
= TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type
), 1);
12394 /* Instantiate the template. */
12395 type
= lookup_template_class (tmpl
, args
, NULL_TREE
, NULL_TREE
,
12396 /*entering_scope=*/0, tf_error
| tf_user
);
12399 type
= error_mark_node
;
12400 /* Qualify the resulting type. */
12401 if (type
!= error_mark_node
&& quals
)
12402 type
= cp_build_qualified_type (type
, quals
);
12403 /* Leave the SCOPE. */
12405 pop_scope (pushed_scope
);
12410 /* EXPR is an expression which is not type-dependent. Return a proxy
12411 for EXPR that can be used to compute the types of larger
12412 expressions containing EXPR. */
12415 build_non_dependent_expr (tree expr
)
12419 /* Preserve null pointer constants so that the type of things like
12420 "p == 0" where "p" is a pointer can be determined. */
12421 if (null_ptr_cst_p (expr
))
12423 /* Preserve OVERLOADs; the functions must be available to resolve
12425 inner_expr
= (TREE_CODE (expr
) == ADDR_EXPR
?
12426 TREE_OPERAND (expr
, 0) : expr
);
12427 if (TREE_CODE (inner_expr
) == OVERLOAD
12428 || TREE_CODE (inner_expr
) == FUNCTION_DECL
12429 || TREE_CODE (inner_expr
) == TEMPLATE_DECL
12430 || TREE_CODE (inner_expr
) == TEMPLATE_ID_EXPR
12431 || TREE_CODE (inner_expr
) == OFFSET_REF
)
12433 /* There is no need to return a proxy for a variable. */
12434 if (TREE_CODE (expr
) == VAR_DECL
)
12436 /* Preserve string constants; conversions from string constants to
12437 "char *" are allowed, even though normally a "const char *"
12438 cannot be used to initialize a "char *". */
12439 if (TREE_CODE (expr
) == STRING_CST
)
12441 /* Preserve arithmetic constants, as an optimization -- there is no
12442 reason to create a new node. */
12443 if (TREE_CODE (expr
) == INTEGER_CST
|| TREE_CODE (expr
) == REAL_CST
)
12445 /* Preserve THROW_EXPRs -- all throw-expressions have type "void".
12446 There is at least one place where we want to know that a
12447 particular expression is a throw-expression: when checking a ?:
12448 expression, there are special rules if the second or third
12449 argument is a throw-expression. */
12450 if (TREE_CODE (expr
) == THROW_EXPR
)
12453 if (TREE_CODE (expr
) == COND_EXPR
)
12454 return build3 (COND_EXPR
,
12456 TREE_OPERAND (expr
, 0),
12457 (TREE_OPERAND (expr
, 1)
12458 ? build_non_dependent_expr (TREE_OPERAND (expr
, 1))
12459 : build_non_dependent_expr (TREE_OPERAND (expr
, 0))),
12460 build_non_dependent_expr (TREE_OPERAND (expr
, 2)));
12461 if (TREE_CODE (expr
) == COMPOUND_EXPR
12462 && !COMPOUND_EXPR_OVERLOADED (expr
))
12463 return build2 (COMPOUND_EXPR
,
12465 TREE_OPERAND (expr
, 0),
12466 build_non_dependent_expr (TREE_OPERAND (expr
, 1)));
12468 /* Otherwise, build a NON_DEPENDENT_EXPR.
12470 REFERENCE_TYPEs are not stripped for expressions in templates
12471 because doing so would play havoc with mangling. Consider, for
12474 template <typename T> void f<T& g>() { g(); }
12476 In the body of "f", the expression for "g" will have
12477 REFERENCE_TYPE, even though the standard says that it should
12478 not. The reason is that we must preserve the syntactic form of
12479 the expression so that mangling (say) "f<g>" inside the body of
12480 "f" works out correctly. Therefore, the REFERENCE_TYPE is
12482 return build1 (NON_DEPENDENT_EXPR
, non_reference (TREE_TYPE (expr
)), expr
);
12485 /* ARGS is a TREE_LIST of expressions as arguments to a function call.
12486 Return a new TREE_LIST with the various arguments replaced with
12487 equivalent non-dependent expressions. */
12490 build_non_dependent_args (tree args
)
12495 new_args
= NULL_TREE
;
12496 for (a
= args
; a
; a
= TREE_CHAIN (a
))
12497 new_args
= tree_cons (NULL_TREE
,
12498 build_non_dependent_expr (TREE_VALUE (a
)),
12500 return nreverse (new_args
);
12503 #include "gt-cp-pt.h"