]>
Commit | Line | Data |
---|---|---|
8d08fdba | 1 | /* Handle parameterized types (templates) for GNU C++. |
3febd123 | 2 | Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000, |
3fe82414 | 3 | 2001, 2002, 2003, 2004, 2005, 2007, 2008 Free Software Foundation, Inc. |
8d08fdba | 4 | Written by Ken Raeburn (raeburn@cygnus.com) while at Watchmaker Computing. |
fc378698 | 5 | Rewritten by Jason Merrill (jason@cygnus.com). |
8d08fdba | 6 | |
f5adbb8d | 7 | This file is part of GCC. |
8d08fdba | 8 | |
f5adbb8d | 9 | GCC is free software; you can redistribute it and/or modify |
8d08fdba | 10 | it under the terms of the GNU General Public License as published by |
e77f031d | 11 | the Free Software Foundation; either version 3, or (at your option) |
8d08fdba MS |
12 | any later version. |
13 | ||
f5adbb8d | 14 | GCC is distributed in the hope that it will be useful, |
8d08fdba MS |
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. | |
18 | ||
19 | You should have received a copy of the GNU General Public License | |
e77f031d NC |
20 | along with GCC; see the file COPYING3. If not see |
21 | <http://www.gnu.org/licenses/>. */ | |
8d08fdba MS |
22 | |
23 | /* Known bugs or deficiencies include: | |
e92cc029 | 24 | |
e92cc029 MS |
25 | all methods must be provided in header files; can't use a source |
26 | file that contains only the method templates and "just win". */ | |
8d08fdba MS |
27 | |
28 | #include "config.h" | |
8d052bc7 | 29 | #include "system.h" |
4977bab6 ZW |
30 | #include "coretypes.h" |
31 | #include "tm.h" | |
8d08fdba | 32 | #include "obstack.h" |
8d08fdba | 33 | #include "tree.h" |
0c58f841 | 34 | #include "pointer-set.h" |
8d08fdba | 35 | #include "flags.h" |
e58a9aa1 | 36 | #include "c-common.h" |
8d08fdba | 37 | #include "cp-tree.h" |
e58a9aa1 | 38 | #include "cp-objcp-common.h" |
25af8512 | 39 | #include "tree-inline.h" |
8d08fdba | 40 | #include "decl.h" |
e8abc66f | 41 | #include "output.h" |
49c249e1 | 42 | #include "except.h" |
54f92bfb | 43 | #include "toplev.h" |
3dcaad8b | 44 | #include "rtl.h" |
297a5329 | 45 | #include "timevar.h" |
325c3691 | 46 | #include "tree-iterator.h" |
53824026 | 47 | #include "vecprim.h" |
49c249e1 | 48 | |
050367a3 MM |
49 | /* The type of functions taking a tree, and some additional data, and |
50 | returning an int. */ | |
3a978d72 | 51 | typedef int (*tree_fn_t) (tree, void*); |
050367a3 | 52 | |
0aafb128 MM |
53 | /* The PENDING_TEMPLATES is a TREE_LIST of templates whose |
54 | instantiations have been deferred, either because their definitions | |
e2c3721c PB |
55 | were not yet available, or because we were putting off doing the work. */ |
56 | struct pending_template GTY (()) { | |
57 | struct pending_template *next; | |
58 | struct tinst_level *tinst; | |
59 | }; | |
60 | ||
61 | static GTY(()) struct pending_template *pending_templates; | |
62 | static GTY(()) struct pending_template *last_pending_template; | |
73aad9b9 | 63 | |
67ffc812 | 64 | int processing_template_parmlist; |
386b8a85 JM |
65 | static int template_header_count; |
66 | ||
e2500fed | 67 | static GTY(()) tree saved_trees; |
53824026 | 68 | static VEC(int,heap) *inline_parm_levels; |
75650646 | 69 | |
e2c3721c | 70 | static GTY(()) struct tinst_level *current_tinst_level; |
3ae18eaf | 71 | |
2b59fc25 KL |
72 | static GTY(()) tree saved_access_scope; |
73 | ||
0fe0caa6 RH |
74 | /* Live only within one (recursive) call to tsubst_expr. We use |
75 | this to pass the statement expression node from the STMT_EXPR | |
76 | to the EXPR_STMT that is its result. */ | |
77 | static tree cur_stmt_expr; | |
78 | ||
6dfbb909 MM |
79 | /* A map from local variable declarations in the body of the template |
80 | presently being instantiated to the corresponding instantiated | |
81 | local variables. */ | |
82 | static htab_t local_specializations; | |
83 | ||
410cf6e6 | 84 | /* Contains canonical template parameter types. The vector is indexed by |
06d40de8 DG |
85 | the TEMPLATE_TYPE_IDX of the template parameter. Each element is a |
86 | TREE_LIST, whose TREE_VALUEs contain the canonical template | |
87 | parameters of various types and levels. */ | |
88 | static GTY(()) VEC(tree,gc) *canonical_template_parms; | |
89 | ||
830bfa74 MM |
90 | #define UNIFY_ALLOW_NONE 0 |
91 | #define UNIFY_ALLOW_MORE_CV_QUAL 1 | |
92 | #define UNIFY_ALLOW_LESS_CV_QUAL 2 | |
93 | #define UNIFY_ALLOW_DERIVED 4 | |
161c12b0 | 94 | #define UNIFY_ALLOW_INTEGER 8 |
028d1f20 | 95 | #define UNIFY_ALLOW_OUTER_LEVEL 16 |
62e4a758 NS |
96 | #define UNIFY_ALLOW_OUTER_MORE_CV_QUAL 32 |
97 | #define UNIFY_ALLOW_OUTER_LESS_CV_QUAL 64 | |
830bfa74 | 98 | |
3a978d72 NN |
99 | static void push_access_scope (tree); |
100 | static void pop_access_scope (tree); | |
acde59b4 MM |
101 | static bool resolve_overloaded_unification (tree, tree, tree, tree, |
102 | unification_kind_t, int); | |
3a978d72 | 103 | static int try_one_overload (tree, tree, tree, tree, tree, |
f23fb7f5 | 104 | unification_kind_t, int, bool); |
3a978d72 NN |
105 | static int unify (tree, tree, tree, tree, int); |
106 | static void add_pending_template (tree); | |
aa9d8196 VR |
107 | static int push_tinst_level (tree); |
108 | static void pop_tinst_level (void); | |
e2c3721c | 109 | static tree reopen_tinst_level (struct tinst_level *); |
3a978d72 | 110 | static tree tsubst_initializer_list (tree, tree); |
3a978d72 | 111 | static tree get_class_bindings (tree, tree, tree); |
3db45ab5 | 112 | static tree coerce_template_parms (tree, tree, tree, tsubst_flags_t, |
e7e93965 | 113 | bool, bool); |
3a978d72 NN |
114 | static void tsubst_enum (tree, tree, tree); |
115 | static tree add_to_template_args (tree, tree); | |
116 | static tree add_outermost_template_args (tree, tree); | |
117 | static bool check_instantiated_args (tree, tree, tsubst_flags_t); | |
8af2fec4 RY |
118 | static int maybe_adjust_types_for_deduction (unification_kind_t, tree*, tree*, |
119 | tree); | |
3a978d72 | 120 | static int type_unification_real (tree, tree, tree, tree, |
30f86ec3 | 121 | int, unification_kind_t, int); |
3a978d72 | 122 | static void note_template_header (int); |
b6ab6892 | 123 | static tree convert_nontype_argument_function (tree, tree); |
3a978d72 NN |
124 | static tree convert_nontype_argument (tree, tree); |
125 | static tree convert_template_argument (tree, tree, tree, | |
126 | tsubst_flags_t, int, tree); | |
0c58f841 | 127 | static int for_each_template_parm (tree, tree_fn_t, void*, |
c095a4f8 | 128 | struct pointer_set_t*, bool); |
5d80a306 | 129 | static tree expand_template_argument_pack (tree); |
3a978d72 | 130 | static tree build_template_parm_index (int, int, int, tree, tree); |
ae95e46e | 131 | static bool inline_needs_template_parms (tree); |
3a978d72 | 132 | static void push_inline_template_parms_recursive (tree, int); |
3a978d72 | 133 | static tree retrieve_local_specialization (tree); |
3a978d72 | 134 | static void register_local_specialization (tree, tree); |
ef3b7b17 | 135 | static tree reduce_template_parm_level (tree, tree, int, tree, tsubst_flags_t); |
3a978d72 NN |
136 | static int mark_template_parm (tree, void *); |
137 | static int template_parm_this_level_p (tree, void *); | |
138 | static tree tsubst_friend_function (tree, tree); | |
139 | static tree tsubst_friend_class (tree, tree); | |
140 | static int can_complete_type_without_circularity (tree); | |
a34d3336 | 141 | static tree get_bindings (tree, tree, tree, bool); |
3a978d72 NN |
142 | static int template_decl_level (tree); |
143 | static int check_cv_quals_for_unify (int, tree, tree); | |
5d80a306 DG |
144 | static void template_parm_level_and_index (tree, int*, int*); |
145 | static int unify_pack_expansion (tree, tree, tree, tree, int, bool, bool); | |
a91db711 NS |
146 | static tree tsubst_template_arg (tree, tree, tsubst_flags_t, tree); |
147 | static tree tsubst_template_args (tree, tree, tsubst_flags_t, tree); | |
3a978d72 NN |
148 | static tree tsubst_template_parms (tree, tree, tsubst_flags_t); |
149 | static void regenerate_decl_from_template (tree, tree); | |
3a978d72 | 150 | static tree most_specialized_class (tree, tree); |
3a978d72 | 151 | static tree tsubst_aggr_type (tree, tree, tsubst_flags_t, tree, int); |
3a978d72 NN |
152 | static tree tsubst_arg_types (tree, tree, tsubst_flags_t, tree); |
153 | static tree tsubst_function_type (tree, tree, tsubst_flags_t, tree); | |
9b910171 | 154 | static bool check_specialization_scope (void); |
3a978d72 NN |
155 | static tree process_partial_specialization (tree); |
156 | static void set_current_access_from_decl (tree); | |
3a978d72 | 157 | static tree get_template_base (tree, tree, tree, tree); |
3a978d72 NN |
158 | static tree try_class_unification (tree, tree, tree, tree); |
159 | static int coerce_template_template_parms (tree, tree, tsubst_flags_t, | |
160 | tree, tree); | |
4cf36211 | 161 | static bool template_template_parm_bindings_ok_p (tree, tree); |
3a978d72 NN |
162 | static int template_args_equal (tree, tree); |
163 | static void tsubst_default_arguments (tree); | |
164 | static tree for_each_template_parm_r (tree *, int *, void *); | |
165 | static tree copy_default_args_to_explicit_spec_1 (tree, tree); | |
166 | static void copy_default_args_to_explicit_spec (tree); | |
167 | static int invalid_nontype_parm_type_p (tree, tsubst_flags_t); | |
a723baf1 | 168 | static int eq_local_specializations (const void *, const void *); |
5d80a306 | 169 | static bool dependent_template_arg_p (tree); |
06d40de8 | 170 | static bool any_template_arguments_need_structural_equality_p (tree); |
5552b43c | 171 | static bool dependent_type_p_r (tree); |
14d22dd6 | 172 | static tree tsubst (tree, tree, tsubst_flags_t, tree); |
015c2c66 | 173 | static tree tsubst_expr (tree, tree, tsubst_flags_t, tree, bool); |
14d22dd6 | 174 | static tree tsubst_copy (tree, tree, tsubst_flags_t, tree); |
5d80a306 | 175 | static tree tsubst_pack_expansion (tree, tree, tsubst_flags_t, tree); |
36a117a5 | 176 | |
2b59fc25 KL |
177 | /* Make the current scope suitable for access checking when we are |
178 | processing T. T can be FUNCTION_DECL for instantiated function | |
2b907f5c KL |
179 | template, or VAR_DECL for static member variable (need by |
180 | instantiate_decl). */ | |
2b59fc25 | 181 | |
8ce33230 | 182 | static void |
2b907f5c | 183 | push_access_scope (tree t) |
2b59fc25 | 184 | { |
50bc768d NS |
185 | gcc_assert (TREE_CODE (t) == FUNCTION_DECL |
186 | || TREE_CODE (t) == VAR_DECL); | |
2b59fc25 | 187 | |
23ff7e2d KL |
188 | if (DECL_FRIEND_CONTEXT (t)) |
189 | push_nested_class (DECL_FRIEND_CONTEXT (t)); | |
190 | else if (DECL_CLASS_SCOPE_P (t)) | |
2b907f5c | 191 | push_nested_class (DECL_CONTEXT (t)); |
0f399e5f KL |
192 | else |
193 | push_to_top_level (); | |
c8094d83 | 194 | |
2b907f5c | 195 | if (TREE_CODE (t) == FUNCTION_DECL) |
0f399e5f KL |
196 | { |
197 | saved_access_scope = tree_cons | |
198 | (NULL_TREE, current_function_decl, saved_access_scope); | |
199 | current_function_decl = t; | |
200 | } | |
2b59fc25 KL |
201 | } |
202 | ||
2b59fc25 KL |
203 | /* Restore the scope set up by push_access_scope. T is the node we |
204 | are processing. */ | |
205 | ||
8ce33230 | 206 | static void |
3a978d72 | 207 | pop_access_scope (tree t) |
2b59fc25 | 208 | { |
2b907f5c | 209 | if (TREE_CODE (t) == FUNCTION_DECL) |
2b59fc25 KL |
210 | { |
211 | current_function_decl = TREE_VALUE (saved_access_scope); | |
212 | saved_access_scope = TREE_CHAIN (saved_access_scope); | |
213 | } | |
0f399e5f | 214 | |
23ff7e2d | 215 | if (DECL_FRIEND_CONTEXT (t) || DECL_CLASS_SCOPE_P (t)) |
0f399e5f KL |
216 | pop_nested_class (); |
217 | else | |
218 | pop_from_top_level (); | |
2b59fc25 KL |
219 | } |
220 | ||
a723baf1 MM |
221 | /* Do any processing required when DECL (a member template |
222 | declaration) is finished. Returns the TEMPLATE_DECL corresponding | |
223 | to DECL, unless it is a specialization, in which case the DECL | |
224 | itself is returned. */ | |
e1467ff2 MM |
225 | |
226 | tree | |
3a978d72 | 227 | finish_member_template_decl (tree decl) |
e1467ff2 | 228 | { |
a723baf1 MM |
229 | if (decl == error_mark_node) |
230 | return error_mark_node; | |
231 | ||
50bc768d | 232 | gcc_assert (DECL_P (decl)); |
a723baf1 MM |
233 | |
234 | if (TREE_CODE (decl) == TYPE_DECL) | |
93cdc044 | 235 | { |
a723baf1 MM |
236 | tree type; |
237 | ||
238 | type = TREE_TYPE (decl); | |
92fab505 DG |
239 | if (type == error_mark_node) |
240 | return error_mark_node; | |
9e1e64ec | 241 | if (MAYBE_CLASS_TYPE_P (type) |
a723baf1 MM |
242 | && CLASSTYPE_TEMPLATE_INFO (type) |
243 | && !CLASSTYPE_TEMPLATE_SPECIALIZATION (type)) | |
93cdc044 | 244 | { |
a723baf1 | 245 | tree tmpl = CLASSTYPE_TI_TEMPLATE (type); |
93cdc044 JM |
246 | check_member_template (tmpl); |
247 | return tmpl; | |
248 | } | |
8d019cef | 249 | return NULL_TREE; |
93cdc044 | 250 | } |
07c88314 | 251 | else if (TREE_CODE (decl) == FIELD_DECL) |
0f51ccfc | 252 | error ("data member %qD cannot be a member template", decl); |
a1da6cba | 253 | else if (DECL_TEMPLATE_INFO (decl)) |
e1467ff2 | 254 | { |
a1da6cba MM |
255 | if (!DECL_TEMPLATE_SPECIALIZATION (decl)) |
256 | { | |
257 | check_member_template (DECL_TI_TEMPLATE (decl)); | |
258 | return DECL_TI_TEMPLATE (decl); | |
259 | } | |
260 | else | |
261 | return decl; | |
c8094d83 | 262 | } |
a1da6cba | 263 | else |
0f51ccfc | 264 | error ("invalid member template declaration %qD", decl); |
e1467ff2 | 265 | |
a1da6cba | 266 | return error_mark_node; |
f84b4be9 | 267 | } |
e1467ff2 | 268 | |
91a77d68 JM |
269 | /* Return the template info node corresponding to T, whatever T is. */ |
270 | ||
271 | tree | |
272 | get_template_info (tree t) | |
273 | { | |
274 | tree tinfo = NULL_TREE; | |
275 | ||
276 | if (DECL_P (t) && DECL_LANG_SPECIFIC (t)) | |
277 | tinfo = DECL_TEMPLATE_INFO (t); | |
278 | ||
279 | if (!tinfo && TREE_CODE (t) == TYPE_DECL) | |
280 | t = TREE_TYPE (t); | |
281 | ||
282 | if (TAGGED_TYPE_P (t)) | |
283 | tinfo = TYPE_TEMPLATE_INFO (t); | |
284 | ||
285 | return tinfo; | |
286 | } | |
287 | ||
f84b4be9 | 288 | /* Returns the template nesting level of the indicated class TYPE. |
c8094d83 | 289 | |
f84b4be9 JM |
290 | For example, in: |
291 | template <class T> | |
292 | struct A | |
293 | { | |
294 | template <class U> | |
295 | struct B {}; | |
296 | }; | |
297 | ||
c8094d83 | 298 | A<T>::B<U> has depth two, while A<T> has depth one. |
39c01e4c | 299 | Both A<T>::B<int> and A<int>::B<U> have depth one, if |
260cd73f | 300 | they are instantiations, not specializations. |
39c01e4c MM |
301 | |
302 | This function is guaranteed to return 0 if passed NULL_TREE so | |
303 | that, for example, `template_class_depth (current_class_type)' is | |
304 | always safe. */ | |
f84b4be9 | 305 | |
260cd73f VR |
306 | int |
307 | template_class_depth (tree type) | |
f84b4be9 | 308 | { |
93cdc044 | 309 | int depth; |
f84b4be9 | 310 | |
c8094d83 | 311 | for (depth = 0; |
ed44da02 | 312 | type && TREE_CODE (type) != NAMESPACE_DECL; |
c8094d83 | 313 | type = (TREE_CODE (type) == FUNCTION_DECL) |
4f1c5b7d | 314 | ? CP_DECL_CONTEXT (type) : TYPE_CONTEXT (type)) |
ed44da02 | 315 | { |
91a77d68 JM |
316 | tree tinfo = get_template_info (type); |
317 | ||
318 | if (tinfo && PRIMARY_TEMPLATE_P (TI_TEMPLATE (tinfo)) | |
319 | && uses_template_parms (INNERMOST_TEMPLATE_ARGS (TI_ARGS (tinfo)))) | |
320 | ++depth; | |
ed44da02 | 321 | } |
f84b4be9 JM |
322 | |
323 | return depth; | |
e1467ff2 | 324 | } |
98c1c668 | 325 | |
ae95e46e PC |
326 | /* Subroutine of maybe_begin_member_template_processing. |
327 | Returns true if processing DECL needs us to push template parms. */ | |
cae40af6 | 328 | |
ae95e46e | 329 | static bool |
3a978d72 | 330 | inline_needs_template_parms (tree decl) |
cae40af6 JM |
331 | { |
332 | if (! DECL_TEMPLATE_INFO (decl)) | |
ae95e46e | 333 | return false; |
f84b4be9 | 334 | |
36a117a5 | 335 | return (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (most_general_template (decl))) |
cae40af6 JM |
336 | > (processing_template_decl + DECL_TEMPLATE_SPECIALIZATION (decl))); |
337 | } | |
338 | ||
339 | /* Subroutine of maybe_begin_member_template_processing. | |
340 | Push the template parms in PARMS, starting from LEVELS steps into the | |
341 | chain, and ending at the beginning, since template parms are listed | |
342 | innermost first. */ | |
343 | ||
344 | static void | |
3a978d72 | 345 | push_inline_template_parms_recursive (tree parmlist, int levels) |
cae40af6 JM |
346 | { |
347 | tree parms = TREE_VALUE (parmlist); | |
348 | int i; | |
349 | ||
350 | if (levels > 1) | |
351 | push_inline_template_parms_recursive (TREE_CHAIN (parmlist), levels - 1); | |
786b5245 | 352 | |
98c1c668 | 353 | ++processing_template_decl; |
cae40af6 | 354 | current_template_parms |
4890c2f4 | 355 | = tree_cons (size_int (processing_template_decl), |
98c1c668 | 356 | parms, current_template_parms); |
cae40af6 JM |
357 | TEMPLATE_PARMS_FOR_INLINE (current_template_parms) = 1; |
358 | ||
ac20c67a | 359 | begin_scope (TREE_VEC_LENGTH (parms) ? sk_template_parms : sk_template_spec, |
0cbd7506 | 360 | NULL); |
c8094d83 | 361 | for (i = 0; i < TREE_VEC_LENGTH (parms); ++i) |
98c1c668 | 362 | { |
0f67a82f | 363 | tree parm = TREE_VALUE (TREE_VEC_ELT (parms, i)); |
42b304f1 | 364 | |
0f67a82f LM |
365 | if (parm == error_mark_node) |
366 | continue; | |
42b304f1 | 367 | |
50bc768d | 368 | gcc_assert (DECL_P (parm)); |
cae40af6 | 369 | |
98c1c668 JM |
370 | switch (TREE_CODE (parm)) |
371 | { | |
786b5245 | 372 | case TYPE_DECL: |
73b0fce8 | 373 | case TEMPLATE_DECL: |
98c1c668 JM |
374 | pushdecl (parm); |
375 | break; | |
786b5245 MM |
376 | |
377 | case PARM_DECL: | |
378 | { | |
fc03edb3 MM |
379 | /* Make a CONST_DECL as is done in process_template_parm. |
380 | It is ugly that we recreate this here; the original | |
381 | version built in process_template_parm is no longer | |
382 | available. */ | |
786b5245 MM |
383 | tree decl = build_decl (CONST_DECL, DECL_NAME (parm), |
384 | TREE_TYPE (parm)); | |
c727aa5e | 385 | DECL_ARTIFICIAL (decl) = 1; |
6de9cd9a DN |
386 | TREE_CONSTANT (decl) = 1; |
387 | TREE_INVARIANT (decl) = 1; | |
388 | TREE_READONLY (decl) = 1; | |
786b5245 | 389 | DECL_INITIAL (decl) = DECL_INITIAL (parm); |
cd9f6678 | 390 | SET_DECL_TEMPLATE_PARM_P (decl); |
786b5245 MM |
391 | pushdecl (decl); |
392 | } | |
cae40af6 | 393 | break; |
786b5245 | 394 | |
98c1c668 | 395 | default: |
315fb5db | 396 | gcc_unreachable (); |
98c1c668 JM |
397 | } |
398 | } | |
399 | } | |
400 | ||
cae40af6 JM |
401 | /* Restore the template parameter context for a member template or |
402 | a friend template defined in a class definition. */ | |
403 | ||
404 | void | |
3a978d72 | 405 | maybe_begin_member_template_processing (tree decl) |
cae40af6 JM |
406 | { |
407 | tree parms; | |
3dcaad8b | 408 | int levels = 0; |
cae40af6 | 409 | |
3dcaad8b MM |
410 | if (inline_needs_template_parms (decl)) |
411 | { | |
412 | parms = DECL_TEMPLATE_PARMS (most_general_template (decl)); | |
413 | levels = TMPL_PARMS_DEPTH (parms) - processing_template_decl; | |
cae40af6 | 414 | |
3dcaad8b MM |
415 | if (DECL_TEMPLATE_SPECIALIZATION (decl)) |
416 | { | |
417 | --levels; | |
418 | parms = TREE_CHAIN (parms); | |
419 | } | |
cae40af6 | 420 | |
3dcaad8b | 421 | push_inline_template_parms_recursive (parms, levels); |
cae40af6 JM |
422 | } |
423 | ||
3dcaad8b MM |
424 | /* Remember how many levels of template parameters we pushed so that |
425 | we can pop them later. */ | |
53824026 | 426 | VEC_safe_push (int, heap, inline_parm_levels, levels); |
cae40af6 JM |
427 | } |
428 | ||
1875c2b7 | 429 | /* Undo the effects of maybe_begin_member_template_processing. */ |
98c1c668 | 430 | |
c8094d83 | 431 | void |
3a978d72 | 432 | maybe_end_member_template_processing (void) |
98c1c668 | 433 | { |
3dcaad8b | 434 | int i; |
53824026 | 435 | int last; |
3dcaad8b | 436 | |
53824026 | 437 | if (VEC_length (int, inline_parm_levels) == 0) |
98c1c668 JM |
438 | return; |
439 | ||
53824026 KH |
440 | last = VEC_pop (int, inline_parm_levels); |
441 | for (i = 0; i < last; ++i) | |
cae40af6 JM |
442 | { |
443 | --processing_template_decl; | |
444 | current_template_parms = TREE_CHAIN (current_template_parms); | |
445 | poplevel (0, 0, 0); | |
446 | } | |
98c1c668 JM |
447 | } |
448 | ||
36a117a5 | 449 | /* Return a new template argument vector which contains all of ARGS, |
f9a7ae04 | 450 | but has as its innermost set of arguments the EXTRA_ARGS. */ |
e6f1275f JM |
451 | |
452 | static tree | |
3a978d72 | 453 | add_to_template_args (tree args, tree extra_args) |
e6f1275f | 454 | { |
36a117a5 MM |
455 | tree new_args; |
456 | int extra_depth; | |
457 | int i; | |
458 | int j; | |
e6f1275f | 459 | |
36a117a5 | 460 | extra_depth = TMPL_ARGS_DEPTH (extra_args); |
f31c0a32 | 461 | new_args = make_tree_vec (TMPL_ARGS_DEPTH (args) + extra_depth); |
e6f1275f | 462 | |
36a117a5 MM |
463 | for (i = 1; i <= TMPL_ARGS_DEPTH (args); ++i) |
464 | SET_TMPL_ARGS_LEVEL (new_args, i, TMPL_ARGS_LEVEL (args, i)); | |
e6f1275f | 465 | |
36a117a5 MM |
466 | for (j = 1; j <= extra_depth; ++j, ++i) |
467 | SET_TMPL_ARGS_LEVEL (new_args, i, TMPL_ARGS_LEVEL (extra_args, j)); | |
c8094d83 | 468 | |
e6f1275f JM |
469 | return new_args; |
470 | } | |
471 | ||
36a117a5 MM |
472 | /* Like add_to_template_args, but only the outermost ARGS are added to |
473 | the EXTRA_ARGS. In particular, all but TMPL_ARGS_DEPTH | |
474 | (EXTRA_ARGS) levels are added. This function is used to combine | |
475 | the template arguments from a partial instantiation with the | |
476 | template arguments used to attain the full instantiation from the | |
477 | partial instantiation. */ | |
98c1c668 | 478 | |
4966381a | 479 | static tree |
3a978d72 | 480 | add_outermost_template_args (tree args, tree extra_args) |
98c1c668 JM |
481 | { |
482 | tree new_args; | |
483 | ||
e4a84209 MM |
484 | /* If there are more levels of EXTRA_ARGS than there are ARGS, |
485 | something very fishy is going on. */ | |
50bc768d | 486 | gcc_assert (TMPL_ARGS_DEPTH (args) >= TMPL_ARGS_DEPTH (extra_args)); |
e4a84209 MM |
487 | |
488 | /* If *all* the new arguments will be the EXTRA_ARGS, just return | |
489 | them. */ | |
490 | if (TMPL_ARGS_DEPTH (args) == TMPL_ARGS_DEPTH (extra_args)) | |
491 | return extra_args; | |
492 | ||
36a117a5 MM |
493 | /* For the moment, we make ARGS look like it contains fewer levels. */ |
494 | TREE_VEC_LENGTH (args) -= TMPL_ARGS_DEPTH (extra_args); | |
c8094d83 | 495 | |
36a117a5 | 496 | new_args = add_to_template_args (args, extra_args); |
98c1c668 | 497 | |
36a117a5 MM |
498 | /* Now, we restore ARGS to its full dimensions. */ |
499 | TREE_VEC_LENGTH (args) += TMPL_ARGS_DEPTH (extra_args); | |
98c1c668 JM |
500 | |
501 | return new_args; | |
502 | } | |
5566b478 | 503 | |
f9a7ae04 MM |
504 | /* Return the N levels of innermost template arguments from the ARGS. */ |
505 | ||
506 | tree | |
3a978d72 | 507 | get_innermost_template_args (tree args, int n) |
f9a7ae04 MM |
508 | { |
509 | tree new_args; | |
510 | int extra_levels; | |
511 | int i; | |
512 | ||
50bc768d | 513 | gcc_assert (n >= 0); |
f9a7ae04 MM |
514 | |
515 | /* If N is 1, just return the innermost set of template arguments. */ | |
516 | if (n == 1) | |
517 | return TMPL_ARGS_LEVEL (args, TMPL_ARGS_DEPTH (args)); | |
c8094d83 | 518 | |
f9a7ae04 MM |
519 | /* If we're not removing anything, just return the arguments we were |
520 | given. */ | |
521 | extra_levels = TMPL_ARGS_DEPTH (args) - n; | |
50bc768d | 522 | gcc_assert (extra_levels >= 0); |
f9a7ae04 MM |
523 | if (extra_levels == 0) |
524 | return args; | |
525 | ||
526 | /* Make a new set of arguments, not containing the outer arguments. */ | |
527 | new_args = make_tree_vec (n); | |
528 | for (i = 1; i <= n; ++i) | |
c8094d83 | 529 | SET_TMPL_ARGS_LEVEL (new_args, i, |
f9a7ae04 MM |
530 | TMPL_ARGS_LEVEL (args, i + extra_levels)); |
531 | ||
532 | return new_args; | |
533 | } | |
534 | ||
dc28490d JM |
535 | /* The inverse of get_innermost_template_args: Return all but the innermost |
536 | EXTRA_LEVELS levels of template arguments from the ARGS. */ | |
537 | ||
538 | static tree | |
539 | strip_innermost_template_args (tree args, int extra_levels) | |
540 | { | |
541 | tree new_args; | |
542 | int n = TMPL_ARGS_DEPTH (args) - extra_levels; | |
543 | int i; | |
544 | ||
545 | gcc_assert (n >= 0); | |
546 | ||
547 | /* If N is 1, just return the outermost set of template arguments. */ | |
548 | if (n == 1) | |
549 | return TMPL_ARGS_LEVEL (args, 1); | |
550 | ||
551 | /* If we're not removing anything, just return the arguments we were | |
552 | given. */ | |
553 | gcc_assert (extra_levels >= 0); | |
554 | if (extra_levels == 0) | |
555 | return args; | |
556 | ||
557 | /* Make a new set of arguments, not containing the inner arguments. */ | |
558 | new_args = make_tree_vec (n); | |
559 | for (i = 1; i <= n; ++i) | |
560 | SET_TMPL_ARGS_LEVEL (new_args, i, | |
561 | TMPL_ARGS_LEVEL (args, i)); | |
562 | ||
563 | return new_args; | |
564 | } | |
565 | ||
5566b478 MS |
566 | /* We've got a template header coming up; push to a new level for storing |
567 | the parms. */ | |
8d08fdba | 568 | |
8d08fdba | 569 | void |
3a978d72 | 570 | begin_template_parm_list (void) |
8d08fdba | 571 | { |
6757edfe MM |
572 | /* We use a non-tag-transparent scope here, which causes pushtag to |
573 | put tags in this scope, rather than in the enclosing class or | |
574 | namespace scope. This is the right thing, since we want | |
575 | TEMPLATE_DECLS, and not TYPE_DECLS for template classes. For a | |
576 | global template class, push_template_decl handles putting the | |
577 | TEMPLATE_DECL into top-level scope. For a nested template class, | |
578 | e.g.: | |
579 | ||
580 | template <class T> struct S1 { | |
0cbd7506 | 581 | template <class T> struct S2 {}; |
6757edfe MM |
582 | }; |
583 | ||
584 | pushtag contains special code to call pushdecl_with_scope on the | |
585 | TEMPLATE_DECL for S2. */ | |
ac20c67a | 586 | begin_scope (sk_template_parms, NULL); |
5156628f | 587 | ++processing_template_decl; |
67ffc812 | 588 | ++processing_template_parmlist; |
386b8a85 JM |
589 | note_template_header (0); |
590 | } | |
591 | ||
6c30752f | 592 | /* This routine is called when a specialization is declared. If it is |
9b910171 LM |
593 | invalid to declare a specialization here, an error is reported and |
594 | false is returned, otherwise this routine will return true. */ | |
6c30752f | 595 | |
9b910171 | 596 | static bool |
3a978d72 | 597 | check_specialization_scope (void) |
6c30752f MM |
598 | { |
599 | tree scope = current_scope (); | |
3ddfb0e6 | 600 | |
c8094d83 MS |
601 | /* [temp.expl.spec] |
602 | ||
6c30752f MM |
603 | An explicit specialization shall be declared in the namespace of |
604 | which the template is a member, or, for member templates, in the | |
605 | namespace of which the enclosing class or enclosing class | |
606 | template is a member. An explicit specialization of a member | |
607 | function, member class or static data member of a class template | |
608 | shall be declared in the namespace of which the class template | |
609 | is a member. */ | |
610 | if (scope && TREE_CODE (scope) != NAMESPACE_DECL) | |
9b910171 LM |
611 | { |
612 | error ("explicit specialization in non-namespace scope %qD", scope); | |
613 | return false; | |
614 | } | |
3ddfb0e6 | 615 | |
c8094d83 | 616 | /* [temp.expl.spec] |
6c30752f MM |
617 | |
618 | In an explicit specialization declaration for a member of a class | |
619 | template or a member template that appears in namespace scope, | |
620 | the member template and some of its enclosing class templates may | |
621 | remain unspecialized, except that the declaration shall not | |
622 | explicitly specialize a class member template if its enclosing | |
623 | class templates are not explicitly specialized as well. */ | |
c8094d83 | 624 | if (current_template_parms) |
9b910171 LM |
625 | { |
626 | error ("enclosing class templates are not explicitly specialized"); | |
627 | return false; | |
628 | } | |
629 | ||
630 | return true; | |
6c30752f MM |
631 | } |
632 | ||
c6002625 | 633 | /* We've just seen template <>. */ |
386b8a85 | 634 | |
9b910171 | 635 | bool |
3a978d72 | 636 | begin_specialization (void) |
386b8a85 | 637 | { |
ac20c67a | 638 | begin_scope (sk_template_spec, NULL); |
386b8a85 | 639 | note_template_header (1); |
9b910171 | 640 | return check_specialization_scope (); |
386b8a85 JM |
641 | } |
642 | ||
dc957d14 | 643 | /* Called at then end of processing a declaration preceded by |
386b8a85 JM |
644 | template<>. */ |
645 | ||
c8094d83 | 646 | void |
3a978d72 | 647 | end_specialization (void) |
386b8a85 | 648 | { |
74b846e0 | 649 | finish_scope (); |
386b8a85 JM |
650 | reset_specialization (); |
651 | } | |
652 | ||
386b8a85 | 653 | /* Any template <>'s that we have seen thus far are not referring to a |
c6002625 | 654 | function specialization. */ |
386b8a85 JM |
655 | |
656 | void | |
3a978d72 | 657 | reset_specialization (void) |
386b8a85 JM |
658 | { |
659 | processing_specialization = 0; | |
660 | template_header_count = 0; | |
661 | } | |
662 | ||
838dfd8a | 663 | /* We've just seen a template header. If SPECIALIZATION is nonzero, |
386b8a85 JM |
664 | it was of the form template <>. */ |
665 | ||
c8094d83 | 666 | static void |
3a978d72 | 667 | note_template_header (int specialization) |
386b8a85 JM |
668 | { |
669 | processing_specialization = specialization; | |
670 | template_header_count++; | |
671 | } | |
672 | ||
75650646 | 673 | /* We're beginning an explicit instantiation. */ |
386b8a85 | 674 | |
75650646 | 675 | void |
3a978d72 | 676 | begin_explicit_instantiation (void) |
386b8a85 | 677 | { |
50bc768d | 678 | gcc_assert (!processing_explicit_instantiation); |
a723baf1 | 679 | processing_explicit_instantiation = true; |
75650646 | 680 | } |
386b8a85 | 681 | |
386b8a85 | 682 | |
75650646 | 683 | void |
3a978d72 | 684 | end_explicit_instantiation (void) |
75650646 | 685 | { |
50bc768d | 686 | gcc_assert (processing_explicit_instantiation); |
a723baf1 | 687 | processing_explicit_instantiation = false; |
75650646 | 688 | } |
386b8a85 | 689 | |
13a44ee0 | 690 | /* An explicit specialization or partial specialization TMPL is being |
b1cc95ce MM |
691 | declared. Check that the namespace in which the specialization is |
692 | occurring is permissible. Returns false iff it is invalid to | |
693 | specialize TMPL in the current namespace. */ | |
c8094d83 | 694 | |
b1cc95ce MM |
695 | static bool |
696 | check_specialization_namespace (tree tmpl) | |
697 | { | |
698 | tree tpl_ns = decl_namespace_context (tmpl); | |
699 | ||
700 | /* [tmpl.expl.spec] | |
c8094d83 | 701 | |
b1cc95ce MM |
702 | An explicit specialization shall be declared in the namespace of |
703 | which the template is a member, or, for member templates, in the | |
704 | namespace of which the enclosing class or enclosing class | |
705 | template is a member. An explicit specialization of a member | |
706 | function, member class or static data member of a class template | |
707 | shall be declared in the namespace of which the class template is | |
708 | a member. */ | |
709 | if (is_associated_namespace (current_namespace, tpl_ns)) | |
710 | /* Same or super-using namespace. */ | |
711 | return true; | |
712 | else | |
713 | { | |
0f51ccfc | 714 | pedwarn ("specialization of %qD in different namespace", tmpl); |
dee15844 | 715 | pedwarn (" from definition of %q+#D", tmpl); |
b1cc95ce MM |
716 | return false; |
717 | } | |
718 | } | |
719 | ||
9c12301f MM |
720 | /* SPEC is an explicit instantiation. Check that it is valid to |
721 | perform this explicit instantiation in the current namespace. */ | |
722 | ||
723 | static void | |
724 | check_explicit_instantiation_namespace (tree spec) | |
725 | { | |
726 | tree ns; | |
727 | ||
728 | /* DR 275: An explicit instantiation shall appear in an enclosing | |
3db45ab5 | 729 | namespace of its template. */ |
9c12301f MM |
730 | ns = decl_namespace_context (spec); |
731 | if (!is_ancestor (current_namespace, ns)) | |
732 | pedwarn ("explicit instantiation of %qD in namespace %qD " | |
312ea236 | 733 | "(which does not enclose namespace %qD)", |
9c12301f MM |
734 | spec, current_namespace, ns); |
735 | } | |
736 | ||
36a117a5 MM |
737 | /* The TYPE is being declared. If it is a template type, that means it |
738 | is a partial specialization. Do appropriate error-checking. */ | |
739 | ||
9ce387d9 | 740 | tree |
3a978d72 | 741 | maybe_process_partial_specialization (tree type) |
36a117a5 | 742 | { |
c9043d03 VR |
743 | tree context; |
744 | ||
745 | if (type == error_mark_node) | |
9ce387d9 VR |
746 | return error_mark_node; |
747 | ||
748 | if (TREE_CODE (type) == BOUND_TEMPLATE_TEMPLATE_PARM) | |
749 | { | |
750 | error ("name of class shadows template template parameter %qD", | |
751 | TYPE_NAME (type)); | |
752 | return error_mark_node; | |
753 | } | |
c9043d03 VR |
754 | |
755 | context = TYPE_CONTEXT (type); | |
6e049fcd | 756 | |
a723baf1 | 757 | if (CLASS_TYPE_P (type) && CLASSTYPE_USE_TEMPLATE (type)) |
36a117a5 | 758 | { |
6e049fcd KL |
759 | /* This is for ordinary explicit specialization and partial |
760 | specialization of a template class such as: | |
761 | ||
762 | template <> class C<int>; | |
763 | ||
764 | or: | |
765 | ||
766 | template <class T> class C<T*>; | |
767 | ||
768 | Make sure that `C<int>' and `C<T*>' are implicit instantiations. */ | |
769 | ||
36a117a5 | 770 | if (CLASSTYPE_IMPLICIT_INSTANTIATION (type) |
d0f062fb | 771 | && !COMPLETE_TYPE_P (type)) |
36a117a5 | 772 | { |
b1cc95ce | 773 | check_specialization_namespace (CLASSTYPE_TI_TEMPLATE (type)); |
370af2d5 | 774 | SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (type); |
36a117a5 MM |
775 | if (processing_template_decl) |
776 | push_template_decl (TYPE_MAIN_DECL (type)); | |
777 | } | |
778 | else if (CLASSTYPE_TEMPLATE_INSTANTIATION (type)) | |
0f51ccfc | 779 | error ("specialization of %qT after instantiation", type); |
36a117a5 | 780 | } |
6e049fcd KL |
781 | else if (CLASS_TYPE_P (type) |
782 | && !CLASSTYPE_USE_TEMPLATE (type) | |
783 | && CLASSTYPE_TEMPLATE_INFO (type) | |
784 | && context && CLASS_TYPE_P (context) | |
785 | && CLASSTYPE_TEMPLATE_INFO (context)) | |
786 | { | |
787 | /* This is for an explicit specialization of member class | |
788 | template according to [temp.expl.spec/18]: | |
789 | ||
790 | template <> template <class U> class C<int>::D; | |
791 | ||
792 | The context `C<int>' must be an implicit instantiation. | |
793 | Otherwise this is just a member class template declared | |
794 | earlier like: | |
795 | ||
796 | template <> class C<int> { template <class U> class D; }; | |
797 | template <> template <class U> class C<int>::D; | |
798 | ||
799 | In the first case, `C<int>::D' is a specialization of `C<T>::D' | |
800 | while in the second case, `C<int>::D' is a primary template | |
801 | and `C<T>::D' may not exist. */ | |
802 | ||
803 | if (CLASSTYPE_IMPLICIT_INSTANTIATION (context) | |
804 | && !COMPLETE_TYPE_P (type)) | |
805 | { | |
806 | tree t; | |
807 | ||
808 | if (current_namespace | |
809 | != decl_namespace_context (CLASSTYPE_TI_TEMPLATE (type))) | |
810 | { | |
0f51ccfc | 811 | pedwarn ("specializing %q#T in different namespace", type); |
dee15844 JM |
812 | pedwarn (" from definition of %q+#D", |
813 | CLASSTYPE_TI_TEMPLATE (type)); | |
6e049fcd KL |
814 | } |
815 | ||
816 | /* Check for invalid specialization after instantiation: | |
817 | ||
818 | template <> template <> class C<int>::D<int>; | |
819 | template <> template <class U> class C<int>::D; */ | |
820 | ||
821 | for (t = DECL_TEMPLATE_INSTANTIATIONS | |
822 | (most_general_template (CLASSTYPE_TI_TEMPLATE (type))); | |
823 | t; t = TREE_CHAIN (t)) | |
824 | if (TREE_VALUE (t) != type | |
825 | && TYPE_CONTEXT (TREE_VALUE (t)) == context) | |
0f51ccfc | 826 | error ("specialization %qT after instantiation %qT", |
6e049fcd KL |
827 | type, TREE_VALUE (t)); |
828 | ||
829 | /* Mark TYPE as a specialization. And as a result, we only | |
830 | have one level of template argument for the innermost | |
831 | class template. */ | |
832 | SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (type); | |
833 | CLASSTYPE_TI_ARGS (type) | |
834 | = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type)); | |
835 | } | |
836 | } | |
20496fa2 | 837 | else if (processing_specialization) |
9ce387d9 VR |
838 | { |
839 | error ("explicit specialization of non-template %qT", type); | |
840 | return error_mark_node; | |
841 | } | |
842 | ||
843 | return type; | |
36a117a5 MM |
844 | } |
845 | ||
ee81147e | 846 | /* Returns nonzero if we can optimize the retrieval of specializations |
c7222c02 MM |
847 | for TMPL, a TEMPLATE_DECL. In particular, for such a template, we |
848 | do not use DECL_TEMPLATE_SPECIALIZATIONS at all. */ | |
849 | ||
c8094d83 | 850 | static inline bool |
c7222c02 MM |
851 | optimize_specialization_lookup_p (tree tmpl) |
852 | { | |
853 | return (DECL_FUNCTION_TEMPLATE_P (tmpl) | |
854 | && DECL_CLASS_SCOPE_P (tmpl) | |
855 | /* DECL_CLASS_SCOPE_P holds of T::f even if T is a template | |
856 | parameter. */ | |
857 | && CLASS_TYPE_P (DECL_CONTEXT (tmpl)) | |
1ca939e5 MM |
858 | /* The optimized lookup depends on the fact that the |
859 | template arguments for the member function template apply | |
860 | purely to the containing class, which is not true if the | |
861 | containing class is an explicit or partial | |
862 | specialization. */ | |
863 | && !CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (tmpl)) | |
c7222c02 MM |
864 | && !DECL_MEMBER_TEMPLATE_P (tmpl) |
865 | && !DECL_CONV_FN_P (tmpl) | |
866 | /* It is possible to have a template that is not a member | |
867 | template and is not a member of a template class: | |
c8094d83 MS |
868 | |
869 | template <typename T> | |
c7222c02 | 870 | struct S { friend A::f(); }; |
c8094d83 | 871 | |
c7222c02 MM |
872 | Here, the friend function is a template, but the context does |
873 | not have template information. The optimized lookup relies | |
874 | on having ARGS be the template arguments for both the class | |
875 | and the function template. */ | |
876 | && !DECL_FRIEND_P (DECL_TEMPLATE_RESULT (tmpl))); | |
877 | } | |
878 | ||
75650646 MM |
879 | /* Retrieve the specialization (in the sense of [temp.spec] - a |
880 | specialization is either an instantiation or an explicit | |
881 | specialization) of TMPL for the given template ARGS. If there is | |
882 | no such specialization, return NULL_TREE. The ARGS are a vector of | |
883 | arguments, or a vector of vectors of arguments, in the case of | |
c8094d83 | 884 | templates with more than one level of parameters. |
c7222c02 MM |
885 | |
886 | If TMPL is a type template and CLASS_SPECIALIZATIONS_P is true, | |
887 | then we search for a partial specialization matching ARGS. This | |
888 | parameter is ignored if TMPL is not a class template. */ | |
c8094d83 | 889 | |
75650646 | 890 | static tree |
c8094d83 | 891 | retrieve_specialization (tree tmpl, tree args, |
c7222c02 | 892 | bool class_specializations_p) |
75650646 | 893 | { |
2d8ba2c7 LM |
894 | if (args == error_mark_node) |
895 | return NULL_TREE; | |
896 | ||
50bc768d | 897 | gcc_assert (TREE_CODE (tmpl) == TEMPLATE_DECL); |
75650646 | 898 | |
36a117a5 MM |
899 | /* There should be as many levels of arguments as there are |
900 | levels of parameters. */ | |
c8094d83 | 901 | gcc_assert (TMPL_ARGS_DEPTH (args) |
50bc768d | 902 | == TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl))); |
c8094d83 | 903 | |
c7222c02 MM |
904 | if (optimize_specialization_lookup_p (tmpl)) |
905 | { | |
906 | tree class_template; | |
907 | tree class_specialization; | |
d4e6fecb | 908 | VEC(tree,gc) *methods; |
c7222c02 MM |
909 | tree fns; |
910 | int idx; | |
911 | ||
912 | /* The template arguments actually apply to the containing | |
913 | class. Find the class specialization with those | |
914 | arguments. */ | |
915 | class_template = CLASSTYPE_TI_TEMPLATE (DECL_CONTEXT (tmpl)); | |
c8094d83 | 916 | class_specialization |
c7222c02 MM |
917 | = retrieve_specialization (class_template, args, |
918 | /*class_specializations_p=*/false); | |
919 | if (!class_specialization) | |
920 | return NULL_TREE; | |
921 | /* Now, find the appropriate entry in the CLASSTYPE_METHOD_VEC | |
922 | for the specialization. */ | |
923 | idx = class_method_index_for_fn (class_specialization, tmpl); | |
924 | if (idx == -1) | |
925 | return NULL_TREE; | |
926 | /* Iterate through the methods with the indicated name, looking | |
927 | for the one that has an instance of TMPL. */ | |
928 | methods = CLASSTYPE_METHOD_VEC (class_specialization); | |
929 | for (fns = VEC_index (tree, methods, idx); fns; fns = OVL_NEXT (fns)) | |
930 | { | |
931 | tree fn = OVL_CURRENT (fns); | |
932 | if (DECL_TEMPLATE_INFO (fn) && DECL_TI_TEMPLATE (fn) == tmpl) | |
933 | return fn; | |
934 | } | |
935 | return NULL_TREE; | |
936 | } | |
937 | else | |
938 | { | |
939 | tree *sp; | |
940 | tree *head; | |
941 | ||
942 | /* Class templates store their instantiations on the | |
943 | DECL_TEMPLATE_INSTANTIATIONS list; other templates use the | |
944 | DECL_TEMPLATE_SPECIALIZATIONS list. */ | |
945 | if (!class_specializations_p | |
56d0c6e3 JM |
946 | && TREE_CODE (DECL_TEMPLATE_RESULT (tmpl)) == TYPE_DECL |
947 | && TAGGED_TYPE_P (TREE_TYPE (tmpl))) | |
c7222c02 MM |
948 | sp = &DECL_TEMPLATE_INSTANTIATIONS (tmpl); |
949 | else | |
950 | sp = &DECL_TEMPLATE_SPECIALIZATIONS (tmpl); | |
951 | head = sp; | |
952 | /* Iterate through the list until we find a matching template. */ | |
953 | while (*sp != NULL_TREE) | |
954 | { | |
955 | tree spec = *sp; | |
c8094d83 | 956 | |
c7222c02 MM |
957 | if (comp_template_args (TREE_PURPOSE (spec), args)) |
958 | { | |
959 | /* Use the move-to-front heuristic to speed up future | |
c8094d83 | 960 | searches. */ |
c7222c02 MM |
961 | if (spec != *head) |
962 | { | |
963 | *sp = TREE_CHAIN (*sp); | |
964 | TREE_CHAIN (spec) = *head; | |
965 | *head = spec; | |
966 | } | |
967 | return TREE_VALUE (spec); | |
968 | } | |
969 | sp = &TREE_CHAIN (spec); | |
970 | } | |
971 | } | |
75650646 MM |
972 | |
973 | return NULL_TREE; | |
386b8a85 JM |
974 | } |
975 | ||
dc957d14 | 976 | /* Like retrieve_specialization, but for local declarations. */ |
9188c363 MM |
977 | |
978 | static tree | |
3a978d72 | 979 | retrieve_local_specialization (tree tmpl) |
9188c363 | 980 | { |
29b0d1fd JM |
981 | tree spec; |
982 | ||
983 | if (local_specializations == NULL) | |
984 | return NULL_TREE; | |
985 | ||
986 | spec = (tree) htab_find_with_hash (local_specializations, tmpl, | |
987 | htab_hash_pointer (tmpl)); | |
a723baf1 | 988 | return spec ? TREE_PURPOSE (spec) : NULL_TREE; |
9188c363 MM |
989 | } |
990 | ||
838dfd8a | 991 | /* Returns nonzero iff DECL is a specialization of TMPL. */ |
6757edfe MM |
992 | |
993 | int | |
3a978d72 | 994 | is_specialization_of (tree decl, tree tmpl) |
6757edfe MM |
995 | { |
996 | tree t; | |
997 | ||
998 | if (TREE_CODE (decl) == FUNCTION_DECL) | |
999 | { | |
c8094d83 | 1000 | for (t = decl; |
6757edfe MM |
1001 | t != NULL_TREE; |
1002 | t = DECL_TEMPLATE_INFO (t) ? DECL_TI_TEMPLATE (t) : NULL_TREE) | |
1003 | if (t == tmpl) | |
1004 | return 1; | |
1005 | } | |
c8094d83 | 1006 | else |
6757edfe | 1007 | { |
50bc768d | 1008 | gcc_assert (TREE_CODE (decl) == TYPE_DECL); |
6757edfe MM |
1009 | |
1010 | for (t = TREE_TYPE (decl); | |
1011 | t != NULL_TREE; | |
1012 | t = CLASSTYPE_USE_TEMPLATE (t) | |
1013 | ? TREE_TYPE (CLASSTYPE_TI_TEMPLATE (t)) : NULL_TREE) | |
9edc3913 | 1014 | if (same_type_ignoring_top_level_qualifiers_p (t, TREE_TYPE (tmpl))) |
6757edfe | 1015 | return 1; |
c8094d83 | 1016 | } |
386b8a85 | 1017 | |
6757edfe MM |
1018 | return 0; |
1019 | } | |
75650646 | 1020 | |
d43f603d KL |
1021 | /* Returns nonzero iff DECL is a specialization of friend declaration |
1022 | FRIEND according to [temp.friend]. */ | |
1023 | ||
1024 | bool | |
1025 | is_specialization_of_friend (tree decl, tree friend) | |
1026 | { | |
1027 | bool need_template = true; | |
1028 | int template_depth; | |
1029 | ||
b939a023 KL |
1030 | gcc_assert (TREE_CODE (decl) == FUNCTION_DECL |
1031 | || TREE_CODE (decl) == TYPE_DECL); | |
d43f603d KL |
1032 | |
1033 | /* For [temp.friend/6] when FRIEND is an ordinary member function | |
1034 | of a template class, we want to check if DECL is a specialization | |
1035 | if this. */ | |
1036 | if (TREE_CODE (friend) == FUNCTION_DECL | |
1037 | && DECL_TEMPLATE_INFO (friend) | |
1038 | && !DECL_USE_TEMPLATE (friend)) | |
1039 | { | |
b939a023 | 1040 | /* We want a TEMPLATE_DECL for `is_specialization_of'. */ |
d43f603d KL |
1041 | friend = DECL_TI_TEMPLATE (friend); |
1042 | need_template = false; | |
1043 | } | |
b939a023 KL |
1044 | else if (TREE_CODE (friend) == TEMPLATE_DECL |
1045 | && !PRIMARY_TEMPLATE_P (friend)) | |
1046 | need_template = false; | |
d43f603d KL |
1047 | |
1048 | /* There is nothing to do if this is not a template friend. */ | |
1049 | if (TREE_CODE (friend) != TEMPLATE_DECL) | |
b939a023 | 1050 | return false; |
d43f603d KL |
1051 | |
1052 | if (is_specialization_of (decl, friend)) | |
b939a023 | 1053 | return true; |
d43f603d KL |
1054 | |
1055 | /* [temp.friend/6] | |
1056 | A member of a class template may be declared to be a friend of a | |
1057 | non-template class. In this case, the corresponding member of | |
1058 | every specialization of the class template is a friend of the | |
1059 | class granting friendship. | |
c8094d83 | 1060 | |
d43f603d KL |
1061 | For example, given a template friend declaration |
1062 | ||
1063 | template <class T> friend void A<T>::f(); | |
1064 | ||
1065 | the member function below is considered a friend | |
1066 | ||
1067 | template <> struct A<int> { | |
1068 | void f(); | |
1069 | }; | |
1070 | ||
1071 | For this type of template friend, TEMPLATE_DEPTH below will be | |
5c425df5 | 1072 | nonzero. To determine if DECL is a friend of FRIEND, we first |
d43f603d KL |
1073 | check if the enclosing class is a specialization of another. */ |
1074 | ||
1075 | template_depth = template_class_depth (DECL_CONTEXT (friend)); | |
1076 | if (template_depth | |
1077 | && DECL_CLASS_SCOPE_P (decl) | |
c8094d83 | 1078 | && is_specialization_of (TYPE_NAME (DECL_CONTEXT (decl)), |
d43f603d KL |
1079 | CLASSTYPE_TI_TEMPLATE (DECL_CONTEXT (friend)))) |
1080 | { | |
1081 | /* Next, we check the members themselves. In order to handle | |
b939a023 | 1082 | a few tricky cases, such as when FRIEND's are |
d43f603d KL |
1083 | |
1084 | template <class T> friend void A<T>::g(T t); | |
1085 | template <class T> template <T t> friend void A<T>::h(); | |
1086 | ||
b939a023 KL |
1087 | and DECL's are |
1088 | ||
1089 | void A<int>::g(int); | |
1090 | template <int> void A<int>::h(); | |
1091 | ||
1092 | we need to figure out ARGS, the template arguments from | |
1093 | the context of DECL. This is required for template substitution | |
1094 | of `T' in the function parameter of `g' and template parameter | |
1095 | of `h' in the above examples. Here ARGS corresponds to `int'. */ | |
d43f603d KL |
1096 | |
1097 | tree context = DECL_CONTEXT (decl); | |
1098 | tree args = NULL_TREE; | |
1099 | int current_depth = 0; | |
b939a023 | 1100 | |
d43f603d KL |
1101 | while (current_depth < template_depth) |
1102 | { | |
1103 | if (CLASSTYPE_TEMPLATE_INFO (context)) | |
1104 | { | |
1105 | if (current_depth == 0) | |
1106 | args = TYPE_TI_ARGS (context); | |
1107 | else | |
1108 | args = add_to_template_args (TYPE_TI_ARGS (context), args); | |
1109 | current_depth++; | |
1110 | } | |
1111 | context = TYPE_CONTEXT (context); | |
1112 | } | |
1113 | ||
1114 | if (TREE_CODE (decl) == FUNCTION_DECL) | |
1115 | { | |
1116 | bool is_template; | |
1117 | tree friend_type; | |
1118 | tree decl_type; | |
1119 | tree friend_args_type; | |
1120 | tree decl_args_type; | |
1121 | ||
1122 | /* Make sure that both DECL and FRIEND are templates or | |
1123 | non-templates. */ | |
1124 | is_template = DECL_TEMPLATE_INFO (decl) | |
1125 | && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl)); | |
1126 | if (need_template ^ is_template) | |
b939a023 | 1127 | return false; |
d43f603d KL |
1128 | else if (is_template) |
1129 | { | |
da1d7781 | 1130 | /* If both are templates, check template parameter list. */ |
d43f603d KL |
1131 | tree friend_parms |
1132 | = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend), | |
1133 | args, tf_none); | |
1134 | if (!comp_template_parms | |
1135 | (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (decl)), | |
1136 | friend_parms)) | |
b939a023 | 1137 | return false; |
d43f603d KL |
1138 | |
1139 | decl_type = TREE_TYPE (DECL_TI_TEMPLATE (decl)); | |
1140 | } | |
1141 | else | |
1142 | decl_type = TREE_TYPE (decl); | |
1143 | ||
1144 | friend_type = tsubst_function_type (TREE_TYPE (friend), args, | |
1145 | tf_none, NULL_TREE); | |
1146 | if (friend_type == error_mark_node) | |
b939a023 | 1147 | return false; |
d43f603d KL |
1148 | |
1149 | /* Check if return types match. */ | |
1150 | if (!same_type_p (TREE_TYPE (decl_type), TREE_TYPE (friend_type))) | |
b939a023 | 1151 | return false; |
d43f603d KL |
1152 | |
1153 | /* Check if function parameter types match, ignoring the | |
1154 | `this' parameter. */ | |
1155 | friend_args_type = TYPE_ARG_TYPES (friend_type); | |
1156 | decl_args_type = TYPE_ARG_TYPES (decl_type); | |
1157 | if (DECL_NONSTATIC_MEMBER_FUNCTION_P (friend)) | |
1158 | friend_args_type = TREE_CHAIN (friend_args_type); | |
1159 | if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl)) | |
1160 | decl_args_type = TREE_CHAIN (decl_args_type); | |
b939a023 KL |
1161 | |
1162 | return compparms (decl_args_type, friend_args_type); | |
1163 | } | |
1164 | else | |
1165 | { | |
1166 | /* DECL is a TYPE_DECL */ | |
1167 | bool is_template; | |
1168 | tree decl_type = TREE_TYPE (decl); | |
1169 | ||
1170 | /* Make sure that both DECL and FRIEND are templates or | |
1171 | non-templates. */ | |
1172 | is_template | |
1173 | = CLASSTYPE_TEMPLATE_INFO (decl_type) | |
1174 | && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (decl_type)); | |
1175 | ||
1176 | if (need_template ^ is_template) | |
1177 | return false; | |
1178 | else if (is_template) | |
1179 | { | |
1180 | tree friend_parms; | |
1181 | /* If both are templates, check the name of the two | |
1182 | TEMPLATE_DECL's first because is_friend didn't. */ | |
1183 | if (DECL_NAME (CLASSTYPE_TI_TEMPLATE (decl_type)) | |
1184 | != DECL_NAME (friend)) | |
1185 | return false; | |
1186 | ||
1187 | /* Now check template parameter list. */ | |
1188 | friend_parms | |
1189 | = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend), | |
1190 | args, tf_none); | |
1191 | return comp_template_parms | |
1192 | (DECL_TEMPLATE_PARMS (CLASSTYPE_TI_TEMPLATE (decl_type)), | |
1193 | friend_parms); | |
1194 | } | |
1195 | else | |
1196 | return (DECL_NAME (decl) | |
1197 | == DECL_NAME (friend)); | |
d43f603d KL |
1198 | } |
1199 | } | |
b939a023 | 1200 | return false; |
d43f603d KL |
1201 | } |
1202 | ||
75650646 | 1203 | /* Register the specialization SPEC as a specialization of TMPL with |
d63d5d0c ILT |
1204 | the indicated ARGS. IS_FRIEND indicates whether the specialization |
1205 | is actually just a friend declaration. Returns SPEC, or an | |
1206 | equivalent prior declaration, if available. */ | |
75650646 | 1207 | |
36a117a5 | 1208 | static tree |
d63d5d0c | 1209 | register_specialization (tree spec, tree tmpl, tree args, bool is_friend) |
75650646 | 1210 | { |
c7222c02 | 1211 | tree fn; |
75650646 | 1212 | |
50bc768d | 1213 | gcc_assert (TREE_CODE (tmpl) == TEMPLATE_DECL); |
75650646 | 1214 | |
c8094d83 | 1215 | if (TREE_CODE (spec) == FUNCTION_DECL |
36a117a5 MM |
1216 | && uses_template_parms (DECL_TI_ARGS (spec))) |
1217 | /* This is the FUNCTION_DECL for a partial instantiation. Don't | |
1218 | register it; we want the corresponding TEMPLATE_DECL instead. | |
1219 | We use `uses_template_parms (DECL_TI_ARGS (spec))' rather than | |
1220 | the more obvious `uses_template_parms (spec)' to avoid problems | |
1221 | with default function arguments. In particular, given | |
1222 | something like this: | |
1223 | ||
0cbd7506 | 1224 | template <class T> void f(T t1, T t = T()) |
36a117a5 MM |
1225 | |
1226 | the default argument expression is not substituted for in an | |
1227 | instantiation unless and until it is actually needed. */ | |
1228 | return spec; | |
28ba38e3 | 1229 | |
c8094d83 | 1230 | fn = retrieve_specialization (tmpl, args, |
c7222c02 MM |
1231 | /*class_specializations_p=*/false); |
1232 | /* We can sometimes try to re-register a specialization that we've | |
1233 | already got. In particular, regenerate_decl_from_template calls | |
1234 | duplicate_decls which will update the specialization list. But, | |
1235 | we'll still get called again here anyhow. It's more convenient | |
1236 | to simply allow this than to try to prevent it. */ | |
1237 | if (fn == spec) | |
1238 | return spec; | |
1239 | else if (fn && DECL_TEMPLATE_SPECIALIZATION (spec)) | |
22e9174f | 1240 | { |
c7222c02 | 1241 | if (DECL_TEMPLATE_INSTANTIATION (fn)) |
22e9174f | 1242 | { |
c8094d83 | 1243 | if (TREE_USED (fn) |
c7222c02 | 1244 | || DECL_EXPLICIT_INSTANTIATION (fn)) |
22e9174f | 1245 | { |
c7222c02 MM |
1246 | error ("specialization of %qD after instantiation", |
1247 | fn); | |
99f4234a | 1248 | return error_mark_node; |
22e9174f | 1249 | } |
c7222c02 | 1250 | else |
b1cc95ce | 1251 | { |
a39041fa | 1252 | tree clone; |
c7222c02 MM |
1253 | /* This situation should occur only if the first |
1254 | specialization is an implicit instantiation, the | |
1255 | second is an explicit specialization, and the | |
1256 | implicit instantiation has not yet been used. That | |
1257 | situation can occur if we have implicitly | |
1258 | instantiated a member function and then specialized | |
1259 | it later. | |
c8094d83 | 1260 | |
c7222c02 MM |
1261 | We can also wind up here if a friend declaration that |
1262 | looked like an instantiation turns out to be a | |
1263 | specialization: | |
c8094d83 | 1264 | |
c7222c02 MM |
1265 | template <class T> void foo(T); |
1266 | class S { friend void foo<>(int) }; | |
c8094d83 MS |
1267 | template <> void foo(int); |
1268 | ||
c7222c02 MM |
1269 | We transform the existing DECL in place so that any |
1270 | pointers to it become pointers to the updated | |
1271 | declaration. | |
1272 | ||
1273 | If there was a definition for the template, but not | |
1274 | for the specialization, we want this to look as if | |
1275 | there were no definition, and vice versa. */ | |
1276 | DECL_INITIAL (fn) = NULL_TREE; | |
d63d5d0c | 1277 | duplicate_decls (spec, fn, is_friend); |
a39041fa | 1278 | /* The call to duplicate_decls will have applied |
3db45ab5 | 1279 | [temp.expl.spec]: |
a39041fa | 1280 | |
3db45ab5 | 1281 | An explicit specialization of a function template |
a39041fa | 1282 | is inline only if it is explicitly declared to be, |
bcf51da2 | 1283 | and independently of whether its function template |
a39041fa MM |
1284 | is. |
1285 | ||
1286 | to the primary function; now copy the inline bits to | |
3db45ab5 | 1287 | the various clones. */ |
a39041fa MM |
1288 | FOR_EACH_CLONE (clone, fn) |
1289 | { | |
1290 | DECL_DECLARED_INLINE_P (clone) | |
1291 | = DECL_DECLARED_INLINE_P (fn); | |
1292 | DECL_INLINE (clone) | |
1293 | = DECL_INLINE (fn); | |
1294 | } | |
9c12301f | 1295 | check_specialization_namespace (fn); |
c8094d83 | 1296 | |
b1cc95ce MM |
1297 | return fn; |
1298 | } | |
22e9174f | 1299 | } |
c7222c02 MM |
1300 | else if (DECL_TEMPLATE_SPECIALIZATION (fn)) |
1301 | { | |
d63d5d0c | 1302 | if (!duplicate_decls (spec, fn, is_friend) && DECL_INITIAL (spec)) |
c7222c02 MM |
1303 | /* Dup decl failed, but this is a new definition. Set the |
1304 | line number so any errors match this new | |
1305 | definition. */ | |
1306 | DECL_SOURCE_LOCATION (fn) = DECL_SOURCE_LOCATION (spec); | |
c8094d83 | 1307 | |
c7222c02 MM |
1308 | return fn; |
1309 | } | |
b1cc95ce MM |
1310 | } |
1311 | ||
1312 | /* A specialization must be declared in the same namespace as the | |
1313 | template it is specializing. */ | |
1314 | if (DECL_TEMPLATE_SPECIALIZATION (spec) | |
1315 | && !check_specialization_namespace (tmpl)) | |
74b0d490 | 1316 | DECL_CONTEXT (spec) = FROB_CONTEXT (decl_namespace_context (tmpl)); |
75650646 | 1317 | |
c7222c02 MM |
1318 | if (!optimize_specialization_lookup_p (tmpl)) |
1319 | DECL_TEMPLATE_SPECIALIZATIONS (tmpl) | |
1320 | = tree_cons (args, spec, DECL_TEMPLATE_SPECIALIZATIONS (tmpl)); | |
36a117a5 MM |
1321 | |
1322 | return spec; | |
1323 | } | |
1324 | ||
1325 | /* Unregister the specialization SPEC as a specialization of TMPL. | |
b3445994 MM |
1326 | Replace it with NEW_SPEC, if NEW_SPEC is non-NULL. Returns true |
1327 | if the SPEC was listed as a specialization of TMPL. */ | |
36a117a5 | 1328 | |
b3445994 MM |
1329 | bool |
1330 | reregister_specialization (tree spec, tree tmpl, tree new_spec) | |
36a117a5 MM |
1331 | { |
1332 | tree* s; | |
1333 | ||
1334 | for (s = &DECL_TEMPLATE_SPECIALIZATIONS (tmpl); | |
1335 | *s != NULL_TREE; | |
1336 | s = &TREE_CHAIN (*s)) | |
1337 | if (TREE_VALUE (*s) == spec) | |
1338 | { | |
b3445994 MM |
1339 | if (!new_spec) |
1340 | *s = TREE_CHAIN (*s); | |
1341 | else | |
a3d87771 | 1342 | TREE_VALUE (*s) = new_spec; |
36a117a5 MM |
1343 | return 1; |
1344 | } | |
1345 | ||
1346 | return 0; | |
75650646 MM |
1347 | } |
1348 | ||
a723baf1 MM |
1349 | /* Compare an entry in the local specializations hash table P1 (which |
1350 | is really a pointer to a TREE_LIST) with P2 (which is really a | |
1351 | DECL). */ | |
1352 | ||
1353 | static int | |
1354 | eq_local_specializations (const void *p1, const void *p2) | |
1355 | { | |
741ac903 | 1356 | return TREE_VALUE ((const_tree) p1) == (const_tree) p2; |
a723baf1 MM |
1357 | } |
1358 | ||
69f794a7 MM |
1359 | /* Hash P1, an entry in the local specializations table. */ |
1360 | ||
1361 | static hashval_t | |
1362 | hash_local_specialization (const void* p1) | |
1363 | { | |
741ac903 | 1364 | return htab_hash_pointer (TREE_VALUE ((const_tree) p1)); |
69f794a7 MM |
1365 | } |
1366 | ||
6dfbb909 MM |
1367 | /* Like register_specialization, but for local declarations. We are |
1368 | registering SPEC, an instantiation of TMPL. */ | |
9188c363 | 1369 | |
414ea4aa | 1370 | static void |
3a978d72 | 1371 | register_local_specialization (tree spec, tree tmpl) |
9188c363 | 1372 | { |
6dfbb909 MM |
1373 | void **slot; |
1374 | ||
c8094d83 | 1375 | slot = htab_find_slot_with_hash (local_specializations, tmpl, |
69f794a7 | 1376 | htab_hash_pointer (tmpl), INSERT); |
a723baf1 | 1377 | *slot = build_tree_list (spec, tmpl); |
9188c363 MM |
1378 | } |
1379 | ||
9ba7a2f2 MM |
1380 | /* TYPE is a class type. Returns true if TYPE is an explicitly |
1381 | specialized class. */ | |
1382 | ||
1383 | bool | |
1384 | explicit_class_specialization_p (tree type) | |
1385 | { | |
1386 | if (!CLASSTYPE_TEMPLATE_SPECIALIZATION (type)) | |
1387 | return false; | |
1388 | return !uses_template_parms (CLASSTYPE_TI_ARGS (type)); | |
1389 | } | |
1390 | ||
e1467ff2 MM |
1391 | /* Print the list of candidate FNS in an error message. */ |
1392 | ||
104bf76a | 1393 | void |
3a978d72 | 1394 | print_candidates (tree fns) |
e1467ff2 MM |
1395 | { |
1396 | tree fn; | |
1397 | ||
d8e178a0 | 1398 | const char *str = "candidates are:"; |
e1467ff2 MM |
1399 | |
1400 | for (fn = fns; fn != NULL_TREE; fn = TREE_CHAIN (fn)) | |
1401 | { | |
d6479fe7 MM |
1402 | tree f; |
1403 | ||
1404 | for (f = TREE_VALUE (fn); f; f = OVL_NEXT (f)) | |
dee15844 | 1405 | error ("%s %+#D", str, OVL_CURRENT (f)); |
e1467ff2 MM |
1406 | str = " "; |
1407 | } | |
1408 | } | |
1409 | ||
75650646 | 1410 | /* Returns the template (one of the functions given by TEMPLATE_ID) |
e1467ff2 | 1411 | which can be specialized to match the indicated DECL with the |
03017874 MM |
1412 | explicit template args given in TEMPLATE_ID. The DECL may be |
1413 | NULL_TREE if none is available. In that case, the functions in | |
1414 | TEMPLATE_ID are non-members. | |
1415 | ||
838dfd8a | 1416 | If NEED_MEMBER_TEMPLATE is nonzero the function is known to be a |
03017874 MM |
1417 | specialization of a member template. |
1418 | ||
5fe7b654 GB |
1419 | The TEMPLATE_COUNT is the number of references to qualifying |
1420 | template classes that appeared in the name of the function. See | |
1421 | check_explicit_specialization for a more accurate description. | |
1422 | ||
29a1da1c MM |
1423 | TSK indicates what kind of template declaration (if any) is being |
1424 | declared. TSK_TEMPLATE indicates that the declaration given by | |
1425 | DECL, though a FUNCTION_DECL, has template parameters, and is | |
1426 | therefore a template function. | |
1427 | ||
03017874 MM |
1428 | The template args (those explicitly specified and those deduced) |
1429 | are output in a newly created vector *TARGS_OUT. | |
1430 | ||
1431 | If it is impossible to determine the result, an error message is | |
bf8f3f93 | 1432 | issued. The error_mark_node is returned to indicate failure. */ |
75650646 | 1433 | |
e9659ab0 | 1434 | static tree |
c8094d83 | 1435 | determine_specialization (tree template_id, |
0cbd7506 MS |
1436 | tree decl, |
1437 | tree* targs_out, | |
5fe7b654 | 1438 | int need_member_template, |
29a1da1c MM |
1439 | int template_count, |
1440 | tmpl_spec_kind tsk) | |
386b8a85 | 1441 | { |
03017874 MM |
1442 | tree fns; |
1443 | tree targs; | |
1444 | tree explicit_targs; | |
1445 | tree candidates = NULL_TREE; | |
7ca383e6 MM |
1446 | /* A TREE_LIST of templates of which DECL may be a specialization. |
1447 | The TREE_VALUE of each node is a TEMPLATE_DECL. The | |
1448 | corresponding TREE_PURPOSE is the set of template arguments that, | |
1449 | when used to instantiate the template, would produce a function | |
1450 | with the signature of DECL. */ | |
03017874 | 1451 | tree templates = NULL_TREE; |
5fe7b654 GB |
1452 | int header_count; |
1453 | struct cp_binding_level *b; | |
386b8a85 | 1454 | |
e1467ff2 MM |
1455 | *targs_out = NULL_TREE; |
1456 | ||
728da672 | 1457 | if (template_id == error_mark_node || decl == error_mark_node) |
f2e48b67 BK |
1458 | return error_mark_node; |
1459 | ||
1460 | fns = TREE_OPERAND (template_id, 0); | |
03017874 | 1461 | explicit_targs = TREE_OPERAND (template_id, 1); |
f2e48b67 | 1462 | |
27fafc8d JM |
1463 | if (fns == error_mark_node) |
1464 | return error_mark_node; | |
1465 | ||
c6002625 | 1466 | /* Check for baselinks. */ |
91e490ab | 1467 | if (BASELINK_P (fns)) |
da15dae6 | 1468 | fns = BASELINK_FUNCTIONS (fns); |
386b8a85 | 1469 | |
91e490ab MM |
1470 | if (!is_overloaded_fn (fns)) |
1471 | { | |
0f51ccfc | 1472 | error ("%qD is not a function template", fns); |
91e490ab MM |
1473 | return error_mark_node; |
1474 | } | |
1475 | ||
5fe7b654 GB |
1476 | /* Count the number of template headers specified for this |
1477 | specialization. */ | |
1478 | header_count = 0; | |
c8094d83 | 1479 | for (b = current_binding_level; |
98f99d7f | 1480 | b->kind == sk_template_parms; |
5fe7b654 GB |
1481 | b = b->level_chain) |
1482 | ++header_count; | |
1483 | ||
2c73f9f5 | 1484 | for (; fns; fns = OVL_NEXT (fns)) |
386b8a85 | 1485 | { |
9dfce8fd | 1486 | tree fn = OVL_CURRENT (fns); |
03017874 MM |
1487 | |
1488 | if (TREE_CODE (fn) == TEMPLATE_DECL) | |
d955f6ea KL |
1489 | { |
1490 | tree decl_arg_types; | |
0da99d4e | 1491 | tree fn_arg_types; |
d955f6ea | 1492 | |
5fe7b654 GB |
1493 | /* In case of explicit specialization, we need to check if |
1494 | the number of template headers appearing in the specialization | |
1495 | is correct. This is usually done in check_explicit_specialization, | |
1496 | but the check done there cannot be exhaustive when specializing | |
1497 | member functions. Consider the following code: | |
1498 | ||
1499 | template <> void A<int>::f(int); | |
1500 | template <> template <> void A<int>::f(int); | |
1501 | ||
1502 | Assuming that A<int> is not itself an explicit specialization | |
1503 | already, the first line specializes "f" which is a non-template | |
1504 | member function, whilst the second line specializes "f" which | |
1505 | is a template member function. So both lines are syntactically | |
1506 | correct, and check_explicit_specialization does not reject | |
1507 | them. | |
c8094d83 | 1508 | |
5fe7b654 GB |
1509 | Here, we can do better, as we are matching the specialization |
1510 | against the declarations. We count the number of template | |
1511 | headers, and we check if they match TEMPLATE_COUNT + 1 | |
1512 | (TEMPLATE_COUNT is the number of qualifying template classes, | |
1513 | plus there must be another header for the member template | |
1514 | itself). | |
c8094d83 | 1515 | |
5fe7b654 GB |
1516 | Notice that if header_count is zero, this is not a |
1517 | specialization but rather a template instantiation, so there | |
1518 | is no check we can perform here. */ | |
1519 | if (header_count && header_count != template_count + 1) | |
1520 | continue; | |
1521 | ||
98f99d7f MM |
1522 | /* Check that the number of template arguments at the |
1523 | innermost level for DECL is the same as for FN. */ | |
1524 | if (current_binding_level->kind == sk_template_parms | |
1525 | && !current_binding_level->explicit_spec_p | |
1526 | && (TREE_VEC_LENGTH (DECL_INNERMOST_TEMPLATE_PARMS (fn)) | |
3db45ab5 | 1527 | != TREE_VEC_LENGTH (INNERMOST_TEMPLATE_PARMS |
916b63c3 | 1528 | (current_template_parms)))) |
98f99d7f | 1529 | continue; |
c8094d83 | 1530 | |
ba139ba8 MM |
1531 | /* DECL might be a specialization of FN. */ |
1532 | decl_arg_types = TYPE_ARG_TYPES (TREE_TYPE (decl)); | |
1533 | fn_arg_types = TYPE_ARG_TYPES (TREE_TYPE (fn)); | |
1534 | ||
1535 | /* For a non-static member function, we need to make sure | |
1536 | that the const qualification is the same. Since | |
1537 | get_bindings does not try to merge the "this" parameter, | |
1538 | we must do the comparison explicitly. */ | |
1539 | if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn) | |
1540 | && !same_type_p (TREE_VALUE (fn_arg_types), | |
1541 | TREE_VALUE (decl_arg_types))) | |
1542 | continue; | |
1543 | ||
1544 | /* Skip the "this" parameter and, for constructors of | |
1545 | classes with virtual bases, the VTT parameter. A | |
1546 | full specialization of a constructor will have a VTT | |
1547 | parameter, but a template never will. */ | |
1548 | decl_arg_types | |
1549 | = skip_artificial_parms_for (decl, decl_arg_types); | |
1550 | fn_arg_types | |
1551 | = skip_artificial_parms_for (fn, fn_arg_types); | |
1552 | ||
1553 | /* Check that the number of function parameters matches. | |
1554 | For example, | |
1555 | template <class T> void f(int i = 0); | |
1556 | template <> void f<int>(); | |
1557 | The specialization f<int> is invalid but is not caught | |
1558 | by get_bindings below. */ | |
1559 | if (list_length (fn_arg_types) != list_length (decl_arg_types)) | |
1560 | continue; | |
1561 | ||
29a1da1c MM |
1562 | /* Function templates cannot be specializations; there are |
1563 | no partial specializations of functions. Therefore, if | |
1564 | the type of DECL does not match FN, there is no | |
1565 | match. */ | |
54062fc0 PC |
1566 | if (tsk == tsk_template) |
1567 | { | |
1568 | if (compparms (fn_arg_types, decl_arg_types)) | |
1569 | candidates = tree_cons (NULL_TREE, fn, candidates); | |
1570 | continue; | |
1571 | } | |
29a1da1c | 1572 | |
d955f6ea KL |
1573 | /* See whether this function might be a specialization of this |
1574 | template. */ | |
a34d3336 | 1575 | targs = get_bindings (fn, decl, explicit_targs, /*check_ret=*/true); |
d955f6ea KL |
1576 | |
1577 | if (!targs) | |
1578 | /* We cannot deduce template arguments that when used to | |
1579 | specialize TMPL will produce DECL. */ | |
1580 | continue; | |
1581 | ||
1582 | /* Save this template, and the arguments deduced. */ | |
1583 | templates = tree_cons (targs, fn, templates); | |
1584 | } | |
03017874 MM |
1585 | else if (need_member_template) |
1586 | /* FN is an ordinary member function, and we need a | |
1587 | specialization of a member template. */ | |
d955f6ea | 1588 | ; |
03017874 MM |
1589 | else if (TREE_CODE (fn) != FUNCTION_DECL) |
1590 | /* We can get IDENTIFIER_NODEs here in certain erroneous | |
1591 | cases. */ | |
d955f6ea | 1592 | ; |
03017874 MM |
1593 | else if (!DECL_FUNCTION_MEMBER_P (fn)) |
1594 | /* This is just an ordinary non-member function. Nothing can | |
1595 | be a specialization of that. */ | |
d955f6ea | 1596 | ; |
3b82c249 KL |
1597 | else if (DECL_ARTIFICIAL (fn)) |
1598 | /* Cannot specialize functions that are created implicitly. */ | |
d955f6ea | 1599 | ; |
75650646 | 1600 | else |
03017874 MM |
1601 | { |
1602 | tree decl_arg_types; | |
386b8a85 | 1603 | |
03017874 MM |
1604 | /* This is an ordinary member function. However, since |
1605 | we're here, we can assume it's enclosing class is a | |
1606 | template class. For example, | |
c8094d83 | 1607 | |
03017874 MM |
1608 | template <typename T> struct S { void f(); }; |
1609 | template <> void S<int>::f() {} | |
1610 | ||
1611 | Here, S<int>::f is a non-template, but S<int> is a | |
1612 | template class. If FN has the same type as DECL, we | |
1613 | might be in business. */ | |
f5d47abd KL |
1614 | |
1615 | if (!DECL_TEMPLATE_INFO (fn)) | |
1616 | /* Its enclosing class is an explicit specialization | |
1617 | of a template class. This is not a candidate. */ | |
1618 | continue; | |
1619 | ||
03017874 MM |
1620 | if (!same_type_p (TREE_TYPE (TREE_TYPE (decl)), |
1621 | TREE_TYPE (TREE_TYPE (fn)))) | |
1622 | /* The return types differ. */ | |
1623 | continue; | |
1624 | ||
1625 | /* Adjust the type of DECL in case FN is a static member. */ | |
1626 | decl_arg_types = TYPE_ARG_TYPES (TREE_TYPE (decl)); | |
c8094d83 | 1627 | if (DECL_STATIC_FUNCTION_P (fn) |
03017874 MM |
1628 | && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl)) |
1629 | decl_arg_types = TREE_CHAIN (decl_arg_types); | |
1630 | ||
c8094d83 | 1631 | if (compparms (TYPE_ARG_TYPES (TREE_TYPE (fn)), |
03017874 MM |
1632 | decl_arg_types)) |
1633 | /* They match! */ | |
1634 | candidates = tree_cons (NULL_TREE, fn, candidates); | |
03017874 | 1635 | } |
386b8a85 | 1636 | } |
03017874 | 1637 | |
bf8f3f93 | 1638 | if (templates && TREE_CHAIN (templates)) |
386b8a85 | 1639 | { |
03017874 | 1640 | /* We have: |
c8094d83 | 1641 | |
03017874 MM |
1642 | [temp.expl.spec] |
1643 | ||
1644 | It is possible for a specialization with a given function | |
1645 | signature to be instantiated from more than one function | |
1646 | template. In such cases, explicit specification of the | |
1647 | template arguments must be used to uniquely identify the | |
1648 | function template specialization being specialized. | |
1649 | ||
1650 | Note that here, there's no suggestion that we're supposed to | |
1651 | determine which of the candidate templates is most | |
1652 | specialized. However, we, also have: | |
1653 | ||
1654 | [temp.func.order] | |
1655 | ||
1656 | Partial ordering of overloaded function template | |
1657 | declarations is used in the following contexts to select | |
1658 | the function template to which a function template | |
c8094d83 | 1659 | specialization refers: |
03017874 | 1660 | |
0cbd7506 | 1661 | -- when an explicit specialization refers to a function |
c8094d83 | 1662 | template. |
03017874 MM |
1663 | |
1664 | So, we do use the partial ordering rules, at least for now. | |
0e339752 | 1665 | This extension can only serve to make invalid programs valid, |
03017874 MM |
1666 | so it's safe. And, there is strong anecdotal evidence that |
1667 | the committee intended the partial ordering rules to apply; | |
3b426391 | 1668 | the EDG front end has that behavior, and John Spicer claims |
03017874 MM |
1669 | that the committee simply forgot to delete the wording in |
1670 | [temp.expl.spec]. */ | |
7ca383e6 MM |
1671 | tree tmpl = most_specialized_instantiation (templates); |
1672 | if (tmpl != error_mark_node) | |
1673 | { | |
1674 | templates = tmpl; | |
1675 | TREE_CHAIN (templates) = NULL_TREE; | |
1676 | } | |
e1467ff2 MM |
1677 | } |
1678 | ||
03017874 | 1679 | if (templates == NULL_TREE && candidates == NULL_TREE) |
e1467ff2 | 1680 | { |
dee15844 JM |
1681 | error ("template-id %qD for %q+D does not match any template " |
1682 | "declaration", template_id, decl); | |
03017874 | 1683 | return error_mark_node; |
386b8a85 | 1684 | } |
03017874 | 1685 | else if ((templates && TREE_CHAIN (templates)) |
bf8f3f93 MM |
1686 | || (candidates && TREE_CHAIN (candidates)) |
1687 | || (templates && candidates)) | |
386b8a85 | 1688 | { |
dee15844 JM |
1689 | error ("ambiguous template specialization %qD for %q+D", |
1690 | template_id, decl); | |
bf8f3f93 MM |
1691 | chainon (candidates, templates); |
1692 | print_candidates (candidates); | |
03017874 | 1693 | return error_mark_node; |
386b8a85 JM |
1694 | } |
1695 | ||
c6002625 | 1696 | /* We have one, and exactly one, match. */ |
03017874 MM |
1697 | if (candidates) |
1698 | { | |
29a1da1c MM |
1699 | tree fn = TREE_VALUE (candidates); |
1700 | /* DECL is a re-declaration of a template function. */ | |
1701 | if (TREE_CODE (fn) == TEMPLATE_DECL) | |
1702 | return fn; | |
03017874 MM |
1703 | /* It was a specialization of an ordinary member function in a |
1704 | template class. */ | |
29a1da1c MM |
1705 | *targs_out = copy_node (DECL_TI_ARGS (fn)); |
1706 | return DECL_TI_TEMPLATE (fn); | |
03017874 MM |
1707 | } |
1708 | ||
1709 | /* It was a specialization of a template. */ | |
17aec3eb | 1710 | targs = DECL_TI_ARGS (DECL_TEMPLATE_RESULT (TREE_VALUE (templates))); |
03017874 MM |
1711 | if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (targs)) |
1712 | { | |
1713 | *targs_out = copy_node (targs); | |
c8094d83 | 1714 | SET_TMPL_ARGS_LEVEL (*targs_out, |
03017874 MM |
1715 | TMPL_ARGS_DEPTH (*targs_out), |
1716 | TREE_PURPOSE (templates)); | |
1717 | } | |
1718 | else | |
1719 | *targs_out = TREE_PURPOSE (templates); | |
e1467ff2 | 1720 | return TREE_VALUE (templates); |
8d08fdba | 1721 | } |
8afa707f MM |
1722 | |
1723 | /* Returns a chain of parameter types, exactly like the SPEC_TYPES, | |
1724 | but with the default argument values filled in from those in the | |
1725 | TMPL_TYPES. */ | |
c8094d83 | 1726 | |
8afa707f | 1727 | static tree |
3a978d72 NN |
1728 | copy_default_args_to_explicit_spec_1 (tree spec_types, |
1729 | tree tmpl_types) | |
8afa707f MM |
1730 | { |
1731 | tree new_spec_types; | |
1732 | ||
1733 | if (!spec_types) | |
1734 | return NULL_TREE; | |
1735 | ||
1736 | if (spec_types == void_list_node) | |
1737 | return void_list_node; | |
1738 | ||
1739 | /* Substitute into the rest of the list. */ | |
1740 | new_spec_types = | |
1741 | copy_default_args_to_explicit_spec_1 (TREE_CHAIN (spec_types), | |
1742 | TREE_CHAIN (tmpl_types)); | |
c8094d83 | 1743 | |
8afa707f MM |
1744 | /* Add the default argument for this parameter. */ |
1745 | return hash_tree_cons (TREE_PURPOSE (tmpl_types), | |
1746 | TREE_VALUE (spec_types), | |
1747 | new_spec_types); | |
1748 | } | |
1749 | ||
1750 | /* DECL is an explicit specialization. Replicate default arguments | |
1751 | from the template it specializes. (That way, code like: | |
1752 | ||
1753 | template <class T> void f(T = 3); | |
1754 | template <> void f(double); | |
c8094d83 | 1755 | void g () { f (); } |
8afa707f MM |
1756 | |
1757 | works, as required.) An alternative approach would be to look up | |
1758 | the correct default arguments at the call-site, but this approach | |
1759 | is consistent with how implicit instantiations are handled. */ | |
1760 | ||
1761 | static void | |
3a978d72 | 1762 | copy_default_args_to_explicit_spec (tree decl) |
8afa707f MM |
1763 | { |
1764 | tree tmpl; | |
1765 | tree spec_types; | |
1766 | tree tmpl_types; | |
1767 | tree new_spec_types; | |
1768 | tree old_type; | |
1769 | tree new_type; | |
1770 | tree t; | |
08c2df0f NS |
1771 | tree object_type = NULL_TREE; |
1772 | tree in_charge = NULL_TREE; | |
e0fff4b3 | 1773 | tree vtt = NULL_TREE; |
8afa707f MM |
1774 | |
1775 | /* See if there's anything we need to do. */ | |
1776 | tmpl = DECL_TI_TEMPLATE (decl); | |
1777 | tmpl_types = TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (tmpl))); | |
1778 | for (t = tmpl_types; t; t = TREE_CHAIN (t)) | |
1779 | if (TREE_PURPOSE (t)) | |
1780 | break; | |
1781 | if (!t) | |
1782 | return; | |
1783 | ||
1784 | old_type = TREE_TYPE (decl); | |
1785 | spec_types = TYPE_ARG_TYPES (old_type); | |
c8094d83 | 1786 | |
8afa707f MM |
1787 | if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl)) |
1788 | { | |
08c2df0f | 1789 | /* Remove the this pointer, but remember the object's type for |
0cbd7506 | 1790 | CV quals. */ |
08c2df0f | 1791 | object_type = TREE_TYPE (TREE_VALUE (spec_types)); |
8afa707f MM |
1792 | spec_types = TREE_CHAIN (spec_types); |
1793 | tmpl_types = TREE_CHAIN (tmpl_types); | |
c8094d83 | 1794 | |
8afa707f | 1795 | if (DECL_HAS_IN_CHARGE_PARM_P (decl)) |
0cbd7506 MS |
1796 | { |
1797 | /* DECL may contain more parameters than TMPL due to the extra | |
1798 | in-charge parameter in constructors and destructors. */ | |
1799 | in_charge = spec_types; | |
08c2df0f NS |
1800 | spec_types = TREE_CHAIN (spec_types); |
1801 | } | |
e0fff4b3 JM |
1802 | if (DECL_HAS_VTT_PARM_P (decl)) |
1803 | { | |
1804 | vtt = spec_types; | |
1805 | spec_types = TREE_CHAIN (spec_types); | |
1806 | } | |
8afa707f MM |
1807 | } |
1808 | ||
1809 | /* Compute the merged default arguments. */ | |
c8094d83 | 1810 | new_spec_types = |
8afa707f MM |
1811 | copy_default_args_to_explicit_spec_1 (spec_types, tmpl_types); |
1812 | ||
08c2df0f NS |
1813 | /* Compute the new FUNCTION_TYPE. */ |
1814 | if (object_type) | |
8afa707f | 1815 | { |
e0fff4b3 | 1816 | if (vtt) |
0cbd7506 MS |
1817 | new_spec_types = hash_tree_cons (TREE_PURPOSE (vtt), |
1818 | TREE_VALUE (vtt), | |
1819 | new_spec_types); | |
e0fff4b3 | 1820 | |
08c2df0f | 1821 | if (in_charge) |
0cbd7506 MS |
1822 | /* Put the in-charge parameter back. */ |
1823 | new_spec_types = hash_tree_cons (TREE_PURPOSE (in_charge), | |
1824 | TREE_VALUE (in_charge), | |
1825 | new_spec_types); | |
08c2df0f | 1826 | |
43dc123f MM |
1827 | new_type = build_method_type_directly (object_type, |
1828 | TREE_TYPE (old_type), | |
1829 | new_spec_types); | |
8afa707f | 1830 | } |
8afa707f MM |
1831 | else |
1832 | new_type = build_function_type (TREE_TYPE (old_type), | |
08c2df0f | 1833 | new_spec_types); |
e9525111 MM |
1834 | new_type = cp_build_type_attribute_variant (new_type, |
1835 | TYPE_ATTRIBUTES (old_type)); | |
8afa707f MM |
1836 | new_type = build_exception_variant (new_type, |
1837 | TYPE_RAISES_EXCEPTIONS (old_type)); | |
1838 | TREE_TYPE (decl) = new_type; | |
1839 | } | |
1840 | ||
386b8a85 | 1841 | /* Check to see if the function just declared, as indicated in |
75650646 MM |
1842 | DECLARATOR, and in DECL, is a specialization of a function |
1843 | template. We may also discover that the declaration is an explicit | |
1844 | instantiation at this point. | |
1845 | ||
e1467ff2 | 1846 | Returns DECL, or an equivalent declaration that should be used |
03017874 MM |
1847 | instead if all goes well. Issues an error message if something is |
1848 | amiss. Returns error_mark_node if the error is not easily | |
1849 | recoverable. | |
c8094d83 MS |
1850 | |
1851 | FLAGS is a bitmask consisting of the following flags: | |
75650646 | 1852 | |
75650646 MM |
1853 | 2: The function has a definition. |
1854 | 4: The function is a friend. | |
75650646 MM |
1855 | |
1856 | The TEMPLATE_COUNT is the number of references to qualifying | |
1857 | template classes that appeared in the name of the function. For | |
1858 | example, in | |
1859 | ||
1860 | template <class T> struct S { void f(); }; | |
1861 | void S<int>::f(); | |
c8094d83 | 1862 | |
75650646 MM |
1863 | the TEMPLATE_COUNT would be 1. However, explicitly specialized |
1864 | classes are not counted in the TEMPLATE_COUNT, so that in | |
1865 | ||
1866 | template <class T> struct S {}; | |
1867 | template <> struct S<int> { void f(); } | |
36a117a5 | 1868 | template <> void S<int>::f(); |
75650646 MM |
1869 | |
1870 | the TEMPLATE_COUNT would be 0. (Note that this declaration is | |
0e339752 | 1871 | invalid; there should be no template <>.) |
75650646 MM |
1872 | |
1873 | If the function is a specialization, it is marked as such via | |
1874 | DECL_TEMPLATE_SPECIALIZATION. Furthermore, its DECL_TEMPLATE_INFO | |
c8094d83 | 1875 | is set up correctly, and it is added to the list of specializations |
75650646 | 1876 | for that template. */ |
386b8a85 | 1877 | |
e1467ff2 | 1878 | tree |
c8094d83 | 1879 | check_explicit_specialization (tree declarator, |
0cbd7506 MS |
1880 | tree decl, |
1881 | int template_count, | |
1882 | int flags) | |
386b8a85 | 1883 | { |
75650646 MM |
1884 | int have_def = flags & 2; |
1885 | int is_friend = flags & 4; | |
1886 | int specialization = 0; | |
e1467ff2 | 1887 | int explicit_instantiation = 0; |
fd4de5ff | 1888 | int member_specialization = 0; |
75650646 MM |
1889 | tree ctype = DECL_CLASS_CONTEXT (decl); |
1890 | tree dname = DECL_NAME (decl); | |
74b846e0 | 1891 | tmpl_spec_kind tsk; |
386b8a85 | 1892 | |
f65b7de3 GB |
1893 | if (is_friend) |
1894 | { | |
1895 | if (!processing_specialization) | |
1896 | tsk = tsk_none; | |
1897 | else | |
1898 | tsk = tsk_excessive_parms; | |
1899 | } | |
1900 | else | |
1901 | tsk = current_tmpl_spec_kind (template_count); | |
75650646 | 1902 | |
74b846e0 MM |
1903 | switch (tsk) |
1904 | { | |
1905 | case tsk_none: | |
c8094d83 | 1906 | if (processing_specialization) |
75650646 | 1907 | { |
fd4de5ff MM |
1908 | specialization = 1; |
1909 | SET_DECL_TEMPLATE_SPECIALIZATION (decl); | |
75650646 | 1910 | } |
74b846e0 | 1911 | else if (TREE_CODE (declarator) == TEMPLATE_ID_EXPR) |
386b8a85 | 1912 | { |
74b846e0 MM |
1913 | if (is_friend) |
1914 | /* This could be something like: | |
75650646 | 1915 | |
74b846e0 MM |
1916 | template <class T> void f(T); |
1917 | class S { friend void f<>(int); } */ | |
1918 | specialization = 1; | |
1919 | else | |
1920 | { | |
1921 | /* This case handles bogus declarations like template <> | |
1922 | template <class T> void f<int>(); */ | |
1923 | ||
0f51ccfc | 1924 | error ("template-id %qD in declaration of primary template", |
0cbd7506 | 1925 | declarator); |
74b846e0 MM |
1926 | return decl; |
1927 | } | |
1928 | } | |
1929 | break; | |
1930 | ||
1931 | case tsk_invalid_member_spec: | |
1932 | /* The error has already been reported in | |
1933 | check_specialization_scope. */ | |
1934 | return error_mark_node; | |
1935 | ||
1936 | case tsk_invalid_expl_inst: | |
33bd39a2 | 1937 | error ("template parameter list used in explicit instantiation"); |
74b846e0 MM |
1938 | |
1939 | /* Fall through. */ | |
1940 | ||
1941 | case tsk_expl_inst: | |
fd4de5ff | 1942 | if (have_def) |
33bd39a2 | 1943 | error ("definition provided for explicit instantiation"); |
c8094d83 | 1944 | |
fd4de5ff | 1945 | explicit_instantiation = 1; |
74b846e0 | 1946 | break; |
fd4de5ff | 1947 | |
74b846e0 | 1948 | case tsk_excessive_parms: |
f03adc6b GB |
1949 | case tsk_insufficient_parms: |
1950 | if (tsk == tsk_excessive_parms) | |
0cbd7506 | 1951 | error ("too many template parameter lists in declaration of %qD", |
f03adc6b GB |
1952 | decl); |
1953 | else if (template_header_count) | |
0f51ccfc | 1954 | error("too few template parameter lists in declaration of %qD", decl); |
f03adc6b | 1955 | else |
0f51ccfc | 1956 | error("explicit specialization of %qD must be introduced by " |
9e637a26 | 1957 | "%<template <>%>", decl); |
75650646 | 1958 | |
74b846e0 MM |
1959 | /* Fall through. */ |
1960 | case tsk_expl_spec: | |
1961 | SET_DECL_TEMPLATE_SPECIALIZATION (decl); | |
1962 | if (ctype) | |
1963 | member_specialization = 1; | |
1964 | else | |
1965 | specialization = 1; | |
1966 | break; | |
74b846e0 MM |
1967 | |
1968 | case tsk_template: | |
1969 | if (TREE_CODE (declarator) == TEMPLATE_ID_EXPR) | |
c6f2ed0d | 1970 | { |
fd4de5ff MM |
1971 | /* This case handles bogus declarations like template <> |
1972 | template <class T> void f<int>(); */ | |
75650646 | 1973 | |
655dc6ee | 1974 | if (uses_template_parms (declarator)) |
0f51ccfc | 1975 | error ("function template partial specialization %qD " |
e1e93ad8 | 1976 | "is not allowed", declarator); |
655dc6ee | 1977 | else |
0f51ccfc | 1978 | error ("template-id %qD in declaration of primary template", |
0cbd7506 | 1979 | declarator); |
fd4de5ff | 1980 | return decl; |
386b8a85 | 1981 | } |
74b846e0 MM |
1982 | |
1983 | if (ctype && CLASSTYPE_TEMPLATE_INSTANTIATION (ctype)) | |
1984 | /* This is a specialization of a member template, without | |
1985 | specialization the containing class. Something like: | |
1986 | ||
1987 | template <class T> struct S { | |
c8094d83 | 1988 | template <class U> void f (U); |
0cbd7506 | 1989 | }; |
74b846e0 | 1990 | template <> template <class U> void S<int>::f(U) {} |
c8094d83 | 1991 | |
74b846e0 MM |
1992 | That's a specialization -- but of the entire template. */ |
1993 | specialization = 1; | |
1994 | break; | |
1995 | ||
1996 | default: | |
315fb5db | 1997 | gcc_unreachable (); |
75650646 | 1998 | } |
386b8a85 | 1999 | |
670960ac JM |
2000 | if (specialization || member_specialization) |
2001 | { | |
2002 | tree t = TYPE_ARG_TYPES (TREE_TYPE (decl)); | |
2003 | for (; t; t = TREE_CHAIN (t)) | |
2004 | if (TREE_PURPOSE (t)) | |
2005 | { | |
33bd39a2 | 2006 | pedwarn |
8251199e | 2007 | ("default argument specified in explicit specialization"); |
670960ac JM |
2008 | break; |
2009 | } | |
2010 | } | |
2011 | ||
e1467ff2 | 2012 | if (specialization || member_specialization || explicit_instantiation) |
75650646 MM |
2013 | { |
2014 | tree tmpl = NULL_TREE; | |
2015 | tree targs = NULL_TREE; | |
75650646 MM |
2016 | |
2017 | /* Make sure that the declarator is a TEMPLATE_ID_EXPR. */ | |
386b8a85 JM |
2018 | if (TREE_CODE (declarator) != TEMPLATE_ID_EXPR) |
2019 | { | |
2020 | tree fns; | |
2021 | ||
50bc768d | 2022 | gcc_assert (TREE_CODE (declarator) == IDENTIFIER_NODE); |
2f54a1db | 2023 | if (ctype) |
386b8a85 | 2024 | fns = dname; |
2f54a1db GB |
2025 | else |
2026 | { | |
2027 | /* If there is no class context, the explicit instantiation | |
0cbd7506 | 2028 | must be at namespace scope. */ |
50bc768d | 2029 | gcc_assert (DECL_NAMESPACE_SCOPE_P (decl)); |
2f54a1db GB |
2030 | |
2031 | /* Find the namespace binding, using the declaration | |
0cbd7506 | 2032 | context. */ |
ddf74938 | 2033 | fns = lookup_qualified_name (CP_DECL_CONTEXT (decl), dname, |
664a90c0 | 2034 | false, true); |
97dc8e5b | 2035 | if (fns == error_mark_node || !is_overloaded_fn (fns)) |
4230cec2 NS |
2036 | { |
2037 | error ("%qD is not a template function", dname); | |
2038 | fns = error_mark_node; | |
2039 | } | |
664a90c0 JM |
2040 | else |
2041 | { | |
2042 | tree fn = OVL_CURRENT (fns); | |
ddf74938 | 2043 | if (!is_associated_namespace (CP_DECL_CONTEXT (decl), |
08d295c5 JM |
2044 | CP_DECL_CONTEXT (fn))) |
2045 | error ("%qD is not declared in %qD", | |
2046 | decl, current_namespace); | |
664a90c0 | 2047 | } |
2f54a1db | 2048 | } |
386b8a85 | 2049 | |
2f54a1db | 2050 | declarator = lookup_template_function (fns, NULL_TREE); |
386b8a85 JM |
2051 | } |
2052 | ||
f2e48b67 BK |
2053 | if (declarator == error_mark_node) |
2054 | return error_mark_node; | |
2055 | ||
75650646 MM |
2056 | if (ctype != NULL_TREE && TYPE_BEING_DEFINED (ctype)) |
2057 | { | |
8ec2ac34 | 2058 | if (!explicit_instantiation) |
0e339752 | 2059 | /* A specialization in class scope. This is invalid, |
6c30752f MM |
2060 | but the error will already have been flagged by |
2061 | check_specialization_scope. */ | |
2062 | return error_mark_node; | |
8ec2ac34 | 2063 | else |
b370501f | 2064 | { |
0e339752 | 2065 | /* It's not valid to write an explicit instantiation in |
b370501f | 2066 | class scope, e.g.: |
8ec2ac34 | 2067 | |
0cbd7506 | 2068 | class C { template void f(); } |
8ec2ac34 | 2069 | |
b370501f KG |
2070 | This case is caught by the parser. However, on |
2071 | something like: | |
c8094d83 | 2072 | |
b370501f | 2073 | template class C { void f(); }; |
8ec2ac34 | 2074 | |
0e339752 | 2075 | (which is invalid) we can get here. The error will be |
b370501f KG |
2076 | issued later. */ |
2077 | ; | |
2078 | } | |
8ec2ac34 | 2079 | |
e1467ff2 | 2080 | return decl; |
75650646 | 2081 | } |
c8094d83 | 2082 | else if (ctype != NULL_TREE |
75650646 MM |
2083 | && (TREE_CODE (TREE_OPERAND (declarator, 0)) == |
2084 | IDENTIFIER_NODE)) | |
386b8a85 | 2085 | { |
75650646 MM |
2086 | /* Find the list of functions in ctype that have the same |
2087 | name as the declared function. */ | |
2088 | tree name = TREE_OPERAND (declarator, 0); | |
03017874 MM |
2089 | tree fns = NULL_TREE; |
2090 | int idx; | |
2091 | ||
8ba658ee | 2092 | if (constructor_name_p (name, ctype)) |
386b8a85 | 2093 | { |
75650646 | 2094 | int is_constructor = DECL_CONSTRUCTOR_P (decl); |
c8094d83 | 2095 | |
0fcedd9c | 2096 | if (is_constructor ? !TYPE_HAS_USER_CONSTRUCTOR (ctype) |
9f4faeae | 2097 | : !CLASSTYPE_DESTRUCTORS (ctype)) |
75650646 MM |
2098 | { |
2099 | /* From [temp.expl.spec]: | |
c8094d83 | 2100 | |
75650646 MM |
2101 | If such an explicit specialization for the member |
2102 | of a class template names an implicitly-declared | |
2103 | special member function (clause _special_), the | |
c8094d83 | 2104 | program is ill-formed. |
e1467ff2 MM |
2105 | |
2106 | Similar language is found in [temp.explicit]. */ | |
33bd39a2 | 2107 | error ("specialization of implicitly-declared special member function"); |
03017874 | 2108 | return error_mark_node; |
75650646 | 2109 | } |
386b8a85 | 2110 | |
42da2fd8 | 2111 | name = is_constructor ? ctor_identifier : dtor_identifier; |
75650646 | 2112 | } |
42da2fd8 | 2113 | |
421844e7 | 2114 | if (!DECL_CONV_FN_P (decl)) |
03017874 MM |
2115 | { |
2116 | idx = lookup_fnfields_1 (ctype, name); | |
2117 | if (idx >= 0) | |
aaaa46d2 | 2118 | fns = VEC_index (tree, CLASSTYPE_METHOD_VEC (ctype), idx); |
03017874 MM |
2119 | } |
2120 | else | |
2121 | { | |
d4e6fecb | 2122 | VEC(tree,gc) *methods; |
aaaa46d2 | 2123 | tree ovl; |
03017874 MM |
2124 | |
2125 | /* For a type-conversion operator, we cannot do a | |
2126 | name-based lookup. We might be looking for `operator | |
2127 | int' which will be a specialization of `operator T'. | |
2128 | So, we find *all* the conversion operators, and then | |
2129 | select from them. */ | |
2130 | fns = NULL_TREE; | |
2131 | ||
2132 | methods = CLASSTYPE_METHOD_VEC (ctype); | |
2133 | if (methods) | |
5dd236e2 | 2134 | for (idx = CLASSTYPE_FIRST_CONVERSION_SLOT; |
9ba5ff0f | 2135 | VEC_iterate (tree, methods, idx, ovl); |
aaaa46d2 | 2136 | ++idx) |
03017874 | 2137 | { |
aaaa46d2 | 2138 | if (!DECL_CONV_FN_P (OVL_CURRENT (ovl))) |
03017874 MM |
2139 | /* There are no more conversion functions. */ |
2140 | break; | |
2141 | ||
2142 | /* Glue all these conversion functions together | |
2143 | with those we already have. */ | |
2144 | for (; ovl; ovl = OVL_NEXT (ovl)) | |
2145 | fns = ovl_cons (OVL_CURRENT (ovl), fns); | |
2146 | } | |
2147 | } | |
c8094d83 MS |
2148 | |
2149 | if (fns == NULL_TREE) | |
386b8a85 | 2150 | { |
0f51ccfc | 2151 | error ("no member function %qD declared in %qT", name, ctype); |
03017874 | 2152 | return error_mark_node; |
386b8a85 JM |
2153 | } |
2154 | else | |
2155 | TREE_OPERAND (declarator, 0) = fns; | |
2156 | } | |
c8094d83 | 2157 | |
e1467ff2 MM |
2158 | /* Figure out what exactly is being specialized at this point. |
2159 | Note that for an explicit instantiation, even one for a | |
38e01259 | 2160 | member function, we cannot tell apriori whether the |
e1467ff2 | 2161 | instantiation is for a member template, or just a member |
36a117a5 MM |
2162 | function of a template class. Even if a member template is |
2163 | being instantiated, the member template arguments may be | |
2164 | elided if they can be deduced from the rest of the | |
2165 | declaration. */ | |
e1467ff2 | 2166 | tmpl = determine_specialization (declarator, decl, |
c8094d83 | 2167 | &targs, |
5fe7b654 | 2168 | member_specialization, |
29a1da1c MM |
2169 | template_count, |
2170 | tsk); | |
c8094d83 | 2171 | |
03017874 MM |
2172 | if (!tmpl || tmpl == error_mark_node) |
2173 | /* We couldn't figure out what this declaration was | |
2174 | specializing. */ | |
2175 | return error_mark_node; | |
2176 | else | |
386b8a85 | 2177 | { |
25aab5d0 | 2178 | tree gen_tmpl = most_general_template (tmpl); |
36a117a5 | 2179 | |
e1467ff2 MM |
2180 | if (explicit_instantiation) |
2181 | { | |
03d0f4af | 2182 | /* We don't set DECL_EXPLICIT_INSTANTIATION here; that |
c8094d83 | 2183 | is done by do_decl_instantiation later. */ |
25aab5d0 MM |
2184 | |
2185 | int arg_depth = TMPL_ARGS_DEPTH (targs); | |
2186 | int parm_depth = TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl)); | |
2187 | ||
2188 | if (arg_depth > parm_depth) | |
2189 | { | |
2190 | /* If TMPL is not the most general template (for | |
2191 | example, if TMPL is a friend template that is | |
2192 | injected into namespace scope), then there will | |
dc957d14 | 2193 | be too many levels of TARGS. Remove some of them |
25aab5d0 MM |
2194 | here. */ |
2195 | int i; | |
2196 | tree new_targs; | |
2197 | ||
f31c0a32 | 2198 | new_targs = make_tree_vec (parm_depth); |
25aab5d0 MM |
2199 | for (i = arg_depth - parm_depth; i < arg_depth; ++i) |
2200 | TREE_VEC_ELT (new_targs, i - (arg_depth - parm_depth)) | |
2201 | = TREE_VEC_ELT (targs, i); | |
2202 | targs = new_targs; | |
2203 | } | |
c8094d83 | 2204 | |
3e4a3562 | 2205 | return instantiate_template (tmpl, targs, tf_error); |
e1467ff2 | 2206 | } |
74b846e0 | 2207 | |
6c07f448 KL |
2208 | /* If we thought that the DECL was a member function, but it |
2209 | turns out to be specializing a static member function, | |
4546865e | 2210 | make DECL a static member function as well. */ |
6c07f448 KL |
2211 | if (DECL_STATIC_FUNCTION_P (tmpl) |
2212 | && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl)) | |
4546865e | 2213 | revert_static_member_fn (decl); |
6c07f448 | 2214 | |
f9a7ae04 | 2215 | /* If this is a specialization of a member template of a |
29a1da1c MM |
2216 | template class, we want to return the TEMPLATE_DECL, not |
2217 | the specialization of it. */ | |
74b846e0 MM |
2218 | if (tsk == tsk_template) |
2219 | { | |
2220 | SET_DECL_TEMPLATE_SPECIALIZATION (tmpl); | |
f9a7ae04 | 2221 | DECL_INITIAL (DECL_TEMPLATE_RESULT (tmpl)) = NULL_TREE; |
b190f239 NS |
2222 | if (have_def) |
2223 | { | |
f31686a3 RH |
2224 | DECL_SOURCE_LOCATION (tmpl) = DECL_SOURCE_LOCATION (decl); |
2225 | DECL_SOURCE_LOCATION (DECL_TEMPLATE_RESULT (tmpl)) | |
2226 | = DECL_SOURCE_LOCATION (decl); | |
08167d1c AO |
2227 | /* We want to use the argument list specified in the |
2228 | definition, not in the original declaration. */ | |
2229 | DECL_ARGUMENTS (DECL_TEMPLATE_RESULT (tmpl)) | |
2230 | = DECL_ARGUMENTS (decl); | |
b190f239 | 2231 | } |
74b846e0 MM |
2232 | return tmpl; |
2233 | } | |
2234 | ||
36a117a5 | 2235 | /* Set up the DECL_TEMPLATE_INFO for DECL. */ |
e1b3e07d | 2236 | DECL_TEMPLATE_INFO (decl) = tree_cons (tmpl, targs, NULL_TREE); |
36a117a5 | 2237 | |
8afa707f MM |
2238 | /* Inherit default function arguments from the template |
2239 | DECL is specializing. */ | |
2240 | copy_default_args_to_explicit_spec (decl); | |
2241 | ||
c750255c MM |
2242 | /* This specialization has the same protection as the |
2243 | template it specializes. */ | |
2244 | TREE_PRIVATE (decl) = TREE_PRIVATE (gen_tmpl); | |
2245 | TREE_PROTECTED (decl) = TREE_PROTECTED (gen_tmpl); | |
b9e75696 | 2246 | |
736b8100 SB |
2247 | /* 7.1.1-1 [dcl.stc] |
2248 | ||
2249 | A storage-class-specifier shall not be specified in an | |
2250 | explicit specialization... | |
2251 | ||
2252 | The parser rejects these, so unless action is taken here, | |
2253 | explicit function specializations will always appear with | |
2254 | global linkage. | |
2255 | ||
2256 | The action recommended by the C++ CWG in response to C++ | |
2257 | defect report 605 is to make the storage class and linkage | |
2258 | of the explicit specialization match the templated function: | |
2259 | ||
2260 | http://www.open-std.org/jtc1/sc22/wg21/docs/cwg_active.html#605 | |
2261 | */ | |
2262 | if (tsk == tsk_expl_spec && DECL_FUNCTION_TEMPLATE_P (gen_tmpl)) | |
2263 | { | |
2264 | tree tmpl_func = DECL_TEMPLATE_RESULT (gen_tmpl); | |
2265 | gcc_assert (TREE_CODE (tmpl_func) == FUNCTION_DECL); | |
2266 | ||
d732e98f | 2267 | /* This specialization has the same linkage and visibility as |
736b8100 SB |
2268 | the function template it specializes. */ |
2269 | TREE_PUBLIC (decl) = TREE_PUBLIC (tmpl_func); | |
92d0af97 JJ |
2270 | if (! TREE_PUBLIC (decl)) |
2271 | { | |
2272 | DECL_INTERFACE_KNOWN (decl) = 1; | |
2273 | DECL_NOT_REALLY_EXTERN (decl) = 1; | |
2274 | } | |
736b8100 SB |
2275 | DECL_THIS_STATIC (decl) = DECL_THIS_STATIC (tmpl_func); |
2276 | if (DECL_VISIBILITY_SPECIFIED (tmpl_func)) | |
2277 | { | |
2278 | DECL_VISIBILITY_SPECIFIED (decl) = 1; | |
2279 | DECL_VISIBILITY (decl) = DECL_VISIBILITY (tmpl_func); | |
2280 | } | |
2281 | } | |
2282 | ||
9c12301f MM |
2283 | /* If DECL is a friend declaration, declared using an |
2284 | unqualified name, the namespace associated with DECL may | |
2285 | have been set incorrectly. For example, in: | |
3db45ab5 MS |
2286 | |
2287 | template <typename T> void f(T); | |
2288 | namespace N { | |
2289 | struct S { friend void f<int>(int); } | |
2290 | } | |
2291 | ||
2292 | we will have set the DECL_CONTEXT for the friend | |
2293 | declaration to N, rather than to the global namespace. */ | |
9c12301f MM |
2294 | if (DECL_NAMESPACE_SCOPE_P (decl)) |
2295 | DECL_CONTEXT (decl) = DECL_CONTEXT (tmpl); | |
8d039470 | 2296 | |
386b8a85 | 2297 | if (is_friend && !have_def) |
36a117a5 MM |
2298 | /* This is not really a declaration of a specialization. |
2299 | It's just the name of an instantiation. But, it's not | |
2300 | a request for an instantiation, either. */ | |
fbf1c34b | 2301 | SET_DECL_IMPLICIT_INSTANTIATION (decl); |
08511114 KL |
2302 | else if (DECL_CONSTRUCTOR_P (decl) || DECL_DESTRUCTOR_P (decl)) |
2303 | /* This is indeed a specialization. In case of constructors | |
2304 | and destructors, we need in-charge and not-in-charge | |
2305 | versions in V3 ABI. */ | |
2306 | clone_function_decl (decl, /*update_method_vec_p=*/0); | |
75650646 | 2307 | |
36a117a5 MM |
2308 | /* Register this specialization so that we can find it |
2309 | again. */ | |
d63d5d0c | 2310 | decl = register_specialization (decl, gen_tmpl, targs, is_friend); |
386b8a85 JM |
2311 | } |
2312 | } | |
c8094d83 | 2313 | |
e1467ff2 | 2314 | return decl; |
386b8a85 | 2315 | } |
75650646 | 2316 | |
75650646 MM |
2317 | /* Returns 1 iff PARMS1 and PARMS2 are identical sets of template |
2318 | parameters. These are represented in the same format used for | |
2319 | DECL_TEMPLATE_PARMS. */ | |
2320 | ||
50bc768d | 2321 | int |
58f9752a | 2322 | comp_template_parms (const_tree parms1, const_tree parms2) |
75650646 | 2323 | { |
58f9752a KG |
2324 | const_tree p1; |
2325 | const_tree p2; | |
75650646 MM |
2326 | |
2327 | if (parms1 == parms2) | |
2328 | return 1; | |
2329 | ||
c8094d83 | 2330 | for (p1 = parms1, p2 = parms2; |
75650646 MM |
2331 | p1 != NULL_TREE && p2 != NULL_TREE; |
2332 | p1 = TREE_CHAIN (p1), p2 = TREE_CHAIN (p2)) | |
2333 | { | |
2334 | tree t1 = TREE_VALUE (p1); | |
2335 | tree t2 = TREE_VALUE (p2); | |
2336 | int i; | |
2337 | ||
50bc768d NS |
2338 | gcc_assert (TREE_CODE (t1) == TREE_VEC); |
2339 | gcc_assert (TREE_CODE (t2) == TREE_VEC); | |
75650646 MM |
2340 | |
2341 | if (TREE_VEC_LENGTH (t1) != TREE_VEC_LENGTH (t2)) | |
2342 | return 0; | |
2343 | ||
c8094d83 | 2344 | for (i = 0; i < TREE_VEC_LENGTH (t2); ++i) |
75650646 | 2345 | { |
0f67a82f LM |
2346 | tree parm1 = TREE_VALUE (TREE_VEC_ELT (t1, i)); |
2347 | tree parm2 = TREE_VALUE (TREE_VEC_ELT (t2, i)); | |
42b304f1 | 2348 | |
0f67a82f LM |
2349 | /* If either of the template parameters are invalid, assume |
2350 | they match for the sake of error recovery. */ | |
2351 | if (parm1 == error_mark_node || parm2 == error_mark_node) | |
2352 | return 1; | |
75650646 MM |
2353 | |
2354 | if (TREE_CODE (parm1) != TREE_CODE (parm2)) | |
2355 | return 0; | |
2356 | ||
5d80a306 DG |
2357 | if (TREE_CODE (parm1) == TEMPLATE_TYPE_PARM |
2358 | && (TEMPLATE_TYPE_PARAMETER_PACK (parm1) | |
2359 | == TEMPLATE_TYPE_PARAMETER_PACK (parm2))) | |
75650646 | 2360 | continue; |
3bfdc719 | 2361 | else if (!same_type_p (TREE_TYPE (parm1), TREE_TYPE (parm2))) |
75650646 MM |
2362 | return 0; |
2363 | } | |
2364 | } | |
2365 | ||
2366 | if ((p1 != NULL_TREE) != (p2 != NULL_TREE)) | |
2367 | /* One set of parameters has more parameters lists than the | |
2368 | other. */ | |
2369 | return 0; | |
2370 | ||
2371 | return 1; | |
2372 | } | |
2373 | ||
5d80a306 DG |
2374 | /* Determine whether PARM is a parameter pack. */ |
2375 | bool | |
58f9752a | 2376 | template_parameter_pack_p (const_tree parm) |
5d80a306 DG |
2377 | { |
2378 | /* Determine if we have a non-type template parameter pack. */ | |
2379 | if (TREE_CODE (parm) == PARM_DECL) | |
2380 | return (DECL_TEMPLATE_PARM_P (parm) | |
2381 | && TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm))); | |
2382 | ||
2383 | /* If this is a list of template parameters, we could get a | |
2384 | TYPE_DECL or a TEMPLATE_DECL. */ | |
2385 | if (TREE_CODE (parm) == TYPE_DECL || TREE_CODE (parm) == TEMPLATE_DECL) | |
2386 | parm = TREE_TYPE (parm); | |
2387 | ||
2388 | return ((TREE_CODE (parm) == TEMPLATE_TYPE_PARM | |
2389 | || TREE_CODE (parm) == TEMPLATE_TEMPLATE_PARM) | |
2390 | && TEMPLATE_TYPE_PARAMETER_PACK (parm)); | |
2391 | } | |
2392 | ||
5d80a306 DG |
2393 | /* Determine whether ARGS describes a variadic template args list, |
2394 | i.e., one that is terminated by a template argument pack. */ | |
2395 | static bool | |
2396 | template_args_variadic_p (tree args) | |
2397 | { | |
2398 | int nargs; | |
2399 | tree last_parm; | |
2400 | ||
2401 | if (args == NULL_TREE) | |
2402 | return false; | |
2403 | ||
2404 | args = INNERMOST_TEMPLATE_ARGS (args); | |
2405 | nargs = TREE_VEC_LENGTH (args); | |
2406 | ||
2407 | if (nargs == 0) | |
2408 | return false; | |
2409 | ||
2410 | last_parm = TREE_VEC_ELT (args, nargs - 1); | |
2411 | ||
2412 | return ARGUMENT_PACK_P (last_parm); | |
2413 | } | |
2414 | ||
2415 | /* Generate a new name for the parameter pack name NAME (an | |
2416 | IDENTIFIER_NODE) that incorporates its */ | |
2417 | static tree | |
2418 | make_ith_pack_parameter_name (tree name, int i) | |
2419 | { | |
2420 | /* Munge the name to include the parameter index. */ | |
2421 | char numbuf[128]; | |
2422 | char* newname; | |
2423 | ||
2424 | sprintf(numbuf, "%i", i); | |
2425 | newname = (char*)alloca (IDENTIFIER_LENGTH (name) + strlen(numbuf) + 2); | |
2426 | sprintf(newname, "%s#%i", IDENTIFIER_POINTER (name), i); | |
2427 | return get_identifier (newname); | |
2428 | } | |
2429 | ||
1ad8aeeb | 2430 | /* Structure used to track the progress of find_parameter_packs_r. */ |
5d80a306 DG |
2431 | struct find_parameter_pack_data |
2432 | { | |
1ad8aeeb DG |
2433 | /* TREE_LIST that will contain all of the parameter packs found by |
2434 | the traversal. */ | |
5d80a306 | 2435 | tree* parameter_packs; |
1ad8aeeb DG |
2436 | |
2437 | /* Set of AST nodes that have been visited by the traversal. */ | |
5d80a306 DG |
2438 | struct pointer_set_t *visited; |
2439 | }; | |
2440 | ||
88b82314 | 2441 | /* Identifies all of the argument packs that occur in a template |
5d80a306 | 2442 | argument and appends them to the TREE_LIST inside DATA, which is a |
88b82314 | 2443 | find_parameter_pack_data structure. This is a subroutine of |
5d80a306 DG |
2444 | make_pack_expansion and uses_parameter_packs. */ |
2445 | static tree | |
2446 | find_parameter_packs_r (tree *tp, int *walk_subtrees, void* data) | |
2447 | { | |
2448 | tree t = *tp; | |
2449 | struct find_parameter_pack_data* ppd = | |
2450 | (struct find_parameter_pack_data*)data; | |
1ad8aeeb | 2451 | bool parameter_pack_p = false; |
5d80a306 | 2452 | |
1ad8aeeb DG |
2453 | /* Identify whether this is a parameter pack or not. */ |
2454 | switch (TREE_CODE (t)) | |
2455 | { | |
2456 | case TEMPLATE_PARM_INDEX: | |
2457 | if (TEMPLATE_PARM_PARAMETER_PACK (t)) | |
2458 | parameter_pack_p = true; | |
2459 | break; | |
2460 | ||
2461 | case TEMPLATE_TYPE_PARM: | |
2462 | case TEMPLATE_TEMPLATE_PARM: | |
2463 | if (TEMPLATE_TYPE_PARAMETER_PACK (t)) | |
2464 | parameter_pack_p = true; | |
2465 | break; | |
2466 | ||
2467 | case PARM_DECL: | |
2468 | if (FUNCTION_PARAMETER_PACK_P (t)) | |
2469 | { | |
2470 | /* We don't want to walk into the type of a PARM_DECL, | |
2471 | because we don't want to see the type parameter pack. */ | |
2472 | *walk_subtrees = 0; | |
2473 | parameter_pack_p = true; | |
2474 | } | |
2475 | break; | |
2476 | ||
2477 | default: | |
2478 | /* Not a parameter pack. */ | |
2479 | break; | |
2480 | } | |
2481 | ||
2482 | if (parameter_pack_p) | |
2483 | { | |
2484 | /* Add this parameter pack to the list. */ | |
2485 | *ppd->parameter_packs = tree_cons (NULL_TREE, t, *ppd->parameter_packs); | |
1ad8aeeb | 2486 | } |
7b3e2d46 | 2487 | |
1ad8aeeb DG |
2488 | if (TYPE_P (t)) |
2489 | cp_walk_tree (&TYPE_CONTEXT (t), | |
92fab505 | 2490 | &find_parameter_packs_r, ppd, ppd->visited); |
1ad8aeeb | 2491 | |
5d80a306 DG |
2492 | /* This switch statement will return immediately if we don't find a |
2493 | parameter pack. */ | |
2494 | switch (TREE_CODE (t)) | |
2495 | { | |
2496 | case TEMPLATE_PARM_INDEX: | |
5d80a306 DG |
2497 | return NULL_TREE; |
2498 | ||
2499 | case BOUND_TEMPLATE_TEMPLATE_PARM: | |
1ad8aeeb DG |
2500 | /* Check the template itself. */ |
2501 | cp_walk_tree (&TREE_TYPE (TYPE_TI_TEMPLATE (t)), | |
92fab505 | 2502 | &find_parameter_packs_r, ppd, ppd->visited); |
5d80a306 | 2503 | /* Check the template arguments. */ |
14588106 | 2504 | cp_walk_tree (&TYPE_TI_ARGS (t), &find_parameter_packs_r, ppd, |
92fab505 | 2505 | ppd->visited); |
5d80a306 | 2506 | *walk_subtrees = 0; |
1ad8aeeb | 2507 | return NULL_TREE; |
5d80a306 DG |
2508 | |
2509 | case TEMPLATE_TYPE_PARM: | |
2510 | case TEMPLATE_TEMPLATE_PARM: | |
5d80a306 DG |
2511 | return NULL_TREE; |
2512 | ||
2513 | case PARM_DECL: | |
5d80a306 DG |
2514 | return NULL_TREE; |
2515 | ||
2516 | case RECORD_TYPE: | |
2517 | if (TYPE_PTRMEMFUNC_P (t)) | |
2518 | return NULL_TREE; | |
2519 | /* Fall through. */ | |
2520 | ||
2521 | case UNION_TYPE: | |
2522 | case ENUMERAL_TYPE: | |
2523 | if (TYPE_TEMPLATE_INFO (t)) | |
1ad8aeeb | 2524 | cp_walk_tree (&TREE_VALUE (TYPE_TEMPLATE_INFO (t)), |
92fab505 | 2525 | &find_parameter_packs_r, ppd, ppd->visited); |
5d80a306 DG |
2526 | |
2527 | *walk_subtrees = 0; | |
2528 | return NULL_TREE; | |
2529 | ||
2530 | case TEMPLATE_DECL: | |
1ad8aeeb | 2531 | cp_walk_tree (&TREE_TYPE (t), |
92fab505 | 2532 | &find_parameter_packs_r, ppd, ppd->visited); |
5d80a306 | 2533 | return NULL_TREE; |
e1a18c68 DG |
2534 | |
2535 | case TYPENAME_TYPE: | |
2536 | cp_walk_tree (&TYPENAME_TYPE_FULLNAME (t), &find_parameter_packs_r, | |
92fab505 | 2537 | ppd, ppd->visited); |
e1a18c68 DG |
2538 | *walk_subtrees = 0; |
2539 | return NULL_TREE; | |
e1a18c68 | 2540 | |
5d80a306 DG |
2541 | case TYPE_PACK_EXPANSION: |
2542 | case EXPR_PACK_EXPANSION: | |
2543 | *walk_subtrees = 0; | |
2544 | return NULL_TREE; | |
2545 | ||
d393153e | 2546 | case INTEGER_TYPE: |
14588106 | 2547 | cp_walk_tree (&TYPE_MAX_VALUE (t), &find_parameter_packs_r, |
92fab505 | 2548 | ppd, ppd->visited); |
d393153e DG |
2549 | *walk_subtrees = 0; |
2550 | return NULL_TREE; | |
2551 | ||
4439d02f | 2552 | case IDENTIFIER_NODE: |
92fab505 DG |
2553 | cp_walk_tree (&TREE_TYPE (t), &find_parameter_packs_r, ppd, |
2554 | ppd->visited); | |
4439d02f DG |
2555 | *walk_subtrees = 0; |
2556 | return NULL_TREE; | |
2557 | ||
5d80a306 DG |
2558 | default: |
2559 | return NULL_TREE; | |
2560 | } | |
5d80a306 DG |
2561 | |
2562 | return NULL_TREE; | |
2563 | } | |
2564 | ||
2565 | /* Determines if the expression or type T uses any parameter packs. */ | |
2566 | bool | |
2567 | uses_parameter_packs (tree t) | |
2568 | { | |
2569 | tree parameter_packs = NULL_TREE; | |
2570 | struct find_parameter_pack_data ppd; | |
2571 | ppd.parameter_packs = ¶meter_packs; | |
2572 | ppd.visited = pointer_set_create (); | |
92fab505 | 2573 | cp_walk_tree (&t, &find_parameter_packs_r, &ppd, ppd.visited); |
30bcc028 | 2574 | pointer_set_destroy (ppd.visited); |
5d80a306 DG |
2575 | return parameter_packs != NULL_TREE; |
2576 | } | |
2577 | ||
2578 | /* Turn ARG, which may be an expression, type, or a TREE_LIST | |
2579 | representation a base-class initializer into a parameter pack | |
2580 | expansion. If all goes well, the resulting node will be an | |
2581 | EXPR_PACK_EXPANSION, TYPE_PACK_EXPANSION, or TREE_LIST, | |
2582 | respectively. */ | |
2583 | tree | |
2584 | make_pack_expansion (tree arg) | |
2585 | { | |
2586 | tree result; | |
2587 | tree parameter_packs = NULL_TREE; | |
2588 | bool for_types = false; | |
2589 | struct find_parameter_pack_data ppd; | |
2590 | ||
2591 | if (!arg || arg == error_mark_node) | |
2592 | return arg; | |
2593 | ||
2594 | if (TREE_CODE (arg) == TREE_LIST) | |
2595 | { | |
2596 | /* The only time we will see a TREE_LIST here is for a base | |
2597 | class initializer. In this case, the TREE_PURPOSE will be a | |
2598 | _TYPE node (representing the base class expansion we're | |
2599 | initializing) and the TREE_VALUE will be a TREE_LIST | |
2600 | containing the initialization arguments. | |
2601 | ||
2602 | The resulting expansion looks somewhat different from most | |
2603 | expansions. Rather than returning just one _EXPANSION, we | |
2604 | return a TREE_LIST whose TREE_PURPOSE is a | |
2605 | TYPE_PACK_EXPANSION containing the bases that will be | |
2606 | initialized. The TREE_VALUE will be identical to the | |
2607 | original TREE_VALUE, which is a list of arguments that will | |
2608 | be passed to each base. We do not introduce any new pack | |
2609 | expansion nodes into the TREE_VALUE (although it is possible | |
2610 | that some already exist), because the TREE_PURPOSE and | |
2611 | TREE_VALUE all need to be expanded together with the same | |
2612 | _EXPANSION node. Note that the TYPE_PACK_EXPANSION in the | |
2613 | resulting TREE_PURPOSE will mention the parameter packs in | |
2614 | both the bases and the arguments to the bases. */ | |
2615 | tree purpose; | |
2616 | tree value; | |
2617 | tree parameter_packs = NULL_TREE; | |
2618 | ||
2619 | /* Determine which parameter packs will be used by the base | |
2620 | class expansion. */ | |
2621 | ppd.visited = pointer_set_create (); | |
2622 | ppd.parameter_packs = ¶meter_packs; | |
14588106 | 2623 | cp_walk_tree (&TREE_PURPOSE (arg), &find_parameter_packs_r, |
92fab505 | 2624 | &ppd, ppd.visited); |
5d80a306 DG |
2625 | |
2626 | if (parameter_packs == NULL_TREE) | |
2627 | { | |
2628 | error ("base initializer expansion %<%T%> contains no parameter packs", arg); | |
30bcc028 | 2629 | pointer_set_destroy (ppd.visited); |
5d80a306 DG |
2630 | return error_mark_node; |
2631 | } | |
2632 | ||
2633 | if (TREE_VALUE (arg) != void_type_node) | |
2634 | { | |
2635 | /* Collect the sets of parameter packs used in each of the | |
2636 | initialization arguments. */ | |
2637 | for (value = TREE_VALUE (arg); value; value = TREE_CHAIN (value)) | |
2638 | { | |
2639 | /* Determine which parameter packs will be expanded in this | |
2640 | argument. */ | |
14588106 | 2641 | cp_walk_tree (&TREE_VALUE (value), &find_parameter_packs_r, |
92fab505 | 2642 | &ppd, ppd.visited); |
5d80a306 DG |
2643 | } |
2644 | } | |
2645 | ||
30bcc028 DG |
2646 | pointer_set_destroy (ppd.visited); |
2647 | ||
5d80a306 DG |
2648 | /* Create the pack expansion type for the base type. */ |
2649 | purpose = make_node (TYPE_PACK_EXPANSION); | |
2650 | SET_PACK_EXPANSION_PATTERN (purpose, TREE_PURPOSE (arg)); | |
2651 | PACK_EXPANSION_PARAMETER_PACKS (purpose) = parameter_packs; | |
2652 | ||
2653 | /* Just use structural equality for these TYPE_PACK_EXPANSIONS; | |
2654 | they will rarely be compared to anything. */ | |
2655 | SET_TYPE_STRUCTURAL_EQUALITY (purpose); | |
2656 | ||
2657 | return tree_cons (purpose, TREE_VALUE (arg), NULL_TREE); | |
2658 | } | |
2659 | ||
2660 | if (TYPE_P (arg) || TREE_CODE (arg) == TEMPLATE_DECL) | |
2661 | for_types = true; | |
2662 | ||
2663 | /* Build the PACK_EXPANSION_* node. */ | |
2664 | result = make_node (for_types ? TYPE_PACK_EXPANSION : EXPR_PACK_EXPANSION); | |
2665 | SET_PACK_EXPANSION_PATTERN (result, arg); | |
2666 | if (TREE_CODE (result) == EXPR_PACK_EXPANSION) | |
2667 | { | |
2668 | /* Propagate type and const-expression information. */ | |
2669 | TREE_TYPE (result) = TREE_TYPE (arg); | |
2670 | TREE_CONSTANT (result) = TREE_CONSTANT (arg); | |
2671 | } | |
2672 | else | |
2673 | /* Just use structural equality for these TYPE_PACK_EXPANSIONS; | |
2674 | they will rarely be compared to anything. */ | |
2675 | SET_TYPE_STRUCTURAL_EQUALITY (result); | |
2676 | ||
2677 | /* Determine which parameter packs will be expanded. */ | |
2678 | ppd.parameter_packs = ¶meter_packs; | |
2679 | ppd.visited = pointer_set_create (); | |
92fab505 | 2680 | cp_walk_tree (&arg, &find_parameter_packs_r, &ppd, ppd.visited); |
30bcc028 | 2681 | pointer_set_destroy (ppd.visited); |
5d80a306 DG |
2682 | |
2683 | /* Make sure we found some parameter packs. */ | |
2684 | if (parameter_packs == NULL_TREE) | |
2685 | { | |
2686 | if (TYPE_P (arg)) | |
2687 | error ("expansion pattern %<%T%> contains no argument packs", arg); | |
2688 | else | |
2689 | error ("expansion pattern %<%E%> contains no argument packs", arg); | |
2690 | return error_mark_node; | |
2691 | } | |
2692 | PACK_EXPANSION_PARAMETER_PACKS (result) = parameter_packs; | |
2693 | ||
2694 | return result; | |
2695 | } | |
2696 | ||
2697 | /* Checks T for any "bare" parameter packs, which have not yet been | |
2698 | expanded, and issues an error if any are found. This operation can | |
2699 | only be done on full expressions or types (e.g., an expression | |
2700 | statement, "if" condition, etc.), because we could have expressions like: | |
2701 | ||
2702 | foo(f(g(h(args)))...) | |
2703 | ||
2704 | where "args" is a parameter pack. check_for_bare_parameter_packs | |
2705 | should not be called for the subexpressions args, h(args), | |
2706 | g(h(args)), or f(g(h(args))), because we would produce erroneous | |
b1d7b1c0 DG |
2707 | error messages. |
2708 | ||
4439d02f DG |
2709 | Returns TRUE and emits an error if there were bare parameter packs, |
2710 | returns FALSE otherwise. */ | |
b1d7b1c0 | 2711 | bool |
7b3e2d46 | 2712 | check_for_bare_parameter_packs (tree t) |
5d80a306 DG |
2713 | { |
2714 | tree parameter_packs = NULL_TREE; | |
2715 | struct find_parameter_pack_data ppd; | |
2716 | ||
7b3e2d46 | 2717 | if (!processing_template_decl || !t || t == error_mark_node) |
4439d02f | 2718 | return false; |
5d80a306 | 2719 | |
7b3e2d46 DG |
2720 | if (TREE_CODE (t) == TYPE_DECL) |
2721 | t = TREE_TYPE (t); | |
5d80a306 DG |
2722 | |
2723 | ppd.parameter_packs = ¶meter_packs; | |
2724 | ppd.visited = pointer_set_create (); | |
92fab505 | 2725 | cp_walk_tree (&t, &find_parameter_packs_r, &ppd, ppd.visited); |
30bcc028 | 2726 | pointer_set_destroy (ppd.visited); |
5d80a306 | 2727 | |
b1d7b1c0 DG |
2728 | if (parameter_packs) |
2729 | { | |
2730 | error ("parameter packs not expanded with `...':"); | |
2731 | while (parameter_packs) | |
2732 | { | |
2733 | tree pack = TREE_VALUE (parameter_packs); | |
2734 | tree name = NULL_TREE; | |
2735 | ||
2736 | if (TREE_CODE (pack) == TEMPLATE_TYPE_PARM | |
2737 | || TREE_CODE (pack) == TEMPLATE_TEMPLATE_PARM) | |
2738 | name = TYPE_NAME (pack); | |
2739 | else if (TREE_CODE (pack) == TEMPLATE_PARM_INDEX) | |
2740 | name = DECL_NAME (TEMPLATE_PARM_DECL (pack)); | |
2741 | else | |
2742 | name = DECL_NAME (pack); | |
1ad8aeeb DG |
2743 | |
2744 | if (name) | |
2745 | inform (" %qD", name); | |
2746 | else | |
2747 | inform (" <anonymous>"); | |
b1d7b1c0 DG |
2748 | |
2749 | parameter_packs = TREE_CHAIN (parameter_packs); | |
2750 | } | |
2751 | ||
4439d02f | 2752 | return true; |
b1d7b1c0 DG |
2753 | } |
2754 | ||
4439d02f | 2755 | return false; |
5d80a306 DG |
2756 | } |
2757 | ||
2758 | /* Expand any parameter packs that occur in the template arguments in | |
2759 | ARGS. */ | |
2760 | tree | |
2761 | expand_template_argument_pack (tree args) | |
2762 | { | |
2763 | tree result_args = NULL_TREE; | |
2764 | int in_arg, out_arg = 0, nargs = args ? TREE_VEC_LENGTH (args) : 0; | |
2765 | int num_result_args = -1; | |
2766 | ||
2767 | /* First, determine if we need to expand anything, and the number of | |
2768 | slots we'll need. */ | |
2769 | for (in_arg = 0; in_arg < nargs; ++in_arg) | |
2770 | { | |
2771 | tree arg = TREE_VEC_ELT (args, in_arg); | |
2772 | if (ARGUMENT_PACK_P (arg)) | |
2773 | { | |
2774 | int num_packed = TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg)); | |
2775 | if (num_result_args < 0) | |
2776 | num_result_args = in_arg + num_packed; | |
2777 | else | |
2778 | num_result_args += num_packed; | |
2779 | } | |
2780 | else | |
2781 | { | |
2782 | if (num_result_args >= 0) | |
2783 | num_result_args++; | |
2784 | } | |
2785 | } | |
2786 | ||
2787 | /* If no expansion is necessary, we're done. */ | |
2788 | if (num_result_args < 0) | |
2789 | return args; | |
2790 | ||
2791 | /* Expand arguments. */ | |
2792 | result_args = make_tree_vec (num_result_args); | |
2793 | for (in_arg = 0; in_arg < nargs; ++in_arg) | |
2794 | { | |
2795 | tree arg = TREE_VEC_ELT (args, in_arg); | |
2796 | if (ARGUMENT_PACK_P (arg)) | |
2797 | { | |
2798 | tree packed = ARGUMENT_PACK_ARGS (arg); | |
2799 | int i, num_packed = TREE_VEC_LENGTH (packed); | |
2800 | for (i = 0; i < num_packed; ++i, ++out_arg) | |
2801 | TREE_VEC_ELT (result_args, out_arg) = TREE_VEC_ELT(packed, i); | |
2802 | } | |
2803 | else | |
2804 | { | |
2805 | TREE_VEC_ELT (result_args, out_arg) = arg; | |
2806 | ++out_arg; | |
2807 | } | |
2808 | } | |
2809 | ||
2810 | return result_args; | |
2811 | } | |
2812 | ||
f3400fe2 JM |
2813 | /* Complain if DECL shadows a template parameter. |
2814 | ||
2815 | [temp.local]: A template-parameter shall not be redeclared within its | |
2816 | scope (including nested scopes). */ | |
2817 | ||
2818 | void | |
3a978d72 | 2819 | check_template_shadow (tree decl) |
f3400fe2 | 2820 | { |
8f032717 MM |
2821 | tree olddecl; |
2822 | ||
b5d9b9ab MM |
2823 | /* If we're not in a template, we can't possibly shadow a template |
2824 | parameter. */ | |
2825 | if (!current_template_parms) | |
2826 | return; | |
2827 | ||
2828 | /* Figure out what we're shadowing. */ | |
8f032717 MM |
2829 | if (TREE_CODE (decl) == OVERLOAD) |
2830 | decl = OVL_CURRENT (decl); | |
90ea9897 | 2831 | olddecl = innermost_non_namespace_value (DECL_NAME (decl)); |
f3400fe2 | 2832 | |
b5d9b9ab MM |
2833 | /* If there's no previous binding for this name, we're not shadowing |
2834 | anything, let alone a template parameter. */ | |
2835 | if (!olddecl) | |
2836 | return; | |
2837 | ||
2838 | /* If we're not shadowing a template parameter, we're done. Note | |
2839 | that OLDDECL might be an OVERLOAD (or perhaps even an | |
2840 | ERROR_MARK), so we can't just blithely assume it to be a _DECL | |
2841 | node. */ | |
2f939d94 | 2842 | if (!DECL_P (olddecl) || !DECL_TEMPLATE_PARM_P (olddecl)) |
b5d9b9ab MM |
2843 | return; |
2844 | ||
2845 | /* We check for decl != olddecl to avoid bogus errors for using a | |
2846 | name inside a class. We check TPFI to avoid duplicate errors for | |
2847 | inline member templates. */ | |
c8094d83 | 2848 | if (decl == olddecl |
b5d9b9ab MM |
2849 | || TEMPLATE_PARMS_FOR_INLINE (current_template_parms)) |
2850 | return; | |
2851 | ||
dee15844 JM |
2852 | error ("declaration of %q+#D", decl); |
2853 | error (" shadows template parm %q+#D", olddecl); | |
f3400fe2 | 2854 | } |
22a7be53 | 2855 | |
f3400fe2 | 2856 | /* Return a new TEMPLATE_PARM_INDEX with the indicated INDEX, LEVEL, |
f84b4be9 JM |
2857 | ORIG_LEVEL, DECL, and TYPE. */ |
2858 | ||
2859 | static tree | |
c8094d83 | 2860 | build_template_parm_index (int index, |
0cbd7506 MS |
2861 | int level, |
2862 | int orig_level, | |
2863 | tree decl, | |
2864 | tree type) | |
f84b4be9 JM |
2865 | { |
2866 | tree t = make_node (TEMPLATE_PARM_INDEX); | |
2867 | TEMPLATE_PARM_IDX (t) = index; | |
2868 | TEMPLATE_PARM_LEVEL (t) = level; | |
2869 | TEMPLATE_PARM_ORIG_LEVEL (t) = orig_level; | |
2870 | TEMPLATE_PARM_DECL (t) = decl; | |
2871 | TREE_TYPE (t) = type; | |
3e4a3562 | 2872 | TREE_CONSTANT (t) = TREE_CONSTANT (decl); |
6de9cd9a | 2873 | TREE_INVARIANT (t) = TREE_INVARIANT (decl); |
3e4a3562 | 2874 | TREE_READONLY (t) = TREE_READONLY (decl); |
f84b4be9 JM |
2875 | |
2876 | return t; | |
2877 | } | |
2878 | ||
06d40de8 | 2879 | /* Find the canonical type parameter for the given template type |
c3e188fc KH |
2880 | parameter. Returns the canonical type parameter, which may be TYPE |
2881 | if no such parameter existed. */ | |
06d40de8 DG |
2882 | static tree |
2883 | canonical_type_parameter (tree type) | |
2884 | { | |
2885 | tree list; | |
2886 | int idx = TEMPLATE_TYPE_IDX (type); | |
2887 | if (!canonical_template_parms) | |
2888 | canonical_template_parms = VEC_alloc (tree, gc, idx+1); | |
2889 | ||
2890 | while (VEC_length (tree, canonical_template_parms) <= (unsigned)idx) | |
2891 | VEC_safe_push (tree, gc, canonical_template_parms, NULL_TREE); | |
2892 | ||
2893 | list = VEC_index (tree, canonical_template_parms, idx); | |
96d84882 | 2894 | while (list && !comptypes (type, TREE_VALUE (list), COMPARE_STRUCTURAL)) |
06d40de8 DG |
2895 | list = TREE_CHAIN (list); |
2896 | ||
2897 | if (list) | |
2898 | return TREE_VALUE (list); | |
2899 | else | |
2900 | { | |
2901 | VEC_replace(tree, canonical_template_parms, idx, | |
2902 | tree_cons (NULL_TREE, type, | |
2903 | VEC_index (tree, canonical_template_parms, idx))); | |
2904 | return type; | |
2905 | } | |
2906 | } | |
2907 | ||
f84b4be9 | 2908 | /* Return a TEMPLATE_PARM_INDEX, similar to INDEX, but whose |
93cdc044 | 2909 | TEMPLATE_PARM_LEVEL has been decreased by LEVELS. If such a |
f84b4be9 JM |
2910 | TEMPLATE_PARM_INDEX already exists, it is returned; otherwise, a |
2911 | new one is created. */ | |
2912 | ||
c8094d83 | 2913 | static tree |
ef3b7b17 JM |
2914 | reduce_template_parm_level (tree index, tree type, int levels, tree args, |
2915 | tsubst_flags_t complain) | |
f84b4be9 JM |
2916 | { |
2917 | if (TEMPLATE_PARM_DESCENDANTS (index) == NULL_TREE | |
2918 | || (TEMPLATE_PARM_LEVEL (TEMPLATE_PARM_DESCENDANTS (index)) | |
93cdc044 | 2919 | != TEMPLATE_PARM_LEVEL (index) - levels)) |
f84b4be9 | 2920 | { |
3e4a3562 NS |
2921 | tree orig_decl = TEMPLATE_PARM_DECL (index); |
2922 | tree decl, t; | |
c8094d83 | 2923 | |
3e4a3562 NS |
2924 | decl = build_decl (TREE_CODE (orig_decl), DECL_NAME (orig_decl), type); |
2925 | TREE_CONSTANT (decl) = TREE_CONSTANT (orig_decl); | |
6de9cd9a | 2926 | TREE_INVARIANT (decl) = TREE_INVARIANT (orig_decl); |
3e4a3562 NS |
2927 | TREE_READONLY (decl) = TREE_READONLY (orig_decl); |
2928 | DECL_ARTIFICIAL (decl) = 1; | |
2929 | SET_DECL_TEMPLATE_PARM_P (decl); | |
c8094d83 | 2930 | |
3e4a3562 | 2931 | t = build_template_parm_index (TEMPLATE_PARM_IDX (index), |
93cdc044 | 2932 | TEMPLATE_PARM_LEVEL (index) - levels, |
f84b4be9 JM |
2933 | TEMPLATE_PARM_ORIG_LEVEL (index), |
2934 | decl, type); | |
2935 | TEMPLATE_PARM_DESCENDANTS (index) = t; | |
5d80a306 DG |
2936 | TEMPLATE_PARM_PARAMETER_PACK (t) |
2937 | = TEMPLATE_PARM_PARAMETER_PACK (index); | |
cae40af6 | 2938 | |
820cc88f | 2939 | /* Template template parameters need this. */ |
ef3b7b17 JM |
2940 | if (TREE_CODE (decl) == TEMPLATE_DECL) |
2941 | DECL_TEMPLATE_PARMS (decl) = tsubst_template_parms | |
2942 | (DECL_TEMPLATE_PARMS (TEMPLATE_PARM_DECL (index)), | |
2943 | args, complain); | |
f84b4be9 JM |
2944 | } |
2945 | ||
2946 | return TEMPLATE_PARM_DESCENDANTS (index); | |
2947 | } | |
2948 | ||
a14de1af | 2949 | /* Process information from new template parameter PARM and append it to the |
058b15c1 | 2950 | LIST being built. This new parameter is a non-type parameter iff |
5d80a306 DG |
2951 | IS_NON_TYPE is true. This new parameter is a parameter |
2952 | pack iff IS_PARAMETER_PACK is true. */ | |
e92cc029 | 2953 | |
8d08fdba | 2954 | tree |
5d80a306 DG |
2955 | process_template_parm (tree list, tree parm, bool is_non_type, |
2956 | bool is_parameter_pack) | |
8d08fdba | 2957 | { |
8d08fdba | 2958 | tree decl = 0; |
a292b002 | 2959 | tree defval; |
0f67a82f | 2960 | tree err_parm_list; |
d47e3adf | 2961 | int idx = 0; |
f84b4be9 | 2962 | |
50bc768d | 2963 | gcc_assert (TREE_CODE (parm) == TREE_LIST); |
a292b002 | 2964 | defval = TREE_PURPOSE (parm); |
5566b478 MS |
2965 | |
2966 | if (list) | |
2967 | { | |
d47e3adf LM |
2968 | tree p = tree_last (list); |
2969 | ||
0f67a82f | 2970 | if (p && TREE_VALUE (p) != error_mark_node) |
d47e3adf LM |
2971 | { |
2972 | p = TREE_VALUE (p); | |
2973 | if (TREE_CODE (p) == TYPE_DECL || TREE_CODE (p) == TEMPLATE_DECL) | |
2974 | idx = TEMPLATE_TYPE_IDX (TREE_TYPE (p)); | |
2975 | else | |
2976 | idx = TEMPLATE_PARM_IDX (DECL_INITIAL (p)); | |
2977 | } | |
5566b478 | 2978 | |
5566b478 MS |
2979 | ++idx; |
2980 | } | |
2981 | else | |
2982 | idx = 0; | |
2983 | ||
058b15c1 | 2984 | if (is_non_type) |
8d08fdba | 2985 | { |
058b15c1 MM |
2986 | parm = TREE_VALUE (parm); |
2987 | ||
833aa4c4 | 2988 | SET_DECL_TEMPLATE_PARM_P (parm); |
d490621d | 2989 | |
620188c9 | 2990 | if (TREE_TYPE (parm) == error_mark_node) |
0f67a82f LM |
2991 | { |
2992 | err_parm_list = build_tree_list (defval, parm); | |
2993 | TREE_VALUE (err_parm_list) = error_mark_node; | |
2994 | return chainon (list, err_parm_list); | |
2995 | } | |
620188c9 VR |
2996 | else |
2997 | { | |
2998 | /* [temp.param] | |
d490621d | 2999 | |
620188c9 VR |
3000 | The top-level cv-qualifiers on the template-parameter are |
3001 | ignored when determining its type. */ | |
3002 | TREE_TYPE (parm) = TYPE_MAIN_VARIANT (TREE_TYPE (parm)); | |
3003 | if (invalid_nontype_parm_type_p (TREE_TYPE (parm), 1)) | |
0f67a82f LM |
3004 | { |
3005 | err_parm_list = build_tree_list (defval, parm); | |
3006 | TREE_VALUE (err_parm_list) = error_mark_node; | |
3007 | return chainon (list, err_parm_list); | |
3008 | } | |
5d80a306 DG |
3009 | |
3010 | if (uses_parameter_packs (TREE_TYPE (parm)) && !is_parameter_pack) | |
3011 | { | |
3012 | /* This template parameter is not a parameter pack, but it | |
3013 | should be. Complain about "bare" parameter packs. */ | |
7b3e2d46 | 3014 | check_for_bare_parameter_packs (TREE_TYPE (parm)); |
5d80a306 DG |
3015 | |
3016 | /* Recover by calling this a parameter pack. */ | |
3017 | is_parameter_pack = true; | |
3018 | } | |
620188c9 | 3019 | } |
d490621d | 3020 | |
8d08fdba | 3021 | /* A template parameter is not modifiable. */ |
6de9cd9a DN |
3022 | TREE_CONSTANT (parm) = 1; |
3023 | TREE_INVARIANT (parm) = 1; | |
3024 | TREE_READONLY (parm) = 1; | |
8d08fdba | 3025 | decl = build_decl (CONST_DECL, DECL_NAME (parm), TREE_TYPE (parm)); |
6de9cd9a DN |
3026 | TREE_CONSTANT (decl) = 1; |
3027 | TREE_INVARIANT (decl) = 1; | |
3028 | TREE_READONLY (decl) = 1; | |
c8094d83 | 3029 | DECL_INITIAL (parm) = DECL_INITIAL (decl) |
f84b4be9 JM |
3030 | = build_template_parm_index (idx, processing_template_decl, |
3031 | processing_template_decl, | |
3032 | decl, TREE_TYPE (parm)); | |
5d80a306 DG |
3033 | |
3034 | TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm)) | |
3035 | = is_parameter_pack; | |
8d08fdba MS |
3036 | } |
3037 | else | |
3038 | { | |
73b0fce8 | 3039 | tree t; |
058b15c1 | 3040 | parm = TREE_VALUE (TREE_VALUE (parm)); |
c8094d83 | 3041 | |
73b0fce8 KL |
3042 | if (parm && TREE_CODE (parm) == TEMPLATE_DECL) |
3043 | { | |
9e1e64ec | 3044 | t = cxx_make_type (TEMPLATE_TEMPLATE_PARM); |
c8094d83 | 3045 | /* This is for distinguishing between real templates and template |
73b0fce8 KL |
3046 | template parameters */ |
3047 | TREE_TYPE (parm) = t; | |
3048 | TREE_TYPE (DECL_TEMPLATE_RESULT (parm)) = t; | |
3049 | decl = parm; | |
3050 | } | |
3051 | else | |
3052 | { | |
9e1e64ec | 3053 | t = cxx_make_type (TEMPLATE_TYPE_PARM); |
f4f206f4 | 3054 | /* parm is either IDENTIFIER_NODE or NULL_TREE. */ |
73b0fce8 KL |
3055 | decl = build_decl (TYPE_DECL, parm, t); |
3056 | } | |
c8094d83 | 3057 | |
d2e5ee5c MS |
3058 | TYPE_NAME (t) = decl; |
3059 | TYPE_STUB_DECL (t) = decl; | |
a292b002 | 3060 | parm = decl; |
f84b4be9 | 3061 | TEMPLATE_TYPE_PARM_INDEX (t) |
c8094d83 | 3062 | = build_template_parm_index (idx, processing_template_decl, |
f84b4be9 JM |
3063 | processing_template_decl, |
3064 | decl, TREE_TYPE (parm)); | |
5d80a306 | 3065 | TEMPLATE_TYPE_PARAMETER_PACK (t) = is_parameter_pack; |
06d40de8 | 3066 | TYPE_CANONICAL (t) = canonical_type_parameter (t); |
8d08fdba | 3067 | } |
c727aa5e | 3068 | DECL_ARTIFICIAL (decl) = 1; |
cd9f6678 | 3069 | SET_DECL_TEMPLATE_PARM_P (decl); |
8d08fdba | 3070 | pushdecl (decl); |
a292b002 | 3071 | parm = build_tree_list (defval, parm); |
8d08fdba MS |
3072 | return chainon (list, parm); |
3073 | } | |
3074 | ||
3075 | /* The end of a template parameter list has been reached. Process the | |
3076 | tree list into a parameter vector, converting each parameter into a more | |
3077 | useful form. Type parameters are saved as IDENTIFIER_NODEs, and others | |
3078 | as PARM_DECLs. */ | |
3079 | ||
3080 | tree | |
3a978d72 | 3081 | end_template_parm_list (tree parms) |
8d08fdba | 3082 | { |
5566b478 | 3083 | int nparms; |
9471d3e2 | 3084 | tree parm, next; |
5566b478 MS |
3085 | tree saved_parmlist = make_tree_vec (list_length (parms)); |
3086 | ||
5566b478 | 3087 | current_template_parms |
4890c2f4 | 3088 | = tree_cons (size_int (processing_template_decl), |
5566b478 | 3089 | saved_parmlist, current_template_parms); |
8d08fdba | 3090 | |
9471d3e2 NS |
3091 | for (parm = parms, nparms = 0; parm; parm = next, nparms++) |
3092 | { | |
3093 | next = TREE_CHAIN (parm); | |
3094 | TREE_VEC_ELT (saved_parmlist, nparms) = parm; | |
3095 | TREE_CHAIN (parm) = NULL_TREE; | |
3096 | } | |
a292b002 | 3097 | |
67ffc812 MM |
3098 | --processing_template_parmlist; |
3099 | ||
8d08fdba MS |
3100 | return saved_parmlist; |
3101 | } | |
3102 | ||
5566b478 MS |
3103 | /* end_template_decl is called after a template declaration is seen. */ |
3104 | ||
8d08fdba | 3105 | void |
3a978d72 | 3106 | end_template_decl (void) |
8d08fdba | 3107 | { |
386b8a85 JM |
3108 | reset_specialization (); |
3109 | ||
5156628f | 3110 | if (! processing_template_decl) |
73aad9b9 JM |
3111 | return; |
3112 | ||
5566b478 | 3113 | /* This matches the pushlevel in begin_template_parm_list. */ |
74b846e0 | 3114 | finish_scope (); |
8d08fdba | 3115 | |
5566b478 MS |
3116 | --processing_template_decl; |
3117 | current_template_parms = TREE_CHAIN (current_template_parms); | |
5566b478 | 3118 | } |
8d08fdba | 3119 | |
03c17ccd MM |
3120 | /* Within the declaration of a template, return all levels of template |
3121 | parameters that apply. The template parameters are represented as | |
3122 | a TREE_VEC, in the form documented in cp-tree.h for template | |
3123 | arguments. */ | |
9a3b49ac | 3124 | |
b5791fdc | 3125 | static tree |
3a978d72 | 3126 | current_template_args (void) |
5566b478 | 3127 | { |
36a117a5 | 3128 | tree header; |
b370501f | 3129 | tree args = NULL_TREE; |
36a117a5 | 3130 | int length = TMPL_PARMS_DEPTH (current_template_parms); |
98c1c668 JM |
3131 | int l = length; |
3132 | ||
36a117a5 MM |
3133 | /* If there is only one level of template parameters, we do not |
3134 | create a TREE_VEC of TREE_VECs. Instead, we return a single | |
3135 | TREE_VEC containing the arguments. */ | |
3136 | if (length > 1) | |
3137 | args = make_tree_vec (length); | |
3138 | ||
3139 | for (header = current_template_parms; header; header = TREE_CHAIN (header)) | |
8d08fdba | 3140 | { |
5566b478 | 3141 | tree a = copy_node (TREE_VALUE (header)); |
36a117a5 MM |
3142 | int i; |
3143 | ||
5566b478 | 3144 | TREE_TYPE (a) = NULL_TREE; |
36a117a5 | 3145 | for (i = TREE_VEC_LENGTH (a) - 1; i >= 0; --i) |
5566b478 | 3146 | { |
98c1c668 JM |
3147 | tree t = TREE_VEC_ELT (a, i); |
3148 | ||
36a117a5 | 3149 | /* T will be a list if we are called from within a |
98c1c668 JM |
3150 | begin/end_template_parm_list pair, but a vector directly |
3151 | if within a begin/end_member_template_processing pair. */ | |
c8094d83 | 3152 | if (TREE_CODE (t) == TREE_LIST) |
98c1c668 JM |
3153 | { |
3154 | t = TREE_VALUE (t); | |
c8094d83 | 3155 | |
0b93f014 | 3156 | if (!error_operand_p (t)) |
0f67a82f LM |
3157 | { |
3158 | if (TREE_CODE (t) == TYPE_DECL | |
3159 | || TREE_CODE (t) == TEMPLATE_DECL) | |
5d80a306 DG |
3160 | { |
3161 | t = TREE_TYPE (t); | |
3162 | ||
3163 | if (TEMPLATE_TYPE_PARAMETER_PACK (t)) | |
3164 | { | |
3165 | /* Turn this argument into a TYPE_ARGUMENT_PACK | |
3166 | with a single element, which expands T. */ | |
3167 | tree vec = make_tree_vec (1); | |
3168 | TREE_VEC_ELT (vec, 0) = make_pack_expansion (t); | |
3169 | ||
3170 | t = make_node (TYPE_ARGUMENT_PACK); | |
3171 | SET_ARGUMENT_PACK_ARGS (t, vec); | |
3172 | } | |
3173 | } | |
3174 | else | |
3175 | { | |
3176 | t = DECL_INITIAL (t); | |
3177 | ||
3178 | if (TEMPLATE_PARM_PARAMETER_PACK (t)) | |
3179 | { | |
3180 | /* Turn this argument into a NONTYPE_ARGUMENT_PACK | |
3181 | with a single element, which expands T. */ | |
3182 | tree vec = make_tree_vec (1); | |
3183 | tree type = TREE_TYPE (TEMPLATE_PARM_DECL (t)); | |
3184 | TREE_VEC_ELT (vec, 0) = make_pack_expansion (t); | |
3185 | ||
3186 | t = make_node (NONTYPE_ARGUMENT_PACK); | |
3187 | SET_ARGUMENT_PACK_ARGS (t, vec); | |
3188 | TREE_TYPE (t) = type; | |
3189 | } | |
3190 | } | |
bf98d3b6 | 3191 | TREE_VEC_ELT (a, i) = t; |
5d80a306 | 3192 | } |
98c1c668 | 3193 | } |
5566b478 | 3194 | } |
36a117a5 MM |
3195 | |
3196 | if (length > 1) | |
3197 | TREE_VEC_ELT (args, --l) = a; | |
3198 | else | |
3199 | args = a; | |
8d08fdba MS |
3200 | } |
3201 | ||
9a3b49ac MS |
3202 | return args; |
3203 | } | |
75650646 | 3204 | |
e1467ff2 | 3205 | /* Return a TEMPLATE_DECL corresponding to DECL, using the indicated |
c7222c02 | 3206 | template PARMS. If MEMBER_TEMPLATE_P is true, the new template is |
ee81147e | 3207 | a member template. Used by push_template_decl below. */ |
e1467ff2 | 3208 | |
75650646 | 3209 | static tree |
c7222c02 | 3210 | build_template_decl (tree decl, tree parms, bool member_template_p) |
75650646 MM |
3211 | { |
3212 | tree tmpl = build_lang_decl (TEMPLATE_DECL, DECL_NAME (decl), NULL_TREE); | |
3213 | DECL_TEMPLATE_PARMS (tmpl) = parms; | |
3214 | DECL_CONTEXT (tmpl) = DECL_CONTEXT (decl); | |
c7222c02 | 3215 | DECL_MEMBER_TEMPLATE_P (tmpl) = member_template_p; |
75650646 MM |
3216 | if (DECL_LANG_SPECIFIC (decl)) |
3217 | { | |
8f032717 MM |
3218 | DECL_STATIC_FUNCTION_P (tmpl) = DECL_STATIC_FUNCTION_P (decl); |
3219 | DECL_CONSTRUCTOR_P (tmpl) = DECL_CONSTRUCTOR_P (decl); | |
c8460010 | 3220 | DECL_DESTRUCTOR_P (tmpl) = DECL_DESTRUCTOR_P (decl); |
11f98788 | 3221 | DECL_NONCONVERTING_P (tmpl) = DECL_NONCONVERTING_P (decl); |
1f6e1acc AS |
3222 | DECL_ASSIGNMENT_OPERATOR_P (tmpl) = DECL_ASSIGNMENT_OPERATOR_P (decl); |
3223 | if (DECL_OVERLOADED_OPERATOR_P (decl)) | |
c8094d83 | 3224 | SET_OVERLOADED_OPERATOR_CODE (tmpl, |
1f6e1acc | 3225 | DECL_OVERLOADED_OPERATOR_P (decl)); |
75650646 MM |
3226 | } |
3227 | ||
3228 | return tmpl; | |
3229 | } | |
3230 | ||
050367a3 MM |
3231 | struct template_parm_data |
3232 | { | |
6c30752f MM |
3233 | /* The level of the template parameters we are currently |
3234 | processing. */ | |
050367a3 | 3235 | int level; |
6c30752f MM |
3236 | |
3237 | /* The index of the specialization argument we are currently | |
3238 | processing. */ | |
3239 | int current_arg; | |
3240 | ||
3241 | /* An array whose size is the number of template parameters. The | |
838dfd8a | 3242 | elements are nonzero if the parameter has been used in any one |
6c30752f | 3243 | of the arguments processed so far. */ |
050367a3 | 3244 | int* parms; |
6c30752f MM |
3245 | |
3246 | /* An array whose size is the number of template arguments. The | |
838dfd8a | 3247 | elements are nonzero if the argument makes use of template |
6c30752f MM |
3248 | parameters of this level. */ |
3249 | int* arg_uses_template_parms; | |
050367a3 MM |
3250 | }; |
3251 | ||
3252 | /* Subroutine of push_template_decl used to see if each template | |
3253 | parameter in a partial specialization is used in the explicit | |
3254 | argument list. If T is of the LEVEL given in DATA (which is | |
3255 | treated as a template_parm_data*), then DATA->PARMS is marked | |
3256 | appropriately. */ | |
3257 | ||
3258 | static int | |
3a978d72 | 3259 | mark_template_parm (tree t, void* data) |
050367a3 MM |
3260 | { |
3261 | int level; | |
3262 | int idx; | |
3263 | struct template_parm_data* tpd = (struct template_parm_data*) data; | |
3264 | ||
3265 | if (TREE_CODE (t) == TEMPLATE_PARM_INDEX) | |
3266 | { | |
3267 | level = TEMPLATE_PARM_LEVEL (t); | |
3268 | idx = TEMPLATE_PARM_IDX (t); | |
3269 | } | |
3270 | else | |
3271 | { | |
3272 | level = TEMPLATE_TYPE_LEVEL (t); | |
3273 | idx = TEMPLATE_TYPE_IDX (t); | |
3274 | } | |
3275 | ||
3276 | if (level == tpd->level) | |
6c30752f MM |
3277 | { |
3278 | tpd->parms[idx] = 1; | |
3279 | tpd->arg_uses_template_parms[tpd->current_arg] = 1; | |
3280 | } | |
050367a3 MM |
3281 | |
3282 | /* Return zero so that for_each_template_parm will continue the | |
3283 | traversal of the tree; we want to mark *every* template parm. */ | |
3284 | return 0; | |
3285 | } | |
3286 | ||
6c30752f MM |
3287 | /* Process the partial specialization DECL. */ |
3288 | ||
e9659ab0 | 3289 | static tree |
3a978d72 | 3290 | process_partial_specialization (tree decl) |
6c30752f MM |
3291 | { |
3292 | tree type = TREE_TYPE (decl); | |
3293 | tree maintmpl = CLASSTYPE_TI_TEMPLATE (type); | |
3294 | tree specargs = CLASSTYPE_TI_ARGS (type); | |
f9a7ae04 | 3295 | tree inner_args = INNERMOST_TEMPLATE_ARGS (specargs); |
6c30752f MM |
3296 | tree inner_parms = INNERMOST_TEMPLATE_PARMS (current_template_parms); |
3297 | tree main_inner_parms = DECL_INNERMOST_TEMPLATE_PARMS (maintmpl); | |
3298 | int nargs = TREE_VEC_LENGTH (inner_args); | |
3299 | int ntparms = TREE_VEC_LENGTH (inner_parms); | |
3300 | int i; | |
3301 | int did_error_intro = 0; | |
6c30752f MM |
3302 | struct template_parm_data tpd; |
3303 | struct template_parm_data tpd2; | |
3304 | ||
6c30752f MM |
3305 | /* We check that each of the template parameters given in the |
3306 | partial specialization is used in the argument list to the | |
3307 | specialization. For example: | |
3308 | ||
3309 | template <class T> struct S; | |
3310 | template <class T> struct S<T*>; | |
3311 | ||
3312 | The second declaration is OK because `T*' uses the template | |
3313 | parameter T, whereas | |
3314 | ||
3315 | template <class T> struct S<int>; | |
3316 | ||
3317 | is no good. Even trickier is: | |
3318 | ||
3319 | template <class T> | |
3320 | struct S1 | |
3321 | { | |
3322 | template <class U> | |
3323 | struct S2; | |
3324 | template <class U> | |
3325 | struct S2<T>; | |
3326 | }; | |
3327 | ||
0e339752 | 3328 | The S2<T> declaration is actually invalid; it is a |
c8094d83 | 3329 | full-specialization. Of course, |
6c30752f MM |
3330 | |
3331 | template <class U> | |
3332 | struct S2<T (*)(U)>; | |
3333 | ||
3334 | or some such would have been OK. */ | |
3335 | tpd.level = TMPL_PARMS_DEPTH (current_template_parms); | |
67f5655f | 3336 | tpd.parms = (int *) alloca (sizeof (int) * ntparms); |
fad205ff | 3337 | memset (tpd.parms, 0, sizeof (int) * ntparms); |
6c30752f | 3338 | |
67f5655f | 3339 | tpd.arg_uses_template_parms = (int *) alloca (sizeof (int) * nargs); |
fad205ff | 3340 | memset (tpd.arg_uses_template_parms, 0, sizeof (int) * nargs); |
6c30752f MM |
3341 | for (i = 0; i < nargs; ++i) |
3342 | { | |
3343 | tpd.current_arg = i; | |
3344 | for_each_template_parm (TREE_VEC_ELT (inner_args, i), | |
3345 | &mark_template_parm, | |
4f2c9d7e | 3346 | &tpd, |
c095a4f8 DG |
3347 | NULL, |
3348 | /*include_nondeduced_p=*/false); | |
6c30752f MM |
3349 | } |
3350 | for (i = 0; i < ntparms; ++i) | |
3351 | if (tpd.parms[i] == 0) | |
3352 | { | |
3353 | /* One of the template parms was not used in the | |
f9a7ae04 | 3354 | specialization. */ |
6c30752f MM |
3355 | if (!did_error_intro) |
3356 | { | |
33bd39a2 | 3357 | error ("template parameters not used in partial specialization:"); |
6c30752f MM |
3358 | did_error_intro = 1; |
3359 | } | |
3360 | ||
0f51ccfc | 3361 | error (" %qD", TREE_VALUE (TREE_VEC_ELT (inner_parms, i))); |
6c30752f MM |
3362 | } |
3363 | ||
3364 | /* [temp.class.spec] | |
3365 | ||
3366 | The argument list of the specialization shall not be identical to | |
3367 | the implicit argument list of the primary template. */ | |
c8094d83 MS |
3368 | if (comp_template_args |
3369 | (inner_args, | |
f9a7ae04 MM |
3370 | INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE |
3371 | (maintmpl))))) | |
0f51ccfc | 3372 | error ("partial specialization %qT does not specialize any template arguments", type); |
6c30752f MM |
3373 | |
3374 | /* [temp.class.spec] | |
3375 | ||
3376 | A partially specialized non-type argument expression shall not | |
3377 | involve template parameters of the partial specialization except | |
3378 | when the argument expression is a simple identifier. | |
3379 | ||
3380 | The type of a template parameter corresponding to a specialized | |
3381 | non-type argument shall not be dependent on a parameter of the | |
5d80a306 DG |
3382 | specialization. |
3383 | ||
3384 | Also, we verify that pack expansions only occur at the | |
3385 | end of the argument list. */ | |
50bc768d | 3386 | gcc_assert (nargs == DECL_NTPARMS (maintmpl)); |
6c30752f MM |
3387 | tpd2.parms = 0; |
3388 | for (i = 0; i < nargs; ++i) | |
3389 | { | |
5d80a306 | 3390 | tree parm = TREE_VALUE (TREE_VEC_ELT (main_inner_parms, i)); |
6c30752f | 3391 | tree arg = TREE_VEC_ELT (inner_args, i); |
5d80a306 DG |
3392 | tree packed_args = NULL_TREE; |
3393 | int j, len = 1; | |
6c30752f | 3394 | |
5d80a306 DG |
3395 | if (ARGUMENT_PACK_P (arg)) |
3396 | { | |
3397 | /* Extract the arguments from the argument pack. We'll be | |
3398 | iterating over these in the following loop. */ | |
3399 | packed_args = ARGUMENT_PACK_ARGS (arg); | |
3400 | len = TREE_VEC_LENGTH (packed_args); | |
3401 | } | |
3402 | ||
3403 | for (j = 0; j < len; j++) | |
3404 | { | |
3405 | if (packed_args) | |
3406 | /* Get the Jth argument in the parameter pack. */ | |
3407 | arg = TREE_VEC_ELT (packed_args, j); | |
3408 | ||
3409 | if (PACK_EXPANSION_P (arg)) | |
3410 | { | |
3411 | /* Pack expansions must come at the end of the | |
3412 | argument list. */ | |
3413 | if ((packed_args && j < len - 1) | |
3414 | || (!packed_args && i < nargs - 1)) | |
3415 | { | |
3416 | if (TREE_CODE (arg) == EXPR_PACK_EXPANSION) | |
3417 | error ("parameter pack argument %qE must be at the end of the template argument list", arg); | |
3418 | else | |
1ad8aeeb DG |
3419 | error ("parameter pack argument %qT must be at the end of the template argument list", arg); |
3420 | ||
3421 | if (packed_args) | |
3422 | TREE_VEC_ELT (packed_args, j) = error_mark_node; | |
5d80a306 DG |
3423 | } |
3424 | } | |
3425 | ||
3426 | if (TREE_CODE (arg) == EXPR_PACK_EXPANSION) | |
3427 | /* We only care about the pattern. */ | |
3428 | arg = PACK_EXPANSION_PATTERN (arg); | |
3429 | ||
3430 | if (/* These first two lines are the `non-type' bit. */ | |
3431 | !TYPE_P (arg) | |
3432 | && TREE_CODE (arg) != TEMPLATE_DECL | |
3433 | /* This next line is the `argument expression is not just a | |
3434 | simple identifier' condition and also the `specialized | |
3435 | non-type argument' bit. */ | |
3436 | && TREE_CODE (arg) != TEMPLATE_PARM_INDEX) | |
3437 | { | |
3438 | if ((!packed_args && tpd.arg_uses_template_parms[i]) | |
3439 | || (packed_args && uses_template_parms (arg))) | |
3440 | error ("template argument %qE involves template parameter(s)", | |
3441 | arg); | |
3442 | else | |
3443 | { | |
3444 | /* Look at the corresponding template parameter, | |
3445 | marking which template parameters its type depends | |
3446 | upon. */ | |
3447 | tree type = TREE_TYPE (parm); | |
3448 | ||
3449 | if (!tpd2.parms) | |
3450 | { | |
3451 | /* We haven't yet initialized TPD2. Do so now. */ | |
3452 | tpd2.arg_uses_template_parms | |
3453 | = (int *) alloca (sizeof (int) * nargs); | |
3454 | /* The number of parameters here is the number in the | |
3455 | main template, which, as checked in the assertion | |
3456 | above, is NARGS. */ | |
3457 | tpd2.parms = (int *) alloca (sizeof (int) * nargs); | |
3458 | tpd2.level = | |
3459 | TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (maintmpl)); | |
3460 | } | |
3461 | ||
3462 | /* Mark the template parameters. But this time, we're | |
3463 | looking for the template parameters of the main | |
3464 | template, not in the specialization. */ | |
3465 | tpd2.current_arg = i; | |
3466 | tpd2.arg_uses_template_parms[i] = 0; | |
3467 | memset (tpd2.parms, 0, sizeof (int) * nargs); | |
3468 | for_each_template_parm (type, | |
3469 | &mark_template_parm, | |
3470 | &tpd2, | |
c095a4f8 DG |
3471 | NULL, |
3472 | /*include_nondeduced_p=*/false); | |
5d80a306 DG |
3473 | |
3474 | if (tpd2.arg_uses_template_parms [i]) | |
3475 | { | |
3476 | /* The type depended on some template parameters. | |
3477 | If they are fully specialized in the | |
3478 | specialization, that's OK. */ | |
3479 | int j; | |
3480 | for (j = 0; j < nargs; ++j) | |
3481 | if (tpd2.parms[j] != 0 | |
3482 | && tpd.arg_uses_template_parms [j]) | |
3483 | { | |
3484 | error ("type %qT of template argument %qE depends " | |
3485 | "on template parameter(s)", | |
3486 | type, | |
3487 | arg); | |
3488 | break; | |
3489 | } | |
3490 | } | |
3491 | } | |
3492 | } | |
3493 | } | |
6c30752f MM |
3494 | } |
3495 | ||
c8094d83 | 3496 | if (retrieve_specialization (maintmpl, specargs, |
c7222c02 | 3497 | /*class_specializations_p=*/true)) |
6c30752f MM |
3498 | /* We've already got this specialization. */ |
3499 | return decl; | |
3500 | ||
d8b64f80 | 3501 | DECL_TEMPLATE_SPECIALIZATIONS (maintmpl) |
916b63c3 | 3502 | = tree_cons (specargs, inner_parms, |
b1d7b1c0 | 3503 | DECL_TEMPLATE_SPECIALIZATIONS (maintmpl)); |
6c30752f MM |
3504 | TREE_TYPE (DECL_TEMPLATE_SPECIALIZATIONS (maintmpl)) = type; |
3505 | return decl; | |
3506 | } | |
3507 | ||
85d85234 DG |
3508 | /* Check that a template declaration's use of default arguments and |
3509 | parameter packs is not invalid. Here, PARMS are the template | |
3510 | parameters. IS_PRIMARY is nonzero if DECL is the thing declared by | |
3511 | a primary template. IS_PARTIAL is nonzero if DECL is a partial | |
3512 | specialization. | |
9b7dd5e8 | 3513 | |
6ba89f8e | 3514 | |
9b7dd5e8 DG |
3515 | IS_FRIEND_DECL is nonzero if DECL is a friend function template |
3516 | declaration (but not a definition); 1 indicates a declaration, 2 | |
3517 | indicates a redeclaration. When IS_FRIEND_DECL=2, no errors are | |
3518 | emitted for extraneous default arguments. | |
3519 | ||
3520 | Returns TRUE if there were no errors found, FALSE otherwise. */ | |
3521 | ||
3522 | bool | |
3523 | check_default_tmpl_args (tree decl, tree parms, int is_primary, | |
3524 | int is_partial, int is_friend_decl) | |
6ba89f8e | 3525 | { |
d8e178a0 | 3526 | const char *msg; |
66191c20 MM |
3527 | int last_level_to_check; |
3528 | tree parm_level; | |
9b7dd5e8 | 3529 | bool no_errors = true; |
6ba89f8e | 3530 | |
c8094d83 | 3531 | /* [temp.param] |
6ba89f8e MM |
3532 | |
3533 | A default template-argument shall not be specified in a | |
3534 | function template declaration or a function template definition, nor | |
3535 | in the template-parameter-list of the definition of a member of a | |
3536 | class template. */ | |
3537 | ||
4f1c5b7d | 3538 | if (TREE_CODE (CP_DECL_CONTEXT (decl)) == FUNCTION_DECL) |
e0942dcd MM |
3539 | /* You can't have a function template declaration in a local |
3540 | scope, nor you can you define a member of a class template in a | |
3541 | local scope. */ | |
9b7dd5e8 | 3542 | return true; |
e0942dcd | 3543 | |
6ba89f8e MM |
3544 | if (current_class_type |
3545 | && !TYPE_BEING_DEFINED (current_class_type) | |
3d7de1fa | 3546 | && DECL_LANG_SPECIFIC (decl) |
5937a6f9 MM |
3547 | /* If this is either a friend defined in the scope of the class |
3548 | or a member function. */ | |
6df5158a NS |
3549 | && (DECL_FUNCTION_MEMBER_P (decl) |
3550 | ? same_type_p (DECL_CONTEXT (decl), current_class_type) | |
3551 | : DECL_FRIEND_CONTEXT (decl) | |
3552 | ? same_type_p (DECL_FRIEND_CONTEXT (decl), current_class_type) | |
3553 | : false) | |
5937a6f9 MM |
3554 | /* And, if it was a member function, it really was defined in |
3555 | the scope of the class. */ | |
6df5158a NS |
3556 | && (!DECL_FUNCTION_MEMBER_P (decl) |
3557 | || DECL_INITIALIZED_IN_CLASS_P (decl))) | |
6ba89f8e | 3558 | /* We already checked these parameters when the template was |
5937a6f9 MM |
3559 | declared, so there's no need to do it again now. This function |
3560 | was defined in class scope, but we're processing it's body now | |
3561 | that the class is complete. */ | |
9b7dd5e8 | 3562 | return true; |
c8094d83 | 3563 | |
9b7dd5e8 DG |
3564 | /* Core issue 226 (C++0x only): the following only applies to class |
3565 | templates. */ | |
c1ae8be5 | 3566 | if ((cxx_dialect == cxx98) || TREE_CODE (decl) != FUNCTION_DECL) |
66191c20 | 3567 | { |
9b7dd5e8 | 3568 | /* [temp.param] |
66191c20 | 3569 | |
9b7dd5e8 DG |
3570 | If a template-parameter has a default template-argument, all |
3571 | subsequent template-parameters shall have a default | |
3572 | template-argument supplied. */ | |
3573 | for (parm_level = parms; parm_level; parm_level = TREE_CHAIN (parm_level)) | |
3574 | { | |
3575 | tree inner_parms = TREE_VALUE (parm_level); | |
3576 | int ntparms = TREE_VEC_LENGTH (inner_parms); | |
3577 | int seen_def_arg_p = 0; | |
3578 | int i; | |
42b304f1 | 3579 | |
9b7dd5e8 DG |
3580 | for (i = 0; i < ntparms; ++i) |
3581 | { | |
3582 | tree parm = TREE_VEC_ELT (inner_parms, i); | |
42b304f1 | 3583 | |
9b7dd5e8 DG |
3584 | if (parm == error_mark_node) |
3585 | continue; | |
3586 | ||
3587 | if (TREE_PURPOSE (parm)) | |
3588 | seen_def_arg_p = 1; | |
3589 | else if (seen_def_arg_p) | |
3590 | { | |
3591 | error ("no default argument for %qD", TREE_VALUE (parm)); | |
3592 | /* For better subsequent error-recovery, we indicate that | |
3593 | there should have been a default argument. */ | |
3594 | TREE_PURPOSE (parm) = error_mark_node; | |
3595 | no_errors = false; | |
3596 | } | |
85d85234 DG |
3597 | else if (is_primary |
3598 | && !is_partial | |
3599 | && !is_friend_decl | |
3600 | && TREE_CODE (decl) == TYPE_DECL | |
3601 | && i < ntparms - 1 | |
3602 | && template_parameter_pack_p (TREE_VALUE (parm))) | |
3603 | { | |
3604 | /* A primary class template can only have one | |
3605 | parameter pack, at the end of the template | |
3606 | parameter list. */ | |
3607 | ||
3608 | if (TREE_CODE (TREE_VALUE (parm)) == PARM_DECL) | |
3609 | error ("parameter pack %qE must be at the end of the" | |
3610 | " template parameter list", TREE_VALUE (parm)); | |
3611 | else | |
3612 | error ("parameter pack %qT must be at the end of the" | |
3613 | " template parameter list", | |
3614 | TREE_TYPE (TREE_VALUE (parm))); | |
3615 | ||
3616 | TREE_VALUE (TREE_VEC_ELT (inner_parms, i)) | |
3617 | = error_mark_node; | |
3618 | no_errors = false; | |
3619 | } | |
9b7dd5e8 DG |
3620 | } |
3621 | } | |
66191c20 MM |
3622 | } |
3623 | ||
c1ae8be5 | 3624 | if (((cxx_dialect == cxx98) && TREE_CODE (decl) != TYPE_DECL) |
9b7dd5e8 DG |
3625 | || is_partial |
3626 | || !is_primary | |
3627 | || is_friend_decl) | |
6ba89f8e MM |
3628 | /* For an ordinary class template, default template arguments are |
3629 | allowed at the innermost level, e.g.: | |
0cbd7506 | 3630 | template <class T = int> |
6ba89f8e MM |
3631 | struct S {}; |
3632 | but, in a partial specialization, they're not allowed even | |
3633 | there, as we have in [temp.class.spec]: | |
c8094d83 | 3634 | |
6ba89f8e | 3635 | The template parameter list of a specialization shall not |
c8094d83 | 3636 | contain default template argument values. |
6ba89f8e | 3637 | |
9b7dd5e8 DG |
3638 | So, for a partial specialization, or for a function template |
3639 | (in C++98/C++03), we look at all of them. */ | |
6ba89f8e MM |
3640 | ; |
3641 | else | |
3642 | /* But, for a primary class template that is not a partial | |
3643 | specialization we look at all template parameters except the | |
3644 | innermost ones. */ | |
3645 | parms = TREE_CHAIN (parms); | |
3646 | ||
3647 | /* Figure out what error message to issue. */ | |
9b7dd5e8 DG |
3648 | if (is_friend_decl == 2) |
3649 | msg = "default template arguments may not be used in function template friend re-declaration"; | |
3650 | else if (is_friend_decl) | |
3651 | msg = "default template arguments may not be used in function template friend declarations"; | |
c1ae8be5 | 3652 | else if (TREE_CODE (decl) == FUNCTION_DECL && (cxx_dialect == cxx98)) |
8653a2c3 | 3653 | msg = "default template arguments may not be used in function templates"; |
6ba89f8e | 3654 | else if (is_partial) |
8653a2c3 | 3655 | msg = "default template arguments may not be used in partial specializations"; |
6ba89f8e | 3656 | else |
0f51ccfc | 3657 | msg = "default argument for template parameter for class enclosing %qD"; |
6ba89f8e MM |
3658 | |
3659 | if (current_class_type && TYPE_BEING_DEFINED (current_class_type)) | |
3660 | /* If we're inside a class definition, there's no need to | |
104bf76a | 3661 | examine the parameters to the class itself. On the one |
6ba89f8e | 3662 | hand, they will be checked when the class is defined, and, |
0e339752 | 3663 | on the other, default arguments are valid in things like: |
0cbd7506 MS |
3664 | template <class T = double> |
3665 | struct S { template <class U> void f(U); }; | |
6ba89f8e MM |
3666 | Here the default argument for `S' has no bearing on the |
3667 | declaration of `f'. */ | |
3668 | last_level_to_check = template_class_depth (current_class_type) + 1; | |
3669 | else | |
3670 | /* Check everything. */ | |
3671 | last_level_to_check = 0; | |
3672 | ||
c8094d83 MS |
3673 | for (parm_level = parms; |
3674 | parm_level && TMPL_PARMS_DEPTH (parm_level) >= last_level_to_check; | |
66191c20 | 3675 | parm_level = TREE_CHAIN (parm_level)) |
6ba89f8e | 3676 | { |
66191c20 MM |
3677 | tree inner_parms = TREE_VALUE (parm_level); |
3678 | int i; | |
3679 | int ntparms; | |
6ba89f8e MM |
3680 | |
3681 | ntparms = TREE_VEC_LENGTH (inner_parms); | |
c8094d83 | 3682 | for (i = 0; i < ntparms; ++i) |
42b304f1 LM |
3683 | { |
3684 | if (TREE_VEC_ELT (inner_parms, i) == error_mark_node) | |
3685 | continue; | |
6ba89f8e | 3686 | |
42b304f1 LM |
3687 | if (TREE_PURPOSE (TREE_VEC_ELT (inner_parms, i))) |
3688 | { | |
3689 | if (msg) | |
3690 | { | |
9b7dd5e8 DG |
3691 | no_errors = false; |
3692 | if (is_friend_decl == 2) | |
3693 | return no_errors; | |
3694 | ||
42b304f1 LM |
3695 | error (msg, decl); |
3696 | msg = 0; | |
3697 | } | |
3698 | ||
3699 | /* Clear out the default argument so that we are not | |
3700 | confused later. */ | |
3701 | TREE_PURPOSE (TREE_VEC_ELT (inner_parms, i)) = NULL_TREE; | |
3702 | } | |
3703 | } | |
6ba89f8e MM |
3704 | |
3705 | /* At this point, if we're still interested in issuing messages, | |
3706 | they must apply to classes surrounding the object declared. */ | |
3707 | if (msg) | |
c8094d83 | 3708 | msg = "default argument for template parameter for class enclosing %qD"; |
6ba89f8e | 3709 | } |
9b7dd5e8 DG |
3710 | |
3711 | return no_errors; | |
6ba89f8e MM |
3712 | } |
3713 | ||
5dd236e2 NS |
3714 | /* Worker for push_template_decl_real, called via |
3715 | for_each_template_parm. DATA is really an int, indicating the | |
3716 | level of the parameters we are interested in. If T is a template | |
838dfd8a | 3717 | parameter of that level, return nonzero. */ |
5dd236e2 NS |
3718 | |
3719 | static int | |
3a978d72 | 3720 | template_parm_this_level_p (tree t, void* data) |
5dd236e2 | 3721 | { |
6e04241f | 3722 | int this_level = *(int *)data; |
5dd236e2 NS |
3723 | int level; |
3724 | ||
3725 | if (TREE_CODE (t) == TEMPLATE_PARM_INDEX) | |
3726 | level = TEMPLATE_PARM_LEVEL (t); | |
3727 | else | |
3728 | level = TEMPLATE_TYPE_LEVEL (t); | |
3729 | return level == this_level; | |
3730 | } | |
3731 | ||
3ac3d9ea | 3732 | /* Creates a TEMPLATE_DECL for the indicated DECL using the template |
f84b4be9 JM |
3733 | parameters given by current_template_args, or reuses a |
3734 | previously existing one, if appropriate. Returns the DECL, or an | |
c8094d83 | 3735 | equivalent one, if it is replaced via a call to duplicate_decls. |
6757edfe | 3736 | |
d63d5d0c | 3737 | If IS_FRIEND is true, DECL is a friend declaration. */ |
3ac3d9ea MM |
3738 | |
3739 | tree | |
d63d5d0c | 3740 | push_template_decl_real (tree decl, bool is_friend) |
9a3b49ac MS |
3741 | { |
3742 | tree tmpl; | |
f84b4be9 | 3743 | tree args; |
9a3b49ac | 3744 | tree info; |
f84b4be9 JM |
3745 | tree ctx; |
3746 | int primary; | |
6ba89f8e | 3747 | int is_partial; |
cfe507be | 3748 | int new_template_p = 0; |
c7222c02 MM |
3749 | /* True if the template is a member template, in the sense of |
3750 | [temp.mem]. */ | |
3751 | bool member_template_p = false; | |
6ba89f8e | 3752 | |
c0694c4b MM |
3753 | if (decl == error_mark_node) |
3754 | return decl; | |
3755 | ||
6ba89f8e | 3756 | /* See if this is a partial specialization. */ |
9188c363 | 3757 | is_partial = (DECL_IMPLICIT_TYPEDEF_P (decl) |
6ba89f8e | 3758 | && TREE_CODE (TREE_TYPE (decl)) != ENUMERAL_TYPE |
370af2d5 | 3759 | && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl))); |
6757edfe | 3760 | |
d63d5d0c ILT |
3761 | if (TREE_CODE (decl) == FUNCTION_DECL && DECL_FRIEND_P (decl)) |
3762 | is_friend = true; | |
f84b4be9 JM |
3763 | |
3764 | if (is_friend) | |
3765 | /* For a friend, we want the context of the friend function, not | |
3766 | the type of which it is a friend. */ | |
3767 | ctx = DECL_CONTEXT (decl); | |
4f1c5b7d MM |
3768 | else if (CP_DECL_CONTEXT (decl) |
3769 | && TREE_CODE (CP_DECL_CONTEXT (decl)) != NAMESPACE_DECL) | |
f84b4be9 JM |
3770 | /* In the case of a virtual function, we want the class in which |
3771 | it is defined. */ | |
4f1c5b7d | 3772 | ctx = CP_DECL_CONTEXT (decl); |
f84b4be9 | 3773 | else |
dc957d14 | 3774 | /* Otherwise, if we're currently defining some class, the DECL |
f84b4be9 | 3775 | is assumed to be a member of the class. */ |
9188c363 | 3776 | ctx = current_scope (); |
f84b4be9 | 3777 | |
2c73f9f5 ML |
3778 | if (ctx && TREE_CODE (ctx) == NAMESPACE_DECL) |
3779 | ctx = NULL_TREE; | |
3780 | ||
3781 | if (!DECL_CONTEXT (decl)) | |
cb0dbb9a | 3782 | DECL_CONTEXT (decl) = FROB_CONTEXT (current_namespace); |
2c73f9f5 | 3783 | |
6ba89f8e | 3784 | /* See if this is a primary template. */ |
c9cbfca6 JM |
3785 | if (is_friend && ctx) |
3786 | /* A friend template that specifies a class context, i.e. | |
3787 | template <typename T> friend void A<T>::f(); | |
3788 | is not primary. */ | |
3789 | primary = 0; | |
3790 | else | |
3791 | primary = template_parm_scope_p (); | |
9a3b49ac | 3792 | |
83566abf JM |
3793 | if (primary) |
3794 | { | |
c7222c02 MM |
3795 | if (DECL_CLASS_SCOPE_P (decl)) |
3796 | member_template_p = true; | |
2f1b1731 MM |
3797 | if (TREE_CODE (decl) == TYPE_DECL |
3798 | && ANON_AGGRNAME_P (DECL_NAME (decl))) | |
33bd39a2 | 3799 | error ("template class without a name"); |
717a7d5d | 3800 | else if (TREE_CODE (decl) == FUNCTION_DECL) |
4b0d3cbe | 3801 | { |
717a7d5d MM |
3802 | if (DECL_DESTRUCTOR_P (decl)) |
3803 | { | |
3804 | /* [temp.mem] | |
c8094d83 | 3805 | |
0cbd7506 | 3806 | A destructor shall not be a member template. */ |
0f51ccfc | 3807 | error ("destructor %qD declared as member template", decl); |
717a7d5d MM |
3808 | return error_mark_node; |
3809 | } | |
3810 | if (NEW_DELETE_OPNAME_P (DECL_NAME (decl)) | |
3811 | && (!TYPE_ARG_TYPES (TREE_TYPE (decl)) | |
3812 | || TYPE_ARG_TYPES (TREE_TYPE (decl)) == void_list_node | |
3813 | || !TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl))) | |
3814 | || (TREE_CHAIN (TYPE_ARG_TYPES ((TREE_TYPE (decl)))) | |
3815 | == void_list_node))) | |
3816 | { | |
c8094d83 | 3817 | /* [basic.stc.dynamic.allocation] |
717a7d5d | 3818 | |
0cbd7506 | 3819 | An allocation function can be a function |
717a7d5d MM |
3820 | template. ... Template allocation functions shall |
3821 | have two or more parameters. */ | |
0f51ccfc | 3822 | error ("invalid template declaration of %qD", decl); |
7c60008e | 3823 | return error_mark_node; |
717a7d5d | 3824 | } |
4b0d3cbe | 3825 | } |
8ca4bf25 MM |
3826 | else if (DECL_IMPLICIT_TYPEDEF_P (decl) |
3827 | && CLASS_TYPE_P (TREE_TYPE (decl))) | |
2aaf816d JM |
3828 | /* OK */; |
3829 | else | |
11325dcd | 3830 | { |
0f51ccfc | 3831 | error ("template declaration of %q#D", decl); |
11325dcd KL |
3832 | return error_mark_node; |
3833 | } | |
83566abf JM |
3834 | } |
3835 | ||
6ba89f8e MM |
3836 | /* Check to see that the rules regarding the use of default |
3837 | arguments are not being violated. */ | |
c8094d83 | 3838 | check_default_tmpl_args (decl, current_template_parms, |
9b7dd5e8 | 3839 | primary, is_partial, /*is_friend_decl=*/0); |
73aad9b9 | 3840 | |
5d80a306 DG |
3841 | /* Ensure that there are no parameter packs in the type of this |
3842 | declaration that have not been expanded. */ | |
b1d7b1c0 DG |
3843 | if (TREE_CODE (decl) == FUNCTION_DECL) |
3844 | { | |
3845 | /* Check each of the arguments individually to see if there are | |
3846 | any bare parameter packs. */ | |
3847 | tree type = TREE_TYPE (decl); | |
3848 | tree arg = DECL_ARGUMENTS (decl); | |
3849 | tree argtype = TYPE_ARG_TYPES (type); | |
3850 | ||
3851 | while (arg && argtype) | |
3852 | { | |
3853 | if (!FUNCTION_PARAMETER_PACK_P (arg) | |
7b3e2d46 | 3854 | && check_for_bare_parameter_packs (TREE_TYPE (arg))) |
b1d7b1c0 DG |
3855 | { |
3856 | /* This is a PARM_DECL that contains unexpanded parameter | |
3857 | packs. We have already complained about this in the | |
3858 | check_for_bare_parameter_packs call, so just replace | |
3859 | these types with ERROR_MARK_NODE. */ | |
3860 | TREE_TYPE (arg) = error_mark_node; | |
3861 | TREE_VALUE (argtype) = error_mark_node; | |
3862 | } | |
3863 | ||
3864 | arg = TREE_CHAIN (arg); | |
3865 | argtype = TREE_CHAIN (argtype); | |
3866 | } | |
3867 | ||
3868 | /* Check for bare parameter packs in the return type and the | |
3869 | exception specifiers. */ | |
7b3e2d46 | 3870 | if (check_for_bare_parameter_packs (TREE_TYPE (type))) |
046e4071 JJ |
3871 | /* Errors were already issued, set return type to int |
3872 | as the frontend doesn't expect error_mark_node as | |
3873 | the return type. */ | |
3874 | TREE_TYPE (type) = integer_type_node; | |
7b3e2d46 DG |
3875 | if (check_for_bare_parameter_packs (TYPE_RAISES_EXCEPTIONS (type))) |
3876 | TYPE_RAISES_EXCEPTIONS (type) = NULL_TREE; | |
b1d7b1c0 | 3877 | } |
7b3e2d46 | 3878 | else if (check_for_bare_parameter_packs (TREE_TYPE (decl))) |
92fab505 DG |
3879 | { |
3880 | TREE_TYPE (decl) = error_mark_node; | |
3881 | return error_mark_node; | |
3882 | } | |
5d80a306 | 3883 | |
6ba89f8e MM |
3884 | if (is_partial) |
3885 | return process_partial_specialization (decl); | |
d32789d8 | 3886 | |
9a3b49ac MS |
3887 | args = current_template_args (); |
3888 | ||
c8094d83 | 3889 | if (!ctx |
f84b4be9 | 3890 | || TREE_CODE (ctx) == FUNCTION_DECL |
a723baf1 | 3891 | || (CLASS_TYPE_P (ctx) && TYPE_BEING_DEFINED (ctx)) |
f84b4be9 | 3892 | || (is_friend && !DECL_TEMPLATE_INFO (decl))) |
8d08fdba | 3893 | { |
75650646 | 3894 | if (DECL_LANG_SPECIFIC (decl) |
f84b4be9 JM |
3895 | && DECL_TEMPLATE_INFO (decl) |
3896 | && DECL_TI_TEMPLATE (decl)) | |
3897 | tmpl = DECL_TI_TEMPLATE (decl); | |
1c10870d AS |
3898 | /* If DECL is a TYPE_DECL for a class-template, then there won't |
3899 | be DECL_LANG_SPECIFIC. The information equivalent to | |
3900 | DECL_TEMPLATE_INFO is found in TYPE_TEMPLATE_INFO instead. */ | |
c8094d83 | 3901 | else if (DECL_IMPLICIT_TYPEDEF_P (decl) |
1c10870d AS |
3902 | && TYPE_TEMPLATE_INFO (TREE_TYPE (decl)) |
3903 | && TYPE_TI_TEMPLATE (TREE_TYPE (decl))) | |
3904 | { | |
3905 | /* Since a template declaration already existed for this | |
3906 | class-type, we must be redeclaring it here. Make sure | |
0e339752 | 3907 | that the redeclaration is valid. */ |
1c10870d AS |
3908 | redeclare_class_template (TREE_TYPE (decl), |
3909 | current_template_parms); | |
3910 | /* We don't need to create a new TEMPLATE_DECL; just use the | |
3911 | one we already had. */ | |
3912 | tmpl = TYPE_TI_TEMPLATE (TREE_TYPE (decl)); | |
3913 | } | |
f84b4be9 | 3914 | else |
786b5245 | 3915 | { |
c7222c02 MM |
3916 | tmpl = build_template_decl (decl, current_template_parms, |
3917 | member_template_p); | |
cfe507be MM |
3918 | new_template_p = 1; |
3919 | ||
f84b4be9 JM |
3920 | if (DECL_LANG_SPECIFIC (decl) |
3921 | && DECL_TEMPLATE_SPECIALIZATION (decl)) | |
3922 | { | |
3923 | /* A specialization of a member template of a template | |
c6002625 | 3924 | class. */ |
f84b4be9 JM |
3925 | SET_DECL_TEMPLATE_SPECIALIZATION (tmpl); |
3926 | DECL_TEMPLATE_INFO (tmpl) = DECL_TEMPLATE_INFO (decl); | |
3927 | DECL_TEMPLATE_INFO (decl) = NULL_TREE; | |
3928 | } | |
786b5245 | 3929 | } |
8d08fdba MS |
3930 | } |
3931 | else | |
3932 | { | |
e1a5ccf7 | 3933 | tree a, t, current, parms; |
ba4f4e5d | 3934 | int i; |
91a77d68 | 3935 | tree tinfo = get_template_info (decl); |
6633d636 | 3936 | |
91a77d68 | 3937 | if (!tinfo) |
c91a56d2 | 3938 | { |
0f51ccfc | 3939 | error ("template definition of non-template %q#D", decl); |
3fe82414 | 3940 | return error_mark_node; |
c91a56d2 | 3941 | } |
91a77d68 JM |
3942 | |
3943 | tmpl = TI_TEMPLATE (tinfo); | |
c8094d83 | 3944 | |
c353b8e3 | 3945 | if (DECL_FUNCTION_TEMPLATE_P (tmpl) |
c8094d83 | 3946 | && DECL_TEMPLATE_INFO (decl) && DECL_TI_ARGS (decl) |
c353b8e3 | 3947 | && DECL_TEMPLATE_SPECIALIZATION (decl) |
c7222c02 | 3948 | && DECL_MEMBER_TEMPLATE_P (tmpl)) |
98c1c668 | 3949 | { |
e1a5ccf7 JM |
3950 | tree new_tmpl; |
3951 | ||
3952 | /* The declaration is a specialization of a member | |
3953 | template, declared outside the class. Therefore, the | |
3954 | innermost template arguments will be NULL, so we | |
3955 | replace them with the arguments determined by the | |
3956 | earlier call to check_explicit_specialization. */ | |
3957 | args = DECL_TI_ARGS (decl); | |
3958 | ||
c8094d83 | 3959 | new_tmpl |
c7222c02 MM |
3960 | = build_template_decl (decl, current_template_parms, |
3961 | member_template_p); | |
e1a5ccf7 JM |
3962 | DECL_TEMPLATE_RESULT (new_tmpl) = decl; |
3963 | TREE_TYPE (new_tmpl) = TREE_TYPE (decl); | |
3964 | DECL_TI_TEMPLATE (decl) = new_tmpl; | |
3965 | SET_DECL_TEMPLATE_SPECIALIZATION (new_tmpl); | |
c8094d83 | 3966 | DECL_TEMPLATE_INFO (new_tmpl) |
e1b3e07d | 3967 | = tree_cons (tmpl, args, NULL_TREE); |
e1a5ccf7 | 3968 | |
c8094d83 MS |
3969 | register_specialization (new_tmpl, |
3970 | most_general_template (tmpl), | |
d63d5d0c ILT |
3971 | args, |
3972 | is_friend); | |
e1a5ccf7 | 3973 | return decl; |
98c1c668 | 3974 | } |
98c1c668 | 3975 | |
e1a5ccf7 | 3976 | /* Make sure the template headers we got make sense. */ |
6633d636 | 3977 | |
e1a5ccf7 JM |
3978 | parms = DECL_TEMPLATE_PARMS (tmpl); |
3979 | i = TMPL_PARMS_DEPTH (parms); | |
3980 | if (TMPL_ARGS_DEPTH (args) != i) | |
98c1c668 | 3981 | { |
0f51ccfc | 3982 | error ("expected %d levels of template parms for %q#D, got %d", |
0cbd7506 | 3983 | i, decl, TMPL_ARGS_DEPTH (args)); |
98c1c668 | 3984 | } |
e1a5ccf7 JM |
3985 | else |
3986 | for (current = decl; i > 0; --i, parms = TREE_CHAIN (parms)) | |
3987 | { | |
3988 | a = TMPL_ARGS_LEVEL (args, i); | |
3989 | t = INNERMOST_TEMPLATE_PARMS (parms); | |
3990 | ||
3991 | if (TREE_VEC_LENGTH (t) != TREE_VEC_LENGTH (a)) | |
3992 | { | |
3993 | if (current == decl) | |
0f51ccfc | 3994 | error ("got %d template parameters for %q#D", |
0cbd7506 | 3995 | TREE_VEC_LENGTH (a), decl); |
e1a5ccf7 | 3996 | else |
0f51ccfc | 3997 | error ("got %d template parameters for %q#T", |
0cbd7506 | 3998 | TREE_VEC_LENGTH (a), current); |
33bd39a2 | 3999 | error (" but %d required", TREE_VEC_LENGTH (t)); |
f1cc0515 | 4000 | return error_mark_node; |
e1a5ccf7 | 4001 | } |
98c1c668 | 4002 | |
e1a5ccf7 JM |
4003 | if (current == decl) |
4004 | current = ctx; | |
4005 | else | |
ba75df2b PC |
4006 | current = (TYPE_P (current) |
4007 | ? TYPE_CONTEXT (current) | |
4008 | : DECL_CONTEXT (current)); | |
e1a5ccf7 | 4009 | } |
91a77d68 JM |
4010 | |
4011 | /* Check that the parms are used in the appropriate qualifying scopes | |
4012 | in the declarator. */ | |
4013 | if (!comp_template_args | |
4014 | (TI_ARGS (tinfo), | |
4015 | TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (tmpl))))) | |
4016 | { | |
4017 | error ("\ | |
4018 | template arguments to %qD do not match original template %qD", | |
4019 | decl, DECL_TEMPLATE_RESULT (tmpl)); | |
4020 | if (!uses_template_parms (TI_ARGS (tinfo))) | |
4021 | inform ("use template<> for an explicit specialization"); | |
4022 | /* Avoid crash in import_export_decl. */ | |
4023 | DECL_INTERFACE_KNOWN (decl) = 1; | |
4024 | return error_mark_node; | |
4025 | } | |
5566b478 | 4026 | } |
8d08fdba | 4027 | |
5566b478 MS |
4028 | DECL_TEMPLATE_RESULT (tmpl) = decl; |
4029 | TREE_TYPE (tmpl) = TREE_TYPE (decl); | |
8d08fdba | 4030 | |
36a117a5 MM |
4031 | /* Push template declarations for global functions and types. Note |
4032 | that we do not try to push a global template friend declared in a | |
4033 | template class; such a thing may well depend on the template | |
39c01e4c | 4034 | parameters of the class. */ |
c8094d83 | 4035 | if (new_template_p && !ctx |
36a117a5 | 4036 | && !(is_friend && template_class_depth (current_class_type) > 0)) |
c6f9f83b | 4037 | { |
d63d5d0c | 4038 | tmpl = pushdecl_namespace_level (tmpl, is_friend); |
c6f9f83b KL |
4039 | if (tmpl == error_mark_node) |
4040 | return error_mark_node; | |
bd3d082e KL |
4041 | |
4042 | /* Hide template friend classes that haven't been declared yet. */ | |
4043 | if (is_friend && TREE_CODE (decl) == TYPE_DECL) | |
4044 | { | |
4045 | DECL_ANTICIPATED (tmpl) = 1; | |
4046 | DECL_FRIEND_P (tmpl) = 1; | |
4047 | } | |
c6f9f83b | 4048 | } |
8d08fdba | 4049 | |
5566b478 | 4050 | if (primary) |
5dd236e2 | 4051 | { |
ef3b7b17 JM |
4052 | tree parms = DECL_TEMPLATE_PARMS (tmpl); |
4053 | int i; | |
4054 | ||
5dd236e2 NS |
4055 | DECL_PRIMARY_TEMPLATE (tmpl) = tmpl; |
4056 | if (DECL_CONV_FN_P (tmpl)) | |
4057 | { | |
ef3b7b17 | 4058 | int depth = TMPL_PARMS_DEPTH (parms); |
6e04241f | 4059 | |
5dd236e2 NS |
4060 | /* It is a conversion operator. See if the type converted to |
4061 | depends on innermost template operands. */ | |
c8094d83 | 4062 | |
d43f603d KL |
4063 | if (uses_template_parms_level (TREE_TYPE (TREE_TYPE (tmpl)), |
4064 | depth)) | |
5dd236e2 NS |
4065 | DECL_TEMPLATE_CONV_FN_P (tmpl) = 1; |
4066 | } | |
ef3b7b17 JM |
4067 | |
4068 | /* Give template template parms a DECL_CONTEXT of the template | |
4069 | for which they are a parameter. */ | |
4070 | parms = INNERMOST_TEMPLATE_PARMS (parms); | |
4071 | for (i = TREE_VEC_LENGTH (parms) - 1; i >= 0; --i) | |
4072 | { | |
4073 | tree parm = TREE_VALUE (TREE_VEC_ELT (parms, i)); | |
4074 | if (TREE_CODE (parm) == TEMPLATE_DECL) | |
4075 | DECL_CONTEXT (parm) = tmpl; | |
4076 | } | |
5dd236e2 | 4077 | } |
5566b478 | 4078 | |
a692ad2e | 4079 | /* The DECL_TI_ARGS of DECL contains full set of arguments referring |
28ba38e3 KL |
4080 | back to its most general template. If TMPL is a specialization, |
4081 | ARGS may only have the innermost set of arguments. Add the missing | |
4082 | argument levels if necessary. */ | |
4083 | if (DECL_TEMPLATE_INFO (tmpl)) | |
4084 | args = add_outermost_template_args (DECL_TI_ARGS (tmpl), args); | |
4085 | ||
e1b3e07d | 4086 | info = tree_cons (tmpl, args, NULL_TREE); |
5566b478 | 4087 | |
9188c363 | 4088 | if (DECL_IMPLICIT_TYPEDEF_P (decl)) |
a0ad3539 | 4089 | SET_TYPE_TEMPLATE_INFO (TREE_TYPE (tmpl), info); |
2aaf816d | 4090 | else if (DECL_LANG_SPECIFIC (decl)) |
5566b478 | 4091 | DECL_TEMPLATE_INFO (decl) = info; |
3ac3d9ea MM |
4092 | |
4093 | return DECL_TEMPLATE_RESULT (tmpl); | |
8d08fdba MS |
4094 | } |
4095 | ||
6757edfe | 4096 | tree |
3a978d72 | 4097 | push_template_decl (tree decl) |
6757edfe | 4098 | { |
d63d5d0c | 4099 | return push_template_decl_real (decl, false); |
6757edfe MM |
4100 | } |
4101 | ||
4102 | /* Called when a class template TYPE is redeclared with the indicated | |
4103 | template PARMS, e.g.: | |
7fe6899f MM |
4104 | |
4105 | template <class T> struct S; | |
4106 | template <class T> struct S {}; */ | |
4107 | ||
60feef2c | 4108 | bool |
3a978d72 | 4109 | redeclare_class_template (tree type, tree parms) |
7fe6899f | 4110 | { |
3d7de1fa | 4111 | tree tmpl; |
6757edfe | 4112 | tree tmpl_parms; |
7fe6899f MM |
4113 | int i; |
4114 | ||
3d7de1fa MM |
4115 | if (!TYPE_TEMPLATE_INFO (type)) |
4116 | { | |
0f51ccfc | 4117 | error ("%qT is not a template type", type); |
60feef2c | 4118 | return false; |
3d7de1fa MM |
4119 | } |
4120 | ||
4121 | tmpl = TYPE_TI_TEMPLATE (type); | |
7fe6899f MM |
4122 | if (!PRIMARY_TEMPLATE_P (tmpl)) |
4123 | /* The type is nested in some template class. Nothing to worry | |
4124 | about here; there are no new template parameters for the nested | |
4125 | type. */ | |
60feef2c | 4126 | return true; |
7fe6899f | 4127 | |
ee921ddf MM |
4128 | if (!parms) |
4129 | { | |
4130 | error ("template specifiers not specified in declaration of %qD", | |
4131 | tmpl); | |
60feef2c | 4132 | return false; |
ee921ddf MM |
4133 | } |
4134 | ||
6757edfe MM |
4135 | parms = INNERMOST_TEMPLATE_PARMS (parms); |
4136 | tmpl_parms = DECL_INNERMOST_TEMPLATE_PARMS (tmpl); | |
4137 | ||
7fe6899f MM |
4138 | if (TREE_VEC_LENGTH (parms) != TREE_VEC_LENGTH (tmpl_parms)) |
4139 | { | |
b131ad7c MLI |
4140 | error ("redeclared with %d template parameter(s)", |
4141 | TREE_VEC_LENGTH (parms)); | |
4142 | inform ("previous declaration %q+D used %d template parameter(s)", | |
4143 | tmpl, TREE_VEC_LENGTH (tmpl_parms)); | |
60feef2c | 4144 | return false; |
7fe6899f MM |
4145 | } |
4146 | ||
4147 | for (i = 0; i < TREE_VEC_LENGTH (tmpl_parms); ++i) | |
4148 | { | |
2d8ba2c7 LM |
4149 | tree tmpl_parm; |
4150 | tree parm; | |
4151 | tree tmpl_default; | |
4152 | tree parm_default; | |
4153 | ||
4154 | if (TREE_VEC_ELT (tmpl_parms, i) == error_mark_node | |
4155 | || TREE_VEC_ELT (parms, i) == error_mark_node) | |
4156 | continue; | |
4157 | ||
4158 | tmpl_parm = TREE_VALUE (TREE_VEC_ELT (tmpl_parms, i)); | |
4159 | parm = TREE_VALUE (TREE_VEC_ELT (parms, i)); | |
4160 | tmpl_default = TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms, i)); | |
4161 | parm_default = TREE_PURPOSE (TREE_VEC_ELT (parms, i)); | |
7fe6899f | 4162 | |
2649701f KL |
4163 | /* TMPL_PARM and PARM can be either TYPE_DECL, PARM_DECL, or |
4164 | TEMPLATE_DECL. */ | |
0f67a82f | 4165 | if (tmpl_parm != error_mark_node |
a022041e DG |
4166 | && (TREE_CODE (tmpl_parm) != TREE_CODE (parm) |
4167 | || (TREE_CODE (tmpl_parm) != TYPE_DECL | |
4168 | && !same_type_p (TREE_TYPE (tmpl_parm), TREE_TYPE (parm))) | |
4169 | || (TREE_CODE (tmpl_parm) != PARM_DECL | |
4170 | && (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (tmpl_parm)) | |
4171 | != TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm)))) | |
4172 | || (TREE_CODE (tmpl_parm) == PARM_DECL | |
4173 | && (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (tmpl_parm)) | |
4174 | != TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm)))))) | |
7fe6899f | 4175 | { |
dee15844 | 4176 | error ("template parameter %q+#D", tmpl_parm); |
0f51ccfc | 4177 | error ("redeclared here as %q#D", parm); |
60feef2c | 4178 | return false; |
7fe6899f MM |
4179 | } |
4180 | ||
4181 | if (tmpl_default != NULL_TREE && parm_default != NULL_TREE) | |
4182 | { | |
4183 | /* We have in [temp.param]: | |
4184 | ||
4185 | A template-parameter may not be given default arguments | |
4186 | by two different declarations in the same scope. */ | |
0f51ccfc | 4187 | error ("redefinition of default argument for %q#D", parm); |
b131ad7c | 4188 | inform ("%Joriginal definition appeared here", tmpl_parm); |
60feef2c | 4189 | return false; |
7fe6899f MM |
4190 | } |
4191 | ||
4192 | if (parm_default != NULL_TREE) | |
4193 | /* Update the previous template parameters (which are the ones | |
4194 | that will really count) with the new default value. */ | |
4195 | TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms, i)) = parm_default; | |
7ce74c5e MM |
4196 | else if (tmpl_default != NULL_TREE) |
4197 | /* Update the new parameters, too; they'll be used as the | |
4198 | parameters for any members. */ | |
4199 | TREE_PURPOSE (TREE_VEC_ELT (parms, i)) = tmpl_default; | |
7fe6899f | 4200 | } |
60feef2c LM |
4201 | |
4202 | return true; | |
7fe6899f | 4203 | } |
75650646 | 4204 | |
9baa27a9 MM |
4205 | /* Simplify EXPR if it is a non-dependent expression. Returns the |
4206 | (possibly simplified) expression. */ | |
4207 | ||
4208 | tree | |
4209 | fold_non_dependent_expr (tree expr) | |
4210 | { | |
d4a200d3 SM |
4211 | if (expr == NULL_TREE) |
4212 | return NULL_TREE; | |
4213 | ||
9baa27a9 MM |
4214 | /* If we're in a template, but EXPR isn't value dependent, simplify |
4215 | it. We're supposed to treat: | |
c8094d83 | 4216 | |
9baa27a9 MM |
4217 | template <typename T> void f(T[1 + 1]); |
4218 | template <typename T> void f(T[2]); | |
c8094d83 | 4219 | |
9baa27a9 MM |
4220 | as two declarations of the same function, for example. */ |
4221 | if (processing_template_decl | |
4222 | && !type_dependent_expression_p (expr) | |
7416ab02 | 4223 | && !value_dependent_expression_p (expr)) |
9baa27a9 MM |
4224 | { |
4225 | HOST_WIDE_INT saved_processing_template_decl; | |
4226 | ||
4227 | saved_processing_template_decl = processing_template_decl; | |
4228 | processing_template_decl = 0; | |
4229 | expr = tsubst_copy_and_build (expr, | |
4230 | /*args=*/NULL_TREE, | |
4231 | tf_error, | |
4232 | /*in_decl=*/NULL_TREE, | |
015c2c66 MM |
4233 | /*function_p=*/false, |
4234 | /*integral_constant_expression_p=*/true); | |
9baa27a9 MM |
4235 | processing_template_decl = saved_processing_template_decl; |
4236 | } | |
4237 | return expr; | |
4238 | } | |
4239 | ||
b6ab6892 GB |
4240 | /* EXPR is an expression which is used in a constant-expression context. |
4241 | For instance, it could be a VAR_DECL with a constant initializer. | |
4242 | Extract the innest constant expression. | |
c8094d83 | 4243 | |
8a784e4a NS |
4244 | This is basically a more powerful version of |
4245 | integral_constant_value, which can be used also in templates where | |
4246 | initializers can maintain a syntactic rather than semantic form | |
4247 | (even if they are non-dependent, for access-checking purposes). */ | |
b6ab6892 | 4248 | |
993acaec | 4249 | static tree |
b6ab6892 GB |
4250 | fold_decl_constant_value (tree expr) |
4251 | { | |
4ef69b83 GB |
4252 | tree const_expr = expr; |
4253 | do | |
b6ab6892 | 4254 | { |
b6ab6892 | 4255 | expr = fold_non_dependent_expr (const_expr); |
4ef69b83 | 4256 | const_expr = integral_constant_value (expr); |
b6ab6892 | 4257 | } |
4ef69b83 | 4258 | while (expr != const_expr); |
b6ab6892 | 4259 | |
8a784e4a | 4260 | return expr; |
b6ab6892 GB |
4261 | } |
4262 | ||
4263 | /* Subroutine of convert_nontype_argument. Converts EXPR to TYPE, which | |
4264 | must be a function or a pointer-to-function type, as specified | |
4265 | in [temp.arg.nontype]: disambiguate EXPR if it is an overload set, | |
4266 | and check that the resulting function has external linkage. */ | |
4267 | ||
4268 | static tree | |
4269 | convert_nontype_argument_function (tree type, tree expr) | |
4270 | { | |
4271 | tree fns = expr; | |
4272 | tree fn, fn_no_ptr; | |
4273 | ||
4274 | fn = instantiate_type (type, fns, tf_none); | |
4275 | if (fn == error_mark_node) | |
4276 | return error_mark_node; | |
4277 | ||
4278 | fn_no_ptr = fn; | |
4279 | if (TREE_CODE (fn_no_ptr) == ADDR_EXPR) | |
4280 | fn_no_ptr = TREE_OPERAND (fn_no_ptr, 0); | |
eff3a276 MM |
4281 | if (TREE_CODE (fn_no_ptr) == BASELINK) |
4282 | fn_no_ptr = BASELINK_FUNCTIONS (fn_no_ptr); | |
4283 | ||
b6ab6892 GB |
4284 | /* [temp.arg.nontype]/1 |
4285 | ||
4286 | A template-argument for a non-type, non-template template-parameter | |
4287 | shall be one of: | |
4288 | [...] | |
4289 | -- the address of an object or function with external linkage. */ | |
4290 | if (!DECL_EXTERNAL_LINKAGE_P (fn_no_ptr)) | |
4291 | { | |
4292 | error ("%qE is not a valid template argument for type %qT " | |
4293 | "because function %qD has not external linkage", | |
4294 | expr, type, fn_no_ptr); | |
4295 | return NULL_TREE; | |
4296 | } | |
4297 | ||
4298 | return fn; | |
4299 | } | |
4300 | ||
75650646 MM |
4301 | /* Attempt to convert the non-type template parameter EXPR to the |
4302 | indicated TYPE. If the conversion is successful, return the | |
dc957d14 | 4303 | converted value. If the conversion is unsuccessful, return |
75650646 MM |
4304 | NULL_TREE if we issued an error message, or error_mark_node if we |
4305 | did not. We issue error messages for out-and-out bad template | |
4306 | parameters, but not simply because the conversion failed, since we | |
9baa27a9 | 4307 | might be just trying to do argument deduction. Both TYPE and EXPR |
b6ab6892 GB |
4308 | must be non-dependent. |
4309 | ||
4310 | The conversion follows the special rules described in | |
4311 | [temp.arg.nontype], and it is much more strict than an implicit | |
4312 | conversion. | |
4313 | ||
4314 | This function is called twice for each template argument (see | |
4315 | lookup_template_class for a more accurate description of this | |
4316 | problem). This means that we need to handle expressions which | |
4317 | are not valid in a C++ source, but can be created from the | |
4318 | first call (for instance, casts to perform conversions). These | |
4319 | hacks can go away after we fix the double coercion problem. */ | |
75650646 MM |
4320 | |
4321 | static tree | |
3a978d72 | 4322 | convert_nontype_argument (tree type, tree expr) |
75650646 | 4323 | { |
9baa27a9 MM |
4324 | tree expr_type; |
4325 | ||
b6ab6892 GB |
4326 | /* Detect immediately string literals as invalid non-type argument. |
4327 | This special-case is not needed for correctness (we would easily | |
4328 | catch this later), but only to provide better diagnostic for this | |
4329 | common user mistake. As suggested by DR 100, we do not mention | |
4330 | linkage issues in the diagnostic as this is not the point. */ | |
4331 | if (TREE_CODE (expr) == STRING_CST) | |
4332 | { | |
4333 | error ("%qE is not a valid template argument for type %qT " | |
4334 | "because string literals can never be used in this context", | |
4335 | expr, type); | |
4336 | return NULL_TREE; | |
4337 | } | |
4338 | ||
9baa27a9 MM |
4339 | /* If we are in a template, EXPR may be non-dependent, but still |
4340 | have a syntactic, rather than semantic, form. For example, EXPR | |
4341 | might be a SCOPE_REF, rather than the VAR_DECL to which the | |
4342 | SCOPE_REF refers. Preserving the qualifying scope is necessary | |
4343 | so that access checking can be performed when the template is | |
4344 | instantiated -- but here we need the resolved form so that we can | |
4345 | convert the argument. */ | |
4346 | expr = fold_non_dependent_expr (expr); | |
b166a559 VR |
4347 | if (error_operand_p (expr)) |
4348 | return error_mark_node; | |
9baa27a9 | 4349 | expr_type = TREE_TYPE (expr); |
75650646 | 4350 | |
b6ab6892 GB |
4351 | /* HACK: Due to double coercion, we can get a |
4352 | NOP_EXPR<REFERENCE_TYPE>(ADDR_EXPR<POINTER_TYPE> (arg)) here, | |
4353 | which is the tree that we built on the first call (see | |
4354 | below when coercing to reference to object or to reference to | |
4355 | function). We just strip everything and get to the arg. | |
4356 | See g++.old-deja/g++.oliva/template4.C and g++.dg/template/nontype9.C | |
4357 | for examples. */ | |
4358 | if (TREE_CODE (expr) == NOP_EXPR) | |
75650646 | 4359 | { |
b6ab6892 | 4360 | if (TYPE_REF_OBJ_P (type) || TYPE_REFFN_P (type)) |
75650646 | 4361 | { |
b6ab6892 GB |
4362 | /* ??? Maybe we could use convert_from_reference here, but we |
4363 | would need to relax its constraints because the NOP_EXPR | |
4364 | could actually change the type to something more cv-qualified, | |
4365 | and this is not folded by convert_from_reference. */ | |
4366 | tree addr = TREE_OPERAND (expr, 0); | |
4367 | gcc_assert (TREE_CODE (expr_type) == REFERENCE_TYPE); | |
4368 | gcc_assert (TREE_CODE (addr) == ADDR_EXPR); | |
4369 | gcc_assert (TREE_CODE (TREE_TYPE (addr)) == POINTER_TYPE); | |
4370 | gcc_assert (same_type_ignoring_top_level_qualifiers_p | |
4371 | (TREE_TYPE (expr_type), | |
4372 | TREE_TYPE (TREE_TYPE (addr)))); | |
4373 | ||
4374 | expr = TREE_OPERAND (addr, 0); | |
4375 | expr_type = TREE_TYPE (expr); | |
75650646 MM |
4376 | } |
4377 | ||
b6ab6892 GB |
4378 | /* We could also generate a NOP_EXPR(ADDR_EXPR()) when the |
4379 | parameter is a pointer to object, through decay and | |
4380 | qualification conversion. Let's strip everything. */ | |
4381 | else if (TYPE_PTROBV_P (type)) | |
75650646 | 4382 | { |
b6ab6892 GB |
4383 | STRIP_NOPS (expr); |
4384 | gcc_assert (TREE_CODE (expr) == ADDR_EXPR); | |
4385 | gcc_assert (TREE_CODE (TREE_TYPE (expr)) == POINTER_TYPE); | |
4386 | /* Skip the ADDR_EXPR only if it is part of the decay for | |
4387 | an array. Otherwise, it is part of the original argument | |
4388 | in the source code. */ | |
4389 | if (TREE_CODE (TREE_TYPE (TREE_OPERAND (expr, 0))) == ARRAY_TYPE) | |
4390 | expr = TREE_OPERAND (expr, 0); | |
4391 | expr_type = TREE_TYPE (expr); | |
f3400fe2 | 4392 | } |
75650646 | 4393 | } |
c61dce3a | 4394 | |
b6ab6892 | 4395 | /* [temp.arg.nontype]/5, bullet 1 |
75650646 | 4396 | |
b6ab6892 GB |
4397 | For a non-type template-parameter of integral or enumeration type, |
4398 | integral promotions (_conv.prom_) and integral conversions | |
4399 | (_conv.integral_) are applied. */ | |
4400 | if (INTEGRAL_TYPE_P (type)) | |
75650646 | 4401 | { |
75650646 MM |
4402 | if (!INTEGRAL_TYPE_P (expr_type)) |
4403 | return error_mark_node; | |
fddabb2c | 4404 | |
b6ab6892 GB |
4405 | expr = fold_decl_constant_value (expr); |
4406 | /* Notice that there are constant expressions like '4 % 0' which | |
4407 | do not fold into integer constants. */ | |
db02b6b9 | 4408 | if (TREE_CODE (expr) != INTEGER_CST) |
b6ab6892 GB |
4409 | { |
4410 | error ("%qE is not a valid template argument for type %qT " | |
4411 | "because it is a non-constant expression", expr, type); | |
4412 | return NULL_TREE; | |
4413 | } | |
75650646 | 4414 | |
b6ab6892 GB |
4415 | /* At this point, an implicit conversion does what we want, |
4416 | because we already know that the expression is of integral | |
4417 | type. */ | |
4418 | expr = ocp_convert (type, expr, CONV_IMPLICIT, LOOKUP_PROTECT); | |
4419 | if (expr == error_mark_node) | |
4420 | return error_mark_node; | |
75650646 | 4421 | |
b6ab6892 GB |
4422 | /* Conversion was allowed: fold it to a bare integer constant. */ |
4423 | expr = fold (expr); | |
4424 | } | |
4425 | /* [temp.arg.nontype]/5, bullet 2 | |
75650646 | 4426 | |
b6ab6892 GB |
4427 | For a non-type template-parameter of type pointer to object, |
4428 | qualification conversions (_conv.qual_) and the array-to-pointer | |
4429 | conversion (_conv.array_) are applied. */ | |
4430 | else if (TYPE_PTROBV_P (type)) | |
4431 | { | |
4432 | /* [temp.arg.nontype]/1 (TC1 version, DR 49): | |
75650646 | 4433 | |
b6ab6892 GB |
4434 | A template-argument for a non-type, non-template template-parameter |
4435 | shall be one of: [...] | |
75650646 | 4436 | |
b6ab6892 GB |
4437 | -- the name of a non-type template-parameter; |
4438 | -- the address of an object or function with external linkage, [...] | |
4439 | expressed as "& id-expression" where the & is optional if the name | |
4440 | refers to a function or array, or if the corresponding | |
4441 | template-parameter is a reference. | |
c8094d83 | 4442 | |
b6ab6892 GB |
4443 | Here, we do not care about functions, as they are invalid anyway |
4444 | for a parameter of type pointer-to-object. */ | |
1082fd10 MM |
4445 | |
4446 | if (DECL_P (expr) && DECL_TEMPLATE_PARM_P (expr)) | |
4447 | /* Non-type template parameters are OK. */ | |
4448 | ; | |
4449 | else if (TREE_CODE (expr) != ADDR_EXPR | |
4450 | && TREE_CODE (expr_type) != ARRAY_TYPE) | |
4451 | { | |
4452 | if (TREE_CODE (expr) == VAR_DECL) | |
4453 | { | |
4454 | error ("%qD is not a valid template argument " | |
4455 | "because %qD is a variable, not the address of " | |
4456 | "a variable", | |
4457 | expr, expr); | |
4458 | return NULL_TREE; | |
4459 | } | |
4460 | /* Other values, like integer constants, might be valid | |
4461 | non-type arguments of some other type. */ | |
4462 | return error_mark_node; | |
4463 | } | |
4464 | else | |
4465 | { | |
4466 | tree decl; | |
4467 | ||
4468 | decl = ((TREE_CODE (expr) == ADDR_EXPR) | |
4469 | ? TREE_OPERAND (expr, 0) : expr); | |
4470 | if (TREE_CODE (decl) != VAR_DECL) | |
4471 | { | |
4472 | error ("%qE is not a valid template argument of type %qT " | |
4473 | "because %qE is not a variable", | |
4474 | expr, type, decl); | |
4475 | return NULL_TREE; | |
4476 | } | |
4477 | else if (!DECL_EXTERNAL_LINKAGE_P (decl)) | |
4478 | { | |
4479 | error ("%qE is not a valid template argument of type %qT " | |
4480 | "because %qD does not have external linkage", | |
4481 | expr, type, decl); | |
4482 | return NULL_TREE; | |
4483 | } | |
4484 | } | |
b6ab6892 GB |
4485 | |
4486 | expr = decay_conversion (expr); | |
4487 | if (expr == error_mark_node) | |
4488 | return error_mark_node; | |
75650646 | 4489 | |
b6ab6892 GB |
4490 | expr = perform_qualification_conversions (type, expr); |
4491 | if (expr == error_mark_node) | |
4492 | return error_mark_node; | |
b6ab6892 GB |
4493 | } |
4494 | /* [temp.arg.nontype]/5, bullet 3 | |
4495 | ||
4496 | For a non-type template-parameter of type reference to object, no | |
4497 | conversions apply. The type referred to by the reference may be more | |
4498 | cv-qualified than the (otherwise identical) type of the | |
4499 | template-argument. The template-parameter is bound directly to the | |
4500 | template-argument, which must be an lvalue. */ | |
4501 | else if (TYPE_REF_OBJ_P (type)) | |
4502 | { | |
4503 | if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type), | |
4504 | expr_type)) | |
4505 | return error_mark_node; | |
75650646 | 4506 | |
b6ab6892 GB |
4507 | if (!at_least_as_qualified_p (TREE_TYPE (type), expr_type)) |
4508 | { | |
4509 | error ("%qE is not a valid template argument for type %qT " | |
4510 | "because of conflicts in cv-qualification", expr, type); | |
4511 | return NULL_TREE; | |
4512 | } | |
c8094d83 | 4513 | |
b6ab6892 GB |
4514 | if (!real_lvalue_p (expr)) |
4515 | { | |
4516 | error ("%qE is not a valid template argument for type %qT " | |
944fd207 | 4517 | "because it is not an lvalue", expr, type); |
b6ab6892 GB |
4518 | return NULL_TREE; |
4519 | } | |
e6e174e5 | 4520 | |
b6ab6892 | 4521 | /* [temp.arg.nontype]/1 |
75650646 | 4522 | |
b6ab6892 GB |
4523 | A template-argument for a non-type, non-template template-parameter |
4524 | shall be one of: [...] | |
75650646 | 4525 | |
03fd3f84 | 4526 | -- the address of an object or function with external linkage. */ |
b6ab6892 GB |
4527 | if (!DECL_EXTERNAL_LINKAGE_P (expr)) |
4528 | { | |
4529 | error ("%qE is not a valid template argument for type %qT " | |
4530 | "because object %qD has not external linkage", | |
4531 | expr, type, expr); | |
4532 | return NULL_TREE; | |
4533 | } | |
0dc09a61 | 4534 | |
b6ab6892 GB |
4535 | expr = build_nop (type, build_address (expr)); |
4536 | } | |
4537 | /* [temp.arg.nontype]/5, bullet 4 | |
4538 | ||
4539 | For a non-type template-parameter of type pointer to function, only | |
4540 | the function-to-pointer conversion (_conv.func_) is applied. If the | |
4541 | template-argument represents a set of overloaded functions (or a | |
4542 | pointer to such), the matching function is selected from the set | |
4543 | (_over.over_). */ | |
4544 | else if (TYPE_PTRFN_P (type)) | |
4545 | { | |
4546 | /* If the argument is a template-id, we might not have enough | |
2c164de6 | 4547 | context information to decay the pointer. */ |
b6ab6892 GB |
4548 | if (!type_unknown_p (expr_type)) |
4549 | { | |
4550 | expr = decay_conversion (expr); | |
4551 | if (expr == error_mark_node) | |
4552 | return error_mark_node; | |
4553 | } | |
75650646 | 4554 | |
b6ab6892 GB |
4555 | expr = convert_nontype_argument_function (type, expr); |
4556 | if (!expr || expr == error_mark_node) | |
4557 | return expr; | |
4558 | } | |
4559 | /* [temp.arg.nontype]/5, bullet 5 | |
75650646 | 4560 | |
b6ab6892 GB |
4561 | For a non-type template-parameter of type reference to function, no |
4562 | conversions apply. If the template-argument represents a set of | |
4563 | overloaded functions, the matching function is selected from the set | |
4564 | (_over.over_). */ | |
4565 | else if (TYPE_REFFN_P (type)) | |
4566 | { | |
4567 | if (TREE_CODE (expr) == ADDR_EXPR) | |
4568 | { | |
4569 | error ("%qE is not a valid template argument for type %qT " | |
4570 | "because it is a pointer", expr, type); | |
4571 | inform ("try using %qE instead", TREE_OPERAND (expr, 0)); | |
4572 | return NULL_TREE; | |
4573 | } | |
75650646 | 4574 | |
b6ab6892 GB |
4575 | expr = convert_nontype_argument_function (TREE_TYPE (type), expr); |
4576 | if (!expr || expr == error_mark_node) | |
4577 | return expr; | |
75650646 | 4578 | |
7866705a | 4579 | expr = build_nop (type, build_address (expr)); |
b6ab6892 GB |
4580 | } |
4581 | /* [temp.arg.nontype]/5, bullet 6 | |
75650646 | 4582 | |
b6ab6892 GB |
4583 | For a non-type template-parameter of type pointer to member function, |
4584 | no conversions apply. If the template-argument represents a set of | |
4585 | overloaded member functions, the matching member function is selected | |
4586 | from the set (_over.over_). */ | |
4587 | else if (TYPE_PTRMEMFUNC_P (type)) | |
4588 | { | |
4589 | expr = instantiate_type (type, expr, tf_none); | |
4590 | if (expr == error_mark_node) | |
4591 | return error_mark_node; | |
75650646 | 4592 | |
b6ab6892 GB |
4593 | /* There is no way to disable standard conversions in |
4594 | resolve_address_of_overloaded_function (called by | |
4595 | instantiate_type). It is possible that the call succeeded by | |
4596 | converting &B::I to &D::I (where B is a base of D), so we need | |
4597 | to reject this conversion here. | |
75650646 | 4598 | |
b6ab6892 GB |
4599 | Actually, even if there was a way to disable standard conversions, |
4600 | it would still be better to reject them here so that we can | |
4601 | provide a superior diagnostic. */ | |
4602 | if (!same_type_p (TREE_TYPE (expr), type)) | |
4603 | { | |
4604 | /* Make sure we are just one standard conversion off. */ | |
4605 | gcc_assert (can_convert (type, TREE_TYPE (expr))); | |
4606 | error ("%qE is not a valid template argument for type %qT " | |
4607 | "because it is of type %qT", expr, type, | |
4608 | TREE_TYPE (expr)); | |
4609 | inform ("standard conversions are not allowed in this context"); | |
4610 | return NULL_TREE; | |
4611 | } | |
4612 | } | |
4613 | /* [temp.arg.nontype]/5, bullet 7 | |
59e7a901 | 4614 | |
b6ab6892 GB |
4615 | For a non-type template-parameter of type pointer to data member, |
4616 | qualification conversions (_conv.qual_) are applied. */ | |
4617 | else if (TYPE_PTRMEM_P (type)) | |
4618 | { | |
4619 | expr = perform_qualification_conversions (type, expr); | |
4620 | if (expr == error_mark_node) | |
75650646 | 4621 | return expr; |
75650646 | 4622 | } |
b6ab6892 GB |
4623 | /* A template non-type parameter must be one of the above. */ |
4624 | else | |
4625 | gcc_unreachable (); | |
75650646 | 4626 | |
b6ab6892 GB |
4627 | /* Sanity check: did we actually convert the argument to the |
4628 | right type? */ | |
4629 | gcc_assert (same_type_p (type, TREE_TYPE (expr))); | |
4630 | return expr; | |
75650646 MM |
4631 | } |
4632 | ||
a0a5f30f DG |
4633 | /* Subroutine of coerce_template_template_parms, which returns 1 if |
4634 | PARM_PARM and ARG_PARM match using the rule for the template | |
4635 | parameters of template template parameters. Both PARM and ARG are | |
4636 | template parameters; the rest of the arguments are the same as for | |
4637 | coerce_template_template_parms. | |
4638 | */ | |
4639 | static int | |
4640 | coerce_template_template_parm (tree parm, | |
4641 | tree arg, | |
4642 | tsubst_flags_t complain, | |
4643 | tree in_decl, | |
4644 | tree outer_args) | |
4645 | { | |
4646 | if (arg == NULL_TREE || arg == error_mark_node | |
4647 | || parm == NULL_TREE || parm == error_mark_node) | |
4648 | return 0; | |
4649 | ||
4650 | if (TREE_CODE (arg) != TREE_CODE (parm)) | |
4651 | return 0; | |
4652 | ||
4653 | switch (TREE_CODE (parm)) | |
4654 | { | |
4655 | case TEMPLATE_DECL: | |
4656 | /* We encounter instantiations of templates like | |
4657 | template <template <template <class> class> class TT> | |
4658 | class C; */ | |
4659 | { | |
4660 | tree parmparm = DECL_INNERMOST_TEMPLATE_PARMS (parm); | |
4661 | tree argparm = DECL_INNERMOST_TEMPLATE_PARMS (arg); | |
4662 | ||
4663 | if (!coerce_template_template_parms | |
4664 | (parmparm, argparm, complain, in_decl, outer_args)) | |
4665 | return 0; | |
4666 | } | |
4667 | /* Fall through. */ | |
4668 | ||
4669 | case TYPE_DECL: | |
4670 | if (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (arg)) | |
4671 | && !TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm))) | |
4672 | /* Argument is a parameter pack but parameter is not. */ | |
4673 | return 0; | |
4674 | break; | |
4675 | ||
4676 | case PARM_DECL: | |
4677 | /* The tsubst call is used to handle cases such as | |
4678 | ||
4679 | template <int> class C {}; | |
4680 | template <class T, template <T> class TT> class D {}; | |
4681 | D<int, C> d; | |
4682 | ||
4683 | i.e. the parameter list of TT depends on earlier parameters. */ | |
4684 | if (!dependent_type_p (TREE_TYPE (arg)) | |
4685 | && !same_type_p | |
4686 | (tsubst (TREE_TYPE (parm), outer_args, complain, in_decl), | |
4687 | TREE_TYPE (arg))) | |
4688 | return 0; | |
4689 | ||
4690 | if (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (arg)) | |
4691 | && !TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm))) | |
4692 | /* Argument is a parameter pack but parameter is not. */ | |
4693 | return 0; | |
4694 | ||
4695 | break; | |
4696 | ||
4697 | default: | |
4698 | gcc_unreachable (); | |
4699 | } | |
4700 | ||
4701 | return 1; | |
4702 | } | |
4703 | ||
b6ab6892 | 4704 | |
c8094d83 MS |
4705 | /* Return 1 if PARM_PARMS and ARG_PARMS matches using rule for |
4706 | template template parameters. Both PARM_PARMS and ARG_PARMS are | |
4707 | vectors of TREE_LIST nodes containing TYPE_DECL, TEMPLATE_DECL | |
744fac59 | 4708 | or PARM_DECL. |
c8094d83 | 4709 | |
744fac59 | 4710 | Consider the example: |
e7e93965 MM |
4711 | template <class T> class A; |
4712 | template<template <class U> class TT> class B; | |
744fac59 | 4713 | |
e7e93965 MM |
4714 | For B<A>, PARM_PARMS are the parameters to TT, while ARG_PARMS are |
4715 | the parameters to A, and OUTER_ARGS contains A. */ | |
744fac59 KL |
4716 | |
4717 | static int | |
c8094d83 | 4718 | coerce_template_template_parms (tree parm_parms, |
0cbd7506 MS |
4719 | tree arg_parms, |
4720 | tsubst_flags_t complain, | |
3a978d72 | 4721 | tree in_decl, |
0cbd7506 | 4722 | tree outer_args) |
744fac59 KL |
4723 | { |
4724 | int nparms, nargs, i; | |
4725 | tree parm, arg; | |
a0a5f30f | 4726 | int variadic_p = 0; |
744fac59 | 4727 | |
50bc768d NS |
4728 | gcc_assert (TREE_CODE (parm_parms) == TREE_VEC); |
4729 | gcc_assert (TREE_CODE (arg_parms) == TREE_VEC); | |
744fac59 KL |
4730 | |
4731 | nparms = TREE_VEC_LENGTH (parm_parms); | |
4732 | nargs = TREE_VEC_LENGTH (arg_parms); | |
4733 | ||
a0a5f30f DG |
4734 | /* Determine whether we have a parameter pack at the end of the |
4735 | template template parameter's template parameter list. */ | |
4736 | if (TREE_VEC_ELT (parm_parms, nparms - 1) != error_mark_node) | |
4737 | { | |
4738 | parm = TREE_VALUE (TREE_VEC_ELT (parm_parms, nparms - 1)); | |
4739 | ||
4740 | switch (TREE_CODE (parm)) | |
4741 | { | |
4742 | case TEMPLATE_DECL: | |
4743 | case TYPE_DECL: | |
4744 | if (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm))) | |
4745 | variadic_p = 1; | |
4746 | break; | |
4747 | ||
4748 | case PARM_DECL: | |
4749 | if (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm))) | |
4750 | variadic_p = 1; | |
4751 | break; | |
4752 | ||
4753 | default: | |
4754 | gcc_unreachable (); | |
4755 | } | |
4756 | } | |
4757 | ||
4758 | if (nargs != nparms | |
4759 | && !(variadic_p && nargs >= nparms - 1)) | |
744fac59 KL |
4760 | return 0; |
4761 | ||
a0a5f30f DG |
4762 | /* Check all of the template parameters except the parameter pack at |
4763 | the end (if any). */ | |
4764 | for (i = 0; i < nparms - variadic_p; ++i) | |
744fac59 | 4765 | { |
2d8ba2c7 LM |
4766 | if (TREE_VEC_ELT (parm_parms, i) == error_mark_node |
4767 | || TREE_VEC_ELT (arg_parms, i) == error_mark_node) | |
42b304f1 LM |
4768 | continue; |
4769 | ||
744fac59 KL |
4770 | parm = TREE_VALUE (TREE_VEC_ELT (parm_parms, i)); |
4771 | arg = TREE_VALUE (TREE_VEC_ELT (arg_parms, i)); | |
4772 | ||
a0a5f30f DG |
4773 | if (!coerce_template_template_parm (parm, arg, complain, in_decl, |
4774 | outer_args)) | |
744fac59 KL |
4775 | return 0; |
4776 | ||
a0a5f30f | 4777 | } |
00bdb87f | 4778 | |
a0a5f30f DG |
4779 | if (variadic_p) |
4780 | { | |
4781 | /* Check each of the template parameters in the template | |
4782 | argument against the template parameter pack at the end of | |
4783 | the template template parameter. */ | |
4784 | if (TREE_VEC_ELT (parm_parms, i) == error_mark_node) | |
4785 | return 0; | |
5d80a306 | 4786 | |
a0a5f30f | 4787 | parm = TREE_VALUE (TREE_VEC_ELT (parm_parms, i)); |
c8094d83 | 4788 | |
a0a5f30f DG |
4789 | for (; i < nargs; ++i) |
4790 | { | |
4791 | if (TREE_VEC_ELT (arg_parms, i) == error_mark_node) | |
4792 | continue; | |
4793 | ||
4794 | arg = TREE_VALUE (TREE_VEC_ELT (arg_parms, i)); | |
4795 | ||
4796 | if (!coerce_template_template_parm (parm, arg, complain, in_decl, | |
4797 | outer_args)) | |
4798 | return 0; | |
4799 | } | |
744fac59 | 4800 | } |
a0a5f30f | 4801 | |
744fac59 KL |
4802 | return 1; |
4803 | } | |
4804 | ||
4cf36211 DG |
4805 | /* Verifies that the deduced template arguments (in TARGS) for the |
4806 | template template parameters (in TPARMS) represent valid bindings, | |
4807 | by comparing the template parameter list of each template argument | |
4808 | to the template parameter list of its corresponding template | |
4809 | template parameter, in accordance with DR150. This | |
4810 | routine can only be called after all template arguments have been | |
4811 | deduced. It will return TRUE if all of the template template | |
4812 | parameter bindings are okay, FALSE otherwise. */ | |
4813 | bool | |
4814 | template_template_parm_bindings_ok_p (tree tparms, tree targs) | |
4815 | { | |
4816 | int i, ntparms = TREE_VEC_LENGTH (tparms); | |
4817 | ||
4818 | targs = INNERMOST_TEMPLATE_ARGS (targs); | |
4819 | ||
4820 | for (i = 0; i < ntparms; ++i) | |
4821 | { | |
4822 | tree tparm = TREE_VALUE (TREE_VEC_ELT (tparms, i)); | |
4823 | tree targ = TREE_VEC_ELT (targs, i); | |
4824 | ||
4825 | if (TREE_CODE (tparm) == TEMPLATE_DECL && targ) | |
4826 | { | |
4827 | tree packed_args = NULL_TREE; | |
4828 | int idx, len = 1; | |
4829 | ||
4830 | if (ARGUMENT_PACK_P (targ)) | |
4831 | { | |
4832 | /* Look inside the argument pack. */ | |
4833 | packed_args = ARGUMENT_PACK_ARGS (targ); | |
4834 | len = TREE_VEC_LENGTH (packed_args); | |
4835 | } | |
4836 | ||
4837 | for (idx = 0; idx < len; ++idx) | |
4838 | { | |
4839 | tree targ_parms = NULL_TREE; | |
4840 | ||
4841 | if (packed_args) | |
4842 | /* Extract the next argument from the argument | |
4843 | pack. */ | |
4844 | targ = TREE_VEC_ELT (packed_args, idx); | |
4845 | ||
4846 | if (PACK_EXPANSION_P (targ)) | |
4847 | /* Look at the pattern of the pack expansion. */ | |
4848 | targ = PACK_EXPANSION_PATTERN (targ); | |
4849 | ||
4850 | /* Extract the template parameters from the template | |
4851 | argument. */ | |
4852 | if (TREE_CODE (targ) == TEMPLATE_DECL) | |
4853 | targ_parms = DECL_INNERMOST_TEMPLATE_PARMS (targ); | |
4854 | else if (TREE_CODE (targ) == TEMPLATE_TEMPLATE_PARM) | |
4855 | targ_parms = DECL_INNERMOST_TEMPLATE_PARMS (TYPE_NAME (targ)); | |
4856 | ||
4857 | /* Verify that we can coerce the template template | |
4858 | parameters from the template argument to the template | |
4859 | parameter. This requires an exact match. */ | |
4860 | if (targ_parms | |
4861 | && !coerce_template_template_parms | |
4862 | (DECL_INNERMOST_TEMPLATE_PARMS (tparm), | |
4863 | targ_parms, | |
4864 | tf_none, | |
4865 | tparm, | |
4866 | targs)) | |
4867 | return false; | |
4868 | } | |
4869 | } | |
4870 | } | |
4871 | ||
4872 | /* Everything is okay. */ | |
4873 | return true; | |
4874 | } | |
4875 | ||
8b5b8b7c MM |
4876 | /* Convert the indicated template ARG as necessary to match the |
4877 | indicated template PARM. Returns the converted ARG, or | |
c2ea3a40 NS |
4878 | error_mark_node if the conversion was unsuccessful. Error and |
4879 | warning messages are issued under control of COMPLAIN. This | |
4880 | conversion is for the Ith parameter in the parameter list. ARGS is | |
4881 | the full set of template arguments deduced so far. */ | |
8b5b8b7c MM |
4882 | |
4883 | static tree | |
c8094d83 | 4884 | convert_template_argument (tree parm, |
0cbd7506 MS |
4885 | tree arg, |
4886 | tree args, | |
4887 | tsubst_flags_t complain, | |
4888 | int i, | |
4889 | tree in_decl) | |
8b5b8b7c | 4890 | { |
88b82314 | 4891 | tree orig_arg; |
8b5b8b7c | 4892 | tree val; |
8b5b8b7c | 4893 | int is_type, requires_type, is_tmpl_type, requires_tmpl_type; |
c8094d83 | 4894 | |
c8094d83 | 4895 | if (TREE_CODE (arg) == TREE_LIST |
a5ac359a | 4896 | && TREE_CODE (TREE_VALUE (arg)) == OFFSET_REF) |
c8094d83 | 4897 | { |
8b5b8b7c MM |
4898 | /* The template argument was the name of some |
4899 | member function. That's usually | |
0e339752 | 4900 | invalid, but static members are OK. In any |
8b5b8b7c MM |
4901 | case, grab the underlying fields/functions |
4902 | and issue an error later if required. */ | |
88b82314 | 4903 | orig_arg = TREE_VALUE (arg); |
8b5b8b7c MM |
4904 | TREE_TYPE (arg) = unknown_type_node; |
4905 | } | |
4906 | ||
88b82314 DG |
4907 | orig_arg = arg; |
4908 | ||
8b5b8b7c MM |
4909 | requires_tmpl_type = TREE_CODE (parm) == TEMPLATE_DECL; |
4910 | requires_type = (TREE_CODE (parm) == TYPE_DECL | |
4911 | || requires_tmpl_type); | |
4912 | ||
d732e98f | 4913 | /* When determining whether an argument pack expansion is a template, |
5d80a306 | 4914 | look at the pattern. */ |
88b82314 DG |
4915 | if (TREE_CODE (arg) == TYPE_PACK_EXPANSION) |
4916 | arg = PACK_EXPANSION_PATTERN (arg); | |
5d80a306 DG |
4917 | |
4918 | is_tmpl_type = | |
88b82314 DG |
4919 | ((TREE_CODE (arg) == TEMPLATE_DECL |
4920 | && TREE_CODE (DECL_TEMPLATE_RESULT (arg)) == TYPE_DECL) | |
4921 | || TREE_CODE (arg) == TEMPLATE_TEMPLATE_PARM | |
4922 | || TREE_CODE (arg) == UNBOUND_CLASS_TEMPLATE); | |
c8094d83 | 4923 | |
b8c6534b KL |
4924 | if (is_tmpl_type |
4925 | && (TREE_CODE (arg) == TEMPLATE_TEMPLATE_PARM | |
4926 | || TREE_CODE (arg) == UNBOUND_CLASS_TEMPLATE)) | |
8b5b8b7c | 4927 | arg = TYPE_STUB_DECL (arg); |
8b5b8b7c | 4928 | |
2f939d94 | 4929 | is_type = TYPE_P (arg) || is_tmpl_type; |
8b5b8b7c MM |
4930 | |
4931 | if (requires_type && ! is_type && TREE_CODE (arg) == SCOPE_REF | |
4932 | && TREE_CODE (TREE_OPERAND (arg, 0)) == TEMPLATE_TYPE_PARM) | |
4933 | { | |
0f51ccfc | 4934 | pedwarn ("to refer to a type member of a template parameter, " |
88b82314 | 4935 | "use %<typename %E%>", orig_arg); |
c8094d83 | 4936 | |
88b82314 DG |
4937 | orig_arg = make_typename_type (TREE_OPERAND (arg, 0), |
4938 | TREE_OPERAND (arg, 1), | |
4939 | typename_type, | |
4940 | complain & tf_error); | |
4941 | arg = orig_arg; | |
8b5b8b7c MM |
4942 | is_type = 1; |
4943 | } | |
4944 | if (is_type != requires_type) | |
4945 | { | |
4946 | if (in_decl) | |
4947 | { | |
c2ea3a40 | 4948 | if (complain & tf_error) |
8b5b8b7c | 4949 | { |
0f51ccfc | 4950 | error ("type/value mismatch at argument %d in template " |
0cbd7506 MS |
4951 | "parameter list for %qD", |
4952 | i + 1, in_decl); | |
8b5b8b7c | 4953 | if (is_type) |
0f51ccfc | 4954 | error (" expected a constant of type %qT, got %qT", |
0cbd7506 | 4955 | TREE_TYPE (parm), |
1ad8aeeb | 4956 | (DECL_P (arg) ? DECL_NAME (arg) : orig_arg)); |
d12a7283 | 4957 | else if (requires_tmpl_type) |
88b82314 | 4958 | error (" expected a class template, got %qE", orig_arg); |
8b5b8b7c | 4959 | else |
88b82314 | 4960 | error (" expected a type, got %qE", orig_arg); |
8b5b8b7c MM |
4961 | } |
4962 | } | |
4963 | return error_mark_node; | |
4964 | } | |
4965 | if (is_tmpl_type ^ requires_tmpl_type) | |
4966 | { | |
c2ea3a40 | 4967 | if (in_decl && (complain & tf_error)) |
8b5b8b7c | 4968 | { |
0f51ccfc | 4969 | error ("type/value mismatch at argument %d in template " |
0cbd7506 MS |
4970 | "parameter list for %qD", |
4971 | i + 1, in_decl); | |
8b5b8b7c | 4972 | if (is_tmpl_type) |
0f51ccfc | 4973 | error (" expected a type, got %qT", DECL_NAME (arg)); |
8b5b8b7c | 4974 | else |
88b82314 | 4975 | error (" expected a class template, got %qT", orig_arg); |
8b5b8b7c MM |
4976 | } |
4977 | return error_mark_node; | |
4978 | } | |
c8094d83 | 4979 | |
8b5b8b7c MM |
4980 | if (is_type) |
4981 | { | |
4982 | if (requires_tmpl_type) | |
4983 | { | |
b8c6534b KL |
4984 | if (TREE_CODE (TREE_TYPE (arg)) == UNBOUND_CLASS_TEMPLATE) |
4985 | /* The number of argument required is not known yet. | |
4986 | Just accept it for now. */ | |
4987 | val = TREE_TYPE (arg); | |
8b5b8b7c MM |
4988 | else |
4989 | { | |
b8c6534b | 4990 | tree parmparm = DECL_INNERMOST_TEMPLATE_PARMS (parm); |
5d80a306 DG |
4991 | tree argparm; |
4992 | ||
88b82314 | 4993 | argparm = DECL_INNERMOST_TEMPLATE_PARMS (arg); |
b8c6534b KL |
4994 | |
4995 | if (coerce_template_template_parms (parmparm, argparm, | |
4996 | complain, in_decl, | |
6150b602 | 4997 | args)) |
8b5b8b7c | 4998 | { |
88b82314 | 4999 | val = orig_arg; |
c8094d83 MS |
5000 | |
5001 | /* TEMPLATE_TEMPLATE_PARM node is preferred over | |
b8c6534b | 5002 | TEMPLATE_DECL. */ |
5d80a306 DG |
5003 | if (val != error_mark_node) |
5004 | { | |
5005 | if (DECL_TEMPLATE_TEMPLATE_PARM_P (val)) | |
5006 | val = TREE_TYPE (val); | |
5007 | else if (TREE_CODE (val) == TYPE_PACK_EXPANSION | |
88b82314 | 5008 | && DECL_TEMPLATE_TEMPLATE_PARM_P (arg)) |
5d80a306 | 5009 | { |
88b82314 | 5010 | val = TREE_TYPE (arg); |
5d80a306 DG |
5011 | val = make_pack_expansion (val); |
5012 | } | |
5013 | } | |
8b5b8b7c | 5014 | } |
b8c6534b KL |
5015 | else |
5016 | { | |
c2ea3a40 | 5017 | if (in_decl && (complain & tf_error)) |
b8c6534b | 5018 | { |
0f51ccfc | 5019 | error ("type/value mismatch at argument %d in " |
0cbd7506 MS |
5020 | "template parameter list for %qD", |
5021 | i + 1, in_decl); | |
0f51ccfc | 5022 | error (" expected a template of type %qD, got %qD", |
88b82314 | 5023 | parm, orig_arg); |
b8c6534b | 5024 | } |
c8094d83 | 5025 | |
b8c6534b KL |
5026 | val = error_mark_node; |
5027 | } | |
8b5b8b7c MM |
5028 | } |
5029 | } | |
5030 | else | |
88b82314 | 5031 | val = orig_arg; |
685e39c2 MM |
5032 | /* We only form one instance of each template specialization. |
5033 | Therefore, if we use a non-canonical variant (i.e., a | |
3db45ab5 | 5034 | typedef), any future messages referring to the type will use |
685e39c2 MM |
5035 | the typedef, which is confusing if those future uses do not |
5036 | themselves also use the typedef. */ | |
5037 | if (TYPE_P (val)) | |
5038 | val = canonical_type_variant (val); | |
8b5b8b7c MM |
5039 | } |
5040 | else | |
5041 | { | |
4393e105 | 5042 | tree t = tsubst (TREE_TYPE (parm), args, complain, in_decl); |
8b5b8b7c | 5043 | |
11b810f1 | 5044 | if (invalid_nontype_parm_type_p (t, complain)) |
0cbd7506 | 5045 | return error_mark_node; |
c8094d83 | 5046 | |
88b82314 | 5047 | if (!uses_template_parms (orig_arg) && !uses_template_parms (t)) |
8b5b8b7c MM |
5048 | /* We used to call digest_init here. However, digest_init |
5049 | will report errors, which we don't want when complain | |
5050 | is zero. More importantly, digest_init will try too | |
5051 | hard to convert things: for example, `0' should not be | |
5052 | converted to pointer type at this point according to | |
5053 | the standard. Accepting this is not merely an | |
5054 | extension, since deciding whether or not these | |
5055 | conversions can occur is part of determining which | |
dc957d14 | 5056 | function template to call, or whether a given explicit |
0e339752 | 5057 | argument specification is valid. */ |
88b82314 | 5058 | val = convert_nontype_argument (t, orig_arg); |
8b5b8b7c | 5059 | else |
88b82314 | 5060 | val = orig_arg; |
8b5b8b7c MM |
5061 | |
5062 | if (val == NULL_TREE) | |
5063 | val = error_mark_node; | |
c2ea3a40 | 5064 | else if (val == error_mark_node && (complain & tf_error)) |
88b82314 | 5065 | error ("could not convert template argument %qE to %qT", orig_arg, t); |
8b5b8b7c MM |
5066 | } |
5067 | ||
5068 | return val; | |
5069 | } | |
5070 | ||
b1d7b1c0 DG |
5071 | /* Coerces the remaining template arguments in INNER_ARGS (from |
5072 | ARG_IDX to the end) into the parameter pack at PARM_IDX in PARMS. | |
5073 | Returns the coerced argument pack. PARM_IDX is the position of this | |
5074 | parameter in the template parameter list. ARGS is the original | |
5075 | template argument list. */ | |
5076 | static tree | |
5077 | coerce_template_parameter_pack (tree parms, | |
5078 | int parm_idx, | |
5079 | tree args, | |
5080 | tree inner_args, | |
5081 | int arg_idx, | |
5082 | tree new_args, | |
5083 | int* lost, | |
5084 | tree in_decl, | |
5085 | tsubst_flags_t complain) | |
5086 | { | |
5087 | tree parm = TREE_VEC_ELT (parms, parm_idx); | |
5088 | int nargs = inner_args ? NUM_TMPL_ARGS (inner_args) : 0; | |
5089 | tree packed_args; | |
5090 | tree argument_pack; | |
5091 | tree packed_types = NULL_TREE; | |
5092 | ||
5093 | if (arg_idx > nargs) | |
5094 | arg_idx = nargs; | |
5095 | ||
5096 | packed_args = make_tree_vec (nargs - arg_idx); | |
5097 | ||
5098 | if (TREE_CODE (TREE_VALUE (parm)) == PARM_DECL | |
5099 | && uses_parameter_packs (TREE_TYPE (TREE_VALUE (parm)))) | |
5100 | { | |
5101 | /* When the template parameter is a non-type template | |
5102 | parameter pack whose type uses parameter packs, we need | |
5103 | to look at each of the template arguments | |
5104 | separately. Build a vector of the types for these | |
5105 | non-type template parameters in PACKED_TYPES. */ | |
5106 | tree expansion | |
5107 | = make_pack_expansion (TREE_TYPE (TREE_VALUE (parm))); | |
5108 | packed_types = tsubst_pack_expansion (expansion, args, | |
5109 | complain, in_decl); | |
5110 | ||
5111 | if (packed_types == error_mark_node) | |
5112 | return error_mark_node; | |
5113 | ||
5114 | /* Check that we have the right number of arguments. */ | |
5115 | if (arg_idx < nargs | |
5116 | && !PACK_EXPANSION_P (TREE_VEC_ELT (inner_args, arg_idx)) | |
5117 | && nargs - arg_idx != TREE_VEC_LENGTH (packed_types)) | |
5118 | { | |
5119 | int needed_parms | |
5120 | = TREE_VEC_LENGTH (parms) - 1 + TREE_VEC_LENGTH (packed_types); | |
5121 | error ("wrong number of template arguments (%d, should be %d)", | |
5122 | nargs, needed_parms); | |
5123 | return error_mark_node; | |
5124 | } | |
5125 | ||
5126 | /* If we aren't able to check the actual arguments now | |
5127 | (because they haven't been expanded yet), we can at least | |
5128 | verify that all of the types used for the non-type | |
5129 | template parameter pack are, in fact, valid for non-type | |
5130 | template parameters. */ | |
5131 | if (arg_idx < nargs | |
5132 | && PACK_EXPANSION_P (TREE_VEC_ELT (inner_args, arg_idx))) | |
5133 | { | |
5134 | int j, len = TREE_VEC_LENGTH (packed_types); | |
5135 | for (j = 0; j < len; ++j) | |
5136 | { | |
5137 | tree t = TREE_VEC_ELT (packed_types, j); | |
5138 | if (invalid_nontype_parm_type_p (t, complain)) | |
5139 | return error_mark_node; | |
5140 | } | |
5141 | } | |
5142 | } | |
5143 | ||
5144 | /* Convert the remaining arguments, which will be a part of the | |
5145 | parameter pack "parm". */ | |
5146 | for (; arg_idx < nargs; ++arg_idx) | |
5147 | { | |
5148 | tree arg = TREE_VEC_ELT (inner_args, arg_idx); | |
5149 | tree actual_parm = TREE_VALUE (parm); | |
5150 | ||
5151 | if (packed_types && !PACK_EXPANSION_P (arg)) | |
5152 | { | |
5153 | /* When we have a vector of types (corresponding to the | |
5154 | non-type template parameter pack that uses parameter | |
5155 | packs in its type, as mention above), and the | |
5156 | argument is not an expansion (which expands to a | |
5157 | currently unknown number of arguments), clone the | |
5158 | parm and give it the next type in PACKED_TYPES. */ | |
5159 | actual_parm = copy_node (actual_parm); | |
5160 | TREE_TYPE (actual_parm) = | |
5161 | TREE_VEC_ELT (packed_types, arg_idx - parm_idx); | |
5162 | } | |
5163 | ||
c343d5a7 PC |
5164 | if (arg != error_mark_node) |
5165 | arg = convert_template_argument (actual_parm, | |
5166 | arg, new_args, complain, parm_idx, | |
5167 | in_decl); | |
b1d7b1c0 DG |
5168 | if (arg == error_mark_node) |
5169 | (*lost)++; | |
5170 | TREE_VEC_ELT (packed_args, arg_idx - parm_idx) = arg; | |
5171 | } | |
5172 | ||
5173 | if (TREE_CODE (TREE_VALUE (parm)) == TYPE_DECL | |
5174 | || TREE_CODE (TREE_VALUE (parm)) == TEMPLATE_DECL) | |
5175 | argument_pack = make_node (TYPE_ARGUMENT_PACK); | |
5176 | else | |
5177 | { | |
5178 | argument_pack = make_node (NONTYPE_ARGUMENT_PACK); | |
88b82314 | 5179 | TREE_TYPE (argument_pack) |
cdcae745 | 5180 | = tsubst (TREE_TYPE (TREE_VALUE (parm)), new_args, complain, in_decl); |
b1d7b1c0 DG |
5181 | TREE_CONSTANT (argument_pack) = 1; |
5182 | } | |
5183 | ||
5184 | SET_ARGUMENT_PACK_ARGS (argument_pack, packed_args); | |
5185 | return argument_pack; | |
5186 | } | |
5187 | ||
8b5b8b7c MM |
5188 | /* Convert all template arguments to their appropriate types, and |
5189 | return a vector containing the innermost resulting template | |
c2ea3a40 | 5190 | arguments. If any error occurs, return error_mark_node. Error and |
3e4a3562 | 5191 | warning messages are issued under control of COMPLAIN. |
75650646 | 5192 | |
e7e93965 | 5193 | If REQUIRE_ALL_ARGS is false, argument deduction will be performed |
84dc00e8 | 5194 | for arguments not specified in ARGS. Otherwise, if |
e7e93965 MM |
5195 | USE_DEFAULT_ARGS is true, default arguments will be used to fill in |
5196 | unspecified arguments. If REQUIRE_ALL_ARGS is true, but | |
5197 | USE_DEFAULT_ARGS is false, then all arguments must be specified in | |
5198 | ARGS. */ | |
c8094d83 | 5199 | |
8d08fdba | 5200 | static tree |
c8094d83 | 5201 | coerce_template_parms (tree parms, |
0cbd7506 MS |
5202 | tree args, |
5203 | tree in_decl, | |
3a978d72 | 5204 | tsubst_flags_t complain, |
e7e93965 MM |
5205 | bool require_all_args, |
5206 | bool use_default_args) | |
8d08fdba | 5207 | { |
b1d7b1c0 | 5208 | int nparms, nargs, parm_idx, arg_idx, lost = 0; |
e4a84209 | 5209 | tree inner_args; |
8b5b8b7c MM |
5210 | tree new_args; |
5211 | tree new_inner_args; | |
a2c5ed87 | 5212 | bool saved_skip_evaluation; |
a292b002 | 5213 | |
5d80a306 DG |
5214 | /* When used as a boolean value, indicates whether this is a |
5215 | variadic template parameter list. Since it's an int, we can also | |
5216 | subtract it from nparms to get the number of non-variadic | |
5217 | parameters. */ | |
b1d7b1c0 | 5218 | int variadic_p = 0; |
5d80a306 DG |
5219 | |
5220 | inner_args | |
5221 | = expand_template_argument_pack (INNERMOST_TEMPLATE_ARGS (args)); | |
5222 | ||
bf12d54d | 5223 | nargs = inner_args ? NUM_TMPL_ARGS (inner_args) : 0; |
a292b002 MS |
5224 | nparms = TREE_VEC_LENGTH (parms); |
5225 | ||
b1d7b1c0 DG |
5226 | /* Determine if there are any parameter packs. */ |
5227 | for (parm_idx = 0; parm_idx < nparms; ++parm_idx) | |
5228 | { | |
5229 | tree tparm = TREE_VALUE (TREE_VEC_ELT (parms, parm_idx)); | |
5230 | if (template_parameter_pack_p (tparm)) | |
5231 | { | |
5232 | variadic_p = 1; | |
5233 | break; | |
5234 | } | |
5235 | } | |
5236 | ||
5d80a306 DG |
5237 | if ((nargs > nparms - variadic_p && !variadic_p) |
5238 | || (nargs < nparms - variadic_p | |
e7e93965 MM |
5239 | && require_all_args |
5240 | && (!use_default_args | |
42b304f1 LM |
5241 | || (TREE_VEC_ELT (parms, nargs) != error_mark_node |
5242 | && !TREE_PURPOSE (TREE_VEC_ELT (parms, nargs)))))) | |
8d08fdba | 5243 | { |
c8094d83 | 5244 | if (complain & tf_error) |
75650646 | 5245 | { |
5d80a306 DG |
5246 | const char *or_more = ""; |
5247 | if (variadic_p) | |
5248 | { | |
5249 | or_more = " or more"; | |
5250 | --nparms; | |
5251 | } | |
5252 | ||
5253 | error ("wrong number of template arguments (%d, should be %d%s)", | |
5254 | nargs, nparms, or_more); | |
c8094d83 | 5255 | |
75650646 | 5256 | if (in_decl) |
dee15844 | 5257 | error ("provided for %q+D", in_decl); |
75650646 MM |
5258 | } |
5259 | ||
8d08fdba MS |
5260 | return error_mark_node; |
5261 | } | |
5262 | ||
a2c5ed87 MM |
5263 | /* We need to evaluate the template arguments, even though this |
5264 | template-id may be nested within a "sizeof". */ | |
5265 | saved_skip_evaluation = skip_evaluation; | |
5266 | skip_evaluation = false; | |
f31c0a32 | 5267 | new_inner_args = make_tree_vec (nparms); |
8b5b8b7c | 5268 | new_args = add_outermost_template_args (args, new_inner_args); |
b1d7b1c0 | 5269 | for (parm_idx = 0, arg_idx = 0; parm_idx < nparms; parm_idx++, arg_idx++) |
8d08fdba | 5270 | { |
8b5b8b7c MM |
5271 | tree arg; |
5272 | tree parm; | |
e4a84209 | 5273 | |
8b5b8b7c | 5274 | /* Get the Ith template parameter. */ |
b1d7b1c0 | 5275 | parm = TREE_VEC_ELT (parms, parm_idx); |
42b304f1 LM |
5276 | |
5277 | if (parm == error_mark_node) | |
2d8ba2c7 | 5278 | { |
b1d7b1c0 | 5279 | TREE_VEC_ELT (new_inner_args, arg_idx) = error_mark_node; |
42b304f1 | 5280 | continue; |
2d8ba2c7 | 5281 | } |
75650646 | 5282 | |
b1d7b1c0 DG |
5283 | /* Calculate the next argument. */ |
5284 | if (template_parameter_pack_p (TREE_VALUE (parm))) | |
5d80a306 | 5285 | { |
b1d7b1c0 DG |
5286 | /* All remaining arguments will be placed in the |
5287 | template parameter pack PARM. */ | |
5288 | arg = coerce_template_parameter_pack (parms, parm_idx, args, | |
5289 | inner_args, arg_idx, | |
5290 | new_args, &lost, | |
5291 | in_decl, complain); | |
5292 | ||
5293 | /* Store this argument. */ | |
5294 | if (arg == error_mark_node) | |
5295 | lost++; | |
5296 | TREE_VEC_ELT (new_inner_args, parm_idx) = arg; | |
5297 | ||
5298 | /* We are done with all of the arguments. */ | |
5299 | arg_idx = nargs; | |
5300 | ||
5301 | continue; | |
5302 | } | |
5303 | else if (arg_idx < nargs) | |
5304 | { | |
5305 | arg = TREE_VEC_ELT (inner_args, arg_idx); | |
5306 | ||
5307 | if (arg && PACK_EXPANSION_P (arg)) | |
5d80a306 | 5308 | { |
4cf36211 DG |
5309 | if (complain & tf_error) |
5310 | { | |
5311 | /* If ARG is a pack expansion, but PARM is not a | |
5312 | template parameter pack (if it were, we would have | |
5313 | handled it above), we're trying to expand into a | |
5314 | fixed-length argument list. */ | |
5315 | if (TREE_CODE (arg) == EXPR_PACK_EXPANSION) | |
5316 | error ("cannot expand %<%E%> into a fixed-length " | |
5317 | "argument list", arg); | |
5318 | else | |
5319 | error ("cannot expand %<%T%> into a fixed-length " | |
5320 | "argument list", arg); | |
5321 | } | |
c343d5a7 | 5322 | return error_mark_node; |
5d80a306 DG |
5323 | } |
5324 | } | |
e7e93965 | 5325 | else if (require_all_args) |
b1d7b1c0 DG |
5326 | /* There must be a default arg in this case. */ |
5327 | arg = tsubst_template_arg (TREE_PURPOSE (parm), new_args, | |
5328 | complain, in_decl); | |
ffd49b19 NS |
5329 | else |
5330 | break; | |
c8094d83 | 5331 | |
ffd49b19 | 5332 | if (arg == error_mark_node) |
e34b0922 KL |
5333 | { |
5334 | if (complain & tf_error) | |
b1d7b1c0 | 5335 | error ("template argument %d is invalid", arg_idx + 1); |
e34b0922 | 5336 | } |
b1d7b1c0 DG |
5337 | else if (!arg) |
5338 | /* This only occurs if there was an error in the template | |
5339 | parameter list itself (which we would already have | |
5340 | reported) that we are trying to recover from, e.g., a class | |
5341 | template with a parameter list such as | |
5342 | template<typename..., typename>. */ | |
5343 | return error_mark_node; | |
c8094d83 MS |
5344 | else |
5345 | arg = convert_template_argument (TREE_VALUE (parm), | |
b1d7b1c0 DG |
5346 | arg, new_args, complain, |
5347 | parm_idx, in_decl); | |
c8094d83 | 5348 | |
8b5b8b7c | 5349 | if (arg == error_mark_node) |
8d08fdba | 5350 | lost++; |
b1d7b1c0 | 5351 | TREE_VEC_ELT (new_inner_args, arg_idx) = arg; |
8d08fdba | 5352 | } |
a2c5ed87 | 5353 | skip_evaluation = saved_skip_evaluation; |
8b5b8b7c | 5354 | |
8d08fdba MS |
5355 | if (lost) |
5356 | return error_mark_node; | |
8b5b8b7c MM |
5357 | |
5358 | return new_inner_args; | |
8d08fdba MS |
5359 | } |
5360 | ||
34016c81 JM |
5361 | /* Returns 1 if template args OT and NT are equivalent. */ |
5362 | ||
d8e178a0 | 5363 | static int |
3a978d72 | 5364 | template_args_equal (tree ot, tree nt) |
34016c81 JM |
5365 | { |
5366 | if (nt == ot) | |
5367 | return 1; | |
74601d7c | 5368 | |
34016c81 JM |
5369 | if (TREE_CODE (nt) == TREE_VEC) |
5370 | /* For member templates */ | |
74601d7c | 5371 | return TREE_CODE (ot) == TREE_VEC && comp_template_args (ot, nt); |
5d80a306 DG |
5372 | else if (PACK_EXPANSION_P (ot)) |
5373 | return PACK_EXPANSION_P (nt) | |
5374 | && template_args_equal (PACK_EXPANSION_PATTERN (ot), | |
5375 | PACK_EXPANSION_PATTERN (nt)); | |
74601d7c | 5376 | else if (TYPE_P (nt)) |
660845bf | 5377 | return TYPE_P (ot) && same_type_p (ot, nt); |
74601d7c KL |
5378 | else if (TREE_CODE (ot) == TREE_VEC || TYPE_P (ot)) |
5379 | return 0; | |
34016c81 | 5380 | else |
c8a209ca | 5381 | return cp_tree_equal (ot, nt); |
34016c81 JM |
5382 | } |
5383 | ||
5384 | /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets | |
f84b4be9 JM |
5385 | of template arguments. Returns 0 otherwise. */ |
5386 | ||
6757edfe | 5387 | int |
3a978d72 | 5388 | comp_template_args (tree oldargs, tree newargs) |
5566b478 MS |
5389 | { |
5390 | int i; | |
5391 | ||
5d80a306 DG |
5392 | oldargs = expand_template_argument_pack (oldargs); |
5393 | newargs = expand_template_argument_pack (newargs); | |
5394 | ||
386b8a85 JM |
5395 | if (TREE_VEC_LENGTH (oldargs) != TREE_VEC_LENGTH (newargs)) |
5396 | return 0; | |
5397 | ||
5566b478 MS |
5398 | for (i = 0; i < TREE_VEC_LENGTH (oldargs); ++i) |
5399 | { | |
5400 | tree nt = TREE_VEC_ELT (newargs, i); | |
5401 | tree ot = TREE_VEC_ELT (oldargs, i); | |
5402 | ||
34016c81 | 5403 | if (! template_args_equal (ot, nt)) |
61a127b3 | 5404 | return 0; |
5566b478 MS |
5405 | } |
5406 | return 1; | |
5407 | } | |
5408 | ||
5566b478 | 5409 | static void |
3a978d72 | 5410 | add_pending_template (tree d) |
5566b478 | 5411 | { |
3ae18eaf JM |
5412 | tree ti = (TYPE_P (d) |
5413 | ? CLASSTYPE_TEMPLATE_INFO (d) | |
5414 | : DECL_TEMPLATE_INFO (d)); | |
e2c3721c | 5415 | struct pending_template *pt; |
3ae18eaf | 5416 | int level; |
e92cc029 | 5417 | |
824b9a4c | 5418 | if (TI_PENDING_TEMPLATE_FLAG (ti)) |
5566b478 MS |
5419 | return; |
5420 | ||
3ae18eaf JM |
5421 | /* We are called both from instantiate_decl, where we've already had a |
5422 | tinst_level pushed, and instantiate_template, where we haven't. | |
5423 | Compensate. */ | |
e2c3721c | 5424 | level = !current_tinst_level || current_tinst_level->decl != d; |
3ae18eaf JM |
5425 | |
5426 | if (level) | |
5427 | push_tinst_level (d); | |
5428 | ||
e2c3721c PB |
5429 | pt = GGC_NEW (struct pending_template); |
5430 | pt->next = NULL; | |
5431 | pt->tinst = current_tinst_level; | |
46ccf50a | 5432 | if (last_pending_template) |
e2c3721c | 5433 | last_pending_template->next = pt; |
46ccf50a JM |
5434 | else |
5435 | pending_templates = pt; | |
5436 | ||
5437 | last_pending_template = pt; | |
5438 | ||
824b9a4c | 5439 | TI_PENDING_TEMPLATE_FLAG (ti) = 1; |
3ae18eaf JM |
5440 | |
5441 | if (level) | |
5442 | pop_tinst_level (); | |
5566b478 MS |
5443 | } |
5444 | ||
386b8a85 | 5445 | |
4ba126e4 MM |
5446 | /* Return a TEMPLATE_ID_EXPR corresponding to the indicated FNS and |
5447 | ARGLIST. Valid choices for FNS are given in the cp-tree.def | |
5448 | documentation for TEMPLATE_ID_EXPR. */ | |
386b8a85 JM |
5449 | |
5450 | tree | |
3a978d72 | 5451 | lookup_template_function (tree fns, tree arglist) |
386b8a85 | 5452 | { |
2c73f9f5 | 5453 | tree type; |
050367a3 | 5454 | |
4ba126e4 MM |
5455 | if (fns == error_mark_node || arglist == error_mark_node) |
5456 | return error_mark_node; | |
5457 | ||
50bc768d | 5458 | gcc_assert (!arglist || TREE_CODE (arglist) == TREE_VEC); |
4230cec2 NS |
5459 | gcc_assert (fns && (is_overloaded_fn (fns) |
5460 | || TREE_CODE (fns) == IDENTIFIER_NODE)); | |
4ba126e4 | 5461 | |
50ad9642 MM |
5462 | if (BASELINK_P (fns)) |
5463 | { | |
f293ce4b RS |
5464 | BASELINK_FUNCTIONS (fns) = build2 (TEMPLATE_ID_EXPR, |
5465 | unknown_type_node, | |
5466 | BASELINK_FUNCTIONS (fns), | |
5467 | arglist); | |
50ad9642 MM |
5468 | return fns; |
5469 | } | |
5470 | ||
2c73f9f5 ML |
5471 | type = TREE_TYPE (fns); |
5472 | if (TREE_CODE (fns) == OVERLOAD || !type) | |
5473 | type = unknown_type_node; | |
c8094d83 | 5474 | |
f293ce4b | 5475 | return build2 (TEMPLATE_ID_EXPR, type, fns, arglist); |
386b8a85 JM |
5476 | } |
5477 | ||
a2b60a0e MM |
5478 | /* Within the scope of a template class S<T>, the name S gets bound |
5479 | (in build_self_reference) to a TYPE_DECL for the class, not a | |
5480 | TEMPLATE_DECL. If DECL is a TYPE_DECL for current_class_type, | |
5481 | or one of its enclosing classes, and that type is a template, | |
5482 | return the associated TEMPLATE_DECL. Otherwise, the original | |
5483 | DECL is returned. */ | |
5484 | ||
a723baf1 | 5485 | tree |
3a978d72 | 5486 | maybe_get_template_decl_from_type_decl (tree decl) |
a2b60a0e MM |
5487 | { |
5488 | return (decl != NULL_TREE | |
c8094d83 | 5489 | && TREE_CODE (decl) == TYPE_DECL |
a2b60a0e | 5490 | && DECL_ARTIFICIAL (decl) |
511b60ff | 5491 | && CLASS_TYPE_P (TREE_TYPE (decl)) |
c8094d83 | 5492 | && CLASSTYPE_TEMPLATE_INFO (TREE_TYPE (decl))) |
a2b60a0e MM |
5493 | ? CLASSTYPE_TI_TEMPLATE (TREE_TYPE (decl)) : decl; |
5494 | } | |
386b8a85 | 5495 | |
8d08fdba MS |
5496 | /* Given an IDENTIFIER_NODE (type TEMPLATE_DECL) and a chain of |
5497 | parameters, find the desired type. | |
5498 | ||
5499 | D1 is the PTYPENAME terminal, and ARGLIST is the list of arguments. | |
8d08fdba MS |
5500 | |
5501 | IN_DECL, if non-NULL, is the template declaration we are trying to | |
c8094d83 | 5502 | instantiate. |
75650646 | 5503 | |
838dfd8a | 5504 | If ENTERING_SCOPE is nonzero, we are about to enter the scope of |
36a117a5 | 5505 | the class we are looking up. |
c8094d83 | 5506 | |
c2ea3a40 | 5507 | Issue error and warning messages under control of COMPLAIN. |
36a117a5 | 5508 | |
75650646 MM |
5509 | If the template class is really a local class in a template |
5510 | function, then the FUNCTION_CONTEXT is the function in which it is | |
c8094d83 | 5511 | being instantiated. |
b6ab6892 GB |
5512 | |
5513 | ??? Note that this function is currently called *twice* for each | |
5514 | template-id: the first time from the parser, while creating the | |
5515 | incomplete type (finish_template_type), and the second type during the | |
5516 | real instantiation (instantiate_template_class). This is surely something | |
5517 | that we want to avoid. It also causes some problems with argument | |
5518 | coercion (see convert_nontype_argument for more information on this). */ | |
e92cc029 | 5519 | |
8d08fdba | 5520 | tree |
c8094d83 | 5521 | lookup_template_class (tree d1, |
0cbd7506 MS |
5522 | tree arglist, |
5523 | tree in_decl, | |
5524 | tree context, | |
5525 | int entering_scope, | |
5526 | tsubst_flags_t complain) | |
8d08fdba | 5527 | { |
a703fb38 | 5528 | tree template = NULL_TREE, parmlist; |
dbfe2124 | 5529 | tree t; |
c8094d83 | 5530 | |
fd295cb2 | 5531 | timevar_push (TV_NAME_LOOKUP); |
c8094d83 | 5532 | |
5566b478 MS |
5533 | if (TREE_CODE (d1) == IDENTIFIER_NODE) |
5534 | { | |
90ea9897 MM |
5535 | tree value = innermost_non_namespace_value (d1); |
5536 | if (value && DECL_TEMPLATE_TEMPLATE_PARM_P (value)) | |
5537 | template = value; | |
73b0fce8 KL |
5538 | else |
5539 | { | |
2c73f9f5 ML |
5540 | if (context) |
5541 | push_decl_namespace (context); | |
10e6657a | 5542 | template = lookup_name (d1); |
3ebc5c52 | 5543 | template = maybe_get_template_decl_from_type_decl (template); |
2c73f9f5 ML |
5544 | if (context) |
5545 | pop_decl_namespace (); | |
73b0fce8 | 5546 | } |
8d019cef JM |
5547 | if (template) |
5548 | context = DECL_CONTEXT (template); | |
5566b478 | 5549 | } |
9e1e64ec | 5550 | else if (TREE_CODE (d1) == TYPE_DECL && MAYBE_CLASS_TYPE_P (TREE_TYPE (d1))) |
c91a56d2 | 5551 | { |
802dbc34 JM |
5552 | tree type = TREE_TYPE (d1); |
5553 | ||
5554 | /* If we are declaring a constructor, say A<T>::A<T>, we will get | |
5555 | an implicit typename for the second A. Deal with it. */ | |
5556 | if (TREE_CODE (type) == TYPENAME_TYPE && TREE_TYPE (type)) | |
5557 | type = TREE_TYPE (type); | |
c8094d83 | 5558 | |
802dbc34 | 5559 | if (CLASSTYPE_TEMPLATE_INFO (type)) |
f3400fe2 | 5560 | { |
802dbc34 | 5561 | template = CLASSTYPE_TI_TEMPLATE (type); |
f3400fe2 JM |
5562 | d1 = DECL_NAME (template); |
5563 | } | |
c91a56d2 | 5564 | } |
c8094d83 | 5565 | else if (TREE_CODE (d1) == ENUMERAL_TYPE |
9e1e64ec | 5566 | || (TYPE_P (d1) && MAYBE_CLASS_TYPE_P (d1))) |
5566b478 | 5567 | { |
ed44da02 | 5568 | template = TYPE_TI_TEMPLATE (d1); |
5566b478 MS |
5569 | d1 = DECL_NAME (template); |
5570 | } | |
93cdc044 | 5571 | else if (TREE_CODE (d1) == TEMPLATE_DECL |
17aec3eb | 5572 | && TREE_CODE (DECL_TEMPLATE_RESULT (d1)) == TYPE_DECL) |
93cdc044 JM |
5573 | { |
5574 | template = d1; | |
5575 | d1 = DECL_NAME (template); | |
5576 | context = DECL_CONTEXT (template); | |
5577 | } | |
8d08fdba | 5578 | |
90ea9897 | 5579 | /* Issue an error message if we didn't find a template. */ |
8d08fdba | 5580 | if (! template) |
f3400fe2 | 5581 | { |
c2ea3a40 | 5582 | if (complain & tf_error) |
0cbd7506 | 5583 | error ("%qT is not a template", d1); |
fd295cb2 | 5584 | POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node); |
f3400fe2 | 5585 | } |
2c73f9f5 | 5586 | |
a87b4257 | 5587 | if (TREE_CODE (template) != TEMPLATE_DECL |
0cbd7506 | 5588 | /* Make sure it's a user visible template, if it was named by |
42eaed49 NS |
5589 | the user. */ |
5590 | || ((complain & tf_user) && !DECL_TEMPLATE_PARM_P (template) | |
5591 | && !PRIMARY_TEMPLATE_P (template))) | |
8d08fdba | 5592 | { |
c2ea3a40 | 5593 | if (complain & tf_error) |
0cbd7506 MS |
5594 | { |
5595 | error ("non-template type %qT used as a template", d1); | |
5596 | if (in_decl) | |
dee15844 | 5597 | error ("for template declaration %q+D", in_decl); |
f9c244b8 | 5598 | } |
fd295cb2 | 5599 | POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node); |
8d08fdba | 5600 | } |
8d08fdba | 5601 | |
42eaed49 | 5602 | complain &= ~tf_user; |
c8094d83 | 5603 | |
73b0fce8 KL |
5604 | if (DECL_TEMPLATE_TEMPLATE_PARM_P (template)) |
5605 | { | |
5606 | /* Create a new TEMPLATE_DECL and TEMPLATE_TEMPLATE_PARM node to store | |
0cbd7506 | 5607 | template arguments */ |
73b0fce8 | 5608 | |
1899c3a4 | 5609 | tree parm; |
73b0fce8 | 5610 | tree arglist2; |
ef3b7b17 | 5611 | tree outer; |
73b0fce8 | 5612 | |
73b0fce8 KL |
5613 | parmlist = DECL_INNERMOST_TEMPLATE_PARMS (template); |
5614 | ||
4f96ff63 KL |
5615 | /* Consider an example where a template template parameter declared as |
5616 | ||
5617 | template <class T, class U = std::allocator<T> > class TT | |
5618 | ||
c8094d83 MS |
5619 | The template parameter level of T and U are one level larger than |
5620 | of TT. To proper process the default argument of U, say when an | |
4f96ff63 | 5621 | instantiation `TT<int>' is seen, we need to build the full |
342cea95 KL |
5622 | arguments containing {int} as the innermost level. Outer levels, |
5623 | available when not appearing as default template argument, can be | |
ef3b7b17 | 5624 | obtained from the arguments of the enclosing template. |
4f96ff63 | 5625 | |
342cea95 KL |
5626 | Suppose that TT is later substituted with std::vector. The above |
5627 | instantiation is `TT<int, std::allocator<T> >' with TT at | |
5628 | level 1, and T at level 2, while the template arguments at level 1 | |
5629 | becomes {std::vector} and the inner level 2 is {int}. */ | |
5630 | ||
ef3b7b17 JM |
5631 | outer = DECL_CONTEXT (template); |
5632 | if (outer) | |
5633 | outer = TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (outer))); | |
5634 | else if (current_template_parms) | |
5635 | /* This is an argument of the current template, so we haven't set | |
5636 | DECL_CONTEXT yet. */ | |
5637 | outer = current_template_args (); | |
5638 | ||
5639 | if (outer) | |
5640 | arglist = add_to_template_args (outer, arglist); | |
4f96ff63 | 5641 | |
f9c244b8 | 5642 | arglist2 = coerce_template_parms (parmlist, arglist, template, |
3db45ab5 | 5643 | complain, |
e7e93965 MM |
5644 | /*require_all_args=*/true, |
5645 | /*use_default_args=*/true); | |
3e4a3562 | 5646 | if (arglist2 == error_mark_node |
544aef8c | 5647 | || (!uses_template_parms (arglist2) |
3e4a3562 | 5648 | && check_instantiated_args (template, arglist2, complain))) |
0cbd7506 | 5649 | POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node); |
73b0fce8 | 5650 | |
dac65501 | 5651 | parm = bind_template_template_parm (TREE_TYPE (template), arglist2); |
fd295cb2 | 5652 | POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, parm); |
73b0fce8 | 5653 | } |
c8094d83 | 5654 | else |
8d08fdba | 5655 | { |
36a117a5 | 5656 | tree template_type = TREE_TYPE (template); |
7ac7b28f | 5657 | tree gen_tmpl; |
36a117a5 MM |
5658 | tree type_decl; |
5659 | tree found = NULL_TREE; | |
5660 | int arg_depth; | |
5661 | int parm_depth; | |
dbfe2124 | 5662 | int is_partial_instantiation; |
830bfa74 | 5663 | |
7ac7b28f MM |
5664 | gen_tmpl = most_general_template (template); |
5665 | parmlist = DECL_TEMPLATE_PARMS (gen_tmpl); | |
36a117a5 MM |
5666 | parm_depth = TMPL_PARMS_DEPTH (parmlist); |
5667 | arg_depth = TMPL_ARGS_DEPTH (arglist); | |
5668 | ||
5669 | if (arg_depth == 1 && parm_depth > 1) | |
5670 | { | |
39c01e4c | 5671 | /* We've been given an incomplete set of template arguments. |
36a117a5 MM |
5672 | For example, given: |
5673 | ||
5674 | template <class T> struct S1 { | |
0cbd7506 | 5675 | template <class U> struct S2 {}; |
36a117a5 | 5676 | template <class U> struct S2<U*> {}; |
0cbd7506 | 5677 | }; |
c8094d83 | 5678 | |
36a117a5 MM |
5679 | we will be called with an ARGLIST of `U*', but the |
5680 | TEMPLATE will be `template <class T> template | |
5681 | <class U> struct S1<T>::S2'. We must fill in the missing | |
5682 | arguments. */ | |
c8094d83 | 5683 | arglist |
7ac7b28f MM |
5684 | = add_outermost_template_args (TYPE_TI_ARGS (TREE_TYPE (template)), |
5685 | arglist); | |
36a117a5 MM |
5686 | arg_depth = TMPL_ARGS_DEPTH (arglist); |
5687 | } | |
5566b478 | 5688 | |
41f5d4b1 | 5689 | /* Now we should have enough arguments. */ |
50bc768d | 5690 | gcc_assert (parm_depth == arg_depth); |
c8094d83 | 5691 | |
7ac7b28f MM |
5692 | /* From here on, we're only interested in the most general |
5693 | template. */ | |
5694 | template = gen_tmpl; | |
5695 | ||
36a117a5 MM |
5696 | /* Calculate the BOUND_ARGS. These will be the args that are |
5697 | actually tsubst'd into the definition to create the | |
5698 | instantiation. */ | |
5699 | if (parm_depth > 1) | |
830bfa74 MM |
5700 | { |
5701 | /* We have multiple levels of arguments to coerce, at once. */ | |
830bfa74 | 5702 | int i; |
e4a84209 | 5703 | int saved_depth = TMPL_ARGS_DEPTH (arglist); |
36a117a5 | 5704 | |
f31c0a32 | 5705 | tree bound_args = make_tree_vec (parm_depth); |
c8094d83 | 5706 | |
e4a84209 | 5707 | for (i = saved_depth, |
c8094d83 | 5708 | t = DECL_TEMPLATE_PARMS (template); |
e4a84209 | 5709 | i > 0 && t != NULL_TREE; |
830bfa74 | 5710 | --i, t = TREE_CHAIN (t)) |
e4a84209 | 5711 | { |
ee3071ef NS |
5712 | tree a = coerce_template_parms (TREE_VALUE (t), |
5713 | arglist, template, | |
3db45ab5 | 5714 | complain, |
e7e93965 MM |
5715 | /*require_all_args=*/true, |
5716 | /*use_default_args=*/true); | |
88e98cfe KL |
5717 | |
5718 | /* Don't process further if one of the levels fails. */ | |
5719 | if (a == error_mark_node) | |
5720 | { | |
5721 | /* Restore the ARGLIST to its full size. */ | |
5722 | TREE_VEC_LENGTH (arglist) = saved_depth; | |
5723 | POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node); | |
5724 | } | |
c8094d83 | 5725 | |
e4a84209 MM |
5726 | SET_TMPL_ARGS_LEVEL (bound_args, i, a); |
5727 | ||
5728 | /* We temporarily reduce the length of the ARGLIST so | |
5729 | that coerce_template_parms will see only the arguments | |
5730 | corresponding to the template parameters it is | |
5731 | examining. */ | |
5732 | TREE_VEC_LENGTH (arglist)--; | |
5733 | } | |
5734 | ||
5735 | /* Restore the ARGLIST to its full size. */ | |
5736 | TREE_VEC_LENGTH (arglist) = saved_depth; | |
5737 | ||
36a117a5 | 5738 | arglist = bound_args; |
830bfa74 MM |
5739 | } |
5740 | else | |
36a117a5 MM |
5741 | arglist |
5742 | = coerce_template_parms (INNERMOST_TEMPLATE_PARMS (parmlist), | |
f9a7ae04 | 5743 | INNERMOST_TEMPLATE_ARGS (arglist), |
f9c244b8 | 5744 | template, |
3db45ab5 | 5745 | complain, |
e7e93965 MM |
5746 | /*require_all_args=*/true, |
5747 | /*use_default_args=*/true); | |
36a117a5 | 5748 | |
c353b8e3 | 5749 | if (arglist == error_mark_node) |
36a117a5 | 5750 | /* We were unable to bind the arguments. */ |
fd295cb2 | 5751 | POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node); |
5566b478 | 5752 | |
36a117a5 MM |
5753 | /* In the scope of a template class, explicit references to the |
5754 | template class refer to the type of the template, not any | |
5755 | instantiation of it. For example, in: | |
c8094d83 | 5756 | |
36a117a5 MM |
5757 | template <class T> class C { void f(C<T>); } |
5758 | ||
5759 | the `C<T>' is just the same as `C'. Outside of the | |
5760 | class, however, such a reference is an instantiation. */ | |
ed44da02 | 5761 | if (comp_template_args (TYPE_TI_ARGS (template_type), |
36a117a5 MM |
5762 | arglist)) |
5763 | { | |
5764 | found = template_type; | |
c8094d83 | 5765 | |
36a117a5 | 5766 | if (!entering_scope && PRIMARY_TEMPLATE_P (template)) |
5566b478 | 5767 | { |
36a117a5 | 5768 | tree ctx; |
c8094d83 MS |
5769 | |
5770 | for (ctx = current_class_type; | |
5f04800c KL |
5771 | ctx && TREE_CODE (ctx) != NAMESPACE_DECL; |
5772 | ctx = (TYPE_P (ctx) | |
5773 | ? TYPE_CONTEXT (ctx) | |
5774 | : DECL_CONTEXT (ctx))) | |
5775 | if (TYPE_P (ctx) && same_type_p (ctx, template_type)) | |
5776 | goto found_ctx; | |
c8094d83 | 5777 | |
6df5158a NS |
5778 | /* We're not in the scope of the class, so the |
5779 | TEMPLATE_TYPE is not the type we want after all. */ | |
5780 | found = NULL_TREE; | |
5781 | found_ctx:; | |
5566b478 MS |
5782 | } |
5783 | } | |
36a117a5 | 5784 | if (found) |
0cbd7506 | 5785 | POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, found); |
414ea4aa | 5786 | |
c7222c02 MM |
5787 | /* If we already have this specialization, return it. */ |
5788 | found = retrieve_specialization (template, arglist, | |
5789 | /*class_specializations_p=*/false); | |
5790 | if (found) | |
5791 | POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, found); | |
5566b478 | 5792 | |
dbfe2124 | 5793 | /* This type is a "partial instantiation" if any of the template |
ab097535 | 5794 | arguments still involve template parameters. Note that we set |
486e4077 MM |
5795 | IS_PARTIAL_INSTANTIATION for partial specializations as |
5796 | well. */ | |
dbfe2124 MM |
5797 | is_partial_instantiation = uses_template_parms (arglist); |
5798 | ||
c353b8e3 MM |
5799 | /* If the deduced arguments are invalid, then the binding |
5800 | failed. */ | |
5801 | if (!is_partial_instantiation | |
5802 | && check_instantiated_args (template, | |
5803 | INNERMOST_TEMPLATE_ARGS (arglist), | |
5804 | complain)) | |
5805 | POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, error_mark_node); | |
c8094d83 MS |
5806 | |
5807 | if (!is_partial_instantiation | |
3ebc5c52 MM |
5808 | && !PRIMARY_TEMPLATE_P (template) |
5809 | && TREE_CODE (CP_DECL_CONTEXT (template)) == NAMESPACE_DECL) | |
5810 | { | |
3ebc5c52 MM |
5811 | found = xref_tag_from_type (TREE_TYPE (template), |
5812 | DECL_NAME (template), | |
29ef83de | 5813 | /*tag_scope=*/ts_global); |
fd295cb2 | 5814 | POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, found); |
3ebc5c52 | 5815 | } |
c8094d83 | 5816 | |
95ee998c | 5817 | context = tsubst (DECL_CONTEXT (template), arglist, |
c2ea3a40 | 5818 | complain, in_decl); |
95ee998c MM |
5819 | if (!context) |
5820 | context = global_namespace; | |
5821 | ||
36a117a5 | 5822 | /* Create the type. */ |
ed44da02 MM |
5823 | if (TREE_CODE (template_type) == ENUMERAL_TYPE) |
5824 | { | |
dbfe2124 | 5825 | if (!is_partial_instantiation) |
92777ce4 NS |
5826 | { |
5827 | set_current_access_from_decl (TYPE_NAME (template_type)); | |
5828 | t = start_enum (TYPE_IDENTIFIER (template_type)); | |
5829 | } | |
ed44da02 | 5830 | else |
dbfe2124 | 5831 | /* We don't want to call start_enum for this type, since |
ed44da02 MM |
5832 | the values for the enumeration constants may involve |
5833 | template parameters. And, no one should be interested | |
5834 | in the enumeration constants for such a type. */ | |
5835 | t = make_node (ENUMERAL_TYPE); | |
5836 | } | |
5837 | else | |
5838 | { | |
9e1e64ec | 5839 | t = make_class_type (TREE_CODE (template_type)); |
c8094d83 | 5840 | CLASSTYPE_DECLARED_CLASS (t) |
ed44da02 | 5841 | = CLASSTYPE_DECLARED_CLASS (template_type); |
ed44da02 | 5842 | SET_CLASSTYPE_IMPLICIT_INSTANTIATION (t); |
f668f160 | 5843 | TYPE_FOR_JAVA (t) = TYPE_FOR_JAVA (template_type); |
ae673f14 JM |
5844 | |
5845 | /* A local class. Make sure the decl gets registered properly. */ | |
5846 | if (context == current_function_decl) | |
bd3d082e | 5847 | pushtag (DECL_NAME (template), t, /*tag_scope=*/ts_current); |
06d40de8 DG |
5848 | |
5849 | if (comp_template_args (CLASSTYPE_TI_ARGS (template_type), arglist)) | |
5850 | /* This instantiation is another name for the primary | |
5851 | template type. Set the TYPE_CANONICAL field | |
5852 | appropriately. */ | |
5853 | TYPE_CANONICAL (t) = template_type; | |
5854 | else if (any_template_arguments_need_structural_equality_p (arglist)) | |
5855 | /* Some of the template arguments require structural | |
5856 | equality testing, so this template class requires | |
5857 | structural equality testing. */ | |
5858 | SET_TYPE_STRUCTURAL_EQUALITY (t); | |
ed44da02 MM |
5859 | } |
5860 | ||
ae673f14 JM |
5861 | /* If we called start_enum or pushtag above, this information |
5862 | will already be set up. */ | |
ed44da02 MM |
5863 | if (!TYPE_NAME (t)) |
5864 | { | |
5865 | TYPE_CONTEXT (t) = FROB_CONTEXT (context); | |
c8094d83 | 5866 | |
9188c363 | 5867 | type_decl = create_implicit_typedef (DECL_NAME (template), t); |
ed44da02 | 5868 | DECL_CONTEXT (type_decl) = TYPE_CONTEXT (t); |
9188c363 | 5869 | TYPE_STUB_DECL (t) = type_decl; |
c8094d83 | 5870 | DECL_SOURCE_LOCATION (type_decl) |
f31686a3 | 5871 | = DECL_SOURCE_LOCATION (TYPE_STUB_DECL (template_type)); |
ed44da02 MM |
5872 | } |
5873 | else | |
5874 | type_decl = TYPE_NAME (t); | |
36a117a5 | 5875 | |
cab7a9a3 KL |
5876 | TREE_PRIVATE (type_decl) |
5877 | = TREE_PRIVATE (TYPE_STUB_DECL (template_type)); | |
5878 | TREE_PROTECTED (type_decl) | |
5879 | = TREE_PROTECTED (TYPE_STUB_DECL (template_type)); | |
12af7ba3 MM |
5880 | DECL_IN_SYSTEM_HEADER (type_decl) |
5881 | = DECL_IN_SYSTEM_HEADER (template); | |
8d039470 MS |
5882 | if (CLASSTYPE_VISIBILITY_SPECIFIED (template_type)) |
5883 | { | |
5884 | DECL_VISIBILITY_SPECIFIED (type_decl) = 1; | |
5885 | DECL_VISIBILITY (type_decl) = CLASSTYPE_VISIBILITY (template_type); | |
5886 | } | |
cab7a9a3 | 5887 | |
9fbf56f7 MM |
5888 | /* Set up the template information. We have to figure out which |
5889 | template is the immediate parent if this is a full | |
5890 | instantiation. */ | |
5891 | if (parm_depth == 1 || is_partial_instantiation | |
5892 | || !PRIMARY_TEMPLATE_P (template)) | |
5893 | /* This case is easy; there are no member templates involved. */ | |
5894 | found = template; | |
5895 | else | |
5896 | { | |
ab097535 NS |
5897 | /* This is a full instantiation of a member template. Look |
5898 | for a partial instantiation of which this is an instance. */ | |
9fbf56f7 MM |
5899 | |
5900 | for (found = DECL_TEMPLATE_INSTANTIATIONS (template); | |
5901 | found; found = TREE_CHAIN (found)) | |
5902 | { | |
5903 | int success; | |
5904 | tree tmpl = CLASSTYPE_TI_TEMPLATE (TREE_VALUE (found)); | |
5905 | ||
5906 | /* We only want partial instantiations, here, not | |
5907 | specializations or full instantiations. */ | |
370af2d5 | 5908 | if (CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_VALUE (found)) |
9fbf56f7 MM |
5909 | || !uses_template_parms (TREE_VALUE (found))) |
5910 | continue; | |
5911 | ||
5912 | /* Temporarily reduce by one the number of levels in the | |
5913 | ARGLIST and in FOUND so as to avoid comparing the | |
5914 | last set of arguments. */ | |
5915 | TREE_VEC_LENGTH (arglist)--; | |
5916 | TREE_VEC_LENGTH (TREE_PURPOSE (found)) --; | |
5917 | ||
5918 | /* See if the arguments match. If they do, then TMPL is | |
5919 | the partial instantiation we want. */ | |
5920 | success = comp_template_args (TREE_PURPOSE (found), arglist); | |
5921 | ||
5922 | /* Restore the argument vectors to their full size. */ | |
5923 | TREE_VEC_LENGTH (arglist)++; | |
5924 | TREE_VEC_LENGTH (TREE_PURPOSE (found))++; | |
5925 | ||
5926 | if (success) | |
5927 | { | |
5928 | found = tmpl; | |
5929 | break; | |
5930 | } | |
5931 | } | |
5932 | ||
5933 | if (!found) | |
ab097535 NS |
5934 | { |
5935 | /* There was no partial instantiation. This happens | |
0cbd7506 MS |
5936 | where C<T> is a member template of A<T> and it's used |
5937 | in something like | |
c8094d83 | 5938 | |
0cbd7506 MS |
5939 | template <typename T> struct B { A<T>::C<int> m; }; |
5940 | B<float>; | |
c8094d83 | 5941 | |
0cbd7506 MS |
5942 | Create the partial instantiation. |
5943 | */ | |
5944 | TREE_VEC_LENGTH (arglist)--; | |
5945 | found = tsubst (template, arglist, complain, NULL_TREE); | |
5946 | TREE_VEC_LENGTH (arglist)++; | |
5947 | } | |
9fbf56f7 MM |
5948 | } |
5949 | ||
c8094d83 MS |
5950 | SET_TYPE_TEMPLATE_INFO (t, tree_cons (found, arglist, NULL_TREE)); |
5951 | DECL_TEMPLATE_INSTANTIATIONS (template) | |
5952 | = tree_cons (arglist, t, | |
dbfe2124 MM |
5953 | DECL_TEMPLATE_INSTANTIATIONS (template)); |
5954 | ||
c8094d83 | 5955 | if (TREE_CODE (t) == ENUMERAL_TYPE |
dbfe2124 | 5956 | && !is_partial_instantiation) |
61a127b3 MM |
5957 | /* Now that the type has been registered on the instantiations |
5958 | list, we set up the enumerators. Because the enumeration | |
5959 | constants may involve the enumeration type itself, we make | |
5960 | sure to register the type first, and then create the | |
5961 | constants. That way, doing tsubst_expr for the enumeration | |
5962 | constants won't result in recursive calls here; we'll find | |
5963 | the instantiation and exit above. */ | |
5964 | tsubst_enum (template_type, t, arglist); | |
dbfe2124 | 5965 | |
7813d14c | 5966 | if (is_partial_instantiation) |
077e7015 MM |
5967 | /* If the type makes use of template parameters, the |
5968 | code that generates debugging information will crash. */ | |
5969 | DECL_IGNORED_P (TYPE_STUB_DECL (t)) = 1; | |
8d08fdba | 5970 | |
b9e75696 JM |
5971 | /* Possibly limit visibility based on template args. */ |
5972 | TREE_PUBLIC (type_decl) = 1; | |
5973 | determine_visibility (type_decl); | |
5974 | ||
fd295cb2 | 5975 | POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, t); |
36a117a5 | 5976 | } |
fd295cb2 | 5977 | timevar_pop (TV_NAME_LOOKUP); |
8d08fdba MS |
5978 | } |
5979 | \f | |
c8094d83 | 5980 | struct pair_fn_data |
8d08fdba | 5981 | { |
8dfaeb63 MM |
5982 | tree_fn_t fn; |
5983 | void *data; | |
c095a4f8 DG |
5984 | /* True when we should also visit template parameters that occur in |
5985 | non-deduced contexts. */ | |
5986 | bool include_nondeduced_p; | |
0c58f841 | 5987 | struct pointer_set_t *visited; |
8dfaeb63 MM |
5988 | }; |
5989 | ||
5990 | /* Called from for_each_template_parm via walk_tree. */ | |
581d38d0 | 5991 | |
8dfaeb63 | 5992 | static tree |
350fae66 | 5993 | for_each_template_parm_r (tree *tp, int *walk_subtrees, void *d) |
8dfaeb63 MM |
5994 | { |
5995 | tree t = *tp; | |
5996 | struct pair_fn_data *pfd = (struct pair_fn_data *) d; | |
5997 | tree_fn_t fn = pfd->fn; | |
5998 | void *data = pfd->data; | |
4f2c9d7e | 5999 | |
2f939d94 | 6000 | if (TYPE_P (t) |
c095a4f8 DG |
6001 | && (pfd->include_nondeduced_p || TREE_CODE (t) != TYPENAME_TYPE) |
6002 | && for_each_template_parm (TYPE_CONTEXT (t), fn, data, pfd->visited, | |
6003 | pfd->include_nondeduced_p)) | |
8dfaeb63 | 6004 | return error_mark_node; |
581d38d0 | 6005 | |
8d08fdba MS |
6006 | switch (TREE_CODE (t)) |
6007 | { | |
8d08fdba | 6008 | case RECORD_TYPE: |
9076e292 | 6009 | if (TYPE_PTRMEMFUNC_P (t)) |
8dfaeb63 | 6010 | break; |
ed44da02 MM |
6011 | /* Fall through. */ |
6012 | ||
8d08fdba | 6013 | case UNION_TYPE: |
ed44da02 | 6014 | case ENUMERAL_TYPE: |
8dfaeb63 MM |
6015 | if (!TYPE_TEMPLATE_INFO (t)) |
6016 | *walk_subtrees = 0; | |
6017 | else if (for_each_template_parm (TREE_VALUE (TYPE_TEMPLATE_INFO (t)), | |
c095a4f8 DG |
6018 | fn, data, pfd->visited, |
6019 | pfd->include_nondeduced_p)) | |
8dfaeb63 MM |
6020 | return error_mark_node; |
6021 | break; | |
6022 | ||
8f6e6bf3 EB |
6023 | case INTEGER_TYPE: |
6024 | if (for_each_template_parm (TYPE_MIN_VALUE (t), | |
c095a4f8 DG |
6025 | fn, data, pfd->visited, |
6026 | pfd->include_nondeduced_p) | |
8f6e6bf3 | 6027 | || for_each_template_parm (TYPE_MAX_VALUE (t), |
c095a4f8 DG |
6028 | fn, data, pfd->visited, |
6029 | pfd->include_nondeduced_p)) | |
8f6e6bf3 EB |
6030 | return error_mark_node; |
6031 | break; | |
6032 | ||
588c2d1c | 6033 | case METHOD_TYPE: |
8dfaeb63 MM |
6034 | /* Since we're not going to walk subtrees, we have to do this |
6035 | explicitly here. */ | |
4f2c9d7e | 6036 | if (for_each_template_parm (TYPE_METHOD_BASETYPE (t), fn, data, |
c095a4f8 | 6037 | pfd->visited, pfd->include_nondeduced_p)) |
8dfaeb63 | 6038 | return error_mark_node; |
4890c2f4 | 6039 | /* Fall through. */ |
588c2d1c MM |
6040 | |
6041 | case FUNCTION_TYPE: | |
8dfaeb63 | 6042 | /* Check the return type. */ |
c095a4f8 DG |
6043 | if (for_each_template_parm (TREE_TYPE (t), fn, data, pfd->visited, |
6044 | pfd->include_nondeduced_p)) | |
8dfaeb63 MM |
6045 | return error_mark_node; |
6046 | ||
588c2d1c MM |
6047 | /* Check the parameter types. Since default arguments are not |
6048 | instantiated until they are needed, the TYPE_ARG_TYPES may | |
6049 | contain expressions that involve template parameters. But, | |
6050 | no-one should be looking at them yet. And, once they're | |
6051 | instantiated, they don't contain template parameters, so | |
6052 | there's no point in looking at them then, either. */ | |
6053 | { | |
6054 | tree parm; | |
6055 | ||
6056 | for (parm = TYPE_ARG_TYPES (t); parm; parm = TREE_CHAIN (parm)) | |
4f2c9d7e | 6057 | if (for_each_template_parm (TREE_VALUE (parm), fn, data, |
c095a4f8 | 6058 | pfd->visited, pfd->include_nondeduced_p)) |
8dfaeb63 | 6059 | return error_mark_node; |
5566b478 | 6060 | |
8dfaeb63 MM |
6061 | /* Since we've already handled the TYPE_ARG_TYPES, we don't |
6062 | want walk_tree walking into them itself. */ | |
6063 | *walk_subtrees = 0; | |
6064 | } | |
6065 | break; | |
3ac3d9ea | 6066 | |
a723baf1 | 6067 | case TYPEOF_TYPE: |
c095a4f8 DG |
6068 | if (pfd->include_nondeduced_p |
6069 | && for_each_template_parm (TYPE_FIELDS (t), fn, data, | |
6070 | pfd->visited, | |
6071 | pfd->include_nondeduced_p)) | |
a723baf1 MM |
6072 | return error_mark_node; |
6073 | break; | |
6074 | ||
8d08fdba | 6075 | case FUNCTION_DECL: |
5566b478 | 6076 | case VAR_DECL: |
5566b478 | 6077 | if (DECL_LANG_SPECIFIC (t) && DECL_TEMPLATE_INFO (t) |
4f2c9d7e | 6078 | && for_each_template_parm (DECL_TI_ARGS (t), fn, data, |
c095a4f8 | 6079 | pfd->visited, pfd->include_nondeduced_p)) |
8dfaeb63 MM |
6080 | return error_mark_node; |
6081 | /* Fall through. */ | |
6082 | ||
8d08fdba | 6083 | case PARM_DECL: |
a723baf1 MM |
6084 | case CONST_DECL: |
6085 | if (TREE_CODE (t) == CONST_DECL && DECL_TEMPLATE_PARM_P (t) | |
6086 | && for_each_template_parm (DECL_INITIAL (t), fn, data, | |
c095a4f8 | 6087 | pfd->visited, pfd->include_nondeduced_p)) |
a723baf1 | 6088 | return error_mark_node; |
c8094d83 | 6089 | if (DECL_CONTEXT (t) |
c095a4f8 | 6090 | && pfd->include_nondeduced_p |
4f2c9d7e | 6091 | && for_each_template_parm (DECL_CONTEXT (t), fn, data, |
c095a4f8 | 6092 | pfd->visited, pfd->include_nondeduced_p)) |
8dfaeb63 MM |
6093 | return error_mark_node; |
6094 | break; | |
8d08fdba | 6095 | |
a1281f45 | 6096 | case BOUND_TEMPLATE_TEMPLATE_PARM: |
744fac59 | 6097 | /* Record template parameters such as `T' inside `TT<T>'. */ |
c095a4f8 DG |
6098 | if (for_each_template_parm (TYPE_TI_ARGS (t), fn, data, pfd->visited, |
6099 | pfd->include_nondeduced_p)) | |
8dfaeb63 MM |
6100 | return error_mark_node; |
6101 | /* Fall through. */ | |
6102 | ||
a1281f45 | 6103 | case TEMPLATE_TEMPLATE_PARM: |
744fac59 | 6104 | case TEMPLATE_TYPE_PARM: |
f84b4be9 | 6105 | case TEMPLATE_PARM_INDEX: |
8dfaeb63 MM |
6106 | if (fn && (*fn)(t, data)) |
6107 | return error_mark_node; | |
6108 | else if (!fn) | |
6109 | return error_mark_node; | |
6110 | break; | |
5156628f | 6111 | |
8dfaeb63 | 6112 | case TEMPLATE_DECL: |
f4f206f4 | 6113 | /* A template template parameter is encountered. */ |
8dfaeb63 | 6114 | if (DECL_TEMPLATE_TEMPLATE_PARM_P (t) |
c095a4f8 DG |
6115 | && for_each_template_parm (TREE_TYPE (t), fn, data, pfd->visited, |
6116 | pfd->include_nondeduced_p)) | |
8dfaeb63 | 6117 | return error_mark_node; |
db5ae43f | 6118 | |
8dfaeb63 MM |
6119 | /* Already substituted template template parameter */ |
6120 | *walk_subtrees = 0; | |
6121 | break; | |
b8865407 | 6122 | |
4699c561 | 6123 | case TYPENAME_TYPE: |
c8094d83 | 6124 | if (!fn |
4f2c9d7e | 6125 | || for_each_template_parm (TYPENAME_TYPE_FULLNAME (t), fn, |
c095a4f8 DG |
6126 | data, pfd->visited, |
6127 | pfd->include_nondeduced_p)) | |
8dfaeb63 MM |
6128 | return error_mark_node; |
6129 | break; | |
4699c561 | 6130 | |
8dfaeb63 MM |
6131 | case CONSTRUCTOR: |
6132 | if (TREE_TYPE (t) && TYPE_PTRMEMFUNC_P (TREE_TYPE (t)) | |
c095a4f8 | 6133 | && pfd->include_nondeduced_p |
8dfaeb63 | 6134 | && for_each_template_parm (TYPE_PTRMEMFUNC_FN_TYPE |
4f2c9d7e | 6135 | (TREE_TYPE (t)), fn, data, |
c095a4f8 | 6136 | pfd->visited, pfd->include_nondeduced_p)) |
8dfaeb63 MM |
6137 | return error_mark_node; |
6138 | break; | |
c8094d83 | 6139 | |
b8865407 MM |
6140 | case INDIRECT_REF: |
6141 | case COMPONENT_REF: | |
4699c561 | 6142 | /* If there's no type, then this thing must be some expression |
b8865407 | 6143 | involving template parameters. */ |
4699c561 | 6144 | if (!fn && !TREE_TYPE (t)) |
8dfaeb63 MM |
6145 | return error_mark_node; |
6146 | break; | |
b8865407 | 6147 | |
42976354 BK |
6148 | case MODOP_EXPR: |
6149 | case CAST_EXPR: | |
6150 | case REINTERPRET_CAST_EXPR: | |
6151 | case CONST_CAST_EXPR: | |
6152 | case STATIC_CAST_EXPR: | |
6153 | case DYNAMIC_CAST_EXPR: | |
42976354 BK |
6154 | case ARROW_EXPR: |
6155 | case DOTSTAR_EXPR: | |
6156 | case TYPEID_EXPR: | |
40242ccf | 6157 | case PSEUDO_DTOR_EXPR: |
b8865407 | 6158 | if (!fn) |
8dfaeb63 MM |
6159 | return error_mark_node; |
6160 | break; | |
abff8e06 | 6161 | |
8d08fdba | 6162 | default: |
8dfaeb63 | 6163 | break; |
8d08fdba | 6164 | } |
8dfaeb63 MM |
6165 | |
6166 | /* We didn't find any template parameters we liked. */ | |
6167 | return NULL_TREE; | |
6168 | } | |
6169 | ||
c8094d83 MS |
6170 | /* For each TEMPLATE_TYPE_PARM, TEMPLATE_TEMPLATE_PARM, |
6171 | BOUND_TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX in T, | |
a1281f45 | 6172 | call FN with the parameter and the DATA. |
838dfd8a | 6173 | If FN returns nonzero, the iteration is terminated, and |
8dfaeb63 | 6174 | for_each_template_parm returns 1. Otherwise, the iteration |
838dfd8a | 6175 | continues. If FN never returns a nonzero value, the value |
8dfaeb63 | 6176 | returned by for_each_template_parm is 0. If FN is NULL, it is |
c095a4f8 DG |
6177 | considered to be the function which always returns 1. |
6178 | ||
6179 | If INCLUDE_NONDEDUCED_P, then this routine will also visit template | |
6180 | parameters that occur in non-deduced contexts. When false, only | |
6181 | visits those template parameters that can be deduced. */ | |
8dfaeb63 MM |
6182 | |
6183 | static int | |
0c58f841 | 6184 | for_each_template_parm (tree t, tree_fn_t fn, void* data, |
c095a4f8 DG |
6185 | struct pointer_set_t *visited, |
6186 | bool include_nondeduced_p) | |
8dfaeb63 MM |
6187 | { |
6188 | struct pair_fn_data pfd; | |
ad2ae3b2 | 6189 | int result; |
8dfaeb63 MM |
6190 | |
6191 | /* Set up. */ | |
6192 | pfd.fn = fn; | |
6193 | pfd.data = data; | |
c095a4f8 | 6194 | pfd.include_nondeduced_p = include_nondeduced_p; |
8dfaeb63 | 6195 | |
4890c2f4 MM |
6196 | /* Walk the tree. (Conceptually, we would like to walk without |
6197 | duplicates, but for_each_template_parm_r recursively calls | |
6198 | for_each_template_parm, so we would need to reorganize a fair | |
4f2c9d7e MM |
6199 | bit to use walk_tree_without_duplicates, so we keep our own |
6200 | visited list.) */ | |
6201 | if (visited) | |
6202 | pfd.visited = visited; | |
6203 | else | |
0c58f841 | 6204 | pfd.visited = pointer_set_create (); |
14588106 RG |
6205 | result = cp_walk_tree (&t, |
6206 | for_each_template_parm_r, | |
6207 | &pfd, | |
6208 | pfd.visited) != NULL_TREE; | |
ad2ae3b2 MM |
6209 | |
6210 | /* Clean up. */ | |
6211 | if (!visited) | |
0c58f841 MA |
6212 | { |
6213 | pointer_set_destroy (pfd.visited); | |
6214 | pfd.visited = 0; | |
6215 | } | |
ad2ae3b2 MM |
6216 | |
6217 | return result; | |
8d08fdba MS |
6218 | } |
6219 | ||
d43f603d KL |
6220 | /* Returns true if T depends on any template parameter. */ |
6221 | ||
050367a3 | 6222 | int |
3a978d72 | 6223 | uses_template_parms (tree t) |
050367a3 | 6224 | { |
c353b8e3 MM |
6225 | bool dependent_p; |
6226 | int saved_processing_template_decl; | |
6227 | ||
6228 | saved_processing_template_decl = processing_template_decl; | |
6229 | if (!saved_processing_template_decl) | |
6230 | processing_template_decl = 1; | |
6231 | if (TYPE_P (t)) | |
6232 | dependent_p = dependent_type_p (t); | |
6233 | else if (TREE_CODE (t) == TREE_VEC) | |
6234 | dependent_p = any_dependent_template_arguments_p (t); | |
6235 | else if (TREE_CODE (t) == TREE_LIST) | |
6236 | dependent_p = (uses_template_parms (TREE_VALUE (t)) | |
6237 | || uses_template_parms (TREE_CHAIN (t))); | |
3ce5fa4f NS |
6238 | else if (TREE_CODE (t) == TYPE_DECL) |
6239 | dependent_p = dependent_type_p (TREE_TYPE (t)); | |
c8094d83 MS |
6240 | else if (DECL_P (t) |
6241 | || EXPR_P (t) | |
c353b8e3 MM |
6242 | || TREE_CODE (t) == TEMPLATE_PARM_INDEX |
6243 | || TREE_CODE (t) == OVERLOAD | |
6244 | || TREE_CODE (t) == BASELINK | |
b207d6e2 | 6245 | || TREE_CODE (t) == IDENTIFIER_NODE |
cb68ec50 | 6246 | || TREE_CODE (t) == TRAIT_EXPR |
6615c446 | 6247 | || CONSTANT_CLASS_P (t)) |
c353b8e3 MM |
6248 | dependent_p = (type_dependent_expression_p (t) |
6249 | || value_dependent_expression_p (t)); | |
315fb5db NS |
6250 | else |
6251 | { | |
6252 | gcc_assert (t == error_mark_node); | |
6253 | dependent_p = false; | |
6254 | } | |
c8094d83 | 6255 | |
c353b8e3 MM |
6256 | processing_template_decl = saved_processing_template_decl; |
6257 | ||
6258 | return dependent_p; | |
050367a3 MM |
6259 | } |
6260 | ||
d43f603d KL |
6261 | /* Returns true if T depends on any template parameter with level LEVEL. */ |
6262 | ||
6263 | int | |
6264 | uses_template_parms_level (tree t, int level) | |
6265 | { | |
c095a4f8 DG |
6266 | return for_each_template_parm (t, template_parm_this_level_p, &level, NULL, |
6267 | /*include_nondeduced_p=*/true); | |
d43f603d KL |
6268 | } |
6269 | ||
27fafc8d | 6270 | static int tinst_depth; |
e9f32eb5 | 6271 | extern int max_tinst_depth; |
5566b478 | 6272 | #ifdef GATHER_STATISTICS |
27fafc8d | 6273 | int depth_reached; |
5566b478 | 6274 | #endif |
8dfaeb63 MM |
6275 | static int tinst_level_tick; |
6276 | static int last_template_error_tick; | |
8d08fdba | 6277 | |
3ae18eaf JM |
6278 | /* We're starting to instantiate D; record the template instantiation context |
6279 | for diagnostics and to restore it later. */ | |
6280 | ||
aa9d8196 | 6281 | static int |
3a978d72 | 6282 | push_tinst_level (tree d) |
8d08fdba | 6283 | { |
e2c3721c | 6284 | struct tinst_level *new; |
8d08fdba | 6285 | |
7215f9a0 MS |
6286 | if (tinst_depth >= max_tinst_depth) |
6287 | { | |
8adf5b5e JM |
6288 | /* If the instantiation in question still has unbound template parms, |
6289 | we don't really care if we can't instantiate it, so just return. | |
0cbd7506 | 6290 | This happens with base instantiation for implicit `typename'. */ |
8adf5b5e JM |
6291 | if (uses_template_parms (d)) |
6292 | return 0; | |
6293 | ||
1139b3d8 | 6294 | last_template_error_tick = tinst_level_tick; |
0f51ccfc | 6295 | error ("template instantiation depth exceeds maximum of %d (use " |
0cbd7506 | 6296 | "-ftemplate-depth-NN to increase the maximum) instantiating %qD", |
b4f4233d | 6297 | max_tinst_depth, d); |
5566b478 | 6298 | |
cb753e49 | 6299 | print_instantiation_context (); |
5566b478 | 6300 | |
7215f9a0 MS |
6301 | return 0; |
6302 | } | |
6303 | ||
e2c3721c PB |
6304 | new = GGC_NEW (struct tinst_level); |
6305 | new->decl = d; | |
6306 | new->locus = input_location; | |
6307 | new->in_system_header_p = in_system_header; | |
6308 | new->next = current_tinst_level; | |
8d08fdba | 6309 | current_tinst_level = new; |
5566b478 | 6310 | |
7215f9a0 | 6311 | ++tinst_depth; |
5566b478 MS |
6312 | #ifdef GATHER_STATISTICS |
6313 | if (tinst_depth > depth_reached) | |
6314 | depth_reached = tinst_depth; | |
6315 | #endif | |
6316 | ||
27fafc8d | 6317 | ++tinst_level_tick; |
7215f9a0 | 6318 | return 1; |
8d08fdba MS |
6319 | } |
6320 | ||
3ae18eaf JM |
6321 | /* We're done instantiating this template; return to the instantiation |
6322 | context. */ | |
6323 | ||
aa9d8196 | 6324 | static void |
3a978d72 | 6325 | pop_tinst_level (void) |
8d08fdba | 6326 | { |
ae58fa02 MM |
6327 | /* Restore the filename and line number stashed away when we started |
6328 | this instantiation. */ | |
e2c3721c PB |
6329 | input_location = current_tinst_level->locus; |
6330 | in_system_header = current_tinst_level->in_system_header_p; | |
6331 | current_tinst_level = current_tinst_level->next; | |
7215f9a0 | 6332 | --tinst_depth; |
27fafc8d | 6333 | ++tinst_level_tick; |
8d08fdba MS |
6334 | } |
6335 | ||
3ae18eaf JM |
6336 | /* We're instantiating a deferred template; restore the template |
6337 | instantiation context in which the instantiation was requested, which | |
e2c3721c | 6338 | is one step out from LEVEL. Return the corresponding DECL or TYPE. */ |
3ae18eaf | 6339 | |
e2c3721c PB |
6340 | static tree |
6341 | reopen_tinst_level (struct tinst_level *level) | |
3ae18eaf | 6342 | { |
e2c3721c | 6343 | struct tinst_level *t; |
3ae18eaf JM |
6344 | |
6345 | tinst_depth = 0; | |
e2c3721c | 6346 | for (t = level; t; t = t->next) |
3ae18eaf JM |
6347 | ++tinst_depth; |
6348 | ||
6349 | current_tinst_level = level; | |
6350 | pop_tinst_level (); | |
e2c3721c | 6351 | return level->decl; |
3ae18eaf JM |
6352 | } |
6353 | ||
61172206 JM |
6354 | /* Returns the TINST_LEVEL which gives the original instantiation |
6355 | context. */ | |
6356 | ||
e2c3721c | 6357 | struct tinst_level * |
61172206 JM |
6358 | outermost_tinst_level (void) |
6359 | { | |
e2c3721c PB |
6360 | struct tinst_level *level = current_tinst_level; |
6361 | if (level) | |
6362 | while (level->next) | |
6363 | level = level->next; | |
6364 | return level; | |
61172206 JM |
6365 | } |
6366 | ||
f84b4be9 JM |
6367 | /* DECL is a friend FUNCTION_DECL or TEMPLATE_DECL. ARGS is the |
6368 | vector of template arguments, as for tsubst. | |
6369 | ||
dc957d14 | 6370 | Returns an appropriate tsubst'd friend declaration. */ |
f84b4be9 JM |
6371 | |
6372 | static tree | |
3a978d72 | 6373 | tsubst_friend_function (tree decl, tree args) |
f84b4be9 JM |
6374 | { |
6375 | tree new_friend; | |
27fafc8d | 6376 | |
c8094d83 | 6377 | if (TREE_CODE (decl) == FUNCTION_DECL |
f84b4be9 JM |
6378 | && DECL_TEMPLATE_INSTANTIATION (decl) |
6379 | && TREE_CODE (DECL_TI_TEMPLATE (decl)) != TEMPLATE_DECL) | |
6380 | /* This was a friend declared with an explicit template | |
6381 | argument list, e.g.: | |
c8094d83 | 6382 | |
f84b4be9 | 6383 | friend void f<>(T); |
c8094d83 | 6384 | |
f84b4be9 JM |
6385 | to indicate that f was a template instantiation, not a new |
6386 | function declaration. Now, we have to figure out what | |
6387 | instantiation of what template. */ | |
6388 | { | |
76e57b45 | 6389 | tree template_id, arglist, fns; |
f84b4be9 JM |
6390 | tree new_args; |
6391 | tree tmpl; | |
ed2fa432 | 6392 | tree ns = decl_namespace_context (TYPE_MAIN_DECL (current_class_type)); |
c8094d83 | 6393 | |
76e57b45 | 6394 | /* Friend functions are looked up in the containing namespace scope. |
0cbd7506 MS |
6395 | We must enter that scope, to avoid finding member functions of the |
6396 | current cless with same name. */ | |
76e57b45 NS |
6397 | push_nested_namespace (ns); |
6398 | fns = tsubst_expr (DECL_TI_TEMPLATE (decl), args, | |
015c2c66 MM |
6399 | tf_warning_or_error, NULL_TREE, |
6400 | /*integral_constant_expression_p=*/false); | |
76e57b45 NS |
6401 | pop_nested_namespace (ns); |
6402 | arglist = tsubst (DECL_TI_ARGS (decl), args, | |
23fca1f5 | 6403 | tf_warning_or_error, NULL_TREE); |
76e57b45 | 6404 | template_id = lookup_template_function (fns, arglist); |
c8094d83 | 6405 | |
23fca1f5 | 6406 | new_friend = tsubst (decl, args, tf_warning_or_error, NULL_TREE); |
36a117a5 | 6407 | tmpl = determine_specialization (template_id, new_friend, |
c8094d83 | 6408 | &new_args, |
5fe7b654 | 6409 | /*need_member_template=*/0, |
29a1da1c MM |
6410 | TREE_VEC_LENGTH (args), |
6411 | tsk_none); | |
6e432b31 | 6412 | return instantiate_template (tmpl, new_args, tf_error); |
f84b4be9 | 6413 | } |
36a117a5 | 6414 | |
23fca1f5 | 6415 | new_friend = tsubst (decl, args, tf_warning_or_error, NULL_TREE); |
c8094d83 | 6416 | |
36a117a5 | 6417 | /* The NEW_FRIEND will look like an instantiation, to the |
f84b4be9 JM |
6418 | compiler, but is not an instantiation from the point of view of |
6419 | the language. For example, we might have had: | |
c8094d83 | 6420 | |
f84b4be9 JM |
6421 | template <class T> struct S { |
6422 | template <class U> friend void f(T, U); | |
6423 | }; | |
c8094d83 | 6424 | |
f84b4be9 JM |
6425 | Then, in S<int>, template <class U> void f(int, U) is not an |
6426 | instantiation of anything. */ | |
ac2b3222 AP |
6427 | if (new_friend == error_mark_node) |
6428 | return error_mark_node; | |
c8094d83 | 6429 | |
f84b4be9 JM |
6430 | DECL_USE_TEMPLATE (new_friend) = 0; |
6431 | if (TREE_CODE (decl) == TEMPLATE_DECL) | |
655dc6ee JM |
6432 | { |
6433 | DECL_USE_TEMPLATE (DECL_TEMPLATE_RESULT (new_friend)) = 0; | |
6434 | DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (new_friend)) | |
6435 | = DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (decl)); | |
6436 | } | |
36a117a5 | 6437 | |
92643fea MM |
6438 | /* The mangled name for the NEW_FRIEND is incorrect. The function |
6439 | is not a template instantiation and should not be mangled like | |
6440 | one. Therefore, we forget the mangling here; we'll recompute it | |
6441 | later if we need it. */ | |
36a117a5 MM |
6442 | if (TREE_CODE (new_friend) != TEMPLATE_DECL) |
6443 | { | |
19e7881c | 6444 | SET_DECL_RTL (new_friend, NULL_RTX); |
92643fea | 6445 | SET_DECL_ASSEMBLER_NAME (new_friend, NULL_TREE); |
36a117a5 | 6446 | } |
c8094d83 | 6447 | |
6eb3bb27 | 6448 | if (DECL_NAMESPACE_SCOPE_P (new_friend)) |
f84b4be9 | 6449 | { |
36a117a5 | 6450 | tree old_decl; |
fbf1c34b MM |
6451 | tree new_friend_template_info; |
6452 | tree new_friend_result_template_info; | |
92da7074 | 6453 | tree ns; |
fbf1c34b MM |
6454 | int new_friend_is_defn; |
6455 | ||
6456 | /* We must save some information from NEW_FRIEND before calling | |
6457 | duplicate decls since that function will free NEW_FRIEND if | |
6458 | possible. */ | |
6459 | new_friend_template_info = DECL_TEMPLATE_INFO (new_friend); | |
5bd61841 | 6460 | new_friend_is_defn = |
c8094d83 | 6461 | (DECL_INITIAL (DECL_TEMPLATE_RESULT |
5bd61841 MM |
6462 | (template_for_substitution (new_friend))) |
6463 | != NULL_TREE); | |
f84b4be9 | 6464 | if (TREE_CODE (new_friend) == TEMPLATE_DECL) |
fbf1c34b MM |
6465 | { |
6466 | /* This declaration is a `primary' template. */ | |
6467 | DECL_PRIMARY_TEMPLATE (new_friend) = new_friend; | |
c8094d83 | 6468 | |
fbf1c34b | 6469 | new_friend_result_template_info |
17aec3eb | 6470 | = DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (new_friend)); |
fbf1c34b MM |
6471 | } |
6472 | else | |
5bd61841 | 6473 | new_friend_result_template_info = NULL_TREE; |
36a117a5 | 6474 | |
b01e6d2b JM |
6475 | /* Make the init_value nonzero so pushdecl knows this is a defn. */ |
6476 | if (new_friend_is_defn) | |
6477 | DECL_INITIAL (new_friend) = error_mark_node; | |
6478 | ||
1c227897 MM |
6479 | /* Inside pushdecl_namespace_level, we will push into the |
6480 | current namespace. However, the friend function should go | |
c6002625 | 6481 | into the namespace of the template. */ |
92da7074 ML |
6482 | ns = decl_namespace_context (new_friend); |
6483 | push_nested_namespace (ns); | |
d63d5d0c | 6484 | old_decl = pushdecl_namespace_level (new_friend, /*is_friend=*/true); |
92da7074 | 6485 | pop_nested_namespace (ns); |
36a117a5 | 6486 | |
0014c247 VR |
6487 | if (old_decl == error_mark_node) |
6488 | return error_mark_node; | |
6489 | ||
36a117a5 MM |
6490 | if (old_decl != new_friend) |
6491 | { | |
6492 | /* This new friend declaration matched an existing | |
6493 | declaration. For example, given: | |
6494 | ||
6495 | template <class T> void f(T); | |
c8094d83 MS |
6496 | template <class U> class C { |
6497 | template <class T> friend void f(T) {} | |
36a117a5 MM |
6498 | }; |
6499 | ||
6500 | the friend declaration actually provides the definition | |
6501 | of `f', once C has been instantiated for some type. So, | |
6502 | old_decl will be the out-of-class template declaration, | |
6503 | while new_friend is the in-class definition. | |
6504 | ||
6505 | But, if `f' was called before this point, the | |
6506 | instantiation of `f' will have DECL_TI_ARGS corresponding | |
6507 | to `T' but not to `U', references to which might appear | |
6508 | in the definition of `f'. Previously, the most general | |
6509 | template for an instantiation of `f' was the out-of-class | |
6510 | version; now it is the in-class version. Therefore, we | |
6511 | run through all specialization of `f', adding to their | |
6512 | DECL_TI_ARGS appropriately. In particular, they need a | |
6513 | new set of outer arguments, corresponding to the | |
c8094d83 | 6514 | arguments for this class instantiation. |
36a117a5 MM |
6515 | |
6516 | The same situation can arise with something like this: | |
6517 | ||
6518 | friend void f(int); | |
c8094d83 | 6519 | template <class T> class C { |
0cbd7506 MS |
6520 | friend void f(T) {} |
6521 | }; | |
36a117a5 MM |
6522 | |
6523 | when `C<int>' is instantiated. Now, `f(int)' is defined | |
6524 | in the class. */ | |
6525 | ||
fbf1c34b MM |
6526 | if (!new_friend_is_defn) |
6527 | /* On the other hand, if the in-class declaration does | |
6528 | *not* provide a definition, then we don't want to alter | |
6529 | existing definitions. We can just leave everything | |
6530 | alone. */ | |
36a117a5 | 6531 | ; |
fbf1c34b | 6532 | else |
36a117a5 | 6533 | { |
fbf1c34b MM |
6534 | /* Overwrite whatever template info was there before, if |
6535 | any, with the new template information pertaining to | |
6536 | the declaration. */ | |
6537 | DECL_TEMPLATE_INFO (old_decl) = new_friend_template_info; | |
6538 | ||
6539 | if (TREE_CODE (old_decl) != TEMPLATE_DECL) | |
8d83f792 MM |
6540 | reregister_specialization (new_friend, |
6541 | most_general_template (old_decl), | |
6542 | old_decl); | |
c8094d83 | 6543 | else |
36a117a5 | 6544 | { |
fbf1c34b MM |
6545 | tree t; |
6546 | tree new_friend_args; | |
6547 | ||
c8094d83 | 6548 | DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (old_decl)) |
fbf1c34b | 6549 | = new_friend_result_template_info; |
c8094d83 | 6550 | |
fbf1c34b | 6551 | new_friend_args = TI_ARGS (new_friend_template_info); |
c8094d83 | 6552 | for (t = DECL_TEMPLATE_SPECIALIZATIONS (old_decl); |
fbf1c34b MM |
6553 | t != NULL_TREE; |
6554 | t = TREE_CHAIN (t)) | |
6555 | { | |
6556 | tree spec = TREE_VALUE (t); | |
c8094d83 MS |
6557 | |
6558 | DECL_TI_ARGS (spec) | |
fbf1c34b MM |
6559 | = add_outermost_template_args (new_friend_args, |
6560 | DECL_TI_ARGS (spec)); | |
fbf1c34b MM |
6561 | } |
6562 | ||
6563 | /* Now, since specializations are always supposed to | |
6564 | hang off of the most general template, we must move | |
6565 | them. */ | |
6566 | t = most_general_template (old_decl); | |
6567 | if (t != old_decl) | |
6568 | { | |
6569 | DECL_TEMPLATE_SPECIALIZATIONS (t) | |
6570 | = chainon (DECL_TEMPLATE_SPECIALIZATIONS (t), | |
6571 | DECL_TEMPLATE_SPECIALIZATIONS (old_decl)); | |
6572 | DECL_TEMPLATE_SPECIALIZATIONS (old_decl) = NULL_TREE; | |
6573 | } | |
36a117a5 MM |
6574 | } |
6575 | } | |
6576 | ||
6577 | /* The information from NEW_FRIEND has been merged into OLD_DECL | |
6578 | by duplicate_decls. */ | |
6579 | new_friend = old_decl; | |
6580 | } | |
f84b4be9 | 6581 | } |
6e432b31 | 6582 | else |
f84b4be9 | 6583 | { |
6e432b31 KL |
6584 | tree context = DECL_CONTEXT (new_friend); |
6585 | bool dependent_p; | |
6586 | ||
6587 | /* In the code | |
6588 | template <class T> class C { | |
6589 | template <class U> friend void C1<U>::f (); // case 1 | |
6590 | friend void C2<T>::f (); // case 2 | |
6591 | }; | |
6592 | we only need to make sure CONTEXT is a complete type for | |
6593 | case 2. To distinguish between the two cases, we note that | |
6594 | CONTEXT of case 1 remains dependent type after tsubst while | |
6595 | this isn't true for case 2. */ | |
6596 | ++processing_template_decl; | |
6597 | dependent_p = dependent_type_p (context); | |
6598 | --processing_template_decl; | |
6599 | ||
6600 | if (!dependent_p | |
6601 | && !complete_type_or_else (context, NULL_TREE)) | |
6602 | return error_mark_node; | |
6603 | ||
6604 | if (COMPLETE_TYPE_P (context)) | |
6605 | { | |
6606 | /* Check to see that the declaration is really present, and, | |
6607 | possibly obtain an improved declaration. */ | |
6608 | tree fn = check_classfn (context, | |
6609 | new_friend, NULL_TREE); | |
6610 | ||
684939ce | 6611 | if (fn) |
6e432b31 KL |
6612 | new_friend = fn; |
6613 | } | |
f84b4be9 JM |
6614 | } |
6615 | ||
6616 | return new_friend; | |
6617 | } | |
6618 | ||
1aed5355 MM |
6619 | /* FRIEND_TMPL is a friend TEMPLATE_DECL. ARGS is the vector of |
6620 | template arguments, as for tsubst. | |
6757edfe | 6621 | |
dc957d14 | 6622 | Returns an appropriate tsubst'd friend type or error_mark_node on |
4b054b80 | 6623 | failure. */ |
6757edfe MM |
6624 | |
6625 | static tree | |
3a978d72 | 6626 | tsubst_friend_class (tree friend_tmpl, tree args) |
6757edfe | 6627 | { |
1aed5355 | 6628 | tree friend_type; |
25aab5d0 | 6629 | tree tmpl; |
3e0ec82f | 6630 | tree context; |
6757edfe | 6631 | |
3e0ec82f MM |
6632 | context = DECL_CONTEXT (friend_tmpl); |
6633 | ||
6634 | if (context) | |
77adef84 | 6635 | { |
3e0ec82f MM |
6636 | if (TREE_CODE (context) == NAMESPACE_DECL) |
6637 | push_nested_namespace (context); | |
6638 | else | |
c8094d83 | 6639 | push_nested_class (tsubst (context, args, tf_none, NULL_TREE)); |
3e0ec82f | 6640 | } |
25aab5d0 | 6641 | |
105d72c5 MM |
6642 | /* Look for a class template declaration. We look for hidden names |
6643 | because two friend declarations of the same template are the | |
6644 | same. For example, in: | |
6645 | ||
6646 | struct A { | |
6647 | template <typename> friend class F; | |
6648 | }; | |
6649 | template <typename> struct B { | |
6650 | template <typename> friend class F; | |
6651 | }; | |
6652 | ||
6653 | both F templates are the same. */ | |
6654 | tmpl = lookup_name_real (DECL_NAME (friend_tmpl), 0, 0, | |
6655 | /*block_p=*/true, 0, | |
6656 | LOOKUP_COMPLAIN | LOOKUP_HIDDEN); | |
25aab5d0 | 6657 | |
3e0ec82f MM |
6658 | /* But, if we don't find one, it might be because we're in a |
6659 | situation like this: | |
77adef84 | 6660 | |
3e0ec82f MM |
6661 | template <class T> |
6662 | struct S { | |
6663 | template <class U> | |
6664 | friend struct S; | |
6665 | }; | |
6666 | ||
6667 | Here, in the scope of (say) S<int>, `S' is bound to a TYPE_DECL | |
6668 | for `S<int>', not the TEMPLATE_DECL. */ | |
6669 | if (!tmpl || !DECL_CLASS_TEMPLATE_P (tmpl)) | |
6670 | { | |
10e6657a | 6671 | tmpl = lookup_name_prefer_type (DECL_NAME (friend_tmpl), 1); |
3e0ec82f | 6672 | tmpl = maybe_get_template_decl_from_type_decl (tmpl); |
25aab5d0 | 6673 | } |
6757edfe | 6674 | |
25aab5d0 | 6675 | if (tmpl && DECL_CLASS_TEMPLATE_P (tmpl)) |
6757edfe MM |
6676 | { |
6677 | /* The friend template has already been declared. Just | |
36a117a5 MM |
6678 | check to see that the declarations match, and install any new |
6679 | default parameters. We must tsubst the default parameters, | |
6680 | of course. We only need the innermost template parameters | |
6681 | because that is all that redeclare_class_template will look | |
6682 | at. */ | |
3e0ec82f MM |
6683 | if (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (friend_tmpl)) |
6684 | > TMPL_ARGS_DEPTH (args)) | |
6685 | { | |
6686 | tree parms; | |
b131ad7c | 6687 | location_t saved_input_location; |
3e0ec82f | 6688 | parms = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_tmpl), |
23fca1f5 | 6689 | args, tf_warning_or_error); |
b131ad7c MLI |
6690 | |
6691 | saved_input_location = input_location; | |
6692 | input_location = DECL_SOURCE_LOCATION (friend_tmpl); | |
3e0ec82f | 6693 | redeclare_class_template (TREE_TYPE (tmpl), parms); |
b131ad7c MLI |
6694 | input_location = saved_input_location; |
6695 | ||
3e0ec82f MM |
6696 | } |
6697 | ||
6757edfe MM |
6698 | friend_type = TREE_TYPE (tmpl); |
6699 | } | |
6700 | else | |
6701 | { | |
6702 | /* The friend template has not already been declared. In this | |
6703 | case, the instantiation of the template class will cause the | |
6704 | injection of this template into the global scope. */ | |
23fca1f5 | 6705 | tmpl = tsubst (friend_tmpl, args, tf_warning_or_error, NULL_TREE); |
dca56f77 VR |
6706 | if (tmpl == error_mark_node) |
6707 | return error_mark_node; | |
6757edfe MM |
6708 | |
6709 | /* The new TMPL is not an instantiation of anything, so we | |
0cbd7506 | 6710 | forget its origins. We don't reset CLASSTYPE_TI_TEMPLATE for |
6757edfe MM |
6711 | the new type because that is supposed to be the corresponding |
6712 | template decl, i.e., TMPL. */ | |
6713 | DECL_USE_TEMPLATE (tmpl) = 0; | |
6714 | DECL_TEMPLATE_INFO (tmpl) = NULL_TREE; | |
6715 | CLASSTYPE_USE_TEMPLATE (TREE_TYPE (tmpl)) = 0; | |
68c78847 KL |
6716 | CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl)) |
6717 | = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl))); | |
6757edfe MM |
6718 | |
6719 | /* Inject this template into the global scope. */ | |
d63d5d0c | 6720 | friend_type = TREE_TYPE (pushdecl_top_level_maybe_friend (tmpl, true)); |
6757edfe MM |
6721 | } |
6722 | ||
c8094d83 | 6723 | if (context) |
3e0ec82f MM |
6724 | { |
6725 | if (TREE_CODE (context) == NAMESPACE_DECL) | |
6726 | pop_nested_namespace (context); | |
6727 | else | |
6728 | pop_nested_class (); | |
6729 | } | |
6730 | ||
6757edfe MM |
6731 | return friend_type; |
6732 | } | |
f84b4be9 | 6733 | |
17f29637 KL |
6734 | /* Returns zero if TYPE cannot be completed later due to circularity. |
6735 | Otherwise returns one. */ | |
6736 | ||
d5372501 | 6737 | static int |
3a978d72 | 6738 | can_complete_type_without_circularity (tree type) |
17f29637 KL |
6739 | { |
6740 | if (type == NULL_TREE || type == error_mark_node) | |
6741 | return 0; | |
6742 | else if (COMPLETE_TYPE_P (type)) | |
6743 | return 1; | |
6744 | else if (TREE_CODE (type) == ARRAY_TYPE && TYPE_DOMAIN (type)) | |
6745 | return can_complete_type_without_circularity (TREE_TYPE (type)); | |
8c6ab2db NS |
6746 | else if (CLASS_TYPE_P (type) |
6747 | && TYPE_BEING_DEFINED (TYPE_MAIN_VARIANT (type))) | |
17f29637 KL |
6748 | return 0; |
6749 | else | |
6750 | return 1; | |
6751 | } | |
6752 | ||
4f4141ff JM |
6753 | /* Apply any attributes which had to be deferred until instantiation |
6754 | time. DECL_P, ATTRIBUTES and ATTR_FLAGS are as cplus_decl_attributes; | |
6755 | ARGS, COMPLAIN, IN_DECL are as tsubst. */ | |
6756 | ||
6757 | static void | |
6758 | apply_late_template_attributes (tree *decl_p, tree attributes, int attr_flags, | |
6759 | tree args, tsubst_flags_t complain, tree in_decl) | |
6760 | { | |
5818c8e4 | 6761 | tree last_dep = NULL_TREE; |
4f4141ff | 6762 | tree t; |
5818c8e4 JM |
6763 | tree *p; |
6764 | ||
6765 | for (t = attributes; t; t = TREE_CHAIN (t)) | |
6766 | if (ATTR_IS_DEPENDENT (t)) | |
6767 | { | |
6768 | last_dep = t; | |
6769 | attributes = copy_list (attributes); | |
6770 | break; | |
6771 | } | |
4f4141ff JM |
6772 | |
6773 | if (DECL_P (*decl_p)) | |
823e5f7f JJ |
6774 | { |
6775 | if (TREE_TYPE (*decl_p) == error_mark_node) | |
6776 | return; | |
6777 | p = &DECL_ATTRIBUTES (*decl_p); | |
6778 | } | |
4f4141ff | 6779 | else |
5818c8e4 | 6780 | p = &TYPE_ATTRIBUTES (*decl_p); |
4f4141ff | 6781 | |
5818c8e4 JM |
6782 | if (last_dep) |
6783 | { | |
6784 | tree late_attrs = NULL_TREE; | |
6785 | tree *q = &late_attrs; | |
6786 | ||
6787 | for (*p = attributes; *p; ) | |
6788 | { | |
6789 | t = *p; | |
6790 | if (ATTR_IS_DEPENDENT (t)) | |
6791 | { | |
6792 | *p = TREE_CHAIN (t); | |
6793 | TREE_CHAIN (t) = NULL_TREE; | |
ff2f1c5f JJ |
6794 | /* If the first attribute argument is an identifier, don't |
6795 | pass it through tsubst. Attributes like mode, format, | |
6796 | cleanup and several target specific attributes expect it | |
6797 | unmodified. */ | |
6798 | if (TREE_VALUE (t) | |
6799 | && TREE_CODE (TREE_VALUE (t)) == TREE_LIST | |
6800 | && TREE_VALUE (TREE_VALUE (t)) | |
6801 | && (TREE_CODE (TREE_VALUE (TREE_VALUE (t))) | |
6802 | == IDENTIFIER_NODE)) | |
6803 | { | |
6804 | tree chain | |
6805 | = tsubst_expr (TREE_CHAIN (TREE_VALUE (t)), args, complain, | |
6806 | in_decl, | |
6807 | /*integral_constant_expression_p=*/false); | |
6808 | if (chain != TREE_CHAIN (TREE_VALUE (t))) | |
6809 | TREE_VALUE (t) | |
6810 | = tree_cons (NULL_TREE, TREE_VALUE (TREE_VALUE (t)), | |
6811 | chain); | |
6812 | } | |
6813 | else | |
6814 | TREE_VALUE (t) | |
6815 | = tsubst_expr (TREE_VALUE (t), args, complain, in_decl, | |
6816 | /*integral_constant_expression_p=*/false); | |
5818c8e4 JM |
6817 | *q = t; |
6818 | q = &TREE_CHAIN (t); | |
6819 | } | |
6820 | else | |
6821 | p = &TREE_CHAIN (t); | |
6822 | } | |
4f4141ff | 6823 | |
5818c8e4 JM |
6824 | cplus_decl_attributes (decl_p, late_attrs, attr_flags); |
6825 | } | |
4f4141ff JM |
6826 | } |
6827 | ||
8d08fdba | 6828 | tree |
3a978d72 | 6829 | instantiate_class_template (tree type) |
8d08fdba | 6830 | { |
7088fca9 | 6831 | tree template, args, pattern, t, member; |
36a117a5 | 6832 | tree typedecl; |
dbbf88d1 | 6833 | tree pbinfo; |
cad7e87b | 6834 | tree base_list; |
c8094d83 | 6835 | |
5566b478 | 6836 | if (type == error_mark_node) |
8d08fdba MS |
6837 | return error_mark_node; |
6838 | ||
c8094d83 | 6839 | if (TYPE_BEING_DEFINED (type) |
ca099ac8 MM |
6840 | || COMPLETE_TYPE_P (type) |
6841 | || dependent_type_p (type)) | |
5566b478 MS |
6842 | return type; |
6843 | ||
6bdb985f | 6844 | /* Figure out which template is being instantiated. */ |
36a117a5 | 6845 | template = most_general_template (CLASSTYPE_TI_TEMPLATE (type)); |
50bc768d | 6846 | gcc_assert (TREE_CODE (template) == TEMPLATE_DECL); |
73aad9b9 | 6847 | |
4c571114 MM |
6848 | /* Determine what specialization of the original template to |
6849 | instantiate. */ | |
916b63c3 | 6850 | t = most_specialized_class (type, template); |
8fbc5ae7 | 6851 | if (t == error_mark_node) |
73aad9b9 | 6852 | { |
8fbc5ae7 MM |
6853 | TYPE_BEING_DEFINED (type) = 1; |
6854 | return error_mark_node; | |
73aad9b9 | 6855 | } |
916b63c3 MM |
6856 | else if (t) |
6857 | { | |
6858 | /* This TYPE is actually an instantiation of a partial | |
6859 | specialization. We replace the innermost set of ARGS with | |
6860 | the arguments appropriate for substitution. For example, | |
6861 | given: | |
3db45ab5 MS |
6862 | |
6863 | template <class T> struct S {}; | |
916b63c3 | 6864 | template <class T> struct S<T*> {}; |
6bdb985f | 6865 | |
916b63c3 | 6866 | and supposing that we are instantiating S<int*>, ARGS will |
3db45ab5 | 6867 | presently be {int*} -- but we need {int}. */ |
916b63c3 MM |
6868 | pattern = TREE_TYPE (t); |
6869 | args = TREE_PURPOSE (t); | |
6870 | } | |
73aad9b9 | 6871 | else |
916b63c3 MM |
6872 | { |
6873 | pattern = TREE_TYPE (template); | |
6874 | args = CLASSTYPE_TI_ARGS (type); | |
6875 | } | |
5566b478 | 6876 | |
4c571114 MM |
6877 | /* If the template we're instantiating is incomplete, then clearly |
6878 | there's nothing we can do. */ | |
d0f062fb | 6879 | if (!COMPLETE_TYPE_P (pattern)) |
f31c0a32 | 6880 | return type; |
5566b478 | 6881 | |
4c571114 MM |
6882 | /* If we've recursively instantiated too many templates, stop. */ |
6883 | if (! push_tinst_level (type)) | |
f31c0a32 | 6884 | return type; |
4c571114 MM |
6885 | |
6886 | /* Now we're really doing the instantiation. Mark the type as in | |
6887 | the process of being defined. */ | |
6888 | TYPE_BEING_DEFINED (type) = 1; | |
6889 | ||
78757caa KL |
6890 | /* We may be in the middle of deferred access check. Disable |
6891 | it now. */ | |
6892 | push_deferring_access_checks (dk_no_deferred); | |
6893 | ||
c353b8e3 | 6894 | push_to_top_level (); |
4c571114 | 6895 | |
7813d14c | 6896 | SET_CLASSTYPE_INTERFACE_UNKNOWN (type); |
8d08fdba | 6897 | |
68ea098a NS |
6898 | /* Set the input location to the template definition. This is needed |
6899 | if tsubsting causes an error. */ | |
12af7ba3 MM |
6900 | typedecl = TYPE_MAIN_DECL (type); |
6901 | input_location = DECL_SOURCE_LOCATION (typedecl); | |
6902 | in_system_header = DECL_IN_SYSTEM_HEADER (typedecl); | |
68ea098a | 6903 | |
0fcedd9c | 6904 | TYPE_HAS_USER_CONSTRUCTOR (type) = TYPE_HAS_USER_CONSTRUCTOR (pattern); |
834c6dff MM |
6905 | TYPE_HAS_NEW_OPERATOR (type) = TYPE_HAS_NEW_OPERATOR (pattern); |
6906 | TYPE_HAS_ARRAY_NEW_OPERATOR (type) = TYPE_HAS_ARRAY_NEW_OPERATOR (pattern); | |
f7da6097 | 6907 | TYPE_GETS_DELETE (type) = TYPE_GETS_DELETE (pattern); |
f7da6097 MS |
6908 | TYPE_HAS_ASSIGN_REF (type) = TYPE_HAS_ASSIGN_REF (pattern); |
6909 | TYPE_HAS_CONST_ASSIGN_REF (type) = TYPE_HAS_CONST_ASSIGN_REF (pattern); | |
f7da6097 MS |
6910 | TYPE_HAS_INIT_REF (type) = TYPE_HAS_INIT_REF (pattern); |
6911 | TYPE_HAS_CONST_INIT_REF (type) = TYPE_HAS_CONST_INIT_REF (pattern); | |
f7da6097 MS |
6912 | TYPE_HAS_DEFAULT_CONSTRUCTOR (type) = TYPE_HAS_DEFAULT_CONSTRUCTOR (pattern); |
6913 | TYPE_HAS_CONVERSION (type) = TYPE_HAS_CONVERSION (pattern); | |
f7da6097 MS |
6914 | TYPE_PACKED (type) = TYPE_PACKED (pattern); |
6915 | TYPE_ALIGN (type) = TYPE_ALIGN (pattern); | |
11cf4d18 | 6916 | TYPE_USER_ALIGN (type) = TYPE_USER_ALIGN (pattern); |
eff71ab0 | 6917 | TYPE_FOR_JAVA (type) = TYPE_FOR_JAVA (pattern); /* For libjava's JArray<T> */ |
6bdb8141 JM |
6918 | if (ANON_AGGR_TYPE_P (pattern)) |
6919 | SET_ANON_AGGR_TYPE_P (type); | |
8d039470 MS |
6920 | if (CLASSTYPE_VISIBILITY_SPECIFIED (pattern)) |
6921 | { | |
6922 | CLASSTYPE_VISIBILITY_SPECIFIED (type) = 1; | |
6923 | CLASSTYPE_VISIBILITY (type) = CLASSTYPE_VISIBILITY (pattern); | |
6924 | } | |
f7da6097 | 6925 | |
dbbf88d1 | 6926 | pbinfo = TYPE_BINFO (pattern); |
1456deaf | 6927 | |
315fb5db NS |
6928 | /* We should never instantiate a nested class before its enclosing |
6929 | class; we need to look up the nested class by name before we can | |
6930 | instantiate it, and that lookup should instantiate the enclosing | |
6931 | class. */ | |
6932 | gcc_assert (!DECL_CLASS_SCOPE_P (TYPE_MAIN_DECL (pattern)) | |
6933 | || COMPLETE_TYPE_P (TYPE_CONTEXT (type)) | |
6934 | || TYPE_BEING_DEFINED (TYPE_CONTEXT (type))); | |
1456deaf | 6935 | |
cad7e87b | 6936 | base_list = NULL_TREE; |
fa743e8c | 6937 | if (BINFO_N_BASE_BINFOS (pbinfo)) |
3fd71a52 | 6938 | { |
fa743e8c | 6939 | tree pbase_binfo; |
a2507277 | 6940 | tree context = TYPE_CONTEXT (type); |
4514aa8c | 6941 | tree pushed_scope; |
3fd71a52 | 6942 | int i; |
5566b478 | 6943 | |
a2507277 NS |
6944 | /* We must enter the scope containing the type, as that is where |
6945 | the accessibility of types named in dependent bases are | |
6946 | looked up from. */ | |
4514aa8c | 6947 | pushed_scope = push_scope (context ? context : global_namespace); |
c8094d83 | 6948 | |
3fd71a52 MM |
6949 | /* Substitute into each of the bases to determine the actual |
6950 | basetypes. */ | |
fa743e8c | 6951 | for (i = 0; BINFO_BASE_ITERATE (pbinfo, i, pbase_binfo); i++) |
3fd71a52 MM |
6952 | { |
6953 | tree base; | |
fa743e8c | 6954 | tree access = BINFO_BASE_ACCESS (pbinfo, i); |
5d80a306 DG |
6955 | tree expanded_bases = NULL_TREE; |
6956 | int idx, len = 1; | |
6957 | ||
6958 | if (PACK_EXPANSION_P (BINFO_TYPE (pbase_binfo))) | |
6959 | { | |
6960 | expanded_bases = | |
6961 | tsubst_pack_expansion (BINFO_TYPE (pbase_binfo), | |
6962 | args, tf_error, NULL_TREE); | |
6963 | if (expanded_bases == error_mark_node) | |
6964 | continue; | |
6965 | ||
6966 | len = TREE_VEC_LENGTH (expanded_bases); | |
6967 | } | |
6968 | ||
6969 | for (idx = 0; idx < len; idx++) | |
6970 | { | |
6971 | if (expanded_bases) | |
6972 | /* Extract the already-expanded base class. */ | |
6973 | base = TREE_VEC_ELT (expanded_bases, idx); | |
6974 | else | |
6975 | /* Substitute to figure out the base class. */ | |
6976 | base = tsubst (BINFO_TYPE (pbase_binfo), args, tf_error, | |
6977 | NULL_TREE); | |
6978 | ||
6979 | if (base == error_mark_node) | |
6980 | continue; | |
6981 | ||
6982 | base_list = tree_cons (access, base, base_list); | |
6983 | if (BINFO_VIRTUAL_P (pbase_binfo)) | |
6984 | TREE_TYPE (base_list) = integer_type_node; | |
6985 | } | |
3fd71a52 | 6986 | } |
dfbcd65a | 6987 | |
3fd71a52 MM |
6988 | /* The list is now in reverse order; correct that. */ |
6989 | base_list = nreverse (base_list); | |
6990 | ||
4514aa8c NS |
6991 | if (pushed_scope) |
6992 | pop_scope (pushed_scope); | |
3fd71a52 | 6993 | } |
cad7e87b NS |
6994 | /* Now call xref_basetypes to set up all the base-class |
6995 | information. */ | |
6996 | xref_basetypes (type, base_list); | |
6997 | ||
4f4141ff JM |
6998 | apply_late_template_attributes (&type, TYPE_ATTRIBUTES (pattern), |
6999 | (int) ATTR_FLAG_TYPE_IN_PLACE, | |
7000 | args, tf_error, NULL_TREE); | |
5566b478 | 7001 | |
b74a0560 MM |
7002 | /* Now that our base classes are set up, enter the scope of the |
7003 | class, so that name lookups into base classes, etc. will work | |
dc957d14 | 7004 | correctly. This is precisely analogous to what we do in |
b74a0560 | 7005 | begin_class_definition when defining an ordinary non-template |
56d0c6e3 JM |
7006 | class, except we also need to push the enclosing classes. */ |
7007 | push_nested_class (type); | |
b74a0560 | 7008 | |
7088fca9 | 7009 | /* Now members are processed in the order of declaration. */ |
8c6ab2db NS |
7010 | for (member = CLASSTYPE_DECL_LIST (pattern); |
7011 | member; member = TREE_CHAIN (member)) | |
8d08fdba | 7012 | { |
7088fca9 | 7013 | tree t = TREE_VALUE (member); |
5566b478 | 7014 | |
7088fca9 | 7015 | if (TREE_PURPOSE (member)) |
ed44da02 | 7016 | { |
7088fca9 KL |
7017 | if (TYPE_P (t)) |
7018 | { | |
5e0c54e5 | 7019 | /* Build new CLASSTYPE_NESTED_UTDS. */ |
8d08fdba | 7020 | |
7088fca9 | 7021 | tree newtag; |
883a2bff MM |
7022 | bool class_template_p; |
7023 | ||
2678bae8 VR |
7024 | class_template_p = (TREE_CODE (t) != ENUMERAL_TYPE |
7025 | && TYPE_LANG_SPECIFIC (t) | |
7026 | && CLASSTYPE_IS_TEMPLATE (t)); | |
883a2bff | 7027 | /* If the member is a class template, then -- even after |
6c745393 | 7028 | substitution -- there may be dependent types in the |
883a2bff MM |
7029 | template argument list for the class. We increment |
7030 | PROCESSING_TEMPLATE_DECL so that dependent_type_p, as | |
7031 | that function will assume that no types are dependent | |
7032 | when outside of a template. */ | |
7033 | if (class_template_p) | |
7034 | ++processing_template_decl; | |
2678bae8 | 7035 | newtag = tsubst (t, args, tf_error, NULL_TREE); |
883a2bff MM |
7036 | if (class_template_p) |
7037 | --processing_template_decl; | |
2620d095 KL |
7038 | if (newtag == error_mark_node) |
7039 | continue; | |
7040 | ||
7088fca9 KL |
7041 | if (TREE_CODE (newtag) != ENUMERAL_TYPE) |
7042 | { | |
2678bae8 VR |
7043 | tree name = TYPE_IDENTIFIER (t); |
7044 | ||
883a2bff | 7045 | if (class_template_p) |
7088fca9 KL |
7046 | /* Unfortunately, lookup_template_class sets |
7047 | CLASSTYPE_IMPLICIT_INSTANTIATION for a partial | |
3afd2e20 NS |
7048 | instantiation (i.e., for the type of a member |
7049 | template class nested within a template class.) | |
7050 | This behavior is required for | |
7051 | maybe_process_partial_specialization to work | |
7052 | correctly, but is not accurate in this case; | |
7053 | the TAG is not an instantiation of anything. | |
7054 | (The corresponding TEMPLATE_DECL is an | |
7055 | instantiation, but the TYPE is not.) */ | |
7088fca9 KL |
7056 | CLASSTYPE_USE_TEMPLATE (newtag) = 0; |
7057 | ||
7058 | /* Now, we call pushtag to put this NEWTAG into the scope of | |
7059 | TYPE. We first set up the IDENTIFIER_TYPE_VALUE to avoid | |
7060 | pushtag calling push_template_decl. We don't have to do | |
7061 | this for enums because it will already have been done in | |
7062 | tsubst_enum. */ | |
7063 | if (name) | |
7064 | SET_IDENTIFIER_TYPE_VALUE (name, newtag); | |
bd3d082e | 7065 | pushtag (name, newtag, /*tag_scope=*/ts_current); |
7088fca9 KL |
7066 | } |
7067 | } | |
c8094d83 | 7068 | else if (TREE_CODE (t) == FUNCTION_DECL |
7088fca9 KL |
7069 | || DECL_FUNCTION_TEMPLATE_P (t)) |
7070 | { | |
7071 | /* Build new TYPE_METHODS. */ | |
fecafe5e | 7072 | tree r; |
c8094d83 | 7073 | |
fecafe5e | 7074 | if (TREE_CODE (t) == TEMPLATE_DECL) |
9579624e | 7075 | ++processing_template_decl; |
fecafe5e NS |
7076 | r = tsubst (t, args, tf_error, NULL_TREE); |
7077 | if (TREE_CODE (t) == TEMPLATE_DECL) | |
9579624e | 7078 | --processing_template_decl; |
7088fca9 | 7079 | set_current_access_from_decl (r); |
7088fca9 KL |
7080 | finish_member_declaration (r); |
7081 | } | |
7082 | else | |
7083 | { | |
7084 | /* Build new TYPE_FIELDS. */ | |
55a3debe DG |
7085 | if (TREE_CODE (t) == STATIC_ASSERT) |
7086 | { | |
7087 | tree condition = | |
7088 | tsubst_expr (STATIC_ASSERT_CONDITION (t), args, | |
7089 | tf_warning_or_error, NULL_TREE, | |
7090 | /*integral_constant_expression_p=*/true); | |
7091 | finish_static_assert (condition, | |
7092 | STATIC_ASSERT_MESSAGE (t), | |
7093 | STATIC_ASSERT_SOURCE_LOCATION (t), | |
7094 | /*member_p=*/true); | |
7095 | } | |
7096 | else if (TREE_CODE (t) != CONST_DECL) | |
7088fca9 KL |
7097 | { |
7098 | tree r; | |
fa8d6e85 | 7099 | |
d479d37f NS |
7100 | /* The the file and line for this declaration, to |
7101 | assist in error message reporting. Since we | |
7102 | called push_tinst_level above, we don't need to | |
7103 | restore these. */ | |
f31686a3 | 7104 | input_location = DECL_SOURCE_LOCATION (t); |
fa8d6e85 | 7105 | |
fb5ce3c9 | 7106 | if (TREE_CODE (t) == TEMPLATE_DECL) |
9579624e | 7107 | ++processing_template_decl; |
23fca1f5 | 7108 | r = tsubst (t, args, tf_warning_or_error, NULL_TREE); |
fb5ce3c9 | 7109 | if (TREE_CODE (t) == TEMPLATE_DECL) |
9579624e | 7110 | --processing_template_decl; |
7088fca9 KL |
7111 | if (TREE_CODE (r) == VAR_DECL) |
7112 | { | |
b794e321 MM |
7113 | /* In [temp.inst]: |
7114 | ||
7115 | [t]he initialization (and any associated | |
7116 | side-effects) of a static data member does | |
7117 | not occur unless the static data member is | |
7118 | itself used in a way that requires the | |
7119 | definition of the static data member to | |
3db45ab5 | 7120 | exist. |
b794e321 MM |
7121 | |
7122 | Therefore, we do not substitute into the | |
3db45ab5 MS |
7123 | initialized for the static data member here. */ |
7124 | finish_static_data_member_decl | |
7125 | (r, | |
7126 | /*init=*/NULL_TREE, | |
d174af6c | 7127 | /*init_const_expr_p=*/false, |
3db45ab5 | 7128 | /*asmspec_tree=*/NULL_TREE, |
b794e321 | 7129 | /*flags=*/0); |
7088fca9 KL |
7130 | if (DECL_INITIALIZED_IN_CLASS_P (r)) |
7131 | check_static_variable_definition (r, TREE_TYPE (r)); | |
7132 | } | |
7133 | else if (TREE_CODE (r) == FIELD_DECL) | |
7134 | { | |
7135 | /* Determine whether R has a valid type and can be | |
7136 | completed later. If R is invalid, then it is | |
7137 | replaced by error_mark_node so that it will not be | |
7138 | added to TYPE_FIELDS. */ | |
7139 | tree rtype = TREE_TYPE (r); | |
7140 | if (can_complete_type_without_circularity (rtype)) | |
7141 | complete_type (rtype); | |
7142 | ||
7143 | if (!COMPLETE_TYPE_P (rtype)) | |
7144 | { | |
7145 | cxx_incomplete_type_error (r, rtype); | |
0cbd7506 | 7146 | r = error_mark_node; |
7088fca9 KL |
7147 | } |
7148 | } | |
5566b478 | 7149 | |
7088fca9 KL |
7150 | /* If it is a TYPE_DECL for a class-scoped ENUMERAL_TYPE, |
7151 | such a thing will already have been added to the field | |
7152 | list by tsubst_enum in finish_member_declaration in the | |
5e0c54e5 | 7153 | CLASSTYPE_NESTED_UTDS case above. */ |
7088fca9 KL |
7154 | if (!(TREE_CODE (r) == TYPE_DECL |
7155 | && TREE_CODE (TREE_TYPE (r)) == ENUMERAL_TYPE | |
43b26a01 | 7156 | && DECL_ARTIFICIAL (r))) |
7088fca9 KL |
7157 | { |
7158 | set_current_access_from_decl (r); | |
7159 | finish_member_declaration (r); | |
7160 | } | |
0cbd7506 | 7161 | } |
7088fca9 | 7162 | } |
61fc8c9e | 7163 | } |
7088fca9 KL |
7164 | else |
7165 | { | |
7166 | if (TYPE_P (t) || DECL_CLASS_TEMPLATE_P (t)) | |
7167 | { | |
7168 | /* Build new CLASSTYPE_FRIEND_CLASSES. */ | |
7169 | ||
7170 | tree friend_type = t; | |
b939a023 | 7171 | bool adjust_processing_template_decl = false; |
1aed5355 | 7172 | |
7088fca9 | 7173 | if (TREE_CODE (friend_type) == TEMPLATE_DECL) |
b939a023 | 7174 | { |
5a24482e | 7175 | /* template <class T> friend class C; */ |
b939a023 | 7176 | friend_type = tsubst_friend_class (friend_type, args); |
0cbd7506 | 7177 | adjust_processing_template_decl = true; |
b939a023 KL |
7178 | } |
7179 | else if (TREE_CODE (friend_type) == UNBOUND_CLASS_TEMPLATE) | |
7180 | { | |
5a24482e | 7181 | /* template <class T> friend class C::D; */ |
b939a023 | 7182 | friend_type = tsubst (friend_type, args, |
23fca1f5 | 7183 | tf_warning_or_error, NULL_TREE); |
b939a023 KL |
7184 | if (TREE_CODE (friend_type) == TEMPLATE_DECL) |
7185 | friend_type = TREE_TYPE (friend_type); | |
0cbd7506 | 7186 | adjust_processing_template_decl = true; |
b939a023 KL |
7187 | } |
7188 | else if (TREE_CODE (friend_type) == TYPENAME_TYPE) | |
7189 | { | |
5a24482e KL |
7190 | /* This could be either |
7191 | ||
7192 | friend class T::C; | |
7193 | ||
7194 | when dependent_type_p is false or | |
7195 | ||
7196 | template <class U> friend class T::C; | |
7197 | ||
7198 | otherwise. */ | |
b939a023 | 7199 | friend_type = tsubst (friend_type, args, |
23fca1f5 | 7200 | tf_warning_or_error, NULL_TREE); |
b939a023 KL |
7201 | /* Bump processing_template_decl for correct |
7202 | dependent_type_p calculation. */ | |
7203 | ++processing_template_decl; | |
7204 | if (dependent_type_p (friend_type)) | |
7205 | adjust_processing_template_decl = true; | |
7206 | --processing_template_decl; | |
7207 | } | |
5a24482e KL |
7208 | else if (!CLASSTYPE_USE_TEMPLATE (friend_type) |
7209 | && hidden_name_p (TYPE_NAME (friend_type))) | |
7088fca9 | 7210 | { |
5a24482e KL |
7211 | /* friend class C; |
7212 | ||
7213 | where C hasn't been declared yet. Let's lookup name | |
7214 | from namespace scope directly, bypassing any name that | |
7215 | come from dependent base class. */ | |
7088fca9 KL |
7216 | tree ns = decl_namespace_context (TYPE_MAIN_DECL (friend_type)); |
7217 | ||
7218 | /* The call to xref_tag_from_type does injection for friend | |
7219 | classes. */ | |
7220 | push_nested_namespace (ns); | |
c8094d83 MS |
7221 | friend_type = |
7222 | xref_tag_from_type (friend_type, NULL_TREE, | |
5a24482e | 7223 | /*tag_scope=*/ts_current); |
7088fca9 KL |
7224 | pop_nested_namespace (ns); |
7225 | } | |
5a24482e KL |
7226 | else if (uses_template_parms (friend_type)) |
7227 | /* friend class C<T>; */ | |
7228 | friend_type = tsubst (friend_type, args, | |
23fca1f5 | 7229 | tf_warning_or_error, NULL_TREE); |
5a24482e KL |
7230 | /* Otherwise it's |
7231 | ||
7232 | friend class C; | |
7233 | ||
7234 | where C is already declared or | |
7235 | ||
7236 | friend class C<int>; | |
7237 | ||
0cbd7506 | 7238 | We don't have to do anything in these cases. */ |
1aed5355 | 7239 | |
b939a023 | 7240 | if (adjust_processing_template_decl) |
7088fca9 KL |
7241 | /* Trick make_friend_class into realizing that the friend |
7242 | we're adding is a template, not an ordinary class. It's | |
7243 | important that we use make_friend_class since it will | |
7244 | perform some error-checking and output cross-reference | |
7245 | information. */ | |
7246 | ++processing_template_decl; | |
fc378698 | 7247 | |
b939a023 | 7248 | if (friend_type != error_mark_node) |
0cbd7506 | 7249 | make_friend_class (type, friend_type, /*complain=*/false); |
fc378698 | 7250 | |
b939a023 | 7251 | if (adjust_processing_template_decl) |
7088fca9 KL |
7252 | --processing_template_decl; |
7253 | } | |
7254 | else | |
9579624e KL |
7255 | { |
7256 | /* Build new DECL_FRIENDLIST. */ | |
7257 | tree r; | |
7258 | ||
6e432b31 KL |
7259 | /* The the file and line for this declaration, to |
7260 | assist in error message reporting. Since we | |
7261 | called push_tinst_level above, we don't need to | |
7262 | restore these. */ | |
7263 | input_location = DECL_SOURCE_LOCATION (t); | |
7264 | ||
9579624e | 7265 | if (TREE_CODE (t) == TEMPLATE_DECL) |
cad7e87b NS |
7266 | { |
7267 | ++processing_template_decl; | |
7268 | push_deferring_access_checks (dk_no_check); | |
7269 | } | |
c8094d83 | 7270 | |
9579624e | 7271 | r = tsubst_friend_function (t, args); |
9579624e | 7272 | add_friend (type, r, /*complain=*/false); |
cad7e87b NS |
7273 | if (TREE_CODE (t) == TEMPLATE_DECL) |
7274 | { | |
7275 | pop_deferring_access_checks (); | |
7276 | --processing_template_decl; | |
7277 | } | |
9579624e | 7278 | } |
7088fca9 KL |
7279 | } |
7280 | } | |
5566b478 | 7281 | |
61a127b3 MM |
7282 | /* Set the file and line number information to whatever is given for |
7283 | the class itself. This puts error messages involving generated | |
7284 | implicit functions at a predictable point, and the same point | |
7285 | that would be used for non-template classes. */ | |
f31686a3 | 7286 | input_location = DECL_SOURCE_LOCATION (typedecl); |
6de9cd9a | 7287 | |
61a127b3 | 7288 | unreverse_member_declarations (type); |
9f33663b | 7289 | finish_struct_1 (type); |
5524676d | 7290 | TYPE_BEING_DEFINED (type) = 0; |
8d08fdba | 7291 | |
9188c363 MM |
7292 | /* Now that the class is complete, instantiate default arguments for |
7293 | any member functions. We don't do this earlier because the | |
7294 | default arguments may reference members of the class. */ | |
7295 | if (!PRIMARY_TEMPLATE_P (template)) | |
7296 | for (t = TYPE_METHODS (type); t; t = TREE_CHAIN (t)) | |
c8094d83 | 7297 | if (TREE_CODE (t) == FUNCTION_DECL |
dc957d14 | 7298 | /* Implicitly generated member functions will not have template |
9188c363 MM |
7299 | information; they are not instantiations, but instead are |
7300 | created "fresh" for each instantiation. */ | |
7301 | && DECL_TEMPLATE_INFO (t)) | |
7302 | tsubst_default_arguments (t); | |
7303 | ||
56d0c6e3 | 7304 | pop_nested_class (); |
5566b478 | 7305 | pop_from_top_level (); |
78757caa | 7306 | pop_deferring_access_checks (); |
5566b478 MS |
7307 | pop_tinst_level (); |
7308 | ||
4684cd27 MM |
7309 | /* The vtable for a template class can be emitted in any translation |
7310 | unit in which the class is instantiated. When there is no key | |
7311 | method, however, finish_struct_1 will already have added TYPE to | |
7312 | the keyed_classes list. */ | |
7313 | if (TYPE_CONTAINS_VPTR_P (type) && CLASSTYPE_KEY_METHOD (type)) | |
9aad8f83 MA |
7314 | keyed_classes = tree_cons (NULL_TREE, type, keyed_classes); |
7315 | ||
5566b478 | 7316 | return type; |
8d08fdba MS |
7317 | } |
7318 | ||
00d3396f | 7319 | static tree |
a91db711 | 7320 | tsubst_template_arg (tree t, tree args, tsubst_flags_t complain, tree in_decl) |
00d3396f | 7321 | { |
a91db711 | 7322 | tree r; |
c8094d83 | 7323 | |
a91db711 NS |
7324 | if (!t) |
7325 | r = t; | |
7326 | else if (TYPE_P (t)) | |
7327 | r = tsubst (t, args, complain, in_decl); | |
7328 | else | |
00d3396f | 7329 | { |
015c2c66 MM |
7330 | r = tsubst_expr (t, args, complain, in_decl, |
7331 | /*integral_constant_expression_p=*/true); | |
6f25cb35 | 7332 | r = fold_non_dependent_expr (r); |
bd83b409 | 7333 | } |
5d80a306 DG |
7334 | return r; |
7335 | } | |
7336 | ||
7337 | /* Substitute ARGS into T, which is an pack expansion | |
7338 | (i.e. TYPE_PACK_EXPANSION or EXPR_PACK_EXPANSION). Returns a | |
7339 | TREE_VEC with the substituted arguments, a PACK_EXPANSION_* node | |
7340 | (if only a partial substitution could be performed) or | |
7341 | ERROR_MARK_NODE if there was an error. */ | |
7342 | tree | |
7343 | tsubst_pack_expansion (tree t, tree args, tsubst_flags_t complain, | |
7344 | tree in_decl) | |
7345 | { | |
7346 | tree pattern; | |
7347 | tree pack, packs = NULL_TREE, unsubstituted_packs = NULL_TREE; | |
7348 | tree first_arg_pack; int i, len = -1; | |
7349 | tree result; | |
7350 | int incomplete = 0; | |
7351 | ||
7352 | gcc_assert (PACK_EXPANSION_P (t)); | |
7353 | pattern = PACK_EXPANSION_PATTERN (t); | |
7354 | ||
7355 | /* Determine the argument packs that will instantiate the parameter | |
7356 | packs used in the expansion expression. While we're at it, | |
7357 | compute the number of arguments to be expanded and make sure it | |
7358 | is consistent. */ | |
7359 | for (pack = PACK_EXPANSION_PARAMETER_PACKS (t); pack; | |
7360 | pack = TREE_CHAIN (pack)) | |
7361 | { | |
7362 | tree parm_pack = TREE_VALUE (pack); | |
7363 | tree arg_pack = NULL_TREE; | |
7364 | tree orig_arg = NULL_TREE; | |
7365 | ||
7366 | if (TREE_CODE (parm_pack) == PARM_DECL) | |
29b0d1fd | 7367 | arg_pack = retrieve_local_specialization (parm_pack); |
5d80a306 DG |
7368 | else |
7369 | { | |
7370 | int level, idx, levels; | |
7371 | template_parm_level_and_index (parm_pack, &level, &idx); | |
7372 | ||
7373 | levels = TMPL_ARGS_DEPTH (args); | |
7374 | if (level <= levels) | |
7375 | arg_pack = TMPL_ARG (args, level, idx); | |
7376 | } | |
7377 | ||
7378 | orig_arg = arg_pack; | |
7379 | if (arg_pack && TREE_CODE (arg_pack) == ARGUMENT_PACK_SELECT) | |
7380 | arg_pack = ARGUMENT_PACK_SELECT_FROM_PACK (arg_pack); | |
7381 | ||
d393153e DG |
7382 | if (arg_pack && !ARGUMENT_PACK_P (arg_pack)) |
7383 | /* This can only happen if we forget to expand an argument | |
7384 | pack somewhere else. Just return an error, silently. */ | |
7385 | { | |
7386 | result = make_tree_vec (1); | |
7387 | TREE_VEC_ELT (result, 0) = error_mark_node; | |
7388 | return result; | |
7389 | } | |
7390 | ||
88b82314 DG |
7391 | if (arg_pack |
7392 | && TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg_pack)) == 1 | |
7393 | && PACK_EXPANSION_P (TREE_VEC_ELT (ARGUMENT_PACK_ARGS (arg_pack), 0))) | |
7394 | { | |
7395 | tree expansion = TREE_VEC_ELT (ARGUMENT_PACK_ARGS (arg_pack), 0); | |
7396 | tree pattern = PACK_EXPANSION_PATTERN (expansion); | |
7397 | if ((TYPE_P (pattern) && same_type_p (pattern, parm_pack)) | |
7398 | || (!TYPE_P (pattern) && cp_tree_equal (parm_pack, pattern))) | |
7399 | /* The argument pack that the parameter maps to is just an | |
7400 | expansion of the parameter itself, such as one would | |
7401 | find in the implicit typedef of a class inside the | |
7402 | class itself. Consider this parameter "unsubstituted", | |
7403 | so that we will maintain the outer pack expansion. */ | |
7404 | arg_pack = NULL_TREE; | |
7405 | } | |
7406 | ||
5d80a306 DG |
7407 | if (arg_pack) |
7408 | { | |
7409 | int my_len = | |
7410 | TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg_pack)); | |
7411 | ||
7412 | /* It's all-or-nothing with incomplete argument packs. */ | |
7413 | if (incomplete && !ARGUMENT_PACK_INCOMPLETE_P (arg_pack)) | |
7414 | return error_mark_node; | |
7415 | ||
7416 | if (ARGUMENT_PACK_INCOMPLETE_P (arg_pack)) | |
7417 | incomplete = 1; | |
7418 | ||
7419 | if (len < 0) | |
7420 | { | |
7421 | len = my_len; | |
7422 | first_arg_pack = arg_pack; | |
7423 | } | |
7424 | else if (len != my_len) | |
7425 | { | |
7426 | if (TREE_CODE (t) == TYPE_PACK_EXPANSION) | |
7427 | error ("mismatched argument pack lengths while expanding " | |
7428 | "%<%T%>", | |
7429 | pattern); | |
7430 | else | |
7431 | error ("mismatched argument pack lengths while expanding " | |
7432 | "%<%E%>", | |
7433 | pattern); | |
7434 | return error_mark_node; | |
7435 | } | |
7436 | ||
7437 | /* Keep track of the parameter packs and their corresponding | |
7438 | argument packs. */ | |
7439 | packs = tree_cons (parm_pack, arg_pack, packs); | |
7440 | TREE_TYPE (packs) = orig_arg; | |
7441 | } | |
7442 | else | |
7443 | /* We can't substitute for this parameter pack. */ | |
7444 | unsubstituted_packs = tree_cons (TREE_PURPOSE (pack), | |
7445 | TREE_VALUE (pack), | |
7446 | unsubstituted_packs); | |
7447 | } | |
7448 | ||
7449 | /* We cannot expand this expansion expression, because we don't have | |
7450 | all of the argument packs we need. Substitute into the pattern | |
7451 | and return a PACK_EXPANSION_*. The caller will need to deal with | |
7452 | that. */ | |
7453 | if (unsubstituted_packs) | |
7454 | return make_pack_expansion (tsubst (pattern, args, complain, | |
7455 | in_decl)); | |
7456 | ||
7457 | /* We could not find any argument packs that work. */ | |
7458 | if (len < 0) | |
7459 | return error_mark_node; | |
7460 | ||
7461 | /* For each argument in each argument pack, substitute into the | |
7462 | pattern. */ | |
7463 | result = make_tree_vec (len + incomplete); | |
7464 | for (i = 0; i < len + incomplete; ++i) | |
7465 | { | |
7466 | /* For parameter pack, change the substitution of the parameter | |
7467 | pack to the ith argument in its argument pack, then expand | |
7468 | the pattern. */ | |
7469 | for (pack = packs; pack; pack = TREE_CHAIN (pack)) | |
7470 | { | |
7471 | tree parm = TREE_PURPOSE (pack); | |
7472 | ||
7473 | if (TREE_CODE (parm) == PARM_DECL) | |
7474 | { | |
7475 | /* Select the Ith argument from the pack. */ | |
7476 | tree arg = make_node (ARGUMENT_PACK_SELECT); | |
7477 | ARGUMENT_PACK_SELECT_FROM_PACK (arg) = TREE_VALUE (pack); | |
7478 | ARGUMENT_PACK_SELECT_INDEX (arg) = i; | |
7479 | mark_used (parm); | |
7480 | register_local_specialization (arg, parm); | |
7481 | } | |
7482 | else | |
7483 | { | |
7484 | tree value = parm; | |
7485 | int idx, level; | |
7486 | template_parm_level_and_index (parm, &level, &idx); | |
7487 | ||
7488 | if (i < len) | |
7489 | { | |
7490 | /* Select the Ith argument from the pack. */ | |
7491 | value = make_node (ARGUMENT_PACK_SELECT); | |
7492 | ARGUMENT_PACK_SELECT_FROM_PACK (value) = TREE_VALUE (pack); | |
7493 | ARGUMENT_PACK_SELECT_INDEX (value) = i; | |
7494 | } | |
7495 | ||
7496 | /* Update the corresponding argument. */ | |
7497 | TMPL_ARG (args, level, idx) = value; | |
7498 | } | |
7499 | } | |
7500 | ||
7501 | /* Substitute into the PATTERN with the altered arguments. */ | |
7502 | if (TREE_CODE (t) == EXPR_PACK_EXPANSION) | |
7503 | TREE_VEC_ELT (result, i) = | |
7504 | tsubst_expr (pattern, args, complain, in_decl, | |
7505 | /*integral_constant_expression_p=*/false); | |
7506 | else | |
7507 | TREE_VEC_ELT (result, i) = tsubst (pattern, args, complain, in_decl); | |
7508 | ||
7509 | if (i == len) | |
7510 | /* When we have incomplete argument packs, the last "expanded" | |
7511 | result is itself a pack expansion, which allows us | |
7512 | to deduce more arguments. */ | |
7513 | TREE_VEC_ELT (result, i) = | |
7514 | make_pack_expansion (TREE_VEC_ELT (result, i)); | |
7515 | ||
7516 | if (TREE_VEC_ELT (result, i) == error_mark_node) | |
7517 | { | |
7518 | result = error_mark_node; | |
7519 | break; | |
7520 | } | |
7521 | } | |
7522 | ||
7523 | /* Update ARGS to restore the substitution from parameter packs to | |
7524 | their argument packs. */ | |
7525 | for (pack = packs; pack; pack = TREE_CHAIN (pack)) | |
7526 | { | |
7527 | tree parm = TREE_PURPOSE (pack); | |
7528 | ||
7529 | if (TREE_CODE (parm) == PARM_DECL) | |
7530 | register_local_specialization (TREE_TYPE (pack), parm); | |
7531 | else | |
7532 | { | |
7533 | int idx, level; | |
7534 | template_parm_level_and_index (parm, &level, &idx); | |
7535 | ||
7536 | /* Update the corresponding argument. */ | |
7537 | if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args)) | |
7538 | TREE_VEC_ELT (TREE_VEC_ELT (args, level -1 ), idx) = | |
7539 | TREE_TYPE (pack); | |
7540 | else | |
7541 | TREE_VEC_ELT (args, idx) = TREE_TYPE (pack); | |
7542 | } | |
7543 | } | |
7544 | ||
7545 | return result; | |
bd83b409 NS |
7546 | } |
7547 | ||
a91db711 | 7548 | /* Substitute ARGS into the vector or list of template arguments T. */ |
830bfa74 | 7549 | |
e9659ab0 | 7550 | static tree |
a91db711 | 7551 | tsubst_template_args (tree t, tree args, tsubst_flags_t complain, tree in_decl) |
830bfa74 | 7552 | { |
5d80a306 | 7553 | tree orig_t = t; |
bf12d54d | 7554 | int len = TREE_VEC_LENGTH (t); |
5d80a306 | 7555 | int need_new = 0, i, expanded_len_adjust = 0, out; |
67f5655f | 7556 | tree *elts = (tree *) alloca (len * sizeof (tree)); |
c8094d83 | 7557 | |
830bfa74 MM |
7558 | for (i = 0; i < len; i++) |
7559 | { | |
bf12d54d NS |
7560 | tree orig_arg = TREE_VEC_ELT (t, i); |
7561 | tree new_arg; | |
a91db711 | 7562 | |
bf12d54d NS |
7563 | if (TREE_CODE (orig_arg) == TREE_VEC) |
7564 | new_arg = tsubst_template_args (orig_arg, args, complain, in_decl); | |
5d80a306 DG |
7565 | else if (PACK_EXPANSION_P (orig_arg)) |
7566 | { | |
7567 | /* Substitute into an expansion expression. */ | |
7568 | new_arg = tsubst_pack_expansion (orig_arg, args, complain, in_decl); | |
7569 | ||
7570 | if (TREE_CODE (new_arg) == TREE_VEC) | |
7571 | /* Add to the expanded length adjustment the number of | |
7572 | expanded arguments. We subtract one from this | |
7573 | measurement, because the argument pack expression | |
7574 | itself is already counted as 1 in | |
7575 | LEN. EXPANDED_LEN_ADJUST can actually be negative, if | |
7576 | the argument pack is empty. */ | |
7577 | expanded_len_adjust += TREE_VEC_LENGTH (new_arg) - 1; | |
7578 | } | |
7579 | else if (ARGUMENT_PACK_P (orig_arg)) | |
7580 | { | |
7581 | /* Substitute into each of the arguments. */ | |
7582 | new_arg = make_node (TREE_CODE (orig_arg)); | |
7583 | ||
7584 | SET_ARGUMENT_PACK_ARGS ( | |
7585 | new_arg, | |
7586 | tsubst_template_args (ARGUMENT_PACK_ARGS (orig_arg), | |
7587 | args, complain, in_decl)); | |
7588 | ||
7589 | if (ARGUMENT_PACK_ARGS (new_arg) == error_mark_node) | |
7590 | new_arg = error_mark_node; | |
7591 | ||
7592 | if (TREE_CODE (new_arg) == NONTYPE_ARGUMENT_PACK) { | |
7593 | TREE_TYPE (new_arg) = tsubst (TREE_TYPE (orig_arg), args, | |
7594 | complain, in_decl); | |
7595 | TREE_CONSTANT (new_arg) = TREE_CONSTANT (orig_arg); | |
7596 | ||
7597 | if (TREE_TYPE (new_arg) == error_mark_node) | |
7598 | new_arg = error_mark_node; | |
7599 | } | |
7600 | } | |
830bfa74 | 7601 | else |
a91db711 | 7602 | new_arg = tsubst_template_arg (orig_arg, args, complain, in_decl); |
c8094d83 | 7603 | |
a91db711 | 7604 | if (new_arg == error_mark_node) |
08e72a19 JM |
7605 | return error_mark_node; |
7606 | ||
a91db711 NS |
7607 | elts[i] = new_arg; |
7608 | if (new_arg != orig_arg) | |
830bfa74 MM |
7609 | need_new = 1; |
7610 | } | |
c8094d83 | 7611 | |
830bfa74 MM |
7612 | if (!need_new) |
7613 | return t; | |
a91db711 | 7614 | |
5d80a306 DG |
7615 | /* Make space for the expanded arguments coming from template |
7616 | argument packs. */ | |
7617 | t = make_tree_vec (len + expanded_len_adjust); | |
7618 | for (i = 0, out = 0; i < len; i++) | |
7619 | { | |
7620 | if ((PACK_EXPANSION_P (TREE_VEC_ELT (orig_t, i)) | |
7621 | || ARGUMENT_PACK_P (TREE_VEC_ELT (orig_t, i))) | |
7622 | && TREE_CODE (elts[i]) == TREE_VEC) | |
7623 | { | |
7624 | int idx; | |
7625 | ||
7626 | /* Now expand the template argument pack "in place". */ | |
7627 | for (idx = 0; idx < TREE_VEC_LENGTH (elts[i]); idx++, out++) | |
7628 | TREE_VEC_ELT (t, out) = TREE_VEC_ELT (elts[i], idx); | |
7629 | } | |
7630 | else | |
7631 | { | |
7632 | TREE_VEC_ELT (t, out) = elts[i]; | |
7633 | out++; | |
7634 | } | |
7635 | } | |
c8094d83 | 7636 | |
830bfa74 MM |
7637 | return t; |
7638 | } | |
7639 | ||
36a117a5 MM |
7640 | /* Return the result of substituting ARGS into the template parameters |
7641 | given by PARMS. If there are m levels of ARGS and m + n levels of | |
7642 | PARMS, then the result will contain n levels of PARMS. For | |
7643 | example, if PARMS is `template <class T> template <class U> | |
7644 | template <T*, U, class V>' and ARGS is {{int}, {double}} then the | |
7645 | result will be `template <int*, double, class V>'. */ | |
7646 | ||
e9659ab0 | 7647 | static tree |
3a978d72 | 7648 | tsubst_template_parms (tree parms, tree args, tsubst_flags_t complain) |
36a117a5 | 7649 | { |
f71f87f9 MM |
7650 | tree r = NULL_TREE; |
7651 | tree* new_parms; | |
36a117a5 | 7652 | |
8ca4bf25 MM |
7653 | /* When substituting into a template, we must set |
7654 | PROCESSING_TEMPLATE_DECL as the template parameters may be | |
7655 | dependent if they are based on one-another, and the dependency | |
7656 | predicates are short-circuit outside of templates. */ | |
7657 | ++processing_template_decl; | |
7658 | ||
36a117a5 MM |
7659 | for (new_parms = &r; |
7660 | TMPL_PARMS_DEPTH (parms) > TMPL_ARGS_DEPTH (args); | |
7661 | new_parms = &(TREE_CHAIN (*new_parms)), | |
7662 | parms = TREE_CHAIN (parms)) | |
7663 | { | |
c8094d83 | 7664 | tree new_vec = |
36a117a5 MM |
7665 | make_tree_vec (TREE_VEC_LENGTH (TREE_VALUE (parms))); |
7666 | int i; | |
c8094d83 | 7667 | |
36a117a5 MM |
7668 | for (i = 0; i < TREE_VEC_LENGTH (new_vec); ++i) |
7669 | { | |
42b304f1 LM |
7670 | tree tuple; |
7671 | tree default_value; | |
7672 | tree parm_decl; | |
7673 | ||
7674 | if (parms == error_mark_node) | |
7675 | continue; | |
7676 | ||
7677 | tuple = TREE_VEC_ELT (TREE_VALUE (parms), i); | |
7678 | ||
7679 | if (tuple == error_mark_node) | |
7680 | continue; | |
7681 | ||
7682 | default_value = TREE_PURPOSE (tuple); | |
7683 | parm_decl = TREE_VALUE (tuple); | |
833aa4c4 NS |
7684 | |
7685 | parm_decl = tsubst (parm_decl, args, complain, NULL_TREE); | |
a207780f VR |
7686 | if (TREE_CODE (parm_decl) == PARM_DECL |
7687 | && invalid_nontype_parm_type_p (TREE_TYPE (parm_decl), complain)) | |
7688 | parm_decl = error_mark_node; | |
a91db711 NS |
7689 | default_value = tsubst_template_arg (default_value, args, |
7690 | complain, NULL_TREE); | |
c8094d83 | 7691 | |
a91db711 | 7692 | tuple = build_tree_list (default_value, parm_decl); |
833aa4c4 | 7693 | TREE_VEC_ELT (new_vec, i) = tuple; |
36a117a5 | 7694 | } |
c8094d83 MS |
7695 | |
7696 | *new_parms = | |
7697 | tree_cons (size_int (TMPL_PARMS_DEPTH (parms) | |
4890c2f4 | 7698 | - TMPL_ARGS_DEPTH (args)), |
36a117a5 MM |
7699 | new_vec, NULL_TREE); |
7700 | } | |
7701 | ||
8ca4bf25 MM |
7702 | --processing_template_decl; |
7703 | ||
36a117a5 MM |
7704 | return r; |
7705 | } | |
7706 | ||
ed44da02 MM |
7707 | /* Substitute the ARGS into the indicated aggregate (or enumeration) |
7708 | type T. If T is not an aggregate or enumeration type, it is | |
7709 | handled as if by tsubst. IN_DECL is as for tsubst. If | |
838dfd8a | 7710 | ENTERING_SCOPE is nonzero, T is the context for a template which |
dc957d14 | 7711 | we are presently tsubst'ing. Return the substituted value. */ |
36a117a5 | 7712 | |
e9659ab0 | 7713 | static tree |
c8094d83 | 7714 | tsubst_aggr_type (tree t, |
0cbd7506 MS |
7715 | tree args, |
7716 | tsubst_flags_t complain, | |
7717 | tree in_decl, | |
7718 | int entering_scope) | |
36a117a5 MM |
7719 | { |
7720 | if (t == NULL_TREE) | |
7721 | return NULL_TREE; | |
7722 | ||
7723 | switch (TREE_CODE (t)) | |
7724 | { | |
7725 | case RECORD_TYPE: | |
7726 | if (TYPE_PTRMEMFUNC_P (t)) | |
46c895ac | 7727 | return tsubst (TYPE_PTRMEMFUNC_FN_TYPE (t), args, complain, in_decl); |
36a117a5 | 7728 | |
f4f206f4 | 7729 | /* Else fall through. */ |
ed44da02 | 7730 | case ENUMERAL_TYPE: |
36a117a5 | 7731 | case UNION_TYPE: |
82390eb6 | 7732 | if (TYPE_TEMPLATE_INFO (t) && uses_template_parms (t)) |
36a117a5 MM |
7733 | { |
7734 | tree argvec; | |
7735 | tree context; | |
7736 | tree r; | |
3489ea0c MM |
7737 | bool saved_skip_evaluation; |
7738 | ||
7739 | /* In "sizeof(X<I>)" we need to evaluate "I". */ | |
7740 | saved_skip_evaluation = skip_evaluation; | |
7741 | skip_evaluation = false; | |
36a117a5 MM |
7742 | |
7743 | /* First, determine the context for the type we are looking | |
7744 | up. */ | |
4f7847ca NS |
7745 | context = TYPE_CONTEXT (t); |
7746 | if (context) | |
29b0d1fd JM |
7747 | { |
7748 | context = tsubst_aggr_type (context, args, complain, | |
7749 | in_decl, /*entering_scope=*/1); | |
7750 | /* If context is a nested class inside a class template, | |
7751 | it may still need to be instantiated (c++/33959). */ | |
7752 | if (TYPE_P (context)) | |
7753 | context = complete_type (context); | |
7754 | } | |
36a117a5 MM |
7755 | |
7756 | /* Then, figure out what arguments are appropriate for the | |
7757 | type we are trying to find. For example, given: | |
7758 | ||
7759 | template <class T> struct S; | |
7760 | template <class T, class U> void f(T, U) { S<U> su; } | |
7761 | ||
7762 | and supposing that we are instantiating f<int, double>, | |
7763 | then our ARGS will be {int, double}, but, when looking up | |
7764 | S we only want {double}. */ | |
a91db711 NS |
7765 | argvec = tsubst_template_args (TYPE_TI_ARGS (t), args, |
7766 | complain, in_decl); | |
08e72a19 | 7767 | if (argvec == error_mark_node) |
3489ea0c MM |
7768 | r = error_mark_node; |
7769 | else | |
7770 | { | |
7771 | r = lookup_template_class (t, argvec, in_decl, context, | |
7772 | entering_scope, complain); | |
7773 | r = cp_build_qualified_type_real (r, TYPE_QUALS (t), complain); | |
7774 | } | |
3db45ab5 | 7775 | |
3489ea0c | 7776 | skip_evaluation = saved_skip_evaluation; |
36a117a5 | 7777 | |
3489ea0c | 7778 | return r; |
36a117a5 | 7779 | } |
c8094d83 | 7780 | else |
36a117a5 MM |
7781 | /* This is not a template type, so there's nothing to do. */ |
7782 | return t; | |
7783 | ||
7784 | default: | |
4393e105 | 7785 | return tsubst (t, args, complain, in_decl); |
36a117a5 MM |
7786 | } |
7787 | } | |
7788 | ||
9188c363 MM |
7789 | /* Substitute into the default argument ARG (a default argument for |
7790 | FN), which has the indicated TYPE. */ | |
7791 | ||
7792 | tree | |
3a978d72 | 7793 | tsubst_default_argument (tree fn, tree type, tree arg) |
9188c363 | 7794 | { |
2436b51f MM |
7795 | tree saved_class_ptr = NULL_TREE; |
7796 | tree saved_class_ref = NULL_TREE; | |
7797 | ||
9188c363 MM |
7798 | /* This default argument came from a template. Instantiate the |
7799 | default argument here, not in tsubst. In the case of | |
c8094d83 MS |
7800 | something like: |
7801 | ||
9188c363 MM |
7802 | template <class T> |
7803 | struct S { | |
7804 | static T t(); | |
7805 | void f(T = t()); | |
7806 | }; | |
c8094d83 | 7807 | |
9188c363 | 7808 | we must be careful to do name lookup in the scope of S<T>, |
d5a10cf0 | 7809 | rather than in the current class. */ |
2b59fc25 | 7810 | push_access_scope (fn); |
2436b51f MM |
7811 | /* The "this" pointer is not valid in a default argument. */ |
7812 | if (cfun) | |
7813 | { | |
7814 | saved_class_ptr = current_class_ptr; | |
7815 | cp_function_chain->x_current_class_ptr = NULL_TREE; | |
7816 | saved_class_ref = current_class_ref; | |
7817 | cp_function_chain->x_current_class_ref = NULL_TREE; | |
7818 | } | |
9188c363 | 7819 | |
d5a10cf0 | 7820 | push_deferring_access_checks(dk_no_deferred); |
5a8613b2 MM |
7821 | /* The default argument expression may cause implicitly defined |
7822 | member functions to be synthesized, which will result in garbage | |
7823 | collection. We must treat this situation as if we were within | |
7824 | the body of function so as to avoid collecting live data on the | |
7825 | stack. */ | |
7826 | ++function_depth; | |
c2ea3a40 | 7827 | arg = tsubst_expr (arg, DECL_TI_ARGS (fn), |
015c2c66 MM |
7828 | tf_warning_or_error, NULL_TREE, |
7829 | /*integral_constant_expression_p=*/false); | |
5a8613b2 | 7830 | --function_depth; |
d5a10cf0 MM |
7831 | pop_deferring_access_checks(); |
7832 | ||
2436b51f MM |
7833 | /* Restore the "this" pointer. */ |
7834 | if (cfun) | |
7835 | { | |
7836 | cp_function_chain->x_current_class_ptr = saved_class_ptr; | |
7837 | cp_function_chain->x_current_class_ref = saved_class_ref; | |
7838 | } | |
7839 | ||
2b59fc25 | 7840 | pop_access_scope (fn); |
9188c363 MM |
7841 | |
7842 | /* Make sure the default argument is reasonable. */ | |
7843 | arg = check_default_argument (type, arg); | |
7844 | ||
7845 | return arg; | |
7846 | } | |
7847 | ||
7848 | /* Substitute into all the default arguments for FN. */ | |
7849 | ||
7850 | static void | |
3a978d72 | 7851 | tsubst_default_arguments (tree fn) |
9188c363 MM |
7852 | { |
7853 | tree arg; | |
7854 | tree tmpl_args; | |
7855 | ||
7856 | tmpl_args = DECL_TI_ARGS (fn); | |
7857 | ||
7858 | /* If this function is not yet instantiated, we certainly don't need | |
7859 | its default arguments. */ | |
7860 | if (uses_template_parms (tmpl_args)) | |
7861 | return; | |
7862 | ||
c8094d83 MS |
7863 | for (arg = TYPE_ARG_TYPES (TREE_TYPE (fn)); |
7864 | arg; | |
9188c363 MM |
7865 | arg = TREE_CHAIN (arg)) |
7866 | if (TREE_PURPOSE (arg)) | |
c8094d83 | 7867 | TREE_PURPOSE (arg) = tsubst_default_argument (fn, |
9188c363 MM |
7868 | TREE_VALUE (arg), |
7869 | TREE_PURPOSE (arg)); | |
7870 | } | |
7871 | ||
fc6a28d7 MM |
7872 | /* Substitute the ARGS into the T, which is a _DECL. Return the |
7873 | result of the substitution. Issue error and warning messages under | |
7874 | control of COMPLAIN. */ | |
00d3396f | 7875 | |
e9659ab0 | 7876 | static tree |
fc6a28d7 | 7877 | tsubst_decl (tree t, tree args, tsubst_flags_t complain) |
8d08fdba | 7878 | { |
82a98427 | 7879 | location_t saved_loc; |
b370501f | 7880 | tree r = NULL_TREE; |
4b2811e9 | 7881 | tree in_decl = t; |
830bfa74 | 7882 | |
ae58fa02 | 7883 | /* Set the filename and linenumber to improve error-reporting. */ |
82a98427 | 7884 | saved_loc = input_location; |
f31686a3 | 7885 | input_location = DECL_SOURCE_LOCATION (t); |
b7484fbe | 7886 | |
8d08fdba MS |
7887 | switch (TREE_CODE (t)) |
7888 | { | |
98c1c668 JM |
7889 | case TEMPLATE_DECL: |
7890 | { | |
28e42b7e KL |
7891 | /* We can get here when processing a member function template, |
7892 | member class template, and template template parameter of | |
7893 | a template class. */ | |
98c1c668 | 7894 | tree decl = DECL_TEMPLATE_RESULT (t); |
386b8a85 | 7895 | tree spec; |
28e42b7e KL |
7896 | tree tmpl_args; |
7897 | tree full_args; | |
98c1c668 | 7898 | |
28e42b7e | 7899 | if (DECL_TEMPLATE_TEMPLATE_PARM_P (t)) |
db2767b6 | 7900 | { |
28e42b7e KL |
7901 | /* Template template parameter is treated here. */ |
7902 | tree new_type = tsubst (TREE_TYPE (t), args, complain, in_decl); | |
7903 | if (new_type == error_mark_node) | |
7904 | return error_mark_node; | |
36a117a5 | 7905 | |
28e42b7e KL |
7906 | r = copy_decl (t); |
7907 | TREE_CHAIN (r) = NULL_TREE; | |
7908 | TREE_TYPE (r) = new_type; | |
7909 | DECL_TEMPLATE_RESULT (r) | |
7910 | = build_decl (TYPE_DECL, DECL_NAME (decl), new_type); | |
c8094d83 | 7911 | DECL_TEMPLATE_PARMS (r) |
28e42b7e KL |
7912 | = tsubst_template_parms (DECL_TEMPLATE_PARMS (t), args, |
7913 | complain); | |
7914 | TYPE_NAME (new_type) = r; | |
7915 | break; | |
7916 | } | |
36a117a5 | 7917 | |
28e42b7e KL |
7918 | /* We might already have an instance of this template. |
7919 | The ARGS are for the surrounding class type, so the | |
7920 | full args contain the tsubst'd args for the context, | |
7921 | plus the innermost args from the template decl. */ | |
c8094d83 | 7922 | tmpl_args = DECL_CLASS_TEMPLATE_P (t) |
28e42b7e KL |
7923 | ? CLASSTYPE_TI_ARGS (TREE_TYPE (t)) |
7924 | : DECL_TI_ARGS (DECL_TEMPLATE_RESULT (t)); | |
8ca4bf25 MM |
7925 | /* Because this is a template, the arguments will still be |
7926 | dependent, even after substitution. If | |
7927 | PROCESSING_TEMPLATE_DECL is not set, the dependency | |
7928 | predicates will short-circuit. */ | |
7929 | ++processing_template_decl; | |
28e42b7e KL |
7930 | full_args = tsubst_template_args (tmpl_args, args, |
7931 | complain, in_decl); | |
8ca4bf25 | 7932 | --processing_template_decl; |
bf2f7328 VR |
7933 | if (full_args == error_mark_node) |
7934 | return error_mark_node; | |
28e42b7e KL |
7935 | |
7936 | /* tsubst_template_args doesn't copy the vector if | |
7937 | nothing changed. But, *something* should have | |
7938 | changed. */ | |
7939 | gcc_assert (full_args != tmpl_args); | |
7940 | ||
7941 | spec = retrieve_specialization (t, full_args, | |
7942 | /*class_specializations_p=*/true); | |
7943 | if (spec != NULL_TREE) | |
7944 | { | |
7945 | r = spec; | |
7946 | break; | |
db2767b6 | 7947 | } |
98c1c668 JM |
7948 | |
7949 | /* Make a new template decl. It will be similar to the | |
c8094d83 | 7950 | original, but will record the current template arguments. |
98c1c668 JM |
7951 | We also create a new function declaration, which is just |
7952 | like the old one, but points to this new template, rather | |
7953 | than the old one. */ | |
0acf7199 | 7954 | r = copy_decl (t); |
50bc768d | 7955 | gcc_assert (DECL_LANG_SPECIFIC (r) != 0); |
ae58fa02 | 7956 | TREE_CHAIN (r) = NULL_TREE; |
db2767b6 | 7957 | |
ae58fa02 | 7958 | DECL_TEMPLATE_INFO (r) = build_tree_list (t, args); |
93cdc044 JM |
7959 | |
7960 | if (TREE_CODE (decl) == TYPE_DECL) | |
7961 | { | |
8ca4bf25 MM |
7962 | tree new_type; |
7963 | ++processing_template_decl; | |
7964 | new_type = tsubst (TREE_TYPE (t), args, complain, in_decl); | |
3db45ab5 | 7965 | --processing_template_decl; |
2620d095 KL |
7966 | if (new_type == error_mark_node) |
7967 | return error_mark_node; | |
7968 | ||
ae58fa02 MM |
7969 | TREE_TYPE (r) = new_type; |
7970 | CLASSTYPE_TI_TEMPLATE (new_type) = r; | |
17aec3eb | 7971 | DECL_TEMPLATE_RESULT (r) = TYPE_MAIN_DECL (new_type); |
ae58fa02 | 7972 | DECL_TI_ARGS (r) = CLASSTYPE_TI_ARGS (new_type); |
8ca4bf25 | 7973 | DECL_CONTEXT (r) = TYPE_CONTEXT (new_type); |
93cdc044 JM |
7974 | } |
7975 | else | |
7976 | { | |
8ca4bf25 MM |
7977 | tree new_decl; |
7978 | ++processing_template_decl; | |
7979 | new_decl = tsubst (decl, args, complain, in_decl); | |
7980 | --processing_template_decl; | |
caec1dc0 KL |
7981 | if (new_decl == error_mark_node) |
7982 | return error_mark_node; | |
17aec3eb RK |
7983 | |
7984 | DECL_TEMPLATE_RESULT (r) = new_decl; | |
ae58fa02 MM |
7985 | DECL_TI_TEMPLATE (new_decl) = r; |
7986 | TREE_TYPE (r) = TREE_TYPE (new_decl); | |
7987 | DECL_TI_ARGS (r) = DECL_TI_ARGS (new_decl); | |
3db45ab5 | 7988 | DECL_CONTEXT (r) = DECL_CONTEXT (new_decl); |
93cdc044 JM |
7989 | } |
7990 | ||
ae58fa02 MM |
7991 | SET_DECL_IMPLICIT_INSTANTIATION (r); |
7992 | DECL_TEMPLATE_INSTANTIATIONS (r) = NULL_TREE; | |
7993 | DECL_TEMPLATE_SPECIALIZATIONS (r) = NULL_TREE; | |
98c1c668 JM |
7994 | |
7995 | /* The template parameters for this new template are all the | |
7996 | template parameters for the old template, except the | |
c6002625 | 7997 | outermost level of parameters. */ |
c8094d83 | 7998 | DECL_TEMPLATE_PARMS (r) |
4393e105 | 7999 | = tsubst_template_parms (DECL_TEMPLATE_PARMS (t), args, |
c2ea3a40 | 8000 | complain); |
98c1c668 | 8001 | |
93cdc044 | 8002 | if (PRIMARY_TEMPLATE_P (t)) |
ae58fa02 | 8003 | DECL_PRIMARY_TEMPLATE (r) = r; |
93cdc044 | 8004 | |
8c6ab2db NS |
8005 | if (TREE_CODE (decl) != TYPE_DECL) |
8006 | /* Record this non-type partial instantiation. */ | |
c8094d83 | 8007 | register_specialization (r, t, |
d63d5d0c ILT |
8008 | DECL_TI_ARGS (DECL_TEMPLATE_RESULT (r)), |
8009 | false); | |
98c1c668 | 8010 | } |
ae58fa02 | 8011 | break; |
8d08fdba MS |
8012 | |
8013 | case FUNCTION_DECL: | |
8014 | { | |
386b8a85 | 8015 | tree ctx; |
87603ed0 | 8016 | tree argvec = NULL_TREE; |
cf38f48a | 8017 | tree *friends; |
36a117a5 | 8018 | tree gen_tmpl; |
fc6a28d7 | 8019 | tree type; |
5566b478 | 8020 | int member; |
d8c4447d MM |
8021 | int args_depth; |
8022 | int parms_depth; | |
5566b478 | 8023 | |
36a117a5 | 8024 | /* Nobody should be tsubst'ing into non-template functions. */ |
50bc768d | 8025 | gcc_assert (DECL_TEMPLATE_INFO (t) != NULL_TREE); |
36a117a5 MM |
8026 | |
8027 | if (TREE_CODE (DECL_TI_TEMPLATE (t)) == TEMPLATE_DECL) | |
8028 | { | |
8029 | tree spec; | |
00cf3e31 MM |
8030 | bool dependent_p; |
8031 | ||
8032 | /* If T is not dependent, just return it. We have to | |
8033 | increment PROCESSING_TEMPLATE_DECL because | |
8034 | value_dependent_expression_p assumes that nothing is | |
8035 | dependent when PROCESSING_TEMPLATE_DECL is zero. */ | |
8036 | ++processing_template_decl; | |
8037 | dependent_p = value_dependent_expression_p (t); | |
8038 | --processing_template_decl; | |
8039 | if (!dependent_p) | |
8040 | return t; | |
36a117a5 MM |
8041 | |
8042 | /* Calculate the most general template of which R is a | |
8043 | specialization, and the complete set of arguments used to | |
8044 | specialize R. */ | |
8045 | gen_tmpl = most_general_template (DECL_TI_TEMPLATE (t)); | |
c8094d83 | 8046 | argvec = tsubst_template_args (DECL_TI_ARGS |
a91db711 | 8047 | (DECL_TEMPLATE_RESULT (gen_tmpl)), |
c8094d83 | 8048 | args, complain, in_decl); |
36a117a5 MM |
8049 | |
8050 | /* Check to see if we already have this specialization. */ | |
c7222c02 MM |
8051 | spec = retrieve_specialization (gen_tmpl, argvec, |
8052 | /*class_specializations_p=*/false); | |
7ddedda4 | 8053 | |
36a117a5 | 8054 | if (spec) |
ae58fa02 MM |
8055 | { |
8056 | r = spec; | |
8057 | break; | |
8058 | } | |
d8c4447d | 8059 | |
f9a7ae04 MM |
8060 | /* We can see more levels of arguments than parameters if |
8061 | there was a specialization of a member template, like | |
8062 | this: | |
8063 | ||
0cbd7506 | 8064 | template <class T> struct S { template <class U> void f(); } |
c8094d83 | 8065 | template <> template <class U> void S<int>::f(U); |
f9a7ae04 | 8066 | |
dc957d14 | 8067 | Here, we'll be substituting into the specialization, |
f9a7ae04 MM |
8068 | because that's where we can find the code we actually |
8069 | want to generate, but we'll have enough arguments for | |
c8094d83 | 8070 | the most general template. |
f9a7ae04 MM |
8071 | |
8072 | We also deal with the peculiar case: | |
d8c4447d | 8073 | |
c8094d83 | 8074 | template <class T> struct S { |
d8c4447d MM |
8075 | template <class U> friend void f(); |
8076 | }; | |
74b846e0 | 8077 | template <class U> void f() {} |
d8c4447d MM |
8078 | template S<int>; |
8079 | template void f<double>(); | |
8080 | ||
8081 | Here, the ARGS for the instantiation of will be {int, | |
8082 | double}. But, we only need as many ARGS as there are | |
8083 | levels of template parameters in CODE_PATTERN. We are | |
8084 | careful not to get fooled into reducing the ARGS in | |
8085 | situations like: | |
8086 | ||
8087 | template <class T> struct S { template <class U> void f(U); } | |
8088 | template <class T> template <> void S<T>::f(int) {} | |
8089 | ||
8090 | which we can spot because the pattern will be a | |
8091 | specialization in this case. */ | |
8092 | args_depth = TMPL_ARGS_DEPTH (args); | |
c8094d83 MS |
8093 | parms_depth = |
8094 | TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (t))); | |
d8c4447d MM |
8095 | if (args_depth > parms_depth |
8096 | && !DECL_TEMPLATE_SPECIALIZATION (t)) | |
f9a7ae04 | 8097 | args = get_innermost_template_args (args, parms_depth); |
36a117a5 MM |
8098 | } |
8099 | else | |
8100 | { | |
8101 | /* This special case arises when we have something like this: | |
8102 | ||
0cbd7506 | 8103 | template <class T> struct S { |
c8094d83 | 8104 | friend void f<int>(int, double); |
36a117a5 MM |
8105 | }; |
8106 | ||
8107 | Here, the DECL_TI_TEMPLATE for the friend declaration | |
10b1d5e7 MM |
8108 | will be an IDENTIFIER_NODE. We are being called from |
8109 | tsubst_friend_function, and we want only to create a | |
8110 | new decl (R) with appropriate types so that we can call | |
8111 | determine_specialization. */ | |
36a117a5 MM |
8112 | gen_tmpl = NULL_TREE; |
8113 | } | |
8114 | ||
6eb3bb27 | 8115 | if (DECL_CLASS_SCOPE_P (t)) |
8d08fdba | 8116 | { |
5566b478 MS |
8117 | if (DECL_NAME (t) == constructor_name (DECL_CONTEXT (t))) |
8118 | member = 2; | |
8119 | else | |
8120 | member = 1; | |
c8094d83 | 8121 | ctx = tsubst_aggr_type (DECL_CONTEXT (t), args, |
8c6ab2db | 8122 | complain, t, /*entering_scope=*/1); |
5566b478 MS |
8123 | } |
8124 | else | |
8125 | { | |
8126 | member = 0; | |
4f1c5b7d | 8127 | ctx = DECL_CONTEXT (t); |
5566b478 | 8128 | } |
fc6a28d7 | 8129 | type = tsubst (TREE_TYPE (t), args, complain, in_decl); |
b3da7bb1 MM |
8130 | if (type == error_mark_node) |
8131 | return error_mark_node; | |
8d08fdba | 8132 | |
5566b478 | 8133 | /* We do NOT check for matching decls pushed separately at this |
0cbd7506 MS |
8134 | point, as they may not represent instantiations of this |
8135 | template, and in any case are considered separate under the | |
8136 | discrete model. */ | |
0acf7199 | 8137 | r = copy_decl (t); |
e1467ff2 | 8138 | DECL_USE_TEMPLATE (r) = 0; |
5566b478 | 8139 | TREE_TYPE (r) = type; |
92643fea MM |
8140 | /* Clear out the mangled name and RTL for the instantiation. */ |
8141 | SET_DECL_ASSEMBLER_NAME (r, NULL_TREE); | |
8142 | SET_DECL_RTL (r, NULL_RTX); | |
5bd61841 | 8143 | DECL_INITIAL (r) = NULL_TREE; |
4f1c5b7d | 8144 | DECL_CONTEXT (r) = ctx; |
5566b478 | 8145 | |
c8094d83 | 8146 | if (member && DECL_CONV_FN_P (r)) |
1f84ec23 MM |
8147 | /* Type-conversion operator. Reconstruct the name, in |
8148 | case it's the name of one of the template's parameters. */ | |
8149 | DECL_NAME (r) = mangle_conv_op_name_for_type (TREE_TYPE (type)); | |
5566b478 | 8150 | |
4393e105 | 8151 | DECL_ARGUMENTS (r) = tsubst (DECL_ARGUMENTS (t), args, |
c2ea3a40 | 8152 | complain, t); |
477f6664 | 8153 | DECL_RESULT (r) = NULL_TREE; |
711734a9 JM |
8154 | |
8155 | TREE_STATIC (r) = 0; | |
8156 | TREE_PUBLIC (r) = TREE_PUBLIC (t); | |
8157 | DECL_EXTERNAL (r) = 1; | |
4684cd27 MM |
8158 | /* If this is an instantiation of a function with internal |
8159 | linkage, we already know what object file linkage will be | |
8160 | assigned to the instantiation. */ | |
8161 | DECL_INTERFACE_KNOWN (r) = !TREE_PUBLIC (r); | |
711734a9 JM |
8162 | DECL_DEFER_OUTPUT (r) = 0; |
8163 | TREE_CHAIN (r) = NULL_TREE; | |
8164 | DECL_PENDING_INLINE_INFO (r) = 0; | |
59026e79 | 8165 | DECL_PENDING_INLINE_P (r) = 0; |
655dc6ee | 8166 | DECL_SAVED_TREE (r) = NULL_TREE; |
711734a9 | 8167 | TREE_USED (r) = 0; |
db9b2174 MM |
8168 | if (DECL_CLONED_FUNCTION (r)) |
8169 | { | |
8170 | DECL_CLONED_FUNCTION (r) = tsubst (DECL_CLONED_FUNCTION (t), | |
c2ea3a40 | 8171 | args, complain, t); |
db9b2174 MM |
8172 | TREE_CHAIN (r) = TREE_CHAIN (DECL_CLONED_FUNCTION (r)); |
8173 | TREE_CHAIN (DECL_CLONED_FUNCTION (r)) = r; | |
8174 | } | |
711734a9 | 8175 | |
92643fea MM |
8176 | /* Set up the DECL_TEMPLATE_INFO for R. There's no need to do |
8177 | this in the special friend case mentioned above where | |
8178 | GEN_TMPL is NULL. */ | |
36a117a5 | 8179 | if (gen_tmpl) |
386b8a85 | 8180 | { |
c8094d83 | 8181 | DECL_TEMPLATE_INFO (r) |
e1b3e07d | 8182 | = tree_cons (gen_tmpl, argvec, NULL_TREE); |
36a117a5 | 8183 | SET_DECL_IMPLICIT_INSTANTIATION (r); |
d63d5d0c | 8184 | register_specialization (r, gen_tmpl, argvec, false); |
36a117a5 | 8185 | |
9188c363 MM |
8186 | /* We're not supposed to instantiate default arguments |
8187 | until they are called, for a template. But, for a | |
8188 | declaration like: | |
8189 | ||
0cbd7506 MS |
8190 | template <class T> void f () |
8191 | { extern void g(int i = T()); } | |
c8094d83 | 8192 | |
9188c363 MM |
8193 | we should do the substitution when the template is |
8194 | instantiated. We handle the member function case in | |
8195 | instantiate_class_template since the default arguments | |
8196 | might refer to other members of the class. */ | |
8197 | if (!member | |
8198 | && !PRIMARY_TEMPLATE_P (gen_tmpl) | |
8199 | && !uses_template_parms (argvec)) | |
8200 | tsubst_default_arguments (r); | |
386b8a85 | 8201 | } |
c43e95f8 MM |
8202 | else |
8203 | DECL_TEMPLATE_INFO (r) = NULL_TREE; | |
f181d4ae | 8204 | |
cf38f48a MM |
8205 | /* Copy the list of befriending classes. */ |
8206 | for (friends = &DECL_BEFRIENDING_CLASSES (r); | |
8207 | *friends; | |
c8094d83 | 8208 | friends = &TREE_CHAIN (*friends)) |
cf38f48a MM |
8209 | { |
8210 | *friends = copy_node (*friends); | |
8211 | TREE_VALUE (*friends) = tsubst (TREE_VALUE (*friends), | |
c2ea3a40 | 8212 | args, complain, |
cf38f48a MM |
8213 | in_decl); |
8214 | } | |
8215 | ||
212e7048 | 8216 | if (DECL_CONSTRUCTOR_P (r) || DECL_DESTRUCTOR_P (r)) |
f181d4ae MM |
8217 | { |
8218 | maybe_retrofit_in_chrg (r); | |
212e7048 MM |
8219 | if (DECL_CONSTRUCTOR_P (r)) |
8220 | grok_ctor_properties (ctx, r); | |
2be678ff JM |
8221 | /* If this is an instantiation of a member template, clone it. |
8222 | If it isn't, that'll be handled by | |
8223 | clone_constructors_and_destructors. */ | |
5e818b93 | 8224 | if (PRIMARY_TEMPLATE_P (gen_tmpl)) |
271e6f02 | 8225 | clone_function_decl (r, /*update_method_vec_p=*/0); |
f181d4ae | 8226 | } |
398cd199 VR |
8227 | else if (IDENTIFIER_OPNAME_P (DECL_NAME (r)) |
8228 | && !grok_op_properties (r, (complain & tf_error) != 0)) | |
8229 | return error_mark_node; | |
c8b2e872 MM |
8230 | |
8231 | if (DECL_FRIEND_P (t) && DECL_FRIEND_CONTEXT (t)) | |
8232 | SET_DECL_FRIEND_CONTEXT (r, | |
8233 | tsubst (DECL_FRIEND_CONTEXT (t), | |
8234 | args, complain, in_decl)); | |
b9e75696 JM |
8235 | |
8236 | /* Possibly limit visibility based on template args. */ | |
8237 | DECL_VISIBILITY (r) = VISIBILITY_DEFAULT; | |
b70f0f48 JM |
8238 | if (DECL_VISIBILITY_SPECIFIED (t)) |
8239 | { | |
8240 | DECL_VISIBILITY_SPECIFIED (r) = 0; | |
8241 | DECL_ATTRIBUTES (r) | |
8242 | = remove_attribute ("visibility", DECL_ATTRIBUTES (r)); | |
8243 | } | |
b9e75696 | 8244 | determine_visibility (r); |
4f4141ff JM |
8245 | |
8246 | apply_late_template_attributes (&r, DECL_ATTRIBUTES (r), 0, | |
8247 | args, complain, in_decl); | |
8d08fdba | 8248 | } |
ae58fa02 | 8249 | break; |
8d08fdba MS |
8250 | |
8251 | case PARM_DECL: | |
8252 | { | |
5d80a306 DG |
8253 | tree type = NULL_TREE; |
8254 | int i, len = 1; | |
8255 | tree expanded_types = NULL_TREE; | |
8256 | tree prev_r = NULL_TREE; | |
8257 | tree first_r = NULL_TREE; | |
1b8899d1 | 8258 | |
5d80a306 DG |
8259 | if (FUNCTION_PARAMETER_PACK_P (t)) |
8260 | { | |
8261 | /* If there is a local specialization that isn't a | |
8262 | parameter pack, it means that we're doing a "simple" | |
8263 | substitution from inside tsubst_pack_expansion. Just | |
a757b5c5 | 8264 | return the local specialization (which will be a single |
5d80a306 | 8265 | parm). */ |
29b0d1fd | 8266 | tree spec = retrieve_local_specialization (t); |
5d80a306 DG |
8267 | if (spec |
8268 | && TREE_CODE (spec) == PARM_DECL | |
8269 | && TREE_CODE (TREE_TYPE (spec)) != TYPE_PACK_EXPANSION) | |
8270 | return spec; | |
8271 | ||
8272 | /* Expand the TYPE_PACK_EXPANSION that provides the types for | |
8273 | the parameters in this function parameter pack. */ | |
8274 | expanded_types = tsubst_pack_expansion (TREE_TYPE (t), args, | |
8275 | complain, in_decl); | |
8276 | if (TREE_CODE (expanded_types) == TREE_VEC) | |
8277 | { | |
8278 | len = TREE_VEC_LENGTH (expanded_types); | |
8279 | ||
8280 | /* Zero-length parameter packs are boring. Just substitute | |
8281 | into the chain. */ | |
8282 | if (len == 0) | |
8283 | return tsubst (TREE_CHAIN (t), args, complain, | |
8284 | TREE_CHAIN (t)); | |
8285 | } | |
8286 | else | |
8287 | { | |
8288 | /* All we did was update the type. Make a note of that. */ | |
8289 | type = expanded_types; | |
8290 | expanded_types = NULL_TREE; | |
8291 | } | |
8292 | } | |
db2767b6 | 8293 | |
5d80a306 DG |
8294 | /* Loop through all of the parameter's we'll build. When T is |
8295 | a function parameter pack, LEN is the number of expanded | |
8296 | types in EXPANDED_TYPES; otherwise, LEN is 1. */ | |
8297 | r = NULL_TREE; | |
8298 | for (i = 0; i < len; ++i) | |
8299 | { | |
8300 | prev_r = r; | |
8301 | r = copy_node (t); | |
8302 | if (DECL_TEMPLATE_PARM_P (t)) | |
8303 | SET_DECL_TEMPLATE_PARM_P (r); | |
8304 | ||
8305 | if (expanded_types) | |
8306 | /* We're on the Ith parameter of the function parameter | |
8307 | pack. */ | |
8308 | { | |
8309 | /* Get the Ith type. */ | |
8310 | type = TREE_VEC_ELT (expanded_types, i); | |
8311 | ||
8312 | if (DECL_NAME (r)) | |
8313 | /* Rename the parameter to include the index. */ | |
8314 | DECL_NAME (r) = | |
8315 | make_ith_pack_parameter_name (DECL_NAME (r), i); | |
8316 | } | |
8317 | else if (!type) | |
8318 | /* We're dealing with a normal parameter. */ | |
8319 | type = tsubst (TREE_TYPE (t), args, complain, in_decl); | |
8320 | ||
8321 | type = type_decays_to (type); | |
8322 | TREE_TYPE (r) = type; | |
8323 | cp_apply_type_quals_to_decl (cp_type_quals (type), r); | |
8324 | ||
8325 | if (DECL_INITIAL (r)) | |
8326 | { | |
8327 | if (TREE_CODE (DECL_INITIAL (r)) != TEMPLATE_PARM_INDEX) | |
8328 | DECL_INITIAL (r) = TREE_TYPE (r); | |
8329 | else | |
8330 | DECL_INITIAL (r) = tsubst (DECL_INITIAL (r), args, | |
8331 | complain, in_decl); | |
8332 | } | |
8333 | ||
8334 | DECL_CONTEXT (r) = NULL_TREE; | |
8335 | ||
8336 | if (!DECL_TEMPLATE_PARM_P (r)) | |
8337 | DECL_ARG_TYPE (r) = type_passed_as (type); | |
8338 | ||
4f4141ff JM |
8339 | apply_late_template_attributes (&r, DECL_ATTRIBUTES (r), 0, |
8340 | args, complain, in_decl); | |
8341 | ||
5d80a306 DG |
8342 | /* Keep track of the first new parameter we |
8343 | generate. That's what will be returned to the | |
8344 | caller. */ | |
8345 | if (!first_r) | |
8346 | first_r = r; | |
8347 | ||
8348 | /* Build a proper chain of parameters when substituting | |
8349 | into a function parameter pack. */ | |
8350 | if (prev_r) | |
8351 | TREE_CHAIN (prev_r) = r; | |
8352 | } | |
8e51619a | 8353 | |
8d08fdba | 8354 | if (TREE_CHAIN (t)) |
4393e105 | 8355 | TREE_CHAIN (r) = tsubst (TREE_CHAIN (t), args, |
c2ea3a40 | 8356 | complain, TREE_CHAIN (t)); |
5d80a306 DG |
8357 | |
8358 | /* FIRST_R contains the start of the chain we've built. */ | |
8359 | r = first_r; | |
8d08fdba | 8360 | } |
ae58fa02 | 8361 | break; |
8d08fdba | 8362 | |
5566b478 MS |
8363 | case FIELD_DECL: |
8364 | { | |
fc6a28d7 MM |
8365 | tree type; |
8366 | ||
0acf7199 | 8367 | r = copy_decl (t); |
fc6a28d7 MM |
8368 | type = tsubst (TREE_TYPE (t), args, complain, in_decl); |
8369 | if (type == error_mark_node) | |
8370 | return error_mark_node; | |
1b8899d1 | 8371 | TREE_TYPE (r) = type; |
9804209d | 8372 | cp_apply_type_quals_to_decl (cp_type_quals (type), r); |
1b8899d1 | 8373 | |
015c2c66 MM |
8374 | /* DECL_INITIAL gives the number of bits in a bit-field. */ |
8375 | DECL_INITIAL (r) | |
8376 | = tsubst_expr (DECL_INITIAL (t), args, | |
8377 | complain, in_decl, | |
8378 | /*integral_constant_expression_p=*/true); | |
1b8899d1 MM |
8379 | /* We don't have to set DECL_CONTEXT here; it is set by |
8380 | finish_member_declaration. */ | |
5566b478 | 8381 | TREE_CHAIN (r) = NULL_TREE; |
c8094d83 | 8382 | if (VOID_TYPE_P (type)) |
dee15844 | 8383 | error ("instantiation of %q+D as type %qT", r, type); |
4f4141ff JM |
8384 | |
8385 | apply_late_template_attributes (&r, DECL_ATTRIBUTES (r), 0, | |
8386 | args, complain, in_decl); | |
5566b478 | 8387 | } |
ae58fa02 | 8388 | break; |
5566b478 MS |
8389 | |
8390 | case USING_DECL: | |
98ed9dae NS |
8391 | /* We reach here only for member using decls. */ |
8392 | if (DECL_DEPENDENT_P (t)) | |
8393 | { | |
8394 | r = do_class_using_decl | |
8395 | (tsubst_copy (USING_DECL_SCOPE (t), args, complain, in_decl), | |
8396 | tsubst_copy (DECL_NAME (t), args, complain, in_decl)); | |
8397 | if (!r) | |
8398 | r = error_mark_node; | |
8399 | } | |
8400 | else | |
8401 | { | |
8402 | r = copy_node (t); | |
8403 | TREE_CHAIN (r) = NULL_TREE; | |
8404 | } | |
ae58fa02 | 8405 | break; |
5566b478 | 8406 | |
9188c363 | 8407 | case TYPE_DECL: |
5566b478 MS |
8408 | case VAR_DECL: |
8409 | { | |
1cea0434 KG |
8410 | tree argvec = NULL_TREE; |
8411 | tree gen_tmpl = NULL_TREE; | |
36a117a5 | 8412 | tree spec; |
1cea0434 | 8413 | tree tmpl = NULL_TREE; |
9188c363 | 8414 | tree ctx; |
fc6a28d7 | 8415 | tree type = NULL_TREE; |
f604fc3b | 8416 | bool local_p; |
9188c363 | 8417 | |
56d0c6e3 | 8418 | if (TREE_CODE (t) == TYPE_DECL |
a7f6bc8c | 8419 | && t == TYPE_MAIN_DECL (TREE_TYPE (t))) |
fc6a28d7 | 8420 | { |
a7f6bc8c JM |
8421 | /* If this is the canonical decl, we don't have to |
8422 | mess with instantiations, and often we can't (for | |
8423 | typename, template type parms and such). Note that | |
8424 | TYPE_NAME is not correct for the above test if | |
8425 | we've copied the type for a typedef. */ | |
fc6a28d7 | 8426 | type = tsubst (TREE_TYPE (t), args, complain, in_decl); |
c343d5a7 PC |
8427 | if (type == error_mark_node) |
8428 | return error_mark_node; | |
a7f6bc8c JM |
8429 | r = TYPE_NAME (type); |
8430 | break; | |
fc6a28d7 | 8431 | } |
c8094d83 | 8432 | |
f604fc3b MM |
8433 | /* Check to see if we already have the specialization we |
8434 | need. */ | |
8435 | spec = NULL_TREE; | |
8436 | if (DECL_CLASS_SCOPE_P (t) || DECL_NAMESPACE_SCOPE_P (t)) | |
8437 | { | |
8438 | /* T is a static data member or namespace-scope entity. | |
8439 | We have to substitute into namespace-scope variables | |
8440 | (even though such entities are never templates) because | |
8441 | of cases like: | |
8442 | ||
8443 | template <class T> void f() { extern T t; } | |
8444 | ||
8445 | where the entity referenced is not known until | |
8446 | instantiation time. */ | |
8447 | local_p = false; | |
8448 | ctx = DECL_CONTEXT (t); | |
8449 | if (DECL_CLASS_SCOPE_P (t)) | |
8450 | { | |
8451 | ctx = tsubst_aggr_type (ctx, args, | |
8452 | complain, | |
8453 | in_decl, /*entering_scope=*/1); | |
8454 | /* If CTX is unchanged, then T is in fact the | |
8455 | specialization we want. That situation occurs when | |
8456 | referencing a static data member within in its own | |
8457 | class. We can use pointer equality, rather than | |
8458 | same_type_p, because DECL_CONTEXT is always | |
8459 | canonical. */ | |
8460 | if (ctx == DECL_CONTEXT (t)) | |
8461 | spec = t; | |
8462 | } | |
5566b478 | 8463 | |
f604fc3b MM |
8464 | if (!spec) |
8465 | { | |
8466 | tmpl = DECL_TI_TEMPLATE (t); | |
8467 | gen_tmpl = most_general_template (tmpl); | |
8468 | argvec = tsubst (DECL_TI_ARGS (t), args, complain, in_decl); | |
8469 | spec = (retrieve_specialization | |
8470 | (gen_tmpl, argvec, | |
8471 | /*class_specializations_p=*/false)); | |
8472 | } | |
8473 | } | |
9188c363 | 8474 | else |
6dfbb909 | 8475 | { |
f604fc3b MM |
8476 | /* A local variable. */ |
8477 | local_p = true; | |
6dfbb909 MM |
8478 | /* Subsequent calls to pushdecl will fill this in. */ |
8479 | ctx = NULL_TREE; | |
f604fc3b | 8480 | spec = retrieve_local_specialization (t); |
6dfbb909 | 8481 | } |
f604fc3b MM |
8482 | /* If we already have the specialization we need, there is |
8483 | nothing more to do. */ | |
36a117a5 | 8484 | if (spec) |
ae58fa02 MM |
8485 | { |
8486 | r = spec; | |
8487 | break; | |
8488 | } | |
5566b478 | 8489 | |
f604fc3b | 8490 | /* Create a new node for the specialization we need. */ |
0acf7199 | 8491 | r = copy_decl (t); |
56d0c6e3 JM |
8492 | if (type == NULL_TREE) |
8493 | type = tsubst (TREE_TYPE (t), args, complain, in_decl); | |
edebf865 | 8494 | if (TREE_CODE (r) == VAR_DECL) |
39703eb9 | 8495 | { |
8b0a8500 MM |
8496 | /* Even if the original location is out of scope, the |
8497 | newly substituted one is not. */ | |
8498 | DECL_DEAD_FOR_LOCAL (r) = 0; | |
8499 | DECL_INITIALIZED_P (r) = 0; | |
8500 | DECL_TEMPLATE_INSTANTIATED (r) = 0; | |
fc6a28d7 MM |
8501 | if (type == error_mark_node) |
8502 | return error_mark_node; | |
2c05d05e MM |
8503 | if (TREE_CODE (type) == FUNCTION_TYPE) |
8504 | { | |
8505 | /* It may seem that this case cannot occur, since: | |
8506 | ||
8507 | typedef void f(); | |
8508 | void g() { f x; } | |
8509 | ||
8510 | declares a function, not a variable. However: | |
8511 | ||
8512 | typedef void f(); | |
8513 | template <typename T> void g() { T t; } | |
8514 | template void g<f>(); | |
8515 | ||
8516 | is an attempt to declare a variable with function | |
8517 | type. */ | |
8518 | error ("variable %qD has function type", | |
8519 | /* R is not yet sufficiently initialized, so we | |
8520 | just use its name. */ | |
8521 | DECL_NAME (r)); | |
8522 | return error_mark_node; | |
8523 | } | |
39703eb9 MM |
8524 | type = complete_type (type); |
8525 | DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (r) | |
8526 | = DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (t); | |
62e19030 | 8527 | type = check_var_type (DECL_NAME (r), type); |
56b4ea3d RH |
8528 | |
8529 | if (DECL_HAS_VALUE_EXPR_P (t)) | |
8530 | { | |
8531 | tree ve = DECL_VALUE_EXPR (t); | |
015c2c66 MM |
8532 | ve = tsubst_expr (ve, args, complain, in_decl, |
8533 | /*constant_expression_p=*/false); | |
3db45ab5 | 8534 | SET_DECL_VALUE_EXPR (r, ve); |
56b4ea3d | 8535 | } |
39703eb9 | 8536 | } |
a3d87771 MM |
8537 | else if (DECL_SELF_REFERENCE_P (t)) |
8538 | SET_DECL_SELF_REFERENCE_P (r); | |
01f4137f | 8539 | TREE_TYPE (r) = type; |
9804209d | 8540 | cp_apply_type_quals_to_decl (cp_type_quals (type), r); |
5566b478 | 8541 | DECL_CONTEXT (r) = ctx; |
92643fea MM |
8542 | /* Clear out the mangled name and RTL for the instantiation. */ |
8543 | SET_DECL_ASSEMBLER_NAME (r, NULL_TREE); | |
820cc88f DB |
8544 | if (CODE_CONTAINS_STRUCT (TREE_CODE (t), TS_DECL_WRTL)) |
8545 | SET_DECL_RTL (r, NULL_RTX); | |
8b0a8500 MM |
8546 | /* The initializer must not be expanded until it is required; |
8547 | see [temp.inst]. */ | |
d11ad92e | 8548 | DECL_INITIAL (r) = NULL_TREE; |
820cc88f DB |
8549 | if (CODE_CONTAINS_STRUCT (TREE_CODE (t), TS_DECL_WRTL)) |
8550 | SET_DECL_RTL (r, NULL_RTX); | |
06ceef4e | 8551 | DECL_SIZE (r) = DECL_SIZE_UNIT (r) = 0; |
b9e75696 JM |
8552 | if (TREE_CODE (r) == VAR_DECL) |
8553 | { | |
8554 | /* Possibly limit visibility based on template args. */ | |
8555 | DECL_VISIBILITY (r) = VISIBILITY_DEFAULT; | |
b70f0f48 JM |
8556 | if (DECL_VISIBILITY_SPECIFIED (t)) |
8557 | { | |
8558 | DECL_VISIBILITY_SPECIFIED (r) = 0; | |
8559 | DECL_ATTRIBUTES (r) | |
8560 | = remove_attribute ("visibility", DECL_ATTRIBUTES (r)); | |
8561 | } | |
b9e75696 JM |
8562 | determine_visibility (r); |
8563 | } | |
5044ab0e JM |
8564 | /* Preserve a typedef that names a type. */ |
8565 | else if (TREE_CODE (r) == TYPE_DECL | |
8566 | && DECL_ORIGINAL_TYPE (t) | |
8567 | && type != error_mark_node) | |
8568 | { | |
8569 | DECL_ORIGINAL_TYPE (r) = tsubst (DECL_ORIGINAL_TYPE (t), | |
8570 | args, complain, in_decl); | |
8571 | TREE_TYPE (r) = type = build_variant_type_copy (type); | |
8572 | TYPE_NAME (type) = r; | |
8573 | } | |
5566b478 | 8574 | |
6dfbb909 MM |
8575 | if (!local_p) |
8576 | { | |
8577 | /* A static data member declaration is always marked | |
8578 | external when it is declared in-class, even if an | |
8579 | initializer is present. We mimic the non-template | |
8580 | processing here. */ | |
8581 | DECL_EXTERNAL (r) = 1; | |
fa8d6e85 | 8582 | |
d63d5d0c | 8583 | register_specialization (r, gen_tmpl, argvec, false); |
6dfbb909 MM |
8584 | DECL_TEMPLATE_INFO (r) = tree_cons (tmpl, argvec, NULL_TREE); |
8585 | SET_DECL_IMPLICIT_INSTANTIATION (r); | |
8586 | } | |
9188c363 | 8587 | else |
6dfbb909 | 8588 | register_local_specialization (r, t); |
5566b478 | 8589 | |
5566b478 | 8590 | TREE_CHAIN (r) = NULL_TREE; |
4f4141ff | 8591 | |
5044ab0e JM |
8592 | apply_late_template_attributes (&r, DECL_ATTRIBUTES (r), |
8593 | (int) ATTR_FLAG_TYPE_IN_PLACE, | |
4f4141ff | 8594 | args, complain, in_decl); |
edebf865 | 8595 | layout_decl (r, 0); |
5566b478 | 8596 | } |
ae58fa02 | 8597 | break; |
5566b478 | 8598 | |
ae58fa02 | 8599 | default: |
315fb5db | 8600 | gcc_unreachable (); |
c8094d83 | 8601 | } |
ae58fa02 MM |
8602 | |
8603 | /* Restore the file and line information. */ | |
82a98427 | 8604 | input_location = saved_loc; |
ae58fa02 MM |
8605 | |
8606 | return r; | |
8607 | } | |
8608 | ||
34cd5ae7 | 8609 | /* Substitute into the ARG_TYPES of a function type. */ |
cabc336a | 8610 | |
e9659ab0 | 8611 | static tree |
c8094d83 | 8612 | tsubst_arg_types (tree arg_types, |
0cbd7506 MS |
8613 | tree args, |
8614 | tsubst_flags_t complain, | |
8615 | tree in_decl) | |
cabc336a MM |
8616 | { |
8617 | tree remaining_arg_types; | |
5d80a306 DG |
8618 | tree type = NULL_TREE; |
8619 | int i = 1; | |
8620 | tree expanded_args = NULL_TREE; | |
5e97d404 | 8621 | tree default_arg; |
cabc336a MM |
8622 | |
8623 | if (!arg_types || arg_types == void_list_node) | |
8624 | return arg_types; | |
c8094d83 | 8625 | |
cabc336a | 8626 | remaining_arg_types = tsubst_arg_types (TREE_CHAIN (arg_types), |
4393e105 MM |
8627 | args, complain, in_decl); |
8628 | if (remaining_arg_types == error_mark_node) | |
8629 | return error_mark_node; | |
8630 | ||
5d80a306 | 8631 | if (PACK_EXPANSION_P (TREE_VALUE (arg_types))) |
4b2811e9 | 8632 | { |
5d80a306 DG |
8633 | /* For a pack expansion, perform substitution on the |
8634 | entire expression. Later on, we'll handle the arguments | |
8635 | one-by-one. */ | |
8636 | expanded_args = tsubst_pack_expansion (TREE_VALUE (arg_types), | |
8637 | args, complain, in_decl); | |
cabc336a | 8638 | |
5d80a306 DG |
8639 | if (TREE_CODE (expanded_args) == TREE_VEC) |
8640 | /* So that we'll spin through the parameters, one by one. */ | |
8641 | i = TREE_VEC_LENGTH (expanded_args); | |
8642 | else | |
8643 | { | |
8644 | /* We only partially substituted into the parameter | |
8645 | pack. Our type is TYPE_PACK_EXPANSION. */ | |
8646 | type = expanded_args; | |
8647 | expanded_args = NULL_TREE; | |
8648 | } | |
8649 | } | |
cabc336a | 8650 | |
5d80a306 DG |
8651 | while (i > 0) { |
8652 | --i; | |
8653 | ||
8654 | if (expanded_args) | |
8655 | type = TREE_VEC_ELT (expanded_args, i); | |
8656 | else if (!type) | |
8657 | type = tsubst (TREE_VALUE (arg_types), args, complain, in_decl); | |
c8094d83 | 8658 | |
5d80a306 DG |
8659 | if (type == error_mark_node) |
8660 | return error_mark_node; | |
8661 | if (VOID_TYPE_P (type)) | |
8662 | { | |
8663 | if (complain & tf_error) | |
8664 | { | |
8665 | error ("invalid parameter type %qT", type); | |
8666 | if (in_decl) | |
8667 | error ("in declaration %q+D", in_decl); | |
8668 | } | |
8669 | return error_mark_node; | |
5e97d404 | 8670 | } |
5d80a306 DG |
8671 | |
8672 | /* Do array-to-pointer, function-to-pointer conversion, and ignore | |
8673 | top-level qualifiers as required. */ | |
8674 | type = TYPE_MAIN_VARIANT (type_decays_to (type)); | |
c8094d83 | 8675 | |
5d80a306 DG |
8676 | /* We do not substitute into default arguments here. The standard |
8677 | mandates that they be instantiated only when needed, which is | |
8678 | done in build_over_call. */ | |
8679 | default_arg = TREE_PURPOSE (arg_types); | |
8680 | ||
8681 | if (default_arg && TREE_CODE (default_arg) == DEFAULT_ARG) | |
8682 | { | |
8683 | /* We've instantiated a template before its default arguments | |
8684 | have been parsed. This can happen for a nested template | |
8685 | class, and is not an error unless we require the default | |
8686 | argument in a call of this function. */ | |
8687 | remaining_arg_types = | |
8688 | tree_cons (default_arg, type, remaining_arg_types); | |
8689 | VEC_safe_push (tree, gc, DEFARG_INSTANTIATIONS (default_arg), | |
8690 | remaining_arg_types); | |
8691 | } | |
8692 | else | |
8693 | remaining_arg_types = | |
8694 | hash_tree_cons (default_arg, type, remaining_arg_types); | |
8695 | } | |
8696 | ||
8697 | return remaining_arg_types; | |
cabc336a MM |
8698 | } |
8699 | ||
4393e105 MM |
8700 | /* Substitute into a FUNCTION_TYPE or METHOD_TYPE. This routine does |
8701 | *not* handle the exception-specification for FNTYPE, because the | |
8702 | initial substitution of explicitly provided template parameters | |
8703 | during argument deduction forbids substitution into the | |
8704 | exception-specification: | |
8705 | ||
8706 | [temp.deduct] | |
8707 | ||
8708 | All references in the function type of the function template to the | |
8709 | corresponding template parameters are replaced by the specified tem- | |
8710 | plate argument values. If a substitution in a template parameter or | |
8711 | in the function type of the function template results in an invalid | |
8712 | type, type deduction fails. [Note: The equivalent substitution in | |
8713 | exception specifications is done only when the function is instanti- | |
8714 | ated, at which point a program is ill-formed if the substitution | |
8715 | results in an invalid type.] */ | |
8716 | ||
8717 | static tree | |
c8094d83 | 8718 | tsubst_function_type (tree t, |
0cbd7506 MS |
8719 | tree args, |
8720 | tsubst_flags_t complain, | |
8721 | tree in_decl) | |
4393e105 MM |
8722 | { |
8723 | tree return_type; | |
8724 | tree arg_types; | |
8725 | tree fntype; | |
8726 | ||
8dd3f57a | 8727 | /* The TYPE_CONTEXT is not used for function/method types. */ |
50bc768d | 8728 | gcc_assert (TYPE_CONTEXT (t) == NULL_TREE); |
4393e105 | 8729 | |
46c895ac | 8730 | /* Substitute the return type. */ |
4393e105 MM |
8731 | return_type = tsubst (TREE_TYPE (t), args, complain, in_decl); |
8732 | if (return_type == error_mark_node) | |
8733 | return error_mark_node; | |
6e2993bf MM |
8734 | /* The standard does not presently indicate that creation of a |
8735 | function type with an invalid return type is a deduction failure. | |
270af55d | 8736 | However, that is clearly analogous to creating an array of "void" |
c8094d83 | 8737 | or a reference to a reference. This is core issue #486. */ |
6e2993bf MM |
8738 | if (TREE_CODE (return_type) == ARRAY_TYPE |
8739 | || TREE_CODE (return_type) == FUNCTION_TYPE) | |
8740 | { | |
8741 | if (complain & tf_error) | |
8742 | { | |
8743 | if (TREE_CODE (return_type) == ARRAY_TYPE) | |
8744 | error ("function returning an array"); | |
8745 | else | |
8746 | error ("function returning a function"); | |
8747 | } | |
8748 | return error_mark_node; | |
8749 | } | |
4393e105 | 8750 | |
34cd5ae7 | 8751 | /* Substitute the argument types. */ |
4393e105 | 8752 | arg_types = tsubst_arg_types (TYPE_ARG_TYPES (t), args, |
c8094d83 | 8753 | complain, in_decl); |
4393e105 MM |
8754 | if (arg_types == error_mark_node) |
8755 | return error_mark_node; | |
c8094d83 | 8756 | |
1891dec4 DM |
8757 | if (TYPE_QUALS (return_type) != TYPE_UNQUALIFIED |
8758 | && in_decl != NULL_TREE | |
8759 | && !TREE_NO_WARNING (in_decl) | |
8760 | && (SCALAR_TYPE_P (return_type) || VOID_TYPE_P (return_type))) | |
5db2e9ca | 8761 | warning (OPT_Wignored_qualifiers, |
1891dec4 DM |
8762 | "type qualifiers ignored on function return type"); |
8763 | ||
4393e105 MM |
8764 | /* Construct a new type node and return it. */ |
8765 | if (TREE_CODE (t) == FUNCTION_TYPE) | |
8766 | fntype = build_function_type (return_type, arg_types); | |
8767 | else | |
8768 | { | |
8769 | tree r = TREE_TYPE (TREE_VALUE (arg_types)); | |
9e1e64ec | 8770 | if (! MAYBE_CLASS_TYPE_P (r)) |
4393e105 MM |
8771 | { |
8772 | /* [temp.deduct] | |
c8094d83 | 8773 | |
4393e105 MM |
8774 | Type deduction may fail for any of the following |
8775 | reasons: | |
c8094d83 | 8776 | |
4393e105 MM |
8777 | -- Attempting to create "pointer to member of T" when T |
8778 | is not a class type. */ | |
c2ea3a40 | 8779 | if (complain & tf_error) |
0f51ccfc | 8780 | error ("creating pointer to member function of non-class type %qT", |
4393e105 MM |
8781 | r); |
8782 | return error_mark_node; | |
8783 | } | |
c8094d83 MS |
8784 | |
8785 | fntype = build_method_type_directly (r, return_type, | |
43dc123f | 8786 | TREE_CHAIN (arg_types)); |
4393e105 | 8787 | } |
c2ea3a40 | 8788 | fntype = cp_build_qualified_type_real (fntype, TYPE_QUALS (t), complain); |
e9525111 | 8789 | fntype = cp_build_type_attribute_variant (fntype, TYPE_ATTRIBUTES (t)); |
c8094d83 MS |
8790 | |
8791 | return fntype; | |
4393e105 MM |
8792 | } |
8793 | ||
c7222c02 MM |
8794 | /* FNTYPE is a FUNCTION_TYPE or METHOD_TYPE. Substitute the template |
8795 | ARGS into that specification, and return the substituted | |
8796 | specification. If there is no specification, return NULL_TREE. */ | |
8797 | ||
8798 | static tree | |
c8094d83 MS |
8799 | tsubst_exception_specification (tree fntype, |
8800 | tree args, | |
c7222c02 MM |
8801 | tsubst_flags_t complain, |
8802 | tree in_decl) | |
8803 | { | |
8804 | tree specs; | |
8805 | tree new_specs; | |
8806 | ||
8807 | specs = TYPE_RAISES_EXCEPTIONS (fntype); | |
8808 | new_specs = NULL_TREE; | |
8809 | if (specs) | |
8810 | { | |
8811 | if (! TREE_VALUE (specs)) | |
8812 | new_specs = specs; | |
8813 | else | |
8814 | while (specs) | |
8815 | { | |
8816 | tree spec; | |
5d80a306 DG |
8817 | int i, len = 1; |
8818 | tree expanded_specs = NULL_TREE; | |
8819 | ||
8820 | if (PACK_EXPANSION_P (TREE_VALUE (specs))) | |
8821 | { | |
8822 | /* Expand the pack expansion type. */ | |
8823 | expanded_specs = tsubst_pack_expansion (TREE_VALUE (specs), | |
8824 | args, complain, | |
8825 | in_decl); | |
2f93f02c DG |
8826 | |
8827 | if (expanded_specs == error_mark_node) | |
8828 | return error_mark_node; | |
8829 | else if (TREE_CODE (expanded_specs) == TREE_VEC) | |
8830 | len = TREE_VEC_LENGTH (expanded_specs); | |
8831 | else | |
8832 | { | |
8833 | /* We're substituting into a member template, so | |
8834 | we got a TYPE_PACK_EXPANSION back. Add that | |
8835 | expansion and move on. */ | |
8836 | gcc_assert (TREE_CODE (expanded_specs) | |
8837 | == TYPE_PACK_EXPANSION); | |
8838 | new_specs = add_exception_specifier (new_specs, | |
8839 | expanded_specs, | |
8840 | complain); | |
8841 | specs = TREE_CHAIN (specs); | |
8842 | continue; | |
8843 | } | |
5d80a306 DG |
8844 | } |
8845 | ||
8846 | for (i = 0; i < len; ++i) | |
8847 | { | |
8848 | if (expanded_specs) | |
8849 | spec = TREE_VEC_ELT (expanded_specs, i); | |
8850 | else | |
8851 | spec = tsubst (TREE_VALUE (specs), args, complain, in_decl); | |
8852 | if (spec == error_mark_node) | |
8853 | return spec; | |
8854 | new_specs = add_exception_specifier (new_specs, spec, | |
8855 | complain); | |
8856 | } | |
8857 | ||
8858 | specs = TREE_CHAIN (specs); | |
c7222c02 MM |
8859 | } |
8860 | } | |
8861 | return new_specs; | |
8862 | } | |
8863 | ||
4393e105 MM |
8864 | /* Take the tree structure T and replace template parameters used |
8865 | therein with the argument vector ARGS. IN_DECL is an associated | |
8866 | decl for diagnostics. If an error occurs, returns ERROR_MARK_NODE. | |
c2ea3a40 NS |
8867 | Issue error and warning messages under control of COMPLAIN. Note |
8868 | that we must be relatively non-tolerant of extensions here, in | |
8869 | order to preserve conformance; if we allow substitutions that | |
8870 | should not be allowed, we may allow argument deductions that should | |
8871 | not succeed, and therefore report ambiguous overload situations | |
8872 | where there are none. In theory, we could allow the substitution, | |
8873 | but indicate that it should have failed, and allow our caller to | |
8874 | make sure that the right thing happens, but we don't try to do this | |
8875 | yet. | |
4393e105 MM |
8876 | |
8877 | This function is used for dealing with types, decls and the like; | |
8878 | for expressions, use tsubst_expr or tsubst_copy. */ | |
ae58fa02 | 8879 | |
14d22dd6 | 8880 | static tree |
3a978d72 | 8881 | tsubst (tree t, tree args, tsubst_flags_t complain, tree in_decl) |
ae58fa02 | 8882 | { |
0ecfe0b4 | 8883 | tree type, r; |
ae58fa02 MM |
8884 | |
8885 | if (t == NULL_TREE || t == error_mark_node | |
8886 | || t == integer_type_node | |
8887 | || t == void_type_node | |
8888 | || t == char_type_node | |
539599c1 | 8889 | || t == unknown_type_node |
ae58fa02 MM |
8890 | || TREE_CODE (t) == NAMESPACE_DECL) |
8891 | return t; | |
8892 | ||
fc6a28d7 MM |
8893 | if (DECL_P (t)) |
8894 | return tsubst_decl (t, args, complain); | |
8895 | ||
ae58fa02 MM |
8896 | if (TREE_CODE (t) == IDENTIFIER_NODE) |
8897 | type = IDENTIFIER_TYPE_VALUE (t); | |
8898 | else | |
8899 | type = TREE_TYPE (t); | |
399dedb9 | 8900 | |
50bc768d | 8901 | gcc_assert (type != unknown_type_node); |
ae58fa02 | 8902 | |
56d0c6e3 | 8903 | /* Reuse typedefs. We need to do this to handle dependent attributes, |
a7f6bc8c | 8904 | such as attribute aligned. */ |
5044ab0e JM |
8905 | if (TYPE_P (t) |
8906 | && TYPE_NAME (t) | |
a7f6bc8c | 8907 | && TYPE_NAME (t) != TYPE_MAIN_DECL (t)) |
5044ab0e JM |
8908 | { |
8909 | tree decl = TYPE_NAME (t); | |
56d0c6e3 | 8910 | |
a7f6bc8c | 8911 | if (DECL_CLASS_SCOPE_P (decl) |
02e52ae5 JM |
8912 | && CLASSTYPE_TEMPLATE_INFO (DECL_CONTEXT (decl)) |
8913 | && uses_template_parms (DECL_CONTEXT (decl))) | |
56d0c6e3 JM |
8914 | { |
8915 | tree tmpl = most_general_template (DECL_TI_TEMPLATE (decl)); | |
8916 | tree gen_args = tsubst (DECL_TI_ARGS (decl), args, complain, in_decl); | |
8917 | r = retrieve_specialization (tmpl, gen_args, false); | |
8918 | } | |
29b0d1fd | 8919 | else if (DECL_FUNCTION_SCOPE_P (decl) |
02e52ae5 JM |
8920 | && DECL_TEMPLATE_INFO (DECL_CONTEXT (decl)) |
8921 | && uses_template_parms (DECL_TI_ARGS (DECL_CONTEXT (decl)))) | |
56d0c6e3 JM |
8922 | r = retrieve_local_specialization (decl); |
8923 | else | |
29b0d1fd JM |
8924 | /* The typedef is from a non-template context. */ |
8925 | return t; | |
8926 | ||
56d0c6e3 JM |
8927 | if (r) |
8928 | { | |
8929 | r = TREE_TYPE (r); | |
8930 | r = cp_build_qualified_type_real | |
8931 | (r, cp_type_quals (t) | cp_type_quals (r), | |
8932 | complain | tf_ignore_bad_quals); | |
8933 | return r; | |
8934 | } | |
8935 | /* Else we must be instantiating the typedef, so fall through. */ | |
5044ab0e JM |
8936 | } |
8937 | ||
fc6a28d7 | 8938 | if (type |
ae58fa02 | 8939 | && TREE_CODE (t) != TYPENAME_TYPE |
4393e105 MM |
8940 | && TREE_CODE (t) != IDENTIFIER_NODE |
8941 | && TREE_CODE (t) != FUNCTION_TYPE | |
8942 | && TREE_CODE (t) != METHOD_TYPE) | |
8943 | type = tsubst (type, args, complain, in_decl); | |
8944 | if (type == error_mark_node) | |
8945 | return error_mark_node; | |
ae58fa02 | 8946 | |
ae58fa02 MM |
8947 | switch (TREE_CODE (t)) |
8948 | { | |
8949 | case RECORD_TYPE: | |
8950 | case UNION_TYPE: | |
8951 | case ENUMERAL_TYPE: | |
4393e105 MM |
8952 | return tsubst_aggr_type (t, args, complain, in_decl, |
8953 | /*entering_scope=*/0); | |
ae58fa02 MM |
8954 | |
8955 | case ERROR_MARK: | |
8956 | case IDENTIFIER_NODE: | |
ae58fa02 MM |
8957 | case VOID_TYPE: |
8958 | case REAL_TYPE: | |
8959 | case COMPLEX_TYPE: | |
c00996a3 | 8960 | case VECTOR_TYPE: |
ae58fa02 MM |
8961 | case BOOLEAN_TYPE: |
8962 | case INTEGER_CST: | |
8963 | case REAL_CST: | |
8964 | case STRING_CST: | |
8965 | return t; | |
8966 | ||
8967 | case INTEGER_TYPE: | |
8968 | if (t == integer_type_node) | |
8969 | return t; | |
8970 | ||
8971 | if (TREE_CODE (TYPE_MIN_VALUE (t)) == INTEGER_CST | |
8972 | && TREE_CODE (TYPE_MAX_VALUE (t)) == INTEGER_CST) | |
8973 | return t; | |
d2e5ee5c | 8974 | |
5566b478 | 8975 | { |
ddce3528 | 8976 | tree max, omax = TREE_OPERAND (TYPE_MAX_VALUE (t), 0); |
7ddedda4 | 8977 | |
6ee3ffe8 MM |
8978 | max = tsubst_expr (omax, args, complain, in_decl, |
8979 | /*integral_constant_expression_p=*/false); | |
4ef69b83 | 8980 | max = fold_decl_constant_value (max); |
8dd3f57a | 8981 | |
6a279e92 JJ |
8982 | if (TREE_CODE (max) != INTEGER_CST |
8983 | && !at_function_scope_p () | |
8984 | && !value_dependent_expression_p (max)) | |
eff3a276 MM |
8985 | { |
8986 | if (complain & tf_error) | |
8987 | error ("array bound is not an integer constant"); | |
8988 | return error_mark_node; | |
8989 | } | |
8990 | ||
95cd6f6f | 8991 | /* [temp.deduct] |
4393e105 | 8992 | |
95cd6f6f JC |
8993 | Type deduction may fail for any of the following |
8994 | reasons: | |
4393e105 | 8995 | |
95cd6f6f JC |
8996 | Attempting to create an array with a size that is |
8997 | zero or negative. */ | |
8998 | if (integer_zerop (max) && !(complain & tf_error)) | |
8999 | /* We must fail if performing argument deduction (as | |
9000 | indicated by the state of complain), so that | |
9001 | another substitution can be found. */ | |
9002 | return error_mark_node; | |
95cd6f6f JC |
9003 | else if (TREE_CODE (max) == INTEGER_CST |
9004 | && INT_CST_LT (max, integer_zero_node)) | |
9005 | { | |
c2ea3a40 | 9006 | if (complain & tf_error) |
95cd6f6f | 9007 | error ("creating array with negative size (%qE)", max); |
4393e105 MM |
9008 | |
9009 | return error_mark_node; | |
0ecfe0b4 JM |
9010 | } |
9011 | ||
c95cd22e | 9012 | return compute_array_index_type (NULL_TREE, max); |
ae58fa02 MM |
9013 | } |
9014 | ||
9015 | case TEMPLATE_TYPE_PARM: | |
9016 | case TEMPLATE_TEMPLATE_PARM: | |
a1281f45 | 9017 | case BOUND_TEMPLATE_TEMPLATE_PARM: |
ae58fa02 MM |
9018 | case TEMPLATE_PARM_INDEX: |
9019 | { | |
9020 | int idx; | |
9021 | int level; | |
9022 | int levels; | |
315fb5db | 9023 | tree arg = NULL_TREE; |
0ecfe0b4 JM |
9024 | |
9025 | r = NULL_TREE; | |
ae58fa02 | 9026 | |
315fb5db | 9027 | gcc_assert (TREE_VEC_LENGTH (args) > 0); |
f4205442 | 9028 | template_parm_level_and_index (t, &level, &idx); |
ae58fa02 | 9029 | |
315fb5db NS |
9030 | levels = TMPL_ARGS_DEPTH (args); |
9031 | if (level <= levels) | |
5d80a306 DG |
9032 | { |
9033 | arg = TMPL_ARG (args, level, idx); | |
9034 | ||
9035 | if (arg && TREE_CODE (arg) == ARGUMENT_PACK_SELECT) | |
9036 | /* See through ARGUMENT_PACK_SELECT arguments. */ | |
9037 | arg = ARGUMENT_PACK_SELECT_ARG (arg); | |
9038 | } | |
ae58fa02 | 9039 | |
315fb5db NS |
9040 | if (arg == error_mark_node) |
9041 | return error_mark_node; | |
9042 | else if (arg != NULL_TREE) | |
9043 | { | |
5d80a306 DG |
9044 | if (ARGUMENT_PACK_P (arg)) |
9045 | /* If ARG is an argument pack, we don't actually want to | |
9046 | perform a substitution here, because substitutions | |
9047 | for argument packs are only done | |
9048 | element-by-element. We can get to this point when | |
9049 | substituting the type of a non-type template | |
9050 | parameter pack, when that type actually contains | |
9051 | template parameter packs from an outer template, e.g., | |
9052 | ||
9053 | template<typename... Types> struct A { | |
9054 | template<Types... Values> struct B { }; | |
9055 | }; */ | |
9056 | return t; | |
9057 | ||
315fb5db | 9058 | if (TREE_CODE (t) == TEMPLATE_TYPE_PARM) |
ae58fa02 | 9059 | { |
9180c238 | 9060 | int quals; |
315fb5db | 9061 | gcc_assert (TYPE_P (arg)); |
9180c238 JM |
9062 | |
9063 | /* cv-quals from the template are discarded when | |
9064 | substituting in a function or reference type. */ | |
9065 | if (TREE_CODE (arg) == FUNCTION_TYPE | |
9066 | || TREE_CODE (arg) == METHOD_TYPE | |
9067 | || TREE_CODE (arg) == REFERENCE_TYPE) | |
9068 | quals = cp_type_quals (arg); | |
9069 | else | |
9070 | quals = cp_type_quals (arg) | cp_type_quals (t); | |
9071 | ||
315fb5db | 9072 | return cp_build_qualified_type_real |
9180c238 | 9073 | (arg, quals, complain | tf_ignore_bad_quals); |
315fb5db NS |
9074 | } |
9075 | else if (TREE_CODE (t) == BOUND_TEMPLATE_TEMPLATE_PARM) | |
9076 | { | |
9077 | /* We are processing a type constructed from a | |
9078 | template template parameter. */ | |
9079 | tree argvec = tsubst (TYPE_TI_ARGS (t), | |
9080 | args, complain, in_decl); | |
9081 | if (argvec == error_mark_node) | |
9082 | return error_mark_node; | |
c8094d83 | 9083 | |
315fb5db NS |
9084 | /* We can get a TEMPLATE_TEMPLATE_PARM here when we |
9085 | are resolving nested-types in the signature of a | |
9086 | member function templates. Otherwise ARG is a | |
9087 | TEMPLATE_DECL and is the real template to be | |
9088 | instantiated. */ | |
9089 | if (TREE_CODE (arg) == TEMPLATE_TEMPLATE_PARM) | |
9090 | arg = TYPE_NAME (arg); | |
c8094d83 MS |
9091 | |
9092 | r = lookup_template_class (arg, | |
9093 | argvec, in_decl, | |
315fb5db NS |
9094 | DECL_CONTEXT (arg), |
9095 | /*entering_scope=*/0, | |
9096 | complain); | |
9097 | return cp_build_qualified_type_real | |
9098 | (r, TYPE_QUALS (t), complain); | |
ae58fa02 | 9099 | } |
315fb5db NS |
9100 | else |
9101 | /* TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX. */ | |
9102 | return arg; | |
ae58fa02 MM |
9103 | } |
9104 | ||
9105 | if (level == 1) | |
9106 | /* This can happen during the attempted tsubst'ing in | |
9107 | unify. This means that we don't yet have any information | |
9108 | about the template parameter in question. */ | |
9109 | return t; | |
9110 | ||
9111 | /* If we get here, we must have been looking at a parm for a | |
9112 | more deeply nested template. Make a new version of this | |
9113 | template parameter, but with a lower level. */ | |
9114 | switch (TREE_CODE (t)) | |
9115 | { | |
9116 | case TEMPLATE_TYPE_PARM: | |
9117 | case TEMPLATE_TEMPLATE_PARM: | |
a1281f45 | 9118 | case BOUND_TEMPLATE_TEMPLATE_PARM: |
89d684bb | 9119 | if (cp_type_quals (t)) |
ae58fa02 | 9120 | { |
9ccf6541 | 9121 | r = tsubst (TYPE_MAIN_VARIANT (t), args, complain, in_decl); |
0cbd7506 MS |
9122 | r = cp_build_qualified_type_real |
9123 | (r, cp_type_quals (t), | |
4f2b0fb2 NS |
9124 | complain | (TREE_CODE (t) == TEMPLATE_TYPE_PARM |
9125 | ? tf_ignore_bad_quals : 0)); | |
9ccf6541 MM |
9126 | } |
9127 | else | |
9128 | { | |
11e74ea6 | 9129 | r = copy_type (t); |
9ccf6541 MM |
9130 | TEMPLATE_TYPE_PARM_INDEX (r) |
9131 | = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (t), | |
ef3b7b17 | 9132 | r, levels, args, complain); |
9ccf6541 MM |
9133 | TYPE_STUB_DECL (r) = TYPE_NAME (r) = TEMPLATE_TYPE_DECL (r); |
9134 | TYPE_MAIN_VARIANT (r) = r; | |
9135 | TYPE_POINTER_TO (r) = NULL_TREE; | |
9136 | TYPE_REFERENCE_TO (r) = NULL_TREE; | |
9137 | ||
06d40de8 DG |
9138 | if (TREE_CODE (r) == TEMPLATE_TEMPLATE_PARM) |
9139 | /* We have reduced the level of the template | |
9140 | template parameter, but not the levels of its | |
9141 | template parameters, so canonical_type_parameter | |
9142 | will not be able to find the canonical template | |
9143 | template parameter for this level. Thus, we | |
9144 | require structural equality checking to compare | |
9145 | TEMPLATE_TEMPLATE_PARMs. */ | |
9146 | SET_TYPE_STRUCTURAL_EQUALITY (r); | |
3d761c46 DG |
9147 | else if (TYPE_STRUCTURAL_EQUALITY_P (t)) |
9148 | SET_TYPE_STRUCTURAL_EQUALITY (r); | |
06d40de8 DG |
9149 | else |
9150 | TYPE_CANONICAL (r) = canonical_type_parameter (r); | |
9151 | ||
a1281f45 | 9152 | if (TREE_CODE (t) == BOUND_TEMPLATE_TEMPLATE_PARM) |
9ccf6541 MM |
9153 | { |
9154 | tree argvec = tsubst (TYPE_TI_ARGS (t), args, | |
c8094d83 | 9155 | complain, in_decl); |
9ccf6541 MM |
9156 | if (argvec == error_mark_node) |
9157 | return error_mark_node; | |
4393e105 | 9158 | |
9ccf6541 MM |
9159 | TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (r) |
9160 | = tree_cons (TYPE_TI_TEMPLATE (t), argvec, NULL_TREE); | |
9161 | } | |
ae58fa02 MM |
9162 | } |
9163 | break; | |
9164 | ||
9165 | case TEMPLATE_PARM_INDEX: | |
ef3b7b17 | 9166 | r = reduce_template_parm_level (t, type, levels, args, complain); |
ae58fa02 | 9167 | break; |
c8094d83 | 9168 | |
ae58fa02 | 9169 | default: |
315fb5db | 9170 | gcc_unreachable (); |
ae58fa02 MM |
9171 | } |
9172 | ||
5566b478 | 9173 | return r; |
ae58fa02 | 9174 | } |
5566b478 | 9175 | |
8d08fdba MS |
9176 | case TREE_LIST: |
9177 | { | |
058b15c1 | 9178 | tree purpose, value, chain; |
8d08fdba MS |
9179 | |
9180 | if (t == void_list_node) | |
9181 | return t; | |
9182 | ||
8d08fdba MS |
9183 | purpose = TREE_PURPOSE (t); |
9184 | if (purpose) | |
4393e105 MM |
9185 | { |
9186 | purpose = tsubst (purpose, args, complain, in_decl); | |
9187 | if (purpose == error_mark_node) | |
9188 | return error_mark_node; | |
9189 | } | |
8d08fdba MS |
9190 | value = TREE_VALUE (t); |
9191 | if (value) | |
4393e105 MM |
9192 | { |
9193 | value = tsubst (value, args, complain, in_decl); | |
9194 | if (value == error_mark_node) | |
9195 | return error_mark_node; | |
9196 | } | |
8d08fdba MS |
9197 | chain = TREE_CHAIN (t); |
9198 | if (chain && chain != void_type_node) | |
4393e105 MM |
9199 | { |
9200 | chain = tsubst (chain, args, complain, in_decl); | |
9201 | if (chain == error_mark_node) | |
9202 | return error_mark_node; | |
9203 | } | |
8d08fdba MS |
9204 | if (purpose == TREE_PURPOSE (t) |
9205 | && value == TREE_VALUE (t) | |
9206 | && chain == TREE_CHAIN (t)) | |
9207 | return t; | |
058b15c1 | 9208 | return hash_tree_cons (purpose, value, chain); |
8d08fdba | 9209 | } |
c8094d83 | 9210 | |
95b4aca6 | 9211 | case TREE_BINFO: |
bd7eccc4 | 9212 | /* We should never be tsubsting a binfo. */ |
315fb5db | 9213 | gcc_unreachable (); |
85b71cf2 | 9214 | |
95b4aca6 NS |
9215 | case TREE_VEC: |
9216 | /* A vector of template arguments. */ | |
50bc768d | 9217 | gcc_assert (!type); |
a91db711 | 9218 | return tsubst_template_args (t, args, complain, in_decl); |
8d08fdba | 9219 | |
8d08fdba MS |
9220 | case POINTER_TYPE: |
9221 | case REFERENCE_TYPE: | |
9222 | { | |
8d08fdba | 9223 | enum tree_code code; |
79a7c7fa | 9224 | |
46c895ac | 9225 | if (type == TREE_TYPE (t) && TREE_CODE (type) != METHOD_TYPE) |
8d08fdba MS |
9226 | return t; |
9227 | ||
9228 | code = TREE_CODE (t); | |
4393e105 MM |
9229 | |
9230 | ||
9231 | /* [temp.deduct] | |
c8094d83 | 9232 | |
4393e105 | 9233 | Type deduction may fail for any of the following |
c8094d83 | 9234 | reasons: |
4393e105 MM |
9235 | |
9236 | -- Attempting to create a pointer to reference type. | |
9237 | -- Attempting to create a reference to a reference type or | |
8af2fec4 RY |
9238 | a reference to void. |
9239 | ||
9240 | Core issue 106 says that creating a reference to a reference | |
9241 | during instantiation is no longer a cause for failure. We | |
9242 | only enforce this check in strict C++98 mode. */ | |
9243 | if ((TREE_CODE (type) == REFERENCE_TYPE | |
c1ae8be5 | 9244 | && (((cxx_dialect == cxx98) && flag_iso) || code != REFERENCE_TYPE)) |
0ecfe0b4 | 9245 | || (code == REFERENCE_TYPE && TREE_CODE (type) == VOID_TYPE)) |
79a7c7fa | 9246 | { |
82a98427 | 9247 | static location_t last_loc; |
79a7c7fa JM |
9248 | |
9249 | /* We keep track of the last time we issued this error | |
9250 | message to avoid spewing a ton of messages during a | |
9251 | single bad template instantiation. */ | |
c2ea3a40 | 9252 | if (complain & tf_error |
2d593c86 | 9253 | && last_loc != input_location) |
79a7c7fa | 9254 | { |
0ecfe0b4 | 9255 | if (TREE_CODE (type) == VOID_TYPE) |
33bd39a2 | 9256 | error ("forming reference to void"); |
0ecfe0b4 | 9257 | else |
0f51ccfc | 9258 | error ("forming %s to reference type %qT", |
0cbd7506 MS |
9259 | (code == POINTER_TYPE) ? "pointer" : "reference", |
9260 | type); | |
82a98427 | 9261 | last_loc = input_location; |
79a7c7fa JM |
9262 | } |
9263 | ||
4393e105 | 9264 | return error_mark_node; |
79a7c7fa JM |
9265 | } |
9266 | else if (code == POINTER_TYPE) | |
46c895ac NS |
9267 | { |
9268 | r = build_pointer_type (type); | |
9269 | if (TREE_CODE (type) == METHOD_TYPE) | |
9270 | r = build_ptrmemfunc_type (r); | |
9271 | } | |
8af2fec4 RY |
9272 | else if (TREE_CODE (type) == REFERENCE_TYPE) |
9273 | /* In C++0x, during template argument substitution, when there is an | |
9274 | attempt to create a reference to a reference type, reference | |
9275 | collapsing is applied as described in [14.3.1/4 temp.arg.type]: | |
9276 | ||
9277 | "If a template-argument for a template-parameter T names a type | |
9278 | that is a reference to a type A, an attempt to create the type | |
9279 | 'lvalue reference to cv T' creates the type 'lvalue reference to | |
9280 | A,' while an attempt to create the type type rvalue reference to | |
9281 | cv T' creates the type T" | |
9282 | */ | |
9283 | r = cp_build_reference_type | |
9284 | (TREE_TYPE (type), | |
9285 | TYPE_REF_IS_RVALUE (t) && TYPE_REF_IS_RVALUE (type)); | |
8d08fdba | 9286 | else |
8af2fec4 | 9287 | r = cp_build_reference_type (type, TYPE_REF_IS_RVALUE (t)); |
adecb3f4 | 9288 | r = cp_build_qualified_type_real (r, TYPE_QUALS (t), complain); |
79a7c7fa | 9289 | |
a5f1c5f8 NS |
9290 | if (r != error_mark_node) |
9291 | /* Will this ever be needed for TYPE_..._TO values? */ | |
9292 | layout_type (r); | |
c8094d83 | 9293 | |
8d08fdba MS |
9294 | return r; |
9295 | } | |
a4443a08 | 9296 | case OFFSET_TYPE: |
0ecfe0b4 | 9297 | { |
4393e105 | 9298 | r = tsubst (TYPE_OFFSET_BASETYPE (t), args, complain, in_decl); |
9e1e64ec | 9299 | if (r == error_mark_node || !MAYBE_CLASS_TYPE_P (r)) |
4393e105 MM |
9300 | { |
9301 | /* [temp.deduct] | |
9302 | ||
9303 | Type deduction may fail for any of the following | |
9304 | reasons: | |
c8094d83 | 9305 | |
4393e105 | 9306 | -- Attempting to create "pointer to member of T" when T |
0cbd7506 | 9307 | is not a class type. */ |
c2ea3a40 | 9308 | if (complain & tf_error) |
0f51ccfc | 9309 | error ("creating pointer to member of non-class type %qT", r); |
4393e105 MM |
9310 | return error_mark_node; |
9311 | } | |
46c895ac NS |
9312 | if (TREE_CODE (type) == REFERENCE_TYPE) |
9313 | { | |
4f09be91 | 9314 | if (complain & tf_error) |
0f51ccfc | 9315 | error ("creating pointer to member reference type %qT", type); |
cb6d4a9f VR |
9316 | return error_mark_node; |
9317 | } | |
9318 | if (TREE_CODE (type) == VOID_TYPE) | |
9319 | { | |
9320 | if (complain & tf_error) | |
9321 | error ("creating pointer to member of type void"); | |
46c895ac NS |
9322 | return error_mark_node; |
9323 | } | |
50bc768d | 9324 | gcc_assert (TREE_CODE (type) != METHOD_TYPE); |
46c895ac | 9325 | if (TREE_CODE (type) == FUNCTION_TYPE) |
a5ac359a | 9326 | { |
0cbd7506 MS |
9327 | /* The type of the implicit object parameter gets its |
9328 | cv-qualifiers from the FUNCTION_TYPE. */ | |
a5ac359a | 9329 | tree method_type; |
0cbd7506 MS |
9330 | tree this_type = cp_build_qualified_type (TYPE_MAIN_VARIANT (r), |
9331 | cp_type_quals (type)); | |
9332 | tree memptr; | |
9333 | method_type = build_method_type_directly (this_type, | |
43dc123f MM |
9334 | TREE_TYPE (type), |
9335 | TYPE_ARG_TYPES (type)); | |
0cbd7506 MS |
9336 | memptr = build_ptrmemfunc_type (build_pointer_type (method_type)); |
9337 | return cp_build_qualified_type_real (memptr, cp_type_quals (t), | |
9338 | complain); | |
a5ac359a | 9339 | } |
46c895ac | 9340 | else |
b7a78333 MM |
9341 | return cp_build_qualified_type_real (build_ptrmem_type (r, type), |
9342 | TYPE_QUALS (t), | |
9343 | complain); | |
0ecfe0b4 | 9344 | } |
8d08fdba MS |
9345 | case FUNCTION_TYPE: |
9346 | case METHOD_TYPE: | |
9347 | { | |
c11b6f21 | 9348 | tree fntype; |
c7222c02 | 9349 | tree specs; |
4393e105 MM |
9350 | fntype = tsubst_function_type (t, args, complain, in_decl); |
9351 | if (fntype == error_mark_node) | |
9352 | return error_mark_node; | |
cabc336a | 9353 | |
34cd5ae7 | 9354 | /* Substitute the exception specification. */ |
c8094d83 | 9355 | specs = tsubst_exception_specification (t, args, complain, |
c7222c02 | 9356 | in_decl); |
9f6206d9 VR |
9357 | if (specs == error_mark_node) |
9358 | return error_mark_node; | |
c7222c02 MM |
9359 | if (specs) |
9360 | fntype = build_exception_variant (fntype, specs); | |
c11b6f21 | 9361 | return fntype; |
8d08fdba MS |
9362 | } |
9363 | case ARRAY_TYPE: | |
9364 | { | |
4393e105 MM |
9365 | tree domain = tsubst (TYPE_DOMAIN (t), args, complain, in_decl); |
9366 | if (domain == error_mark_node) | |
9367 | return error_mark_node; | |
9368 | ||
9369 | /* As an optimization, we avoid regenerating the array type if | |
9370 | it will obviously be the same as T. */ | |
8d08fdba MS |
9371 | if (type == TREE_TYPE (t) && domain == TYPE_DOMAIN (t)) |
9372 | return t; | |
0ecfe0b4 | 9373 | |
c8094d83 | 9374 | /* These checks should match the ones in grokdeclarator. |
4393e105 | 9375 | |
c8094d83 MS |
9376 | [temp.deduct] |
9377 | ||
9378 | The deduction may fail for any of the following reasons: | |
4393e105 MM |
9379 | |
9380 | -- Attempting to create an array with an element type that | |
c8094d83 | 9381 | is void, a function type, or a reference type, or [DR337] |
cfb91b67 | 9382 | an abstract class type. */ |
c8094d83 | 9383 | if (TREE_CODE (type) == VOID_TYPE |
4393e105 MM |
9384 | || TREE_CODE (type) == FUNCTION_TYPE |
9385 | || TREE_CODE (type) == REFERENCE_TYPE) | |
0ecfe0b4 | 9386 | { |
c2ea3a40 | 9387 | if (complain & tf_error) |
0f51ccfc | 9388 | error ("creating array of %qT", type); |
4393e105 | 9389 | return error_mark_node; |
0ecfe0b4 | 9390 | } |
cfb91b67 GB |
9391 | if (CLASS_TYPE_P (type) && CLASSTYPE_PURE_VIRTUALS (type)) |
9392 | { | |
9393 | if (complain & tf_error) | |
c8094d83 | 9394 | error ("creating array of %qT, which is an abstract class type", |
cfb91b67 | 9395 | type); |
c8094d83 | 9396 | return error_mark_node; |
cfb91b67 | 9397 | } |
0ecfe0b4 | 9398 | |
8d08fdba | 9399 | r = build_cplus_array_type (type, domain); |
5044ab0e JM |
9400 | |
9401 | if (TYPE_USER_ALIGN (t)) | |
9402 | { | |
9403 | TYPE_ALIGN (r) = TYPE_ALIGN (t); | |
9404 | TYPE_USER_ALIGN (r) = 1; | |
9405 | } | |
9406 | ||
8d08fdba MS |
9407 | return r; |
9408 | } | |
9409 | ||
8d08fdba | 9410 | case PLUS_EXPR: |
5566b478 | 9411 | case MINUS_EXPR: |
4393e105 | 9412 | { |
c2ea3a40 NS |
9413 | tree e1 = tsubst (TREE_OPERAND (t, 0), args, complain, in_decl); |
9414 | tree e2 = tsubst (TREE_OPERAND (t, 1), args, complain, in_decl); | |
4393e105 MM |
9415 | |
9416 | if (e1 == error_mark_node || e2 == error_mark_node) | |
9417 | return error_mark_node; | |
9418 | ||
7866705a | 9419 | return fold_build2 (TREE_CODE (t), TREE_TYPE (t), e1, e2); |
4393e105 | 9420 | } |
8d08fdba MS |
9421 | |
9422 | case NEGATE_EXPR: | |
9423 | case NOP_EXPR: | |
4393e105 | 9424 | { |
c2ea3a40 | 9425 | tree e = tsubst (TREE_OPERAND (t, 0), args, complain, in_decl); |
4393e105 MM |
9426 | if (e == error_mark_node) |
9427 | return error_mark_node; | |
9428 | ||
7866705a | 9429 | return fold_build1 (TREE_CODE (t), TREE_TYPE (t), e); |
4393e105 | 9430 | } |
8d08fdba | 9431 | |
5566b478 MS |
9432 | case TYPENAME_TYPE: |
9433 | { | |
4393e105 MM |
9434 | tree ctx = tsubst_aggr_type (TYPE_CONTEXT (t), args, complain, |
9435 | in_decl, /*entering_scope=*/1); | |
9436 | tree f = tsubst_copy (TYPENAME_TYPE_FULLNAME (t), args, | |
c8094d83 | 9437 | complain, in_decl); |
4393e105 MM |
9438 | |
9439 | if (ctx == error_mark_node || f == error_mark_node) | |
9440 | return error_mark_node; | |
ae58fa02 | 9441 | |
9e1e64ec | 9442 | if (!MAYBE_CLASS_TYPE_P (ctx)) |
bf8f3f93 | 9443 | { |
c2ea3a40 | 9444 | if (complain & tf_error) |
0f51ccfc | 9445 | error ("%qT is not a class, struct, or union type", ctx); |
bf8f3f93 MM |
9446 | return error_mark_node; |
9447 | } | |
9448 | else if (!uses_template_parms (ctx) && !TYPE_BEING_DEFINED (ctx)) | |
9449 | { | |
9450 | /* Normally, make_typename_type does not require that the CTX | |
9451 | have complete type in order to allow things like: | |
c8094d83 | 9452 | |
0cbd7506 | 9453 | template <class T> struct S { typename S<T>::X Y; }; |
ae58fa02 | 9454 | |
bf8f3f93 MM |
9455 | But, such constructs have already been resolved by this |
9456 | point, so here CTX really should have complete type, unless | |
9457 | it's a partial instantiation. */ | |
4393e105 | 9458 | ctx = complete_type (ctx); |
d0f062fb | 9459 | if (!COMPLETE_TYPE_P (ctx)) |
4393e105 | 9460 | { |
c2ea3a40 | 9461 | if (complain & tf_error) |
7a228918 | 9462 | cxx_incomplete_type_error (NULL_TREE, ctx); |
4393e105 MM |
9463 | return error_mark_node; |
9464 | } | |
9465 | } | |
ae58fa02 | 9466 | |
fc6a28d7 | 9467 | f = make_typename_type (ctx, f, typename_type, |
4f2b0fb2 | 9468 | (complain & tf_error) | tf_keep_type_decl); |
f0bcd168 MM |
9469 | if (f == error_mark_node) |
9470 | return f; | |
0cbd7506 MS |
9471 | if (TREE_CODE (f) == TYPE_DECL) |
9472 | { | |
4f2b0fb2 | 9473 | complain |= tf_ignore_bad_quals; |
0cbd7506 MS |
9474 | f = TREE_TYPE (f); |
9475 | } | |
c8094d83 | 9476 | |
fc6a28d7 MM |
9477 | if (TREE_CODE (f) != TYPENAME_TYPE) |
9478 | { | |
9479 | if (TYPENAME_IS_ENUM_P (t) && TREE_CODE (f) != ENUMERAL_TYPE) | |
c8094d83 | 9480 | error ("%qT resolves to %qT, which is not an enumeration type", |
fc6a28d7 MM |
9481 | t, f); |
9482 | else if (TYPENAME_IS_CLASS_P (t) && !CLASS_TYPE_P (f)) | |
c8094d83 | 9483 | error ("%qT resolves to %qT, which is is not a class type", |
fc6a28d7 MM |
9484 | t, f); |
9485 | } | |
9486 | ||
0cbd7506 MS |
9487 | return cp_build_qualified_type_real |
9488 | (f, cp_type_quals (f) | cp_type_quals (t), complain); | |
5566b478 | 9489 | } |
c8094d83 | 9490 | |
b8c6534b KL |
9491 | case UNBOUND_CLASS_TEMPLATE: |
9492 | { | |
9493 | tree ctx = tsubst_aggr_type (TYPE_CONTEXT (t), args, complain, | |
9494 | in_decl, /*entering_scope=*/1); | |
9495 | tree name = TYPE_IDENTIFIER (t); | |
b939a023 | 9496 | tree parm_list = DECL_TEMPLATE_PARMS (TYPE_NAME (t)); |
b8c6534b KL |
9497 | |
9498 | if (ctx == error_mark_node || name == error_mark_node) | |
9499 | return error_mark_node; | |
9500 | ||
b939a023 KL |
9501 | if (parm_list) |
9502 | parm_list = tsubst_template_parms (parm_list, args, complain); | |
9503 | return make_unbound_class_template (ctx, name, parm_list, complain); | |
b8c6534b KL |
9504 | } |
9505 | ||
5566b478 | 9506 | case INDIRECT_REF: |
5566b478 | 9507 | case ADDR_EXPR: |
058b15c1 | 9508 | case CALL_EXPR: |
315fb5db | 9509 | gcc_unreachable (); |
5566b478 MS |
9510 | |
9511 | case ARRAY_REF: | |
4393e105 | 9512 | { |
c2ea3a40 | 9513 | tree e1 = tsubst (TREE_OPERAND (t, 0), args, complain, in_decl); |
015c2c66 MM |
9514 | tree e2 = tsubst_expr (TREE_OPERAND (t, 1), args, complain, in_decl, |
9515 | /*integral_constant_expression_p=*/false); | |
4393e105 MM |
9516 | if (e1 == error_mark_node || e2 == error_mark_node) |
9517 | return error_mark_node; | |
9518 | ||
44de5aeb | 9519 | return build_nt (ARRAY_REF, e1, e2, NULL_TREE, NULL_TREE); |
4393e105 | 9520 | } |
5566b478 | 9521 | |
fc378698 | 9522 | case SCOPE_REF: |
4393e105 | 9523 | { |
c2ea3a40 | 9524 | tree e1 = tsubst (TREE_OPERAND (t, 0), args, complain, in_decl); |
4393e105 MM |
9525 | tree e2 = tsubst (TREE_OPERAND (t, 1), args, complain, in_decl); |
9526 | if (e1 == error_mark_node || e2 == error_mark_node) | |
9527 | return error_mark_node; | |
9528 | ||
02ed62dd MM |
9529 | return build_qualified_name (/*type=*/NULL_TREE, |
9530 | e1, e2, QUALIFIED_NAME_IS_TEMPLATE (t)); | |
4393e105 | 9531 | } |
fc378698 | 9532 | |
b894fc05 | 9533 | case TYPEOF_TYPE: |
4393e105 | 9534 | { |
b830b74c | 9535 | tree type; |
4393e105 | 9536 | |
015c2c66 MM |
9537 | type = finish_typeof (tsubst_expr |
9538 | (TYPEOF_TYPE_EXPR (t), args, | |
9539 | complain, in_decl, | |
9540 | /*integral_constant_expression_p=*/false)); | |
b830b74c | 9541 | return cp_build_qualified_type_real (type, |
dce50630 | 9542 | cp_type_quals (t) |
b830b74c | 9543 | | cp_type_quals (type), |
dce50630 | 9544 | complain); |
4393e105 | 9545 | } |
b894fc05 | 9546 | |
3ad6a8e1 DG |
9547 | case DECLTYPE_TYPE: |
9548 | { | |
9549 | tree type; | |
9550 | ||
9551 | type = | |
9552 | finish_decltype_type (tsubst_expr | |
9553 | (DECLTYPE_TYPE_EXPR (t), args, | |
9554 | complain, in_decl, | |
9555 | /*integral_constant_expression_p=*/false), | |
9556 | DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t)); | |
9557 | return cp_build_qualified_type_real (type, | |
9558 | cp_type_quals (t) | |
9559 | | cp_type_quals (type), | |
9560 | complain); | |
9561 | } | |
9562 | ||
5d80a306 DG |
9563 | case TYPE_ARGUMENT_PACK: |
9564 | case NONTYPE_ARGUMENT_PACK: | |
9565 | { | |
9566 | tree r = make_node (TREE_CODE (t)); | |
9567 | tree packed_out = | |
9568 | tsubst_template_args (ARGUMENT_PACK_ARGS (t), | |
9569 | args, | |
9570 | complain, | |
9571 | in_decl); | |
9572 | SET_ARGUMENT_PACK_ARGS (r, packed_out); | |
9573 | ||
9574 | /* For template nontype argument packs, also substitute into | |
9575 | the type. */ | |
9576 | if (TREE_CODE (t) == NONTYPE_ARGUMENT_PACK) | |
9577 | TREE_TYPE (r) = tsubst (TREE_TYPE (t), args, complain, in_decl); | |
9578 | ||
9579 | return r; | |
9580 | } | |
9581 | break; | |
9582 | ||
8d08fdba | 9583 | default: |
9e637a26 | 9584 | sorry ("use of %qs in template", |
8d08fdba MS |
9585 | tree_code_name [(int) TREE_CODE (t)]); |
9586 | return error_mark_node; | |
9587 | } | |
9588 | } | |
9589 | ||
ee76b931 MM |
9590 | /* Like tsubst_expr for a BASELINK. OBJECT_TYPE, if non-NULL, is the |
9591 | type of the expression on the left-hand side of the "." or "->" | |
9592 | operator. */ | |
9593 | ||
9594 | static tree | |
9595 | tsubst_baselink (tree baselink, tree object_type, | |
9596 | tree args, tsubst_flags_t complain, tree in_decl) | |
9597 | { | |
9598 | tree name; | |
9599 | tree qualifying_scope; | |
9600 | tree fns; | |
6f67f000 | 9601 | tree optype; |
ee76b931 MM |
9602 | tree template_args = 0; |
9603 | bool template_id_p = false; | |
9604 | ||
51a203d9 MM |
9605 | /* A baselink indicates a function from a base class. Both the |
9606 | BASELINK_ACCESS_BINFO and the base class referenced may | |
9607 | indicate bases of the template class, rather than the | |
9608 | instantiated class. In addition, lookups that were not | |
9609 | ambiguous before may be ambiguous now. Therefore, we perform | |
9610 | the lookup again. */ | |
ee76b931 | 9611 | qualifying_scope = BINFO_TYPE (BASELINK_ACCESS_BINFO (baselink)); |
51a203d9 MM |
9612 | qualifying_scope = tsubst (qualifying_scope, args, |
9613 | complain, in_decl); | |
ee76b931 | 9614 | fns = BASELINK_FUNCTIONS (baselink); |
6f67f000 | 9615 | optype = BASELINK_OPTYPE (baselink); |
ee76b931 MM |
9616 | if (TREE_CODE (fns) == TEMPLATE_ID_EXPR) |
9617 | { | |
9618 | template_id_p = true; | |
9619 | template_args = TREE_OPERAND (fns, 1); | |
9620 | fns = TREE_OPERAND (fns, 0); | |
bf12d54d NS |
9621 | if (template_args) |
9622 | template_args = tsubst_template_args (template_args, args, | |
9623 | complain, in_decl); | |
ee76b931 MM |
9624 | } |
9625 | name = DECL_NAME (get_first_fn (fns)); | |
9626 | baselink = lookup_fnfields (qualifying_scope, name, /*protect=*/1); | |
c8094d83 | 9627 | |
9b60dfd7 MM |
9628 | /* If lookup found a single function, mark it as used at this |
9629 | point. (If it lookup found multiple functions the one selected | |
9630 | later by overload resolution will be marked as used at that | |
9631 | point.) */ | |
9632 | if (BASELINK_P (baselink)) | |
9633 | fns = BASELINK_FUNCTIONS (baselink); | |
9634 | if (!template_id_p && !really_overloaded_fn (fns)) | |
9635 | mark_used (OVL_CURRENT (fns)); | |
9636 | ||
9637 | /* Add back the template arguments, if present. */ | |
ee76b931 | 9638 | if (BASELINK_P (baselink) && template_id_p) |
c8094d83 | 9639 | BASELINK_FUNCTIONS (baselink) |
ee76b931 MM |
9640 | = build_nt (TEMPLATE_ID_EXPR, |
9641 | BASELINK_FUNCTIONS (baselink), | |
9642 | template_args); | |
6f67f000 MM |
9643 | /* Update the conversion operator type. */ |
9644 | BASELINK_OPTYPE (baselink) | |
9645 | = tsubst (optype, args, complain, in_decl); | |
9b60dfd7 | 9646 | |
ee76b931 MM |
9647 | if (!object_type) |
9648 | object_type = current_class_type; | |
c8094d83 | 9649 | return adjust_result_of_qualified_name_lookup (baselink, |
ee76b931 MM |
9650 | qualifying_scope, |
9651 | object_type); | |
9652 | } | |
9653 | ||
9654 | /* Like tsubst_expr for a SCOPE_REF, given by QUALIFIED_ID. DONE is | |
9655 | true if the qualified-id will be a postfix-expression in-and-of | |
9656 | itself; false if more of the postfix-expression follows the | |
9657 | QUALIFIED_ID. ADDRESS_P is true if the qualified-id is the operand | |
9658 | of "&". */ | |
9659 | ||
9660 | static tree | |
c8094d83 | 9661 | tsubst_qualified_id (tree qualified_id, tree args, |
ee76b931 MM |
9662 | tsubst_flags_t complain, tree in_decl, |
9663 | bool done, bool address_p) | |
9664 | { | |
9665 | tree expr; | |
9666 | tree scope; | |
9667 | tree name; | |
9668 | bool is_template; | |
9669 | tree template_args; | |
9670 | ||
50bc768d | 9671 | gcc_assert (TREE_CODE (qualified_id) == SCOPE_REF); |
ee76b931 | 9672 | |
ee76b931 MM |
9673 | /* Figure out what name to look up. */ |
9674 | name = TREE_OPERAND (qualified_id, 1); | |
9675 | if (TREE_CODE (name) == TEMPLATE_ID_EXPR) | |
9676 | { | |
9677 | is_template = true; | |
bf12d54d NS |
9678 | template_args = TREE_OPERAND (name, 1); |
9679 | if (template_args) | |
9680 | template_args = tsubst_template_args (template_args, args, | |
9681 | complain, in_decl); | |
ee76b931 MM |
9682 | name = TREE_OPERAND (name, 0); |
9683 | } | |
9684 | else | |
9685 | { | |
9686 | is_template = false; | |
9687 | template_args = NULL_TREE; | |
9688 | } | |
9689 | ||
6eeba0cc MM |
9690 | /* Substitute into the qualifying scope. When there are no ARGS, we |
9691 | are just trying to simplify a non-dependent expression. In that | |
9692 | case the qualifying scope may be dependent, and, in any case, | |
9693 | substituting will not help. */ | |
9694 | scope = TREE_OPERAND (qualified_id, 0); | |
9695 | if (args) | |
9696 | { | |
9697 | scope = tsubst (scope, args, complain, in_decl); | |
9698 | expr = tsubst_copy (name, args, complain, in_decl); | |
9699 | } | |
9700 | else | |
9701 | expr = name; | |
10b1d5e7 | 9702 | |
ab73670a | 9703 | if (dependent_type_p (scope)) |
3db45ab5 MS |
9704 | return build_qualified_name (/*type=*/NULL_TREE, |
9705 | scope, expr, | |
02ed62dd | 9706 | QUALIFIED_NAME_IS_TEMPLATE (qualified_id)); |
c8094d83 | 9707 | |
5e08432e | 9708 | if (!BASELINK_P (name) && !DECL_P (expr)) |
12483c9f | 9709 | { |
8ca4bf25 MM |
9710 | if (TREE_CODE (expr) == BIT_NOT_EXPR) |
9711 | /* If this were actually a destructor call, it would have been | |
9712 | parsed as such by the parser. */ | |
9713 | expr = error_mark_node; | |
9714 | else | |
9715 | expr = lookup_qualified_name (scope, expr, /*is_type_p=*/0, false); | |
12483c9f NS |
9716 | if (TREE_CODE (TREE_CODE (expr) == TEMPLATE_DECL |
9717 | ? DECL_TEMPLATE_RESULT (expr) : expr) == TYPE_DECL) | |
9718 | { | |
9719 | if (complain & tf_error) | |
b2693faf | 9720 | { |
0f51ccfc | 9721 | error ("dependent-name %qE is parsed as a non-type, but " |
b2693faf | 9722 | "instantiation yields a type", qualified_id); |
0f51ccfc | 9723 | inform ("say %<typename %E%> if a type is meant", qualified_id); |
b2693faf | 9724 | } |
12483c9f NS |
9725 | return error_mark_node; |
9726 | } | |
9727 | } | |
c8094d83 | 9728 | |
279b8466 | 9729 | if (DECL_P (expr)) |
8f78f01f MM |
9730 | { |
9731 | check_accessibility_of_qualified_id (expr, /*object_type=*/NULL_TREE, | |
9732 | scope); | |
9733 | /* Remember that there was a reference to this entity. */ | |
9734 | mark_used (expr); | |
9735 | } | |
9736 | ||
9737 | if (expr == error_mark_node || TREE_CODE (expr) == TREE_LIST) | |
9738 | { | |
9739 | if (complain & tf_error) | |
c8094d83 | 9740 | qualified_name_lookup_error (scope, |
8f78f01f MM |
9741 | TREE_OPERAND (qualified_id, 1), |
9742 | expr); | |
9743 | return error_mark_node; | |
9744 | } | |
ee76b931 MM |
9745 | |
9746 | if (is_template) | |
10b1d5e7 | 9747 | expr = lookup_template_function (expr, template_args); |
ee76b931 | 9748 | |
22038b2c | 9749 | if (expr == error_mark_node && complain & tf_error) |
8f78f01f MM |
9750 | qualified_name_lookup_error (scope, TREE_OPERAND (qualified_id, 1), |
9751 | expr); | |
22038b2c | 9752 | else if (TYPE_P (scope)) |
ee76b931 | 9753 | { |
c8094d83 | 9754 | expr = (adjust_result_of_qualified_name_lookup |
ee76b931 | 9755 | (expr, scope, current_class_type)); |
3db45ab5 | 9756 | expr = (finish_qualified_id_expr |
02ed62dd MM |
9757 | (scope, expr, done, address_p, |
9758 | QUALIFIED_NAME_IS_TEMPLATE (qualified_id), | |
9759 | /*template_arg_p=*/false)); | |
ee76b931 | 9760 | } |
c8094d83 | 9761 | |
015c2c66 MM |
9762 | /* Expressions do not generally have reference type. */ |
9763 | if (TREE_CODE (expr) != SCOPE_REF | |
9764 | /* However, if we're about to form a pointer-to-member, we just | |
9765 | want the referenced member referenced. */ | |
9766 | && TREE_CODE (expr) != OFFSET_REF) | |
aec5ba60 | 9767 | expr = convert_from_reference (expr); |
ee76b931 MM |
9768 | |
9769 | return expr; | |
9770 | } | |
9771 | ||
00d3396f JM |
9772 | /* Like tsubst, but deals with expressions. This function just replaces |
9773 | template parms; to finish processing the resultant expression, use | |
9774 | tsubst_expr. */ | |
9775 | ||
14d22dd6 | 9776 | static tree |
3a978d72 | 9777 | tsubst_copy (tree t, tree args, tsubst_flags_t complain, tree in_decl) |
5566b478 MS |
9778 | { |
9779 | enum tree_code code; | |
8452b1d3 | 9780 | tree r; |
8d08fdba | 9781 | |
5566b478 MS |
9782 | if (t == NULL_TREE || t == error_mark_node) |
9783 | return t; | |
9784 | ||
9785 | code = TREE_CODE (t); | |
b7484fbe | 9786 | |
5566b478 MS |
9787 | switch (code) |
9788 | { | |
9789 | case PARM_DECL: | |
a723baf1 | 9790 | r = retrieve_local_specialization (t); |
50bc768d | 9791 | gcc_assert (r != NULL); |
5d80a306 DG |
9792 | if (TREE_CODE (r) == ARGUMENT_PACK_SELECT) |
9793 | r = ARGUMENT_PACK_SELECT_ARG (r); | |
c0694c4b | 9794 | mark_used (r); |
a723baf1 | 9795 | return r; |
5566b478 MS |
9796 | |
9797 | case CONST_DECL: | |
ed44da02 MM |
9798 | { |
9799 | tree enum_type; | |
9800 | tree v; | |
9801 | ||
a723baf1 MM |
9802 | if (DECL_TEMPLATE_PARM_P (t)) |
9803 | return tsubst_copy (DECL_INITIAL (t), args, complain, in_decl); | |
7b6d72fc MM |
9804 | /* There is no need to substitute into namespace-scope |
9805 | enumerators. */ | |
9806 | if (DECL_NAMESPACE_SCOPE_P (t)) | |
ed44da02 | 9807 | return t; |
d5a10cf0 MM |
9808 | /* If ARGS is NULL, then T is known to be non-dependent. */ |
9809 | if (args == NULL_TREE) | |
8a784e4a | 9810 | return integral_constant_value (t); |
ed44da02 MM |
9811 | |
9812 | /* Unfortunately, we cannot just call lookup_name here. | |
9188c363 | 9813 | Consider: |
c8094d83 | 9814 | |
9188c363 MM |
9815 | template <int I> int f() { |
9816 | enum E { a = I }; | |
9817 | struct S { void g() { E e = a; } }; | |
9818 | }; | |
c8094d83 | 9819 | |
9188c363 MM |
9820 | When we instantiate f<7>::S::g(), say, lookup_name is not |
9821 | clever enough to find f<7>::a. */ | |
c8094d83 MS |
9822 | enum_type |
9823 | = tsubst_aggr_type (TREE_TYPE (t), args, complain, in_decl, | |
ed44da02 MM |
9824 | /*entering_scope=*/0); |
9825 | ||
c8094d83 MS |
9826 | for (v = TYPE_VALUES (enum_type); |
9827 | v != NULL_TREE; | |
ed44da02 MM |
9828 | v = TREE_CHAIN (v)) |
9829 | if (TREE_PURPOSE (v) == DECL_NAME (t)) | |
9830 | return TREE_VALUE (v); | |
9831 | ||
9832 | /* We didn't find the name. That should never happen; if | |
9833 | name-lookup found it during preliminary parsing, we | |
9834 | should find it again here during instantiation. */ | |
315fb5db | 9835 | gcc_unreachable (); |
ed44da02 | 9836 | } |
db04386f | 9837 | return t; |
ed44da02 | 9838 | |
5566b478 MS |
9839 | case FIELD_DECL: |
9840 | if (DECL_CONTEXT (t)) | |
9841 | { | |
0978790f | 9842 | tree ctx; |
0978790f | 9843 | |
4393e105 | 9844 | ctx = tsubst_aggr_type (DECL_CONTEXT (t), args, complain, in_decl, |
36a117a5 | 9845 | /*entering_scope=*/1); |
0978790f | 9846 | if (ctx != DECL_CONTEXT (t)) |
bad1f462 KL |
9847 | { |
9848 | tree r = lookup_field (ctx, DECL_NAME (t), 0, false); | |
9849 | if (!r) | |
9850 | { | |
9851 | if (complain & tf_error) | |
9852 | error ("using invalid field %qD", t); | |
9853 | return error_mark_node; | |
9854 | } | |
9855 | return r; | |
9856 | } | |
5566b478 | 9857 | } |
c8094d83 | 9858 | |
5566b478 MS |
9859 | return t; |
9860 | ||
9861 | case VAR_DECL: | |
9862 | case FUNCTION_DECL: | |
a723baf1 MM |
9863 | if ((DECL_LANG_SPECIFIC (t) && DECL_TEMPLATE_INFO (t)) |
9864 | || local_variable_p (t)) | |
4393e105 | 9865 | t = tsubst (t, args, complain, in_decl); |
5566b478 MS |
9866 | mark_used (t); |
9867 | return t; | |
9868 | ||
a723baf1 | 9869 | case BASELINK: |
ee76b931 | 9870 | return tsubst_baselink (t, current_class_type, args, complain, in_decl); |
a723baf1 | 9871 | |
98c1c668 | 9872 | case TEMPLATE_DECL: |
a723baf1 | 9873 | if (DECL_TEMPLATE_TEMPLATE_PARM_P (t)) |
c8094d83 | 9874 | return tsubst (TREE_TYPE (DECL_TEMPLATE_RESULT (t)), |
a723baf1 | 9875 | args, complain, in_decl); |
c7222c02 | 9876 | else if (DECL_FUNCTION_TEMPLATE_P (t) && DECL_MEMBER_TEMPLATE_P (t)) |
4393e105 | 9877 | return tsubst (t, args, complain, in_decl); |
fcea7401 KL |
9878 | else if (DECL_CLASS_SCOPE_P (t) |
9879 | && uses_template_parms (DECL_CONTEXT (t))) | |
9880 | { | |
9881 | /* Template template argument like the following example need | |
9882 | special treatment: | |
9883 | ||
9884 | template <template <class> class TT> struct C {}; | |
9885 | template <class T> struct D { | |
9886 | template <class U> struct E {}; | |
0cbd7506 | 9887 | C<E> c; // #1 |
fcea7401 KL |
9888 | }; |
9889 | D<int> d; // #2 | |
9890 | ||
9891 | We are processing the template argument `E' in #1 for | |
9892 | the template instantiation #2. Originally, `E' is a | |
9893 | TEMPLATE_DECL with `D<T>' as its DECL_CONTEXT. Now we | |
9894 | have to substitute this with one having context `D<int>'. */ | |
9895 | ||
9896 | tree context = tsubst (DECL_CONTEXT (t), args, complain, in_decl); | |
9897 | return lookup_field (context, DECL_NAME(t), 0, false); | |
9898 | } | |
98c1c668 | 9899 | else |
fcea7401 | 9900 | /* Ordinary template template argument. */ |
98c1c668 JM |
9901 | return t; |
9902 | ||
5566b478 MS |
9903 | case CAST_EXPR: |
9904 | case REINTERPRET_CAST_EXPR: | |
e92cc029 MS |
9905 | case CONST_CAST_EXPR: |
9906 | case STATIC_CAST_EXPR: | |
9907 | case DYNAMIC_CAST_EXPR: | |
51924768 | 9908 | case NOP_EXPR: |
5566b478 | 9909 | return build1 |
4393e105 MM |
9910 | (code, tsubst (TREE_TYPE (t), args, complain, in_decl), |
9911 | tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl)); | |
5566b478 | 9912 | |
5d80a306 DG |
9913 | case SIZEOF_EXPR: |
9914 | if (PACK_EXPANSION_P (TREE_OPERAND (t, 0))) | |
9915 | { | |
9916 | /* We only want to compute the number of arguments. */ | |
9917 | tree expanded = tsubst_pack_expansion (TREE_OPERAND (t, 0), args, | |
9918 | complain, in_decl); | |
e68c63e3 | 9919 | int len = 0; |
063cc99c DG |
9920 | |
9921 | if (TREE_CODE (expanded) == TREE_VEC) | |
9922 | len = TREE_VEC_LENGTH (expanded); | |
9923 | ||
4745e4eb JJ |
9924 | if (expanded == error_mark_node) |
9925 | return error_mark_node; | |
063cc99c DG |
9926 | else if (PACK_EXPANSION_P (expanded) |
9927 | || (TREE_CODE (expanded) == TREE_VEC | |
9928 | && len > 0 | |
9929 | && PACK_EXPANSION_P (TREE_VEC_ELT (expanded, len-1)))) | |
9930 | { | |
9931 | if (TREE_CODE (expanded) == TREE_VEC) | |
9932 | expanded = TREE_VEC_ELT (expanded, len - 1); | |
9933 | ||
9934 | if (TYPE_P (expanded)) | |
9935 | return cxx_sizeof_or_alignof_type (expanded, SIZEOF_EXPR, | |
9936 | complain & tf_error); | |
9937 | else | |
9938 | return cxx_sizeof_or_alignof_expr (expanded, SIZEOF_EXPR, | |
9939 | complain & tf_error); | |
9940 | } | |
9941 | else | |
9942 | return build_int_cst (size_type_node, len); | |
5d80a306 DG |
9943 | } |
9944 | /* Fall through */ | |
9945 | ||
5566b478 | 9946 | case INDIRECT_REF: |
5566b478 MS |
9947 | case NEGATE_EXPR: |
9948 | case TRUTH_NOT_EXPR: | |
b87692e5 | 9949 | case BIT_NOT_EXPR: |
5566b478 | 9950 | case ADDR_EXPR: |
392e3d51 | 9951 | case UNARY_PLUS_EXPR: /* Unary + */ |
abff8e06 | 9952 | case ALIGNOF_EXPR: |
5566b478 | 9953 | case ARROW_EXPR: |
fc378698 | 9954 | case THROW_EXPR: |
5156628f | 9955 | case TYPEID_EXPR: |
f5733617 SS |
9956 | case REALPART_EXPR: |
9957 | case IMAGPART_EXPR: | |
5566b478 | 9958 | return build1 |
6a629cac | 9959 | (code, tsubst (TREE_TYPE (t), args, complain, in_decl), |
4393e105 | 9960 | tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl)); |
5566b478 | 9961 | |
a723baf1 MM |
9962 | case COMPONENT_REF: |
9963 | { | |
9964 | tree object; | |
9965 | tree name; | |
9966 | ||
9967 | object = tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl); | |
9968 | name = TREE_OPERAND (t, 1); | |
c8094d83 | 9969 | if (TREE_CODE (name) == BIT_NOT_EXPR) |
a723baf1 MM |
9970 | { |
9971 | name = tsubst_copy (TREE_OPERAND (name, 0), args, | |
9972 | complain, in_decl); | |
9973 | name = build1 (BIT_NOT_EXPR, NULL_TREE, name); | |
9974 | } | |
9975 | else if (TREE_CODE (name) == SCOPE_REF | |
9976 | && TREE_CODE (TREE_OPERAND (name, 1)) == BIT_NOT_EXPR) | |
9977 | { | |
9978 | tree base = tsubst_copy (TREE_OPERAND (name, 0), args, | |
9979 | complain, in_decl); | |
9980 | name = TREE_OPERAND (name, 1); | |
9981 | name = tsubst_copy (TREE_OPERAND (name, 0), args, | |
9982 | complain, in_decl); | |
9983 | name = build1 (BIT_NOT_EXPR, NULL_TREE, name); | |
02ed62dd | 9984 | name = build_qualified_name (/*type=*/NULL_TREE, |
3db45ab5 | 9985 | base, name, |
02ed62dd | 9986 | /*template_p=*/false); |
a723baf1 | 9987 | } |
ee76b931 | 9988 | else if (TREE_CODE (name) == BASELINK) |
c8094d83 MS |
9989 | name = tsubst_baselink (name, |
9990 | non_reference (TREE_TYPE (object)), | |
9991 | args, complain, | |
ee76b931 | 9992 | in_decl); |
a723baf1 | 9993 | else |
ee76b931 | 9994 | name = tsubst_copy (name, args, complain, in_decl); |
44de5aeb | 9995 | return build_nt (COMPONENT_REF, object, name, NULL_TREE); |
a723baf1 MM |
9996 | } |
9997 | ||
5566b478 MS |
9998 | case PLUS_EXPR: |
9999 | case MINUS_EXPR: | |
10000 | case MULT_EXPR: | |
10001 | case TRUNC_DIV_EXPR: | |
10002 | case CEIL_DIV_EXPR: | |
10003 | case FLOOR_DIV_EXPR: | |
10004 | case ROUND_DIV_EXPR: | |
10005 | case EXACT_DIV_EXPR: | |
10006 | case BIT_AND_EXPR: | |
5566b478 MS |
10007 | case BIT_IOR_EXPR: |
10008 | case BIT_XOR_EXPR: | |
10009 | case TRUNC_MOD_EXPR: | |
10010 | case FLOOR_MOD_EXPR: | |
10011 | case TRUTH_ANDIF_EXPR: | |
10012 | case TRUTH_ORIF_EXPR: | |
10013 | case TRUTH_AND_EXPR: | |
10014 | case TRUTH_OR_EXPR: | |
10015 | case RSHIFT_EXPR: | |
10016 | case LSHIFT_EXPR: | |
10017 | case RROTATE_EXPR: | |
10018 | case LROTATE_EXPR: | |
10019 | case EQ_EXPR: | |
10020 | case NE_EXPR: | |
10021 | case MAX_EXPR: | |
10022 | case MIN_EXPR: | |
10023 | case LE_EXPR: | |
10024 | case GE_EXPR: | |
10025 | case LT_EXPR: | |
10026 | case GT_EXPR: | |
5566b478 | 10027 | case COMPOUND_EXPR: |
5566b478 MS |
10028 | case DOTSTAR_EXPR: |
10029 | case MEMBER_REF: | |
519c9806 MM |
10030 | case PREDECREMENT_EXPR: |
10031 | case PREINCREMENT_EXPR: | |
10032 | case POSTDECREMENT_EXPR: | |
10033 | case POSTINCREMENT_EXPR: | |
5566b478 | 10034 | return build_nt |
4393e105 MM |
10035 | (code, tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl), |
10036 | tsubst_copy (TREE_OPERAND (t, 1), args, complain, in_decl)); | |
5566b478 | 10037 | |
02ed62dd MM |
10038 | case SCOPE_REF: |
10039 | return build_qualified_name (/*type=*/NULL_TREE, | |
10040 | tsubst_copy (TREE_OPERAND (t, 0), | |
10041 | args, complain, in_decl), | |
10042 | tsubst_copy (TREE_OPERAND (t, 1), | |
10043 | args, complain, in_decl), | |
10044 | QUALIFIED_NAME_IS_TEMPLATE (t)); | |
10045 | ||
d8987adb NS |
10046 | case ARRAY_REF: |
10047 | return build_nt | |
10048 | (ARRAY_REF, | |
10049 | tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl), | |
10050 | tsubst_copy (TREE_OPERAND (t, 1), args, complain, in_decl), | |
10051 | NULL_TREE, NULL_TREE); | |
10052 | ||
5566b478 | 10053 | case CALL_EXPR: |
5039610b SL |
10054 | { |
10055 | int n = VL_EXP_OPERAND_LENGTH (t); | |
10056 | tree result = build_vl_exp (CALL_EXPR, n); | |
10057 | int i; | |
10058 | for (i = 0; i < n; i++) | |
10059 | TREE_OPERAND (t, i) = tsubst_copy (TREE_OPERAND (t, i), args, | |
10060 | complain, in_decl); | |
10061 | return result; | |
10062 | } | |
5566b478 | 10063 | |
5566b478 MS |
10064 | case COND_EXPR: |
10065 | case MODOP_EXPR: | |
40242ccf | 10066 | case PSEUDO_DTOR_EXPR: |
67da3287 | 10067 | { |
8452b1d3 | 10068 | r = build_nt |
4393e105 MM |
10069 | (code, tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl), |
10070 | tsubst_copy (TREE_OPERAND (t, 1), args, complain, in_decl), | |
10071 | tsubst_copy (TREE_OPERAND (t, 2), args, complain, in_decl)); | |
e4c2c34b | 10072 | TREE_NO_WARNING (r) = TREE_NO_WARNING (t); |
67da3287 MM |
10073 | return r; |
10074 | } | |
5566b478 MS |
10075 | |
10076 | case NEW_EXPR: | |
10077 | { | |
8452b1d3 | 10078 | r = build_nt |
4393e105 MM |
10079 | (code, tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl), |
10080 | tsubst_copy (TREE_OPERAND (t, 1), args, complain, in_decl), | |
10081 | tsubst_copy (TREE_OPERAND (t, 2), args, complain, in_decl)); | |
5566b478 MS |
10082 | NEW_EXPR_USE_GLOBAL (r) = NEW_EXPR_USE_GLOBAL (t); |
10083 | return r; | |
10084 | } | |
10085 | ||
10086 | case DELETE_EXPR: | |
10087 | { | |
8452b1d3 | 10088 | r = build_nt |
4393e105 MM |
10089 | (code, tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl), |
10090 | tsubst_copy (TREE_OPERAND (t, 1), args, complain, in_decl)); | |
5566b478 MS |
10091 | DELETE_EXPR_USE_GLOBAL (r) = DELETE_EXPR_USE_GLOBAL (t); |
10092 | DELETE_EXPR_USE_VEC (r) = DELETE_EXPR_USE_VEC (t); | |
10093 | return r; | |
10094 | } | |
10095 | ||
386b8a85 JM |
10096 | case TEMPLATE_ID_EXPR: |
10097 | { | |
0cbd7506 | 10098 | /* Substituted template arguments */ |
a91db711 NS |
10099 | tree fn = TREE_OPERAND (t, 0); |
10100 | tree targs = TREE_OPERAND (t, 1); | |
856216bb | 10101 | |
a91db711 | 10102 | fn = tsubst_copy (fn, args, complain, in_decl); |
bf12d54d NS |
10103 | if (targs) |
10104 | targs = tsubst_template_args (targs, args, complain, in_decl); | |
c8094d83 | 10105 | |
a91db711 | 10106 | return lookup_template_function (fn, targs); |
386b8a85 JM |
10107 | } |
10108 | ||
5566b478 MS |
10109 | case TREE_LIST: |
10110 | { | |
10111 | tree purpose, value, chain; | |
10112 | ||
10113 | if (t == void_list_node) | |
10114 | return t; | |
10115 | ||
10116 | purpose = TREE_PURPOSE (t); | |
10117 | if (purpose) | |
4393e105 | 10118 | purpose = tsubst_copy (purpose, args, complain, in_decl); |
5566b478 MS |
10119 | value = TREE_VALUE (t); |
10120 | if (value) | |
4393e105 | 10121 | value = tsubst_copy (value, args, complain, in_decl); |
5566b478 MS |
10122 | chain = TREE_CHAIN (t); |
10123 | if (chain && chain != void_type_node) | |
4393e105 | 10124 | chain = tsubst_copy (chain, args, complain, in_decl); |
5566b478 MS |
10125 | if (purpose == TREE_PURPOSE (t) |
10126 | && value == TREE_VALUE (t) | |
10127 | && chain == TREE_CHAIN (t)) | |
10128 | return t; | |
10129 | return tree_cons (purpose, value, chain); | |
10130 | } | |
10131 | ||
10132 | case RECORD_TYPE: | |
10133 | case UNION_TYPE: | |
10134 | case ENUMERAL_TYPE: | |
10135 | case INTEGER_TYPE: | |
10136 | case TEMPLATE_TYPE_PARM: | |
73b0fce8 | 10137 | case TEMPLATE_TEMPLATE_PARM: |
a1281f45 | 10138 | case BOUND_TEMPLATE_TEMPLATE_PARM: |
f84b4be9 | 10139 | case TEMPLATE_PARM_INDEX: |
5566b478 MS |
10140 | case POINTER_TYPE: |
10141 | case REFERENCE_TYPE: | |
10142 | case OFFSET_TYPE: | |
10143 | case FUNCTION_TYPE: | |
10144 | case METHOD_TYPE: | |
10145 | case ARRAY_TYPE: | |
10146 | case TYPENAME_TYPE: | |
b8c6534b | 10147 | case UNBOUND_CLASS_TEMPLATE: |
2a2b1d56 | 10148 | case TYPEOF_TYPE: |
3ad6a8e1 | 10149 | case DECLTYPE_TYPE: |
f84b4be9 | 10150 | case TYPE_DECL: |
4393e105 | 10151 | return tsubst (t, args, complain, in_decl); |
5566b478 | 10152 | |
e92cc029 | 10153 | case IDENTIFIER_NODE: |
421844e7 | 10154 | if (IDENTIFIER_TYPENAME_P (t)) |
1f6e1acc AS |
10155 | { |
10156 | tree new_type = tsubst (TREE_TYPE (t), args, complain, in_decl); | |
1f84ec23 | 10157 | return mangle_conv_op_name_for_type (new_type); |
1f6e1acc | 10158 | } |
e92cc029 MS |
10159 | else |
10160 | return t; | |
10161 | ||
5156628f | 10162 | case CONSTRUCTOR: |
4038c495 GB |
10163 | /* This is handled by tsubst_copy_and_build. */ |
10164 | gcc_unreachable (); | |
5156628f | 10165 | |
371534a9 | 10166 | case VA_ARG_EXPR: |
ea333e1c | 10167 | return build_x_va_arg (tsubst_copy (TREE_OPERAND (t, 0), args, complain, |
c2ea3a40 NS |
10168 | in_decl), |
10169 | tsubst (TREE_TYPE (t), args, complain, in_decl)); | |
f9817201 | 10170 | |
543a0daa RH |
10171 | case CLEANUP_POINT_EXPR: |
10172 | /* We shouldn't have built any of these during initial template | |
10173 | generation. Instead, they should be built during instantiation | |
10174 | in response to the saved STMT_IS_FULL_EXPR_P setting. */ | |
315fb5db | 10175 | gcc_unreachable (); |
543a0daa | 10176 | |
7eab6e7b MM |
10177 | case OFFSET_REF: |
10178 | mark_used (TREE_OPERAND (t, 1)); | |
10179 | return t; | |
10180 | ||
5d80a306 DG |
10181 | case EXPR_PACK_EXPANSION: |
10182 | error ("invalid use of pack expansion expression"); | |
10183 | return error_mark_node; | |
10184 | ||
10185 | case NONTYPE_ARGUMENT_PACK: | |
10186 | error ("use %<...%> to expand argument pack"); | |
10187 | return error_mark_node; | |
10188 | ||
5566b478 MS |
10189 | default: |
10190 | return t; | |
10191 | } | |
10192 | } | |
10193 | ||
1799e5d5 RH |
10194 | /* Like tsubst_copy, but specifically for OpenMP clauses. */ |
10195 | ||
10196 | static tree | |
10197 | tsubst_omp_clauses (tree clauses, tree args, tsubst_flags_t complain, | |
10198 | tree in_decl) | |
10199 | { | |
10200 | tree new_clauses = NULL, nc, oc; | |
10201 | ||
10202 | for (oc = clauses; oc ; oc = OMP_CLAUSE_CHAIN (oc)) | |
10203 | { | |
10204 | nc = copy_node (oc); | |
10205 | OMP_CLAUSE_CHAIN (nc) = new_clauses; | |
10206 | new_clauses = nc; | |
10207 | ||
10208 | switch (OMP_CLAUSE_CODE (nc)) | |
10209 | { | |
10210 | case OMP_CLAUSE_PRIVATE: | |
10211 | case OMP_CLAUSE_SHARED: | |
10212 | case OMP_CLAUSE_FIRSTPRIVATE: | |
10213 | case OMP_CLAUSE_LASTPRIVATE: | |
10214 | case OMP_CLAUSE_REDUCTION: | |
10215 | case OMP_CLAUSE_COPYIN: | |
10216 | case OMP_CLAUSE_COPYPRIVATE: | |
10217 | case OMP_CLAUSE_IF: | |
10218 | case OMP_CLAUSE_NUM_THREADS: | |
10219 | case OMP_CLAUSE_SCHEDULE: | |
10220 | OMP_CLAUSE_OPERAND (nc, 0) | |
015c2c66 MM |
10221 | = tsubst_expr (OMP_CLAUSE_OPERAND (oc, 0), args, complain, |
10222 | in_decl, /*integral_constant_expression_p=*/false); | |
1799e5d5 RH |
10223 | break; |
10224 | case OMP_CLAUSE_NOWAIT: | |
10225 | case OMP_CLAUSE_ORDERED: | |
10226 | case OMP_CLAUSE_DEFAULT: | |
10227 | break; | |
10228 | default: | |
10229 | gcc_unreachable (); | |
10230 | } | |
10231 | } | |
10232 | ||
10233 | return finish_omp_clauses (nreverse (new_clauses)); | |
10234 | } | |
10235 | ||
f74dcfb7 JJ |
10236 | /* Like tsubst_copy_and_build, but unshare TREE_LIST nodes. */ |
10237 | ||
10238 | static tree | |
10239 | tsubst_copy_asm_operands (tree t, tree args, tsubst_flags_t complain, | |
10240 | tree in_decl) | |
10241 | { | |
10242 | #define RECUR(t) tsubst_copy_asm_operands (t, args, complain, in_decl) | |
10243 | ||
10244 | tree purpose, value, chain; | |
10245 | ||
10246 | if (t == NULL) | |
10247 | return t; | |
10248 | ||
10249 | if (TREE_CODE (t) != TREE_LIST) | |
10250 | return tsubst_copy_and_build (t, args, complain, in_decl, | |
015c2c66 MM |
10251 | /*function_p=*/false, |
10252 | /*integral_constant_expression_p=*/false); | |
f74dcfb7 JJ |
10253 | |
10254 | if (t == void_list_node) | |
10255 | return t; | |
10256 | ||
10257 | purpose = TREE_PURPOSE (t); | |
10258 | if (purpose) | |
10259 | purpose = RECUR (purpose); | |
10260 | value = TREE_VALUE (t); | |
10261 | if (value) | |
10262 | value = RECUR (value); | |
10263 | chain = TREE_CHAIN (t); | |
10264 | if (chain && chain != void_type_node) | |
10265 | chain = RECUR (chain); | |
10266 | return tree_cons (purpose, value, chain); | |
10267 | #undef RECUR | |
10268 | } | |
10269 | ||
cc23546e JO |
10270 | /* Like tsubst_copy for expressions, etc. but also does semantic |
10271 | processing. */ | |
00d3396f | 10272 | |
14d22dd6 | 10273 | static tree |
015c2c66 MM |
10274 | tsubst_expr (tree t, tree args, tsubst_flags_t complain, tree in_decl, |
10275 | bool integral_constant_expression_p) | |
5566b478 | 10276 | { |
015c2c66 MM |
10277 | #define RECUR(NODE) \ |
10278 | tsubst_expr ((NODE), args, complain, in_decl, \ | |
10279 | integral_constant_expression_p) | |
10280 | ||
fd10dd09 | 10281 | tree stmt, tmp; |
558475f0 | 10282 | |
5566b478 MS |
10283 | if (t == NULL_TREE || t == error_mark_node) |
10284 | return t; | |
10285 | ||
93409b8c PB |
10286 | if (EXPR_HAS_LOCATION (t)) |
10287 | input_location = EXPR_LOCATION (t); | |
7c34ced1 RH |
10288 | if (STATEMENT_CODE_P (TREE_CODE (t))) |
10289 | current_stmt_tree ()->stmts_are_full_exprs_p = STMT_IS_FULL_EXPR_P (t); | |
10290 | ||
5566b478 | 10291 | switch (TREE_CODE (t)) |
8d08fdba | 10292 | { |
325c3691 RH |
10293 | case STATEMENT_LIST: |
10294 | { | |
10295 | tree_stmt_iterator i; | |
10296 | for (i = tsi_start (t); !tsi_end_p (i); tsi_next (&i)) | |
015c2c66 | 10297 | RECUR (tsi_stmt (i)); |
325c3691 RH |
10298 | break; |
10299 | } | |
10300 | ||
558475f0 | 10301 | case CTOR_INITIALIZER: |
c8094d83 | 10302 | finish_mem_initializers (tsubst_initializer_list |
2282d28d MM |
10303 | (TREE_OPERAND (t, 0), args)); |
10304 | break; | |
558475f0 | 10305 | |
5088b058 | 10306 | case RETURN_EXPR: |
015c2c66 | 10307 | finish_return_stmt (RECUR (TREE_OPERAND (t, 0))); |
5566b478 MS |
10308 | break; |
10309 | ||
10310 | case EXPR_STMT: | |
015c2c66 | 10311 | tmp = RECUR (EXPR_STMT_EXPR (t)); |
7c34ced1 RH |
10312 | if (EXPR_STMT_STMT_EXPR_RESULT (t)) |
10313 | finish_stmt_expr_expr (tmp, cur_stmt_expr); | |
10314 | else | |
10315 | finish_expr_stmt (tmp); | |
10316 | break; | |
5566b478 | 10317 | |
9da99f7d | 10318 | case USING_STMT: |
015c2c66 | 10319 | do_using_directive (RECUR (USING_STMT_NAMESPACE (t))); |
9da99f7d | 10320 | break; |
c8094d83 | 10321 | |
350fae66 | 10322 | case DECL_EXPR: |
5566b478 | 10323 | { |
e0942dcd MM |
10324 | tree decl; |
10325 | tree init; | |
5566b478 | 10326 | |
350fae66 | 10327 | decl = DECL_EXPR_DECL (t); |
acef433b MM |
10328 | if (TREE_CODE (decl) == LABEL_DECL) |
10329 | finish_label_decl (DECL_NAME (decl)); | |
fbfe8c9e NS |
10330 | else if (TREE_CODE (decl) == USING_DECL) |
10331 | { | |
98ed9dae | 10332 | tree scope = USING_DECL_SCOPE (decl); |
fbfe8c9e | 10333 | tree name = DECL_NAME (decl); |
22038b2c | 10334 | tree decl; |
c8094d83 | 10335 | |
015c2c66 | 10336 | scope = RECUR (scope); |
22038b2c | 10337 | decl = lookup_qualified_name (scope, name, |
12483c9f NS |
10338 | /*is_type_p=*/false, |
10339 | /*complain=*/false); | |
8f78f01f MM |
10340 | if (decl == error_mark_node || TREE_CODE (decl) == TREE_LIST) |
10341 | qualified_name_lookup_error (scope, name, decl); | |
22038b2c | 10342 | else |
ed5f054f | 10343 | do_local_using_decl (decl, scope, name); |
fbfe8c9e | 10344 | } |
acef433b MM |
10345 | else |
10346 | { | |
10347 | init = DECL_INITIAL (decl); | |
10348 | decl = tsubst (decl, args, complain, in_decl); | |
ce2e5191 NS |
10349 | if (decl != error_mark_node) |
10350 | { | |
0cbd7506 MS |
10351 | /* By marking the declaration as instantiated, we avoid |
10352 | trying to instantiate it. Since instantiate_decl can't | |
10353 | handle local variables, and since we've already done | |
10354 | all that needs to be done, that's the right thing to | |
10355 | do. */ | |
10356 | if (TREE_CODE (decl) == VAR_DECL) | |
10357 | DECL_TEMPLATE_INSTANTIATED (decl) = 1; | |
edebf865 MM |
10358 | if (TREE_CODE (decl) == VAR_DECL |
10359 | && ANON_AGGR_TYPE_P (TREE_TYPE (decl))) | |
10360 | /* Anonymous aggregates are a special case. */ | |
10361 | finish_anon_union (decl); | |
c8094d83 | 10362 | else |
ed2fa432 | 10363 | { |
edebf865 | 10364 | maybe_push_decl (decl); |
39703eb9 MM |
10365 | if (TREE_CODE (decl) == VAR_DECL |
10366 | && DECL_PRETTY_FUNCTION_P (decl)) | |
edebf865 MM |
10367 | { |
10368 | /* For __PRETTY_FUNCTION__ we have to adjust the | |
10369 | initializer. */ | |
10370 | const char *const name | |
10371 | = cxx_printable_name (current_function_decl, 2); | |
bb885938 | 10372 | init = cp_fname_init (name, &TREE_TYPE (decl)); |
edebf865 MM |
10373 | } |
10374 | else | |
268127ce DG |
10375 | { |
10376 | tree t = RECUR (init); | |
10377 | ||
10378 | if (init && !t) | |
10379 | /* If we had an initializer but it | |
10380 | instantiated to nothing, | |
10381 | value-initialize the object. This will | |
10382 | only occur when the initializer was a | |
10383 | pack expansion where the parameter packs | |
10384 | used in that expansion were of length | |
10385 | zero. */ | |
10386 | init = build_default_init (TREE_TYPE (decl), | |
10387 | NULL_TREE); | |
10388 | else | |
10389 | init = t; | |
10390 | } | |
10391 | ||
d174af6c | 10392 | finish_decl (decl, init, NULL_TREE); |
ed2fa432 | 10393 | } |
ce2e5191 | 10394 | } |
acef433b | 10395 | } |
fd10dd09 | 10396 | |
350fae66 | 10397 | /* A DECL_EXPR can also be used as an expression, in the condition |
325c3691 RH |
10398 | clause of an if/for/while construct. */ |
10399 | return decl; | |
5566b478 | 10400 | } |
8d08fdba | 10401 | |
5566b478 | 10402 | case FOR_STMT: |
7c34ced1 | 10403 | stmt = begin_for_stmt (); |
015c2c66 | 10404 | RECUR (FOR_INIT_STMT (t)); |
7c34ced1 | 10405 | finish_for_init_stmt (stmt); |
015c2c66 | 10406 | tmp = RECUR (FOR_COND (t)); |
7c34ced1 | 10407 | finish_for_cond (tmp, stmt); |
015c2c66 | 10408 | tmp = RECUR (FOR_EXPR (t)); |
7c34ced1 | 10409 | finish_for_expr (tmp, stmt); |
015c2c66 | 10410 | RECUR (FOR_BODY (t)); |
7c34ced1 | 10411 | finish_for_stmt (stmt); |
5566b478 | 10412 | break; |
8d08fdba | 10413 | |
5566b478 | 10414 | case WHILE_STMT: |
7c34ced1 | 10415 | stmt = begin_while_stmt (); |
015c2c66 | 10416 | tmp = RECUR (WHILE_COND (t)); |
7c34ced1 | 10417 | finish_while_stmt_cond (tmp, stmt); |
015c2c66 | 10418 | RECUR (WHILE_BODY (t)); |
7c34ced1 | 10419 | finish_while_stmt (stmt); |
5566b478 | 10420 | break; |
8d08fdba | 10421 | |
5566b478 | 10422 | case DO_STMT: |
7c34ced1 | 10423 | stmt = begin_do_stmt (); |
015c2c66 | 10424 | RECUR (DO_BODY (t)); |
7c34ced1 | 10425 | finish_do_body (stmt); |
015c2c66 | 10426 | tmp = RECUR (DO_COND (t)); |
7c34ced1 | 10427 | finish_do_stmt (tmp, stmt); |
5566b478 | 10428 | break; |
a0a33927 | 10429 | |
5566b478 | 10430 | case IF_STMT: |
7c34ced1 | 10431 | stmt = begin_if_stmt (); |
015c2c66 | 10432 | tmp = RECUR (IF_COND (t)); |
7c34ced1 | 10433 | finish_if_stmt_cond (tmp, stmt); |
015c2c66 | 10434 | RECUR (THEN_CLAUSE (t)); |
7c34ced1 | 10435 | finish_then_clause (stmt); |
8d08fdba | 10436 | |
7c34ced1 RH |
10437 | if (ELSE_CLAUSE (t)) |
10438 | { | |
10439 | begin_else_clause (stmt); | |
015c2c66 | 10440 | RECUR (ELSE_CLAUSE (t)); |
7c34ced1 RH |
10441 | finish_else_clause (stmt); |
10442 | } | |
10443 | ||
10444 | finish_if_stmt (stmt); | |
5566b478 | 10445 | break; |
8d08fdba | 10446 | |
5882f0f3 | 10447 | case BIND_EXPR: |
7c34ced1 RH |
10448 | if (BIND_EXPR_BODY_BLOCK (t)) |
10449 | stmt = begin_function_body (); | |
10450 | else | |
10451 | stmt = begin_compound_stmt (BIND_EXPR_TRY_BLOCK (t) | |
10452 | ? BCS_TRY_BLOCK : 0); | |
ade3dc07 | 10453 | |
015c2c66 | 10454 | RECUR (BIND_EXPR_BODY (t)); |
ade3dc07 | 10455 | |
7c34ced1 RH |
10456 | if (BIND_EXPR_BODY_BLOCK (t)) |
10457 | finish_function_body (stmt); | |
10458 | else | |
10459 | finish_compound_stmt (stmt); | |
5566b478 | 10460 | break; |
8d08fdba | 10461 | |
5566b478 | 10462 | case BREAK_STMT: |
ad321293 | 10463 | finish_break_stmt (); |
5566b478 | 10464 | break; |
8d08fdba | 10465 | |
6467930b | 10466 | case CONTINUE_STMT: |
ad321293 | 10467 | finish_continue_stmt (); |
6467930b MS |
10468 | break; |
10469 | ||
5566b478 | 10470 | case SWITCH_STMT: |
7c34ced1 | 10471 | stmt = begin_switch_stmt (); |
015c2c66 | 10472 | tmp = RECUR (SWITCH_STMT_COND (t)); |
7c34ced1 | 10473 | finish_switch_cond (tmp, stmt); |
015c2c66 | 10474 | RECUR (SWITCH_STMT_BODY (t)); |
7c34ced1 | 10475 | finish_switch_stmt (stmt); |
5566b478 MS |
10476 | break; |
10477 | ||
8c161995 | 10478 | case CASE_LABEL_EXPR: |
015c2c66 MM |
10479 | finish_case_label (RECUR (CASE_LOW (t)), |
10480 | RECUR (CASE_HIGH (t))); | |
5566b478 MS |
10481 | break; |
10482 | ||
9e14e18f | 10483 | case LABEL_EXPR: |
9e14e18f | 10484 | finish_label_stmt (DECL_NAME (LABEL_EXPR_LABEL (t))); |
5566b478 MS |
10485 | break; |
10486 | ||
9e14e18f | 10487 | case GOTO_EXPR: |
fd10dd09 JM |
10488 | tmp = GOTO_DESTINATION (t); |
10489 | if (TREE_CODE (tmp) != LABEL_DECL) | |
aa09da44 MM |
10490 | /* Computed goto's must be tsubst'd into. On the other hand, |
10491 | non-computed gotos must not be; the identifier in question | |
10492 | will have no binding. */ | |
015c2c66 | 10493 | tmp = RECUR (tmp); |
3fa56191 | 10494 | else |
fd10dd09 JM |
10495 | tmp = DECL_NAME (tmp); |
10496 | finish_goto_stmt (tmp); | |
ad321293 MM |
10497 | break; |
10498 | ||
e130a54b | 10499 | case ASM_EXPR: |
c87978aa | 10500 | tmp = finish_asm_stmt |
6de9cd9a | 10501 | (ASM_VOLATILE_P (t), |
015c2c66 | 10502 | RECUR (ASM_STRING (t)), |
f74dcfb7 JJ |
10503 | tsubst_copy_asm_operands (ASM_OUTPUTS (t), args, complain, in_decl), |
10504 | tsubst_copy_asm_operands (ASM_INPUTS (t), args, complain, in_decl), | |
10505 | tsubst_copy_asm_operands (ASM_CLOBBERS (t), args, complain, in_decl)); | |
131263fa AP |
10506 | { |
10507 | tree asm_expr = tmp; | |
10508 | if (TREE_CODE (asm_expr) == CLEANUP_POINT_EXPR) | |
10509 | asm_expr = TREE_OPERAND (asm_expr, 0); | |
10510 | ASM_INPUT_P (asm_expr) = ASM_INPUT_P (t); | |
10511 | } | |
5566b478 | 10512 | break; |
faf5394a MS |
10513 | |
10514 | case TRY_BLOCK: | |
f1dedc31 | 10515 | if (CLEANUP_P (t)) |
62409b39 | 10516 | { |
57b52417 | 10517 | stmt = begin_try_block (); |
015c2c66 | 10518 | RECUR (TRY_STMTS (t)); |
62409b39 | 10519 | finish_cleanup_try_block (stmt); |
015c2c66 | 10520 | finish_cleanup (RECUR (TRY_HANDLERS (t)), stmt); |
62409b39 | 10521 | } |
f1dedc31 MM |
10522 | else |
10523 | { | |
eaf6fb90 MM |
10524 | tree compound_stmt = NULL_TREE; |
10525 | ||
62409b39 | 10526 | if (FN_TRY_BLOCK_P (t)) |
eaf6fb90 | 10527 | stmt = begin_function_try_block (&compound_stmt); |
62409b39 MM |
10528 | else |
10529 | stmt = begin_try_block (); | |
10530 | ||
015c2c66 | 10531 | RECUR (TRY_STMTS (t)); |
62409b39 MM |
10532 | |
10533 | if (FN_TRY_BLOCK_P (t)) | |
10534 | finish_function_try_block (stmt); | |
10535 | else | |
10536 | finish_try_block (stmt); | |
10537 | ||
015c2c66 | 10538 | RECUR (TRY_HANDLERS (t)); |
84df082b | 10539 | if (FN_TRY_BLOCK_P (t)) |
eaf6fb90 | 10540 | finish_function_handler_sequence (stmt, compound_stmt); |
84df082b MM |
10541 | else |
10542 | finish_handler_sequence (stmt); | |
f1dedc31 | 10543 | } |
faf5394a | 10544 | break; |
c8094d83 | 10545 | |
faf5394a | 10546 | case HANDLER: |
b35d4555 | 10547 | { |
3a2419a7 | 10548 | tree decl = HANDLER_PARMS (t); |
b35d4555 | 10549 | |
3a2419a7 | 10550 | if (decl) |
b35d4555 | 10551 | { |
b35d4555 | 10552 | decl = tsubst (decl, args, complain, in_decl); |
f8191e64 MM |
10553 | /* Prevent instantiate_decl from trying to instantiate |
10554 | this variable. We've already done all that needs to be | |
10555 | done. */ | |
3a2419a7 VR |
10556 | if (decl != error_mark_node) |
10557 | DECL_TEMPLATE_INSTANTIATED (decl) = 1; | |
b35d4555 | 10558 | } |
3a2419a7 | 10559 | stmt = begin_handler (); |
1a6025b4 | 10560 | finish_handler_parms (decl, stmt); |
015c2c66 | 10561 | RECUR (HANDLER_BODY (t)); |
1a6025b4 | 10562 | finish_handler (stmt); |
b35d4555 | 10563 | } |
faf5394a MS |
10564 | break; |
10565 | ||
b87692e5 | 10566 | case TAG_DEFN: |
fd10dd09 | 10567 | tsubst (TREE_TYPE (t), args, complain, NULL_TREE); |
b87692e5 | 10568 | break; |
55a3debe DG |
10569 | |
10570 | case STATIC_ASSERT: | |
10571 | { | |
10572 | tree condition = | |
10573 | tsubst_expr (STATIC_ASSERT_CONDITION (t), | |
10574 | args, | |
10575 | complain, in_decl, | |
10576 | /*integral_constant_expression_p=*/true); | |
10577 | finish_static_assert (condition, | |
10578 | STATIC_ASSERT_MESSAGE (t), | |
10579 | STATIC_ASSERT_SOURCE_LOCATION (t), | |
10580 | /*member_p=*/false); | |
10581 | } | |
10582 | break; | |
b87692e5 | 10583 | |
1799e5d5 RH |
10584 | case OMP_PARALLEL: |
10585 | tmp = tsubst_omp_clauses (OMP_PARALLEL_CLAUSES (t), | |
10586 | args, complain, in_decl); | |
10587 | stmt = begin_omp_parallel (); | |
015c2c66 | 10588 | RECUR (OMP_PARALLEL_BODY (t)); |
761041be JJ |
10589 | OMP_PARALLEL_COMBINED (finish_omp_parallel (tmp, stmt)) |
10590 | = OMP_PARALLEL_COMBINED (t); | |
1799e5d5 RH |
10591 | break; |
10592 | ||
10593 | case OMP_FOR: | |
10594 | { | |
10595 | tree clauses, decl, init, cond, incr, body, pre_body; | |
10596 | ||
10597 | clauses = tsubst_omp_clauses (OMP_FOR_CLAUSES (t), | |
10598 | args, complain, in_decl); | |
10599 | init = OMP_FOR_INIT (t); | |
10600 | gcc_assert (TREE_CODE (init) == MODIFY_EXPR); | |
015c2c66 MM |
10601 | decl = RECUR (TREE_OPERAND (init, 0)); |
10602 | init = RECUR (TREE_OPERAND (init, 1)); | |
10603 | cond = RECUR (OMP_FOR_COND (t)); | |
10604 | incr = RECUR (OMP_FOR_INCR (t)); | |
1799e5d5 RH |
10605 | |
10606 | stmt = begin_omp_structured_block (); | |
10607 | ||
10608 | pre_body = push_stmt_list (); | |
015c2c66 | 10609 | RECUR (OMP_FOR_PRE_BODY (t)); |
1799e5d5 RH |
10610 | pre_body = pop_stmt_list (pre_body); |
10611 | ||
10612 | body = push_stmt_list (); | |
015c2c66 | 10613 | RECUR (OMP_FOR_BODY (t)); |
1799e5d5 RH |
10614 | body = pop_stmt_list (body); |
10615 | ||
10616 | t = finish_omp_for (EXPR_LOCATION (t), decl, init, cond, incr, body, | |
10617 | pre_body); | |
10618 | if (t) | |
10619 | OMP_FOR_CLAUSES (t) = clauses; | |
10620 | ||
10621 | add_stmt (finish_omp_structured_block (stmt)); | |
10622 | } | |
10623 | break; | |
10624 | ||
10625 | case OMP_SECTIONS: | |
10626 | case OMP_SINGLE: | |
10627 | tmp = tsubst_omp_clauses (OMP_CLAUSES (t), args, complain, in_decl); | |
10628 | stmt = push_stmt_list (); | |
015c2c66 | 10629 | RECUR (OMP_BODY (t)); |
1799e5d5 RH |
10630 | stmt = pop_stmt_list (stmt); |
10631 | ||
10632 | t = copy_node (t); | |
10633 | OMP_BODY (t) = stmt; | |
10634 | OMP_CLAUSES (t) = tmp; | |
10635 | add_stmt (t); | |
10636 | break; | |
10637 | ||
10638 | case OMP_SECTION: | |
10639 | case OMP_CRITICAL: | |
10640 | case OMP_MASTER: | |
10641 | case OMP_ORDERED: | |
10642 | stmt = push_stmt_list (); | |
015c2c66 | 10643 | RECUR (OMP_BODY (t)); |
1799e5d5 RH |
10644 | stmt = pop_stmt_list (stmt); |
10645 | ||
10646 | t = copy_node (t); | |
10647 | OMP_BODY (t) = stmt; | |
10648 | add_stmt (t); | |
10649 | break; | |
10650 | ||
10651 | case OMP_ATOMIC: | |
239371f9 JJ |
10652 | gcc_assert (OMP_ATOMIC_DEPENDENT_P (t)); |
10653 | { | |
10654 | tree op1 = TREE_OPERAND (t, 1); | |
10655 | tree lhs = RECUR (TREE_OPERAND (op1, 0)); | |
10656 | tree rhs = RECUR (TREE_OPERAND (op1, 1)); | |
10657 | finish_omp_atomic (TREE_CODE (op1), lhs, rhs); | |
10658 | } | |
1799e5d5 RH |
10659 | break; |
10660 | ||
5d80a306 DG |
10661 | case EXPR_PACK_EXPANSION: |
10662 | error ("invalid use of pack expansion expression"); | |
10663 | return error_mark_node; | |
10664 | ||
10665 | case NONTYPE_ARGUMENT_PACK: | |
10666 | error ("use %<...%> to expand argument pack"); | |
10667 | return error_mark_node; | |
10668 | ||
5566b478 | 10669 | default: |
315fb5db | 10670 | gcc_assert (!STATEMENT_CODE_P (TREE_CODE (t))); |
c8094d83 | 10671 | |
315fb5db | 10672 | return tsubst_copy_and_build (t, args, complain, in_decl, |
015c2c66 MM |
10673 | /*function_p=*/false, |
10674 | integral_constant_expression_p); | |
5566b478 | 10675 | } |
fd10dd09 | 10676 | |
325c3691 | 10677 | return NULL_TREE; |
015c2c66 | 10678 | #undef RECUR |
8d08fdba MS |
10679 | } |
10680 | ||
b3445994 MM |
10681 | /* T is a postfix-expression that is not being used in a function |
10682 | call. Return the substituted version of T. */ | |
10683 | ||
10684 | static tree | |
c8094d83 | 10685 | tsubst_non_call_postfix_expression (tree t, tree args, |
b3445994 MM |
10686 | tsubst_flags_t complain, |
10687 | tree in_decl) | |
10688 | { | |
10689 | if (TREE_CODE (t) == SCOPE_REF) | |
10690 | t = tsubst_qualified_id (t, args, complain, in_decl, | |
10691 | /*done=*/false, /*address_p=*/false); | |
10692 | else | |
10693 | t = tsubst_copy_and_build (t, args, complain, in_decl, | |
015c2c66 MM |
10694 | /*function_p=*/false, |
10695 | /*integral_constant_expression_p=*/false); | |
b3445994 MM |
10696 | |
10697 | return t; | |
10698 | } | |
10699 | ||
cc23546e | 10700 | /* Like tsubst but deals with expressions and performs semantic |
b3445994 | 10701 | analysis. FUNCTION_P is true if T is the "F" in "F (ARGS)". */ |
cc23546e | 10702 | |
ee76b931 | 10703 | tree |
c8094d83 | 10704 | tsubst_copy_and_build (tree t, |
0cbd7506 MS |
10705 | tree args, |
10706 | tsubst_flags_t complain, | |
10707 | tree in_decl, | |
015c2c66 MM |
10708 | bool function_p, |
10709 | bool integral_constant_expression_p) | |
cc23546e | 10710 | { |
015c2c66 MM |
10711 | #define RECUR(NODE) \ |
10712 | tsubst_copy_and_build (NODE, args, complain, in_decl, \ | |
10713 | /*function_p=*/false, \ | |
10714 | integral_constant_expression_p) | |
b3445994 | 10715 | |
ee76b931 MM |
10716 | tree op1; |
10717 | ||
cc23546e JO |
10718 | if (t == NULL_TREE || t == error_mark_node) |
10719 | return t; | |
10720 | ||
10721 | switch (TREE_CODE (t)) | |
10722 | { | |
399dedb9 NS |
10723 | case USING_DECL: |
10724 | t = DECL_NAME (t); | |
852dcbdd | 10725 | /* Fall through. */ |
b3445994 | 10726 | case IDENTIFIER_NODE: |
cc23546e | 10727 | { |
b3445994 | 10728 | tree decl; |
b3445994 | 10729 | cp_id_kind idk; |
67c03833 | 10730 | bool non_integral_constant_expression_p; |
b3445994 MM |
10731 | const char *error_msg; |
10732 | ||
b3445994 | 10733 | if (IDENTIFIER_TYPENAME_P (t)) |
cc23546e | 10734 | { |
b3445994 MM |
10735 | tree new_type = tsubst (TREE_TYPE (t), args, complain, in_decl); |
10736 | t = mangle_conv_op_name_for_type (new_type); | |
cc23546e | 10737 | } |
b3445994 MM |
10738 | |
10739 | /* Look up the name. */ | |
10e6657a | 10740 | decl = lookup_name (t); |
b3445994 MM |
10741 | |
10742 | /* By convention, expressions use ERROR_MARK_NODE to indicate | |
10743 | failure, not NULL_TREE. */ | |
10744 | if (decl == NULL_TREE) | |
10745 | decl = error_mark_node; | |
10746 | ||
10b1d5e7 | 10747 | decl = finish_id_expression (t, decl, NULL_TREE, |
b3445994 | 10748 | &idk, |
015c2c66 | 10749 | integral_constant_expression_p, |
67c03833 JM |
10750 | /*allow_non_integral_constant_expression_p=*/false, |
10751 | &non_integral_constant_expression_p, | |
02ed62dd MM |
10752 | /*template_p=*/false, |
10753 | /*done=*/true, | |
10754 | /*address_p=*/false, | |
10755 | /*template_arg_p=*/false, | |
b3445994 MM |
10756 | &error_msg); |
10757 | if (error_msg) | |
10758 | error (error_msg); | |
10759 | if (!function_p && TREE_CODE (decl) == IDENTIFIER_NODE) | |
10760 | decl = unqualified_name_lookup_error (decl); | |
10761 | return decl; | |
cc23546e JO |
10762 | } |
10763 | ||
10764 | case TEMPLATE_ID_EXPR: | |
10765 | { | |
10766 | tree object; | |
b3445994 | 10767 | tree template = RECUR (TREE_OPERAND (t, 0)); |
bf12d54d NS |
10768 | tree targs = TREE_OPERAND (t, 1); |
10769 | ||
10770 | if (targs) | |
10771 | targs = tsubst_template_args (targs, args, complain, in_decl); | |
c8094d83 | 10772 | |
cc23546e JO |
10773 | if (TREE_CODE (template) == COMPONENT_REF) |
10774 | { | |
10775 | object = TREE_OPERAND (template, 0); | |
10776 | template = TREE_OPERAND (template, 1); | |
10777 | } | |
10778 | else | |
10779 | object = NULL_TREE; | |
bd83b409 | 10780 | template = lookup_template_function (template, targs); |
c8094d83 | 10781 | |
cc23546e | 10782 | if (object) |
c8094d83 | 10783 | return build3 (COMPONENT_REF, TREE_TYPE (template), |
f293ce4b | 10784 | object, template, NULL_TREE); |
cc23546e | 10785 | else |
eff3a276 | 10786 | return baselink_for_fns (template); |
cc23546e JO |
10787 | } |
10788 | ||
10789 | case INDIRECT_REF: | |
db24eb1f NS |
10790 | { |
10791 | tree r = RECUR (TREE_OPERAND (t, 0)); | |
10792 | ||
10793 | if (REFERENCE_REF_P (t)) | |
10794 | { | |
e8c66fe0 NS |
10795 | /* A type conversion to reference type will be enclosed in |
10796 | such an indirect ref, but the substitution of the cast | |
10797 | will have also added such an indirect ref. */ | |
10798 | if (TREE_CODE (TREE_TYPE (r)) == REFERENCE_TYPE) | |
10799 | r = convert_from_reference (r); | |
db24eb1f NS |
10800 | } |
10801 | else | |
5ade1ed2 | 10802 | r = build_x_indirect_ref (r, "unary *", complain); |
db24eb1f NS |
10803 | return r; |
10804 | } | |
cc23546e | 10805 | |
0da99d4e GB |
10806 | case NOP_EXPR: |
10807 | return build_nop | |
10808 | (tsubst (TREE_TYPE (t), args, complain, in_decl), | |
10809 | RECUR (TREE_OPERAND (t, 0))); | |
10810 | ||
cc23546e | 10811 | case CAST_EXPR: |
cc23546e | 10812 | case REINTERPRET_CAST_EXPR: |
cc23546e | 10813 | case CONST_CAST_EXPR: |
cc23546e | 10814 | case DYNAMIC_CAST_EXPR: |
cc23546e | 10815 | case STATIC_CAST_EXPR: |
015c2c66 MM |
10816 | { |
10817 | tree type; | |
10818 | tree op; | |
10819 | ||
10820 | type = tsubst (TREE_TYPE (t), args, complain, in_decl); | |
10821 | if (integral_constant_expression_p | |
10822 | && !cast_valid_in_integral_constant_expression_p (type)) | |
10823 | { | |
5ade1ed2 DG |
10824 | if (complain & tf_error) |
10825 | error ("a cast to a type other than an integral or " | |
10826 | "enumeration type cannot appear in a constant-expression"); | |
015c2c66 MM |
10827 | return error_mark_node; |
10828 | } | |
10829 | ||
10830 | op = RECUR (TREE_OPERAND (t, 0)); | |
10831 | ||
10832 | switch (TREE_CODE (t)) | |
10833 | { | |
10834 | case CAST_EXPR: | |
5ade1ed2 | 10835 | return build_functional_cast (type, op, complain); |
015c2c66 | 10836 | case REINTERPRET_CAST_EXPR: |
5ade1ed2 | 10837 | return build_reinterpret_cast (type, op, complain); |
015c2c66 | 10838 | case CONST_CAST_EXPR: |
5ade1ed2 | 10839 | return build_const_cast (type, op, complain); |
015c2c66 | 10840 | case DYNAMIC_CAST_EXPR: |
5ade1ed2 | 10841 | return build_dynamic_cast (type, op, complain); |
015c2c66 | 10842 | case STATIC_CAST_EXPR: |
5ade1ed2 | 10843 | return build_static_cast (type, op, complain); |
015c2c66 MM |
10844 | default: |
10845 | gcc_unreachable (); | |
10846 | } | |
10847 | } | |
cc23546e | 10848 | |
cc23546e JO |
10849 | case POSTDECREMENT_EXPR: |
10850 | case POSTINCREMENT_EXPR: | |
b3445994 MM |
10851 | op1 = tsubst_non_call_postfix_expression (TREE_OPERAND (t, 0), |
10852 | args, complain, in_decl); | |
5ade1ed2 | 10853 | return build_x_unary_op (TREE_CODE (t), op1, complain); |
ee76b931 MM |
10854 | |
10855 | case PREDECREMENT_EXPR: | |
10856 | case PREINCREMENT_EXPR: | |
cc23546e JO |
10857 | case NEGATE_EXPR: |
10858 | case BIT_NOT_EXPR: | |
cc23546e | 10859 | case ABS_EXPR: |
d17811fd | 10860 | case TRUTH_NOT_EXPR: |
392e3d51 | 10861 | case UNARY_PLUS_EXPR: /* Unary + */ |
d17811fd MM |
10862 | case REALPART_EXPR: |
10863 | case IMAGPART_EXPR: | |
5ade1ed2 DG |
10864 | return build_x_unary_op (TREE_CODE (t), RECUR (TREE_OPERAND (t, 0)), |
10865 | complain); | |
cc23546e | 10866 | |
cc23546e | 10867 | case ADDR_EXPR: |
ee76b931 MM |
10868 | op1 = TREE_OPERAND (t, 0); |
10869 | if (TREE_CODE (op1) == SCOPE_REF) | |
c8094d83 | 10870 | op1 = tsubst_qualified_id (op1, args, complain, in_decl, |
ee76b931 MM |
10871 | /*done=*/true, /*address_p=*/true); |
10872 | else | |
c8094d83 | 10873 | op1 = tsubst_non_call_postfix_expression (op1, args, complain, |
b3445994 | 10874 | in_decl); |
fc2b8477 MM |
10875 | if (TREE_CODE (op1) == LABEL_DECL) |
10876 | return finish_label_address_expr (DECL_NAME (op1)); | |
5ade1ed2 | 10877 | return build_x_unary_op (ADDR_EXPR, op1, complain); |
ee76b931 | 10878 | |
cc23546e JO |
10879 | case PLUS_EXPR: |
10880 | case MINUS_EXPR: | |
10881 | case MULT_EXPR: | |
10882 | case TRUNC_DIV_EXPR: | |
10883 | case CEIL_DIV_EXPR: | |
10884 | case FLOOR_DIV_EXPR: | |
10885 | case ROUND_DIV_EXPR: | |
10886 | case EXACT_DIV_EXPR: | |
10887 | case BIT_AND_EXPR: | |
cc23546e JO |
10888 | case BIT_IOR_EXPR: |
10889 | case BIT_XOR_EXPR: | |
10890 | case TRUNC_MOD_EXPR: | |
10891 | case FLOOR_MOD_EXPR: | |
10892 | case TRUTH_ANDIF_EXPR: | |
10893 | case TRUTH_ORIF_EXPR: | |
10894 | case TRUTH_AND_EXPR: | |
10895 | case TRUTH_OR_EXPR: | |
10896 | case RSHIFT_EXPR: | |
10897 | case LSHIFT_EXPR: | |
10898 | case RROTATE_EXPR: | |
10899 | case LROTATE_EXPR: | |
10900 | case EQ_EXPR: | |
10901 | case NE_EXPR: | |
10902 | case MAX_EXPR: | |
10903 | case MIN_EXPR: | |
10904 | case LE_EXPR: | |
10905 | case GE_EXPR: | |
10906 | case LT_EXPR: | |
10907 | case GT_EXPR: | |
10908 | case MEMBER_REF: | |
b3445994 | 10909 | case DOTSTAR_EXPR: |
cc23546e | 10910 | return build_x_binary_op |
c8094d83 | 10911 | (TREE_CODE (t), |
b3445994 | 10912 | RECUR (TREE_OPERAND (t, 0)), |
2a67bec2 ILT |
10913 | (TREE_NO_WARNING (TREE_OPERAND (t, 0)) |
10914 | ? ERROR_MARK | |
10915 | : TREE_CODE (TREE_OPERAND (t, 0))), | |
ec835fb2 | 10916 | RECUR (TREE_OPERAND (t, 1)), |
2a67bec2 ILT |
10917 | (TREE_NO_WARNING (TREE_OPERAND (t, 1)) |
10918 | ? ERROR_MARK | |
10919 | : TREE_CODE (TREE_OPERAND (t, 1))), | |
5ade1ed2 DG |
10920 | /*overloaded_p=*/NULL, |
10921 | complain); | |
cc23546e JO |
10922 | |
10923 | case SCOPE_REF: | |
ee76b931 MM |
10924 | return tsubst_qualified_id (t, args, complain, in_decl, /*done=*/true, |
10925 | /*address_p=*/false); | |
cc23546e | 10926 | case ARRAY_REF: |
b3445994 MM |
10927 | op1 = tsubst_non_call_postfix_expression (TREE_OPERAND (t, 0), |
10928 | args, complain, in_decl); | |
2a67bec2 ILT |
10929 | return build_x_binary_op (ARRAY_REF, op1, |
10930 | (TREE_NO_WARNING (TREE_OPERAND (t, 0)) | |
10931 | ? ERROR_MARK | |
10932 | : TREE_CODE (TREE_OPERAND (t, 0))), | |
10933 | RECUR (TREE_OPERAND (t, 1)), | |
10934 | (TREE_NO_WARNING (TREE_OPERAND (t, 1)) | |
10935 | ? ERROR_MARK | |
10936 | : TREE_CODE (TREE_OPERAND (t, 1))), | |
5ade1ed2 DG |
10937 | /*overloaded_p=*/NULL, |
10938 | complain); | |
c8094d83 | 10939 | |
cc23546e | 10940 | case SIZEOF_EXPR: |
5d80a306 | 10941 | if (PACK_EXPANSION_P (TREE_OPERAND (t, 0))) |
063cc99c | 10942 | return tsubst_copy (t, args, complain, in_decl); |
5d80a306 DG |
10943 | /* Fall through */ |
10944 | ||
cc23546e | 10945 | case ALIGNOF_EXPR: |
d17811fd MM |
10946 | op1 = TREE_OPERAND (t, 0); |
10947 | if (!args) | |
10948 | { | |
10949 | /* When there are no ARGS, we are trying to evaluate a | |
10950 | non-dependent expression from the parser. Trying to do | |
10951 | the substitutions may not work. */ | |
10952 | if (!TYPE_P (op1)) | |
10953 | op1 = TREE_TYPE (op1); | |
10954 | } | |
10955 | else | |
10956 | { | |
10957 | ++skip_evaluation; | |
015c2c66 MM |
10958 | op1 = tsubst_copy_and_build (op1, args, complain, in_decl, |
10959 | /*function_p=*/false, | |
10960 | /*integral_constant_expression_p=*/false); | |
d17811fd MM |
10961 | --skip_evaluation; |
10962 | } | |
7a18b933 | 10963 | if (TYPE_P (op1)) |
5ade1ed2 DG |
10964 | return cxx_sizeof_or_alignof_type (op1, TREE_CODE (t), |
10965 | complain & tf_error); | |
d17811fd | 10966 | else |
5ade1ed2 DG |
10967 | return cxx_sizeof_or_alignof_expr (op1, TREE_CODE (t), |
10968 | complain & tf_error); | |
cc23546e JO |
10969 | |
10970 | case MODOP_EXPR: | |
e4c2c34b JM |
10971 | { |
10972 | tree r = build_x_modify_expr | |
10973 | (RECUR (TREE_OPERAND (t, 0)), | |
10974 | TREE_CODE (TREE_OPERAND (t, 1)), | |
5ade1ed2 DG |
10975 | RECUR (TREE_OPERAND (t, 2)), |
10976 | complain); | |
bcf9a914 JM |
10977 | /* TREE_NO_WARNING must be set if either the expression was |
10978 | parenthesized or it uses an operator such as >>= rather | |
10979 | than plain assignment. In the former case, it was already | |
10980 | set and must be copied. In the latter case, | |
10981 | build_x_modify_expr sets it and it must not be reset | |
10982 | here. */ | |
10983 | if (TREE_NO_WARNING (t)) | |
10984 | TREE_NO_WARNING (r) = TREE_NO_WARNING (t); | |
e4c2c34b JM |
10985 | return r; |
10986 | } | |
cc23546e JO |
10987 | |
10988 | case ARROW_EXPR: | |
b3445994 MM |
10989 | op1 = tsubst_non_call_postfix_expression (TREE_OPERAND (t, 0), |
10990 | args, complain, in_decl); | |
ee76b931 MM |
10991 | /* Remember that there was a reference to this entity. */ |
10992 | if (DECL_P (op1)) | |
10993 | mark_used (op1); | |
10994 | return build_x_arrow (op1); | |
cc23546e JO |
10995 | |
10996 | case NEW_EXPR: | |
268127ce DG |
10997 | { |
10998 | tree init = RECUR (TREE_OPERAND (t, 3)); | |
10999 | ||
11000 | if (TREE_OPERAND (t, 3) && !init) | |
11001 | /* If there was an initializer in the the original tree, but | |
11002 | it instantiated to an empty list, then we should pass on | |
11003 | VOID_ZERO_NODE to tell build_new that it was an empty | |
11004 | initializer () rather than no initializer. This can only | |
11005 | happen when the initializer is a pack expansion whose | |
11006 | parameter packs are of length zero. */ | |
11007 | init = void_zero_node; | |
11008 | ||
11009 | return build_new | |
11010 | (RECUR (TREE_OPERAND (t, 0)), | |
11011 | RECUR (TREE_OPERAND (t, 1)), | |
11012 | RECUR (TREE_OPERAND (t, 2)), | |
11013 | init, | |
5ade1ed2 DG |
11014 | NEW_EXPR_USE_GLOBAL (t), |
11015 | complain); | |
268127ce | 11016 | } |
cc23546e JO |
11017 | |
11018 | case DELETE_EXPR: | |
11019 | return delete_sanity | |
b3445994 MM |
11020 | (RECUR (TREE_OPERAND (t, 0)), |
11021 | RECUR (TREE_OPERAND (t, 1)), | |
cc23546e JO |
11022 | DELETE_EXPR_USE_VEC (t), |
11023 | DELETE_EXPR_USE_GLOBAL (t)); | |
11024 | ||
11025 | case COMPOUND_EXPR: | |
b3445994 | 11026 | return build_x_compound_expr (RECUR (TREE_OPERAND (t, 0)), |
5ade1ed2 DG |
11027 | RECUR (TREE_OPERAND (t, 1)), |
11028 | complain); | |
cc23546e | 11029 | |
ee76b931 | 11030 | case CALL_EXPR: |
cc23546e | 11031 | { |
ee76b931 MM |
11032 | tree function; |
11033 | tree call_args; | |
ee76b931 | 11034 | bool qualified_p; |
ee935db4 | 11035 | bool koenig_p; |
ee76b931 | 11036 | |
5039610b | 11037 | function = CALL_EXPR_FN (t); |
6d80c4b9 MM |
11038 | /* When we parsed the expression, we determined whether or |
11039 | not Koenig lookup should be performed. */ | |
11040 | koenig_p = KOENIG_LOOKUP_P (t); | |
ee76b931 | 11041 | if (TREE_CODE (function) == SCOPE_REF) |
cc23546e | 11042 | { |
ee76b931 MM |
11043 | qualified_p = true; |
11044 | function = tsubst_qualified_id (function, args, complain, in_decl, | |
c8094d83 | 11045 | /*done=*/false, |
ee76b931 | 11046 | /*address_p=*/false); |
cc23546e | 11047 | } |
ee76b931 | 11048 | else |
cc23546e | 11049 | { |
61e71a9e NS |
11050 | if (TREE_CODE (function) == COMPONENT_REF) |
11051 | { | |
11052 | tree op = TREE_OPERAND (function, 1); | |
11053 | ||
11054 | qualified_p = (TREE_CODE (op) == SCOPE_REF | |
11055 | || (BASELINK_P (op) | |
11056 | && BASELINK_QUALIFIED_P (op))); | |
11057 | } | |
11058 | else | |
11059 | qualified_p = false; | |
3db45ab5 | 11060 | |
c8094d83 | 11061 | function = tsubst_copy_and_build (function, args, complain, |
b3445994 | 11062 | in_decl, |
015c2c66 MM |
11063 | !qualified_p, |
11064 | integral_constant_expression_p); | |
11065 | ||
6d80c4b9 MM |
11066 | if (BASELINK_P (function)) |
11067 | qualified_p = true; | |
cc23546e | 11068 | } |
cc23546e | 11069 | |
5039610b SL |
11070 | /* FIXME: Rewrite this so as not to construct an arglist. */ |
11071 | call_args = RECUR (CALL_EXPR_ARGS (t)); | |
676e33ca MM |
11072 | |
11073 | /* We do not perform argument-dependent lookup if normal | |
11074 | lookup finds a non-function, in accordance with the | |
11075 | expected resolution of DR 218. */ | |
ee935db4 | 11076 | if (koenig_p |
44370687 MM |
11077 | && ((is_overloaded_fn (function) |
11078 | /* If lookup found a member function, the Koenig lookup is | |
11079 | not appropriate, even if an unqualified-name was used | |
11080 | to denote the function. */ | |
11081 | && !DECL_FUNCTION_MEMBER_P (get_first_fn (function))) | |
b3445994 | 11082 | || TREE_CODE (function) == IDENTIFIER_NODE)) |
6d80c4b9 MM |
11083 | function = perform_koenig_lookup (function, call_args); |
11084 | ||
11085 | if (TREE_CODE (function) == IDENTIFIER_NODE) | |
b3445994 | 11086 | { |
6d80c4b9 MM |
11087 | unqualified_name_lookup_error (function); |
11088 | return error_mark_node; | |
b3445994 MM |
11089 | } |
11090 | ||
11091 | /* Remember that there was a reference to this entity. */ | |
11092 | if (DECL_P (function)) | |
11093 | mark_used (function); | |
11094 | ||
d17811fd MM |
11095 | if (TREE_CODE (function) == OFFSET_REF) |
11096 | return build_offset_ref_call_from_tree (function, call_args); | |
11097 | if (TREE_CODE (function) == COMPONENT_REF) | |
9f880ef9 MM |
11098 | { |
11099 | if (!BASELINK_P (TREE_OPERAND (function, 1))) | |
11100 | return finish_call_expr (function, call_args, | |
11101 | /*disallow_virtual=*/false, | |
5ade1ed2 DG |
11102 | /*koenig_p=*/false, |
11103 | complain); | |
9f880ef9 | 11104 | else |
c8094d83 | 11105 | return (build_new_method_call |
9f880ef9 MM |
11106 | (TREE_OPERAND (function, 0), |
11107 | TREE_OPERAND (function, 1), | |
c8094d83 | 11108 | call_args, NULL_TREE, |
63c9a190 | 11109 | qualified_p ? LOOKUP_NONVIRTUAL : LOOKUP_NORMAL, |
5ade1ed2 DG |
11110 | /*fn_p=*/NULL, |
11111 | complain)); | |
9f880ef9 | 11112 | } |
c8094d83 | 11113 | return finish_call_expr (function, call_args, |
6d80c4b9 | 11114 | /*disallow_virtual=*/qualified_p, |
5ade1ed2 DG |
11115 | koenig_p, |
11116 | complain); | |
cc23546e JO |
11117 | } |
11118 | ||
11119 | case COND_EXPR: | |
11120 | return build_x_conditional_expr | |
b3445994 MM |
11121 | (RECUR (TREE_OPERAND (t, 0)), |
11122 | RECUR (TREE_OPERAND (t, 1)), | |
5ade1ed2 DG |
11123 | RECUR (TREE_OPERAND (t, 2)), |
11124 | complain); | |
cc23546e JO |
11125 | |
11126 | case PSEUDO_DTOR_EXPR: | |
c8094d83 | 11127 | return finish_pseudo_destructor_expr |
b3445994 MM |
11128 | (RECUR (TREE_OPERAND (t, 0)), |
11129 | RECUR (TREE_OPERAND (t, 1)), | |
11130 | RECUR (TREE_OPERAND (t, 2))); | |
cc23546e JO |
11131 | |
11132 | case TREE_LIST: | |
11133 | { | |
11134 | tree purpose, value, chain; | |
11135 | ||
11136 | if (t == void_list_node) | |
11137 | return t; | |
11138 | ||
5d80a306 DG |
11139 | if ((TREE_PURPOSE (t) && PACK_EXPANSION_P (TREE_PURPOSE (t))) |
11140 | || (TREE_VALUE (t) && PACK_EXPANSION_P (TREE_VALUE (t)))) | |
11141 | { | |
11142 | /* We have pack expansions, so expand those and | |
11143 | create a new list out of it. */ | |
11144 | tree purposevec = NULL_TREE; | |
11145 | tree valuevec = NULL_TREE; | |
11146 | tree chain; | |
11147 | int i, len = -1; | |
11148 | ||
11149 | /* Expand the argument expressions. */ | |
11150 | if (TREE_PURPOSE (t)) | |
11151 | purposevec = tsubst_pack_expansion (TREE_PURPOSE (t), args, | |
11152 | complain, in_decl); | |
11153 | if (TREE_VALUE (t)) | |
11154 | valuevec = tsubst_pack_expansion (TREE_VALUE (t), args, | |
11155 | complain, in_decl); | |
11156 | ||
11157 | /* Build the rest of the list. */ | |
11158 | chain = TREE_CHAIN (t); | |
11159 | if (chain && chain != void_type_node) | |
11160 | chain = RECUR (chain); | |
11161 | ||
11162 | /* Determine the number of arguments. */ | |
11163 | if (purposevec && TREE_CODE (purposevec) == TREE_VEC) | |
11164 | { | |
11165 | len = TREE_VEC_LENGTH (purposevec); | |
11166 | gcc_assert (!valuevec || len == TREE_VEC_LENGTH (valuevec)); | |
11167 | } | |
11168 | else if (TREE_CODE (valuevec) == TREE_VEC) | |
11169 | len = TREE_VEC_LENGTH (valuevec); | |
11170 | else | |
11171 | { | |
11172 | /* Since we only performed a partial substitution into | |
11173 | the argument pack, we only return a single list | |
11174 | node. */ | |
11175 | if (purposevec == TREE_PURPOSE (t) | |
11176 | && valuevec == TREE_VALUE (t) | |
11177 | && chain == TREE_CHAIN (t)) | |
11178 | return t; | |
11179 | ||
11180 | return tree_cons (purposevec, valuevec, chain); | |
11181 | } | |
11182 | ||
11183 | /* Convert the argument vectors into a TREE_LIST */ | |
11184 | i = len; | |
11185 | while (i > 0) | |
11186 | { | |
11187 | /* Grab the Ith values. */ | |
11188 | i--; | |
11189 | purpose = purposevec ? TREE_VEC_ELT (purposevec, i) | |
11190 | : NULL_TREE; | |
11191 | value | |
11192 | = valuevec ? convert_from_reference (TREE_VEC_ELT (valuevec, i)) | |
11193 | : NULL_TREE; | |
11194 | ||
11195 | /* Build the list (backwards). */ | |
11196 | chain = tree_cons (purpose, value, chain); | |
11197 | } | |
11198 | ||
11199 | return chain; | |
11200 | } | |
11201 | ||
cc23546e JO |
11202 | purpose = TREE_PURPOSE (t); |
11203 | if (purpose) | |
b3445994 | 11204 | purpose = RECUR (purpose); |
cc23546e JO |
11205 | value = TREE_VALUE (t); |
11206 | if (value) | |
b3445994 | 11207 | value = RECUR (value); |
cc23546e JO |
11208 | chain = TREE_CHAIN (t); |
11209 | if (chain && chain != void_type_node) | |
b3445994 | 11210 | chain = RECUR (chain); |
cc23546e JO |
11211 | if (purpose == TREE_PURPOSE (t) |
11212 | && value == TREE_VALUE (t) | |
11213 | && chain == TREE_CHAIN (t)) | |
11214 | return t; | |
11215 | return tree_cons (purpose, value, chain); | |
11216 | } | |
11217 | ||
11218 | case COMPONENT_REF: | |
11219 | { | |
ee76b931 | 11220 | tree object; |
3897c0aa | 11221 | tree object_type; |
ee76b931 MM |
11222 | tree member; |
11223 | ||
b3445994 MM |
11224 | object = tsubst_non_call_postfix_expression (TREE_OPERAND (t, 0), |
11225 | args, complain, in_decl); | |
ee76b931 MM |
11226 | /* Remember that there was a reference to this entity. */ |
11227 | if (DECL_P (object)) | |
11228 | mark_used (object); | |
3897c0aa | 11229 | object_type = TREE_TYPE (object); |
ee76b931 MM |
11230 | |
11231 | member = TREE_OPERAND (t, 1); | |
11232 | if (BASELINK_P (member)) | |
c8094d83 | 11233 | member = tsubst_baselink (member, |
ee76b931 MM |
11234 | non_reference (TREE_TYPE (object)), |
11235 | args, complain, in_decl); | |
11236 | else | |
11237 | member = tsubst_copy (member, args, complain, in_decl); | |
bad1f462 KL |
11238 | if (member == error_mark_node) |
11239 | return error_mark_node; | |
3897c0aa MM |
11240 | |
11241 | if (object_type && !CLASS_TYPE_P (object_type)) | |
cc23546e | 11242 | { |
3d9b2eb6 JJ |
11243 | if (SCALAR_TYPE_P (object_type)) |
11244 | { | |
11245 | tree s = NULL_TREE; | |
11246 | tree dtor = member; | |
11247 | ||
11248 | if (TREE_CODE (dtor) == SCOPE_REF) | |
11249 | { | |
11250 | s = TREE_OPERAND (dtor, 0); | |
11251 | dtor = TREE_OPERAND (dtor, 1); | |
11252 | } | |
11253 | if (TREE_CODE (dtor) == BIT_NOT_EXPR) | |
11254 | { | |
11255 | dtor = TREE_OPERAND (dtor, 0); | |
11256 | if (TYPE_P (dtor)) | |
11257 | return finish_pseudo_destructor_expr (object, s, dtor); | |
11258 | } | |
11259 | } | |
cc23546e JO |
11260 | } |
11261 | else if (TREE_CODE (member) == SCOPE_REF | |
11262 | && TREE_CODE (TREE_OPERAND (member, 1)) == TEMPLATE_ID_EXPR) | |
11263 | { | |
11264 | tree tmpl; | |
11265 | tree args; | |
c8094d83 | 11266 | |
cc23546e JO |
11267 | /* Lookup the template functions now that we know what the |
11268 | scope is. */ | |
11269 | tmpl = TREE_OPERAND (TREE_OPERAND (member, 1), 0); | |
11270 | args = TREE_OPERAND (TREE_OPERAND (member, 1), 1); | |
c8094d83 | 11271 | member = lookup_qualified_name (TREE_OPERAND (member, 0), tmpl, |
12483c9f NS |
11272 | /*is_type_p=*/false, |
11273 | /*complain=*/false); | |
cc23546e | 11274 | if (BASELINK_P (member)) |
44370687 | 11275 | { |
c8094d83 | 11276 | BASELINK_FUNCTIONS (member) |
44370687 MM |
11277 | = build_nt (TEMPLATE_ID_EXPR, BASELINK_FUNCTIONS (member), |
11278 | args); | |
c8094d83 MS |
11279 | member = (adjust_result_of_qualified_name_lookup |
11280 | (member, BINFO_TYPE (BASELINK_BINFO (member)), | |
3897c0aa | 11281 | object_type)); |
44370687 | 11282 | } |
cc23546e JO |
11283 | else |
11284 | { | |
3897c0aa | 11285 | qualified_name_lookup_error (object_type, tmpl, member); |
cc23546e JO |
11286 | return error_mark_node; |
11287 | } | |
11288 | } | |
2436b51f MM |
11289 | else if (TREE_CODE (member) == SCOPE_REF |
11290 | && !CLASS_TYPE_P (TREE_OPERAND (member, 0)) | |
11291 | && TREE_CODE (TREE_OPERAND (member, 0)) != NAMESPACE_DECL) | |
11292 | { | |
11293 | if (complain & tf_error) | |
11294 | { | |
11295 | if (TYPE_P (TREE_OPERAND (member, 0))) | |
c8094d83 | 11296 | error ("%qT is not a class or namespace", |
2436b51f MM |
11297 | TREE_OPERAND (member, 0)); |
11298 | else | |
c8094d83 | 11299 | error ("%qD is not a class or namespace", |
2436b51f MM |
11300 | TREE_OPERAND (member, 0)); |
11301 | } | |
11302 | return error_mark_node; | |
11303 | } | |
a3f10e50 NS |
11304 | else if (TREE_CODE (member) == FIELD_DECL) |
11305 | return finish_non_static_data_member (member, object, NULL_TREE); | |
cc23546e | 11306 | |
02ed62dd | 11307 | return finish_class_member_access_expr (object, member, |
5ade1ed2 DG |
11308 | /*template_p=*/false, |
11309 | complain); | |
cc23546e JO |
11310 | } |
11311 | ||
11312 | case THROW_EXPR: | |
11313 | return build_throw | |
b3445994 | 11314 | (RECUR (TREE_OPERAND (t, 0))); |
cc23546e JO |
11315 | |
11316 | case CONSTRUCTOR: | |
11317 | { | |
4038c495 GB |
11318 | VEC(constructor_elt,gc) *n; |
11319 | constructor_elt *ce; | |
11320 | unsigned HOST_WIDE_INT idx; | |
cc23546e | 11321 | tree type = tsubst (TREE_TYPE (t), args, complain, in_decl); |
4038c495 | 11322 | bool process_index_p; |
5d80a306 DG |
11323 | int newlen; |
11324 | bool need_copy_p = false; | |
cc23546e | 11325 | |
a97728cf VR |
11326 | if (type == error_mark_node) |
11327 | return error_mark_node; | |
11328 | ||
cc23546e JO |
11329 | /* digest_init will do the wrong thing if we let it. */ |
11330 | if (type && TYPE_PTRMEMFUNC_P (type)) | |
11331 | return t; | |
11332 | ||
4038c495 | 11333 | /* We do not want to process the index of aggregate |
cc23546e JO |
11334 | initializers as they are identifier nodes which will be |
11335 | looked up by digest_init. */ | |
9e1e64ec | 11336 | process_index_p = !(type && MAYBE_CLASS_TYPE_P (type)); |
c8094d83 | 11337 | |
4038c495 | 11338 | n = VEC_copy (constructor_elt, gc, CONSTRUCTOR_ELTS (t)); |
5d80a306 | 11339 | newlen = VEC_length (constructor_elt, n); |
4038c495 GB |
11340 | for (idx = 0; VEC_iterate (constructor_elt, n, idx, ce); idx++) |
11341 | { | |
11342 | if (ce->index && process_index_p) | |
11343 | ce->index = RECUR (ce->index); | |
5d80a306 DG |
11344 | |
11345 | if (PACK_EXPANSION_P (ce->value)) | |
11346 | { | |
11347 | /* Substitute into the pack expansion. */ | |
11348 | ce->value = tsubst_pack_expansion (ce->value, args, complain, | |
11349 | in_decl); | |
11350 | ||
4745e4eb JJ |
11351 | if (ce->value == error_mark_node) |
11352 | ; | |
11353 | else if (TREE_VEC_LENGTH (ce->value) == 1) | |
5d80a306 DG |
11354 | /* Just move the argument into place. */ |
11355 | ce->value = TREE_VEC_ELT (ce->value, 0); | |
11356 | else | |
11357 | { | |
11358 | /* Update the length of the final CONSTRUCTOR | |
11359 | arguments vector, and note that we will need to | |
11360 | copy.*/ | |
11361 | newlen = newlen + TREE_VEC_LENGTH (ce->value) - 1; | |
11362 | need_copy_p = true; | |
11363 | } | |
11364 | } | |
11365 | else | |
11366 | ce->value = RECUR (ce->value); | |
cc23546e | 11367 | } |
c8094d83 | 11368 | |
5d80a306 DG |
11369 | if (need_copy_p) |
11370 | { | |
11371 | VEC(constructor_elt,gc) *old_n = n; | |
11372 | ||
11373 | n = VEC_alloc (constructor_elt, gc, newlen); | |
11374 | for (idx = 0; VEC_iterate (constructor_elt, old_n, idx, ce); | |
11375 | idx++) | |
11376 | { | |
11377 | if (TREE_CODE (ce->value) == TREE_VEC) | |
11378 | { | |
11379 | int i, len = TREE_VEC_LENGTH (ce->value); | |
11380 | for (i = 0; i < len; ++i) | |
11381 | CONSTRUCTOR_APPEND_ELT (n, 0, | |
11382 | TREE_VEC_ELT (ce->value, i)); | |
11383 | } | |
11384 | else | |
11385 | CONSTRUCTOR_APPEND_ELT (n, 0, ce->value); | |
11386 | } | |
11387 | } | |
11388 | ||
05b22df9 MM |
11389 | if (TREE_HAS_CONSTRUCTOR (t)) |
11390 | return finish_compound_literal (type, n); | |
cc23546e | 11391 | |
05b22df9 | 11392 | return build_constructor (NULL_TREE, n); |
cc23546e JO |
11393 | } |
11394 | ||
11395 | case TYPEID_EXPR: | |
11396 | { | |
b3445994 | 11397 | tree operand_0 = RECUR (TREE_OPERAND (t, 0)); |
cc23546e JO |
11398 | if (TYPE_P (operand_0)) |
11399 | return get_typeid (operand_0); | |
11400 | return build_typeid (operand_0); | |
11401 | } | |
11402 | ||
cc23546e | 11403 | case VAR_DECL: |
db24eb1f NS |
11404 | if (!args) |
11405 | return t; | |
11406 | /* Fall through */ | |
c8094d83 | 11407 | |
db24eb1f NS |
11408 | case PARM_DECL: |
11409 | { | |
11410 | tree r = tsubst_copy (t, args, complain, in_decl); | |
c8094d83 | 11411 | |
db24eb1f NS |
11412 | if (TREE_CODE (TREE_TYPE (t)) != REFERENCE_TYPE) |
11413 | /* If the original type was a reference, we'll be wrapped in | |
11414 | the appropriate INDIRECT_REF. */ | |
11415 | r = convert_from_reference (r); | |
11416 | return r; | |
11417 | } | |
cc23546e JO |
11418 | |
11419 | case VA_ARG_EXPR: | |
b3445994 | 11420 | return build_x_va_arg (RECUR (TREE_OPERAND (t, 0)), |
c8094d83 | 11421 | tsubst_copy (TREE_TYPE (t), args, complain, |
b3445994 | 11422 | in_decl)); |
cc23546e | 11423 | |
4bceb077 | 11424 | case OFFSETOF_EXPR: |
c291f8b1 | 11425 | return finish_offsetof (RECUR (TREE_OPERAND (t, 0))); |
4bceb077 | 11426 | |
cb68ec50 PC |
11427 | case TRAIT_EXPR: |
11428 | { | |
11429 | tree type1 = tsubst_copy (TRAIT_EXPR_TYPE1 (t), args, | |
11430 | complain, in_decl); | |
11431 | ||
11432 | tree type2 = TRAIT_EXPR_TYPE2 (t); | |
11433 | if (type2) | |
11434 | type2 = tsubst_copy (type2, args, complain, in_decl); | |
11435 | ||
11436 | return finish_trait_expr (TRAIT_EXPR_KIND (t), type1, type2); | |
11437 | } | |
11438 | ||
0fe0caa6 RH |
11439 | case STMT_EXPR: |
11440 | { | |
11441 | tree old_stmt_expr = cur_stmt_expr; | |
11442 | tree stmt_expr = begin_stmt_expr (); | |
11443 | ||
11444 | cur_stmt_expr = stmt_expr; | |
015c2c66 MM |
11445 | tsubst_expr (STMT_EXPR_STMT (t), args, complain, in_decl, |
11446 | integral_constant_expression_p); | |
0fe0caa6 RH |
11447 | stmt_expr = finish_stmt_expr (stmt_expr, false); |
11448 | cur_stmt_expr = old_stmt_expr; | |
11449 | ||
11450 | return stmt_expr; | |
11451 | } | |
11452 | ||
a5201a91 MM |
11453 | case CONST_DECL: |
11454 | t = tsubst_copy (t, args, complain, in_decl); | |
11455 | /* As in finish_id_expression, we resolve enumeration constants | |
11456 | to their underlying values. */ | |
11457 | if (TREE_CODE (t) == CONST_DECL) | |
6193b8b7 DJ |
11458 | { |
11459 | used_types_insert (TREE_TYPE (t)); | |
11460 | return DECL_INITIAL (t); | |
11461 | } | |
a5201a91 MM |
11462 | return t; |
11463 | ||
cc23546e | 11464 | default: |
e58a9aa1 ZL |
11465 | /* Handle Objective-C++ constructs, if appropriate. */ |
11466 | { | |
11467 | tree subst | |
11468 | = objcp_tsubst_copy_and_build (t, args, complain, | |
11469 | in_decl, /*function_p=*/false); | |
11470 | if (subst) | |
11471 | return subst; | |
11472 | } | |
cc23546e JO |
11473 | return tsubst_copy (t, args, complain, in_decl); |
11474 | } | |
b3445994 MM |
11475 | |
11476 | #undef RECUR | |
cc23546e JO |
11477 | } |
11478 | ||
3e4a3562 NS |
11479 | /* Verify that the instantiated ARGS are valid. For type arguments, |
11480 | make sure that the type's linkage is ok. For non-type arguments, | |
34cd5ae7 | 11481 | make sure they are constants if they are integral or enumerations. |
9bcb9aae | 11482 | Emit an error under control of COMPLAIN, and return TRUE on error. */ |
3e4a3562 NS |
11483 | |
11484 | static bool | |
3a978d72 | 11485 | check_instantiated_args (tree tmpl, tree args, tsubst_flags_t complain) |
3e4a3562 NS |
11486 | { |
11487 | int ix, len = DECL_NTPARMS (tmpl); | |
11488 | bool result = false; | |
11489 | ||
11490 | for (ix = 0; ix != len; ix++) | |
11491 | { | |
11492 | tree t = TREE_VEC_ELT (args, ix); | |
c8094d83 | 11493 | |
3e4a3562 NS |
11494 | if (TYPE_P (t)) |
11495 | { | |
11496 | /* [basic.link]: A name with no linkage (notably, the name | |
11497 | of a class or enumeration declared in a local scope) | |
11498 | shall not be used to declare an entity with linkage. | |
11499 | This implies that names with no linkage cannot be used as | |
11500 | template arguments. */ | |
4684cd27 | 11501 | tree nt = no_linkage_check (t, /*relaxed_p=*/false); |
3e4a3562 NS |
11502 | |
11503 | if (nt) | |
11504 | { | |
cb807ba3 | 11505 | /* DR 488 makes use of a type with no linkage cause |
3db45ab5 | 11506 | type deduction to fail. */ |
2010cdcd MM |
11507 | if (complain & tf_error) |
11508 | { | |
11509 | if (TYPE_ANONYMOUS_P (nt)) | |
11510 | error ("%qT is/uses anonymous type", t); | |
11511 | else | |
9df540a8 | 11512 | error ("template argument for %qD uses local type %qT", |
3db45ab5 | 11513 | tmpl, t); |
2010cdcd | 11514 | } |
3e4a3562 NS |
11515 | result = true; |
11516 | } | |
11517 | /* In order to avoid all sorts of complications, we do not | |
11518 | allow variably-modified types as template arguments. */ | |
5377d5ba | 11519 | else if (variably_modified_type_p (t, NULL_TREE)) |
3e4a3562 NS |
11520 | { |
11521 | if (complain & tf_error) | |
0f51ccfc | 11522 | error ("%qT is a variably modified type", t); |
3e4a3562 NS |
11523 | result = true; |
11524 | } | |
11525 | } | |
11526 | /* A non-type argument of integral or enumerated type must be a | |
11527 | constant. */ | |
11528 | else if (TREE_TYPE (t) | |
11529 | && INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (t)) | |
11530 | && !TREE_CONSTANT (t)) | |
11531 | { | |
11532 | if (complain & tf_error) | |
0f51ccfc | 11533 | error ("integral expression %qE is not constant", t); |
3e4a3562 NS |
11534 | result = true; |
11535 | } | |
11536 | } | |
2010cdcd | 11537 | if (result && (complain & tf_error)) |
0f51ccfc | 11538 | error (" trying to instantiate %qD", tmpl); |
3e4a3562 NS |
11539 | return result; |
11540 | } | |
11541 | ||
6ba89f8e | 11542 | /* Instantiate the indicated variable or function template TMPL with |
36a117a5 MM |
11543 | the template arguments in TARG_PTR. */ |
11544 | ||
5566b478 | 11545 | tree |
3a978d72 | 11546 | instantiate_template (tree tmpl, tree targ_ptr, tsubst_flags_t complain) |
8d08fdba | 11547 | { |
5566b478 | 11548 | tree fndecl; |
36a117a5 MM |
11549 | tree gen_tmpl; |
11550 | tree spec; | |
a95799ec | 11551 | HOST_WIDE_INT saved_processing_template_decl; |
5566b478 | 11552 | |
27fafc8d JM |
11553 | if (tmpl == error_mark_node) |
11554 | return error_mark_node; | |
11555 | ||
50bc768d | 11556 | gcc_assert (TREE_CODE (tmpl) == TEMPLATE_DECL); |
386b8a85 | 11557 | |
db9b2174 MM |
11558 | /* If this function is a clone, handle it specially. */ |
11559 | if (DECL_CLONED_FUNCTION_P (tmpl)) | |
3ad97789 | 11560 | { |
a30f62e0 | 11561 | tree spec; |
3ad97789 | 11562 | tree clone; |
c8094d83 | 11563 | |
a30f62e0 MM |
11564 | spec = instantiate_template (DECL_CLONED_FUNCTION (tmpl), targ_ptr, |
11565 | complain); | |
11566 | if (spec == error_mark_node) | |
11567 | return error_mark_node; | |
11568 | ||
c6002625 | 11569 | /* Look for the clone. */ |
4684cd27 | 11570 | FOR_EACH_CLONE (clone, spec) |
3ad97789 NS |
11571 | if (DECL_NAME (clone) == DECL_NAME (tmpl)) |
11572 | return clone; | |
11573 | /* We should always have found the clone by now. */ | |
315fb5db | 11574 | gcc_unreachable (); |
3ad97789 NS |
11575 | return NULL_TREE; |
11576 | } | |
c8094d83 | 11577 | |
36a117a5 | 11578 | /* Check to see if we already have this specialization. */ |
c8094d83 | 11579 | spec = retrieve_specialization (tmpl, targ_ptr, |
c7222c02 | 11580 | /*class_specializations_p=*/false); |
36a117a5 MM |
11581 | if (spec != NULL_TREE) |
11582 | return spec; | |
11583 | ||
f9a7ae04 MM |
11584 | gen_tmpl = most_general_template (tmpl); |
11585 | if (tmpl != gen_tmpl) | |
386b8a85 | 11586 | { |
36a117a5 MM |
11587 | /* The TMPL is a partial instantiation. To get a full set of |
11588 | arguments we must add the arguments used to perform the | |
11589 | partial instantiation. */ | |
11590 | targ_ptr = add_outermost_template_args (DECL_TI_ARGS (tmpl), | |
11591 | targ_ptr); | |
36a117a5 MM |
11592 | |
11593 | /* Check to see if we already have this specialization. */ | |
c7222c02 MM |
11594 | spec = retrieve_specialization (gen_tmpl, targ_ptr, |
11595 | /*class_specializations_p=*/false); | |
75650646 MM |
11596 | if (spec != NULL_TREE) |
11597 | return spec; | |
386b8a85 JM |
11598 | } |
11599 | ||
3e4a3562 NS |
11600 | if (check_instantiated_args (gen_tmpl, INNERMOST_TEMPLATE_ARGS (targ_ptr), |
11601 | complain)) | |
11602 | return error_mark_node; | |
c8094d83 | 11603 | |
2b907f5c KL |
11604 | /* We are building a FUNCTION_DECL, during which the access of its |
11605 | parameters and return types have to be checked. However this | |
11606 | FUNCTION_DECL which is the desired context for access checking | |
11607 | is not built yet. We solve this chicken-and-egg problem by | |
11608 | deferring all checks until we have the FUNCTION_DECL. */ | |
11609 | push_deferring_access_checks (dk_deferred); | |
5c74d5b0 | 11610 | |
a95799ec MM |
11611 | /* Although PROCESSING_TEMPLATE_DECL may be true at this point |
11612 | (because, for example, we have encountered a non-dependent | |
a1d08991 MM |
11613 | function call in the body of a template function and must now |
11614 | determine which of several overloaded functions will be called), | |
11615 | within the instantiation itself we are not processing a | |
11616 | template. */ | |
a95799ec MM |
11617 | saved_processing_template_decl = processing_template_decl; |
11618 | processing_template_decl = 0; | |
11619 | /* Substitute template parameters to obtain the specialization. */ | |
17aec3eb | 11620 | fndecl = tsubst (DECL_TEMPLATE_RESULT (gen_tmpl), |
3e4a3562 | 11621 | targ_ptr, complain, gen_tmpl); |
a95799ec | 11622 | processing_template_decl = saved_processing_template_decl; |
6b6b60af MM |
11623 | if (fndecl == error_mark_node) |
11624 | return error_mark_node; | |
5c74d5b0 | 11625 | |
2b907f5c KL |
11626 | /* Now we know the specialization, compute access previously |
11627 | deferred. */ | |
11628 | push_access_scope (fndecl); | |
11629 | perform_deferred_access_checks (); | |
11630 | pop_access_scope (fndecl); | |
11631 | pop_deferring_access_checks (); | |
5c74d5b0 | 11632 | |
36a117a5 MM |
11633 | /* The DECL_TI_TEMPLATE should always be the immediate parent |
11634 | template, not the most general template. */ | |
11635 | DECL_TI_TEMPLATE (fndecl) = tmpl; | |
8d08fdba | 11636 | |
94350948 | 11637 | /* If we've just instantiated the main entry point for a function, |
3ad97789 NS |
11638 | instantiate all the alternate entry points as well. We do this |
11639 | by cloning the instantiation of the main entry point, not by | |
11640 | instantiating the template clones. */ | |
11641 | if (TREE_CHAIN (gen_tmpl) && DECL_CLONED_FUNCTION_P (TREE_CHAIN (gen_tmpl))) | |
11642 | clone_function_decl (fndecl, /*update_method_vec_p=*/0); | |
94350948 | 11643 | |
5566b478 | 11644 | return fndecl; |
8d08fdba | 11645 | } |
5566b478 | 11646 | |
4393e105 MM |
11647 | /* The FN is a TEMPLATE_DECL for a function. The ARGS are the |
11648 | arguments that are being used when calling it. TARGS is a vector | |
c8094d83 | 11649 | into which the deduced template arguments are placed. |
8d08fdba MS |
11650 | |
11651 | Return zero for success, 2 for an incomplete match that doesn't resolve | |
11652 | all the types, and 1 for complete failure. An error message will be | |
11653 | printed only for an incomplete match. | |
11654 | ||
e5214479 JM |
11655 | If FN is a conversion operator, or we are trying to produce a specific |
11656 | specialization, RETURN_TYPE is the return type desired. | |
9f54c803 MM |
11657 | |
11658 | The EXPLICIT_TARGS are explicit template arguments provided via a | |
11659 | template-id. | |
6467930b | 11660 | |
830bfa74 MM |
11661 | The parameter STRICT is one of: |
11662 | ||
c8094d83 | 11663 | DEDUCE_CALL: |
830bfa74 MM |
11664 | We are deducing arguments for a function call, as in |
11665 | [temp.deduct.call]. | |
11666 | ||
11667 | DEDUCE_CONV: | |
c8094d83 | 11668 | We are deducing arguments for a conversion function, as in |
830bfa74 MM |
11669 | [temp.deduct.conv]. |
11670 | ||
11671 | DEDUCE_EXACT: | |
62e4a758 NS |
11672 | We are deducing arguments when doing an explicit instantiation |
11673 | as in [temp.explicit], when determining an explicit specialization | |
11674 | as in [temp.expl.spec], or when taking the address of a function | |
a34d3336 | 11675 | template, as in [temp.deduct.funcaddr]. */ |
8d08fdba MS |
11676 | |
11677 | int | |
c8094d83 | 11678 | fn_type_unification (tree fn, |
0cbd7506 MS |
11679 | tree explicit_targs, |
11680 | tree targs, | |
11681 | tree args, | |
11682 | tree return_type, | |
30f86ec3 FJ |
11683 | unification_kind_t strict, |
11684 | int flags) | |
386b8a85 | 11685 | { |
4393e105 MM |
11686 | tree parms; |
11687 | tree fntype; | |
adecb3f4 | 11688 | int result; |
5d80a306 | 11689 | bool incomplete_argument_packs_p = false; |
386b8a85 | 11690 | |
50bc768d | 11691 | gcc_assert (TREE_CODE (fn) == TEMPLATE_DECL); |
2b59fc25 | 11692 | |
4393e105 MM |
11693 | fntype = TREE_TYPE (fn); |
11694 | if (explicit_targs) | |
75650646 | 11695 | { |
4393e105 | 11696 | /* [temp.deduct] |
c8094d83 | 11697 | |
4393e105 MM |
11698 | The specified template arguments must match the template |
11699 | parameters in kind (i.e., type, nontype, template), and there | |
11700 | must not be more arguments than there are parameters; | |
11701 | otherwise type deduction fails. | |
11702 | ||
11703 | Nontype arguments must match the types of the corresponding | |
11704 | nontype template parameters, or must be convertible to the | |
11705 | types of the corresponding nontype parameters as specified in | |
11706 | _temp.arg.nontype_, otherwise type deduction fails. | |
11707 | ||
11708 | All references in the function type of the function template | |
11709 | to the corresponding template parameters are replaced by the | |
11710 | specified template argument values. If a substitution in a | |
11711 | template parameter or in the function type of the function | |
11712 | template results in an invalid type, type deduction fails. */ | |
5d80a306 DG |
11713 | tree tparms = DECL_INNERMOST_TEMPLATE_PARMS (fn); |
11714 | int i, len = TREE_VEC_LENGTH (tparms); | |
4393e105 | 11715 | tree converted_args; |
5d80a306 | 11716 | bool incomplete = false; |
75650646 | 11717 | |
c8a7ed43 AO |
11718 | if (explicit_targs == error_mark_node) |
11719 | return 1; | |
11720 | ||
4393e105 | 11721 | converted_args |
5d80a306 | 11722 | = (coerce_template_parms (tparms, explicit_targs, NULL_TREE, tf_none, |
e7e93965 MM |
11723 | /*require_all_args=*/false, |
11724 | /*use_default_args=*/false)); | |
4393e105 | 11725 | if (converted_args == error_mark_node) |
75650646 | 11726 | return 1; |
386b8a85 | 11727 | |
ffd49b19 | 11728 | /* Substitute the explicit args into the function type. This is |
0cbd7506 MS |
11729 | necessary so that, for instance, explicitly declared function |
11730 | arguments can match null pointed constants. If we were given | |
11731 | an incomplete set of explicit args, we must not do semantic | |
11732 | processing during substitution as we could create partial | |
11733 | instantiations. */ | |
5d80a306 DG |
11734 | for (i = 0; i < len; i++) |
11735 | { | |
11736 | tree parm = TREE_VALUE (TREE_VEC_ELT (tparms, i)); | |
11737 | bool parameter_pack = false; | |
11738 | ||
11739 | /* Dig out the actual parm. */ | |
11740 | if (TREE_CODE (parm) == TYPE_DECL | |
11741 | || TREE_CODE (parm) == TEMPLATE_DECL) | |
11742 | { | |
11743 | parm = TREE_TYPE (parm); | |
11744 | parameter_pack = TEMPLATE_TYPE_PARAMETER_PACK (parm); | |
11745 | } | |
11746 | else if (TREE_CODE (parm) == PARM_DECL) | |
11747 | { | |
11748 | parm = DECL_INITIAL (parm); | |
11749 | parameter_pack = TEMPLATE_PARM_PARAMETER_PACK (parm); | |
11750 | } | |
11751 | ||
11752 | if (parameter_pack) | |
11753 | { | |
11754 | int level, idx; | |
11755 | tree targ; | |
11756 | template_parm_level_and_index (parm, &level, &idx); | |
11757 | ||
11758 | /* Mark the argument pack as "incomplete". We could | |
11759 | still deduce more arguments during unification. */ | |
11760 | targ = TMPL_ARG (converted_args, level, idx); | |
b1d7b1c0 DG |
11761 | if (targ) |
11762 | { | |
11763 | ARGUMENT_PACK_INCOMPLETE_P(targ) = 1; | |
11764 | ARGUMENT_PACK_EXPLICIT_ARGS (targ) | |
11765 | = ARGUMENT_PACK_ARGS (targ); | |
11766 | } | |
5d80a306 DG |
11767 | |
11768 | /* We have some incomplete argument packs. */ | |
11769 | incomplete_argument_packs_p = true; | |
11770 | } | |
11771 | } | |
11772 | ||
11773 | if (incomplete_argument_packs_p) | |
11774 | /* Any substitution is guaranteed to be incomplete if there | |
11775 | are incomplete argument packs, because we can still deduce | |
11776 | more arguments. */ | |
11777 | incomplete = 1; | |
11778 | else | |
11779 | incomplete = NUM_TMPL_ARGS (explicit_targs) != NUM_TMPL_ARGS (targs); | |
11780 | ||
ffd49b19 | 11781 | processing_template_decl += incomplete; |
c2ea3a40 | 11782 | fntype = tsubst (fntype, converted_args, tf_none, NULL_TREE); |
ffd49b19 | 11783 | processing_template_decl -= incomplete; |
c8094d83 | 11784 | |
4393e105 MM |
11785 | if (fntype == error_mark_node) |
11786 | return 1; | |
050367a3 | 11787 | |
4393e105 | 11788 | /* Place the explicitly specified arguments in TARGS. */ |
ffd49b19 | 11789 | for (i = NUM_TMPL_ARGS (converted_args); i--;) |
4393e105 | 11790 | TREE_VEC_ELT (targs, i) = TREE_VEC_ELT (converted_args, i); |
75650646 | 11791 | } |
c8094d83 | 11792 | |
e5214479 | 11793 | /* Never do unification on the 'this' parameter. */ |
ba139ba8 | 11794 | parms = skip_artificial_parms_for (fn, TYPE_ARG_TYPES (fntype)); |
c8094d83 | 11795 | |
8d3631f8 NS |
11796 | if (return_type) |
11797 | { | |
8d3631f8 NS |
11798 | parms = tree_cons (NULL_TREE, TREE_TYPE (fntype), parms); |
11799 | args = tree_cons (NULL_TREE, return_type, args); | |
4393e105 MM |
11800 | } |
11801 | ||
4393e105 MM |
11802 | /* We allow incomplete unification without an error message here |
11803 | because the standard doesn't seem to explicitly prohibit it. Our | |
11804 | callers must be ready to deal with unification failures in any | |
11805 | event. */ | |
c8094d83 | 11806 | result = type_unification_real (DECL_INNERMOST_TEMPLATE_PARMS (fn), |
adecb3f4 | 11807 | targs, parms, args, /*subr=*/0, |
30f86ec3 | 11808 | strict, flags); |
adecb3f4 | 11809 | |
5d80a306 DG |
11810 | if (result == 0 && incomplete_argument_packs_p) |
11811 | { | |
11812 | int i, len = NUM_TMPL_ARGS (targs); | |
11813 | ||
11814 | /* Clear the "incomplete" flags on all argument packs. */ | |
11815 | for (i = 0; i < len; i++) | |
11816 | { | |
11817 | tree arg = TREE_VEC_ELT (targs, i); | |
11818 | if (ARGUMENT_PACK_P (arg)) | |
11819 | { | |
11820 | ARGUMENT_PACK_INCOMPLETE_P (arg) = 0; | |
11821 | ARGUMENT_PACK_EXPLICIT_ARGS (arg) = NULL_TREE; | |
11822 | } | |
11823 | } | |
11824 | } | |
11825 | ||
4cf36211 DG |
11826 | /* Now that we have bindings for all of the template arguments, |
11827 | ensure that the arguments deduced for the template template | |
11828 | parameters have compatible template parameter lists. We cannot | |
11829 | check this property before we have deduced all template | |
11830 | arguments, because the template parameter types of a template | |
11831 | template parameter might depend on prior template parameters | |
11832 | deduced after the template template parameter. The following | |
11833 | ill-formed example illustrates this issue: | |
11834 | ||
11835 | template<typename T, template<T> class C> void f(C<5>, T); | |
11836 | ||
11837 | template<int N> struct X {}; | |
11838 | ||
11839 | void g() { | |
11840 | f(X<5>(), 5l); // error: template argument deduction fails | |
11841 | } | |
11842 | ||
11843 | The template parameter list of 'C' depends on the template type | |
11844 | parameter 'T', but 'C' is deduced to 'X' before 'T' is deduced to | |
11845 | 'long'. Thus, we can't check that 'C' cannot bind to 'X' at the | |
11846 | time that we deduce 'C'. */ | |
11847 | if (result == 0 | |
11848 | && !template_template_parm_bindings_ok_p | |
11849 | (DECL_INNERMOST_TEMPLATE_PARMS (fn), targs)) | |
11850 | return 1; | |
11851 | ||
c8094d83 | 11852 | if (result == 0) |
adecb3f4 | 11853 | /* All is well so far. Now, check: |
c8094d83 MS |
11854 | |
11855 | [temp.deduct] | |
11856 | ||
adecb3f4 MM |
11857 | When all template arguments have been deduced, all uses of |
11858 | template parameters in nondeduced contexts are replaced with | |
11859 | the corresponding deduced argument values. If the | |
11860 | substitution results in an invalid type, as described above, | |
11861 | type deduction fails. */ | |
c2ea3a40 | 11862 | if (tsubst (TREE_TYPE (fn), targs, tf_none, NULL_TREE) |
adecb3f4 MM |
11863 | == error_mark_node) |
11864 | return 1; | |
11865 | ||
11866 | return result; | |
830bfa74 MM |
11867 | } |
11868 | ||
11869 | /* Adjust types before performing type deduction, as described in | |
11870 | [temp.deduct.call] and [temp.deduct.conv]. The rules in these two | |
4c7d0dff MM |
11871 | sections are symmetric. PARM is the type of a function parameter |
11872 | or the return type of the conversion function. ARG is the type of | |
11873 | the argument passed to the call, or the type of the value | |
8af2fec4 RY |
11874 | initialized with the result of the conversion function. |
11875 | ARG_EXPR is the original argument expression, which may be null. */ | |
386b8a85 | 11876 | |
62e4a758 | 11877 | static int |
c8094d83 | 11878 | maybe_adjust_types_for_deduction (unification_kind_t strict, |
0cbd7506 | 11879 | tree* parm, |
8af2fec4 RY |
11880 | tree* arg, |
11881 | tree arg_expr) | |
830bfa74 | 11882 | { |
62e4a758 | 11883 | int result = 0; |
c8094d83 | 11884 | |
830bfa74 MM |
11885 | switch (strict) |
11886 | { | |
11887 | case DEDUCE_CALL: | |
11888 | break; | |
11889 | ||
11890 | case DEDUCE_CONV: | |
11891 | { | |
4c7d0dff MM |
11892 | /* Swap PARM and ARG throughout the remainder of this |
11893 | function; the handling is precisely symmetric since PARM | |
11894 | will initialize ARG rather than vice versa. */ | |
830bfa74 MM |
11895 | tree* temp = parm; |
11896 | parm = arg; | |
11897 | arg = temp; | |
11898 | break; | |
11899 | } | |
11900 | ||
11901 | case DEDUCE_EXACT: | |
11902 | /* There is nothing to do in this case. */ | |
62e4a758 | 11903 | return 0; |
830bfa74 MM |
11904 | |
11905 | default: | |
315fb5db | 11906 | gcc_unreachable (); |
830bfa74 MM |
11907 | } |
11908 | ||
11909 | if (TREE_CODE (*parm) != REFERENCE_TYPE) | |
11910 | { | |
11911 | /* [temp.deduct.call] | |
c8094d83 | 11912 | |
830bfa74 | 11913 | If P is not a reference type: |
c8094d83 | 11914 | |
830bfa74 MM |
11915 | --If A is an array type, the pointer type produced by the |
11916 | array-to-pointer standard conversion (_conv.array_) is | |
11917 | used in place of A for type deduction; otherwise, | |
c8094d83 | 11918 | |
830bfa74 MM |
11919 | --If A is a function type, the pointer type produced by |
11920 | the function-to-pointer standard conversion | |
11921 | (_conv.func_) is used in place of A for type deduction; | |
11922 | otherwise, | |
c8094d83 | 11923 | |
830bfa74 MM |
11924 | --If A is a cv-qualified type, the top level |
11925 | cv-qualifiers of A's type are ignored for type | |
11926 | deduction. */ | |
11927 | if (TREE_CODE (*arg) == ARRAY_TYPE) | |
11928 | *arg = build_pointer_type (TREE_TYPE (*arg)); | |
d8f8dca1 | 11929 | else if (TREE_CODE (*arg) == FUNCTION_TYPE) |
830bfa74 MM |
11930 | *arg = build_pointer_type (*arg); |
11931 | else | |
11932 | *arg = TYPE_MAIN_VARIANT (*arg); | |
11933 | } | |
c8094d83 | 11934 | |
8af2fec4 RY |
11935 | /* From C++0x [14.8.2.1/3 temp.deduct.call] (after DR606), "If P is |
11936 | of the form T&&, where T is a template parameter, and the argument | |
11937 | is an lvalue, T is deduced as A& */ | |
11938 | if (TREE_CODE (*parm) == REFERENCE_TYPE | |
11939 | && TYPE_REF_IS_RVALUE (*parm) | |
11940 | && TREE_CODE (TREE_TYPE (*parm)) == TEMPLATE_TYPE_PARM | |
11941 | && cp_type_quals (TREE_TYPE (*parm)) == TYPE_UNQUALIFIED | |
11942 | && arg_expr && real_lvalue_p (arg_expr)) | |
11943 | *arg = build_reference_type (*arg); | |
11944 | ||
830bfa74 | 11945 | /* [temp.deduct.call] |
c8094d83 | 11946 | |
830bfa74 MM |
11947 | If P is a cv-qualified type, the top level cv-qualifiers |
11948 | of P's type are ignored for type deduction. If P is a | |
11949 | reference type, the type referred to by P is used for | |
11950 | type deduction. */ | |
11951 | *parm = TYPE_MAIN_VARIANT (*parm); | |
11952 | if (TREE_CODE (*parm) == REFERENCE_TYPE) | |
62e4a758 NS |
11953 | { |
11954 | *parm = TREE_TYPE (*parm); | |
11955 | result |= UNIFY_ALLOW_OUTER_MORE_CV_QUAL; | |
11956 | } | |
1c82cc90 NS |
11957 | |
11958 | /* DR 322. For conversion deduction, remove a reference type on parm | |
11959 | too (which has been swapped into ARG). */ | |
11960 | if (strict == DEDUCE_CONV && TREE_CODE (*arg) == REFERENCE_TYPE) | |
11961 | *arg = TREE_TYPE (*arg); | |
c8094d83 | 11962 | |
62e4a758 | 11963 | return result; |
386b8a85 JM |
11964 | } |
11965 | ||
e5214479 | 11966 | /* Most parms like fn_type_unification. |
9f54c803 MM |
11967 | |
11968 | If SUBR is 1, we're being called recursively (to unify the | |
11969 | arguments of a function or method parameter of a function | |
38d18b1a | 11970 | template). */ |
386b8a85 | 11971 | |
4966381a | 11972 | static int |
c8094d83 | 11973 | type_unification_real (tree tparms, |
0cbd7506 MS |
11974 | tree targs, |
11975 | tree xparms, | |
11976 | tree xargs, | |
11977 | int subr, | |
30f86ec3 FJ |
11978 | unification_kind_t strict, |
11979 | int flags) | |
8d08fdba | 11980 | { |
8af2fec4 | 11981 | tree parm, arg, arg_expr; |
8d08fdba MS |
11982 | int i; |
11983 | int ntparms = TREE_VEC_LENGTH (tparms); | |
830bfa74 | 11984 | int sub_strict; |
bd0d5d4a JM |
11985 | int saw_undeduced = 0; |
11986 | tree parms, args; | |
8d08fdba | 11987 | |
50bc768d NS |
11988 | gcc_assert (TREE_CODE (tparms) == TREE_VEC); |
11989 | gcc_assert (xparms == NULL_TREE || TREE_CODE (xparms) == TREE_LIST); | |
11990 | gcc_assert (!xargs || TREE_CODE (xargs) == TREE_LIST); | |
11991 | gcc_assert (ntparms > 0); | |
8d08fdba | 11992 | |
830bfa74 MM |
11993 | switch (strict) |
11994 | { | |
11995 | case DEDUCE_CALL: | |
028d1f20 | 11996 | sub_strict = (UNIFY_ALLOW_OUTER_LEVEL | UNIFY_ALLOW_MORE_CV_QUAL |
0cbd7506 | 11997 | | UNIFY_ALLOW_DERIVED); |
830bfa74 | 11998 | break; |
c8094d83 | 11999 | |
830bfa74 MM |
12000 | case DEDUCE_CONV: |
12001 | sub_strict = UNIFY_ALLOW_LESS_CV_QUAL; | |
12002 | break; | |
12003 | ||
12004 | case DEDUCE_EXACT: | |
12005 | sub_strict = UNIFY_ALLOW_NONE; | |
12006 | break; | |
c8094d83 | 12007 | |
830bfa74 | 12008 | default: |
315fb5db | 12009 | gcc_unreachable (); |
830bfa74 MM |
12010 | } |
12011 | ||
bd0d5d4a JM |
12012 | again: |
12013 | parms = xparms; | |
12014 | args = xargs; | |
bd0d5d4a | 12015 | |
a34d3336 NS |
12016 | while (parms && parms != void_list_node |
12017 | && args && args != void_list_node) | |
8d08fdba | 12018 | { |
5d80a306 DG |
12019 | if (TREE_CODE (TREE_VALUE (parms)) == TYPE_PACK_EXPANSION) |
12020 | break; | |
12021 | ||
8d08fdba MS |
12022 | parm = TREE_VALUE (parms); |
12023 | parms = TREE_CHAIN (parms); | |
12024 | arg = TREE_VALUE (args); | |
12025 | args = TREE_CHAIN (args); | |
8af2fec4 | 12026 | arg_expr = NULL; |
8d08fdba MS |
12027 | |
12028 | if (arg == error_mark_node) | |
12029 | return 1; | |
12030 | if (arg == unknown_type_node) | |
34016c81 JM |
12031 | /* We can't deduce anything from this, but we might get all the |
12032 | template args from other function args. */ | |
12033 | continue; | |
b7484fbe | 12034 | |
03e70705 JM |
12035 | /* Conversions will be performed on a function argument that |
12036 | corresponds with a function parameter that contains only | |
12037 | non-deducible template parameters and explicitly specified | |
12038 | template parameters. */ | |
c353b8e3 | 12039 | if (!uses_template_parms (parm)) |
b7484fbe | 12040 | { |
03e70705 JM |
12041 | tree type; |
12042 | ||
2f939d94 | 12043 | if (!TYPE_P (arg)) |
03e70705 JM |
12044 | type = TREE_TYPE (arg); |
12045 | else | |
c353b8e3 | 12046 | type = arg; |
03e70705 | 12047 | |
fad86f7a | 12048 | if (same_type_p (parm, type)) |
343c89cd | 12049 | continue; |
fad86f7a | 12050 | if (strict != DEDUCE_EXACT |
3db45ab5 | 12051 | && can_convert_arg (parm, type, TYPE_P (arg) ? NULL_TREE : arg, |
30f86ec3 | 12052 | flags)) |
fad86f7a | 12053 | continue; |
3db45ab5 | 12054 | |
b7484fbe MS |
12055 | return 1; |
12056 | } | |
c8094d83 | 12057 | |
2f939d94 | 12058 | if (!TYPE_P (arg)) |
8d08fdba | 12059 | { |
50bc768d | 12060 | gcc_assert (TREE_TYPE (arg) != NULL_TREE); |
34016c81 | 12061 | if (type_unknown_p (arg)) |
28cbf42c | 12062 | { |
acde59b4 | 12063 | /* [temp.deduct.type] |
34016c81 | 12064 | |
acde59b4 MM |
12065 | A template-argument can be deduced from a pointer to |
12066 | function or pointer to member function argument if | |
12067 | the set of overloaded functions does not contain | |
12068 | function templates and at most one of a set of | |
12069 | overloaded functions provides a unique match. */ | |
34016c81 | 12070 | if (resolve_overloaded_unification |
acde59b4 MM |
12071 | (tparms, targs, parm, arg, strict, sub_strict)) |
12072 | continue; | |
12073 | ||
12074 | return 1; | |
28cbf42c | 12075 | } |
8af2fec4 | 12076 | arg_expr = arg; |
f9aa54d3 | 12077 | arg = unlowered_expr_type (arg); |
08476342 NS |
12078 | if (arg == error_mark_node) |
12079 | return 1; | |
8d08fdba | 12080 | } |
c8094d83 | 12081 | |
62e4a758 | 12082 | { |
0cbd7506 | 12083 | int arg_strict = sub_strict; |
c8094d83 | 12084 | |
0cbd7506 | 12085 | if (!subr) |
8af2fec4 RY |
12086 | arg_strict |= maybe_adjust_types_for_deduction (strict, &parm, &arg, |
12087 | arg_expr); | |
4393e105 | 12088 | |
0cbd7506 MS |
12089 | if (unify (tparms, targs, parm, arg, arg_strict)) |
12090 | return 1; | |
62e4a758 | 12091 | } |
8d08fdba | 12092 | } |
c8094d83 | 12093 | |
5d80a306 DG |
12094 | |
12095 | if (parms | |
12096 | && parms != void_list_node | |
12097 | && TREE_CODE (TREE_VALUE (parms)) == TYPE_PACK_EXPANSION) | |
12098 | { | |
12099 | /* Unify the remaining arguments with the pack expansion type. */ | |
12100 | tree argvec; | |
12101 | tree parmvec = make_tree_vec (1); | |
12102 | int len = 0; | |
12103 | tree t; | |
12104 | ||
12105 | /* Count the number of arguments that remain. */ | |
12106 | for (t = args; t && t != void_list_node; t = TREE_CHAIN (t)) | |
12107 | len++; | |
12108 | ||
12109 | /* Allocate a TREE_VEC and copy in all of the arguments */ | |
12110 | argvec = make_tree_vec (len); | |
12111 | for (i = 0; args && args != void_list_node; args = TREE_CHAIN (args)) | |
12112 | { | |
12113 | TREE_VEC_ELT (argvec, i) = TREE_VALUE (args); | |
12114 | ++i; | |
12115 | } | |
12116 | ||
12117 | /* Copy the parameter into parmvec. */ | |
12118 | TREE_VEC_ELT (parmvec, 0) = TREE_VALUE (parms); | |
12119 | if (unify_pack_expansion (tparms, targs, parmvec, argvec, strict, | |
12120 | /*call_args_p=*/true, /*subr=*/subr)) | |
12121 | return 1; | |
12122 | ||
12123 | /* Advance to the end of the list of parameters. */ | |
12124 | parms = TREE_CHAIN (parms); | |
12125 | } | |
12126 | ||
8d08fdba MS |
12127 | /* Fail if we've reached the end of the parm list, and more args |
12128 | are present, and the parm list isn't variadic. */ | |
12129 | if (args && args != void_list_node && parms == void_list_node) | |
12130 | return 1; | |
f4f206f4 | 12131 | /* Fail if parms are left and they don't have default values. */ |
a34d3336 | 12132 | if (parms && parms != void_list_node |
8d08fdba MS |
12133 | && TREE_PURPOSE (parms) == NULL_TREE) |
12134 | return 1; | |
bd0d5d4a | 12135 | |
8d08fdba MS |
12136 | if (!subr) |
12137 | for (i = 0; i < ntparms; i++) | |
a34d3336 | 12138 | if (!TREE_VEC_ELT (targs, i)) |
8d08fdba | 12139 | { |
2d8ba2c7 LM |
12140 | tree tparm; |
12141 | ||
12142 | if (TREE_VEC_ELT (tparms, i) == error_mark_node) | |
12143 | continue; | |
12144 | ||
12145 | tparm = TREE_VALUE (TREE_VEC_ELT (tparms, i)); | |
bd0d5d4a JM |
12146 | |
12147 | /* If this is an undeduced nontype parameter that depends on | |
12148 | a type parameter, try another pass; its type may have been | |
12149 | deduced from a later argument than the one from which | |
12150 | this parameter can be deduced. */ | |
12151 | if (TREE_CODE (tparm) == PARM_DECL | |
12152 | && uses_template_parms (TREE_TYPE (tparm)) | |
12153 | && !saw_undeduced++) | |
12154 | goto again; | |
12155 | ||
9b7dd5e8 DG |
12156 | /* Core issue #226 (C++0x) [temp.deduct]: |
12157 | ||
12158 | If a template argument has not been deduced, its | |
12159 | default template argument, if any, is used. | |
12160 | ||
c1ae8be5 SM |
12161 | When we are in C++98 mode, TREE_PURPOSE will either |
12162 | be NULL_TREE or ERROR_MARK_NODE, so we do not need | |
12163 | to explicitly check cxx_dialect here. */ | |
9b7dd5e8 DG |
12164 | if (TREE_PURPOSE (TREE_VEC_ELT (tparms, i))) |
12165 | { | |
12166 | tree arg = tsubst (TREE_PURPOSE (TREE_VEC_ELT (tparms, i)), | |
12167 | targs, tf_none, NULL_TREE); | |
12168 | if (arg == error_mark_node) | |
12169 | return 1; | |
12170 | else | |
12171 | { | |
12172 | TREE_VEC_ELT (targs, i) = arg; | |
12173 | continue; | |
12174 | } | |
12175 | } | |
12176 | ||
b1d7b1c0 DG |
12177 | /* If the type parameter is a parameter pack, then it will |
12178 | be deduced to an empty parameter pack. */ | |
12179 | if (template_parameter_pack_p (tparm)) | |
12180 | { | |
12181 | tree arg; | |
12182 | ||
12183 | if (TREE_CODE (tparm) == TEMPLATE_PARM_INDEX) | |
12184 | { | |
12185 | arg = make_node (NONTYPE_ARGUMENT_PACK); | |
12186 | TREE_TYPE (arg) = TREE_TYPE (TEMPLATE_PARM_DECL (tparm)); | |
12187 | TREE_CONSTANT (arg) = 1; | |
12188 | } | |
12189 | else | |
12190 | arg = make_node (TYPE_ARGUMENT_PACK); | |
12191 | ||
12192 | SET_ARGUMENT_PACK_ARGS (arg, make_tree_vec (0)); | |
12193 | ||
12194 | TREE_VEC_ELT (targs, i) = arg; | |
12195 | continue; | |
12196 | } | |
12197 | ||
8d08fdba MS |
12198 | return 2; |
12199 | } | |
c8094d83 | 12200 | |
8d08fdba MS |
12201 | return 0; |
12202 | } | |
12203 | ||
acde59b4 MM |
12204 | /* Subroutine of type_unification_real. Args are like the variables |
12205 | at the call site. ARG is an overloaded function (or template-id); | |
12206 | we try deducing template args from each of the overloads, and if | |
12207 | only one succeeds, we go with that. Modifies TARGS and returns | |
12208 | true on success. */ | |
34016c81 | 12209 | |
acde59b4 | 12210 | static bool |
c8094d83 | 12211 | resolve_overloaded_unification (tree tparms, |
0cbd7506 MS |
12212 | tree targs, |
12213 | tree parm, | |
12214 | tree arg, | |
12215 | unification_kind_t strict, | |
3a978d72 | 12216 | int sub_strict) |
34016c81 JM |
12217 | { |
12218 | tree tempargs = copy_node (targs); | |
12219 | int good = 0; | |
f23fb7f5 | 12220 | bool addr_p; |
34016c81 JM |
12221 | |
12222 | if (TREE_CODE (arg) == ADDR_EXPR) | |
f23fb7f5 MM |
12223 | { |
12224 | arg = TREE_OPERAND (arg, 0); | |
12225 | addr_p = true; | |
12226 | } | |
12227 | else | |
12228 | addr_p = false; | |
9f3d9e46 | 12229 | |
d8f8dca1 MM |
12230 | if (TREE_CODE (arg) == COMPONENT_REF) |
12231 | /* Handle `&x' where `x' is some static or non-static member | |
12232 | function name. */ | |
12233 | arg = TREE_OPERAND (arg, 1); | |
12234 | ||
05e0b2f4 JM |
12235 | if (TREE_CODE (arg) == OFFSET_REF) |
12236 | arg = TREE_OPERAND (arg, 1); | |
12237 | ||
9f3d9e46 | 12238 | /* Strip baselink information. */ |
50ad9642 MM |
12239 | if (BASELINK_P (arg)) |
12240 | arg = BASELINK_FUNCTIONS (arg); | |
9f3d9e46 | 12241 | |
34016c81 JM |
12242 | if (TREE_CODE (arg) == TEMPLATE_ID_EXPR) |
12243 | { | |
12244 | /* If we got some explicit template args, we need to plug them into | |
12245 | the affected templates before we try to unify, in case the | |
12246 | explicit args will completely resolve the templates in question. */ | |
12247 | ||
12248 | tree expl_subargs = TREE_OPERAND (arg, 1); | |
12249 | arg = TREE_OPERAND (arg, 0); | |
12250 | ||
12251 | for (; arg; arg = OVL_NEXT (arg)) | |
12252 | { | |
12253 | tree fn = OVL_CURRENT (arg); | |
12254 | tree subargs, elem; | |
12255 | ||
12256 | if (TREE_CODE (fn) != TEMPLATE_DECL) | |
12257 | continue; | |
12258 | ||
cc85b4c5 | 12259 | ++processing_template_decl; |
a34d3336 NS |
12260 | subargs = get_bindings (fn, DECL_TEMPLATE_RESULT (fn), |
12261 | expl_subargs, /*check_ret=*/false); | |
34016c81 JM |
12262 | if (subargs) |
12263 | { | |
c2ea3a40 | 12264 | elem = tsubst (TREE_TYPE (fn), subargs, tf_none, NULL_TREE); |
c8094d83 | 12265 | good += try_one_overload (tparms, targs, tempargs, parm, |
f23fb7f5 | 12266 | elem, strict, sub_strict, addr_p); |
34016c81 | 12267 | } |
cc85b4c5 | 12268 | --processing_template_decl; |
34016c81 JM |
12269 | } |
12270 | } | |
acde59b4 MM |
12271 | else if (TREE_CODE (arg) != OVERLOAD |
12272 | && TREE_CODE (arg) != FUNCTION_DECL) | |
12273 | /* If ARG is, for example, "(0, &f)" then its type will be unknown | |
12274 | -- but the deduction does not succeed because the expression is | |
12275 | not just the function on its own. */ | |
12276 | return false; | |
315fb5db | 12277 | else |
acde59b4 MM |
12278 | for (; arg; arg = OVL_NEXT (arg)) |
12279 | good += try_one_overload (tparms, targs, tempargs, parm, | |
12280 | TREE_TYPE (OVL_CURRENT (arg)), | |
12281 | strict, sub_strict, addr_p); | |
34016c81 JM |
12282 | |
12283 | /* [temp.deduct.type] A template-argument can be deduced from a pointer | |
12284 | to function or pointer to member function argument if the set of | |
12285 | overloaded functions does not contain function templates and at most | |
12286 | one of a set of overloaded functions provides a unique match. | |
12287 | ||
12288 | So if we found multiple possibilities, we return success but don't | |
12289 | deduce anything. */ | |
12290 | ||
12291 | if (good == 1) | |
12292 | { | |
12293 | int i = TREE_VEC_LENGTH (targs); | |
12294 | for (; i--; ) | |
12295 | if (TREE_VEC_ELT (tempargs, i)) | |
12296 | TREE_VEC_ELT (targs, i) = TREE_VEC_ELT (tempargs, i); | |
12297 | } | |
12298 | if (good) | |
acde59b4 | 12299 | return true; |
34016c81 | 12300 | |
acde59b4 | 12301 | return false; |
34016c81 JM |
12302 | } |
12303 | ||
12304 | /* Subroutine of resolve_overloaded_unification; does deduction for a single | |
12305 | overload. Fills TARGS with any deduced arguments, or error_mark_node if | |
12306 | different overloads deduce different arguments for a given parm. | |
f23fb7f5 MM |
12307 | ADDR_P is true if the expression for which deduction is being |
12308 | performed was of the form "& fn" rather than simply "fn". | |
12309 | ||
34016c81 JM |
12310 | Returns 1 on success. */ |
12311 | ||
12312 | static int | |
3a978d72 | 12313 | try_one_overload (tree tparms, |
0cbd7506 MS |
12314 | tree orig_targs, |
12315 | tree targs, | |
12316 | tree parm, | |
12317 | tree arg, | |
12318 | unification_kind_t strict, | |
f23fb7f5 MM |
12319 | int sub_strict, |
12320 | bool addr_p) | |
34016c81 JM |
12321 | { |
12322 | int nargs; | |
12323 | tree tempargs; | |
12324 | int i; | |
12325 | ||
12326 | /* [temp.deduct.type] A template-argument can be deduced from a pointer | |
12327 | to function or pointer to member function argument if the set of | |
12328 | overloaded functions does not contain function templates and at most | |
12329 | one of a set of overloaded functions provides a unique match. | |
12330 | ||
12331 | So if this is a template, just return success. */ | |
12332 | ||
12333 | if (uses_template_parms (arg)) | |
12334 | return 1; | |
12335 | ||
f23fb7f5 MM |
12336 | if (TREE_CODE (arg) == METHOD_TYPE) |
12337 | arg = build_ptrmemfunc_type (build_pointer_type (arg)); | |
12338 | else if (addr_p) | |
12339 | arg = build_pointer_type (arg); | |
12340 | ||
8af2fec4 | 12341 | sub_strict |= maybe_adjust_types_for_deduction (strict, &parm, &arg, NULL); |
34016c81 JM |
12342 | |
12343 | /* We don't copy orig_targs for this because if we have already deduced | |
12344 | some template args from previous args, unify would complain when we | |
12345 | try to deduce a template parameter for the same argument, even though | |
12346 | there isn't really a conflict. */ | |
12347 | nargs = TREE_VEC_LENGTH (targs); | |
f31c0a32 | 12348 | tempargs = make_tree_vec (nargs); |
34016c81 | 12349 | |
4393e105 | 12350 | if (unify (tparms, tempargs, parm, arg, sub_strict) != 0) |
34016c81 JM |
12351 | return 0; |
12352 | ||
12353 | /* First make sure we didn't deduce anything that conflicts with | |
e97e5263 | 12354 | explicitly specified args. */ |
34016c81 JM |
12355 | for (i = nargs; i--; ) |
12356 | { | |
12357 | tree elt = TREE_VEC_ELT (tempargs, i); | |
e97e5263 | 12358 | tree oldelt = TREE_VEC_ELT (orig_targs, i); |
34016c81 | 12359 | |
a34d3336 NS |
12360 | if (!elt) |
12361 | /*NOP*/; | |
34016c81 | 12362 | else if (uses_template_parms (elt)) |
a34d3336 NS |
12363 | /* Since we're unifying against ourselves, we will fill in |
12364 | template args used in the function parm list with our own | |
12365 | template parms. Discard them. */ | |
12366 | TREE_VEC_ELT (tempargs, i) = NULL_TREE; | |
12367 | else if (oldelt && !template_args_equal (oldelt, elt)) | |
34016c81 JM |
12368 | return 0; |
12369 | } | |
12370 | ||
12371 | for (i = nargs; i--; ) | |
12372 | { | |
12373 | tree elt = TREE_VEC_ELT (tempargs, i); | |
12374 | ||
12375 | if (elt) | |
12376 | TREE_VEC_ELT (targs, i) = elt; | |
12377 | } | |
12378 | ||
12379 | return 1; | |
12380 | } | |
12381 | ||
4393e105 MM |
12382 | /* PARM is a template class (perhaps with unbound template |
12383 | parameters). ARG is a fully instantiated type. If ARG can be | |
12384 | bound to PARM, return ARG, otherwise return NULL_TREE. TPARMS and | |
12385 | TARGS are as for unify. */ | |
fcfb9f96 MM |
12386 | |
12387 | static tree | |
3a978d72 | 12388 | try_class_unification (tree tparms, tree targs, tree parm, tree arg) |
4393e105 | 12389 | { |
4393e105 MM |
12390 | tree copy_of_targs; |
12391 | ||
12392 | if (!CLASSTYPE_TEMPLATE_INFO (arg) | |
c8094d83 | 12393 | || (most_general_template (CLASSTYPE_TI_TEMPLATE (arg)) |
68361a03 | 12394 | != most_general_template (CLASSTYPE_TI_TEMPLATE (parm)))) |
4393e105 MM |
12395 | return NULL_TREE; |
12396 | ||
12397 | /* We need to make a new template argument vector for the call to | |
12398 | unify. If we used TARGS, we'd clutter it up with the result of | |
12399 | the attempted unification, even if this class didn't work out. | |
12400 | We also don't want to commit ourselves to all the unifications | |
12401 | we've already done, since unification is supposed to be done on | |
12402 | an argument-by-argument basis. In other words, consider the | |
12403 | following pathological case: | |
12404 | ||
12405 | template <int I, int J, int K> | |
12406 | struct S {}; | |
c8094d83 | 12407 | |
4393e105 MM |
12408 | template <int I, int J> |
12409 | struct S<I, J, 2> : public S<I, I, I>, S<J, J, J> {}; | |
c8094d83 | 12410 | |
4393e105 MM |
12411 | template <int I, int J, int K> |
12412 | void f(S<I, J, K>, S<I, I, I>); | |
c8094d83 | 12413 | |
4393e105 | 12414 | void g() { |
0cbd7506 MS |
12415 | S<0, 0, 0> s0; |
12416 | S<0, 1, 2> s2; | |
c8094d83 | 12417 | |
0cbd7506 | 12418 | f(s0, s2); |
4393e105 MM |
12419 | } |
12420 | ||
12421 | Now, by the time we consider the unification involving `s2', we | |
12422 | already know that we must have `f<0, 0, 0>'. But, even though | |
0e339752 | 12423 | `S<0, 1, 2>' is derived from `S<0, 0, 0>', the code is invalid |
4393e105 MM |
12424 | because there are two ways to unify base classes of S<0, 1, 2> |
12425 | with S<I, I, I>. If we kept the already deduced knowledge, we | |
12426 | would reject the possibility I=1. */ | |
f31c0a32 | 12427 | copy_of_targs = make_tree_vec (TREE_VEC_LENGTH (targs)); |
c8094d83 | 12428 | |
4393e105 | 12429 | /* If unification failed, we're done. */ |
74601d7c KL |
12430 | if (unify (tparms, copy_of_targs, CLASSTYPE_TI_ARGS (parm), |
12431 | CLASSTYPE_TI_ARGS (arg), UNIFY_ALLOW_NONE)) | |
4393e105 | 12432 | return NULL_TREE; |
74601d7c KL |
12433 | |
12434 | return arg; | |
4393e105 MM |
12435 | } |
12436 | ||
a3a0fc7f NS |
12437 | /* Given a template type PARM and a class type ARG, find the unique |
12438 | base type in ARG that is an instance of PARM. We do not examine | |
12439 | ARG itself; only its base-classes. If there is not exactly one | |
12440 | appropriate base class, return NULL_TREE. PARM may be the type of | |
12441 | a partial specialization, as well as a plain template type. Used | |
12442 | by unify. */ | |
4393e105 MM |
12443 | |
12444 | static tree | |
a3a0fc7f | 12445 | get_template_base (tree tparms, tree targs, tree parm, tree arg) |
fcfb9f96 | 12446 | { |
a3a0fc7f NS |
12447 | tree rval = NULL_TREE; |
12448 | tree binfo; | |
12449 | ||
9e1e64ec | 12450 | gcc_assert (RECORD_OR_UNION_CODE_P (TREE_CODE (arg))); |
c8094d83 | 12451 | |
a3a0fc7f NS |
12452 | binfo = TYPE_BINFO (complete_type (arg)); |
12453 | if (!binfo) | |
12454 | /* The type could not be completed. */ | |
12455 | return NULL_TREE; | |
fcfb9f96 | 12456 | |
a3a0fc7f NS |
12457 | /* Walk in inheritance graph order. The search order is not |
12458 | important, and this avoids multiple walks of virtual bases. */ | |
12459 | for (binfo = TREE_CHAIN (binfo); binfo; binfo = TREE_CHAIN (binfo)) | |
fcfb9f96 | 12460 | { |
a3a0fc7f | 12461 | tree r = try_class_unification (tparms, targs, parm, BINFO_TYPE (binfo)); |
fcfb9f96 | 12462 | |
8d83768f NS |
12463 | if (r) |
12464 | { | |
12465 | /* If there is more than one satisfactory baseclass, then: | |
fcfb9f96 | 12466 | |
8d83768f | 12467 | [temp.deduct.call] |
fcfb9f96 | 12468 | |
8d83768f NS |
12469 | If they yield more than one possible deduced A, the type |
12470 | deduction fails. | |
4393e105 | 12471 | |
8d83768f | 12472 | applies. */ |
a3a0fc7f NS |
12473 | if (rval && !same_type_p (r, rval)) |
12474 | return NULL_TREE; | |
c8094d83 | 12475 | |
a3a0fc7f | 12476 | rval = r; |
8d83768f | 12477 | } |
fcfb9f96 MM |
12478 | } |
12479 | ||
a3a0fc7f | 12480 | return rval; |
fcfb9f96 MM |
12481 | } |
12482 | ||
db2767b6 MM |
12483 | /* Returns the level of DECL, which declares a template parameter. */ |
12484 | ||
e9659ab0 | 12485 | static int |
3a978d72 | 12486 | template_decl_level (tree decl) |
db2767b6 MM |
12487 | { |
12488 | switch (TREE_CODE (decl)) | |
12489 | { | |
12490 | case TYPE_DECL: | |
12491 | case TEMPLATE_DECL: | |
12492 | return TEMPLATE_TYPE_LEVEL (TREE_TYPE (decl)); | |
12493 | ||
12494 | case PARM_DECL: | |
12495 | return TEMPLATE_PARM_LEVEL (DECL_INITIAL (decl)); | |
12496 | ||
12497 | default: | |
315fb5db | 12498 | gcc_unreachable (); |
db2767b6 | 12499 | } |
315fb5db | 12500 | return 0; |
db2767b6 MM |
12501 | } |
12502 | ||
830bfa74 MM |
12503 | /* Decide whether ARG can be unified with PARM, considering only the |
12504 | cv-qualifiers of each type, given STRICT as documented for unify. | |
324f9dfb | 12505 | Returns nonzero iff the unification is OK on that basis. */ |
e92cc029 | 12506 | |
e9659ab0 | 12507 | static int |
3a978d72 | 12508 | check_cv_quals_for_unify (int strict, tree arg, tree parm) |
830bfa74 | 12509 | { |
4f2b0fb2 NS |
12510 | int arg_quals = cp_type_quals (arg); |
12511 | int parm_quals = cp_type_quals (parm); | |
12512 | ||
355f774d NS |
12513 | if (TREE_CODE (parm) == TEMPLATE_TYPE_PARM |
12514 | && !(strict & UNIFY_ALLOW_OUTER_MORE_CV_QUAL)) | |
4f2b0fb2 | 12515 | { |
2e9ceb77 | 12516 | /* Although a CVR qualifier is ignored when being applied to a |
0cbd7506 MS |
12517 | substituted template parameter ([8.3.2]/1 for example), that |
12518 | does not apply during deduction [14.8.2.4]/1, (even though | |
12519 | that is not explicitly mentioned, [14.8.2.4]/9 indicates | |
12520 | this). Except when we're allowing additional CV qualifiers | |
12521 | at the outer level [14.8.2.1]/3,1st bullet. */ | |
2e9ceb77 NS |
12522 | if ((TREE_CODE (arg) == REFERENCE_TYPE |
12523 | || TREE_CODE (arg) == FUNCTION_TYPE | |
12524 | || TREE_CODE (arg) == METHOD_TYPE) | |
12525 | && (parm_quals & (TYPE_QUAL_CONST | TYPE_QUAL_VOLATILE))) | |
12526 | return 0; | |
12527 | ||
12528 | if ((!POINTER_TYPE_P (arg) && TREE_CODE (arg) != TEMPLATE_TYPE_PARM) | |
12529 | && (parm_quals & TYPE_QUAL_RESTRICT)) | |
12530 | return 0; | |
4f2b0fb2 | 12531 | } |
2e9ceb77 | 12532 | |
62e4a758 | 12533 | if (!(strict & (UNIFY_ALLOW_MORE_CV_QUAL | UNIFY_ALLOW_OUTER_MORE_CV_QUAL)) |
4f2b0fb2 | 12534 | && (arg_quals & parm_quals) != parm_quals) |
ef637255 MM |
12535 | return 0; |
12536 | ||
62e4a758 | 12537 | if (!(strict & (UNIFY_ALLOW_LESS_CV_QUAL | UNIFY_ALLOW_OUTER_LESS_CV_QUAL)) |
4f2b0fb2 | 12538 | && (parm_quals & arg_quals) != arg_quals) |
ef637255 MM |
12539 | return 0; |
12540 | ||
ef637255 | 12541 | return 1; |
830bfa74 MM |
12542 | } |
12543 | ||
5d80a306 DG |
12544 | /* Determines the LEVEL and INDEX for the template parameter PARM. */ |
12545 | void | |
12546 | template_parm_level_and_index (tree parm, int* level, int* index) | |
12547 | { | |
12548 | if (TREE_CODE (parm) == TEMPLATE_TYPE_PARM | |
12549 | || TREE_CODE (parm) == TEMPLATE_TEMPLATE_PARM | |
12550 | || TREE_CODE (parm) == BOUND_TEMPLATE_TEMPLATE_PARM) | |
12551 | { | |
12552 | *index = TEMPLATE_TYPE_IDX (parm); | |
12553 | *level = TEMPLATE_TYPE_LEVEL (parm); | |
12554 | } | |
12555 | else | |
12556 | { | |
12557 | *index = TEMPLATE_PARM_IDX (parm); | |
12558 | *level = TEMPLATE_PARM_LEVEL (parm); | |
12559 | } | |
12560 | } | |
12561 | ||
12562 | /* Unifies the remaining arguments in PACKED_ARGS with the pack | |
12563 | expansion at the end of PACKED_PARMS. Returns 0 if the type | |
12564 | deduction succeeds, 1 otherwise. STRICT is the same as in | |
12565 | unify. CALL_ARGS_P is true iff PACKED_ARGS is actually a function | |
12566 | call argument list. We'll need to adjust the arguments to make them | |
12567 | types. SUBR tells us if this is from a recursive call to | |
12568 | type_unification_real. */ | |
12569 | int | |
12570 | unify_pack_expansion (tree tparms, tree targs, tree packed_parms, | |
12571 | tree packed_args, int strict, bool call_args_p, | |
12572 | bool subr) | |
12573 | { | |
12574 | tree parm | |
12575 | = TREE_VEC_ELT (packed_parms, TREE_VEC_LENGTH (packed_parms) - 1); | |
12576 | tree pattern = PACK_EXPANSION_PATTERN (parm); | |
12577 | tree pack, packs = NULL_TREE; | |
12578 | int i, start = TREE_VEC_LENGTH (packed_parms) - 1; | |
12579 | int len = TREE_VEC_LENGTH (packed_args); | |
12580 | ||
12581 | /* Determine the parameter packs we will be deducing from the | |
12582 | pattern, and record their current deductions. */ | |
12583 | for (pack = PACK_EXPANSION_PARAMETER_PACKS (parm); | |
12584 | pack; pack = TREE_CHAIN (pack)) | |
12585 | { | |
12586 | tree parm_pack = TREE_VALUE (pack); | |
12587 | int idx, level; | |
12588 | ||
12589 | /* Determine the index and level of this parameter pack. */ | |
12590 | template_parm_level_and_index (parm_pack, &level, &idx); | |
12591 | ||
12592 | /* Keep track of the parameter packs and their corresponding | |
12593 | argument packs. */ | |
12594 | packs = tree_cons (parm_pack, TMPL_ARG (targs, level, idx), packs); | |
12595 | TREE_TYPE (packs) = make_tree_vec (len - start); | |
12596 | } | |
12597 | ||
12598 | /* Loop through all of the arguments that have not yet been | |
12599 | unified and unify each with the pattern. */ | |
12600 | for (i = start; i < len; i++) | |
12601 | { | |
12602 | tree parm = pattern; | |
12603 | ||
12604 | /* For each parameter pack, clear out the deduced value so that | |
12605 | we can deduce it again. */ | |
12606 | for (pack = packs; pack; pack = TREE_CHAIN (pack)) | |
12607 | { | |
12608 | int idx, level; | |
12609 | template_parm_level_and_index (TREE_PURPOSE (pack), &level, &idx); | |
12610 | ||
12611 | TMPL_ARG (targs, level, idx) = NULL_TREE; | |
12612 | } | |
12613 | ||
12614 | /* Unify the pattern with the current argument. */ | |
12615 | { | |
12616 | tree arg = TREE_VEC_ELT (packed_args, i); | |
2afad0f6 | 12617 | tree arg_expr = NULL_TREE; |
5d80a306 DG |
12618 | int arg_strict = strict; |
12619 | bool skip_arg_p = false; | |
12620 | ||
12621 | if (call_args_p) | |
12622 | { | |
12623 | int sub_strict; | |
12624 | ||
12625 | /* This mirrors what we do in type_unification_real. */ | |
12626 | switch (strict) | |
12627 | { | |
12628 | case DEDUCE_CALL: | |
12629 | sub_strict = (UNIFY_ALLOW_OUTER_LEVEL | |
12630 | | UNIFY_ALLOW_MORE_CV_QUAL | |
12631 | | UNIFY_ALLOW_DERIVED); | |
12632 | break; | |
12633 | ||
12634 | case DEDUCE_CONV: | |
12635 | sub_strict = UNIFY_ALLOW_LESS_CV_QUAL; | |
12636 | break; | |
12637 | ||
12638 | case DEDUCE_EXACT: | |
12639 | sub_strict = UNIFY_ALLOW_NONE; | |
12640 | break; | |
12641 | ||
12642 | default: | |
12643 | gcc_unreachable (); | |
12644 | } | |
12645 | ||
12646 | if (!TYPE_P (arg)) | |
12647 | { | |
12648 | gcc_assert (TREE_TYPE (arg) != NULL_TREE); | |
12649 | if (type_unknown_p (arg)) | |
12650 | { | |
12651 | /* [temp.deduct.type] A template-argument can be | |
12652 | deduced from a pointer to function or pointer | |
12653 | to member function argument if the set of | |
12654 | overloaded functions does not contain function | |
12655 | templates and at most one of a set of | |
12656 | overloaded functions provides a unique | |
12657 | match. */ | |
12658 | ||
12659 | if (resolve_overloaded_unification | |
12660 | (tparms, targs, parm, arg, strict, sub_strict) | |
12661 | != 0) | |
12662 | return 1; | |
12663 | skip_arg_p = true; | |
12664 | } | |
12665 | ||
12666 | if (!skip_arg_p) | |
12667 | { | |
2afad0f6 DG |
12668 | arg_expr = arg; |
12669 | arg = unlowered_expr_type (arg); | |
5d80a306 DG |
12670 | if (arg == error_mark_node) |
12671 | return 1; | |
12672 | } | |
12673 | } | |
12674 | ||
12675 | arg_strict = sub_strict; | |
12676 | ||
12677 | if (!subr) | |
12678 | arg_strict |= | |
2afad0f6 DG |
12679 | maybe_adjust_types_for_deduction (strict, &parm, &arg, |
12680 | arg_expr); | |
5d80a306 DG |
12681 | } |
12682 | ||
12683 | if (!skip_arg_p) | |
12684 | { | |
12685 | if (unify (tparms, targs, parm, arg, arg_strict)) | |
12686 | return 1; | |
12687 | } | |
12688 | } | |
12689 | ||
12690 | /* For each parameter pack, collect the deduced value. */ | |
12691 | for (pack = packs; pack; pack = TREE_CHAIN (pack)) | |
12692 | { | |
12693 | int idx, level; | |
12694 | template_parm_level_and_index (TREE_PURPOSE (pack), &level, &idx); | |
12695 | ||
12696 | TREE_VEC_ELT (TREE_TYPE (pack), i - start) = | |
12697 | TMPL_ARG (targs, level, idx); | |
12698 | } | |
12699 | } | |
12700 | ||
12701 | /* Verify that the results of unification with the parameter packs | |
12702 | produce results consistent with what we've seen before, and make | |
12703 | the deduced argument packs available. */ | |
12704 | for (pack = packs; pack; pack = TREE_CHAIN (pack)) | |
12705 | { | |
12706 | tree old_pack = TREE_VALUE (pack); | |
12707 | tree new_args = TREE_TYPE (pack); | |
db60ff18 DG |
12708 | int i, len = TREE_VEC_LENGTH (new_args); |
12709 | bool nondeduced_p = false; | |
12710 | ||
12711 | /* If NEW_ARGS contains any NULL_TREE entries, we didn't | |
12712 | actually deduce anything. */ | |
12713 | for (i = 0; i < len && !nondeduced_p; ++i) | |
12714 | if (TREE_VEC_ELT (new_args, i) == NULL_TREE) | |
12715 | nondeduced_p = true; | |
12716 | if (nondeduced_p) | |
12717 | continue; | |
5d80a306 DG |
12718 | |
12719 | if (old_pack && ARGUMENT_PACK_INCOMPLETE_P (old_pack)) | |
12720 | { | |
12721 | /* Prepend the explicit arguments onto NEW_ARGS. */ | |
12722 | tree explicit_args = ARGUMENT_PACK_EXPLICIT_ARGS (old_pack); | |
12723 | tree old_args = new_args; | |
12724 | int i, explicit_len = TREE_VEC_LENGTH (explicit_args); | |
12725 | int len = explicit_len + TREE_VEC_LENGTH (old_args); | |
12726 | ||
12727 | /* Copy the explicit arguments. */ | |
12728 | new_args = make_tree_vec (len); | |
12729 | for (i = 0; i < explicit_len; i++) | |
12730 | TREE_VEC_ELT (new_args, i) = TREE_VEC_ELT (explicit_args, i); | |
12731 | ||
12732 | /* Copy the deduced arguments. */ | |
12733 | for (; i < len; i++) | |
12734 | TREE_VEC_ELT (new_args, i) = | |
12735 | TREE_VEC_ELT (old_args, i - explicit_len); | |
12736 | } | |
12737 | ||
12738 | if (!old_pack) | |
12739 | { | |
12740 | tree result; | |
12741 | int idx, level; | |
12742 | ||
12743 | template_parm_level_and_index (TREE_PURPOSE (pack), &level, &idx); | |
12744 | ||
12745 | /* Build the deduced *_ARGUMENT_PACK. */ | |
12746 | if (TREE_CODE (TREE_PURPOSE (pack)) == TEMPLATE_PARM_INDEX) | |
12747 | { | |
12748 | result = make_node (NONTYPE_ARGUMENT_PACK); | |
12749 | TREE_TYPE (result) = | |
12750 | TREE_TYPE (TEMPLATE_PARM_DECL (TREE_PURPOSE (pack))); | |
12751 | TREE_CONSTANT (result) = 1; | |
12752 | } | |
12753 | else | |
12754 | result = make_node (TYPE_ARGUMENT_PACK); | |
12755 | ||
12756 | SET_ARGUMENT_PACK_ARGS (result, new_args); | |
12757 | ||
12758 | /* Note the deduced argument packs for this parameter | |
12759 | pack. */ | |
12760 | TMPL_ARG (targs, level, idx) = result; | |
12761 | } | |
12762 | else if (ARGUMENT_PACK_INCOMPLETE_P (old_pack) | |
12763 | && (ARGUMENT_PACK_ARGS (old_pack) | |
12764 | == ARGUMENT_PACK_EXPLICIT_ARGS (old_pack))) | |
12765 | { | |
12766 | /* We only had the explicitly-provided arguments before, but | |
12767 | now we have a complete set of arguments. */ | |
12768 | int idx, level; | |
12769 | tree explicit_args = ARGUMENT_PACK_EXPLICIT_ARGS (old_pack); | |
12770 | template_parm_level_and_index (TREE_PURPOSE (pack), &level, &idx); | |
12771 | ||
12772 | /* Keep the original deduced argument pack. */ | |
12773 | TMPL_ARG (targs, level, idx) = old_pack; | |
12774 | ||
12775 | SET_ARGUMENT_PACK_ARGS (old_pack, new_args); | |
12776 | ARGUMENT_PACK_INCOMPLETE_P (old_pack) = 1; | |
12777 | ARGUMENT_PACK_EXPLICIT_ARGS (old_pack) = explicit_args; | |
12778 | } | |
12779 | else if (!comp_template_args (ARGUMENT_PACK_ARGS (old_pack), | |
12780 | new_args)) | |
12781 | /* Inconsistent unification of this parameter pack. */ | |
12782 | return 1; | |
12783 | else | |
12784 | { | |
12785 | int idx, level; | |
12786 | ||
12787 | template_parm_level_and_index (TREE_PURPOSE (pack), &level, &idx); | |
12788 | ||
12789 | /* Keep the original deduced argument pack. */ | |
12790 | TMPL_ARG (targs, level, idx) = old_pack; | |
12791 | } | |
12792 | } | |
12793 | ||
12794 | return 0; | |
12795 | } | |
12796 | ||
916b63c3 MM |
12797 | /* Deduce the value of template parameters. TPARMS is the (innermost) |
12798 | set of template parameters to a template. TARGS is the bindings | |
12799 | for those template parameters, as determined thus far; TARGS may | |
12800 | include template arguments for outer levels of template parameters | |
12801 | as well. PARM is a parameter to a template function, or a | |
12802 | subcomponent of that parameter; ARG is the corresponding argument. | |
12803 | This function attempts to match PARM with ARG in a manner | |
12804 | consistent with the existing assignments in TARGS. If more values | |
12805 | are deduced, then TARGS is updated. | |
12806 | ||
12807 | Returns 0 if the type deduction succeeds, 1 otherwise. The | |
12808 | parameter STRICT is a bitwise or of the following flags: | |
830bfa74 MM |
12809 | |
12810 | UNIFY_ALLOW_NONE: | |
12811 | Require an exact match between PARM and ARG. | |
12812 | UNIFY_ALLOW_MORE_CV_QUAL: | |
028d1f20 NS |
12813 | Allow the deduced ARG to be more cv-qualified (by qualification |
12814 | conversion) than ARG. | |
830bfa74 MM |
12815 | UNIFY_ALLOW_LESS_CV_QUAL: |
12816 | Allow the deduced ARG to be less cv-qualified than ARG. | |
12817 | UNIFY_ALLOW_DERIVED: | |
12818 | Allow the deduced ARG to be a template base class of ARG, | |
12819 | or a pointer to a template base class of the type pointed to by | |
161c12b0 JM |
12820 | ARG. |
12821 | UNIFY_ALLOW_INTEGER: | |
12822 | Allow any integral type to be deduced. See the TEMPLATE_PARM_INDEX | |
c8094d83 | 12823 | case for more information. |
028d1f20 NS |
12824 | UNIFY_ALLOW_OUTER_LEVEL: |
12825 | This is the outermost level of a deduction. Used to determine validity | |
12826 | of qualification conversions. A valid qualification conversion must | |
12827 | have const qualified pointers leading up to the inner type which | |
12828 | requires additional CV quals, except at the outer level, where const | |
12829 | is not required [conv.qual]. It would be normal to set this flag in | |
62e4a758 NS |
12830 | addition to setting UNIFY_ALLOW_MORE_CV_QUAL. |
12831 | UNIFY_ALLOW_OUTER_MORE_CV_QUAL: | |
12832 | This is the outermost level of a deduction, and PARM can be more CV | |
12833 | qualified at this point. | |
12834 | UNIFY_ALLOW_OUTER_LESS_CV_QUAL: | |
12835 | This is the outermost level of a deduction, and PARM can be less CV | |
8baddbf1 | 12836 | qualified at this point. */ |
830bfa74 | 12837 | |
e9659ab0 | 12838 | static int |
3a978d72 | 12839 | unify (tree tparms, tree targs, tree parm, tree arg, int strict) |
8d08fdba MS |
12840 | { |
12841 | int idx; | |
050367a3 | 12842 | tree targ; |
db2767b6 | 12843 | tree tparm; |
028d1f20 | 12844 | int strict_in = strict; |
8d08fdba MS |
12845 | |
12846 | /* I don't think this will do the right thing with respect to types. | |
12847 | But the only case I've seen it in so far has been array bounds, where | |
12848 | signedness is the only information lost, and I think that will be | |
12849 | okay. */ | |
12850 | while (TREE_CODE (parm) == NOP_EXPR) | |
12851 | parm = TREE_OPERAND (parm, 0); | |
12852 | ||
12853 | if (arg == error_mark_node) | |
12854 | return 1; | |
12855 | if (arg == unknown_type_node) | |
34016c81 JM |
12856 | /* We can't deduce anything from this, but we might get all the |
12857 | template args from other function args. */ | |
12858 | return 0; | |
12859 | ||
db2767b6 | 12860 | /* If PARM uses template parameters, then we can't bail out here, |
6bdb985f | 12861 | even if ARG == PARM, since we won't record unifications for the |
db2767b6 MM |
12862 | template parameters. We might need them if we're trying to |
12863 | figure out which of two things is more specialized. */ | |
12864 | if (arg == parm && !uses_template_parms (parm)) | |
8d08fdba MS |
12865 | return 0; |
12866 | ||
830bfa74 MM |
12867 | /* Immediately reject some pairs that won't unify because of |
12868 | cv-qualification mismatches. */ | |
12869 | if (TREE_CODE (arg) == TREE_CODE (parm) | |
2f939d94 | 12870 | && TYPE_P (arg) |
d0ab7624 | 12871 | /* It is the elements of the array which hold the cv quals of an array |
0cbd7506 MS |
12872 | type, and the elements might be template type parms. We'll check |
12873 | when we recurse. */ | |
d0ab7624 | 12874 | && TREE_CODE (arg) != ARRAY_TYPE |
830bfa74 MM |
12875 | /* We check the cv-qualifiers when unifying with template type |
12876 | parameters below. We want to allow ARG `const T' to unify with | |
12877 | PARM `T' for example, when computing which of two templates | |
12878 | is more specialized, for example. */ | |
12879 | && TREE_CODE (arg) != TEMPLATE_TYPE_PARM | |
028d1f20 | 12880 | && !check_cv_quals_for_unify (strict_in, arg, parm)) |
49432171 JM |
12881 | return 1; |
12882 | ||
028d1f20 | 12883 | if (!(strict & UNIFY_ALLOW_OUTER_LEVEL) |
3ea099f1 | 12884 | && TYPE_P (parm) && !CP_TYPE_CONST_P (parm)) |
028d1f20 NS |
12885 | strict &= ~UNIFY_ALLOW_MORE_CV_QUAL; |
12886 | strict &= ~UNIFY_ALLOW_OUTER_LEVEL; | |
12887 | strict &= ~UNIFY_ALLOW_DERIVED; | |
62e4a758 NS |
12888 | strict &= ~UNIFY_ALLOW_OUTER_MORE_CV_QUAL; |
12889 | strict &= ~UNIFY_ALLOW_OUTER_LESS_CV_QUAL; | |
c8094d83 | 12890 | |
8d08fdba MS |
12891 | switch (TREE_CODE (parm)) |
12892 | { | |
2ca340ae | 12893 | case TYPENAME_TYPE: |
fccef71e | 12894 | case SCOPE_REF: |
b8c6534b | 12895 | case UNBOUND_CLASS_TEMPLATE: |
2ca340ae JM |
12896 | /* In a type which contains a nested-name-specifier, template |
12897 | argument values cannot be deduced for template parameters used | |
12898 | within the nested-name-specifier. */ | |
12899 | return 0; | |
12900 | ||
8d08fdba | 12901 | case TEMPLATE_TYPE_PARM: |
73b0fce8 | 12902 | case TEMPLATE_TEMPLATE_PARM: |
a1281f45 | 12903 | case BOUND_TEMPLATE_TEMPLATE_PARM: |
db2767b6 | 12904 | tparm = TREE_VALUE (TREE_VEC_ELT (tparms, 0)); |
833be229 PC |
12905 | if (tparm == error_mark_node) |
12906 | return 1; | |
db2767b6 MM |
12907 | |
12908 | if (TEMPLATE_TYPE_LEVEL (parm) | |
12909 | != template_decl_level (tparm)) | |
12910 | /* The PARM is not one we're trying to unify. Just check | |
12911 | to see if it matches ARG. */ | |
12912 | return (TREE_CODE (arg) == TREE_CODE (parm) | |
3bfdc719 | 12913 | && same_type_p (parm, arg)) ? 0 : 1; |
73b0fce8 | 12914 | idx = TEMPLATE_TYPE_IDX (parm); |
916b63c3 | 12915 | targ = TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs), idx); |
db2767b6 | 12916 | tparm = TREE_VALUE (TREE_VEC_ELT (tparms, idx)); |
050367a3 | 12917 | |
73b0fce8 | 12918 | /* Check for mixed types and values. */ |
db2767b6 MM |
12919 | if ((TREE_CODE (parm) == TEMPLATE_TYPE_PARM |
12920 | && TREE_CODE (tparm) != TYPE_DECL) | |
c8094d83 | 12921 | || (TREE_CODE (parm) == TEMPLATE_TEMPLATE_PARM |
db2767b6 | 12922 | && TREE_CODE (tparm) != TEMPLATE_DECL)) |
73b0fce8 KL |
12923 | return 1; |
12924 | ||
a1281f45 | 12925 | if (TREE_CODE (parm) == BOUND_TEMPLATE_TEMPLATE_PARM) |
73b0fce8 | 12926 | { |
b429fdf0 KL |
12927 | /* ARG must be constructed from a template class or a template |
12928 | template parameter. */ | |
12929 | if (TREE_CODE (arg) != BOUND_TEMPLATE_TEMPLATE_PARM | |
4e95268d | 12930 | && !CLASSTYPE_SPECIALIZATION_OF_PRIMARY_TEMPLATE_P (arg)) |
a1281f45 | 12931 | return 1; |
73b0fce8 | 12932 | |
a1281f45 | 12933 | { |
a1281f45 | 12934 | tree parmvec = TYPE_TI_ARGS (parm); |
6df91b00 | 12935 | tree argvec = INNERMOST_TEMPLATE_ARGS (TYPE_TI_ARGS (arg)); |
a0a5f30f | 12936 | tree parm_parms |
063cc99c | 12937 | = DECL_INNERMOST_TEMPLATE_PARMS |
a0a5f30f | 12938 | (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (parm)); |
4cf36211 DG |
12939 | int i, len; |
12940 | int parm_variadic_p = 0; | |
73b0fce8 | 12941 | |
e7e93965 MM |
12942 | /* The resolution to DR150 makes clear that default |
12943 | arguments for an N-argument may not be used to bind T | |
12944 | to a template template parameter with fewer than N | |
12945 | parameters. It is not safe to permit the binding of | |
12946 | default arguments as an extension, as that may change | |
12947 | the meaning of a conforming program. Consider: | |
12948 | ||
12949 | struct Dense { static const unsigned int dim = 1; }; | |
12950 | ||
12951 | template <template <typename> class View, | |
12952 | typename Block> | |
12953 | void operator+(float, View<Block> const&); | |
12954 | ||
3db45ab5 MS |
12955 | template <typename Block, |
12956 | unsigned int Dim = Block::dim> | |
e7e93965 MM |
12957 | struct Lvalue_proxy { operator float() const; }; |
12958 | ||
12959 | void | |
12960 | test_1d (void) { | |
12961 | Lvalue_proxy<Dense> p; | |
12962 | float b; | |
12963 | b + p; | |
12964 | } | |
a1281f45 | 12965 | |
e7e93965 MM |
12966 | Here, if Lvalue_proxy is permitted to bind to View, then |
12967 | the global operator+ will be used; if they are not, the | |
3db45ab5 | 12968 | Lvalue_proxy will be converted to float. */ |
a0a5f30f DG |
12969 | if (coerce_template_parms (parm_parms, |
12970 | argvec, | |
e7e93965 MM |
12971 | TYPE_TI_TEMPLATE (parm), |
12972 | tf_none, | |
12973 | /*require_all_args=*/true, | |
12974 | /*use_default_args=*/false) | |
0cbd7506 | 12975 | == error_mark_node) |
a1281f45 | 12976 | return 1; |
c8094d83 MS |
12977 | |
12978 | /* Deduce arguments T, i from TT<T> or TT<i>. | |
a1281f45 KL |
12979 | We check each element of PARMVEC and ARGVEC individually |
12980 | rather than the whole TREE_VEC since they can have | |
12981 | different number of elements. */ | |
6b9b6b15 | 12982 | |
4cf36211 DG |
12983 | parmvec = expand_template_argument_pack (parmvec); |
12984 | argvec = expand_template_argument_pack (argvec); | |
12985 | ||
12986 | len = TREE_VEC_LENGTH (parmvec); | |
12987 | ||
12988 | /* Check if the parameters end in a pack, making them | |
12989 | variadic. */ | |
12990 | if (len > 0 | |
12991 | && PACK_EXPANSION_P (TREE_VEC_ELT (parmvec, len - 1))) | |
12992 | parm_variadic_p = 1; | |
12993 | ||
12994 | if (TREE_VEC_LENGTH (argvec) < len - parm_variadic_p) | |
12995 | return 1; | |
12996 | ||
12997 | for (i = 0; i < len - parm_variadic_p; ++i) | |
a1281f45 | 12998 | { |
0cbd7506 | 12999 | if (unify (tparms, targs, |
c8094d83 MS |
13000 | TREE_VEC_ELT (parmvec, i), |
13001 | TREE_VEC_ELT (argvec, i), | |
a1281f45 KL |
13002 | UNIFY_ALLOW_NONE)) |
13003 | return 1; | |
73b0fce8 | 13004 | } |
4cf36211 DG |
13005 | |
13006 | if (parm_variadic_p | |
13007 | && unify_pack_expansion (tparms, targs, | |
13008 | parmvec, argvec, | |
13009 | UNIFY_ALLOW_NONE, | |
13010 | /*call_args_p=*/false, | |
13011 | /*subr=*/false)) | |
13012 | return 1; | |
a1281f45 | 13013 | } |
b429fdf0 | 13014 | arg = TYPE_TI_TEMPLATE (arg); |
a1281f45 KL |
13015 | |
13016 | /* Fall through to deduce template name. */ | |
13017 | } | |
13018 | ||
13019 | if (TREE_CODE (parm) == TEMPLATE_TEMPLATE_PARM | |
13020 | || TREE_CODE (parm) == BOUND_TEMPLATE_TEMPLATE_PARM) | |
13021 | { | |
13022 | /* Deduce template name TT from TT, TT<>, TT<T> and TT<i>. */ | |
13023 | ||
13024 | /* Simple cases: Value already set, does match or doesn't. */ | |
13025 | if (targ != NULL_TREE && template_args_equal (targ, arg)) | |
13026 | return 0; | |
13027 | else if (targ) | |
13028 | return 1; | |
db2767b6 MM |
13029 | } |
13030 | else | |
13031 | { | |
830bfa74 MM |
13032 | /* If PARM is `const T' and ARG is only `int', we don't have |
13033 | a match unless we are allowing additional qualification. | |
13034 | If ARG is `const int' and PARM is just `T' that's OK; | |
13035 | that binds `const int' to `T'. */ | |
c8094d83 | 13036 | if (!check_cv_quals_for_unify (strict_in | UNIFY_ALLOW_LESS_CV_QUAL, |
830bfa74 | 13037 | arg, parm)) |
db2767b6 MM |
13038 | return 1; |
13039 | ||
830bfa74 MM |
13040 | /* Consider the case where ARG is `const volatile int' and |
13041 | PARM is `const T'. Then, T should be `volatile int'. */ | |
c2ea3a40 NS |
13042 | arg = cp_build_qualified_type_real |
13043 | (arg, cp_type_quals (arg) & ~cp_type_quals (parm), tf_none); | |
adecb3f4 MM |
13044 | if (arg == error_mark_node) |
13045 | return 1; | |
73b0fce8 | 13046 | |
a1281f45 KL |
13047 | /* Simple cases: Value already set, does match or doesn't. */ |
13048 | if (targ != NULL_TREE && same_type_p (targ, arg)) | |
13049 | return 0; | |
13050 | else if (targ) | |
13051 | return 1; | |
61cd552e | 13052 | |
94fc547c MM |
13053 | /* Make sure that ARG is not a variable-sized array. (Note |
13054 | that were talking about variable-sized arrays (like | |
13055 | `int[n]'), rather than arrays of unknown size (like | |
13056 | `int[]').) We'll get very confused by such a type since | |
13057 | the bound of the array will not be computable in an | |
13058 | instantiation. Besides, such types are not allowed in | |
13059 | ISO C++, so we can do as we please here. */ | |
5377d5ba | 13060 | if (variably_modified_type_p (arg, NULL_TREE)) |
94fc547c MM |
13061 | return 1; |
13062 | } | |
61cd552e | 13063 | |
5d80a306 DG |
13064 | /* If ARG is a parameter pack or an expansion, we cannot unify |
13065 | against it unless PARM is also a parameter pack. */ | |
13066 | if ((template_parameter_pack_p (arg) || PACK_EXPANSION_P (arg)) | |
13067 | && !template_parameter_pack_p (parm)) | |
13068 | return 1; | |
13069 | ||
916b63c3 | 13070 | TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs), idx) = arg; |
73b0fce8 KL |
13071 | return 0; |
13072 | ||
f84b4be9 | 13073 | case TEMPLATE_PARM_INDEX: |
db2767b6 | 13074 | tparm = TREE_VALUE (TREE_VEC_ELT (tparms, 0)); |
3e9ac7e5 VR |
13075 | if (tparm == error_mark_node) |
13076 | return 1; | |
db2767b6 | 13077 | |
c8094d83 | 13078 | if (TEMPLATE_PARM_LEVEL (parm) |
db2767b6 MM |
13079 | != template_decl_level (tparm)) |
13080 | /* The PARM is not one we're trying to unify. Just check | |
13081 | to see if it matches ARG. */ | |
c8a209ca NS |
13082 | return !(TREE_CODE (arg) == TREE_CODE (parm) |
13083 | && cp_tree_equal (parm, arg)); | |
db2767b6 | 13084 | |
f84b4be9 | 13085 | idx = TEMPLATE_PARM_IDX (parm); |
916b63c3 | 13086 | targ = TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs), idx); |
db2767b6 | 13087 | |
050367a3 | 13088 | if (targ) |
c8a209ca | 13089 | return !cp_tree_equal (targ, arg); |
8d08fdba | 13090 | |
161c12b0 JM |
13091 | /* [temp.deduct.type] If, in the declaration of a function template |
13092 | with a non-type template-parameter, the non-type | |
13093 | template-parameter is used in an expression in the function | |
13094 | parameter-list and, if the corresponding template-argument is | |
13095 | deduced, the template-argument type shall match the type of the | |
13096 | template-parameter exactly, except that a template-argument | |
c8094d83 | 13097 | deduced from an array bound may be of any integral type. |
d7c4edd0 | 13098 | The non-type parameter might use already deduced type parameters. */ |
bd0d5d4a | 13099 | tparm = tsubst (TREE_TYPE (parm), targs, 0, NULL_TREE); |
e2005c8d KL |
13100 | if (!TREE_TYPE (arg)) |
13101 | /* Template-parameter dependent expression. Just accept it for now. | |
13102 | It will later be processed in convert_template_argument. */ | |
13103 | ; | |
13104 | else if (same_type_p (TREE_TYPE (arg), tparm)) | |
13105 | /* OK */; | |
161c12b0 | 13106 | else if ((strict & UNIFY_ALLOW_INTEGER) |
bd0d5d4a JM |
13107 | && (TREE_CODE (tparm) == INTEGER_TYPE |
13108 | || TREE_CODE (tparm) == BOOLEAN_TYPE)) | |
8baddbf1 MM |
13109 | /* Convert the ARG to the type of PARM; the deduced non-type |
13110 | template argument must exactly match the types of the | |
13111 | corresponding parameter. */ | |
13112 | arg = fold (build_nop (TREE_TYPE (parm), arg)); | |
bd0d5d4a JM |
13113 | else if (uses_template_parms (tparm)) |
13114 | /* We haven't deduced the type of this parameter yet. Try again | |
13115 | later. */ | |
13116 | return 0; | |
161c12b0 JM |
13117 | else |
13118 | return 1; | |
13119 | ||
5d80a306 DG |
13120 | /* If ARG is a parameter pack or an expansion, we cannot unify |
13121 | against it unless PARM is also a parameter pack. */ | |
13122 | if ((template_parameter_pack_p (arg) || PACK_EXPANSION_P (arg)) | |
13123 | && !TEMPLATE_PARM_PARAMETER_PACK (parm)) | |
13124 | return 1; | |
13125 | ||
916b63c3 | 13126 | TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs), idx) = arg; |
8d08fdba MS |
13127 | return 0; |
13128 | ||
28e8f3a0 GB |
13129 | case PTRMEM_CST: |
13130 | { | |
0cbd7506 MS |
13131 | /* A pointer-to-member constant can be unified only with |
13132 | another constant. */ | |
28e8f3a0 | 13133 | if (TREE_CODE (arg) != PTRMEM_CST) |
0cbd7506 | 13134 | return 1; |
28e8f3a0 GB |
13135 | |
13136 | /* Just unify the class member. It would be useless (and possibly | |
0cbd7506 MS |
13137 | wrong, depending on the strict flags) to unify also |
13138 | PTRMEM_CST_CLASS, because we want to be sure that both parm and | |
13139 | arg refer to the same variable, even if through different | |
13140 | classes. For instance: | |
28e8f3a0 | 13141 | |
0cbd7506 MS |
13142 | struct A { int x; }; |
13143 | struct B : A { }; | |
28e8f3a0 | 13144 | |
0cbd7506 | 13145 | Unification of &A::x and &B::x must succeed. */ |
28e8f3a0 | 13146 | return unify (tparms, targs, PTRMEM_CST_MEMBER (parm), |
0cbd7506 | 13147 | PTRMEM_CST_MEMBER (arg), strict); |
28e8f3a0 GB |
13148 | } |
13149 | ||
8d08fdba | 13150 | case POINTER_TYPE: |
830bfa74 | 13151 | { |
830bfa74 MM |
13152 | if (TREE_CODE (arg) != POINTER_TYPE) |
13153 | return 1; | |
c8094d83 | 13154 | |
830bfa74 MM |
13155 | /* [temp.deduct.call] |
13156 | ||
13157 | A can be another pointer or pointer to member type that can | |
13158 | be converted to the deduced A via a qualification | |
13159 | conversion (_conv.qual_). | |
13160 | ||
13161 | We pass down STRICT here rather than UNIFY_ALLOW_NONE. | |
13162 | This will allow for additional cv-qualification of the | |
028d1f20 | 13163 | pointed-to types if appropriate. */ |
c8094d83 | 13164 | |
028d1f20 | 13165 | if (TREE_CODE (TREE_TYPE (arg)) == RECORD_TYPE) |
830bfa74 MM |
13166 | /* The derived-to-base conversion only persists through one |
13167 | level of pointers. */ | |
028d1f20 | 13168 | strict |= (strict_in & UNIFY_ALLOW_DERIVED); |
830bfa74 | 13169 | |
c8094d83 | 13170 | return unify (tparms, targs, TREE_TYPE (parm), |
028d1f20 | 13171 | TREE_TYPE (arg), strict); |
830bfa74 | 13172 | } |
8d08fdba MS |
13173 | |
13174 | case REFERENCE_TYPE: | |
830bfa74 MM |
13175 | if (TREE_CODE (arg) != REFERENCE_TYPE) |
13176 | return 1; | |
13177 | return unify (tparms, targs, TREE_TYPE (parm), TREE_TYPE (arg), | |
028d1f20 | 13178 | strict & UNIFY_ALLOW_MORE_CV_QUAL); |
8d08fdba MS |
13179 | |
13180 | case ARRAY_TYPE: | |
13181 | if (TREE_CODE (arg) != ARRAY_TYPE) | |
13182 | return 1; | |
3042d5be MM |
13183 | if ((TYPE_DOMAIN (parm) == NULL_TREE) |
13184 | != (TYPE_DOMAIN (arg) == NULL_TREE)) | |
13185 | return 1; | |
8baddbf1 MM |
13186 | if (TYPE_DOMAIN (parm) != NULL_TREE) |
13187 | { | |
13188 | tree parm_max; | |
13189 | tree arg_max; | |
6ee3ffe8 MM |
13190 | bool parm_cst; |
13191 | bool arg_cst; | |
8baddbf1 MM |
13192 | |
13193 | /* Our representation of array types uses "N - 1" as the | |
13194 | TYPE_MAX_VALUE for an array with "N" elements, if "N" is | |
6ee3ffe8 MM |
13195 | not an integer constant. We cannot unify arbitrarily |
13196 | complex expressions, so we eliminate the MINUS_EXPRs | |
13197 | here. */ | |
13198 | parm_max = TYPE_MAX_VALUE (TYPE_DOMAIN (parm)); | |
13199 | parm_cst = TREE_CODE (parm_max) == INTEGER_CST; | |
13200 | if (!parm_cst) | |
8baddbf1 | 13201 | { |
6ee3ffe8 | 13202 | gcc_assert (TREE_CODE (parm_max) == MINUS_EXPR); |
8baddbf1 MM |
13203 | parm_max = TREE_OPERAND (parm_max, 0); |
13204 | } | |
6ee3ffe8 MM |
13205 | arg_max = TYPE_MAX_VALUE (TYPE_DOMAIN (arg)); |
13206 | arg_cst = TREE_CODE (arg_max) == INTEGER_CST; | |
13207 | if (!arg_cst) | |
13208 | { | |
13209 | /* The ARG_MAX may not be a simple MINUS_EXPR, if we are | |
13210 | trying to unify the type of a variable with the type | |
13211 | of a template parameter. For example: | |
13212 | ||
13213 | template <unsigned int N> | |
13214 | void f (char (&) [N]); | |
13215 | int g(); | |
13216 | void h(int i) { | |
13217 | char a[g(i)]; | |
13218 | f(a); | |
13219 | } | |
13220 | ||
13221 | Here, the type of the ARG will be "int [g(i)]", and | |
13222 | may be a SAVE_EXPR, etc. */ | |
13223 | if (TREE_CODE (arg_max) != MINUS_EXPR) | |
13224 | return 1; | |
13225 | arg_max = TREE_OPERAND (arg_max, 0); | |
13226 | } | |
13227 | ||
13228 | /* If only one of the bounds used a MINUS_EXPR, compensate | |
13229 | by adding one to the other bound. */ | |
13230 | if (parm_cst && !arg_cst) | |
13231 | parm_max = fold_build2 (PLUS_EXPR, | |
13232 | integer_type_node, | |
13233 | parm_max, | |
13234 | integer_one_node); | |
13235 | else if (arg_cst && !parm_cst) | |
13236 | arg_max = fold_build2 (PLUS_EXPR, | |
13237 | integer_type_node, | |
13238 | arg_max, | |
13239 | integer_one_node); | |
8baddbf1 MM |
13240 | |
13241 | if (unify (tparms, targs, parm_max, arg_max, UNIFY_ALLOW_INTEGER)) | |
13242 | return 1; | |
13243 | } | |
830bfa74 | 13244 | return unify (tparms, targs, TREE_TYPE (parm), TREE_TYPE (arg), |
712467a4 | 13245 | strict & UNIFY_ALLOW_MORE_CV_QUAL); |
8d08fdba MS |
13246 | |
13247 | case REAL_TYPE: | |
37c46b43 | 13248 | case COMPLEX_TYPE: |
c00996a3 | 13249 | case VECTOR_TYPE: |
8d08fdba | 13250 | case INTEGER_TYPE: |
42976354 | 13251 | case BOOLEAN_TYPE: |
3590f0a6 | 13252 | case ENUMERAL_TYPE: |
5ad5a526 | 13253 | case VOID_TYPE: |
f376e137 MS |
13254 | if (TREE_CODE (arg) != TREE_CODE (parm)) |
13255 | return 1; | |
c8094d83 | 13256 | |
9edc3913 | 13257 | /* We have already checked cv-qualification at the top of the |
514a1f18 | 13258 | function. */ |
8baddbf1 | 13259 | if (!same_type_ignoring_top_level_qualifiers_p (arg, parm)) |
ca79f85d JM |
13260 | return 1; |
13261 | ||
8d08fdba MS |
13262 | /* As far as unification is concerned, this wins. Later checks |
13263 | will invalidate it if necessary. */ | |
13264 | return 0; | |
13265 | ||
13266 | /* Types INTEGER_CST and MINUS_EXPR can come from array bounds. */ | |
bd6dd845 | 13267 | /* Type INTEGER_CST can come from ordinary constant template args. */ |
8d08fdba | 13268 | case INTEGER_CST: |
bd6dd845 MS |
13269 | while (TREE_CODE (arg) == NOP_EXPR) |
13270 | arg = TREE_OPERAND (arg, 0); | |
13271 | ||
8d08fdba MS |
13272 | if (TREE_CODE (arg) != INTEGER_CST) |
13273 | return 1; | |
13274 | return !tree_int_cst_equal (parm, arg); | |
13275 | ||
8d08fdba MS |
13276 | case TREE_VEC: |
13277 | { | |
13278 | int i; | |
13279 | if (TREE_CODE (arg) != TREE_VEC) | |
13280 | return 1; | |
13281 | if (TREE_VEC_LENGTH (parm) != TREE_VEC_LENGTH (arg)) | |
13282 | return 1; | |
0dc09a61 | 13283 | for (i = 0; i < TREE_VEC_LENGTH (parm); ++i) |
830bfa74 | 13284 | if (unify (tparms, targs, |
8d08fdba | 13285 | TREE_VEC_ELT (parm, i), TREE_VEC_ELT (arg, i), |
4393e105 | 13286 | UNIFY_ALLOW_NONE)) |
8d08fdba MS |
13287 | return 1; |
13288 | return 0; | |
13289 | } | |
13290 | ||
8d08fdba | 13291 | case RECORD_TYPE: |
f181d4ae | 13292 | case UNION_TYPE: |
f181d4ae | 13293 | if (TREE_CODE (arg) != TREE_CODE (parm)) |
a4443a08 | 13294 | return 1; |
c8094d83 | 13295 | |
a7a64a77 MM |
13296 | if (TYPE_PTRMEMFUNC_P (parm)) |
13297 | { | |
13298 | if (!TYPE_PTRMEMFUNC_P (arg)) | |
13299 | return 1; | |
13300 | ||
c8094d83 | 13301 | return unify (tparms, targs, |
a7a64a77 MM |
13302 | TYPE_PTRMEMFUNC_FN_TYPE (parm), |
13303 | TYPE_PTRMEMFUNC_FN_TYPE (arg), | |
13304 | strict); | |
13305 | } | |
13306 | ||
5db698f6 | 13307 | if (CLASSTYPE_TEMPLATE_INFO (parm)) |
5566b478 | 13308 | { |
6467930b | 13309 | tree t = NULL_TREE; |
4393e105 | 13310 | |
028d1f20 | 13311 | if (strict_in & UNIFY_ALLOW_DERIVED) |
4393e105 MM |
13312 | { |
13313 | /* First, we try to unify the PARM and ARG directly. */ | |
13314 | t = try_class_unification (tparms, targs, | |
13315 | parm, arg); | |
13316 | ||
13317 | if (!t) | |
13318 | { | |
13319 | /* Fallback to the special case allowed in | |
13320 | [temp.deduct.call]: | |
c8094d83 | 13321 | |
4393e105 MM |
13322 | If P is a class, and P has the form |
13323 | template-id, then A can be a derived class of | |
13324 | the deduced A. Likewise, if P is a pointer to | |
13325 | a class of the form template-id, A can be a | |
13326 | pointer to a derived class pointed to by the | |
13327 | deduced A. */ | |
8d83768f | 13328 | t = get_template_base (tparms, targs, parm, arg); |
4393e105 | 13329 | |
8d83768f | 13330 | if (!t) |
4393e105 MM |
13331 | return 1; |
13332 | } | |
13333 | } | |
c8094d83 MS |
13334 | else if (CLASSTYPE_TEMPLATE_INFO (arg) |
13335 | && (CLASSTYPE_TI_TEMPLATE (parm) | |
9fbf56f7 | 13336 | == CLASSTYPE_TI_TEMPLATE (arg))) |
6df47b06 MM |
13337 | /* Perhaps PARM is something like S<U> and ARG is S<int>. |
13338 | Then, we should unify `int' and `U'. */ | |
6467930b | 13339 | t = arg; |
4393e105 | 13340 | else |
dc957d14 | 13341 | /* There's no chance of unification succeeding. */ |
5566b478 | 13342 | return 1; |
6467930b | 13343 | |
830bfa74 | 13344 | return unify (tparms, targs, CLASSTYPE_TI_ARGS (parm), |
4393e105 | 13345 | CLASSTYPE_TI_ARGS (t), UNIFY_ALLOW_NONE); |
5566b478 | 13346 | } |
9edc3913 | 13347 | else if (!same_type_ignoring_top_level_qualifiers_p (parm, arg)) |
5566b478 | 13348 | return 1; |
a4443a08 | 13349 | return 0; |
8d08fdba MS |
13350 | |
13351 | case METHOD_TYPE: | |
8d08fdba | 13352 | case FUNCTION_TYPE: |
830bfa74 | 13353 | if (TREE_CODE (arg) != TREE_CODE (parm)) |
8d08fdba | 13354 | return 1; |
830bfa74 | 13355 | |
38d18b1a | 13356 | /* CV qualifications for methods can never be deduced, they must |
3db45ab5 MS |
13357 | match exactly. We need to check them explicitly here, |
13358 | because type_unification_real treats them as any other | |
13359 | cvqualified parameter. */ | |
38d18b1a NS |
13360 | if (TREE_CODE (parm) == METHOD_TYPE |
13361 | && (!check_cv_quals_for_unify | |
13362 | (UNIFY_ALLOW_NONE, | |
13363 | TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (arg))), | |
13364 | TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (parm)))))) | |
13365 | return 1; | |
13366 | ||
830bfa74 | 13367 | if (unify (tparms, targs, TREE_TYPE (parm), |
4393e105 | 13368 | TREE_TYPE (arg), UNIFY_ALLOW_NONE)) |
28cbf42c | 13369 | return 1; |
386b8a85 | 13370 | return type_unification_real (tparms, targs, TYPE_ARG_TYPES (parm), |
30f86ec3 FJ |
13371 | TYPE_ARG_TYPES (arg), 1, DEDUCE_EXACT, |
13372 | LOOKUP_NORMAL); | |
a4443a08 MS |
13373 | |
13374 | case OFFSET_TYPE: | |
9804209d | 13375 | /* Unify a pointer to member with a pointer to member function, which |
0cbd7506 | 13376 | deduces the type of the member as a function type. */ |
9804209d | 13377 | if (TYPE_PTRMEMFUNC_P (arg)) |
0cbd7506 MS |
13378 | { |
13379 | tree method_type; | |
13380 | tree fntype; | |
13381 | cp_cv_quals cv_quals; | |
13382 | ||
13383 | /* Check top-level cv qualifiers */ | |
13384 | if (!check_cv_quals_for_unify (UNIFY_ALLOW_NONE, arg, parm)) | |
13385 | return 1; | |
13386 | ||
13387 | if (unify (tparms, targs, TYPE_OFFSET_BASETYPE (parm), | |
13388 | TYPE_PTRMEMFUNC_OBJECT_TYPE (arg), UNIFY_ALLOW_NONE)) | |
13389 | return 1; | |
13390 | ||
13391 | /* Determine the type of the function we are unifying against. */ | |
13392 | method_type = TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (arg)); | |
13393 | fntype = | |
13394 | build_function_type (TREE_TYPE (method_type), | |
13395 | TREE_CHAIN (TYPE_ARG_TYPES (method_type))); | |
13396 | ||
13397 | /* Extract the cv-qualifiers of the member function from the | |
13398 | implicit object parameter and place them on the function | |
13399 | type to be restored later. */ | |
13400 | cv_quals = | |
13401 | cp_type_quals(TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (method_type)))); | |
13402 | fntype = build_qualified_type (fntype, cv_quals); | |
13403 | return unify (tparms, targs, TREE_TYPE (parm), fntype, strict); | |
13404 | } | |
9804209d | 13405 | |
a4443a08 MS |
13406 | if (TREE_CODE (arg) != OFFSET_TYPE) |
13407 | return 1; | |
830bfa74 | 13408 | if (unify (tparms, targs, TYPE_OFFSET_BASETYPE (parm), |
4393e105 | 13409 | TYPE_OFFSET_BASETYPE (arg), UNIFY_ALLOW_NONE)) |
a4443a08 | 13410 | return 1; |
830bfa74 | 13411 | return unify (tparms, targs, TREE_TYPE (parm), TREE_TYPE (arg), |
4393e105 | 13412 | strict); |
a4443a08 | 13413 | |
f62dbf03 | 13414 | case CONST_DECL: |
a723baf1 MM |
13415 | if (DECL_TEMPLATE_PARM_P (parm)) |
13416 | return unify (tparms, targs, DECL_INITIAL (parm), arg, strict); | |
c8094d83 | 13417 | if (arg != integral_constant_value (parm)) |
f62dbf03 JM |
13418 | return 1; |
13419 | return 0; | |
13420 | ||
28e8f3a0 | 13421 | case FIELD_DECL: |
027905b4 KL |
13422 | case TEMPLATE_DECL: |
13423 | /* Matched cases are handled by the ARG == PARM test above. */ | |
13424 | return 1; | |
13425 | ||
5d80a306 DG |
13426 | case TYPE_ARGUMENT_PACK: |
13427 | case NONTYPE_ARGUMENT_PACK: | |
13428 | { | |
13429 | tree packed_parms = ARGUMENT_PACK_ARGS (parm); | |
13430 | tree packed_args = ARGUMENT_PACK_ARGS (arg); | |
13431 | int i, len = TREE_VEC_LENGTH (packed_parms); | |
13432 | int argslen = TREE_VEC_LENGTH (packed_args); | |
13433 | int parm_variadic_p = 0; | |
13434 | ||
db60ff18 DG |
13435 | for (i = 0; i < len; ++i) |
13436 | { | |
13437 | if (PACK_EXPANSION_P (TREE_VEC_ELT (packed_parms, i))) | |
13438 | { | |
13439 | if (i == len - 1) | |
13440 | /* We can unify against something with a trailing | |
13441 | parameter pack. */ | |
13442 | parm_variadic_p = 1; | |
13443 | else | |
13444 | /* Since there is something following the pack | |
13445 | expansion, we cannot unify this template argument | |
13446 | list. */ | |
13447 | return 0; | |
13448 | } | |
13449 | } | |
13450 | ||
5d80a306 DG |
13451 | |
13452 | /* If we don't have enough arguments to satisfy the parameters | |
13453 | (not counting the pack expression at the end), or we have | |
13454 | too many arguments for a parameter list that doesn't end in | |
13455 | a pack expression, we can't unify. */ | |
13456 | if (argslen < (len - parm_variadic_p) | |
13457 | || (argslen > len && !parm_variadic_p)) | |
13458 | return 1; | |
13459 | ||
13460 | /* Unify all of the parameters that precede the (optional) | |
13461 | pack expression. */ | |
13462 | for (i = 0; i < len - parm_variadic_p; ++i) | |
13463 | { | |
13464 | if (unify (tparms, targs, TREE_VEC_ELT (packed_parms, i), | |
13465 | TREE_VEC_ELT (packed_args, i), strict)) | |
13466 | return 1; | |
13467 | } | |
13468 | ||
13469 | if (parm_variadic_p) | |
13470 | return unify_pack_expansion (tparms, targs, | |
13471 | packed_parms, packed_args, | |
13472 | strict, /*call_args_p=*/false, | |
13473 | /*subr=*/false); | |
13474 | return 0; | |
13475 | } | |
13476 | ||
13477 | break; | |
13478 | ||
3ad6a8e1 DG |
13479 | case TYPEOF_TYPE: |
13480 | case DECLTYPE_TYPE: | |
13481 | /* Cannot deduce anything from TYPEOF_TYPE or DECLTYPE_TYPE | |
13482 | nodes. */ | |
13483 | return 0; | |
13484 | ||
1ad8aeeb DG |
13485 | case ERROR_MARK: |
13486 | /* Unification fails if we hit an error node. */ | |
13487 | return 1; | |
13488 | ||
8d08fdba | 13489 | default: |
6615c446 | 13490 | gcc_assert (EXPR_P (parm)); |
c8094d83 | 13491 | |
98ddffc1 | 13492 | /* We must be looking at an expression. This can happen with |
c8094d83 MS |
13493 | something like: |
13494 | ||
98ddffc1 NS |
13495 | template <int I> |
13496 | void foo(S<I>, S<I + 2>); | |
050367a3 | 13497 | |
98ddffc1 | 13498 | This is a "nondeduced context": |
050367a3 | 13499 | |
98ddffc1 | 13500 | [deduct.type] |
c8094d83 | 13501 | |
98ddffc1 | 13502 | The nondeduced contexts are: |
050367a3 | 13503 | |
98ddffc1 NS |
13504 | --A type that is a template-id in which one or more of |
13505 | the template-arguments is an expression that references | |
c8094d83 | 13506 | a template-parameter. |
050367a3 | 13507 | |
98ddffc1 NS |
13508 | In these cases, we assume deduction succeeded, but don't |
13509 | actually infer any unifications. */ | |
74601d7c | 13510 | |
98ddffc1 NS |
13511 | if (!uses_template_parms (parm) |
13512 | && !template_args_equal (parm, arg)) | |
13513 | return 1; | |
13514 | else | |
13515 | return 0; | |
8d08fdba MS |
13516 | } |
13517 | } | |
8d08fdba | 13518 | \f |
4684cd27 MM |
13519 | /* Note that DECL can be defined in this translation unit, if |
13520 | required. */ | |
13521 | ||
13522 | static void | |
13523 | mark_definable (tree decl) | |
13524 | { | |
13525 | tree clone; | |
13526 | DECL_NOT_REALLY_EXTERN (decl) = 1; | |
13527 | FOR_EACH_CLONE (clone, decl) | |
13528 | DECL_NOT_REALLY_EXTERN (clone) = 1; | |
13529 | } | |
13530 | ||
03d0f4af | 13531 | /* Called if RESULT is explicitly instantiated, or is a member of an |
4684cd27 | 13532 | explicitly instantiated class. */ |
03d0f4af | 13533 | |
faae18ab | 13534 | void |
3a978d72 | 13535 | mark_decl_instantiated (tree result, int extern_p) |
faae18ab | 13536 | { |
415c974c | 13537 | SET_DECL_EXPLICIT_INSTANTIATION (result); |
3ae18eaf | 13538 | |
1f6f0cb6 MM |
13539 | /* If this entity has already been written out, it's too late to |
13540 | make any modifications. */ | |
13541 | if (TREE_ASM_WRITTEN (result)) | |
13542 | return; | |
13543 | ||
13544 | if (TREE_CODE (result) != FUNCTION_DECL) | |
13545 | /* The TREE_PUBLIC flag for function declarations will have been | |
13546 | set correctly by tsubst. */ | |
13547 | TREE_PUBLIC (result) = 1; | |
13548 | ||
346eeb15 JM |
13549 | /* This might have been set by an earlier implicit instantiation. */ |
13550 | DECL_COMDAT (result) = 0; | |
13551 | ||
4684cd27 MM |
13552 | if (extern_p) |
13553 | DECL_NOT_REALLY_EXTERN (result) = 0; | |
13554 | else | |
faae18ab | 13555 | { |
4684cd27 | 13556 | mark_definable (result); |
1a408d07 JM |
13557 | /* Always make artificials weak. */ |
13558 | if (DECL_ARTIFICIAL (result) && flag_weak) | |
13559 | comdat_linkage (result); | |
a7d87521 JM |
13560 | /* For WIN32 we also want to put explicit instantiations in |
13561 | linkonce sections. */ | |
1a408d07 | 13562 | else if (TREE_PUBLIC (result)) |
b385c841 | 13563 | maybe_make_one_only (result); |
faae18ab | 13564 | } |
c8094d83 | 13565 | |
4684cd27 MM |
13566 | /* If EXTERN_P, then this function will not be emitted -- unless |
13567 | followed by an explicit instantiation, at which point its linkage | |
13568 | will be adjusted. If !EXTERN_P, then this function will be | |
13569 | emitted here. In neither circumstance do we want | |
13570 | import_export_decl to adjust the linkage. */ | |
c8094d83 | 13571 | DECL_INTERFACE_KNOWN (result) = 1; |
faae18ab MS |
13572 | } |
13573 | ||
e5214479 | 13574 | /* Given two function templates PAT1 and PAT2, return: |
6467930b MS |
13575 | |
13576 | 1 if PAT1 is more specialized than PAT2 as described in [temp.func.order]. | |
13577 | -1 if PAT2 is more specialized than PAT1. | |
e5214479 JM |
13578 | 0 if neither is more specialized. |
13579 | ||
dda04398 NS |
13580 | LEN indicates the number of parameters we should consider |
13581 | (defaulted parameters should not be considered). | |
13582 | ||
13583 | The 1998 std underspecified function template partial ordering, and | |
13584 | DR214 addresses the issue. We take pairs of arguments, one from | |
c51940a2 | 13585 | each of the templates, and deduce them against each other. One of |
dda04398 NS |
13586 | the templates will be more specialized if all the *other* |
13587 | template's arguments deduce against its arguments and at least one | |
13588 | of its arguments *does* *not* deduce against the other template's | |
13589 | corresponding argument. Deduction is done as for class templates. | |
13590 | The arguments used in deduction have reference and top level cv | |
13591 | qualifiers removed. Iff both arguments were originally reference | |
13592 | types *and* deduction succeeds in both directions, the template | |
13593 | with the more cv-qualified argument wins for that pairing (if | |
13594 | neither is more cv-qualified, they both are equal). Unlike regular | |
13595 | deduction, after all the arguments have been deduced in this way, | |
13596 | we do *not* verify the deduced template argument values can be | |
13597 | substituted into non-deduced contexts, nor do we have to verify | |
13598 | that all template arguments have been deduced. */ | |
c8094d83 | 13599 | |
6467930b | 13600 | int |
dda04398 NS |
13601 | more_specialized_fn (tree pat1, tree pat2, int len) |
13602 | { | |
13603 | tree decl1 = DECL_TEMPLATE_RESULT (pat1); | |
13604 | tree decl2 = DECL_TEMPLATE_RESULT (pat2); | |
13605 | tree targs1 = make_tree_vec (DECL_NTPARMS (pat1)); | |
13606 | tree targs2 = make_tree_vec (DECL_NTPARMS (pat2)); | |
13607 | tree tparms1 = DECL_INNERMOST_TEMPLATE_PARMS (pat1); | |
13608 | tree tparms2 = DECL_INNERMOST_TEMPLATE_PARMS (pat2); | |
13609 | tree args1 = TYPE_ARG_TYPES (TREE_TYPE (decl1)); | |
13610 | tree args2 = TYPE_ARG_TYPES (TREE_TYPE (decl2)); | |
13611 | int better1 = 0; | |
13612 | int better2 = 0; | |
3db45ab5 | 13613 | |
48884537 NS |
13614 | /* Remove the this parameter from non-static member functions. If |
13615 | one is a non-static member function and the other is not a static | |
13616 | member function, remove the first parameter from that function | |
13617 | also. This situation occurs for operator functions where we | |
13618 | locate both a member function (with this pointer) and non-member | |
13619 | operator (with explicit first operand). */ | |
dda04398 | 13620 | if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl1)) |
48884537 NS |
13621 | { |
13622 | len--; /* LEN is the number of significant arguments for DECL1 */ | |
13623 | args1 = TREE_CHAIN (args1); | |
13624 | if (!DECL_STATIC_FUNCTION_P (decl2)) | |
13625 | args2 = TREE_CHAIN (args2); | |
13626 | } | |
13627 | else if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl2)) | |
13628 | { | |
13629 | args2 = TREE_CHAIN (args2); | |
13630 | if (!DECL_STATIC_FUNCTION_P (decl1)) | |
13631 | { | |
13632 | len--; | |
13633 | args1 = TREE_CHAIN (args1); | |
13634 | } | |
13635 | } | |
3db45ab5 | 13636 | |
ee307009 NS |
13637 | /* If only one is a conversion operator, they are unordered. */ |
13638 | if (DECL_CONV_FN_P (decl1) != DECL_CONV_FN_P (decl2)) | |
13639 | return 0; | |
c8094d83 | 13640 | |
dda04398 NS |
13641 | /* Consider the return type for a conversion function */ |
13642 | if (DECL_CONV_FN_P (decl1)) | |
13643 | { | |
dda04398 NS |
13644 | args1 = tree_cons (NULL_TREE, TREE_TYPE (TREE_TYPE (decl1)), args1); |
13645 | args2 = tree_cons (NULL_TREE, TREE_TYPE (TREE_TYPE (decl2)), args2); | |
13646 | len++; | |
13647 | } | |
c8094d83 | 13648 | |
dda04398 | 13649 | processing_template_decl++; |
c8094d83 | 13650 | |
dda04398 NS |
13651 | while (len--) |
13652 | { | |
13653 | tree arg1 = TREE_VALUE (args1); | |
13654 | tree arg2 = TREE_VALUE (args2); | |
13655 | int deduce1, deduce2; | |
13656 | int quals1 = -1; | |
13657 | int quals2 = -1; | |
6467930b | 13658 | |
5d80a306 DG |
13659 | if (TREE_CODE (arg1) == TYPE_PACK_EXPANSION |
13660 | && TREE_CODE (arg2) == TYPE_PACK_EXPANSION) | |
13661 | { | |
13662 | /* When both arguments are pack expansions, we need only | |
13663 | unify the patterns themselves. */ | |
13664 | arg1 = PACK_EXPANSION_PATTERN (arg1); | |
13665 | arg2 = PACK_EXPANSION_PATTERN (arg2); | |
13666 | ||
13667 | /* This is the last comparison we need to do. */ | |
13668 | len = 0; | |
13669 | } | |
13670 | ||
dda04398 NS |
13671 | if (TREE_CODE (arg1) == REFERENCE_TYPE) |
13672 | { | |
13673 | arg1 = TREE_TYPE (arg1); | |
13674 | quals1 = cp_type_quals (arg1); | |
13675 | } | |
c8094d83 | 13676 | |
dda04398 NS |
13677 | if (TREE_CODE (arg2) == REFERENCE_TYPE) |
13678 | { | |
13679 | arg2 = TREE_TYPE (arg2); | |
13680 | quals2 = cp_type_quals (arg2); | |
13681 | } | |
6467930b | 13682 | |
dda04398 NS |
13683 | if ((quals1 < 0) != (quals2 < 0)) |
13684 | { | |
13685 | /* Only of the args is a reference, see if we should apply | |
13686 | array/function pointer decay to it. This is not part of | |
13687 | DR214, but is, IMHO, consistent with the deduction rules | |
13688 | for the function call itself, and with our earlier | |
13689 | implementation of the underspecified partial ordering | |
13690 | rules. (nathan). */ | |
13691 | if (quals1 >= 0) | |
13692 | { | |
13693 | switch (TREE_CODE (arg1)) | |
13694 | { | |
13695 | case ARRAY_TYPE: | |
13696 | arg1 = TREE_TYPE (arg1); | |
13697 | /* FALLTHROUGH. */ | |
13698 | case FUNCTION_TYPE: | |
13699 | arg1 = build_pointer_type (arg1); | |
13700 | break; | |
c8094d83 | 13701 | |
dda04398 NS |
13702 | default: |
13703 | break; | |
13704 | } | |
13705 | } | |
13706 | else | |
13707 | { | |
13708 | switch (TREE_CODE (arg2)) | |
13709 | { | |
13710 | case ARRAY_TYPE: | |
13711 | arg2 = TREE_TYPE (arg2); | |
13712 | /* FALLTHROUGH. */ | |
13713 | case FUNCTION_TYPE: | |
13714 | arg2 = build_pointer_type (arg2); | |
13715 | break; | |
c8094d83 | 13716 | |
dda04398 NS |
13717 | default: |
13718 | break; | |
13719 | } | |
13720 | } | |
13721 | } | |
c8094d83 | 13722 | |
dda04398 NS |
13723 | arg1 = TYPE_MAIN_VARIANT (arg1); |
13724 | arg2 = TYPE_MAIN_VARIANT (arg2); | |
c8094d83 | 13725 | |
5d80a306 DG |
13726 | if (TREE_CODE (arg1) == TYPE_PACK_EXPANSION) |
13727 | { | |
b1d7b1c0 | 13728 | int i, len2 = list_length (args2); |
5d80a306 DG |
13729 | tree parmvec = make_tree_vec (1); |
13730 | tree argvec = make_tree_vec (len2); | |
13731 | tree ta = args2; | |
13732 | ||
13733 | /* Setup the parameter vector, which contains only ARG1. */ | |
13734 | TREE_VEC_ELT (parmvec, 0) = arg1; | |
13735 | ||
13736 | /* Setup the argument vector, which contains the remaining | |
13737 | arguments. */ | |
13738 | for (i = 0; i < len2; i++, ta = TREE_CHAIN (ta)) | |
13739 | TREE_VEC_ELT (argvec, i) = TREE_VALUE (ta); | |
13740 | ||
13741 | deduce1 = !unify_pack_expansion (tparms1, targs1, parmvec, | |
13742 | argvec, UNIFY_ALLOW_NONE, | |
13743 | /*call_args_p=*/false, | |
13744 | /*subr=*/0); | |
13745 | ||
13746 | /* We cannot deduce in the other direction, because ARG1 is | |
13747 | a pack expansion but ARG2 is not. */ | |
13748 | deduce2 = 0; | |
13749 | } | |
13750 | else if (TREE_CODE (arg2) == TYPE_PACK_EXPANSION) | |
13751 | { | |
b1d7b1c0 | 13752 | int i, len1 = list_length (args1); |
5d80a306 DG |
13753 | tree parmvec = make_tree_vec (1); |
13754 | tree argvec = make_tree_vec (len1); | |
13755 | tree ta = args1; | |
13756 | ||
13757 | /* Setup the parameter vector, which contains only ARG1. */ | |
13758 | TREE_VEC_ELT (parmvec, 0) = arg2; | |
13759 | ||
13760 | /* Setup the argument vector, which contains the remaining | |
13761 | arguments. */ | |
13762 | for (i = 0; i < len1; i++, ta = TREE_CHAIN (ta)) | |
13763 | TREE_VEC_ELT (argvec, i) = TREE_VALUE (ta); | |
13764 | ||
13765 | deduce2 = !unify_pack_expansion (tparms2, targs2, parmvec, | |
13766 | argvec, UNIFY_ALLOW_NONE, | |
13767 | /*call_args_p=*/false, | |
13768 | /*subr=*/0); | |
13769 | ||
13770 | /* We cannot deduce in the other direction, because ARG2 is | |
13771 | a pack expansion but ARG1 is not.*/ | |
13772 | deduce1 = 0; | |
13773 | } | |
13774 | ||
13775 | else | |
13776 | { | |
13777 | /* The normal case, where neither argument is a pack | |
13778 | expansion. */ | |
13779 | deduce1 = !unify (tparms1, targs1, arg1, arg2, UNIFY_ALLOW_NONE); | |
13780 | deduce2 = !unify (tparms2, targs2, arg2, arg1, UNIFY_ALLOW_NONE); | |
13781 | } | |
dda04398 NS |
13782 | |
13783 | if (!deduce1) | |
13784 | better2 = -1; | |
13785 | if (!deduce2) | |
13786 | better1 = -1; | |
13787 | if (better1 < 0 && better2 < 0) | |
13788 | /* We've failed to deduce something in either direction. | |
13789 | These must be unordered. */ | |
13790 | break; | |
c8094d83 | 13791 | |
dda04398 NS |
13792 | if (deduce1 && deduce2 && quals1 >= 0 && quals2 >= 0) |
13793 | { | |
13794 | /* Deduces in both directions, see if quals can | |
13795 | disambiguate. Pretend the worse one failed to deduce. */ | |
13796 | if ((quals1 & quals2) == quals2) | |
13797 | deduce1 = 0; | |
13798 | if ((quals1 & quals2) == quals1) | |
13799 | deduce2 = 0; | |
13800 | } | |
13801 | if (deduce1 && !deduce2 && !better2) | |
13802 | better2 = 1; | |
13803 | if (deduce2 && !deduce1 && !better1) | |
13804 | better1 = 1; | |
c8094d83 | 13805 | |
5d80a306 DG |
13806 | if (TREE_CODE (arg1) == TYPE_PACK_EXPANSION |
13807 | || TREE_CODE (arg2) == TYPE_PACK_EXPANSION) | |
13808 | /* We have already processed all of the arguments in our | |
13809 | handing of the pack expansion type. */ | |
13810 | len = 0; | |
13811 | ||
dda04398 NS |
13812 | args1 = TREE_CHAIN (args1); |
13813 | args2 = TREE_CHAIN (args2); | |
63d34078 JJ |
13814 | |
13815 | /* Stop when an ellipsis is seen. */ | |
13816 | if (args1 == NULL_TREE || args2 == NULL_TREE) | |
13817 | break; | |
dda04398 NS |
13818 | } |
13819 | ||
13820 | processing_template_decl--; | |
13821 | ||
5d80a306 DG |
13822 | /* All things being equal, if the next argument is a pack expansion |
13823 | for one function but not for the other, prefer the | |
13824 | non-variadic function. */ | |
13825 | if ((better1 > 0) - (better2 > 0) == 0 | |
13826 | && args1 && TREE_VALUE (args1) | |
13827 | && args2 && TREE_VALUE (args2)) | |
13828 | { | |
13829 | if (TREE_CODE (TREE_VALUE (args1)) == TYPE_PACK_EXPANSION) | |
13830 | return TREE_CODE (TREE_VALUE (args2)) == TYPE_PACK_EXPANSION ? 0 : -1; | |
13831 | else if (TREE_CODE (TREE_VALUE (args2)) == TYPE_PACK_EXPANSION) | |
13832 | return 1; | |
13833 | } | |
13834 | ||
dda04398 | 13835 | return (better1 > 0) - (better2 > 0); |
73aad9b9 | 13836 | } |
6467930b | 13837 | |
916b63c3 | 13838 | /* Determine which of two partial specializations is more specialized. |
6467930b | 13839 | |
916b63c3 MM |
13840 | PAT1 is a TREE_LIST whose TREE_TYPE is the _TYPE node corresponding |
13841 | to the first partial specialization. The TREE_VALUE is the | |
13842 | innermost set of template parameters for the partial | |
13843 | specialization. PAT2 is similar, but for the second template. | |
13844 | ||
13845 | Return 1 if the first partial specialization is more specialized; | |
13846 | -1 if the second is more specialized; 0 if neither is more | |
13847 | specialized. | |
55ece1b3 | 13848 | |
916b63c3 | 13849 | See [temp.class.order] for information about determining which of |
3db45ab5 | 13850 | two templates is more specialized. */ |
c8094d83 | 13851 | |
b5791fdc | 13852 | static int |
916b63c3 | 13853 | more_specialized_class (tree pat1, tree pat2) |
73aad9b9 JM |
13854 | { |
13855 | tree targs; | |
916b63c3 | 13856 | tree tmpl1, tmpl2; |
73aad9b9 | 13857 | int winner = 0; |
5d80a306 | 13858 | bool any_deductions = false; |
73aad9b9 | 13859 | |
916b63c3 MM |
13860 | tmpl1 = TREE_TYPE (pat1); |
13861 | tmpl2 = TREE_TYPE (pat2); | |
13862 | ||
c8094d83 | 13863 | /* Just like what happens for functions, if we are ordering between |
baa49730 GB |
13864 | different class template specializations, we may encounter dependent |
13865 | types in the arguments, and we need our dependency check functions | |
13866 | to behave correctly. */ | |
13867 | ++processing_template_decl; | |
3db45ab5 | 13868 | targs = get_class_bindings (TREE_VALUE (pat1), |
916b63c3 MM |
13869 | CLASSTYPE_TI_ARGS (tmpl1), |
13870 | CLASSTYPE_TI_ARGS (tmpl2)); | |
73aad9b9 | 13871 | if (targs) |
5d80a306 DG |
13872 | { |
13873 | --winner; | |
13874 | any_deductions = true; | |
13875 | } | |
73aad9b9 | 13876 | |
3db45ab5 | 13877 | targs = get_class_bindings (TREE_VALUE (pat2), |
916b63c3 MM |
13878 | CLASSTYPE_TI_ARGS (tmpl2), |
13879 | CLASSTYPE_TI_ARGS (tmpl1)); | |
73aad9b9 | 13880 | if (targs) |
5d80a306 DG |
13881 | { |
13882 | ++winner; | |
13883 | any_deductions = true; | |
13884 | } | |
baa49730 | 13885 | --processing_template_decl; |
6467930b | 13886 | |
5d80a306 DG |
13887 | /* In the case of a tie where at least one of the class templates |
13888 | has a parameter pack at the end, the template with the most | |
13889 | non-packed parameters wins. */ | |
13890 | if (winner == 0 | |
13891 | && any_deductions | |
13892 | && (template_args_variadic_p (TREE_PURPOSE (pat1)) | |
13893 | || template_args_variadic_p (TREE_PURPOSE (pat2)))) | |
13894 | { | |
13895 | tree args1 = INNERMOST_TEMPLATE_ARGS (TREE_PURPOSE (pat1)); | |
13896 | tree args2 = INNERMOST_TEMPLATE_ARGS (TREE_PURPOSE (pat2)); | |
13897 | int len1 = TREE_VEC_LENGTH (args1); | |
13898 | int len2 = TREE_VEC_LENGTH (args2); | |
13899 | ||
13900 | /* We don't count the pack expansion at the end. */ | |
13901 | if (template_args_variadic_p (TREE_PURPOSE (pat1))) | |
13902 | --len1; | |
13903 | if (template_args_variadic_p (TREE_PURPOSE (pat2))) | |
13904 | --len2; | |
13905 | ||
13906 | if (len1 > len2) | |
13907 | return 1; | |
13908 | else if (len1 < len2) | |
13909 | return -1; | |
13910 | } | |
13911 | ||
6467930b MS |
13912 | return winner; |
13913 | } | |
73aad9b9 JM |
13914 | |
13915 | /* Return the template arguments that will produce the function signature | |
e1467ff2 | 13916 | DECL from the function template FN, with the explicit template |
a34d3336 | 13917 | arguments EXPLICIT_ARGS. If CHECK_RETTYPE is true, the return type must |
4393e105 | 13918 | also match. Return NULL_TREE if no satisfactory arguments could be |
a34d3336 | 13919 | found. */ |
c8094d83 | 13920 | |
76b9a14d | 13921 | static tree |
a34d3336 | 13922 | get_bindings (tree fn, tree decl, tree explicit_args, bool check_rettype) |
73aad9b9 | 13923 | { |
98c1c668 | 13924 | int ntparms = DECL_NTPARMS (fn); |
f31c0a32 | 13925 | tree targs = make_tree_vec (ntparms); |
4393e105 | 13926 | tree decl_type; |
03017874 | 13927 | tree decl_arg_types; |
98c1c668 | 13928 | |
4393e105 MM |
13929 | /* Substitute the explicit template arguments into the type of DECL. |
13930 | The call to fn_type_unification will handle substitution into the | |
13931 | FN. */ | |
13932 | decl_type = TREE_TYPE (decl); | |
13933 | if (explicit_args && uses_template_parms (decl_type)) | |
13934 | { | |
13935 | tree tmpl; | |
13936 | tree converted_args; | |
13937 | ||
13938 | if (DECL_TEMPLATE_INFO (decl)) | |
13939 | tmpl = DECL_TI_TEMPLATE (decl); | |
13940 | else | |
0e339752 | 13941 | /* We can get here for some invalid specializations. */ |
4393e105 MM |
13942 | return NULL_TREE; |
13943 | ||
13944 | converted_args | |
e7e93965 MM |
13945 | = coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl), |
13946 | explicit_args, NULL_TREE, | |
3db45ab5 | 13947 | tf_none, |
e7e93965 MM |
13948 | /*require_all_args=*/false, |
13949 | /*use_default_args=*/false); | |
4393e105 MM |
13950 | if (converted_args == error_mark_node) |
13951 | return NULL_TREE; | |
c8094d83 MS |
13952 | |
13953 | decl_type = tsubst (decl_type, converted_args, tf_none, NULL_TREE); | |
4393e105 MM |
13954 | if (decl_type == error_mark_node) |
13955 | return NULL_TREE; | |
13956 | } | |
13957 | ||
e5214479 | 13958 | /* Never do unification on the 'this' parameter. */ |
ba139ba8 MM |
13959 | decl_arg_types = skip_artificial_parms_for (decl, |
13960 | TYPE_ARG_TYPES (decl_type)); | |
d7684f2d | 13961 | |
c8094d83 | 13962 | if (fn_type_unification (fn, explicit_args, targs, |
03017874 | 13963 | decl_arg_types, |
8d3631f8 | 13964 | (check_rettype || DECL_CONV_FN_P (fn) |
0cbd7506 | 13965 | ? TREE_TYPE (decl_type) : NULL_TREE), |
30f86ec3 | 13966 | DEDUCE_EXACT, LOOKUP_NORMAL)) |
76b9a14d JM |
13967 | return NULL_TREE; |
13968 | ||
76b9a14d JM |
13969 | return targs; |
13970 | } | |
13971 | ||
36a117a5 MM |
13972 | /* Return the innermost template arguments that, when applied to a |
13973 | template specialization whose innermost template parameters are | |
9471d3e2 | 13974 | TPARMS, and whose specialization arguments are PARMS, yield the |
c8094d83 | 13975 | ARGS. |
36a117a5 MM |
13976 | |
13977 | For example, suppose we have: | |
13978 | ||
13979 | template <class T, class U> struct S {}; | |
13980 | template <class T> struct S<T*, int> {}; | |
13981 | ||
13982 | Then, suppose we want to get `S<double*, int>'. The TPARMS will be | |
916b63c3 | 13983 | {T}, the SPEC_ARGS will be {T*, int} and the ARGS will be {double*, |
36a117a5 MM |
13984 | int}. The resulting vector will be {double}, indicating that `T' |
13985 | is bound to `double'. */ | |
13986 | ||
bd6dd845 | 13987 | static tree |
916b63c3 | 13988 | get_class_bindings (tree tparms, tree spec_args, tree args) |
73aad9b9 | 13989 | { |
3b3ba9f0 | 13990 | int i, ntparms = TREE_VEC_LENGTH (tparms); |
916b63c3 MM |
13991 | tree deduced_args; |
13992 | tree innermost_deduced_args; | |
73aad9b9 | 13993 | |
916b63c3 MM |
13994 | innermost_deduced_args = make_tree_vec (ntparms); |
13995 | if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args)) | |
13996 | { | |
13997 | deduced_args = copy_node (args); | |
13998 | SET_TMPL_ARGS_LEVEL (deduced_args, | |
13999 | TMPL_ARGS_DEPTH (deduced_args), | |
14000 | innermost_deduced_args); | |
14001 | } | |
14002 | else | |
3db45ab5 | 14003 | deduced_args = innermost_deduced_args; |
916b63c3 | 14004 | |
3db45ab5 MS |
14005 | if (unify (tparms, deduced_args, |
14006 | INNERMOST_TEMPLATE_ARGS (spec_args), | |
14007 | INNERMOST_TEMPLATE_ARGS (args), | |
0cbd7506 | 14008 | UNIFY_ALLOW_NONE)) |
fcfb9f96 | 14009 | return NULL_TREE; |
73aad9b9 JM |
14010 | |
14011 | for (i = 0; i < ntparms; ++i) | |
916b63c3 | 14012 | if (! TREE_VEC_ELT (innermost_deduced_args, i)) |
73aad9b9 JM |
14013 | return NULL_TREE; |
14014 | ||
916b63c3 MM |
14015 | /* Verify that nondeduced template arguments agree with the type |
14016 | obtained from argument deduction. | |
3db45ab5 | 14017 | |
916b63c3 MM |
14018 | For example: |
14019 | ||
14020 | struct A { typedef int X; }; | |
14021 | template <class T, class U> struct C {}; | |
14022 | template <class T> struct C<T, typename T::X> {}; | |
14023 | ||
14024 | Then with the instantiation `C<A, int>', we can deduce that | |
14025 | `T' is `A' but unify () does not check whether `typename T::X' | |
14026 | is `int'. */ | |
14027 | spec_args = tsubst (spec_args, deduced_args, tf_none, NULL_TREE); | |
14028 | if (spec_args == error_mark_node | |
14029 | /* We only need to check the innermost arguments; the other | |
14030 | arguments will always agree. */ | |
14031 | || !comp_template_args (INNERMOST_TEMPLATE_ARGS (spec_args), | |
14032 | INNERMOST_TEMPLATE_ARGS (args))) | |
74601d7c KL |
14033 | return NULL_TREE; |
14034 | ||
4cf36211 DG |
14035 | /* Now that we have bindings for all of the template arguments, |
14036 | ensure that the arguments deduced for the template template | |
14037 | parameters have compatible template parameter lists. See the use | |
14038 | of template_template_parm_bindings_ok_p in fn_type_unification | |
14039 | for more information. */ | |
14040 | if (!template_template_parm_bindings_ok_p (tparms, deduced_args)) | |
14041 | return NULL_TREE; | |
14042 | ||
916b63c3 | 14043 | return deduced_args; |
73aad9b9 JM |
14044 | } |
14045 | ||
7ca383e6 MM |
14046 | /* TEMPLATES is a TREE_LIST. Each TREE_VALUE is a TEMPLATE_DECL. |
14047 | Return the TREE_LIST node with the most specialized template, if | |
14048 | any. If there is no most specialized template, the error_mark_node | |
14049 | is returned. | |
14050 | ||
14051 | Note that this function does not look at, or modify, the | |
14052 | TREE_PURPOSE or TREE_TYPE of any of the nodes. Since the node | |
14053 | returned is one of the elements of INSTANTIATIONS, callers may | |
14054 | store information in the TREE_PURPOSE or TREE_TYPE of the nodes, | |
14055 | and retrieve it from the value returned. */ | |
73aad9b9 JM |
14056 | |
14057 | tree | |
7ca383e6 | 14058 | most_specialized_instantiation (tree templates) |
73aad9b9 | 14059 | { |
104bf76a | 14060 | tree fn, champ; |
73aad9b9 | 14061 | |
dda04398 | 14062 | ++processing_template_decl; |
c8094d83 | 14063 | |
7ca383e6 MM |
14064 | champ = templates; |
14065 | for (fn = TREE_CHAIN (templates); fn; fn = TREE_CHAIN (fn)) | |
73aad9b9 | 14066 | { |
dda04398 | 14067 | int fate = 0; |
c8094d83 | 14068 | |
a34d3336 NS |
14069 | if (get_bindings (TREE_VALUE (champ), |
14070 | DECL_TEMPLATE_RESULT (TREE_VALUE (fn)), | |
14071 | NULL_TREE, /*check_ret=*/false)) | |
dda04398 NS |
14072 | fate--; |
14073 | ||
a34d3336 NS |
14074 | if (get_bindings (TREE_VALUE (fn), |
14075 | DECL_TEMPLATE_RESULT (TREE_VALUE (champ)), | |
14076 | NULL_TREE, /*check_ret=*/false)) | |
dda04398 | 14077 | fate++; |
c8094d83 | 14078 | |
8ca4bf25 MM |
14079 | if (fate == -1) |
14080 | champ = fn; | |
14081 | else if (!fate) | |
73aad9b9 | 14082 | { |
8ca4bf25 MM |
14083 | /* Equally specialized, move to next function. If there |
14084 | is no next function, nothing's most specialized. */ | |
14085 | fn = TREE_CHAIN (fn); | |
7ca383e6 | 14086 | champ = fn; |
8ca4bf25 MM |
14087 | if (!fn) |
14088 | break; | |
73aad9b9 JM |
14089 | } |
14090 | } | |
c8094d83 | 14091 | |
dda04398 NS |
14092 | if (champ) |
14093 | /* Now verify that champ is better than everything earlier in the | |
14094 | instantiation list. */ | |
7ca383e6 | 14095 | for (fn = templates; fn != champ; fn = TREE_CHAIN (fn)) |
a34d3336 NS |
14096 | if (get_bindings (TREE_VALUE (champ), |
14097 | DECL_TEMPLATE_RESULT (TREE_VALUE (fn)), | |
14098 | NULL_TREE, /*check_ret=*/false) | |
14099 | || !get_bindings (TREE_VALUE (fn), | |
14100 | DECL_TEMPLATE_RESULT (TREE_VALUE (champ)), | |
14101 | NULL_TREE, /*check_ret=*/false)) | |
dda04398 NS |
14102 | { |
14103 | champ = NULL_TREE; | |
14104 | break; | |
14105 | } | |
c8094d83 | 14106 | |
dda04398 | 14107 | processing_template_decl--; |
c8094d83 | 14108 | |
dda04398 NS |
14109 | if (!champ) |
14110 | return error_mark_node; | |
73aad9b9 | 14111 | |
7ca383e6 | 14112 | return champ; |
73aad9b9 JM |
14113 | } |
14114 | ||
36a117a5 | 14115 | /* If DECL is a specialization of some template, return the most |
f9a7ae04 MM |
14116 | general such template. Otherwise, returns NULL_TREE. |
14117 | ||
14118 | For example, given: | |
36a117a5 MM |
14119 | |
14120 | template <class T> struct S { template <class U> void f(U); }; | |
14121 | ||
14122 | if TMPL is `template <class U> void S<int>::f(U)' this will return | |
14123 | the full template. This function will not trace past partial | |
14124 | specializations, however. For example, given in addition: | |
14125 | ||
14126 | template <class T> struct S<T*> { template <class U> void f(U); }; | |
14127 | ||
14128 | if TMPL is `template <class U> void S<int*>::f(U)' this will return | |
14129 | `template <class T> template <class U> S<T*>::f(U)'. */ | |
73aad9b9 | 14130 | |
612c671a | 14131 | tree |
3a978d72 | 14132 | most_general_template (tree decl) |
73aad9b9 | 14133 | { |
f9a7ae04 MM |
14134 | /* If DECL is a FUNCTION_DECL, find the TEMPLATE_DECL of which it is |
14135 | an immediate specialization. */ | |
14136 | if (TREE_CODE (decl) == FUNCTION_DECL) | |
14137 | { | |
14138 | if (DECL_TEMPLATE_INFO (decl)) { | |
14139 | decl = DECL_TI_TEMPLATE (decl); | |
14140 | ||
14141 | /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE for a | |
14142 | template friend. */ | |
14143 | if (TREE_CODE (decl) != TEMPLATE_DECL) | |
14144 | return NULL_TREE; | |
14145 | } else | |
14146 | return NULL_TREE; | |
14147 | } | |
14148 | ||
14149 | /* Look for more and more general templates. */ | |
14150 | while (DECL_TEMPLATE_INFO (decl)) | |
14151 | { | |
10b1d5e7 MM |
14152 | /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE in some cases. |
14153 | (See cp-tree.h for details.) */ | |
f9a7ae04 MM |
14154 | if (TREE_CODE (DECL_TI_TEMPLATE (decl)) != TEMPLATE_DECL) |
14155 | break; | |
14156 | ||
6e049fcd KL |
14157 | if (CLASS_TYPE_P (TREE_TYPE (decl)) |
14158 | && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl))) | |
14159 | break; | |
14160 | ||
f9a7ae04 MM |
14161 | /* Stop if we run into an explicitly specialized class template. */ |
14162 | if (!DECL_NAMESPACE_SCOPE_P (decl) | |
14163 | && DECL_CONTEXT (decl) | |
14164 | && CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (decl))) | |
14165 | break; | |
14166 | ||
14167 | decl = DECL_TI_TEMPLATE (decl); | |
14168 | } | |
36a117a5 MM |
14169 | |
14170 | return decl; | |
14171 | } | |
14172 | ||
916b63c3 MM |
14173 | /* Return the most specialized of the class template partial |
14174 | specializations of TMPL which can produce TYPE, a specialization of | |
14175 | TMPL. The value returned is actually a TREE_LIST; the TREE_TYPE is | |
14176 | a _TYPE node corresponding to the partial specialization, while the | |
14177 | TREE_PURPOSE is the set of template arguments that must be | |
14178 | substituted into the TREE_TYPE in order to generate TYPE. | |
14179 | ||
14180 | If the choice of partial specialization is ambiguous, a diagnostic | |
14181 | is issued, and the error_mark_node is returned. If there are no | |
14182 | partial specializations of TMPL matching TYPE, then NULL_TREE is | |
14183 | returned. */ | |
36a117a5 | 14184 | |
e9659ab0 | 14185 | static tree |
916b63c3 | 14186 | most_specialized_class (tree type, tree tmpl) |
36a117a5 MM |
14187 | { |
14188 | tree list = NULL_TREE; | |
14189 | tree t; | |
14190 | tree champ; | |
73aad9b9 | 14191 | int fate; |
916b63c3 MM |
14192 | bool ambiguous_p; |
14193 | tree args; | |
dc28490d | 14194 | tree outer_args = NULL_TREE; |
73aad9b9 | 14195 | |
36a117a5 | 14196 | tmpl = most_general_template (tmpl); |
916b63c3 | 14197 | args = CLASSTYPE_TI_ARGS (type); |
dc28490d JM |
14198 | |
14199 | /* For determining which partial specialization to use, only the | |
14200 | innermost args are interesting. */ | |
14201 | if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args)) | |
14202 | { | |
14203 | outer_args = strip_innermost_template_args (args, 1); | |
14204 | args = INNERMOST_TEMPLATE_ARGS (args); | |
14205 | } | |
14206 | ||
36a117a5 | 14207 | for (t = DECL_TEMPLATE_SPECIALIZATIONS (tmpl); t; t = TREE_CHAIN (t)) |
73aad9b9 | 14208 | { |
916b63c3 MM |
14209 | tree partial_spec_args; |
14210 | tree spec_args; | |
dc28490d | 14211 | tree parms = TREE_VALUE (t); |
916b63c3 MM |
14212 | |
14213 | partial_spec_args = CLASSTYPE_TI_ARGS (TREE_TYPE (t)); | |
dc28490d JM |
14214 | if (outer_args) |
14215 | { | |
14216 | int i; | |
14217 | ||
fd452cef JM |
14218 | ++processing_template_decl; |
14219 | ||
dc28490d JM |
14220 | /* Discard the outer levels of args, and then substitute in the |
14221 | template args from the enclosing class. */ | |
14222 | partial_spec_args = INNERMOST_TEMPLATE_ARGS (partial_spec_args); | |
14223 | partial_spec_args = tsubst_template_args | |
14224 | (partial_spec_args, outer_args, tf_none, NULL_TREE); | |
14225 | ||
14226 | /* PARMS already refers to just the innermost parms, but the | |
14227 | template parms in partial_spec_args had their levels lowered | |
14228 | by tsubst, so we need to do the same for the parm list. We | |
14229 | can't just tsubst the TREE_VEC itself, as tsubst wants to | |
14230 | treat a TREE_VEC as an argument vector. */ | |
14231 | parms = copy_node (parms); | |
14232 | for (i = TREE_VEC_LENGTH (parms) - 1; i >= 0; --i) | |
14233 | TREE_VEC_ELT (parms, i) = | |
14234 | tsubst (TREE_VEC_ELT (parms, i), outer_args, tf_none, NULL_TREE); | |
fd452cef JM |
14235 | |
14236 | --processing_template_decl; | |
dc28490d JM |
14237 | } |
14238 | spec_args = get_class_bindings (parms, | |
3db45ab5 | 14239 | partial_spec_args, |
916b63c3 | 14240 | args); |
36a117a5 | 14241 | if (spec_args) |
73aad9b9 | 14242 | { |
dc28490d JM |
14243 | if (outer_args) |
14244 | spec_args = add_to_template_args (outer_args, spec_args); | |
916b63c3 | 14245 | list = tree_cons (spec_args, TREE_VALUE (t), list); |
73aad9b9 JM |
14246 | TREE_TYPE (list) = TREE_TYPE (t); |
14247 | } | |
14248 | } | |
14249 | ||
14250 | if (! list) | |
14251 | return NULL_TREE; | |
14252 | ||
916b63c3 | 14253 | ambiguous_p = false; |
73aad9b9 JM |
14254 | t = list; |
14255 | champ = t; | |
14256 | t = TREE_CHAIN (t); | |
14257 | for (; t; t = TREE_CHAIN (t)) | |
14258 | { | |
916b63c3 | 14259 | fate = more_specialized_class (champ, t); |
73aad9b9 JM |
14260 | if (fate == 1) |
14261 | ; | |
14262 | else | |
14263 | { | |
14264 | if (fate == 0) | |
14265 | { | |
14266 | t = TREE_CHAIN (t); | |
14267 | if (! t) | |
916b63c3 MM |
14268 | { |
14269 | ambiguous_p = true; | |
14270 | break; | |
14271 | } | |
73aad9b9 JM |
14272 | } |
14273 | champ = t; | |
14274 | } | |
14275 | } | |
14276 | ||
916b63c3 MM |
14277 | if (!ambiguous_p) |
14278 | for (t = list; t && t != champ; t = TREE_CHAIN (t)) | |
14279 | { | |
14280 | fate = more_specialized_class (champ, t); | |
14281 | if (fate != 1) | |
14282 | { | |
14283 | ambiguous_p = true; | |
14284 | break; | |
14285 | } | |
14286 | } | |
14287 | ||
14288 | if (ambiguous_p) | |
73aad9b9 | 14289 | { |
916b63c3 MM |
14290 | const char *str = "candidates are:"; |
14291 | error ("ambiguous class template instantiation for %q#T", type); | |
14292 | for (t = list; t; t = TREE_CHAIN (t)) | |
14293 | { | |
14294 | error ("%s %+#T", str, TREE_TYPE (t)); | |
14295 | str = " "; | |
14296 | } | |
14297 | return error_mark_node; | |
73aad9b9 JM |
14298 | } |
14299 | ||
14300 | return champ; | |
14301 | } | |
14302 | ||
eb8845be | 14303 | /* Explicitly instantiate DECL. */ |
e92cc029 | 14304 | |
8d08fdba | 14305 | void |
eb8845be | 14306 | do_decl_instantiation (tree decl, tree storage) |
8d08fdba | 14307 | { |
8d08fdba | 14308 | tree result = NULL_TREE; |
faae18ab | 14309 | int extern_p = 0; |
e8abc66f | 14310 | |
ad47b891 | 14311 | if (!decl || decl == error_mark_node) |
dc957d14 | 14312 | /* An error occurred, for which grokdeclarator has already issued |
3fa56191 MM |
14313 | an appropriate message. */ |
14314 | return; | |
14315 | else if (! DECL_LANG_SPECIFIC (decl)) | |
ec255269 | 14316 | { |
0f51ccfc | 14317 | error ("explicit instantiation of non-template %q#D", decl); |
ec255269 MS |
14318 | return; |
14319 | } | |
03d0f4af | 14320 | else if (TREE_CODE (decl) == VAR_DECL) |
6633d636 | 14321 | { |
03d0f4af MM |
14322 | /* There is an asymmetry here in the way VAR_DECLs and |
14323 | FUNCTION_DECLs are handled by grokdeclarator. In the case of | |
14324 | the latter, the DECL we get back will be marked as a | |
14325 | template instantiation, and the appropriate | |
14326 | DECL_TEMPLATE_INFO will be set up. This does not happen for | |
14327 | VAR_DECLs so we do the lookup here. Probably, grokdeclarator | |
14328 | should handle VAR_DECLs as it currently handles | |
14329 | FUNCTION_DECLs. */ | |
8259e4f5 PC |
14330 | if (!DECL_CLASS_SCOPE_P (decl)) |
14331 | { | |
14332 | error ("%qD is not a static data member of a class template", decl); | |
14333 | return; | |
14334 | } | |
86ac0575 | 14335 | result = lookup_field (DECL_CONTEXT (decl), DECL_NAME (decl), 0, false); |
e0860732 | 14336 | if (!result || TREE_CODE (result) != VAR_DECL) |
03d0f4af | 14337 | { |
0f51ccfc | 14338 | error ("no matching template for %qD found", decl); |
03d0f4af MM |
14339 | return; |
14340 | } | |
8ea6dfae SM |
14341 | if (!same_type_p (TREE_TYPE (result), TREE_TYPE (decl))) |
14342 | { | |
14343 | error ("type %qT for explicit instantiation %qD does not match " | |
14344 | "declared type %qT", TREE_TYPE (result), decl, | |
14345 | TREE_TYPE (decl)); | |
14346 | return; | |
14347 | } | |
6633d636 MS |
14348 | } |
14349 | else if (TREE_CODE (decl) != FUNCTION_DECL) | |
14350 | { | |
0f51ccfc | 14351 | error ("explicit instantiation of %q#D", decl); |
6633d636 MS |
14352 | return; |
14353 | } | |
03d0f4af MM |
14354 | else |
14355 | result = decl; | |
672476cb | 14356 | |
03d0f4af | 14357 | /* Check for various error cases. Note that if the explicit |
0e339752 | 14358 | instantiation is valid the RESULT will currently be marked as an |
03d0f4af MM |
14359 | *implicit* instantiation; DECL_EXPLICIT_INSTANTIATION is not set |
14360 | until we get here. */ | |
14361 | ||
14362 | if (DECL_TEMPLATE_SPECIALIZATION (result)) | |
672476cb | 14363 | { |
07782718 KL |
14364 | /* DR 259 [temp.spec]. |
14365 | ||
14366 | Both an explicit instantiation and a declaration of an explicit | |
14367 | specialization shall not appear in a program unless the explicit | |
14368 | instantiation follows a declaration of the explicit specialization. | |
03d0f4af | 14369 | |
07782718 KL |
14370 | For a given set of template parameters, if an explicit |
14371 | instantiation of a template appears after a declaration of an | |
14372 | explicit specialization for that template, the explicit | |
14373 | instantiation has no effect. */ | |
672476cb MM |
14374 | return; |
14375 | } | |
03d0f4af MM |
14376 | else if (DECL_EXPLICIT_INSTANTIATION (result)) |
14377 | { | |
14378 | /* [temp.spec] | |
98c1c668 | 14379 | |
03d0f4af | 14380 | No program shall explicitly instantiate any template more |
c8094d83 | 14381 | than once. |
03d0f4af | 14382 | |
4684cd27 MM |
14383 | We check DECL_NOT_REALLY_EXTERN so as not to complain when |
14384 | the first instantiation was `extern' and the second is not, | |
14385 | and EXTERN_P for the opposite case. */ | |
14386 | if (DECL_NOT_REALLY_EXTERN (result) && !extern_p) | |
0f51ccfc | 14387 | pedwarn ("duplicate explicit instantiation of %q#D", result); |
4684cd27 MM |
14388 | /* If an "extern" explicit instantiation follows an ordinary |
14389 | explicit instantiation, the template is instantiated. */ | |
14390 | if (extern_p) | |
03d0f4af MM |
14391 | return; |
14392 | } | |
14393 | else if (!DECL_IMPLICIT_INSTANTIATION (result)) | |
faae18ab | 14394 | { |
0f51ccfc | 14395 | error ("no matching template for %qD found", result); |
faae18ab MS |
14396 | return; |
14397 | } | |
03d0f4af | 14398 | else if (!DECL_TEMPLATE_INFO (result)) |
6633d636 | 14399 | { |
0f51ccfc | 14400 | pedwarn ("explicit instantiation of non-template %q#D", result); |
6633d636 MS |
14401 | return; |
14402 | } | |
14403 | ||
f0e01782 | 14404 | if (storage == NULL_TREE) |
00595019 | 14405 | ; |
faae18ab | 14406 | else if (storage == ridpointers[(int) RID_EXTERN]) |
03d0f4af | 14407 | { |
c02f5e29 | 14408 | if (pedantic && !in_system_header) |
0f51ccfc | 14409 | pedwarn ("ISO C++ forbids the use of %<extern%> on explicit " |
0cbd7506 | 14410 | "instantiations"); |
03d0f4af MM |
14411 | extern_p = 1; |
14412 | } | |
f0e01782 | 14413 | else |
0f51ccfc | 14414 | error ("storage class %qD applied to template instantiation", storage); |
3db45ab5 | 14415 | |
9c12301f | 14416 | check_explicit_instantiation_namespace (result); |
5566b478 | 14417 | mark_decl_instantiated (result, extern_p); |
c91a56d2 | 14418 | if (! extern_p) |
3db45ab5 | 14419 | instantiate_decl (result, /*defer_ok=*/1, |
eba839f9 | 14420 | /*expl_inst_class_mem_p=*/false); |
7177d104 MS |
14421 | } |
14422 | ||
b5791fdc | 14423 | static void |
3a978d72 | 14424 | mark_class_instantiated (tree t, int extern_p) |
faae18ab MS |
14425 | { |
14426 | SET_CLASSTYPE_EXPLICIT_INSTANTIATION (t); | |
eb773359 JM |
14427 | SET_CLASSTYPE_INTERFACE_KNOWN (t); |
14428 | CLASSTYPE_INTERFACE_ONLY (t) = extern_p; | |
faae18ab MS |
14429 | TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (t)) = extern_p; |
14430 | if (! extern_p) | |
14431 | { | |
14432 | CLASSTYPE_DEBUG_REQUESTED (t) = 1; | |
14433 | rest_of_type_compilation (t, 1); | |
14434 | } | |
c8094d83 | 14435 | } |
e8abc66f | 14436 | |
5e0c54e5 | 14437 | /* Called from do_type_instantiation through binding_table_foreach to |
9bcb9aae | 14438 | do recursive instantiation for the type bound in ENTRY. */ |
5e0c54e5 GDR |
14439 | static void |
14440 | bt_instantiate_type_proc (binding_entry entry, void *data) | |
14441 | { | |
14442 | tree storage = *(tree *) data; | |
14443 | ||
9e1e64ec | 14444 | if (MAYBE_CLASS_TYPE_P (entry->type) |
5e0c54e5 GDR |
14445 | && !uses_template_parms (CLASSTYPE_TI_ARGS (entry->type))) |
14446 | do_type_instantiation (TYPE_MAIN_DECL (entry->type), storage, 0); | |
14447 | } | |
14448 | ||
415c974c MA |
14449 | /* Called from do_type_instantiation to instantiate a member |
14450 | (a member function or a static member variable) of an | |
03fd3f84 | 14451 | explicitly instantiated class template. */ |
415c974c MA |
14452 | static void |
14453 | instantiate_class_member (tree decl, int extern_p) | |
14454 | { | |
14455 | mark_decl_instantiated (decl, extern_p); | |
415c974c | 14456 | if (! extern_p) |
3db45ab5 | 14457 | instantiate_decl (decl, /*defer_ok=*/1, |
eba839f9 | 14458 | /*expl_inst_class_mem_p=*/true); |
415c974c MA |
14459 | } |
14460 | ||
a1bcc528 JM |
14461 | /* Perform an explicit instantiation of template class T. STORAGE, if |
14462 | non-null, is the RID for extern, inline or static. COMPLAIN is | |
838dfd8a | 14463 | nonzero if this is called from the parser, zero if called recursively, |
a1bcc528 | 14464 | since the standard is unclear (as detailed below). */ |
c8094d83 | 14465 | |
7177d104 | 14466 | void |
3a978d72 | 14467 | do_type_instantiation (tree t, tree storage, tsubst_flags_t complain) |
7177d104 | 14468 | { |
e8abc66f MS |
14469 | int extern_p = 0; |
14470 | int nomem_p = 0; | |
5566b478 | 14471 | int static_p = 0; |
4746cf84 | 14472 | int previous_instantiation_extern_p = 0; |
5566b478 | 14473 | |
ca79f85d JM |
14474 | if (TREE_CODE (t) == TYPE_DECL) |
14475 | t = TREE_TYPE (t); | |
14476 | ||
7ddedda4 | 14477 | if (! CLASS_TYPE_P (t) || ! CLASSTYPE_TEMPLATE_INFO (t)) |
ca79f85d | 14478 | { |
0f51ccfc | 14479 | error ("explicit instantiation of non-template type %qT", t); |
ca79f85d JM |
14480 | return; |
14481 | } | |
14482 | ||
5566b478 | 14483 | complete_type (t); |
7177d104 | 14484 | |
d0f062fb | 14485 | if (!COMPLETE_TYPE_P (t)) |
f0e01782 | 14486 | { |
c2ea3a40 | 14487 | if (complain & tf_error) |
0f51ccfc | 14488 | error ("explicit instantiation of %q#T before definition of template", |
0cbd7506 | 14489 | t); |
f0e01782 MS |
14490 | return; |
14491 | } | |
14492 | ||
03d0f4af | 14493 | if (storage != NULL_TREE) |
f0e01782 | 14494 | { |
c02f5e29 | 14495 | if (pedantic && !in_system_header) |
c8094d83 | 14496 | pedwarn("ISO C++ forbids the use of %qE on explicit instantiations", |
0cbd7506 | 14497 | storage); |
03d0f4af MM |
14498 | |
14499 | if (storage == ridpointers[(int) RID_INLINE]) | |
14500 | nomem_p = 1; | |
14501 | else if (storage == ridpointers[(int) RID_EXTERN]) | |
14502 | extern_p = 1; | |
14503 | else if (storage == ridpointers[(int) RID_STATIC]) | |
14504 | static_p = 1; | |
14505 | else | |
14506 | { | |
0f51ccfc | 14507 | error ("storage class %qD applied to template instantiation", |
0cbd7506 | 14508 | storage); |
03d0f4af MM |
14509 | extern_p = 0; |
14510 | } | |
f0e01782 MS |
14511 | } |
14512 | ||
370af2d5 | 14513 | if (CLASSTYPE_TEMPLATE_SPECIALIZATION (t)) |
03d0f4af | 14514 | { |
07782718 | 14515 | /* DR 259 [temp.spec]. |
a292b002 | 14516 | |
07782718 KL |
14517 | Both an explicit instantiation and a declaration of an explicit |
14518 | specialization shall not appear in a program unless the explicit | |
14519 | instantiation follows a declaration of the explicit specialization. | |
14520 | ||
14521 | For a given set of template parameters, if an explicit | |
14522 | instantiation of a template appears after a declaration of an | |
14523 | explicit specialization for that template, the explicit | |
14524 | instantiation has no effect. */ | |
03d0f4af MM |
14525 | return; |
14526 | } | |
14527 | else if (CLASSTYPE_EXPLICIT_INSTANTIATION (t)) | |
44a8d0b3 | 14528 | { |
03d0f4af MM |
14529 | /* [temp.spec] |
14530 | ||
14531 | No program shall explicitly instantiate any template more | |
c8094d83 | 14532 | than once. |
03d0f4af | 14533 | |
0cbd7506 | 14534 | If PREVIOUS_INSTANTIATION_EXTERN_P, then the first explicit |
4746cf84 | 14535 | instantiation was `extern'. If EXTERN_P then the second is. |
4684cd27 | 14536 | These cases are OK. */ |
4746cf84 MA |
14537 | previous_instantiation_extern_p = CLASSTYPE_INTERFACE_ONLY (t); |
14538 | ||
14539 | if (!previous_instantiation_extern_p && !extern_p | |
c2ea3a40 | 14540 | && (complain & tf_error)) |
0f51ccfc | 14541 | pedwarn ("duplicate explicit instantiation of %q#T", t); |
c8094d83 | 14542 | |
03d0f4af MM |
14543 | /* If we've already instantiated the template, just return now. */ |
14544 | if (!CLASSTYPE_INTERFACE_ONLY (t)) | |
14545 | return; | |
44a8d0b3 | 14546 | } |
e8abc66f | 14547 | |
9c12301f | 14548 | check_explicit_instantiation_namespace (TYPE_NAME (t)); |
03d0f4af | 14549 | mark_class_instantiated (t, extern_p); |
03d0f4af | 14550 | |
e8abc66f MS |
14551 | if (nomem_p) |
14552 | return; | |
14553 | ||
7177d104 | 14554 | { |
db5ae43f | 14555 | tree tmp; |
5566b478 | 14556 | |
03d0f4af MM |
14557 | /* In contrast to implicit instantiation, where only the |
14558 | declarations, and not the definitions, of members are | |
14559 | instantiated, we have here: | |
14560 | ||
0cbd7506 | 14561 | [temp.explicit] |
03d0f4af MM |
14562 | |
14563 | The explicit instantiation of a class template specialization | |
14564 | implies the instantiation of all of its members not | |
14565 | previously explicitly specialized in the translation unit | |
c8094d83 | 14566 | containing the explicit instantiation. |
03d0f4af MM |
14567 | |
14568 | Of course, we can't instantiate member template classes, since | |
14569 | we don't have any arguments for them. Note that the standard | |
dc957d14 | 14570 | is unclear on whether the instantiation of the members are |
415c974c | 14571 | *explicit* instantiations or not. However, the most natural |
03fd3f84 | 14572 | interpretation is that it should be an explicit instantiation. */ |
03d0f4af | 14573 | |
5566b478 MS |
14574 | if (! static_p) |
14575 | for (tmp = TYPE_METHODS (t); tmp; tmp = TREE_CHAIN (tmp)) | |
a7d87521 | 14576 | if (TREE_CODE (tmp) == FUNCTION_DECL |
1f109f0f | 14577 | && DECL_TEMPLATE_INSTANTIATION (tmp)) |
415c974c | 14578 | instantiate_class_member (tmp, extern_p); |
5566b478 MS |
14579 | |
14580 | for (tmp = TYPE_FIELDS (t); tmp; tmp = TREE_CHAIN (tmp)) | |
14581 | if (TREE_CODE (tmp) == VAR_DECL && DECL_TEMPLATE_INSTANTIATION (tmp)) | |
415c974c | 14582 | instantiate_class_member (tmp, extern_p); |
7177d104 | 14583 | |
5e0c54e5 GDR |
14584 | if (CLASSTYPE_NESTED_UTDS (t)) |
14585 | binding_table_foreach (CLASSTYPE_NESTED_UTDS (t), | |
0cbd7506 | 14586 | bt_instantiate_type_proc, &storage); |
a292b002 | 14587 | } |
8d08fdba | 14588 | } |
a28e3c7f | 14589 | |
36a117a5 MM |
14590 | /* Given a function DECL, which is a specialization of TMPL, modify |
14591 | DECL to be a re-instantiation of TMPL with the same template | |
14592 | arguments. TMPL should be the template into which tsubst'ing | |
14593 | should occur for DECL, not the most general template. | |
830bfa74 MM |
14594 | |
14595 | One reason for doing this is a scenario like this: | |
14596 | ||
14597 | template <class T> | |
14598 | void f(const T&, int i); | |
14599 | ||
14600 | void g() { f(3, 7); } | |
14601 | ||
14602 | template <class T> | |
14603 | void f(const T& t, const int i) { } | |
14604 | ||
14605 | Note that when the template is first instantiated, with | |
14606 | instantiate_template, the resulting DECL will have no name for the | |
14607 | first parameter, and the wrong type for the second. So, when we go | |
14608 | to instantiate the DECL, we regenerate it. */ | |
14609 | ||
e9659ab0 | 14610 | static void |
3a978d72 | 14611 | regenerate_decl_from_template (tree decl, tree tmpl) |
830bfa74 | 14612 | { |
f9a7ae04 MM |
14613 | /* The arguments used to instantiate DECL, from the most general |
14614 | template. */ | |
830bfa74 | 14615 | tree args; |
830bfa74 | 14616 | tree code_pattern; |
830bfa74 MM |
14617 | |
14618 | args = DECL_TI_ARGS (decl); | |
14619 | code_pattern = DECL_TEMPLATE_RESULT (tmpl); | |
14620 | ||
2b907f5c KL |
14621 | /* Make sure that we can see identifiers, and compute access |
14622 | correctly. */ | |
14623 | push_access_scope (decl); | |
14624 | ||
c7222c02 MM |
14625 | if (TREE_CODE (decl) == FUNCTION_DECL) |
14626 | { | |
14627 | tree decl_parm; | |
14628 | tree pattern_parm; | |
14629 | tree specs; | |
14630 | int args_depth; | |
14631 | int parms_depth; | |
c8094d83 | 14632 | |
c7222c02 | 14633 | args_depth = TMPL_ARGS_DEPTH (args); |
c8094d83 | 14634 | parms_depth = TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl)); |
c7222c02 MM |
14635 | if (args_depth > parms_depth) |
14636 | args = get_innermost_template_args (args, parms_depth); | |
14637 | ||
14638 | specs = tsubst_exception_specification (TREE_TYPE (code_pattern), | |
14639 | args, tf_error, NULL_TREE); | |
14640 | if (specs) | |
14641 | TREE_TYPE (decl) = build_exception_variant (TREE_TYPE (decl), | |
14642 | specs); | |
14643 | ||
14644 | /* Merge parameter declarations. */ | |
c8094d83 | 14645 | decl_parm = skip_artificial_parms_for (decl, |
c7222c02 | 14646 | DECL_ARGUMENTS (decl)); |
c8094d83 | 14647 | pattern_parm |
c7222c02 MM |
14648 | = skip_artificial_parms_for (code_pattern, |
14649 | DECL_ARGUMENTS (code_pattern)); | |
5d80a306 | 14650 | while (decl_parm && !FUNCTION_PARAMETER_PACK_P (pattern_parm)) |
c7222c02 MM |
14651 | { |
14652 | tree parm_type; | |
b17bba6d | 14653 | tree attributes; |
5d80a306 | 14654 | |
c7222c02 MM |
14655 | if (DECL_NAME (decl_parm) != DECL_NAME (pattern_parm)) |
14656 | DECL_NAME (decl_parm) = DECL_NAME (pattern_parm); | |
14657 | parm_type = tsubst (TREE_TYPE (pattern_parm), args, tf_error, | |
14658 | NULL_TREE); | |
02bab9db | 14659 | parm_type = type_decays_to (parm_type); |
c7222c02 MM |
14660 | if (!same_type_p (TREE_TYPE (decl_parm), parm_type)) |
14661 | TREE_TYPE (decl_parm) = parm_type; | |
b17bba6d MM |
14662 | attributes = DECL_ATTRIBUTES (pattern_parm); |
14663 | if (DECL_ATTRIBUTES (decl_parm) != attributes) | |
14664 | { | |
14665 | DECL_ATTRIBUTES (decl_parm) = attributes; | |
14666 | cplus_decl_attributes (&decl_parm, attributes, /*flags=*/0); | |
14667 | } | |
c7222c02 MM |
14668 | decl_parm = TREE_CHAIN (decl_parm); |
14669 | pattern_parm = TREE_CHAIN (pattern_parm); | |
14670 | } | |
5d80a306 DG |
14671 | /* Merge any parameters that match with the function parameter |
14672 | pack. */ | |
14673 | if (pattern_parm && FUNCTION_PARAMETER_PACK_P (pattern_parm)) | |
14674 | { | |
14675 | int i, len; | |
14676 | tree expanded_types; | |
14677 | /* Expand the TYPE_PACK_EXPANSION that provides the types for | |
14678 | the parameters in this function parameter pack. */ | |
14679 | expanded_types = tsubst_pack_expansion (TREE_TYPE (pattern_parm), | |
14680 | args, tf_error, NULL_TREE); | |
14681 | len = TREE_VEC_LENGTH (expanded_types); | |
14682 | for (i = 0; i < len; i++) | |
14683 | { | |
14684 | tree parm_type; | |
14685 | tree attributes; | |
14686 | ||
14687 | if (DECL_NAME (decl_parm) != DECL_NAME (pattern_parm)) | |
14688 | /* Rename the parameter to include the index. */ | |
14689 | DECL_NAME (decl_parm) = | |
14690 | make_ith_pack_parameter_name (DECL_NAME (pattern_parm), i); | |
14691 | parm_type = TREE_VEC_ELT (expanded_types, i); | |
14692 | parm_type = type_decays_to (parm_type); | |
14693 | if (!same_type_p (TREE_TYPE (decl_parm), parm_type)) | |
14694 | TREE_TYPE (decl_parm) = parm_type; | |
14695 | attributes = DECL_ATTRIBUTES (pattern_parm); | |
14696 | if (DECL_ATTRIBUTES (decl_parm) != attributes) | |
14697 | { | |
14698 | DECL_ATTRIBUTES (decl_parm) = attributes; | |
14699 | cplus_decl_attributes (&decl_parm, attributes, /*flags=*/0); | |
14700 | } | |
14701 | decl_parm = TREE_CHAIN (decl_parm); | |
14702 | } | |
14703 | } | |
c7222c02 MM |
14704 | /* Merge additional specifiers from the CODE_PATTERN. */ |
14705 | if (DECL_DECLARED_INLINE_P (code_pattern) | |
14706 | && !DECL_DECLARED_INLINE_P (decl)) | |
14707 | DECL_DECLARED_INLINE_P (decl) = 1; | |
14708 | if (DECL_INLINE (code_pattern) && !DECL_INLINE (decl)) | |
14709 | DECL_INLINE (decl) = 1; | |
14710 | } | |
14711 | else if (TREE_CODE (decl) == VAR_DECL) | |
b794e321 MM |
14712 | DECL_INITIAL (decl) = |
14713 | tsubst_expr (DECL_INITIAL (code_pattern), args, | |
015c2c66 MM |
14714 | tf_error, DECL_TI_TEMPLATE (decl), |
14715 | /*integral_constant_expression_p=*/false); | |
c7222c02 MM |
14716 | else |
14717 | gcc_unreachable (); | |
36a117a5 | 14718 | |
2b59fc25 | 14719 | pop_access_scope (decl); |
830bfa74 MM |
14720 | } |
14721 | ||
a723baf1 MM |
14722 | /* Return the TEMPLATE_DECL into which DECL_TI_ARGS(DECL) should be |
14723 | substituted to get DECL. */ | |
14724 | ||
d58b7c2d | 14725 | tree |
a723baf1 MM |
14726 | template_for_substitution (tree decl) |
14727 | { | |
14728 | tree tmpl = DECL_TI_TEMPLATE (decl); | |
14729 | ||
14730 | /* Set TMPL to the template whose DECL_TEMPLATE_RESULT is the pattern | |
14731 | for the instantiation. This is not always the most general | |
14732 | template. Consider, for example: | |
14733 | ||
0cbd7506 | 14734 | template <class T> |
a723baf1 | 14735 | struct S { template <class U> void f(); |
0cbd7506 | 14736 | template <> void f<int>(); }; |
a723baf1 MM |
14737 | |
14738 | and an instantiation of S<double>::f<int>. We want TD to be the | |
14739 | specialization S<T>::f<int>, not the more general S<T>::f<U>. */ | |
14740 | while (/* An instantiation cannot have a definition, so we need a | |
14741 | more general template. */ | |
14742 | DECL_TEMPLATE_INSTANTIATION (tmpl) | |
14743 | /* We must also deal with friend templates. Given: | |
14744 | ||
c8094d83 | 14745 | template <class T> struct S { |
a723baf1 MM |
14746 | template <class U> friend void f() {}; |
14747 | }; | |
14748 | ||
14749 | S<int>::f<U> say, is not an instantiation of S<T>::f<U>, | |
14750 | so far as the language is concerned, but that's still | |
14751 | where we get the pattern for the instantiation from. On | |
14752 | other hand, if the definition comes outside the class, say: | |
14753 | ||
c8094d83 | 14754 | template <class T> struct S { |
a723baf1 MM |
14755 | template <class U> friend void f(); |
14756 | }; | |
14757 | template <class U> friend void f() {} | |
14758 | ||
14759 | we don't need to look any further. That's what the check for | |
14760 | DECL_INITIAL is for. */ | |
14761 | || (TREE_CODE (decl) == FUNCTION_DECL | |
14762 | && DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (tmpl) | |
14763 | && !DECL_INITIAL (DECL_TEMPLATE_RESULT (tmpl)))) | |
14764 | { | |
14765 | /* The present template, TD, should not be a definition. If it | |
14766 | were a definition, we should be using it! Note that we | |
14767 | cannot restructure the loop to just keep going until we find | |
14768 | a template with a definition, since that might go too far if | |
14769 | a specialization was declared, but not defined. */ | |
50bc768d NS |
14770 | gcc_assert (TREE_CODE (decl) != VAR_DECL |
14771 | || DECL_IN_AGGR_P (DECL_TEMPLATE_RESULT (tmpl))); | |
c8094d83 | 14772 | |
a723baf1 MM |
14773 | /* Fetch the more general template. */ |
14774 | tmpl = DECL_TI_TEMPLATE (tmpl); | |
14775 | } | |
14776 | ||
14777 | return tmpl; | |
14778 | } | |
14779 | ||
16d53b64 | 14780 | /* Produce the definition of D, a _DECL generated from a template. If |
838dfd8a | 14781 | DEFER_OK is nonzero, then we don't have to actually do the |
415c974c MA |
14782 | instantiation now; we just have to do it sometime. Normally it is |
14783 | an error if this is an explicit instantiation but D is undefined. | |
eba839f9 MM |
14784 | EXPL_INST_CLASS_MEM_P is true iff D is a member of an |
14785 | explicitly instantiated class template. */ | |
f84b4be9 | 14786 | |
a28e3c7f | 14787 | tree |
3db45ab5 | 14788 | instantiate_decl (tree d, int defer_ok, |
eba839f9 | 14789 | bool expl_inst_class_mem_p) |
a28e3c7f | 14790 | { |
36a117a5 | 14791 | tree tmpl = DECL_TI_TEMPLATE (d); |
65f8b0fb MM |
14792 | tree gen_args; |
14793 | tree args; | |
830bfa74 | 14794 | tree td; |
36a117a5 MM |
14795 | tree code_pattern; |
14796 | tree spec; | |
14797 | tree gen_tmpl; | |
b794e321 | 14798 | bool pattern_defined; |
31a714f6 | 14799 | int need_push; |
82a98427 | 14800 | location_t saved_loc = input_location; |
912291ca | 14801 | int saved_in_system_header = in_system_header; |
f7e4e484 | 14802 | bool external_p; |
c8094d83 | 14803 | |
36a117a5 MM |
14804 | /* This function should only be used to instantiate templates for |
14805 | functions and static member variables. */ | |
50bc768d NS |
14806 | gcc_assert (TREE_CODE (d) == FUNCTION_DECL |
14807 | || TREE_CODE (d) == VAR_DECL); | |
36a117a5 | 14808 | |
cec24319 MM |
14809 | /* Variables are never deferred; if instantiation is required, they |
14810 | are instantiated right away. That allows for better code in the | |
14811 | case that an expression refers to the value of the variable -- | |
14812 | if the variable has a constant value the referring expression can | |
14813 | take advantage of that fact. */ | |
14814 | if (TREE_CODE (d) == VAR_DECL) | |
14815 | defer_ok = 0; | |
14816 | ||
db9b2174 MM |
14817 | /* Don't instantiate cloned functions. Instead, instantiate the |
14818 | functions they cloned. */ | |
14819 | if (TREE_CODE (d) == FUNCTION_DECL && DECL_CLONED_FUNCTION_P (d)) | |
14820 | d = DECL_CLONED_FUNCTION (d); | |
14821 | ||
fbf1c34b | 14822 | if (DECL_TEMPLATE_INSTANTIATED (d)) |
03d0f4af | 14823 | /* D has already been instantiated. It might seem reasonable to |
dc957d14 | 14824 | check whether or not D is an explicit instantiation, and, if so, |
03d0f4af MM |
14825 | stop here. But when an explicit instantiation is deferred |
14826 | until the end of the compilation, DECL_EXPLICIT_INSTANTIATION | |
14827 | is set, even though we still need to do the instantiation. */ | |
36a117a5 MM |
14828 | return d; |
14829 | ||
14830 | /* If we already have a specialization of this declaration, then | |
14831 | there's no reason to instantiate it. Note that | |
14832 | retrieve_specialization gives us both instantiations and | |
14833 | specializations, so we must explicitly check | |
14834 | DECL_TEMPLATE_SPECIALIZATION. */ | |
14835 | gen_tmpl = most_general_template (tmpl); | |
65f8b0fb | 14836 | gen_args = DECL_TI_ARGS (d); |
c7222c02 MM |
14837 | spec = retrieve_specialization (gen_tmpl, gen_args, |
14838 | /*class_specializations_p=*/false); | |
36a117a5 MM |
14839 | if (spec != NULL_TREE && DECL_TEMPLATE_SPECIALIZATION (spec)) |
14840 | return spec; | |
14841 | ||
14842 | /* This needs to happen before any tsubsting. */ | |
14843 | if (! push_tinst_level (d)) | |
14844 | return d; | |
14845 | ||
297a5329 JM |
14846 | timevar_push (TV_PARSE); |
14847 | ||
4d85e00e | 14848 | /* Set TD to the template whose DECL_TEMPLATE_RESULT is the pattern |
a723baf1 MM |
14849 | for the instantiation. */ |
14850 | td = template_for_substitution (d); | |
fee23f54 | 14851 | code_pattern = DECL_TEMPLATE_RESULT (td); |
27bb8339 | 14852 | |
2d22db1f | 14853 | /* We should never be trying to instantiate a member of a class |
3db45ab5 | 14854 | template or partial specialization. */ |
2d22db1f | 14855 | gcc_assert (d != code_pattern); |
3db45ab5 | 14856 | |
76d3baad KL |
14857 | if ((DECL_NAMESPACE_SCOPE_P (d) && !DECL_INITIALIZED_IN_CLASS_P (d)) |
14858 | || DECL_TEMPLATE_SPECIALIZATION (td)) | |
649fc72d NS |
14859 | /* In the case of a friend template whose definition is provided |
14860 | outside the class, we may have too many arguments. Drop the | |
76d3baad | 14861 | ones we don't need. The same is true for specializations. */ |
649fc72d NS |
14862 | args = get_innermost_template_args |
14863 | (gen_args, TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (td))); | |
14864 | else | |
14865 | args = gen_args; | |
65f8b0fb | 14866 | |
5566b478 | 14867 | if (TREE_CODE (d) == FUNCTION_DECL) |
39c76b4f | 14868 | pattern_defined = (DECL_SAVED_TREE (code_pattern) != NULL_TREE); |
5566b478 | 14869 | else |
36a117a5 | 14870 | pattern_defined = ! DECL_IN_AGGR_P (code_pattern); |
b794e321 MM |
14871 | |
14872 | /* We may be in the middle of deferred access check. Disable it now. */ | |
14873 | push_deferring_access_checks (dk_no_deferred); | |
14874 | ||
4684cd27 MM |
14875 | /* Unless an explicit instantiation directive has already determined |
14876 | the linkage of D, remember that a definition is available for | |
14877 | this entity. */ | |
c8094d83 | 14878 | if (pattern_defined |
4684cd27 MM |
14879 | && !DECL_INTERFACE_KNOWN (d) |
14880 | && !DECL_NOT_REALLY_EXTERN (d)) | |
14881 | mark_definable (d); | |
de22184b | 14882 | |
f31686a3 | 14883 | input_location = DECL_SOURCE_LOCATION (d); |
912291ca | 14884 | in_system_header = DECL_IN_SYSTEM_HEADER (d); |
de22184b | 14885 | |
eba839f9 MM |
14886 | /* If D is a member of an explicitly instantiated class template, |
14887 | and no definition is available, treat it like an implicit | |
3db45ab5 MS |
14888 | instantiation. */ |
14889 | if (!pattern_defined && expl_inst_class_mem_p | |
14890 | && DECL_EXPLICIT_INSTANTIATION (d)) | |
5566b478 | 14891 | { |
4684cd27 | 14892 | DECL_NOT_REALLY_EXTERN (d) = 0; |
eba839f9 | 14893 | DECL_INTERFACE_KNOWN (d) = 0; |
4684cd27 | 14894 | SET_DECL_IMPLICIT_INSTANTIATION (d); |
5566b478 MS |
14895 | } |
14896 | ||
4f2b0fb2 NS |
14897 | if (!defer_ok) |
14898 | { | |
14899 | /* Recheck the substitutions to obtain any warning messages | |
14900 | about ignoring cv qualifiers. */ | |
14901 | tree gen = DECL_TEMPLATE_RESULT (gen_tmpl); | |
14902 | tree type = TREE_TYPE (gen); | |
14903 | ||
0e902d98 | 14904 | /* Make sure that we can see identifiers, and compute access |
2b59fc25 KL |
14905 | correctly. D is already the target FUNCTION_DECL with the |
14906 | right context. */ | |
14907 | push_access_scope (d); | |
0e902d98 | 14908 | |
4f2b0fb2 NS |
14909 | if (TREE_CODE (gen) == FUNCTION_DECL) |
14910 | { | |
23fca1f5 | 14911 | tsubst (DECL_ARGUMENTS (gen), gen_args, tf_warning_or_error, d); |
5d80a306 DG |
14912 | tsubst_exception_specification (type, gen_args, tf_warning_or_error, |
14913 | d); | |
4f2b0fb2 NS |
14914 | /* Don't simply tsubst the function type, as that will give |
14915 | duplicate warnings about poor parameter qualifications. | |
14916 | The function arguments are the same as the decl_arguments | |
c6002625 | 14917 | without the top level cv qualifiers. */ |
4f2b0fb2 NS |
14918 | type = TREE_TYPE (type); |
14919 | } | |
23fca1f5 | 14920 | tsubst (type, gen_args, tf_warning_or_error, d); |
0e902d98 | 14921 | |
2b59fc25 | 14922 | pop_access_scope (d); |
4f2b0fb2 | 14923 | } |
c8094d83 | 14924 | |
f7e4e484 MM |
14925 | /* Check to see whether we know that this template will be |
14926 | instantiated in some other file, as with "extern template" | |
14927 | extension. */ | |
14928 | external_p = (DECL_INTERFACE_KNOWN (d) && DECL_REALLY_EXTERN (d)); | |
14929 | /* In general, we do not instantiate such templates... */ | |
14930 | if (external_p | |
14931 | /* ... but we instantiate inline functions so that we can inline | |
14932 | them and ... */ | |
14933 | && ! (TREE_CODE (d) == FUNCTION_DECL && DECL_INLINE (d)) | |
14934 | /* ... we instantiate static data members whose values are | |
14935 | needed in integral constant expressions. */ | |
3db45ab5 | 14936 | && ! (TREE_CODE (d) == VAR_DECL |
f7e4e484 | 14937 | && DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (d))) |
930cd796 | 14938 | goto out; |
16d53b64 | 14939 | /* Defer all other templates, unless we have been explicitly |
f7e4e484 MM |
14940 | forbidden from doing so. */ |
14941 | if (/* If there is no definition, we cannot instantiate the | |
14942 | template. */ | |
3db45ab5 | 14943 | ! pattern_defined |
f7e4e484 MM |
14944 | /* If it's OK to postpone instantiation, do so. */ |
14945 | || defer_ok | |
14946 | /* If this is a static data member that will be defined | |
14947 | elsewhere, we don't want to instantiate the entire data | |
14948 | member, but we do want to instantiate the initializer so that | |
14949 | we can substitute that elsewhere. */ | |
14950 | || (external_p && TREE_CODE (d) == VAR_DECL)) | |
16d53b64 | 14951 | { |
b794e321 MM |
14952 | /* The definition of the static data member is now required so |
14953 | we must substitute the initializer. */ | |
14954 | if (TREE_CODE (d) == VAR_DECL | |
3db45ab5 | 14955 | && !DECL_INITIAL (d) |
b794e321 MM |
14956 | && DECL_INITIAL (code_pattern)) |
14957 | { | |
4bff36d3 MM |
14958 | tree ns; |
14959 | tree init; | |
14960 | ||
14961 | ns = decl_namespace_context (d); | |
27a725e2 | 14962 | push_nested_namespace (ns); |
b794e321 | 14963 | push_nested_class (DECL_CONTEXT (d)); |
3db45ab5 | 14964 | init = tsubst_expr (DECL_INITIAL (code_pattern), |
4bff36d3 | 14965 | args, |
015c2c66 MM |
14966 | tf_warning_or_error, NULL_TREE, |
14967 | /*integral_constant_expression_p=*/false); | |
d174af6c MM |
14968 | cp_finish_decl (d, init, /*init_const_expr_p=*/false, |
14969 | /*asmspec_tree=*/NULL_TREE, | |
86414779 | 14970 | LOOKUP_ONLYCONVERTING); |
b794e321 | 14971 | pop_nested_class (); |
27a725e2 | 14972 | pop_nested_namespace (ns); |
b794e321 MM |
14973 | } |
14974 | ||
f7e4e484 MM |
14975 | /* We restore the source position here because it's used by |
14976 | add_pending_template. */ | |
82a98427 | 14977 | input_location = saved_loc; |
c27be9b9 | 14978 | |
c8094d83 | 14979 | if (at_eof && !pattern_defined |
03d0f4af MM |
14980 | && DECL_EXPLICIT_INSTANTIATION (d)) |
14981 | /* [temp.explicit] | |
14982 | ||
14983 | The definition of a non-exported function template, a | |
14984 | non-exported member function template, or a non-exported | |
14985 | member function or static data member of a class template | |
14986 | shall be present in every translation unit in which it is | |
14987 | explicitly instantiated. */ | |
33bd39a2 | 14988 | pedwarn |
0f51ccfc | 14989 | ("explicit instantiation of %qD but no definition available", d); |
03d0f4af | 14990 | |
f7e4e484 MM |
14991 | /* ??? Historically, we have instantiated inline functions, even |
14992 | when marked as "extern template". */ | |
14993 | if (!(external_p && TREE_CODE (d) == VAR_DECL)) | |
14994 | add_pending_template (d); | |
de22184b | 14995 | goto out; |
5566b478 | 14996 | } |
4684cd27 MM |
14997 | /* Tell the repository that D is available in this translation unit |
14998 | -- and see if it is supposed to be instantiated here. */ | |
14999 | if (TREE_PUBLIC (d) && !DECL_REALLY_EXTERN (d) && !repo_emit_p (d)) | |
15000 | { | |
15001 | /* In a PCH file, despite the fact that the repository hasn't | |
15002 | requested instantiation in the PCH it is still possible that | |
15003 | an instantiation will be required in a file that includes the | |
15004 | PCH. */ | |
15005 | if (pch_file) | |
15006 | add_pending_template (d); | |
15007 | /* Instantiate inline functions so that the inliner can do its | |
15008 | job, even though we'll not be emitting a copy of this | |
15009 | function. */ | |
c2a124b2 | 15010 | if (!(TREE_CODE (d) == FUNCTION_DECL |
c8094d83 | 15011 | && flag_inline_trees |
c2a124b2 | 15012 | && DECL_DECLARED_INLINE_P (d))) |
4684cd27 MM |
15013 | goto out; |
15014 | } | |
5566b478 | 15015 | |
6de9cd9a | 15016 | need_push = !cfun || !global_bindings_p (); |
31a714f6 MM |
15017 | if (need_push) |
15018 | push_to_top_level (); | |
414ea4aa | 15019 | |
66e0c440 KL |
15020 | /* Mark D as instantiated so that recursive calls to |
15021 | instantiate_decl do not try to instantiate it again. */ | |
15022 | DECL_TEMPLATE_INSTANTIATED (d) = 1; | |
15023 | ||
2b0a63a3 MM |
15024 | /* Regenerate the declaration in case the template has been modified |
15025 | by a subsequent redeclaration. */ | |
15026 | regenerate_decl_from_template (d, td); | |
4684cd27 | 15027 | |
120722ac | 15028 | /* We already set the file and line above. Reset them now in case |
6de9cd9a | 15029 | they changed as a result of calling regenerate_decl_from_template. */ |
f31686a3 | 15030 | input_location = DECL_SOURCE_LOCATION (d); |
5156628f | 15031 | |
5566b478 MS |
15032 | if (TREE_CODE (d) == VAR_DECL) |
15033 | { | |
e92fb501 MM |
15034 | tree init; |
15035 | ||
1d62c33e MM |
15036 | /* Clear out DECL_RTL; whatever was there before may not be right |
15037 | since we've reset the type of the declaration. */ | |
15038 | SET_DECL_RTL (d, NULL_RTX); | |
5566b478 | 15039 | DECL_IN_AGGR_P (d) = 0; |
ea56c40c | 15040 | |
e92fb501 MM |
15041 | /* The initializer is placed in DECL_INITIAL by |
15042 | regenerate_decl_from_template. Pull it out so that | |
15043 | finish_decl can process it. */ | |
15044 | init = DECL_INITIAL (d); | |
15045 | DECL_INITIAL (d) = NULL_TREE; | |
15046 | DECL_INITIALIZED_P (d) = 0; | |
15047 | ||
4684cd27 MM |
15048 | /* Clear DECL_EXTERNAL so that cp_finish_decl will process the |
15049 | initializer. That function will defer actual emission until | |
15050 | we have a chance to determine linkage. */ | |
15051 | DECL_EXTERNAL (d) = 0; | |
15052 | ||
73a8adb6 | 15053 | /* Enter the scope of D so that access-checking works correctly. */ |
4684cd27 | 15054 | push_nested_class (DECL_CONTEXT (d)); |
e92fb501 | 15055 | finish_decl (d, init, NULL_TREE); |
73a8adb6 | 15056 | pop_nested_class (); |
5566b478 MS |
15057 | } |
15058 | else if (TREE_CODE (d) == FUNCTION_DECL) | |
15059 | { | |
6bbf1598 | 15060 | htab_t saved_local_specializations; |
a723baf1 MM |
15061 | tree subst_decl; |
15062 | tree tmpl_parm; | |
15063 | tree spec_parm; | |
6bbf1598 MM |
15064 | |
15065 | /* Save away the current list, in case we are instantiating one | |
15066 | template from within the body of another. */ | |
15067 | saved_local_specializations = local_specializations; | |
15068 | ||
6dfbb909 | 15069 | /* Set up the list of local specializations. */ |
c8094d83 | 15070 | local_specializations = htab_create (37, |
69f794a7 | 15071 | hash_local_specialization, |
a723baf1 | 15072 | eq_local_specializations, |
6dfbb909 MM |
15073 | NULL); |
15074 | ||
558475f0 | 15075 | /* Set up context. */ |
058b15c1 | 15076 | start_preparsed_function (d, NULL_TREE, SF_PRE_PARSED); |
5566b478 | 15077 | |
a723baf1 MM |
15078 | /* Create substitution entries for the parameters. */ |
15079 | subst_decl = DECL_TEMPLATE_RESULT (template_for_substitution (d)); | |
15080 | tmpl_parm = DECL_ARGUMENTS (subst_decl); | |
15081 | spec_parm = DECL_ARGUMENTS (d); | |
15082 | if (DECL_NONSTATIC_MEMBER_FUNCTION_P (d)) | |
15083 | { | |
15084 | register_local_specialization (spec_parm, tmpl_parm); | |
15085 | spec_parm = skip_artificial_parms_for (d, spec_parm); | |
15086 | tmpl_parm = skip_artificial_parms_for (subst_decl, tmpl_parm); | |
15087 | } | |
5d80a306 | 15088 | while (tmpl_parm && !FUNCTION_PARAMETER_PACK_P (tmpl_parm)) |
a723baf1 MM |
15089 | { |
15090 | register_local_specialization (spec_parm, tmpl_parm); | |
15091 | tmpl_parm = TREE_CHAIN (tmpl_parm); | |
15092 | spec_parm = TREE_CHAIN (spec_parm); | |
15093 | } | |
5d80a306 DG |
15094 | if (tmpl_parm && FUNCTION_PARAMETER_PACK_P (tmpl_parm)) |
15095 | { | |
15096 | /* Collect all of the extra "packed" parameters into an | |
15097 | argument pack. */ | |
15098 | tree parmvec; | |
15099 | tree parmtypevec; | |
15100 | tree argpack = make_node (NONTYPE_ARGUMENT_PACK); | |
15101 | tree argtypepack = make_node (TYPE_ARGUMENT_PACK); | |
15102 | int i, len = 0; | |
15103 | tree t; | |
15104 | ||
15105 | /* Count how many parameters remain. */ | |
15106 | for (t = spec_parm; t; t = TREE_CHAIN (t)) | |
15107 | len++; | |
15108 | ||
15109 | /* Fill in PARMVEC and PARMTYPEVEC with all of the parameters. */ | |
15110 | parmvec = make_tree_vec (len); | |
15111 | parmtypevec = make_tree_vec (len); | |
15112 | for(i = 0; i < len; i++, spec_parm = TREE_CHAIN (spec_parm)) | |
15113 | { | |
15114 | TREE_VEC_ELT (parmvec, i) = spec_parm; | |
15115 | TREE_VEC_ELT (parmtypevec, i) = TREE_TYPE (spec_parm); | |
15116 | } | |
15117 | ||
15118 | /* Build the argument packs. */ | |
15119 | SET_ARGUMENT_PACK_ARGS (argpack, parmvec); | |
15120 | SET_ARGUMENT_PACK_ARGS (argtypepack, parmtypevec); | |
15121 | TREE_TYPE (argpack) = argtypepack; | |
15122 | ||
15123 | /* Register the (value) argument pack as a specialization of | |
15124 | TMPL_PARM, then move on. */ | |
15125 | register_local_specialization (argpack, tmpl_parm); | |
15126 | tmpl_parm = TREE_CHAIN (tmpl_parm); | |
15127 | } | |
50bc768d | 15128 | gcc_assert (!spec_parm); |
a723baf1 | 15129 | |
558475f0 MM |
15130 | /* Substitute into the body of the function. */ |
15131 | tsubst_expr (DECL_SAVED_TREE (code_pattern), args, | |
015c2c66 MM |
15132 | tf_warning_or_error, tmpl, |
15133 | /*integral_constant_expression_p=*/false); | |
558475f0 | 15134 | |
75407da3 SP |
15135 | /* Set the current input_location to the end of the function |
15136 | so that finish_function knows where we are. */ | |
15137 | input_location = DECL_STRUCT_FUNCTION (code_pattern)->function_end_locus; | |
15138 | ||
6dfbb909 MM |
15139 | /* We don't need the local specializations any more. */ |
15140 | htab_delete (local_specializations); | |
6bbf1598 | 15141 | local_specializations = saved_local_specializations; |
6dfbb909 | 15142 | |
4d6abc1c | 15143 | /* Finish the function. */ |
b2dd096b | 15144 | d = finish_function (0); |
8cd2462c | 15145 | expand_or_defer_fn (d); |
5566b478 MS |
15146 | } |
15147 | ||
971cbc14 MM |
15148 | /* We're not deferring instantiation any more. */ |
15149 | TI_PENDING_TEMPLATE_FLAG (DECL_TEMPLATE_INFO (d)) = 0; | |
15150 | ||
31a714f6 MM |
15151 | if (need_push) |
15152 | pop_from_top_level (); | |
414ea4aa | 15153 | |
de22184b | 15154 | out: |
82a98427 | 15155 | input_location = saved_loc; |
912291ca | 15156 | in_system_header = saved_in_system_header; |
7d021397 | 15157 | pop_deferring_access_checks (); |
5566b478 | 15158 | pop_tinst_level (); |
a28e3c7f | 15159 | |
297a5329 JM |
15160 | timevar_pop (TV_PARSE); |
15161 | ||
a28e3c7f MS |
15162 | return d; |
15163 | } | |
5566b478 | 15164 | |
0aafb128 | 15165 | /* Run through the list of templates that we wish we could |
35046a54 KL |
15166 | instantiate, and instantiate any we can. RETRIES is the |
15167 | number of times we retry pending template instantiation. */ | |
0aafb128 | 15168 | |
35046a54 KL |
15169 | void |
15170 | instantiate_pending_templates (int retries) | |
0aafb128 | 15171 | { |
0aafb128 | 15172 | int reconsider; |
aad626f7 | 15173 | location_t saved_loc = input_location; |
12af7ba3 | 15174 | int saved_in_system_header = in_system_header; |
35046a54 KL |
15175 | |
15176 | /* Instantiating templates may trigger vtable generation. This in turn | |
15177 | may require further template instantiations. We place a limit here | |
15178 | to avoid infinite loop. */ | |
15179 | if (pending_templates && retries >= max_tinst_depth) | |
15180 | { | |
e2c3721c | 15181 | tree decl = pending_templates->tinst->decl; |
96c993a8 | 15182 | |
dee15844 | 15183 | error ("template instantiation depth exceeds maximum of %d" |
96c993a8 JM |
15184 | " instantiating %q+D, possibly from virtual table generation" |
15185 | " (use -ftemplate-depth-NN to increase the maximum)", | |
15186 | max_tinst_depth, decl); | |
15187 | if (TREE_CODE (decl) == FUNCTION_DECL) | |
15188 | /* Pretend that we defined it. */ | |
15189 | DECL_INITIAL (decl) = error_mark_node; | |
35046a54 KL |
15190 | return; |
15191 | } | |
15192 | ||
c8094d83 | 15193 | do |
0aafb128 | 15194 | { |
e2c3721c PB |
15195 | struct pending_template **t = &pending_templates; |
15196 | struct pending_template *last = NULL; | |
0aafb128 | 15197 | reconsider = 0; |
0aafb128 MM |
15198 | while (*t) |
15199 | { | |
e2c3721c PB |
15200 | tree instantiation = reopen_tinst_level ((*t)->tinst); |
15201 | bool complete = false; | |
0aafb128 | 15202 | |
2f939d94 | 15203 | if (TYPE_P (instantiation)) |
0aafb128 MM |
15204 | { |
15205 | tree fn; | |
15206 | ||
d0f062fb | 15207 | if (!COMPLETE_TYPE_P (instantiation)) |
0aafb128 MM |
15208 | { |
15209 | instantiate_class_template (instantiation); | |
15210 | if (CLASSTYPE_TEMPLATE_INSTANTIATION (instantiation)) | |
c8094d83 | 15211 | for (fn = TYPE_METHODS (instantiation); |
0aafb128 MM |
15212 | fn; |
15213 | fn = TREE_CHAIN (fn)) | |
15214 | if (! DECL_ARTIFICIAL (fn)) | |
3db45ab5 | 15215 | instantiate_decl (fn, |
eba839f9 MM |
15216 | /*defer_ok=*/0, |
15217 | /*expl_inst_class_mem_p=*/false); | |
d0f062fb | 15218 | if (COMPLETE_TYPE_P (instantiation)) |
35046a54 | 15219 | reconsider = 1; |
0aafb128 MM |
15220 | } |
15221 | ||
e2c3721c | 15222 | complete = COMPLETE_TYPE_P (instantiation); |
0aafb128 MM |
15223 | } |
15224 | else | |
15225 | { | |
16d53b64 | 15226 | if (!DECL_TEMPLATE_SPECIALIZATION (instantiation) |
0aafb128 MM |
15227 | && !DECL_TEMPLATE_INSTANTIATED (instantiation)) |
15228 | { | |
3db45ab5 | 15229 | instantiation |
eba839f9 MM |
15230 | = instantiate_decl (instantiation, |
15231 | /*defer_ok=*/0, | |
15232 | /*expl_inst_class_mem_p=*/false); | |
0aafb128 | 15233 | if (DECL_TEMPLATE_INSTANTIATED (instantiation)) |
35046a54 | 15234 | reconsider = 1; |
0aafb128 MM |
15235 | } |
15236 | ||
e2c3721c PB |
15237 | complete = (DECL_TEMPLATE_SPECIALIZATION (instantiation) |
15238 | || DECL_TEMPLATE_INSTANTIATED (instantiation)); | |
15239 | } | |
15240 | ||
15241 | if (complete) | |
15242 | /* If INSTANTIATION has been instantiated, then we don't | |
15243 | need to consider it again in the future. */ | |
15244 | *t = (*t)->next; | |
15245 | else | |
15246 | { | |
15247 | last = *t; | |
15248 | t = &(*t)->next; | |
0aafb128 | 15249 | } |
84e5ca0f | 15250 | tinst_depth = 0; |
e2c3721c | 15251 | current_tinst_level = NULL; |
0aafb128 | 15252 | } |
46ccf50a | 15253 | last_pending_template = last; |
c8094d83 | 15254 | } |
0aafb128 MM |
15255 | while (reconsider); |
15256 | ||
aad626f7 | 15257 | input_location = saved_loc; |
12af7ba3 | 15258 | in_system_header = saved_in_system_header; |
0aafb128 MM |
15259 | } |
15260 | ||
fd74ca0b MM |
15261 | /* Substitute ARGVEC into T, which is a list of initializers for |
15262 | either base class or a non-static data member. The TREE_PURPOSEs | |
15263 | are DECLs, and the TREE_VALUEs are the initializer values. Used by | |
15264 | instantiate_decl. */ | |
4393e105 | 15265 | |
824b9a4c | 15266 | static tree |
3a978d72 | 15267 | tsubst_initializer_list (tree t, tree argvec) |
5566b478 | 15268 | { |
2282d28d | 15269 | tree inits = NULL_TREE; |
5566b478 MS |
15270 | |
15271 | for (; t; t = TREE_CHAIN (t)) | |
15272 | { | |
fd74ca0b MM |
15273 | tree decl; |
15274 | tree init; | |
5d80a306 DG |
15275 | tree expanded_bases = NULL_TREE; |
15276 | tree expanded_arguments = NULL_TREE; | |
15277 | int i, len = 1; | |
fd74ca0b | 15278 | |
5d80a306 DG |
15279 | if (TREE_CODE (TREE_PURPOSE (t)) == TYPE_PACK_EXPANSION) |
15280 | { | |
15281 | tree expr; | |
15282 | tree arg; | |
15283 | ||
15284 | /* Expand the base class expansion type into separate base | |
15285 | classes. */ | |
15286 | expanded_bases = tsubst_pack_expansion (TREE_PURPOSE (t), argvec, | |
15287 | tf_warning_or_error, | |
15288 | NULL_TREE); | |
15289 | if (expanded_bases == error_mark_node) | |
15290 | continue; | |
15291 | ||
15292 | /* We'll be building separate TREE_LISTs of arguments for | |
15293 | each base. */ | |
15294 | len = TREE_VEC_LENGTH (expanded_bases); | |
15295 | expanded_arguments = make_tree_vec (len); | |
15296 | for (i = 0; i < len; i++) | |
15297 | TREE_VEC_ELT (expanded_arguments, i) = NULL_TREE; | |
15298 | ||
15299 | /* Build a dummy EXPR_PACK_EXPANSION that will be used to | |
15300 | expand each argument in the TREE_VALUE of t. */ | |
15301 | expr = make_node (EXPR_PACK_EXPANSION); | |
15302 | PACK_EXPANSION_PARAMETER_PACKS (expr) = | |
15303 | PACK_EXPANSION_PARAMETER_PACKS (TREE_PURPOSE (t)); | |
15304 | ||
625b6d91 DG |
15305 | if (TREE_VALUE (t) == void_type_node) |
15306 | /* VOID_TYPE_NODE is used to indicate | |
15307 | value-initialization. */ | |
15308 | { | |
15309 | for (i = 0; i < len; i++) | |
15310 | TREE_VEC_ELT (expanded_arguments, i) = void_type_node; | |
15311 | } | |
15312 | else | |
15313 | { | |
15314 | /* Substitute parameter packs into each argument in the | |
15315 | TREE_LIST. */ | |
15316 | in_base_initializer = 1; | |
15317 | for (arg = TREE_VALUE (t); arg; arg = TREE_CHAIN (arg)) | |
15318 | { | |
15319 | tree expanded_exprs; | |
15320 | ||
15321 | /* Expand the argument. */ | |
15322 | SET_PACK_EXPANSION_PATTERN (expr, TREE_VALUE (arg)); | |
15323 | expanded_exprs | |
15324 | = tsubst_pack_expansion (expr, argvec, | |
15325 | tf_warning_or_error, | |
15326 | NULL_TREE); | |
15327 | ||
15328 | /* Prepend each of the expanded expressions to the | |
15329 | corresponding TREE_LIST in EXPANDED_ARGUMENTS. */ | |
15330 | for (i = 0; i < len; i++) | |
15331 | { | |
15332 | TREE_VEC_ELT (expanded_arguments, i) = | |
15333 | tree_cons (NULL_TREE, | |
15334 | TREE_VEC_ELT (expanded_exprs, i), | |
15335 | TREE_VEC_ELT (expanded_arguments, i)); | |
15336 | } | |
15337 | } | |
15338 | in_base_initializer = 0; | |
5d80a306 | 15339 | |
625b6d91 DG |
15340 | /* Reverse all of the TREE_LISTs in EXPANDED_ARGUMENTS, |
15341 | since we built them backwards. */ | |
15342 | for (i = 0; i < len; i++) | |
15343 | { | |
15344 | TREE_VEC_ELT (expanded_arguments, i) = | |
15345 | nreverse (TREE_VEC_ELT (expanded_arguments, i)); | |
15346 | } | |
15347 | } | |
5d80a306 | 15348 | } |
1f5a253a | 15349 | |
5d80a306 DG |
15350 | for (i = 0; i < len; ++i) |
15351 | { | |
15352 | if (expanded_bases) | |
15353 | { | |
15354 | decl = TREE_VEC_ELT (expanded_bases, i); | |
15355 | decl = expand_member_init (decl); | |
15356 | init = TREE_VEC_ELT (expanded_arguments, i); | |
15357 | } | |
15358 | else | |
15359 | { | |
15360 | decl = tsubst_copy (TREE_PURPOSE (t), argvec, | |
15361 | tf_warning_or_error, NULL_TREE); | |
15362 | ||
15363 | decl = expand_member_init (decl); | |
15364 | if (decl && !DECL_P (decl)) | |
15365 | in_base_initializer = 1; | |
15366 | ||
15367 | init = tsubst_expr (TREE_VALUE (t), argvec, | |
15368 | tf_warning_or_error, NULL_TREE, | |
15369 | /*integral_constant_expression_p=*/false); | |
15370 | in_base_initializer = 0; | |
15371 | } | |
15372 | ||
15373 | if (decl) | |
15374 | { | |
15375 | init = build_tree_list (decl, init); | |
15376 | TREE_CHAIN (init) = inits; | |
15377 | inits = init; | |
15378 | } | |
15379 | } | |
5566b478 | 15380 | } |
2282d28d | 15381 | return inits; |
5566b478 MS |
15382 | } |
15383 | ||
61a127b3 MM |
15384 | /* Set CURRENT_ACCESS_SPECIFIER based on the protection of DECL. */ |
15385 | ||
15386 | static void | |
3a978d72 | 15387 | set_current_access_from_decl (tree decl) |
61a127b3 MM |
15388 | { |
15389 | if (TREE_PRIVATE (decl)) | |
15390 | current_access_specifier = access_private_node; | |
15391 | else if (TREE_PROTECTED (decl)) | |
15392 | current_access_specifier = access_protected_node; | |
15393 | else | |
15394 | current_access_specifier = access_public_node; | |
15395 | } | |
15396 | ||
dbfe2124 MM |
15397 | /* Instantiate an enumerated type. TAG is the template type, NEWTAG |
15398 | is the instantiation (which should have been created with | |
15399 | start_enum) and ARGS are the template arguments to use. */ | |
b87692e5 | 15400 | |
dbfe2124 | 15401 | static void |
3a978d72 | 15402 | tsubst_enum (tree tag, tree newtag, tree args) |
b87692e5 | 15403 | { |
dbfe2124 | 15404 | tree e; |
b87692e5 MS |
15405 | |
15406 | for (e = TYPE_VALUES (tag); e; e = TREE_CHAIN (e)) | |
15407 | { | |
61a127b3 | 15408 | tree value; |
7b6d72fc MM |
15409 | tree decl; |
15410 | ||
15411 | decl = TREE_VALUE (e); | |
61a127b3 MM |
15412 | /* Note that in a template enum, the TREE_VALUE is the |
15413 | CONST_DECL, not the corresponding INTEGER_CST. */ | |
c8094d83 | 15414 | value = tsubst_expr (DECL_INITIAL (decl), |
015c2c66 MM |
15415 | args, tf_warning_or_error, NULL_TREE, |
15416 | /*integral_constant_expression_p=*/true); | |
61a127b3 MM |
15417 | |
15418 | /* Give this enumeration constant the correct access. */ | |
7b6d72fc | 15419 | set_current_access_from_decl (decl); |
61a127b3 MM |
15420 | |
15421 | /* Actually build the enumerator itself. */ | |
c8094d83 | 15422 | build_enumerator (DECL_NAME (decl), value, newtag); |
dbfe2124 | 15423 | } |
b3d5a58b | 15424 | |
219670f1 | 15425 | finish_enum (newtag); |
f31686a3 RH |
15426 | DECL_SOURCE_LOCATION (TYPE_NAME (newtag)) |
15427 | = DECL_SOURCE_LOCATION (TYPE_NAME (tag)); | |
b87692e5 | 15428 | } |
36a117a5 | 15429 | |
1f6e1acc AS |
15430 | /* DECL is a FUNCTION_DECL that is a template specialization. Return |
15431 | its type -- but without substituting the innermost set of template | |
15432 | arguments. So, innermost set of template parameters will appear in | |
5c74d5b0 | 15433 | the type. */ |
1f6e1acc | 15434 | |
c8094d83 | 15435 | tree |
3a978d72 | 15436 | get_mostly_instantiated_function_type (tree decl) |
1f6e1acc | 15437 | { |
1f6e1acc AS |
15438 | tree fn_type; |
15439 | tree tmpl; | |
15440 | tree targs; | |
15441 | tree tparms; | |
15442 | int parm_depth; | |
15443 | ||
15444 | tmpl = most_general_template (DECL_TI_TEMPLATE (decl)); | |
15445 | targs = DECL_TI_ARGS (decl); | |
15446 | tparms = DECL_TEMPLATE_PARMS (tmpl); | |
15447 | parm_depth = TMPL_PARMS_DEPTH (tparms); | |
15448 | ||
15449 | /* There should be as many levels of arguments as there are levels | |
15450 | of parameters. */ | |
50bc768d | 15451 | gcc_assert (parm_depth == TMPL_ARGS_DEPTH (targs)); |
1f6e1acc AS |
15452 | |
15453 | fn_type = TREE_TYPE (tmpl); | |
1f6e1acc AS |
15454 | |
15455 | if (parm_depth == 1) | |
15456 | /* No substitution is necessary. */ | |
15457 | ; | |
15458 | else | |
15459 | { | |
fae6e246 | 15460 | int i, save_access_control; |
1f6e1acc AS |
15461 | tree partial_args; |
15462 | ||
15463 | /* Replace the innermost level of the TARGS with NULL_TREEs to | |
dc957d14 | 15464 | let tsubst know not to substitute for those parameters. */ |
1f6e1acc AS |
15465 | partial_args = make_tree_vec (TREE_VEC_LENGTH (targs)); |
15466 | for (i = 1; i < TMPL_ARGS_DEPTH (targs); ++i) | |
15467 | SET_TMPL_ARGS_LEVEL (partial_args, i, | |
15468 | TMPL_ARGS_LEVEL (targs, i)); | |
15469 | SET_TMPL_ARGS_LEVEL (partial_args, | |
15470 | TMPL_ARGS_DEPTH (targs), | |
15471 | make_tree_vec (DECL_NTPARMS (tmpl))); | |
15472 | ||
fae6e246 RH |
15473 | /* Disable access control as this function is used only during |
15474 | name-mangling. */ | |
15475 | save_access_control = flag_access_control; | |
15476 | flag_access_control = 0; | |
5c74d5b0 | 15477 | |
9579624e | 15478 | ++processing_template_decl; |
1f6e1acc AS |
15479 | /* Now, do the (partial) substitution to figure out the |
15480 | appropriate function type. */ | |
c2ea3a40 | 15481 | fn_type = tsubst (fn_type, partial_args, tf_error, NULL_TREE); |
9579624e | 15482 | --processing_template_decl; |
1f6e1acc AS |
15483 | |
15484 | /* Substitute into the template parameters to obtain the real | |
15485 | innermost set of parameters. This step is important if the | |
15486 | innermost set of template parameters contains value | |
15487 | parameters whose types depend on outer template parameters. */ | |
15488 | TREE_VEC_LENGTH (partial_args)--; | |
c2ea3a40 | 15489 | tparms = tsubst_template_parms (tparms, partial_args, tf_error); |
1f6e1acc | 15490 | |
fae6e246 | 15491 | flag_access_control = save_access_control; |
5c74d5b0 | 15492 | } |
1f6e1acc AS |
15493 | |
15494 | return fn_type; | |
15495 | } | |
669ec2b4 | 15496 | |
cb753e49 | 15497 | /* Return truthvalue if we're processing a template different from |
dc957d14 | 15498 | the last one involved in diagnostics. */ |
cb753e49 | 15499 | int |
3a978d72 | 15500 | problematic_instantiation_changed (void) |
cb753e49 GDR |
15501 | { |
15502 | return last_template_error_tick != tinst_level_tick; | |
15503 | } | |
15504 | ||
15505 | /* Remember current template involved in diagnostics. */ | |
15506 | void | |
3a978d72 | 15507 | record_last_problematic_instantiation (void) |
cb753e49 GDR |
15508 | { |
15509 | last_template_error_tick = tinst_level_tick; | |
15510 | } | |
15511 | ||
e2c3721c | 15512 | struct tinst_level * |
3a978d72 | 15513 | current_instantiation (void) |
cb753e49 GDR |
15514 | { |
15515 | return current_tinst_level; | |
15516 | } | |
db3f4e4e NS |
15517 | |
15518 | /* [temp.param] Check that template non-type parm TYPE is of an allowable | |
838dfd8a | 15519 | type. Return zero for ok, nonzero for disallowed. Issue error and |
c2ea3a40 | 15520 | warning messages under control of COMPLAIN. */ |
db3f4e4e NS |
15521 | |
15522 | static int | |
3a978d72 | 15523 | invalid_nontype_parm_type_p (tree type, tsubst_flags_t complain) |
db3f4e4e NS |
15524 | { |
15525 | if (INTEGRAL_TYPE_P (type)) | |
15526 | return 0; | |
15527 | else if (POINTER_TYPE_P (type)) | |
15528 | return 0; | |
a5ac359a | 15529 | else if (TYPE_PTR_TO_MEMBER_P (type)) |
db3f4e4e | 15530 | return 0; |
db3f4e4e NS |
15531 | else if (TREE_CODE (type) == TEMPLATE_TYPE_PARM) |
15532 | return 0; | |
15533 | else if (TREE_CODE (type) == TYPENAME_TYPE) | |
15534 | return 0; | |
c8094d83 | 15535 | |
c2ea3a40 | 15536 | if (complain & tf_error) |
0f51ccfc | 15537 | error ("%q#T is not a valid type for a template constant parameter", type); |
db3f4e4e NS |
15538 | return 1; |
15539 | } | |
e2500fed | 15540 | |
5552b43c MM |
15541 | /* Returns TRUE if TYPE is dependent, in the sense of [temp.dep.type]. |
15542 | Assumes that TYPE really is a type, and not the ERROR_MARK_NODE.*/ | |
1fb3244a | 15543 | |
5552b43c MM |
15544 | static bool |
15545 | dependent_type_p_r (tree type) | |
1fb3244a MM |
15546 | { |
15547 | tree scope; | |
15548 | ||
1fb3244a MM |
15549 | /* [temp.dep.type] |
15550 | ||
15551 | A type is dependent if it is: | |
15552 | ||
6615c446 JO |
15553 | -- a template parameter. Template template parameters are types |
15554 | for us (since TYPE_P holds true for them) so we handle | |
15555 | them here. */ | |
c8094d83 | 15556 | if (TREE_CODE (type) == TEMPLATE_TYPE_PARM |
6bf92cb6 | 15557 | || TREE_CODE (type) == TEMPLATE_TEMPLATE_PARM) |
1fb3244a MM |
15558 | return true; |
15559 | /* -- a qualified-id with a nested-name-specifier which contains a | |
0cbd7506 | 15560 | class-name that names a dependent type or whose unqualified-id |
1fb3244a MM |
15561 | names a dependent type. */ |
15562 | if (TREE_CODE (type) == TYPENAME_TYPE) | |
15563 | return true; | |
15564 | /* -- a cv-qualified type where the cv-unqualified type is | |
0cbd7506 | 15565 | dependent. */ |
1fb3244a MM |
15566 | type = TYPE_MAIN_VARIANT (type); |
15567 | /* -- a compound type constructed from any dependent type. */ | |
a5ac359a | 15568 | if (TYPE_PTR_TO_MEMBER_P (type)) |
1fb3244a | 15569 | return (dependent_type_p (TYPE_PTRMEM_CLASS_TYPE (type)) |
c8094d83 | 15570 | || dependent_type_p (TYPE_PTRMEM_POINTED_TO_TYPE |
1fb3244a MM |
15571 | (type))); |
15572 | else if (TREE_CODE (type) == POINTER_TYPE | |
15573 | || TREE_CODE (type) == REFERENCE_TYPE) | |
15574 | return dependent_type_p (TREE_TYPE (type)); | |
15575 | else if (TREE_CODE (type) == FUNCTION_TYPE | |
15576 | || TREE_CODE (type) == METHOD_TYPE) | |
15577 | { | |
15578 | tree arg_type; | |
15579 | ||
15580 | if (dependent_type_p (TREE_TYPE (type))) | |
15581 | return true; | |
c8094d83 MS |
15582 | for (arg_type = TYPE_ARG_TYPES (type); |
15583 | arg_type; | |
1fb3244a MM |
15584 | arg_type = TREE_CHAIN (arg_type)) |
15585 | if (dependent_type_p (TREE_VALUE (arg_type))) | |
15586 | return true; | |
15587 | return false; | |
15588 | } | |
15589 | /* -- an array type constructed from any dependent type or whose | |
0cbd7506 | 15590 | size is specified by a constant expression that is |
1fb3244a MM |
15591 | value-dependent. */ |
15592 | if (TREE_CODE (type) == ARRAY_TYPE) | |
15593 | { | |
15594 | if (TYPE_DOMAIN (type) | |
82390eb6 | 15595 | && dependent_type_p (TYPE_DOMAIN (type))) |
1fb3244a MM |
15596 | return true; |
15597 | return dependent_type_p (TREE_TYPE (type)); | |
15598 | } | |
82390eb6 JM |
15599 | else if (TREE_CODE (type) == INTEGER_TYPE |
15600 | && !TREE_CONSTANT (TYPE_MAX_VALUE (type))) | |
15601 | { | |
15602 | /* If this is the TYPE_DOMAIN of an array type, consider it | |
15603 | dependent. */ | |
15604 | return (value_dependent_expression_p (TYPE_MAX_VALUE (type)) | |
15605 | || type_dependent_expression_p (TYPE_MAX_VALUE (type))); | |
15606 | } | |
c8094d83 | 15607 | |
1fb3244a | 15608 | /* -- a template-id in which either the template name is a template |
86306a6b NS |
15609 | parameter ... */ |
15610 | if (TREE_CODE (type) == BOUND_TEMPLATE_TEMPLATE_PARM) | |
1fb3244a | 15611 | return true; |
86306a6b | 15612 | /* ... or any of the template arguments is a dependent type or |
04c06002 | 15613 | an expression that is type-dependent or value-dependent. */ |
86306a6b | 15614 | else if (CLASS_TYPE_P (type) && CLASSTYPE_TEMPLATE_INFO (type) |
c8094d83 | 15615 | && (any_dependent_template_arguments_p |
7e99327d | 15616 | (INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type))))) |
1fb3244a | 15617 | return true; |
c8094d83 | 15618 | |
3ad6a8e1 DG |
15619 | /* All TYPEOF_TYPEs and DECLTYPE_TYPEs are dependent; if the |
15620 | argument of the `typeof' expression is not type-dependent, then | |
15621 | it should already been have resolved. */ | |
15622 | if (TREE_CODE (type) == TYPEOF_TYPE | |
15623 | || TREE_CODE (type) == DECLTYPE_TYPE) | |
1fb3244a | 15624 | return true; |
c8094d83 | 15625 | |
5d80a306 DG |
15626 | /* A template argument pack is dependent if any of its packed |
15627 | arguments are. */ | |
15628 | if (TREE_CODE (type) == TYPE_ARGUMENT_PACK) | |
15629 | { | |
15630 | tree args = ARGUMENT_PACK_ARGS (type); | |
15631 | int i, len = TREE_VEC_LENGTH (args); | |
15632 | for (i = 0; i < len; ++i) | |
15633 | if (dependent_template_arg_p (TREE_VEC_ELT (args, i))) | |
15634 | return true; | |
15635 | } | |
15636 | ||
15637 | /* All TYPE_PACK_EXPANSIONs are dependent, because parameter packs must | |
15638 | be template parameters. */ | |
15639 | if (TREE_CODE (type) == TYPE_PACK_EXPANSION) | |
15640 | return true; | |
15641 | ||
1fb3244a MM |
15642 | /* The standard does not specifically mention types that are local |
15643 | to template functions or local classes, but they should be | |
15644 | considered dependent too. For example: | |
15645 | ||
c8094d83 | 15646 | template <int I> void f() { |
0cbd7506 | 15647 | enum E { a = I }; |
1fb3244a MM |
15648 | S<sizeof (E)> s; |
15649 | } | |
15650 | ||
15651 | The size of `E' cannot be known until the value of `I' has been | |
15652 | determined. Therefore, `E' must be considered dependent. */ | |
15653 | scope = TYPE_CONTEXT (type); | |
15654 | if (scope && TYPE_P (scope)) | |
15655 | return dependent_type_p (scope); | |
15656 | else if (scope && TREE_CODE (scope) == FUNCTION_DECL) | |
15657 | return type_dependent_expression_p (scope); | |
15658 | ||
15659 | /* Other types are non-dependent. */ | |
15660 | return false; | |
15661 | } | |
15662 | ||
5552b43c MM |
15663 | /* Returns TRUE if TYPE is dependent, in the sense of |
15664 | [temp.dep.type]. */ | |
15665 | ||
15666 | bool | |
15667 | dependent_type_p (tree type) | |
15668 | { | |
15669 | /* If there are no template parameters in scope, then there can't be | |
15670 | any dependent types. */ | |
15671 | if (!processing_template_decl) | |
e7e93965 MM |
15672 | { |
15673 | /* If we are not processing a template, then nobody should be | |
15674 | providing us with a dependent type. */ | |
15675 | gcc_assert (type); | |
15676 | gcc_assert (TREE_CODE (type) != TEMPLATE_TYPE_PARM); | |
15677 | return false; | |
15678 | } | |
5552b43c MM |
15679 | |
15680 | /* If the type is NULL, we have not computed a type for the entity | |
15681 | in question; in that case, the type is dependent. */ | |
15682 | if (!type) | |
15683 | return true; | |
15684 | ||
15685 | /* Erroneous types can be considered non-dependent. */ | |
15686 | if (type == error_mark_node) | |
15687 | return false; | |
15688 | ||
15689 | /* If we have not already computed the appropriate value for TYPE, | |
15690 | do so now. */ | |
15691 | if (!TYPE_DEPENDENT_P_VALID (type)) | |
15692 | { | |
15693 | TYPE_DEPENDENT_P (type) = dependent_type_p_r (type); | |
15694 | TYPE_DEPENDENT_P_VALID (type) = 1; | |
15695 | } | |
15696 | ||
15697 | return TYPE_DEPENDENT_P (type); | |
15698 | } | |
15699 | ||
8d83f792 MM |
15700 | /* Returns TRUE if EXPRESSION is dependent, according to CRITERION. */ |
15701 | ||
15702 | static bool | |
15703 | dependent_scope_ref_p (tree expression, bool criterion (tree)) | |
15704 | { | |
15705 | tree scope; | |
15706 | tree name; | |
15707 | ||
50bc768d | 15708 | gcc_assert (TREE_CODE (expression) == SCOPE_REF); |
8d83f792 MM |
15709 | |
15710 | if (!TYPE_P (TREE_OPERAND (expression, 0))) | |
15711 | return true; | |
15712 | ||
15713 | scope = TREE_OPERAND (expression, 0); | |
15714 | name = TREE_OPERAND (expression, 1); | |
15715 | ||
15716 | /* [temp.dep.expr] | |
15717 | ||
15718 | An id-expression is type-dependent if it contains a | |
15719 | nested-name-specifier that contains a class-name that names a | |
15720 | dependent type. */ | |
15721 | /* The suggested resolution to Core Issue 2 implies that if the | |
15722 | qualifying type is the current class, then we must peek | |
15723 | inside it. */ | |
c8094d83 | 15724 | if (DECL_P (name) |
8d83f792 MM |
15725 | && currently_open_class (scope) |
15726 | && !criterion (name)) | |
15727 | return false; | |
15728 | if (dependent_type_p (scope)) | |
15729 | return true; | |
15730 | ||
15731 | return false; | |
15732 | } | |
15733 | ||
20929c7f | 15734 | /* Returns TRUE if the EXPRESSION is value-dependent, in the sense of |
fe89d797 MM |
15735 | [temp.dep.constexpr]. EXPRESSION is already known to be a constant |
15736 | expression. */ | |
1fb3244a | 15737 | |
14d22dd6 | 15738 | bool |
1fb3244a MM |
15739 | value_dependent_expression_p (tree expression) |
15740 | { | |
15741 | if (!processing_template_decl) | |
15742 | return false; | |
15743 | ||
15744 | /* A name declared with a dependent type. */ | |
7416ab02 | 15745 | if (DECL_P (expression) && type_dependent_expression_p (expression)) |
1fb3244a | 15746 | return true; |
c8094d83 | 15747 | |
7416ab02 NS |
15748 | switch (TREE_CODE (expression)) |
15749 | { | |
15750 | case IDENTIFIER_NODE: | |
15751 | /* A name that has not been looked up -- must be dependent. */ | |
15752 | return true; | |
15753 | ||
15754 | case TEMPLATE_PARM_INDEX: | |
15755 | /* A non-type template parm. */ | |
15756 | return true; | |
15757 | ||
15758 | case CONST_DECL: | |
15759 | /* A non-type template parm. */ | |
15760 | if (DECL_TEMPLATE_PARM_P (expression)) | |
d17811fd | 15761 | return true; |
3387721b | 15762 | return value_dependent_expression_p (DECL_INITIAL (expression)); |
d36d5600 | 15763 | |
7416ab02 | 15764 | case VAR_DECL: |
c8094d83 | 15765 | /* A constant with integral or enumeration type and is initialized |
0cbd7506 | 15766 | with an expression that is value-dependent. */ |
7416ab02 NS |
15767 | if (DECL_INITIAL (expression) |
15768 | && INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (expression)) | |
15769 | && value_dependent_expression_p (DECL_INITIAL (expression))) | |
15770 | return true; | |
15771 | return false; | |
15772 | ||
15773 | case DYNAMIC_CAST_EXPR: | |
15774 | case STATIC_CAST_EXPR: | |
15775 | case CONST_CAST_EXPR: | |
15776 | case REINTERPRET_CAST_EXPR: | |
15777 | case CAST_EXPR: | |
15778 | /* These expressions are value-dependent if the type to which | |
0cbd7506 MS |
15779 | the cast occurs is dependent or the expression being casted |
15780 | is value-dependent. */ | |
7416ab02 NS |
15781 | { |
15782 | tree type = TREE_TYPE (expression); | |
c8094d83 | 15783 | |
7416ab02 NS |
15784 | if (dependent_type_p (type)) |
15785 | return true; | |
c8094d83 | 15786 | |
7416ab02 NS |
15787 | /* A functional cast has a list of operands. */ |
15788 | expression = TREE_OPERAND (expression, 0); | |
15789 | if (!expression) | |
15790 | { | |
15791 | /* If there are no operands, it must be an expression such | |
15792 | as "int()". This should not happen for aggregate types | |
15793 | because it would form non-constant expressions. */ | |
15794 | gcc_assert (INTEGRAL_OR_ENUMERATION_TYPE_P (type)); | |
c8094d83 | 15795 | |
7416ab02 NS |
15796 | return false; |
15797 | } | |
c8094d83 | 15798 | |
7416ab02 | 15799 | if (TREE_CODE (expression) == TREE_LIST) |
32a11c08 | 15800 | return any_value_dependent_elements_p (expression); |
c8094d83 | 15801 | |
d17811fd | 15802 | return value_dependent_expression_p (expression); |
7416ab02 | 15803 | } |
c8094d83 | 15804 | |
7416ab02 NS |
15805 | case SIZEOF_EXPR: |
15806 | case ALIGNOF_EXPR: | |
15807 | /* A `sizeof' expression is value-dependent if the operand is | |
5d80a306 | 15808 | type-dependent or is a pack expansion. */ |
d17811fd | 15809 | expression = TREE_OPERAND (expression, 0); |
5d80a306 DG |
15810 | if (PACK_EXPANSION_P (expression)) |
15811 | return true; | |
15812 | else if (TYPE_P (expression)) | |
d17811fd MM |
15813 | return dependent_type_p (expression); |
15814 | return type_dependent_expression_p (expression); | |
100d337a | 15815 | |
7416ab02 NS |
15816 | case SCOPE_REF: |
15817 | return dependent_scope_ref_p (expression, value_dependent_expression_p); | |
100d337a | 15818 | |
7416ab02 NS |
15819 | case COMPONENT_REF: |
15820 | return (value_dependent_expression_p (TREE_OPERAND (expression, 0)) | |
15821 | || value_dependent_expression_p (TREE_OPERAND (expression, 1))); | |
15822 | ||
15823 | case CALL_EXPR: | |
fe89d797 MM |
15824 | /* A CALL_EXPR may appear in a constant expression if it is a |
15825 | call to a builtin function, e.g., __builtin_constant_p. All | |
15826 | such calls are value-dependent. */ | |
15827 | return true; | |
7416ab02 | 15828 | |
5d80a306 DG |
15829 | case NONTYPE_ARGUMENT_PACK: |
15830 | /* A NONTYPE_ARGUMENT_PACK is value-dependent if any packed argument | |
15831 | is value-dependent. */ | |
15832 | { | |
15833 | tree values = ARGUMENT_PACK_ARGS (expression); | |
15834 | int i, len = TREE_VEC_LENGTH (values); | |
15835 | ||
15836 | for (i = 0; i < len; ++i) | |
15837 | if (value_dependent_expression_p (TREE_VEC_ELT (values, i))) | |
15838 | return true; | |
15839 | ||
15840 | return false; | |
15841 | } | |
15842 | ||
cb68ec50 PC |
15843 | case TRAIT_EXPR: |
15844 | { | |
15845 | tree type2 = TRAIT_EXPR_TYPE2 (expression); | |
15846 | return (dependent_type_p (TRAIT_EXPR_TYPE1 (expression)) | |
15847 | || (type2 ? dependent_type_p (type2) : false)); | |
15848 | } | |
15849 | ||
f01ec37d SM |
15850 | case MODOP_EXPR: |
15851 | return ((value_dependent_expression_p (TREE_OPERAND (expression, 0))) | |
15852 | || (value_dependent_expression_p (TREE_OPERAND (expression, 2)))); | |
15853 | ||
7416ab02 NS |
15854 | default: |
15855 | /* A constant expression is value-dependent if any subexpression is | |
0cbd7506 | 15856 | value-dependent. */ |
1fb3244a MM |
15857 | switch (TREE_CODE_CLASS (TREE_CODE (expression))) |
15858 | { | |
7416ab02 | 15859 | case tcc_reference: |
6615c446 | 15860 | case tcc_unary: |
c8094d83 | 15861 | return (value_dependent_expression_p |
1fb3244a | 15862 | (TREE_OPERAND (expression, 0))); |
c8094d83 | 15863 | |
6615c446 JO |
15864 | case tcc_comparison: |
15865 | case tcc_binary: | |
c8094d83 | 15866 | return ((value_dependent_expression_p |
1fb3244a | 15867 | (TREE_OPERAND (expression, 0))) |
c8094d83 | 15868 | || (value_dependent_expression_p |
1fb3244a | 15869 | (TREE_OPERAND (expression, 1)))); |
c8094d83 | 15870 | |
6615c446 | 15871 | case tcc_expression: |
5039610b | 15872 | case tcc_vl_exp: |
1fb3244a MM |
15873 | { |
15874 | int i; | |
5039610b | 15875 | for (i = 0; i < TREE_OPERAND_LENGTH (expression); ++i) |
14d22dd6 MM |
15876 | /* In some cases, some of the operands may be missing. |
15877 | (For example, in the case of PREDECREMENT_EXPR, the | |
15878 | amount to increment by may be missing.) That doesn't | |
15879 | make the expression dependent. */ | |
15880 | if (TREE_OPERAND (expression, i) | |
15881 | && (value_dependent_expression_p | |
15882 | (TREE_OPERAND (expression, i)))) | |
1fb3244a MM |
15883 | return true; |
15884 | return false; | |
15885 | } | |
c8094d83 | 15886 | |
6615c446 | 15887 | default: |
7416ab02 | 15888 | break; |
1fb3244a MM |
15889 | } |
15890 | } | |
c8094d83 | 15891 | |
1fb3244a MM |
15892 | /* The expression is not value-dependent. */ |
15893 | return false; | |
15894 | } | |
15895 | ||
15896 | /* Returns TRUE if the EXPRESSION is type-dependent, in the sense of | |
15897 | [temp.dep.expr]. */ | |
15898 | ||
15899 | bool | |
3a978d72 | 15900 | type_dependent_expression_p (tree expression) |
1fb3244a MM |
15901 | { |
15902 | if (!processing_template_decl) | |
15903 | return false; | |
15904 | ||
7efa3e22 NS |
15905 | if (expression == error_mark_node) |
15906 | return false; | |
10b1d5e7 MM |
15907 | |
15908 | /* An unresolved name is always dependent. */ | |
b01e6d2b JM |
15909 | if (TREE_CODE (expression) == IDENTIFIER_NODE |
15910 | || TREE_CODE (expression) == USING_DECL) | |
10b1d5e7 | 15911 | return true; |
c8094d83 | 15912 | |
1fb3244a MM |
15913 | /* Some expression forms are never type-dependent. */ |
15914 | if (TREE_CODE (expression) == PSEUDO_DTOR_EXPR | |
15915 | || TREE_CODE (expression) == SIZEOF_EXPR | |
15916 | || TREE_CODE (expression) == ALIGNOF_EXPR | |
cb68ec50 | 15917 | || TREE_CODE (expression) == TRAIT_EXPR |
1fb3244a MM |
15918 | || TREE_CODE (expression) == TYPEID_EXPR |
15919 | || TREE_CODE (expression) == DELETE_EXPR | |
15920 | || TREE_CODE (expression) == VEC_DELETE_EXPR | |
15921 | || TREE_CODE (expression) == THROW_EXPR) | |
15922 | return false; | |
15923 | ||
15924 | /* The types of these expressions depends only on the type to which | |
15925 | the cast occurs. */ | |
15926 | if (TREE_CODE (expression) == DYNAMIC_CAST_EXPR | |
15927 | || TREE_CODE (expression) == STATIC_CAST_EXPR | |
15928 | || TREE_CODE (expression) == CONST_CAST_EXPR | |
15929 | || TREE_CODE (expression) == REINTERPRET_CAST_EXPR | |
15930 | || TREE_CODE (expression) == CAST_EXPR) | |
15931 | return dependent_type_p (TREE_TYPE (expression)); | |
d17811fd | 15932 | |
1fb3244a MM |
15933 | /* The types of these expressions depends only on the type created |
15934 | by the expression. */ | |
d17811fd MM |
15935 | if (TREE_CODE (expression) == NEW_EXPR |
15936 | || TREE_CODE (expression) == VEC_NEW_EXPR) | |
09d2f85f KL |
15937 | { |
15938 | /* For NEW_EXPR tree nodes created inside a template, either | |
15939 | the object type itself or a TREE_LIST may appear as the | |
15940 | operand 1. */ | |
15941 | tree type = TREE_OPERAND (expression, 1); | |
15942 | if (TREE_CODE (type) == TREE_LIST) | |
15943 | /* This is an array type. We need to check array dimensions | |
15944 | as well. */ | |
15945 | return dependent_type_p (TREE_VALUE (TREE_PURPOSE (type))) | |
15946 | || value_dependent_expression_p | |
15947 | (TREE_OPERAND (TREE_VALUE (type), 1)); | |
15948 | else | |
15949 | return dependent_type_p (type); | |
15950 | } | |
1fb3244a | 15951 | |
5a57f1b2 JM |
15952 | if (TREE_CODE (expression) == SCOPE_REF |
15953 | && dependent_scope_ref_p (expression, | |
15954 | type_dependent_expression_p)) | |
15955 | return true; | |
15956 | ||
15957 | if (TREE_CODE (expression) == FUNCTION_DECL | |
15958 | && DECL_LANG_SPECIFIC (expression) | |
15959 | && DECL_TEMPLATE_INFO (expression) | |
15960 | && (any_dependent_template_arguments_p | |
15961 | (INNERMOST_TEMPLATE_ARGS (DECL_TI_ARGS (expression))))) | |
15962 | return true; | |
15963 | ||
15964 | if (TREE_CODE (expression) == TEMPLATE_DECL | |
15965 | && !DECL_TEMPLATE_TEMPLATE_PARM_P (expression)) | |
15966 | return false; | |
15967 | ||
c2acde1e JM |
15968 | if (TREE_CODE (expression) == STMT_EXPR) |
15969 | expression = stmt_expr_value_expr (expression); | |
15970 | ||
d17811fd MM |
15971 | if (TREE_TYPE (expression) == unknown_type_node) |
15972 | { | |
15973 | if (TREE_CODE (expression) == ADDR_EXPR) | |
15974 | return type_dependent_expression_p (TREE_OPERAND (expression, 0)); | |
c353b8e3 MM |
15975 | if (TREE_CODE (expression) == COMPONENT_REF |
15976 | || TREE_CODE (expression) == OFFSET_REF) | |
6cb89308 NS |
15977 | { |
15978 | if (type_dependent_expression_p (TREE_OPERAND (expression, 0))) | |
15979 | return true; | |
15980 | expression = TREE_OPERAND (expression, 1); | |
15981 | if (TREE_CODE (expression) == IDENTIFIER_NODE) | |
15982 | return false; | |
15983 | } | |
3601f003 KL |
15984 | /* SCOPE_REF with non-null TREE_TYPE is always non-dependent. */ |
15985 | if (TREE_CODE (expression) == SCOPE_REF) | |
15986 | return false; | |
c8094d83 | 15987 | |
d17811fd MM |
15988 | if (TREE_CODE (expression) == BASELINK) |
15989 | expression = BASELINK_FUNCTIONS (expression); | |
c8094d83 | 15990 | |
d17811fd MM |
15991 | if (TREE_CODE (expression) == TEMPLATE_ID_EXPR) |
15992 | { | |
ee3071ef NS |
15993 | if (any_dependent_template_arguments_p |
15994 | (TREE_OPERAND (expression, 1))) | |
d17811fd MM |
15995 | return true; |
15996 | expression = TREE_OPERAND (expression, 0); | |
15997 | } | |
b207d6e2 MM |
15998 | gcc_assert (TREE_CODE (expression) == OVERLOAD |
15999 | || TREE_CODE (expression) == FUNCTION_DECL); | |
c8094d83 | 16000 | |
315fb5db | 16001 | while (expression) |
d17811fd | 16002 | { |
315fb5db NS |
16003 | if (type_dependent_expression_p (OVL_CURRENT (expression))) |
16004 | return true; | |
16005 | expression = OVL_NEXT (expression); | |
d17811fd | 16006 | } |
315fb5db | 16007 | return false; |
d17811fd | 16008 | } |
c8094d83 | 16009 | |
3ce5fa4f | 16010 | gcc_assert (TREE_CODE (expression) != TYPE_DECL); |
3db45ab5 | 16011 | |
1fb3244a MM |
16012 | return (dependent_type_p (TREE_TYPE (expression))); |
16013 | } | |
16014 | ||
d17811fd MM |
16015 | /* Returns TRUE if ARGS (a TREE_LIST of arguments to a function call) |
16016 | contains a type-dependent expression. */ | |
1fb3244a MM |
16017 | |
16018 | bool | |
58f9752a | 16019 | any_type_dependent_arguments_p (const_tree args) |
d17811fd MM |
16020 | { |
16021 | while (args) | |
16022 | { | |
7efa3e22 NS |
16023 | tree arg = TREE_VALUE (args); |
16024 | ||
16025 | if (type_dependent_expression_p (arg)) | |
d17811fd MM |
16026 | return true; |
16027 | args = TREE_CHAIN (args); | |
16028 | } | |
16029 | return false; | |
16030 | } | |
16031 | ||
32a11c08 MM |
16032 | /* Returns TRUE if LIST (a TREE_LIST whose TREE_VALUEs are |
16033 | expressions) contains any value-dependent expressions. */ | |
16034 | ||
16035 | bool | |
58f9752a | 16036 | any_value_dependent_elements_p (const_tree list) |
32a11c08 MM |
16037 | { |
16038 | for (; list; list = TREE_CHAIN (list)) | |
16039 | if (value_dependent_expression_p (TREE_VALUE (list))) | |
16040 | return true; | |
16041 | ||
16042 | return false; | |
16043 | } | |
16044 | ||
d17811fd MM |
16045 | /* Returns TRUE if the ARG (a template argument) is dependent. */ |
16046 | ||
5d80a306 | 16047 | bool |
1fb3244a MM |
16048 | dependent_template_arg_p (tree arg) |
16049 | { | |
16050 | if (!processing_template_decl) | |
16051 | return false; | |
16052 | ||
16053 | if (TREE_CODE (arg) == TEMPLATE_DECL | |
16054 | || TREE_CODE (arg) == TEMPLATE_TEMPLATE_PARM) | |
16055 | return dependent_template_p (arg); | |
5d80a306 DG |
16056 | else if (ARGUMENT_PACK_P (arg)) |
16057 | { | |
16058 | tree args = ARGUMENT_PACK_ARGS (arg); | |
16059 | int i, len = TREE_VEC_LENGTH (args); | |
16060 | for (i = 0; i < len; ++i) | |
16061 | { | |
16062 | if (dependent_template_arg_p (TREE_VEC_ELT (args, i))) | |
16063 | return true; | |
16064 | } | |
16065 | ||
16066 | return false; | |
16067 | } | |
1fb3244a MM |
16068 | else if (TYPE_P (arg)) |
16069 | return dependent_type_p (arg); | |
16070 | else | |
16071 | return (type_dependent_expression_p (arg) | |
16072 | || value_dependent_expression_p (arg)); | |
16073 | } | |
16074 | ||
06d40de8 DG |
16075 | /* Returns true if ARGS (a collection of template arguments) contains |
16076 | any types that require structural equality testing. */ | |
16077 | ||
16078 | bool | |
16079 | any_template_arguments_need_structural_equality_p (tree args) | |
16080 | { | |
16081 | int i; | |
16082 | int j; | |
16083 | ||
16084 | if (!args) | |
16085 | return false; | |
16086 | if (args == error_mark_node) | |
16087 | return true; | |
16088 | ||
16089 | for (i = 0; i < TMPL_ARGS_DEPTH (args); ++i) | |
16090 | { | |
16091 | tree level = TMPL_ARGS_LEVEL (args, i + 1); | |
16092 | for (j = 0; j < TREE_VEC_LENGTH (level); ++j) | |
16093 | { | |
16094 | tree arg = TREE_VEC_ELT (level, j); | |
5d80a306 DG |
16095 | tree packed_args = NULL_TREE; |
16096 | int k, len = 1; | |
16097 | ||
16098 | if (ARGUMENT_PACK_P (arg)) | |
16099 | { | |
16100 | /* Look inside the argument pack. */ | |
16101 | packed_args = ARGUMENT_PACK_ARGS (arg); | |
16102 | len = TREE_VEC_LENGTH (packed_args); | |
16103 | } | |
16104 | ||
16105 | for (k = 0; k < len; ++k) | |
16106 | { | |
16107 | if (packed_args) | |
16108 | arg = TREE_VEC_ELT (packed_args, k); | |
16109 | ||
16110 | if (error_operand_p (arg)) | |
16111 | return true; | |
16112 | else if (TREE_CODE (arg) == TEMPLATE_DECL | |
16113 | || TREE_CODE (arg) == TEMPLATE_TEMPLATE_PARM) | |
16114 | continue; | |
16115 | else if (TYPE_P (arg) && TYPE_STRUCTURAL_EQUALITY_P (arg)) | |
16116 | return true; | |
16117 | else if (!TYPE_P (arg) && TREE_TYPE (arg) | |
16118 | && TYPE_STRUCTURAL_EQUALITY_P (TREE_TYPE (arg))) | |
16119 | return true; | |
16120 | } | |
06d40de8 DG |
16121 | } |
16122 | } | |
16123 | ||
16124 | return false; | |
16125 | } | |
16126 | ||
d17811fd MM |
16127 | /* Returns true if ARGS (a collection of template arguments) contains |
16128 | any dependent arguments. */ | |
1fb3244a | 16129 | |
d17811fd | 16130 | bool |
58f9752a | 16131 | any_dependent_template_arguments_p (const_tree args) |
1fb3244a | 16132 | { |
bf12d54d | 16133 | int i; |
c353b8e3 MM |
16134 | int j; |
16135 | ||
d17811fd MM |
16136 | if (!args) |
16137 | return false; | |
7e497d0c VR |
16138 | if (args == error_mark_node) |
16139 | return true; | |
d17811fd | 16140 | |
c353b8e3 MM |
16141 | for (i = 0; i < TMPL_ARGS_DEPTH (args); ++i) |
16142 | { | |
58f9752a | 16143 | const_tree level = TMPL_ARGS_LEVEL (args, i + 1); |
c353b8e3 MM |
16144 | for (j = 0; j < TREE_VEC_LENGTH (level); ++j) |
16145 | if (dependent_template_arg_p (TREE_VEC_ELT (level, j))) | |
16146 | return true; | |
16147 | } | |
1fb3244a | 16148 | |
1fb3244a MM |
16149 | return false; |
16150 | } | |
16151 | ||
16152 | /* Returns TRUE if the template TMPL is dependent. */ | |
16153 | ||
16154 | bool | |
16155 | dependent_template_p (tree tmpl) | |
16156 | { | |
b95cc51a MM |
16157 | if (TREE_CODE (tmpl) == OVERLOAD) |
16158 | { | |
16159 | while (tmpl) | |
16160 | { | |
16161 | if (dependent_template_p (OVL_FUNCTION (tmpl))) | |
16162 | return true; | |
16163 | tmpl = OVL_CHAIN (tmpl); | |
16164 | } | |
16165 | return false; | |
16166 | } | |
16167 | ||
1fb3244a MM |
16168 | /* Template template parameters are dependent. */ |
16169 | if (DECL_TEMPLATE_TEMPLATE_PARM_P (tmpl) | |
16170 | || TREE_CODE (tmpl) == TEMPLATE_TEMPLATE_PARM) | |
16171 | return true; | |
27ab0504 | 16172 | /* So are names that have not been looked up. */ |
acccf788 MM |
16173 | if (TREE_CODE (tmpl) == SCOPE_REF |
16174 | || TREE_CODE (tmpl) == IDENTIFIER_NODE) | |
d17811fd | 16175 | return true; |
1fb3244a MM |
16176 | /* So are member templates of dependent classes. */ |
16177 | if (TYPE_P (CP_DECL_CONTEXT (tmpl))) | |
16178 | return dependent_type_p (DECL_CONTEXT (tmpl)); | |
16179 | return false; | |
16180 | } | |
16181 | ||
d17811fd MM |
16182 | /* Returns TRUE if the specialization TMPL<ARGS> is dependent. */ |
16183 | ||
16184 | bool | |
16185 | dependent_template_id_p (tree tmpl, tree args) | |
16186 | { | |
16187 | return (dependent_template_p (tmpl) | |
16188 | || any_dependent_template_arguments_p (args)); | |
16189 | } | |
16190 | ||
14d22dd6 | 16191 | /* TYPE is a TYPENAME_TYPE. Returns the ordinary TYPE to which the |
4195a767 NS |
16192 | TYPENAME_TYPE corresponds. Returns the original TYPENAME_TYPE if |
16193 | no such TYPE can be found. Note that this function peers inside | |
16194 | uninstantiated templates and therefore should be used only in | |
16195 | extremely limited situations. ONLY_CURRENT_P restricts this | |
16196 | peering to the currently open classes hierarchy (which is required | |
16197 | when comparing types). */ | |
14d22dd6 MM |
16198 | |
16199 | tree | |
16200 | resolve_typename_type (tree type, bool only_current_p) | |
16201 | { | |
16202 | tree scope; | |
16203 | tree name; | |
16204 | tree decl; | |
16205 | int quals; | |
4514aa8c | 16206 | tree pushed_scope; |
4195a767 | 16207 | tree result; |
14d22dd6 | 16208 | |
50bc768d | 16209 | gcc_assert (TREE_CODE (type) == TYPENAME_TYPE); |
14d22dd6 MM |
16210 | |
16211 | scope = TYPE_CONTEXT (type); | |
16212 | name = TYPE_IDENTIFIER (type); | |
16213 | ||
16214 | /* If the SCOPE is itself a TYPENAME_TYPE, then we need to resolve | |
16215 | it first before we can figure out what NAME refers to. */ | |
16216 | if (TREE_CODE (scope) == TYPENAME_TYPE) | |
16217 | scope = resolve_typename_type (scope, only_current_p); | |
16218 | /* If we don't know what SCOPE refers to, then we cannot resolve the | |
16219 | TYPENAME_TYPE. */ | |
4195a767 NS |
16220 | if (TREE_CODE (scope) == TYPENAME_TYPE) |
16221 | return type; | |
14d22dd6 MM |
16222 | /* If the SCOPE is a template type parameter, we have no way of |
16223 | resolving the name. */ | |
16224 | if (TREE_CODE (scope) == TEMPLATE_TYPE_PARM) | |
16225 | return type; | |
16226 | /* If the SCOPE is not the current instantiation, there's no reason | |
16227 | to look inside it. */ | |
16228 | if (only_current_p && !currently_open_class (scope)) | |
4195a767 | 16229 | return type; |
7a20d689 JM |
16230 | /* If SCOPE isn't the template itself, it will not have a valid |
16231 | TYPE_FIELDS list. */ | |
16232 | if (same_type_p (scope, CLASSTYPE_PRIMARY_TEMPLATE_TYPE (scope))) | |
16233 | /* scope is either the template itself or a compatible instantiation | |
16234 | like X<T>, so look up the name in the original template. */ | |
16235 | scope = CLASSTYPE_PRIMARY_TEMPLATE_TYPE (scope); | |
16236 | else | |
16237 | /* scope is a partial instantiation, so we can't do the lookup or we | |
16238 | will lose the template arguments. */ | |
16239 | return type; | |
14d22dd6 MM |
16240 | /* Enter the SCOPE so that name lookup will be resolved as if we |
16241 | were in the class definition. In particular, SCOPE will no | |
16242 | longer be considered a dependent type. */ | |
4514aa8c | 16243 | pushed_scope = push_scope (scope); |
14d22dd6 | 16244 | /* Look up the declaration. */ |
86ac0575 | 16245 | decl = lookup_member (scope, name, /*protect=*/0, /*want_type=*/true); |
4195a767 NS |
16246 | |
16247 | result = NULL_TREE; | |
16248 | ||
14d22dd6 MM |
16249 | /* For a TYPENAME_TYPE like "typename X::template Y<T>", we want to |
16250 | find a TEMPLATE_DECL. Otherwise, we want to find a TYPE_DECL. */ | |
16251 | if (!decl) | |
4195a767 | 16252 | /*nop*/; |
14d22dd6 MM |
16253 | else if (TREE_CODE (TYPENAME_TYPE_FULLNAME (type)) == IDENTIFIER_NODE |
16254 | && TREE_CODE (decl) == TYPE_DECL) | |
4195a767 NS |
16255 | { |
16256 | result = TREE_TYPE (decl); | |
16257 | if (result == error_mark_node) | |
16258 | result = NULL_TREE; | |
16259 | } | |
14d22dd6 MM |
16260 | else if (TREE_CODE (TYPENAME_TYPE_FULLNAME (type)) == TEMPLATE_ID_EXPR |
16261 | && DECL_CLASS_TEMPLATE_P (decl)) | |
16262 | { | |
16263 | tree tmpl; | |
16264 | tree args; | |
16265 | /* Obtain the template and the arguments. */ | |
16266 | tmpl = TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type), 0); | |
16267 | args = TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type), 1); | |
16268 | /* Instantiate the template. */ | |
4195a767 NS |
16269 | result = lookup_template_class (tmpl, args, NULL_TREE, NULL_TREE, |
16270 | /*entering_scope=*/0, | |
16271 | tf_error | tf_user); | |
16272 | if (result == error_mark_node) | |
16273 | result = NULL_TREE; | |
14d22dd6 | 16274 | } |
4195a767 | 16275 | |
14d22dd6 | 16276 | /* Leave the SCOPE. */ |
4514aa8c NS |
16277 | if (pushed_scope) |
16278 | pop_scope (pushed_scope); | |
14d22dd6 | 16279 | |
4195a767 NS |
16280 | /* If we failed to resolve it, return the original typename. */ |
16281 | if (!result) | |
16282 | return type; | |
16283 | ||
16284 | /* If lookup found a typename type, resolve that too. */ | |
16285 | if (TREE_CODE (result) == TYPENAME_TYPE && !TYPENAME_IS_RESOLVING_P (result)) | |
16286 | { | |
16287 | /* Ill-formed programs can cause infinite recursion here, so we | |
16288 | must catch that. */ | |
16289 | TYPENAME_IS_RESOLVING_P (type) = 1; | |
16290 | result = resolve_typename_type (result, only_current_p); | |
16291 | TYPENAME_IS_RESOLVING_P (type) = 0; | |
16292 | } | |
16293 | ||
16294 | /* Qualify the resulting type. */ | |
16295 | quals = cp_type_quals (type); | |
16296 | if (quals) | |
16297 | result = cp_build_qualified_type (result, cp_type_quals (result) | quals); | |
16298 | ||
16299 | return result; | |
14d22dd6 MM |
16300 | } |
16301 | ||
d17811fd MM |
16302 | /* EXPR is an expression which is not type-dependent. Return a proxy |
16303 | for EXPR that can be used to compute the types of larger | |
16304 | expressions containing EXPR. */ | |
16305 | ||
16306 | tree | |
16307 | build_non_dependent_expr (tree expr) | |
16308 | { | |
0deb916c MM |
16309 | tree inner_expr; |
16310 | ||
c8094d83 | 16311 | /* Preserve null pointer constants so that the type of things like |
d17811fd MM |
16312 | "p == 0" where "p" is a pointer can be determined. */ |
16313 | if (null_ptr_cst_p (expr)) | |
16314 | return expr; | |
16315 | /* Preserve OVERLOADs; the functions must be available to resolve | |
16316 | types. */ | |
c497db75 | 16317 | inner_expr = expr; |
c2acde1e JM |
16318 | if (TREE_CODE (inner_expr) == STMT_EXPR) |
16319 | inner_expr = stmt_expr_value_expr (inner_expr); | |
c497db75 AO |
16320 | if (TREE_CODE (inner_expr) == ADDR_EXPR) |
16321 | inner_expr = TREE_OPERAND (inner_expr, 0); | |
16322 | if (TREE_CODE (inner_expr) == COMPONENT_REF) | |
16323 | inner_expr = TREE_OPERAND (inner_expr, 1); | |
2226e997 | 16324 | if (is_overloaded_fn (inner_expr) |
6439fffd | 16325 | || TREE_CODE (inner_expr) == OFFSET_REF) |
d17811fd | 16326 | return expr; |
5ae9ba3e MM |
16327 | /* There is no need to return a proxy for a variable. */ |
16328 | if (TREE_CODE (expr) == VAR_DECL) | |
16329 | return expr; | |
7433e6d4 MM |
16330 | /* Preserve string constants; conversions from string constants to |
16331 | "char *" are allowed, even though normally a "const char *" | |
16332 | cannot be used to initialize a "char *". */ | |
16333 | if (TREE_CODE (expr) == STRING_CST) | |
16334 | return expr; | |
b7c707d1 MM |
16335 | /* Preserve arithmetic constants, as an optimization -- there is no |
16336 | reason to create a new node. */ | |
16337 | if (TREE_CODE (expr) == INTEGER_CST || TREE_CODE (expr) == REAL_CST) | |
16338 | return expr; | |
9b7be7b5 MM |
16339 | /* Preserve THROW_EXPRs -- all throw-expressions have type "void". |
16340 | There is at least one place where we want to know that a | |
16341 | particular expression is a throw-expression: when checking a ?: | |
16342 | expression, there are special rules if the second or third | |
878cbb73 | 16343 | argument is a throw-expression. */ |
9b7be7b5 MM |
16344 | if (TREE_CODE (expr) == THROW_EXPR) |
16345 | return expr; | |
47d4c811 NS |
16346 | |
16347 | if (TREE_CODE (expr) == COND_EXPR) | |
f293ce4b RS |
16348 | return build3 (COND_EXPR, |
16349 | TREE_TYPE (expr), | |
16350 | TREE_OPERAND (expr, 0), | |
c8094d83 | 16351 | (TREE_OPERAND (expr, 1) |
f293ce4b RS |
16352 | ? build_non_dependent_expr (TREE_OPERAND (expr, 1)) |
16353 | : build_non_dependent_expr (TREE_OPERAND (expr, 0))), | |
16354 | build_non_dependent_expr (TREE_OPERAND (expr, 2))); | |
8e1daa34 NS |
16355 | if (TREE_CODE (expr) == COMPOUND_EXPR |
16356 | && !COMPOUND_EXPR_OVERLOADED (expr)) | |
f293ce4b RS |
16357 | return build2 (COMPOUND_EXPR, |
16358 | TREE_TYPE (expr), | |
16359 | TREE_OPERAND (expr, 0), | |
16360 | build_non_dependent_expr (TREE_OPERAND (expr, 1))); | |
c8094d83 | 16361 | |
fdeff563 NS |
16362 | /* If the type is unknown, it can't really be non-dependent */ |
16363 | gcc_assert (TREE_TYPE (expr) != unknown_type_node); | |
3db45ab5 | 16364 | |
c8094d83 | 16365 | /* Otherwise, build a NON_DEPENDENT_EXPR. |
d17811fd MM |
16366 | |
16367 | REFERENCE_TYPEs are not stripped for expressions in templates | |
16368 | because doing so would play havoc with mangling. Consider, for | |
16369 | example: | |
16370 | ||
c8094d83 | 16371 | template <typename T> void f<T& g>() { g(); } |
d17811fd MM |
16372 | |
16373 | In the body of "f", the expression for "g" will have | |
16374 | REFERENCE_TYPE, even though the standard says that it should | |
16375 | not. The reason is that we must preserve the syntactic form of | |
16376 | the expression so that mangling (say) "f<g>" inside the body of | |
16377 | "f" works out correctly. Therefore, the REFERENCE_TYPE is | |
16378 | stripped here. */ | |
018a5803 | 16379 | return build1 (NON_DEPENDENT_EXPR, non_reference (TREE_TYPE (expr)), expr); |
d17811fd MM |
16380 | } |
16381 | ||
16382 | /* ARGS is a TREE_LIST of expressions as arguments to a function call. | |
16383 | Return a new TREE_LIST with the various arguments replaced with | |
16384 | equivalent non-dependent expressions. */ | |
16385 | ||
16386 | tree | |
16387 | build_non_dependent_args (tree args) | |
16388 | { | |
16389 | tree a; | |
16390 | tree new_args; | |
16391 | ||
16392 | new_args = NULL_TREE; | |
16393 | for (a = args; a; a = TREE_CHAIN (a)) | |
c8094d83 | 16394 | new_args = tree_cons (NULL_TREE, |
d17811fd MM |
16395 | build_non_dependent_expr (TREE_VALUE (a)), |
16396 | new_args); | |
16397 | return nreverse (new_args); | |
16398 | } | |
16399 | ||
e2500fed | 16400 | #include "gt-cp-pt.h" |