]>
Commit | Line | Data |
---|---|---|
8d08fdba | 1 | /* Handle parameterized types (templates) for GNU C++. |
3febd123 NS |
2 | Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000, |
3 | 2001 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 MS |
6 | |
7 | This file is part of GNU CC. | |
8 | ||
9 | GNU CC is free software; you can redistribute it and/or modify | |
10 | it under the terms of the GNU General Public License as published by | |
11 | the Free Software Foundation; either version 2, or (at your option) | |
12 | any later version. | |
13 | ||
14 | GNU CC is distributed in the hope that it will be useful, | |
15 | but WITHOUT ANY WARRANTY; without even the implied warranty of | |
16 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
17 | GNU General Public License for more details. | |
18 | ||
19 | You should have received a copy of the GNU General Public License | |
20 | along with GNU CC; see the file COPYING. If not, write to | |
e9fa0c7c RK |
21 | the Free Software Foundation, 59 Temple Place - Suite 330, |
22 | Boston, MA 02111-1307, USA. */ | |
8d08fdba MS |
23 | |
24 | /* Known bugs or deficiencies include: | |
e92cc029 | 25 | |
e92cc029 MS |
26 | all methods must be provided in header files; can't use a source |
27 | file that contains only the method templates and "just win". */ | |
8d08fdba MS |
28 | |
29 | #include "config.h" | |
8d052bc7 | 30 | #include "system.h" |
8d08fdba MS |
31 | #include "obstack.h" |
32 | ||
33 | #include "tree.h" | |
34 | #include "flags.h" | |
35 | #include "cp-tree.h" | |
36 | #include "decl.h" | |
37 | #include "parse.h" | |
f0e01782 | 38 | #include "lex.h" |
e8abc66f | 39 | #include "output.h" |
49c249e1 | 40 | #include "except.h" |
54f92bfb | 41 | #include "toplev.h" |
3dcaad8b | 42 | #include "rtl.h" |
9cd64686 | 43 | #include "ggc.h" |
297a5329 | 44 | #include "timevar.h" |
49c249e1 | 45 | |
050367a3 MM |
46 | /* The type of functions taking a tree, and some additional data, and |
47 | returning an int. */ | |
158991b7 | 48 | typedef int (*tree_fn_t) PARAMS ((tree, void*)); |
050367a3 | 49 | |
8d08fdba | 50 | extern struct obstack permanent_obstack; |
8d08fdba | 51 | |
0aafb128 MM |
52 | /* The PENDING_TEMPLATES is a TREE_LIST of templates whose |
53 | instantiations have been deferred, either because their definitions | |
54 | were not yet available, or because we were putting off doing the | |
55 | work. The TREE_PURPOSE of each entry is a SRCLOC indicating where | |
56 | the instantiate request occurred; the TREE_VALUE is a either a DECL | |
57 | (for a function or static data member), or a TYPE (for a class) | |
58 | indicating what we are hoping to instantiate. */ | |
59 | static tree pending_templates; | |
46ccf50a | 60 | static tree last_pending_template; |
73aad9b9 | 61 | |
67ffc812 | 62 | int processing_template_parmlist; |
386b8a85 JM |
63 | static int template_header_count; |
64 | ||
75650646 | 65 | static tree saved_trees; |
3dcaad8b MM |
66 | static varray_type inline_parm_levels; |
67 | static size_t inline_parm_levels_used; | |
75650646 | 68 | |
cb753e49 | 69 | static tree current_tinst_level; |
3ae18eaf | 70 | |
6dfbb909 MM |
71 | /* A map from local variable declarations in the body of the template |
72 | presently being instantiated to the corresponding instantiated | |
73 | local variables. */ | |
74 | static htab_t local_specializations; | |
75 | ||
8d08fdba MS |
76 | #define obstack_chunk_alloc xmalloc |
77 | #define obstack_chunk_free free | |
78 | ||
830bfa74 MM |
79 | #define UNIFY_ALLOW_NONE 0 |
80 | #define UNIFY_ALLOW_MORE_CV_QUAL 1 | |
81 | #define UNIFY_ALLOW_LESS_CV_QUAL 2 | |
82 | #define UNIFY_ALLOW_DERIVED 4 | |
161c12b0 | 83 | #define UNIFY_ALLOW_INTEGER 8 |
028d1f20 | 84 | #define UNIFY_ALLOW_OUTER_LEVEL 16 |
62e4a758 NS |
85 | #define UNIFY_ALLOW_OUTER_MORE_CV_QUAL 32 |
86 | #define UNIFY_ALLOW_OUTER_LESS_CV_QUAL 64 | |
830bfa74 | 87 | |
4393e105 MM |
88 | #define GTB_VIA_VIRTUAL 1 /* The base class we are examining is |
89 | virtual, or a base class of a virtual | |
90 | base. */ | |
91 | #define GTB_IGNORE_TYPE 2 /* We don't need to try to unify the current | |
92 | type with the desired type. */ | |
93 | ||
158991b7 | 94 | static int resolve_overloaded_unification PARAMS ((tree, tree, tree, tree, |
4393e105 | 95 | unification_kind_t, int)); |
158991b7 | 96 | static int try_one_overload PARAMS ((tree, tree, tree, tree, tree, |
4393e105 | 97 | unification_kind_t, int)); |
158991b7 KG |
98 | static int unify PARAMS ((tree, tree, tree, tree, int)); |
99 | static void add_pending_template PARAMS ((tree)); | |
100 | static int push_tinst_level PARAMS ((tree)); | |
3ae18eaf | 101 | static void reopen_tinst_level PARAMS ((tree)); |
158991b7 | 102 | static tree classtype_mangled_name PARAMS ((tree)); |
63ad61ed | 103 | static char *mangle_class_name_for_template PARAMS ((const char *, tree, tree)); |
fd74ca0b | 104 | static tree tsubst_initializer_list PARAMS ((tree, tree)); |
158991b7 KG |
105 | static int list_eq PARAMS ((tree, tree)); |
106 | static tree get_class_bindings PARAMS ((tree, tree, tree)); | |
107 | static tree coerce_template_parms PARAMS ((tree, tree, tree, int, int)); | |
108 | static void tsubst_enum PARAMS ((tree, tree, tree)); | |
109 | static tree add_to_template_args PARAMS ((tree, tree)); | |
110 | static tree add_outermost_template_args PARAMS ((tree, tree)); | |
62e4a758 | 111 | static int maybe_adjust_types_for_deduction PARAMS ((unification_kind_t, tree*, |
830bfa74 | 112 | tree*)); |
158991b7 | 113 | static int type_unification_real PARAMS ((tree, tree, tree, tree, |
e5214479 | 114 | int, unification_kind_t, int, int)); |
158991b7 KG |
115 | static void note_template_header PARAMS ((int)); |
116 | static tree maybe_fold_nontype_arg PARAMS ((tree)); | |
117 | static tree convert_nontype_argument PARAMS ((tree, tree)); | |
118 | static tree convert_template_argument PARAMS ((tree, tree, tree, int, | |
8b5b8b7c | 119 | int , tree)); |
158991b7 KG |
120 | static tree get_bindings_overload PARAMS ((tree, tree, tree)); |
121 | static int for_each_template_parm PARAMS ((tree, tree_fn_t, void*)); | |
122 | static tree build_template_parm_index PARAMS ((int, int, int, tree, tree)); | |
123 | static int inline_needs_template_parms PARAMS ((tree)); | |
124 | static void push_inline_template_parms_recursive PARAMS ((tree, int)); | |
125 | static tree retrieve_specialization PARAMS ((tree, tree)); | |
6dfbb909 | 126 | static tree retrieve_local_specialization PARAMS ((tree)); |
158991b7 | 127 | static tree register_specialization PARAMS ((tree, tree, tree)); |
414ea4aa | 128 | static void register_local_specialization PARAMS ((tree, tree)); |
158991b7 KG |
129 | static int unregister_specialization PARAMS ((tree, tree)); |
130 | static tree reduce_template_parm_level PARAMS ((tree, tree, int)); | |
131 | static tree build_template_decl PARAMS ((tree, tree)); | |
132 | static int mark_template_parm PARAMS ((tree, void *)); | |
133 | static tree tsubst_friend_function PARAMS ((tree, tree)); | |
134 | static tree tsubst_friend_class PARAMS ((tree, tree)); | |
62e4a758 | 135 | static tree get_bindings_real PARAMS ((tree, tree, tree, int, int, int)); |
158991b7 KG |
136 | static int template_decl_level PARAMS ((tree)); |
137 | static tree maybe_get_template_decl_from_type_decl PARAMS ((tree)); | |
138 | static int check_cv_quals_for_unify PARAMS ((int, tree, tree)); | |
139 | static tree tsubst_template_arg_vector PARAMS ((tree, tree, int)); | |
140 | static tree tsubst_template_parms PARAMS ((tree, tree, int)); | |
141 | static void regenerate_decl_from_template PARAMS ((tree, tree)); | |
142 | static tree most_specialized PARAMS ((tree, tree, tree)); | |
143 | static tree most_specialized_class PARAMS ((tree, tree)); | |
158991b7 KG |
144 | static int template_class_depth_real PARAMS ((tree, int)); |
145 | static tree tsubst_aggr_type PARAMS ((tree, tree, int, tree, int)); | |
4b2811e9 | 146 | static tree tsubst_decl PARAMS ((tree, tree, tree)); |
158991b7 KG |
147 | static tree tsubst_arg_types PARAMS ((tree, tree, int, tree)); |
148 | static tree tsubst_function_type PARAMS ((tree, tree, int, tree)); | |
149 | static void check_specialization_scope PARAMS ((void)); | |
150 | static tree process_partial_specialization PARAMS ((tree)); | |
151 | static void set_current_access_from_decl PARAMS ((tree)); | |
152 | static void check_default_tmpl_args PARAMS ((tree, tree, int, int)); | |
153 | static tree tsubst_call_declarator_parms PARAMS ((tree, tree, int, tree)); | |
154 | static tree get_template_base_recursive PARAMS ((tree, tree, | |
4393e105 | 155 | tree, tree, tree, int)); |
158991b7 | 156 | static tree get_template_base PARAMS ((tree, tree, tree, tree)); |
74601d7c | 157 | static int verify_class_unification PARAMS ((tree, tree, tree)); |
158991b7 KG |
158 | static tree try_class_unification PARAMS ((tree, tree, tree, tree)); |
159 | static int coerce_template_template_parms PARAMS ((tree, tree, int, | |
4393e105 | 160 | tree, tree)); |
158991b7 KG |
161 | static tree determine_specialization PARAMS ((tree, tree, tree *, int)); |
162 | static int template_args_equal PARAMS ((tree, tree)); | |
158991b7 KG |
163 | static void tsubst_default_arguments PARAMS ((tree)); |
164 | static tree for_each_template_parm_r PARAMS ((tree *, int *, void *)); | |
db9b2174 | 165 | static tree instantiate_clone PARAMS ((tree, tree)); |
8afa707f MM |
166 | static tree copy_default_args_to_explicit_spec_1 PARAMS ((tree, tree)); |
167 | static void copy_default_args_to_explicit_spec PARAMS ((tree)); | |
11b810f1 | 168 | static int invalid_nontype_parm_type_p PARAMS ((tree, int)); |
36a117a5 | 169 | |
9cd64686 MM |
170 | /* Called once to initialize pt.c. */ |
171 | ||
172 | void | |
173 | init_pt () | |
174 | { | |
175 | ggc_add_tree_root (&pending_templates, 1); | |
9cd64686 | 176 | ggc_add_tree_root (&saved_trees, 1); |
3ae18eaf | 177 | ggc_add_tree_root (¤t_tinst_level, 1); |
9cd64686 MM |
178 | } |
179 | ||
e1467ff2 MM |
180 | /* Do any processing required when DECL (a member template declaration |
181 | using TEMPLATE_PARAMETERS as its innermost parameter list) is | |
182 | finished. Returns the TEMPLATE_DECL corresponding to DECL, unless | |
183 | it is a specialization, in which case the DECL itself is returned. */ | |
184 | ||
185 | tree | |
61a127b3 | 186 | finish_member_template_decl (decl) |
e1467ff2 MM |
187 | tree decl; |
188 | { | |
93cdc044 JM |
189 | if (decl == NULL_TREE || decl == void_type_node) |
190 | return NULL_TREE; | |
3ddfb0e6 MM |
191 | else if (decl == error_mark_node) |
192 | /* By returning NULL_TREE, the parser will just ignore this | |
193 | declaration. We have already issued the error. */ | |
194 | return NULL_TREE; | |
93cdc044 JM |
195 | else if (TREE_CODE (decl) == TREE_LIST) |
196 | { | |
5f311aec | 197 | /* Assume that the class is the only declspec. */ |
93cdc044 | 198 | decl = TREE_VALUE (decl); |
8d019cef | 199 | if (IS_AGGR_TYPE (decl) && CLASSTYPE_TEMPLATE_INFO (decl) |
370af2d5 | 200 | && ! CLASSTYPE_TEMPLATE_SPECIALIZATION (decl)) |
93cdc044 JM |
201 | { |
202 | tree tmpl = CLASSTYPE_TI_TEMPLATE (decl); | |
203 | check_member_template (tmpl); | |
204 | return tmpl; | |
205 | } | |
8d019cef | 206 | return NULL_TREE; |
93cdc044 | 207 | } |
07c88314 MM |
208 | else if (TREE_CODE (decl) == FIELD_DECL) |
209 | cp_error ("data member `%D' cannot be a member template", decl); | |
a1da6cba | 210 | else if (DECL_TEMPLATE_INFO (decl)) |
e1467ff2 | 211 | { |
a1da6cba MM |
212 | if (!DECL_TEMPLATE_SPECIALIZATION (decl)) |
213 | { | |
214 | check_member_template (DECL_TI_TEMPLATE (decl)); | |
215 | return DECL_TI_TEMPLATE (decl); | |
216 | } | |
217 | else | |
218 | return decl; | |
219 | } | |
220 | else | |
8251199e | 221 | cp_error ("invalid member template declaration `%D'", decl); |
e1467ff2 | 222 | |
a1da6cba | 223 | return error_mark_node; |
f84b4be9 | 224 | } |
e1467ff2 | 225 | |
f84b4be9 JM |
226 | /* Returns the template nesting level of the indicated class TYPE. |
227 | ||
228 | For example, in: | |
229 | template <class T> | |
230 | struct A | |
231 | { | |
232 | template <class U> | |
233 | struct B {}; | |
234 | }; | |
235 | ||
39c01e4c MM |
236 | A<T>::B<U> has depth two, while A<T> has depth one. |
237 | Both A<T>::B<int> and A<int>::B<U> have depth one, if | |
238 | COUNT_SPECIALIZATIONS is 0 or if they are instantiations, not | |
239 | specializations. | |
240 | ||
241 | This function is guaranteed to return 0 if passed NULL_TREE so | |
242 | that, for example, `template_class_depth (current_class_type)' is | |
243 | always safe. */ | |
f84b4be9 | 244 | |
e9659ab0 | 245 | static int |
39c01e4c | 246 | template_class_depth_real (type, count_specializations) |
f84b4be9 | 247 | tree type; |
39c01e4c | 248 | int count_specializations; |
f84b4be9 | 249 | { |
93cdc044 | 250 | int depth; |
f84b4be9 | 251 | |
2c73f9f5 | 252 | for (depth = 0; |
ed44da02 MM |
253 | type && TREE_CODE (type) != NAMESPACE_DECL; |
254 | type = (TREE_CODE (type) == FUNCTION_DECL) | |
4f1c5b7d | 255 | ? CP_DECL_CONTEXT (type) : TYPE_CONTEXT (type)) |
ed44da02 MM |
256 | { |
257 | if (TREE_CODE (type) != FUNCTION_DECL) | |
258 | { | |
259 | if (CLASSTYPE_TEMPLATE_INFO (type) | |
260 | && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (type)) | |
261 | && ((count_specializations | |
370af2d5 | 262 | && CLASSTYPE_TEMPLATE_SPECIALIZATION (type)) |
ed44da02 MM |
263 | || uses_template_parms (CLASSTYPE_TI_ARGS (type)))) |
264 | ++depth; | |
265 | } | |
266 | else | |
267 | { | |
268 | if (DECL_TEMPLATE_INFO (type) | |
269 | && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (type)) | |
270 | && ((count_specializations | |
271 | && DECL_TEMPLATE_SPECIALIZATION (type)) | |
272 | || uses_template_parms (DECL_TI_ARGS (type)))) | |
273 | ++depth; | |
274 | } | |
275 | } | |
f84b4be9 JM |
276 | |
277 | return depth; | |
e1467ff2 | 278 | } |
98c1c668 | 279 | |
39c01e4c MM |
280 | /* Returns the template nesting level of the indicated class TYPE. |
281 | Like template_class_depth_real, but instantiations do not count in | |
282 | the depth. */ | |
283 | ||
284 | int | |
285 | template_class_depth (type) | |
286 | tree type; | |
287 | { | |
288 | return template_class_depth_real (type, /*count_specializations=*/0); | |
289 | } | |
290 | ||
cae40af6 JM |
291 | /* Returns 1 if processing DECL as part of do_pending_inlines |
292 | needs us to push template parms. */ | |
293 | ||
294 | static int | |
295 | inline_needs_template_parms (decl) | |
296 | tree decl; | |
297 | { | |
298 | if (! DECL_TEMPLATE_INFO (decl)) | |
299 | return 0; | |
f84b4be9 | 300 | |
36a117a5 | 301 | return (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (most_general_template (decl))) |
cae40af6 JM |
302 | > (processing_template_decl + DECL_TEMPLATE_SPECIALIZATION (decl))); |
303 | } | |
304 | ||
305 | /* Subroutine of maybe_begin_member_template_processing. | |
306 | Push the template parms in PARMS, starting from LEVELS steps into the | |
307 | chain, and ending at the beginning, since template parms are listed | |
308 | innermost first. */ | |
309 | ||
310 | static void | |
311 | push_inline_template_parms_recursive (parmlist, levels) | |
312 | tree parmlist; | |
313 | int levels; | |
314 | { | |
315 | tree parms = TREE_VALUE (parmlist); | |
316 | int i; | |
317 | ||
318 | if (levels > 1) | |
319 | push_inline_template_parms_recursive (TREE_CHAIN (parmlist), levels - 1); | |
786b5245 | 320 | |
98c1c668 | 321 | ++processing_template_decl; |
cae40af6 | 322 | current_template_parms |
4890c2f4 | 323 | = tree_cons (size_int (processing_template_decl), |
98c1c668 | 324 | parms, current_template_parms); |
cae40af6 JM |
325 | TEMPLATE_PARMS_FOR_INLINE (current_template_parms) = 1; |
326 | ||
786b5245 | 327 | pushlevel (0); |
98c1c668 JM |
328 | for (i = 0; i < TREE_VEC_LENGTH (parms); ++i) |
329 | { | |
786b5245 | 330 | tree parm = TREE_VALUE (TREE_VEC_ELT (parms, i)); |
2f939d94 | 331 | my_friendly_assert (DECL_P (parm), 0); |
cae40af6 | 332 | |
98c1c668 JM |
333 | switch (TREE_CODE (parm)) |
334 | { | |
786b5245 | 335 | case TYPE_DECL: |
73b0fce8 | 336 | case TEMPLATE_DECL: |
98c1c668 JM |
337 | pushdecl (parm); |
338 | break; | |
786b5245 MM |
339 | |
340 | case PARM_DECL: | |
341 | { | |
fc03edb3 MM |
342 | /* Make a CONST_DECL as is done in process_template_parm. |
343 | It is ugly that we recreate this here; the original | |
344 | version built in process_template_parm is no longer | |
345 | available. */ | |
786b5245 MM |
346 | tree decl = build_decl (CONST_DECL, DECL_NAME (parm), |
347 | TREE_TYPE (parm)); | |
c727aa5e | 348 | DECL_ARTIFICIAL (decl) = 1; |
786b5245 | 349 | DECL_INITIAL (decl) = DECL_INITIAL (parm); |
cd9f6678 | 350 | SET_DECL_TEMPLATE_PARM_P (decl); |
786b5245 MM |
351 | pushdecl (decl); |
352 | } | |
cae40af6 | 353 | break; |
786b5245 | 354 | |
98c1c668 JM |
355 | default: |
356 | my_friendly_abort (0); | |
357 | } | |
358 | } | |
359 | } | |
360 | ||
cae40af6 JM |
361 | /* Restore the template parameter context for a member template or |
362 | a friend template defined in a class definition. */ | |
363 | ||
364 | void | |
365 | maybe_begin_member_template_processing (decl) | |
366 | tree decl; | |
367 | { | |
368 | tree parms; | |
3dcaad8b | 369 | int levels = 0; |
cae40af6 | 370 | |
3dcaad8b MM |
371 | if (inline_needs_template_parms (decl)) |
372 | { | |
373 | parms = DECL_TEMPLATE_PARMS (most_general_template (decl)); | |
374 | levels = TMPL_PARMS_DEPTH (parms) - processing_template_decl; | |
cae40af6 | 375 | |
3dcaad8b MM |
376 | if (DECL_TEMPLATE_SPECIALIZATION (decl)) |
377 | { | |
378 | --levels; | |
379 | parms = TREE_CHAIN (parms); | |
380 | } | |
cae40af6 | 381 | |
3dcaad8b | 382 | push_inline_template_parms_recursive (parms, levels); |
cae40af6 JM |
383 | } |
384 | ||
3dcaad8b MM |
385 | /* Remember how many levels of template parameters we pushed so that |
386 | we can pop them later. */ | |
387 | if (!inline_parm_levels) | |
388 | VARRAY_INT_INIT (inline_parm_levels, 4, "inline_parm_levels"); | |
389 | if (inline_parm_levels_used == inline_parm_levels->num_elements) | |
390 | VARRAY_GROW (inline_parm_levels, 2 * inline_parm_levels_used); | |
391 | VARRAY_INT (inline_parm_levels, inline_parm_levels_used) = levels; | |
392 | ++inline_parm_levels_used; | |
cae40af6 JM |
393 | } |
394 | ||
98c1c668 JM |
395 | /* Undo the effects of begin_member_template_processing. */ |
396 | ||
397 | void | |
b370501f | 398 | maybe_end_member_template_processing () |
98c1c668 | 399 | { |
3dcaad8b MM |
400 | int i; |
401 | ||
402 | if (!inline_parm_levels_used) | |
98c1c668 JM |
403 | return; |
404 | ||
3dcaad8b MM |
405 | --inline_parm_levels_used; |
406 | for (i = 0; | |
407 | i < VARRAY_INT (inline_parm_levels, inline_parm_levels_used); | |
408 | ++i) | |
cae40af6 JM |
409 | { |
410 | --processing_template_decl; | |
411 | current_template_parms = TREE_CHAIN (current_template_parms); | |
412 | poplevel (0, 0, 0); | |
413 | } | |
98c1c668 JM |
414 | } |
415 | ||
cae40af6 | 416 | /* Returns non-zero iff T is a member template function. We must be |
f84b4be9 | 417 | careful as in |
75650646 MM |
418 | |
419 | template <class T> class C { void f(); } | |
420 | ||
421 | Here, f is a template function, and a member, but not a member | |
422 | template. This function does not concern itself with the origin of | |
423 | T, only its present state. So if we have | |
424 | ||
425 | template <class T> class C { template <class U> void f(U); } | |
426 | ||
427 | then neither C<int>::f<char> nor C<T>::f<double> is considered | |
f181d4ae MM |
428 | to be a member template. But, `template <class U> void |
429 | C<int>::f(U)' is considered a member template. */ | |
98c1c668 | 430 | |
cae40af6 JM |
431 | int |
432 | is_member_template (t) | |
98c1c668 JM |
433 | tree t; |
434 | { | |
f181d4ae | 435 | if (!DECL_FUNCTION_TEMPLATE_P (t)) |
75650646 | 436 | /* Anything that isn't a function or a template function is |
aa5f3bad MM |
437 | certainly not a member template. */ |
438 | return 0; | |
439 | ||
cae40af6 | 440 | /* A local class can't have member templates. */ |
4f1c5b7d | 441 | if (decl_function_context (t)) |
cae40af6 JM |
442 | return 0; |
443 | ||
f181d4ae | 444 | return (DECL_FUNCTION_MEMBER_P (DECL_TEMPLATE_RESULT (t)) |
f84b4be9 JM |
445 | /* If there are more levels of template parameters than |
446 | there are template classes surrounding the declaration, | |
447 | then we have a member template. */ | |
f181d4ae | 448 | && (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (t)) > |
4f1c5b7d | 449 | template_class_depth (DECL_CONTEXT (t)))); |
f84b4be9 | 450 | } |
98c1c668 | 451 | |
ba4f4e5d | 452 | #if 0 /* UNUSED */ |
2ee4e084 MM |
453 | /* Returns non-zero iff T is a member template class. See |
454 | is_member_template for a description of what precisely constitutes | |
455 | a member template. */ | |
456 | ||
457 | int | |
458 | is_member_template_class (t) | |
459 | tree t; | |
460 | { | |
461 | if (!DECL_CLASS_TEMPLATE_P (t)) | |
462 | /* Anything that isn't a class template, is certainly not a member | |
463 | template. */ | |
464 | return 0; | |
465 | ||
466 | if (!DECL_CLASS_SCOPE_P (t)) | |
467 | /* Anything whose context isn't a class type is surely not a | |
468 | member template. */ | |
469 | return 0; | |
470 | ||
471 | /* If there are more levels of template parameters than there are | |
472 | template classes surrounding the declaration, then we have a | |
473 | member template. */ | |
36a117a5 | 474 | return (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (t)) > |
2ee4e084 MM |
475 | template_class_depth (DECL_CONTEXT (t))); |
476 | } | |
ba4f4e5d | 477 | #endif |
2ee4e084 | 478 | |
36a117a5 | 479 | /* Return a new template argument vector which contains all of ARGS, |
f9a7ae04 | 480 | but has as its innermost set of arguments the EXTRA_ARGS. */ |
e6f1275f JM |
481 | |
482 | static tree | |
36a117a5 MM |
483 | add_to_template_args (args, extra_args) |
484 | tree args; | |
485 | tree extra_args; | |
e6f1275f | 486 | { |
36a117a5 MM |
487 | tree new_args; |
488 | int extra_depth; | |
489 | int i; | |
490 | int j; | |
e6f1275f | 491 | |
36a117a5 | 492 | extra_depth = TMPL_ARGS_DEPTH (extra_args); |
f31c0a32 | 493 | new_args = make_tree_vec (TMPL_ARGS_DEPTH (args) + extra_depth); |
e6f1275f | 494 | |
36a117a5 MM |
495 | for (i = 1; i <= TMPL_ARGS_DEPTH (args); ++i) |
496 | SET_TMPL_ARGS_LEVEL (new_args, i, TMPL_ARGS_LEVEL (args, i)); | |
e6f1275f | 497 | |
36a117a5 MM |
498 | for (j = 1; j <= extra_depth; ++j, ++i) |
499 | SET_TMPL_ARGS_LEVEL (new_args, i, TMPL_ARGS_LEVEL (extra_args, j)); | |
500 | ||
e6f1275f JM |
501 | return new_args; |
502 | } | |
503 | ||
36a117a5 MM |
504 | /* Like add_to_template_args, but only the outermost ARGS are added to |
505 | the EXTRA_ARGS. In particular, all but TMPL_ARGS_DEPTH | |
506 | (EXTRA_ARGS) levels are added. This function is used to combine | |
507 | the template arguments from a partial instantiation with the | |
508 | template arguments used to attain the full instantiation from the | |
509 | partial instantiation. */ | |
98c1c668 | 510 | |
4966381a | 511 | static tree |
36a117a5 | 512 | add_outermost_template_args (args, extra_args) |
98c1c668 JM |
513 | tree args; |
514 | tree extra_args; | |
515 | { | |
516 | tree new_args; | |
517 | ||
e4a84209 MM |
518 | /* If there are more levels of EXTRA_ARGS than there are ARGS, |
519 | something very fishy is going on. */ | |
520 | my_friendly_assert (TMPL_ARGS_DEPTH (args) >= TMPL_ARGS_DEPTH (extra_args), | |
521 | 0); | |
522 | ||
523 | /* If *all* the new arguments will be the EXTRA_ARGS, just return | |
524 | them. */ | |
525 | if (TMPL_ARGS_DEPTH (args) == TMPL_ARGS_DEPTH (extra_args)) | |
526 | return extra_args; | |
527 | ||
36a117a5 MM |
528 | /* For the moment, we make ARGS look like it contains fewer levels. */ |
529 | TREE_VEC_LENGTH (args) -= TMPL_ARGS_DEPTH (extra_args); | |
530 | ||
531 | new_args = add_to_template_args (args, extra_args); | |
98c1c668 | 532 | |
36a117a5 MM |
533 | /* Now, we restore ARGS to its full dimensions. */ |
534 | TREE_VEC_LENGTH (args) += TMPL_ARGS_DEPTH (extra_args); | |
98c1c668 JM |
535 | |
536 | return new_args; | |
537 | } | |
5566b478 | 538 | |
f9a7ae04 MM |
539 | /* Return the N levels of innermost template arguments from the ARGS. */ |
540 | ||
541 | tree | |
542 | get_innermost_template_args (args, n) | |
543 | tree args; | |
544 | int n; | |
545 | { | |
546 | tree new_args; | |
547 | int extra_levels; | |
548 | int i; | |
549 | ||
550 | my_friendly_assert (n >= 0, 20000603); | |
551 | ||
552 | /* If N is 1, just return the innermost set of template arguments. */ | |
553 | if (n == 1) | |
554 | return TMPL_ARGS_LEVEL (args, TMPL_ARGS_DEPTH (args)); | |
555 | ||
556 | /* If we're not removing anything, just return the arguments we were | |
557 | given. */ | |
558 | extra_levels = TMPL_ARGS_DEPTH (args) - n; | |
559 | my_friendly_assert (extra_levels >= 0, 20000603); | |
560 | if (extra_levels == 0) | |
561 | return args; | |
562 | ||
563 | /* Make a new set of arguments, not containing the outer arguments. */ | |
564 | new_args = make_tree_vec (n); | |
565 | for (i = 1; i <= n; ++i) | |
566 | SET_TMPL_ARGS_LEVEL (new_args, i, | |
567 | TMPL_ARGS_LEVEL (args, i + extra_levels)); | |
568 | ||
569 | return new_args; | |
570 | } | |
571 | ||
5566b478 MS |
572 | /* We've got a template header coming up; push to a new level for storing |
573 | the parms. */ | |
8d08fdba | 574 | |
8d08fdba MS |
575 | void |
576 | begin_template_parm_list () | |
577 | { | |
6757edfe MM |
578 | /* We use a non-tag-transparent scope here, which causes pushtag to |
579 | put tags in this scope, rather than in the enclosing class or | |
580 | namespace scope. This is the right thing, since we want | |
581 | TEMPLATE_DECLS, and not TYPE_DECLS for template classes. For a | |
582 | global template class, push_template_decl handles putting the | |
583 | TEMPLATE_DECL into top-level scope. For a nested template class, | |
584 | e.g.: | |
585 | ||
586 | template <class T> struct S1 { | |
587 | template <class T> struct S2 {}; | |
588 | }; | |
589 | ||
590 | pushtag contains special code to call pushdecl_with_scope on the | |
591 | TEMPLATE_DECL for S2. */ | |
74b846e0 | 592 | begin_scope (sk_template_parms); |
5156628f | 593 | ++processing_template_decl; |
67ffc812 | 594 | ++processing_template_parmlist; |
386b8a85 JM |
595 | note_template_header (0); |
596 | } | |
597 | ||
6c30752f MM |
598 | /* This routine is called when a specialization is declared. If it is |
599 | illegal to declare a specialization here, an error is reported. */ | |
600 | ||
e9659ab0 | 601 | static void |
6c30752f MM |
602 | check_specialization_scope () |
603 | { | |
604 | tree scope = current_scope (); | |
3ddfb0e6 | 605 | |
6c30752f MM |
606 | /* [temp.expl.spec] |
607 | ||
608 | An explicit specialization shall be declared in the namespace of | |
609 | which the template is a member, or, for member templates, in the | |
610 | namespace of which the enclosing class or enclosing class | |
611 | template is a member. An explicit specialization of a member | |
612 | function, member class or static data member of a class template | |
613 | shall be declared in the namespace of which the class template | |
614 | is a member. */ | |
615 | if (scope && TREE_CODE (scope) != NAMESPACE_DECL) | |
8251199e | 616 | cp_error ("explicit specialization in non-namespace scope `%D'", |
6c30752f | 617 | scope); |
3ddfb0e6 | 618 | |
6c30752f MM |
619 | /* [temp.expl.spec] |
620 | ||
621 | In an explicit specialization declaration for a member of a class | |
622 | template or a member template that appears in namespace scope, | |
623 | the member template and some of its enclosing class templates may | |
624 | remain unspecialized, except that the declaration shall not | |
625 | explicitly specialize a class member template if its enclosing | |
626 | class templates are not explicitly specialized as well. */ | |
627 | if (current_template_parms) | |
fd4de5ff | 628 | cp_error ("enclosing class templates are not explicitly specialized"); |
6c30752f MM |
629 | } |
630 | ||
386b8a85 JM |
631 | /* We've just seen template <>. */ |
632 | ||
633 | void | |
634 | begin_specialization () | |
635 | { | |
74b846e0 | 636 | begin_scope (sk_template_spec); |
386b8a85 | 637 | note_template_header (1); |
6c30752f | 638 | check_specialization_scope (); |
386b8a85 JM |
639 | } |
640 | ||
dc957d14 | 641 | /* Called at then end of processing a declaration preceded by |
386b8a85 JM |
642 | template<>. */ |
643 | ||
644 | void | |
645 | end_specialization () | |
646 | { | |
74b846e0 | 647 | finish_scope (); |
386b8a85 JM |
648 | reset_specialization (); |
649 | } | |
650 | ||
386b8a85 JM |
651 | /* Any template <>'s that we have seen thus far are not referring to a |
652 | function specialization. */ | |
653 | ||
654 | void | |
655 | reset_specialization () | |
656 | { | |
657 | processing_specialization = 0; | |
658 | template_header_count = 0; | |
659 | } | |
660 | ||
386b8a85 JM |
661 | /* We've just seen a template header. If SPECIALIZATION is non-zero, |
662 | it was of the form template <>. */ | |
663 | ||
4966381a | 664 | static void |
386b8a85 JM |
665 | note_template_header (specialization) |
666 | int specialization; | |
667 | { | |
668 | processing_specialization = specialization; | |
669 | template_header_count++; | |
670 | } | |
671 | ||
75650646 | 672 | /* We're beginning an explicit instantiation. */ |
386b8a85 | 673 | |
75650646 MM |
674 | void |
675 | begin_explicit_instantiation () | |
386b8a85 | 676 | { |
75650646 MM |
677 | ++processing_explicit_instantiation; |
678 | } | |
386b8a85 | 679 | |
386b8a85 | 680 | |
75650646 MM |
681 | void |
682 | end_explicit_instantiation () | |
683 | { | |
684 | my_friendly_assert(processing_explicit_instantiation > 0, 0); | |
685 | --processing_explicit_instantiation; | |
686 | } | |
386b8a85 | 687 | |
36a117a5 MM |
688 | /* The TYPE is being declared. If it is a template type, that means it |
689 | is a partial specialization. Do appropriate error-checking. */ | |
690 | ||
691 | void | |
692 | maybe_process_partial_specialization (type) | |
693 | tree type; | |
694 | { | |
695 | if (IS_AGGR_TYPE (type) && CLASSTYPE_USE_TEMPLATE (type)) | |
696 | { | |
697 | if (CLASSTYPE_IMPLICIT_INSTANTIATION (type) | |
d0f062fb | 698 | && !COMPLETE_TYPE_P (type)) |
36a117a5 | 699 | { |
700466c2 JM |
700 | if (current_namespace |
701 | != decl_namespace_context (CLASSTYPE_TI_TEMPLATE (type))) | |
702 | { | |
703 | cp_pedwarn ("specializing `%#T' in different namespace", type); | |
704 | cp_pedwarn_at (" from definition of `%#D'", | |
705 | CLASSTYPE_TI_TEMPLATE (type)); | |
706 | } | |
370af2d5 | 707 | SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (type); |
36a117a5 MM |
708 | if (processing_template_decl) |
709 | push_template_decl (TYPE_MAIN_DECL (type)); | |
710 | } | |
711 | else if (CLASSTYPE_TEMPLATE_INSTANTIATION (type)) | |
8251199e | 712 | cp_error ("specialization of `%T' after instantiation", type); |
36a117a5 | 713 | } |
20496fa2 JM |
714 | else if (processing_specialization) |
715 | cp_error ("explicit specialization of non-template `%T'", type); | |
36a117a5 MM |
716 | } |
717 | ||
75650646 MM |
718 | /* Retrieve the specialization (in the sense of [temp.spec] - a |
719 | specialization is either an instantiation or an explicit | |
720 | specialization) of TMPL for the given template ARGS. If there is | |
721 | no such specialization, return NULL_TREE. The ARGS are a vector of | |
722 | arguments, or a vector of vectors of arguments, in the case of | |
723 | templates with more than one level of parameters. */ | |
724 | ||
725 | static tree | |
726 | retrieve_specialization (tmpl, args) | |
727 | tree tmpl; | |
728 | tree args; | |
729 | { | |
730 | tree s; | |
731 | ||
732 | my_friendly_assert (TREE_CODE (tmpl) == TEMPLATE_DECL, 0); | |
733 | ||
36a117a5 MM |
734 | /* There should be as many levels of arguments as there are |
735 | levels of parameters. */ | |
736 | my_friendly_assert (TMPL_ARGS_DEPTH (args) | |
737 | == TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl)), | |
738 | 0); | |
739 | ||
75650646 MM |
740 | for (s = DECL_TEMPLATE_SPECIALIZATIONS (tmpl); |
741 | s != NULL_TREE; | |
742 | s = TREE_CHAIN (s)) | |
743 | if (comp_template_args (TREE_PURPOSE (s), args)) | |
744 | return TREE_VALUE (s); | |
745 | ||
746 | return NULL_TREE; | |
386b8a85 JM |
747 | } |
748 | ||
dc957d14 | 749 | /* Like retrieve_specialization, but for local declarations. */ |
9188c363 MM |
750 | |
751 | static tree | |
6dfbb909 | 752 | retrieve_local_specialization (tmpl) |
9188c363 | 753 | tree tmpl; |
9188c363 | 754 | { |
6dfbb909 | 755 | return (tree) htab_find (local_specializations, tmpl); |
9188c363 MM |
756 | } |
757 | ||
6757edfe MM |
758 | /* Returns non-zero iff DECL is a specialization of TMPL. */ |
759 | ||
760 | int | |
761 | is_specialization_of (decl, tmpl) | |
762 | tree decl; | |
763 | tree tmpl; | |
764 | { | |
765 | tree t; | |
766 | ||
767 | if (TREE_CODE (decl) == FUNCTION_DECL) | |
768 | { | |
769 | for (t = decl; | |
770 | t != NULL_TREE; | |
771 | t = DECL_TEMPLATE_INFO (t) ? DECL_TI_TEMPLATE (t) : NULL_TREE) | |
772 | if (t == tmpl) | |
773 | return 1; | |
774 | } | |
775 | else | |
776 | { | |
777 | my_friendly_assert (TREE_CODE (decl) == TYPE_DECL, 0); | |
778 | ||
779 | for (t = TREE_TYPE (decl); | |
780 | t != NULL_TREE; | |
781 | t = CLASSTYPE_USE_TEMPLATE (t) | |
782 | ? TREE_TYPE (CLASSTYPE_TI_TEMPLATE (t)) : NULL_TREE) | |
9edc3913 | 783 | if (same_type_ignoring_top_level_qualifiers_p (t, TREE_TYPE (tmpl))) |
6757edfe MM |
784 | return 1; |
785 | } | |
386b8a85 | 786 | |
6757edfe MM |
787 | return 0; |
788 | } | |
75650646 MM |
789 | |
790 | /* Register the specialization SPEC as a specialization of TMPL with | |
36a117a5 MM |
791 | the indicated ARGS. Returns SPEC, or an equivalent prior |
792 | declaration, if available. */ | |
75650646 | 793 | |
36a117a5 | 794 | static tree |
75650646 MM |
795 | register_specialization (spec, tmpl, args) |
796 | tree spec; | |
797 | tree tmpl; | |
798 | tree args; | |
799 | { | |
800 | tree s; | |
801 | ||
802 | my_friendly_assert (TREE_CODE (tmpl) == TEMPLATE_DECL, 0); | |
803 | ||
36a117a5 MM |
804 | if (TREE_CODE (spec) == FUNCTION_DECL |
805 | && uses_template_parms (DECL_TI_ARGS (spec))) | |
806 | /* This is the FUNCTION_DECL for a partial instantiation. Don't | |
807 | register it; we want the corresponding TEMPLATE_DECL instead. | |
808 | We use `uses_template_parms (DECL_TI_ARGS (spec))' rather than | |
809 | the more obvious `uses_template_parms (spec)' to avoid problems | |
810 | with default function arguments. In particular, given | |
811 | something like this: | |
812 | ||
813 | template <class T> void f(T t1, T t = T()) | |
814 | ||
815 | the default argument expression is not substituted for in an | |
816 | instantiation unless and until it is actually needed. */ | |
817 | return spec; | |
75650646 | 818 | |
36a117a5 MM |
819 | /* There should be as many levels of arguments as there are |
820 | levels of parameters. */ | |
821 | my_friendly_assert (TMPL_ARGS_DEPTH (args) | |
822 | == TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl)), | |
823 | 0); | |
824 | ||
75650646 MM |
825 | for (s = DECL_TEMPLATE_SPECIALIZATIONS (tmpl); |
826 | s != NULL_TREE; | |
827 | s = TREE_CHAIN (s)) | |
22e9174f MM |
828 | { |
829 | tree fn = TREE_VALUE (s); | |
830 | ||
831 | /* We can sometimes try to re-register a specialization that we've | |
832 | already got. In particular, regenerate_decl_from_template | |
833 | calls duplicate_decls which will update the specialization | |
834 | list. But, we'll still get called again here anyhow. It's | |
835 | more convenient to simply allow this than to try to prevent it. */ | |
836 | if (fn == spec) | |
837 | return spec; | |
838 | else if (comp_template_args (TREE_PURPOSE (s), args)) | |
839 | { | |
840 | if (DECL_TEMPLATE_SPECIALIZATION (spec)) | |
841 | { | |
842 | if (DECL_TEMPLATE_INSTANTIATION (fn)) | |
843 | { | |
844 | if (TREE_USED (fn) | |
845 | || DECL_EXPLICIT_INSTANTIATION (fn)) | |
846 | { | |
847 | cp_error ("specialization of %D after instantiation", | |
848 | fn); | |
849 | return spec; | |
850 | } | |
851 | else | |
852 | { | |
853 | /* This situation should occur only if the first | |
854 | specialization is an implicit instantiation, | |
855 | the second is an explicit specialization, and | |
856 | the implicit instantiation has not yet been | |
857 | used. That situation can occur if we have | |
858 | implicitly instantiated a member function and | |
859 | then specialized it later. | |
860 | ||
861 | We can also wind up here if a friend | |
862 | declaration that looked like an instantiation | |
863 | turns out to be a specialization: | |
864 | ||
865 | template <class T> void foo(T); | |
866 | class S { friend void foo<>(int) }; | |
867 | template <> void foo(int); | |
868 | ||
869 | We transform the existing DECL in place so that | |
870 | any pointers to it become pointers to the | |
871 | updated declaration. | |
872 | ||
873 | If there was a definition for the template, but | |
874 | not for the specialization, we want this to | |
875 | look as if there is no definition, and vice | |
876 | versa. */ | |
877 | DECL_INITIAL (fn) = NULL_TREE; | |
878 | duplicate_decls (spec, fn); | |
879 | ||
880 | return fn; | |
881 | } | |
882 | } | |
883 | else if (DECL_TEMPLATE_SPECIALIZATION (fn)) | |
884 | { | |
885 | duplicate_decls (spec, fn); | |
886 | return fn; | |
887 | } | |
888 | } | |
889 | } | |
75650646 MM |
890 | } |
891 | ||
892 | DECL_TEMPLATE_SPECIALIZATIONS (tmpl) | |
e1b3e07d | 893 | = tree_cons (args, spec, DECL_TEMPLATE_SPECIALIZATIONS (tmpl)); |
36a117a5 MM |
894 | |
895 | return spec; | |
896 | } | |
897 | ||
898 | /* Unregister the specialization SPEC as a specialization of TMPL. | |
899 | Returns nonzero if the SPEC was listed as a specialization of | |
900 | TMPL. */ | |
901 | ||
902 | static int | |
903 | unregister_specialization (spec, tmpl) | |
904 | tree spec; | |
905 | tree tmpl; | |
906 | { | |
907 | tree* s; | |
908 | ||
909 | for (s = &DECL_TEMPLATE_SPECIALIZATIONS (tmpl); | |
910 | *s != NULL_TREE; | |
911 | s = &TREE_CHAIN (*s)) | |
912 | if (TREE_VALUE (*s) == spec) | |
913 | { | |
914 | *s = TREE_CHAIN (*s); | |
915 | return 1; | |
916 | } | |
917 | ||
918 | return 0; | |
75650646 MM |
919 | } |
920 | ||
6dfbb909 MM |
921 | /* Like register_specialization, but for local declarations. We are |
922 | registering SPEC, an instantiation of TMPL. */ | |
9188c363 | 923 | |
414ea4aa | 924 | static void |
6dfbb909 | 925 | register_local_specialization (spec, tmpl) |
9188c363 MM |
926 | tree spec; |
927 | tree tmpl; | |
9188c363 | 928 | { |
6dfbb909 MM |
929 | void **slot; |
930 | ||
931 | slot = htab_find_slot (local_specializations, tmpl, INSERT); | |
932 | *slot = spec; | |
9188c363 MM |
933 | } |
934 | ||
e1467ff2 MM |
935 | /* Print the list of candidate FNS in an error message. */ |
936 | ||
104bf76a | 937 | void |
e1467ff2 MM |
938 | print_candidates (fns) |
939 | tree fns; | |
940 | { | |
941 | tree fn; | |
942 | ||
d8e178a0 | 943 | const char *str = "candidates are:"; |
e1467ff2 MM |
944 | |
945 | for (fn = fns; fn != NULL_TREE; fn = TREE_CHAIN (fn)) | |
946 | { | |
d6479fe7 MM |
947 | tree f; |
948 | ||
949 | for (f = TREE_VALUE (fn); f; f = OVL_NEXT (f)) | |
950 | cp_error_at ("%s %+#D", str, OVL_CURRENT (f)); | |
e1467ff2 MM |
951 | str = " "; |
952 | } | |
953 | } | |
954 | ||
75650646 | 955 | /* Returns the template (one of the functions given by TEMPLATE_ID) |
e1467ff2 | 956 | which can be specialized to match the indicated DECL with the |
03017874 MM |
957 | explicit template args given in TEMPLATE_ID. The DECL may be |
958 | NULL_TREE if none is available. In that case, the functions in | |
959 | TEMPLATE_ID are non-members. | |
960 | ||
961 | If NEED_MEMBER_TEMPLATE is non-zero the function is known to be a | |
962 | specialization of a member template. | |
963 | ||
964 | The template args (those explicitly specified and those deduced) | |
965 | are output in a newly created vector *TARGS_OUT. | |
966 | ||
967 | If it is impossible to determine the result, an error message is | |
bf8f3f93 | 968 | issued. The error_mark_node is returned to indicate failure. */ |
75650646 | 969 | |
e9659ab0 | 970 | static tree |
e1467ff2 | 971 | determine_specialization (template_id, decl, targs_out, |
bf8f3f93 | 972 | need_member_template) |
386b8a85 | 973 | tree template_id; |
e1467ff2 | 974 | tree decl; |
386b8a85 JM |
975 | tree* targs_out; |
976 | int need_member_template; | |
386b8a85 | 977 | { |
03017874 MM |
978 | tree fns; |
979 | tree targs; | |
980 | tree explicit_targs; | |
981 | tree candidates = NULL_TREE; | |
982 | tree templates = NULL_TREE; | |
386b8a85 | 983 | |
e1467ff2 MM |
984 | *targs_out = NULL_TREE; |
985 | ||
f2e48b67 BK |
986 | if (template_id == error_mark_node) |
987 | return error_mark_node; | |
988 | ||
989 | fns = TREE_OPERAND (template_id, 0); | |
03017874 | 990 | explicit_targs = TREE_OPERAND (template_id, 1); |
f2e48b67 | 991 | |
27fafc8d JM |
992 | if (fns == error_mark_node) |
993 | return error_mark_node; | |
994 | ||
2c73f9f5 | 995 | /* Check for baselinks. */ |
91e490ab | 996 | if (BASELINK_P (fns)) |
2c73f9f5 | 997 | fns = TREE_VALUE (fns); |
386b8a85 | 998 | |
91e490ab MM |
999 | if (!is_overloaded_fn (fns)) |
1000 | { | |
9dfce8fd | 1001 | cp_error ("`%D' is not a function template", fns); |
91e490ab MM |
1002 | return error_mark_node; |
1003 | } | |
1004 | ||
2c73f9f5 | 1005 | for (; fns; fns = OVL_NEXT (fns)) |
386b8a85 | 1006 | { |
75650646 MM |
1007 | tree tmpl; |
1008 | ||
9dfce8fd | 1009 | tree fn = OVL_CURRENT (fns); |
03017874 MM |
1010 | |
1011 | if (TREE_CODE (fn) == TEMPLATE_DECL) | |
1012 | /* DECL might be a specialization of FN. */ | |
1013 | tmpl = fn; | |
1014 | else if (need_member_template) | |
1015 | /* FN is an ordinary member function, and we need a | |
1016 | specialization of a member template. */ | |
1017 | continue; | |
1018 | else if (TREE_CODE (fn) != FUNCTION_DECL) | |
1019 | /* We can get IDENTIFIER_NODEs here in certain erroneous | |
1020 | cases. */ | |
1021 | continue; | |
1022 | else if (!DECL_FUNCTION_MEMBER_P (fn)) | |
1023 | /* This is just an ordinary non-member function. Nothing can | |
1024 | be a specialization of that. */ | |
1025 | continue; | |
3b82c249 KL |
1026 | else if (DECL_ARTIFICIAL (fn)) |
1027 | /* Cannot specialize functions that are created implicitly. */ | |
1028 | continue; | |
75650646 | 1029 | else |
03017874 MM |
1030 | { |
1031 | tree decl_arg_types; | |
386b8a85 | 1032 | |
03017874 MM |
1033 | /* This is an ordinary member function. However, since |
1034 | we're here, we can assume it's enclosing class is a | |
1035 | template class. For example, | |
1036 | ||
1037 | template <typename T> struct S { void f(); }; | |
1038 | template <> void S<int>::f() {} | |
1039 | ||
1040 | Here, S<int>::f is a non-template, but S<int> is a | |
1041 | template class. If FN has the same type as DECL, we | |
1042 | might be in business. */ | |
1043 | if (!same_type_p (TREE_TYPE (TREE_TYPE (decl)), | |
1044 | TREE_TYPE (TREE_TYPE (fn)))) | |
1045 | /* The return types differ. */ | |
1046 | continue; | |
1047 | ||
1048 | /* Adjust the type of DECL in case FN is a static member. */ | |
1049 | decl_arg_types = TYPE_ARG_TYPES (TREE_TYPE (decl)); | |
1050 | if (DECL_STATIC_FUNCTION_P (fn) | |
1051 | && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl)) | |
1052 | decl_arg_types = TREE_CHAIN (decl_arg_types); | |
1053 | ||
1054 | if (compparms (TYPE_ARG_TYPES (TREE_TYPE (fn)), | |
1055 | decl_arg_types)) | |
1056 | /* They match! */ | |
1057 | candidates = tree_cons (NULL_TREE, fn, candidates); | |
1058 | ||
1059 | continue; | |
1060 | } | |
386b8a85 | 1061 | |
bf8f3f93 MM |
1062 | /* See whether this function might be a specialization of this |
1063 | template. */ | |
1064 | targs = get_bindings (tmpl, decl, explicit_targs); | |
03017874 MM |
1065 | |
1066 | if (!targs) | |
bf8f3f93 | 1067 | /* We cannot deduce template arguments that when used to |
03017874 MM |
1068 | specialize TMPL will produce DECL. */ |
1069 | continue; | |
1070 | ||
1071 | /* Save this template, and the arguments deduced. */ | |
e1b3e07d | 1072 | templates = tree_cons (targs, tmpl, templates); |
386b8a85 | 1073 | } |
03017874 | 1074 | |
bf8f3f93 | 1075 | if (templates && TREE_CHAIN (templates)) |
386b8a85 | 1076 | { |
03017874 MM |
1077 | /* We have: |
1078 | ||
1079 | [temp.expl.spec] | |
1080 | ||
1081 | It is possible for a specialization with a given function | |
1082 | signature to be instantiated from more than one function | |
1083 | template. In such cases, explicit specification of the | |
1084 | template arguments must be used to uniquely identify the | |
1085 | function template specialization being specialized. | |
1086 | ||
1087 | Note that here, there's no suggestion that we're supposed to | |
1088 | determine which of the candidate templates is most | |
1089 | specialized. However, we, also have: | |
1090 | ||
1091 | [temp.func.order] | |
1092 | ||
1093 | Partial ordering of overloaded function template | |
1094 | declarations is used in the following contexts to select | |
1095 | the function template to which a function template | |
1096 | specialization refers: | |
1097 | ||
1098 | -- when an explicit specialization refers to a function | |
1099 | template. | |
1100 | ||
1101 | So, we do use the partial ordering rules, at least for now. | |
1102 | This extension can only serve to make illegal programs legal, | |
1103 | so it's safe. And, there is strong anecdotal evidence that | |
1104 | the committee intended the partial ordering rules to apply; | |
1105 | the EDG front-end has that behavior, and John Spicer claims | |
1106 | that the committee simply forgot to delete the wording in | |
1107 | [temp.expl.spec]. */ | |
1108 | tree tmpl = most_specialized (templates, decl, explicit_targs); | |
1109 | if (tmpl && tmpl != error_mark_node) | |
1110 | { | |
1111 | targs = get_bindings (tmpl, decl, explicit_targs); | |
e1b3e07d | 1112 | templates = tree_cons (targs, tmpl, NULL_TREE); |
03017874 | 1113 | } |
e1467ff2 MM |
1114 | } |
1115 | ||
03017874 | 1116 | if (templates == NULL_TREE && candidates == NULL_TREE) |
e1467ff2 | 1117 | { |
bf8f3f93 MM |
1118 | cp_error_at ("template-id `%D' for `%+D' does not match any template declaration", |
1119 | template_id, decl); | |
03017874 | 1120 | return error_mark_node; |
386b8a85 | 1121 | } |
03017874 | 1122 | else if ((templates && TREE_CHAIN (templates)) |
bf8f3f93 MM |
1123 | || (candidates && TREE_CHAIN (candidates)) |
1124 | || (templates && candidates)) | |
386b8a85 | 1125 | { |
bf8f3f93 MM |
1126 | cp_error_at ("ambiguous template specialization `%D' for `%+D'", |
1127 | template_id, decl); | |
1128 | chainon (candidates, templates); | |
1129 | print_candidates (candidates); | |
03017874 | 1130 | return error_mark_node; |
386b8a85 JM |
1131 | } |
1132 | ||
1133 | /* We have one, and exactly one, match. */ | |
03017874 MM |
1134 | if (candidates) |
1135 | { | |
1136 | /* It was a specialization of an ordinary member function in a | |
1137 | template class. */ | |
1138 | *targs_out = copy_node (DECL_TI_ARGS (TREE_VALUE (candidates))); | |
1139 | return DECL_TI_TEMPLATE (TREE_VALUE (candidates)); | |
1140 | } | |
1141 | ||
1142 | /* It was a specialization of a template. */ | |
17aec3eb | 1143 | targs = DECL_TI_ARGS (DECL_TEMPLATE_RESULT (TREE_VALUE (templates))); |
03017874 MM |
1144 | if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (targs)) |
1145 | { | |
1146 | *targs_out = copy_node (targs); | |
1147 | SET_TMPL_ARGS_LEVEL (*targs_out, | |
1148 | TMPL_ARGS_DEPTH (*targs_out), | |
1149 | TREE_PURPOSE (templates)); | |
1150 | } | |
1151 | else | |
1152 | *targs_out = TREE_PURPOSE (templates); | |
e1467ff2 | 1153 | return TREE_VALUE (templates); |
8d08fdba | 1154 | } |
8afa707f MM |
1155 | |
1156 | /* Returns a chain of parameter types, exactly like the SPEC_TYPES, | |
1157 | but with the default argument values filled in from those in the | |
1158 | TMPL_TYPES. */ | |
6757edfe | 1159 | |
8afa707f MM |
1160 | static tree |
1161 | copy_default_args_to_explicit_spec_1 (spec_types, | |
1162 | tmpl_types) | |
1163 | tree spec_types; | |
1164 | tree tmpl_types; | |
1165 | { | |
1166 | tree new_spec_types; | |
1167 | ||
1168 | if (!spec_types) | |
1169 | return NULL_TREE; | |
1170 | ||
1171 | if (spec_types == void_list_node) | |
1172 | return void_list_node; | |
1173 | ||
1174 | /* Substitute into the rest of the list. */ | |
1175 | new_spec_types = | |
1176 | copy_default_args_to_explicit_spec_1 (TREE_CHAIN (spec_types), | |
1177 | TREE_CHAIN (tmpl_types)); | |
1178 | ||
1179 | /* Add the default argument for this parameter. */ | |
1180 | return hash_tree_cons (TREE_PURPOSE (tmpl_types), | |
1181 | TREE_VALUE (spec_types), | |
1182 | new_spec_types); | |
1183 | } | |
1184 | ||
1185 | /* DECL is an explicit specialization. Replicate default arguments | |
1186 | from the template it specializes. (That way, code like: | |
1187 | ||
1188 | template <class T> void f(T = 3); | |
1189 | template <> void f(double); | |
1190 | void g () { f (); } | |
1191 | ||
1192 | works, as required.) An alternative approach would be to look up | |
1193 | the correct default arguments at the call-site, but this approach | |
1194 | is consistent with how implicit instantiations are handled. */ | |
1195 | ||
1196 | static void | |
1197 | copy_default_args_to_explicit_spec (decl) | |
1198 | tree decl; | |
1199 | { | |
1200 | tree tmpl; | |
1201 | tree spec_types; | |
1202 | tree tmpl_types; | |
1203 | tree new_spec_types; | |
1204 | tree old_type; | |
1205 | tree new_type; | |
1206 | tree t; | |
08c2df0f NS |
1207 | tree object_type = NULL_TREE; |
1208 | tree in_charge = NULL_TREE; | |
e0fff4b3 | 1209 | tree vtt = NULL_TREE; |
8afa707f MM |
1210 | |
1211 | /* See if there's anything we need to do. */ | |
1212 | tmpl = DECL_TI_TEMPLATE (decl); | |
1213 | tmpl_types = TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (tmpl))); | |
1214 | for (t = tmpl_types; t; t = TREE_CHAIN (t)) | |
1215 | if (TREE_PURPOSE (t)) | |
1216 | break; | |
1217 | if (!t) | |
1218 | return; | |
1219 | ||
1220 | old_type = TREE_TYPE (decl); | |
1221 | spec_types = TYPE_ARG_TYPES (old_type); | |
1222 | ||
8afa707f MM |
1223 | if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl)) |
1224 | { | |
08c2df0f NS |
1225 | /* Remove the this pointer, but remember the object's type for |
1226 | CV quals. */ | |
1227 | object_type = TREE_TYPE (TREE_VALUE (spec_types)); | |
8afa707f MM |
1228 | spec_types = TREE_CHAIN (spec_types); |
1229 | tmpl_types = TREE_CHAIN (tmpl_types); | |
08c2df0f | 1230 | |
8afa707f | 1231 | if (DECL_HAS_IN_CHARGE_PARM_P (decl)) |
08c2df0f NS |
1232 | { |
1233 | /* DECL may contain more parameters than TMPL due to the extra | |
1234 | in-charge parameter in constructors and destructors. */ | |
1235 | in_charge = spec_types; | |
1236 | spec_types = TREE_CHAIN (spec_types); | |
1237 | } | |
e0fff4b3 JM |
1238 | if (DECL_HAS_VTT_PARM_P (decl)) |
1239 | { | |
1240 | vtt = spec_types; | |
1241 | spec_types = TREE_CHAIN (spec_types); | |
1242 | } | |
8afa707f MM |
1243 | } |
1244 | ||
1245 | /* Compute the merged default arguments. */ | |
1246 | new_spec_types = | |
1247 | copy_default_args_to_explicit_spec_1 (spec_types, tmpl_types); | |
1248 | ||
08c2df0f NS |
1249 | /* Compute the new FUNCTION_TYPE. */ |
1250 | if (object_type) | |
8afa707f | 1251 | { |
e0fff4b3 JM |
1252 | if (vtt) |
1253 | new_spec_types = hash_tree_cons (TREE_PURPOSE (vtt), | |
1254 | TREE_VALUE (vtt), | |
1255 | new_spec_types); | |
1256 | ||
08c2df0f NS |
1257 | if (in_charge) |
1258 | /* Put the in-charge parameter back. */ | |
1259 | new_spec_types = hash_tree_cons (TREE_PURPOSE (in_charge), | |
1260 | TREE_VALUE (in_charge), | |
1261 | new_spec_types); | |
1262 | ||
1263 | new_type = build_cplus_method_type (object_type, | |
1264 | TREE_TYPE (old_type), | |
1265 | new_spec_types); | |
8afa707f | 1266 | } |
8afa707f MM |
1267 | else |
1268 | new_type = build_function_type (TREE_TYPE (old_type), | |
08c2df0f | 1269 | new_spec_types); |
8afa707f MM |
1270 | new_type = build_type_attribute_variant (new_type, |
1271 | TYPE_ATTRIBUTES (old_type)); | |
1272 | new_type = build_exception_variant (new_type, | |
1273 | TYPE_RAISES_EXCEPTIONS (old_type)); | |
1274 | TREE_TYPE (decl) = new_type; | |
1275 | } | |
1276 | ||
386b8a85 | 1277 | /* Check to see if the function just declared, as indicated in |
75650646 MM |
1278 | DECLARATOR, and in DECL, is a specialization of a function |
1279 | template. We may also discover that the declaration is an explicit | |
1280 | instantiation at this point. | |
1281 | ||
e1467ff2 | 1282 | Returns DECL, or an equivalent declaration that should be used |
03017874 MM |
1283 | instead if all goes well. Issues an error message if something is |
1284 | amiss. Returns error_mark_node if the error is not easily | |
1285 | recoverable. | |
75650646 | 1286 | |
75650646 MM |
1287 | FLAGS is a bitmask consisting of the following flags: |
1288 | ||
75650646 MM |
1289 | 2: The function has a definition. |
1290 | 4: The function is a friend. | |
75650646 MM |
1291 | |
1292 | The TEMPLATE_COUNT is the number of references to qualifying | |
1293 | template classes that appeared in the name of the function. For | |
1294 | example, in | |
1295 | ||
1296 | template <class T> struct S { void f(); }; | |
1297 | void S<int>::f(); | |
1298 | ||
1299 | the TEMPLATE_COUNT would be 1. However, explicitly specialized | |
1300 | classes are not counted in the TEMPLATE_COUNT, so that in | |
1301 | ||
1302 | template <class T> struct S {}; | |
1303 | template <> struct S<int> { void f(); } | |
36a117a5 | 1304 | template <> void S<int>::f(); |
75650646 MM |
1305 | |
1306 | the TEMPLATE_COUNT would be 0. (Note that this declaration is | |
1307 | illegal; there should be no template <>.) | |
1308 | ||
1309 | If the function is a specialization, it is marked as such via | |
1310 | DECL_TEMPLATE_SPECIALIZATION. Furthermore, its DECL_TEMPLATE_INFO | |
1311 | is set up correctly, and it is added to the list of specializations | |
1312 | for that template. */ | |
386b8a85 | 1313 | |
e1467ff2 | 1314 | tree |
27bb8339 | 1315 | check_explicit_specialization (declarator, decl, template_count, flags) |
386b8a85 JM |
1316 | tree declarator; |
1317 | tree decl; | |
1318 | int template_count; | |
1319 | int flags; | |
1320 | { | |
75650646 MM |
1321 | int have_def = flags & 2; |
1322 | int is_friend = flags & 4; | |
1323 | int specialization = 0; | |
e1467ff2 | 1324 | int explicit_instantiation = 0; |
fd4de5ff | 1325 | int member_specialization = 0; |
75650646 MM |
1326 | tree ctype = DECL_CLASS_CONTEXT (decl); |
1327 | tree dname = DECL_NAME (decl); | |
74b846e0 | 1328 | tmpl_spec_kind tsk; |
386b8a85 | 1329 | |
74b846e0 | 1330 | tsk = current_tmpl_spec_kind (template_count); |
75650646 | 1331 | |
74b846e0 MM |
1332 | switch (tsk) |
1333 | { | |
1334 | case tsk_none: | |
1335 | if (processing_specialization) | |
75650646 | 1336 | { |
fd4de5ff MM |
1337 | specialization = 1; |
1338 | SET_DECL_TEMPLATE_SPECIALIZATION (decl); | |
75650646 | 1339 | } |
74b846e0 | 1340 | else if (TREE_CODE (declarator) == TEMPLATE_ID_EXPR) |
386b8a85 | 1341 | { |
74b846e0 MM |
1342 | if (is_friend) |
1343 | /* This could be something like: | |
75650646 | 1344 | |
74b846e0 MM |
1345 | template <class T> void f(T); |
1346 | class S { friend void f<>(int); } */ | |
1347 | specialization = 1; | |
1348 | else | |
1349 | { | |
1350 | /* This case handles bogus declarations like template <> | |
1351 | template <class T> void f<int>(); */ | |
1352 | ||
1353 | cp_error ("template-id `%D' in declaration of primary template", | |
1354 | declarator); | |
1355 | return decl; | |
1356 | } | |
1357 | } | |
1358 | break; | |
1359 | ||
1360 | case tsk_invalid_member_spec: | |
1361 | /* The error has already been reported in | |
1362 | check_specialization_scope. */ | |
1363 | return error_mark_node; | |
1364 | ||
1365 | case tsk_invalid_expl_inst: | |
1366 | cp_error ("template parameter list used in explicit instantiation"); | |
1367 | ||
1368 | /* Fall through. */ | |
1369 | ||
1370 | case tsk_expl_inst: | |
fd4de5ff MM |
1371 | if (have_def) |
1372 | cp_error ("definition provided for explicit instantiation"); | |
74b846e0 | 1373 | |
fd4de5ff | 1374 | explicit_instantiation = 1; |
74b846e0 | 1375 | break; |
fd4de5ff | 1376 | |
74b846e0 MM |
1377 | case tsk_excessive_parms: |
1378 | cp_error ("too many template parameter lists in declaration of `%D'", | |
1379 | decl); | |
1380 | return error_mark_node; | |
75650646 | 1381 | |
74b846e0 MM |
1382 | /* Fall through. */ |
1383 | case tsk_expl_spec: | |
1384 | SET_DECL_TEMPLATE_SPECIALIZATION (decl); | |
1385 | if (ctype) | |
1386 | member_specialization = 1; | |
1387 | else | |
1388 | specialization = 1; | |
1389 | break; | |
1390 | ||
1391 | case tsk_insufficient_parms: | |
fd4de5ff MM |
1392 | if (template_header_count) |
1393 | { | |
74b846e0 MM |
1394 | cp_error("too few template parameter lists in declaration of `%D'", |
1395 | decl); | |
fd4de5ff | 1396 | return decl; |
c6f2ed0d | 1397 | } |
74b846e0 MM |
1398 | else if (ctype != NULL_TREE |
1399 | && !TYPE_BEING_DEFINED (ctype) | |
1400 | && CLASSTYPE_TEMPLATE_INSTANTIATION (ctype) | |
1401 | && !is_friend) | |
1402 | { | |
1403 | /* For backwards compatibility, we accept: | |
fd4de5ff | 1404 | |
74b846e0 MM |
1405 | template <class T> struct S { void f(); }; |
1406 | void S<int>::f() {} // Missing template <> | |
fd4de5ff | 1407 | |
74b846e0 MM |
1408 | That used to be legal C++. */ |
1409 | if (pedantic) | |
1410 | cp_pedwarn | |
1411 | ("explicit specialization not preceded by `template <>'"); | |
1412 | specialization = 1; | |
1413 | SET_DECL_TEMPLATE_SPECIALIZATION (decl); | |
1414 | } | |
1415 | break; | |
1416 | ||
1417 | case tsk_template: | |
1418 | if (TREE_CODE (declarator) == TEMPLATE_ID_EXPR) | |
c6f2ed0d | 1419 | { |
fd4de5ff MM |
1420 | /* This case handles bogus declarations like template <> |
1421 | template <class T> void f<int>(); */ | |
75650646 | 1422 | |
655dc6ee JM |
1423 | if (uses_template_parms (declarator)) |
1424 | cp_error ("partial specialization `%D' of function template", | |
1425 | declarator); | |
1426 | else | |
1427 | cp_error ("template-id `%D' in declaration of primary template", | |
1428 | declarator); | |
fd4de5ff | 1429 | return decl; |
386b8a85 | 1430 | } |
74b846e0 MM |
1431 | |
1432 | if (ctype && CLASSTYPE_TEMPLATE_INSTANTIATION (ctype)) | |
1433 | /* This is a specialization of a member template, without | |
1434 | specialization the containing class. Something like: | |
1435 | ||
1436 | template <class T> struct S { | |
1437 | template <class U> void f (U); | |
1438 | }; | |
1439 | template <> template <class U> void S<int>::f(U) {} | |
1440 | ||
1441 | That's a specialization -- but of the entire template. */ | |
1442 | specialization = 1; | |
1443 | break; | |
1444 | ||
1445 | default: | |
1446 | my_friendly_abort (20000309); | |
75650646 | 1447 | } |
386b8a85 | 1448 | |
670960ac JM |
1449 | if (specialization || member_specialization) |
1450 | { | |
1451 | tree t = TYPE_ARG_TYPES (TREE_TYPE (decl)); | |
1452 | for (; t; t = TREE_CHAIN (t)) | |
1453 | if (TREE_PURPOSE (t)) | |
1454 | { | |
8251199e JM |
1455 | cp_pedwarn |
1456 | ("default argument specified in explicit specialization"); | |
670960ac JM |
1457 | break; |
1458 | } | |
f3400fe2 JM |
1459 | if (current_lang_name == lang_name_c) |
1460 | cp_error ("template specialization with C linkage"); | |
670960ac JM |
1461 | } |
1462 | ||
e1467ff2 | 1463 | if (specialization || member_specialization || explicit_instantiation) |
75650646 MM |
1464 | { |
1465 | tree tmpl = NULL_TREE; | |
1466 | tree targs = NULL_TREE; | |
75650646 MM |
1467 | |
1468 | /* Make sure that the declarator is a TEMPLATE_ID_EXPR. */ | |
386b8a85 JM |
1469 | if (TREE_CODE (declarator) != TEMPLATE_ID_EXPR) |
1470 | { | |
1471 | tree fns; | |
1472 | ||
1473 | my_friendly_assert (TREE_CODE (declarator) == IDENTIFIER_NODE, | |
1474 | 0); | |
1475 | if (!ctype) | |
30394414 | 1476 | fns = IDENTIFIER_NAMESPACE_VALUE (dname); |
386b8a85 JM |
1477 | else |
1478 | fns = dname; | |
1479 | ||
75650646 MM |
1480 | declarator = |
1481 | lookup_template_function (fns, NULL_TREE); | |
386b8a85 JM |
1482 | } |
1483 | ||
f2e48b67 BK |
1484 | if (declarator == error_mark_node) |
1485 | return error_mark_node; | |
1486 | ||
75650646 MM |
1487 | if (ctype != NULL_TREE && TYPE_BEING_DEFINED (ctype)) |
1488 | { | |
8ec2ac34 | 1489 | if (!explicit_instantiation) |
6c30752f MM |
1490 | /* A specialization in class scope. This is illegal, |
1491 | but the error will already have been flagged by | |
1492 | check_specialization_scope. */ | |
1493 | return error_mark_node; | |
8ec2ac34 | 1494 | else |
b370501f KG |
1495 | { |
1496 | /* It's not legal to write an explicit instantiation in | |
1497 | class scope, e.g.: | |
8ec2ac34 | 1498 | |
b370501f | 1499 | class C { template void f(); } |
8ec2ac34 | 1500 | |
b370501f KG |
1501 | This case is caught by the parser. However, on |
1502 | something like: | |
8ec2ac34 | 1503 | |
b370501f | 1504 | template class C { void f(); }; |
8ec2ac34 | 1505 | |
b370501f KG |
1506 | (which is illegal) we can get here. The error will be |
1507 | issued later. */ | |
1508 | ; | |
1509 | } | |
8ec2ac34 | 1510 | |
e1467ff2 | 1511 | return decl; |
75650646 | 1512 | } |
8f032717 MM |
1513 | else if (TREE_CODE (TREE_OPERAND (declarator, 0)) == LOOKUP_EXPR) |
1514 | { | |
1515 | /* A friend declaration. We can't do much, because we don't | |
08c2df0f | 1516 | know what this resolves to, yet. */ |
8f032717 MM |
1517 | my_friendly_assert (is_friend != 0, 0); |
1518 | my_friendly_assert (!explicit_instantiation, 0); | |
1519 | SET_DECL_IMPLICIT_INSTANTIATION (decl); | |
1520 | return decl; | |
1521 | } | |
75650646 MM |
1522 | else if (ctype != NULL_TREE |
1523 | && (TREE_CODE (TREE_OPERAND (declarator, 0)) == | |
1524 | IDENTIFIER_NODE)) | |
386b8a85 | 1525 | { |
75650646 MM |
1526 | /* Find the list of functions in ctype that have the same |
1527 | name as the declared function. */ | |
1528 | tree name = TREE_OPERAND (declarator, 0); | |
03017874 MM |
1529 | tree fns = NULL_TREE; |
1530 | int idx; | |
1531 | ||
75650646 MM |
1532 | if (name == constructor_name (ctype) |
1533 | || name == constructor_name_full (ctype)) | |
386b8a85 | 1534 | { |
75650646 MM |
1535 | int is_constructor = DECL_CONSTRUCTOR_P (decl); |
1536 | ||
1537 | if (is_constructor ? !TYPE_HAS_CONSTRUCTOR (ctype) | |
1538 | : !TYPE_HAS_DESTRUCTOR (ctype)) | |
1539 | { | |
1540 | /* From [temp.expl.spec]: | |
e1467ff2 | 1541 | |
75650646 MM |
1542 | If such an explicit specialization for the member |
1543 | of a class template names an implicitly-declared | |
1544 | special member function (clause _special_), the | |
e1467ff2 MM |
1545 | program is ill-formed. |
1546 | ||
1547 | Similar language is found in [temp.explicit]. */ | |
8251199e | 1548 | cp_error ("specialization of implicitly-declared special member function"); |
03017874 | 1549 | return error_mark_node; |
75650646 | 1550 | } |
386b8a85 | 1551 | |
42da2fd8 | 1552 | name = is_constructor ? ctor_identifier : dtor_identifier; |
75650646 | 1553 | } |
42da2fd8 | 1554 | |
421844e7 | 1555 | if (!DECL_CONV_FN_P (decl)) |
03017874 MM |
1556 | { |
1557 | idx = lookup_fnfields_1 (ctype, name); | |
1558 | if (idx >= 0) | |
1559 | fns = TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (ctype), idx); | |
1560 | } | |
1561 | else | |
1562 | { | |
1563 | tree methods; | |
1564 | ||
1565 | /* For a type-conversion operator, we cannot do a | |
1566 | name-based lookup. We might be looking for `operator | |
1567 | int' which will be a specialization of `operator T'. | |
1568 | So, we find *all* the conversion operators, and then | |
1569 | select from them. */ | |
1570 | fns = NULL_TREE; | |
1571 | ||
1572 | methods = CLASSTYPE_METHOD_VEC (ctype); | |
1573 | if (methods) | |
1574 | for (idx = 2; idx < TREE_VEC_LENGTH (methods); ++idx) | |
1575 | { | |
1576 | tree ovl = TREE_VEC_ELT (methods, idx); | |
1577 | ||
1578 | if (!ovl || !DECL_CONV_FN_P (OVL_CURRENT (ovl))) | |
1579 | /* There are no more conversion functions. */ | |
1580 | break; | |
1581 | ||
1582 | /* Glue all these conversion functions together | |
1583 | with those we already have. */ | |
1584 | for (; ovl; ovl = OVL_NEXT (ovl)) | |
1585 | fns = ovl_cons (OVL_CURRENT (ovl), fns); | |
1586 | } | |
1587 | } | |
1588 | ||
386b8a85 JM |
1589 | if (fns == NULL_TREE) |
1590 | { | |
b3f738da MM |
1591 | cp_error ("no member function `%D' declared in `%T'", |
1592 | name, ctype); | |
03017874 | 1593 | return error_mark_node; |
386b8a85 JM |
1594 | } |
1595 | else | |
1596 | TREE_OPERAND (declarator, 0) = fns; | |
1597 | } | |
75650646 | 1598 | |
e1467ff2 MM |
1599 | /* Figure out what exactly is being specialized at this point. |
1600 | Note that for an explicit instantiation, even one for a | |
38e01259 | 1601 | member function, we cannot tell apriori whether the |
e1467ff2 | 1602 | instantiation is for a member template, or just a member |
36a117a5 MM |
1603 | function of a template class. Even if a member template is |
1604 | being instantiated, the member template arguments may be | |
1605 | elided if they can be deduced from the rest of the | |
1606 | declaration. */ | |
e1467ff2 MM |
1607 | tmpl = determine_specialization (declarator, decl, |
1608 | &targs, | |
bf8f3f93 | 1609 | member_specialization); |
386b8a85 | 1610 | |
03017874 MM |
1611 | if (!tmpl || tmpl == error_mark_node) |
1612 | /* We couldn't figure out what this declaration was | |
1613 | specializing. */ | |
1614 | return error_mark_node; | |
1615 | else | |
386b8a85 | 1616 | { |
25aab5d0 | 1617 | tree gen_tmpl = most_general_template (tmpl); |
36a117a5 | 1618 | |
e1467ff2 MM |
1619 | if (explicit_instantiation) |
1620 | { | |
03d0f4af | 1621 | /* We don't set DECL_EXPLICIT_INSTANTIATION here; that |
25aab5d0 MM |
1622 | is done by do_decl_instantiation later. */ |
1623 | ||
1624 | int arg_depth = TMPL_ARGS_DEPTH (targs); | |
1625 | int parm_depth = TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl)); | |
1626 | ||
1627 | if (arg_depth > parm_depth) | |
1628 | { | |
1629 | /* If TMPL is not the most general template (for | |
1630 | example, if TMPL is a friend template that is | |
1631 | injected into namespace scope), then there will | |
dc957d14 | 1632 | be too many levels of TARGS. Remove some of them |
25aab5d0 MM |
1633 | here. */ |
1634 | int i; | |
1635 | tree new_targs; | |
1636 | ||
f31c0a32 | 1637 | new_targs = make_tree_vec (parm_depth); |
25aab5d0 MM |
1638 | for (i = arg_depth - parm_depth; i < arg_depth; ++i) |
1639 | TREE_VEC_ELT (new_targs, i - (arg_depth - parm_depth)) | |
1640 | = TREE_VEC_ELT (targs, i); | |
1641 | targs = new_targs; | |
1642 | } | |
1643 | ||
74b846e0 | 1644 | return instantiate_template (tmpl, targs); |
e1467ff2 | 1645 | } |
74b846e0 | 1646 | |
f9a7ae04 MM |
1647 | /* If this is a specialization of a member template of a |
1648 | template class. In we want to return the TEMPLATE_DECL, | |
1649 | not the specialization of it. */ | |
74b846e0 MM |
1650 | if (tsk == tsk_template) |
1651 | { | |
1652 | SET_DECL_TEMPLATE_SPECIALIZATION (tmpl); | |
f9a7ae04 | 1653 | DECL_INITIAL (DECL_TEMPLATE_RESULT (tmpl)) = NULL_TREE; |
74b846e0 MM |
1654 | return tmpl; |
1655 | } | |
1656 | ||
08c2df0f | 1657 | /* If we thought that the DECL was a member function, but it |
36a117a5 MM |
1658 | turns out to be specializing a static member function, |
1659 | make DECL a static member function as well. */ | |
1660 | if (DECL_STATIC_FUNCTION_P (tmpl) | |
1661 | && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl)) | |
366c0f1e | 1662 | { |
3afb32a4 | 1663 | revert_static_member_fn (decl); |
366c0f1e MM |
1664 | last_function_parms = TREE_CHAIN (last_function_parms); |
1665 | } | |
e1467ff2 | 1666 | |
36a117a5 | 1667 | /* Set up the DECL_TEMPLATE_INFO for DECL. */ |
e1b3e07d | 1668 | DECL_TEMPLATE_INFO (decl) = tree_cons (tmpl, targs, NULL_TREE); |
36a117a5 | 1669 | |
8afa707f MM |
1670 | /* Inherit default function arguments from the template |
1671 | DECL is specializing. */ | |
1672 | copy_default_args_to_explicit_spec (decl); | |
1673 | ||
c750255c MM |
1674 | /* This specialization has the same protection as the |
1675 | template it specializes. */ | |
1676 | TREE_PRIVATE (decl) = TREE_PRIVATE (gen_tmpl); | |
1677 | TREE_PROTECTED (decl) = TREE_PROTECTED (gen_tmpl); | |
1678 | ||
386b8a85 | 1679 | if (is_friend && !have_def) |
36a117a5 MM |
1680 | /* This is not really a declaration of a specialization. |
1681 | It's just the name of an instantiation. But, it's not | |
1682 | a request for an instantiation, either. */ | |
fbf1c34b | 1683 | SET_DECL_IMPLICIT_INSTANTIATION (decl); |
08511114 KL |
1684 | else if (DECL_CONSTRUCTOR_P (decl) || DECL_DESTRUCTOR_P (decl)) |
1685 | /* This is indeed a specialization. In case of constructors | |
1686 | and destructors, we need in-charge and not-in-charge | |
1687 | versions in V3 ABI. */ | |
1688 | clone_function_decl (decl, /*update_method_vec_p=*/0); | |
75650646 | 1689 | |
36a117a5 MM |
1690 | /* Register this specialization so that we can find it |
1691 | again. */ | |
1692 | decl = register_specialization (decl, gen_tmpl, targs); | |
386b8a85 JM |
1693 | } |
1694 | } | |
75650646 | 1695 | |
e1467ff2 | 1696 | return decl; |
386b8a85 | 1697 | } |
75650646 | 1698 | |
39c01e4c MM |
1699 | /* TYPE is being declared. Verify that the use of template headers |
1700 | and such is reasonable. Issue error messages if not. */ | |
1701 | ||
1702 | void | |
1703 | maybe_check_template_type (type) | |
1704 | tree type; | |
1705 | { | |
1706 | if (template_header_count) | |
1707 | { | |
1708 | /* We are in the scope of some `template <...>' header. */ | |
1709 | ||
1710 | int context_depth | |
1711 | = template_class_depth_real (TYPE_CONTEXT (type), | |
1712 | /*count_specializations=*/1); | |
1713 | ||
1714 | if (template_header_count <= context_depth) | |
1715 | /* This is OK; the template headers are for the context. We | |
1716 | are actually too lenient here; like | |
1717 | check_explicit_specialization we should consider the number | |
1718 | of template types included in the actual declaration. For | |
1719 | example, | |
1720 | ||
1721 | template <class T> struct S { | |
1722 | template <class U> template <class V> | |
1723 | struct I {}; | |
1724 | }; | |
1725 | ||
1726 | is illegal, but: | |
1727 | ||
1728 | template <class T> struct S { | |
1729 | template <class U> struct I; | |
1730 | }; | |
1731 | ||
1732 | template <class T> template <class U. | |
1733 | struct S<T>::I {}; | |
1734 | ||
1735 | is not. */ | |
1736 | ; | |
1737 | else if (template_header_count > context_depth + 1) | |
1738 | /* There are two many template parameter lists. */ | |
8251199e | 1739 | cp_error ("too many template parameter lists in declaration of `%T'", type); |
39c01e4c MM |
1740 | } |
1741 | } | |
1742 | ||
75650646 MM |
1743 | /* Returns 1 iff PARMS1 and PARMS2 are identical sets of template |
1744 | parameters. These are represented in the same format used for | |
1745 | DECL_TEMPLATE_PARMS. */ | |
1746 | ||
1747 | int comp_template_parms (parms1, parms2) | |
1748 | tree parms1; | |
1749 | tree parms2; | |
1750 | { | |
1751 | tree p1; | |
1752 | tree p2; | |
1753 | ||
1754 | if (parms1 == parms2) | |
1755 | return 1; | |
1756 | ||
1757 | for (p1 = parms1, p2 = parms2; | |
1758 | p1 != NULL_TREE && p2 != NULL_TREE; | |
1759 | p1 = TREE_CHAIN (p1), p2 = TREE_CHAIN (p2)) | |
1760 | { | |
1761 | tree t1 = TREE_VALUE (p1); | |
1762 | tree t2 = TREE_VALUE (p2); | |
1763 | int i; | |
1764 | ||
1765 | my_friendly_assert (TREE_CODE (t1) == TREE_VEC, 0); | |
1766 | my_friendly_assert (TREE_CODE (t2) == TREE_VEC, 0); | |
1767 | ||
1768 | if (TREE_VEC_LENGTH (t1) != TREE_VEC_LENGTH (t2)) | |
1769 | return 0; | |
1770 | ||
1771 | for (i = 0; i < TREE_VEC_LENGTH (t2); ++i) | |
1772 | { | |
1773 | tree parm1 = TREE_VALUE (TREE_VEC_ELT (t1, i)); | |
1774 | tree parm2 = TREE_VALUE (TREE_VEC_ELT (t2, i)); | |
1775 | ||
1776 | if (TREE_CODE (parm1) != TREE_CODE (parm2)) | |
1777 | return 0; | |
1778 | ||
1779 | if (TREE_CODE (parm1) == TEMPLATE_TYPE_PARM) | |
1780 | continue; | |
3bfdc719 | 1781 | else if (!same_type_p (TREE_TYPE (parm1), TREE_TYPE (parm2))) |
75650646 MM |
1782 | return 0; |
1783 | } | |
1784 | } | |
1785 | ||
1786 | if ((p1 != NULL_TREE) != (p2 != NULL_TREE)) | |
1787 | /* One set of parameters has more parameters lists than the | |
1788 | other. */ | |
1789 | return 0; | |
1790 | ||
1791 | return 1; | |
1792 | } | |
1793 | ||
f3400fe2 JM |
1794 | /* Complain if DECL shadows a template parameter. |
1795 | ||
1796 | [temp.local]: A template-parameter shall not be redeclared within its | |
1797 | scope (including nested scopes). */ | |
1798 | ||
1799 | void | |
1800 | check_template_shadow (decl) | |
1801 | tree decl; | |
1802 | { | |
8f032717 MM |
1803 | tree olddecl; |
1804 | ||
b5d9b9ab MM |
1805 | /* If we're not in a template, we can't possibly shadow a template |
1806 | parameter. */ | |
1807 | if (!current_template_parms) | |
1808 | return; | |
1809 | ||
1810 | /* Figure out what we're shadowing. */ | |
8f032717 MM |
1811 | if (TREE_CODE (decl) == OVERLOAD) |
1812 | decl = OVL_CURRENT (decl); | |
1813 | olddecl = IDENTIFIER_VALUE (DECL_NAME (decl)); | |
f3400fe2 | 1814 | |
b5d9b9ab MM |
1815 | /* If there's no previous binding for this name, we're not shadowing |
1816 | anything, let alone a template parameter. */ | |
1817 | if (!olddecl) | |
1818 | return; | |
1819 | ||
1820 | /* If we're not shadowing a template parameter, we're done. Note | |
1821 | that OLDDECL might be an OVERLOAD (or perhaps even an | |
1822 | ERROR_MARK), so we can't just blithely assume it to be a _DECL | |
1823 | node. */ | |
2f939d94 | 1824 | if (!DECL_P (olddecl) || !DECL_TEMPLATE_PARM_P (olddecl)) |
b5d9b9ab MM |
1825 | return; |
1826 | ||
1827 | /* We check for decl != olddecl to avoid bogus errors for using a | |
1828 | name inside a class. We check TPFI to avoid duplicate errors for | |
1829 | inline member templates. */ | |
1830 | if (decl == olddecl | |
1831 | || TEMPLATE_PARMS_FOR_INLINE (current_template_parms)) | |
1832 | return; | |
1833 | ||
1834 | cp_error_at ("declaration of `%#D'", decl); | |
1835 | cp_error_at (" shadows template parm `%#D'", olddecl); | |
f3400fe2 | 1836 | } |
22a7be53 | 1837 | |
f3400fe2 | 1838 | /* Return a new TEMPLATE_PARM_INDEX with the indicated INDEX, LEVEL, |
f84b4be9 JM |
1839 | ORIG_LEVEL, DECL, and TYPE. */ |
1840 | ||
1841 | static tree | |
1842 | build_template_parm_index (index, level, orig_level, decl, type) | |
1843 | int index; | |
1844 | int level; | |
1845 | int orig_level; | |
1846 | tree decl; | |
1847 | tree type; | |
1848 | { | |
1849 | tree t = make_node (TEMPLATE_PARM_INDEX); | |
1850 | TEMPLATE_PARM_IDX (t) = index; | |
1851 | TEMPLATE_PARM_LEVEL (t) = level; | |
1852 | TEMPLATE_PARM_ORIG_LEVEL (t) = orig_level; | |
1853 | TEMPLATE_PARM_DECL (t) = decl; | |
1854 | TREE_TYPE (t) = type; | |
1855 | ||
1856 | return t; | |
1857 | } | |
1858 | ||
f84b4be9 | 1859 | /* Return a TEMPLATE_PARM_INDEX, similar to INDEX, but whose |
93cdc044 | 1860 | TEMPLATE_PARM_LEVEL has been decreased by LEVELS. If such a |
f84b4be9 JM |
1861 | TEMPLATE_PARM_INDEX already exists, it is returned; otherwise, a |
1862 | new one is created. */ | |
1863 | ||
1864 | static tree | |
93cdc044 | 1865 | reduce_template_parm_level (index, type, levels) |
f84b4be9 JM |
1866 | tree index; |
1867 | tree type; | |
93cdc044 | 1868 | int levels; |
f84b4be9 JM |
1869 | { |
1870 | if (TEMPLATE_PARM_DESCENDANTS (index) == NULL_TREE | |
1871 | || (TEMPLATE_PARM_LEVEL (TEMPLATE_PARM_DESCENDANTS (index)) | |
93cdc044 | 1872 | != TEMPLATE_PARM_LEVEL (index) - levels)) |
f84b4be9 JM |
1873 | { |
1874 | tree decl | |
1875 | = build_decl (TREE_CODE (TEMPLATE_PARM_DECL (index)), | |
1876 | DECL_NAME (TEMPLATE_PARM_DECL (index)), | |
1877 | type); | |
1878 | tree t | |
1879 | = build_template_parm_index (TEMPLATE_PARM_IDX (index), | |
93cdc044 | 1880 | TEMPLATE_PARM_LEVEL (index) - levels, |
f84b4be9 JM |
1881 | TEMPLATE_PARM_ORIG_LEVEL (index), |
1882 | decl, type); | |
1883 | TEMPLATE_PARM_DESCENDANTS (index) = t; | |
cae40af6 | 1884 | |
c2beae77 KL |
1885 | DECL_ARTIFICIAL (decl) = 1; |
1886 | SET_DECL_TEMPLATE_PARM_P (decl); | |
1887 | ||
cae40af6 JM |
1888 | /* Template template parameters need this. */ |
1889 | DECL_TEMPLATE_PARMS (decl) | |
1890 | = DECL_TEMPLATE_PARMS (TEMPLATE_PARM_DECL (index)); | |
f84b4be9 JM |
1891 | } |
1892 | ||
1893 | return TEMPLATE_PARM_DESCENDANTS (index); | |
1894 | } | |
1895 | ||
8d08fdba | 1896 | /* Process information from new template parameter NEXT and append it to the |
5566b478 | 1897 | LIST being built. */ |
e92cc029 | 1898 | |
8d08fdba MS |
1899 | tree |
1900 | process_template_parm (list, next) | |
1901 | tree list, next; | |
1902 | { | |
1903 | tree parm; | |
1904 | tree decl = 0; | |
a292b002 | 1905 | tree defval; |
5566b478 | 1906 | int is_type, idx; |
f84b4be9 | 1907 | |
8d08fdba MS |
1908 | parm = next; |
1909 | my_friendly_assert (TREE_CODE (parm) == TREE_LIST, 259); | |
a292b002 MS |
1910 | defval = TREE_PURPOSE (parm); |
1911 | parm = TREE_VALUE (parm); | |
1912 | is_type = TREE_PURPOSE (parm) == class_type_node; | |
5566b478 MS |
1913 | |
1914 | if (list) | |
1915 | { | |
1916 | tree p = TREE_VALUE (tree_last (list)); | |
1917 | ||
1899c3a4 | 1918 | if (TREE_CODE (p) == TYPE_DECL || TREE_CODE (p) == TEMPLATE_DECL) |
5566b478 MS |
1919 | idx = TEMPLATE_TYPE_IDX (TREE_TYPE (p)); |
1920 | else | |
f84b4be9 | 1921 | idx = TEMPLATE_PARM_IDX (DECL_INITIAL (p)); |
5566b478 MS |
1922 | ++idx; |
1923 | } | |
1924 | else | |
1925 | idx = 0; | |
1926 | ||
8d08fdba MS |
1927 | if (!is_type) |
1928 | { | |
a292b002 | 1929 | my_friendly_assert (TREE_CODE (TREE_PURPOSE (parm)) == TREE_LIST, 260); |
8d08fdba | 1930 | /* is a const-param */ |
a292b002 | 1931 | parm = grokdeclarator (TREE_VALUE (parm), TREE_PURPOSE (parm), |
c11b6f21 | 1932 | PARM, 0, NULL_TREE); |
d490621d MM |
1933 | |
1934 | /* [temp.param] | |
1935 | ||
1936 | The top-level cv-qualifiers on the template-parameter are | |
1937 | ignored when determining its type. */ | |
1938 | TREE_TYPE (parm) = TYPE_MAIN_VARIANT (TREE_TYPE (parm)); | |
1939 | ||
8d08fdba MS |
1940 | /* A template parameter is not modifiable. */ |
1941 | TREE_READONLY (parm) = 1; | |
11b810f1 | 1942 | if (invalid_nontype_parm_type_p (TREE_TYPE (parm), 1)) |
db3f4e4e | 1943 | TREE_TYPE (parm) = void_type_node; |
8d08fdba | 1944 | decl = build_decl (CONST_DECL, DECL_NAME (parm), TREE_TYPE (parm)); |
f84b4be9 JM |
1945 | DECL_INITIAL (parm) = DECL_INITIAL (decl) |
1946 | = build_template_parm_index (idx, processing_template_decl, | |
1947 | processing_template_decl, | |
1948 | decl, TREE_TYPE (parm)); | |
8d08fdba MS |
1949 | } |
1950 | else | |
1951 | { | |
73b0fce8 KL |
1952 | tree t; |
1953 | parm = TREE_VALUE (parm); | |
1954 | ||
1955 | if (parm && TREE_CODE (parm) == TEMPLATE_DECL) | |
1956 | { | |
33848bb0 | 1957 | t = make_aggr_type (TEMPLATE_TEMPLATE_PARM); |
73b0fce8 KL |
1958 | /* This is for distinguishing between real templates and template |
1959 | template parameters */ | |
1960 | TREE_TYPE (parm) = t; | |
1961 | TREE_TYPE (DECL_TEMPLATE_RESULT (parm)) = t; | |
1962 | decl = parm; | |
1963 | } | |
1964 | else | |
1965 | { | |
33848bb0 | 1966 | t = make_aggr_type (TEMPLATE_TYPE_PARM); |
73b0fce8 KL |
1967 | /* parm is either IDENTIFIER_NODE or NULL_TREE */ |
1968 | decl = build_decl (TYPE_DECL, parm, t); | |
1969 | } | |
1970 | ||
d2e5ee5c MS |
1971 | TYPE_NAME (t) = decl; |
1972 | TYPE_STUB_DECL (t) = decl; | |
a292b002 | 1973 | parm = decl; |
f84b4be9 JM |
1974 | TEMPLATE_TYPE_PARM_INDEX (t) |
1975 | = build_template_parm_index (idx, processing_template_decl, | |
1976 | processing_template_decl, | |
1977 | decl, TREE_TYPE (parm)); | |
8d08fdba | 1978 | } |
c727aa5e | 1979 | DECL_ARTIFICIAL (decl) = 1; |
cd9f6678 | 1980 | SET_DECL_TEMPLATE_PARM_P (decl); |
8d08fdba | 1981 | pushdecl (decl); |
a292b002 | 1982 | parm = build_tree_list (defval, parm); |
8d08fdba MS |
1983 | return chainon (list, parm); |
1984 | } | |
1985 | ||
1986 | /* The end of a template parameter list has been reached. Process the | |
1987 | tree list into a parameter vector, converting each parameter into a more | |
1988 | useful form. Type parameters are saved as IDENTIFIER_NODEs, and others | |
1989 | as PARM_DECLs. */ | |
1990 | ||
1991 | tree | |
1992 | end_template_parm_list (parms) | |
1993 | tree parms; | |
1994 | { | |
5566b478 | 1995 | int nparms; |
8d08fdba | 1996 | tree parm; |
5566b478 MS |
1997 | tree saved_parmlist = make_tree_vec (list_length (parms)); |
1998 | ||
5566b478 | 1999 | current_template_parms |
4890c2f4 | 2000 | = tree_cons (size_int (processing_template_decl), |
5566b478 | 2001 | saved_parmlist, current_template_parms); |
8d08fdba | 2002 | |
91e490ab MM |
2003 | for (parm = parms, nparms = 0; |
2004 | parm; | |
2005 | parm = TREE_CHAIN (parm), nparms++) | |
66191c20 | 2006 | TREE_VEC_ELT (saved_parmlist, nparms) = parm; |
a292b002 | 2007 | |
67ffc812 MM |
2008 | --processing_template_parmlist; |
2009 | ||
8d08fdba MS |
2010 | return saved_parmlist; |
2011 | } | |
2012 | ||
5566b478 MS |
2013 | /* end_template_decl is called after a template declaration is seen. */ |
2014 | ||
8d08fdba | 2015 | void |
5566b478 | 2016 | end_template_decl () |
8d08fdba | 2017 | { |
386b8a85 JM |
2018 | reset_specialization (); |
2019 | ||
5156628f | 2020 | if (! processing_template_decl) |
73aad9b9 JM |
2021 | return; |
2022 | ||
5566b478 | 2023 | /* This matches the pushlevel in begin_template_parm_list. */ |
74b846e0 | 2024 | finish_scope (); |
8d08fdba | 2025 | |
5566b478 MS |
2026 | --processing_template_decl; |
2027 | current_template_parms = TREE_CHAIN (current_template_parms); | |
5566b478 | 2028 | } |
8d08fdba | 2029 | |
36a117a5 MM |
2030 | /* Given a template argument vector containing the template PARMS. |
2031 | The innermost PARMS are given first. */ | |
9a3b49ac MS |
2032 | |
2033 | tree | |
2034 | current_template_args () | |
5566b478 | 2035 | { |
36a117a5 | 2036 | tree header; |
b370501f | 2037 | tree args = NULL_TREE; |
36a117a5 | 2038 | int length = TMPL_PARMS_DEPTH (current_template_parms); |
98c1c668 JM |
2039 | int l = length; |
2040 | ||
36a117a5 MM |
2041 | /* If there is only one level of template parameters, we do not |
2042 | create a TREE_VEC of TREE_VECs. Instead, we return a single | |
2043 | TREE_VEC containing the arguments. */ | |
2044 | if (length > 1) | |
2045 | args = make_tree_vec (length); | |
2046 | ||
2047 | for (header = current_template_parms; header; header = TREE_CHAIN (header)) | |
8d08fdba | 2048 | { |
5566b478 | 2049 | tree a = copy_node (TREE_VALUE (header)); |
36a117a5 MM |
2050 | int i; |
2051 | ||
5566b478 | 2052 | TREE_TYPE (a) = NULL_TREE; |
36a117a5 | 2053 | for (i = TREE_VEC_LENGTH (a) - 1; i >= 0; --i) |
5566b478 | 2054 | { |
98c1c668 JM |
2055 | tree t = TREE_VEC_ELT (a, i); |
2056 | ||
36a117a5 | 2057 | /* T will be a list if we are called from within a |
98c1c668 JM |
2058 | begin/end_template_parm_list pair, but a vector directly |
2059 | if within a begin/end_member_template_processing pair. */ | |
2060 | if (TREE_CODE (t) == TREE_LIST) | |
2061 | { | |
2062 | t = TREE_VALUE (t); | |
2063 | ||
73b0fce8 KL |
2064 | if (TREE_CODE (t) == TYPE_DECL |
2065 | || TREE_CODE (t) == TEMPLATE_DECL) | |
98c1c668 JM |
2066 | t = TREE_TYPE (t); |
2067 | else | |
2068 | t = DECL_INITIAL (t); | |
36a117a5 | 2069 | TREE_VEC_ELT (a, i) = t; |
98c1c668 | 2070 | } |
5566b478 | 2071 | } |
36a117a5 MM |
2072 | |
2073 | if (length > 1) | |
2074 | TREE_VEC_ELT (args, --l) = a; | |
2075 | else | |
2076 | args = a; | |
8d08fdba MS |
2077 | } |
2078 | ||
9a3b49ac MS |
2079 | return args; |
2080 | } | |
75650646 | 2081 | |
e1467ff2 MM |
2082 | /* Return a TEMPLATE_DECL corresponding to DECL, using the indicated |
2083 | template PARMS. Used by push_template_decl below. */ | |
2084 | ||
75650646 MM |
2085 | static tree |
2086 | build_template_decl (decl, parms) | |
2087 | tree decl; | |
2088 | tree parms; | |
2089 | { | |
2090 | tree tmpl = build_lang_decl (TEMPLATE_DECL, DECL_NAME (decl), NULL_TREE); | |
2091 | DECL_TEMPLATE_PARMS (tmpl) = parms; | |
2092 | DECL_CONTEXT (tmpl) = DECL_CONTEXT (decl); | |
2093 | if (DECL_LANG_SPECIFIC (decl)) | |
2094 | { | |
8f17b5c5 MM |
2095 | if (CAN_HAVE_FULL_LANG_DECL_P (decl)) |
2096 | DECL_VIRTUAL_CONTEXT (tmpl) = DECL_VIRTUAL_CONTEXT (decl); | |
8f032717 MM |
2097 | DECL_STATIC_FUNCTION_P (tmpl) = DECL_STATIC_FUNCTION_P (decl); |
2098 | DECL_CONSTRUCTOR_P (tmpl) = DECL_CONSTRUCTOR_P (decl); | |
11f98788 | 2099 | DECL_NONCONVERTING_P (tmpl) = DECL_NONCONVERTING_P (decl); |
1f6e1acc AS |
2100 | DECL_ASSIGNMENT_OPERATOR_P (tmpl) = DECL_ASSIGNMENT_OPERATOR_P (decl); |
2101 | if (DECL_OVERLOADED_OPERATOR_P (decl)) | |
2102 | SET_OVERLOADED_OPERATOR_CODE (tmpl, | |
2103 | DECL_OVERLOADED_OPERATOR_P (decl)); | |
75650646 MM |
2104 | } |
2105 | ||
2106 | return tmpl; | |
2107 | } | |
2108 | ||
050367a3 MM |
2109 | struct template_parm_data |
2110 | { | |
6c30752f MM |
2111 | /* The level of the template parameters we are currently |
2112 | processing. */ | |
050367a3 | 2113 | int level; |
6c30752f MM |
2114 | |
2115 | /* The index of the specialization argument we are currently | |
2116 | processing. */ | |
2117 | int current_arg; | |
2118 | ||
2119 | /* An array whose size is the number of template parameters. The | |
2120 | elements are non-zero if the parameter has been used in any one | |
2121 | of the arguments processed so far. */ | |
050367a3 | 2122 | int* parms; |
6c30752f MM |
2123 | |
2124 | /* An array whose size is the number of template arguments. The | |
2125 | elements are non-zero if the argument makes use of template | |
2126 | parameters of this level. */ | |
2127 | int* arg_uses_template_parms; | |
050367a3 MM |
2128 | }; |
2129 | ||
2130 | /* Subroutine of push_template_decl used to see if each template | |
2131 | parameter in a partial specialization is used in the explicit | |
2132 | argument list. If T is of the LEVEL given in DATA (which is | |
2133 | treated as a template_parm_data*), then DATA->PARMS is marked | |
2134 | appropriately. */ | |
2135 | ||
2136 | static int | |
2137 | mark_template_parm (t, data) | |
2138 | tree t; | |
2139 | void* data; | |
2140 | { | |
2141 | int level; | |
2142 | int idx; | |
2143 | struct template_parm_data* tpd = (struct template_parm_data*) data; | |
2144 | ||
2145 | if (TREE_CODE (t) == TEMPLATE_PARM_INDEX) | |
2146 | { | |
2147 | level = TEMPLATE_PARM_LEVEL (t); | |
2148 | idx = TEMPLATE_PARM_IDX (t); | |
2149 | } | |
2150 | else | |
2151 | { | |
2152 | level = TEMPLATE_TYPE_LEVEL (t); | |
2153 | idx = TEMPLATE_TYPE_IDX (t); | |
2154 | } | |
2155 | ||
2156 | if (level == tpd->level) | |
6c30752f MM |
2157 | { |
2158 | tpd->parms[idx] = 1; | |
2159 | tpd->arg_uses_template_parms[tpd->current_arg] = 1; | |
2160 | } | |
050367a3 MM |
2161 | |
2162 | /* Return zero so that for_each_template_parm will continue the | |
2163 | traversal of the tree; we want to mark *every* template parm. */ | |
2164 | return 0; | |
2165 | } | |
2166 | ||
6c30752f MM |
2167 | /* Process the partial specialization DECL. */ |
2168 | ||
e9659ab0 | 2169 | static tree |
6c30752f MM |
2170 | process_partial_specialization (decl) |
2171 | tree decl; | |
2172 | { | |
2173 | tree type = TREE_TYPE (decl); | |
2174 | tree maintmpl = CLASSTYPE_TI_TEMPLATE (type); | |
2175 | tree specargs = CLASSTYPE_TI_ARGS (type); | |
f9a7ae04 | 2176 | tree inner_args = INNERMOST_TEMPLATE_ARGS (specargs); |
6c30752f MM |
2177 | tree inner_parms = INNERMOST_TEMPLATE_PARMS (current_template_parms); |
2178 | tree main_inner_parms = DECL_INNERMOST_TEMPLATE_PARMS (maintmpl); | |
2179 | int nargs = TREE_VEC_LENGTH (inner_args); | |
2180 | int ntparms = TREE_VEC_LENGTH (inner_parms); | |
2181 | int i; | |
2182 | int did_error_intro = 0; | |
6c30752f MM |
2183 | struct template_parm_data tpd; |
2184 | struct template_parm_data tpd2; | |
2185 | ||
6c30752f MM |
2186 | /* We check that each of the template parameters given in the |
2187 | partial specialization is used in the argument list to the | |
2188 | specialization. For example: | |
2189 | ||
2190 | template <class T> struct S; | |
2191 | template <class T> struct S<T*>; | |
2192 | ||
2193 | The second declaration is OK because `T*' uses the template | |
2194 | parameter T, whereas | |
2195 | ||
2196 | template <class T> struct S<int>; | |
2197 | ||
2198 | is no good. Even trickier is: | |
2199 | ||
2200 | template <class T> | |
2201 | struct S1 | |
2202 | { | |
2203 | template <class U> | |
2204 | struct S2; | |
2205 | template <class U> | |
2206 | struct S2<T>; | |
2207 | }; | |
2208 | ||
2209 | The S2<T> declaration is actually illegal; it is a | |
2210 | full-specialization. Of course, | |
2211 | ||
2212 | template <class U> | |
2213 | struct S2<T (*)(U)>; | |
2214 | ||
2215 | or some such would have been OK. */ | |
2216 | tpd.level = TMPL_PARMS_DEPTH (current_template_parms); | |
2217 | tpd.parms = alloca (sizeof (int) * ntparms); | |
961192e1 | 2218 | memset ((PTR) tpd.parms, 0, sizeof (int) * ntparms); |
6c30752f MM |
2219 | |
2220 | tpd.arg_uses_template_parms = alloca (sizeof (int) * nargs); | |
961192e1 | 2221 | memset ((PTR) tpd.arg_uses_template_parms, 0, sizeof (int) * nargs); |
6c30752f MM |
2222 | for (i = 0; i < nargs; ++i) |
2223 | { | |
2224 | tpd.current_arg = i; | |
2225 | for_each_template_parm (TREE_VEC_ELT (inner_args, i), | |
2226 | &mark_template_parm, | |
2227 | &tpd); | |
2228 | } | |
2229 | for (i = 0; i < ntparms; ++i) | |
2230 | if (tpd.parms[i] == 0) | |
2231 | { | |
2232 | /* One of the template parms was not used in the | |
f9a7ae04 | 2233 | specialization. */ |
6c30752f MM |
2234 | if (!did_error_intro) |
2235 | { | |
8251199e | 2236 | cp_error ("template parameters not used in partial specialization:"); |
6c30752f MM |
2237 | did_error_intro = 1; |
2238 | } | |
2239 | ||
8251199e | 2240 | cp_error (" `%D'", |
6c30752f MM |
2241 | TREE_VALUE (TREE_VEC_ELT (inner_parms, i))); |
2242 | } | |
2243 | ||
2244 | /* [temp.class.spec] | |
2245 | ||
2246 | The argument list of the specialization shall not be identical to | |
2247 | the implicit argument list of the primary template. */ | |
f9a7ae04 MM |
2248 | if (comp_template_args |
2249 | (inner_args, | |
2250 | INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE | |
2251 | (maintmpl))))) | |
8251199e | 2252 | cp_error ("partial specialization `%T' does not specialize any template arguments", type); |
6c30752f MM |
2253 | |
2254 | /* [temp.class.spec] | |
2255 | ||
2256 | A partially specialized non-type argument expression shall not | |
2257 | involve template parameters of the partial specialization except | |
2258 | when the argument expression is a simple identifier. | |
2259 | ||
2260 | The type of a template parameter corresponding to a specialized | |
2261 | non-type argument shall not be dependent on a parameter of the | |
2262 | specialization. */ | |
2263 | my_friendly_assert (nargs == DECL_NTPARMS (maintmpl), 0); | |
2264 | tpd2.parms = 0; | |
2265 | for (i = 0; i < nargs; ++i) | |
2266 | { | |
2267 | tree arg = TREE_VEC_ELT (inner_args, i); | |
2268 | if (/* These first two lines are the `non-type' bit. */ | |
2f939d94 | 2269 | !TYPE_P (arg) |
6c30752f MM |
2270 | && TREE_CODE (arg) != TEMPLATE_DECL |
2271 | /* This next line is the `argument expression is not just a | |
2272 | simple identifier' condition and also the `specialized | |
2273 | non-type argument' bit. */ | |
2274 | && TREE_CODE (arg) != TEMPLATE_PARM_INDEX) | |
2275 | { | |
2276 | if (tpd.arg_uses_template_parms[i]) | |
8251199e | 2277 | cp_error ("template argument `%E' involves template parameter(s)", arg); |
6c30752f MM |
2278 | else |
2279 | { | |
2280 | /* Look at the corresponding template parameter, | |
2281 | marking which template parameters its type depends | |
2282 | upon. */ | |
2283 | tree type = | |
2284 | TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (main_inner_parms, | |
2285 | i))); | |
2286 | ||
2287 | if (!tpd2.parms) | |
2288 | { | |
2289 | /* We haven't yet initialized TPD2. Do so now. */ | |
2290 | tpd2.arg_uses_template_parms | |
2291 | = (int*) alloca (sizeof (int) * nargs); | |
104bf76a | 2292 | /* The number of parameters here is the number in the |
76a83782 RH |
2293 | main template, which, as checked in the assertion |
2294 | above, is NARGS. */ | |
6c30752f MM |
2295 | tpd2.parms = (int*) alloca (sizeof (int) * nargs); |
2296 | tpd2.level = | |
2297 | TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (maintmpl)); | |
2298 | } | |
2299 | ||
104bf76a | 2300 | /* Mark the template parameters. But this time, we're |
6c30752f MM |
2301 | looking for the template parameters of the main |
2302 | template, not in the specialization. */ | |
2303 | tpd2.current_arg = i; | |
2304 | tpd2.arg_uses_template_parms[i] = 0; | |
961192e1 | 2305 | memset ((PTR) tpd2.parms, 0, sizeof (int) * nargs); |
6c30752f MM |
2306 | for_each_template_parm (type, |
2307 | &mark_template_parm, | |
2308 | &tpd2); | |
2309 | ||
2310 | if (tpd2.arg_uses_template_parms [i]) | |
2311 | { | |
2312 | /* The type depended on some template parameters. | |
2313 | If they are fully specialized in the | |
2314 | specialization, that's OK. */ | |
2315 | int j; | |
2316 | for (j = 0; j < nargs; ++j) | |
2317 | if (tpd2.parms[j] != 0 | |
2318 | && tpd.arg_uses_template_parms [j]) | |
2319 | { | |
104bf76a | 2320 | cp_error ("type `%T' of template argument `%E' depends on template parameter(s)", |
6c30752f MM |
2321 | type, |
2322 | arg); | |
2323 | break; | |
2324 | } | |
2325 | } | |
2326 | } | |
2327 | } | |
2328 | } | |
2329 | ||
2330 | if (retrieve_specialization (maintmpl, specargs)) | |
2331 | /* We've already got this specialization. */ | |
2332 | return decl; | |
2333 | ||
d8b64f80 | 2334 | DECL_TEMPLATE_SPECIALIZATIONS (maintmpl) |
e1b3e07d MM |
2335 | = tree_cons (inner_args, inner_parms, |
2336 | DECL_TEMPLATE_SPECIALIZATIONS (maintmpl)); | |
6c30752f MM |
2337 | TREE_TYPE (DECL_TEMPLATE_SPECIALIZATIONS (maintmpl)) = type; |
2338 | return decl; | |
2339 | } | |
2340 | ||
6ba89f8e MM |
2341 | /* Check that a template declaration's use of default arguments is not |
2342 | invalid. Here, PARMS are the template parameters. IS_PRIMARY is | |
2343 | non-zero if DECL is the thing declared by a primary template. | |
2344 | IS_PARTIAL is non-zero if DECL is a partial specialization. */ | |
2345 | ||
2346 | static void | |
2347 | check_default_tmpl_args (decl, parms, is_primary, is_partial) | |
2348 | tree decl; | |
2349 | tree parms; | |
2350 | int is_primary; | |
2351 | int is_partial; | |
2352 | { | |
d8e178a0 | 2353 | const char *msg; |
66191c20 MM |
2354 | int last_level_to_check; |
2355 | tree parm_level; | |
6ba89f8e MM |
2356 | |
2357 | /* [temp.param] | |
2358 | ||
2359 | A default template-argument shall not be specified in a | |
2360 | function template declaration or a function template definition, nor | |
2361 | in the template-parameter-list of the definition of a member of a | |
2362 | class template. */ | |
2363 | ||
4f1c5b7d | 2364 | if (TREE_CODE (CP_DECL_CONTEXT (decl)) == FUNCTION_DECL) |
e0942dcd MM |
2365 | /* You can't have a function template declaration in a local |
2366 | scope, nor you can you define a member of a class template in a | |
2367 | local scope. */ | |
2368 | return; | |
2369 | ||
6ba89f8e MM |
2370 | if (current_class_type |
2371 | && !TYPE_BEING_DEFINED (current_class_type) | |
3d7de1fa | 2372 | && DECL_LANG_SPECIFIC (decl) |
5937a6f9 MM |
2373 | /* If this is either a friend defined in the scope of the class |
2374 | or a member function. */ | |
4f1c5b7d MM |
2375 | && ((DECL_CONTEXT (decl) |
2376 | && same_type_p (DECL_CONTEXT (decl), current_class_type)) | |
2377 | || (DECL_FRIEND_CONTEXT (decl) | |
2378 | && same_type_p (DECL_FRIEND_CONTEXT (decl), | |
2379 | current_class_type))) | |
5937a6f9 MM |
2380 | /* And, if it was a member function, it really was defined in |
2381 | the scope of the class. */ | |
3febd123 | 2382 | && (!DECL_FUNCTION_MEMBER_P (decl) || DECL_INITIALIZED_IN_CLASS_P (decl))) |
6ba89f8e | 2383 | /* We already checked these parameters when the template was |
5937a6f9 MM |
2384 | declared, so there's no need to do it again now. This function |
2385 | was defined in class scope, but we're processing it's body now | |
2386 | that the class is complete. */ | |
6ba89f8e MM |
2387 | return; |
2388 | ||
66191c20 MM |
2389 | /* [temp.param] |
2390 | ||
2391 | If a template-parameter has a default template-argument, all | |
2392 | subsequent template-parameters shall have a default | |
2393 | template-argument supplied. */ | |
2394 | for (parm_level = parms; parm_level; parm_level = TREE_CHAIN (parm_level)) | |
2395 | { | |
2396 | tree inner_parms = TREE_VALUE (parm_level); | |
2397 | int ntparms = TREE_VEC_LENGTH (inner_parms); | |
2398 | int seen_def_arg_p = 0; | |
2399 | int i; | |
2400 | ||
2401 | for (i = 0; i < ntparms; ++i) | |
2402 | { | |
2403 | tree parm = TREE_VEC_ELT (inner_parms, i); | |
2404 | if (TREE_PURPOSE (parm)) | |
2405 | seen_def_arg_p = 1; | |
2406 | else if (seen_def_arg_p) | |
2407 | { | |
2408 | cp_error ("no default argument for `%D'", TREE_VALUE (parm)); | |
2409 | /* For better subsequent error-recovery, we indicate that | |
2410 | there should have been a default argument. */ | |
2411 | TREE_PURPOSE (parm) = error_mark_node; | |
2412 | } | |
2413 | } | |
2414 | } | |
2415 | ||
6ba89f8e MM |
2416 | if (TREE_CODE (decl) != TYPE_DECL || is_partial || !is_primary) |
2417 | /* For an ordinary class template, default template arguments are | |
2418 | allowed at the innermost level, e.g.: | |
2419 | template <class T = int> | |
2420 | struct S {}; | |
2421 | but, in a partial specialization, they're not allowed even | |
2422 | there, as we have in [temp.class.spec]: | |
2423 | ||
2424 | The template parameter list of a specialization shall not | |
2425 | contain default template argument values. | |
2426 | ||
2427 | So, for a partial specialization, or for a function template, | |
2428 | we look at all of them. */ | |
2429 | ; | |
2430 | else | |
2431 | /* But, for a primary class template that is not a partial | |
2432 | specialization we look at all template parameters except the | |
2433 | innermost ones. */ | |
2434 | parms = TREE_CHAIN (parms); | |
2435 | ||
2436 | /* Figure out what error message to issue. */ | |
2437 | if (TREE_CODE (decl) == FUNCTION_DECL) | |
8653a2c3 | 2438 | msg = "default template arguments may not be used in function templates"; |
6ba89f8e | 2439 | else if (is_partial) |
8653a2c3 | 2440 | msg = "default template arguments may not be used in partial specializations"; |
6ba89f8e MM |
2441 | else |
2442 | msg = "default argument for template parameter for class enclosing `%D'"; | |
2443 | ||
2444 | if (current_class_type && TYPE_BEING_DEFINED (current_class_type)) | |
2445 | /* If we're inside a class definition, there's no need to | |
104bf76a | 2446 | examine the parameters to the class itself. On the one |
6ba89f8e MM |
2447 | hand, they will be checked when the class is defined, and, |
2448 | on the other, default arguments are legal in things like: | |
2449 | template <class T = double> | |
2450 | struct S { template <class U> void f(U); }; | |
2451 | Here the default argument for `S' has no bearing on the | |
2452 | declaration of `f'. */ | |
2453 | last_level_to_check = template_class_depth (current_class_type) + 1; | |
2454 | else | |
2455 | /* Check everything. */ | |
2456 | last_level_to_check = 0; | |
2457 | ||
66191c20 MM |
2458 | for (parm_level = parms; |
2459 | parm_level && TMPL_PARMS_DEPTH (parm_level) >= last_level_to_check; | |
2460 | parm_level = TREE_CHAIN (parm_level)) | |
6ba89f8e | 2461 | { |
66191c20 MM |
2462 | tree inner_parms = TREE_VALUE (parm_level); |
2463 | int i; | |
2464 | int ntparms; | |
6ba89f8e MM |
2465 | |
2466 | ntparms = TREE_VEC_LENGTH (inner_parms); | |
2467 | for (i = 0; i < ntparms; ++i) | |
2468 | if (TREE_PURPOSE (TREE_VEC_ELT (inner_parms, i))) | |
2469 | { | |
2470 | if (msg) | |
2471 | { | |
2472 | cp_error (msg, decl); | |
2473 | msg = 0; | |
2474 | } | |
2475 | ||
2476 | /* Clear out the default argument so that we are not | |
2477 | confused later. */ | |
2478 | TREE_PURPOSE (TREE_VEC_ELT (inner_parms, i)) = NULL_TREE; | |
2479 | } | |
2480 | ||
2481 | /* At this point, if we're still interested in issuing messages, | |
2482 | they must apply to classes surrounding the object declared. */ | |
2483 | if (msg) | |
2484 | msg = "default argument for template parameter for class enclosing `%D'"; | |
2485 | } | |
2486 | } | |
2487 | ||
3ac3d9ea | 2488 | /* Creates a TEMPLATE_DECL for the indicated DECL using the template |
f84b4be9 JM |
2489 | parameters given by current_template_args, or reuses a |
2490 | previously existing one, if appropriate. Returns the DECL, or an | |
6757edfe MM |
2491 | equivalent one, if it is replaced via a call to duplicate_decls. |
2492 | ||
2493 | If IS_FRIEND is non-zero, DECL is a friend declaration. */ | |
3ac3d9ea MM |
2494 | |
2495 | tree | |
6757edfe | 2496 | push_template_decl_real (decl, is_friend) |
9a3b49ac | 2497 | tree decl; |
6757edfe | 2498 | int is_friend; |
9a3b49ac MS |
2499 | { |
2500 | tree tmpl; | |
f84b4be9 | 2501 | tree args; |
9a3b49ac | 2502 | tree info; |
f84b4be9 JM |
2503 | tree ctx; |
2504 | int primary; | |
6ba89f8e | 2505 | int is_partial; |
cfe507be | 2506 | int new_template_p = 0; |
6ba89f8e MM |
2507 | |
2508 | /* See if this is a partial specialization. */ | |
9188c363 | 2509 | is_partial = (DECL_IMPLICIT_TYPEDEF_P (decl) |
6ba89f8e | 2510 | && TREE_CODE (TREE_TYPE (decl)) != ENUMERAL_TYPE |
370af2d5 | 2511 | && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl))); |
6757edfe MM |
2512 | |
2513 | is_friend |= (TREE_CODE (decl) == FUNCTION_DECL && DECL_FRIEND_P (decl)); | |
f84b4be9 JM |
2514 | |
2515 | if (is_friend) | |
2516 | /* For a friend, we want the context of the friend function, not | |
2517 | the type of which it is a friend. */ | |
2518 | ctx = DECL_CONTEXT (decl); | |
4f1c5b7d MM |
2519 | else if (CP_DECL_CONTEXT (decl) |
2520 | && TREE_CODE (CP_DECL_CONTEXT (decl)) != NAMESPACE_DECL) | |
f84b4be9 JM |
2521 | /* In the case of a virtual function, we want the class in which |
2522 | it is defined. */ | |
4f1c5b7d | 2523 | ctx = CP_DECL_CONTEXT (decl); |
f84b4be9 | 2524 | else |
dc957d14 | 2525 | /* Otherwise, if we're currently defining some class, the DECL |
f84b4be9 | 2526 | is assumed to be a member of the class. */ |
9188c363 | 2527 | ctx = current_scope (); |
f84b4be9 | 2528 | |
2c73f9f5 ML |
2529 | if (ctx && TREE_CODE (ctx) == NAMESPACE_DECL) |
2530 | ctx = NULL_TREE; | |
2531 | ||
2532 | if (!DECL_CONTEXT (decl)) | |
cb0dbb9a | 2533 | DECL_CONTEXT (decl) = FROB_CONTEXT (current_namespace); |
2c73f9f5 | 2534 | |
6ba89f8e | 2535 | /* See if this is a primary template. */ |
74b846e0 | 2536 | primary = template_parm_scope_p (); |
9a3b49ac | 2537 | |
83566abf JM |
2538 | if (primary) |
2539 | { | |
2540 | if (current_lang_name == lang_name_c) | |
8251199e | 2541 | cp_error ("template with C linkage"); |
4ce3d537 MM |
2542 | else if (TREE_CODE (decl) == TYPE_DECL |
2543 | && ANON_AGGRNAME_P (DECL_NAME (decl))) | |
8251199e | 2544 | cp_error ("template class without a name"); |
2aaf816d JM |
2545 | else if ((DECL_IMPLICIT_TYPEDEF_P (decl) |
2546 | && CLASS_TYPE_P (TREE_TYPE (decl))) | |
2547 | || (TREE_CODE (decl) == VAR_DECL && ctx && CLASS_TYPE_P (ctx)) | |
2548 | || TREE_CODE (decl) == FUNCTION_DECL) | |
2549 | /* OK */; | |
2550 | else | |
4ce3d537 | 2551 | cp_error ("template declaration of `%#D'", decl); |
83566abf JM |
2552 | } |
2553 | ||
6ba89f8e MM |
2554 | /* Check to see that the rules regarding the use of default |
2555 | arguments are not being violated. */ | |
2556 | check_default_tmpl_args (decl, current_template_parms, | |
2557 | primary, is_partial); | |
73aad9b9 | 2558 | |
6ba89f8e MM |
2559 | if (is_partial) |
2560 | return process_partial_specialization (decl); | |
d32789d8 | 2561 | |
9a3b49ac MS |
2562 | args = current_template_args (); |
2563 | ||
f84b4be9 JM |
2564 | if (!ctx |
2565 | || TREE_CODE (ctx) == FUNCTION_DECL | |
2566 | || TYPE_BEING_DEFINED (ctx) | |
2567 | || (is_friend && !DECL_TEMPLATE_INFO (decl))) | |
8d08fdba | 2568 | { |
75650646 | 2569 | if (DECL_LANG_SPECIFIC (decl) |
f84b4be9 JM |
2570 | && DECL_TEMPLATE_INFO (decl) |
2571 | && DECL_TI_TEMPLATE (decl)) | |
2572 | tmpl = DECL_TI_TEMPLATE (decl); | |
1c10870d AS |
2573 | /* If DECL is a TYPE_DECL for a class-template, then there won't |
2574 | be DECL_LANG_SPECIFIC. The information equivalent to | |
2575 | DECL_TEMPLATE_INFO is found in TYPE_TEMPLATE_INFO instead. */ | |
2576 | else if (DECL_IMPLICIT_TYPEDEF_P (decl) | |
2577 | && TYPE_TEMPLATE_INFO (TREE_TYPE (decl)) | |
2578 | && TYPE_TI_TEMPLATE (TREE_TYPE (decl))) | |
2579 | { | |
2580 | /* Since a template declaration already existed for this | |
2581 | class-type, we must be redeclaring it here. Make sure | |
2582 | that the redeclaration is legal. */ | |
2583 | redeclare_class_template (TREE_TYPE (decl), | |
2584 | current_template_parms); | |
2585 | /* We don't need to create a new TEMPLATE_DECL; just use the | |
2586 | one we already had. */ | |
2587 | tmpl = TYPE_TI_TEMPLATE (TREE_TYPE (decl)); | |
2588 | } | |
f84b4be9 | 2589 | else |
786b5245 | 2590 | { |
f84b4be9 | 2591 | tmpl = build_template_decl (decl, current_template_parms); |
cfe507be MM |
2592 | new_template_p = 1; |
2593 | ||
f84b4be9 JM |
2594 | if (DECL_LANG_SPECIFIC (decl) |
2595 | && DECL_TEMPLATE_SPECIALIZATION (decl)) | |
2596 | { | |
2597 | /* A specialization of a member template of a template | |
2598 | class. */ | |
2599 | SET_DECL_TEMPLATE_SPECIALIZATION (tmpl); | |
2600 | DECL_TEMPLATE_INFO (tmpl) = DECL_TEMPLATE_INFO (decl); | |
2601 | DECL_TEMPLATE_INFO (decl) = NULL_TREE; | |
2602 | } | |
786b5245 | 2603 | } |
8d08fdba MS |
2604 | } |
2605 | else | |
2606 | { | |
e1a5ccf7 | 2607 | tree a, t, current, parms; |
ba4f4e5d | 2608 | int i; |
6633d636 | 2609 | |
6b9ab5cc MM |
2610 | if (TREE_CODE (decl) == TYPE_DECL) |
2611 | { | |
ed44da02 MM |
2612 | if ((IS_AGGR_TYPE_CODE (TREE_CODE (TREE_TYPE (decl))) |
2613 | || TREE_CODE (TREE_TYPE (decl)) == ENUMERAL_TYPE) | |
2614 | && TYPE_TEMPLATE_INFO (TREE_TYPE (decl)) | |
2615 | && TYPE_TI_TEMPLATE (TREE_TYPE (decl))) | |
2616 | tmpl = TYPE_TI_TEMPLATE (TREE_TYPE (decl)); | |
6b9ab5cc MM |
2617 | else |
2618 | { | |
8251199e | 2619 | cp_error ("`%D' does not declare a template type", decl); |
6b9ab5cc MM |
2620 | return decl; |
2621 | } | |
2622 | } | |
fc378698 | 2623 | else if (! DECL_TEMPLATE_INFO (decl)) |
c91a56d2 | 2624 | { |
8251199e | 2625 | cp_error ("template definition of non-template `%#D'", decl); |
3ac3d9ea | 2626 | return decl; |
c91a56d2 | 2627 | } |
8d08fdba | 2628 | else |
5566b478 | 2629 | tmpl = DECL_TI_TEMPLATE (decl); |
98c1c668 | 2630 | |
e1a5ccf7 JM |
2631 | if (is_member_template (tmpl) |
2632 | && DECL_FUNCTION_TEMPLATE_P (tmpl) | |
2633 | && DECL_TEMPLATE_INFO (decl) && DECL_TI_ARGS (decl) | |
2634 | && DECL_TEMPLATE_SPECIALIZATION (decl)) | |
98c1c668 | 2635 | { |
e1a5ccf7 JM |
2636 | tree new_tmpl; |
2637 | ||
2638 | /* The declaration is a specialization of a member | |
2639 | template, declared outside the class. Therefore, the | |
2640 | innermost template arguments will be NULL, so we | |
2641 | replace them with the arguments determined by the | |
2642 | earlier call to check_explicit_specialization. */ | |
2643 | args = DECL_TI_ARGS (decl); | |
2644 | ||
2645 | new_tmpl | |
2646 | = build_template_decl (decl, current_template_parms); | |
2647 | DECL_TEMPLATE_RESULT (new_tmpl) = decl; | |
2648 | TREE_TYPE (new_tmpl) = TREE_TYPE (decl); | |
2649 | DECL_TI_TEMPLATE (decl) = new_tmpl; | |
2650 | SET_DECL_TEMPLATE_SPECIALIZATION (new_tmpl); | |
e1b3e07d MM |
2651 | DECL_TEMPLATE_INFO (new_tmpl) |
2652 | = tree_cons (tmpl, args, NULL_TREE); | |
e1a5ccf7 | 2653 | |
f9a7ae04 MM |
2654 | register_specialization (new_tmpl, |
2655 | most_general_template (tmpl), | |
2656 | args); | |
e1a5ccf7 | 2657 | return decl; |
98c1c668 | 2658 | } |
98c1c668 | 2659 | |
e1a5ccf7 | 2660 | /* Make sure the template headers we got make sense. */ |
6633d636 | 2661 | |
e1a5ccf7 JM |
2662 | parms = DECL_TEMPLATE_PARMS (tmpl); |
2663 | i = TMPL_PARMS_DEPTH (parms); | |
2664 | if (TMPL_ARGS_DEPTH (args) != i) | |
98c1c668 | 2665 | { |
e1a5ccf7 JM |
2666 | cp_error ("expected %d levels of template parms for `%#D', got %d", |
2667 | i, decl, TMPL_ARGS_DEPTH (args)); | |
98c1c668 | 2668 | } |
e1a5ccf7 JM |
2669 | else |
2670 | for (current = decl; i > 0; --i, parms = TREE_CHAIN (parms)) | |
2671 | { | |
2672 | a = TMPL_ARGS_LEVEL (args, i); | |
2673 | t = INNERMOST_TEMPLATE_PARMS (parms); | |
2674 | ||
2675 | if (TREE_VEC_LENGTH (t) != TREE_VEC_LENGTH (a)) | |
2676 | { | |
2677 | if (current == decl) | |
2678 | cp_error ("got %d template parameters for `%#D'", | |
2679 | TREE_VEC_LENGTH (a), decl); | |
2680 | else | |
2681 | cp_error ("got %d template parameters for `%#T'", | |
2682 | TREE_VEC_LENGTH (a), current); | |
2683 | cp_error (" but %d required", TREE_VEC_LENGTH (t)); | |
2684 | } | |
98c1c668 | 2685 | |
e1a5ccf7 JM |
2686 | /* Perhaps we should also check that the parms are used in the |
2687 | appropriate qualifying scopes in the declarator? */ | |
6633d636 | 2688 | |
e1a5ccf7 JM |
2689 | if (current == decl) |
2690 | current = ctx; | |
2691 | else | |
2692 | current = TYPE_CONTEXT (current); | |
2693 | } | |
5566b478 | 2694 | } |
8d08fdba | 2695 | |
5566b478 MS |
2696 | DECL_TEMPLATE_RESULT (tmpl) = decl; |
2697 | TREE_TYPE (tmpl) = TREE_TYPE (decl); | |
8d08fdba | 2698 | |
36a117a5 MM |
2699 | /* Push template declarations for global functions and types. Note |
2700 | that we do not try to push a global template friend declared in a | |
2701 | template class; such a thing may well depend on the template | |
39c01e4c | 2702 | parameters of the class. */ |
cfe507be | 2703 | if (new_template_p && !ctx |
36a117a5 | 2704 | && !(is_friend && template_class_depth (current_class_type) > 0)) |
2c73f9f5 | 2705 | tmpl = pushdecl_namespace_level (tmpl); |
8d08fdba | 2706 | |
5566b478 | 2707 | if (primary) |
6757edfe | 2708 | DECL_PRIMARY_TEMPLATE (tmpl) = tmpl; |
5566b478 | 2709 | |
e1b3e07d | 2710 | info = tree_cons (tmpl, args, NULL_TREE); |
5566b478 | 2711 | |
9188c363 | 2712 | if (DECL_IMPLICIT_TYPEDEF_P (decl)) |
8d08fdba | 2713 | { |
ed44da02 MM |
2714 | SET_TYPE_TEMPLATE_INFO (TREE_TYPE (tmpl), info); |
2715 | if ((!ctx || TREE_CODE (ctx) != FUNCTION_DECL) | |
b60ecc04 MM |
2716 | && TREE_CODE (TREE_TYPE (decl)) != ENUMERAL_TYPE |
2717 | /* Don't change the name if we've already set it up. */ | |
2718 | && !IDENTIFIER_TEMPLATE (DECL_NAME (decl))) | |
75650646 | 2719 | DECL_NAME (decl) = classtype_mangled_name (TREE_TYPE (decl)); |
51c184be | 2720 | } |
2aaf816d | 2721 | else if (DECL_LANG_SPECIFIC (decl)) |
5566b478 | 2722 | DECL_TEMPLATE_INFO (decl) = info; |
3ac3d9ea MM |
2723 | |
2724 | return DECL_TEMPLATE_RESULT (tmpl); | |
8d08fdba MS |
2725 | } |
2726 | ||
6757edfe MM |
2727 | tree |
2728 | push_template_decl (decl) | |
2729 | tree decl; | |
2730 | { | |
2731 | return push_template_decl_real (decl, 0); | |
2732 | } | |
2733 | ||
2734 | /* Called when a class template TYPE is redeclared with the indicated | |
2735 | template PARMS, e.g.: | |
7fe6899f MM |
2736 | |
2737 | template <class T> struct S; | |
2738 | template <class T> struct S {}; */ | |
2739 | ||
2740 | void | |
6757edfe | 2741 | redeclare_class_template (type, parms) |
7fe6899f | 2742 | tree type; |
6757edfe | 2743 | tree parms; |
7fe6899f | 2744 | { |
3d7de1fa | 2745 | tree tmpl; |
6757edfe | 2746 | tree tmpl_parms; |
7fe6899f MM |
2747 | int i; |
2748 | ||
3d7de1fa MM |
2749 | if (!TYPE_TEMPLATE_INFO (type)) |
2750 | { | |
2751 | cp_error ("`%T' is not a template type", type); | |
2752 | return; | |
2753 | } | |
2754 | ||
2755 | tmpl = TYPE_TI_TEMPLATE (type); | |
7fe6899f MM |
2756 | if (!PRIMARY_TEMPLATE_P (tmpl)) |
2757 | /* The type is nested in some template class. Nothing to worry | |
2758 | about here; there are no new template parameters for the nested | |
2759 | type. */ | |
2760 | return; | |
2761 | ||
6757edfe MM |
2762 | parms = INNERMOST_TEMPLATE_PARMS (parms); |
2763 | tmpl_parms = DECL_INNERMOST_TEMPLATE_PARMS (tmpl); | |
2764 | ||
7fe6899f MM |
2765 | if (TREE_VEC_LENGTH (parms) != TREE_VEC_LENGTH (tmpl_parms)) |
2766 | { | |
8251199e JM |
2767 | cp_error_at ("previous declaration `%D'", tmpl); |
2768 | cp_error ("used %d template parameter%s instead of %d", | |
7fe6899f MM |
2769 | TREE_VEC_LENGTH (tmpl_parms), |
2770 | TREE_VEC_LENGTH (tmpl_parms) == 1 ? "" : "s", | |
2771 | TREE_VEC_LENGTH (parms)); | |
2772 | return; | |
2773 | } | |
2774 | ||
2775 | for (i = 0; i < TREE_VEC_LENGTH (tmpl_parms); ++i) | |
2776 | { | |
2777 | tree tmpl_parm = TREE_VALUE (TREE_VEC_ELT (tmpl_parms, i)); | |
2778 | tree parm = TREE_VALUE (TREE_VEC_ELT (parms, i)); | |
2779 | tree tmpl_default = TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms, i)); | |
2780 | tree parm_default = TREE_PURPOSE (TREE_VEC_ELT (parms, i)); | |
2781 | ||
2782 | if (TREE_CODE (tmpl_parm) != TREE_CODE (parm)) | |
2783 | { | |
8251199e JM |
2784 | cp_error_at ("template parameter `%#D'", tmpl_parm); |
2785 | cp_error ("redeclared here as `%#D'", parm); | |
7fe6899f MM |
2786 | return; |
2787 | } | |
2788 | ||
2789 | if (tmpl_default != NULL_TREE && parm_default != NULL_TREE) | |
2790 | { | |
2791 | /* We have in [temp.param]: | |
2792 | ||
2793 | A template-parameter may not be given default arguments | |
2794 | by two different declarations in the same scope. */ | |
8251199e JM |
2795 | cp_error ("redefinition of default argument for `%#D'", parm); |
2796 | cp_error_at (" original definition appeared here", tmpl_parm); | |
7fe6899f MM |
2797 | return; |
2798 | } | |
2799 | ||
2800 | if (parm_default != NULL_TREE) | |
2801 | /* Update the previous template parameters (which are the ones | |
2802 | that will really count) with the new default value. */ | |
2803 | TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms, i)) = parm_default; | |
7ce74c5e MM |
2804 | else if (tmpl_default != NULL_TREE) |
2805 | /* Update the new parameters, too; they'll be used as the | |
2806 | parameters for any members. */ | |
2807 | TREE_PURPOSE (TREE_VEC_ELT (parms, i)) = tmpl_default; | |
7fe6899f MM |
2808 | } |
2809 | } | |
75650646 | 2810 | |
75650646 MM |
2811 | /* Attempt to convert the non-type template parameter EXPR to the |
2812 | indicated TYPE. If the conversion is successful, return the | |
dc957d14 | 2813 | converted value. If the conversion is unsuccessful, return |
75650646 MM |
2814 | NULL_TREE if we issued an error message, or error_mark_node if we |
2815 | did not. We issue error messages for out-and-out bad template | |
2816 | parameters, but not simply because the conversion failed, since we | |
2817 | might be just trying to do argument deduction. By the time this | |
2818 | function is called, neither TYPE nor EXPR may make use of template | |
2819 | parameters. */ | |
2820 | ||
2821 | static tree | |
e1467ff2 | 2822 | convert_nontype_argument (type, expr) |
75650646 MM |
2823 | tree type; |
2824 | tree expr; | |
2825 | { | |
2826 | tree expr_type = TREE_TYPE (expr); | |
2827 | ||
2828 | /* A template-argument for a non-type, non-template | |
2829 | template-parameter shall be one of: | |
2830 | ||
2831 | --an integral constant-expression of integral or enumeration | |
2832 | type; or | |
2833 | ||
2834 | --the name of a non-type template-parameter; or | |
2835 | ||
2836 | --the name of an object or function with external linkage, | |
2837 | including function templates and function template-ids but | |
86052cc3 | 2838 | excluding non-static class members, expressed as id-expression; |
75650646 MM |
2839 | or |
2840 | ||
2841 | --the address of an object or function with external linkage, | |
2842 | including function templates and function template-ids but | |
2843 | excluding non-static class members, expressed as & id-expression | |
2844 | where the & is optional if the name refers to a function or | |
2845 | array; or | |
2846 | ||
2847 | --a pointer to member expressed as described in _expr.unary.op_. */ | |
2848 | ||
638dd8fc MM |
2849 | /* An integral constant-expression can include const variables or |
2850 | enumerators. Simplify things by folding them to their values, | |
2851 | unless we're about to bind the declaration to a reference | |
2852 | parameter. */ | |
fc611ce0 | 2853 | if (INTEGRAL_TYPE_P (expr_type) |
638dd8fc | 2854 | && TREE_CODE (type) != REFERENCE_TYPE) |
86052cc3 JM |
2855 | expr = decl_constant_value (expr); |
2856 | ||
7bf2682f MM |
2857 | if (is_overloaded_fn (expr)) |
2858 | /* OK for now. We'll check that it has external linkage later. | |
2859 | Check this first since if expr_type is the unknown_type_node | |
2860 | we would otherwise complain below. */ | |
2861 | ; | |
e08a8f45 MM |
2862 | else if (TYPE_PTRMEM_P (expr_type) |
2863 | || TYPE_PTRMEMFUNC_P (expr_type)) | |
2864 | { | |
2865 | if (TREE_CODE (expr) != PTRMEM_CST) | |
2866 | goto bad_argument; | |
2867 | } | |
f3400fe2 | 2868 | else if (TYPE_PTR_P (expr_type) |
e08a8f45 | 2869 | || TYPE_PTRMEM_P (expr_type) |
f3400fe2 JM |
2870 | || TREE_CODE (expr_type) == ARRAY_TYPE |
2871 | || TREE_CODE (type) == REFERENCE_TYPE | |
75650646 MM |
2872 | /* If expr is the address of an overloaded function, we |
2873 | will get the unknown_type_node at this point. */ | |
2874 | || expr_type == unknown_type_node) | |
2875 | { | |
2876 | tree referent; | |
49bf0d6f MM |
2877 | tree e = expr; |
2878 | STRIP_NOPS (e); | |
75650646 | 2879 | |
0dc09a61 MM |
2880 | if (TREE_CODE (expr_type) == ARRAY_TYPE |
2881 | || (TREE_CODE (type) == REFERENCE_TYPE | |
2882 | && TREE_CODE (e) != ADDR_EXPR)) | |
f3400fe2 JM |
2883 | referent = e; |
2884 | else | |
75650646 | 2885 | { |
f3400fe2 JM |
2886 | if (TREE_CODE (e) != ADDR_EXPR) |
2887 | { | |
2888 | bad_argument: | |
2889 | cp_error ("`%E' is not a valid template argument", expr); | |
e08a8f45 MM |
2890 | if (TYPE_PTR_P (expr_type)) |
2891 | { | |
2892 | if (TREE_CODE (TREE_TYPE (expr_type)) == FUNCTION_TYPE) | |
2893 | cp_error ("it must be the address of a function with external linkage"); | |
2894 | else | |
2895 | cp_error ("it must be the address of an object with external linkage"); | |
2896 | } | |
2897 | else if (TYPE_PTRMEM_P (expr_type) | |
2898 | || TYPE_PTRMEMFUNC_P (expr_type)) | |
2899 | cp_error ("it must be a pointer-to-member of the form `&X::Y'"); | |
2900 | ||
f3400fe2 JM |
2901 | return NULL_TREE; |
2902 | } | |
2903 | ||
2904 | referent = TREE_OPERAND (e, 0); | |
2905 | STRIP_NOPS (referent); | |
75650646 MM |
2906 | } |
2907 | ||
75650646 MM |
2908 | if (TREE_CODE (referent) == STRING_CST) |
2909 | { | |
b4f4233d | 2910 | cp_error ("string literal %E is not a valid template argument because it is the address of an object with static linkage", |
75650646 | 2911 | referent); |
75650646 MM |
2912 | return NULL_TREE; |
2913 | } | |
2914 | ||
2915 | if (is_overloaded_fn (referent)) | |
2916 | /* We'll check that it has external linkage later. */ | |
2917 | ; | |
2918 | else if (TREE_CODE (referent) != VAR_DECL) | |
2919 | goto bad_argument; | |
ad50e811 | 2920 | else if (!DECL_EXTERNAL_LINKAGE_P (referent)) |
75650646 | 2921 | { |
8251199e | 2922 | cp_error ("address of non-extern `%E' cannot be used as template argument", referent); |
75650646 MM |
2923 | return error_mark_node; |
2924 | } | |
2925 | } | |
f3400fe2 JM |
2926 | else if (INTEGRAL_TYPE_P (expr_type) |
2927 | || TYPE_PTRMEM_P (expr_type) | |
e5844e6d | 2928 | || TYPE_PTRMEMFUNC_P (expr_type)) |
75650646 | 2929 | { |
f3400fe2 JM |
2930 | if (! TREE_CONSTANT (expr)) |
2931 | { | |
2932 | non_constant: | |
2933 | cp_error ("non-constant `%E' cannot be used as template argument", | |
2934 | expr); | |
2935 | return NULL_TREE; | |
2936 | } | |
75650646 | 2937 | } |
75650646 MM |
2938 | else |
2939 | { | |
8251199e | 2940 | cp_error ("object `%E' cannot be used as template argument", expr); |
75650646 MM |
2941 | return NULL_TREE; |
2942 | } | |
2943 | ||
2944 | switch (TREE_CODE (type)) | |
2945 | { | |
2946 | case INTEGER_TYPE: | |
2947 | case BOOLEAN_TYPE: | |
2948 | case ENUMERAL_TYPE: | |
2949 | /* For a non-type template-parameter of integral or enumeration | |
2950 | type, integral promotions (_conv.prom_) and integral | |
2951 | conversions (_conv.integral_) are applied. */ | |
2952 | if (!INTEGRAL_TYPE_P (expr_type)) | |
2953 | return error_mark_node; | |
2954 | ||
2955 | /* It's safe to call digest_init in this case; we know we're | |
2956 | just converting one integral constant expression to another. */ | |
db02b6b9 | 2957 | expr = digest_init (type, expr, (tree*) 0); |
75650646 | 2958 | |
db02b6b9 | 2959 | if (TREE_CODE (expr) != INTEGER_CST) |
f3400fe2 | 2960 | /* Curiously, some TREE_CONSTANT integral expressions do not |
db02b6b9 MM |
2961 | simplify to integer constants. For example, `3 % 0', |
2962 | remains a TRUNC_MOD_EXPR. */ | |
2963 | goto non_constant; | |
2964 | ||
2965 | return expr; | |
2966 | ||
75650646 MM |
2967 | case POINTER_TYPE: |
2968 | { | |
2969 | tree type_pointed_to = TREE_TYPE (type); | |
2970 | ||
2971 | if (TYPE_PTRMEM_P (type)) | |
93aa462d MM |
2972 | { |
2973 | tree e; | |
2974 | ||
2975 | /* For a non-type template-parameter of type pointer to data | |
2976 | member, qualification conversions (_conv.qual_) are | |
2977 | applied. */ | |
2978 | e = perform_qualification_conversions (type, expr); | |
2979 | if (TREE_CODE (e) == NOP_EXPR) | |
87533b37 MM |
2980 | /* The call to perform_qualification_conversions will |
2981 | insert a NOP_EXPR over EXPR to do express conversion, | |
2982 | if necessary. But, that will confuse us if we use | |
2983 | this (converted) template parameter to instantiate | |
2984 | another template; then the thing will not look like a | |
2985 | valid template argument. So, just make a new | |
2986 | constant, of the appropriate type. */ | |
2987 | e = make_ptrmem_cst (type, PTRMEM_CST_MEMBER (expr)); | |
93aa462d MM |
2988 | return e; |
2989 | } | |
75650646 MM |
2990 | else if (TREE_CODE (type_pointed_to) == FUNCTION_TYPE) |
2991 | { | |
2992 | /* For a non-type template-parameter of type pointer to | |
2993 | function, only the function-to-pointer conversion | |
2994 | (_conv.func_) is applied. If the template-argument | |
2995 | represents a set of overloaded functions (or a pointer to | |
2996 | such), the matching function is selected from the set | |
2997 | (_over.over_). */ | |
2998 | tree fns; | |
2999 | tree fn; | |
3000 | ||
7bf2682f | 3001 | if (TREE_CODE (expr) == ADDR_EXPR) |
75650646 MM |
3002 | fns = TREE_OPERAND (expr, 0); |
3003 | else | |
3004 | fns = expr; | |
3005 | ||
5e76004e | 3006 | fn = instantiate_type (type_pointed_to, fns, itf_none); |
75650646 MM |
3007 | |
3008 | if (fn == error_mark_node) | |
3009 | return error_mark_node; | |
3010 | ||
ad50e811 | 3011 | if (!DECL_EXTERNAL_LINKAGE_P (fn)) |
75650646 MM |
3012 | { |
3013 | if (really_overloaded_fn (fns)) | |
3014 | return error_mark_node; | |
3015 | else | |
3016 | goto bad_argument; | |
3017 | } | |
3018 | ||
3019 | expr = build_unary_op (ADDR_EXPR, fn, 0); | |
3020 | ||
3bfdc719 | 3021 | my_friendly_assert (same_type_p (type, TREE_TYPE (expr)), |
75650646 MM |
3022 | 0); |
3023 | return expr; | |
3024 | } | |
3025 | else | |
3026 | { | |
3027 | /* For a non-type template-parameter of type pointer to | |
3028 | object, qualification conversions (_conv.qual_) and the | |
3029 | array-to-pointer conversion (_conv.array_) are applied. | |
3030 | [Note: In particular, neither the null pointer conversion | |
3031 | (_conv.ptr_) nor the derived-to-base conversion | |
3032 | (_conv.ptr_) are applied. Although 0 is a valid | |
3033 | template-argument for a non-type template-parameter of | |
3034 | integral type, it is not a valid template-argument for a | |
e1467ff2 MM |
3035 | non-type template-parameter of pointer type.] |
3036 | ||
3037 | The call to decay_conversion performs the | |
3038 | array-to-pointer conversion, if appropriate. */ | |
3039 | expr = decay_conversion (expr); | |
75650646 MM |
3040 | |
3041 | if (expr == error_mark_node) | |
3042 | return error_mark_node; | |
3043 | else | |
3044 | return perform_qualification_conversions (type, expr); | |
3045 | } | |
3046 | } | |
3047 | break; | |
3048 | ||
3049 | case REFERENCE_TYPE: | |
3050 | { | |
3051 | tree type_referred_to = TREE_TYPE (type); | |
3052 | ||
0dc09a61 MM |
3053 | /* If this expression already has reference type, get the |
3054 | underling object. */ | |
3055 | if (TREE_CODE (expr_type) == REFERENCE_TYPE) | |
3056 | { | |
3057 | my_friendly_assert (TREE_CODE (expr) == ADDR_EXPR, 20000604); | |
3058 | expr = TREE_OPERAND (expr, 0); | |
3059 | expr_type = TREE_TYPE (expr); | |
3060 | } | |
3061 | ||
75650646 MM |
3062 | if (TREE_CODE (type_referred_to) == FUNCTION_TYPE) |
3063 | { | |
3064 | /* For a non-type template-parameter of type reference to | |
39c01e4c MM |
3065 | function, no conversions apply. If the |
3066 | template-argument represents a set of overloaded | |
3067 | functions, the matching function is selected from the | |
3068 | set (_over.over_). */ | |
75650646 MM |
3069 | tree fn; |
3070 | ||
5e76004e | 3071 | fn = instantiate_type (type_referred_to, expr, itf_none); |
e6e174e5 JM |
3072 | |
3073 | if (fn == error_mark_node) | |
3074 | return error_mark_node; | |
75650646 | 3075 | |
ad50e811 | 3076 | if (!DECL_EXTERNAL_LINKAGE_P (fn)) |
75650646 | 3077 | { |
0dc09a61 | 3078 | if (really_overloaded_fn (expr)) |
75650646 MM |
3079 | /* Don't issue an error here; we might get a different |
3080 | function if the overloading had worked out | |
3081 | differently. */ | |
3082 | return error_mark_node; | |
3083 | else | |
3084 | goto bad_argument; | |
3085 | } | |
3086 | ||
3bfdc719 MM |
3087 | my_friendly_assert (same_type_p (type_referred_to, |
3088 | TREE_TYPE (fn)), | |
75650646 MM |
3089 | 0); |
3090 | ||
0dc09a61 | 3091 | expr = fn; |
75650646 MM |
3092 | } |
3093 | else | |
3094 | { | |
3095 | /* For a non-type template-parameter of type reference to | |
3096 | object, no conversions apply. The type referred to by the | |
3097 | reference may be more cv-qualified than the (otherwise | |
3098 | identical) type of the template-argument. The | |
3099 | template-parameter is bound directly to the | |
3100 | template-argument, which must be an lvalue. */ | |
0dc09a61 MM |
3101 | if (!same_type_p (TYPE_MAIN_VARIANT (expr_type), |
3102 | TYPE_MAIN_VARIANT (type_referred_to)) | |
91063b51 MM |
3103 | || !at_least_as_qualified_p (type_referred_to, |
3104 | expr_type) | |
75650646 | 3105 | || !real_lvalue_p (expr)) |
fd74ca0b | 3106 | return error_mark_node; |
75650646 | 3107 | } |
0dc09a61 MM |
3108 | |
3109 | mark_addressable (expr); | |
3110 | return build1 (ADDR_EXPR, type, expr); | |
75650646 MM |
3111 | } |
3112 | break; | |
3113 | ||
3114 | case RECORD_TYPE: | |
3115 | { | |
db3f4e4e | 3116 | my_friendly_assert (TYPE_PTRMEMFUNC_P (type), 20010112); |
75650646 MM |
3117 | |
3118 | /* For a non-type template-parameter of type pointer to member | |
3119 | function, no conversions apply. If the template-argument | |
3120 | represents a set of overloaded member functions, the | |
3121 | matching member function is selected from the set | |
3122 | (_over.over_). */ | |
3123 | ||
3124 | if (!TYPE_PTRMEMFUNC_P (expr_type) && | |
3125 | expr_type != unknown_type_node) | |
3126 | return error_mark_node; | |
3127 | ||
e08a8f45 | 3128 | if (TREE_CODE (expr) == PTRMEM_CST) |
75650646 MM |
3129 | { |
3130 | /* A ptr-to-member constant. */ | |
3bfdc719 | 3131 | if (!same_type_p (type, expr_type)) |
75650646 MM |
3132 | return error_mark_node; |
3133 | else | |
3134 | return expr; | |
3135 | } | |
3136 | ||
3137 | if (TREE_CODE (expr) != ADDR_EXPR) | |
3138 | return error_mark_node; | |
3139 | ||
5e76004e | 3140 | expr = instantiate_type (type, expr, itf_none); |
75650646 | 3141 | |
d8f8dca1 | 3142 | if (expr == error_mark_node) |
75650646 MM |
3143 | return error_mark_node; |
3144 | ||
3bfdc719 | 3145 | my_friendly_assert (same_type_p (type, TREE_TYPE (expr)), |
75650646 MM |
3146 | 0); |
3147 | return expr; | |
3148 | } | |
3149 | break; | |
3150 | ||
3151 | default: | |
3152 | /* All non-type parameters must have one of these types. */ | |
3153 | my_friendly_abort (0); | |
3154 | break; | |
3155 | } | |
3156 | ||
3157 | return error_mark_node; | |
3158 | } | |
3159 | ||
744fac59 KL |
3160 | /* Return 1 if PARM_PARMS and ARG_PARMS matches using rule for |
3161 | template template parameters. Both PARM_PARMS and ARG_PARMS are | |
3162 | vectors of TREE_LIST nodes containing TYPE_DECL, TEMPLATE_DECL | |
3163 | or PARM_DECL. | |
3164 | ||
3165 | ARG_PARMS may contain more parameters than PARM_PARMS. If this is | |
3166 | the case, then extra parameters must have default arguments. | |
3167 | ||
3168 | Consider the example: | |
3169 | template <class T, class Allocator = allocator> class vector; | |
3170 | template<template <class U> class TT> class C; | |
3171 | ||
3172 | C<vector> is a valid instantiation. PARM_PARMS for the above code | |
3173 | contains a TYPE_DECL (for U), ARG_PARMS contains two TYPE_DECLs (for | |
3174 | T and Allocator) and OUTER_ARGS contains the argument that is used to | |
3175 | substitute the TT parameter. */ | |
3176 | ||
3177 | static int | |
4393e105 MM |
3178 | coerce_template_template_parms (parm_parms, arg_parms, complain, |
3179 | in_decl, outer_args) | |
3180 | tree parm_parms, arg_parms; | |
3181 | int complain; | |
3182 | tree in_decl, outer_args; | |
744fac59 KL |
3183 | { |
3184 | int nparms, nargs, i; | |
3185 | tree parm, arg; | |
3186 | ||
3187 | my_friendly_assert (TREE_CODE (parm_parms) == TREE_VEC, 0); | |
3188 | my_friendly_assert (TREE_CODE (arg_parms) == TREE_VEC, 0); | |
3189 | ||
3190 | nparms = TREE_VEC_LENGTH (parm_parms); | |
3191 | nargs = TREE_VEC_LENGTH (arg_parms); | |
3192 | ||
3193 | /* The rule here is opposite of coerce_template_parms. */ | |
3194 | if (nargs < nparms | |
3195 | || (nargs > nparms | |
3196 | && TREE_PURPOSE (TREE_VEC_ELT (arg_parms, nparms)) == NULL_TREE)) | |
3197 | return 0; | |
3198 | ||
3199 | for (i = 0; i < nparms; ++i) | |
3200 | { | |
3201 | parm = TREE_VALUE (TREE_VEC_ELT (parm_parms, i)); | |
3202 | arg = TREE_VALUE (TREE_VEC_ELT (arg_parms, i)); | |
3203 | ||
3204 | if (arg == NULL_TREE || arg == error_mark_node | |
3205 | || parm == NULL_TREE || parm == error_mark_node) | |
3206 | return 0; | |
3207 | ||
3208 | if (TREE_CODE (arg) != TREE_CODE (parm)) | |
3209 | return 0; | |
3210 | ||
3211 | switch (TREE_CODE (parm)) | |
3212 | { | |
3213 | case TYPE_DECL: | |
3214 | break; | |
3215 | ||
3216 | case TEMPLATE_DECL: | |
3217 | /* We encounter instantiations of templates like | |
3218 | template <template <template <class> class> class TT> | |
3219 | class C; */ | |
700466c2 JM |
3220 | { |
3221 | tree parmparm = DECL_INNERMOST_TEMPLATE_PARMS (parm); | |
3222 | tree argparm = DECL_INNERMOST_TEMPLATE_PARMS (arg); | |
3223 | ||
3224 | if (!coerce_template_template_parms (parmparm, argparm, | |
4393e105 MM |
3225 | complain, in_decl, |
3226 | outer_args)) | |
700466c2 JM |
3227 | return 0; |
3228 | } | |
3229 | break; | |
744fac59 KL |
3230 | |
3231 | case PARM_DECL: | |
3232 | /* The tsubst call is used to handle cases such as | |
3233 | template <class T, template <T> class TT> class D; | |
3234 | i.e. the parameter list of TT depends on earlier parameters. */ | |
4393e105 MM |
3235 | if (!same_type_p (tsubst (TREE_TYPE (parm), outer_args, |
3236 | complain, in_decl), | |
3bfdc719 | 3237 | TREE_TYPE (arg))) |
744fac59 KL |
3238 | return 0; |
3239 | break; | |
3240 | ||
3241 | default: | |
3242 | my_friendly_abort (0); | |
3243 | } | |
3244 | } | |
3245 | return 1; | |
3246 | } | |
3247 | ||
8b5b8b7c MM |
3248 | /* Convert the indicated template ARG as necessary to match the |
3249 | indicated template PARM. Returns the converted ARG, or | |
3250 | error_mark_node if the conversion was unsuccessful. Error messages | |
3251 | are issued if COMPLAIN is non-zero. This conversion is for the Ith | |
3252 | parameter in the parameter list. ARGS is the full set of template | |
3253 | arguments deduced so far. */ | |
3254 | ||
3255 | static tree | |
3256 | convert_template_argument (parm, arg, args, complain, i, in_decl) | |
3257 | tree parm; | |
3258 | tree arg; | |
3259 | tree args; | |
3260 | int complain; | |
3261 | int i; | |
3262 | tree in_decl; | |
3263 | { | |
3264 | tree val; | |
3265 | tree inner_args; | |
3266 | int is_type, requires_type, is_tmpl_type, requires_tmpl_type; | |
3267 | ||
f9a7ae04 | 3268 | inner_args = INNERMOST_TEMPLATE_ARGS (args); |
8b5b8b7c MM |
3269 | |
3270 | if (TREE_CODE (arg) == TREE_LIST | |
3271 | && TREE_TYPE (arg) != NULL_TREE | |
3272 | && TREE_CODE (TREE_TYPE (arg)) == OFFSET_TYPE) | |
3273 | { | |
3274 | /* The template argument was the name of some | |
3275 | member function. That's usually | |
3276 | illegal, but static members are OK. In any | |
3277 | case, grab the underlying fields/functions | |
3278 | and issue an error later if required. */ | |
3279 | arg = TREE_VALUE (arg); | |
3280 | TREE_TYPE (arg) = unknown_type_node; | |
3281 | } | |
3282 | ||
3283 | requires_tmpl_type = TREE_CODE (parm) == TEMPLATE_DECL; | |
3284 | requires_type = (TREE_CODE (parm) == TYPE_DECL | |
3285 | || requires_tmpl_type); | |
3286 | ||
3287 | /* Check if it is a class template. If REQUIRES_TMPL_TYPE is true, | |
3288 | we also accept implicitly created TYPE_DECL as a valid argument. | |
3289 | This is necessary to handle the case where we pass a template name | |
3290 | to a template template parameter in a scope where we've derived from | |
3291 | in instantiation of that template, so the template name refers to that | |
3292 | instantiation. We really ought to handle this better. */ | |
3293 | is_tmpl_type | |
3294 | = ((TREE_CODE (arg) == TEMPLATE_DECL | |
3295 | && TREE_CODE (DECL_TEMPLATE_RESULT (arg)) == TYPE_DECL) | |
a1281f45 | 3296 | || TREE_CODE (arg) == TEMPLATE_TEMPLATE_PARM |
8b5b8b7c MM |
3297 | || (TREE_CODE (arg) == RECORD_TYPE |
3298 | && CLASSTYPE_TEMPLATE_INFO (arg) | |
3299 | && TREE_CODE (TYPE_NAME (arg)) == TYPE_DECL | |
3300 | && DECL_ARTIFICIAL (TYPE_NAME (arg)) | |
3301 | && requires_tmpl_type | |
b54ccf71 | 3302 | && is_base_of_enclosing_class (arg, current_class_type))); |
8b5b8b7c MM |
3303 | if (is_tmpl_type && TREE_CODE (arg) == TEMPLATE_TEMPLATE_PARM) |
3304 | arg = TYPE_STUB_DECL (arg); | |
3305 | else if (is_tmpl_type && TREE_CODE (arg) == RECORD_TYPE) | |
3306 | arg = CLASSTYPE_TI_TEMPLATE (arg); | |
3307 | ||
2f939d94 | 3308 | is_type = TYPE_P (arg) || is_tmpl_type; |
8b5b8b7c MM |
3309 | |
3310 | if (requires_type && ! is_type && TREE_CODE (arg) == SCOPE_REF | |
3311 | && TREE_CODE (TREE_OPERAND (arg, 0)) == TEMPLATE_TYPE_PARM) | |
3312 | { | |
b4f4233d | 3313 | cp_pedwarn ("to refer to a type member of a template parameter, use `typename %E'", arg); |
8b5b8b7c MM |
3314 | |
3315 | arg = make_typename_type (TREE_OPERAND (arg, 0), | |
3baa501d MM |
3316 | TREE_OPERAND (arg, 1), |
3317 | complain); | |
8b5b8b7c MM |
3318 | is_type = 1; |
3319 | } | |
3320 | if (is_type != requires_type) | |
3321 | { | |
3322 | if (in_decl) | |
3323 | { | |
3324 | if (complain) | |
3325 | { | |
8251199e | 3326 | cp_error ("type/value mismatch at argument %d in template parameter list for `%D'", |
8b5b8b7c MM |
3327 | i + 1, in_decl); |
3328 | if (is_type) | |
8251199e | 3329 | cp_error (" expected a constant of type `%T', got `%T'", |
8b5b8b7c MM |
3330 | TREE_TYPE (parm), |
3331 | (is_tmpl_type ? DECL_NAME (arg) : arg)); | |
3332 | else | |
8251199e | 3333 | cp_error (" expected a type, got `%E'", arg); |
8b5b8b7c MM |
3334 | } |
3335 | } | |
3336 | return error_mark_node; | |
3337 | } | |
3338 | if (is_tmpl_type ^ requires_tmpl_type) | |
3339 | { | |
3340 | if (in_decl && complain) | |
3341 | { | |
8251199e | 3342 | cp_error ("type/value mismatch at argument %d in template parameter list for `%D'", |
8b5b8b7c MM |
3343 | i + 1, in_decl); |
3344 | if (is_tmpl_type) | |
8251199e | 3345 | cp_error (" expected a type, got `%T'", DECL_NAME (arg)); |
8b5b8b7c | 3346 | else |
8251199e | 3347 | cp_error (" expected a class template, got `%T'", arg); |
8b5b8b7c MM |
3348 | } |
3349 | return error_mark_node; | |
3350 | } | |
3351 | ||
3352 | if (is_type) | |
3353 | { | |
3354 | if (requires_tmpl_type) | |
3355 | { | |
3356 | tree parmparm = DECL_INNERMOST_TEMPLATE_PARMS (parm); | |
3357 | tree argparm = DECL_INNERMOST_TEMPLATE_PARMS (arg); | |
3358 | ||
4393e105 | 3359 | if (coerce_template_template_parms (parmparm, argparm, complain, |
8b5b8b7c MM |
3360 | in_decl, inner_args)) |
3361 | { | |
3362 | val = arg; | |
3363 | ||
3364 | /* TEMPLATE_TEMPLATE_PARM node is preferred over | |
3365 | TEMPLATE_DECL. */ | |
3366 | if (val != error_mark_node | |
3367 | && DECL_TEMPLATE_TEMPLATE_PARM_P (val)) | |
3368 | val = TREE_TYPE (val); | |
3369 | } | |
3370 | else | |
3371 | { | |
3372 | if (in_decl && complain) | |
3373 | { | |
8251199e | 3374 | cp_error ("type/value mismatch at argument %d in template parameter list for `%D'", |
8b5b8b7c | 3375 | i + 1, in_decl); |
8251199e | 3376 | cp_error (" expected a template of type `%D', got `%D'", parm, arg); |
8b5b8b7c MM |
3377 | } |
3378 | ||
3379 | val = error_mark_node; | |
3380 | } | |
3381 | } | |
3382 | else | |
3383 | { | |
3384 | val = groktypename (arg); | |
3385 | if (! processing_template_decl) | |
3386 | { | |
3387 | /* [basic.link]: A name with no linkage (notably, the | |
3388 | name of a class or enumeration declared in a local | |
3389 | scope) shall not be used to declare an entity with | |
3390 | linkage. This implies that names with no linkage | |
3391 | cannot be used as template arguments. */ | |
3392 | tree t = no_linkage_check (val); | |
3393 | if (t) | |
3394 | { | |
1951a1b6 | 3395 | if (TYPE_ANONYMOUS_P (t)) |
8251199e JM |
3396 | cp_pedwarn |
3397 | ("template-argument `%T' uses anonymous type", val); | |
8b5b8b7c | 3398 | else |
8251199e JM |
3399 | cp_error |
3400 | ("template-argument `%T' uses local type `%T'", | |
8b5b8b7c MM |
3401 | val, t); |
3402 | return error_mark_node; | |
3403 | } | |
3404 | } | |
3405 | } | |
3406 | } | |
3407 | else | |
3408 | { | |
4393e105 | 3409 | tree t = tsubst (TREE_TYPE (parm), args, complain, in_decl); |
8b5b8b7c | 3410 | |
11b810f1 | 3411 | if (invalid_nontype_parm_type_p (t, complain)) |
db3f4e4e NS |
3412 | return error_mark_node; |
3413 | ||
8b5b8b7c MM |
3414 | if (processing_template_decl) |
3415 | arg = maybe_fold_nontype_arg (arg); | |
3416 | ||
3417 | if (!uses_template_parms (arg) && !uses_template_parms (t)) | |
3418 | /* We used to call digest_init here. However, digest_init | |
3419 | will report errors, which we don't want when complain | |
3420 | is zero. More importantly, digest_init will try too | |
3421 | hard to convert things: for example, `0' should not be | |
3422 | converted to pointer type at this point according to | |
3423 | the standard. Accepting this is not merely an | |
3424 | extension, since deciding whether or not these | |
3425 | conversions can occur is part of determining which | |
dc957d14 | 3426 | function template to call, or whether a given explicit |
8b5b8b7c MM |
3427 | argument specification is legal. */ |
3428 | val = convert_nontype_argument (t, arg); | |
3429 | else | |
3430 | val = arg; | |
3431 | ||
3432 | if (val == NULL_TREE) | |
3433 | val = error_mark_node; | |
3434 | else if (val == error_mark_node && complain) | |
8251199e | 3435 | cp_error ("could not convert template argument `%E' to `%T'", |
8b5b8b7c MM |
3436 | arg, t); |
3437 | } | |
3438 | ||
3439 | return val; | |
3440 | } | |
3441 | ||
3442 | /* Convert all template arguments to their appropriate types, and | |
3443 | return a vector containing the innermost resulting template | |
3444 | arguments. If any error occurs, return error_mark_node, and, if | |
3445 | COMPLAIN is non-zero, issue an error message. Some error messages | |
3446 | are issued even if COMPLAIN is zero; for instance, if a template | |
3447 | argument is composed from a local class. | |
75650646 MM |
3448 | |
3449 | If REQUIRE_ALL_ARGUMENTS is non-zero, all arguments must be | |
3450 | provided in ARGLIST, or else trailing parameters must have default | |
3451 | values. If REQUIRE_ALL_ARGUMENTS is zero, we will attempt argument | |
6dfbb909 | 3452 | deduction for any unspecified trailing arguments. */ |
de575009 | 3453 | |
8d08fdba | 3454 | static tree |
8b5b8b7c | 3455 | coerce_template_parms (parms, args, in_decl, |
75650646 | 3456 | complain, |
744fac59 | 3457 | require_all_arguments) |
8b5b8b7c | 3458 | tree parms, args; |
8d08fdba | 3459 | tree in_decl; |
75650646 MM |
3460 | int complain; |
3461 | int require_all_arguments; | |
8d08fdba | 3462 | { |
a292b002 | 3463 | int nparms, nargs, i, lost = 0; |
e4a84209 | 3464 | tree inner_args; |
8b5b8b7c MM |
3465 | tree new_args; |
3466 | tree new_inner_args; | |
a292b002 | 3467 | |
f9a7ae04 | 3468 | inner_args = INNERMOST_TEMPLATE_ARGS (args); |
e4a84209 | 3469 | nargs = NUM_TMPL_ARGS (inner_args); |
a292b002 MS |
3470 | nparms = TREE_VEC_LENGTH (parms); |
3471 | ||
3472 | if (nargs > nparms | |
3473 | || (nargs < nparms | |
75650646 | 3474 | && require_all_arguments |
a292b002 | 3475 | && TREE_PURPOSE (TREE_VEC_ELT (parms, nargs)) == NULL_TREE)) |
8d08fdba | 3476 | { |
75650646 MM |
3477 | if (complain) |
3478 | { | |
8251199e | 3479 | cp_error ("wrong number of template arguments (%d, should be %d)", |
e4a84209 | 3480 | nargs, nparms); |
75650646 MM |
3481 | |
3482 | if (in_decl) | |
8251199e | 3483 | cp_error_at ("provided for `%D'", in_decl); |
75650646 MM |
3484 | } |
3485 | ||
8d08fdba MS |
3486 | return error_mark_node; |
3487 | } | |
3488 | ||
f31c0a32 | 3489 | new_inner_args = make_tree_vec (nparms); |
8b5b8b7c MM |
3490 | new_args = add_outermost_template_args (args, new_inner_args); |
3491 | for (i = 0; i < nparms; i++) | |
8d08fdba | 3492 | { |
8b5b8b7c MM |
3493 | tree arg; |
3494 | tree parm; | |
e4a84209 | 3495 | |
8b5b8b7c MM |
3496 | /* Get the Ith template parameter. */ |
3497 | parm = TREE_VEC_ELT (parms, i); | |
75650646 | 3498 | |
8b5b8b7c MM |
3499 | /* Calculate the Ith argument. */ |
3500 | if (inner_args && TREE_CODE (inner_args) == TREE_LIST) | |
8d08fdba | 3501 | { |
8b5b8b7c MM |
3502 | arg = TREE_VALUE (inner_args); |
3503 | inner_args = TREE_CHAIN (inner_args); | |
8d08fdba | 3504 | } |
8b5b8b7c MM |
3505 | else if (i < nargs) |
3506 | arg = TREE_VEC_ELT (inner_args, i); | |
3507 | /* If no template argument was supplied, look for a default | |
3508 | value. */ | |
3509 | else if (TREE_PURPOSE (parm) == NULL_TREE) | |
3510 | { | |
3511 | /* There was no default value. */ | |
3512 | my_friendly_assert (!require_all_arguments, 0); | |
3513 | break; | |
3514 | } | |
3515 | else if (TREE_CODE (TREE_VALUE (parm)) == TYPE_DECL) | |
4393e105 | 3516 | arg = tsubst (TREE_PURPOSE (parm), new_args, complain, in_decl); |
8b5b8b7c | 3517 | else |
4393e105 MM |
3518 | arg = tsubst_expr (TREE_PURPOSE (parm), new_args, complain, |
3519 | in_decl); | |
e4a84209 | 3520 | |
8b5b8b7c | 3521 | /* Now, convert the Ith argument, as necessary. */ |
75650646 MM |
3522 | if (arg == NULL_TREE) |
3523 | /* We're out of arguments. */ | |
3524 | { | |
3525 | my_friendly_assert (!require_all_arguments, 0); | |
3526 | break; | |
3527 | } | |
8b5b8b7c | 3528 | else if (arg == error_mark_node) |
75650646 | 3529 | { |
8251199e | 3530 | cp_error ("template argument %d is invalid", i + 1); |
8b5b8b7c | 3531 | arg = error_mark_node; |
8d08fdba | 3532 | } |
8b5b8b7c MM |
3533 | else |
3534 | arg = convert_template_argument (TREE_VALUE (parm), | |
3535 | arg, new_args, complain, i, | |
3536 | in_decl); | |
3537 | ||
3538 | if (arg == error_mark_node) | |
8d08fdba | 3539 | lost++; |
8b5b8b7c | 3540 | TREE_VEC_ELT (new_inner_args, i) = arg; |
8d08fdba | 3541 | } |
8b5b8b7c | 3542 | |
8d08fdba MS |
3543 | if (lost) |
3544 | return error_mark_node; | |
8b5b8b7c MM |
3545 | |
3546 | return new_inner_args; | |
8d08fdba MS |
3547 | } |
3548 | ||
34016c81 JM |
3549 | /* Returns 1 if template args OT and NT are equivalent. */ |
3550 | ||
d8e178a0 | 3551 | static int |
34016c81 JM |
3552 | template_args_equal (ot, nt) |
3553 | tree ot, nt; | |
3554 | { | |
3555 | if (nt == ot) | |
3556 | return 1; | |
74601d7c | 3557 | |
34016c81 JM |
3558 | if (TREE_CODE (nt) == TREE_VEC) |
3559 | /* For member templates */ | |
74601d7c KL |
3560 | return TREE_CODE (ot) == TREE_VEC && comp_template_args (ot, nt); |
3561 | else if (TYPE_P (nt)) | |
3562 | return TYPE_P (ot) && same_type_p (ot, nt); | |
3563 | else if (TREE_CODE (ot) == TREE_VEC || TYPE_P (ot)) | |
3564 | return 0; | |
34016c81 JM |
3565 | else |
3566 | return (cp_tree_equal (ot, nt) > 0); | |
3567 | } | |
3568 | ||
3569 | /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets | |
f84b4be9 JM |
3570 | of template arguments. Returns 0 otherwise. */ |
3571 | ||
6757edfe | 3572 | int |
5566b478 MS |
3573 | comp_template_args (oldargs, newargs) |
3574 | tree oldargs, newargs; | |
3575 | { | |
3576 | int i; | |
3577 | ||
386b8a85 JM |
3578 | if (TREE_VEC_LENGTH (oldargs) != TREE_VEC_LENGTH (newargs)) |
3579 | return 0; | |
3580 | ||
5566b478 MS |
3581 | for (i = 0; i < TREE_VEC_LENGTH (oldargs); ++i) |
3582 | { | |
3583 | tree nt = TREE_VEC_ELT (newargs, i); | |
3584 | tree ot = TREE_VEC_ELT (oldargs, i); | |
3585 | ||
34016c81 | 3586 | if (! template_args_equal (ot, nt)) |
61a127b3 | 3587 | return 0; |
5566b478 MS |
3588 | } |
3589 | return 1; | |
3590 | } | |
3591 | ||
8d08fdba MS |
3592 | /* Given class template name and parameter list, produce a user-friendly name |
3593 | for the instantiation. */ | |
e92cc029 | 3594 | |
8d08fdba | 3595 | static char * |
36a117a5 | 3596 | mangle_class_name_for_template (name, parms, arglist) |
63ad61ed | 3597 | const char *name; |
8d08fdba MS |
3598 | tree parms, arglist; |
3599 | { | |
3600 | static struct obstack scratch_obstack; | |
3601 | static char *scratch_firstobj; | |
3602 | int i, nparms; | |
8d08fdba MS |
3603 | |
3604 | if (!scratch_firstobj) | |
fc378698 | 3605 | gcc_obstack_init (&scratch_obstack); |
8d08fdba MS |
3606 | else |
3607 | obstack_free (&scratch_obstack, scratch_firstobj); | |
fc378698 | 3608 | scratch_firstobj = obstack_alloc (&scratch_obstack, 1); |
8d08fdba | 3609 | |
8d08fdba | 3610 | #define ccat(c) obstack_1grow (&scratch_obstack, (c)); |
8d08fdba | 3611 | #define cat(s) obstack_grow (&scratch_obstack, (s), strlen (s)) |
8d08fdba MS |
3612 | |
3613 | cat (name); | |
3614 | ccat ('<'); | |
3615 | nparms = TREE_VEC_LENGTH (parms); | |
f9a7ae04 | 3616 | arglist = INNERMOST_TEMPLATE_ARGS (arglist); |
8d08fdba MS |
3617 | my_friendly_assert (nparms == TREE_VEC_LENGTH (arglist), 268); |
3618 | for (i = 0; i < nparms; i++) | |
3619 | { | |
a292b002 MS |
3620 | tree parm = TREE_VALUE (TREE_VEC_ELT (parms, i)); |
3621 | tree arg = TREE_VEC_ELT (arglist, i); | |
8d08fdba MS |
3622 | |
3623 | if (i) | |
3624 | ccat (','); | |
3625 | ||
a292b002 | 3626 | if (TREE_CODE (parm) == TYPE_DECL) |
8d08fdba | 3627 | { |
761f0855 | 3628 | cat (type_as_string (arg, TFF_CHASE_TYPEDEF)); |
8d08fdba MS |
3629 | continue; |
3630 | } | |
73b0fce8 KL |
3631 | else if (TREE_CODE (parm) == TEMPLATE_DECL) |
3632 | { | |
3633 | if (TREE_CODE (arg) == TEMPLATE_DECL) | |
2c73f9f5 ML |
3634 | { |
3635 | /* Already substituted with real template. Just output | |
3636 | the template name here */ | |
cb0dbb9a | 3637 | tree context = DECL_CONTEXT (arg); |
ec4f972f AS |
3638 | if (context) |
3639 | { | |
3640 | /* The template may be defined in a namespace, or | |
3641 | may be a member template. */ | |
3642 | my_friendly_assert (TREE_CODE (context) == NAMESPACE_DECL | |
3643 | || CLASS_TYPE_P (context), | |
3644 | 980422); | |
761f0855 | 3645 | cat(decl_as_string (DECL_CONTEXT (arg), TFF_PLAIN_IDENTIFIER)); |
2c73f9f5 ML |
3646 | cat("::"); |
3647 | } | |
3648 | cat (IDENTIFIER_POINTER (DECL_NAME (arg))); | |
3649 | } | |
73b0fce8 KL |
3650 | else |
3651 | /* Output the parameter declaration */ | |
761f0855 | 3652 | cat (type_as_string (arg, TFF_CHASE_TYPEDEF)); |
73b0fce8 KL |
3653 | continue; |
3654 | } | |
8d08fdba MS |
3655 | else |
3656 | my_friendly_assert (TREE_CODE (parm) == PARM_DECL, 269); | |
3657 | ||
3658 | if (TREE_CODE (arg) == TREE_LIST) | |
3659 | { | |
3660 | /* New list cell was built because old chain link was in | |
3661 | use. */ | |
3662 | my_friendly_assert (TREE_PURPOSE (arg) == NULL_TREE, 270); | |
3663 | arg = TREE_VALUE (arg); | |
3664 | } | |
3665 | /* No need to check arglist against parmlist here; we did that | |
3666 | in coerce_template_parms, called from lookup_template_class. */ | |
761f0855 | 3667 | cat (expr_as_string (arg, TFF_PLAIN_IDENTIFIER)); |
8d08fdba MS |
3668 | } |
3669 | { | |
3670 | char *bufp = obstack_next_free (&scratch_obstack); | |
3671 | int offset = 0; | |
3672 | while (bufp[offset - 1] == ' ') | |
3673 | offset--; | |
3674 | obstack_blank_fast (&scratch_obstack, offset); | |
3675 | ||
3676 | /* B<C<char> >, not B<C<char>> */ | |
3677 | if (bufp[offset - 1] == '>') | |
3678 | ccat (' '); | |
3679 | } | |
3680 | ccat ('>'); | |
3681 | ccat ('\0'); | |
3682 | return (char *) obstack_base (&scratch_obstack); | |
8d08fdba MS |
3683 | } |
3684 | ||
bd6dd845 | 3685 | static tree |
5566b478 MS |
3686 | classtype_mangled_name (t) |
3687 | tree t; | |
3688 | { | |
3689 | if (CLASSTYPE_TEMPLATE_INFO (t) | |
36a117a5 MM |
3690 | /* Specializations have already had their names set up in |
3691 | lookup_template_class. */ | |
370af2d5 | 3692 | && !CLASSTYPE_TEMPLATE_SPECIALIZATION (t)) |
9fbf56f7 MM |
3693 | { |
3694 | tree tmpl = most_general_template (CLASSTYPE_TI_TEMPLATE (t)); | |
3695 | ||
36a117a5 MM |
3696 | /* For non-primary templates, the template parameters are |
3697 | implicit from their surrounding context. */ | |
9fbf56f7 MM |
3698 | if (PRIMARY_TEMPLATE_P (tmpl)) |
3699 | { | |
3700 | tree name = DECL_NAME (tmpl); | |
3701 | char *mangled_name = mangle_class_name_for_template | |
3702 | (IDENTIFIER_POINTER (name), | |
3703 | DECL_INNERMOST_TEMPLATE_PARMS (tmpl), | |
3704 | CLASSTYPE_TI_ARGS (t)); | |
3705 | tree id = get_identifier (mangled_name); | |
3706 | IDENTIFIER_TEMPLATE (id) = name; | |
3707 | return id; | |
3708 | } | |
5566b478 | 3709 | } |
9fbf56f7 MM |
3710 | |
3711 | return TYPE_IDENTIFIER (t); | |
5566b478 MS |
3712 | } |
3713 | ||
3714 | static void | |
3715 | add_pending_template (d) | |
3716 | tree d; | |
3717 | { | |
3ae18eaf JM |
3718 | tree ti = (TYPE_P (d) |
3719 | ? CLASSTYPE_TEMPLATE_INFO (d) | |
3720 | : DECL_TEMPLATE_INFO (d)); | |
46ccf50a | 3721 | tree pt; |
3ae18eaf | 3722 | int level; |
e92cc029 | 3723 | |
824b9a4c | 3724 | if (TI_PENDING_TEMPLATE_FLAG (ti)) |
5566b478 MS |
3725 | return; |
3726 | ||
3ae18eaf JM |
3727 | /* We are called both from instantiate_decl, where we've already had a |
3728 | tinst_level pushed, and instantiate_template, where we haven't. | |
3729 | Compensate. */ | |
3730 | level = !(current_tinst_level && TINST_DECL (current_tinst_level) == d); | |
3731 | ||
3732 | if (level) | |
3733 | push_tinst_level (d); | |
3734 | ||
46ccf50a JM |
3735 | pt = tree_cons (current_tinst_level, d, NULL_TREE); |
3736 | if (last_pending_template) | |
3737 | TREE_CHAIN (last_pending_template) = pt; | |
3738 | else | |
3739 | pending_templates = pt; | |
3740 | ||
3741 | last_pending_template = pt; | |
3742 | ||
824b9a4c | 3743 | TI_PENDING_TEMPLATE_FLAG (ti) = 1; |
3ae18eaf JM |
3744 | |
3745 | if (level) | |
3746 | pop_tinst_level (); | |
5566b478 MS |
3747 | } |
3748 | ||
386b8a85 JM |
3749 | |
3750 | /* Return a TEMPLATE_ID_EXPR corresponding to the indicated FNS (which | |
3751 | may be either a _DECL or an overloaded function or an | |
3752 | IDENTIFIER_NODE), and ARGLIST. */ | |
3753 | ||
3754 | tree | |
3755 | lookup_template_function (fns, arglist) | |
3756 | tree fns, arglist; | |
3757 | { | |
2c73f9f5 | 3758 | tree type; |
050367a3 | 3759 | |
386b8a85 JM |
3760 | if (fns == NULL_TREE) |
3761 | { | |
8251199e | 3762 | cp_error ("non-template used as template"); |
386b8a85 JM |
3763 | return error_mark_node; |
3764 | } | |
3765 | ||
2c73f9f5 ML |
3766 | type = TREE_TYPE (fns); |
3767 | if (TREE_CODE (fns) == OVERLOAD || !type) | |
3768 | type = unknown_type_node; | |
3769 | ||
672476cb MM |
3770 | if (processing_template_decl) |
3771 | return build_min (TEMPLATE_ID_EXPR, type, fns, arglist); | |
3772 | else | |
3773 | return build (TEMPLATE_ID_EXPR, type, fns, arglist); | |
386b8a85 JM |
3774 | } |
3775 | ||
a2b60a0e MM |
3776 | /* Within the scope of a template class S<T>, the name S gets bound |
3777 | (in build_self_reference) to a TYPE_DECL for the class, not a | |
3778 | TEMPLATE_DECL. If DECL is a TYPE_DECL for current_class_type, | |
3779 | or one of its enclosing classes, and that type is a template, | |
3780 | return the associated TEMPLATE_DECL. Otherwise, the original | |
3781 | DECL is returned. */ | |
3782 | ||
e9659ab0 | 3783 | static tree |
a2b60a0e MM |
3784 | maybe_get_template_decl_from_type_decl (decl) |
3785 | tree decl; | |
3786 | { | |
3787 | return (decl != NULL_TREE | |
3788 | && TREE_CODE (decl) == TYPE_DECL | |
3789 | && DECL_ARTIFICIAL (decl) | |
511b60ff | 3790 | && CLASS_TYPE_P (TREE_TYPE (decl)) |
a2b60a0e MM |
3791 | && CLASSTYPE_TEMPLATE_INFO (TREE_TYPE (decl))) |
3792 | ? CLASSTYPE_TI_TEMPLATE (TREE_TYPE (decl)) : decl; | |
3793 | } | |
386b8a85 | 3794 | |
8d08fdba MS |
3795 | /* Given an IDENTIFIER_NODE (type TEMPLATE_DECL) and a chain of |
3796 | parameters, find the desired type. | |
3797 | ||
3798 | D1 is the PTYPENAME terminal, and ARGLIST is the list of arguments. | |
36a117a5 MM |
3799 | (Actually ARGLIST may be either a TREE_LIST or a TREE_VEC. It will |
3800 | be a TREE_LIST if called directly from the parser, and a TREE_VEC | |
ab097535 | 3801 | otherwise.) |
8d08fdba MS |
3802 | |
3803 | IN_DECL, if non-NULL, is the template declaration we are trying to | |
75650646 MM |
3804 | instantiate. |
3805 | ||
36a117a5 MM |
3806 | If ENTERING_SCOPE is non-zero, we are about to enter the scope of |
3807 | the class we are looking up. | |
f9c244b8 NS |
3808 | |
3809 | If COMPLAIN is non-zero, issue error messages. | |
36a117a5 | 3810 | |
75650646 MM |
3811 | If the template class is really a local class in a template |
3812 | function, then the FUNCTION_CONTEXT is the function in which it is | |
3813 | being instantiated. */ | |
e92cc029 | 3814 | |
8d08fdba | 3815 | tree |
f9c244b8 | 3816 | lookup_template_class (d1, arglist, in_decl, context, entering_scope, complain) |
8d08fdba MS |
3817 | tree d1, arglist; |
3818 | tree in_decl; | |
e1467ff2 | 3819 | tree context; |
36a117a5 | 3820 | int entering_scope; |
f9c244b8 | 3821 | int complain; |
8d08fdba | 3822 | { |
a703fb38 | 3823 | tree template = NULL_TREE, parmlist; |
dbfe2124 | 3824 | tree t; |
5566b478 MS |
3825 | |
3826 | if (TREE_CODE (d1) == IDENTIFIER_NODE) | |
3827 | { | |
f181d4ae MM |
3828 | if (IDENTIFIER_VALUE (d1) |
3829 | && DECL_TEMPLATE_TEMPLATE_PARM_P (IDENTIFIER_VALUE (d1))) | |
3830 | template = IDENTIFIER_VALUE (d1); | |
73b0fce8 KL |
3831 | else |
3832 | { | |
2c73f9f5 ML |
3833 | if (context) |
3834 | push_decl_namespace (context); | |
3ebc5c52 MM |
3835 | template = lookup_name (d1, /*prefer_type=*/0); |
3836 | template = maybe_get_template_decl_from_type_decl (template); | |
2c73f9f5 ML |
3837 | if (context) |
3838 | pop_decl_namespace (); | |
73b0fce8 | 3839 | } |
8d019cef JM |
3840 | if (template) |
3841 | context = DECL_CONTEXT (template); | |
5566b478 | 3842 | } |
c91a56d2 MS |
3843 | else if (TREE_CODE (d1) == TYPE_DECL && IS_AGGR_TYPE (TREE_TYPE (d1))) |
3844 | { | |
802dbc34 JM |
3845 | tree type = TREE_TYPE (d1); |
3846 | ||
3847 | /* If we are declaring a constructor, say A<T>::A<T>, we will get | |
3848 | an implicit typename for the second A. Deal with it. */ | |
3849 | if (TREE_CODE (type) == TYPENAME_TYPE && TREE_TYPE (type)) | |
3850 | type = TREE_TYPE (type); | |
3851 | ||
3852 | if (CLASSTYPE_TEMPLATE_INFO (type)) | |
f3400fe2 | 3853 | { |
802dbc34 | 3854 | template = CLASSTYPE_TI_TEMPLATE (type); |
f3400fe2 JM |
3855 | d1 = DECL_NAME (template); |
3856 | } | |
c91a56d2 | 3857 | } |
ed44da02 | 3858 | else if (TREE_CODE (d1) == ENUMERAL_TYPE |
2f939d94 | 3859 | || (TYPE_P (d1) && IS_AGGR_TYPE (d1))) |
5566b478 | 3860 | { |
ed44da02 | 3861 | template = TYPE_TI_TEMPLATE (d1); |
5566b478 MS |
3862 | d1 = DECL_NAME (template); |
3863 | } | |
93cdc044 | 3864 | else if (TREE_CODE (d1) == TEMPLATE_DECL |
17aec3eb | 3865 | && TREE_CODE (DECL_TEMPLATE_RESULT (d1)) == TYPE_DECL) |
93cdc044 JM |
3866 | { |
3867 | template = d1; | |
3868 | d1 = DECL_NAME (template); | |
3869 | context = DECL_CONTEXT (template); | |
3870 | } | |
8d08fdba | 3871 | |
8d08fdba | 3872 | /* With something like `template <class T> class X class X { ... };' |
f181d4ae MM |
3873 | we could end up with D1 having nothing but an IDENTIFIER_VALUE. |
3874 | We don't want to do that, but we have to deal with the situation, | |
3875 | so let's give them some syntax errors to chew on instead of a | |
1bc0793e | 3876 | crash. Alternatively D1 might not be a template type at all. */ |
8d08fdba | 3877 | if (! template) |
f3400fe2 | 3878 | { |
f9c244b8 NS |
3879 | if (complain) |
3880 | cp_error ("`%T' is not a template", d1); | |
f3400fe2 JM |
3881 | return error_mark_node; |
3882 | } | |
2c73f9f5 | 3883 | |
a87b4257 NS |
3884 | if (TREE_CODE (template) != TEMPLATE_DECL |
3885 | /* If we're called from the parser, make sure it's a user visible | |
3886 | template. */ | |
3887 | || ((!arglist || TREE_CODE (arglist) == TREE_LIST) | |
3888 | && !DECL_TEMPLATE_PARM_P (template) | |
3889 | && !PRIMARY_TEMPLATE_P (template))) | |
8d08fdba | 3890 | { |
f9c244b8 NS |
3891 | if (complain) |
3892 | { | |
3893 | cp_error ("non-template type `%T' used as a template", d1); | |
3894 | if (in_decl) | |
3895 | cp_error_at ("for template declaration `%D'", in_decl); | |
3896 | } | |
8d08fdba MS |
3897 | return error_mark_node; |
3898 | } | |
8d08fdba | 3899 | |
73b0fce8 KL |
3900 | if (DECL_TEMPLATE_TEMPLATE_PARM_P (template)) |
3901 | { | |
3902 | /* Create a new TEMPLATE_DECL and TEMPLATE_TEMPLATE_PARM node to store | |
3903 | template arguments */ | |
3904 | ||
1899c3a4 | 3905 | tree parm; |
73b0fce8 KL |
3906 | tree arglist2; |
3907 | ||
73b0fce8 KL |
3908 | parmlist = DECL_INNERMOST_TEMPLATE_PARMS (template); |
3909 | ||
f9c244b8 NS |
3910 | arglist2 = coerce_template_parms (parmlist, arglist, template, |
3911 | complain, /*require_all_args=*/1); | |
73b0fce8 KL |
3912 | if (arglist2 == error_mark_node) |
3913 | return error_mark_node; | |
3914 | ||
dac65501 | 3915 | parm = bind_template_template_parm (TREE_TYPE (template), arglist2); |
73b0fce8 KL |
3916 | return parm; |
3917 | } | |
36a117a5 | 3918 | else |
8d08fdba | 3919 | { |
36a117a5 | 3920 | tree template_type = TREE_TYPE (template); |
7ac7b28f | 3921 | tree gen_tmpl; |
36a117a5 MM |
3922 | tree type_decl; |
3923 | tree found = NULL_TREE; | |
414ea4aa | 3924 | tree *tp; |
36a117a5 MM |
3925 | int arg_depth; |
3926 | int parm_depth; | |
dbfe2124 | 3927 | int is_partial_instantiation; |
830bfa74 | 3928 | |
7ac7b28f MM |
3929 | gen_tmpl = most_general_template (template); |
3930 | parmlist = DECL_TEMPLATE_PARMS (gen_tmpl); | |
36a117a5 MM |
3931 | parm_depth = TMPL_PARMS_DEPTH (parmlist); |
3932 | arg_depth = TMPL_ARGS_DEPTH (arglist); | |
3933 | ||
3934 | if (arg_depth == 1 && parm_depth > 1) | |
3935 | { | |
39c01e4c | 3936 | /* We've been given an incomplete set of template arguments. |
36a117a5 MM |
3937 | For example, given: |
3938 | ||
3939 | template <class T> struct S1 { | |
3940 | template <class U> struct S2 {}; | |
3941 | template <class U> struct S2<U*> {}; | |
3942 | }; | |
3943 | ||
3944 | we will be called with an ARGLIST of `U*', but the | |
3945 | TEMPLATE will be `template <class T> template | |
3946 | <class U> struct S1<T>::S2'. We must fill in the missing | |
3947 | arguments. */ | |
7ac7b28f MM |
3948 | arglist |
3949 | = add_outermost_template_args (TYPE_TI_ARGS (TREE_TYPE (template)), | |
3950 | arglist); | |
36a117a5 MM |
3951 | arg_depth = TMPL_ARGS_DEPTH (arglist); |
3952 | } | |
5566b478 | 3953 | |
7ac7b28f | 3954 | /* Now we should enough arguments. */ |
36a117a5 MM |
3955 | my_friendly_assert (parm_depth == arg_depth, 0); |
3956 | ||
7ac7b28f MM |
3957 | /* From here on, we're only interested in the most general |
3958 | template. */ | |
3959 | template = gen_tmpl; | |
3960 | ||
36a117a5 MM |
3961 | /* Calculate the BOUND_ARGS. These will be the args that are |
3962 | actually tsubst'd into the definition to create the | |
3963 | instantiation. */ | |
3964 | if (parm_depth > 1) | |
830bfa74 MM |
3965 | { |
3966 | /* We have multiple levels of arguments to coerce, at once. */ | |
830bfa74 | 3967 | int i; |
e4a84209 | 3968 | int saved_depth = TMPL_ARGS_DEPTH (arglist); |
36a117a5 | 3969 | |
f31c0a32 | 3970 | tree bound_args = make_tree_vec (parm_depth); |
830bfa74 | 3971 | |
e4a84209 | 3972 | for (i = saved_depth, |
830bfa74 | 3973 | t = DECL_TEMPLATE_PARMS (template); |
e4a84209 | 3974 | i > 0 && t != NULL_TREE; |
830bfa74 | 3975 | --i, t = TREE_CHAIN (t)) |
e4a84209 MM |
3976 | { |
3977 | tree a = coerce_template_parms (TREE_VALUE (t), | |
f9c244b8 NS |
3978 | arglist, template, |
3979 | complain, /*require_all_args=*/1); | |
e4a84209 MM |
3980 | SET_TMPL_ARGS_LEVEL (bound_args, i, a); |
3981 | ||
3982 | /* We temporarily reduce the length of the ARGLIST so | |
3983 | that coerce_template_parms will see only the arguments | |
3984 | corresponding to the template parameters it is | |
3985 | examining. */ | |
3986 | TREE_VEC_LENGTH (arglist)--; | |
3987 | } | |
3988 | ||
3989 | /* Restore the ARGLIST to its full size. */ | |
3990 | TREE_VEC_LENGTH (arglist) = saved_depth; | |
3991 | ||
36a117a5 | 3992 | arglist = bound_args; |
830bfa74 MM |
3993 | } |
3994 | else | |
36a117a5 MM |
3995 | arglist |
3996 | = coerce_template_parms (INNERMOST_TEMPLATE_PARMS (parmlist), | |
f9a7ae04 | 3997 | INNERMOST_TEMPLATE_ARGS (arglist), |
f9c244b8 NS |
3998 | template, |
3999 | complain, /*require_all_args=*/1); | |
36a117a5 MM |
4000 | |
4001 | if (arglist == error_mark_node) | |
4002 | /* We were unable to bind the arguments. */ | |
5566b478 | 4003 | return error_mark_node; |
5566b478 | 4004 | |
36a117a5 MM |
4005 | /* In the scope of a template class, explicit references to the |
4006 | template class refer to the type of the template, not any | |
4007 | instantiation of it. For example, in: | |
4008 | ||
4009 | template <class T> class C { void f(C<T>); } | |
4010 | ||
4011 | the `C<T>' is just the same as `C'. Outside of the | |
4012 | class, however, such a reference is an instantiation. */ | |
ed44da02 | 4013 | if (comp_template_args (TYPE_TI_ARGS (template_type), |
36a117a5 MM |
4014 | arglist)) |
4015 | { | |
4016 | found = template_type; | |
4017 | ||
4018 | if (!entering_scope && PRIMARY_TEMPLATE_P (template)) | |
5566b478 | 4019 | { |
36a117a5 MM |
4020 | tree ctx; |
4021 | ||
4022 | /* Note that we use DECL_CONTEXT, rather than | |
4023 | CP_DECL_CONTEXT, so that the termination test is | |
dc957d14 | 4024 | always just `ctx'. We're not interested in namespace |
36a117a5 MM |
4025 | scopes. */ |
4026 | for (ctx = current_class_type; | |
4027 | ctx; | |
2f939d94 | 4028 | ctx = (TYPE_P (ctx)) ? TYPE_CONTEXT (ctx) : DECL_CONTEXT (ctx)) |
3bfdc719 | 4029 | if (same_type_p (ctx, template_type)) |
36a117a5 MM |
4030 | break; |
4031 | ||
4032 | if (!ctx) | |
4033 | /* We're not in the scope of the class, so the | |
4034 | TEMPLATE_TYPE is not the type we want after | |
4035 | all. */ | |
4036 | found = NULL_TREE; | |
5566b478 MS |
4037 | } |
4038 | } | |
36a117a5 | 4039 | if (found) |
ab097535 | 4040 | return found; |
414ea4aa MM |
4041 | |
4042 | for (tp = &DECL_TEMPLATE_INSTANTIATIONS (template); | |
4043 | *tp; | |
4044 | tp = &TREE_CHAIN (*tp)) | |
4045 | if (comp_template_args (TREE_PURPOSE (*tp), arglist)) | |
4046 | { | |
4047 | found = *tp; | |
7e7d9517 MM |
4048 | |
4049 | /* Use the move-to-front heuristic to speed up future | |
4050 | searches. */ | |
414ea4aa MM |
4051 | *tp = TREE_CHAIN (*tp); |
4052 | TREE_CHAIN (found) | |
4053 | = DECL_TEMPLATE_INSTANTIATIONS (template); | |
4054 | DECL_TEMPLATE_INSTANTIATIONS (template) = found; | |
7e7d9517 | 4055 | |
414ea4aa MM |
4056 | return TREE_VALUE (found); |
4057 | } | |
5566b478 | 4058 | |
dbfe2124 | 4059 | /* This type is a "partial instantiation" if any of the template |
ab097535 | 4060 | arguments still involve template parameters. Note that we set |
486e4077 MM |
4061 | IS_PARTIAL_INSTANTIATION for partial specializations as |
4062 | well. */ | |
dbfe2124 MM |
4063 | is_partial_instantiation = uses_template_parms (arglist); |
4064 | ||
3ebc5c52 MM |
4065 | if (!is_partial_instantiation |
4066 | && !PRIMARY_TEMPLATE_P (template) | |
4067 | && TREE_CODE (CP_DECL_CONTEXT (template)) == NAMESPACE_DECL) | |
4068 | { | |
3ebc5c52 MM |
4069 | found = xref_tag_from_type (TREE_TYPE (template), |
4070 | DECL_NAME (template), | |
4071 | /*globalize=*/1); | |
4072 | return found; | |
4073 | } | |
3ebc5c52 | 4074 | |
95ee998c MM |
4075 | context = tsubst (DECL_CONTEXT (template), arglist, |
4076 | /*complain=*/0, in_decl); | |
4077 | if (!context) | |
4078 | context = global_namespace; | |
4079 | ||
36a117a5 | 4080 | /* Create the type. */ |
ed44da02 MM |
4081 | if (TREE_CODE (template_type) == ENUMERAL_TYPE) |
4082 | { | |
dbfe2124 | 4083 | if (!is_partial_instantiation) |
92777ce4 NS |
4084 | { |
4085 | set_current_access_from_decl (TYPE_NAME (template_type)); | |
4086 | t = start_enum (TYPE_IDENTIFIER (template_type)); | |
4087 | } | |
ed44da02 | 4088 | else |
dbfe2124 | 4089 | /* We don't want to call start_enum for this type, since |
ed44da02 MM |
4090 | the values for the enumeration constants may involve |
4091 | template parameters. And, no one should be interested | |
4092 | in the enumeration constants for such a type. */ | |
4093 | t = make_node (ENUMERAL_TYPE); | |
4094 | } | |
4095 | else | |
4096 | { | |
33848bb0 | 4097 | t = make_aggr_type (TREE_CODE (template_type)); |
ed44da02 MM |
4098 | CLASSTYPE_DECLARED_CLASS (t) |
4099 | = CLASSTYPE_DECLARED_CLASS (template_type); | |
4100 | CLASSTYPE_GOT_SEMICOLON (t) = 1; | |
4101 | SET_CLASSTYPE_IMPLICIT_INSTANTIATION (t); | |
f668f160 | 4102 | TYPE_FOR_JAVA (t) = TYPE_FOR_JAVA (template_type); |
ae673f14 JM |
4103 | |
4104 | /* A local class. Make sure the decl gets registered properly. */ | |
4105 | if (context == current_function_decl) | |
4106 | pushtag (DECL_NAME (template), t, 0); | |
ed44da02 MM |
4107 | } |
4108 | ||
ae673f14 JM |
4109 | /* If we called start_enum or pushtag above, this information |
4110 | will already be set up. */ | |
ed44da02 MM |
4111 | if (!TYPE_NAME (t)) |
4112 | { | |
4113 | TYPE_CONTEXT (t) = FROB_CONTEXT (context); | |
36a117a5 | 4114 | |
9188c363 | 4115 | type_decl = create_implicit_typedef (DECL_NAME (template), t); |
ed44da02 | 4116 | DECL_CONTEXT (type_decl) = TYPE_CONTEXT (t); |
9188c363 | 4117 | TYPE_STUB_DECL (t) = type_decl; |
ed44da02 MM |
4118 | DECL_SOURCE_FILE (type_decl) |
4119 | = DECL_SOURCE_FILE (TYPE_STUB_DECL (template_type)); | |
4120 | DECL_SOURCE_LINE (type_decl) | |
4121 | = DECL_SOURCE_LINE (TYPE_STUB_DECL (template_type)); | |
ed44da02 MM |
4122 | } |
4123 | else | |
4124 | type_decl = TYPE_NAME (t); | |
36a117a5 | 4125 | |
9fbf56f7 MM |
4126 | /* Set up the template information. We have to figure out which |
4127 | template is the immediate parent if this is a full | |
4128 | instantiation. */ | |
4129 | if (parm_depth == 1 || is_partial_instantiation | |
4130 | || !PRIMARY_TEMPLATE_P (template)) | |
4131 | /* This case is easy; there are no member templates involved. */ | |
4132 | found = template; | |
4133 | else | |
4134 | { | |
ab097535 NS |
4135 | /* This is a full instantiation of a member template. Look |
4136 | for a partial instantiation of which this is an instance. */ | |
9fbf56f7 MM |
4137 | |
4138 | for (found = DECL_TEMPLATE_INSTANTIATIONS (template); | |
4139 | found; found = TREE_CHAIN (found)) | |
4140 | { | |
4141 | int success; | |
4142 | tree tmpl = CLASSTYPE_TI_TEMPLATE (TREE_VALUE (found)); | |
4143 | ||
4144 | /* We only want partial instantiations, here, not | |
4145 | specializations or full instantiations. */ | |
370af2d5 | 4146 | if (CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_VALUE (found)) |
9fbf56f7 MM |
4147 | || !uses_template_parms (TREE_VALUE (found))) |
4148 | continue; | |
4149 | ||
4150 | /* Temporarily reduce by one the number of levels in the | |
4151 | ARGLIST and in FOUND so as to avoid comparing the | |
4152 | last set of arguments. */ | |
4153 | TREE_VEC_LENGTH (arglist)--; | |
4154 | TREE_VEC_LENGTH (TREE_PURPOSE (found)) --; | |
4155 | ||
4156 | /* See if the arguments match. If they do, then TMPL is | |
4157 | the partial instantiation we want. */ | |
4158 | success = comp_template_args (TREE_PURPOSE (found), arglist); | |
4159 | ||
4160 | /* Restore the argument vectors to their full size. */ | |
4161 | TREE_VEC_LENGTH (arglist)++; | |
4162 | TREE_VEC_LENGTH (TREE_PURPOSE (found))++; | |
4163 | ||
4164 | if (success) | |
4165 | { | |
4166 | found = tmpl; | |
4167 | break; | |
4168 | } | |
4169 | } | |
4170 | ||
4171 | if (!found) | |
ab097535 NS |
4172 | { |
4173 | /* There was no partial instantiation. This happens | |
4174 | where C<T> is a member template of A<T> and it's used | |
4175 | in something like | |
4176 | ||
4177 | template <typename T> struct B { A<T>::C<int> m; }; | |
4178 | B<float>; | |
4179 | ||
4180 | Create the partial instantiation. | |
4181 | */ | |
4182 | TREE_VEC_LENGTH (arglist)--; | |
4183 | template = tsubst (template, arglist, /*complain=*/0, NULL_TREE); | |
4184 | TREE_VEC_LENGTH (arglist)++; | |
4185 | found = template; | |
4186 | } | |
9fbf56f7 MM |
4187 | } |
4188 | ||
ab097535 | 4189 | SET_TYPE_TEMPLATE_INFO (t, tree_cons (found, arglist, NULL_TREE)); |
dbfe2124 MM |
4190 | DECL_TEMPLATE_INSTANTIATIONS (template) |
4191 | = tree_cons (arglist, t, | |
4192 | DECL_TEMPLATE_INSTANTIATIONS (template)); | |
4193 | ||
4194 | if (TREE_CODE (t) == ENUMERAL_TYPE | |
4195 | && !is_partial_instantiation) | |
61a127b3 MM |
4196 | /* Now that the type has been registered on the instantiations |
4197 | list, we set up the enumerators. Because the enumeration | |
4198 | constants may involve the enumeration type itself, we make | |
4199 | sure to register the type first, and then create the | |
4200 | constants. That way, doing tsubst_expr for the enumeration | |
4201 | constants won't result in recursive calls here; we'll find | |
4202 | the instantiation and exit above. */ | |
4203 | tsubst_enum (template_type, t, arglist); | |
dbfe2124 | 4204 | |
36a117a5 MM |
4205 | /* Reset the name of the type, now that CLASSTYPE_TEMPLATE_INFO |
4206 | is set up. */ | |
ed44da02 MM |
4207 | if (TREE_CODE (t) != ENUMERAL_TYPE) |
4208 | DECL_NAME (type_decl) = classtype_mangled_name (t); | |
dbfe2124 | 4209 | if (!is_partial_instantiation) |
36a117a5 | 4210 | { |
50a6dbd7 JM |
4211 | /* For backwards compatibility; code that uses |
4212 | -fexternal-templates expects looking up a template to | |
4213 | instantiate it. I think DDD still relies on this. | |
4214 | (jason 8/20/1998) */ | |
ed44da02 MM |
4215 | if (TREE_CODE (t) != ENUMERAL_TYPE |
4216 | && flag_external_templates | |
36a117a5 MM |
4217 | && CLASSTYPE_INTERFACE_KNOWN (TREE_TYPE (template)) |
4218 | && ! CLASSTYPE_INTERFACE_ONLY (TREE_TYPE (template))) | |
4219 | add_pending_template (t); | |
4220 | } | |
4221 | else | |
077e7015 MM |
4222 | /* If the type makes use of template parameters, the |
4223 | code that generates debugging information will crash. */ | |
4224 | DECL_IGNORED_P (TYPE_STUB_DECL (t)) = 1; | |
8d08fdba | 4225 | |
36a117a5 MM |
4226 | return t; |
4227 | } | |
8d08fdba MS |
4228 | } |
4229 | \f | |
8dfaeb63 | 4230 | struct pair_fn_data |
8d08fdba | 4231 | { |
8dfaeb63 MM |
4232 | tree_fn_t fn; |
4233 | void *data; | |
4234 | }; | |
4235 | ||
4236 | /* Called from for_each_template_parm via walk_tree. */ | |
581d38d0 | 4237 | |
8dfaeb63 MM |
4238 | static tree |
4239 | for_each_template_parm_r (tp, walk_subtrees, d) | |
4240 | tree *tp; | |
4241 | int *walk_subtrees; | |
4242 | void *d; | |
4243 | { | |
4244 | tree t = *tp; | |
4245 | struct pair_fn_data *pfd = (struct pair_fn_data *) d; | |
4246 | tree_fn_t fn = pfd->fn; | |
4247 | void *data = pfd->data; | |
4248 | ||
2f939d94 | 4249 | if (TYPE_P (t) |
581d38d0 | 4250 | && for_each_template_parm (TYPE_CONTEXT (t), fn, data)) |
8dfaeb63 | 4251 | return error_mark_node; |
581d38d0 | 4252 | |
8d08fdba MS |
4253 | switch (TREE_CODE (t)) |
4254 | { | |
8d08fdba | 4255 | case RECORD_TYPE: |
9076e292 | 4256 | if (TYPE_PTRMEMFUNC_P (t)) |
8dfaeb63 | 4257 | break; |
ed44da02 MM |
4258 | /* Fall through. */ |
4259 | ||
8d08fdba | 4260 | case UNION_TYPE: |
ed44da02 | 4261 | case ENUMERAL_TYPE: |
8dfaeb63 MM |
4262 | if (!TYPE_TEMPLATE_INFO (t)) |
4263 | *walk_subtrees = 0; | |
4264 | else if (for_each_template_parm (TREE_VALUE (TYPE_TEMPLATE_INFO (t)), | |
4265 | fn, data)) | |
4266 | return error_mark_node; | |
4267 | break; | |
4268 | ||
588c2d1c | 4269 | case METHOD_TYPE: |
8dfaeb63 MM |
4270 | /* Since we're not going to walk subtrees, we have to do this |
4271 | explicitly here. */ | |
588c2d1c | 4272 | if (for_each_template_parm (TYPE_METHOD_BASETYPE (t), fn, data)) |
8dfaeb63 | 4273 | return error_mark_node; |
4890c2f4 | 4274 | /* Fall through. */ |
588c2d1c MM |
4275 | |
4276 | case FUNCTION_TYPE: | |
8dfaeb63 MM |
4277 | /* Check the return type. */ |
4278 | if (for_each_template_parm (TREE_TYPE (t), fn, data)) | |
4279 | return error_mark_node; | |
4280 | ||
588c2d1c MM |
4281 | /* Check the parameter types. Since default arguments are not |
4282 | instantiated until they are needed, the TYPE_ARG_TYPES may | |
4283 | contain expressions that involve template parameters. But, | |
4284 | no-one should be looking at them yet. And, once they're | |
4285 | instantiated, they don't contain template parameters, so | |
4286 | there's no point in looking at them then, either. */ | |
4287 | { | |
4288 | tree parm; | |
4289 | ||
4290 | for (parm = TYPE_ARG_TYPES (t); parm; parm = TREE_CHAIN (parm)) | |
4291 | if (for_each_template_parm (TREE_VALUE (parm), fn, data)) | |
8dfaeb63 | 4292 | return error_mark_node; |
5566b478 | 4293 | |
8dfaeb63 MM |
4294 | /* Since we've already handled the TYPE_ARG_TYPES, we don't |
4295 | want walk_tree walking into them itself. */ | |
4296 | *walk_subtrees = 0; | |
4297 | } | |
4298 | break; | |
3ac3d9ea | 4299 | |
8d08fdba | 4300 | case FUNCTION_DECL: |
5566b478 | 4301 | case VAR_DECL: |
5566b478 | 4302 | if (DECL_LANG_SPECIFIC (t) && DECL_TEMPLATE_INFO (t) |
050367a3 | 4303 | && for_each_template_parm (DECL_TI_ARGS (t), fn, data)) |
8dfaeb63 MM |
4304 | return error_mark_node; |
4305 | /* Fall through. */ | |
4306 | ||
4307 | case CONST_DECL: | |
8d08fdba | 4308 | case PARM_DECL: |
050367a3 MM |
4309 | if (DECL_CONTEXT (t) |
4310 | && for_each_template_parm (DECL_CONTEXT (t), fn, data)) | |
8dfaeb63 MM |
4311 | return error_mark_node; |
4312 | break; | |
8d08fdba | 4313 | |
a1281f45 | 4314 | case BOUND_TEMPLATE_TEMPLATE_PARM: |
744fac59 | 4315 | /* Record template parameters such as `T' inside `TT<T>'. */ |
a1281f45 | 4316 | if (for_each_template_parm (TYPE_TI_ARGS (t), fn, data)) |
8dfaeb63 MM |
4317 | return error_mark_node; |
4318 | /* Fall through. */ | |
4319 | ||
a1281f45 | 4320 | case TEMPLATE_TEMPLATE_PARM: |
744fac59 | 4321 | case TEMPLATE_TYPE_PARM: |
f84b4be9 | 4322 | case TEMPLATE_PARM_INDEX: |
8dfaeb63 MM |
4323 | if (fn && (*fn)(t, data)) |
4324 | return error_mark_node; | |
4325 | else if (!fn) | |
4326 | return error_mark_node; | |
4327 | break; | |
5156628f | 4328 | |
8dfaeb63 MM |
4329 | case TEMPLATE_DECL: |
4330 | /* A template template parameter is encountered */ | |
4331 | if (DECL_TEMPLATE_TEMPLATE_PARM_P (t) | |
4332 | && for_each_template_parm (TREE_TYPE (t), fn, data)) | |
4333 | return error_mark_node; | |
db5ae43f | 4334 | |
8dfaeb63 MM |
4335 | /* Already substituted template template parameter */ |
4336 | *walk_subtrees = 0; | |
4337 | break; | |
b8865407 | 4338 | |
4699c561 | 4339 | case TYPENAME_TYPE: |
8dfaeb63 MM |
4340 | if (!fn || for_each_template_parm (TYPENAME_TYPE_FULLNAME (t), fn, data)) |
4341 | return error_mark_node; | |
4342 | break; | |
4699c561 | 4343 | |
8dfaeb63 MM |
4344 | case CONSTRUCTOR: |
4345 | if (TREE_TYPE (t) && TYPE_PTRMEMFUNC_P (TREE_TYPE (t)) | |
4346 | && for_each_template_parm (TYPE_PTRMEMFUNC_FN_TYPE | |
4347 | (TREE_TYPE (t)), fn, data)) | |
4348 | return error_mark_node; | |
4349 | break; | |
4350 | ||
b8865407 MM |
4351 | case INDIRECT_REF: |
4352 | case COMPONENT_REF: | |
4699c561 | 4353 | /* If there's no type, then this thing must be some expression |
b8865407 | 4354 | involving template parameters. */ |
4699c561 | 4355 | if (!fn && !TREE_TYPE (t)) |
8dfaeb63 MM |
4356 | return error_mark_node; |
4357 | break; | |
b8865407 | 4358 | |
42976354 BK |
4359 | case MODOP_EXPR: |
4360 | case CAST_EXPR: | |
4361 | case REINTERPRET_CAST_EXPR: | |
4362 | case CONST_CAST_EXPR: | |
4363 | case STATIC_CAST_EXPR: | |
4364 | case DYNAMIC_CAST_EXPR: | |
42976354 BK |
4365 | case ARROW_EXPR: |
4366 | case DOTSTAR_EXPR: | |
4367 | case TYPEID_EXPR: | |
b8865407 | 4368 | case LOOKUP_EXPR: |
40242ccf | 4369 | case PSEUDO_DTOR_EXPR: |
b8865407 | 4370 | if (!fn) |
8dfaeb63 MM |
4371 | return error_mark_node; |
4372 | break; | |
abff8e06 | 4373 | |
8d08fdba | 4374 | default: |
8dfaeb63 | 4375 | break; |
8d08fdba | 4376 | } |
8dfaeb63 MM |
4377 | |
4378 | /* We didn't find any template parameters we liked. */ | |
4379 | return NULL_TREE; | |
4380 | } | |
4381 | ||
a1281f45 KL |
4382 | /* For each TEMPLATE_TYPE_PARM, TEMPLATE_TEMPLATE_PARM, |
4383 | BOUND_TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX in T, | |
4384 | call FN with the parameter and the DATA. | |
8dfaeb63 MM |
4385 | If FN returns non-zero, the iteration is terminated, and |
4386 | for_each_template_parm returns 1. Otherwise, the iteration | |
4387 | continues. If FN never returns a non-zero value, the value | |
4388 | returned by for_each_template_parm is 0. If FN is NULL, it is | |
4389 | considered to be the function which always returns 1. */ | |
4390 | ||
4391 | static int | |
4392 | for_each_template_parm (t, fn, data) | |
4393 | tree t; | |
4394 | tree_fn_t fn; | |
4395 | void* data; | |
4396 | { | |
4397 | struct pair_fn_data pfd; | |
4398 | ||
4399 | /* Set up. */ | |
4400 | pfd.fn = fn; | |
4401 | pfd.data = data; | |
4402 | ||
4890c2f4 MM |
4403 | /* Walk the tree. (Conceptually, we would like to walk without |
4404 | duplicates, but for_each_template_parm_r recursively calls | |
4405 | for_each_template_parm, so we would need to reorganize a fair | |
4406 | bit to use walk_tree_without_duplicates.) */ | |
4407 | return walk_tree (&t, | |
4408 | for_each_template_parm_r, | |
4409 | &pfd, | |
4410 | NULL) != NULL_TREE; | |
8d08fdba MS |
4411 | } |
4412 | ||
050367a3 MM |
4413 | int |
4414 | uses_template_parms (t) | |
4415 | tree t; | |
4416 | { | |
4417 | return for_each_template_parm (t, 0, 0); | |
4418 | } | |
4419 | ||
27fafc8d | 4420 | static int tinst_depth; |
e9f32eb5 | 4421 | extern int max_tinst_depth; |
5566b478 | 4422 | #ifdef GATHER_STATISTICS |
27fafc8d | 4423 | int depth_reached; |
5566b478 | 4424 | #endif |
8dfaeb63 MM |
4425 | static int tinst_level_tick; |
4426 | static int last_template_error_tick; | |
8d08fdba | 4427 | |
3ae18eaf JM |
4428 | /* We're starting to instantiate D; record the template instantiation context |
4429 | for diagnostics and to restore it later. */ | |
4430 | ||
bd6dd845 | 4431 | static int |
5566b478 MS |
4432 | push_tinst_level (d) |
4433 | tree d; | |
8d08fdba | 4434 | { |
3ae18eaf | 4435 | tree new; |
8d08fdba | 4436 | |
7215f9a0 MS |
4437 | if (tinst_depth >= max_tinst_depth) |
4438 | { | |
8adf5b5e JM |
4439 | /* If the instantiation in question still has unbound template parms, |
4440 | we don't really care if we can't instantiate it, so just return. | |
4441 | This happens with base instantiation for implicit `typename'. */ | |
4442 | if (uses_template_parms (d)) | |
4443 | return 0; | |
4444 | ||
1139b3d8 | 4445 | last_template_error_tick = tinst_level_tick; |
b4f4233d GDR |
4446 | cp_error ("template instantiation depth exceeds maximum of %d (use -ftemplate-depth-NN to increase the maximum) instantiating `%D'", |
4447 | max_tinst_depth, d); | |
5566b478 | 4448 | |
cb753e49 | 4449 | print_instantiation_context (); |
5566b478 | 4450 | |
7215f9a0 MS |
4451 | return 0; |
4452 | } | |
4453 | ||
3ae18eaf JM |
4454 | new = build_expr_wfl (d, input_filename, lineno, 0); |
4455 | TREE_CHAIN (new) = current_tinst_level; | |
8d08fdba | 4456 | current_tinst_level = new; |
5566b478 | 4457 | |
7215f9a0 | 4458 | ++tinst_depth; |
5566b478 MS |
4459 | #ifdef GATHER_STATISTICS |
4460 | if (tinst_depth > depth_reached) | |
4461 | depth_reached = tinst_depth; | |
4462 | #endif | |
4463 | ||
27fafc8d | 4464 | ++tinst_level_tick; |
7215f9a0 | 4465 | return 1; |
8d08fdba MS |
4466 | } |
4467 | ||
3ae18eaf JM |
4468 | /* We're done instantiating this template; return to the instantiation |
4469 | context. */ | |
4470 | ||
8d08fdba MS |
4471 | void |
4472 | pop_tinst_level () | |
4473 | { | |
3ae18eaf | 4474 | tree old = current_tinst_level; |
8d08fdba | 4475 | |
ae58fa02 MM |
4476 | /* Restore the filename and line number stashed away when we started |
4477 | this instantiation. */ | |
3ae18eaf JM |
4478 | lineno = TINST_LINE (old); |
4479 | input_filename = TINST_FILE (old); | |
5f2c99c4 | 4480 | extract_interface_info (); |
ae58fa02 | 4481 | |
3ae18eaf | 4482 | current_tinst_level = TREE_CHAIN (old); |
7215f9a0 | 4483 | --tinst_depth; |
27fafc8d | 4484 | ++tinst_level_tick; |
8d08fdba MS |
4485 | } |
4486 | ||
3ae18eaf JM |
4487 | /* We're instantiating a deferred template; restore the template |
4488 | instantiation context in which the instantiation was requested, which | |
4489 | is one step out from LEVEL. */ | |
4490 | ||
4491 | static void | |
4492 | reopen_tinst_level (level) | |
4493 | tree level; | |
4494 | { | |
4495 | tree t; | |
4496 | ||
4497 | tinst_depth = 0; | |
4498 | for (t = level; t; t = TREE_CHAIN (t)) | |
4499 | ++tinst_depth; | |
4500 | ||
4501 | current_tinst_level = level; | |
4502 | pop_tinst_level (); | |
4503 | } | |
4504 | ||
4505 | /* Return the outermost template instantiation context, for use with | |
4506 | -falt-external-templates. */ | |
4507 | ||
4508 | tree | |
8d08fdba MS |
4509 | tinst_for_decl () |
4510 | { | |
3ae18eaf | 4511 | tree p = current_tinst_level; |
8d08fdba MS |
4512 | |
4513 | if (p) | |
3ae18eaf | 4514 | for (; TREE_CHAIN (p) ; p = TREE_CHAIN (p)) |
8d08fdba MS |
4515 | ; |
4516 | return p; | |
4517 | } | |
4518 | ||
f84b4be9 JM |
4519 | /* DECL is a friend FUNCTION_DECL or TEMPLATE_DECL. ARGS is the |
4520 | vector of template arguments, as for tsubst. | |
4521 | ||
dc957d14 | 4522 | Returns an appropriate tsubst'd friend declaration. */ |
f84b4be9 JM |
4523 | |
4524 | static tree | |
4525 | tsubst_friend_function (decl, args) | |
4526 | tree decl; | |
4527 | tree args; | |
4528 | { | |
4529 | tree new_friend; | |
27fafc8d | 4530 | int line = lineno; |
3b304f5b | 4531 | const char *file = input_filename; |
27fafc8d JM |
4532 | |
4533 | lineno = DECL_SOURCE_LINE (decl); | |
4534 | input_filename = DECL_SOURCE_FILE (decl); | |
4535 | ||
f84b4be9 JM |
4536 | if (TREE_CODE (decl) == FUNCTION_DECL |
4537 | && DECL_TEMPLATE_INSTANTIATION (decl) | |
4538 | && TREE_CODE (DECL_TI_TEMPLATE (decl)) != TEMPLATE_DECL) | |
4539 | /* This was a friend declared with an explicit template | |
4540 | argument list, e.g.: | |
4541 | ||
4542 | friend void f<>(T); | |
4543 | ||
4544 | to indicate that f was a template instantiation, not a new | |
4545 | function declaration. Now, we have to figure out what | |
4546 | instantiation of what template. */ | |
4547 | { | |
76e57b45 | 4548 | tree template_id, arglist, fns; |
f84b4be9 JM |
4549 | tree new_args; |
4550 | tree tmpl; | |
76e57b45 NS |
4551 | tree ns = CP_DECL_CONTEXT (TYPE_MAIN_DECL (current_class_type)); |
4552 | ||
4553 | /* Friend functions are looked up in the containing namespace scope. | |
4554 | We must enter that scope, to avoid finding member functions of the | |
4555 | current cless with same name. */ | |
4556 | push_nested_namespace (ns); | |
4557 | fns = tsubst_expr (DECL_TI_TEMPLATE (decl), args, | |
4558 | /*complain=*/1, NULL_TREE); | |
4559 | pop_nested_namespace (ns); | |
4560 | arglist = tsubst (DECL_TI_ARGS (decl), args, | |
4561 | /*complain=*/1, NULL_TREE); | |
4562 | template_id = lookup_template_function (fns, arglist); | |
4563 | ||
4393e105 | 4564 | new_friend = tsubst (decl, args, /*complain=*/1, NULL_TREE); |
36a117a5 MM |
4565 | tmpl = determine_specialization (template_id, new_friend, |
4566 | &new_args, | |
bf8f3f93 | 4567 | /*need_member_template=*/0); |
27fafc8d JM |
4568 | new_friend = instantiate_template (tmpl, new_args); |
4569 | goto done; | |
f84b4be9 | 4570 | } |
36a117a5 | 4571 | |
4393e105 | 4572 | new_friend = tsubst (decl, args, /*complain=*/1, NULL_TREE); |
f84b4be9 | 4573 | |
36a117a5 | 4574 | /* The NEW_FRIEND will look like an instantiation, to the |
f84b4be9 JM |
4575 | compiler, but is not an instantiation from the point of view of |
4576 | the language. For example, we might have had: | |
4577 | ||
4578 | template <class T> struct S { | |
4579 | template <class U> friend void f(T, U); | |
4580 | }; | |
4581 | ||
4582 | Then, in S<int>, template <class U> void f(int, U) is not an | |
4583 | instantiation of anything. */ | |
4584 | DECL_USE_TEMPLATE (new_friend) = 0; | |
4585 | if (TREE_CODE (decl) == TEMPLATE_DECL) | |
655dc6ee JM |
4586 | { |
4587 | DECL_USE_TEMPLATE (DECL_TEMPLATE_RESULT (new_friend)) = 0; | |
4588 | DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (new_friend)) | |
4589 | = DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (decl)); | |
4590 | } | |
36a117a5 | 4591 | |
92643fea MM |
4592 | /* The mangled name for the NEW_FRIEND is incorrect. The function |
4593 | is not a template instantiation and should not be mangled like | |
4594 | one. Therefore, we forget the mangling here; we'll recompute it | |
4595 | later if we need it. */ | |
36a117a5 MM |
4596 | if (TREE_CODE (new_friend) != TEMPLATE_DECL) |
4597 | { | |
19e7881c | 4598 | SET_DECL_RTL (new_friend, NULL_RTX); |
92643fea | 4599 | SET_DECL_ASSEMBLER_NAME (new_friend, NULL_TREE); |
36a117a5 MM |
4600 | } |
4601 | ||
6eb3bb27 | 4602 | if (DECL_NAMESPACE_SCOPE_P (new_friend)) |
f84b4be9 | 4603 | { |
36a117a5 | 4604 | tree old_decl; |
fbf1c34b MM |
4605 | tree new_friend_template_info; |
4606 | tree new_friend_result_template_info; | |
92da7074 | 4607 | tree ns; |
fbf1c34b MM |
4608 | int new_friend_is_defn; |
4609 | ||
4610 | /* We must save some information from NEW_FRIEND before calling | |
4611 | duplicate decls since that function will free NEW_FRIEND if | |
4612 | possible. */ | |
4613 | new_friend_template_info = DECL_TEMPLATE_INFO (new_friend); | |
f84b4be9 | 4614 | if (TREE_CODE (new_friend) == TEMPLATE_DECL) |
fbf1c34b MM |
4615 | { |
4616 | /* This declaration is a `primary' template. */ | |
4617 | DECL_PRIMARY_TEMPLATE (new_friend) = new_friend; | |
4618 | ||
4619 | new_friend_is_defn | |
17aec3eb | 4620 | = DECL_INITIAL (DECL_TEMPLATE_RESULT (new_friend)) != NULL_TREE; |
fbf1c34b | 4621 | new_friend_result_template_info |
17aec3eb | 4622 | = DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (new_friend)); |
fbf1c34b MM |
4623 | } |
4624 | else | |
4625 | { | |
4626 | new_friend_is_defn = DECL_INITIAL (new_friend) != NULL_TREE; | |
4627 | new_friend_result_template_info = NULL_TREE; | |
4628 | } | |
36a117a5 | 4629 | |
1c227897 MM |
4630 | /* Inside pushdecl_namespace_level, we will push into the |
4631 | current namespace. However, the friend function should go | |
4632 | into the namespace of the template. */ | |
92da7074 ML |
4633 | ns = decl_namespace_context (new_friend); |
4634 | push_nested_namespace (ns); | |
36a117a5 | 4635 | old_decl = pushdecl_namespace_level (new_friend); |
92da7074 | 4636 | pop_nested_namespace (ns); |
36a117a5 MM |
4637 | |
4638 | if (old_decl != new_friend) | |
4639 | { | |
4640 | /* This new friend declaration matched an existing | |
4641 | declaration. For example, given: | |
4642 | ||
4643 | template <class T> void f(T); | |
4644 | template <class U> class C { | |
4645 | template <class T> friend void f(T) {} | |
4646 | }; | |
4647 | ||
4648 | the friend declaration actually provides the definition | |
4649 | of `f', once C has been instantiated for some type. So, | |
4650 | old_decl will be the out-of-class template declaration, | |
4651 | while new_friend is the in-class definition. | |
4652 | ||
4653 | But, if `f' was called before this point, the | |
4654 | instantiation of `f' will have DECL_TI_ARGS corresponding | |
4655 | to `T' but not to `U', references to which might appear | |
4656 | in the definition of `f'. Previously, the most general | |
4657 | template for an instantiation of `f' was the out-of-class | |
4658 | version; now it is the in-class version. Therefore, we | |
4659 | run through all specialization of `f', adding to their | |
4660 | DECL_TI_ARGS appropriately. In particular, they need a | |
4661 | new set of outer arguments, corresponding to the | |
4662 | arguments for this class instantiation. | |
4663 | ||
4664 | The same situation can arise with something like this: | |
4665 | ||
4666 | friend void f(int); | |
4667 | template <class T> class C { | |
4668 | friend void f(T) {} | |
4669 | }; | |
4670 | ||
4671 | when `C<int>' is instantiated. Now, `f(int)' is defined | |
4672 | in the class. */ | |
4673 | ||
fbf1c34b MM |
4674 | if (!new_friend_is_defn) |
4675 | /* On the other hand, if the in-class declaration does | |
4676 | *not* provide a definition, then we don't want to alter | |
4677 | existing definitions. We can just leave everything | |
4678 | alone. */ | |
36a117a5 | 4679 | ; |
fbf1c34b | 4680 | else |
36a117a5 | 4681 | { |
fbf1c34b MM |
4682 | /* Overwrite whatever template info was there before, if |
4683 | any, with the new template information pertaining to | |
4684 | the declaration. */ | |
4685 | DECL_TEMPLATE_INFO (old_decl) = new_friend_template_info; | |
4686 | ||
4687 | if (TREE_CODE (old_decl) != TEMPLATE_DECL) | |
4688 | /* duplicate_decls will take care of this case. */ | |
4689 | ; | |
4690 | else | |
36a117a5 | 4691 | { |
fbf1c34b MM |
4692 | tree t; |
4693 | tree new_friend_args; | |
4694 | ||
17aec3eb | 4695 | DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (old_decl)) |
fbf1c34b MM |
4696 | = new_friend_result_template_info; |
4697 | ||
4698 | new_friend_args = TI_ARGS (new_friend_template_info); | |
4699 | for (t = DECL_TEMPLATE_SPECIALIZATIONS (old_decl); | |
4700 | t != NULL_TREE; | |
4701 | t = TREE_CHAIN (t)) | |
4702 | { | |
4703 | tree spec = TREE_VALUE (t); | |
36a117a5 | 4704 | |
fbf1c34b MM |
4705 | DECL_TI_ARGS (spec) |
4706 | = add_outermost_template_args (new_friend_args, | |
4707 | DECL_TI_ARGS (spec)); | |
fbf1c34b MM |
4708 | } |
4709 | ||
4710 | /* Now, since specializations are always supposed to | |
4711 | hang off of the most general template, we must move | |
4712 | them. */ | |
4713 | t = most_general_template (old_decl); | |
4714 | if (t != old_decl) | |
4715 | { | |
4716 | DECL_TEMPLATE_SPECIALIZATIONS (t) | |
4717 | = chainon (DECL_TEMPLATE_SPECIALIZATIONS (t), | |
4718 | DECL_TEMPLATE_SPECIALIZATIONS (old_decl)); | |
4719 | DECL_TEMPLATE_SPECIALIZATIONS (old_decl) = NULL_TREE; | |
4720 | } | |
36a117a5 MM |
4721 | } |
4722 | } | |
4723 | ||
4724 | /* The information from NEW_FRIEND has been merged into OLD_DECL | |
4725 | by duplicate_decls. */ | |
4726 | new_friend = old_decl; | |
4727 | } | |
f84b4be9 | 4728 | } |
d0f062fb | 4729 | else if (COMPLETE_TYPE_P (DECL_CONTEXT (new_friend))) |
f84b4be9 JM |
4730 | { |
4731 | /* Check to see that the declaration is really present, and, | |
4732 | possibly obtain an improved declaration. */ | |
4733 | tree fn = check_classfn (DECL_CONTEXT (new_friend), | |
4734 | new_friend); | |
4735 | ||
4736 | if (fn) | |
4737 | new_friend = fn; | |
4738 | } | |
4739 | ||
27fafc8d JM |
4740 | done: |
4741 | lineno = line; | |
4742 | input_filename = file; | |
f84b4be9 JM |
4743 | return new_friend; |
4744 | } | |
4745 | ||
1aed5355 MM |
4746 | /* FRIEND_TMPL is a friend TEMPLATE_DECL. ARGS is the vector of |
4747 | template arguments, as for tsubst. | |
6757edfe | 4748 | |
dc957d14 | 4749 | Returns an appropriate tsubst'd friend type or error_mark_node on |
4b054b80 | 4750 | failure. */ |
6757edfe MM |
4751 | |
4752 | static tree | |
1aed5355 MM |
4753 | tsubst_friend_class (friend_tmpl, args) |
4754 | tree friend_tmpl; | |
6757edfe MM |
4755 | tree args; |
4756 | { | |
1aed5355 | 4757 | tree friend_type; |
25aab5d0 | 4758 | tree tmpl; |
6757edfe | 4759 | |
25aab5d0 MM |
4760 | /* First, we look for a class template. */ |
4761 | tmpl = lookup_name (DECL_NAME (friend_tmpl), /*prefer_type=*/0); | |
4762 | ||
4763 | /* But, if we don't find one, it might be because we're in a | |
4764 | situation like this: | |
4765 | ||
4766 | template <class T> | |
4767 | struct S { | |
4768 | template <class U> | |
4769 | friend struct S; | |
4770 | }; | |
4771 | ||
4772 | Here, in the scope of (say) S<int>, `S' is bound to a TYPE_DECL | |
4773 | for `S<int>', not the TEMPLATE_DECL. */ | |
bc639f90 | 4774 | if (!tmpl || !DECL_CLASS_TEMPLATE_P (tmpl)) |
25aab5d0 MM |
4775 | { |
4776 | tmpl = lookup_name (DECL_NAME (friend_tmpl), /*prefer_type=*/1); | |
4777 | tmpl = maybe_get_template_decl_from_type_decl (tmpl); | |
4778 | } | |
6757edfe | 4779 | |
25aab5d0 | 4780 | if (tmpl && DECL_CLASS_TEMPLATE_P (tmpl)) |
6757edfe MM |
4781 | { |
4782 | /* The friend template has already been declared. Just | |
36a117a5 MM |
4783 | check to see that the declarations match, and install any new |
4784 | default parameters. We must tsubst the default parameters, | |
4785 | of course. We only need the innermost template parameters | |
4786 | because that is all that redeclare_class_template will look | |
4787 | at. */ | |
4788 | tree parms | |
4789 | = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_tmpl), | |
4393e105 | 4790 | args, /*complain=*/1); |
4b054b80 NS |
4791 | if (!parms) |
4792 | return error_mark_node; | |
36a117a5 | 4793 | redeclare_class_template (TREE_TYPE (tmpl), parms); |
6757edfe MM |
4794 | friend_type = TREE_TYPE (tmpl); |
4795 | } | |
4796 | else | |
4797 | { | |
4798 | /* The friend template has not already been declared. In this | |
4799 | case, the instantiation of the template class will cause the | |
4800 | injection of this template into the global scope. */ | |
4393e105 | 4801 | tmpl = tsubst (friend_tmpl, args, /*complain=*/1, NULL_TREE); |
6757edfe MM |
4802 | |
4803 | /* The new TMPL is not an instantiation of anything, so we | |
4804 | forget its origins. We don't reset CLASSTYPE_TI_TEMPLATE for | |
4805 | the new type because that is supposed to be the corresponding | |
4806 | template decl, i.e., TMPL. */ | |
4807 | DECL_USE_TEMPLATE (tmpl) = 0; | |
4808 | DECL_TEMPLATE_INFO (tmpl) = NULL_TREE; | |
4809 | CLASSTYPE_USE_TEMPLATE (TREE_TYPE (tmpl)) = 0; | |
4810 | ||
4811 | /* Inject this template into the global scope. */ | |
4812 | friend_type = TREE_TYPE (pushdecl_top_level (tmpl)); | |
4813 | } | |
4814 | ||
4815 | return friend_type; | |
4816 | } | |
f84b4be9 | 4817 | |
8d08fdba | 4818 | tree |
5566b478 MS |
4819 | instantiate_class_template (type) |
4820 | tree type; | |
8d08fdba | 4821 | { |
61a127b3 | 4822 | tree template, args, pattern, t; |
36a117a5 | 4823 | tree typedecl; |
8d08fdba | 4824 | |
5566b478 | 4825 | if (type == error_mark_node) |
8d08fdba MS |
4826 | return error_mark_node; |
4827 | ||
d0f062fb | 4828 | if (TYPE_BEING_DEFINED (type) || COMPLETE_TYPE_P (type)) |
5566b478 MS |
4829 | return type; |
4830 | ||
6bdb985f | 4831 | /* Figure out which template is being instantiated. */ |
36a117a5 | 4832 | template = most_general_template (CLASSTYPE_TI_TEMPLATE (type)); |
5566b478 | 4833 | my_friendly_assert (TREE_CODE (template) == TEMPLATE_DECL, 279); |
73aad9b9 | 4834 | |
6bdb985f MM |
4835 | /* Figure out which arguments are being used to do the |
4836 | instantiation. */ | |
4837 | args = CLASSTYPE_TI_ARGS (type); | |
4c571114 | 4838 | PARTIAL_INSTANTIATION_P (type) = uses_template_parms (args); |
6bdb985f | 4839 | |
4c571114 MM |
4840 | if (pedantic && PARTIAL_INSTANTIATION_P (type)) |
4841 | /* If this is a partial instantiation, then we can't instantiate | |
4842 | the type; there's no telling whether or not one of the | |
4843 | template parameters might eventually be instantiated to some | |
4844 | value that results in a specialization being used. For | |
4845 | example, consider: | |
4846 | ||
4847 | template <class T> | |
4848 | struct S {}; | |
4849 | ||
4850 | template <class U> | |
4851 | void f(S<U>); | |
4852 | ||
4853 | template <> | |
4854 | struct S<int> {}; | |
4855 | ||
4856 | Now, the `S<U>' in `f<int>' is the specialization, not an | |
5db698f6 | 4857 | instantiation of the original template. */ |
f31c0a32 | 4858 | return type; |
4c571114 MM |
4859 | |
4860 | /* Determine what specialization of the original template to | |
4861 | instantiate. */ | |
4862 | if (PARTIAL_INSTANTIATION_P (type)) | |
6bdb985f MM |
4863 | /* There's no telling which specialization is appropriate at this |
4864 | point. Since all peeking at the innards of this partial | |
4865 | instantiation are extensions (like the "implicit typename" | |
4866 | extension, which allows users to omit the keyword `typename' on | |
4867 | names that are declared as types in template base classes), we | |
4868 | are free to do what we please. | |
4869 | ||
4870 | Trying to figure out which partial instantiation to use can | |
4871 | cause a crash. (Some of the template arguments don't even have | |
4872 | types.) So, we just use the most general version. */ | |
4873 | t = NULL_TREE; | |
4874 | else | |
73aad9b9 | 4875 | { |
6bdb985f MM |
4876 | t = most_specialized_class (template, args); |
4877 | ||
4878 | if (t == error_mark_node) | |
73aad9b9 | 4879 | { |
d8e178a0 | 4880 | const char *str = "candidates are:"; |
6bdb985f MM |
4881 | cp_error ("ambiguous class template instantiation for `%#T'", type); |
4882 | for (t = DECL_TEMPLATE_SPECIALIZATIONS (template); t; | |
4883 | t = TREE_CHAIN (t)) | |
73aad9b9 | 4884 | { |
6bdb985f MM |
4885 | if (get_class_bindings (TREE_VALUE (t), TREE_PURPOSE (t), |
4886 | args)) | |
4887 | { | |
4888 | cp_error_at ("%s %+#T", str, TREE_TYPE (t)); | |
4889 | str = " "; | |
4890 | } | |
73aad9b9 | 4891 | } |
6bdb985f | 4892 | TYPE_BEING_DEFINED (type) = 1; |
f31c0a32 | 4893 | return error_mark_node; |
73aad9b9 | 4894 | } |
73aad9b9 | 4895 | } |
6bdb985f MM |
4896 | |
4897 | if (t) | |
73aad9b9 JM |
4898 | pattern = TREE_TYPE (t); |
4899 | else | |
4900 | pattern = TREE_TYPE (template); | |
5566b478 | 4901 | |
4c571114 MM |
4902 | /* If the template we're instantiating is incomplete, then clearly |
4903 | there's nothing we can do. */ | |
d0f062fb | 4904 | if (!COMPLETE_TYPE_P (pattern)) |
f31c0a32 | 4905 | return type; |
5566b478 | 4906 | |
4c571114 MM |
4907 | /* If this is a partial instantiation, don't tsubst anything. We will |
4908 | only use this type for implicit typename, so the actual contents don't | |
4909 | matter. All that matters is whether a particular name is a type. */ | |
4910 | if (PARTIAL_INSTANTIATION_P (type)) | |
4911 | { | |
4912 | /* The fields set here must be kept in sync with those cleared | |
4913 | in begin_class_definition. */ | |
4914 | TYPE_BINFO_BASETYPES (type) = TYPE_BINFO_BASETYPES (pattern); | |
4915 | TYPE_FIELDS (type) = TYPE_FIELDS (pattern); | |
4916 | TYPE_METHODS (type) = TYPE_METHODS (pattern); | |
4917 | CLASSTYPE_TAGS (type) = CLASSTYPE_TAGS (pattern); | |
1ddd4323 NS |
4918 | CLASSTYPE_VBASECLASSES (type) = CLASSTYPE_VBASECLASSES (pattern); |
4919 | ||
4c571114 MM |
4920 | /* Pretend that the type is complete, so that we will look |
4921 | inside it during name lookup and such. */ | |
867580ce | 4922 | TYPE_SIZE (type) = bitsize_zero_node; |
f31c0a32 | 4923 | return type; |
4c571114 MM |
4924 | } |
4925 | ||
4926 | /* If we've recursively instantiated too many templates, stop. */ | |
4927 | if (! push_tinst_level (type)) | |
f31c0a32 | 4928 | return type; |
4c571114 MM |
4929 | |
4930 | /* Now we're really doing the instantiation. Mark the type as in | |
4931 | the process of being defined. */ | |
4932 | TYPE_BEING_DEFINED (type) = 1; | |
4933 | ||
4934 | maybe_push_to_top_level (uses_template_parms (type)); | |
4c571114 | 4935 | |
73aad9b9 | 4936 | if (t) |
36a117a5 MM |
4937 | { |
4938 | /* This TYPE is actually a instantiation of of a partial | |
4939 | specialization. We replace the innermost set of ARGS with | |
4940 | the arguments appropriate for substitution. For example, | |
4941 | given: | |
4942 | ||
4943 | template <class T> struct S {}; | |
4944 | template <class T> struct S<T*> {}; | |
4945 | ||
4946 | and supposing that we are instantiating S<int*>, ARGS will | |
4947 | present be {int*} but we need {int}. */ | |
4948 | tree inner_args | |
4949 | = get_class_bindings (TREE_VALUE (t), TREE_PURPOSE (t), | |
4950 | args); | |
4951 | ||
4952 | /* If there were multiple levels in ARGS, replacing the | |
4953 | innermost level would alter CLASSTYPE_TI_ARGS, which we don't | |
4954 | want, so we make a copy first. */ | |
4955 | if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args)) | |
4956 | { | |
4957 | args = copy_node (args); | |
4958 | SET_TMPL_ARGS_LEVEL (args, TMPL_ARGS_DEPTH (args), inner_args); | |
4959 | } | |
4960 | else | |
4961 | args = inner_args; | |
4962 | } | |
8d019cef | 4963 | |
5566b478 MS |
4964 | if (flag_external_templates) |
4965 | { | |
4966 | if (flag_alt_external_templates) | |
4967 | { | |
4968 | CLASSTYPE_INTERFACE_ONLY (type) = interface_only; | |
4969 | SET_CLASSTYPE_INTERFACE_UNKNOWN_X (type, interface_unknown); | |
5566b478 MS |
4970 | } |
4971 | else | |
4972 | { | |
4973 | CLASSTYPE_INTERFACE_ONLY (type) = CLASSTYPE_INTERFACE_ONLY (pattern); | |
4974 | SET_CLASSTYPE_INTERFACE_UNKNOWN_X | |
4975 | (type, CLASSTYPE_INTERFACE_UNKNOWN (pattern)); | |
5566b478 MS |
4976 | } |
4977 | } | |
4978 | else | |
8d08fdba | 4979 | { |
5566b478 | 4980 | SET_CLASSTYPE_INTERFACE_UNKNOWN (type); |
8d08fdba MS |
4981 | } |
4982 | ||
f7da6097 MS |
4983 | TYPE_HAS_CONSTRUCTOR (type) = TYPE_HAS_CONSTRUCTOR (pattern); |
4984 | TYPE_HAS_DESTRUCTOR (type) = TYPE_HAS_DESTRUCTOR (pattern); | |
f7da6097 MS |
4985 | TYPE_OVERLOADS_CALL_EXPR (type) = TYPE_OVERLOADS_CALL_EXPR (pattern); |
4986 | TYPE_OVERLOADS_ARRAY_REF (type) = TYPE_OVERLOADS_ARRAY_REF (pattern); | |
4987 | TYPE_OVERLOADS_ARROW (type) = TYPE_OVERLOADS_ARROW (pattern); | |
834c6dff MM |
4988 | TYPE_HAS_NEW_OPERATOR (type) = TYPE_HAS_NEW_OPERATOR (pattern); |
4989 | TYPE_HAS_ARRAY_NEW_OPERATOR (type) = TYPE_HAS_ARRAY_NEW_OPERATOR (pattern); | |
f7da6097 | 4990 | TYPE_GETS_DELETE (type) = TYPE_GETS_DELETE (pattern); |
f7da6097 MS |
4991 | TYPE_HAS_ASSIGN_REF (type) = TYPE_HAS_ASSIGN_REF (pattern); |
4992 | TYPE_HAS_CONST_ASSIGN_REF (type) = TYPE_HAS_CONST_ASSIGN_REF (pattern); | |
4993 | TYPE_HAS_ABSTRACT_ASSIGN_REF (type) = TYPE_HAS_ABSTRACT_ASSIGN_REF (pattern); | |
4994 | TYPE_HAS_INIT_REF (type) = TYPE_HAS_INIT_REF (pattern); | |
4995 | TYPE_HAS_CONST_INIT_REF (type) = TYPE_HAS_CONST_INIT_REF (pattern); | |
f7da6097 MS |
4996 | TYPE_HAS_DEFAULT_CONSTRUCTOR (type) = TYPE_HAS_DEFAULT_CONSTRUCTOR (pattern); |
4997 | TYPE_HAS_CONVERSION (type) = TYPE_HAS_CONVERSION (pattern); | |
4c6b7393 MM |
4998 | TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (type) |
4999 | = TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (pattern); | |
f7da6097 MS |
5000 | TYPE_USES_MULTIPLE_INHERITANCE (type) |
5001 | = TYPE_USES_MULTIPLE_INHERITANCE (pattern); | |
5002 | TYPE_USES_VIRTUAL_BASECLASSES (type) | |
5003 | = TYPE_USES_VIRTUAL_BASECLASSES (pattern); | |
5004 | TYPE_PACKED (type) = TYPE_PACKED (pattern); | |
5005 | TYPE_ALIGN (type) = TYPE_ALIGN (pattern); | |
11cf4d18 | 5006 | TYPE_USER_ALIGN (type) = TYPE_USER_ALIGN (pattern); |
eff71ab0 | 5007 | TYPE_FOR_JAVA (type) = TYPE_FOR_JAVA (pattern); /* For libjava's JArray<T> */ |
6bdb8141 JM |
5008 | if (ANON_AGGR_TYPE_P (pattern)) |
5009 | SET_ANON_AGGR_TYPE_P (type); | |
f7da6097 | 5010 | |
3fd71a52 MM |
5011 | if (TYPE_BINFO_BASETYPES (pattern)) |
5012 | { | |
5013 | tree base_list = NULL_TREE; | |
5014 | tree pbases = TYPE_BINFO_BASETYPES (pattern); | |
5015 | int i; | |
5566b478 | 5016 | |
3fd71a52 MM |
5017 | /* Substitute into each of the bases to determine the actual |
5018 | basetypes. */ | |
5019 | for (i = 0; i < TREE_VEC_LENGTH (pbases); ++i) | |
5020 | { | |
5021 | tree base; | |
5022 | tree access; | |
5023 | tree pbase; | |
5566b478 | 5024 | |
3fd71a52 | 5025 | pbase = TREE_VEC_ELT (pbases, i); |
711734a9 | 5026 | |
dc957d14 | 5027 | /* Substitute to figure out the base class. */ |
3fd71a52 MM |
5028 | base = tsubst (BINFO_TYPE (pbase), args, |
5029 | /*complain=*/1, NULL_TREE); | |
5030 | if (base == error_mark_node) | |
5031 | continue; | |
711734a9 | 5032 | |
3fd71a52 MM |
5033 | /* Calculate the correct access node. */ |
5034 | if (TREE_VIA_VIRTUAL (pbase)) | |
5035 | { | |
5036 | if (TREE_VIA_PUBLIC (pbase)) | |
5037 | access = access_public_virtual_node; | |
5038 | else if (TREE_VIA_PROTECTED (pbase)) | |
5039 | access = access_protected_virtual_node; | |
d6479fe7 | 5040 | else |
3fd71a52 MM |
5041 | access = access_private_virtual_node; |
5042 | } | |
5043 | else | |
5044 | { | |
5045 | if (TREE_VIA_PUBLIC (pbase)) | |
5046 | access = access_public_node; | |
5047 | else if (TREE_VIA_PROTECTED (pbase)) | |
5048 | access = access_protected_node; | |
d6479fe7 | 5049 | else |
3fd71a52 MM |
5050 | access = access_private_node; |
5051 | } | |
dfbcd65a | 5052 | |
3fd71a52 MM |
5053 | base_list = tree_cons (access, base, base_list); |
5054 | } | |
dfbcd65a | 5055 | |
3fd71a52 MM |
5056 | /* The list is now in reverse order; correct that. */ |
5057 | base_list = nreverse (base_list); | |
5058 | ||
5059 | /* Now call xref_basetypes to set up all the base-class | |
5060 | information. */ | |
5061 | xref_basetypes (TREE_CODE (pattern) == RECORD_TYPE | |
5062 | ? (CLASSTYPE_DECLARED_CLASS (pattern) | |
5063 | ? class_type_node : record_type_node) | |
5064 | : union_type_node, | |
5065 | DECL_NAME (TYPE_NAME (pattern)), | |
5066 | type, | |
5067 | base_list); | |
5068 | } | |
5566b478 | 5069 | |
b74a0560 MM |
5070 | /* Now that our base classes are set up, enter the scope of the |
5071 | class, so that name lookups into base classes, etc. will work | |
dc957d14 | 5072 | correctly. This is precisely analogous to what we do in |
b74a0560 MM |
5073 | begin_class_definition when defining an ordinary non-template |
5074 | class. */ | |
5075 | pushclass (type, 1); | |
5076 | ||
5566b478 | 5077 | for (t = CLASSTYPE_TAGS (pattern); t; t = TREE_CHAIN (t)) |
8d08fdba | 5078 | { |
5566b478 | 5079 | tree tag = TREE_VALUE (t); |
36a117a5 MM |
5080 | tree name = TYPE_IDENTIFIER (tag); |
5081 | tree newtag; | |
5566b478 | 5082 | |
4393e105 | 5083 | newtag = tsubst (tag, args, /*complain=*/1, NULL_TREE); |
a87b4257 | 5084 | my_friendly_assert (newtag != error_mark_node, 20010206); |
61a127b3 | 5085 | if (TREE_CODE (newtag) != ENUMERAL_TYPE) |
ed44da02 | 5086 | { |
486e4077 MM |
5087 | if (TYPE_LANG_SPECIFIC (tag) && CLASSTYPE_IS_TEMPLATE (tag)) |
5088 | /* Unfortunately, lookup_template_class sets | |
5089 | CLASSTYPE_IMPLICIT_INSTANTIATION for a partial | |
5090 | instantiation (i.e., for the type of a member template | |
5091 | class nested within a template class.) This behavior is | |
5092 | required for maybe_process_partial_specialization to work | |
5093 | correctly, but is not accurate in this case; the TAG is not | |
5094 | an instantiation of anything. (The corresponding | |
5095 | TEMPLATE_DECL is an instantiation, but the TYPE is not.) */ | |
5096 | CLASSTYPE_USE_TEMPLATE (newtag) = 0; | |
5097 | ||
ed44da02 MM |
5098 | /* Now, we call pushtag to put this NEWTAG into the scope of |
5099 | TYPE. We first set up the IDENTIFIER_TYPE_VALUE to avoid | |
5100 | pushtag calling push_template_decl. We don't have to do | |
5101 | this for enums because it will already have been done in | |
5102 | tsubst_enum. */ | |
5103 | if (name) | |
5104 | SET_IDENTIFIER_TYPE_VALUE (name, newtag); | |
5105 | pushtag (name, newtag, /*globalize=*/0); | |
5106 | } | |
8d08fdba MS |
5107 | } |
5108 | ||
5566b478 MS |
5109 | /* Don't replace enum constants here. */ |
5110 | for (t = TYPE_FIELDS (pattern); t; t = TREE_CHAIN (t)) | |
8dd3f57a | 5111 | if (TREE_CODE (t) != CONST_DECL) |
5566b478 | 5112 | { |
ae58fa02 MM |
5113 | tree r; |
5114 | ||
5115 | /* The the file and line for this declaration, to assist in | |
5116 | error message reporting. Since we called push_tinst_level | |
5117 | above, we don't need to restore these. */ | |
5118 | lineno = DECL_SOURCE_LINE (t); | |
5119 | input_filename = DECL_SOURCE_FILE (t); | |
5120 | ||
4393e105 | 5121 | r = tsubst (t, args, /*complain=*/1, NULL_TREE); |
5566b478 MS |
5122 | if (TREE_CODE (r) == VAR_DECL) |
5123 | { | |
fa8d6e85 MM |
5124 | tree init; |
5125 | ||
3febd123 | 5126 | if (DECL_INITIALIZED_IN_CLASS_P (r)) |
fa8d6e85 MM |
5127 | init = tsubst_expr (DECL_INITIAL (t), args, |
5128 | /*complain=*/1, NULL_TREE); | |
5129 | else | |
5130 | init = NULL_TREE; | |
5131 | ||
5132 | finish_static_data_member_decl (r, init, | |
5133 | /*asmspec_tree=*/NULL_TREE, | |
fa8d6e85 MM |
5134 | /*flags=*/0); |
5135 | ||
3febd123 | 5136 | if (DECL_INITIALIZED_IN_CLASS_P (r)) |
6ba89f8e | 5137 | check_static_variable_definition (r, TREE_TYPE (r)); |
5566b478 | 5138 | } |
61a127b3 MM |
5139 | |
5140 | /* R will have a TREE_CHAIN if and only if it has already been | |
5141 | processed by finish_member_declaration. This can happen | |
5142 | if, for example, it is a TYPE_DECL for a class-scoped | |
5143 | ENUMERAL_TYPE; such a thing will already have been added to | |
5144 | the field list by tsubst_enum above. */ | |
5145 | if (!TREE_CHAIN (r)) | |
5146 | { | |
5147 | set_current_access_from_decl (r); | |
5148 | finish_member_declaration (r); | |
5149 | } | |
5566b478 | 5150 | } |
8d08fdba | 5151 | |
61a127b3 MM |
5152 | /* Set up the list (TYPE_METHODS) and vector (CLASSTYPE_METHOD_VEC) |
5153 | for this instantiation. */ | |
5154 | for (t = TYPE_METHODS (pattern); t; t = TREE_CHAIN (t)) | |
5155 | { | |
4393e105 | 5156 | tree r = tsubst (t, args, /*complain=*/1, NULL_TREE); |
61a127b3 MM |
5157 | set_current_access_from_decl (r); |
5158 | finish_member_declaration (r); | |
5159 | } | |
8d08fdba | 5160 | |
2604412d JM |
5161 | /* Construct the DECL_FRIENDLIST for the new class type. */ |
5162 | typedecl = TYPE_MAIN_DECL (type); | |
5163 | for (t = DECL_FRIENDLIST (TYPE_MAIN_DECL (pattern)); | |
5164 | t != NULL_TREE; | |
5165 | t = TREE_CHAIN (t)) | |
f84b4be9 | 5166 | { |
2604412d | 5167 | tree friends; |
f84b4be9 | 5168 | |
2604412d JM |
5169 | for (friends = TREE_VALUE (t); |
5170 | friends != NULL_TREE; | |
5171 | friends = TREE_CHAIN (friends)) | |
0c0aac2f MM |
5172 | if (TREE_PURPOSE (friends) == error_mark_node) |
5173 | add_friend (type, | |
5174 | tsubst_friend_function (TREE_VALUE (friends), | |
5175 | args)); | |
5176 | else | |
4f1c5b7d | 5177 | my_friendly_abort (20000216); |
2604412d | 5178 | } |
5566b478 | 5179 | |
6757edfe MM |
5180 | for (t = CLASSTYPE_FRIEND_CLASSES (pattern); |
5181 | t != NULL_TREE; | |
5182 | t = TREE_CHAIN (t)) | |
5183 | { | |
5184 | tree friend_type = TREE_VALUE (t); | |
1aed5355 | 5185 | tree new_friend_type; |
6757edfe | 5186 | |
36a117a5 MM |
5187 | if (TREE_CODE (friend_type) == TEMPLATE_DECL) |
5188 | new_friend_type = tsubst_friend_class (friend_type, args); | |
5189 | else if (uses_template_parms (friend_type)) | |
4393e105 MM |
5190 | new_friend_type = tsubst (friend_type, args, /*complain=*/1, |
5191 | NULL_TREE); | |
36a117a5 | 5192 | else |
61fc8c9e MM |
5193 | { |
5194 | tree ns = decl_namespace_context (TYPE_MAIN_DECL (friend_type)); | |
36a117a5 | 5195 | |
61fc8c9e MM |
5196 | /* The call to xref_tag_from_type does injection for friend |
5197 | classes. */ | |
5198 | push_nested_namespace (ns); | |
5199 | new_friend_type = | |
5200 | xref_tag_from_type (friend_type, NULL_TREE, 1); | |
5201 | pop_nested_namespace (ns); | |
5202 | } | |
1aed5355 MM |
5203 | |
5204 | if (TREE_CODE (friend_type) == TEMPLATE_DECL) | |
5205 | /* Trick make_friend_class into realizing that the friend | |
5206 | we're adding is a template, not an ordinary class. It's | |
5207 | important that we use make_friend_class since it will | |
5208 | perform some error-checking and output cross-reference | |
5209 | information. */ | |
5210 | ++processing_template_decl; | |
5211 | ||
4b054b80 NS |
5212 | if (new_friend_type != error_mark_node) |
5213 | make_friend_class (type, new_friend_type); | |
fc378698 | 5214 | |
1aed5355 MM |
5215 | if (TREE_CODE (friend_type) == TEMPLATE_DECL) |
5216 | --processing_template_decl; | |
6757edfe | 5217 | } |
fc378698 | 5218 | |
2604412d JM |
5219 | for (t = TYPE_FIELDS (type); t; t = TREE_CHAIN (t)) |
5220 | if (TREE_CODE (t) == FIELD_DECL) | |
5221 | { | |
5222 | TREE_TYPE (t) = complete_type (TREE_TYPE (t)); | |
5223 | require_complete_type (t); | |
5224 | } | |
5566b478 | 5225 | |
61a127b3 MM |
5226 | /* Set the file and line number information to whatever is given for |
5227 | the class itself. This puts error messages involving generated | |
5228 | implicit functions at a predictable point, and the same point | |
5229 | that would be used for non-template classes. */ | |
5230 | lineno = DECL_SOURCE_LINE (typedecl); | |
5231 | input_filename = DECL_SOURCE_FILE (typedecl); | |
5232 | ||
5233 | unreverse_member_declarations (type); | |
9f33663b | 5234 | finish_struct_1 (type); |
2604412d | 5235 | CLASSTYPE_GOT_SEMICOLON (type) = 1; |
e92cc029 | 5236 | |
5524676d JM |
5237 | /* Clear this now so repo_template_used is happy. */ |
5238 | TYPE_BEING_DEFINED (type) = 0; | |
2604412d | 5239 | repo_template_used (type); |
8d08fdba | 5240 | |
9188c363 MM |
5241 | /* Now that the class is complete, instantiate default arguments for |
5242 | any member functions. We don't do this earlier because the | |
5243 | default arguments may reference members of the class. */ | |
5244 | if (!PRIMARY_TEMPLATE_P (template)) | |
5245 | for (t = TYPE_METHODS (type); t; t = TREE_CHAIN (t)) | |
5246 | if (TREE_CODE (t) == FUNCTION_DECL | |
dc957d14 | 5247 | /* Implicitly generated member functions will not have template |
9188c363 MM |
5248 | information; they are not instantiations, but instead are |
5249 | created "fresh" for each instantiation. */ | |
5250 | && DECL_TEMPLATE_INFO (t)) | |
5251 | tsubst_default_arguments (t); | |
5252 | ||
b74a0560 | 5253 | popclass (); |
5566b478 MS |
5254 | pop_from_top_level (); |
5255 | pop_tinst_level (); | |
5256 | ||
5257 | return type; | |
8d08fdba MS |
5258 | } |
5259 | ||
5260 | static int | |
5261 | list_eq (t1, t2) | |
5262 | tree t1, t2; | |
5263 | { | |
5264 | if (t1 == NULL_TREE) | |
5265 | return t2 == NULL_TREE; | |
5266 | if (t2 == NULL_TREE) | |
5267 | return 0; | |
5268 | /* Don't care if one declares its arg const and the other doesn't -- the | |
5269 | main variant of the arg type is all that matters. */ | |
5270 | if (TYPE_MAIN_VARIANT (TREE_VALUE (t1)) | |
5271 | != TYPE_MAIN_VARIANT (TREE_VALUE (t2))) | |
5272 | return 0; | |
5273 | return list_eq (TREE_CHAIN (t1), TREE_CHAIN (t2)); | |
5274 | } | |
5275 | ||
00d3396f JM |
5276 | /* If arg is a non-type template parameter that does not depend on template |
5277 | arguments, fold it like we weren't in the body of a template. */ | |
5278 | ||
5279 | static tree | |
5280 | maybe_fold_nontype_arg (arg) | |
5281 | tree arg; | |
5282 | { | |
4d5f3fbd | 5283 | if (arg && !TYPE_P (arg) && !uses_template_parms (arg)) |
00d3396f JM |
5284 | { |
5285 | /* Sometimes, one of the args was an expression involving a | |
5286 | template constant parameter, like N - 1. Now that we've | |
5287 | tsubst'd, we might have something like 2 - 1. This will | |
5288 | confuse lookup_template_class, so we do constant folding | |
5289 | here. We have to unset processing_template_decl, to | |
5290 | fool build_expr_from_tree() into building an actual | |
5291 | tree. */ | |
5292 | ||
4d5f3fbd KL |
5293 | /* If the TREE_TYPE of ARG is not NULL_TREE, ARG is already |
5294 | as simple as it's going to get, and trying to reprocess | |
5295 | the trees will break. */ | |
5296 | if (!TREE_TYPE (arg)) | |
5297 | { | |
5298 | int saved_processing_template_decl = processing_template_decl; | |
5299 | processing_template_decl = 0; | |
5300 | arg = build_expr_from_tree (arg); | |
5301 | processing_template_decl = saved_processing_template_decl; | |
5302 | } | |
5303 | ||
5304 | arg = fold (arg); | |
00d3396f JM |
5305 | } |
5306 | return arg; | |
5307 | } | |
5308 | ||
830bfa74 MM |
5309 | /* Substitute ARGS into the vector of template arguments T. */ |
5310 | ||
e9659ab0 | 5311 | static tree |
4393e105 | 5312 | tsubst_template_arg_vector (t, args, complain) |
830bfa74 MM |
5313 | tree t; |
5314 | tree args; | |
4393e105 | 5315 | int complain; |
830bfa74 MM |
5316 | { |
5317 | int len = TREE_VEC_LENGTH (t), need_new = 0, i; | |
5318 | tree *elts = (tree *) alloca (len * sizeof (tree)); | |
5319 | ||
961192e1 | 5320 | memset ((char *) elts, 0, len * sizeof (tree)); |
830bfa74 MM |
5321 | |
5322 | for (i = 0; i < len; i++) | |
5323 | { | |
5324 | if (TREE_VEC_ELT (t, i) != NULL_TREE | |
5325 | && TREE_CODE (TREE_VEC_ELT (t, i)) == TREE_VEC) | |
4393e105 MM |
5326 | elts[i] = tsubst_template_arg_vector (TREE_VEC_ELT (t, i), |
5327 | args, complain); | |
830bfa74 MM |
5328 | else |
5329 | elts[i] = maybe_fold_nontype_arg | |
4393e105 MM |
5330 | (tsubst_expr (TREE_VEC_ELT (t, i), args, complain, |
5331 | NULL_TREE)); | |
830bfa74 | 5332 | |
08e72a19 JM |
5333 | if (elts[i] == error_mark_node) |
5334 | return error_mark_node; | |
5335 | ||
830bfa74 MM |
5336 | if (elts[i] != TREE_VEC_ELT (t, i)) |
5337 | need_new = 1; | |
5338 | } | |
5339 | ||
5340 | if (!need_new) | |
5341 | return t; | |
5342 | ||
f31c0a32 | 5343 | t = make_tree_vec (len); |
830bfa74 MM |
5344 | for (i = 0; i < len; i++) |
5345 | TREE_VEC_ELT (t, i) = elts[i]; | |
5346 | ||
5347 | return t; | |
5348 | } | |
5349 | ||
36a117a5 MM |
5350 | /* Return the result of substituting ARGS into the template parameters |
5351 | given by PARMS. If there are m levels of ARGS and m + n levels of | |
5352 | PARMS, then the result will contain n levels of PARMS. For | |
5353 | example, if PARMS is `template <class T> template <class U> | |
5354 | template <T*, U, class V>' and ARGS is {{int}, {double}} then the | |
5355 | result will be `template <int*, double, class V>'. */ | |
5356 | ||
e9659ab0 | 5357 | static tree |
4393e105 | 5358 | tsubst_template_parms (parms, args, complain) |
36a117a5 MM |
5359 | tree parms; |
5360 | tree args; | |
4393e105 | 5361 | int complain; |
36a117a5 | 5362 | { |
f71f87f9 MM |
5363 | tree r = NULL_TREE; |
5364 | tree* new_parms; | |
36a117a5 MM |
5365 | |
5366 | for (new_parms = &r; | |
5367 | TMPL_PARMS_DEPTH (parms) > TMPL_ARGS_DEPTH (args); | |
5368 | new_parms = &(TREE_CHAIN (*new_parms)), | |
5369 | parms = TREE_CHAIN (parms)) | |
5370 | { | |
5371 | tree new_vec = | |
5372 | make_tree_vec (TREE_VEC_LENGTH (TREE_VALUE (parms))); | |
5373 | int i; | |
5374 | ||
5375 | for (i = 0; i < TREE_VEC_LENGTH (new_vec); ++i) | |
5376 | { | |
5377 | tree default_value = | |
5378 | TREE_PURPOSE (TREE_VEC_ELT (TREE_VALUE (parms), i)); | |
5379 | tree parm_decl = | |
5380 | TREE_VALUE (TREE_VEC_ELT (TREE_VALUE (parms), i)); | |
5381 | ||
5382 | TREE_VEC_ELT (new_vec, i) | |
db3ef87b KL |
5383 | = build_tree_list (maybe_fold_nontype_arg ( |
5384 | tsubst_expr (default_value, args, complain, | |
5385 | NULL_TREE)), | |
4393e105 MM |
5386 | tsubst (parm_decl, args, complain, |
5387 | NULL_TREE)); | |
36a117a5 MM |
5388 | } |
5389 | ||
5390 | *new_parms = | |
4890c2f4 MM |
5391 | tree_cons (size_int (TMPL_PARMS_DEPTH (parms) |
5392 | - TMPL_ARGS_DEPTH (args)), | |
36a117a5 MM |
5393 | new_vec, NULL_TREE); |
5394 | } | |
5395 | ||
5396 | return r; | |
5397 | } | |
5398 | ||
ed44da02 MM |
5399 | /* Substitute the ARGS into the indicated aggregate (or enumeration) |
5400 | type T. If T is not an aggregate or enumeration type, it is | |
5401 | handled as if by tsubst. IN_DECL is as for tsubst. If | |
5402 | ENTERING_SCOPE is non-zero, T is the context for a template which | |
dc957d14 | 5403 | we are presently tsubst'ing. Return the substituted value. */ |
36a117a5 | 5404 | |
e9659ab0 | 5405 | static tree |
4393e105 | 5406 | tsubst_aggr_type (t, args, complain, in_decl, entering_scope) |
36a117a5 MM |
5407 | tree t; |
5408 | tree args; | |
4393e105 | 5409 | int complain; |
36a117a5 MM |
5410 | tree in_decl; |
5411 | int entering_scope; | |
5412 | { | |
5413 | if (t == NULL_TREE) | |
5414 | return NULL_TREE; | |
5415 | ||
5416 | switch (TREE_CODE (t)) | |
5417 | { | |
5418 | case RECORD_TYPE: | |
5419 | if (TYPE_PTRMEMFUNC_P (t)) | |
5420 | { | |
5421 | tree r = build_ptrmemfunc_type | |
4393e105 | 5422 | (tsubst (TYPE_PTRMEMFUNC_FN_TYPE (t), args, complain, in_decl)); |
adecb3f4 MM |
5423 | return cp_build_qualified_type_real (r, TYPE_QUALS (t), |
5424 | complain); | |
36a117a5 MM |
5425 | } |
5426 | ||
5427 | /* else fall through */ | |
ed44da02 | 5428 | case ENUMERAL_TYPE: |
36a117a5 | 5429 | case UNION_TYPE: |
5db698f6 | 5430 | if (TYPE_TEMPLATE_INFO (t)) |
36a117a5 MM |
5431 | { |
5432 | tree argvec; | |
5433 | tree context; | |
5434 | tree r; | |
5435 | ||
5436 | /* First, determine the context for the type we are looking | |
5437 | up. */ | |
5438 | if (TYPE_CONTEXT (t) != NULL_TREE) | |
5439 | context = tsubst_aggr_type (TYPE_CONTEXT (t), args, | |
4393e105 | 5440 | complain, |
36a117a5 MM |
5441 | in_decl, /*entering_scope=*/1); |
5442 | else | |
5443 | context = NULL_TREE; | |
5444 | ||
5445 | /* Then, figure out what arguments are appropriate for the | |
5446 | type we are trying to find. For example, given: | |
5447 | ||
5448 | template <class T> struct S; | |
5449 | template <class T, class U> void f(T, U) { S<U> su; } | |
5450 | ||
5451 | and supposing that we are instantiating f<int, double>, | |
5452 | then our ARGS will be {int, double}, but, when looking up | |
5453 | S we only want {double}. */ | |
4393e105 MM |
5454 | argvec = tsubst_template_arg_vector (TYPE_TI_ARGS (t), args, |
5455 | complain); | |
08e72a19 JM |
5456 | if (argvec == error_mark_node) |
5457 | return error_mark_node; | |
36a117a5 MM |
5458 | |
5459 | r = lookup_template_class (t, argvec, in_decl, context, | |
f9c244b8 | 5460 | entering_scope, complain); |
36a117a5 | 5461 | |
adecb3f4 MM |
5462 | return cp_build_qualified_type_real (r, TYPE_QUALS (t), |
5463 | complain); | |
36a117a5 MM |
5464 | } |
5465 | else | |
5466 | /* This is not a template type, so there's nothing to do. */ | |
5467 | return t; | |
5468 | ||
5469 | default: | |
4393e105 | 5470 | return tsubst (t, args, complain, in_decl); |
36a117a5 MM |
5471 | } |
5472 | } | |
5473 | ||
9188c363 MM |
5474 | /* Substitute into the default argument ARG (a default argument for |
5475 | FN), which has the indicated TYPE. */ | |
5476 | ||
5477 | tree | |
5478 | tsubst_default_argument (fn, type, arg) | |
5479 | tree fn; | |
5480 | tree type; | |
5481 | tree arg; | |
5482 | { | |
5483 | /* This default argument came from a template. Instantiate the | |
5484 | default argument here, not in tsubst. In the case of | |
5485 | something like: | |
5486 | ||
5487 | template <class T> | |
5488 | struct S { | |
5489 | static T t(); | |
5490 | void f(T = t()); | |
5491 | }; | |
5492 | ||
5493 | we must be careful to do name lookup in the scope of S<T>, | |
5494 | rather than in the current class. */ | |
5495 | if (DECL_CLASS_SCOPE_P (fn)) | |
4f1c5b7d | 5496 | pushclass (DECL_CONTEXT (fn), 2); |
9188c363 MM |
5497 | |
5498 | arg = tsubst_expr (arg, DECL_TI_ARGS (fn), /*complain=*/1, NULL_TREE); | |
5499 | ||
5500 | if (DECL_CLASS_SCOPE_P (fn)) | |
5501 | popclass (); | |
5502 | ||
5503 | /* Make sure the default argument is reasonable. */ | |
5504 | arg = check_default_argument (type, arg); | |
5505 | ||
5506 | return arg; | |
5507 | } | |
5508 | ||
5509 | /* Substitute into all the default arguments for FN. */ | |
5510 | ||
5511 | static void | |
5512 | tsubst_default_arguments (fn) | |
5513 | tree fn; | |
5514 | { | |
5515 | tree arg; | |
5516 | tree tmpl_args; | |
5517 | ||
5518 | tmpl_args = DECL_TI_ARGS (fn); | |
5519 | ||
5520 | /* If this function is not yet instantiated, we certainly don't need | |
5521 | its default arguments. */ | |
5522 | if (uses_template_parms (tmpl_args)) | |
5523 | return; | |
5524 | ||
5525 | for (arg = TYPE_ARG_TYPES (TREE_TYPE (fn)); | |
5526 | arg; | |
5527 | arg = TREE_CHAIN (arg)) | |
5528 | if (TREE_PURPOSE (arg)) | |
5529 | TREE_PURPOSE (arg) = tsubst_default_argument (fn, | |
5530 | TREE_VALUE (arg), | |
5531 | TREE_PURPOSE (arg)); | |
5532 | } | |
5533 | ||
ae58fa02 MM |
5534 | /* Substitute the ARGS into the T, which is a _DECL. TYPE is the |
5535 | (already computed) substitution of ARGS into TREE_TYPE (T), if | |
4b2811e9 | 5536 | appropriate. Return the result of the substitution. */ |
00d3396f | 5537 | |
e9659ab0 | 5538 | static tree |
4b2811e9 | 5539 | tsubst_decl (t, args, type) |
ae58fa02 MM |
5540 | tree t; |
5541 | tree args; | |
5542 | tree type; | |
8d08fdba | 5543 | { |
ae58fa02 | 5544 | int saved_lineno; |
3b304f5b | 5545 | const char *saved_filename; |
b370501f | 5546 | tree r = NULL_TREE; |
4b2811e9 | 5547 | tree in_decl = t; |
830bfa74 | 5548 | |
ae58fa02 MM |
5549 | /* Set the filename and linenumber to improve error-reporting. */ |
5550 | saved_lineno = lineno; | |
5551 | saved_filename = input_filename; | |
5552 | lineno = DECL_SOURCE_LINE (t); | |
5553 | input_filename = DECL_SOURCE_FILE (t); | |
b7484fbe | 5554 | |
8d08fdba MS |
5555 | switch (TREE_CODE (t)) |
5556 | { | |
98c1c668 JM |
5557 | case TEMPLATE_DECL: |
5558 | { | |
5559 | /* We can get here when processing a member template function | |
5560 | of a template class. */ | |
98c1c668 | 5561 | tree decl = DECL_TEMPLATE_RESULT (t); |
386b8a85 | 5562 | tree spec; |
db2767b6 | 5563 | int is_template_template_parm = DECL_TEMPLATE_TEMPLATE_PARM_P (t); |
98c1c668 | 5564 | |
db2767b6 MM |
5565 | if (!is_template_template_parm) |
5566 | { | |
36a117a5 MM |
5567 | /* We might already have an instance of this template. |
5568 | The ARGS are for the surrounding class type, so the | |
5569 | full args contain the tsubst'd args for the context, | |
5570 | plus the innermost args from the template decl. */ | |
5571 | tree tmpl_args = DECL_CLASS_TEMPLATE_P (t) | |
5572 | ? CLASSTYPE_TI_ARGS (TREE_TYPE (t)) | |
17aec3eb | 5573 | : DECL_TI_ARGS (DECL_TEMPLATE_RESULT (t)); |
7ddedda4 MM |
5574 | tree full_args; |
5575 | ||
4393e105 MM |
5576 | full_args = tsubst_template_arg_vector (tmpl_args, args, |
5577 | /*complain=*/1); | |
36a117a5 MM |
5578 | |
5579 | /* tsubst_template_arg_vector doesn't copy the vector if | |
5580 | nothing changed. But, *something* should have | |
5581 | changed. */ | |
5582 | my_friendly_assert (full_args != tmpl_args, 0); | |
5583 | ||
5584 | spec = retrieve_specialization (t, full_args); | |
db2767b6 | 5585 | if (spec != NULL_TREE) |
ae58fa02 MM |
5586 | { |
5587 | r = spec; | |
5588 | break; | |
5589 | } | |
db2767b6 | 5590 | } |
98c1c668 JM |
5591 | |
5592 | /* Make a new template decl. It will be similar to the | |
5593 | original, but will record the current template arguments. | |
5594 | We also create a new function declaration, which is just | |
5595 | like the old one, but points to this new template, rather | |
5596 | than the old one. */ | |
0acf7199 | 5597 | r = copy_decl (t); |
ae58fa02 MM |
5598 | my_friendly_assert (DECL_LANG_SPECIFIC (r) != 0, 0); |
5599 | TREE_CHAIN (r) = NULL_TREE; | |
db2767b6 MM |
5600 | |
5601 | if (is_template_template_parm) | |
5602 | { | |
4393e105 | 5603 | tree new_decl = tsubst (decl, args, /*complain=*/1, in_decl); |
17aec3eb | 5604 | DECL_TEMPLATE_RESULT (r) = new_decl; |
ae58fa02 MM |
5605 | TREE_TYPE (r) = TREE_TYPE (new_decl); |
5606 | break; | |
db2767b6 MM |
5607 | } |
5608 | ||
ae58fa02 | 5609 | DECL_CONTEXT (r) |
4f1c5b7d | 5610 | = tsubst_aggr_type (DECL_CONTEXT (t), args, |
4393e105 MM |
5611 | /*complain=*/1, in_decl, |
5612 | /*entering_scope=*/1); | |
4f1c5b7d MM |
5613 | DECL_VIRTUAL_CONTEXT (r) |
5614 | = tsubst_aggr_type (DECL_VIRTUAL_CONTEXT (t), args, | |
5615 | /*complain=*/1, in_decl, | |
5616 | /*entering_scope=*/1); | |
ae58fa02 | 5617 | DECL_TEMPLATE_INFO (r) = build_tree_list (t, args); |
93cdc044 JM |
5618 | |
5619 | if (TREE_CODE (decl) == TYPE_DECL) | |
5620 | { | |
4393e105 MM |
5621 | tree new_type = tsubst (TREE_TYPE (t), args, |
5622 | /*complain=*/1, in_decl); | |
ae58fa02 MM |
5623 | TREE_TYPE (r) = new_type; |
5624 | CLASSTYPE_TI_TEMPLATE (new_type) = r; | |
17aec3eb | 5625 | DECL_TEMPLATE_RESULT (r) = TYPE_MAIN_DECL (new_type); |
ae58fa02 | 5626 | DECL_TI_ARGS (r) = CLASSTYPE_TI_ARGS (new_type); |
93cdc044 JM |
5627 | } |
5628 | else | |
5629 | { | |
4393e105 | 5630 | tree new_decl = tsubst (decl, args, /*complain=*/1, in_decl); |
17aec3eb RK |
5631 | |
5632 | DECL_TEMPLATE_RESULT (r) = new_decl; | |
ae58fa02 MM |
5633 | DECL_TI_TEMPLATE (new_decl) = r; |
5634 | TREE_TYPE (r) = TREE_TYPE (new_decl); | |
5635 | DECL_TI_ARGS (r) = DECL_TI_ARGS (new_decl); | |
93cdc044 JM |
5636 | } |
5637 | ||
ae58fa02 MM |
5638 | SET_DECL_IMPLICIT_INSTANTIATION (r); |
5639 | DECL_TEMPLATE_INSTANTIATIONS (r) = NULL_TREE; | |
5640 | DECL_TEMPLATE_SPECIALIZATIONS (r) = NULL_TREE; | |
98c1c668 JM |
5641 | |
5642 | /* The template parameters for this new template are all the | |
5643 | template parameters for the old template, except the | |
5644 | outermost level of parameters. */ | |
ae58fa02 | 5645 | DECL_TEMPLATE_PARMS (r) |
4393e105 MM |
5646 | = tsubst_template_parms (DECL_TEMPLATE_PARMS (t), args, |
5647 | /*complain=*/1); | |
98c1c668 | 5648 | |
93cdc044 | 5649 | if (PRIMARY_TEMPLATE_P (t)) |
ae58fa02 | 5650 | DECL_PRIMARY_TEMPLATE (r) = r; |
93cdc044 | 5651 | |
8d019cef | 5652 | /* We don't partially instantiate partial specializations. */ |
93cdc044 | 5653 | if (TREE_CODE (decl) == TYPE_DECL) |
ae58fa02 | 5654 | break; |
93cdc044 | 5655 | |
75650646 | 5656 | /* Record this partial instantiation. */ |
ae58fa02 | 5657 | register_specialization (r, t, |
17aec3eb | 5658 | DECL_TI_ARGS (DECL_TEMPLATE_RESULT (r))); |
75650646 | 5659 | |
98c1c668 | 5660 | } |
ae58fa02 | 5661 | break; |
8d08fdba MS |
5662 | |
5663 | case FUNCTION_DECL: | |
5664 | { | |
386b8a85 | 5665 | tree ctx; |
87603ed0 | 5666 | tree argvec = NULL_TREE; |
cf38f48a | 5667 | tree *friends; |
36a117a5 | 5668 | tree gen_tmpl; |
5566b478 | 5669 | int member; |
d8c4447d MM |
5670 | int args_depth; |
5671 | int parms_depth; | |
5566b478 | 5672 | |
36a117a5 MM |
5673 | /* Nobody should be tsubst'ing into non-template functions. */ |
5674 | my_friendly_assert (DECL_TEMPLATE_INFO (t) != NULL_TREE, 0); | |
5675 | ||
5676 | if (TREE_CODE (DECL_TI_TEMPLATE (t)) == TEMPLATE_DECL) | |
5677 | { | |
5678 | tree spec; | |
5679 | ||
5680 | /* Calculate the most general template of which R is a | |
5681 | specialization, and the complete set of arguments used to | |
5682 | specialize R. */ | |
5683 | gen_tmpl = most_general_template (DECL_TI_TEMPLATE (t)); | |
7ddedda4 MM |
5684 | argvec |
5685 | = tsubst_template_arg_vector (DECL_TI_ARGS | |
5686 | (DECL_TEMPLATE_RESULT (gen_tmpl)), | |
4393e105 | 5687 | args, /*complain=*/1); |
36a117a5 MM |
5688 | |
5689 | /* Check to see if we already have this specialization. */ | |
5690 | spec = retrieve_specialization (gen_tmpl, argvec); | |
7ddedda4 | 5691 | |
36a117a5 | 5692 | if (spec) |
ae58fa02 MM |
5693 | { |
5694 | r = spec; | |
5695 | break; | |
5696 | } | |
d8c4447d | 5697 | |
f9a7ae04 MM |
5698 | /* We can see more levels of arguments than parameters if |
5699 | there was a specialization of a member template, like | |
5700 | this: | |
5701 | ||
5702 | template <class T> struct S { template <class U> void f(); } | |
5703 | template <> template <class U> void S<int>::f(U); | |
5704 | ||
dc957d14 | 5705 | Here, we'll be substituting into the specialization, |
f9a7ae04 MM |
5706 | because that's where we can find the code we actually |
5707 | want to generate, but we'll have enough arguments for | |
5708 | the most general template. | |
5709 | ||
5710 | We also deal with the peculiar case: | |
d8c4447d MM |
5711 | |
5712 | template <class T> struct S { | |
5713 | template <class U> friend void f(); | |
5714 | }; | |
74b846e0 | 5715 | template <class U> void f() {} |
d8c4447d MM |
5716 | template S<int>; |
5717 | template void f<double>(); | |
5718 | ||
5719 | Here, the ARGS for the instantiation of will be {int, | |
5720 | double}. But, we only need as many ARGS as there are | |
5721 | levels of template parameters in CODE_PATTERN. We are | |
5722 | careful not to get fooled into reducing the ARGS in | |
5723 | situations like: | |
5724 | ||
5725 | template <class T> struct S { template <class U> void f(U); } | |
5726 | template <class T> template <> void S<T>::f(int) {} | |
5727 | ||
5728 | which we can spot because the pattern will be a | |
5729 | specialization in this case. */ | |
5730 | args_depth = TMPL_ARGS_DEPTH (args); | |
5731 | parms_depth = | |
5732 | TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (t))); | |
5733 | if (args_depth > parms_depth | |
5734 | && !DECL_TEMPLATE_SPECIALIZATION (t)) | |
f9a7ae04 | 5735 | args = get_innermost_template_args (args, parms_depth); |
36a117a5 MM |
5736 | } |
5737 | else | |
5738 | { | |
5739 | /* This special case arises when we have something like this: | |
5740 | ||
5741 | template <class T> struct S { | |
5742 | friend void f<int>(int, double); | |
5743 | }; | |
5744 | ||
5745 | Here, the DECL_TI_TEMPLATE for the friend declaration | |
39c01e4c MM |
5746 | will be a LOOKUP_EXPR or an IDENTIFIER_NODE. We are |
5747 | being called from tsubst_friend_function, and we want | |
5748 | only to create a new decl (R) with appropriate types so | |
5749 | that we can call determine_specialization. */ | |
5750 | my_friendly_assert ((TREE_CODE (DECL_TI_TEMPLATE (t)) | |
5751 | == LOOKUP_EXPR) | |
5752 | || (TREE_CODE (DECL_TI_TEMPLATE (t)) | |
5753 | == IDENTIFIER_NODE), 0); | |
36a117a5 MM |
5754 | gen_tmpl = NULL_TREE; |
5755 | } | |
5756 | ||
6eb3bb27 | 5757 | if (DECL_CLASS_SCOPE_P (t)) |
8d08fdba | 5758 | { |
5566b478 MS |
5759 | if (DECL_NAME (t) == constructor_name (DECL_CONTEXT (t))) |
5760 | member = 2; | |
5761 | else | |
5762 | member = 1; | |
4f1c5b7d | 5763 | ctx = tsubst_aggr_type (DECL_CONTEXT (t), args, |
4393e105 | 5764 | /*complain=*/1, t, |
36a117a5 | 5765 | /*entering_scope=*/1); |
5566b478 MS |
5766 | } |
5767 | else | |
5768 | { | |
5769 | member = 0; | |
4f1c5b7d | 5770 | ctx = DECL_CONTEXT (t); |
5566b478 | 5771 | } |
4393e105 | 5772 | type = tsubst (type, args, /*complain=*/1, in_decl); |
b3da7bb1 MM |
5773 | if (type == error_mark_node) |
5774 | return error_mark_node; | |
8d08fdba | 5775 | |
5566b478 MS |
5776 | /* We do NOT check for matching decls pushed separately at this |
5777 | point, as they may not represent instantiations of this | |
5778 | template, and in any case are considered separate under the | |
0a7394bc | 5779 | discrete model. */ |
0acf7199 | 5780 | r = copy_decl (t); |
e1467ff2 | 5781 | DECL_USE_TEMPLATE (r) = 0; |
5566b478 | 5782 | TREE_TYPE (r) = type; |
92643fea MM |
5783 | /* Clear out the mangled name and RTL for the instantiation. */ |
5784 | SET_DECL_ASSEMBLER_NAME (r, NULL_TREE); | |
5785 | SET_DECL_RTL (r, NULL_RTX); | |
5566b478 | 5786 | |
4f1c5b7d MM |
5787 | DECL_CONTEXT (r) = ctx; |
5788 | DECL_VIRTUAL_CONTEXT (r) | |
5789 | = tsubst_aggr_type (DECL_VIRTUAL_CONTEXT (t), args, | |
5790 | /*complain=*/1, t, | |
4393e105 | 5791 | /*entering_scope=*/1); |
5566b478 | 5792 | |
1f6e1acc | 5793 | if (member && DECL_CONV_FN_P (r)) |
1f84ec23 MM |
5794 | /* Type-conversion operator. Reconstruct the name, in |
5795 | case it's the name of one of the template's parameters. */ | |
5796 | DECL_NAME (r) = mangle_conv_op_name_for_type (TREE_TYPE (type)); | |
5566b478 | 5797 | |
4393e105 MM |
5798 | DECL_ARGUMENTS (r) = tsubst (DECL_ARGUMENTS (t), args, |
5799 | /*complain=*/1, t); | |
477f6664 | 5800 | DECL_RESULT (r) = NULL_TREE; |
711734a9 JM |
5801 | |
5802 | TREE_STATIC (r) = 0; | |
5803 | TREE_PUBLIC (r) = TREE_PUBLIC (t); | |
5804 | DECL_EXTERNAL (r) = 1; | |
5805 | DECL_INTERFACE_KNOWN (r) = 0; | |
5806 | DECL_DEFER_OUTPUT (r) = 0; | |
5807 | TREE_CHAIN (r) = NULL_TREE; | |
5808 | DECL_PENDING_INLINE_INFO (r) = 0; | |
59026e79 | 5809 | DECL_PENDING_INLINE_P (r) = 0; |
655dc6ee | 5810 | DECL_SAVED_TREE (r) = NULL_TREE; |
711734a9 | 5811 | TREE_USED (r) = 0; |
db9b2174 MM |
5812 | if (DECL_CLONED_FUNCTION (r)) |
5813 | { | |
5814 | DECL_CLONED_FUNCTION (r) = tsubst (DECL_CLONED_FUNCTION (t), | |
5815 | args, /*complain=*/1, t); | |
5816 | TREE_CHAIN (r) = TREE_CHAIN (DECL_CLONED_FUNCTION (r)); | |
5817 | TREE_CHAIN (DECL_CLONED_FUNCTION (r)) = r; | |
5818 | } | |
711734a9 | 5819 | |
92643fea MM |
5820 | /* Set up the DECL_TEMPLATE_INFO for R. There's no need to do |
5821 | this in the special friend case mentioned above where | |
5822 | GEN_TMPL is NULL. */ | |
36a117a5 | 5823 | if (gen_tmpl) |
386b8a85 | 5824 | { |
36a117a5 | 5825 | DECL_TEMPLATE_INFO (r) |
e1b3e07d | 5826 | = tree_cons (gen_tmpl, argvec, NULL_TREE); |
36a117a5 MM |
5827 | SET_DECL_IMPLICIT_INSTANTIATION (r); |
5828 | register_specialization (r, gen_tmpl, argvec); | |
5829 | ||
9188c363 MM |
5830 | /* We're not supposed to instantiate default arguments |
5831 | until they are called, for a template. But, for a | |
5832 | declaration like: | |
5833 | ||
5834 | template <class T> void f () | |
5835 | { extern void g(int i = T()); } | |
5836 | ||
5837 | we should do the substitution when the template is | |
5838 | instantiated. We handle the member function case in | |
5839 | instantiate_class_template since the default arguments | |
5840 | might refer to other members of the class. */ | |
5841 | if (!member | |
5842 | && !PRIMARY_TEMPLATE_P (gen_tmpl) | |
5843 | && !uses_template_parms (argvec)) | |
5844 | tsubst_default_arguments (r); | |
386b8a85 | 5845 | } |
f181d4ae | 5846 | |
cf38f48a MM |
5847 | /* Copy the list of befriending classes. */ |
5848 | for (friends = &DECL_BEFRIENDING_CLASSES (r); | |
5849 | *friends; | |
5850 | friends = &TREE_CHAIN (*friends)) | |
5851 | { | |
5852 | *friends = copy_node (*friends); | |
5853 | TREE_VALUE (*friends) = tsubst (TREE_VALUE (*friends), | |
5854 | args, /*complain=*/1, | |
5855 | in_decl); | |
5856 | } | |
5857 | ||
212e7048 | 5858 | if (DECL_CONSTRUCTOR_P (r) || DECL_DESTRUCTOR_P (r)) |
f181d4ae MM |
5859 | { |
5860 | maybe_retrofit_in_chrg (r); | |
212e7048 MM |
5861 | if (DECL_CONSTRUCTOR_P (r)) |
5862 | grok_ctor_properties (ctx, r); | |
2be678ff JM |
5863 | /* If this is an instantiation of a member template, clone it. |
5864 | If it isn't, that'll be handled by | |
5865 | clone_constructors_and_destructors. */ | |
5e818b93 JM |
5866 | if (PRIMARY_TEMPLATE_P (gen_tmpl)) |
5867 | clone_function_decl(r, /*update_method_vec_p=*/0); | |
f181d4ae | 5868 | } |
596ea4e5 | 5869 | else if (IDENTIFIER_OPNAME_P (DECL_NAME (r))) |
f181d4ae | 5870 | grok_op_properties (r, DECL_VIRTUAL_P (r), DECL_FRIEND_P (r)); |
8d08fdba | 5871 | } |
ae58fa02 | 5872 | break; |
8d08fdba MS |
5873 | |
5874 | case PARM_DECL: | |
5875 | { | |
ae58fa02 | 5876 | r = copy_node (t); |
5566b478 | 5877 | TREE_TYPE (r) = type; |
1b8899d1 MM |
5878 | c_apply_type_quals_to_decl (CP_TYPE_QUALS (type), r); |
5879 | ||
db2767b6 MM |
5880 | if (TREE_CODE (DECL_INITIAL (r)) != TEMPLATE_PARM_INDEX) |
5881 | DECL_INITIAL (r) = TREE_TYPE (r); | |
5882 | else | |
4393e105 MM |
5883 | DECL_INITIAL (r) = tsubst (DECL_INITIAL (r), args, |
5884 | /*complain=*/1, in_decl); | |
db2767b6 | 5885 | |
5566b478 | 5886 | DECL_CONTEXT (r) = NULL_TREE; |
fa56377d | 5887 | if (PROMOTE_PROTOTYPES |
acf97e0b | 5888 | && INTEGRAL_TYPE_P (type) |
f83b0cb6 JM |
5889 | && TYPE_PRECISION (type) < TYPE_PRECISION (integer_type_node)) |
5890 | DECL_ARG_TYPE (r) = integer_type_node; | |
8d08fdba | 5891 | if (TREE_CHAIN (t)) |
4393e105 MM |
5892 | TREE_CHAIN (r) = tsubst (TREE_CHAIN (t), args, |
5893 | /*complain=*/1, TREE_CHAIN (t)); | |
8d08fdba | 5894 | } |
ae58fa02 | 5895 | break; |
8d08fdba | 5896 | |
5566b478 MS |
5897 | case FIELD_DECL: |
5898 | { | |
0acf7199 | 5899 | r = copy_decl (t); |
1b8899d1 MM |
5900 | TREE_TYPE (r) = type; |
5901 | c_apply_type_quals_to_decl (CP_TYPE_QUALS (type), r); | |
5902 | ||
5903 | /* We don't have to set DECL_CONTEXT here; it is set by | |
5904 | finish_member_declaration. */ | |
4393e105 MM |
5905 | DECL_INITIAL (r) = tsubst_expr (DECL_INITIAL (t), args, |
5906 | /*complain=*/1, in_decl); | |
5566b478 | 5907 | TREE_CHAIN (r) = NULL_TREE; |
dfbb4f34 NS |
5908 | if (VOID_TYPE_P (type)) |
5909 | cp_error_at ("instantiation of `%D' as type `%T'", r, type); | |
5566b478 | 5910 | } |
ae58fa02 | 5911 | break; |
5566b478 MS |
5912 | |
5913 | case USING_DECL: | |
5914 | { | |
ae58fa02 | 5915 | r = copy_node (t); |
5566b478 | 5916 | DECL_INITIAL (r) |
4393e105 | 5917 | = tsubst_copy (DECL_INITIAL (t), args, /*complain=*/1, in_decl); |
5566b478 | 5918 | TREE_CHAIN (r) = NULL_TREE; |
5566b478 | 5919 | } |
ae58fa02 | 5920 | break; |
5566b478 | 5921 | |
9188c363 | 5922 | case TYPE_DECL: |
88e1b92a JM |
5923 | if (TREE_CODE (type) == TEMPLATE_TEMPLATE_PARM |
5924 | || t == TYPE_MAIN_DECL (TREE_TYPE (t))) | |
9188c363 | 5925 | { |
88e1b92a JM |
5926 | /* If this is the canonical decl, we don't have to mess with |
5927 | instantiations, and often we can't (for typename, template | |
5928 | type parms and such). Note that TYPE_NAME is not correct for | |
5929 | the above test if we've copied the type for a typedef. */ | |
b9f39201 | 5930 | r = TYPE_NAME (type); |
9188c363 MM |
5931 | break; |
5932 | } | |
5933 | ||
5934 | /* Fall through. */ | |
5935 | ||
5566b478 MS |
5936 | case VAR_DECL: |
5937 | { | |
1cea0434 KG |
5938 | tree argvec = NULL_TREE; |
5939 | tree gen_tmpl = NULL_TREE; | |
36a117a5 | 5940 | tree spec; |
1cea0434 | 5941 | tree tmpl = NULL_TREE; |
9188c363 | 5942 | tree ctx; |
6dfbb909 | 5943 | int local_p; |
9188c363 | 5944 | |
6dfbb909 MM |
5945 | /* Assume this is a non-local variable. */ |
5946 | local_p = 0; | |
5566b478 | 5947 | |
de96bf57 | 5948 | if (TYPE_P (CP_DECL_CONTEXT (t))) |
9188c363 MM |
5949 | ctx = tsubst_aggr_type (DECL_CONTEXT (t), args, |
5950 | /*complain=*/1, | |
5951 | in_decl, /*entering_scope=*/1); | |
2ba9c47e MM |
5952 | else if (DECL_NAMESPACE_SCOPE_P (t)) |
5953 | ctx = DECL_CONTEXT (t); | |
9188c363 | 5954 | else |
6dfbb909 MM |
5955 | { |
5956 | /* Subsequent calls to pushdecl will fill this in. */ | |
5957 | ctx = NULL_TREE; | |
2ba9c47e | 5958 | local_p = 1; |
6dfbb909 | 5959 | } |
9188c363 | 5960 | |
36a117a5 | 5961 | /* Check to see if we already have this specialization. */ |
6dfbb909 MM |
5962 | if (!local_p) |
5963 | { | |
5964 | tmpl = DECL_TI_TEMPLATE (t); | |
5965 | gen_tmpl = most_general_template (tmpl); | |
5966 | argvec = tsubst (DECL_TI_ARGS (t), args, /*complain=*/1, in_decl); | |
5967 | spec = retrieve_specialization (gen_tmpl, argvec); | |
5968 | } | |
9188c363 | 5969 | else |
6dfbb909 | 5970 | spec = retrieve_local_specialization (t); |
9188c363 | 5971 | |
36a117a5 | 5972 | if (spec) |
ae58fa02 MM |
5973 | { |
5974 | r = spec; | |
5975 | break; | |
5976 | } | |
5566b478 | 5977 | |
0acf7199 | 5978 | r = copy_decl (t); |
5566b478 | 5979 | TREE_TYPE (r) = type; |
1b8899d1 | 5980 | c_apply_type_quals_to_decl (CP_TYPE_QUALS (type), r); |
5566b478 | 5981 | DECL_CONTEXT (r) = ctx; |
92643fea MM |
5982 | /* Clear out the mangled name and RTL for the instantiation. */ |
5983 | SET_DECL_ASSEMBLER_NAME (r, NULL_TREE); | |
5984 | SET_DECL_RTL (r, NULL_RTX); | |
d11ad92e MS |
5985 | |
5986 | /* Don't try to expand the initializer until someone tries to use | |
5987 | this variable; otherwise we run into circular dependencies. */ | |
5988 | DECL_INITIAL (r) = NULL_TREE; | |
19e7881c | 5989 | SET_DECL_RTL (r, NULL_RTX); |
06ceef4e | 5990 | DECL_SIZE (r) = DECL_SIZE_UNIT (r) = 0; |
5566b478 | 5991 | |
f9817201 MM |
5992 | /* For __PRETTY_FUNCTION__ we have to adjust the initializer. */ |
5993 | if (DECL_PRETTY_FUNCTION_P (r)) | |
5994 | { | |
0ba8a114 NS |
5995 | const char *name = (*decl_printable_name) |
5996 | (current_function_decl, 2); | |
5997 | DECL_INITIAL (r) = cp_fname_init (name); | |
f9817201 MM |
5998 | TREE_TYPE (r) = TREE_TYPE (DECL_INITIAL (r)); |
5999 | } | |
6000 | ||
e0942dcd MM |
6001 | /* Even if the original location is out of scope, the newly |
6002 | substituted one is not. */ | |
6003 | if (TREE_CODE (r) == VAR_DECL) | |
6004 | DECL_DEAD_FOR_LOCAL (r) = 0; | |
6005 | ||
6dfbb909 MM |
6006 | if (!local_p) |
6007 | { | |
6008 | /* A static data member declaration is always marked | |
6009 | external when it is declared in-class, even if an | |
6010 | initializer is present. We mimic the non-template | |
6011 | processing here. */ | |
6012 | DECL_EXTERNAL (r) = 1; | |
fa8d6e85 | 6013 | |
6dfbb909 MM |
6014 | register_specialization (r, gen_tmpl, argvec); |
6015 | DECL_TEMPLATE_INFO (r) = tree_cons (tmpl, argvec, NULL_TREE); | |
6016 | SET_DECL_IMPLICIT_INSTANTIATION (r); | |
6017 | } | |
9188c363 | 6018 | else |
6dfbb909 | 6019 | register_local_specialization (r, t); |
5566b478 | 6020 | |
5566b478 | 6021 | TREE_CHAIN (r) = NULL_TREE; |
dfbb4f34 NS |
6022 | if (TREE_CODE (r) == VAR_DECL && VOID_TYPE_P (type)) |
6023 | cp_error_at ("instantiation of `%D' as type `%T'", r, type); | |
5566b478 | 6024 | } |
ae58fa02 | 6025 | break; |
5566b478 | 6026 | |
ae58fa02 MM |
6027 | default: |
6028 | my_friendly_abort (0); | |
6029 | } | |
6030 | ||
6031 | /* Restore the file and line information. */ | |
6032 | lineno = saved_lineno; | |
6033 | input_filename = saved_filename; | |
6034 | ||
6035 | return r; | |
6036 | } | |
6037 | ||
cabc336a MM |
6038 | /* Substitue into the ARG_TYPES of a function type. */ |
6039 | ||
e9659ab0 | 6040 | static tree |
4393e105 | 6041 | tsubst_arg_types (arg_types, args, complain, in_decl) |
cabc336a MM |
6042 | tree arg_types; |
6043 | tree args; | |
4393e105 | 6044 | int complain; |
cabc336a MM |
6045 | tree in_decl; |
6046 | { | |
6047 | tree remaining_arg_types; | |
cabc336a MM |
6048 | tree type; |
6049 | ||
6050 | if (!arg_types || arg_types == void_list_node) | |
6051 | return arg_types; | |
6052 | ||
6053 | remaining_arg_types = tsubst_arg_types (TREE_CHAIN (arg_types), | |
4393e105 MM |
6054 | args, complain, in_decl); |
6055 | if (remaining_arg_types == error_mark_node) | |
6056 | return error_mark_node; | |
6057 | ||
6058 | type = tsubst (TREE_VALUE (arg_types), args, complain, in_decl); | |
6059 | if (type == error_mark_node) | |
6060 | return error_mark_node; | |
4b2811e9 NS |
6061 | if (VOID_TYPE_P (type)) |
6062 | { | |
6063 | if (complain) | |
6064 | { | |
6065 | cp_error ("invalid parameter type `%T'", type); | |
6066 | if (in_decl) | |
6067 | cp_error_at ("in declaration `%D'", in_decl); | |
6068 | } | |
6069 | return error_mark_node; | |
6070 | } | |
cabc336a | 6071 | |
4393e105 MM |
6072 | /* Do array-to-pointer, function-to-pointer conversion, and ignore |
6073 | top-level qualifiers as required. */ | |
6074 | type = TYPE_MAIN_VARIANT (type_decays_to (type)); | |
cabc336a MM |
6075 | |
6076 | /* Note that we do not substitute into default arguments here. The | |
6077 | standard mandates that they be instantiated only when needed, | |
6078 | which is done in build_over_call. */ | |
51632249 JM |
6079 | return hash_tree_cons (TREE_PURPOSE (arg_types), type, |
6080 | remaining_arg_types); | |
cabc336a MM |
6081 | |
6082 | } | |
6083 | ||
4393e105 MM |
6084 | /* Substitute into a FUNCTION_TYPE or METHOD_TYPE. This routine does |
6085 | *not* handle the exception-specification for FNTYPE, because the | |
6086 | initial substitution of explicitly provided template parameters | |
6087 | during argument deduction forbids substitution into the | |
6088 | exception-specification: | |
6089 | ||
6090 | [temp.deduct] | |
6091 | ||
6092 | All references in the function type of the function template to the | |
6093 | corresponding template parameters are replaced by the specified tem- | |
6094 | plate argument values. If a substitution in a template parameter or | |
6095 | in the function type of the function template results in an invalid | |
6096 | type, type deduction fails. [Note: The equivalent substitution in | |
6097 | exception specifications is done only when the function is instanti- | |
6098 | ated, at which point a program is ill-formed if the substitution | |
6099 | results in an invalid type.] */ | |
6100 | ||
6101 | static tree | |
6102 | tsubst_function_type (t, args, complain, in_decl) | |
6103 | tree t; | |
6104 | tree args; | |
6105 | int complain; | |
6106 | tree in_decl; | |
6107 | { | |
6108 | tree return_type; | |
6109 | tree arg_types; | |
6110 | tree fntype; | |
6111 | ||
8dd3f57a | 6112 | /* The TYPE_CONTEXT is not used for function/method types. */ |
4393e105 MM |
6113 | my_friendly_assert (TYPE_CONTEXT (t) == NULL_TREE, 0); |
6114 | ||
6115 | /* Substitue the return type. */ | |
6116 | return_type = tsubst (TREE_TYPE (t), args, complain, in_decl); | |
6117 | if (return_type == error_mark_node) | |
6118 | return error_mark_node; | |
6119 | ||
6120 | /* Substitue the argument types. */ | |
6121 | arg_types = tsubst_arg_types (TYPE_ARG_TYPES (t), args, | |
6122 | complain, in_decl); | |
6123 | if (arg_types == error_mark_node) | |
6124 | return error_mark_node; | |
6125 | ||
6126 | /* Construct a new type node and return it. */ | |
6127 | if (TREE_CODE (t) == FUNCTION_TYPE) | |
6128 | fntype = build_function_type (return_type, arg_types); | |
6129 | else | |
6130 | { | |
6131 | tree r = TREE_TYPE (TREE_VALUE (arg_types)); | |
6132 | if (! IS_AGGR_TYPE (r)) | |
6133 | { | |
6134 | /* [temp.deduct] | |
6135 | ||
6136 | Type deduction may fail for any of the following | |
6137 | reasons: | |
6138 | ||
6139 | -- Attempting to create "pointer to member of T" when T | |
6140 | is not a class type. */ | |
6141 | if (complain) | |
6142 | cp_error ("creating pointer to member function of non-class type `%T'", | |
6143 | r); | |
6144 | return error_mark_node; | |
6145 | } | |
6146 | ||
6147 | fntype = build_cplus_method_type (r, return_type, TREE_CHAIN | |
6148 | (arg_types)); | |
6149 | } | |
6150 | fntype = build_qualified_type (fntype, TYPE_QUALS (t)); | |
ada846eb | 6151 | fntype = build_type_attribute_variant (fntype, TYPE_ATTRIBUTES (t)); |
4393e105 MM |
6152 | |
6153 | return fntype; | |
6154 | } | |
6155 | ||
297e73d8 MM |
6156 | /* Substitute into the PARMS of a call-declarator. */ |
6157 | ||
e9659ab0 | 6158 | static tree |
4393e105 | 6159 | tsubst_call_declarator_parms (parms, args, complain, in_decl) |
297e73d8 MM |
6160 | tree parms; |
6161 | tree args; | |
4393e105 | 6162 | int complain; |
297e73d8 MM |
6163 | tree in_decl; |
6164 | { | |
6165 | tree new_parms; | |
6166 | tree type; | |
6167 | tree defarg; | |
6168 | ||
6169 | if (!parms || parms == void_list_node) | |
6170 | return parms; | |
6171 | ||
6172 | new_parms = tsubst_call_declarator_parms (TREE_CHAIN (parms), | |
4393e105 | 6173 | args, complain, in_decl); |
297e73d8 MM |
6174 | |
6175 | /* Figure out the type of this parameter. */ | |
4393e105 | 6176 | type = tsubst (TREE_VALUE (parms), args, complain, in_decl); |
297e73d8 MM |
6177 | |
6178 | /* Figure out the default argument as well. Note that we use | |
4393e105 MM |
6179 | tsubst_expr since the default argument is really an expression. */ |
6180 | defarg = tsubst_expr (TREE_PURPOSE (parms), args, complain, in_decl); | |
297e73d8 MM |
6181 | |
6182 | /* Chain this parameter on to the front of those we have already | |
6183 | processed. We don't use hash_tree_cons because that function | |
6184 | doesn't check TREE_PARMLIST. */ | |
6185 | new_parms = tree_cons (defarg, type, new_parms); | |
6186 | ||
6187 | /* And note that these are parameters. */ | |
6188 | TREE_PARMLIST (new_parms) = 1; | |
6189 | ||
6190 | return new_parms; | |
6191 | } | |
6192 | ||
4393e105 MM |
6193 | /* Take the tree structure T and replace template parameters used |
6194 | therein with the argument vector ARGS. IN_DECL is an associated | |
6195 | decl for diagnostics. If an error occurs, returns ERROR_MARK_NODE. | |
6196 | An appropriate error message is issued only if COMPLAIN is | |
6197 | non-zero. Note that we must be relatively non-tolerant of | |
6198 | extensions here, in order to preserve conformance; if we allow | |
6199 | substitutions that should not be allowed, we may allow argument | |
6200 | deductions that should not succeed, and therefore report ambiguous | |
6201 | overload situations where there are none. In theory, we could | |
6202 | allow the substitution, but indicate that it should have failed, | |
6203 | and allow our caller to make sure that the right thing happens, but | |
6204 | we don't try to do this yet. | |
6205 | ||
6206 | This function is used for dealing with types, decls and the like; | |
6207 | for expressions, use tsubst_expr or tsubst_copy. */ | |
ae58fa02 MM |
6208 | |
6209 | tree | |
4393e105 | 6210 | tsubst (t, args, complain, in_decl) |
ae58fa02 | 6211 | tree t, args; |
4393e105 | 6212 | int complain; |
ae58fa02 MM |
6213 | tree in_decl; |
6214 | { | |
0ecfe0b4 | 6215 | tree type, r; |
ae58fa02 MM |
6216 | |
6217 | if (t == NULL_TREE || t == error_mark_node | |
6218 | || t == integer_type_node | |
6219 | || t == void_type_node | |
6220 | || t == char_type_node | |
6221 | || TREE_CODE (t) == NAMESPACE_DECL) | |
6222 | return t; | |
6223 | ||
6224 | if (TREE_CODE (t) == IDENTIFIER_NODE) | |
6225 | type = IDENTIFIER_TYPE_VALUE (t); | |
6226 | else | |
6227 | type = TREE_TYPE (t); | |
6228 | if (type == unknown_type_node) | |
6229 | my_friendly_abort (42); | |
6230 | ||
6231 | if (type && TREE_CODE (t) != FUNCTION_DECL | |
6232 | && TREE_CODE (t) != TYPENAME_TYPE | |
6233 | && TREE_CODE (t) != TEMPLATE_DECL | |
4393e105 MM |
6234 | && TREE_CODE (t) != IDENTIFIER_NODE |
6235 | && TREE_CODE (t) != FUNCTION_TYPE | |
6236 | && TREE_CODE (t) != METHOD_TYPE) | |
6237 | type = tsubst (type, args, complain, in_decl); | |
6238 | if (type == error_mark_node) | |
6239 | return error_mark_node; | |
ae58fa02 | 6240 | |
2f939d94 | 6241 | if (DECL_P (t)) |
4b2811e9 | 6242 | return tsubst_decl (t, args, type); |
ae58fa02 MM |
6243 | |
6244 | switch (TREE_CODE (t)) | |
6245 | { | |
6246 | case RECORD_TYPE: | |
6247 | case UNION_TYPE: | |
6248 | case ENUMERAL_TYPE: | |
4393e105 MM |
6249 | return tsubst_aggr_type (t, args, complain, in_decl, |
6250 | /*entering_scope=*/0); | |
ae58fa02 MM |
6251 | |
6252 | case ERROR_MARK: | |
6253 | case IDENTIFIER_NODE: | |
6254 | case OP_IDENTIFIER: | |
6255 | case VOID_TYPE: | |
6256 | case REAL_TYPE: | |
6257 | case COMPLEX_TYPE: | |
c00996a3 | 6258 | case VECTOR_TYPE: |
ae58fa02 MM |
6259 | case BOOLEAN_TYPE: |
6260 | case INTEGER_CST: | |
6261 | case REAL_CST: | |
6262 | case STRING_CST: | |
6263 | return t; | |
6264 | ||
6265 | case INTEGER_TYPE: | |
6266 | if (t == integer_type_node) | |
6267 | return t; | |
6268 | ||
6269 | if (TREE_CODE (TYPE_MIN_VALUE (t)) == INTEGER_CST | |
6270 | && TREE_CODE (TYPE_MAX_VALUE (t)) == INTEGER_CST) | |
6271 | return t; | |
d2e5ee5c | 6272 | |
5566b478 | 6273 | { |
ddce3528 | 6274 | tree max, omax = TREE_OPERAND (TYPE_MAX_VALUE (t), 0); |
7ddedda4 | 6275 | |
ddce3528 | 6276 | max = tsubst_expr (omax, args, complain, in_decl); |
4393e105 MM |
6277 | if (max == error_mark_node) |
6278 | return error_mark_node; | |
6279 | ||
8dd3f57a MM |
6280 | /* See if we can reduce this expression to something simpler. */ |
6281 | max = maybe_fold_nontype_arg (max); | |
fc611ce0 | 6282 | if (!processing_template_decl) |
8dd3f57a MM |
6283 | max = decl_constant_value (max); |
6284 | ||
856216bb MM |
6285 | if (processing_template_decl |
6286 | /* When providing explicit arguments to a template | |
6287 | function, but leaving some arguments for subsequent | |
6288 | deduction, MAX may be template-dependent even if we're | |
c95cd22e JM |
6289 | not PROCESSING_TEMPLATE_DECL. We still need to check for |
6290 | template parms, though; MAX won't be an INTEGER_CST for | |
6291 | dynamic arrays, either. */ | |
6292 | || (TREE_CODE (max) != INTEGER_CST | |
6293 | && uses_template_parms (max))) | |
ae58fa02 | 6294 | { |
8dd3f57a MM |
6295 | tree itype = make_node (INTEGER_TYPE); |
6296 | TYPE_MIN_VALUE (itype) = size_zero_node; | |
6297 | TYPE_MAX_VALUE (itype) = build_min (MINUS_EXPR, sizetype, max, | |
6298 | integer_one_node); | |
6299 | return itype; | |
ae58fa02 MM |
6300 | } |
6301 | ||
ddce3528 JM |
6302 | if (integer_zerop (omax)) |
6303 | { | |
6304 | /* Still allow an explicit array of size zero. */ | |
6305 | if (pedantic) | |
6306 | pedwarn ("creating array with size zero"); | |
6307 | } | |
07c88314 MM |
6308 | else if (integer_zerop (max) |
6309 | || (TREE_CODE (max) == INTEGER_CST | |
6310 | && INT_CST_LT (max, integer_zero_node))) | |
0ecfe0b4 | 6311 | { |
4393e105 MM |
6312 | /* [temp.deduct] |
6313 | ||
6314 | Type deduction may fail for any of the following | |
6315 | reasons: | |
6316 | ||
bf8f3f93 MM |
6317 | Attempting to create an array with a size that is |
6318 | zero or negative. */ | |
4393e105 | 6319 | if (complain) |
16bb3387 | 6320 | cp_error ("creating array with size zero (`%E')", max); |
4393e105 MM |
6321 | |
6322 | return error_mark_node; | |
0ecfe0b4 JM |
6323 | } |
6324 | ||
c95cd22e | 6325 | return compute_array_index_type (NULL_TREE, max); |
ae58fa02 MM |
6326 | } |
6327 | ||
6328 | case TEMPLATE_TYPE_PARM: | |
6329 | case TEMPLATE_TEMPLATE_PARM: | |
a1281f45 | 6330 | case BOUND_TEMPLATE_TEMPLATE_PARM: |
ae58fa02 MM |
6331 | case TEMPLATE_PARM_INDEX: |
6332 | { | |
6333 | int idx; | |
6334 | int level; | |
6335 | int levels; | |
0ecfe0b4 JM |
6336 | |
6337 | r = NULL_TREE; | |
ae58fa02 MM |
6338 | |
6339 | if (TREE_CODE (t) == TEMPLATE_TYPE_PARM | |
a1281f45 KL |
6340 | || TREE_CODE (t) == TEMPLATE_TEMPLATE_PARM |
6341 | || TREE_CODE (t) == BOUND_TEMPLATE_TEMPLATE_PARM) | |
ae58fa02 MM |
6342 | { |
6343 | idx = TEMPLATE_TYPE_IDX (t); | |
6344 | level = TEMPLATE_TYPE_LEVEL (t); | |
6345 | } | |
6346 | else | |
6347 | { | |
6348 | idx = TEMPLATE_PARM_IDX (t); | |
6349 | level = TEMPLATE_PARM_LEVEL (t); | |
6350 | } | |
6351 | ||
6352 | if (TREE_VEC_LENGTH (args) > 0) | |
6353 | { | |
6354 | tree arg = NULL_TREE; | |
6355 | ||
6356 | levels = TMPL_ARGS_DEPTH (args); | |
6357 | if (level <= levels) | |
6358 | arg = TMPL_ARG (args, level, idx); | |
6359 | ||
8b5b8b7c MM |
6360 | if (arg == error_mark_node) |
6361 | return error_mark_node; | |
6362 | else if (arg != NULL_TREE) | |
ae58fa02 MM |
6363 | { |
6364 | if (TREE_CODE (t) == TEMPLATE_TYPE_PARM) | |
6365 | { | |
2f939d94 | 6366 | my_friendly_assert (TYPE_P (arg), 0); |
adecb3f4 MM |
6367 | return cp_build_qualified_type_real |
6368 | (arg, CP_TYPE_QUALS (arg) | CP_TYPE_QUALS (t), | |
6369 | complain); | |
ae58fa02 | 6370 | } |
a1281f45 | 6371 | else if (TREE_CODE (t) == BOUND_TEMPLATE_TEMPLATE_PARM) |
ae58fa02 | 6372 | { |
a1281f45 KL |
6373 | /* We are processing a type constructed from |
6374 | a template template parameter */ | |
6375 | tree argvec = tsubst (TYPE_TI_ARGS (t), | |
6376 | args, complain, in_decl); | |
6377 | if (argvec == error_mark_node) | |
6378 | return error_mark_node; | |
4393e105 | 6379 | |
a1281f45 KL |
6380 | /* We can get a TEMPLATE_TEMPLATE_PARM here when |
6381 | we are resolving nested-types in the signature of | |
6382 | a member function templates. | |
6383 | Otherwise ARG is a TEMPLATE_DECL and is the real | |
6384 | template to be instantiated. */ | |
6385 | if (TREE_CODE (arg) == TEMPLATE_TEMPLATE_PARM) | |
6386 | arg = TYPE_NAME (arg); | |
6387 | ||
6388 | r = lookup_template_class (arg, | |
6389 | argvec, in_decl, | |
6390 | DECL_CONTEXT (arg), | |
f9c244b8 NS |
6391 | /*entering_scope=*/0, |
6392 | complain); | |
a1281f45 KL |
6393 | return cp_build_qualified_type_real (r, |
6394 | TYPE_QUALS (t), | |
6395 | complain); | |
ae58fa02 MM |
6396 | } |
6397 | else | |
a1281f45 | 6398 | /* TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX. */ |
ae58fa02 MM |
6399 | return arg; |
6400 | } | |
6401 | } | |
51924768 JM |
6402 | else |
6403 | my_friendly_abort (981018); | |
ae58fa02 MM |
6404 | |
6405 | if (level == 1) | |
6406 | /* This can happen during the attempted tsubst'ing in | |
6407 | unify. This means that we don't yet have any information | |
6408 | about the template parameter in question. */ | |
6409 | return t; | |
6410 | ||
6411 | /* If we get here, we must have been looking at a parm for a | |
6412 | more deeply nested template. Make a new version of this | |
6413 | template parameter, but with a lower level. */ | |
6414 | switch (TREE_CODE (t)) | |
6415 | { | |
6416 | case TEMPLATE_TYPE_PARM: | |
6417 | case TEMPLATE_TEMPLATE_PARM: | |
a1281f45 | 6418 | case BOUND_TEMPLATE_TEMPLATE_PARM: |
9ccf6541 | 6419 | if (CP_TYPE_QUALS (t)) |
ae58fa02 | 6420 | { |
9ccf6541 MM |
6421 | r = tsubst (TYPE_MAIN_VARIANT (t), args, complain, in_decl); |
6422 | r = cp_build_qualified_type_real (r, CP_TYPE_QUALS (t), | |
6423 | complain); | |
6424 | } | |
6425 | else | |
6426 | { | |
6427 | r = copy_node (t); | |
6428 | TEMPLATE_TYPE_PARM_INDEX (r) | |
6429 | = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (t), | |
6430 | r, levels); | |
6431 | TYPE_STUB_DECL (r) = TYPE_NAME (r) = TEMPLATE_TYPE_DECL (r); | |
6432 | TYPE_MAIN_VARIANT (r) = r; | |
6433 | TYPE_POINTER_TO (r) = NULL_TREE; | |
6434 | TYPE_REFERENCE_TO (r) = NULL_TREE; | |
6435 | ||
a1281f45 | 6436 | if (TREE_CODE (t) == BOUND_TEMPLATE_TEMPLATE_PARM) |
9ccf6541 MM |
6437 | { |
6438 | tree argvec = tsubst (TYPE_TI_ARGS (t), args, | |
6439 | complain, in_decl); | |
6440 | if (argvec == error_mark_node) | |
6441 | return error_mark_node; | |
4393e105 | 6442 | |
9ccf6541 MM |
6443 | TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (r) |
6444 | = tree_cons (TYPE_TI_TEMPLATE (t), argvec, NULL_TREE); | |
6445 | } | |
ae58fa02 MM |
6446 | } |
6447 | break; | |
6448 | ||
6449 | case TEMPLATE_PARM_INDEX: | |
6450 | r = reduce_template_parm_level (t, type, levels); | |
6451 | break; | |
6452 | ||
6453 | default: | |
6454 | my_friendly_abort (0); | |
6455 | } | |
6456 | ||
5566b478 | 6457 | return r; |
ae58fa02 | 6458 | } |
5566b478 | 6459 | |
8d08fdba MS |
6460 | case TREE_LIST: |
6461 | { | |
6462 | tree purpose, value, chain, result; | |
8d08fdba MS |
6463 | |
6464 | if (t == void_list_node) | |
6465 | return t; | |
6466 | ||
8d08fdba MS |
6467 | purpose = TREE_PURPOSE (t); |
6468 | if (purpose) | |
4393e105 MM |
6469 | { |
6470 | purpose = tsubst (purpose, args, complain, in_decl); | |
6471 | if (purpose == error_mark_node) | |
6472 | return error_mark_node; | |
6473 | } | |
8d08fdba MS |
6474 | value = TREE_VALUE (t); |
6475 | if (value) | |
4393e105 MM |
6476 | { |
6477 | value = tsubst (value, args, complain, in_decl); | |
6478 | if (value == error_mark_node) | |
6479 | return error_mark_node; | |
6480 | } | |
8d08fdba MS |
6481 | chain = TREE_CHAIN (t); |
6482 | if (chain && chain != void_type_node) | |
4393e105 MM |
6483 | { |
6484 | chain = tsubst (chain, args, complain, in_decl); | |
6485 | if (chain == error_mark_node) | |
6486 | return error_mark_node; | |
6487 | } | |
8d08fdba MS |
6488 | if (purpose == TREE_PURPOSE (t) |
6489 | && value == TREE_VALUE (t) | |
6490 | && chain == TREE_CHAIN (t)) | |
6491 | return t; | |
cbd5937a MM |
6492 | if (TREE_PARMLIST (t)) |
6493 | { | |
6494 | result = tree_cons (purpose, value, chain); | |
6495 | TREE_PARMLIST (result) = 1; | |
6496 | } | |
6497 | else | |
6498 | result = hash_tree_cons (purpose, value, chain); | |
8d08fdba MS |
6499 | return result; |
6500 | } | |
6501 | case TREE_VEC: | |
5566b478 MS |
6502 | if (type != NULL_TREE) |
6503 | { | |
1ceaad38 JM |
6504 | /* A binfo node. We always need to make a copy, of the node |
6505 | itself and of its BINFO_BASETYPES. */ | |
85b71cf2 | 6506 | |
5566b478 MS |
6507 | t = copy_node (t); |
6508 | ||
c7449f2b JM |
6509 | /* Make sure type isn't a typedef copy. */ |
6510 | type = BINFO_TYPE (TYPE_BINFO (type)); | |
6511 | ||
5566b478 | 6512 | TREE_TYPE (t) = complete_type (type); |
6633d636 MS |
6513 | if (IS_AGGR_TYPE (type)) |
6514 | { | |
6515 | BINFO_VTABLE (t) = TYPE_BINFO_VTABLE (type); | |
6516 | BINFO_VIRTUALS (t) = TYPE_BINFO_VIRTUALS (type); | |
6517 | if (TYPE_BINFO_BASETYPES (type) != NULL_TREE) | |
6518 | BINFO_BASETYPES (t) = copy_node (TYPE_BINFO_BASETYPES (type)); | |
6519 | } | |
5566b478 MS |
6520 | return t; |
6521 | } | |
85b71cf2 JM |
6522 | |
6523 | /* Otherwise, a vector of template arguments. */ | |
4393e105 | 6524 | return tsubst_template_arg_vector (t, args, complain); |
8d08fdba | 6525 | |
8d08fdba MS |
6526 | case POINTER_TYPE: |
6527 | case REFERENCE_TYPE: | |
6528 | { | |
8d08fdba | 6529 | enum tree_code code; |
79a7c7fa | 6530 | |
8d08fdba MS |
6531 | if (type == TREE_TYPE (t)) |
6532 | return t; | |
6533 | ||
6534 | code = TREE_CODE (t); | |
4393e105 MM |
6535 | |
6536 | ||
6537 | /* [temp.deduct] | |
6538 | ||
6539 | Type deduction may fail for any of the following | |
6540 | reasons: | |
6541 | ||
6542 | -- Attempting to create a pointer to reference type. | |
6543 | -- Attempting to create a reference to a reference type or | |
6544 | a reference to void. */ | |
0ecfe0b4 JM |
6545 | if (TREE_CODE (type) == REFERENCE_TYPE |
6546 | || (code == REFERENCE_TYPE && TREE_CODE (type) == VOID_TYPE)) | |
79a7c7fa JM |
6547 | { |
6548 | static int last_line = 0; | |
3b304f5b | 6549 | static const char* last_file = 0; |
79a7c7fa JM |
6550 | |
6551 | /* We keep track of the last time we issued this error | |
6552 | message to avoid spewing a ton of messages during a | |
6553 | single bad template instantiation. */ | |
4393e105 MM |
6554 | if (complain && (last_line != lineno || |
6555 | last_file != input_filename)) | |
79a7c7fa | 6556 | { |
0ecfe0b4 JM |
6557 | if (TREE_CODE (type) == VOID_TYPE) |
6558 | cp_error ("forming reference to void"); | |
6559 | else | |
6560 | cp_error ("forming %s to reference type `%T'", | |
6561 | (code == POINTER_TYPE) ? "pointer" : "reference", | |
6562 | type); | |
79a7c7fa JM |
6563 | last_line = lineno; |
6564 | last_file = input_filename; | |
6565 | } | |
6566 | ||
4393e105 | 6567 | return error_mark_node; |
79a7c7fa JM |
6568 | } |
6569 | else if (code == POINTER_TYPE) | |
8d08fdba MS |
6570 | r = build_pointer_type (type); |
6571 | else | |
6572 | r = build_reference_type (type); | |
adecb3f4 | 6573 | r = cp_build_qualified_type_real (r, TYPE_QUALS (t), complain); |
79a7c7fa | 6574 | |
a5f1c5f8 NS |
6575 | if (r != error_mark_node) |
6576 | /* Will this ever be needed for TYPE_..._TO values? */ | |
6577 | layout_type (r); | |
6578 | ||
8d08fdba MS |
6579 | return r; |
6580 | } | |
a4443a08 | 6581 | case OFFSET_TYPE: |
0ecfe0b4 | 6582 | { |
4393e105 MM |
6583 | r = tsubst (TYPE_OFFSET_BASETYPE (t), args, complain, in_decl); |
6584 | if (r == error_mark_node || !IS_AGGR_TYPE (r)) | |
6585 | { | |
6586 | /* [temp.deduct] | |
6587 | ||
6588 | Type deduction may fail for any of the following | |
6589 | reasons: | |
6590 | ||
6591 | -- Attempting to create "pointer to member of T" when T | |
6592 | is not a class type. */ | |
6593 | if (complain) | |
6594 | cp_error ("creating pointer to member of non-class type `%T'", | |
6595 | r); | |
6596 | return error_mark_node; | |
6597 | } | |
0ecfe0b4 JM |
6598 | return build_offset_type (r, type); |
6599 | } | |
8d08fdba MS |
6600 | case FUNCTION_TYPE: |
6601 | case METHOD_TYPE: | |
6602 | { | |
c11b6f21 | 6603 | tree fntype; |
4393e105 | 6604 | tree raises; |
8d08fdba | 6605 | |
4393e105 MM |
6606 | fntype = tsubst_function_type (t, args, complain, in_decl); |
6607 | if (fntype == error_mark_node) | |
6608 | return error_mark_node; | |
cabc336a MM |
6609 | |
6610 | /* Substitue the exception specification. */ | |
6611 | raises = TYPE_RAISES_EXCEPTIONS (t); | |
c11b6f21 MS |
6612 | if (raises) |
6613 | { | |
4cc1d462 NS |
6614 | tree list = NULL_TREE; |
6615 | ||
6616 | if (! TREE_VALUE (raises)) | |
6617 | list = raises; | |
6618 | else | |
6619 | for (; raises != NULL_TREE; raises = TREE_CHAIN (raises)) | |
6620 | { | |
6621 | tree spec = TREE_VALUE (raises); | |
6622 | ||
6623 | spec = tsubst (spec, args, complain, in_decl); | |
6624 | if (spec == error_mark_node) | |
6625 | return spec; | |
6626 | list = add_exception_specifier (list, spec, complain); | |
6627 | } | |
6628 | fntype = build_exception_variant (fntype, list); | |
c11b6f21 MS |
6629 | } |
6630 | return fntype; | |
8d08fdba MS |
6631 | } |
6632 | case ARRAY_TYPE: | |
6633 | { | |
4393e105 MM |
6634 | tree domain = tsubst (TYPE_DOMAIN (t), args, complain, in_decl); |
6635 | if (domain == error_mark_node) | |
6636 | return error_mark_node; | |
6637 | ||
6638 | /* As an optimization, we avoid regenerating the array type if | |
6639 | it will obviously be the same as T. */ | |
8d08fdba MS |
6640 | if (type == TREE_TYPE (t) && domain == TYPE_DOMAIN (t)) |
6641 | return t; | |
0ecfe0b4 | 6642 | |
4393e105 MM |
6643 | /* These checks should match the ones in grokdeclarator. |
6644 | ||
6645 | [temp.deduct] | |
6646 | ||
6647 | The deduction may fail for any of the following reasons: | |
6648 | ||
6649 | -- Attempting to create an array with an element type that | |
6650 | is void, a function type, or a reference type. */ | |
6651 | if (TREE_CODE (type) == VOID_TYPE | |
6652 | || TREE_CODE (type) == FUNCTION_TYPE | |
6653 | || TREE_CODE (type) == REFERENCE_TYPE) | |
0ecfe0b4 | 6654 | { |
4393e105 MM |
6655 | if (complain) |
6656 | cp_error ("creating array of `%T'", type); | |
6657 | return error_mark_node; | |
0ecfe0b4 JM |
6658 | } |
6659 | ||
8d08fdba MS |
6660 | r = build_cplus_array_type (type, domain); |
6661 | return r; | |
6662 | } | |
6663 | ||
8d08fdba | 6664 | case PLUS_EXPR: |
5566b478 | 6665 | case MINUS_EXPR: |
4393e105 MM |
6666 | { |
6667 | tree e1 = tsubst (TREE_OPERAND (t, 0), args, complain, | |
6668 | in_decl); | |
6669 | tree e2 = tsubst (TREE_OPERAND (t, 1), args, complain, | |
6670 | in_decl); | |
6671 | ||
6672 | if (e1 == error_mark_node || e2 == error_mark_node) | |
6673 | return error_mark_node; | |
6674 | ||
6675 | return fold (build (TREE_CODE (t), TREE_TYPE (t), e1, e2)); | |
6676 | } | |
8d08fdba MS |
6677 | |
6678 | case NEGATE_EXPR: | |
6679 | case NOP_EXPR: | |
4393e105 MM |
6680 | { |
6681 | tree e = tsubst (TREE_OPERAND (t, 0), args, complain, | |
6682 | in_decl); | |
6683 | if (e == error_mark_node) | |
6684 | return error_mark_node; | |
6685 | ||
6686 | return fold (build (TREE_CODE (t), TREE_TYPE (t), e)); | |
6687 | } | |
8d08fdba | 6688 | |
5566b478 MS |
6689 | case TYPENAME_TYPE: |
6690 | { | |
4393e105 MM |
6691 | tree ctx = tsubst_aggr_type (TYPE_CONTEXT (t), args, complain, |
6692 | in_decl, /*entering_scope=*/1); | |
6693 | tree f = tsubst_copy (TYPENAME_TYPE_FULLNAME (t), args, | |
6694 | complain, in_decl); | |
6695 | ||
6696 | if (ctx == error_mark_node || f == error_mark_node) | |
6697 | return error_mark_node; | |
ae58fa02 | 6698 | |
bf8f3f93 MM |
6699 | if (!IS_AGGR_TYPE (ctx)) |
6700 | { | |
6701 | if (complain) | |
6702 | cp_error ("`%T' is not a class, struct, or union type", | |
6703 | ctx); | |
6704 | return error_mark_node; | |
6705 | } | |
6706 | else if (!uses_template_parms (ctx) && !TYPE_BEING_DEFINED (ctx)) | |
6707 | { | |
6708 | /* Normally, make_typename_type does not require that the CTX | |
6709 | have complete type in order to allow things like: | |
ae58fa02 | 6710 | |
bf8f3f93 | 6711 | template <class T> struct S { typename S<T>::X Y; }; |
ae58fa02 | 6712 | |
bf8f3f93 MM |
6713 | But, such constructs have already been resolved by this |
6714 | point, so here CTX really should have complete type, unless | |
6715 | it's a partial instantiation. */ | |
4393e105 | 6716 | ctx = complete_type (ctx); |
d0f062fb | 6717 | if (!COMPLETE_TYPE_P (ctx)) |
4393e105 MM |
6718 | { |
6719 | if (complain) | |
6720 | incomplete_type_error (NULL_TREE, ctx); | |
6721 | return error_mark_node; | |
6722 | } | |
6723 | } | |
ae58fa02 | 6724 | |
3baa501d | 6725 | f = make_typename_type (ctx, f, complain); |
f0bcd168 MM |
6726 | if (f == error_mark_node) |
6727 | return f; | |
adecb3f4 MM |
6728 | return cp_build_qualified_type_real (f, |
6729 | CP_TYPE_QUALS (f) | |
6730 | | CP_TYPE_QUALS (t), | |
6731 | complain); | |
5566b478 MS |
6732 | } |
6733 | ||
6734 | case INDIRECT_REF: | |
4393e105 MM |
6735 | { |
6736 | tree e = tsubst (TREE_OPERAND (t, 0), args, complain, | |
6737 | in_decl); | |
6738 | if (e == error_mark_node) | |
6739 | return error_mark_node; | |
6740 | return make_pointer_declarator (type, e); | |
6741 | } | |
6742 | ||
5566b478 | 6743 | case ADDR_EXPR: |
4393e105 MM |
6744 | { |
6745 | tree e = tsubst (TREE_OPERAND (t, 0), args, complain, | |
6746 | in_decl); | |
6747 | if (e == error_mark_node) | |
6748 | return error_mark_node; | |
6749 | return make_reference_declarator (type, e); | |
6750 | } | |
5566b478 MS |
6751 | |
6752 | case ARRAY_REF: | |
4393e105 MM |
6753 | { |
6754 | tree e1 = tsubst (TREE_OPERAND (t, 0), args, complain, | |
6755 | in_decl); | |
6fb2c05a JM |
6756 | tree e2 = tsubst_expr (TREE_OPERAND (t, 1), args, complain, |
6757 | in_decl); | |
4393e105 MM |
6758 | if (e1 == error_mark_node || e2 == error_mark_node) |
6759 | return error_mark_node; | |
6760 | ||
718b8ea5 | 6761 | return build_nt (ARRAY_REF, e1, e2, tsubst_expr); |
4393e105 | 6762 | } |
5566b478 MS |
6763 | |
6764 | case CALL_EXPR: | |
4393e105 MM |
6765 | { |
6766 | tree e1 = tsubst (TREE_OPERAND (t, 0), args, complain, | |
6767 | in_decl); | |
43f887f9 MM |
6768 | tree e2 = (tsubst_call_declarator_parms |
6769 | (CALL_DECLARATOR_PARMS (t), args, complain, in_decl)); | |
6770 | tree e3 = tsubst (CALL_DECLARATOR_EXCEPTION_SPEC (t), args, | |
6771 | complain, in_decl); | |
4393e105 MM |
6772 | |
6773 | if (e1 == error_mark_node || e2 == error_mark_node | |
6774 | || e3 == error_mark_node) | |
6775 | return error_mark_node; | |
6776 | ||
43f887f9 | 6777 | return make_call_declarator (e1, e2, CALL_DECLARATOR_QUALS (t), e3); |
4393e105 | 6778 | } |
5566b478 | 6779 | |
fc378698 | 6780 | case SCOPE_REF: |
4393e105 MM |
6781 | { |
6782 | tree e1 = tsubst (TREE_OPERAND (t, 0), args, complain, | |
6783 | in_decl); | |
6784 | tree e2 = tsubst (TREE_OPERAND (t, 1), args, complain, in_decl); | |
6785 | if (e1 == error_mark_node || e2 == error_mark_node) | |
6786 | return error_mark_node; | |
6787 | ||
718b8ea5 | 6788 | return build_nt (TREE_CODE (t), e1, e2); |
4393e105 | 6789 | } |
fc378698 | 6790 | |
b894fc05 | 6791 | case TYPEOF_TYPE: |
4393e105 MM |
6792 | { |
6793 | tree e1 = tsubst_expr (TYPE_FIELDS (t), args, complain, | |
6794 | in_decl); | |
6795 | if (e1 == error_mark_node) | |
6796 | return error_mark_node; | |
6797 | ||
6798 | return TREE_TYPE (e1); | |
6799 | } | |
b894fc05 | 6800 | |
8d08fdba | 6801 | default: |
5566b478 | 6802 | sorry ("use of `%s' in template", |
8d08fdba MS |
6803 | tree_code_name [(int) TREE_CODE (t)]); |
6804 | return error_mark_node; | |
6805 | } | |
6806 | } | |
6807 | ||
00d3396f JM |
6808 | /* Like tsubst, but deals with expressions. This function just replaces |
6809 | template parms; to finish processing the resultant expression, use | |
6810 | tsubst_expr. */ | |
6811 | ||
5566b478 | 6812 | tree |
4393e105 | 6813 | tsubst_copy (t, args, complain, in_decl) |
98c1c668 | 6814 | tree t, args; |
4393e105 | 6815 | int complain; |
5566b478 MS |
6816 | tree in_decl; |
6817 | { | |
6818 | enum tree_code code; | |
8452b1d3 | 6819 | tree r; |
8d08fdba | 6820 | |
5566b478 MS |
6821 | if (t == NULL_TREE || t == error_mark_node) |
6822 | return t; | |
6823 | ||
6824 | code = TREE_CODE (t); | |
b7484fbe | 6825 | |
5566b478 MS |
6826 | switch (code) |
6827 | { | |
6828 | case PARM_DECL: | |
a759e627 | 6829 | return do_identifier (DECL_NAME (t), 0, NULL_TREE); |
5566b478 MS |
6830 | |
6831 | case CONST_DECL: | |
ed44da02 MM |
6832 | { |
6833 | tree enum_type; | |
6834 | tree v; | |
6835 | ||
6836 | if (!DECL_CONTEXT (t)) | |
6837 | /* This is a global enumeration constant. */ | |
6838 | return t; | |
6839 | ||
6840 | /* Unfortunately, we cannot just call lookup_name here. | |
9188c363 MM |
6841 | Consider: |
6842 | ||
6843 | template <int I> int f() { | |
6844 | enum E { a = I }; | |
6845 | struct S { void g() { E e = a; } }; | |
6846 | }; | |
6847 | ||
6848 | When we instantiate f<7>::S::g(), say, lookup_name is not | |
6849 | clever enough to find f<7>::a. */ | |
ed44da02 | 6850 | enum_type |
4393e105 | 6851 | = tsubst_aggr_type (TREE_TYPE (t), args, complain, in_decl, |
ed44da02 MM |
6852 | /*entering_scope=*/0); |
6853 | ||
6854 | for (v = TYPE_VALUES (enum_type); | |
6855 | v != NULL_TREE; | |
6856 | v = TREE_CHAIN (v)) | |
6857 | if (TREE_PURPOSE (v) == DECL_NAME (t)) | |
6858 | return TREE_VALUE (v); | |
6859 | ||
6860 | /* We didn't find the name. That should never happen; if | |
6861 | name-lookup found it during preliminary parsing, we | |
6862 | should find it again here during instantiation. */ | |
6863 | my_friendly_abort (0); | |
6864 | } | |
db04386f | 6865 | return t; |
ed44da02 | 6866 | |
5566b478 MS |
6867 | case FIELD_DECL: |
6868 | if (DECL_CONTEXT (t)) | |
6869 | { | |
0978790f | 6870 | tree ctx; |
0978790f | 6871 | |
4393e105 | 6872 | ctx = tsubst_aggr_type (DECL_CONTEXT (t), args, complain, in_decl, |
36a117a5 | 6873 | /*entering_scope=*/1); |
0978790f | 6874 | if (ctx != DECL_CONTEXT (t)) |
5566b478 MS |
6875 | return lookup_field (ctx, DECL_NAME (t), 0, 0); |
6876 | } | |
6877 | return t; | |
6878 | ||
6879 | case VAR_DECL: | |
6880 | case FUNCTION_DECL: | |
6881 | if (DECL_LANG_SPECIFIC (t) && DECL_TEMPLATE_INFO (t)) | |
4393e105 | 6882 | t = tsubst (t, args, complain, in_decl); |
5566b478 MS |
6883 | mark_used (t); |
6884 | return t; | |
6885 | ||
98c1c668 JM |
6886 | case TEMPLATE_DECL: |
6887 | if (is_member_template (t)) | |
4393e105 | 6888 | return tsubst (t, args, complain, in_decl); |
98c1c668 JM |
6889 | else |
6890 | return t; | |
6891 | ||
672476cb MM |
6892 | case LOOKUP_EXPR: |
6893 | { | |
9da99f7d | 6894 | /* We must tsubst into a LOOKUP_EXPR in case the names to |
672476cb MM |
6895 | which it refers is a conversion operator; in that case the |
6896 | name will change. We avoid making unnecessary copies, | |
6897 | however. */ | |
6898 | ||
4393e105 | 6899 | tree id = tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl); |
672476cb MM |
6900 | |
6901 | if (id != TREE_OPERAND (t, 0)) | |
6902 | { | |
8452b1d3 | 6903 | r = build_nt (LOOKUP_EXPR, id); |
672476cb MM |
6904 | LOOKUP_EXPR_GLOBAL (r) = LOOKUP_EXPR_GLOBAL (t); |
6905 | t = r; | |
6906 | } | |
6907 | ||
6908 | return t; | |
6909 | } | |
6910 | ||
5566b478 MS |
6911 | case CAST_EXPR: |
6912 | case REINTERPRET_CAST_EXPR: | |
e92cc029 MS |
6913 | case CONST_CAST_EXPR: |
6914 | case STATIC_CAST_EXPR: | |
6915 | case DYNAMIC_CAST_EXPR: | |
51924768 | 6916 | case NOP_EXPR: |
5566b478 | 6917 | return build1 |
4393e105 MM |
6918 | (code, tsubst (TREE_TYPE (t), args, complain, in_decl), |
6919 | tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl)); | |
5566b478 MS |
6920 | |
6921 | case INDIRECT_REF: | |
5566b478 MS |
6922 | case NEGATE_EXPR: |
6923 | case TRUTH_NOT_EXPR: | |
b87692e5 | 6924 | case BIT_NOT_EXPR: |
5566b478 MS |
6925 | case ADDR_EXPR: |
6926 | case CONVERT_EXPR: /* Unary + */ | |
6927 | case SIZEOF_EXPR: | |
abff8e06 | 6928 | case ALIGNOF_EXPR: |
5566b478 | 6929 | case ARROW_EXPR: |
fc378698 | 6930 | case THROW_EXPR: |
5156628f | 6931 | case TYPEID_EXPR: |
f5733617 SS |
6932 | case REALPART_EXPR: |
6933 | case IMAGPART_EXPR: | |
5566b478 | 6934 | return build1 |
6a629cac | 6935 | (code, tsubst (TREE_TYPE (t), args, complain, in_decl), |
4393e105 | 6936 | tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl)); |
5566b478 MS |
6937 | |
6938 | case PLUS_EXPR: | |
6939 | case MINUS_EXPR: | |
6940 | case MULT_EXPR: | |
6941 | case TRUNC_DIV_EXPR: | |
6942 | case CEIL_DIV_EXPR: | |
6943 | case FLOOR_DIV_EXPR: | |
6944 | case ROUND_DIV_EXPR: | |
6945 | case EXACT_DIV_EXPR: | |
6946 | case BIT_AND_EXPR: | |
6947 | case BIT_ANDTC_EXPR: | |
6948 | case BIT_IOR_EXPR: | |
6949 | case BIT_XOR_EXPR: | |
6950 | case TRUNC_MOD_EXPR: | |
6951 | case FLOOR_MOD_EXPR: | |
6952 | case TRUTH_ANDIF_EXPR: | |
6953 | case TRUTH_ORIF_EXPR: | |
6954 | case TRUTH_AND_EXPR: | |
6955 | case TRUTH_OR_EXPR: | |
6956 | case RSHIFT_EXPR: | |
6957 | case LSHIFT_EXPR: | |
6958 | case RROTATE_EXPR: | |
6959 | case LROTATE_EXPR: | |
6960 | case EQ_EXPR: | |
6961 | case NE_EXPR: | |
6962 | case MAX_EXPR: | |
6963 | case MIN_EXPR: | |
6964 | case LE_EXPR: | |
6965 | case GE_EXPR: | |
6966 | case LT_EXPR: | |
6967 | case GT_EXPR: | |
6968 | case COMPONENT_REF: | |
6969 | case ARRAY_REF: | |
6970 | case COMPOUND_EXPR: | |
6971 | case SCOPE_REF: | |
6972 | case DOTSTAR_EXPR: | |
6973 | case MEMBER_REF: | |
519c9806 MM |
6974 | case PREDECREMENT_EXPR: |
6975 | case PREINCREMENT_EXPR: | |
6976 | case POSTDECREMENT_EXPR: | |
6977 | case POSTINCREMENT_EXPR: | |
5566b478 | 6978 | return build_nt |
4393e105 MM |
6979 | (code, tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl), |
6980 | tsubst_copy (TREE_OPERAND (t, 1), args, complain, in_decl)); | |
5566b478 MS |
6981 | |
6982 | case CALL_EXPR: | |
6983 | { | |
6984 | tree fn = TREE_OPERAND (t, 0); | |
f84b4be9 | 6985 | if (is_overloaded_fn (fn)) |
4393e105 | 6986 | fn = tsubst_copy (get_first_fn (fn), args, complain, in_decl); |
5566b478 | 6987 | else |
f84b4be9 | 6988 | /* Sometimes FN is a LOOKUP_EXPR. */ |
4393e105 | 6989 | fn = tsubst_copy (fn, args, complain, in_decl); |
5566b478 | 6990 | return build_nt |
4393e105 MM |
6991 | (code, fn, tsubst_copy (TREE_OPERAND (t, 1), args, complain, |
6992 | in_decl), | |
5566b478 MS |
6993 | NULL_TREE); |
6994 | } | |
6995 | ||
6996 | case METHOD_CALL_EXPR: | |
6997 | { | |
6998 | tree name = TREE_OPERAND (t, 0); | |
6999 | if (TREE_CODE (name) == BIT_NOT_EXPR) | |
7000 | { | |
4393e105 MM |
7001 | name = tsubst_copy (TREE_OPERAND (name, 0), args, |
7002 | complain, in_decl); | |
7bae46f4 | 7003 | name = build1 (BIT_NOT_EXPR, NULL_TREE, name); |
5566b478 MS |
7004 | } |
7005 | else if (TREE_CODE (name) == SCOPE_REF | |
7006 | && TREE_CODE (TREE_OPERAND (name, 1)) == BIT_NOT_EXPR) | |
7007 | { | |
4393e105 MM |
7008 | tree base = tsubst_copy (TREE_OPERAND (name, 0), args, |
7009 | complain, in_decl); | |
5566b478 | 7010 | name = TREE_OPERAND (name, 1); |
4393e105 MM |
7011 | name = tsubst_copy (TREE_OPERAND (name, 0), args, |
7012 | complain, in_decl); | |
11686454 | 7013 | name = build1 (BIT_NOT_EXPR, NULL_TREE, name); |
5566b478 MS |
7014 | name = build_nt (SCOPE_REF, base, name); |
7015 | } | |
7016 | else | |
4393e105 | 7017 | name = tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl); |
5566b478 | 7018 | return build_nt |
4393e105 MM |
7019 | (code, name, tsubst_copy (TREE_OPERAND (t, 1), args, |
7020 | complain, in_decl), | |
7021 | tsubst_copy (TREE_OPERAND (t, 2), args, complain, in_decl), | |
5566b478 MS |
7022 | NULL_TREE); |
7023 | } | |
7024 | ||
558475f0 MM |
7025 | case STMT_EXPR: |
7026 | /* This processing should really occur in tsubst_expr, However, | |
7027 | tsubst_expr does not recurse into expressions, since it | |
7028 | assumes that there aren't any statements inside them. | |
7029 | Instead, it simply calls build_expr_from_tree. So, we need | |
7030 | to expand the STMT_EXPR here. */ | |
7031 | if (!processing_template_decl) | |
7032 | { | |
b5ac18ea | 7033 | tree stmt_expr = begin_stmt_expr (); |
447cfcb9 MM |
7034 | tsubst_expr (STMT_EXPR_STMT (t), args, |
7035 | complain, in_decl); | |
b5ac18ea | 7036 | return finish_stmt_expr (stmt_expr); |
558475f0 | 7037 | } |
9d9169de MM |
7038 | |
7039 | return t; | |
558475f0 | 7040 | |
5566b478 MS |
7041 | case COND_EXPR: |
7042 | case MODOP_EXPR: | |
40242ccf | 7043 | case PSEUDO_DTOR_EXPR: |
67da3287 | 7044 | { |
8452b1d3 | 7045 | r = build_nt |
4393e105 MM |
7046 | (code, tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl), |
7047 | tsubst_copy (TREE_OPERAND (t, 1), args, complain, in_decl), | |
7048 | tsubst_copy (TREE_OPERAND (t, 2), args, complain, in_decl)); | |
67da3287 MM |
7049 | return r; |
7050 | } | |
5566b478 MS |
7051 | |
7052 | case NEW_EXPR: | |
7053 | { | |
8452b1d3 | 7054 | r = build_nt |
4393e105 MM |
7055 | (code, tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl), |
7056 | tsubst_copy (TREE_OPERAND (t, 1), args, complain, in_decl), | |
7057 | tsubst_copy (TREE_OPERAND (t, 2), args, complain, in_decl)); | |
5566b478 MS |
7058 | NEW_EXPR_USE_GLOBAL (r) = NEW_EXPR_USE_GLOBAL (t); |
7059 | return r; | |
7060 | } | |
7061 | ||
7062 | case DELETE_EXPR: | |
7063 | { | |
8452b1d3 | 7064 | r = build_nt |
4393e105 MM |
7065 | (code, tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl), |
7066 | tsubst_copy (TREE_OPERAND (t, 1), args, complain, in_decl)); | |
5566b478 MS |
7067 | DELETE_EXPR_USE_GLOBAL (r) = DELETE_EXPR_USE_GLOBAL (t); |
7068 | DELETE_EXPR_USE_VEC (r) = DELETE_EXPR_USE_VEC (t); | |
7069 | return r; | |
7070 | } | |
7071 | ||
386b8a85 JM |
7072 | case TEMPLATE_ID_EXPR: |
7073 | { | |
00d3396f | 7074 | /* Substituted template arguments */ |
4393e105 MM |
7075 | tree targs = tsubst_copy (TREE_OPERAND (t, 1), args, complain, |
7076 | in_decl); | |
856216bb MM |
7077 | |
7078 | if (targs && TREE_CODE (targs) == TREE_LIST) | |
7079 | { | |
7080 | tree chain; | |
7081 | for (chain = targs; chain; chain = TREE_CHAIN (chain)) | |
7082 | TREE_VALUE (chain) = maybe_fold_nontype_arg (TREE_VALUE (chain)); | |
7083 | } | |
7084 | else if (targs) | |
7085 | { | |
7086 | int i; | |
7087 | for (i = 0; i < TREE_VEC_LENGTH (targs); ++i) | |
7088 | TREE_VEC_ELT (targs, i) | |
7089 | = maybe_fold_nontype_arg (TREE_VEC_ELT (targs, i)); | |
7090 | } | |
00d3396f JM |
7091 | |
7092 | return lookup_template_function | |
4393e105 | 7093 | (tsubst_copy (TREE_OPERAND (t, 0), args, complain, in_decl), targs); |
386b8a85 JM |
7094 | } |
7095 | ||
5566b478 MS |
7096 | case TREE_LIST: |
7097 | { | |
7098 | tree purpose, value, chain; | |
7099 | ||
7100 | if (t == void_list_node) | |
7101 | return t; | |
7102 | ||
7103 | purpose = TREE_PURPOSE (t); | |
7104 | if (purpose) | |
4393e105 | 7105 | purpose = tsubst_copy (purpose, args, complain, in_decl); |
5566b478 MS |
7106 | value = TREE_VALUE (t); |
7107 | if (value) | |
4393e105 | 7108 | value = tsubst_copy (value, args, complain, in_decl); |
5566b478 MS |
7109 | chain = TREE_CHAIN (t); |
7110 | if (chain && chain != void_type_node) | |
4393e105 | 7111 | chain = tsubst_copy (chain, args, complain, in_decl); |
5566b478 MS |
7112 | if (purpose == TREE_PURPOSE (t) |
7113 | && value == TREE_VALUE (t) | |
7114 | && chain == TREE_CHAIN (t)) | |
7115 | return t; | |
7116 | return tree_cons (purpose, value, chain); | |
7117 | } | |
7118 | ||
7119 | case RECORD_TYPE: | |
7120 | case UNION_TYPE: | |
7121 | case ENUMERAL_TYPE: | |
7122 | case INTEGER_TYPE: | |
7123 | case TEMPLATE_TYPE_PARM: | |
73b0fce8 | 7124 | case TEMPLATE_TEMPLATE_PARM: |
a1281f45 | 7125 | case BOUND_TEMPLATE_TEMPLATE_PARM: |
f84b4be9 | 7126 | case TEMPLATE_PARM_INDEX: |
5566b478 MS |
7127 | case POINTER_TYPE: |
7128 | case REFERENCE_TYPE: | |
7129 | case OFFSET_TYPE: | |
7130 | case FUNCTION_TYPE: | |
7131 | case METHOD_TYPE: | |
7132 | case ARRAY_TYPE: | |
7133 | case TYPENAME_TYPE: | |
f84b4be9 | 7134 | case TYPE_DECL: |
4393e105 | 7135 | return tsubst (t, args, complain, in_decl); |
5566b478 | 7136 | |
e92cc029 | 7137 | case IDENTIFIER_NODE: |
421844e7 | 7138 | if (IDENTIFIER_TYPENAME_P (t)) |
1f6e1acc AS |
7139 | { |
7140 | tree new_type = tsubst (TREE_TYPE (t), args, complain, in_decl); | |
1f84ec23 | 7141 | return mangle_conv_op_name_for_type (new_type); |
1f6e1acc | 7142 | } |
e92cc029 MS |
7143 | else |
7144 | return t; | |
7145 | ||
5156628f | 7146 | case CONSTRUCTOR: |
8452b1d3 JM |
7147 | { |
7148 | r = build | |
4393e105 MM |
7149 | (CONSTRUCTOR, tsubst (TREE_TYPE (t), args, complain, in_decl), |
7150 | NULL_TREE, tsubst_copy (CONSTRUCTOR_ELTS (t), args, | |
7151 | complain, in_decl)); | |
8452b1d3 JM |
7152 | TREE_HAS_CONSTRUCTOR (r) = TREE_HAS_CONSTRUCTOR (t); |
7153 | return r; | |
7154 | } | |
5156628f | 7155 | |
371534a9 | 7156 | case VA_ARG_EXPR: |
ea333e1c | 7157 | return build_x_va_arg (tsubst_copy (TREE_OPERAND (t, 0), args, complain, |
371534a9 MM |
7158 | in_decl), |
7159 | tsubst (TREE_TYPE (t), args, complain, in_decl)); | |
f9817201 | 7160 | |
5566b478 MS |
7161 | default: |
7162 | return t; | |
7163 | } | |
7164 | } | |
7165 | ||
558475f0 | 7166 | /* Like tsubst_copy, but also does semantic processing. */ |
00d3396f | 7167 | |
5566b478 | 7168 | tree |
4393e105 | 7169 | tsubst_expr (t, args, complain, in_decl) |
98c1c668 | 7170 | tree t, args; |
4393e105 | 7171 | int complain; |
5566b478 MS |
7172 | tree in_decl; |
7173 | { | |
fd10dd09 | 7174 | tree stmt, tmp; |
558475f0 | 7175 | |
5566b478 MS |
7176 | if (t == NULL_TREE || t == error_mark_node) |
7177 | return t; | |
7178 | ||
5156628f | 7179 | if (processing_template_decl) |
4393e105 | 7180 | return tsubst_copy (t, args, complain, in_decl); |
5566b478 | 7181 | |
fd10dd09 JM |
7182 | if (!statement_code_p (TREE_CODE (t))) |
7183 | return build_expr_from_tree (tsubst_copy (t, args, complain, in_decl)); | |
7184 | ||
5566b478 | 7185 | switch (TREE_CODE (t)) |
8d08fdba | 7186 | { |
558475f0 | 7187 | case RETURN_INIT: |
a7e4cfa0 | 7188 | prep_stmt (t); |
558475f0 MM |
7189 | finish_named_return_value |
7190 | (TREE_OPERAND (t, 0), | |
7191 | tsubst_expr (TREE_OPERAND (t, 1), args, /*complain=*/1, in_decl)); | |
558475f0 MM |
7192 | break; |
7193 | ||
7194 | case CTOR_INITIALIZER: | |
fd74ca0b MM |
7195 | { |
7196 | tree member_init_list; | |
7197 | tree base_init_list; | |
7198 | ||
7199 | prep_stmt (t); | |
7200 | member_init_list | |
7201 | = tsubst_initializer_list (TREE_OPERAND (t, 0), args); | |
7202 | base_init_list | |
7203 | = tsubst_initializer_list (TREE_OPERAND (t, 1), args); | |
7204 | setup_vtbl_ptr (member_init_list, base_init_list); | |
fd74ca0b MM |
7205 | break; |
7206 | } | |
558475f0 | 7207 | |
5566b478 | 7208 | case RETURN_STMT: |
a7e4cfa0 | 7209 | prep_stmt (t); |
ad321293 | 7210 | finish_return_stmt (tsubst_expr (RETURN_EXPR (t), |
4393e105 | 7211 | args, complain, in_decl)); |
5566b478 MS |
7212 | break; |
7213 | ||
7214 | case EXPR_STMT: | |
a7e4cfa0 | 7215 | prep_stmt (t); |
ad321293 | 7216 | finish_expr_stmt (tsubst_expr (EXPR_STMT_EXPR (t), |
4393e105 | 7217 | args, complain, in_decl)); |
5566b478 MS |
7218 | break; |
7219 | ||
9da99f7d NS |
7220 | case USING_STMT: |
7221 | prep_stmt (t); | |
7222 | do_using_directive (tsubst_expr (USING_STMT_NAMESPACE (t), | |
7223 | args, complain, in_decl)); | |
7224 | break; | |
7225 | ||
5566b478 MS |
7226 | case DECL_STMT: |
7227 | { | |
e0942dcd MM |
7228 | tree decl; |
7229 | tree init; | |
5566b478 | 7230 | |
a7e4cfa0 | 7231 | prep_stmt (t); |
e0942dcd | 7232 | decl = DECL_STMT_DECL (t); |
acef433b MM |
7233 | if (TREE_CODE (decl) == LABEL_DECL) |
7234 | finish_label_decl (DECL_NAME (decl)); | |
fbfe8c9e NS |
7235 | else if (TREE_CODE (decl) == USING_DECL) |
7236 | { | |
7237 | tree scope = DECL_INITIAL (decl); | |
7238 | tree name = DECL_NAME (decl); | |
7239 | ||
7240 | scope = tsubst_expr (scope, args, complain, in_decl); | |
7241 | do_local_using_decl (build_nt (SCOPE_REF, scope, name)); | |
7242 | } | |
acef433b MM |
7243 | else |
7244 | { | |
7245 | init = DECL_INITIAL (decl); | |
7246 | decl = tsubst (decl, args, complain, in_decl); | |
0ba8a114 NS |
7247 | if (DECL_PRETTY_FUNCTION_P (decl)) |
7248 | init = DECL_INITIAL (decl); | |
7249 | else | |
7250 | init = tsubst_expr (init, args, complain, in_decl); | |
ce2e5191 NS |
7251 | if (decl != error_mark_node) |
7252 | { | |
35728a80 NS |
7253 | if (TREE_CODE (decl) != TYPE_DECL) |
7254 | /* Make sure the type is instantiated now. */ | |
8b25cab9 | 7255 | complete_type (TREE_TYPE (decl)); |
ce2e5191 NS |
7256 | if (init) |
7257 | DECL_INITIAL (decl) = error_mark_node; | |
7258 | /* By marking the declaration as instantiated, we avoid | |
7259 | trying to instantiate it. Since instantiate_decl can't | |
7260 | handle local variables, and since we've already done | |
7261 | all that needs to be done, that's the right thing to | |
7262 | do. */ | |
7263 | if (TREE_CODE (decl) == VAR_DECL) | |
7264 | DECL_TEMPLATE_INSTANTIATED (decl) = 1; | |
7265 | maybe_push_decl (decl); | |
7266 | cp_finish_decl (decl, init, NULL_TREE, 0); | |
7267 | } | |
acef433b | 7268 | } |
fd10dd09 JM |
7269 | |
7270 | /* A DECL_STMT can also be used as an expression, in the condition | |
7271 | clause of a if/for/while construct. If we aren't followed by | |
7272 | another statement, return our decl. */ | |
7273 | if (TREE_CHAIN (t) == NULL_TREE) | |
7274 | return decl; | |
5566b478 | 7275 | } |
fd10dd09 | 7276 | break; |
8d08fdba | 7277 | |
5566b478 MS |
7278 | case FOR_STMT: |
7279 | { | |
a7e4cfa0 | 7280 | prep_stmt (t); |
5566b478 | 7281 | |
558475f0 | 7282 | stmt = begin_for_stmt (); |
fd10dd09 | 7283 | tsubst_expr (FOR_INIT_STMT (t), args, complain, in_decl); |
558475f0 | 7284 | finish_for_init_stmt (stmt); |
ad321293 | 7285 | finish_for_cond (tsubst_expr (FOR_COND (t), args, |
4393e105 | 7286 | complain, in_decl), |
558475f0 | 7287 | stmt); |
4393e105 | 7288 | tmp = tsubst_expr (FOR_EXPR (t), args, complain, in_decl); |
558475f0 | 7289 | finish_for_expr (tmp, stmt); |
4393e105 | 7290 | tsubst_expr (FOR_BODY (t), args, complain, in_decl); |
35b1567d | 7291 | finish_for_stmt (stmt); |
5566b478 MS |
7292 | } |
7293 | break; | |
8d08fdba | 7294 | |
5566b478 MS |
7295 | case WHILE_STMT: |
7296 | { | |
a7e4cfa0 | 7297 | prep_stmt (t); |
558475f0 | 7298 | stmt = begin_while_stmt (); |
ad321293 | 7299 | finish_while_stmt_cond (tsubst_expr (WHILE_COND (t), |
4393e105 | 7300 | args, complain, in_decl), |
558475f0 | 7301 | stmt); |
4393e105 | 7302 | tsubst_expr (WHILE_BODY (t), args, complain, in_decl); |
558475f0 | 7303 | finish_while_stmt (stmt); |
5566b478 MS |
7304 | } |
7305 | break; | |
8d08fdba | 7306 | |
5566b478 MS |
7307 | case DO_STMT: |
7308 | { | |
a7e4cfa0 | 7309 | prep_stmt (t); |
558475f0 | 7310 | stmt = begin_do_stmt (); |
4393e105 | 7311 | tsubst_expr (DO_BODY (t), args, complain, in_decl); |
558475f0 | 7312 | finish_do_body (stmt); |
ad321293 | 7313 | finish_do_stmt (tsubst_expr (DO_COND (t), args, |
4393e105 | 7314 | complain, in_decl), |
558475f0 | 7315 | stmt); |
5566b478 MS |
7316 | } |
7317 | break; | |
a0a33927 | 7318 | |
5566b478 | 7319 | case IF_STMT: |
8d08fdba | 7320 | { |
a7e4cfa0 | 7321 | prep_stmt (t); |
558475f0 | 7322 | stmt = begin_if_stmt (); |
ad321293 | 7323 | finish_if_stmt_cond (tsubst_expr (IF_COND (t), |
4393e105 | 7324 | args, complain, in_decl), |
558475f0 | 7325 | stmt); |
db5ae43f | 7326 | |
ad321293 | 7327 | if (tmp = THEN_CLAUSE (t), tmp) |
db5ae43f | 7328 | { |
4393e105 | 7329 | tsubst_expr (tmp, args, complain, in_decl); |
558475f0 | 7330 | finish_then_clause (stmt); |
db5ae43f MS |
7331 | } |
7332 | ||
ad321293 MM |
7333 | if (tmp = ELSE_CLAUSE (t), tmp) |
7334 | { | |
7335 | begin_else_clause (); | |
4393e105 | 7336 | tsubst_expr (tmp, args, complain, in_decl); |
558475f0 | 7337 | finish_else_clause (stmt); |
ad321293 | 7338 | } |
8d08fdba | 7339 | |
ad321293 | 7340 | finish_if_stmt (); |
8d08fdba | 7341 | } |
5566b478 | 7342 | break; |
8d08fdba | 7343 | |
5566b478 MS |
7344 | case COMPOUND_STMT: |
7345 | { | |
a7e4cfa0 | 7346 | prep_stmt (t); |
558475f0 | 7347 | stmt = begin_compound_stmt (COMPOUND_STMT_NO_SCOPE (t)); |
fd10dd09 JM |
7348 | tsubst_expr (COMPOUND_BODY (t), args, complain, in_decl); |
7349 | finish_compound_stmt (COMPOUND_STMT_NO_SCOPE (t), stmt); | |
5566b478 MS |
7350 | } |
7351 | break; | |
8d08fdba | 7352 | |
5566b478 | 7353 | case BREAK_STMT: |
a7e4cfa0 | 7354 | prep_stmt (t); |
ad321293 | 7355 | finish_break_stmt (); |
5566b478 | 7356 | break; |
8d08fdba | 7357 | |
6467930b | 7358 | case CONTINUE_STMT: |
a7e4cfa0 | 7359 | prep_stmt (t); |
ad321293 | 7360 | finish_continue_stmt (); |
6467930b MS |
7361 | break; |
7362 | ||
5566b478 MS |
7363 | case SWITCH_STMT: |
7364 | { | |
558475f0 | 7365 | tree val; |
5566b478 | 7366 | |
a7e4cfa0 | 7367 | prep_stmt (t); |
527f0080 | 7368 | stmt = begin_switch_stmt (); |
4393e105 | 7369 | val = tsubst_expr (SWITCH_COND (t), args, complain, in_decl); |
527f0080 | 7370 | finish_switch_cond (val, stmt); |
558475f0 | 7371 | tsubst_expr (SWITCH_BODY (t), args, complain, in_decl); |
35b1567d | 7372 | finish_switch_stmt (stmt); |
5566b478 MS |
7373 | } |
7374 | break; | |
7375 | ||
7376 | case CASE_LABEL: | |
a7e4cfa0 | 7377 | prep_stmt (t); |
4393e105 | 7378 | finish_case_label (tsubst_expr (CASE_LOW (t), args, complain, in_decl), |
56cb9733 MM |
7379 | tsubst_expr (CASE_HIGH (t), args, complain, |
7380 | in_decl)); | |
5566b478 MS |
7381 | break; |
7382 | ||
acef433b MM |
7383 | case LABEL_STMT: |
7384 | lineno = STMT_LINENO (t); | |
7385 | finish_label_stmt (DECL_NAME (LABEL_STMT_LABEL (t))); | |
5566b478 MS |
7386 | break; |
7387 | ||
7388 | case GOTO_STMT: | |
a7e4cfa0 | 7389 | prep_stmt (t); |
fd10dd09 JM |
7390 | tmp = GOTO_DESTINATION (t); |
7391 | if (TREE_CODE (tmp) != LABEL_DECL) | |
aa09da44 MM |
7392 | /* Computed goto's must be tsubst'd into. On the other hand, |
7393 | non-computed gotos must not be; the identifier in question | |
7394 | will have no binding. */ | |
fd10dd09 | 7395 | tmp = tsubst_expr (tmp, args, complain, in_decl); |
3fa56191 | 7396 | else |
fd10dd09 JM |
7397 | tmp = DECL_NAME (tmp); |
7398 | finish_goto_stmt (tmp); | |
ad321293 MM |
7399 | break; |
7400 | ||
7401 | case ASM_STMT: | |
a7e4cfa0 | 7402 | prep_stmt (t); |
3ebc5c52 | 7403 | finish_asm_stmt (ASM_CV_QUAL (t), |
4393e105 MM |
7404 | tsubst_expr (ASM_STRING (t), args, complain, in_decl), |
7405 | tsubst_expr (ASM_OUTPUTS (t), args, complain, in_decl), | |
7406 | tsubst_expr (ASM_INPUTS (t), args, complain, in_decl), | |
7407 | tsubst_expr (ASM_CLOBBERS (t), args, complain, | |
7408 | in_decl)); | |
5566b478 | 7409 | break; |
faf5394a MS |
7410 | |
7411 | case TRY_BLOCK: | |
a7e4cfa0 | 7412 | prep_stmt (t); |
f1dedc31 | 7413 | if (CLEANUP_P (t)) |
62409b39 | 7414 | { |
57b52417 | 7415 | stmt = begin_try_block (); |
62409b39 MM |
7416 | tsubst_expr (TRY_STMTS (t), args, complain, in_decl); |
7417 | finish_cleanup_try_block (stmt); | |
7418 | finish_cleanup (tsubst_expr (TRY_HANDLERS (t), args, | |
7419 | complain, in_decl), | |
7420 | stmt); | |
7421 | } | |
f1dedc31 MM |
7422 | else |
7423 | { | |
62409b39 MM |
7424 | if (FN_TRY_BLOCK_P (t)) |
7425 | stmt = begin_function_try_block (); | |
7426 | else | |
7427 | stmt = begin_try_block (); | |
7428 | ||
7429 | tsubst_expr (TRY_STMTS (t), args, complain, in_decl); | |
7430 | ||
7431 | if (FN_TRY_BLOCK_P (t)) | |
7432 | finish_function_try_block (stmt); | |
7433 | else | |
7434 | finish_try_block (stmt); | |
7435 | ||
fd10dd09 | 7436 | tsubst_expr (TRY_HANDLERS (t), args, complain, in_decl); |
84df082b MM |
7437 | if (FN_TRY_BLOCK_P (t)) |
7438 | finish_function_handler_sequence (stmt); | |
7439 | else | |
7440 | finish_handler_sequence (stmt); | |
f1dedc31 | 7441 | } |
faf5394a | 7442 | break; |
b35d4555 | 7443 | |
faf5394a | 7444 | case HANDLER: |
b35d4555 MM |
7445 | { |
7446 | tree decl; | |
b35d4555 MM |
7447 | |
7448 | prep_stmt (t); | |
7449 | stmt = begin_handler (); | |
7450 | if (HANDLER_PARMS (t)) | |
7451 | { | |
7452 | decl = DECL_STMT_DECL (HANDLER_PARMS (t)); | |
7453 | decl = tsubst (decl, args, complain, in_decl); | |
f8191e64 MM |
7454 | /* Prevent instantiate_decl from trying to instantiate |
7455 | this variable. We've already done all that needs to be | |
7456 | done. */ | |
7457 | DECL_TEMPLATE_INSTANTIATED (decl) = 1; | |
b35d4555 MM |
7458 | } |
7459 | else | |
7460 | decl = NULL_TREE; | |
1a6025b4 | 7461 | finish_handler_parms (decl, stmt); |
b35d4555 | 7462 | tsubst_expr (HANDLER_BODY (t), args, complain, in_decl); |
1a6025b4 | 7463 | finish_handler (stmt); |
b35d4555 | 7464 | } |
faf5394a MS |
7465 | break; |
7466 | ||
b87692e5 | 7467 | case TAG_DEFN: |
a7e4cfa0 | 7468 | prep_stmt (t); |
fd10dd09 | 7469 | tsubst (TREE_TYPE (t), args, complain, NULL_TREE); |
b87692e5 MS |
7470 | break; |
7471 | ||
fd10dd09 JM |
7472 | case CTOR_STMT: |
7473 | add_stmt (copy_node (t)); | |
7474 | break; | |
7475 | ||
5566b478 | 7476 | default: |
fd10dd09 | 7477 | abort (); |
5566b478 | 7478 | } |
fd10dd09 JM |
7479 | |
7480 | return tsubst_expr (TREE_CHAIN (t), args, complain, in_decl); | |
8d08fdba MS |
7481 | } |
7482 | ||
db9b2174 MM |
7483 | /* TMPL is a TEMPLATE_DECL for a cloned constructor or destructor. |
7484 | Instantiate it with the ARGS. */ | |
7485 | ||
7486 | static tree | |
7487 | instantiate_clone (tmpl, args) | |
7488 | tree tmpl; | |
7489 | tree args; | |
7490 | { | |
7491 | tree spec; | |
7492 | tree clone; | |
7493 | ||
7494 | /* Instantiated the cloned function, rather than the clone. */ | |
7495 | spec = instantiate_template (DECL_CLONED_FUNCTION (tmpl), args); | |
7496 | ||
7497 | /* Then, see if we've already cloned the instantiation. */ | |
7498 | for (clone = TREE_CHAIN (spec); | |
7499 | clone && DECL_CLONED_FUNCTION_P (clone); | |
7500 | clone = TREE_CHAIN (clone)) | |
7501 | if (DECL_NAME (clone) == DECL_NAME (tmpl)) | |
7502 | return clone; | |
7503 | ||
7504 | /* If we haven't, do so know. */ | |
7505 | if (!clone) | |
7506 | clone_function_decl (spec, /*update_method_vec_p=*/0); | |
7507 | ||
7508 | /* Look again. */ | |
7509 | for (clone = TREE_CHAIN (spec); | |
7510 | clone && DECL_CLONED_FUNCTION_P (clone); | |
7511 | clone = TREE_CHAIN (clone)) | |
7512 | if (DECL_NAME (clone) == DECL_NAME (tmpl)) | |
7513 | return clone; | |
7514 | ||
7515 | /* We should always have found the clone by now. */ | |
7516 | my_friendly_abort (20000411); | |
7517 | return NULL_TREE; | |
7518 | } | |
7519 | ||
6ba89f8e | 7520 | /* Instantiate the indicated variable or function template TMPL with |
36a117a5 MM |
7521 | the template arguments in TARG_PTR. */ |
7522 | ||
5566b478 MS |
7523 | tree |
7524 | instantiate_template (tmpl, targ_ptr) | |
98c1c668 | 7525 | tree tmpl, targ_ptr; |
8d08fdba | 7526 | { |
94350948 | 7527 | tree clone; |
5566b478 | 7528 | tree fndecl; |
36a117a5 MM |
7529 | tree gen_tmpl; |
7530 | tree spec; | |
5566b478 | 7531 | int i, len; |
36a117a5 | 7532 | tree inner_args; |
5566b478 | 7533 | |
27fafc8d JM |
7534 | if (tmpl == error_mark_node) |
7535 | return error_mark_node; | |
7536 | ||
386b8a85 JM |
7537 | my_friendly_assert (TREE_CODE (tmpl) == TEMPLATE_DECL, 283); |
7538 | ||
db9b2174 MM |
7539 | /* If this function is a clone, handle it specially. */ |
7540 | if (DECL_CLONED_FUNCTION_P (tmpl)) | |
7541 | return instantiate_clone (tmpl, targ_ptr); | |
7542 | ||
36a117a5 MM |
7543 | /* Check to see if we already have this specialization. */ |
7544 | spec = retrieve_specialization (tmpl, targ_ptr); | |
7545 | if (spec != NULL_TREE) | |
7546 | return spec; | |
7547 | ||
f9a7ae04 MM |
7548 | gen_tmpl = most_general_template (tmpl); |
7549 | if (tmpl != gen_tmpl) | |
386b8a85 | 7550 | { |
36a117a5 MM |
7551 | /* The TMPL is a partial instantiation. To get a full set of |
7552 | arguments we must add the arguments used to perform the | |
7553 | partial instantiation. */ | |
7554 | targ_ptr = add_outermost_template_args (DECL_TI_ARGS (tmpl), | |
7555 | targ_ptr); | |
36a117a5 MM |
7556 | |
7557 | /* Check to see if we already have this specialization. */ | |
7558 | spec = retrieve_specialization (gen_tmpl, targ_ptr); | |
75650646 MM |
7559 | if (spec != NULL_TREE) |
7560 | return spec; | |
386b8a85 JM |
7561 | } |
7562 | ||
36a117a5 | 7563 | len = DECL_NTPARMS (gen_tmpl); |
f9a7ae04 | 7564 | inner_args = INNERMOST_TEMPLATE_ARGS (targ_ptr); |
5566b478 MS |
7565 | i = len; |
7566 | while (i--) | |
8d08fdba | 7567 | { |
36a117a5 | 7568 | tree t = TREE_VEC_ELT (inner_args, i); |
2f939d94 | 7569 | if (TYPE_P (t)) |
5566b478 MS |
7570 | { |
7571 | tree nt = target_type (t); | |
ec255269 | 7572 | if (IS_AGGR_TYPE (nt) && decl_function_context (TYPE_MAIN_DECL (nt))) |
5566b478 | 7573 | { |
8251199e JM |
7574 | cp_error ("type `%T' composed from a local class is not a valid template-argument", t); |
7575 | cp_error (" trying to instantiate `%D'", gen_tmpl); | |
454fa7a7 | 7576 | return error_mark_node; |
5566b478 MS |
7577 | } |
7578 | } | |
8d08fdba MS |
7579 | } |
7580 | ||
5566b478 | 7581 | /* substitute template parameters */ |
17aec3eb RK |
7582 | fndecl = tsubst (DECL_TEMPLATE_RESULT (gen_tmpl), |
7583 | targ_ptr, /*complain=*/1, gen_tmpl); | |
36a117a5 MM |
7584 | /* The DECL_TI_TEMPLATE should always be the immediate parent |
7585 | template, not the most general template. */ | |
7586 | DECL_TI_TEMPLATE (fndecl) = tmpl; | |
8d08fdba | 7587 | |
824b9a4c MS |
7588 | if (flag_external_templates) |
7589 | add_pending_template (fndecl); | |
7590 | ||
94350948 MM |
7591 | /* If we've just instantiated the main entry point for a function, |
7592 | instantiate all the alternate entry points as well. */ | |
7593 | for (clone = TREE_CHAIN (gen_tmpl); | |
7594 | clone && DECL_CLONED_FUNCTION_P (clone); | |
7595 | clone = TREE_CHAIN (clone)) | |
7596 | instantiate_template (clone, targ_ptr); | |
7597 | ||
5566b478 | 7598 | return fndecl; |
8d08fdba | 7599 | } |
5566b478 | 7600 | |
4393e105 MM |
7601 | /* The FN is a TEMPLATE_DECL for a function. The ARGS are the |
7602 | arguments that are being used when calling it. TARGS is a vector | |
7603 | into which the deduced template arguments are placed. | |
8d08fdba MS |
7604 | |
7605 | Return zero for success, 2 for an incomplete match that doesn't resolve | |
7606 | all the types, and 1 for complete failure. An error message will be | |
7607 | printed only for an incomplete match. | |
7608 | ||
e5214479 JM |
7609 | If FN is a conversion operator, or we are trying to produce a specific |
7610 | specialization, RETURN_TYPE is the return type desired. | |
9f54c803 MM |
7611 | |
7612 | The EXPLICIT_TARGS are explicit template arguments provided via a | |
7613 | template-id. | |
6467930b | 7614 | |
830bfa74 MM |
7615 | The parameter STRICT is one of: |
7616 | ||
7617 | DEDUCE_CALL: | |
7618 | We are deducing arguments for a function call, as in | |
7619 | [temp.deduct.call]. | |
7620 | ||
7621 | DEDUCE_CONV: | |
7622 | We are deducing arguments for a conversion function, as in | |
7623 | [temp.deduct.conv]. | |
7624 | ||
7625 | DEDUCE_EXACT: | |
62e4a758 NS |
7626 | We are deducing arguments when doing an explicit instantiation |
7627 | as in [temp.explicit], when determining an explicit specialization | |
7628 | as in [temp.expl.spec], or when taking the address of a function | |
7629 | template, as in [temp.deduct.funcaddr]. | |
7630 | ||
7631 | DEDUCE_ORDER: | |
830bfa74 MM |
7632 | We are deducing arguments when calculating the partial |
7633 | ordering between specializations of function or class | |
62e4a758 | 7634 | templates, as in [temp.func.order] and [temp.class.order]. |
4393e105 | 7635 | |
e5214479 JM |
7636 | LEN is the number of parms to consider before returning success, or -1 |
7637 | for all. This is used in partial ordering to avoid comparing parms for | |
7638 | which no actual argument was passed, since they are not considered in | |
7639 | overload resolution (and are explicitly excluded from consideration in | |
7640 | partial ordering in [temp.func.order]/6). */ | |
8d08fdba MS |
7641 | |
7642 | int | |
4393e105 | 7643 | fn_type_unification (fn, explicit_targs, targs, args, return_type, |
e5214479 | 7644 | strict, len) |
4393e105 | 7645 | tree fn, explicit_targs, targs, args, return_type; |
830bfa74 | 7646 | unification_kind_t strict; |
e5214479 | 7647 | int len; |
386b8a85 | 7648 | { |
4393e105 MM |
7649 | tree parms; |
7650 | tree fntype; | |
adecb3f4 | 7651 | int result; |
386b8a85 | 7652 | |
4393e105 MM |
7653 | my_friendly_assert (TREE_CODE (fn) == TEMPLATE_DECL, 0); |
7654 | ||
7655 | fntype = TREE_TYPE (fn); | |
7656 | if (explicit_targs) | |
75650646 | 7657 | { |
4393e105 MM |
7658 | /* [temp.deduct] |
7659 | ||
7660 | The specified template arguments must match the template | |
7661 | parameters in kind (i.e., type, nontype, template), and there | |
7662 | must not be more arguments than there are parameters; | |
7663 | otherwise type deduction fails. | |
7664 | ||
7665 | Nontype arguments must match the types of the corresponding | |
7666 | nontype template parameters, or must be convertible to the | |
7667 | types of the corresponding nontype parameters as specified in | |
7668 | _temp.arg.nontype_, otherwise type deduction fails. | |
7669 | ||
7670 | All references in the function type of the function template | |
7671 | to the corresponding template parameters are replaced by the | |
7672 | specified template argument values. If a substitution in a | |
7673 | template parameter or in the function type of the function | |
7674 | template results in an invalid type, type deduction fails. */ | |
7675 | int i; | |
7676 | tree converted_args; | |
75650646 | 7677 | |
4393e105 MM |
7678 | converted_args |
7679 | = (coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn), | |
7680 | explicit_targs, NULL_TREE, /*complain=*/0, | |
7681 | /*require_all_arguments=*/0)); | |
7682 | if (converted_args == error_mark_node) | |
75650646 | 7683 | return 1; |
386b8a85 | 7684 | |
4393e105 MM |
7685 | fntype = tsubst (fntype, converted_args, /*complain=*/0, NULL_TREE); |
7686 | if (fntype == error_mark_node) | |
7687 | return 1; | |
050367a3 | 7688 | |
4393e105 MM |
7689 | /* Place the explicitly specified arguments in TARGS. */ |
7690 | for (i = 0; i < TREE_VEC_LENGTH (targs); i++) | |
7691 | TREE_VEC_ELT (targs, i) = TREE_VEC_ELT (converted_args, i); | |
75650646 | 7692 | } |
4393e105 MM |
7693 | |
7694 | parms = TYPE_ARG_TYPES (fntype); | |
e5214479 JM |
7695 | /* Never do unification on the 'this' parameter. */ |
7696 | if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn)) | |
7697 | parms = TREE_CHAIN (parms); | |
8d3631f8 NS |
7698 | |
7699 | if (return_type) | |
7700 | { | |
7701 | /* We've been given a return type to match, prepend it. */ | |
7702 | parms = tree_cons (NULL_TREE, TREE_TYPE (fntype), parms); | |
7703 | args = tree_cons (NULL_TREE, return_type, args); | |
16e42e7c JM |
7704 | if (len >= 0) |
7705 | ++len; | |
4393e105 MM |
7706 | } |
7707 | ||
4393e105 MM |
7708 | /* We allow incomplete unification without an error message here |
7709 | because the standard doesn't seem to explicitly prohibit it. Our | |
7710 | callers must be ready to deal with unification failures in any | |
7711 | event. */ | |
adecb3f4 MM |
7712 | result = type_unification_real (DECL_INNERMOST_TEMPLATE_PARMS (fn), |
7713 | targs, parms, args, /*subr=*/0, | |
e5214479 | 7714 | strict, /*allow_incomplete*/1, len); |
adecb3f4 MM |
7715 | |
7716 | if (result == 0) | |
7717 | /* All is well so far. Now, check: | |
7718 | ||
7719 | [temp.deduct] | |
7720 | ||
7721 | When all template arguments have been deduced, all uses of | |
7722 | template parameters in nondeduced contexts are replaced with | |
7723 | the corresponding deduced argument values. If the | |
7724 | substitution results in an invalid type, as described above, | |
7725 | type deduction fails. */ | |
7726 | if (tsubst (TREE_TYPE (fn), targs, /*complain=*/0, NULL_TREE) | |
7727 | == error_mark_node) | |
7728 | return 1; | |
7729 | ||
7730 | return result; | |
830bfa74 MM |
7731 | } |
7732 | ||
7733 | /* Adjust types before performing type deduction, as described in | |
7734 | [temp.deduct.call] and [temp.deduct.conv]. The rules in these two | |
4c7d0dff MM |
7735 | sections are symmetric. PARM is the type of a function parameter |
7736 | or the return type of the conversion function. ARG is the type of | |
7737 | the argument passed to the call, or the type of the value | |
dc957d14 | 7738 | initialized with the result of the conversion function. */ |
386b8a85 | 7739 | |
62e4a758 | 7740 | static int |
830bfa74 MM |
7741 | maybe_adjust_types_for_deduction (strict, parm, arg) |
7742 | unification_kind_t strict; | |
7743 | tree* parm; | |
7744 | tree* arg; | |
7745 | { | |
62e4a758 NS |
7746 | int result = 0; |
7747 | ||
830bfa74 MM |
7748 | switch (strict) |
7749 | { | |
7750 | case DEDUCE_CALL: | |
7751 | break; | |
7752 | ||
7753 | case DEDUCE_CONV: | |
7754 | { | |
4c7d0dff MM |
7755 | /* Swap PARM and ARG throughout the remainder of this |
7756 | function; the handling is precisely symmetric since PARM | |
7757 | will initialize ARG rather than vice versa. */ | |
830bfa74 MM |
7758 | tree* temp = parm; |
7759 | parm = arg; | |
7760 | arg = temp; | |
7761 | break; | |
7762 | } | |
7763 | ||
7764 | case DEDUCE_EXACT: | |
7765 | /* There is nothing to do in this case. */ | |
62e4a758 | 7766 | return 0; |
830bfa74 | 7767 | |
62e4a758 NS |
7768 | case DEDUCE_ORDER: |
7769 | /* DR 214. [temp.func.order] is underspecified, and leads to no | |
7770 | ordering between things like `T *' and `T const &' for `U *'. | |
7771 | The former has T=U and the latter T=U*. The former looks more | |
7772 | specialized and John Spicer considers it well-formed (the EDG | |
7773 | compiler accepts it). | |
7774 | ||
7775 | John also confirms that deduction should proceed as in a function | |
996065b4 | 7776 | call. Which implies the usual ARG and PARM conversions as DEDUCE_CALL. |
62e4a758 NS |
7777 | However, in ordering, ARG can have REFERENCE_TYPE, but no argument |
7778 | to an actual call can have such a type. | |
7779 | ||
996065b4 NS |
7780 | If both ARG and PARM are REFERENCE_TYPE, we change neither. |
7781 | If only ARG is a REFERENCE_TYPE, we look through that and then | |
7782 | proceed as with DEDUCE_CALL (which could further convert it). */ | |
62e4a758 NS |
7783 | if (TREE_CODE (*arg) == REFERENCE_TYPE) |
7784 | { | |
7785 | if (TREE_CODE (*parm) == REFERENCE_TYPE) | |
7786 | return 0; | |
7787 | *arg = TREE_TYPE (*arg); | |
62e4a758 NS |
7788 | } |
7789 | break; | |
830bfa74 MM |
7790 | default: |
7791 | my_friendly_abort (0); | |
7792 | } | |
7793 | ||
7794 | if (TREE_CODE (*parm) != REFERENCE_TYPE) | |
7795 | { | |
7796 | /* [temp.deduct.call] | |
7797 | ||
7798 | If P is not a reference type: | |
7799 | ||
7800 | --If A is an array type, the pointer type produced by the | |
7801 | array-to-pointer standard conversion (_conv.array_) is | |
7802 | used in place of A for type deduction; otherwise, | |
7803 | ||
7804 | --If A is a function type, the pointer type produced by | |
7805 | the function-to-pointer standard conversion | |
7806 | (_conv.func_) is used in place of A for type deduction; | |
7807 | otherwise, | |
7808 | ||
7809 | --If A is a cv-qualified type, the top level | |
7810 | cv-qualifiers of A's type are ignored for type | |
7811 | deduction. */ | |
7812 | if (TREE_CODE (*arg) == ARRAY_TYPE) | |
7813 | *arg = build_pointer_type (TREE_TYPE (*arg)); | |
d8f8dca1 | 7814 | else if (TREE_CODE (*arg) == FUNCTION_TYPE) |
830bfa74 MM |
7815 | *arg = build_pointer_type (*arg); |
7816 | else | |
7817 | *arg = TYPE_MAIN_VARIANT (*arg); | |
7818 | } | |
7819 | ||
7820 | /* [temp.deduct.call] | |
7821 | ||
7822 | If P is a cv-qualified type, the top level cv-qualifiers | |
7823 | of P's type are ignored for type deduction. If P is a | |
7824 | reference type, the type referred to by P is used for | |
7825 | type deduction. */ | |
7826 | *parm = TYPE_MAIN_VARIANT (*parm); | |
7827 | if (TREE_CODE (*parm) == REFERENCE_TYPE) | |
62e4a758 NS |
7828 | { |
7829 | *parm = TREE_TYPE (*parm); | |
7830 | result |= UNIFY_ALLOW_OUTER_MORE_CV_QUAL; | |
7831 | } | |
7832 | return result; | |
386b8a85 JM |
7833 | } |
7834 | ||
e5214479 | 7835 | /* Most parms like fn_type_unification. |
9f54c803 MM |
7836 | |
7837 | If SUBR is 1, we're being called recursively (to unify the | |
7838 | arguments of a function or method parameter of a function | |
7839 | template). */ | |
386b8a85 | 7840 | |
4966381a | 7841 | static int |
bd0d5d4a JM |
7842 | type_unification_real (tparms, targs, xparms, xargs, subr, |
7843 | strict, allow_incomplete, xlen) | |
7844 | tree tparms, targs, xparms, xargs; | |
830bfa74 MM |
7845 | int subr; |
7846 | unification_kind_t strict; | |
bd0d5d4a | 7847 | int allow_incomplete, xlen; |
8d08fdba MS |
7848 | { |
7849 | tree parm, arg; | |
7850 | int i; | |
7851 | int ntparms = TREE_VEC_LENGTH (tparms); | |
830bfa74 | 7852 | int sub_strict; |
bd0d5d4a JM |
7853 | int saw_undeduced = 0; |
7854 | tree parms, args; | |
7855 | int len; | |
8d08fdba MS |
7856 | |
7857 | my_friendly_assert (TREE_CODE (tparms) == TREE_VEC, 289); | |
bd0d5d4a JM |
7858 | my_friendly_assert (xparms == NULL_TREE |
7859 | || TREE_CODE (xparms) == TREE_LIST, 290); | |
51c184be | 7860 | /* ARGS could be NULL (via a call from parse.y to |
8d08fdba | 7861 | build_x_function_call). */ |
bd0d5d4a JM |
7862 | if (xargs) |
7863 | my_friendly_assert (TREE_CODE (xargs) == TREE_LIST, 291); | |
8d08fdba MS |
7864 | my_friendly_assert (ntparms > 0, 292); |
7865 | ||
830bfa74 MM |
7866 | switch (strict) |
7867 | { | |
7868 | case DEDUCE_CALL: | |
028d1f20 NS |
7869 | sub_strict = (UNIFY_ALLOW_OUTER_LEVEL | UNIFY_ALLOW_MORE_CV_QUAL |
7870 | | UNIFY_ALLOW_DERIVED); | |
830bfa74 MM |
7871 | break; |
7872 | ||
7873 | case DEDUCE_CONV: | |
7874 | sub_strict = UNIFY_ALLOW_LESS_CV_QUAL; | |
7875 | break; | |
7876 | ||
7877 | case DEDUCE_EXACT: | |
7878 | sub_strict = UNIFY_ALLOW_NONE; | |
7879 | break; | |
62e4a758 NS |
7880 | |
7881 | case DEDUCE_ORDER: | |
7882 | sub_strict = UNIFY_ALLOW_NONE; | |
7883 | break; | |
830bfa74 MM |
7884 | |
7885 | default: | |
7886 | my_friendly_abort (0); | |
7887 | } | |
7888 | ||
bd0d5d4a | 7889 | if (xlen == 0) |
e5214479 JM |
7890 | return 0; |
7891 | ||
bd0d5d4a JM |
7892 | again: |
7893 | parms = xparms; | |
7894 | args = xargs; | |
7895 | len = xlen; | |
7896 | ||
8d08fdba MS |
7897 | while (parms |
7898 | && parms != void_list_node | |
7899 | && args | |
7900 | && args != void_list_node) | |
7901 | { | |
7902 | parm = TREE_VALUE (parms); | |
7903 | parms = TREE_CHAIN (parms); | |
7904 | arg = TREE_VALUE (args); | |
7905 | args = TREE_CHAIN (args); | |
7906 | ||
7907 | if (arg == error_mark_node) | |
7908 | return 1; | |
7909 | if (arg == unknown_type_node) | |
34016c81 JM |
7910 | /* We can't deduce anything from this, but we might get all the |
7911 | template args from other function args. */ | |
7912 | continue; | |
b7484fbe | 7913 | |
03e70705 JM |
7914 | /* Conversions will be performed on a function argument that |
7915 | corresponds with a function parameter that contains only | |
7916 | non-deducible template parameters and explicitly specified | |
7917 | template parameters. */ | |
7918 | if (! uses_template_parms (parm)) | |
b7484fbe | 7919 | { |
03e70705 JM |
7920 | tree type; |
7921 | ||
2f939d94 | 7922 | if (!TYPE_P (arg)) |
03e70705 JM |
7923 | type = TREE_TYPE (arg); |
7924 | else | |
7925 | { | |
7926 | type = arg; | |
7927 | arg = NULL_TREE; | |
7928 | } | |
7929 | ||
62e4a758 | 7930 | if (strict == DEDUCE_EXACT || strict == DEDUCE_ORDER) |
03e70705 | 7931 | { |
3bfdc719 | 7932 | if (same_type_p (parm, type)) |
03e70705 JM |
7933 | continue; |
7934 | } | |
03e70705 | 7935 | else |
343c89cd JM |
7936 | /* It might work; we shouldn't check now, because we might |
7937 | get into infinite recursion. Overload resolution will | |
7938 | handle it. */ | |
7939 | continue; | |
03e70705 | 7940 | |
b7484fbe MS |
7941 | return 1; |
7942 | } | |
7943 | ||
2f939d94 | 7944 | if (!TYPE_P (arg)) |
8d08fdba MS |
7945 | { |
7946 | my_friendly_assert (TREE_TYPE (arg) != NULL_TREE, 293); | |
34016c81 | 7947 | if (type_unknown_p (arg)) |
28cbf42c | 7948 | { |
34016c81 JM |
7949 | /* [temp.deduct.type] A template-argument can be deduced from |
7950 | a pointer to function or pointer to member function | |
7951 | argument if the set of overloaded functions does not | |
7952 | contain function templates and at most one of a set of | |
7953 | overloaded functions provides a unique match. */ | |
7954 | ||
7955 | if (resolve_overloaded_unification | |
4393e105 | 7956 | (tparms, targs, parm, arg, strict, sub_strict) |
34016c81 JM |
7957 | != 0) |
7958 | return 1; | |
7959 | continue; | |
28cbf42c | 7960 | } |
8d08fdba MS |
7961 | arg = TREE_TYPE (arg); |
7962 | } | |
62e4a758 NS |
7963 | |
7964 | { | |
7965 | int arg_strict = sub_strict; | |
7966 | ||
7967 | if (!subr) | |
7968 | arg_strict |= maybe_adjust_types_for_deduction (strict, &parm, &arg); | |
4393e105 | 7969 | |
62e4a758 NS |
7970 | if (unify (tparms, targs, parm, arg, arg_strict)) |
7971 | return 1; | |
7972 | } | |
e5214479 JM |
7973 | |
7974 | /* Are we done with the interesting parms? */ | |
7975 | if (--len == 0) | |
bd0d5d4a | 7976 | goto done; |
8d08fdba MS |
7977 | } |
7978 | /* Fail if we've reached the end of the parm list, and more args | |
7979 | are present, and the parm list isn't variadic. */ | |
7980 | if (args && args != void_list_node && parms == void_list_node) | |
7981 | return 1; | |
7982 | /* Fail if parms are left and they don't have default values. */ | |
7983 | if (parms | |
7984 | && parms != void_list_node | |
7985 | && TREE_PURPOSE (parms) == NULL_TREE) | |
7986 | return 1; | |
bd0d5d4a JM |
7987 | |
7988 | done: | |
8d08fdba MS |
7989 | if (!subr) |
7990 | for (i = 0; i < ntparms; i++) | |
050367a3 | 7991 | if (TREE_VEC_ELT (targs, i) == NULL_TREE) |
8d08fdba | 7992 | { |
bd0d5d4a JM |
7993 | tree tparm = TREE_VALUE (TREE_VEC_ELT (tparms, i)); |
7994 | ||
7995 | /* If this is an undeduced nontype parameter that depends on | |
7996 | a type parameter, try another pass; its type may have been | |
7997 | deduced from a later argument than the one from which | |
7998 | this parameter can be deduced. */ | |
7999 | if (TREE_CODE (tparm) == PARM_DECL | |
8000 | && uses_template_parms (TREE_TYPE (tparm)) | |
8001 | && !saw_undeduced++) | |
8002 | goto again; | |
8003 | ||
386b8a85 | 8004 | if (!allow_incomplete) |
8251199e | 8005 | error ("incomplete type unification"); |
8d08fdba MS |
8006 | return 2; |
8007 | } | |
8008 | return 0; | |
8009 | } | |
8010 | ||
34016c81 JM |
8011 | /* Subroutine of type_unification_real. Args are like the variables at the |
8012 | call site. ARG is an overloaded function (or template-id); we try | |
8013 | deducing template args from each of the overloads, and if only one | |
8014 | succeeds, we go with that. Modifies TARGS and returns 0 on success. */ | |
8015 | ||
8016 | static int | |
8017 | resolve_overloaded_unification (tparms, targs, parm, arg, strict, | |
4393e105 | 8018 | sub_strict) |
34016c81 JM |
8019 | tree tparms, targs, parm, arg; |
8020 | unification_kind_t strict; | |
8021 | int sub_strict; | |
34016c81 JM |
8022 | { |
8023 | tree tempargs = copy_node (targs); | |
8024 | int good = 0; | |
8025 | ||
8026 | if (TREE_CODE (arg) == ADDR_EXPR) | |
8027 | arg = TREE_OPERAND (arg, 0); | |
9f3d9e46 | 8028 | |
d8f8dca1 MM |
8029 | if (TREE_CODE (arg) == COMPONENT_REF) |
8030 | /* Handle `&x' where `x' is some static or non-static member | |
8031 | function name. */ | |
8032 | arg = TREE_OPERAND (arg, 1); | |
8033 | ||
05e0b2f4 JM |
8034 | if (TREE_CODE (arg) == OFFSET_REF) |
8035 | arg = TREE_OPERAND (arg, 1); | |
8036 | ||
9f3d9e46 JM |
8037 | /* Strip baselink information. */ |
8038 | while (TREE_CODE (arg) == TREE_LIST) | |
8039 | arg = TREE_VALUE (arg); | |
8040 | ||
34016c81 JM |
8041 | if (TREE_CODE (arg) == TEMPLATE_ID_EXPR) |
8042 | { | |
8043 | /* If we got some explicit template args, we need to plug them into | |
8044 | the affected templates before we try to unify, in case the | |
8045 | explicit args will completely resolve the templates in question. */ | |
8046 | ||
8047 | tree expl_subargs = TREE_OPERAND (arg, 1); | |
8048 | arg = TREE_OPERAND (arg, 0); | |
8049 | ||
8050 | for (; arg; arg = OVL_NEXT (arg)) | |
8051 | { | |
8052 | tree fn = OVL_CURRENT (arg); | |
8053 | tree subargs, elem; | |
8054 | ||
8055 | if (TREE_CODE (fn) != TEMPLATE_DECL) | |
8056 | continue; | |
8057 | ||
17aec3eb RK |
8058 | subargs = get_bindings_overload (fn, DECL_TEMPLATE_RESULT (fn), |
8059 | expl_subargs); | |
34016c81 JM |
8060 | if (subargs) |
8061 | { | |
4393e105 MM |
8062 | elem = tsubst (TREE_TYPE (fn), subargs, /*complain=*/0, |
8063 | NULL_TREE); | |
d8f8dca1 MM |
8064 | if (TREE_CODE (elem) == METHOD_TYPE) |
8065 | elem = build_ptrmemfunc_type (build_pointer_type (elem)); | |
e97e5263 | 8066 | good += try_one_overload (tparms, targs, tempargs, parm, elem, |
4393e105 | 8067 | strict, sub_strict); |
34016c81 JM |
8068 | } |
8069 | } | |
8070 | } | |
8071 | else if (TREE_CODE (arg) == OVERLOAD) | |
8072 | { | |
8073 | for (; arg; arg = OVL_NEXT (arg)) | |
d8f8dca1 MM |
8074 | { |
8075 | tree type = TREE_TYPE (OVL_CURRENT (arg)); | |
8076 | if (TREE_CODE (type) == METHOD_TYPE) | |
8077 | type = build_ptrmemfunc_type (build_pointer_type (type)); | |
8078 | good += try_one_overload (tparms, targs, tempargs, parm, | |
8079 | type, | |
4393e105 | 8080 | strict, sub_strict); |
d8f8dca1 | 8081 | } |
34016c81 JM |
8082 | } |
8083 | else | |
8084 | my_friendly_abort (981006); | |
8085 | ||
8086 | /* [temp.deduct.type] A template-argument can be deduced from a pointer | |
8087 | to function or pointer to member function argument if the set of | |
8088 | overloaded functions does not contain function templates and at most | |
8089 | one of a set of overloaded functions provides a unique match. | |
8090 | ||
8091 | So if we found multiple possibilities, we return success but don't | |
8092 | deduce anything. */ | |
8093 | ||
8094 | if (good == 1) | |
8095 | { | |
8096 | int i = TREE_VEC_LENGTH (targs); | |
8097 | for (; i--; ) | |
8098 | if (TREE_VEC_ELT (tempargs, i)) | |
8099 | TREE_VEC_ELT (targs, i) = TREE_VEC_ELT (tempargs, i); | |
8100 | } | |
8101 | if (good) | |
8102 | return 0; | |
8103 | ||
8104 | return 1; | |
8105 | } | |
8106 | ||
8107 | /* Subroutine of resolve_overloaded_unification; does deduction for a single | |
8108 | overload. Fills TARGS with any deduced arguments, or error_mark_node if | |
8109 | different overloads deduce different arguments for a given parm. | |
8110 | Returns 1 on success. */ | |
8111 | ||
8112 | static int | |
e97e5263 | 8113 | try_one_overload (tparms, orig_targs, targs, parm, arg, strict, |
4393e105 | 8114 | sub_strict) |
e97e5263 | 8115 | tree tparms, orig_targs, targs, parm, arg; |
34016c81 JM |
8116 | unification_kind_t strict; |
8117 | int sub_strict; | |
34016c81 JM |
8118 | { |
8119 | int nargs; | |
8120 | tree tempargs; | |
8121 | int i; | |
8122 | ||
8123 | /* [temp.deduct.type] A template-argument can be deduced from a pointer | |
8124 | to function or pointer to member function argument if the set of | |
8125 | overloaded functions does not contain function templates and at most | |
8126 | one of a set of overloaded functions provides a unique match. | |
8127 | ||
8128 | So if this is a template, just return success. */ | |
8129 | ||
8130 | if (uses_template_parms (arg)) | |
8131 | return 1; | |
8132 | ||
62e4a758 | 8133 | sub_strict |= maybe_adjust_types_for_deduction (strict, &parm, &arg); |
34016c81 JM |
8134 | |
8135 | /* We don't copy orig_targs for this because if we have already deduced | |
8136 | some template args from previous args, unify would complain when we | |
8137 | try to deduce a template parameter for the same argument, even though | |
8138 | there isn't really a conflict. */ | |
8139 | nargs = TREE_VEC_LENGTH (targs); | |
f31c0a32 | 8140 | tempargs = make_tree_vec (nargs); |
34016c81 | 8141 | |
4393e105 | 8142 | if (unify (tparms, tempargs, parm, arg, sub_strict) != 0) |
34016c81 JM |
8143 | return 0; |
8144 | ||
8145 | /* First make sure we didn't deduce anything that conflicts with | |
e97e5263 | 8146 | explicitly specified args. */ |
34016c81 JM |
8147 | for (i = nargs; i--; ) |
8148 | { | |
8149 | tree elt = TREE_VEC_ELT (tempargs, i); | |
e97e5263 | 8150 | tree oldelt = TREE_VEC_ELT (orig_targs, i); |
34016c81 JM |
8151 | |
8152 | if (elt == NULL_TREE) | |
8153 | continue; | |
8154 | else if (uses_template_parms (elt)) | |
8155 | { | |
8156 | /* Since we're unifying against ourselves, we will fill in template | |
8157 | args used in the function parm list with our own template parms. | |
8158 | Discard them. */ | |
8159 | TREE_VEC_ELT (tempargs, i) = NULL_TREE; | |
8160 | continue; | |
8161 | } | |
8162 | else if (oldelt && ! template_args_equal (oldelt, elt)) | |
8163 | return 0; | |
8164 | } | |
8165 | ||
8166 | for (i = nargs; i--; ) | |
8167 | { | |
8168 | tree elt = TREE_VEC_ELT (tempargs, i); | |
8169 | ||
8170 | if (elt) | |
8171 | TREE_VEC_ELT (targs, i) = elt; | |
8172 | } | |
8173 | ||
8174 | return 1; | |
8175 | } | |
8176 | ||
74601d7c KL |
8177 | /* Verify that nondeduce template argument agrees with the type |
8178 | obtained from argument deduction. Return nonzero if the | |
8179 | verification fails. | |
8180 | ||
8181 | For example: | |
8182 | ||
8183 | struct A { typedef int X; }; | |
8184 | template <class T, class U> struct C {}; | |
8185 | template <class T> struct C<T, typename T::X> {}; | |
8186 | ||
8187 | Then with the instantiation `C<A, int>', we can deduce that | |
8188 | `T' is `A' but unify () does not check whether `typename T::X' | |
8189 | is `int'. This function ensure that they agree. | |
8190 | ||
8191 | TARGS, PARMS are the same as the arguments of unify. | |
8192 | ARGS contains template arguments from all levels. */ | |
8193 | ||
8194 | static int | |
8195 | verify_class_unification (targs, parms, args) | |
8196 | tree targs, parms, args; | |
8197 | { | |
8198 | int i; | |
8199 | int nparms = TREE_VEC_LENGTH (parms); | |
8200 | tree new_parms = tsubst (parms, add_outermost_template_args (args, targs), | |
8201 | /*complain=*/0, NULL_TREE); | |
8202 | if (new_parms == error_mark_node) | |
8203 | return 1; | |
8204 | ||
8205 | args = INNERMOST_TEMPLATE_ARGS (args); | |
8206 | ||
8207 | for (i = 0; i < nparms; i++) | |
8208 | { | |
8209 | tree parm = TREE_VEC_ELT (new_parms, i); | |
8210 | tree arg = TREE_VEC_ELT (args, i); | |
8211 | ||
8212 | /* In case we are deducing from a function argument of a function | |
8213 | templates, some parameters may not be deduced yet. So we | |
8214 | make sure that only fully substituted elements of PARM are | |
8215 | compared below. */ | |
8216 | ||
8217 | if (!uses_template_parms (parm) && !template_args_equal (parm, arg)) | |
8218 | return 1; | |
8219 | } | |
8220 | return 0; | |
8221 | } | |
8222 | ||
4393e105 MM |
8223 | /* PARM is a template class (perhaps with unbound template |
8224 | parameters). ARG is a fully instantiated type. If ARG can be | |
8225 | bound to PARM, return ARG, otherwise return NULL_TREE. TPARMS and | |
8226 | TARGS are as for unify. */ | |
fcfb9f96 MM |
8227 | |
8228 | static tree | |
4393e105 | 8229 | try_class_unification (tparms, targs, parm, arg) |
fcfb9f96 MM |
8230 | tree tparms; |
8231 | tree targs; | |
4393e105 MM |
8232 | tree parm; |
8233 | tree arg; | |
8234 | { | |
4393e105 MM |
8235 | tree copy_of_targs; |
8236 | ||
8237 | if (!CLASSTYPE_TEMPLATE_INFO (arg) | |
8238 | || CLASSTYPE_TI_TEMPLATE (arg) != CLASSTYPE_TI_TEMPLATE (parm)) | |
8239 | return NULL_TREE; | |
8240 | ||
8241 | /* We need to make a new template argument vector for the call to | |
8242 | unify. If we used TARGS, we'd clutter it up with the result of | |
8243 | the attempted unification, even if this class didn't work out. | |
8244 | We also don't want to commit ourselves to all the unifications | |
8245 | we've already done, since unification is supposed to be done on | |
8246 | an argument-by-argument basis. In other words, consider the | |
8247 | following pathological case: | |
8248 | ||
8249 | template <int I, int J, int K> | |
8250 | struct S {}; | |
8251 | ||
8252 | template <int I, int J> | |
8253 | struct S<I, J, 2> : public S<I, I, I>, S<J, J, J> {}; | |
8254 | ||
8255 | template <int I, int J, int K> | |
8256 | void f(S<I, J, K>, S<I, I, I>); | |
8257 | ||
8258 | void g() { | |
8259 | S<0, 0, 0> s0; | |
8260 | S<0, 1, 2> s2; | |
8261 | ||
8262 | f(s0, s2); | |
8263 | } | |
8264 | ||
8265 | Now, by the time we consider the unification involving `s2', we | |
8266 | already know that we must have `f<0, 0, 0>'. But, even though | |
8267 | `S<0, 1, 2>' is derived from `S<0, 0, 0>', the code is not legal | |
8268 | because there are two ways to unify base classes of S<0, 1, 2> | |
8269 | with S<I, I, I>. If we kept the already deduced knowledge, we | |
8270 | would reject the possibility I=1. */ | |
f31c0a32 | 8271 | copy_of_targs = make_tree_vec (TREE_VEC_LENGTH (targs)); |
4393e105 MM |
8272 | |
8273 | /* If unification failed, we're done. */ | |
74601d7c KL |
8274 | if (unify (tparms, copy_of_targs, CLASSTYPE_TI_ARGS (parm), |
8275 | CLASSTYPE_TI_ARGS (arg), UNIFY_ALLOW_NONE)) | |
4393e105 | 8276 | return NULL_TREE; |
74601d7c KL |
8277 | |
8278 | return arg; | |
4393e105 MM |
8279 | } |
8280 | ||
8281 | /* Subroutine of get_template_base. RVAL, if non-NULL, is a base we | |
dc957d14 | 8282 | have already discovered to be satisfactory. ARG_BINFO is the binfo |
4393e105 MM |
8283 | for the base class of ARG that we are currently examining. */ |
8284 | ||
8285 | static tree | |
8286 | get_template_base_recursive (tparms, targs, parm, | |
8287 | arg_binfo, rval, flags) | |
8288 | tree tparms; | |
8289 | tree targs; | |
8290 | tree arg_binfo; | |
fcfb9f96 | 8291 | tree rval; |
4393e105 MM |
8292 | tree parm; |
8293 | int flags; | |
fcfb9f96 MM |
8294 | { |
8295 | tree binfos; | |
8296 | int i, n_baselinks; | |
4393e105 | 8297 | tree arg = BINFO_TYPE (arg_binfo); |
fcfb9f96 | 8298 | |
4393e105 | 8299 | if (!(flags & GTB_IGNORE_TYPE)) |
fcfb9f96 | 8300 | { |
4393e105 MM |
8301 | tree r = try_class_unification (tparms, targs, |
8302 | parm, arg); | |
fcfb9f96 | 8303 | |
4393e105 | 8304 | /* If there is more than one satisfactory baseclass, then: |
fcfb9f96 | 8305 | |
4393e105 MM |
8306 | [temp.deduct.call] |
8307 | ||
8308 | If they yield more than one possible deduced A, the type | |
8309 | deduction fails. | |
8310 | ||
8311 | applies. */ | |
8312 | if (r && rval && !same_type_p (r, rval)) | |
8313 | return error_mark_node; | |
8314 | else if (r) | |
8315 | rval = r; | |
fcfb9f96 MM |
8316 | } |
8317 | ||
4393e105 | 8318 | binfos = BINFO_BASETYPES (arg_binfo); |
fcfb9f96 MM |
8319 | n_baselinks = binfos ? TREE_VEC_LENGTH (binfos) : 0; |
8320 | ||
8321 | /* Process base types. */ | |
8322 | for (i = 0; i < n_baselinks; i++) | |
8323 | { | |
8324 | tree base_binfo = TREE_VEC_ELT (binfos, i); | |
4393e105 | 8325 | int this_virtual; |
fcfb9f96 | 8326 | |
4393e105 MM |
8327 | /* Skip this base, if we've already seen it. */ |
8328 | if (BINFO_MARKED (base_binfo)) | |
8329 | continue; | |
8330 | ||
8331 | this_virtual = | |
8332 | (flags & GTB_VIA_VIRTUAL) || TREE_VIA_VIRTUAL (base_binfo); | |
8333 | ||
8334 | /* When searching for a non-virtual, we cannot mark virtually | |
8335 | found binfos. */ | |
8336 | if (! this_virtual) | |
8337 | SET_BINFO_MARKED (base_binfo); | |
8338 | ||
8339 | rval = get_template_base_recursive (tparms, targs, | |
8340 | parm, | |
8341 | base_binfo, | |
8342 | rval, | |
8343 | GTB_VIA_VIRTUAL * this_virtual); | |
8344 | ||
8345 | /* If we discovered more than one matching base class, we can | |
8346 | stop now. */ | |
8347 | if (rval == error_mark_node) | |
8348 | return error_mark_node; | |
fcfb9f96 MM |
8349 | } |
8350 | ||
8351 | return rval; | |
8352 | } | |
8353 | ||
4393e105 MM |
8354 | /* Given a template type PARM and a class type ARG, find the unique |
8355 | base type in ARG that is an instance of PARM. We do not examine | |
8356 | ARG itself; only its base-classes. If there is no appropriate base | |
8357 | class, return NULL_TREE. If there is more than one, return | |
8358 | error_mark_node. PARM may be the type of a partial specialization, | |
8359 | as well as a plain template type. Used by unify. */ | |
fcfb9f96 MM |
8360 | |
8361 | static tree | |
4393e105 | 8362 | get_template_base (tparms, targs, parm, arg) |
fcfb9f96 MM |
8363 | tree tparms; |
8364 | tree targs; | |
4393e105 MM |
8365 | tree parm; |
8366 | tree arg; | |
fcfb9f96 | 8367 | { |
4393e105 MM |
8368 | tree rval; |
8369 | tree arg_binfo; | |
fcfb9f96 | 8370 | |
4393e105 MM |
8371 | my_friendly_assert (IS_AGGR_TYPE_CODE (TREE_CODE (arg)), 92); |
8372 | ||
8373 | arg_binfo = TYPE_BINFO (complete_type (arg)); | |
8374 | rval = get_template_base_recursive (tparms, targs, | |
8375 | parm, arg_binfo, | |
8376 | NULL_TREE, | |
8377 | GTB_IGNORE_TYPE); | |
fcfb9f96 | 8378 | |
4393e105 MM |
8379 | /* Since get_template_base_recursive marks the bases classes, we |
8380 | must unmark them here. */ | |
d6479fe7 | 8381 | dfs_walk (arg_binfo, dfs_unmark, markedp, 0); |
fcfb9f96 MM |
8382 | |
8383 | return rval; | |
8384 | } | |
8385 | ||
db2767b6 MM |
8386 | /* Returns the level of DECL, which declares a template parameter. */ |
8387 | ||
e9659ab0 | 8388 | static int |
db2767b6 MM |
8389 | template_decl_level (decl) |
8390 | tree decl; | |
8391 | { | |
8392 | switch (TREE_CODE (decl)) | |
8393 | { | |
8394 | case TYPE_DECL: | |
8395 | case TEMPLATE_DECL: | |
8396 | return TEMPLATE_TYPE_LEVEL (TREE_TYPE (decl)); | |
8397 | ||
8398 | case PARM_DECL: | |
8399 | return TEMPLATE_PARM_LEVEL (DECL_INITIAL (decl)); | |
8400 | ||
8401 | default: | |
8402 | my_friendly_abort (0); | |
5ffe581d | 8403 | return 0; |
db2767b6 MM |
8404 | } |
8405 | } | |
8406 | ||
830bfa74 MM |
8407 | /* Decide whether ARG can be unified with PARM, considering only the |
8408 | cv-qualifiers of each type, given STRICT as documented for unify. | |
8409 | Returns non-zero iff the unification is OK on that basis.*/ | |
e92cc029 | 8410 | |
e9659ab0 | 8411 | static int |
830bfa74 MM |
8412 | check_cv_quals_for_unify (strict, arg, parm) |
8413 | int strict; | |
8414 | tree arg; | |
8415 | tree parm; | |
8416 | { | |
62e4a758 | 8417 | if (!(strict & (UNIFY_ALLOW_MORE_CV_QUAL | UNIFY_ALLOW_OUTER_MORE_CV_QUAL)) |
ef637255 MM |
8418 | && !at_least_as_qualified_p (arg, parm)) |
8419 | return 0; | |
8420 | ||
62e4a758 | 8421 | if (!(strict & (UNIFY_ALLOW_LESS_CV_QUAL | UNIFY_ALLOW_OUTER_LESS_CV_QUAL)) |
ef637255 MM |
8422 | && !at_least_as_qualified_p (parm, arg)) |
8423 | return 0; | |
8424 | ||
ef637255 | 8425 | return 1; |
830bfa74 MM |
8426 | } |
8427 | ||
8428 | /* Takes parameters as for type_unification. Returns 0 if the | |
dc957d14 | 8429 | type deduction succeeds, 1 otherwise. The parameter STRICT is a |
830bfa74 MM |
8430 | bitwise or of the following flags: |
8431 | ||
8432 | UNIFY_ALLOW_NONE: | |
8433 | Require an exact match between PARM and ARG. | |
8434 | UNIFY_ALLOW_MORE_CV_QUAL: | |
028d1f20 NS |
8435 | Allow the deduced ARG to be more cv-qualified (by qualification |
8436 | conversion) than ARG. | |
830bfa74 MM |
8437 | UNIFY_ALLOW_LESS_CV_QUAL: |
8438 | Allow the deduced ARG to be less cv-qualified than ARG. | |
8439 | UNIFY_ALLOW_DERIVED: | |
8440 | Allow the deduced ARG to be a template base class of ARG, | |
8441 | or a pointer to a template base class of the type pointed to by | |
161c12b0 JM |
8442 | ARG. |
8443 | UNIFY_ALLOW_INTEGER: | |
8444 | Allow any integral type to be deduced. See the TEMPLATE_PARM_INDEX | |
028d1f20 NS |
8445 | case for more information. |
8446 | UNIFY_ALLOW_OUTER_LEVEL: | |
8447 | This is the outermost level of a deduction. Used to determine validity | |
8448 | of qualification conversions. A valid qualification conversion must | |
8449 | have const qualified pointers leading up to the inner type which | |
8450 | requires additional CV quals, except at the outer level, where const | |
8451 | is not required [conv.qual]. It would be normal to set this flag in | |
62e4a758 NS |
8452 | addition to setting UNIFY_ALLOW_MORE_CV_QUAL. |
8453 | UNIFY_ALLOW_OUTER_MORE_CV_QUAL: | |
8454 | This is the outermost level of a deduction, and PARM can be more CV | |
8455 | qualified at this point. | |
8456 | UNIFY_ALLOW_OUTER_LESS_CV_QUAL: | |
8457 | This is the outermost level of a deduction, and PARM can be less CV | |
8458 | qualified at this point. */ | |
830bfa74 | 8459 | |
e9659ab0 | 8460 | static int |
4393e105 | 8461 | unify (tparms, targs, parm, arg, strict) |
050367a3 | 8462 | tree tparms, targs, parm, arg; |
830bfa74 | 8463 | int strict; |
8d08fdba MS |
8464 | { |
8465 | int idx; | |
050367a3 | 8466 | tree targ; |
db2767b6 | 8467 | tree tparm; |
028d1f20 | 8468 | int strict_in = strict; |
8d08fdba MS |
8469 | |
8470 | /* I don't think this will do the right thing with respect to types. | |
8471 | But the only case I've seen it in so far has been array bounds, where | |
8472 | signedness is the only information lost, and I think that will be | |
8473 | okay. */ | |
8474 | while (TREE_CODE (parm) == NOP_EXPR) | |
8475 | parm = TREE_OPERAND (parm, 0); | |
8476 | ||
8477 | if (arg == error_mark_node) | |
8478 | return 1; | |
8479 | if (arg == unknown_type_node) | |
34016c81 JM |
8480 | /* We can't deduce anything from this, but we might get all the |
8481 | template args from other function args. */ | |
8482 | return 0; | |
8483 | ||
db2767b6 | 8484 | /* If PARM uses template parameters, then we can't bail out here, |
6bdb985f | 8485 | even if ARG == PARM, since we won't record unifications for the |
db2767b6 MM |
8486 | template parameters. We might need them if we're trying to |
8487 | figure out which of two things is more specialized. */ | |
8488 | if (arg == parm && !uses_template_parms (parm)) | |
8d08fdba MS |
8489 | return 0; |
8490 | ||
830bfa74 MM |
8491 | /* Immediately reject some pairs that won't unify because of |
8492 | cv-qualification mismatches. */ | |
8493 | if (TREE_CODE (arg) == TREE_CODE (parm) | |
2f939d94 | 8494 | && TYPE_P (arg) |
d0ab7624 NS |
8495 | /* It is the elements of the array which hold the cv quals of an array |
8496 | type, and the elements might be template type parms. We'll check | |
8497 | when we recurse. */ | |
8498 | && TREE_CODE (arg) != ARRAY_TYPE | |
830bfa74 MM |
8499 | /* We check the cv-qualifiers when unifying with template type |
8500 | parameters below. We want to allow ARG `const T' to unify with | |
8501 | PARM `T' for example, when computing which of two templates | |
8502 | is more specialized, for example. */ | |
8503 | && TREE_CODE (arg) != TEMPLATE_TYPE_PARM | |
028d1f20 | 8504 | && !check_cv_quals_for_unify (strict_in, arg, parm)) |
49432171 JM |
8505 | return 1; |
8506 | ||
028d1f20 | 8507 | if (!(strict & UNIFY_ALLOW_OUTER_LEVEL) |
3ea099f1 | 8508 | && TYPE_P (parm) && !CP_TYPE_CONST_P (parm)) |
028d1f20 NS |
8509 | strict &= ~UNIFY_ALLOW_MORE_CV_QUAL; |
8510 | strict &= ~UNIFY_ALLOW_OUTER_LEVEL; | |
8511 | strict &= ~UNIFY_ALLOW_DERIVED; | |
62e4a758 NS |
8512 | strict &= ~UNIFY_ALLOW_OUTER_MORE_CV_QUAL; |
8513 | strict &= ~UNIFY_ALLOW_OUTER_LESS_CV_QUAL; | |
028d1f20 | 8514 | |
8d08fdba MS |
8515 | switch (TREE_CODE (parm)) |
8516 | { | |
2ca340ae JM |
8517 | case TYPENAME_TYPE: |
8518 | /* In a type which contains a nested-name-specifier, template | |
8519 | argument values cannot be deduced for template parameters used | |
8520 | within the nested-name-specifier. */ | |
8521 | return 0; | |
8522 | ||
8d08fdba | 8523 | case TEMPLATE_TYPE_PARM: |
73b0fce8 | 8524 | case TEMPLATE_TEMPLATE_PARM: |
a1281f45 | 8525 | case BOUND_TEMPLATE_TEMPLATE_PARM: |
db2767b6 MM |
8526 | tparm = TREE_VALUE (TREE_VEC_ELT (tparms, 0)); |
8527 | ||
8528 | if (TEMPLATE_TYPE_LEVEL (parm) | |
8529 | != template_decl_level (tparm)) | |
8530 | /* The PARM is not one we're trying to unify. Just check | |
8531 | to see if it matches ARG. */ | |
8532 | return (TREE_CODE (arg) == TREE_CODE (parm) | |
3bfdc719 | 8533 | && same_type_p (parm, arg)) ? 0 : 1; |
73b0fce8 | 8534 | idx = TEMPLATE_TYPE_IDX (parm); |
050367a3 | 8535 | targ = TREE_VEC_ELT (targs, idx); |
db2767b6 | 8536 | tparm = TREE_VALUE (TREE_VEC_ELT (tparms, idx)); |
050367a3 | 8537 | |
73b0fce8 | 8538 | /* Check for mixed types and values. */ |
db2767b6 MM |
8539 | if ((TREE_CODE (parm) == TEMPLATE_TYPE_PARM |
8540 | && TREE_CODE (tparm) != TYPE_DECL) | |
8541 | || (TREE_CODE (parm) == TEMPLATE_TEMPLATE_PARM | |
8542 | && TREE_CODE (tparm) != TEMPLATE_DECL)) | |
73b0fce8 KL |
8543 | return 1; |
8544 | ||
a1281f45 | 8545 | if (TREE_CODE (parm) == BOUND_TEMPLATE_TEMPLATE_PARM) |
73b0fce8 | 8546 | { |
b429fdf0 KL |
8547 | /* ARG must be constructed from a template class or a template |
8548 | template parameter. */ | |
8549 | if (TREE_CODE (arg) != BOUND_TEMPLATE_TEMPLATE_PARM | |
8550 | && (TREE_CODE (arg) != RECORD_TYPE || !CLASSTYPE_TEMPLATE_INFO (arg))) | |
a1281f45 | 8551 | return 1; |
73b0fce8 | 8552 | |
a1281f45 KL |
8553 | { |
8554 | tree parmtmpl = TYPE_TI_TEMPLATE (parm); | |
8555 | tree parmvec = TYPE_TI_ARGS (parm); | |
b429fdf0 | 8556 | tree argvec = TYPE_TI_ARGS (arg); |
a1281f45 | 8557 | tree argtmplvec |
b429fdf0 | 8558 | = DECL_INNERMOST_TEMPLATE_PARMS (TYPE_TI_TEMPLATE (arg)); |
a1281f45 | 8559 | int i; |
73b0fce8 | 8560 | |
a1281f45 KL |
8561 | /* The parameter and argument roles have to be switched here |
8562 | in order to handle default arguments properly. For example, | |
8563 | template<template <class> class TT> void f(TT<int>) | |
8564 | should be able to accept vector<int> which comes from | |
8565 | template <class T, class Allocator = allocator> | |
8566 | class vector. */ | |
8567 | ||
8568 | if (coerce_template_parms (argtmplvec, parmvec, parmtmpl, 0, 1) | |
8569 | == error_mark_node) | |
8570 | return 1; | |
73b0fce8 | 8571 | |
a1281f45 KL |
8572 | /* Deduce arguments T, i from TT<T> or TT<i>. |
8573 | We check each element of PARMVEC and ARGVEC individually | |
8574 | rather than the whole TREE_VEC since they can have | |
8575 | different number of elements. */ | |
6b9b6b15 | 8576 | |
a1281f45 KL |
8577 | for (i = 0; i < TREE_VEC_LENGTH (parmvec); ++i) |
8578 | { | |
8579 | tree t = TREE_VEC_ELT (parmvec, i); | |
73b0fce8 | 8580 | |
a1281f45 KL |
8581 | if (unify (tparms, targs, t, |
8582 | TREE_VEC_ELT (argvec, i), | |
8583 | UNIFY_ALLOW_NONE)) | |
8584 | return 1; | |
73b0fce8 | 8585 | } |
a1281f45 | 8586 | } |
b429fdf0 | 8587 | arg = TYPE_TI_TEMPLATE (arg); |
a1281f45 KL |
8588 | |
8589 | /* Fall through to deduce template name. */ | |
8590 | } | |
8591 | ||
8592 | if (TREE_CODE (parm) == TEMPLATE_TEMPLATE_PARM | |
8593 | || TREE_CODE (parm) == BOUND_TEMPLATE_TEMPLATE_PARM) | |
8594 | { | |
8595 | /* Deduce template name TT from TT, TT<>, TT<T> and TT<i>. */ | |
8596 | ||
8597 | /* Simple cases: Value already set, does match or doesn't. */ | |
8598 | if (targ != NULL_TREE && template_args_equal (targ, arg)) | |
8599 | return 0; | |
8600 | else if (targ) | |
8601 | return 1; | |
db2767b6 MM |
8602 | } |
8603 | else | |
8604 | { | |
830bfa74 MM |
8605 | /* If PARM is `const T' and ARG is only `int', we don't have |
8606 | a match unless we are allowing additional qualification. | |
8607 | If ARG is `const int' and PARM is just `T' that's OK; | |
8608 | that binds `const int' to `T'. */ | |
028d1f20 | 8609 | if (!check_cv_quals_for_unify (strict_in | UNIFY_ALLOW_LESS_CV_QUAL, |
830bfa74 | 8610 | arg, parm)) |
db2767b6 MM |
8611 | return 1; |
8612 | ||
830bfa74 MM |
8613 | /* Consider the case where ARG is `const volatile int' and |
8614 | PARM is `const T'. Then, T should be `volatile int'. */ | |
8615 | arg = | |
adecb3f4 MM |
8616 | cp_build_qualified_type_real (arg, |
8617 | CP_TYPE_QUALS (arg) | |
8618 | & ~CP_TYPE_QUALS (parm), | |
8619 | /*complain=*/0); | |
8620 | if (arg == error_mark_node) | |
8621 | return 1; | |
73b0fce8 | 8622 | |
a1281f45 KL |
8623 | /* Simple cases: Value already set, does match or doesn't. */ |
8624 | if (targ != NULL_TREE && same_type_p (targ, arg)) | |
8625 | return 0; | |
8626 | else if (targ) | |
8627 | return 1; | |
8628 | } | |
61cd552e MM |
8629 | |
8630 | /* Make sure that ARG is not a variable-sized array. (Note that | |
8631 | were talking about variable-sized arrays (like `int[n]'), | |
8632 | rather than arrays of unknown size (like `int[]').) We'll | |
8633 | get very confused by such a type since the bound of the array | |
8634 | will not be computable in an instantiation. Besides, such | |
8635 | types are not allowed in ISO C++, so we can do as we please | |
8636 | here. */ | |
8637 | if (TREE_CODE (arg) == ARRAY_TYPE | |
8638 | && !uses_template_parms (arg) | |
34e225a3 | 8639 | && TYPE_DOMAIN (arg) |
61cd552e MM |
8640 | && (TREE_CODE (TYPE_MAX_VALUE (TYPE_DOMAIN (arg))) |
8641 | != INTEGER_CST)) | |
8642 | return 1; | |
8643 | ||
050367a3 | 8644 | TREE_VEC_ELT (targs, idx) = arg; |
73b0fce8 KL |
8645 | return 0; |
8646 | ||
f84b4be9 | 8647 | case TEMPLATE_PARM_INDEX: |
db2767b6 MM |
8648 | tparm = TREE_VALUE (TREE_VEC_ELT (tparms, 0)); |
8649 | ||
8650 | if (TEMPLATE_PARM_LEVEL (parm) | |
8651 | != template_decl_level (tparm)) | |
8652 | /* The PARM is not one we're trying to unify. Just check | |
8653 | to see if it matches ARG. */ | |
8654 | return (TREE_CODE (arg) == TREE_CODE (parm) | |
67ffc812 | 8655 | && cp_tree_equal (parm, arg) > 0) ? 0 : 1; |
db2767b6 | 8656 | |
f84b4be9 | 8657 | idx = TEMPLATE_PARM_IDX (parm); |
050367a3 | 8658 | targ = TREE_VEC_ELT (targs, idx); |
db2767b6 | 8659 | |
050367a3 | 8660 | if (targ) |
8d08fdba | 8661 | { |
67ffc812 | 8662 | int i = (cp_tree_equal (targ, arg) > 0); |
312e7d50 JM |
8663 | if (i == 1) |
8664 | return 0; | |
8665 | else if (i == 0) | |
8666 | return 1; | |
8667 | else | |
8668 | my_friendly_abort (42); | |
8d08fdba | 8669 | } |
8d08fdba | 8670 | |
161c12b0 JM |
8671 | /* [temp.deduct.type] If, in the declaration of a function template |
8672 | with a non-type template-parameter, the non-type | |
8673 | template-parameter is used in an expression in the function | |
8674 | parameter-list and, if the corresponding template-argument is | |
8675 | deduced, the template-argument type shall match the type of the | |
8676 | template-parameter exactly, except that a template-argument | |
d7c4edd0 NS |
8677 | deduced from an array bound may be of any integral type. |
8678 | The non-type parameter might use already deduced type parameters. */ | |
bd0d5d4a JM |
8679 | tparm = tsubst (TREE_TYPE (parm), targs, 0, NULL_TREE); |
8680 | if (same_type_p (TREE_TYPE (arg), tparm)) | |
8681 | /* OK */; | |
161c12b0 | 8682 | else if ((strict & UNIFY_ALLOW_INTEGER) |
bd0d5d4a JM |
8683 | && (TREE_CODE (tparm) == INTEGER_TYPE |
8684 | || TREE_CODE (tparm) == BOOLEAN_TYPE)) | |
161c12b0 | 8685 | /* OK */; |
bd0d5d4a JM |
8686 | else if (uses_template_parms (tparm)) |
8687 | /* We haven't deduced the type of this parameter yet. Try again | |
8688 | later. */ | |
8689 | return 0; | |
161c12b0 JM |
8690 | else |
8691 | return 1; | |
8692 | ||
2a1e9fdd | 8693 | TREE_VEC_ELT (targs, idx) = arg; |
8d08fdba MS |
8694 | return 0; |
8695 | ||
8696 | case POINTER_TYPE: | |
830bfa74 | 8697 | { |
830bfa74 MM |
8698 | if (TREE_CODE (arg) != POINTER_TYPE) |
8699 | return 1; | |
8700 | ||
8701 | /* [temp.deduct.call] | |
8702 | ||
8703 | A can be another pointer or pointer to member type that can | |
8704 | be converted to the deduced A via a qualification | |
8705 | conversion (_conv.qual_). | |
8706 | ||
8707 | We pass down STRICT here rather than UNIFY_ALLOW_NONE. | |
8708 | This will allow for additional cv-qualification of the | |
028d1f20 | 8709 | pointed-to types if appropriate. */ |
830bfa74 | 8710 | |
028d1f20 | 8711 | if (TREE_CODE (TREE_TYPE (arg)) == RECORD_TYPE) |
830bfa74 MM |
8712 | /* The derived-to-base conversion only persists through one |
8713 | level of pointers. */ | |
028d1f20 | 8714 | strict |= (strict_in & UNIFY_ALLOW_DERIVED); |
830bfa74 | 8715 | |
3ea099f1 JM |
8716 | if (TREE_CODE (TREE_TYPE (parm)) == OFFSET_TYPE |
8717 | && TREE_CODE (TREE_TYPE (arg)) == OFFSET_TYPE) | |
8718 | { | |
8719 | /* Avoid getting confused about cv-quals; don't recurse here. | |
8720 | Pointers to members should really be just OFFSET_TYPE, not | |
8721 | this two-level nonsense... */ | |
8722 | ||
8723 | parm = TREE_TYPE (parm); | |
8724 | arg = TREE_TYPE (arg); | |
8725 | goto offset; | |
8726 | } | |
8727 | ||
a7a64a77 | 8728 | return unify (tparms, targs, TREE_TYPE (parm), |
028d1f20 | 8729 | TREE_TYPE (arg), strict); |
830bfa74 | 8730 | } |
8d08fdba MS |
8731 | |
8732 | case REFERENCE_TYPE: | |
830bfa74 MM |
8733 | if (TREE_CODE (arg) != REFERENCE_TYPE) |
8734 | return 1; | |
8735 | return unify (tparms, targs, TREE_TYPE (parm), TREE_TYPE (arg), | |
028d1f20 | 8736 | strict & UNIFY_ALLOW_MORE_CV_QUAL); |
8d08fdba MS |
8737 | |
8738 | case ARRAY_TYPE: | |
8739 | if (TREE_CODE (arg) != ARRAY_TYPE) | |
8740 | return 1; | |
3042d5be MM |
8741 | if ((TYPE_DOMAIN (parm) == NULL_TREE) |
8742 | != (TYPE_DOMAIN (arg) == NULL_TREE)) | |
8743 | return 1; | |
8744 | if (TYPE_DOMAIN (parm) != NULL_TREE | |
830bfa74 | 8745 | && unify (tparms, targs, TYPE_DOMAIN (parm), |
4393e105 | 8746 | TYPE_DOMAIN (arg), UNIFY_ALLOW_NONE) != 0) |
8d08fdba | 8747 | return 1; |
830bfa74 | 8748 | return unify (tparms, targs, TREE_TYPE (parm), TREE_TYPE (arg), |
4393e105 | 8749 | UNIFY_ALLOW_NONE); |
8d08fdba MS |
8750 | |
8751 | case REAL_TYPE: | |
37c46b43 | 8752 | case COMPLEX_TYPE: |
c00996a3 | 8753 | case VECTOR_TYPE: |
8d08fdba | 8754 | case INTEGER_TYPE: |
42976354 | 8755 | case BOOLEAN_TYPE: |
5ad5a526 | 8756 | case VOID_TYPE: |
f376e137 MS |
8757 | if (TREE_CODE (arg) != TREE_CODE (parm)) |
8758 | return 1; | |
8759 | ||
514a1f18 JM |
8760 | if (TREE_CODE (parm) == INTEGER_TYPE |
8761 | && TREE_CODE (TYPE_MAX_VALUE (parm)) != INTEGER_CST) | |
8d08fdba MS |
8762 | { |
8763 | if (TYPE_MIN_VALUE (parm) && TYPE_MIN_VALUE (arg) | |
830bfa74 | 8764 | && unify (tparms, targs, TYPE_MIN_VALUE (parm), |
4393e105 | 8765 | TYPE_MIN_VALUE (arg), UNIFY_ALLOW_INTEGER)) |
8d08fdba MS |
8766 | return 1; |
8767 | if (TYPE_MAX_VALUE (parm) && TYPE_MAX_VALUE (arg) | |
830bfa74 | 8768 | && unify (tparms, targs, TYPE_MAX_VALUE (parm), |
4393e105 | 8769 | TYPE_MAX_VALUE (arg), UNIFY_ALLOW_INTEGER)) |
8d08fdba MS |
8770 | return 1; |
8771 | } | |
9edc3913 | 8772 | /* We have already checked cv-qualification at the top of the |
514a1f18 | 8773 | function. */ |
9edc3913 | 8774 | else if (!same_type_ignoring_top_level_qualifiers_p (arg, parm)) |
ca79f85d JM |
8775 | return 1; |
8776 | ||
8d08fdba MS |
8777 | /* As far as unification is concerned, this wins. Later checks |
8778 | will invalidate it if necessary. */ | |
8779 | return 0; | |
8780 | ||
8781 | /* Types INTEGER_CST and MINUS_EXPR can come from array bounds. */ | |
bd6dd845 | 8782 | /* Type INTEGER_CST can come from ordinary constant template args. */ |
8d08fdba | 8783 | case INTEGER_CST: |
bd6dd845 MS |
8784 | while (TREE_CODE (arg) == NOP_EXPR) |
8785 | arg = TREE_OPERAND (arg, 0); | |
8786 | ||
8d08fdba MS |
8787 | if (TREE_CODE (arg) != INTEGER_CST) |
8788 | return 1; | |
8789 | return !tree_int_cst_equal (parm, arg); | |
8790 | ||
8d08fdba MS |
8791 | case TREE_VEC: |
8792 | { | |
8793 | int i; | |
8794 | if (TREE_CODE (arg) != TREE_VEC) | |
8795 | return 1; | |
8796 | if (TREE_VEC_LENGTH (parm) != TREE_VEC_LENGTH (arg)) | |
8797 | return 1; | |
0dc09a61 | 8798 | for (i = 0; i < TREE_VEC_LENGTH (parm); ++i) |
830bfa74 | 8799 | if (unify (tparms, targs, |
8d08fdba | 8800 | TREE_VEC_ELT (parm, i), TREE_VEC_ELT (arg, i), |
4393e105 | 8801 | UNIFY_ALLOW_NONE)) |
8d08fdba MS |
8802 | return 1; |
8803 | return 0; | |
8804 | } | |
8805 | ||
8d08fdba | 8806 | case RECORD_TYPE: |
f181d4ae | 8807 | case UNION_TYPE: |
f181d4ae | 8808 | if (TREE_CODE (arg) != TREE_CODE (parm)) |
a4443a08 | 8809 | return 1; |
830bfa74 | 8810 | |
a7a64a77 MM |
8811 | if (TYPE_PTRMEMFUNC_P (parm)) |
8812 | { | |
8813 | if (!TYPE_PTRMEMFUNC_P (arg)) | |
8814 | return 1; | |
8815 | ||
8816 | return unify (tparms, targs, | |
8817 | TYPE_PTRMEMFUNC_FN_TYPE (parm), | |
8818 | TYPE_PTRMEMFUNC_FN_TYPE (arg), | |
8819 | strict); | |
8820 | } | |
8821 | ||
5db698f6 | 8822 | if (CLASSTYPE_TEMPLATE_INFO (parm)) |
5566b478 | 8823 | { |
6467930b | 8824 | tree t = NULL_TREE; |
4393e105 | 8825 | |
028d1f20 | 8826 | if (strict_in & UNIFY_ALLOW_DERIVED) |
4393e105 MM |
8827 | { |
8828 | /* First, we try to unify the PARM and ARG directly. */ | |
8829 | t = try_class_unification (tparms, targs, | |
8830 | parm, arg); | |
8831 | ||
8832 | if (!t) | |
8833 | { | |
8834 | /* Fallback to the special case allowed in | |
8835 | [temp.deduct.call]: | |
8836 | ||
8837 | If P is a class, and P has the form | |
8838 | template-id, then A can be a derived class of | |
8839 | the deduced A. Likewise, if P is a pointer to | |
8840 | a class of the form template-id, A can be a | |
8841 | pointer to a derived class pointed to by the | |
8842 | deduced A. */ | |
8843 | t = get_template_base (tparms, targs, | |
8844 | parm, arg); | |
8845 | ||
8846 | if (! t || t == error_mark_node) | |
8847 | return 1; | |
8848 | } | |
8849 | } | |
6df47b06 | 8850 | else if (CLASSTYPE_TEMPLATE_INFO (arg) |
9fbf56f7 MM |
8851 | && (CLASSTYPE_TI_TEMPLATE (parm) |
8852 | == CLASSTYPE_TI_TEMPLATE (arg))) | |
6df47b06 MM |
8853 | /* Perhaps PARM is something like S<U> and ARG is S<int>. |
8854 | Then, we should unify `int' and `U'. */ | |
6467930b | 8855 | t = arg; |
4393e105 | 8856 | else |
dc957d14 | 8857 | /* There's no chance of unification succeeding. */ |
5566b478 | 8858 | return 1; |
6467930b | 8859 | |
830bfa74 | 8860 | return unify (tparms, targs, CLASSTYPE_TI_ARGS (parm), |
4393e105 | 8861 | CLASSTYPE_TI_ARGS (t), UNIFY_ALLOW_NONE); |
5566b478 | 8862 | } |
9edc3913 | 8863 | else if (!same_type_ignoring_top_level_qualifiers_p (parm, arg)) |
5566b478 | 8864 | return 1; |
a4443a08 | 8865 | return 0; |
8d08fdba MS |
8866 | |
8867 | case METHOD_TYPE: | |
8d08fdba | 8868 | case FUNCTION_TYPE: |
830bfa74 | 8869 | if (TREE_CODE (arg) != TREE_CODE (parm)) |
8d08fdba | 8870 | return 1; |
830bfa74 MM |
8871 | |
8872 | if (unify (tparms, targs, TREE_TYPE (parm), | |
4393e105 | 8873 | TREE_TYPE (arg), UNIFY_ALLOW_NONE)) |
28cbf42c | 8874 | return 1; |
386b8a85 | 8875 | return type_unification_real (tparms, targs, TYPE_ARG_TYPES (parm), |
3b3ba9f0 | 8876 | TYPE_ARG_TYPES (arg), 1, |
e5214479 | 8877 | DEDUCE_EXACT, 0, -1); |
a4443a08 MS |
8878 | |
8879 | case OFFSET_TYPE: | |
3ea099f1 | 8880 | offset: |
a4443a08 MS |
8881 | if (TREE_CODE (arg) != OFFSET_TYPE) |
8882 | return 1; | |
830bfa74 | 8883 | if (unify (tparms, targs, TYPE_OFFSET_BASETYPE (parm), |
4393e105 | 8884 | TYPE_OFFSET_BASETYPE (arg), UNIFY_ALLOW_NONE)) |
a4443a08 | 8885 | return 1; |
830bfa74 | 8886 | return unify (tparms, targs, TREE_TYPE (parm), TREE_TYPE (arg), |
4393e105 | 8887 | strict); |
a4443a08 | 8888 | |
f62dbf03 | 8889 | case CONST_DECL: |
830bfa74 | 8890 | if (arg != decl_constant_value (parm)) |
f62dbf03 JM |
8891 | return 1; |
8892 | return 0; | |
8893 | ||
027905b4 KL |
8894 | case TEMPLATE_DECL: |
8895 | /* Matched cases are handled by the ARG == PARM test above. */ | |
8896 | return 1; | |
8897 | ||
53929c47 JM |
8898 | case MINUS_EXPR: |
8899 | if (TREE_CODE (TREE_OPERAND (parm, 1)) == INTEGER_CST) | |
8900 | { | |
8901 | /* We handle this case specially, since it comes up with | |
8902 | arrays. In particular, something like: | |
8903 | ||
8904 | template <int N> void f(int (&x)[N]); | |
8905 | ||
8906 | Here, we are trying to unify the range type, which | |
8907 | looks like [0 ... (N - 1)]. */ | |
8908 | tree t, t1, t2; | |
8909 | t1 = TREE_OPERAND (parm, 0); | |
8910 | t2 = TREE_OPERAND (parm, 1); | |
8911 | ||
24e2e58e | 8912 | t = fold (build (PLUS_EXPR, integer_type_node, arg, t2)); |
53929c47 | 8913 | |
4393e105 | 8914 | return unify (tparms, targs, t1, t, strict); |
53929c47 JM |
8915 | } |
8916 | /* else fall through */ | |
8917 | ||
8d08fdba | 8918 | default: |
050367a3 | 8919 | if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (parm)))) |
74601d7c KL |
8920 | { |
8921 | ||
8922 | /* We're looking at an expression. This can happen with | |
8923 | something like: | |
4393e105 | 8924 | |
74601d7c KL |
8925 | template <int I> |
8926 | void foo(S<I>, S<I + 2>); | |
050367a3 | 8927 | |
74601d7c | 8928 | This is a "nondeduced context": |
050367a3 | 8929 | |
74601d7c | 8930 | [deduct.type] |
4393e105 | 8931 | |
74601d7c | 8932 | The nondeduced contexts are: |
050367a3 | 8933 | |
74601d7c KL |
8934 | --A type that is a template-id in which one or more of |
8935 | the template-arguments is an expression that references | |
8936 | a template-parameter. | |
050367a3 | 8937 | |
74601d7c KL |
8938 | In these cases, we assume deduction succeeded, but don't |
8939 | actually infer any unifications. */ | |
8940 | ||
8941 | if (!uses_template_parms (parm) | |
8942 | && !template_args_equal (parm, arg)) | |
8943 | return 1; | |
8944 | else | |
8945 | return 0; | |
8946 | } | |
050367a3 | 8947 | else |
b4c4a9ec MM |
8948 | sorry ("use of `%s' in template type unification", |
8949 | tree_code_name [(int) TREE_CODE (parm)]); | |
050367a3 | 8950 | |
8d08fdba MS |
8951 | return 1; |
8952 | } | |
8953 | } | |
8d08fdba | 8954 | \f |
03d0f4af MM |
8955 | /* Called if RESULT is explicitly instantiated, or is a member of an |
8956 | explicitly instantiated class, or if using -frepo and the | |
8957 | instantiation of RESULT has been assigned to this file. */ | |
8958 | ||
faae18ab | 8959 | void |
5566b478 | 8960 | mark_decl_instantiated (result, extern_p) |
faae18ab MS |
8961 | tree result; |
8962 | int extern_p; | |
8963 | { | |
75650646 MM |
8964 | if (TREE_CODE (result) != FUNCTION_DECL) |
8965 | /* The TREE_PUBLIC flag for function declarations will have been | |
8966 | set correctly by tsubst. */ | |
8967 | TREE_PUBLIC (result) = 1; | |
faae18ab | 8968 | |
3ae18eaf JM |
8969 | /* We used to set this unconditionally; we moved that to |
8970 | do_decl_instantiation so it wouldn't get set on members of | |
8971 | explicit class template instantiations. But we still need to set | |
8972 | it here for the 'extern template' case in order to suppress | |
8973 | implicit instantiations. */ | |
8974 | if (extern_p) | |
8975 | SET_DECL_EXPLICIT_INSTANTIATION (result); | |
8976 | ||
faae18ab MS |
8977 | if (! extern_p) |
8978 | { | |
8979 | DECL_INTERFACE_KNOWN (result) = 1; | |
8980 | DECL_NOT_REALLY_EXTERN (result) = 1; | |
a7d87521 | 8981 | |
1a408d07 JM |
8982 | /* Always make artificials weak. */ |
8983 | if (DECL_ARTIFICIAL (result) && flag_weak) | |
8984 | comdat_linkage (result); | |
a7d87521 JM |
8985 | /* For WIN32 we also want to put explicit instantiations in |
8986 | linkonce sections. */ | |
1a408d07 | 8987 | else if (TREE_PUBLIC (result)) |
b385c841 | 8988 | maybe_make_one_only (result); |
faae18ab | 8989 | } |
f49422da | 8990 | else if (TREE_CODE (result) == FUNCTION_DECL) |
56e770bf | 8991 | defer_fn (result); |
faae18ab MS |
8992 | } |
8993 | ||
e5214479 | 8994 | /* Given two function templates PAT1 and PAT2, return: |
6467930b | 8995 | |
62e4a758 NS |
8996 | DEDUCE should be DEDUCE_EXACT or DEDUCE_ORDER. |
8997 | ||
6467930b MS |
8998 | 1 if PAT1 is more specialized than PAT2 as described in [temp.func.order]. |
8999 | -1 if PAT2 is more specialized than PAT1. | |
e5214479 JM |
9000 | 0 if neither is more specialized. |
9001 | ||
9002 | LEN is passed through to fn_type_unification. */ | |
6467930b MS |
9003 | |
9004 | int | |
62e4a758 | 9005 | more_specialized (pat1, pat2, deduce, len) |
e5214479 | 9006 | tree pat1, pat2; |
62e4a758 | 9007 | int deduce; |
e5214479 | 9008 | int len; |
6467930b | 9009 | { |
98c1c668 | 9010 | tree targs; |
73aad9b9 | 9011 | int winner = 0; |
6467930b | 9012 | |
62e4a758 NS |
9013 | targs = get_bindings_real (pat1, DECL_TEMPLATE_RESULT (pat2), |
9014 | NULL_TREE, 0, deduce, len); | |
73aad9b9 | 9015 | if (targs) |
36a117a5 | 9016 | --winner; |
6467930b | 9017 | |
62e4a758 NS |
9018 | targs = get_bindings_real (pat2, DECL_TEMPLATE_RESULT (pat1), |
9019 | NULL_TREE, 0, deduce, len); | |
73aad9b9 | 9020 | if (targs) |
36a117a5 | 9021 | ++winner; |
6467930b | 9022 | |
73aad9b9 JM |
9023 | return winner; |
9024 | } | |
6467930b | 9025 | |
73aad9b9 | 9026 | /* Given two class template specialization list nodes PAT1 and PAT2, return: |
6467930b | 9027 | |
73aad9b9 JM |
9028 | 1 if PAT1 is more specialized than PAT2 as described in [temp.class.order]. |
9029 | -1 if PAT2 is more specialized than PAT1. | |
9030 | 0 if neither is more specialized. */ | |
9031 | ||
9032 | int | |
9033 | more_specialized_class (pat1, pat2) | |
9034 | tree pat1, pat2; | |
9035 | { | |
9036 | tree targs; | |
9037 | int winner = 0; | |
9038 | ||
36a117a5 MM |
9039 | targs = get_class_bindings (TREE_VALUE (pat1), TREE_PURPOSE (pat1), |
9040 | TREE_PURPOSE (pat2)); | |
73aad9b9 JM |
9041 | if (targs) |
9042 | --winner; | |
9043 | ||
36a117a5 MM |
9044 | targs = get_class_bindings (TREE_VALUE (pat2), TREE_PURPOSE (pat2), |
9045 | TREE_PURPOSE (pat1)); | |
73aad9b9 | 9046 | if (targs) |
6467930b MS |
9047 | ++winner; |
9048 | ||
9049 | return winner; | |
9050 | } | |
73aad9b9 JM |
9051 | |
9052 | /* Return the template arguments that will produce the function signature | |
e1467ff2 | 9053 | DECL from the function template FN, with the explicit template |
76b9a14d | 9054 | arguments EXPLICIT_ARGS. If CHECK_RETTYPE is 1, the return type must |
4393e105 | 9055 | also match. Return NULL_TREE if no satisfactory arguments could be |
62e4a758 | 9056 | found. DEDUCE and LEN are passed through to fn_type_unification. */ |
e5214479 | 9057 | |
76b9a14d | 9058 | static tree |
62e4a758 | 9059 | get_bindings_real (fn, decl, explicit_args, check_rettype, deduce, len) |
e1467ff2 | 9060 | tree fn, decl, explicit_args; |
62e4a758 | 9061 | int check_rettype, deduce, len; |
73aad9b9 | 9062 | { |
98c1c668 | 9063 | int ntparms = DECL_NTPARMS (fn); |
f31c0a32 | 9064 | tree targs = make_tree_vec (ntparms); |
4393e105 | 9065 | tree decl_type; |
03017874 | 9066 | tree decl_arg_types; |
98c1c668 JM |
9067 | int i; |
9068 | ||
4393e105 MM |
9069 | /* Substitute the explicit template arguments into the type of DECL. |
9070 | The call to fn_type_unification will handle substitution into the | |
9071 | FN. */ | |
9072 | decl_type = TREE_TYPE (decl); | |
9073 | if (explicit_args && uses_template_parms (decl_type)) | |
9074 | { | |
9075 | tree tmpl; | |
9076 | tree converted_args; | |
9077 | ||
9078 | if (DECL_TEMPLATE_INFO (decl)) | |
9079 | tmpl = DECL_TI_TEMPLATE (decl); | |
9080 | else | |
9081 | /* We can get here for some illegal specializations. */ | |
9082 | return NULL_TREE; | |
9083 | ||
9084 | converted_args | |
9085 | = (coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl), | |
9086 | explicit_args, NULL_TREE, | |
9087 | /*complain=*/0, | |
9088 | /*require_all_arguments=*/0)); | |
9089 | if (converted_args == error_mark_node) | |
9090 | return NULL_TREE; | |
9091 | ||
9092 | decl_type = tsubst (decl_type, converted_args, /*complain=*/0, | |
9093 | NULL_TREE); | |
9094 | if (decl_type == error_mark_node) | |
9095 | return NULL_TREE; | |
9096 | } | |
9097 | ||
9098 | decl_arg_types = TYPE_ARG_TYPES (decl_type); | |
e5214479 JM |
9099 | /* Never do unification on the 'this' parameter. */ |
9100 | if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl)) | |
03017874 | 9101 | decl_arg_types = TREE_CHAIN (decl_arg_types); |
d7684f2d | 9102 | |
e1467ff2 | 9103 | i = fn_type_unification (fn, explicit_args, targs, |
03017874 | 9104 | decl_arg_types, |
8d3631f8 NS |
9105 | (check_rettype || DECL_CONV_FN_P (fn) |
9106 | ? TREE_TYPE (decl_type) : NULL_TREE), | |
62e4a758 | 9107 | deduce, len); |
98c1c668 | 9108 | |
76b9a14d JM |
9109 | if (i != 0) |
9110 | return NULL_TREE; | |
9111 | ||
76b9a14d JM |
9112 | return targs; |
9113 | } | |
9114 | ||
9115 | /* For most uses, we want to check the return type. */ | |
9116 | ||
9117 | tree | |
9118 | get_bindings (fn, decl, explicit_args) | |
9119 | tree fn, decl, explicit_args; | |
9120 | { | |
62e4a758 | 9121 | return get_bindings_real (fn, decl, explicit_args, 1, DEDUCE_EXACT, -1); |
76b9a14d JM |
9122 | } |
9123 | ||
e5214479 JM |
9124 | /* But for resolve_overloaded_unification, we only care about the parameter |
9125 | types. */ | |
76b9a14d JM |
9126 | |
9127 | static tree | |
9128 | get_bindings_overload (fn, decl, explicit_args) | |
9129 | tree fn, decl, explicit_args; | |
9130 | { | |
62e4a758 | 9131 | return get_bindings_real (fn, decl, explicit_args, 0, DEDUCE_EXACT, -1); |
73aad9b9 JM |
9132 | } |
9133 | ||
36a117a5 MM |
9134 | /* Return the innermost template arguments that, when applied to a |
9135 | template specialization whose innermost template parameters are | |
9136 | TPARMS, and whose specialization arguments are ARGS, yield the | |
9137 | ARGS. | |
9138 | ||
9139 | For example, suppose we have: | |
9140 | ||
9141 | template <class T, class U> struct S {}; | |
9142 | template <class T> struct S<T*, int> {}; | |
9143 | ||
9144 | Then, suppose we want to get `S<double*, int>'. The TPARMS will be | |
9145 | {T}, the PARMS will be {T*, int} and the ARGS will be {double*, | |
9146 | int}. The resulting vector will be {double}, indicating that `T' | |
9147 | is bound to `double'. */ | |
9148 | ||
bd6dd845 | 9149 | static tree |
36a117a5 MM |
9150 | get_class_bindings (tparms, parms, args) |
9151 | tree tparms, parms, args; | |
73aad9b9 | 9152 | { |
3b3ba9f0 | 9153 | int i, ntparms = TREE_VEC_LENGTH (tparms); |
f31c0a32 | 9154 | tree vec = make_tree_vec (ntparms); |
73aad9b9 | 9155 | |
74601d7c KL |
9156 | if (unify (tparms, vec, parms, INNERMOST_TEMPLATE_ARGS (args), |
9157 | UNIFY_ALLOW_NONE)) | |
fcfb9f96 | 9158 | return NULL_TREE; |
73aad9b9 JM |
9159 | |
9160 | for (i = 0; i < ntparms; ++i) | |
9161 | if (! TREE_VEC_ELT (vec, i)) | |
9162 | return NULL_TREE; | |
9163 | ||
74601d7c KL |
9164 | if (verify_class_unification (vec, parms, args)) |
9165 | return NULL_TREE; | |
9166 | ||
73aad9b9 JM |
9167 | return vec; |
9168 | } | |
9169 | ||
104bf76a MM |
9170 | /* In INSTANTIATIONS is a list of <INSTANTIATION, TEMPLATE> pairs. |
9171 | Pick the most specialized template, and return the corresponding | |
9172 | instantiation, or if there is no corresponding instantiation, the | |
e5214479 JM |
9173 | template itself. If there is no most specialized template, |
9174 | error_mark_node is returned. If there are no templates at all, | |
9175 | NULL_TREE is returned. */ | |
73aad9b9 JM |
9176 | |
9177 | tree | |
e5214479 | 9178 | most_specialized_instantiation (instantiations) |
104bf76a | 9179 | tree instantiations; |
73aad9b9 | 9180 | { |
104bf76a | 9181 | tree fn, champ; |
73aad9b9 JM |
9182 | int fate; |
9183 | ||
104bf76a | 9184 | if (!instantiations) |
73aad9b9 JM |
9185 | return NULL_TREE; |
9186 | ||
104bf76a MM |
9187 | champ = instantiations; |
9188 | for (fn = TREE_CHAIN (instantiations); fn; fn = TREE_CHAIN (fn)) | |
73aad9b9 | 9189 | { |
62e4a758 NS |
9190 | fate = more_specialized (TREE_VALUE (champ), TREE_VALUE (fn), |
9191 | DEDUCE_EXACT, -1); | |
73aad9b9 JM |
9192 | if (fate == 1) |
9193 | ; | |
9194 | else | |
9195 | { | |
9196 | if (fate == 0) | |
9197 | { | |
9198 | fn = TREE_CHAIN (fn); | |
9199 | if (! fn) | |
9200 | return error_mark_node; | |
9201 | } | |
104bf76a | 9202 | champ = fn; |
73aad9b9 JM |
9203 | } |
9204 | } | |
9205 | ||
104bf76a | 9206 | for (fn = instantiations; fn && fn != champ; fn = TREE_CHAIN (fn)) |
73aad9b9 | 9207 | { |
62e4a758 NS |
9208 | fate = more_specialized (TREE_VALUE (champ), TREE_VALUE (fn), |
9209 | DEDUCE_EXACT, -1); | |
73aad9b9 JM |
9210 | if (fate != 1) |
9211 | return error_mark_node; | |
9212 | } | |
9213 | ||
104bf76a MM |
9214 | return TREE_PURPOSE (champ) ? TREE_PURPOSE (champ) : TREE_VALUE (champ); |
9215 | } | |
9216 | ||
9217 | /* Return the most specialized of the list of templates in FNS that can | |
9218 | produce an instantiation matching DECL, given the explicit template | |
9219 | arguments EXPLICIT_ARGS. */ | |
9220 | ||
e9659ab0 | 9221 | static tree |
104bf76a MM |
9222 | most_specialized (fns, decl, explicit_args) |
9223 | tree fns, decl, explicit_args; | |
9224 | { | |
9225 | tree candidates = NULL_TREE; | |
9226 | tree fn, args; | |
9227 | ||
9228 | for (fn = fns; fn; fn = TREE_CHAIN (fn)) | |
9229 | { | |
9230 | tree candidate = TREE_VALUE (fn); | |
9231 | ||
9232 | args = get_bindings (candidate, decl, explicit_args); | |
9233 | if (args) | |
e1b3e07d | 9234 | candidates = tree_cons (NULL_TREE, candidate, candidates); |
104bf76a MM |
9235 | } |
9236 | ||
e5214479 | 9237 | return most_specialized_instantiation (candidates); |
73aad9b9 JM |
9238 | } |
9239 | ||
36a117a5 | 9240 | /* If DECL is a specialization of some template, return the most |
f9a7ae04 MM |
9241 | general such template. Otherwise, returns NULL_TREE. |
9242 | ||
9243 | For example, given: | |
36a117a5 MM |
9244 | |
9245 | template <class T> struct S { template <class U> void f(U); }; | |
9246 | ||
9247 | if TMPL is `template <class U> void S<int>::f(U)' this will return | |
9248 | the full template. This function will not trace past partial | |
9249 | specializations, however. For example, given in addition: | |
9250 | ||
9251 | template <class T> struct S<T*> { template <class U> void f(U); }; | |
9252 | ||
9253 | if TMPL is `template <class U> void S<int*>::f(U)' this will return | |
9254 | `template <class T> template <class U> S<T*>::f(U)'. */ | |
73aad9b9 | 9255 | |
612c671a | 9256 | tree |
36a117a5 MM |
9257 | most_general_template (decl) |
9258 | tree decl; | |
73aad9b9 | 9259 | { |
f9a7ae04 MM |
9260 | /* If DECL is a FUNCTION_DECL, find the TEMPLATE_DECL of which it is |
9261 | an immediate specialization. */ | |
9262 | if (TREE_CODE (decl) == FUNCTION_DECL) | |
9263 | { | |
9264 | if (DECL_TEMPLATE_INFO (decl)) { | |
9265 | decl = DECL_TI_TEMPLATE (decl); | |
9266 | ||
9267 | /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE for a | |
9268 | template friend. */ | |
9269 | if (TREE_CODE (decl) != TEMPLATE_DECL) | |
9270 | return NULL_TREE; | |
9271 | } else | |
9272 | return NULL_TREE; | |
9273 | } | |
9274 | ||
9275 | /* Look for more and more general templates. */ | |
9276 | while (DECL_TEMPLATE_INFO (decl)) | |
9277 | { | |
9278 | /* The DECL_TI_TEMPLATE can be a LOOKUP_EXPR or IDENTIFIER_NODE | |
9279 | in some cases. (See cp-tree.h for details.) */ | |
9280 | if (TREE_CODE (DECL_TI_TEMPLATE (decl)) != TEMPLATE_DECL) | |
9281 | break; | |
9282 | ||
9283 | /* Stop if we run into an explicitly specialized class template. */ | |
9284 | if (!DECL_NAMESPACE_SCOPE_P (decl) | |
9285 | && DECL_CONTEXT (decl) | |
9286 | && CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (decl))) | |
9287 | break; | |
9288 | ||
9289 | decl = DECL_TI_TEMPLATE (decl); | |
9290 | } | |
36a117a5 MM |
9291 | |
9292 | return decl; | |
9293 | } | |
9294 | ||
9295 | /* Return the most specialized of the class template specializations | |
9296 | of TMPL which can produce an instantiation matching ARGS, or | |
9297 | error_mark_node if the choice is ambiguous. */ | |
9298 | ||
e9659ab0 | 9299 | static tree |
36a117a5 MM |
9300 | most_specialized_class (tmpl, args) |
9301 | tree tmpl; | |
9302 | tree args; | |
9303 | { | |
9304 | tree list = NULL_TREE; | |
9305 | tree t; | |
9306 | tree champ; | |
73aad9b9 JM |
9307 | int fate; |
9308 | ||
36a117a5 MM |
9309 | tmpl = most_general_template (tmpl); |
9310 | for (t = DECL_TEMPLATE_SPECIALIZATIONS (tmpl); t; t = TREE_CHAIN (t)) | |
73aad9b9 | 9311 | { |
36a117a5 MM |
9312 | tree spec_args |
9313 | = get_class_bindings (TREE_VALUE (t), TREE_PURPOSE (t), args); | |
9314 | if (spec_args) | |
73aad9b9 | 9315 | { |
1f8f4a0b | 9316 | list = tree_cons (TREE_PURPOSE (t), TREE_VALUE (t), list); |
73aad9b9 JM |
9317 | TREE_TYPE (list) = TREE_TYPE (t); |
9318 | } | |
9319 | } | |
9320 | ||
9321 | if (! list) | |
9322 | return NULL_TREE; | |
9323 | ||
9324 | t = list; | |
9325 | champ = t; | |
9326 | t = TREE_CHAIN (t); | |
9327 | for (; t; t = TREE_CHAIN (t)) | |
9328 | { | |
9329 | fate = more_specialized_class (champ, t); | |
9330 | if (fate == 1) | |
9331 | ; | |
9332 | else | |
9333 | { | |
9334 | if (fate == 0) | |
9335 | { | |
9336 | t = TREE_CHAIN (t); | |
9337 | if (! t) | |
9338 | return error_mark_node; | |
9339 | } | |
9340 | champ = t; | |
9341 | } | |
9342 | } | |
9343 | ||
9344 | for (t = list; t && t != champ; t = TREE_CHAIN (t)) | |
9345 | { | |
85b71cf2 | 9346 | fate = more_specialized_class (champ, t); |
73aad9b9 JM |
9347 | if (fate != 1) |
9348 | return error_mark_node; | |
9349 | } | |
9350 | ||
9351 | return champ; | |
9352 | } | |
9353 | ||
8d08fdba | 9354 | /* called from the parser. */ |
e92cc029 | 9355 | |
8d08fdba | 9356 | void |
6633d636 | 9357 | do_decl_instantiation (declspecs, declarator, storage) |
f0e01782 | 9358 | tree declspecs, declarator, storage; |
8d08fdba | 9359 | { |
c11b6f21 | 9360 | tree decl = grokdeclarator (declarator, declspecs, NORMAL, 0, NULL_TREE); |
8d08fdba | 9361 | tree result = NULL_TREE; |
faae18ab | 9362 | int extern_p = 0; |
e8abc66f | 9363 | |
3fa56191 | 9364 | if (!decl) |
dc957d14 | 9365 | /* An error occurred, for which grokdeclarator has already issued |
3fa56191 MM |
9366 | an appropriate message. */ |
9367 | return; | |
9368 | else if (! DECL_LANG_SPECIFIC (decl)) | |
ec255269 | 9369 | { |
8251199e | 9370 | cp_error ("explicit instantiation of non-template `%#D'", decl); |
ec255269 MS |
9371 | return; |
9372 | } | |
03d0f4af | 9373 | else if (TREE_CODE (decl) == VAR_DECL) |
6633d636 | 9374 | { |
03d0f4af MM |
9375 | /* There is an asymmetry here in the way VAR_DECLs and |
9376 | FUNCTION_DECLs are handled by grokdeclarator. In the case of | |
9377 | the latter, the DECL we get back will be marked as a | |
9378 | template instantiation, and the appropriate | |
9379 | DECL_TEMPLATE_INFO will be set up. This does not happen for | |
9380 | VAR_DECLs so we do the lookup here. Probably, grokdeclarator | |
9381 | should handle VAR_DECLs as it currently handles | |
9382 | FUNCTION_DECLs. */ | |
6633d636 MS |
9383 | result = lookup_field (DECL_CONTEXT (decl), DECL_NAME (decl), 0, 0); |
9384 | if (result && TREE_CODE (result) != VAR_DECL) | |
03d0f4af | 9385 | { |
8251199e | 9386 | cp_error ("no matching template for `%D' found", result); |
03d0f4af MM |
9387 | return; |
9388 | } | |
6633d636 MS |
9389 | } |
9390 | else if (TREE_CODE (decl) != FUNCTION_DECL) | |
9391 | { | |
8251199e | 9392 | cp_error ("explicit instantiation of `%#D'", decl); |
6633d636 MS |
9393 | return; |
9394 | } | |
03d0f4af MM |
9395 | else |
9396 | result = decl; | |
672476cb | 9397 | |
03d0f4af MM |
9398 | /* Check for various error cases. Note that if the explicit |
9399 | instantiation is legal the RESULT will currently be marked as an | |
9400 | *implicit* instantiation; DECL_EXPLICIT_INSTANTIATION is not set | |
9401 | until we get here. */ | |
9402 | ||
9403 | if (DECL_TEMPLATE_SPECIALIZATION (result)) | |
672476cb | 9404 | { |
03d0f4af MM |
9405 | /* [temp.spec] |
9406 | ||
9407 | No program shall both explicitly instantiate and explicitly | |
9408 | specialize a template. */ | |
6f1b4c42 JM |
9409 | cp_pedwarn ("explicit instantiation of `%#D' after", result); |
9410 | cp_pedwarn_at ("explicit specialization here", result); | |
672476cb MM |
9411 | return; |
9412 | } | |
03d0f4af MM |
9413 | else if (DECL_EXPLICIT_INSTANTIATION (result)) |
9414 | { | |
9415 | /* [temp.spec] | |
98c1c668 | 9416 | |
03d0f4af MM |
9417 | No program shall explicitly instantiate any template more |
9418 | than once. | |
9419 | ||
2aaf816d JM |
9420 | We check DECL_INTERFACE_KNOWN so as not to complain when the first |
9421 | instantiation was `extern' and the second is not, and EXTERN_P for | |
9422 | the opposite case. If -frepo, chances are we already got marked | |
dc957d14 | 9423 | as an explicit instantiation because of the repo file. */ |
2aaf816d | 9424 | if (DECL_INTERFACE_KNOWN (result) && !extern_p && !flag_use_repository) |
6f1b4c42 | 9425 | cp_pedwarn ("duplicate explicit instantiation of `%#D'", result); |
03d0f4af MM |
9426 | |
9427 | /* If we've already instantiated the template, just return now. */ | |
9428 | if (DECL_INTERFACE_KNOWN (result)) | |
9429 | return; | |
9430 | } | |
9431 | else if (!DECL_IMPLICIT_INSTANTIATION (result)) | |
faae18ab | 9432 | { |
8251199e | 9433 | cp_error ("no matching template for `%D' found", result); |
faae18ab MS |
9434 | return; |
9435 | } | |
03d0f4af | 9436 | else if (!DECL_TEMPLATE_INFO (result)) |
6633d636 | 9437 | { |
8251199e | 9438 | cp_pedwarn ("explicit instantiation of non-template `%#D'", result); |
6633d636 MS |
9439 | return; |
9440 | } | |
9441 | ||
a0a33927 MS |
9442 | if (flag_external_templates) |
9443 | return; | |
9444 | ||
f0e01782 | 9445 | if (storage == NULL_TREE) |
00595019 | 9446 | ; |
faae18ab | 9447 | else if (storage == ridpointers[(int) RID_EXTERN]) |
03d0f4af MM |
9448 | { |
9449 | if (pedantic) | |
cab1f180 | 9450 | cp_pedwarn ("ISO C++ forbids the use of `extern' on explicit instantiations"); |
03d0f4af MM |
9451 | extern_p = 1; |
9452 | } | |
f0e01782 | 9453 | else |
8251199e | 9454 | cp_error ("storage class `%D' applied to template instantiation", |
f0e01782 | 9455 | storage); |
5566b478 | 9456 | |
03d0f4af | 9457 | SET_DECL_EXPLICIT_INSTANTIATION (result); |
5566b478 | 9458 | mark_decl_instantiated (result, extern_p); |
44a8d0b3 | 9459 | repo_template_instantiated (result, extern_p); |
c91a56d2 | 9460 | if (! extern_p) |
16d53b64 | 9461 | instantiate_decl (result, /*defer_ok=*/1); |
7177d104 MS |
9462 | } |
9463 | ||
faae18ab MS |
9464 | void |
9465 | mark_class_instantiated (t, extern_p) | |
9466 | tree t; | |
9467 | int extern_p; | |
9468 | { | |
9469 | SET_CLASSTYPE_EXPLICIT_INSTANTIATION (t); | |
eb773359 JM |
9470 | SET_CLASSTYPE_INTERFACE_KNOWN (t); |
9471 | CLASSTYPE_INTERFACE_ONLY (t) = extern_p; | |
faae18ab MS |
9472 | TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (t)) = extern_p; |
9473 | if (! extern_p) | |
9474 | { | |
9475 | CLASSTYPE_DEBUG_REQUESTED (t) = 1; | |
9476 | rest_of_type_compilation (t, 1); | |
9477 | } | |
9478 | } | |
e8abc66f | 9479 | |
a1bcc528 JM |
9480 | /* Perform an explicit instantiation of template class T. STORAGE, if |
9481 | non-null, is the RID for extern, inline or static. COMPLAIN is | |
9482 | non-zero if this is called from the parser, zero if called recursively, | |
9483 | since the standard is unclear (as detailed below). */ | |
9484 | ||
7177d104 | 9485 | void |
a1bcc528 | 9486 | do_type_instantiation (t, storage, complain) |
ca79f85d | 9487 | tree t, storage; |
a1bcc528 | 9488 | int complain; |
7177d104 | 9489 | { |
e8abc66f MS |
9490 | int extern_p = 0; |
9491 | int nomem_p = 0; | |
5566b478 MS |
9492 | int static_p = 0; |
9493 | ||
ca79f85d JM |
9494 | if (TREE_CODE (t) == TYPE_DECL) |
9495 | t = TREE_TYPE (t); | |
9496 | ||
7ddedda4 | 9497 | if (! CLASS_TYPE_P (t) || ! CLASSTYPE_TEMPLATE_INFO (t)) |
ca79f85d | 9498 | { |
8251199e | 9499 | cp_error ("explicit instantiation of non-template type `%T'", t); |
ca79f85d JM |
9500 | return; |
9501 | } | |
9502 | ||
5566b478 | 9503 | complete_type (t); |
7177d104 | 9504 | |
a292b002 MS |
9505 | /* With -fexternal-templates, explicit instantiations are treated the same |
9506 | as implicit ones. */ | |
a0a33927 MS |
9507 | if (flag_external_templates) |
9508 | return; | |
9509 | ||
d0f062fb | 9510 | if (!COMPLETE_TYPE_P (t)) |
f0e01782 | 9511 | { |
a1bcc528 JM |
9512 | if (complain) |
9513 | cp_error ("explicit instantiation of `%#T' before definition of template", | |
9514 | t); | |
f0e01782 MS |
9515 | return; |
9516 | } | |
9517 | ||
03d0f4af | 9518 | if (storage != NULL_TREE) |
f0e01782 | 9519 | { |
03d0f4af | 9520 | if (pedantic) |
cab1f180 | 9521 | cp_pedwarn("ISO C++ forbids the use of `%s' on explicit instantiations", |
8251199e | 9522 | IDENTIFIER_POINTER (storage)); |
03d0f4af MM |
9523 | |
9524 | if (storage == ridpointers[(int) RID_INLINE]) | |
9525 | nomem_p = 1; | |
9526 | else if (storage == ridpointers[(int) RID_EXTERN]) | |
9527 | extern_p = 1; | |
9528 | else if (storage == ridpointers[(int) RID_STATIC]) | |
9529 | static_p = 1; | |
9530 | else | |
9531 | { | |
8251199e | 9532 | cp_error ("storage class `%D' applied to template instantiation", |
03d0f4af MM |
9533 | storage); |
9534 | extern_p = 0; | |
9535 | } | |
f0e01782 MS |
9536 | } |
9537 | ||
370af2d5 | 9538 | if (CLASSTYPE_TEMPLATE_SPECIALIZATION (t)) |
03d0f4af MM |
9539 | { |
9540 | /* [temp.spec] | |
a292b002 | 9541 | |
03d0f4af MM |
9542 | No program shall both explicitly instantiate and explicitly |
9543 | specialize a template. */ | |
a1bcc528 JM |
9544 | if (complain) |
9545 | { | |
9546 | cp_error ("explicit instantiation of `%#T' after", t); | |
9547 | cp_error_at ("explicit specialization here", t); | |
9548 | } | |
03d0f4af MM |
9549 | return; |
9550 | } | |
9551 | else if (CLASSTYPE_EXPLICIT_INSTANTIATION (t)) | |
44a8d0b3 | 9552 | { |
03d0f4af MM |
9553 | /* [temp.spec] |
9554 | ||
9555 | No program shall explicitly instantiate any template more | |
9556 | than once. | |
9557 | ||
2aaf816d JM |
9558 | If CLASSTYPE_INTERFACE_ONLY, then the first explicit instantiation |
9559 | was `extern'. If EXTERN_P then the second is. If -frepo, chances | |
9560 | are we already got marked as an explicit instantion because of the | |
9561 | repo file. All these cases are OK. */ | |
a1bcc528 JM |
9562 | if (!CLASSTYPE_INTERFACE_ONLY (t) && !extern_p && !flag_use_repository |
9563 | && complain) | |
2aaf816d | 9564 | cp_pedwarn ("duplicate explicit instantiation of `%#T'", t); |
03d0f4af MM |
9565 | |
9566 | /* If we've already instantiated the template, just return now. */ | |
9567 | if (!CLASSTYPE_INTERFACE_ONLY (t)) | |
9568 | return; | |
44a8d0b3 | 9569 | } |
e8abc66f | 9570 | |
03d0f4af MM |
9571 | mark_class_instantiated (t, extern_p); |
9572 | repo_template_instantiated (t, extern_p); | |
9573 | ||
e8abc66f MS |
9574 | if (nomem_p) |
9575 | return; | |
9576 | ||
7177d104 | 9577 | { |
db5ae43f | 9578 | tree tmp; |
5566b478 | 9579 | |
03d0f4af MM |
9580 | /* In contrast to implicit instantiation, where only the |
9581 | declarations, and not the definitions, of members are | |
9582 | instantiated, we have here: | |
9583 | ||
9584 | [temp.explicit] | |
9585 | ||
9586 | The explicit instantiation of a class template specialization | |
9587 | implies the instantiation of all of its members not | |
9588 | previously explicitly specialized in the translation unit | |
9589 | containing the explicit instantiation. | |
9590 | ||
9591 | Of course, we can't instantiate member template classes, since | |
9592 | we don't have any arguments for them. Note that the standard | |
dc957d14 | 9593 | is unclear on whether the instantiation of the members are |
03d0f4af MM |
9594 | *explicit* instantiations or not. We choose to be generous, |
9595 | and not set DECL_EXPLICIT_INSTANTIATION. Therefore, we allow | |
9596 | the explicit instantiation of a class where some of the members | |
9597 | have no definition in the current translation unit. */ | |
9598 | ||
5566b478 MS |
9599 | if (! static_p) |
9600 | for (tmp = TYPE_METHODS (t); tmp; tmp = TREE_CHAIN (tmp)) | |
a7d87521 | 9601 | if (TREE_CODE (tmp) == FUNCTION_DECL |
1f109f0f | 9602 | && DECL_TEMPLATE_INSTANTIATION (tmp)) |
5566b478 MS |
9603 | { |
9604 | mark_decl_instantiated (tmp, extern_p); | |
9605 | repo_template_instantiated (tmp, extern_p); | |
9606 | if (! extern_p) | |
16d53b64 | 9607 | instantiate_decl (tmp, /*defer_ok=*/1); |
5566b478 MS |
9608 | } |
9609 | ||
9610 | for (tmp = TYPE_FIELDS (t); tmp; tmp = TREE_CHAIN (tmp)) | |
9611 | if (TREE_CODE (tmp) == VAR_DECL && DECL_TEMPLATE_INSTANTIATION (tmp)) | |
863adfc0 | 9612 | { |
5566b478 | 9613 | mark_decl_instantiated (tmp, extern_p); |
863adfc0 | 9614 | repo_template_instantiated (tmp, extern_p); |
5566b478 | 9615 | if (! extern_p) |
16d53b64 | 9616 | instantiate_decl (tmp, /*defer_ok=*/1); |
863adfc0 | 9617 | } |
7177d104 | 9618 | |
a292b002 | 9619 | for (tmp = CLASSTYPE_TAGS (t); tmp; tmp = TREE_CHAIN (tmp)) |
e4a84209 MM |
9620 | if (IS_AGGR_TYPE (TREE_VALUE (tmp)) |
9621 | && !uses_template_parms (CLASSTYPE_TI_ARGS (TREE_VALUE (tmp)))) | |
a1bcc528 | 9622 | do_type_instantiation (TYPE_MAIN_DECL (TREE_VALUE (tmp)), storage, 0); |
a292b002 | 9623 | } |
8d08fdba | 9624 | } |
a28e3c7f | 9625 | |
36a117a5 MM |
9626 | /* Given a function DECL, which is a specialization of TMPL, modify |
9627 | DECL to be a re-instantiation of TMPL with the same template | |
9628 | arguments. TMPL should be the template into which tsubst'ing | |
9629 | should occur for DECL, not the most general template. | |
830bfa74 MM |
9630 | |
9631 | One reason for doing this is a scenario like this: | |
9632 | ||
9633 | template <class T> | |
9634 | void f(const T&, int i); | |
9635 | ||
9636 | void g() { f(3, 7); } | |
9637 | ||
9638 | template <class T> | |
9639 | void f(const T& t, const int i) { } | |
9640 | ||
9641 | Note that when the template is first instantiated, with | |
9642 | instantiate_template, the resulting DECL will have no name for the | |
9643 | first parameter, and the wrong type for the second. So, when we go | |
9644 | to instantiate the DECL, we regenerate it. */ | |
9645 | ||
e9659ab0 | 9646 | static void |
830bfa74 MM |
9647 | regenerate_decl_from_template (decl, tmpl) |
9648 | tree decl; | |
9649 | tree tmpl; | |
9650 | { | |
f9a7ae04 MM |
9651 | /* The most general version of TMPL. */ |
9652 | tree gen_tmpl; | |
9653 | /* The arguments used to instantiate DECL, from the most general | |
9654 | template. */ | |
830bfa74 | 9655 | tree args; |
830bfa74 MM |
9656 | tree code_pattern; |
9657 | tree new_decl; | |
36a117a5 | 9658 | int unregistered; |
830bfa74 MM |
9659 | |
9660 | args = DECL_TI_ARGS (decl); | |
9661 | code_pattern = DECL_TEMPLATE_RESULT (tmpl); | |
9662 | ||
8251199e JM |
9663 | /* Unregister the specialization so that when we tsubst we will not |
9664 | just return DECL. We don't have to unregister DECL from TMPL | |
9665 | because if would only be registered there if it were a partial | |
9666 | instantiation of a specialization, which it isn't: it's a full | |
9667 | instantiation. */ | |
36a117a5 MM |
9668 | gen_tmpl = most_general_template (tmpl); |
9669 | unregistered = unregister_specialization (decl, gen_tmpl); | |
9670 | ||
9671 | /* If the DECL was not unregistered then something peculiar is | |
9672 | happening: we created a specialization but did not call | |
9673 | register_specialization for it. */ | |
9674 | my_friendly_assert (unregistered, 0); | |
9675 | ||
61a127b3 MM |
9676 | if (TREE_CODE (decl) == VAR_DECL) |
9677 | /* Make sure that we can see identifiers, and compute access | |
9678 | correctly, for the class members used in the declaration of | |
9679 | this static variable. */ | |
9680 | pushclass (DECL_CONTEXT (decl), 2); | |
9681 | ||
d8c4447d | 9682 | /* Do the substitution to get the new declaration. */ |
4393e105 | 9683 | new_decl = tsubst (code_pattern, args, /*complain=*/1, NULL_TREE); |
830bfa74 MM |
9684 | |
9685 | if (TREE_CODE (decl) == VAR_DECL) | |
9686 | { | |
9687 | /* Set up DECL_INITIAL, since tsubst doesn't. */ | |
830bfa74 | 9688 | DECL_INITIAL (new_decl) = |
d8c4447d | 9689 | tsubst_expr (DECL_INITIAL (code_pattern), args, |
4393e105 | 9690 | /*complain=*/1, DECL_TI_TEMPLATE (decl)); |
61a127b3 | 9691 | /* Pop the class context we pushed above. */ |
b74a0560 | 9692 | popclass (); |
830bfa74 | 9693 | } |
2b0a63a3 | 9694 | else if (TREE_CODE (decl) == FUNCTION_DECL) |
fbf1c34b MM |
9695 | { |
9696 | /* Convince duplicate_decls to use the DECL_ARGUMENTS from the | |
9697 | new decl. */ | |
9698 | DECL_INITIAL (new_decl) = error_mark_node; | |
9699 | /* And don't complain about a duplicate definition. */ | |
9700 | DECL_INITIAL (decl) = NULL_TREE; | |
9701 | } | |
36a117a5 MM |
9702 | |
9703 | /* The immediate parent of the new template is still whatever it was | |
9704 | before, even though tsubst sets DECL_TI_TEMPLATE up as the most | |
9705 | general template. We also reset the DECL_ASSEMBLER_NAME since | |
9706 | tsubst always calculates the name as if the function in question | |
9707 | were really a template instance, and sometimes, with friend | |
9708 | functions, this is not so. See tsubst_friend_function for | |
9709 | details. */ | |
9710 | DECL_TI_TEMPLATE (new_decl) = DECL_TI_TEMPLATE (decl); | |
92643fea | 9711 | COPY_DECL_ASSEMBLER_NAME (decl, new_decl); |
19e7881c | 9712 | COPY_DECL_RTL (decl, new_decl); |
459c43ad | 9713 | DECL_USE_TEMPLATE (new_decl) = DECL_USE_TEMPLATE (decl); |
36a117a5 MM |
9714 | |
9715 | /* Call duplicate decls to merge the old and new declarations. */ | |
830bfa74 MM |
9716 | duplicate_decls (new_decl, decl); |
9717 | ||
36a117a5 MM |
9718 | /* Now, re-register the specialization. */ |
9719 | register_specialization (decl, gen_tmpl, args); | |
830bfa74 MM |
9720 | } |
9721 | ||
16d53b64 MM |
9722 | /* Produce the definition of D, a _DECL generated from a template. If |
9723 | DEFER_OK is non-zero, then we don't have to actually do the | |
9724 | instantiation now; we just have to do it sometime. */ | |
f84b4be9 | 9725 | |
a28e3c7f | 9726 | tree |
16d53b64 | 9727 | instantiate_decl (d, defer_ok) |
5566b478 | 9728 | tree d; |
16d53b64 | 9729 | int defer_ok; |
a28e3c7f | 9730 | { |
36a117a5 MM |
9731 | tree tmpl = DECL_TI_TEMPLATE (d); |
9732 | tree args = DECL_TI_ARGS (d); | |
830bfa74 | 9733 | tree td; |
36a117a5 MM |
9734 | tree code_pattern; |
9735 | tree spec; | |
9736 | tree gen_tmpl; | |
5566b478 | 9737 | int pattern_defined; |
c27be9b9 | 9738 | int line = lineno; |
31a714f6 | 9739 | int need_push; |
3b304f5b | 9740 | const char *file = input_filename; |
5566b478 | 9741 | |
36a117a5 MM |
9742 | /* This function should only be used to instantiate templates for |
9743 | functions and static member variables. */ | |
9744 | my_friendly_assert (TREE_CODE (d) == FUNCTION_DECL | |
9745 | || TREE_CODE (d) == VAR_DECL, 0); | |
9746 | ||
db9b2174 MM |
9747 | /* Don't instantiate cloned functions. Instead, instantiate the |
9748 | functions they cloned. */ | |
9749 | if (TREE_CODE (d) == FUNCTION_DECL && DECL_CLONED_FUNCTION_P (d)) | |
9750 | d = DECL_CLONED_FUNCTION (d); | |
9751 | ||
fbf1c34b | 9752 | if (DECL_TEMPLATE_INSTANTIATED (d)) |
03d0f4af | 9753 | /* D has already been instantiated. It might seem reasonable to |
dc957d14 | 9754 | check whether or not D is an explicit instantiation, and, if so, |
03d0f4af MM |
9755 | stop here. But when an explicit instantiation is deferred |
9756 | until the end of the compilation, DECL_EXPLICIT_INSTANTIATION | |
9757 | is set, even though we still need to do the instantiation. */ | |
36a117a5 MM |
9758 | return d; |
9759 | ||
9760 | /* If we already have a specialization of this declaration, then | |
9761 | there's no reason to instantiate it. Note that | |
9762 | retrieve_specialization gives us both instantiations and | |
9763 | specializations, so we must explicitly check | |
9764 | DECL_TEMPLATE_SPECIALIZATION. */ | |
9765 | gen_tmpl = most_general_template (tmpl); | |
9766 | spec = retrieve_specialization (gen_tmpl, args); | |
9767 | if (spec != NULL_TREE && DECL_TEMPLATE_SPECIALIZATION (spec)) | |
9768 | return spec; | |
9769 | ||
9770 | /* This needs to happen before any tsubsting. */ | |
9771 | if (! push_tinst_level (d)) | |
9772 | return d; | |
9773 | ||
297a5329 JM |
9774 | timevar_push (TV_PARSE); |
9775 | ||
4d85e00e MM |
9776 | /* Set TD to the template whose DECL_TEMPLATE_RESULT is the pattern |
9777 | for the instantiation. This is not always the most general | |
9778 | template. Consider, for example: | |
9779 | ||
9780 | template <class T> | |
9781 | struct S { template <class U> void f(); | |
9782 | template <> void f<int>(); }; | |
9783 | ||
9784 | and an instantiation of S<double>::f<int>. We want TD to be the | |
9785 | specialization S<T>::f<int>, not the more general S<T>::f<U>. */ | |
9786 | td = tmpl; | |
f9a7ae04 MM |
9787 | while (/* An instantiation cannot have a definition, so we need a |
9788 | more general template. */ | |
9789 | DECL_TEMPLATE_INSTANTIATION (td) | |
9790 | /* We must also deal with friend templates. Given: | |
9791 | ||
9792 | template <class T> struct S { | |
9793 | template <class U> friend void f() {}; | |
9794 | }; | |
9795 | ||
9796 | S<int>::f<U> say, is not an instantiation of S<T>::f<U>, | |
9797 | so far as the language is concerned, but that's still | |
9798 | where we get the pattern for the instantiation from. On | |
dc957d14 | 9799 | other hand, if the definition comes outside the class, say: |
f9a7ae04 MM |
9800 | |
9801 | template <class T> struct S { | |
9802 | template <class U> friend void f(); | |
9803 | }; | |
9804 | template <class U> friend void f() {} | |
9805 | ||
9806 | we don't need to look any further. That's what the check for | |
9807 | DECL_INITIAL is for. */ | |
9808 | || (TREE_CODE (d) == FUNCTION_DECL | |
9809 | && DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (td) | |
9810 | && !DECL_INITIAL (DECL_TEMPLATE_RESULT (td)))) | |
4d85e00e MM |
9811 | { |
9812 | /* The present template, TD, should not be a definition. If it | |
9813 | were a definition, we should be using it! Note that we | |
9814 | cannot restructure the loop to just keep going until we find | |
9815 | a template with a definition, since that might go too far if | |
9816 | a specialization was declared, but not defined. */ | |
4d85e00e MM |
9817 | my_friendly_assert (!(TREE_CODE (d) == VAR_DECL |
9818 | && !DECL_IN_AGGR_P (DECL_TEMPLATE_RESULT (td))), | |
9819 | 0); | |
9820 | ||
9821 | /* Fetch the more general template. */ | |
9822 | td = DECL_TI_TEMPLATE (td); | |
9823 | } | |
27bb8339 | 9824 | |
fee23f54 | 9825 | code_pattern = DECL_TEMPLATE_RESULT (td); |
27bb8339 | 9826 | |
5566b478 | 9827 | if (TREE_CODE (d) == FUNCTION_DECL) |
39c76b4f | 9828 | pattern_defined = (DECL_SAVED_TREE (code_pattern) != NULL_TREE); |
5566b478 | 9829 | else |
36a117a5 | 9830 | pattern_defined = ! DECL_IN_AGGR_P (code_pattern); |
de22184b | 9831 | |
de22184b MS |
9832 | lineno = DECL_SOURCE_LINE (d); |
9833 | input_filename = DECL_SOURCE_FILE (d); | |
9834 | ||
de22184b | 9835 | if (pattern_defined) |
5566b478 | 9836 | { |
7e9abee9 MM |
9837 | /* Let the repository code that this template definition is |
9838 | available. | |
9839 | ||
9840 | The repository doesn't need to know about cloned functions | |
9841 | because they never actually show up in the object file. It | |
9842 | does need to know about the clones; those are the symbols | |
9843 | that the linker will be emitting error messages about. */ | |
9844 | if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (d) | |
9845 | || DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (d)) | |
9846 | { | |
9847 | tree t; | |
9848 | ||
9849 | for (t = TREE_CHAIN (d); | |
9850 | t && DECL_CLONED_FUNCTION_P (t); | |
9851 | t = TREE_CHAIN (t)) | |
9852 | repo_template_used (t); | |
9853 | } | |
9854 | else | |
9855 | repo_template_used (d); | |
5566b478 MS |
9856 | |
9857 | if (flag_external_templates && ! DECL_INTERFACE_KNOWN (d)) | |
9858 | { | |
9859 | if (flag_alt_external_templates) | |
9860 | { | |
9861 | if (interface_unknown) | |
9862 | warn_if_unknown_interface (d); | |
9863 | } | |
fee23f54 | 9864 | else if (DECL_INTERFACE_KNOWN (code_pattern)) |
5566b478 MS |
9865 | { |
9866 | DECL_INTERFACE_KNOWN (d) = 1; | |
fee23f54 | 9867 | DECL_NOT_REALLY_EXTERN (d) = ! DECL_EXTERNAL (code_pattern); |
5566b478 MS |
9868 | } |
9869 | else | |
fee23f54 | 9870 | warn_if_unknown_interface (code_pattern); |
5566b478 MS |
9871 | } |
9872 | ||
e92cc029 | 9873 | if (at_eof) |
5566b478 MS |
9874 | import_export_decl (d); |
9875 | } | |
9876 | ||
46ccf50a JM |
9877 | if (TREE_CODE (d) == VAR_DECL && DECL_INITIALIZED_IN_CLASS_P (d) |
9878 | && DECL_INITIAL (d) == NULL_TREE) | |
9879 | /* We should have set up DECL_INITIAL in instantiate_class_template. */ | |
9880 | abort (); | |
930cd796 MM |
9881 | /* Reject all external templates except inline functions. */ |
9882 | else if (DECL_INTERFACE_KNOWN (d) | |
9883 | && ! DECL_NOT_REALLY_EXTERN (d) | |
9884 | && ! (TREE_CODE (d) == FUNCTION_DECL && DECL_INLINE (d))) | |
9885 | goto out; | |
16d53b64 MM |
9886 | /* Defer all other templates, unless we have been explicitly |
9887 | forbidden from doing so. We restore the source position here | |
9888 | because it's used by add_pending_template. */ | |
9889 | else if (! pattern_defined || defer_ok) | |
9890 | { | |
c27be9b9 JM |
9891 | lineno = line; |
9892 | input_filename = file; | |
9893 | ||
03d0f4af MM |
9894 | if (at_eof && !pattern_defined |
9895 | && DECL_EXPLICIT_INSTANTIATION (d)) | |
9896 | /* [temp.explicit] | |
9897 | ||
9898 | The definition of a non-exported function template, a | |
9899 | non-exported member function template, or a non-exported | |
9900 | member function or static data member of a class template | |
9901 | shall be present in every translation unit in which it is | |
9902 | explicitly instantiated. */ | |
46ccf50a JM |
9903 | cp_pedwarn |
9904 | ("explicit instantiation of `%D' but no definition available", d); | |
03d0f4af | 9905 | |
5566b478 | 9906 | add_pending_template (d); |
de22184b | 9907 | goto out; |
5566b478 MS |
9908 | } |
9909 | ||
31a714f6 MM |
9910 | need_push = !global_bindings_p (); |
9911 | if (need_push) | |
9912 | push_to_top_level (); | |
414ea4aa | 9913 | |
2b0a63a3 MM |
9914 | /* We're now committed to instantiating this template. Mark it as |
9915 | instantiated so that recursive calls to instantiate_decl do not | |
9916 | try to instantiate it again. */ | |
fbf1c34b | 9917 | DECL_TEMPLATE_INSTANTIATED (d) = 1; |
120722ac | 9918 | |
2b0a63a3 MM |
9919 | /* Regenerate the declaration in case the template has been modified |
9920 | by a subsequent redeclaration. */ | |
9921 | regenerate_decl_from_template (d, td); | |
9922 | ||
120722ac MM |
9923 | /* We already set the file and line above. Reset them now in case |
9924 | they changed as a result of calling regenerate_decl_from_template. */ | |
5156628f MS |
9925 | lineno = DECL_SOURCE_LINE (d); |
9926 | input_filename = DECL_SOURCE_FILE (d); | |
9927 | ||
5566b478 MS |
9928 | if (TREE_CODE (d) == VAR_DECL) |
9929 | { | |
9930 | DECL_IN_AGGR_P (d) = 0; | |
9931 | if (DECL_INTERFACE_KNOWN (d)) | |
9932 | DECL_EXTERNAL (d) = ! DECL_NOT_REALLY_EXTERN (d); | |
9933 | else | |
9934 | { | |
9935 | DECL_EXTERNAL (d) = 1; | |
9936 | DECL_NOT_REALLY_EXTERN (d) = 1; | |
9937 | } | |
cd9f6678 | 9938 | cp_finish_decl (d, DECL_INITIAL (d), NULL_TREE, 0); |
5566b478 MS |
9939 | } |
9940 | else if (TREE_CODE (d) == FUNCTION_DECL) | |
9941 | { | |
6bbf1598 MM |
9942 | htab_t saved_local_specializations; |
9943 | ||
9944 | /* Save away the current list, in case we are instantiating one | |
9945 | template from within the body of another. */ | |
9946 | saved_local_specializations = local_specializations; | |
9947 | ||
6dfbb909 | 9948 | /* Set up the list of local specializations. */ |
6dfbb909 MM |
9949 | local_specializations = htab_create (37, |
9950 | htab_hash_pointer, | |
9951 | htab_eq_pointer, | |
9952 | NULL); | |
9953 | ||
558475f0 | 9954 | /* Set up context. */ |
a8f73d4b | 9955 | start_function (NULL_TREE, d, NULL_TREE, SF_PRE_PARSED); |
5566b478 | 9956 | |
558475f0 MM |
9957 | /* Substitute into the body of the function. */ |
9958 | tsubst_expr (DECL_SAVED_TREE (code_pattern), args, | |
9959 | /*complain=*/1, tmpl); | |
9960 | ||
6dfbb909 MM |
9961 | /* We don't need the local specializations any more. */ |
9962 | htab_delete (local_specializations); | |
6bbf1598 | 9963 | local_specializations = saved_local_specializations; |
6dfbb909 | 9964 | |
4d6abc1c | 9965 | /* Finish the function. */ |
0acf7199 | 9966 | expand_body (finish_function (0)); |
5566b478 MS |
9967 | } |
9968 | ||
971cbc14 MM |
9969 | /* We're not deferring instantiation any more. */ |
9970 | TI_PENDING_TEMPLATE_FLAG (DECL_TEMPLATE_INFO (d)) = 0; | |
9971 | ||
31a714f6 MM |
9972 | if (need_push) |
9973 | pop_from_top_level (); | |
414ea4aa | 9974 | |
de22184b | 9975 | out: |
c27be9b9 JM |
9976 | lineno = line; |
9977 | input_filename = file; | |
9978 | ||
5566b478 | 9979 | pop_tinst_level (); |
a28e3c7f | 9980 | |
297a5329 JM |
9981 | timevar_pop (TV_PARSE); |
9982 | ||
a28e3c7f MS |
9983 | return d; |
9984 | } | |
5566b478 | 9985 | |
0aafb128 MM |
9986 | /* Run through the list of templates that we wish we could |
9987 | instantiate, and instantiate any we can. */ | |
9988 | ||
9989 | int | |
9990 | instantiate_pending_templates () | |
9991 | { | |
9992 | tree *t; | |
46ccf50a | 9993 | tree last = NULL_TREE; |
0aafb128 MM |
9994 | int instantiated_something = 0; |
9995 | int reconsider; | |
9996 | ||
9997 | do | |
9998 | { | |
9999 | reconsider = 0; | |
10000 | ||
10001 | t = &pending_templates; | |
10002 | while (*t) | |
10003 | { | |
0aafb128 MM |
10004 | tree instantiation = TREE_VALUE (*t); |
10005 | ||
3ae18eaf | 10006 | reopen_tinst_level (TREE_PURPOSE (*t)); |
0aafb128 | 10007 | |
2f939d94 | 10008 | if (TYPE_P (instantiation)) |
0aafb128 MM |
10009 | { |
10010 | tree fn; | |
10011 | ||
d0f062fb | 10012 | if (!COMPLETE_TYPE_P (instantiation)) |
0aafb128 MM |
10013 | { |
10014 | instantiate_class_template (instantiation); | |
10015 | if (CLASSTYPE_TEMPLATE_INSTANTIATION (instantiation)) | |
10016 | for (fn = TYPE_METHODS (instantiation); | |
10017 | fn; | |
10018 | fn = TREE_CHAIN (fn)) | |
10019 | if (! DECL_ARTIFICIAL (fn)) | |
16d53b64 | 10020 | instantiate_decl (fn, /*defer_ok=*/0); |
d0f062fb | 10021 | if (COMPLETE_TYPE_P (instantiation)) |
0aafb128 MM |
10022 | { |
10023 | instantiated_something = 1; | |
10024 | reconsider = 1; | |
10025 | } | |
10026 | } | |
10027 | ||
d0f062fb | 10028 | if (COMPLETE_TYPE_P (instantiation)) |
0aafb128 MM |
10029 | /* If INSTANTIATION has been instantiated, then we don't |
10030 | need to consider it again in the future. */ | |
10031 | *t = TREE_CHAIN (*t); | |
46ccf50a JM |
10032 | else |
10033 | { | |
10034 | last = *t; | |
10035 | t = &TREE_CHAIN (*t); | |
10036 | } | |
0aafb128 MM |
10037 | } |
10038 | else | |
10039 | { | |
16d53b64 | 10040 | if (!DECL_TEMPLATE_SPECIALIZATION (instantiation) |
0aafb128 MM |
10041 | && !DECL_TEMPLATE_INSTANTIATED (instantiation)) |
10042 | { | |
16d53b64 MM |
10043 | instantiation = instantiate_decl (instantiation, |
10044 | /*defer_ok=*/0); | |
0aafb128 MM |
10045 | if (DECL_TEMPLATE_INSTANTIATED (instantiation)) |
10046 | { | |
10047 | instantiated_something = 1; | |
10048 | reconsider = 1; | |
10049 | } | |
10050 | } | |
10051 | ||
16d53b64 | 10052 | if (DECL_TEMPLATE_SPECIALIZATION (instantiation) |
0aafb128 MM |
10053 | || DECL_TEMPLATE_INSTANTIATED (instantiation)) |
10054 | /* If INSTANTIATION has been instantiated, then we don't | |
10055 | need to consider it again in the future. */ | |
10056 | *t = TREE_CHAIN (*t); | |
46ccf50a JM |
10057 | else |
10058 | { | |
10059 | last = *t; | |
10060 | t = &TREE_CHAIN (*t); | |
10061 | } | |
0aafb128 | 10062 | } |
84e5ca0f NS |
10063 | tinst_depth = 0; |
10064 | current_tinst_level = NULL_TREE; | |
0aafb128 | 10065 | } |
46ccf50a | 10066 | last_pending_template = last; |
0aafb128 MM |
10067 | } |
10068 | while (reconsider); | |
10069 | ||
10070 | return instantiated_something; | |
10071 | } | |
10072 | ||
fd74ca0b MM |
10073 | /* Substitute ARGVEC into T, which is a list of initializers for |
10074 | either base class or a non-static data member. The TREE_PURPOSEs | |
10075 | are DECLs, and the TREE_VALUEs are the initializer values. Used by | |
10076 | instantiate_decl. */ | |
4393e105 | 10077 | |
824b9a4c | 10078 | static tree |
fd74ca0b | 10079 | tsubst_initializer_list (t, argvec) |
5566b478 MS |
10080 | tree t, argvec; |
10081 | { | |
10082 | tree first = NULL_TREE; | |
10083 | tree *p = &first; | |
10084 | ||
10085 | for (; t; t = TREE_CHAIN (t)) | |
10086 | { | |
fd74ca0b MM |
10087 | tree decl; |
10088 | tree init; | |
10089 | tree val; | |
10090 | ||
10091 | decl = tsubst_copy (TREE_PURPOSE (t), argvec, /*complain=*/1, | |
10092 | NULL_TREE); | |
10093 | init = tsubst_expr (TREE_VALUE (t), argvec, /*complain=*/1, | |
10094 | NULL_TREE); | |
10095 | ||
10096 | if (!init) | |
10097 | ; | |
10098 | else if (TREE_CODE (init) == TREE_LIST) | |
10099 | for (val = init; val; val = TREE_CHAIN (val)) | |
10100 | TREE_VALUE (val) = convert_from_reference (TREE_VALUE (val)); | |
10101 | else | |
10102 | init = convert_from_reference (init); | |
10103 | ||
10104 | *p = build_tree_list (decl, init); | |
5566b478 MS |
10105 | p = &TREE_CHAIN (*p); |
10106 | } | |
10107 | return first; | |
10108 | } | |
10109 | ||
61a127b3 MM |
10110 | /* Set CURRENT_ACCESS_SPECIFIER based on the protection of DECL. */ |
10111 | ||
10112 | static void | |
10113 | set_current_access_from_decl (decl) | |
10114 | tree decl; | |
10115 | { | |
10116 | if (TREE_PRIVATE (decl)) | |
10117 | current_access_specifier = access_private_node; | |
10118 | else if (TREE_PROTECTED (decl)) | |
10119 | current_access_specifier = access_protected_node; | |
10120 | else | |
10121 | current_access_specifier = access_public_node; | |
10122 | } | |
10123 | ||
dbfe2124 MM |
10124 | /* Instantiate an enumerated type. TAG is the template type, NEWTAG |
10125 | is the instantiation (which should have been created with | |
10126 | start_enum) and ARGS are the template arguments to use. */ | |
b87692e5 | 10127 | |
dbfe2124 MM |
10128 | static void |
10129 | tsubst_enum (tag, newtag, args) | |
10130 | tree tag; | |
10131 | tree newtag; | |
10132 | tree args; | |
b87692e5 | 10133 | { |
dbfe2124 | 10134 | tree e; |
b87692e5 MS |
10135 | |
10136 | for (e = TYPE_VALUES (tag); e; e = TREE_CHAIN (e)) | |
10137 | { | |
61a127b3 | 10138 | tree value; |
58595203 | 10139 | |
61a127b3 MM |
10140 | /* Note that in a template enum, the TREE_VALUE is the |
10141 | CONST_DECL, not the corresponding INTEGER_CST. */ | |
10142 | value = tsubst_expr (DECL_INITIAL (TREE_VALUE (e)), | |
4393e105 MM |
10143 | args, /*complain=*/1, |
10144 | NULL_TREE); | |
61a127b3 MM |
10145 | |
10146 | /* Give this enumeration constant the correct access. */ | |
10147 | set_current_access_from_decl (TREE_VALUE (e)); | |
10148 | ||
10149 | /* Actually build the enumerator itself. */ | |
58595203 | 10150 | build_enumerator (TREE_PURPOSE (e), value, newtag); |
dbfe2124 | 10151 | } |
b3d5a58b | 10152 | |
219670f1 | 10153 | finish_enum (newtag); |
92777ce4 NS |
10154 | DECL_SOURCE_LINE (TYPE_NAME (newtag)) = DECL_SOURCE_LINE (TYPE_NAME (tag)); |
10155 | DECL_SOURCE_FILE (TYPE_NAME (newtag)) = DECL_SOURCE_FILE (TYPE_NAME (tag)); | |
b87692e5 | 10156 | } |
36a117a5 | 10157 | |
1f6e1acc AS |
10158 | /* DECL is a FUNCTION_DECL that is a template specialization. Return |
10159 | its type -- but without substituting the innermost set of template | |
10160 | arguments. So, innermost set of template parameters will appear in | |
10161 | the type. If CONTEXTP is non-NULL, then the partially substituted | |
10162 | DECL_CONTEXT (if any) will also be filled in. Similarly, TPARMSP | |
10163 | will be filled in with the substituted template parameters, if it | |
10164 | is non-NULL. */ | |
10165 | ||
10166 | tree | |
10167 | get_mostly_instantiated_function_type (decl, contextp, tparmsp) | |
10168 | tree decl; | |
10169 | tree *contextp; | |
10170 | tree *tparmsp; | |
10171 | { | |
10172 | tree context = NULL_TREE; | |
10173 | tree fn_type; | |
10174 | tree tmpl; | |
10175 | tree targs; | |
10176 | tree tparms; | |
10177 | int parm_depth; | |
10178 | ||
10179 | tmpl = most_general_template (DECL_TI_TEMPLATE (decl)); | |
10180 | targs = DECL_TI_ARGS (decl); | |
10181 | tparms = DECL_TEMPLATE_PARMS (tmpl); | |
10182 | parm_depth = TMPL_PARMS_DEPTH (tparms); | |
10183 | ||
10184 | /* There should be as many levels of arguments as there are levels | |
10185 | of parameters. */ | |
10186 | my_friendly_assert (parm_depth == TMPL_ARGS_DEPTH (targs), 0); | |
10187 | ||
10188 | fn_type = TREE_TYPE (tmpl); | |
10189 | if (DECL_STATIC_FUNCTION_P (decl)) | |
10190 | context = DECL_CONTEXT (decl); | |
10191 | ||
10192 | if (parm_depth == 1) | |
10193 | /* No substitution is necessary. */ | |
10194 | ; | |
10195 | else | |
10196 | { | |
10197 | int i; | |
10198 | tree partial_args; | |
10199 | ||
10200 | /* Replace the innermost level of the TARGS with NULL_TREEs to | |
dc957d14 | 10201 | let tsubst know not to substitute for those parameters. */ |
1f6e1acc AS |
10202 | partial_args = make_tree_vec (TREE_VEC_LENGTH (targs)); |
10203 | for (i = 1; i < TMPL_ARGS_DEPTH (targs); ++i) | |
10204 | SET_TMPL_ARGS_LEVEL (partial_args, i, | |
10205 | TMPL_ARGS_LEVEL (targs, i)); | |
10206 | SET_TMPL_ARGS_LEVEL (partial_args, | |
10207 | TMPL_ARGS_DEPTH (targs), | |
10208 | make_tree_vec (DECL_NTPARMS (tmpl))); | |
10209 | ||
10210 | /* Now, do the (partial) substitution to figure out the | |
10211 | appropriate function type. */ | |
10212 | fn_type = tsubst (fn_type, partial_args, /*complain=*/1, NULL_TREE); | |
10213 | if (DECL_STATIC_FUNCTION_P (decl)) | |
10214 | context = tsubst (context, partial_args, /*complain=*/1, NULL_TREE); | |
10215 | ||
10216 | /* Substitute into the template parameters to obtain the real | |
10217 | innermost set of parameters. This step is important if the | |
10218 | innermost set of template parameters contains value | |
10219 | parameters whose types depend on outer template parameters. */ | |
10220 | TREE_VEC_LENGTH (partial_args)--; | |
10221 | tparms = tsubst_template_parms (tparms, partial_args, /*complain=*/1); | |
10222 | } | |
10223 | ||
10224 | if (contextp) | |
10225 | *contextp = context; | |
10226 | if (tparmsp) | |
10227 | *tparmsp = tparms; | |
10228 | ||
10229 | return fn_type; | |
10230 | } | |
669ec2b4 | 10231 | |
cb753e49 | 10232 | /* Return truthvalue if we're processing a template different from |
dc957d14 | 10233 | the last one involved in diagnostics. */ |
cb753e49 GDR |
10234 | int |
10235 | problematic_instantiation_changed () | |
10236 | { | |
10237 | return last_template_error_tick != tinst_level_tick; | |
10238 | } | |
10239 | ||
10240 | /* Remember current template involved in diagnostics. */ | |
10241 | void | |
10242 | record_last_problematic_instantiation () | |
10243 | { | |
10244 | last_template_error_tick = tinst_level_tick; | |
10245 | } | |
10246 | ||
10247 | tree | |
10248 | current_instantiation () | |
10249 | { | |
10250 | return current_tinst_level; | |
10251 | } | |
db3f4e4e NS |
10252 | |
10253 | /* [temp.param] Check that template non-type parm TYPE is of an allowable | |
10254 | type. Return zero for ok, non-zero for disallowed. If COMPLAIN is | |
10255 | non-zero, then complain. */ | |
10256 | ||
10257 | static int | |
11b810f1 | 10258 | invalid_nontype_parm_type_p (type, complain) |
db3f4e4e NS |
10259 | tree type; |
10260 | int complain; | |
10261 | { | |
10262 | if (INTEGRAL_TYPE_P (type)) | |
10263 | return 0; | |
10264 | else if (POINTER_TYPE_P (type)) | |
10265 | return 0; | |
10266 | else if (TYPE_PTRMEM_P (type)) | |
10267 | return 0; | |
10268 | else if (TYPE_PTRMEMFUNC_P (type)) | |
10269 | return 0; | |
db3f4e4e NS |
10270 | else if (TREE_CODE (type) == TEMPLATE_TYPE_PARM) |
10271 | return 0; | |
10272 | else if (TREE_CODE (type) == TYPENAME_TYPE) | |
10273 | return 0; | |
10274 | ||
10275 | if (complain) | |
10276 | cp_error ("`%#T' is not a valid type for a template constant parameter", | |
10277 | type); | |
10278 | return 1; | |
10279 | } |